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.

955 lines
32KB

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