lz4hc_compress.c 18.7 KB
Newer Older
Chanho Min's avatar
Chanho Min committed
1 2
/*
 * LZ4 HC - High Compression Mode of LZ4
3
 * Copyright (C) 2011-2015, Yann Collet.
Chanho Min's avatar
Chanho Min committed
4
 *
5
 * BSD 2 - Clause License (http://www.opensource.org/licenses/bsd - license.php)
Chanho Min's avatar
Chanho Min committed
6 7 8
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are
 * met:
9 10 11
 *	* Redistributions of source code must retain the above copyright
 *	  notice, this list of conditions and the following disclaimer.
 *	* Redistributions in binary form must reproduce the above
Chanho Min's avatar
Chanho Min committed
12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
 * copyright notice, this list of conditions and the following disclaimer
 * in the documentation and/or other materials provided with the
 * distribution.
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 * You can contact the author at :
27 28
 *	- LZ4 homepage : http://www.lz4.org
 *	- LZ4 source repository : https://github.com/lz4/lz4
Chanho Min's avatar
Chanho Min committed
29
 *
30 31
 *	Changed for kernel usage by:
 *	Sven Schmidt <4sschmid@informatik.uni-hamburg.de>
Chanho Min's avatar
Chanho Min committed
32 33
 */

34 35 36
/*-************************************
 *	Dependencies
 **************************************/
Chanho Min's avatar
Chanho Min committed
37 38
#include <linux/lz4.h>
#include "lz4defs.h"
39 40 41 42 43 44 45
#include <linux/module.h>
#include <linux/kernel.h>
#include <linux/string.h> /* memset */

/* *************************************
 *	Local Constants and types
 ***************************************/
Chanho Min's avatar
Chanho Min committed
46

47
#define OPTIMAL_ML (int)((ML_MASK - 1) + MINMATCH)
Chanho Min's avatar
Chanho Min committed
48

49 50 51 52 53 54 55 56 57 58 59 60 61
#define HASH_FUNCTION(i)	(((i) * 2654435761U) \
	>> ((MINMATCH*8) - LZ4HC_HASH_LOG))
#define DELTANEXTU16(p)	chainTable[(U16)(p)] /* faster */

static U32 LZ4HC_hashPtr(const void *ptr)
{
	return HASH_FUNCTION(LZ4_read32(ptr));
}

/**************************************
 *	HC Compression
 **************************************/
static void LZ4HC_init(LZ4HC_CCtx_internal *hc4, const BYTE *start)
Chanho Min's avatar
Chanho Min committed
62
{
63 64 65 66 67 68 69 70
	memset((void *)hc4->hashTable, 0, sizeof(hc4->hashTable));
	memset(hc4->chainTable, 0xFF, sizeof(hc4->chainTable));
	hc4->nextToUpdate = 64 * KB;
	hc4->base = start - 64 * KB;
	hc4->end = start;
	hc4->dictBase = start - 64 * KB;
	hc4->dictLimit = 64 * KB;
	hc4->lowLimit = 64 * KB;
Chanho Min's avatar
Chanho Min committed
71 72 73
}

/* Update chains up to ip (excluded) */
74 75
static FORCE_INLINE void LZ4HC_Insert(LZ4HC_CCtx_internal *hc4,
	const BYTE *ip)
Chanho Min's avatar
Chanho Min committed
76
{
77 78
	U16 * const chainTable = hc4->chainTable;
	U32 * const hashTable	= hc4->hashTable;
Chanho Min's avatar
Chanho Min committed
79
	const BYTE * const base = hc4->base;
80 81 82 83 84 85
	U32 const target = (U32)(ip - base);
	U32 idx = hc4->nextToUpdate;

	while (idx < target) {
		U32 const h = LZ4HC_hashPtr(base + idx);
		size_t delta = idx - hashTable[h];
Chanho Min's avatar
Chanho Min committed
86 87 88 89

		if (delta > MAX_DISTANCE)
			delta = MAX_DISTANCE;

90
		DELTANEXTU16(idx) = (U16)delta;
Chanho Min's avatar
Chanho Min committed
91

92 93
		hashTable[h] = idx;
		idx++;
Chanho Min's avatar
Chanho Min committed
94
	}
95 96

	hc4->nextToUpdate = target;
Chanho Min's avatar
Chanho Min committed
97 98
}

