SKIP_COUNTER(name, gb, num)\
}\
-/** This is equivalent to SKIP_LAST_CACHE; SKIP_COUNTER. */
-#define LAST_SKIP_BITS(name, gb, num) SKIP_COUNTER(name, gb, num)
-
/** Return the next num bits. */
#define SHOW_UBITS(name, gb, num)\
NEG_USR32(name##_cache, num)
OPEN_READER(re, s)
UPDATE_CACHE(re, s)
tmp = SHOW_UBITS(re, s, n);
- LAST_SKIP_BITS(re, s, n)
+ SKIP_COUNTER(re, s, n)
CLOSE_READER(re, s)
return tmp;
}
/* gcc seems to optimize this to s->index+=n for the ALT_READER :)) */
OPEN_READER(re, s)
UPDATE_CACHE(re, s)
- LAST_SKIP_BITS(re, s, n)
+ SKIP_COUNTER(re, s, n)
CLOSE_READER(re, s)
}
code = table[idx][0];
n = table[idx][1];
if (max_depth > 1 && n < 0) {
- LAST_SKIP_BITS(re, gb, bits)
+ SKIP_COUNTER(re, gb, bits)
UPDATE_CACHE(re, gb)
nb_bits = -n;
idx = SHOW_UBITS(re, gb, nb_bits) + code;
code = table[idx][0];
n = table[idx][1];
if (max_depth > 2 && n < 0) {
- LAST_SKIP_BITS(re, gb, nb_bits)
+ SKIP_COUNTER(re, gb, nb_bits)
UPDATE_CACHE(re, gb)
nb_bits = -n;
idx = SHOW_UBITS(re, gb, nb_bits) + code;