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.

513 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. static UINT8 simple_mmx_permutation[64]={
  67. 0x00, 0x08, 0x01, 0x09, 0x04, 0x0C, 0x05, 0x0D,
  68. 0x10, 0x18, 0x11, 0x19, 0x14, 0x1C, 0x15, 0x1D,
  69. 0x02, 0x0A, 0x03, 0x0B, 0x06, 0x0E, 0x07, 0x0F,
  70. 0x12, 0x1A, 0x13, 0x1B, 0x16, 0x1E, 0x17, 0x1F,
  71. 0x20, 0x28, 0x21, 0x29, 0x24, 0x2C, 0x25, 0x2D,
  72. 0x30, 0x38, 0x31, 0x39, 0x34, 0x3C, 0x35, 0x3D,
  73. 0x22, 0x2A, 0x23, 0x2B, 0x26, 0x2E, 0x27, 0x2F,
  74. 0x32, 0x3A, 0x33, 0x3B, 0x36, 0x3E, 0x37, 0x3F,
  75. };
  76. UINT8 permutation[64];
  77. //UINT8 invPermutation[64];
  78. void get_pixels_c(DCTELEM *block, const UINT8 *pixels, int line_size)
  79. {
  80. DCTELEM *p;
  81. const UINT8 *pix;
  82. int i;
  83. /* read the pixels */
  84. p = block;
  85. pix = pixels;
  86. for(i=0;i<8;i++) {
  87. p[0] = pix[0];
  88. p[1] = pix[1];
  89. p[2] = pix[2];
  90. p[3] = pix[3];
  91. p[4] = pix[4];
  92. p[5] = pix[5];
  93. p[6] = pix[6];
  94. p[7] = pix[7];
  95. pix += line_size;
  96. p += 8;
  97. }
  98. }
  99. void put_pixels_clamped_c(const DCTELEM *block, UINT8 *pixels, int line_size)
  100. {
  101. const DCTELEM *p;
  102. UINT8 *pix;
  103. int i;
  104. UINT8 *cm = cropTbl + MAX_NEG_CROP;
  105. /* read the pixels */
  106. p = block;
  107. pix = pixels;
  108. for(i=0;i<8;i++) {
  109. pix[0] = cm[p[0]];
  110. pix[1] = cm[p[1]];
  111. pix[2] = cm[p[2]];
  112. pix[3] = cm[p[3]];
  113. pix[4] = cm[p[4]];
  114. pix[5] = cm[p[5]];
  115. pix[6] = cm[p[6]];
  116. pix[7] = cm[p[7]];
  117. pix += line_size;
  118. p += 8;
  119. }
  120. }
  121. void add_pixels_clamped_c(const DCTELEM *block, UINT8 *pixels, int line_size)
  122. {
  123. const DCTELEM *p;
  124. UINT8 *pix;
  125. int i;
  126. UINT8 *cm = cropTbl + MAX_NEG_CROP;
  127. /* read the pixels */
  128. p = block;
  129. pix = pixels;
  130. for(i=0;i<8;i++) {
  131. pix[0] = cm[pix[0] + p[0]];
  132. pix[1] = cm[pix[1] + p[1]];
  133. pix[2] = cm[pix[2] + p[2]];
  134. pix[3] = cm[pix[3] + p[3]];
  135. pix[4] = cm[pix[4] + p[4]];
  136. pix[5] = cm[pix[5] + p[5]];
  137. pix[6] = cm[pix[6] + p[6]];
  138. pix[7] = cm[pix[7] + p[7]];
  139. pix += line_size;
  140. p += 8;
  141. }
  142. }
  143. #define PIXOP(BTYPE, OPNAME, OP, INCR) \
  144. \
  145. static void OPNAME ## _pixels(BTYPE *block, const UINT8 *pixels, int line_size, int h) \
  146. { \
  147. BTYPE *p; \
  148. const UINT8 *pix; \
  149. \
  150. p = block; \
  151. pix = pixels; \
  152. do { \
  153. OP(p[0], pix[0]); \
  154. OP(p[1], pix[1]); \
  155. OP(p[2], pix[2]); \
  156. OP(p[3], pix[3]); \
  157. OP(p[4], pix[4]); \
  158. OP(p[5], pix[5]); \
  159. OP(p[6], pix[6]); \
  160. OP(p[7], pix[7]); \
  161. pix += line_size; \
  162. p += INCR; \
  163. } while (--h);; \
  164. } \
  165. \
  166. static void OPNAME ## _pixels_x2(BTYPE *block, const UINT8 *pixels, int line_size, int h) \
  167. { \
  168. BTYPE *p; \
  169. const UINT8 *pix; \
  170. \
  171. p = block; \
  172. pix = pixels; \
  173. do { \
  174. OP(p[0], avg2(pix[0], pix[1])); \
  175. OP(p[1], avg2(pix[1], pix[2])); \
  176. OP(p[2], avg2(pix[2], pix[3])); \
  177. OP(p[3], avg2(pix[3], pix[4])); \
  178. OP(p[4], avg2(pix[4], pix[5])); \
  179. OP(p[5], avg2(pix[5], pix[6])); \
  180. OP(p[6], avg2(pix[6], pix[7])); \
  181. OP(p[7], avg2(pix[7], pix[8])); \
  182. pix += line_size; \
  183. p += INCR; \
  184. } while (--h); \
  185. } \
  186. \
  187. static void OPNAME ## _pixels_y2(BTYPE *block, const UINT8 *pixels, int line_size, int h) \
  188. { \
  189. BTYPE *p; \
  190. const UINT8 *pix; \
  191. const UINT8 *pix1; \
  192. \
  193. p = block; \
  194. pix = pixels; \
  195. pix1 = pixels + line_size; \
  196. do { \
  197. OP(p[0], avg2(pix[0], pix1[0])); \
  198. OP(p[1], avg2(pix[1], pix1[1])); \
  199. OP(p[2], avg2(pix[2], pix1[2])); \
  200. OP(p[3], avg2(pix[3], pix1[3])); \
  201. OP(p[4], avg2(pix[4], pix1[4])); \
  202. OP(p[5], avg2(pix[5], pix1[5])); \
  203. OP(p[6], avg2(pix[6], pix1[6])); \
  204. OP(p[7], avg2(pix[7], pix1[7])); \
  205. pix += line_size; \
  206. pix1 += line_size; \
  207. p += INCR; \
  208. } while(--h); \
  209. } \
  210. \
  211. static void OPNAME ## _pixels_xy2(BTYPE *block, const UINT8 *pixels, int line_size, int h) \
  212. { \
  213. BTYPE *p; \
  214. const UINT8 *pix; \
  215. const UINT8 *pix1; \
  216. \
  217. p = block; \
  218. pix = pixels; \
  219. pix1 = pixels + line_size; \
  220. do { \
  221. OP(p[0], avg4(pix[0], pix[1], pix1[0], pix1[1])); \
  222. OP(p[1], avg4(pix[1], pix[2], pix1[1], pix1[2])); \
  223. OP(p[2], avg4(pix[2], pix[3], pix1[2], pix1[3])); \
  224. OP(p[3], avg4(pix[3], pix[4], pix1[3], pix1[4])); \
  225. OP(p[4], avg4(pix[4], pix[5], pix1[4], pix1[5])); \
  226. OP(p[5], avg4(pix[5], pix[6], pix1[5], pix1[6])); \
  227. OP(p[6], avg4(pix[6], pix[7], pix1[6], pix1[7])); \
  228. OP(p[7], avg4(pix[7], pix[8], pix1[7], pix1[8])); \
  229. pix += line_size; \
  230. pix1 += line_size; \
  231. p += INCR; \
  232. } while(--h); \
  233. } \
  234. \
  235. void (*OPNAME ## _pixels_tab[4])(BTYPE *block, const UINT8 *pixels, int line_size, int h) = { \
  236. OPNAME ## _pixels, \
  237. OPNAME ## _pixels_x2, \
  238. OPNAME ## _pixels_y2, \
  239. OPNAME ## _pixels_xy2, \
  240. };
  241. /* rounding primitives */
  242. #define avg2(a,b) ((a+b+1)>>1)
  243. #define avg4(a,b,c,d) ((a+b+c+d+2)>>2)
  244. #define op_put(a, b) a = b
  245. #define op_avg(a, b) a = avg2(a, b)
  246. #define op_sub(a, b) a -= b
  247. PIXOP(UINT8, put, op_put, line_size)
  248. PIXOP(UINT8, avg, op_avg, line_size)
  249. PIXOP(DCTELEM, sub, op_sub, 8)
  250. /* not rounding primitives */
  251. #undef avg2
  252. #undef avg4
  253. #define avg2(a,b) ((a+b)>>1)
  254. #define avg4(a,b,c,d) ((a+b+c+d+1)>>2)
  255. PIXOP(UINT8, put_no_rnd, op_put, line_size)
  256. PIXOP(UINT8, avg_no_rnd, op_avg, line_size)
  257. /* motion estimation */
  258. #undef avg2
  259. #undef avg4
  260. #define avg2(a,b) ((a+b+1)>>1)
  261. #define avg4(a,b,c,d) ((a+b+c+d+2)>>2)
  262. int pix_abs16x16_c(UINT8 *pix1, UINT8 *pix2, int line_size, int h)
  263. {
  264. int s, i;
  265. s = 0;
  266. for(i=0;i<h;i++) {
  267. s += abs(pix1[0] - pix2[0]);
  268. s += abs(pix1[1] - pix2[1]);
  269. s += abs(pix1[2] - pix2[2]);
  270. s += abs(pix1[3] - pix2[3]);
  271. s += abs(pix1[4] - pix2[4]);
  272. s += abs(pix1[5] - pix2[5]);
  273. s += abs(pix1[6] - pix2[6]);
  274. s += abs(pix1[7] - pix2[7]);
  275. s += abs(pix1[8] - pix2[8]);
  276. s += abs(pix1[9] - pix2[9]);
  277. s += abs(pix1[10] - pix2[10]);
  278. s += abs(pix1[11] - pix2[11]);
  279. s += abs(pix1[12] - pix2[12]);
  280. s += abs(pix1[13] - pix2[13]);
  281. s += abs(pix1[14] - pix2[14]);
  282. s += abs(pix1[15] - pix2[15]);
  283. pix1 += line_size;
  284. pix2 += line_size;
  285. }
  286. return s;
  287. }
  288. int pix_abs16x16_x2_c(UINT8 *pix1, UINT8 *pix2, int line_size, int h)
  289. {
  290. int s, i;
  291. s = 0;
  292. for(i=0;i<h;i++) {
  293. s += abs(pix1[0] - avg2(pix2[0], pix2[1]));
  294. s += abs(pix1[1] - avg2(pix2[1], pix2[2]));
  295. s += abs(pix1[2] - avg2(pix2[2], pix2[3]));
  296. s += abs(pix1[3] - avg2(pix2[3], pix2[4]));
  297. s += abs(pix1[4] - avg2(pix2[4], pix2[5]));
  298. s += abs(pix1[5] - avg2(pix2[5], pix2[6]));
  299. s += abs(pix1[6] - avg2(pix2[6], pix2[7]));
  300. s += abs(pix1[7] - avg2(pix2[7], pix2[8]));
  301. s += abs(pix1[8] - avg2(pix2[8], pix2[9]));
  302. s += abs(pix1[9] - avg2(pix2[9], pix2[10]));
  303. s += abs(pix1[10] - avg2(pix2[10], pix2[11]));
  304. s += abs(pix1[11] - avg2(pix2[11], pix2[12]));
  305. s += abs(pix1[12] - avg2(pix2[12], pix2[13]));
  306. s += abs(pix1[13] - avg2(pix2[13], pix2[14]));
  307. s += abs(pix1[14] - avg2(pix2[14], pix2[15]));
  308. s += abs(pix1[15] - avg2(pix2[15], pix2[16]));
  309. pix1 += line_size;
  310. pix2 += line_size;
  311. }
  312. return s;
  313. }
  314. int pix_abs16x16_y2_c(UINT8 *pix1, UINT8 *pix2, int line_size, int h)
  315. {
  316. int s, i;
  317. UINT8 *pix3 = pix2 + line_size;
  318. s = 0;
  319. for(i=0;i<h;i++) {
  320. s += abs(pix1[0] - avg2(pix2[0], pix3[0]));
  321. s += abs(pix1[1] - avg2(pix2[1], pix3[1]));
  322. s += abs(pix1[2] - avg2(pix2[2], pix3[2]));
  323. s += abs(pix1[3] - avg2(pix2[3], pix3[3]));
  324. s += abs(pix1[4] - avg2(pix2[4], pix3[4]));
  325. s += abs(pix1[5] - avg2(pix2[5], pix3[5]));
  326. s += abs(pix1[6] - avg2(pix2[6], pix3[6]));
  327. s += abs(pix1[7] - avg2(pix2[7], pix3[7]));
  328. s += abs(pix1[8] - avg2(pix2[8], pix3[8]));
  329. s += abs(pix1[9] - avg2(pix2[9], pix3[9]));
  330. s += abs(pix1[10] - avg2(pix2[10], pix3[10]));
  331. s += abs(pix1[11] - avg2(pix2[11], pix3[11]));
  332. s += abs(pix1[12] - avg2(pix2[12], pix3[12]));
  333. s += abs(pix1[13] - avg2(pix2[13], pix3[13]));
  334. s += abs(pix1[14] - avg2(pix2[14], pix3[14]));
  335. s += abs(pix1[15] - avg2(pix2[15], pix3[15]));
  336. pix1 += line_size;
  337. pix2 += line_size;
  338. pix3 += line_size;
  339. }
  340. return s;
  341. }
  342. int pix_abs16x16_xy2_c(UINT8 *pix1, UINT8 *pix2, int line_size, int h)
  343. {
  344. int s, i;
  345. UINT8 *pix3 = pix2 + line_size;
  346. s = 0;
  347. for(i=0;i<h;i++) {
  348. s += abs(pix1[0] - avg4(pix2[0], pix2[1], pix3[0], pix3[1]));
  349. s += abs(pix1[1] - avg4(pix2[1], pix2[2], pix3[1], pix3[2]));
  350. s += abs(pix1[2] - avg4(pix2[2], pix2[3], pix3[2], pix3[3]));
  351. s += abs(pix1[3] - avg4(pix2[3], pix2[4], pix3[3], pix3[4]));
  352. s += abs(pix1[4] - avg4(pix2[4], pix2[5], pix3[4], pix3[5]));
  353. s += abs(pix1[5] - avg4(pix2[5], pix2[6], pix3[5], pix3[6]));
  354. s += abs(pix1[6] - avg4(pix2[6], pix2[7], pix3[6], pix3[7]));
  355. s += abs(pix1[7] - avg4(pix2[7], pix2[8], pix3[7], pix3[8]));
  356. s += abs(pix1[8] - avg4(pix2[8], pix2[9], pix3[8], pix3[9]));
  357. s += abs(pix1[9] - avg4(pix2[9], pix2[10], pix3[9], pix3[10]));
  358. s += abs(pix1[10] - avg4(pix2[10], pix2[11], pix3[10], pix3[11]));
  359. s += abs(pix1[11] - avg4(pix2[11], pix2[12], pix3[11], pix3[12]));
  360. s += abs(pix1[12] - avg4(pix2[12], pix2[13], pix3[12], pix3[13]));
  361. s += abs(pix1[13] - avg4(pix2[13], pix2[14], pix3[13], pix3[14]));
  362. s += abs(pix1[14] - avg4(pix2[14], pix2[15], pix3[14], pix3[15]));
  363. s += abs(pix1[15] - avg4(pix2[15], pix2[16], pix3[15], pix3[16]));
  364. pix1 += line_size;
  365. pix2 += line_size;
  366. pix3 += line_size;
  367. }
  368. return s;
  369. }
  370. /* permute block according so that it corresponds to the MMX idct
  371. order */
  372. #ifdef SIMPLE_IDCT
  373. /* general permutation, but perhaps slightly slower */
  374. void block_permute(INT16 *block)
  375. {
  376. int i;
  377. INT16 temp[64];
  378. for(i=0; i<64; i++) temp[ block_permute_op(i) ] = block[i];
  379. for(i=0; i<64; i++) block[i] = temp[i];
  380. }
  381. #else
  382. void block_permute(INT16 *block)
  383. {
  384. int tmp1, tmp2, tmp3, tmp4, tmp5, tmp6;
  385. int i;
  386. for(i=0;i<8;i++) {
  387. tmp1 = block[1];
  388. tmp2 = block[2];
  389. tmp3 = block[3];
  390. tmp4 = block[4];
  391. tmp5 = block[5];
  392. tmp6 = block[6];
  393. block[1] = tmp2;
  394. block[2] = tmp4;
  395. block[3] = tmp6;
  396. block[4] = tmp1;
  397. block[5] = tmp3;
  398. block[6] = tmp5;
  399. block += 8;
  400. }
  401. }
  402. #endif
  403. void dsputil_init(void)
  404. {
  405. int i, j;
  406. int use_permuted_idct;
  407. for(i=0;i<256;i++) cropTbl[i + MAX_NEG_CROP] = i;
  408. for(i=0;i<MAX_NEG_CROP;i++) {
  409. cropTbl[i] = 0;
  410. cropTbl[i + MAX_NEG_CROP + 256] = 255;
  411. }
  412. for(i=0;i<512;i++) {
  413. squareTbl[i] = (i - 256) * (i - 256);
  414. }
  415. #ifdef SIMPLE_IDCT
  416. ff_idct = simple_idct;
  417. #else
  418. ff_idct = j_rev_dct;
  419. #endif
  420. get_pixels = get_pixels_c;
  421. put_pixels_clamped = put_pixels_clamped_c;
  422. add_pixels_clamped = add_pixels_clamped_c;
  423. pix_abs16x16 = pix_abs16x16_c;
  424. pix_abs16x16_x2 = pix_abs16x16_x2_c;
  425. pix_abs16x16_y2 = pix_abs16x16_y2_c;
  426. pix_abs16x16_xy2 = pix_abs16x16_xy2_c;
  427. av_fdct = jpeg_fdct_ifast;
  428. use_permuted_idct = 1;
  429. #ifdef HAVE_MMX
  430. dsputil_init_mmx();
  431. #endif
  432. #ifdef ARCH_ARMV4L
  433. dsputil_init_armv4l();
  434. #endif
  435. #ifdef HAVE_MLIB
  436. dsputil_init_mlib();
  437. use_permuted_idct = 0;
  438. #endif
  439. #ifdef SIMPLE_IDCT
  440. if(ff_idct == simple_idct) use_permuted_idct=0;
  441. #endif
  442. if(use_permuted_idct)
  443. #ifdef SIMPLE_IDCT
  444. for(i=0; i<64; i++) permutation[i]= simple_mmx_permutation[i];
  445. #else
  446. for(i=0; i<64; i++) permutation[i]= (i & 0x38) | ((i & 6) >> 1) | ((i & 1) << 2);
  447. #endif
  448. else
  449. for(i=0; i<64; i++) permutation[i]=i;
  450. if (use_permuted_idct) {
  451. /* permute for IDCT */
  452. for(i=0;i<64;i++) {
  453. j = zigzag_direct[i];
  454. zigzag_direct[i] = block_permute_op(j);
  455. j = ff_alternate_horizontal_scan[i];
  456. ff_alternate_horizontal_scan[i] = block_permute_op(j);
  457. j = ff_alternate_vertical_scan[i];
  458. ff_alternate_vertical_scan[i] = block_permute_op(j);
  459. }
  460. block_permute(default_intra_matrix);
  461. block_permute(default_non_intra_matrix);
  462. }
  463. }