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.
64793 Commits
32 Branches
1.0GB
Tree: a86d527c8b
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from 'a86d527c8b'
${ noResults }
FFmpeg/libavcodec/dct-test.c

580 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/idct_xvid.h"

  49. #include "dctref.h"

  50. 

  51. // ALTIVEC

  52. void ff_fdct_altivec(int16_t *block);

  53. 

  54. // ARM

  55. void ff_j_rev_dct_arm(int16_t *data);

  56. void ff_simple_idct_arm(int16_t *data);

  57. void ff_simple_idct_armv5te(int16_t *data);

  58. void ff_simple_idct_armv6(int16_t *data);

  59. void ff_simple_idct_neon(int16_t *data);

  60. 

  61. struct algo {

  62.     const char *name;

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

  64.     enum idct_permutation_type perm_type;

  65.     int cpu_flag;

  66.     int nonspec;

  67. };

  68. 

  69. static const struct algo fdct_tab[] = {

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

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

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

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

  74. 

  75. #if HAVE_MMX_INLINE

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

  77. #endif

  78. #if HAVE_MMXEXT_INLINE

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

  80. #endif

  81. #if HAVE_SSE2_INLINE

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

  83. #endif

  84. 

  85. #if HAVE_ALTIVEC

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

  87. #endif

  88. 

  89.     { 0 }

  90. };

  91. 

  92. static void ff_prores_idct_wrap(int16_t *dst){

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

  94.     int i;

  95. 

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

  97.         qmat[i]=4;

  98.     }

  99.     ff_prores_idct(dst, qmat);

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

  101.          dst[i] -= 512;

  102.     }

  103. }

  104. #if ARCH_X86_64 && HAVE_MMX && HAVE_YASM

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

  106.                                 int16_t *block, int16_t *qmat);

  107. 

  108. static void ff_prores_idct_put_10_sse2_wrap(int16_t *dst){

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

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

  111.     int i;

  112. 

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

  114.         qmat[i]=4;

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

  116.     }

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

  118. 

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

  120.          dst[i] -= 512;

  121.     }

  122. }

  123. #endif

  124. 

  125. static const struct algo idct_tab[] = {

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

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

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

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

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

  131. 

  132. #if HAVE_MMX_INLINE

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

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

  135. #endif

  136. #if HAVE_MMXEXT_INLINE

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

  138. #endif

  139. #if HAVE_SSE2_INLINE

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

  141. #if ARCH_X86_64 && HAVE_YASM

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

  143. #endif

  144. #endif

  145. 

  146. #if ARCH_ARM

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

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

  149. #endif

  150. #if HAVE_ARMV5TE

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

  152. #endif

  153. #if HAVE_ARMV6

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

  155. #endif

  156. #if HAVE_NEON && ARCH_ARM

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

  158. #endif

  159. 

  160.     { 0 }

  161. };

  162. 

  163. #define AANSCALE_BITS 12

  164. 

  165. #define NB_ITS 20000

  166. #define NB_ITS_SPEED 50000

  167. 

  168. static short idct_simple_mmx_perm[64] = {

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

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

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

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

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

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

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

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

  177. };

  178. 

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

  180. 

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

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

  183. 

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

  185. {

  186.     int i, j;

  187. 

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

  189. 

  190.     switch (test) {

  191.     case 0:

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

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

  194.         if (is_idct) {

  195.             ff_ref_fdct(block);

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

  197.                 block[i] >>= 3;

  198.         }

  199.         break;

  200.     case 1:

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

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

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

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

  205.         }

  206.         break;

  207.     case 2:

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

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

  210.         break;

  211.     }

  212. }

  213. 

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

  215.                     enum idct_permutation_type perm_type)

  216. {

  217.     int i;

  218. 

  219.     switch (perm_type) {

  220.     case FF_IDCT_PERM_LIBMPEG2:

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

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

  223.         break;

  224.     case FF_IDCT_PERM_SIMPLE:

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

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

  227.         break;

  228.     case FF_IDCT_PERM_SSE2:

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

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

  231.         break;

  232.     case FF_IDCT_PERM_PARTTRANS:

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

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

  235.         break;

  236.     case FF_IDCT_PERM_TRANSPOSE:

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

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

  239.         break;

  240.     default:

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

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

  243.         break;

  244.     }

  245. }

  246. 

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

  248. {

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

  250.     int it, i, scale;

  251.     int err_inf, v;

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

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

  254.     int maxout = 0;

  255.     int blockSumErrMax = 0, blockSumErr;

  256.     AVLFG prng;

  257.     const int vals=1<<bits;

  258.     double omse, ome;

  259.     int spec_err;

  260. 

  261.     av_lfg_init(&prng, 1);

  262. 

  263.     err_inf = 0;

  264.     err2 = 0;

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

  266.         sysErr[i] = 0;

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

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

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

  270. 

  271.         dct->func(block);

  272.         emms_c();

  273. 

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

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

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

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

  278.             }

  279.         }

  280. 

  281.         ref(block1);

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

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

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

  285. 

  286.         blockSumErr = 0;

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

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

  289.             err_sum += err;

  290.             v = abs(err);

  291.             if (v > err_inf)

  292.                 err_inf = v;

  293.             err2 += v * v;

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

  295.             blockSumErr += v;

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

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

  298.         }

  299.         if (blockSumErrMax < blockSumErr)

  300.             blockSumErrMax = blockSumErr;

  301.     }

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

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

  304. 

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

  306.         if (i % 8 == 0)

  307.             printf("\n");

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

  309.     }

  310.     printf("\n");

  311. 

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

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

  314. 

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

  316. 

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

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

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

  320.            maxout, blockSumErrMax);

  321. 

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

  323.         return 1;

  324. 

  325.     if (!speed)

  326.         return 0;

  327. 

  328.     /* speed test */

  329. 

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

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

  332. 

  333.     ti = av_gettime_relative();

  334.     it1 = 0;

  335.     do {

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

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

  338.             dct->func(block);

  339.         }

  340.         emms_c();

  341.         it1 += NB_ITS_SPEED;

  342.         ti1 = av_gettime_relative() - ti;

  343.     } while (ti1 < 1000000);

  344. 

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

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

  347. 

  348.     return 0;

  349. }

  350. 

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

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

  353. 

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

  355. {

  356.     static int init;

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

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

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

  360.     double s, sum, v;

  361.     int i, j, k;

  362. 

  363.     if (!init) {

  364.         init = 1;

  365. 

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

  367.             sum = 0;

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

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

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

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

  372.             }

  373.         }

  374. 

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

  376.             sum = 0;

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

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

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

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

  381.             }

  382.         }

  383.     }

  384. 

  385.     /* butterfly */

  386.     s = 0.5 * sqrt(2.0);

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

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

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

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

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

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

  393.         }

  394.     }

  395. 

  396.     /* idct8 on lines */

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

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

  399.             sum = 0;

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

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

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

  403.         }

  404.     }

  405. 

  406.     /* idct4 */

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

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

  409.             /* top */

  410.             sum = 0;

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

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

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

  414. 

  415.             /* bottom */

  416.             sum = 0;

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

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

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

  420.         }

  421.     }

  422. 

  423.     /* clamp and store the result */

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

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

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

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

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

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

  430.         }

  431.     }

  432. }

  433. 

  434. static void idct248_error(const char *name,

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

  436.                                               int16_t *block),

  437.                           int speed)

  438. {

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

  440.     AVLFG prng;

  441. 

  442.     av_lfg_init(&prng, 1);

  443. 

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

  445.        important here) */

  446.     err_max = 0;

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

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

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

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

  451.         block1[0] += 1024;

  452. 

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

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

  455.         idct248_ref(img_dest1, 8, block);

  456. 

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

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

  459.         idct248_put(img_dest, 8, block);

  460. 

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

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

  463.             if (v == 255)

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

  465.             if (v > err_max)

  466.                 err_max = v;

  467.         }

  468. #if 0

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

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

  471.             int j;

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

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

  474.             }

  475.             printf("\n");

  476.         }

  477. 

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

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

  480.             int j;

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

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

  483.             }

  484.             printf("\n");

  485.         }

  486. #endif

  487.     }

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

  489. 

  490.     if (!speed)

  491.         return;

  492. 

  493.     ti = av_gettime_relative();

  494.     it1 = 0;

  495.     do {

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

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

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

  499.             idct248_put(img_dest, 8, block);

  500.         }

  501.         emms_c();

  502.         it1 += NB_ITS_SPEED;

  503.         ti1 = av_gettime_relative() - ti;

  504.     } while (ti1 < 1000000);

  505. 

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

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

  508. }

  509. 

  510. static void help(void)

  511. {

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

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

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

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

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

  517.            "-i          test IDCT implementations\n"

  518.            "-4          test IDCT248 implementations\n"

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

  520. }

  521. 

  522. #if !HAVE_GETOPT

  523. #include "compat/getopt.c"

  524. #endif

  525. 

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

  527. {

  528.     int test_idct = 0, test_248_dct = 0;

  529.     int c, i;

  530.     int test = 1;

  531.     int speed = 0;

  532.     int err = 0;

  533.     int bits=8;

  534. 

  535.     ff_ref_dct_init();

  536. 

  537.     for (;;) {

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

  539.         if (c == -1)

  540.             break;

  541.         switch (c) {

  542.         case 'i':

  543.             test_idct = 1;

  544.             break;

  545.         case '4':

  546.             test_248_dct = 1;

  547.             break;

  548.         case 't':

  549.             speed = 1;

  550.             break;

  551.         default:

  552.         case 'h':

  553.             help();

  554.             return 0;

  555.         }

  556.     }

  557. 

  558.     if (optind < argc)

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

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

  561. 

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

  563. 

  564.     if (test_248_dct) {

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

  566.     } else {

  567.         const int cpu_flags = av_get_cpu_flags();

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

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

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

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

  572.             }

  573.     }

  574. 

  575.     if (err)

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

  577. 

  578.     return !!err;

  579. }