vrshoot

annotate libs/libjpeg/jidctint.c @ 2:334d17aed7de

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