99 100 101 102 103 104
static FORCE_INLINE int LZ4HC_InsertAndFindBestMatch(
	LZ4HC_CCtx_internal *hc4, /* Index table will be updated */
	const BYTE *ip,
	const BYTE * const iLimit,
	const BYTE **matchpos,
	const int maxNbAttempts)
Chanho Min's avatar
Chanho Min committed
105
{
106 107
	U16 * const chainTable = hc4->chainTable;
	U32 * const HashTable = hc4->hashTable;
Chanho Min's avatar
Chanho Min committed
108
	const BYTE * const base = hc4->base;
109 110 111 112 113 114 115 116
	const BYTE * const dictBase = hc4->dictBase;
	const U32 dictLimit = hc4->dictLimit;
	const U32 lowLimit = (hc4->lowLimit + 64 * KB > (U32)(ip - base))
		? hc4->lowLimit
		: (U32)(ip - base) - (64 * KB - 1);
	U32 matchIndex;
	int nbAttempts = maxNbAttempts;
	size_t ml = 0;
Chanho Min's avatar
Chanho Min committed
117 118

	/* HC4 match finder */
119 120 121 122 123 124 125 126 127 128 129 130 131
	LZ4HC_Insert(hc4, ip);
	matchIndex = HashTable[LZ4HC_hashPtr(ip)];

	while ((matchIndex >= lowLimit)
		&& (nbAttempts)) {
		nbAttempts--;
		if (matchIndex >= dictLimit) {
			const BYTE * const match = base + matchIndex;

			if (*(match + ml) == *(ip + ml)
				&& (LZ4_read32(match) == LZ4_read32(ip))) {
				size_t const mlt = LZ4_count(ip + MINMATCH,
					match + MINMATCH, iLimit) + MINMATCH;
Chanho Min's avatar
Chanho Min committed
132 133 134

				if (mlt > ml) {
					ml = mlt;
135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158
					*matchpos = match;
				}
			}
		} else {
			const BYTE * const match = dictBase + matchIndex;

			if (LZ4_read32(match) == LZ4_read32(ip)) {
				size_t mlt;
				const BYTE *vLimit = ip
					+ (dictLimit - matchIndex);

				if (vLimit > iLimit)
					vLimit = iLimit;
				mlt = LZ4_count(ip + MINMATCH,
					match + MINMATCH, vLimit) + MINMATCH;
				if ((ip + mlt == vLimit)
					&& (vLimit < iLimit))
					mlt += LZ4_count(ip + mlt,
						base + dictLimit,
						iLimit);
				if (mlt > ml) {
					/* virtual matchpos */
					ml = mlt;
					*matchpos = base + matchIndex;
Chanho Min's avatar
Chanho Min committed
159 160 161
				}
			}
		}
162
		matchIndex -= DELTANEXTU16(matchIndex);
Chanho Min's avatar
Chanho Min committed
163 164 165 166 167
	}

	return (int)ml;
}

168 169 170 171 172 173 174 175 176
static FORCE_INLINE int LZ4HC_InsertAndGetWiderMatch(
	LZ4HC_CCtx_internal *hc4,
	const BYTE * const ip,
	const BYTE * const iLowLimit,
	const BYTE * const iHighLimit,
	int longest,
	const BYTE **matchpos,
	const BYTE **startpos,
	const int maxNbAttempts)
