Lines Matching defs:bits
17 1.4 18 Aug 2012 Avoid shifts more than bits in type (caused endless loop!)
26 maximum code length in bits to determine the maximum table size for zlib's
46 speed. There is a single first-level table to decode codes up to root bits
49 entries and is indexed by the next root bits of input. Codes shorter than
50 root bits have replicated table entries, so that the correct entry is
51 pointed to regardless of the bits that follow the short code. If the code is
52 longer than root bits, then the table entry points to a second-level table.
55 (len - root), to index the remaining bits in that set of codes. Each
59 than root bits, then root is reduced to the longest code length, resulting
63 the log2 of the number of symbols), where the shortest code has more bits
72 the maximum code length in bits. However this is a very small price to pay
80 codes of root bits or less in length.) Third, the visited states in the
100 number of bits in a long long minus the number of bits needed to represent
127 len: number of bits in the codes currently being assigned
133 len: 1..max - 1 (max == maximum code length in bits)
226 int root; // size of base code table in bits
387 for (int bits = g.max; bits > g.root; bits--) {
388 syms += g.code[bits];
389 left -= g.code[bits];
397 for (int bits = g.root + 1; bits <= g.max; bits++)
398 if (g.code[bits])
399 string_printf(&g.out, " %d[%d]", g.code[bits], bits);
449 // Look at all sub-codes starting with root + 1 bits. Look at only the valid
472 // bits (not saved in num, since complete), just in case
485 // in bits -- those are the command arguments in that order. The default values
491 // associated sub-code (starting at root + 1 == 10 bits) is shown.
527 // determine the number of bits in a code_t
528 int bits = 0;
530 bits++;
533 if (g.max > bits || (code_t)(syms - 2) >= ((code_t)-1 >> (g.max - 1))) {
540 fprintf(stderr, "%d symbols cannot be coded in %d bits\n",