mirror of
https://github.com/google/brotli.git
synced 2024-11-26 21:30:10 +00:00
8f30907d0f
This commit is for the decoder for brotli compression format. Brotli is a generic byte-level compression algorithm.
92 lines
3.3 KiB
C
92 lines
3.3 KiB
C
// Copyright 2013 Google Inc. All Rights Reserved.
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
//
|
|
// Utilities for building and looking up Huffman trees.
|
|
|
|
#ifndef BROTLI_DEC_HUFFMAN_H_
|
|
#define BROTLI_DEC_HUFFMAN_H_
|
|
|
|
#include <assert.h>
|
|
#include "./types.h"
|
|
|
|
#if defined(__cplusplus) || defined(c_plusplus)
|
|
extern "C" {
|
|
#endif
|
|
|
|
// A node of a Huffman tree.
|
|
typedef struct {
|
|
int symbol_;
|
|
int children_; // delta offset to both children (contiguous) or 0 if leaf.
|
|
} HuffmanTreeNode;
|
|
|
|
// Huffman Tree.
|
|
#define HUFF_LUT_BITS 7
|
|
#define HUFF_LUT (1U << HUFF_LUT_BITS)
|
|
typedef struct HuffmanTree HuffmanTree;
|
|
struct HuffmanTree {
|
|
// Fast lookup for short bit lengths.
|
|
uint8_t lut_bits_[HUFF_LUT];
|
|
int16_t lut_symbol_[HUFF_LUT];
|
|
int16_t lut_jump_[HUFF_LUT];
|
|
// Complete tree for lookups.
|
|
HuffmanTreeNode* root_; // all the nodes, starting at root.
|
|
int max_nodes_; // max number of nodes
|
|
int num_nodes_; // number of currently occupied nodes
|
|
int fixed_bit_length_; // If non-zero, uses fixed length coding
|
|
};
|
|
|
|
// Returns true if the given node is not a leaf of the Huffman tree.
|
|
static BROTLI_INLINE int HuffmanTreeNodeIsNotLeaf(
|
|
const HuffmanTreeNode* const node) {
|
|
return node->children_;
|
|
}
|
|
|
|
// Go down one level. Most critical function. 'right_child' must be 0 or 1.
|
|
static BROTLI_INLINE const HuffmanTreeNode* HuffmanTreeNextNode(
|
|
const HuffmanTreeNode* node, int right_child) {
|
|
return node + node->children_ + right_child;
|
|
}
|
|
|
|
// Releases the nodes of the Huffman tree.
|
|
// Note: It does NOT free 'tree' itself.
|
|
void HuffmanTreeRelease(HuffmanTree* const tree);
|
|
|
|
// Builds Huffman tree assuming code lengths are implicitly in symbol order.
|
|
// Returns false in case of error (invalid tree or memory error).
|
|
int HuffmanTreeBuildImplicit(HuffmanTree* const tree,
|
|
const int* const code_lengths,
|
|
int code_lengths_size);
|
|
|
|
// Build a Huffman tree with explicitly given lists of code lengths, codes
|
|
// and symbols. Verifies that all symbols added are smaller than max_symbol.
|
|
// Returns false in case of an invalid symbol, invalid tree or memory error.
|
|
int HuffmanTreeBuildExplicit(HuffmanTree* const tree,
|
|
const int* const code_lengths,
|
|
const int* const codes,
|
|
const int* const symbols, int max_symbol,
|
|
int num_symbols);
|
|
|
|
// Utility: converts Huffman code lengths to corresponding Huffman codes.
|
|
// 'huff_codes' should be pre-allocated.
|
|
// Returns false in case of error (memory allocation, invalid codes).
|
|
int HuffmanCodeLengthsToCodes(const int* const code_lengths,
|
|
int code_lengths_size, int* const huff_codes);
|
|
|
|
|
|
#if defined(__cplusplus) || defined(c_plusplus)
|
|
} // extern "C"
|
|
#endif
|
|
|
|
#endif // BROTLI_DEC_HUFFMAN_H_
|