2 * LZ4 - Fast LZ compression algorithm
3 * Copyright (C) 2011 - 2016, Yann Collet.
4 * BSD 2 - Clause License (http://www.opensource.org/licenses/bsd - license.php)
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
8 * * Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * * Redistributions in binary form must reproduce the above
11 * copyright notice, this list of conditions and the following disclaimer
12 * in the documentation and/or other materials provided with the
14 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
15 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
16 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
17 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
18 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
19 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
20 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
24 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
25 * You can contact the author at :
26 * - LZ4 homepage : http://www.lz4.org
27 * - LZ4 source repository : https://github.com/lz4/lz4
29 * Changed for kernel usage by:
30 * Sven Schmidt <4sschmid@informatik.uni-hamburg.de>
33 /*-************************************
35 **************************************/
36 #include <linux/lz4.h>
38 #include <linux/init.h>
39 #include <linux/module.h>
40 #include <linux/kernel.h>
41 #include <asm/unaligned.h>
43 /*-*****************************
44 * Decompression functions
45 *******************************/
47 #define DEBUGLOG(l, ...) {} /* disabled */
50 #define assert(condition) ((void)0)
54 * LZ4_decompress_generic() :
55 * This generic decompression function covers all use cases.
56 * It shall be instantiated several times, using different sets of directives.
57 * Note that it is important for performance that this function really get inlined,
58 * in order to remove useless branches during compilation optimization.
60 static FORCE_INLINE
int LZ4_decompress_generic(
61 const char * const src
,
65 * If endOnInput == endOnInputSize,
66 * this value is `dstCapacity`
69 /* endOnOutputSize, endOnInputSize */
70 endCondition_directive endOnInput
,
72 earlyEnd_directive partialDecoding
,
73 /* noDict, withPrefix64k, usingExtDict */
75 /* always <= dst, == dst when no prefix */
76 const BYTE
* const lowPrefix
,
77 /* only if dict == usingExtDict */
78 const BYTE
* const dictStart
,
79 /* note : = 0 if noDict */
83 const BYTE
*ip
= (const BYTE
*) src
;
84 const BYTE
* const iend
= ip
+ srcSize
;
86 BYTE
*op
= (BYTE
*) dst
;
87 BYTE
* const oend
= op
+ outputSize
;
90 const BYTE
* const dictEnd
= (const BYTE
*)dictStart
+ dictSize
;
91 static const unsigned int inc32table
[8] = {0, 1, 2, 1, 0, 4, 4, 4};
92 static const int dec64table
[8] = {0, 0, 0, -1, -4, 1, 2, 3};
94 const int safeDecode
= (endOnInput
== endOnInputSize
);
95 const int checkOffset
= ((safeDecode
) && (dictSize
< (int)(64 * KB
)));
97 /* Set up the "end" pointers for the shortcut. */
98 const BYTE
*const shortiend
= iend
-
99 (endOnInput
? 14 : 8) /*maxLL*/ - 2 /*offset*/;
100 const BYTE
*const shortoend
= oend
-
101 (endOnInput
? 14 : 8) /*maxLL*/ - 18 /*maxML*/;
103 DEBUGLOG(5, "%s (srcSize:%i, dstSize:%i)", __func__
,
104 srcSize
, outputSize
);
107 assert(lowPrefix
<= op
);
110 /* Empty output buffer */
111 if ((endOnInput
) && (unlikely(outputSize
== 0)))
112 return ((srcSize
== 1) && (*ip
== 0)) ? 0 : -1;
114 if ((!endOnInput
) && (unlikely(outputSize
== 0)))
115 return (*ip
== 0 ? 1 : -1);
117 if ((endOnInput
) && unlikely(srcSize
== 0))
120 /* Main Loop : decode sequences */
126 /* get literal length */
127 unsigned int const token
= *ip
++;
128 length
= token
>>ML_BITS
;
130 /* ip < iend before the increment */
131 assert(!endOnInput
|| ip
<= iend
);
134 * A two-stage shortcut for the most common case:
135 * 1) If the literal length is 0..14, and there is enough
136 * space, enter the shortcut and copy 16 bytes on behalf
137 * of the literals (in the fast mode, only 8 bytes can be
138 * safely copied this way).
139 * 2) Further if the match length is 4..18, copy 18 bytes
140 * in a similar manner; but we ensure that there's enough
141 * space in the output for those 18 bytes earlier, upon
142 * entering the shortcut (in other words, there is a
143 * combined check for both stages).
145 if ((endOnInput
? length
!= RUN_MASK
: length
<= 8)
147 * strictly "less than" on input, to re-enter
148 * the loop with at least one byte
150 && likely((endOnInput
? ip
< shortiend
: 1) &
151 (op
<= shortoend
))) {
152 /* Copy the literals */
153 memcpy(op
, ip
, endOnInput
? 16 : 8);
154 op
+= length
; ip
+= length
;
158 * prepare for match copying, decode full info.
159 * If it doesn't work out, the info won't be wasted.
161 length
= token
& ML_MASK
; /* match length */
162 offset
= LZ4_readLE16(ip
);
165 assert(match
<= op
); /* check overflow */
167 /* Do not deal with overlapping matches. */
168 if ((length
!= ML_MASK
) &&
170 (dict
== withPrefix64k
|| match
>= lowPrefix
)) {
171 /* Copy the match. */
172 memcpy(op
+ 0, match
+ 0, 8);
173 memcpy(op
+ 8, match
+ 8, 8);
174 memcpy(op
+ 16, match
+ 16, 2);
175 op
+= length
+ MINMATCH
;
176 /* Both stages worked, load the next token. */
181 * The second stage didn't work out, but the info
182 * is ready. Propel it right to the point of match
188 /* decode literal length */
189 if (length
== RUN_MASK
) {
192 if (unlikely(endOnInput
? ip
>= iend
- RUN_MASK
: 0)) {
193 /* overflow detection */
199 } while (likely(endOnInput
200 ? ip
< iend
- RUN_MASK
204 && unlikely((uptrval
)(op
) +
205 length
< (uptrval
)(op
))) {
206 /* overflow detection */
210 && unlikely((uptrval
)(ip
) +
211 length
< (uptrval
)(ip
))) {
212 /* overflow detection */
219 LZ4_STATIC_ASSERT(MFLIMIT
>= WILDCOPYLENGTH
);
221 if (((endOnInput
) && ((cpy
> oend
- MFLIMIT
)
222 || (ip
+ length
> iend
- (2 + 1 + LASTLITERALS
))))
223 || ((!endOnInput
) && (cpy
> oend
- WILDCOPYLENGTH
))) {
224 if (partialDecoding
) {
228 * stop in the middle of literal segment
234 && (ip
+ length
> iend
)) {
237 * read attempt beyond
238 * end of input buffer
247 * block decoding must
253 && ((ip
+ length
!= iend
)
257 * input must be consumed
263 memcpy(op
, ip
, length
);
267 /* Necessarily EOF, due to parsing restrictions */
268 if (!partialDecoding
|| (cpy
== oend
))
271 /* may overwrite up to WILDCOPYLENGTH beyond cpy */
272 LZ4_wildCopy(op
, ip
, cpy
);
278 offset
= LZ4_readLE16(ip
);
282 /* get matchlength */
283 length
= token
& ML_MASK
;
286 if ((checkOffset
) && (unlikely(match
+ dictSize
< lowPrefix
))) {
287 /* Error : offset outside buffers */
291 /* costs ~1%; silence an msan warning when offset == 0 */
293 * note : when partialDecoding, there is no guarantee that
294 * at least 4 bytes remain available in output buffer
296 if (!partialDecoding
) {
298 assert(oend
- op
>= 4);
300 LZ4_write32(op
, (U32
)offset
);
303 if (length
== ML_MASK
) {
309 if ((endOnInput
) && (ip
> iend
- LASTLITERALS
))
317 (uptrval
)(op
) + length
< (uptrval
)op
)) {
318 /* overflow detection */
325 /* match starting within external dictionary */
326 if ((dict
== usingExtDict
) && (match
< lowPrefix
)) {
327 if (unlikely(op
+ length
> oend
- LASTLITERALS
)) {
328 /* doesn't respect parsing restriction */
329 if (!partialDecoding
)
331 length
= min(length
, (size_t)(oend
- op
));
334 if (length
<= (size_t)(lowPrefix
- match
)) {
336 * match fits entirely within external
337 * dictionary : just copy
339 memmove(op
, dictEnd
- (lowPrefix
- match
),
344 * match stretches into both external
345 * dictionary and current block
347 size_t const copySize
= (size_t)(lowPrefix
- match
);
348 size_t const restSize
= length
- copySize
;
350 memcpy(op
, dictEnd
- copySize
, copySize
);
352 if (restSize
> (size_t)(op
- lowPrefix
)) {
354 BYTE
* const endOfMatch
= op
+ restSize
;
355 const BYTE
*copyFrom
= lowPrefix
;
357 while (op
< endOfMatch
)
360 memcpy(op
, lowPrefix
, restSize
);
367 /* copy match within block */
372 * may not respect endBlock parsing restrictions
375 if (partialDecoding
&&
376 (cpy
> oend
- MATCH_SAFEGUARD_DISTANCE
)) {
377 size_t const mlen
= min(length
, (size_t)(oend
- op
));
378 const BYTE
* const matchEnd
= match
+ mlen
;
379 BYTE
* const copyEnd
= op
+ mlen
;
386 memcpy(op
, match
, mlen
);
394 if (unlikely(offset
< 8)) {
399 match
+= inc32table
[offset
];
400 memcpy(op
+ 4, match
, 4);
401 match
-= dec64table
[offset
];
403 LZ4_copy8(op
, match
);
409 if (unlikely(cpy
> oend
- MATCH_SAFEGUARD_DISTANCE
)) {
410 BYTE
* const oCopyLimit
= oend
- (WILDCOPYLENGTH
- 1);
412 if (cpy
> oend
- LASTLITERALS
) {
414 * Error : last LASTLITERALS bytes
415 * must be literals (uncompressed)
420 if (op
< oCopyLimit
) {
421 LZ4_wildCopy(op
, match
, oCopyLimit
);
422 match
+= oCopyLimit
- op
;
428 LZ4_copy8(op
, match
);
430 LZ4_wildCopy(op
+ 8, match
+ 8, cpy
);
432 op
= cpy
; /* wildcopy correction */
435 /* end of decoding */
437 /* Nb of output bytes decoded */
438 return (int) (((char *)op
) - dst
);
440 /* Nb of input bytes read */
441 return (int) (((const char *)ip
) - src
);
444 /* Overflow error detected */
446 return (int) (-(((const char *)ip
) - src
)) - 1;
449 int LZ4_decompress_safe(const char *source
, char *dest
,
450 int compressedSize
, int maxDecompressedSize
)
452 return LZ4_decompress_generic(source
, dest
,
453 compressedSize
, maxDecompressedSize
,
454 endOnInputSize
, decode_full_block
,
455 noDict
, (BYTE
*)dest
, NULL
, 0);
458 int LZ4_decompress_safe_partial(const char *src
, char *dst
,
459 int compressedSize
, int targetOutputSize
, int dstCapacity
)
461 dstCapacity
= min(targetOutputSize
, dstCapacity
);
462 return LZ4_decompress_generic(src
, dst
, compressedSize
, dstCapacity
,
463 endOnInputSize
, partial_decode
,
464 noDict
, (BYTE
*)dst
, NULL
, 0);
467 int LZ4_decompress_fast(const char *source
, char *dest
, int originalSize
)
469 return LZ4_decompress_generic(source
, dest
, 0, originalSize
,
470 endOnOutputSize
, decode_full_block
,
472 (BYTE
*)dest
- 64 * KB
, NULL
, 0);
475 /* ===== Instantiate a few more decoding cases, used more than once. ===== */
477 int LZ4_decompress_safe_withPrefix64k(const char *source
, char *dest
,
478 int compressedSize
, int maxOutputSize
)
480 return LZ4_decompress_generic(source
, dest
,
481 compressedSize
, maxOutputSize
,
482 endOnInputSize
, decode_full_block
,
484 (BYTE
*)dest
- 64 * KB
, NULL
, 0);
487 static int LZ4_decompress_safe_withSmallPrefix(const char *source
, char *dest
,
492 return LZ4_decompress_generic(source
, dest
,
493 compressedSize
, maxOutputSize
,
494 endOnInputSize
, decode_full_block
,
496 (BYTE
*)dest
- prefixSize
, NULL
, 0);
499 int LZ4_decompress_safe_forceExtDict(const char *source
, char *dest
,
500 int compressedSize
, int maxOutputSize
,
501 const void *dictStart
, size_t dictSize
)
503 return LZ4_decompress_generic(source
, dest
,
504 compressedSize
, maxOutputSize
,
505 endOnInputSize
, decode_full_block
,
506 usingExtDict
, (BYTE
*)dest
,
507 (const BYTE
*)dictStart
, dictSize
);
510 static int LZ4_decompress_fast_extDict(const char *source
, char *dest
,
512 const void *dictStart
, size_t dictSize
)
514 return LZ4_decompress_generic(source
, dest
,
516 endOnOutputSize
, decode_full_block
,
517 usingExtDict
, (BYTE
*)dest
,
518 (const BYTE
*)dictStart
, dictSize
);
522 * The "double dictionary" mode, for use with e.g. ring buffers: the first part
523 * of the dictionary is passed as prefix, and the second via dictStart + dictSize.
524 * These routines are used only once, in LZ4_decompress_*_continue().
527 int LZ4_decompress_safe_doubleDict(const char *source
, char *dest
,
528 int compressedSize
, int maxOutputSize
,
530 const void *dictStart
, size_t dictSize
)
532 return LZ4_decompress_generic(source
, dest
,
533 compressedSize
, maxOutputSize
,
534 endOnInputSize
, decode_full_block
,
535 usingExtDict
, (BYTE
*)dest
- prefixSize
,
536 (const BYTE
*)dictStart
, dictSize
);
540 int LZ4_decompress_fast_doubleDict(const char *source
, char *dest
,
541 int originalSize
, size_t prefixSize
,
542 const void *dictStart
, size_t dictSize
)
544 return LZ4_decompress_generic(source
, dest
,
546 endOnOutputSize
, decode_full_block
,
547 usingExtDict
, (BYTE
*)dest
- prefixSize
,
548 (const BYTE
*)dictStart
, dictSize
);
551 /* ===== streaming decompression functions ===== */
553 int LZ4_setStreamDecode(LZ4_streamDecode_t
*LZ4_streamDecode
,
554 const char *dictionary
, int dictSize
)
556 LZ4_streamDecode_t_internal
*lz4sd
=
557 &LZ4_streamDecode
->internal_donotuse
;
559 lz4sd
->prefixSize
= (size_t) dictSize
;
560 lz4sd
->prefixEnd
= (const BYTE
*) dictionary
+ dictSize
;
561 lz4sd
->externalDict
= NULL
;
562 lz4sd
->extDictSize
= 0;
568 * These decoding functions allow decompression of multiple blocks
569 * in "streaming" mode.
570 * Previously decoded blocks must still be available at the memory
571 * position where they were decoded.
572 * If it's not possible, save the relevant part of
573 * decoded data into a safe buffer,
574 * and indicate where it stands using LZ4_setStreamDecode()
576 int LZ4_decompress_safe_continue(LZ4_streamDecode_t
*LZ4_streamDecode
,
577 const char *source
, char *dest
, int compressedSize
, int maxOutputSize
)
579 LZ4_streamDecode_t_internal
*lz4sd
=
580 &LZ4_streamDecode
->internal_donotuse
;
583 if (lz4sd
->prefixSize
== 0) {
584 /* The first call, no dictionary yet. */
585 assert(lz4sd
->extDictSize
== 0);
586 result
= LZ4_decompress_safe(source
, dest
,
587 compressedSize
, maxOutputSize
);
590 lz4sd
->prefixSize
= result
;
591 lz4sd
->prefixEnd
= (BYTE
*)dest
+ result
;
592 } else if (lz4sd
->prefixEnd
== (BYTE
*)dest
) {
593 /* They're rolling the current segment. */
594 if (lz4sd
->prefixSize
>= 64 * KB
- 1)
595 result
= LZ4_decompress_safe_withPrefix64k(source
, dest
,
596 compressedSize
, maxOutputSize
);
597 else if (lz4sd
->extDictSize
== 0)
598 result
= LZ4_decompress_safe_withSmallPrefix(source
,
599 dest
, compressedSize
, maxOutputSize
,
602 result
= LZ4_decompress_safe_doubleDict(source
, dest
,
603 compressedSize
, maxOutputSize
,
605 lz4sd
->externalDict
, lz4sd
->extDictSize
);
608 lz4sd
->prefixSize
+= result
;
609 lz4sd
->prefixEnd
+= result
;
612 * The buffer wraps around, or they're
613 * switching to another buffer.
615 lz4sd
->extDictSize
= lz4sd
->prefixSize
;
616 lz4sd
->externalDict
= lz4sd
->prefixEnd
- lz4sd
->extDictSize
;
617 result
= LZ4_decompress_safe_forceExtDict(source
, dest
,
618 compressedSize
, maxOutputSize
,
619 lz4sd
->externalDict
, lz4sd
->extDictSize
);
622 lz4sd
->prefixSize
= result
;
623 lz4sd
->prefixEnd
= (BYTE
*)dest
+ result
;
629 int LZ4_decompress_fast_continue(LZ4_streamDecode_t
*LZ4_streamDecode
,
630 const char *source
, char *dest
, int originalSize
)
632 LZ4_streamDecode_t_internal
*lz4sd
= &LZ4_streamDecode
->internal_donotuse
;
635 if (lz4sd
->prefixSize
== 0) {
636 assert(lz4sd
->extDictSize
== 0);
637 result
= LZ4_decompress_fast(source
, dest
, originalSize
);
640 lz4sd
->prefixSize
= originalSize
;
641 lz4sd
->prefixEnd
= (BYTE
*)dest
+ originalSize
;
642 } else if (lz4sd
->prefixEnd
== (BYTE
*)dest
) {
643 if (lz4sd
->prefixSize
>= 64 * KB
- 1 ||
644 lz4sd
->extDictSize
== 0)
645 result
= LZ4_decompress_fast(source
, dest
,
648 result
= LZ4_decompress_fast_doubleDict(source
, dest
,
649 originalSize
, lz4sd
->prefixSize
,
650 lz4sd
->externalDict
, lz4sd
->extDictSize
);
653 lz4sd
->prefixSize
+= originalSize
;
654 lz4sd
->prefixEnd
+= originalSize
;
656 lz4sd
->extDictSize
= lz4sd
->prefixSize
;
657 lz4sd
->externalDict
= lz4sd
->prefixEnd
- lz4sd
->extDictSize
;
658 result
= LZ4_decompress_fast_extDict(source
, dest
,
659 originalSize
, lz4sd
->externalDict
, lz4sd
->extDictSize
);
662 lz4sd
->prefixSize
= originalSize
;
663 lz4sd
->prefixEnd
= (BYTE
*)dest
+ originalSize
;
668 int LZ4_decompress_safe_usingDict(const char *source
, char *dest
,
669 int compressedSize
, int maxOutputSize
,
670 const char *dictStart
, int dictSize
)
673 return LZ4_decompress_safe(source
, dest
,
674 compressedSize
, maxOutputSize
);
675 if (dictStart
+dictSize
== dest
) {
676 if (dictSize
>= 64 * KB
- 1)
677 return LZ4_decompress_safe_withPrefix64k(source
, dest
,
678 compressedSize
, maxOutputSize
);
679 return LZ4_decompress_safe_withSmallPrefix(source
, dest
,
680 compressedSize
, maxOutputSize
, dictSize
);
682 return LZ4_decompress_safe_forceExtDict(source
, dest
,
683 compressedSize
, maxOutputSize
, dictStart
, dictSize
);
686 int LZ4_decompress_fast_usingDict(const char *source
, char *dest
,
688 const char *dictStart
, int dictSize
)
690 if (dictSize
== 0 || dictStart
+ dictSize
== dest
)
691 return LZ4_decompress_fast(source
, dest
, originalSize
);
693 return LZ4_decompress_fast_extDict(source
, dest
, originalSize
,
694 dictStart
, dictSize
);
698 EXPORT_SYMBOL(LZ4_decompress_safe
);
699 EXPORT_SYMBOL(LZ4_decompress_safe_partial
);
700 EXPORT_SYMBOL(LZ4_decompress_fast
);
701 EXPORT_SYMBOL(LZ4_setStreamDecode
);
702 EXPORT_SYMBOL(LZ4_decompress_safe_continue
);
703 EXPORT_SYMBOL(LZ4_decompress_fast_continue
);
704 EXPORT_SYMBOL(LZ4_decompress_safe_usingDict
);
705 EXPORT_SYMBOL(LZ4_decompress_fast_usingDict
);
707 MODULE_LICENSE("Dual BSD/GPL");
708 MODULE_DESCRIPTION("LZ4 decompressor");