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.
42437 Commits
32 Branches
552MB
Tree: 9b3f9f43a7
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from '9b3f9f43a7'
${ noResults }
FFmpeg/libavcodec/dct-test.c

575 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 <stdlib.h>

  29. #include <stdio.h>

  30. #include <string.h>

  31. #include <unistd.h>

  32. #include <math.h>

  33. 

  34. #include "libavutil/cpu.h"

  35. #include "libavutil/common.h"

  36. #include "libavutil/lfg.h"

  37. #include "libavutil/time.h"

  38. 

  39. #include "simple_idct.h"

  40. #include "aandcttab.h"

  41. #include "faandct.h"

  42. #include "faanidct.h"

  43. #include "x86/idct_xvid.h"

  44. #include "dctref.h"

  45. 

  46. #undef printf

  47. 

  48. void ff_mmx_idct(DCTELEM *data);

  49. void ff_mmxext_idct(DCTELEM *data);

  50. 

  51. // BFIN

  52. void ff_bfin_idct(DCTELEM *block);

  53. void ff_bfin_fdct(DCTELEM *block);

  54. 

  55. // ALTIVEC

  56. void ff_fdct_altivec(DCTELEM *block);

  57. //void ff_idct_altivec(DCTELEM *block);?? no routine

  58. 

  59. // ARM

  60. void ff_j_rev_dct_arm(DCTELEM *data);

  61. void ff_simple_idct_arm(DCTELEM *data);

  62. void ff_simple_idct_armv5te(DCTELEM *data);

  63. void ff_simple_idct_armv6(DCTELEM *data);

  64. void ff_simple_idct_neon(DCTELEM *data);

  65. 

  66. void ff_simple_idct_axp(DCTELEM *data);

  67. 

  68. struct algo {

  69.     const char *name;

  70.     void (*func)(DCTELEM *block);

  71.     enum formattag { NO_PERM, MMX_PERM, MMX_SIMPLE_PERM, SCALE_PERM,

  72.                      SSE2_PERM, PARTTRANS_PERM, TRANSPOSE_PERM } format;

  73.     int mm_support;

  74.     int nonspec;

  75. };

  76. 

  77. static int cpu_flags;

  78. 

  79. static const struct algo fdct_tab[] = {

  80.     { "REF-DBL",        ff_ref_fdct,           NO_PERM    },

  81.     { "FAAN",           ff_faandct,            NO_PERM    },

  82.     { "IJG-AAN-INT",    ff_fdct_ifast,         SCALE_PERM },

  83.     { "IJG-LLM-INT",    ff_jpeg_fdct_islow_8,  NO_PERM    },

  84. 

  85. #if HAVE_MMX

  86.     { "MMX",            ff_fdct_mmx,           NO_PERM,   AV_CPU_FLAG_MMX     },

  87.     { "MMX2",           ff_fdct_mmx2,          NO_PERM,   AV_CPU_FLAG_MMX2    },

  88.     { "SSE2",           ff_fdct_sse2,          NO_PERM,   AV_CPU_FLAG_SSE2    },

  89. #endif

  90. 

  91. #if HAVE_ALTIVEC

  92.     { "altivecfdct",    ff_fdct_altivec,       NO_PERM,   AV_CPU_FLAG_ALTIVEC },

  93. #endif

  94. 

  95. #if ARCH_BFIN

  96.     { "BFINfdct",       ff_bfin_fdct,          NO_PERM  },

  97. #endif

  98. 

  99.     { 0 }

  100. };

  101. 

  102. #if ARCH_X86_64 && HAVE_MMX && HAVE_YASM

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

  104.                                 DCTELEM *block, int16_t *qmat);

  105. 

  106. static void ff_prores_idct_put_10_sse2_wrap(DCTELEM *dst){

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

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

  109.     int i;

  110. 

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

  112.         qmat[i]=4;

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

  114.     }

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

  116. }

  117. #endif

  118. 

  119. static const struct algo idct_tab[] = {

  120.     { "FAANI",          ff_faanidct,           NO_PERM  },

  121.     { "REF-DBL",        ff_ref_idct,           NO_PERM  },

  122.     { "INT",            ff_j_rev_dct,          MMX_PERM },

  123.     { "SIMPLE-C",       ff_simple_idct_8,      NO_PERM  },

  124. 

  125. #if HAVE_MMX

  126. #if CONFIG_GPL

  127.     { "LIBMPEG2-MMX",   ff_mmx_idct,           MMX_PERM,  AV_CPU_FLAG_MMX,  1 },

  128.     { "LIBMPEG2-MMX2",  ff_mmxext_idct,        MMX_PERM,  AV_CPU_FLAG_MMX2, 1 },

  129. #endif

  130.     { "SIMPLE-MMX",     ff_simple_idct_mmx,  MMX_SIMPLE_PERM, AV_CPU_FLAG_MMX },

  131.     { "XVID-MMX",       ff_idct_xvid_mmx,      NO_PERM,   AV_CPU_FLAG_MMX,  1 },

  132.     { "XVID-MMX2",      ff_idct_xvid_mmx2,     NO_PERM,   AV_CPU_FLAG_MMX2, 1 },

  133.     { "XVID-SSE2",      ff_idct_xvid_sse2,     SSE2_PERM, AV_CPU_FLAG_SSE2, 1 },

  134. #if ARCH_X86_64 && HAVE_YASM

  135.     { "PR-SSE2",        ff_prores_idct_put_10_sse2_wrap,     TRANSPOSE_PERM, AV_CPU_FLAG_SSE2, 1 },

  136. #endif

  137. #endif

  138. 

  139. #if ARCH_BFIN

  140.     { "BFINidct",       ff_bfin_idct,          NO_PERM  },

  141. #endif

  142. 

  143. #if ARCH_ARM

  144.     { "SIMPLE-ARM",     ff_simple_idct_arm,    NO_PERM  },

  145.     { "INT-ARM",        ff_j_rev_dct_arm,      MMX_PERM },

  146. #endif

  147. #if HAVE_ARMV5TE

  148.     { "SIMPLE-ARMV5TE", ff_simple_idct_armv5te,NO_PERM  },

  149. #endif

  150. #if HAVE_ARMV6

  151.     { "SIMPLE-ARMV6",   ff_simple_idct_armv6,  MMX_PERM },

  152. #endif

  153. #if HAVE_NEON

  154.     { "SIMPLE-NEON",    ff_simple_idct_neon,   PARTTRANS_PERM },

  155. #endif

  156. 

  157. #if ARCH_ALPHA

  158.     { "SIMPLE-ALPHA",   ff_simple_idct_axp,    NO_PERM },

  159. #endif

  160. 

  161.     { 0 }

  162. };

  163. 

  164. #define AANSCALE_BITS 12

  165. 

  166. #define NB_ITS 20000

  167. #define NB_ITS_SPEED 50000

  168. 

  169. static short idct_mmx_perm[64];

  170. 

  171. static short idct_simple_mmx_perm[64] = {

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

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

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

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

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

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

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

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

  180. };

  181. 

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

  183. 

  184. static void idct_mmx_init(void)

  185. {

  186.     int i;

  187. 

  188.     /* the mmx/mmxext idct uses a reordered input, so we patch scan tables */

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

  190.         idct_mmx_perm[i] = (i & 0x38) | ((i & 6) >> 1) | ((i & 1) << 2);

  191.     }

  192. }

  193. 

  194. DECLARE_ALIGNED(16, static DCTELEM, block)[64];

  195. DECLARE_ALIGNED(8,  static DCTELEM, block1)[64];

  196. 

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

  198. {

  199.     int i, j;

  200. 

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

  202. 

  203.     switch (test) {

  204.     case 0:

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

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

  207.         if (is_idct) {

  208.             ff_ref_fdct(block);

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

  210.                 block[i] >>= 3;

  211.         }

  212.         break;

  213.     case 1:

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

  215.         for (i = 0; i < j; i++)

  216.             block[av_lfg_get(prng) % 64] = av_lfg_get(prng) % (2*vals) -vals;

  217.         break;

  218.     case 2:

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

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

  221.         break;

  222.     }

  223. }

  224. 

  225. static void permute(DCTELEM dst[64], const DCTELEM src[64], int perm)

  226. {

  227.     int i;

  228. 

  229.     if (perm == MMX_PERM) {

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

  231.             dst[idct_mmx_perm[i]] = src[i];

  232.     } else if (perm == MMX_SIMPLE_PERM) {

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

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

  235.     } else if (perm == SSE2_PERM) {

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

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

  238.     } else if (perm == PARTTRANS_PERM) {

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

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

  241.     } else if (perm == TRANSPOSE_PERM) {

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

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

  244.     } else {

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

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

  247.     }

  248. }

  249. 

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

  251. {

  252.     void (*ref)(DCTELEM *block) = is_idct ? ff_ref_idct : ff_ref_fdct;

  253.     int it, i, scale;

  254.     int err_inf, v;

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

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

  257.     int maxout = 0;

  258.     int blockSumErrMax = 0, blockSumErr;

  259.     AVLFG prng;

  260.     const int vals=1<<bits;

  261.     double omse, ome;

  262.     int spec_err;

  263. 

  264.     av_lfg_init(&prng, 1);

  265. 

  266.     err_inf = 0;

  267.     err2 = 0;

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

  269.         sysErr[i] = 0;

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

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

  272.         permute(block, block1, dct->format);

  273. 

  274.         dct->func(block);

  275.         emms_c();

  276. 

  277.         if (dct->format == SCALE_PERM) {

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

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

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

  281.             }

  282.         }

  283. 

  284.         ref(block1);

  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->format);

  332. 

  333.     ti = av_gettime();

  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() - 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();

  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() - 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. int main(int argc, char **argv)

  523. {

  524.     int test_idct = 0, test_248_dct = 0;

  525.     int c, i;

  526.     int test = 1;

  527.     int speed = 0;

  528.     int err = 0;

  529.     int bits=8;

  530. 

  531.     cpu_flags = av_get_cpu_flags();

  532. 

  533.     ff_ref_dct_init();

  534.     idct_mmx_init();

  535. 

  536.     for (;;) {

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

  538.         if (c == -1)

  539.             break;

  540.         switch (c) {

  541.         case 'i':

  542.             test_idct = 1;

  543.             break;

  544.         case '4':

  545.             test_248_dct = 1;

  546.             break;

  547.         case 't':

  548.             speed = 1;

  549.             break;

  550.         default:

  551.         case 'h':

  552.             help();

  553.             return 0;

  554.         }

  555.     }

  556. 

  557.     if (optind < argc)

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

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

  560. 

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

  562. 

  563.     if (test_248_dct) {

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

  565.     } else {

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

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

  568.             if (!(~cpu_flags & algos[i].mm_support)) {

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

  570.             }

  571.     }

  572. 

  573.     return err;

  574. }