Searched refs:InitHuffmanTree (Results 1 - 6 of 6) sorted by relevance
| /third_party/node/deps/brotli/c/enc/ |
| H A D | entropy_encode.h | 26 static BROTLI_INLINE void InitHuffmanTree(HuffmanTree* self, uint32_t count, in InitHuffmanTree() function
|
| H A D | entropy_encode.c | 78 InitHuffmanTree(&sentinel, BROTLI_UINT32_MAX, -1, -1); in BrotliCreateHuffmanTree()
92 InitHuffmanTree(&tree[n++], count, -1, (int16_t)i); in BrotliCreateHuffmanTree()
|
| H A D | brotli_bit_stream.c | 446 InitHuffmanTree(node, histogram[l], -1, (int16_t)l); in BrotliBuildAndStoreHuffmanTreeFast()
448 InitHuffmanTree(node, count_limit, -1, (int16_t)l); in BrotliBuildAndStoreHuffmanTreeFast()
468 InitHuffmanTree(&sentinel, BROTLI_UINT32_MAX, -1, -1); in BrotliBuildAndStoreHuffmanTreeFast()
|
| /third_party/skia/third_party/externals/brotli/c/enc/ |
| H A D | entropy_encode.h | 26 static BROTLI_INLINE void InitHuffmanTree(HuffmanTree* self, uint32_t count, in InitHuffmanTree() function
|
| H A D | entropy_encode.c | 78 InitHuffmanTree(&sentinel, BROTLI_UINT32_MAX, -1, -1); in BrotliCreateHuffmanTree()
92 InitHuffmanTree(&tree[n++], count, -1, (int16_t)i); in BrotliCreateHuffmanTree()
|
| H A D | brotli_bit_stream.c | 446 InitHuffmanTree(node, histogram[l], -1, (int16_t)l); in BrotliBuildAndStoreHuffmanTreeFast()
448 InitHuffmanTree(node, count_limit, -1, (int16_t)l); in BrotliBuildAndStoreHuffmanTreeFast()
468 InitHuffmanTree(&sentinel, BROTLI_UINT32_MAX, -1, -1); in BrotliBuildAndStoreHuffmanTreeFast()
|
Completed in 14 milliseconds