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.

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