/* * jidctint.c * * This file was part of the Independent JPEG Group's software: * Copyright (C) 1991-1998, Thomas G. Lane. * Modification developed 2002-2018 by Guido Vollbeding. * libjpeg-turbo Modifications: * Copyright (C) 2015, 2020, 2022, D. R. Commander. * For conditions of distribution and use, see the accompanying README.ijg * file. * * This file contains a slower but more accurate integer implementation of the * inverse DCT (Discrete Cosine Transform). In the IJG code, this routine * must also perform dequantization of the input coefficients. * * A 2-D IDCT can be done by 1-D IDCT on each column followed by 1-D IDCT * on each row (or vice versa, but it's more convenient to emit a row at * a time). Direct algorithms are also available, but they are much more * complex and seem not to be any faster when reduced to code. * * This implementation is based on an algorithm described in * C. Loeffler, A. Ligtenberg and G. Moschytz, "Practical Fast 1-D DCT * Algorithms with 11 Multiplications", Proc. Int'l. Conf. on Acoustics, * Speech, and Signal Processing 1989 (ICASSP '89), pp. 988-991. * The primary algorithm described there uses 11 multiplies and 29 adds. * We use their alternate method with 12 multiplies and 32 adds. * The advantage of this method is that no data path contains more than one * multiplication; this allows a very simple and accurate implementation in * scaled fixed-point arithmetic, with a minimal number of shifts. * * We also provide IDCT routines with various output sample block sizes for * direct resolution reduction or enlargement without additional resampling: * NxN (N=1...16) pixels for one 8x8 input DCT block. * * For N<8 we simply take the corresponding low-frequency coefficients of * the 8x8 input DCT block and apply an NxN point IDCT on the sub-block * to yield the downscaled outputs. * This can be seen as direct low-pass downsampling from the DCT domain * point of view rather than the usual spatial domain point of view, * yielding significant computational savings and results at least * as good as common bilinear (averaging) spatial downsampling. * * For N>8 we apply a partial NxN IDCT on the 8 input coefficients as * lower frequencies and higher frequencies assumed to be zero. * It turns out that the computational effort is similar to the 8x8 IDCT * regarding the output size. * Furthermore, the scaling and descaling is the same for all IDCT sizes. * * CAUTION: We rely on the FIX() macro except for the N=1,2,4,8 cases * since there would be too many additional constants to pre-calculate. #define JPEG_INTERNALS#include "jinclude.h" #include "jpeglib.h" #include "jdct.h" /* Private declarations for DCT subsystem */ #ifdef DCT_ISLOW_SUPPORTED/* * This module is specialized to the case DCTSIZE = 8. #if DCTSIZE != 8 this code only copes with 8 x8 DCT blocks. /* deliberate syntax err */ #endif /* * The poop on this scaling stuff is as follows: * * Each 1-D IDCT step produces outputs which are a factor of sqrt(N) * larger than the true IDCT outputs. The final outputs are therefore * a factor of N larger than desired; since N=8 this can be cured by * a simple right shift at the end of the algorithm. The advantage of * this arrangement is that we save two multiplications per 1-D IDCT, * because the y0 and y4 inputs need not be divided by sqrt(N). * * We have to do addition and subtraction of the integer inputs, which * is no problem, and multiplication by fractional constants, which is * a problem to do in integer arithmetic. We multiply all the constants * by CONST_SCALE and convert them to integer constants (thus retaining * CONST_BITS bits of precision in the constants). After doing a * multiplication we have to divide the product by CONST_SCALE, with proper * rounding, to produce the correct output. This division can be done * cheaply as a right shift of CONST_BITS bits. We postpone shifting * as long as possible so that partial sums can be added together with * full fractional precision. * * The outputs of the first pass are scaled up by PASS1_BITS bits so that * they are represented to better-than-integral precision. These outputs * require BITS_IN_JSAMPLE + PASS1_BITS + 3 bits; this fits in a 16-bit word * with the recommended scaling. (To scale up 12-bit sample data further, an * intermediate JLONG array would be needed.) * * To avoid overflow of the 32-bit intermediate results in pass 2, we must * have BITS_IN_JSAMPLE + CONST_BITS + PASS1_BITS <= 26. Error analysis * shows that the values given below are the most effective. #if BITS_IN_JSAMPLE == 8 #define CONST_BITS 13 #define PASS1_BITS 2 #else #define CONST_BITS 13 #define PASS1_BITS 1 /* lose a little precision to avoid overflow */ #endif /* Some C compilers fail to reduce "FIX(constant)" at compile time, thus * causing a lot of useless floating-point operations at run time. * To get around this we use the following pre-calculated constants. * If you change CONST_BITS you may want to add appropriate values. * (With a reasonable C compiler, you can just rely on the FIX() macro...) #if CONST_BITS == 13 #define FIX_0_298631336 ((JLONG)2446 ) /* FIX(0.298631336) */ #define FIX_0_390180644 ((JLONG)3196 ) /* FIX(0.390180644) */ #define FIX_0_541196100 ((JLONG)4433 ) /* FIX(0.541196100) */ #define FIX_0_765366865 ((JLONG)6270 ) /* FIX(0.765366865) */ #define FIX_0_899976223 ((JLONG)7373 ) /* FIX(0.899976223) */ #define FIX_1_175875602 ((JLONG)9633 ) /* FIX(1.175875602) */ #define FIX_1_501321110 ((JLONG)12299 ) /* FIX(1.501321110) */ #define FIX_1_847759065 ((JLONG)15137 ) /* FIX(1.847759065) */ #define FIX_1_961570560 ((JLONG)16069 ) /* FIX(1.961570560) */ #define FIX_2_053119869 ((JLONG)16819 ) /* FIX(2.053119869) */ #define FIX_2_562915447 ((JLONG)20995 ) /* FIX(2.562915447) */ #define FIX_3_072711026 ((JLONG)25172 ) /* FIX(3.072711026) */ #else #define FIX_0_298631336 FIX(0 .298631336 )#define FIX_0_390180644 FIX(0 .390180644 )#define FIX_0_541196100 FIX(0 .541196100 )#define FIX_0_765366865 FIX(0 .765366865 )#define FIX_0_899976223 FIX(0 .899976223 )#define FIX_1_175875602 FIX(1 .175875602 )#define FIX_1_501321110 FIX(1 .501321110 )#define FIX_1_847759065 FIX(1 .847759065 )#define FIX_1_961570560 FIX(1 .961570560 )#define FIX_2_053119869 FIX(2 .053119869 )#define FIX_2_562915447 FIX(2 .562915447 )#define FIX_3_072711026 FIX(3 .072711026 )#endif /* Multiply an JLONG variable by an JLONG constant to yield an JLONG result. * For 8-bit samples with the recommended scaling, all the variable * and constant values involved are no more than 16 bits wide, so a * 16x16->32 bit multiply can be used instead of a full 32x32 multiply. * For 12-bit samples, a full 32-bit multiplication will be needed. #if BITS_IN_JSAMPLE == 8 #define MULTIPLY(var, const ) MULTIPLY16C16(var, const )#else #define MULTIPLY(var, const ) ((var) * (const ))#endif /* Dequantize a coefficient by multiplying it by the multiplier-table * entry; produce an int result. In this module, both inputs and result * are 16 bits or less, so either int or short multiply will work. #define DEQUANTIZE(coef, quantval) (((ISLOW_MULT_TYPE)(coef)) * (quantval))/* * Perform dequantization and inverse DCT on one block of coefficients. void )int *wsptr;int ctr;int workspace[DCTSIZE2]; /* buffers data between passes */ /* Pass 1: process columns from input, store into work array. */ /* Note results are scaled up by sqrt(8) compared to a true IDCT; */ /* furthermore, we scale the results by 2**PASS1_BITS. */ for (ctr = DCTSIZE; ctr > 0 ; ctr--) {/* Due to quantization, we will usually find that many of the input * coefficients are zero, especially the AC terms. We can exploit this * by short-circuiting the IDCT calculation for any column in which all * the AC terms are zero. In that case each output is equal to the * DC coefficient (with scale factor as needed). * With typical images and quantization tables, half or more of the * column DCT calculations can be simplified this way. if (inptr[DCTSIZE * 1 ] == 0 && inptr[DCTSIZE * 2 ] == 0 &&3 ] == 0 && inptr[DCTSIZE * 4 ] == 0 &&5 ] == 0 && inptr[DCTSIZE * 6 ] == 0 &&7 ] == 0 ) {/* AC terms all zero */ int dcval = LEFT_SHIFT(DEQUANTIZE(inptr[DCTSIZE * 0 ],0 ]), PASS1_BITS);0 ] = dcval;1 ] = dcval;2 ] = dcval;3 ] = dcval;4 ] = dcval;5 ] = dcval;6 ] = dcval;7 ] = dcval;/* advance pointers to next column */ continue ;/* Even part: reverse the even part of the forward DCT. */ /* The rotator is sqrt(2)*c(-6). */ 2 ], quantptr[DCTSIZE * 2 ]);6 ], quantptr[DCTSIZE * 6 ]);0 ], quantptr[DCTSIZE * 0 ]);4 ], quantptr[DCTSIZE * 4 ]);/* Odd part per figure 8; the matrix is unitary and hence its * transpose is its inverse. i0..i3 are y7,y5,y3,y1 respectively. 7 ], quantptr[DCTSIZE * 7 ]);5 ], quantptr[DCTSIZE * 5 ]);3 ], quantptr[DCTSIZE * 3 ]);1 ], quantptr[DCTSIZE * 1 ]);/* sqrt(2) * c3 */ /* sqrt(2) * (-c1+c3+c5-c7) */ /* sqrt(2) * ( c1+c3-c5+c7) */ /* sqrt(2) * ( c1+c3+c5-c7) */ /* sqrt(2) * ( c1+c3-c5-c7) */ /* sqrt(2) * ( c7-c3) */ /* sqrt(2) * (-c1-c3) */ /* sqrt(2) * (-c3-c5) */ /* sqrt(2) * ( c5-c3) */ /* Final output stage: inputs are tmp10..tmp13, tmp0..tmp3 */ 0 ] = (int )DESCALE(tmp10 + tmp3, CONST_BITS - PASS1_BITS);7 ] = (int )DESCALE(tmp10 - tmp3, CONST_BITS - PASS1_BITS);1 ] = (int )DESCALE(tmp11 + tmp2, CONST_BITS - PASS1_BITS);6 ] = (int )DESCALE(tmp11 - tmp2, CONST_BITS - PASS1_BITS);2 ] = (int )DESCALE(tmp12 + tmp1, CONST_BITS - PASS1_BITS);5 ] = (int )DESCALE(tmp12 - tmp1, CONST_BITS - PASS1_BITS);3 ] = (int )DESCALE(tmp13 + tmp0, CONST_BITS - PASS1_BITS);4 ] = (int )DESCALE(tmp13 - tmp0, CONST_BITS - PASS1_BITS);/* advance pointers to next column */ /* Pass 2: process rows from work array, store into output array. */ /* Note that we must descale the results by a factor of 8 == 2**3, */ /* and also undo the PASS1_BITS scaling. */ for (ctr = 0 ; ctr < DCTSIZE; ctr++) {/* Rows of zeroes can be exploited in the same way as we did with columns. * However, the column calculation has created many nonzero AC terms, so * the simplification applies less often (typically 5% to 10% of the time). * On machines with very fast multiplication, it's possible that the * test takes more time than it's worth. In that case this section * may be commented out. #ifndef NO_ZERO_ROW_TESTif (wsptr[1 ] == 0 && wsptr[2 ] == 0 && wsptr[3 ] == 0 && wsptr[4 ] == 0 &&5 ] == 0 && wsptr[6 ] == 0 && wsptr[7 ] == 0 ) {/* AC terms all zero */ int )DESCALE((JLONG)wsptr[0 ],3 ) & RANGE_MASK];0 ] = dcval;1 ] = dcval;2 ] = dcval;3 ] = dcval;4 ] = dcval;5 ] = dcval;6 ] = dcval;7 ] = dcval;/* advance pointer to next row */ continue ;#endif /* Even part: reverse the even part of the forward DCT. */ /* The rotator is sqrt(2)*c(-6). */ 2 ];6 ];0 ] + (JLONG)wsptr[4 ], CONST_BITS);0 ] - (JLONG)wsptr[4 ], CONST_BITS);/* Odd part per figure 8; the matrix is unitary and hence its * transpose is its inverse. i0..i3 are y7,y5,y3,y1 respectively. 7 ];5 ];3 ];1 ];/* sqrt(2) * c3 */ /* sqrt(2) * (-c1+c3+c5-c7) */ /* sqrt(2) * ( c1+c3-c5+c7) */ /* sqrt(2) * ( c1+c3+c5-c7) */ /* sqrt(2) * ( c1+c3-c5-c7) */ /* sqrt(2) * ( c7-c3) */ /* sqrt(2) * (-c1-c3) */ /* sqrt(2) * (-c3-c5) */ /* sqrt(2) * ( c5-c3) */ /* Final output stage: inputs are tmp10..tmp13, tmp0..tmp3 */ 0 ] = range_limit[(int )DESCALE(tmp10 + tmp3,3 ) &7 ] = range_limit[(int )DESCALE(tmp10 - tmp3,3 ) &1 ] = range_limit[(int )DESCALE(tmp11 + tmp2,3 ) &6 ] = range_limit[(int )DESCALE(tmp11 - tmp2,3 ) &2 ] = range_limit[(int )DESCALE(tmp12 + tmp1,3 ) &5 ] = range_limit[(int )DESCALE(tmp12 - tmp1,3 ) &3 ] = range_limit[(int )DESCALE(tmp13 + tmp0,3 ) &4 ] = range_limit[(int )DESCALE(tmp13 - tmp0,3 ) &/* advance pointer to next row */ #ifdef IDCT_SCALING_SUPPORTED/* * Perform dequantization and inverse DCT on one block of coefficients, * producing a reduced-size 7x7 output block. * * Optimized algorithm with 12 multiplications in the 1-D kernel. * cK represents sqrt(2) * cos(K*pi/14). void )int *wsptr;int ctr;int workspace[7 * 7 ]; /* buffers data between passes */ /* Pass 1: process columns from input, store into work array. */ for (ctr = 0 ; ctr < 7 ; ctr++, inptr++, quantptr++, wsptr++) {/* Even part */ 0 ], quantptr[DCTSIZE * 0 ]);/* Add fudge factor here for final descale. */ 1 );2 ], quantptr[DCTSIZE * 2 ]);4 ], quantptr[DCTSIZE * 4 ]);6 ], quantptr[DCTSIZE * 6 ]);0 .881747734 )); /* c4 */ 0 .314692123 )); /* c6 */ 1 .841218003 )); /* c2+c4-c6 */ 1 .274162392 )) + tmp13; /* c2 */ 0 .077722536 )); /* c2-c4-c6 */ 2 .470602249 )); /* c2+c4+c6 */ 1 .414213562 )); /* c0 */ /* Odd part */ 1 ], quantptr[DCTSIZE * 1 ]);3 ], quantptr[DCTSIZE * 3 ]);5 ], quantptr[DCTSIZE * 5 ]);0 .935414347 )); /* (c3+c1-c5)/2 */ 0 .170262339 )); /* (c3+c5-c1)/2 */ 1 .378756276 )); /* -c1 */ 0 .613604268 )); /* c5 */ 1 .870828693 )); /* c3+c1-c5 */ /* Final output stage */ 7 * 0 ] = (int )RIGHT_SHIFT(tmp10 + tmp0, CONST_BITS - PASS1_BITS);7 * 6 ] = (int )RIGHT_SHIFT(tmp10 - tmp0, CONST_BITS - PASS1_BITS);7 * 1 ] = (int )RIGHT_SHIFT(tmp11 + tmp1, CONST_BITS - PASS1_BITS);7 * 5 ] = (int )RIGHT_SHIFT(tmp11 - tmp1, CONST_BITS - PASS1_BITS);7 * 2 ] = (int )RIGHT_SHIFT(tmp12 + tmp2, CONST_BITS - PASS1_BITS);7 * 4 ] = (int )RIGHT_SHIFT(tmp12 - tmp2, CONST_BITS - PASS1_BITS);7 * 3 ] = (int )RIGHT_SHIFT(tmp13, CONST_BITS - PASS1_BITS);/* Pass 2: process 7 rows from work array, store into output array. */ for (ctr = 0 ; ctr < 7 ; ctr++) {/* Even part */ /* Add fudge factor here for final descale. */ 0 ] + (ONE << (PASS1_BITS + 2 ));2 ];4 ];6 ];0 .881747734 )); /* c4 */ 0 .314692123 )); /* c6 */ 1 .841218003 )); /* c2+c4-c6 */ 1 .274162392 )) + tmp13; /* c2 */ 0 .077722536 )); /* c2-c4-c6 */ 2 .470602249 )); /* c2+c4+c6 */ 1 .414213562 )); /* c0 */ /* Odd part */ 1 ];3 ];5 ];0 .935414347 )); /* (c3+c1-c5)/2 */ 0 .170262339 )); /* (c3+c5-c1)/2 */ 1 .378756276 )); /* -c1 */ 0 .613604268 )); /* c5 */ 1 .870828693 )); /* c3+c1-c5 */ /* Final output stage */ 0 ] = range_limit[(int )RIGHT_SHIFT(tmp10 + tmp0,3 ) &6 ] = range_limit[(int )RIGHT_SHIFT(tmp10 - tmp0,3 ) &1 ] = range_limit[(int )RIGHT_SHIFT(tmp11 + tmp1,3 ) &5 ] = range_limit[(int )RIGHT_SHIFT(tmp11 - tmp1,3 ) &2 ] = range_limit[(int )RIGHT_SHIFT(tmp12 + tmp2,3 ) &4 ] = range_limit[(int )RIGHT_SHIFT(tmp12 - tmp2,3 ) &3 ] = range_limit[(int )RIGHT_SHIFT(tmp13,3 ) &7 ; /* advance pointer to next row */ /* * Perform dequantization and inverse DCT on one block of coefficients, * producing a reduced-size 6x6 output block. * * Optimized algorithm with 3 multiplications in the 1-D kernel. * cK represents sqrt(2) * cos(K*pi/12). void )int *wsptr;int ctr;int workspace[6 * 6 ]; /* buffers data between passes */ /* Pass 1: process columns from input, store into work array. */ for (ctr = 0 ; ctr < 6 ; ctr++, inptr++, quantptr++, wsptr++) {/* Even part */ 0 ], quantptr[DCTSIZE * 0 ]);/* Add fudge factor here for final descale. */ 1 );4 ], quantptr[DCTSIZE * 4 ]);0 .707106781 )); /* c4 */ 2 ], quantptr[DCTSIZE * 2 ]);1 .224744871 )); /* c2 */ /* Odd part */ 1 ], quantptr[DCTSIZE * 1 ]);3 ], quantptr[DCTSIZE * 3 ]);5 ], quantptr[DCTSIZE * 5 ]);0 .366025404 )); /* c5 */ /* Final output stage */ 6 * 0 ] = (int )RIGHT_SHIFT(tmp10 + tmp0, CONST_BITS - PASS1_BITS);6 * 5 ] = (int )RIGHT_SHIFT(tmp10 - tmp0, CONST_BITS - PASS1_BITS);6 * 1 ] = (int )(tmp11 + tmp1);6 * 4 ] = (int )(tmp11 - tmp1);6 * 2 ] = (int )RIGHT_SHIFT(tmp12 + tmp2, CONST_BITS - PASS1_BITS);6 * 3 ] = (int )RIGHT_SHIFT(tmp12 - tmp2, CONST_BITS - PASS1_BITS);/* Pass 2: process 6 rows from work array, store into output array. */ for (ctr = 0 ; ctr < 6 ; ctr++) {/* Even part */ /* Add fudge factor here for final descale. */ 0 ] + (ONE << (PASS1_BITS + 2 ));4 ];0 .707106781 )); /* c4 */ 2 ];1 .224744871 )); /* c2 */ /* Odd part */ 1 ];3 ];5 ];0 .366025404 )); /* c5 */ /* Final output stage */ 0 ] = range_limit[(int )RIGHT_SHIFT(tmp10 + tmp0,3 ) &5 ] = range_limit[(int )RIGHT_SHIFT(tmp10 - tmp0,3 ) &1 ] = range_limit[(int )RIGHT_SHIFT(tmp11 + tmp1,3 ) &4 ] = range_limit[(int )RIGHT_SHIFT(tmp11 - tmp1,3 ) &2 ] = range_limit[(int )RIGHT_SHIFT(tmp12 + tmp2,3 ) &3 ] = range_limit[(int )RIGHT_SHIFT(tmp12 - tmp2,3 ) &6 ; /* advance pointer to next row */ /* * Perform dequantization and inverse DCT on one block of coefficients, * producing a reduced-size 5x5 output block. * * Optimized algorithm with 5 multiplications in the 1-D kernel. * cK represents sqrt(2) * cos(K*pi/10). void )int *wsptr;int ctr;int workspace[5 * 5 ]; /* buffers data between passes */ /* Pass 1: process columns from input, store into work array. */ for (ctr = 0 ; ctr < 5 ; ctr++, inptr++, quantptr++, wsptr++) {/* Even part */ 0 ], quantptr[DCTSIZE * 0 ]);/* Add fudge factor here for final descale. */ 1 );2 ], quantptr[DCTSIZE * 2 ]);4 ], quantptr[DCTSIZE * 4 ]);0 .790569415 )); /* (c2+c4)/2 */ 0 .353553391 )); /* (c2-c4)/2 */ 2 );/* Odd part */ 1 ], quantptr[DCTSIZE * 1 ]);3 ], quantptr[DCTSIZE * 3 ]);0 .831253876 )); /* c3 */ 0 .513743148 )); /* c1-c3 */ 2 .176250899 )); /* c1+c3 */ /* Final output stage */ 5 * 0 ] = (int )RIGHT_SHIFT(tmp10 + tmp0, CONST_BITS - PASS1_BITS);5 * 4 ] = (int )RIGHT_SHIFT(tmp10 - tmp0, CONST_BITS - PASS1_BITS);5 * 1 ] = (int )RIGHT_SHIFT(tmp11 + tmp1, CONST_BITS - PASS1_BITS);5 * 3 ] = (int )RIGHT_SHIFT(tmp11 - tmp1, CONST_BITS - PASS1_BITS);5 * 2 ] = (int )RIGHT_SHIFT(tmp12, CONST_BITS - PASS1_BITS);/* Pass 2: process 5 rows from work array, store into output array. */ for (ctr = 0 ; ctr < 5 ; ctr++) {/* Even part */ /* Add fudge factor here for final descale. */ 0 ] + (ONE << (PASS1_BITS + 2 ));2 ];4 ];0 .790569415 )); /* (c2+c4)/2 */ 0 .353553391 )); /* (c2-c4)/2 */ 2 );/* Odd part */ 1 ];3 ];0 .831253876 )); /* c3 */ 0 .513743148 )); /* c1-c3 */ 2 .176250899 )); /* c1+c3 */ /* Final output stage */ 0 ] = range_limit[(int )RIGHT_SHIFT(tmp10 + tmp0,3 ) &4 ] = range_limit[(int )RIGHT_SHIFT(tmp10 - tmp0,3 ) &1 ] = range_limit[(int )RIGHT_SHIFT(tmp11 + tmp1,3 ) &3 ] = range_limit[(int )RIGHT_SHIFT(tmp11 - tmp1,3 ) &2 ] = range_limit[(int )RIGHT_SHIFT(tmp12,3 ) &5 ; /* advance pointer to next row */ /* * Perform dequantization and inverse DCT on one block of coefficients, * producing a reduced-size 3x3 output block. * * Optimized algorithm with 2 multiplications in the 1-D kernel. * cK represents sqrt(2) * cos(K*pi/6). void )int *wsptr;int ctr;int workspace[3 * 3 ]; /* buffers data between passes */ /* Pass 1: process columns from input, store into work array. */ for (ctr = 0 ; ctr < 3 ; ctr++, inptr++, quantptr++, wsptr++) {/* Even part */ 0 ], quantptr[DCTSIZE * 0 ]);/* Add fudge factor here for final descale. */ 1 );2 ], quantptr[DCTSIZE * 2 ]);0 .707106781 )); /* c2 */ /* Odd part */ 1 ], quantptr[DCTSIZE * 1 ]);1 .224744871 )); /* c1 */ /* Final output stage */ 3 * 0 ] = (int )RIGHT_SHIFT(tmp10 + tmp0, CONST_BITS - PASS1_BITS);3 * 2 ] = (int )RIGHT_SHIFT(tmp10 - tmp0, CONST_BITS - PASS1_BITS);3 * 1 ] = (int )RIGHT_SHIFT(tmp2, CONST_BITS - PASS1_BITS);/* Pass 2: process 3 rows from work array, store into output array. */ for (ctr = 0 ; ctr < 3 ; ctr++) {/* Even part */ /* Add fudge factor here for final descale. */ 0 ] + (ONE << (PASS1_BITS + 2 ));2 ];0 .707106781 )); /* c2 */ /* Odd part */ 1 ];1 .224744871 )); /* c1 */ /* Final output stage */ 0 ] = range_limit[(int )RIGHT_SHIFT(tmp10 + tmp0,3 ) &2 ] = range_limit[(int )RIGHT_SHIFT(tmp10 - tmp0,3 ) &1 ] = range_limit[(int )RIGHT_SHIFT(tmp2,3 ) &3 ; /* advance pointer to next row */ /* * Perform dequantization and inverse DCT on one block of coefficients, * producing a 9x9 output block. * * Optimized algorithm with 10 multiplications in the 1-D kernel. * cK represents sqrt(2) * cos(K*pi/18). void )int *wsptr;int ctr;int workspace[8 * 9 ]; /* buffers data between passes */ /* Pass 1: process columns from input, store into work array. */ for (ctr = 0 ; ctr < 8 ; ctr++, inptr++, quantptr++, wsptr++) {/* Even part */ 0 ], quantptr[DCTSIZE * 0 ]);/* Add fudge factor here for final descale. */ 1 );2 ], quantptr[DCTSIZE * 2 ]);4 ], quantptr[DCTSIZE * 4 ]);6 ], quantptr[DCTSIZE * 6 ]);0 .707106781 )); /* c6 */ 0 .707106781 )); /* c6 */ 1 .328926049 )); /* c2 */ 1 .083350441 )); /* c4 */ 0 .245575608 )); /* c8 */ /* Odd part */ 1 ], quantptr[DCTSIZE * 1 ]);3 ], quantptr[DCTSIZE * 3 ]);5 ], quantptr[DCTSIZE * 5 ]);7 ], quantptr[DCTSIZE * 7 ]);1 .224744871 )); /* -c3 */ 0 .909038955 )); /* c5 */ 0 .483689525 )); /* c7 */ 1 .392728481 )); /* c1 */ 1 .224744871 )); /* c3 */ /* Final output stage */ 8 * 0 ] = (int )RIGHT_SHIFT(tmp10 + tmp0, CONST_BITS - PASS1_BITS);8 * 8 ] = (int )RIGHT_SHIFT(tmp10 - tmp0, CONST_BITS - PASS1_BITS);8 * 1 ] = (int )RIGHT_SHIFT(tmp11 + tmp1, CONST_BITS - PASS1_BITS);8 * 7 ] = (int )RIGHT_SHIFT(tmp11 - tmp1, CONST_BITS - PASS1_BITS);8 * 2 ] = (int )RIGHT_SHIFT(tmp12 + tmp2, CONST_BITS - PASS1_BITS);8 * 6 ] = (int )RIGHT_SHIFT(tmp12 - tmp2, CONST_BITS - PASS1_BITS);8 * 3 ] = (int )RIGHT_SHIFT(tmp13 + tmp3, CONST_BITS - PASS1_BITS);8 * 5 ] = (int )RIGHT_SHIFT(tmp13 - tmp3, CONST_BITS - PASS1_BITS);8 * 4 ] = (int )RIGHT_SHIFT(tmp14, CONST_BITS - PASS1_BITS);/* Pass 2: process 9 rows from work array, store into output array. */ for (ctr = 0 ; ctr < 9 ; ctr++) {/* Even part */ /* Add fudge factor here for final descale. */ 0 ] + (ONE << (PASS1_BITS + 2 ));2 ];4 ];6 ];0 .707106781 )); /* c6 */ 0 .707106781 )); /* c6 */ 1 .328926049 )); /* c2 */ 1 .083350441 )); /* c4 */ 0 .245575608 )); /* c8 */ /* Odd part */ 1 ];3 ];5 ];7 ];1 .224744871 )); /* -c3 */ 0 .909038955 )); /* c5 */ 0 .483689525 )); /* c7 */ 1 .392728481 )); /* c1 */ 1 .224744871 )); /* c3 */ /* Final output stage */ 0 ] = range_limit[(int )RIGHT_SHIFT(tmp10 + tmp0,3 ) &8 ] = range_limit[(int )RIGHT_SHIFT(tmp10 - tmp0,3 ) &1 ] = range_limit[(int )RIGHT_SHIFT(tmp11 + tmp1,3 ) &7 ] = range_limit[(int )RIGHT_SHIFT(tmp11 - tmp1,3 ) &2 ] = range_limit[(int )RIGHT_SHIFT(tmp12 + tmp2,3 ) &6 ] = range_limit[(int )RIGHT_SHIFT(tmp12 - tmp2,3 ) &3 ] = range_limit[(int )RIGHT_SHIFT(tmp13 + tmp3,3 ) &5 ] = range_limit[(int )RIGHT_SHIFT(tmp13 - tmp3,3 ) &4 ] = range_limit[(int )RIGHT_SHIFT(tmp14,3 ) &8 ; /* advance pointer to next row */ /* * Perform dequantization and inverse DCT on one block of coefficients, * producing a 10x10 output block. * * Optimized algorithm with 12 multiplications in the 1-D kernel. * cK represents sqrt(2) * cos(K*pi/20). void )int *wsptr;int ctr;int workspace[8 * 10 ]; /* buffers data between passes */ /* Pass 1: process columns from input, store into work array. */ for (ctr = 0 ; ctr < 8 ; ctr++, inptr++, quantptr++, wsptr++) {/* Even part */ 0 ], quantptr[DCTSIZE * 0 ]);/* Add fudge factor here for final descale. */ 1 );4 ], quantptr[DCTSIZE * 4 ]);1 .144122806 )); /* c4 */ 0 .437016024 )); /* c8 */ 1 ),/* c0 = (c4-c8)*2 */ 2 ], quantptr[DCTSIZE * 2 ]);6 ], quantptr[DCTSIZE * 6 ]);0 .831253876 )); /* c6 */ 0 .513743148 )); /* c2-c6 */ 2 .176250899 )); /* c2+c6 */ /* Odd part */ 1 ], quantptr[DCTSIZE * 1 ]);3 ], quantptr[DCTSIZE * 3 ]);5 ], quantptr[DCTSIZE * 5 ]);7 ], quantptr[DCTSIZE * 7 ]);0 .309016994 )); /* (c3-c7)/2 */ 0 .951056516 )); /* (c3+c7)/2 */ 1 .396802247 )) + z2 + z4; /* c1 */ 0 .221231742 )) - z2 + z4; /* c9 */ 0 .587785252 )); /* (c1-c9)/2 */ 1 );1 .260073511 )) - z2 - z4; /* c3 */ 0 .642039522 )) - z2 + z4; /* c7 */ /* Final output stage */ 8 * 0 ] = (int )RIGHT_SHIFT(tmp20 + tmp10, CONST_BITS - PASS1_BITS);8 * 9 ] = (int )RIGHT_SHIFT(tmp20 - tmp10, CONST_BITS - PASS1_BITS);8 * 1 ] = (int )RIGHT_SHIFT(tmp21 + tmp11, CONST_BITS - PASS1_BITS);8 * 8 ] = (int )RIGHT_SHIFT(tmp21 - tmp11, CONST_BITS - PASS1_BITS);8 * 2 ] = (int )(tmp22 + tmp12);8 * 7 ] = (int )(tmp22 - tmp12);8 * 3 ] = (int )RIGHT_SHIFT(tmp23 + tmp13, CONST_BITS - PASS1_BITS);8 * 6 ] = (int )RIGHT_SHIFT(tmp23 - tmp13, CONST_BITS - PASS1_BITS);8 * 4 ] = (int )RIGHT_SHIFT(tmp24 + tmp14, CONST_BITS - PASS1_BITS);8 * 5 ] = (int )RIGHT_SHIFT(tmp24 - tmp14, CONST_BITS - PASS1_BITS);/* Pass 2: process 10 rows from work array, store into output array. */ for (ctr = 0 ; ctr < 10 ; ctr++) {/* Even part */ /* Add fudge factor here for final descale. */ 0 ] + (ONE << (PASS1_BITS + 2 ));4 ];1 .144122806 )); /* c4 */ 0 .437016024 )); /* c8 */ 1 ); /* c0 = (c4-c8)*2 */ 2 ];6 ];0 .831253876 )); /* c6 */ 0 .513743148 )); /* c2-c6 */ 2 .176250899 )); /* c2+c6 */ /* Odd part */ 1 ];3 ];5 ];7 ];0 .309016994 )); /* (c3-c7)/2 */ 0 .951056516 )); /* (c3+c7)/2 */ 1 .396802247 )) + z2 + z4; /* c1 */ 0 .221231742 )) - z2 + z4; /* c9 */ 0 .587785252 )); /* (c1-c9)/2 */ 1 );1 .260073511 )) - z2 - z4; /* c3 */ 0 .642039522 )) - z2 + z4; /* c7 */ /* Final output stage */ 0 ] = range_limit[(int )RIGHT_SHIFT(tmp20 + tmp10,3 ) &9 ] = range_limit[(int )RIGHT_SHIFT(tmp20 - tmp10,3 ) &1 ] = range_limit[(int )RIGHT_SHIFT(tmp21 + tmp11,3 ) &8 ] = range_limit[(int )RIGHT_SHIFT(tmp21 - tmp11,3 ) &2 ] = range_limit[(int )RIGHT_SHIFT(tmp22 + tmp12,3 ) &7 ] = range_limit[(int )RIGHT_SHIFT(tmp22 - tmp12,3 ) &3 ] = range_limit[(int )RIGHT_SHIFT(tmp23 + tmp13,3 ) &6 ] = range_limit[(int )RIGHT_SHIFT(tmp23 - tmp13,3 ) &4 ] = range_limit[(int )RIGHT_SHIFT(tmp24 + tmp14,3 ) &5 ] = range_limit[(int )RIGHT_SHIFT(tmp24 - tmp14,3 ) &8 ; /* advance pointer to next row */ /* * Perform dequantization and inverse DCT on one block of coefficients, * producing an 11x11 output block. * * Optimized algorithm with 24 multiplications in the 1-D kernel. * cK represents sqrt(2) * cos(K*pi/22). void )int *wsptr;int ctr;int workspace[8 * 11 ]; /* buffers data between passes */ /* Pass 1: process columns from input, store into work array. */ for (ctr = 0 ; ctr < 8 ; ctr++, inptr++, quantptr++, wsptr++) {/* Even part */ 0 ], quantptr[DCTSIZE * 0 ]);/* Add fudge factor here for final descale. */ 1 );2 ], quantptr[DCTSIZE * 2 ]);4 ], quantptr[DCTSIZE * 4 ]);6 ], quantptr[DCTSIZE * 6 ]);2 .546640132 )); /* c2+c4 */ 0 .430815045 )); /* c2-c6 */ 1 .155664402 )); /* -(c2-c10) */ 1 .356927976 )); /* c2 */ 1 .821790775 )); /* c2+c4+c10-c6 */ 2 .115825087 )); /* c4+c6 */ 1 .513598477 )); /* c6+c8 */ 0 .788749120 )); /* c8+c10 */ 1 .944413522 )) - /* c2+c8 */ 1 .390975730 )); /* c4+c10 */ 1 .414213562 )); /* c0 */ /* Odd part */ 1 ], quantptr[DCTSIZE * 1 ]);3 ], quantptr[DCTSIZE * 3 ]);5 ], quantptr[DCTSIZE * 5 ]);7 ], quantptr[DCTSIZE * 7 ]);0 .398430003 )); /* c9 */ 0 .887983902 )); /* c3-c9 */ 0 .670361295 )); /* c5-c9 */ 0 .366151574 )); /* c7-c9 */ 0 .923107866 )); /* c7+c5+c3-c1-2*c9 */ 1 .163011579 )); /* c7+c9 */ 2 .073276588 )); /* c1+c7+3*c9-c3 */ 1 .192193623 )); /* c3+c5-c7-c9 */ 1 .798248910 )); /* -(c1+c9) */ 2 .102458632 )); /* c1+c5+c9-c7 */ 1 .467221301 )) + /* -(c5+c9) */ 1 .001388905 )) - /* c1-c9 */ 1 .684843907 )); /* c3+c9 */ /* Final output stage */ 8 * 0 ] = (int )RIGHT_SHIFT(tmp20 + tmp10, CONST_BITS - PASS1_BITS);8 * 10 ] = (int )RIGHT_SHIFT(tmp20 - tmp10, CONST_BITS - PASS1_BITS);8 * 1 ] = (int )RIGHT_SHIFT(tmp21 + tmp11, CONST_BITS - PASS1_BITS);8 * 9 ] = (int )RIGHT_SHIFT(tmp21 - tmp11, CONST_BITS - PASS1_BITS);8 * 2 ] = (int )RIGHT_SHIFT(tmp22 + tmp12, CONST_BITS - PASS1_BITS);8 * 8 ] = (int )RIGHT_SHIFT(tmp22 - tmp12, CONST_BITS - PASS1_BITS);8 * 3 ] = (int )RIGHT_SHIFT(tmp23 + tmp13, CONST_BITS - PASS1_BITS);8 * 7 ] = (int )RIGHT_SHIFT(tmp23 - tmp13, CONST_BITS - PASS1_BITS);8 * 4 ] = (int )RIGHT_SHIFT(tmp24 + tmp14, CONST_BITS - PASS1_BITS);8 * 6 ] = (int )RIGHT_SHIFT(tmp24 - tmp14, CONST_BITS - PASS1_BITS);8 * 5 ] = (int )RIGHT_SHIFT(tmp25, CONST_BITS - PASS1_BITS);/* Pass 2: process 11 rows from work array, store into output array. */ for (ctr = 0 ; ctr < 11 ; ctr++) {/* Even part */ /* Add fudge factor here for final descale. */ 0 ] + (ONE << (PASS1_BITS + 2 ));2 ];4 ];6 ];2 .546640132 )); /* c2+c4 */ 0 .430815045 )); /* c2-c6 */ 1 .155664402 )); /* -(c2-c10) */ 1 .356927976 )); /* c2 */ 1 .821790775 )); /* c2+c4+c10-c6 */ 2 .115825087 )); /* c4+c6 */ 1 .513598477 )); /* c6+c8 */ 0 .788749120 )); /* c8+c10 */ 1 .944413522 )) - /* c2+c8 */ 1 .390975730 )); /* c4+c10 */ 1 .414213562 )); /* c0 */ /* Odd part */ 1 ];3 ];5 ];7 ];0 .398430003 )); /* c9 */ 0 .887983902 )); /* c3-c9 */ 0 .670361295 )); /* c5-c9 */ 0 .366151574 )); /* c7-c9 */ 0 .923107866 )); /* c7+c5+c3-c1-2*c9 */ 1 .163011579 )); /* c7+c9 */ 2 .073276588 )); /* c1+c7+3*c9-c3 */ 1 .192193623 )); /* c3+c5-c7-c9 */ 1 .798248910 )); /* -(c1+c9) */ 2 .102458632 )); /* c1+c5+c9-c7 */ 1 .467221301 )) + /* -(c5+c9) */ 1 .001388905 )) - /* c1-c9 */ 1 .684843907 )); /* c3+c9 */ /* Final output stage */ 0 ] = range_limit[(int )RIGHT_SHIFT(tmp20 + tmp10,3 ) &10 ] = range_limit[(int )RIGHT_SHIFT(tmp20 - tmp10,3 ) &1 ] = range_limit[(int )RIGHT_SHIFT(tmp21 + tmp11,3 ) &9 ] = range_limit[(int )RIGHT_SHIFT(tmp21 - tmp11,3 ) &2 ] = range_limit[(int )RIGHT_SHIFT(tmp22 + tmp12,3 ) &8 ] = range_limit[(int )RIGHT_SHIFT(tmp22 - tmp12,3 ) &3 ] = range_limit[(int )RIGHT_SHIFT(tmp23 + tmp13,3 ) &7 ] = range_limit[(int )RIGHT_SHIFT(tmp23 - tmp13,3 ) &4 ] = range_limit[(int )RIGHT_SHIFT(tmp24 + tmp14,3 ) &6 ] = range_limit[(int )RIGHT_SHIFT(tmp24 - tmp14,3 ) &5 ] = range_limit[(int )RIGHT_SHIFT(tmp25,3 ) &8 ; /* advance pointer to next row */ /* * Perform dequantization and inverse DCT on one block of coefficients, * producing a 12x12 output block. * * Optimized algorithm with 15 multiplications in the 1-D kernel. * cK represents sqrt(2) * cos(K*pi/24). void )int *wsptr;int ctr;int workspace[8 * 12 ]; /* buffers data between passes */ /* Pass 1: process columns from input, store into work array. */ for (ctr = 0 ; ctr < 8 ; ctr++, inptr++, quantptr++, wsptr++) {/* Even part */ 0 ], quantptr[DCTSIZE * 0 ]);/* Add fudge factor here for final descale. */ 1 );4 ], quantptr[DCTSIZE * 4 ]);1 .224744871 )); /* c4 */ 2 ], quantptr[DCTSIZE * 2 ]);1 .366025404 )); /* c2 */ 6 ], quantptr[DCTSIZE * 6 ]);/* Odd part */ 1 ], quantptr[DCTSIZE * 1 ]);3 ], quantptr[DCTSIZE * 3 ]);5 ], quantptr[DCTSIZE * 5 ]);7 ], quantptr[DCTSIZE * 7 ]);1 .306562965 )); /* c3 */ /* -c9 */ 0 .860918669 )); /* c7 */ 0 .261052384 )); /* c5-c7 */ 0 .280143716 )); /* c1-c5 */ 1 .045510580 )); /* -(c7+c11) */ 1 .478575242 )); /* c1+c5-c7-c11 */ 1 .586706681 )); /* c1+c11 */ 0 .676326758 )) - /* c7-c11 */ 1 .982889723 )); /* c5+c7 */ /* c9 */ /* c3-c9 */ /* c3+c9 */ /* Final output stage */ 8 * 0 ] = (int )RIGHT_SHIFT(tmp20 + tmp10, CONST_BITS - PASS1_BITS);8 * 11 ] = (int )RIGHT_SHIFT(tmp20 - tmp10, CONST_BITS - PASS1_BITS);8 * 1 ] = (int )RIGHT_SHIFT(tmp21 + tmp11, CONST_BITS - PASS1_BITS);8 * 10 ] = (int )RIGHT_SHIFT(tmp21 - tmp11, CONST_BITS - PASS1_BITS);8 * 2 ] = (int )RIGHT_SHIFT(tmp22 + tmp12, CONST_BITS - PASS1_BITS);8 * 9 ] = (int )RIGHT_SHIFT(tmp22 - tmp12, CONST_BITS - PASS1_BITS);8 * 3 ] = (int )RIGHT_SHIFT(tmp23 + tmp13, CONST_BITS - PASS1_BITS);8 * 8 ] = (int )RIGHT_SHIFT(tmp23 - tmp13, CONST_BITS - PASS1_BITS);8 * 4 ] = (int )RIGHT_SHIFT(tmp24 + tmp14, CONST_BITS - PASS1_BITS);8 * 7 ] = (int )RIGHT_SHIFT(tmp24 - tmp14, CONST_BITS - PASS1_BITS);8 * 5 ] = (int )RIGHT_SHIFT(tmp25 + tmp15, CONST_BITS - PASS1_BITS);8 * 6 ] = (int )RIGHT_SHIFT(tmp25 - tmp15, CONST_BITS - PASS1_BITS);/* Pass 2: process 12 rows from work array, store into output array. */ for (ctr = 0 ; ctr < 12 ; ctr++) {/* Even part */ /* Add fudge factor here for final descale. */ 0 ] + (ONE << (PASS1_BITS + 2 ));4 ];1 .224744871 )); /* c4 */ 2 ];1 .366025404 )); /* c2 */ 6 ];/* Odd part */ 1 ];3 ];5 ];7 ];1 .306562965 )); /* c3 */ /* -c9 */ 0 .860918669 )); /* c7 */ 0 .261052384 )); /* c5-c7 */ 0 .280143716 )); /* c1-c5 */ 1 .045510580 )); /* -(c7+c11) */ 1 .478575242 )); /* c1+c5-c7-c11 */ 1 .586706681 )); /* c1+c11 */ 0 .676326758 )) - /* c7-c11 */ 1 .982889723 )); /* c5+c7 */ /* c9 */ /* c3-c9 */ /* c3+c9 */ /* Final output stage */ 0 ] = range_limit[(int )RIGHT_SHIFT(tmp20 + tmp10,3 ) &11 ] = range_limit[(int )RIGHT_SHIFT(tmp20 - tmp10,3 ) &1 ] = range_limit[(int )RIGHT_SHIFT(tmp21 + tmp11,3 ) &10 ] = range_limit[(int )RIGHT_SHIFT(tmp21 - tmp11,3 ) &2 ] = range_limit[(int )RIGHT_SHIFT(tmp22 + tmp12,3 ) &9 ] = range_limit[(int )RIGHT_SHIFT(tmp22 - tmp12,3 ) &3 ] = range_limit[(int )RIGHT_SHIFT(tmp23 + tmp13,3 ) &8 ] = range_limit[(int )RIGHT_SHIFT(tmp23 - tmp13,3 ) &4 ] = range_limit[(int )RIGHT_SHIFT(tmp24 + tmp14,3 ) &7 ] = range_limit[(int )RIGHT_SHIFT(tmp24 - tmp14,3 ) &5 ] = range_limit[(int )RIGHT_SHIFT(tmp25 + tmp15,3 ) &6 ] = range_limit[(int )RIGHT_SHIFT(tmp25 - tmp15,3 ) &8 ; /* advance pointer to next row */ /* * Perform dequantization and inverse DCT on one block of coefficients, * producing a 13x13 output block. * * Optimized algorithm with 29 multiplications in the 1-D kernel. * cK represents sqrt(2) * cos(K*pi/26). void )int *wsptr;int ctr;int workspace[8 * 13 ]; /* buffers data between passes */ /* Pass 1: process columns from input, store into work array. */ for (ctr = 0 ; ctr < 8 ; ctr++, inptr++, quantptr++, wsptr++) {/* Even part */ 0 ], quantptr[DCTSIZE * 0 ]);/* Add fudge factor here for final descale. */ 1 );2 ], quantptr[DCTSIZE * 2 ]);4 ], quantptr[DCTSIZE * 4 ]);6 ], quantptr[DCTSIZE * 6 ]);1 .155388986 )); /* (c4+c6)/2 */ 0 .096834934 )) + z1; /* (c4-c6)/2 */ 1 .373119086 )) + tmp12 + tmp13; /* c2 */ 0 .501487041 )) - tmp12 + tmp13; /* c10 */ 0 .316450131 )); /* (c8-c12)/2 */ 0 .486914739 )) + z1; /* (c8+c12)/2 */ 1 .058554052 )) - tmp12 + tmp13; /* c6 */ 1 .252223920 )) + tmp12 + tmp13; /* c4 */ 0 .435816023 )); /* (c2-c10)/2 */ 0 .937303064 )) - z1; /* (c2+c10)/2 */ 0 .170464608 )) - tmp12 - tmp13; /* c12 */ 0 .803364869 )) + tmp12 - tmp13; /* c8 */ 1 .414213562 )) + z1; /* c0 */ /* Odd part */ 1 ], quantptr[DCTSIZE * 1 ]);3 ], quantptr[DCTSIZE * 3 ]);5 ], quantptr[DCTSIZE * 5 ]);7 ], quantptr[DCTSIZE * 7 ]);1 .322312651 )); /* c3 */ 1 .163874945 )); /* c5 */ 0 .937797057 )); /* c7 */ 2 .020082300 )); /* c7+c5+c3-c1 */ 0 .338443458 )); /* -c11 */ 0 .837223564 )); /* c5+c9+c11-c3 */ 1 .572116027 )); /* c1+c5-c9-c11 */ 1 .163874945 )); /* -c5 */ 2 .205608352 )); /* c3+c5+c9-c7 */ 0 .657217813 )); /* -c9 */ 0 .338443458 )); /* c11 */ 0 .318774355 )) - /* c9-c11 */ 0 .466105296 )); /* c1-c7 */ 0 .937797057 )); /* c7 */ 0 .384515595 )) - /* c3-c7 */ 1 .742345811 )); /* c1+c11 */ /* Final output stage */ 8 * 0 ] = (int )RIGHT_SHIFT(tmp20 + tmp10, CONST_BITS - PASS1_BITS);8 * 12 ] = (int )RIGHT_SHIFT(tmp20 - tmp10, CONST_BITS - PASS1_BITS);8 * 1 ] = (int )RIGHT_SHIFT(tmp21 + tmp11, CONST_BITS - PASS1_BITS);8 * 11 ] = (int )RIGHT_SHIFT(tmp21 - tmp11, CONST_BITS - PASS1_BITS);8 * 2 ] = (int )RIGHT_SHIFT(tmp22 + tmp12, CONST_BITS - PASS1_BITS);8 * 10 ] = (int )RIGHT_SHIFT(tmp22 - tmp12, CONST_BITS - PASS1_BITS);8 * 3 ] = (int )RIGHT_SHIFT(tmp23 + tmp13, CONST_BITS - PASS1_BITS);8 * 9 ] = (int )RIGHT_SHIFT(tmp23 - tmp13, CONST_BITS - PASS1_BITS);8 * 4 ] = (int )RIGHT_SHIFT(tmp24 + tmp14, CONST_BITS - PASS1_BITS);8 * 8 ] = (int )RIGHT_SHIFT(tmp24 - tmp14, CONST_BITS - PASS1_BITS);8 * 5 ] = (int )RIGHT_SHIFT(tmp25 + tmp15, CONST_BITS - PASS1_BITS);8 * 7 ] = (int )RIGHT_SHIFT(tmp25 - tmp15, CONST_BITS - PASS1_BITS);8 * 6 ] = (int )RIGHT_SHIFT(tmp26, CONST_BITS - PASS1_BITS);/* Pass 2: process 13 rows from work array, store into output array. */ for (ctr = 0 ; ctr < 13 ; ctr++) {/* Even part */ /* Add fudge factor here for final descale. */ 0 ] + (ONE << (PASS1_BITS + 2 ));2 ];4 ];6 ];1 .155388986 )); /* (c4+c6)/2 */ 0 .096834934 )) + z1; /* (c4-c6)/2 */ 1 .373119086 )) + tmp12 + tmp13; /* c2 */ 0 .501487041 )) - tmp12 + tmp13; /* c10 */ 0 .316450131 )); /* (c8-c12)/2 */ 0 .486914739 )) + z1; /* (c8+c12)/2 */ 1 .058554052 )) - tmp12 + tmp13; /* c6 */ 1 .252223920 )) + tmp12 + tmp13; /* c4 */ 0 .435816023 )); /* (c2-c10)/2 */ 0 .937303064 )) - z1; /* (c2+c10)/2 */ 0 .170464608 )) - tmp12 - tmp13; /* c12 */ 0 .803364869 )) + tmp12 - tmp13; /* c8 */ 1 .414213562 )) + z1; /* c0 */ /* Odd part */ 1 ];3 ];5 ];7 ];1 .322312651 )); /* c3 */ 1 .163874945 )); /* c5 */ 0 .937797057 )); /* c7 */ 2 .020082300 )); /* c7+c5+c3-c1 */ 0 .338443458 )); /* -c11 */ 0 .837223564 )); /* c5+c9+c11-c3 */ 1 .572116027 )); /* c1+c5-c9-c11 */ 1 .163874945 )); /* -c5 */ 2 .205608352 )); /* c3+c5+c9-c7 */ 0 .657217813 )); /* -c9 */ 0 .338443458 )); /* c11 */ 0 .318774355 )) - /* c9-c11 */ 0 .466105296 )); /* c1-c7 */ 0 .937797057 )); /* c7 */ 0 .384515595 )) - /* c3-c7 */ 1 .742345811 )); /* c1+c11 */ /* Final output stage */ 0 ] = range_limit[(int )RIGHT_SHIFT(tmp20 + tmp10,3 ) &12 ] = range_limit[(int )RIGHT_SHIFT(tmp20 - tmp10,3 ) &1 ] = range_limit[(int )RIGHT_SHIFT(tmp21 + tmp11,3 ) &11 ] = range_limit[(int )RIGHT_SHIFT(tmp21 - tmp11,3 ) &2 ] = range_limit[(int )RIGHT_SHIFT(tmp22 + tmp12,3 ) &10 ] = range_limit[(int )RIGHT_SHIFT(tmp22 - tmp12,3 ) &3 ] = range_limit[(int )RIGHT_SHIFT(tmp23 + tmp13,3 ) &9 ] = range_limit[(int )RIGHT_SHIFT(tmp23 - tmp13,3 ) &4 ] = range_limit[(int )RIGHT_SHIFT(tmp24 + tmp14,3 ) &8 ] = range_limit[(int )RIGHT_SHIFT(tmp24 - tmp14,3 ) &5 ] = range_limit[(int )RIGHT_SHIFT(tmp25 + tmp15,3 ) &7 ] = range_limit[(int )RIGHT_SHIFT(tmp25 - tmp15,3 ) &6 ] = range_limit[(int )RIGHT_SHIFT(tmp26,3 ) &8 ; /* advance pointer to next row */ /* * Perform dequantization and inverse DCT on one block of coefficients, * producing a 14x14 output block. * * Optimized algorithm with 20 multiplications in the 1-D kernel. * cK represents sqrt(2) * cos(K*pi/28). void )int *wsptr;int ctr;int workspace[8 * 14 ]; /* buffers data between passes */ /* Pass 1: process columns from input, store into work array. */ for (ctr = 0 ; ctr < 8 ; ctr++, inptr++, quantptr++, wsptr++) {/* Even part */ 0 ], quantptr[DCTSIZE * 0 ]);/* Add fudge factor here for final descale. */ 1 );4 ], quantptr[DCTSIZE * 4 ]);1 .274162392 )); /* c4 */ 0 .314692123 )); /* c12 */ 0 .881747734 )); /* c8 */ 1 ),/* c0 = (c4+c12-c8)*2 */ 2 ], quantptr[DCTSIZE * 2 ]);6 ], quantptr[DCTSIZE * 6 ]);1 .105676686 )); /* c6 */ 0 .273079590 )); /* c2-c6 */ 1 .719280954 )); /* c6+c10 */ 0 .613604268 )) - /* c10 */ 1 .378756276 )); /* c2 */ /* Odd part */ 1 ], quantptr[DCTSIZE * 1 ]);3 ], quantptr[DCTSIZE * 3 ]);5 ], quantptr[DCTSIZE * 5 ]);7 ], quantptr[DCTSIZE * 7 ]);1 .334852607 )); /* c3 */ 1 .197448846 )); /* c5 */ 1 .126980169 )); /* c3+c5-c1 */ 0 .752406978 )); /* c9 */ 1 .061150426 )); /* c9+c11-c13 */ 0 .467085129 )) - tmp13; /* c11 */ 0 .158341681 )) - tmp13; /* -c13 */ 0 .424103948 )); /* c3-c9-c13 */ 2 .373959773 )); /* c3+c5-c13 */ 1 .405321284 )); /* c1 */ 1 .6906431334 )); /* c1+c9-c11 */ 0 .674957567 )); /* c1+c11-c5 */ /* Final output stage */ 8 * 0 ] = (int )RIGHT_SHIFT(tmp20 + tmp10, CONST_BITS - PASS1_BITS);8 * 13 ] = (int )RIGHT_SHIFT(tmp20 - tmp10, CONST_BITS - PASS1_BITS);8 * 1 ] = (int )RIGHT_SHIFT(tmp21 + tmp11, CONST_BITS - PASS1_BITS);8 * 12 ] = (int )RIGHT_SHIFT(tmp21 - tmp11, CONST_BITS - PASS1_BITS);8 * 2 ] = (int )RIGHT_SHIFT(tmp22 + tmp12, CONST_BITS - PASS1_BITS);8 * 11 ] = (int )RIGHT_SHIFT(tmp22 - tmp12, CONST_BITS - PASS1_BITS);8 * 3 ] = (int )(tmp23 + tmp13);8 * 10 ] = (int )(tmp23 - tmp13);8 * 4 ] = (int )RIGHT_SHIFT(tmp24 + tmp14, CONST_BITS - PASS1_BITS);8 * 9 ] = (int )RIGHT_SHIFT(tmp24 - tmp14, CONST_BITS - PASS1_BITS);8 * 5 ] = (int )RIGHT_SHIFT(tmp25 + tmp15, CONST_BITS - PASS1_BITS);8 * 8 ] = (int )RIGHT_SHIFT(tmp25 - tmp15, CONST_BITS - PASS1_BITS);8 * 6 ] = (int )RIGHT_SHIFT(tmp26 + tmp16, CONST_BITS - PASS1_BITS);8 * 7 ] = (int )RIGHT_SHIFT(tmp26 - tmp16, CONST_BITS - PASS1_BITS);/* Pass 2: process 14 rows from work array, store into output array. */ for (ctr = 0 ; ctr < 14 ; ctr++) {/* Even part */ /* Add fudge factor here for final descale. */ 0 ] + (ONE << (PASS1_BITS + 2 ));4 ];1 .274162392 )); /* c4 */ 0 .314692123 )); /* c12 */ 0 .881747734 )); /* c8 */ 1 ); /* c0 = (c4+c12-c8)*2 */ 2 ];6 ];1 .105676686 )); /* c6 */ 0 .273079590 )); /* c2-c6 */ 1 .719280954 )); /* c6+c10 */ 0 .613604268 )) - /* c10 */ 1 .378756276 )); /* c2 */ /* Odd part */ 1 ];3 ];5 ];7 ];1 .334852607 )); /* c3 */ 1 .197448846 )); /* c5 */ 1 .126980169 )); /* c3+c5-c1 */ 0 .752406978 )); /* c9 */ 1 .061150426 )); /* c9+c11-c13 */ 0 .467085129 )) - z4; /* c11 */ 0 .158341681 )) - z4; /* -c13 */ 0 .424103948 )); /* c3-c9-c13 */ 2 .373959773 )); /* c3+c5-c13 */ 1 .405321284 )); /* c1 */ 1 .6906431334 )); /* c1+c9-c11 */ 0 .674957567 )); /* c1+c11-c5 */ /* Final output stage */ 0 ] = range_limit[(int )RIGHT_SHIFT(tmp20 + tmp10,3 ) &13 ] = range_limit[(int )RIGHT_SHIFT(tmp20 - tmp10,3 ) &1 ] = range_limit[(int )RIGHT_SHIFT(tmp21 + tmp11,3 ) &12 ] = range_limit[(int )RIGHT_SHIFT(tmp21 - tmp11,3 ) &2 ] = range_limit[(int )RIGHT_SHIFT(tmp22 + tmp12,3 ) &11 ] = range_limit[(int )RIGHT_SHIFT(tmp22 - tmp12,3 ) &3 ] = range_limit[(int )RIGHT_SHIFT(tmp23 + tmp13,3 ) &10 ] = range_limit[(int )RIGHT_SHIFT(tmp23 - tmp13,3 ) &4 ] = range_limit[(int )RIGHT_SHIFT(tmp24 + tmp14,3 ) &9 ] = range_limit[(int )RIGHT_SHIFT(tmp24 - tmp14,3 ) &5 ] = range_limit[(int )RIGHT_SHIFT(tmp25 + tmp15,3 ) &8 ] = range_limit[(int )RIGHT_SHIFT(tmp25 - tmp15,3 ) &6 ] = range_limit[(int )RIGHT_SHIFT(tmp26 + tmp16,3 ) &7 ] = range_limit[(int )RIGHT_SHIFT(tmp26 - tmp16,3 ) &8 ; /* advance pointer to next row */ /* * Perform dequantization and inverse DCT on one block of coefficients, * producing a 15x15 output block. * * Optimized algorithm with 22 multiplications in the 1-D kernel. * cK represents sqrt(2) * cos(K*pi/30). void )int *wsptr;int ctr;int workspace[8 * 15 ]; /* buffers data between passes */ /* Pass 1: process columns from input, store into work array. */ for (ctr = 0 ; ctr < 8 ; ctr++, inptr++, quantptr++, wsptr++) {/* Even part */ 0 ], quantptr[DCTSIZE * 0 ]);/* Add fudge factor here for final descale. */ 1 );2 ], quantptr[DCTSIZE * 2 ]);4 ], quantptr[DCTSIZE * 4 ]);6 ], quantptr[DCTSIZE * 6 ]);0 .437016024 )); /* c12 */ 1 .144122806 )); /* c6 */ 1 ); /* c0 = (c6-c12)*2 */ 1 .337628990 )); /* (c2+c4)/2 */ 0 .045680613 )); /* (c2-c4)/2 */ 1 .439773946 )); /* c4+c14 */ 0 .547059574 )); /* (c8+c14)/2 */ 0 .399234004 )); /* (c8-c14)/2 */ 0 .790569415 )); /* (c6+c12)/2 */ 0 .353553391 )); /* (c6-c12)/2 */ /* c10 = c6-c12 */ /* c0 = (c6-c12)*2 */ /* Odd part */ 1 ], quantptr[DCTSIZE * 1 ]);3 ], quantptr[DCTSIZE * 3 ]);5 ], quantptr[DCTSIZE * 5 ]);1 .224744871 )); /* c5 */ 7 ], quantptr[DCTSIZE * 7 ]);0 .831253876 )); /* c9 */ 0 .513743148 )); /* c3-c9 */ 2 .176250899 )); /* c3+c9 */ 0 .831253876 )); /* -c9 */ 1 .344997024 )); /* -c3 */ 1 .406466353 )); /* c1 */ 2 .457431844 )) - tmp15; /* c1+c7 */ 1 .112434820 )) + tmp13; /* c1-c13 */ 1 .224744871 )) - z3; /* c5 */ 0 .575212477 )); /* c11 */ 0 .475753014 )) - z3; /* c7-c11 */ 0 .869244010 )) + z3; /* c11+c13 */ /* Final output stage */ 8 * 0 ] = (int )RIGHT_SHIFT(tmp20 + tmp10, CONST_BITS - PASS1_BITS);8 * 14 ] = (int )RIGHT_SHIFT(tmp20 - tmp10, CONST_BITS - PASS1_BITS);8 * 1 ] = (int )RIGHT_SHIFT(tmp21 + tmp11, CONST_BITS - PASS1_BITS);8 * 13 ] = (int )RIGHT_SHIFT(tmp21 - tmp11, CONST_BITS - PASS1_BITS);8 * 2 ] = (int )RIGHT_SHIFT(tmp22 + tmp12, CONST_BITS - PASS1_BITS);8 * 12 ] = (int )RIGHT_SHIFT(tmp22 - tmp12, CONST_BITS - PASS1_BITS);8 * 3 ] = (int )RIGHT_SHIFT(tmp23 + tmp13, CONST_BITS - PASS1_BITS);8 * 11 ] = (int )RIGHT_SHIFT(tmp23 - tmp13, CONST_BITS - PASS1_BITS);8 * 4 ] = (int )RIGHT_SHIFT(tmp24 + tmp14, CONST_BITS - PASS1_BITS);8 * 10 ] = (int )RIGHT_SHIFT(tmp24 - tmp14, CONST_BITS - PASS1_BITS);8 * 5 ] = (int )RIGHT_SHIFT(tmp25 + tmp15, CONST_BITS - PASS1_BITS);8 * 9 ] = (int )RIGHT_SHIFT(tmp25 - tmp15, CONST_BITS - PASS1_BITS);8 * 6 ] = (int )RIGHT_SHIFT(tmp26 + tmp16, CONST_BITS - PASS1_BITS);8 * 8 ] = (int )RIGHT_SHIFT(tmp26 - tmp16, CONST_BITS - PASS1_BITS);8 * 7 ] = (int )RIGHT_SHIFT(tmp27, CONST_BITS - PASS1_BITS);/* Pass 2: process 15 rows from work array, store into output array. */ for (ctr = 0 ; ctr < 15 ; ctr++) {/* Even part */ /* Add fudge factor here for final descale. */ 0 ] + (ONE << (PASS1_BITS + 2 ));2 ];4 ];6 ];0 .437016024 )); /* c12 */ 1 .144122806 )); /* c6 */ 1 ); /* c0 = (c6-c12)*2 */ 1 .337628990 )); /* (c2+c4)/2 */ 0 .045680613 )); /* (c2-c4)/2 */ 1 .439773946 )); /* c4+c14 */ 0 .547059574 )); /* (c8+c14)/2 */ 0 .399234004 )); /* (c8-c14)/2 */ 0 .790569415 )); /* (c6+c12)/2 */ 0 .353553391 )); /* (c6-c12)/2 */ /* c10 = c6-c12 */ /* c0 = (c6-c12)*2 */ /* Odd part */ 1 ];3 ];5 ];1 .224744871 )); /* c5 */ 7 ];0 .831253876 )); /* c9 */ 0 .513743148 )); /* c3-c9 */ 2 .176250899 )); /* c3+c9 */ 0 .831253876 )); /* -c9 */ 1 .344997024 )); /* -c3 */ 1 .406466353 )); /* c1 */ 2 .457431844 )) - tmp15; /* c1+c7 */ 1 .112434820 )) + tmp13; /* c1-c13 */ 1 .224744871 )) - z3; /* c5 */ 0 .575212477 )); /* c11 */ 0 .475753014 )) - z3; /* c7-c11 */ 0 .869244010 )) + z3; /* c11+c13 */ /* Final output stage */ 0 ] = range_limit[(int )RIGHT_SHIFT(tmp20 + tmp10,3 ) &14 ] = range_limit[(int )RIGHT_SHIFT(tmp20 - tmp10,3 ) &1 ] = range_limit[(int )RIGHT_SHIFT(tmp21 + tmp11,3 ) &13 ] = range_limit[(int )RIGHT_SHIFT(tmp21 - tmp11,3 ) &2 ] = range_limit[(int )RIGHT_SHIFT(tmp22 + tmp12,3 ) &12 ] = range_limit[(int )RIGHT_SHIFT(tmp22 - tmp12,3 ) &3 ] = range_limit[(int )RIGHT_SHIFT(tmp23 + tmp13,3 ) &11 ] = range_limit[(int )RIGHT_SHIFT(tmp23 - tmp13,3 ) &4 ] = range_limit[(int )RIGHT_SHIFT(tmp24 + tmp14,3 ) &10 ] = range_limit[(int )RIGHT_SHIFT(tmp24 - tmp14,3 ) &5 ] = range_limit[(int )RIGHT_SHIFT(tmp25 + tmp15,3 ) &9 ] = range_limit[(int )RIGHT_SHIFT(tmp25 - tmp15,3 ) &6 ] = range_limit[(int )RIGHT_SHIFT(tmp26 + tmp16,3 ) &8 ] = range_limit[(int )RIGHT_SHIFT(tmp26 - tmp16,3 ) &7 ] = range_limit[(int )RIGHT_SHIFT(tmp27,3 ) &8 ; /* advance pointer to next row */ /* * Perform dequantization and inverse DCT on one block of coefficients, * producing a 16x16 output block. * * Optimized algorithm with 28 multiplications in the 1-D kernel. * cK represents sqrt(2) * cos(K*pi/32). void )int *wsptr;int ctr;int workspace[8 * 16 ]; /* buffers data between passes */ /* Pass 1: process columns from input, store into work array. */ for (ctr = 0 ; ctr < 8 ; ctr++, inptr++, quantptr++, wsptr++) {/* Even part */ 0 ], quantptr[DCTSIZE * 0 ]);/* Add fudge factor here for final descale. */ 1 );4 ], quantptr[DCTSIZE * 4 ]);1 .306562965 )); /* c4[16] = c2[8] */ /* c12[16] = c6[8] */ 2 ], quantptr[DCTSIZE * 2 ]);6 ], quantptr[DCTSIZE * 6 ]);0 .275899379 )); /* c14[16] = c7[8] */ 1 .387039845 )); /* c2[16] = c1[8] */ /* (c6+c2)[16] = (c3+c1)[8] */ /* (c6-c14)[16] = (c3-c7)[8] */ 0 .601344887 )); /* (c2-c10)[16] = (c1-c5)[8] */ 0 .509795579 )); /* (c10-c14)[16] = (c5-c7)[8] */ /* Odd part */ 1 ], quantptr[DCTSIZE * 1 ]);3 ], quantptr[DCTSIZE * 3 ]);5 ], quantptr[DCTSIZE * 5 ]);7 ], quantptr[DCTSIZE * 7 ]);1 .353318001 )); /* c3 */ 1 .247225013 )); /* c5 */ 1 .093201867 )); /* c7 */ 0 .897167586 )); /* c9 */ 0 .666655658 )); /* c11 */ 0 .410524528 )); /* c13 */ 2 .286341144 )); /* c7+c5+c3-c1 */ 1 .835730603 )); /* c9+c11+c13-c15 */ 0 .138617169 )); /* c15 */ 0 .071888074 )); /* c9+c11-c3-c15 */ 1 .125726048 )); /* c5+c7+c15-c3 */ 1 .407403738 )); /* c1 */ 0 .766367282 )); /* c1+c11-c9-c13 */ 1 .971951411 )); /* c1+c5+c13-c7 */ 0 .666655658 )); /* -c11 */ 1 .065388962 )); /* c3+c11+c15-c7 */ 1 .247225013 )); /* -c5 */ 3 .141271809 )); /* c1+c5+c9-c13 */ 1 .353318001 )); /* -c3 */ 0 .410524528 )); /* c13 */ /* Final output stage */ 8 * 0 ] = (int )RIGHT_SHIFT(tmp20 + tmp0, CONST_BITS - PASS1_BITS);8 * 15 ] = (int )RIGHT_SHIFT(tmp20 - tmp0, CONST_BITS - PASS1_BITS);8 * 1 ] = (int )RIGHT_SHIFT(tmp21 + tmp1, CONST_BITS - PASS1_BITS);8 * 14 ] = (int )RIGHT_SHIFT(tmp21 - tmp1, CONST_BITS - PASS1_BITS);8 * 2 ] = (int )RIGHT_SHIFT(tmp22 + tmp2, CONST_BITS - PASS1_BITS);8 * 13 ] = (int )RIGHT_SHIFT(tmp22 - tmp2, CONST_BITS - PASS1_BITS);8 * 3 ] = (int )RIGHT_SHIFT(tmp23 + tmp3, CONST_BITS - PASS1_BITS);8 * 12 ] = (int )RIGHT_SHIFT(tmp23 - tmp3, CONST_BITS - PASS1_BITS);8 * 4 ] = (int )RIGHT_SHIFT(tmp24 + tmp10, CONST_BITS - PASS1_BITS);8 * 11 ] = (int )RIGHT_SHIFT(tmp24 - tmp10, CONST_BITS - PASS1_BITS);8 * 5 ] = (int )RIGHT_SHIFT(tmp25 + tmp11, CONST_BITS - PASS1_BITS);8 * 10 ] = (int )RIGHT_SHIFT(tmp25 - tmp11, CONST_BITS - PASS1_BITS);8 * 6 ] = (int )RIGHT_SHIFT(tmp26 + tmp12, CONST_BITS - PASS1_BITS);8 * 9 ] = (int )RIGHT_SHIFT(tmp26 - tmp12, CONST_BITS - PASS1_BITS);8 * 7 ] = (int )RIGHT_SHIFT(tmp27 + tmp13, CONST_BITS - PASS1_BITS);8 * 8 ] = (int )RIGHT_SHIFT(tmp27 - tmp13, CONST_BITS - PASS1_BITS);/* Pass 2: process 16 rows from work array, store into output array. */ for (ctr = 0 ; ctr < 16 ; ctr++) {/* Even part */ /* Add fudge factor here for final descale. */ 0 ] + (ONE << (PASS1_BITS + 2 ));4 ];1 .306562965 )); /* c4[16] = c2[8] */ /* c12[16] = c6[8] */ 2 ];6 ];0 .275899379 )); /* c14[16] = c7[8] */ 1 .387039845 )); /* c2[16] = c1[8] */ /* (c6+c2)[16] = (c3+c1)[8] */ /* (c6-c14)[16] = (c3-c7)[8] */ 0 .601344887 )); /* (c2-c10)[16] = (c1-c5)[8] */ 0 .509795579 )); /* (c10-c14)[16] = (c5-c7)[8] */ /* Odd part */ 1 ];3 ];5 ];7 ];1 .353318001 )); /* c3 */ 1 .247225013 )); /* c5 */ 1 .093201867 )); /* c7 */ 0 .897167586 )); /* c9 */ 0 .666655658 )); /* c11 */ 0 .410524528 )); /* c13 */ 2 .286341144 )); /* c7+c5+c3-c1 */ 1 .835730603 )); /* c9+c11+c13-c15 */ 0 .138617169 )); /* c15 */ 0 .071888074 )); /* c9+c11-c3-c15 */ 1 .125726048 )); /* c5+c7+c15-c3 */ 1 .407403738 )); /* c1 */ 0 .766367282 )); /* c1+c11-c9-c13 */ 1 .971951411 )); /* c1+c5+c13-c7 */ 0 .666655658 )); /* -c11 */ 1 .065388962 )); /* c3+c11+c15-c7 */ 1 .247225013 )); /* -c5 */ 3 .141271809 )); /* c1+c5+c9-c13 */ 1 .353318001 )); /* -c3 */ 0 .410524528 )); /* c13 */ /* Final output stage */ 0 ] = range_limit[(int )RIGHT_SHIFT(tmp20 + tmp0,3 ) &15 ] = range_limit[(int )RIGHT_SHIFT(tmp20 - tmp0,3 ) &1 ] = range_limit[(int )RIGHT_SHIFT(tmp21 + tmp1,3 ) &14 ] = range_limit[(int )RIGHT_SHIFT(tmp21 - tmp1,3 ) &2 ] = range_limit[(int )RIGHT_SHIFT(tmp22 + tmp2,3 ) &13 ] = range_limit[(int )RIGHT_SHIFT(tmp22 - tmp2,3 ) &3 ] = range_limit[(int )RIGHT_SHIFT(tmp23 + tmp3,3 ) &12 ] = range_limit[(int )RIGHT_SHIFT(tmp23 - tmp3,3 ) &4 ] = range_limit[(int )RIGHT_SHIFT(tmp24 + tmp10,3 ) &11 ] = range_limit[(int )RIGHT_SHIFT(tmp24 - tmp10,3 ) &5 ] = range_limit[(int )RIGHT_SHIFT(tmp25 + tmp11,3 ) &10 ] = range_limit[(int )RIGHT_SHIFT(tmp25 - tmp11,3 ) &6 ] = range_limit[(int )RIGHT_SHIFT(tmp26 + tmp12,3 ) &9 ] = range_limit[(int )RIGHT_SHIFT(tmp26 - tmp12,3 ) &7 ] = range_limit[(int )RIGHT_SHIFT(tmp27 + tmp13,3 ) &8 ] = range_limit[(int )RIGHT_SHIFT(tmp27 - tmp13,3 ) &8 ; /* advance pointer to next row */ #endif /* IDCT_SCALING_SUPPORTED */ #endif /* DCT_ISLOW_SUPPORTED */
Messung V0.5 in Prozent C=80 H=87 G=83
¤ Dauer der Verarbeitung: 0.39 Sekunden
(vorverarbeitet am 2026-06-05)
¤ *© Formatika GbR, Deutschland
