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.

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