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.

1073 lines
36KB

  1. /*
  2. * DSP utils
  3. * Copyright (c) 2000, 2001 Fabrice Bellard
  4. * Copyright (c) 2002-2004 Michael Niedermayer <michaelni@gmx.at>
  5. *
  6. * This file is part of FFmpeg.
  7. *
  8. * FFmpeg 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. * FFmpeg 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 FFmpeg; if not, write to the Free Software
  20. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  21. */
  22. #include "libavutil/attributes.h"
  23. #include "libavutil/internal.h"
  24. #include "avcodec.h"
  25. #include "copy_block.h"
  26. #include "simple_idct.h"
  27. #include "me_cmp.h"
  28. #include "mpegvideo.h"
  29. #include "config.h"
  30. uint32_t ff_square_tab[512] = { 0, };
  31. static int sse4_c(MpegEncContext *v, uint8_t *pix1, uint8_t *pix2,
  32. ptrdiff_t stride, int h)
  33. {
  34. int s = 0, i;
  35. uint32_t *sq = ff_square_tab + 256;
  36. for (i = 0; i < h; i++) {
  37. s += sq[pix1[0] - pix2[0]];
  38. s += sq[pix1[1] - pix2[1]];
  39. s += sq[pix1[2] - pix2[2]];
  40. s += sq[pix1[3] - pix2[3]];
  41. pix1 += stride;
  42. pix2 += stride;
  43. }
  44. return s;
  45. }
  46. static int sse8_c(MpegEncContext *v, uint8_t *pix1, uint8_t *pix2,
  47. ptrdiff_t stride, int h)
  48. {
  49. int s = 0, i;
  50. uint32_t *sq = ff_square_tab + 256;
  51. for (i = 0; i < h; i++) {
  52. s += sq[pix1[0] - pix2[0]];
  53. s += sq[pix1[1] - pix2[1]];
  54. s += sq[pix1[2] - pix2[2]];
  55. s += sq[pix1[3] - pix2[3]];
  56. s += sq[pix1[4] - pix2[4]];
  57. s += sq[pix1[5] - pix2[5]];
  58. s += sq[pix1[6] - pix2[6]];
  59. s += sq[pix1[7] - pix2[7]];
  60. pix1 += stride;
  61. pix2 += stride;
  62. }
  63. return s;
  64. }
  65. static int sse16_c(MpegEncContext *v, uint8_t *pix1, uint8_t *pix2,
  66. ptrdiff_t stride, int h)
  67. {
  68. int s = 0, i;
  69. uint32_t *sq = ff_square_tab + 256;
  70. for (i = 0; i < h; i++) {
  71. s += sq[pix1[0] - pix2[0]];
  72. s += sq[pix1[1] - pix2[1]];
  73. s += sq[pix1[2] - pix2[2]];
  74. s += sq[pix1[3] - pix2[3]];
  75. s += sq[pix1[4] - pix2[4]];
  76. s += sq[pix1[5] - pix2[5]];
  77. s += sq[pix1[6] - pix2[6]];
  78. s += sq[pix1[7] - pix2[7]];
  79. s += sq[pix1[8] - pix2[8]];
  80. s += sq[pix1[9] - pix2[9]];
  81. s += sq[pix1[10] - pix2[10]];
  82. s += sq[pix1[11] - pix2[11]];
  83. s += sq[pix1[12] - pix2[12]];
  84. s += sq[pix1[13] - pix2[13]];
  85. s += sq[pix1[14] - pix2[14]];
  86. s += sq[pix1[15] - pix2[15]];
  87. pix1 += stride;
  88. pix2 += stride;
  89. }
  90. return s;
  91. }
  92. static int sum_abs_dctelem_c(int16_t *block)
  93. {
  94. int sum = 0, i;
  95. for (i = 0; i < 64; i++)
  96. sum += FFABS(block[i]);
  97. return sum;
  98. }
  99. #define avg2(a, b) (((a) + (b) + 1) >> 1)
  100. #define avg4(a, b, c, d) (((a) + (b) + (c) + (d) + 2) >> 2)
  101. static inline int pix_abs16_c(MpegEncContext *v, uint8_t *pix1, uint8_t *pix2,
  102. ptrdiff_t stride, int h)
  103. {
  104. int s = 0, i;
  105. for (i = 0; i < h; i++) {
  106. s += abs(pix1[0] - pix2[0]);
  107. s += abs(pix1[1] - pix2[1]);
  108. s += abs(pix1[2] - pix2[2]);
  109. s += abs(pix1[3] - pix2[3]);
  110. s += abs(pix1[4] - pix2[4]);
  111. s += abs(pix1[5] - pix2[5]);
  112. s += abs(pix1[6] - pix2[6]);
  113. s += abs(pix1[7] - pix2[7]);
  114. s += abs(pix1[8] - pix2[8]);
  115. s += abs(pix1[9] - pix2[9]);
  116. s += abs(pix1[10] - pix2[10]);
  117. s += abs(pix1[11] - pix2[11]);
  118. s += abs(pix1[12] - pix2[12]);
  119. s += abs(pix1[13] - pix2[13]);
  120. s += abs(pix1[14] - pix2[14]);
  121. s += abs(pix1[15] - pix2[15]);
  122. pix1 += stride;
  123. pix2 += stride;
  124. }
  125. return s;
  126. }
  127. static inline int pix_median_abs16_c(MpegEncContext *v, uint8_t *pix1, uint8_t *pix2,
  128. ptrdiff_t stride, int h)
  129. {
  130. int s = 0, i, j;
  131. #define V(x) (pix1[x] - pix2[x])
  132. s += abs(V(0));
  133. s += abs(V(1) - V(0));
  134. s += abs(V(2) - V(1));
  135. s += abs(V(3) - V(2));
  136. s += abs(V(4) - V(3));
  137. s += abs(V(5) - V(4));
  138. s += abs(V(6) - V(5));
  139. s += abs(V(7) - V(6));
  140. s += abs(V(8) - V(7));
  141. s += abs(V(9) - V(8));
  142. s += abs(V(10) - V(9));
  143. s += abs(V(11) - V(10));
  144. s += abs(V(12) - V(11));
  145. s += abs(V(13) - V(12));
  146. s += abs(V(14) - V(13));
  147. s += abs(V(15) - V(14));
  148. pix1 += stride;
  149. pix2 += stride;
  150. for (i = 1; i < h; i++) {
  151. s += abs(V(0) - V(-stride));
  152. for (j = 1; j < 16; j++)
  153. s += abs(V(j) - mid_pred(V(j-stride), V(j-1), V(j-stride) + V(j-1) - V(j-stride-1)));
  154. pix1 += stride;
  155. pix2 += stride;
  156. }
  157. #undef V
  158. return s;
  159. }
  160. static int pix_abs16_x2_c(MpegEncContext *v, uint8_t *pix1, uint8_t *pix2,
  161. ptrdiff_t stride, int h)
  162. {
  163. int s = 0, i;
  164. for (i = 0; i < h; i++) {
  165. s += abs(pix1[0] - avg2(pix2[0], pix2[1]));
  166. s += abs(pix1[1] - avg2(pix2[1], pix2[2]));
  167. s += abs(pix1[2] - avg2(pix2[2], pix2[3]));
  168. s += abs(pix1[3] - avg2(pix2[3], pix2[4]));
  169. s += abs(pix1[4] - avg2(pix2[4], pix2[5]));
  170. s += abs(pix1[5] - avg2(pix2[5], pix2[6]));
  171. s += abs(pix1[6] - avg2(pix2[6], pix2[7]));
  172. s += abs(pix1[7] - avg2(pix2[7], pix2[8]));
  173. s += abs(pix1[8] - avg2(pix2[8], pix2[9]));
  174. s += abs(pix1[9] - avg2(pix2[9], pix2[10]));
  175. s += abs(pix1[10] - avg2(pix2[10], pix2[11]));
  176. s += abs(pix1[11] - avg2(pix2[11], pix2[12]));
  177. s += abs(pix1[12] - avg2(pix2[12], pix2[13]));
  178. s += abs(pix1[13] - avg2(pix2[13], pix2[14]));
  179. s += abs(pix1[14] - avg2(pix2[14], pix2[15]));
  180. s += abs(pix1[15] - avg2(pix2[15], pix2[16]));
  181. pix1 += stride;
  182. pix2 += stride;
  183. }
  184. return s;
  185. }
  186. static int pix_abs16_y2_c(MpegEncContext *v, uint8_t *pix1, uint8_t *pix2,
  187. ptrdiff_t stride, int h)
  188. {
  189. int s = 0, i;
  190. uint8_t *pix3 = pix2 + stride;
  191. for (i = 0; i < h; i++) {
  192. s += abs(pix1[0] - avg2(pix2[0], pix3[0]));
  193. s += abs(pix1[1] - avg2(pix2[1], pix3[1]));
  194. s += abs(pix1[2] - avg2(pix2[2], pix3[2]));
  195. s += abs(pix1[3] - avg2(pix2[3], pix3[3]));
  196. s += abs(pix1[4] - avg2(pix2[4], pix3[4]));
  197. s += abs(pix1[5] - avg2(pix2[5], pix3[5]));
  198. s += abs(pix1[6] - avg2(pix2[6], pix3[6]));
  199. s += abs(pix1[7] - avg2(pix2[7], pix3[7]));
  200. s += abs(pix1[8] - avg2(pix2[8], pix3[8]));
  201. s += abs(pix1[9] - avg2(pix2[9], pix3[9]));
  202. s += abs(pix1[10] - avg2(pix2[10], pix3[10]));
  203. s += abs(pix1[11] - avg2(pix2[11], pix3[11]));
  204. s += abs(pix1[12] - avg2(pix2[12], pix3[12]));
  205. s += abs(pix1[13] - avg2(pix2[13], pix3[13]));
  206. s += abs(pix1[14] - avg2(pix2[14], pix3[14]));
  207. s += abs(pix1[15] - avg2(pix2[15], pix3[15]));
  208. pix1 += stride;
  209. pix2 += stride;
  210. pix3 += stride;
  211. }
  212. return s;
  213. }
  214. static int pix_abs16_xy2_c(MpegEncContext *v, uint8_t *pix1, uint8_t *pix2,
  215. ptrdiff_t stride, int h)
  216. {
  217. int s = 0, i;
  218. uint8_t *pix3 = pix2 + stride;
  219. for (i = 0; i < h; i++) {
  220. s += abs(pix1[0] - avg4(pix2[0], pix2[1], pix3[0], pix3[1]));
  221. s += abs(pix1[1] - avg4(pix2[1], pix2[2], pix3[1], pix3[2]));
  222. s += abs(pix1[2] - avg4(pix2[2], pix2[3], pix3[2], pix3[3]));
  223. s += abs(pix1[3] - avg4(pix2[3], pix2[4], pix3[3], pix3[4]));
  224. s += abs(pix1[4] - avg4(pix2[4], pix2[5], pix3[4], pix3[5]));
  225. s += abs(pix1[5] - avg4(pix2[5], pix2[6], pix3[5], pix3[6]));
  226. s += abs(pix1[6] - avg4(pix2[6], pix2[7], pix3[6], pix3[7]));
  227. s += abs(pix1[7] - avg4(pix2[7], pix2[8], pix3[7], pix3[8]));
  228. s += abs(pix1[8] - avg4(pix2[8], pix2[9], pix3[8], pix3[9]));
  229. s += abs(pix1[9] - avg4(pix2[9], pix2[10], pix3[9], pix3[10]));
  230. s += abs(pix1[10] - avg4(pix2[10], pix2[11], pix3[10], pix3[11]));
  231. s += abs(pix1[11] - avg4(pix2[11], pix2[12], pix3[11], pix3[12]));
  232. s += abs(pix1[12] - avg4(pix2[12], pix2[13], pix3[12], pix3[13]));
  233. s += abs(pix1[13] - avg4(pix2[13], pix2[14], pix3[13], pix3[14]));
  234. s += abs(pix1[14] - avg4(pix2[14], pix2[15], pix3[14], pix3[15]));
  235. s += abs(pix1[15] - avg4(pix2[15], pix2[16], pix3[15], pix3[16]));
  236. pix1 += stride;
  237. pix2 += stride;
  238. pix3 += stride;
  239. }
  240. return s;
  241. }
  242. static inline int pix_abs8_c(MpegEncContext *v, uint8_t *pix1, uint8_t *pix2,
  243. ptrdiff_t stride, int h)
  244. {
  245. int s = 0, i;
  246. for (i = 0; i < h; i++) {
  247. s += abs(pix1[0] - pix2[0]);
  248. s += abs(pix1[1] - pix2[1]);
  249. s += abs(pix1[2] - pix2[2]);
  250. s += abs(pix1[3] - pix2[3]);
  251. s += abs(pix1[4] - pix2[4]);
  252. s += abs(pix1[5] - pix2[5]);
  253. s += abs(pix1[6] - pix2[6]);
  254. s += abs(pix1[7] - pix2[7]);
  255. pix1 += stride;
  256. pix2 += stride;
  257. }
  258. return s;
  259. }
  260. static inline int pix_median_abs8_c(MpegEncContext *v, uint8_t *pix1, uint8_t *pix2,
  261. ptrdiff_t stride, int h)
  262. {
  263. int s = 0, i, j;
  264. #define V(x) (pix1[x] - pix2[x])
  265. s += abs(V(0));
  266. s += abs(V(1) - V(0));
  267. s += abs(V(2) - V(1));
  268. s += abs(V(3) - V(2));
  269. s += abs(V(4) - V(3));
  270. s += abs(V(5) - V(4));
  271. s += abs(V(6) - V(5));
  272. s += abs(V(7) - V(6));
  273. pix1 += stride;
  274. pix2 += stride;
  275. for (i = 1; i < h; i++) {
  276. s += abs(V(0) - V(-stride));
  277. for (j = 1; j < 8; j++)
  278. s += abs(V(j) - mid_pred(V(j-stride), V(j-1), V(j-stride) + V(j-1) - V(j-stride-1)));
  279. pix1 += stride;
  280. pix2 += stride;
  281. }
  282. #undef V
  283. return s;
  284. }
  285. static int pix_abs8_x2_c(MpegEncContext *v, uint8_t *pix1, uint8_t *pix2,
  286. ptrdiff_t stride, int h)
  287. {
  288. int s = 0, i;
  289. for (i = 0; i < h; i++) {
  290. s += abs(pix1[0] - avg2(pix2[0], pix2[1]));
  291. s += abs(pix1[1] - avg2(pix2[1], pix2[2]));
  292. s += abs(pix1[2] - avg2(pix2[2], pix2[3]));
  293. s += abs(pix1[3] - avg2(pix2[3], pix2[4]));
  294. s += abs(pix1[4] - avg2(pix2[4], pix2[5]));
  295. s += abs(pix1[5] - avg2(pix2[5], pix2[6]));
  296. s += abs(pix1[6] - avg2(pix2[6], pix2[7]));
  297. s += abs(pix1[7] - avg2(pix2[7], pix2[8]));
  298. pix1 += stride;
  299. pix2 += stride;
  300. }
  301. return s;
  302. }
  303. static int pix_abs8_y2_c(MpegEncContext *v, uint8_t *pix1, uint8_t *pix2,
  304. ptrdiff_t stride, int h)
  305. {
  306. int s = 0, i;
  307. uint8_t *pix3 = pix2 + stride;
  308. for (i = 0; i < h; i++) {
  309. s += abs(pix1[0] - avg2(pix2[0], pix3[0]));
  310. s += abs(pix1[1] - avg2(pix2[1], pix3[1]));
  311. s += abs(pix1[2] - avg2(pix2[2], pix3[2]));
  312. s += abs(pix1[3] - avg2(pix2[3], pix3[3]));
  313. s += abs(pix1[4] - avg2(pix2[4], pix3[4]));
  314. s += abs(pix1[5] - avg2(pix2[5], pix3[5]));
  315. s += abs(pix1[6] - avg2(pix2[6], pix3[6]));
  316. s += abs(pix1[7] - avg2(pix2[7], pix3[7]));
  317. pix1 += stride;
  318. pix2 += stride;
  319. pix3 += stride;
  320. }
  321. return s;
  322. }
  323. static int pix_abs8_xy2_c(MpegEncContext *v, uint8_t *pix1, uint8_t *pix2,
  324. ptrdiff_t stride, int h)
  325. {
  326. int s = 0, i;
  327. uint8_t *pix3 = pix2 + stride;
  328. for (i = 0; i < h; i++) {
  329. s += abs(pix1[0] - avg4(pix2[0], pix2[1], pix3[0], pix3[1]));
  330. s += abs(pix1[1] - avg4(pix2[1], pix2[2], pix3[1], pix3[2]));
  331. s += abs(pix1[2] - avg4(pix2[2], pix2[3], pix3[2], pix3[3]));
  332. s += abs(pix1[3] - avg4(pix2[3], pix2[4], pix3[3], pix3[4]));
  333. s += abs(pix1[4] - avg4(pix2[4], pix2[5], pix3[4], pix3[5]));
  334. s += abs(pix1[5] - avg4(pix2[5], pix2[6], pix3[5], pix3[6]));
  335. s += abs(pix1[6] - avg4(pix2[6], pix2[7], pix3[6], pix3[7]));
  336. s += abs(pix1[7] - avg4(pix2[7], pix2[8], pix3[7], pix3[8]));
  337. pix1 += stride;
  338. pix2 += stride;
  339. pix3 += stride;
  340. }
  341. return s;
  342. }
  343. static int nsse16_c(MpegEncContext *c, uint8_t *s1, uint8_t *s2,
  344. ptrdiff_t stride, int h)
  345. {
  346. int score1 = 0, score2 = 0, x, y;
  347. for (y = 0; y < h; y++) {
  348. for (x = 0; x < 16; x++)
  349. score1 += (s1[x] - s2[x]) * (s1[x] - s2[x]);
  350. if (y + 1 < h) {
  351. for (x = 0; x < 15; x++)
  352. score2 += FFABS(s1[x] - s1[x + stride] -
  353. s1[x + 1] + s1[x + stride + 1]) -
  354. FFABS(s2[x] - s2[x + stride] -
  355. s2[x + 1] + s2[x + stride + 1]);
  356. }
  357. s1 += stride;
  358. s2 += stride;
  359. }
  360. if (c)
  361. return score1 + FFABS(score2) * c->avctx->nsse_weight;
  362. else
  363. return score1 + FFABS(score2) * 8;
  364. }
  365. static int nsse8_c(MpegEncContext *c, uint8_t *s1, uint8_t *s2,
  366. ptrdiff_t stride, int h)
  367. {
  368. int score1 = 0, score2 = 0, x, y;
  369. for (y = 0; y < h; y++) {
  370. for (x = 0; x < 8; x++)
  371. score1 += (s1[x] - s2[x]) * (s1[x] - s2[x]);
  372. if (y + 1 < h) {
  373. for (x = 0; x < 7; x++)
  374. score2 += FFABS(s1[x] - s1[x + stride] -
  375. s1[x + 1] + s1[x + stride + 1]) -
  376. FFABS(s2[x] - s2[x + stride] -
  377. s2[x + 1] + s2[x + stride + 1]);
  378. }
  379. s1 += stride;
  380. s2 += stride;
  381. }
  382. if (c)
  383. return score1 + FFABS(score2) * c->avctx->nsse_weight;
  384. else
  385. return score1 + FFABS(score2) * 8;
  386. }
  387. static int zero_cmp(MpegEncContext *s, uint8_t *a, uint8_t *b,
  388. ptrdiff_t stride, int h)
  389. {
  390. return 0;
  391. }
  392. void ff_set_cmp(MECmpContext *c, me_cmp_func *cmp, int type)
  393. {
  394. int i;
  395. memset(cmp, 0, sizeof(void *) * 6);
  396. for (i = 0; i < 6; i++) {
  397. switch (type & 0xFF) {
  398. case FF_CMP_SAD:
  399. cmp[i] = c->sad[i];
  400. break;
  401. case FF_CMP_MEDIAN_SAD:
  402. cmp[i] = c->median_sad[i];
  403. break;
  404. case FF_CMP_SATD:
  405. cmp[i] = c->hadamard8_diff[i];
  406. break;
  407. case FF_CMP_SSE:
  408. cmp[i] = c->sse[i];
  409. break;
  410. case FF_CMP_DCT:
  411. cmp[i] = c->dct_sad[i];
  412. break;
  413. case FF_CMP_DCT264:
  414. cmp[i] = c->dct264_sad[i];
  415. break;
  416. case FF_CMP_DCTMAX:
  417. cmp[i] = c->dct_max[i];
  418. break;
  419. case FF_CMP_PSNR:
  420. cmp[i] = c->quant_psnr[i];
  421. break;
  422. case FF_CMP_BIT:
  423. cmp[i] = c->bit[i];
  424. break;
  425. case FF_CMP_RD:
  426. cmp[i] = c->rd[i];
  427. break;
  428. case FF_CMP_VSAD:
  429. cmp[i] = c->vsad[i];
  430. break;
  431. case FF_CMP_VSSE:
  432. cmp[i] = c->vsse[i];
  433. break;
  434. case FF_CMP_ZERO:
  435. cmp[i] = zero_cmp;
  436. break;
  437. case FF_CMP_NSSE:
  438. cmp[i] = c->nsse[i];
  439. break;
  440. #if CONFIG_DWT
  441. case FF_CMP_W53:
  442. cmp[i]= c->w53[i];
  443. break;
  444. case FF_CMP_W97:
  445. cmp[i]= c->w97[i];
  446. break;
  447. #endif
  448. default:
  449. av_log(NULL, AV_LOG_ERROR,
  450. "internal error in cmp function selection\n");
  451. }
  452. }
  453. }
  454. #define BUTTERFLY2(o1, o2, i1, i2) \
  455. o1 = (i1) + (i2); \
  456. o2 = (i1) - (i2);
  457. #define BUTTERFLY1(x, y) \
  458. { \
  459. int a, b; \
  460. a = x; \
  461. b = y; \
  462. x = a + b; \
  463. y = a - b; \
  464. }
  465. #define BUTTERFLYA(x, y) (FFABS((x) + (y)) + FFABS((x) - (y)))
  466. static int hadamard8_diff8x8_c(MpegEncContext *s, uint8_t *dst,
  467. uint8_t *src, ptrdiff_t stride, int h)
  468. {
  469. int i, temp[64], sum = 0;
  470. av_assert2(h == 8);
  471. for (i = 0; i < 8; i++) {
  472. // FIXME: try pointer walks
  473. BUTTERFLY2(temp[8 * i + 0], temp[8 * i + 1],
  474. src[stride * i + 0] - dst[stride * i + 0],
  475. src[stride * i + 1] - dst[stride * i + 1]);
  476. BUTTERFLY2(temp[8 * i + 2], temp[8 * i + 3],
  477. src[stride * i + 2] - dst[stride * i + 2],
  478. src[stride * i + 3] - dst[stride * i + 3]);
  479. BUTTERFLY2(temp[8 * i + 4], temp[8 * i + 5],
  480. src[stride * i + 4] - dst[stride * i + 4],
  481. src[stride * i + 5] - dst[stride * i + 5]);
  482. BUTTERFLY2(temp[8 * i + 6], temp[8 * i + 7],
  483. src[stride * i + 6] - dst[stride * i + 6],
  484. src[stride * i + 7] - dst[stride * i + 7]);
  485. BUTTERFLY1(temp[8 * i + 0], temp[8 * i + 2]);
  486. BUTTERFLY1(temp[8 * i + 1], temp[8 * i + 3]);
  487. BUTTERFLY1(temp[8 * i + 4], temp[8 * i + 6]);
  488. BUTTERFLY1(temp[8 * i + 5], temp[8 * i + 7]);
  489. BUTTERFLY1(temp[8 * i + 0], temp[8 * i + 4]);
  490. BUTTERFLY1(temp[8 * i + 1], temp[8 * i + 5]);
  491. BUTTERFLY1(temp[8 * i + 2], temp[8 * i + 6]);
  492. BUTTERFLY1(temp[8 * i + 3], temp[8 * i + 7]);
  493. }
  494. for (i = 0; i < 8; i++) {
  495. BUTTERFLY1(temp[8 * 0 + i], temp[8 * 1 + i]);
  496. BUTTERFLY1(temp[8 * 2 + i], temp[8 * 3 + i]);
  497. BUTTERFLY1(temp[8 * 4 + i], temp[8 * 5 + i]);
  498. BUTTERFLY1(temp[8 * 6 + i], temp[8 * 7 + i]);
  499. BUTTERFLY1(temp[8 * 0 + i], temp[8 * 2 + i]);
  500. BUTTERFLY1(temp[8 * 1 + i], temp[8 * 3 + i]);
  501. BUTTERFLY1(temp[8 * 4 + i], temp[8 * 6 + i]);
  502. BUTTERFLY1(temp[8 * 5 + i], temp[8 * 7 + i]);
  503. sum += BUTTERFLYA(temp[8 * 0 + i], temp[8 * 4 + i]) +
  504. BUTTERFLYA(temp[8 * 1 + i], temp[8 * 5 + i]) +
  505. BUTTERFLYA(temp[8 * 2 + i], temp[8 * 6 + i]) +
  506. BUTTERFLYA(temp[8 * 3 + i], temp[8 * 7 + i]);
  507. }
  508. return sum;
  509. }
  510. static int hadamard8_intra8x8_c(MpegEncContext *s, uint8_t *src,
  511. uint8_t *dummy, ptrdiff_t stride, int h)
  512. {
  513. int i, temp[64], sum = 0;
  514. av_assert2(h == 8);
  515. for (i = 0; i < 8; i++) {
  516. // FIXME: try pointer walks
  517. BUTTERFLY2(temp[8 * i + 0], temp[8 * i + 1],
  518. src[stride * i + 0], src[stride * i + 1]);
  519. BUTTERFLY2(temp[8 * i + 2], temp[8 * i + 3],
  520. src[stride * i + 2], src[stride * i + 3]);
  521. BUTTERFLY2(temp[8 * i + 4], temp[8 * i + 5],
  522. src[stride * i + 4], src[stride * i + 5]);
  523. BUTTERFLY2(temp[8 * i + 6], temp[8 * i + 7],
  524. src[stride * i + 6], src[stride * i + 7]);
  525. BUTTERFLY1(temp[8 * i + 0], temp[8 * i + 2]);
  526. BUTTERFLY1(temp[8 * i + 1], temp[8 * i + 3]);
  527. BUTTERFLY1(temp[8 * i + 4], temp[8 * i + 6]);
  528. BUTTERFLY1(temp[8 * i + 5], temp[8 * i + 7]);
  529. BUTTERFLY1(temp[8 * i + 0], temp[8 * i + 4]);
  530. BUTTERFLY1(temp[8 * i + 1], temp[8 * i + 5]);
  531. BUTTERFLY1(temp[8 * i + 2], temp[8 * i + 6]);
  532. BUTTERFLY1(temp[8 * i + 3], temp[8 * i + 7]);
  533. }
  534. for (i = 0; i < 8; i++) {
  535. BUTTERFLY1(temp[8 * 0 + i], temp[8 * 1 + i]);
  536. BUTTERFLY1(temp[8 * 2 + i], temp[8 * 3 + i]);
  537. BUTTERFLY1(temp[8 * 4 + i], temp[8 * 5 + i]);
  538. BUTTERFLY1(temp[8 * 6 + i], temp[8 * 7 + i]);
  539. BUTTERFLY1(temp[8 * 0 + i], temp[8 * 2 + i]);
  540. BUTTERFLY1(temp[8 * 1 + i], temp[8 * 3 + i]);
  541. BUTTERFLY1(temp[8 * 4 + i], temp[8 * 6 + i]);
  542. BUTTERFLY1(temp[8 * 5 + i], temp[8 * 7 + i]);
  543. sum +=
  544. BUTTERFLYA(temp[8 * 0 + i], temp[8 * 4 + i])
  545. + BUTTERFLYA(temp[8 * 1 + i], temp[8 * 5 + i])
  546. + BUTTERFLYA(temp[8 * 2 + i], temp[8 * 6 + i])
  547. + BUTTERFLYA(temp[8 * 3 + i], temp[8 * 7 + i]);
  548. }
  549. sum -= FFABS(temp[8 * 0] + temp[8 * 4]); // -mean
  550. return sum;
  551. }
  552. static int dct_sad8x8_c(MpegEncContext *s, uint8_t *src1,
  553. uint8_t *src2, ptrdiff_t stride, int h)
  554. {
  555. LOCAL_ALIGNED_16(int16_t, temp, [64]);
  556. av_assert2(h == 8);
  557. s->pdsp.diff_pixels_unaligned(temp, src1, src2, stride);
  558. s->fdsp.fdct(temp);
  559. return s->mecc.sum_abs_dctelem(temp);
  560. }
  561. #if CONFIG_GPL
  562. #define DCT8_1D \
  563. { \
  564. const int s07 = SRC(0) + SRC(7); \
  565. const int s16 = SRC(1) + SRC(6); \
  566. const int s25 = SRC(2) + SRC(5); \
  567. const int s34 = SRC(3) + SRC(4); \
  568. const int a0 = s07 + s34; \
  569. const int a1 = s16 + s25; \
  570. const int a2 = s07 - s34; \
  571. const int a3 = s16 - s25; \
  572. const int d07 = SRC(0) - SRC(7); \
  573. const int d16 = SRC(1) - SRC(6); \
  574. const int d25 = SRC(2) - SRC(5); \
  575. const int d34 = SRC(3) - SRC(4); \
  576. const int a4 = d16 + d25 + (d07 + (d07 >> 1)); \
  577. const int a5 = d07 - d34 - (d25 + (d25 >> 1)); \
  578. const int a6 = d07 + d34 - (d16 + (d16 >> 1)); \
  579. const int a7 = d16 - d25 + (d34 + (d34 >> 1)); \
  580. DST(0, a0 + a1); \
  581. DST(1, a4 + (a7 >> 2)); \
  582. DST(2, a2 + (a3 >> 1)); \
  583. DST(3, a5 + (a6 >> 2)); \
  584. DST(4, a0 - a1); \
  585. DST(5, a6 - (a5 >> 2)); \
  586. DST(6, (a2 >> 1) - a3); \
  587. DST(7, (a4 >> 2) - a7); \
  588. }
  589. static int dct264_sad8x8_c(MpegEncContext *s, uint8_t *src1,
  590. uint8_t *src2, ptrdiff_t stride, int h)
  591. {
  592. int16_t dct[8][8];
  593. int i, sum = 0;
  594. s->pdsp.diff_pixels_unaligned(dct[0], src1, src2, stride);
  595. #define SRC(x) dct[i][x]
  596. #define DST(x, v) dct[i][x] = v
  597. for (i = 0; i < 8; i++)
  598. DCT8_1D
  599. #undef SRC
  600. #undef DST
  601. #define SRC(x) dct[x][i]
  602. #define DST(x, v) sum += FFABS(v)
  603. for (i = 0; i < 8; i++)
  604. DCT8_1D
  605. #undef SRC
  606. #undef DST
  607. return sum;
  608. }
  609. #endif
  610. static int dct_max8x8_c(MpegEncContext *s, uint8_t *src1,
  611. uint8_t *src2, ptrdiff_t stride, int h)
  612. {
  613. LOCAL_ALIGNED_16(int16_t, temp, [64]);
  614. int sum = 0, i;
  615. av_assert2(h == 8);
  616. s->pdsp.diff_pixels_unaligned(temp, src1, src2, stride);
  617. s->fdsp.fdct(temp);
  618. for (i = 0; i < 64; i++)
  619. sum = FFMAX(sum, FFABS(temp[i]));
  620. return sum;
  621. }
  622. static int quant_psnr8x8_c(MpegEncContext *s, uint8_t *src1,
  623. uint8_t *src2, ptrdiff_t stride, int h)
  624. {
  625. LOCAL_ALIGNED_16(int16_t, temp, [64 * 2]);
  626. int16_t *const bak = temp + 64;
  627. int sum = 0, i;
  628. av_assert2(h == 8);
  629. s->mb_intra = 0;
  630. s->pdsp.diff_pixels_unaligned(temp, src1, src2, stride);
  631. memcpy(bak, temp, 64 * sizeof(int16_t));
  632. s->block_last_index[0 /* FIXME */] =
  633. s->fast_dct_quantize(s, temp, 0 /* FIXME */, s->qscale, &i);
  634. s->dct_unquantize_inter(s, temp, 0, s->qscale);
  635. ff_simple_idct_8(temp); // FIXME
  636. for (i = 0; i < 64; i++)
  637. sum += (temp[i] - bak[i]) * (temp[i] - bak[i]);
  638. return sum;
  639. }
  640. static int rd8x8_c(MpegEncContext *s, uint8_t *src1, uint8_t *src2,
  641. ptrdiff_t stride, int h)
  642. {
  643. const uint8_t *scantable = s->intra_scantable.permutated;
  644. LOCAL_ALIGNED_16(int16_t, temp, [64]);
  645. LOCAL_ALIGNED_16(uint8_t, lsrc1, [64]);
  646. LOCAL_ALIGNED_16(uint8_t, lsrc2, [64]);
  647. int i, last, run, bits, level, distortion, start_i;
  648. const int esc_length = s->ac_esc_length;
  649. uint8_t *length, *last_length;
  650. av_assert2(h == 8);
  651. copy_block8(lsrc1, src1, 8, stride, 8);
  652. copy_block8(lsrc2, src2, 8, stride, 8);
  653. s->pdsp.diff_pixels(temp, lsrc1, lsrc2, 8);
  654. s->block_last_index[0 /* FIXME */] =
  655. last =
  656. s->fast_dct_quantize(s, temp, 0 /* FIXME */, s->qscale, &i);
  657. bits = 0;
  658. if (s->mb_intra) {
  659. start_i = 1;
  660. length = s->intra_ac_vlc_length;
  661. last_length = s->intra_ac_vlc_last_length;
  662. bits += s->luma_dc_vlc_length[temp[0] + 256]; // FIXME: chroma
  663. } else {
  664. start_i = 0;
  665. length = s->inter_ac_vlc_length;
  666. last_length = s->inter_ac_vlc_last_length;
  667. }
  668. if (last >= start_i) {
  669. run = 0;
  670. for (i = start_i; i < last; i++) {
  671. int j = scantable[i];
  672. level = temp[j];
  673. if (level) {
  674. level += 64;
  675. if ((level & (~127)) == 0)
  676. bits += length[UNI_AC_ENC_INDEX(run, level)];
  677. else
  678. bits += esc_length;
  679. run = 0;
  680. } else
  681. run++;
  682. }
  683. i = scantable[last];
  684. level = temp[i] + 64;
  685. av_assert2(level - 64);
  686. if ((level & (~127)) == 0) {
  687. bits += last_length[UNI_AC_ENC_INDEX(run, level)];
  688. } else
  689. bits += esc_length;
  690. }
  691. if (last >= 0) {
  692. if (s->mb_intra)
  693. s->dct_unquantize_intra(s, temp, 0, s->qscale);
  694. else
  695. s->dct_unquantize_inter(s, temp, 0, s->qscale);
  696. }
  697. s->idsp.idct_add(lsrc2, 8, temp);
  698. distortion = s->mecc.sse[1](NULL, lsrc2, lsrc1, 8, 8);
  699. return distortion + ((bits * s->qscale * s->qscale * 109 + 64) >> 7);
  700. }
  701. static int bit8x8_c(MpegEncContext *s, uint8_t *src1, uint8_t *src2,
  702. ptrdiff_t stride, int h)
  703. {
  704. const uint8_t *scantable = s->intra_scantable.permutated;
  705. LOCAL_ALIGNED_16(int16_t, temp, [64]);
  706. int i, last, run, bits, level, start_i;
  707. const int esc_length = s->ac_esc_length;
  708. uint8_t *length, *last_length;
  709. av_assert2(h == 8);
  710. s->pdsp.diff_pixels_unaligned(temp, src1, src2, stride);
  711. s->block_last_index[0 /* FIXME */] =
  712. last =
  713. s->fast_dct_quantize(s, temp, 0 /* FIXME */, s->qscale, &i);
  714. bits = 0;
  715. if (s->mb_intra) {
  716. start_i = 1;
  717. length = s->intra_ac_vlc_length;
  718. last_length = s->intra_ac_vlc_last_length;
  719. bits += s->luma_dc_vlc_length[temp[0] + 256]; // FIXME: chroma
  720. } else {
  721. start_i = 0;
  722. length = s->inter_ac_vlc_length;
  723. last_length = s->inter_ac_vlc_last_length;
  724. }
  725. if (last >= start_i) {
  726. run = 0;
  727. for (i = start_i; i < last; i++) {
  728. int j = scantable[i];
  729. level = temp[j];
  730. if (level) {
  731. level += 64;
  732. if ((level & (~127)) == 0)
  733. bits += length[UNI_AC_ENC_INDEX(run, level)];
  734. else
  735. bits += esc_length;
  736. run = 0;
  737. } else
  738. run++;
  739. }
  740. i = scantable[last];
  741. level = temp[i] + 64;
  742. av_assert2(level - 64);
  743. if ((level & (~127)) == 0)
  744. bits += last_length[UNI_AC_ENC_INDEX(run, level)];
  745. else
  746. bits += esc_length;
  747. }
  748. return bits;
  749. }
  750. #define VSAD_INTRA(size) \
  751. static int vsad_intra ## size ## _c(MpegEncContext *c, \
  752. uint8_t *s, uint8_t *dummy, \
  753. ptrdiff_t stride, int h) \
  754. { \
  755. int score = 0, x, y; \
  756. \
  757. for (y = 1; y < h; y++) { \
  758. for (x = 0; x < size; x += 4) { \
  759. score += FFABS(s[x] - s[x + stride]) + \
  760. FFABS(s[x + 1] - s[x + stride + 1]) + \
  761. FFABS(s[x + 2] - s[x + 2 + stride]) + \
  762. FFABS(s[x + 3] - s[x + 3 + stride]); \
  763. } \
  764. s += stride; \
  765. } \
  766. \
  767. return score; \
  768. }
  769. VSAD_INTRA(8)
  770. VSAD_INTRA(16)
  771. #define VSAD(size) \
  772. static int vsad ## size ## _c(MpegEncContext *c, \
  773. uint8_t *s1, uint8_t *s2, \
  774. ptrdiff_t stride, int h) \
  775. { \
  776. int score = 0, x, y; \
  777. \
  778. for (y = 1; y < h; y++) { \
  779. for (x = 0; x < size; x++) \
  780. score += FFABS(s1[x] - s2[x] - s1[x + stride] + s2[x + stride]); \
  781. s1 += stride; \
  782. s2 += stride; \
  783. } \
  784. \
  785. return score; \
  786. }
  787. VSAD(8)
  788. VSAD(16)
  789. #define SQ(a) ((a) * (a))
  790. #define VSSE_INTRA(size) \
  791. static int vsse_intra ## size ## _c(MpegEncContext *c, \
  792. uint8_t *s, uint8_t *dummy, \
  793. ptrdiff_t stride, int h) \
  794. { \
  795. int score = 0, x, y; \
  796. \
  797. for (y = 1; y < h; y++) { \
  798. for (x = 0; x < size; x += 4) { \
  799. score += SQ(s[x] - s[x + stride]) + \
  800. SQ(s[x + 1] - s[x + stride + 1]) + \
  801. SQ(s[x + 2] - s[x + stride + 2]) + \
  802. SQ(s[x + 3] - s[x + stride + 3]); \
  803. } \
  804. s += stride; \
  805. } \
  806. \
  807. return score; \
  808. }
  809. VSSE_INTRA(8)
  810. VSSE_INTRA(16)
  811. #define VSSE(size) \
  812. static int vsse ## size ## _c(MpegEncContext *c, uint8_t *s1, uint8_t *s2, \
  813. ptrdiff_t stride, int h) \
  814. { \
  815. int score = 0, x, y; \
  816. \
  817. for (y = 1; y < h; y++) { \
  818. for (x = 0; x < size; x++) \
  819. score += SQ(s1[x] - s2[x] - s1[x + stride] + s2[x + stride]); \
  820. s1 += stride; \
  821. s2 += stride; \
  822. } \
  823. \
  824. return score; \
  825. }
  826. VSSE(8)
  827. VSSE(16)
  828. #define WRAPPER8_16_SQ(name8, name16) \
  829. static int name16(MpegEncContext *s, uint8_t *dst, uint8_t *src, \
  830. ptrdiff_t stride, int h) \
  831. { \
  832. int score = 0; \
  833. \
  834. score += name8(s, dst, src, stride, 8); \
  835. score += name8(s, dst + 8, src + 8, stride, 8); \
  836. if (h == 16) { \
  837. dst += 8 * stride; \
  838. src += 8 * stride; \
  839. score += name8(s, dst, src, stride, 8); \
  840. score += name8(s, dst + 8, src + 8, stride, 8); \
  841. } \
  842. return score; \
  843. }
  844. WRAPPER8_16_SQ(hadamard8_diff8x8_c, hadamard8_diff16_c)
  845. WRAPPER8_16_SQ(hadamard8_intra8x8_c, hadamard8_intra16_c)
  846. WRAPPER8_16_SQ(dct_sad8x8_c, dct_sad16_c)
  847. #if CONFIG_GPL
  848. WRAPPER8_16_SQ(dct264_sad8x8_c, dct264_sad16_c)
  849. #endif
  850. WRAPPER8_16_SQ(dct_max8x8_c, dct_max16_c)
  851. WRAPPER8_16_SQ(quant_psnr8x8_c, quant_psnr16_c)
  852. WRAPPER8_16_SQ(rd8x8_c, rd16_c)
  853. WRAPPER8_16_SQ(bit8x8_c, bit16_c)
  854. av_cold void ff_me_cmp_init_static(void)
  855. {
  856. int i;
  857. for (i = 0; i < 512; i++)
  858. ff_square_tab[i] = (i - 256) * (i - 256);
  859. }
  860. int ff_check_alignment(void)
  861. {
  862. static int did_fail = 0;
  863. LOCAL_ALIGNED_16(int, aligned, [4]);
  864. if ((intptr_t)aligned & 15) {
  865. if (!did_fail) {
  866. #if HAVE_MMX || HAVE_ALTIVEC
  867. av_log(NULL, AV_LOG_ERROR,
  868. "Compiler did not align stack variables. Libavcodec has been miscompiled\n"
  869. "and may be very slow or crash. This is not a bug in libavcodec,\n"
  870. "but in the compiler. You may try recompiling using gcc >= 4.2.\n"
  871. "Do not report crashes to FFmpeg developers.\n");
  872. #endif
  873. did_fail=1;
  874. }
  875. return -1;
  876. }
  877. return 0;
  878. }
  879. av_cold void ff_me_cmp_init(MECmpContext *c, AVCodecContext *avctx)
  880. {
  881. ff_check_alignment();
  882. c->sum_abs_dctelem = sum_abs_dctelem_c;
  883. /* TODO [0] 16 [1] 8 */
  884. c->pix_abs[0][0] = pix_abs16_c;
  885. c->pix_abs[0][1] = pix_abs16_x2_c;
  886. c->pix_abs[0][2] = pix_abs16_y2_c;
  887. c->pix_abs[0][3] = pix_abs16_xy2_c;
  888. c->pix_abs[1][0] = pix_abs8_c;
  889. c->pix_abs[1][1] = pix_abs8_x2_c;
  890. c->pix_abs[1][2] = pix_abs8_y2_c;
  891. c->pix_abs[1][3] = pix_abs8_xy2_c;
  892. #define SET_CMP_FUNC(name) \
  893. c->name[0] = name ## 16_c; \
  894. c->name[1] = name ## 8x8_c;
  895. SET_CMP_FUNC(hadamard8_diff)
  896. c->hadamard8_diff[4] = hadamard8_intra16_c;
  897. c->hadamard8_diff[5] = hadamard8_intra8x8_c;
  898. SET_CMP_FUNC(dct_sad)
  899. SET_CMP_FUNC(dct_max)
  900. #if CONFIG_GPL
  901. SET_CMP_FUNC(dct264_sad)
  902. #endif
  903. c->sad[0] = pix_abs16_c;
  904. c->sad[1] = pix_abs8_c;
  905. c->sse[0] = sse16_c;
  906. c->sse[1] = sse8_c;
  907. c->sse[2] = sse4_c;
  908. SET_CMP_FUNC(quant_psnr)
  909. SET_CMP_FUNC(rd)
  910. SET_CMP_FUNC(bit)
  911. c->vsad[0] = vsad16_c;
  912. c->vsad[1] = vsad8_c;
  913. c->vsad[4] = vsad_intra16_c;
  914. c->vsad[5] = vsad_intra8_c;
  915. c->vsse[0] = vsse16_c;
  916. c->vsse[1] = vsse8_c;
  917. c->vsse[4] = vsse_intra16_c;
  918. c->vsse[5] = vsse_intra8_c;
  919. c->nsse[0] = nsse16_c;
  920. c->nsse[1] = nsse8_c;
  921. #if CONFIG_SNOW_DECODER || CONFIG_SNOW_ENCODER
  922. ff_dsputil_init_dwt(c);
  923. #endif
  924. if (ARCH_ALPHA)
  925. ff_me_cmp_init_alpha(c, avctx);
  926. if (ARCH_ARM)
  927. ff_me_cmp_init_arm(c, avctx);
  928. if (ARCH_PPC)
  929. ff_me_cmp_init_ppc(c, avctx);
  930. if (ARCH_X86)
  931. ff_me_cmp_init_x86(c, avctx);
  932. if (ARCH_MIPS)
  933. ff_me_cmp_init_mips(c, avctx);
  934. c->median_sad[0] = pix_median_abs16_c;
  935. c->median_sad[1] = pix_median_abs8_c;
  936. }