Home
last modified time | relevance | path

Searched full:for (Results 1 – 25 of 16013) sorted by relevance

12345678910>>...641

/llvm-project/llvm/test/Analysis/BlockFrequencyInfo/
H A Dirreducible_loop_crash.ll9 br i1 %arg, label %if.end.12, label %for.body.5
11 for.inc:
13 br label %for.body.5
15 for.body.5: ; preds = %for.cond.4.preheader
16 br i1 %tobool7, label %for.inc.9, label %for.inc
18 for.inc.9: ; preds = %for.body.5
19 br i1 %tobool7, label %for
[all...]
/llvm-project/llvm/test/Transforms/LoopStrengthReduce/AArch64/
H A Dpr47329.ll10 br label %for.body9
12 for.body9: ; preds = %for.body9, %entry
13 %i = phi ptr [ %.pre.pre, %entry ], [ %incdec.ptr, %for.body9 ]
15 br i1 %arg, label %for.body9, label %for.inc
17 for.inc: ; preds = %for.body9
18 br label %for.body9.118
20 for
[all...]
/llvm-project/llvm/test/Transforms/IndVarSimplify/X86/
H A Dverify-scev.ll7 br i1 %arg, label %for.end, label %for.body
9 for.body: ; preds = %for.body, %entry
10 br i1 false, label %for.end, label %for.body
12 for.end: ; preds = %for.body, %entry
13 br i1 %arg, label %for.end11, label %for
[all...]
/llvm-project/llvm/test/Transforms/LoopVectorize/ARM/
H A Dmve-interleaved-cost.ll15 br label %for.body
18 ; VF_2: Found an estimated cost of 12 for VF 2 For instruction: %tmp2 = load i8, ptr %tmp0, align 1
19 ; VF_2-NEXT: Found an estimated cost of 12 for VF 2 For instruction: %tmp3 = load i8, ptr %tmp1, align 1
20 ; VF_2-NEXT: Found an estimated cost of 4 for VF 2 For instruction: store i8 %tmp2, ptr %tmp0, align 1
21 ; VF_2-NEXT: Found an estimated cost of 4 for VF 2 For instruction: store i8 %tmp3, ptr %tmp1, align 1
23 ; VF_4: Found an estimated cost of 4 for V
[all...]
H A Dmve-icmpcost.ll8 ; CHECK: LV: Found an estimated cost of 0 for VF 1 For instruction: %i.016 = phi i32 [ 0, %for.body.lr.ph ], [ %inc, %for.inc ]
9 ; CHECK: LV: Found an estimated cost of 0 for VF 1 For instruction: %arrayidx = getelementptr inbounds i16, ptr %s, i32 %i.016
10 ; CHECK: LV: Found an estimated cost of 1 for VF 1 For instruction: %1 = load i16, ptr %arrayidx, align 2
11 ; CHECK: LV: Found an estimated cost of 0 for VF 1 For instructio
[all...]
/llvm-project/llvm/test/Analysis/LoopNestAnalysis/
H A Dnests-with-lcssa.ll5 ; for (int i = 0; i < N; ++i) {
6 ; for (int j = 0; j < M; ++j) res += i * j;
12 ; CHECK: IsPerfect=true, Depth=1, OutermostLoop: for.j, Loops: ( for.j )
13 ; CHECK: IsPerfect=true, Depth=2, OutermostLoop: for.i, Loops: ( for.i for.j )
16 br i1 %cmp4, label %for.i.ph, label %for.i.end
18 for.i.ph: ; preds = %entry
19 br label %for.i
21 for.i: ; preds = %for.i.ph, %for.i.inc
22 %i.06 = phi i32 [ 0, %for.i.ph ], [ %inc5, %for.i.inc ]
23 %res.05 = phi i32 [ 0, %for.i.ph ], [ %res.1.lcssa, %for.i.inc ]
[all …]
/llvm-project/polly/test/CodeGen/
H A Dloop-invariant-load-type-mismatch.ll13 br label %for.body
15 for.cond.30.for.cond.loopexit_crit_edge: ; preds = %for.end.54
16 br label %for.cond.loopexit
18 for.cond.loopexit: ; preds = %for.cond.30.preheader, %for.cond.30.fo…
20 br i1 false, label %for.body, label %for.end.65
22 for.body: ; preds = %for.cond.loopexit, %entry.split
23 %indvars.iv130 = phi i32 [ 1, %entry.split ], [ %indvars.iv.next131, %for.cond.loopexit ]
24 br i1 true, label %for.body.3.lr.ph, label %for.cond.30.preheader
26 for.body.3.lr.ph: ; preds = %for.body
27 br label %for.body.3
[all …]
/llvm-project/llvm/test/Analysis/ScalarEvolution/
H A Doverflow-intrinsics-trip-count.ll13 ; CHECK-NEXT: Determining loop execution counts for: @uadd_exhaustive
14 ; CHECK-NEXT: Loop %for.body: backedge-taken count is i16 35
15 ; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is i16 35
16 ; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is i16 35
17 ; CHECK-NEXT: Loop %for.body: Trip multiple is 36
20 br i1 %arg, label %for.end, label %for.body.preheader
22 for.body.preheader: ; preds = %entry
23 br label %for.body
25 for
[all...]
H A Dtrip-count-implied-addrec.ll14 ; CHECK-NEXT: Determining loop execution counts for: @nw_implies_nuw
15 ; CHECK-NEXT: Loop %for.body: backedge-taken count is %n
16 ; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is i16 -1
17 ; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is %n
18 ; CHECK-NEXT: Loop %for.body: Trip multiple is 1
21 br label %for.body
23 for.body: ; preds = %entry, %for.body
24 %iv = phi i8 [ %iv.next, %for.body ], [ 0, %entry ]
28 br i1 %cmp, label %for
[all...]
H A Dtrip-count-negative-stride.ll5 ; for negative steps.
14 ; CHECK-NEXT: Determining loop execution counts for: @ult_wrap
15 ; CHECK-NEXT: Loop %for.body: Unpredictable backedge-taken count.
16 ; CHECK-NEXT: Loop %for.body: Unpredictable constant max backedge-taken count.
17 ; CHECK-NEXT: Loop %for.body: Unpredictable symbolic max backedge-taken count.
20 br label %for.body
22 for.body: ; preds = %entry, %for.body
23 %i.05 = phi i8 [ %add, %for.body ], [ 0, %entry ]
26 br i1 %cmp, label %for.body, label %for.end
28 for.end: ; preds = %for.body, %entry
[all …]
H A Dne-overflow.ll12 ; CHECK-NEXT: Determining loop execution counts for: @test
13 ; CHECK-NEXT: Loop %for.body: backedge-taken count is ((-2 + %N) /u 2)
14 ; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is i32 2147483647
15 ; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is ((-2 + %N) /u 2)
16 ; CHECK-NEXT: Loop %for.body: Trip multiple is 1
19 br label %for.body
21 for.body:
22 %iv = phi i32 [ %iv.next, %for.body ], [ 0, %entry ]
25 br i1 %cmp, label %for.body, label %for
[all...]
/llvm-project/llvm/test/Transforms/LoopDeletion/
H A Dupdate-scev.ll4 ; Checking for a crash. Loop-deletion would change the loop
13 br label %for.cond
15 for.cond: ; preds = %for.cond14, %entry
16 %f.0 = phi i32 [ 20, %entry ], [ 0, %for.cond14 ]
17 br label %for.body
19 for.body: ; preds = %for.inc11, %for.cond
20 ; IR-AFTER-TRANSFORM: for.body:
23 ; IR-AFTER-TRANSFORM: for.body6:
27 ; SCEV-EXPRS-NEXT: --> {{.*}} LoopDispositions: { %for.body: Variant, %for.cond: Variant, %for.bo…
28 %val = phi i32 [ -20, %for.cond ], [ %inc12, %for.inc11 ]
[all …]
/llvm-project/llvm/test/Analysis/DependenceAnalysis/
H A DDADelin.ll8 ;; for (int i = 0; i < n; i++)
9 ;; for (int j = 0; j < m; j++)
10 ;; for (int k = 0; k < o; k++)
24 br i1 %cmp49, label %for.cond1.preheader.lr.ph, label %for.cond.cleanup
26 for.cond1.preheader.lr.ph: ; preds = %entry
29 br label %for.cond1.preheader
31 for.cond1.preheader: ; preds = %for.cond.cleanup3, %for
[all...]
H A DSymbolicRDIV.ll10 ;; for (long int i = 0; i < n1; i++)
12 ;; for (long int j = 0; j < n2; j++)
32 br i1 %cmp4, label %for.cond1.preheader, label %for.body.preheader
34 for.body.preheader: ; preds = %entry
35 br label %for.body
37 for.cond1.preheader.loopexit: ; preds = %for.body
38 br label %for.cond1.preheader
40 for
[all...]
H A DPreliminary.ll51 ;; for (long int i = 0; i < n; i++) {
52 ;; for (long int j = 0; j < n; j++) {
53 ;; for (long int k = 0; k < n; k++) {
56 ;; for (long int k = 0; k < n; k++) {
76 br i1 %cmp10, label %for.cond1.preheader.preheader, label %for.end26
78 for.cond1.preheader.preheader: ; preds = %entry
79 br label %for.cond1.preheader
81 for.cond1.preheader: ; preds = %for
[all...]
/llvm-project/llvm/test/Transforms/LoopUnrollAndJam/
H A Ddisable.ll6 ;; Common check for all tests. None should be unroll and jammed
11 ; Tests for(i) { sum = A[i]; for(j) sum += B[j]; A[i+1] = sum; }
14 ; CHECK: %i.029 = phi i32 [ %add10, %for.latch ], [ 0, %for.preheader ]
15 ; CHECK: %j.026 = phi i32 [ 0, %for.outer ], [ %inc, %for.inner ]
20 br i1 %or.cond, label %for.preheader, label %return
22 for.preheader:
23 br label %for.outer
25 for.outer:
26 %i.029 = phi i32 [ %add10, %for.latch ], [ 0, %for.preheader ]
27 %b.028 = phi i32 [ %inc8, %for.latch ], [ 1, %for.preheader ]
[all …]
/llvm-project/llvm/test/Transforms/LoopFlatten/
H A Dloop-flatten-negative.ll14 br i1 %cmp25, label %for.body4.lr.ph, label %for.cond.cleanup
16 for.body4.lr.ph:
17 %i.026 = phi i32 [ %inc10, %for.cond.cleanup3 ], [ 1, %entry ]
19 br label %for.body4
21 for.body4:
22 %j.024 = phi i32 [ 0, %for.body4.lr.ph ], [ %inc, %for.body4 ]
31 br i1 %exitcond, label %for.cond.cleanup3, label %for.body4
33 for.cond.cleanup3:
36 br i1 %exitcond27, label %for.cond.cleanup, label %for.body4.lr.ph
38 for.cond.cleanup:
[all …]
H A Dloop-flatten.ll9 br label %for.body
12 ; CHECK: br label %for.body
14 for.body: ; preds = %entry, %for.inc6
15 %i.018 = phi i32 [ 0, %entry ], [ %inc7, %for.inc6 ]
17 br label %for.body3
18 ; CHECK: for.body:
19 ; CHECK: %i.018 = phi i32 [ 0, %entry ], [ %inc7, %for.inc6 ]
21 ; CHECK: br label %for.body3
23 for.body3: ; preds = %for.body, %for.body3
24 %j.017 = phi i32 [ 0, %for.body ], [ %inc, %for.body3 ]
[all …]
/llvm-project/llvm/test/Transforms/IndVarSimplify/
H A Dlftr-pr20680.ll20 ; CHECK: for.cond2.preheader:
23 ; CHECK: for.body3.lr.ph:
25 ; CHECK: for.body3.lr.ph.for.body3.lr.ph.split_crit_edge:
27 ; CHECK: for.body3.lr.ph.split.us:
29 ; CHECK: for.body3.lr.ph.split.us.for.body3.lr.ph.split.us.split_crit_edge:
31 ; CHECK: for.body3.lr.ph.split.us.split.us:
33 ; CHECK: for.body3.us.us:
41 ; CHECK: for.cond2.loopexit.us.us:
43 ; CHECK: for.inc.lr.ph.us.us:
45 ; CHECK: for.cond8.for.cond2.loopexit_crit_edge.us.us:
[all …]
/llvm-project/polly/test/ScopDetect/
H A Donly-one-affine-loop.ll7 ; CHECK: Valid Region for Scop: for.cond => for.end.51
10 ; for (int i = 0; i < 100; i++) {
12 ; for (int j = 0; j < i * i; j++)
13 ; for (int k = 0; k < i; k++)
16 ; for (int j = 0; j < i * i; j++)
18 ; for (int k = 0; k < j; k++)
22 ; for (int j = 0; j < 100; j++)
23 ; for (int k = 0; k < j * j; k++)
32 br label %for.cond
34 for.cond: ; preds = %for.inc.49, %entry
[all …]
/llvm-project/polly/test/ScheduleOptimizer/
H A Dtile_after_fusion.ll5 ; for (int i = 0; i < 256; ++i)
6 ; for (int j = 0; j < 256; ++j)
7 ; for (int k = 0; k < 256; ++k)
10 ; for (int i = 0; i < 256; ++i)
11 ; for (int j = 0; j < 256; ++j)
12 ; for (int k = 0; k < 256; ++k)
20 ; CHECK-LABEL: :: isl ast :: tf :: %for.cond---%for.end56
22 ; CHECK-NEXT: for (int c0 = 0; c0 <= 7; c0 += 1)
23 ; CHECK-NEXT: for (int c1 = 0; c1 <= 7; c1 += 1)
24 ; CHECK-NEXT: for (int c2 = 0; c2 <= 7; c2 += 1) {
[all …]
/llvm-project/clang/test/OpenMP/Inputs/
H A Dnesting_of_regions.cpp8 #pragma omp for in foo()
9 for (int i = 0; i < 10; ++i) in foo()
13 for (int i = 0; i < 10; ++i) in foo()
16 #pragma omp for simd in foo()
17 for (int i = 0; i < 10; ++i) in foo()
44 #pragma omp parallel for in foo()
45 for (int i = 0; i < 10; ++i) in foo()
48 #pragma omp parallel for simd in foo()
49 for (int i = 0; i < 10; ++i) in foo()
83 #pragma omp scan // expected-error {{region cannot be closely nested inside 'parallel' region; perhaps you forget to enclose 'omp scan' directive into a for, sim in foo()
[all...]
/llvm-project/llvm/test/CodeGen/PowerPC/
H A Dctrloop-le.ll11 br i1 %cmp3, label %for.body.lr.ph, label %for.end
13 for.body.lr.ph: ; preds = %entry
14 br label %for.body
16 for.body: ; preds = %for.body.lr.ph, %for.body
17 %i.04 = phi i32 [ 28395, %for.body.lr.ph ], [ %inc, %for.body ]
26 br i1 %cmp, label %for.body, label %for.end
28 for.end: ; preds = %for.body, %entry
40 br i1 %cmp3, label %for.body.lr.ph, label %for.end
42 for.body.lr.ph: ; preds = %entry
43 br label %for.body
[all …]
H A Dctrloop-ne.ll11 br i1 %cmp3, label %for.body.lr.ph, label %for.end
13 for.body.lr.ph: ; preds = %entry
14 br label %for.body
16 for.body: ; preds = %for.body.lr.ph, %for.body
17 %i.04 = phi i32 [ 32623, %for.body.lr.ph ], [ %inc, %for.body ]
26 br i1 %cmp, label %for.body, label %for.end
28 for.end: ; preds = %for.body, %entry
40 br i1 %cmp3, label %for.body.lr.ph, label %for.end
42 for.body.lr.ph: ; preds = %entry
43 br label %for.body
[all …]
H A Dctrloop-lt.ll11 br i1 %cmp3, label %for.body.lr.ph, label %for.end
13 for.body.lr.ph: ; preds = %entry
14 br label %for.body
16 for.body: ; preds = %for.body.lr.ph, %for.body
17 %i.04 = phi i32 [ 8531, %for.body.lr.ph ], [ %inc, %for.body ]
26 br i1 %cmp, label %for.body, label %for.end
28 for.end: ; preds = %for.body, %entry
40 br i1 %cmp3, label %for.body.lr.ph, label %for.end
42 for.body.lr.ph: ; preds = %entry
43 br label %for.body
[all …]

12345678910>>...641