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.

577 lines
15KB

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