| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/zlib/ |
| inftrees.c | 48 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 += incr;
[all...] |
| /external/zlib/src/contrib/infback9/ |
| inftree9.c | 48 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 += incr
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/zlib/ |
| inftrees.c | 48 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 += incr;
[all...] |
| /external/pdfium/third_party/zlib_v128/ |
| inftrees.c | 48 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 += incr
[all...] |
| /external/python/cpython2/Modules/zlib/ |
| inftrees.c | 48 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 += incr
[all...] |
| /external/zlib/src/ |
| inftrees.c | 48 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 += incr
[all...] |
| /external/syslinux/com32/lib/zlib/ |
| inftrees.c | 48 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 += incr
[all...] |
| /external/toybox/toys/pending/ |
| compress.c | 183 struct huff { struct
193 static void len2huff(struct huff *huff, char bitlen[], int len)
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 *huff
[all...] |
| /prebuilts/go/darwin-x86/src/vendor/golang_org/x/net/http2/hpack/ |
| hpack_test.go | 629 huff := AppendHuffmanString(nil, msg)
633 if err := huffmanDecode(&out, max, huff); err != nil {
645 if err := huffmanDecode(&out, len(msg)-1, huff); err != ErrStringLength {
654 var huff []byte
668 huff = AppendHuffmanString(huff[:0], string(input))
669 encSize += int64(len(huff))
671 if err := huffmanDecode(&output, 0, huff); err != nil {
672 t.Errorf("Failed to decode %q -> %q -> error %v", input, huff, err)
676 t.Errorf("Roundtrip failure on %q -> %q -> %q", input, huff, output.Bytes()
[all...] |
| /prebuilts/go/linux-x86/src/vendor/golang_org/x/net/http2/hpack/ |
| hpack_test.go | 629 huff := AppendHuffmanString(nil, msg)
633 if err := huffmanDecode(&out, max, huff); err != nil {
645 if err := huffmanDecode(&out, len(msg)-1, huff); err != ErrStringLength {
654 var huff []byte
668 huff = AppendHuffmanString(huff[:0], string(input))
669 encSize += int64(len(huff))
671 if err := huffmanDecode(&output, 0, huff); err != nil {
672 t.Errorf("Failed to decode %q -> %q -> error %v", input, huff, err)
676 t.Errorf("Roundtrip failure on %q -> %q -> %q", input, huff, output.Bytes()
[all...] |
| /external/webp/src/dec/ |
| vp8l_dec.c | 220 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);
[all...] |
| /prebuilts/go/darwin-x86/src/image/jpeg/ |
| scan.go | 223 if err := d.refine(&b, &d.huff[acTable][scan[i].ta], zigStart, zigEnd, 1<<al); err != nil {
231 value, err := d.decodeHuffman(&d.huff[dcTable][scan[i].td])
250 huff := &d.huff[acTable][scan[i].ta]
252 value, err := d.decodeHuffman(huff)
|
| huffman.go | 107 h := &d.huff[tc][th]
|
| reader.go | 139 huff [maxTc + 1][maxTh + 1]huffman
|
| /prebuilts/go/linux-x86/src/image/jpeg/ |
| scan.go | 223 if err := d.refine(&b, &d.huff[acTable][scan[i].ta], zigStart, zigEnd, 1<<al); err != nil {
231 value, err := d.decodeHuffman(&d.huff[dcTable][scan[i].td])
250 huff := &d.huff[acTable][scan[i].ta]
252 value, err := d.decodeHuffman(huff)
|
| huffman.go | 107 h := &d.huff[tc][th]
|
| reader.go | 139 huff [maxTc + 1][maxTh + 1]huffman
|
| /hardware/intel/img/psb_video/src/ |
| tng_jpegdec.c | 723 VAHuffmanTableBufferJPEGBaseline *huff = (VAHuffmanTableBufferJPEGBaseline *) obj_buffer->buffer_data; local
734 table_entries += huff->huffman_table[table_id].num_dc_codes[bit_ind];
741 uint32_t num_codes = huff->huffman_table[table_id].num_dc_codes[bit_ind];
769 ctx->symbol_codes[0][table_id][table_ind].symbol = huff->huffman_table[table_id].dc_values[table_ind];
779 table_entries += huff->huffman_table[table_id].num_ac_codes[bit_ind];
788 uint32_t num_codes = huff->huffman_table[table_id].num_ac_codes[bit_ind];
813 ctx->symbol_codes[1][table_id][table_ind].symbol = huff->huffman_table[table_id].ac_values[table_ind];;
[all...] |
| /prebuilts/tools/common/m2/repository/org/json/json/20141113/ |
| json-20141113.jar | |
| /prebuilts/go/darwin-x86/src/compress/flate/ |
| huffman_bit_writer_test.go | 94 testWriterEOF(t, "huff", huffTest{input: in}, true)
[all...] |
| /prebuilts/go/linux-x86/src/compress/flate/ |
| huffman_bit_writer_test.go | 94 testWriterEOF(t, "huff", huffTest{input: in}, true)
[all...] |
