| /external/llvm-project/libc/utils/FPUtil/ |
| D | Sqrt.h | 34 constexpr int nsteps = 5; // = ceil(log2(MantissaWidth)) variable
35 constexpr uint32_t bounds[nsteps] = {1 << 12, 1 << 18, 1 << 21, 1 << 22,
37 constexpr int shifts[nsteps] = {12, 6, 3, 2, 1};
39 for (int i = 0; i < nsteps; ++i) {
51 constexpr int nsteps = 6; // = ceil(log2(MantissaWidth)) variable
52 constexpr uint64_t bounds[nsteps] = {1ULL << 26, 1ULL << 39, 1ULL << 46,
54 constexpr int shifts[nsteps] = {27, 14, 7, 4, 2, 1};
56 for (int i = 0; i < nsteps; ++i) {
70 constexpr int nsteps = 7; // = ceil(log2(MantissaWidth)) variable
71 constexpr __uint128_t bounds[nsteps] = {
[all …]
|
| D | Hypot.h | 26 constexpr int nsteps = 5; variable
27 constexpr uint32_t bounds[nsteps] = {1 << 16, 1 << 8, 1 << 4, 1 << 2, 1 << 1};
28 constexpr int shifts[nsteps] = {16, 8, 4, 2, 1};
29 for (int i = 0; i < nsteps; ++i) {
41 constexpr int nsteps = 6; variable
42 constexpr uint64_t bounds[nsteps] = {1ULL << 32, 1ULL << 16, 1ULL << 8,
44 constexpr int shifts[nsteps] = {32, 16, 8, 4, 2, 1};
45 for (int i = 0; i < nsteps; ++i) {
|
| D | SqrtLongDoubleX86.h | 28 constexpr int nsteps = 6; // = ceil(log2(MantissaWidth)) variable
29 constexpr __uint128_t bounds[nsteps] = {
32 constexpr int shifts[nsteps] = {32, 16, 8, 4, 2, 1};
34 for (int i = 0; i < nsteps; ++i) {
|
| /external/jemalloc_new/include/jemalloc/internal/ |
| D | smoothstep.sh | 20 nsteps=$2
40 …y=`echo ${yprec} k ${step} ${nsteps} / sx _2 lx 3 ^ '*' 3 lx 2 ^ '*' + p | dc | tr -d '\\\\\n' | s…
46 …y=`echo ${yprec} k ${step} ${nsteps} / sx 6 lx 5 ^ '*' _15 lx 4 ^ '*' + 10 lx 3 ^ '*' + p | dc | t…
52 …y=`echo ${yprec} k ${step} ${nsteps} / sx _20 lx 7 ^ '*' 70 lx 6 ^ '*' + _84 lx 5 ^ '*' + 35 lx 4 …
90 while [ $s -le $nsteps ] ; do
92 x=`echo ${xprec} k ${s} ${nsteps} / p | dc | tr -d '\\\\\n' | sed -e 's#^\.#0.#g'`
|
| /external/python/cpython2/Demo/tkinter/guido/ |
| D | sortvisu.py | 242 nsteps = steps(self.index, index)
243 if not nsteps: return
245 nsteps = 0
249 trajectory = interpolate(oldpts, newpts, nsteps)
256 nsteps = steps(self.index, other.index)
257 if not nsteps: return
259 nsteps = 0
278 mytrajectory = interpolate(myoldpts, mynewpts, nsteps)
279 othertrajectory = interpolate(otheroldpts, othernewpts, nsteps)
336 nsteps = abs(here - there)
[all …]
|
| /external/python/cpython3/Tools/demo/ |
| D | sortvisu.py | 242 nsteps = steps(self.index, index)
243 if not nsteps: return
245 nsteps = 0
249 trajectory = interpolate(oldpts, newpts, nsteps)
256 nsteps = steps(self.index, other.index)
257 if not nsteps: return
259 nsteps = 0
278 mytrajectory = interpolate(myoldpts, mynewpts, nsteps)
279 othertrajectory = interpolate(otheroldpts, othernewpts, nsteps)
338 nsteps = abs(here - there)
[all …]
|
| /external/eigen/blas/f2c/ |
| D | drotm.c | 31 integer nsteps; in drotm_() local
103 nsteps = *n * *incx; in drotm_()
114 i__1 = nsteps; in drotm_()
127 i__2 = nsteps; in drotm_()
142 i__1 = nsteps; in drotm_()
|
| D | srotm.c | 31 integer nsteps; in srotm_() local
104 nsteps = *n * *incx; in srotm_()
115 i__1 = nsteps; in srotm_()
128 i__2 = nsteps; in srotm_()
143 i__1 = nsteps; in srotm_()
|
| /external/llvm-project/llvm/test/Transforms/LoopStrengthReduce/X86/ |
| D | canonical.ll | 8 define void @foo(i32 %size, i32 %nsteps, i8* nocapture %maxarray, i8* nocapture readnone %buffer, i…
10 %cmp25 = icmp sgt i32 %nsteps, 0
17 %wide.trip.count31 = zext i32 %nsteps to i64
|
| D | nested-loop.ll | 11 define void @foo(i32 %size, i32 %nsteps, i32 %hsize, i32* %lined, i8* %maxarray) {
52 %t1 = sext i32 %nsteps to i64
|
| /external/llvm-project/llvm/test/Transforms/IndVarSimplify/X86/ |
| D | iv-widen.ll | 163 define void @loop_2(i32 %size, i32 %nsteps, i32 %hsize, i32* %lined, i8 %tmp1) {
247 %cmp = icmp slt i32 %inc6, %nsteps
|