Home
last modified time | relevance | path

Searched refs:CODE_LENGTH_CODES (Results 1 – 5 of 5) sorted by relevance

/external/webp/src/webp/
Dformat_constants.h46 #define CODE_LENGTH_CODES 19 macro
/external/webp/include/webp/
Dformat_constants.h46 #define CODE_LENGTH_CODES 19 macro
/external/webp/src/enc/
Dvp8l_enc.c528 static const uint8_t kStorageOrder[CODE_LENGTH_CODES] = { in StoreHuffmanTreeOfHuffmanTreeToBitMask()
533 int codes_to_store = CODE_LENGTH_CODES; in StoreHuffmanTreeOfHuffmanTreeToBitMask()
589 uint8_t code_length_bitdepth[CODE_LENGTH_CODES] = { 0 }; in StoreFullHuffmanCode()
590 uint16_t code_length_bitdepth_symbols[CODE_LENGTH_CODES] = { 0 }; in StoreFullHuffmanCode()
594 huffman_code.num_symbols = CODE_LENGTH_CODES; in StoreFullHuffmanCode()
601 uint32_t histogram[CODE_LENGTH_CODES] = { 0 }; in StoreFullHuffmanCode()
602 uint8_t buf_rle[CODE_LENGTH_CODES] = { 0 }; in StoreFullHuffmanCode()
789 3ULL * CODE_LENGTH_CODES, sizeof(*huff_tree)); in EncodeImageNoHuffman()
876 3ULL * CODE_LENGTH_CODES, sizeof(*huff_tree)); in EncodeImageInternal()
Dhistogram_enc.c272 static const int kHuffmanCodeOfHuffmanCodeSize = CODE_LENGTH_CODES * 3; in InitialHuffmanCost()
/external/brotli/java/org/brotli/dec/
DDecode.java51 private static final int CODE_LENGTH_CODES = 18; field in Decode
304 Huffman.buildHuffmanTable(table, 0, 5, codeLengthCodeLengths, CODE_LENGTH_CODES); in readHuffmanCodeLengths()
409 int[] codeLengthCodeLengths = new int[CODE_LENGTH_CODES]; in readHuffmanCode()
412 for (int i = simpleCodeOrSkip; i < CODE_LENGTH_CODES && space > 0; i++) { in readHuffmanCode()