1 /* Description of pass structure
2 Copyright (C
) 1987-2013 Free Software Foundation
, Inc.
4 This file is part of GCC.
6 GCC is free software
; you can redistribute it and
/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation
; either version
3, or (at your option
) any later
11 GCC is distributed in the hope that it will be useful
, but WITHOUT ANY
12 WARRANTY
; without even the implied warranty of MERCHANTABILITY or
13 FITNESS
FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC
; see the file COPYING3. If not see
18 <http
://www.gnu.org
/licenses
/>.
*/
21 Macros that should be defined when using this file
:
22 INSERT_PASSES_AFTER (PASS
)
23 PUSH_INSERT_PASSES_WITHIN (PASS
)
26 TERMINATE_PASS_LIST ()
29 /* All passes needed to lower the function into shape optimizers can
30 operate on. These passes are always run first on the function
, but
31 backend might produce already lowered functions that are not processed
33 INSERT_PASSES_AFTER (all_lowering_passes
)
34 NEXT_PASS (pass_warn_unused_result
);
35 NEXT_PASS (pass_diagnose_omp_blocks
);
36 NEXT_PASS (pass_diagnose_tm_blocks
);
37 NEXT_PASS (pass_lower_omp
);
38 NEXT_PASS (pass_lower_cf
);
39 NEXT_PASS (pass_lower_tm
);
40 NEXT_PASS (pass_refactor_eh
);
41 NEXT_PASS (pass_lower_eh
);
42 NEXT_PASS (pass_build_cfg
);
43 NEXT_PASS (pass_warn_function_return
);
44 NEXT_PASS (pass_expand_omp
);
45 NEXT_PASS (pass_build_cgraph_edges
);
46 TERMINATE_PASS_LIST ()
48 /* Interprocedural optimization passes.
*/
49 INSERT_PASSES_AFTER (all_small_ipa_passes
)
50 NEXT_PASS (pass_ipa_free_lang_data
);
51 NEXT_PASS (pass_ipa_function_and_variable_visibility
);
52 NEXT_PASS (pass_early_local_passes
);
53 PUSH_INSERT_PASSES_WITHIN (pass_early_local_passes
)
54 NEXT_PASS (pass_fixup_cfg
);
55 NEXT_PASS (pass_init_datastructures
);
57 NEXT_PASS (pass_build_ssa
);
58 NEXT_PASS (pass_early_warn_uninitialized
);
59 NEXT_PASS (pass_rebuild_cgraph_edges
);
60 NEXT_PASS (pass_inline_parameters
);
61 NEXT_PASS (pass_early_inline
);
62 NEXT_PASS (pass_all_early_optimizations
);
63 PUSH_INSERT_PASSES_WITHIN (pass_all_early_optimizations
)
64 NEXT_PASS (pass_remove_cgraph_callee_edges
);
65 NEXT_PASS (pass_rename_ssa_copies
);
67 /* After CCP we rewrite no longer addressed locals into SSA
69 NEXT_PASS (pass_forwprop
);
70 /* pass_build_ealias is a dummy pass that ensures that we
71 execute TODO_rebuild_alias at this point.
*/
72 NEXT_PASS (pass_build_ealias
);
73 NEXT_PASS (pass_sra_early
);
75 NEXT_PASS (pass_copy_prop
);
76 NEXT_PASS (pass_merge_phi
);
77 NEXT_PASS (pass_cd_dce
);
78 NEXT_PASS (pass_early_ipa_sra
);
79 NEXT_PASS (pass_tail_recursion
);
80 NEXT_PASS (pass_convert_switch
);
81 NEXT_PASS (pass_cleanup_eh
);
82 NEXT_PASS (pass_profile
);
83 NEXT_PASS (pass_local_pure_const
);
84 /* Split functions creates parts that are not run through
85 early optimizations again. It is thus good idea to do this
87 NEXT_PASS (pass_split_functions
);
89 NEXT_PASS (pass_release_ssa_names
);
90 NEXT_PASS (pass_rebuild_cgraph_edges
);
91 NEXT_PASS (pass_inline_parameters
);
93 NEXT_PASS (pass_ipa_free_inline_summary
);
94 NEXT_PASS (pass_ipa_tree_profile
);
95 PUSH_INSERT_PASSES_WITHIN (pass_ipa_tree_profile
)
96 NEXT_PASS (pass_feedback_split_functions
);
98 NEXT_PASS (pass_ipa_increase_alignment
);
99 NEXT_PASS (pass_ipa_tm
);
100 NEXT_PASS (pass_ipa_lower_emutls
);
101 TERMINATE_PASS_LIST ()
103 INSERT_PASSES_AFTER (all_regular_ipa_passes
)
104 NEXT_PASS (pass_ipa_whole_program_visibility
);
105 NEXT_PASS (pass_ipa_profile
);
106 NEXT_PASS (pass_ipa_devirt
);
107 NEXT_PASS (pass_ipa_cp
);
108 NEXT_PASS (pass_ipa_cdtor_merge
);
109 NEXT_PASS (pass_ipa_inline
);
110 NEXT_PASS (pass_ipa_pure_const
);
111 NEXT_PASS (pass_ipa_reference
);
112 TERMINATE_PASS_LIST ()
114 /* Simple IPA passes executed after the regular passes. In WHOPR mode the
115 passes are executed after partitioning and thus see just parts of the
117 INSERT_PASSES_AFTER (all_late_ipa_passes
)
118 NEXT_PASS (pass_ipa_pta
);
119 TERMINATE_PASS_LIST ()
121 /* These passes are run after IPA passes on every function that is being
122 output to the assembler file.
*/
123 INSERT_PASSES_AFTER (all_passes
)
124 NEXT_PASS (pass_fixup_cfg
);
125 NEXT_PASS (pass_lower_eh_dispatch
);
126 NEXT_PASS (pass_all_optimizations
);
127 PUSH_INSERT_PASSES_WITHIN (pass_all_optimizations
)
128 NEXT_PASS (pass_remove_cgraph_callee_edges
);
129 /* Initial scalar cleanups before alias computation.
130 They ensure memory accesses are not indirect wherever possible.
*/
131 NEXT_PASS (pass_strip_predict_hints
);
132 NEXT_PASS (pass_rename_ssa_copies
);
133 NEXT_PASS (pass_copy_prop
);
134 NEXT_PASS (pass_complete_unrolli
);
135 NEXT_PASS (pass_ccp
);
136 /* After CCP we rewrite no longer addressed locals into SSA
138 NEXT_PASS (pass_phiprop
);
139 NEXT_PASS (pass_forwprop
);
140 NEXT_PASS (pass_object_sizes
);
141 /* pass_build_alias is a dummy pass that ensures that we
142 execute TODO_rebuild_alias at this point.
*/
143 NEXT_PASS (pass_build_alias
);
144 NEXT_PASS (pass_return_slot
);
145 NEXT_PASS (pass_fre
);
146 NEXT_PASS (pass_copy_prop
);
147 NEXT_PASS (pass_merge_phi
);
148 NEXT_PASS (pass_vrp
);
149 NEXT_PASS (pass_dce
);
150 NEXT_PASS (pass_call_cdce
);
151 NEXT_PASS (pass_cselim
);
152 NEXT_PASS (pass_tree_ifcombine
);
153 NEXT_PASS (pass_phiopt
);
154 NEXT_PASS (pass_tail_recursion
);
156 NEXT_PASS (pass_stdarg
);
157 NEXT_PASS (pass_lower_complex
);
158 NEXT_PASS (pass_sra
);
159 NEXT_PASS (pass_rename_ssa_copies
);
160 /* The dom pass will also resolve all __builtin_constant_p calls
161 that are still there to
0. This has to be done after some
162 propagations have already run
, but before some more dead code
163 is removed
, and this place fits nicely. Remember this when
164 trying to move or duplicate pass_dominator somewhere earlier.
*/
165 NEXT_PASS (pass_dominator
);
166 /* At this point the majority of const
/copy propagations
167 are exposed. Go ahead and identify paths that should never
168 be executed in a conforming program and isolate those paths.
170 This will expose more degenerate PHIs in the main path and
171 expose more PRE
/DOM optimization opportunities.
*/
172 NEXT_PASS (pass_isolate_erroneous_paths
);
173 /* The only const
/copy propagation opportunities left after
174 DOM and erroneous path isolation should be due to degenerate PHI nodes.
175 So rather than run the full propagators
, run a specialized pass which
176 only examines PHIs to discover const
/copy propagation
178 NEXT_PASS (pass_phi_only_cprop
);
179 NEXT_PASS (pass_dse
);
180 NEXT_PASS (pass_reassoc
);
181 NEXT_PASS (pass_dce
);
182 NEXT_PASS (pass_forwprop
);
183 NEXT_PASS (pass_phiopt
);
184 NEXT_PASS (pass_strlen
);
185 NEXT_PASS (pass_ccp
);
186 /* After CCP we rewrite no longer addressed locals into SSA
188 NEXT_PASS (pass_copy_prop
);
189 NEXT_PASS (pass_cse_sincos
);
190 NEXT_PASS (pass_optimize_bswap
);
191 NEXT_PASS (pass_split_crit_edges
);
192 NEXT_PASS (pass_pre
);
193 NEXT_PASS (pass_sink_code
);
194 NEXT_PASS (pass_asan
);
195 NEXT_PASS (pass_tsan
);
196 NEXT_PASS (pass_tree_loop
);
197 PUSH_INSERT_PASSES_WITHIN (pass_tree_loop
)
198 NEXT_PASS (pass_tree_loop_init
);
199 NEXT_PASS (pass_lim
);
200 NEXT_PASS (pass_copy_prop
);
201 NEXT_PASS (pass_dce_loop
);
202 NEXT_PASS (pass_tree_unswitch
);
203 NEXT_PASS (pass_scev_cprop
);
204 NEXT_PASS (pass_record_bounds
);
205 NEXT_PASS (pass_check_data_deps
);
206 NEXT_PASS (pass_loop_distribution
);
207 NEXT_PASS (pass_copy_prop
);
208 NEXT_PASS (pass_graphite
);
209 PUSH_INSERT_PASSES_WITHIN (pass_graphite
)
210 NEXT_PASS (pass_graphite_transforms
);
211 NEXT_PASS (pass_lim
);
212 NEXT_PASS (pass_copy_prop
);
213 NEXT_PASS (pass_dce_loop
);
215 NEXT_PASS (pass_iv_canon
);
216 NEXT_PASS (pass_parallelize_loops
);
217 NEXT_PASS (pass_if_conversion
);
218 NEXT_PASS (pass_vectorize
);
219 PUSH_INSERT_PASSES_WITHIN (pass_vectorize
)
220 NEXT_PASS (pass_dce_loop
);
222 NEXT_PASS (pass_predcom
);
223 NEXT_PASS (pass_complete_unroll
);
224 NEXT_PASS (pass_slp_vectorize
);
225 NEXT_PASS (pass_loop_prefetch
);
226 NEXT_PASS (pass_iv_optimize
);
227 NEXT_PASS (pass_lim
);
228 NEXT_PASS (pass_tree_loop_done
);
230 NEXT_PASS (pass_lower_vector_ssa
);
231 NEXT_PASS (pass_cse_reciprocals
);
232 NEXT_PASS (pass_reassoc
);
233 NEXT_PASS (pass_strength_reduction
);
234 NEXT_PASS (pass_dominator
);
235 /* The only const
/copy propagation opportunities left after
236 DOM should be due to degenerate PHI nodes. So rather than
237 run the full propagators
, run a specialized pass which
238 only examines PHIs to discover const
/copy propagation
240 NEXT_PASS (pass_phi_only_cprop
);
241 NEXT_PASS (pass_vrp
);
242 NEXT_PASS (pass_cd_dce
);
243 NEXT_PASS (pass_tracer
);
244 NEXT_PASS (pass_dse
);
245 NEXT_PASS (pass_forwprop
);
246 NEXT_PASS (pass_phiopt
);
247 NEXT_PASS (pass_fold_builtins
);
248 NEXT_PASS (pass_optimize_widening_mul
);
249 NEXT_PASS (pass_tail_calls
);
250 NEXT_PASS (pass_rename_ssa_copies
);
251 /* FIXME
: If DCE is not run before checking for uninitialized uses
,
252 we may get false
warnings (e.g.
, testsuite
/gcc.dg
/uninit
-5.c
).
253 However
, this also causes us to misdiagnose cases that should be
254 real
warnings (e.g.
, testsuite
/gcc.dg
/pr18501.c
).
256 To fix the false positives in uninit
-5.c
, we would have to
257 account for the predicates protecting the set and the use of each
258 variable. Using a representation like Gated Single Assignment
260 /* Split critical edges before late uninit warning to reduce the
261 number of false positives from it.
*/
262 NEXT_PASS (pass_split_crit_edges
);
263 NEXT_PASS (pass_late_warn_uninitialized
);
264 NEXT_PASS (pass_uncprop
);
265 NEXT_PASS (pass_local_pure_const
);
267 NEXT_PASS (pass_all_optimizations_g
);
268 PUSH_INSERT_PASSES_WITHIN (pass_all_optimizations_g
)
269 NEXT_PASS (pass_remove_cgraph_callee_edges
);
270 NEXT_PASS (pass_strip_predict_hints
);
271 /* Lower remaining pieces of GIMPLE.
*/
272 NEXT_PASS (pass_lower_complex
);
273 NEXT_PASS (pass_lower_vector_ssa
);
274 /* Perform simple scalar cleanup which is constant
/copy propagation.
*/
275 NEXT_PASS (pass_ccp
);
276 NEXT_PASS (pass_object_sizes
);
277 /* Fold remaining builtins.
*/
278 NEXT_PASS (pass_fold_builtins
);
279 /* Copy propagation also copy
-propagates constants
, this is necessary
280 to forward object
-size and builtin folding results properly.
*/
281 NEXT_PASS (pass_copy_prop
);
282 NEXT_PASS (pass_dce
);
283 NEXT_PASS (pass_asan
);
284 NEXT_PASS (pass_tsan
);
285 NEXT_PASS (pass_rename_ssa_copies
);
286 /* ??? We do want some kind of loop invariant motion
, but we possibly
287 need to adjust LIM to be more friendly towards preserving accurate
288 debug information here.
*/
289 /* Split critical edges before late uninit warning to reduce the
290 number of false positives from it.
*/
291 NEXT_PASS (pass_split_crit_edges
);
292 NEXT_PASS (pass_late_warn_uninitialized
);
293 NEXT_PASS (pass_uncprop
);
294 NEXT_PASS (pass_local_pure_const
);
296 NEXT_PASS (pass_tm_init
);
297 PUSH_INSERT_PASSES_WITHIN (pass_tm_init
)
298 NEXT_PASS (pass_tm_mark
);
299 NEXT_PASS (pass_tm_memopt
);
300 NEXT_PASS (pass_tm_edges
);
302 NEXT_PASS (pass_vtable_verify
);
303 NEXT_PASS (pass_lower_vector
);
304 NEXT_PASS (pass_lower_complex_O0
);
305 NEXT_PASS (pass_asan_O0
);
306 NEXT_PASS (pass_tsan_O0
);
307 NEXT_PASS (pass_cleanup_eh
);
308 NEXT_PASS (pass_lower_resx
);
309 NEXT_PASS (pass_nrv
);
310 NEXT_PASS (pass_cleanup_cfg_post_optimizing
);
311 NEXT_PASS (pass_warn_function_noreturn
);
313 NEXT_PASS (pass_expand
);
315 NEXT_PASS (pass_rest_of_compilation
);
316 PUSH_INSERT_PASSES_WITHIN (pass_rest_of_compilation
)
317 NEXT_PASS (pass_instantiate_virtual_regs
);
318 NEXT_PASS (pass_into_cfg_layout_mode
);
319 NEXT_PASS (pass_jump
);
320 NEXT_PASS (pass_lower_subreg
);
321 NEXT_PASS (pass_df_initialize_opt
);
322 NEXT_PASS (pass_cse
);
323 NEXT_PASS (pass_rtl_fwprop
);
324 NEXT_PASS (pass_rtl_cprop
);
325 NEXT_PASS (pass_rtl_pre
);
326 NEXT_PASS (pass_rtl_hoist
);
327 NEXT_PASS (pass_rtl_cprop
);
328 NEXT_PASS (pass_rtl_store_motion
);
329 NEXT_PASS (pass_cse_after_global_opts
);
330 NEXT_PASS (pass_rtl_ifcvt
);
331 NEXT_PASS (pass_reginfo_init
);
332 /* Perform loop optimizations. It might be better to do them a bit
333 sooner
, but we want the profile feedback to work more
335 NEXT_PASS (pass_loop2
);
336 PUSH_INSERT_PASSES_WITHIN (pass_loop2
)
337 NEXT_PASS (pass_rtl_loop_init
);
338 NEXT_PASS (pass_rtl_move_loop_invariants
);
339 NEXT_PASS (pass_rtl_unswitch
);
340 NEXT_PASS (pass_rtl_unroll_and_peel_loops
);
341 NEXT_PASS (pass_rtl_doloop
);
342 NEXT_PASS (pass_rtl_loop_done
);
343 TERMINATE_PASS_LIST ()
345 NEXT_PASS (pass_web
);
346 NEXT_PASS (pass_rtl_cprop
);
347 NEXT_PASS (pass_cse2
);
348 NEXT_PASS (pass_rtl_dse1
);
349 NEXT_PASS (pass_rtl_fwprop_addr
);
350 NEXT_PASS (pass_inc_dec
);
351 NEXT_PASS (pass_initialize_regs
);
352 NEXT_PASS (pass_ud_rtl_dce
);
353 NEXT_PASS (pass_combine
);
354 NEXT_PASS (pass_if_after_combine
);
355 NEXT_PASS (pass_partition_blocks
);
356 NEXT_PASS (pass_outof_cfg_layout_mode
);
357 NEXT_PASS (pass_split_all_insns
);
358 NEXT_PASS (pass_lower_subreg2
);
359 NEXT_PASS (pass_df_initialize_no_opt
);
360 NEXT_PASS (pass_stack_ptr_mod
);
361 NEXT_PASS (pass_mode_switching
);
362 NEXT_PASS (pass_match_asm_constraints
);
363 NEXT_PASS (pass_sms
);
364 NEXT_PASS (pass_live_range_shrinkage
);
365 NEXT_PASS (pass_sched
);
366 NEXT_PASS (pass_ira
);
367 NEXT_PASS (pass_reload
);
368 NEXT_PASS (pass_postreload
);
369 PUSH_INSERT_PASSES_WITHIN (pass_postreload
)
370 NEXT_PASS (pass_postreload_cse
);
371 NEXT_PASS (pass_gcse2
);
372 NEXT_PASS (pass_split_after_reload
);
373 NEXT_PASS (pass_ree
);
374 NEXT_PASS (pass_compare_elim_after_reload
);
375 NEXT_PASS (pass_branch_target_load_optimize1
);
376 NEXT_PASS (pass_thread_prologue_and_epilogue
);
377 NEXT_PASS (pass_rtl_dse2
);
378 NEXT_PASS (pass_stack_adjustments
);
379 NEXT_PASS (pass_jump2
);
380 NEXT_PASS (pass_peephole2
);
381 NEXT_PASS (pass_if_after_reload
);
382 NEXT_PASS (pass_regrename
);
383 NEXT_PASS (pass_cprop_hardreg
);
384 NEXT_PASS (pass_fast_rtl_dce
);
385 NEXT_PASS (pass_duplicate_computed_gotos
);
386 NEXT_PASS (pass_reorder_blocks
);
387 NEXT_PASS (pass_branch_target_load_optimize2
);
388 NEXT_PASS (pass_leaf_regs
);
389 NEXT_PASS (pass_split_before_sched2
);
390 NEXT_PASS (pass_sched2
);
391 NEXT_PASS (pass_stack_regs
);
392 PUSH_INSERT_PASSES_WITHIN (pass_stack_regs
)
393 NEXT_PASS (pass_split_before_regstack
);
394 NEXT_PASS (pass_stack_regs_run
);
396 NEXT_PASS (pass_compute_alignments
);
397 NEXT_PASS (pass_variable_tracking
);
398 NEXT_PASS (pass_free_cfg
);
399 NEXT_PASS (pass_machine_reorg
);
400 NEXT_PASS (pass_cleanup_barriers
);
401 NEXT_PASS (pass_delay_slots
);
402 NEXT_PASS (pass_split_for_shorten_branches
);
403 NEXT_PASS (pass_convert_to_eh_region_ranges
);
404 NEXT_PASS (pass_shorten_branches
);
405 NEXT_PASS (pass_set_nothrow_function_flags
);
406 NEXT_PASS (pass_dwarf2_frame
);
407 NEXT_PASS (pass_final
);
409 NEXT_PASS (pass_df_finish
);
411 NEXT_PASS (pass_clean_state
);
412 TERMINATE_PASS_LIST ()
