slightly nudge choices towards less sequences

also slightly improve some strange detrimental corner cases.

diff --git a/lib/compress/zstd_opt.c b/lib/compress/zstd_opt.c
index 2a699c2ac937187f832da699df3f9e0bee6f28e9..e66019aa886762fe6d550b0aca028ed5b047510d 100644 (file)
--- a/lib/compress/zstd_opt.c
+++ b/lib/compress/zstd_opt.c
@@ -282,6 +282,8 @@ ZSTD_getMatchPrice(U32 const offset,
         price += (ML_bits[mlCode] * BITCOST_MULTIPLIER) + (optPtr->matchLengthSumBasePrice - WEIGHT(optPtr->matchLengthFreq[mlCode], optLevel));
     }
 
+    price += BITCOST_MULTIPLIER / 5;   /* heuristic : make matches a bit more costly to favor less sequences -> faster decompression speed */
+
     DEBUGLOG(8, "ZSTD_getMatchPrice(ml:%u) = %u", matchLength, price);
     return price;
 }