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.

813 lines
18KB

  1. #ifndef COMMON_H
  2. #define COMMON_H
  3. #define FFMPEG_VERSION_INT 0x000406
  4. #define FFMPEG_VERSION "0.4.6"
  5. #if defined(WIN32) && !defined(__MINGW32__) && !defined(__CYGWIN__)
  6. #define CONFIG_WIN32
  7. #endif
  8. //#define ALT_BITSTREAM_WRITER
  9. //#define ALIGNED_BITSTREAM_WRITER
  10. //#define ALT_BITSTREAM_READER
  11. //#define ALIGNED_BITSTREAM
  12. #define FAST_GET_FIRST_VLC
  13. #ifdef HAVE_AV_CONFIG_H
  14. /* only include the following when compiling package */
  15. #include "../config.h"
  16. #include <stdlib.h>
  17. #include <stdio.h>
  18. #include <string.h>
  19. #include <errno.h>
  20. #ifndef ENODATA
  21. #define ENODATA 61
  22. #endif
  23. #endif
  24. #ifdef CONFIG_WIN32
  25. /* windows */
  26. typedef unsigned short UINT16;
  27. typedef signed short INT16;
  28. typedef unsigned char UINT8;
  29. typedef unsigned int UINT32;
  30. typedef unsigned __int64 UINT64;
  31. typedef signed char INT8;
  32. typedef signed int INT32;
  33. typedef signed __int64 INT64;
  34. typedef UINT8 uint8_t;
  35. typedef INT8 int8_t;
  36. typedef UINT16 uint16_t;
  37. typedef INT16 int16_t;
  38. typedef UINT32 uint32_t;
  39. typedef INT32 int32_t;
  40. #ifndef __MINGW32__
  41. #define INT64_C(c) (c ## i64)
  42. #define UINT64_C(c) (c ## i64)
  43. #define inline __inline
  44. /*
  45. Disable warning messages:
  46. warning C4244: '=' : conversion from 'double' to 'float', possible loss of data
  47. warning C4305: 'argument' : truncation from 'const double' to 'float'
  48. */
  49. #pragma warning( disable : 4244 )
  50. #pragma warning( disable : 4305 )
  51. #else
  52. #define INT64_C(c) (c ## LL)
  53. #define UINT64_C(c) (c ## ULL)
  54. #endif /* __MINGW32__ */
  55. #define M_PI 3.14159265358979323846
  56. #define M_SQRT2 1.41421356237309504880 /* sqrt(2) */
  57. #ifdef _DEBUG
  58. #define DEBUG
  59. #endif
  60. // code from bits/byteswap.h (C) 1997, 1998 Free Software Foundation, Inc.
  61. #define bswap_32(x) \
  62. ((((x) & 0xff000000) >> 24) | (((x) & 0x00ff0000) >> 8) | \
  63. (((x) & 0x0000ff00) << 8) | (((x) & 0x000000ff) << 24))
  64. #define be2me_32(x) bswap_32(x)
  65. #define snprintf _snprintf
  66. #ifndef __MINGW32__
  67. /* no config.h with VC */
  68. #define CONFIG_ENCODERS 1
  69. #define CONFIG_DECODERS 1
  70. #define CONFIG_AC3 1
  71. #endif
  72. #else
  73. /* unix */
  74. #include <inttypes.h>
  75. #ifndef __WINE_WINDEF16_H
  76. /* workaround for typedef conflict in MPlayer (wine typedefs) */
  77. typedef unsigned short UINT16;
  78. typedef signed short INT16;
  79. #endif
  80. typedef unsigned char UINT8;
  81. typedef unsigned int UINT32;
  82. typedef unsigned long long UINT64;
  83. typedef signed char INT8;
  84. typedef signed int INT32;
  85. typedef signed long long INT64;
  86. #ifdef HAVE_AV_CONFIG_H
  87. #ifdef __FreeBSD__
  88. #include <sys/param.h>
  89. #endif
  90. #ifndef INT64_C
  91. #define INT64_C(c) (c ## LL)
  92. #define UINT64_C(c) (c ## ULL)
  93. #endif
  94. #include "../bswap.h"
  95. #ifdef USE_FASTMEMCPY
  96. #include "fastmemcpy.h"
  97. #endif
  98. #endif /* HAVE_AV_CONFIG_H */
  99. #endif /* !CONFIG_WIN32 */
  100. /* debug stuff */
  101. #ifdef HAVE_AV_CONFIG_H
  102. #ifndef DEBUG
  103. #define NDEBUG
  104. #endif
  105. #include <assert.h>
  106. /* dprintf macros */
  107. #if defined(CONFIG_WIN32) && !defined(__MINGW32__)
  108. inline void dprintf(const char* fmt,...) {}
  109. #else
  110. #ifdef DEBUG
  111. #define dprintf(fmt,args...) printf(fmt, ## args)
  112. #else
  113. #define dprintf(fmt,args...)
  114. #endif
  115. #endif /* !CONFIG_WIN32 */
  116. #endif /* HAVE_AV_CONFIG_H */
  117. /* bit output */
  118. struct PutBitContext;
  119. typedef void (*WriteDataFunc)(void *, UINT8 *, int);
  120. typedef struct PutBitContext {
  121. #ifdef ALT_BITSTREAM_WRITER
  122. UINT8 *buf, *buf_end;
  123. int index;
  124. #else
  125. UINT32 bit_buf;
  126. int bit_left;
  127. UINT8 *buf, *buf_ptr, *buf_end;
  128. #endif
  129. INT64 data_out_size; /* in bytes */
  130. } PutBitContext;
  131. void init_put_bits(PutBitContext *s,
  132. UINT8 *buffer, int buffer_size,
  133. void *opaque,
  134. void (*write_data)(void *, UINT8 *, int));
  135. INT64 get_bit_count(PutBitContext *s); /* XXX: change function name */
  136. void align_put_bits(PutBitContext *s);
  137. void flush_put_bits(PutBitContext *s);
  138. /* jpeg specific put_bits */
  139. void jflush_put_bits(PutBitContext *s);
  140. /* bit input */
  141. typedef struct GetBitContext {
  142. #ifdef ALT_BITSTREAM_READER
  143. int index;
  144. UINT8 *buffer;
  145. #else
  146. UINT32 bit_buf;
  147. int bit_cnt;
  148. UINT8 *buf, *buf_ptr, *buf_end;
  149. #endif
  150. int size;
  151. } GetBitContext;
  152. typedef struct VLC {
  153. int bits;
  154. INT16 *table_codes;
  155. INT8 *table_bits;
  156. int table_size, table_allocated;
  157. } VLC;
  158. /* used to avoid missaligned exceptions on some archs (alpha, ...) */
  159. #ifdef ARCH_X86
  160. #define unaligned32(a) (*(UINT32*)(a))
  161. #else
  162. #ifdef __GNUC__
  163. static inline uint32_t unaligned32(const void *v) {
  164. struct Unaligned {
  165. uint32_t i;
  166. } __attribute__((packed));
  167. return ((const struct Unaligned *) v)->i;
  168. }
  169. #elif defined(__DECC)
  170. static inline uint32_t unaligned32(const void *v) {
  171. return *(const __unaligned uint32_t *) v;
  172. }
  173. #else
  174. static inline uint32_t unaligned32(const void *v) {
  175. return *(const uint32_t *) v;
  176. }
  177. #endif
  178. #endif //!ARCH_X86
  179. #ifndef ALT_BITSTREAM_WRITER
  180. static inline void put_bits(PutBitContext *s, int n, unsigned int value)
  181. {
  182. unsigned int bit_buf;
  183. int bit_left;
  184. #ifdef STATS
  185. st_out_bit_counts[st_current_index] += n;
  186. #endif
  187. // printf("put_bits=%d %x\n", n, value);
  188. assert(n == 32 || value < (1U << n));
  189. bit_buf = s->bit_buf;
  190. bit_left = s->bit_left;
  191. // printf("n=%d value=%x cnt=%d buf=%x\n", n, value, bit_cnt, bit_buf);
  192. /* XXX: optimize */
  193. if (n < bit_left) {
  194. bit_buf = (bit_buf<<n) | value;
  195. bit_left-=n;
  196. } else {
  197. bit_buf<<=bit_left;
  198. bit_buf |= value >> (n - bit_left);
  199. *(UINT32 *)s->buf_ptr = be2me_32(bit_buf);
  200. //printf("bitbuf = %08x\n", bit_buf);
  201. s->buf_ptr+=4;
  202. bit_left+=32 - n;
  203. bit_buf = value;
  204. }
  205. s->bit_buf = bit_buf;
  206. s->bit_left = bit_left;
  207. }
  208. #endif
  209. #ifdef ALT_BITSTREAM_WRITER
  210. static inline void put_bits(PutBitContext *s, int n, unsigned int value)
  211. {
  212. #ifdef ALIGNED_BITSTREAM_WRITER
  213. #ifdef ARCH_X86
  214. asm volatile(
  215. "movl %0, %%ecx \n\t"
  216. "xorl %%eax, %%eax \n\t"
  217. "shrdl %%cl, %1, %%eax \n\t"
  218. "shrl %%cl, %1 \n\t"
  219. "movl %0, %%ecx \n\t"
  220. "shrl $3, %%ecx \n\t"
  221. "andl $0xFFFFFFFC, %%ecx \n\t"
  222. "bswapl %1 \n\t"
  223. "orl %1, (%2, %%ecx) \n\t"
  224. "bswapl %%eax \n\t"
  225. "addl %3, %0 \n\t"
  226. "movl %%eax, 4(%2, %%ecx) \n\t"
  227. : "=&r" (s->index), "=&r" (value)
  228. : "r" (s->buf), "r" (n), "0" (s->index), "1" (value<<(-n))
  229. : "%eax", "%ecx"
  230. );
  231. #else
  232. int index= s->index;
  233. uint32_t *ptr= ((uint32_t *)s->buf)+(index>>5);
  234. value<<= 32-n;
  235. ptr[0] |= be2me_32(value>>(index&31));
  236. ptr[1] = be2me_32(value<<(32-(index&31)));
  237. //if(n>24) printf("%d %d\n", n, value);
  238. index+= n;
  239. s->index= index;
  240. #endif
  241. #else //ALIGNED_BITSTREAM_WRITER
  242. #ifdef ARCH_X86
  243. asm volatile(
  244. "movl $7, %%ecx \n\t"
  245. "andl %0, %%ecx \n\t"
  246. "addl %3, %%ecx \n\t"
  247. "negl %%ecx \n\t"
  248. "shll %%cl, %1 \n\t"
  249. "bswapl %1 \n\t"
  250. "movl %0, %%ecx \n\t"
  251. "shrl $3, %%ecx \n\t"
  252. "orl %1, (%%ecx, %2) \n\t"
  253. "addl %3, %0 \n\t"
  254. "movl $0, 4(%%ecx, %2) \n\t"
  255. : "=&r" (s->index), "=&r" (value)
  256. : "r" (s->buf), "r" (n), "0" (s->index), "1" (value)
  257. : "%ecx"
  258. );
  259. #else
  260. int index= s->index;
  261. uint32_t *ptr= (uint32_t*)(((uint8_t *)s->buf)+(index>>3));
  262. ptr[0] |= be2me_32(value<<(32-n-(index&7) ));
  263. ptr[1] = 0;
  264. //if(n>24) printf("%d %d\n", n, value);
  265. index+= n;
  266. s->index= index;
  267. #endif
  268. #endif //!ALIGNED_BITSTREAM_WRITER
  269. }
  270. #endif
  271. #ifndef ALT_BITSTREAM_WRITER
  272. /* for jpeg : escape 0xff with 0x00 after it */
  273. static inline void jput_bits(PutBitContext *s, int n, unsigned int value)
  274. {
  275. unsigned int bit_buf, b;
  276. int bit_left, i;
  277. assert(n == 32 || value < (1U << n));
  278. bit_buf = s->bit_buf;
  279. bit_left = s->bit_left;
  280. //printf("n=%d value=%x cnt=%d buf=%x\n", n, value, bit_cnt, bit_buf);
  281. /* XXX: optimize */
  282. if (n < bit_left) {
  283. bit_buf = (bit_buf<<n) | value;
  284. bit_left-=n;
  285. } else {
  286. bit_buf<<=bit_left;
  287. bit_buf |= value >> (n - bit_left);
  288. /* handle escape */
  289. for(i=0;i<4;i++) {
  290. b = (bit_buf >> 24);
  291. *(s->buf_ptr++) = b;
  292. if (b == 0xff)
  293. *(s->buf_ptr++) = 0;
  294. bit_buf <<= 8;
  295. }
  296. bit_left+= 32 - n;
  297. bit_buf = value;
  298. }
  299. s->bit_buf = bit_buf;
  300. s->bit_left = bit_left;
  301. }
  302. #endif
  303. #ifdef ALT_BITSTREAM_WRITER
  304. static inline void jput_bits(PutBitContext *s, int n, int value)
  305. {
  306. int index= s->index;
  307. uint32_t *ptr= (uint32_t*)(((uint8_t *)s->buf)+(index>>3));
  308. int v= ptr[0];
  309. //if(n>24) printf("%d %d\n", n, value);
  310. v |= be2me_32(value<<(32-n-(index&7) ));
  311. if(((v+0x01010101)^0xFFFFFFFF)&v&0x80808080)
  312. {
  313. /* handle idiotic (m)jpeg escapes */
  314. uint8_t *bPtr= (uint8_t*)ptr;
  315. int numChecked= ((index+n)>>3) - (index>>3);
  316. v= be2me_32(v);
  317. *(bPtr++)= v>>24;
  318. if((v&0xFF000000)==0xFF000000 && numChecked>0){
  319. *(bPtr++)= 0x00;
  320. index+=8;
  321. }
  322. *(bPtr++)= (v>>16)&0xFF;
  323. if((v&0x00FF0000)==0x00FF0000 && numChecked>1){
  324. *(bPtr++)= 0x00;
  325. index+=8;
  326. }
  327. *(bPtr++)= (v>>8)&0xFF;
  328. if((v&0x0000FF00)==0x0000FF00 && numChecked>2){
  329. *(bPtr++)= 0x00;
  330. index+=8;
  331. }
  332. *(bPtr++)= v&0xFF;
  333. if((v&0x000000FF)==0x000000FF && numChecked>3){
  334. *(bPtr++)= 0x00;
  335. index+=8;
  336. }
  337. *((uint32_t*)bPtr)= 0;
  338. }
  339. else
  340. {
  341. ptr[0] = v;
  342. ptr[1] = 0;
  343. }
  344. index+= n;
  345. s->index= index;
  346. }
  347. #endif
  348. static inline uint8_t* pbBufPtr(PutBitContext *s)
  349. {
  350. #ifdef ALT_BITSTREAM_WRITER
  351. return s->buf + (s->index>>3);
  352. #else
  353. return s->buf_ptr;
  354. #endif
  355. }
  356. void init_get_bits(GetBitContext *s,
  357. UINT8 *buffer, int buffer_size);
  358. #ifndef ALT_BITSTREAM_READER
  359. unsigned int get_bits_long(GetBitContext *s, int n);
  360. unsigned int show_bits_long(GetBitContext *s, int n);
  361. #endif
  362. static inline unsigned int get_bits(GetBitContext *s, int n){
  363. #ifdef ALT_BITSTREAM_READER
  364. #ifdef ALIGNED_BITSTREAM
  365. int index= s->index;
  366. uint32_t result1= be2me_32( ((uint32_t *)s->buffer)[index>>5] );
  367. uint32_t result2= be2me_32( ((uint32_t *)s->buffer)[(index>>5) + 1] );
  368. #ifdef ARCH_X86
  369. asm ("shldl %%cl, %2, %0\n\t"
  370. : "=r" (result1)
  371. : "0" (result1), "r" (result2), "c" (index));
  372. #else
  373. result1<<= (index&0x1F);
  374. result2= (result2>>1) >> (31-(index&0x1F));
  375. result1|= result2;
  376. #endif
  377. result1>>= 32 - n;
  378. index+= n;
  379. s->index= index;
  380. return result1;
  381. #else //ALIGNED_BITSTREAM
  382. int index= s->index;
  383. uint32_t result= be2me_32( unaligned32( ((uint8_t *)s->buffer)+(index>>3) ) );
  384. result<<= (index&0x07);
  385. result>>= 32 - n;
  386. index+= n;
  387. s->index= index;
  388. return result;
  389. #endif //!ALIGNED_BITSTREAM
  390. #else //ALT_BITSTREAM_READER
  391. if(s->bit_cnt>=n){
  392. /* most common case here */
  393. unsigned int val = s->bit_buf >> (32 - n);
  394. s->bit_buf <<= n;
  395. s->bit_cnt -= n;
  396. #ifdef STATS
  397. st_bit_counts[st_current_index] += n;
  398. #endif
  399. return val;
  400. }
  401. return get_bits_long(s,n);
  402. #endif //!ALT_BITSTREAM_READER
  403. }
  404. static inline unsigned int get_bits1(GetBitContext *s){
  405. #ifdef ALT_BITSTREAM_READER
  406. int index= s->index;
  407. uint8_t result= s->buffer[ index>>3 ];
  408. result<<= (index&0x07);
  409. result>>= 8 - 1;
  410. index++;
  411. s->index= index;
  412. return result;
  413. #else
  414. if(s->bit_cnt>0){
  415. /* most common case here */
  416. unsigned int val = s->bit_buf >> 31;
  417. s->bit_buf <<= 1;
  418. s->bit_cnt--;
  419. #ifdef STATS
  420. st_bit_counts[st_current_index]++;
  421. #endif
  422. return val;
  423. }
  424. return get_bits_long(s,1);
  425. #endif
  426. }
  427. /* This function is identical to get_bits(), the only */
  428. /* diference is that it doesn't touch the buffer */
  429. /* it is usefull to see the buffer. */
  430. static inline unsigned int show_bits(GetBitContext *s, int n)
  431. {
  432. #ifdef ALT_BITSTREAM_READER
  433. #ifdef ALIGNED_BITSTREAM
  434. int index= s->index;
  435. uint32_t result1= be2me_32( ((uint32_t *)s->buffer)[index>>5] );
  436. uint32_t result2= be2me_32( ((uint32_t *)s->buffer)[(index>>5) + 1] );
  437. #ifdef ARCH_X86
  438. asm ("shldl %%cl, %2, %0\n\t"
  439. : "=r" (result1)
  440. : "0" (result1), "r" (result2), "c" (index));
  441. #else
  442. result1<<= (index&0x1F);
  443. result2= (result2>>1) >> (31-(index&0x1F));
  444. result1|= result2;
  445. #endif
  446. result1>>= 32 - n;
  447. return result1;
  448. #else //ALIGNED_BITSTREAM
  449. int index= s->index;
  450. uint32_t result= be2me_32( unaligned32( ((uint8_t *)s->buffer)+(index>>3) ) );
  451. result<<= (index&0x07);
  452. result>>= 32 - n;
  453. return result;
  454. #endif //!ALIGNED_BITSTREAM
  455. #else //ALT_BITSTREAM_READER
  456. if(s->bit_cnt>=n) {
  457. /* most common case here */
  458. unsigned int val = s->bit_buf >> (32 - n);
  459. return val;
  460. }
  461. return show_bits_long(s,n);
  462. #endif //!ALT_BITSTREAM_READER
  463. }
  464. static inline void skip_bits(GetBitContext *s, int n){
  465. #ifdef ALT_BITSTREAM_READER
  466. s->index+= n;
  467. #else
  468. if(s->bit_cnt>=n){
  469. /* most common case here */
  470. s->bit_buf <<= n;
  471. s->bit_cnt -= n;
  472. #ifdef STATS
  473. st_bit_counts[st_current_index] += n;
  474. #endif
  475. } else {
  476. get_bits_long(s,n);
  477. }
  478. #endif
  479. }
  480. static inline void skip_bits1(GetBitContext *s){
  481. #ifdef ALT_BITSTREAM_READER
  482. s->index++;
  483. #else
  484. if(s->bit_cnt>0){
  485. /* most common case here */
  486. s->bit_buf <<= 1;
  487. s->bit_cnt--;
  488. #ifdef STATS
  489. st_bit_counts[st_current_index]++;
  490. #endif
  491. } else {
  492. get_bits_long(s,1);
  493. }
  494. #endif
  495. }
  496. static inline int get_bits_count(GetBitContext *s)
  497. {
  498. #ifdef ALT_BITSTREAM_READER
  499. return s->index;
  500. #else
  501. return (s->buf_ptr - s->buf) * 8 - s->bit_cnt;
  502. #endif
  503. }
  504. int check_marker(GetBitContext *s, char *msg);
  505. void align_get_bits(GetBitContext *s);
  506. int init_vlc(VLC *vlc, int nb_bits, int nb_codes,
  507. const void *bits, int bits_wrap, int bits_size,
  508. const void *codes, int codes_wrap, int codes_size);
  509. void free_vlc(VLC *vlc);
  510. #ifdef ALT_BITSTREAM_READER
  511. #ifdef ALIGNED_BITSTREAM
  512. #ifdef ARCH_X86
  513. #define SHOW_BITS(s, val, n) \
  514. val= be2me_32( ((uint32_t *)(s)->buffer)[bit_cnt>>5] );\
  515. {uint32_t result2= be2me_32( ((uint32_t *)(s)->buffer)[(bit_cnt>>5) + 1] );\
  516. asm ("shldl %%cl, %2, %0\n\t"\
  517. : "=r" (val)\
  518. : "0" (val), "r" (result2), "c" (bit_cnt));\
  519. ((uint32_t)val)>>= 32 - n;}
  520. #else //ARCH_X86
  521. #define SHOW_BITS(s, val, n) \
  522. val= be2me_32( ((uint32_t *)(s)->buffer)[bit_cnt>>5] );\
  523. {uint32_t result2= be2me_32( ((uint32_t *)(s)->buffer)[(bit_cnt>>5) + 1] );\
  524. val<<= (bit_cnt&0x1F);\
  525. result2= (result2>>1) >> (31-(bit_cnt&0x1F));\
  526. val|= result2;\
  527. ((uint32_t)val)>>= 32 - n;}
  528. #endif //!ARCH_X86
  529. #else //ALIGNED_BITSTREAM
  530. #define SHOW_BITS(s, val, n) \
  531. val= be2me_32( unaligned32( ((uint8_t *)(s)->buffer)+(bit_cnt>>3) ) );\
  532. val<<= (bit_cnt&0x07);\
  533. ((uint32_t)val)>>= 32 - n;
  534. #endif // !ALIGNED_BITSTREAM
  535. #define FLUSH_BITS(n) bit_cnt+=n;
  536. #define SAVE_BITS(s) bit_cnt= (s)->index;
  537. #define RESTORE_BITS(s) (s)->index= bit_cnt;
  538. #else
  539. /* macro to go faster */
  540. /* n must be <= 24 */
  541. /* XXX: optimize buffer end test */
  542. #define SHOW_BITS(s, val, n)\
  543. {\
  544. if (bit_cnt < n && buf_ptr < (s)->buf_end) {\
  545. bit_buf |= *buf_ptr++ << (24 - bit_cnt);\
  546. bit_cnt += 8;\
  547. if (bit_cnt < n && buf_ptr < (s)->buf_end) {\
  548. bit_buf |= *buf_ptr++ << (24 - bit_cnt);\
  549. bit_cnt += 8;\
  550. if (bit_cnt < n && buf_ptr < (s)->buf_end) {\
  551. bit_buf |= *buf_ptr++ << (24 - bit_cnt);\
  552. bit_cnt += 8;\
  553. }\
  554. }\
  555. }\
  556. val = bit_buf >> (32 - n);\
  557. }
  558. /* SHOW_BITS with n1 >= n must be been done before */
  559. #define FLUSH_BITS(n)\
  560. {\
  561. bit_buf <<= n;\
  562. bit_cnt -= n;\
  563. }
  564. #define SAVE_BITS(s) \
  565. {\
  566. bit_cnt = (s)->bit_cnt;\
  567. bit_buf = (s)->bit_buf;\
  568. buf_ptr = (s)->buf_ptr;\
  569. }
  570. #define RESTORE_BITS(s) \
  571. {\
  572. (s)->buf_ptr = buf_ptr;\
  573. (s)->bit_buf = bit_buf;\
  574. (s)->bit_cnt = bit_cnt;\
  575. }
  576. #endif // !ALT_BITSTREAM_READER
  577. static inline int get_vlc(GetBitContext *s, VLC *vlc)
  578. {
  579. int code, n, nb_bits, index;
  580. INT16 *table_codes;
  581. INT8 *table_bits;
  582. int bit_cnt;
  583. #ifndef ALT_BITSTREAM_READER
  584. UINT32 bit_buf;
  585. UINT8 *buf_ptr;
  586. #endif
  587. SAVE_BITS(s);
  588. nb_bits = vlc->bits;
  589. table_codes = vlc->table_codes;
  590. table_bits = vlc->table_bits;
  591. #ifdef FAST_GET_FIRST_VLC
  592. SHOW_BITS(s, index, nb_bits);
  593. code = table_codes[index];
  594. n = table_bits[index];
  595. if (n > 0) {
  596. /* most common case (90%)*/
  597. FLUSH_BITS(n);
  598. RESTORE_BITS(s);
  599. return code;
  600. } else if (n == 0) {
  601. return -1;
  602. } else {
  603. FLUSH_BITS(nb_bits);
  604. nb_bits = -n;
  605. table_codes = vlc->table_codes + code;
  606. table_bits = vlc->table_bits + code;
  607. }
  608. #endif
  609. for(;;) {
  610. SHOW_BITS(s, index, nb_bits);
  611. code = table_codes[index];
  612. n = table_bits[index];
  613. if (n > 0) {
  614. /* most common case */
  615. FLUSH_BITS(n);
  616. #ifdef STATS
  617. st_bit_counts[st_current_index] += n;
  618. #endif
  619. break;
  620. } else if (n == 0) {
  621. return -1;
  622. } else {
  623. FLUSH_BITS(nb_bits);
  624. #ifdef STATS
  625. st_bit_counts[st_current_index] += nb_bits;
  626. #endif
  627. nb_bits = -n;
  628. table_codes = vlc->table_codes + code;
  629. table_bits = vlc->table_bits + code;
  630. }
  631. }
  632. RESTORE_BITS(s);
  633. return code;
  634. }
  635. /* define it to include statistics code (useful only for optimizing
  636. codec efficiency */
  637. //#define STATS
  638. #ifdef STATS
  639. enum {
  640. ST_UNKNOWN,
  641. ST_DC,
  642. ST_INTRA_AC,
  643. ST_INTER_AC,
  644. ST_INTRA_MB,
  645. ST_INTER_MB,
  646. ST_MV,
  647. ST_NB,
  648. };
  649. extern int st_current_index;
  650. extern unsigned int st_bit_counts[ST_NB];
  651. extern unsigned int st_out_bit_counts[ST_NB];
  652. void print_stats(void);
  653. #endif
  654. /* misc math functions */
  655. static inline int av_log2(unsigned int v)
  656. {
  657. int n;
  658. n = 0;
  659. if (v & 0xffff0000) {
  660. v >>= 16;
  661. n += 16;
  662. }
  663. if (v & 0xff00) {
  664. v >>= 8;
  665. n += 8;
  666. }
  667. if (v & 0xf0) {
  668. v >>= 4;
  669. n += 4;
  670. }
  671. if (v & 0xc) {
  672. v >>= 2;
  673. n += 2;
  674. }
  675. if (v & 0x2) {
  676. n++;
  677. }
  678. return n;
  679. }
  680. /* median of 3 */
  681. static inline int mid_pred(int a, int b, int c)
  682. {
  683. int vmin, vmax;
  684. vmax = vmin = a;
  685. if (b < vmin)
  686. vmin = b;
  687. else
  688. vmax = b;
  689. if (c < vmin)
  690. vmin = c;
  691. else if (c > vmax)
  692. vmax = c;
  693. return a + b + c - vmin - vmax;
  694. }
  695. /* memory */
  696. void *av_mallocz(int size);
  697. #endif