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

/netgear-WNDR4500-V1.0.1.40_1.0.68/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-WNDR4500-V1.0.1.40_1.0.68/ap/gpl/minidlna/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-WNDR4500-V1.0.1.40_1.0.68/src/linux/linux-2.6/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-WNDR4500-V1.0.1.40_1.0.68/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-WNDR4500-V1.0.1.40_1.0.68/ap/gpl/minidlna/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-WNDR4500-V1.0.1.40_1.0.68/ap/gpl/minidlna/ffmpeg-0.5.1/libavcodec/
H A Dtruemotion2.c88 static int tm2_read_tree(TM2Context *ctx, uint32_t prefix, int length, TM2Huff *huff) argument
90 if(length > huff->max_bits) {
91 av_log(ctx->avctx, AV_LOG_ERROR, "Tree exceeded its given depth (%i)\n", huff->max_bits);
99 if(huff->num >= huff->max_num) {
103 huff->nums[huff->num] = get_bits_long(&ctx->gb, huff->val_bits);
104 huff->bits[huff
119 TM2Huff huff; local
[all...]
H A Dsmacker.c175 HuffContext huff; local
248 huff.length = ((size + 3) >> 2) + 3;
249 huff.maxlength = 0;
250 huff.current = 0;
251 huff.values = av_mallocz(huff.length * sizeof(int));
253 smacker_decode_bigtree(gb, &huff, &ctx);
255 if(ctx.last[0] == -1) ctx.last[0] = huff.current++;
256 if(ctx.last[1] == -1) ctx.last[1] = huff.current++;
257 if(ctx.last[2] == -1) ctx.last[2] = huff
[all...]

Completed in 167 milliseconds