Debian Codegraph @

llvm/test/Transforms/LoopInterchange/pr43326.ll

raw
1 ; RUN: opt < %s -passes=loop-interchange -cache-line-size=64 -pass-remarks-missed='loop-interchange' -pass-remarks-output=%t -S \
2 ; RUN: -verify-dom-info -verify-loop-info -verify-loop-lcssa -loop-interchange-profitabilities=ignore -stats 2>&1
3 ; RUN: FileCheck --input-file=%t --check-prefix=REMARKS %s
4
5 @a = global i32 0
6 @b = global i8 0
7 @c = global i32 0
8 @d = global i32 0
9 @e = global [1 x [1 x i32]] zeroinitializer
10
11 ; REMARKS: --- !Analysis
12 ; REMARKS-NEXT: Pass: loop-interchange
13 ; REMARKS-NEXT: Name: Dependence
14 ; REMARKS-NEXT: Function: pr43326
15 ; REMARKS-NEXT: Args:
16 ; REMARKS-NEXT: - String: Computed dependence info, invoking the transform.
17 ; REMARKS-NEXT: ...
18
19 ; REMARKS: --- !Passed
20 ; REMARKS-NEXT: Pass: loop-interchange
21 ; REMARKS-NEXT: Name: Interchanged
22 ; REMARKS-NEXT: Function: pr43326
23
24 define void @pr43326() {
25 entry:
26 %0 = load i32, ptr @a
27 %tobool.not2 = icmp eq i32 %0, 0
28 br i1 %tobool.not2, label %for.end14, label %outer.preheader
29
30 outer.preheader: ; preds = %entry
31 %d.promoted = load i32, ptr @d
32 %a.promoted = load i32, ptr @a
33 br label %outer.header
34
35 outer.header: ; preds = %outer.preheader, %for.inc12
36 %inc1312 = phi i32 [ %a.promoted, %outer.preheader ], [ %inc13, %for.inc12 ]
37 %xor.lcssa.lcssa11 = phi i32 [ %d.promoted, %outer.preheader ], [ %xor.lcssa.lcssa, %for.inc12 ]
38 br label %inner1.header
39
40 inner1.header: ; preds = %outer.header, %for.inc10
41 %xor.lcssa9 = phi i32 [ %xor.lcssa.lcssa11, %outer.header ], [ %xor.lcssa, %for.inc10 ]
42 %j = phi i8 [ 0, %outer.header ], [ %j.next, %for.inc10 ]
43 %idxprom8 = sext i8 %j to i64
44 br label %inner2.header
45
46 inner2.header: ; preds = %inner1.header, %for.inc
47 %xor5 = phi i32 [ %xor.lcssa9, %inner1.header ], [ %xor, %for.inc ]
48 %k = phi i32 [ 0, %inner1.header ], [ %k.next, %for.inc ]
49 %idxprom = sext i32 %k to i64
50 %arrayidx9 = getelementptr inbounds [1 x [1 x i32]], ptr @e, i64 0, i64 %idxprom, i64 %idxprom8
51 %1 = load i32, ptr %arrayidx9
52 %xor = xor i32 %xor5, %1
53 br label %for.inc
54
55 for.inc: ; preds = %inner2.header
56 %k.next = add nsw i32 %k, 1
57 %cmp5 = icmp slt i32 %k.next, 42
58 br i1 %cmp5, label %inner2.header, label %for.end
59
60 for.end: ; preds = %for.inc
61 %xor.lcssa = phi i32 [ %xor, %for.inc ]
62 %inc.lcssa = phi i32 [ %k.next, %for.inc ]
63 br label %for.inc10
64
65 for.inc10: ; preds = %for.end
66 %j.next = add i8 %j, -1
67 %cmp = icmp sgt i8 %j.next, -10
68 br i1 %cmp, label %inner1.header, label %for.end11
69
70 for.end11: ; preds = %for.inc10
71 %xor.lcssa.lcssa = phi i32 [ %xor.lcssa, %for.inc10 ]
72 %dec.lcssa = phi i8 [ %j.next, %for.inc10 ]
73 %inc.lcssa.lcssa = phi i32 [ %inc.lcssa, %for.inc10 ]
74 br label %for.inc12
75
76 for.inc12: ; preds = %for.end11
77 %inc13 = add nsw i32 %inc1312, 1
78 %tobool.not = icmp slt i32 %inc13, 42
79 br i1 %tobool.not, label %outer.header, label %for.cond.for.end14_crit_edge
80
81 for.cond.for.end14_crit_edge: ; preds = %for.inc12
82 %inc13.lcssa = phi i32 [ %inc13, %for.inc12 ]
83 %inc.lcssa.lcssa.lcssa = phi i32 [ %inc.lcssa.lcssa, %for.inc12 ]
84 %xor.lcssa.lcssa.lcssa = phi i32 [ %xor.lcssa.lcssa, %for.inc12 ]
85 %dec.lcssa.lcssa = phi i8 [ %dec.lcssa, %for.inc12 ]
86 store i8 %dec.lcssa.lcssa, ptr @b
87 store i32 %xor.lcssa.lcssa.lcssa, ptr @d
88 store i32 %inc.lcssa.lcssa.lcssa, ptr @c
89 store i32 %inc13.lcssa, ptr @a
90 br label %for.end14
91
92 for.end14: ; preds = %for.cond.for.end14_crit_edge, %entry
93 ret void
94 }