Lines Matching full:inbitlength
900 inbitlength is the length of the complete buffer, in bits (so its byte length times 8)
903 const HuffmanTree* codetree, size_t inbitlength)
908 if(*bp >= inbitlength) return (unsigned)(-1); /*error: end of input memory reached without endcode*/
944 size_t inbitlength = inlength * 8;
991 unsigned code = huffmanDecodeSymbol(in, bp, &tree_cl, inbitlength);
1003 if(*bp >= inbitlength) ERROR_BREAK(50); /*error, bit pointer jumps past memory*/
1022 if(*bp >= inbitlength) ERROR_BREAK(50); /*error, bit pointer jumps past memory*/
1039 if(*bp >= inbitlength) ERROR_BREAK(50); /*error, bit pointer jumps past memory*/
1059 error = (*bp) > inbitlength ? 10 : 11;
1092 size_t inbitlength = inlength * 8;
1103 unsigned code_ll = huffmanDecodeSymbol(in, bp, &tree_ll, inbitlength);
1125 if(*bp >= inbitlength) ERROR_BREAK(51); /*error, bit pointer will jump past memory*/
1129 code_d = huffmanDecodeSymbol(in, bp, &tree_d, inbitlength);
1145 if(*bp >= inbitlength) ERROR_BREAK(51); /*error, bit pointer will jump past memory*/
