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.

287 lines
11KB

  1. /*
  2. * Copyright (c) 2015 Ronald S. Bultje <rsbultje@gmail.com>
  3. *
  4. * This file is part of Libav.
  5. *
  6. * Libav is free software; you can redistribute it and/or modify
  7. * it under the terms of the GNU General Public License as published by
  8. * the Free Software Foundation; either version 2 of the License, or
  9. * (at your option) any later version.
  10. *
  11. * Libav is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. * GNU General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU General Public License along
  17. * with Libav; if not, write to the Free Software Foundation, Inc.,
  18. * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  19. */
  20. #include <string.h>
  21. #include "libavutil/common.h"
  22. #include "libavutil/internal.h"
  23. #include "libavutil/intreadwrite.h"
  24. #include "libavcodec/vp9.h"
  25. #include "checkasm.h"
  26. static const uint32_t pixel_mask[3] = { 0xffffffff, 0x03ff03ff, 0x0fff0fff };
  27. #define BIT_DEPTH 8
  28. #define SIZEOF_PIXEL ((BIT_DEPTH + 7) / 8)
  29. #define setpx(a,b,c) \
  30. do { \
  31. if (SIZEOF_PIXEL == 1) { \
  32. buf0[(a) + (b) * jstride] = av_clip_uint8(c); \
  33. } else { \
  34. ((uint16_t *)buf0)[(a) + (b) * jstride] = av_clip_uintp2(c, BIT_DEPTH); \
  35. } \
  36. } while (0)
  37. #define setdx(a,b,c,d) setpx(a,b,c-(d)+(rnd()%((d)*2+1)))
  38. #define setsx(a,b,c,d) setdx(a,b,c,(d) << (BIT_DEPTH - 8))
  39. static void randomize_loopfilter_buffers(int bidx, int lineoff, int str,
  40. int bit_depth, int dir,
  41. const int *E, const int *F,
  42. const int *H, const int *I,
  43. uint8_t *buf0, uint8_t *buf1)
  44. {
  45. uint32_t mask = (1 << BIT_DEPTH) - 1;
  46. int off = dir ? lineoff : lineoff * 16;
  47. int istride = dir ? 1 : 16;
  48. int jstride = dir ? str : 1;
  49. int i, j;
  50. for (i = 0; i < 2; i++) /* flat16 */ {
  51. int idx = off + i * istride, p0, q0;
  52. setpx(idx, 0, q0 = rnd() & mask);
  53. setsx(idx, -1, p0 = q0, E[bidx] >> 2);
  54. for (j = 1; j < 8; j++) {
  55. setsx(idx, -1 - j, p0, F[bidx]);
  56. setsx(idx, j, q0, F[bidx]);
  57. }
  58. }
  59. for (i = 2; i < 4; i++) /* flat8 */ {
  60. int idx = off + i * istride, p0, q0;
  61. setpx(idx, 0, q0 = rnd() & mask);
  62. setsx(idx, -1, p0 = q0, E[bidx] >> 2);
  63. for (j = 1; j < 4; j++) {
  64. setsx(idx, -1 - j, p0, F[bidx]);
  65. setsx(idx, j, q0, F[bidx]);
  66. }
  67. for (j = 4; j < 8; j++) {
  68. setpx(idx, -1 - j, rnd() & mask);
  69. setpx(idx, j, rnd() & mask);
  70. }
  71. }
  72. for (i = 4; i < 6; i++) /* regular */ {
  73. int idx = off + i * istride, p2, p1, p0, q0, q1, q2;
  74. setpx(idx, 0, q0 = rnd() & mask);
  75. setsx(idx, 1, q1 = q0, I[bidx]);
  76. setsx(idx, 2, q2 = q1, I[bidx]);
  77. setsx(idx, 3, q2, I[bidx]);
  78. setsx(idx, -1, p0 = q0, E[bidx] >> 2);
  79. setsx(idx, -2, p1 = p0, I[bidx]);
  80. setsx(idx, -3, p2 = p1, I[bidx]);
  81. setsx(idx, -4, p2, I[bidx]);
  82. for (j = 4; j < 8; j++) {
  83. setpx(idx, -1 - j, rnd() & mask);
  84. setpx(idx, j, rnd() & mask);
  85. }
  86. }
  87. for (i = 6; i < 8; i++) /* off */ {
  88. int idx = off + i * istride;
  89. for (j = 0; j < 8; j++) {
  90. setpx(idx, -1 - j, rnd() & mask);
  91. setpx(idx, j, rnd() & mask);
  92. }
  93. }
  94. }
  95. #define randomize_buffers(bidx, lineoff, str) \
  96. randomize_loopfilter_buffers(bidx, lineoff, str, BIT_DEPTH, dir, \
  97. E, F, H, I, buf0, buf1)
  98. static void check_loopfilter(void)
  99. {
  100. LOCAL_ALIGNED_32(uint8_t, base0, [32 + 16 * 16 * 2]);
  101. LOCAL_ALIGNED_32(uint8_t, base1, [32 + 16 * 16 * 2]);
  102. VP9DSPContext dsp;
  103. int dir, wd, wd2;
  104. static const char *const dir_name[2] = { "h", "v" };
  105. static const int E[2] = { 20, 28 }, I[2] = { 10, 16 };
  106. static const int H[2] = { 7, 11 }, F[2] = { 1, 1 };
  107. declare_func(void, uint8_t *dst, ptrdiff_t stride, int E, int I, int H);
  108. ff_vp9dsp_init(&dsp);
  109. for (dir = 0; dir < 2; dir++) {
  110. uint8_t *buf0, *buf1;
  111. int midoff = (dir ? 8 * 8 : 8) * SIZEOF_PIXEL;
  112. int midoff_aligned = (dir ? 8 * 8 : 16) * SIZEOF_PIXEL;
  113. buf0 = base0 + midoff_aligned;
  114. buf1 = base1 + midoff_aligned;
  115. for (wd = 0; wd < 3; wd++) {
  116. // 4/8/16wd_8px
  117. if (check_func(dsp.loop_filter_8[wd][dir],
  118. "vp9_loop_filter_%s_%d_8",
  119. dir_name[dir], 4 << wd)) {
  120. randomize_buffers(0, 0, 8);
  121. memcpy(buf1 - midoff, buf0 - midoff,
  122. 16 * 8 * SIZEOF_PIXEL);
  123. call_ref(buf0, 16 * SIZEOF_PIXEL >> dir, E[0], I[0], H[0]);
  124. call_new(buf1, 16 * SIZEOF_PIXEL >> dir, E[0], I[0], H[0]);
  125. if (memcmp(buf0 - midoff, buf1 - midoff, 16 * 8 * SIZEOF_PIXEL))
  126. fail();
  127. bench_new(buf1, 16 * SIZEOF_PIXEL >> dir, E[0], I[0], H[0]);
  128. }
  129. }
  130. midoff = (dir ? 16 * 8 : 8) * SIZEOF_PIXEL;
  131. midoff_aligned = (dir ? 16 * 8 : 16) * SIZEOF_PIXEL;
  132. buf0 = base0 + midoff_aligned;
  133. buf1 = base1 + midoff_aligned;
  134. // 16wd_16px loopfilter
  135. if (check_func(dsp.loop_filter_16[dir],
  136. "vp9_loop_filter_%s_16_16",
  137. dir_name[dir])) {
  138. randomize_buffers(0, 0, 16);
  139. randomize_buffers(0, 8, 16);
  140. memcpy(buf1 - midoff, buf0 - midoff, 16 * 16 * SIZEOF_PIXEL);
  141. call_ref(buf0, 16 * SIZEOF_PIXEL, E[0], I[0], H[0]);
  142. call_new(buf1, 16 * SIZEOF_PIXEL, E[0], I[0], H[0]);
  143. if (memcmp(buf0 - midoff, buf1 - midoff, 16 * 16 * SIZEOF_PIXEL))
  144. fail();
  145. bench_new(buf1, 16 * SIZEOF_PIXEL, E[0], I[0], H[0]);
  146. }
  147. for (wd = 0; wd < 2; wd++) {
  148. for (wd2 = 0; wd2 < 2; wd2++) {
  149. // mix2 loopfilter
  150. if (check_func(dsp.loop_filter_mix2[wd][wd2][dir],
  151. "vp9_loop_filter_mix2_%s_%d%d_16",
  152. dir_name[dir], 4 << wd, 4 << wd2)) {
  153. randomize_buffers(0, 0, 16);
  154. randomize_buffers(1, 8, 16);
  155. memcpy(buf1 - midoff, buf0 - midoff, 16 * 16 * SIZEOF_PIXEL);
  156. #define M(a) ((a[1] << 8) | a[0])
  157. call_ref(buf0, 16 * SIZEOF_PIXEL, M(E), M(I), M(H));
  158. call_new(buf1, 16 * SIZEOF_PIXEL, M(E), M(I), M(H));
  159. if (memcmp(buf0 - midoff, buf1 - midoff, 16 * 16 * SIZEOF_PIXEL))
  160. fail();
  161. bench_new(buf1, 16 * SIZEOF_PIXEL, M(E), M(I), M(H));
  162. #undef M
  163. }
  164. }
  165. }
  166. }
  167. report("loopfilter");
  168. }
  169. #undef setsx
  170. #undef setpx
  171. #undef setdx
  172. #undef randomize_buffers
  173. #define DST_BUF_SIZE (size * size * SIZEOF_PIXEL)
  174. #define SRC_BUF_STRIDE 72
  175. #define SRC_BUF_SIZE ((size + 7) * SRC_BUF_STRIDE * SIZEOF_PIXEL)
  176. #define src (buf + 3 * SIZEOF_PIXEL * (SRC_BUF_STRIDE + 1))
  177. #define randomize_buffers() \
  178. do { \
  179. uint32_t mask = pixel_mask[(BIT_DEPTH - 8) >> 1]; \
  180. int k; \
  181. for (k = 0; k < SRC_BUF_SIZE; k += 4) { \
  182. uint32_t r = rnd() & mask; \
  183. AV_WN32A(buf + k, r); \
  184. } \
  185. if (op == 1) { \
  186. for (k = 0; k < DST_BUF_SIZE; k += 4) { \
  187. uint32_t r = rnd() & mask; \
  188. AV_WN32A(dst0 + k, r); \
  189. AV_WN32A(dst1 + k, r); \
  190. } \
  191. } \
  192. } while (0)
  193. static void check_mc(void)
  194. {
  195. static const char *const filter_names[4] = {
  196. "8tap_smooth", "8tap_regular", "8tap_sharp", "bilin"
  197. };
  198. static const char *const subpel_names[2][2] = { { "", "h" }, { "v", "hv" } };
  199. static const char *const op_names[2] = { "put", "avg" };
  200. LOCAL_ALIGNED_32(uint8_t, buf, [72 * 72 * 2]);
  201. LOCAL_ALIGNED_32(uint8_t, dst0, [64 * 64 * 2]);
  202. LOCAL_ALIGNED_32(uint8_t, dst1, [64 * 64 * 2]);
  203. char str[256];
  204. VP9DSPContext dsp;
  205. int op, hsize, filter, dx, dy;
  206. declare_func_emms(AV_CPU_FLAG_MMX | AV_CPU_FLAG_MMXEXT,
  207. void, uint8_t *dst, const uint8_t *ref,
  208. ptrdiff_t dst_stride, ptrdiff_t ref_stride,
  209. int h, int mx, int my);
  210. for (op = 0; op < 2; op++) {
  211. ff_vp9dsp_init(&dsp);
  212. for (hsize = 0; hsize < 5; hsize++) {
  213. int size = 64 >> hsize;
  214. for (filter = 0; filter < 4; filter++) {
  215. for (dx = 0; dx < 2; dx++) {
  216. for (dy = 0; dy < 2; dy++) {
  217. if (dx || dy) {
  218. snprintf(str, sizeof(str), "%s_%s_%d%s", op_names[op],
  219. filter_names[filter], size,
  220. subpel_names[dy][dx]);
  221. } else {
  222. snprintf(str, sizeof(str), "%s%d", op_names[op], size);
  223. }
  224. if (check_func(dsp.mc[hsize][filter][op][dx][dy],
  225. "vp9_%s", str)) {
  226. int mx = dx ? 1 + (rnd() % 14) : 0;
  227. int my = dy ? 1 + (rnd() % 14) : 0;
  228. randomize_buffers();
  229. call_ref(dst0, src,
  230. size * SIZEOF_PIXEL,
  231. SRC_BUF_STRIDE * SIZEOF_PIXEL,
  232. size, mx, my);
  233. call_new(dst1, src,
  234. size * SIZEOF_PIXEL,
  235. SRC_BUF_STRIDE * SIZEOF_PIXEL,
  236. size, mx, my);
  237. if (memcmp(dst0, dst1, DST_BUF_SIZE))
  238. fail();
  239. // SIMD implementations for each filter of subpel
  240. // functions are identical
  241. if (filter >= 1 && filter <= 2) continue;
  242. bench_new(dst1, src, size * SIZEOF_PIXEL,
  243. SRC_BUF_STRIDE * SIZEOF_PIXEL,
  244. size, mx, my);
  245. }
  246. }
  247. }
  248. }
  249. }
  250. }
  251. report("mc");
  252. }
  253. void checkasm_check_vp9dsp(void)
  254. {
  255. check_loopfilter();
  256. check_mc();
  257. }