dbf-halloween2015

annotate libs/libjpeg/jidctint.c @ 3:c37fe5d8a4ed

find changesets by author, revision, files, or words in the commit message
windows port
author John Tsiombikas <nuclear@member.fsf.org>
date Sun, 01 Nov 2015 06:04:28 +0200
parents
children
rev   line source
nuclear@1 1 /*
nuclear@1 2 * jidctint.c
nuclear@1 3 *
nuclear@1 4 * Copyright (C) 1991-1998, Thomas G. Lane.
nuclear@1 5 * This file is part of the Independent JPEG Group's software.
nuclear@1 6 * For conditions of distribution and use, see the accompanying README file.
nuclear@1 7 *
nuclear@1 8 * This file contains a slow-but-accurate integer implementation of the
nuclear@1 9 * inverse DCT (Discrete Cosine Transform). In the IJG code, this routine
nuclear@1 10 * must also perform dequantization of the input coefficients.
nuclear@1 11 *
nuclear@1 12 * A 2-D IDCT can be done by 1-D IDCT on each column followed by 1-D IDCT
nuclear@1 13 * on each row (or vice versa, but it's more convenient to emit a row at
nuclear@1 14 * a time). Direct algorithms are also available, but they are much more
nuclear@1 15 * complex and seem not to be any faster when reduced to code.
nuclear@1 16 *
nuclear@1 17 * This implementation is based on an algorithm described in
nuclear@1 18 * C. Loeffler, A. Ligtenberg and G. Moschytz, "Practical Fast 1-D DCT
nuclear@1 19 * Algorithms with 11 Multiplications", Proc. Int'l. Conf. on Acoustics,
nuclear@1 20 * Speech, and Signal Processing 1989 (ICASSP '89), pp. 988-991.
nuclear@1 21 * The primary algorithm described there uses 11 multiplies and 29 adds.
nuclear@1 22 * We use their alternate method with 12 multiplies and 32 adds.
nuclear@1 23 * The advantage of this method is that no data path contains more than one
nuclear@1 24 * multiplication; this allows a very simple and accurate implementation in
nuclear@1 25 * scaled fixed-point arithmetic, with a minimal number of shifts.
nuclear@1 26 */
nuclear@1 27
nuclear@1 28 #define JPEG_INTERNALS
nuclear@1 29 #include "jinclude.h"
nuclear@1 30 #include "jpeglib.h"
nuclear@1 31 #include "jdct.h" /* Private declarations for DCT subsystem */
nuclear@1 32
nuclear@1 33 #ifdef DCT_ISLOW_SUPPORTED
nuclear@1 34
nuclear@1 35
nuclear@1 36 /*
nuclear@1 37 * This module is specialized to the case DCTSIZE = 8.
nuclear@1 38 */
nuclear@1 39
nuclear@1 40 #if DCTSIZE != 8
nuclear@1 41 Sorry, this code only copes with 8x8 DCTs. /* deliberate syntax err */
nuclear@1 42 #endif
nuclear@1 43
nuclear@1 44
nuclear@1 45 /*
nuclear@1 46 * The poop on this scaling stuff is as follows:
nuclear@1 47 *
nuclear@1 48 * Each 1-D IDCT step produces outputs which are a factor of sqrt(N)
nuclear@1 49 * larger than the true IDCT outputs. The final outputs are therefore
nuclear@1 50 * a factor of N larger than desired; since N=8 this can be cured by
nuclear@1 51 * a simple right shift at the end of the algorithm. The advantage of
nuclear@1 52 * this arrangement is that we save two multiplications per 1-D IDCT,
nuclear@1 53 * because the y0 and y4 inputs need not be divided by sqrt(N).
nuclear@1 54 *
nuclear@1 55 * We have to do addition and subtraction of the integer inputs, which
nuclear@1 56 * is no problem, and multiplication by fractional constants, which is
nuclear@1 57 * a problem to do in integer arithmetic. We multiply all the constants
nuclear@1 58 * by CONST_SCALE and convert them to integer constants (thus retaining
nuclear@1 59 * CONST_BITS bits of precision in the constants). After doing a
nuclear@1 60 * multiplication we have to divide the product by CONST_SCALE, with proper
nuclear@1 61 * rounding, to produce the correct output. This division can be done
nuclear@1 62 * cheaply as a right shift of CONST_BITS bits. We postpone shifting
nuclear@1 63 * as long as possible so that partial sums can be added together with
nuclear@1 64 * full fractional precision.
nuclear@1 65 *
nuclear@1 66 * The outputs of the first pass are scaled up by PASS1_BITS bits so that
nuclear@1 67 * they are represented to better-than-integral precision. These outputs
nuclear@1 68 * require BITS_IN_JSAMPLE + PASS1_BITS + 3 bits; this fits in a 16-bit word
nuclear@1 69 * with the recommended scaling. (To scale up 12-bit sample data further, an
nuclear@1 70 * intermediate INT32 array would be needed.)
nuclear@1 71 *
nuclear@1 72 * To avoid overflow of the 32-bit intermediate results in pass 2, we must
nuclear@1 73 * have BITS_IN_JSAMPLE + CONST_BITS + PASS1_BITS <= 26. Error analysis
nuclear@1 74 * shows that the values given below are the most effective.
nuclear@1 75 */
nuclear@1 76
nuclear@1 77 #if BITS_IN_JSAMPLE == 8
nuclear@1 78 #define CONST_BITS 13
nuclear@1 79 #define PASS1_BITS 2
nuclear@1 80 #else
nuclear@1 81 #define CONST_BITS 13
nuclear@1 82 #define PASS1_BITS 1 /* lose a little precision to avoid overflow */
nuclear@1 83 #endif
nuclear@1 84
nuclear@1 85 /* Some C compilers fail to reduce "FIX(constant)" at compile time, thus
nuclear@1 86 * causing a lot of useless floating-point operations at run time.
nuclear@1 87 * To get around this we use the following pre-calculated constants.
nuclear@1 88 * If you change CONST_BITS you may want to add appropriate values.
nuclear@1 89 * (With a reasonable C compiler, you can just rely on the FIX() macro...)
nuclear@1 90 */
nuclear@1 91
nuclear@1 92 #if CONST_BITS == 13
nuclear@1 93 #define FIX_0_298631336 ((INT32) 2446) /* FIX(0.298631336) */
nuclear@1 94 #define FIX_0_390180644 ((INT32) 3196) /* FIX(0.390180644) */
nuclear@1 95 #define FIX_0_541196100 ((INT32) 4433) /* FIX(0.541196100) */
nuclear@1 96 #define FIX_0_765366865 ((INT32) 6270) /* FIX(0.765366865) */
nuclear@1 97 #define FIX_0_899976223 ((INT32) 7373) /* FIX(0.899976223) */
nuclear@1 98 #define FIX_1_175875602 ((INT32) 9633) /* FIX(1.175875602) */
nuclear@1 99 #define FIX_1_501321110 ((INT32) 12299) /* FIX(1.501321110) */
nuclear@1 100 #define FIX_1_847759065 ((INT32) 15137) /* FIX(1.847759065) */
nuclear@1 101 #define FIX_1_961570560 ((INT32) 16069) /* FIX(1.961570560) */
nuclear@1 102 #define FIX_2_053119869 ((INT32) 16819) /* FIX(2.053119869) */
nuclear@1 103 #define FIX_2_562915447 ((INT32) 20995) /* FIX(2.562915447) */
nuclear@1 104 #define FIX_3_072711026 ((INT32) 25172) /* FIX(3.072711026) */
nuclear@1 105 #else
nuclear@1 106 #define FIX_0_298631336 FIX(0.298631336)
nuclear@1 107 #define FIX_0_390180644 FIX(0.390180644)
nuclear@1 108 #define FIX_0_541196100 FIX(0.541196100)
nuclear@1 109 #define FIX_0_765366865 FIX(0.765366865)
nuclear@1 110 #define FIX_0_899976223 FIX(0.899976223)
nuclear@1 111 #define FIX_1_175875602 FIX(1.175875602)
nuclear@1 112 #define FIX_1_501321110 FIX(1.501321110)
nuclear@1 113 #define FIX_1_847759065 FIX(1.847759065)
nuclear@1 114 #define FIX_1_961570560 FIX(1.961570560)
nuclear@1 115 #define FIX_2_053119869 FIX(2.053119869)
nuclear@1 116 #define FIX_2_562915447 FIX(2.562915447)
nuclear@1 117 #define FIX_3_072711026 FIX(3.072711026)
nuclear@1 118 #endif
nuclear@1 119
nuclear@1 120
nuclear@1 121 /* Multiply an INT32 variable by an INT32 constant to yield an INT32 result.
nuclear@1 122 * For 8-bit samples with the recommended scaling, all the variable
nuclear@1 123 * and constant values involved are no more than 16 bits wide, so a
nuclear@1 124 * 16x16->32 bit multiply can be used instead of a full 32x32 multiply.
nuclear@1 125 * For 12-bit samples, a full 32-bit multiplication will be needed.
nuclear@1 126 */
nuclear@1 127
nuclear@1 128 #if BITS_IN_JSAMPLE == 8
nuclear@1 129 #define MULTIPLY(var,const) MULTIPLY16C16(var,const)
nuclear@1 130 #else
nuclear@1 131 #define MULTIPLY(var,const) ((var) * (const))
nuclear@1 132 #endif
nuclear@1 133
nuclear@1 134
nuclear@1 135 /* Dequantize a coefficient by multiplying it by the multiplier-table
nuclear@1 136 * entry; produce an int result. In this module, both inputs and result
nuclear@1 137 * are 16 bits or less, so either int or short multiply will work.
nuclear@1 138 */
nuclear@1 139
nuclear@1 140 #define DEQUANTIZE(coef,quantval) (((ISLOW_MULT_TYPE) (coef)) * (quantval))
nuclear@1 141
nuclear@1 142
nuclear@1 143 /*
nuclear@1 144 * Perform dequantization and inverse DCT on one block of coefficients.
nuclear@1 145 */
nuclear@1 146
nuclear@1 147 GLOBAL(void)
nuclear@1 148 jpeg_idct_islow (j_decompress_ptr cinfo, jpeg_component_info * compptr,
nuclear@1 149 JCOEFPTR coef_block,
nuclear@1 150 JSAMPARRAY output_buf, JDIMENSION output_col)
nuclear@1 151 {
nuclear@1 152 INT32 tmp0, tmp1, tmp2, tmp3;
nuclear@1 153 INT32 tmp10, tmp11, tmp12, tmp13;
nuclear@1 154 INT32 z1, z2, z3, z4, z5;
nuclear@1 155 JCOEFPTR inptr;
nuclear@1 156 ISLOW_MULT_TYPE * quantptr;
nuclear@1 157 int * wsptr;
nuclear@1 158 JSAMPROW outptr;
nuclear@1 159 JSAMPLE *range_limit = IDCT_range_limit(cinfo);
nuclear@1 160 int ctr;
nuclear@1 161 int workspace[DCTSIZE2]; /* buffers data between passes */
nuclear@1 162 SHIFT_TEMPS
nuclear@1 163
nuclear@1 164 /* Pass 1: process columns from input, store into work array. */
nuclear@1 165 /* Note results are scaled up by sqrt(8) compared to a true IDCT; */
nuclear@1 166 /* furthermore, we scale the results by 2**PASS1_BITS. */
nuclear@1 167
nuclear@1 168 inptr = coef_block;
nuclear@1 169 quantptr = (ISLOW_MULT_TYPE *) compptr->dct_table;
nuclear@1 170 wsptr = workspace;
nuclear@1 171 for (ctr = DCTSIZE; ctr > 0; ctr--) {
nuclear@1 172 /* Due to quantization, we will usually find that many of the input
nuclear@1 173 * coefficients are zero, especially the AC terms. We can exploit this
nuclear@1 174 * by short-circuiting the IDCT calculation for any column in which all
nuclear@1 175 * the AC terms are zero. In that case each output is equal to the
nuclear@1 176 * DC coefficient (with scale factor as needed).
nuclear@1 177 * With typical images and quantization tables, half or more of the
nuclear@1 178 * column DCT calculations can be simplified this way.
nuclear@1 179 */
nuclear@1 180
nuclear@1 181 if (inptr[DCTSIZE*1] == 0 && inptr[DCTSIZE*2] == 0 &&
nuclear@1 182 inptr[DCTSIZE*3] == 0 && inptr[DCTSIZE*4] == 0 &&
nuclear@1 183 inptr[DCTSIZE*5] == 0 && inptr[DCTSIZE*6] == 0 &&
nuclear@1 184 inptr[DCTSIZE*7] == 0) {
nuclear@1 185 /* AC terms all zero */
nuclear@1 186 int dcval = DEQUANTIZE(inptr[DCTSIZE*0], quantptr[DCTSIZE*0]) << PASS1_BITS;
nuclear@1 187
nuclear@1 188 wsptr[DCTSIZE*0] = dcval;
nuclear@1 189 wsptr[DCTSIZE*1] = dcval;
nuclear@1 190 wsptr[DCTSIZE*2] = dcval;
nuclear@1 191 wsptr[DCTSIZE*3] = dcval;
nuclear@1 192 wsptr[DCTSIZE*4] = dcval;
nuclear@1 193 wsptr[DCTSIZE*5] = dcval;
nuclear@1 194 wsptr[DCTSIZE*6] = dcval;
nuclear@1 195 wsptr[DCTSIZE*7] = dcval;
nuclear@1 196
nuclear@1 197 inptr++; /* advance pointers to next column */
nuclear@1 198 quantptr++;
nuclear@1 199 wsptr++;
nuclear@1 200 continue;
nuclear@1 201 }
nuclear@1 202
nuclear@1 203 /* Even part: reverse the even part of the forward DCT. */
nuclear@1 204 /* The rotator is sqrt(2)*c(-6). */
nuclear@1 205
nuclear@1 206 z2 = DEQUANTIZE(inptr[DCTSIZE*2], quantptr[DCTSIZE*2]);
nuclear@1 207 z3 = DEQUANTIZE(inptr[DCTSIZE*6], quantptr[DCTSIZE*6]);
nuclear@1 208
nuclear@1 209 z1 = MULTIPLY(z2 + z3, FIX_0_541196100);
nuclear@1 210 tmp2 = z1 + MULTIPLY(z3, - FIX_1_847759065);
nuclear@1 211 tmp3 = z1 + MULTIPLY(z2, FIX_0_765366865);
nuclear@1 212
nuclear@1 213 z2 = DEQUANTIZE(inptr[DCTSIZE*0], quantptr[DCTSIZE*0]);
nuclear@1 214 z3 = DEQUANTIZE(inptr[DCTSIZE*4], quantptr[DCTSIZE*4]);
nuclear@1 215
nuclear@1 216 tmp0 = (z2 + z3) << CONST_BITS;
nuclear@1 217 tmp1 = (z2 - z3) << CONST_BITS;
nuclear@1 218
nuclear@1 219 tmp10 = tmp0 + tmp3;
nuclear@1 220 tmp13 = tmp0 - tmp3;
nuclear@1 221 tmp11 = tmp1 + tmp2;
nuclear@1 222 tmp12 = tmp1 - tmp2;
nuclear@1 223
nuclear@1 224 /* Odd part per figure 8; the matrix is unitary and hence its
nuclear@1 225 * transpose is its inverse. i0..i3 are y7,y5,y3,y1 respectively.
nuclear@1 226 */
nuclear@1 227
nuclear@1 228 tmp0 = DEQUANTIZE(inptr[DCTSIZE*7], quantptr[DCTSIZE*7]);
nuclear@1 229 tmp1 = DEQUANTIZE(inptr[DCTSIZE*5], quantptr[DCTSIZE*5]);
nuclear@1 230 tmp2 = DEQUANTIZE(inptr[DCTSIZE*3], quantptr[DCTSIZE*3]);
nuclear@1 231 tmp3 = DEQUANTIZE(inptr[DCTSIZE*1], quantptr[DCTSIZE*1]);
nuclear@1 232
nuclear@1 233 z1 = tmp0 + tmp3;
nuclear@1 234 z2 = tmp1 + tmp2;
nuclear@1 235 z3 = tmp0 + tmp2;
nuclear@1 236 z4 = tmp1 + tmp3;
nuclear@1 237 z5 = MULTIPLY(z3 + z4, FIX_1_175875602); /* sqrt(2) * c3 */
nuclear@1 238
nuclear@1 239 tmp0 = MULTIPLY(tmp0, FIX_0_298631336); /* sqrt(2) * (-c1+c3+c5-c7) */
nuclear@1 240 tmp1 = MULTIPLY(tmp1, FIX_2_053119869); /* sqrt(2) * ( c1+c3-c5+c7) */
nuclear@1 241 tmp2 = MULTIPLY(tmp2, FIX_3_072711026); /* sqrt(2) * ( c1+c3+c5-c7) */
nuclear@1 242 tmp3 = MULTIPLY(tmp3, FIX_1_501321110); /* sqrt(2) * ( c1+c3-c5-c7) */
nuclear@1 243 z1 = MULTIPLY(z1, - FIX_0_899976223); /* sqrt(2) * (c7-c3) */
nuclear@1 244 z2 = MULTIPLY(z2, - FIX_2_562915447); /* sqrt(2) * (-c1-c3) */
nuclear@1 245 z3 = MULTIPLY(z3, - FIX_1_961570560); /* sqrt(2) * (-c3-c5) */
nuclear@1 246 z4 = MULTIPLY(z4, - FIX_0_390180644); /* sqrt(2) * (c5-c3) */
nuclear@1 247
nuclear@1 248 z3 += z5;
nuclear@1 249 z4 += z5;
nuclear@1 250
nuclear@1 251 tmp0 += z1 + z3;
nuclear@1 252 tmp1 += z2 + z4;
nuclear@1 253 tmp2 += z2 + z3;
nuclear@1 254 tmp3 += z1 + z4;
nuclear@1 255
nuclear@1 256 /* Final output stage: inputs are tmp10..tmp13, tmp0..tmp3 */
nuclear@1 257
nuclear@1 258 wsptr[DCTSIZE*0] = (int) DESCALE(tmp10 + tmp3, CONST_BITS-PASS1_BITS);
nuclear@1 259 wsptr[DCTSIZE*7] = (int) DESCALE(tmp10 - tmp3, CONST_BITS-PASS1_BITS);
nuclear@1 260 wsptr[DCTSIZE*1] = (int) DESCALE(tmp11 + tmp2, CONST_BITS-PASS1_BITS);
nuclear@1 261 wsptr[DCTSIZE*6] = (int) DESCALE(tmp11 - tmp2, CONST_BITS-PASS1_BITS);
nuclear@1 262 wsptr[DCTSIZE*2] = (int) DESCALE(tmp12 + tmp1, CONST_BITS-PASS1_BITS);
nuclear@1 263 wsptr[DCTSIZE*5] = (int) DESCALE(tmp12 - tmp1, CONST_BITS-PASS1_BITS);
nuclear@1 264 wsptr[DCTSIZE*3] = (int) DESCALE(tmp13 + tmp0, CONST_BITS-PASS1_BITS);
nuclear@1 265 wsptr[DCTSIZE*4] = (int) DESCALE(tmp13 - tmp0, CONST_BITS-PASS1_BITS);
nuclear@1 266
nuclear@1 267 inptr++; /* advance pointers to next column */
nuclear@1 268 quantptr++;
nuclear@1 269 wsptr++;
nuclear@1 270 }
nuclear@1 271
nuclear@1 272 /* Pass 2: process rows from work array, store into output array. */
nuclear@1 273 /* Note that we must descale the results by a factor of 8 == 2**3, */
nuclear@1 274 /* and also undo the PASS1_BITS scaling. */
nuclear@1 275
nuclear@1 276 wsptr = workspace;
nuclear@1 277 for (ctr = 0; ctr < DCTSIZE; ctr++) {
nuclear@1 278 outptr = output_buf[ctr] + output_col;
nuclear@1 279 /* Rows of zeroes can be exploited in the same way as we did with columns.
nuclear@1 280 * However, the column calculation has created many nonzero AC terms, so
nuclear@1 281 * the simplification applies less often (typically 5% to 10% of the time).
nuclear@1 282 * On machines with very fast multiplication, it's possible that the
nuclear@1 283 * test takes more time than it's worth. In that case this section
nuclear@1 284 * may be commented out.
nuclear@1 285 */
nuclear@1 286
nuclear@1 287 #ifndef NO_ZERO_ROW_TEST
nuclear@1 288 if (wsptr[1] == 0 && wsptr[2] == 0 && wsptr[3] == 0 && wsptr[4] == 0 &&
nuclear@1 289 wsptr[5] == 0 && wsptr[6] == 0 && wsptr[7] == 0) {
nuclear@1 290 /* AC terms all zero */
nuclear@1 291 JSAMPLE dcval = range_limit[(int) DESCALE((INT32) wsptr[0], PASS1_BITS+3)
nuclear@1 292 & RANGE_MASK];
nuclear@1 293
nuclear@1 294 outptr[0] = dcval;
nuclear@1 295 outptr[1] = dcval;
nuclear@1 296 outptr[2] = dcval;
nuclear@1 297 outptr[3] = dcval;
nuclear@1 298 outptr[4] = dcval;
nuclear@1 299 outptr[5] = dcval;
nuclear@1 300 outptr[6] = dcval;
nuclear@1 301 outptr[7] = dcval;
nuclear@1 302
nuclear@1 303 wsptr += DCTSIZE; /* advance pointer to next row */
nuclear@1 304 continue;
nuclear@1 305 }
nuclear@1 306 #endif
nuclear@1 307
nuclear@1 308 /* Even part: reverse the even part of the forward DCT. */
nuclear@1 309 /* The rotator is sqrt(2)*c(-6). */
nuclear@1 310
nuclear@1 311 z2 = (INT32) wsptr[2];
nuclear@1 312 z3 = (INT32) wsptr[6];
nuclear@1 313
nuclear@1 314 z1 = MULTIPLY(z2 + z3, FIX_0_541196100);
nuclear@1 315 tmp2 = z1 + MULTIPLY(z3, - FIX_1_847759065);
nuclear@1 316 tmp3 = z1 + MULTIPLY(z2, FIX_0_765366865);
nuclear@1 317
nuclear@1 318 tmp0 = ((INT32) wsptr[0] + (INT32) wsptr[4]) << CONST_BITS;
nuclear@1 319 tmp1 = ((INT32) wsptr[0] - (INT32) wsptr[4]) << CONST_BITS;
nuclear@1 320
nuclear@1 321 tmp10 = tmp0 + tmp3;
nuclear@1 322 tmp13 = tmp0 - tmp3;
nuclear@1 323 tmp11 = tmp1 + tmp2;
nuclear@1 324 tmp12 = tmp1 - tmp2;
nuclear@1 325
nuclear@1 326 /* Odd part per figure 8; the matrix is unitary and hence its
nuclear@1 327 * transpose is its inverse. i0..i3 are y7,y5,y3,y1 respectively.
nuclear@1 328 */
nuclear@1 329
nuclear@1 330 tmp0 = (INT32) wsptr[7];
nuclear@1 331 tmp1 = (INT32) wsptr[5];
nuclear@1 332 tmp2 = (INT32) wsptr[3];
nuclear@1 333 tmp3 = (INT32) wsptr[1];
nuclear@1 334
nuclear@1 335 z1 = tmp0 + tmp3;
nuclear@1 336 z2 = tmp1 + tmp2;
nuclear@1 337 z3 = tmp0 + tmp2;
nuclear@1 338 z4 = tmp1 + tmp3;
nuclear@1 339 z5 = MULTIPLY(z3 + z4, FIX_1_175875602); /* sqrt(2) * c3 */
nuclear@1 340
nuclear@1 341 tmp0 = MULTIPLY(tmp0, FIX_0_298631336); /* sqrt(2) * (-c1+c3+c5-c7) */
nuclear@1 342 tmp1 = MULTIPLY(tmp1, FIX_2_053119869); /* sqrt(2) * ( c1+c3-c5+c7) */
nuclear@1 343 tmp2 = MULTIPLY(tmp2, FIX_3_072711026); /* sqrt(2) * ( c1+c3+c5-c7) */
nuclear@1 344 tmp3 = MULTIPLY(tmp3, FIX_1_501321110); /* sqrt(2) * ( c1+c3-c5-c7) */
nuclear@1 345 z1 = MULTIPLY(z1, - FIX_0_899976223); /* sqrt(2) * (c7-c3) */
nuclear@1 346 z2 = MULTIPLY(z2, - FIX_2_562915447); /* sqrt(2) * (-c1-c3) */
nuclear@1 347 z3 = MULTIPLY(z3, - FIX_1_961570560); /* sqrt(2) * (-c3-c5) */
nuclear@1 348 z4 = MULTIPLY(z4, - FIX_0_390180644); /* sqrt(2) * (c5-c3) */
nuclear@1 349
nuclear@1 350 z3 += z5;
nuclear@1 351 z4 += z5;
nuclear@1 352
nuclear@1 353 tmp0 += z1 + z3;
nuclear@1 354 tmp1 += z2 + z4;
nuclear@1 355 tmp2 += z2 + z3;
nuclear@1 356 tmp3 += z1 + z4;
nuclear@1 357
nuclear@1 358 /* Final output stage: inputs are tmp10..tmp13, tmp0..tmp3 */
nuclear@1 359
nuclear@1 360 outptr[0] = range_limit[(int) DESCALE(tmp10 + tmp3,
nuclear@1 361 CONST_BITS+PASS1_BITS+3)
nuclear@1 362 & RANGE_MASK];
nuclear@1 363 outptr[7] = range_limit[(int) DESCALE(tmp10 - tmp3,
nuclear@1 364 CONST_BITS+PASS1_BITS+3)
nuclear@1 365 & RANGE_MASK];
nuclear@1 366 outptr[1] = range_limit[(int) DESCALE(tmp11 + tmp2,
nuclear@1 367 CONST_BITS+PASS1_BITS+3)
nuclear@1 368 & RANGE_MASK];
nuclear@1 369 outptr[6] = range_limit[(int) DESCALE(tmp11 - tmp2,
nuclear@1 370 CONST_BITS+PASS1_BITS+3)
nuclear@1 371 & RANGE_MASK];
nuclear@1 372 outptr[2] = range_limit[(int) DESCALE(tmp12 + tmp1,
nuclear@1 373 CONST_BITS+PASS1_BITS+3)
nuclear@1 374 & RANGE_MASK];
nuclear@1 375 outptr[5] = range_limit[(int) DESCALE(tmp12 - tmp1,
nuclear@1 376 CONST_BITS+PASS1_BITS+3)
nuclear@1 377 & RANGE_MASK];
nuclear@1 378 outptr[3] = range_limit[(int) DESCALE(tmp13 + tmp0,
nuclear@1 379 CONST_BITS+PASS1_BITS+3)
nuclear@1 380 & RANGE_MASK];
nuclear@1 381 outptr[4] = range_limit[(int) DESCALE(tmp13 - tmp0,
nuclear@1 382 CONST_BITS+PASS1_BITS+3)
nuclear@1 383 & RANGE_MASK];
nuclear@1 384
nuclear@1 385 wsptr += DCTSIZE; /* advance pointer to next row */
nuclear@1 386 }
nuclear@1 387 }
nuclear@1 388
nuclear@1 389 #endif /* DCT_ISLOW_SUPPORTED */