![]() |
Parolin 0.7.9 6796
Console (soon DLLs) to do a tar like job
|
Go to the source code of this file.
Data Structures | |
| struct | HuffmanCode |
| struct | HuffmanTreeGroup |
Macros | |
| #define | BROTLI_HUFFMAN_MAX_CODE_LENGTH 15 |
| #define | BROTLI_HUFFMAN_MAX_SIZE_26 396 |
| #define | BROTLI_HUFFMAN_MAX_SIZE_258 632 |
| #define | BROTLI_HUFFMAN_MAX_SIZE_272 646 |
| #define | BROTLI_HUFFMAN_MAX_CODE_LENGTH_CODE_LENGTH 5 |
| #define | BROTLI_HC_MARK_TABLE_FOR_FAST_LOAD(H) |
| #define | BROTLI_HC_ADJUST_TABLE_INDEX(H, V) |
| #define | BROTLI_HC_FAST_LOAD_BITS(H) |
| #define | BROTLI_HC_FAST_LOAD_VALUE(H) |
Functions | |
| BROTLI_INTERNAL void | BrotliBuildCodeLengthsHuffmanTable (HuffmanCode *root_table, const uint8_t *const code_lengths, uint16_t *count) |
| BROTLI_INTERNAL uint32_t | BrotliBuildHuffmanTable (HuffmanCode *root_table, int root_bits, const uint16_t *const symbol_lists, uint16_t *count) |
| BROTLI_INTERNAL uint32_t | BrotliBuildSimpleHuffmanTable (HuffmanCode *table, int root_bits, uint16_t *symbols, uint32_t num_symbols) |
| #define BROTLI_HC_ADJUST_TABLE_INDEX | ( | H, | |
| V ) |
| #define BROTLI_HC_FAST_LOAD_BITS | ( | H | ) |
| #define BROTLI_HC_FAST_LOAD_VALUE | ( | H | ) |
| #define BROTLI_HC_MARK_TABLE_FOR_FAST_LOAD | ( | H | ) |
| #define BROTLI_HUFFMAN_MAX_CODE_LENGTH 15 |
| #define BROTLI_HUFFMAN_MAX_CODE_LENGTH_CODE_LENGTH 5 |
| #define BROTLI_HUFFMAN_MAX_SIZE_258 632 |
| #define BROTLI_HUFFMAN_MAX_SIZE_26 396 |
| #define BROTLI_HUFFMAN_MAX_SIZE_272 646 |
| BROTLI_INTERNAL void BrotliBuildCodeLengthsHuffmanTable | ( | HuffmanCode * | root_table, |
| const uint8_t *const | code_lengths, | ||
| uint16_t * | count ) |
| BROTLI_INTERNAL uint32_t BrotliBuildHuffmanTable | ( | HuffmanCode * | root_table, |
| int | root_bits, | ||
| const uint16_t *const | symbol_lists, | ||
| uint16_t * | count ) |
| BROTLI_INTERNAL uint32_t BrotliBuildSimpleHuffmanTable | ( | HuffmanCode * | table, |
| int | root_bits, | ||
| uint16_t * | symbols, | ||
| uint32_t | num_symbols ) |