Home
last modified time | relevance | path

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

/minix3/external/bsd/llvm/dist/clang/test/CoverageMapping/
H A Dloopmacro.c4 #define MIN_MATCH 3 macro
5 #define H_SHIFT ((HASH_BITS+MIN_MATCH-1)/MIN_MATCH)
10 (UPDATE_HASH(ins_h, window[(s) + MIN_MATCH-1]), \
/minix3/common/dist/zlib/
H A Ddeflate.c115 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
187 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
192 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
287 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
336 if (length < MIN_MATCH) return Z_OK;
351 for (n = 0; n <= length - MIN_MATCH; n++) {
1005 s->match_length = s->prev_length = MIN_MATCH-1;
1199 if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
1224 if (len < MIN_MATCH) return MIN_MATCH - 1;
1348 if (s->lookahead >= MIN_MATCH) {
[all …]
H A Dtrees.h104 const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {
H A Dzutil.h90 #define MIN_MATCH 3 macro
H A Ddeflate.h273 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
H A Dtrees.c110 uch _length_code[MAX_MATCH-MIN_MATCH+1];
360 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
362 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1040 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
/minix3/common/dist/zlib/contrib/asm686/
H A Dmatch.S15 #define MIN_MATCH (3) macro
16 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1)
/minix3/common/dist/zlib/contrib/asm586/
H A Dmatch.S15 #define MIN_MATCH (3) macro
16 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1)
/minix3/common/dist/zlib/contrib/masmx64/
H A Dgvmat64.asm82 MIN_MATCH equ 3 define
83 MIN_LOOKAHEAD equ (MAX_MATCH+MIN_MATCH+1)
/minix3/common/dist/zlib/contrib/masm686/
H A Dmatch.asm26 MIN_MATCH EQU 3 define
27 MIN_LOOKAHEAD EQU (MAX_MATCH + MIN_MATCH + 1)