Browse Source

get_bits: Rename HAVE_BITS_REMAINING --> BITS_AVAILABLE

The HAVE_ prefix is reserved for macros set by configure.
tags/n2.4
Diego Biurrun 11 years ago
parent
commit
91d305790e
2 changed files with 4 additions and 4 deletions
  1. +2
    -2
      libavcodec/get_bits.h
  2. +2
    -2
      libavcodec/golomb.h

+ 2
- 2
libavcodec/get_bits.h View File

@@ -128,14 +128,14 @@ typedef struct RL_VLC_ELEM {
unsigned int name ## _index = (gb)->index; \ unsigned int name ## _index = (gb)->index; \
unsigned int av_unused name ## _cache = 0 unsigned int av_unused name ## _cache = 0


#define HAVE_BITS_REMAINING(name, gb) 1
#define BITS_AVAILABLE(name, gb) 1
#else #else
#define OPEN_READER(name, gb) \ #define OPEN_READER(name, gb) \
unsigned int name ## _index = (gb)->index; \ unsigned int name ## _index = (gb)->index; \
unsigned int av_unused name ## _cache = 0; \ unsigned int av_unused name ## _cache = 0; \
unsigned int av_unused name ## _size_plus8 = (gb)->size_in_bits_plus8 unsigned int av_unused name ## _size_plus8 = (gb)->size_in_bits_plus8


#define HAVE_BITS_REMAINING(name, gb) name ## _index < name ## _size_plus8
#define BITS_AVAILABLE(name, gb) name ## _index < name ## _size_plus8
#endif #endif


#define CLOSE_READER(name, gb) (gb)->index = name ## _index #define CLOSE_READER(name, gb) (gb)->index = name ## _index


+ 2
- 2
libavcodec/golomb.h View File

@@ -138,7 +138,7 @@ static inline unsigned svq3_get_ue_golomb(GetBitContext *gb)
ret = (ret << 4) | ff_interleaved_dirac_golomb_vlc_code[buf]; ret = (ret << 4) | ff_interleaved_dirac_golomb_vlc_code[buf];
UPDATE_CACHE(re, gb); UPDATE_CACHE(re, gb);
buf = GET_CACHE(re, gb); buf = GET_CACHE(re, gb);
} while (HAVE_BITS_REMAINING(re, gb));
} while (BITS_AVAILABLE(re, gb));


CLOSE_READER(re, gb); CLOSE_READER(re, gb);
return ret - 1; return ret - 1;
@@ -328,7 +328,7 @@ static inline int get_ur_golomb_jpegls(GetBitContext *gb, int k, int limit,
return buf; return buf;
} else { } else {
int i; int i;
for (i = 0; i < limit && SHOW_UBITS(re, gb, 1) == 0 && HAVE_BITS_REMAINING(re, gb); i++) {
for (i = 0; i < limit && SHOW_UBITS(re, gb, 1) == 0 && BITS_AVAILABLE(re, gb); i++) {
LAST_SKIP_BITS(re, gb, 1); LAST_SKIP_BITS(re, gb, 1);
UPDATE_CACHE(re, gb); UPDATE_CACHE(re, gb);
} }


Loading…
Cancel
Save