void free_vlc(struct vlc *vlc);
/**
+ * Parse a vlc code.
*
- * if the vlc code is invalid and max_depth=1 than no bits will be removed
- * if the vlc code is invalid and max_depth>1 than the number of bits removed
- * is undefined
+ * \param bits The number of bits which will be read at once, must be
+ * identical to nb_bits in init_vlc()
+ *
+ * \param max_depth The number of times bits bits must be read to completely
+ * read the longest vlc code = (max_vlc_length + bits - 1) / bits.
*/
-#define GET_VLC(code, name, gb, table, bits, max_depth)\
-{\
- int n, index, nb_bits;\
-\
- index= SHOW_UBITS(name, gb, bits);\
- code = table[index][0];\
- n = table[index][1];\
-\
- if(max_depth > 1 && n < 0){\
- LAST_SKIP_BITS(name, gb, bits)\
- UPDATE_CACHE(name, gb)\
-\
- nb_bits = -n;\
-\
- index= SHOW_UBITS(name, gb, nb_bits) + code;\
- code = table[index][0];\
- n = table[index][1];\
- if(max_depth > 2 && n < 0){\
- LAST_SKIP_BITS(name, gb, nb_bits)\
- UPDATE_CACHE(name, gb)\
-\
- nb_bits = -n;\
-\
- index= SHOW_UBITS(name, gb, nb_bits) + code;\
- code = table[index][0];\
- n = table[index][1];\
- }\
- }\
- SKIP_BITS(name, gb, n)\
+static inline int get_vlc(struct getbit_context *gb, VLC_TYPE(*table)[2],
+ int bits, int max_depth)
+{
+ int n, idx, nb_bits, code;
+
+ OPEN_READER(re, gb)
+ UPDATE_CACHE(re, gb)
+ idx = SHOW_UBITS(re, gb, bits);
+ code = table[idx][0];
+ n = table[idx][1];
+ if (max_depth > 1 && n < 0) {
+ LAST_SKIP_BITS(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)
+ UPDATE_CACHE(re, gb)
+ nb_bits = -n;
+ idx = SHOW_UBITS(re, gb, nb_bits) + code;
+ code = table[idx][0];
+ n = table[idx][1];
+ }
+ }
+ SKIP_BITS(re, gb, n)
+ CLOSE_READER(re, gb)
+ return code;
}