falkTX
/
FFmpeg
mirror of https://github.com/falkTX/FFmpeg.git
1
0
Fork 0
Code Issues 0 Releases 338 Wiki Activity
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.
64804 Commits
32 Branches
555MB
Tree: 776647360d
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from '776647360d'
${ noResults }
FFmpeg/libavcodec/dct-test.c

582 lines
16KB
Raw Blame History 

  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. /**

  23.  * @file

  24.  * DCT test (c) 2001 Fabrice Bellard

  25.  * Started from sample code by Juan J. Sierralta P.

  26.  */

  27. 

  28. #include "config.h"

  29. #include <stdlib.h>

  30. #include <stdio.h>

  31. #include <string.h>

  32. #if HAVE_UNISTD_H

  33. #include <unistd.h>

  34. #endif

  35. #include <math.h>

  36. 

  37. #include "libavutil/cpu.h"

  38. #include "libavutil/common.h"

  39. #include "libavutil/lfg.h"

  40. #include "libavutil/time.h"

  41. 

  42. #include "dct.h"

  43. #include "idctdsp.h"

  44. #include "simple_idct.h"

  45. #include "aandcttab.h"

  46. #include "faandct.h"

  47. #include "faanidct.h"

  48. #include "x86/fdct.h"

  49. #include "x86/idct_xvid.h"

  50. #include "x86/simple_idct.h"

  51. #include "dctref.h"

  52. 

  53. // ALTIVEC

  54. void ff_fdct_altivec(int16_t *block);

  55. 

  56. // ARM

  57. void ff_j_rev_dct_arm(int16_t *data);

  58. void ff_simple_idct_arm(int16_t *data);

  59. void ff_simple_idct_armv5te(int16_t *data);

  60. void ff_simple_idct_armv6(int16_t *data);

  61. void ff_simple_idct_neon(int16_t *data);

  62. 

  63. struct algo {

  64.     const char *name;

  65.     void (*func)(int16_t *block);

  66.     enum idct_permutation_type perm_type;

  67.     int cpu_flag;

  68.     int nonspec;

  69. };

  70. 

  71. static const struct algo fdct_tab[] = {

  72.     { "REF-DBL",     ff_ref_fdct,          FF_IDCT_PERM_NONE },

  73.     { "FAAN",        ff_faandct,           FF_IDCT_PERM_NONE },

  74.     { "IJG-AAN-INT", ff_fdct_ifast,        FF_IDCT_PERM_NONE },

  75.     { "IJG-LLM-INT", ff_jpeg_fdct_islow_8, FF_IDCT_PERM_NONE },

  76. 

  77. #if HAVE_MMX_INLINE

  78.     { "MMX",         ff_fdct_mmx,          FF_IDCT_PERM_NONE, AV_CPU_FLAG_MMX },

  79. #endif

  80. #if HAVE_MMXEXT_INLINE

  81.     { "MMXEXT",      ff_fdct_mmxext,       FF_IDCT_PERM_NONE, AV_CPU_FLAG_MMXEXT },

  82. #endif

  83. #if HAVE_SSE2_INLINE

  84.     { "SSE2",        ff_fdct_sse2,         FF_IDCT_PERM_NONE, AV_CPU_FLAG_SSE2 },

  85. #endif

  86. 

  87. #if HAVE_ALTIVEC

  88.     { "altivecfdct", ff_fdct_altivec,      FF_IDCT_PERM_NONE, AV_CPU_FLAG_ALTIVEC },

  89. #endif

  90. 

  91.     { 0 }

  92. };

  93. 

  94. static void ff_prores_idct_wrap(int16_t *dst){

  95.     DECLARE_ALIGNED(16, static int16_t, qmat)[64];

  96.     int i;

  97. 

  98.     for(i=0; i<64; i++){

  99.         qmat[i]=4;

  100.     }

  101.     ff_prores_idct(dst, qmat);

  102.     for(i=0; i<64; i++) {

  103.          dst[i] -= 512;

  104.     }

  105. }

  106. #if ARCH_X86_64 && HAVE_MMX && HAVE_YASM

  107. void ff_prores_idct_put_10_sse2(uint16_t *dst, int linesize,

  108.                                 int16_t *block, int16_t *qmat);

  109. 

  110. static void ff_prores_idct_put_10_sse2_wrap(int16_t *dst){

  111.     DECLARE_ALIGNED(16, static int16_t, qmat)[64];

  112.     DECLARE_ALIGNED(16, static int16_t, tmp)[64];

  113.     int i;

  114. 

  115.     for(i=0; i<64; i++){

  116.         qmat[i]=4;

  117.         tmp[i]= dst[i];

  118.     }

  119.     ff_prores_idct_put_10_sse2(dst, 16, tmp, qmat);

  120. 

  121.     for(i=0; i<64; i++) {

  122.          dst[i] -= 512;

  123.     }

  124. }

  125. #endif

  126. 

  127. static const struct algo idct_tab[] = {

  128.     { "FAANI",       ff_faanidct,          FF_IDCT_PERM_NONE },

  129.     { "REF-DBL",     ff_ref_idct,          FF_IDCT_PERM_NONE },

  130.     { "INT",         ff_j_rev_dct,         FF_IDCT_PERM_LIBMPEG2 },

  131.     { "SIMPLE-C",    ff_simple_idct_8,     FF_IDCT_PERM_NONE },

  132.     { "PR-C",        ff_prores_idct_wrap,  FF_IDCT_PERM_NONE, 0, 1 },

  133. 

  134. #if HAVE_MMX_INLINE

  135.     { "SIMPLE-MMX",     ff_simple_idct_mmx,     FF_IDCT_PERM_SIMPLE,    AV_CPU_FLAG_MMX },

  136.     { "XVID-MMX",       ff_idct_xvid_mmx,       FF_IDCT_PERM_NONE,      AV_CPU_FLAG_MMX,    1 },

  137. #endif

  138. #if HAVE_MMXEXT_INLINE

  139.     { "XVID-MMXEXT",    ff_idct_xvid_mmxext,    FF_IDCT_PERM_NONE,      AV_CPU_FLAG_MMXEXT, 1 },

  140. #endif

  141. #if HAVE_SSE2_INLINE

  142.     { "XVID-SSE2",      ff_idct_xvid_sse2,      FF_IDCT_PERM_SSE2,      AV_CPU_FLAG_SSE2,   1 },

  143. #if ARCH_X86_64 && HAVE_YASM

  144.     { "PR-SSE2",        ff_prores_idct_put_10_sse2_wrap, FF_IDCT_PERM_TRANSPOSE, AV_CPU_FLAG_SSE2, 1 },

  145. #endif

  146. #endif

  147. 

  148. #if ARCH_ARM

  149.     { "SIMPLE-ARM",     ff_simple_idct_arm,     FF_IDCT_PERM_NONE },

  150.     { "INT-ARM",        ff_j_rev_dct_arm,       FF_IDCT_PERM_LIBMPEG2 },

  151. #endif

  152. #if HAVE_ARMV5TE

  153.     { "SIMPLE-ARMV5TE", ff_simple_idct_armv5te, FF_IDCT_PERM_NONE,      AV_CPU_FLAG_ARMV5TE },

  154. #endif

  155. #if HAVE_ARMV6

  156.     { "SIMPLE-ARMV6",   ff_simple_idct_armv6,   FF_IDCT_PERM_LIBMPEG2,  AV_CPU_FLAG_ARMV6 },

  157. #endif

  158. #if HAVE_NEON && ARCH_ARM

  159.     { "SIMPLE-NEON",    ff_simple_idct_neon,    FF_IDCT_PERM_PARTTRANS, AV_CPU_FLAG_NEON },

  160. #endif

  161. 

  162.     { 0 }

  163. };

  164. 

  165. #define AANSCALE_BITS 12

  166. 

  167. #define NB_ITS 20000

  168. #define NB_ITS_SPEED 50000

  169. 

  170. static short idct_simple_mmx_perm[64] = {

  171.     0x00, 0x08, 0x04, 0x09, 0x01, 0x0C, 0x05, 0x0D,

  172.     0x10, 0x18, 0x14, 0x19, 0x11, 0x1C, 0x15, 0x1D,

  173.     0x20, 0x28, 0x24, 0x29, 0x21, 0x2C, 0x25, 0x2D,

  174.     0x12, 0x1A, 0x16, 0x1B, 0x13, 0x1E, 0x17, 0x1F,

  175.     0x02, 0x0A, 0x06, 0x0B, 0x03, 0x0E, 0x07, 0x0F,

  176.     0x30, 0x38, 0x34, 0x39, 0x31, 0x3C, 0x35, 0x3D,

  177.     0x22, 0x2A, 0x26, 0x2B, 0x23, 0x2E, 0x27, 0x2F,

  178.     0x32, 0x3A, 0x36, 0x3B, 0x33, 0x3E, 0x37, 0x3F,

  179. };

  180. 

  181. static const uint8_t idct_sse2_row_perm[8] = { 0, 4, 1, 5, 2, 6, 3, 7 };

  182. 

  183. DECLARE_ALIGNED(16, static int16_t, block)[64];

  184. DECLARE_ALIGNED(8,  static int16_t, block1)[64];

  185. 

  186. static void init_block(int16_t block[64], int test, int is_idct, AVLFG *prng, int vals)

  187. {

  188.     int i, j;

  189. 

  190.     memset(block, 0, 64 * sizeof(*block));

  191. 

  192.     switch (test) {

  193.     case 0:

  194.         for (i = 0; i < 64; i++)

  195.             block[i] = (av_lfg_get(prng) % (2*vals)) -vals;

  196.         if (is_idct) {

  197.             ff_ref_fdct(block);

  198.             for (i = 0; i < 64; i++)

  199.                 block[i] >>= 3;

  200.         }

  201.         break;

  202.     case 1:

  203.         j = av_lfg_get(prng) % 10 + 1;

  204.         for (i = 0; i < j; i++) {

  205.             int idx = av_lfg_get(prng) % 64;

  206.             block[idx] = av_lfg_get(prng) % (2*vals) -vals;

  207.         }

  208.         break;

  209.     case 2:

  210.         block[ 0] = av_lfg_get(prng) % (16*vals) - (8*vals);

  211.         block[63] = (block[0] & 1) ^ 1;

  212.         break;

  213.     }

  214. }

  215. 

  216. static void permute(int16_t dst[64], const int16_t src[64],

  217.                     enum idct_permutation_type perm_type)

  218. {

  219.     int i;

  220. 

  221.     switch (perm_type) {

  222.     case FF_IDCT_PERM_LIBMPEG2:

  223.         for (i = 0; i < 64; i++)

  224.             dst[(i & 0x38) | ((i & 6) >> 1) | ((i & 1) << 2)] = src[i];

  225.         break;

  226.     case FF_IDCT_PERM_SIMPLE:

  227.         for (i = 0; i < 64; i++)

  228.             dst[idct_simple_mmx_perm[i]] = src[i];

  229.         break;

  230.     case FF_IDCT_PERM_SSE2:

  231.         for (i = 0; i < 64; i++)

  232.             dst[(i & 0x38) | idct_sse2_row_perm[i & 7]] = src[i];

  233.         break;

  234.     case FF_IDCT_PERM_PARTTRANS:

  235.         for (i = 0; i < 64; i++)

  236.             dst[(i & 0x24) | ((i & 3) << 3) | ((i >> 3) & 3)] = src[i];

  237.         break;

  238.     case FF_IDCT_PERM_TRANSPOSE:

  239.         for (i = 0; i < 64; i++)

  240.             dst[(i>>3) | ((i<<3)&0x38)] = src[i];

  241.         break;

  242.     default:

  243.         for (i = 0; i < 64; i++)

  244.             dst[i] = src[i];

  245.         break;

  246.     }

  247. }

  248. 

  249. static int dct_error(const struct algo *dct, int test, int is_idct, int speed, const int bits)

  250. {

  251.     void (*ref)(int16_t *block) = is_idct ? ff_ref_idct : ff_ref_fdct;

  252.     int it, i, scale;

  253.     int err_inf, v;

  254.     int64_t err2, ti, ti1, it1, err_sum = 0;

  255.     int64_t sysErr[64], sysErrMax = 0;

  256.     int maxout = 0;

  257.     int blockSumErrMax = 0, blockSumErr;

  258.     AVLFG prng;

  259.     const int vals=1<<bits;

  260.     double omse, ome;

  261.     int spec_err;

  262. 

  263.     av_lfg_init(&prng, 1);

  264. 

  265.     err_inf = 0;

  266.     err2 = 0;

  267.     for (i = 0; i < 64; i++)

  268.         sysErr[i] = 0;

  269.     for (it = 0; it < NB_ITS; it++) {

  270.         init_block(block1, test, is_idct, &prng, vals);

  271.         permute(block, block1, dct->perm_type);

  272. 

  273.         dct->func(block);

  274.         emms_c();

  275. 

  276.         if (!strcmp(dct->name, "IJG-AAN-INT")) {

  277.             for (i = 0; i < 64; i++) {

  278.                 scale = 8 * (1 << (AANSCALE_BITS + 11)) / ff_aanscales[i];

  279.                 block[i] = (block[i] * scale) >> AANSCALE_BITS;

  280.             }

  281.         }

  282. 

  283.         ref(block1);

  284.         if (!strcmp(dct->name, "PR-SSE2"))

  285.             for (i = 0; i < 64; i++)

  286.                 block1[i] = av_clip(block1[i], 4-512, 1019-512);

  287. 

  288.         blockSumErr = 0;

  289.         for (i = 0; i < 64; i++) {

  290.             int err = block[i] - block1[i];

  291.             err_sum += err;

  292.             v = abs(err);

  293.             if (v > err_inf)

  294.                 err_inf = v;

  295.             err2 += v * v;

  296.             sysErr[i] += block[i] - block1[i];

  297.             blockSumErr += v;

  298.             if (abs(block[i]) > maxout)

  299.                 maxout = abs(block[i]);

  300.         }

  301.         if (blockSumErrMax < blockSumErr)

  302.             blockSumErrMax = blockSumErr;

  303.     }

  304.     for (i = 0; i < 64; i++)

  305.         sysErrMax = FFMAX(sysErrMax, FFABS(sysErr[i]));

  306. 

  307.     for (i = 0; i < 64; i++) {

  308.         if (i % 8 == 0)

  309.             printf("\n");

  310.         printf("%7d ", (int) sysErr[i]);

  311.     }

  312.     printf("\n");

  313. 

  314.     omse = (double) err2 / NB_ITS / 64;

  315.     ome  = (double) err_sum / NB_ITS / 64;

  316. 

  317.     spec_err = is_idct && (err_inf > 1 || omse > 0.02 || fabs(ome) > 0.0015);

  318. 

  319.     printf("%s %s: max_err=%d omse=%0.8f ome=%0.8f syserr=%0.8f maxout=%d blockSumErr=%d\n",

  320.            is_idct ? "IDCT" : "DCT", dct->name, err_inf,

  321.            omse, ome, (double) sysErrMax / NB_ITS,

  322.            maxout, blockSumErrMax);

  323. 

  324.     if (spec_err && !dct->nonspec)

  325.         return 1;

  326. 

  327.     if (!speed)

  328.         return 0;

  329. 

  330.     /* speed test */

  331. 

  332.     init_block(block, test, is_idct, &prng, vals);

  333.     permute(block1, block, dct->perm_type);

  334. 

  335.     ti = av_gettime_relative();

  336.     it1 = 0;

  337.     do {

  338.         for (it = 0; it < NB_ITS_SPEED; it++) {

  339.             memcpy(block, block1, sizeof(block));

  340.             dct->func(block);

  341.         }

  342.         emms_c();

  343.         it1 += NB_ITS_SPEED;

  344.         ti1 = av_gettime_relative() - ti;

  345.     } while (ti1 < 1000000);

  346. 

  347.     printf("%s %s: %0.1f kdct/s\n", is_idct ? "IDCT" : "DCT", dct->name,

  348.            (double) it1 * 1000.0 / (double) ti1);

  349. 

  350.     return 0;

  351. }

  352. 

  353. DECLARE_ALIGNED(8, static uint8_t, img_dest)[64];

  354. DECLARE_ALIGNED(8, static uint8_t, img_dest1)[64];

  355. 

  356. static void idct248_ref(uint8_t *dest, int linesize, int16_t *block)

  357. {

  358.     static int init;

  359.     static double c8[8][8];

  360.     static double c4[4][4];

  361.     double block1[64], block2[64], block3[64];

  362.     double s, sum, v;

  363.     int i, j, k;

  364. 

  365.     if (!init) {

  366.         init = 1;

  367. 

  368.         for (i = 0; i < 8; i++) {

  369.             sum = 0;

  370.             for (j = 0; j < 8; j++) {

  371.                 s = (i == 0) ? sqrt(1.0 / 8.0) : sqrt(1.0 / 4.0);

  372.                 c8[i][j] = s * cos(M_PI * i * (j + 0.5) / 8.0);

  373.                 sum += c8[i][j] * c8[i][j];

  374.             }

  375.         }

  376. 

  377.         for (i = 0; i < 4; i++) {

  378.             sum = 0;

  379.             for (j = 0; j < 4; j++) {

  380.                 s = (i == 0) ? sqrt(1.0 / 4.0) : sqrt(1.0 / 2.0);

  381.                 c4[i][j] = s * cos(M_PI * i * (j + 0.5) / 4.0);

  382.                 sum += c4[i][j] * c4[i][j];

  383.             }

  384.         }

  385.     }

  386. 

  387.     /* butterfly */

  388.     s = 0.5 * sqrt(2.0);

  389.     for (i = 0; i < 4; i++) {

  390.         for (j = 0; j < 8; j++) {

  391.             block1[8 * (2 * i) + j] =

  392.                 (block[8 * (2 * i) + j] + block[8 * (2 * i + 1) + j]) * s;

  393.             block1[8 * (2 * i + 1) + j] =

  394.                 (block[8 * (2 * i) + j] - block[8 * (2 * i + 1) + j]) * s;

  395.         }

  396.     }

  397. 

  398.     /* idct8 on lines */

  399.     for (i = 0; i < 8; i++) {

  400.         for (j = 0; j < 8; j++) {

  401.             sum = 0;

  402.             for (k = 0; k < 8; k++)

  403.                 sum += c8[k][j] * block1[8 * i + k];

  404.             block2[8 * i + j] = sum;

  405.         }

  406.     }

  407. 

  408.     /* idct4 */

  409.     for (i = 0; i < 8; i++) {

  410.         for (j = 0; j < 4; j++) {

  411.             /* top */

  412.             sum = 0;

  413.             for (k = 0; k < 4; k++)

  414.                 sum += c4[k][j] * block2[8 * (2 * k) + i];

  415.             block3[8 * (2 * j) + i] = sum;

  416. 

  417.             /* bottom */

  418.             sum = 0;

  419.             for (k = 0; k < 4; k++)

  420.                 sum += c4[k][j] * block2[8 * (2 * k + 1) + i];

  421.             block3[8 * (2 * j + 1) + i] = sum;

  422.         }

  423.     }

  424. 

  425.     /* clamp and store the result */

  426.     for (i = 0; i < 8; i++) {

  427.         for (j = 0; j < 8; j++) {

  428.             v = block3[8 * i + j];

  429.             if      (v < 0)   v = 0;

  430.             else if (v > 255) v = 255;

  431.             dest[i * linesize + j] = (int) rint(v);

  432.         }

  433.     }

  434. }

  435. 

  436. static void idct248_error(const char *name,

  437.                           void (*idct248_put)(uint8_t *dest, int line_size,

  438.                                               int16_t *block),

  439.                           int speed)

  440. {

  441.     int it, i, it1, ti, ti1, err_max, v;

  442.     AVLFG prng;

  443. 

  444.     av_lfg_init(&prng, 1);

  445. 

  446.     /* just one test to see if code is correct (precision is less

  447.        important here) */

  448.     err_max = 0;

  449.     for (it = 0; it < NB_ITS; it++) {

  450.         /* XXX: use forward transform to generate values */

  451.         for (i = 0; i < 64; i++)

  452.             block1[i] = av_lfg_get(&prng) % 256 - 128;

  453.         block1[0] += 1024;

  454. 

  455.         for (i = 0; i < 64; i++)

  456.             block[i] = block1[i];

  457.         idct248_ref(img_dest1, 8, block);

  458. 

  459.         for (i = 0; i < 64; i++)

  460.             block[i] = block1[i];

  461.         idct248_put(img_dest, 8, block);

  462. 

  463.         for (i = 0; i < 64; i++) {

  464.             v = abs((int) img_dest[i] - (int) img_dest1[i]);

  465.             if (v == 255)

  466.                 printf("%d %d\n", img_dest[i], img_dest1[i]);

  467.             if (v > err_max)

  468.                 err_max = v;

  469.         }

  470. #if 0

  471.         printf("ref=\n");

  472.         for(i=0;i<8;i++) {

  473.             int j;

  474.             for(j=0;j<8;j++) {

  475.                 printf(" %3d", img_dest1[i*8+j]);

  476.             }

  477.             printf("\n");

  478.         }

  479. 

  480.         printf("out=\n");

  481.         for(i=0;i<8;i++) {

  482.             int j;

  483.             for(j=0;j<8;j++) {

  484.                 printf(" %3d", img_dest[i*8+j]);

  485.             }

  486.             printf("\n");

  487.         }

  488. #endif

  489.     }

  490.     printf("%s %s: err_inf=%d\n", 1 ? "IDCT248" : "DCT248", name, err_max);

  491. 

  492.     if (!speed)

  493.         return;

  494. 

  495.     ti = av_gettime_relative();

  496.     it1 = 0;

  497.     do {

  498.         for (it = 0; it < NB_ITS_SPEED; it++) {

  499.             for (i = 0; i < 64; i++)

  500.                 block[i] = block1[i];

  501.             idct248_put(img_dest, 8, block);

  502.         }

  503.         emms_c();

  504.         it1 += NB_ITS_SPEED;

  505.         ti1 = av_gettime_relative() - ti;

  506.     } while (ti1 < 1000000);

  507. 

  508.     printf("%s %s: %0.1f kdct/s\n", 1 ? "IDCT248" : "DCT248", name,

  509.            (double) it1 * 1000.0 / (double) ti1);

  510. }

  511. 

  512. static void help(void)

  513. {

  514.     printf("dct-test [-i] [<test-number>] [<bits>]\n"

  515.            "test-number 0 -> test with random matrixes\n"

  516.            "            1 -> test with random sparse matrixes\n"

  517.            "            2 -> do 3. test from mpeg4 std\n"

  518.            "bits        Number of time domain bits to use, 8 is default\n"

  519.            "-i          test IDCT implementations\n"

  520.            "-4          test IDCT248 implementations\n"

  521.            "-t          speed test\n");

  522. }

  523. 

  524. #if !HAVE_GETOPT

  525. #include "compat/getopt.c"

  526. #endif

  527. 

  528. int main(int argc, char **argv)

  529. {

  530.     int test_idct = 0, test_248_dct = 0;

  531.     int c, i;

  532.     int test = 1;

  533.     int speed = 0;

  534.     int err = 0;

  535.     int bits=8;

  536. 

  537.     ff_ref_dct_init();

  538. 

  539.     for (;;) {

  540.         c = getopt(argc, argv, "ih4t");

  541.         if (c == -1)

  542.             break;

  543.         switch (c) {

  544.         case 'i':

  545.             test_idct = 1;

  546.             break;

  547.         case '4':

  548.             test_248_dct = 1;

  549.             break;

  550.         case 't':

  551.             speed = 1;

  552.             break;

  553.         default:

  554.         case 'h':

  555.             help();

  556.             return 0;

  557.         }

  558.     }

  559. 

  560.     if (optind < argc)

  561.         test = atoi(argv[optind]);

  562.     if(optind+1 < argc) bits= atoi(argv[optind+1]);

  563. 

  564.     printf("ffmpeg DCT/IDCT test\n");

  565. 

  566.     if (test_248_dct) {

  567.         idct248_error("SIMPLE-C", ff_simple_idct248_put, speed);

  568.     } else {

  569.         const int cpu_flags = av_get_cpu_flags();

  570.         const struct algo *algos = test_idct ? idct_tab : fdct_tab;

  571.         for (i = 0; algos[i].name; i++)

  572.             if (!(~cpu_flags & algos[i].cpu_flag)) {

  573.                 err |= dct_error(&algos[i], test, test_idct, speed, bits);

  574.             }

  575.     }

  576. 

  577.     if (err)

  578.         printf("Error: %d.\n", err);

  579. 

  580.     return !!err;

  581. }