/external/clang/test/CoverageMapping/ |
loopmacro.c | 13 (UPDATE_HASH(ins_h, window[(s) + MIN_MATCH-1]), \ 14 prev[(s) & WMASK] = match_head = head[ins_h], \ 15 head[ins_h] = (s)) 39 int ins_h = 1; local
|
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/zlib/ |
deflate.c | 182 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
183 match_head = s->head[s->ins_h], \
184 s->head[s->ins_h] = (Pos)(str))
187 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
188 match_head = s->prev[(str) & s->w_mask] = s->head[s->ins_h], \
189 s->head[s->ins_h] = (Pos)(str))
368 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
370 s->prev[str & s->w_mask] = s->head[s->ins_h];
372 s->head[s->ins_h] = (Pos)str;
[all...] |
deflate.h | 139 uInt ins_h; /* hash index of string to be inserted */
member in struct:internal_state 145 /* Number of bits by which ins_h must be shifted at each input
|
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/zlib/ |
deflate.c | 185 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
186 match_head = s->head[s->ins_h], \
187 s->head[s->ins_h] = (Pos)(str))
190 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
191 match_head = s->prev[(str) & s->w_mask] = s->head[s->ins_h], \
192 s->head[s->ins_h] = (Pos)(str))
344 * s->lookahead stays null, so s->ins_h will be recomputed at the next
347 s->ins_h = s->window[0];
348 UPDATE_HASH(s, s->ins_h, s->window[1]);
[all...] |
deflate.h | 136 uInt ins_h; /* hash index of string to be inserted */
member in struct:internal_state 142 /* Number of bits by which ins_h must be shifted at each input
|
/external/u-boot/lib/zlib/ |
deflate.c | 179 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ 180 match_head = s->head[s->ins_h], \ 181 s->head[s->ins_h] = (Pos)(str)) 184 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ 185 match_head = s->prev[(str) & s->w_mask] = s->head[s->ins_h], \ 186 s->head[s->ins_h] = (Pos)(str)) 340 * s->lookahead stays null, so s->ins_h will be recomputed at the next 343 s->ins_h = s->window[0]; 344 UPDATE_HASH(s, s->ins_h, s->window[1]); [all...] |
deflate.h | 136 uInt ins_h; /* hash index of string to be inserted */ member in struct:internal_state 142 /* Number of bits by which ins_h must be shifted at each input
|
/external/python/cpython2/Modules/zlib/ |
deflate.c | 178 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ 179 match_head = s->head[s->ins_h], \ 180 s->head[s->ins_h] = (Pos)(str)) 183 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ 184 match_head = s->prev[(str) & s->w_mask] = s->head[s->ins_h], \ 185 s->head[s->ins_h] = (Pos)(str)) 421 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); 423 s->prev[str & s->w_mask] = s->head[s->ins_h]; 425 s->head[s->ins_h] = (Pos)str; [all...] |
deflate.h | 142 uInt ins_h; /* hash index of string to be inserted */ member in struct:internal_state 148 /* Number of bits by which ins_h must be shifted at each input
|
/external/zlib/src/ |
deflate.c | 178 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ 179 match_head = s->head[s->ins_h], \ 180 s->head[s->ins_h] = (Pos)(str)) 183 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ 184 match_head = s->prev[(str) & s->w_mask] = s->head[s->ins_h], \ 185 s->head[s->ins_h] = (Pos)(str)) 421 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); 423 s->prev[str & s->w_mask] = s->head[s->ins_h]; 425 s->head[s->ins_h] = (Pos)str; [all...] |
deflate.h | 142 uInt ins_h; /* hash index of string to be inserted */ member in struct:internal_state 148 /* Number of bits by which ins_h must be shifted at each input
|