Parolin 0.7.9 6796
Console (soon DLLs) to do a tar like job
Loading...
Searching...
No Matches
entropy_encode.c File Reference
#include "entropy_encode.h"
#include <string.h>
#include <brotli/types.h>
#include "../common/constants.h"
#include "../common/platform.h"

Macros

#define MAX_HUFFMAN_BITS   16
 

Functions

BROTLI_BOOL BrotliSetDepth (int p0, HuffmanTree *pool, uint8_t *depth, int max_depth)
 
void BrotliCreateHuffmanTree (const uint32_t *data, const size_t length, const int tree_limit, HuffmanTree *tree, uint8_t *depth)
 
void BrotliOptimizeHuffmanCountsForRle (size_t length, uint32_t *counts, uint8_t *good_for_rle)
 
void BrotliWriteHuffmanTree (const uint8_t *depth, size_t length, size_t *tree_size, uint8_t *tree, uint8_t *extra_bits_data)
 
void BrotliConvertBitDepthsToSymbols (const uint8_t *depth, size_t len, uint16_t *bits)
 

Variables

const size_t kBrotliShellGaps [] = {132, 57, 23, 10, 4, 1}
 

Macro Definition Documentation

◆ MAX_HUFFMAN_BITS

#define MAX_HUFFMAN_BITS   16

Function Documentation

◆ BrotliConvertBitDepthsToSymbols()

void BrotliConvertBitDepthsToSymbols ( const uint8_t * depth,
size_t len,
uint16_t * bits )

◆ BrotliCreateHuffmanTree()

void BrotliCreateHuffmanTree ( const uint32_t * data,
const size_t length,
const int tree_limit,
HuffmanTree * tree,
uint8_t * depth )

◆ BrotliOptimizeHuffmanCountsForRle()

void BrotliOptimizeHuffmanCountsForRle ( size_t length,
uint32_t * counts,
uint8_t * good_for_rle )

◆ BrotliSetDepth()

BROTLI_BOOL BrotliSetDepth ( int p0,
HuffmanTree * pool,
uint8_t * depth,
int max_depth )

◆ BrotliWriteHuffmanTree()

void BrotliWriteHuffmanTree ( const uint8_t * depth,
size_t length,
size_t * tree_size,
uint8_t * tree,
uint8_t * extra_bits_data )

Variable Documentation

◆ kBrotliShellGaps

const size_t kBrotliShellGaps[] = {132, 57, 23, 10, 4, 1}