Lines Matching refs:l

726         unsigned l = tree->lengths[i];  in HuffmanTree_makeTable()  local
728 …if(l <= FIRSTBITS) continue; /*symbols that fit in first table don't increase secondary table size… in HuffmanTree_makeTable()
730 index = reverseBits(symbol >> (l - FIRSTBITS), FIRSTBITS); in HuffmanTree_makeTable()
731 maxlens[index] = LODEPNG_MAX(maxlens[index], l); in HuffmanTree_makeTable()
736 unsigned l = maxlens[i]; in HuffmanTree_makeTable() local
737 if(l > FIRSTBITS) size += (((size_t)1) << (l - FIRSTBITS)); in HuffmanTree_makeTable()
752 unsigned l = maxlens[i]; in HuffmanTree_makeTable() local
753 if(l <= FIRSTBITS) continue; in HuffmanTree_makeTable()
754 tree->table_len[i] = l; in HuffmanTree_makeTable()
756 pointer += (((size_t)1) << (l - FIRSTBITS)); in HuffmanTree_makeTable()
763 unsigned l = tree->lengths[i]; in HuffmanTree_makeTable() local
765 if(l == 0) continue; in HuffmanTree_makeTable()
768 reverse = reverseBits(symbol, l); in HuffmanTree_makeTable()
771 if(l <= FIRSTBITS) { in HuffmanTree_makeTable()
773 unsigned num = 1u << (FIRSTBITS - l); in HuffmanTree_makeTable()
777 unsigned index = reverse | (j << l); in HuffmanTree_makeTable()
779 tree->table_len[index] = l; in HuffmanTree_makeTable()
791 …unsigned num = 1u << (tablelen - (l - FIRSTBITS)); /*amount of entries of this symbol in secondary… in HuffmanTree_makeTable()
793 if(maxlen < l) return 55; /*invalid tree: long symbol shares prefix with short symbol*/ in HuffmanTree_makeTable()
796 unsigned index2 = start + (reverse2 | (j << (l - FIRSTBITS))); in HuffmanTree_makeTable()
797 tree->table_len[index2] = l; in HuffmanTree_makeTable()
1141 unsigned short l = codetree->table_len[code]; in huffmanDecodeSymbol() local
1143 if(l <= FIRSTBITS) { in huffmanDecodeSymbol()
1144 advanceBits(reader, l); in huffmanDecodeSymbol()
1149 value += peekBits(reader, l - FIRSTBITS); in huffmanDecodeSymbol()
6400 size_t l; in ilog2i() local
6402 l = ilog2(i); in ilog2i()
6405 return i * l + ((i - (((size_t)1) << l)) << 1u); in ilog2i()