Chanho Min's avatar
Chanho Min committed
177
{
178 179
	U16 * const chainTable = hc4->chainTable;
	U32 * const HashTable = hc4->hashTable;
Chanho Min's avatar
Chanho Min committed
180
	const BYTE * const base = hc4->base;
181 182 183 184 185 186 187 188 189
	const U32 dictLimit = hc4->dictLimit;
	const BYTE * const lowPrefixPtr = base + dictLimit;
	const U32 lowLimit = (hc4->lowLimit + 64 * KB > (U32)(ip - base))
		? hc4->lowLimit
		: (U32)(ip - base) - (64 * KB - 1);
	const BYTE * const dictBase = hc4->dictBase;
	U32 matchIndex;
	int nbAttempts = maxNbAttempts;
	int delta = (int)(ip - iLowLimit);
Chanho Min's avatar
Chanho Min committed
190 191

	/* First Match */
192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220
	LZ4HC_Insert(hc4, ip);
	matchIndex = HashTable[LZ4HC_hashPtr(ip)];

	while ((matchIndex >= lowLimit)
		&& (nbAttempts)) {
		nbAttempts--;
		if (matchIndex >= dictLimit) {
			const BYTE *matchPtr = base + matchIndex;

			if (*(iLowLimit + longest)
				== *(matchPtr - delta + longest)) {
				if (LZ4_read32(matchPtr) == LZ4_read32(ip)) {
					int mlt = MINMATCH + LZ4_count(
						ip + MINMATCH,
						matchPtr + MINMATCH,
						iHighLimit);
					int back = 0;

					while ((ip + back > iLowLimit)
						&& (matchPtr + back > lowPrefixPtr)
						&& (ip[back - 1] == matchPtr[back - 1]))
						back--;

					mlt -= back;

					if (mlt > longest) {
						longest = (int)mlt;
						*matchpos = matchPtr + back;
						*startpos = ip + back;
Chanho Min's avatar
Chanho Min committed
221 222
					}
				}
223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251
			}
		} else {
			const BYTE * const matchPtr = dictBase + matchIndex;

			if (LZ4_read32(matchPtr) == LZ4_read32(ip)) {
				size_t mlt;
				int back = 0;
				const BYTE *vLimit = ip + (dictLimit - matchIndex);

				if (vLimit > iHighLimit)
					vLimit = iHighLimit;

				mlt = LZ4_count(ip + MINMATCH,
					matchPtr + MINMATCH, vLimit) + MINMATCH;

				if ((ip + mlt == vLimit) && (vLimit < iHighLimit))
					mlt += LZ4_count(ip + mlt, base + dictLimit,
						iHighLimit);
				while ((ip + back > iLowLimit)
					&& (matchIndex + back > lowLimit)
					&& (ip[back - 1] == matchPtr[back - 1]))
					back--;

				mlt -= back;

				if ((int)mlt > longest) {
					longest = (int)mlt;
					*matchpos = base + matchIndex + back;
					*startpos = ip + back;
Chanho Min's avatar
Chanho Min committed
252 253 254
				}
			}
		}
255 256

		matchIndex -= DELTANEXTU16(matchIndex);
Chanho Min's avatar
Chanho Min committed
257
	}
258

Chanho Min's avatar
Chanho Min committed
259 260 261
	return longest;
}

262 263 264 265 266 267 268 269
static FORCE_INLINE int LZ4HC_encodeSequence(
	const BYTE **ip,
	BYTE **op,
	const BYTE **anchor,
	int matchLength,
	const BYTE * const match,
	limitedOutput_directive limitedOutputBuffer,
	BYTE *oend)
