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, 2010
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. */
29 #include "coretypes.h"
33 #ifdef HAVE_SYS_RESOURCE_H
34 # include <sys/resource.h>
37 #ifdef HAVE_SYS_TIMES_H
38 # include <sys/times.h>
47 #include "insn-attr.h"
48 #include "insn-config.h"
49 #include "insn-flags.h"
50 #include "hard-reg-set.h"
57 #include "basic-block.h"
63 #include "diagnostic-core.h"
66 #include "dwarf2asm.h"
67 #include "integrate.h"
70 #include "langhooks.h"
71 #include "cfglayout.h"
73 #include "hosthooks.h"
77 #include "value-prof.h"
78 #include "tree-inline.h"
79 #include "tree-flow.h"
80 #include "tree-pass.h"
81 #include "tree-dump.h"
84 #include "lto-streamer.h"
87 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
88 #include "dwarf2out.h"
91 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
95 #ifdef SDB_DEBUGGING_INFO
99 #ifdef XCOFF_DEBUGGING_INFO
100 #include "xcoffout.h" /* Needed for external data
101 declarations for e.g. AIX 4.x. */
104 /* This is used for debugging. It allows the current pass to printed
105 from anywhere in compilation.
106 The variable current_pass is also used for statistics and plugins. */
107 struct opt_pass *current_pass;
109 /* Call from anywhere to find out what pass this is. Useful for
110 printing out debugging information deep inside an service
113 print_current_pass (FILE *file)
116 fprintf (file, "current pass = %s (%d)\n",
117 current_pass->name, current_pass->static_pass_number);
119 fprintf (file, "no current pass.\n");
123 /* Call from the debugger to get the current pass name. */
127 print_current_pass (stderr);
132 /* Global variables used to communicate with passes. */
135 bool first_pass_instance;
138 /* This is called from various places for FUNCTION_DECL, VAR_DECL,
141 This does nothing for local (non-static) variables, unless the
142 variable is a register variable with DECL_ASSEMBLER_NAME set. In
143 that case, or if the variable is not an automatic, it sets up the
144 RTL and outputs any assembler code (label definition, storage
145 allocation and initialization).
147 DECL is the declaration. TOP_LEVEL is nonzero
148 if this declaration is not within a function. */
151 rest_of_decl_compilation (tree decl,
155 /* We deferred calling assemble_alias so that we could collect
156 other attributes such as visibility. Emit the alias now. */
159 alias = lookup_attribute ("alias", DECL_ATTRIBUTES (decl));
162 alias = TREE_VALUE (TREE_VALUE (alias));
163 alias = get_identifier (TREE_STRING_POINTER (alias));
164 assemble_alias (decl, alias);
168 /* Can't defer this, because it needs to happen before any
169 later function definitions are processed. */
170 if (DECL_ASSEMBLER_NAME_SET_P (decl) && DECL_REGISTER (decl))
171 make_decl_rtl (decl);
173 /* Forward declarations for nested functions are not "external",
174 but we need to treat them as if they were. */
175 if (TREE_STATIC (decl) || DECL_EXTERNAL (decl)
176 || TREE_CODE (decl) == FUNCTION_DECL)
178 timevar_push (TV_VARCONST);
180 /* Don't output anything when a tentative file-scope definition
181 is seen. But at end of compilation, do output code for them.
183 We do output all variables and rely on
184 callgraph code to defer them except for forward declarations
185 (see gcc.c-torture/compile/920624-1.c) */
187 || !DECL_DEFER_OUTPUT (decl)
188 || DECL_INITIAL (decl))
189 && !DECL_EXTERNAL (decl))
191 /* When reading LTO unit, we also read varpool, so do not
193 if (in_lto_p && !at_end)
195 else if (TREE_CODE (decl) != FUNCTION_DECL)
196 varpool_finalize_decl (decl);
199 #ifdef ASM_FINISH_DECLARE_OBJECT
200 if (decl == last_assemble_variable_decl)
202 ASM_FINISH_DECLARE_OBJECT (asm_out_file, decl,
207 timevar_pop (TV_VARCONST);
209 else if (TREE_CODE (decl) == TYPE_DECL
210 /* Like in rest_of_type_compilation, avoid confusing the debug
211 information machinery when there are errors. */
214 timevar_push (TV_SYMOUT);
215 debug_hooks->type_decl (decl, !top_level);
216 timevar_pop (TV_SYMOUT);
219 /* Let cgraph know about the existence of variables. */
220 if (in_lto_p && !at_end)
222 else if (TREE_CODE (decl) == VAR_DECL && !DECL_EXTERNAL (decl)
223 && TREE_STATIC (decl))
227 /* Called after finishing a record, union or enumeral type. */
230 rest_of_type_compilation (tree type, int toplev)
232 /* Avoid confusing the debug information machinery when there are
237 timevar_push (TV_SYMOUT);
238 debug_hooks->type_decl (TYPE_STUB_DECL (type), !toplev);
239 timevar_pop (TV_SYMOUT);
245 finish_optimization_passes (void)
248 struct dump_file_info *dfi;
251 timevar_push (TV_DUMP);
252 if (profile_arc_flag || flag_test_coverage || flag_branch_probabilities)
254 dump_file = dump_begin (pass_profile.pass.static_pass_number, NULL);
257 dump_end (pass_profile.pass.static_pass_number, dump_file);
262 dump_file = dump_begin (pass_combine.pass.static_pass_number, NULL);
265 dump_combine_total_stats (dump_file);
266 dump_end (pass_combine.pass.static_pass_number, dump_file);
270 /* Do whatever is necessary to finish printing the graphs. */
271 if (graph_dump_format != no_graph)
272 for (i = TDI_end; (dfi = get_dump_file_info (i)) != NULL; ++i)
273 if (dump_initialized_p (i)
274 && (dfi->flags & TDF_GRAPH) != 0
275 && (name = get_dump_file_name (i)) != NULL)
277 finish_graph_dump_file (name);
281 timevar_pop (TV_DUMP);
285 gate_rest_of_compilation (void)
287 /* Early return if there were errors. We can run afoul of our
288 consistency checks, and there's not really much point in fixing them. */
289 return !(rtl_dump_and_exit || flag_syntax_only || seen_error ());
292 struct gimple_opt_pass pass_rest_of_compilation =
296 "*rest_of_compilation", /* name */
297 gate_rest_of_compilation, /* gate */
301 0, /* static_pass_number */
302 TV_REST_OF_COMPILATION, /* tv_id */
303 PROP_rtl, /* properties_required */
304 0, /* properties_provided */
305 0, /* properties_destroyed */
306 0, /* todo_flags_start */
307 TODO_ggc_collect /* todo_flags_finish */
312 gate_postreload (void)
314 return reload_completed;
317 struct rtl_opt_pass pass_postreload =
321 "*all-postreload", /* name */
322 gate_postreload, /* gate */
326 0, /* static_pass_number */
328 PROP_rtl, /* properties_required */
329 0, /* properties_provided */
330 0, /* properties_destroyed */
331 0, /* todo_flags_start */
332 TODO_ggc_collect | TODO_verify_rtl_sharing /* todo_flags_finish */
338 /* The root of the compilation pass tree, once constructed. */
339 struct opt_pass *all_passes, *all_small_ipa_passes, *all_lowering_passes,
340 *all_regular_ipa_passes, *all_lto_gen_passes;
342 /* This is used by plugins, and should also be used in register_pass. */
343 #define DEF_PASS_LIST(LIST) &LIST,
344 struct opt_pass **gcc_pass_lists[] = { GCC_PASS_LISTS NULL };
347 /* A map from static pass id to optimization pass. */
348 struct opt_pass **passes_by_id;
349 int passes_by_id_size;
351 /* Set the static pass number of pass PASS to ID and record that
352 in the mapping from static pass number to pass. */
355 set_pass_for_id (int id, struct opt_pass *pass)
357 pass->static_pass_number = id;
358 if (passes_by_id_size <= id)
360 passes_by_id = XRESIZEVEC (struct opt_pass *, passes_by_id, id + 1);
361 memset (passes_by_id + passes_by_id_size, 0,
362 (id + 1 - passes_by_id_size) * sizeof (void *));
363 passes_by_id_size = id + 1;
365 passes_by_id[id] = pass;
368 /* Return the pass with the static pass number ID. */
371 get_pass_for_id (int id)
373 if (id >= passes_by_id_size)
375 return passes_by_id[id];
378 /* Iterate over the pass tree allocating dump file numbers. We want
379 to do this depth first, and independent of whether the pass is
383 register_one_dump_file (struct opt_pass *pass)
385 char *dot_name, *flag_name, *glob_name;
386 const char *name, *prefix;
390 /* See below in next_pass_1. */
392 if (pass->static_pass_number != -1)
393 sprintf (num, "%d", ((int) pass->static_pass_number < 0
394 ? 1 : pass->static_pass_number));
396 /* The name is both used to identify the pass for the purposes of plugins,
397 and to specify dump file name and option.
398 The latter two might want something short which is not quite unique; for
399 that reason, we may have a disambiguating prefix, followed by a space
400 to mark the start of the following dump file name / option string. */
401 name = strchr (pass->name, ' ');
402 name = name ? name + 1 : pass->name;
403 dot_name = concat (".", name, num, NULL);
404 if (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS)
405 prefix = "ipa-", flags = TDF_IPA;
406 else if (pass->type == GIMPLE_PASS)
407 prefix = "tree-", flags = TDF_TREE;
409 prefix = "rtl-", flags = TDF_RTL;
411 flag_name = concat (prefix, name, num, NULL);
412 glob_name = concat (prefix, name, NULL);
413 id = dump_register (dot_name, flag_name, glob_name, flags);
414 set_pass_for_id (id, pass);
417 /* Recursive worker function for register_dump_files. */
420 register_dump_files_1 (struct opt_pass *pass, int properties)
424 int new_properties = (properties | pass->properties_provided)
425 & ~pass->properties_destroyed;
427 if (pass->name && pass->name[0] != '*')
428 register_one_dump_file (pass);
431 new_properties = register_dump_files_1 (pass->sub, new_properties);
433 /* If we have a gate, combine the properties that we could have with
434 and without the pass being examined. */
436 properties &= new_properties;
438 properties = new_properties;
447 /* Register the dump files for the pipeline starting at PASS.
448 PROPERTIES reflects the properties that are guaranteed to be available at
449 the beginning of the pipeline. */
452 register_dump_files (struct opt_pass *pass,int properties)
454 pass->properties_required |= properties;
455 register_dump_files_1 (pass, properties);
458 /* Look at the static_pass_number and duplicate the pass
459 if it is already added to a list. */
461 static struct opt_pass *
462 make_pass_instance (struct opt_pass *pass, bool track_duplicates)
464 /* A nonzero static_pass_number indicates that the
465 pass is already in the list. */
466 if (pass->static_pass_number)
468 struct opt_pass *new_pass;
470 if (pass->type == GIMPLE_PASS
471 || pass->type == RTL_PASS
472 || pass->type == SIMPLE_IPA_PASS)
474 new_pass = XNEW (struct opt_pass);
475 memcpy (new_pass, pass, sizeof (struct opt_pass));
477 else if (pass->type == IPA_PASS)
479 new_pass = (struct opt_pass *)XNEW (struct ipa_opt_pass_d);
480 memcpy (new_pass, pass, sizeof (struct ipa_opt_pass_d));
485 new_pass->next = NULL;
487 new_pass->todo_flags_start &= ~TODO_mark_first_instance;
489 /* Indicate to register_dump_files that this pass has duplicates,
490 and so it should rename the dump file. The first instance will
491 be -1, and be number of duplicates = -static_pass_number - 1.
492 Subsequent instances will be > 0 and just the duplicate number. */
493 if ((pass->name && pass->name[0] != '*') || track_duplicates)
495 pass->static_pass_number -= 1;
496 new_pass->static_pass_number = -pass->static_pass_number;
502 pass->todo_flags_start |= TODO_mark_first_instance;
503 pass->static_pass_number = -1;
505 invoke_plugin_callbacks (PLUGIN_NEW_PASS, pass);
510 /* Add a pass to the pass list. Duplicate the pass if it's already
513 static struct opt_pass **
514 next_pass_1 (struct opt_pass **list, struct opt_pass *pass)
516 /* Every pass should have a name so that plugins can refer to them. */
517 gcc_assert (pass->name != NULL);
519 *list = make_pass_instance (pass, false);
521 return &(*list)->next;
524 /* List node for an inserted pass instance. We need to keep track of all
525 the newly-added pass instances (with 'added_pass_nodes' defined below)
526 so that we can register their dump files after pass-positioning is finished.
527 Registering dumping files needs to be post-processed or the
528 static_pass_number of the opt_pass object would be modified and mess up
529 the dump file names of future pass instances to be added. */
531 struct pass_list_node
533 struct opt_pass *pass;
534 struct pass_list_node *next;
537 static struct pass_list_node *added_pass_nodes = NULL;
538 static struct pass_list_node *prev_added_pass_node;
540 /* Insert the pass at the proper position. Return true if the pass
541 is successfully added.
543 NEW_PASS_INFO - new pass to be inserted
544 PASS_LIST - root of the pass list to insert the new pass to */
547 position_pass (struct register_pass_info *new_pass_info,
548 struct opt_pass **pass_list)
550 struct opt_pass *pass = *pass_list, *prev_pass = NULL;
551 bool success = false;
553 for ( ; pass; prev_pass = pass, pass = pass->next)
555 /* Check if the current pass is of the same type as the new pass and
556 matches the name and the instance number of the reference pass. */
557 if (pass->type == new_pass_info->pass->type
559 && !strcmp (pass->name, new_pass_info->reference_pass_name)
560 && ((new_pass_info->ref_pass_instance_number == 0)
561 || (new_pass_info->ref_pass_instance_number ==
562 pass->static_pass_number)
563 || (new_pass_info->ref_pass_instance_number == 1
564 && pass->todo_flags_start & TODO_mark_first_instance)))
566 struct opt_pass *new_pass;
567 struct pass_list_node *new_pass_node;
569 new_pass = make_pass_instance (new_pass_info->pass, true);
571 /* Insert the new pass instance based on the positioning op. */
572 switch (new_pass_info->pos_op)
574 case PASS_POS_INSERT_AFTER:
575 new_pass->next = pass->next;
576 pass->next = new_pass;
578 /* Skip newly inserted pass to avoid repeated
579 insertions in the case where the new pass and the
580 existing one have the same name. */
583 case PASS_POS_INSERT_BEFORE:
584 new_pass->next = pass;
586 prev_pass->next = new_pass;
588 *pass_list = new_pass;
590 case PASS_POS_REPLACE:
591 new_pass->next = pass->next;
593 prev_pass->next = new_pass;
595 *pass_list = new_pass;
596 new_pass->sub = pass->sub;
597 new_pass->tv_id = pass->tv_id;
601 error ("Invalid pass positioning operation");
605 /* Save the newly added pass (instance) in the added_pass_nodes
606 list so that we can register its dump file later. Note that
607 we cannot register the dump file now because doing so will modify
608 the static_pass_number of the opt_pass object and therefore
609 mess up the dump file name of future instances. */
610 new_pass_node = XCNEW (struct pass_list_node);
611 new_pass_node->pass = new_pass;
612 if (!added_pass_nodes)
613 added_pass_nodes = new_pass_node;
615 prev_added_pass_node->next = new_pass_node;
616 prev_added_pass_node = new_pass_node;
621 if (pass->sub && position_pass (new_pass_info, &pass->sub))
628 /* Hooks a new pass into the pass lists.
630 PASS_INFO - pass information that specifies the opt_pass object,
631 reference pass, instance number, and how to position
635 register_pass (struct register_pass_info *pass_info)
637 bool all_instances, success;
639 /* The checks below could fail in buggy plugins. Existing GCC
640 passes should never fail these checks, so we mention plugin in
642 if (!pass_info->pass)
643 fatal_error ("plugin cannot register a missing pass");
645 if (!pass_info->pass->name)
646 fatal_error ("plugin cannot register an unnamed pass");
648 if (!pass_info->reference_pass_name)
650 ("plugin cannot register pass %qs without reference pass name",
651 pass_info->pass->name);
653 /* Try to insert the new pass to the pass lists. We need to check
654 all five lists as the reference pass could be in one (or all) of
656 all_instances = pass_info->ref_pass_instance_number == 0;
657 success = position_pass (pass_info, &all_lowering_passes);
658 if (!success || all_instances)
659 success |= position_pass (pass_info, &all_small_ipa_passes);
660 if (!success || all_instances)
661 success |= position_pass (pass_info, &all_regular_ipa_passes);
662 if (!success || all_instances)
663 success |= position_pass (pass_info, &all_lto_gen_passes);
664 if (!success || all_instances)
665 success |= position_pass (pass_info, &all_passes);
668 ("pass %qs not found but is referenced by new pass %qs",
669 pass_info->reference_pass_name, pass_info->pass->name);
671 /* OK, we have successfully inserted the new pass. We need to register
672 the dump files for the newly added pass and its duplicates (if any).
673 Because the registration of plugin/backend passes happens after the
674 command-line options are parsed, the options that specify single
675 pass dumping (e.g. -fdump-tree-PASSNAME) cannot be used for new
676 passes. Therefore we currently can only enable dumping of
677 new passes when the 'dump-all' flags (e.g. -fdump-tree-all)
678 are specified. While doing so, we also delete the pass_list_node
679 objects created during pass positioning. */
680 while (added_pass_nodes)
682 struct pass_list_node *next_node = added_pass_nodes->next;
683 enum tree_dump_index tdi;
684 register_one_dump_file (added_pass_nodes->pass);
685 if (added_pass_nodes->pass->type == SIMPLE_IPA_PASS
686 || added_pass_nodes->pass->type == IPA_PASS)
688 else if (added_pass_nodes->pass->type == GIMPLE_PASS)
692 /* Check if dump-all flag is specified. */
693 if (get_dump_file_info (tdi)->state)
694 get_dump_file_info (added_pass_nodes->pass->static_pass_number)
695 ->state = get_dump_file_info (tdi)->state;
696 XDELETE (added_pass_nodes);
697 added_pass_nodes = next_node;
701 /* Construct the pass tree. The sequencing of passes is driven by
704 cgraph_finalize_compilation_unit ()
705 for each node N in the cgraph
706 cgraph_analyze_function (N)
707 cgraph_lower_function (N) -> all_lowering_passes
709 If we are optimizing, cgraph_optimize is then invoked:
712 ipa_passes () -> all_small_ipa_passes
713 cgraph_expand_all_functions ()
714 for each node N in the cgraph
715 cgraph_expand_function (N)
716 tree_rest_of_compilation (DECL (N)) -> all_passes
720 init_optimization_passes (void)
724 #define NEXT_PASS(PASS) (p = next_pass_1 (p, &((PASS).pass)))
726 /* All passes needed to lower the function into shape optimizers can
727 operate on. These passes are always run first on the function, but
728 backend might produce already lowered functions that are not processed
730 p = &all_lowering_passes;
731 NEXT_PASS (pass_warn_unused_result);
732 NEXT_PASS (pass_diagnose_omp_blocks);
733 NEXT_PASS (pass_mudflap_1);
734 NEXT_PASS (pass_lower_omp);
735 NEXT_PASS (pass_lower_cf);
736 NEXT_PASS (pass_refactor_eh);
737 NEXT_PASS (pass_lower_eh);
738 NEXT_PASS (pass_build_cfg);
739 NEXT_PASS (pass_lower_vector);
740 NEXT_PASS (pass_warn_function_return);
741 NEXT_PASS (pass_build_cgraph_edges);
742 NEXT_PASS (pass_inline_parameters);
745 /* Interprocedural optimization passes. */
746 p = &all_small_ipa_passes;
747 NEXT_PASS (pass_ipa_free_lang_data);
748 NEXT_PASS (pass_ipa_function_and_variable_visibility);
749 NEXT_PASS (pass_early_local_passes);
751 struct opt_pass **p = &pass_early_local_passes.pass.sub;
752 NEXT_PASS (pass_fixup_cfg);
753 NEXT_PASS (pass_init_datastructures);
754 NEXT_PASS (pass_expand_omp);
756 NEXT_PASS (pass_referenced_vars);
757 NEXT_PASS (pass_build_ssa);
758 NEXT_PASS (pass_early_warn_uninitialized);
759 /* Note that it is not strictly necessary to schedule an early
760 inline pass here. However, some test cases (e.g.,
761 g++.dg/other/p334435.C g++.dg/other/i386-1.C) expect extern
762 inline functions to be inlined even at -O0. This does not
763 happen during the first early inline pass. */
764 NEXT_PASS (pass_rebuild_cgraph_edges);
765 NEXT_PASS (pass_early_inline);
766 NEXT_PASS (pass_all_early_optimizations);
768 struct opt_pass **p = &pass_all_early_optimizations.pass.sub;
769 NEXT_PASS (pass_remove_cgraph_callee_edges);
770 NEXT_PASS (pass_rename_ssa_copies);
771 NEXT_PASS (pass_ccp);
772 NEXT_PASS (pass_forwprop);
773 /* pass_build_ealias is a dummy pass that ensures that we
774 execute TODO_rebuild_alias at this point. Re-building
775 alias information also rewrites no longer addressed
776 locals into SSA form if possible. */
777 NEXT_PASS (pass_build_ealias);
778 NEXT_PASS (pass_sra_early);
779 NEXT_PASS (pass_copy_prop);
780 NEXT_PASS (pass_merge_phi);
781 NEXT_PASS (pass_cd_dce);
782 NEXT_PASS (pass_early_ipa_sra);
783 NEXT_PASS (pass_tail_recursion);
784 NEXT_PASS (pass_convert_switch);
785 NEXT_PASS (pass_cleanup_eh);
786 NEXT_PASS (pass_profile);
787 NEXT_PASS (pass_local_pure_const);
788 /* Split functions creates parts that are not run through
789 early optimizations again. It is thus good idea to do this
791 NEXT_PASS (pass_split_functions);
793 NEXT_PASS (pass_release_ssa_names);
794 NEXT_PASS (pass_rebuild_cgraph_edges);
795 NEXT_PASS (pass_inline_parameters);
797 NEXT_PASS (pass_ipa_tree_profile);
798 NEXT_PASS (pass_ipa_increase_alignment);
799 NEXT_PASS (pass_ipa_matrix_reorg);
800 NEXT_PASS (pass_ipa_lower_emutls);
803 p = &all_regular_ipa_passes;
804 NEXT_PASS (pass_ipa_whole_program_visibility);
805 NEXT_PASS (pass_ipa_profile);
806 NEXT_PASS (pass_ipa_cp);
807 NEXT_PASS (pass_ipa_cdtor_merge);
808 NEXT_PASS (pass_ipa_inline);
809 NEXT_PASS (pass_ipa_pure_const);
810 NEXT_PASS (pass_ipa_reference);
811 NEXT_PASS (pass_ipa_type_escape);
812 NEXT_PASS (pass_ipa_pta);
813 NEXT_PASS (pass_ipa_struct_reorg);
816 p = &all_lto_gen_passes;
817 NEXT_PASS (pass_ipa_lto_gimple_out);
818 NEXT_PASS (pass_ipa_lto_finish_out); /* This must be the last LTO pass. */
821 /* These passes are run after IPA passes on every function that is being
822 output to the assembler file. */
824 NEXT_PASS (pass_lower_eh_dispatch);
825 NEXT_PASS (pass_all_optimizations);
827 struct opt_pass **p = &pass_all_optimizations.pass.sub;
828 NEXT_PASS (pass_remove_cgraph_callee_edges);
829 /* Initial scalar cleanups before alias computation.
830 They ensure memory accesses are not indirect wherever possible. */
831 NEXT_PASS (pass_strip_predict_hints);
832 NEXT_PASS (pass_rename_ssa_copies);
833 NEXT_PASS (pass_complete_unrolli);
834 NEXT_PASS (pass_ccp);
835 NEXT_PASS (pass_forwprop);
836 NEXT_PASS (pass_call_cdce);
837 /* pass_build_alias is a dummy pass that ensures that we
838 execute TODO_rebuild_alias at this point. Re-building
839 alias information also rewrites no longer addressed
840 locals into SSA form if possible. */
841 NEXT_PASS (pass_build_alias);
842 NEXT_PASS (pass_return_slot);
843 NEXT_PASS (pass_phiprop);
844 NEXT_PASS (pass_fre);
845 NEXT_PASS (pass_copy_prop);
846 NEXT_PASS (pass_merge_phi);
847 NEXT_PASS (pass_vrp);
848 NEXT_PASS (pass_dce);
849 NEXT_PASS (pass_cselim);
850 NEXT_PASS (pass_tree_ifcombine);
851 NEXT_PASS (pass_phiopt);
852 NEXT_PASS (pass_tail_recursion);
854 NEXT_PASS (pass_stdarg);
855 NEXT_PASS (pass_lower_complex);
856 NEXT_PASS (pass_sra);
857 NEXT_PASS (pass_rename_ssa_copies);
858 /* The dom pass will also resolve all __builtin_constant_p calls
859 that are still there to 0. This has to be done after some
860 propagations have already run, but before some more dead code
861 is removed, and this place fits nicely. Remember this when
862 trying to move or duplicate pass_dominator somewhere earlier. */
863 NEXT_PASS (pass_dominator);
864 /* The only const/copy propagation opportunities left after
865 DOM should be due to degenerate PHI nodes. So rather than
866 run the full propagators, run a specialized pass which
867 only examines PHIs to discover const/copy propagation
869 NEXT_PASS (pass_phi_only_cprop);
870 NEXT_PASS (pass_dse);
871 NEXT_PASS (pass_reassoc);
872 NEXT_PASS (pass_dce);
873 NEXT_PASS (pass_forwprop);
874 NEXT_PASS (pass_phiopt);
875 NEXT_PASS (pass_object_sizes);
876 NEXT_PASS (pass_ccp);
877 NEXT_PASS (pass_copy_prop);
878 NEXT_PASS (pass_cse_sincos);
879 NEXT_PASS (pass_optimize_bswap);
880 NEXT_PASS (pass_split_crit_edges);
881 NEXT_PASS (pass_pre);
882 NEXT_PASS (pass_sink_code);
883 NEXT_PASS (pass_tree_loop);
885 struct opt_pass **p = &pass_tree_loop.pass.sub;
886 NEXT_PASS (pass_tree_loop_init);
887 NEXT_PASS (pass_lim);
888 NEXT_PASS (pass_copy_prop);
889 NEXT_PASS (pass_dce_loop);
890 NEXT_PASS (pass_tree_unswitch);
891 NEXT_PASS (pass_scev_cprop);
892 NEXT_PASS (pass_record_bounds);
893 NEXT_PASS (pass_check_data_deps);
894 NEXT_PASS (pass_loop_distribution);
895 NEXT_PASS (pass_linear_transform);
896 NEXT_PASS (pass_copy_prop);
897 NEXT_PASS (pass_graphite);
899 struct opt_pass **p = &pass_graphite.pass.sub;
900 NEXT_PASS (pass_copy_prop);
901 NEXT_PASS (pass_graphite_transforms);
902 NEXT_PASS (pass_copy_prop);
903 NEXT_PASS (pass_dce_loop);
904 NEXT_PASS (pass_lim);
906 NEXT_PASS (pass_iv_canon);
907 NEXT_PASS (pass_if_conversion);
908 NEXT_PASS (pass_vectorize);
910 struct opt_pass **p = &pass_vectorize.pass.sub;
911 NEXT_PASS (pass_lower_vector_ssa);
912 NEXT_PASS (pass_dce_loop);
914 NEXT_PASS (pass_predcom);
915 NEXT_PASS (pass_complete_unroll);
916 NEXT_PASS (pass_slp_vectorize);
917 NEXT_PASS (pass_parallelize_loops);
918 NEXT_PASS (pass_loop_prefetch);
919 NEXT_PASS (pass_iv_optimize);
920 NEXT_PASS (pass_tree_loop_done);
922 NEXT_PASS (pass_cse_reciprocals);
923 NEXT_PASS (pass_reassoc);
924 NEXT_PASS (pass_vrp);
925 NEXT_PASS (pass_dominator);
926 /* The only const/copy propagation opportunities left after
927 DOM should be due to degenerate PHI nodes. So rather than
928 run the full propagators, run a specialized pass which
929 only examines PHIs to discover const/copy propagation
931 NEXT_PASS (pass_phi_only_cprop);
932 NEXT_PASS (pass_cd_dce);
933 NEXT_PASS (pass_tracer);
935 /* FIXME: If DCE is not run before checking for uninitialized uses,
936 we may get false warnings (e.g., testsuite/gcc.dg/uninit-5.c).
937 However, this also causes us to misdiagnose cases that should be
938 real warnings (e.g., testsuite/gcc.dg/pr18501.c).
940 To fix the false positives in uninit-5.c, we would have to
941 account for the predicates protecting the set and the use of each
942 variable. Using a representation like Gated Single Assignment
944 NEXT_PASS (pass_late_warn_uninitialized);
945 NEXT_PASS (pass_dse);
946 NEXT_PASS (pass_forwprop);
947 NEXT_PASS (pass_phiopt);
948 NEXT_PASS (pass_fold_builtins);
949 NEXT_PASS (pass_optimize_widening_mul);
950 NEXT_PASS (pass_tail_calls);
951 NEXT_PASS (pass_rename_ssa_copies);
952 NEXT_PASS (pass_uncprop);
953 NEXT_PASS (pass_local_pure_const);
955 NEXT_PASS (pass_lower_complex_O0);
956 NEXT_PASS (pass_cleanup_eh);
957 NEXT_PASS (pass_lower_resx);
958 NEXT_PASS (pass_nrv);
959 NEXT_PASS (pass_mudflap_2);
960 NEXT_PASS (pass_cleanup_cfg_post_optimizing);
961 NEXT_PASS (pass_warn_function_noreturn);
963 NEXT_PASS (pass_expand);
965 NEXT_PASS (pass_rest_of_compilation);
967 struct opt_pass **p = &pass_rest_of_compilation.pass.sub;
968 NEXT_PASS (pass_init_function);
969 NEXT_PASS (pass_jump);
970 NEXT_PASS (pass_rtl_eh);
971 NEXT_PASS (pass_initial_value_sets);
972 NEXT_PASS (pass_unshare_all_rtl);
973 NEXT_PASS (pass_instantiate_virtual_regs);
974 NEXT_PASS (pass_into_cfg_layout_mode);
975 NEXT_PASS (pass_jump2);
976 NEXT_PASS (pass_lower_subreg);
977 NEXT_PASS (pass_df_initialize_opt);
978 NEXT_PASS (pass_cse);
979 NEXT_PASS (pass_rtl_fwprop);
980 NEXT_PASS (pass_rtl_cprop);
981 NEXT_PASS (pass_rtl_pre);
982 NEXT_PASS (pass_rtl_hoist);
983 NEXT_PASS (pass_rtl_cprop);
984 NEXT_PASS (pass_rtl_store_motion);
985 NEXT_PASS (pass_cse_after_global_opts);
986 NEXT_PASS (pass_rtl_ifcvt);
987 NEXT_PASS (pass_reginfo_init);
988 /* Perform loop optimizations. It might be better to do them a bit
989 sooner, but we want the profile feedback to work more
991 NEXT_PASS (pass_loop2);
993 struct opt_pass **p = &pass_loop2.pass.sub;
994 NEXT_PASS (pass_rtl_loop_init);
995 NEXT_PASS (pass_rtl_move_loop_invariants);
996 NEXT_PASS (pass_rtl_unswitch);
997 NEXT_PASS (pass_rtl_unroll_and_peel_loops);
998 NEXT_PASS (pass_rtl_doloop);
999 NEXT_PASS (pass_rtl_loop_done);
1002 NEXT_PASS (pass_web);
1003 NEXT_PASS (pass_rtl_cprop);
1004 NEXT_PASS (pass_cse2);
1005 NEXT_PASS (pass_rtl_dse1);
1006 NEXT_PASS (pass_rtl_fwprop_addr);
1007 NEXT_PASS (pass_inc_dec);
1008 NEXT_PASS (pass_initialize_regs);
1009 NEXT_PASS (pass_ud_rtl_dce);
1010 NEXT_PASS (pass_combine);
1011 NEXT_PASS (pass_if_after_combine);
1012 NEXT_PASS (pass_partition_blocks);
1013 NEXT_PASS (pass_regmove);
1014 NEXT_PASS (pass_outof_cfg_layout_mode);
1015 NEXT_PASS (pass_split_all_insns);
1016 NEXT_PASS (pass_lower_subreg2);
1017 NEXT_PASS (pass_df_initialize_no_opt);
1018 NEXT_PASS (pass_stack_ptr_mod);
1019 NEXT_PASS (pass_mode_switching);
1020 NEXT_PASS (pass_match_asm_constraints);
1021 NEXT_PASS (pass_sms);
1022 NEXT_PASS (pass_sched);
1023 NEXT_PASS (pass_ira);
1024 NEXT_PASS (pass_postreload);
1026 struct opt_pass **p = &pass_postreload.pass.sub;
1027 NEXT_PASS (pass_postreload_cse);
1028 NEXT_PASS (pass_gcse2);
1029 NEXT_PASS (pass_split_after_reload);
1030 NEXT_PASS (pass_implicit_zee);
1031 NEXT_PASS (pass_branch_target_load_optimize1);
1032 NEXT_PASS (pass_thread_prologue_and_epilogue);
1033 NEXT_PASS (pass_rtl_dse2);
1034 NEXT_PASS (pass_stack_adjustments);
1035 NEXT_PASS (pass_peephole2);
1036 NEXT_PASS (pass_if_after_reload);
1037 NEXT_PASS (pass_regrename);
1038 NEXT_PASS (pass_cprop_hardreg);
1039 NEXT_PASS (pass_fast_rtl_dce);
1040 NEXT_PASS (pass_reorder_blocks);
1041 NEXT_PASS (pass_branch_target_load_optimize2);
1042 NEXT_PASS (pass_leaf_regs);
1043 NEXT_PASS (pass_split_before_sched2);
1044 NEXT_PASS (pass_sched2);
1045 NEXT_PASS (pass_stack_regs);
1047 struct opt_pass **p = &pass_stack_regs.pass.sub;
1048 NEXT_PASS (pass_split_before_regstack);
1049 NEXT_PASS (pass_stack_regs_run);
1051 NEXT_PASS (pass_compute_alignments);
1052 NEXT_PASS (pass_duplicate_computed_gotos);
1053 NEXT_PASS (pass_variable_tracking);
1054 NEXT_PASS (pass_free_cfg);
1055 NEXT_PASS (pass_machine_reorg);
1056 NEXT_PASS (pass_cleanup_barriers);
1057 NEXT_PASS (pass_delay_slots);
1058 NEXT_PASS (pass_split_for_shorten_branches);
1059 NEXT_PASS (pass_convert_to_eh_region_ranges);
1060 NEXT_PASS (pass_shorten_branches);
1061 NEXT_PASS (pass_set_nothrow_function_flags);
1062 NEXT_PASS (pass_final);
1064 NEXT_PASS (pass_df_finish);
1066 NEXT_PASS (pass_clean_state);
1071 /* Register the passes with the tree dump code. */
1072 register_dump_files (all_lowering_passes, PROP_gimple_any);
1073 register_dump_files (all_small_ipa_passes,
1074 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1076 register_dump_files (all_regular_ipa_passes,
1077 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1079 register_dump_files (all_lto_gen_passes,
1080 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1082 register_dump_files (all_passes,
1083 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1087 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
1088 function CALLBACK for every function in the call graph. Otherwise,
1089 call CALLBACK on the current function. */
1092 do_per_function (void (*callback) (void *data), void *data)
1094 if (current_function_decl)
1098 struct cgraph_node *node;
1099 for (node = cgraph_nodes; node; node = node->next)
1100 if (node->analyzed && gimple_has_body_p (node->decl)
1101 && (!node->clone_of || node->decl != node->clone_of->decl))
1103 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
1104 current_function_decl = node->decl;
1108 free_dominance_info (CDI_DOMINATORS);
1109 free_dominance_info (CDI_POST_DOMINATORS);
1111 current_function_decl = NULL;
1118 /* Because inlining might remove no-longer reachable nodes, we need to
1119 keep the array visible to garbage collector to avoid reading collected
1122 static GTY ((length ("nnodes"))) cgraph_node_ptr *order;
1124 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
1125 function CALLBACK for every function in the call graph. Otherwise,
1126 call CALLBACK on the current function.
1127 This function is global so that plugins can use it. */
1129 do_per_function_toporder (void (*callback) (void *data), void *data)
1133 if (current_function_decl)
1137 gcc_assert (!order);
1138 order = ggc_alloc_vec_cgraph_node_ptr (cgraph_n_nodes);
1139 nnodes = cgraph_postorder (order);
1140 for (i = nnodes - 1; i >= 0; i--)
1141 order[i]->process = 1;
1142 for (i = nnodes - 1; i >= 0; i--)
1144 struct cgraph_node *node = order[i];
1146 /* Allow possibly removed nodes to be garbage collected. */
1151 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
1152 current_function_decl = node->decl;
1154 free_dominance_info (CDI_DOMINATORS);
1155 free_dominance_info (CDI_POST_DOMINATORS);
1156 current_function_decl = NULL;
1167 /* Perform all TODO actions that ought to be done on each function. */
1170 execute_function_todo (void *data)
1172 unsigned int flags = (size_t)data;
1173 flags &= ~cfun->last_verified;
1177 /* Always cleanup the CFG before trying to update SSA. */
1178 if (flags & TODO_cleanup_cfg)
1180 bool cleanup = cleanup_tree_cfg ();
1182 if (cleanup && (cfun->curr_properties & PROP_ssa))
1183 flags |= TODO_remove_unused_locals;
1185 /* When cleanup_tree_cfg merges consecutive blocks, it may
1186 perform some simplistic propagation when removing single
1187 valued PHI nodes. This propagation may, in turn, cause the
1188 SSA form to become out-of-date (see PR 22037). So, even
1189 if the parent pass had not scheduled an SSA update, we may
1190 still need to do one. */
1191 if (!(flags & TODO_update_ssa_any) && need_ssa_update_p (cfun))
1192 flags |= TODO_update_ssa;
1195 if (flags & TODO_update_ssa_any)
1197 unsigned update_flags = flags & TODO_update_ssa_any;
1198 update_ssa (update_flags);
1199 cfun->last_verified &= ~TODO_verify_ssa;
1202 if (flags & TODO_rebuild_alias)
1204 execute_update_addresses_taken ();
1205 compute_may_aliases ();
1207 else if (optimize && (flags & TODO_update_address_taken))
1208 execute_update_addresses_taken ();
1210 if (flags & TODO_remove_unused_locals)
1211 remove_unused_locals ();
1213 if ((flags & TODO_dump_func) && dump_file && current_function_decl)
1215 if (cfun->curr_properties & PROP_trees)
1216 dump_function_to_file (current_function_decl, dump_file, dump_flags);
1219 if (dump_flags & TDF_SLIM)
1220 print_rtl_slim_with_bb (dump_file, get_insns (), dump_flags);
1221 else if ((cfun->curr_properties & PROP_cfg)
1222 && (dump_flags & TDF_BLOCKS))
1223 print_rtl_with_bb (dump_file, get_insns ());
1225 print_rtl (dump_file, get_insns ());
1227 if ((cfun->curr_properties & PROP_cfg)
1228 && graph_dump_format != no_graph
1229 && (dump_flags & TDF_GRAPH))
1230 print_rtl_graph_with_bb (dump_file_name, get_insns ());
1233 /* Flush the file. If verification fails, we won't be able to
1234 close the file before aborting. */
1238 if (flags & TODO_rebuild_frequencies)
1239 rebuild_frequencies ();
1241 /* If we've seen errors do not bother running any verifiers. */
1245 #if defined ENABLE_CHECKING
1246 if (flags & TODO_verify_ssa
1247 || (current_loops && loops_state_satisfies_p (LOOP_CLOSED_SSA)))
1249 if (flags & TODO_verify_flow)
1250 verify_flow_info ();
1251 if (flags & TODO_verify_stmts)
1253 if (current_loops && loops_state_satisfies_p (LOOP_CLOSED_SSA))
1254 verify_loop_closed_ssa (false);
1255 if (flags & TODO_verify_rtl_sharing)
1256 verify_rtl_sharing ();
1259 cfun->last_verified = flags & TODO_verify_all;
1262 /* Perform all TODO actions. */
1264 execute_todo (unsigned int flags)
1266 #if defined ENABLE_CHECKING
1268 && need_ssa_update_p (cfun))
1269 gcc_assert (flags & TODO_update_ssa_any);
1272 /* Inform the pass whether it is the first time it is run. */
1273 first_pass_instance = (flags & TODO_mark_first_instance) != 0;
1275 statistics_fini_pass ();
1277 do_per_function (execute_function_todo, (void *)(size_t) flags);
1279 /* Always remove functions just as before inlining: IPA passes might be
1280 interested to see bodies of extern inline functions that are not inlined
1281 to analyze side effects. The full removal is done just at the end
1282 of IPA pass queue. */
1283 if (flags & TODO_remove_functions)
1286 cgraph_remove_unreachable_nodes (true, dump_file);
1289 if ((flags & TODO_dump_cgraph) && dump_file && !current_function_decl)
1292 dump_cgraph (dump_file);
1293 /* Flush the file. If verification fails, we won't be able to
1294 close the file before aborting. */
1298 if (flags & TODO_ggc_collect)
1301 /* Now that the dumping has been done, we can get rid of the optional
1303 if (flags & TODO_df_finish)
1304 df_finish_pass ((flags & TODO_df_verify) != 0);
1307 /* Verify invariants that should hold between passes. This is a place
1308 to put simple sanity checks. */
1311 verify_interpass_invariants (void)
1313 gcc_checking_assert (!fold_deferring_overflow_warnings_p ());
1316 /* Clear the last verified flag. */
1319 clear_last_verified (void *data ATTRIBUTE_UNUSED)
1321 cfun->last_verified = 0;
1324 /* Helper function. Verify that the properties has been turn into the
1325 properties expected by the pass. */
1327 #ifdef ENABLE_CHECKING
1329 verify_curr_properties (void *data)
1331 unsigned int props = (size_t)data;
1332 gcc_assert ((cfun->curr_properties & props) == props);
1336 /* Initialize pass dump file. */
1337 /* This is non-static so that the plugins can use it. */
1340 pass_init_dump_file (struct opt_pass *pass)
1342 /* If a dump file name is present, open it if enabled. */
1343 if (pass->static_pass_number != -1)
1345 bool initializing_dump = !dump_initialized_p (pass->static_pass_number);
1346 dump_file_name = get_dump_file_name (pass->static_pass_number);
1347 dump_file = dump_begin (pass->static_pass_number, &dump_flags);
1348 if (dump_file && current_function_decl)
1350 const char *dname, *aname;
1351 struct cgraph_node *node = cgraph_node (current_function_decl);
1352 dname = lang_hooks.decl_printable_name (current_function_decl, 2);
1353 aname = (IDENTIFIER_POINTER
1354 (DECL_ASSEMBLER_NAME (current_function_decl)));
1355 fprintf (dump_file, "\n;; Function %s (%s)%s\n\n", dname, aname,
1356 node->frequency == NODE_FREQUENCY_HOT
1358 : node->frequency == NODE_FREQUENCY_UNLIKELY_EXECUTED
1359 ? " (unlikely executed)"
1360 : node->frequency == NODE_FREQUENCY_EXECUTED_ONCE
1361 ? " (executed once)"
1364 return initializing_dump;
1370 /* Flush PASS dump file. */
1371 /* This is non-static so that plugins can use it. */
1374 pass_fini_dump_file (struct opt_pass *pass)
1376 /* Flush and close dump file. */
1379 free (CONST_CAST (char *, dump_file_name));
1380 dump_file_name = NULL;
1385 dump_end (pass->static_pass_number, dump_file);
1390 /* After executing the pass, apply expected changes to the function
1394 update_properties_after_pass (void *data)
1396 struct opt_pass *pass = (struct opt_pass *) data;
1397 cfun->curr_properties = (cfun->curr_properties | pass->properties_provided)
1398 & ~pass->properties_destroyed;
1401 /* Execute summary generation for all of the passes in IPA_PASS. */
1404 execute_ipa_summary_passes (struct ipa_opt_pass_d *ipa_pass)
1408 struct opt_pass *pass = &ipa_pass->pass;
1410 /* Execute all of the IPA_PASSes in the list. */
1411 if (ipa_pass->pass.type == IPA_PASS
1412 && (!pass->gate || pass->gate ())
1413 && ipa_pass->generate_summary)
1415 pass_init_dump_file (pass);
1417 /* If a timevar is present, start it. */
1419 timevar_push (pass->tv_id);
1421 ipa_pass->generate_summary ();
1425 timevar_pop (pass->tv_id);
1427 pass_fini_dump_file (pass);
1429 ipa_pass = (struct ipa_opt_pass_d *)ipa_pass->pass.next;
1433 /* Execute IPA_PASS function transform on NODE. */
1436 execute_one_ipa_transform_pass (struct cgraph_node *node,
1437 struct ipa_opt_pass_d *ipa_pass)
1439 struct opt_pass *pass = &ipa_pass->pass;
1440 unsigned int todo_after = 0;
1442 current_pass = pass;
1443 if (!ipa_pass->function_transform)
1446 /* Note that the folders should only create gimple expressions.
1447 This is a hack until the new folder is ready. */
1448 in_gimple_form = (cfun && (cfun->curr_properties & PROP_trees)) != 0;
1450 pass_init_dump_file (pass);
1452 /* Run pre-pass verification. */
1453 execute_todo (ipa_pass->function_transform_todo_flags_start);
1455 /* If a timevar is present, start it. */
1456 if (pass->tv_id != TV_NONE)
1457 timevar_push (pass->tv_id);
1460 todo_after = ipa_pass->function_transform (node);
1463 if (pass->tv_id != TV_NONE)
1464 timevar_pop (pass->tv_id);
1466 /* Run post-pass cleanup and verification. */
1467 execute_todo (todo_after);
1468 verify_interpass_invariants ();
1470 pass_fini_dump_file (pass);
1472 current_pass = NULL;
1475 /* For the current function, execute all ipa transforms. */
1478 execute_all_ipa_transforms (void)
1480 struct cgraph_node *node;
1483 node = cgraph_node (current_function_decl);
1485 if (node->ipa_transforms_to_apply)
1489 for (i = 0; i < VEC_length (ipa_opt_pass, node->ipa_transforms_to_apply);
1491 execute_one_ipa_transform_pass (node,
1492 VEC_index (ipa_opt_pass,
1493 node->ipa_transforms_to_apply,
1495 VEC_free (ipa_opt_pass, heap, node->ipa_transforms_to_apply);
1496 node->ipa_transforms_to_apply = NULL;
1503 execute_one_pass (struct opt_pass *pass)
1505 bool initializing_dump;
1506 unsigned int todo_after = 0;
1510 /* IPA passes are executed on whole program, so cfun should be NULL.
1511 Other passes need function context set. */
1512 if (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS)
1513 gcc_assert (!cfun && !current_function_decl);
1515 gcc_assert (cfun && current_function_decl);
1517 current_pass = pass;
1519 /* Check whether gate check should be avoided.
1520 User controls the value of the gate through the parameter "gate_status". */
1521 gate_status = (pass->gate == NULL) ? true : pass->gate();
1523 /* Override gate with plugin. */
1524 invoke_plugin_callbacks (PLUGIN_OVERRIDE_GATE, &gate_status);
1528 current_pass = NULL;
1532 /* Pass execution event trigger: useful to identify passes being
1534 invoke_plugin_callbacks (PLUGIN_PASS_EXECUTION, pass);
1536 if (!quiet_flag && !cfun)
1537 fprintf (stderr, " <%s>", pass->name ? pass->name : "");
1539 /* Note that the folders should only create gimple expressions.
1540 This is a hack until the new folder is ready. */
1541 in_gimple_form = (cfun && (cfun->curr_properties & PROP_trees)) != 0;
1543 initializing_dump = pass_init_dump_file (pass);
1545 /* Run pre-pass verification. */
1546 execute_todo (pass->todo_flags_start);
1548 #ifdef ENABLE_CHECKING
1549 do_per_function (verify_curr_properties,
1550 (void *)(size_t)pass->properties_required);
1553 /* If a timevar is present, start it. */
1554 if (pass->tv_id != TV_NONE)
1555 timevar_push (pass->tv_id);
1560 todo_after = pass->execute ();
1561 do_per_function (clear_last_verified, NULL);
1565 if (pass->tv_id != TV_NONE)
1566 timevar_pop (pass->tv_id);
1568 do_per_function (update_properties_after_pass, pass);
1570 if (initializing_dump
1572 && graph_dump_format != no_graph
1574 && (cfun->curr_properties & (PROP_cfg | PROP_rtl))
1575 == (PROP_cfg | PROP_rtl))
1577 get_dump_file_info (pass->static_pass_number)->flags |= TDF_GRAPH;
1578 dump_flags |= TDF_GRAPH;
1579 clean_graph_dump_file (dump_file_name);
1582 /* Run post-pass cleanup and verification. */
1583 execute_todo (todo_after | pass->todo_flags_finish);
1584 verify_interpass_invariants ();
1585 if (pass->type == IPA_PASS)
1587 struct cgraph_node *node;
1588 for (node = cgraph_nodes; node; node = node->next)
1590 VEC_safe_push (ipa_opt_pass, heap, node->ipa_transforms_to_apply,
1591 (struct ipa_opt_pass_d *)pass);
1594 if (!current_function_decl)
1595 cgraph_process_new_functions ();
1597 pass_fini_dump_file (pass);
1599 if (pass->type != SIMPLE_IPA_PASS && pass->type != IPA_PASS)
1600 gcc_assert (!(cfun->curr_properties & PROP_trees)
1601 || pass->type != RTL_PASS);
1603 current_pass = NULL;
1609 execute_pass_list (struct opt_pass *pass)
1613 gcc_assert (pass->type == GIMPLE_PASS
1614 || pass->type == RTL_PASS);
1615 if (execute_one_pass (pass) && pass->sub)
1616 execute_pass_list (pass->sub);
1622 /* Same as execute_pass_list but assume that subpasses of IPA passes
1623 are local passes. If SET is not NULL, write out summaries of only
1624 those node in SET. */
1627 ipa_write_summaries_2 (struct opt_pass *pass, cgraph_node_set set,
1628 varpool_node_set vset,
1629 struct lto_out_decl_state *state)
1633 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *)pass;
1634 gcc_assert (!current_function_decl);
1636 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
1637 if (pass->type == IPA_PASS
1638 && ipa_pass->write_summary
1639 && (!pass->gate || pass->gate ()))
1641 /* If a timevar is present, start it. */
1643 timevar_push (pass->tv_id);
1645 pass_init_dump_file (pass);
1647 ipa_pass->write_summary (set,vset);
1649 pass_fini_dump_file (pass);
1651 /* If a timevar is present, start it. */
1653 timevar_pop (pass->tv_id);
1656 if (pass->sub && pass->sub->type != GIMPLE_PASS)
1657 ipa_write_summaries_2 (pass->sub, set, vset, state);
1663 /* Helper function of ipa_write_summaries. Creates and destroys the
1664 decl state and calls ipa_write_summaries_2 for all passes that have
1665 summaries. SET is the set of nodes to be written. */
1668 ipa_write_summaries_1 (cgraph_node_set set, varpool_node_set vset)
1670 struct lto_out_decl_state *state = lto_new_out_decl_state ();
1671 compute_ltrans_boundary (state, set, vset);
1673 lto_push_out_decl_state (state);
1675 gcc_assert (!flag_wpa);
1676 ipa_write_summaries_2 (all_regular_ipa_passes, set, vset, state);
1677 ipa_write_summaries_2 (all_lto_gen_passes, set, vset, state);
1679 gcc_assert (lto_get_out_decl_state () == state);
1680 lto_pop_out_decl_state ();
1681 lto_delete_out_decl_state (state);
1684 /* Write out summaries for all the nodes in the callgraph. */
1687 ipa_write_summaries (void)
1689 cgraph_node_set set;
1690 varpool_node_set vset;
1691 struct cgraph_node **order;
1692 struct varpool_node *vnode;
1695 if (!flag_generate_lto || seen_error ())
1698 set = cgraph_node_set_new ();
1700 /* Create the callgraph set in the same order used in
1701 cgraph_expand_all_functions. This mostly facilitates debugging,
1702 since it causes the gimple file to be processed in the same order
1703 as the source code. */
1704 order = XCNEWVEC (struct cgraph_node *, cgraph_n_nodes);
1705 order_pos = cgraph_postorder (order);
1706 gcc_assert (order_pos == cgraph_n_nodes);
1708 for (i = order_pos - 1; i >= 0; i--)
1710 struct cgraph_node *node = order[i];
1714 /* When streaming out references to statements as part of some IPA
1715 pass summary, the statements need to have uids assigned and the
1716 following does that for all the IPA passes here. Naturally, this
1717 ordering then matches the one IPA-passes get in their stmt_fixup
1720 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
1721 renumber_gimple_stmt_uids ();
1725 cgraph_node_set_add (set, node);
1727 vset = varpool_node_set_new ();
1729 for (vnode = varpool_nodes; vnode; vnode = vnode->next)
1730 if (vnode->needed && !vnode->alias)
1731 varpool_node_set_add (vset, vnode);
1733 ipa_write_summaries_1 (set, vset);
1740 /* Same as execute_pass_list but assume that subpasses of IPA passes
1741 are local passes. If SET is not NULL, write out optimization summaries of
1742 only those node in SET. */
1745 ipa_write_optimization_summaries_1 (struct opt_pass *pass, cgraph_node_set set,
1746 varpool_node_set vset,
1747 struct lto_out_decl_state *state)
1751 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *)pass;
1752 gcc_assert (!current_function_decl);
1754 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
1755 if (pass->type == IPA_PASS
1756 && ipa_pass->write_optimization_summary
1757 && (!pass->gate || pass->gate ()))
1759 /* If a timevar is present, start it. */
1761 timevar_push (pass->tv_id);
1763 pass_init_dump_file (pass);
1765 ipa_pass->write_optimization_summary (set, vset);
1767 pass_fini_dump_file (pass);
1769 /* If a timevar is present, start it. */
1771 timevar_pop (pass->tv_id);
1774 if (pass->sub && pass->sub->type != GIMPLE_PASS)
1775 ipa_write_optimization_summaries_1 (pass->sub, set, vset, state);
1781 /* Write all the optimization summaries for the cgraph nodes in SET. If SET is
1782 NULL, write out all summaries of all nodes. */
1785 ipa_write_optimization_summaries (cgraph_node_set set, varpool_node_set vset)
1787 struct lto_out_decl_state *state = lto_new_out_decl_state ();
1788 cgraph_node_set_iterator csi;
1789 compute_ltrans_boundary (state, set, vset);
1791 lto_push_out_decl_state (state);
1792 for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi))
1794 struct cgraph_node *node = csi_node (csi);
1795 /* When streaming out references to statements as part of some IPA
1796 pass summary, the statements need to have uids assigned.
1798 For functions newly born at WPA stage we need to initialize
1801 && gimple_has_body_p (node->decl))
1803 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
1804 renumber_gimple_stmt_uids ();
1809 gcc_assert (flag_wpa);
1810 ipa_write_optimization_summaries_1 (all_regular_ipa_passes, set, vset, state);
1811 ipa_write_optimization_summaries_1 (all_lto_gen_passes, set, vset, state);
1813 gcc_assert (lto_get_out_decl_state () == state);
1814 lto_pop_out_decl_state ();
1815 lto_delete_out_decl_state (state);
1818 /* Same as execute_pass_list but assume that subpasses of IPA passes
1819 are local passes. */
1822 ipa_read_summaries_1 (struct opt_pass *pass)
1826 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *) pass;
1828 gcc_assert (!current_function_decl);
1830 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
1832 if (pass->gate == NULL || pass->gate ())
1834 if (pass->type == IPA_PASS && ipa_pass->read_summary)
1836 /* If a timevar is present, start it. */
1838 timevar_push (pass->tv_id);
1840 pass_init_dump_file (pass);
1842 ipa_pass->read_summary ();
1844 pass_fini_dump_file (pass);
1848 timevar_pop (pass->tv_id);
1851 if (pass->sub && pass->sub->type != GIMPLE_PASS)
1852 ipa_read_summaries_1 (pass->sub);
1859 /* Read all the summaries for all_regular_ipa_passes and all_lto_gen_passes. */
1862 ipa_read_summaries (void)
1864 ipa_read_summaries_1 (all_regular_ipa_passes);
1865 ipa_read_summaries_1 (all_lto_gen_passes);
1868 /* Same as execute_pass_list but assume that subpasses of IPA passes
1869 are local passes. */
1872 ipa_read_optimization_summaries_1 (struct opt_pass *pass)
1876 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *) pass;
1878 gcc_assert (!current_function_decl);
1880 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
1882 if (pass->gate == NULL || pass->gate ())
1884 if (pass->type == IPA_PASS && ipa_pass->read_optimization_summary)
1886 /* If a timevar is present, start it. */
1888 timevar_push (pass->tv_id);
1890 pass_init_dump_file (pass);
1892 ipa_pass->read_optimization_summary ();
1894 pass_fini_dump_file (pass);
1898 timevar_pop (pass->tv_id);
1901 if (pass->sub && pass->sub->type != GIMPLE_PASS)
1902 ipa_read_optimization_summaries_1 (pass->sub);
1908 /* Read all the summaries for all_regular_ipa_passes and all_lto_gen_passes. */
1911 ipa_read_optimization_summaries (void)
1913 ipa_read_optimization_summaries_1 (all_regular_ipa_passes);
1914 ipa_read_optimization_summaries_1 (all_lto_gen_passes);
1917 /* Same as execute_pass_list but assume that subpasses of IPA passes
1918 are local passes. */
1920 execute_ipa_pass_list (struct opt_pass *pass)
1924 gcc_assert (!current_function_decl);
1926 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
1927 if (execute_one_pass (pass) && pass->sub)
1929 if (pass->sub->type == GIMPLE_PASS)
1931 invoke_plugin_callbacks (PLUGIN_EARLY_GIMPLE_PASSES_START, NULL);
1932 do_per_function_toporder ((void (*)(void *))execute_pass_list,
1934 invoke_plugin_callbacks (PLUGIN_EARLY_GIMPLE_PASSES_END, NULL);
1936 else if (pass->sub->type == SIMPLE_IPA_PASS
1937 || pass->sub->type == IPA_PASS)
1938 execute_ipa_pass_list (pass->sub);
1942 gcc_assert (!current_function_decl);
1943 cgraph_process_new_functions ();
1949 /* Execute stmt fixup hooks of all passes in PASS for NODE and STMTS. */
1952 execute_ipa_stmt_fixups (struct opt_pass *pass,
1953 struct cgraph_node *node, gimple *stmts)
1957 /* Execute all of the IPA_PASSes in the list. */
1958 if (pass->type == IPA_PASS
1959 && (!pass->gate || pass->gate ()))
1961 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *) pass;
1963 if (ipa_pass->stmt_fixup)
1965 pass_init_dump_file (pass);
1966 /* If a timevar is present, start it. */
1968 timevar_push (pass->tv_id);
1970 ipa_pass->stmt_fixup (node, stmts);
1974 timevar_pop (pass->tv_id);
1975 pass_fini_dump_file (pass);
1978 execute_ipa_stmt_fixups (pass->sub, node, stmts);
1984 /* Execute stmt fixup hooks of all IPA passes for NODE and STMTS. */
1987 execute_all_ipa_stmt_fixups (struct cgraph_node *node, gimple *stmts)
1989 execute_ipa_stmt_fixups (all_regular_ipa_passes, node, stmts);
1993 extern void debug_properties (unsigned int);
1994 extern void dump_properties (FILE *, unsigned int);
1997 dump_properties (FILE *dump, unsigned int props)
1999 fprintf (dump, "Properties:\n");
2000 if (props & PROP_gimple_any)
2001 fprintf (dump, "PROP_gimple_any\n");
2002 if (props & PROP_gimple_lcf)
2003 fprintf (dump, "PROP_gimple_lcf\n");
2004 if (props & PROP_gimple_leh)
2005 fprintf (dump, "PROP_gimple_leh\n");
2006 if (props & PROP_cfg)
2007 fprintf (dump, "PROP_cfg\n");
2008 if (props & PROP_referenced_vars)
2009 fprintf (dump, "PROP_referenced_vars\n");
2010 if (props & PROP_ssa)
2011 fprintf (dump, "PROP_ssa\n");
2012 if (props & PROP_no_crit_edges)
2013 fprintf (dump, "PROP_no_crit_edges\n");
2014 if (props & PROP_rtl)
2015 fprintf (dump, "PROP_rtl\n");
2016 if (props & PROP_gimple_lomp)
2017 fprintf (dump, "PROP_gimple_lomp\n");
2018 if (props & PROP_gimple_lcx)
2019 fprintf (dump, "PROP_gimple_lcx\n");
2020 if (props & PROP_cfglayout)
2021 fprintf (dump, "PROP_cfglayout\n");
2025 debug_properties (unsigned int props)
2027 dump_properties (stderr, props);
2030 /* Called by local passes to see if function is called by already processed nodes.
2031 Because we process nodes in topological order, this means that function is
2032 in recursive cycle or we introduced new direct calls. */
2034 function_called_by_processed_nodes_p (void)
2036 struct cgraph_edge *e;
2037 for (e = cgraph_node (current_function_decl)->callers; e; e = e->next_caller)
2039 if (e->caller->decl == current_function_decl)
2041 if (!e->caller->analyzed)
2043 if (TREE_ASM_WRITTEN (e->caller->decl))
2045 if (!e->caller->process && !e->caller->global.inlined_to)
2050 fprintf (dump_file, "Already processed call to:\n");
2051 dump_cgraph_node (dump_file, e->caller);
2056 #include "gt-passes.h"