Searched refs:CODE_LENGTH_CODES (Results 1 – 5 of 5) sorted by relevance
46 #define CODE_LENGTH_CODES 19 macro
465 static const uint8_t kStorageOrder[CODE_LENGTH_CODES] = { in StoreHuffmanTreeOfHuffmanTreeToBitMask()470 int codes_to_store = CODE_LENGTH_CODES; in StoreHuffmanTreeOfHuffmanTreeToBitMask()526 uint8_t code_length_bitdepth[CODE_LENGTH_CODES] = { 0 }; in StoreFullHuffmanCode()527 uint16_t code_length_bitdepth_symbols[CODE_LENGTH_CODES] = { 0 }; in StoreFullHuffmanCode()531 huffman_code.num_symbols = CODE_LENGTH_CODES; in StoreFullHuffmanCode()538 uint32_t histogram[CODE_LENGTH_CODES] = { 0 }; in StoreFullHuffmanCode()539 uint8_t buf_rle[CODE_LENGTH_CODES] = { 0 }; in StoreFullHuffmanCode()721 3ULL * CODE_LENGTH_CODES, sizeof(*huff_tree)); in EncodeImageNoHuffman()931 huff_tree = (HuffmanTree*)WebPSafeMalloc(3ULL * CODE_LENGTH_CODES, in EncodeImageInternal()
210 static const int kHuffmanCodeOfHuffmanCodeSize = CODE_LENGTH_CODES * 3; in InitialHuffmanCost()
39 private static final int CODE_LENGTH_CODES = 18; field in Decode181 Huffman.buildHuffmanTable(table, 0, 5, codeLengthCodeLengths, CODE_LENGTH_CODES); in readHuffmanCodeLengths()278 int[] codeLengthCodeLengths = new int[CODE_LENGTH_CODES]; in readHuffmanCode()281 for (int i = simpleCodeOrSkip; i < CODE_LENGTH_CODES && space > 0; i++) { in readHuffmanCode()