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

/xsrc/external/mit/brotli/dist/c/enc/
H A Dentropy_encode.h20 typedef struct HuffmanTree { struct
24 } HuffmanTree; typedef in typeref:struct:HuffmanTree
26 static BROTLI_INLINE void InitHuffmanTree(HuffmanTree* self, uint32_t count,
35 int p, HuffmanTree* pool, uint8_t* depth, int max_depth);
52 HuffmanTree* tree,
82 const HuffmanTree*, const HuffmanTree*);
83 static BROTLI_INLINE void SortHuffmanTreeItems(HuffmanTree* items,
89 HuffmanTree tmp = items[i];
108 HuffmanTree tm
[all...]
H A Dblock_encoder_inc.h16 const size_t alphabet_size, HuffmanTree* tree,
H A Dbrotli_bit_stream.h35 HuffmanTree* tree, size_t* storage_ix, uint8_t* storage);
H A Dentropy_encode.c24 int p0, HuffmanTree* pool, uint8_t* depth, int max_depth) {
49 const HuffmanTree* v0, const HuffmanTree* v1) {
74 HuffmanTree* tree,
77 HuffmanTree sentinel;
H A Dbrotli_bit_stream.c284 HuffmanTree* tree,
351 HuffmanTree* tree,
399 const HuffmanTree* v0, const HuffmanTree* v1) {
436 HuffmanTree* tree = BROTLI_ALLOC(m, HuffmanTree, max_tree_size);
440 HuffmanTree* node = tree;
455 HuffmanTree sentinel;
684 HuffmanTree* tree,
760 HuffmanTree* tre
[all...]
H A Dcompress_fragment.c131 HuffmanTree tree[129];
H A Dcompress_fragment_two_pass.c74 HuffmanTree tree[129];

Completed in 8 milliseconds