Searched refs:TBLSIZE (Results 1 – 4 of 4) sorted by relevance
36 #define TBLSIZE (1 << TBLBITS) macro58 redux = 0x1.8p112 / TBLSIZE;60 static const long double tbl[TBLSIZE] = {191 static const float eps[TBLSIZE] = {397 i0 = (u.bits.manl & 0xffffffff) + TBLSIZE / 2; in exp2l()399 i0 = i0 & (TBLSIZE - 1); in exp2l()
35 #define TBLSIZE (1 << TBLBITS) macro 38 redux = 0x1.8p23f / TBLSIZE,48 static const double exp2ft[TBLSIZE] = {79 * y = i/TBLSIZE + z for integer i near y * TBLSIZE.80 * Thus we have exp2(y) = exp2(i/TBLSIZE) * exp2(z),81 * with |z| <= 2**-(TBLSIZE+1).83 * We compute exp2(i/TBLSIZE) via table lookup and exp2(z) via a122 i0 += TBLSIZE / 2; in exp2f() 124 i0 &= TBLSIZE in exp2f() [all...]
35 #define TBLSIZE (1 << TBLBITS) macro 38 redux = 0x1.8p52 / TBLSIZE,49 static const double tbl[TBLSIZE * 2] = {321 * y = i/TBLSIZE + z - eps[i] for integer i near y * TBLSIZE.322 * Thus we have exp2(y) = exp2(i/TBLSIZE) * exp2(z - eps[i]),325 * We compute exp2(i/TBLSIZE) via table lookup and exp2(z - eps[i]) via328 * exp2t[i] = exp2(i/TBLSIZE + eps[i]), and eps[i] is a small offset such331 * Note that the range of i is +-TBLSIZE/2, so we actually index the tables332 * by i0 = i + TBLSIZE/[all...]
41 #define TBLSIZE (1 << TBLBITS) macro53 redux = 0x1.8p63 / TBLSIZE,64 static const double tbl[TBLSIZE * 2] = {259 i0 = u.bits.manl + TBLSIZE / 2; in exp2l()261 i0 = (i0 & (TBLSIZE - 1)) << 1; in exp2l()