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 /* The checks below could fail in buggy plugins. Existing GCC
604 passes should never fail these checks, so we mention plugin in
606 if (!pass_info->pass)
607 fatal_error ("plugin cannot register a missing pass");
609 if (!pass_info->pass->name)
610 fatal_error ("plugin cannot register an unnamed pass");
612 if (!pass_info->reference_pass_name)
614 ("plugin cannot register pass %qs without reference pass name",
615 pass_info->pass->name);
617 /* Try to insert the new pass to the pass lists. We need to check
618 all three lists as the reference pass could be in one (or all) of
620 if (!position_pass (pass_info, &all_lowering_passes)
621 && !position_pass (pass_info, &all_small_ipa_passes)
622 && !position_pass (pass_info, &all_regular_ipa_passes)
623 && !position_pass (pass_info, &all_lto_gen_passes)
624 && !position_pass (pass_info, &all_passes))
626 ("pass %qs not found but is referenced by new pass %qs",
627 pass_info->reference_pass_name, pass_info->pass->name);
630 /* OK, we have successfully inserted the new pass. We need to register
631 the dump files for the newly added pass and its duplicates (if any).
632 Because the registration of plugin/backend passes happens after the
633 command-line options are parsed, the options that specify single
634 pass dumping (e.g. -fdump-tree-PASSNAME) cannot be used for new
635 passes. Therefore we currently can only enable dumping of
636 new passes when the 'dump-all' flags (e.g. -fdump-tree-all)
637 are specified. While doing so, we also delete the pass_list_node
638 objects created during pass positioning. */
639 while (added_pass_nodes)
641 struct pass_list_node *next_node = added_pass_nodes->next;
642 enum tree_dump_index tdi;
643 register_one_dump_file (added_pass_nodes->pass);
644 if (added_pass_nodes->pass->type == SIMPLE_IPA_PASS
645 || added_pass_nodes->pass->type == IPA_PASS)
647 else if (added_pass_nodes->pass->type == GIMPLE_PASS)
651 /* Check if dump-all flag is specified. */
652 if (get_dump_file_info (tdi)->state)
653 get_dump_file_info (added_pass_nodes->pass->static_pass_number)
654 ->state = get_dump_file_info (tdi)->state;
655 XDELETE (added_pass_nodes);
656 added_pass_nodes = next_node;
661 /* Construct the pass tree. The sequencing of passes is driven by
664 cgraph_finalize_compilation_unit ()
665 for each node N in the cgraph
666 cgraph_analyze_function (N)
667 cgraph_lower_function (N) -> all_lowering_passes
669 If we are optimizing, cgraph_optimize is then invoked:
672 ipa_passes () -> all_small_ipa_passes
673 cgraph_expand_all_functions ()
674 for each node N in the cgraph
675 cgraph_expand_function (N)
676 tree_rest_of_compilation (DECL (N)) -> all_passes
680 init_optimization_passes (void)
684 #define NEXT_PASS(PASS) (p = next_pass_1 (p, &((PASS).pass)))
686 /* All passes needed to lower the function into shape optimizers can
687 operate on. These passes are always run first on the function, but
688 backend might produce already lowered functions that are not processed
690 p = &all_lowering_passes;
691 NEXT_PASS (pass_warn_unused_result);
692 NEXT_PASS (pass_diagnose_omp_blocks);
693 NEXT_PASS (pass_mudflap_1);
694 NEXT_PASS (pass_lower_omp);
695 NEXT_PASS (pass_lower_cf);
696 NEXT_PASS (pass_refactor_eh);
697 NEXT_PASS (pass_lower_eh);
698 NEXT_PASS (pass_build_cfg);
699 NEXT_PASS (pass_lower_complex_O0);
700 NEXT_PASS (pass_lower_vector);
701 NEXT_PASS (pass_warn_function_return);
702 NEXT_PASS (pass_build_cgraph_edges);
703 NEXT_PASS (pass_inline_parameters);
706 /* Interprocedural optimization passes. */
707 p = &all_small_ipa_passes;
708 NEXT_PASS (pass_ipa_function_and_variable_visibility);
709 NEXT_PASS (pass_ipa_early_inline);
711 struct opt_pass **p = &pass_ipa_early_inline.pass.sub;
712 NEXT_PASS (pass_early_inline);
713 NEXT_PASS (pass_inline_parameters);
714 NEXT_PASS (pass_rebuild_cgraph_edges);
716 NEXT_PASS (pass_ipa_free_lang_data);
717 NEXT_PASS (pass_early_local_passes);
719 struct opt_pass **p = &pass_early_local_passes.pass.sub;
720 NEXT_PASS (pass_fixup_cfg);
721 NEXT_PASS (pass_tree_profile);
722 NEXT_PASS (pass_cleanup_cfg);
723 NEXT_PASS (pass_init_datastructures);
724 NEXT_PASS (pass_expand_omp);
726 NEXT_PASS (pass_referenced_vars);
727 NEXT_PASS (pass_build_ssa);
728 NEXT_PASS (pass_early_warn_uninitialized);
729 /* Note that it is not strictly necessary to schedule an early
730 inline pass here. However, some test cases (e.g.,
731 g++.dg/other/p334435.C g++.dg/other/i386-1.C) expect extern
732 inline functions to be inlined even at -O0. This does not
733 happen during the first early inline pass. */
734 NEXT_PASS (pass_rebuild_cgraph_edges);
735 NEXT_PASS (pass_early_inline);
736 NEXT_PASS (pass_all_early_optimizations);
738 struct opt_pass **p = &pass_all_early_optimizations.pass.sub;
739 NEXT_PASS (pass_remove_cgraph_callee_edges);
740 NEXT_PASS (pass_rename_ssa_copies);
741 NEXT_PASS (pass_ccp);
742 NEXT_PASS (pass_forwprop);
743 /* pass_build_ealias is a dummy pass that ensures that we
744 execute TODO_rebuild_alias at this point. Re-building
745 alias information also rewrites no longer addressed
746 locals into SSA form if possible. */
747 NEXT_PASS (pass_build_ealias);
748 NEXT_PASS (pass_sra_early);
749 NEXT_PASS (pass_copy_prop);
750 NEXT_PASS (pass_merge_phi);
751 NEXT_PASS (pass_cd_dce);
752 NEXT_PASS (pass_early_ipa_sra);
753 NEXT_PASS (pass_tail_recursion);
754 NEXT_PASS (pass_convert_switch);
755 NEXT_PASS (pass_cleanup_eh);
756 NEXT_PASS (pass_profile);
757 NEXT_PASS (pass_local_pure_const);
759 NEXT_PASS (pass_release_ssa_names);
760 NEXT_PASS (pass_rebuild_cgraph_edges);
761 NEXT_PASS (pass_inline_parameters);
763 NEXT_PASS (pass_ipa_increase_alignment);
764 NEXT_PASS (pass_ipa_matrix_reorg);
767 p = &all_regular_ipa_passes;
768 NEXT_PASS (pass_ipa_whole_program_visibility);
769 NEXT_PASS (pass_ipa_cp);
770 NEXT_PASS (pass_ipa_inline);
771 NEXT_PASS (pass_ipa_reference);
772 NEXT_PASS (pass_ipa_pure_const);
773 NEXT_PASS (pass_ipa_type_escape);
774 NEXT_PASS (pass_ipa_pta);
775 NEXT_PASS (pass_ipa_struct_reorg);
778 p = &all_lto_gen_passes;
779 NEXT_PASS (pass_ipa_lto_gimple_out);
780 NEXT_PASS (pass_ipa_lto_wpa_fixup);
781 NEXT_PASS (pass_ipa_lto_finish_out); /* This must be the last LTO pass. */
784 /* These passes are run after IPA passes on every function that is being
785 output to the assembler file. */
787 NEXT_PASS (pass_lower_eh_dispatch);
788 NEXT_PASS (pass_all_optimizations);
790 struct opt_pass **p = &pass_all_optimizations.pass.sub;
791 NEXT_PASS (pass_remove_cgraph_callee_edges);
792 /* Initial scalar cleanups before alias computation.
793 They ensure memory accesses are not indirect wherever possible. */
794 NEXT_PASS (pass_strip_predict_hints);
795 NEXT_PASS (pass_update_address_taken);
796 NEXT_PASS (pass_rename_ssa_copies);
797 NEXT_PASS (pass_complete_unrolli);
798 NEXT_PASS (pass_ccp);
799 NEXT_PASS (pass_forwprop);
800 NEXT_PASS (pass_call_cdce);
801 /* pass_build_alias is a dummy pass that ensures that we
802 execute TODO_rebuild_alias at this point. Re-building
803 alias information also rewrites no longer addressed
804 locals into SSA form if possible. */
805 NEXT_PASS (pass_build_alias);
806 NEXT_PASS (pass_return_slot);
807 NEXT_PASS (pass_phiprop);
808 NEXT_PASS (pass_fre);
809 NEXT_PASS (pass_copy_prop);
810 NEXT_PASS (pass_merge_phi);
811 NEXT_PASS (pass_vrp);
812 NEXT_PASS (pass_dce);
813 NEXT_PASS (pass_cselim);
814 NEXT_PASS (pass_tree_ifcombine);
815 NEXT_PASS (pass_phiopt);
816 NEXT_PASS (pass_tail_recursion);
818 NEXT_PASS (pass_stdarg);
819 NEXT_PASS (pass_lower_complex);
820 NEXT_PASS (pass_sra);
821 NEXT_PASS (pass_rename_ssa_copies);
822 /* The dom pass will also resolve all __builtin_constant_p calls
823 that are still there to 0. This has to be done after some
824 propagations have already run, but before some more dead code
825 is removed, and this place fits nicely. Remember this when
826 trying to move or duplicate pass_dominator somewhere earlier. */
827 NEXT_PASS (pass_dominator);
828 /* The only const/copy propagation opportunities left after
829 DOM should be due to degenerate PHI nodes. So rather than
830 run the full propagators, run a specialized pass which
831 only examines PHIs to discover const/copy propagation
833 NEXT_PASS (pass_phi_only_cprop);
834 NEXT_PASS (pass_dse);
835 NEXT_PASS (pass_reassoc);
836 NEXT_PASS (pass_dce);
837 NEXT_PASS (pass_forwprop);
838 NEXT_PASS (pass_phiopt);
839 NEXT_PASS (pass_object_sizes);
840 NEXT_PASS (pass_ccp);
841 NEXT_PASS (pass_copy_prop);
842 NEXT_PASS (pass_cse_sincos);
843 NEXT_PASS (pass_optimize_bswap);
844 NEXT_PASS (pass_split_crit_edges);
845 NEXT_PASS (pass_pre);
846 NEXT_PASS (pass_sink_code);
847 NEXT_PASS (pass_tree_loop);
849 struct opt_pass **p = &pass_tree_loop.pass.sub;
850 NEXT_PASS (pass_tree_loop_init);
851 NEXT_PASS (pass_copy_prop);
852 NEXT_PASS (pass_dce_loop);
853 NEXT_PASS (pass_lim);
854 NEXT_PASS (pass_tree_unswitch);
855 NEXT_PASS (pass_scev_cprop);
856 NEXT_PASS (pass_record_bounds);
857 NEXT_PASS (pass_check_data_deps);
858 NEXT_PASS (pass_loop_distribution);
859 NEXT_PASS (pass_linear_transform);
860 NEXT_PASS (pass_graphite_transforms);
862 struct opt_pass **p = &pass_graphite_transforms.pass.sub;
863 NEXT_PASS (pass_dce_loop);
864 NEXT_PASS (pass_lim);
866 NEXT_PASS (pass_iv_canon);
867 NEXT_PASS (pass_if_conversion);
868 NEXT_PASS (pass_vectorize);
870 struct opt_pass **p = &pass_vectorize.pass.sub;
871 NEXT_PASS (pass_lower_vector_ssa);
872 NEXT_PASS (pass_dce_loop);
874 NEXT_PASS (pass_predcom);
875 NEXT_PASS (pass_complete_unroll);
876 NEXT_PASS (pass_slp_vectorize);
877 NEXT_PASS (pass_parallelize_loops);
878 NEXT_PASS (pass_loop_prefetch);
879 NEXT_PASS (pass_iv_optimize);
880 NEXT_PASS (pass_tree_loop_done);
882 NEXT_PASS (pass_cse_reciprocals);
883 NEXT_PASS (pass_convert_to_rsqrt);
884 NEXT_PASS (pass_reassoc);
885 NEXT_PASS (pass_vrp);
886 NEXT_PASS (pass_dominator);
887 /* The only const/copy propagation opportunities left after
888 DOM should be due to degenerate PHI nodes. So rather than
889 run the full propagators, run a specialized pass which
890 only examines PHIs to discover const/copy propagation
892 NEXT_PASS (pass_phi_only_cprop);
893 NEXT_PASS (pass_cd_dce);
894 NEXT_PASS (pass_tracer);
896 /* FIXME: If DCE is not run before checking for uninitialized uses,
897 we may get false warnings (e.g., testsuite/gcc.dg/uninit-5.c).
898 However, this also causes us to misdiagnose cases that should be
899 real warnings (e.g., testsuite/gcc.dg/pr18501.c).
901 To fix the false positives in uninit-5.c, we would have to
902 account for the predicates protecting the set and the use of each
903 variable. Using a representation like Gated Single Assignment
905 NEXT_PASS (pass_late_warn_uninitialized);
906 NEXT_PASS (pass_dse);
907 NEXT_PASS (pass_forwprop);
908 NEXT_PASS (pass_phiopt);
909 NEXT_PASS (pass_fold_builtins);
910 NEXT_PASS (pass_tail_calls);
911 NEXT_PASS (pass_rename_ssa_copies);
912 NEXT_PASS (pass_uncprop);
913 NEXT_PASS (pass_local_pure_const);
915 NEXT_PASS (pass_cleanup_eh);
916 NEXT_PASS (pass_lower_resx);
917 NEXT_PASS (pass_nrv);
918 NEXT_PASS (pass_mudflap_2);
919 NEXT_PASS (pass_cleanup_cfg_post_optimizing);
920 NEXT_PASS (pass_warn_function_noreturn);
922 NEXT_PASS (pass_expand);
924 NEXT_PASS (pass_rest_of_compilation);
926 struct opt_pass **p = &pass_rest_of_compilation.pass.sub;
927 NEXT_PASS (pass_init_function);
928 NEXT_PASS (pass_jump);
929 NEXT_PASS (pass_rtl_eh);
930 NEXT_PASS (pass_initial_value_sets);
931 NEXT_PASS (pass_unshare_all_rtl);
932 NEXT_PASS (pass_instantiate_virtual_regs);
933 NEXT_PASS (pass_into_cfg_layout_mode);
934 NEXT_PASS (pass_jump2);
935 NEXT_PASS (pass_lower_subreg);
936 NEXT_PASS (pass_df_initialize_opt);
937 NEXT_PASS (pass_cse);
938 NEXT_PASS (pass_rtl_fwprop);
939 NEXT_PASS (pass_rtl_cprop);
940 NEXT_PASS (pass_rtl_pre);
941 NEXT_PASS (pass_rtl_hoist);
942 NEXT_PASS (pass_rtl_cprop);
943 NEXT_PASS (pass_rtl_store_motion);
944 NEXT_PASS (pass_cse_after_global_opts);
945 NEXT_PASS (pass_rtl_ifcvt);
946 NEXT_PASS (pass_reginfo_init);
947 /* Perform loop optimizations. It might be better to do them a bit
948 sooner, but we want the profile feedback to work more
950 NEXT_PASS (pass_loop2);
952 struct opt_pass **p = &pass_loop2.pass.sub;
953 NEXT_PASS (pass_rtl_loop_init);
954 NEXT_PASS (pass_rtl_move_loop_invariants);
955 NEXT_PASS (pass_rtl_unswitch);
956 NEXT_PASS (pass_rtl_unroll_and_peel_loops);
957 NEXT_PASS (pass_rtl_doloop);
958 NEXT_PASS (pass_rtl_loop_done);
961 NEXT_PASS (pass_web);
962 NEXT_PASS (pass_rtl_cprop);
963 NEXT_PASS (pass_cse2);
964 NEXT_PASS (pass_rtl_dse1);
965 NEXT_PASS (pass_rtl_fwprop_addr);
966 NEXT_PASS (pass_inc_dec);
967 NEXT_PASS (pass_initialize_regs);
968 NEXT_PASS (pass_ud_rtl_dce);
969 NEXT_PASS (pass_combine);
970 NEXT_PASS (pass_if_after_combine);
971 NEXT_PASS (pass_partition_blocks);
972 NEXT_PASS (pass_regmove);
973 NEXT_PASS (pass_outof_cfg_layout_mode);
974 NEXT_PASS (pass_split_all_insns);
975 NEXT_PASS (pass_lower_subreg2);
976 NEXT_PASS (pass_df_initialize_no_opt);
977 NEXT_PASS (pass_stack_ptr_mod);
978 NEXT_PASS (pass_mode_switching);
979 NEXT_PASS (pass_match_asm_constraints);
980 NEXT_PASS (pass_sms);
981 NEXT_PASS (pass_sched);
982 NEXT_PASS (pass_ira);
983 NEXT_PASS (pass_postreload);
985 struct opt_pass **p = &pass_postreload.pass.sub;
986 NEXT_PASS (pass_postreload_cse);
987 NEXT_PASS (pass_gcse2);
988 NEXT_PASS (pass_split_after_reload);
989 NEXT_PASS (pass_branch_target_load_optimize1);
990 NEXT_PASS (pass_thread_prologue_and_epilogue);
991 NEXT_PASS (pass_rtl_dse2);
992 NEXT_PASS (pass_stack_adjustments);
993 NEXT_PASS (pass_peephole2);
994 NEXT_PASS (pass_if_after_reload);
995 NEXT_PASS (pass_regrename);
996 NEXT_PASS (pass_cprop_hardreg);
997 NEXT_PASS (pass_fast_rtl_dce);
998 NEXT_PASS (pass_reorder_blocks);
999 NEXT_PASS (pass_branch_target_load_optimize2);
1000 NEXT_PASS (pass_leaf_regs);
1001 NEXT_PASS (pass_split_before_sched2);
1002 NEXT_PASS (pass_sched2);
1003 NEXT_PASS (pass_stack_regs);
1005 struct opt_pass **p = &pass_stack_regs.pass.sub;
1006 NEXT_PASS (pass_split_before_regstack);
1007 NEXT_PASS (pass_stack_regs_run);
1009 NEXT_PASS (pass_compute_alignments);
1010 NEXT_PASS (pass_duplicate_computed_gotos);
1011 NEXT_PASS (pass_variable_tracking);
1012 NEXT_PASS (pass_free_cfg);
1013 NEXT_PASS (pass_machine_reorg);
1014 NEXT_PASS (pass_cleanup_barriers);
1015 NEXT_PASS (pass_delay_slots);
1016 NEXT_PASS (pass_split_for_shorten_branches);
1017 NEXT_PASS (pass_convert_to_eh_region_ranges);
1018 NEXT_PASS (pass_shorten_branches);
1019 NEXT_PASS (pass_set_nothrow_function_flags);
1020 NEXT_PASS (pass_final);
1022 NEXT_PASS (pass_df_finish);
1024 NEXT_PASS (pass_clean_state);
1029 /* Register the passes with the tree dump code. */
1030 register_dump_files (all_lowering_passes, PROP_gimple_any);
1031 register_dump_files (all_small_ipa_passes,
1032 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1034 register_dump_files (all_regular_ipa_passes,
1035 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1037 register_dump_files (all_lto_gen_passes,
1038 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1040 register_dump_files (all_passes,
1041 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1045 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
1046 function CALLBACK for every function in the call graph. Otherwise,
1047 call CALLBACK on the current function. */
1050 do_per_function (void (*callback) (void *data), void *data)
1052 if (current_function_decl)
1056 struct cgraph_node *node;
1057 for (node = cgraph_nodes; node; node = node->next)
1058 if (node->analyzed && gimple_has_body_p (node->decl)
1059 && (!node->clone_of || node->decl != node->clone_of->decl))
1061 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
1062 current_function_decl = node->decl;
1066 free_dominance_info (CDI_DOMINATORS);
1067 free_dominance_info (CDI_POST_DOMINATORS);
1069 current_function_decl = NULL;
1076 /* Because inlining might remove no-longer reachable nodes, we need to
1077 keep the array visible to garbage collector to avoid reading collected
1080 static GTY ((length ("nnodes"))) struct cgraph_node **order;
1082 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
1083 function CALLBACK for every function in the call graph. Otherwise,
1084 call CALLBACK on the current function. */
1087 do_per_function_toporder (void (*callback) (void *data), void *data)
1091 if (current_function_decl)
1095 gcc_assert (!order);
1096 order = GGC_NEWVEC (struct cgraph_node *, cgraph_n_nodes);
1097 nnodes = cgraph_postorder (order);
1098 for (i = nnodes - 1; i >= 0; i--)
1099 order[i]->process = 1;
1100 for (i = nnodes - 1; i >= 0; i--)
1102 struct cgraph_node *node = order[i];
1104 /* Allow possibly removed nodes to be garbage collected. */
1109 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
1110 current_function_decl = node->decl;
1112 free_dominance_info (CDI_DOMINATORS);
1113 free_dominance_info (CDI_POST_DOMINATORS);
1114 current_function_decl = NULL;
1125 /* Perform all TODO actions that ought to be done on each function. */
1128 execute_function_todo (void *data)
1130 unsigned int flags = (size_t)data;
1131 if (cfun->curr_properties & PROP_ssa)
1132 flags |= TODO_verify_ssa;
1133 flags &= ~cfun->last_verified;
1137 statistics_fini_pass ();
1139 /* Always cleanup the CFG before trying to update SSA. */
1140 if (flags & TODO_cleanup_cfg)
1142 bool cleanup = cleanup_tree_cfg ();
1144 if (cleanup && (cfun->curr_properties & PROP_ssa))
1145 flags |= TODO_remove_unused_locals;
1147 /* When cleanup_tree_cfg merges consecutive blocks, it may
1148 perform some simplistic propagation when removing single
1149 valued PHI nodes. This propagation may, in turn, cause the
1150 SSA form to become out-of-date (see PR 22037). So, even
1151 if the parent pass had not scheduled an SSA update, we may
1152 still need to do one. */
1153 if (!(flags & TODO_update_ssa_any) && need_ssa_update_p (cfun))
1154 flags |= TODO_update_ssa;
1157 if (flags & TODO_update_ssa_any)
1159 unsigned update_flags = flags & TODO_update_ssa_any;
1160 update_ssa (update_flags);
1161 cfun->last_verified &= ~TODO_verify_ssa;
1164 if (flags & TODO_update_address_taken)
1165 execute_update_addresses_taken (true);
1167 if (flags & TODO_rebuild_alias)
1169 if (!(flags & TODO_update_address_taken))
1170 execute_update_addresses_taken (true);
1171 compute_may_aliases ();
1174 if (flags & TODO_remove_unused_locals)
1175 remove_unused_locals ();
1177 if ((flags & TODO_dump_func) && dump_file && current_function_decl)
1179 if (cfun->curr_properties & PROP_trees)
1180 dump_function_to_file (current_function_decl, dump_file, dump_flags);
1183 if (dump_flags & TDF_SLIM)
1184 print_rtl_slim_with_bb (dump_file, get_insns (), dump_flags);
1185 else if ((cfun->curr_properties & PROP_cfg)
1186 && (dump_flags & TDF_BLOCKS))
1187 print_rtl_with_bb (dump_file, get_insns ());
1189 print_rtl (dump_file, get_insns ());
1191 if ((cfun->curr_properties & PROP_cfg)
1192 && graph_dump_format != no_graph
1193 && (dump_flags & TDF_GRAPH))
1194 print_rtl_graph_with_bb (dump_file_name, get_insns ());
1197 /* Flush the file. If verification fails, we won't be able to
1198 close the file before aborting. */
1202 if (flags & TODO_rebuild_frequencies)
1204 if (profile_status == PROFILE_GUESSED)
1206 loop_optimizer_init (0);
1207 add_noreturn_fake_exit_edges ();
1208 mark_irreducible_loops ();
1209 connect_infinite_loops_to_exit ();
1210 estimate_bb_frequencies ();
1211 remove_fake_exit_edges ();
1212 loop_optimizer_finalize ();
1214 else if (profile_status == PROFILE_READ)
1220 #if defined ENABLE_CHECKING
1221 if (flags & TODO_verify_ssa)
1223 if (flags & TODO_verify_flow)
1224 verify_flow_info ();
1225 if (flags & TODO_verify_stmts)
1227 if (flags & TODO_verify_loops)
1228 verify_loop_closed_ssa ();
1229 if (flags & TODO_verify_rtl_sharing)
1230 verify_rtl_sharing ();
1233 cfun->last_verified = flags & TODO_verify_all;
1236 /* Perform all TODO actions. */
1238 execute_todo (unsigned int flags)
1240 #if defined ENABLE_CHECKING
1242 && need_ssa_update_p (cfun))
1243 gcc_assert (flags & TODO_update_ssa_any);
1246 /* Inform the pass whether it is the first time it is run. */
1247 first_pass_instance = (flags & TODO_mark_first_instance) != 0;
1249 do_per_function (execute_function_todo, (void *)(size_t) flags);
1251 /* Always remove functions just as before inlining: IPA passes might be
1252 interested to see bodies of extern inline functions that are not inlined
1253 to analyze side effects. The full removal is done just at the end
1254 of IPA pass queue. */
1255 if (flags & TODO_remove_functions)
1258 cgraph_remove_unreachable_nodes (true, dump_file);
1261 if ((flags & TODO_dump_cgraph) && dump_file && !current_function_decl)
1264 dump_cgraph (dump_file);
1265 /* Flush the file. If verification fails, we won't be able to
1266 close the file before aborting. */
1270 if (flags & TODO_ggc_collect)
1273 /* Now that the dumping has been done, we can get rid of the optional
1275 if (flags & TODO_df_finish)
1276 df_finish_pass ((flags & TODO_df_verify) != 0);
1279 /* Verify invariants that should hold between passes. This is a place
1280 to put simple sanity checks. */
1283 verify_interpass_invariants (void)
1285 #ifdef ENABLE_CHECKING
1286 gcc_assert (!fold_deferring_overflow_warnings_p ());
1290 /* Clear the last verified flag. */
1293 clear_last_verified (void *data ATTRIBUTE_UNUSED)
1295 cfun->last_verified = 0;
1298 /* Helper function. Verify that the properties has been turn into the
1299 properties expected by the pass. */
1301 #ifdef ENABLE_CHECKING
1303 verify_curr_properties (void *data)
1305 unsigned int props = (size_t)data;
1306 gcc_assert ((cfun->curr_properties & props) == props);
1310 /* Initialize pass dump file. */
1313 pass_init_dump_file (struct opt_pass *pass)
1315 /* If a dump file name is present, open it if enabled. */
1316 if (pass->static_pass_number != -1)
1318 bool initializing_dump = !dump_initialized_p (pass->static_pass_number);
1319 dump_file_name = get_dump_file_name (pass->static_pass_number);
1320 dump_file = dump_begin (pass->static_pass_number, &dump_flags);
1321 if (dump_file && current_function_decl)
1323 const char *dname, *aname;
1324 dname = lang_hooks.decl_printable_name (current_function_decl, 2);
1325 aname = (IDENTIFIER_POINTER
1326 (DECL_ASSEMBLER_NAME (current_function_decl)));
1327 fprintf (dump_file, "\n;; Function %s (%s)%s\n\n", dname, aname,
1328 cfun->function_frequency == FUNCTION_FREQUENCY_HOT
1330 : cfun->function_frequency == FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
1331 ? " (unlikely executed)"
1334 return initializing_dump;
1340 /* Flush PASS dump file. */
1343 pass_fini_dump_file (struct opt_pass *pass)
1345 /* Flush and close dump file. */
1348 free (CONST_CAST (char *, dump_file_name));
1349 dump_file_name = NULL;
1354 dump_end (pass->static_pass_number, dump_file);
1359 /* After executing the pass, apply expected changes to the function
1363 update_properties_after_pass (void *data)
1365 struct opt_pass *pass = (struct opt_pass *) data;
1366 cfun->curr_properties = (cfun->curr_properties | pass->properties_provided)
1367 & ~pass->properties_destroyed;
1370 /* Schedule IPA transform pass DATA for CFUN. */
1373 add_ipa_transform_pass (void *data)
1375 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *) data;
1376 VEC_safe_push (ipa_opt_pass, heap, cfun->ipa_transforms_to_apply, ipa_pass);
1379 /* Execute summary generation for all of the passes in IPA_PASS. */
1382 execute_ipa_summary_passes (struct ipa_opt_pass_d *ipa_pass)
1386 struct opt_pass *pass = &ipa_pass->pass;
1388 /* Execute all of the IPA_PASSes in the list. */
1389 if (ipa_pass->pass.type == IPA_PASS
1390 && (!pass->gate || pass->gate ())
1391 && ipa_pass->generate_summary)
1393 pass_init_dump_file (pass);
1395 /* If a timevar is present, start it. */
1397 timevar_push (pass->tv_id);
1399 ipa_pass->generate_summary ();
1403 timevar_pop (pass->tv_id);
1405 pass_fini_dump_file (pass);
1407 ipa_pass = (struct ipa_opt_pass_d *)ipa_pass->pass.next;
1411 /* Execute IPA_PASS function transform on NODE. */
1414 execute_one_ipa_transform_pass (struct cgraph_node *node,
1415 struct ipa_opt_pass_d *ipa_pass)
1417 struct opt_pass *pass = &ipa_pass->pass;
1418 unsigned int todo_after = 0;
1420 current_pass = pass;
1421 if (!ipa_pass->function_transform)
1424 /* Note that the folders should only create gimple expressions.
1425 This is a hack until the new folder is ready. */
1426 in_gimple_form = (cfun && (cfun->curr_properties & PROP_trees)) != 0;
1428 pass_init_dump_file (pass);
1430 /* Run pre-pass verification. */
1431 execute_todo (ipa_pass->function_transform_todo_flags_start);
1433 /* If a timevar is present, start it. */
1434 if (pass->tv_id != TV_NONE)
1435 timevar_push (pass->tv_id);
1438 todo_after = ipa_pass->function_transform (node);
1441 if (pass->tv_id != TV_NONE)
1442 timevar_pop (pass->tv_id);
1444 /* Run post-pass cleanup and verification. */
1445 execute_todo (todo_after);
1446 verify_interpass_invariants ();
1448 pass_fini_dump_file (pass);
1450 current_pass = NULL;
1453 /* For the current function, execute all ipa transforms. */
1456 execute_all_ipa_transforms (void)
1458 if (cfun && cfun->ipa_transforms_to_apply)
1461 struct cgraph_node *node = cgraph_node (current_function_decl);
1463 for (i = 0; i < VEC_length (ipa_opt_pass, cfun->ipa_transforms_to_apply);
1465 execute_one_ipa_transform_pass (node,
1466 VEC_index (ipa_opt_pass,
1467 cfun->ipa_transforms_to_apply,
1469 VEC_free (ipa_opt_pass, heap, cfun->ipa_transforms_to_apply);
1470 cfun->ipa_transforms_to_apply = NULL;
1477 execute_one_pass (struct opt_pass *pass)
1479 bool initializing_dump;
1480 unsigned int todo_after = 0;
1482 /* IPA passes are executed on whole program, so cfun should be NULL.
1483 Other passes need function context set. */
1484 if (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS)
1485 gcc_assert (!cfun && !current_function_decl);
1487 gcc_assert (cfun && current_function_decl);
1489 current_pass = pass;
1491 /* See if we're supposed to run this pass. */
1492 if (pass->gate && !pass->gate ())
1495 if (!quiet_flag && !cfun)
1496 fprintf (stderr, " <%s>", pass->name ? pass->name : "");
1498 /* Note that the folders should only create gimple expressions.
1499 This is a hack until the new folder is ready. */
1500 in_gimple_form = (cfun && (cfun->curr_properties & PROP_trees)) != 0;
1502 initializing_dump = pass_init_dump_file (pass);
1504 /* Run pre-pass verification. */
1505 execute_todo (pass->todo_flags_start);
1507 #ifdef ENABLE_CHECKING
1508 do_per_function (verify_curr_properties,
1509 (void *)(size_t)pass->properties_required);
1512 /* If a timevar is present, start it. */
1513 if (pass->tv_id != TV_NONE)
1514 timevar_push (pass->tv_id);
1519 todo_after = pass->execute ();
1520 do_per_function (clear_last_verified, NULL);
1524 if (pass->tv_id != TV_NONE)
1525 timevar_pop (pass->tv_id);
1527 do_per_function (update_properties_after_pass, pass);
1529 if (initializing_dump
1531 && graph_dump_format != no_graph
1533 && (cfun->curr_properties & (PROP_cfg | PROP_rtl))
1534 == (PROP_cfg | PROP_rtl))
1536 get_dump_file_info (pass->static_pass_number)->flags |= TDF_GRAPH;
1537 dump_flags |= TDF_GRAPH;
1538 clean_graph_dump_file (dump_file_name);
1541 /* Run post-pass cleanup and verification. */
1542 execute_todo (todo_after | pass->todo_flags_finish);
1543 verify_interpass_invariants ();
1544 if (pass->type == IPA_PASS)
1545 do_per_function (add_ipa_transform_pass, pass);
1547 if (!current_function_decl)
1548 cgraph_process_new_functions ();
1550 pass_fini_dump_file (pass);
1552 if (pass->type != SIMPLE_IPA_PASS && pass->type != IPA_PASS)
1553 gcc_assert (!(cfun->curr_properties & PROP_trees)
1554 || pass->type != RTL_PASS);
1556 current_pass = NULL;
1562 execute_pass_list (struct opt_pass *pass)
1566 gcc_assert (pass->type == GIMPLE_PASS
1567 || pass->type == RTL_PASS);
1568 if (execute_one_pass (pass) && pass->sub)
1569 execute_pass_list (pass->sub);
1575 /* Same as execute_pass_list but assume that subpasses of IPA passes
1576 are local passes. If SET is not NULL, write out summaries of only
1577 those node in SET. */
1580 ipa_write_summaries_2 (struct opt_pass *pass, cgraph_node_set set,
1581 struct lto_out_decl_state *state)
1585 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *)pass;
1586 gcc_assert (!current_function_decl);
1588 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
1589 if (pass->type == IPA_PASS
1590 && ipa_pass->write_summary
1591 && (!pass->gate || pass->gate ()))
1593 /* If a timevar is present, start it. */
1595 timevar_push (pass->tv_id);
1597 ipa_pass->write_summary (set);
1599 /* If a timevar is present, start it. */
1601 timevar_pop (pass->tv_id);
1604 if (pass->sub && pass->sub->type != GIMPLE_PASS)
1605 ipa_write_summaries_2 (pass->sub, set, state);
1611 /* Helper function of ipa_write_summaries. Creates and destroys the
1612 decl state and calls ipa_write_summaries_2 for all passes that have
1613 summaries. SET is the set of nodes to be written. */
1616 ipa_write_summaries_1 (cgraph_node_set set)
1618 struct lto_out_decl_state *state = lto_new_out_decl_state ();
1619 lto_push_out_decl_state (state);
1621 ipa_write_summaries_2 (all_regular_ipa_passes, set, state);
1622 ipa_write_summaries_2 (all_lto_gen_passes, set, state);
1624 gcc_assert (lto_get_out_decl_state () == state);
1625 lto_pop_out_decl_state ();
1626 lto_delete_out_decl_state (state);
1629 /* Write out summaries for all the nodes in the callgraph. */
1632 ipa_write_summaries (void)
1634 cgraph_node_set set;
1635 struct cgraph_node **order;
1638 if (!flag_generate_lto || errorcount || sorrycount)
1641 lto_new_extern_inline_states ();
1642 set = cgraph_node_set_new ();
1644 /* Create the callgraph set in the same order used in
1645 cgraph_expand_all_functions. This mostly facilitates debugging,
1646 since it causes the gimple file to be processed in the same order
1647 as the source code. */
1648 order = XCNEWVEC (struct cgraph_node *, cgraph_n_nodes);
1649 order_pos = cgraph_postorder (order);
1650 gcc_assert (order_pos == cgraph_n_nodes);
1652 for (i = order_pos - 1; i >= 0; i--)
1653 cgraph_node_set_add (set, order[i]);
1655 ipa_write_summaries_1 (set);
1656 lto_delete_extern_inline_states ();
1663 /* Write all the summaries for the cgraph nodes in SET. If SET is
1664 NULL, write out all summaries of all nodes. */
1667 ipa_write_summaries_of_cgraph_node_set (cgraph_node_set set)
1669 if (flag_generate_lto && !(errorcount || sorrycount))
1670 ipa_write_summaries_1 (set);
1673 /* Same as execute_pass_list but assume that subpasses of IPA passes
1674 are local passes. */
1677 ipa_read_summaries_1 (struct opt_pass *pass)
1681 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *) pass;
1683 gcc_assert (!current_function_decl);
1685 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
1687 if (pass->gate == NULL || pass->gate ())
1689 if (pass->type == IPA_PASS && ipa_pass->read_summary)
1691 /* If a timevar is present, start it. */
1693 timevar_push (pass->tv_id);
1695 ipa_pass->read_summary ();
1699 timevar_pop (pass->tv_id);
1702 if (pass->sub && pass->sub->type != GIMPLE_PASS)
1703 ipa_read_summaries_1 (pass->sub);
1710 /* Read all the summaries for all_regular_ipa_passes and all_lto_gen_passes. */
1713 ipa_read_summaries (void)
1715 ipa_read_summaries_1 (all_regular_ipa_passes);
1716 ipa_read_summaries_1 (all_lto_gen_passes);
1719 /* Same as execute_pass_list but assume that subpasses of IPA passes
1720 are local passes. */
1722 execute_ipa_pass_list (struct opt_pass *pass)
1726 gcc_assert (!current_function_decl);
1728 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
1729 if (execute_one_pass (pass) && pass->sub)
1731 if (pass->sub->type == GIMPLE_PASS)
1732 do_per_function_toporder ((void (*)(void *))execute_pass_list,
1734 else if (pass->sub->type == SIMPLE_IPA_PASS
1735 || pass->sub->type == IPA_PASS)
1736 execute_ipa_pass_list (pass->sub);
1740 gcc_assert (!current_function_decl);
1741 cgraph_process_new_functions ();
1747 extern void debug_properties (unsigned int);
1748 extern void dump_properties (FILE *, unsigned int);
1751 dump_properties (FILE *dump, unsigned int props)
1753 fprintf (dump, "Properties:\n");
1754 if (props & PROP_gimple_any)
1755 fprintf (dump, "PROP_gimple_any\n");
1756 if (props & PROP_gimple_lcf)
1757 fprintf (dump, "PROP_gimple_lcf\n");
1758 if (props & PROP_gimple_leh)
1759 fprintf (dump, "PROP_gimple_leh\n");
1760 if (props & PROP_cfg)
1761 fprintf (dump, "PROP_cfg\n");
1762 if (props & PROP_referenced_vars)
1763 fprintf (dump, "PROP_referenced_vars\n");
1764 if (props & PROP_ssa)
1765 fprintf (dump, "PROP_ssa\n");
1766 if (props & PROP_no_crit_edges)
1767 fprintf (dump, "PROP_no_crit_edges\n");
1768 if (props & PROP_rtl)
1769 fprintf (dump, "PROP_rtl\n");
1770 if (props & PROP_gimple_lomp)
1771 fprintf (dump, "PROP_gimple_lomp\n");
1775 debug_properties (unsigned int props)
1777 dump_properties (stderr, props);
1780 /* Called by local passes to see if function is called by already processed nodes.
1781 Because we process nodes in topological order, this means that function is
1782 in recursive cycle or we introduced new direct calls. */
1784 function_called_by_processed_nodes_p (void)
1786 struct cgraph_edge *e;
1787 for (e = cgraph_node (current_function_decl)->callers; e; e = e->next_caller)
1789 if (e->caller->decl == current_function_decl)
1791 if (!e->caller->analyzed)
1793 if (TREE_ASM_WRITTEN (e->caller->decl))
1795 if (!e->caller->process && !e->caller->global.inlined_to)
1800 fprintf (dump_file, "Already processed call to:\n");
1801 dump_cgraph_node (dump_file, e->caller);
1806 #include "gt-passes.h"