Home
last modified time | relevance | path

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

12345678910>>...41

/llvm-project/mlir/test/IR/
H A Dgeneric-visitors-interrupt.mlir10 // CHECK: step 0 op 'builtin.module' before all regions
11 // CHECK: step 1 op 'func.func' before all regions
12 // CHECK: step 2 walk was interrupted
23 // CHECK: step 0 op 'builtin.module' before all regions
24 // CHECK: step 1 op 'func.func' before all regions
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
42 // CHECK: step 0 op 'builtin.module' before all regions
43 // CHECK: step 1 op 'func.func' before all regions
[all …]
H A Dgeneric-visitors.mlir10 scf.for %i = %c1 to %c10 step %c1 {
22 // CHECK: step 0 op 'builtin.module' before all regions
23 // CHECK: step 1 op 'func.func' before all regions
24 // CHECK: step 2 op 'arith.constant' before all regions
25 // CHECK: step 3 op 'arith.constant' before all regions
26 // CHECK: step 4 op 'arith.constant' 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
[all …]
/llvm-project/cross-project-tests/debuginfo-tests/dexter/dex/dextIR/
H A DDextIR.py15 def _step_kind_func(context, step): argument
16 if step.current_location.path is None or not os.path.exists(
17 step.current_location.path
22 os.path.samefile(step.current_location.path, f)
63 for step in self.steps:
64 if step.step_kind in (
72 st += "<{}>{}</>\n".format(color, step)
82 def _get_prev_step_in_this_frame(self, step): argument
92 if s.current_function == step.current_function
93 and s.num_frames == step.num_frames
[all …]
/llvm-project/llvm/test/Analysis/ScalarEvolution/
H A Dincreasing-or-decreasing-iv.ll9 ; CHECK-NEXT: %step = select i1 %c, i32 -1, i32 1
10 ; CHECK-NEXT: --> %step U: [1,0) S: [-2,2)
14 ; CHECK-NEXT: --> {%start,+,%step}<nsw><%loop> U: [0,128) S: [0,128) Exits: ((127 * %step)<nsw> …
15 ; CHECK-NEXT: %iv.next = add i32 %iv, %step
16 ; CHECK-NEXT: --> {(%step + %start),+,%step}<nw><%loop> U: [-256,256) S: [-256,256) Exits: ((128…
27 %step = select i1 %c, i32 -1, i32 1
33 %iv.next = add i32 %iv, %step
47 ; CHECK-NEXT: %step = select i1 %c, i32 -8, i32 8
48 ; CHECK-NEXT: --> %step U: [8,-7) S: [-16,16)
52 ; CHECK-NEXT: --> {%start,+,%step}<nsw><%loop> U: [0,121) S: [0,121) Exits: ((15 * %step)<nsw> +…
[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…
29 %step = select i1 %c, i32 -1, i32 1
36 %iv.dec = add nsw i32 %iv, %step
/llvm-project/clang/test/CodeGen/aarch64-sve-intrinsics/
H A Dacle_sve_index.c
/llvm-project/llvm/test/CodeGen/PowerPC/
H A Dpr52894.ll32 %step.add = add <4 x i32> %vec.ind, <i32 4, i32 4, i32 4, i32 4>
33 %step.add24 = add <4 x i32> %vec.ind, <i32 8, i32 8, i32 8, i32 8>
34 %step.add25 = add <4 x i32> %vec.ind, <i32 12, i32 12, i32 12, i32 12>
35 %step.add26 = add <4 x i32> %vec.ind, <i32 16, i32 16, i32 16, i32 16>
36 %step.add27 = add <4 x i32> %vec.ind, <i32 20, i32 20, i32 20, i32 20>
37 %step.add28 = add <4 x i32> %vec.ind, <i32 24, i32 24, i32 24, i32 24>
38 %step.add29 = add <4 x i32> %vec.ind, <i32 28, i32 28, i32 28, i32 28>
39 %step.add30 = add <4 x i32> %vec.ind, <i32 32, i32 32, i32 32, i32 32>
40 %step.add31 = add <4 x i32> %vec.ind, <i32 36, i32 36, i32 36, i32 36>
41 %step.add32 = add <4 x i32> %vec.ind, <i32 40, i32 40, i32 40, i32 40>
[all …]
H A Dpr52894-32bit.ll26 %step.add = add <4 x i32> %vec.ind, <i32 4, i32 4, i32 4, i32 4>
27 %step.add21 = add <4 x i32> %vec.ind, <i32 8, i32 8, i32 8, i32 8>
28 %step.add22 = add <4 x i32> %vec.ind, <i32 12, i32 12, i32 12, i32 12>
29 %step.add23 = add <4 x i32> %vec.ind, <i32 16, i32 16, i32 16, i32 16>
30 %step.add24 = add <4 x i32> %vec.ind, <i32 20, i32 20, i32 20, i32 20>
31 %step.add25 = add <4 x i32> %vec.ind, <i32 24, i32 24, i32 24, i32 24>
32 %step.add26 = add <4 x i32> %vec.ind, <i32 28, i32 28, i32 28, i32 28>
33 %step.add27 = add <4 x i32> %vec.ind, <i32 32, i32 32, i32 32, i32 32>
34 %step.add28 = add <4 x i32> %vec.ind, <i32 36, i32 36, i32 36, i32 36>
35 %step.add29 = add <4 x i32> %vec.ind, <i32 40, i32 40, i32 40, i32 40>
[all …]
/llvm-project/llvm/test/Transforms/ConstraintElimination/
H A Dgep-arithmetic.ll161 ; CHECK: step.check:
180 br i1 %or.precond.0, label %trap.bb, label %step.check
185 step.check:
186 %step.ult.N = icmp ult i16 1, %N
187 br i1 %step.ult.N, label %ptr.check, label %exit
190 %src.step = getelementptr inbounds i8, ptr %src, i16 1
191 %cmp.step.start = icmp ult ptr %src.step, %lower
192 %cmp.step.end = icmp uge ptr %src.step,
[all...]
H A Dgep-arithmetic-signed-predicates.ll167 ; CHECK: step.check:
188 br i1 %or.precond.0, label %trap.bb, label %step.check
193 step.check:
194 %step.slt.N = icmp slt i16 1, %N
195 br i1 %step.slt.N, label %ptr.check, label %exit
198 %src.step = getelementptr inbounds i8, ptr %src, i16 1
199 %cmp.step.start = icmp slt ptr %src.step, %lower
200 %cmp.step.end = icmp sge ptr %src.step, %upper
201 %or.check = or i1 %cmp.step.start, %cmp.step.end
222 ; CHECK: step.check:
[all …]
H A Dgep-arithmetic-add-signed-predicates.ll78 define i4 @inc_ptr_N_could_be_negative(ptr %src, ptr %lower, ptr %upper, i8 %N, i8 %step) {
88 ; CHECK: step.check:
108 br i1 %or.precond.0, label %trap.bb, label %step.check
113 step.check:
114 %step.pos = icmp sge i8 %step, 0
115 %next = add nuw nsw i8 %step, 2
116 %step.slt.N = icmp slt i8 %next, %N
117 %and.step = and i1 %step.pos, %step.slt.N
118 br i1 %and.step, label %ptr.check, label %exit
121 %src.step = getelementptr inbounds i8, ptr %src, i8 %step
[all …]
H A Dgep-arithmetic-add.ll76 define i4 @inc_ptr_N_could_be_negative(ptr %src, ptr %lower, ptr %upper, i8 %N, i8 %step) {
86 ; CHECK: step.check:
105 br i1 %or.precond.0, label %trap.bb, label %step.check
110 step.check:
111 %step.pos = icmp uge i8 %step, 0
112 %next = add nuw nsw i8 %step, 2
113 %step.ult.N = icmp ult i8 %next, %N
114 %and.step = and i1 %step.pos, %step.ult.N
115 br i1 %and.step, label %ptr.check, label %exit
118 %src.step = getelementptr inbounds i8, ptr %src, i8 %step
[all …]
/llvm-project/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).
21 // COMMON-NEXT: %[[step:.*]] = arith.muli %c1, %[[size]]
24 // (upper - lower + step - 1) / step
25 // where step is known to be %c2.
34 // New inner step (original is %c2).
38 // COMMON: scf.for %[[i:.*]] = %c2 to %c44 step %[[step]]
39 // TILE_74:scf.for %[[j:.*]] = %c1 to %c44 step %[[step2]]
40 scf.for %i = %c2 to %c44 step %c1 {
[all …]
H A Dloop-invariant-code-motion.mlir127 func.func @hoist_invariant_affine_if_success(%lb: index, %ub: index, %step: index) -> i32 {
156 func.func @hoist_variant_affine_if_failure(%lb: index, %ub: index, %step: index) -> i32 {
204 affine.for %arg1 = %lb to %ub step 2 {
210 // CHECK-NEXT: affine.for %[[ARG3:.*]] = %[[ARG0]] to %[[ARG1]] step 2 {
221 scf.for %arg0 = %lb to %ub step %c1 {
222 scf.for %arg1 = %lb to %ub step %c1 {
240 scf.for %arg0 = %lb to %ub step %c1 {
241 scf.for %arg1 = %lb to %ub step %c2 {
256 func.func @hoist_scf_for_with_unknown_trip_count_unknown_step(%lb: index, %ub: index, %step: index) {
258 scf.for %arg0 = %lb to %ub 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) {
12 // CHECK: %[[thread_offset:.+]] = affine.apply #[[mul_map]]()[%[[threads]]#0, %[[step]]]
14 // CHECK: %[[new_step:.+]] = affine.apply #[[mul_map]]()[%[[threads]]#1, %[[step]]]
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)
37 // CHECK: %[[thread_offset:.+]] = affine.apply #[[mul_map]]()[%[[tidxpbidxXbdimx]], %[[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/mlir/test/Dialect/Bufferization/Transforms/
H A Dbuffer-loop-hoisting.mlir138 %step: index,
142 %1 = scf.for %i = %lb to %ub step %step
166 %step: index,
169 %1 = scf.for %i = %lb to %ub step %step
198 %step: index,
202 %1 = scf.for %i = %lb to %ub step %step
204 %2 = scf.for %i2 = %lb to %ub step %step
206 %3 = scf.for %i3 = %lb to %ub step %step
244 %step: index,
249 %1 = scf.for %i = %lb to %ub step %step
[all …]
/llvm-project/mlir/test/Dialect/SCF/
H A Dfor-loop-peeling.mlir11 // CHECK-SAME: step %[[STEP]] iter_args(%[[ACC:.*]] = %[[C0_I32]]) -> (i32) {
17 // CHECK-SAME: step %[[STEP]] iter_args(%[[ACC2:.*]] = %[[LOOP]]) -> (i32) {
25 func.func @fully_dynamic_bounds(%lb : index, %ub: index, %step: index) -> i32 {
27 %r = scf.for %iv = %lb to %ub step %step iter_args(%arg = %c0) -> i32 {
28 %s = affine.min #map(%ub, %iv)[%step]
46 // CHECK-SAME: step %[[C4]] iter_args(%[[ACC:.*]] = %[[C0_I32]]) -> (i32) {
56 %step = arith.constant 4 : index
58 %r = scf.for %iv = %lb to %ub step %step
60 %s = affine.min #map(%ub, %iv)[%step]
80 // CHECK-SAME: step %[[C4]] iter_args(%[[ACC:.*]] = %[[C0_I32]]) -> (i32) {
[all …]
H A Dfor-loop-peeling-front.mlir10 // CHECK-SAME: step %[[C4]] iter_args(%[[ACC:.*]] = %[[C0_I32]]) -> (i32) {
17 // CHECK-SAME: step %[[C4]] iter_args(%[[ACC2:.*]] = %[[FIRST]]) -> (i32) {
28 %step = arith.constant 4 : index
30 %r = scf.for %iv = %lb to %ub step %step iter_args(%arg = %c0_i32) -> i32 {
31 %s = affine.min #map(%ub, %iv)[%step]
46 // CHECK: scf.for %[[IV:.*]] = %[[C0]] to %[[C4]] step %[[C4]] {
53 // CHECK: scf.for %[[IV2:.*]] = %[[C4]] to %[[UB]] step %[[C4]] {
65 %step = arith.constant 4 : index
66 scf.for %iv = %lb to %ub step %step {
67 %s = affine.min #map(%ub, %iv)[%step]
[all …]
/llvm-project/cross-project-tests/debuginfo-tests/dexter/
H A DREADME.md5 … test programs, and collects information on the behavior at each debugger step to provide quantita…
104 to step into a file outside of the test directory.
116 …t is enabled by `-v` and shows a breakdown of the information from each debugger step. For example:
149 step kind differences [0/1]
164 step 5 (Variable is optimized away and not available.) [-3]
165 step 7 (Variable is optimized away and not available.)
166 step 8 (Variable is optimized away and not available.)
167 step 11 (Variable is optimized away and not available.)
168 step 14 (Variable is optimized away and not available.)
169 step 17 (Variable is optimized away and not available.)
[all …]
/llvm-project/libc/src/__support/GPU/
H A Dutils.h36 for (uint32_t step = gpu::get_lane_size() / 2; step > 0; step /= 2) { reduce() local
45 for (uint32_t step = 1; step < gpu::get_lane_size(); step *= 2) { scan() local
/llvm-project/mlir/test/Dialect/Tensor/
H A Dtransform-op-make-loop-independent.mlir10 // CHECK-SAME: %[[lb:.*]]: index, %[[ub:.*]]: index, %[[step:.*]]: index,
12 func.func @make_pad_loop_independent_1(%lb: index, %ub: index, %step: index,
15 scf.for %i = %lb to %ub step %step {
48 // CHECK-SAME: %[[lb:.*]]: index, %[[ub:.*]]: index, %[[step:.*]]: index,
50 func.func @make_pad_loop_independent_1(%lb: index, %ub: index, %step: index,
53 scf.for %i = %lb to %ub step %step {
83 func.func @two_loops(%lb: index, %ub: index, %step: index,
85 scf.for %i = %lb to %ub step %step {
86 scf.for %j = %lb to %ub step %step {
109 func.func @not_enough_loops(%lb: index, %ub: index, %step: index,
[all …]
/llvm-project/mlir/test/python/dialects/
H A Dscf.py27 def simple_loop(lb, ub, step): argument
28 loop = scf.ForOp(lb, ub, step, [lb, lb])
35 # CHECK: scf.for %{{.*}} = %[[ARG0]] to %[[ARG1]] step %[[ARG2]]
46 def induction_var(lb, ub, step): argument
47 loop = scf.ForOp(lb, ub, step, [lb])
54 # CHECK: scf.for %[[IV:.*]] = %[[ARG0]] to %[[ARG1]] step %[[ARG2]]
66 # CHECK: scf.for %[[VAL_4:.*]] = %[[VAL_0]] to %[[VAL_1]] step %[[VAL_2]] {
73 def range_loop_1(lb, ub, step, memref_v): argument
74 for i in range(lb, ub, step):
83 # CHECK: scf.for %[[VAL_6:.*]] = %[[VAL_0]] to %[[VAL_4]] step
90 range_loop_2(lb, ub, step, memref_v) global() argument
106 range_loop_3(lb, ub, step, memref_v) global() argument
122 range_loop_4(lb, ub, step, memref_v) global() argument
139 range_loop_5(lb, ub, step, memref_v) global() argument
156 range_loop_6(lb, ub, step, memref_v) global() argument
173 range_loop_7(lb, ub, step, memref_v) global() argument
193 loop_yield_1(lb, ub, step, memref_v) global() argument
217 loop_yield_2(lb, ub, step, memref_v) global() argument
[all...]
/llvm-project/mlir/test/Dialect/OpenMP/
H A Dinvalid.mlir90 func.func @invalid_parent(%lb : index, %ub : index, %step : index) {
92 omp.loop_nest (%iv) : index = (%lb) to (%ub) step (%step) {
99 func.func @type_mismatch(%lb : index, %ub : index, %step : index) {
102 "omp.loop_nest" (%lb, %ub, %step) ({
111 func.func @iv_number_mismatch(%lb : index, %ub : index, %step : index) {
114 "omp.loop_nest" (%lb, %ub, %step) ({
123 func.func @no_wrapper(%lb : index, %ub : index, %step : index) {
127 omp.loop_nest (%iv) : index = (%lb) to (%ub) step (%step) {
[all...]
/llvm-project/mlir/lib/Dialect/SCF/Utils/
H A DAffineCanonicalizationUtils.cpp34 OpFoldResult &ub, OpFoldResult &step) { in matchForLikeLoop() argument
38 step = forOp.getStep(); in matchForLikeLoop()
46 step = parOp.getStep()[idx]; in matchForLikeLoop()
57 step = forallOp.getMixedStep()[idx]; in matchForLikeLoop()
81 OpFoldResult ub, OpFoldResult step) { in addLoopRangeConstraints() argument
86 auto stepInt = getConstantIntValue(step); in addLoopRangeConstraints()
162 OpFoldResult lb, ub, step; in canonicalizeMinMaxOpInLoop() local
163 if (failed(loopMatcher(operand, lb, ub, step))) in canonicalizeMinMaxOpInLoop()
167 if (failed(addLoopRangeConstraints(constraints, iv, lb, ub, step))) in canonicalizeMinMaxOpInLoop()
200 Value iv, Value ub, Value step, in rewritePeeledMinMaxOp() argument
[all …]

12345678910>>...41