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.

580 lines
15KB

  1. /*
  2. * Simple IDCT
  3. *
  4. * Copyright (c) 2001 Michael Niedermayer <michaelni@gmx.at>
  5. *
  6. * This library is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU Lesser General Public
  8. * License as published by the Free Software Foundation; either
  9. * version 2 of the License, or (at your option) any later version.
  10. *
  11. * This library is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  14. * Lesser General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU Lesser General Public
  17. * License along with this library; if not, write to the Free Software
  18. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  19. */
  20. /*
  21. based upon some outcommented c code from mpeg2dec (idct_mmx.c
  22. written by Aaron Holtzman <aholtzma@ess.engr.uvic.ca>)
  23. */
  24. #include "avcodec.h"
  25. #include "dsputil.h"
  26. #include "simple_idct.h"
  27. #if 0
  28. #define W1 2841 /* 2048*sqrt (2)*cos (1*pi/16) */
  29. #define W2 2676 /* 2048*sqrt (2)*cos (2*pi/16) */
  30. #define W3 2408 /* 2048*sqrt (2)*cos (3*pi/16) */
  31. #define W4 2048 /* 2048*sqrt (2)*cos (4*pi/16) */
  32. #define W5 1609 /* 2048*sqrt (2)*cos (5*pi/16) */
  33. #define W6 1108 /* 2048*sqrt (2)*cos (6*pi/16) */
  34. #define W7 565 /* 2048*sqrt (2)*cos (7*pi/16) */
  35. #define ROW_SHIFT 8
  36. #define COL_SHIFT 17
  37. #else
  38. #define W1 22725 //cos(i*M_PI/16)*sqrt(2)*(1<<14) + 0.5
  39. #define W2 21407 //cos(i*M_PI/16)*sqrt(2)*(1<<14) + 0.5
  40. #define W3 19266 //cos(i*M_PI/16)*sqrt(2)*(1<<14) + 0.5
  41. #define W4 16383 //cos(i*M_PI/16)*sqrt(2)*(1<<14) + 0.5
  42. #define W5 12873 //cos(i*M_PI/16)*sqrt(2)*(1<<14) + 0.5
  43. #define W6 8867 //cos(i*M_PI/16)*sqrt(2)*(1<<14) + 0.5
  44. #define W7 4520 //cos(i*M_PI/16)*sqrt(2)*(1<<14) + 0.5
  45. #define ROW_SHIFT 11
  46. #define COL_SHIFT 20 // 6
  47. #endif
  48. #if defined(ARCH_POWERPC_405)
  49. /* signed 16x16 -> 32 multiply add accumulate */
  50. #define MAC16(rt, ra, rb) \
  51. asm ("maclhw %0, %2, %3" : "=r" (rt) : "0" (rt), "r" (ra), "r" (rb));
  52. /* signed 16x16 -> 32 multiply */
  53. #define MUL16(rt, ra, rb) \
  54. asm ("mullhw %0, %1, %2" : "=r" (rt) : "r" (ra), "r" (rb));
  55. #else
  56. /* signed 16x16 -> 32 multiply add accumulate */
  57. #define MAC16(rt, ra, rb) rt += (ra) * (rb)
  58. /* signed 16x16 -> 32 multiply */
  59. #define MUL16(rt, ra, rb) rt = (ra) * (rb)
  60. #endif
  61. static inline void idctRowCondDC (DCTELEM * row)
  62. {
  63. int a0, a1, a2, a3, b0, b1, b2, b3;
  64. #ifdef FAST_64BIT
  65. uint64_t temp;
  66. #else
  67. uint32_t temp;
  68. #endif
  69. #ifdef FAST_64BIT
  70. #ifdef WORDS_BIGENDIAN
  71. #define ROW0_MASK 0xffff000000000000LL
  72. #else
  73. #define ROW0_MASK 0xffffLL
  74. #endif
  75. if(sizeof(DCTELEM)==2){
  76. if ( ((((uint64_t *)row)[0] & ~ROW0_MASK) |
  77. ((uint64_t *)row)[1]) == 0) {
  78. temp = (row[0] << 3) & 0xffff;
  79. temp += temp << 16;
  80. temp += temp << 32;
  81. ((uint64_t *)row)[0] = temp;
  82. ((uint64_t *)row)[1] = temp;
  83. return;
  84. }
  85. }else{
  86. if (!(row[1]|row[2]|row[3]|row[4]|row[5]|row[6]|row[7])) {
  87. row[0]=row[1]=row[2]=row[3]=row[4]=row[5]=row[6]=row[7]= row[0] << 3;
  88. return;
  89. }
  90. }
  91. #else
  92. if(sizeof(DCTELEM)==2){
  93. if (!(((uint32_t*)row)[1] |
  94. ((uint32_t*)row)[2] |
  95. ((uint32_t*)row)[3] |
  96. row[1])) {
  97. temp = (row[0] << 3) & 0xffff;
  98. temp += temp << 16;
  99. ((uint32_t*)row)[0]=((uint32_t*)row)[1] =
  100. ((uint32_t*)row)[2]=((uint32_t*)row)[3] = temp;
  101. return;
  102. }
  103. }else{
  104. if (!(row[1]|row[2]|row[3]|row[4]|row[5]|row[6]|row[7])) {
  105. row[0]=row[1]=row[2]=row[3]=row[4]=row[5]=row[6]=row[7]= row[0] << 3;
  106. return;
  107. }
  108. }
  109. #endif
  110. a0 = (W4 * row[0]) + (1 << (ROW_SHIFT - 1));
  111. a1 = a0;
  112. a2 = a0;
  113. a3 = a0;
  114. /* no need to optimize : gcc does it */
  115. a0 += W2 * row[2];
  116. a1 += W6 * row[2];
  117. a2 -= W6 * row[2];
  118. a3 -= W2 * row[2];
  119. MUL16(b0, W1, row[1]);
  120. MAC16(b0, W3, row[3]);
  121. MUL16(b1, W3, row[1]);
  122. MAC16(b1, -W7, row[3]);
  123. MUL16(b2, W5, row[1]);
  124. MAC16(b2, -W1, row[3]);
  125. MUL16(b3, W7, row[1]);
  126. MAC16(b3, -W5, row[3]);
  127. #ifdef FAST_64BIT
  128. temp = ((uint64_t*)row)[1];
  129. #else
  130. temp = ((uint32_t*)row)[2] | ((uint32_t*)row)[3];
  131. #endif
  132. if (temp != 0) {
  133. a0 += W4*row[4] + W6*row[6];
  134. a1 += - W4*row[4] - W2*row[6];
  135. a2 += - W4*row[4] + W2*row[6];
  136. a3 += W4*row[4] - W6*row[6];
  137. MAC16(b0, W5, row[5]);
  138. MAC16(b0, W7, row[7]);
  139. MAC16(b1, -W1, row[5]);
  140. MAC16(b1, -W5, row[7]);
  141. MAC16(b2, W7, row[5]);
  142. MAC16(b2, W3, row[7]);
  143. MAC16(b3, W3, row[5]);
  144. MAC16(b3, -W1, row[7]);
  145. }
  146. row[0] = (a0 + b0) >> ROW_SHIFT;
  147. row[7] = (a0 - b0) >> ROW_SHIFT;
  148. row[1] = (a1 + b1) >> ROW_SHIFT;
  149. row[6] = (a1 - b1) >> ROW_SHIFT;
  150. row[2] = (a2 + b2) >> ROW_SHIFT;
  151. row[5] = (a2 - b2) >> ROW_SHIFT;
  152. row[3] = (a3 + b3) >> ROW_SHIFT;
  153. row[4] = (a3 - b3) >> ROW_SHIFT;
  154. }
  155. static inline void idctSparseColPut (UINT8 *dest, int line_size,
  156. DCTELEM * col)
  157. {
  158. int a0, a1, a2, a3, b0, b1, b2, b3;
  159. UINT8 *cm = cropTbl + MAX_NEG_CROP;
  160. /* XXX: I did that only to give same values as previous code */
  161. a0 = W4 * (col[8*0] + ((1<<(COL_SHIFT-1))/W4));
  162. a1 = a0;
  163. a2 = a0;
  164. a3 = a0;
  165. a0 += + W2*col[8*2];
  166. a1 += + W6*col[8*2];
  167. a2 += - W6*col[8*2];
  168. a3 += - W2*col[8*2];
  169. MUL16(b0, W1, col[8*1]);
  170. MUL16(b1, W3, col[8*1]);
  171. MUL16(b2, W5, col[8*1]);
  172. MUL16(b3, W7, col[8*1]);
  173. MAC16(b0, + W3, col[8*3]);
  174. MAC16(b1, - W7, col[8*3]);
  175. MAC16(b2, - W1, col[8*3]);
  176. MAC16(b3, - W5, col[8*3]);
  177. if(col[8*4]){
  178. a0 += + W4*col[8*4];
  179. a1 += - W4*col[8*4];
  180. a2 += - W4*col[8*4];
  181. a3 += + W4*col[8*4];
  182. }
  183. if (col[8*5]) {
  184. MAC16(b0, + W5, col[8*5]);
  185. MAC16(b1, - W1, col[8*5]);
  186. MAC16(b2, + W7, col[8*5]);
  187. MAC16(b3, + W3, col[8*5]);
  188. }
  189. if(col[8*6]){
  190. a0 += + W6*col[8*6];
  191. a1 += - W2*col[8*6];
  192. a2 += + W2*col[8*6];
  193. a3 += - W6*col[8*6];
  194. }
  195. if (col[8*7]) {
  196. MAC16(b0, + W7, col[8*7]);
  197. MAC16(b1, - W5, col[8*7]);
  198. MAC16(b2, + W3, col[8*7]);
  199. MAC16(b3, - W1, col[8*7]);
  200. }
  201. dest[0] = cm[(a0 + b0) >> COL_SHIFT];
  202. dest += line_size;
  203. dest[0] = cm[(a1 + b1) >> COL_SHIFT];
  204. dest += line_size;
  205. dest[0] = cm[(a2 + b2) >> COL_SHIFT];
  206. dest += line_size;
  207. dest[0] = cm[(a3 + b3) >> COL_SHIFT];
  208. dest += line_size;
  209. dest[0] = cm[(a3 - b3) >> COL_SHIFT];
  210. dest += line_size;
  211. dest[0] = cm[(a2 - b2) >> COL_SHIFT];
  212. dest += line_size;
  213. dest[0] = cm[(a1 - b1) >> COL_SHIFT];
  214. dest += line_size;
  215. dest[0] = cm[(a0 - b0) >> COL_SHIFT];
  216. }
  217. static inline void idctSparseColAdd (UINT8 *dest, int line_size,
  218. DCTELEM * col)
  219. {
  220. int a0, a1, a2, a3, b0, b1, b2, b3;
  221. UINT8 *cm = cropTbl + MAX_NEG_CROP;
  222. /* XXX: I did that only to give same values as previous code */
  223. a0 = W4 * (col[8*0] + ((1<<(COL_SHIFT-1))/W4));
  224. a1 = a0;
  225. a2 = a0;
  226. a3 = a0;
  227. a0 += + W2*col[8*2];
  228. a1 += + W6*col[8*2];
  229. a2 += - W6*col[8*2];
  230. a3 += - W2*col[8*2];
  231. MUL16(b0, W1, col[8*1]);
  232. MUL16(b1, W3, col[8*1]);
  233. MUL16(b2, W5, col[8*1]);
  234. MUL16(b3, W7, col[8*1]);
  235. MAC16(b0, + W3, col[8*3]);
  236. MAC16(b1, - W7, col[8*3]);
  237. MAC16(b2, - W1, col[8*3]);
  238. MAC16(b3, - W5, col[8*3]);
  239. if(col[8*4]){
  240. a0 += + W4*col[8*4];
  241. a1 += - W4*col[8*4];
  242. a2 += - W4*col[8*4];
  243. a3 += + W4*col[8*4];
  244. }
  245. if (col[8*5]) {
  246. MAC16(b0, + W5, col[8*5]);
  247. MAC16(b1, - W1, col[8*5]);
  248. MAC16(b2, + W7, col[8*5]);
  249. MAC16(b3, + W3, col[8*5]);
  250. }
  251. if(col[8*6]){
  252. a0 += + W6*col[8*6];
  253. a1 += - W2*col[8*6];
  254. a2 += + W2*col[8*6];
  255. a3 += - W6*col[8*6];
  256. }
  257. if (col[8*7]) {
  258. MAC16(b0, + W7, col[8*7]);
  259. MAC16(b1, - W5, col[8*7]);
  260. MAC16(b2, + W3, col[8*7]);
  261. MAC16(b3, - W1, col[8*7]);
  262. }
  263. dest[0] = cm[dest[0] + ((a0 + b0) >> COL_SHIFT)];
  264. dest += line_size;
  265. dest[0] = cm[dest[0] + ((a1 + b1) >> COL_SHIFT)];
  266. dest += line_size;
  267. dest[0] = cm[dest[0] + ((a2 + b2) >> COL_SHIFT)];
  268. dest += line_size;
  269. dest[0] = cm[dest[0] + ((a3 + b3) >> COL_SHIFT)];
  270. dest += line_size;
  271. dest[0] = cm[dest[0] + ((a3 - b3) >> COL_SHIFT)];
  272. dest += line_size;
  273. dest[0] = cm[dest[0] + ((a2 - b2) >> COL_SHIFT)];
  274. dest += line_size;
  275. dest[0] = cm[dest[0] + ((a1 - b1) >> COL_SHIFT)];
  276. dest += line_size;
  277. dest[0] = cm[dest[0] + ((a0 - b0) >> COL_SHIFT)];
  278. }
  279. static inline void idctSparseCol (DCTELEM * col)
  280. {
  281. int a0, a1, a2, a3, b0, b1, b2, b3;
  282. /* XXX: I did that only to give same values as previous code */
  283. a0 = W4 * (col[8*0] + ((1<<(COL_SHIFT-1))/W4));
  284. a1 = a0;
  285. a2 = a0;
  286. a3 = a0;
  287. a0 += + W2*col[8*2];
  288. a1 += + W6*col[8*2];
  289. a2 += - W6*col[8*2];
  290. a3 += - W2*col[8*2];
  291. MUL16(b0, W1, col[8*1]);
  292. MUL16(b1, W3, col[8*1]);
  293. MUL16(b2, W5, col[8*1]);
  294. MUL16(b3, W7, col[8*1]);
  295. MAC16(b0, + W3, col[8*3]);
  296. MAC16(b1, - W7, col[8*3]);
  297. MAC16(b2, - W1, col[8*3]);
  298. MAC16(b3, - W5, col[8*3]);
  299. if(col[8*4]){
  300. a0 += + W4*col[8*4];
  301. a1 += - W4*col[8*4];
  302. a2 += - W4*col[8*4];
  303. a3 += + W4*col[8*4];
  304. }
  305. if (col[8*5]) {
  306. MAC16(b0, + W5, col[8*5]);
  307. MAC16(b1, - W1, col[8*5]);
  308. MAC16(b2, + W7, col[8*5]);
  309. MAC16(b3, + W3, col[8*5]);
  310. }
  311. if(col[8*6]){
  312. a0 += + W6*col[8*6];
  313. a1 += - W2*col[8*6];
  314. a2 += + W2*col[8*6];
  315. a3 += - W6*col[8*6];
  316. }
  317. if (col[8*7]) {
  318. MAC16(b0, + W7, col[8*7]);
  319. MAC16(b1, - W5, col[8*7]);
  320. MAC16(b2, + W3, col[8*7]);
  321. MAC16(b3, - W1, col[8*7]);
  322. }
  323. col[0 ] = ((a0 + b0) >> COL_SHIFT);
  324. col[8 ] = ((a1 + b1) >> COL_SHIFT);
  325. col[16] = ((a2 + b2) >> COL_SHIFT);
  326. col[24] = ((a3 + b3) >> COL_SHIFT);
  327. col[32] = ((a3 - b3) >> COL_SHIFT);
  328. col[40] = ((a2 - b2) >> COL_SHIFT);
  329. col[48] = ((a1 - b1) >> COL_SHIFT);
  330. col[56] = ((a0 - b0) >> COL_SHIFT);
  331. }
  332. void simple_idct_put(UINT8 *dest, int line_size, DCTELEM *block)
  333. {
  334. int i;
  335. for(i=0; i<8; i++)
  336. idctRowCondDC(block + i*8);
  337. for(i=0; i<8; i++)
  338. idctSparseColPut(dest + i, line_size, block + i);
  339. }
  340. void simple_idct_add(UINT8 *dest, int line_size, DCTELEM *block)
  341. {
  342. int i;
  343. for(i=0; i<8; i++)
  344. idctRowCondDC(block + i*8);
  345. for(i=0; i<8; i++)
  346. idctSparseColAdd(dest + i, line_size, block + i);
  347. }
  348. void simple_idct(DCTELEM *block)
  349. {
  350. int i;
  351. for(i=0; i<8; i++)
  352. idctRowCondDC(block + i*8);
  353. for(i=0; i<8; i++)
  354. idctSparseCol(block + i);
  355. }
  356. /* 2x4x8 idct */
  357. #define CN_SHIFT 12
  358. #define C_FIX(x) ((int)((x) * (1 << CN_SHIFT) + 0.5))
  359. #define C1 C_FIX(0.6532814824)
  360. #define C2 C_FIX(0.2705980501)
  361. /* row idct is multiple by 16 * sqrt(2.0), col idct4 is normalized,
  362. and the butterfly must be multiplied by 0.5 * sqrt(2.0) */
  363. #define C_SHIFT (4+1+12)
  364. static inline void idct4col(UINT8 *dest, int line_size, const DCTELEM *col)
  365. {
  366. int c0, c1, c2, c3, a0, a1, a2, a3;
  367. const UINT8 *cm = cropTbl + MAX_NEG_CROP;
  368. a0 = col[8*0];
  369. a1 = col[8*2];
  370. a2 = col[8*4];
  371. a3 = col[8*6];
  372. c0 = ((a0 + a2) << (CN_SHIFT - 1)) + (1 << (C_SHIFT - 1));
  373. c2 = ((a0 - a2) << (CN_SHIFT - 1)) + (1 << (C_SHIFT - 1));
  374. c1 = a1 * C1 + a3 * C2;
  375. c3 = a1 * C2 - a3 * C1;
  376. dest[0] = cm[(c0 + c1) >> C_SHIFT];
  377. dest += line_size;
  378. dest[0] = cm[(c2 + c3) >> C_SHIFT];
  379. dest += line_size;
  380. dest[0] = cm[(c2 - c3) >> C_SHIFT];
  381. dest += line_size;
  382. dest[0] = cm[(c0 - c1) >> C_SHIFT];
  383. }
  384. #define BF(k) \
  385. {\
  386. int a0, a1;\
  387. a0 = ptr[k];\
  388. a1 = ptr[8 + k];\
  389. ptr[k] = a0 + a1;\
  390. ptr[8 + k] = a0 - a1;\
  391. }
  392. /* only used by DV codec. The input must be interlaced. 128 is added
  393. to the pixels before clamping to avoid systematic error
  394. (1024*sqrt(2)) offset would be needed otherwise. */
  395. /* XXX: I think a 1.0/sqrt(2) normalization should be needed to
  396. compensate the extra butterfly stage - I don't have the full DV
  397. specification */
  398. void simple_idct248_put(UINT8 *dest, int line_size, DCTELEM *block)
  399. {
  400. int i;
  401. DCTELEM *ptr;
  402. /* butterfly */
  403. ptr = block;
  404. for(i=0;i<4;i++) {
  405. BF(0);
  406. BF(1);
  407. BF(2);
  408. BF(3);
  409. BF(4);
  410. BF(5);
  411. BF(6);
  412. BF(7);
  413. ptr += 2 * 8;
  414. }
  415. /* IDCT8 on each line */
  416. for(i=0; i<8; i++) {
  417. idctRowCondDC(block + i*8);
  418. }
  419. /* IDCT4 and store */
  420. for(i=0;i<8;i++) {
  421. idct4col(dest + i, 2 * line_size, block + i);
  422. idct4col(dest + line_size + i, 2 * line_size, block + 8 + i);
  423. }
  424. }
  425. /* 8x4 & 4x8 WMV2 IDCT */
  426. #undef CN_SHIFT
  427. #undef C_SHIFT
  428. #undef C_FIX
  429. #undef C1
  430. #undef C2
  431. #define CN_SHIFT 12
  432. #define C_FIX(x) ((int)((x) * 1.414213562 * (1 << CN_SHIFT) + 0.5))
  433. #define C1 C_FIX(0.6532814824)
  434. #define C2 C_FIX(0.2705980501)
  435. #define C3 C_FIX(0.5)
  436. #define C_SHIFT (4+1+12)
  437. static inline void idct4col_add(UINT8 *dest, int line_size, const DCTELEM *col)
  438. {
  439. int c0, c1, c2, c3, a0, a1, a2, a3;
  440. const UINT8 *cm = cropTbl + MAX_NEG_CROP;
  441. a0 = col[8*0];
  442. a1 = col[8*1];
  443. a2 = col[8*2];
  444. a3 = col[8*3];
  445. c0 = (a0 + a2)*C3 + (1 << (C_SHIFT - 1));
  446. c2 = (a0 - a2)*C3 + (1 << (C_SHIFT - 1));
  447. c1 = a1 * C1 + a3 * C2;
  448. c3 = a1 * C2 - a3 * C1;
  449. dest[0] = cm[dest[0] + ((c0 + c1) >> C_SHIFT)];
  450. dest += line_size;
  451. dest[0] = cm[dest[0] + ((c2 + c3) >> C_SHIFT)];
  452. dest += line_size;
  453. dest[0] = cm[dest[0] + ((c2 - c3) >> C_SHIFT)];
  454. dest += line_size;
  455. dest[0] = cm[dest[0] + ((c0 - c1) >> C_SHIFT)];
  456. }
  457. #define RN_SHIFT 15
  458. #define R_FIX(x) ((int)((x) * 1.414213562 * (1 << RN_SHIFT) + 0.5))
  459. #define R1 R_FIX(0.6532814824)
  460. #define R2 R_FIX(0.2705980501)
  461. #define R3 R_FIX(0.5)
  462. #define R_SHIFT 11
  463. static inline void idct4row(DCTELEM *row)
  464. {
  465. int c0, c1, c2, c3, a0, a1, a2, a3;
  466. const UINT8 *cm = cropTbl + MAX_NEG_CROP;
  467. a0 = row[0];
  468. a1 = row[1];
  469. a2 = row[2];
  470. a3 = row[3];
  471. c0 = (a0 + a2)*R3 + (1 << (R_SHIFT - 1));
  472. c2 = (a0 - a2)*R3 + (1 << (R_SHIFT - 1));
  473. c1 = a1 * R1 + a3 * R2;
  474. c3 = a1 * R2 - a3 * R1;
  475. row[0]= (c0 + c1) >> R_SHIFT;
  476. row[1]= (c2 + c3) >> R_SHIFT;
  477. row[2]= (c2 - c3) >> R_SHIFT;
  478. row[3]= (c0 - c1) >> R_SHIFT;
  479. }
  480. void simple_idct84_add(UINT8 *dest, int line_size, DCTELEM *block)
  481. {
  482. int i;
  483. /* IDCT8 on each line */
  484. for(i=0; i<4; i++) {
  485. idctRowCondDC(block + i*8);
  486. }
  487. /* IDCT4 and store */
  488. for(i=0;i<8;i++) {
  489. idct4col_add(dest + i, line_size, block + i);
  490. }
  491. }
  492. void simple_idct48_add(UINT8 *dest, int line_size, DCTELEM *block)
  493. {
  494. int i;
  495. /* IDCT4 on each line */
  496. for(i=0; i<8; i++) {
  497. idct4row(block + i*8);
  498. }
  499. /* IDCT8 and store */
  500. for(i=0; i<4; i++){
  501. idctSparseColAdd(dest + i, line_size, block + i);
  502. }
  503. }