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.

544 lines
15KB

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