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.

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