HomeSort by relevance Sort by last modified time
    Searched refs:code_lengths (Results 1 - 9 of 9) sorted by null

  /external/chromium_org/third_party/brotli/src/brotli/dec/
huffman.h 37 const uint8_t* const code_lengths,
huffman.c 69 const uint8_t* const code_lengths,
93 count[code_lengths[symbol]]++;
104 if (code_lengths[symbol] != 0) {
105 sorted[offset[code_lengths[symbol]]++] = symbol;
decode.c 136 int num_symbols, uint8_t* code_lengths,
166 code_lengths[symbol++] = code_len;
193 memset(&code_lengths[symbol], repeat_code_len, (size_t)repeat_delta);
204 memset(&code_lengths[symbol], 0, (size_t)(num_symbols - symbol));
214 uint8_t* code_lengths = NULL; local
216 code_lengths =
218 sizeof(*code_lengths));
219 if (code_lengths == NULL) {
242 memset(code_lengths, 0, (size_t)alphabet_size);
245 code_lengths[symbols[i]] = 2
    [all...]
  /external/chromium_org/third_party/libwebp/utils/
huffman.h 75 // The 'huff_codes' and 'code_lengths' are pre-allocated temporary memory
79 const int* const code_lengths,
87 const int* const code_lengths,
95 int VP8LHuffmanCodeLengthsToCodes(const int* const code_lengths,
huffman.c 111 const int* const code_lengths, int code_lengths_size,
120 assert(code_lengths != NULL);
126 if (code_lengths[symbol] > max_code_length) {
127 max_code_length = code_lengths[symbol];
134 ++code_length_hist[code_lengths[symbol]];
150 if (code_lengths[symbol] > 0) {
151 huff_codes[symbol] = next_codes[code_lengths[symbol]]++;
232 const int* const code_lengths,
240 assert(code_lengths != NULL);
244 if (code_lengths[symbol] > 0)
    [all...]
huffman_encode.h 32 uint8_t* code_lengths; // Code lengths of the symbols. member in struct:__anon17924
huffman_encode.c 335 const int value = tree->code_lengths[i];
338 while (k < depth_size && tree->code_lengths[k] == value) ++k;
384 const int code_length = tree->code_lengths[i];
398 const int code_length = tree->code_lengths[i];
414 huff_code->code_lengths);
  /external/chromium_org/third_party/libwebp/dec/
vp8l.c 183 int num_symbols, int* const code_lengths) {
216 code_lengths[symbol++] = code_len;
229 while (repeat-- > 0) code_lengths[symbol++] = length;
240 // 'code_lengths' is pre-allocated temporary buffer, used for creating Huffman
243 int* const code_lengths, int* const huff_codes,
257 code_lengths[0] = num_symbols - 1;
262 code_lengths[1] = num_symbols - 1;
264 ok = VP8LHuffmanTreeBuildExplicit(tree, code_lengths, codes, symbols,
275 memset(code_lengths, 0, alphabet_size * sizeof(*code_lengths));
302 int* code_lengths = NULL; local
    [all...]
  /external/chromium_org/third_party/libwebp/enc/
vp8l.c 223 huffman_codes[i].code_lengths = lengths;
285 if (huffman_code->code_lengths[k] != 0) {
291 huffman_code->code_lengths[k] = 0;
304 VP8LWriteBits(bw, huffman_code->code_lengths[ix], huffman_code->codes[ix]);
330 huffman_code.code_lengths = code_length_bitdepth;
395 if (huffman_code->code_lengths[i] != 0) {
425 const int depth = code->code_lengths[code_index];
    [all...]

Completed in 55 milliseconds