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.

516 lines
14KB

  1. /**
  2. * @file dct-test.c
  3. * DCT test. (c) 2001 Fabrice Bellard.
  4. * Started from sample code by Juan J. Sierralta P.
  5. */
  6. #include <stdlib.h>
  7. #include <stdio.h>
  8. #include <string.h>
  9. #include <sys/time.h>
  10. #include <unistd.h>
  11. #include "dsputil.h"
  12. #include "simple_idct.h"
  13. #include "faandct.h"
  14. #ifndef MAX
  15. #define MAX(a, b) (((a) > (b)) ? (a) : (b))
  16. #endif
  17. #undef printf
  18. void *fast_memcpy(void *a, const void *b, size_t c){return memcpy(a,b,c);};
  19. /* reference fdct/idct */
  20. extern void fdct(DCTELEM *block);
  21. extern void idct(DCTELEM *block);
  22. extern void ff_idct_xvid_mmx(DCTELEM *block);
  23. extern void ff_idct_xvid_mmx2(DCTELEM *block);
  24. extern void init_fdct();
  25. extern void j_rev_dct(DCTELEM *data);
  26. extern void ff_mmx_idct(DCTELEM *data);
  27. extern void ff_mmxext_idct(DCTELEM *data);
  28. extern void odivx_idct_c (short *block);
  29. #define AANSCALE_BITS 12
  30. static const unsigned short aanscales[64] = {
  31. /* precomputed values scaled up by 14 bits */
  32. 16384, 22725, 21407, 19266, 16384, 12873, 8867, 4520,
  33. 22725, 31521, 29692, 26722, 22725, 17855, 12299, 6270,
  34. 21407, 29692, 27969, 25172, 21407, 16819, 11585, 5906,
  35. 19266, 26722, 25172, 22654, 19266, 15137, 10426, 5315,
  36. 16384, 22725, 21407, 19266, 16384, 12873, 8867, 4520,
  37. 12873, 17855, 16819, 15137, 12873, 10114, 6967, 3552,
  38. 8867, 12299, 11585, 10426, 8867, 6967, 4799, 2446,
  39. 4520, 6270, 5906, 5315, 4520, 3552, 2446, 1247
  40. };
  41. uint8_t cropTbl[256 + 2 * MAX_NEG_CROP];
  42. int64_t gettime(void)
  43. {
  44. struct timeval tv;
  45. gettimeofday(&tv,NULL);
  46. return (int64_t)tv.tv_sec * 1000000 + tv.tv_usec;
  47. }
  48. #define NB_ITS 20000
  49. #define NB_ITS_SPEED 50000
  50. static short idct_mmx_perm[64];
  51. static short idct_simple_mmx_perm[64]={
  52. 0x00, 0x08, 0x04, 0x09, 0x01, 0x0C, 0x05, 0x0D,
  53. 0x10, 0x18, 0x14, 0x19, 0x11, 0x1C, 0x15, 0x1D,
  54. 0x20, 0x28, 0x24, 0x29, 0x21, 0x2C, 0x25, 0x2D,
  55. 0x12, 0x1A, 0x16, 0x1B, 0x13, 0x1E, 0x17, 0x1F,
  56. 0x02, 0x0A, 0x06, 0x0B, 0x03, 0x0E, 0x07, 0x0F,
  57. 0x30, 0x38, 0x34, 0x39, 0x31, 0x3C, 0x35, 0x3D,
  58. 0x22, 0x2A, 0x26, 0x2B, 0x23, 0x2E, 0x27, 0x2F,
  59. 0x32, 0x3A, 0x36, 0x3B, 0x33, 0x3E, 0x37, 0x3F,
  60. };
  61. void idct_mmx_init(void)
  62. {
  63. int i;
  64. /* the mmx/mmxext idct uses a reordered input, so we patch scan tables */
  65. for (i = 0; i < 64; i++) {
  66. idct_mmx_perm[i] = (i & 0x38) | ((i & 6) >> 1) | ((i & 1) << 2);
  67. // idct_simple_mmx_perm[i] = simple_block_permute_op(i);
  68. }
  69. }
  70. static DCTELEM block[64] __attribute__ ((aligned (8)));
  71. static DCTELEM block1[64] __attribute__ ((aligned (8)));
  72. static DCTELEM block_org[64] __attribute__ ((aligned (8)));
  73. void dct_error(const char *name, int is_idct,
  74. void (*fdct_func)(DCTELEM *block),
  75. void (*fdct_ref)(DCTELEM *block), int test)
  76. {
  77. int it, i, scale;
  78. int err_inf, v;
  79. int64_t err2, ti, ti1, it1;
  80. int64_t sysErr[64], sysErrMax=0;
  81. int maxout=0;
  82. int blockSumErrMax=0, blockSumErr;
  83. srandom(0);
  84. err_inf = 0;
  85. err2 = 0;
  86. for(i=0; i<64; i++) sysErr[i]=0;
  87. for(it=0;it<NB_ITS;it++) {
  88. for(i=0;i<64;i++)
  89. block1[i] = 0;
  90. switch(test){
  91. case 0:
  92. for(i=0;i<64;i++)
  93. block1[i] = (random() % 512) -256;
  94. if (is_idct){
  95. fdct(block1);
  96. for(i=0;i<64;i++)
  97. block1[i]>>=3;
  98. }
  99. break;
  100. case 1:{
  101. int num= (random()%10)+1;
  102. for(i=0;i<num;i++)
  103. block1[random()%64] = (random() % 512) -256;
  104. }break;
  105. case 2:
  106. block1[0]= (random()%4096)-2048;
  107. block1[63]= (block1[0]&1)^1;
  108. break;
  109. }
  110. #if 0 // simulate mismatch control
  111. { int sum=0;
  112. for(i=0;i<64;i++)
  113. sum+=block1[i];
  114. if((sum&1)==0) block1[63]^=1;
  115. }
  116. #endif
  117. for(i=0; i<64; i++)
  118. block_org[i]= block1[i];
  119. if (fdct_func == ff_mmx_idct ||
  120. fdct_func == j_rev_dct || fdct_func == ff_mmxext_idct) {
  121. for(i=0;i<64;i++)
  122. block[idct_mmx_perm[i]] = block1[i];
  123. } else if(fdct_func == ff_simple_idct_mmx ) {
  124. for(i=0;i<64;i++)
  125. block[idct_simple_mmx_perm[i]] = block1[i];
  126. } else {
  127. for(i=0; i<64; i++)
  128. block[i]= block1[i];
  129. }
  130. #if 0 // simulate mismatch control for tested IDCT but not the ref
  131. { int sum=0;
  132. for(i=0;i<64;i++)
  133. sum+=block[i];
  134. if((sum&1)==0) block[63]^=1;
  135. }
  136. #endif
  137. fdct_func(block);
  138. emms(); /* for ff_mmx_idct */
  139. if (fdct_func == fdct_ifast
  140. #ifndef FAAN_POSTSCALE
  141. || fdct_func == ff_faandct
  142. #endif
  143. ) {
  144. for(i=0; i<64; i++) {
  145. scale = 8*(1 << (AANSCALE_BITS + 11)) / aanscales[i];
  146. block[i] = (block[i] * scale /*+ (1<<(AANSCALE_BITS-1))*/) >> AANSCALE_BITS;
  147. }
  148. }
  149. fdct_ref(block1);
  150. blockSumErr=0;
  151. for(i=0;i<64;i++) {
  152. v = abs(block[i] - block1[i]);
  153. if (v > err_inf)
  154. err_inf = v;
  155. err2 += v * v;
  156. sysErr[i] += block[i] - block1[i];
  157. blockSumErr += v;
  158. if( abs(block[i])>maxout) maxout=abs(block[i]);
  159. }
  160. if(blockSumErrMax < blockSumErr) blockSumErrMax= blockSumErr;
  161. #if 0 // print different matrix pairs
  162. if(blockSumErr){
  163. printf("\n");
  164. for(i=0; i<64; i++){
  165. if((i&7)==0) printf("\n");
  166. printf("%4d ", block_org[i]);
  167. }
  168. for(i=0; i<64; i++){
  169. if((i&7)==0) printf("\n");
  170. printf("%4d ", block[i] - block1[i]);
  171. }
  172. }
  173. #endif
  174. }
  175. for(i=0; i<64; i++) sysErrMax= MAX(sysErrMax, ABS(sysErr[i]));
  176. #if 1 // dump systematic errors
  177. for(i=0; i<64; i++){
  178. if(i%8==0) printf("\n");
  179. printf("%5d ", (int)sysErr[i]);
  180. }
  181. printf("\n");
  182. #endif
  183. printf("%s %s: err_inf=%d err2=%0.8f syserr=%0.8f maxout=%d blockSumErr=%d\n",
  184. is_idct ? "IDCT" : "DCT",
  185. name, err_inf, (double)err2 / NB_ITS / 64.0, (double)sysErrMax / NB_ITS, maxout, blockSumErrMax);
  186. #if 1 //Speed test
  187. /* speed test */
  188. for(i=0;i<64;i++)
  189. block1[i] = 0;
  190. switch(test){
  191. case 0:
  192. for(i=0;i<64;i++)
  193. block1[i] = (random() % 512) -256;
  194. if (is_idct){
  195. fdct(block1);
  196. for(i=0;i<64;i++)
  197. block1[i]>>=3;
  198. }
  199. break;
  200. case 1:{
  201. case 2:
  202. block1[0] = (random() % 512) -256;
  203. block1[1] = (random() % 512) -256;
  204. block1[2] = (random() % 512) -256;
  205. block1[3] = (random() % 512) -256;
  206. }break;
  207. }
  208. if (fdct_func == ff_mmx_idct ||
  209. fdct_func == j_rev_dct || fdct_func == ff_mmxext_idct) {
  210. for(i=0;i<64;i++)
  211. block[idct_mmx_perm[i]] = block1[i];
  212. } else if(fdct_func == ff_simple_idct_mmx ) {
  213. for(i=0;i<64;i++)
  214. block[idct_simple_mmx_perm[i]] = block1[i];
  215. } else {
  216. for(i=0; i<64; i++)
  217. block[i]= block1[i];
  218. }
  219. ti = gettime();
  220. it1 = 0;
  221. do {
  222. for(it=0;it<NB_ITS_SPEED;it++) {
  223. for(i=0; i<64; i++)
  224. block[i]= block1[i];
  225. // memcpy(block, block1, sizeof(DCTELEM) * 64);
  226. // dont memcpy especially not fastmemcpy because it does movntq !!!
  227. fdct_func(block);
  228. }
  229. it1 += NB_ITS_SPEED;
  230. ti1 = gettime() - ti;
  231. } while (ti1 < 1000000);
  232. emms();
  233. printf("%s %s: %0.1f kdct/s\n",
  234. is_idct ? "IDCT" : "DCT",
  235. name, (double)it1 * 1000.0 / (double)ti1);
  236. #endif
  237. }
  238. static uint8_t img_dest[64] __attribute__ ((aligned (8)));
  239. static uint8_t img_dest1[64] __attribute__ ((aligned (8)));
  240. void idct248_ref(uint8_t *dest, int linesize, int16_t *block)
  241. {
  242. static int init;
  243. static double c8[8][8];
  244. static double c4[4][4];
  245. double block1[64], block2[64], block3[64];
  246. double s, sum, v;
  247. int i, j, k;
  248. if (!init) {
  249. init = 1;
  250. for(i=0;i<8;i++) {
  251. sum = 0;
  252. for(j=0;j<8;j++) {
  253. s = (i==0) ? sqrt(1.0/8.0) : sqrt(1.0/4.0);
  254. c8[i][j] = s * cos(M_PI * i * (j + 0.5) / 8.0);
  255. sum += c8[i][j] * c8[i][j];
  256. }
  257. }
  258. for(i=0;i<4;i++) {
  259. sum = 0;
  260. for(j=0;j<4;j++) {
  261. s = (i==0) ? sqrt(1.0/4.0) : sqrt(1.0/2.0);
  262. c4[i][j] = s * cos(M_PI * i * (j + 0.5) / 4.0);
  263. sum += c4[i][j] * c4[i][j];
  264. }
  265. }
  266. }
  267. /* butterfly */
  268. s = 0.5 * sqrt(2.0);
  269. for(i=0;i<4;i++) {
  270. for(j=0;j<8;j++) {
  271. block1[8*(2*i)+j] = (block[8*(2*i)+j] + block[8*(2*i+1)+j]) * s;
  272. block1[8*(2*i+1)+j] = (block[8*(2*i)+j] - block[8*(2*i+1)+j]) * s;
  273. }
  274. }
  275. /* idct8 on lines */
  276. for(i=0;i<8;i++) {
  277. for(j=0;j<8;j++) {
  278. sum = 0;
  279. for(k=0;k<8;k++)
  280. sum += c8[k][j] * block1[8*i+k];
  281. block2[8*i+j] = sum;
  282. }
  283. }
  284. /* idct4 */
  285. for(i=0;i<8;i++) {
  286. for(j=0;j<4;j++) {
  287. /* top */
  288. sum = 0;
  289. for(k=0;k<4;k++)
  290. sum += c4[k][j] * block2[8*(2*k)+i];
  291. block3[8*(2*j)+i] = sum;
  292. /* bottom */
  293. sum = 0;
  294. for(k=0;k<4;k++)
  295. sum += c4[k][j] * block2[8*(2*k+1)+i];
  296. block3[8*(2*j+1)+i] = sum;
  297. }
  298. }
  299. /* clamp and store the result */
  300. for(i=0;i<8;i++) {
  301. for(j=0;j<8;j++) {
  302. v = block3[8*i+j];
  303. if (v < 0)
  304. v = 0;
  305. else if (v > 255)
  306. v = 255;
  307. dest[i * linesize + j] = (int)rint(v);
  308. }
  309. }
  310. }
  311. void idct248_error(const char *name,
  312. void (*idct248_put)(uint8_t *dest, int line_size, int16_t *block))
  313. {
  314. int it, i, it1, ti, ti1, err_max, v;
  315. srandom(0);
  316. /* just one test to see if code is correct (precision is less
  317. important here) */
  318. err_max = 0;
  319. for(it=0;it<NB_ITS;it++) {
  320. /* XXX: use forward transform to generate values */
  321. for(i=0;i<64;i++)
  322. block1[i] = (random() % 256) - 128;
  323. block1[0] += 1024;
  324. for(i=0; i<64; i++)
  325. block[i]= block1[i];
  326. idct248_ref(img_dest1, 8, block);
  327. for(i=0; i<64; i++)
  328. block[i]= block1[i];
  329. idct248_put(img_dest, 8, block);
  330. for(i=0;i<64;i++) {
  331. v = abs((int)img_dest[i] - (int)img_dest1[i]);
  332. if (v == 255)
  333. printf("%d %d\n", img_dest[i], img_dest1[i]);
  334. if (v > err_max)
  335. err_max = v;
  336. }
  337. #if 0
  338. printf("ref=\n");
  339. for(i=0;i<8;i++) {
  340. int j;
  341. for(j=0;j<8;j++) {
  342. printf(" %3d", img_dest1[i*8+j]);
  343. }
  344. printf("\n");
  345. }
  346. printf("out=\n");
  347. for(i=0;i<8;i++) {
  348. int j;
  349. for(j=0;j<8;j++) {
  350. printf(" %3d", img_dest[i*8+j]);
  351. }
  352. printf("\n");
  353. }
  354. #endif
  355. }
  356. printf("%s %s: err_inf=%d\n",
  357. 1 ? "IDCT248" : "DCT248",
  358. name, err_max);
  359. ti = gettime();
  360. it1 = 0;
  361. do {
  362. for(it=0;it<NB_ITS_SPEED;it++) {
  363. for(i=0; i<64; i++)
  364. block[i]= block1[i];
  365. // memcpy(block, block1, sizeof(DCTELEM) * 64);
  366. // dont memcpy especially not fastmemcpy because it does movntq !!!
  367. idct248_put(img_dest, 8, block);
  368. }
  369. it1 += NB_ITS_SPEED;
  370. ti1 = gettime() - ti;
  371. } while (ti1 < 1000000);
  372. emms();
  373. printf("%s %s: %0.1f kdct/s\n",
  374. 1 ? "IDCT248" : "DCT248",
  375. name, (double)it1 * 1000.0 / (double)ti1);
  376. }
  377. void help(void)
  378. {
  379. printf("dct-test [-i] [<test-number>]\n"
  380. "test-number 0 -> test with random matrixes\n"
  381. " 1 -> test with random sparse matrixes\n"
  382. " 2 -> do 3. test from mpeg4 std\n"
  383. "-i test IDCT implementations\n"
  384. "-4 test IDCT248 implementations\n");
  385. exit(1);
  386. }
  387. int main(int argc, char **argv)
  388. {
  389. int test_idct = 0, test_248_dct = 0;
  390. int c,i;
  391. int test=1;
  392. init_fdct();
  393. idct_mmx_init();
  394. for(i=0;i<256;i++) cropTbl[i + MAX_NEG_CROP] = i;
  395. for(i=0;i<MAX_NEG_CROP;i++) {
  396. cropTbl[i] = 0;
  397. cropTbl[i + MAX_NEG_CROP + 256] = 255;
  398. }
  399. for(;;) {
  400. c = getopt(argc, argv, "ih4");
  401. if (c == -1)
  402. break;
  403. switch(c) {
  404. case 'i':
  405. test_idct = 1;
  406. break;
  407. case '4':
  408. test_248_dct = 1;
  409. break;
  410. default :
  411. case 'h':
  412. help();
  413. break;
  414. }
  415. }
  416. if(optind <argc) test= atoi(argv[optind]);
  417. printf("ffmpeg DCT/IDCT test\n");
  418. if (test_248_dct) {
  419. idct248_error("SIMPLE-C", simple_idct248_put);
  420. } else {
  421. if (!test_idct) {
  422. dct_error("REF-DBL", 0, fdct, fdct, test); /* only to verify code ! */
  423. dct_error("IJG-AAN-INT", 0, fdct_ifast, fdct, test);
  424. dct_error("IJG-LLM-INT", 0, ff_jpeg_fdct_islow, fdct, test);
  425. dct_error("MMX", 0, ff_fdct_mmx, fdct, test);
  426. dct_error("MMX2", 0, ff_fdct_mmx2, fdct, test);
  427. dct_error("FAAN", 0, ff_faandct, fdct, test);
  428. } else {
  429. dct_error("REF-DBL", 1, idct, idct, test);
  430. dct_error("INT", 1, j_rev_dct, idct, test);
  431. dct_error("LIBMPEG2-MMX", 1, ff_mmx_idct, idct, test);
  432. dct_error("LIBMPEG2-MMXEXT", 1, ff_mmxext_idct, idct, test);
  433. dct_error("SIMPLE-C", 1, simple_idct, idct, test);
  434. dct_error("SIMPLE-MMX", 1, ff_simple_idct_mmx, idct, test);
  435. dct_error("XVID-MMX", 1, ff_idct_xvid_mmx, idct, test);
  436. dct_error("XVID-MMX2", 1, ff_idct_xvid_mmx2, idct, test);
  437. // dct_error("ODIVX-C", 1, odivx_idct_c, idct);
  438. //printf(" test against odivx idct\n");
  439. // dct_error("REF", 1, idct, odivx_idct_c);
  440. // dct_error("INT", 1, j_rev_dct, odivx_idct_c);
  441. // dct_error("MMX", 1, ff_mmx_idct, odivx_idct_c);
  442. // dct_error("MMXEXT", 1, ff_mmxext_idct, odivx_idct_c);
  443. // dct_error("SIMPLE-C", 1, simple_idct, odivx_idct_c);
  444. // dct_error("SIMPLE-MMX", 1, ff_simple_idct_mmx, odivx_idct_c);
  445. // dct_error("ODIVX-C", 1, odivx_idct_c, odivx_idct_c);
  446. }
  447. }
  448. return 0;
  449. }