Searched refs:cache_avail (Results 1 – 3 of 3) sorted by relevance
101 int cache_avail; member2140 ds->br.cache_avail = 0; in lzx_decode_init()2222 ((br)->cache_avail - (n)))) & cache_masks[n])2225 ((n) - (br)->cache_avail))) & cache_masks[n])2270 int n = CACHE_BITS - br->cache_avail; in lzx_br_fillup()2287 br->cache_avail += 8 * 8; in lzx_br_fillup()2303 br->cache_avail += 6 * 8; in lzx_br_fillup()2329 br->cache_avail += 16; in lzx_br_fillup()2337 int n = CACHE_BITS - br->cache_avail; in lzx_br_fixup()2345 br->cache_avail += 16; in lzx_br_fixup()[all …]
95 int cache_avail; member1914 ds->br.cache_avail = 0; in lzh_decode_init()1948 #define lzh_br_has(br, n) ((br)->cache_avail >= n)1952 ((br)->cache_avail - (n)))) & cache_masks[n])1955 ((n) - (br)->cache_avail))) & cache_masks[n])1970 #define lzh_br_consume(br, n) ((br)->cache_avail -= (n))1991 int n = CACHE_BITS - br->cache_avail; in lzh_br_fillup()2009 br->cache_avail += 8 * 8; in lzh_br_fillup()2023 br->cache_avail += 7 * 8; in lzh_br_fillup()2036 br->cache_avail += 6 * 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])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()587 br->cache_avail += 8; in rar_br_fillup()607 if (br->cache_avail == 0) in rar_br_preparation()[all …]