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.

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