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.

909 lines
20KB

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