Searched refs:huff (Results 1 - 14 of 14) sorted by relevance

/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/zlib-1.2.3/contrib/infback9/
H A Dinftree9.c48 unsigned huff; /* Huffman code */ local
145 filled is at next and has curr index bits. The code being used is huff
153 of the low root bits of huff. This is saved in low to check for when a
195 huff = 0; /* starting code */
226 /* replicate for those indices with low len bits equal to huff */
231 next[(huff >> drop) + fill] = this;
234 /* backwards increment the len-bit code huff */
236 while (huff & incr)
239 huff &= incr - 1;
240 huff
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/transmission/zlib-1.2.3/contrib/infback9/
H A Dinftree9.c48 unsigned huff; /* Huffman code */ local
145 filled is at next and has curr index bits. The code being used is huff
153 of the low root bits of huff. This is saved in low to check for when a
195 huff = 0; /* starting code */
226 /* replicate for those indices with low len bits equal to huff */
231 next[(huff >> drop) + fill] = this;
234 /* backwards increment the len-bit code huff */
236 while (huff & incr)
239 huff &= incr - 1;
240 huff
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/lib/zlib_inflate/
H A Dinftrees.c34 unsigned huff; /* Huffman code */ local
137 filled is at next and has curr index bits. The code being used is huff
145 of the low root bits of huff. This is saved in low to check for when a
187 huff = 0; /* starting code */
218 /* replicate for those indices with low len bits equal to huff */
224 next[(huff >> drop) + fill] = this;
227 /* backwards increment the len-bit code huff */
229 while (huff & incr)
232 huff &= incr - 1;
233 huff
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/zlib-1.2.8/
H A Dinftrees.c48 unsigned huff; /* Huffman code */ local
151 filled is at next and has curr index bits. The code being used is huff
159 of the low root bits of huff. This is saved in low to check for when a
200 huff = 0; /* starting code */
232 /* replicate for those indices with low len bits equal to huff */
238 next[(huff >> drop) + fill] = here;
241 /* backwards increment the len-bit code huff */
243 while (huff & incr)
246 huff &= incr - 1;
247 huff
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/zlib-1.2.7/
H A Dinftrees.c48 unsigned huff; /* Huffman code */ local
151 filled is at next and has curr index bits. The code being used is huff
159 of the low root bits of huff. This is saved in low to check for when a
200 huff = 0; /* starting code */
232 /* replicate for those indices with low len bits equal to huff */
238 next[(huff >> drop) + fill] = here;
241 /* backwards increment the len-bit code huff */
243 while (huff & incr)
246 huff &= incr - 1;
247 huff
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/zlib-1.2.8/contrib/infback9/
H A Dinftree9.c48 unsigned huff; /* Huffman code */ local
145 filled is at next and has curr index bits. The code being used is huff
153 of the low root bits of huff. This is saved in low to check for when a
194 huff = 0; /* starting code */
226 /* replicate for those indices with low len bits equal to huff */
231 next[(huff >> drop) + fill] = this;
234 /* backwards increment the len-bit code huff */
236 while (huff & incr)
239 huff &= incr - 1;
240 huff
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/src/zlib/
H A Dinftrees.c48 unsigned huff; /* Huffman code */ local
151 filled is at next and has curr index bits. The code being used is huff
159 of the low root bits of huff. This is saved in low to check for when a
201 huff = 0; /* starting code */
232 /* replicate for those indices with low len bits equal to huff */
238 next[(huff >> drop) + fill] = this;
241 /* backwards increment the len-bit code huff */
243 while (huff & incr)
246 huff &= incr - 1;
247 huff
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/zlib-1.2.3/
H A Dinftrees.c48 unsigned huff; /* Huffman code */ local
151 filled is at next and has curr index bits. The code being used is huff
159 of the low root bits of huff. This is saved in low to check for when a
201 huff = 0; /* starting code */
232 /* replicate for those indices with low len bits equal to huff */
238 next[(huff >> drop) + fill] = this;
241 /* backwards increment the len-bit code huff */
243 while (huff & incr)
246 huff &= incr - 1;
247 huff
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/transmission/zlib-1.2.3/
H A Dinftrees.c48 unsigned huff; /* Huffman code */ local
151 filled is at next and has curr index bits. The code being used is huff
159 of the low root bits of huff. This is saved in low to check for when a
201 huff = 0; /* starting code */
232 /* replicate for those indices with low len bits equal to huff */
238 next[(huff >> drop) + fill] = this;
241 /* backwards increment the len-bit code huff */
243 while (huff & incr)
246 huff &= incr - 1;
247 huff
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/zlib-1.2.7/contrib/infback9/
H A Dinftree9.c48 unsigned huff; /* Huffman code */ local
145 filled is at next and has curr index bits. The code being used is huff
153 of the low root bits of huff. This is saved in low to check for when a
194 huff = 0; /* starting code */
226 /* replicate for those indices with low len bits equal to huff */
231 next[(huff >> drop) + fill] = this;
234 /* backwards increment the len-bit code huff */
236 while (huff & incr)
239 huff &= incr - 1;
240 huff
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/ffmpeg-2.3.4/libavcodec/
H A Dtruemotion2.c114 static int tm2_read_tree(TM2Context *ctx, uint32_t prefix, int length, TM2Huff *huff) argument
117 if (length > huff->max_bits) {
119 huff->max_bits);
127 if (huff->num >= huff->max_num) {
131 huff->nums[huff->num] = get_bits_long(&ctx->gb, huff->val_bits);
132 huff->bits[huff
147 TM2Huff huff; local
[all...]
H A Dsmacker.c182 HuffContext huff; local
271 huff.length = ((size + 3) >> 2) + 4;
272 huff.maxlength = 0;
273 huff.current = 0;
274 huff.values = av_mallocz_array(huff.length, sizeof(int));
275 if (!huff.values) {
280 if (smacker_decode_bigtree(gb, &huff, &ctx) < 0)
283 if(ctx.last[0] == -1) ctx.last[0] = huff.current++;
284 if(ctx.last[1] == -1) ctx.last[1] = huff
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libav-0.8.8/libavcodec/
H A Dtruemotion2.c91 static int tm2_read_tree(TM2Context *ctx, uint32_t prefix, int length, TM2Huff *huff) argument
93 if(length > huff->max_bits) {
94 av_log(ctx->avctx, AV_LOG_ERROR, "Tree exceeded its given depth (%i)\n", huff->max_bits);
102 if(huff->num >= huff->max_num) {
106 huff->nums[huff->num] = get_bits_long(&ctx->gb, huff->val_bits);
107 huff->bits[huff
122 TM2Huff huff; local
[all...]
H A Dsmacker.c181 HuffContext huff; local
255 huff.length = ((size + 3) >> 2) + 4;
256 huff.maxlength = 0;
257 huff.current = 0;
258 huff.values = av_mallocz(huff.length * sizeof(int));
260 if (smacker_decode_bigtree(gb, &huff, &ctx) < 0)
263 if(ctx.last[0] == -1) ctx.last[0] = huff.current++;
264 if(ctx.last[1] == -1) ctx.last[1] = huff.current++;
265 if(ctx.last[2] == -1) ctx.last[2] = huff
[all...]

Completed in 188 milliseconds