/src/lib/libm/ld80/ |
s_logl.c | 115 #define F_lo(i) (T[(i)].F_lo) 117 #define ln2_lo F_lo(TSIZE - 1) 124 double F_lo; /* next 53 bits for log(1 / G_i) */ 131 * and ln2_lo, to ensure that F_hi(i) and F_lo(i) cancel exactly 530 * Our algorithm depends on exact cancellation of F_lo(i) and 539 (F_lo(i) + dk * ln2_lo + z * d * (d * P4 + P3)) + z * P2; 553 long double d, d_hi, d_lo, dk, f_lo, val_hi, val_lo, z; local in function:log1pl 573 f_lo = x; 581 f_lo = 1 [all...] |
s_logl.c | 115 #define F_lo(i) (T[(i)].F_lo) 117 #define ln2_lo F_lo(TSIZE - 1) 124 double F_lo; /* next 53 bits for log(1 / G_i) */ 131 * and ln2_lo, to ensure that F_hi(i) and F_lo(i) cancel exactly 530 * Our algorithm depends on exact cancellation of F_lo(i) and 539 (F_lo(i) + dk * ln2_lo + z * d * (d * P4 + P3)) + z * P2; 553 long double d, d_hi, d_lo, dk, f_lo, val_hi, val_lo, z; local in function:log1pl 573 f_lo = x; 581 f_lo = 1 [all...] |
s_logl.c | 115 #define F_lo(i) (T[(i)].F_lo) 117 #define ln2_lo F_lo(TSIZE - 1) 124 double F_lo; /* next 53 bits for log(1 / G_i) */ 131 * and ln2_lo, to ensure that F_hi(i) and F_lo(i) cancel exactly 530 * Our algorithm depends on exact cancellation of F_lo(i) and 539 (F_lo(i) + dk * ln2_lo + z * d * (d * P4 + P3)) + z * P2; 553 long double d, d_hi, d_lo, dk, f_lo, val_hi, val_lo, z; local in function:log1pl 573 f_lo = x; 581 f_lo = 1 [all...] |
/src/lib/libm/ld128/ |
s_logl.c | 119 #define F_lo(i) (T[(i)].F_lo) 121 #define ln2_lo F_lo(TSIZE - 1) 129 long double F_lo; /* next 113 bits for log(1 / G_i) */ 136 * and ln2_lo, to ensure that F_hi(i) and F_lo(i) cancel exactly 526 * Our algorithm depends on exact cancellation of F_lo(i) and 551 dd * P14))))))))))) + (F_lo(i) + dk * ln2_lo) + d * d * P2; 565 long double d, d_hi, f_lo, val_hi, val_lo; local in function:log1pl 586 f_lo = x; 591 f_lo = 1 [all...] |
s_logl.c | 119 #define F_lo(i) (T[(i)].F_lo) 121 #define ln2_lo F_lo(TSIZE - 1) 129 long double F_lo; /* next 113 bits for log(1 / G_i) */ 136 * and ln2_lo, to ensure that F_hi(i) and F_lo(i) cancel exactly 526 * Our algorithm depends on exact cancellation of F_lo(i) and 551 dd * P14))))))))))) + (F_lo(i) + dk * ln2_lo) + d * d * P2; 565 long double d, d_hi, f_lo, val_hi, val_lo; local in function:log1pl 586 f_lo = x; 591 f_lo = 1 [all...] |
s_logl.c | 119 #define F_lo(i) (T[(i)].F_lo) 121 #define ln2_lo F_lo(TSIZE - 1) 129 long double F_lo; /* next 113 bits for log(1 / G_i) */ 136 * and ln2_lo, to ensure that F_hi(i) and F_lo(i) cancel exactly 526 * Our algorithm depends on exact cancellation of F_lo(i) and 551 dd * P14))))))))))) + (F_lo(i) + dk * ln2_lo) + d * d * P2; 565 long double d, d_hi, f_lo, val_hi, val_lo; local in function:log1pl 586 f_lo = x; 591 f_lo = 1 [all...] |