PR tree-optimization/43833
[official-gcc/alias-decl.git] / gcc / passes.c
bloba6e5af5084156300a93749e2fd1daa80e8683237
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
11 version.
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
16 for more details.
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. */
27 #include "config.h"
28 #undef FLOAT /* This is for hpux. They should change hpux. */
29 #undef FFS /* Some systems define this in param.h. */
30 #include "system.h"
31 #include "coretypes.h"
32 #include "tm.h"
33 #include <signal.h>
35 #ifdef HAVE_SYS_RESOURCE_H
36 # include <sys/resource.h>
37 #endif
39 #ifdef HAVE_SYS_TIMES_H
40 # include <sys/times.h>
41 #endif
43 #include "line-map.h"
44 #include "input.h"
45 #include "tree.h"
46 #include "rtl.h"
47 #include "tm_p.h"
48 #include "flags.h"
49 #include "insn-attr.h"
50 #include "insn-config.h"
51 #include "insn-flags.h"
52 #include "hard-reg-set.h"
53 #include "recog.h"
54 #include "output.h"
55 #include "except.h"
56 #include "function.h"
57 #include "toplev.h"
58 #include "expr.h"
59 #include "basic-block.h"
60 #include "intl.h"
61 #include "ggc.h"
62 #include "graph.h"
63 #include "regs.h"
64 #include "timevar.h"
65 #include "diagnostic.h"
66 #include "params.h"
67 #include "reload.h"
68 #include "dwarf2asm.h"
69 #include "integrate.h"
70 #include "real.h"
71 #include "debug.h"
72 #include "target.h"
73 #include "langhooks.h"
74 #include "cfglayout.h"
75 #include "cfgloop.h"
76 #include "hosthooks.h"
77 #include "cgraph.h"
78 #include "opts.h"
79 #include "coverage.h"
80 #include "value-prof.h"
81 #include "tree-inline.h"
82 #include "tree-flow.h"
83 #include "tree-pass.h"
84 #include "tree-dump.h"
85 #include "df.h"
86 #include "predict.h"
87 #include "lto-streamer.h"
88 #include "plugin.h"
90 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
91 #include "dwarf2out.h"
92 #endif
94 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
95 #include "dbxout.h"
96 #endif
98 #ifdef SDB_DEBUGGING_INFO
99 #include "sdbout.h"
100 #endif
102 #ifdef XCOFF_DEBUGGING_INFO
103 #include "xcoffout.h" /* Needed for external data
104 declarations for e.g. AIX 4.x. */
105 #endif
107 /* This is used for debugging. It allows the current pass to printed
108 from anywhere in compilation.
109 The variable current_pass is also used for statistics and plugins. */
110 struct opt_pass *current_pass;
112 /* Call from anywhere to find out what pass this is. Useful for
113 printing out debugging information deep inside an service
114 routine. */
115 void
116 print_current_pass (FILE *file)
118 if (current_pass)
119 fprintf (file, "current pass = %s (%d)\n",
120 current_pass->name, current_pass->static_pass_number);
121 else
122 fprintf (file, "no current pass.\n");
126 /* Call from the debugger to get the current pass name. */
127 void
128 debug_pass (void)
130 print_current_pass (stderr);
135 /* Global variables used to communicate with passes. */
136 int dump_flags;
137 bool in_gimple_form;
138 bool first_pass_instance;
141 /* This is called from various places for FUNCTION_DECL, VAR_DECL,
142 and TYPE_DECL nodes.
144 This does nothing for local (non-static) variables, unless the
145 variable is a register variable with DECL_ASSEMBLER_NAME set. In
146 that case, or if the variable is not an automatic, it sets up the
147 RTL and outputs any assembler code (label definition, storage
148 allocation and initialization).
150 DECL is the declaration. TOP_LEVEL is nonzero
151 if this declaration is not within a function. */
153 void
154 rest_of_decl_compilation (tree decl,
155 int top_level,
156 int at_end)
158 /* We deferred calling assemble_alias so that we could collect
159 other attributes such as visibility. Emit the alias now. */
161 tree alias;
162 alias = lookup_attribute ("alias", DECL_ATTRIBUTES (decl));
163 if (alias)
165 alias = TREE_VALUE (TREE_VALUE (alias));
166 alias = get_identifier (TREE_STRING_POINTER (alias));
167 assemble_alias (decl, alias);
171 /* Can't defer this, because it needs to happen before any
172 later function definitions are processed. */
173 if (DECL_ASSEMBLER_NAME_SET_P (decl) && DECL_REGISTER (decl))
174 make_decl_rtl (decl);
176 /* Forward declarations for nested functions are not "external",
177 but we need to treat them as if they were. */
178 if (TREE_STATIC (decl) || DECL_EXTERNAL (decl)
179 || TREE_CODE (decl) == FUNCTION_DECL)
181 timevar_push (TV_VARCONST);
183 /* Don't output anything when a tentative file-scope definition
184 is seen. But at end of compilation, do output code for them.
186 We do output all variables and rely on
187 callgraph code to defer them except for forward declarations
188 (see gcc.c-torture/compile/920624-1.c) */
189 if ((at_end
190 || !DECL_DEFER_OUTPUT (decl)
191 || DECL_INITIAL (decl))
192 && !DECL_EXTERNAL (decl))
194 if (TREE_CODE (decl) != FUNCTION_DECL)
195 varpool_finalize_decl (decl);
196 else
197 assemble_variable (decl, top_level, at_end, 0);
200 #ifdef ASM_FINISH_DECLARE_OBJECT
201 if (decl == last_assemble_variable_decl)
203 ASM_FINISH_DECLARE_OBJECT (asm_out_file, decl,
204 top_level, at_end);
206 #endif
208 timevar_pop (TV_VARCONST);
210 else if (TREE_CODE (decl) == TYPE_DECL
211 /* Like in rest_of_type_compilation, avoid confusing the debug
212 information machinery when there are errors. */
213 && !(sorrycount || errorcount))
215 timevar_push (TV_SYMOUT);
216 debug_hooks->type_decl (decl, !top_level);
217 timevar_pop (TV_SYMOUT);
220 /* Let cgraph know about the existence of variables. */
221 if (TREE_CODE (decl) == VAR_DECL && !DECL_EXTERNAL (decl))
222 varpool_node (decl);
225 /* Called after finishing a record, union or enumeral type. */
227 void
228 rest_of_type_compilation (tree type, int toplev)
230 /* Avoid confusing the debug information machinery when there are
231 errors. */
232 if (errorcount != 0 || sorrycount != 0)
233 return;
235 timevar_push (TV_SYMOUT);
236 debug_hooks->type_decl (TYPE_STUB_DECL (type), !toplev);
237 timevar_pop (TV_SYMOUT);
242 void
243 finish_optimization_passes (void)
245 int i;
246 struct dump_file_info *dfi;
247 char *name;
249 timevar_push (TV_DUMP);
250 if (profile_arc_flag || flag_test_coverage || flag_branch_probabilities)
252 dump_file = dump_begin (pass_profile.pass.static_pass_number, NULL);
253 end_branch_prob ();
254 if (dump_file)
255 dump_end (pass_profile.pass.static_pass_number, dump_file);
258 if (optimize > 0)
260 dump_file = dump_begin (pass_combine.pass.static_pass_number, NULL);
261 if (dump_file)
263 dump_combine_total_stats (dump_file);
264 dump_end (pass_combine.pass.static_pass_number, dump_file);
268 /* Do whatever is necessary to finish printing the graphs. */
269 if (graph_dump_format != no_graph)
270 for (i = TDI_end; (dfi = get_dump_file_info (i)) != NULL; ++i)
271 if (dump_initialized_p (i)
272 && (dfi->flags & TDF_GRAPH) != 0
273 && (name = get_dump_file_name (i)) != NULL)
275 finish_graph_dump_file (name);
276 free (name);
279 timevar_pop (TV_DUMP);
282 static bool
283 gate_rest_of_compilation (void)
285 /* Early return if there were errors. We can run afoul of our
286 consistency checks, and there's not really much point in fixing them. */
287 return !(rtl_dump_and_exit || flag_syntax_only || errorcount || sorrycount);
290 struct gimple_opt_pass pass_rest_of_compilation =
293 GIMPLE_PASS,
294 "*rest_of_compilation", /* name */
295 gate_rest_of_compilation, /* gate */
296 NULL, /* execute */
297 NULL, /* sub */
298 NULL, /* next */
299 0, /* static_pass_number */
300 TV_REST_OF_COMPILATION, /* tv_id */
301 PROP_rtl, /* properties_required */
302 0, /* properties_provided */
303 0, /* properties_destroyed */
304 0, /* todo_flags_start */
305 TODO_ggc_collect /* todo_flags_finish */
309 static bool
310 gate_postreload (void)
312 return reload_completed;
315 struct rtl_opt_pass pass_postreload =
318 RTL_PASS,
319 "*all-postreload", /* name */
320 gate_postreload, /* gate */
321 NULL, /* execute */
322 NULL, /* sub */
323 NULL, /* next */
324 0, /* static_pass_number */
325 TV_NONE, /* tv_id */
326 PROP_rtl, /* properties_required */
327 0, /* properties_provided */
328 0, /* properties_destroyed */
329 0, /* todo_flags_start */
330 TODO_ggc_collect | TODO_verify_rtl_sharing /* todo_flags_finish */
336 /* The root of the compilation pass tree, once constructed. */
337 struct opt_pass *all_passes, *all_small_ipa_passes, *all_lowering_passes,
338 *all_regular_ipa_passes, *all_lto_gen_passes;
340 /* This is used by plugins, and should also be used in register_pass. */
341 #define DEF_PASS_LIST(LIST) &LIST,
342 struct opt_pass **gcc_pass_lists[] = { GCC_PASS_LISTS NULL };
343 #undef DEF_PASS_LIST
345 /* A map from static pass id to optimization pass. */
346 struct opt_pass **passes_by_id;
347 int passes_by_id_size;
349 /* Set the static pass number of pass PASS to ID and record that
350 in the mapping from static pass number to pass. */
352 static void
353 set_pass_for_id (int id, struct opt_pass *pass)
355 pass->static_pass_number = id;
356 if (passes_by_id_size <= id)
358 passes_by_id = XRESIZEVEC (struct opt_pass *, passes_by_id, id + 1);
359 memset (passes_by_id + passes_by_id_size, 0,
360 (id + 1 - passes_by_id_size) * sizeof (void *));
361 passes_by_id_size = id + 1;
363 passes_by_id[id] = pass;
366 /* Return the pass with the static pass number ID. */
368 struct opt_pass *
369 get_pass_for_id (int id)
371 if (id >= passes_by_id_size)
372 return NULL;
373 return passes_by_id[id];
376 /* Iterate over the pass tree allocating dump file numbers. We want
377 to do this depth first, and independent of whether the pass is
378 enabled or not. */
380 void
381 register_one_dump_file (struct opt_pass *pass)
383 char *dot_name, *flag_name, *glob_name;
384 const char *name, *prefix;
385 char num[10];
386 int flags, id;
388 /* See below in next_pass_1. */
389 num[0] = '\0';
390 if (pass->static_pass_number != -1)
391 sprintf (num, "%d", ((int) pass->static_pass_number < 0
392 ? 1 : pass->static_pass_number));
394 /* The name is both used to identify the pass for the purposes of plugins,
395 and to specify dump file name and option.
396 The latter two might want something short which is not quite unique; for
397 that reason, we may have a disambiguating prefix, followed by a space
398 to mark the start of the following dump file name / option string. */
399 name = strchr (pass->name, ' ');
400 name = name ? name + 1 : pass->name;
401 dot_name = concat (".", name, num, NULL);
402 if (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS)
403 prefix = "ipa-", flags = TDF_IPA;
404 else if (pass->type == GIMPLE_PASS)
405 prefix = "tree-", flags = TDF_TREE;
406 else
407 prefix = "rtl-", flags = TDF_RTL;
409 flag_name = concat (prefix, name, num, NULL);
410 glob_name = concat (prefix, name, NULL);
411 id = dump_register (dot_name, flag_name, glob_name, flags);
412 set_pass_for_id (id, pass);
415 /* Recursive worker function for register_dump_files. */
417 static int
418 register_dump_files_1 (struct opt_pass *pass, int properties)
422 int new_properties = (properties | pass->properties_provided)
423 & ~pass->properties_destroyed;
425 if (pass->name && pass->name[0] != '*')
426 register_one_dump_file (pass);
428 if (pass->sub)
429 new_properties = register_dump_files_1 (pass->sub, new_properties);
431 /* If we have a gate, combine the properties that we could have with
432 and without the pass being examined. */
433 if (pass->gate)
434 properties &= new_properties;
435 else
436 properties = new_properties;
438 pass = pass->next;
440 while (pass);
442 return properties;
445 /* Register the dump files for the pipeline starting at PASS.
446 PROPERTIES reflects the properties that are guaranteed to be available at
447 the beginning of the pipeline. */
449 static void
450 register_dump_files (struct opt_pass *pass,int properties)
452 pass->properties_required |= properties;
453 register_dump_files_1 (pass, properties);
456 /* Look at the static_pass_number and duplicate the pass
457 if it is already added to a list. */
459 static struct opt_pass *
460 make_pass_instance (struct opt_pass *pass, bool track_duplicates)
462 /* A nonzero static_pass_number indicates that the
463 pass is already in the list. */
464 if (pass->static_pass_number)
466 struct opt_pass *new_pass;
468 if (pass->type == GIMPLE_PASS
469 || pass->type == RTL_PASS
470 || pass->type == SIMPLE_IPA_PASS)
472 new_pass = XNEW (struct opt_pass);
473 memcpy (new_pass, pass, sizeof (struct opt_pass));
475 else if (pass->type == IPA_PASS)
477 new_pass = (struct opt_pass *)XNEW (struct ipa_opt_pass_d);
478 memcpy (new_pass, pass, sizeof (struct ipa_opt_pass_d));
480 else
481 gcc_unreachable ();
483 new_pass->next = NULL;
485 new_pass->todo_flags_start &= ~TODO_mark_first_instance;
487 /* Indicate to register_dump_files that this pass has duplicates,
488 and so it should rename the dump file. The first instance will
489 be -1, and be number of duplicates = -static_pass_number - 1.
490 Subsequent instances will be > 0 and just the duplicate number. */
491 if ((pass->name && pass->name[0] != '*') || track_duplicates)
493 pass->static_pass_number -= 1;
494 new_pass->static_pass_number = -pass->static_pass_number;
496 return new_pass;
498 else
500 pass->todo_flags_start |= TODO_mark_first_instance;
501 pass->static_pass_number = -1;
503 invoke_plugin_callbacks (PLUGIN_NEW_PASS, pass);
505 return pass;
508 /* Add a pass to the pass list. Duplicate the pass if it's already
509 in the list. */
511 static struct opt_pass **
512 next_pass_1 (struct opt_pass **list, struct opt_pass *pass)
514 /* Every pass should have a name so that plugins can refer to them. */
515 gcc_assert (pass->name != NULL);
517 *list = make_pass_instance (pass, false);
519 return &(*list)->next;
522 /* List node for an inserted pass instance. We need to keep track of all
523 the newly-added pass instances (with 'added_pass_nodes' defined below)
524 so that we can register their dump files after pass-positioning is finished.
525 Registering dumping files needs to be post-processed or the
526 static_pass_number of the opt_pass object would be modified and mess up
527 the dump file names of future pass instances to be added. */
529 struct pass_list_node
531 struct opt_pass *pass;
532 struct pass_list_node *next;
535 static struct pass_list_node *added_pass_nodes = NULL;
536 static struct pass_list_node *prev_added_pass_node;
538 /* Insert the pass at the proper position. Return true if the pass
539 is successfully added.
541 NEW_PASS_INFO - new pass to be inserted
542 PASS_LIST - root of the pass list to insert the new pass to */
544 static bool
545 position_pass (struct register_pass_info *new_pass_info,
546 struct opt_pass **pass_list)
548 struct opt_pass *pass = *pass_list, *prev_pass = NULL;
549 bool success = false;
551 for ( ; pass; prev_pass = pass, pass = pass->next)
553 /* Check if the current pass is of the same type as the new pass and
554 matches the name and the instance number of the reference pass. */
555 if (pass->type == new_pass_info->pass->type
556 && pass->name
557 && !strcmp (pass->name, new_pass_info->reference_pass_name)
558 && ((new_pass_info->ref_pass_instance_number == 0)
559 || (new_pass_info->ref_pass_instance_number ==
560 pass->static_pass_number)
561 || (new_pass_info->ref_pass_instance_number == 1
562 && pass->todo_flags_start & TODO_mark_first_instance)))
564 struct opt_pass *new_pass;
565 struct pass_list_node *new_pass_node;
567 new_pass = make_pass_instance (new_pass_info->pass, true);
569 /* Insert the new pass instance based on the positioning op. */
570 switch (new_pass_info->pos_op)
572 case PASS_POS_INSERT_AFTER:
573 new_pass->next = pass->next;
574 pass->next = new_pass;
576 /* Skip newly inserted pass to avoid repeated
577 insertions in the case where the new pass and the
578 existing one have the same name. */
579 pass = new_pass;
580 break;
581 case PASS_POS_INSERT_BEFORE:
582 new_pass->next = pass;
583 if (prev_pass)
584 prev_pass->next = new_pass;
585 else
586 *pass_list = new_pass;
587 break;
588 case PASS_POS_REPLACE:
589 new_pass->next = pass->next;
590 if (prev_pass)
591 prev_pass->next = new_pass;
592 else
593 *pass_list = new_pass;
594 new_pass->sub = pass->sub;
595 new_pass->tv_id = pass->tv_id;
596 pass = new_pass;
597 break;
598 default:
599 error ("Invalid pass positioning operation");
600 return false;
603 /* Save the newly added pass (instance) in the added_pass_nodes
604 list so that we can register its dump file later. Note that
605 we cannot register the dump file now because doing so will modify
606 the static_pass_number of the opt_pass object and therefore
607 mess up the dump file name of future instances. */
608 new_pass_node = XCNEW (struct pass_list_node);
609 new_pass_node->pass = new_pass;
610 if (!added_pass_nodes)
611 added_pass_nodes = new_pass_node;
612 else
613 prev_added_pass_node->next = new_pass_node;
614 prev_added_pass_node = new_pass_node;
616 success = true;
619 if (pass->sub && position_pass (new_pass_info, &pass->sub))
620 success = true;
623 return success;
626 /* Hooks a new pass into the pass lists.
628 PASS_INFO - pass information that specifies the opt_pass object,
629 reference pass, instance number, and how to position
630 the pass */
632 void
633 register_pass (struct register_pass_info *pass_info)
635 bool all_instances, success;
637 /* The checks below could fail in buggy plugins. Existing GCC
638 passes should never fail these checks, so we mention plugin in
639 the messages. */
640 if (!pass_info->pass)
641 fatal_error ("plugin cannot register a missing pass");
643 if (!pass_info->pass->name)
644 fatal_error ("plugin cannot register an unnamed pass");
646 if (!pass_info->reference_pass_name)
647 fatal_error
648 ("plugin cannot register pass %qs without reference pass name",
649 pass_info->pass->name);
651 /* Try to insert the new pass to the pass lists. We need to check
652 all five lists as the reference pass could be in one (or all) of
653 them. */
654 all_instances = pass_info->ref_pass_instance_number == 0;
655 success = position_pass (pass_info, &all_lowering_passes);
656 if (!success || all_instances)
657 success |= position_pass (pass_info, &all_small_ipa_passes);
658 if (!success || all_instances)
659 success |= position_pass (pass_info, &all_regular_ipa_passes);
660 if (!success || all_instances)
661 success |= position_pass (pass_info, &all_lto_gen_passes);
662 if (!success || all_instances)
663 success |= position_pass (pass_info, &all_passes);
664 if (!success)
665 fatal_error
666 ("pass %qs not found but is referenced by new pass %qs",
667 pass_info->reference_pass_name, pass_info->pass->name);
669 /* OK, we have successfully inserted the new pass. We need to register
670 the dump files for the newly added pass and its duplicates (if any).
671 Because the registration of plugin/backend passes happens after the
672 command-line options are parsed, the options that specify single
673 pass dumping (e.g. -fdump-tree-PASSNAME) cannot be used for new
674 passes. Therefore we currently can only enable dumping of
675 new passes when the 'dump-all' flags (e.g. -fdump-tree-all)
676 are specified. While doing so, we also delete the pass_list_node
677 objects created during pass positioning. */
678 while (added_pass_nodes)
680 struct pass_list_node *next_node = added_pass_nodes->next;
681 enum tree_dump_index tdi;
682 register_one_dump_file (added_pass_nodes->pass);
683 if (added_pass_nodes->pass->type == SIMPLE_IPA_PASS
684 || added_pass_nodes->pass->type == IPA_PASS)
685 tdi = TDI_ipa_all;
686 else if (added_pass_nodes->pass->type == GIMPLE_PASS)
687 tdi = TDI_tree_all;
688 else
689 tdi = TDI_rtl_all;
690 /* Check if dump-all flag is specified. */
691 if (get_dump_file_info (tdi)->state)
692 get_dump_file_info (added_pass_nodes->pass->static_pass_number)
693 ->state = get_dump_file_info (tdi)->state;
694 XDELETE (added_pass_nodes);
695 added_pass_nodes = next_node;
699 /* Construct the pass tree. The sequencing of passes is driven by
700 the cgraph routines:
702 cgraph_finalize_compilation_unit ()
703 for each node N in the cgraph
704 cgraph_analyze_function (N)
705 cgraph_lower_function (N) -> all_lowering_passes
707 If we are optimizing, cgraph_optimize is then invoked:
709 cgraph_optimize ()
710 ipa_passes () -> all_small_ipa_passes
711 cgraph_expand_all_functions ()
712 for each node N in the cgraph
713 cgraph_expand_function (N)
714 tree_rest_of_compilation (DECL (N)) -> all_passes
717 void
718 init_optimization_passes (void)
720 struct opt_pass **p;
722 #define NEXT_PASS(PASS) (p = next_pass_1 (p, &((PASS).pass)))
724 /* All passes needed to lower the function into shape optimizers can
725 operate on. These passes are always run first on the function, but
726 backend might produce already lowered functions that are not processed
727 by these passes. */
728 p = &all_lowering_passes;
729 NEXT_PASS (pass_warn_unused_result);
730 NEXT_PASS (pass_diagnose_omp_blocks);
731 NEXT_PASS (pass_mudflap_1);
732 NEXT_PASS (pass_lower_omp);
733 NEXT_PASS (pass_lower_cf);
734 NEXT_PASS (pass_refactor_eh);
735 NEXT_PASS (pass_lower_eh);
736 NEXT_PASS (pass_build_cfg);
737 NEXT_PASS (pass_lower_vector);
738 NEXT_PASS (pass_warn_function_return);
739 NEXT_PASS (pass_build_cgraph_edges);
740 NEXT_PASS (pass_inline_parameters);
741 *p = NULL;
743 /* Interprocedural optimization passes. */
744 p = &all_small_ipa_passes;
745 NEXT_PASS (pass_ipa_function_and_variable_visibility);
746 NEXT_PASS (pass_ipa_early_inline);
748 struct opt_pass **p = &pass_ipa_early_inline.pass.sub;
749 NEXT_PASS (pass_early_inline);
750 NEXT_PASS (pass_inline_parameters);
751 NEXT_PASS (pass_rebuild_cgraph_edges);
753 NEXT_PASS (pass_ipa_free_lang_data);
754 NEXT_PASS (pass_early_local_passes);
756 struct opt_pass **p = &pass_early_local_passes.pass.sub;
757 NEXT_PASS (pass_fixup_cfg);
758 NEXT_PASS (pass_tree_profile);
759 NEXT_PASS (pass_cleanup_cfg);
760 NEXT_PASS (pass_init_datastructures);
761 NEXT_PASS (pass_expand_omp);
763 NEXT_PASS (pass_referenced_vars);
764 NEXT_PASS (pass_build_ssa);
765 NEXT_PASS (pass_early_warn_uninitialized);
766 /* Note that it is not strictly necessary to schedule an early
767 inline pass here. However, some test cases (e.g.,
768 g++.dg/other/p334435.C g++.dg/other/i386-1.C) expect extern
769 inline functions to be inlined even at -O0. This does not
770 happen during the first early inline pass. */
771 NEXT_PASS (pass_rebuild_cgraph_edges);
772 NEXT_PASS (pass_early_inline);
773 NEXT_PASS (pass_all_early_optimizations);
775 struct opt_pass **p = &pass_all_early_optimizations.pass.sub;
776 NEXT_PASS (pass_remove_cgraph_callee_edges);
777 NEXT_PASS (pass_rename_ssa_copies);
778 NEXT_PASS (pass_ccp);
779 NEXT_PASS (pass_forwprop);
780 /* pass_build_ealias is a dummy pass that ensures that we
781 execute TODO_rebuild_alias at this point. Re-building
782 alias information also rewrites no longer addressed
783 locals into SSA form if possible. */
784 NEXT_PASS (pass_build_ealias);
785 NEXT_PASS (pass_sra_early);
786 NEXT_PASS (pass_copy_prop);
787 NEXT_PASS (pass_merge_phi);
788 NEXT_PASS (pass_cd_dce);
789 NEXT_PASS (pass_early_ipa_sra);
790 NEXT_PASS (pass_tail_recursion);
791 NEXT_PASS (pass_convert_switch);
792 NEXT_PASS (pass_cleanup_eh);
793 NEXT_PASS (pass_profile);
794 NEXT_PASS (pass_local_pure_const);
796 NEXT_PASS (pass_release_ssa_names);
797 NEXT_PASS (pass_rebuild_cgraph_edges);
798 NEXT_PASS (pass_inline_parameters);
800 NEXT_PASS (pass_ipa_increase_alignment);
801 NEXT_PASS (pass_ipa_matrix_reorg);
802 *p = NULL;
804 p = &all_regular_ipa_passes;
805 NEXT_PASS (pass_ipa_whole_program_visibility);
806 NEXT_PASS (pass_ipa_cp);
807 NEXT_PASS (pass_ipa_inline);
808 NEXT_PASS (pass_ipa_reference);
809 NEXT_PASS (pass_ipa_pure_const);
810 NEXT_PASS (pass_ipa_type_escape);
811 NEXT_PASS (pass_ipa_pta);
812 NEXT_PASS (pass_ipa_struct_reorg);
813 *p = NULL;
815 p = &all_lto_gen_passes;
816 NEXT_PASS (pass_ipa_lto_gimple_out);
817 NEXT_PASS (pass_ipa_lto_finish_out); /* This must be the last LTO pass. */
818 *p = NULL;
820 /* These passes are run after IPA passes on every function that is being
821 output to the assembler file. */
822 p = &all_passes;
823 NEXT_PASS (pass_lower_eh_dispatch);
824 NEXT_PASS (pass_all_optimizations);
826 struct opt_pass **p = &pass_all_optimizations.pass.sub;
827 NEXT_PASS (pass_remove_cgraph_callee_edges);
828 /* Initial scalar cleanups before alias computation.
829 They ensure memory accesses are not indirect wherever possible. */
830 NEXT_PASS (pass_strip_predict_hints);
831 NEXT_PASS (pass_update_address_taken);
832 NEXT_PASS (pass_rename_ssa_copies);
833 NEXT_PASS (pass_complete_unrolli);
834 NEXT_PASS (pass_ccp);
835 NEXT_PASS (pass_forwprop);
836 NEXT_PASS (pass_call_cdce);
837 /* pass_build_alias is a dummy pass that ensures that we
838 execute TODO_rebuild_alias at this point. Re-building
839 alias information also rewrites no longer addressed
840 locals into SSA form if possible. */
841 NEXT_PASS (pass_build_alias);
842 NEXT_PASS (pass_return_slot);
843 NEXT_PASS (pass_phiprop);
844 NEXT_PASS (pass_fre);
845 NEXT_PASS (pass_copy_prop);
846 NEXT_PASS (pass_merge_phi);
847 NEXT_PASS (pass_vrp);
848 NEXT_PASS (pass_dce);
849 NEXT_PASS (pass_cselim);
850 NEXT_PASS (pass_tree_ifcombine);
851 NEXT_PASS (pass_phiopt);
852 NEXT_PASS (pass_tail_recursion);
853 NEXT_PASS (pass_ch);
854 NEXT_PASS (pass_stdarg);
855 NEXT_PASS (pass_lower_complex);
856 NEXT_PASS (pass_sra);
857 NEXT_PASS (pass_rename_ssa_copies);
858 /* The dom pass will also resolve all __builtin_constant_p calls
859 that are still there to 0. This has to be done after some
860 propagations have already run, but before some more dead code
861 is removed, and this place fits nicely. Remember this when
862 trying to move or duplicate pass_dominator somewhere earlier. */
863 NEXT_PASS (pass_dominator);
864 /* The only const/copy propagation opportunities left after
865 DOM should be due to degenerate PHI nodes. So rather than
866 run the full propagators, run a specialized pass which
867 only examines PHIs to discover const/copy propagation
868 opportunities. */
869 NEXT_PASS (pass_phi_only_cprop);
870 NEXT_PASS (pass_dse);
871 NEXT_PASS (pass_reassoc);
872 NEXT_PASS (pass_dce);
873 NEXT_PASS (pass_forwprop);
874 NEXT_PASS (pass_phiopt);
875 NEXT_PASS (pass_object_sizes);
876 NEXT_PASS (pass_ccp);
877 NEXT_PASS (pass_copy_prop);
878 NEXT_PASS (pass_cse_sincos);
879 NEXT_PASS (pass_optimize_bswap);
880 NEXT_PASS (pass_split_crit_edges);
881 NEXT_PASS (pass_pre);
882 NEXT_PASS (pass_sink_code);
883 NEXT_PASS (pass_tree_loop);
885 struct opt_pass **p = &pass_tree_loop.pass.sub;
886 NEXT_PASS (pass_tree_loop_init);
887 NEXT_PASS (pass_lim);
888 NEXT_PASS (pass_copy_prop);
889 NEXT_PASS (pass_dce_loop);
890 NEXT_PASS (pass_tree_unswitch);
891 NEXT_PASS (pass_scev_cprop);
892 NEXT_PASS (pass_record_bounds);
893 NEXT_PASS (pass_check_data_deps);
894 NEXT_PASS (pass_loop_distribution);
895 NEXT_PASS (pass_linear_transform);
896 NEXT_PASS (pass_graphite_transforms);
898 struct opt_pass **p = &pass_graphite_transforms.pass.sub;
899 NEXT_PASS (pass_copy_prop);
900 NEXT_PASS (pass_dce_loop);
901 NEXT_PASS (pass_lim);
903 NEXT_PASS (pass_iv_canon);
904 NEXT_PASS (pass_if_conversion);
905 NEXT_PASS (pass_vectorize);
907 struct opt_pass **p = &pass_vectorize.pass.sub;
908 NEXT_PASS (pass_lower_vector_ssa);
909 NEXT_PASS (pass_dce_loop);
911 NEXT_PASS (pass_predcom);
912 NEXT_PASS (pass_complete_unroll);
913 NEXT_PASS (pass_slp_vectorize);
914 NEXT_PASS (pass_parallelize_loops);
915 NEXT_PASS (pass_loop_prefetch);
916 NEXT_PASS (pass_iv_optimize);
917 NEXT_PASS (pass_tree_loop_done);
919 NEXT_PASS (pass_cse_reciprocals);
920 NEXT_PASS (pass_reassoc);
921 NEXT_PASS (pass_vrp);
922 NEXT_PASS (pass_dominator);
923 /* The only const/copy propagation opportunities left after
924 DOM should be due to degenerate PHI nodes. So rather than
925 run the full propagators, run a specialized pass which
926 only examines PHIs to discover const/copy propagation
927 opportunities. */
928 NEXT_PASS (pass_phi_only_cprop);
929 NEXT_PASS (pass_cd_dce);
930 NEXT_PASS (pass_tracer);
932 /* FIXME: If DCE is not run before checking for uninitialized uses,
933 we may get false warnings (e.g., testsuite/gcc.dg/uninit-5.c).
934 However, this also causes us to misdiagnose cases that should be
935 real warnings (e.g., testsuite/gcc.dg/pr18501.c).
937 To fix the false positives in uninit-5.c, we would have to
938 account for the predicates protecting the set and the use of each
939 variable. Using a representation like Gated Single Assignment
940 may help. */
941 NEXT_PASS (pass_late_warn_uninitialized);
942 NEXT_PASS (pass_dse);
943 NEXT_PASS (pass_forwprop);
944 NEXT_PASS (pass_phiopt);
945 NEXT_PASS (pass_fold_builtins);
946 NEXT_PASS (pass_optimize_widening_mul);
947 NEXT_PASS (pass_tail_calls);
948 NEXT_PASS (pass_rename_ssa_copies);
949 NEXT_PASS (pass_uncprop);
950 NEXT_PASS (pass_local_pure_const);
952 NEXT_PASS (pass_lower_complex_O0);
953 NEXT_PASS (pass_cleanup_eh);
954 NEXT_PASS (pass_lower_resx);
955 NEXT_PASS (pass_nrv);
956 NEXT_PASS (pass_mudflap_2);
957 NEXT_PASS (pass_cleanup_cfg_post_optimizing);
958 NEXT_PASS (pass_warn_function_noreturn);
960 NEXT_PASS (pass_expand);
962 NEXT_PASS (pass_rest_of_compilation);
964 struct opt_pass **p = &pass_rest_of_compilation.pass.sub;
965 NEXT_PASS (pass_init_function);
966 NEXT_PASS (pass_jump);
967 NEXT_PASS (pass_rtl_eh);
968 NEXT_PASS (pass_initial_value_sets);
969 NEXT_PASS (pass_unshare_all_rtl);
970 NEXT_PASS (pass_instantiate_virtual_regs);
971 NEXT_PASS (pass_into_cfg_layout_mode);
972 NEXT_PASS (pass_jump2);
973 NEXT_PASS (pass_lower_subreg);
974 NEXT_PASS (pass_df_initialize_opt);
975 NEXT_PASS (pass_cse);
976 NEXT_PASS (pass_rtl_fwprop);
977 NEXT_PASS (pass_rtl_cprop);
978 NEXT_PASS (pass_rtl_pre);
979 NEXT_PASS (pass_rtl_hoist);
980 NEXT_PASS (pass_rtl_cprop);
981 NEXT_PASS (pass_rtl_store_motion);
982 NEXT_PASS (pass_cse_after_global_opts);
983 NEXT_PASS (pass_rtl_ifcvt);
984 NEXT_PASS (pass_reginfo_init);
985 /* Perform loop optimizations. It might be better to do them a bit
986 sooner, but we want the profile feedback to work more
987 efficiently. */
988 NEXT_PASS (pass_loop2);
990 struct opt_pass **p = &pass_loop2.pass.sub;
991 NEXT_PASS (pass_rtl_loop_init);
992 NEXT_PASS (pass_rtl_move_loop_invariants);
993 NEXT_PASS (pass_rtl_unswitch);
994 NEXT_PASS (pass_rtl_unroll_and_peel_loops);
995 NEXT_PASS (pass_rtl_doloop);
996 NEXT_PASS (pass_rtl_loop_done);
997 *p = NULL;
999 NEXT_PASS (pass_web);
1000 NEXT_PASS (pass_rtl_cprop);
1001 NEXT_PASS (pass_cse2);
1002 NEXT_PASS (pass_rtl_dse1);
1003 NEXT_PASS (pass_rtl_fwprop_addr);
1004 NEXT_PASS (pass_inc_dec);
1005 NEXT_PASS (pass_initialize_regs);
1006 NEXT_PASS (pass_ud_rtl_dce);
1007 NEXT_PASS (pass_combine);
1008 NEXT_PASS (pass_if_after_combine);
1009 NEXT_PASS (pass_partition_blocks);
1010 NEXT_PASS (pass_regmove);
1011 NEXT_PASS (pass_outof_cfg_layout_mode);
1012 NEXT_PASS (pass_split_all_insns);
1013 NEXT_PASS (pass_lower_subreg2);
1014 NEXT_PASS (pass_df_initialize_no_opt);
1015 NEXT_PASS (pass_stack_ptr_mod);
1016 NEXT_PASS (pass_mode_switching);
1017 NEXT_PASS (pass_match_asm_constraints);
1018 NEXT_PASS (pass_sms);
1019 NEXT_PASS (pass_sched);
1020 NEXT_PASS (pass_ira);
1021 NEXT_PASS (pass_postreload);
1023 struct opt_pass **p = &pass_postreload.pass.sub;
1024 NEXT_PASS (pass_postreload_cse);
1025 NEXT_PASS (pass_gcse2);
1026 NEXT_PASS (pass_split_after_reload);
1027 NEXT_PASS (pass_branch_target_load_optimize1);
1028 NEXT_PASS (pass_thread_prologue_and_epilogue);
1029 NEXT_PASS (pass_rtl_dse2);
1030 NEXT_PASS (pass_stack_adjustments);
1031 NEXT_PASS (pass_peephole2);
1032 NEXT_PASS (pass_if_after_reload);
1033 NEXT_PASS (pass_regrename);
1034 NEXT_PASS (pass_cprop_hardreg);
1035 NEXT_PASS (pass_fast_rtl_dce);
1036 NEXT_PASS (pass_reorder_blocks);
1037 NEXT_PASS (pass_branch_target_load_optimize2);
1038 NEXT_PASS (pass_leaf_regs);
1039 NEXT_PASS (pass_split_before_sched2);
1040 NEXT_PASS (pass_sched2);
1041 NEXT_PASS (pass_stack_regs);
1043 struct opt_pass **p = &pass_stack_regs.pass.sub;
1044 NEXT_PASS (pass_split_before_regstack);
1045 NEXT_PASS (pass_stack_regs_run);
1047 NEXT_PASS (pass_compute_alignments);
1048 NEXT_PASS (pass_duplicate_computed_gotos);
1049 NEXT_PASS (pass_variable_tracking);
1050 NEXT_PASS (pass_free_cfg);
1051 NEXT_PASS (pass_machine_reorg);
1052 NEXT_PASS (pass_cleanup_barriers);
1053 NEXT_PASS (pass_delay_slots);
1054 NEXT_PASS (pass_split_for_shorten_branches);
1055 NEXT_PASS (pass_convert_to_eh_region_ranges);
1056 NEXT_PASS (pass_shorten_branches);
1057 NEXT_PASS (pass_set_nothrow_function_flags);
1058 NEXT_PASS (pass_final);
1060 NEXT_PASS (pass_df_finish);
1062 NEXT_PASS (pass_clean_state);
1063 *p = NULL;
1065 #undef NEXT_PASS
1067 /* Register the passes with the tree dump code. */
1068 register_dump_files (all_lowering_passes, PROP_gimple_any);
1069 register_dump_files (all_small_ipa_passes,
1070 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1071 | PROP_cfg);
1072 register_dump_files (all_regular_ipa_passes,
1073 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1074 | PROP_cfg);
1075 register_dump_files (all_lto_gen_passes,
1076 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1077 | PROP_cfg);
1078 register_dump_files (all_passes,
1079 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1080 | PROP_cfg);
1083 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
1084 function CALLBACK for every function in the call graph. Otherwise,
1085 call CALLBACK on the current function. */
1087 static void
1088 do_per_function (void (*callback) (void *data), void *data)
1090 if (current_function_decl)
1091 callback (data);
1092 else
1094 struct cgraph_node *node;
1095 for (node = cgraph_nodes; node; node = node->next)
1096 if (node->analyzed && gimple_has_body_p (node->decl)
1097 && (!node->clone_of || node->decl != node->clone_of->decl))
1099 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
1100 current_function_decl = node->decl;
1101 callback (data);
1102 if (!flag_wpa)
1104 free_dominance_info (CDI_DOMINATORS);
1105 free_dominance_info (CDI_POST_DOMINATORS);
1107 current_function_decl = NULL;
1108 pop_cfun ();
1109 ggc_collect ();
1114 /* Because inlining might remove no-longer reachable nodes, we need to
1115 keep the array visible to garbage collector to avoid reading collected
1116 out nodes. */
1117 static int nnodes;
1118 static GTY ((length ("nnodes"))) struct cgraph_node **order;
1120 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
1121 function CALLBACK for every function in the call graph. Otherwise,
1122 call CALLBACK on the current function.
1123 This function is global so that plugins can use it. */
1124 void
1125 do_per_function_toporder (void (*callback) (void *data), void *data)
1127 int i;
1129 if (current_function_decl)
1130 callback (data);
1131 else
1133 gcc_assert (!order);
1134 order = GGC_NEWVEC (struct cgraph_node *, cgraph_n_nodes);
1135 nnodes = cgraph_postorder (order);
1136 for (i = nnodes - 1; i >= 0; i--)
1137 order[i]->process = 1;
1138 for (i = nnodes - 1; i >= 0; i--)
1140 struct cgraph_node *node = order[i];
1142 /* Allow possibly removed nodes to be garbage collected. */
1143 order[i] = NULL;
1144 node->process = 0;
1145 if (node->analyzed)
1147 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
1148 current_function_decl = node->decl;
1149 callback (data);
1150 free_dominance_info (CDI_DOMINATORS);
1151 free_dominance_info (CDI_POST_DOMINATORS);
1152 current_function_decl = NULL;
1153 pop_cfun ();
1154 ggc_collect ();
1158 ggc_free (order);
1159 order = NULL;
1160 nnodes = 0;
1163 /* Perform all TODO actions that ought to be done on each function. */
1165 static void
1166 execute_function_todo (void *data)
1168 unsigned int flags = (size_t)data;
1169 if (cfun->curr_properties & PROP_ssa)
1170 flags |= TODO_verify_ssa;
1171 flags &= ~cfun->last_verified;
1172 if (!flags)
1173 return;
1175 statistics_fini_pass ();
1177 /* Always cleanup the CFG before trying to update SSA. */
1178 if (flags & TODO_cleanup_cfg)
1180 bool cleanup = cleanup_tree_cfg ();
1182 if (cleanup && (cfun->curr_properties & PROP_ssa))
1183 flags |= TODO_remove_unused_locals;
1185 /* When cleanup_tree_cfg merges consecutive blocks, it may
1186 perform some simplistic propagation when removing single
1187 valued PHI nodes. This propagation may, in turn, cause the
1188 SSA form to become out-of-date (see PR 22037). So, even
1189 if the parent pass had not scheduled an SSA update, we may
1190 still need to do one. */
1191 if (!(flags & TODO_update_ssa_any) && need_ssa_update_p (cfun))
1192 flags |= TODO_update_ssa;
1195 if (flags & TODO_update_ssa_any)
1197 unsigned update_flags = flags & TODO_update_ssa_any;
1198 update_ssa (update_flags);
1199 cfun->last_verified &= ~TODO_verify_ssa;
1202 if (flags & TODO_update_address_taken)
1203 execute_update_addresses_taken (true);
1205 if (flags & TODO_rebuild_alias)
1207 if (!(flags & TODO_update_address_taken))
1208 execute_update_addresses_taken (true);
1209 compute_may_aliases ();
1212 if (flags & TODO_remove_unused_locals)
1213 remove_unused_locals ();
1215 if ((flags & TODO_dump_func) && dump_file && current_function_decl)
1217 if (cfun->curr_properties & PROP_trees)
1218 dump_function_to_file (current_function_decl, dump_file, dump_flags);
1219 else
1221 if (dump_flags & TDF_SLIM)
1222 print_rtl_slim_with_bb (dump_file, get_insns (), dump_flags);
1223 else if ((cfun->curr_properties & PROP_cfg)
1224 && (dump_flags & TDF_BLOCKS))
1225 print_rtl_with_bb (dump_file, get_insns ());
1226 else
1227 print_rtl (dump_file, get_insns ());
1229 if ((cfun->curr_properties & PROP_cfg)
1230 && graph_dump_format != no_graph
1231 && (dump_flags & TDF_GRAPH))
1232 print_rtl_graph_with_bb (dump_file_name, get_insns ());
1235 /* Flush the file. If verification fails, we won't be able to
1236 close the file before aborting. */
1237 fflush (dump_file);
1240 if (flags & TODO_rebuild_frequencies)
1242 if (profile_status == PROFILE_GUESSED)
1244 loop_optimizer_init (0);
1245 add_noreturn_fake_exit_edges ();
1246 mark_irreducible_loops ();
1247 connect_infinite_loops_to_exit ();
1248 estimate_bb_frequencies ();
1249 remove_fake_exit_edges ();
1250 loop_optimizer_finalize ();
1252 else if (profile_status == PROFILE_READ)
1253 counts_to_freqs ();
1254 else
1255 gcc_unreachable ();
1258 #if defined ENABLE_CHECKING
1259 if (flags & TODO_verify_ssa
1260 || (current_loops && loops_state_satisfies_p (LOOP_CLOSED_SSA)))
1261 verify_ssa (true);
1262 if (flags & TODO_verify_flow)
1263 verify_flow_info ();
1264 if (flags & TODO_verify_stmts)
1265 verify_stmts ();
1266 if (current_loops && loops_state_satisfies_p (LOOP_CLOSED_SSA))
1267 verify_loop_closed_ssa (false);
1268 if (flags & TODO_verify_rtl_sharing)
1269 verify_rtl_sharing ();
1270 #endif
1272 cfun->last_verified = flags & TODO_verify_all;
1275 /* Perform all TODO actions. */
1276 static void
1277 execute_todo (unsigned int flags)
1279 #if defined ENABLE_CHECKING
1280 if (cfun
1281 && need_ssa_update_p (cfun))
1282 gcc_assert (flags & TODO_update_ssa_any);
1283 #endif
1285 /* Inform the pass whether it is the first time it is run. */
1286 first_pass_instance = (flags & TODO_mark_first_instance) != 0;
1288 do_per_function (execute_function_todo, (void *)(size_t) flags);
1290 /* Always remove functions just as before inlining: IPA passes might be
1291 interested to see bodies of extern inline functions that are not inlined
1292 to analyze side effects. The full removal is done just at the end
1293 of IPA pass queue. */
1294 if (flags & TODO_remove_functions)
1296 gcc_assert (!cfun);
1297 cgraph_remove_unreachable_nodes (true, dump_file);
1300 if ((flags & TODO_dump_cgraph) && dump_file && !current_function_decl)
1302 gcc_assert (!cfun);
1303 dump_cgraph (dump_file);
1304 /* Flush the file. If verification fails, we won't be able to
1305 close the file before aborting. */
1306 fflush (dump_file);
1309 if (flags & TODO_ggc_collect)
1310 ggc_collect ();
1312 /* Now that the dumping has been done, we can get rid of the optional
1313 df problems. */
1314 if (flags & TODO_df_finish)
1315 df_finish_pass ((flags & TODO_df_verify) != 0);
1318 /* Verify invariants that should hold between passes. This is a place
1319 to put simple sanity checks. */
1321 static void
1322 verify_interpass_invariants (void)
1324 #ifdef ENABLE_CHECKING
1325 gcc_assert (!fold_deferring_overflow_warnings_p ());
1326 #endif
1329 /* Clear the last verified flag. */
1331 static void
1332 clear_last_verified (void *data ATTRIBUTE_UNUSED)
1334 cfun->last_verified = 0;
1337 /* Helper function. Verify that the properties has been turn into the
1338 properties expected by the pass. */
1340 #ifdef ENABLE_CHECKING
1341 static void
1342 verify_curr_properties (void *data)
1344 unsigned int props = (size_t)data;
1345 gcc_assert ((cfun->curr_properties & props) == props);
1347 #endif
1349 /* Initialize pass dump file. */
1350 /* This is non-static so that the plugins can use it. */
1352 bool
1353 pass_init_dump_file (struct opt_pass *pass)
1355 /* If a dump file name is present, open it if enabled. */
1356 if (pass->static_pass_number != -1)
1358 bool initializing_dump = !dump_initialized_p (pass->static_pass_number);
1359 dump_file_name = get_dump_file_name (pass->static_pass_number);
1360 dump_file = dump_begin (pass->static_pass_number, &dump_flags);
1361 if (dump_file && current_function_decl)
1363 const char *dname, *aname;
1364 dname = lang_hooks.decl_printable_name (current_function_decl, 2);
1365 aname = (IDENTIFIER_POINTER
1366 (DECL_ASSEMBLER_NAME (current_function_decl)));
1367 fprintf (dump_file, "\n;; Function %s (%s)%s\n\n", dname, aname,
1368 cfun->function_frequency == FUNCTION_FREQUENCY_HOT
1369 ? " (hot)"
1370 : cfun->function_frequency == FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
1371 ? " (unlikely executed)"
1372 : "");
1374 return initializing_dump;
1376 else
1377 return false;
1380 /* Flush PASS dump file. */
1381 /* This is non-static so that plugins can use it. */
1383 void
1384 pass_fini_dump_file (struct opt_pass *pass)
1386 /* Flush and close dump file. */
1387 if (dump_file_name)
1389 free (CONST_CAST (char *, dump_file_name));
1390 dump_file_name = NULL;
1393 if (dump_file)
1395 dump_end (pass->static_pass_number, dump_file);
1396 dump_file = NULL;
1400 /* After executing the pass, apply expected changes to the function
1401 properties. */
1403 static void
1404 update_properties_after_pass (void *data)
1406 struct opt_pass *pass = (struct opt_pass *) data;
1407 cfun->curr_properties = (cfun->curr_properties | pass->properties_provided)
1408 & ~pass->properties_destroyed;
1411 /* Execute summary generation for all of the passes in IPA_PASS. */
1413 void
1414 execute_ipa_summary_passes (struct ipa_opt_pass_d *ipa_pass)
1416 while (ipa_pass)
1418 struct opt_pass *pass = &ipa_pass->pass;
1420 /* Execute all of the IPA_PASSes in the list. */
1421 if (ipa_pass->pass.type == IPA_PASS
1422 && (!pass->gate || pass->gate ())
1423 && ipa_pass->generate_summary)
1425 pass_init_dump_file (pass);
1427 /* If a timevar is present, start it. */
1428 if (pass->tv_id)
1429 timevar_push (pass->tv_id);
1431 ipa_pass->generate_summary ();
1433 /* Stop timevar. */
1434 if (pass->tv_id)
1435 timevar_pop (pass->tv_id);
1437 pass_fini_dump_file (pass);
1439 ipa_pass = (struct ipa_opt_pass_d *)ipa_pass->pass.next;
1443 /* Execute IPA_PASS function transform on NODE. */
1445 static void
1446 execute_one_ipa_transform_pass (struct cgraph_node *node,
1447 struct ipa_opt_pass_d *ipa_pass)
1449 struct opt_pass *pass = &ipa_pass->pass;
1450 unsigned int todo_after = 0;
1452 current_pass = pass;
1453 if (!ipa_pass->function_transform)
1454 return;
1456 /* Note that the folders should only create gimple expressions.
1457 This is a hack until the new folder is ready. */
1458 in_gimple_form = (cfun && (cfun->curr_properties & PROP_trees)) != 0;
1460 pass_init_dump_file (pass);
1462 /* Run pre-pass verification. */
1463 execute_todo (ipa_pass->function_transform_todo_flags_start);
1465 /* If a timevar is present, start it. */
1466 if (pass->tv_id != TV_NONE)
1467 timevar_push (pass->tv_id);
1469 /* Do it! */
1470 todo_after = ipa_pass->function_transform (node);
1472 /* Stop timevar. */
1473 if (pass->tv_id != TV_NONE)
1474 timevar_pop (pass->tv_id);
1476 /* Run post-pass cleanup and verification. */
1477 execute_todo (todo_after);
1478 verify_interpass_invariants ();
1480 pass_fini_dump_file (pass);
1482 current_pass = NULL;
1485 /* For the current function, execute all ipa transforms. */
1487 void
1488 execute_all_ipa_transforms (void)
1490 enum cgraph_state old_state = cgraph_state;
1491 struct cgraph_node *node;
1492 if (!cfun)
1493 return;
1494 node = cgraph_node (current_function_decl);
1496 /* Statement verification skip verification of nothorw when
1497 state is IPA_SSA because we do not modify function bodies
1498 after setting the flag on function. Instead we leave it
1499 to fixup_cfg to do such a transformation. We need to temporarily
1500 change the cgraph state so statement verifier before
1501 transform do not fire. */
1502 cgraph_state = CGRAPH_STATE_IPA_SSA;
1504 if (node->ipa_transforms_to_apply)
1506 unsigned int i;
1508 for (i = 0; i < VEC_length (ipa_opt_pass, node->ipa_transforms_to_apply);
1509 i++)
1510 execute_one_ipa_transform_pass (node,
1511 VEC_index (ipa_opt_pass,
1512 node->ipa_transforms_to_apply,
1513 i));
1514 VEC_free (ipa_opt_pass, heap, node->ipa_transforms_to_apply);
1515 node->ipa_transforms_to_apply = NULL;
1517 cgraph_state = old_state;
1520 /* Execute PASS. */
1522 bool
1523 execute_one_pass (struct opt_pass *pass)
1525 bool initializing_dump;
1526 unsigned int todo_after = 0;
1528 bool gate_status;
1530 /* IPA passes are executed on whole program, so cfun should be NULL.
1531 Other passes need function context set. */
1532 if (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS)
1533 gcc_assert (!cfun && !current_function_decl);
1534 else
1535 gcc_assert (cfun && current_function_decl);
1537 current_pass = pass;
1539 /* Check whether gate check should be avoided.
1540 User controls the value of the gate through the parameter "gate_status". */
1541 gate_status = (pass->gate == NULL) ? true : pass->gate();
1543 /* Override gate with plugin. */
1544 invoke_plugin_callbacks (PLUGIN_OVERRIDE_GATE, &gate_status);
1546 if (!gate_status)
1548 current_pass = NULL;
1549 return false;
1552 /* Pass execution event trigger: useful to identify passes being
1553 executed. */
1554 invoke_plugin_callbacks (PLUGIN_PASS_EXECUTION, pass);
1556 if (!quiet_flag && !cfun)
1557 fprintf (stderr, " <%s>", pass->name ? pass->name : "");
1559 /* Note that the folders should only create gimple expressions.
1560 This is a hack until the new folder is ready. */
1561 in_gimple_form = (cfun && (cfun->curr_properties & PROP_trees)) != 0;
1563 initializing_dump = pass_init_dump_file (pass);
1565 /* Run pre-pass verification. */
1566 execute_todo (pass->todo_flags_start);
1568 #ifdef ENABLE_CHECKING
1569 do_per_function (verify_curr_properties,
1570 (void *)(size_t)pass->properties_required);
1571 #endif
1573 /* If a timevar is present, start it. */
1574 if (pass->tv_id != TV_NONE)
1575 timevar_push (pass->tv_id);
1577 /* Do it! */
1578 if (pass->execute)
1580 todo_after = pass->execute ();
1581 do_per_function (clear_last_verified, NULL);
1584 /* Stop timevar. */
1585 if (pass->tv_id != TV_NONE)
1586 timevar_pop (pass->tv_id);
1588 do_per_function (update_properties_after_pass, pass);
1590 if (initializing_dump
1591 && dump_file
1592 && graph_dump_format != no_graph
1593 && cfun
1594 && (cfun->curr_properties & (PROP_cfg | PROP_rtl))
1595 == (PROP_cfg | PROP_rtl))
1597 get_dump_file_info (pass->static_pass_number)->flags |= TDF_GRAPH;
1598 dump_flags |= TDF_GRAPH;
1599 clean_graph_dump_file (dump_file_name);
1602 /* Run post-pass cleanup and verification. */
1603 execute_todo (todo_after | pass->todo_flags_finish);
1604 verify_interpass_invariants ();
1605 if (pass->type == IPA_PASS)
1607 struct cgraph_node *node;
1608 for (node = cgraph_nodes; node; node = node->next)
1609 if (node->analyzed)
1610 VEC_safe_push (ipa_opt_pass, heap, node->ipa_transforms_to_apply,
1611 (struct ipa_opt_pass_d *)pass);
1614 if (!current_function_decl)
1615 cgraph_process_new_functions ();
1617 pass_fini_dump_file (pass);
1619 if (pass->type != SIMPLE_IPA_PASS && pass->type != IPA_PASS)
1620 gcc_assert (!(cfun->curr_properties & PROP_trees)
1621 || pass->type != RTL_PASS);
1623 current_pass = NULL;
1625 return true;
1628 void
1629 execute_pass_list (struct opt_pass *pass)
1633 gcc_assert (pass->type == GIMPLE_PASS
1634 || pass->type == RTL_PASS);
1635 if (execute_one_pass (pass) && pass->sub)
1636 execute_pass_list (pass->sub);
1637 pass = pass->next;
1639 while (pass);
1642 /* Same as execute_pass_list but assume that subpasses of IPA passes
1643 are local passes. If SET is not NULL, write out summaries of only
1644 those node in SET. */
1646 static void
1647 ipa_write_summaries_2 (struct opt_pass *pass, cgraph_node_set set,
1648 struct lto_out_decl_state *state)
1650 while (pass)
1652 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *)pass;
1653 gcc_assert (!current_function_decl);
1654 gcc_assert (!cfun);
1655 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
1656 if (pass->type == IPA_PASS
1657 && ipa_pass->write_summary
1658 && (!pass->gate || pass->gate ()))
1660 /* If a timevar is present, start it. */
1661 if (pass->tv_id)
1662 timevar_push (pass->tv_id);
1664 ipa_pass->write_summary (set);
1666 /* If a timevar is present, start it. */
1667 if (pass->tv_id)
1668 timevar_pop (pass->tv_id);
1671 if (pass->sub && pass->sub->type != GIMPLE_PASS)
1672 ipa_write_summaries_2 (pass->sub, set, state);
1674 pass = pass->next;
1678 /* Helper function of ipa_write_summaries. Creates and destroys the
1679 decl state and calls ipa_write_summaries_2 for all passes that have
1680 summaries. SET is the set of nodes to be written. */
1682 static void
1683 ipa_write_summaries_1 (cgraph_node_set set)
1685 struct lto_out_decl_state *state = lto_new_out_decl_state ();
1686 lto_push_out_decl_state (state);
1688 gcc_assert (!flag_wpa);
1689 ipa_write_summaries_2 (all_regular_ipa_passes, set, state);
1690 ipa_write_summaries_2 (all_lto_gen_passes, set, state);
1692 gcc_assert (lto_get_out_decl_state () == state);
1693 lto_pop_out_decl_state ();
1694 lto_delete_out_decl_state (state);
1697 /* Write out summaries for all the nodes in the callgraph. */
1699 void
1700 ipa_write_summaries (void)
1702 cgraph_node_set set;
1703 struct cgraph_node **order;
1704 int i, order_pos;
1706 if (!flag_generate_lto || errorcount || sorrycount)
1707 return;
1709 set = cgraph_node_set_new ();
1711 /* Create the callgraph set in the same order used in
1712 cgraph_expand_all_functions. This mostly facilitates debugging,
1713 since it causes the gimple file to be processed in the same order
1714 as the source code. */
1715 order = XCNEWVEC (struct cgraph_node *, cgraph_n_nodes);
1716 order_pos = cgraph_postorder (order);
1717 gcc_assert (order_pos == cgraph_n_nodes);
1719 for (i = order_pos - 1; i >= 0; i--)
1721 struct cgraph_node *node = order[i];
1723 if (node->analyzed)
1725 /* When streaming out references to statements as part of some IPA
1726 pass summary, the statements need to have uids assigned and the
1727 following does that for all the IPA passes here. Naturally, this
1728 ordering then matches the one IPA-passes get in their stmt_fixup
1729 hooks. */
1731 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
1732 renumber_gimple_stmt_uids ();
1733 pop_cfun ();
1735 cgraph_node_set_add (set, node);
1738 ipa_write_summaries_1 (set);
1740 free (order);
1741 ggc_free (set);
1744 /* Same as execute_pass_list but assume that subpasses of IPA passes
1745 are local passes. If SET is not NULL, write out optimization summaries of
1746 only those node in SET. */
1748 static void
1749 ipa_write_optimization_summaries_1 (struct opt_pass *pass, cgraph_node_set set,
1750 struct lto_out_decl_state *state)
1752 while (pass)
1754 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *)pass;
1755 gcc_assert (!current_function_decl);
1756 gcc_assert (!cfun);
1757 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
1758 if (pass->type == IPA_PASS
1759 && ipa_pass->write_optimization_summary
1760 && (!pass->gate || pass->gate ()))
1762 /* If a timevar is present, start it. */
1763 if (pass->tv_id)
1764 timevar_push (pass->tv_id);
1766 ipa_pass->write_optimization_summary (set);
1768 /* If a timevar is present, start it. */
1769 if (pass->tv_id)
1770 timevar_pop (pass->tv_id);
1773 if (pass->sub && pass->sub->type != GIMPLE_PASS)
1774 ipa_write_optimization_summaries_1 (pass->sub, set, state);
1776 pass = pass->next;
1780 /* Write all the optimization summaries for the cgraph nodes in SET. If SET is
1781 NULL, write out all summaries of all nodes. */
1783 void
1784 ipa_write_optimization_summaries (cgraph_node_set set)
1786 struct lto_out_decl_state *state = lto_new_out_decl_state ();
1787 lto_push_out_decl_state (state);
1789 gcc_assert (flag_wpa);
1790 ipa_write_optimization_summaries_1 (all_regular_ipa_passes, set, state);
1791 ipa_write_optimization_summaries_1 (all_lto_gen_passes, set, state);
1793 gcc_assert (lto_get_out_decl_state () == state);
1794 lto_pop_out_decl_state ();
1795 lto_delete_out_decl_state (state);
1798 /* Same as execute_pass_list but assume that subpasses of IPA passes
1799 are local passes. */
1801 static void
1802 ipa_read_summaries_1 (struct opt_pass *pass)
1804 while (pass)
1806 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *) pass;
1808 gcc_assert (!current_function_decl);
1809 gcc_assert (!cfun);
1810 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
1812 if (pass->gate == NULL || pass->gate ())
1814 if (pass->type == IPA_PASS && ipa_pass->read_summary)
1816 /* If a timevar is present, start it. */
1817 if (pass->tv_id)
1818 timevar_push (pass->tv_id);
1820 ipa_pass->read_summary ();
1822 /* Stop timevar. */
1823 if (pass->tv_id)
1824 timevar_pop (pass->tv_id);
1827 if (pass->sub && pass->sub->type != GIMPLE_PASS)
1828 ipa_read_summaries_1 (pass->sub);
1830 pass = pass->next;
1835 /* Read all the summaries for all_regular_ipa_passes and all_lto_gen_passes. */
1837 void
1838 ipa_read_summaries (void)
1840 ipa_read_summaries_1 (all_regular_ipa_passes);
1841 ipa_read_summaries_1 (all_lto_gen_passes);
1844 /* Same as execute_pass_list but assume that subpasses of IPA passes
1845 are local passes. */
1847 static void
1848 ipa_read_optimization_summaries_1 (struct opt_pass *pass)
1850 while (pass)
1852 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *) pass;
1854 gcc_assert (!current_function_decl);
1855 gcc_assert (!cfun);
1856 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
1858 if (pass->gate == NULL || pass->gate ())
1860 if (pass->type == IPA_PASS && ipa_pass->read_optimization_summary)
1862 /* If a timevar is present, start it. */
1863 if (pass->tv_id)
1864 timevar_push (pass->tv_id);
1866 ipa_pass->read_optimization_summary ();
1868 /* Stop timevar. */
1869 if (pass->tv_id)
1870 timevar_pop (pass->tv_id);
1873 if (pass->sub && pass->sub->type != GIMPLE_PASS)
1874 ipa_read_optimization_summaries_1 (pass->sub);
1876 pass = pass->next;
1880 /* Read all the summaries for all_regular_ipa_passes and all_lto_gen_passes. */
1882 void
1883 ipa_read_optimization_summaries (void)
1885 ipa_read_optimization_summaries_1 (all_regular_ipa_passes);
1886 ipa_read_optimization_summaries_1 (all_lto_gen_passes);
1889 /* Same as execute_pass_list but assume that subpasses of IPA passes
1890 are local passes. */
1891 void
1892 execute_ipa_pass_list (struct opt_pass *pass)
1896 gcc_assert (!current_function_decl);
1897 gcc_assert (!cfun);
1898 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
1899 if (execute_one_pass (pass) && pass->sub)
1901 if (pass->sub->type == GIMPLE_PASS)
1903 invoke_plugin_callbacks (PLUGIN_EARLY_GIMPLE_PASSES_START, NULL);
1904 do_per_function_toporder ((void (*)(void *))execute_pass_list,
1905 pass->sub);
1906 invoke_plugin_callbacks (PLUGIN_EARLY_GIMPLE_PASSES_END, NULL);
1908 else if (pass->sub->type == SIMPLE_IPA_PASS
1909 || pass->sub->type == IPA_PASS)
1910 execute_ipa_pass_list (pass->sub);
1911 else
1912 gcc_unreachable ();
1914 gcc_assert (!current_function_decl);
1915 cgraph_process_new_functions ();
1916 pass = pass->next;
1918 while (pass);
1921 /* Execute stmt fixup hooks of all passes in PASS for NODE and STMTS. */
1923 static void
1924 execute_ipa_stmt_fixups (struct opt_pass *pass,
1925 struct cgraph_node *node, gimple *stmts)
1927 while (pass)
1929 /* Execute all of the IPA_PASSes in the list. */
1930 if (pass->type == IPA_PASS
1931 && (!pass->gate || pass->gate ()))
1933 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *) pass;
1935 if (ipa_pass->stmt_fixup)
1937 pass_init_dump_file (pass);
1938 /* If a timevar is present, start it. */
1939 if (pass->tv_id)
1940 timevar_push (pass->tv_id);
1942 ipa_pass->stmt_fixup (node, stmts);
1944 /* Stop timevar. */
1945 if (pass->tv_id)
1946 timevar_pop (pass->tv_id);
1947 pass_fini_dump_file (pass);
1949 if (pass->sub)
1950 execute_ipa_stmt_fixups (pass->sub, node, stmts);
1952 pass = pass->next;
1956 /* Execute stmt fixup hooks of all IPA passes for NODE and STMTS. */
1958 void
1959 execute_all_ipa_stmt_fixups (struct cgraph_node *node, gimple *stmts)
1961 execute_ipa_stmt_fixups (all_regular_ipa_passes, node, stmts);
1965 extern void debug_properties (unsigned int);
1966 extern void dump_properties (FILE *, unsigned int);
1968 void
1969 dump_properties (FILE *dump, unsigned int props)
1971 fprintf (dump, "Properties:\n");
1972 if (props & PROP_gimple_any)
1973 fprintf (dump, "PROP_gimple_any\n");
1974 if (props & PROP_gimple_lcf)
1975 fprintf (dump, "PROP_gimple_lcf\n");
1976 if (props & PROP_gimple_leh)
1977 fprintf (dump, "PROP_gimple_leh\n");
1978 if (props & PROP_cfg)
1979 fprintf (dump, "PROP_cfg\n");
1980 if (props & PROP_referenced_vars)
1981 fprintf (dump, "PROP_referenced_vars\n");
1982 if (props & PROP_ssa)
1983 fprintf (dump, "PROP_ssa\n");
1984 if (props & PROP_no_crit_edges)
1985 fprintf (dump, "PROP_no_crit_edges\n");
1986 if (props & PROP_rtl)
1987 fprintf (dump, "PROP_rtl\n");
1988 if (props & PROP_gimple_lomp)
1989 fprintf (dump, "PROP_gimple_lomp\n");
1990 if (props & PROP_gimple_lcx)
1991 fprintf (dump, "PROP_gimple_lcx\n");
1994 void
1995 debug_properties (unsigned int props)
1997 dump_properties (stderr, props);
2000 /* Called by local passes to see if function is called by already processed nodes.
2001 Because we process nodes in topological order, this means that function is
2002 in recursive cycle or we introduced new direct calls. */
2003 bool
2004 function_called_by_processed_nodes_p (void)
2006 struct cgraph_edge *e;
2007 for (e = cgraph_node (current_function_decl)->callers; e; e = e->next_caller)
2009 if (e->caller->decl == current_function_decl)
2010 continue;
2011 if (!e->caller->analyzed)
2012 continue;
2013 if (TREE_ASM_WRITTEN (e->caller->decl))
2014 continue;
2015 if (!e->caller->process && !e->caller->global.inlined_to)
2016 break;
2018 if (dump_file && e)
2020 fprintf (dump_file, "Already processed call to:\n");
2021 dump_cgraph_node (dump_file, e->caller);
2023 return e != NULL;
2026 #include "gt-passes.h"