| /third_party/node/deps/brotli/c/enc/ |
| H A D | entropy_encode.h | 20 typedef struct HuffmanTree { struct
24 } HuffmanTree; typedef
26 static BROTLI_INLINE void InitHuffmanTree(HuffmanTree* self, uint32_t count, in InitHuffmanTree()
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, in SortHuffmanTreeItems()
89 HuffmanTree tmp = items[i]; in SortHuffmanTreeItems()
108 HuffmanTree tm in SortHuffmanTreeItems()
[all...] |
| H A D | entropy_encode.c | 24 int p0, HuffmanTree* pool, uint8_t* depth, int max_depth) { in BrotliSetDepth()
49 const HuffmanTree* v0, const HuffmanTree* v1) { in SortHuffmanTree()
74 HuffmanTree* tree, in BrotliCreateHuffmanTree()
77 HuffmanTree sentinel; in BrotliCreateHuffmanTree()
|
| H A D | brotli_bit_stream.c | 284 HuffmanTree* tree, in BrotliStoreHuffmanTree()
351 HuffmanTree* tree, in BuildAndStoreHuffmanTree()
399 const HuffmanTree* v0, const HuffmanTree* v1) { in SortHuffmanTree()
436 HuffmanTree* tree = BROTLI_ALLOC(m, HuffmanTree, max_tree_size); in BrotliBuildAndStoreHuffmanTreeFast()
440 HuffmanTree* node = tree; in BrotliBuildAndStoreHuffmanTreeFast()
455 HuffmanTree sentinel; in BrotliBuildAndStoreHuffmanTreeFast()
684 HuffmanTree* tree, in EncodeContextMap()
760 HuffmanTree* tre in BuildAndStoreBlockSplitCode()
[all...] |
| H A D | block_encoder_inc.h | 16 const size_t alphabet_size, HuffmanTree* tree, in BuildAndStoreEntropyCodes()
|
| H A D | brotli_bit_stream.h | 35 HuffmanTree* tree, size_t* storage_ix, uint8_t* storage);
|
| H A D | compress_fragment.c | 131 HuffmanTree tree[129]; in BuildAndStoreCommandPrefixCode()
|
| H A D | compress_fragment_two_pass.c | 74 HuffmanTree tree[129]; in BuildAndStoreCommandPrefixCode()
|
| /third_party/skia/third_party/externals/brotli/c/enc/ |
| H A D | entropy_encode.h | 20 typedef struct HuffmanTree { struct
24 } HuffmanTree; typedef
26 static BROTLI_INLINE void InitHuffmanTree(HuffmanTree* self, uint32_t count, in InitHuffmanTree()
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, in SortHuffmanTreeItems()
89 HuffmanTree tmp = items[i]; in SortHuffmanTreeItems()
108 HuffmanTree tm in SortHuffmanTreeItems()
[all...] |
| H A D | entropy_encode.c | 24 int p0, HuffmanTree* pool, uint8_t* depth, int max_depth) { in BrotliSetDepth()
49 const HuffmanTree* v0, const HuffmanTree* v1) { in SortHuffmanTree()
74 HuffmanTree* tree, in BrotliCreateHuffmanTree()
77 HuffmanTree sentinel; in BrotliCreateHuffmanTree()
|
| H A D | brotli_bit_stream.c | 284 HuffmanTree* tree, in BrotliStoreHuffmanTree()
351 HuffmanTree* tree, in BuildAndStoreHuffmanTree()
399 const HuffmanTree* v0, const HuffmanTree* v1) { in SortHuffmanTree()
436 HuffmanTree* tree = BROTLI_ALLOC(m, HuffmanTree, max_tree_size); in BrotliBuildAndStoreHuffmanTreeFast()
440 HuffmanTree* node = tree; in BrotliBuildAndStoreHuffmanTreeFast()
455 HuffmanTree sentinel; in BrotliBuildAndStoreHuffmanTreeFast()
684 HuffmanTree* tree, in EncodeContextMap()
760 HuffmanTree* tre in BuildAndStoreBlockSplitCode()
[all...] |
| H A D | block_encoder_inc.h | 16 const size_t alphabet_size, HuffmanTree* tree, in BuildAndStoreEntropyCodes()
|
| H A D | brotli_bit_stream.h | 35 HuffmanTree* tree, size_t* storage_ix, uint8_t* storage);
|
| H A D | compress_fragment.c | 131 HuffmanTree tree[129]; in BuildAndStoreCommandPrefixCode()
|
| H A D | compress_fragment_two_pass.c | 74 HuffmanTree tree[129]; in BuildAndStoreCommandPrefixCode()
|
| /third_party/skia/third_party/externals/libwebp/src/utils/ |
| H A D | huffman_encode_utils.c | 123 const HuffmanTree* const t1 = (const HuffmanTree*)ptr1; in CompareHuffmanTrees()
124 const HuffmanTree* const t2 = (const HuffmanTree*)ptr2; in CompareHuffmanTrees()
135 static void SetBitDepths(const HuffmanTree* const tree, in SetBitDepths()
136 const HuffmanTree* const pool, in SetBitDepths()
167 HuffmanTree* tree, int tree_depth_limit, in GenerateOptimalTree()
170 HuffmanTree* tree_pool; in GenerateOptimalTree()
407 uint8_t* const buf_rle, HuffmanTree* const huff_tree, in VP8LCreateHuffmanTree()
|
| H A D | huffman_encode_utils.h | 42 } HuffmanTree; typedef
53 uint8_t* const buf_rle, HuffmanTree* const huff_tree,
|
| /third_party/skia/third_party/externals/libwebp/src/enc/ |
| H A D | vp8l_enc.c | 700 HuffmanTree* huff_tree = NULL; in GetHuffBitLengthsAndCodes()
739 huff_tree = (HuffmanTree*)WebPSafeMalloc(3ULL * max_num_symbols, in GetHuffBitLengthsAndCodes()
827 HuffmanTree* const huff_tree, in StoreFullHuffmanCode()
895 HuffmanTree* const huff_tree, in StoreHuffmanCode()
1026 HuffmanTree* const huff_tree = (HuffmanTree*)WebPSafeMalloc( in EncodeImageNoHuffman()
1111 HuffmanTree* const huff_tree = (HuffmanTree*)WebPSafeMalloc( in EncodeImageInternal()
|