| blob | 97b11fec08b9c9c236bdf766833e28a676aaa6fe |
1 ; RUN: opt -enable-new-pm=0 -mtriple=x86_64-- -O3 -debug-pass=Structure < %s -o /dev/null 2>&1 | FileCheck --check-prefixes=CHECK,%llvmcheckext %s
3 ; REQUIRES: asserts
5 ; CHECK-LABEL: Pass Arguments:
6 ; CHECK-NEXT: Target Transform Information
7 ; CHECK-NEXT: Type-Based Alias Analysis
8 ; CHECK-NEXT: Scoped NoAlias Alias Analysis
9 ; CHECK-NEXT: Assumption Cache Tracker
10 ; CHECK-NEXT: Target Library Information
11 ; CHECK-NEXT: FunctionPass Manager
12 ; CHECK-NEXT: Module Verifier
13 ; CHECK-EXT: Good Bye World Pass
14 ; CHECK-NOEXT-NOT: Good Bye World Pass
15 ; CHECK-NEXT: Lower 'expect' Intrinsics
16 ; CHECK-NEXT: Simplify the CFG
17 ; CHECK-NEXT: Dominator Tree Construction
18 ; CHECK-NEXT: SROA
19 ; CHECK-NEXT: Early CSE
20 ; CHECK-NEXT: Pass Arguments:
21 ; CHECK-NEXT: Target Library Information
22 ; CHECK-NEXT: Target Transform Information
23 ; Target Pass Configuration
24 ; CHECK: Type-Based Alias Analysis
25 ; CHECK-NEXT: Scoped NoAlias Alias Analysis
26 ; CHECK-NEXT: Assumption Cache Tracker
27 ; CHECK-NEXT: Profile summary info
28 ; CHECK-NEXT: ModulePass Manager
29 ; CHECK-NEXT: Annotation2Metadata
30 ; CHECK-NEXT: Force set function attributes
31 ; CHECK-NEXT: Infer set function attributes
32 ; CHECK-NEXT: FunctionPass Manager
33 ; CHECK-NEXT: Dominator Tree Construction
34 ; CHECK-NEXT: Call-site splitting
35 ; CHECK-NEXT: Interprocedural Sparse Conditional Constant Propagation
36 ; CHECK-NEXT: FunctionPass Manager
37 ; CHECK-NEXT: Dominator Tree Construction
38 ; CHECK-NEXT: Called Value Propagation
39 ; CHECK-NEXT: Global Variable Optimizer
40 ; CHECK-NEXT: FunctionPass Manager
41 ; CHECK-NEXT: Dominator Tree Construction
42 ; CHECK-NEXT: Natural Loop Information
43 ; CHECK-NEXT: Post-Dominator Tree Construction
44 ; CHECK-NEXT: Branch Probability Analysis
45 ; CHECK-NEXT: Block Frequency Analysis
46 ; CHECK-NEXT: FunctionPass Manager
47 ; CHECK-NEXT: Dominator Tree Construction
48 ; CHECK-NEXT: Promote Memory to Register
49 ; CHECK-NEXT: Dead Argument Elimination
50 ; CHECK-NEXT: FunctionPass Manager
51 ; CHECK-NEXT: Dominator Tree Construction
52 ; CHECK-NEXT: Basic Alias Analysis (stateless AA impl)
53 ; CHECK-NEXT: Function Alias Analysis Results
54 ; CHECK-NEXT: Natural Loop Information
55 ; CHECK-NEXT: Lazy Branch Probability Analysis
56 ; CHECK-NEXT: Lazy Block Frequency Analysis
57 ; CHECK-NEXT: Optimization Remark Emitter
58 ; CHECK-NEXT: Combine redundant instructions
59 ; CHECK-NEXT: Simplify the CFG
60 ; CHECK-NEXT: CallGraph Construction
61 ; CHECK-NEXT: Globals Alias Analysis
62 ; CHECK-NEXT: Call Graph SCC Pass Manager
63 ; CHECK-NEXT: Remove unused exception handling info
64 ; CHECK-NEXT: Function Integration/Inlining
65 ; CHECK-NEXT: OpenMP specific optimizations
66 ; CHECK-NEXT: Deduce function attributes
67 ; CHECK-NEXT: Promote 'by reference' arguments to scalars
68 ; CHECK-NEXT: FunctionPass Manager
69 ; CHECK-NEXT: Dominator Tree Construction
70 ; CHECK-NEXT: SROA
71 ; CHECK-NEXT: Basic Alias Analysis (stateless AA impl)
72 ; CHECK-NEXT: Function Alias Analysis Results
73 ; CHECK-NEXT: Memory SSA
74 ; CHECK-NEXT: Early CSE w/ MemorySSA
75 ; CHECK-NEXT: Speculatively execute instructions if target has divergent branches
76 ; CHECK-NEXT: Function Alias Analysis Results
77 ; CHECK-NEXT: Lazy Value Information Analysis
78 ; CHECK-NEXT: Jump Threading
79 ; CHECK-NEXT: Value Propagation
80 ; CHECK-NEXT: Simplify the CFG
81 ; CHECK-NEXT: Dominator Tree Construction
82 ; CHECK-NEXT: Combine pattern based expressions
83 ; CHECK-NEXT: Basic Alias Analysis (stateless AA impl)
84 ; CHECK-NEXT: Function Alias Analysis Results
85 ; CHECK-NEXT: Natural Loop Information
86 ; CHECK-NEXT: Lazy Branch Probability Analysis
87 ; CHECK-NEXT: Lazy Block Frequency Analysis
88 ; CHECK-NEXT: Optimization Remark Emitter
89 ; CHECK-NEXT: Combine redundant instructions
90 ; CHECK-NEXT: Conditionally eliminate dead library calls
91 ; CHECK-NEXT: Natural Loop Information
92 ; CHECK-NEXT: Post-Dominator Tree Construction
93 ; CHECK-NEXT: Branch Probability Analysis
94 ; CHECK-NEXT: Block Frequency Analysis
95 ; CHECK-NEXT: Lazy Branch Probability Analysis
96 ; CHECK-NEXT: Lazy Block Frequency Analysis
97 ; CHECK-NEXT: Optimization Remark Emitter
98 ; CHECK-NEXT: PGOMemOPSize
99 ; CHECK-NEXT: Basic Alias Analysis (stateless AA impl)
100 ; CHECK-NEXT: Function Alias Analysis Results
101 ; CHECK-NEXT: Natural Loop Information
102 ; CHECK-NEXT: Lazy Branch Probability Analysis
103 ; CHECK-NEXT: Lazy Block Frequency Analysis
104 ; CHECK-NEXT: Optimization Remark Emitter
105 ; CHECK-NEXT: Tail Call Elimination
106 ; CHECK-NEXT: Simplify the CFG
107 ; CHECK-NEXT: Reassociate expressions
108 ; CHECK-NEXT: Dominator Tree Construction
109 ; CHECK-NEXT: Basic Alias Analysis (stateless AA impl)
110 ; CHECK-NEXT: Function Alias Analysis Results
111 ; CHECK-NEXT: Memory SSA
112 ; CHECK-NEXT: Natural Loop Information
113 ; CHECK-NEXT: Canonicalize natural loops
114 ; CHECK-NEXT: LCSSA Verifier
115 ; CHECK-NEXT: Loop-Closed SSA Form Pass
116 ; CHECK-NEXT: Scalar Evolution Analysis
117 ; CHECK-NEXT: Lazy Branch Probability Analysis
118 ; CHECK-NEXT: Lazy Block Frequency Analysis
119 ; CHECK-NEXT: Loop Pass Manager
120 ; CHECK-NEXT: Loop Invariant Code Motion
121 ; CHECK-NEXT: Rotate Loops
122 ; CHECK-NEXT: Loop Invariant Code Motion
123 ; CHECK-NEXT: Unswitch loops
124 ; CHECK-NEXT: Simplify the CFG
125 ; CHECK-NEXT: Dominator Tree Construction
126 ; CHECK-NEXT: Basic Alias Analysis (stateless AA impl)
127 ; CHECK-NEXT: Function Alias Analysis Results
128 ; CHECK-NEXT: Natural Loop Information
129 ; CHECK-NEXT: Lazy Branch Probability Analysis
130 ; CHECK-NEXT: Lazy Block Frequency Analysis
131 ; CHECK-NEXT: Optimization Remark Emitter
132 ; CHECK-NEXT: Combine redundant instructions
133 ; CHECK-NEXT: Canonicalize natural loops
134 ; CHECK-NEXT: LCSSA Verifier
135 ; CHECK-NEXT: Loop-Closed SSA Form Pass
136 ; CHECK-NEXT: Scalar Evolution Analysis
137 ; CHECK-NEXT: Loop Pass Manager
138 ; CHECK-NEXT: Recognize loop idioms
139 ; CHECK-NEXT: Induction Variable Simplification
140 ; CHECK-NEXT: Delete dead loops
141 ; CHECK-NEXT: Unroll loops
142 ; CHECK-NEXT: SROA
143 ; CHECK-NEXT: Function Alias Analysis Results
144 ; CHECK-NEXT: MergedLoadStoreMotion
145 ; CHECK-NEXT: Phi Values Analysis
146 ; CHECK-NEXT: Function Alias Analysis Results
147 ; CHECK-NEXT: Memory Dependence Analysis
148 ; CHECK-NEXT: Lazy Branch Probability Analysis
149 ; CHECK-NEXT: Lazy Block Frequency Analysis
150 ; CHECK-NEXT: Optimization Remark Emitter
151 ; CHECK-NEXT: Global Value Numbering
152 ; CHECK-NEXT: Sparse Conditional Constant Propagation
153 ; CHECK-NEXT: Demanded bits analysis
154 ; CHECK-NEXT: Bit-Tracking Dead Code Elimination
155 ; CHECK-NEXT: Basic Alias Analysis (stateless AA impl)
156 ; CHECK-NEXT: Function Alias Analysis Results
157 ; CHECK-NEXT: Lazy Branch Probability Analysis
158 ; CHECK-NEXT: Lazy Block Frequency Analysis
159 ; CHECK-NEXT: Optimization Remark Emitter
160 ; CHECK-NEXT: Combine redundant instructions
161 ; CHECK-NEXT: Lazy Value Information Analysis
162 ; CHECK-NEXT: Jump Threading
163 ; CHECK-NEXT: Value Propagation
164 ; CHECK-NEXT: Post-Dominator Tree Construction
165 ; CHECK-NEXT: Aggressive Dead Code Elimination
166 ; CHECK-NEXT: Basic Alias Analysis (stateless AA impl)
167 ; CHECK-NEXT: Function Alias Analysis Results
168 ; CHECK-NEXT: Memory SSA
169 ; CHECK-NEXT: MemCpy Optimization
170 ; CHECK-NEXT: Natural Loop Information
171 ; CHECK-NEXT: Dead Store Elimination
172 ; CHECK-NEXT: Canonicalize natural loops
173 ; CHECK-NEXT: LCSSA Verifier
174 ; CHECK-NEXT: Loop-Closed SSA Form Pass
175 ; CHECK-NEXT: Function Alias Analysis Results
176 ; CHECK-NEXT: Scalar Evolution Analysis
177 ; CHECK-NEXT: Lazy Branch Probability Analysis
178 ; CHECK-NEXT: Lazy Block Frequency Analysis
179 ; CHECK-NEXT: Loop Pass Manager
180 ; CHECK-NEXT: Loop Invariant Code Motion
181 ; CHECK-NEXT: Simplify the CFG
182 ; CHECK-NEXT: Dominator Tree Construction
183 ; CHECK-NEXT: Basic Alias Analysis (stateless AA impl)
184 ; CHECK-NEXT: Function Alias Analysis Results
185 ; CHECK-NEXT: Natural Loop Information
186 ; CHECK-NEXT: Lazy Branch Probability Analysis
187 ; CHECK-NEXT: Lazy Block Frequency Analysis
188 ; CHECK-NEXT: Optimization Remark Emitter
189 ; CHECK-NEXT: Combine redundant instructions
190 ; CHECK-NEXT: A No-Op Barrier Pass
191 ; CHECK-NEXT: Eliminate Available Externally Globals
192 ; CHECK-NEXT: CallGraph Construction
193 ; CHECK-NEXT: Deduce function attributes in RPO
194 ; CHECK-NEXT: Global Variable Optimizer
195 ; CHECK-NEXT: FunctionPass Manager
196 ; CHECK-NEXT: Dominator Tree Construction
197 ; CHECK-NEXT: Natural Loop Information
198 ; CHECK-NEXT: Post-Dominator Tree Construction
199 ; CHECK-NEXT: Branch Probability Analysis
200 ; CHECK-NEXT: Block Frequency Analysis
201 ; CHECK-NEXT: Dead Global Elimination
202 ; CHECK-NEXT: CallGraph Construction
203 ; CHECK-NEXT: Globals Alias Analysis
204 ; CHECK-NEXT: FunctionPass Manager
205 ; CHECK-NEXT: Dominator Tree Construction
206 ; CHECK-NEXT: Float to int
207 ; CHECK-NEXT: Lower constant intrinsics
208 ; CHECK-NEXT: Natural Loop Information
209 ; CHECK-NEXT: Canonicalize natural loops
210 ; CHECK-NEXT: LCSSA Verifier
211 ; CHECK-NEXT: Loop-Closed SSA Form Pass
212 ; CHECK-NEXT: Basic Alias Analysis (stateless AA impl)
213 ; CHECK-NEXT: Function Alias Analysis Results
214 ; CHECK-NEXT: Scalar Evolution Analysis
215 ; CHECK-NEXT: Loop Pass Manager
216 ; CHECK-NEXT: Rotate Loops
217 ; CHECK-NEXT: Loop Access Analysis
218 ; CHECK-NEXT: Lazy Branch Probability Analysis
219 ; CHECK-NEXT: Lazy Block Frequency Analysis
220 ; CHECK-NEXT: Optimization Remark Emitter
221 ; CHECK-NEXT: Loop Distribution
222 ; CHECK-NEXT: Post-Dominator Tree Construction
223 ; CHECK-NEXT: Branch Probability Analysis
224 ; CHECK-NEXT: Block Frequency Analysis
225 ; CHECK-NEXT: Scalar Evolution Analysis
226 ; CHECK-NEXT: Basic Alias Analysis (stateless AA impl)
227 ; CHECK-NEXT: Function Alias Analysis Results
228 ; CHECK-NEXT: Loop Access Analysis
229 ; CHECK-NEXT: Demanded bits analysis
230 ; CHECK-NEXT: Lazy Branch Probability Analysis
231 ; CHECK-NEXT: Lazy Block Frequency Analysis
232 ; CHECK-NEXT: Optimization Remark Emitter
233 ; CHECK-NEXT: Inject TLI Mappings
234 ; CHECK-NEXT: Loop Vectorization
235 ; CHECK-NEXT: Canonicalize natural loops
236 ; CHECK-NEXT: Scalar Evolution Analysis
237 ; CHECK-NEXT: Function Alias Analysis Results
238 ; CHECK-NEXT: Loop Access Analysis
239 ; CHECK-NEXT: Lazy Branch Probability Analysis
240 ; CHECK-NEXT: Lazy Block Frequency Analysis
241 ; CHECK-NEXT: Loop Load Elimination
242 ; CHECK-NEXT: Basic Alias Analysis (stateless AA impl)
243 ; CHECK-NEXT: Function Alias Analysis Results
244 ; CHECK-NEXT: Lazy Branch Probability Analysis
245 ; CHECK-NEXT: Lazy Block Frequency Analysis
246 ; CHECK-NEXT: Optimization Remark Emitter
247 ; CHECK-NEXT: Combine redundant instructions
248 ; CHECK-NEXT: Simplify the CFG
249 ; CHECK-NEXT: Dominator Tree Construction
250 ; CHECK-NEXT: Natural Loop Information
251 ; CHECK-NEXT: Scalar Evolution Analysis
252 ; CHECK-NEXT: Basic Alias Analysis (stateless AA impl)
253 ; CHECK-NEXT: Function Alias Analysis Results
254 ; CHECK-NEXT: Demanded bits analysis
255 ; CHECK-NEXT: Lazy Branch Probability Analysis
256 ; CHECK-NEXT: Lazy Block Frequency Analysis
257 ; CHECK-NEXT: Optimization Remark Emitter
258 ; CHECK-NEXT: Inject TLI Mappings
259 ; CHECK-NEXT: SLP Vectorizer
260 ; CHECK-NEXT: Optimize scalar/vector ops
261 ; CHECK-NEXT: Optimization Remark Emitter
262 ; CHECK-NEXT: Combine redundant instructions
263 ; CHECK-NEXT: Canonicalize natural loops
264 ; CHECK-NEXT: LCSSA Verifier
265 ; CHECK-NEXT: Loop-Closed SSA Form Pass
266 ; CHECK-NEXT: Scalar Evolution Analysis
267 ; CHECK-NEXT: Loop Pass Manager
268 ; CHECK-NEXT: Unroll loops
269 ; CHECK-NEXT: Lazy Branch Probability Analysis
270 ; CHECK-NEXT: Lazy Block Frequency Analysis
271 ; CHECK-NEXT: Optimization Remark Emitter
272 ; CHECK-NEXT: Combine redundant instructions
273 ; CHECK-NEXT: Memory SSA
274 ; CHECK-NEXT: Canonicalize natural loops
275 ; CHECK-NEXT: LCSSA Verifier
276 ; CHECK-NEXT: Loop-Closed SSA Form Pass
277 ; CHECK-NEXT: Scalar Evolution Analysis
278 ; CHECK-NEXT: Lazy Branch Probability Analysis
279 ; CHECK-NEXT: Lazy Block Frequency Analysis
280 ; CHECK-NEXT: Loop Pass Manager
281 ; CHECK-NEXT: Loop Invariant Code Motion
282 ; CHECK-NEXT: Optimization Remark Emitter
283 ; CHECK-NEXT: Warn about non-applied transformations
284 ; CHECK-NEXT: Alignment from assumptions
285 ; CHECK-NEXT: Strip Unused Function Prototypes
286 ; CHECK-NEXT: Dead Global Elimination
287 ; CHECK-NEXT: Merge Duplicate Global Constants
288 ; CHECK-NEXT: Call Graph Profile
289 ; CHECK-NEXT: FunctionPass Manager
290 ; CHECK-NEXT: Dominator Tree Construction
291 ; CHECK-NEXT: Natural Loop Information
292 ; CHECK-NEXT: Lazy Branch Probability Analysis
293 ; CHECK-NEXT: Lazy Block Frequency Analysis
294 ; CHECK-NEXT: FunctionPass Manager
295 ; CHECK-NEXT: Dominator Tree Construction
296 ; CHECK-NEXT: Natural Loop Information
297 ; CHECK-NEXT: Post-Dominator Tree Construction
298 ; CHECK-NEXT: Branch Probability Analysis
299 ; CHECK-NEXT: Block Frequency Analysis
300 ; CHECK-NEXT: Canonicalize natural loops
301 ; CHECK-NEXT: LCSSA Verifier
302 ; CHECK-NEXT: Loop-Closed SSA Form Pass
303 ; CHECK-NEXT: Basic Alias Analysis (stateless AA impl)
304 ; CHECK-NEXT: Function Alias Analysis Results
305 ; CHECK-NEXT: Scalar Evolution Analysis
306 ; CHECK-NEXT: Block Frequency Analysis
307 ; CHECK-NEXT: Loop Pass Manager
308 ; CHECK-NEXT: Loop Sink
309 ; CHECK-NEXT: Lazy Branch Probability Analysis
310 ; CHECK-NEXT: Lazy Block Frequency Analysis
311 ; CHECK-NEXT: Optimization Remark Emitter
312 ; CHECK-NEXT: Remove redundant instructions
313 ; CHECK-NEXT: Hoist/decompose integer division and remainder
314 ; CHECK-NEXT: Simplify the CFG
315 ; CHECK-NEXT: Annotation Remarks
316 ; CHECK-NEXT: Module Verifier
317 ; CHECK-NEXT: Bitcode Writer
318 ; CHECK-NEXT: Pass Arguments:
319 ; CHECK-NEXT: FunctionPass Manager
320 ; CHECK-NEXT: Dominator Tree Construction
321 ; CHECK-NEXT: Pass Arguments:
322 ; CHECK-NEXT: Target Library Information
323 ; CHECK-NEXT: FunctionPass Manager
324 ; CHECK-NEXT: Dominator Tree Construction
325 ; CHECK-NEXT: Natural Loop Information
326 ; CHECK-NEXT: Post-Dominator Tree Construction
327 ; CHECK-NEXT: Branch Probability Analysis
328 ; CHECK-NEXT: Block Frequency Analysis
329 ; CHECK-NEXT: Pass Arguments:
330 ; CHECK-NEXT: Target Library Information
331 ; CHECK-NEXT: FunctionPass Manager
332 ; CHECK-NEXT: Dominator Tree Construction
333 ; CHECK-NEXT: Natural Loop Information
334 ; CHECK-NEXT: Post-Dominator Tree Construction
335 ; CHECK-NEXT: Branch Probability Analysis
336 ; CHECK-NEXT: Block Frequency Analysis
338 define void @f() {
339 ret void
340 }