Home
last modified time | relevance | path

Searched refs:code_lengths (Results 1 – 6 of 6) sorted by relevance

/external/webp/src/utils/
Dhuffman.c111 const int* const code_lengths, int code_lengths_size, in VP8LHuffmanCodeLengthsToCodes() argument
120 assert(code_lengths != NULL); in VP8LHuffmanCodeLengthsToCodes()
126 if (code_lengths[symbol] > max_code_length) { in VP8LHuffmanCodeLengthsToCodes()
127 max_code_length = code_lengths[symbol]; in VP8LHuffmanCodeLengthsToCodes()
134 ++code_length_hist[code_lengths[symbol]]; in VP8LHuffmanCodeLengthsToCodes()
150 if (code_lengths[symbol] > 0) { in VP8LHuffmanCodeLengthsToCodes()
151 huff_codes[symbol] = next_codes[code_lengths[symbol]]++; in VP8LHuffmanCodeLengthsToCodes()
232 const int* const code_lengths, in VP8LHuffmanTreeBuildImplicit() argument
240 assert(code_lengths != NULL); in VP8LHuffmanTreeBuildImplicit()
244 if (code_lengths[symbol] > 0) { in VP8LHuffmanTreeBuildImplicit()
[all …]
Dhuffman.h79 const int* const code_lengths,
87 const int* const code_lengths,
95 int VP8LHuffmanCodeLengthsToCodes(const int* const code_lengths,
Dhuffman_encode.c335 const int value = tree->code_lengths[i]; in VP8LCreateCompressedHuffmanTree()
338 while (k < depth_size && tree->code_lengths[k] == value) ++k; in VP8LCreateCompressedHuffmanTree()
384 const int code_length = tree->code_lengths[i]; in ConvertBitDepthsToSymbols()
398 const int code_length = tree->code_lengths[i]; in ConvertBitDepthsToSymbols()
414 huff_code->code_lengths); in VP8LCreateHuffmanTree()
Dhuffman_encode.h32 uint8_t* code_lengths; // Code lengths of the symbols. member
/external/webp/src/dec/
Dvp8l.c183 int num_symbols, int* const code_lengths) { in ReadHuffmanCodeLengths() argument
216 code_lengths[symbol++] = code_len; in ReadHuffmanCodeLengths()
229 while (repeat-- > 0) code_lengths[symbol++] = length; in ReadHuffmanCodeLengths()
244 int* const code_lengths, int* const huff_codes, in ReadHuffmanCode() argument
258 code_lengths[0] = num_symbols - 1; in ReadHuffmanCode()
263 code_lengths[1] = num_symbols - 1; in ReadHuffmanCode()
265 ok = VP8LHuffmanTreeBuildExplicit(tree, code_lengths, codes, symbols, in ReadHuffmanCode()
276 memset(code_lengths, 0, alphabet_size * sizeof(*code_lengths)); in ReadHuffmanCode()
282 code_lengths); in ReadHuffmanCode()
283 ok = ok && VP8LHuffmanTreeBuildImplicit(tree, code_lengths, huff_codes, in ReadHuffmanCode()
[all …]
/external/webp/src/enc/
Dvp8l.c223 huffman_codes[i].code_lengths = lengths; in GetHuffBitLengthsAndCodes()
285 if (huffman_code->code_lengths[k] != 0) { in ClearHuffmanTreeIfOnlyOneSymbol()
291 huffman_code->code_lengths[k] = 0; in ClearHuffmanTreeIfOnlyOneSymbol()
304 VP8LWriteBits(bw, huffman_code->code_lengths[ix], huffman_code->codes[ix]); in StoreHuffmanTreeToBitMask()
330 huffman_code.code_lengths = code_length_bitdepth; in StoreFullHuffmanCode()
395 if (huffman_code->code_lengths[i] != 0) { in StoreHuffmanCode()
425 const int depth = code->code_lengths[code_index]; in WriteHuffmanCode()