Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Merge pull request #424 from MaxRis/msbuild-properties-#423 | Yann Collet | 2017-12-11 | 9 | -17/+49 |
|\ | | | | | Msbuild properties #423 | ||||
| * | EnableWholeProgramOptimization and UseStaticCRT msbuild custom properties | Max Risuhin | 2017-12-11 | 9 | -17/+49 |
|/ | |||||
* | Merge pull request #426 from aliceatlas/cli_chmod_fix | Yann Collet | 2017-12-04 | 1 | -1/+1 |
|\ | | | | | Fix cli sometimes calling UTIL_setFileStat on /dev/null | ||||
| * | Fix bug which could sometimes result in the lz4 cli chmodding /dev/null if ↵ | Alice Atlas | 2017-12-04 | 1 | -1/+1 |
|/ | | | | running as root | ||||
* | minor updates to examples | Yann Collet | 2017-11-25 | 8 | -66/+67 |
| | | | | see https://github.com/lz4/lz4/commit/810e2ca27b3561e0f6bfa7a88e0fde6faf807064#commitcomment-25810887 | ||||
* | API : changed a few variables' names for clarity | Yann Collet | 2017-11-20 | 2 | -87/+87 |
| | | | | | updated relevant doc. This patch has no impact on ABI/API, nor on binary generation. | ||||
* | updated NEWS | Yann Collet | 2017-11-13 | 1 | -1/+6 |
| | |||||
* | Merge pull request #416 from lz4/newopt | Yann Collet | 2017-11-09 | 7 | -397/+421 |
|\ | | | | | Improve Optimal parser | ||||
| * | added code comments | Yann Collet | 2017-11-09 | 1 | -1/+6 |
| | | |||||
| * | added constant TRAILING_LITERALS | Yann Collet | 2017-11-09 | 1 | -5/+6 |
| | | | | | | | | | | which is more explicit than its value `3`. reported by @terrelln | ||||
| * | lz4opt: simplified match finder invocation to LZ4HC_FindLongerMatch() | Yann Collet | 2017-11-09 | 2 | -21/+12 |
| | | |||||
| * | added code comments | Yann Collet | 2017-11-08 | 1 | -5/+8 |
| | | |||||
| * | fixed LZ4HC_reverseCountPattern() | Yann Collet | 2017-11-08 | 1 | -6/+5 |
| | | | | | | | | | | for multi-bytes patterns (which is not useful for the time being) | ||||
| * | removed the ip++ at the beginning of block | Yann Collet | 2017-11-08 | 2 | -3/+0 |
| | | | | | | | | | | | | | | | | | | | | | | | | | | The first byte used to be skipped to avoid a infinite self-comparison. This is no longer necessary, since init() ensures that index starts at 64K. The first byte is also useless to search when each block is independent, but it's no longer the case when blocks are linked. Removing the first-byte-skip saves about 10 bytes / MB on files compressed with -BD4 (linked blocks 64Kb), which feels correct as each MB has 16 blocks of 64KB. | ||||
| * | removed legacy version of LZ4HC_InsertAndFindBestMatch() | Yann Collet | 2017-11-07 | 1 | -53/+1 |
| | | |||||
| * | ensure `pattern` is a 1-byte repetition | Yann Collet | 2017-11-07 | 1 | -1/+2 |
| | | |||||
| * | removed useless `(1 && ...)` condition | Yann Collet | 2017-11-07 | 1 | -3/+4 |
| | | | | | | | | as reported by @terrelln | ||||
| * | improved LZ4HC_reverseCountPattern() : | Yann Collet | 2017-11-07 | 1 | -3/+7 |
| | | | | | | | | | | works for any repetitive pattern of length 1, 2 or 4 (but not 3!) works for any endianess | ||||
| * | fixed LZ4HC_countPattern() | Yann Collet | 2017-11-07 | 1 | -5/+19 |
| | | | | | | | | | | | | | | - works with byte values other than `0` - works for any repetitive pattern of length 1, 2 or 4 (but not 3!) - works for little and big endian systems - preserve speed of previous implementation | ||||
| * | fixed minor static analyzer warning | Yann Collet | 2017-11-03 | 1 | -1/+0 |
| | | | | | | | | dead assignment | ||||
| * | minor comment edit | Yann Collet | 2017-11-03 | 3 | -33/+29 |
| | | |||||
| * | unified HC levels | Yann Collet | 2017-11-03 | 3 | -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 parsers | Yann Collet | 2017-11-03 | 2 | -3/+2 |
| | | | | | | | | responsibility better handled one layer above (LZ4HC_compress_generic()) | ||||
| * | removed ctx->searchNum | Yann Collet | 2017-11-03 | 3 | -26/+12 |
| | | | | | | | | | | nbSearches now transmitted directly as function parameter easier to track and debug | ||||
| * | LZ4_compress_HC_continue_destSize() now compatible with optimal parser | Yann Collet | 2017-11-03 | 3 | -12/+13 |
| | | | | | | | | levels 11+ | ||||
| * | removes matches[] table | Yann Collet | 2017-11-03 | 1 | -73/+67 |
| | | | | | | | | | | saves stack space clearer match finder interface (no more table to fill) | ||||
| * | removed useless parameter from hash chain matchfinder | Yann Collet | 2017-11-03 | 1 | -5/+4 |
| | | | | | | | | used to be present for compatibility with binary tree matchfinder | ||||
| * | removed code and reference to binary tree match finder | Yann Collet | 2017-11-03 | 3 | -132/+6 |
| | | | | | | | | reduced size of LZ4HC state | ||||
| * | improved level 11 speed | Yann Collet | 2017-11-03 | 1 | -2/+4 |
| | | |||||
| * | optimized skip strategy for level 12 | Yann Collet | 2017-11-03 | 1 | -3/+6 |
| | | |||||
| * | new level 11 uses 512 attempts | Yann Collet | 2017-11-03 | 1 | -1/+1 |
| | | |||||
| * | more generic skip formula | Yann Collet | 2017-11-03 | 2 | -14/+5 |
| | | | | | | | | improving speed | ||||
| * | small adaptations for intermediate level 11 | Yann Collet | 2017-11-02 | 2 | -7/+6 |
| | | |||||
| * | partial search, while preserving compression ratio | Yann Collet | 2017-11-02 | 2 | -2/+16 |
| | | | | | | | | tag interesting places | ||||
| * | searching match leading strictly farther does not work | Yann Collet | 2017-11-02 | 1 | -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 mode | Yann Collet | 2017-11-02 | 3 | -12/+20 |
| | | | | | | | | | | even gained 2 bytes on calgary.tar... added conditional traces `g_debuglog_enable` | ||||
| * | changed strategy : opt[] path is complete after each match | Yann Collet | 2017-11-02 | 2 | -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 btopt | Yann Collet | 2017-11-01 | 8 | -80/+338 |
| |\ | |||||
| * | | fixed minor overflow mistake in optimal parser | Yann Collet | 2017-10-31 | 1 | -1/+5 |
| | | | | | | | | | | | | saving 20 bytes on calgary.tar | ||||
| * | | fixed minor initialization warning | Yann Collet | 2017-10-30 | 1 | -1/+1 |
| | | | |||||
| * | | added hash chain with conditional length | Yann Collet | 2017-10-25 | 2 | -10/+2 |
| | | | | | | | | | | | | not a success yet | ||||
| * | | lz4opt: added hash chain search | Yann Collet | 2017-10-21 | 3 | -24/+63 |
| | | | |||||
| * | | switched many types to int | Yann Collet | 2017-10-20 | 1 | -38/+37 |
| | | | |||||
| * | | removed SET_PRICE macro | Yann Collet | 2017-10-20 | 1 | -17/+14 |
| | | | |||||
| * | | removed one macro usage | Yann Collet | 2017-10-20 | 1 | -4/+11 |
| | | | |||||
| * | | minor refactor | Yann Collet | 2017-10-20 | 1 | -28/+35 |
| | | | | | | | | | | | | | | | reduce variable scope remove one macro usage | ||||
| * | | lz4opt: refactor sequence reverse traversal | Yann Collet | 2017-10-20 | 1 | -10/+20 |
| | | | |||||
| * | | refactor variable matchnum | Yann Collet | 2017-10-20 | 1 | -14/+14 |
| | | | | | | | | | | | | | | | separate initial and iterative search renamed nb_matches | ||||
| * | | simplified initial cost conditions | Yann Collet | 2017-10-20 | 1 | -10/+15 |
| | | | | | | | | | | | | llen integrated in opt[] | ||||
| * | | added assert | Yann Collet | 2017-10-19 | 2 | -1/+9 |
| | | |