| /third_party/zlib/contrib/infback9/ |
| H A D | inftree9.c | 43 unsigned huff; /* Huffman code */ in inflate_table9() local
140 filled is at next and has curr index bits. The code being used is huff in inflate_table9()
148 of the low root bits of huff. This is saved in low to check for when a in inflate_table9()
189 huff = 0; /* starting code */ in inflate_table9()
221 /* replicate for those indices with low len bits equal to huff */ in inflate_table9()
226 next[(huff >> drop) + fill] = this; in inflate_table9()
229 /* backwards increment the len-bit code huff */ in inflate_table9()
231 while (huff & incr) in inflate_table9()
234 huff &= incr - 1; in inflate_table9()
235 huff in inflate_table9()
[all...] |
| /third_party/libwebsockets/win32port/zlib/ |
| H A D | 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
198 huff = 0; /* starting code */
230 /* replicate for those indices with low len bits equal to huff */
236 next[(huff >> drop) + fill] = here;
239 /* backwards increment the len-bit code huff */
241 while (huff & incr)
244 huff &= incr - 1;
245 huff
[all...] |
| /third_party/ffmpeg/libavcodec/ |
| H A D | truemotion2.c | 119 static int tm2_read_tree(TM2Context *ctx, int length, TM2Huff *huff) in tm2_read_tree() argument
122 if (length > huff->max_bits) { in tm2_read_tree()
124 huff->max_bits); in tm2_read_tree()
132 if (huff->num >= huff->max_num) { in tm2_read_tree()
136 huff->nums[huff->num] = get_bits_long(&ctx->gb, huff->val_bits); in tm2_read_tree()
137 huff->lens[huff in tm2_read_tree()
151 TM2Huff huff; tm2_build_huff_table() local
[all...] |
| H A D | vaapi_mjpeg.c | 78 VAHuffmanTableBufferJPEGBaseline huff; in vaapi_mjpeg_decode_slice() local
83 memset(&huff, 0, sizeof(huff)); in vaapi_mjpeg_decode_slice()
85 huff.load_huffman_table[i] = 1; in vaapi_mjpeg_decode_slice()
87 huff.huffman_table[i].num_dc_codes[j] = s->raw_huffman_lengths[0][i][j]; in vaapi_mjpeg_decode_slice()
89 huff.huffman_table[i].dc_values[j] = s->raw_huffman_values[0][i][j]; in vaapi_mjpeg_decode_slice()
91 huff.huffman_table[i].num_ac_codes[j] = s->raw_huffman_lengths[1][i][j]; in vaapi_mjpeg_decode_slice()
93 huff.huffman_table[i].ac_values[j] = s->raw_huffman_values[1][i][j]; in vaapi_mjpeg_decode_slice()
98 &huff, sizeof(huff)); in vaapi_mjpeg_decode_slice()
[all...] |
| H A D | vaapi_encode_mjpeg.c | 186 VAHuffmanTableBufferJPEGBaseline *huff; in vaapi_encode_mjpeg_write_extra_buffer() local
188 if (*data_len < sizeof(*huff)) in vaapi_encode_mjpeg_write_extra_buffer()
191 *data_len = sizeof(*huff); in vaapi_encode_mjpeg_write_extra_buffer()
193 huff = (VAHuffmanTableBufferJPEGBaseline*)data; in vaapi_encode_mjpeg_write_extra_buffer()
194 memset(huff, 0, sizeof(*huff)); in vaapi_encode_mjpeg_write_extra_buffer()
199 huff->load_huffman_table[t] = 1; in vaapi_encode_mjpeg_write_extra_buffer()
203 k += (huff->huffman_table[t].num_dc_codes[i] = ht->L[i]); in vaapi_encode_mjpeg_write_extra_buffer()
204 av_assert0(k <= sizeof(huff->huffman_table[t].dc_values)); in vaapi_encode_mjpeg_write_extra_buffer()
206 huff in vaapi_encode_mjpeg_write_extra_buffer()
324 JPEGRawHuffmanTable *huff = &priv->huffman_tables.table[t]; vaapi_encode_mjpeg_init_picture_params() local
[all...] |
| H A D | atrac9dec.c | 421 const HuffmanCodebook *huff = &at9_huffman_coeffs[cb][prec][cbi]; in read_coeffs_coarse() local
422 const int groups = bands >> huff->value_cnt_pow; in read_coeffs_coarse()
427 for (int k = 0; k < huff->value_cnt; k++) { in read_coeffs_coarse()
428 coeffs[k] = sign_extend(val, huff->value_bits); in read_coeffs_coarse()
429 val >>= huff->value_bits; in read_coeffs_coarse()
432 coeffs += huff->value_cnt; in read_coeffs_coarse()
|
| H A D | vp3.c | 2848 static int read_huffman_tree(HuffTable *huff, GetBitContext *gb, int length, in read_huffman_tree() argument
2853 if (huff->nb_entries >= 32) { /* overflow */ in read_huffman_tree()
2859 length, huff->nb_entries, token); in read_huffman_tree()
2860 huff->entries[huff->nb_entries++] = (HuffEntry){ length, token }; in read_huffman_tree()
2868 if (read_huffman_tree(huff, gb, length, avctx)) in read_huffman_tree()
2870 if (read_huffman_tree(huff, gb, length, avctx)) in read_huffman_tree()
|
| H A D | utvideodec.c | 93 const uint8_t *src, const uint8_t *huff, in decode_plane10()
102 if ((ret = build_huff(c, huff, &vlc, &fsym, 1024)) < 0) { in decode_plane10()
90 decode_plane10(UtvideoContext *c, int plane_no, uint16_t *dst, ptrdiff_t stride, int width, int height, const uint8_t *src, const uint8_t *huff, int use_pred) decode_plane10() argument
|
| /third_party/node/deps/v8/third_party/zlib/ |
| H A D | 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
198 huff = 0; /* starting code */
230 /* replicate for those indices with low len bits equal to huff */
236 next[(huff >> drop) + fill] = here;
239 /* backwards increment the len-bit code huff */
241 while (huff & incr)
244 huff &= incr - 1;
245 huff
[all...] |
| /third_party/node/deps/zlib/ |
| H A D | inftrees.c | 43 unsigned huff; /* Huffman code */ in inflate_table() local
146 filled is at next and has curr index bits. The code being used is huff in inflate_table()
154 of the low root bits of huff. This is saved in low to check for when a in inflate_table()
193 huff = 0; /* starting code */ in inflate_table()
225 /* replicate for those indices with low len bits equal to huff */ in inflate_table()
231 next[(huff >> drop) + fill] = here; in inflate_table()
234 /* backwards increment the len-bit code huff */ in inflate_table()
236 while (huff & incr) in inflate_table()
239 huff &= incr - 1; in inflate_table()
240 huff in inflate_table()
[all...] |
| /third_party/skia/third_party/externals/zlib/ |
| H A D | 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
198 huff = 0; /* starting code */
230 /* replicate for those indices with low len bits equal to huff */
236 next[(huff >> drop) + fill] = here;
239 /* backwards increment the len-bit code huff */
241 while (huff & incr)
244 huff &= incr - 1;
245 huff
[all...] |
| /third_party/zlib/ |
| H A D | inftrees.c | 43 unsigned huff; /* Huffman code */ in inflate_table() local
146 filled is at next and has curr index bits. The code being used is huff in inflate_table()
154 of the low root bits of huff. This is saved in low to check for when a in inflate_table()
193 huff = 0; /* starting code */ in inflate_table()
225 /* replicate for those indices with low len bits equal to huff */ in inflate_table()
231 next[(huff >> drop) + fill] = here; in inflate_table()
234 /* backwards increment the len-bit code huff */ in inflate_table()
236 while (huff & incr) in inflate_table()
239 huff &= incr - 1; in inflate_table()
240 huff in inflate_table()
[all...] |
| /third_party/toybox/lib/ |
| H A D | deflate.c | 155 struct huff { struct
165 static void len2huff(struct huff *huff, char bitlen[], int len) in len2huff() argument
171 memset(huff, 0, sizeof(struct huff)); in len2huff()
172 for (i = 0; i<len; i++) huff->length[bitlen[i]]++; in len2huff()
176 *huff->length = *offset = 0; in len2huff()
177 for (i = 1; i<16; i++) offset[i] = offset[i-1] + huff->length[i-1]; in len2huff()
178 for (i = 0; i<len; i++) if (bitlen[i]) huff->symbol[offset[bitlen[i]]++] = i; in len2huff()
185 static unsigned huff_and_puff(struct bitbuf *bb, struct huff *huf argument
[all...] |
| /third_party/skia/third_party/externals/libwebp/src/dec/ |
| H A D | vp8l_dec.c | 220 HuffmanCode32* const huff) { in AccumulateHCode()
221 huff->bits += hcode.bits; in AccumulateHCode()
222 huff->value |= (uint32_t)hcode.value << shift; in AccumulateHCode()
223 assert(huff->bits <= HUFFMAN_TABLE_BITS); in AccumulateHCode()
231 HuffmanCode32* const huff = &htree_group->packed_table[bits]; in BuildPackedTable() local
234 huff->bits = hcode.bits + BITS_SPECIAL_MARKER; in BuildPackedTable()
235 huff->value = hcode.value; in BuildPackedTable()
237 huff->bits = 0; in BuildPackedTable()
238 huff->value = 0; in BuildPackedTable()
239 bits >>= AccumulateHCode(hcode, 8, huff); in BuildPackedTable()
219 AccumulateHCode(HuffmanCode hcode, int shift, HuffmanCode32* const huff) AccumulateHCode() argument
[all...] |
| /third_party/libwebsockets/lib/roles/h2/ |
| H A D | private-lib-roles-h2.h | 264 unsigned int huff:1; member
|
| H A D | hpack.c | 1029 h2n->huff = !!(c & 0x80); in lws_hpack_interpret()
1108 //lwsl_header(" 0x%02X huff %d\n", c, h2n->huff); in lws_hpack_interpret()
1112 if (h2n->huff) { in lws_hpack_interpret()
1216 if (h2n->huff && (h2n->huff_pad > 7 || in lws_hpack_interpret()
|