1 /* Top level of GCC compilers (cc1, cc1plus, etc.)
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* This is the top level of cc1/c++.
23 It parses command args, opens files, invokes the various passes
24 in the proper order, and counts the time used by each.
25 Error messages and low-level interface to malloc also handled here. */
28 #undef FLOAT /* This is for hpux. They should change hpux. */
29 #undef FFS /* Some systems define this in param.h. */
31 #include "coretypes.h"
35 #ifdef HAVE_SYS_RESOURCE_H
36 # include <sys/resource.h>
39 #ifdef HAVE_SYS_TIMES_H
40 # include <sys/times.h>
49 #include "insn-attr.h"
50 #include "insn-config.h"
51 #include "insn-flags.h"
52 #include "hard-reg-set.h"
59 #include "basic-block.h"
65 #include "diagnostic.h"
68 #include "dwarf2asm.h"
69 #include "integrate.h"
73 #include "langhooks.h"
74 #include "cfglayout.h"
76 #include "hosthooks.h"
80 #include "value-prof.h"
81 #include "tree-inline.h"
82 #include "tree-flow.h"
83 #include "tree-pass.h"
84 #include "tree-dump.h"
88 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
89 #include "dwarf2out.h"
92 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
96 #ifdef SDB_DEBUGGING_INFO
100 #ifdef XCOFF_DEBUGGING_INFO
101 #include "xcoffout.h" /* Needed for external data
102 declarations for e.g. AIX 4.x. */
105 /* This is used for debugging. It allows the current pass to printed
106 from anywhere in compilation. */
107 struct opt_pass
*current_pass
;
109 /* Call from anywhere to find out what pass this is. Useful for
110 printing out debugging information deep inside an service
113 print_current_pass (FILE *file
)
116 fprintf (file
, "current pass = %s (%d)\n",
117 current_pass
->name
, current_pass
->static_pass_number
);
119 fprintf (file
, "no current pass.\n");
123 /* Call from the debugger to get the current pass name. */
127 print_current_pass (stderr
);
132 /* Global variables used to communicate with passes. */
135 bool first_pass_instance
;
138 /* This is called from various places for FUNCTION_DECL, VAR_DECL,
141 This does nothing for local (non-static) variables, unless the
142 variable is a register variable with DECL_ASSEMBLER_NAME set. In
143 that case, or if the variable is not an automatic, it sets up the
144 RTL and outputs any assembler code (label definition, storage
145 allocation and initialization).
147 DECL is the declaration. TOP_LEVEL is nonzero
148 if this declaration is not within a function. */
151 rest_of_decl_compilation (tree decl
,
155 /* We deferred calling assemble_alias so that we could collect
156 other attributes such as visibility. Emit the alias now. */
159 alias
= lookup_attribute ("alias", DECL_ATTRIBUTES (decl
));
162 alias
= TREE_VALUE (TREE_VALUE (alias
));
163 alias
= get_identifier (TREE_STRING_POINTER (alias
));
164 assemble_alias (decl
, alias
);
168 /* Can't defer this, because it needs to happen before any
169 later function definitions are processed. */
170 if (DECL_ASSEMBLER_NAME_SET_P (decl
) && DECL_REGISTER (decl
))
171 make_decl_rtl (decl
);
173 /* Forward declarations for nested functions are not "external",
174 but we need to treat them as if they were. */
175 if (TREE_STATIC (decl
) || DECL_EXTERNAL (decl
)
176 || TREE_CODE (decl
) == FUNCTION_DECL
)
178 timevar_push (TV_VARCONST
);
180 /* Don't output anything when a tentative file-scope definition
181 is seen. But at end of compilation, do output code for them.
183 We do output all variables when unit-at-a-time is active and rely on
184 callgraph code to defer them except for forward declarations
185 (see gcc.c-torture/compile/920624-1.c) */
187 || !DECL_DEFER_OUTPUT (decl
)
188 || DECL_INITIAL (decl
))
189 && !DECL_EXTERNAL (decl
))
191 if (TREE_CODE (decl
) != FUNCTION_DECL
)
192 varpool_finalize_decl (decl
);
194 assemble_variable (decl
, top_level
, at_end
, 0);
197 #ifdef ASM_FINISH_DECLARE_OBJECT
198 if (decl
== last_assemble_variable_decl
)
200 ASM_FINISH_DECLARE_OBJECT (asm_out_file
, decl
,
205 timevar_pop (TV_VARCONST
);
207 else if (TREE_CODE (decl
) == TYPE_DECL
208 /* Like in rest_of_type_compilation, avoid confusing the debug
209 information machinery when there are errors. */
210 && !(sorrycount
|| errorcount
))
212 timevar_push (TV_SYMOUT
);
213 debug_hooks
->type_decl (decl
, !top_level
);
214 timevar_pop (TV_SYMOUT
);
217 /* Let cgraph know about the existence of variables. */
218 if (TREE_CODE (decl
) == VAR_DECL
&& !DECL_EXTERNAL (decl
))
222 /* Called after finishing a record, union or enumeral type. */
225 rest_of_type_compilation (tree type
, int toplev
)
227 /* Avoid confusing the debug information machinery when there are
229 if (errorcount
!= 0 || sorrycount
!= 0)
232 timevar_push (TV_SYMOUT
);
233 debug_hooks
->type_decl (TYPE_STUB_DECL (type
), !toplev
);
234 timevar_pop (TV_SYMOUT
);
240 finish_optimization_passes (void)
242 enum tree_dump_index i
;
243 struct dump_file_info
*dfi
;
246 timevar_push (TV_DUMP
);
247 if (profile_arc_flag
|| flag_test_coverage
|| flag_branch_probabilities
)
249 dump_file
= dump_begin (pass_profile
.pass
.static_pass_number
, NULL
);
252 dump_end (pass_profile
.pass
.static_pass_number
, dump_file
);
257 dump_file
= dump_begin (pass_combine
.pass
.static_pass_number
, NULL
);
260 dump_combine_total_stats (dump_file
);
261 dump_end (pass_combine
.pass
.static_pass_number
, dump_file
);
265 /* Do whatever is necessary to finish printing the graphs. */
266 if (graph_dump_format
!= no_graph
)
267 for (i
= TDI_end
; (dfi
= get_dump_file_info (i
)) != NULL
; ++i
)
268 if (dump_initialized_p (i
)
269 && (dfi
->flags
& TDF_GRAPH
) != 0
270 && (name
= get_dump_file_name (i
)) != NULL
)
272 finish_graph_dump_file (name
);
276 timevar_pop (TV_DUMP
);
280 gate_rest_of_compilation (void)
282 /* Early return if there were errors. We can run afoul of our
283 consistency checks, and there's not really much point in fixing them. */
284 return !(rtl_dump_and_exit
|| flag_syntax_only
|| errorcount
|| sorrycount
);
287 struct gimple_opt_pass pass_rest_of_compilation
=
292 gate_rest_of_compilation
, /* gate */
296 0, /* static_pass_number */
297 TV_REST_OF_COMPILATION
, /* tv_id */
298 PROP_rtl
, /* properties_required */
299 0, /* properties_provided */
300 0, /* properties_destroyed */
301 0, /* todo_flags_start */
302 TODO_ggc_collect
/* todo_flags_finish */
307 gate_postreload (void)
309 return reload_completed
;
312 struct rtl_opt_pass pass_postreload
=
317 gate_postreload
, /* gate */
321 0, /* static_pass_number */
323 PROP_rtl
, /* properties_required */
324 0, /* properties_provided */
325 0, /* properties_destroyed */
326 0, /* todo_flags_start */
327 TODO_ggc_collect
| TODO_verify_rtl_sharing
/* todo_flags_finish */
333 /* The root of the compilation pass tree, once constructed. */
334 struct opt_pass
*all_passes
, *all_ipa_passes
, *all_lowering_passes
;
336 /* Iterate over the pass tree allocating dump file numbers. We want
337 to do this depth first, and independent of whether the pass is
341 register_one_dump_file (struct opt_pass
*pass
)
343 char *dot_name
, *flag_name
, *glob_name
;
348 /* See below in next_pass_1. */
350 if (pass
->static_pass_number
!= -1)
351 sprintf (num
, "%d", ((int) pass
->static_pass_number
< 0
352 ? 1 : pass
->static_pass_number
));
354 dot_name
= concat (".", pass
->name
, num
, NULL
);
355 if (pass
->type
== SIMPLE_IPA_PASS
)
356 prefix
= "ipa-", flags
= TDF_IPA
;
357 else if (pass
->type
== GIMPLE_PASS
)
358 prefix
= "tree-", flags
= TDF_TREE
;
360 prefix
= "rtl-", flags
= TDF_RTL
;
362 flag_name
= concat (prefix
, pass
->name
, num
, NULL
);
363 glob_name
= concat (prefix
, pass
->name
, NULL
);
364 pass
->static_pass_number
= dump_register (dot_name
, flag_name
, glob_name
,
368 /* Recursive worker function for register_dump_files. */
371 register_dump_files_1 (struct opt_pass
*pass
, int properties
)
375 int new_properties
= (properties
| pass
->properties_provided
)
376 & ~pass
->properties_destroyed
;
379 register_one_dump_file (pass
);
382 new_properties
= register_dump_files_1 (pass
->sub
, new_properties
);
384 /* If we have a gate, combine the properties that we could have with
385 and without the pass being examined. */
387 properties
&= new_properties
;
389 properties
= new_properties
;
398 /* Register the dump files for the pipeline starting at PASS.
399 PROPERTIES reflects the properties that are guaranteed to be available at
400 the beginning of the pipeline. */
403 register_dump_files (struct opt_pass
*pass
,int properties
)
405 pass
->properties_required
|= properties
;
406 register_dump_files_1 (pass
, properties
);
409 /* Add a pass to the pass list. Duplicate the pass if it's already
412 static struct opt_pass
**
413 next_pass_1 (struct opt_pass
**list
, struct opt_pass
*pass
)
415 /* A nonzero static_pass_number indicates that the
416 pass is already in the list. */
417 if (pass
->static_pass_number
)
419 struct opt_pass
*new;
421 new = xmalloc (sizeof (*new));
422 memcpy (new, pass
, sizeof (*new));
425 new->todo_flags_start
&= ~TODO_mark_first_instance
;
427 /* Indicate to register_dump_files that this pass has duplicates,
428 and so it should rename the dump file. The first instance will
429 be -1, and be number of duplicates = -static_pass_number - 1.
430 Subsequent instances will be > 0 and just the duplicate number. */
433 pass
->static_pass_number
-= 1;
434 new->static_pass_number
= -pass
->static_pass_number
;
441 pass
->todo_flags_start
|= TODO_mark_first_instance
;
442 pass
->static_pass_number
= -1;
446 return &(*list
)->next
;
451 /* Construct the pass tree. The sequencing of passes is driven by
454 cgraph_finalize_compilation_unit ()
455 for each node N in the cgraph
456 cgraph_analyze_function (N)
457 cgraph_lower_function (N) -> all_lowering_passes
459 If we are optimizing, cgraph_optimize is then invoked:
462 ipa_passes () -> all_ipa_passes
463 cgraph_expand_all_functions ()
464 for each node N in the cgraph
465 cgraph_expand_function (N)
466 tree_rest_of_compilation (DECL (N)) -> all_passes
470 init_optimization_passes (void)
474 #define NEXT_PASS(PASS) (p = next_pass_1 (p, &((PASS).pass)))
476 /* All passes needed to lower the function into shape optimizers can
477 operate on. These passes are always run first on the function, but
478 backend might produce already lowered functions that are not processed
480 p
= &all_lowering_passes
;
481 NEXT_PASS (pass_remove_useless_stmts
);
484 NEXT_PASS (pass_mudflap_1
);
485 NEXT_PASS (pass_lower_omp
);
487 NEXT_PASS (pass_lower_cf
);
490 NEXT_PASS (pass_refactor_eh
);
492 NEXT_PASS (pass_lower_eh
);
493 NEXT_PASS (pass_build_cfg
);
494 NEXT_PASS (pass_lower_complex_O0
);
495 NEXT_PASS (pass_lower_vector
);
496 NEXT_PASS (pass_warn_function_return
);
497 NEXT_PASS (pass_build_cgraph_edges
);
498 NEXT_PASS (pass_inline_parameters
);
501 /* Interprocedural optimization passes.
502 All these passes are ignored in -fno-unit-at-a-time
503 except for subpasses of early_local_passes. */
505 NEXT_PASS (pass_ipa_function_and_variable_visibility
);
506 NEXT_PASS (pass_ipa_early_inline
);
508 struct opt_pass
**p
= &pass_ipa_early_inline
.pass
.sub
;
509 NEXT_PASS (pass_early_inline
);
510 NEXT_PASS (pass_inline_parameters
);
511 NEXT_PASS (pass_rebuild_cgraph_edges
);
513 NEXT_PASS (pass_early_local_passes
);
515 struct opt_pass
**p
= &pass_early_local_passes
.pass
.sub
;
516 NEXT_PASS (pass_tree_profile
);
517 NEXT_PASS (pass_cleanup_cfg
);
518 NEXT_PASS (pass_init_datastructures
);
519 NEXT_PASS (pass_expand_omp
);
520 NEXT_PASS (pass_all_early_optimizations
);
522 struct opt_pass
**p
= &pass_all_early_optimizations
.pass
.sub
;
523 NEXT_PASS (pass_referenced_vars
);
524 NEXT_PASS (pass_reset_cc_flags
);
525 NEXT_PASS (pass_build_ssa
);
528 NEXT_PASS (pass_expand_omp_ssa
);
530 NEXT_PASS (pass_early_warn_uninitialized
);
531 NEXT_PASS (pass_rebuild_cgraph_edges
);
532 NEXT_PASS (pass_early_inline
);
533 NEXT_PASS (pass_cleanup_cfg
);
534 NEXT_PASS (pass_rename_ssa_copies
);
535 NEXT_PASS (pass_ccp
);
538 NEXT_PASS (pass_forwprop
);
540 NEXT_PASS (pass_update_address_taken
);
541 NEXT_PASS (pass_simple_dse
);
542 NEXT_PASS (pass_sra_early
);
543 NEXT_PASS (pass_copy_prop
);
546 NEXT_PASS (pass_merge_phi
);
548 NEXT_PASS (pass_dce
);
549 NEXT_PASS (pass_update_address_taken
);
550 NEXT_PASS (pass_simple_dse
);
551 NEXT_PASS (pass_tail_recursion
);
552 NEXT_PASS (pass_profile
);
555 NEXT_PASS (pass_release_ssa_names
);
558 NEXT_PASS (pass_rebuild_cgraph_edges
);
559 NEXT_PASS (pass_inline_parameters
);
563 NEXT_PASS (pass_ipa_increase_alignment
);
564 NEXT_PASS (pass_ipa_matrix_reorg
);
565 NEXT_PASS (pass_ipa_cp
);
567 NEXT_PASS (pass_ipa_inline
);
570 NEXT_PASS (pass_ipa_reference
);
572 NEXT_PASS (pass_ipa_pure_const
);
575 NEXT_PASS (pass_ipa_type_escape
);
576 NEXT_PASS (pass_ipa_pta
);
577 NEXT_PASS (pass_ipa_struct_reorg
);
581 /* These passes are run after IPA passes on every function that is being
582 output to the assembler file. */
584 NEXT_PASS (pass_apply_inline
);
585 NEXT_PASS (pass_all_optimizations
);
587 struct opt_pass
**p
= &pass_all_optimizations
.pass
.sub
;
588 NEXT_PASS (pass_create_structure_vars
);
589 /* ??? pass_build_alias is a dummy pass that ensures that we
590 execute TODO_rebuild_alias at this point even if
591 pass_create_structure_vars was disabled. */
592 NEXT_PASS (pass_build_alias
);
593 NEXT_PASS (pass_return_slot
);
596 NEXT_PASS (pass_rename_ssa_copies
);
598 /* Initial scalar cleanups. */
599 NEXT_PASS (pass_ccp
);
600 NEXT_PASS (pass_phiprop
);
603 NEXT_PASS (pass_fre
);
605 NEXT_PASS (pass_dce
);
607 NEXT_PASS (pass_forwprop
);
609 NEXT_PASS (pass_copy_prop
);
612 NEXT_PASS (pass_merge_phi
);
613 NEXT_PASS (pass_vrp
);
615 NEXT_PASS (pass_dce
);
617 NEXT_PASS (pass_cselim
);
619 NEXT_PASS (pass_dominator
);
621 /* The only const/copy propagation opportunities left after
622 DOM should be due to degenerate PHI nodes. So rather than
623 run the full propagators, run a specialized pass which
624 only examines PHIs to discover const/copy propagation
626 NEXT_PASS (pass_phi_only_cprop
);
627 NEXT_PASS (pass_tree_ifcombine
);
628 NEXT_PASS (pass_phiopt
);
630 NEXT_PASS (pass_tail_recursion
);
633 NEXT_PASS (pass_stdarg
);
635 NEXT_PASS (pass_lower_complex
);
636 NEXT_PASS (pass_sra
);
639 NEXT_PASS (pass_rename_ssa_copies
);
641 NEXT_PASS (pass_dominator
);
643 /* The only const/copy propagation opportunities left after
644 DOM should be due to degenerate PHI nodes. So rather than
645 run the full propagators, run a specialized pass which
646 only examines PHIs to discover const/copy propagation
648 NEXT_PASS (pass_phi_only_cprop
);
649 NEXT_PASS (pass_reassoc
);
651 NEXT_PASS (pass_dce
);
652 NEXT_PASS (pass_dse
);
654 NEXT_PASS (pass_forwprop
);
655 NEXT_PASS (pass_phiopt
);
657 NEXT_PASS (pass_object_sizes
);
658 NEXT_PASS (pass_store_ccp
);
659 NEXT_PASS (pass_copy_prop
);
660 NEXT_PASS (pass_fold_builtins
);
661 NEXT_PASS (pass_cse_sincos
);
662 NEXT_PASS (pass_split_crit_edges
);
665 NEXT_PASS (pass_pre
);
667 NEXT_PASS (pass_sink_code
);
668 NEXT_PASS (pass_tree_loop
);
670 struct opt_pass
**p
= &pass_tree_loop
.pass
.sub
;
671 NEXT_PASS (pass_tree_loop_init
);
672 NEXT_PASS (pass_copy_prop
);
674 NEXT_PASS (pass_dce_loop
);
676 NEXT_PASS (pass_lim
);
678 NEXT_PASS (pass_predcom
);
679 NEXT_PASS (pass_tree_unswitch
);
681 NEXT_PASS (pass_scev_cprop
);
683 NEXT_PASS (pass_empty_loop
);
684 NEXT_PASS (pass_record_bounds
);
686 NEXT_PASS (pass_check_data_deps
);
688 NEXT_PASS (pass_loop_distribution
);
689 NEXT_PASS (pass_linear_transform
);
690 NEXT_PASS (pass_iv_canon
);
691 NEXT_PASS (pass_if_conversion
);
692 NEXT_PASS (pass_vectorize
);
694 struct opt_pass
**p
= &pass_vectorize
.pass
.sub
;
695 NEXT_PASS (pass_lower_vector_ssa
);
696 NEXT_PASS (pass_dce_loop
);
698 NEXT_PASS (pass_complete_unroll
);
699 NEXT_PASS (pass_parallelize_loops
);
701 NEXT_PASS (pass_loop_prefetch
);
702 NEXT_PASS (pass_iv_optimize
);
703 NEXT_PASS (pass_tree_loop_done
);
705 NEXT_PASS (pass_cse_reciprocals
);
706 NEXT_PASS (pass_convert_to_rsqrt
);
708 NEXT_PASS (pass_reassoc
);
709 NEXT_PASS (pass_vrp
);
711 NEXT_PASS (pass_dominator
);
713 /* The only const/copy propagation opportunities left after
714 DOM should be due to degenerate PHI nodes. So rather than
715 run the full propagators, run a specialized pass which
716 only examines PHIs to discover const/copy propagation
718 NEXT_PASS (pass_phi_only_cprop
);
720 NEXT_PASS (pass_cd_dce
);
722 NEXT_PASS (pass_tracer
);
724 /* FIXME: If DCE is not run before checking for uninitialized uses,
725 we may get false warnings (e.g., testsuite/gcc.dg/uninit-5.c).
726 However, this also causes us to misdiagnose cases that should be
727 real warnings (e.g., testsuite/gcc.dg/pr18501.c).
729 To fix the false positives in uninit-5.c, we would have to
730 account for the predicates protecting the set and the use of each
731 variable. Using a representation like Gated Single Assignment
733 NEXT_PASS (pass_late_warn_uninitialized
);
735 NEXT_PASS (pass_dse
);
738 NEXT_PASS (pass_forwprop
);
739 NEXT_PASS (pass_phiopt
);
741 NEXT_PASS (pass_tail_calls
);
744 NEXT_PASS (pass_rename_ssa_copies
);
745 NEXT_PASS (pass_uncprop
);
747 NEXT_PASS (pass_del_ssa
);
748 NEXT_PASS (pass_nrv
);
749 NEXT_PASS (pass_mark_used_blocks
);
750 NEXT_PASS (pass_cleanup_cfg_post_optimizing
);
752 NEXT_PASS (pass_warn_function_noreturn
);
753 NEXT_PASS (pass_free_datastructures
);
756 NEXT_PASS (pass_mudflap_2
);
759 NEXT_PASS (pass_free_cfg_annotations
);
760 NEXT_PASS (pass_expand
);
761 NEXT_PASS (pass_rest_of_compilation
);
763 struct opt_pass
**p
= &pass_rest_of_compilation
.pass
.sub
;
764 NEXT_PASS (pass_init_function
);
765 NEXT_PASS (pass_jump
);
766 NEXT_PASS (pass_rtl_eh
);
767 NEXT_PASS (pass_initial_value_sets
);
768 NEXT_PASS (pass_unshare_all_rtl
);
769 NEXT_PASS (pass_instantiate_virtual_regs
);
770 NEXT_PASS (pass_into_cfg_layout_mode
);
771 NEXT_PASS (pass_jump2
);
772 NEXT_PASS (pass_lower_subreg
);
773 NEXT_PASS (pass_df_initialize_opt
);
774 NEXT_PASS (pass_cse
);
775 NEXT_PASS (pass_rtl_fwprop
);
776 NEXT_PASS (pass_gcse
);
777 NEXT_PASS (pass_rtl_ifcvt
);
778 /* Perform loop optimizations. It might be better to do them a bit
779 sooner, but we want the profile feedback to work more
781 NEXT_PASS (pass_loop2
);
783 struct opt_pass
**p
= &pass_loop2
.pass
.sub
;
784 NEXT_PASS (pass_rtl_loop_init
);
785 NEXT_PASS (pass_rtl_move_loop_invariants
);
786 NEXT_PASS (pass_rtl_unswitch
);
787 NEXT_PASS (pass_rtl_unroll_and_peel_loops
);
788 NEXT_PASS (pass_rtl_doloop
);
789 NEXT_PASS (pass_rtl_loop_done
);
792 NEXT_PASS (pass_web
);
793 NEXT_PASS (pass_jump_bypass
);
794 NEXT_PASS (pass_cse2
);
795 NEXT_PASS (pass_rtl_dse1
);
796 NEXT_PASS (pass_rtl_fwprop_addr
);
797 NEXT_PASS (pass_regclass_init
);
798 NEXT_PASS (pass_inc_dec
);
799 NEXT_PASS (pass_initialize_regs
);
800 NEXT_PASS (pass_outof_cfg_layout_mode
);
801 NEXT_PASS (pass_ud_rtl_dce
);
802 NEXT_PASS (pass_combine
);
803 NEXT_PASS (pass_if_after_combine
);
804 NEXT_PASS (pass_partition_blocks
);
805 NEXT_PASS (pass_regmove
);
806 NEXT_PASS (pass_split_all_insns
);
807 NEXT_PASS (pass_lower_subreg2
);
808 NEXT_PASS (pass_df_initialize_no_opt
);
809 NEXT_PASS (pass_stack_ptr_mod
);
810 NEXT_PASS (pass_mode_switching
);
811 NEXT_PASS (pass_see
);
812 NEXT_PASS (pass_match_asm_constraints
);
813 NEXT_PASS (pass_sms
);
814 NEXT_PASS (pass_sched
);
815 NEXT_PASS (pass_subregs_of_mode_init
);
816 NEXT_PASS (pass_local_alloc
);
817 NEXT_PASS (pass_global_alloc
);
818 NEXT_PASS (pass_subregs_of_mode_finish
);
819 NEXT_PASS (pass_postreload
);
821 struct opt_pass
**p
= &pass_postreload
.pass
.sub
;
822 NEXT_PASS (pass_postreload_cse
);
823 NEXT_PASS (pass_gcse2
);
824 NEXT_PASS (pass_split_after_reload
);
825 NEXT_PASS (pass_branch_target_load_optimize1
);
826 NEXT_PASS (pass_thread_prologue_and_epilogue
);
827 NEXT_PASS (pass_rtl_dse2
);
828 NEXT_PASS (pass_rtl_seqabstr
);
829 NEXT_PASS (pass_stack_adjustments
);
830 NEXT_PASS (pass_peephole2
);
831 NEXT_PASS (pass_if_after_reload
);
832 NEXT_PASS (pass_regrename
);
833 NEXT_PASS (pass_cprop_hardreg
);
834 NEXT_PASS (pass_fast_rtl_dce
);
835 NEXT_PASS (pass_reorder_blocks
);
836 NEXT_PASS (pass_branch_target_load_optimize2
);
837 NEXT_PASS (pass_leaf_regs
);
838 NEXT_PASS (pass_split_before_sched2
);
839 NEXT_PASS (pass_sched2
);
840 NEXT_PASS (pass_stack_regs
);
842 struct opt_pass
**p
= &pass_stack_regs
.pass
.sub
;
843 NEXT_PASS (pass_split_before_regstack
);
844 NEXT_PASS (pass_stack_regs_run
);
846 NEXT_PASS (pass_compute_alignments
);
847 NEXT_PASS (pass_duplicate_computed_gotos
);
848 NEXT_PASS (pass_variable_tracking
);
849 NEXT_PASS (pass_free_cfg
);
850 NEXT_PASS (pass_machine_reorg
);
851 NEXT_PASS (pass_cleanup_barriers
);
852 NEXT_PASS (pass_delay_slots
);
853 NEXT_PASS (pass_split_for_shorten_branches
);
854 NEXT_PASS (pass_convert_to_eh_region_ranges
);
855 NEXT_PASS (pass_shorten_branches
);
856 NEXT_PASS (pass_set_nothrow_function_flags
);
857 NEXT_PASS (pass_final
);
859 NEXT_PASS (pass_df_finish
);
861 NEXT_PASS (pass_clean_state
);
866 /* Register the passes with the tree dump code. */
867 register_dump_files (all_lowering_passes
, PROP_gimple_any
);
868 all_lowering_passes
->todo_flags_start
|= TODO_set_props
;
869 register_dump_files (all_ipa_passes
,
870 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
872 register_dump_files (all_passes
,
873 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
877 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
878 function CALLBACK for every function in the call graph. Otherwise,
879 call CALLBACK on the current function. */
882 do_per_function (void (*callback
) (void *data
), void *data
)
884 if (current_function_decl
)
888 struct cgraph_node
*node
;
889 for (node
= cgraph_nodes
; node
; node
= node
->next
)
892 push_cfun (DECL_STRUCT_FUNCTION (node
->decl
));
893 current_function_decl
= node
->decl
;
895 free_dominance_info (CDI_DOMINATORS
);
896 free_dominance_info (CDI_POST_DOMINATORS
);
897 current_function_decl
= NULL
;
904 /* Because inlining might remove no-longer reachable nodes, we need to
905 keep the array visible to garbage collector to avoid reading collected
908 static GTY ((length ("nnodes"))) struct cgraph_node
**order
;
910 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
911 function CALLBACK for every function in the call graph. Otherwise,
912 call CALLBACK on the current function. */
915 do_per_function_toporder (void (*callback
) (void *data
), void *data
)
919 if (current_function_decl
)
924 order
= ggc_alloc (sizeof (*order
) * cgraph_n_nodes
);
925 nnodes
= cgraph_postorder (order
);
926 for (i
= nnodes
- 1; i
>= 0; i
--)
928 struct cgraph_node
*node
= order
[i
];
930 /* Allow possibly removed nodes to be garbage collected. */
932 if (node
->analyzed
&& (node
->needed
|| node
->reachable
))
934 push_cfun (DECL_STRUCT_FUNCTION (node
->decl
));
935 current_function_decl
= node
->decl
;
937 free_dominance_info (CDI_DOMINATORS
);
938 free_dominance_info (CDI_POST_DOMINATORS
);
939 current_function_decl
= NULL
;
950 /* Perform all TODO actions that ought to be done on each function. */
953 execute_function_todo (void *data
)
955 unsigned int flags
= (size_t)data
;
956 if (cfun
->curr_properties
& PROP_ssa
)
957 flags
|= TODO_verify_ssa
;
958 flags
&= ~cfun
->last_verified
;
962 /* Always cleanup the CFG before trying to update SSA. */
963 if (flags
& TODO_cleanup_cfg
)
965 bool cleanup
= cleanup_tree_cfg ();
967 if (cleanup
&& (cfun
->curr_properties
& PROP_ssa
))
968 flags
|= TODO_remove_unused_locals
;
970 /* When cleanup_tree_cfg merges consecutive blocks, it may
971 perform some simplistic propagation when removing single
972 valued PHI nodes. This propagation may, in turn, cause the
973 SSA form to become out-of-date (see PR 22037). So, even
974 if the parent pass had not scheduled an SSA update, we may
975 still need to do one. */
976 if (!(flags
& TODO_update_ssa_any
) && need_ssa_update_p ())
977 flags
|= TODO_update_ssa
;
980 if (flags
& TODO_update_ssa_any
)
982 unsigned update_flags
= flags
& TODO_update_ssa_any
;
983 update_ssa (update_flags
);
984 cfun
->last_verified
&= ~TODO_verify_ssa
;
987 if (flags
& TODO_rebuild_alias
)
989 compute_may_aliases ();
990 cfun
->curr_properties
|= PROP_alias
;
993 if (flags
& TODO_remove_unused_locals
)
994 remove_unused_locals ();
996 if ((flags
& TODO_dump_func
) && dump_file
&& current_function_decl
)
998 if (cfun
->curr_properties
& PROP_trees
)
999 dump_function_to_file (current_function_decl
, dump_file
, dump_flags
);
1002 if (dump_flags
& TDF_SLIM
)
1003 print_rtl_slim_with_bb (dump_file
, get_insns (), dump_flags
);
1004 else if ((cfun
->curr_properties
& PROP_cfg
)
1005 && (dump_flags
& TDF_BLOCKS
))
1006 print_rtl_with_bb (dump_file
, get_insns ());
1008 print_rtl (dump_file
, get_insns ());
1010 if ((cfun
->curr_properties
& PROP_cfg
)
1011 && graph_dump_format
!= no_graph
1012 && (dump_flags
& TDF_GRAPH
))
1013 print_rtl_graph_with_bb (dump_file_name
, get_insns ());
1016 /* Flush the file. If verification fails, we won't be able to
1017 close the file before aborting. */
1021 if (flags
& TODO_rebuild_frequencies
)
1023 if (profile_status
== PROFILE_GUESSED
)
1025 loop_optimizer_init (0);
1026 add_noreturn_fake_exit_edges ();
1027 mark_irreducible_loops ();
1028 connect_infinite_loops_to_exit ();
1029 estimate_bb_frequencies ();
1030 remove_fake_exit_edges ();
1031 loop_optimizer_finalize ();
1033 else if (profile_status
== PROFILE_READ
)
1039 #if defined ENABLE_CHECKING
1040 if (flags
& TODO_verify_ssa
)
1042 if (flags
& TODO_verify_flow
)
1043 verify_flow_info ();
1044 if (flags
& TODO_verify_stmts
)
1046 if (flags
& TODO_verify_loops
)
1047 verify_loop_closed_ssa ();
1048 if (flags
& TODO_verify_rtl_sharing
)
1049 verify_rtl_sharing ();
1052 cfun
->last_verified
= flags
& TODO_verify_all
;
1055 /* Perform all TODO actions. */
1057 execute_todo (unsigned int flags
)
1059 #if defined ENABLE_CHECKING
1060 if (need_ssa_update_p ())
1061 gcc_assert (flags
& TODO_update_ssa_any
);
1064 /* Inform the pass whether it is the first time it is run. */
1065 first_pass_instance
= (flags
& TODO_mark_first_instance
) != 0;
1067 do_per_function (execute_function_todo
, (void *)(size_t) flags
);
1069 /* Always remove functions just as before inlining: IPA passes might be
1070 interested to see bodies of extern inline functions that are not inlined
1071 to analyze side effects. The full removal is done just at the end
1072 of IPA pass queue. */
1073 if (flags
& TODO_remove_functions
)
1074 cgraph_remove_unreachable_nodes (true, dump_file
);
1076 if ((flags
& TODO_dump_cgraph
) && dump_file
&& !current_function_decl
)
1078 dump_cgraph (dump_file
);
1079 /* Flush the file. If verification fails, we won't be able to
1080 close the file before aborting. */
1084 if (flags
& TODO_ggc_collect
)
1087 /* Now that the dumping has been done, we can get rid of the optional
1089 if (flags
& TODO_df_finish
)
1090 df_finish_pass ((flags
& TODO_df_verify
) != 0);
1093 /* Verify invariants that should hold between passes. This is a place
1094 to put simple sanity checks. */
1097 verify_interpass_invariants (void)
1099 #ifdef ENABLE_CHECKING
1100 gcc_assert (!fold_deferring_overflow_warnings_p ());
1104 /* Clear the last verified flag. */
1107 clear_last_verified (void *data ATTRIBUTE_UNUSED
)
1109 cfun
->last_verified
= 0;
1112 /* Helper function. Verify that the properties has been turn into the
1113 properties expected by the pass. */
1115 #ifdef ENABLE_CHECKING
1117 verify_curr_properties (void *data
)
1119 unsigned int props
= (size_t)data
;
1120 gcc_assert ((cfun
->curr_properties
& props
) == props
);
1124 /* After executing the pass, apply expected changes to the function
1127 update_properties_after_pass (void *data
)
1129 struct opt_pass
*pass
= data
;
1130 cfun
->curr_properties
= (cfun
->curr_properties
| pass
->properties_provided
)
1131 & ~pass
->properties_destroyed
;
1135 execute_one_pass (struct opt_pass
*pass
)
1137 bool initializing_dump
;
1138 unsigned int todo_after
= 0;
1140 /* IPA passes are executed on whole program, so cfun should be NULL.
1141 Ohter passes needs function context set. */
1142 if (pass
->type
== SIMPLE_IPA_PASS
)
1143 gcc_assert (!cfun
&& !current_function_decl
);
1146 gcc_assert (cfun
&& current_function_decl
);
1147 gcc_assert (!(cfun
->curr_properties
& PROP_trees
)
1148 || pass
->type
!= RTL_PASS
);
1151 current_pass
= pass
;
1153 /* See if we're supposed to run this pass. */
1154 if (pass
->gate
&& !pass
->gate ())
1157 if (!quiet_flag
&& !cfun
)
1158 fprintf (stderr
, " <%s>", pass
->name
? pass
->name
: "");
1160 if (pass
->todo_flags_start
& TODO_set_props
)
1161 cfun
->curr_properties
= pass
->properties_required
;
1163 /* Note that the folders should only create gimple expressions.
1164 This is a hack until the new folder is ready. */
1165 in_gimple_form
= (cfun
&& (cfun
->curr_properties
& PROP_trees
)) != 0;
1167 /* Run pre-pass verification. */
1168 execute_todo (pass
->todo_flags_start
);
1170 #ifdef ENABLE_CHECKING
1171 do_per_function (verify_curr_properties
,
1172 (void *)(size_t)pass
->properties_required
);
1175 /* If a dump file name is present, open it if enabled. */
1176 if (pass
->static_pass_number
!= -1)
1178 initializing_dump
= !dump_initialized_p (pass
->static_pass_number
);
1179 dump_file_name
= get_dump_file_name (pass
->static_pass_number
);
1180 dump_file
= dump_begin (pass
->static_pass_number
, &dump_flags
);
1181 if (dump_file
&& current_function_decl
)
1183 const char *dname
, *aname
;
1184 dname
= lang_hooks
.decl_printable_name (current_function_decl
, 2);
1185 aname
= (IDENTIFIER_POINTER
1186 (DECL_ASSEMBLER_NAME (current_function_decl
)));
1187 fprintf (dump_file
, "\n;; Function %s (%s)%s\n\n", dname
, aname
,
1188 cfun
->function_frequency
== FUNCTION_FREQUENCY_HOT
1190 : cfun
->function_frequency
== FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
1191 ? " (unlikely executed)"
1196 initializing_dump
= false;
1198 /* If a timevar is present, start it. */
1200 timevar_push (pass
->tv_id
);
1205 todo_after
= pass
->execute ();
1206 do_per_function (clear_last_verified
, NULL
);
1211 timevar_pop (pass
->tv_id
);
1213 do_per_function (update_properties_after_pass
, pass
);
1215 if (initializing_dump
1217 && graph_dump_format
!= no_graph
1218 && (cfun
->curr_properties
& (PROP_cfg
| PROP_rtl
))
1219 == (PROP_cfg
| PROP_rtl
))
1221 get_dump_file_info (pass
->static_pass_number
)->flags
|= TDF_GRAPH
;
1222 dump_flags
|= TDF_GRAPH
;
1223 clean_graph_dump_file (dump_file_name
);
1226 /* Run post-pass cleanup and verification. */
1227 execute_todo (todo_after
| pass
->todo_flags_finish
);
1228 verify_interpass_invariants ();
1230 if (!current_function_decl
)
1231 cgraph_process_new_functions ();
1233 /* Flush and close dump file. */
1236 free (CONST_CAST (char *, dump_file_name
));
1237 dump_file_name
= NULL
;
1242 dump_end (pass
->static_pass_number
, dump_file
);
1246 current_pass
= NULL
;
1247 /* Reset in_gimple_form to not break non-unit-at-a-time mode. */
1248 in_gimple_form
= false;
1254 execute_pass_list (struct opt_pass
*pass
)
1258 gcc_assert (pass
->type
== GIMPLE_PASS
1259 || pass
->type
== RTL_PASS
);
1260 if (execute_one_pass (pass
) && pass
->sub
)
1261 execute_pass_list (pass
->sub
);
1267 /* Same as execute_pass_list but assume that subpasses of IPA passes
1268 are local passes. */
1270 execute_ipa_pass_list (struct opt_pass
*pass
)
1274 gcc_assert (!current_function_decl
);
1276 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
);
1277 if (execute_one_pass (pass
) && pass
->sub
)
1279 if (pass
->sub
->type
== GIMPLE_PASS
)
1280 do_per_function_toporder ((void (*)(void *))execute_pass_list
,
1282 else if (pass
->sub
->type
== SIMPLE_IPA_PASS
)
1283 execute_ipa_pass_list (pass
->sub
);
1287 if (!current_function_decl
)
1288 cgraph_process_new_functions ();
1293 #include "gt-passes.h"