Lines Matching refs:PASS1_BITS
107 * The outputs of the first pass are scaled up by PASS1_BITS bits so that
109 * require BITS_IN_JSAMPLE + PASS1_BITS + 3 bits; this fits in a 16-bit word
114 * have BITS_IN_JSAMPLE + CONST_BITS + PASS1_BITS <= 26. Error analysis
119 #undef PASS1_BITS
124 #define PASS1_BITS 4 /* set this to 2 if 16x16 multiplies are faster */
125 #define OUT_SHIFT PASS1_BITS
128 #define PASS1_BITS 1 /* lose a little precision to avoid overflow */
129 #define OUT_SHIFT (PASS1_BITS + 1)
175 #if BITS_IN_JSAMPLE == 8 && CONST_BITS<=13 && PASS1_BITS<=2
192 /* furthermore, we scale the results by 2**PASS1_BITS. */
214 dataptr[0] = (int16_t) ((tmp10 + tmp11) * (1 << PASS1_BITS));
215 dataptr[4] = (int16_t) ((tmp10 - tmp11) * (1 << PASS1_BITS));
219 CONST_BITS-PASS1_BITS);
221 CONST_BITS-PASS1_BITS);
246 dataptr[7] = (int16_t) DESCALE(tmp4 + z1 + z3, CONST_BITS-PASS1_BITS);
247 dataptr[5] = (int16_t) DESCALE(tmp5 + z2 + z4, CONST_BITS-PASS1_BITS);
248 dataptr[3] = (int16_t) DESCALE(tmp6 + z2 + z3, CONST_BITS-PASS1_BITS);
249 dataptr[1] = (int16_t) DESCALE(tmp7 + z1 + z4, CONST_BITS-PASS1_BITS);
271 * We remove the PASS1_BITS scaling, but leave the results scaled up
353 * We remove the PASS1_BITS scaling, but leave the results scaled up