Home
last modified time | relevance | path

Searched refs:ins_h (Results 1 - 15 of 15) sorted by relevance

/third_party/node/deps/zlib/contrib/optimizations/
H A Dinsert_string.h62 UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH - 1)]); in insert_string()
67 s->ins_h = ((value * 66521 + 66521) >> 16) & s->hash_mask; in insert_string()
71 ret = s->head[s->ins_h]; in insert_string()
73 ret = s->prev[str & s->w_mask] = s->head[s->ins_h]; in insert_string()
75 s->head[s->ins_h] = str; in insert_string()
/third_party/node/deps/v8/third_party/zlib/contrib/optimizations/
H A Dinsert_string.h97 UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH - 1)]); in insert_string_c()
99 ret = s->head[s->ins_h]; in insert_string_c()
101 ret = s->prev[str & s->w_mask] = s->head[s->ins_h]; in insert_string_c()
103 s->head[s->ins_h] = str; in insert_string_c()
/third_party/skia/third_party/externals/zlib/contrib/optimizations/
H A Dinsert_string.h97 UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH - 1)]); in insert_string_c()
99 ret = s->head[s->ins_h]; in insert_string_c()
101 ret = s->prev[str & s->w_mask] = s->head[s->ins_h]; in insert_string_c()
103 s->head[s->ins_h] = str; in insert_string_c()
/third_party/zlib/
H A Ddeflate.c156 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
157 match_head = s->head[s->ins_h], \
158 s->head[s->ins_h] = (Pos)(str))
161 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
162 match_head = s->prev[(str) & s->w_mask] = s->head[s->ins_h], \
163 s->head[s->ins_h] = (Pos)(str))
312 s->ins_h = s->window[str]; in fill_window()
313 UPDATE_HASH(s, s->ins_h, s->window[str + 1]); in fill_window()
318 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); in fill_window()
320 s->prev[str & s->w_mask] = s->head[s->ins_h]; in fill_window()
[all...]
H A Ddeflate.h146 uInt ins_h; /* hash index of string to be inserted */ member
152 /* Number of bits by which ins_h must be shifted at each input
/third_party/node/deps/v8/third_party/zlib/
H A Dfill_window_sse.c131 s->ins_h = s->window[str]; in fill_window_sse()
133 UPDATE_HASH(s, s->ins_h, str + 1 - (MIN_MATCH-1)); in fill_window_sse()
138 /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage, in fill_window_sse()
H A Ddeflate.c1267 s->ins_h = 0;
1626 s->ins_h = s->window[str];
1627 UPDATE_HASH(s, s->ins_h, s->window[str + 1]);
1632 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
1634 s->prev[str & s->w_mask] = s->head[s->ins_h];
1636 s->head[s->ins_h] = (Pos)str;
1643 /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
1984 s->ins_h = s->window[s->strstart];
1985 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1989 /* If lookahead < MIN_MATCH, ins_h i
[all...]
H A Ddeflate.h142 uInt ins_h; /* hash index of string to be inserted */ member
148 /* Number of bits by which ins_h must be shifted at each input
/third_party/skia/third_party/externals/zlib/
H A Dfill_window_sse.c131 s->ins_h = s->window[str]; in fill_window_sse()
133 UPDATE_HASH(s, s->ins_h, str + 1 - (MIN_MATCH-1)); in fill_window_sse()
138 /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage, in fill_window_sse()
H A Ddeflate.c1259 s->ins_h = 0;
1616 s->ins_h = s->window[str];
1617 UPDATE_HASH(s, s->ins_h, s->window[str + 1]);
1622 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
1624 s->prev[str & s->w_mask] = s->head[s->ins_h];
1626 s->head[s->ins_h] = (Pos)str;
1633 /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
1968 s->ins_h = s->window[s->strstart];
1969 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1973 /* If lookahead < MIN_MATCH, ins_h i
[all...]
H A Ddeflate.h142 uInt ins_h; /* hash index of string to be inserted */ member
148 /* Number of bits by which ins_h must be shifted at each input
/third_party/libwebsockets/win32port/zlib/
H A Ddeflate.c179 (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))
377 * s->lookahead stays null, so s->ins_h will be recomputed at the next
380 s->ins_h = s->window[0];
381 UPDATE_HASH(s, s->ins_h, s->window[1]);
1087 s->ins_h
[all...]
H A Ddeflate.h136 uInt ins_h; /* hash index of string to be inserted */ member
142 /* Number of bits by which ins_h must be shifted at each input
/third_party/node/deps/zlib/
H A Ddeflate.c321 s->ins_h = s->window[str]; in fill_window()
322 UPDATE_HASH(s, s->ins_h, s->window[str + 1]); in fill_window()
327 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); in fill_window()
329 s->prev[str & s->w_mask] = s->head[s->ins_h]; in fill_window()
331 s->head[s->ins_h] = (Pos)str; in fill_window()
338 /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage, in fill_window()
729 s->ins_h = 0; in lm_init()
1935 s->ins_h = s->window[s->strstart]; in deflate_fast()
1936 UPDATE_HASH(s, s->ins_h, s->window[s->strstart + 1]); in deflate_fast()
1940 /* If lookahead < MIN_MATCH, ins_h i in deflate_fast()
[all...]
H A Ddeflate.h146 uInt ins_h; /* hash index of string to be inserted */ member
152 /* Number of bits by which ins_h must be shifted at each input

Completed in 23 milliseconds