HomeSort by relevance Sort by last modified time
    Searched refs:TBLSIZE (Results 1 - 3 of 3) sorted by null

  /bionic/libm/upstream-freebsd/lib/msun/src/
s_exp2f.c 36 #define TBLSIZE (1 << TBLBITS)
39 redux = 0x1.8p23f / TBLSIZE,
49 static const double exp2ft[TBLSIZE] = {
80 * y = i/TBLSIZE + z for integer i near y * TBLSIZE.
81 * Thus we have exp2(y) = exp2(i/TBLSIZE) * exp2(z),
82 * with |z| <= 2**-(TBLSIZE+1).
84 * We compute exp2(i/TBLSIZE) via table lookup and exp2(z) via a
123 i0 += TBLSIZE / 2;
125 i0 &= TBLSIZE - 1
    [all...]
s_exp2.c 36 #define TBLSIZE (1 << TBLBITS)
39 redux = 0x1.8p52 / TBLSIZE,
50 static const double tbl[TBLSIZE * 2] = {
322 * y = i/TBLSIZE + z - eps[i] for integer i near y * TBLSIZE.
323 * Thus we have exp2(y) = exp2(i/TBLSIZE) * exp2(z - eps[i]),
326 * We compute exp2(i/TBLSIZE) via table lookup and exp2(z - eps[i]) via
329 * exp2t[i] = exp2(i/TBLSIZE + eps[i]), and eps[i] is a small offset such
332 * Note that the range of i is +-TBLSIZE/2, so we actually index the tables
333 * by i0 = i + TBLSIZE/2. For cache efficiency, exp2t[] and eps[] ar
    [all...]
  /bionic/libm/upstream-freebsd/lib/msun/ld128/
s_exp2l.c 37 #define TBLSIZE (1 << TBLBITS)
59 redux = 0x1.8p112 / TBLSIZE;
61 static const long double tbl[TBLSIZE] = {
192 static const float eps[TBLSIZE] = {
335 * y = i/TBLSIZE + z - eps[i] for integer i near y * TBLSIZE.
336 * Thus we have exp2(y) = exp2(i/TBLSIZE) * exp2(z - eps[i]),
339 * We compute exp2(i/TBLSIZE) via table lookup and exp2(z - eps[i]) via
342 * exp2t[i] = exp2(i/TBLSIZE + eps[i]), and eps[i] is a small offset such
345 * Note that the range of i is +-TBLSIZE/2, so we actually index the table
    [all...]

Completed in 88 milliseconds