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.

330 lines
9.2KB

  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. #define AANSCALE_BITS 12
  22. static const unsigned short aanscales[64] = {
  23. /* precomputed values scaled up by 14 bits */
  24. 16384, 22725, 21407, 19266, 16384, 12873, 8867, 4520,
  25. 22725, 31521, 29692, 26722, 22725, 17855, 12299, 6270,
  26. 21407, 29692, 27969, 25172, 21407, 16819, 11585, 5906,
  27. 19266, 26722, 25172, 22654, 19266, 15137, 10426, 5315,
  28. 16384, 22725, 21407, 19266, 16384, 12873, 8867, 4520,
  29. 12873, 17855, 16819, 15137, 12873, 10114, 6967, 3552,
  30. 8867, 12299, 11585, 10426, 8867, 6967, 4799, 2446,
  31. 4520, 6270, 5906, 5315, 4520, 3552, 2446, 1247
  32. };
  33. UINT8 cropTbl[256 + 2 * MAX_NEG_CROP];
  34. INT64 gettime(void)
  35. {
  36. struct timeval tv;
  37. gettimeofday(&tv,NULL);
  38. return (INT64)tv.tv_sec * 1000000 + tv.tv_usec;
  39. }
  40. #define NB_ITS 20000
  41. #define NB_ITS_SPEED 50000
  42. static short idct_mmx_perm[64];
  43. static short idct_simple_mmx_perm[64]={
  44. 0x00, 0x08, 0x04, 0x09, 0x01, 0x0C, 0x05, 0x0D,
  45. 0x10, 0x18, 0x14, 0x19, 0x11, 0x1C, 0x15, 0x1D,
  46. 0x20, 0x28, 0x24, 0x29, 0x21, 0x2C, 0x25, 0x2D,
  47. 0x12, 0x1A, 0x16, 0x1B, 0x13, 0x1E, 0x17, 0x1F,
  48. 0x02, 0x0A, 0x06, 0x0B, 0x03, 0x0E, 0x07, 0x0F,
  49. 0x30, 0x38, 0x34, 0x39, 0x31, 0x3C, 0x35, 0x3D,
  50. 0x22, 0x2A, 0x26, 0x2B, 0x23, 0x2E, 0x27, 0x2F,
  51. 0x32, 0x3A, 0x36, 0x3B, 0x33, 0x3E, 0x37, 0x3F,
  52. };
  53. void idct_mmx_init(void)
  54. {
  55. int i;
  56. /* the mmx/mmxext idct uses a reordered input, so we patch scan tables */
  57. for (i = 0; i < 64; i++) {
  58. idct_mmx_perm[i] = (i & 0x38) | ((i & 6) >> 1) | ((i & 1) << 2);
  59. // idct_simple_mmx_perm[i] = simple_block_permute_op(i);
  60. }
  61. }
  62. static DCTELEM block[64] __attribute__ ((aligned (8)));
  63. static DCTELEM block1[64] __attribute__ ((aligned (8)));
  64. static DCTELEM block_org[64] __attribute__ ((aligned (8)));
  65. void dct_error(const char *name, int is_idct,
  66. void (*fdct_func)(DCTELEM *block),
  67. void (*fdct_ref)(DCTELEM *block), int test)
  68. {
  69. int it, i, scale;
  70. int err_inf, v;
  71. INT64 err2, ti, ti1, it1;
  72. INT64 sysErr[64], sysErrMax=0;
  73. int maxout=0;
  74. int max_sum=0;
  75. int blockSumErrMax=0, blockSumErr;
  76. srandom(0);
  77. err_inf = 0;
  78. err2 = 0;
  79. for(i=0; i<64; i++) sysErr[i]=0;
  80. for(it=0;it<NB_ITS;it++) {
  81. for(i=0;i<64;i++)
  82. block1[i] = 0;
  83. switch(test){
  84. case 0:
  85. for(i=0;i<64;i++)
  86. block1[i] = (random() % 512) -256;
  87. if (is_idct){
  88. fdct(block1);
  89. for(i=0;i<64;i++)
  90. block1[i]>>=3;
  91. }
  92. break;
  93. case 1:{
  94. int num= (random()%10)+1;
  95. for(i=0;i<num;i++)
  96. block1[random()%64] = (random() % 512) -256;
  97. }break;
  98. case 2:
  99. block1[0]= (random()%4096)-2048;
  100. block1[63]= (block1[0]&1)^1;
  101. break;
  102. }
  103. #if 0 // simulate mismatch control
  104. { int sum=0;
  105. for(i=0;i<64;i++)
  106. sum+=block1[i];
  107. if((sum&1)==0) block1[63]^=1;
  108. }
  109. #endif
  110. for(i=0; i<64; i++)
  111. block_org[i]= block1[i];
  112. if (fdct_func == ff_mmx_idct ||
  113. fdct_func == j_rev_dct || fdct_func == ff_mmxext_idct) {
  114. for(i=0;i<64;i++)
  115. block[idct_mmx_perm[i]] = block1[i];
  116. } else if(fdct_func == simple_idct_mmx ) {
  117. for(i=0;i<64;i++)
  118. block[idct_simple_mmx_perm[i]] = block1[i];
  119. } else {
  120. for(i=0; i<64; i++)
  121. block[i]= block1[i];
  122. }
  123. #if 0 // simulate mismatch control for tested IDCT but not the ref
  124. { int sum=0;
  125. for(i=0;i<64;i++)
  126. sum+=block[i];
  127. if((sum&1)==0) block[63]^=1;
  128. }
  129. #endif
  130. fdct_func(block);
  131. emms(); /* for ff_mmx_idct */
  132. if (fdct_func == fdct_ifast) {
  133. for(i=0; i<64; i++) {
  134. scale = 8*(1 << (AANSCALE_BITS + 11)) / aanscales[i];
  135. block[i] = (block[i] * scale /*+ (1<<(AANSCALE_BITS-1))*/) >> AANSCALE_BITS;
  136. }
  137. }
  138. fdct_ref(block1);
  139. blockSumErr=0;
  140. for(i=0;i<64;i++) {
  141. v = abs(block[i] - block1[i]);
  142. if (v > err_inf)
  143. err_inf = v;
  144. err2 += v * v;
  145. sysErr[i] += block[i] - block1[i];
  146. blockSumErr += v;
  147. if( abs(block[i])>maxout) maxout=abs(block[i]);
  148. }
  149. if(blockSumErrMax < blockSumErr) blockSumErrMax= blockSumErr;
  150. #if 0 // print different matrix pairs
  151. if(blockSumErr){
  152. printf("\n");
  153. for(i=0; i<64; i++){
  154. if((i&7)==0) printf("\n");
  155. printf("%4d ", block_org[i]);
  156. }
  157. for(i=0; i<64; i++){
  158. if((i&7)==0) printf("\n");
  159. printf("%4d ", block[i] - block1[i]);
  160. }
  161. }
  162. #endif
  163. }
  164. for(i=0; i<64; i++) sysErrMax= MAX(sysErrMax, ABS(sysErr[i]));
  165. #if 1 // dump systematic errors
  166. for(i=0; i<64; i++){
  167. if(i%8==0) printf("\n");
  168. printf("%5d ", (int)sysErr[i]);
  169. }
  170. printf("\n");
  171. #endif
  172. printf("%s %s: err_inf=%d err2=%0.8f syserr=%0.8f maxout=%d blockSumErr=%d\n",
  173. is_idct ? "IDCT" : "DCT",
  174. name, err_inf, (double)err2 / NB_ITS / 64.0, (double)sysErrMax / NB_ITS, maxout, blockSumErrMax);
  175. #if 1 //Speed test
  176. /* speed test */
  177. for(i=0;i<64;i++)
  178. block1[i] = 0;
  179. switch(test){
  180. case 0:
  181. for(i=0;i<64;i++)
  182. block1[i] = (random() % 512) -256;
  183. if (is_idct){
  184. fdct(block1);
  185. for(i=0;i<64;i++)
  186. block1[i]>>=3;
  187. }
  188. break;
  189. case 1:{
  190. case 2:
  191. block1[0] = (random() % 512) -256;
  192. block1[1] = (random() % 512) -256;
  193. block1[2] = (random() % 512) -256;
  194. block1[3] = (random() % 512) -256;
  195. }break;
  196. }
  197. if (fdct_func == ff_mmx_idct ||
  198. fdct_func == j_rev_dct || fdct_func == ff_mmxext_idct) {
  199. for(i=0;i<64;i++)
  200. block[idct_mmx_perm[i]] = block1[i];
  201. } else if(fdct_func == simple_idct_mmx ) {
  202. for(i=0;i<64;i++)
  203. block[idct_simple_mmx_perm[i]] = block1[i];
  204. } else {
  205. for(i=0; i<64; i++)
  206. block[i]= block1[i];
  207. }
  208. ti = gettime();
  209. it1 = 0;
  210. do {
  211. for(it=0;it<NB_ITS_SPEED;it++) {
  212. for(i=0; i<64; i++)
  213. block[i]= block1[i];
  214. // memcpy(block, block1, sizeof(DCTELEM) * 64);
  215. // dont memcpy especially not fastmemcpy because it does movntq !!!
  216. fdct_func(block);
  217. }
  218. it1 += NB_ITS_SPEED;
  219. ti1 = gettime() - ti;
  220. } while (ti1 < 1000000);
  221. emms();
  222. printf("%s %s: %0.1f kdct/s\n",
  223. is_idct ? "IDCT" : "DCT",
  224. name, (double)it1 * 1000.0 / (double)ti1);
  225. #endif
  226. }
  227. void help(void)
  228. {
  229. printf("dct-test [-i] [<test-number>]\n"
  230. "test-number 0 -> test with random matrixes\n"
  231. " 1 -> test with random sparse matrixes\n"
  232. " 2 -> do 3. test from mpeg4 std\n"
  233. "-i test IDCT implementations\n");
  234. exit(1);
  235. }
  236. int main(int argc, char **argv)
  237. {
  238. int test_idct = 0;
  239. int c,i;
  240. int test=1;
  241. init_fdct();
  242. idct_mmx_init();
  243. for(i=0;i<256;i++) cropTbl[i + MAX_NEG_CROP] = i;
  244. for(i=0;i<MAX_NEG_CROP;i++) {
  245. cropTbl[i] = 0;
  246. cropTbl[i + MAX_NEG_CROP + 256] = 255;
  247. }
  248. for(;;) {
  249. c = getopt(argc, argv, "ih");
  250. if (c == -1)
  251. break;
  252. switch(c) {
  253. case 'i':
  254. test_idct = 1;
  255. break;
  256. default :
  257. case 'h':
  258. help();
  259. break;
  260. }
  261. }
  262. if(optind <argc) test= atoi(argv[optind]);
  263. printf("ffmpeg DCT/IDCT test\n");
  264. if (!test_idct) {
  265. dct_error("REF-DBL", 0, fdct, fdct, test); /* only to verify code ! */
  266. dct_error("IJG-AAN-INT", 0, fdct_ifast, fdct, test);
  267. dct_error("IJG-LLM-INT", 0, ff_jpeg_fdct_islow, fdct, test);
  268. dct_error("MMX", 0, ff_fdct_mmx, fdct, test);
  269. } else {
  270. dct_error("REF-DBL", 1, idct, idct, test);
  271. dct_error("INT", 1, j_rev_dct, idct, test);
  272. dct_error("LIBMPEG2-MMX", 1, ff_mmx_idct, idct, test);
  273. dct_error("LIBMPEG2-MMXEXT", 1, ff_mmxext_idct, idct, test);
  274. dct_error("SIMPLE-C", 1, simple_idct, idct, test);
  275. dct_error("SIMPLE-MMX", 1, simple_idct_mmx, idct, test);
  276. // dct_error("ODIVX-C", 1, odivx_idct_c, idct);
  277. //printf(" test against odivx idct\n");
  278. // dct_error("REF", 1, idct, odivx_idct_c);
  279. // dct_error("INT", 1, j_rev_dct, odivx_idct_c);
  280. // dct_error("MMX", 1, ff_mmx_idct, odivx_idct_c);
  281. // dct_error("MMXEXT", 1, ff_mmxext_idct, odivx_idct_c);
  282. // dct_error("SIMPLE-C", 1, simple_idct, odivx_idct_c);
  283. // dct_error("SIMPLE-MMX", 1, simple_idct_mmx, odivx_idct_c);
  284. // dct_error("ODIVX-C", 1, odivx_idct_c, odivx_idct_c);
  285. }
  286. return 0;
  287. }