istereo2

annotate libs/libjpeg/jidctflt.c @ 2:81d35769f546

find changesets by author, revision, files, or words in the commit message
added the tunnel effect source
author John Tsiombikas <nuclear@member.fsf.org>
date Sat, 19 Sep 2015 05:51:51 +0300
parents
children
rev   line source
nuclear@2 1 /*
nuclear@2 2 * jidctflt.c
nuclear@2 3 *
nuclear@2 4 * Copyright (C) 1994-1998, Thomas G. Lane.
nuclear@2 5 * This file is part of the Independent JPEG Group's software.
nuclear@2 6 * For conditions of distribution and use, see the accompanying README file.
nuclear@2 7 *
nuclear@2 8 * This file contains a floating-point implementation of the
nuclear@2 9 * inverse DCT (Discrete Cosine Transform). In the IJG code, this routine
nuclear@2 10 * must also perform dequantization of the input coefficients.
nuclear@2 11 *
nuclear@2 12 * This implementation should be more accurate than either of the integer
nuclear@2 13 * IDCT implementations. However, it may not give the same results on all
nuclear@2 14 * machines because of differences in roundoff behavior. Speed will depend
nuclear@2 15 * on the hardware's floating point capacity.
nuclear@2 16 *
nuclear@2 17 * A 2-D IDCT can be done by 1-D IDCT on each column followed by 1-D IDCT
nuclear@2 18 * on each row (or vice versa, but it's more convenient to emit a row at
nuclear@2 19 * a time). Direct algorithms are also available, but they are much more
nuclear@2 20 * complex and seem not to be any faster when reduced to code.
nuclear@2 21 *
nuclear@2 22 * This implementation is based on Arai, Agui, and Nakajima's algorithm for
nuclear@2 23 * scaled DCT. Their original paper (Trans. IEICE E-71(11):1095) is in
nuclear@2 24 * Japanese, but the algorithm is described in the Pennebaker & Mitchell
nuclear@2 25 * JPEG textbook (see REFERENCES section in file README). The following code
nuclear@2 26 * is based directly on figure 4-8 in P&M.
nuclear@2 27 * While an 8-point DCT cannot be done in less than 11 multiplies, it is
nuclear@2 28 * possible to arrange the computation so that many of the multiplies are
nuclear@2 29 * simple scalings of the final outputs. These multiplies can then be
nuclear@2 30 * folded into the multiplications or divisions by the JPEG quantization
nuclear@2 31 * table entries. The AA&N method leaves only 5 multiplies and 29 adds
nuclear@2 32 * to be done in the DCT itself.
nuclear@2 33 * The primary disadvantage of this method is that with a fixed-point
nuclear@2 34 * implementation, accuracy is lost due to imprecise representation of the
nuclear@2 35 * scaled quantization values. However, that problem does not arise if
nuclear@2 36 * we use floating point arithmetic.
nuclear@2 37 */
nuclear@2 38
nuclear@2 39 #define JPEG_INTERNALS
nuclear@2 40 #include "jinclude.h"
nuclear@2 41 #include "jpeglib.h"
nuclear@2 42 #include "jdct.h" /* Private declarations for DCT subsystem */
nuclear@2 43
nuclear@2 44 #ifdef DCT_FLOAT_SUPPORTED
nuclear@2 45
nuclear@2 46
nuclear@2 47 /*
nuclear@2 48 * This module is specialized to the case DCTSIZE = 8.
nuclear@2 49 */
nuclear@2 50
nuclear@2 51 #if DCTSIZE != 8
nuclear@2 52 Sorry, this code only copes with 8x8 DCTs. /* deliberate syntax err */
nuclear@2 53 #endif
nuclear@2 54
nuclear@2 55
nuclear@2 56 /* Dequantize a coefficient by multiplying it by the multiplier-table
nuclear@2 57 * entry; produce a float result.
nuclear@2 58 */
nuclear@2 59
nuclear@2 60 #define DEQUANTIZE(coef,quantval) (((FAST_FLOAT) (coef)) * (quantval))
nuclear@2 61
nuclear@2 62
nuclear@2 63 /*
nuclear@2 64 * Perform dequantization and inverse DCT on one block of coefficients.
nuclear@2 65 */
nuclear@2 66
nuclear@2 67 GLOBAL(void)
nuclear@2 68 jpeg_idct_float (j_decompress_ptr cinfo, jpeg_component_info * compptr,
nuclear@2 69 JCOEFPTR coef_block,
nuclear@2 70 JSAMPARRAY output_buf, JDIMENSION output_col)
nuclear@2 71 {
nuclear@2 72 FAST_FLOAT tmp0, tmp1, tmp2, tmp3, tmp4, tmp5, tmp6, tmp7;
nuclear@2 73 FAST_FLOAT tmp10, tmp11, tmp12, tmp13;
nuclear@2 74 FAST_FLOAT z5, z10, z11, z12, z13;
nuclear@2 75 JCOEFPTR inptr;
nuclear@2 76 FLOAT_MULT_TYPE * quantptr;
nuclear@2 77 FAST_FLOAT * wsptr;
nuclear@2 78 JSAMPROW outptr;
nuclear@2 79 JSAMPLE *range_limit = IDCT_range_limit(cinfo);
nuclear@2 80 int ctr;
nuclear@2 81 FAST_FLOAT workspace[DCTSIZE2]; /* buffers data between passes */
nuclear@2 82 SHIFT_TEMPS
nuclear@2 83
nuclear@2 84 /* Pass 1: process columns from input, store into work array. */
nuclear@2 85
nuclear@2 86 inptr = coef_block;
nuclear@2 87 quantptr = (FLOAT_MULT_TYPE *) compptr->dct_table;
nuclear@2 88 wsptr = workspace;
nuclear@2 89 for (ctr = DCTSIZE; ctr > 0; ctr--) {
nuclear@2 90 /* Due to quantization, we will usually find that many of the input
nuclear@2 91 * coefficients are zero, especially the AC terms. We can exploit this
nuclear@2 92 * by short-circuiting the IDCT calculation for any column in which all
nuclear@2 93 * the AC terms are zero. In that case each output is equal to the
nuclear@2 94 * DC coefficient (with scale factor as needed).
nuclear@2 95 * With typical images and quantization tables, half or more of the
nuclear@2 96 * column DCT calculations can be simplified this way.
nuclear@2 97 */
nuclear@2 98
nuclear@2 99 if (inptr[DCTSIZE*1] == 0 && inptr[DCTSIZE*2] == 0 &&
nuclear@2 100 inptr[DCTSIZE*3] == 0 && inptr[DCTSIZE*4] == 0 &&
nuclear@2 101 inptr[DCTSIZE*5] == 0 && inptr[DCTSIZE*6] == 0 &&
nuclear@2 102 inptr[DCTSIZE*7] == 0) {
nuclear@2 103 /* AC terms all zero */
nuclear@2 104 FAST_FLOAT dcval = DEQUANTIZE(inptr[DCTSIZE*0], quantptr[DCTSIZE*0]);
nuclear@2 105
nuclear@2 106 wsptr[DCTSIZE*0] = dcval;
nuclear@2 107 wsptr[DCTSIZE*1] = dcval;
nuclear@2 108 wsptr[DCTSIZE*2] = dcval;
nuclear@2 109 wsptr[DCTSIZE*3] = dcval;
nuclear@2 110 wsptr[DCTSIZE*4] = dcval;
nuclear@2 111 wsptr[DCTSIZE*5] = dcval;
nuclear@2 112 wsptr[DCTSIZE*6] = dcval;
nuclear@2 113 wsptr[DCTSIZE*7] = dcval;
nuclear@2 114
nuclear@2 115 inptr++; /* advance pointers to next column */
nuclear@2 116 quantptr++;
nuclear@2 117 wsptr++;
nuclear@2 118 continue;
nuclear@2 119 }
nuclear@2 120
nuclear@2 121 /* Even part */
nuclear@2 122
nuclear@2 123 tmp0 = DEQUANTIZE(inptr[DCTSIZE*0], quantptr[DCTSIZE*0]);
nuclear@2 124 tmp1 = DEQUANTIZE(inptr[DCTSIZE*2], quantptr[DCTSIZE*2]);
nuclear@2 125 tmp2 = DEQUANTIZE(inptr[DCTSIZE*4], quantptr[DCTSIZE*4]);
nuclear@2 126 tmp3 = DEQUANTIZE(inptr[DCTSIZE*6], quantptr[DCTSIZE*6]);
nuclear@2 127
nuclear@2 128 tmp10 = tmp0 + tmp2; /* phase 3 */
nuclear@2 129 tmp11 = tmp0 - tmp2;
nuclear@2 130
nuclear@2 131 tmp13 = tmp1 + tmp3; /* phases 5-3 */
nuclear@2 132 tmp12 = (tmp1 - tmp3) * ((FAST_FLOAT) 1.414213562) - tmp13; /* 2*c4 */
nuclear@2 133
nuclear@2 134 tmp0 = tmp10 + tmp13; /* phase 2 */
nuclear@2 135 tmp3 = tmp10 - tmp13;
nuclear@2 136 tmp1 = tmp11 + tmp12;
nuclear@2 137 tmp2 = tmp11 - tmp12;
nuclear@2 138
nuclear@2 139 /* Odd part */
nuclear@2 140
nuclear@2 141 tmp4 = DEQUANTIZE(inptr[DCTSIZE*1], quantptr[DCTSIZE*1]);
nuclear@2 142 tmp5 = DEQUANTIZE(inptr[DCTSIZE*3], quantptr[DCTSIZE*3]);
nuclear@2 143 tmp6 = DEQUANTIZE(inptr[DCTSIZE*5], quantptr[DCTSIZE*5]);
nuclear@2 144 tmp7 = DEQUANTIZE(inptr[DCTSIZE*7], quantptr[DCTSIZE*7]);
nuclear@2 145
nuclear@2 146 z13 = tmp6 + tmp5; /* phase 6 */
nuclear@2 147 z10 = tmp6 - tmp5;
nuclear@2 148 z11 = tmp4 + tmp7;
nuclear@2 149 z12 = tmp4 - tmp7;
nuclear@2 150
nuclear@2 151 tmp7 = z11 + z13; /* phase 5 */
nuclear@2 152 tmp11 = (z11 - z13) * ((FAST_FLOAT) 1.414213562); /* 2*c4 */
nuclear@2 153
nuclear@2 154 z5 = (z10 + z12) * ((FAST_FLOAT) 1.847759065); /* 2*c2 */
nuclear@2 155 tmp10 = ((FAST_FLOAT) 1.082392200) * z12 - z5; /* 2*(c2-c6) */
nuclear@2 156 tmp12 = ((FAST_FLOAT) -2.613125930) * z10 + z5; /* -2*(c2+c6) */
nuclear@2 157
nuclear@2 158 tmp6 = tmp12 - tmp7; /* phase 2 */
nuclear@2 159 tmp5 = tmp11 - tmp6;
nuclear@2 160 tmp4 = tmp10 + tmp5;
nuclear@2 161
nuclear@2 162 wsptr[DCTSIZE*0] = tmp0 + tmp7;
nuclear@2 163 wsptr[DCTSIZE*7] = tmp0 - tmp7;
nuclear@2 164 wsptr[DCTSIZE*1] = tmp1 + tmp6;
nuclear@2 165 wsptr[DCTSIZE*6] = tmp1 - tmp6;
nuclear@2 166 wsptr[DCTSIZE*2] = tmp2 + tmp5;
nuclear@2 167 wsptr[DCTSIZE*5] = tmp2 - tmp5;
nuclear@2 168 wsptr[DCTSIZE*4] = tmp3 + tmp4;
nuclear@2 169 wsptr[DCTSIZE*3] = tmp3 - tmp4;
nuclear@2 170
nuclear@2 171 inptr++; /* advance pointers to next column */
nuclear@2 172 quantptr++;
nuclear@2 173 wsptr++;
nuclear@2 174 }
nuclear@2 175
nuclear@2 176 /* Pass 2: process rows from work array, store into output array. */
nuclear@2 177 /* Note that we must descale the results by a factor of 8 == 2**3. */
nuclear@2 178
nuclear@2 179 wsptr = workspace;
nuclear@2 180 for (ctr = 0; ctr < DCTSIZE; ctr++) {
nuclear@2 181 outptr = output_buf[ctr] + output_col;
nuclear@2 182 /* Rows of zeroes can be exploited in the same way as we did with columns.
nuclear@2 183 * However, the column calculation has created many nonzero AC terms, so
nuclear@2 184 * the simplification applies less often (typically 5% to 10% of the time).
nuclear@2 185 * And testing floats for zero is relatively expensive, so we don't bother.
nuclear@2 186 */
nuclear@2 187
nuclear@2 188 /* Even part */
nuclear@2 189
nuclear@2 190 tmp10 = wsptr[0] + wsptr[4];
nuclear@2 191 tmp11 = wsptr[0] - wsptr[4];
nuclear@2 192
nuclear@2 193 tmp13 = wsptr[2] + wsptr[6];
nuclear@2 194 tmp12 = (wsptr[2] - wsptr[6]) * ((FAST_FLOAT) 1.414213562) - tmp13;
nuclear@2 195
nuclear@2 196 tmp0 = tmp10 + tmp13;
nuclear@2 197 tmp3 = tmp10 - tmp13;
nuclear@2 198 tmp1 = tmp11 + tmp12;
nuclear@2 199 tmp2 = tmp11 - tmp12;
nuclear@2 200
nuclear@2 201 /* Odd part */
nuclear@2 202
nuclear@2 203 z13 = wsptr[5] + wsptr[3];
nuclear@2 204 z10 = wsptr[5] - wsptr[3];
nuclear@2 205 z11 = wsptr[1] + wsptr[7];
nuclear@2 206 z12 = wsptr[1] - wsptr[7];
nuclear@2 207
nuclear@2 208 tmp7 = z11 + z13;
nuclear@2 209 tmp11 = (z11 - z13) * ((FAST_FLOAT) 1.414213562);
nuclear@2 210
nuclear@2 211 z5 = (z10 + z12) * ((FAST_FLOAT) 1.847759065); /* 2*c2 */
nuclear@2 212 tmp10 = ((FAST_FLOAT) 1.082392200) * z12 - z5; /* 2*(c2-c6) */
nuclear@2 213 tmp12 = ((FAST_FLOAT) -2.613125930) * z10 + z5; /* -2*(c2+c6) */
nuclear@2 214
nuclear@2 215 tmp6 = tmp12 - tmp7;
nuclear@2 216 tmp5 = tmp11 - tmp6;
nuclear@2 217 tmp4 = tmp10 + tmp5;
nuclear@2 218
nuclear@2 219 /* Final output stage: scale down by a factor of 8 and range-limit */
nuclear@2 220
nuclear@2 221 outptr[0] = range_limit[(int) DESCALE((INT32) (tmp0 + tmp7), 3)
nuclear@2 222 & RANGE_MASK];
nuclear@2 223 outptr[7] = range_limit[(int) DESCALE((INT32) (tmp0 - tmp7), 3)
nuclear@2 224 & RANGE_MASK];
nuclear@2 225 outptr[1] = range_limit[(int) DESCALE((INT32) (tmp1 + tmp6), 3)
nuclear@2 226 & RANGE_MASK];
nuclear@2 227 outptr[6] = range_limit[(int) DESCALE((INT32) (tmp1 - tmp6), 3)
nuclear@2 228 & RANGE_MASK];
nuclear@2 229 outptr[2] = range_limit[(int) DESCALE((INT32) (tmp2 + tmp5), 3)
nuclear@2 230 & RANGE_MASK];
nuclear@2 231 outptr[5] = range_limit[(int) DESCALE((INT32) (tmp2 - tmp5), 3)
nuclear@2 232 & RANGE_MASK];
nuclear@2 233 outptr[4] = range_limit[(int) DESCALE((INT32) (tmp3 + tmp4), 3)
nuclear@2 234 & RANGE_MASK];
nuclear@2 235 outptr[3] = range_limit[(int) DESCALE((INT32) (tmp3 - tmp4), 3)
nuclear@2 236 & RANGE_MASK];
nuclear@2 237
nuclear@2 238 wsptr += DCTSIZE; /* advance pointer to next row */
nuclear@2 239 }
nuclear@2 240 }
nuclear@2 241
nuclear@2 242 #endif /* DCT_FLOAT_SUPPORTED */