| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| D | s_frexpl.c | 44 switch (u.bits.exp) { in frexpl()
50 *ex = u.bits.exp - 0x4200; in frexpl()
51 u.bits.exp = 0x3ffe; in frexpl()
57 *ex = u.bits.exp - 0x3ffe; in frexpl()
58 u.bits.exp = 0x3ffe; in frexpl()
|
| D | e_sqrtl.c | 45 u.bits.exp++; in inc()
61 u.bits.exp--; in dec()
88 if (u.bits.exp == LDBL_MAX_EXP * 2 - 1) in sqrtl()
92 if ((u.bits.manh | u.bits.manl | u.bits.exp) == 0) in sqrtl()
101 if (u.bits.exp == 0) { in sqrtl()
112 if ((u.bits.exp - 0x3ffe) & 1) { /* n is odd. */ in sqrtl()
113 k += u.bits.exp - 0x3fff; /* 2k = n - 1. */ in sqrtl()
114 u.bits.exp = 0x3fff; /* u.e in [1,2). */ in sqrtl()
116 k += u.bits.exp - 0x4000; /* 2k = n - 2. */ in sqrtl()
117 u.bits.exp = 0x4000; /* u.e in [2,4). */ in sqrtl()
[all …]
|
| D | e_fmodl.c | 78 if((uy.bits.exp|uy.bits.manh|uy.bits.manl)==0 || /* y=0 */ in fmodl()
79 (ux.bits.exp == BIAS + LDBL_MAX_EXP) || /* or x not finite */ in fmodl()
80 (uy.bits.exp == BIAS + LDBL_MAX_EXP && in fmodl()
83 if(ux.bits.exp<=uy.bits.exp) { in fmodl()
84 if((ux.bits.exp<uy.bits.exp) || in fmodl()
96 if(ux.bits.exp == 0) { /* subnormal x */ in fmodl()
98 ix = ux.bits.exp - (BIAS + 512); in fmodl()
100 ix = ux.bits.exp - BIAS; in fmodl()
104 if(uy.bits.exp == 0) { /* subnormal y */ in fmodl()
106 iy = uy.bits.exp - (BIAS + 512); in fmodl()
[all …]
|
| D | s_remquol.c | 85 if((uy.bits.exp|uy.bits.manh|uy.bits.manl)==0 || /* y=0 */ in remquol()
86 (ux.bits.exp == BIAS + LDBL_MAX_EXP) || /* or x not finite */ in remquol()
87 (uy.bits.exp == BIAS + LDBL_MAX_EXP && in remquol()
90 if(ux.bits.exp<=uy.bits.exp) { in remquol()
91 if((ux.bits.exp<uy.bits.exp) || in remquol()
105 if(ux.bits.exp == 0) { /* subnormal x */ in remquol()
107 ix = ux.bits.exp - (BIAS + 512); in remquol()
109 ix = ux.bits.exp - BIAS; in remquol()
113 if(uy.bits.exp == 0) { /* subnormal y */ in remquol()
115 iy = uy.bits.exp - (BIAS + 512); in remquol()
[all …]
|
| D | s_scalbnl.c | 50 k = u.bits.exp; /* extract exponent */ in scalbnl()
54 k = u.bits.exp - 128; in scalbnl()
61 {u.bits.exp = k; return u.e;} in scalbnl()
67 u.bits.exp = k; in scalbnl()
|
| D | s_nextafterl.c | 42 if ((ux.bits.exp == 0x7fff && in nextafterl()
44 (uy.bits.exp == 0x7fff && in nextafterl()
58 ux.bits.exp -= 1; in nextafterl()
67 ux.bits.exp += 1; in nextafterl()
70 if(ux.bits.exp==0x7fff) return x+x; /* overflow */ in nextafterl()
71 if(ux.bits.exp==0) { /* underflow */ in nextafterl()
|
| D | s_ilogbl.c | 30 if (u.bits.exp == 0) { in ilogbl()
47 } else if (u.bits.exp < (LDBL_MAX_EXP << 1) - 1) in ilogbl()
48 return (u.bits.exp - LDBL_MAX_EXP + 1); in ilogbl()
|
| D | s_logbl.c | 31 if (u.bits.exp == 0) { in logbl()
51 if (u.bits.exp < (LDBL_MAX_EXP << 1) - 1) /* normal */ in logbl()
52 return ((long double)(u.bits.exp - LDBL_MAX_EXP + 1)); in logbl()
|
| D | s_floorl.c | 38 u.bits.exp++; \
46 u.bits.exp++; \
58 int e = u.bits.exp - LDBL_MAX_EXP + 1; in floorl()
63 if (u.bits.exp > 0 || in floorl()
73 u.bits.exp++; in floorl()
|
| D | s_ceill.c | 38 u.bits.exp++; \
46 u.bits.exp++; \
58 int e = u.bits.exp - LDBL_MAX_EXP + 1; in ceill()
63 if (u.bits.exp > 0 || in ceill()
73 u.bits.exp++; in ceill()
|
| D | s_fminf.c | 43 if (u[0].bits.exp == 255 && u[0].bits.man != 0) in fminf()
45 if (u[1].bits.exp == 255 && u[1].bits.man != 0) in fminf()
|
| D | s_fmaxf.c | 43 if (u[0].bits.exp == 255 && u[0].bits.man != 0) in fmaxf()
45 if (u[1].bits.exp == 255 && u[1].bits.man != 0) in fmaxf()
|
| D | s_fmax.c | 43 if (u[0].bits.exp == 2047 && (u[0].bits.manh | u[0].bits.manl) != 0) in fmax()
45 if (u[1].bits.exp == 2047 && (u[1].bits.manh | u[1].bits.manl) != 0) in fmax()
|
| D | s_fmin.c | 43 if (u[0].bits.exp == 2047 && (u[0].bits.manh | u[0].bits.manl) != 0) in fmin()
45 if (u[1].bits.exp == 2047 && (u[1].bits.manh | u[1].bits.manl) != 0) in fmin()
|
| D | s_fmaxl.c | 45 if (u[0].bits.exp == 32767 && (u[0].bits.manh | u[0].bits.manl) != 0) in fmaxl()
47 if (u[1].bits.exp == 32767 && (u[1].bits.manh | u[1].bits.manl) != 0) in fmaxl()
|
| D | s_fminl.c | 45 if (u[0].bits.exp == 32767 && (u[0].bits.manh | u[0].bits.manl) != 0) in fminl()
47 if (u[1].bits.exp == 32767 && (u[1].bits.manh | u[1].bits.manl) != 0) in fminl()
|
| D | s_tanl.c | 64 if (z.bits.exp == 0) in tanl()
68 if (z.bits.exp == 32767) in tanl()
|
| D | s_cosl.c | 62 if (z.bits.exp == 0) in cosl()
66 if (z.bits.exp == 32767) in cosl()
|
| D | s_cexp.c | 53 return (cpack(exp(x), y)); in cexp()
86 exp_x = exp(x); in cexp()
|
| D | s_sinl.c | 58 if (z.bits.exp == 0) in sinl()
62 if (z.bits.exp == 32767) in sinl()
|
| /bionic/libc/upstream-openbsd/lib/libc/gdtoa/ |
| D | strtord.c | 36 ULtod(L, bits, exp, k) ULong *L; ULong *bits; Long exp; int k; in ULtod() argument
38 ULtod(ULong *L, ULong *bits, Long exp, int k)
55 L[_0] = (bits[1] & ~0x100000) | ((exp + 0x3ff + 52) << 20);
84 Long exp; local
93 k = strtodg(s, sp, fpi, &exp, bits);
94 ULtod((ULong*)d, bits, exp, k);
|
| D | strtorQ.c | 54 ULtoQ(L, bits, exp, k) ULong *L; ULong *bits; Long exp; int k; in ULtoQ() argument
56 ULtoQ(ULong *L, ULong *bits, Long exp, int k)
70 L[_0] = (bits[3] & ~0x10000) | ((exp + 0x3fff + 112) << 16);
108 Long exp; local
117 k = strtodg(s, sp, fpi, &exp, bits);
118 ULtoQ((ULong*)L, bits, exp, k);
|
| D | strtof.c | 43 Long exp; local
52 k = strtodg(s, sp, fpi, &exp, bits);
61 u.L[0] = (bits[0] & 0x7fffff) | ((exp + 0x7f + 23) << 23);
|
| /bionic/libm/ |
| D | fpmath.h | 45 unsigned int exp :8; member
58 unsigned int exp :11; member
70 unsigned int exp :15; member
|
| /bionic/libc/include/sys/ |
| D | cdefs.h | 313 #define __predict_true(exp) __builtin_expect((exp) != 0, 1) argument
314 #define __predict_false(exp) __builtin_expect((exp) != 0, 0) argument
316 #define __predict_true(exp) (exp) argument
317 #define __predict_false(exp) (exp) argument
|