Chanho Min's avatar
Chanho Min committed
270
{
271 272
	int length;
	BYTE *token;
Chanho Min's avatar
Chanho Min committed
273 274 275 276

	/* Encode Literal length */
	length = (int)(*ip - *anchor);
	token = (*op)++;
277 278 279 280 281 282 283

	if ((limitedOutputBuffer)
		&& ((*op + (length>>8)
			+ length + (2 + 1 + LASTLITERALS)) > oend)) {
		/* Check output limit */
		return 1;
	}
Chanho Min's avatar
Chanho Min committed
284
	if (length >= (int)RUN_MASK) {
285 286 287
		int len;

		*token = (RUN_MASK<<ML_BITS);
Chanho Min's avatar
Chanho Min committed
288 289 290
		len = length - RUN_MASK;
		for (; len > 254 ; len -= 255)
			*(*op)++ = 255;
291
		*(*op)++ = (BYTE)len;
Chanho Min's avatar
Chanho Min committed
292
	} else
293
		*token = (BYTE)(length<<ML_BITS);
Chanho Min's avatar
Chanho Min committed
294 295

	/* Copy Literals */
296 297
	LZ4_wildCopy(*op, *anchor, (*op) + length);
	*op += length;
Chanho Min's avatar
Chanho Min committed
298 299

	/* Encode Offset */
300 301
	LZ4_writeLE16(*op, (U16)(*ip - match));
	*op += 2;
Chanho Min's avatar
Chanho Min committed
302 303

	/* Encode MatchLength */
304 305 306 307 308 309 310 311 312 313
	length = (int)(matchLength - MINMATCH);

	if ((limitedOutputBuffer)
		&& (*op + (length>>8)
			+ (1 + LASTLITERALS) > oend)) {
		/* Check output limit */
		return 1;
	}

	if (length >= (int)ML_MASK) {
Chanho Min's avatar
Chanho Min committed
314
		*token += ML_MASK;
315 316 317
		length -= ML_MASK;

		for (; length > 509 ; length -= 510) {
Chanho Min's avatar
Chanho Min committed
318 319 320
			*(*op)++ = 255;
			*(*op)++ = 255;
		}
321 322 323

		if (length > 254) {
			length -= 255;
Chanho Min's avatar
Chanho Min committed
324 325
			*(*op)++ = 255;
		}
326 327

		*(*op)++ = (BYTE)length;
Chanho Min's avatar
Chanho Min committed
328
	} else
329
		*token += (BYTE)(length);
Chanho Min's avatar
Chanho Min committed
330 331

	/* Prepare next loop */
332
	*ip += matchLength;
Chanho Min's avatar
Chanho Min committed
333 334 335 336 337
	*anchor = *ip;

	return 0;
}

338 339 340 341 342 343 344 345 346
static int LZ4HC_compress_generic(
	LZ4HC_CCtx_internal *const ctx,
	const char * const source,
	char * const dest,
	int const inputSize,
	int const maxOutputSize,
	int compressionLevel,
	limitedOutput_directive limit
	)
