vrshoot

annotate libs/libjpeg/jfdctfst.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 * jfdctfst.c
nuclear@0 3 *
nuclear@0 4 * Copyright (C) 1994-1996, 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 fast, not so accurate integer implementation of the
nuclear@0 9 * forward DCT (Discrete Cosine Transform).
nuclear@0 10 *
nuclear@0 11 * A 2-D DCT can be done by 1-D DCT on each row followed by 1-D DCT
nuclear@0 12 * on each column. Direct algorithms are also available, but they are
nuclear@0 13 * much more complex and seem not to be any faster when reduced to code.
nuclear@0 14 *
nuclear@0 15 * This implementation is based on Arai, Agui, and Nakajima's algorithm for
nuclear@0 16 * scaled DCT. Their original paper (Trans. IEICE E-71(11):1095) is in
nuclear@0 17 * Japanese, but the algorithm is described in the Pennebaker & Mitchell
nuclear@0 18 * JPEG textbook (see REFERENCES section in file README). The following code
nuclear@0 19 * is based directly on figure 4-8 in P&M.
nuclear@0 20 * While an 8-point DCT cannot be done in less than 11 multiplies, it is
nuclear@0 21 * possible to arrange the computation so that many of the multiplies are
nuclear@0 22 * simple scalings of the final outputs. These multiplies can then be
nuclear@0 23 * folded into the multiplications or divisions by the JPEG quantization
nuclear@0 24 * table entries. The AA&N method leaves only 5 multiplies and 29 adds
nuclear@0 25 * to be done in the DCT itself.
nuclear@0 26 * The primary disadvantage of this method is that with fixed-point math,
nuclear@0 27 * accuracy is lost due to imprecise representation of the scaled
nuclear@0 28 * quantization values. The smaller the quantization table entry, the less
nuclear@0 29 * precise the scaled value, so this implementation does worse with high-
nuclear@0 30 * quality-setting files than with low-quality ones.
nuclear@0 31 */
nuclear@0 32
nuclear@0 33 #define JPEG_INTERNALS
nuclear@0 34 #include "jinclude.h"
nuclear@0 35 #include "jpeglib.h"
nuclear@0 36 #include "jdct.h" /* Private declarations for DCT subsystem */
nuclear@0 37
nuclear@0 38 #ifdef DCT_IFAST_SUPPORTED
nuclear@0 39
nuclear@0 40
nuclear@0 41 /*
nuclear@0 42 * This module is specialized to the case DCTSIZE = 8.
nuclear@0 43 */
nuclear@0 44
nuclear@0 45 #if DCTSIZE != 8
nuclear@0 46 Sorry, this code only copes with 8x8 DCTs. /* deliberate syntax err */
nuclear@0 47 #endif
nuclear@0 48
nuclear@0 49
nuclear@0 50 /* Scaling decisions are generally the same as in the LL&M algorithm;
nuclear@0 51 * see jfdctint.c for more details. However, we choose to descale
nuclear@0 52 * (right shift) multiplication products as soon as they are formed,
nuclear@0 53 * rather than carrying additional fractional bits into subsequent additions.
nuclear@0 54 * This compromises accuracy slightly, but it lets us save a few shifts.
nuclear@0 55 * More importantly, 16-bit arithmetic is then adequate (for 8-bit samples)
nuclear@0 56 * everywhere except in the multiplications proper; this saves a good deal
nuclear@0 57 * of work on 16-bit-int machines.
nuclear@0 58 *
nuclear@0 59 * Again to save a few shifts, the intermediate results between pass 1 and
nuclear@0 60 * pass 2 are not upscaled, but are represented only to integral precision.
nuclear@0 61 *
nuclear@0 62 * A final compromise is to represent the multiplicative constants to only
nuclear@0 63 * 8 fractional bits, rather than 13. This saves some shifting work on some
nuclear@0 64 * machines, and may also reduce the cost of multiplication (since there
nuclear@0 65 * are fewer one-bits in the constants).
nuclear@0 66 */
nuclear@0 67
nuclear@0 68 #define CONST_BITS 8
nuclear@0 69
nuclear@0 70
nuclear@0 71 /* Some C compilers fail to reduce "FIX(constant)" at compile time, thus
nuclear@0 72 * causing a lot of useless floating-point operations at run time.
nuclear@0 73 * To get around this we use the following pre-calculated constants.
nuclear@0 74 * If you change CONST_BITS you may want to add appropriate values.
nuclear@0 75 * (With a reasonable C compiler, you can just rely on the FIX() macro...)
nuclear@0 76 */
nuclear@0 77
nuclear@0 78 #if CONST_BITS == 8
nuclear@0 79 #define FIX_0_382683433 ((INT32) 98) /* FIX(0.382683433) */
nuclear@0 80 #define FIX_0_541196100 ((INT32) 139) /* FIX(0.541196100) */
nuclear@0 81 #define FIX_0_707106781 ((INT32) 181) /* FIX(0.707106781) */
nuclear@0 82 #define FIX_1_306562965 ((INT32) 334) /* FIX(1.306562965) */
nuclear@0 83 #else
nuclear@0 84 #define FIX_0_382683433 FIX(0.382683433)
nuclear@0 85 #define FIX_0_541196100 FIX(0.541196100)
nuclear@0 86 #define FIX_0_707106781 FIX(0.707106781)
nuclear@0 87 #define FIX_1_306562965 FIX(1.306562965)
nuclear@0 88 #endif
nuclear@0 89
nuclear@0 90
nuclear@0 91 /* We can gain a little more speed, with a further compromise in accuracy,
nuclear@0 92 * by omitting the addition in a descaling shift. This yields an incorrectly
nuclear@0 93 * rounded result half the time...
nuclear@0 94 */
nuclear@0 95
nuclear@0 96 #ifndef USE_ACCURATE_ROUNDING
nuclear@0 97 #undef DESCALE
nuclear@0 98 #define DESCALE(x,n) RIGHT_SHIFT(x, n)
nuclear@0 99 #endif
nuclear@0 100
nuclear@0 101
nuclear@0 102 /* Multiply a DCTELEM variable by an INT32 constant, and immediately
nuclear@0 103 * descale to yield a DCTELEM result.
nuclear@0 104 */
nuclear@0 105
nuclear@0 106 #define MULTIPLY(var,const) ((DCTELEM) DESCALE((var) * (const), CONST_BITS))
nuclear@0 107
nuclear@0 108
nuclear@0 109 /*
nuclear@0 110 * Perform the forward DCT on one block of samples.
nuclear@0 111 */
nuclear@0 112
nuclear@0 113 GLOBAL(void)
nuclear@0 114 jpeg_fdct_ifast (DCTELEM * data)
nuclear@0 115 {
nuclear@0 116 DCTELEM tmp0, tmp1, tmp2, tmp3, tmp4, tmp5, tmp6, tmp7;
nuclear@0 117 DCTELEM tmp10, tmp11, tmp12, tmp13;
nuclear@0 118 DCTELEM z1, z2, z3, z4, z5, z11, z13;
nuclear@0 119 DCTELEM *dataptr;
nuclear@0 120 int ctr;
nuclear@0 121 SHIFT_TEMPS
nuclear@0 122
nuclear@0 123 /* Pass 1: process rows. */
nuclear@0 124
nuclear@0 125 dataptr = data;
nuclear@0 126 for (ctr = DCTSIZE-1; ctr >= 0; ctr--) {
nuclear@0 127 tmp0 = dataptr[0] + dataptr[7];
nuclear@0 128 tmp7 = dataptr[0] - dataptr[7];
nuclear@0 129 tmp1 = dataptr[1] + dataptr[6];
nuclear@0 130 tmp6 = dataptr[1] - dataptr[6];
nuclear@0 131 tmp2 = dataptr[2] + dataptr[5];
nuclear@0 132 tmp5 = dataptr[2] - dataptr[5];
nuclear@0 133 tmp3 = dataptr[3] + dataptr[4];
nuclear@0 134 tmp4 = dataptr[3] - dataptr[4];
nuclear@0 135
nuclear@0 136 /* Even part */
nuclear@0 137
nuclear@0 138 tmp10 = tmp0 + tmp3; /* phase 2 */
nuclear@0 139 tmp13 = tmp0 - tmp3;
nuclear@0 140 tmp11 = tmp1 + tmp2;
nuclear@0 141 tmp12 = tmp1 - tmp2;
nuclear@0 142
nuclear@0 143 dataptr[0] = tmp10 + tmp11; /* phase 3 */
nuclear@0 144 dataptr[4] = tmp10 - tmp11;
nuclear@0 145
nuclear@0 146 z1 = MULTIPLY(tmp12 + tmp13, FIX_0_707106781); /* c4 */
nuclear@0 147 dataptr[2] = tmp13 + z1; /* phase 5 */
nuclear@0 148 dataptr[6] = tmp13 - z1;
nuclear@0 149
nuclear@0 150 /* Odd part */
nuclear@0 151
nuclear@0 152 tmp10 = tmp4 + tmp5; /* phase 2 */
nuclear@0 153 tmp11 = tmp5 + tmp6;
nuclear@0 154 tmp12 = tmp6 + tmp7;
nuclear@0 155
nuclear@0 156 /* The rotator is modified from fig 4-8 to avoid extra negations. */
nuclear@0 157 z5 = MULTIPLY(tmp10 - tmp12, FIX_0_382683433); /* c6 */
nuclear@0 158 z2 = MULTIPLY(tmp10, FIX_0_541196100) + z5; /* c2-c6 */
nuclear@0 159 z4 = MULTIPLY(tmp12, FIX_1_306562965) + z5; /* c2+c6 */
nuclear@0 160 z3 = MULTIPLY(tmp11, FIX_0_707106781); /* c4 */
nuclear@0 161
nuclear@0 162 z11 = tmp7 + z3; /* phase 5 */
nuclear@0 163 z13 = tmp7 - z3;
nuclear@0 164
nuclear@0 165 dataptr[5] = z13 + z2; /* phase 6 */
nuclear@0 166 dataptr[3] = z13 - z2;
nuclear@0 167 dataptr[1] = z11 + z4;
nuclear@0 168 dataptr[7] = z11 - z4;
nuclear@0 169
nuclear@0 170 dataptr += DCTSIZE; /* advance pointer to next row */
nuclear@0 171 }
nuclear@0 172
nuclear@0 173 /* Pass 2: process columns. */
nuclear@0 174
nuclear@0 175 dataptr = data;
nuclear@0 176 for (ctr = DCTSIZE-1; ctr >= 0; ctr--) {
nuclear@0 177 tmp0 = dataptr[DCTSIZE*0] + dataptr[DCTSIZE*7];
nuclear@0 178 tmp7 = dataptr[DCTSIZE*0] - dataptr[DCTSIZE*7];
nuclear@0 179 tmp1 = dataptr[DCTSIZE*1] + dataptr[DCTSIZE*6];
nuclear@0 180 tmp6 = dataptr[DCTSIZE*1] - dataptr[DCTSIZE*6];
nuclear@0 181 tmp2 = dataptr[DCTSIZE*2] + dataptr[DCTSIZE*5];
nuclear@0 182 tmp5 = dataptr[DCTSIZE*2] - dataptr[DCTSIZE*5];
nuclear@0 183 tmp3 = dataptr[DCTSIZE*3] + dataptr[DCTSIZE*4];
nuclear@0 184 tmp4 = dataptr[DCTSIZE*3] - dataptr[DCTSIZE*4];
nuclear@0 185
nuclear@0 186 /* Even part */
nuclear@0 187
nuclear@0 188 tmp10 = tmp0 + tmp3; /* phase 2 */
nuclear@0 189 tmp13 = tmp0 - tmp3;
nuclear@0 190 tmp11 = tmp1 + tmp2;
nuclear@0 191 tmp12 = tmp1 - tmp2;
nuclear@0 192
nuclear@0 193 dataptr[DCTSIZE*0] = tmp10 + tmp11; /* phase 3 */
nuclear@0 194 dataptr[DCTSIZE*4] = tmp10 - tmp11;
nuclear@0 195
nuclear@0 196 z1 = MULTIPLY(tmp12 + tmp13, FIX_0_707106781); /* c4 */
nuclear@0 197 dataptr[DCTSIZE*2] = tmp13 + z1; /* phase 5 */
nuclear@0 198 dataptr[DCTSIZE*6] = tmp13 - z1;
nuclear@0 199
nuclear@0 200 /* Odd part */
nuclear@0 201
nuclear@0 202 tmp10 = tmp4 + tmp5; /* phase 2 */
nuclear@0 203 tmp11 = tmp5 + tmp6;
nuclear@0 204 tmp12 = tmp6 + tmp7;
nuclear@0 205
nuclear@0 206 /* The rotator is modified from fig 4-8 to avoid extra negations. */
nuclear@0 207 z5 = MULTIPLY(tmp10 - tmp12, FIX_0_382683433); /* c6 */
nuclear@0 208 z2 = MULTIPLY(tmp10, FIX_0_541196100) + z5; /* c2-c6 */
nuclear@0 209 z4 = MULTIPLY(tmp12, FIX_1_306562965) + z5; /* c2+c6 */
nuclear@0 210 z3 = MULTIPLY(tmp11, FIX_0_707106781); /* c4 */
nuclear@0 211
nuclear@0 212 z11 = tmp7 + z3; /* phase 5 */
nuclear@0 213 z13 = tmp7 - z3;
nuclear@0 214
nuclear@0 215 dataptr[DCTSIZE*5] = z13 + z2; /* phase 6 */
nuclear@0 216 dataptr[DCTSIZE*3] = z13 - z2;
nuclear@0 217 dataptr[DCTSIZE*1] = z11 + z4;
nuclear@0 218 dataptr[DCTSIZE*7] = z11 - z4;
nuclear@0 219
nuclear@0 220 dataptr++; /* advance pointer to next column */
nuclear@0 221 }
nuclear@0 222 }
nuclear@0 223
nuclear@0 224 #endif /* DCT_IFAST_SUPPORTED */