Searched refs:cache_avail (Results 1 – 3 of 3) sorted by relevance
96 int cache_avail; member1926 ds->br.cache_avail = 0; in lzh_decode_init()1960 #define lzh_br_has(br, n) ((br)->cache_avail >= n)1964 ((br)->cache_avail - (n)))) & cache_masks[n])1967 ((n) - (br)->cache_avail))) & cache_masks[n])1982 #define lzh_br_consume(br, n) ((br)->cache_avail -= (n))1983 #define lzh_br_unconsume(br, n) ((br)->cache_avail += (n))2003 int n = CACHE_BITS - br->cache_avail; in lzh_br_fillup()2021 br->cache_avail += 8 * 8; in lzh_br_fillup()2035 br->cache_avail += 7 * 8; in lzh_br_fillup()[all …]
144 size_t cache_avail; member2257 ds->br.cache_avail = 0; in lzx_decode_init()2342 #define lzx_br_has(br, n) ((br)->cache_avail >= n)2346 ((br)->cache_avail - (n)))) & cache_masks[n])2349 ((n) - (br)->cache_avail))) & cache_masks[n])2364 #define lzx_br_consume(br, n) ((br)->cache_avail -= (n))2365 #define lzx_br_consume_unaligned_bits(br) ((br)->cache_avail &= ~0x0f)2367 #define lzx_br_is_unaligned(br) ((br)->cache_avail & 0x0f)2394 ssize_t n = CACHE_BITS - br->cache_avail; in lzx_br_fillup()2411 br->cache_avail += 8 * 8; in lzx_br_fillup()[all …]
385 int cache_avail; member461 #define rar_br_has(br, n) ((br)->cache_avail >= n)465 ((br)->cache_avail - (n)))) & cache_masks[n])468 ((n) - (br)->cache_avail))) & cache_masks[n])476 #define rar_br_consume(br, n) ((br)->cache_avail -= (n))477 #define rar_br_consume_unaligned_bits(br) ((br)->cache_avail &= ~7)502 int n = CACHE_BITS - br->cache_avail; in rar_br_fillup()519 br->cache_avail += 8 * 8; in rar_br_fillup()538 br->cache_avail += 7 * 8; in rar_br_fillup()556 br->cache_avail += 6 * 8; in rar_br_fillup()[all …]