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 2011 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"
37 #include "insn-attr.h"
38 #include "insn-config.h"
39 #include "insn-flags.h"
40 #include "hard-reg-set.h"
47 #include "basic-block.h"
53 #include "diagnostic-core.h"
56 #include "dwarf2asm.h"
57 #include "integrate.h"
60 #include "langhooks.h"
61 #include "cfglayout.h"
63 #include "hosthooks.h"
67 #include "value-prof.h"
68 #include "tree-inline.h"
69 #include "tree-flow.h"
70 #include "tree-pass.h"
71 #include "tree-dump.h"
74 #include "lto-streamer.h"
76 #include "ipa-utils.h"
77 #include "tree-pretty-print.h"
79 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
80 #include "dwarf2out.h"
83 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
87 #ifdef SDB_DEBUGGING_INFO
91 #ifdef XCOFF_DEBUGGING_INFO
92 #include "xcoffout.h" /* Needed for external data
93 declarations for e.g. AIX 4.x. */
96 /* This is used for debugging. It allows the current pass to printed
97 from anywhere in compilation.
98 The variable current_pass is also used for statistics and plugins. */
99 struct opt_pass *current_pass;
101 static void register_pass_name (struct opt_pass *, const char *);
103 /* Call from anywhere to find out what pass this is. Useful for
104 printing out debugging information deep inside an service
107 print_current_pass (FILE *file)
110 fprintf (file, "current pass = %s (%d)\n",
111 current_pass->name, current_pass->static_pass_number);
113 fprintf (file, "no current pass.\n");
117 /* Call from the debugger to get the current pass name. */
121 print_current_pass (stderr);
126 /* Global variables used to communicate with passes. */
129 bool first_pass_instance;
132 /* This is called from various places for FUNCTION_DECL, VAR_DECL,
135 This does nothing for local (non-static) variables, unless the
136 variable is a register variable with DECL_ASSEMBLER_NAME set. In
137 that case, or if the variable is not an automatic, it sets up the
138 RTL and outputs any assembler code (label definition, storage
139 allocation and initialization).
141 DECL is the declaration. TOP_LEVEL is nonzero
142 if this declaration is not within a function. */
145 rest_of_decl_compilation (tree decl,
149 /* We deferred calling assemble_alias so that we could collect
150 other attributes such as visibility. Emit the alias now. */
154 alias = lookup_attribute ("alias", DECL_ATTRIBUTES (decl));
157 alias = TREE_VALUE (TREE_VALUE (alias));
158 alias = get_identifier (TREE_STRING_POINTER (alias));
159 /* A quirk of the initial implementation of aliases required that the
160 user add "extern" to all of them. Which is silly, but now
161 historical. Do note that the symbol is in fact locally defined. */
162 if (!lookup_attribute ("weakref", DECL_ATTRIBUTES (decl)))
163 DECL_EXTERNAL (decl) = 0;
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 */
327 TV_POSTRELOAD, /* tv_id */
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_late_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, *full_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);
415 full_name = concat (prefix, pass->name, num, NULL);
416 register_pass_name (pass, full_name);
419 /* Recursive worker function for register_dump_files. */
422 register_dump_files_1 (struct opt_pass *pass, int properties)
426 int new_properties = (properties | pass->properties_provided)
427 & ~pass->properties_destroyed;
429 if (pass->name && pass->name[0] != '*')
430 register_one_dump_file (pass);
433 new_properties = register_dump_files_1 (pass->sub, new_properties);
435 /* If we have a gate, combine the properties that we could have with
436 and without the pass being examined. */
438 properties &= new_properties;
440 properties = new_properties;
449 /* Register the dump files for the pipeline starting at PASS.
450 PROPERTIES reflects the properties that are guaranteed to be available at
451 the beginning of the pipeline. */
454 register_dump_files (struct opt_pass *pass,int properties)
456 pass->properties_required |= properties;
457 register_dump_files_1 (pass, properties);
462 const char* unique_name;
463 struct opt_pass *pass;
466 /* Pass registry hash function. */
469 passr_hash (const void *p)
471 const struct pass_registry *const s = (const struct pass_registry *const) p;
472 return htab_hash_string (s->unique_name);
475 /* Hash equal function */
478 passr_eq (const void *p1, const void *p2)
480 const struct pass_registry *const s1 = (const struct pass_registry *const) p1;
481 const struct pass_registry *const s2 = (const struct pass_registry *const) p2;
483 return !strcmp (s1->unique_name, s2->unique_name);
486 static htab_t name_to_pass_map = NULL;
488 /* Register PASS with NAME. */
491 register_pass_name (struct opt_pass *pass, const char *name)
493 struct pass_registry **slot;
494 struct pass_registry pr;
496 if (!name_to_pass_map)
497 name_to_pass_map = htab_create (256, passr_hash, passr_eq, NULL);
499 pr.unique_name = name;
500 slot = (struct pass_registry **) htab_find_slot (name_to_pass_map, &pr, INSERT);
503 struct pass_registry *new_pr;
505 new_pr = XCNEW (struct pass_registry);
506 new_pr->unique_name = xstrdup (name);
511 return; /* Ignore plugin passes. */
514 /* Map from pass id to canonicalized pass name. */
516 typedef const char *char_ptr;
518 DEF_VEC_ALLOC_P(char_ptr, heap);
519 static VEC(char_ptr, heap) *pass_tab = NULL;
521 /* Callback function for traversing NAME_TO_PASS_MAP. */
524 pass_traverse (void **slot, void *data ATTRIBUTE_UNUSED)
526 struct pass_registry **p = (struct pass_registry **)slot;
527 struct opt_pass *pass = (*p)->pass;
529 gcc_assert (pass->static_pass_number > 0);
530 gcc_assert (pass_tab);
532 VEC_replace (char_ptr, pass_tab, pass->static_pass_number,
538 /* The function traverses NAME_TO_PASS_MAP and creates a pass info
539 table for dumping purpose. */
542 create_pass_tab (void)
544 if (!flag_dump_passes)
547 VEC_safe_grow_cleared (char_ptr, heap,
548 pass_tab, passes_by_id_size + 1);
549 htab_traverse (name_to_pass_map, pass_traverse, NULL);
552 static bool override_gate_status (struct opt_pass *, tree, bool);
554 /* Dump the instantiated name for PASS. IS_ON indicates if PASS
555 is turned on or not. */
558 dump_one_pass (struct opt_pass *pass, int pass_indent)
560 int indent = 3 * pass_indent;
562 bool is_on, is_really_on;
564 is_on = (pass->gate == NULL) ? true : pass->gate();
565 is_really_on = override_gate_status (pass, current_function_decl, is_on);
567 if (pass->static_pass_number <= 0)
570 pn = VEC_index (char_ptr, pass_tab, pass->static_pass_number);
572 fprintf (stderr, "%*s%-40s%*s:%s%s\n", indent, " ", pn,
573 (15 - indent < 0 ? 0 : 15 - indent), " ",
574 is_on ? " ON" : " OFF",
575 ((!is_on) == (!is_really_on) ? ""
576 : (is_really_on ? " (FORCED_ON)" : " (FORCED_OFF)")));
579 /* Dump pass list PASS with indentation INDENT. */
582 dump_pass_list (struct opt_pass *pass, int indent)
586 dump_one_pass (pass, indent);
588 dump_pass_list (pass->sub, indent + 1);
594 /* Dump all optimization passes. */
599 struct cgraph_node *n, *node = NULL;
600 tree save_fndecl = current_function_decl;
607 if (DECL_STRUCT_FUNCTION (n->decl))
618 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
619 current_function_decl = node->decl;
621 dump_pass_list (all_lowering_passes, 1);
622 dump_pass_list (all_small_ipa_passes, 1);
623 dump_pass_list (all_regular_ipa_passes, 1);
624 dump_pass_list (all_lto_gen_passes, 1);
625 dump_pass_list (all_late_ipa_passes, 1);
626 dump_pass_list (all_passes, 1);
629 current_function_decl = save_fndecl;
633 /* Returns the pass with NAME. */
635 static struct opt_pass *
636 get_pass_by_name (const char *name)
638 struct pass_registry **slot, pr;
640 pr.unique_name = name;
641 slot = (struct pass_registry **) htab_find_slot (name_to_pass_map,
647 return (*slot)->pass;
651 /* Range [start, last]. */
657 const char *assem_name;
658 struct uid_range *next;
661 typedef struct uid_range *uid_range_p;
663 DEF_VEC_P(uid_range_p);
664 DEF_VEC_ALLOC_P(uid_range_p, heap);
666 static VEC(uid_range_p, heap) *enabled_pass_uid_range_tab = NULL;
667 static VEC(uid_range_p, heap) *disabled_pass_uid_range_tab = NULL;
670 /* Parse option string for -fdisable- and -fenable-
671 The syntax of the options:
674 -fdisable-<pass_name>
676 -fenable-<pass_name>=s1:e1,s2:e2,...
677 -fdisable-<pass_name>=s1:e1,s2:e2,...
681 enable_disable_pass (const char *arg, bool is_enable)
683 struct opt_pass *pass;
684 char *range_str, *phase_name;
685 char *argstr = xstrdup (arg);
686 VEC(uid_range_p, heap) **tab = 0;
688 range_str = strchr (argstr,'=');
699 error ("unrecognized option -fenable");
701 error ("unrecognized option -fdisable");
705 pass = get_pass_by_name (phase_name);
706 if (!pass || pass->static_pass_number == -1)
709 error ("unknown pass %s specified in -fenable", phase_name);
711 error ("unknown pass %s specified in -fdisble", phase_name);
717 tab = &enabled_pass_uid_range_tab;
719 tab = &disabled_pass_uid_range_tab;
721 if ((unsigned) pass->static_pass_number >= VEC_length (uid_range_p, *tab))
722 VEC_safe_grow_cleared (uid_range_p, heap,
723 *tab, pass->static_pass_number + 1);
728 uid_range_p new_range = XCNEW (struct uid_range);
730 new_range->start = 0;
731 new_range->last = (unsigned)-1;
733 slot = VEC_index (uid_range_p, *tab, pass->static_pass_number);
734 new_range->next = slot;
735 VEC_replace (uid_range_p, *tab, pass->static_pass_number,
738 inform (UNKNOWN_LOCATION, "enable pass %s for functions in the range "
739 "of [%u, %u]", phase_name, new_range->start, new_range->last);
741 inform (UNKNOWN_LOCATION, "disable pass %s for functions in the range "
742 "of [%u, %u]", phase_name, new_range->start, new_range->last);
746 char *next_range = NULL;
747 char *one_range = range_str;
748 char *end_val = NULL;
753 uid_range_p new_range;
754 char *invalid = NULL;
756 char *func_name = NULL;
758 next_range = strchr (one_range, ',');
765 end_val = strchr (one_range, ':');
771 start = strtol (one_range, &invalid, 10);
772 if (*invalid || start < 0)
774 if (end_val || (one_range[0] >= '0'
775 && one_range[0] <= '9'))
777 error ("Invalid range %s in option %s",
779 is_enable ? "-fenable" : "-fdisable");
783 func_name = one_range;
787 new_range = XCNEW (struct uid_range);
790 new_range->start = (unsigned) start;
791 new_range->last = (unsigned) start;
795 new_range->start = (unsigned) -1;
796 new_range->last = (unsigned) -1;
797 new_range->assem_name = xstrdup (func_name);
802 long last = strtol (end_val, &invalid, 10);
803 if (*invalid || last < start)
805 error ("Invalid range %s in option %s",
807 is_enable ? "-fenable" : "-fdisable");
811 new_range = XCNEW (struct uid_range);
812 new_range->start = (unsigned) start;
813 new_range->last = (unsigned) last;
816 slot = VEC_index (uid_range_p, *tab, pass->static_pass_number);
817 new_range->next = slot;
818 VEC_replace (uid_range_p, *tab, pass->static_pass_number,
822 if (new_range->assem_name)
823 inform (UNKNOWN_LOCATION,
824 "enable pass %s for function %s",
825 phase_name, new_range->assem_name);
827 inform (UNKNOWN_LOCATION,
828 "enable pass %s for functions in the range of [%u, %u]",
829 phase_name, new_range->start, new_range->last);
833 if (new_range->assem_name)
834 inform (UNKNOWN_LOCATION,
835 "disable pass %s for function %s",
836 phase_name, new_range->assem_name);
838 inform (UNKNOWN_LOCATION,
839 "disable pass %s for functions in the range of [%u, %u]",
840 phase_name, new_range->start, new_range->last);
843 one_range = next_range;
844 } while (next_range);
850 /* Enable pass specified by ARG. */
853 enable_pass (const char *arg)
855 enable_disable_pass (arg, true);
858 /* Disable pass specified by ARG. */
861 disable_pass (const char *arg)
863 enable_disable_pass (arg, false);
866 /* Returns true if PASS is explicitly enabled/disabled for FUNC. */
869 is_pass_explicitly_enabled_or_disabled (struct opt_pass *pass,
871 VEC(uid_range_p, heap) *tab)
873 uid_range_p slot, range;
875 const char *aname = NULL;
878 || (unsigned) pass->static_pass_number >= VEC_length (uid_range_p, tab)
879 || pass->static_pass_number == -1)
882 slot = VEC_index (uid_range_p, tab, pass->static_pass_number);
886 cgraph_uid = func ? cgraph_get_node (func)->uid : 0;
887 if (func && DECL_ASSEMBLER_NAME_SET_P (func))
888 aname = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (func));
893 if ((unsigned) cgraph_uid >= range->start
894 && (unsigned) cgraph_uid <= range->last)
896 if (range->assem_name && aname
897 && !strcmp (range->assem_name, aname))
905 /* Look at the static_pass_number and duplicate the pass
906 if it is already added to a list. */
908 static struct opt_pass *
909 make_pass_instance (struct opt_pass *pass, bool track_duplicates)
911 /* A nonzero static_pass_number indicates that the
912 pass is already in the list. */
913 if (pass->static_pass_number)
915 struct opt_pass *new_pass;
917 if (pass->type == GIMPLE_PASS
918 || pass->type == RTL_PASS
919 || pass->type == SIMPLE_IPA_PASS)
921 new_pass = XNEW (struct opt_pass);
922 memcpy (new_pass, pass, sizeof (struct opt_pass));
924 else if (pass->type == IPA_PASS)
926 new_pass = (struct opt_pass *)XNEW (struct ipa_opt_pass_d);
927 memcpy (new_pass, pass, sizeof (struct ipa_opt_pass_d));
932 new_pass->next = NULL;
934 new_pass->todo_flags_start &= ~TODO_mark_first_instance;
936 /* Indicate to register_dump_files that this pass has duplicates,
937 and so it should rename the dump file. The first instance will
938 be -1, and be number of duplicates = -static_pass_number - 1.
939 Subsequent instances will be > 0 and just the duplicate number. */
940 if ((pass->name && pass->name[0] != '*') || track_duplicates)
942 pass->static_pass_number -= 1;
943 new_pass->static_pass_number = -pass->static_pass_number;
949 pass->todo_flags_start |= TODO_mark_first_instance;
950 pass->static_pass_number = -1;
952 invoke_plugin_callbacks (PLUGIN_NEW_PASS, pass);
957 /* Add a pass to the pass list. Duplicate the pass if it's already
960 static struct opt_pass **
961 next_pass_1 (struct opt_pass **list, struct opt_pass *pass)
963 /* Every pass should have a name so that plugins can refer to them. */
964 gcc_assert (pass->name != NULL);
966 *list = make_pass_instance (pass, false);
968 return &(*list)->next;
971 /* List node for an inserted pass instance. We need to keep track of all
972 the newly-added pass instances (with 'added_pass_nodes' defined below)
973 so that we can register their dump files after pass-positioning is finished.
974 Registering dumping files needs to be post-processed or the
975 static_pass_number of the opt_pass object would be modified and mess up
976 the dump file names of future pass instances to be added. */
978 struct pass_list_node
980 struct opt_pass *pass;
981 struct pass_list_node *next;
984 static struct pass_list_node *added_pass_nodes = NULL;
985 static struct pass_list_node *prev_added_pass_node;
987 /* Insert the pass at the proper position. Return true if the pass
988 is successfully added.
990 NEW_PASS_INFO - new pass to be inserted
991 PASS_LIST - root of the pass list to insert the new pass to */
994 position_pass (struct register_pass_info *new_pass_info,
995 struct opt_pass **pass_list)
997 struct opt_pass *pass = *pass_list, *prev_pass = NULL;
998 bool success = false;
1000 for ( ; pass; prev_pass = pass, pass = pass->next)
1002 /* Check if the current pass is of the same type as the new pass and
1003 matches the name and the instance number of the reference pass. */
1004 if (pass->type == new_pass_info->pass->type
1006 && !strcmp (pass->name, new_pass_info->reference_pass_name)
1007 && ((new_pass_info->ref_pass_instance_number == 0)
1008 || (new_pass_info->ref_pass_instance_number ==
1009 pass->static_pass_number)
1010 || (new_pass_info->ref_pass_instance_number == 1
1011 && pass->todo_flags_start & TODO_mark_first_instance)))
1013 struct opt_pass *new_pass;
1014 struct pass_list_node *new_pass_node;
1016 new_pass = make_pass_instance (new_pass_info->pass, true);
1018 /* Insert the new pass instance based on the positioning op. */
1019 switch (new_pass_info->pos_op)
1021 case PASS_POS_INSERT_AFTER:
1022 new_pass->next = pass->next;
1023 pass->next = new_pass;
1025 /* Skip newly inserted pass to avoid repeated
1026 insertions in the case where the new pass and the
1027 existing one have the same name. */
1030 case PASS_POS_INSERT_BEFORE:
1031 new_pass->next = pass;
1033 prev_pass->next = new_pass;
1035 *pass_list = new_pass;
1037 case PASS_POS_REPLACE:
1038 new_pass->next = pass->next;
1040 prev_pass->next = new_pass;
1042 *pass_list = new_pass;
1043 new_pass->sub = pass->sub;
1044 new_pass->tv_id = pass->tv_id;
1048 error ("invalid pass positioning operation");
1052 /* Save the newly added pass (instance) in the added_pass_nodes
1053 list so that we can register its dump file later. Note that
1054 we cannot register the dump file now because doing so will modify
1055 the static_pass_number of the opt_pass object and therefore
1056 mess up the dump file name of future instances. */
1057 new_pass_node = XCNEW (struct pass_list_node);
1058 new_pass_node->pass = new_pass;
1059 if (!added_pass_nodes)
1060 added_pass_nodes = new_pass_node;
1062 prev_added_pass_node->next = new_pass_node;
1063 prev_added_pass_node = new_pass_node;
1068 if (pass->sub && position_pass (new_pass_info, &pass->sub))
1075 /* Hooks a new pass into the pass lists.
1077 PASS_INFO - pass information that specifies the opt_pass object,
1078 reference pass, instance number, and how to position
1082 register_pass (struct register_pass_info *pass_info)
1084 bool all_instances, success;
1086 /* The checks below could fail in buggy plugins. Existing GCC
1087 passes should never fail these checks, so we mention plugin in
1089 if (!pass_info->pass)
1090 fatal_error ("plugin cannot register a missing pass");
1092 if (!pass_info->pass->name)
1093 fatal_error ("plugin cannot register an unnamed pass");
1095 if (!pass_info->reference_pass_name)
1097 ("plugin cannot register pass %qs without reference pass name",
1098 pass_info->pass->name);
1100 /* Try to insert the new pass to the pass lists. We need to check
1101 all five lists as the reference pass could be in one (or all) of
1103 all_instances = pass_info->ref_pass_instance_number == 0;
1104 success = position_pass (pass_info, &all_lowering_passes);
1105 if (!success || all_instances)
1106 success |= position_pass (pass_info, &all_small_ipa_passes);
1107 if (!success || all_instances)
1108 success |= position_pass (pass_info, &all_regular_ipa_passes);
1109 if (!success || all_instances)
1110 success |= position_pass (pass_info, &all_lto_gen_passes);
1111 if (!success || all_instances)
1112 success |= position_pass (pass_info, &all_late_ipa_passes);
1113 if (!success || all_instances)
1114 success |= position_pass (pass_info, &all_passes);
1117 ("pass %qs not found but is referenced by new pass %qs",
1118 pass_info->reference_pass_name, pass_info->pass->name);
1120 /* OK, we have successfully inserted the new pass. We need to register
1121 the dump files for the newly added pass and its duplicates (if any).
1122 Because the registration of plugin/backend passes happens after the
1123 command-line options are parsed, the options that specify single
1124 pass dumping (e.g. -fdump-tree-PASSNAME) cannot be used for new
1125 passes. Therefore we currently can only enable dumping of
1126 new passes when the 'dump-all' flags (e.g. -fdump-tree-all)
1127 are specified. While doing so, we also delete the pass_list_node
1128 objects created during pass positioning. */
1129 while (added_pass_nodes)
1131 struct pass_list_node *next_node = added_pass_nodes->next;
1132 enum tree_dump_index tdi;
1133 register_one_dump_file (added_pass_nodes->pass);
1134 if (added_pass_nodes->pass->type == SIMPLE_IPA_PASS
1135 || added_pass_nodes->pass->type == IPA_PASS)
1137 else if (added_pass_nodes->pass->type == GIMPLE_PASS)
1141 /* Check if dump-all flag is specified. */
1142 if (get_dump_file_info (tdi)->state)
1143 get_dump_file_info (added_pass_nodes->pass->static_pass_number)
1144 ->state = get_dump_file_info (tdi)->state;
1145 XDELETE (added_pass_nodes);
1146 added_pass_nodes = next_node;
1150 /* Construct the pass tree. The sequencing of passes is driven by
1151 the cgraph routines:
1153 cgraph_finalize_compilation_unit ()
1154 for each node N in the cgraph
1155 cgraph_analyze_function (N)
1156 cgraph_lower_function (N) -> all_lowering_passes
1158 If we are optimizing, cgraph_optimize is then invoked:
1161 ipa_passes () -> all_small_ipa_passes
1162 cgraph_expand_all_functions ()
1163 for each node N in the cgraph
1164 cgraph_expand_function (N)
1165 tree_rest_of_compilation (DECL (N)) -> all_passes
1169 init_optimization_passes (void)
1171 struct opt_pass **p;
1173 #define NEXT_PASS(PASS) (p = next_pass_1 (p, &((PASS).pass)))
1175 /* All passes needed to lower the function into shape optimizers can
1176 operate on. These passes are always run first on the function, but
1177 backend might produce already lowered functions that are not processed
1179 p = &all_lowering_passes;
1180 NEXT_PASS (pass_warn_unused_result);
1181 NEXT_PASS (pass_diagnose_omp_blocks);
1182 NEXT_PASS (pass_diagnose_tm_blocks);
1183 NEXT_PASS (pass_mudflap_1);
1184 NEXT_PASS (pass_lower_omp);
1185 NEXT_PASS (pass_lower_cf);
1186 NEXT_PASS (pass_lower_tm);
1187 NEXT_PASS (pass_refactor_eh);
1188 NEXT_PASS (pass_lower_eh);
1189 NEXT_PASS (pass_build_cfg);
1190 NEXT_PASS (pass_warn_function_return);
1191 NEXT_PASS (pass_build_cgraph_edges);
1194 /* Interprocedural optimization passes. */
1195 p = &all_small_ipa_passes;
1196 NEXT_PASS (pass_ipa_free_lang_data);
1197 NEXT_PASS (pass_ipa_function_and_variable_visibility);
1198 NEXT_PASS (pass_early_local_passes);
1200 struct opt_pass **p = &pass_early_local_passes.pass.sub;
1201 NEXT_PASS (pass_fixup_cfg);
1202 NEXT_PASS (pass_init_datastructures);
1203 NEXT_PASS (pass_expand_omp);
1205 NEXT_PASS (pass_referenced_vars);
1206 NEXT_PASS (pass_build_ssa);
1207 NEXT_PASS (pass_lower_vector);
1208 NEXT_PASS (pass_early_warn_uninitialized);
1209 NEXT_PASS (pass_rebuild_cgraph_edges);
1210 NEXT_PASS (pass_inline_parameters);
1211 NEXT_PASS (pass_early_inline);
1212 NEXT_PASS (pass_all_early_optimizations);
1214 struct opt_pass **p = &pass_all_early_optimizations.pass.sub;
1215 NEXT_PASS (pass_remove_cgraph_callee_edges);
1216 NEXT_PASS (pass_rename_ssa_copies);
1217 NEXT_PASS (pass_ccp);
1218 NEXT_PASS (pass_forwprop);
1219 /* pass_build_ealias is a dummy pass that ensures that we
1220 execute TODO_rebuild_alias at this point. Re-building
1221 alias information also rewrites no longer addressed
1222 locals into SSA form if possible. */
1223 NEXT_PASS (pass_build_ealias);
1224 NEXT_PASS (pass_sra_early);
1225 NEXT_PASS (pass_fre);
1226 NEXT_PASS (pass_copy_prop);
1227 NEXT_PASS (pass_merge_phi);
1228 NEXT_PASS (pass_cd_dce);
1229 NEXT_PASS (pass_early_ipa_sra);
1230 NEXT_PASS (pass_tail_recursion);
1231 NEXT_PASS (pass_convert_switch);
1232 NEXT_PASS (pass_cleanup_eh);
1233 NEXT_PASS (pass_profile);
1234 NEXT_PASS (pass_local_pure_const);
1235 /* Split functions creates parts that are not run through
1236 early optimizations again. It is thus good idea to do this
1238 NEXT_PASS (pass_split_functions);
1240 NEXT_PASS (pass_release_ssa_names);
1241 NEXT_PASS (pass_rebuild_cgraph_edges);
1242 NEXT_PASS (pass_inline_parameters);
1244 NEXT_PASS (pass_ipa_tree_profile);
1246 struct opt_pass **p = &pass_ipa_tree_profile.pass.sub;
1247 NEXT_PASS (pass_feedback_split_functions);
1249 NEXT_PASS (pass_ipa_increase_alignment);
1250 NEXT_PASS (pass_ipa_matrix_reorg);
1251 NEXT_PASS (pass_ipa_tm);
1252 NEXT_PASS (pass_ipa_lower_emutls);
1255 p = &all_regular_ipa_passes;
1256 NEXT_PASS (pass_ipa_whole_program_visibility);
1257 NEXT_PASS (pass_ipa_profile);
1258 NEXT_PASS (pass_ipa_cp);
1259 NEXT_PASS (pass_ipa_cdtor_merge);
1260 NEXT_PASS (pass_ipa_inline);
1261 NEXT_PASS (pass_ipa_pure_const);
1262 NEXT_PASS (pass_ipa_reference);
1265 p = &all_lto_gen_passes;
1266 NEXT_PASS (pass_ipa_lto_gimple_out);
1267 NEXT_PASS (pass_ipa_lto_finish_out); /* This must be the last LTO pass. */
1270 /* Simple IPA passes executed after the regular passes. In WHOPR mode the
1271 passes are executed after partitioning and thus see just parts of the
1273 p = &all_late_ipa_passes;
1274 NEXT_PASS (pass_ipa_pta);
1276 /* These passes are run after IPA passes on every function that is being
1277 output to the assembler file. */
1279 NEXT_PASS (pass_fixup_cfg);
1280 NEXT_PASS (pass_lower_eh_dispatch);
1281 NEXT_PASS (pass_all_optimizations);
1283 struct opt_pass **p = &pass_all_optimizations.pass.sub;
1284 NEXT_PASS (pass_remove_cgraph_callee_edges);
1285 /* Initial scalar cleanups before alias computation.
1286 They ensure memory accesses are not indirect wherever possible. */
1287 NEXT_PASS (pass_strip_predict_hints);
1288 NEXT_PASS (pass_rename_ssa_copies);
1289 NEXT_PASS (pass_complete_unrolli);
1290 NEXT_PASS (pass_ccp);
1291 NEXT_PASS (pass_forwprop);
1292 NEXT_PASS (pass_call_cdce);
1293 /* pass_build_alias is a dummy pass that ensures that we
1294 execute TODO_rebuild_alias at this point. Re-building
1295 alias information also rewrites no longer addressed
1296 locals into SSA form if possible. */
1297 NEXT_PASS (pass_build_alias);
1298 NEXT_PASS (pass_return_slot);
1299 NEXT_PASS (pass_phiprop);
1300 NEXT_PASS (pass_fre);
1301 NEXT_PASS (pass_copy_prop);
1302 NEXT_PASS (pass_merge_phi);
1303 NEXT_PASS (pass_vrp);
1304 NEXT_PASS (pass_dce);
1305 NEXT_PASS (pass_cselim);
1306 NEXT_PASS (pass_tree_ifcombine);
1307 NEXT_PASS (pass_phiopt);
1308 NEXT_PASS (pass_tail_recursion);
1309 NEXT_PASS (pass_ch);
1310 NEXT_PASS (pass_stdarg);
1311 NEXT_PASS (pass_lower_complex);
1312 NEXT_PASS (pass_sra);
1313 NEXT_PASS (pass_rename_ssa_copies);
1314 /* The dom pass will also resolve all __builtin_constant_p calls
1315 that are still there to 0. This has to be done after some
1316 propagations have already run, but before some more dead code
1317 is removed, and this place fits nicely. Remember this when
1318 trying to move or duplicate pass_dominator somewhere earlier. */
1319 NEXT_PASS (pass_dominator);
1320 /* The only const/copy propagation opportunities left after
1321 DOM should be due to degenerate PHI nodes. So rather than
1322 run the full propagators, run a specialized pass which
1323 only examines PHIs to discover const/copy propagation
1325 NEXT_PASS (pass_phi_only_cprop);
1326 NEXT_PASS (pass_dse);
1327 NEXT_PASS (pass_reassoc);
1328 NEXT_PASS (pass_dce);
1329 NEXT_PASS (pass_forwprop);
1330 NEXT_PASS (pass_phiopt);
1331 NEXT_PASS (pass_object_sizes);
1332 NEXT_PASS (pass_strlen);
1333 NEXT_PASS (pass_ccp);
1334 NEXT_PASS (pass_copy_prop);
1335 NEXT_PASS (pass_cse_sincos);
1336 NEXT_PASS (pass_optimize_bswap);
1337 NEXT_PASS (pass_split_crit_edges);
1338 NEXT_PASS (pass_pre);
1339 NEXT_PASS (pass_sink_code);
1340 NEXT_PASS (pass_tree_loop);
1342 struct opt_pass **p = &pass_tree_loop.pass.sub;
1343 NEXT_PASS (pass_tree_loop_init);
1344 NEXT_PASS (pass_lim);
1345 NEXT_PASS (pass_copy_prop);
1346 NEXT_PASS (pass_dce_loop);
1347 NEXT_PASS (pass_tree_unswitch);
1348 NEXT_PASS (pass_scev_cprop);
1349 NEXT_PASS (pass_record_bounds);
1350 NEXT_PASS (pass_check_data_deps);
1351 NEXT_PASS (pass_loop_distribution);
1352 NEXT_PASS (pass_copy_prop);
1353 NEXT_PASS (pass_graphite);
1355 struct opt_pass **p = &pass_graphite.pass.sub;
1356 NEXT_PASS (pass_graphite_transforms);
1357 NEXT_PASS (pass_lim);
1358 NEXT_PASS (pass_copy_prop);
1359 NEXT_PASS (pass_dce_loop);
1361 NEXT_PASS (pass_iv_canon);
1362 NEXT_PASS (pass_if_conversion);
1363 NEXT_PASS (pass_vectorize);
1365 struct opt_pass **p = &pass_vectorize.pass.sub;
1366 NEXT_PASS (pass_dce_loop);
1368 NEXT_PASS (pass_predcom);
1369 NEXT_PASS (pass_complete_unroll);
1370 NEXT_PASS (pass_slp_vectorize);
1371 NEXT_PASS (pass_parallelize_loops);
1372 NEXT_PASS (pass_loop_prefetch);
1373 NEXT_PASS (pass_iv_optimize);
1374 NEXT_PASS (pass_lim);
1375 NEXT_PASS (pass_tree_loop_done);
1377 NEXT_PASS (pass_lower_vector_ssa);
1378 NEXT_PASS (pass_cse_reciprocals);
1379 NEXT_PASS (pass_reassoc);
1380 NEXT_PASS (pass_vrp);
1381 NEXT_PASS (pass_dominator);
1382 /* The only const/copy propagation opportunities left after
1383 DOM should be due to degenerate PHI nodes. So rather than
1384 run the full propagators, run a specialized pass which
1385 only examines PHIs to discover const/copy propagation
1387 NEXT_PASS (pass_phi_only_cprop);
1388 NEXT_PASS (pass_cd_dce);
1389 NEXT_PASS (pass_tracer);
1391 /* FIXME: If DCE is not run before checking for uninitialized uses,
1392 we may get false warnings (e.g., testsuite/gcc.dg/uninit-5.c).
1393 However, this also causes us to misdiagnose cases that should be
1394 real warnings (e.g., testsuite/gcc.dg/pr18501.c).
1396 To fix the false positives in uninit-5.c, we would have to
1397 account for the predicates protecting the set and the use of each
1398 variable. Using a representation like Gated Single Assignment
1400 NEXT_PASS (pass_late_warn_uninitialized);
1401 NEXT_PASS (pass_dse);
1402 NEXT_PASS (pass_forwprop);
1403 NEXT_PASS (pass_phiopt);
1404 NEXT_PASS (pass_fold_builtins);
1405 NEXT_PASS (pass_optimize_widening_mul);
1406 NEXT_PASS (pass_tail_calls);
1407 NEXT_PASS (pass_rename_ssa_copies);
1408 NEXT_PASS (pass_uncprop);
1409 NEXT_PASS (pass_local_pure_const);
1411 NEXT_PASS (pass_tm_init);
1413 struct opt_pass **p = &pass_tm_init.pass.sub;
1414 NEXT_PASS (pass_tm_mark);
1415 NEXT_PASS (pass_tm_memopt);
1416 NEXT_PASS (pass_tm_edges);
1418 NEXT_PASS (pass_lower_complex_O0);
1419 NEXT_PASS (pass_cleanup_eh);
1420 NEXT_PASS (pass_lower_resx);
1421 NEXT_PASS (pass_nrv);
1422 NEXT_PASS (pass_mudflap_2);
1423 NEXT_PASS (pass_cleanup_cfg_post_optimizing);
1424 NEXT_PASS (pass_warn_function_noreturn);
1426 NEXT_PASS (pass_expand);
1428 NEXT_PASS (pass_rest_of_compilation);
1430 struct opt_pass **p = &pass_rest_of_compilation.pass.sub;
1431 NEXT_PASS (pass_init_function);
1432 NEXT_PASS (pass_jump);
1433 NEXT_PASS (pass_rtl_eh);
1434 NEXT_PASS (pass_initial_value_sets);
1435 NEXT_PASS (pass_unshare_all_rtl);
1436 NEXT_PASS (pass_instantiate_virtual_regs);
1437 NEXT_PASS (pass_into_cfg_layout_mode);
1438 NEXT_PASS (pass_jump2);
1439 NEXT_PASS (pass_lower_subreg);
1440 NEXT_PASS (pass_df_initialize_opt);
1441 NEXT_PASS (pass_cse);
1442 NEXT_PASS (pass_rtl_fwprop);
1443 NEXT_PASS (pass_rtl_cprop);
1444 NEXT_PASS (pass_rtl_pre);
1445 NEXT_PASS (pass_rtl_hoist);
1446 NEXT_PASS (pass_rtl_cprop);
1447 NEXT_PASS (pass_rtl_store_motion);
1448 NEXT_PASS (pass_cse_after_global_opts);
1449 NEXT_PASS (pass_rtl_ifcvt);
1450 NEXT_PASS (pass_reginfo_init);
1451 /* Perform loop optimizations. It might be better to do them a bit
1452 sooner, but we want the profile feedback to work more
1454 NEXT_PASS (pass_loop2);
1456 struct opt_pass **p = &pass_loop2.pass.sub;
1457 NEXT_PASS (pass_rtl_loop_init);
1458 NEXT_PASS (pass_rtl_move_loop_invariants);
1459 NEXT_PASS (pass_rtl_unswitch);
1460 NEXT_PASS (pass_rtl_unroll_and_peel_loops);
1461 NEXT_PASS (pass_rtl_doloop);
1462 NEXT_PASS (pass_rtl_loop_done);
1465 NEXT_PASS (pass_web);
1466 NEXT_PASS (pass_rtl_cprop);
1467 NEXT_PASS (pass_cse2);
1468 NEXT_PASS (pass_rtl_dse1);
1469 NEXT_PASS (pass_rtl_fwprop_addr);
1470 NEXT_PASS (pass_inc_dec);
1471 NEXT_PASS (pass_initialize_regs);
1472 NEXT_PASS (pass_ud_rtl_dce);
1473 NEXT_PASS (pass_combine);
1474 NEXT_PASS (pass_if_after_combine);
1475 NEXT_PASS (pass_partition_blocks);
1476 NEXT_PASS (pass_regmove);
1477 NEXT_PASS (pass_outof_cfg_layout_mode);
1478 NEXT_PASS (pass_split_all_insns);
1479 NEXT_PASS (pass_lower_subreg2);
1480 NEXT_PASS (pass_df_initialize_no_opt);
1481 NEXT_PASS (pass_stack_ptr_mod);
1482 NEXT_PASS (pass_mode_switching);
1483 NEXT_PASS (pass_match_asm_constraints);
1484 NEXT_PASS (pass_sms);
1485 NEXT_PASS (pass_sched);
1486 NEXT_PASS (pass_ira);
1487 NEXT_PASS (pass_reload);
1488 NEXT_PASS (pass_postreload);
1490 struct opt_pass **p = &pass_postreload.pass.sub;
1491 NEXT_PASS (pass_postreload_cse);
1492 NEXT_PASS (pass_gcse2);
1493 NEXT_PASS (pass_split_after_reload);
1494 NEXT_PASS (pass_ree);
1495 NEXT_PASS (pass_compare_elim_after_reload);
1496 NEXT_PASS (pass_branch_target_load_optimize1);
1497 NEXT_PASS (pass_thread_prologue_and_epilogue);
1498 NEXT_PASS (pass_rtl_dse2);
1499 NEXT_PASS (pass_stack_adjustments);
1500 NEXT_PASS (pass_peephole2);
1501 NEXT_PASS (pass_if_after_reload);
1502 NEXT_PASS (pass_regrename);
1503 NEXT_PASS (pass_cprop_hardreg);
1504 NEXT_PASS (pass_fast_rtl_dce);
1505 NEXT_PASS (pass_reorder_blocks);
1506 NEXT_PASS (pass_branch_target_load_optimize2);
1507 NEXT_PASS (pass_leaf_regs);
1508 NEXT_PASS (pass_split_before_sched2);
1509 NEXT_PASS (pass_sched2);
1510 NEXT_PASS (pass_stack_regs);
1512 struct opt_pass **p = &pass_stack_regs.pass.sub;
1513 NEXT_PASS (pass_split_before_regstack);
1514 NEXT_PASS (pass_stack_regs_run);
1516 NEXT_PASS (pass_compute_alignments);
1517 NEXT_PASS (pass_duplicate_computed_gotos);
1518 NEXT_PASS (pass_variable_tracking);
1519 NEXT_PASS (pass_free_cfg);
1520 NEXT_PASS (pass_machine_reorg);
1521 NEXT_PASS (pass_cleanup_barriers);
1522 NEXT_PASS (pass_delay_slots);
1523 NEXT_PASS (pass_split_for_shorten_branches);
1524 NEXT_PASS (pass_convert_to_eh_region_ranges);
1525 NEXT_PASS (pass_shorten_branches);
1526 NEXT_PASS (pass_set_nothrow_function_flags);
1527 NEXT_PASS (pass_dwarf2_frame);
1528 NEXT_PASS (pass_final);
1530 NEXT_PASS (pass_df_finish);
1532 NEXT_PASS (pass_clean_state);
1537 /* Register the passes with the tree dump code. */
1538 register_dump_files (all_lowering_passes, PROP_gimple_any);
1539 register_dump_files (all_small_ipa_passes,
1540 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1542 register_dump_files (all_regular_ipa_passes,
1543 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1545 register_dump_files (all_lto_gen_passes,
1546 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1548 register_dump_files (all_late_ipa_passes,
1549 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1551 register_dump_files (all_passes,
1552 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1556 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
1557 function CALLBACK for every function in the call graph. Otherwise,
1558 call CALLBACK on the current function. */
1561 do_per_function (void (*callback) (void *data), void *data)
1563 if (current_function_decl)
1567 struct cgraph_node *node;
1568 for (node = cgraph_nodes; node; node = node->next)
1569 if (node->analyzed && gimple_has_body_p (node->decl)
1570 && (!node->clone_of || node->decl != node->clone_of->decl))
1572 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
1573 current_function_decl = node->decl;
1577 free_dominance_info (CDI_DOMINATORS);
1578 free_dominance_info (CDI_POST_DOMINATORS);
1580 current_function_decl = NULL;
1587 /* Because inlining might remove no-longer reachable nodes, we need to
1588 keep the array visible to garbage collector to avoid reading collected
1591 static GTY ((length ("nnodes"))) cgraph_node_ptr *order;
1593 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
1594 function CALLBACK for every function in the call graph. Otherwise,
1595 call CALLBACK on the current function.
1596 This function is global so that plugins can use it. */
1598 do_per_function_toporder (void (*callback) (void *data), void *data)
1602 if (current_function_decl)
1606 gcc_assert (!order);
1607 order = ggc_alloc_vec_cgraph_node_ptr (cgraph_n_nodes);
1608 nnodes = ipa_reverse_postorder (order);
1609 for (i = nnodes - 1; i >= 0; i--)
1610 order[i]->process = 1;
1611 for (i = nnodes - 1; i >= 0; i--)
1613 struct cgraph_node *node = order[i];
1615 /* Allow possibly removed nodes to be garbage collected. */
1618 if (cgraph_function_with_gimple_body_p (node))
1620 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
1621 current_function_decl = node->decl;
1623 free_dominance_info (CDI_DOMINATORS);
1624 free_dominance_info (CDI_POST_DOMINATORS);
1625 current_function_decl = NULL;
1636 /* Helper function to perform function body dump. */
1639 execute_function_dump (void *data ATTRIBUTE_UNUSED)
1641 if (dump_file && current_function_decl)
1643 if (cfun->curr_properties & PROP_trees)
1644 dump_function_to_file (current_function_decl, dump_file, dump_flags);
1647 if (dump_flags & TDF_SLIM)
1648 print_rtl_slim_with_bb (dump_file, get_insns (), dump_flags);
1649 else if ((cfun->curr_properties & PROP_cfg)
1650 && (dump_flags & TDF_BLOCKS))
1651 print_rtl_with_bb (dump_file, get_insns ());
1653 print_rtl (dump_file, get_insns ());
1655 if ((cfun->curr_properties & PROP_cfg)
1656 && graph_dump_format != no_graph
1657 && (dump_flags & TDF_GRAPH))
1658 print_rtl_graph_with_bb (dump_file_name, get_insns ());
1661 /* Flush the file. If verification fails, we won't be able to
1662 close the file before aborting. */
1667 /* Perform all TODO actions that ought to be done on each function. */
1670 execute_function_todo (void *data)
1672 unsigned int flags = (size_t)data;
1673 flags &= ~cfun->last_verified;
1677 /* Always cleanup the CFG before trying to update SSA. */
1678 if (flags & TODO_cleanup_cfg)
1680 bool cleanup = cleanup_tree_cfg ();
1682 if (cleanup && (cfun->curr_properties & PROP_ssa))
1683 flags |= TODO_remove_unused_locals;
1685 /* When cleanup_tree_cfg merges consecutive blocks, it may
1686 perform some simplistic propagation when removing single
1687 valued PHI nodes. This propagation may, in turn, cause the
1688 SSA form to become out-of-date (see PR 22037). So, even
1689 if the parent pass had not scheduled an SSA update, we may
1690 still need to do one. */
1691 if (!(flags & TODO_update_ssa_any) && need_ssa_update_p (cfun))
1692 flags |= TODO_update_ssa;
1695 if (flags & TODO_update_ssa_any)
1697 unsigned update_flags = flags & TODO_update_ssa_any;
1698 update_ssa (update_flags);
1699 cfun->last_verified &= ~TODO_verify_ssa;
1702 if (flags & TODO_rebuild_alias)
1704 execute_update_addresses_taken ();
1705 compute_may_aliases ();
1707 else if (optimize && (flags & TODO_update_address_taken))
1708 execute_update_addresses_taken ();
1710 if (flags & TODO_remove_unused_locals)
1711 remove_unused_locals ();
1713 if (flags & TODO_rebuild_frequencies)
1714 rebuild_frequencies ();
1716 if (flags & TODO_rebuild_cgraph_edges)
1717 rebuild_cgraph_edges ();
1719 /* If we've seen errors do not bother running any verifiers. */
1723 #if defined ENABLE_CHECKING
1724 if (flags & TODO_verify_ssa
1725 || (current_loops && loops_state_satisfies_p (LOOP_CLOSED_SSA)))
1727 if (flags & TODO_verify_flow)
1728 verify_flow_info ();
1729 if (flags & TODO_verify_stmts)
1730 verify_gimple_in_cfg (cfun);
1731 if (current_loops && loops_state_satisfies_p (LOOP_CLOSED_SSA))
1732 verify_loop_closed_ssa (false);
1733 if (flags & TODO_verify_rtl_sharing)
1734 verify_rtl_sharing ();
1737 cfun->last_verified = flags & TODO_verify_all;
1740 /* Perform all TODO actions. */
1742 execute_todo (unsigned int flags)
1744 #if defined ENABLE_CHECKING
1746 && need_ssa_update_p (cfun))
1747 gcc_assert (flags & TODO_update_ssa_any);
1750 timevar_push (TV_TODO);
1752 /* Inform the pass whether it is the first time it is run. */
1753 first_pass_instance = (flags & TODO_mark_first_instance) != 0;
1755 statistics_fini_pass ();
1757 do_per_function (execute_function_todo, (void *)(size_t) flags);
1759 /* Always remove functions just as before inlining: IPA passes might be
1760 interested to see bodies of extern inline functions that are not inlined
1761 to analyze side effects. The full removal is done just at the end
1762 of IPA pass queue. */
1763 if (flags & TODO_remove_functions)
1766 cgraph_remove_unreachable_nodes (true, dump_file);
1769 if ((flags & TODO_dump_cgraph) && dump_file && !current_function_decl)
1772 dump_cgraph (dump_file);
1773 /* Flush the file. If verification fails, we won't be able to
1774 close the file before aborting. */
1778 if (flags & TODO_ggc_collect)
1781 /* Now that the dumping has been done, we can get rid of the optional
1783 if (flags & TODO_df_finish)
1784 df_finish_pass ((flags & TODO_df_verify) != 0);
1786 timevar_pop (TV_TODO);
1789 /* Verify invariants that should hold between passes. This is a place
1790 to put simple sanity checks. */
1793 verify_interpass_invariants (void)
1795 gcc_checking_assert (!fold_deferring_overflow_warnings_p ());
1798 /* Clear the last verified flag. */
1801 clear_last_verified (void *data ATTRIBUTE_UNUSED)
1803 cfun->last_verified = 0;
1806 /* Helper function. Verify that the properties has been turn into the
1807 properties expected by the pass. */
1809 #ifdef ENABLE_CHECKING
1811 verify_curr_properties (void *data)
1813 unsigned int props = (size_t)data;
1814 gcc_assert ((cfun->curr_properties & props) == props);
1818 /* Initialize pass dump file. */
1819 /* This is non-static so that the plugins can use it. */
1822 pass_init_dump_file (struct opt_pass *pass)
1824 /* If a dump file name is present, open it if enabled. */
1825 if (pass->static_pass_number != -1)
1827 bool initializing_dump = !dump_initialized_p (pass->static_pass_number);
1828 dump_file_name = get_dump_file_name (pass->static_pass_number);
1829 dump_file = dump_begin (pass->static_pass_number, &dump_flags);
1830 if (dump_file && current_function_decl)
1831 dump_function_header (dump_file, current_function_decl, dump_flags);
1832 return initializing_dump;
1838 /* Flush PASS dump file. */
1839 /* This is non-static so that plugins can use it. */
1842 pass_fini_dump_file (struct opt_pass *pass)
1844 /* Flush and close dump file. */
1847 free (CONST_CAST (char *, dump_file_name));
1848 dump_file_name = NULL;
1853 dump_end (pass->static_pass_number, dump_file);
1858 /* After executing the pass, apply expected changes to the function
1862 update_properties_after_pass (void *data)
1864 struct opt_pass *pass = (struct opt_pass *) data;
1865 cfun->curr_properties = (cfun->curr_properties | pass->properties_provided)
1866 & ~pass->properties_destroyed;
1869 /* Execute summary generation for all of the passes in IPA_PASS. */
1872 execute_ipa_summary_passes (struct ipa_opt_pass_d *ipa_pass)
1876 struct opt_pass *pass = &ipa_pass->pass;
1878 /* Execute all of the IPA_PASSes in the list. */
1879 if (ipa_pass->pass.type == IPA_PASS
1880 && (!pass->gate || pass->gate ())
1881 && ipa_pass->generate_summary)
1883 pass_init_dump_file (pass);
1885 /* If a timevar is present, start it. */
1887 timevar_push (pass->tv_id);
1889 ipa_pass->generate_summary ();
1893 timevar_pop (pass->tv_id);
1895 pass_fini_dump_file (pass);
1897 ipa_pass = (struct ipa_opt_pass_d *)ipa_pass->pass.next;
1901 /* Execute IPA_PASS function transform on NODE. */
1904 execute_one_ipa_transform_pass (struct cgraph_node *node,
1905 struct ipa_opt_pass_d *ipa_pass)
1907 struct opt_pass *pass = &ipa_pass->pass;
1908 unsigned int todo_after = 0;
1910 current_pass = pass;
1911 if (!ipa_pass->function_transform)
1914 /* Note that the folders should only create gimple expressions.
1915 This is a hack until the new folder is ready. */
1916 in_gimple_form = (cfun && (cfun->curr_properties & PROP_trees)) != 0;
1918 pass_init_dump_file (pass);
1920 /* Run pre-pass verification. */
1921 execute_todo (ipa_pass->function_transform_todo_flags_start);
1923 /* If a timevar is present, start it. */
1924 if (pass->tv_id != TV_NONE)
1925 timevar_push (pass->tv_id);
1928 todo_after = ipa_pass->function_transform (node);
1931 if (pass->tv_id != TV_NONE)
1932 timevar_pop (pass->tv_id);
1934 /* Run post-pass cleanup and verification. */
1935 execute_todo (todo_after);
1936 verify_interpass_invariants ();
1938 do_per_function (execute_function_dump, NULL);
1939 pass_fini_dump_file (pass);
1941 current_pass = NULL;
1944 /* For the current function, execute all ipa transforms. */
1947 execute_all_ipa_transforms (void)
1949 struct cgraph_node *node;
1952 node = cgraph_get_node (current_function_decl);
1954 if (node->ipa_transforms_to_apply)
1958 for (i = 0; i < VEC_length (ipa_opt_pass, node->ipa_transforms_to_apply);
1960 execute_one_ipa_transform_pass (node,
1961 VEC_index (ipa_opt_pass,
1962 node->ipa_transforms_to_apply,
1964 VEC_free (ipa_opt_pass, heap, node->ipa_transforms_to_apply);
1965 node->ipa_transforms_to_apply = NULL;
1969 /* Callback for do_per_function to apply all IPA transforms. */
1972 apply_ipa_transforms (void *data)
1974 struct cgraph_node *node = cgraph_get_node (current_function_decl);
1975 if (!node->global.inlined_to && node->ipa_transforms_to_apply)
1977 *(bool *)data = true;
1978 execute_all_ipa_transforms();
1979 rebuild_cgraph_edges ();
1983 /* Check if PASS is explicitly disabled or enabled and return
1984 the gate status. FUNC is the function to be processed, and
1985 GATE_STATUS is the gate status determined by pass manager by
1989 override_gate_status (struct opt_pass *pass, tree func, bool gate_status)
1991 bool explicitly_enabled = false;
1992 bool explicitly_disabled = false;
1995 = is_pass_explicitly_enabled_or_disabled (pass, func,
1996 enabled_pass_uid_range_tab);
1998 = is_pass_explicitly_enabled_or_disabled (pass, func,
1999 disabled_pass_uid_range_tab);
2001 gate_status = !explicitly_disabled && (gate_status || explicitly_enabled);
2010 execute_one_pass (struct opt_pass *pass)
2012 bool initializing_dump;
2013 unsigned int todo_after = 0;
2017 /* IPA passes are executed on whole program, so cfun should be NULL.
2018 Other passes need function context set. */
2019 if (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS)
2020 gcc_assert (!cfun && !current_function_decl);
2022 gcc_assert (cfun && current_function_decl);
2024 current_pass = pass;
2026 /* Check whether gate check should be avoided.
2027 User controls the value of the gate through the parameter "gate_status". */
2028 gate_status = (pass->gate == NULL) ? true : pass->gate();
2029 gate_status = override_gate_status (pass, current_function_decl, gate_status);
2031 /* Override gate with plugin. */
2032 invoke_plugin_callbacks (PLUGIN_OVERRIDE_GATE, &gate_status);
2036 current_pass = NULL;
2040 /* Pass execution event trigger: useful to identify passes being
2042 invoke_plugin_callbacks (PLUGIN_PASS_EXECUTION, pass);
2044 /* SIPLE IPA passes do not handle callgraphs with IPA transforms in it.
2045 Apply all trnasforms first. */
2046 if (pass->type == SIMPLE_IPA_PASS)
2048 bool applied = false;
2049 do_per_function (apply_ipa_transforms, (void *)&applied);
2051 cgraph_remove_unreachable_nodes (true, dump_file);
2052 /* Restore current_pass. */
2053 current_pass = pass;
2056 if (!quiet_flag && !cfun)
2057 fprintf (stderr, " <%s>", pass->name ? pass->name : "");
2059 /* Note that the folders should only create gimple expressions.
2060 This is a hack until the new folder is ready. */
2061 in_gimple_form = (cfun && (cfun->curr_properties & PROP_trees)) != 0;
2063 initializing_dump = pass_init_dump_file (pass);
2065 /* Run pre-pass verification. */
2066 execute_todo (pass->todo_flags_start);
2068 #ifdef ENABLE_CHECKING
2069 do_per_function (verify_curr_properties,
2070 (void *)(size_t)pass->properties_required);
2073 /* If a timevar is present, start it. */
2074 if (pass->tv_id != TV_NONE)
2075 timevar_push (pass->tv_id);
2080 todo_after = pass->execute ();
2081 do_per_function (clear_last_verified, NULL);
2085 if (pass->tv_id != TV_NONE)
2086 timevar_pop (pass->tv_id);
2088 do_per_function (update_properties_after_pass, pass);
2090 if (initializing_dump
2092 && graph_dump_format != no_graph
2094 && (cfun->curr_properties & (PROP_cfg | PROP_rtl))
2095 == (PROP_cfg | PROP_rtl))
2097 get_dump_file_info (pass->static_pass_number)->flags |= TDF_GRAPH;
2098 dump_flags |= TDF_GRAPH;
2099 clean_graph_dump_file (dump_file_name);
2102 /* Run post-pass cleanup and verification. */
2103 execute_todo (todo_after | pass->todo_flags_finish);
2104 verify_interpass_invariants ();
2105 do_per_function (execute_function_dump, NULL);
2106 if (pass->type == IPA_PASS)
2108 struct cgraph_node *node;
2109 FOR_EACH_FUNCTION_WITH_GIMPLE_BODY (node)
2110 VEC_safe_push (ipa_opt_pass, heap, node->ipa_transforms_to_apply,
2111 (struct ipa_opt_pass_d *)pass);
2114 if (!current_function_decl)
2115 cgraph_process_new_functions ();
2117 pass_fini_dump_file (pass);
2119 if (pass->type != SIMPLE_IPA_PASS && pass->type != IPA_PASS)
2120 gcc_assert (!(cfun->curr_properties & PROP_trees)
2121 || pass->type != RTL_PASS);
2123 current_pass = NULL;
2129 execute_pass_list (struct opt_pass *pass)
2133 gcc_assert (pass->type == GIMPLE_PASS
2134 || pass->type == RTL_PASS);
2135 if (execute_one_pass (pass) && pass->sub)
2136 execute_pass_list (pass->sub);
2142 /* Same as execute_pass_list but assume that subpasses of IPA passes
2143 are local passes. If SET is not NULL, write out summaries of only
2144 those node in SET. */
2147 ipa_write_summaries_2 (struct opt_pass *pass, cgraph_node_set set,
2148 varpool_node_set vset,
2149 struct lto_out_decl_state *state)
2153 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *)pass;
2154 gcc_assert (!current_function_decl);
2156 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
2157 if (pass->type == IPA_PASS
2158 && ipa_pass->write_summary
2159 && (!pass->gate || pass->gate ()))
2161 /* If a timevar is present, start it. */
2163 timevar_push (pass->tv_id);
2165 pass_init_dump_file (pass);
2167 ipa_pass->write_summary (set,vset);
2169 pass_fini_dump_file (pass);
2171 /* If a timevar is present, start it. */
2173 timevar_pop (pass->tv_id);
2176 if (pass->sub && pass->sub->type != GIMPLE_PASS)
2177 ipa_write_summaries_2 (pass->sub, set, vset, state);
2183 /* Helper function of ipa_write_summaries. Creates and destroys the
2184 decl state and calls ipa_write_summaries_2 for all passes that have
2185 summaries. SET is the set of nodes to be written. */
2188 ipa_write_summaries_1 (cgraph_node_set set, varpool_node_set vset)
2190 struct lto_out_decl_state *state = lto_new_out_decl_state ();
2191 compute_ltrans_boundary (state, set, vset);
2193 lto_push_out_decl_state (state);
2195 gcc_assert (!flag_wpa);
2196 ipa_write_summaries_2 (all_regular_ipa_passes, set, vset, state);
2197 ipa_write_summaries_2 (all_lto_gen_passes, set, vset, state);
2199 gcc_assert (lto_get_out_decl_state () == state);
2200 lto_pop_out_decl_state ();
2201 lto_delete_out_decl_state (state);
2204 /* Write out summaries for all the nodes in the callgraph. */
2207 ipa_write_summaries (void)
2209 cgraph_node_set set;
2210 varpool_node_set vset;
2211 struct cgraph_node **order;
2212 struct varpool_node *vnode;
2215 if (!flag_generate_lto || seen_error ())
2218 set = cgraph_node_set_new ();
2220 /* Create the callgraph set in the same order used in
2221 cgraph_expand_all_functions. This mostly facilitates debugging,
2222 since it causes the gimple file to be processed in the same order
2223 as the source code. */
2224 order = XCNEWVEC (struct cgraph_node *, cgraph_n_nodes);
2225 order_pos = ipa_reverse_postorder (order);
2226 gcc_assert (order_pos == cgraph_n_nodes);
2228 for (i = order_pos - 1; i >= 0; i--)
2230 struct cgraph_node *node = order[i];
2232 if (cgraph_function_with_gimple_body_p (node))
2234 /* When streaming out references to statements as part of some IPA
2235 pass summary, the statements need to have uids assigned and the
2236 following does that for all the IPA passes here. Naturally, this
2237 ordering then matches the one IPA-passes get in their stmt_fixup
2240 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
2241 renumber_gimple_stmt_uids ();
2245 cgraph_node_set_add (set, node);
2247 vset = varpool_node_set_new ();
2249 for (vnode = varpool_nodes; vnode; vnode = vnode->next)
2250 if (vnode->needed && (!vnode->alias || vnode->alias_of))
2251 varpool_node_set_add (vset, vnode);
2253 ipa_write_summaries_1 (set, vset);
2256 free_cgraph_node_set (set);
2257 free_varpool_node_set (vset);
2260 /* Same as execute_pass_list but assume that subpasses of IPA passes
2261 are local passes. If SET is not NULL, write out optimization summaries of
2262 only those node in SET. */
2265 ipa_write_optimization_summaries_1 (struct opt_pass *pass, cgraph_node_set set,
2266 varpool_node_set vset,
2267 struct lto_out_decl_state *state)
2271 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *)pass;
2272 gcc_assert (!current_function_decl);
2274 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
2275 if (pass->type == IPA_PASS
2276 && ipa_pass->write_optimization_summary
2277 && (!pass->gate || pass->gate ()))
2279 /* If a timevar is present, start it. */
2281 timevar_push (pass->tv_id);
2283 pass_init_dump_file (pass);
2285 ipa_pass->write_optimization_summary (set, vset);
2287 pass_fini_dump_file (pass);
2289 /* If a timevar is present, start it. */
2291 timevar_pop (pass->tv_id);
2294 if (pass->sub && pass->sub->type != GIMPLE_PASS)
2295 ipa_write_optimization_summaries_1 (pass->sub, set, vset, state);
2301 /* Write all the optimization summaries for the cgraph nodes in SET. If SET is
2302 NULL, write out all summaries of all nodes. */
2305 ipa_write_optimization_summaries (cgraph_node_set set, varpool_node_set vset)
2307 struct lto_out_decl_state *state = lto_new_out_decl_state ();
2308 cgraph_node_set_iterator csi;
2309 compute_ltrans_boundary (state, set, vset);
2311 lto_push_out_decl_state (state);
2312 for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi))
2314 struct cgraph_node *node = csi_node (csi);
2315 /* When streaming out references to statements as part of some IPA
2316 pass summary, the statements need to have uids assigned.
2318 For functions newly born at WPA stage we need to initialize
2321 && gimple_has_body_p (node->decl))
2323 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
2324 renumber_gimple_stmt_uids ();
2329 gcc_assert (flag_wpa);
2330 ipa_write_optimization_summaries_1 (all_regular_ipa_passes, set, vset, state);
2331 ipa_write_optimization_summaries_1 (all_lto_gen_passes, set, vset, state);
2333 gcc_assert (lto_get_out_decl_state () == state);
2334 lto_pop_out_decl_state ();
2335 lto_delete_out_decl_state (state);
2338 /* Same as execute_pass_list but assume that subpasses of IPA passes
2339 are local passes. */
2342 ipa_read_summaries_1 (struct opt_pass *pass)
2346 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *) pass;
2348 gcc_assert (!current_function_decl);
2350 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
2352 if (pass->gate == NULL || pass->gate ())
2354 if (pass->type == IPA_PASS && ipa_pass->read_summary)
2356 /* If a timevar is present, start it. */
2358 timevar_push (pass->tv_id);
2360 pass_init_dump_file (pass);
2362 ipa_pass->read_summary ();
2364 pass_fini_dump_file (pass);
2368 timevar_pop (pass->tv_id);
2371 if (pass->sub && pass->sub->type != GIMPLE_PASS)
2372 ipa_read_summaries_1 (pass->sub);
2379 /* Read all the summaries for all_regular_ipa_passes and all_lto_gen_passes. */
2382 ipa_read_summaries (void)
2384 ipa_read_summaries_1 (all_regular_ipa_passes);
2385 ipa_read_summaries_1 (all_lto_gen_passes);
2388 /* Same as execute_pass_list but assume that subpasses of IPA passes
2389 are local passes. */
2392 ipa_read_optimization_summaries_1 (struct opt_pass *pass)
2396 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *) pass;
2398 gcc_assert (!current_function_decl);
2400 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
2402 if (pass->gate == NULL || pass->gate ())
2404 if (pass->type == IPA_PASS && ipa_pass->read_optimization_summary)
2406 /* If a timevar is present, start it. */
2408 timevar_push (pass->tv_id);
2410 pass_init_dump_file (pass);
2412 ipa_pass->read_optimization_summary ();
2414 pass_fini_dump_file (pass);
2418 timevar_pop (pass->tv_id);
2421 if (pass->sub && pass->sub->type != GIMPLE_PASS)
2422 ipa_read_optimization_summaries_1 (pass->sub);
2428 /* Read all the summaries for all_regular_ipa_passes and all_lto_gen_passes. */
2431 ipa_read_optimization_summaries (void)
2433 ipa_read_optimization_summaries_1 (all_regular_ipa_passes);
2434 ipa_read_optimization_summaries_1 (all_lto_gen_passes);
2437 /* Same as execute_pass_list but assume that subpasses of IPA passes
2438 are local passes. */
2440 execute_ipa_pass_list (struct opt_pass *pass)
2444 gcc_assert (!current_function_decl);
2446 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
2447 if (execute_one_pass (pass) && pass->sub)
2449 if (pass->sub->type == GIMPLE_PASS)
2451 invoke_plugin_callbacks (PLUGIN_EARLY_GIMPLE_PASSES_START, NULL);
2452 do_per_function_toporder ((void (*)(void *))execute_pass_list,
2454 invoke_plugin_callbacks (PLUGIN_EARLY_GIMPLE_PASSES_END, NULL);
2456 else if (pass->sub->type == SIMPLE_IPA_PASS
2457 || pass->sub->type == IPA_PASS)
2458 execute_ipa_pass_list (pass->sub);
2462 gcc_assert (!current_function_decl);
2463 cgraph_process_new_functions ();
2469 /* Execute stmt fixup hooks of all passes in PASS for NODE and STMTS. */
2472 execute_ipa_stmt_fixups (struct opt_pass *pass,
2473 struct cgraph_node *node, gimple *stmts)
2477 /* Execute all of the IPA_PASSes in the list. */
2478 if (pass->type == IPA_PASS
2479 && (!pass->gate || pass->gate ()))
2481 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *) pass;
2483 if (ipa_pass->stmt_fixup)
2485 pass_init_dump_file (pass);
2486 /* If a timevar is present, start it. */
2488 timevar_push (pass->tv_id);
2490 ipa_pass->stmt_fixup (node, stmts);
2494 timevar_pop (pass->tv_id);
2495 pass_fini_dump_file (pass);
2498 execute_ipa_stmt_fixups (pass->sub, node, stmts);
2504 /* Execute stmt fixup hooks of all IPA passes for NODE and STMTS. */
2507 execute_all_ipa_stmt_fixups (struct cgraph_node *node, gimple *stmts)
2509 execute_ipa_stmt_fixups (all_regular_ipa_passes, node, stmts);
2513 extern void debug_properties (unsigned int);
2514 extern void dump_properties (FILE *, unsigned int);
2517 dump_properties (FILE *dump, unsigned int props)
2519 fprintf (dump, "Properties:\n");
2520 if (props & PROP_gimple_any)
2521 fprintf (dump, "PROP_gimple_any\n");
2522 if (props & PROP_gimple_lcf)
2523 fprintf (dump, "PROP_gimple_lcf\n");
2524 if (props & PROP_gimple_leh)
2525 fprintf (dump, "PROP_gimple_leh\n");
2526 if (props & PROP_cfg)
2527 fprintf (dump, "PROP_cfg\n");
2528 if (props & PROP_referenced_vars)
2529 fprintf (dump, "PROP_referenced_vars\n");
2530 if (props & PROP_ssa)
2531 fprintf (dump, "PROP_ssa\n");
2532 if (props & PROP_no_crit_edges)
2533 fprintf (dump, "PROP_no_crit_edges\n");
2534 if (props & PROP_rtl)
2535 fprintf (dump, "PROP_rtl\n");
2536 if (props & PROP_gimple_lomp)
2537 fprintf (dump, "PROP_gimple_lomp\n");
2538 if (props & PROP_gimple_lcx)
2539 fprintf (dump, "PROP_gimple_lcx\n");
2540 if (props & PROP_cfglayout)
2541 fprintf (dump, "PROP_cfglayout\n");
2545 debug_properties (unsigned int props)
2547 dump_properties (stderr, props);
2550 /* Called by local passes to see if function is called by already processed nodes.
2551 Because we process nodes in topological order, this means that function is
2552 in recursive cycle or we introduced new direct calls. */
2554 function_called_by_processed_nodes_p (void)
2556 struct cgraph_edge *e;
2557 for (e = cgraph_get_node (current_function_decl)->callers;
2561 if (e->caller->decl == current_function_decl)
2563 if (!cgraph_function_with_gimple_body_p (e->caller))
2565 if (TREE_ASM_WRITTEN (e->caller->decl))
2567 if (!e->caller->process && !e->caller->global.inlined_to)
2572 fprintf (dump_file, "Already processed call to:\n");
2573 dump_cgraph_node (dump_file, e->caller);
2578 #include "gt-passes.h"