Lines Matching defs:table
351 const HuffmanCode* table,
353 BROTLI_HC_MARK_TABLE_FOR_FAST_LOAD(table);
354 BROTLI_HC_ADJUST_TABLE_INDEX(table, bits & HUFFMAN_TABLE_MASK);
355 if (BROTLI_HC_FAST_LOAD_BITS(table) > HUFFMAN_TABLE_BITS) {
356 uint32_t nbits = BROTLI_HC_FAST_LOAD_BITS(table) - HUFFMAN_TABLE_BITS;
358 BROTLI_HC_ADJUST_TABLE_INDEX(table,
359 BROTLI_HC_FAST_LOAD_VALUE(table) +
362 BrotliDropBits(br, BROTLI_HC_FAST_LOAD_BITS(table));
363 return BROTLI_HC_FAST_LOAD_VALUE(table);
368 static BROTLI_INLINE uint32_t ReadSymbol(const HuffmanCode* table,
370 return DecodeSymbol(BrotliGet16BitsUnmasked(br), table, br);
376 const HuffmanCode* table, BrotliBitReader* br, uint32_t* result) {
379 BROTLI_HC_MARK_TABLE_FOR_FAST_LOAD(table);
381 if (BROTLI_HC_FAST_LOAD_BITS(table) == 0) {
382 *result = BROTLI_HC_FAST_LOAD_VALUE(table);
388 BROTLI_HC_ADJUST_TABLE_INDEX(table, val & HUFFMAN_TABLE_MASK);
389 if (BROTLI_HC_FAST_LOAD_BITS(table) <= HUFFMAN_TABLE_BITS) {
390 if (BROTLI_HC_FAST_LOAD_BITS(table) <= available_bits) {
391 BrotliDropBits(br, BROTLI_HC_FAST_LOAD_BITS(table));
392 *result = BROTLI_HC_FAST_LOAD_VALUE(table);
403 val = (val & BitMask(BROTLI_HC_FAST_LOAD_BITS(table))) >> HUFFMAN_TABLE_BITS;
405 BROTLI_HC_ADJUST_TABLE_INDEX(table, BROTLI_HC_FAST_LOAD_VALUE(table) + val);
406 if (available_bits < BROTLI_HC_FAST_LOAD_BITS(table)) {
410 BrotliDropBits(br, HUFFMAN_TABLE_BITS + BROTLI_HC_FAST_LOAD_BITS(table));
411 *result = BROTLI_HC_FAST_LOAD_VALUE(table);
416 const HuffmanCode* table, BrotliBitReader* br, uint32_t* result) {
419 *result = DecodeSymbol(val, table, br);
422 return SafeDecodeSymbol(table, br, result);
425 /* Makes a look-up in first level Huffman table. Peeks 8 bits. */
427 const HuffmanCode* table,
434 BROTLI_HC_MARK_TABLE_FOR_FAST_LOAD(table);
435 BROTLI_HC_ADJUST_TABLE_INDEX(table, BrotliGetBits(br, HUFFMAN_TABLE_BITS));
436 *bits = BROTLI_HC_FAST_LOAD_BITS(table);
437 *value = BROTLI_HC_FAST_LOAD_VALUE(table);
442 static BROTLI_INLINE uint32_t ReadPreloadedSymbol(const HuffmanCode* table,
449 const HuffmanCode* ext = table + (val & HUFFMAN_TABLE_MASK) + *value;
459 PreloadSymbol(0, table, br, bits, value);
609 const HuffmanCode* p = h->table;
649 const HuffmanCode* p = h->table;
744 B.1) Small Huffman table is decoded; it is specified with code lengths
746 B.2) Decoded table is used to decode code lengths of symbols in resulting
747 Huffman table. In worst case 3520 bits are read. */
750 HuffmanCode* table,
808 table, HUFFMAN_TABLE_BITS, h->symbols_lists_array, h->symbol);
823 BrotliBuildCodeLengthsHuffmanTable(h->table,
857 table, HUFFMAN_TABLE_BITS, h->symbol_lists, h->code_length_histo);
873 static BROTLI_INLINE uint32_t ReadBlockLength(const HuffmanCode* table,
877 code = ReadSymbol(table, br);
885 BrotliDecoderState* s, uint32_t* result, const HuffmanCode* table,
889 if (!SafeReadSymbol(table, br, &index)) {
961 /* Decodes a series of Huffman table using ReadHuffmanCode function. */
987 2) Decode Huffman table using ReadHuffmanCode function.
988 This table will be used for reading context map items.
1568 the table of int32_t values that come from different sources; if it is likely
1581 /* Calculates distance lookup table.