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.

498 lines
14KB

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