Chanho Min's avatar
Chanho Min committed
347
{
348 349 350 351 352
	const BYTE *ip = (const BYTE *) source;
	const BYTE *anchor = ip;
	const BYTE * const iend = ip + inputSize;
	const BYTE * const mflimit = iend - MFLIMIT;
	const BYTE * const matchlimit = (iend - LASTLITERALS);
Chanho Min's avatar
Chanho Min committed
353

354 355
	BYTE *op = (BYTE *) dest;
	BYTE * const oend = op + maxOutputSize;
Chanho Min's avatar
Chanho Min committed
356

357
	unsigned int maxNbAttempts;
Chanho Min's avatar
Chanho Min committed
358
	int ml, ml2, ml3, ml0;
359 360 361 362 363 364 365 366 367 368 369 370 371 372 373
	const BYTE *ref = NULL;
	const BYTE *start2 = NULL;
	const BYTE *ref2 = NULL;
	const BYTE *start3 = NULL;
	const BYTE *ref3 = NULL;
	const BYTE *start0;
	const BYTE *ref0;

	/* init */
	if (compressionLevel > LZ4HC_MAX_CLEVEL)
		compressionLevel = LZ4HC_MAX_CLEVEL;
	if (compressionLevel < 1)
		compressionLevel = LZ4HC_DEFAULT_CLEVEL;
	maxNbAttempts = 1 << (compressionLevel - 1);
	ctx->end += inputSize;
Chanho Min's avatar
Chanho Min committed
374 375 376 377 378

	ip++;

	/* Main Loop */
	while (ip < mflimit) {
379 380
		ml = LZ4HC_InsertAndFindBestMatch(ctx, ip,
			matchlimit, (&ref), maxNbAttempts);
Chanho Min's avatar
Chanho Min committed
381 382 383 384 385 386 387 388 389
		if (!ml) {
			ip++;
			continue;
		}

		/* saved, in case we would skip too much */
		start0 = ip;
		ref0 = ref;
		ml0 = ml;
390 391 392 393 394 395 396

_Search2:
		if (ip + ml < mflimit)
			ml2 = LZ4HC_InsertAndGetWiderMatch(ctx,
				ip + ml - 2, ip + 0,
				matchlimit, ml, &ref2,
				&start2, maxNbAttempts);
Chanho Min's avatar
Chanho Min committed
397 398
		else
			ml2 = ml;
399

Chanho Min's avatar
Chanho Min committed
400
		if (ml2 == ml) {
401 402 403 404
			/* No better match */
			if (LZ4HC_encodeSequence(&ip, &op,
				&anchor, ml, ref, limit, oend))
				return 0;
Chanho Min's avatar
Chanho Min committed
405 406 407 408 409
			continue;
		}

		if (start0 < ip) {
			if (start2 < ip + ml0) {
410
				/* empirical */
Chanho Min's avatar
Chanho Min committed
411 412 413 414 415
				ip = start0;
				ref = ref0;
				ml = ml0;
			}
		}
416 417

		/* Here, start0 == ip */
Chanho Min's avatar
Chanho Min committed
418
		if ((start2 - ip) < 3) {
419
			/* First Match too small : removed */
Chanho Min's avatar
Chanho Min committed
420 421 422
			ml = ml2;
			ip = start2;
			ref = ref2;
423
			goto _Search2;
Chanho Min's avatar
Chanho Min committed
424 425
		}

426
_Search3:
Chanho Min's avatar
Chanho Min committed
427
		/*
428 429 430 431
		* Currently we have :
		* ml2 > ml1, and
		* ip1 + 3 <= ip2 (usually < ip1 + ml1)
		*/
Chanho Min's avatar
Chanho Min committed
432 433 434
		if ((start2 - ip) < OPTIMAL_ML) {
			int correction;
			int new_ml = ml;
435

Chanho Min's avatar
Chanho Min committed
436 437 438 439
			if (new_ml > OPTIMAL_ML)
				new_ml = OPTIMAL_ML;
			if (ip + new_ml > start2 + ml2 - MINMATCH)
				new_ml = (int)(start2 - ip) + ml2 - MINMATCH;
440

Chanho Min's avatar
Chanho Min committed
441
			correction = new_ml - (int)(start2 - ip);
442

Chanho Min's avatar
Chanho Min committed
443 444 445 446 447 448 449
			if (correction > 0) {
				start2 += correction;
				ref2 += correction;
				ml2 -= correction;
			}
		}
		/*
450 451
		 * Now, we have start2 = ip + new_ml,
		 * with new_ml = min(ml, OPTIMAL_ML = 18)
Chanho Min's avatar
Chanho Min committed
452
		 */
453

Chanho Min's avatar
Chanho Min committed
454
		if (start2 + ml2 < mflimit)
455 456 457 458
			ml3 = LZ4HC_InsertAndGetWiderMatch(ctx,
				start2 + ml2 - 3, start2,
				matchlimit, ml2, &ref3, &start3,
				maxNbAttempts);
Chanho Min's avatar
Chanho Min committed
459 460 461 462
		else
			ml3 = ml2;

		if (ml3 == ml2) {
463
			/* No better match : 2 sequences to encode */
Chanho Min's avatar
Chanho Min committed
464
			/* ip & ref are known; Now for ml */
465
			if (start2 < ip + ml)
Chanho Min's avatar
Chanho Min committed
466 467
				ml = (int)(start2 - ip);
			/* Now, encode 2 sequences */
468 469 470
			if (LZ4HC_encodeSequence(&ip, &op, &anchor,
				ml, ref, limit, oend))
				return 0;
Chanho Min's avatar
Chanho Min committed
471
			ip = start2;
472 473 474
			if (LZ4HC_encodeSequence(&ip, &op, &anchor,
				ml2, ref2, limit, oend))
				return 0;
Chanho Min's avatar
Chanho Min committed
475 476 477 478
			continue;
		}

		if (start3 < ip + ml + 3) {
479
			/* Not enough space for match 2 : remove it */
Chanho Min's avatar
Chanho Min committed
480
			if (start3 >= (ip + ml)) {
481 482 483 484
				/* can write Seq1 immediately
				 * ==> Seq2 is removed,
				 * so Seq3 becomes Seq1
				 */
Chanho Min's avatar
Chanho Min committed
485
				if (start2 < ip + ml) {
486 487
					int correction = (int)(ip + ml - start2);

Chanho Min's avatar
Chanho Min committed
488 489 490 491 492 493 494 495 496 497
					start2 += correction;
					ref2 += correction;
					ml2 -= correction;
					if (ml2 < MINMATCH) {
						start2 = start3;
						ref2 = ref3;
						ml2 = ml3;
					}
				}

498 499 500 501
				if (LZ4HC_encodeSequence(&ip, &op, &anchor,
					ml, ref, limit, oend))
					return 0;
				ip = start3;
Chanho Min's avatar
Chanho Min committed
502
				ref = ref3;
503
				ml = ml3;
Chanho Min's avatar
Chanho Min committed
504 505 506 507

				start0 = start2;
				ref0 = ref2;
				ml0 = ml2;
508
				goto _Search2;
Chanho Min's avatar
Chanho Min committed
509 510 511 512 513
			}

			start2 = start3;
			ref2 = ref3;
			ml2 = ml3;
514
			goto _Search3;
Chanho Min's avatar
Chanho Min committed
515 516 517
		}

		/*
518 519 520 521
		* OK, now we have 3 ascending matches;
		* let's write at least the first one
		* ip & ref are known; Now for ml
		*/
Chanho Min's avatar
Chanho Min committed
522 523 524
		if (start2 < ip + ml) {
			if ((start2 - ip) < (int)ML_MASK) {
				int correction;
525

Chanho Min's avatar
Chanho Min committed
526 527 528
				if (ml > OPTIMAL_ML)
					ml = OPTIMAL_ML;
				if (ip + ml > start2 + ml2 - MINMATCH)
529
					ml = (int)(start2 - ip) + ml2 - MINMATCH;
Chanho Min's avatar
Chanho Min committed
530 531 532 533 534 535 536 537 538
				correction = ml - (int)(start2 - ip);
				if (correction > 0) {
					start2 += correction;
					ref2 += correction;
					ml2 -= correction;
				}
			} else
				ml = (int)(start2 - ip);
		}
539 540 541
		if (LZ4HC_encodeSequence(&ip, &op, &anchor, ml,
			ref, limit, oend))
			return 0;
Chanho Min's avatar
Chanho Min committed
542 543 544 545 546 547 548 549 550

		ip = start2;
		ref = ref2;
		ml = ml2;

		start2 = start3;
		ref2 = ref3;
		ml2 = ml3;

551
		goto _Search3;
Chanho Min's avatar
Chanho Min committed
552 553 554
	}

	/* Encode Last Literals */
555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576
	{
		int lastRun = (int)(iend - anchor);

		if ((limit)
			&& (((char *)op - dest) + lastRun + 1
				+ ((lastRun + 255 - RUN_MASK)/255)
					> (U32)maxOutputSize)) {
			/* Check output limit */
			return 0;
		}
		if (lastRun >= (int)RUN_MASK) {
			*op++ = (RUN_MASK<<ML_BITS);
			lastRun -= RUN_MASK;
			for (; lastRun > 254 ; lastRun -= 255)
				*op++ = 255;
			*op++ = (BYTE) lastRun;
		} else
			*op++ = (BYTE)(lastRun<<ML_BITS);
		memcpy(op, anchor, iend - anchor);
		op += iend - anchor;
	}

Chanho Min's avatar
Chanho Min committed
577 578 579 580
	/* End */
	return (int) (((char *)op) - dest);
}

