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.

497 lines
20KB

  1. /*
  2. * DSP utils
  3. * Copyright (c) 2000, 2001 Gerard Lantau.
  4. *
  5. * This program is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License as published by
  7. * the Free Software Foundation; either version 2 of the License, or
  8. * (at your option) any later version.
  9. *
  10. * This program is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. * GNU General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU General Public License
  16. * along with this program; if not, write to the Free Software
  17. * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  18. */
  19. #include <stdlib.h>
  20. #include <stdio.h>
  21. #include "avcodec.h"
  22. #include "dsputil.h"
  23. #include "simple_idct.h"
  24. void (*ff_idct)(DCTELEM *block);
  25. void (*get_pixels)(DCTELEM *block, const UINT8 *pixels, int line_size);
  26. void (*put_pixels_clamped)(const DCTELEM *block, UINT8 *pixels, int line_size);
  27. void (*add_pixels_clamped)(const DCTELEM *block, UINT8 *pixels, int line_size);
  28. op_pixels_abs_func pix_abs16x16;
  29. op_pixels_abs_func pix_abs16x16_x2;
  30. op_pixels_abs_func pix_abs16x16_y2;
  31. op_pixels_abs_func pix_abs16x16_xy2;
  32. UINT8 cropTbl[256 + 2 * MAX_NEG_CROP];
  33. UINT32 squareTbl[512];
  34. extern UINT16 default_intra_matrix[64];
  35. extern UINT16 default_non_intra_matrix[64];
  36. UINT8 zigzag_direct[64] = {
  37. 0, 1, 8, 16, 9, 2, 3, 10,
  38. 17, 24, 32, 25, 18, 11, 4, 5,
  39. 12, 19, 26, 33, 40, 48, 41, 34,
  40. 27, 20, 13, 6, 7, 14, 21, 28,
  41. 35, 42, 49, 56, 57, 50, 43, 36,
  42. 29, 22, 15, 23, 30, 37, 44, 51,
  43. 58, 59, 52, 45, 38, 31, 39, 46,
  44. 53, 60, 61, 54, 47, 55, 62, 63
  45. };
  46. UINT8 ff_alternate_horizontal_scan[64] = {
  47. 0, 1, 2, 3, 8, 9, 16, 17,
  48. 10, 11, 4, 5, 6, 7, 15, 14,
  49. 13, 12, 19, 18, 24, 25, 32, 33,
  50. 26, 27, 20, 21, 22, 23, 28, 29,
  51. 30, 31, 34, 35, 40, 41, 48, 49,
  52. 42, 43, 36, 37, 38, 39, 44, 45,
  53. 46, 47, 50, 51, 56, 57, 58, 59,
  54. 52, 53, 54, 55, 60, 61, 62, 63,
  55. };
  56. UINT8 ff_alternate_vertical_scan[64] = {
  57. 0, 8, 16, 24, 1, 9, 2, 10,
  58. 17, 25, 32, 40, 48, 56, 57, 49,
  59. 41, 33, 26, 18, 3, 11, 4, 12,
  60. 19, 27, 34, 42, 50, 58, 35, 43,
  61. 51, 59, 20, 28, 5, 13, 6, 14,
  62. 21, 29, 36, 44, 52, 60, 37, 45,
  63. 53, 61, 22, 30, 7, 15, 23, 31,
  64. 38, 46, 54, 62, 39, 47, 55, 63,
  65. };
  66. void get_pixels_c(DCTELEM *block, const UINT8 *pixels, int line_size)
  67. {
  68. DCTELEM *p;
  69. const UINT8 *pix;
  70. int i;
  71. /* read the pixels */
  72. p = block;
  73. pix = pixels;
  74. for(i=0;i<8;i++) {
  75. p[0] = pix[0];
  76. p[1] = pix[1];
  77. p[2] = pix[2];
  78. p[3] = pix[3];
  79. p[4] = pix[4];
  80. p[5] = pix[5];
  81. p[6] = pix[6];
  82. p[7] = pix[7];
  83. pix += line_size;
  84. p += 8;
  85. }
  86. }
  87. void put_pixels_clamped_c(const DCTELEM *block, UINT8 *pixels, int line_size)
  88. {
  89. const DCTELEM *p;
  90. UINT8 *pix;
  91. int i;
  92. UINT8 *cm = cropTbl + MAX_NEG_CROP;
  93. /* read the pixels */
  94. p = block;
  95. pix = pixels;
  96. for(i=0;i<8;i++) {
  97. pix[0] = cm[p[0]];
  98. pix[1] = cm[p[1]];
  99. pix[2] = cm[p[2]];
  100. pix[3] = cm[p[3]];
  101. pix[4] = cm[p[4]];
  102. pix[5] = cm[p[5]];
  103. pix[6] = cm[p[6]];
  104. pix[7] = cm[p[7]];
  105. pix += line_size;
  106. p += 8;
  107. }
  108. }
  109. void add_pixels_clamped_c(const DCTELEM *block, UINT8 *pixels, int line_size)
  110. {
  111. const DCTELEM *p;
  112. UINT8 *pix;
  113. int i;
  114. UINT8 *cm = cropTbl + MAX_NEG_CROP;
  115. /* read the pixels */
  116. p = block;
  117. pix = pixels;
  118. for(i=0;i<8;i++) {
  119. pix[0] = cm[pix[0] + p[0]];
  120. pix[1] = cm[pix[1] + p[1]];
  121. pix[2] = cm[pix[2] + p[2]];
  122. pix[3] = cm[pix[3] + p[3]];
  123. pix[4] = cm[pix[4] + p[4]];
  124. pix[5] = cm[pix[5] + p[5]];
  125. pix[6] = cm[pix[6] + p[6]];
  126. pix[7] = cm[pix[7] + p[7]];
  127. pix += line_size;
  128. p += 8;
  129. }
  130. }
  131. #define PIXOP(BTYPE, OPNAME, OP, INCR) \
  132. \
  133. static void OPNAME ## _pixels(BTYPE *block, const UINT8 *pixels, int line_size, int h) \
  134. { \
  135. BTYPE *p; \
  136. const UINT8 *pix; \
  137. \
  138. p = block; \
  139. pix = pixels; \
  140. do { \
  141. OP(p[0], pix[0]); \
  142. OP(p[1], pix[1]); \
  143. OP(p[2], pix[2]); \
  144. OP(p[3], pix[3]); \
  145. OP(p[4], pix[4]); \
  146. OP(p[5], pix[5]); \
  147. OP(p[6], pix[6]); \
  148. OP(p[7], pix[7]); \
  149. pix += line_size; \
  150. p += INCR; \
  151. } while (--h);; \
  152. } \
  153. \
  154. static void OPNAME ## _pixels_x2(BTYPE *block, const UINT8 *pixels, int line_size, int h) \
  155. { \
  156. BTYPE *p; \
  157. const UINT8 *pix; \
  158. \
  159. p = block; \
  160. pix = pixels; \
  161. do { \
  162. OP(p[0], avg2(pix[0], pix[1])); \
  163. OP(p[1], avg2(pix[1], pix[2])); \
  164. OP(p[2], avg2(pix[2], pix[3])); \
  165. OP(p[3], avg2(pix[3], pix[4])); \
  166. OP(p[4], avg2(pix[4], pix[5])); \
  167. OP(p[5], avg2(pix[5], pix[6])); \
  168. OP(p[6], avg2(pix[6], pix[7])); \
  169. OP(p[7], avg2(pix[7], pix[8])); \
  170. pix += line_size; \
  171. p += INCR; \
  172. } while (--h); \
  173. } \
  174. \
  175. static void OPNAME ## _pixels_y2(BTYPE *block, const UINT8 *pixels, int line_size, int h) \
  176. { \
  177. BTYPE *p; \
  178. const UINT8 *pix; \
  179. const UINT8 *pix1; \
  180. \
  181. p = block; \
  182. pix = pixels; \
  183. pix1 = pixels + line_size; \
  184. do { \
  185. OP(p[0], avg2(pix[0], pix1[0])); \
  186. OP(p[1], avg2(pix[1], pix1[1])); \
  187. OP(p[2], avg2(pix[2], pix1[2])); \
  188. OP(p[3], avg2(pix[3], pix1[3])); \
  189. OP(p[4], avg2(pix[4], pix1[4])); \
  190. OP(p[5], avg2(pix[5], pix1[5])); \
  191. OP(p[6], avg2(pix[6], pix1[6])); \
  192. OP(p[7], avg2(pix[7], pix1[7])); \
  193. pix += line_size; \
  194. pix1 += line_size; \
  195. p += INCR; \
  196. } while(--h); \
  197. } \
  198. \
  199. static void OPNAME ## _pixels_xy2(BTYPE *block, const UINT8 *pixels, int line_size, int h) \
  200. { \
  201. BTYPE *p; \
  202. const UINT8 *pix; \
  203. const UINT8 *pix1; \
  204. \
  205. p = block; \
  206. pix = pixels; \
  207. pix1 = pixels + line_size; \
  208. do { \
  209. OP(p[0], avg4(pix[0], pix[1], pix1[0], pix1[1])); \
  210. OP(p[1], avg4(pix[1], pix[2], pix1[1], pix1[2])); \
  211. OP(p[2], avg4(pix[2], pix[3], pix1[2], pix1[3])); \
  212. OP(p[3], avg4(pix[3], pix[4], pix1[3], pix1[4])); \
  213. OP(p[4], avg4(pix[4], pix[5], pix1[4], pix1[5])); \
  214. OP(p[5], avg4(pix[5], pix[6], pix1[5], pix1[6])); \
  215. OP(p[6], avg4(pix[6], pix[7], pix1[6], pix1[7])); \
  216. OP(p[7], avg4(pix[7], pix[8], pix1[7], pix1[8])); \
  217. pix += line_size; \
  218. pix1 += line_size; \
  219. p += INCR; \
  220. } while(--h); \
  221. } \
  222. \
  223. void (*OPNAME ## _pixels_tab[4])(BTYPE *block, const UINT8 *pixels, int line_size, int h) = { \
  224. OPNAME ## _pixels, \
  225. OPNAME ## _pixels_x2, \
  226. OPNAME ## _pixels_y2, \
  227. OPNAME ## _pixels_xy2, \
  228. };
  229. /* rounding primitives */
  230. #define avg2(a,b) ((a+b+1)>>1)
  231. #define avg4(a,b,c,d) ((a+b+c+d+2)>>2)
  232. #define op_put(a, b) a = b
  233. #define op_avg(a, b) a = avg2(a, b)
  234. #define op_sub(a, b) a -= b
  235. PIXOP(UINT8, put, op_put, line_size)
  236. PIXOP(UINT8, avg, op_avg, line_size)
  237. PIXOP(DCTELEM, sub, op_sub, 8)
  238. /* not rounding primitives */
  239. #undef avg2
  240. #undef avg4
  241. #define avg2(a,b) ((a+b)>>1)
  242. #define avg4(a,b,c,d) ((a+b+c+d+1)>>2)
  243. PIXOP(UINT8, put_no_rnd, op_put, line_size)
  244. PIXOP(UINT8, avg_no_rnd, op_avg, line_size)
  245. /* motion estimation */
  246. #undef avg2
  247. #undef avg4
  248. #define avg2(a,b) ((a+b+1)>>1)
  249. #define avg4(a,b,c,d) ((a+b+c+d+2)>>2)
  250. int pix_abs16x16_c(UINT8 *pix1, UINT8 *pix2, int line_size, int h)
  251. {
  252. int s, i;
  253. s = 0;
  254. for(i=0;i<h;i++) {
  255. s += abs(pix1[0] - pix2[0]);
  256. s += abs(pix1[1] - pix2[1]);
  257. s += abs(pix1[2] - pix2[2]);
  258. s += abs(pix1[3] - pix2[3]);
  259. s += abs(pix1[4] - pix2[4]);
  260. s += abs(pix1[5] - pix2[5]);
  261. s += abs(pix1[6] - pix2[6]);
  262. s += abs(pix1[7] - pix2[7]);
  263. s += abs(pix1[8] - pix2[8]);
  264. s += abs(pix1[9] - pix2[9]);
  265. s += abs(pix1[10] - pix2[10]);
  266. s += abs(pix1[11] - pix2[11]);
  267. s += abs(pix1[12] - pix2[12]);
  268. s += abs(pix1[13] - pix2[13]);
  269. s += abs(pix1[14] - pix2[14]);
  270. s += abs(pix1[15] - pix2[15]);
  271. pix1 += line_size;
  272. pix2 += line_size;
  273. }
  274. return s;
  275. }
  276. int pix_abs16x16_x2_c(UINT8 *pix1, UINT8 *pix2, int line_size, int h)
  277. {
  278. int s, i;
  279. s = 0;
  280. for(i=0;i<h;i++) {
  281. s += abs(pix1[0] - avg2(pix2[0], pix2[1]));
  282. s += abs(pix1[1] - avg2(pix2[1], pix2[2]));
  283. s += abs(pix1[2] - avg2(pix2[2], pix2[3]));
  284. s += abs(pix1[3] - avg2(pix2[3], pix2[4]));
  285. s += abs(pix1[4] - avg2(pix2[4], pix2[5]));
  286. s += abs(pix1[5] - avg2(pix2[5], pix2[6]));
  287. s += abs(pix1[6] - avg2(pix2[6], pix2[7]));
  288. s += abs(pix1[7] - avg2(pix2[7], pix2[8]));
  289. s += abs(pix1[8] - avg2(pix2[8], pix2[9]));
  290. s += abs(pix1[9] - avg2(pix2[9], pix2[10]));
  291. s += abs(pix1[10] - avg2(pix2[10], pix2[11]));
  292. s += abs(pix1[11] - avg2(pix2[11], pix2[12]));
  293. s += abs(pix1[12] - avg2(pix2[12], pix2[13]));
  294. s += abs(pix1[13] - avg2(pix2[13], pix2[14]));
  295. s += abs(pix1[14] - avg2(pix2[14], pix2[15]));
  296. s += abs(pix1[15] - avg2(pix2[15], pix2[16]));
  297. pix1 += line_size;
  298. pix2 += line_size;
  299. }
  300. return s;
  301. }
  302. int pix_abs16x16_y2_c(UINT8 *pix1, UINT8 *pix2, int line_size, int h)
  303. {
  304. int s, i;
  305. UINT8 *pix3 = pix2 + line_size;
  306. s = 0;
  307. for(i=0;i<h;i++) {
  308. s += abs(pix1[0] - avg2(pix2[0], pix3[0]));
  309. s += abs(pix1[1] - avg2(pix2[1], pix3[1]));
  310. s += abs(pix1[2] - avg2(pix2[2], pix3[2]));
  311. s += abs(pix1[3] - avg2(pix2[3], pix3[3]));
  312. s += abs(pix1[4] - avg2(pix2[4], pix3[4]));
  313. s += abs(pix1[5] - avg2(pix2[5], pix3[5]));
  314. s += abs(pix1[6] - avg2(pix2[6], pix3[6]));
  315. s += abs(pix1[7] - avg2(pix2[7], pix3[7]));
  316. s += abs(pix1[8] - avg2(pix2[8], pix3[8]));
  317. s += abs(pix1[9] - avg2(pix2[9], pix3[9]));
  318. s += abs(pix1[10] - avg2(pix2[10], pix3[10]));
  319. s += abs(pix1[11] - avg2(pix2[11], pix3[11]));
  320. s += abs(pix1[12] - avg2(pix2[12], pix3[12]));
  321. s += abs(pix1[13] - avg2(pix2[13], pix3[13]));
  322. s += abs(pix1[14] - avg2(pix2[14], pix3[14]));
  323. s += abs(pix1[15] - avg2(pix2[15], pix3[15]));
  324. pix1 += line_size;
  325. pix2 += line_size;
  326. pix3 += line_size;
  327. }
  328. return s;
  329. }
  330. int pix_abs16x16_xy2_c(UINT8 *pix1, UINT8 *pix2, int line_size, int h)
  331. {
  332. int s, i;
  333. UINT8 *pix3 = pix2 + line_size;
  334. s = 0;
  335. for(i=0;i<h;i++) {
  336. s += abs(pix1[0] - avg4(pix2[0], pix2[1], pix3[0], pix3[1]));
  337. s += abs(pix1[1] - avg4(pix2[1], pix2[2], pix3[1], pix3[2]));
  338. s += abs(pix1[2] - avg4(pix2[2], pix2[3], pix3[2], pix3[3]));
  339. s += abs(pix1[3] - avg4(pix2[3], pix2[4], pix3[3], pix3[4]));
  340. s += abs(pix1[4] - avg4(pix2[4], pix2[5], pix3[4], pix3[5]));
  341. s += abs(pix1[5] - avg4(pix2[5], pix2[6], pix3[5], pix3[6]));
  342. s += abs(pix1[6] - avg4(pix2[6], pix2[7], pix3[6], pix3[7]));
  343. s += abs(pix1[7] - avg4(pix2[7], pix2[8], pix3[7], pix3[8]));
  344. s += abs(pix1[8] - avg4(pix2[8], pix2[9], pix3[8], pix3[9]));
  345. s += abs(pix1[9] - avg4(pix2[9], pix2[10], pix3[9], pix3[10]));
  346. s += abs(pix1[10] - avg4(pix2[10], pix2[11], pix3[10], pix3[11]));
  347. s += abs(pix1[11] - avg4(pix2[11], pix2[12], pix3[11], pix3[12]));
  348. s += abs(pix1[12] - avg4(pix2[12], pix2[13], pix3[12], pix3[13]));
  349. s += abs(pix1[13] - avg4(pix2[13], pix2[14], pix3[13], pix3[14]));
  350. s += abs(pix1[14] - avg4(pix2[14], pix2[15], pix3[14], pix3[15]));
  351. s += abs(pix1[15] - avg4(pix2[15], pix2[16], pix3[15], pix3[16]));
  352. pix1 += line_size;
  353. pix2 += line_size;
  354. pix3 += line_size;
  355. }
  356. return s;
  357. }
  358. /* permute block according so that it corresponds to the MMX idct
  359. order */
  360. #ifdef SIMPLE_IDCT
  361. void block_permute(INT16 *block)
  362. {
  363. int i;
  364. INT16 temp[64];
  365. // for(i=0; i<64; i++) temp[i] = block[ block_permute_op(i) ];
  366. for(i=0; i<64; i++) temp[ block_permute_op(i) ] = block[i];
  367. for(i=0; i<64; i++) block[i] = temp[i];
  368. /*
  369. for(i=0; i<64; i++)
  370. {
  371. if((i&7)==0) printf("\n");
  372. printf("%2d ", block[i]);
  373. }
  374. */
  375. }
  376. #else
  377. void block_permute(INT16 *block)
  378. {
  379. int tmp1, tmp2, tmp3, tmp4, tmp5, tmp6;
  380. int i;
  381. for(i=0;i<8;i++) {
  382. tmp1 = block[1];
  383. tmp2 = block[2];
  384. tmp3 = block[3];
  385. tmp4 = block[4];
  386. tmp5 = block[5];
  387. tmp6 = block[6];
  388. block[1] = tmp2;
  389. block[2] = tmp4;
  390. block[3] = tmp6;
  391. block[4] = tmp1;
  392. block[5] = tmp3;
  393. block[6] = tmp5;
  394. block += 8;
  395. }
  396. }
  397. #endif
  398. void dsputil_init(void)
  399. {
  400. int i, j;
  401. int use_permuted_idct;
  402. for(i=0;i<256;i++) cropTbl[i + MAX_NEG_CROP] = i;
  403. for(i=0;i<MAX_NEG_CROP;i++) {
  404. cropTbl[i] = 0;
  405. cropTbl[i + MAX_NEG_CROP + 256] = 255;
  406. }
  407. for(i=0;i<512;i++) {
  408. squareTbl[i] = (i - 256) * (i - 256);
  409. }
  410. #ifdef SIMPLE_IDCT
  411. ff_idct = simple_idct;
  412. #else
  413. ff_idct = j_rev_dct;
  414. #endif
  415. get_pixels = get_pixels_c;
  416. put_pixels_clamped = put_pixels_clamped_c;
  417. add_pixels_clamped = add_pixels_clamped_c;
  418. pix_abs16x16 = pix_abs16x16_c;
  419. pix_abs16x16_x2 = pix_abs16x16_x2_c;
  420. pix_abs16x16_y2 = pix_abs16x16_y2_c;
  421. pix_abs16x16_xy2 = pix_abs16x16_xy2_c;
  422. av_fdct = jpeg_fdct_ifast;
  423. use_permuted_idct = 1;
  424. #ifdef HAVE_MMX
  425. dsputil_init_mmx();
  426. #endif
  427. #ifdef ARCH_ARMV4L
  428. dsputil_init_armv4l();
  429. #endif
  430. #ifdef HAVE_MLIB
  431. dsputil_init_mlib();
  432. use_permuted_idct = 0;
  433. #endif
  434. #ifdef SIMPLE_IDCT
  435. if(ff_idct == simple_idct) use_permuted_idct=0;
  436. #endif
  437. if (use_permuted_idct) {
  438. /* permute for IDCT */
  439. for(i=0;i<64;i++) {
  440. j = zigzag_direct[i];
  441. zigzag_direct[i] = block_permute_op(j);
  442. j = ff_alternate_horizontal_scan[i];
  443. ff_alternate_horizontal_scan[i] = block_permute_op(j);
  444. j = ff_alternate_vertical_scan[i];
  445. ff_alternate_vertical_scan[i] = block_permute_op(j);
  446. }
  447. block_permute(default_intra_matrix);
  448. block_permute(default_non_intra_matrix);
  449. }
  450. }