Home
last modified time | relevance | path

Searched refs:HuffmanCode (Results 1 - 13 of 13) sorted by relevance

/third_party/node/deps/brotli/c/dec/
H A Dhuffman.h41 } HuffmanCode; typedef
43 static BROTLI_INLINE HuffmanCode ConstructHuffmanCode(const uint8_t bits, in ConstructHuffmanCode()
45 HuffmanCode h; in ConstructHuffmanCode()
51 /* Please use the following macros to optimize HuffmanCode accesses in hot
54 * For example, assuming |table| contains a HuffmanCode pointer:
69 /* These must be given a HuffmanCode pointer! */
75 typedef BROTLI_ALIGNED(4) uint32_t HuffmanCode; variable
77 static BROTLI_INLINE HuffmanCode ConstructHuffmanCode(const uint8_t bits, in ConstructHuffmanCode()
79 return (HuffmanCode) ((value & 0xFFFF) << 16) | (bits & 0xFF); in ConstructHuffmanCode()
85 /* These must be given a HuffmanCode pointe
[all...]
H A Dstate.h208 HuffmanCode table[32];
222 HuffmanCode* next;
228 HuffmanCode context_map_table[BROTLI_HUFFMAN_MAX_SIZE_272];
266 HuffmanCode* htree_command;
276 HuffmanCode* block_type_trees;
277 HuffmanCode* block_len_trees;
293 HuffmanCode* literal_htree;
H A Dstate.c144 const size_t code_size = sizeof(HuffmanCode) * ntrees * max_table_size; in BrotliDecoderHuffmanTreeGroupInit()
145 const size_t htree_size = sizeof(HuffmanCode*) * ntrees; in BrotliDecoderHuffmanTreeGroupInit()
146 /* Pointer alignment is, hopefully, wider than sizeof(HuffmanCode). */ in BrotliDecoderHuffmanTreeGroupInit()
147 HuffmanCode** p = (HuffmanCode**)BROTLI_DECODER_ALLOC(s, in BrotliDecoderHuffmanTreeGroupInit()
153 group->codes = (HuffmanCode*)(&p[ntrees]); in BrotliDecoderHuffmanTreeGroupInit()
H A Dhuffman.c80 static BROTLI_INLINE void ReplicateValue(HuffmanCode* table, in ReplicateValue()
82 HuffmanCode code) { in ReplicateValue()
104 void BrotliBuildCodeLengthsHuffmanTable(HuffmanCode* table, in BrotliBuildCodeLengthsHuffmanTable()
107 HuffmanCode code; /* current table entry */ in BrotliBuildCodeLengthsHuffmanTable()
169 uint32_t BrotliBuildHuffmanTable(HuffmanCode* root_table, in BrotliBuildHuffmanTable()
173 HuffmanCode code; /* current table entry */ in BrotliBuildHuffmanTable()
174 HuffmanCode* table; /* next available space in table */ in BrotliBuildHuffmanTable()
261 uint32_t BrotliBuildSimpleHuffmanTable(HuffmanCode* table, in BrotliBuildSimpleHuffmanTable()
H A Ddecode.c351 const HuffmanCode* table, in DecodeSymbol()
368 static BROTLI_INLINE uint32_t ReadSymbol(const HuffmanCode* table, in ReadSymbol()
376 const HuffmanCode* table, BrotliBitReader* br, uint32_t* result) { in SafeDecodeSymbol()
416 const HuffmanCode* table, BrotliBitReader* br, uint32_t* result) { in SafeReadSymbol()
427 const HuffmanCode* table, in PreloadSymbol()
442 static BROTLI_INLINE uint32_t ReadPreloadedSymbol(const HuffmanCode* table, in ReadPreloadedSymbol()
449 const HuffmanCode* ext = table + (val & HUFFMAN_TABLE_MASK) + *value; in ReadPreloadedSymbol()
609 const HuffmanCode* p = h->table; in ReadSymbolCodeLengths()
649 const HuffmanCode* p = h->table; in SafeReadSymbolCodeLengths()
750 HuffmanCode* tabl in ReadHuffmanCode()
[all...]
/third_party/skia/third_party/externals/brotli/c/dec/
H A Dhuffman.h41 } HuffmanCode; typedef
43 static BROTLI_INLINE HuffmanCode ConstructHuffmanCode(const uint8_t bits, in ConstructHuffmanCode()
45 HuffmanCode h; in ConstructHuffmanCode()
51 /* Please use the following macros to optimize HuffmanCode accesses in hot
54 * For example, assuming |table| contains a HuffmanCode pointer:
69 /* These must be given a HuffmanCode pointer! */
75 typedef BROTLI_ALIGNED(4) uint32_t HuffmanCode; variable
77 static BROTLI_INLINE HuffmanCode ConstructHuffmanCode(const uint8_t bits, in ConstructHuffmanCode()
79 return (HuffmanCode) ((value & 0xFFFF) << 16) | (bits & 0xFF); in ConstructHuffmanCode()
85 /* These must be given a HuffmanCode pointe
[all...]
H A Dstate.h208 HuffmanCode table[32];
222 HuffmanCode* next;
228 HuffmanCode context_map_table[BROTLI_HUFFMAN_MAX_SIZE_272];
266 HuffmanCode* htree_command;
276 HuffmanCode* block_type_trees;
277 HuffmanCode* block_len_trees;
293 HuffmanCode* literal_htree;
H A Dstate.c144 const size_t code_size = sizeof(HuffmanCode) * ntrees * max_table_size; in BrotliDecoderHuffmanTreeGroupInit()
145 const size_t htree_size = sizeof(HuffmanCode*) * ntrees; in BrotliDecoderHuffmanTreeGroupInit()
146 /* Pointer alignment is, hopefully, wider than sizeof(HuffmanCode). */ in BrotliDecoderHuffmanTreeGroupInit()
147 HuffmanCode** p = (HuffmanCode**)BROTLI_DECODER_ALLOC(s, in BrotliDecoderHuffmanTreeGroupInit()
153 group->codes = (HuffmanCode*)(&p[ntrees]); in BrotliDecoderHuffmanTreeGroupInit()
H A Dhuffman.c80 static BROTLI_INLINE void ReplicateValue(HuffmanCode* table, in ReplicateValue()
82 HuffmanCode code) { in ReplicateValue()
104 void BrotliBuildCodeLengthsHuffmanTable(HuffmanCode* table, in BrotliBuildCodeLengthsHuffmanTable()
107 HuffmanCode code; /* current table entry */ in BrotliBuildCodeLengthsHuffmanTable()
169 uint32_t BrotliBuildHuffmanTable(HuffmanCode* root_table, in BrotliBuildHuffmanTable()
173 HuffmanCode code; /* current table entry */ in BrotliBuildHuffmanTable()
174 HuffmanCode* table; /* next available space in table */ in BrotliBuildHuffmanTable()
261 uint32_t BrotliBuildSimpleHuffmanTable(HuffmanCode* table, in BrotliBuildSimpleHuffmanTable()
H A Ddecode.c351 const HuffmanCode* table, in DecodeSymbol()
368 static BROTLI_INLINE uint32_t ReadSymbol(const HuffmanCode* table, in ReadSymbol()
376 const HuffmanCode* table, BrotliBitReader* br, uint32_t* result) { in SafeDecodeSymbol()
416 const HuffmanCode* table, BrotliBitReader* br, uint32_t* result) { in SafeReadSymbol()
427 const HuffmanCode* table, in PreloadSymbol()
442 static BROTLI_INLINE uint32_t ReadPreloadedSymbol(const HuffmanCode* table, in ReadPreloadedSymbol()
449 const HuffmanCode* ext = table + (val & HUFFMAN_TABLE_MASK) + *value; in ReadPreloadedSymbol()
609 const HuffmanCode* p = h->table; in ReadSymbolCodeLengths()
649 const HuffmanCode* p = h->table; in SafeReadSymbolCodeLengths()
750 HuffmanCode* tabl in ReadHuffmanCode()
[all...]
/third_party/skia/third_party/externals/libwebp/src/utils/
H A Dhuffman_utils.h36 } HuffmanCode; typedef
48 HuffmanCode* start;
51 HuffmanCode* curr_table;
81 HuffmanCode* htrees[HUFFMAN_CODES_PER_META_CODE];
H A Dhuffman_utils.c53 static WEBP_INLINE void ReplicateValue(HuffmanCode* table, in ReplicateValue()
55 HuffmanCode code) { in ReplicateValue()
80 static int BuildHuffmanTable(HuffmanCode* const root_table, int root_bits, in BuildHuffmanTable()
83 HuffmanCode* table = root_table; // next available space in table in BuildHuffmanTable()
135 HuffmanCode code; in BuildHuffmanTable()
163 HuffmanCode code; in BuildHuffmanTable()
181 HuffmanCode code; in BuildHuffmanTable()
239 (HuffmanCode*)WebPSafeMalloc(next->size, sizeof(*next->start)); in VP8LBuildHuffmanTable()
271 root->start = (HuffmanCode*)WebPSafeMalloc(size, sizeof(*root->start)); in VP8LHuffmanTablesAllocate()
/third_party/skia/third_party/externals/libwebp/src/dec/
H A Dvp8l_dec.c183 static WEBP_INLINE int ReadSymbol(const HuffmanCode* table, in ReadSymbol()
219 static int AccumulateHCode(HuffmanCode hcode, int shift, in AccumulateHCode()
232 HuffmanCode hcode = htree_group->htrees[GREEN][bits]; in BuildPackedTable()
276 const HuffmanCode* p; in ReadHuffmanCodeLengths()
468 HuffmanCode** const htrees = htree_group->htrees; in ReadHuffmanCodes()
841 HuffmanCode** const htrees = hdr->htree_groups_[i].htrees; in Is8bOptimizable()

Completed in 13 milliseconds