Searched refs:cache_avail (Results 1 – 3 of 3) sorted by relevance
101 int cache_avail; member2157 ds->br.cache_avail = 0; in lzx_decode_init()2235 #define lzx_br_has(br, n) ((br)->cache_avail >= n)2239 ((br)->cache_avail - (n)))) & cache_masks[n])2242 ((n) - (br)->cache_avail))) & cache_masks[n])2257 #define lzx_br_consume(br, n) ((br)->cache_avail -= (n))2258 #define lzx_br_consume_unaligned_bits(br) ((br)->cache_avail &= ~0x0f)2260 #define lzx_br_is_unaligned(br) ((br)->cache_avail & 0x0f)2287 int n = CACHE_BITS - br->cache_avail; in lzx_br_fillup()2304 br->cache_avail += 8 * 8; in lzx_br_fillup()[all …]
96 int cache_avail; member1880 ds->br.cache_avail = 0; in lzh_decode_init()1914 #define lzh_br_has(br, n) ((br)->cache_avail >= n)1918 ((br)->cache_avail - (n)))) & cache_masks[n])1921 ((n) - (br)->cache_avail))) & cache_masks[n])1936 #define lzh_br_consume(br, n) ((br)->cache_avail -= (n))1937 #define lzh_br_unconsume(br, n) ((br)->cache_avail += (n))1957 int n = CACHE_BITS - br->cache_avail; in lzh_br_fillup()1975 br->cache_avail += 8 * 8; in lzh_br_fillup()1989 br->cache_avail += 7 * 8; in lzh_br_fillup()[all …]
386 int cache_avail; member462 #define rar_br_has(br, n) ((br)->cache_avail >= n)466 ((br)->cache_avail - (n)))) & cache_masks[n])469 ((n) - (br)->cache_avail))) & cache_masks[n])477 #define rar_br_consume(br, n) ((br)->cache_avail -= (n))478 #define rar_br_consume_unaligned_bits(br) ((br)->cache_avail &= ~7)503 int n = CACHE_BITS - br->cache_avail; in rar_br_fillup()520 br->cache_avail += 8 * 8; in rar_br_fillup()539 br->cache_avail += 7 * 8; in rar_br_fillup()557 br->cache_avail += 6 * 8; in rar_br_fillup()[all …]