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
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_tree_profile
);
540 NEXT_PASS (pass_cleanup_cfg
);
541 NEXT_PASS (pass_init_datastructures
);
542 NEXT_PASS (pass_expand_omp
);
544 NEXT_PASS (pass_referenced_vars
);
545 NEXT_PASS (pass_reset_cc_flags
);
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_rename_ssa_copies
);
554 NEXT_PASS (pass_ccp
);
555 NEXT_PASS (pass_forwprop
);
556 NEXT_PASS (pass_update_address_taken
);
557 NEXT_PASS (pass_sra_early
);
558 NEXT_PASS (pass_copy_prop
);
559 NEXT_PASS (pass_merge_phi
);
560 NEXT_PASS (pass_cd_dce
);
561 NEXT_PASS (pass_simple_dse
);
562 NEXT_PASS (pass_tail_recursion
);
563 NEXT_PASS (pass_convert_switch
);
564 NEXT_PASS (pass_profile
);
566 NEXT_PASS (pass_release_ssa_names
);
567 NEXT_PASS (pass_rebuild_cgraph_edges
);
569 NEXT_PASS (pass_ipa_increase_alignment
);
570 NEXT_PASS (pass_ipa_matrix_reorg
);
571 NEXT_PASS (pass_ipa_cp
);
572 NEXT_PASS (pass_ipa_inline
);
573 NEXT_PASS (pass_ipa_reference
);
574 NEXT_PASS (pass_ipa_pure_const
);
575 NEXT_PASS (pass_ipa_type_escape
);
576 NEXT_PASS (pass_ipa_pta
);
577 NEXT_PASS (pass_ipa_struct_reorg
);
580 /* These passes are run after IPA passes on every function that is being
581 output to the assembler file. */
583 NEXT_PASS (pass_all_optimizations
);
585 struct opt_pass
**p
= &pass_all_optimizations
.pass
.sub
;
586 /* Initial scalar cleanups before alias computation.
587 They ensure memory accesses are not indirect wherever possible. */
588 NEXT_PASS (pass_strip_predict_hints
);
589 NEXT_PASS (pass_update_address_taken
);
590 NEXT_PASS (pass_rename_ssa_copies
);
591 NEXT_PASS (pass_complete_unrolli
);
592 NEXT_PASS (pass_ccp
);
593 NEXT_PASS (pass_forwprop
);
594 /* Ideally the function call conditional
595 dead code elimination phase can be delayed
596 till later where potentially more opportunities
597 can be found. Due to lack of good ways to
598 update VDEFs associated with the shrink-wrapped
599 calls, it is better to do the transformation
600 here where memory SSA is not built yet. */
601 NEXT_PASS (pass_call_cdce
);
602 /* pass_build_alias is a dummy pass that ensures that we
603 execute TODO_rebuild_alias at this point. Re-building
604 alias information also rewrites no longer addressed
605 locals into SSA form if possible. */
606 NEXT_PASS (pass_build_alias
);
607 NEXT_PASS (pass_return_slot
);
608 NEXT_PASS (pass_phiprop
);
609 NEXT_PASS (pass_fre
);
610 NEXT_PASS (pass_copy_prop
);
611 NEXT_PASS (pass_merge_phi
);
612 NEXT_PASS (pass_vrp
);
613 NEXT_PASS (pass_dce
);
614 NEXT_PASS (pass_cselim
);
615 NEXT_PASS (pass_tree_ifcombine
);
616 NEXT_PASS (pass_phiopt
);
617 NEXT_PASS (pass_tail_recursion
);
619 NEXT_PASS (pass_stdarg
);
620 NEXT_PASS (pass_lower_complex
);
621 NEXT_PASS (pass_sra
);
622 NEXT_PASS (pass_rename_ssa_copies
);
623 NEXT_PASS (pass_dominator
);
624 /* The only const/copy propagation opportunities left after
625 DOM should be due to degenerate PHI nodes. So rather than
626 run the full propagators, run a specialized pass which
627 only examines PHIs to discover const/copy propagation
629 NEXT_PASS (pass_phi_only_cprop
);
630 NEXT_PASS (pass_dse
);
631 NEXT_PASS (pass_reassoc
);
632 NEXT_PASS (pass_dce
);
633 NEXT_PASS (pass_forwprop
);
634 NEXT_PASS (pass_phiopt
);
635 NEXT_PASS (pass_object_sizes
);
636 NEXT_PASS (pass_ccp
);
637 NEXT_PASS (pass_copy_prop
);
638 NEXT_PASS (pass_fold_builtins
);
639 NEXT_PASS (pass_cse_sincos
);
640 NEXT_PASS (pass_split_crit_edges
);
641 NEXT_PASS (pass_pre
);
642 NEXT_PASS (pass_sink_code
);
643 NEXT_PASS (pass_tree_loop
);
645 struct opt_pass
**p
= &pass_tree_loop
.pass
.sub
;
646 NEXT_PASS (pass_tree_loop_init
);
647 NEXT_PASS (pass_copy_prop
);
648 NEXT_PASS (pass_dce_loop
);
649 NEXT_PASS (pass_lim
);
650 NEXT_PASS (pass_predcom
);
651 NEXT_PASS (pass_tree_unswitch
);
652 NEXT_PASS (pass_scev_cprop
);
653 NEXT_PASS (pass_empty_loop
);
654 NEXT_PASS (pass_record_bounds
);
655 NEXT_PASS (pass_check_data_deps
);
656 NEXT_PASS (pass_loop_distribution
);
657 NEXT_PASS (pass_linear_transform
);
658 NEXT_PASS (pass_graphite_transforms
);
659 NEXT_PASS (pass_iv_canon
);
660 NEXT_PASS (pass_if_conversion
);
661 NEXT_PASS (pass_vectorize
);
663 struct opt_pass
**p
= &pass_vectorize
.pass
.sub
;
664 NEXT_PASS (pass_lower_vector_ssa
);
665 NEXT_PASS (pass_dce_loop
);
667 NEXT_PASS (pass_complete_unroll
);
668 NEXT_PASS (pass_parallelize_loops
);
669 NEXT_PASS (pass_loop_prefetch
);
670 NEXT_PASS (pass_iv_optimize
);
671 NEXT_PASS (pass_tree_loop_done
);
673 NEXT_PASS (pass_cse_reciprocals
);
674 NEXT_PASS (pass_convert_to_rsqrt
);
675 NEXT_PASS (pass_reassoc
);
676 NEXT_PASS (pass_vrp
);
677 NEXT_PASS (pass_dominator
);
678 /* The only const/copy propagation opportunities left after
679 DOM should be due to degenerate PHI nodes. So rather than
680 run the full propagators, run a specialized pass which
681 only examines PHIs to discover const/copy propagation
683 NEXT_PASS (pass_phi_only_cprop
);
684 NEXT_PASS (pass_cd_dce
);
685 NEXT_PASS (pass_tracer
);
687 /* FIXME: If DCE is not run before checking for uninitialized uses,
688 we may get false warnings (e.g., testsuite/gcc.dg/uninit-5.c).
689 However, this also causes us to misdiagnose cases that should be
690 real warnings (e.g., testsuite/gcc.dg/pr18501.c).
692 To fix the false positives in uninit-5.c, we would have to
693 account for the predicates protecting the set and the use of each
694 variable. Using a representation like Gated Single Assignment
696 NEXT_PASS (pass_late_warn_uninitialized
);
697 NEXT_PASS (pass_dse
);
698 NEXT_PASS (pass_forwprop
);
699 NEXT_PASS (pass_phiopt
);
700 NEXT_PASS (pass_tail_calls
);
701 NEXT_PASS (pass_rename_ssa_copies
);
702 NEXT_PASS (pass_uncprop
);
704 NEXT_PASS (pass_del_ssa
);
705 NEXT_PASS (pass_nrv
);
706 NEXT_PASS (pass_mark_used_blocks
);
707 NEXT_PASS (pass_cleanup_cfg_post_optimizing
);
709 NEXT_PASS (pass_warn_function_noreturn
);
710 NEXT_PASS (pass_free_datastructures
);
711 NEXT_PASS (pass_mudflap_2
);
713 NEXT_PASS (pass_free_cfg_annotations
);
714 NEXT_PASS (pass_expand
);
715 NEXT_PASS (pass_rest_of_compilation
);
717 struct opt_pass
**p
= &pass_rest_of_compilation
.pass
.sub
;
718 NEXT_PASS (pass_init_function
);
719 NEXT_PASS (pass_jump
);
720 NEXT_PASS (pass_rtl_eh
);
721 NEXT_PASS (pass_initial_value_sets
);
722 NEXT_PASS (pass_unshare_all_rtl
);
723 NEXT_PASS (pass_instantiate_virtual_regs
);
724 NEXT_PASS (pass_into_cfg_layout_mode
);
725 NEXT_PASS (pass_jump2
);
726 NEXT_PASS (pass_lower_subreg
);
727 NEXT_PASS (pass_df_initialize_opt
);
728 NEXT_PASS (pass_cse
);
729 NEXT_PASS (pass_rtl_fwprop
);
730 NEXT_PASS (pass_gcse
);
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_jump_bypass
);
748 NEXT_PASS (pass_cse2
);
749 NEXT_PASS (pass_rtl_dse1
);
750 NEXT_PASS (pass_rtl_fwprop_addr
);
751 NEXT_PASS (pass_regclass_init
);
752 NEXT_PASS (pass_inc_dec
);
753 NEXT_PASS (pass_initialize_regs
);
754 NEXT_PASS (pass_outof_cfg_layout_mode
);
755 NEXT_PASS (pass_ud_rtl_dce
);
756 NEXT_PASS (pass_combine
);
757 NEXT_PASS (pass_if_after_combine
);
758 NEXT_PASS (pass_partition_blocks
);
759 NEXT_PASS (pass_regmove
);
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_local_alloc
);
771 NEXT_PASS (pass_global_alloc
);
772 NEXT_PASS (pass_ira
);
773 NEXT_PASS (pass_subregs_of_mode_finish
);
774 NEXT_PASS (pass_postreload
);
776 struct opt_pass
**p
= &pass_postreload
.pass
.sub
;
777 NEXT_PASS (pass_postreload_cse
);
778 NEXT_PASS (pass_gcse2
);
779 NEXT_PASS (pass_split_after_reload
);
780 NEXT_PASS (pass_branch_target_load_optimize1
);
781 NEXT_PASS (pass_thread_prologue_and_epilogue
);
782 NEXT_PASS (pass_rtl_dse2
);
783 NEXT_PASS (pass_rtl_seqabstr
);
784 NEXT_PASS (pass_stack_adjustments
);
785 NEXT_PASS (pass_peephole2
);
786 NEXT_PASS (pass_if_after_reload
);
787 NEXT_PASS (pass_regrename
);
788 NEXT_PASS (pass_cprop_hardreg
);
789 NEXT_PASS (pass_fast_rtl_dce
);
790 NEXT_PASS (pass_reorder_blocks
);
791 NEXT_PASS (pass_branch_target_load_optimize2
);
792 NEXT_PASS (pass_leaf_regs
);
793 NEXT_PASS (pass_split_before_sched2
);
794 NEXT_PASS (pass_sched2
);
795 NEXT_PASS (pass_stack_regs
);
797 struct opt_pass
**p
= &pass_stack_regs
.pass
.sub
;
798 NEXT_PASS (pass_split_before_regstack
);
799 NEXT_PASS (pass_stack_regs_run
);
801 NEXT_PASS (pass_compute_alignments
);
802 NEXT_PASS (pass_duplicate_computed_gotos
);
803 NEXT_PASS (pass_variable_tracking
);
804 NEXT_PASS (pass_free_cfg
);
805 NEXT_PASS (pass_machine_reorg
);
806 NEXT_PASS (pass_cleanup_barriers
);
807 NEXT_PASS (pass_delay_slots
);
808 NEXT_PASS (pass_split_for_shorten_branches
);
809 NEXT_PASS (pass_convert_to_eh_region_ranges
);
810 NEXT_PASS (pass_shorten_branches
);
811 NEXT_PASS (pass_set_nothrow_function_flags
);
812 NEXT_PASS (pass_final
);
814 NEXT_PASS (pass_df_finish
);
816 NEXT_PASS (pass_clean_state
);
821 /* Register the passes with the tree dump code. */
822 register_dump_files (all_lowering_passes
, PROP_gimple_any
);
823 all_lowering_passes
->todo_flags_start
|= TODO_set_props
;
824 register_dump_files (all_ipa_passes
,
825 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
827 register_dump_files (all_passes
,
828 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
832 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
833 function CALLBACK for every function in the call graph. Otherwise,
834 call CALLBACK on the current function. */
837 do_per_function (void (*callback
) (void *data
), void *data
)
839 if (current_function_decl
)
843 struct cgraph_node
*node
;
844 for (node
= cgraph_nodes
; node
; node
= node
->next
)
847 push_cfun (DECL_STRUCT_FUNCTION (node
->decl
));
848 current_function_decl
= node
->decl
;
850 free_dominance_info (CDI_DOMINATORS
);
851 free_dominance_info (CDI_POST_DOMINATORS
);
852 current_function_decl
= NULL
;
859 /* Because inlining might remove no-longer reachable nodes, we need to
860 keep the array visible to garbage collector to avoid reading collected
863 static GTY ((length ("nnodes"))) struct cgraph_node
**order
;
865 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
866 function CALLBACK for every function in the call graph. Otherwise,
867 call CALLBACK on the current function. */
870 do_per_function_toporder (void (*callback
) (void *data
), void *data
)
874 if (current_function_decl
)
879 order
= GGC_NEWVEC (struct cgraph_node
*, cgraph_n_nodes
);
880 nnodes
= cgraph_postorder (order
);
881 for (i
= nnodes
- 1; i
>= 0; i
--)
883 struct cgraph_node
*node
= order
[i
];
885 /* 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 ())
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_rebuild_alias
)
946 compute_may_aliases ();
947 cfun
->curr_properties
|= PROP_alias
;
950 if (flags
& TODO_remove_unused_locals
)
951 remove_unused_locals ();
953 if ((flags
& TODO_dump_func
) && dump_file
&& current_function_decl
)
955 if (cfun
->curr_properties
& PROP_trees
)
956 dump_function_to_file (current_function_decl
, dump_file
, dump_flags
);
959 if (dump_flags
& TDF_SLIM
)
960 print_rtl_slim_with_bb (dump_file
, get_insns (), dump_flags
);
961 else if ((cfun
->curr_properties
& PROP_cfg
)
962 && (dump_flags
& TDF_BLOCKS
))
963 print_rtl_with_bb (dump_file
, get_insns ());
965 print_rtl (dump_file
, get_insns ());
967 if ((cfun
->curr_properties
& PROP_cfg
)
968 && graph_dump_format
!= no_graph
969 && (dump_flags
& TDF_GRAPH
))
970 print_rtl_graph_with_bb (dump_file_name
, get_insns ());
973 /* Flush the file. If verification fails, we won't be able to
974 close the file before aborting. */
978 if (flags
& TODO_rebuild_frequencies
)
980 if (profile_status
== PROFILE_GUESSED
)
982 loop_optimizer_init (0);
983 add_noreturn_fake_exit_edges ();
984 mark_irreducible_loops ();
985 connect_infinite_loops_to_exit ();
986 estimate_bb_frequencies ();
987 remove_fake_exit_edges ();
988 loop_optimizer_finalize ();
990 else if (profile_status
== PROFILE_READ
)
996 #if defined ENABLE_CHECKING
997 if (flags
& TODO_verify_ssa
)
999 if (flags
& TODO_verify_flow
)
1000 verify_flow_info ();
1001 if (flags
& TODO_verify_stmts
)
1003 if (flags
& TODO_verify_loops
)
1004 verify_loop_closed_ssa ();
1005 if (flags
& TODO_verify_rtl_sharing
)
1006 verify_rtl_sharing ();
1009 cfun
->last_verified
= flags
& TODO_verify_all
;
1012 /* Perform all TODO actions. */
1014 execute_todo (unsigned int flags
)
1016 #if defined ENABLE_CHECKING
1017 if (need_ssa_update_p ())
1018 gcc_assert (flags
& TODO_update_ssa_any
);
1021 /* Inform the pass whether it is the first time it is run. */
1022 first_pass_instance
= (flags
& TODO_mark_first_instance
) != 0;
1024 do_per_function (execute_function_todo
, (void *)(size_t) flags
);
1026 /* Always remove functions just as before inlining: IPA passes might be
1027 interested to see bodies of extern inline functions that are not inlined
1028 to analyze side effects. The full removal is done just at the end
1029 of IPA pass queue. */
1030 if (flags
& TODO_remove_functions
)
1033 cgraph_remove_unreachable_nodes (true, dump_file
);
1036 if ((flags
& TODO_dump_cgraph
) && dump_file
&& !current_function_decl
)
1039 dump_cgraph (dump_file
);
1040 /* Flush the file. If verification fails, we won't be able to
1041 close the file before aborting. */
1045 if (flags
& TODO_ggc_collect
)
1048 /* Now that the dumping has been done, we can get rid of the optional
1050 if (flags
& TODO_df_finish
)
1051 df_finish_pass ((flags
& TODO_df_verify
) != 0);
1054 /* Verify invariants that should hold between passes. This is a place
1055 to put simple sanity checks. */
1058 verify_interpass_invariants (void)
1060 #ifdef ENABLE_CHECKING
1061 gcc_assert (!fold_deferring_overflow_warnings_p ());
1065 /* Clear the last verified flag. */
1068 clear_last_verified (void *data ATTRIBUTE_UNUSED
)
1070 cfun
->last_verified
= 0;
1073 /* Helper function. Verify that the properties has been turn into the
1074 properties expected by the pass. */
1076 #ifdef ENABLE_CHECKING
1078 verify_curr_properties (void *data
)
1080 unsigned int props
= (size_t)data
;
1081 gcc_assert ((cfun
->curr_properties
& props
) == props
);
1085 /* Initialize pass dump file. */
1088 pass_init_dump_file (struct opt_pass
*pass
)
1090 /* If a dump file name is present, open it if enabled. */
1091 if (pass
->static_pass_number
!= -1)
1093 bool initializing_dump
= !dump_initialized_p (pass
->static_pass_number
);
1094 dump_file_name
= get_dump_file_name (pass
->static_pass_number
);
1095 dump_file
= dump_begin (pass
->static_pass_number
, &dump_flags
);
1096 if (dump_file
&& current_function_decl
)
1098 const char *dname
, *aname
;
1099 dname
= lang_hooks
.decl_printable_name (current_function_decl
, 2);
1100 aname
= (IDENTIFIER_POINTER
1101 (DECL_ASSEMBLER_NAME (current_function_decl
)));
1102 fprintf (dump_file
, "\n;; Function %s (%s)%s\n\n", dname
, aname
,
1103 cfun
->function_frequency
== FUNCTION_FREQUENCY_HOT
1105 : cfun
->function_frequency
== FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
1106 ? " (unlikely executed)"
1109 return initializing_dump
;
1115 /* Flush PASS dump file. */
1118 pass_fini_dump_file (struct opt_pass
*pass
)
1120 /* Flush and close dump file. */
1123 free (CONST_CAST (char *, dump_file_name
));
1124 dump_file_name
= NULL
;
1129 dump_end (pass
->static_pass_number
, dump_file
);
1134 /* After executing the pass, apply expected changes to the function
1138 update_properties_after_pass (void *data
)
1140 struct opt_pass
*pass
= (struct opt_pass
*) data
;
1141 cfun
->curr_properties
= (cfun
->curr_properties
| pass
->properties_provided
)
1142 & ~pass
->properties_destroyed
;
1145 /* Schedule IPA transform pass DATA for CFUN. */
1148 add_ipa_transform_pass (void *data
)
1150 struct ipa_opt_pass
*ipa_pass
= (struct ipa_opt_pass
*) data
;
1151 VEC_safe_push (ipa_opt_pass
, heap
, cfun
->ipa_transforms_to_apply
, ipa_pass
);
1154 /* Execute summary generation for all of the passes in IPA_PASS. */
1157 execute_ipa_summary_passes (struct ipa_opt_pass
*ipa_pass
)
1161 struct opt_pass
*pass
= &ipa_pass
->pass
;
1163 /* Execute all of the IPA_PASSes in the list. */
1164 if (ipa_pass
->pass
.type
== IPA_PASS
1165 && (!pass
->gate
|| pass
->gate ()))
1167 pass_init_dump_file (pass
);
1168 ipa_pass
->generate_summary ();
1169 pass_fini_dump_file (pass
);
1171 ipa_pass
= (struct ipa_opt_pass
*)ipa_pass
->pass
.next
;
1175 /* Execute IPA_PASS function transform on NODE. */
1178 execute_one_ipa_transform_pass (struct cgraph_node
*node
,
1179 struct ipa_opt_pass
*ipa_pass
)
1181 struct opt_pass
*pass
= &ipa_pass
->pass
;
1182 unsigned int todo_after
= 0;
1184 current_pass
= pass
;
1185 if (!ipa_pass
->function_transform
)
1188 /* Note that the folders should only create gimple expressions.
1189 This is a hack until the new folder is ready. */
1190 in_gimple_form
= (cfun
&& (cfun
->curr_properties
& PROP_trees
)) != 0;
1192 pass_init_dump_file (pass
);
1194 /* Run pre-pass verification. */
1195 execute_todo (ipa_pass
->function_transform_todo_flags_start
);
1197 /* If a timevar is present, start it. */
1199 timevar_push (pass
->tv_id
);
1202 todo_after
= ipa_pass
->function_transform (node
);
1206 timevar_pop (pass
->tv_id
);
1208 /* Run post-pass cleanup and verification. */
1209 execute_todo (todo_after
);
1210 verify_interpass_invariants ();
1212 pass_fini_dump_file (pass
);
1214 current_pass
= NULL
;
1218 execute_one_pass (struct opt_pass
*pass
)
1220 bool initializing_dump
;
1221 unsigned int todo_after
= 0;
1223 /* IPA passes are executed on whole program, so cfun should be NULL.
1224 Other passes need function context set. */
1225 if (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
)
1226 gcc_assert (!cfun
&& !current_function_decl
);
1228 gcc_assert (cfun
&& current_function_decl
);
1230 if (cfun
&& cfun
->ipa_transforms_to_apply
)
1233 struct cgraph_node
*node
= cgraph_node (current_function_decl
);
1235 for (i
= 0; i
< VEC_length (ipa_opt_pass
, cfun
->ipa_transforms_to_apply
);
1237 execute_one_ipa_transform_pass (node
,
1238 VEC_index (ipa_opt_pass
,
1239 cfun
->ipa_transforms_to_apply
,
1241 VEC_free (ipa_opt_pass
, heap
, cfun
->ipa_transforms_to_apply
);
1242 cfun
->ipa_transforms_to_apply
= NULL
;
1245 current_pass
= pass
;
1247 /* See if we're supposed to run this pass. */
1248 if (pass
->gate
&& !pass
->gate ())
1251 if (!quiet_flag
&& !cfun
)
1252 fprintf (stderr
, " <%s>", pass
->name
? pass
->name
: "");
1254 if (pass
->todo_flags_start
& TODO_set_props
)
1255 cfun
->curr_properties
= pass
->properties_required
;
1257 /* Note that the folders should only create gimple expressions.
1258 This is a hack until the new folder is ready. */
1259 in_gimple_form
= (cfun
&& (cfun
->curr_properties
& PROP_trees
)) != 0;
1261 /* Run pre-pass verification. */
1262 execute_todo (pass
->todo_flags_start
);
1264 #ifdef ENABLE_CHECKING
1265 do_per_function (verify_curr_properties
,
1266 (void *)(size_t)pass
->properties_required
);
1269 initializing_dump
= pass_init_dump_file (pass
);
1271 /* If a timevar is present, start it. */
1273 timevar_push (pass
->tv_id
);
1278 todo_after
= pass
->execute ();
1279 do_per_function (clear_last_verified
, NULL
);
1284 timevar_pop (pass
->tv_id
);
1286 do_per_function (update_properties_after_pass
, pass
);
1288 if (initializing_dump
1290 && graph_dump_format
!= no_graph
1291 && (cfun
->curr_properties
& (PROP_cfg
| PROP_rtl
))
1292 == (PROP_cfg
| PROP_rtl
))
1294 get_dump_file_info (pass
->static_pass_number
)->flags
|= TDF_GRAPH
;
1295 dump_flags
|= TDF_GRAPH
;
1296 clean_graph_dump_file (dump_file_name
);
1299 /* Run post-pass cleanup and verification. */
1300 execute_todo (todo_after
| pass
->todo_flags_finish
);
1301 verify_interpass_invariants ();
1302 if (pass
->type
== IPA_PASS
)
1303 do_per_function (add_ipa_transform_pass
, pass
);
1305 if (!current_function_decl
)
1306 cgraph_process_new_functions ();
1308 pass_fini_dump_file (pass
);
1310 if (pass
->type
!= SIMPLE_IPA_PASS
&& pass
->type
!= IPA_PASS
)
1311 gcc_assert (!(cfun
->curr_properties
& PROP_trees
)
1312 || pass
->type
!= RTL_PASS
);
1314 current_pass
= NULL
;
1320 execute_pass_list (struct opt_pass
*pass
)
1324 gcc_assert (pass
->type
== GIMPLE_PASS
1325 || pass
->type
== RTL_PASS
);
1326 if (execute_one_pass (pass
) && pass
->sub
)
1327 execute_pass_list (pass
->sub
);
1333 /* Same as execute_pass_list but assume that subpasses of IPA passes
1334 are local passes. */
1336 execute_ipa_pass_list (struct opt_pass
*pass
)
1338 bool summaries_generated
= false;
1341 gcc_assert (!current_function_decl
);
1343 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
1344 if (pass
->type
== IPA_PASS
&& (!pass
->gate
|| pass
->gate ()))
1346 if (!summaries_generated
)
1348 if (!quiet_flag
&& !cfun
)
1349 fprintf (stderr
, " <summary generate>");
1350 execute_ipa_summary_passes ((struct ipa_opt_pass
*) pass
);
1352 summaries_generated
= true;
1354 if (execute_one_pass (pass
) && pass
->sub
)
1356 if (pass
->sub
->type
== GIMPLE_PASS
)
1357 do_per_function_toporder ((void (*)(void *))execute_pass_list
,
1359 else if (pass
->sub
->type
== SIMPLE_IPA_PASS
1360 || pass
->sub
->type
== IPA_PASS
)
1361 execute_ipa_pass_list (pass
->sub
);
1365 if (!current_function_decl
)
1366 cgraph_process_new_functions ();
1372 #include "gt-passes.h"