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

/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/zip30/
H A Ddeflate.c176 local unsigned ins_h; /* hash index of string to be inserted */ variable
179 /* Number of bits by which ins_h and del_h must be shifted at each
290 (UPDATE_HASH(ins_h, window[(s) + (MIN_MATCH-1)]), \
291 prev[(s) & WMASK] = match_head = head[ins_h], \
292 head[ins_h] = (s))
378 ins_h = 0;
379 for (j=0; j<MIN_MATCH-1; j++) UPDATE_HASH(ins_h, window[j]);
380 /* If lookahead < MIN_MATCH, ins_h is garbage, but this is
764 ins_h = window[strstart];
765 UPDATE_HASH(ins_h, windo
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/zlib-1.2.8/
H A Ddeflate.c182 (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;
1126 s->ins_h
[all...]
H A Ddeflate.h139 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
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/zlib-1.2.7/
H A Ddeflate.c182 (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;
1124 s->ins_h
[all...]
H A Ddeflate.h139 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
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/lib/zlib_deflate/
H A Ddeflate.c154 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
155 s->prev[(str) & s->w_mask] = match_head = s->head[s->ins_h], \
156 s->head[s->ins_h] = (Pos)(str))
531 s->ins_h = 0;
802 s->ins_h = s->window[s->strstart];
803 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
808 /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
971 s->ins_h = s->window[s->strstart];
972 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
976 /* If lookahead < MIN_MATCH, ins_h i
[all...]
H A Ddefutil.h112 uInt ins_h; /* hash index of string to be inserted */ member in struct:deflate_state
118 /* Number of bits by which ins_h must be shifted at each input
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/src/zlib/
H A Ddeflate.c185 (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]);
1005 s->ins_h
[all...]
H A Ddeflate.h136 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
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/zlib-1.2.3/
H A Ddeflate.c185 (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]);
1005 s->ins_h
[all...]
H A Ddeflate.h136 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
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/transmission/zlib-1.2.3/
H A Ddeflate.c185 (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]);
1005 s->ins_h
[all...]
H A Ddeflate.h136 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
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/zip30/human68k/
H A Ddeflate.s193 ins_h: ds.w 1 ; unsigned short define
483 ; Arg 1 is D-reg that new ins_h value is to be left in,
486 move.w (ins_h,pc),_1
489 and.w #HASH_MASK,_1 ; ((ins_h << H_SHIFT) ^ c) & HASH_MASK
490 move.w _1,ins_h ; ins_h = that
502 move.w (_1),Head ; hash_head = head[ins_h]
503 move.w Strst,(_1) ; head[ins_h] = strstart
758 move.w d1,ins_h
1060 clr.w ins_h
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/src/router/busybox-1.x/archival/
H A Dgzip.c245 unsigned ins_h; /* hash index of string to be inserted */ member in struct:globals
248 /* Number of bits by which ins_h and del_h must be shifted at each
1713 UPDATE_HASH(G1.ins_h, G1.window[(s) + MIN_MATCH-1]); \
1714 G1.prev[(s) & WMASK] = match_head = head[G1.ins_h]; \
1715 head[G1.ins_h] = (s); \
1870 G1.ins_h = 0;
1872 UPDATE_HASH(G1.ins_h, G1.window[j]);
1873 /* If lookahead < MIN_MATCH, ins_h is garbage, but this is
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/ppp-2.4.4/pppdump/
H A Dzlib.c257 uInt ins_h; /* hash index of string to be inserted */ member in struct:deflate_state
263 /* Number of bits by which ins_h must be shifted at each input
566 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
567 s->prev[(str) & s->w_mask] = match_head = s->head[s->ins_h], \
568 s->head[s->ins_h] = (str))
921 s->ins_h = 0;
1187 s->ins_h = s->window[s->strstart];
1188 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1193 /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
1295 s->ins_h
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/src/router/ppp/pppdump/
H A Dzlib.c257 uInt ins_h; /* hash index of string to be inserted */ member in struct:deflate_state
263 /* Number of bits by which ins_h must be shifted at each input
566 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
567 s->prev[(str) & s->w_mask] = match_head = s->head[s->ins_h], \
568 s->head[s->ins_h] = (str))
921 s->ins_h = 0;
1187 s->ins_h = s->window[s->strstart];
1188 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1193 /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
1295 s->ins_h
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/ppp-2.4.4/common/
H A Dzlib.c382 uInt ins_h; /* hash index of string to be inserted */ member in struct:deflate_state
388 /* Number of bits by which ins_h must be shifted at each input
709 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
710 s->prev[(str) & s->w_mask] = match_head = s->head[s->ins_h], \
711 s->head[s->ins_h] = (Pos)(str))
852 * s->lookahead stays null, so s->ins_h will be recomputed at the next
855 s->ins_h = s->window[0];
856 UPDATE_HASH(s, s->ins_h, s->window[1]);
1250 s->ins_h = 0;
1523 s->ins_h
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/src/router/ppp/common/
H A Dzlib.c382 uInt ins_h; /* hash index of string to be inserted */ member in struct:deflate_state
388 /* Number of bits by which ins_h must be shifted at each input
709 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
710 s->prev[(str) & s->w_mask] = match_head = s->head[s->ins_h], \
711 s->head[s->ins_h] = (Pos)(str))
852 * s->lookahead stays null, so s->ins_h will be recomputed at the next
855 s->ins_h = s->window[0];
856 UPDATE_HASH(s, s->ins_h, s->window[1]);
1250 s->ins_h = 0;
1523 s->ins_h
[all...]

Completed in 232 milliseconds