Go to the documentation of this file.
   36 #define IDCT_TRANSFORM(dest,s0,s1,s2,s3,s4,s5,s6,s7,d0,d1,d2,d3,d4,d5,d6,d7,munge,src) {\ 
   37     const int a1 = (src)[s1] + (src)[s7]; \ 
   38     const int a7 = (src)[s1] - (src)[s7]; \ 
   39     const int a5 = (src)[s5] + (src)[s3]; \ 
   40     const int a3 = (src)[s5] - (src)[s3]; \ 
   41     const int a2 = (src)[s2] + (src)[s6]; \ 
   42     const int a6 = (ASQRT*((src)[s2] - (src)[s6]))>>8; \ 
   43     const int a0 = (src)[s0] + (src)[s4]; \ 
   44     const int a4 = (src)[s0] - (src)[s4]; \ 
   45     const int b0 = (((A4-A5)*a7 - A5*a3)>>9) + a1+a5; \ 
   46     const int b1 = (((A4-A5)*a7 - A5*a3)>>9) + ((ASQRT*(a1-a5))>>8); \ 
   47     const int b2 = (((A2+A5)*a3 + A5*a7)>>9) + ((ASQRT*(a1-a5))>>8); \ 
   48     const int b3 =  ((A2+A5)*a3 + A5*a7)>>9; \ 
   49     (dest)[d0] = munge(a0+a2+a6+b0); \ 
   50     (dest)[d1] = munge(a4+a6   +b1); \ 
   51     (dest)[d2] = munge(a4-a6   +b2); \ 
   52     (dest)[d3] = munge(a0-a2-a6+b3); \ 
   53     (dest)[d4] = munge(a0-a2-a6-b3); \ 
   54     (dest)[d5] = munge(a4-a6   -b2); \ 
   55     (dest)[d6] = munge(a4+a6   -b1); \ 
   56     (dest)[d7] = munge(a0+a2+a6-b0); \ 
   60 #define MUNGE_NONE(x) (x) 
   61 #define IDCT_COL(dest,src) IDCT_TRANSFORM(dest,0,8,16,24,32,40,48,56,0,8,16,24,32,40,48,56,MUNGE_NONE,src) 
   63 #define MUNGE_8BIT(x) av_clip_uint8((x)>>4) 
   64 #define IDCT_ROW(dest,src) IDCT_TRANSFORM(dest,0,1,2,3,4,5,6,7,0,1,2,3,4,5,6,7,MUNGE_8BIT,src) 
  
#define IDCT_COL(dest, src)
 
void ff_ea_idct_put_c(uint8_t *dest, ptrdiff_t linesize, int16_t *block)
 
#define IDCT_ROW(dest, src)
 
#define i(width, name, range_min, range_max)
 
static void ea_idct_col(int16_t *dest, const int16_t *src)
 
The exact code depends on how similar the blocks are and how related they are to the block