Home
last modified time | relevance | path

Searched refs:step (Results 1 – 25 of 718) sorted by relevance

12345678910>>...29

/llvm-project-15.0.7/mlir/test/IR/
H A Dgeneric-visitors-interrupt.mlir12 // CHECK: step 2 walk was interrupted
25 // CHECK: step 2 op 'foo' before all regions
26 // CHECK: step 3 op 'bar' before all regions
27 // CHECK: step 4 walk was interrupted
44 // CHECK: step 2 op 'foo' before all regions
46 // CHECK: step 4 walk was interrupted
68 // CHECK: step 7 walk was interrupted
71 // CHECK: step 10 walk was interrupted
90 // CHECK: step 5 walk was interrupted
92 // CHECK: step 7 walk was interrupted
[all …]
H A Dgeneric-visitors.mlir10 scf.for %i = %c1 to %c10 step %c1 {
23 // CHECK: step 1 op 'func.func' before all regions
27 // CHECK: step 5 op 'scf.for' before all regions
28 // CHECK: step 6 op 'use0' before all regions
29 // CHECK: step 7 op 'scf.if' before all regions
30 // CHECK: step 8 op 'use1' before all regions
32 // CHECK: step 10 op 'scf.if' before region #1
33 // CHECK: step 11 op 'use2' before all regions
35 // CHECK: step 13 op 'scf.if' after all regions
36 // CHECK: step 14 op 'use3' before all regions
[all …]
/llvm-project-15.0.7/cross-project-tests/debuginfo-tests/dexter/dex/dextIR/
H A DDextIR.py16 def _step_kind_func(context, step): argument
17 if (step.current_location.path is None or
61 for step in self.steps:
76 def _get_prev_step_in_this_frame(self, step): argument
86 def _get_new_step_kind(self, context, step): argument
87 if step.current_function is None:
126 def new_step(self, context, step): argument
127 assert isinstance(step, StepIR), type(step)
128 step.step_kind = self._get_new_step_kind(context, step)
129 self.steps.append(step)
[all …]
/llvm-project-15.0.7/clang/test/CodeGen/aarch64-sve-intrinsics/
H A Dacle_sve_index.c18 svint8_t test_svindex_s8(int8_t base, int8_t step) in test_svindex_s8() argument
20 return svindex_s8(base, step); in test_svindex_s8()
33 svint16_t test_svindex_s16(int16_t base, int16_t step) in test_svindex_s16() argument
35 return svindex_s16(base, step); in test_svindex_s16()
48 svint32_t test_svindex_s32(int32_t base, int32_t step) in test_svindex_s32() argument
50 return svindex_s32(base, step); in test_svindex_s32()
65 return svindex_s64(base, step); in test_svindex_s64()
80 return svindex_u8(base, step); in test_svindex_u8()
95 return svindex_u16(base, step); in test_svindex_u16()
110 return svindex_u32(base, step); in test_svindex_u32()
[all …]
/llvm-project-15.0.7/llvm/test/Analysis/ScalarEvolution/
H A Dincreasing-or-decreasing-iv.ll16 ; CHECK-NEXT: --> {(%step + %start),+,%step}<%loop> U: [-256,256) S: [-256,256) Exits: ((128 * %…
34 %iv.next = add i32 %iv, %step
83 ; CHECK-NEXT: --> {(%step + %start),+,%step}<%loop> U: [0,-7) S: [-256,361) Exits: ((16 * %step)…
120 %iv.next = add i32 %iv, %step
162 %iv.next = add i32 %iv, %step
211 %iv.next = add i16 %iv, %step
259 %iv.next = add i32 %iv, %step
301 %iv.next = add i32 %iv, %step
322 ; CHECK-NEXT: %step.plus.one = add i32 %step, 1
346 %step.plus.one = add i32 %step, 1
[all …]
H A Dsext-to-zext.ll9 ; CHECK-NEXT: %step = select i1 %c, i32 -1, i32 1
10 ; CHECK-NEXT: --> %step U: [1,0) S: [-2,2)
12 ; CHECK-NEXT: --> {%start,+,%step}<nsw><%loop> U: [0,101) S: [0,101) Exits: ((99 * %step)<nsw> +…
17 ; CHECK-NEXT: %iv.dec = add nsw i32 %iv, %step
18 ; CHECK-NEXT: --> {(%step + %start),+,%step}<nw><%loop> U: [-200,201) S: [-200,201) Exits: ((100…
20 …rt to i64),+,(sext i32 %step to i64)}<nsw><%loop> U: [0,101) S: [0,101) Exits: ((zext i32 %start t…
30 %step = select i1 %c, i32 -1, i32 1
37 %iv.dec = add nsw i32 %iv, %step
/llvm-project-15.0.7/llvm/test/Transforms/ConstraintElimination/
H A Dgep-arithmetic.ll385 %step.pos = icmp sge i16 %step, 0
515 %and.step = and i1 %step.pos, %step.ult.N
564 %step.pos = icmp uge i8 %step, 0
566 %and.step = and i1 %step.pos, %step.ult.N
619 %step.pos = icmp uge i8 %step, 0
621 %and.step = and i1 %step.pos, %step.ult.N
671 %step.pos = icmp uge i8 %step, 0
674 %and.step = and i1 %step.pos, %step.ult.N
731 %and.step = and i1 %step.pos, %step.ult.N
880 %and.step = and i1 %step.pos, %step.ult.N
[all …]
/llvm-project-15.0.7/mlir/test/Transforms/
H A Dparametric-tiling.mlir10 // (upper - lower + step - 1) / step
11 // where step is known to be %c1.
20 // New outer step (original is %c1).
24 // (upper - lower + step - 1) / step
25 // where step is known to be %c2.
38 // COMMON: scf.for %[[i:.*]] = %c2 to %c44 step %[[step]]
40 scf.for %i = %c2 to %c44 step %c1 {
74 // (upper - lower + step - 1) / step
75 // where step is known to be %c1.
91 // COMMON: scf.for %[[i:.*]] = %c2 to %c44 step %[[step]]
[all …]
H A Dparametric-mapping.mlir7 // CHECK-SAME: (%[[lb:.*]]: index, %[[ub:.*]]: index, %[[step:.*]]: index)
8 func.func @map1d(%lb: index, %ub: index, %step: index) {
16 // CHECK: scf.for %{{.*}} = %[[new_lb]] to %[[ub]] step %[[new_step]] {
17 scf.for %i = %lb to %ub step %step {}
22 // CHECK-SAME: (%[[lb:.*]]: index, %[[ub:.*]]: index, %[[step:.*]]: index)
23 func.func @map2d(%lb : index, %ub : index, %step : index) {
36 // thread_offset = step * (threadIdx.x + blockIdx.x * blockDim.x)
42 // stepXgdimx = step * gridDim.x
45 // new_step = step * gridDim.x * blockDim.x
48 // CHECK: scf.for %{{.*}} = %[[new_lb]] to %[[ub]] step %[[new_step]] {
[all …]
H A Dscf-loop-unroll.mlir8 %step = arith.constant 1 : index
9 %sum = scf.for %iv = %from to %to step %step iter_args(%sum_iter = %arg0) -> (f32) {
13 …// CHECK: %[[SUM:.*]] = scf.for %{{.*}} = %{{.*}} to %{{.*}} step %{{.*}} iter_args(%[[V0:.*]…
28 %step = arith.constant 1 : index
29 %sum:2 = scf.for %iv = %from to %n step %step iter_args(%i0 = %arg0, %i1 = %arg1) -> (f32, f32) {
40 // CHECK-NEXT: %[[SUM:.*]]:2 = scf.for {{.*}} = %[[C0]] to %[[UB]] step %[[C3]] iter_args
42 …// CHECK-NEXT: %[[SUM1:.*]]:2 = scf.for {{.*}} = %[[UB]] to %[[N]] step %[[C1]] iter_args(%[[V1:.*…
49 %step = arith.constant 1 : index
52 scf.for %i = %lo to %hi step %step {
/llvm-project-15.0.7/clang/test/Analysis/
H A Dcfg-openmp.cpp25 int x, cond, fp, rd, lin, step, map; in target_s_has_device_addr() local
134 int x, cond, fp, rd, lin, step, map; in xxx() local
297 int x, cond, fp, rd, lin, step, map; in dpf() local
319 int x, cond, fp, rd, lin, step, map; in dpfs() local
341 int x, cond, fp, rd, lin, step, map; in ds() local
358 int x, cond, fp, rd, lin, step, map; in for_fn() local
371 #pragma omp for linear(lin : step) in for_fn()
378 int x, cond, fp, rd, lin, step, map; in fs() local
391 #pragma omp for simd linear(lin: step) in fs()
398 int x, cond, fp, rd, lin, step, map; in ord() local
[all …]
/llvm-project-15.0.7/mlir/test/Dialect/SCF/
H A Dfor-loop-peeling.mlir27 %r = scf.for %iv = %lb to %ub step %step iter_args(%arg = %c0) -> i32 {
56 %step = arith.constant 4 : index
58 %r = scf.for %iv = %lb to %ub step %step
97 %r = scf.for %iv = %lb to %ub step %step
135 scf.for %iv = %lb to %ub step %step {
204 scf.for %iv = %lb to %ub step %step {
205 // Most common case: Rewrite min(%ub - %iv, %step) to %step.
213 // Rewrite min(%ub - %iv + 1, %step + 1) to %step + 1.
227 // Rewrite max(-%ub + %iv, -%step) to -%ub + %iv (and -%step in the scf.if).
266 %r0 = scf.for %iv0 = %lb0 to %ub0 step %step iter_args(%arg0 = %c0) -> i32 {
[all …]
H A Dfor-loop-canonicalization.mlir12 scf.for %i = %c0 to %c4 step %c2 {
31 scf.for %i = %c0 to %c4 step %c2 {
51 scf.for %i = %c0 to %c4 step %c2 {
73 scf.for %i = %c0 to %c4 step %c2 {
74 scf.for %j = %c0 to %c6 step %c3 {
95 scf.for %i = %c1 to %c4 step %c2 {
115 scf.for %i = %c1 to %c256 step %c16 {
138 scf.for %i = %c0 to %ub step %step {
160 %ub2 = affine.apply affine_map<(d0)[s0] -> (s0 * d0)> (%step)[%step]
161 scf.for %i = %c0 to %ub2 step %step {
[all …]
H A Dparallel-loop-fusion.mlir7 scf.parallel (%i, %j) = (%c0, %c0) to (%c2, %c2) step (%c1, %c1) {
10 scf.parallel (%i, %j) = (%c0, %c0) to (%c2, %c2) step (%c1, %c1) {
20 // CHECK-SAME: to ([[C2]], [[C2]]) step ([[C1]], [[C1]]) {
33 scf.parallel (%i, %j) = (%c0, %c0) to (%c2, %c2) step (%c1, %c1) {
40 scf.parallel (%i, %j) = (%c0, %c0) to (%c2, %c2) step (%c1, %c1) {
58 // CHECK-SAME: to ([[C2]], [[C2]]) step ([[C1]], [[C1]]) {
113 // CHECK-SAME: to ([[C100]], [[C10]]) step ([[C1]], [[C1]]) {
134 scf.parallel (%i, %j) = (%c0, %c0) to (%c2, %c2) step (%c1, %c1) {
181 scf.parallel (%i) = (%c0) to (%c2) step (%c1) {
319 scf.parallel (%k) = (%c0) to (%c2) step (%c1) {
[all …]
H A Dparallel-loop-tiling.mlir7 scf.parallel (%i0, %i1) = (%arg0, %arg1) to (%arg2, %arg3) step (%arg4, %arg5) {
45 scf.parallel (%i0, %i1) = (%c0, %c0) to (%c22, %c24) step (%c3, %c3) {
60 ….parallel ([[V3:%.*]], [[V4:%.*]]) = ([[C0]], [[C0]]) to ([[C22]], [[C24]]) step ([[V1]], [[V2]]) {
74 scf.parallel (%i, %j) = (%c0, %c0) to (%c2, %c2) step (%c1, %c1) {
75 scf.parallel (%k, %l) = (%c0, %c0) to (%c2, %c2) step (%c1, %c1) {
78 scf.parallel (%i, %j) = (%c0, %c0) to (%c2, %c2) step (%c1, %c1) {
87 …cf.parallel ([[V1:%.*]], [[V2:%.*]]) = ([[C0]], [[C0]]) to ([[C2]], [[C2]]) step ([[C1]], [[C1]]) {
93 …cf.parallel ([[V5:%.*]], [[V6:%.*]]) = ([[C0]], [[C0]]) to ([[C2]], [[C2]]) step ([[V3]], [[V4]]) {
122 scf.for %i = %c0 to %c2 step %c1 {
123 scf.for %j = %c0 to %c2 step %c1 {
[all …]
H A Dparallel-loop-tiling-inbound-check.mlir7 scf.parallel (%i0, %i1) = (%arg0, %arg1) to (%arg2, %arg3) step (%arg4, %arg5) {
24 ….parallel ([[V7:%.*]], [[V8:%.*]]) = ([[C0]], [[C0]]) to ([[V1]], [[V2]]) step ([[ARG5]], [[ARG6]]…
53 scf.parallel (%i0, %i1) = (%c0, %c0) to (%c22, %c24) step (%c3, %c3) {
68 ….parallel ([[V3:%.*]], [[V4:%.*]]) = ([[C0]], [[C0]]) to ([[C22]], [[C24]]) step ([[V1]], [[V2]]) {
83 scf.parallel (%i, %j) = (%c0, %c0) to (%c2, %c2) step (%c1, %c1) {
84 scf.parallel (%k, %l) = (%c0, %c0) to (%c2, %c2) step (%c1, %c1) {
87 scf.parallel (%i, %j) = (%c0, %c0) to (%c2, %c2) step (%c1, %c1) {
96 …cf.parallel ([[V1:%.*]], [[V2:%.*]]) = ([[C0]], [[C0]]) to ([[C2]], [[C2]]) step ([[C1]], [[C1]]) {
131 scf.for %i = %c0 to %c2 step %c1 {
132 scf.for %j = %c0 to %c2 step %c1 {
[all …]
/llvm-project-15.0.7/mlir/test/Dialect/Bufferization/Transforms/
H A Dbuffer-loop-hoisting.mlir142 %1 = scf.for %i = %lb to %ub step %step
169 %1 = scf.for %i = %lb to %ub step %step
202 %1 = scf.for %i = %lb to %ub step %step
249 %1 = scf.for %i = %lb to %ub step %step
291 %1 = scf.for %i = %lb to %ub step %step
313 %0 = scf.for %i = %lb to %ub step %step
335 %1 = scf.for %i = %lb to %ub step %step
361 %0 = scf.for %i = %lb to %ub step %step
421 %1 = scf.for %i = %lb to %ub step %step
444 %1 = scf.for %i = %lb to %ub step %step
[all …]
/llvm-project-15.0.7/mlir/test/Dialect/OpenMP/
H A Dops.mlir1574 for (%i, %j) : i32 = (%lb, %ub) to (%ub, %lb) step (%step, %step) {
1582 for (%i, %j) : i32 = (%lb, %ub) to (%ub, %lb) step (%step, %step) {
1590 for (%i, %j) : i32 = (%lb, %ub) to (%ub, %lb) step (%step, %step) {
1598 for (%i, %j) : i32 = (%lb, %ub) to (%ub, %lb) step (%step, %step) {
1608 for (%i, %j) : i32 = (%lb, %ub) to (%ub, %lb) step (%step, %step) {
1616 for (%i, %j) : i32 = (%lb, %ub) to (%ub, %lb) step (%step, %step) {
1624 for (%i, %j) : i32 = (%lb, %ub) to (%ub, %lb) step (%step, %step) {
1633 for (%i, %j) : i32 = (%lb, %ub) to (%ub, %lb) step (%step, %step) {
1642 for (%i, %j) : i32 = (%lb, %ub) to (%ub, %lb) step (%step, %step) {
1651 for (%i, %j) : i32 = (%lb, %ub) to (%ub, %lb) step (%step, %step) {
[all …]
/llvm-project-15.0.7/mlir/test/Dialect/Linalg/
H A Dtransform-patterns.mlir24 // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c8000]] {
25 // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c1]] {
46 // CHECK: scf.parallel {{.*}} step (%[[c5]])
47 // CHECK: scf.for {{.*}} step %[[c6]]
75 // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c2000]] {
76 // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c3000]] {
139 // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c6]]
140 // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c5]]
165 // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c3000]] {
166 // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c4000]] {
[all …]
H A Dtile-and-peel-tensors.mlir15 // CHECK-PEEL-0: scf.for %{{.*}} = %[[c0]] to %[[c1280]] step %[[c256]] {{.*}} {
16 // CHECK-PEEL-0: scf.for %{{.*}} = %[[c0]] to %[[c1700]] step %[[c128]] {{.*}} {
17 // CHECK-PEEL-0: scf.for %{{.*}} = %[[c0]] to %[[c1600]] step %[[c512]] {{.*}} {
22 // CHECK-PEEL-0: scf.for %{{.*}} = %[[c0]] to %[[c1700]] step %[[c128]] {{.*}} {
23 // CHECK-PEEL-0: scf.for %{{.*}} = %[[c0]] to %[[c1600]] step %[[c512]] {{.*}} {
37 // CHECK-PEEL-12: scf.for %{{.*}} = %[[c0]] to %[[c1500]] step %[[c256]] {{.*}} {
64 // CHECK-PEEL-0: scf.for %{{.*}} = %[[c0]] to %{{.*}} step %[[c256]] {{.*}} {
65 // CHECK-PEEL-0: scf.for %{{.*}} = %[[c0]] to %{{.*}} step %[[c128]] {{.*}} {
72 // CHECK-PEEL-0: scf.for %{{.*}} = %[[c0]] to %{{.*}} step %[[c128]] {{.*}} {
84 // CHECK-PEEL-12: scf.for %{{.*}} = %[[c0]] to %{{.*}} step %[[c256]] {{.*}} {
[all …]
/llvm-project-15.0.7/cross-project-tests/debuginfo-tests/dexter/
H A DREADME.md102 to step into a file outside of the test directory.
147 step kind differences [0/1]
163 step 7 (Variable is optimized away and not available.)
164 step 8 (Variable is optimized away and not available.)
165 step 11 (Variable is optimized away and not available.)
166 step 14 (Variable is optimized away and not available.)
167 step 17 (Variable is optimized away and not available.)
168 step 20 (Variable is optimized away and not available.)
169 step 23 (Variable is optimized away and not available.)
246 step 7 (Variable is optimized away and not available.)
[all …]
/llvm-project-15.0.7/mlir/test/Conversion/SCFToOpenMP/
H A Dscf-to-openmp.mlir7 …for (%[[LVAR1:.*]], %[[LVAR2:.*]]) : index = (%arg0, %arg1) to (%arg2, %arg3) step (%arg4, %arg5) {
9 scf.parallel (%i, %j) = (%arg0, %arg1) to (%arg2, %arg3) step (%arg4, %arg5) {
24 // CHECK: omp.wsloop for (%[[LVAR_OUT1:.*]]) : index = (%arg0) to (%arg2) step (%arg4) {
26 scf.parallel (%i) = (%arg0) to (%arg2) step (%arg4) {
28 // CHECK: omp.wsloop for (%[[LVAR_IN1:.*]]) : index = (%arg1) to (%arg3) step (%arg5) {
30 scf.parallel (%j) = (%arg1) to (%arg3) step (%arg5) {
47 // CHECK: omp.wsloop for (%[[LVAR_AL1:.*]]) : index = (%arg0) to (%arg2) step (%arg4) {
49 scf.parallel (%i) = (%arg0) to (%arg2) step (%arg4) {
59 // CHECK: omp.wsloop for (%[[LVAR_AL2:.*]]) : index = (%arg1) to (%arg3) step (%arg5) {
61 scf.parallel (%j) = (%arg1) to (%arg3) step (%arg5) {
/llvm-project-15.0.7/lldb/test/Shell/SymbolFile/NativePDB/Inputs/
H A Dlocal-variables.lldbinit4 step
6 step
9 step
13 step
18 step
23 step
/llvm-project-15.0.7/clang/test/SemaCXX/
H A Dfor-range-examples.cpp30 T it, step; member in value_range_detail::value_range_step_iter
32 value_range_step_iter(const T &it, const T &step) : it(it), step(step) {} in value_range_step_iter() argument
35 value_range_step_iter &operator++() { it += step; return *this; } in operator ++()
40 T it, step, end_; member in value_range_detail::value_range_step
42 value_range_step(const T &it, const T &end, const T &step) : in value_range_step() argument
43 it(it), end_(end), step(step) {} in value_range_step()
45 iterator begin() const { return iterator(it, step); } in begin()
46 iterator end() const { return iterator(end_, step); } in end()
54 …p<T> range(const T &a, const T &b, const T &step) { return value_range_detail::value_range_step<T>… in range() argument
/llvm-project-15.0.7/libc/test/src/math/
H A Dmod_k_pi_test.cpp22 constexpr UIntType step = UIntType(-1) / count; in TEST() local
23 for (UIntType i = 0, v = 0; i <= count; ++i, v += step) { in TEST()
34 constexpr UIntType step = UIntType(-1) / count; in TEST() local
35 for (UIntType i = 0, v = 0; i <= count; ++i, v += step) { in TEST()
47 constexpr UIntType step = UIntType(-1) / count; in TEST() local
48 for (UIntType i = 0, v = 0; i <= count; ++i, v += step) { in TEST()

12345678910>>...29