Searched refs:MAX_ALLOWED_CODE_LENGTH (Results 1 – 4 of 4) sorted by relevance
69 while (len < MAX_ALLOWED_CODE_LENGTH) { in NextTableBitSize()88 int count[MAX_ALLOWED_CODE_LENGTH + 1] = { 0 }; in BuildHuffmanTable()90 int offset[MAX_ALLOWED_CODE_LENGTH + 1]; in BuildHuffmanTable()100 if (code_lengths[symbol] > MAX_ALLOWED_CODE_LENGTH) { in BuildHuffmanTable()113 for (len = 1; len < MAX_ALLOWED_CODE_LENGTH; ++len) { in BuildHuffmanTable()133 if (offset[MAX_ALLOWED_CODE_LENGTH] == 1) { in BuildHuffmanTable()172 for (len = root_bits + 1, step = 2; len <= MAX_ALLOWED_CODE_LENGTH; in BuildHuffmanTable()200 if (num_nodes != 2 * offset[MAX_ALLOWED_CODE_LENGTH] - 1) { in BuildHuffmanTable()
264 assert(value <= MAX_ALLOWED_CODE_LENGTH); in CodeRepeatedValues()366 retval |= kReversedBits[bits & 0xf] << (MAX_ALLOWED_CODE_LENGTH + 1 - i); in ReverseBits()369 retval >>= (MAX_ALLOWED_CODE_LENGTH + 1 - num_bits); in ReverseBits()378 uint32_t next_code[MAX_ALLOWED_CODE_LENGTH + 1]; in ConvertBitDepthsToSymbols()379 int depth_count[MAX_ALLOWED_CODE_LENGTH + 1] = { 0 }; in ConvertBitDepthsToSymbols()385 assert(code_length <= MAX_ALLOWED_CODE_LENGTH); in ConvertBitDepthsToSymbols()392 for (i = 1; i <= MAX_ALLOWED_CODE_LENGTH; ++i) { in ConvertBitDepthsToSymbols()
41 #define MAX_ALLOWED_CODE_LENGTH 15 macro