You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

229 lines
4.7KB

  1. #ifndef COMMON_H
  2. #define COMMON_H
  3. #ifdef HAVE_AV_CONFIG_H
  4. #include "../config.h"
  5. #endif
  6. #ifndef __WINE_WINDEF16_H
  7. /* workaround for typedef conflict in MPlayer (wine typedefs) */
  8. typedef unsigned short UINT16;
  9. typedef signed short INT16;
  10. #endif
  11. typedef unsigned char UINT8;
  12. typedef unsigned int UINT32;
  13. typedef unsigned long long UINT64;
  14. typedef signed char INT8;
  15. typedef signed int INT32;
  16. typedef signed long long INT64;
  17. /* bit output */
  18. struct PutBitContext;
  19. typedef void (*WriteDataFunc)(void *, UINT8 *, int);
  20. typedef struct PutBitContext {
  21. UINT32 bit_buf;
  22. int bit_cnt;
  23. UINT8 *buf, *buf_ptr, *buf_end;
  24. long long data_out_size; /* in bytes */
  25. void *opaque;
  26. WriteDataFunc write_data;
  27. } PutBitContext;
  28. void init_put_bits(PutBitContext *s,
  29. UINT8 *buffer, int buffer_size,
  30. void *opaque,
  31. void (*write_data)(void *, UINT8 *, int));
  32. void put_bits(PutBitContext *s, int n, unsigned int value);
  33. long long get_bit_count(PutBitContext *s);
  34. void align_put_bits(PutBitContext *s);
  35. void flush_put_bits(PutBitContext *s);
  36. /* jpeg specific put_bits */
  37. void jput_bits(PutBitContext *s, int n, unsigned int value);
  38. void jflush_put_bits(PutBitContext *s);
  39. /* bit input */
  40. typedef struct GetBitContext {
  41. UINT32 bit_buf;
  42. int bit_cnt;
  43. UINT8 *buf, *buf_ptr, *buf_end;
  44. } GetBitContext;
  45. typedef struct VLC {
  46. int bits;
  47. INT16 *table_codes;
  48. INT8 *table_bits;
  49. int table_size, table_allocated;
  50. } VLC;
  51. void init_get_bits(GetBitContext *s,
  52. UINT8 *buffer, int buffer_size);
  53. unsigned int get_bits_long(GetBitContext *s, int n);
  54. static inline unsigned int get_bits(GetBitContext *s, int n){
  55. if(s->bit_cnt>=n){
  56. /* most common case here */
  57. unsigned int val = s->bit_buf >> (32 - n);
  58. s->bit_buf <<= n;
  59. s->bit_cnt -= n;
  60. #ifdef STATS
  61. st_bit_counts[st_current_index] += n;
  62. #endif
  63. return val;
  64. }
  65. return get_bits_long(s,n);
  66. }
  67. static inline unsigned int get_bits1(GetBitContext *s){
  68. if(s->bit_cnt>0){
  69. /* most common case here */
  70. unsigned int val = s->bit_buf >> 31;
  71. s->bit_buf <<= 1;
  72. s->bit_cnt--;
  73. #ifdef STATS
  74. st_bit_counts[st_current_index]++;
  75. #endif
  76. return val;
  77. }
  78. return get_bits_long(s,1);
  79. }
  80. static inline void skip_bits(GetBitContext *s, int n){
  81. if(s->bit_cnt>=n){
  82. /* most common case here */
  83. s->bit_buf <<= n;
  84. s->bit_cnt -= n;
  85. #ifdef STATS
  86. st_bit_counts[st_current_index] += n;
  87. #endif
  88. } else {
  89. get_bits_long(s,n);
  90. }
  91. }
  92. static inline void skip_bits1(GetBitContext *s){
  93. if(s->bit_cnt>0){
  94. /* most common case here */
  95. s->bit_buf <<= 1;
  96. s->bit_cnt--;
  97. #ifdef STATS
  98. st_bit_counts[st_current_index]++;
  99. #endif
  100. } else {
  101. get_bits_long(s,1);
  102. }
  103. }
  104. void align_get_bits(GetBitContext *s);
  105. int init_vlc(VLC *vlc, int nb_bits, int nb_codes,
  106. const void *bits, int bits_wrap, int bits_size,
  107. const void *codes, int codes_wrap, int codes_size);
  108. void free_vlc(VLC *vlc);
  109. int get_vlc(GetBitContext *s, VLC *vlc);
  110. /* macro to go faster */
  111. /* n must be <= 24 */
  112. /* XXX: optimize buffer end test */
  113. #define SHOW_BITS(s, val, n)\
  114. {\
  115. if (bit_cnt < n && buf_ptr < (s)->buf_end) {\
  116. bit_buf |= *buf_ptr++ << (24 - bit_cnt);\
  117. bit_cnt += 8;\
  118. if (bit_cnt < n && buf_ptr < (s)->buf_end) {\
  119. bit_buf |= *buf_ptr++ << (24 - bit_cnt);\
  120. bit_cnt += 8;\
  121. if (bit_cnt < n && buf_ptr < (s)->buf_end) {\
  122. bit_buf |= *buf_ptr++ << (24 - bit_cnt);\
  123. bit_cnt += 8;\
  124. }\
  125. }\
  126. }\
  127. val = bit_buf >> (32 - n);\
  128. }
  129. /* SHOW_BITS with n1 >= n must be been done before */
  130. #define FLUSH_BITS(n)\
  131. {\
  132. bit_buf <<= n;\
  133. bit_cnt -= n;\
  134. }
  135. #define SAVE_BITS(s) \
  136. {\
  137. bit_cnt = (s)->bit_cnt;\
  138. bit_buf = (s)->bit_buf;\
  139. buf_ptr = (s)->buf_ptr;\
  140. }
  141. #define RESTORE_BITS(s) \
  142. {\
  143. (s)->buf_ptr = buf_ptr;\
  144. (s)->bit_buf = bit_buf;\
  145. (s)->bit_cnt = bit_cnt;\
  146. }
  147. /* define it to include statistics code (useful only for optimizing
  148. codec efficiency */
  149. //#define STATS
  150. #ifdef STATS
  151. enum {
  152. ST_UNKNOWN,
  153. ST_DC,
  154. ST_INTRA_AC,
  155. ST_INTER_AC,
  156. ST_INTRA_MB,
  157. ST_INTER_MB,
  158. ST_MV,
  159. ST_NB,
  160. };
  161. extern int st_current_index;
  162. extern unsigned int st_bit_counts[ST_NB];
  163. extern unsigned int st_out_bit_counts[ST_NB];
  164. void print_stats(void);
  165. #endif
  166. /* misc math functions */
  167. extern inline int log2(unsigned int v)
  168. {
  169. int n;
  170. n = 0;
  171. if (v & 0xffff0000) {
  172. v >>= 16;
  173. n += 16;
  174. }
  175. if (v & 0xff00) {
  176. v >>= 8;
  177. n += 8;
  178. }
  179. if (v & 0xf0) {
  180. v >>= 4;
  181. n += 4;
  182. }
  183. if (v & 0xc) {
  184. v >>= 2;
  185. n += 2;
  186. }
  187. if (v & 0x2) {
  188. n++;
  189. }
  190. return n;
  191. }
  192. /* memory */
  193. void *av_mallocz(int size);
  194. #endif