summaryrefslogtreecommitdiffstats
path: root/lib
Commit message (Collapse)AuthorAgeFilesLines
* Merge branch 'dev' into frameCompressYann Collet2018-02-012-35/+33
|\
| * Always prefer c++14 attributes if availableAsger Hautop Drewsen2018-01-311-4/+2
| |
| * Ensure LZ4_DEPRECATED("...") is before LZ4LIB_APIAsger Hautop Drewsen2018-01-312-31/+31
| | | | | | | | | | | | When using clang++ with std c++14 or c++17 you would get the error "an attribute list cannot appear here" when including "lz4.h" as the visibility attribute is before the c++ attribute. This ensures that the [[deprecated]] c++ attribute is before everything else in the function declarations.
* | refactored frameCompress exampleYann Collet2018-01-312-5/+10
|/ | | | to better reflect LZ4F API usage.
* [lz4hc] level == 0 means default, not level 1Nick Terrell2018-01-221-1/+1
|
* Change file format back to ASCII (from UTF-8)Po-Chuan Hsieh2018-01-171-2/+2
| | | | | | | - Replace U+00A0 by space - Fix build failure of archivers/py-borgbackup in FreeBSD Reference: https://bugs.FreeBSD.org/225235
* lz4frame : removed some intermediate stage from LZ4F_decompress()Yann Collet2018-01-141-16/+6
| | | | | ensure some strange jump cases are not possible (they were already not possible, but static analyzer couldn't understand it).
* ensure a ptr is non-nullYann Collet2018-01-141-0/+9
| | | | | with an assert() to help static analyzer understanding this condition.
* modified formulation for LZ4F_compressBound()Yann Collet2018-01-142-24/+24
| | | | | | previous version used an intentional overflow, which is defined since it uses unsigned type, but static analyzer complain about it.
* Fix lz4 versionPo-Chuan Hsieh2018-01-131-1/+1
|
* updated LZ4F_decompress() documentationYann Collet2018-01-131-11/+16
|
* Merge pull request #443 from terrelln/440Yann Collet2018-01-101-2/+4
|\ | | | | [lz4f] Skip memcpy() on empty dictionary
| * [lz4f] Skip memcpy() on empty dictionaryNick Terrell2018-01-051-2/+4
| |
* | Add Option to Make lz4frame_static.h Functions Visible in Shared ObjectsW. Felix Handte2018-01-081-16/+27
| | | | | | | | | | | | | | | | | | | | In some contexts, *cough*like at facebook*cough*, dynamic linking is used in contexts which aren't truly dynamic. That is, the guarantee is maintained that a program will only ever execute against the library version it was compiled to interact with. For those situations, introduce a compile-time flag that overrides hiding these unstable APIs in shared objects.
* | Merge pull request #434 from lz4/patternYann Collet2018-01-062-8/+17
|\ \ | | | | | | conditional pattern analysis
| * | conditional pattern analysisYann Collet2017-12-222-8/+17
| |/ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | Pattern analysis (currently limited to long ranges of identical bytes) is actually detrimental to performance when `nbSearches` is low. Reason is : `nbSearches` provides a built-in protection for these cases. The problem with patterns is that they dramatically increase the number of candidates to visit. But with a low nbSearches, the match finder just aborts early. In such cases, pattern analysis adds some complexity without reducing total nb of candidates. It actually increases compression ratio a little bit, by filtering only "good" candidates, but at a measurable speed cost, so it's not a good trade-off. This patch makes pattern analysis optional. It's enabled for levels 8+ only.
* | lz4opt supports _destSizeYann Collet2017-12-222-26/+49
|/ | | | no longer limited to level 9
* new level 10Yann Collet2017-12-202-15/+39
| | | | | | | | | | | | lz4opt is only competitive vs lz4hc level 10. Below that level, it doesn't match the speed / compression effectiveness of regular hc parser. This patch propose to extend lz4opt to levels 10-12. The new level 10 tend to compress a bit better and a bit faster than previous one (mileage vary depending on file) The only downside is that `limitedDestSize` mode is now limited to max level 9 (vs 10), since it's only compatible with regular HC parser. (Note : I suspect it's possible to convert lz4opt to support it too, but haven't spent time into it).
* remove `register` keywordYann Collet2017-12-051-13/+13
| | | | | deprecated in newer C++ versions, and dubious utility
* API : changed a few variables' names for clarityYann Collet2017-11-201-44/+44
| | | | | updated relevant doc. This patch has no impact on ABI/API, nor on binary generation.
* Merge pull request #416 from lz4/newoptYann Collet2017-11-096-391/+415
|\ | | | | Improve Optimal parser
| * added code commentsYann Collet2017-11-091-1/+6
| |
| * added constant TRAILING_LITERALSYann Collet2017-11-091-5/+6
| | | | | | | | | | which is more explicit than its value `3`. reported by @terrelln
| * lz4opt: simplified match finder invocation to LZ4HC_FindLongerMatch()Yann Collet2017-11-092-21/+12
| |
| * added code commentsYann Collet2017-11-081-5/+8
| |
| * fixed LZ4HC_reverseCountPattern()Yann Collet2017-11-081-6/+5
| | | | | | | | | | for multi-bytes patterns (which is not useful for the time being)
| * removed the ip++ at the beginning of blockYann Collet2017-11-082-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 Collet2017-11-071-53/+1
| |
| * ensure `pattern` is a 1-byte repetitionYann Collet2017-11-071-1/+2
| |
| * removed useless `(1 && ...)` conditionYann Collet2017-11-071-3/+4
| | | | | | | | as reported by @terrelln
| * improved LZ4HC_reverseCountPattern() :Yann Collet2017-11-071-3/+7
| | | | | | | | | | works for any repetitive pattern of length 1, 2 or 4 (but not 3!) works for any endianess
| * fixed LZ4HC_countPattern()Yann Collet2017-11-071-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 warningYann Collet2017-11-031-1/+0
| | | | | | | | dead assignment
| * minor comment editYann Collet2017-11-033-33/+29
| |
| * unified HC levelsYann Collet2017-11-032-10/+5
| | | | | | | | | | 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.
generated by cgit v0.12 at 2025-03-25 13:21:02 (GMT)