Home
last modified time | relevance | path

Searched refs:loop (Results 1 – 25 of 3308) sorted by relevance

12345678910>>...133

/llvm-project-15.0.7/clang/test/Parser/
H A Dpragma-loop.cpp88 #pragma clang loop vectorize(enable) in test()
89 #pragma clang loop interleave(enable) in test()
91 #pragma clang loop unroll(full) in test()
96 #pragma clang loop vectorize_width(4) in test()
98 #pragma clang loop unroll_count(16) in test()
106 #pragma clang loop unroll(disable) in test()
251 #pragma clang loop unroll_count(4) in test()
264 #pragma clang loop unroll(full) in test()
276 #pragma clang loop unroll(disable) in test()
286 #pragma clang loop unroll_count(8) in test()
[all …]
/llvm-project-15.0.7/llvm/test/Other/
H A Dloopnest-pass-ordering.ll7 ; loop.0 loop.1
9 ; loop.0.0 loop.0.1 loop.1.0
11 … Loop at depth 1 containing: %loop.0<header><exiting>,%loop.0.0,%loop.0.1,%loop.0.1.preheader,%loo…
12 …p at depth 1 containing: %loop.1<header>,%loop.1.bb1,%loop.1.bb2<exiting>,%loop.1.0,%loop.1.0.preh…
18 loop.0:
19 br i1 undef, label %loop.0.0, label %loop.1
21 br i1 undef, label %loop.0.0, label %loop.0.1
23 br i1 undef, label %loop.0.1, label %loop.0
24 loop.1:
25 br i1 undef, label %loop.1, label %loop.1.bb1
[all …]
H A Dloop-pass-ordering.ll7 ; loop.0 loop.1
9 ; loop.0.0 loop.0.1 loop.1.0
20 loop.0:
21 br i1 undef, label %loop.0.0, label %loop.1
22 loop.0.0:
23 br i1 undef, label %loop.0.0, label %loop.0.1
25 br i1 undef, label %loop.0.1, label %loop.0
26 loop.1:
27 br i1 undef, label %loop.1, label %loop.1.bb1
29 br i1 undef, label %loop.1, label %loop.1.bb2
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/DFAJumpThreading/
H A Ddfa-jump-threading-analysis.ll47 ; CHECK-NEXT: < loop.3 case2 loop.1.backedge loop.1 loop.2 > [ 1, loop.1 ]
48 ; CHECK-NEXT: < loop.3 case2 loop.1.backedge si.unfold.false loop.1 loop.2 > [ 4, loop.1.backedge ]
49 ; CHECK-NEXT: < loop.3 case3 loop.2.backedge loop.2 > [ 0, loop.2.backedge ]
51 ; CHECK-NEXT: < loop.3 case3 case4 loop.1.backedge loop.1 loop.2 > [ 1, loop.1 ]
52 ; CHECK-NEXT: < loop.3 case3 case4 loop.1.backedge si.unfold.false loop.1 loop.2 > [ 2, loop.1.back…
53 ; CHECK-NEXT: < loop.3 case4 loop.2.backedge loop.2 > [ 3, loop.2.backedge ]
54 ; CHECK-NEXT: < loop.3 case4 loop.1.backedge loop.1 loop.2 > [ 1, loop.1 ]
55 ; CHECK-NEXT: < loop.3 case4 loop.1.backedge si.unfold.false loop.1 loop.2 > [ 2, loop.1.backedge ]
191 ; CHECK-NEXT: < loop.3 case2 loop.1.backedge loop.1 loop.2 > [ 1, loop.1 ]
195 ; CHECK-NEXT: < loop.3 case3 case4 loop.1.backedge loop.1 loop.2 > [ 1, loop.1 ]
[all …]
/llvm-project-15.0.7/llvm/test/Analysis/ScalarEvolution/
H A Dincreasing-or-decreasing-iv.ll11 ; CHECK-NEXT: %loop.iv = phi i32 [ 0, %entry ], [ %loop.iv.inc, %loop ]
31 loop:
32 %loop.iv = phi i32 [ 0, %entry ], [ %loop.iv.inc, %loop ]
35 %loop.iv.inc = add i32 %loop.iv, 1
99 %loop.iv = phi i32 [ 0, %entry ], [ %loop.iv.inc, %loop ]
159 %loop.iv = phi i32 [ 0, %entry ], [ %loop.iv.inc, %loop ]
208 %loop.iv = phi i16 [ 0, %entry ], [ %loop.iv.inc, %loop ]
256 %loop.iv = phi i32 [ 0, %entry ], [ %loop.iv.inc, %loop ]
298 %loop.iv = phi i16 [ 0, %entry ], [ %loop.iv.inc, %loop ]
343 %loop.iv = phi i16 [ 0, %entry ], [ %loop.iv.inc, %loop ]
[all …]
H A Dshift-recurrences.ll18 loop:
41 loop:
64 loop:
86 loop:
109 loop:
133 loop:
157 loop:
180 loop:
209 loop:
244 loop:
[all …]
H A Dtrip-count-andor.ll19 loop:
42 loop:
65 loop:
88 loop:
109 loop:
130 loop:
153 loop:
176 loop:
199 loop:
222 loop:
[all …]
H A Dtrip-count-andor-selectform.ll19 loop:
42 loop:
65 loop:
88 loop:
109 loop:
130 loop:
153 loop:
176 loop:
199 loop:
222 loop:
[all …]
H A Dtrip-count9.ll24 loop:
43 loop:
64 loop:
83 loop:
104 loop:
123 loop:
144 loop:
173 loop:
194 loop:
215 loop:
[all …]
H A Dshift-op.ll7 br label %loop
9 loop:
25 loop:
44 loop:
61 loop:
78 loop:
97 loop:
115 loop:
132 loop:
152 loop:
[all …]
H A Dexit-count-select.ll23 br label %loop
24 loop:
54 br label %loop
55 loop:
86 br label %loop
87 loop:
118 loop:
149 loop:
180 loop:
212 loop:
[all …]
H A Dmax-backedge-taken-count-guard-info.ll26 loop:
58 loop:
90 loop:
122 loop:
154 loop:
186 loop:
218 loop:
254 loop:
290 loop:
327 loop:
[all …]
H A Dtrip-count-non-unit-stride.ll22 br label %loop
24 loop:
55 br label %loop
57 loop:
87 br label %loop
89 loop:
120 br label %loop
122 loop:
152 br label %loop
154 loop:
[all …]
H A Dexit-count-select-safe.ll22 loop:
51 loop:
82 loop:
115 loop:
150 loop:
187 loop:
223 loop:
261 loop:
300 loop:
337 loop:
[all …]
H A Dtrip-count15.ll18 ; CHECK: Loop %loop: Trip multiple is 1
23 br label %loop
24 loop:
28 br i1 %exit, label %loop_exit, label %loop
53 br label %loop
54 loop:
58 br i1 %exit, label %loop_exit, label %loop
83 br label %loop
84 loop:
111 br label %loop
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/CodeExtractor/
H A DLoopExtractor.ll1 ; RUN: opt < %s -break-crit-edges -loop-simplify -loop-extract -S | FileCheck %s
10 ; CHECK-NEXT: br label %loop.0.loop.1_crit_edge
11 ; CHECK: loop.0.loop.1_crit_edge:
20 br label %loop.0
27 br i1 %repeat.0, label %loop.0, label %loop.1
29 loop.1: ; preds = %loop.0, %loop.1
30 %index.1 = phi i32 [ %next.1, %loop.1 ], [ 10, %loop.0 ]
51 ; CHECK: loop.1.loop.1_crit_edge:
64 ; CHECK-NEXT: br i1 %repeat.0, label %loop.0.loop.0_crit_edge, label %loop.0.loop.1_crit_edge.ex…
65 ; CHECK: loop.0.loop.0_crit_edge:
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/LoopVectorize/
H A Dscev-during-mutation.ll14 loop.0:
18 loop.1:
22 br i1 %i6, label %loop.0.latch, label %loop.1
44 br i1 %ec.0, label %loop.0, label %loop.1.ph
53 loop.2:
60 br i1 %C6, label %loop.2, label %loop.3.ph
62 loop.3.ph:
65 loop.3:
69 br i1 %C1, label %loop.3, label %loop.1.latch
86 loop.1:
[all …]
/llvm-project-15.0.7/mlir/test/Transforms/
H A Dloop-fusion-slice-computation.mlir10 …// expected-remark@-1 {{Incorrect slice ( src loop: 1, dst loop: 0, depth: 1 : insert point: (1, 1…
14 …// expected-remark@-1 {{slice ( src loop: 0, dst loop: 1, depth: 1 : insert point: (1, 0) loop bou…
27 …// expected-remark@-1 {{slice ( src loop: 1, dst loop: 0, depth: 1 : insert point: (1, 1) loop bou…
31 …// expected-remark@-1 {{Incorrect slice ( src loop: 0, dst loop: 1, depth: 1 : insert point: (1, 0…
52 …// expected-remark@-1 {{slice ( src loop: 0, dst loop: 1, depth: 1 : insert point: (1, 0) loop bou…
61 // Slices at loop depth 1 should only slice the loop bounds of the first scf.
62 // Slices at loop depth 2 should slice loop bounds of both loops.
86 // The load at depth 1 in loop nest %i2 prevents slicing loop nest %i0 at depths
87 // greater than 1. However, loop nest %i2 can be sliced into loop nest %i0 at
113 // The store at depth 1 in loop nest %i0 prevents slicing loop nest %i2 at
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/LoopPredication/
H A Dnested.ll58 %outer.loop.acc = phi i32 [ %outer.loop.acc.next, %outer.loop.inc ], [ 0, %outer.loop.preheader ]
67 …%inner.loop.acc = phi i32 [ %inner.loop.acc.next, %inner.loop ], [ %outer.loop.acc, %inner.loop.pr…
83 …%outer.loop.acc.next = phi i32 [ %inner.loop.acc.next, %inner.loop ], [ %outer.loop.acc, %outer.lo…
144 %outer.loop.acc = phi i32 [ %outer.loop.acc.next, %outer.loop.inc ], [ 0, %outer.loop.preheader ]
154 …%inner.loop.acc = phi i32 [ %inner.loop.acc.next, %inner.loop ], [ %outer.loop.acc, %inner.loop.pr…
170 …%outer.loop.acc.next = phi i32 [ %inner.loop.acc.next, %inner.loop ], [ %outer.loop.acc, %outer.lo…
233 %outer.loop.acc = phi i32 [ %outer.loop.acc.next, %outer.loop.inc ], [ 0, %outer.loop.preheader ]
242 …%inner.loop.acc = phi i32 [ %inner.loop.acc.next, %inner.loop ], [ %outer.loop.acc, %inner.loop.pr…
258 …%outer.loop.acc.next = phi i32 [ %inner.loop.acc.next, %inner.loop ], [ %outer.loop.acc, %outer.lo…
328 …%inner.loop.acc = phi i32 [ %inner.loop.acc.next, %inner.loop ], [ %outer.loop.acc, %inner.loop.pr…
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/LoopInstSimplify/
H A Dbasic.ll23 loop:
54 loop:
63 %x.lcssa = phi i32 [ %x.loop, %loop ]
91 loop:
96 br i1 %x.cmp, label %loop.lhs, label %loop.rhs
98 loop.lhs:
102 loop.rhs:
113 %x.lcssa = phi i32 [ %x.loop, %loop.latch ]
142 loop:
150 %x.inner.loop = phi i32 [ %x.add, %loop ], [ %x.inner.add, %loop.inner ]
[all …]
/llvm-project-15.0.7/llvm/docs/
H A DTransformMetadata.rst69 different loop or the loop not existing anymore. To avoid having to
90 ``llvm.loop.vectorize.enable`` and ``llvm.loop.unroll.enable`` are
106 all attributes from the original loop excluding its loop vectorizer
158 the vectorized loop. If not specified, ``llvm.loop.isvectorized`` is
174 ``llvm.loop.vectorize.followup_all`` which avoids that the loop
186 If the loop has been unrolled fully, there is no followup-loop. For
214 remainder loop. If not specified the remainder loop will have no
271 ``llvm.loop.unroll_and_jam.followup_remainder_outer`` sets the loop
276 ``llvm.loop.unroll_and_jam.followup_remainder_inner`` sets the loop
295 loop non-vectorizable). Conceptually, it transforms a loop such as
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/LoopUnroll/
H A Dpeel-loop-not-forced.ll8 ; CHECK: loop:
14 br label %loop
16 loop:
42 br label %loop
44 loop:
73 br label %loop
75 loop:
107 br label %loop
109 loop:
144 loop:
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/LoopRotate/
H A Dpr51981-scev-problem.ll3 ; RUN: opt < %s -passes='loop(canon-freeze),loop(loop-rotate),print<scalar-evolution>' -disable-out…
24 ; CHECK-SCEV: %iv = phi i16 [ %narrow, %loop.inner.ph ], [ %iv.plus, %loop.inner ]
34 ; CHECK-SCEV: %iv = phi i16 [ %narrow, %loop.inner.ph ], [ %iv.plus, %loop.inner ]
43 br label %loop.outer.header
45 loop.outer.header: ; preds = %loop.outer.latch, %entry
49 loop.inner.ph: ; preds = %loop.outer.header
51 br label %loop.inner
53 loop.inner: ; preds = %loop.inner, %loop.inner.ph
54 %iv = phi i16 [ %narrow, %loop.inner.ph ], [ %iv.plus, %loop.inner ]
60 br i1 %cmp, label %loop.inner, label %loop.outer.latch
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/IndVarSimplify/
H A Dsharpen-range.ll16 loop.preheader:
19 loop:
20 ; CHECK: loop
26 loop.next:
53 loop:
54 ; CHECK: loop
60 loop.next:
86 loop.begin:
91 br i1 %cmp, label %loop, label %loop.end
93 loop:
[all …]
/llvm-project-15.0.7/lldb/unittests/Host/
H A DMainLoopTest.cpp61 loop.RequestTermination(); in make_callback()
74 MainLoop loop; in TEST_F() local
90 MainLoop loop; in TEST_F() local
106 MainLoop loop; in TEST_F() local
110 [&](MainLoopBase &loop) { in TEST_F() argument
128 MainLoop loop; in TEST_F() local
135 loop.AddPendingCallback([&](MainLoopBase &loop) { in TEST_F() argument
161 MainLoop loop; in TEST_F() local
172 MainLoop loop; in TEST_F() local
185 MainLoop loop; in TEST_F() local
[all …]

12345678910>>...133