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.

530 lines
21KB

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