Lines Matching defs:br

104 	} br;
2142 ds->br.cache_buffer = 0;
2143 ds->br.cache_avail = 0;
2221 #define lzx_br_has(br, n) ((br)->cache_avail >= n)
2223 #define lzx_br_bits(br, n) \
2224 (((uint32_t)((br)->cache_buffer >> \
2225 ((br)->cache_avail - (n)))) & cache_masks[n])
2226 #define lzx_br_bits_forced(br, n) \
2227 (((uint32_t)((br)->cache_buffer << \
2228 ((n) - (br)->cache_avail))) & cache_masks[n])
2234 #define lzx_br_read_ahead_0(strm, br, n) \
2235 (lzx_br_has((br), (n)) || lzx_br_fillup(strm, br))
2239 #define lzx_br_read_ahead(strm, br, n) \
2240 (lzx_br_read_ahead_0((strm), (br), (n)) || lzx_br_has((br), (n)))
2243 #define lzx_br_consume(br, n) ((br)->cache_avail -= (n))
2244 #define lzx_br_consume_unaligned_bits(br) ((br)->cache_avail &= ~0x0f)
2246 #define lzx_br_is_unaligned(br) ((br)->cache_avail & 0x0f)
2268 lzx_br_fillup(struct lzx_stream *strm, struct lzx_br *br)
2273 int n = CACHE_BITS - br->cache_avail;
2279 br->cache_buffer =
2290 br->cache_avail += 8 * 8;
2296 br->cache_buffer =
2297 (br->cache_buffer << 48) |
2306 br->cache_avail += 6 * 8;
2321 br->odd = *strm->next_in++;
2323 br->have_odd = 1;
2327 br->cache_buffer =
2328 (br->cache_buffer << 16) |
2332 br->cache_avail += 16;
2338 lzx_br_fixup(struct lzx_stream *strm, struct lzx_br *br)
2340 int n = CACHE_BITS - br->cache_avail;
2342 if (br->have_odd && n >= 16 && strm->avail_in > 0) {
2343 br->cache_buffer =
2344 (br->cache_buffer << 16) |
2345 ((uint16_t)(*strm->next_in)) << 8 | br->odd;
2348 br->cache_avail += 16;
2349 br->have_odd = 0;
2356 strm->ds->br.cache_avail = 0;
2357 strm->ds->br.have_odd = 0;
2404 lzx_br_fixup(strm, &(ds->br));
2424 struct lzx_br *br = &(ds->br);
2430 if (!lzx_br_read_ahead(strm, br, 1)) {
2436 ds->translation = lzx_br_bits(br, 1);
2437 lzx_br_consume(br, 1);
2441 if (!lzx_br_read_ahead(strm, br, 32)) {
2447 ds->translation_size = lzx_br_bits(br, 16);
2448 lzx_br_consume(br, 16);
2450 ds->translation_size |= lzx_br_bits(br, 16);
2451 lzx_br_consume(br, 16);
2455 if (!lzx_br_read_ahead(strm, br, 3)) {
2461 ds->block_type = lzx_br_bits(br, 3);
2462 lzx_br_consume(br, 3);
2474 if (!lzx_br_read_ahead(strm, br, 24)) {
2480 ds->block_size = lzx_br_bits(br, 8);
2481 lzx_br_consume(br, 8);
2483 ds->block_size |= lzx_br_bits(br, 16);
2484 lzx_br_consume(br, 16);
2502 if (lzx_br_is_unaligned(br))
2503 lzx_br_consume_unaligned_bits(br);
2505 if (lzx_br_read_ahead(strm, br, 16))
2506 lzx_br_consume(br, 16);
2525 if (lzx_br_has(br, 32)) {
2526 u16 = lzx_br_bits(br, 16);
2527 lzx_br_consume(br, 16);
2529 u16 = lzx_br_bits(br, 16);
2530 lzx_br_consume(br, 16);
2533 } else if (lzx_br_has(br, 16)) {
2534 u16 = lzx_br_bits(br, 16);
2535 lzx_br_consume(br, 16);
2539 if (ds->rbytes_avail < 4 && ds->br.have_odd) {
2541 ds->br.odd;
2542 ds->br.have_odd = 0;
2630 if (!lzx_br_read_ahead(strm, br, 3 * ds->at.len_size)) {
2638 ds->at.bitlen[i] = lzx_br_bits(br, 3);
2640 lzx_br_consume(br, 3);
2749 struct lzx_br bre = ds->br;
2778 ds->br = bre;
3005 ds->br = bre;
3023 struct lzx_br *br = &(ds->br);
3029 if (!lzx_br_read_ahead(strm, br, 4)) {
3033 ds->pt.bitlen[i] = lzx_br_bits(br, 4);
3035 lzx_br_consume(br, 4);
3048 struct lzx_br *br = &(ds->br);
3060 if (!lzx_br_read_ahead(strm, br, ds->pt.max_bits))
3062 rbits = lzx_br_bits(br, ds->pt.max_bits);
3066 if (!lzx_br_read_ahead(strm, br, ds->pt.bitlen[c]+4))
3068 lzx_br_consume(br, ds->pt.bitlen[c]);
3069 same = lzx_br_bits(br, 4) + 4;
3072 lzx_br_consume(br, 4);
3077 if (!lzx_br_read_ahead(strm, br, ds->pt.bitlen[c]+5))
3079 lzx_br_consume(br, ds->pt.bitlen[c]);
3080 same = lzx_br_bits(br, 5) + 20;
3083 lzx_br_consume(br, 5);
3088 if (!lzx_br_read_ahead(strm, br,
3091 lzx_br_consume(br, ds->pt.bitlen[c]);
3092 same = lzx_br_bits(br, 1) + 4;
3095 lzx_br_consume(br, 1);
3096 rbits = lzx_br_bits(br, ds->pt.max_bits);
3098 lzx_br_consume(br, ds->pt.bitlen[c]);
3107 lzx_br_consume(br, ds->pt.bitlen[c]);