Lines Matching full:tblsize
34 #define TBLSIZE (1 << TBLBITS)
39 redux = 0x1.8p52 / TBLSIZE,
46 static const double tbl[TBLSIZE * 2] = {
318 * y = i/TBLSIZE + z - eps[i] for integer i near y * TBLSIZE.
319 * Thus we have exp2(y) = exp2(i/TBLSIZE) * exp2(z - eps[i]),
322 * We compute exp2(i/TBLSIZE) via table lookup and exp2(z - eps[i]) via
325 * exp2t[i] = exp2(i/TBLSIZE + eps[i]), and eps[i] is a small offset such
328 * Note that the range of i is +-TBLSIZE/2, so we actually index the tables
329 * by i0 = i + TBLSIZE/2. For cache efficiency, exp2t[] and eps[] are
366 i0 += TBLSIZE / 2;
368 i0 = (i0 & (TBLSIZE - 1)) << 1;
