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)
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 =
291 "*rest_of_compilation", /* name */
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_warn_unused_result);
513 NEXT_PASS (pass_diagnose_omp_blocks);
514 NEXT_PASS (pass_remove_useless_stmts);
515 NEXT_PASS (pass_mudflap_1);
516 NEXT_PASS (pass_lower_omp);
517 NEXT_PASS (pass_lower_cf);
518 NEXT_PASS (pass_refactor_eh);
519 NEXT_PASS (pass_lower_eh);
520 NEXT_PASS (pass_build_cfg);
521 NEXT_PASS (pass_lower_complex_O0);
522 NEXT_PASS (pass_lower_vector);
523 NEXT_PASS (pass_warn_function_return);
524 NEXT_PASS (pass_build_cgraph_edges);
525 NEXT_PASS (pass_inline_parameters);
528 /* Interprocedural optimization passes. */
530 NEXT_PASS (pass_ipa_function_and_variable_visibility);
531 NEXT_PASS (pass_ipa_early_inline);
533 struct opt_pass **p = &pass_ipa_early_inline.pass.sub;
534 NEXT_PASS (pass_early_inline);
535 NEXT_PASS (pass_inline_parameters);
536 NEXT_PASS (pass_rebuild_cgraph_edges);
538 NEXT_PASS (pass_ipa_free_lang_data);
539 NEXT_PASS (pass_early_local_passes);
541 struct opt_pass **p = &pass_early_local_passes.pass.sub;
542 NEXT_PASS (pass_fixup_cfg);
543 NEXT_PASS (pass_tree_profile);
544 NEXT_PASS (pass_cleanup_cfg);
545 NEXT_PASS (pass_init_datastructures);
546 NEXT_PASS (pass_expand_omp);
548 NEXT_PASS (pass_referenced_vars);
549 NEXT_PASS (pass_build_ssa);
550 NEXT_PASS (pass_early_warn_uninitialized);
551 NEXT_PASS (pass_all_early_optimizations);
553 struct opt_pass **p = &pass_all_early_optimizations.pass.sub;
554 NEXT_PASS (pass_rebuild_cgraph_edges);
555 NEXT_PASS (pass_early_inline);
556 NEXT_PASS (pass_remove_cgraph_callee_edges);
557 NEXT_PASS (pass_rename_ssa_copies);
558 NEXT_PASS (pass_ccp);
559 NEXT_PASS (pass_forwprop);
560 /* pass_build_ealias is a dummy pass that ensures that we
561 execute TODO_rebuild_alias at this point. Re-building
562 alias information also rewrites no longer addressed
563 locals into SSA form if possible. */
564 NEXT_PASS (pass_build_ealias);
565 NEXT_PASS (pass_sra_early);
566 NEXT_PASS (pass_copy_prop);
567 NEXT_PASS (pass_merge_phi);
568 NEXT_PASS (pass_cd_dce);
569 NEXT_PASS (pass_early_ipa_sra);
570 NEXT_PASS (pass_tail_recursion);
571 NEXT_PASS (pass_convert_switch);
572 NEXT_PASS (pass_cleanup_eh);
573 NEXT_PASS (pass_profile);
574 NEXT_PASS (pass_local_pure_const);
576 NEXT_PASS (pass_release_ssa_names);
577 NEXT_PASS (pass_rebuild_cgraph_edges);
578 NEXT_PASS (pass_inline_parameters);
580 NEXT_PASS (pass_ipa_increase_alignment);
581 NEXT_PASS (pass_ipa_matrix_reorg);
582 NEXT_PASS (pass_ipa_cp);
583 NEXT_PASS (pass_ipa_inline);
584 NEXT_PASS (pass_ipa_reference);
585 NEXT_PASS (pass_ipa_pure_const);
586 NEXT_PASS (pass_ipa_type_escape);
587 NEXT_PASS (pass_ipa_pta);
588 NEXT_PASS (pass_ipa_struct_reorg);
591 /* These passes are run after IPA passes on every function that is being
592 output to the assembler file. */
594 NEXT_PASS (pass_lower_eh_dispatch);
595 NEXT_PASS (pass_all_optimizations);
597 struct opt_pass **p = &pass_all_optimizations.pass.sub;
598 NEXT_PASS (pass_remove_cgraph_callee_edges);
599 /* Initial scalar cleanups before alias computation.
600 They ensure memory accesses are not indirect wherever possible. */
601 NEXT_PASS (pass_strip_predict_hints);
602 NEXT_PASS (pass_update_address_taken);
603 NEXT_PASS (pass_rename_ssa_copies);
604 NEXT_PASS (pass_complete_unrolli);
605 NEXT_PASS (pass_ccp);
606 NEXT_PASS (pass_forwprop);
607 NEXT_PASS (pass_call_cdce);
608 /* pass_build_alias is a dummy pass that ensures that we
609 execute TODO_rebuild_alias at this point. Re-building
610 alias information also rewrites no longer addressed
611 locals into SSA form if possible. */
612 NEXT_PASS (pass_build_alias);
613 NEXT_PASS (pass_return_slot);
614 NEXT_PASS (pass_phiprop);
615 NEXT_PASS (pass_fre);
616 NEXT_PASS (pass_copy_prop);
617 NEXT_PASS (pass_merge_phi);
618 NEXT_PASS (pass_vrp);
619 NEXT_PASS (pass_dce);
620 NEXT_PASS (pass_cselim);
621 NEXT_PASS (pass_tree_ifcombine);
622 NEXT_PASS (pass_phiopt);
623 NEXT_PASS (pass_tail_recursion);
625 NEXT_PASS (pass_stdarg);
626 NEXT_PASS (pass_lower_complex);
627 NEXT_PASS (pass_sra);
628 NEXT_PASS (pass_rename_ssa_copies);
629 NEXT_PASS (pass_dominator);
630 /* The only const/copy propagation opportunities left after
631 DOM should be due to degenerate PHI nodes. So rather than
632 run the full propagators, run a specialized pass which
633 only examines PHIs to discover const/copy propagation
635 NEXT_PASS (pass_phi_only_cprop);
636 NEXT_PASS (pass_dse);
637 NEXT_PASS (pass_reassoc);
638 NEXT_PASS (pass_dce);
639 NEXT_PASS (pass_forwprop);
640 NEXT_PASS (pass_phiopt);
641 NEXT_PASS (pass_object_sizes);
642 NEXT_PASS (pass_ccp);
643 NEXT_PASS (pass_copy_prop);
644 NEXT_PASS (pass_fold_builtins);
645 NEXT_PASS (pass_cse_sincos);
646 NEXT_PASS (pass_optimize_bswap);
647 NEXT_PASS (pass_split_crit_edges);
648 NEXT_PASS (pass_pre);
649 NEXT_PASS (pass_sink_code);
650 NEXT_PASS (pass_tree_loop);
652 struct opt_pass **p = &pass_tree_loop.pass.sub;
653 NEXT_PASS (pass_tree_loop_init);
654 NEXT_PASS (pass_copy_prop);
655 NEXT_PASS (pass_dce_loop);
656 NEXT_PASS (pass_lim);
657 NEXT_PASS (pass_tree_unswitch);
658 NEXT_PASS (pass_scev_cprop);
659 NEXT_PASS (pass_record_bounds);
660 NEXT_PASS (pass_check_data_deps);
661 NEXT_PASS (pass_loop_distribution);
662 NEXT_PASS (pass_linear_transform);
663 NEXT_PASS (pass_graphite_transforms);
665 struct opt_pass **p = &pass_graphite_transforms.pass.sub;
666 NEXT_PASS (pass_dce_loop);
667 NEXT_PASS (pass_lim);
669 NEXT_PASS (pass_iv_canon);
670 NEXT_PASS (pass_if_conversion);
671 NEXT_PASS (pass_vectorize);
673 struct opt_pass **p = &pass_vectorize.pass.sub;
674 NEXT_PASS (pass_lower_vector_ssa);
675 NEXT_PASS (pass_dce_loop);
677 NEXT_PASS (pass_predcom);
678 NEXT_PASS (pass_complete_unroll);
679 NEXT_PASS (pass_slp_vectorize);
680 NEXT_PASS (pass_parallelize_loops);
681 NEXT_PASS (pass_loop_prefetch);
682 NEXT_PASS (pass_iv_optimize);
683 NEXT_PASS (pass_tree_loop_done);
685 NEXT_PASS (pass_cse_reciprocals);
686 NEXT_PASS (pass_convert_to_rsqrt);
687 NEXT_PASS (pass_reassoc);
688 NEXT_PASS (pass_vrp);
689 NEXT_PASS (pass_dominator);
690 /* The only const/copy propagation opportunities left after
691 DOM should be due to degenerate PHI nodes. So rather than
692 run the full propagators, run a specialized pass which
693 only examines PHIs to discover const/copy propagation
695 NEXT_PASS (pass_phi_only_cprop);
696 NEXT_PASS (pass_cd_dce);
697 NEXT_PASS (pass_tracer);
699 /* FIXME: If DCE is not run before checking for uninitialized uses,
700 we may get false warnings (e.g., testsuite/gcc.dg/uninit-5.c).
701 However, this also causes us to misdiagnose cases that should be
702 real warnings (e.g., testsuite/gcc.dg/pr18501.c).
704 To fix the false positives in uninit-5.c, we would have to
705 account for the predicates protecting the set and the use of each
706 variable. Using a representation like Gated Single Assignment
708 NEXT_PASS (pass_late_warn_uninitialized);
709 NEXT_PASS (pass_dse);
710 NEXT_PASS (pass_forwprop);
711 NEXT_PASS (pass_phiopt);
712 NEXT_PASS (pass_tail_calls);
713 NEXT_PASS (pass_rename_ssa_copies);
714 NEXT_PASS (pass_uncprop);
715 NEXT_PASS (pass_local_pure_const);
717 NEXT_PASS (pass_cleanup_eh);
718 NEXT_PASS (pass_lower_resx);
719 NEXT_PASS (pass_nrv);
720 NEXT_PASS (pass_mudflap_2);
721 NEXT_PASS (pass_cleanup_cfg_post_optimizing);
722 NEXT_PASS (pass_warn_function_noreturn);
724 NEXT_PASS (pass_expand);
726 NEXT_PASS (pass_rest_of_compilation);
728 struct opt_pass **p = &pass_rest_of_compilation.pass.sub;
729 NEXT_PASS (pass_init_function);
730 NEXT_PASS (pass_jump);
731 NEXT_PASS (pass_rtl_eh);
732 NEXT_PASS (pass_initial_value_sets);
733 NEXT_PASS (pass_unshare_all_rtl);
734 NEXT_PASS (pass_instantiate_virtual_regs);
735 NEXT_PASS (pass_into_cfg_layout_mode);
736 NEXT_PASS (pass_jump2);
737 NEXT_PASS (pass_lower_subreg);
738 NEXT_PASS (pass_df_initialize_opt);
739 NEXT_PASS (pass_cse);
740 NEXT_PASS (pass_rtl_fwprop);
741 NEXT_PASS (pass_rtl_cprop);
742 NEXT_PASS (pass_rtl_pre);
743 NEXT_PASS (pass_rtl_hoist);
744 NEXT_PASS (pass_rtl_cprop);
745 NEXT_PASS (pass_rtl_store_motion);
746 NEXT_PASS (pass_cse_after_global_opts);
747 NEXT_PASS (pass_rtl_ifcvt);
748 /* Perform loop optimizations. It might be better to do them a bit
749 sooner, but we want the profile feedback to work more
751 NEXT_PASS (pass_loop2);
753 struct opt_pass **p = &pass_loop2.pass.sub;
754 NEXT_PASS (pass_rtl_loop_init);
755 NEXT_PASS (pass_rtl_move_loop_invariants);
756 NEXT_PASS (pass_rtl_unswitch);
757 NEXT_PASS (pass_rtl_unroll_and_peel_loops);
758 NEXT_PASS (pass_rtl_doloop);
759 NEXT_PASS (pass_rtl_loop_done);
762 NEXT_PASS (pass_web);
763 NEXT_PASS (pass_rtl_cprop);
764 NEXT_PASS (pass_cse2);
765 NEXT_PASS (pass_rtl_dse1);
766 NEXT_PASS (pass_rtl_fwprop_addr);
767 NEXT_PASS (pass_reginfo_init);
768 NEXT_PASS (pass_inc_dec);
769 NEXT_PASS (pass_initialize_regs);
770 NEXT_PASS (pass_ud_rtl_dce);
771 NEXT_PASS (pass_combine);
772 NEXT_PASS (pass_if_after_combine);
773 NEXT_PASS (pass_partition_blocks);
774 NEXT_PASS (pass_regmove);
775 NEXT_PASS (pass_outof_cfg_layout_mode);
776 NEXT_PASS (pass_split_all_insns);
777 NEXT_PASS (pass_lower_subreg2);
778 NEXT_PASS (pass_df_initialize_no_opt);
779 NEXT_PASS (pass_stack_ptr_mod);
780 NEXT_PASS (pass_mode_switching);
781 NEXT_PASS (pass_match_asm_constraints);
782 NEXT_PASS (pass_sms);
783 NEXT_PASS (pass_subregs_of_mode_init);
784 NEXT_PASS (pass_sched);
785 NEXT_PASS (pass_ira);
786 NEXT_PASS (pass_subregs_of_mode_finish);
787 NEXT_PASS (pass_postreload);
789 struct opt_pass **p = &pass_postreload.pass.sub;
790 NEXT_PASS (pass_postreload_cse);
791 NEXT_PASS (pass_gcse2);
792 NEXT_PASS (pass_split_after_reload);
793 NEXT_PASS (pass_branch_target_load_optimize1);
794 NEXT_PASS (pass_thread_prologue_and_epilogue);
795 NEXT_PASS (pass_rtl_dse2);
796 NEXT_PASS (pass_stack_adjustments);
797 NEXT_PASS (pass_peephole2);
798 NEXT_PASS (pass_if_after_reload);
799 NEXT_PASS (pass_regrename);
800 NEXT_PASS (pass_cprop_hardreg);
801 NEXT_PASS (pass_fast_rtl_dce);
802 NEXT_PASS (pass_reorder_blocks);
803 NEXT_PASS (pass_branch_target_load_optimize2);
804 NEXT_PASS (pass_leaf_regs);
805 NEXT_PASS (pass_split_before_sched2);
806 NEXT_PASS (pass_sched2);
807 NEXT_PASS (pass_stack_regs);
809 struct opt_pass **p = &pass_stack_regs.pass.sub;
810 NEXT_PASS (pass_split_before_regstack);
811 NEXT_PASS (pass_stack_regs_run);
813 NEXT_PASS (pass_compute_alignments);
814 NEXT_PASS (pass_duplicate_computed_gotos);
815 NEXT_PASS (pass_variable_tracking);
816 NEXT_PASS (pass_free_cfg);
817 NEXT_PASS (pass_machine_reorg);
818 NEXT_PASS (pass_cleanup_barriers);
819 NEXT_PASS (pass_delay_slots);
820 NEXT_PASS (pass_split_for_shorten_branches);
821 NEXT_PASS (pass_convert_to_eh_region_ranges);
822 NEXT_PASS (pass_shorten_branches);
823 NEXT_PASS (pass_set_nothrow_function_flags);
824 NEXT_PASS (pass_final);
826 NEXT_PASS (pass_df_finish);
828 NEXT_PASS (pass_clean_state);
833 /* Register the passes with the tree dump code. */
834 register_dump_files (all_lowering_passes, PROP_gimple_any);
835 register_dump_files (all_ipa_passes,
836 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
838 register_dump_files (all_passes,
839 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
843 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
844 function CALLBACK for every function in the call graph. Otherwise,
845 call CALLBACK on the current function. */
848 do_per_function (void (*callback) (void *data), void *data)
850 if (current_function_decl)
854 struct cgraph_node *node;
855 for (node = cgraph_nodes; node; node = node->next)
856 if (node->analyzed && gimple_has_body_p (node->decl)
857 && (!node->clone_of || node->decl != node->clone_of->decl))
859 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
860 current_function_decl = node->decl;
862 free_dominance_info (CDI_DOMINATORS);
863 free_dominance_info (CDI_POST_DOMINATORS);
864 current_function_decl = NULL;
871 /* Because inlining might remove no-longer reachable nodes, we need to
872 keep the array visible to garbage collector to avoid reading collected
875 static GTY ((length ("nnodes"))) struct cgraph_node **order;
877 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
878 function CALLBACK for every function in the call graph. Otherwise,
879 call CALLBACK on the current function. */
882 do_per_function_toporder (void (*callback) (void *data), void *data)
886 if (current_function_decl)
891 order = GGC_NEWVEC (struct cgraph_node *, cgraph_n_nodes);
892 nnodes = cgraph_postorder (order);
893 for (i = nnodes - 1; i >= 0; i--)
894 order[i]->process = 1;
895 for (i = nnodes - 1; i >= 0; i--)
897 struct cgraph_node *node = order[i];
899 /* Allow possibly removed nodes to be garbage collected. */
902 if (node->analyzed && (node->needed || node->reachable))
904 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
905 current_function_decl = node->decl;
907 free_dominance_info (CDI_DOMINATORS);
908 free_dominance_info (CDI_POST_DOMINATORS);
909 current_function_decl = NULL;
920 /* Perform all TODO actions that ought to be done on each function. */
923 execute_function_todo (void *data)
925 unsigned int flags = (size_t)data;
926 if (cfun->curr_properties & PROP_ssa)
927 flags |= TODO_verify_ssa;
928 flags &= ~cfun->last_verified;
932 statistics_fini_pass ();
934 /* Always cleanup the CFG before trying to update SSA. */
935 if (flags & TODO_cleanup_cfg)
937 bool cleanup = cleanup_tree_cfg ();
939 if (cleanup && (cfun->curr_properties & PROP_ssa))
940 flags |= TODO_remove_unused_locals;
942 /* When cleanup_tree_cfg merges consecutive blocks, it may
943 perform some simplistic propagation when removing single
944 valued PHI nodes. This propagation may, in turn, cause the
945 SSA form to become out-of-date (see PR 22037). So, even
946 if the parent pass had not scheduled an SSA update, we may
947 still need to do one. */
948 if (!(flags & TODO_update_ssa_any) && need_ssa_update_p (cfun))
949 flags |= TODO_update_ssa;
952 if (flags & TODO_update_ssa_any)
954 unsigned update_flags = flags & TODO_update_ssa_any;
955 update_ssa (update_flags);
956 cfun->last_verified &= ~TODO_verify_ssa;
959 if (flags & TODO_update_address_taken)
960 execute_update_addresses_taken (true);
962 if (flags & TODO_rebuild_alias)
964 if (!(flags & TODO_update_address_taken))
965 execute_update_addresses_taken (true);
966 compute_may_aliases ();
969 if (flags & TODO_remove_unused_locals)
970 remove_unused_locals ();
972 if ((flags & TODO_dump_func) && dump_file && current_function_decl)
974 if (cfun->curr_properties & PROP_trees)
975 dump_function_to_file (current_function_decl, dump_file, dump_flags);
978 if (dump_flags & TDF_SLIM)
979 print_rtl_slim_with_bb (dump_file, get_insns (), dump_flags);
980 else if ((cfun->curr_properties & PROP_cfg)
981 && (dump_flags & TDF_BLOCKS))
982 print_rtl_with_bb (dump_file, get_insns ());
984 print_rtl (dump_file, get_insns ());
986 if ((cfun->curr_properties & PROP_cfg)
987 && graph_dump_format != no_graph
988 && (dump_flags & TDF_GRAPH))
989 print_rtl_graph_with_bb (dump_file_name, get_insns ());
992 /* Flush the file. If verification fails, we won't be able to
993 close the file before aborting. */
997 if (flags & TODO_rebuild_frequencies)
999 if (profile_status == PROFILE_GUESSED)
1001 loop_optimizer_init (0);
1002 add_noreturn_fake_exit_edges ();
1003 mark_irreducible_loops ();
1004 connect_infinite_loops_to_exit ();
1005 estimate_bb_frequencies ();
1006 remove_fake_exit_edges ();
1007 loop_optimizer_finalize ();
1009 else if (profile_status == PROFILE_READ)
1015 #if defined ENABLE_CHECKING
1016 if (flags & TODO_verify_ssa)
1018 if (flags & TODO_verify_flow)
1019 verify_flow_info ();
1020 if (flags & TODO_verify_stmts)
1022 if (flags & TODO_verify_loops)
1023 verify_loop_closed_ssa ();
1024 if (flags & TODO_verify_rtl_sharing)
1025 verify_rtl_sharing ();
1028 cfun->last_verified = flags & TODO_verify_all;
1031 /* Perform all TODO actions. */
1033 execute_todo (unsigned int flags)
1035 #if defined ENABLE_CHECKING
1037 && need_ssa_update_p (cfun))
1038 gcc_assert (flags & TODO_update_ssa_any);
1041 /* Inform the pass whether it is the first time it is run. */
1042 first_pass_instance = (flags & TODO_mark_first_instance) != 0;
1044 do_per_function (execute_function_todo, (void *)(size_t) flags);
1046 /* Always remove functions just as before inlining: IPA passes might be
1047 interested to see bodies of extern inline functions that are not inlined
1048 to analyze side effects. The full removal is done just at the end
1049 of IPA pass queue. */
1050 if (flags & TODO_remove_functions)
1053 cgraph_remove_unreachable_nodes (true, dump_file);
1056 if ((flags & TODO_dump_cgraph) && dump_file && !current_function_decl)
1059 dump_cgraph (dump_file);
1060 /* Flush the file. If verification fails, we won't be able to
1061 close the file before aborting. */
1065 if (flags & TODO_ggc_collect)
1068 /* Now that the dumping has been done, we can get rid of the optional
1070 if (flags & TODO_df_finish)
1071 df_finish_pass ((flags & TODO_df_verify) != 0);
1074 /* Verify invariants that should hold between passes. This is a place
1075 to put simple sanity checks. */
1078 verify_interpass_invariants (void)
1080 #ifdef ENABLE_CHECKING
1081 gcc_assert (!fold_deferring_overflow_warnings_p ());
1085 /* Clear the last verified flag. */
1088 clear_last_verified (void *data ATTRIBUTE_UNUSED)
1090 cfun->last_verified = 0;
1093 /* Helper function. Verify that the properties has been turn into the
1094 properties expected by the pass. */
1096 #ifdef ENABLE_CHECKING
1098 verify_curr_properties (void *data)
1100 unsigned int props = (size_t)data;
1101 gcc_assert ((cfun->curr_properties & props) == props);
1105 /* Initialize pass dump file. */
1108 pass_init_dump_file (struct opt_pass *pass)
1110 /* If a dump file name is present, open it if enabled. */
1111 if (pass->static_pass_number != -1)
1113 bool initializing_dump = !dump_initialized_p (pass->static_pass_number);
1114 dump_file_name = get_dump_file_name (pass->static_pass_number);
1115 dump_file = dump_begin (pass->static_pass_number, &dump_flags);
1116 if (dump_file && current_function_decl)
1118 const char *dname, *aname;
1119 dname = lang_hooks.decl_printable_name (current_function_decl, 2);
1120 aname = (IDENTIFIER_POINTER
1121 (DECL_ASSEMBLER_NAME (current_function_decl)));
1122 fprintf (dump_file, "\n;; Function %s (%s)%s\n\n", dname, aname,
1123 cfun->function_frequency == FUNCTION_FREQUENCY_HOT
1125 : cfun->function_frequency == FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
1126 ? " (unlikely executed)"
1129 return initializing_dump;
1135 /* Flush PASS dump file. */
1138 pass_fini_dump_file (struct opt_pass *pass)
1140 /* Flush and close dump file. */
1143 free (CONST_CAST (char *, dump_file_name));
1144 dump_file_name = NULL;
1149 dump_end (pass->static_pass_number, dump_file);
1154 /* After executing the pass, apply expected changes to the function
1158 update_properties_after_pass (void *data)
1160 struct opt_pass *pass = (struct opt_pass *) data;
1161 cfun->curr_properties = (cfun->curr_properties | pass->properties_provided)
1162 & ~pass->properties_destroyed;
1165 /* Schedule IPA transform pass DATA for CFUN. */
1168 add_ipa_transform_pass (void *data)
1170 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *) data;
1171 VEC_safe_push (ipa_opt_pass, heap, cfun->ipa_transforms_to_apply, ipa_pass);
1174 /* Execute summary generation for all of the passes in IPA_PASS. */
1177 execute_ipa_summary_passes (struct ipa_opt_pass_d *ipa_pass)
1181 struct opt_pass *pass = &ipa_pass->pass;
1183 /* Execute all of the IPA_PASSes in the list. */
1184 if (ipa_pass->pass.type == IPA_PASS
1185 && (!pass->gate || pass->gate ()))
1187 pass_init_dump_file (pass);
1188 ipa_pass->generate_summary ();
1189 pass_fini_dump_file (pass);
1191 ipa_pass = (struct ipa_opt_pass_d *)ipa_pass->pass.next;
1195 /* Execute IPA_PASS function transform on NODE. */
1198 execute_one_ipa_transform_pass (struct cgraph_node *node,
1199 struct ipa_opt_pass_d *ipa_pass)
1201 struct opt_pass *pass = &ipa_pass->pass;
1202 unsigned int todo_after = 0;
1204 current_pass = pass;
1205 if (!ipa_pass->function_transform)
1208 /* Note that the folders should only create gimple expressions.
1209 This is a hack until the new folder is ready. */
1210 in_gimple_form = (cfun && (cfun->curr_properties & PROP_trees)) != 0;
1212 pass_init_dump_file (pass);
1214 /* Run pre-pass verification. */
1215 execute_todo (ipa_pass->function_transform_todo_flags_start);
1217 /* If a timevar is present, start it. */
1218 if (pass->tv_id != TV_NONE)
1219 timevar_push (pass->tv_id);
1222 todo_after = ipa_pass->function_transform (node);
1225 if (pass->tv_id != TV_NONE)
1226 timevar_pop (pass->tv_id);
1228 /* Run post-pass cleanup and verification. */
1229 execute_todo (todo_after);
1230 verify_interpass_invariants ();
1232 pass_fini_dump_file (pass);
1234 current_pass = NULL;
1238 execute_one_pass (struct opt_pass *pass)
1240 bool initializing_dump;
1241 unsigned int todo_after = 0;
1243 /* IPA passes are executed on whole program, so cfun should be NULL.
1244 Other passes need function context set. */
1245 if (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS)
1246 gcc_assert (!cfun && !current_function_decl);
1248 gcc_assert (cfun && current_function_decl);
1250 if (cfun && cfun->ipa_transforms_to_apply)
1253 struct cgraph_node *node = cgraph_node (current_function_decl);
1255 for (i = 0; i < VEC_length (ipa_opt_pass, cfun->ipa_transforms_to_apply);
1257 execute_one_ipa_transform_pass (node,
1258 VEC_index (ipa_opt_pass,
1259 cfun->ipa_transforms_to_apply,
1261 VEC_free (ipa_opt_pass, heap, cfun->ipa_transforms_to_apply);
1262 cfun->ipa_transforms_to_apply = NULL;
1265 current_pass = pass;
1267 /* See if we're supposed to run this pass. */
1268 if (pass->gate && !pass->gate ())
1271 if (!quiet_flag && !cfun)
1272 fprintf (stderr, " <%s>", pass->name ? pass->name : "");
1274 /* Note that the folders should only create gimple expressions.
1275 This is a hack until the new folder is ready. */
1276 in_gimple_form = (cfun && (cfun->curr_properties & PROP_trees)) != 0;
1278 initializing_dump = pass_init_dump_file (pass);
1280 /* Run pre-pass verification. */
1281 execute_todo (pass->todo_flags_start);
1283 #ifdef ENABLE_CHECKING
1284 do_per_function (verify_curr_properties,
1285 (void *)(size_t)pass->properties_required);
1288 /* If a timevar is present, start it. */
1289 if (pass->tv_id != TV_NONE)
1290 timevar_push (pass->tv_id);
1295 todo_after = pass->execute ();
1296 do_per_function (clear_last_verified, NULL);
1300 if (pass->tv_id != TV_NONE)
1301 timevar_pop (pass->tv_id);
1303 do_per_function (update_properties_after_pass, pass);
1305 if (initializing_dump
1307 && graph_dump_format != no_graph
1309 && (cfun->curr_properties & (PROP_cfg | PROP_rtl))
1310 == (PROP_cfg | PROP_rtl))
1312 get_dump_file_info (pass->static_pass_number)->flags |= TDF_GRAPH;
1313 dump_flags |= TDF_GRAPH;
1314 clean_graph_dump_file (dump_file_name);
1317 /* Run post-pass cleanup and verification. */
1318 execute_todo (todo_after | pass->todo_flags_finish);
1319 verify_interpass_invariants ();
1320 if (pass->type == IPA_PASS)
1321 do_per_function (add_ipa_transform_pass, pass);
1323 if (!current_function_decl)
1324 cgraph_process_new_functions ();
1326 pass_fini_dump_file (pass);
1328 if (pass->type != SIMPLE_IPA_PASS && pass->type != IPA_PASS)
1329 gcc_assert (!(cfun->curr_properties & PROP_trees)
1330 || pass->type != RTL_PASS);
1332 current_pass = NULL;
1338 execute_pass_list (struct opt_pass *pass)
1342 gcc_assert (pass->type == GIMPLE_PASS
1343 || pass->type == RTL_PASS);
1344 if (execute_one_pass (pass) && pass->sub)
1345 execute_pass_list (pass->sub);
1351 /* Same as execute_pass_list but assume that subpasses of IPA passes
1352 are local passes. */
1354 execute_ipa_pass_list (struct opt_pass *pass)
1356 bool summaries_generated = false;
1359 gcc_assert (!current_function_decl);
1361 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
1362 if (pass->type == IPA_PASS && (!pass->gate || pass->gate ()))
1364 if (!summaries_generated)
1366 if (!quiet_flag && !cfun)
1367 fprintf (stderr, " <summary generate>");
1368 execute_ipa_summary_passes ((struct ipa_opt_pass_d *) pass);
1370 summaries_generated = true;
1372 if (execute_one_pass (pass) && pass->sub)
1374 if (pass->sub->type == GIMPLE_PASS)
1375 do_per_function_toporder ((void (*)(void *))execute_pass_list,
1377 else if (pass->sub->type == SIMPLE_IPA_PASS
1378 || pass->sub->type == IPA_PASS)
1379 execute_ipa_pass_list (pass->sub);
1383 if (!current_function_decl)
1384 cgraph_process_new_functions ();
1390 /* Called by local passes to see if function is called by already processed nodes.
1391 Because we process nodes in topological order, this means that function is
1392 in recursive cycle or we introduced new direct calls. */
1394 function_called_by_processed_nodes_p (void)
1396 struct cgraph_edge *e;
1397 for (e = cgraph_node (current_function_decl)->callers; e; e = e->next_caller)
1399 if (e->caller->decl == current_function_decl)
1401 if (!e->caller->analyzed || (!e->caller->needed && !e->caller->reachable))
1403 if (TREE_ASM_WRITTEN (e->caller->decl))
1405 if (!e->caller->process && !e->caller->global.inlined_to)
1410 fprintf (dump_file, "Already processed call to:\n");
1411 dump_cgraph_node (dump_file, e->caller);
1416 #include "gt-passes.h"