Home
last modified time | relevance | path

Searched refs:maxLen (Results 1 – 5 of 5) sorted by relevance

/titanic_44/usr/src/common/lzma/
H A DLzFind.c319 UInt32 *distances, UInt32 maxLen) in Hc_GetMatchesSpec() argument
330 if (pb[maxLen] == cur[maxLen] && *pb == *cur) in Hc_GetMatchesSpec()
336 if (maxLen < len) in Hc_GetMatchesSpec()
338 *distances++ = maxLen = len; in Hc_GetMatchesSpec()
350 UInt32 *distances, UInt32 maxLen) in GetMatchesSpec1() argument
373 if (maxLen < len) in GetMatchesSpec1()
375 *distances++ = maxLen = len; in GetMatchesSpec1()
472 #define GET_MATCHES_FOOTER(offset, maxLen) \ argument
474 distances + offset, maxLen) - distances); MOVE_POS_RET;
503 UInt32 hash2Value, delta2, maxLen, offset; in Bt3_MatchFinder_GetMatches() local
[all …]
H A DLzFind.h74 UInt32 *distances, UInt32 maxLen);
/titanic_44/usr/src/common/bzip2/
H A Dhuffman.c66 Int32 maxLen ) in BZ2_hbMakeCodeLengths() argument
120 if (j > maxLen) tooLong = True; in BZ2_hbMakeCodeLengths()
155 Int32 maxLen, in BZ2_hbAssignCodes() argument
161 for (n = minLen; n <= maxLen; n++) { in BZ2_hbAssignCodes()
175 Int32 maxLen, in BZ2_hbCreateDecodeTables() argument
181 for (i = minLen; i <= maxLen; i++) in BZ2_hbCreateDecodeTables()
193 for (i = minLen; i <= maxLen; i++) { in BZ2_hbCreateDecodeTables()
198 for (i = minLen + 1; i <= maxLen; i++) in BZ2_hbCreateDecodeTables()
H A Dcompress.c243 Int32 nSelectors, alphaSize, minLen, maxLen, selCtr; in sendMTFValues() local
484 maxLen = 0; in sendMTFValues()
486 if (s->len[t][i] > maxLen) maxLen = s->len[t][i]; in sendMTFValues()
489 AssertH ( !(maxLen > 17 /*20*/ ), 3004 ); in sendMTFValues()
492 minLen, maxLen, alphaSize ); in sendMTFValues()
H A Ddecompress.c110 Int32 minLen, maxLen; in BZ2_decompress() local
334 maxLen = 0; in BZ2_decompress()
336 if (s->len[t][i] > maxLen) maxLen = s->len[t][i]; in BZ2_decompress()
344 minLen, maxLen, alphaSize in BZ2_decompress()