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

/external/pdfium/third_party/zlib_v128/
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...]
/external/python/cpython2/Modules/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
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...]
/external/zlib/src/
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...]
/external/syslinux/com32/lib/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
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...]
/external/zlib/src/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...]
/external/toybox/toys/pending/
H A Dcompress.c183 struct huff { struct
193 static void len2huff(struct huff *huff, char bitlen[], int len) argument
199 memset(huff, 0, sizeof(struct huff));
200 for (i = 0; i<len; i++) huff->length[bitlen[i]]++;
203 *huff->length = *offset = 0;
204 for (i = 1; i<16; i++) offset[i] = offset[i-1] + huff->length[i-1];
206 for (i = 0; i<len; i++) if (bitlen[i]) huff->symbol[offset[bitlen[i]]++] = i;
213 static unsigned huff_and_puff(struct bitbuf *bb, struct huff *huf argument
[all...]
/external/webp/src/dec/
H A Dvp8l_dec.c220 HuffmanCode32* const huff) {
221 huff->bits += hcode.bits;
222 huff->value |= (uint32_t)hcode.value << shift;
223 assert(huff->bits <= HUFFMAN_TABLE_BITS);
231 HuffmanCode32* const huff = &htree_group->packed_table[bits]; local
234 huff->bits = hcode.bits + BITS_SPECIAL_MARKER;
235 huff->value = hcode.value;
237 huff->bits = 0;
238 huff->value = 0;
239 bits >>= AccumulateHCode(hcode, 8, huff);
219 AccumulateHCode(HuffmanCode hcode, int shift, HuffmanCode32* const huff) argument
[all...]

Completed in 1204 milliseconds