Lines Matching defs:bits
437 * bits so this doesn't need to be uint64_t even with big files.
627 /* 41-bit instruction stored somewhere in the lowest 48 bits */
999 * number of bits of the current uncompressed offset. In some places there
1089 /* Match length is encoded with 4, 5, or 10 bits.
1092 * 2-9 4 = Choice=0 + 3 bits
1093 * 10-17 5 = Choice=1 + Choice2=0 + 3 bits
1094 * 18-273 10 = Choice=1 + Choice2=1 + 8 bits
1129 * The highest two bits of a 32-bit match distance are encoded using six bits.
1131 * value takes 6-36 bits, larger values taking more bits.
1137 * the highest two bits (distance slot) are always encoded using six bits,
1138 * the distances 0-3 don't need any additional bits to encode, since the
1147 * - distance slot: the highest two bits
1148 * - direct bits: 2-26 bits below the highest two bits
1149 * - alignment bits: four lowest bits
1151 * Direct bits don't use any probabilities.
1162 * For match distances greater than 127, only the highest two bits and the
1163 * lowest four bits (alignment) is encoded using probabilities.
1189 * The worst case is that we decode 22 bits using probabilities and 26
1190 * direct bits. This may decode at maximum of 20 bytes of input. However,
1306 * context bits, a mask dervied from the number of literal
1307 * position bits, and a mask dervied from the number
1308 * position bits)
1342 * Probability tree for the highest two bits of the match
1349 * Probility trees for additional bits for match distance
1355 * Probability tree for the lowest four bits of a match
1694 /* Decode direct bits (fixed fifty-fifty probability) */
2089 * Highest three bits (s->control & 0xE0):
2100 * For LZMA compressed chunks, the lowest five bits
2101 * (s->control & 1F) are the highest bits of the
2102 * uncompressed size (bits 16-20).
2676 * The "bits" argument allows using the same code for both CRC32 and CRC64.
2679 uint32_t bits)
2690 } while (s->pos < bits);