Searched refs:histogram_length (Results 1 - 2 of 2) sorted by relevance
| /third_party/node/deps/brotli/c/enc/ |
| H A D | brotli_bit_stream.c | 349 const size_t histogram_length, in BuildAndStoreHuffmanTree()
360 for (i = 0; i < histogram_length; i++) { in BuildAndStoreHuffmanTree()
387 memset(depth, 0, histogram_length * sizeof(depth[0])); in BuildAndStoreHuffmanTree()
388 BrotliCreateHuffmanTree(histogram, histogram_length, 15, tree, depth); in BuildAndStoreHuffmanTree()
389 BrotliConvertBitDepthsToSymbols(depth, histogram_length, bits); in BuildAndStoreHuffmanTree()
394 BrotliStoreHuffmanTree(depth, histogram_length, tree, storage_ix, storage); in BuildAndStoreHuffmanTree()
842 static void InitBlockEncoder(BlockEncoder* self, size_t histogram_length, in InitBlockEncoder() argument
845 self->histogram_length_ = histogram_length; in InitBlockEncoder()
348 BuildAndStoreHuffmanTree(const uint32_t* histogram, const size_t histogram_length, const size_t alphabet_size, HuffmanTree* tree, uint8_t* depth, uint16_t* bits, size_t* storage_ix, uint8_t* storage) BuildAndStoreHuffmanTree() argument
|
| /third_party/skia/third_party/externals/brotli/c/enc/ |
| H A D | brotli_bit_stream.c | 349 const size_t histogram_length, in BuildAndStoreHuffmanTree()
360 for (i = 0; i < histogram_length; i++) { in BuildAndStoreHuffmanTree()
387 memset(depth, 0, histogram_length * sizeof(depth[0])); in BuildAndStoreHuffmanTree()
388 BrotliCreateHuffmanTree(histogram, histogram_length, 15, tree, depth); in BuildAndStoreHuffmanTree()
389 BrotliConvertBitDepthsToSymbols(depth, histogram_length, bits); in BuildAndStoreHuffmanTree()
394 BrotliStoreHuffmanTree(depth, histogram_length, tree, storage_ix, storage); in BuildAndStoreHuffmanTree()
842 static void InitBlockEncoder(BlockEncoder* self, size_t histogram_length, in InitBlockEncoder() argument
845 self->histogram_length_ = histogram_length; in InitBlockEncoder()
348 BuildAndStoreHuffmanTree(const uint32_t* histogram, const size_t histogram_length, const size_t alphabet_size, HuffmanTree* tree, uint8_t* depth, uint16_t* bits, size_t* storage_ix, uint8_t* storage) BuildAndStoreHuffmanTree() argument
|
Completed in 6 milliseconds