/bionic/libm/upstream-freebsd/lib/msun/src/ |
H A D | s_cosl.c | 56 long double hi, lo; local 76 hi = y[0]; 81 hi = __kernel_cosl(hi, lo); 84 hi = - __kernel_sinl(hi, lo, 1); 87 hi = - __kernel_cosl(hi, lo); 90 hi = __kernel_sinl(hi, l [all...] |
H A D | s_sinl.c | 51 long double hi, lo; local 69 hi = __kernel_sinl(z.e, 0, 0); 70 RETURNI(s ? -hi : hi); 74 hi = y[0]; 79 hi = __kernel_sinl(hi, lo, 1); 82 hi = __kernel_cosl(hi, lo); 85 hi [all...] |
H A D | s_tanl.c | 57 long double hi, lo; local 75 hi = __kernel_tanl(z.e, 0, 0); 76 RETURNI(s ? -hi : hi); 80 hi = y[0]; 86 hi = __kernel_tanl(hi, lo, 0); 90 hi = __kernel_tanl(hi, lo, 1); 94 RETURNI(hi); [all...] |
H A D | e_log2f.c | 34 float f,hfsq,hi,lo,r,y; local 77 hi = f - hfsq; 78 GET_FLOAT_WORD(hx,hi); 79 SET_FLOAT_WORD(hi,hx&0xfffff000); 80 lo = (f - hi) - hfsq + r; 81 return (lo+hi)*ivln2lo + lo*ivln2hi + hi*ivln2hi + y;
|
H A D | e_log10f.c | 36 float f,hfsq,hi,lo,r,y; local 66 hi = f - hfsq; 67 GET_FLOAT_WORD(hx,hi); 68 SET_FLOAT_WORD(hi,hx&0xfffff000); 69 lo = (f - hi) - hfsq + r; 70 return y*log10_2lo + (lo+hi)*ivln10lo + lo*ivln10hi + hi*ivln10hi +
|
H A D | e_log2.c | 44 double f,hfsq,hi,lo,r,val_hi,val_lo,w,y; local 80 * theorem for spitting f-hfsq as hi+lo, unless double_t was used 101 hi = f - hfsq; 102 SET_LOW_WORD(hi,0); 103 lo = (f - hi) - hfsq + r; 104 val_hi = hi*ivln2hi; 105 val_lo = (lo+hi)*ivln2lo + lo*ivln2hi;
|
H A D | e_coshl.c | 88 long double hi,lo,x2,x4; local 120 k_hexpl(fabsl(x), &hi, &lo); local 121 RETURNI(lo + 0.25/(hi + lo) + hi);
|
H A D | e_exp.c | 26 * Here r will be represented as r = hi-lo for better 107 double y,hi=0.0,lo=0.0,c,t,twopk; local 131 hi = x-ln2HI[xsb]; lo=ln2LO[xsb]; k = 1-xsb-xsb; 135 hi = x - t*ln2HI[0]; /* t*ln2HI is exact here */ 138 STRICT_ASSIGN(double, x, hi - lo); 153 else y = one-((lo-(x*c)/(2.0-c))-hi);
|
H A D | e_expf.c | 48 float y,hi=0.0,lo=0.0,c,t,twopk; local 69 hi = x-ln2HI[xsb]; lo=ln2LO[xsb]; k = 1-xsb-xsb; 73 hi = x - t*ln2HI[0]; /* t*ln2HI is exact here */ 76 STRICT_ASSIGN(float, x, hi - lo); 91 else y = one-((lo-(x*c)/((float)2.0-c))-hi);
|
H A D | e_log10.c | 44 double f,hfsq,hi,lo,r,val_hi,val_lo,w,y,y2; local 72 hi = f - hfsq; 73 SET_LOW_WORD(hi,0); 74 lo = (f - hi) - hfsq + r; 75 val_hi = hi*ivln10hi; 77 val_lo = y*log10_2lo + (lo+hi)*ivln10lo + lo*ivln10hi;
|
H A D | e_sinhl.c | 87 long double hi,lo,x2,x4; local 121 k_hexpl(fabsl(x), &hi, &lo); local 122 RETURNI(s*(lo - 0.25/(hi + lo) + hi));
|
H A D | s_expm1.c | 135 double y,hi,lo,c,t,e,hxs,hfx,r1,twopk; local 165 {hi = x - ln2_hi; lo = ln2_lo; k = 1;} 167 {hi = x + ln2_hi; lo = -ln2_lo; k = -1;} 171 hi = x - t*ln2_hi; /* t*ln2_hi is exact here */ 174 STRICT_ASSIGN(double, x, hi - lo); 175 c = (hi-x)-lo;
|
H A D | s_expm1f.c | 44 float y,hi,lo,c,t,e,hxs,hfx,r1,twopk; local 71 {hi = x - ln2_hi; lo = ln2_lo; k = 1;} 73 {hi = x + ln2_hi; lo = -ln2_lo; k = -1;} 77 hi = x - t*ln2_hi; /* t*ln2_hi is exact here */ 80 STRICT_ASSIGN(float, x, hi - lo); 81 c = (hi-x)-lo;
|
H A D | s_fmal.c | 38 * of a long double. We maintain the invariant that "hi" stores the high-order 42 long double hi; member in struct:dd 57 ret.hi = a + b; 58 s = ret.hi - a; 59 ret.lo = (a - (ret.hi - s)) + (b - s); 82 u.e = sum.hi; 84 sum.hi = nextafterl(sum.hi, INFINITY * sum.lo); 86 return (sum.hi); 106 * lowest bit of sum.hi t [all...] |
H A D | s_fma.c | 38 * of a double. We maintain the invariant that "hi" stores the 53 high-order 42 double hi; member in struct:dd 57 ret.hi = a + b; 58 s = ret.hi - a; 59 ret.lo = (a - (ret.hi - s)) + (b - s); 82 EXTRACT_WORD64(hibits, sum.hi); 84 /* hibits += (int)copysign(1.0, sum.hi * sum.lo) */ 87 INSERT_WORD64(sum.hi, hibits); 90 return (sum.hi); 110 * lowest bit of sum.hi t [all...] |
H A D | s_tanhl.c | 115 long double hi,lo,s,x2,x4,z; local 160 k_hexpl(2*fabsl(x), &hi, &lo); 162 z = divl(hi, lo, -0.5, hi, lo, 0.5); 164 z = one - one/(lo+0.5+hi);
|
/bionic/libm/upstream-freebsd/lib/msun/bsdsrc/ |
H A D | b_exp.c | 92 double z,hi,lo,c; 105 /* express x-k*ln2 as hi-lo and let x=hi-lo rounded */ 107 hi=x-k*ln2hi; 108 x=hi-(lo=k*ln2lo); 113 return scalb(1.0+(hi-(lo-(x*c)/(2.0-c))),k); 138 double z,hi,lo; local 150 /* express (x+c)-k*ln2 as hi-lo and let x=hi-lo rounded */ 152 hi [all...] |
/bionic/libc/bionic/ |
H A D | pthread_attr.cpp | 170 uintptr_t lo, hi; local 171 if (sscanf(line, "%" SCNxPTR "-%" SCNxPTR, &lo, &hi) == 2) { 172 if (lo <= startstack && startstack <= hi) { 174 *stack_base = reinterpret_cast<void*>(hi - *stack_size);
|
/bionic/libc/kernel/uapi/asm-mips/asm/ |
H A D | ptrace.h | 40 __u64 hi; member in struct:pt_regs
|
H A D | kvm.h | 25 __u64 hi; member in struct:kvm_regs
|
/bionic/libc/upstream-netbsd/common/lib/libc/stdlib/ |
H A D | random.c | 277 int x1, hi, lo, t; local 287 hi = x1 / 127773; 289 t = 16807 * lo - 2836 * hi; 513 long x, hi, lo, t; local 522 hi = x / 127773; 524 t = 16807 * lo - 2836 * hi;
|
/bionic/libm/upstream-freebsd/lib/msun/ld128/ |
H A D | k_expl.h | 47 * ln2/INTERVALS = L1+L2 (hi+lo decomposition for multiplication). L1 must 83 * hi must be rounded to at most 106 bits so that multiplication 87 * XXX it is wasteful to use long double for both hi and lo. ld128 95 * to all line up for the hi values 1 before the point and 88 99 long double hi; member in struct:__anon1060 266 t = tbl[n2].lo + tbl[n2].hi; 267 *hip = tbl[n2].hi; 292 long double hi, lo, twopkm2; local 296 __k_expl(x, &hi, &lo, &k); 298 return (lo + hi) * 308 long double exp_x, hi, lo; local [all...] |
H A D | s_logl.c | 425 (rp)->hi = (v); \ 431 (rp)->hi = (h); \ 438 long double hi; member in struct:ld 619 * Since x+x_lo is a hi+lo decomposition and subtracting 1 687 * of the hi terms are exact in double precision. The types are chosen so 688 * that the products of the hi terms are done in at least double precision, 704 float hi; local 710 RETURNPI(r.hi); 711 _2sumF(r.hi, r.lo); 712 hi 723 float hi; local [all...] |
H A D | s_expl.c | 62 long double hi, lo, t, twopk; local 89 __k_expl(x, &hi, &lo, &k); 90 t = SUM2P(hi, lo); 295 t = tbl[n2].lo + tbl[n2].hi; 298 t = SUM2P(tbl[n2].hi - 1, tbl[n2].lo * (r1 + 1) + t * q + 299 tbl[n2].hi * r1); 303 t = SUM2P(tbl[n2].hi - 2, tbl[n2].lo * (r1 + 1) + t * q + 304 tbl[n2].hi * r1); 308 t = SUM2P(tbl[n2].hi, tbl[n2].lo + t * (q + r1)); 312 t = SUM2P(tbl[n2].hi, tb [all...] |
/bionic/libc/tzcode/ |
H A D | localtime.c | 1484 register int hi = sp->timecnt; local 1486 while (lo < hi) { 1487 register int mid = (lo + hi) >> 1; 1490 hi = mid; 1874 register time_t hi; local 1951 hi = time_t_max; 1953 t = lo / 2 + hi / 2; 1956 else if (t > hi) 1957 t = hi; 1972 } else if (t == hi) { [all...] |