#ifndef X264_BS_H
#define X264_BS_H
+typedef struct
+{
+ uint8_t i_bits;
+ uint8_t i_size;
+} vlc_t;
+
+typedef struct
+{
+ uint16_t i_bits;
+ uint8_t i_size;
+ /* Next level table to use */
+ uint8_t i_next;
+} vlc_large_t;
+
typedef struct bs_s
{
uint8_t *p_start;
int i_bits_encoded; /* RD only */
} bs_t;
+typedef struct
+{
+ int last;
+ int16_t level[16];
+ uint8_t run[16];
+} x264_run_level_t;
+
+extern const vlc_t x264_coeff0_token[5];
+extern const vlc_t x264_coeff_token[5][16*4];
+extern const vlc_t x264_total_zeros[15][16];
+extern const vlc_t x264_total_zeros_dc[3][4];
+extern const vlc_t x264_run_before[7][16];
+
+/* A larger level table size theoretically could help a bit at extremely
+ * high bitrates, but the cost in cache is usually too high for it to be
+ * useful.
+ * This size appears to be optimal for QP18 encoding on a Nehalem CPU.
+ * FIXME: Do further testing? */
+#define LEVEL_TABLE_SIZE 128
+extern vlc_large_t x264_level_token[7][LEVEL_TABLE_SIZE];
+
static inline void bs_init( bs_t *s, void *p_data, int i_data )
{
int offset = ((intptr_t)p_data & (WORD_SIZE-1));
s->i_left -= i_count;
if( s->i_left <= 32 )
{
+#ifdef WORDS_BIGENDIAN
+ *(uint32_t*)s->p = s->cur_bits >> (32 - s->i_left);
+#else
*(uint32_t*)s->p = endian_fix( s->cur_bits << s->i_left );
+#endif
s->i_left += 32;
s->p += 4;
}
/* golomb functions */
-static const uint8_t i_size0_255[256] =
+static const uint8_t x264_ue_size_tab[256] =
{
- 1,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,
- 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
- 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
- 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
- 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
- 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
- 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
- 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8
+ 1, 1, 3, 3, 5, 5, 5, 5, 7, 7, 7, 7, 7, 7, 7, 7,
+ 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
+ 11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,
+ 11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,
+ 13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,
+ 13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,
+ 13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,
+ 13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,
+ 15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,
+ 15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,
+ 15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,
+ 15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,
+ 15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,
+ 15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,
+ 15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,
+ 15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,
};
static inline void bs_write_ue_big( bs_t *s, unsigned int val )
{
- int i_size = 0;
-
- if( val == 0 )
- bs_write1( s, 1 );
- else
+ int size = 0;
+ int tmp = ++val;
+ if( tmp >= 0x10000 )
{
- unsigned int tmp = ++val;
-
- if( tmp >= 0x00010000 )
- {
- i_size += 16;
- tmp >>= 16;
- }
- if( tmp >= 0x100 )
- {
- i_size += 8;
- tmp >>= 8;
- }
- i_size += i_size0_255[tmp];
-
- bs_write( s, 2 * i_size - 1, val );
+ size = 32;
+ tmp >>= 16;
+ }
+ if( tmp >= 0x100 )
+ {
+ size += 16;
+ tmp >>= 8;
}
+ size += x264_ue_size_tab[tmp];
+ bs_write( s, size>>1, 0 );
+ bs_write( s, (size>>1)+1, val );
}
/* Only works on values under 255. */
static inline void bs_write_ue( bs_t *s, int val )
{
- if( val == 0 )
- bs_write1( s, 1 );
- else
- bs_write( s, 2 * i_size0_255[val+1] - 1, val+1 );
+ bs_write( s, x264_ue_size_tab[val+1], val+1 );
}
static inline void bs_write_se( bs_t *s, int val )
{
- int i_size = 0;
- val = val <= 0 ? -val * 2 : val * 2 - 1;
-
- if( val == 0 )
- bs_write1( s, 1 );
- else
+ int size = 0;
+ int tmp = val = val <= 0 ? -val*2+1 : val*2;
+ if( tmp >= 0x100 )
{
- unsigned int tmp = ++val;
-
- if( tmp >= 0x100 )
- {
- i_size += 8;
- tmp >>= 8;
- }
- i_size += i_size0_255[tmp];
-
- bs_write( s, 2 * i_size - 1, val );
+ size = 16;
+ tmp >>= 8;
}
+ size += x264_ue_size_tab[tmp];
+ bs_write( s, size, val );
}
static inline void bs_write_te( bs_t *s, int x, int val )
bs_flush( s );
}
-static const uint8_t i_size0_254[255] =
-{
- 1, 3, 3, 5, 5, 5, 5, 7, 7, 7, 7, 7, 7, 7, 7,
- 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
- 11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,
- 11,11,11,11,11,11,11,11,11,13,13,13,13,13,13,13,13,13,13,13,13,13,13,
- 13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,
- 13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,
- 13,13,13,13,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,
- 15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,
- 15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,
- 15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,
- 15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,
- 15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15
-};
-
static inline int bs_size_ue( unsigned int val )
{
- return i_size0_254[val];
+ return x264_ue_size_tab[val+1];
}
static inline int bs_size_ue_big( unsigned int val )
{
if( val < 255 )
- return i_size0_254[val];
+ return x264_ue_size_tab[val+1];
else
- {
- val++;
- val = (val >> 8) - 1;
- return i_size0_254[val] + 16;
- }
+ return x264_ue_size_tab[(val+1)>>8] + 16;
}
static inline int bs_size_se( int val )
{
- val = val <= 0 ? -val * 2 : val * 2 - 1;
- if( val < 255 )
- return i_size0_254[val];
- else
- {
- val++;
- val = (val >> 8) - 1;
- return i_size0_254[val] + 16;
- }
+ return bs_size_ue_big( val <= 0 ? -val*2 : val*2-1 );
}
static inline int bs_size_te( int x, int val )
if( x == 1 )
return 1;
else if( x > 1 )
- return i_size0_254[val];
- return 0;
+ return x264_ue_size_tab[val+1];
+ else
+ return 0;
}
#endif