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 38 #define TBLSIZE (1 << TBLBITS)
41 redux = 0x1.8p23f / TBLSIZE,
51 static const double exp2ft[TBLSIZE] = {
82 * y = i/TBLSIZE + z for integer i near y * TBLSIZE.
83 * Thus we have exp2(y) = exp2(i/TBLSIZE) * exp2(z),
84 * with |z| <= 2**-(TBLSIZE+1).
86 * We compute exp2(i/TBLSIZE) via table lookup and exp2(z) via a
125 i0 += TBLSIZE / 2;
127 i0 &= TBLSIZE - 1
    [all...]
s_exp2.c 38 #define TBLSIZE (1 << TBLBITS)
41 redux = 0x1.8p52 / TBLSIZE,
52 static const double tbl[TBLSIZE * 2] = {
324 * y = i/TBLSIZE + z - eps[i] for integer i near y * TBLSIZE.
325 * Thus we have exp2(y) = exp2(i/TBLSIZE) * exp2(z - eps[i]),
328 * We compute exp2(i/TBLSIZE) via table lookup and exp2(z - eps[i]) via
331 * exp2t[i] = exp2(i/TBLSIZE + eps[i]), and eps[i] is a small offset such
334 * Note that the range of i is +-TBLSIZE/2, so we actually index the tables
335 * by i0 = i + TBLSIZE/2. For cache efficiency, exp2t[] and eps[] ar
    [all...]
  /bionic/libm/upstream-freebsd/lib/msun/ld128/
s_exp2l.c 39 #define TBLSIZE (1 << TBLBITS)
61 redux = 0x1.8p112 / TBLSIZE;
63 static const long double tbl[TBLSIZE] = {
194 static const float eps[TBLSIZE] = {
337 * y = i/TBLSIZE + z - eps[i] for integer i near y * TBLSIZE.
338 * Thus we have exp2(y) = exp2(i/TBLSIZE) * exp2(z - eps[i]),
341 * We compute exp2(i/TBLSIZE) via table lookup and exp2(z - eps[i]) via
344 * exp2t[i] = exp2(i/TBLSIZE + eps[i]), and eps[i] is a small offset such
347 * Note that the range of i is +-TBLSIZE/2, so we actually index the table
    [all...]

Completed in 1608 milliseconds