HomeSort by: relevance | last modified time | path
    Searched defs:TBLSIZE (Results 1 - 6 of 6) sorted by relevancy

  /src/lib/libm/noieee_src/
n_exp2.c 40 #define TBLSIZE (1 << TBLBITS)
44 redux = 0x1.8p52 / TBLSIZE,
53 static const double tbl[TBLSIZE * 2] = {
325 * y = i/TBLSIZE + z - eps[i] for integer i near y * TBLSIZE.
326 * Thus we have exp2(y) = exp2(i/TBLSIZE) * exp2(z - eps[i]),
329 * We compute exp2(i/TBLSIZE) via table lookup and exp2(z - eps[i]) via
332 * exp2t[i] = exp2(i/TBLSIZE + eps[i]), and eps[i] is a small offset such
335 * Note that the range of i is +-TBLSIZE/2, so we actually index the tables
336 * by i0 = i + TBLSIZE/2. For cache efficiency, exp2t[] and eps[] ar
    [all...]
n_exp2f.c 40 #define TBLSIZE (1 << TBLBITS)
44 redux = 0x1.8p23f / TBLSIZE,
52 static const double exp2ft[TBLSIZE] = {
83 * y = i/TBLSIZE + z for integer i near y * TBLSIZE.
84 * Thus we have exp2(y) = exp2(i/TBLSIZE) * exp2(z),
85 * with |z| <= 2**-(TBLSIZE+1).
87 * We compute exp2(i/TBLSIZE) via table lookup and exp2(z) via a
120 i0 += TBLSIZE / 2;
122 i0 &= TBLSIZE - 1
    [all...]
  /src/lib/libm/src/
s_exp2.c 39 #define TBLSIZE (1 << TBLBITS)
42 redux = 0x1.8p52 / TBLSIZE,
61 } tbl[TBLSIZE] = {
333 * y = i/TBLSIZE + z - eps[i] for integer i near y * TBLSIZE.
334 * Thus we have exp2(y) = exp2(i/TBLSIZE) * exp2(z - eps[i]),
337 * We compute exp2(i/TBLSIZE) via table lookup and exp2(z - eps[i]) via
340 * exp2t[i] = exp2(i/TBLSIZE + eps[i]), and eps[i] is a small offset such
343 * Note that the range of i is +-TBLSIZE/2, so we actually index the tables
344 * by i0 = i + TBLSIZE/2
    [all...]
s_exp2f.c 39 #define TBLSIZE (1 << TBLBITS)
42 redux = 0x1.8p23f / TBLSIZE,
72 static const double exp2ft[TBLSIZE] = {
103 * y = i/TBLSIZE + z for integer i near y * TBLSIZE.
104 * Thus we have exp2(y) = exp2(i/TBLSIZE) * exp2(z),
105 * with |z| <= 2**-(TBLSIZE+1).
107 * We compute exp2(i/TBLSIZE) via table lookup and exp2(z) via a
146 i0 += TBLSIZE / 2;
148 i0 &= TBLSIZE - 1
    [all...]
  /src/lib/libm/ld80/
s_exp2l.c 40 #define TBLSIZE (1 << TBLBITS)
52 redux = 0x1.8p63 / TBLSIZE,
63 static const double tbl[TBLSIZE * 2] = {
206 * y = i/TBLSIZE + z for integer i near y * TBLSIZE.
207 * Thus we have exp2(y) = exp2(i/TBLSIZE) * exp2(z),
210 * We compute exp2(i/TBLSIZE) via table lookup and exp2(z) via a
258 i0 = u.extu_fracl + TBLSIZE / 2;
260 i0 = (i0 & (TBLSIZE - 1)) << 1;
  /src/lib/libm/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 16 milliseconds