(((const uint8_t*)(x))[2] << 8) | \
((const uint8_t*)(x))[3])
-#define NEG_USR32(a,s) (((uint32_t)(a))>>(32-(s)))
-
/** Structure for bistream I/O. */
struct getbit_context {
/* Start of the internal buffer. */
/**
* Increment the internal bit counter.
*
- * \sa SKIP_CACHE, SKIP_BITS.
+ * \sa SKIP_CACHE.
*/
#define SKIP_COUNTER(name, gb, num)\
name##_index += (num);\
-/**
- * Skip over the next num bits.
- *
- * This is equivalent to SKIP_CACHE; SKIP_COUNTER.
- */
-#define SKIP_BITS(name, gb, num)\
- {\
- SKIP_CACHE(name, gb, num)\
- SKIP_COUNTER(name, gb, num)\
- }\
-
/** Return the next num bits. */
-#define SHOW_UBITS(name, gb, num)\
- NEG_USR32(name##_cache, num)
+#define SHOW_UBITS(name, gb, num) \
+ (((uint32_t)(name##_cache)) >> (32 - (num)))
static inline int get_bits_count(struct getbit_context *s)
{
static inline void skip_bits(struct getbit_context *s, int n)
{
- /* gcc seems to optimize this to s->index+=n for the ALT_READER :)) */
- OPEN_READER(re, s)
- UPDATE_CACHE(re, s)
- SKIP_COUNTER(re, s, n)
- CLOSE_READER(re, s)
+ s->index += n;
}
static inline unsigned int get_bits1(struct getbit_context *s)
n = table[idx][1];
}
}
- SKIP_BITS(re, gb, n)
+ SKIP_CACHE(re, gb, n)
+ SKIP_COUNTER(re, gb, n)
CLOSE_READER(re, gb)
return code;
}