The Tor Browser / annotate

media/libjpeg/jfdctint.c@b8a032363ba2 (annotated)

media/libjpeg/jfdctint.c

Thu, 22 Jan 2015 13:21:57 +0100

author
Michael Schloh von Bennewitz <michael@schloh.com>
date
Thu, 22 Jan 2015 13:21:57 +0100
branch
TOR_BUG_9701
changeset 15
b8a032363ba2
permissions
-rw-r--r--

Incorporate requested changes from Mozilla in review:
https://bugzilla.mozilla.org/show_bug.cgi?id=1123480#c6

michael@0 1 /*
michael@0 2 * jfdctint.c
michael@0 3 *
michael@0 4 * Copyright (C) 1991-1996, Thomas G. Lane.
michael@0 5 * This file is part of the Independent JPEG Group's software.
michael@0 6 * For conditions of distribution and use, see the accompanying README file.
michael@0 7 *
michael@0 8 * This file contains a slow-but-accurate integer implementation of the
michael@0 9 * forward DCT (Discrete Cosine Transform).
michael@0 10 *
michael@0 11 * A 2-D DCT can be done by 1-D DCT on each row followed by 1-D DCT
michael@0 12 * on each column. Direct algorithms are also available, but they are
michael@0 13 * much more complex and seem not to be any faster when reduced to code.
michael@0 14 *
michael@0 15 * This implementation is based on an algorithm described in
michael@0 16 * C. Loeffler, A. Ligtenberg and G. Moschytz, "Practical Fast 1-D DCT
michael@0 17 * Algorithms with 11 Multiplications", Proc. Int'l. Conf. on Acoustics,
michael@0 18 * Speech, and Signal Processing 1989 (ICASSP '89), pp. 988-991.
michael@0 19 * The primary algorithm described there uses 11 multiplies and 29 adds.
michael@0 20 * We use their alternate method with 12 multiplies and 32 adds.
michael@0 21 * The advantage of this method is that no data path contains more than one
michael@0 22 * multiplication; this allows a very simple and accurate implementation in
michael@0 23 * scaled fixed-point arithmetic, with a minimal number of shifts.
michael@0 24 */
michael@0 25
michael@0 26 #define JPEG_INTERNALS
michael@0 27 #include "jinclude.h"
michael@0 28 #include "jpeglib.h"
michael@0 29 #include "jdct.h" /* Private declarations for DCT subsystem */
michael@0 30
michael@0 31 #ifdef DCT_ISLOW_SUPPORTED
michael@0 32
michael@0 33
michael@0 34 /*
michael@0 35 * This module is specialized to the case DCTSIZE = 8.
michael@0 36 */
michael@0 37
michael@0 38 #if DCTSIZE != 8
michael@0 39 Sorry, this code only copes with 8x8 DCTs. /* deliberate syntax err */
michael@0 40 #endif
michael@0 41
michael@0 42
michael@0 43 /*
michael@0 44 * The poop on this scaling stuff is as follows:
michael@0 45 *
michael@0 46 * Each 1-D DCT step produces outputs which are a factor of sqrt(N)
michael@0 47 * larger than the true DCT outputs. The final outputs are therefore
michael@0 48 * a factor of N larger than desired; since N=8 this can be cured by
michael@0 49 * a simple right shift at the end of the algorithm. The advantage of
michael@0 50 * this arrangement is that we save two multiplications per 1-D DCT,
michael@0 51 * because the y0 and y4 outputs need not be divided by sqrt(N).
michael@0 52 * In the IJG code, this factor of 8 is removed by the quantization step
michael@0 53 * (in jcdctmgr.c), NOT in this module.
michael@0 54 *
michael@0 55 * We have to do addition and subtraction of the integer inputs, which
michael@0 56 * is no problem, and multiplication by fractional constants, which is
michael@0 57 * a problem to do in integer arithmetic. We multiply all the constants
michael@0 58 * by CONST_SCALE and convert them to integer constants (thus retaining
michael@0 59 * CONST_BITS bits of precision in the constants). After doing a
michael@0 60 * multiplication we have to divide the product by CONST_SCALE, with proper
michael@0 61 * rounding, to produce the correct output. This division can be done
michael@0 62 * cheaply as a right shift of CONST_BITS bits. We postpone shifting
michael@0 63 * as long as possible so that partial sums can be added together with
michael@0 64 * full fractional precision.
michael@0 65 *
michael@0 66 * The outputs of the first pass are scaled up by PASS1_BITS bits so that
michael@0 67 * they are represented to better-than-integral precision. These outputs
michael@0 68 * require BITS_IN_JSAMPLE + PASS1_BITS + 3 bits; this fits in a 16-bit word
michael@0 69 * with the recommended scaling. (For 12-bit sample data, the intermediate
michael@0 70 * array is INT32 anyway.)
michael@0 71 *
michael@0 72 * To avoid overflow of the 32-bit intermediate results in pass 2, we must
michael@0 73 * have BITS_IN_JSAMPLE + CONST_BITS + PASS1_BITS <= 26. Error analysis
michael@0 74 * shows that the values given below are the most effective.
michael@0 75 */
michael@0 76
michael@0 77 #if BITS_IN_JSAMPLE == 8
michael@0 78 #define CONST_BITS 13
michael@0 79 #define PASS1_BITS 2
michael@0 80 #else
michael@0 81 #define CONST_BITS 13
michael@0 82 #define PASS1_BITS 1 /* lose a little precision to avoid overflow */
michael@0 83 #endif
michael@0 84
michael@0 85 /* Some C compilers fail to reduce "FIX(constant)" at compile time, thus
michael@0 86 * causing a lot of useless floating-point operations at run time.
michael@0 87 * To get around this we use the following pre-calculated constants.
michael@0 88 * If you change CONST_BITS you may want to add appropriate values.
michael@0 89 * (With a reasonable C compiler, you can just rely on the FIX() macro...)
michael@0 90 */
michael@0 91
michael@0 92 #if CONST_BITS == 13
michael@0 93 #define FIX_0_298631336 ((INT32) 2446) /* FIX(0.298631336) */
michael@0 94 #define FIX_0_390180644 ((INT32) 3196) /* FIX(0.390180644) */
michael@0 95 #define FIX_0_541196100 ((INT32) 4433) /* FIX(0.541196100) */
michael@0 96 #define FIX_0_765366865 ((INT32) 6270) /* FIX(0.765366865) */
michael@0 97 #define FIX_0_899976223 ((INT32) 7373) /* FIX(0.899976223) */
michael@0 98 #define FIX_1_175875602 ((INT32) 9633) /* FIX(1.175875602) */
michael@0 99 #define FIX_1_501321110 ((INT32) 12299) /* FIX(1.501321110) */
michael@0 100 #define FIX_1_847759065 ((INT32) 15137) /* FIX(1.847759065) */
michael@0 101 #define FIX_1_961570560 ((INT32) 16069) /* FIX(1.961570560) */
michael@0 102 #define FIX_2_053119869 ((INT32) 16819) /* FIX(2.053119869) */
michael@0 103 #define FIX_2_562915447 ((INT32) 20995) /* FIX(2.562915447) */
michael@0 104 #define FIX_3_072711026 ((INT32) 25172) /* FIX(3.072711026) */
michael@0 105 #else
michael@0 106 #define FIX_0_298631336 FIX(0.298631336)
michael@0 107 #define FIX_0_390180644 FIX(0.390180644)
michael@0 108 #define FIX_0_541196100 FIX(0.541196100)
michael@0 109 #define FIX_0_765366865 FIX(0.765366865)
michael@0 110 #define FIX_0_899976223 FIX(0.899976223)
michael@0 111 #define FIX_1_175875602 FIX(1.175875602)
michael@0 112 #define FIX_1_501321110 FIX(1.501321110)
michael@0 113 #define FIX_1_847759065 FIX(1.847759065)
michael@0 114 #define FIX_1_961570560 FIX(1.961570560)
michael@0 115 #define FIX_2_053119869 FIX(2.053119869)
michael@0 116 #define FIX_2_562915447 FIX(2.562915447)
michael@0 117 #define FIX_3_072711026 FIX(3.072711026)
michael@0 118 #endif
michael@0 119
michael@0 120
michael@0 121 /* Multiply an INT32 variable by an INT32 constant to yield an INT32 result.
michael@0 122 * For 8-bit samples with the recommended scaling, all the variable
michael@0 123 * and constant values involved are no more than 16 bits wide, so a
michael@0 124 * 16x16->32 bit multiply can be used instead of a full 32x32 multiply.
michael@0 125 * For 12-bit samples, a full 32-bit multiplication will be needed.
michael@0 126 */
michael@0 127
michael@0 128 #if BITS_IN_JSAMPLE == 8
michael@0 129 #define MULTIPLY(var,const) MULTIPLY16C16(var,const)
michael@0 130 #else
michael@0 131 #define MULTIPLY(var,const) ((var) * (const))
michael@0 132 #endif
michael@0 133
michael@0 134
michael@0 135 /*
michael@0 136 * Perform the forward DCT on one block of samples.
michael@0 137 */
michael@0 138
michael@0 139 GLOBAL(void)
michael@0 140 jpeg_fdct_islow (DCTELEM * data)
michael@0 141 {
michael@0 142 INT32 tmp0, tmp1, tmp2, tmp3, tmp4, tmp5, tmp6, tmp7;
michael@0 143 INT32 tmp10, tmp11, tmp12, tmp13;
michael@0 144 INT32 z1, z2, z3, z4, z5;
michael@0 145 DCTELEM *dataptr;
michael@0 146 int ctr;
michael@0 147 SHIFT_TEMPS
michael@0 148
michael@0 149 /* Pass 1: process rows. */
michael@0 150 /* Note results are scaled up by sqrt(8) compared to a true DCT; */
michael@0 151 /* furthermore, we scale the results by 2**PASS1_BITS. */
michael@0 152
michael@0 153 dataptr = data;
michael@0 154 for (ctr = DCTSIZE-1; ctr >= 0; ctr--) {
michael@0 155 tmp0 = dataptr[0] + dataptr[7];
michael@0 156 tmp7 = dataptr[0] - dataptr[7];
michael@0 157 tmp1 = dataptr[1] + dataptr[6];
michael@0 158 tmp6 = dataptr[1] - dataptr[6];
michael@0 159 tmp2 = dataptr[2] + dataptr[5];
michael@0 160 tmp5 = dataptr[2] - dataptr[5];
michael@0 161 tmp3 = dataptr[3] + dataptr[4];
michael@0 162 tmp4 = dataptr[3] - dataptr[4];
michael@0 163
michael@0 164 /* Even part per LL&M figure 1 --- note that published figure is faulty;
michael@0 165 * rotator "sqrt(2)*c1" should be "sqrt(2)*c6".
michael@0 166 */
michael@0 167
michael@0 168 tmp10 = tmp0 + tmp3;
michael@0 169 tmp13 = tmp0 - tmp3;
michael@0 170 tmp11 = tmp1 + tmp2;
michael@0 171 tmp12 = tmp1 - tmp2;
michael@0 172
michael@0 173 dataptr[0] = (DCTELEM) ((tmp10 + tmp11) << PASS1_BITS);
michael@0 174 dataptr[4] = (DCTELEM) ((tmp10 - tmp11) << PASS1_BITS);
michael@0 175
michael@0 176 z1 = MULTIPLY(tmp12 + tmp13, FIX_0_541196100);
michael@0 177 dataptr[2] = (DCTELEM) DESCALE(z1 + MULTIPLY(tmp13, FIX_0_765366865),
michael@0 178 CONST_BITS-PASS1_BITS);
michael@0 179 dataptr[6] = (DCTELEM) DESCALE(z1 + MULTIPLY(tmp12, - FIX_1_847759065),
michael@0 180 CONST_BITS-PASS1_BITS);
michael@0 181
michael@0 182 /* Odd part per figure 8 --- note paper omits factor of sqrt(2).
michael@0 183 * cK represents cos(K*pi/16).
michael@0 184 * i0..i3 in the paper are tmp4..tmp7 here.
michael@0 185 */
michael@0 186
michael@0 187 z1 = tmp4 + tmp7;
michael@0 188 z2 = tmp5 + tmp6;
michael@0 189 z3 = tmp4 + tmp6;
michael@0 190 z4 = tmp5 + tmp7;
michael@0 191 z5 = MULTIPLY(z3 + z4, FIX_1_175875602); /* sqrt(2) * c3 */
michael@0 192
michael@0 193 tmp4 = MULTIPLY(tmp4, FIX_0_298631336); /* sqrt(2) * (-c1+c3+c5-c7) */
michael@0 194 tmp5 = MULTIPLY(tmp5, FIX_2_053119869); /* sqrt(2) * ( c1+c3-c5+c7) */
michael@0 195 tmp6 = MULTIPLY(tmp6, FIX_3_072711026); /* sqrt(2) * ( c1+c3+c5-c7) */
michael@0 196 tmp7 = MULTIPLY(tmp7, FIX_1_501321110); /* sqrt(2) * ( c1+c3-c5-c7) */
michael@0 197 z1 = MULTIPLY(z1, - FIX_0_899976223); /* sqrt(2) * (c7-c3) */
michael@0 198 z2 = MULTIPLY(z2, - FIX_2_562915447); /* sqrt(2) * (-c1-c3) */
michael@0 199 z3 = MULTIPLY(z3, - FIX_1_961570560); /* sqrt(2) * (-c3-c5) */
michael@0 200 z4 = MULTIPLY(z4, - FIX_0_390180644); /* sqrt(2) * (c5-c3) */
michael@0 201
michael@0 202 z3 += z5;
michael@0 203 z4 += z5;
michael@0 204
michael@0 205 dataptr[7] = (DCTELEM) DESCALE(tmp4 + z1 + z3, CONST_BITS-PASS1_BITS);
michael@0 206 dataptr[5] = (DCTELEM) DESCALE(tmp5 + z2 + z4, CONST_BITS-PASS1_BITS);
michael@0 207 dataptr[3] = (DCTELEM) DESCALE(tmp6 + z2 + z3, CONST_BITS-PASS1_BITS);
michael@0 208 dataptr[1] = (DCTELEM) DESCALE(tmp7 + z1 + z4, CONST_BITS-PASS1_BITS);
michael@0 209
michael@0 210 dataptr += DCTSIZE; /* advance pointer to next row */
michael@0 211 }
michael@0 212
michael@0 213 /* Pass 2: process columns.
michael@0 214 * We remove the PASS1_BITS scaling, but leave the results scaled up
michael@0 215 * by an overall factor of 8.
michael@0 216 */
michael@0 217
michael@0 218 dataptr = data;
michael@0 219 for (ctr = DCTSIZE-1; ctr >= 0; ctr--) {
michael@0 220 tmp0 = dataptr[DCTSIZE*0] + dataptr[DCTSIZE*7];
michael@0 221 tmp7 = dataptr[DCTSIZE*0] - dataptr[DCTSIZE*7];
michael@0 222 tmp1 = dataptr[DCTSIZE*1] + dataptr[DCTSIZE*6];
michael@0 223 tmp6 = dataptr[DCTSIZE*1] - dataptr[DCTSIZE*6];
michael@0 224 tmp2 = dataptr[DCTSIZE*2] + dataptr[DCTSIZE*5];
michael@0 225 tmp5 = dataptr[DCTSIZE*2] - dataptr[DCTSIZE*5];
michael@0 226 tmp3 = dataptr[DCTSIZE*3] + dataptr[DCTSIZE*4];
michael@0 227 tmp4 = dataptr[DCTSIZE*3] - dataptr[DCTSIZE*4];
michael@0 228
michael@0 229 /* Even part per LL&M figure 1 --- note that published figure is faulty;
michael@0 230 * rotator "sqrt(2)*c1" should be "sqrt(2)*c6".
michael@0 231 */
michael@0 232
michael@0 233 tmp10 = tmp0 + tmp3;
michael@0 234 tmp13 = tmp0 - tmp3;
michael@0 235 tmp11 = tmp1 + tmp2;
michael@0 236 tmp12 = tmp1 - tmp2;
michael@0 237
michael@0 238 dataptr[DCTSIZE*0] = (DCTELEM) DESCALE(tmp10 + tmp11, PASS1_BITS);
michael@0 239 dataptr[DCTSIZE*4] = (DCTELEM) DESCALE(tmp10 - tmp11, PASS1_BITS);
michael@0 240
michael@0 241 z1 = MULTIPLY(tmp12 + tmp13, FIX_0_541196100);
michael@0 242 dataptr[DCTSIZE*2] = (DCTELEM) DESCALE(z1 + MULTIPLY(tmp13, FIX_0_765366865),
michael@0 243 CONST_BITS+PASS1_BITS);
michael@0 244 dataptr[DCTSIZE*6] = (DCTELEM) DESCALE(z1 + MULTIPLY(tmp12, - FIX_1_847759065),
michael@0 245 CONST_BITS+PASS1_BITS);
michael@0 246
michael@0 247 /* Odd part per figure 8 --- note paper omits factor of sqrt(2).
michael@0 248 * cK represents cos(K*pi/16).
michael@0 249 * i0..i3 in the paper are tmp4..tmp7 here.
michael@0 250 */
michael@0 251
michael@0 252 z1 = tmp4 + tmp7;
michael@0 253 z2 = tmp5 + tmp6;
michael@0 254 z3 = tmp4 + tmp6;
michael@0 255 z4 = tmp5 + tmp7;
michael@0 256 z5 = MULTIPLY(z3 + z4, FIX_1_175875602); /* sqrt(2) * c3 */
michael@0 257
michael@0 258 tmp4 = MULTIPLY(tmp4, FIX_0_298631336); /* sqrt(2) * (-c1+c3+c5-c7) */
michael@0 259 tmp5 = MULTIPLY(tmp5, FIX_2_053119869); /* sqrt(2) * ( c1+c3-c5+c7) */
michael@0 260 tmp6 = MULTIPLY(tmp6, FIX_3_072711026); /* sqrt(2) * ( c1+c3+c5-c7) */
michael@0 261 tmp7 = MULTIPLY(tmp7, FIX_1_501321110); /* sqrt(2) * ( c1+c3-c5-c7) */
michael@0 262 z1 = MULTIPLY(z1, - FIX_0_899976223); /* sqrt(2) * (c7-c3) */
michael@0 263 z2 = MULTIPLY(z2, - FIX_2_562915447); /* sqrt(2) * (-c1-c3) */
michael@0 264 z3 = MULTIPLY(z3, - FIX_1_961570560); /* sqrt(2) * (-c3-c5) */
michael@0 265 z4 = MULTIPLY(z4, - FIX_0_390180644); /* sqrt(2) * (c5-c3) */
michael@0 266
michael@0 267 z3 += z5;
michael@0 268 z4 += z5;
michael@0 269
michael@0 270 dataptr[DCTSIZE*7] = (DCTELEM) DESCALE(tmp4 + z1 + z3,
michael@0 271 CONST_BITS+PASS1_BITS);
michael@0 272 dataptr[DCTSIZE*5] = (DCTELEM) DESCALE(tmp5 + z2 + z4,
michael@0 273 CONST_BITS+PASS1_BITS);
michael@0 274 dataptr[DCTSIZE*3] = (DCTELEM) DESCALE(tmp6 + z2 + z3,
michael@0 275 CONST_BITS+PASS1_BITS);
michael@0 276 dataptr[DCTSIZE*1] = (DCTELEM) DESCALE(tmp7 + z1 + z4,
michael@0 277 CONST_BITS+PASS1_BITS);
michael@0 278
michael@0 279 dataptr++; /* advance pointer to next column */
michael@0 280 }
michael@0 281 }
michael@0 282
michael@0 283 #endif /* DCT_ISLOW_SUPPORTED */

Mercurial Repository: The Tor Browser

Europalab SCM Repository Server

mercurial