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
|| pass
->type
== 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
);
482 NEXT_PASS (pass_mudflap_1
);
483 NEXT_PASS (pass_lower_omp
);
484 NEXT_PASS (pass_lower_cf
);
485 NEXT_PASS (pass_refactor_eh
);
486 NEXT_PASS (pass_lower_eh
);
487 NEXT_PASS (pass_build_cfg
);
488 NEXT_PASS (pass_lower_complex_O0
);
489 NEXT_PASS (pass_lower_vector
);
490 NEXT_PASS (pass_warn_function_return
);
491 NEXT_PASS (pass_build_cgraph_edges
);
492 NEXT_PASS (pass_inline_parameters
);
495 /* Interprocedural optimization passes.
496 All these passes are ignored in -fno-unit-at-a-time
497 except for subpasses of early_local_passes. */
499 NEXT_PASS (pass_ipa_function_and_variable_visibility
);
500 NEXT_PASS (pass_ipa_early_inline
);
502 struct opt_pass
**p
= &pass_ipa_early_inline
.pass
.sub
;
503 NEXT_PASS (pass_early_inline
);
504 NEXT_PASS (pass_inline_parameters
);
505 NEXT_PASS (pass_rebuild_cgraph_edges
);
507 NEXT_PASS (pass_early_local_passes
);
509 struct opt_pass
**p
= &pass_early_local_passes
.pass
.sub
;
510 NEXT_PASS (pass_tree_profile
);
511 NEXT_PASS (pass_cleanup_cfg
);
512 NEXT_PASS (pass_init_datastructures
);
513 NEXT_PASS (pass_expand_omp
);
514 NEXT_PASS (pass_all_early_optimizations
);
516 struct opt_pass
**p
= &pass_all_early_optimizations
.pass
.sub
;
517 NEXT_PASS (pass_referenced_vars
);
518 NEXT_PASS (pass_reset_cc_flags
);
519 NEXT_PASS (pass_build_ssa
);
520 NEXT_PASS (pass_expand_omp_ssa
);
521 NEXT_PASS (pass_early_warn_uninitialized
);
522 NEXT_PASS (pass_rebuild_cgraph_edges
);
523 NEXT_PASS (pass_early_inline
);
524 NEXT_PASS (pass_cleanup_cfg
);
525 NEXT_PASS (pass_rename_ssa_copies
);
526 NEXT_PASS (pass_ccp
);
527 NEXT_PASS (pass_forwprop
);
528 NEXT_PASS (pass_update_address_taken
);
529 NEXT_PASS (pass_simple_dse
);
530 NEXT_PASS (pass_sra_early
);
531 NEXT_PASS (pass_copy_prop
);
532 NEXT_PASS (pass_merge_phi
);
533 NEXT_PASS (pass_dce
);
534 NEXT_PASS (pass_update_address_taken
);
535 NEXT_PASS (pass_simple_dse
);
536 NEXT_PASS (pass_tail_recursion
);
537 NEXT_PASS (pass_profile
);
538 NEXT_PASS (pass_release_ssa_names
);
540 NEXT_PASS (pass_rebuild_cgraph_edges
);
542 NEXT_PASS (pass_ipa_increase_alignment
);
543 NEXT_PASS (pass_ipa_matrix_reorg
);
544 NEXT_PASS (pass_ipa_cp
);
545 NEXT_PASS (pass_ipa_inline
);
546 NEXT_PASS (pass_ipa_reference
);
547 NEXT_PASS (pass_ipa_pure_const
);
548 NEXT_PASS (pass_ipa_type_escape
);
549 NEXT_PASS (pass_ipa_pta
);
550 NEXT_PASS (pass_ipa_struct_reorg
);
553 /* These passes are run after IPA passes on every function that is being
554 output to the assembler file. */
556 NEXT_PASS (pass_all_optimizations
);
558 struct opt_pass
**p
= &pass_all_optimizations
.pass
.sub
;
559 NEXT_PASS (pass_create_structure_vars
);
560 /* ??? pass_build_alias is a dummy pass that ensures that we
561 execute TODO_rebuild_alias at this point even if
562 pass_create_structure_vars was disabled. */
563 NEXT_PASS (pass_build_alias
);
564 NEXT_PASS (pass_return_slot
);
565 NEXT_PASS (pass_rename_ssa_copies
);
567 /* Initial scalar cleanups. */
568 NEXT_PASS (pass_complete_unrolli
);
569 NEXT_PASS (pass_ccp
);
570 NEXT_PASS (pass_phiprop
);
571 NEXT_PASS (pass_fre
);
572 NEXT_PASS (pass_dce
);
573 NEXT_PASS (pass_forwprop
);
574 NEXT_PASS (pass_copy_prop
);
575 NEXT_PASS (pass_merge_phi
);
576 NEXT_PASS (pass_vrp
);
577 NEXT_PASS (pass_dce
);
578 NEXT_PASS (pass_cselim
);
579 NEXT_PASS (pass_dominator
);
580 /* The only const/copy propagation opportunities left after
581 DOM should be due to degenerate PHI nodes. So rather than
582 run the full propagators, run a specialized pass which
583 only examines PHIs to discover const/copy propagation
585 NEXT_PASS (pass_phi_only_cprop
);
586 NEXT_PASS (pass_tree_ifcombine
);
587 NEXT_PASS (pass_phiopt
);
588 NEXT_PASS (pass_tail_recursion
);
590 NEXT_PASS (pass_stdarg
);
591 NEXT_PASS (pass_lower_complex
);
592 NEXT_PASS (pass_sra
);
593 NEXT_PASS (pass_rename_ssa_copies
);
594 NEXT_PASS (pass_dominator
);
596 /* The only const/copy propagation opportunities left after
597 DOM should be due to degenerate PHI nodes. So rather than
598 run the full propagators, run a specialized pass which
599 only examines PHIs to discover const/copy propagation
601 NEXT_PASS (pass_phi_only_cprop
);
603 NEXT_PASS (pass_reassoc
);
604 NEXT_PASS (pass_dce
);
605 NEXT_PASS (pass_dse
);
606 NEXT_PASS (pass_forwprop
);
607 NEXT_PASS (pass_phiopt
);
608 NEXT_PASS (pass_object_sizes
);
609 NEXT_PASS (pass_store_ccp
);
610 NEXT_PASS (pass_copy_prop
);
611 NEXT_PASS (pass_fold_builtins
);
612 NEXT_PASS (pass_cse_sincos
);
613 NEXT_PASS (pass_split_crit_edges
);
614 NEXT_PASS (pass_pre
);
615 NEXT_PASS (pass_sink_code
);
616 NEXT_PASS (pass_tree_loop
);
618 struct opt_pass
**p
= &pass_tree_loop
.pass
.sub
;
619 NEXT_PASS (pass_tree_loop_init
);
620 NEXT_PASS (pass_copy_prop
);
621 NEXT_PASS (pass_dce_loop
);
622 NEXT_PASS (pass_lim
);
623 NEXT_PASS (pass_predcom
);
624 NEXT_PASS (pass_tree_unswitch
);
625 NEXT_PASS (pass_scev_cprop
);
626 NEXT_PASS (pass_empty_loop
);
627 NEXT_PASS (pass_record_bounds
);
628 NEXT_PASS (pass_check_data_deps
);
629 NEXT_PASS (pass_loop_distribution
);
630 NEXT_PASS (pass_linear_transform
);
631 NEXT_PASS (pass_iv_canon
);
632 NEXT_PASS (pass_if_conversion
);
633 NEXT_PASS (pass_vectorize
);
635 struct opt_pass
**p
= &pass_vectorize
.pass
.sub
;
636 NEXT_PASS (pass_lower_vector_ssa
);
637 NEXT_PASS (pass_dce_loop
);
639 NEXT_PASS (pass_complete_unroll
);
640 NEXT_PASS (pass_parallelize_loops
);
641 NEXT_PASS (pass_loop_prefetch
);
642 NEXT_PASS (pass_iv_optimize
);
643 NEXT_PASS (pass_tree_loop_done
);
645 NEXT_PASS (pass_cse_reciprocals
);
646 NEXT_PASS (pass_convert_to_rsqrt
);
647 NEXT_PASS (pass_reassoc
);
648 NEXT_PASS (pass_vrp
);
649 NEXT_PASS (pass_dominator
);
651 /* The only const/copy propagation opportunities left after
652 DOM should be due to degenerate PHI nodes. So rather than
653 run the full propagators, run a specialized pass which
654 only examines PHIs to discover const/copy propagation
656 NEXT_PASS (pass_phi_only_cprop
);
658 NEXT_PASS (pass_cd_dce
);
659 NEXT_PASS (pass_tracer
);
661 /* FIXME: If DCE is not run before checking for uninitialized uses,
662 we may get false warnings (e.g., testsuite/gcc.dg/uninit-5.c).
663 However, this also causes us to misdiagnose cases that should be
664 real warnings (e.g., testsuite/gcc.dg/pr18501.c).
666 To fix the false positives in uninit-5.c, we would have to
667 account for the predicates protecting the set and the use of each
668 variable. Using a representation like Gated Single Assignment
670 NEXT_PASS (pass_late_warn_uninitialized
);
671 NEXT_PASS (pass_dse
);
672 NEXT_PASS (pass_forwprop
);
673 NEXT_PASS (pass_phiopt
);
674 NEXT_PASS (pass_tail_calls
);
675 NEXT_PASS (pass_rename_ssa_copies
);
676 NEXT_PASS (pass_uncprop
);
677 NEXT_PASS (pass_del_ssa
);
678 NEXT_PASS (pass_nrv
);
679 NEXT_PASS (pass_mark_used_blocks
);
680 NEXT_PASS (pass_cleanup_cfg_post_optimizing
);
682 NEXT_PASS (pass_warn_function_noreturn
);
683 NEXT_PASS (pass_free_datastructures
);
684 NEXT_PASS (pass_mudflap_2
);
685 NEXT_PASS (pass_free_cfg_annotations
);
686 NEXT_PASS (pass_expand
);
687 NEXT_PASS (pass_rest_of_compilation
);
689 struct opt_pass
**p
= &pass_rest_of_compilation
.pass
.sub
;
690 NEXT_PASS (pass_init_function
);
691 NEXT_PASS (pass_jump
);
692 NEXT_PASS (pass_rtl_eh
);
693 NEXT_PASS (pass_initial_value_sets
);
694 NEXT_PASS (pass_unshare_all_rtl
);
695 NEXT_PASS (pass_instantiate_virtual_regs
);
696 NEXT_PASS (pass_into_cfg_layout_mode
);
697 NEXT_PASS (pass_jump2
);
698 NEXT_PASS (pass_lower_subreg
);
699 NEXT_PASS (pass_df_initialize_opt
);
700 NEXT_PASS (pass_cse
);
701 NEXT_PASS (pass_rtl_fwprop
);
702 NEXT_PASS (pass_gcse
);
703 NEXT_PASS (pass_rtl_ifcvt
);
704 /* Perform loop optimizations. It might be better to do them a bit
705 sooner, but we want the profile feedback to work more
707 NEXT_PASS (pass_loop2
);
709 struct opt_pass
**p
= &pass_loop2
.pass
.sub
;
710 NEXT_PASS (pass_rtl_loop_init
);
711 NEXT_PASS (pass_rtl_move_loop_invariants
);
712 NEXT_PASS (pass_rtl_unswitch
);
713 NEXT_PASS (pass_rtl_unroll_and_peel_loops
);
714 NEXT_PASS (pass_rtl_doloop
);
715 NEXT_PASS (pass_rtl_loop_done
);
718 NEXT_PASS (pass_web
);
719 NEXT_PASS (pass_jump_bypass
);
720 NEXT_PASS (pass_cse2
);
721 NEXT_PASS (pass_rtl_dse1
);
722 NEXT_PASS (pass_rtl_fwprop_addr
);
723 NEXT_PASS (pass_regclass_init
);
724 NEXT_PASS (pass_inc_dec
);
725 NEXT_PASS (pass_initialize_regs
);
726 NEXT_PASS (pass_outof_cfg_layout_mode
);
727 NEXT_PASS (pass_ud_rtl_dce
);
728 NEXT_PASS (pass_combine
);
729 NEXT_PASS (pass_if_after_combine
);
730 NEXT_PASS (pass_partition_blocks
);
731 NEXT_PASS (pass_regmove
);
732 NEXT_PASS (pass_split_all_insns
);
733 NEXT_PASS (pass_lower_subreg2
);
734 NEXT_PASS (pass_df_initialize_no_opt
);
735 NEXT_PASS (pass_stack_ptr_mod
);
736 NEXT_PASS (pass_mode_switching
);
737 NEXT_PASS (pass_see
);
738 NEXT_PASS (pass_match_asm_constraints
);
739 NEXT_PASS (pass_sms
);
740 NEXT_PASS (pass_sched
);
741 NEXT_PASS (pass_subregs_of_mode_init
);
742 NEXT_PASS (pass_local_alloc
);
743 NEXT_PASS (pass_global_alloc
);
744 NEXT_PASS (pass_subregs_of_mode_finish
);
745 NEXT_PASS (pass_postreload
);
747 struct opt_pass
**p
= &pass_postreload
.pass
.sub
;
748 NEXT_PASS (pass_postreload_cse
);
749 NEXT_PASS (pass_gcse2
);
750 NEXT_PASS (pass_split_after_reload
);
751 NEXT_PASS (pass_branch_target_load_optimize1
);
752 NEXT_PASS (pass_thread_prologue_and_epilogue
);
753 NEXT_PASS (pass_rtl_dse2
);
754 NEXT_PASS (pass_rtl_seqabstr
);
755 NEXT_PASS (pass_stack_adjustments
);
756 NEXT_PASS (pass_peephole2
);
757 NEXT_PASS (pass_if_after_reload
);
758 NEXT_PASS (pass_regrename
);
759 NEXT_PASS (pass_cprop_hardreg
);
760 NEXT_PASS (pass_fast_rtl_dce
);
761 NEXT_PASS (pass_reorder_blocks
);
762 NEXT_PASS (pass_branch_target_load_optimize2
);
763 NEXT_PASS (pass_leaf_regs
);
764 NEXT_PASS (pass_split_before_sched2
);
765 NEXT_PASS (pass_sched2
);
766 NEXT_PASS (pass_stack_regs
);
768 struct opt_pass
**p
= &pass_stack_regs
.pass
.sub
;
769 NEXT_PASS (pass_split_before_regstack
);
770 NEXT_PASS (pass_stack_regs_run
);
772 NEXT_PASS (pass_compute_alignments
);
773 NEXT_PASS (pass_duplicate_computed_gotos
);
774 NEXT_PASS (pass_variable_tracking
);
775 NEXT_PASS (pass_free_cfg
);
776 NEXT_PASS (pass_machine_reorg
);
777 NEXT_PASS (pass_cleanup_barriers
);
778 NEXT_PASS (pass_delay_slots
);
779 NEXT_PASS (pass_split_for_shorten_branches
);
780 NEXT_PASS (pass_convert_to_eh_region_ranges
);
781 NEXT_PASS (pass_shorten_branches
);
782 NEXT_PASS (pass_set_nothrow_function_flags
);
783 NEXT_PASS (pass_final
);
785 NEXT_PASS (pass_df_finish
);
787 NEXT_PASS (pass_clean_state
);
792 /* Register the passes with the tree dump code. */
793 register_dump_files (all_lowering_passes
, PROP_gimple_any
);
794 all_lowering_passes
->todo_flags_start
|= TODO_set_props
;
795 register_dump_files (all_ipa_passes
,
796 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
798 register_dump_files (all_passes
,
799 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
803 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
804 function CALLBACK for every function in the call graph. Otherwise,
805 call CALLBACK on the current function. */
808 do_per_function (void (*callback
) (void *data
), void *data
)
810 if (current_function_decl
)
814 struct cgraph_node
*node
;
815 for (node
= cgraph_nodes
; node
; node
= node
->next
)
818 push_cfun (DECL_STRUCT_FUNCTION (node
->decl
));
819 current_function_decl
= node
->decl
;
821 free_dominance_info (CDI_DOMINATORS
);
822 free_dominance_info (CDI_POST_DOMINATORS
);
823 current_function_decl
= NULL
;
830 /* Because inlining might remove no-longer reachable nodes, we need to
831 keep the array visible to garbage collector to avoid reading collected
834 static GTY ((length ("nnodes"))) struct cgraph_node
**order
;
836 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
837 function CALLBACK for every function in the call graph. Otherwise,
838 call CALLBACK on the current function. */
841 do_per_function_toporder (void (*callback
) (void *data
), void *data
)
845 if (current_function_decl
)
850 order
= ggc_alloc (sizeof (*order
) * cgraph_n_nodes
);
851 nnodes
= cgraph_postorder (order
);
852 for (i
= nnodes
- 1; i
>= 0; i
--)
854 struct cgraph_node
*node
= order
[i
];
856 /* Allow possibly removed nodes to be garbage collected. */
858 if (node
->analyzed
&& (node
->needed
|| node
->reachable
))
860 push_cfun (DECL_STRUCT_FUNCTION (node
->decl
));
861 current_function_decl
= node
->decl
;
863 free_dominance_info (CDI_DOMINATORS
);
864 free_dominance_info (CDI_POST_DOMINATORS
);
865 current_function_decl
= NULL
;
876 /* Perform all TODO actions that ought to be done on each function. */
879 execute_function_todo (void *data
)
881 unsigned int flags
= (size_t)data
;
882 if (cfun
->curr_properties
& PROP_ssa
)
883 flags
|= TODO_verify_ssa
;
884 flags
&= ~cfun
->last_verified
;
888 /* Always cleanup the CFG before trying to update SSA. */
889 if (flags
& TODO_cleanup_cfg
)
891 bool cleanup
= cleanup_tree_cfg ();
893 if (cleanup
&& (cfun
->curr_properties
& PROP_ssa
))
894 flags
|= TODO_remove_unused_locals
;
896 /* When cleanup_tree_cfg merges consecutive blocks, it may
897 perform some simplistic propagation when removing single
898 valued PHI nodes. This propagation may, in turn, cause the
899 SSA form to become out-of-date (see PR 22037). So, even
900 if the parent pass had not scheduled an SSA update, we may
901 still need to do one. */
902 if (!(flags
& TODO_update_ssa_any
) && need_ssa_update_p ())
903 flags
|= TODO_update_ssa
;
906 if (flags
& TODO_update_ssa_any
)
908 unsigned update_flags
= flags
& TODO_update_ssa_any
;
909 update_ssa (update_flags
);
910 cfun
->last_verified
&= ~TODO_verify_ssa
;
913 if (flags
& TODO_rebuild_alias
)
915 compute_may_aliases ();
916 cfun
->curr_properties
|= PROP_alias
;
919 if (flags
& TODO_remove_unused_locals
)
920 remove_unused_locals ();
922 if ((flags
& TODO_dump_func
)
923 && dump_file
&& current_function_decl
)
925 if (cfun
->curr_properties
& PROP_trees
)
926 dump_function_to_file (current_function_decl
,
927 dump_file
, dump_flags
);
930 if (dump_flags
& TDF_SLIM
)
931 print_rtl_slim_with_bb (dump_file
, get_insns (), dump_flags
);
932 else if ((cfun
->curr_properties
& PROP_cfg
)
933 && (dump_flags
& TDF_BLOCKS
))
934 print_rtl_with_bb (dump_file
, get_insns ());
936 print_rtl (dump_file
, get_insns ());
938 if (cfun
->curr_properties
& PROP_cfg
939 && graph_dump_format
!= no_graph
940 && (dump_flags
& TDF_GRAPH
))
941 print_rtl_graph_with_bb (dump_file_name
, get_insns ());
944 /* Flush the file. If verification fails, we won't be able to
945 close the file before aborting. */
949 if (flags
& TODO_rebuild_frequencies
)
951 if (profile_status
== PROFILE_GUESSED
)
953 loop_optimizer_init (0);
954 add_noreturn_fake_exit_edges ();
955 mark_irreducible_loops ();
956 connect_infinite_loops_to_exit ();
957 estimate_bb_frequencies ();
958 remove_fake_exit_edges ();
959 loop_optimizer_finalize ();
961 else if (profile_status
== PROFILE_READ
)
967 #if defined ENABLE_CHECKING
968 if (flags
& TODO_verify_ssa
)
970 if (flags
& TODO_verify_flow
)
972 if (flags
& TODO_verify_stmts
)
974 if (flags
& TODO_verify_loops
)
975 verify_loop_closed_ssa ();
976 if (flags
& TODO_verify_rtl_sharing
)
977 verify_rtl_sharing ();
980 cfun
->last_verified
= flags
& TODO_verify_all
;
983 /* Perform all TODO actions. */
985 execute_todo (unsigned int flags
)
987 #if defined ENABLE_CHECKING
988 if (need_ssa_update_p ())
989 gcc_assert (flags
& TODO_update_ssa_any
);
992 /* Inform the pass whether it is the first time it is run. */
993 first_pass_instance
= (flags
& TODO_mark_first_instance
) != 0;
995 do_per_function (execute_function_todo
, (void *)(size_t) flags
);
997 /* Always remove functions just as before inlining: IPA passes might be
998 interested to see bodies of extern inline functions that are not inlined
999 to analyze side effects. The full removal is done just at the end
1000 of IPA pass queue. */
1001 if (flags
& TODO_remove_functions
)
1004 cgraph_remove_unreachable_nodes (true, dump_file
);
1007 if ((flags
& TODO_dump_cgraph
)
1008 && dump_file
&& !current_function_decl
)
1011 dump_cgraph (dump_file
);
1012 /* Flush the file. If verification fails, we won't be able to
1013 close the file before aborting. */
1017 if (flags
& TODO_ggc_collect
)
1022 /* Now that the dumping has been done, we can get rid of the optional
1024 if (flags
& TODO_df_finish
)
1025 df_finish_pass ((flags
& TODO_df_verify
) != 0);
1028 /* Verify invariants that should hold between passes. This is a place
1029 to put simple sanity checks. */
1032 verify_interpass_invariants (void)
1034 #ifdef ENABLE_CHECKING
1035 gcc_assert (!fold_deferring_overflow_warnings_p ());
1039 /* Clear the last verified flag. */
1042 clear_last_verified (void *data ATTRIBUTE_UNUSED
)
1044 cfun
->last_verified
= 0;
1047 /* Helper function. Verify that the properties has been turn into the
1048 properties expected by the pass. */
1050 #ifdef ENABLE_CHECKING
1052 verify_curr_properties (void *data
)
1054 unsigned int props
= (size_t)data
;
1055 gcc_assert ((cfun
->curr_properties
& props
) == props
);
1059 /* Initialize pass dump file. */
1062 pass_init_dump_file (struct opt_pass
*pass
)
1064 /* If a dump file name is present, open it if enabled. */
1065 if (pass
->static_pass_number
!= -1)
1067 bool initializing_dump
= !dump_initialized_p (pass
->static_pass_number
);
1068 dump_file_name
= get_dump_file_name (pass
->static_pass_number
);
1069 dump_file
= dump_begin (pass
->static_pass_number
, &dump_flags
);
1070 if (dump_file
&& current_function_decl
)
1072 const char *dname
, *aname
;
1073 dname
= lang_hooks
.decl_printable_name (current_function_decl
, 2);
1074 aname
= (IDENTIFIER_POINTER
1075 (DECL_ASSEMBLER_NAME (current_function_decl
)));
1076 fprintf (dump_file
, "\n;; Apply transform to function %s (%s)%s\n\n", dname
, aname
,
1077 cfun
->function_frequency
== FUNCTION_FREQUENCY_HOT
1079 : cfun
->function_frequency
== FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
1080 ? " (unlikely executed)"
1083 return initializing_dump
;
1089 /* Flush PASS dump file. */
1092 pass_fini_dump_file (struct opt_pass
*pass
)
1094 /* Flush and close dump file. */
1097 free (CONST_CAST (char *, dump_file_name
));
1098 dump_file_name
= NULL
;
1103 dump_end (pass
->static_pass_number
, dump_file
);
1108 /* After executing the pass, apply expected changes to the function
1112 update_properties_after_pass (void *data
)
1114 struct opt_pass
*pass
= data
;
1115 cfun
->curr_properties
= (cfun
->curr_properties
| pass
->properties_provided
)
1116 & ~pass
->properties_destroyed
;
1119 /* Schedule IPA transform pass DATA for CFUN. */
1122 add_ipa_transform_pass (void *data
)
1124 struct ipa_opt_pass
*ipa_pass
= (struct ipa_opt_pass
*) data
;
1125 VEC_safe_push (ipa_opt_pass
, heap
, cfun
->ipa_transforms_to_apply
, ipa_pass
);
1128 /* Execute IPA pass function summary generation. DATA is pointer to
1129 pass list to execute. */
1132 execute_ipa_summary_passes (void *data
)
1134 struct ipa_opt_pass
*ipa_pass
= (struct ipa_opt_pass
*)data
;
1135 struct cgraph_node
*node
= cgraph_node (cfun
->decl
);
1136 while (ipa_pass
&& ipa_pass
->pass
.type
== IPA_PASS
)
1138 struct opt_pass
*pass
= &ipa_pass
->pass
;
1139 if (!pass
->gate
|| pass
->gate ())
1141 pass_init_dump_file (pass
);
1142 ipa_pass
->function_generate_summary (node
);
1143 pass_fini_dump_file (pass
);
1145 ipa_pass
= (struct ipa_opt_pass
*)ipa_pass
->pass
.next
;
1149 /* Execute IPA_PASS function transform on NODE. */
1152 execute_one_ipa_transform_pass (struct cgraph_node
*node
,
1153 struct ipa_opt_pass
*ipa_pass
)
1155 struct opt_pass
*pass
= &ipa_pass
->pass
;
1156 unsigned int todo_after
= 0;
1158 current_pass
= pass
;
1159 if (!ipa_pass
->function_transform
)
1162 /* Note that the folders should only create gimple expressions.
1163 This is a hack until the new folder is ready. */
1164 in_gimple_form
= (cfun
&& (cfun
->curr_properties
& PROP_trees
)) != 0;
1166 pass_init_dump_file (pass
);
1168 /* Run pre-pass verification. */
1169 execute_todo (ipa_pass
->function_transform_todo_flags_start
);
1171 /* If a timevar is present, start it. */
1173 timevar_push (pass
->tv_id
);
1176 todo_after
= ipa_pass
->function_transform (node
);
1180 timevar_pop (pass
->tv_id
);
1182 /* Run post-pass cleanup and verification. */
1183 execute_todo (todo_after
);
1184 verify_interpass_invariants ();
1186 pass_fini_dump_file (pass
);
1188 current_pass
= NULL
;
1189 /* Reset in_gimple_form to not break non-unit-at-a-time mode. */
1190 in_gimple_form
= false;
1194 execute_one_pass (struct opt_pass
*pass
)
1196 bool initializing_dump
;
1197 unsigned int todo_after
= 0;
1199 /* IPA passes are executed on whole program, so cfun should be NULL.
1200 Ohter passes needs function context set. */
1201 if (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
)
1202 gcc_assert (!cfun
&& !current_function_decl
);
1204 gcc_assert (cfun
&& current_function_decl
);
1206 if (cfun
&& cfun
->ipa_transforms_to_apply
)
1209 struct cgraph_node
*node
= cgraph_node (current_function_decl
);
1211 for (i
= 0; i
< VEC_length (ipa_opt_pass
, cfun
->ipa_transforms_to_apply
);
1213 execute_one_ipa_transform_pass (node
,
1214 VEC_index (ipa_opt_pass
,
1215 cfun
->ipa_transforms_to_apply
,
1217 VEC_free (ipa_opt_pass
, heap
, cfun
->ipa_transforms_to_apply
);
1218 cfun
->ipa_transforms_to_apply
= NULL
;
1221 current_pass
= pass
;
1222 /* See if we're supposed to run this pass. */
1223 if (pass
->gate
&& !pass
->gate ())
1226 if (!quiet_flag
&& !cfun
)
1227 fprintf (stderr
, " <%s>", pass
->name
? pass
->name
: "");
1229 if (pass
->todo_flags_start
& TODO_set_props
)
1230 cfun
->curr_properties
= pass
->properties_required
;
1232 /* Note that the folders should only create gimple expressions.
1233 This is a hack until the new folder is ready. */
1234 in_gimple_form
= (cfun
&& (cfun
->curr_properties
& PROP_trees
)) != 0;
1236 /* Run pre-pass verification. */
1237 execute_todo (pass
->todo_flags_start
);
1239 #ifdef ENABLE_CHECKING
1240 do_per_function (verify_curr_properties
,
1241 (void *)(size_t)pass
->properties_required
);
1244 initializing_dump
= pass_init_dump_file (pass
);
1246 /* If a timevar is present, start it. */
1248 timevar_push (pass
->tv_id
);
1253 todo_after
= pass
->execute ();
1254 do_per_function (clear_last_verified
, NULL
);
1259 timevar_pop (pass
->tv_id
);
1261 do_per_function (update_properties_after_pass
, pass
);
1263 if (initializing_dump
1265 && graph_dump_format
!= no_graph
1266 && (cfun
->curr_properties
& (PROP_cfg
| PROP_rtl
))
1267 == (PROP_cfg
| PROP_rtl
))
1269 get_dump_file_info (pass
->static_pass_number
)->flags
|= TDF_GRAPH
;
1270 dump_flags
|= TDF_GRAPH
;
1271 clean_graph_dump_file (dump_file_name
);
1274 /* Run post-pass cleanup and verification. */
1275 execute_todo (todo_after
| pass
->todo_flags_finish
);
1276 verify_interpass_invariants ();
1277 if (pass
->type
== IPA_PASS
)
1278 do_per_function (add_ipa_transform_pass
, pass
);
1280 if (!current_function_decl
)
1281 cgraph_process_new_functions ();
1283 pass_fini_dump_file (pass
);
1285 if (pass
->type
!= SIMPLE_IPA_PASS
&& pass
->type
!= IPA_PASS
)
1286 gcc_assert (!(cfun
->curr_properties
& PROP_trees
)
1287 || pass
->type
!= RTL_PASS
);
1289 current_pass
= NULL
;
1290 /* Reset in_gimple_form to not break non-unit-at-a-time mode. */
1291 in_gimple_form
= false;
1297 execute_pass_list (struct opt_pass
*pass
)
1301 gcc_assert (pass
->type
== GIMPLE_PASS
1302 || pass
->type
== RTL_PASS
);
1303 if (execute_one_pass (pass
) && pass
->sub
)
1304 execute_pass_list (pass
->sub
);
1310 /* Same as execute_pass_list but assume that subpasses of IPA passes
1311 are local passes. */
1313 execute_ipa_pass_list (struct opt_pass
*pass
)
1315 bool summaries_generated
= false;
1318 gcc_assert (!current_function_decl
);
1320 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
1321 if (pass
->type
== IPA_PASS
&& (!pass
->gate
|| pass
->gate ()))
1323 if (!summaries_generated
)
1325 if (!quiet_flag
&& !cfun
)
1326 fprintf (stderr
, " <summary generate>");
1327 do_per_function_toporder (execute_ipa_summary_passes
, pass
);
1329 summaries_generated
= true;
1332 summaries_generated
= false;
1333 if (execute_one_pass (pass
) && pass
->sub
)
1335 if (pass
->sub
->type
== GIMPLE_PASS
)
1336 do_per_function_toporder ((void (*)(void *))execute_pass_list
,
1338 else if (pass
->sub
->type
== SIMPLE_IPA_PASS
1339 || pass
->sub
->type
== IPA_PASS
)
1340 execute_ipa_pass_list (pass
->sub
);
1344 if (!current_function_decl
)
1345 cgraph_process_new_functions ();
1350 #include "gt-passes.h"