| /external/musl/src/math/ |
| D | fma.c | 61 uint64_t rhi, rlo, zhi, zlo; in fma() local
62 mul(&rhi, &rlo, nx.m, ny.m); in fma()
80 rlo = rhi<<64-d | rlo>>d | !!(rlo<<64-d); in fma()
83 rlo = 1; in fma()
105 rlo += zlo; in fma()
106 rhi += zhi + (rlo < zlo); in fma()
109 uint64_t t = rlo; in fma()
110 rlo -= zlo; in fma()
111 rhi = rhi - zhi - (t < rlo); in fma()
113 rlo = -rlo; in fma()
[all …]
|
| D | log2.c | 49 double_t rhi, rlo; in log2() local
51 rlo = r - rhi; in log2()
53 lo = rlo * InvLn2hi + r * InvLn2lo; in log2()
99 double_t rhi, rlo; in log2() local
103 rlo = r - rhi; in log2()
105 t2 = rlo * InvLn2hi + r * InvLn2lo; in log2()
|
| D | log.c | 54 double_t rlo = r - rhi; in log() local
58 lo += B[0] * rlo * (rhi + r); in log()
|
| D | pow.c | 67 double_t rlo = zlo * invc; in log_inline() local
68 r = rhi + rlo; in log_inline()
91 lo3 = rlo * (ar + arhi); in log_inline()
|
| /external/trusty/musl/src/math/ |
| D | fma.c | 61 uint64_t rhi, rlo, zhi, zlo; in fma() local
62 mul(&rhi, &rlo, nx.m, ny.m); in fma()
80 rlo = rhi<<64-d | rlo>>d | !!(rlo<<64-d); in fma()
83 rlo = 1; in fma()
105 rlo += zlo; in fma()
106 rhi += zhi + (rlo < zlo); in fma()
109 uint64_t t = rlo; in fma()
110 rlo -= zlo; in fma()
111 rhi = rhi - zhi - (t < rlo); in fma()
113 rlo = -rlo; in fma()
[all …]
|
| D | log2.c | 49 double_t rhi, rlo; in log2() local
51 rlo = r - rhi; in log2()
53 lo = rlo * InvLn2hi + r * InvLn2lo; in log2()
99 double_t rhi, rlo; in log2() local
103 rlo = r - rhi; in log2()
105 t2 = rlo * InvLn2hi + r * InvLn2lo; in log2()
|
| D | log.c | 54 double_t rlo = r - rhi; in log() local
58 lo += B[0] * rlo * (rhi + r); in log()
|
| D | pow.c | 67 double_t rlo = zlo * invc; in log_inline() local
68 r = rhi + rlo; in log_inline()
91 lo3 = rlo * (ar + arhi); in log_inline()
|
| /external/rust/android-crates-io/crates/libm/src/math/ |
| D | fma.rs | 67 let (mut rhi, mut rlo) = mul(nx.m, ny.m); in fma()
85 rlo = rhi << (64 - d) | rlo >> d | ((rlo << (64 - d)) != 0) as u64; in fma()
88 rlo = 1; in fma()
110 rlo = rlo.wrapping_add(zlo); in fma()
111 rhi += zhi + (rlo < zlo) as u64; in fma()
114 let (res, borrow) = rlo.overflowing_sub(zlo); in fma()
115 rlo = res; in fma()
118 rlo = (rlo as i64).wrapping_neg() as u64; in fma()
119 rhi = (rhi as i64).wrapping_neg() as u64 - (rlo != 0) as u64; in fma()
130 rhi = rhi << d | rlo >> (64 - d) | ((rlo << d) != 0) as u64; in fma()
[all …]
|
| /external/OpenCL-CTS/test_conformance/math_brute_force/ |
| D | utility.cpp | 27 void MulD(double *rhi, double *rlo, double u, double v) in MulD() argument
44 *rlo = rl; in MulD()
47 void AddD(double *rhi, double *rlo, double a, double b) in AddD() argument
63 *rlo = zlo; in AddD()
66 void MulDD(double *rhi, double *rlo, double xh, double xl, double yh, double yl) in MulDD() argument
85 *rlo = (mh - (*rhi)) + ml; in MulDD()
88 void AddDD(double *rhi, double *rlo, double xh, double xl, double yh, double yl) in AddDD() argument
95 *rlo = (r - (*rhi)) + s; in AddDD()
101 double rhi, rlo; in DivideDD() local
102 MulD(&rhi, &rlo, *chi, b); in DivideDD()
[all …]
|
| D | utility.h | 209 void MulD(double *rhi, double *rlo, double u, double v);
210 void AddD(double *rhi, double *rlo, double a, double b);
211 void MulDD(double *rhi, double *rlo, double xh, double xl, double yh,
213 void AddDD(double *rhi, double *rlo, double xh, double xl, double yh,
|
| /external/cronet/stable/third_party/llvm-libc/src/AOR_v20.02/math/ |
| D | log2.c | 57 double_t rhi, rlo; in log2() local
59 rlo = r - rhi; in log2()
61 lo = rlo * InvLn2hi + r * InvLn2lo; in log2()
110 double_t rhi, rlo; in log2() local
114 rlo = r - rhi; in log2()
116 t2 = rlo * InvLn2hi + r * InvLn2lo; in log2()
|
| D | log.c | 89 double_t rlo = r - rhi; in log() local
93 lo += B[0] * rlo * (rhi + r); in log()
|
| D | pow.c | 69 double_t rlo = zlo * invc; in log_inline() local
70 r = rhi + rlo; in log_inline()
93 lo3 = rlo * (ar + arhi); in log_inline()
|
| /external/cronet/tot/third_party/llvm-libc/src/AOR_v20.02/math/ |
| D | log2.c | 57 double_t rhi, rlo; in log2() local
59 rlo = r - rhi; in log2()
61 lo = rlo * InvLn2hi + r * InvLn2lo; in log2()
110 double_t rhi, rlo; in log2() local
114 rlo = r - rhi; in log2()
116 t2 = rlo * InvLn2hi + r * InvLn2lo; in log2()
|
| D | log.c | 89 double_t rlo = r - rhi; in log() local
93 lo += B[0] * rlo * (rhi + r); in log()
|
| D | pow.c | 69 double_t rlo = zlo * invc; in log_inline() local
70 r = rhi + rlo; in log_inline()
93 lo3 = rlo * (ar + arhi); in log_inline()
|
| /external/arm-optimized-routines/math/ |
| D | log2.c | 58 double_t rhi, rlo; in log2() local
60 rlo = r - rhi; in log2()
62 lo = rlo * InvLn2hi + r * InvLn2lo; in log2()
111 double_t rhi, rlo; in log2() local
115 rlo = r - rhi; in log2()
117 t2 = rlo * InvLn2hi + r * InvLn2lo; in log2()
|
| D | log.c | 90 double_t rlo = r - rhi; in log() local
94 lo += B[0] * rlo * (rhi + r); in log()
|
| D | pow.c | 69 double_t rlo = zlo * invc; in log_inline() local
70 r = rhi + rlo; in log_inline()
93 lo3 = rlo * (ar + arhi); in log_inline()
|
| /external/compiler-rt/test/builtins/Unit/ppc/ |
| D | qadd_test.c | 22 double rhi; double rlo; member
114 r.lo = edgeCases[i].rlo; in testEdgeCases()
1823 r.lo = accuracyTests[i].rlo; in testAccuracy()
|
| D | qsub_test.c | 22 double rhi; double rlo; member
114 r.lo = edgeCases[i].rlo; in testEdgeCases()
1825 r.lo = accuracyTests[i].rlo; in testAccuracy()
|
| D | qdiv_test.c | 22 double rhi; double rlo; member
114 r.lo = edgeCases[i].rlo; in testEdgeCases()
746 r.lo = accuracyTests[i].rlo; in testAccuracy()
|
| D | qmul_test.c | 22 double rhi; double rlo; member
114 r.lo = edgeCases[i].rlo; in testEdgeCases()
744 r.lo = accuracyTests[i].rlo; in testAccuracy()
|
| /external/arm-optimized-routines/math/aarch64/experimental/ |
| D | log10_2u.c | 69 double_t rlo = r - rhi; in log10() local
73 lo += B[0] * rlo * (rhi + r); in log10()
|