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.

920 lines
21KB

  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 LIBMPEG2_BITSTREAM_READER
  12. //#define A32_BITSTREAM_READER
  13. #ifdef ARCH_ALPHA
  14. #define ALT_BITSTREAM_READER
  15. #endif
  16. //#define ALIGNED_BITSTREAM
  17. #define FAST_GET_FIRST_VLC
  18. //#define DUMP_STREAM
  19. #ifdef HAVE_AV_CONFIG_H
  20. /* only include the following when compiling package */
  21. #include "config.h"
  22. #include <stdlib.h>
  23. #include <stdio.h>
  24. #include <string.h>
  25. #include <errno.h>
  26. #include <math.h>
  27. #ifndef ENODATA
  28. #define ENODATA 61
  29. #endif
  30. #endif /* HAVE_AV_CONFIG_H */
  31. /* Suppress restrict if it was not defined in config.h. */
  32. #ifndef restrict
  33. #define restrict
  34. #endif
  35. #ifdef CONFIG_WIN32
  36. /* windows */
  37. typedef unsigned short UINT16;
  38. typedef signed short INT16;
  39. typedef unsigned char UINT8;
  40. typedef unsigned int UINT32;
  41. typedef unsigned __int64 UINT64;
  42. typedef signed char INT8;
  43. typedef signed int INT32;
  44. typedef signed __int64 INT64;
  45. typedef UINT8 uint8_t;
  46. typedef INT8 int8_t;
  47. typedef UINT16 uint16_t;
  48. typedef INT16 int16_t;
  49. typedef UINT32 uint32_t;
  50. typedef INT32 int32_t;
  51. typedef UINT64 uint64_t;
  52. typedef INT64 int64_t;
  53. #ifndef __MINGW32__
  54. #define INT64_C(c) (c ## i64)
  55. #define UINT64_C(c) (c ## i64)
  56. #define inline __inline
  57. #else
  58. #define INT64_C(c) (c ## LL)
  59. #define UINT64_C(c) (c ## ULL)
  60. #endif /* __MINGW32__ */
  61. #define M_PI 3.14159265358979323846
  62. #define M_SQRT2 1.41421356237309504880 /* sqrt(2) */
  63. #ifdef _DEBUG
  64. #define DEBUG
  65. #endif
  66. #define snprintf _snprintf
  67. #else /* CONFIG_WIN32 */
  68. /* unix */
  69. #include <inttypes.h>
  70. #ifndef __WINE_WINDEF16_H
  71. /* workaround for typedef conflict in MPlayer (wine typedefs) */
  72. typedef unsigned short UINT16;
  73. typedef signed short INT16;
  74. #endif
  75. typedef unsigned char UINT8;
  76. typedef unsigned int UINT32;
  77. typedef unsigned long long UINT64;
  78. typedef signed char INT8;
  79. typedef signed int INT32;
  80. typedef signed long long INT64;
  81. #ifdef HAVE_AV_CONFIG_H
  82. #ifdef __FreeBSD__
  83. #include <sys/param.h>
  84. #endif
  85. #ifndef INT64_C
  86. #define INT64_C(c) (c ## LL)
  87. #define UINT64_C(c) (c ## ULL)
  88. #endif
  89. #ifdef USE_FASTMEMCPY
  90. #include "fastmemcpy.h"
  91. #endif
  92. #endif /* HAVE_AV_CONFIG_H */
  93. #endif /* !CONFIG_WIN32 */
  94. #ifdef HAVE_AV_CONFIG_H
  95. #include "bswap.h"
  96. #if defined(__MINGW32__) || defined(__CYGWIN__) || \
  97. defined(__OS2__) || defined (__OpenBSD__)
  98. #define MANGLE(a) "_" #a
  99. #else
  100. #define MANGLE(a) #a
  101. #endif
  102. /* debug stuff */
  103. #ifndef DEBUG
  104. #define NDEBUG
  105. #endif
  106. #include <assert.h>
  107. /* dprintf macros */
  108. #if defined(CONFIG_WIN32) && !defined(__MINGW32__)
  109. inline void dprintf(const char* fmt,...) {}
  110. #else
  111. #ifdef DEBUG
  112. #define dprintf(fmt,args...) printf(fmt, ## args)
  113. #else
  114. #define dprintf(fmt,args...)
  115. #endif
  116. #endif /* !CONFIG_WIN32 */
  117. #define av_abort() do { fprintf(stderr, "Abort at %s:%d\n", __FILE__, __LINE__); abort(); } while (0)
  118. /* assume b>0 */
  119. #define ROUNDED_DIV(a,b) (((a)>0 ? (a) + ((b)>>1) : (a) - ((b)>>1))/(b))
  120. #define ABS(a) ((a) >= 0 ? (a) : (-(a)))
  121. #define MAX(a,b) ((a) > (b) ? (a) : (b))
  122. #define MIN(a,b) ((a) > (b) ? (b) : (a))
  123. #ifdef ARCH_X86
  124. // avoid +32 for shift optimization (gcc should do that ...)
  125. static inline int32_t NEG_SSR32( int32_t a, int8_t s){
  126. asm ("sarl %1, %0\n\t"
  127. : "+r" (a)
  128. : "ic" ((uint8_t)(-s))
  129. );
  130. return a;
  131. }
  132. static inline uint32_t NEG_USR32(uint32_t a, int8_t s){
  133. asm ("shrl %1, %0\n\t"
  134. : "+r" (a)
  135. : "ic" ((uint8_t)(-s))
  136. );
  137. return a;
  138. }
  139. #else
  140. #define NEG_SSR32(a,s) ((( int32_t)(a))>>(32-(s)))
  141. #define NEG_USR32(a,s) (((uint32_t)(a))>>(32-(s)))
  142. #endif
  143. /* bit output */
  144. struct PutBitContext;
  145. typedef void (*WriteDataFunc)(void *, UINT8 *, int);
  146. typedef struct PutBitContext {
  147. #ifdef ALT_BITSTREAM_WRITER
  148. UINT8 *buf, *buf_end;
  149. int index;
  150. #else
  151. UINT32 bit_buf;
  152. int bit_left;
  153. UINT8 *buf, *buf_ptr, *buf_end;
  154. #endif
  155. INT64 data_out_size; /* in bytes */
  156. } PutBitContext;
  157. void init_put_bits(PutBitContext *s,
  158. UINT8 *buffer, int buffer_size,
  159. void *opaque,
  160. void (*write_data)(void *, UINT8 *, int));
  161. INT64 get_bit_count(PutBitContext *s); /* XXX: change function name */
  162. void align_put_bits(PutBitContext *s);
  163. void flush_put_bits(PutBitContext *s);
  164. void put_string(PutBitContext * pbc, char *s);
  165. /* jpeg specific put_bits */
  166. void jflush_put_bits(PutBitContext *s);
  167. /* bit input */
  168. typedef struct GetBitContext {
  169. UINT8 *buffer, *buffer_end;
  170. #ifdef ALT_BITSTREAM_READER
  171. int index;
  172. #elif defined LIBMPEG2_BITSTREAM_READER
  173. UINT8 *buffer_ptr;
  174. UINT32 cache;
  175. int bit_count;
  176. #elif defined A32_BITSTREAM_READER
  177. UINT32 *buffer_ptr;
  178. UINT32 cache0;
  179. UINT32 cache1;
  180. int bit_count;
  181. #endif
  182. int size;
  183. } GetBitContext;
  184. static inline int get_bits_count(GetBitContext *s);
  185. #define VLC_TYPE INT16
  186. typedef struct VLC {
  187. int bits;
  188. VLC_TYPE (*table)[2]; // code, bits
  189. int table_size, table_allocated;
  190. } VLC;
  191. /* used to avoid missaligned exceptions on some archs (alpha, ...) */
  192. #ifdef ARCH_X86
  193. #define unaligned32(a) (*(UINT32*)(a))
  194. #else
  195. #ifdef __GNUC__
  196. static inline uint32_t unaligned32(const void *v) {
  197. struct Unaligned {
  198. uint32_t i;
  199. } __attribute__((packed));
  200. return ((const struct Unaligned *) v)->i;
  201. }
  202. #elif defined(__DECC)
  203. static inline uint32_t unaligned32(const void *v) {
  204. return *(const __unaligned uint32_t *) v;
  205. }
  206. #else
  207. static inline uint32_t unaligned32(const void *v) {
  208. return *(const uint32_t *) v;
  209. }
  210. #endif
  211. #endif //!ARCH_X86
  212. #ifndef ALT_BITSTREAM_WRITER
  213. static inline void put_bits(PutBitContext *s, int n, unsigned int value)
  214. {
  215. unsigned int bit_buf;
  216. int bit_left;
  217. #ifdef STATS
  218. st_out_bit_counts[st_current_index] += n;
  219. #endif
  220. // printf("put_bits=%d %x\n", n, value);
  221. assert(n == 32 || value < (1U << n));
  222. bit_buf = s->bit_buf;
  223. bit_left = s->bit_left;
  224. // printf("n=%d value=%x cnt=%d buf=%x\n", n, value, bit_cnt, bit_buf);
  225. /* XXX: optimize */
  226. if (n < bit_left) {
  227. bit_buf = (bit_buf<<n) | value;
  228. bit_left-=n;
  229. } else {
  230. bit_buf<<=bit_left;
  231. bit_buf |= value >> (n - bit_left);
  232. *(UINT32 *)s->buf_ptr = be2me_32(bit_buf);
  233. //printf("bitbuf = %08x\n", bit_buf);
  234. s->buf_ptr+=4;
  235. bit_left+=32 - n;
  236. bit_buf = value;
  237. }
  238. s->bit_buf = bit_buf;
  239. s->bit_left = bit_left;
  240. }
  241. #endif
  242. #ifdef ALT_BITSTREAM_WRITER
  243. static inline void put_bits(PutBitContext *s, int n, unsigned int value)
  244. {
  245. #ifdef ALIGNED_BITSTREAM_WRITER
  246. #ifdef ARCH_X86
  247. asm volatile(
  248. "movl %0, %%ecx \n\t"
  249. "xorl %%eax, %%eax \n\t"
  250. "shrdl %%cl, %1, %%eax \n\t"
  251. "shrl %%cl, %1 \n\t"
  252. "movl %0, %%ecx \n\t"
  253. "shrl $3, %%ecx \n\t"
  254. "andl $0xFFFFFFFC, %%ecx \n\t"
  255. "bswapl %1 \n\t"
  256. "orl %1, (%2, %%ecx) \n\t"
  257. "bswapl %%eax \n\t"
  258. "addl %3, %0 \n\t"
  259. "movl %%eax, 4(%2, %%ecx) \n\t"
  260. : "=&r" (s->index), "=&r" (value)
  261. : "r" (s->buf), "r" (n), "0" (s->index), "1" (value<<(-n))
  262. : "%eax", "%ecx"
  263. );
  264. #else
  265. int index= s->index;
  266. uint32_t *ptr= ((uint32_t *)s->buf)+(index>>5);
  267. value<<= 32-n;
  268. ptr[0] |= be2me_32(value>>(index&31));
  269. ptr[1] = be2me_32(value<<(32-(index&31)));
  270. //if(n>24) printf("%d %d\n", n, value);
  271. index+= n;
  272. s->index= index;
  273. #endif
  274. #else //ALIGNED_BITSTREAM_WRITER
  275. #ifdef ARCH_X86
  276. asm volatile(
  277. "movl $7, %%ecx \n\t"
  278. "andl %0, %%ecx \n\t"
  279. "addl %3, %%ecx \n\t"
  280. "negl %%ecx \n\t"
  281. "shll %%cl, %1 \n\t"
  282. "bswapl %1 \n\t"
  283. "movl %0, %%ecx \n\t"
  284. "shrl $3, %%ecx \n\t"
  285. "orl %1, (%%ecx, %2) \n\t"
  286. "addl %3, %0 \n\t"
  287. "movl $0, 4(%%ecx, %2) \n\t"
  288. : "=&r" (s->index), "=&r" (value)
  289. : "r" (s->buf), "r" (n), "0" (s->index), "1" (value)
  290. : "%ecx"
  291. );
  292. #else
  293. int index= s->index;
  294. uint32_t *ptr= (uint32_t*)(((uint8_t *)s->buf)+(index>>3));
  295. ptr[0] |= be2me_32(value<<(32-n-(index&7) ));
  296. ptr[1] = 0;
  297. //if(n>24) printf("%d %d\n", n, value);
  298. index+= n;
  299. s->index= index;
  300. #endif
  301. #endif //!ALIGNED_BITSTREAM_WRITER
  302. }
  303. #endif
  304. #ifndef ALT_BITSTREAM_WRITER
  305. /* for jpeg : escape 0xff with 0x00 after it */
  306. static inline void jput_bits(PutBitContext *s, int n, unsigned int value)
  307. {
  308. unsigned int bit_buf, b;
  309. int bit_left, i;
  310. assert(n == 32 || value < (1U << n));
  311. bit_buf = s->bit_buf;
  312. bit_left = s->bit_left;
  313. //printf("n=%d value=%x cnt=%d buf=%x\n", n, value, bit_cnt, bit_buf);
  314. /* XXX: optimize */
  315. if (n < bit_left) {
  316. bit_buf = (bit_buf<<n) | value;
  317. bit_left-=n;
  318. } else {
  319. bit_buf<<=bit_left;
  320. bit_buf |= value >> (n - bit_left);
  321. /* handle escape */
  322. for(i=0;i<4;i++) {
  323. b = (bit_buf >> 24);
  324. *(s->buf_ptr++) = b;
  325. if (b == 0xff)
  326. *(s->buf_ptr++) = 0;
  327. bit_buf <<= 8;
  328. }
  329. bit_left+= 32 - n;
  330. bit_buf = value;
  331. }
  332. s->bit_buf = bit_buf;
  333. s->bit_left = bit_left;
  334. }
  335. #endif
  336. #ifdef ALT_BITSTREAM_WRITER
  337. static inline void jput_bits(PutBitContext *s, int n, int value)
  338. {
  339. int index= s->index;
  340. uint32_t *ptr= (uint32_t*)(((uint8_t *)s->buf)+(index>>3));
  341. int v= ptr[0];
  342. //if(n>24) printf("%d %d\n", n, value);
  343. v |= be2me_32(value<<(32-n-(index&7) ));
  344. if(((v+0x01010101)^0xFFFFFFFF)&v&0x80808080)
  345. {
  346. /* handle idiotic (m)jpeg escapes */
  347. uint8_t *bPtr= (uint8_t*)ptr;
  348. int numChecked= ((index+n)>>3) - (index>>3);
  349. v= be2me_32(v);
  350. *(bPtr++)= v>>24;
  351. if((v&0xFF000000)==0xFF000000 && numChecked>0){
  352. *(bPtr++)= 0x00;
  353. index+=8;
  354. }
  355. *(bPtr++)= (v>>16)&0xFF;
  356. if((v&0x00FF0000)==0x00FF0000 && numChecked>1){
  357. *(bPtr++)= 0x00;
  358. index+=8;
  359. }
  360. *(bPtr++)= (v>>8)&0xFF;
  361. if((v&0x0000FF00)==0x0000FF00 && numChecked>2){
  362. *(bPtr++)= 0x00;
  363. index+=8;
  364. }
  365. *(bPtr++)= v&0xFF;
  366. if((v&0x000000FF)==0x000000FF && numChecked>3){
  367. *(bPtr++)= 0x00;
  368. index+=8;
  369. }
  370. *((uint32_t*)bPtr)= 0;
  371. }
  372. else
  373. {
  374. ptr[0] = v;
  375. ptr[1] = 0;
  376. }
  377. index+= n;
  378. s->index= index;
  379. }
  380. #endif
  381. static inline uint8_t* pbBufPtr(PutBitContext *s)
  382. {
  383. #ifdef ALT_BITSTREAM_WRITER
  384. return s->buf + (s->index>>3);
  385. #else
  386. return s->buf_ptr;
  387. #endif
  388. }
  389. /* Bitstream reader API docs:
  390. name
  391. abritary name which is used as prefix for the internal variables
  392. gb
  393. getbitcontext
  394. OPEN_READER(name, gb)
  395. loads gb into local variables
  396. CLOSE_READER(name, gb)
  397. stores local vars in gb
  398. UPDATE_CACHE(name, gb)
  399. refills the internal cache from the bitstream
  400. after this call at least MIN_CACHE_BITS will be available,
  401. GET_CACHE(name, gb)
  402. will output the contents of the internal cache, next bit is MSB of 32 or 64 bit (FIXME 64bit)
  403. SHOW_UBITS(name, gb, num)
  404. will return the nest num bits
  405. SHOW_SBITS(name, gb, num)
  406. will return the nest num bits and do sign extension
  407. SKIP_BITS(name, gb, num)
  408. will skip over the next num bits
  409. note, this is equinvalent to SKIP_CACHE; SKIP_COUNTER
  410. SKIP_CACHE(name, gb, num)
  411. will remove the next num bits from the cache (note SKIP_COUNTER MUST be called before UPDATE_CACHE / CLOSE_READER)
  412. SKIP_COUNTER(name, gb, num)
  413. will increment the internal bit counter (see SKIP_CACHE & SKIP_BITS)
  414. LAST_SKIP_CACHE(name, gb, num)
  415. will remove the next num bits from the cache if it is needed for UPDATE_CACHE otherwise it will do nothing
  416. LAST_SKIP_BITS(name, gb, num)
  417. is equinvalent to SKIP_LAST_CACHE; SKIP_COUNTER
  418. for examples see get_bits, show_bits, skip_bits, get_vlc
  419. */
  420. #ifdef ALT_BITSTREAM_READER
  421. # define MIN_CACHE_BITS 25
  422. # define OPEN_READER(name, gb)\
  423. int name##_index= (gb)->index;\
  424. int name##_cache= 0;\
  425. # define CLOSE_READER(name, gb)\
  426. (gb)->index= name##_index;\
  427. # define UPDATE_CACHE(name, gb)\
  428. name##_cache= be2me_32( unaligned32( ((uint8_t *)(gb)->buffer)+(name##_index>>3) ) ) << (name##_index&0x07);\
  429. # define SKIP_CACHE(name, gb, num)\
  430. name##_cache <<= (num);\
  431. // FIXME name?
  432. # define SKIP_COUNTER(name, gb, num)\
  433. name##_index += (num);\
  434. # define SKIP_BITS(name, gb, num)\
  435. {\
  436. SKIP_CACHE(name, gb, num)\
  437. SKIP_COUNTER(name, gb, num)\
  438. }\
  439. # define LAST_SKIP_BITS(name, gb, num) SKIP_COUNTER(name, gb, num)
  440. # define LAST_SKIP_CACHE(name, gb, num) ;
  441. # define SHOW_UBITS(name, gb, num)\
  442. NEG_USR32(name##_cache, num)
  443. # define SHOW_SBITS(name, gb, num)\
  444. NEG_SSR32(name##_cache, num)
  445. # define GET_CACHE(name, gb)\
  446. ((uint32_t)name##_cache)
  447. static inline int get_bits_count(GetBitContext *s){
  448. return s->index;
  449. }
  450. #elif defined LIBMPEG2_BITSTREAM_READER
  451. //libmpeg2 like reader
  452. # define MIN_CACHE_BITS 16
  453. # define OPEN_READER(name, gb)\
  454. int name##_bit_count=(gb)->bit_count;\
  455. int name##_cache= (gb)->cache;\
  456. uint8_t * name##_buffer_ptr=(gb)->buffer_ptr;\
  457. # define CLOSE_READER(name, gb)\
  458. (gb)->bit_count= name##_bit_count;\
  459. (gb)->cache= name##_cache;\
  460. (gb)->buffer_ptr= name##_buffer_ptr;\
  461. # define UPDATE_CACHE(name, gb)\
  462. if(name##_bit_count > 0){\
  463. name##_cache+= ((name##_buffer_ptr[0]<<8) + name##_buffer_ptr[1]) << name##_bit_count;\
  464. name##_buffer_ptr+=2;\
  465. name##_bit_count-= 16;\
  466. }\
  467. # define SKIP_CACHE(name, gb, num)\
  468. name##_cache <<= (num);\
  469. # define SKIP_COUNTER(name, gb, num)\
  470. name##_bit_count += (num);\
  471. # define SKIP_BITS(name, gb, num)\
  472. {\
  473. SKIP_CACHE(name, gb, num)\
  474. SKIP_COUNTER(name, gb, num)\
  475. }\
  476. # define LAST_SKIP_BITS(name, gb, num) SKIP_BITS(name, gb, num)
  477. # define LAST_SKIP_CACHE(name, gb, num) SKIP_CACHE(name, gb, num)
  478. # define SHOW_UBITS(name, gb, num)\
  479. NEG_USR32(name##_cache, num)
  480. # define SHOW_SBITS(name, gb, num)\
  481. NEG_SSR32(name##_cache, num)
  482. # define GET_CACHE(name, gb)\
  483. ((uint32_t)name##_cache)
  484. static inline int get_bits_count(GetBitContext *s){
  485. return (s->buffer_ptr - s->buffer)*8 - 16 + s->bit_count;
  486. }
  487. #elif defined A32_BITSTREAM_READER
  488. # define MIN_CACHE_BITS 32
  489. # define OPEN_READER(name, gb)\
  490. int name##_bit_count=(gb)->bit_count;\
  491. uint32_t name##_cache0= (gb)->cache0;\
  492. uint32_t name##_cache1= (gb)->cache1;\
  493. uint32_t * name##_buffer_ptr=(gb)->buffer_ptr;\
  494. # define CLOSE_READER(name, gb)\
  495. (gb)->bit_count= name##_bit_count;\
  496. (gb)->cache0= name##_cache0;\
  497. (gb)->cache1= name##_cache1;\
  498. (gb)->buffer_ptr= name##_buffer_ptr;\
  499. # define UPDATE_CACHE(name, gb)\
  500. if(name##_bit_count > 0){\
  501. const uint32_t next= be2me_32( *name##_buffer_ptr );\
  502. name##_cache0 |= NEG_USR32(next,name##_bit_count);\
  503. name##_cache1 |= next<<name##_bit_count;\
  504. name##_buffer_ptr++;\
  505. name##_bit_count-= 32;\
  506. }\
  507. #ifdef ARCH_X86
  508. # define SKIP_CACHE(name, gb, num)\
  509. asm(\
  510. "shldl %2, %1, %0 \n\t"\
  511. "shll %2, %1 \n\t"\
  512. : "+r" (name##_cache0), "+r" (name##_cache1)\
  513. : "Ic" ((uint8_t)num)\
  514. );
  515. #else
  516. # define SKIP_CACHE(name, gb, num)\
  517. name##_cache0 <<= (num);\
  518. name##_cache0 |= NEG_USR32(name##_cache1,num);\
  519. name##_cache1 <<= (num);
  520. #endif
  521. # define SKIP_COUNTER(name, gb, num)\
  522. name##_bit_count += (num);\
  523. # define SKIP_BITS(name, gb, num)\
  524. {\
  525. SKIP_CACHE(name, gb, num)\
  526. SKIP_COUNTER(name, gb, num)\
  527. }\
  528. # define LAST_SKIP_BITS(name, gb, num) SKIP_BITS(name, gb, num)
  529. # define LAST_SKIP_CACHE(name, gb, num) SKIP_CACHE(name, gb, num)
  530. # define SHOW_UBITS(name, gb, num)\
  531. NEG_USR32(name##_cache0, num)
  532. # define SHOW_SBITS(name, gb, num)\
  533. NEG_SSR32(name##_cache0, num)
  534. # define GET_CACHE(name, gb)\
  535. (name##_cache0)
  536. static inline int get_bits_count(GetBitContext *s){
  537. return ((uint8_t*)s->buffer_ptr - s->buffer)*8 - 32 + s->bit_count;
  538. }
  539. #endif
  540. static inline unsigned int get_bits(GetBitContext *s, int n){
  541. register int tmp;
  542. OPEN_READER(re, s)
  543. UPDATE_CACHE(re, s)
  544. tmp= SHOW_UBITS(re, s, n);
  545. LAST_SKIP_BITS(re, s, n)
  546. CLOSE_READER(re, s)
  547. return tmp;
  548. }
  549. static inline unsigned int show_bits(GetBitContext *s, int n){
  550. register int tmp;
  551. OPEN_READER(re, s)
  552. UPDATE_CACHE(re, s)
  553. tmp= SHOW_UBITS(re, s, n);
  554. // CLOSE_READER(re, s)
  555. return tmp;
  556. }
  557. static inline void skip_bits(GetBitContext *s, int n){
  558. //Note gcc seems to optimize this to s->index+=n for the ALT_READER :))
  559. OPEN_READER(re, s)
  560. UPDATE_CACHE(re, s)
  561. LAST_SKIP_BITS(re, s, n)
  562. CLOSE_READER(re, s)
  563. }
  564. static inline unsigned int get_bits1(GetBitContext *s){
  565. #ifdef ALT_BITSTREAM_READER
  566. int index= s->index;
  567. uint8_t result= s->buffer[ index>>3 ];
  568. result<<= (index&0x07);
  569. result>>= 8 - 1;
  570. index++;
  571. s->index= index;
  572. return result;
  573. #else
  574. return get_bits(s, 1);
  575. #endif
  576. }
  577. static inline unsigned int show_bits1(GetBitContext *s){
  578. return show_bits(s, 1);
  579. }
  580. static inline void skip_bits1(GetBitContext *s){
  581. skip_bits(s, 1);
  582. }
  583. void init_get_bits(GetBitContext *s,
  584. UINT8 *buffer, int buffer_size);
  585. int check_marker(GetBitContext *s, char *msg);
  586. void align_get_bits(GetBitContext *s);
  587. int init_vlc(VLC *vlc, int nb_bits, int nb_codes,
  588. const void *bits, int bits_wrap, int bits_size,
  589. const void *codes, int codes_wrap, int codes_size);
  590. void free_vlc(VLC *vlc);
  591. //note table will be trashed (pointer increased)
  592. #define GET_VLC(code, name, gb, table, bits, max_depth)\
  593. {\
  594. int n, index, nb_bits;\
  595. \
  596. index= SHOW_UBITS(name, gb, bits);\
  597. code = table[index][0];\
  598. n = table[index][1];\
  599. \
  600. if(max_depth > 1 && n < 0){\
  601. LAST_SKIP_BITS(name, gb, bits)\
  602. UPDATE_CACHE(name, gb)\
  603. \
  604. nb_bits = -n;\
  605. table += code;\
  606. \
  607. index= SHOW_UBITS(name, gb, nb_bits);\
  608. code = table[index][0];\
  609. n = table[index][1];\
  610. if(max_depth > 2 && n < 0){\
  611. LAST_SKIP_BITS(name, gb, nb_bits)\
  612. UPDATE_CACHE(name, gb)\
  613. \
  614. nb_bits = -n;\
  615. table += code;\
  616. \
  617. index= SHOW_UBITS(name, gb, nb_bits);\
  618. code = table[index][0];\
  619. n = table[index][1];\
  620. }\
  621. }\
  622. SKIP_BITS(name, gb, n)\
  623. }
  624. // deprecated, dont use get_vlc for new code, use get_vlc2 instead or use GET_VLC directly
  625. static inline int get_vlc(GetBitContext *s, VLC *vlc)
  626. {
  627. int code;
  628. VLC_TYPE (*table)[2]= vlc->table;
  629. OPEN_READER(re, s)
  630. UPDATE_CACHE(re, s)
  631. GET_VLC(code, re, s, table, vlc->bits, 3)
  632. CLOSE_READER(re, s)
  633. return code;
  634. }
  635. static inline int get_vlc2(GetBitContext *s, VLC_TYPE (*table)[2], int bits, int max_depth)
  636. {
  637. int code;
  638. OPEN_READER(re, s)
  639. UPDATE_CACHE(re, s)
  640. GET_VLC(code, re, s, table, bits, max_depth)
  641. CLOSE_READER(re, s)
  642. return code;
  643. }
  644. /* define it to include statistics code (useful only for optimizing
  645. codec efficiency */
  646. //#define STATS
  647. #ifdef STATS
  648. enum {
  649. ST_UNKNOWN,
  650. ST_DC,
  651. ST_INTRA_AC,
  652. ST_INTER_AC,
  653. ST_INTRA_MB,
  654. ST_INTER_MB,
  655. ST_MV,
  656. ST_NB,
  657. };
  658. extern int st_current_index;
  659. extern unsigned int st_bit_counts[ST_NB];
  660. extern unsigned int st_out_bit_counts[ST_NB];
  661. void print_stats(void);
  662. #endif
  663. /* misc math functions */
  664. static inline int av_log2(unsigned int v)
  665. {
  666. int n;
  667. n = 0;
  668. if (v & 0xffff0000) {
  669. v >>= 16;
  670. n += 16;
  671. }
  672. if (v & 0xff00) {
  673. v >>= 8;
  674. n += 8;
  675. }
  676. if (v & 0xf0) {
  677. v >>= 4;
  678. n += 4;
  679. }
  680. if (v & 0xc) {
  681. v >>= 2;
  682. n += 2;
  683. }
  684. if (v & 0x2) {
  685. n++;
  686. }
  687. return n;
  688. }
  689. /* median of 3 */
  690. static inline int mid_pred(int a, int b, int c)
  691. {
  692. int vmin, vmax;
  693. vmax = vmin = a;
  694. if (b < vmin)
  695. vmin = b;
  696. else
  697. vmax = b;
  698. if (c < vmin)
  699. vmin = c;
  700. else if (c > vmax)
  701. vmax = c;
  702. return a + b + c - vmin - vmax;
  703. }
  704. static inline int clip(int a, int amin, int amax)
  705. {
  706. if (a < amin)
  707. return amin;
  708. else if (a > amax)
  709. return amax;
  710. else
  711. return a;
  712. }
  713. /* math */
  714. int ff_gcd(int a, int b);
  715. static inline int ff_sqrt(int a)
  716. {
  717. int ret=0;
  718. int s;
  719. int ret_sq=0;
  720. for(s=15; s>=0; s--){
  721. int b= ret_sq + (1<<(s*2)) + (ret<<s)*2;
  722. if(b<=a){
  723. ret_sq=b;
  724. ret+= 1<<s;
  725. }
  726. }
  727. return ret;
  728. }
  729. #if __CPU__ >= 686 && !defined(RUNTIME_CPUDETECT)
  730. #define COPY3_IF_LT(x,y,a,b,c,d)\
  731. asm volatile (\
  732. "cmpl %0, %3 \n\t"\
  733. "cmovl %3, %0 \n\t"\
  734. "cmovl %4, %1 \n\t"\
  735. "cmovl %5, %2 \n\t"\
  736. : "+r" (x), "+r" (a), "+r" (c)\
  737. : "r" (y), "r" (b), "r" (d)\
  738. );
  739. #else
  740. #define COPY3_IF_LT(x,y,a,b,c,d)\
  741. if((y)<(x)){\
  742. (x)=(y);\
  743. (a)=(b);\
  744. (c)=(d);\
  745. }
  746. #endif
  747. #define CLAMP_TO_8BIT(d) ((d > 0xff) ? 0xff : (d < 0) ? 0 : d)
  748. #endif /* HAVE_AV_CONFIG_H */
  749. #endif /* COMMON_H */