/external/chromium_org/third_party/zlib/ |
trees.h | 102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
|
deflate.c | 147 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4 175 * input characters and the first MIN_MATCH bytes of str are valid 176 * (except for the last MIN_MATCH-1 bytes of the input file). 180 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ 185 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ 280 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH); 334 if (length < MIN_MATCH) return Z_OK; 349 for (n = 0; n <= length - MIN_MATCH; n++) { [all...] |
deflate.h | 148 * step. It must be such that after MIN_MATCH steps, the oldest 150 * hash_shift * MIN_MATCH >= hash_bits 283 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 285 * See deflate.c for comments about the MIN_MATCH+1.
|
zutil.h | 86 #define MIN_MATCH 3
|
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)); [all...] |
/external/qemu/distrib/zlib-1.2.3/ |
trees.h | 102 const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {
|
deflate.c | 113 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 115 * See deflate.c for comments about the MIN_MATCH+1. 152 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4 180 * input characters and the first MIN_MATCH bytes of str are valid 181 * (except for the last MIN_MATCH-1 bytes of the input file). 185 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ 190 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ 285 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH); 334 if (length < MIN_MATCH) return Z_OK [all...] |
deflate.h | 143 * step. It must be such that after MIN_MATCH steps, the oldest 145 * hash_shift * MIN_MATCH >= hash_bits 271 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 273 * See deflate.c for comments about the MIN_MATCH+1.
|
trees.c | 108 uch _length_code[MAX_MATCH-MIN_MATCH+1]; 109 /* length code for each normalized match length (0 == MIN_MATCH) */ 112 /* First normalized length for each code (0 = MIN_MATCH) */ 357 fprintf(header, "const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {\n"); 358 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { 360 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); [all...] |
zutil.h | 81 #define MIN_MATCH 3
|
/external/zlib/src/ |
trees.h | 102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
|
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-1]) [all...] |
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.
|
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)); [all...] |
zutil.h | 75 #define MIN_MATCH 3
|
/external/sqlite/android/ |
OldPhoneNumberUtils.cpp | 25 static int MIN_MATCH = 7; 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/ |
match.S | 29 #define MIN_MATCH (3) 30 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1)
|
/packages/providers/ContactsProvider/src/com/android/providers/contacts/ |
DataRowHandlerForPhoneNumber.java | 125 phoneValues.put(PhoneLookupColumns.MIN_MATCH, 131 phoneValues.put(PhoneLookupColumns.MIN_MATCH,
|
ContactsDatabaseHelper.java | 509 public static final String MIN_MATCH = "min_match"; [all...] |
/external/zlib/src/contrib/amd64/ |
amd64-match.S | 40 #define MIN_MATCH (3) 41 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1)
|
/external/zlib/src/contrib/gcc_gvmat64/ |
gvmat64.S | 94 #define MIN_MATCH 3
95 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
|
/external/zlib/src/contrib/masmx86/ |
match686.asm | 107 MIN_MATCH equ 3
108 MIN_LOOKAHEAD equ (MAX_MATCH+MIN_MATCH+1)
113 MIN_MATCH equ 3
114 MIN_LOOKAHEAD equ (MAX_MATCH + MIN_MATCH + 1)
|
/frameworks/base/telephony/java/android/telephony/ |
PhoneNumberUtils.java | 447 * - requires MIN_MATCH (7) characters to match 501 if (matched < MIN_MATCH) { 506 // if the number of dialable chars in a and b match, but the matched chars < MIN_MATCH, 516 if (matched >= MIN_MATCH && (ia < 0 || ib < 0)) { 705 * Returns the rightmost MIN_MATCH (5) characters in the network portion 716 return internalGetStrippedReversed(np, MIN_MATCH); [all...] |
/external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/tests/ |
opt-gvmat64.asm | 84 %define MIN_MATCH 3 85 %define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
|
/external/zlib/src/contrib/masmx64/ |
gvmat64.asm | 121 MIN_MATCH equ 3
122 MIN_LOOKAHEAD equ (MAX_MATCH+MIN_MATCH+1)
|