dct-test.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602
  1. /*
  2. * (c) 2001 Fabrice Bellard
  3. * 2007 Marc Hoffman <marc.hoffman@analog.com>
  4. *
  5. * This file is part of FFmpeg.
  6. *
  7. * FFmpeg is free software; you can redistribute it and/or
  8. * modify it under the terms of the GNU Lesser General Public
  9. * License as published by the Free Software Foundation; either
  10. * version 2.1 of the License, or (at your option) any later version.
  11. *
  12. * FFmpeg is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  15. * Lesser General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU Lesser General Public
  18. * License along with FFmpeg; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. */
  21. /**
  22. * @file libavcodec/dct-test.c
  23. * DCT test (c) 2001 Fabrice Bellard
  24. * Started from sample code by Juan J. Sierralta P.
  25. */
  26. #include <stdlib.h>
  27. #include <stdio.h>
  28. #include <string.h>
  29. #include <sys/time.h>
  30. #include <unistd.h>
  31. #include <math.h>
  32. #include "libavutil/common.h"
  33. #include "simple_idct.h"
  34. #include "aandcttab.h"
  35. #include "faandct.h"
  36. #include "faanidct.h"
  37. #include "x86/idct_xvid.h"
  38. #undef printf
  39. #undef random
  40. void *fast_memcpy(void *a, const void *b, size_t c){return memcpy(a,b,c);};
  41. /* reference fdct/idct */
  42. void ff_ref_fdct(DCTELEM *block);
  43. void ff_ref_idct(DCTELEM *block);
  44. void ff_ref_dct_init(void);
  45. void ff_mmx_idct(DCTELEM *data);
  46. void ff_mmxext_idct(DCTELEM *data);
  47. void odivx_idct_c(short *block);
  48. // BFIN
  49. void ff_bfin_idct(DCTELEM *block);
  50. void ff_bfin_fdct(DCTELEM *block);
  51. // ALTIVEC
  52. void fdct_altivec(DCTELEM *block);
  53. //void idct_altivec(DCTELEM *block);?? no routine
  54. // ARM
  55. void j_rev_dct_ARM(DCTELEM *data);
  56. void simple_idct_ARM(DCTELEM *data);
  57. void simple_idct_armv5te(DCTELEM *data);
  58. void ff_simple_idct_armv6(DCTELEM *data);
  59. void ff_simple_idct_neon(DCTELEM *data);
  60. void ff_simple_idct_axp(DCTELEM *data);
  61. struct algo {
  62. const char *name;
  63. enum { FDCT, IDCT } is_idct;
  64. void (* func) (DCTELEM *block);
  65. void (* ref) (DCTELEM *block);
  66. enum formattag { NO_PERM,MMX_PERM, MMX_SIMPLE_PERM, SCALE_PERM, SSE2_PERM, PARTTRANS_PERM } format;
  67. int mm_support;
  68. };
  69. #ifndef FAAN_POSTSCALE
  70. #define FAAN_SCALE SCALE_PERM
  71. #else
  72. #define FAAN_SCALE NO_PERM
  73. #endif
  74. static int cpu_flags;
  75. struct algo algos[] = {
  76. {"REF-DBL", 0, ff_ref_fdct, ff_ref_fdct, NO_PERM},
  77. {"FAAN", 0, ff_faandct, ff_ref_fdct, FAAN_SCALE},
  78. {"FAANI", 1, ff_faanidct, ff_ref_idct, NO_PERM},
  79. {"IJG-AAN-INT", 0, fdct_ifast, ff_ref_fdct, SCALE_PERM},
  80. {"IJG-LLM-INT", 0, ff_jpeg_fdct_islow, ff_ref_fdct, NO_PERM},
  81. {"REF-DBL", 1, ff_ref_idct, ff_ref_idct, NO_PERM},
  82. {"INT", 1, j_rev_dct, ff_ref_idct, MMX_PERM},
  83. {"SIMPLE-C", 1, ff_simple_idct, ff_ref_idct, NO_PERM},
  84. #if HAVE_MMX
  85. {"MMX", 0, ff_fdct_mmx, ff_ref_fdct, NO_PERM, FF_MM_MMX},
  86. #if HAVE_MMX2
  87. {"MMX2", 0, ff_fdct_mmx2, ff_ref_fdct, NO_PERM, FF_MM_MMXEXT},
  88. {"SSE2", 0, ff_fdct_sse2, ff_ref_fdct, NO_PERM, FF_MM_SSE2},
  89. #endif
  90. #if CONFIG_GPL
  91. {"LIBMPEG2-MMX", 1, ff_mmx_idct, ff_ref_idct, MMX_PERM, FF_MM_MMX},
  92. {"LIBMPEG2-MMXEXT", 1, ff_mmxext_idct, ff_ref_idct, MMX_PERM, FF_MM_MMXEXT},
  93. #endif
  94. {"SIMPLE-MMX", 1, ff_simple_idct_mmx, ff_ref_idct, MMX_SIMPLE_PERM, FF_MM_MMX},
  95. {"XVID-MMX", 1, ff_idct_xvid_mmx, ff_ref_idct, NO_PERM, FF_MM_MMX},
  96. {"XVID-MMX2", 1, ff_idct_xvid_mmx2, ff_ref_idct, NO_PERM, FF_MM_MMXEXT},
  97. {"XVID-SSE2", 1, ff_idct_xvid_sse2, ff_ref_idct, SSE2_PERM, FF_MM_SSE2},
  98. #endif
  99. #if HAVE_ALTIVEC
  100. {"altivecfdct", 0, fdct_altivec, ff_ref_fdct, NO_PERM, FF_MM_ALTIVEC},
  101. #endif
  102. #if ARCH_BFIN
  103. {"BFINfdct", 0, ff_bfin_fdct, ff_ref_fdct, NO_PERM},
  104. {"BFINidct", 1, ff_bfin_idct, ff_ref_idct, NO_PERM},
  105. #endif
  106. #if ARCH_ARM
  107. {"SIMPLE-ARM", 1, simple_idct_ARM, ff_ref_idct, NO_PERM },
  108. {"INT-ARM", 1, j_rev_dct_ARM, ff_ref_idct, MMX_PERM },
  109. #if HAVE_ARMV5TE
  110. {"SIMPLE-ARMV5TE", 1, simple_idct_armv5te, ff_ref_idct, NO_PERM },
  111. #endif
  112. #if HAVE_ARMV6
  113. {"SIMPLE-ARMV6", 1, ff_simple_idct_armv6, ff_ref_idct, MMX_PERM },
  114. #endif
  115. #if HAVE_NEON
  116. {"SIMPLE-NEON", 1, ff_simple_idct_neon, ff_ref_idct, PARTTRANS_PERM },
  117. #endif
  118. #endif /* ARCH_ARM */
  119. #if ARCH_ALPHA
  120. {"SIMPLE-ALPHA", 1, ff_simple_idct_axp, ff_ref_idct, NO_PERM },
  121. #endif
  122. { 0 }
  123. };
  124. #define AANSCALE_BITS 12
  125. uint8_t cropTbl[256 + 2 * MAX_NEG_CROP];
  126. int64_t gettime(void)
  127. {
  128. struct timeval tv;
  129. gettimeofday(&tv,NULL);
  130. return (int64_t)tv.tv_sec * 1000000 + tv.tv_usec;
  131. }
  132. #define NB_ITS 20000
  133. #define NB_ITS_SPEED 50000
  134. static short idct_mmx_perm[64];
  135. static short idct_simple_mmx_perm[64]={
  136. 0x00, 0x08, 0x04, 0x09, 0x01, 0x0C, 0x05, 0x0D,
  137. 0x10, 0x18, 0x14, 0x19, 0x11, 0x1C, 0x15, 0x1D,
  138. 0x20, 0x28, 0x24, 0x29, 0x21, 0x2C, 0x25, 0x2D,
  139. 0x12, 0x1A, 0x16, 0x1B, 0x13, 0x1E, 0x17, 0x1F,
  140. 0x02, 0x0A, 0x06, 0x0B, 0x03, 0x0E, 0x07, 0x0F,
  141. 0x30, 0x38, 0x34, 0x39, 0x31, 0x3C, 0x35, 0x3D,
  142. 0x22, 0x2A, 0x26, 0x2B, 0x23, 0x2E, 0x27, 0x2F,
  143. 0x32, 0x3A, 0x36, 0x3B, 0x33, 0x3E, 0x37, 0x3F,
  144. };
  145. static const uint8_t idct_sse2_row_perm[8] = {0, 4, 1, 5, 2, 6, 3, 7};
  146. void idct_mmx_init(void)
  147. {
  148. int i;
  149. /* the mmx/mmxext idct uses a reordered input, so we patch scan tables */
  150. for (i = 0; i < 64; i++) {
  151. idct_mmx_perm[i] = (i & 0x38) | ((i & 6) >> 1) | ((i & 1) << 2);
  152. // idct_simple_mmx_perm[i] = simple_block_permute_op(i);
  153. }
  154. }
  155. static DCTELEM block[64] __attribute__ ((aligned (16)));
  156. static DCTELEM block1[64] __attribute__ ((aligned (8)));
  157. static DCTELEM block_org[64] __attribute__ ((aligned (8)));
  158. static inline void mmx_emms(void)
  159. {
  160. #if HAVE_MMX
  161. if (cpu_flags & FF_MM_MMX)
  162. __asm__ volatile ("emms\n\t");
  163. #endif
  164. }
  165. void dct_error(const char *name, int is_idct,
  166. void (*fdct_func)(DCTELEM *block),
  167. void (*fdct_ref)(DCTELEM *block), int form, int test)
  168. {
  169. int it, i, scale;
  170. int err_inf, v;
  171. int64_t err2, ti, ti1, it1;
  172. int64_t sysErr[64], sysErrMax=0;
  173. int maxout=0;
  174. int blockSumErrMax=0, blockSumErr;
  175. srandom(0);
  176. err_inf = 0;
  177. err2 = 0;
  178. for(i=0; i<64; i++) sysErr[i]=0;
  179. for(it=0;it<NB_ITS;it++) {
  180. for(i=0;i<64;i++)
  181. block1[i] = 0;
  182. switch(test){
  183. case 0:
  184. for(i=0;i<64;i++)
  185. block1[i] = (random() % 512) -256;
  186. if (is_idct){
  187. ff_ref_fdct(block1);
  188. for(i=0;i<64;i++)
  189. block1[i]>>=3;
  190. }
  191. break;
  192. case 1:{
  193. int num= (random()%10)+1;
  194. for(i=0;i<num;i++)
  195. block1[random()%64] = (random() % 512) -256;
  196. }break;
  197. case 2:
  198. block1[0]= (random()%4096)-2048;
  199. block1[63]= (block1[0]&1)^1;
  200. break;
  201. }
  202. #if 0 // simulate mismatch control
  203. { int sum=0;
  204. for(i=0;i<64;i++)
  205. sum+=block1[i];
  206. if((sum&1)==0) block1[63]^=1;
  207. }
  208. #endif
  209. for(i=0; i<64; i++)
  210. block_org[i]= block1[i];
  211. if (form == MMX_PERM) {
  212. for(i=0;i<64;i++)
  213. block[idct_mmx_perm[i]] = block1[i];
  214. } else if (form == MMX_SIMPLE_PERM) {
  215. for(i=0;i<64;i++)
  216. block[idct_simple_mmx_perm[i]] = block1[i];
  217. } else if (form == SSE2_PERM) {
  218. for(i=0; i<64; i++)
  219. block[(i&0x38) | idct_sse2_row_perm[i&7]] = block1[i];
  220. } else if (form == PARTTRANS_PERM) {
  221. for(i=0; i<64; i++)
  222. block[(i&0x24) | ((i&3)<<3) | ((i>>3)&3)] = block1[i];
  223. } else {
  224. for(i=0; i<64; i++)
  225. block[i]= block1[i];
  226. }
  227. #if 0 // simulate mismatch control for tested IDCT but not the ref
  228. { int sum=0;
  229. for(i=0;i<64;i++)
  230. sum+=block[i];
  231. if((sum&1)==0) block[63]^=1;
  232. }
  233. #endif
  234. fdct_func(block);
  235. mmx_emms();
  236. if (form == SCALE_PERM) {
  237. for(i=0; i<64; i++) {
  238. scale = 8*(1 << (AANSCALE_BITS + 11)) / ff_aanscales[i];
  239. block[i] = (block[i] * scale /*+ (1<<(AANSCALE_BITS-1))*/) >> AANSCALE_BITS;
  240. }
  241. }
  242. fdct_ref(block1);
  243. blockSumErr=0;
  244. for(i=0;i<64;i++) {
  245. v = abs(block[i] - block1[i]);
  246. if (v > err_inf)
  247. err_inf = v;
  248. err2 += v * v;
  249. sysErr[i] += block[i] - block1[i];
  250. blockSumErr += v;
  251. if( abs(block[i])>maxout) maxout=abs(block[i]);
  252. }
  253. if(blockSumErrMax < blockSumErr) blockSumErrMax= blockSumErr;
  254. #if 0 // print different matrix pairs
  255. if(blockSumErr){
  256. printf("\n");
  257. for(i=0; i<64; i++){
  258. if((i&7)==0) printf("\n");
  259. printf("%4d ", block_org[i]);
  260. }
  261. for(i=0; i<64; i++){
  262. if((i&7)==0) printf("\n");
  263. printf("%4d ", block[i] - block1[i]);
  264. }
  265. }
  266. #endif
  267. }
  268. for(i=0; i<64; i++) sysErrMax= FFMAX(sysErrMax, FFABS(sysErr[i]));
  269. #if 1 // dump systematic errors
  270. for(i=0; i<64; i++){
  271. if(i%8==0) printf("\n");
  272. printf("%5d ", (int)sysErr[i]);
  273. }
  274. printf("\n");
  275. #endif
  276. printf("%s %s: err_inf=%d err2=%0.8f syserr=%0.8f maxout=%d blockSumErr=%d\n",
  277. is_idct ? "IDCT" : "DCT",
  278. name, err_inf, (double)err2 / NB_ITS / 64.0, (double)sysErrMax / NB_ITS, maxout, blockSumErrMax);
  279. #if 1 //Speed test
  280. /* speed test */
  281. for(i=0;i<64;i++)
  282. block1[i] = 0;
  283. switch(test){
  284. case 0:
  285. for(i=0;i<64;i++)
  286. block1[i] = (random() % 512) -256;
  287. if (is_idct){
  288. ff_ref_fdct(block1);
  289. for(i=0;i<64;i++)
  290. block1[i]>>=3;
  291. }
  292. break;
  293. case 1:{
  294. case 2:
  295. block1[0] = (random() % 512) -256;
  296. block1[1] = (random() % 512) -256;
  297. block1[2] = (random() % 512) -256;
  298. block1[3] = (random() % 512) -256;
  299. }break;
  300. }
  301. if (form == MMX_PERM) {
  302. for(i=0;i<64;i++)
  303. block[idct_mmx_perm[i]] = block1[i];
  304. } else if(form == MMX_SIMPLE_PERM) {
  305. for(i=0;i<64;i++)
  306. block[idct_simple_mmx_perm[i]] = block1[i];
  307. } else {
  308. for(i=0; i<64; i++)
  309. block[i]= block1[i];
  310. }
  311. ti = gettime();
  312. it1 = 0;
  313. do {
  314. for(it=0;it<NB_ITS_SPEED;it++) {
  315. for(i=0; i<64; i++)
  316. block[i]= block1[i];
  317. // memcpy(block, block1, sizeof(DCTELEM) * 64);
  318. // do not memcpy especially not fastmemcpy because it does movntq !!!
  319. fdct_func(block);
  320. }
  321. it1 += NB_ITS_SPEED;
  322. ti1 = gettime() - ti;
  323. } while (ti1 < 1000000);
  324. mmx_emms();
  325. printf("%s %s: %0.1f kdct/s\n",
  326. is_idct ? "IDCT" : "DCT",
  327. name, (double)it1 * 1000.0 / (double)ti1);
  328. #endif
  329. }
  330. static uint8_t img_dest[64] __attribute__ ((aligned (8)));
  331. static uint8_t img_dest1[64] __attribute__ ((aligned (8)));
  332. void idct248_ref(uint8_t *dest, int linesize, int16_t *block)
  333. {
  334. static int init;
  335. static double c8[8][8];
  336. static double c4[4][4];
  337. double block1[64], block2[64], block3[64];
  338. double s, sum, v;
  339. int i, j, k;
  340. if (!init) {
  341. init = 1;
  342. for(i=0;i<8;i++) {
  343. sum = 0;
  344. for(j=0;j<8;j++) {
  345. s = (i==0) ? sqrt(1.0/8.0) : sqrt(1.0/4.0);
  346. c8[i][j] = s * cos(M_PI * i * (j + 0.5) / 8.0);
  347. sum += c8[i][j] * c8[i][j];
  348. }
  349. }
  350. for(i=0;i<4;i++) {
  351. sum = 0;
  352. for(j=0;j<4;j++) {
  353. s = (i==0) ? sqrt(1.0/4.0) : sqrt(1.0/2.0);
  354. c4[i][j] = s * cos(M_PI * i * (j + 0.5) / 4.0);
  355. sum += c4[i][j] * c4[i][j];
  356. }
  357. }
  358. }
  359. /* butterfly */
  360. s = 0.5 * sqrt(2.0);
  361. for(i=0;i<4;i++) {
  362. for(j=0;j<8;j++) {
  363. block1[8*(2*i)+j] = (block[8*(2*i)+j] + block[8*(2*i+1)+j]) * s;
  364. block1[8*(2*i+1)+j] = (block[8*(2*i)+j] - block[8*(2*i+1)+j]) * s;
  365. }
  366. }
  367. /* idct8 on lines */
  368. for(i=0;i<8;i++) {
  369. for(j=0;j<8;j++) {
  370. sum = 0;
  371. for(k=0;k<8;k++)
  372. sum += c8[k][j] * block1[8*i+k];
  373. block2[8*i+j] = sum;
  374. }
  375. }
  376. /* idct4 */
  377. for(i=0;i<8;i++) {
  378. for(j=0;j<4;j++) {
  379. /* top */
  380. sum = 0;
  381. for(k=0;k<4;k++)
  382. sum += c4[k][j] * block2[8*(2*k)+i];
  383. block3[8*(2*j)+i] = sum;
  384. /* bottom */
  385. sum = 0;
  386. for(k=0;k<4;k++)
  387. sum += c4[k][j] * block2[8*(2*k+1)+i];
  388. block3[8*(2*j+1)+i] = sum;
  389. }
  390. }
  391. /* clamp and store the result */
  392. for(i=0;i<8;i++) {
  393. for(j=0;j<8;j++) {
  394. v = block3[8*i+j];
  395. if (v < 0)
  396. v = 0;
  397. else if (v > 255)
  398. v = 255;
  399. dest[i * linesize + j] = (int)rint(v);
  400. }
  401. }
  402. }
  403. void idct248_error(const char *name,
  404. void (*idct248_put)(uint8_t *dest, int line_size, int16_t *block))
  405. {
  406. int it, i, it1, ti, ti1, err_max, v;
  407. srandom(0);
  408. /* just one test to see if code is correct (precision is less
  409. important here) */
  410. err_max = 0;
  411. for(it=0;it<NB_ITS;it++) {
  412. /* XXX: use forward transform to generate values */
  413. for(i=0;i<64;i++)
  414. block1[i] = (random() % 256) - 128;
  415. block1[0] += 1024;
  416. for(i=0; i<64; i++)
  417. block[i]= block1[i];
  418. idct248_ref(img_dest1, 8, block);
  419. for(i=0; i<64; i++)
  420. block[i]= block1[i];
  421. idct248_put(img_dest, 8, block);
  422. for(i=0;i<64;i++) {
  423. v = abs((int)img_dest[i] - (int)img_dest1[i]);
  424. if (v == 255)
  425. printf("%d %d\n", img_dest[i], img_dest1[i]);
  426. if (v > err_max)
  427. err_max = v;
  428. }
  429. #if 0
  430. printf("ref=\n");
  431. for(i=0;i<8;i++) {
  432. int j;
  433. for(j=0;j<8;j++) {
  434. printf(" %3d", img_dest1[i*8+j]);
  435. }
  436. printf("\n");
  437. }
  438. printf("out=\n");
  439. for(i=0;i<8;i++) {
  440. int j;
  441. for(j=0;j<8;j++) {
  442. printf(" %3d", img_dest[i*8+j]);
  443. }
  444. printf("\n");
  445. }
  446. #endif
  447. }
  448. printf("%s %s: err_inf=%d\n",
  449. 1 ? "IDCT248" : "DCT248",
  450. name, err_max);
  451. ti = gettime();
  452. it1 = 0;
  453. do {
  454. for(it=0;it<NB_ITS_SPEED;it++) {
  455. for(i=0; i<64; i++)
  456. block[i]= block1[i];
  457. // memcpy(block, block1, sizeof(DCTELEM) * 64);
  458. // do not memcpy especially not fastmemcpy because it does movntq !!!
  459. idct248_put(img_dest, 8, block);
  460. }
  461. it1 += NB_ITS_SPEED;
  462. ti1 = gettime() - ti;
  463. } while (ti1 < 1000000);
  464. mmx_emms();
  465. printf("%s %s: %0.1f kdct/s\n",
  466. 1 ? "IDCT248" : "DCT248",
  467. name, (double)it1 * 1000.0 / (double)ti1);
  468. }
  469. void help(void)
  470. {
  471. printf("dct-test [-i] [<test-number>]\n"
  472. "test-number 0 -> test with random matrixes\n"
  473. " 1 -> test with random sparse matrixes\n"
  474. " 2 -> do 3. test from mpeg4 std\n"
  475. "-i test IDCT implementations\n"
  476. "-4 test IDCT248 implementations\n");
  477. }
  478. int main(int argc, char **argv)
  479. {
  480. int test_idct = 0, test_248_dct = 0;
  481. int c,i;
  482. int test=1;
  483. cpu_flags = mm_support();
  484. ff_ref_dct_init();
  485. idct_mmx_init();
  486. for(i=0;i<256;i++) cropTbl[i + MAX_NEG_CROP] = i;
  487. for(i=0;i<MAX_NEG_CROP;i++) {
  488. cropTbl[i] = 0;
  489. cropTbl[i + MAX_NEG_CROP + 256] = 255;
  490. }
  491. for(;;) {
  492. c = getopt(argc, argv, "ih4");
  493. if (c == -1)
  494. break;
  495. switch(c) {
  496. case 'i':
  497. test_idct = 1;
  498. break;
  499. case '4':
  500. test_248_dct = 1;
  501. break;
  502. default :
  503. case 'h':
  504. help();
  505. return 0;
  506. }
  507. }
  508. if(optind <argc) test= atoi(argv[optind]);
  509. printf("ffmpeg DCT/IDCT test\n");
  510. if (test_248_dct) {
  511. idct248_error("SIMPLE-C", ff_simple_idct248_put);
  512. } else {
  513. for (i=0;algos[i].name;i++)
  514. if (algos[i].is_idct == test_idct && !(~cpu_flags & algos[i].mm_support)) {
  515. dct_error (algos[i].name, algos[i].is_idct, algos[i].func, algos[i].ref, algos[i].format, test);
  516. }
  517. }
  518. return 0;
  519. }