Searched refs:code_lengths_size (Results 1 – 4 of 4) sorted by relevance
73 int code_lengths_size, int* const huff_codes) { in HuffmanCodeLengthsToCodes() argument82 assert(code_lengths_size > 0); in HuffmanCodeLengthsToCodes()86 for (symbol = 0; symbol < code_lengths_size; ++symbol) { in HuffmanCodeLengthsToCodes()94 for (symbol = 0; symbol < code_lengths_size; ++symbol) { in HuffmanCodeLengthsToCodes()110 for (symbol = 0; symbol < code_lengths_size; ++symbol) { in HuffmanCodeLengthsToCodes()147 int code_lengths_size) { in HuffmanTreeBuildImplicit() argument156 for (symbol = 0; symbol < code_lengths_size; ++symbol) { in HuffmanTreeBuildImplicit()169 const int max_symbol = code_lengths_size; in HuffmanTreeBuildImplicit()180 (int*)WebPSafeMalloc((uint64_t)code_lengths_size, sizeof(*codes)); in HuffmanTreeBuildImplicit()183 if (!HuffmanCodeLengthsToCodes(code_lengths, code_lengths_size, codes)) { in HuffmanTreeBuildImplicit()[all …]
58 int code_lengths_size);73 int code_lengths_size, int* const huff_codes);
79 const int code_lengths[], int code_lengths_size) { in VP8LBuildHuffmanTable() argument90 assert(code_lengths_size != 0); in VP8LBuildHuffmanTable()96 for (symbol = 0; symbol < code_lengths_size; ++symbol) { in VP8LBuildHuffmanTable()104 if (count[0] == code_lengths_size) { in VP8LBuildHuffmanTable()117 sorted = (int*)WebPSafeMalloc(code_lengths_size, sizeof(*sorted)); in VP8LBuildHuffmanTable()123 for (symbol = 0; symbol < code_lengths_size; ++symbol) { in VP8LBuildHuffmanTable()
82 const int code_lengths[], int code_lengths_size);