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.

995 lines
33KB

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