2018-06-25 Richard Biener <rguenther@suse.de>
[official-gcc.git] / gcc / passes.def
blob2a8fbc2efbefcbe3da03a2466343cc3f355018be
1 /* Description of pass structure
2 Copyright (C) 1987-2018 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
9 version.
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
14 for more details.
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)
24 POP_INSERT_PASSES ()
25 NEXT_PASS (PASS)
26 TERMINATE_PASS_LIST (PASS)
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
32 by these passes. */
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_sprintf_length, false);
46 NEXT_PASS (pass_walloca, /*strict_mode_p=*/true);
47 NEXT_PASS (pass_build_cgraph_edges);
48 TERMINATE_PASS_LIST (all_lowering_passes)
50 /* Interprocedural optimization passes. */
51 INSERT_PASSES_AFTER (all_small_ipa_passes)
52 NEXT_PASS (pass_ipa_free_lang_data);
53 NEXT_PASS (pass_ipa_function_and_variable_visibility);
54 NEXT_PASS (pass_build_ssa_passes);
55 PUSH_INSERT_PASSES_WITHIN (pass_build_ssa_passes)
56 NEXT_PASS (pass_fixup_cfg);
57 NEXT_PASS (pass_build_ssa);
58 NEXT_PASS (pass_warn_nonnull_compare);
59 NEXT_PASS (pass_ubsan);
60 NEXT_PASS (pass_early_warn_uninitialized);
61 NEXT_PASS (pass_nothrow);
62 NEXT_PASS (pass_rebuild_cgraph_edges);
63 POP_INSERT_PASSES ()
65 NEXT_PASS (pass_local_optimization_passes);
66 PUSH_INSERT_PASSES_WITHIN (pass_local_optimization_passes)
67 NEXT_PASS (pass_fixup_cfg);
68 NEXT_PASS (pass_rebuild_cgraph_edges);
69 NEXT_PASS (pass_local_fn_summary);
70 NEXT_PASS (pass_early_inline);
71 NEXT_PASS (pass_all_early_optimizations);
72 PUSH_INSERT_PASSES_WITHIN (pass_all_early_optimizations)
73 NEXT_PASS (pass_remove_cgraph_callee_edges);
74 NEXT_PASS (pass_object_sizes, true /* insert_min_max_p */);
75 /* Don't record nonzero bits before IPA to avoid
76 using too much memory. */
77 NEXT_PASS (pass_ccp, false /* nonzero_p */);
78 /* After CCP we rewrite no longer addressed locals into SSA
79 form if possible. */
80 NEXT_PASS (pass_forwprop);
81 NEXT_PASS (pass_early_thread_jumps);
82 NEXT_PASS (pass_sra_early);
83 /* pass_build_ealias is a dummy pass that ensures that we
84 execute TODO_rebuild_alias at this point. */
85 NEXT_PASS (pass_build_ealias);
86 NEXT_PASS (pass_fre);
87 NEXT_PASS (pass_early_vrp);
88 NEXT_PASS (pass_merge_phi);
89 NEXT_PASS (pass_dse);
90 NEXT_PASS (pass_cd_dce);
91 NEXT_PASS (pass_early_ipa_sra);
92 NEXT_PASS (pass_tail_recursion);
93 NEXT_PASS (pass_convert_switch);
94 NEXT_PASS (pass_cleanup_eh);
95 NEXT_PASS (pass_profile);
96 NEXT_PASS (pass_local_pure_const);
97 /* Split functions creates parts that are not run through
98 early optimizations again. It is thus good idea to do this
99 late. */
100 NEXT_PASS (pass_split_functions);
101 NEXT_PASS (pass_strip_predict_hints);
102 POP_INSERT_PASSES ()
103 NEXT_PASS (pass_release_ssa_names);
104 NEXT_PASS (pass_rebuild_cgraph_edges);
105 NEXT_PASS (pass_local_fn_summary);
106 POP_INSERT_PASSES ()
108 NEXT_PASS (pass_ipa_oacc);
109 PUSH_INSERT_PASSES_WITHIN (pass_ipa_oacc)
110 NEXT_PASS (pass_ipa_pta);
111 /* Pass group that runs when the function is an offloaded function
112 containing oacc kernels loops. */
113 NEXT_PASS (pass_ipa_oacc_kernels);
114 PUSH_INSERT_PASSES_WITHIN (pass_ipa_oacc_kernels)
115 NEXT_PASS (pass_oacc_kernels);
116 PUSH_INSERT_PASSES_WITHIN (pass_oacc_kernels)
117 NEXT_PASS (pass_ch);
118 NEXT_PASS (pass_fre);
119 /* We use pass_lim to rewrite in-memory iteration and reduction
120 variable accesses in loops into local variables accesses. */
121 NEXT_PASS (pass_lim);
122 NEXT_PASS (pass_dominator, false /* may_peel_loop_headers_p */);
123 NEXT_PASS (pass_dce);
124 NEXT_PASS (pass_parallelize_loops, true /* oacc_kernels_p */);
125 NEXT_PASS (pass_expand_omp_ssa);
126 NEXT_PASS (pass_rebuild_cgraph_edges);
127 POP_INSERT_PASSES ()
128 POP_INSERT_PASSES ()
129 POP_INSERT_PASSES ()
131 NEXT_PASS (pass_target_clone);
132 NEXT_PASS (pass_ipa_auto_profile);
133 NEXT_PASS (pass_ipa_tree_profile);
134 PUSH_INSERT_PASSES_WITHIN (pass_ipa_tree_profile)
135 NEXT_PASS (pass_feedback_split_functions);
136 POP_INSERT_PASSES ()
137 NEXT_PASS (pass_ipa_free_fn_summary, true /* small_p */);
138 NEXT_PASS (pass_ipa_increase_alignment);
139 NEXT_PASS (pass_ipa_tm);
140 NEXT_PASS (pass_ipa_lower_emutls);
141 TERMINATE_PASS_LIST (all_small_ipa_passes)
143 INSERT_PASSES_AFTER (all_regular_ipa_passes)
144 NEXT_PASS (pass_ipa_whole_program_visibility);
145 NEXT_PASS (pass_ipa_profile);
146 NEXT_PASS (pass_ipa_icf);
147 NEXT_PASS (pass_ipa_devirt);
148 NEXT_PASS (pass_ipa_cp);
149 NEXT_PASS (pass_ipa_cdtor_merge);
150 NEXT_PASS (pass_ipa_hsa);
151 NEXT_PASS (pass_ipa_fn_summary);
152 NEXT_PASS (pass_ipa_inline);
153 NEXT_PASS (pass_ipa_pure_const);
154 NEXT_PASS (pass_ipa_free_fn_summary, false /* small_p */);
155 NEXT_PASS (pass_ipa_reference);
156 /* This pass needs to be scheduled after any IP code duplication. */
157 NEXT_PASS (pass_ipa_single_use);
158 /* Comdat privatization come last, as direct references to comdat local
159 symbols are not allowed outside of the comdat group. Privatizing early
160 would result in missed optimizations due to this restriction. */
161 NEXT_PASS (pass_ipa_comdats);
162 TERMINATE_PASS_LIST (all_regular_ipa_passes)
164 /* Simple IPA passes executed after the regular passes. In WHOPR mode the
165 passes are executed after partitioning and thus see just parts of the
166 compiled unit. */
167 INSERT_PASSES_AFTER (all_late_ipa_passes)
168 NEXT_PASS (pass_materialize_all_clones);
169 NEXT_PASS (pass_ipa_pta);
170 NEXT_PASS (pass_omp_simd_clone);
171 TERMINATE_PASS_LIST (all_late_ipa_passes)
173 /* These passes are run after IPA passes on every function that is being
174 output to the assembler file. */
175 INSERT_PASSES_AFTER (all_passes)
176 NEXT_PASS (pass_fixup_cfg);
177 NEXT_PASS (pass_lower_eh_dispatch);
178 NEXT_PASS (pass_oacc_device_lower);
179 NEXT_PASS (pass_omp_device_lower);
180 NEXT_PASS (pass_omp_target_link);
181 NEXT_PASS (pass_all_optimizations);
182 PUSH_INSERT_PASSES_WITHIN (pass_all_optimizations)
183 NEXT_PASS (pass_remove_cgraph_callee_edges);
184 /* Initial scalar cleanups before alias computation.
185 They ensure memory accesses are not indirect wherever possible. */
186 NEXT_PASS (pass_strip_predict_hints);
187 NEXT_PASS (pass_ccp, true /* nonzero_p */);
188 NEXT_PASS (pass_post_ipa_warn);
189 /* After CCP we rewrite no longer addressed locals into SSA
190 form if possible. */
191 NEXT_PASS (pass_complete_unrolli);
192 NEXT_PASS (pass_backprop);
193 NEXT_PASS (pass_phiprop);
194 NEXT_PASS (pass_forwprop);
195 NEXT_PASS (pass_object_sizes, false /* insert_min_max_p */);
196 /* pass_build_alias is a dummy pass that ensures that we
197 execute TODO_rebuild_alias at this point. */
198 NEXT_PASS (pass_build_alias);
199 NEXT_PASS (pass_return_slot);
200 NEXT_PASS (pass_fre);
201 NEXT_PASS (pass_merge_phi);
202 NEXT_PASS (pass_thread_jumps);
203 NEXT_PASS (pass_vrp, true /* warn_array_bounds_p */);
204 NEXT_PASS (pass_dce);
205 NEXT_PASS (pass_stdarg);
206 NEXT_PASS (pass_call_cdce);
207 NEXT_PASS (pass_cselim);
208 NEXT_PASS (pass_copy_prop);
209 NEXT_PASS (pass_tree_ifcombine);
210 NEXT_PASS (pass_merge_phi);
211 NEXT_PASS (pass_phiopt);
212 NEXT_PASS (pass_tail_recursion);
213 NEXT_PASS (pass_ch);
214 NEXT_PASS (pass_lower_complex);
215 NEXT_PASS (pass_sra);
216 /* The dom pass will also resolve all __builtin_constant_p calls
217 that are still there to 0. This has to be done after some
218 propagations have already run, but before some more dead code
219 is removed, and this place fits nicely. Remember this when
220 trying to move or duplicate pass_dominator somewhere earlier. */
221 NEXT_PASS (pass_thread_jumps);
222 NEXT_PASS (pass_dominator, true /* may_peel_loop_headers_p */);
223 /* At this point the majority of const/copy propagations
224 are exposed. Go ahead and identify paths that should never
225 be executed in a conforming program and isolate those paths.
227 This will expose more degenerate PHIs in the main path and
228 expose more PRE/DOM optimization opportunities. */
229 NEXT_PASS (pass_isolate_erroneous_paths);
230 /* The only const/copy propagation opportunities left after
231 DOM and erroneous path isolation should be due to degenerate PHI nodes.
232 So rather than run the full propagators, run a specialized pass which
233 only examines PHIs to discover const/copy propagation
234 opportunities. */
235 NEXT_PASS (pass_phi_only_cprop);
236 NEXT_PASS (pass_dse);
237 NEXT_PASS (pass_reassoc, true /* insert_powi_p */);
238 NEXT_PASS (pass_dce);
239 NEXT_PASS (pass_forwprop);
240 NEXT_PASS (pass_phiopt);
241 NEXT_PASS (pass_ccp, true /* nonzero_p */);
242 /* After CCP we rewrite no longer addressed locals into SSA
243 form if possible. */
244 NEXT_PASS (pass_cse_sincos);
245 NEXT_PASS (pass_optimize_bswap);
246 NEXT_PASS (pass_laddress);
247 NEXT_PASS (pass_lim);
248 NEXT_PASS (pass_walloca, false);
249 NEXT_PASS (pass_pre);
250 NEXT_PASS (pass_sink_code);
251 NEXT_PASS (pass_sancov);
252 NEXT_PASS (pass_asan);
253 NEXT_PASS (pass_tsan);
254 NEXT_PASS (pass_dce);
255 /* Pass group that runs when 1) enabled, 2) there are loops
256 in the function. Make sure to run pass_fix_loops before
257 to discover/remove loops before running the gate function
258 of pass_tree_loop. */
259 NEXT_PASS (pass_fix_loops);
260 NEXT_PASS (pass_tree_loop);
261 PUSH_INSERT_PASSES_WITHIN (pass_tree_loop)
262 NEXT_PASS (pass_tree_loop_init);
263 NEXT_PASS (pass_tree_unswitch);
264 NEXT_PASS (pass_scev_cprop);
265 NEXT_PASS (pass_loop_split);
266 NEXT_PASS (pass_loop_jam);
267 /* All unswitching, final value replacement and splitting can expose
268 empty loops. Remove them now. */
269 NEXT_PASS (pass_cd_dce);
270 NEXT_PASS (pass_iv_canon);
271 NEXT_PASS (pass_loop_distribution);
272 NEXT_PASS (pass_linterchange);
273 NEXT_PASS (pass_copy_prop);
274 NEXT_PASS (pass_graphite);
275 PUSH_INSERT_PASSES_WITHIN (pass_graphite)
276 NEXT_PASS (pass_graphite_transforms);
277 NEXT_PASS (pass_lim);
278 NEXT_PASS (pass_copy_prop);
279 NEXT_PASS (pass_dce);
280 POP_INSERT_PASSES ()
281 NEXT_PASS (pass_parallelize_loops, false /* oacc_kernels_p */);
282 NEXT_PASS (pass_expand_omp_ssa);
283 NEXT_PASS (pass_ch_vect);
284 NEXT_PASS (pass_if_conversion);
285 /* pass_vectorize must immediately follow pass_if_conversion.
286 Please do not add any other passes in between. */
287 NEXT_PASS (pass_vectorize);
288 PUSH_INSERT_PASSES_WITHIN (pass_vectorize)
289 NEXT_PASS (pass_dce);
290 POP_INSERT_PASSES ()
291 NEXT_PASS (pass_predcom);
292 NEXT_PASS (pass_complete_unroll);
293 NEXT_PASS (pass_slp_vectorize);
294 NEXT_PASS (pass_loop_prefetch);
295 /* Run IVOPTs after the last pass that uses data-reference analysis
296 as that doesn't handle TARGET_MEM_REFs. */
297 NEXT_PASS (pass_iv_optimize);
298 NEXT_PASS (pass_lim);
299 NEXT_PASS (pass_tree_loop_done);
300 POP_INSERT_PASSES ()
301 /* Pass group that runs when pass_tree_loop is disabled or there
302 are no loops in the function. */
303 NEXT_PASS (pass_tree_no_loop);
304 PUSH_INSERT_PASSES_WITHIN (pass_tree_no_loop)
305 NEXT_PASS (pass_slp_vectorize);
306 POP_INSERT_PASSES ()
307 NEXT_PASS (pass_simduid_cleanup);
308 NEXT_PASS (pass_lower_vector_ssa);
309 NEXT_PASS (pass_lower_switch);
310 NEXT_PASS (pass_cse_reciprocals);
311 NEXT_PASS (pass_sprintf_length, true);
312 NEXT_PASS (pass_reassoc, false /* insert_powi_p */);
313 NEXT_PASS (pass_strength_reduction);
314 NEXT_PASS (pass_split_paths);
315 NEXT_PASS (pass_tracer);
316 NEXT_PASS (pass_thread_jumps);
317 NEXT_PASS (pass_dominator, false /* may_peel_loop_headers_p */);
318 NEXT_PASS (pass_strlen);
319 NEXT_PASS (pass_thread_jumps);
320 NEXT_PASS (pass_vrp, false /* warn_array_bounds_p */);
321 /* The only const/copy propagation opportunities left after
322 DOM and VRP should be due to degenerate PHI nodes. So rather than
323 run the full propagators, run a specialized pass which
324 only examines PHIs to discover const/copy propagation
325 opportunities. */
326 NEXT_PASS (pass_warn_restrict);
327 NEXT_PASS (pass_phi_only_cprop);
328 NEXT_PASS (pass_dse);
329 NEXT_PASS (pass_cd_dce);
330 NEXT_PASS (pass_forwprop);
331 NEXT_PASS (pass_phiopt);
332 NEXT_PASS (pass_fold_builtins);
333 NEXT_PASS (pass_optimize_widening_mul);
334 NEXT_PASS (pass_store_merging);
335 NEXT_PASS (pass_tail_calls);
336 /* If DCE is not run before checking for uninitialized uses,
337 we may get false warnings (e.g., testsuite/gcc.dg/uninit-5.c).
338 However, this also causes us to misdiagnose cases that should be
339 real warnings (e.g., testsuite/gcc.dg/pr18501.c). */
340 NEXT_PASS (pass_dce);
341 /* Split critical edges before late uninit warning to reduce the
342 number of false positives from it. */
343 NEXT_PASS (pass_split_crit_edges);
344 NEXT_PASS (pass_late_warn_uninitialized);
345 NEXT_PASS (pass_uncprop);
346 NEXT_PASS (pass_local_pure_const);
347 POP_INSERT_PASSES ()
348 NEXT_PASS (pass_all_optimizations_g);
349 PUSH_INSERT_PASSES_WITHIN (pass_all_optimizations_g)
350 NEXT_PASS (pass_remove_cgraph_callee_edges);
351 NEXT_PASS (pass_strip_predict_hints);
352 /* Lower remaining pieces of GIMPLE. */
353 NEXT_PASS (pass_lower_complex);
354 NEXT_PASS (pass_lower_vector_ssa);
355 NEXT_PASS (pass_lower_switch);
356 /* Perform simple scalar cleanup which is constant/copy propagation. */
357 NEXT_PASS (pass_ccp, true /* nonzero_p */);
358 NEXT_PASS (pass_post_ipa_warn);
359 NEXT_PASS (pass_object_sizes);
360 /* Fold remaining builtins. */
361 NEXT_PASS (pass_fold_builtins);
362 NEXT_PASS (pass_sprintf_length, true);
363 /* Copy propagation also copy-propagates constants, this is necessary
364 to forward object-size and builtin folding results properly. */
365 NEXT_PASS (pass_copy_prop);
366 NEXT_PASS (pass_dce);
367 NEXT_PASS (pass_sancov);
368 NEXT_PASS (pass_asan);
369 NEXT_PASS (pass_tsan);
370 /* ??? We do want some kind of loop invariant motion, but we possibly
371 need to adjust LIM to be more friendly towards preserving accurate
372 debug information here. */
373 /* Split critical edges before late uninit warning to reduce the
374 number of false positives from it. */
375 NEXT_PASS (pass_split_crit_edges);
376 NEXT_PASS (pass_late_warn_uninitialized);
377 NEXT_PASS (pass_uncprop);
378 NEXT_PASS (pass_local_pure_const);
379 POP_INSERT_PASSES ()
380 NEXT_PASS (pass_tm_init);
381 PUSH_INSERT_PASSES_WITHIN (pass_tm_init)
382 NEXT_PASS (pass_tm_mark);
383 NEXT_PASS (pass_tm_memopt);
384 NEXT_PASS (pass_tm_edges);
385 POP_INSERT_PASSES ()
386 NEXT_PASS (pass_simduid_cleanup);
387 NEXT_PASS (pass_vtable_verify);
388 NEXT_PASS (pass_lower_vaarg);
389 NEXT_PASS (pass_lower_vector);
390 NEXT_PASS (pass_lower_complex_O0);
391 NEXT_PASS (pass_sancov_O0);
392 NEXT_PASS (pass_lower_switch_O0);
393 NEXT_PASS (pass_asan_O0);
394 NEXT_PASS (pass_tsan_O0);
395 NEXT_PASS (pass_sanopt);
396 NEXT_PASS (pass_cleanup_eh);
397 NEXT_PASS (pass_lower_resx);
398 NEXT_PASS (pass_nrv);
399 NEXT_PASS (pass_cleanup_cfg_post_optimizing);
400 NEXT_PASS (pass_warn_function_noreturn);
401 NEXT_PASS (pass_gen_hsail);
403 NEXT_PASS (pass_expand);
405 NEXT_PASS (pass_rest_of_compilation);
406 PUSH_INSERT_PASSES_WITHIN (pass_rest_of_compilation)
407 NEXT_PASS (pass_instantiate_virtual_regs);
408 NEXT_PASS (pass_into_cfg_layout_mode);
409 NEXT_PASS (pass_jump);
410 NEXT_PASS (pass_lower_subreg);
411 NEXT_PASS (pass_df_initialize_opt);
412 NEXT_PASS (pass_cse);
413 NEXT_PASS (pass_rtl_fwprop);
414 NEXT_PASS (pass_rtl_cprop);
415 NEXT_PASS (pass_rtl_pre);
416 NEXT_PASS (pass_rtl_hoist);
417 NEXT_PASS (pass_rtl_cprop);
418 NEXT_PASS (pass_rtl_store_motion);
419 NEXT_PASS (pass_cse_after_global_opts);
420 NEXT_PASS (pass_rtl_ifcvt);
421 NEXT_PASS (pass_reginfo_init);
422 /* Perform loop optimizations. It might be better to do them a bit
423 sooner, but we want the profile feedback to work more
424 efficiently. */
425 NEXT_PASS (pass_loop2);
426 PUSH_INSERT_PASSES_WITHIN (pass_loop2)
427 NEXT_PASS (pass_rtl_loop_init);
428 NEXT_PASS (pass_rtl_move_loop_invariants);
429 NEXT_PASS (pass_rtl_unroll_loops);
430 NEXT_PASS (pass_rtl_doloop);
431 NEXT_PASS (pass_rtl_loop_done);
432 POP_INSERT_PASSES ()
433 NEXT_PASS (pass_web);
434 NEXT_PASS (pass_rtl_cprop);
435 NEXT_PASS (pass_cse2);
436 NEXT_PASS (pass_rtl_dse1);
437 NEXT_PASS (pass_rtl_fwprop_addr);
438 NEXT_PASS (pass_inc_dec);
439 NEXT_PASS (pass_initialize_regs);
440 NEXT_PASS (pass_ud_rtl_dce);
441 NEXT_PASS (pass_combine);
442 NEXT_PASS (pass_if_after_combine);
443 NEXT_PASS (pass_partition_blocks);
444 NEXT_PASS (pass_outof_cfg_layout_mode);
445 NEXT_PASS (pass_split_all_insns);
446 NEXT_PASS (pass_lower_subreg2);
447 NEXT_PASS (pass_df_initialize_no_opt);
448 NEXT_PASS (pass_stack_ptr_mod);
449 NEXT_PASS (pass_mode_switching);
450 NEXT_PASS (pass_match_asm_constraints);
451 NEXT_PASS (pass_sms);
452 NEXT_PASS (pass_live_range_shrinkage);
453 NEXT_PASS (pass_sched);
454 NEXT_PASS (pass_early_remat);
455 NEXT_PASS (pass_ira);
456 NEXT_PASS (pass_reload);
457 NEXT_PASS (pass_postreload);
458 PUSH_INSERT_PASSES_WITHIN (pass_postreload)
459 NEXT_PASS (pass_postreload_cse);
460 NEXT_PASS (pass_gcse2);
461 NEXT_PASS (pass_split_after_reload);
462 NEXT_PASS (pass_ree);
463 NEXT_PASS (pass_compare_elim_after_reload);
464 NEXT_PASS (pass_branch_target_load_optimize1);
465 NEXT_PASS (pass_thread_prologue_and_epilogue);
466 NEXT_PASS (pass_rtl_dse2);
467 NEXT_PASS (pass_stack_adjustments);
468 NEXT_PASS (pass_jump2);
469 NEXT_PASS (pass_duplicate_computed_gotos);
470 NEXT_PASS (pass_sched_fusion);
471 NEXT_PASS (pass_peephole2);
472 NEXT_PASS (pass_if_after_reload);
473 NEXT_PASS (pass_regrename);
474 NEXT_PASS (pass_cprop_hardreg);
475 NEXT_PASS (pass_fast_rtl_dce);
476 NEXT_PASS (pass_reorder_blocks);
477 NEXT_PASS (pass_branch_target_load_optimize2);
478 NEXT_PASS (pass_leaf_regs);
479 NEXT_PASS (pass_split_before_sched2);
480 NEXT_PASS (pass_sched2);
481 NEXT_PASS (pass_stack_regs);
482 PUSH_INSERT_PASSES_WITHIN (pass_stack_regs)
483 NEXT_PASS (pass_split_before_regstack);
484 NEXT_PASS (pass_stack_regs_run);
485 POP_INSERT_PASSES ()
486 POP_INSERT_PASSES ()
487 NEXT_PASS (pass_late_compilation);
488 PUSH_INSERT_PASSES_WITHIN (pass_late_compilation)
489 NEXT_PASS (pass_compute_alignments);
490 NEXT_PASS (pass_variable_tracking);
491 NEXT_PASS (pass_free_cfg);
492 NEXT_PASS (pass_machine_reorg);
493 NEXT_PASS (pass_cleanup_barriers);
494 NEXT_PASS (pass_delay_slots);
495 NEXT_PASS (pass_split_for_shorten_branches);
496 NEXT_PASS (pass_convert_to_eh_region_ranges);
497 NEXT_PASS (pass_shorten_branches);
498 NEXT_PASS (pass_set_nothrow_function_flags);
499 NEXT_PASS (pass_dwarf2_frame);
500 NEXT_PASS (pass_final);
501 POP_INSERT_PASSES ()
502 NEXT_PASS (pass_df_finish);
503 POP_INSERT_PASSES ()
504 NEXT_PASS (pass_clean_state);
505 TERMINATE_PASS_LIST (all_passes)