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