/macosx-10.9.5/kext_tools-326.95.1/ |
H A D | compression.c | 67 #define F 18 /* upper limit for match_length */ 69 if match_length is greater than this */ 82 * match_length of longest match. 85 int match_position, match_length; member in struct:encode_state 163 * via the global variables match_position and match_length. 164 * If match_length = F, then removes the old node in favor of the new one, 177 sp->match_length = 0; 200 if (i > sp->match_length) { 202 if ((sp->match_length = i) >= F) 302 * The global variables match_length an [all...] |
H A D | mkext.c | 73 #define F 18 /* upper limit for match_length */ 75 if match_length is greater than this */ 88 * match_length of longest match. 91 int match_position, match_length; member in struct:encode_state 166 * via the global variables match_position and match_length. 167 * If match_length = F, then removes the old node in favor of the new one, 180 sp->match_length = 0; 203 if (i > sp->match_length) { 205 if ((sp->match_length = i) >= F) 297 * The global variables match_length an [all...] |
/macosx-10.9.5/sudo-72/src/zlib/ |
H A D | deflate.c | 383 s->match_length = s->prev_length = MIN_MATCH-1; 1122 s->match_length = s->prev_length = MIN_MATCH-1; 1656 * At this point we have always match_length < MIN_MATCH 1663 s->match_length = longest_match (s, hash_head); 1666 if (s->match_length >= MIN_MATCH) { 1667 check_match(s, s->strstart, s->match_start, s->match_length); 1670 s->match_length - MIN_MATCH, bflush); 1672 s->lookahead -= s->match_length; 1678 if (s->match_length <= s->max_insert_length && 1680 s->match_length [all...] |
H A D | deflate.h | 156 uInt match_length; /* length of best match */ member in struct:internal_state
|
/macosx-10.9.5/zlib-53/zlib/ |
H A D | deflate.c | 1039 s->match_length = s->prev_length = MIN_MATCH-1; 1550 * At this point we have always match_length < MIN_MATCH 1557 s->match_length = longest_match (s, hash_head); 1560 if (s->match_length >= MIN_MATCH) { 1561 check_match(s, s->strstart, s->match_start, s->match_length); 1564 s->match_length - MIN_MATCH, bflush); 1566 s->lookahead -= s->match_length; 1572 if (s->match_length <= s->max_insert_length && 1574 s->match_length--; /* string at strstart already in table */ 1581 } while (--s->match_length ! [all...] |
H A D | deflate.h | 153 uInt match_length; /* length of best match */ member in struct:internal_state
|
/macosx-10.9.5/xnu-2422.115.4/libkern/ |
H A D | mkext.c | 82 #define F 18 /* upper limit for match_length */ 84 if match_length is greater than this */ 97 * match_length of longest match. 100 int match_position, match_length; member in struct:encode_state 182 * via the global variables match_position and match_length. 183 * If match_length = F, then removes the old node in favor of the new one, 196 sp->match_length = 0; 219 if (i > sp->match_length) { 221 if ((sp->match_length = i) >= F)
|
/macosx-10.9.5/rsync-42/rsync/zlib/ |
H A D | deflate.c | 1005 s->match_length = s->prev_length = MIN_MATCH-1; 1495 * At this point we have always match_length < MIN_MATCH 1505 s->match_length = longest_match_fast (s, hash_head); 1509 s->match_length = longest_match (s, hash_head); 1511 s->match_length = longest_match_fast (s, hash_head); 1516 if (s->match_length >= MIN_MATCH) { 1517 check_match(s, s->strstart, s->match_start, s->match_length); 1520 s->match_length - MIN_MATCH, bflush); 1522 s->lookahead -= s->match_length; 1528 if (s->match_length < [all...] |
H A D | deflate.h | 153 uInt match_length; /* length of best match */ member in struct:internal_state
|
/macosx-10.9.5/xnu-2422.115.4/libkern/zlib/ |
H A D | deflate.c | 1032 s->match_length = s->prev_length = MIN_MATCH-1; 1506 * At this point we have always match_length < MIN_MATCH 1516 s->match_length = longest_match_fast (s, hash_head); 1520 s->match_length = longest_match (s, hash_head); 1522 s->match_length = longest_match_fast (s, hash_head); 1527 if (s->match_length >= MIN_MATCH) { 1528 check_match(s, s->strstart, s->match_start, s->match_length); 1531 s->match_length - MIN_MATCH, bflush); 1533 s->lookahead -= s->match_length; 1539 if (s->match_length < [all...] |
H A D | deflate.h | 180 uInt match_length; /* length of best match */ member in struct:internal_state
|
/macosx-10.9.5/ppp-727.90.1/Helpers/pppdump/ |
H A D | zlib.c | 296 uInt match_length; /* length of best match */ member in struct:deflate_state 941 s->match_length = MIN_MATCH-1; 1278 * At this point we have always match_length < MIN_MATCH 1286 s->match_length = longest_match (s, hash_head); 1290 if (s->match_length > s->lookahead) s->match_length = s->lookahead; 1292 if (s->match_length >= MIN_MATCH) { 1293 check_match(s, s->strstart, s->match_start, s->match_length); 1296 s->match_length - MIN_MATCH); 1298 s->lookahead -= s->match_length; [all...] |
/macosx-10.9.5/ksh-20/ksh/src/cmd/INIT/ |
H A D | ratz.c | 1358 uInt match_length; /* length of best match */ member in struct:internal_state
|