| /src/lib/libc/gdtoa/ |
| strtopd.c | 45 Long expt; local
53 k = strtodg(s, sp, fpi, &expt, bits);
56 ULtod((ULong*)d, bits, expt, k);
|
| strtopf.c | 45 Long expt; local
53 k = strtodg(s, sp, fpi, &expt, bits);
65 L[0] = (bits[0] & 0x7fffff) | ((expt + 0x7f + 23) << 23);
|
| strtodnrp.c | 51 Long expt; local
55 k = strtodg(s, sp, &fpi, &expt, bits);
70 u.L[_0] = (bits[1] & ~0x100000) | ((expt + 0x3ff + 52) << 20);
|
| strtof_vaxf.c | 51 Long expt; local
55 k = strtodg(s, sp, &fpi, &expt, bits, loc);
70 ((expt + 128 + 1 + 23) << 7); /* Exp */
|
| strtopxL.c | 57 Long expt; local
66 k = strtodg(s, sp, fpi, &expt, bits, loc);
80 L[_0] = (expt + 0x3fff + 63) << 16;
|
| strtord.c | 38 ULtod(L, bits, expt, k) ULong *L; ULong *bits; Long expt; int k;
40 ULtod(ULong *L, ULong *bits, Long expt, int k)
57 L[_0] = (bits[1] & ~0x100000) | ((expt + 0x3ff + 52) << 20);
82 Long expt; local
91 k = strtodg(s, sp, fpi, &expt, bits, loc);
94 ULtod((/* LINTED */(U*)d)->L, bits, expt, k);
|
| strtordd.c | 38 ULtodd(L, bits, expt, k) ULong *L; ULong *bits; Long expt; int k;
40 ULtodd(ULong *L, ULong *bits, Long expt, int k)
54 | ((expt + 0x3ff + 105) << 20);
55 expt += 0x3ff + 52;
58 if (i >= expt) {
59 i = expt - 1;
60 expt = 0;
63 expt -= i;
71 if (i >= expt) {
190 Long expt; local
[all...] |
| strtorf.c | 38 ULtof(L, bits, expt, k) ULong *L; ULong *bits; Long expt; int k;
40 ULtof(ULong *L, ULong *bits, Long expt, int k)
51 L[0] = (bits[0] & 0x7fffff) | ((expt + 0x7f + 23) << 23);
80 Long expt; local
89 k = strtodg(s, sp, fpi, &expt, bits);
92 ULtof((ULong*)f, bits, expt, k);
|
| strtof.c | 50 Long expt; local
59 k = strtodg(s, sp, fpi, &expt, bits, loc);
72 u.L[0] = (bits[0] & 0x7fffff) | ((expt + 0x7f + 23) << 23);
|
| strtopQ.c | 59 Long expt; local
68 k = strtodg(s, sp, fpi, &expt, bits, loc);
82 L[_0] = (bits[3] & ~0x10000) | ((expt + 0x3fff + 112) << 16);
|
| strtopdd.c | 49 Long expt; local
62 rv = strtodg(s, sp, fpi, &expt, bits);
75 | ((expt + 0x3ff + 105) << 20);
76 expt += 0x3ff + 52;
79 if (i >= expt) {
80 i = expt - 1;
81 expt = 0;
84 expt -= i;
92 if (i >= expt) {
93 i = expt - 1
[all...] |
| strtopx.c | 61 Long expt; local
70 k = strtodg(s, sp, fpi, &expt, bits, loc);
85 L[_0] = expt + 0x3fff + 63;
|
| strtorQ.c | 56 ULtoQ(L, bits, expt, k) ULong *L; ULong *bits; Long expt; int k;
58 ULtoQ(ULong *L, ULong *bits, Long expt, int k)
72 L[_0] = (bits[3] & ~0x10000) | ((expt + 0x3fff + 112) << 16);
108 Long expt; local
117 k = strtodg(s, sp, fpi, &expt, bits);
120 ULtoQ((ULong*)L, bits, expt, k);
|
| strtorx.c | 58 ULtox(L, bits, expt, k) UShort *L; ULong *bits; Long expt; int k;
60 ULtox(UShort *L, ULong *bits, Long expt, int k)
75 L[_0] = expt + 0x3fff + 63;
111 Long expt; local
120 k = strtodg(s, sp, fpi, &expt, bits);
123 ULtox((UShort*)L, bits, expt, k);
|
| strtorxL.c | 54 ULtoxL(L, bits, expt, k) ULong *L; ULong *bits; Long expt; int k;
56 ULtoxL(ULong *L, ULong *bits, Long expt, int k)
68 L[_0] = (expt + 0x3fff + 63) << 16;
99 Long expt; local
108 k = strtodg(s, sp, fpi, &expt, bits);
111 ULtoxL((ULong*)L, bits, expt, k);
|
| /src/lib/libm/src/ |
| e_asinl.c | 56 int16_t expsign, expt; local
59 expt = expsign & 0x7fff;
60 if(expt >= BIAS) { /* |x|>= 1 */
61 if(expt==BIAS && ((u.extu_frach&~LDBL_NBIT)|u.extu_fracl)==0)
65 } else if (expt<BIAS-1) { /* |x|<0.5 */
66 if(expt<ASIN_LINEAR) { /* if |x| is small, asinl(x)=x */
|
| s_atanl.c | 57 int16_t expsign, expt; local
62 expt = expsign & 0x7fff;
63 if(expt >= ATAN_CONST) { /* if |x| is large, atan(x)~=pi/2 */
64 if(expt == BIAS + LDBL_MAX_EXP &&
72 expman = (expt << 8) | ((u.extu_frach >> (MANH_SIZE - 9)) & 0xff);
74 if (expt < ATAN_LINEAR) { /* if |x| is small, atanl(x)~=x */
|
| e_acosl.c | 66 int16_t expsign, expt; local
69 expt = expsign & 0x7fff;
70 if(expt >= BIAS) { /* |x| >= 1 */
71 if(expt==BIAS && ((u.extu_frach&~LDBL_NBIT)|u.extu_fracl)==0) {
77 if(expt<BIAS-1) { /* |x| < 0.5 */
78 if(expt<ACOS_CONST) return pio2_hi+pio2_lo;/*x tiny: acosl=pi/2*/
|
| /src/external/lgpl3/mpfr/dist/src/ |
| atan2u.c | 290 mpfr_exp_t expt, e; local
313 expt = MPFR_GET_EXP(tmp);
314 /* |tmp - |y/x|| <= e1 := 1/2*ulp(tmp) = 2^(expt-prec-1) */
319 e = (expt < 1) ? 0 : expt - 1;
321 e = expt - 2 * e + MPFR_INT_CEIL_LOG2(u) - 2;
330 expt = MPFR_GET_EXP(tmp);
331 /* error <= 2^(expt-prec-1) + 2^(e+1-prec) */
332 e = (expt - 1 > e + 1) ? expt - 1 : e + 1
[all...] |
| sinu.c | 39 mpfr_exp_t expx, expt, err; local
140 expt = MPFR_GET_EXP (t);
141 /* we have |s| <= 2^(expt + 2 - prec) */
145 err = expt + 2 - prec;
146 expt = MPFR_GET_EXP (t); /* new exponent of t */
147 /* the total error is bounded by 2^err + ulp(t) = 2^err + 2^(expt-prec)
148 thus if err <= expt-prec, it is bounded by 2^(expt-prec+1),
150 err = (err <= expt - prec) ? expt - prec + 1 : err + 1
[all...] |
| tanu.c | 33 mpfr_exp_t expx, expt, err; local
144 expt = MPFR_GET_EXP (t);
154 expt += MPFR_GET_EXP (z);
155 /* now |t - tan(2*pi*x/u)| <= ulp(t) + 2^(expt + 3 - prec) */
160 err = expt + 3 - prec;
161 expt = MPFR_GET_EXP (t); /* new exponent of t */
162 /* the total error is bounded by 2^err + ulp(t) = 2^err + 2^(expt-prec)
163 thus if err <= expt-prec, it is bounded by 2^(expt-prec+1),
165 err = (err <= expt - prec) ? expt - prec + 1 : err + 1
[all...] |
| cosu.c | 33 mpfr_exp_t expx, expt, err, log2u, erra, errb; local
161 expt = MPFR_GET_EXP (t);
162 /* we have |s| <= 2^(expt + 2 - prec) */
164 err = expt + 2 - prec;
165 expt = MPFR_GET_EXP (t); /* new exponent of t */
166 /* the total error is at most 2^err + ulp(t)/2 = 2^err + 2^(expt-prec-1)
167 thus if err <= expt-prec-1, it is bounded by 2^(expt-prec),
169 err = (err <= expt - prec - 1) ? expt - prec : err + 1
[all...] |
| digamma.c | 212 mpfr_exp_t errt, erru, expt; local
300 expt = MPFR_GET_EXP (t);
306 if (MPFR_GET_EXP (t) < expt)
307 errt += expt - MPFR_EXP(t);
|
| root.c | 226 /* Take some guard bits to prepare for the 'expt' lost bits below.
235 mpfr_exp_t expt; local
242 expt = MPFR_GET_EXP (t); /* assumes t <> 0 */
245 by 1.5 * 2^(expt - w) */
248 |tau| <= 1.5 * 2^(expt - w) and |theta1| <= 2^(-w).
250 for w >= expt + 2 we have:
251 t = |x|^(1/k) * (1 + 2^(expt+2)*theta2) * (1 + theta1) with
253 If expt+2 > 0, as long as w >= 1, we have:
254 t = |x|^(1/k) * (1 + 2^(expt+3)*theta3) with |theta3| < 2^(-w).
255 For expt+2 = 0, we have
[all...] |
| exp_2.c | 279 mpfr_exp_t dif, expt, expr; local
285 expt = 0;
299 expt += expr;
302 dif = *exps + sbit - expt - tbit;
304 expt += mpz_normalize (t, t, (mpfr_exp_t) q - dif);
319 MPFR_ASSERTD (expt == *exps);
350 mpfr_exp_t expr, *expR, expt; local
406 expt = mpz_normalize2 (t, R[m-1], expR[m-1], 1 - ql);
419 expt += expr;
420 expt = mpz_normalize2 (t, t, expt, *exps)
[all...] |
