#include <brotli/types.h>
#include "../common/platform.h"
Go to the source code of this file.
|
BROTLI_INTERNAL BROTLI_BOOL | BrotliSetDepth (int p, HuffmanTree *pool, uint8_t *depth, int max_depth) |
|
BROTLI_INTERNAL void | BrotliCreateHuffmanTree (const uint32_t *data, const size_t length, const int tree_limit, HuffmanTree *tree, uint8_t *depth) |
|
BROTLI_INTERNAL void | BrotliOptimizeHuffmanCountsForRle (size_t length, uint32_t *counts, uint8_t *good_for_rle) |
|
BROTLI_INTERNAL void | BrotliWriteHuffmanTree (const uint8_t *depth, size_t num, size_t *tree_size, uint8_t *tree, uint8_t *extra_bits_data) |
|
BROTLI_INTERNAL void | BrotliConvertBitDepthsToSymbols (const uint8_t *depth, size_t len, uint16_t *bits) |
|
◆ HuffmanTree
typedef struct HuffmanTree HuffmanTree |
◆ HuffmanTreeComparator
◆ BrotliConvertBitDepthsToSymbols()
BROTLI_INTERNAL void BrotliConvertBitDepthsToSymbols |
( |
const uint8_t * | depth, |
|
|
size_t | len, |
|
|
uint16_t * | bits ) |
◆ BrotliCreateHuffmanTree()
◆ BrotliOptimizeHuffmanCountsForRle()
BROTLI_INTERNAL void BrotliOptimizeHuffmanCountsForRle |
( |
size_t | length, |
|
|
uint32_t * | counts, |
|
|
uint8_t * | good_for_rle ) |
◆ BrotliSetDepth()
◆ BrotliWriteHuffmanTree()
BROTLI_INTERNAL void BrotliWriteHuffmanTree |
( |
const uint8_t * | depth, |
|
|
size_t | num, |
|
|
size_t * | tree_size, |
|
|
uint8_t * | tree, |
|
|
uint8_t * | extra_bits_data ) |
◆ kBrotliShellGaps