| OLD | NEW |
| (Empty) |
| 1 /* Copyright 2013 Google Inc. All Rights Reserved. | |
| 2 | |
| 3 Licensed under the Apache License, Version 2.0 (the "License"); | |
| 4 you may not use this file except in compliance with the License. | |
| 5 You may obtain a copy of the License at | |
| 6 | |
| 7 http://www.apache.org/licenses/LICENSE-2.0 | |
| 8 | |
| 9 Unless required by applicable law or agreed to in writing, software | |
| 10 distributed under the License is distributed on an "AS IS" BASIS, | |
| 11 WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | |
| 12 See the License for the specific language governing permissions and | |
| 13 limitations under the License. | |
| 14 | |
| 15 Utilities for building Huffman decoding tables. | |
| 16 */ | |
| 17 | |
| 18 #ifndef BROTLI_DEC_HUFFMAN_H_ | |
| 19 #define BROTLI_DEC_HUFFMAN_H_ | |
| 20 | |
| 21 #include <assert.h> | |
| 22 #include "./types.h" | |
| 23 | |
| 24 #if defined(__cplusplus) || defined(c_plusplus) | |
| 25 extern "C" { | |
| 26 #endif | |
| 27 | |
| 28 typedef struct { | |
| 29 uint8_t bits; /* number of bits used for this symbol */ | |
| 30 uint16_t value; /* symbol value or table offset */ | |
| 31 } HuffmanCode; | |
| 32 | |
| 33 /* Builds Huffman lookup table assuming code lengths are in symbol order. */ | |
| 34 /* Returns false in case of error (invalid tree or memory error). */ | |
| 35 int BrotliBuildHuffmanTable(HuffmanCode* root_table, | |
| 36 int root_bits, | |
| 37 const uint8_t* const code_lengths, | |
| 38 int code_lengths_size); | |
| 39 | |
| 40 #if defined(__cplusplus) || defined(c_plusplus) | |
| 41 } /* extern "C" */ | |
| 42 #endif | |
| 43 | |
| 44 #endif /* BROTLI_DEC_HUFFMAN_H_ */ | |
| OLD | NEW |