581 582 583 584 585 586 587
static int LZ4_compress_HC_extStateHC(
	void *state,
	const char *src,
	char *dst,
	int srcSize,
	int maxDstSize,
	int compressionLevel)
Chanho Min's avatar
Chanho Min committed
588
{
589
	LZ4HC_CCtx_internal *ctx = &((LZ4_streamHC_t *)state)->internal_donotuse;
Chanho Min's avatar
Chanho Min committed
590

591 592 593 594 595 596
	if (((size_t)(state)&(sizeof(void *) - 1)) != 0) {
		/* Error : state is not aligned
		 * for pointers (32 or 64 bits)
		 */
		return 0;
	}
Chanho Min's avatar
Chanho Min committed
597

598
	LZ4HC_init(ctx, (const BYTE *)src);
Chanho Min's avatar
Chanho Min committed
599

600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751
	if (maxDstSize < LZ4_compressBound(srcSize))
		return LZ4HC_compress_generic(ctx, src, dst,
			srcSize, maxDstSize, compressionLevel, limitedOutput);
	else
		return LZ4HC_compress_generic(ctx, src, dst,
			srcSize, maxDstSize, compressionLevel, noLimit);
}

int LZ4_compress_HC(const char *src, char *dst, int srcSize,
	int maxDstSize, int compressionLevel, void *wrkmem)
{
	return LZ4_compress_HC_extStateHC(wrkmem, src, dst,
		srcSize, maxDstSize, compressionLevel);
}
EXPORT_SYMBOL(LZ4_compress_HC);

