Lines Matching refs:br

104 	} br;
2139 ds->br.cache_buffer = 0;
2140 ds->br.cache_avail = 0;
2218 #define lzx_br_has(br, n) ((br)->cache_avail >= n)
2220 #define lzx_br_bits(br, n) \
2221 (((uint32_t)((br)->cache_buffer >> \
2222 ((br)->cache_avail - (n)))) & cache_masks[n])
2223 #define lzx_br_bits_forced(br, n) \
2224 (((uint32_t)((br)->cache_buffer << \
2225 ((n) - (br)->cache_avail))) & cache_masks[n])
2231 #define lzx_br_read_ahead_0(strm, br, n) \
2232 (lzx_br_has((br), (n)) || lzx_br_fillup(strm, br))
2236 #define lzx_br_read_ahead(strm, br, n) \
2237 (lzx_br_read_ahead_0((strm), (br), (n)) || lzx_br_has((br), (n)))
2240 #define lzx_br_consume(br, n) ((br)->cache_avail -= (n))
2241 #define lzx_br_consume_unaligned_bits(br) ((br)->cache_avail &= ~0x0f)
2243 #define lzx_br_is_unaligned(br) ((br)->cache_avail & 0x0f)
2265 lzx_br_fillup(struct lzx_stream *strm, struct lzx_br *br)
2270 int n = CACHE_BITS - br->cache_avail;
2276 br->cache_buffer =
2287 br->cache_avail += 8 * 8;
2293 br->cache_buffer =
2294 (br->cache_buffer << 48) |
2303 br->cache_avail += 6 * 8;
2318 br->odd = *strm->next_in++;
2320 br->have_odd = 1;
2324 br->cache_buffer =
2325 (br->cache_buffer << 16) |
2329 br->cache_avail += 16;
2335 lzx_br_fixup(struct lzx_stream *strm, struct lzx_br *br)
2337 int n = CACHE_BITS - br->cache_avail;
2339 if (br->have_odd && n >= 16 && strm->avail_in > 0) {
2340 br->cache_buffer =
2341 (br->cache_buffer << 16) |
2342 ((uint16_t)(*strm->next_in)) << 8 | br->odd;
2345 br->cache_avail += 16;
2346 br->have_odd = 0;
2353 strm->ds->br.cache_avail = 0;
2354 strm->ds->br.have_odd = 0;
2401 lzx_br_fixup(strm, &(ds->br));
2421 struct lzx_br *br = &(ds->br);
2427 if (!lzx_br_read_ahead(strm, br, 1)) {
2433 ds->translation = lzx_br_bits(br, 1);
2434 lzx_br_consume(br, 1);
2438 if (!lzx_br_read_ahead(strm, br, 32)) {
2444 ds->translation_size = lzx_br_bits(br, 16);
2445 lzx_br_consume(br, 16);
2447 ds->translation_size |= lzx_br_bits(br, 16);
2448 lzx_br_consume(br, 16);
2452 if (!lzx_br_read_ahead(strm, br, 3)) {
2458 ds->block_type = lzx_br_bits(br, 3);
2459 lzx_br_consume(br, 3);
2471 if (!lzx_br_read_ahead(strm, br, 24)) {
2477 ds->block_size = lzx_br_bits(br, 8);
2478 lzx_br_consume(br, 8);
2480 ds->block_size |= lzx_br_bits(br, 16);
2481 lzx_br_consume(br, 16);
2499 if (lzx_br_is_unaligned(br))
2500 lzx_br_consume_unaligned_bits(br);
2502 if (lzx_br_read_ahead(strm, br, 16))
2503 lzx_br_consume(br, 16);
2522 if (lzx_br_has(br, 32)) {
2523 u16 = lzx_br_bits(br, 16);
2524 lzx_br_consume(br, 16);
2526 u16 = lzx_br_bits(br, 16);
2527 lzx_br_consume(br, 16);
2530 } else if (lzx_br_has(br, 16)) {
2531 u16 = lzx_br_bits(br, 16);
2532 lzx_br_consume(br, 16);
2536 if (ds->rbytes_avail < 4 && ds->br.have_odd) {
2538 ds->br.odd;
2539 ds->br.have_odd = 0;
2627 if (!lzx_br_read_ahead(strm, br, 3 * ds->at.len_size)) {
2635 ds->at.bitlen[i] = lzx_br_bits(br, 3);
2637 lzx_br_consume(br, 3);
2746 struct lzx_br bre = ds->br;
2775 ds->br = bre;
3002 ds->br = bre;
3020 struct lzx_br *br = &(ds->br);
3026 if (!lzx_br_read_ahead(strm, br, 4)) {
3030 ds->pt.bitlen[i] = lzx_br_bits(br, 4);
3032 lzx_br_consume(br, 4);
3045 struct lzx_br *br = &(ds->br);
3057 if (!lzx_br_read_ahead(strm, br, ds->pt.max_bits))
3059 rbits = lzx_br_bits(br, ds->pt.max_bits);
3063 if (!lzx_br_read_ahead(strm, br, ds->pt.bitlen[c]+4))
3065 lzx_br_consume(br, ds->pt.bitlen[c]);
3066 same = lzx_br_bits(br, 4) + 4;
3069 lzx_br_consume(br, 4);
3074 if (!lzx_br_read_ahead(strm, br, ds->pt.bitlen[c]+5))
3076 lzx_br_consume(br, ds->pt.bitlen[c]);
3077 same = lzx_br_bits(br, 5) + 20;
3080 lzx_br_consume(br, 5);
3085 if (!lzx_br_read_ahead(strm, br,
3088 lzx_br_consume(br, ds->pt.bitlen[c]);
3089 same = lzx_br_bits(br, 1) + 4;
3092 lzx_br_consume(br, 1);
3093 rbits = lzx_br_bits(br, ds->pt.max_bits);
3095 lzx_br_consume(br, ds->pt.bitlen[c]);
3104 lzx_br_consume(br, ds->pt.bitlen[c]);