summaryrefslogtreecommitdiffstats
Commit message (Collapse)AuthorAgeFilesLines
...
| * unified HC levelsYann Collet2017-11-033-16/+11
| | | | | | | | | | LZ4_setCompressionLevel() can be users accross the whole range of HC levels No more transition issue between Optimal and HC modes
| * moved ctx->end handling from parsersYann Collet2017-11-032-3/+2
| | | | | | | | responsibility better handled one layer above (LZ4HC_compress_generic())
| * removed ctx->searchNumYann Collet2017-11-033-26/+12
| | | | | | | | | | nbSearches now transmitted directly as function parameter easier to track and debug
| * LZ4_compress_HC_continue_destSize() now compatible with optimal parserYann Collet2017-11-033-12/+13
| | | | | | | | levels 11+
| * removes matches[] tableYann Collet2017-11-031-73/+67
| | | | | | | | | | saves stack space clearer match finder interface (no more table to fill)
| * removed useless parameter from hash chain matchfinderYann Collet2017-11-031-5/+4
| | | | | | | | used to be present for compatibility with binary tree matchfinder
| * removed code and reference to binary tree match finderYann Collet2017-11-033-132/+6
| | | | | | | | reduced size of LZ4HC state
| * improved level 11 speedYann Collet2017-11-031-2/+4
| |
| * optimized skip strategy for level 12Yann Collet2017-11-031-3/+6
| |
| * new level 11 uses 512 attemptsYann Collet2017-11-031-1/+1
| |
| * more generic skip formulaYann Collet2017-11-032-14/+5
| | | | | | | | improving speed
| * small adaptations for intermediate level 11Yann Collet2017-11-022-7/+6
| |
| * partial search, while preserving compression ratioYann Collet2017-11-022-2/+16
| | | | | | | | tag interesting places
| * searching match leading strictly farther does not workYann Collet2017-11-021-1/+1
| | | | | | | | | | sometimes, it's better to re-use same match but start it later, in order to get shorter matchlength code
| * fixed last lost bytes in maximal modeYann Collet2017-11-023-12/+20
| | | | | | | | | | even gained 2 bytes on calgary.tar... added conditional traces `g_debuglog_enable`
| * changed strategy : opt[] path is complete after each matchYann Collet2017-11-022-40/+71
| | | | | | | | | | | | | | previous strategy would leave a few "bad choices" on the ground they would be fixed later, but that requires passing through each position to make the fix and cannot give the end position of the last useful match.
| * Merge branch 'dev' into btoptYann Collet2017-11-018-80/+338
| |\
| * | fixed minor overflow mistake in optimal parserYann Collet2017-10-311-1/+5
| | | | | | | | | | | | saving 20 bytes on calgary.tar
| * | fixed minor initialization warningYann Collet2017-10-301-1/+1
| | |
| * | added hash chain with conditional lengthYann Collet2017-10-252-10/+2
| | | | | | | | | | | | not a success yet
| * | lz4opt: added hash chain searchYann Collet2017-10-213-24/+63
| | |
| * | switched many types to intYann Collet2017-10-201-38/+37
| | |
| * | removed SET_PRICE macroYann Collet2017-10-201-17/+14
| | |
| * | removed one macro usageYann Collet2017-10-201-4/+11
| | |
| * | minor refactorYann Collet2017-10-201-28/+35
| | | | | | | | | | | | | | | reduce variable scope remove one macro usage
| * | lz4opt: refactor sequence reverse traversalYann Collet2017-10-201-10/+20
| | |
| * | refactor variable matchnumYann Collet2017-10-201-14/+14
| | | | | | | | | | | | | | | separate initial and iterative search renamed nb_matches
| * | simplified initial cost conditionsYann Collet2017-10-201-10/+15
| | | | | | | | | | | | llen integrated in opt[]
| * | added assertYann Collet2017-10-192-1/+9
| | |
| * | renamed last_pos into last_match_posYann Collet2017-10-191-15/+15
| | |
| * | simplified early exit when single solutionYann Collet2017-10-191-5/+5
| | |
| * | fused getLongerMatch and getWiderMatchYann Collet2017-10-091-1/+1
| | |
| * | re-inserted last byte test in widerMatchYann Collet2017-10-091-19/+22
| | |
| * | early out is not betterYann Collet2017-10-092-2/+1
| | |
| * | optional fuseYann Collet2017-10-091-68/+53
| | |
| * | improved search of rep-1 patternsYann Collet2017-10-091-27/+131
| | |
| * | insertAndFindBestMatch defers to insertAndGetWiderMatchYann Collet2017-10-091-3/+13
| | |
* | | Merge pull request #418 from lz4/fasterCountYann Collet2017-11-071-2/+11
|\ \ \ | | | | | | | | faster LZ4_count()
| * | | added LZ4_FORCEINLINE to counter gcc regressionYann Collet2017-11-071-1/+2
| | | | | | | | | | | | | | | | as recommended by @terrelln
| * | | 2-stages LZ4_countYann Collet2017-11-061-1/+9
|/ / / | | | | | | | | | | | | | | | | | | separate first branch from the rest of the compare loop to get dedicated prediction. measured a 3-4% compression speed improvement.
* | | build: minor : `make lz4` doesn't compile liblz4 anymoreYann Collet2017-11-061-3/+3
| | | | | | | | | | | | since it's not needed.
* | | Merge pull request #417 from sylvestre/devYann Collet2017-11-061-1/+12
|\ \ \ | | | | | | | | When building with a C++ compiler, remove the 'register' keyword to silent a warning
| * | | Only ignore with C++17Sylvestre Ledru2017-11-061-3/+3
| | | |
| * | | When building with a C++ compiler, remove the 'register' keyword to silent a ↵Sylvestre Ledru2017-11-051-1/+12
|/ / / | | | | | | | | | | | | | | | | | | | | | | | | | | | warning For example, with clang: lz4.c:XXX:36: error: 'register' storage class specifier is deprecated and incompatible with C++17 [-Werror,-Wdeprecated-register] static unsigned LZ4_NbCommonBytes (register reg_t val) ^~~~~~~~~
* | | Merge pull request #415 from lz4/fasterDecodingXpYann Collet2017-11-011-9/+27
|\ \ \ | |_|/ |/| | Faster decoding xp
| * | minor change, to help store forwardingYann Collet2017-10-311-6/+5
| | | | | | | | | | | | in a marginal case (offset==4)
| * | extended shortcut match length to 18Yann Collet2017-10-311-5/+6
| | |
| * | minor : coding style : use ML_MASK constantYann Collet2017-10-311-2/+2
| | |
| * | added comments, as suggested by @terrellnYann Collet2017-10-311-4/+5
| | |
| * | more complete shortcut - passes testsYann Collet2017-10-301-12/+13
| | |
generated by cgit v0.12 at 2024-07-19 11:32:34 (GMT)