Debian Codegraph @

llvm/test/tools/UpdateTestChecks/update_analyze_test_checks/Inputs/loop-distribute.ll.expected

raw
1 ; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
2 ; RUN: opt -passes=loop-distribute -enable-loop-distribute \
3 ; RUN: -debug-only=loop-distribute -disable-output 2>&1 %s | FileCheck %s
4
5 define void @ldist(i1 %cond, ptr %A, ptr %B, ptr %C) {
6 ; CHECK-LABEL: 'ldist'
7 ; CHECK-NEXT: LDist: Found a candidate loop: for.body
8 ; CHECK-NEXT: LDist: Backward dependences:
9 ; CHECK-NEXT: Unknown:
10 ; CHECK-NEXT: %lv3 = load i16, ptr %c.sink, align 2 ->
11 ; CHECK-NEXT: store i16 %add, ptr %c.sink, align 1
12 ; CHECK-NEXT: Unknown:
13 ; CHECK-NEXT: %lv3 = load i16, ptr %c.sink, align 2 ->
14 ; CHECK-NEXT: store i16 %add, ptr %c.sink, align 1
15 ; CHECK-NEXT: LDist: Seeded partitions:
16 ; CHECK-NEXT: LDist: Partition 0:
17 ; CHECK-NEXT: for.body: %lv = load i16, ptr %A, align 1
18 ; CHECK-NEXT: LDist: Partition 1:
19 ; CHECK-NEXT: for.body: store i16 %lv, ptr %A, align 1
20 ; CHECK-NEXT: LDist: Partition 2:
21 ; CHECK-NEXT: if.then: %lv2 = load i16, ptr %A, align 1
22 ; CHECK-NEXT: LDist: Partition 3: (cycle)
23 ; CHECK-NEXT: if.end: %lv3 = load i16, ptr %c.sink, align 2
24 ; CHECK-NEXT: if.end: store i16 %add, ptr %c.sink, align 1
25 ; CHECK-NEXT: LDist: Merged partitions:
26 ; CHECK-NEXT: LDist: Partition 0:
27 ; CHECK-NEXT: for.body: %lv = load i16, ptr %A, align 1
28 ; CHECK-NEXT: for.body: store i16 %lv, ptr %A, align 1
29 ; CHECK-NEXT: if.then: %lv2 = load i16, ptr %A, align 1
30 ; CHECK-NEXT: LDist: Partition 1: (cycle)
31 ; CHECK-NEXT: if.end: %lv3 = load i16, ptr %c.sink, align 2
32 ; CHECK-NEXT: if.end: store i16 %add, ptr %c.sink, align 1
33 ; CHECK-NEXT: LDist: Populated partitions:
34 ; CHECK-NEXT: LDist: Partition 0:
35 ; CHECK-NEXT: for.body: %lv = load i16, ptr %A, align 1
36 ; CHECK-NEXT: for.body: store i16 %lv, ptr %A, align 1
37 ; CHECK-NEXT: if.then: %lv2 = load i16, ptr %A, align 1
38 ; CHECK-NEXT: for.body: br i1 %cond, label %if.then, label %if.end
39 ; CHECK-NEXT: if.then: br label %if.end
40 ; CHECK-NEXT: if.end: br i1 %tobool.not, label %for.end.loopexit, label %for.body
41 ; CHECK-NEXT: if.end: %tobool.not = icmp eq i16 %iv.next, 1000
42 ; CHECK-NEXT: if.end: %iv.next = add nuw nsw i16 %iv, 1
43 ; CHECK-NEXT: for.body: %iv = phi i16 [ 0, %entry ], [ %iv.next, %if.end ]
44 ; CHECK-NEXT: LDist: Partition 1: (cycle)
45 ; CHECK-NEXT: if.end: %lv3 = load i16, ptr %c.sink, align 2
46 ; CHECK-NEXT: if.end: store i16 %add, ptr %c.sink, align 1
47 ; CHECK-NEXT: for.body: br i1 %cond, label %if.then, label %if.end
48 ; CHECK-NEXT: if.then: br label %if.end
49 ; CHECK-NEXT: if.end: br i1 %tobool.not, label %for.end.loopexit, label %for.body
50 ; CHECK-NEXT: if.end: %tobool.not = icmp eq i16 %iv.next, 1000
51 ; CHECK-NEXT: if.end: %iv.next = add nuw nsw i16 %iv, 1
52 ; CHECK-NEXT: for.body: %iv = phi i16 [ 0, %entry ], [ %iv.next, %if.end ]
53 ; CHECK-NEXT: if.end: %add = add i16 %lv3, 10
54 ; CHECK-NEXT: if.end: %c.sink = phi ptr [ %B, %if.then ], [ %C, %for.body ]
55 ; CHECK-NEXT: LDist: Distributing loop: for.body
56 ; CHECK-NEXT: LDist: Pointers:
57 ; CHECK-NEXT: Check 0:
58 ; CHECK-NEXT: Comparing group GRP0:
59 ; CHECK-NEXT: ptr %A
60 ; CHECK-NEXT: ptr %A
61 ; CHECK-NEXT: Against group GRP1:
62 ; CHECK-NEXT: ptr %C
63 ; CHECK-NEXT: ptr %C
64 ; CHECK-NEXT: Check 1:
65 ; CHECK-NEXT: Comparing group GRP0:
66 ; CHECK-NEXT: ptr %A
67 ; CHECK-NEXT: ptr %A
68 ; CHECK-NEXT: Against group GRP2:
69 ; CHECK-NEXT: ptr %B
70 ; CHECK-NEXT: ptr %B
71 ; CHECK-NEXT: LDist: After removing unused Instrs:
72 ; CHECK-NEXT: LDist: Partition 0:
73 ; CHECK-NEXT: for.body.ldist1: ; preds = %if.end.ldist1, %for.body.ph.ldist1
74 ; CHECK-NEXT: %iv.ldist1 = phi i16 [ 0, %for.body.ph.ldist1 ], [ %iv.next.ldist1, %if.end.ldist1 ]
75 ; CHECK-NEXT: %lv.ldist1 = load i16, ptr %A, align 1, !alias.scope !2, !noalias !5
76 ; CHECK-NEXT: store i16 %lv.ldist1, ptr %A, align 1, !alias.scope !2, !noalias !5
77 ; CHECK-NEXT: br i1 %cond, label %if.then.ldist1, label %if.end.ldist1
78 ; CHECK-EMPTY:
79 ; CHECK-NEXT: if.then.ldist1: ; preds = %for.body.ldist1
80 ; CHECK-NEXT: %lv2.ldist1 = load i16, ptr %A, align 1, !alias.scope !2, !noalias !5
81 ; CHECK-NEXT: br label %if.end.ldist1
82 ; CHECK-EMPTY:
83 ; CHECK-NEXT: if.end.ldist1: ; preds = %if.then.ldist1, %for.body.ldist1
84 ; CHECK-NEXT: %iv.next.ldist1 = add nuw nsw i16 %iv.ldist1, 1
85 ; CHECK-NEXT: %tobool.not.ldist1 = icmp eq i16 %iv.next.ldist1, 1000
86 ; CHECK-NEXT: br i1 %tobool.not.ldist1, label %for.body.ph, label %for.body.ldist1
87 ; CHECK-NEXT: LDist: Partition 1:
88 ; CHECK-NEXT: for.body: ; preds = %if.end, %for.body.ph
89 ; CHECK-NEXT: %iv = phi i16 [ 0, %for.body.ph ], [ %iv.next, %if.end ]
90 ; CHECK-NEXT: br i1 %cond, label %if.then, label %if.end
91 ; CHECK-EMPTY:
92 ; CHECK-NEXT: if.then: ; preds = %for.body
93 ; CHECK-NEXT: br label %if.end
94 ; CHECK-EMPTY:
95 ; CHECK-NEXT: if.end: ; preds = %if.then, %for.body
96 ; CHECK-NEXT: %c.sink = phi ptr [ %B, %if.then ], [ %C, %for.body ]
97 ; CHECK-NEXT: %lv3 = load i16, ptr %c.sink, align 2
98 ; CHECK-NEXT: %add = add i16 %lv3, 10
99 ; CHECK-NEXT: store i16 %add, ptr %c.sink, align 1
100 ; CHECK-NEXT: %iv.next = add nuw nsw i16 %iv, 1
101 ; CHECK-NEXT: %tobool.not = icmp eq i16 %iv.next, 1000
102 ; CHECK-NEXT: br i1 %tobool.not, label %for.end.loopexit.loopexit6, label %for.body
103 ;
104 entry:
105 br label %for.body
106
107 for.body: ; preds = %if.end, %entry
108 %iv = phi i16 [ 0, %entry ], [ %iv.next, %if.end ]
109 %lv = load i16, ptr %A, align 1
110 store i16 %lv, ptr %A, align 1
111 br i1 %cond, label %if.then, label %if.end
112
113 if.then: ; preds = %for.body
114 %lv2 = load i16, ptr %A, align 1
115 br label %if.end
116
117 if.end: ; preds = %if.then, %for.body
118 %c.sink = phi ptr [ %B, %if.then ], [ %C, %for.body ]
119 %lv3 = load i16, ptr %c.sink
120 %add = add i16 %lv3, 10
121 store i16 %add, ptr %c.sink, align 1
122 %iv.next = add nuw nsw i16 %iv, 1
123 %tobool.not = icmp eq i16 %iv.next, 1000
124 br i1 %tobool.not, label %for.end.loopexit, label %for.body
125
126 for.end.loopexit: ; preds = %if.end
127 ret void
128 }