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_ipa_early_inline);
751 struct opt_pass **p = &pass_ipa_early_inline.pass.sub;
752 NEXT_PASS (pass_early_inline);
753 NEXT_PASS (pass_inline_parameters);
754 NEXT_PASS (pass_rebuild_cgraph_edges);
756 NEXT_PASS (pass_early_local_passes);
758 struct opt_pass **p = &pass_early_local_passes.pass.sub;
759 NEXT_PASS (pass_fixup_cfg);
760 NEXT_PASS (pass_tree_profile);
761 NEXT_PASS (pass_init_datastructures);
762 NEXT_PASS (pass_expand_omp);
764 NEXT_PASS (pass_referenced_vars);
765 NEXT_PASS (pass_build_ssa);
766 NEXT_PASS (pass_early_warn_uninitialized);
767 /* Note that it is not strictly necessary to schedule an early
768 inline pass here. However, some test cases (e.g.,
769 g++.dg/other/p334435.C g++.dg/other/i386-1.C) expect extern
770 inline functions to be inlined even at -O0. This does not
771 happen during the first early inline pass. */
772 NEXT_PASS (pass_rebuild_cgraph_edges);
773 NEXT_PASS (pass_early_inline);
774 NEXT_PASS (pass_all_early_optimizations);
776 struct opt_pass **p = &pass_all_early_optimizations.pass.sub;
777 NEXT_PASS (pass_remove_cgraph_callee_edges);
778 NEXT_PASS (pass_rename_ssa_copies);
779 NEXT_PASS (pass_ccp);
780 NEXT_PASS (pass_forwprop);
781 /* pass_build_ealias is a dummy pass that ensures that we
782 execute TODO_rebuild_alias at this point. Re-building
783 alias information also rewrites no longer addressed
784 locals into SSA form if possible. */
785 NEXT_PASS (pass_build_ealias);
786 NEXT_PASS (pass_sra_early);
787 NEXT_PASS (pass_copy_prop);
788 NEXT_PASS (pass_merge_phi);
789 NEXT_PASS (pass_cd_dce);
790 NEXT_PASS (pass_early_ipa_sra);
791 NEXT_PASS (pass_tail_recursion);
792 NEXT_PASS (pass_convert_switch);
793 NEXT_PASS (pass_cleanup_eh);
794 NEXT_PASS (pass_profile);
795 NEXT_PASS (pass_local_pure_const);
796 /* Split functions creates parts that are not run through
797 early optimizations again. It is thus good idea to do this
799 NEXT_PASS (pass_split_functions);
801 NEXT_PASS (pass_release_ssa_names);
802 NEXT_PASS (pass_rebuild_cgraph_edges);
803 NEXT_PASS (pass_inline_parameters);
805 NEXT_PASS (pass_ipa_increase_alignment);
806 NEXT_PASS (pass_ipa_matrix_reorg);
807 NEXT_PASS (pass_ipa_lower_emutls);
810 p = &all_regular_ipa_passes;
811 NEXT_PASS (pass_ipa_whole_program_visibility);
812 NEXT_PASS (pass_ipa_profile);
813 NEXT_PASS (pass_ipa_cp);
814 NEXT_PASS (pass_ipa_cdtor_merge);
815 NEXT_PASS (pass_ipa_inline);
816 NEXT_PASS (pass_ipa_pure_const);
817 NEXT_PASS (pass_ipa_reference);
818 NEXT_PASS (pass_ipa_type_escape);
819 NEXT_PASS (pass_ipa_pta);
820 NEXT_PASS (pass_ipa_struct_reorg);
823 p = &all_lto_gen_passes;
824 NEXT_PASS (pass_ipa_lto_gimple_out);
825 NEXT_PASS (pass_ipa_lto_finish_out); /* This must be the last LTO pass. */
828 /* These passes are run after IPA passes on every function that is being
829 output to the assembler file. */
831 NEXT_PASS (pass_lower_eh_dispatch);
832 NEXT_PASS (pass_all_optimizations);
834 struct opt_pass **p = &pass_all_optimizations.pass.sub;
835 NEXT_PASS (pass_remove_cgraph_callee_edges);
836 /* Initial scalar cleanups before alias computation.
837 They ensure memory accesses are not indirect wherever possible. */
838 NEXT_PASS (pass_strip_predict_hints);
839 NEXT_PASS (pass_rename_ssa_copies);
840 NEXT_PASS (pass_complete_unrolli);
841 NEXT_PASS (pass_ccp);
842 NEXT_PASS (pass_forwprop);
843 NEXT_PASS (pass_call_cdce);
844 /* pass_build_alias is a dummy pass that ensures that we
845 execute TODO_rebuild_alias at this point. Re-building
846 alias information also rewrites no longer addressed
847 locals into SSA form if possible. */
848 NEXT_PASS (pass_build_alias);
849 NEXT_PASS (pass_return_slot);
850 NEXT_PASS (pass_phiprop);
851 NEXT_PASS (pass_fre);
852 NEXT_PASS (pass_copy_prop);
853 NEXT_PASS (pass_merge_phi);
854 NEXT_PASS (pass_vrp);
855 NEXT_PASS (pass_dce);
856 NEXT_PASS (pass_cselim);
857 NEXT_PASS (pass_tree_ifcombine);
858 NEXT_PASS (pass_phiopt);
859 NEXT_PASS (pass_tail_recursion);
861 NEXT_PASS (pass_stdarg);
862 NEXT_PASS (pass_lower_complex);
863 NEXT_PASS (pass_sra);
864 NEXT_PASS (pass_rename_ssa_copies);
865 /* The dom pass will also resolve all __builtin_constant_p calls
866 that are still there to 0. This has to be done after some
867 propagations have already run, but before some more dead code
868 is removed, and this place fits nicely. Remember this when
869 trying to move or duplicate pass_dominator somewhere earlier. */
870 NEXT_PASS (pass_dominator);
871 /* The only const/copy propagation opportunities left after
872 DOM should be due to degenerate PHI nodes. So rather than
873 run the full propagators, run a specialized pass which
874 only examines PHIs to discover const/copy propagation
876 NEXT_PASS (pass_phi_only_cprop);
877 NEXT_PASS (pass_dse);
878 NEXT_PASS (pass_reassoc);
879 NEXT_PASS (pass_dce);
880 NEXT_PASS (pass_forwprop);
881 NEXT_PASS (pass_phiopt);
882 NEXT_PASS (pass_object_sizes);
883 NEXT_PASS (pass_ccp);
884 NEXT_PASS (pass_copy_prop);
885 NEXT_PASS (pass_cse_sincos);
886 NEXT_PASS (pass_optimize_bswap);
887 NEXT_PASS (pass_split_crit_edges);
888 NEXT_PASS (pass_pre);
889 NEXT_PASS (pass_sink_code);
890 NEXT_PASS (pass_tree_loop);
892 struct opt_pass **p = &pass_tree_loop.pass.sub;
893 NEXT_PASS (pass_tree_loop_init);
894 NEXT_PASS (pass_lim);
895 NEXT_PASS (pass_copy_prop);
896 NEXT_PASS (pass_dce_loop);
897 NEXT_PASS (pass_tree_unswitch);
898 NEXT_PASS (pass_scev_cprop);
899 NEXT_PASS (pass_record_bounds);
900 NEXT_PASS (pass_check_data_deps);
901 NEXT_PASS (pass_loop_distribution);
902 NEXT_PASS (pass_linear_transform);
903 NEXT_PASS (pass_copy_prop);
904 NEXT_PASS (pass_graphite);
906 struct opt_pass **p = &pass_graphite.pass.sub;
907 NEXT_PASS (pass_copy_prop);
908 NEXT_PASS (pass_graphite_transforms);
909 NEXT_PASS (pass_copy_prop);
910 NEXT_PASS (pass_dce_loop);
911 NEXT_PASS (pass_lim);
913 NEXT_PASS (pass_iv_canon);
914 NEXT_PASS (pass_if_conversion);
915 NEXT_PASS (pass_vectorize);
917 struct opt_pass **p = &pass_vectorize.pass.sub;
918 NEXT_PASS (pass_lower_vector_ssa);
919 NEXT_PASS (pass_dce_loop);
921 NEXT_PASS (pass_predcom);
922 NEXT_PASS (pass_complete_unroll);
923 NEXT_PASS (pass_slp_vectorize);
924 NEXT_PASS (pass_parallelize_loops);
925 NEXT_PASS (pass_loop_prefetch);
926 NEXT_PASS (pass_iv_optimize);
927 NEXT_PASS (pass_tree_loop_done);
929 NEXT_PASS (pass_cse_reciprocals);
930 NEXT_PASS (pass_reassoc);
931 NEXT_PASS (pass_vrp);
932 NEXT_PASS (pass_dominator);
933 /* The only const/copy propagation opportunities left after
934 DOM should be due to degenerate PHI nodes. So rather than
935 run the full propagators, run a specialized pass which
936 only examines PHIs to discover const/copy propagation
938 NEXT_PASS (pass_phi_only_cprop);
939 NEXT_PASS (pass_cd_dce);
940 NEXT_PASS (pass_tracer);
942 /* FIXME: If DCE is not run before checking for uninitialized uses,
943 we may get false warnings (e.g., testsuite/gcc.dg/uninit-5.c).
944 However, this also causes us to misdiagnose cases that should be
945 real warnings (e.g., testsuite/gcc.dg/pr18501.c).
947 To fix the false positives in uninit-5.c, we would have to
948 account for the predicates protecting the set and the use of each
949 variable. Using a representation like Gated Single Assignment
951 NEXT_PASS (pass_late_warn_uninitialized);
952 NEXT_PASS (pass_dse);
953 NEXT_PASS (pass_forwprop);
954 NEXT_PASS (pass_phiopt);
955 NEXT_PASS (pass_fold_builtins);
956 NEXT_PASS (pass_optimize_widening_mul);
957 NEXT_PASS (pass_tail_calls);
958 NEXT_PASS (pass_rename_ssa_copies);
959 NEXT_PASS (pass_uncprop);
960 NEXT_PASS (pass_local_pure_const);
962 NEXT_PASS (pass_lower_complex_O0);
963 NEXT_PASS (pass_cleanup_eh);
964 NEXT_PASS (pass_lower_resx);
965 NEXT_PASS (pass_nrv);
966 NEXT_PASS (pass_mudflap_2);
967 NEXT_PASS (pass_cleanup_cfg_post_optimizing);
968 NEXT_PASS (pass_warn_function_noreturn);
970 NEXT_PASS (pass_expand);
972 NEXT_PASS (pass_rest_of_compilation);
974 struct opt_pass **p = &pass_rest_of_compilation.pass.sub;
975 NEXT_PASS (pass_init_function);
976 NEXT_PASS (pass_jump);
977 NEXT_PASS (pass_rtl_eh);
978 NEXT_PASS (pass_initial_value_sets);
979 NEXT_PASS (pass_unshare_all_rtl);
980 NEXT_PASS (pass_instantiate_virtual_regs);
981 NEXT_PASS (pass_into_cfg_layout_mode);
982 NEXT_PASS (pass_jump2);
983 NEXT_PASS (pass_lower_subreg);
984 NEXT_PASS (pass_df_initialize_opt);
985 NEXT_PASS (pass_cse);
986 NEXT_PASS (pass_rtl_fwprop);
987 NEXT_PASS (pass_rtl_cprop);
988 NEXT_PASS (pass_rtl_pre);
989 NEXT_PASS (pass_rtl_hoist);
990 NEXT_PASS (pass_rtl_cprop);
991 NEXT_PASS (pass_rtl_store_motion);
992 NEXT_PASS (pass_cse_after_global_opts);
993 NEXT_PASS (pass_rtl_ifcvt);
994 NEXT_PASS (pass_reginfo_init);
995 /* Perform loop optimizations. It might be better to do them a bit
996 sooner, but we want the profile feedback to work more
998 NEXT_PASS (pass_loop2);
1000 struct opt_pass **p = &pass_loop2.pass.sub;
1001 NEXT_PASS (pass_rtl_loop_init);
1002 NEXT_PASS (pass_rtl_move_loop_invariants);
1003 NEXT_PASS (pass_rtl_unswitch);
1004 NEXT_PASS (pass_rtl_unroll_and_peel_loops);
1005 NEXT_PASS (pass_rtl_doloop);
1006 NEXT_PASS (pass_rtl_loop_done);
1009 NEXT_PASS (pass_web);
1010 NEXT_PASS (pass_rtl_cprop);
1011 NEXT_PASS (pass_cse2);
1012 NEXT_PASS (pass_rtl_dse1);
1013 NEXT_PASS (pass_rtl_fwprop_addr);
1014 NEXT_PASS (pass_inc_dec);
1015 NEXT_PASS (pass_initialize_regs);
1016 NEXT_PASS (pass_ud_rtl_dce);
1017 NEXT_PASS (pass_combine);
1018 NEXT_PASS (pass_if_after_combine);
1019 NEXT_PASS (pass_partition_blocks);
1020 NEXT_PASS (pass_regmove);
1021 NEXT_PASS (pass_outof_cfg_layout_mode);
1022 NEXT_PASS (pass_split_all_insns);
1023 NEXT_PASS (pass_lower_subreg2);
1024 NEXT_PASS (pass_df_initialize_no_opt);
1025 NEXT_PASS (pass_stack_ptr_mod);
1026 NEXT_PASS (pass_mode_switching);
1027 NEXT_PASS (pass_match_asm_constraints);
1028 NEXT_PASS (pass_sms);
1029 NEXT_PASS (pass_sched);
1030 NEXT_PASS (pass_ira);
1031 NEXT_PASS (pass_postreload);
1033 struct opt_pass **p = &pass_postreload.pass.sub;
1034 NEXT_PASS (pass_postreload_cse);
1035 NEXT_PASS (pass_gcse2);
1036 NEXT_PASS (pass_split_after_reload);
1037 NEXT_PASS (pass_implicit_zee);
1038 NEXT_PASS (pass_branch_target_load_optimize1);
1039 NEXT_PASS (pass_thread_prologue_and_epilogue);
1040 NEXT_PASS (pass_rtl_dse2);
1041 NEXT_PASS (pass_stack_adjustments);
1042 NEXT_PASS (pass_peephole2);
1043 NEXT_PASS (pass_if_after_reload);
1044 NEXT_PASS (pass_regrename);
1045 NEXT_PASS (pass_cprop_hardreg);
1046 NEXT_PASS (pass_fast_rtl_dce);
1047 NEXT_PASS (pass_reorder_blocks);
1048 NEXT_PASS (pass_branch_target_load_optimize2);
1049 NEXT_PASS (pass_leaf_regs);
1050 NEXT_PASS (pass_split_before_sched2);
1051 NEXT_PASS (pass_sched2);
1052 NEXT_PASS (pass_stack_regs);
1054 struct opt_pass **p = &pass_stack_regs.pass.sub;
1055 NEXT_PASS (pass_split_before_regstack);
1056 NEXT_PASS (pass_stack_regs_run);
1058 NEXT_PASS (pass_compute_alignments);
1059 NEXT_PASS (pass_duplicate_computed_gotos);
1060 NEXT_PASS (pass_variable_tracking);
1061 NEXT_PASS (pass_free_cfg);
1062 NEXT_PASS (pass_machine_reorg);
1063 NEXT_PASS (pass_cleanup_barriers);
1064 NEXT_PASS (pass_delay_slots);
1065 NEXT_PASS (pass_split_for_shorten_branches);
1066 NEXT_PASS (pass_convert_to_eh_region_ranges);
1067 NEXT_PASS (pass_shorten_branches);
1068 NEXT_PASS (pass_set_nothrow_function_flags);
1069 NEXT_PASS (pass_final);
1071 NEXT_PASS (pass_df_finish);
1073 NEXT_PASS (pass_clean_state);
1078 /* Register the passes with the tree dump code. */
1079 register_dump_files (all_lowering_passes, PROP_gimple_any);
1080 register_dump_files (all_small_ipa_passes,
1081 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1083 register_dump_files (all_regular_ipa_passes,
1084 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1086 register_dump_files (all_lto_gen_passes,
1087 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1089 register_dump_files (all_passes,
1090 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1094 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
1095 function CALLBACK for every function in the call graph. Otherwise,
1096 call CALLBACK on the current function. */
1099 do_per_function (void (*callback) (void *data), void *data)
1101 if (current_function_decl)
1105 struct cgraph_node *node;
1106 for (node = cgraph_nodes; node; node = node->next)
1107 if (node->analyzed && gimple_has_body_p (node->decl)
1108 && (!node->clone_of || node->decl != node->clone_of->decl))
1110 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
1111 current_function_decl = node->decl;
1115 free_dominance_info (CDI_DOMINATORS);
1116 free_dominance_info (CDI_POST_DOMINATORS);
1118 current_function_decl = NULL;
1125 /* Because inlining might remove no-longer reachable nodes, we need to
1126 keep the array visible to garbage collector to avoid reading collected
1129 static GTY ((length ("nnodes"))) cgraph_node_ptr *order;
1131 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
1132 function CALLBACK for every function in the call graph. Otherwise,
1133 call CALLBACK on the current function.
1134 This function is global so that plugins can use it. */
1136 do_per_function_toporder (void (*callback) (void *data), void *data)
1140 if (current_function_decl)
1144 gcc_assert (!order);
1145 order = ggc_alloc_vec_cgraph_node_ptr (cgraph_n_nodes);
1146 nnodes = cgraph_postorder (order);
1147 for (i = nnodes - 1; i >= 0; i--)
1148 order[i]->process = 1;
1149 for (i = nnodes - 1; i >= 0; i--)
1151 struct cgraph_node *node = order[i];
1153 /* Allow possibly removed nodes to be garbage collected. */
1158 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
1159 current_function_decl = node->decl;
1161 free_dominance_info (CDI_DOMINATORS);
1162 free_dominance_info (CDI_POST_DOMINATORS);
1163 current_function_decl = NULL;
1174 /* Perform all TODO actions that ought to be done on each function. */
1177 execute_function_todo (void *data)
1179 unsigned int flags = (size_t)data;
1180 flags &= ~cfun->last_verified;
1184 /* Always cleanup the CFG before trying to update SSA. */
1185 if (flags & TODO_cleanup_cfg)
1187 bool cleanup = cleanup_tree_cfg ();
1189 if (cleanup && (cfun->curr_properties & PROP_ssa))
1190 flags |= TODO_remove_unused_locals;
1192 /* When cleanup_tree_cfg merges consecutive blocks, it may
1193 perform some simplistic propagation when removing single
1194 valued PHI nodes. This propagation may, in turn, cause the
1195 SSA form to become out-of-date (see PR 22037). So, even
1196 if the parent pass had not scheduled an SSA update, we may
1197 still need to do one. */
1198 if (!(flags & TODO_update_ssa_any) && need_ssa_update_p (cfun))
1199 flags |= TODO_update_ssa;
1202 if (flags & TODO_update_ssa_any)
1204 unsigned update_flags = flags & TODO_update_ssa_any;
1205 update_ssa (update_flags);
1206 cfun->last_verified &= ~TODO_verify_ssa;
1209 if (flags & TODO_rebuild_alias)
1211 execute_update_addresses_taken ();
1212 compute_may_aliases ();
1214 else if (optimize && (flags & TODO_update_address_taken))
1215 execute_update_addresses_taken ();
1217 if (flags & TODO_remove_unused_locals)
1218 remove_unused_locals ();
1220 if ((flags & TODO_dump_func) && dump_file && current_function_decl)
1222 if (cfun->curr_properties & PROP_trees)
1223 dump_function_to_file (current_function_decl, dump_file, dump_flags);
1226 if (dump_flags & TDF_SLIM)
1227 print_rtl_slim_with_bb (dump_file, get_insns (), dump_flags);
1228 else if ((cfun->curr_properties & PROP_cfg)
1229 && (dump_flags & TDF_BLOCKS))
1230 print_rtl_with_bb (dump_file, get_insns ());
1232 print_rtl (dump_file, get_insns ());
1234 if ((cfun->curr_properties & PROP_cfg)
1235 && graph_dump_format != no_graph
1236 && (dump_flags & TDF_GRAPH))
1237 print_rtl_graph_with_bb (dump_file_name, get_insns ());
1240 /* Flush the file. If verification fails, we won't be able to
1241 close the file before aborting. */
1245 if (flags & TODO_rebuild_frequencies)
1246 rebuild_frequencies ();
1248 /* If we've seen errors do not bother running any verifiers. */
1252 #if defined ENABLE_CHECKING
1253 if (flags & TODO_verify_ssa
1254 || (current_loops && loops_state_satisfies_p (LOOP_CLOSED_SSA)))
1256 if (flags & TODO_verify_flow)
1257 verify_flow_info ();
1258 if (flags & TODO_verify_stmts)
1260 if (current_loops && loops_state_satisfies_p (LOOP_CLOSED_SSA))
1261 verify_loop_closed_ssa (false);
1262 if (flags & TODO_verify_rtl_sharing)
1263 verify_rtl_sharing ();
1266 cfun->last_verified = flags & TODO_verify_all;
1269 /* Perform all TODO actions. */
1271 execute_todo (unsigned int flags)
1273 #if defined ENABLE_CHECKING
1275 && need_ssa_update_p (cfun))
1276 gcc_assert (flags & TODO_update_ssa_any);
1279 /* Inform the pass whether it is the first time it is run. */
1280 first_pass_instance = (flags & TODO_mark_first_instance) != 0;
1282 statistics_fini_pass ();
1284 do_per_function (execute_function_todo, (void *)(size_t) flags);
1286 /* Always remove functions just as before inlining: IPA passes might be
1287 interested to see bodies of extern inline functions that are not inlined
1288 to analyze side effects. The full removal is done just at the end
1289 of IPA pass queue. */
1290 if (flags & TODO_remove_functions)
1293 cgraph_remove_unreachable_nodes (true, dump_file);
1296 if ((flags & TODO_dump_cgraph) && dump_file && !current_function_decl)
1299 dump_cgraph (dump_file);
1300 /* Flush the file. If verification fails, we won't be able to
1301 close the file before aborting. */
1305 if (flags & TODO_ggc_collect)
1308 /* Now that the dumping has been done, we can get rid of the optional
1310 if (flags & TODO_df_finish)
1311 df_finish_pass ((flags & TODO_df_verify) != 0);
1314 /* Verify invariants that should hold between passes. This is a place
1315 to put simple sanity checks. */
1318 verify_interpass_invariants (void)
1320 #ifdef ENABLE_CHECKING
1321 gcc_assert (!fold_deferring_overflow_warnings_p ());
1325 /* Clear the last verified flag. */
1328 clear_last_verified (void *data ATTRIBUTE_UNUSED)
1330 cfun->last_verified = 0;
1333 /* Helper function. Verify that the properties has been turn into the
1334 properties expected by the pass. */
1336 #ifdef ENABLE_CHECKING
1338 verify_curr_properties (void *data)
1340 unsigned int props = (size_t)data;
1341 gcc_assert ((cfun->curr_properties & props) == props);
1345 /* Initialize pass dump file. */
1346 /* This is non-static so that the plugins can use it. */
1349 pass_init_dump_file (struct opt_pass *pass)
1351 /* If a dump file name is present, open it if enabled. */
1352 if (pass->static_pass_number != -1)
1354 bool initializing_dump = !dump_initialized_p (pass->static_pass_number);
1355 dump_file_name = get_dump_file_name (pass->static_pass_number);
1356 dump_file = dump_begin (pass->static_pass_number, &dump_flags);
1357 if (dump_file && current_function_decl)
1359 const char *dname, *aname;
1360 struct cgraph_node *node = cgraph_node (current_function_decl);
1361 dname = lang_hooks.decl_printable_name (current_function_decl, 2);
1362 aname = (IDENTIFIER_POINTER
1363 (DECL_ASSEMBLER_NAME (current_function_decl)));
1364 fprintf (dump_file, "\n;; Function %s (%s)%s\n\n", dname, aname,
1365 node->frequency == NODE_FREQUENCY_HOT
1367 : node->frequency == NODE_FREQUENCY_UNLIKELY_EXECUTED
1368 ? " (unlikely executed)"
1369 : node->frequency == NODE_FREQUENCY_EXECUTED_ONCE
1370 ? " (executed once)"
1373 return initializing_dump;
1379 /* Flush PASS dump file. */
1380 /* This is non-static so that plugins can use it. */
1383 pass_fini_dump_file (struct opt_pass *pass)
1385 /* Flush and close dump file. */
1388 free (CONST_CAST (char *, dump_file_name));
1389 dump_file_name = NULL;
1394 dump_end (pass->static_pass_number, dump_file);
1399 /* After executing the pass, apply expected changes to the function
1403 update_properties_after_pass (void *data)
1405 struct opt_pass *pass = (struct opt_pass *) data;
1406 cfun->curr_properties = (cfun->curr_properties | pass->properties_provided)
1407 & ~pass->properties_destroyed;
1410 /* Execute summary generation for all of the passes in IPA_PASS. */
1413 execute_ipa_summary_passes (struct ipa_opt_pass_d *ipa_pass)
1417 struct opt_pass *pass = &ipa_pass->pass;
1419 /* Execute all of the IPA_PASSes in the list. */
1420 if (ipa_pass->pass.type == IPA_PASS
1421 && (!pass->gate || pass->gate ())
1422 && ipa_pass->generate_summary)
1424 pass_init_dump_file (pass);
1426 /* If a timevar is present, start it. */
1428 timevar_push (pass->tv_id);
1430 ipa_pass->generate_summary ();
1434 timevar_pop (pass->tv_id);
1436 pass_fini_dump_file (pass);
1438 ipa_pass = (struct ipa_opt_pass_d *)ipa_pass->pass.next;
1442 /* Execute IPA_PASS function transform on NODE. */
1445 execute_one_ipa_transform_pass (struct cgraph_node *node,
1446 struct ipa_opt_pass_d *ipa_pass)
1448 struct opt_pass *pass = &ipa_pass->pass;
1449 unsigned int todo_after = 0;
1451 current_pass = pass;
1452 if (!ipa_pass->function_transform)
1455 /* Note that the folders should only create gimple expressions.
1456 This is a hack until the new folder is ready. */
1457 in_gimple_form = (cfun && (cfun->curr_properties & PROP_trees)) != 0;
1459 pass_init_dump_file (pass);
1461 /* Run pre-pass verification. */
1462 execute_todo (ipa_pass->function_transform_todo_flags_start);
1464 /* If a timevar is present, start it. */
1465 if (pass->tv_id != TV_NONE)
1466 timevar_push (pass->tv_id);
1469 todo_after = ipa_pass->function_transform (node);
1472 if (pass->tv_id != TV_NONE)
1473 timevar_pop (pass->tv_id);
1475 /* Run post-pass cleanup and verification. */
1476 execute_todo (todo_after);
1477 verify_interpass_invariants ();
1479 pass_fini_dump_file (pass);
1481 current_pass = NULL;
1484 /* For the current function, execute all ipa transforms. */
1487 execute_all_ipa_transforms (void)
1489 struct cgraph_node *node;
1492 node = cgraph_node (current_function_decl);
1494 if (node->ipa_transforms_to_apply)
1498 for (i = 0; i < VEC_length (ipa_opt_pass, node->ipa_transforms_to_apply);
1500 execute_one_ipa_transform_pass (node,
1501 VEC_index (ipa_opt_pass,
1502 node->ipa_transforms_to_apply,
1504 VEC_free (ipa_opt_pass, heap, node->ipa_transforms_to_apply);
1505 node->ipa_transforms_to_apply = NULL;
1512 execute_one_pass (struct opt_pass *pass)
1514 bool initializing_dump;
1515 unsigned int todo_after = 0;
1519 /* IPA passes are executed on whole program, so cfun should be NULL.
1520 Other passes need function context set. */
1521 if (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS)
1522 gcc_assert (!cfun && !current_function_decl);
1524 gcc_assert (cfun && current_function_decl);
1526 current_pass = pass;
1528 /* Check whether gate check should be avoided.
1529 User controls the value of the gate through the parameter "gate_status". */
1530 gate_status = (pass->gate == NULL) ? true : pass->gate();
1532 /* Override gate with plugin. */
1533 invoke_plugin_callbacks (PLUGIN_OVERRIDE_GATE, &gate_status);
1537 current_pass = NULL;
1541 /* Pass execution event trigger: useful to identify passes being
1543 invoke_plugin_callbacks (PLUGIN_PASS_EXECUTION, pass);
1545 if (!quiet_flag && !cfun)
1546 fprintf (stderr, " <%s>", pass->name ? pass->name : "");
1548 /* Note that the folders should only create gimple expressions.
1549 This is a hack until the new folder is ready. */
1550 in_gimple_form = (cfun && (cfun->curr_properties & PROP_trees)) != 0;
1552 initializing_dump = pass_init_dump_file (pass);
1554 /* Run pre-pass verification. */
1555 execute_todo (pass->todo_flags_start);
1557 #ifdef ENABLE_CHECKING
1558 do_per_function (verify_curr_properties,
1559 (void *)(size_t)pass->properties_required);
1562 /* If a timevar is present, start it. */
1563 if (pass->tv_id != TV_NONE)
1564 timevar_push (pass->tv_id);
1569 todo_after = pass->execute ();
1570 do_per_function (clear_last_verified, NULL);
1574 if (pass->tv_id != TV_NONE)
1575 timevar_pop (pass->tv_id);
1577 do_per_function (update_properties_after_pass, pass);
1579 if (initializing_dump
1581 && graph_dump_format != no_graph
1583 && (cfun->curr_properties & (PROP_cfg | PROP_rtl))
1584 == (PROP_cfg | PROP_rtl))
1586 get_dump_file_info (pass->static_pass_number)->flags |= TDF_GRAPH;
1587 dump_flags |= TDF_GRAPH;
1588 clean_graph_dump_file (dump_file_name);
1591 /* Run post-pass cleanup and verification. */
1592 execute_todo (todo_after | pass->todo_flags_finish);
1593 verify_interpass_invariants ();
1594 if (pass->type == IPA_PASS)
1596 struct cgraph_node *node;
1597 for (node = cgraph_nodes; node; node = node->next)
1599 VEC_safe_push (ipa_opt_pass, heap, node->ipa_transforms_to_apply,
1600 (struct ipa_opt_pass_d *)pass);
1603 if (!current_function_decl)
1604 cgraph_process_new_functions ();
1606 pass_fini_dump_file (pass);
1608 if (pass->type != SIMPLE_IPA_PASS && pass->type != IPA_PASS)
1609 gcc_assert (!(cfun->curr_properties & PROP_trees)
1610 || pass->type != RTL_PASS);
1612 current_pass = NULL;
1618 execute_pass_list (struct opt_pass *pass)
1622 gcc_assert (pass->type == GIMPLE_PASS
1623 || pass->type == RTL_PASS);
1624 if (execute_one_pass (pass) && pass->sub)
1625 execute_pass_list (pass->sub);
1631 /* Same as execute_pass_list but assume that subpasses of IPA passes
1632 are local passes. If SET is not NULL, write out summaries of only
1633 those node in SET. */
1636 ipa_write_summaries_2 (struct opt_pass *pass, cgraph_node_set set,
1637 varpool_node_set vset,
1638 struct lto_out_decl_state *state)
1642 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *)pass;
1643 gcc_assert (!current_function_decl);
1645 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
1646 if (pass->type == IPA_PASS
1647 && ipa_pass->write_summary
1648 && (!pass->gate || pass->gate ()))
1650 /* If a timevar is present, start it. */
1652 timevar_push (pass->tv_id);
1654 pass_init_dump_file (pass);
1656 ipa_pass->write_summary (set,vset);
1658 pass_fini_dump_file (pass);
1660 /* If a timevar is present, start it. */
1662 timevar_pop (pass->tv_id);
1665 if (pass->sub && pass->sub->type != GIMPLE_PASS)
1666 ipa_write_summaries_2 (pass->sub, set, vset, state);
1672 /* Helper function of ipa_write_summaries. Creates and destroys the
1673 decl state and calls ipa_write_summaries_2 for all passes that have
1674 summaries. SET is the set of nodes to be written. */
1677 ipa_write_summaries_1 (cgraph_node_set set, varpool_node_set vset)
1679 struct lto_out_decl_state *state = lto_new_out_decl_state ();
1680 compute_ltrans_boundary (state, set, vset);
1682 lto_push_out_decl_state (state);
1684 gcc_assert (!flag_wpa);
1685 ipa_write_summaries_2 (all_regular_ipa_passes, set, vset, state);
1686 ipa_write_summaries_2 (all_lto_gen_passes, set, vset, state);
1688 gcc_assert (lto_get_out_decl_state () == state);
1689 lto_pop_out_decl_state ();
1690 lto_delete_out_decl_state (state);
1693 /* Write out summaries for all the nodes in the callgraph. */
1696 ipa_write_summaries (void)
1698 cgraph_node_set set;
1699 varpool_node_set vset;
1700 struct cgraph_node **order;
1701 struct varpool_node *vnode;
1704 if (!flag_generate_lto || seen_error ())
1707 set = cgraph_node_set_new ();
1709 /* Create the callgraph set in the same order used in
1710 cgraph_expand_all_functions. This mostly facilitates debugging,
1711 since it causes the gimple file to be processed in the same order
1712 as the source code. */
1713 order = XCNEWVEC (struct cgraph_node *, cgraph_n_nodes);
1714 order_pos = cgraph_postorder (order);
1715 gcc_assert (order_pos == cgraph_n_nodes);
1717 for (i = order_pos - 1; i >= 0; i--)
1719 struct cgraph_node *node = order[i];
1723 /* When streaming out references to statements as part of some IPA
1724 pass summary, the statements need to have uids assigned and the
1725 following does that for all the IPA passes here. Naturally, this
1726 ordering then matches the one IPA-passes get in their stmt_fixup
1729 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
1730 renumber_gimple_stmt_uids ();
1734 cgraph_node_set_add (set, node);
1736 vset = varpool_node_set_new ();
1738 for (vnode = varpool_nodes; vnode; vnode = vnode->next)
1739 if (vnode->needed && !vnode->alias)
1740 varpool_node_set_add (vset, vnode);
1742 ipa_write_summaries_1 (set, vset);
1749 /* Same as execute_pass_list but assume that subpasses of IPA passes
1750 are local passes. If SET is not NULL, write out optimization summaries of
1751 only those node in SET. */
1754 ipa_write_optimization_summaries_1 (struct opt_pass *pass, cgraph_node_set set,
1755 varpool_node_set vset,
1756 struct lto_out_decl_state *state)
1760 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *)pass;
1761 gcc_assert (!current_function_decl);
1763 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
1764 if (pass->type == IPA_PASS
1765 && ipa_pass->write_optimization_summary
1766 && (!pass->gate || pass->gate ()))
1768 /* If a timevar is present, start it. */
1770 timevar_push (pass->tv_id);
1772 pass_init_dump_file (pass);
1774 ipa_pass->write_optimization_summary (set, vset);
1776 pass_fini_dump_file (pass);
1778 /* If a timevar is present, start it. */
1780 timevar_pop (pass->tv_id);
1783 if (pass->sub && pass->sub->type != GIMPLE_PASS)
1784 ipa_write_optimization_summaries_1 (pass->sub, set, vset, state);
1790 /* Write all the optimization summaries for the cgraph nodes in SET. If SET is
1791 NULL, write out all summaries of all nodes. */
1794 ipa_write_optimization_summaries (cgraph_node_set set, varpool_node_set vset)
1796 struct lto_out_decl_state *state = lto_new_out_decl_state ();
1797 cgraph_node_set_iterator csi;
1798 compute_ltrans_boundary (state, set, vset);
1800 lto_push_out_decl_state (state);
1801 for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi))
1803 struct cgraph_node *node = csi_node (csi);
1804 /* When streaming out references to statements as part of some IPA
1805 pass summary, the statements need to have uids assigned.
1807 For functions newly born at WPA stage we need to initialize
1810 && gimple_has_body_p (node->decl))
1812 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
1813 renumber_gimple_stmt_uids ();
1818 gcc_assert (flag_wpa);
1819 ipa_write_optimization_summaries_1 (all_regular_ipa_passes, set, vset, state);
1820 ipa_write_optimization_summaries_1 (all_lto_gen_passes, set, vset, state);
1822 gcc_assert (lto_get_out_decl_state () == state);
1823 lto_pop_out_decl_state ();
1824 lto_delete_out_decl_state (state);
1827 /* Same as execute_pass_list but assume that subpasses of IPA passes
1828 are local passes. */
1831 ipa_read_summaries_1 (struct opt_pass *pass)
1835 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *) pass;
1837 gcc_assert (!current_function_decl);
1839 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
1841 if (pass->gate == NULL || pass->gate ())
1843 if (pass->type == IPA_PASS && ipa_pass->read_summary)
1845 /* If a timevar is present, start it. */
1847 timevar_push (pass->tv_id);
1849 pass_init_dump_file (pass);
1851 ipa_pass->read_summary ();
1853 pass_fini_dump_file (pass);
1857 timevar_pop (pass->tv_id);
1860 if (pass->sub && pass->sub->type != GIMPLE_PASS)
1861 ipa_read_summaries_1 (pass->sub);
1868 /* Read all the summaries for all_regular_ipa_passes and all_lto_gen_passes. */
1871 ipa_read_summaries (void)
1873 ipa_read_summaries_1 (all_regular_ipa_passes);
1874 ipa_read_summaries_1 (all_lto_gen_passes);
1877 /* Same as execute_pass_list but assume that subpasses of IPA passes
1878 are local passes. */
1881 ipa_read_optimization_summaries_1 (struct opt_pass *pass)
1885 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *) pass;
1887 gcc_assert (!current_function_decl);
1889 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
1891 if (pass->gate == NULL || pass->gate ())
1893 if (pass->type == IPA_PASS && ipa_pass->read_optimization_summary)
1895 /* If a timevar is present, start it. */
1897 timevar_push (pass->tv_id);
1899 pass_init_dump_file (pass);
1901 ipa_pass->read_optimization_summary ();
1903 pass_fini_dump_file (pass);
1907 timevar_pop (pass->tv_id);
1910 if (pass->sub && pass->sub->type != GIMPLE_PASS)
1911 ipa_read_optimization_summaries_1 (pass->sub);
1917 /* Read all the summaries for all_regular_ipa_passes and all_lto_gen_passes. */
1920 ipa_read_optimization_summaries (void)
1922 ipa_read_optimization_summaries_1 (all_regular_ipa_passes);
1923 ipa_read_optimization_summaries_1 (all_lto_gen_passes);
1926 /* Same as execute_pass_list but assume that subpasses of IPA passes
1927 are local passes. */
1929 execute_ipa_pass_list (struct opt_pass *pass)
1933 gcc_assert (!current_function_decl);
1935 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
1936 if (execute_one_pass (pass) && pass->sub)
1938 if (pass->sub->type == GIMPLE_PASS)
1940 invoke_plugin_callbacks (PLUGIN_EARLY_GIMPLE_PASSES_START, NULL);
1941 do_per_function_toporder ((void (*)(void *))execute_pass_list,
1943 invoke_plugin_callbacks (PLUGIN_EARLY_GIMPLE_PASSES_END, NULL);
1945 else if (pass->sub->type == SIMPLE_IPA_PASS
1946 || pass->sub->type == IPA_PASS)
1947 execute_ipa_pass_list (pass->sub);
1951 gcc_assert (!current_function_decl);
1952 cgraph_process_new_functions ();
1958 /* Execute stmt fixup hooks of all passes in PASS for NODE and STMTS. */
1961 execute_ipa_stmt_fixups (struct opt_pass *pass,
1962 struct cgraph_node *node, gimple *stmts)
1966 /* Execute all of the IPA_PASSes in the list. */
1967 if (pass->type == IPA_PASS
1968 && (!pass->gate || pass->gate ()))
1970 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *) pass;
1972 if (ipa_pass->stmt_fixup)
1974 pass_init_dump_file (pass);
1975 /* If a timevar is present, start it. */
1977 timevar_push (pass->tv_id);
1979 ipa_pass->stmt_fixup (node, stmts);
1983 timevar_pop (pass->tv_id);
1984 pass_fini_dump_file (pass);
1987 execute_ipa_stmt_fixups (pass->sub, node, stmts);
1993 /* Execute stmt fixup hooks of all IPA passes for NODE and STMTS. */
1996 execute_all_ipa_stmt_fixups (struct cgraph_node *node, gimple *stmts)
1998 execute_ipa_stmt_fixups (all_regular_ipa_passes, node, stmts);
2002 extern void debug_properties (unsigned int);
2003 extern void dump_properties (FILE *, unsigned int);
2006 dump_properties (FILE *dump, unsigned int props)
2008 fprintf (dump, "Properties:\n");
2009 if (props & PROP_gimple_any)
2010 fprintf (dump, "PROP_gimple_any\n");
2011 if (props & PROP_gimple_lcf)
2012 fprintf (dump, "PROP_gimple_lcf\n");
2013 if (props & PROP_gimple_leh)
2014 fprintf (dump, "PROP_gimple_leh\n");
2015 if (props & PROP_cfg)
2016 fprintf (dump, "PROP_cfg\n");
2017 if (props & PROP_referenced_vars)
2018 fprintf (dump, "PROP_referenced_vars\n");
2019 if (props & PROP_ssa)
2020 fprintf (dump, "PROP_ssa\n");
2021 if (props & PROP_no_crit_edges)
2022 fprintf (dump, "PROP_no_crit_edges\n");
2023 if (props & PROP_rtl)
2024 fprintf (dump, "PROP_rtl\n");
2025 if (props & PROP_gimple_lomp)
2026 fprintf (dump, "PROP_gimple_lomp\n");
2027 if (props & PROP_gimple_lcx)
2028 fprintf (dump, "PROP_gimple_lcx\n");
2029 if (props & PROP_cfglayout)
2030 fprintf (dump, "PROP_cfglayout\n");
2034 debug_properties (unsigned int props)
2036 dump_properties (stderr, props);
2039 /* Called by local passes to see if function is called by already processed nodes.
2040 Because we process nodes in topological order, this means that function is
2041 in recursive cycle or we introduced new direct calls. */
2043 function_called_by_processed_nodes_p (void)
2045 struct cgraph_edge *e;
2046 for (e = cgraph_node (current_function_decl)->callers; e; e = e->next_caller)
2048 if (e->caller->decl == current_function_decl)
2050 if (!e->caller->analyzed)
2052 if (TREE_ASM_WRITTEN (e->caller->decl))
2054 if (!e->caller->process && !e->caller->global.inlined_to)
2059 fprintf (dump_file, "Already processed call to:\n");
2060 dump_cgraph_node (dump_file, e->caller);
2065 #include "gt-passes.h"