Lines Matching refs:FIRSTBITS
682 #define FIRSTBITS 9u macro
690 static const unsigned headsize = 1u << FIRSTBITS; /*size of the first table*/ in HuffmanTree_makeTable()
691 static const unsigned mask = (1u << FIRSTBITS) /*headsize*/ - 1u; in HuffmanTree_makeTable()
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()
711 if(l > FIRSTBITS) size += (1u << (l - FIRSTBITS)); in HuffmanTree_makeTable()
727 if(l <= FIRSTBITS) continue; in HuffmanTree_makeTable()
730 pointer += (1u << (l - FIRSTBITS)); in HuffmanTree_makeTable()
744 if(l <= FIRSTBITS) { in HuffmanTree_makeTable()
746 unsigned num = 1u << (FIRSTBITS - l); in HuffmanTree_makeTable()
761 unsigned tablelen = maxlen - FIRSTBITS; in HuffmanTree_makeTable()
763 …unsigned num = 1u << (tablelen - (l - FIRSTBITS)); /*amount of entries of this symbol in secondary… in HuffmanTree_makeTable()
767 unsigned reverse2 = reverse >> FIRSTBITS; /* l - FIRSTBITS bits */ in HuffmanTree_makeTable()
768 unsigned index2 = start + (reverse2 | (j << (l - FIRSTBITS))); in HuffmanTree_makeTable()
787 tree->table_len[i] = (i < headsize) ? 1 : (FIRSTBITS + 1); in HuffmanTree_makeTable()
1098 unsigned short code = peekBits(reader, FIRSTBITS); in huffmanDecodeSymbol()
1101 if(l <= FIRSTBITS) { in huffmanDecodeSymbol()
1106 advanceBits(reader, FIRSTBITS); in huffmanDecodeSymbol()
1107 index2 = value + peekBits(reader, l - FIRSTBITS); in huffmanDecodeSymbol()
1108 advanceBits(reader, codetree->table_len[index2] - FIRSTBITS); in huffmanDecodeSymbol()