Lines Matching full:divisor
126 * b = (the number of significant bits in divisor) - 1
128 * f = 2^r / divisor
149 * "input + divisor/2".
155 * dctbl[1] = divisor / 2 (+ 1 if fractional part of f < 0.5)
172 compute_reciprocal (UINT16 divisor, DCTELEM * dtbl)
178 if (divisor == 1) {
179 /* divisor == 1 means unquantized, so these reciprocal/correction/shift
191 b = flss(divisor) - 1;
194 fq = ((UDCTELEM2)1 << r) / divisor;
195 fr = ((UDCTELEM2)1 << r) % divisor;
197 c = divisor / 2; /* for rounding */
199 if (fr == 0) { /* divisor is power of two */
203 } else if (fr <= (divisor / 2U)) { /* fractional part is < 0.5 */
224 * the divisor table for each one.
327 * What's actually stored is 1/divisor so that the inner loop can
709 /* Mark divisor tables unallocated */
