Home
last modified time | relevance | path

Searched refs:MIN_MATCH (Results 1 – 15 of 15) sorted by relevance

/titanic_53/usr/src/boot/lib/libz/
H A Ddeflate.c182 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
187 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
291 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
364 while (s->lookahead >= MIN_MATCH) {
366 n = s->lookahead - (MIN_MATCH-1);
368 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
376 s->lookahead = MIN_MATCH-1;
383 s->match_length = s->prev_length = MIN_MATCH-1;
1124 s->match_length = s->prev_length = MIN_MATCH-1;
1319 if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
[all …]
H A Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
H A Dzutil.h75 #define MIN_MATCH 3 macro
H A Dtrees.c104 uch _length_code[MAX_MATCH-MIN_MATCH+1];
357 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
359 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1025 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
H A Ddeflate.h281 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
/titanic_53/usr/src/contrib/zlib/
H A Ddeflate.c176 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
181 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
315 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
455 while (s->lookahead >= MIN_MATCH) {
457 n = s->lookahead - (MIN_MATCH-1);
459 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
467 s->lookahead = MIN_MATCH-1;
474 s->match_length = s->prev_length = MIN_MATCH-1;
1250 s->match_length = s->prev_length = MIN_MATCH-1;
1445 if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
[all …]
H A Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
H A Dtrees.c104 uch _length_code[MAX_MATCH-MIN_MATCH+1];
355 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
357 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1031 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
H A Dzutil.h82 #define MIN_MATCH 3 macro
H A Ddeflate.h277 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
/titanic_53/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c133 #define MIN_MATCH 3 macro
571 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
746 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
816 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
821 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
916 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
966 if (length < MIN_MATCH)
987 for (n = 0; n <= length - MIN_MATCH; n++) {
1428 s->match_length = s->prev_length = MIN_MATCH-1;
1643 return (MIN_MATCH-1);
[all …]
/titanic_53/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Dzlib.c82 #define MIN_MATCH 3 macro
397 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
486 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
566 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
631 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
919 s->match_length = MIN_MATCH-1;
1186 if (s->lookahead >= MIN_MATCH) {
1189 #if MIN_MATCH != 3
1190 Call UPDATE_HASH() MIN_MATCH-3 more times
1233 s->prev_length = MIN_MATCH-1;
[all …]
/titanic_53/usr/src/boot/lib/libz/contrib/asm686/
H A Dmatch.S29 #define MIN_MATCH (3) macro
30 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1)
/titanic_53/usr/src/boot/lib/libz/contrib/gcc_gvmat64/
H A Dgvmat64.S94 #define MIN_MATCH 3 macro
95 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
/titanic_53/usr/src/contrib/ast/src/cmd/INIT/
H A Dratz.c621 #define MIN_MATCH 3 macro
1481 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)