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"
87 #include "lto-streamer.h"
89 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
90 #include "dwarf2out.h"
93 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
97 #ifdef SDB_DEBUGGING_INFO
101 #ifdef XCOFF_DEBUGGING_INFO
102 #include "xcoffout.h" /* Needed for external data
103 declarations for e.g. AIX 4.x. */
106 /* This is used for debugging. It allows the current pass to printed
107 from anywhere in compilation. */
108 struct opt_pass *current_pass;
110 /* Call from anywhere to find out what pass this is. Useful for
111 printing out debugging information deep inside an service
114 print_current_pass (FILE *file)
117 fprintf (file, "current pass = %s (%d)\n",
118 current_pass->name, current_pass->static_pass_number);
120 fprintf (file, "no current pass.\n");
124 /* Call from the debugger to get the current pass name. */
128 print_current_pass (stderr);
133 /* Global variables used to communicate with passes. */
136 bool first_pass_instance;
139 /* This is called from various places for FUNCTION_DECL, VAR_DECL,
142 This does nothing for local (non-static) variables, unless the
143 variable is a register variable with DECL_ASSEMBLER_NAME set. In
144 that case, or if the variable is not an automatic, it sets up the
145 RTL and outputs any assembler code (label definition, storage
146 allocation and initialization).
148 DECL is the declaration. TOP_LEVEL is nonzero
149 if this declaration is not within a function. */
152 rest_of_decl_compilation (tree decl,
156 /* We deferred calling assemble_alias so that we could collect
157 other attributes such as visibility. Emit the alias now. */
160 alias = lookup_attribute ("alias", DECL_ATTRIBUTES (decl));
163 alias = TREE_VALUE (TREE_VALUE (alias));
164 alias = get_identifier (TREE_STRING_POINTER (alias));
165 assemble_alias (decl, alias);
169 /* Can't defer this, because it needs to happen before any
170 later function definitions are processed. */
171 if (DECL_ASSEMBLER_NAME_SET_P (decl) && DECL_REGISTER (decl))
172 make_decl_rtl (decl);
174 /* Forward declarations for nested functions are not "external",
175 but we need to treat them as if they were. */
176 if (TREE_STATIC (decl) || DECL_EXTERNAL (decl)
177 || TREE_CODE (decl) == FUNCTION_DECL)
179 timevar_push (TV_VARCONST);
181 /* Don't output anything when a tentative file-scope definition
182 is seen. But at end of compilation, do output code for them.
184 We do output all variables and rely on
185 callgraph code to defer them except for forward declarations
186 (see gcc.c-torture/compile/920624-1.c) */
188 || !DECL_DEFER_OUTPUT (decl)
189 || DECL_INITIAL (decl))
190 && !DECL_EXTERNAL (decl))
192 if (TREE_CODE (decl) != FUNCTION_DECL)
193 varpool_finalize_decl (decl);
195 assemble_variable (decl, top_level, at_end, 0);
198 #ifdef ASM_FINISH_DECLARE_OBJECT
199 if (decl == last_assemble_variable_decl)
201 ASM_FINISH_DECLARE_OBJECT (asm_out_file, decl,
206 timevar_pop (TV_VARCONST);
208 else if (TREE_CODE (decl) == TYPE_DECL
209 /* Like in rest_of_type_compilation, avoid confusing the debug
210 information machinery when there are errors. */
211 && !(sorrycount || errorcount))
213 timevar_push (TV_SYMOUT);
214 debug_hooks->type_decl (decl, !top_level);
215 timevar_pop (TV_SYMOUT);
218 /* Let cgraph know about the existence of variables. */
219 if (TREE_CODE (decl) == VAR_DECL && !DECL_EXTERNAL (decl))
223 /* Called after finishing a record, union or enumeral type. */
226 rest_of_type_compilation (tree type, int toplev)
228 /* Avoid confusing the debug information machinery when there are
230 if (errorcount != 0 || sorrycount != 0)
233 timevar_push (TV_SYMOUT);
234 debug_hooks->type_decl (TYPE_STUB_DECL (type), !toplev);
235 timevar_pop (TV_SYMOUT);
241 finish_optimization_passes (void)
244 struct dump_file_info *dfi;
247 timevar_push (TV_DUMP);
248 if (profile_arc_flag || flag_test_coverage || flag_branch_probabilities)
250 dump_file = dump_begin (pass_profile.pass.static_pass_number, NULL);
253 dump_end (pass_profile.pass.static_pass_number, dump_file);
258 dump_file = dump_begin (pass_combine.pass.static_pass_number, NULL);
261 dump_combine_total_stats (dump_file);
262 dump_end (pass_combine.pass.static_pass_number, dump_file);
266 /* Do whatever is necessary to finish printing the graphs. */
267 if (graph_dump_format != no_graph)
268 for (i = TDI_end; (dfi = get_dump_file_info (i)) != NULL; ++i)
269 if (dump_initialized_p (i)
270 && (dfi->flags & TDF_GRAPH) != 0
271 && (name = get_dump_file_name (i)) != NULL)
273 finish_graph_dump_file (name);
277 timevar_pop (TV_DUMP);
281 gate_rest_of_compilation (void)
283 /* Early return if there were errors. We can run afoul of our
284 consistency checks, and there's not really much point in fixing them. */
285 return !(rtl_dump_and_exit || flag_syntax_only || errorcount || sorrycount);
288 struct gimple_opt_pass pass_rest_of_compilation =
292 "*rest_of_compilation", /* name */
293 gate_rest_of_compilation, /* gate */
297 0, /* static_pass_number */
298 TV_REST_OF_COMPILATION, /* tv_id */
299 PROP_rtl, /* properties_required */
300 0, /* properties_provided */
301 0, /* properties_destroyed */
302 0, /* todo_flags_start */
303 TODO_ggc_collect /* todo_flags_finish */
308 gate_postreload (void)
310 return reload_completed;
313 struct rtl_opt_pass pass_postreload =
318 gate_postreload, /* gate */
322 0, /* static_pass_number */
324 PROP_rtl, /* properties_required */
325 0, /* properties_provided */
326 0, /* properties_destroyed */
327 0, /* todo_flags_start */
328 TODO_ggc_collect | TODO_verify_rtl_sharing /* todo_flags_finish */
334 /* The root of the compilation pass tree, once constructed. */
335 struct opt_pass *all_passes, *all_small_ipa_passes, *all_lowering_passes,
336 *all_regular_ipa_passes, *all_lto_gen_passes;
338 /* A map from static pass id to optimization pass. */
339 struct opt_pass **passes_by_id;
340 int passes_by_id_size;
342 /* Set the static pass number of pass PASS to ID and record that
343 in the mapping from static pass number to pass. */
346 set_pass_for_id (int id, struct opt_pass *pass)
348 pass->static_pass_number = id;
349 if (passes_by_id_size <= id)
351 passes_by_id = XRESIZEVEC (struct opt_pass *, passes_by_id, id + 1);
352 memset (passes_by_id + passes_by_id_size, 0,
353 (id + 1 - passes_by_id_size) * sizeof (void *));
354 passes_by_id_size = id + 1;
356 passes_by_id[id] = pass;
359 /* Return the pass with the static pass number ID. */
362 get_pass_for_id (int id)
364 if (id >= passes_by_id_size)
366 return passes_by_id[id];
369 /* Iterate over the pass tree allocating dump file numbers. We want
370 to do this depth first, and independent of whether the pass is
374 register_one_dump_file (struct opt_pass *pass)
376 char *dot_name, *flag_name, *glob_name;
381 /* See below in next_pass_1. */
383 if (pass->static_pass_number != -1)
384 sprintf (num, "%d", ((int) pass->static_pass_number < 0
385 ? 1 : pass->static_pass_number));
387 dot_name = concat (".", pass->name, num, NULL);
388 if (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS)
389 prefix = "ipa-", flags = TDF_IPA;
390 else if (pass->type == GIMPLE_PASS)
391 prefix = "tree-", flags = TDF_TREE;
393 prefix = "rtl-", flags = TDF_RTL;
395 flag_name = concat (prefix, pass->name, num, NULL);
396 glob_name = concat (prefix, pass->name, NULL);
397 id = dump_register (dot_name, flag_name, glob_name, flags);
398 set_pass_for_id (id, pass);
401 /* Recursive worker function for register_dump_files. */
404 register_dump_files_1 (struct opt_pass *pass, int properties)
408 int new_properties = (properties | pass->properties_provided)
409 & ~pass->properties_destroyed;
411 if (pass->name && pass->name[0] != '*')
412 register_one_dump_file (pass);
415 new_properties = register_dump_files_1 (pass->sub, new_properties);
417 /* If we have a gate, combine the properties that we could have with
418 and without the pass being examined. */
420 properties &= new_properties;
422 properties = new_properties;
431 /* Register the dump files for the pipeline starting at PASS.
432 PROPERTIES reflects the properties that are guaranteed to be available at
433 the beginning of the pipeline. */
436 register_dump_files (struct opt_pass *pass,int properties)
438 pass->properties_required |= properties;
439 register_dump_files_1 (pass, properties);
442 /* Look at the static_pass_number and duplicate the pass
443 if it is already added to a list. */
445 static struct opt_pass *
446 make_pass_instance (struct opt_pass *pass, bool track_duplicates)
448 /* A nonzero static_pass_number indicates that the
449 pass is already in the list. */
450 if (pass->static_pass_number)
452 struct opt_pass *new_pass;
454 new_pass = XNEW (struct opt_pass);
455 memcpy (new_pass, pass, sizeof (*new_pass));
456 new_pass->next = NULL;
458 new_pass->todo_flags_start &= ~TODO_mark_first_instance;
460 /* Indicate to register_dump_files that this pass has duplicates,
461 and so it should rename the dump file. The first instance will
462 be -1, and be number of duplicates = -static_pass_number - 1.
463 Subsequent instances will be > 0 and just the duplicate number. */
464 if (pass->name || track_duplicates)
466 pass->static_pass_number -= 1;
467 new_pass->static_pass_number = -pass->static_pass_number;
473 pass->todo_flags_start |= TODO_mark_first_instance;
474 pass->static_pass_number = -1;
479 /* Add a pass to the pass list. Duplicate the pass if it's already
482 static struct opt_pass **
483 next_pass_1 (struct opt_pass **list, struct opt_pass *pass)
485 *list = make_pass_instance (pass, false);
487 return &(*list)->next;
490 /* List node for an inserted pass instance. We need to keep track of all
491 the newly-added pass instances (with 'added_pass_nodes' defined below)
492 so that we can register their dump files after pass-positioning is finished.
493 Registering dumping files needs to be post-processed or the
494 static_pass_number of the opt_pass object would be modified and mess up
495 the dump file names of future pass instances to be added. */
497 struct pass_list_node
499 struct opt_pass *pass;
500 struct pass_list_node *next;
503 static struct pass_list_node *added_pass_nodes = NULL;
504 static struct pass_list_node *prev_added_pass_node;
506 /* Insert the pass at the proper position. Return true if the pass
507 is successfully added.
509 NEW_PASS_INFO - new pass to be inserted
510 PASS_LIST - root of the pass list to insert the new pass to */
513 position_pass (struct register_pass_info *new_pass_info,
514 struct opt_pass **pass_list)
516 struct opt_pass *pass = *pass_list, *prev_pass = NULL;
517 bool success = false;
519 for ( ; pass; prev_pass = pass, pass = pass->next)
521 /* Check if the current pass is of the same type as the new pass and
522 matches the name and the instance number of the reference pass. */
523 if (pass->type == new_pass_info->pass->type
525 && !strcmp (pass->name, new_pass_info->reference_pass_name)
526 && ((new_pass_info->ref_pass_instance_number == 0)
527 || (new_pass_info->ref_pass_instance_number ==
528 pass->static_pass_number)
529 || (new_pass_info->ref_pass_instance_number == 1
530 && pass->todo_flags_start & TODO_mark_first_instance)))
532 struct opt_pass *new_pass;
533 struct pass_list_node *new_pass_node;
535 new_pass = make_pass_instance (new_pass_info->pass, true);
537 /* Insert the new pass instance based on the positioning op. */
538 switch (new_pass_info->pos_op)
540 case PASS_POS_INSERT_AFTER:
541 new_pass->next = pass->next;
542 pass->next = new_pass;
544 /* Skip newly inserted pass to avoid repeated
545 insertions in the case where the new pass and the
546 existing one have the same name. */
549 case PASS_POS_INSERT_BEFORE:
550 new_pass->next = pass;
552 prev_pass->next = new_pass;
554 *pass_list = new_pass;
556 case PASS_POS_REPLACE:
557 new_pass->next = pass->next;
559 prev_pass->next = new_pass;
561 *pass_list = new_pass;
562 new_pass->sub = pass->sub;
563 new_pass->tv_id = pass->tv_id;
567 error ("Invalid pass positioning operation");
571 /* Save the newly added pass (instance) in the added_pass_nodes
572 list so that we can register its dump file later. Note that
573 we cannot register the dump file now because doing so will modify
574 the static_pass_number of the opt_pass object and therefore
575 mess up the dump file name of future instances. */
576 new_pass_node = XCNEW (struct pass_list_node);
577 new_pass_node->pass = new_pass;
578 if (!added_pass_nodes)
579 added_pass_nodes = new_pass_node;
581 prev_added_pass_node->next = new_pass_node;
582 prev_added_pass_node = new_pass_node;
587 if (pass->sub && position_pass (new_pass_info, &pass->sub))
594 /* Hooks a new pass into the pass lists.
596 PASS_INFO - pass information that specifies the opt_pass object,
597 reference pass, instance number, and how to position
601 register_pass (struct register_pass_info *pass_info)
603 if (!pass_info->pass)
608 if (!pass_info->reference_pass_name)
613 /* Try to insert the new pass to the pass lists. We need to check all
614 three lists as the reference pass could be in one (or all) of them. */
615 if (!position_pass (pass_info, &all_lowering_passes)
616 && !position_pass (pass_info, &all_small_ipa_passes)
617 && !position_pass (pass_info, &all_regular_ipa_passes)
618 && !position_pass (pass_info, &all_lto_gen_passes)
619 && !position_pass (pass_info, &all_passes))
623 /* OK, we have successfully inserted the new pass. We need to register
624 the dump files for the newly added pass and its duplicates (if any).
625 Because the registration of plugin/backend passes happens after the
626 command-line options are parsed, the options that specify single
627 pass dumping (e.g. -fdump-tree-PASSNAME) cannot be used for new
628 passes. Therefore we currently can only enable dumping of
629 new passes when the 'dump-all' flags (e.g. -fdump-tree-all)
630 are specified. While doing so, we also delete the pass_list_node
631 objects created during pass positioning. */
632 while (added_pass_nodes)
634 struct pass_list_node *next_node = added_pass_nodes->next;
635 enum tree_dump_index tdi;
636 register_one_dump_file (added_pass_nodes->pass);
637 if (added_pass_nodes->pass->type == SIMPLE_IPA_PASS
638 || added_pass_nodes->pass->type == IPA_PASS)
640 else if (added_pass_nodes->pass->type == GIMPLE_PASS)
644 /* Check if dump-all flag is specified. */
645 if (get_dump_file_info (tdi)->state)
646 get_dump_file_info (added_pass_nodes->pass->static_pass_number)
647 ->state = get_dump_file_info (tdi)->state;
648 XDELETE (added_pass_nodes);
649 added_pass_nodes = next_node;
654 /* Construct the pass tree. The sequencing of passes is driven by
657 cgraph_finalize_compilation_unit ()
658 for each node N in the cgraph
659 cgraph_analyze_function (N)
660 cgraph_lower_function (N) -> all_lowering_passes
662 If we are optimizing, cgraph_optimize is then invoked:
665 ipa_passes () -> all_small_ipa_passes
666 cgraph_expand_all_functions ()
667 for each node N in the cgraph
668 cgraph_expand_function (N)
669 tree_rest_of_compilation (DECL (N)) -> all_passes
673 init_optimization_passes (void)
677 #define NEXT_PASS(PASS) (p = next_pass_1 (p, &((PASS).pass)))
679 /* All passes needed to lower the function into shape optimizers can
680 operate on. These passes are always run first on the function, but
681 backend might produce already lowered functions that are not processed
683 p = &all_lowering_passes;
684 NEXT_PASS (pass_warn_unused_result);
685 NEXT_PASS (pass_diagnose_omp_blocks);
686 NEXT_PASS (pass_mudflap_1);
687 NEXT_PASS (pass_lower_omp);
688 NEXT_PASS (pass_lower_cf);
689 NEXT_PASS (pass_refactor_eh);
690 NEXT_PASS (pass_lower_eh);
691 NEXT_PASS (pass_build_cfg);
692 NEXT_PASS (pass_lower_complex_O0);
693 NEXT_PASS (pass_lower_vector);
694 NEXT_PASS (pass_warn_function_return);
695 NEXT_PASS (pass_build_cgraph_edges);
696 NEXT_PASS (pass_inline_parameters);
699 /* Interprocedural optimization passes. */
700 p = &all_small_ipa_passes;
701 NEXT_PASS (pass_ipa_function_and_variable_visibility);
702 NEXT_PASS (pass_ipa_early_inline);
704 struct opt_pass **p = &pass_ipa_early_inline.pass.sub;
705 NEXT_PASS (pass_early_inline);
706 NEXT_PASS (pass_inline_parameters);
707 NEXT_PASS (pass_rebuild_cgraph_edges);
709 NEXT_PASS (pass_ipa_free_lang_data);
710 NEXT_PASS (pass_early_local_passes);
712 struct opt_pass **p = &pass_early_local_passes.pass.sub;
713 NEXT_PASS (pass_fixup_cfg);
714 NEXT_PASS (pass_tree_profile);
715 NEXT_PASS (pass_cleanup_cfg);
716 NEXT_PASS (pass_init_datastructures);
717 NEXT_PASS (pass_expand_omp);
719 NEXT_PASS (pass_referenced_vars);
720 NEXT_PASS (pass_build_ssa);
721 NEXT_PASS (pass_early_warn_uninitialized);
722 /* Note that it is not strictly necessary to schedule an early
723 inline pass here. However, some test cases (e.g.,
724 g++.dg/other/p334435.C g++.dg/other/i386-1.C) expect extern
725 inline functions to be inlined even at -O0. This does not
726 happen during the first early inline pass. */
727 NEXT_PASS (pass_rebuild_cgraph_edges);
728 NEXT_PASS (pass_early_inline);
729 NEXT_PASS (pass_all_early_optimizations);
731 struct opt_pass **p = &pass_all_early_optimizations.pass.sub;
732 NEXT_PASS (pass_remove_cgraph_callee_edges);
733 NEXT_PASS (pass_rename_ssa_copies);
734 NEXT_PASS (pass_ccp);
735 NEXT_PASS (pass_forwprop);
736 /* pass_build_ealias is a dummy pass that ensures that we
737 execute TODO_rebuild_alias at this point. Re-building
738 alias information also rewrites no longer addressed
739 locals into SSA form if possible. */
740 NEXT_PASS (pass_build_ealias);
741 NEXT_PASS (pass_sra_early);
742 NEXT_PASS (pass_copy_prop);
743 NEXT_PASS (pass_merge_phi);
744 NEXT_PASS (pass_cd_dce);
745 NEXT_PASS (pass_early_ipa_sra);
746 NEXT_PASS (pass_tail_recursion);
747 NEXT_PASS (pass_convert_switch);
748 NEXT_PASS (pass_cleanup_eh);
749 NEXT_PASS (pass_profile);
750 NEXT_PASS (pass_local_pure_const);
752 NEXT_PASS (pass_release_ssa_names);
753 NEXT_PASS (pass_rebuild_cgraph_edges);
754 NEXT_PASS (pass_inline_parameters);
756 NEXT_PASS (pass_ipa_increase_alignment);
757 NEXT_PASS (pass_ipa_matrix_reorg);
760 p = &all_regular_ipa_passes;
761 NEXT_PASS (pass_ipa_whole_program_visibility);
762 NEXT_PASS (pass_ipa_cp);
763 NEXT_PASS (pass_ipa_inline);
764 NEXT_PASS (pass_ipa_reference);
765 NEXT_PASS (pass_ipa_pure_const);
766 NEXT_PASS (pass_ipa_type_escape);
767 NEXT_PASS (pass_ipa_pta);
768 NEXT_PASS (pass_ipa_struct_reorg);
771 p = &all_lto_gen_passes;
772 NEXT_PASS (pass_ipa_lto_gimple_out);
773 NEXT_PASS (pass_ipa_lto_wpa_fixup);
774 NEXT_PASS (pass_ipa_lto_finish_out); /* This must be the last LTO pass. */
777 /* These passes are run after IPA passes on every function that is being
778 output to the assembler file. */
780 NEXT_PASS (pass_lower_eh_dispatch);
781 NEXT_PASS (pass_all_optimizations);
783 struct opt_pass **p = &pass_all_optimizations.pass.sub;
784 NEXT_PASS (pass_remove_cgraph_callee_edges);
785 /* Initial scalar cleanups before alias computation.
786 They ensure memory accesses are not indirect wherever possible. */
787 NEXT_PASS (pass_strip_predict_hints);
788 NEXT_PASS (pass_update_address_taken);
789 NEXT_PASS (pass_rename_ssa_copies);
790 NEXT_PASS (pass_complete_unrolli);
791 NEXT_PASS (pass_ccp);
792 NEXT_PASS (pass_forwprop);
793 NEXT_PASS (pass_call_cdce);
794 /* pass_build_alias is a dummy pass that ensures that we
795 execute TODO_rebuild_alias at this point. Re-building
796 alias information also rewrites no longer addressed
797 locals into SSA form if possible. */
798 NEXT_PASS (pass_build_alias);
799 NEXT_PASS (pass_return_slot);
800 NEXT_PASS (pass_phiprop);
801 NEXT_PASS (pass_fre);
802 NEXT_PASS (pass_copy_prop);
803 NEXT_PASS (pass_merge_phi);
804 NEXT_PASS (pass_vrp);
805 NEXT_PASS (pass_dce);
806 NEXT_PASS (pass_cselim);
807 NEXT_PASS (pass_tree_ifcombine);
808 NEXT_PASS (pass_phiopt);
809 NEXT_PASS (pass_tail_recursion);
811 NEXT_PASS (pass_stdarg);
812 NEXT_PASS (pass_lower_complex);
813 NEXT_PASS (pass_sra);
814 NEXT_PASS (pass_rename_ssa_copies);
815 /* The dom pass will also resolve all __builtin_constant_p calls
816 that are still there to 0. This has to be done after some
817 propagations have already run, but before some more dead code
818 is removed, and this place fits nicely. Remember this when
819 trying to move or duplicate pass_dominator somewhere earlier. */
820 NEXT_PASS (pass_dominator);
821 /* The only const/copy propagation opportunities left after
822 DOM should be due to degenerate PHI nodes. So rather than
823 run the full propagators, run a specialized pass which
824 only examines PHIs to discover const/copy propagation
826 NEXT_PASS (pass_phi_only_cprop);
827 NEXT_PASS (pass_dse);
828 NEXT_PASS (pass_reassoc);
829 NEXT_PASS (pass_dce);
830 NEXT_PASS (pass_forwprop);
831 NEXT_PASS (pass_phiopt);
832 NEXT_PASS (pass_object_sizes);
833 NEXT_PASS (pass_ccp);
834 NEXT_PASS (pass_copy_prop);
835 NEXT_PASS (pass_cse_sincos);
836 NEXT_PASS (pass_optimize_bswap);
837 NEXT_PASS (pass_split_crit_edges);
838 NEXT_PASS (pass_pre);
839 NEXT_PASS (pass_sink_code);
840 NEXT_PASS (pass_tree_loop);
842 struct opt_pass **p = &pass_tree_loop.pass.sub;
843 NEXT_PASS (pass_tree_loop_init);
844 NEXT_PASS (pass_copy_prop);
845 NEXT_PASS (pass_dce_loop);
846 NEXT_PASS (pass_lim);
847 NEXT_PASS (pass_tree_unswitch);
848 NEXT_PASS (pass_scev_cprop);
849 NEXT_PASS (pass_record_bounds);
850 NEXT_PASS (pass_check_data_deps);
851 NEXT_PASS (pass_loop_distribution);
852 NEXT_PASS (pass_linear_transform);
853 NEXT_PASS (pass_graphite_transforms);
855 struct opt_pass **p = &pass_graphite_transforms.pass.sub;
856 NEXT_PASS (pass_dce_loop);
857 NEXT_PASS (pass_lim);
859 NEXT_PASS (pass_iv_canon);
860 NEXT_PASS (pass_if_conversion);
861 NEXT_PASS (pass_vectorize);
863 struct opt_pass **p = &pass_vectorize.pass.sub;
864 NEXT_PASS (pass_lower_vector_ssa);
865 NEXT_PASS (pass_dce_loop);
867 NEXT_PASS (pass_predcom);
868 NEXT_PASS (pass_complete_unroll);
869 NEXT_PASS (pass_slp_vectorize);
870 NEXT_PASS (pass_parallelize_loops);
871 NEXT_PASS (pass_loop_prefetch);
872 NEXT_PASS (pass_iv_optimize);
873 NEXT_PASS (pass_tree_loop_done);
875 NEXT_PASS (pass_cse_reciprocals);
876 NEXT_PASS (pass_convert_to_rsqrt);
877 NEXT_PASS (pass_reassoc);
878 NEXT_PASS (pass_vrp);
879 NEXT_PASS (pass_dominator);
880 /* The only const/copy propagation opportunities left after
881 DOM should be due to degenerate PHI nodes. So rather than
882 run the full propagators, run a specialized pass which
883 only examines PHIs to discover const/copy propagation
885 NEXT_PASS (pass_phi_only_cprop);
886 NEXT_PASS (pass_cd_dce);
887 NEXT_PASS (pass_tracer);
889 /* FIXME: If DCE is not run before checking for uninitialized uses,
890 we may get false warnings (e.g., testsuite/gcc.dg/uninit-5.c).
891 However, this also causes us to misdiagnose cases that should be
892 real warnings (e.g., testsuite/gcc.dg/pr18501.c).
894 To fix the false positives in uninit-5.c, we would have to
895 account for the predicates protecting the set and the use of each
896 variable. Using a representation like Gated Single Assignment
898 NEXT_PASS (pass_late_warn_uninitialized);
899 NEXT_PASS (pass_dse);
900 NEXT_PASS (pass_forwprop);
901 NEXT_PASS (pass_phiopt);
902 NEXT_PASS (pass_fold_builtins);
903 NEXT_PASS (pass_tail_calls);
904 NEXT_PASS (pass_rename_ssa_copies);
905 NEXT_PASS (pass_uncprop);
906 NEXT_PASS (pass_local_pure_const);
908 NEXT_PASS (pass_cleanup_eh);
909 NEXT_PASS (pass_lower_resx);
910 NEXT_PASS (pass_nrv);
911 NEXT_PASS (pass_mudflap_2);
912 NEXT_PASS (pass_cleanup_cfg_post_optimizing);
913 NEXT_PASS (pass_warn_function_noreturn);
915 NEXT_PASS (pass_expand);
917 NEXT_PASS (pass_rest_of_compilation);
919 struct opt_pass **p = &pass_rest_of_compilation.pass.sub;
920 NEXT_PASS (pass_init_function);
921 NEXT_PASS (pass_jump);
922 NEXT_PASS (pass_rtl_eh);
923 NEXT_PASS (pass_initial_value_sets);
924 NEXT_PASS (pass_unshare_all_rtl);
925 NEXT_PASS (pass_instantiate_virtual_regs);
926 NEXT_PASS (pass_into_cfg_layout_mode);
927 NEXT_PASS (pass_jump2);
928 NEXT_PASS (pass_lower_subreg);
929 NEXT_PASS (pass_df_initialize_opt);
930 NEXT_PASS (pass_cse);
931 NEXT_PASS (pass_rtl_fwprop);
932 NEXT_PASS (pass_rtl_cprop);
933 NEXT_PASS (pass_rtl_pre);
934 NEXT_PASS (pass_rtl_hoist);
935 NEXT_PASS (pass_rtl_cprop);
936 NEXT_PASS (pass_rtl_store_motion);
937 NEXT_PASS (pass_cse_after_global_opts);
938 NEXT_PASS (pass_rtl_ifcvt);
939 /* Perform loop optimizations. It might be better to do them a bit
940 sooner, but we want the profile feedback to work more
942 NEXT_PASS (pass_loop2);
944 struct opt_pass **p = &pass_loop2.pass.sub;
945 NEXT_PASS (pass_rtl_loop_init);
946 NEXT_PASS (pass_rtl_move_loop_invariants);
947 NEXT_PASS (pass_rtl_unswitch);
948 NEXT_PASS (pass_rtl_unroll_and_peel_loops);
949 NEXT_PASS (pass_rtl_doloop);
950 NEXT_PASS (pass_rtl_loop_done);
953 NEXT_PASS (pass_web);
954 NEXT_PASS (pass_rtl_cprop);
955 NEXT_PASS (pass_cse2);
956 NEXT_PASS (pass_rtl_dse1);
957 NEXT_PASS (pass_rtl_fwprop_addr);
958 NEXT_PASS (pass_reginfo_init);
959 NEXT_PASS (pass_inc_dec);
960 NEXT_PASS (pass_initialize_regs);
961 NEXT_PASS (pass_ud_rtl_dce);
962 NEXT_PASS (pass_combine);
963 NEXT_PASS (pass_if_after_combine);
964 NEXT_PASS (pass_partition_blocks);
965 NEXT_PASS (pass_regmove);
966 NEXT_PASS (pass_outof_cfg_layout_mode);
967 NEXT_PASS (pass_split_all_insns);
968 NEXT_PASS (pass_lower_subreg2);
969 NEXT_PASS (pass_df_initialize_no_opt);
970 NEXT_PASS (pass_stack_ptr_mod);
971 NEXT_PASS (pass_mode_switching);
972 NEXT_PASS (pass_match_asm_constraints);
973 NEXT_PASS (pass_sms);
974 NEXT_PASS (pass_subregs_of_mode_init);
975 NEXT_PASS (pass_sched);
976 NEXT_PASS (pass_ira);
977 NEXT_PASS (pass_subregs_of_mode_finish);
978 NEXT_PASS (pass_postreload);
980 struct opt_pass **p = &pass_postreload.pass.sub;
981 NEXT_PASS (pass_postreload_cse);
982 NEXT_PASS (pass_gcse2);
983 NEXT_PASS (pass_split_after_reload);
984 NEXT_PASS (pass_branch_target_load_optimize1);
985 NEXT_PASS (pass_thread_prologue_and_epilogue);
986 NEXT_PASS (pass_rtl_dse2);
987 NEXT_PASS (pass_stack_adjustments);
988 NEXT_PASS (pass_peephole2);
989 NEXT_PASS (pass_if_after_reload);
990 NEXT_PASS (pass_regrename);
991 NEXT_PASS (pass_cprop_hardreg);
992 NEXT_PASS (pass_fast_rtl_dce);
993 NEXT_PASS (pass_reorder_blocks);
994 NEXT_PASS (pass_branch_target_load_optimize2);
995 NEXT_PASS (pass_leaf_regs);
996 NEXT_PASS (pass_split_before_sched2);
997 NEXT_PASS (pass_sched2);
998 NEXT_PASS (pass_stack_regs);
1000 struct opt_pass **p = &pass_stack_regs.pass.sub;
1001 NEXT_PASS (pass_split_before_regstack);
1002 NEXT_PASS (pass_stack_regs_run);
1004 NEXT_PASS (pass_compute_alignments);
1005 NEXT_PASS (pass_duplicate_computed_gotos);
1006 NEXT_PASS (pass_variable_tracking);
1007 NEXT_PASS (pass_free_cfg);
1008 NEXT_PASS (pass_machine_reorg);
1009 NEXT_PASS (pass_cleanup_barriers);
1010 NEXT_PASS (pass_delay_slots);
1011 NEXT_PASS (pass_split_for_shorten_branches);
1012 NEXT_PASS (pass_convert_to_eh_region_ranges);
1013 NEXT_PASS (pass_shorten_branches);
1014 NEXT_PASS (pass_set_nothrow_function_flags);
1015 NEXT_PASS (pass_final);
1017 NEXT_PASS (pass_df_finish);
1019 NEXT_PASS (pass_clean_state);
1024 /* Register the passes with the tree dump code. */
1025 register_dump_files (all_lowering_passes, PROP_gimple_any);
1026 register_dump_files (all_small_ipa_passes,
1027 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1029 register_dump_files (all_regular_ipa_passes,
1030 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1032 register_dump_files (all_lto_gen_passes,
1033 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1035 register_dump_files (all_passes,
1036 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1040 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
1041 function CALLBACK for every function in the call graph. Otherwise,
1042 call CALLBACK on the current function. */
1045 do_per_function (void (*callback) (void *data), void *data)
1047 if (current_function_decl)
1051 struct cgraph_node *node;
1052 for (node = cgraph_nodes; node; node = node->next)
1053 if (node->analyzed && gimple_has_body_p (node->decl)
1054 && (!node->clone_of || node->decl != node->clone_of->decl))
1056 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
1057 current_function_decl = node->decl;
1061 free_dominance_info (CDI_DOMINATORS);
1062 free_dominance_info (CDI_POST_DOMINATORS);
1064 current_function_decl = NULL;
1071 /* Because inlining might remove no-longer reachable nodes, we need to
1072 keep the array visible to garbage collector to avoid reading collected
1075 static GTY ((length ("nnodes"))) struct cgraph_node **order;
1077 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
1078 function CALLBACK for every function in the call graph. Otherwise,
1079 call CALLBACK on the current function. */
1082 do_per_function_toporder (void (*callback) (void *data), void *data)
1086 if (current_function_decl)
1090 gcc_assert (!order);
1091 order = GGC_NEWVEC (struct cgraph_node *, cgraph_n_nodes);
1092 nnodes = cgraph_postorder (order);
1093 for (i = nnodes - 1; i >= 0; i--)
1094 order[i]->process = 1;
1095 for (i = nnodes - 1; i >= 0; i--)
1097 struct cgraph_node *node = order[i];
1099 /* Allow possibly removed nodes to be garbage collected. */
1104 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
1105 current_function_decl = node->decl;
1107 free_dominance_info (CDI_DOMINATORS);
1108 free_dominance_info (CDI_POST_DOMINATORS);
1109 current_function_decl = NULL;
1120 /* Perform all TODO actions that ought to be done on each function. */
1123 execute_function_todo (void *data)
1125 unsigned int flags = (size_t)data;
1126 if (cfun->curr_properties & PROP_ssa)
1127 flags |= TODO_verify_ssa;
1128 flags &= ~cfun->last_verified;
1132 statistics_fini_pass ();
1134 /* Always cleanup the CFG before trying to update SSA. */
1135 if (flags & TODO_cleanup_cfg)
1137 bool cleanup = cleanup_tree_cfg ();
1139 if (cleanup && (cfun->curr_properties & PROP_ssa))
1140 flags |= TODO_remove_unused_locals;
1142 /* When cleanup_tree_cfg merges consecutive blocks, it may
1143 perform some simplistic propagation when removing single
1144 valued PHI nodes. This propagation may, in turn, cause the
1145 SSA form to become out-of-date (see PR 22037). So, even
1146 if the parent pass had not scheduled an SSA update, we may
1147 still need to do one. */
1148 if (!(flags & TODO_update_ssa_any) && need_ssa_update_p (cfun))
1149 flags |= TODO_update_ssa;
1152 if (flags & TODO_update_ssa_any)
1154 unsigned update_flags = flags & TODO_update_ssa_any;
1155 update_ssa (update_flags);
1156 cfun->last_verified &= ~TODO_verify_ssa;
1159 if (flags & TODO_update_address_taken)
1160 execute_update_addresses_taken (true);
1162 if (flags & TODO_rebuild_alias)
1164 if (!(flags & TODO_update_address_taken))
1165 execute_update_addresses_taken (true);
1166 compute_may_aliases ();
1169 if (flags & TODO_remove_unused_locals)
1170 remove_unused_locals ();
1172 if ((flags & TODO_dump_func) && dump_file && current_function_decl)
1174 if (cfun->curr_properties & PROP_trees)
1175 dump_function_to_file (current_function_decl, dump_file, dump_flags);
1178 if (dump_flags & TDF_SLIM)
1179 print_rtl_slim_with_bb (dump_file, get_insns (), dump_flags);
1180 else if ((cfun->curr_properties & PROP_cfg)
1181 && (dump_flags & TDF_BLOCKS))
1182 print_rtl_with_bb (dump_file, get_insns ());
1184 print_rtl (dump_file, get_insns ());
1186 if ((cfun->curr_properties & PROP_cfg)
1187 && graph_dump_format != no_graph
1188 && (dump_flags & TDF_GRAPH))
1189 print_rtl_graph_with_bb (dump_file_name, get_insns ());
1192 /* Flush the file. If verification fails, we won't be able to
1193 close the file before aborting. */
1197 if (flags & TODO_rebuild_frequencies)
1199 if (profile_status == PROFILE_GUESSED)
1201 loop_optimizer_init (0);
1202 add_noreturn_fake_exit_edges ();
1203 mark_irreducible_loops ();
1204 connect_infinite_loops_to_exit ();
1205 estimate_bb_frequencies ();
1206 remove_fake_exit_edges ();
1207 loop_optimizer_finalize ();
1209 else if (profile_status == PROFILE_READ)
1215 #if defined ENABLE_CHECKING
1216 if (flags & TODO_verify_ssa)
1218 if (flags & TODO_verify_flow)
1219 verify_flow_info ();
1220 if (flags & TODO_verify_stmts)
1222 if (flags & TODO_verify_loops)
1223 verify_loop_closed_ssa ();
1224 if (flags & TODO_verify_rtl_sharing)
1225 verify_rtl_sharing ();
1228 cfun->last_verified = flags & TODO_verify_all;
1231 /* Perform all TODO actions. */
1233 execute_todo (unsigned int flags)
1235 #if defined ENABLE_CHECKING
1237 && need_ssa_update_p (cfun))
1238 gcc_assert (flags & TODO_update_ssa_any);
1241 /* Inform the pass whether it is the first time it is run. */
1242 first_pass_instance = (flags & TODO_mark_first_instance) != 0;
1244 do_per_function (execute_function_todo, (void *)(size_t) flags);
1246 /* Always remove functions just as before inlining: IPA passes might be
1247 interested to see bodies of extern inline functions that are not inlined
1248 to analyze side effects. The full removal is done just at the end
1249 of IPA pass queue. */
1250 if (flags & TODO_remove_functions)
1253 cgraph_remove_unreachable_nodes (true, dump_file);
1256 if ((flags & TODO_dump_cgraph) && dump_file && !current_function_decl)
1259 dump_cgraph (dump_file);
1260 /* Flush the file. If verification fails, we won't be able to
1261 close the file before aborting. */
1265 if (flags & TODO_ggc_collect)
1268 /* Now that the dumping has been done, we can get rid of the optional
1270 if (flags & TODO_df_finish)
1271 df_finish_pass ((flags & TODO_df_verify) != 0);
1274 /* Verify invariants that should hold between passes. This is a place
1275 to put simple sanity checks. */
1278 verify_interpass_invariants (void)
1280 #ifdef ENABLE_CHECKING
1281 gcc_assert (!fold_deferring_overflow_warnings_p ());
1285 /* Clear the last verified flag. */
1288 clear_last_verified (void *data ATTRIBUTE_UNUSED)
1290 cfun->last_verified = 0;
1293 /* Helper function. Verify that the properties has been turn into the
1294 properties expected by the pass. */
1296 #ifdef ENABLE_CHECKING
1298 verify_curr_properties (void *data)
1300 unsigned int props = (size_t)data;
1301 gcc_assert ((cfun->curr_properties & props) == props);
1305 /* Initialize pass dump file. */
1308 pass_init_dump_file (struct opt_pass *pass)
1310 /* If a dump file name is present, open it if enabled. */
1311 if (pass->static_pass_number != -1)
1313 bool initializing_dump = !dump_initialized_p (pass->static_pass_number);
1314 dump_file_name = get_dump_file_name (pass->static_pass_number);
1315 dump_file = dump_begin (pass->static_pass_number, &dump_flags);
1316 if (dump_file && current_function_decl)
1318 const char *dname, *aname;
1319 dname = lang_hooks.decl_printable_name (current_function_decl, 2);
1320 aname = (IDENTIFIER_POINTER
1321 (DECL_ASSEMBLER_NAME (current_function_decl)));
1322 fprintf (dump_file, "\n;; Function %s (%s)%s\n\n", dname, aname,
1323 cfun->function_frequency == FUNCTION_FREQUENCY_HOT
1325 : cfun->function_frequency == FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
1326 ? " (unlikely executed)"
1329 return initializing_dump;
1335 /* Flush PASS dump file. */
1338 pass_fini_dump_file (struct opt_pass *pass)
1340 /* Flush and close dump file. */
1343 free (CONST_CAST (char *, dump_file_name));
1344 dump_file_name = NULL;
1349 dump_end (pass->static_pass_number, dump_file);
1354 /* After executing the pass, apply expected changes to the function
1358 update_properties_after_pass (void *data)
1360 struct opt_pass *pass = (struct opt_pass *) data;
1361 cfun->curr_properties = (cfun->curr_properties | pass->properties_provided)
1362 & ~pass->properties_destroyed;
1365 /* Schedule IPA transform pass DATA for CFUN. */
1368 add_ipa_transform_pass (void *data)
1370 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *) data;
1371 VEC_safe_push (ipa_opt_pass, heap, cfun->ipa_transforms_to_apply, ipa_pass);
1374 /* Execute summary generation for all of the passes in IPA_PASS. */
1377 execute_ipa_summary_passes (struct ipa_opt_pass_d *ipa_pass)
1381 struct opt_pass *pass = &ipa_pass->pass;
1383 /* Execute all of the IPA_PASSes in the list. */
1384 if (ipa_pass->pass.type == IPA_PASS
1385 && (!pass->gate || pass->gate ())
1386 && ipa_pass->generate_summary)
1388 pass_init_dump_file (pass);
1390 /* If a timevar is present, start it. */
1392 timevar_push (pass->tv_id);
1394 ipa_pass->generate_summary ();
1398 timevar_pop (pass->tv_id);
1400 pass_fini_dump_file (pass);
1402 ipa_pass = (struct ipa_opt_pass_d *)ipa_pass->pass.next;
1406 /* Execute IPA_PASS function transform on NODE. */
1409 execute_one_ipa_transform_pass (struct cgraph_node *node,
1410 struct ipa_opt_pass_d *ipa_pass)
1412 struct opt_pass *pass = &ipa_pass->pass;
1413 unsigned int todo_after = 0;
1415 current_pass = pass;
1416 if (!ipa_pass->function_transform)
1419 /* Note that the folders should only create gimple expressions.
1420 This is a hack until the new folder is ready. */
1421 in_gimple_form = (cfun && (cfun->curr_properties & PROP_trees)) != 0;
1423 pass_init_dump_file (pass);
1425 /* Run pre-pass verification. */
1426 execute_todo (ipa_pass->function_transform_todo_flags_start);
1428 /* If a timevar is present, start it. */
1429 if (pass->tv_id != TV_NONE)
1430 timevar_push (pass->tv_id);
1433 todo_after = ipa_pass->function_transform (node);
1436 if (pass->tv_id != TV_NONE)
1437 timevar_pop (pass->tv_id);
1439 /* Run post-pass cleanup and verification. */
1440 execute_todo (todo_after);
1441 verify_interpass_invariants ();
1443 pass_fini_dump_file (pass);
1445 current_pass = NULL;
1448 /* For the current function, execute all ipa transforms. */
1451 execute_all_ipa_transforms (void)
1453 if (cfun && cfun->ipa_transforms_to_apply)
1456 struct cgraph_node *node = cgraph_node (current_function_decl);
1458 for (i = 0; i < VEC_length (ipa_opt_pass, cfun->ipa_transforms_to_apply);
1460 execute_one_ipa_transform_pass (node,
1461 VEC_index (ipa_opt_pass,
1462 cfun->ipa_transforms_to_apply,
1464 VEC_free (ipa_opt_pass, heap, cfun->ipa_transforms_to_apply);
1465 cfun->ipa_transforms_to_apply = NULL;
1472 execute_one_pass (struct opt_pass *pass)
1474 bool initializing_dump;
1475 unsigned int todo_after = 0;
1477 /* IPA passes are executed on whole program, so cfun should be NULL.
1478 Other passes need function context set. */
1479 if (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS)
1480 gcc_assert (!cfun && !current_function_decl);
1482 gcc_assert (cfun && current_function_decl);
1484 current_pass = pass;
1486 /* See if we're supposed to run this pass. */
1487 if (pass->gate && !pass->gate ())
1490 if (!quiet_flag && !cfun)
1491 fprintf (stderr, " <%s>", pass->name ? pass->name : "");
1493 /* Note that the folders should only create gimple expressions.
1494 This is a hack until the new folder is ready. */
1495 in_gimple_form = (cfun && (cfun->curr_properties & PROP_trees)) != 0;
1497 initializing_dump = pass_init_dump_file (pass);
1499 /* Run pre-pass verification. */
1500 execute_todo (pass->todo_flags_start);
1502 #ifdef ENABLE_CHECKING
1503 do_per_function (verify_curr_properties,
1504 (void *)(size_t)pass->properties_required);
1507 /* If a timevar is present, start it. */
1508 if (pass->tv_id != TV_NONE)
1509 timevar_push (pass->tv_id);
1514 todo_after = pass->execute ();
1515 do_per_function (clear_last_verified, NULL);
1519 if (pass->tv_id != TV_NONE)
1520 timevar_pop (pass->tv_id);
1522 do_per_function (update_properties_after_pass, pass);
1524 if (initializing_dump
1526 && graph_dump_format != no_graph
1528 && (cfun->curr_properties & (PROP_cfg | PROP_rtl))
1529 == (PROP_cfg | PROP_rtl))
1531 get_dump_file_info (pass->static_pass_number)->flags |= TDF_GRAPH;
1532 dump_flags |= TDF_GRAPH;
1533 clean_graph_dump_file (dump_file_name);
1536 /* Run post-pass cleanup and verification. */
1537 execute_todo (todo_after | pass->todo_flags_finish);
1538 verify_interpass_invariants ();
1539 if (pass->type == IPA_PASS)
1540 do_per_function (add_ipa_transform_pass, pass);
1542 if (!current_function_decl)
1543 cgraph_process_new_functions ();
1545 pass_fini_dump_file (pass);
1547 if (pass->type != SIMPLE_IPA_PASS && pass->type != IPA_PASS)
1548 gcc_assert (!(cfun->curr_properties & PROP_trees)
1549 || pass->type != RTL_PASS);
1551 current_pass = NULL;
1557 execute_pass_list (struct opt_pass *pass)
1561 gcc_assert (pass->type == GIMPLE_PASS
1562 || pass->type == RTL_PASS);
1563 if (execute_one_pass (pass) && pass->sub)
1564 execute_pass_list (pass->sub);
1570 /* Same as execute_pass_list but assume that subpasses of IPA passes
1571 are local passes. If SET is not NULL, write out summaries of only
1572 those node in SET. */
1575 ipa_write_summaries_2 (struct opt_pass *pass, cgraph_node_set set,
1576 struct lto_out_decl_state *state)
1580 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *)pass;
1581 gcc_assert (!current_function_decl);
1583 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
1584 if (pass->type == IPA_PASS
1585 && ipa_pass->write_summary
1586 && (!pass->gate || pass->gate ()))
1588 /* If a timevar is present, start it. */
1590 timevar_push (pass->tv_id);
1592 ipa_pass->write_summary (set);
1594 /* If a timevar is present, start it. */
1596 timevar_pop (pass->tv_id);
1599 if (pass->sub && pass->sub->type != GIMPLE_PASS)
1600 ipa_write_summaries_2 (pass->sub, set, state);
1606 /* Helper function of ipa_write_summaries. Creates and destroys the
1607 decl state and calls ipa_write_summaries_2 for all passes that have
1608 summaries. SET is the set of nodes to be written. */
1611 ipa_write_summaries_1 (cgraph_node_set set)
1613 struct lto_out_decl_state *state = lto_new_out_decl_state ();
1614 lto_push_out_decl_state (state);
1616 ipa_write_summaries_2 (all_regular_ipa_passes, set, state);
1617 ipa_write_summaries_2 (all_lto_gen_passes, set, state);
1619 gcc_assert (lto_get_out_decl_state () == state);
1620 lto_pop_out_decl_state ();
1621 lto_delete_out_decl_state (state);
1624 /* Write out summaries for all the nodes in the callgraph. */
1627 ipa_write_summaries (void)
1629 cgraph_node_set set;
1630 struct cgraph_node **order;
1633 if (!flag_generate_lto || errorcount || sorrycount)
1636 lto_new_extern_inline_states ();
1637 set = cgraph_node_set_new ();
1639 /* Create the callgraph set in the same order used in
1640 cgraph_expand_all_functions. This mostly facilitates debugging,
1641 since it causes the gimple file to be processed in the same order
1642 as the source code. */
1643 order = XCNEWVEC (struct cgraph_node *, cgraph_n_nodes);
1644 order_pos = cgraph_postorder (order);
1645 gcc_assert (order_pos == cgraph_n_nodes);
1647 for (i = order_pos - 1; i >= 0; i--)
1648 cgraph_node_set_add (set, order[i]);
1650 ipa_write_summaries_1 (set);
1651 lto_delete_extern_inline_states ();
1658 /* Write all the summaries for the cgraph nodes in SET. If SET is
1659 NULL, write out all summaries of all nodes. */
1662 ipa_write_summaries_of_cgraph_node_set (cgraph_node_set set)
1664 if (flag_generate_lto && !(errorcount || sorrycount))
1665 ipa_write_summaries_1 (set);
1668 /* Same as execute_pass_list but assume that subpasses of IPA passes
1669 are local passes. */
1672 ipa_read_summaries_1 (struct opt_pass *pass)
1676 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *) pass;
1678 gcc_assert (!current_function_decl);
1680 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
1682 if (pass->gate == NULL || pass->gate ())
1684 if (pass->type == IPA_PASS && ipa_pass->read_summary)
1686 /* If a timevar is present, start it. */
1688 timevar_push (pass->tv_id);
1690 ipa_pass->read_summary ();
1694 timevar_pop (pass->tv_id);
1697 if (pass->sub && pass->sub->type != GIMPLE_PASS)
1698 ipa_read_summaries_1 (pass->sub);
1705 /* Read all the summaries for all_regular_ipa_passes and all_lto_gen_passes. */
1708 ipa_read_summaries (void)
1710 ipa_read_summaries_1 (all_regular_ipa_passes);
1711 ipa_read_summaries_1 (all_lto_gen_passes);
1714 /* Same as execute_pass_list but assume that subpasses of IPA passes
1715 are local passes. */
1717 execute_ipa_pass_list (struct opt_pass *pass)
1721 gcc_assert (!current_function_decl);
1723 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
1724 if (execute_one_pass (pass) && pass->sub)
1726 if (pass->sub->type == GIMPLE_PASS)
1727 do_per_function_toporder ((void (*)(void *))execute_pass_list,
1729 else if (pass->sub->type == SIMPLE_IPA_PASS
1730 || pass->sub->type == IPA_PASS)
1731 execute_ipa_pass_list (pass->sub);
1735 gcc_assert (!current_function_decl);
1736 cgraph_process_new_functions ();
1742 extern void debug_properties (unsigned int);
1743 extern void dump_properties (FILE *, unsigned int);
1746 dump_properties (FILE *dump, unsigned int props)
1748 fprintf (dump, "Properties:\n");
1749 if (props & PROP_gimple_any)
1750 fprintf (dump, "PROP_gimple_any\n");
1751 if (props & PROP_gimple_lcf)
1752 fprintf (dump, "PROP_gimple_lcf\n");
1753 if (props & PROP_gimple_leh)
1754 fprintf (dump, "PROP_gimple_leh\n");
1755 if (props & PROP_cfg)
1756 fprintf (dump, "PROP_cfg\n");
1757 if (props & PROP_referenced_vars)
1758 fprintf (dump, "PROP_referenced_vars\n");
1759 if (props & PROP_ssa)
1760 fprintf (dump, "PROP_ssa\n");
1761 if (props & PROP_no_crit_edges)
1762 fprintf (dump, "PROP_no_crit_edges\n");
1763 if (props & PROP_rtl)
1764 fprintf (dump, "PROP_rtl\n");
1765 if (props & PROP_gimple_lomp)
1766 fprintf (dump, "PROP_gimple_lomp\n");
1770 debug_properties (unsigned int props)
1772 dump_properties (stderr, props);
1775 /* Called by local passes to see if function is called by already processed nodes.
1776 Because we process nodes in topological order, this means that function is
1777 in recursive cycle or we introduced new direct calls. */
1779 function_called_by_processed_nodes_p (void)
1781 struct cgraph_edge *e;
1782 for (e = cgraph_node (current_function_decl)->callers; e; e = e->next_caller)
1784 if (e->caller->decl == current_function_decl)
1786 if (!e->caller->analyzed)
1788 if (TREE_ASM_WRITTEN (e->caller->decl))
1790 if (!e->caller->process && !e->caller->global.inlined_to)
1795 fprintf (dump_file, "Already processed call to:\n");
1796 dump_cgraph_node (dump_file, e->caller);
1801 #include "gt-passes.h"