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, 2008, 2009
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 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 /* A map from static pass id to optimization pass. */
337 struct opt_pass
**passes_by_id
;
338 int passes_by_id_size
;
340 /* Set the static pass number of pass PASS to ID and record that
341 in the mapping from static pass number to pass. */
344 set_pass_for_id (int id
, struct opt_pass
*pass
)
346 pass
->static_pass_number
= id
;
347 if (passes_by_id_size
<= id
)
349 passes_by_id
= XRESIZEVEC (struct opt_pass
*, passes_by_id
, id
+ 1);
350 memset (passes_by_id
+ passes_by_id_size
, 0,
351 (id
+ 1 - passes_by_id_size
) * sizeof (void *));
352 passes_by_id_size
= id
+ 1;
354 passes_by_id
[id
] = pass
;
357 /* Return the pass with the static pass number ID. */
360 get_pass_for_id (int id
)
362 if (id
>= passes_by_id_size
)
364 return passes_by_id
[id
];
367 /* Iterate over the pass tree allocating dump file numbers. We want
368 to do this depth first, and independent of whether the pass is
372 register_one_dump_file (struct opt_pass
*pass
)
374 char *dot_name
, *flag_name
, *glob_name
;
379 /* See below in next_pass_1. */
381 if (pass
->static_pass_number
!= -1)
382 sprintf (num
, "%d", ((int) pass
->static_pass_number
< 0
383 ? 1 : pass
->static_pass_number
));
385 dot_name
= concat (".", pass
->name
, num
, NULL
);
386 if (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
)
387 prefix
= "ipa-", flags
= TDF_IPA
;
388 else if (pass
->type
== GIMPLE_PASS
)
389 prefix
= "tree-", flags
= TDF_TREE
;
391 prefix
= "rtl-", flags
= TDF_RTL
;
393 flag_name
= concat (prefix
, pass
->name
, num
, NULL
);
394 glob_name
= concat (prefix
, pass
->name
, NULL
);
395 id
= dump_register (dot_name
, flag_name
, glob_name
, flags
);
396 set_pass_for_id (id
, pass
);
399 /* Recursive worker function for register_dump_files. */
402 register_dump_files_1 (struct opt_pass
*pass
, int properties
)
406 int new_properties
= (properties
| pass
->properties_provided
)
407 & ~pass
->properties_destroyed
;
409 if (pass
->name
&& pass
->name
[0] != '*')
410 register_one_dump_file (pass
);
413 new_properties
= register_dump_files_1 (pass
->sub
, new_properties
);
415 /* If we have a gate, combine the properties that we could have with
416 and without the pass being examined. */
418 properties
&= new_properties
;
420 properties
= new_properties
;
429 /* Register the dump files for the pipeline starting at PASS.
430 PROPERTIES reflects the properties that are guaranteed to be available at
431 the beginning of the pipeline. */
434 register_dump_files (struct opt_pass
*pass
,int properties
)
436 pass
->properties_required
|= properties
;
437 register_dump_files_1 (pass
, properties
);
440 /* Add a pass to the pass list. Duplicate the pass if it's already
443 static struct opt_pass
**
444 next_pass_1 (struct opt_pass
**list
, struct opt_pass
*pass
)
446 /* A nonzero static_pass_number indicates that the
447 pass is already in the list. */
448 if (pass
->static_pass_number
)
450 struct opt_pass
*new_pass
;
452 new_pass
= XNEW (struct opt_pass
);
453 memcpy (new_pass
, pass
, sizeof (*new_pass
));
454 new_pass
->next
= NULL
;
456 new_pass
->todo_flags_start
&= ~TODO_mark_first_instance
;
458 /* Indicate to register_dump_files that this pass has duplicates,
459 and so it should rename the dump file. The first instance will
460 be -1, and be number of duplicates = -static_pass_number - 1.
461 Subsequent instances will be > 0 and just the duplicate number. */
464 pass
->static_pass_number
-= 1;
465 new_pass
->static_pass_number
= -pass
->static_pass_number
;
472 pass
->todo_flags_start
|= TODO_mark_first_instance
;
473 pass
->static_pass_number
= -1;
477 return &(*list
)->next
;
482 /* Construct the pass tree. The sequencing of passes is driven by
485 cgraph_finalize_compilation_unit ()
486 for each node N in the cgraph
487 cgraph_analyze_function (N)
488 cgraph_lower_function (N) -> all_lowering_passes
490 If we are optimizing, cgraph_optimize is then invoked:
493 ipa_passes () -> all_ipa_passes
494 cgraph_expand_all_functions ()
495 for each node N in the cgraph
496 cgraph_expand_function (N)
497 tree_rest_of_compilation (DECL (N)) -> all_passes
501 init_optimization_passes (void)
505 #define NEXT_PASS(PASS) (p = next_pass_1 (p, &((PASS).pass)))
507 /* All passes needed to lower the function into shape optimizers can
508 operate on. These passes are always run first on the function, but
509 backend might produce already lowered functions that are not processed
511 p
= &all_lowering_passes
;
512 NEXT_PASS (pass_remove_useless_stmts
);
513 NEXT_PASS (pass_mudflap_1
);
514 NEXT_PASS (pass_lower_omp
);
515 NEXT_PASS (pass_lower_cf
);
516 NEXT_PASS (pass_refactor_eh
);
517 NEXT_PASS (pass_lower_eh
);
518 NEXT_PASS (pass_build_cfg
);
519 NEXT_PASS (pass_lower_complex_O0
);
520 NEXT_PASS (pass_lower_vector
);
521 NEXT_PASS (pass_warn_function_return
);
522 NEXT_PASS (pass_build_cgraph_edges
);
523 NEXT_PASS (pass_inline_parameters
);
526 /* Interprocedural optimization passes. */
528 NEXT_PASS (pass_ipa_function_and_variable_visibility
);
529 NEXT_PASS (pass_ipa_early_inline
);
531 struct opt_pass
**p
= &pass_ipa_early_inline
.pass
.sub
;
532 NEXT_PASS (pass_early_inline
);
533 NEXT_PASS (pass_inline_parameters
);
534 NEXT_PASS (pass_rebuild_cgraph_edges
);
536 NEXT_PASS (pass_early_local_passes
);
538 struct opt_pass
**p
= &pass_early_local_passes
.pass
.sub
;
539 NEXT_PASS (pass_fixup_cfg
);
540 NEXT_PASS (pass_tree_profile
);
541 NEXT_PASS (pass_cleanup_cfg
);
542 NEXT_PASS (pass_init_datastructures
);
543 NEXT_PASS (pass_expand_omp
);
545 NEXT_PASS (pass_referenced_vars
);
546 NEXT_PASS (pass_build_ssa
);
547 NEXT_PASS (pass_early_warn_uninitialized
);
548 NEXT_PASS (pass_all_early_optimizations
);
550 struct opt_pass
**p
= &pass_all_early_optimizations
.pass
.sub
;
551 NEXT_PASS (pass_rebuild_cgraph_edges
);
552 NEXT_PASS (pass_early_inline
);
553 NEXT_PASS (pass_remove_cgraph_callee_edges
);
554 NEXT_PASS (pass_rename_ssa_copies
);
555 NEXT_PASS (pass_ccp
);
556 NEXT_PASS (pass_forwprop
);
557 NEXT_PASS (pass_update_address_taken
);
558 NEXT_PASS (pass_sra_early
);
559 NEXT_PASS (pass_copy_prop
);
560 NEXT_PASS (pass_merge_phi
);
561 NEXT_PASS (pass_cd_dce
);
562 NEXT_PASS (pass_tail_recursion
);
563 NEXT_PASS (pass_convert_switch
);
564 NEXT_PASS (pass_cleanup_eh
);
565 NEXT_PASS (pass_profile
);
566 NEXT_PASS (pass_local_pure_const
);
568 NEXT_PASS (pass_release_ssa_names
);
569 NEXT_PASS (pass_rebuild_cgraph_edges
);
570 NEXT_PASS (pass_inline_parameters
);
572 NEXT_PASS (pass_ipa_increase_alignment
);
573 NEXT_PASS (pass_ipa_matrix_reorg
);
574 NEXT_PASS (pass_ipa_cp
);
575 NEXT_PASS (pass_ipa_inline
);
576 NEXT_PASS (pass_ipa_reference
);
577 NEXT_PASS (pass_ipa_pure_const
);
578 NEXT_PASS (pass_ipa_type_escape
);
579 NEXT_PASS (pass_ipa_pta
);
580 NEXT_PASS (pass_ipa_struct_reorg
);
583 /* These passes are run after IPA passes on every function that is being
584 output to the assembler file. */
586 NEXT_PASS (pass_all_optimizations
);
588 struct opt_pass
**p
= &pass_all_optimizations
.pass
.sub
;
589 NEXT_PASS (pass_remove_cgraph_callee_edges
);
590 /* Initial scalar cleanups before alias computation.
591 They ensure memory accesses are not indirect wherever possible. */
592 NEXT_PASS (pass_strip_predict_hints
);
593 NEXT_PASS (pass_update_address_taken
);
594 NEXT_PASS (pass_rename_ssa_copies
);
595 NEXT_PASS (pass_complete_unrolli
);
596 NEXT_PASS (pass_ccp
);
597 NEXT_PASS (pass_forwprop
);
598 NEXT_PASS (pass_call_cdce
);
599 /* pass_build_alias is a dummy pass that ensures that we
600 execute TODO_rebuild_alias at this point. Re-building
601 alias information also rewrites no longer addressed
602 locals into SSA form if possible. */
603 NEXT_PASS (pass_build_alias
);
604 NEXT_PASS (pass_return_slot
);
605 NEXT_PASS (pass_phiprop
);
606 NEXT_PASS (pass_fre
);
607 NEXT_PASS (pass_copy_prop
);
608 NEXT_PASS (pass_merge_phi
);
609 NEXT_PASS (pass_vrp
);
610 NEXT_PASS (pass_dce
);
611 NEXT_PASS (pass_cselim
);
612 NEXT_PASS (pass_tree_ifcombine
);
613 NEXT_PASS (pass_phiopt
);
614 NEXT_PASS (pass_tail_recursion
);
616 NEXT_PASS (pass_stdarg
);
617 NEXT_PASS (pass_lower_complex
);
618 NEXT_PASS (pass_sra
);
619 NEXT_PASS (pass_rename_ssa_copies
);
620 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_dse
);
628 NEXT_PASS (pass_reassoc
);
629 NEXT_PASS (pass_dce
);
630 NEXT_PASS (pass_forwprop
);
631 NEXT_PASS (pass_phiopt
);
632 NEXT_PASS (pass_object_sizes
);
633 NEXT_PASS (pass_ccp
);
634 NEXT_PASS (pass_copy_prop
);
635 NEXT_PASS (pass_fold_builtins
);
636 NEXT_PASS (pass_cse_sincos
);
637 NEXT_PASS (pass_split_crit_edges
);
638 NEXT_PASS (pass_pre
);
639 NEXT_PASS (pass_sink_code
);
640 NEXT_PASS (pass_tree_loop
);
642 struct opt_pass
**p
= &pass_tree_loop
.pass
.sub
;
643 NEXT_PASS (pass_tree_loop_init
);
644 NEXT_PASS (pass_copy_prop
);
645 NEXT_PASS (pass_dce_loop
);
646 NEXT_PASS (pass_lim
);
647 NEXT_PASS (pass_predcom
);
648 NEXT_PASS (pass_tree_unswitch
);
649 NEXT_PASS (pass_scev_cprop
);
650 NEXT_PASS (pass_empty_loop
);
651 NEXT_PASS (pass_record_bounds
);
652 NEXT_PASS (pass_check_data_deps
);
653 NEXT_PASS (pass_loop_distribution
);
654 NEXT_PASS (pass_linear_transform
);
655 NEXT_PASS (pass_graphite_transforms
);
656 NEXT_PASS (pass_iv_canon
);
657 NEXT_PASS (pass_if_conversion
);
658 NEXT_PASS (pass_vectorize
);
660 struct opt_pass
**p
= &pass_vectorize
.pass
.sub
;
661 NEXT_PASS (pass_lower_vector_ssa
);
662 NEXT_PASS (pass_dce_loop
);
664 NEXT_PASS (pass_complete_unroll
);
665 NEXT_PASS (pass_parallelize_loops
);
666 NEXT_PASS (pass_loop_prefetch
);
667 NEXT_PASS (pass_iv_optimize
);
668 NEXT_PASS (pass_tree_loop_done
);
670 NEXT_PASS (pass_cse_reciprocals
);
671 NEXT_PASS (pass_convert_to_rsqrt
);
672 NEXT_PASS (pass_reassoc
);
673 NEXT_PASS (pass_vrp
);
674 NEXT_PASS (pass_dominator
);
675 /* The only const/copy propagation opportunities left after
676 DOM should be due to degenerate PHI nodes. So rather than
677 run the full propagators, run a specialized pass which
678 only examines PHIs to discover const/copy propagation
680 NEXT_PASS (pass_phi_only_cprop
);
681 NEXT_PASS (pass_cd_dce
);
682 NEXT_PASS (pass_tracer
);
684 /* FIXME: If DCE is not run before checking for uninitialized uses,
685 we may get false warnings (e.g., testsuite/gcc.dg/uninit-5.c).
686 However, this also causes us to misdiagnose cases that should be
687 real warnings (e.g., testsuite/gcc.dg/pr18501.c).
689 To fix the false positives in uninit-5.c, we would have to
690 account for the predicates protecting the set and the use of each
691 variable. Using a representation like Gated Single Assignment
693 NEXT_PASS (pass_late_warn_uninitialized
);
694 NEXT_PASS (pass_dse
);
695 NEXT_PASS (pass_forwprop
);
696 NEXT_PASS (pass_phiopt
);
697 NEXT_PASS (pass_tail_calls
);
698 NEXT_PASS (pass_rename_ssa_copies
);
699 NEXT_PASS (pass_uncprop
);
700 NEXT_PASS (pass_local_pure_const
);
702 NEXT_PASS (pass_cleanup_eh
);
703 NEXT_PASS (pass_nrv
);
704 NEXT_PASS (pass_mudflap_2
);
705 NEXT_PASS (pass_cleanup_cfg_post_optimizing
);
706 NEXT_PASS (pass_warn_function_noreturn
);
708 NEXT_PASS (pass_expand
);
710 NEXT_PASS (pass_rest_of_compilation
);
712 struct opt_pass
**p
= &pass_rest_of_compilation
.pass
.sub
;
713 NEXT_PASS (pass_init_function
);
714 NEXT_PASS (pass_jump
);
715 NEXT_PASS (pass_rtl_eh
);
716 NEXT_PASS (pass_initial_value_sets
);
717 NEXT_PASS (pass_unshare_all_rtl
);
718 NEXT_PASS (pass_instantiate_virtual_regs
);
719 NEXT_PASS (pass_into_cfg_layout_mode
);
720 NEXT_PASS (pass_jump2
);
721 NEXT_PASS (pass_lower_subreg
);
722 NEXT_PASS (pass_df_initialize_opt
);
723 NEXT_PASS (pass_cse
);
724 NEXT_PASS (pass_rtl_fwprop
);
725 NEXT_PASS (pass_rtl_cprop
);
726 NEXT_PASS (pass_rtl_pre
);
727 NEXT_PASS (pass_rtl_hoist
);
728 NEXT_PASS (pass_rtl_cprop
);
729 NEXT_PASS (pass_rtl_store_motion
);
730 NEXT_PASS (pass_cse_after_global_opts
);
731 NEXT_PASS (pass_rtl_ifcvt
);
732 /* Perform loop optimizations. It might be better to do them a bit
733 sooner, but we want the profile feedback to work more
735 NEXT_PASS (pass_loop2
);
737 struct opt_pass
**p
= &pass_loop2
.pass
.sub
;
738 NEXT_PASS (pass_rtl_loop_init
);
739 NEXT_PASS (pass_rtl_move_loop_invariants
);
740 NEXT_PASS (pass_rtl_unswitch
);
741 NEXT_PASS (pass_rtl_unroll_and_peel_loops
);
742 NEXT_PASS (pass_rtl_doloop
);
743 NEXT_PASS (pass_rtl_loop_done
);
746 NEXT_PASS (pass_web
);
747 NEXT_PASS (pass_rtl_cprop
);
748 NEXT_PASS (pass_cse2
);
749 NEXT_PASS (pass_rtl_dse1
);
750 NEXT_PASS (pass_rtl_fwprop_addr
);
751 NEXT_PASS (pass_reginfo_init
);
752 NEXT_PASS (pass_inc_dec
);
753 NEXT_PASS (pass_initialize_regs
);
754 NEXT_PASS (pass_ud_rtl_dce
);
755 NEXT_PASS (pass_combine
);
756 NEXT_PASS (pass_if_after_combine
);
757 NEXT_PASS (pass_partition_blocks
);
758 NEXT_PASS (pass_regmove
);
759 NEXT_PASS (pass_outof_cfg_layout_mode
);
760 NEXT_PASS (pass_split_all_insns
);
761 NEXT_PASS (pass_lower_subreg2
);
762 NEXT_PASS (pass_df_initialize_no_opt
);
763 NEXT_PASS (pass_stack_ptr_mod
);
764 NEXT_PASS (pass_mode_switching
);
765 NEXT_PASS (pass_see
);
766 NEXT_PASS (pass_match_asm_constraints
);
767 NEXT_PASS (pass_sms
);
768 NEXT_PASS (pass_sched
);
769 NEXT_PASS (pass_subregs_of_mode_init
);
770 NEXT_PASS (pass_ira
);
771 NEXT_PASS (pass_subregs_of_mode_finish
);
772 NEXT_PASS (pass_postreload
);
774 struct opt_pass
**p
= &pass_postreload
.pass
.sub
;
775 NEXT_PASS (pass_postreload_cse
);
776 NEXT_PASS (pass_gcse2
);
777 NEXT_PASS (pass_split_after_reload
);
778 NEXT_PASS (pass_branch_target_load_optimize1
);
779 NEXT_PASS (pass_thread_prologue_and_epilogue
);
780 NEXT_PASS (pass_rtl_dse2
);
781 NEXT_PASS (pass_stack_adjustments
);
782 NEXT_PASS (pass_peephole2
);
783 NEXT_PASS (pass_if_after_reload
);
784 NEXT_PASS (pass_regrename
);
785 NEXT_PASS (pass_cprop_hardreg
);
786 NEXT_PASS (pass_fast_rtl_dce
);
787 NEXT_PASS (pass_reorder_blocks
);
788 NEXT_PASS (pass_branch_target_load_optimize2
);
789 NEXT_PASS (pass_leaf_regs
);
790 NEXT_PASS (pass_split_before_sched2
);
791 NEXT_PASS (pass_sched2
);
792 NEXT_PASS (pass_stack_regs
);
794 struct opt_pass
**p
= &pass_stack_regs
.pass
.sub
;
795 NEXT_PASS (pass_split_before_regstack
);
796 NEXT_PASS (pass_stack_regs_run
);
798 NEXT_PASS (pass_compute_alignments
);
799 NEXT_PASS (pass_duplicate_computed_gotos
);
800 NEXT_PASS (pass_variable_tracking
);
801 NEXT_PASS (pass_free_cfg
);
802 NEXT_PASS (pass_machine_reorg
);
803 NEXT_PASS (pass_cleanup_barriers
);
804 NEXT_PASS (pass_delay_slots
);
805 NEXT_PASS (pass_split_for_shorten_branches
);
806 NEXT_PASS (pass_convert_to_eh_region_ranges
);
807 NEXT_PASS (pass_shorten_branches
);
808 NEXT_PASS (pass_set_nothrow_function_flags
);
809 NEXT_PASS (pass_final
);
811 NEXT_PASS (pass_df_finish
);
813 NEXT_PASS (pass_clean_state
);
818 /* Register the passes with the tree dump code. */
819 register_dump_files (all_lowering_passes
, PROP_gimple_any
);
820 all_lowering_passes
->todo_flags_start
|= TODO_set_props
;
821 register_dump_files (all_ipa_passes
,
822 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
824 register_dump_files (all_passes
,
825 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
829 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
830 function CALLBACK for every function in the call graph. Otherwise,
831 call CALLBACK on the current function. */
834 do_per_function (void (*callback
) (void *data
), void *data
)
836 if (current_function_decl
)
840 struct cgraph_node
*node
;
841 for (node
= cgraph_nodes
; node
; node
= node
->next
)
842 if (node
->analyzed
&& gimple_has_body_p (node
->decl
))
844 push_cfun (DECL_STRUCT_FUNCTION (node
->decl
));
845 current_function_decl
= node
->decl
;
847 free_dominance_info (CDI_DOMINATORS
);
848 free_dominance_info (CDI_POST_DOMINATORS
);
849 current_function_decl
= NULL
;
856 /* Because inlining might remove no-longer reachable nodes, we need to
857 keep the array visible to garbage collector to avoid reading collected
860 static GTY ((length ("nnodes"))) struct cgraph_node
**order
;
862 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
863 function CALLBACK for every function in the call graph. Otherwise,
864 call CALLBACK on the current function. */
867 do_per_function_toporder (void (*callback
) (void *data
), void *data
)
871 if (current_function_decl
)
876 order
= GGC_NEWVEC (struct cgraph_node
*, cgraph_n_nodes
);
877 nnodes
= cgraph_postorder (order
);
878 for (i
= nnodes
- 1; i
>= 0; i
--)
879 order
[i
]->process
= 1;
880 for (i
= nnodes
- 1; i
>= 0; i
--)
882 struct cgraph_node
*node
= order
[i
];
884 /* Allow possibly removed nodes to be garbage collected. */
887 if (node
->analyzed
&& (node
->needed
|| node
->reachable
))
889 push_cfun (DECL_STRUCT_FUNCTION (node
->decl
));
890 current_function_decl
= node
->decl
;
892 free_dominance_info (CDI_DOMINATORS
);
893 free_dominance_info (CDI_POST_DOMINATORS
);
894 current_function_decl
= NULL
;
905 /* Perform all TODO actions that ought to be done on each function. */
908 execute_function_todo (void *data
)
910 unsigned int flags
= (size_t)data
;
911 if (cfun
->curr_properties
& PROP_ssa
)
912 flags
|= TODO_verify_ssa
;
913 flags
&= ~cfun
->last_verified
;
917 statistics_fini_pass ();
919 /* Always cleanup the CFG before trying to update SSA. */
920 if (flags
& TODO_cleanup_cfg
)
922 bool cleanup
= cleanup_tree_cfg ();
924 if (cleanup
&& (cfun
->curr_properties
& PROP_ssa
))
925 flags
|= TODO_remove_unused_locals
;
927 /* When cleanup_tree_cfg merges consecutive blocks, it may
928 perform some simplistic propagation when removing single
929 valued PHI nodes. This propagation may, in turn, cause the
930 SSA form to become out-of-date (see PR 22037). So, even
931 if the parent pass had not scheduled an SSA update, we may
932 still need to do one. */
933 if (!(flags
& TODO_update_ssa_any
) && need_ssa_update_p (cfun
))
934 flags
|= TODO_update_ssa
;
937 if (flags
& TODO_update_ssa_any
)
939 unsigned update_flags
= flags
& TODO_update_ssa_any
;
940 update_ssa (update_flags
);
941 cfun
->last_verified
&= ~TODO_verify_ssa
;
944 if (flags
& TODO_update_address_taken
)
945 execute_update_addresses_taken (true);
947 if (flags
& TODO_rebuild_alias
)
949 if (!(flags
& TODO_update_address_taken
))
950 execute_update_addresses_taken (true);
951 compute_may_aliases ();
954 if (flags
& TODO_remove_unused_locals
)
955 remove_unused_locals ();
957 if ((flags
& TODO_dump_func
) && dump_file
&& current_function_decl
)
959 if (cfun
->curr_properties
& PROP_trees
)
960 dump_function_to_file (current_function_decl
, dump_file
, dump_flags
);
963 if (dump_flags
& TDF_SLIM
)
964 print_rtl_slim_with_bb (dump_file
, get_insns (), dump_flags
);
965 else if ((cfun
->curr_properties
& PROP_cfg
)
966 && (dump_flags
& TDF_BLOCKS
))
967 print_rtl_with_bb (dump_file
, get_insns ());
969 print_rtl (dump_file
, get_insns ());
971 if ((cfun
->curr_properties
& PROP_cfg
)
972 && graph_dump_format
!= no_graph
973 && (dump_flags
& TDF_GRAPH
))
974 print_rtl_graph_with_bb (dump_file_name
, get_insns ());
977 /* Flush the file. If verification fails, we won't be able to
978 close the file before aborting. */
982 if (flags
& TODO_rebuild_frequencies
)
984 if (profile_status
== PROFILE_GUESSED
)
986 loop_optimizer_init (0);
987 add_noreturn_fake_exit_edges ();
988 mark_irreducible_loops ();
989 connect_infinite_loops_to_exit ();
990 estimate_bb_frequencies ();
991 remove_fake_exit_edges ();
992 loop_optimizer_finalize ();
994 else if (profile_status
== PROFILE_READ
)
1000 #if defined ENABLE_CHECKING
1001 if (flags
& TODO_verify_ssa
)
1003 if (flags
& TODO_verify_flow
)
1004 verify_flow_info ();
1005 if (flags
& TODO_verify_stmts
)
1007 if (flags
& TODO_verify_loops
)
1008 verify_loop_closed_ssa ();
1009 if (flags
& TODO_verify_rtl_sharing
)
1010 verify_rtl_sharing ();
1013 cfun
->last_verified
= flags
& TODO_verify_all
;
1016 /* Perform all TODO actions. */
1018 execute_todo (unsigned int flags
)
1020 #if defined ENABLE_CHECKING
1022 && need_ssa_update_p (cfun
))
1023 gcc_assert (flags
& TODO_update_ssa_any
);
1026 /* Inform the pass whether it is the first time it is run. */
1027 first_pass_instance
= (flags
& TODO_mark_first_instance
) != 0;
1029 do_per_function (execute_function_todo
, (void *)(size_t) flags
);
1031 /* Always remove functions just as before inlining: IPA passes might be
1032 interested to see bodies of extern inline functions that are not inlined
1033 to analyze side effects. The full removal is done just at the end
1034 of IPA pass queue. */
1035 if (flags
& TODO_remove_functions
)
1038 cgraph_remove_unreachable_nodes (true, dump_file
);
1041 if ((flags
& TODO_dump_cgraph
) && dump_file
&& !current_function_decl
)
1044 dump_cgraph (dump_file
);
1045 /* Flush the file. If verification fails, we won't be able to
1046 close the file before aborting. */
1050 if (flags
& TODO_ggc_collect
)
1053 /* Now that the dumping has been done, we can get rid of the optional
1055 if (flags
& TODO_df_finish
)
1056 df_finish_pass ((flags
& TODO_df_verify
) != 0);
1059 /* Verify invariants that should hold between passes. This is a place
1060 to put simple sanity checks. */
1063 verify_interpass_invariants (void)
1065 #ifdef ENABLE_CHECKING
1066 gcc_assert (!fold_deferring_overflow_warnings_p ());
1070 /* Clear the last verified flag. */
1073 clear_last_verified (void *data ATTRIBUTE_UNUSED
)
1075 cfun
->last_verified
= 0;
1078 /* Helper function. Verify that the properties has been turn into the
1079 properties expected by the pass. */
1081 #ifdef ENABLE_CHECKING
1083 verify_curr_properties (void *data
)
1085 unsigned int props
= (size_t)data
;
1086 gcc_assert ((cfun
->curr_properties
& props
) == props
);
1090 /* Initialize pass dump file. */
1093 pass_init_dump_file (struct opt_pass
*pass
)
1095 /* If a dump file name is present, open it if enabled. */
1096 if (pass
->static_pass_number
!= -1)
1098 bool initializing_dump
= !dump_initialized_p (pass
->static_pass_number
);
1099 dump_file_name
= get_dump_file_name (pass
->static_pass_number
);
1100 dump_file
= dump_begin (pass
->static_pass_number
, &dump_flags
);
1101 if (dump_file
&& current_function_decl
)
1103 const char *dname
, *aname
;
1104 dname
= lang_hooks
.decl_printable_name (current_function_decl
, 2);
1105 aname
= (IDENTIFIER_POINTER
1106 (DECL_ASSEMBLER_NAME (current_function_decl
)));
1107 fprintf (dump_file
, "\n;; Function %s (%s)%s\n\n", dname
, aname
,
1108 cfun
->function_frequency
== FUNCTION_FREQUENCY_HOT
1110 : cfun
->function_frequency
== FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
1111 ? " (unlikely executed)"
1114 return initializing_dump
;
1120 /* Flush PASS dump file. */
1123 pass_fini_dump_file (struct opt_pass
*pass
)
1125 /* Flush and close dump file. */
1128 free (CONST_CAST (char *, dump_file_name
));
1129 dump_file_name
= NULL
;
1134 dump_end (pass
->static_pass_number
, dump_file
);
1139 /* After executing the pass, apply expected changes to the function
1143 update_properties_after_pass (void *data
)
1145 struct opt_pass
*pass
= (struct opt_pass
*) data
;
1146 cfun
->curr_properties
= (cfun
->curr_properties
| pass
->properties_provided
)
1147 & ~pass
->properties_destroyed
;
1150 /* Schedule IPA transform pass DATA for CFUN. */
1153 add_ipa_transform_pass (void *data
)
1155 struct ipa_opt_pass
*ipa_pass
= (struct ipa_opt_pass
*) data
;
1156 VEC_safe_push (ipa_opt_pass
, heap
, cfun
->ipa_transforms_to_apply
, ipa_pass
);
1159 /* Execute summary generation for all of the passes in IPA_PASS. */
1162 execute_ipa_summary_passes (struct ipa_opt_pass
*ipa_pass
)
1166 struct opt_pass
*pass
= &ipa_pass
->pass
;
1168 /* Execute all of the IPA_PASSes in the list. */
1169 if (ipa_pass
->pass
.type
== IPA_PASS
1170 && (!pass
->gate
|| pass
->gate ()))
1172 pass_init_dump_file (pass
);
1173 ipa_pass
->generate_summary ();
1174 pass_fini_dump_file (pass
);
1176 ipa_pass
= (struct ipa_opt_pass
*)ipa_pass
->pass
.next
;
1180 /* Execute IPA_PASS function transform on NODE. */
1183 execute_one_ipa_transform_pass (struct cgraph_node
*node
,
1184 struct ipa_opt_pass
*ipa_pass
)
1186 struct opt_pass
*pass
= &ipa_pass
->pass
;
1187 unsigned int todo_after
= 0;
1189 current_pass
= pass
;
1190 if (!ipa_pass
->function_transform
)
1193 /* Note that the folders should only create gimple expressions.
1194 This is a hack until the new folder is ready. */
1195 in_gimple_form
= (cfun
&& (cfun
->curr_properties
& PROP_trees
)) != 0;
1197 pass_init_dump_file (pass
);
1199 /* Run pre-pass verification. */
1200 execute_todo (ipa_pass
->function_transform_todo_flags_start
);
1202 /* If a timevar is present, start it. */
1203 if (pass
->tv_id
!= TV_NONE
)
1204 timevar_push (pass
->tv_id
);
1207 todo_after
= ipa_pass
->function_transform (node
);
1210 if (pass
->tv_id
!= TV_NONE
)
1211 timevar_pop (pass
->tv_id
);
1213 /* Run post-pass cleanup and verification. */
1214 execute_todo (todo_after
);
1215 verify_interpass_invariants ();
1217 pass_fini_dump_file (pass
);
1219 current_pass
= NULL
;
1223 execute_one_pass (struct opt_pass
*pass
)
1225 bool initializing_dump
;
1226 unsigned int todo_after
= 0;
1228 /* IPA passes are executed on whole program, so cfun should be NULL.
1229 Other passes need function context set. */
1230 if (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
)
1231 gcc_assert (!cfun
&& !current_function_decl
);
1233 gcc_assert (cfun
&& current_function_decl
);
1235 if (cfun
&& cfun
->ipa_transforms_to_apply
)
1238 struct cgraph_node
*node
= cgraph_node (current_function_decl
);
1240 for (i
= 0; i
< VEC_length (ipa_opt_pass
, cfun
->ipa_transforms_to_apply
);
1242 execute_one_ipa_transform_pass (node
,
1243 VEC_index (ipa_opt_pass
,
1244 cfun
->ipa_transforms_to_apply
,
1246 VEC_free (ipa_opt_pass
, heap
, cfun
->ipa_transforms_to_apply
);
1247 cfun
->ipa_transforms_to_apply
= NULL
;
1250 current_pass
= pass
;
1252 /* See if we're supposed to run this pass. */
1253 if (pass
->gate
&& !pass
->gate ())
1256 if (!quiet_flag
&& !cfun
)
1257 fprintf (stderr
, " <%s>", pass
->name
? pass
->name
: "");
1259 if (pass
->todo_flags_start
& TODO_set_props
)
1260 cfun
->curr_properties
= pass
->properties_required
;
1262 /* Note that the folders should only create gimple expressions.
1263 This is a hack until the new folder is ready. */
1264 in_gimple_form
= (cfun
&& (cfun
->curr_properties
& PROP_trees
)) != 0;
1266 initializing_dump
= pass_init_dump_file (pass
);
1268 /* Run pre-pass verification. */
1269 execute_todo (pass
->todo_flags_start
);
1271 #ifdef ENABLE_CHECKING
1272 do_per_function (verify_curr_properties
,
1273 (void *)(size_t)pass
->properties_required
);
1276 /* If a timevar is present, start it. */
1277 if (pass
->tv_id
!= TV_NONE
)
1278 timevar_push (pass
->tv_id
);
1283 todo_after
= pass
->execute ();
1284 do_per_function (clear_last_verified
, NULL
);
1288 if (pass
->tv_id
!= TV_NONE
)
1289 timevar_pop (pass
->tv_id
);
1291 do_per_function (update_properties_after_pass
, pass
);
1293 if (initializing_dump
1295 && graph_dump_format
!= no_graph
1297 && (cfun
->curr_properties
& (PROP_cfg
| PROP_rtl
))
1298 == (PROP_cfg
| PROP_rtl
))
1300 get_dump_file_info (pass
->static_pass_number
)->flags
|= TDF_GRAPH
;
1301 dump_flags
|= TDF_GRAPH
;
1302 clean_graph_dump_file (dump_file_name
);
1305 /* Run post-pass cleanup and verification. */
1306 execute_todo (todo_after
| pass
->todo_flags_finish
);
1307 verify_interpass_invariants ();
1308 if (pass
->type
== IPA_PASS
)
1309 do_per_function (add_ipa_transform_pass
, pass
);
1311 if (!current_function_decl
)
1312 cgraph_process_new_functions ();
1314 pass_fini_dump_file (pass
);
1316 if (pass
->type
!= SIMPLE_IPA_PASS
&& pass
->type
!= IPA_PASS
)
1317 gcc_assert (!(cfun
->curr_properties
& PROP_trees
)
1318 || pass
->type
!= RTL_PASS
);
1320 current_pass
= NULL
;
1326 execute_pass_list (struct opt_pass
*pass
)
1330 gcc_assert (pass
->type
== GIMPLE_PASS
1331 || pass
->type
== RTL_PASS
);
1332 if (execute_one_pass (pass
) && pass
->sub
)
1333 execute_pass_list (pass
->sub
);
1339 /* Same as execute_pass_list but assume that subpasses of IPA passes
1340 are local passes. */
1342 execute_ipa_pass_list (struct opt_pass
*pass
)
1344 bool summaries_generated
= false;
1347 gcc_assert (!current_function_decl
);
1349 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
1350 if (pass
->type
== IPA_PASS
&& (!pass
->gate
|| pass
->gate ()))
1352 if (!summaries_generated
)
1354 if (!quiet_flag
&& !cfun
)
1355 fprintf (stderr
, " <summary generate>");
1356 execute_ipa_summary_passes ((struct ipa_opt_pass
*) pass
);
1358 summaries_generated
= true;
1360 if (execute_one_pass (pass
) && pass
->sub
)
1362 if (pass
->sub
->type
== GIMPLE_PASS
)
1363 do_per_function_toporder ((void (*)(void *))execute_pass_list
,
1365 else if (pass
->sub
->type
== SIMPLE_IPA_PASS
1366 || pass
->sub
->type
== IPA_PASS
)
1367 execute_ipa_pass_list (pass
->sub
);
1371 if (!current_function_decl
)
1372 cgraph_process_new_functions ();
1378 /* Called by local passes to see if function is called by already processed nodes.
1379 Because we process nodes in topological order, this means that function is
1380 in recursive cycle or we introduced new direct calls. */
1382 function_called_by_processed_nodes_p (void)
1384 struct cgraph_edge
*e
;
1385 for (e
= cgraph_node (current_function_decl
)->callers
; e
; e
= e
->next_caller
)
1387 if (e
->caller
->decl
== current_function_decl
)
1389 if (!e
->caller
->analyzed
|| (!e
->caller
->needed
&& !e
->caller
->reachable
))
1391 if (TREE_ASM_WRITTEN (e
->caller
->decl
))
1393 if (!e
->caller
->process
&& !e
->caller
->global
.inlined_to
)
1398 fprintf (dump_file
, "Already processed call to:\n");
1399 dump_cgraph_node (dump_file
, e
->caller
);
1404 #include "gt-passes.h"