700     unsigned l = tree->lengths[i];  in HuffmanTree_makeTable()  local
702 …if(l <= FIRSTBITS) continue; /*symbols that fit in first table don't increase secondary table size…  in HuffmanTree_makeTable()
704     index = reverseBits(symbol >> (l - FIRSTBITS), FIRSTBITS);  in HuffmanTree_makeTable()
705     maxlens[index] = LODEPNG_MAX(maxlens[index], l);  in HuffmanTree_makeTable()
710     unsigned l = maxlens[i];  in HuffmanTree_makeTable()  local
711     if(l > FIRSTBITS) size += (1u << (l - FIRSTBITS));  in HuffmanTree_makeTable()
726     unsigned l = maxlens[i];  in HuffmanTree_makeTable()  local
727     if(l <= FIRSTBITS) continue;  in HuffmanTree_makeTable()
728     tree->table_len[i] = l;  in HuffmanTree_makeTable()
730     pointer += (1u << (l - FIRSTBITS));  in HuffmanTree_makeTable()
737     unsigned l = tree->lengths[i];  in HuffmanTree_makeTable()  local
740     unsigned reverse = reverseBits(symbol, l);  in HuffmanTree_makeTable()
741     if(l == 0) continue;  in HuffmanTree_makeTable()
744     if(l <= FIRSTBITS) {  in HuffmanTree_makeTable()
746       unsigned num = 1u << (FIRSTBITS - l);  in HuffmanTree_makeTable()
750         unsigned index = reverse | (j << l);  in HuffmanTree_makeTable()
752         tree->table_len[index] = l;  in HuffmanTree_makeTable()
763 …unsigned num = 1u << (tablelen - (l - FIRSTBITS)); /*amount of entries of this symbol in secondary…  in HuffmanTree_makeTable()
765       if(maxlen < l) return 55; /*invalid tree: long symbol shares prefix with short symbol*/  in HuffmanTree_makeTable()
768         unsigned index2 = start + (reverse2 | (j << (l - FIRSTBITS)));  in HuffmanTree_makeTable()
769         tree->table_len[index2] = l;  in HuffmanTree_makeTable()
1099   unsigned short l = codetree->table_len[code];  in huffmanDecodeSymbol()  local
1101   if(l <= FIRSTBITS) {  in huffmanDecodeSymbol()
1102     advanceBits(reader, l);  in huffmanDecodeSymbol()
1107     index2 = value + peekBits(reader, l - FIRSTBITS);  in huffmanDecodeSymbol()
5439   size_t l;  in ilog2i()  local
5441   l = ilog2(i);  in ilog2i()
5444   return i * l + ((i - (1u << l)) << 1u);  in ilog2i()