/external/clang/test/CoverageMapping/ |
H A D | loopmacro.c | 13 (UPDATE_HASH(ins_h, window[(s) + MIN_MATCH-1]), \ 26 #define H_SHIFT ((HASH_BITS+MIN_MATCH-1)/MIN_MATCH) 33 #define MIN_MATCH 3 macro
|
/external/pdfium/third_party/zlib_v128/ |
H A D | trees.h | 103 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
|
H A D | deflate.c | 146 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4 177 * input characters and the first MIN_MATCH bytes of str are valid 178 * (except for the last MIN_MATCH-1 bytes of the input file). 182 (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)]), \ 290 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH); 363 while (s->lookahead >= MIN_MATCH) { 365 n = s->lookahead - (MIN_MATCH-1); 367 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH [all...] |
H A D | deflate.h | 146 * step. It must be such that after MIN_MATCH steps, the oldest 148 * hash_shift * MIN_MATCH >= hash_bits 281 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 283 * See deflate.c for comments about the MIN_MATCH+1.
|
H A D | trees.c | 104 uch _length_code[MAX_MATCH-MIN_MATCH+1]; 105 /* length code for each normalized match length (0 == MIN_MATCH) */ 108 /* First normalized length for each code (0 = MIN_MATCH) */ 356 "const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {\n"); 357 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { 359 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); 1013 unsigned lc) /* match length-MIN_MATCH or unmatched char (if dist==0) */ 1022 /* Here, lc is the match length - MIN_MATCH */ 1025 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && 1078 /* Here, lc is the match length - MIN_MATCH */ [all...] |
H A D | zutil.h | 77 #define MIN_MATCH 3 macro
|
/external/syslinux/com32/lib/zlib/ |
H A D | trees.h | 102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
|
H A D | deflate.c | 146 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4 174 * input characters and the first MIN_MATCH bytes of str are valid 175 * (except for the last MIN_MATCH-1 bytes of the input file). 179 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ 184 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ 279 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH); 330 if (length < MIN_MATCH) return Z_OK; 345 for (n = 0; n <= length - MIN_MATCH; n++) { 1039 s->match_length = s->prev_length = MIN_MATCH [all...] |
H A D | deflate.h | 143 * step. It must be such that after MIN_MATCH steps, the oldest 145 * hash_shift * MIN_MATCH >= hash_bits 278 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 280 * See deflate.c for comments about the MIN_MATCH+1.
|
H A D | zutil.h | 71 #define MIN_MATCH 3 macro
|
H A D | trees.c | 109 uch _length_code[MAX_MATCH-MIN_MATCH+1]; 110 /* length code for each normalized match length (0 == MIN_MATCH) */ 113 /* First normalized length for each code (0 = MIN_MATCH) */ 361 "const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {\n"); 362 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { 364 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); 1029 unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */ 1038 /* Here, lc is the match length - MIN_MATCH */ 1041 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && 1094 /* Here, lc is the match length - MIN_MATCH */ [all...] |
/external/zlib/src/ |
H A D | trees.h | 102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
|
H A D | deflate.c | 146 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4 177 * input characters and the first MIN_MATCH bytes of str are valid 178 * (except for the last MIN_MATCH-1 bytes of the input file). 182 (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 [all...] |
H A D | deflate.h | 146 * step. It must be such that after MIN_MATCH steps, the oldest 148 * hash_shift * MIN_MATCH >= hash_bits 281 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 283 * See deflate.c for comments about the MIN_MATCH+1.
|
H A D | trees.c | 104 uch _length_code[MAX_MATCH-MIN_MATCH+1]; 105 /* length code for each normalized match length (0 == MIN_MATCH) */ 108 /* First normalized length for each code (0 = MIN_MATCH) */ 356 "const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {\n"); 357 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { 359 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); 1013 unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */ 1022 /* Here, lc is the match length - MIN_MATCH */ 1025 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && 1078 /* Here, lc is the match length - MIN_MATCH */ [all...] |
H A D | zutil.h | 75 #define MIN_MATCH 3 macro
|
/external/sqlite/android/ |
H A D | OldPhoneNumberUtils.cpp | 25 static int MIN_MATCH = 7; member in namespace:android 189 * - requires MIN_MATCH (7) characters to match 246 if (matched < MIN_MATCH) { 250 // if the number of dialable chars in a and b match, but the matched chars < MIN_MATCH, 260 if (matched >= MIN_MATCH && (ia < 0 || ib < 0)) {
|
/external/zlib/src/contrib/asm686/ |
H A D | match.S | 29 #define MIN_MATCH (3) define 30 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1)
|
/external/freetype/src/gzip/ |
H A D | zutil.h | 64 #define MIN_MATCH 3 macro
|
/external/zlib/src/contrib/amd64/ |
H A D | amd64-match.S | 40 #define MIN_MATCH (3) define 41 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1)
|
/external/zlib/src/contrib/gcc_gvmat64/ |
H A D | gvmat64.S | 94 #define MIN_MATCH 3
define 95 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
|
/external/zlib/src/contrib/masmx86/ |
H A D | match686.asm | 107 MIN_MATCH equ 3
define 108 MIN_LOOKAHEAD equ (MAX_MATCH+MIN_MATCH+1)
113 MIN_MATCH equ 3
define 114 MIN_LOOKAHEAD equ (MAX_MATCH + MIN_MATCH + 1)
|
/external/zlib/src/contrib/masmx64/ |
H A D | gvmat64.asm | 121 MIN_MATCH equ 3
define 122 MIN_LOOKAHEAD equ (MAX_MATCH+MIN_MATCH+1)
|
/external/owasp/sanitizer/tools/findbugs/lib/ |
H A D | findbugs.jar | META-INF/ META-INF/MANIFEST.MF default.xsl edu/ edu/umd/ edu/umd/cs/ edu/ ... |
/external/robolectric/v3/runtime/ |
H A D | android-all-4.1.2_r1-robolectric-0.jar | META-INF/ META-INF/MANIFEST.MF android/ android/accessibilityservice/ android/accessibilityservice/AccessibilityService$1.class ... |