Home
last modified time | relevance | path

Searched refs:BrotliStoreHuffmanTree (Results 1 – 8 of 8) sorted by relevance

/third_party/skia/third_party/externals/brotli/c/enc/
Dbrotli_bit_stream.h34 BROTLI_INTERNAL void BrotliStoreHuffmanTree(const uint8_t* depths, size_t num,
Dcompress_fragment_two_pass.c112 BrotliStoreHuffmanTree( in BuildAndStoreCommandPrefixCode()
115 BrotliStoreHuffmanTree(&depth[64], 64, tree, storage_ix, storage); in BuildAndStoreCommandPrefixCode()
Dcompress_fragment.c170 BrotliStoreHuffmanTree( in BuildAndStoreCommandPrefixCode()
173 BrotliStoreHuffmanTree(&depth[64], 64, tree, storage_ix, storage); in BuildAndStoreCommandPrefixCode()
Dbrotli_bit_stream.c283 void BrotliStoreHuffmanTree(const uint8_t* depths, size_t num, in BrotliStoreHuffmanTree() function
394 BrotliStoreHuffmanTree(depth, histogram_length, tree, storage_ix, storage); in BuildAndStoreHuffmanTree()
/third_party/node/deps/brotli/c/enc/
Dbrotli_bit_stream.h34 BROTLI_INTERNAL void BrotliStoreHuffmanTree(const uint8_t* depths, size_t num,
Dcompress_fragment_two_pass.c112 BrotliStoreHuffmanTree( in BuildAndStoreCommandPrefixCode()
115 BrotliStoreHuffmanTree(&depth[64], 64, tree, storage_ix, storage); in BuildAndStoreCommandPrefixCode()
Dcompress_fragment.c170 BrotliStoreHuffmanTree( in BuildAndStoreCommandPrefixCode()
173 BrotliStoreHuffmanTree(&depth[64], 64, tree, storage_ix, storage); in BuildAndStoreCommandPrefixCode()
Dbrotli_bit_stream.c283 void BrotliStoreHuffmanTree(const uint8_t* depths, size_t num, in BrotliStoreHuffmanTree() function
394 BrotliStoreHuffmanTree(depth, histogram_length, tree, storage_ix, storage); in BuildAndStoreHuffmanTree()