1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
|
; Basic testcases - these are only tested by inspection, but illustrate the
; basic cases PRE can handle.
;
; RUN: as < %s | opt -pre -disable-output
declare void %use(int)
declare int %get()
void %test0(int %A, int %B) { ;; Fully redundant
%X = add int %A, %B
%Y = add int %A, %B
call void %use(int %X)
call void %use(int %Y)
ret void
}
void %test1(int %cond, int %A, int %B) {
switch int %cond, label %Out [
int 1, label %B1
int 2, label %B2
int 3, label %Cont ]
B1:
%X1 = add int %A, %B
call void %use(int %X1)
br label %Cont
B2:
%X2 = add int %A, %B
call void %use(int %X2)
br label %Cont
Cont:
br label %Next
Next:
%X3 = add int %A, %B
call void %use(int %X3)
br label %Out
Out:
ret void
}
void %testloop(bool %cond, int %A, int %B) {
br label %Loop
Loop:
%C = add int %A, %B ; loop invariant
call void %use(int %C)
%D = add int %C, %B
call void %use(int %D)
br bool %cond, label %Loop, label %Exit
Exit:
ret void
}
void %test3(bool %cond, int %A, int %B) {
br bool %cond, label %A, label %B
A:
%C = add int %A, %B
call void %use(int %C)
br label %Merge
B:
%D = add int %A, %B
call void %use(int %D)
br label %Merge
Merge:
%E = add int %A, %B
call void %use(int %E)
ret void
}
void %test4(bool %cond, int %A, int %B) {
br bool %cond, label %A, label %B
A:
br label %Merge
B:
%D = add int %A, %B
call void %use(int %D)
br label %Merge
Merge:
%E = add int %A, %B
call void %use(int %E)
ret void
}
int %test5(bool %cond, int %A, int %B) {
br label %Loop
Loop:
br bool %cond, label %A, label %B
A:
br label %Merge
B:
%D = add int %A, %B
call void %use(int %D)
br label %Merge
Merge:
br bool %cond, label %Loop, label %Out
Out:
%E = add int %A, %B
ret int %E
}
void %test6(bool %cond, int %A, int %B) {
br bool %cond, label %A1, label %Def
A1: br label %Around
Def:
%C = add int %A, %B
call void %use(int %C)
br bool %cond, label %F1, label %F2
F1: br label %Around
F2: br label %Y
Around:
br label %Y
Y:
%D = add int %A, %B
call void %use(int %D)
ret void
}
void %testloop-load(bool %cond, int* %P, int* %Q) {
br label %Loop
Loop:
store int 5, int* %Q ;; Q may alias P
%D = load int* %P ;; Should not hoist load out of loop
call void %use(int %D)
br bool %cond, label %Loop, label %Exit
Exit:
ret void
}
void %test7(bool %cond) { ;; Test anticipatibility
br label %Loop
Loop:
%A = call int %get()
%B = add int %A, %A ; Cannot hoist from loop
call void %use(int %B)
br bool %cond, label %Loop, label %Exit
Exit:
ret void
}
void %test8(bool %cond, int %A, int %B) { ;; Test irreducible loop
br bool %cond, label %LoopHead, label %LoopMiddle
LoopHead:
%C = add int %A, %B ; Should hoist from loop
call void %use(int %C)
br label %LoopMiddle
LoopMiddle:
br bool %cond, label %LoopHead, label %Exit
Exit:
%D = add int %A, %B
call void %use(int %D)
ret void
}
void %test9(bool %cond, int %A, int %B) { ;; Test irreducible loop
br bool %cond, label %LoopHead, label %LoopMiddle
LoopHead:
call int %get() ; random function call
br label %LoopMiddle
LoopMiddle:
%C = add int %A, %B ; Should hoist from loop
call void %use(int %C)
br bool %cond, label %LoopHead, label %Exit
Exit:
ret void
}
|