/**************************************
 *	Streaming Functions
 **************************************/
void LZ4_resetStreamHC(LZ4_streamHC_t *LZ4_streamHCPtr, int compressionLevel)
{
	LZ4_streamHCPtr->internal_donotuse.base = NULL;
	LZ4_streamHCPtr->internal_donotuse.compressionLevel = (unsigned int)compressionLevel;
}

int LZ4_loadDictHC(LZ4_streamHC_t *LZ4_streamHCPtr,
	const char *dictionary,
	int dictSize)
{
	LZ4HC_CCtx_internal *ctxPtr = &LZ4_streamHCPtr->internal_donotuse;

	if (dictSize > 64 * KB) {
		dictionary += dictSize - 64 * KB;
		dictSize = 64 * KB;
	}
	LZ4HC_init(ctxPtr, (const BYTE *)dictionary);
	if (dictSize >= 4)
		LZ4HC_Insert(ctxPtr, (const BYTE *)dictionary + (dictSize - 3));
	ctxPtr->end = (const BYTE *)dictionary + dictSize;
	return dictSize;
}
EXPORT_SYMBOL(LZ4_loadDictHC);

/* compression */

static void LZ4HC_setExternalDict(
	LZ4HC_CCtx_internal *ctxPtr,
	const BYTE *newBlock)
{
	if (ctxPtr->end >= ctxPtr->base + 4) {
		/* Referencing remaining dictionary content */
		LZ4HC_Insert(ctxPtr, ctxPtr->end - 3);
	}

	/*
	 * Only one memory segment for extDict,
	 * so any previous extDict is lost at this stage
	 */
	ctxPtr->lowLimit	= ctxPtr->dictLimit;
	ctxPtr->dictLimit = (U32)(ctxPtr->end - ctxPtr->base);
	ctxPtr->dictBase	= ctxPtr->base;
	ctxPtr->base = newBlock - ctxPtr->dictLimit;
	ctxPtr->end	= newBlock;
	/* match referencing will resume from there */
	ctxPtr->nextToUpdate = ctxPtr->dictLimit;
}
EXPORT_SYMBOL(LZ4HC_setExternalDict);

