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

  /external/chromium_org/third_party/libwebp/webp/
format_constants.h 46 #define CODE_LENGTH_CODES 19
  /external/chromium_org/third_party/libwebp/enc/
vp8l.c 263 static const uint8_t kStorageOrder[CODE_LENGTH_CODES] = {
268 int codes_to_store = CODE_LENGTH_CODES;
324 uint8_t code_length_bitdepth[CODE_LENGTH_CODES] = { 0 };
325 uint16_t code_length_bitdepth_symbols[CODE_LENGTH_CODES] = { 0 };
329 huffman_code.num_symbols = CODE_LENGTH_CODES;
336 uint32_t histogram[CODE_LENGTH_CODES] = { 0 };
337 uint8_t buf_rle[CODE_LENGTH_CODES] = { 0 };
496 3ULL * CODE_LENGTH_CODES, sizeof(*huff_tree));
659 huff_tree = (HuffmanTree*)WebPSafeMalloc(3ULL * CODE_LENGTH_CODES,
    [all...]
histogram.c 227 static const int kHuffmanCodeOfHuffmanCodeSize = CODE_LENGTH_CODES * 3;
  /external/chromium_org/third_party/brotli/src/brotli/dec/
decode.c 56 #define CODE_LENGTH_CODES 18
57 static const uint8_t kCodeLengthCodeOrder[CODE_LENGTH_CODES] = {
147 CODE_LENGTH_CODES)) {
149 PrintUcharVector(code_length_code_lengths, CODE_LENGTH_CODES);
278 uint8_t code_length_code_lengths[CODE_LENGTH_CODES] = { 0 };
286 for (i = simple_code_or_skip; i < CODE_LENGTH_CODES && space > 0; ++i) {
    [all...]

Completed in 65 milliseconds