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 2, 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 COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
23 /* This is the top level of cc1/c++.
24 It parses command args, opens files, invokes the various passes
25 in the proper order, and counts the time used by each.
26 Error messages and low-level interface to malloc also handled here. */
29 #undef FLOAT /* This is for hpux. They should change hpux. */
30 #undef FFS /* Some systems define this in param.h. */
32 #include "coretypes.h"
36 #ifdef HAVE_SYS_RESOURCE_H
37 # include <sys/resource.h>
40 #ifdef HAVE_SYS_TIMES_H
41 # include <sys/times.h>
50 #include "insn-attr.h"
51 #include "insn-config.h"
52 #include "insn-flags.h"
53 #include "hard-reg-set.h"
60 #include "basic-block.h"
66 #include "diagnostic.h"
69 #include "dwarf2asm.h"
70 #include "integrate.h"
74 #include "langhooks.h"
75 #include "cfglayout.h"
77 #include "hosthooks.h"
81 #include "value-prof.h"
82 #include "tree-inline.h"
83 #include "tree-flow.h"
84 #include "tree-pass.h"
85 #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 /* Global variables used to communicate with passes. */
110 /* This is called from various places for FUNCTION_DECL, VAR_DECL,
113 This does nothing for local (non-static) variables, unless the
114 variable is a register variable with DECL_ASSEMBLER_NAME set. In
115 that case, or if the variable is not an automatic, it sets up the
116 RTL and outputs any assembler code (label definition, storage
117 allocation and initialization).
119 DECL is the declaration. TOP_LEVEL is nonzero
120 if this declaration is not within a function. */
123 rest_of_decl_compilation (tree decl
,
127 /* We deferred calling assemble_alias so that we could collect
128 other attributes such as visibility. Emit the alias now. */
131 alias
= lookup_attribute ("alias", DECL_ATTRIBUTES (decl
));
134 alias
= TREE_VALUE (TREE_VALUE (alias
));
135 alias
= get_identifier (TREE_STRING_POINTER (alias
));
136 assemble_alias (decl
, alias
);
140 /* Can't defer this, because it needs to happen before any
141 later function definitions are processed. */
142 if (DECL_ASSEMBLER_NAME_SET_P (decl
) && DECL_REGISTER (decl
))
143 make_decl_rtl (decl
);
145 /* Forward declarations for nested functions are not "external",
146 but we need to treat them as if they were. */
147 if (TREE_STATIC (decl
) || DECL_EXTERNAL (decl
)
148 || TREE_CODE (decl
) == FUNCTION_DECL
)
150 timevar_push (TV_VARCONST
);
152 /* Don't output anything when a tentative file-scope definition
153 is seen. But at end of compilation, do output code for them.
155 We do output all variables when unit-at-a-time is active and rely on
156 callgraph code to defer them except for forward declarations
157 (see gcc.c-torture/compile/920624-1.c) */
159 || !DECL_DEFER_OUTPUT (decl
)
160 || DECL_INITIAL (decl
))
161 && !DECL_EXTERNAL (decl
))
163 if (TREE_CODE (decl
) != FUNCTION_DECL
)
164 varpool_finalize_decl (decl
);
166 assemble_variable (decl
, top_level
, at_end
, 0);
169 #ifdef ASM_FINISH_DECLARE_OBJECT
170 if (decl
== last_assemble_variable_decl
)
172 ASM_FINISH_DECLARE_OBJECT (asm_out_file
, decl
,
177 timevar_pop (TV_VARCONST
);
179 else if (TREE_CODE (decl
) == TYPE_DECL
180 /* Like in rest_of_type_compilation, avoid confusing the debug
181 information machinery when there are errors. */
182 && !(sorrycount
|| errorcount
))
184 timevar_push (TV_SYMOUT
);
185 debug_hooks
->type_decl (decl
, !top_level
);
186 timevar_pop (TV_SYMOUT
);
189 /* Let cgraph know about the existence of variables. */
190 if (TREE_CODE (decl
) == VAR_DECL
&& !DECL_EXTERNAL (decl
))
194 /* Called after finishing a record, union or enumeral type. */
197 rest_of_type_compilation (tree type
, int toplev
)
199 /* Avoid confusing the debug information machinery when there are
201 if (errorcount
!= 0 || sorrycount
!= 0)
204 timevar_push (TV_SYMOUT
);
205 debug_hooks
->type_decl (TYPE_STUB_DECL (type
), !toplev
);
206 timevar_pop (TV_SYMOUT
);
212 finish_optimization_passes (void)
214 enum tree_dump_index i
;
215 struct dump_file_info
*dfi
;
218 timevar_push (TV_DUMP
);
219 if (profile_arc_flag
|| flag_test_coverage
|| flag_branch_probabilities
)
221 dump_file
= dump_begin (pass_profile
.static_pass_number
, NULL
);
224 dump_end (pass_profile
.static_pass_number
, dump_file
);
229 dump_file
= dump_begin (pass_combine
.static_pass_number
, NULL
);
232 dump_combine_total_stats (dump_file
);
233 dump_end (pass_combine
.static_pass_number
, dump_file
);
237 /* Do whatever is necessary to finish printing the graphs. */
238 if (graph_dump_format
!= no_graph
)
239 for (i
= TDI_end
; (dfi
= get_dump_file_info (i
)) != NULL
; ++i
)
240 if (dump_initialized_p (i
)
241 && (dfi
->flags
& TDF_GRAPH
) != 0
242 && (name
= get_dump_file_name (i
)) != NULL
)
244 finish_graph_dump_file (name
);
248 timevar_pop (TV_DUMP
);
252 gate_rest_of_compilation (void)
254 /* Early return if there were errors. We can run afoul of our
255 consistency checks, and there's not really much point in fixing them. */
256 return !(rtl_dump_and_exit
|| flag_syntax_only
|| errorcount
|| sorrycount
);
259 struct tree_opt_pass pass_rest_of_compilation
=
262 gate_rest_of_compilation
, /* gate */
266 0, /* static_pass_number */
267 TV_REST_OF_COMPILATION
, /* tv_id */
268 PROP_rtl
, /* properties_required */
269 0, /* properties_provided */
270 0, /* properties_destroyed */
271 0, /* todo_flags_start */
272 TODO_ggc_collect
, /* todo_flags_finish */
277 gate_postreload (void)
279 return reload_completed
;
282 struct tree_opt_pass pass_postreload
=
285 gate_postreload
, /* gate */
289 0, /* static_pass_number */
291 PROP_rtl
, /* properties_required */
292 0, /* properties_provided */
293 0, /* properties_destroyed */
294 0, /* todo_flags_start */
295 TODO_ggc_collect
, /* todo_flags_finish */
301 /* The root of the compilation pass tree, once constructed. */
302 struct tree_opt_pass
*all_passes
, *all_ipa_passes
, *all_lowering_passes
;
304 /* Iterate over the pass tree allocating dump file numbers. We want
305 to do this depth first, and independent of whether the pass is
309 register_one_dump_file (struct tree_opt_pass
*pass
, bool ipa
, int properties
)
311 char *dot_name
, *flag_name
, *glob_name
;
316 /* See below in next_pass_1. */
318 if (pass
->static_pass_number
!= -1)
319 sprintf (num
, "%d", ((int) pass
->static_pass_number
< 0
320 ? 1 : pass
->static_pass_number
));
322 dot_name
= concat (".", pass
->name
, num
, NULL
);
324 prefix
= "ipa-", flags
= TDF_IPA
;
325 else if (properties
& PROP_trees
)
326 prefix
= "tree-", flags
= TDF_TREE
;
328 prefix
= "rtl-", flags
= TDF_RTL
;
330 flag_name
= concat (prefix
, pass
->name
, num
, NULL
);
331 glob_name
= concat (prefix
, pass
->name
, NULL
);
332 pass
->static_pass_number
= dump_register (dot_name
, flag_name
, glob_name
,
333 flags
, pass
->letter
);
336 /* Recursive worker function for register_dump_files. */
339 register_dump_files_1 (struct tree_opt_pass
*pass
, bool ipa
, int properties
)
343 int new_properties
= (properties
| pass
->properties_provided
)
344 & ~pass
->properties_destroyed
;
347 register_one_dump_file (pass
, ipa
, new_properties
);
350 new_properties
= register_dump_files_1 (pass
->sub
, false,
353 /* If we have a gate, combine the properties that we could have with
354 and without the pass being examined. */
356 properties
&= new_properties
;
358 properties
= new_properties
;
367 /* Register the dump files for the pipeline starting at PASS. IPA is
368 true if the pass is inter-procedural, and PROPERTIES reflects the
369 properties that are guaranteed to be available at the beginning of
373 register_dump_files (struct tree_opt_pass
*pass
, bool ipa
, int properties
)
375 pass
->properties_required
|= properties
;
376 register_dump_files_1 (pass
, ipa
, properties
);
379 /* Add a pass to the pass list. Duplicate the pass if it's already
382 static struct tree_opt_pass
**
383 next_pass_1 (struct tree_opt_pass
**list
, struct tree_opt_pass
*pass
)
385 /* A nonzero static_pass_number indicates that the
386 pass is already in the list. */
387 if (pass
->static_pass_number
)
389 struct tree_opt_pass
*new;
391 new = xmalloc (sizeof (*new));
392 memcpy (new, pass
, sizeof (*new));
395 /* Indicate to register_dump_files that this pass has duplicates,
396 and so it should rename the dump file. The first instance will
397 be -1, and be number of duplicates = -static_pass_number - 1.
398 Subsequent instances will be > 0 and just the duplicate number. */
401 pass
->static_pass_number
-= 1;
402 new->static_pass_number
= -pass
->static_pass_number
;
409 pass
->static_pass_number
= -1;
413 return &(*list
)->next
;
417 /* Construct the pass tree. The sequencing of passes is driven by
420 cgraph_finalize_compilation_unit ()
421 for each node N in the cgraph
422 cgraph_analyze_function (N)
423 cgraph_lower_function (N) -> all_lowering_passes
425 If we are optimizing, cgraph_optimize is then invoked:
428 ipa_passes () -> all_ipa_passes
429 cgraph_expand_all_functions ()
430 for each node N in the cgraph
431 cgraph_expand_function (N)
432 lang_hooks.callgraph.expand_function (DECL (N))
433 tree_rest_of_compilation (DECL (N)) -> all_passes
437 init_optimization_passes (void)
439 struct tree_opt_pass
**p
;
441 #define NEXT_PASS(PASS) (p = next_pass_1 (p, &PASS))
443 /* All passes needed to lower the function into shape optimizers can
444 operate on. These passes are always run first on the function, but
445 backend might produce already lowered functions that are not processed
447 p
= &all_lowering_passes
;
448 NEXT_PASS (pass_remove_useless_stmts
);
449 NEXT_PASS (pass_mudflap_1
);
450 NEXT_PASS (pass_lower_omp
);
451 NEXT_PASS (pass_lower_cf
);
452 NEXT_PASS (pass_lower_eh
);
453 NEXT_PASS (pass_build_cfg
);
454 NEXT_PASS (pass_lower_complex_O0
);
455 NEXT_PASS (pass_lower_vector
);
456 NEXT_PASS (pass_warn_function_return
);
457 NEXT_PASS (pass_build_cgraph_edges
);
458 NEXT_PASS (pass_inline_parameters
);
461 /* Interprocedural optimization passes.
462 All these passes are ignored in -fno-unit-at-a-time
463 except for subpasses of early_local_passes. */
465 NEXT_PASS (pass_ipa_function_and_variable_visibility
);
466 NEXT_PASS (pass_ipa_early_inline
);
468 struct tree_opt_pass
**p
= &pass_ipa_early_inline
.sub
;
469 NEXT_PASS (pass_early_inline
);
470 NEXT_PASS (pass_inline_parameters
);
471 NEXT_PASS (pass_rebuild_cgraph_edges
);
473 NEXT_PASS (pass_early_local_passes
);
475 struct tree_opt_pass
**p
= &pass_early_local_passes
.sub
;
476 NEXT_PASS (pass_tree_profile
);
477 NEXT_PASS (pass_cleanup_cfg
);
478 NEXT_PASS (pass_init_datastructures
);
479 NEXT_PASS (pass_expand_omp
);
480 NEXT_PASS (pass_all_early_optimizations
);
482 struct tree_opt_pass
**p
= &pass_all_early_optimizations
.sub
;
483 NEXT_PASS (pass_referenced_vars
);
484 NEXT_PASS (pass_reset_cc_flags
);
485 NEXT_PASS (pass_build_ssa
);
486 NEXT_PASS (pass_early_warn_uninitialized
);
487 NEXT_PASS (pass_rebuild_cgraph_edges
);
488 NEXT_PASS (pass_early_inline
);
489 NEXT_PASS (pass_cleanup_cfg
);
490 NEXT_PASS (pass_rename_ssa_copies
);
491 NEXT_PASS (pass_ccp
);
492 NEXT_PASS (pass_forwprop
);
493 NEXT_PASS (pass_sra_early
);
494 NEXT_PASS (pass_copy_prop
);
495 NEXT_PASS (pass_merge_phi
);
496 NEXT_PASS (pass_dce
);
497 NEXT_PASS (pass_tail_recursion
);
498 NEXT_PASS (pass_profile
);
499 NEXT_PASS (pass_release_ssa_names
);
501 NEXT_PASS (pass_rebuild_cgraph_edges
);
502 NEXT_PASS (pass_inline_parameters
);
504 NEXT_PASS (pass_ipa_increase_alignment
);
505 NEXT_PASS (pass_ipa_cp
);
506 NEXT_PASS (pass_ipa_inline
);
507 NEXT_PASS (pass_ipa_reference
);
508 NEXT_PASS (pass_ipa_pure_const
);
509 NEXT_PASS (pass_ipa_type_escape
);
510 NEXT_PASS (pass_ipa_pta
);
513 /* These passes are run after IPA passes on every function that is being
514 output to the assembler file. */
516 NEXT_PASS (pass_apply_inline
);
517 NEXT_PASS (pass_all_optimizations
);
519 struct tree_opt_pass
**p
= &pass_all_optimizations
.sub
;
520 NEXT_PASS (pass_create_structure_vars
);
521 NEXT_PASS (pass_may_alias
);
522 NEXT_PASS (pass_return_slot
);
523 NEXT_PASS (pass_rename_ssa_copies
);
525 /* Initial scalar cleanups. */
526 NEXT_PASS (pass_ccp
);
527 NEXT_PASS (pass_fre
);
528 NEXT_PASS (pass_dce
);
529 NEXT_PASS (pass_forwprop
);
530 NEXT_PASS (pass_copy_prop
);
531 NEXT_PASS (pass_merge_phi
);
532 NEXT_PASS (pass_vrp
);
533 NEXT_PASS (pass_dce
);
534 NEXT_PASS (pass_dominator
);
536 /* The only const/copy propagation opportunities left after
537 DOM should be due to degenerate PHI nodes. So rather than
538 run the full propagators, run a specialized pass which
539 only examines PHIs to discover const/copy propagation
541 NEXT_PASS (pass_phi_only_cprop
);
543 NEXT_PASS (pass_phiopt
);
544 NEXT_PASS (pass_may_alias
);
545 NEXT_PASS (pass_tail_recursion
);
547 NEXT_PASS (pass_stdarg
);
548 NEXT_PASS (pass_lower_complex
);
549 NEXT_PASS (pass_sra
);
550 /* FIXME: SRA may generate arbitrary gimple code, exposing new
551 aliased and call-clobbered variables. As mentioned below,
552 pass_may_alias should be a TODO item. */
553 NEXT_PASS (pass_may_alias
);
554 NEXT_PASS (pass_rename_ssa_copies
);
555 NEXT_PASS (pass_dominator
);
557 /* The only const/copy propagation opportunities left after
558 DOM should be due to degenerate PHI nodes. So rather than
559 run the full propagators, run a specialized pass which
560 only examines PHIs to discover const/copy propagation
562 NEXT_PASS (pass_phi_only_cprop
);
564 NEXT_PASS (pass_reassoc
);
565 NEXT_PASS (pass_dce
);
566 NEXT_PASS (pass_dse
);
567 NEXT_PASS (pass_may_alias
);
568 NEXT_PASS (pass_forwprop
);
569 NEXT_PASS (pass_phiopt
);
570 NEXT_PASS (pass_object_sizes
);
571 NEXT_PASS (pass_store_ccp
);
572 NEXT_PASS (pass_store_copy_prop
);
573 NEXT_PASS (pass_fold_builtins
);
574 NEXT_PASS (pass_cse_sincos
);
575 /* FIXME: May alias should a TODO but for 4.0.0,
576 we add may_alias right after fold builtins
577 which can create arbitrary GIMPLE. */
578 NEXT_PASS (pass_may_alias
);
579 NEXT_PASS (pass_split_crit_edges
);
580 NEXT_PASS (pass_pre
);
581 NEXT_PASS (pass_may_alias
);
582 NEXT_PASS (pass_sink_code
);
583 NEXT_PASS (pass_tree_loop
);
585 struct tree_opt_pass
**p
= &pass_tree_loop
.sub
;
586 NEXT_PASS (pass_tree_loop_init
);
587 NEXT_PASS (pass_copy_prop
);
588 NEXT_PASS (pass_lim
);
589 NEXT_PASS (pass_tree_unswitch
);
590 NEXT_PASS (pass_scev_cprop
);
591 NEXT_PASS (pass_empty_loop
);
592 NEXT_PASS (pass_record_bounds
);
593 NEXT_PASS (pass_check_data_deps
);
594 NEXT_PASS (pass_linear_transform
);
595 NEXT_PASS (pass_iv_canon
);
596 NEXT_PASS (pass_if_conversion
);
597 NEXT_PASS (pass_vectorize
);
599 struct tree_opt_pass
**p
= &pass_vectorize
.sub
;
600 NEXT_PASS (pass_lower_vector_ssa
);
601 NEXT_PASS (pass_dce_loop
);
603 /* NEXT_PASS (pass_may_alias) cannot be done again because the
604 vectorizer creates alias relations that are not supported by
606 NEXT_PASS (pass_complete_unroll
);
607 NEXT_PASS (pass_loop_prefetch
);
608 NEXT_PASS (pass_iv_optimize
);
609 NEXT_PASS (pass_tree_loop_done
);
611 NEXT_PASS (pass_cse_reciprocals
);
612 NEXT_PASS (pass_reassoc
);
613 NEXT_PASS (pass_vrp
);
614 NEXT_PASS (pass_dominator
);
616 /* The only const/copy propagation opportunities left after
617 DOM should be due to degenerate PHI nodes. So rather than
618 run the full propagators, run a specialized pass which
619 only examines PHIs to discover const/copy propagation
621 NEXT_PASS (pass_phi_only_cprop
);
623 NEXT_PASS (pass_cd_dce
);
625 /* FIXME: If DCE is not run before checking for uninitialized uses,
626 we may get false warnings (e.g., testsuite/gcc.dg/uninit-5.c).
627 However, this also causes us to misdiagnose cases that should be
628 real warnings (e.g., testsuite/gcc.dg/pr18501.c).
630 To fix the false positives in uninit-5.c, we would have to
631 account for the predicates protecting the set and the use of each
632 variable. Using a representation like Gated Single Assignment
634 NEXT_PASS (pass_late_warn_uninitialized
);
635 NEXT_PASS (pass_dse
);
636 NEXT_PASS (pass_forwprop
);
637 NEXT_PASS (pass_phiopt
);
638 NEXT_PASS (pass_tail_calls
);
639 NEXT_PASS (pass_rename_ssa_copies
);
640 NEXT_PASS (pass_uncprop
);
641 NEXT_PASS (pass_del_ssa
);
642 NEXT_PASS (pass_nrv
);
643 NEXT_PASS (pass_mark_used_blocks
);
644 NEXT_PASS (pass_cleanup_cfg_post_optimizing
);
646 NEXT_PASS (pass_warn_function_noreturn
);
647 NEXT_PASS (pass_free_datastructures
);
648 NEXT_PASS (pass_mudflap_2
);
649 NEXT_PASS (pass_free_cfg_annotations
);
650 NEXT_PASS (pass_expand
);
651 NEXT_PASS (pass_rest_of_compilation
);
653 struct tree_opt_pass
**p
= &pass_rest_of_compilation
.sub
;
654 NEXT_PASS (pass_init_function
);
655 NEXT_PASS (pass_jump
);
656 NEXT_PASS (pass_insn_locators_initialize
);
657 NEXT_PASS (pass_rtl_eh
);
658 NEXT_PASS (pass_initial_value_sets
);
659 NEXT_PASS (pass_unshare_all_rtl
);
660 NEXT_PASS (pass_instantiate_virtual_regs
);
661 NEXT_PASS (pass_into_cfg_layout_mode
);
662 NEXT_PASS (pass_jump2
);
663 NEXT_PASS (pass_lower_subreg
);
664 NEXT_PASS (pass_cse
);
665 NEXT_PASS (pass_rtl_fwprop
);
666 NEXT_PASS (pass_gcse
);
667 NEXT_PASS (pass_jump_bypass
);
668 NEXT_PASS (pass_rtl_ifcvt
);
669 NEXT_PASS (pass_tracer
);
670 /* Perform loop optimizations. It might be better to do them a bit
671 sooner, but we want the profile feedback to work more
673 NEXT_PASS (pass_loop2
);
675 struct tree_opt_pass
**p
= &pass_loop2
.sub
;
676 NEXT_PASS (pass_rtl_loop_init
);
677 NEXT_PASS (pass_rtl_move_loop_invariants
);
678 NEXT_PASS (pass_rtl_unswitch
);
679 NEXT_PASS (pass_rtl_unroll_and_peel_loops
);
680 NEXT_PASS (pass_rtl_doloop
);
681 NEXT_PASS (pass_rtl_loop_done
);
684 NEXT_PASS (pass_web
);
685 NEXT_PASS (pass_cse2
);
686 NEXT_PASS (pass_rtl_fwprop_addr
);
687 NEXT_PASS (pass_outof_cfg_layout_mode
);
688 NEXT_PASS (pass_life
);
689 NEXT_PASS (pass_combine
);
690 NEXT_PASS (pass_if_after_combine
);
691 NEXT_PASS (pass_partition_blocks
);
692 NEXT_PASS (pass_regmove
);
693 NEXT_PASS (pass_split_all_insns
);
694 NEXT_PASS (pass_lower_subreg2
);
695 NEXT_PASS (pass_mode_switching
);
696 NEXT_PASS (pass_see
);
697 NEXT_PASS (pass_recompute_reg_usage
);
698 NEXT_PASS (pass_sms
);
699 NEXT_PASS (pass_sched
);
700 NEXT_PASS (pass_local_alloc
);
701 NEXT_PASS (pass_global_alloc
);
702 NEXT_PASS (pass_postreload
);
704 struct tree_opt_pass
**p
= &pass_postreload
.sub
;
705 NEXT_PASS (pass_postreload_cse
);
706 NEXT_PASS (pass_gcse2
);
707 NEXT_PASS (pass_flow2
);
708 NEXT_PASS (pass_rtl_seqabstr
);
709 NEXT_PASS (pass_stack_adjustments
);
710 NEXT_PASS (pass_peephole2
);
711 NEXT_PASS (pass_if_after_reload
);
712 NEXT_PASS (pass_regrename
);
713 NEXT_PASS (pass_reorder_blocks
);
714 NEXT_PASS (pass_branch_target_load_optimize
);
715 NEXT_PASS (pass_leaf_regs
);
716 NEXT_PASS (pass_sched2
);
717 NEXT_PASS (pass_split_before_regstack
);
718 NEXT_PASS (pass_stack_regs
);
719 NEXT_PASS (pass_compute_alignments
);
720 NEXT_PASS (pass_duplicate_computed_gotos
);
721 NEXT_PASS (pass_variable_tracking
);
722 NEXT_PASS (pass_free_cfg
);
723 NEXT_PASS (pass_machine_reorg
);
724 NEXT_PASS (pass_cleanup_barriers
);
725 NEXT_PASS (pass_delay_slots
);
726 NEXT_PASS (pass_split_for_shorten_branches
);
727 NEXT_PASS (pass_convert_to_eh_region_ranges
);
728 NEXT_PASS (pass_shorten_branches
);
729 NEXT_PASS (pass_set_nothrow_function_flags
);
730 NEXT_PASS (pass_final
);
733 NEXT_PASS (pass_clean_state
);
738 /* Register the passes with the tree dump code. */
739 register_dump_files (all_lowering_passes
, false, PROP_gimple_any
);
740 all_lowering_passes
->todo_flags_start
|= TODO_set_props
;
741 register_dump_files (all_ipa_passes
, true,
742 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
744 register_dump_files (all_passes
, false,
745 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
749 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
750 function CALLBACK for every function in the call graph. Otherwise,
751 call CALLBACK on the current function. */
754 do_per_function (void (*callback
) (void *data
), void *data
)
756 if (current_function_decl
)
760 struct cgraph_node
*node
;
761 for (node
= cgraph_nodes
; node
; node
= node
->next
)
764 push_cfun (DECL_STRUCT_FUNCTION (node
->decl
));
765 current_function_decl
= node
->decl
;
767 free_dominance_info (CDI_DOMINATORS
);
768 free_dominance_info (CDI_POST_DOMINATORS
);
769 current_function_decl
= NULL
;
776 /* Because inlining might remove no-longer reachable nodes, we need to
777 keep the array visible to garbage collector to avoid reading collected
780 static GTY ((length ("nnodes"))) struct cgraph_node
**order
;
782 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
783 function CALLBACK for every function in the call graph. Otherwise,
784 call CALLBACK on the current function. */
787 do_per_function_toporder (void (*callback
) (void *data
), void *data
)
791 if (current_function_decl
)
796 order
= ggc_alloc (sizeof (*order
) * cgraph_n_nodes
);
797 nnodes
= cgraph_postorder (order
);
798 for (i
= nnodes
- 1; i
>= 0; i
--)
800 struct cgraph_node
*node
= order
[i
];
802 /* Allow possibly removed nodes to be garbage collected. */
804 if (node
->analyzed
&& (node
->needed
|| node
->reachable
))
806 push_cfun (DECL_STRUCT_FUNCTION (node
->decl
));
807 current_function_decl
= node
->decl
;
809 free_dominance_info (CDI_DOMINATORS
);
810 free_dominance_info (CDI_POST_DOMINATORS
);
811 current_function_decl
= NULL
;
822 /* Perform all TODO actions that ought to be done on each function. */
825 execute_function_todo (void *data
)
827 unsigned int flags
= (size_t)data
;
828 if (cfun
->curr_properties
& PROP_ssa
)
829 flags
|= TODO_verify_ssa
;
830 flags
&= ~cfun
->last_verified
;
834 /* Always cleanup the CFG before trying to update SSA. */
835 if (flags
& TODO_cleanup_cfg
)
840 cleanup
= cleanup_tree_cfg_loop ();
842 cleanup
= cleanup_tree_cfg ();
844 if (cleanup
&& (cfun
->curr_properties
& PROP_ssa
))
845 flags
|= TODO_remove_unused_locals
;
847 /* When cleanup_tree_cfg merges consecutive blocks, it may
848 perform some simplistic propagation when removing single
849 valued PHI nodes. This propagation may, in turn, cause the
850 SSA form to become out-of-date (see PR 22037). So, even
851 if the parent pass had not scheduled an SSA update, we may
852 still need to do one. */
853 if (!(flags
& TODO_update_ssa_any
) && need_ssa_update_p ())
854 flags
|= TODO_update_ssa
;
857 if (flags
& TODO_update_ssa_any
)
859 unsigned update_flags
= flags
& TODO_update_ssa_any
;
860 update_ssa (update_flags
);
861 cfun
->last_verified
&= ~TODO_verify_ssa
;
864 if (flags
& TODO_remove_unused_locals
)
865 remove_unused_locals ();
867 if ((flags
& TODO_dump_func
)
868 && dump_file
&& current_function_decl
)
870 if (cfun
->curr_properties
& PROP_trees
)
871 dump_function_to_file (current_function_decl
,
872 dump_file
, dump_flags
);
875 if (dump_flags
& TDF_SLIM
)
876 print_rtl_slim_with_bb (dump_file
, get_insns (), dump_flags
);
877 else if ((cfun
->curr_properties
& PROP_cfg
)
878 && (dump_flags
& TDF_BLOCKS
))
879 print_rtl_with_bb (dump_file
, get_insns ());
881 print_rtl (dump_file
, get_insns ());
883 if (cfun
->curr_properties
& PROP_cfg
884 && graph_dump_format
!= no_graph
885 && (dump_flags
& TDF_GRAPH
))
886 print_rtl_graph_with_bb (dump_file_name
, get_insns ());
889 /* Flush the file. If verification fails, we won't be able to
890 close the file before aborting. */
894 if (flags
& TODO_rebuild_frequencies
)
896 if (profile_status
== PROFILE_GUESSED
)
898 loop_optimizer_init (0);
899 add_noreturn_fake_exit_edges ();
900 mark_irreducible_loops ();
901 connect_infinite_loops_to_exit ();
902 estimate_bb_frequencies ();
903 remove_fake_exit_edges ();
904 loop_optimizer_finalize ();
906 else if (profile_status
== PROFILE_READ
)
912 #if defined ENABLE_CHECKING
913 if (flags
& TODO_verify_ssa
)
915 if (flags
& TODO_verify_flow
)
917 if (flags
& TODO_verify_stmts
)
919 if (flags
& TODO_verify_loops
)
920 verify_loop_closed_ssa ();
923 cfun
->last_verified
= flags
& TODO_verify_all
;
926 /* Perform all TODO actions. */
928 execute_todo (unsigned int flags
)
930 #if defined ENABLE_CHECKING
931 if (need_ssa_update_p ())
932 gcc_assert (flags
& TODO_update_ssa_any
);
935 do_per_function (execute_function_todo
, (void *)(size_t) flags
);
937 /* Always remove functions just as before inlining: IPA passes might be
938 interested to see bodies of extern inline functions that are not inlined
939 to analyze side effects. The full removal is done just at the end
940 of IPA pass queue. */
941 if (flags
& TODO_remove_functions
)
942 cgraph_remove_unreachable_nodes (true, dump_file
);
944 if ((flags
& TODO_dump_cgraph
)
945 && dump_file
&& !current_function_decl
)
947 dump_cgraph (dump_file
);
948 /* Flush the file. If verification fails, we won't be able to
949 close the file before aborting. */
953 if (flags
& TODO_ggc_collect
)
959 /* Verify invariants that should hold between passes. This is a place
960 to put simple sanity checks. */
963 verify_interpass_invariants (void)
965 #ifdef ENABLE_CHECKING
966 gcc_assert (!fold_deferring_overflow_warnings_p ());
970 /* Clear the last verified flag. */
973 clear_last_verified (void *data ATTRIBUTE_UNUSED
)
975 cfun
->last_verified
= 0;
978 /* Helper function. Verify that the properties has been turn into the
979 properties expected by the pass. */
981 #ifdef ENABLE_CHECKING
983 verify_curr_properties (void *data
)
985 unsigned int props
= (size_t)data
;
986 gcc_assert ((cfun
->curr_properties
& props
) == props
);
990 /* After executing the pass, apply expected changes to the function
993 update_properties_after_pass (void *data
)
995 struct tree_opt_pass
*pass
= data
;
996 cfun
->curr_properties
= (cfun
->curr_properties
| pass
->properties_provided
)
997 & ~pass
->properties_destroyed
;
1001 execute_one_pass (struct tree_opt_pass
*pass
)
1003 bool initializing_dump
;
1004 unsigned int todo_after
= 0;
1006 /* See if we're supposed to run this pass. */
1007 if (pass
->gate
&& !pass
->gate ())
1010 if (!quiet_flag
&& !cfun
)
1011 fprintf (stderr
, " <%s>", pass
->name
? pass
->name
: "");
1013 if (pass
->todo_flags_start
& TODO_set_props
)
1014 cfun
->curr_properties
= pass
->properties_required
;
1016 /* Note that the folders should only create gimple expressions.
1017 This is a hack until the new folder is ready. */
1018 in_gimple_form
= (cfun
&& (cfun
->curr_properties
& PROP_trees
)) != 0;
1020 /* Run pre-pass verification. */
1021 execute_todo (pass
->todo_flags_start
);
1023 #ifdef ENABLE_CHECKING
1024 do_per_function (verify_curr_properties
,
1025 (void *)(size_t)pass
->properties_required
);
1028 /* If a dump file name is present, open it if enabled. */
1029 if (pass
->static_pass_number
!= -1)
1031 initializing_dump
= !dump_initialized_p (pass
->static_pass_number
);
1032 dump_file_name
= get_dump_file_name (pass
->static_pass_number
);
1033 dump_file
= dump_begin (pass
->static_pass_number
, &dump_flags
);
1034 if (dump_file
&& current_function_decl
)
1036 const char *dname
, *aname
;
1037 dname
= lang_hooks
.decl_printable_name (current_function_decl
, 2);
1038 aname
= (IDENTIFIER_POINTER
1039 (DECL_ASSEMBLER_NAME (current_function_decl
)));
1040 fprintf (dump_file
, "\n;; Function %s (%s)%s\n\n", dname
, aname
,
1041 cfun
->function_frequency
== FUNCTION_FREQUENCY_HOT
1043 : cfun
->function_frequency
== FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
1044 ? " (unlikely executed)"
1049 initializing_dump
= false;
1051 /* If a timevar is present, start it. */
1053 timevar_push (pass
->tv_id
);
1058 todo_after
= pass
->execute ();
1059 do_per_function (clear_last_verified
, NULL
);
1064 timevar_pop (pass
->tv_id
);
1066 do_per_function (update_properties_after_pass
, pass
);
1068 if (initializing_dump
1070 && graph_dump_format
!= no_graph
1071 && (cfun
->curr_properties
& (PROP_cfg
| PROP_rtl
))
1072 == (PROP_cfg
| PROP_rtl
))
1074 get_dump_file_info (pass
->static_pass_number
)->flags
|= TDF_GRAPH
;
1075 dump_flags
|= TDF_GRAPH
;
1076 clean_graph_dump_file (dump_file_name
);
1079 /* Run post-pass cleanup and verification. */
1080 execute_todo (todo_after
| pass
->todo_flags_finish
);
1081 verify_interpass_invariants ();
1083 if (!current_function_decl
)
1084 cgraph_process_new_functions ();
1086 /* Flush and close dump file. */
1089 free ((char *) dump_file_name
);
1090 dump_file_name
= NULL
;
1095 dump_end (pass
->static_pass_number
, dump_file
);
1099 /* Reset in_gimple_form to not break non-unit-at-a-time mode. */
1100 in_gimple_form
= false;
1106 execute_pass_list (struct tree_opt_pass
*pass
)
1110 if (execute_one_pass (pass
) && pass
->sub
)
1111 execute_pass_list (pass
->sub
);
1117 /* Same as execute_pass_list but assume that subpasses of IPA passes
1118 are local passes. */
1120 execute_ipa_pass_list (struct tree_opt_pass
*pass
)
1124 gcc_assert (!current_function_decl
);
1126 if (execute_one_pass (pass
) && pass
->sub
)
1127 do_per_function_toporder ((void (*)(void *))execute_pass_list
,
1129 if (!current_function_decl
)
1130 cgraph_process_new_functions ();
1135 #include "gt-passes.h"