static int LZ4_compressHC_continue_generic(
	LZ4_streamHC_t *LZ4_streamHCPtr,
	const char *source,
	char *dest,
	int inputSize,
	int maxOutputSize,
	limitedOutput_directive limit)
{
	LZ4HC_CCtx_internal *ctxPtr = &LZ4_streamHCPtr->internal_donotuse;

	/* auto - init if forgotten */
	if (ctxPtr->base == NULL)
		LZ4HC_init(ctxPtr, (const BYTE *) source);

	/* Check overflow */
	if ((size_t)(ctxPtr->end - ctxPtr->base) > 2 * GB) {
		size_t dictSize = (size_t)(ctxPtr->end - ctxPtr->base)
			- ctxPtr->dictLimit;
		if (dictSize > 64 * KB)
			dictSize = 64 * KB;
		LZ4_loadDictHC(LZ4_streamHCPtr,
			(const char *)(ctxPtr->end) - dictSize, (int)dictSize);
	}

	/* Check if blocks follow each other */
	if ((const BYTE *)source != ctxPtr->end)
		LZ4HC_setExternalDict(ctxPtr, (const BYTE *)source);

	/* Check overlapping input/dictionary space */
	{
		const BYTE *sourceEnd = (const BYTE *) source + inputSize;
		const BYTE * const dictBegin = ctxPtr->dictBase + ctxPtr->lowLimit;
		const BYTE * const dictEnd = ctxPtr->dictBase + ctxPtr->dictLimit;

		if ((sourceEnd > dictBegin)
			&& ((const BYTE *)source < dictEnd)) {
			if (sourceEnd > dictEnd)
				sourceEnd = dictEnd;
			ctxPtr->lowLimit = (U32)(sourceEnd - ctxPtr->dictBase);

			if (ctxPtr->dictLimit - ctxPtr->lowLimit < 4)
				ctxPtr->lowLimit = ctxPtr->dictLimit;
		}
	}

	return LZ4HC_compress_generic(ctxPtr, source, dest,
		inputSize, maxOutputSize, ctxPtr->compressionLevel, limit);
}

int LZ4_compress_HC_continue(
	LZ4_streamHC_t *LZ4_streamHCPtr,
	const char *source,
	char *dest,
	int inputSize,
	int maxOutputSize)
{
	if (maxOutputSize < LZ4_compressBound(inputSize))
		return LZ4_compressHC_continue_generic(LZ4_streamHCPtr,
			source, dest, inputSize, maxOutputSize, limitedOutput);
	else
		return LZ4_compressHC_continue_generic(LZ4_streamHCPtr,
			source, dest, inputSize, maxOutputSize, noLimit);
}
EXPORT_SYMBOL(LZ4_compress_HC_continue);

/* dictionary saving */

int LZ4_saveDictHC(
	LZ4_streamHC_t *LZ4_streamHCPtr,
	char *safeBuffer,
	int dictSize)
{
	LZ4HC_CCtx_internal *const streamPtr = &LZ4_streamHCPtr->internal_donotuse;
	int const prefixSize = (int)(streamPtr->end
		- (streamPtr->base + streamPtr->dictLimit));

	if (dictSize > 64 * KB)
		dictSize = 64 * KB;
	if (dictSize < 4)
		dictSize = 0;
	if (dictSize > prefixSize)
		dictSize = prefixSize;

	memmove(safeBuffer, streamPtr->end - dictSize, dictSize);
Chanho Min's avatar
Chanho Min committed
752

753 754 755 756 757 758 759 760 761 762 763 764 765 766 767
	{
		U32 const endIndex = (U32)(streamPtr->end - streamPtr->base);

		streamPtr->end = (const BYTE *)safeBuffer + dictSize;
		streamPtr->base = streamPtr->end - endIndex;
		streamPtr->dictLimit = endIndex - dictSize;
		streamPtr->lowLimit = endIndex - dictSize;

		if (streamPtr->nextToUpdate < streamPtr->dictLimit)
			streamPtr->nextToUpdate = streamPtr->dictLimit;
	}
	return dictSize;
}
EXPORT_SYMBOL(LZ4_saveDictHC);

768
MODULE_LICENSE("Dual BSD/GPL");
769
MODULE_DESCRIPTION("LZ4 HC compressor");