/external/qemu/distrib/zlib-1.2.3/ |
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/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
|