1 /* Top level of GCC compilers (cc1, cc1plus, etc.)
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* This is the top level of cc1/c++.
23 It parses command args, opens files, invokes the various passes
24 in the proper order, and counts the time used by each.
25 Error messages and low-level interface to malloc also handled here. */
28 #undef FLOAT /* This is for hpux. They should change hpux. */
29 #undef FFS /* Some systems define this in param.h. */
31 #include "coretypes.h"
35 #ifdef HAVE_SYS_RESOURCE_H
36 # include <sys/resource.h>
39 #ifdef HAVE_SYS_TIMES_H
40 # include <sys/times.h>
49 #include "insn-attr.h"
50 #include "insn-config.h"
51 #include "insn-flags.h"
52 #include "hard-reg-set.h"
59 #include "basic-block.h"
65 #include "diagnostic.h"
68 #include "dwarf2asm.h"
69 #include "integrate.h"
73 #include "langhooks.h"
74 #include "cfglayout.h"
76 #include "hosthooks.h"
80 #include "value-prof.h"
81 #include "tree-inline.h"
82 #include "tree-flow.h"
83 #include "tree-pass.h"
84 #include "tree-dump.h"
87 #include "lto-streamer.h"
90 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
91 #include "dwarf2out.h"
94 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
98 #ifdef SDB_DEBUGGING_INFO
102 #ifdef XCOFF_DEBUGGING_INFO
103 #include "xcoffout.h" /* Needed for external data
104 declarations for e.g. AIX 4.x. */
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
116 print_current_pass (FILE *file)
119 fprintf (file, "current pass = %s (%d)\n",
120 current_pass->name, current_pass->static_pass_number);
122 fprintf (file, "no current pass.\n");
126 /* Call from the debugger to get the current pass name. */
130 print_current_pass (stderr);
135 /* Global variables used to communicate with passes. */
138 bool first_pass_instance;
141 /* This is called from various places for FUNCTION_DECL, VAR_DECL,
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. */
154 rest_of_decl_compilation (tree decl,
158 /* We deferred calling assemble_alias so that we could collect
159 other attributes such as visibility. Emit the alias now. */
162 alias = lookup_attribute ("alias", DECL_ATTRIBUTES (decl));
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) */
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);
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,
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))
225 /* Called after finishing a record, union or enumeral type. */
228 rest_of_type_compilation (tree type, int toplev)
230 /* Avoid confusing the debug information machinery when there are
232 if (errorcount != 0 || sorrycount != 0)
235 timevar_push (TV_SYMOUT);
236 debug_hooks->type_decl (TYPE_STUB_DECL (type), !toplev);
237 timevar_pop (TV_SYMOUT);
243 finish_optimization_passes (void)
246 struct dump_file_info *dfi;
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);
255 dump_end (pass_profile.pass.static_pass_number, dump_file);
260 dump_file = dump_begin (pass_combine.pass.static_pass_number, NULL);
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);
279 timevar_pop (TV_DUMP);
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 =
294 "*rest_of_compilation", /* name */
295 gate_rest_of_compilation, /* gate */
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 */
310 gate_postreload (void)
312 return reload_completed;
315 struct rtl_opt_pass pass_postreload =
319 "*all-postreload", /* name */
320 gate_postreload, /* gate */
324 0, /* static_pass_number */
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 /* A map from static pass id to optimization pass. */
341 struct opt_pass **passes_by_id;
342 int passes_by_id_size;
344 /* Set the static pass number of pass PASS to ID and record that
345 in the mapping from static pass number to pass. */
348 set_pass_for_id (int id, struct opt_pass *pass)
350 pass->static_pass_number = id;
351 if (passes_by_id_size <= id)
353 passes_by_id = XRESIZEVEC (struct opt_pass *, passes_by_id, id + 1);
354 memset (passes_by_id + passes_by_id_size, 0,
355 (id + 1 - passes_by_id_size) * sizeof (void *));
356 passes_by_id_size = id + 1;
358 passes_by_id[id] = pass;
361 /* Return the pass with the static pass number ID. */
364 get_pass_for_id (int id)
366 if (id >= passes_by_id_size)
368 return passes_by_id[id];
371 /* Iterate over the pass tree allocating dump file numbers. We want
372 to do this depth first, and independent of whether the pass is
376 register_one_dump_file (struct opt_pass *pass)
378 char *dot_name, *flag_name, *glob_name;
379 const char *name, *prefix;
383 /* See below in next_pass_1. */
385 if (pass->static_pass_number != -1)
386 sprintf (num, "%d", ((int) pass->static_pass_number < 0
387 ? 1 : pass->static_pass_number));
389 /* The name is both used to identify the pass for the purposes of plugins,
390 and to specify dump file name and option.
391 The latter two might want something short which is not quite unique; for
392 that reason, we may have a disambiguating prefix, followed by a space
393 to mark the start of the following dump file name / option string. */
394 name = strchr (pass->name, ' ');
395 name = name ? name + 1 : pass->name;
396 dot_name = concat (".", name, num, NULL);
397 if (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS)
398 prefix = "ipa-", flags = TDF_IPA;
399 else if (pass->type == GIMPLE_PASS)
400 prefix = "tree-", flags = TDF_TREE;
402 prefix = "rtl-", flags = TDF_RTL;
404 flag_name = concat (prefix, name, num, NULL);
405 glob_name = concat (prefix, name, NULL);
406 id = dump_register (dot_name, flag_name, glob_name, flags);
407 set_pass_for_id (id, pass);
410 /* Recursive worker function for register_dump_files. */
413 register_dump_files_1 (struct opt_pass *pass, int properties)
417 int new_properties = (properties | pass->properties_provided)
418 & ~pass->properties_destroyed;
420 if (pass->name && pass->name[0] != '*')
421 register_one_dump_file (pass);
424 new_properties = register_dump_files_1 (pass->sub, new_properties);
426 /* If we have a gate, combine the properties that we could have with
427 and without the pass being examined. */
429 properties &= new_properties;
431 properties = new_properties;
440 /* Register the dump files for the pipeline starting at PASS.
441 PROPERTIES reflects the properties that are guaranteed to be available at
442 the beginning of the pipeline. */
445 register_dump_files (struct opt_pass *pass,int properties)
447 pass->properties_required |= properties;
448 register_dump_files_1 (pass, properties);
451 /* Look at the static_pass_number and duplicate the pass
452 if it is already added to a list. */
454 static struct opt_pass *
455 make_pass_instance (struct opt_pass *pass, bool track_duplicates)
457 /* A nonzero static_pass_number indicates that the
458 pass is already in the list. */
459 if (pass->static_pass_number)
461 struct opt_pass *new_pass;
463 new_pass = XNEW (struct opt_pass);
464 memcpy (new_pass, pass, sizeof (*new_pass));
465 new_pass->next = NULL;
467 new_pass->todo_flags_start &= ~TODO_mark_first_instance;
469 /* Indicate to register_dump_files that this pass has duplicates,
470 and so it should rename the dump file. The first instance will
471 be -1, and be number of duplicates = -static_pass_number - 1.
472 Subsequent instances will be > 0 and just the duplicate number. */
473 if ((pass->name && pass->name[0] != '*') || track_duplicates)
475 pass->static_pass_number -= 1;
476 new_pass->static_pass_number = -pass->static_pass_number;
482 pass->todo_flags_start |= TODO_mark_first_instance;
483 pass->static_pass_number = -1;
485 invoke_plugin_callbacks (PLUGIN_NEW_PASS, pass);
490 /* Add a pass to the pass list. Duplicate the pass if it's already
493 static struct opt_pass **
494 next_pass_1 (struct opt_pass **list, struct opt_pass *pass)
496 /* Every pass should have a name so that plugins can refer to them. */
497 gcc_assert (pass->name != NULL);
499 *list = make_pass_instance (pass, false);
501 return &(*list)->next;
504 /* List node for an inserted pass instance. We need to keep track of all
505 the newly-added pass instances (with 'added_pass_nodes' defined below)
506 so that we can register their dump files after pass-positioning is finished.
507 Registering dumping files needs to be post-processed or the
508 static_pass_number of the opt_pass object would be modified and mess up
509 the dump file names of future pass instances to be added. */
511 struct pass_list_node
513 struct opt_pass *pass;
514 struct pass_list_node *next;
517 static struct pass_list_node *added_pass_nodes = NULL;
518 static struct pass_list_node *prev_added_pass_node;
520 /* Insert the pass at the proper position. Return true if the pass
521 is successfully added.
523 NEW_PASS_INFO - new pass to be inserted
524 PASS_LIST - root of the pass list to insert the new pass to */
527 position_pass (struct register_pass_info *new_pass_info,
528 struct opt_pass **pass_list)
530 struct opt_pass *pass = *pass_list, *prev_pass = NULL;
531 bool success = false;
533 for ( ; pass; prev_pass = pass, pass = pass->next)
535 /* Check if the current pass is of the same type as the new pass and
536 matches the name and the instance number of the reference pass. */
537 if (pass->type == new_pass_info->pass->type
539 && !strcmp (pass->name, new_pass_info->reference_pass_name)
540 && ((new_pass_info->ref_pass_instance_number == 0)
541 || (new_pass_info->ref_pass_instance_number ==
542 pass->static_pass_number)
543 || (new_pass_info->ref_pass_instance_number == 1
544 && pass->todo_flags_start & TODO_mark_first_instance)))
546 struct opt_pass *new_pass;
547 struct pass_list_node *new_pass_node;
549 new_pass = make_pass_instance (new_pass_info->pass, true);
551 /* Insert the new pass instance based on the positioning op. */
552 switch (new_pass_info->pos_op)
554 case PASS_POS_INSERT_AFTER:
555 new_pass->next = pass->next;
556 pass->next = new_pass;
558 /* Skip newly inserted pass to avoid repeated
559 insertions in the case where the new pass and the
560 existing one have the same name. */
563 case PASS_POS_INSERT_BEFORE:
564 new_pass->next = pass;
566 prev_pass->next = new_pass;
568 *pass_list = new_pass;
570 case PASS_POS_REPLACE:
571 new_pass->next = pass->next;
573 prev_pass->next = new_pass;
575 *pass_list = new_pass;
576 new_pass->sub = pass->sub;
577 new_pass->tv_id = pass->tv_id;
581 error ("Invalid pass positioning operation");
585 /* Save the newly added pass (instance) in the added_pass_nodes
586 list so that we can register its dump file later. Note that
587 we cannot register the dump file now because doing so will modify
588 the static_pass_number of the opt_pass object and therefore
589 mess up the dump file name of future instances. */
590 new_pass_node = XCNEW (struct pass_list_node);
591 new_pass_node->pass = new_pass;
592 if (!added_pass_nodes)
593 added_pass_nodes = new_pass_node;
595 prev_added_pass_node->next = new_pass_node;
596 prev_added_pass_node = new_pass_node;
601 if (pass->sub && position_pass (new_pass_info, &pass->sub))
608 /* Hooks a new pass into the pass lists.
610 PASS_INFO - pass information that specifies the opt_pass object,
611 reference pass, instance number, and how to position
615 register_pass (struct register_pass_info *pass_info)
617 /* The checks below could fail in buggy plugins. Existing GCC
618 passes should never fail these checks, so we mention plugin in
620 if (!pass_info->pass)
621 fatal_error ("plugin cannot register a missing pass");
623 if (!pass_info->pass->name)
624 fatal_error ("plugin cannot register an unnamed pass");
626 if (!pass_info->reference_pass_name)
628 ("plugin cannot register pass %qs without reference pass name",
629 pass_info->pass->name);
631 /* Try to insert the new pass to the pass lists. We need to check
632 all three lists as the reference pass could be in one (or all) of
634 if (!position_pass (pass_info, &all_lowering_passes)
635 && !position_pass (pass_info, &all_small_ipa_passes)
636 && !position_pass (pass_info, &all_regular_ipa_passes)
637 && !position_pass (pass_info, &all_lto_gen_passes)
638 && !position_pass (pass_info, &all_passes))
640 ("pass %qs not found but is referenced by new pass %qs",
641 pass_info->reference_pass_name, pass_info->pass->name);
644 /* OK, we have successfully inserted the new pass. We need to register
645 the dump files for the newly added pass and its duplicates (if any).
646 Because the registration of plugin/backend passes happens after the
647 command-line options are parsed, the options that specify single
648 pass dumping (e.g. -fdump-tree-PASSNAME) cannot be used for new
649 passes. Therefore we currently can only enable dumping of
650 new passes when the 'dump-all' flags (e.g. -fdump-tree-all)
651 are specified. While doing so, we also delete the pass_list_node
652 objects created during pass positioning. */
653 while (added_pass_nodes)
655 struct pass_list_node *next_node = added_pass_nodes->next;
656 enum tree_dump_index tdi;
657 register_one_dump_file (added_pass_nodes->pass);
658 if (added_pass_nodes->pass->type == SIMPLE_IPA_PASS
659 || added_pass_nodes->pass->type == IPA_PASS)
661 else if (added_pass_nodes->pass->type == GIMPLE_PASS)
665 /* Check if dump-all flag is specified. */
666 if (get_dump_file_info (tdi)->state)
667 get_dump_file_info (added_pass_nodes->pass->static_pass_number)
668 ->state = get_dump_file_info (tdi)->state;
669 XDELETE (added_pass_nodes);
670 added_pass_nodes = next_node;
675 /* Construct the pass tree. The sequencing of passes is driven by
678 cgraph_finalize_compilation_unit ()
679 for each node N in the cgraph
680 cgraph_analyze_function (N)
681 cgraph_lower_function (N) -> all_lowering_passes
683 If we are optimizing, cgraph_optimize is then invoked:
686 ipa_passes () -> all_small_ipa_passes
687 cgraph_expand_all_functions ()
688 for each node N in the cgraph
689 cgraph_expand_function (N)
690 tree_rest_of_compilation (DECL (N)) -> all_passes
694 init_optimization_passes (void)
698 #define NEXT_PASS(PASS) (p = next_pass_1 (p, &((PASS).pass)))
700 /* All passes needed to lower the function into shape optimizers can
701 operate on. These passes are always run first on the function, but
702 backend might produce already lowered functions that are not processed
704 p = &all_lowering_passes;
705 NEXT_PASS (pass_warn_unused_result);
706 NEXT_PASS (pass_diagnose_omp_blocks);
707 NEXT_PASS (pass_mudflap_1);
708 NEXT_PASS (pass_lower_omp);
709 NEXT_PASS (pass_lower_cf);
710 NEXT_PASS (pass_refactor_eh);
711 NEXT_PASS (pass_lower_eh);
712 NEXT_PASS (pass_build_cfg);
713 NEXT_PASS (pass_lower_complex_O0);
714 NEXT_PASS (pass_lower_vector);
715 NEXT_PASS (pass_warn_function_return);
716 NEXT_PASS (pass_build_cgraph_edges);
717 NEXT_PASS (pass_inline_parameters);
720 /* Interprocedural optimization passes. */
721 p = &all_small_ipa_passes;
722 NEXT_PASS (pass_ipa_function_and_variable_visibility);
723 NEXT_PASS (pass_ipa_early_inline);
725 struct opt_pass **p = &pass_ipa_early_inline.pass.sub;
726 NEXT_PASS (pass_early_inline);
727 NEXT_PASS (pass_inline_parameters);
728 NEXT_PASS (pass_rebuild_cgraph_edges);
730 NEXT_PASS (pass_ipa_free_lang_data);
731 NEXT_PASS (pass_early_local_passes);
733 struct opt_pass **p = &pass_early_local_passes.pass.sub;
734 NEXT_PASS (pass_fixup_cfg);
735 NEXT_PASS (pass_tree_profile);
736 NEXT_PASS (pass_cleanup_cfg);
737 NEXT_PASS (pass_init_datastructures);
738 NEXT_PASS (pass_expand_omp);
740 NEXT_PASS (pass_referenced_vars);
741 NEXT_PASS (pass_build_ssa);
742 NEXT_PASS (pass_early_warn_uninitialized);
743 /* Note that it is not strictly necessary to schedule an early
744 inline pass here. However, some test cases (e.g.,
745 g++.dg/other/p334435.C g++.dg/other/i386-1.C) expect extern
746 inline functions to be inlined even at -O0. This does not
747 happen during the first early inline pass. */
748 NEXT_PASS (pass_rebuild_cgraph_edges);
749 NEXT_PASS (pass_early_inline);
750 NEXT_PASS (pass_all_early_optimizations);
752 struct opt_pass **p = &pass_all_early_optimizations.pass.sub;
753 NEXT_PASS (pass_remove_cgraph_callee_edges);
754 NEXT_PASS (pass_rename_ssa_copies);
755 NEXT_PASS (pass_ccp);
756 NEXT_PASS (pass_forwprop);
757 /* pass_build_ealias is a dummy pass that ensures that we
758 execute TODO_rebuild_alias at this point. Re-building
759 alias information also rewrites no longer addressed
760 locals into SSA form if possible. */
761 NEXT_PASS (pass_build_ealias);
762 NEXT_PASS (pass_sra_early);
763 NEXT_PASS (pass_copy_prop);
764 NEXT_PASS (pass_merge_phi);
765 NEXT_PASS (pass_cd_dce);
766 NEXT_PASS (pass_early_ipa_sra);
767 NEXT_PASS (pass_tail_recursion);
768 NEXT_PASS (pass_convert_switch);
769 NEXT_PASS (pass_cleanup_eh);
770 NEXT_PASS (pass_profile);
771 NEXT_PASS (pass_local_pure_const);
773 NEXT_PASS (pass_release_ssa_names);
774 NEXT_PASS (pass_rebuild_cgraph_edges);
775 NEXT_PASS (pass_inline_parameters);
777 NEXT_PASS (pass_ipa_increase_alignment);
778 NEXT_PASS (pass_ipa_matrix_reorg);
781 p = &all_regular_ipa_passes;
782 NEXT_PASS (pass_ipa_whole_program_visibility);
783 NEXT_PASS (pass_ipa_cp);
784 NEXT_PASS (pass_ipa_inline);
785 NEXT_PASS (pass_ipa_reference);
786 NEXT_PASS (pass_ipa_pure_const);
787 NEXT_PASS (pass_ipa_type_escape);
788 NEXT_PASS (pass_ipa_pta);
789 NEXT_PASS (pass_ipa_struct_reorg);
792 p = &all_lto_gen_passes;
793 NEXT_PASS (pass_ipa_lto_gimple_out);
794 NEXT_PASS (pass_ipa_lto_wpa_fixup);
795 NEXT_PASS (pass_ipa_lto_finish_out); /* This must be the last LTO pass. */
798 /* These passes are run after IPA passes on every function that is being
799 output to the assembler file. */
801 NEXT_PASS (pass_lower_eh_dispatch);
802 NEXT_PASS (pass_all_optimizations);
804 struct opt_pass **p = &pass_all_optimizations.pass.sub;
805 NEXT_PASS (pass_remove_cgraph_callee_edges);
806 /* Initial scalar cleanups before alias computation.
807 They ensure memory accesses are not indirect wherever possible. */
808 NEXT_PASS (pass_strip_predict_hints);
809 NEXT_PASS (pass_update_address_taken);
810 NEXT_PASS (pass_rename_ssa_copies);
811 NEXT_PASS (pass_complete_unrolli);
812 NEXT_PASS (pass_ccp);
813 NEXT_PASS (pass_forwprop);
814 NEXT_PASS (pass_call_cdce);
815 /* pass_build_alias is a dummy pass that ensures that we
816 execute TODO_rebuild_alias at this point. Re-building
817 alias information also rewrites no longer addressed
818 locals into SSA form if possible. */
819 NEXT_PASS (pass_build_alias);
820 NEXT_PASS (pass_return_slot);
821 NEXT_PASS (pass_phiprop);
822 NEXT_PASS (pass_fre);
823 NEXT_PASS (pass_copy_prop);
824 NEXT_PASS (pass_merge_phi);
825 NEXT_PASS (pass_vrp);
826 NEXT_PASS (pass_dce);
827 NEXT_PASS (pass_cselim);
828 NEXT_PASS (pass_tree_ifcombine);
829 NEXT_PASS (pass_phiopt);
830 NEXT_PASS (pass_tail_recursion);
832 NEXT_PASS (pass_stdarg);
833 NEXT_PASS (pass_lower_complex);
834 NEXT_PASS (pass_sra);
835 NEXT_PASS (pass_rename_ssa_copies);
836 /* The dom pass will also resolve all __builtin_constant_p calls
837 that are still there to 0. This has to be done after some
838 propagations have already run, but before some more dead code
839 is removed, and this place fits nicely. Remember this when
840 trying to move or duplicate pass_dominator somewhere earlier. */
841 NEXT_PASS (pass_dominator);
842 /* The only const/copy propagation opportunities left after
843 DOM should be due to degenerate PHI nodes. So rather than
844 run the full propagators, run a specialized pass which
845 only examines PHIs to discover const/copy propagation
847 NEXT_PASS (pass_phi_only_cprop);
848 NEXT_PASS (pass_dse);
849 NEXT_PASS (pass_reassoc);
850 NEXT_PASS (pass_dce);
851 NEXT_PASS (pass_forwprop);
852 NEXT_PASS (pass_phiopt);
853 NEXT_PASS (pass_object_sizes);
854 NEXT_PASS (pass_ccp);
855 NEXT_PASS (pass_copy_prop);
856 NEXT_PASS (pass_cse_sincos);
857 NEXT_PASS (pass_optimize_bswap);
858 NEXT_PASS (pass_split_crit_edges);
859 NEXT_PASS (pass_pre);
860 NEXT_PASS (pass_sink_code);
861 NEXT_PASS (pass_tree_loop);
863 struct opt_pass **p = &pass_tree_loop.pass.sub;
864 NEXT_PASS (pass_tree_loop_init);
865 NEXT_PASS (pass_copy_prop);
866 NEXT_PASS (pass_dce_loop);
867 NEXT_PASS (pass_lim);
868 NEXT_PASS (pass_tree_unswitch);
869 NEXT_PASS (pass_scev_cprop);
870 NEXT_PASS (pass_record_bounds);
871 NEXT_PASS (pass_check_data_deps);
872 NEXT_PASS (pass_loop_distribution);
873 NEXT_PASS (pass_linear_transform);
874 NEXT_PASS (pass_graphite_transforms);
876 struct opt_pass **p = &pass_graphite_transforms.pass.sub;
877 NEXT_PASS (pass_dce_loop);
878 NEXT_PASS (pass_lim);
880 NEXT_PASS (pass_iv_canon);
881 NEXT_PASS (pass_if_conversion);
882 NEXT_PASS (pass_vectorize);
884 struct opt_pass **p = &pass_vectorize.pass.sub;
885 NEXT_PASS (pass_lower_vector_ssa);
886 NEXT_PASS (pass_dce_loop);
888 NEXT_PASS (pass_predcom);
889 NEXT_PASS (pass_complete_unroll);
890 NEXT_PASS (pass_slp_vectorize);
891 NEXT_PASS (pass_parallelize_loops);
892 NEXT_PASS (pass_loop_prefetch);
893 NEXT_PASS (pass_iv_optimize);
894 NEXT_PASS (pass_tree_loop_done);
896 NEXT_PASS (pass_cse_reciprocals);
897 NEXT_PASS (pass_reassoc);
898 NEXT_PASS (pass_vrp);
899 NEXT_PASS (pass_dominator);
900 /* The only const/copy propagation opportunities left after
901 DOM should be due to degenerate PHI nodes. So rather than
902 run the full propagators, run a specialized pass which
903 only examines PHIs to discover const/copy propagation
905 NEXT_PASS (pass_phi_only_cprop);
906 NEXT_PASS (pass_cd_dce);
907 NEXT_PASS (pass_tracer);
909 /* FIXME: If DCE is not run before checking for uninitialized uses,
910 we may get false warnings (e.g., testsuite/gcc.dg/uninit-5.c).
911 However, this also causes us to misdiagnose cases that should be
912 real warnings (e.g., testsuite/gcc.dg/pr18501.c).
914 To fix the false positives in uninit-5.c, we would have to
915 account for the predicates protecting the set and the use of each
916 variable. Using a representation like Gated Single Assignment
918 NEXT_PASS (pass_late_warn_uninitialized);
919 NEXT_PASS (pass_dse);
920 NEXT_PASS (pass_forwprop);
921 NEXT_PASS (pass_phiopt);
922 NEXT_PASS (pass_fold_builtins);
923 NEXT_PASS (pass_tail_calls);
924 NEXT_PASS (pass_rename_ssa_copies);
925 NEXT_PASS (pass_uncprop);
926 NEXT_PASS (pass_local_pure_const);
928 NEXT_PASS (pass_cleanup_eh);
929 NEXT_PASS (pass_lower_resx);
930 NEXT_PASS (pass_nrv);
931 NEXT_PASS (pass_mudflap_2);
932 NEXT_PASS (pass_cleanup_cfg_post_optimizing);
933 NEXT_PASS (pass_warn_function_noreturn);
935 NEXT_PASS (pass_expand);
937 NEXT_PASS (pass_rest_of_compilation);
939 struct opt_pass **p = &pass_rest_of_compilation.pass.sub;
940 NEXT_PASS (pass_init_function);
941 NEXT_PASS (pass_jump);
942 NEXT_PASS (pass_rtl_eh);
943 NEXT_PASS (pass_initial_value_sets);
944 NEXT_PASS (pass_unshare_all_rtl);
945 NEXT_PASS (pass_instantiate_virtual_regs);
946 NEXT_PASS (pass_into_cfg_layout_mode);
947 NEXT_PASS (pass_jump2);
948 NEXT_PASS (pass_lower_subreg);
949 NEXT_PASS (pass_df_initialize_opt);
950 NEXT_PASS (pass_cse);
951 NEXT_PASS (pass_rtl_fwprop);
952 NEXT_PASS (pass_rtl_cprop);
953 NEXT_PASS (pass_rtl_pre);
954 NEXT_PASS (pass_rtl_hoist);
955 NEXT_PASS (pass_rtl_cprop);
956 NEXT_PASS (pass_rtl_store_motion);
957 NEXT_PASS (pass_cse_after_global_opts);
958 NEXT_PASS (pass_rtl_ifcvt);
959 NEXT_PASS (pass_reginfo_init);
960 /* Perform loop optimizations. It might be better to do them a bit
961 sooner, but we want the profile feedback to work more
963 NEXT_PASS (pass_loop2);
965 struct opt_pass **p = &pass_loop2.pass.sub;
966 NEXT_PASS (pass_rtl_loop_init);
967 NEXT_PASS (pass_rtl_move_loop_invariants);
968 NEXT_PASS (pass_rtl_unswitch);
969 NEXT_PASS (pass_rtl_unroll_and_peel_loops);
970 NEXT_PASS (pass_rtl_doloop);
971 NEXT_PASS (pass_rtl_loop_done);
974 NEXT_PASS (pass_web);
975 NEXT_PASS (pass_rtl_cprop);
976 NEXT_PASS (pass_cse2);
977 NEXT_PASS (pass_rtl_dse1);
978 NEXT_PASS (pass_rtl_fwprop_addr);
979 NEXT_PASS (pass_inc_dec);
980 NEXT_PASS (pass_initialize_regs);
981 NEXT_PASS (pass_ud_rtl_dce);
982 NEXT_PASS (pass_combine);
983 NEXT_PASS (pass_if_after_combine);
984 NEXT_PASS (pass_partition_blocks);
985 NEXT_PASS (pass_regmove);
986 NEXT_PASS (pass_outof_cfg_layout_mode);
987 NEXT_PASS (pass_split_all_insns);
988 NEXT_PASS (pass_lower_subreg2);
989 NEXT_PASS (pass_df_initialize_no_opt);
990 NEXT_PASS (pass_stack_ptr_mod);
991 NEXT_PASS (pass_mode_switching);
992 NEXT_PASS (pass_match_asm_constraints);
993 NEXT_PASS (pass_sms);
994 NEXT_PASS (pass_sched);
995 NEXT_PASS (pass_ira);
996 NEXT_PASS (pass_postreload);
998 struct opt_pass **p = &pass_postreload.pass.sub;
999 NEXT_PASS (pass_postreload_cse);
1000 NEXT_PASS (pass_gcse2);
1001 NEXT_PASS (pass_split_after_reload);
1002 NEXT_PASS (pass_branch_target_load_optimize1);
1003 NEXT_PASS (pass_thread_prologue_and_epilogue);
1004 NEXT_PASS (pass_rtl_dse2);
1005 NEXT_PASS (pass_stack_adjustments);
1006 NEXT_PASS (pass_peephole2);
1007 NEXT_PASS (pass_if_after_reload);
1008 NEXT_PASS (pass_regrename);
1009 NEXT_PASS (pass_cprop_hardreg);
1010 NEXT_PASS (pass_fast_rtl_dce);
1011 NEXT_PASS (pass_reorder_blocks);
1012 NEXT_PASS (pass_branch_target_load_optimize2);
1013 NEXT_PASS (pass_leaf_regs);
1014 NEXT_PASS (pass_split_before_sched2);
1015 NEXT_PASS (pass_sched2);
1016 NEXT_PASS (pass_stack_regs);
1018 struct opt_pass **p = &pass_stack_regs.pass.sub;
1019 NEXT_PASS (pass_split_before_regstack);
1020 NEXT_PASS (pass_stack_regs_run);
1022 NEXT_PASS (pass_compute_alignments);
1023 NEXT_PASS (pass_duplicate_computed_gotos);
1024 NEXT_PASS (pass_variable_tracking);
1025 NEXT_PASS (pass_free_cfg);
1026 NEXT_PASS (pass_machine_reorg);
1027 NEXT_PASS (pass_cleanup_barriers);
1028 NEXT_PASS (pass_delay_slots);
1029 NEXT_PASS (pass_split_for_shorten_branches);
1030 NEXT_PASS (pass_convert_to_eh_region_ranges);
1031 NEXT_PASS (pass_shorten_branches);
1032 NEXT_PASS (pass_set_nothrow_function_flags);
1033 NEXT_PASS (pass_final);
1035 NEXT_PASS (pass_df_finish);
1037 NEXT_PASS (pass_clean_state);
1042 /* Register the passes with the tree dump code. */
1043 register_dump_files (all_lowering_passes, PROP_gimple_any);
1044 register_dump_files (all_small_ipa_passes,
1045 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1047 register_dump_files (all_regular_ipa_passes,
1048 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1050 register_dump_files (all_lto_gen_passes,
1051 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1053 register_dump_files (all_passes,
1054 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
1058 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
1059 function CALLBACK for every function in the call graph. Otherwise,
1060 call CALLBACK on the current function. */
1063 do_per_function (void (*callback) (void *data), void *data)
1065 if (current_function_decl)
1069 struct cgraph_node *node;
1070 for (node = cgraph_nodes; node; node = node->next)
1071 if (node->analyzed && gimple_has_body_p (node->decl)
1072 && (!node->clone_of || node->decl != node->clone_of->decl))
1074 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
1075 current_function_decl = node->decl;
1079 free_dominance_info (CDI_DOMINATORS);
1080 free_dominance_info (CDI_POST_DOMINATORS);
1082 current_function_decl = NULL;
1089 /* Because inlining might remove no-longer reachable nodes, we need to
1090 keep the array visible to garbage collector to avoid reading collected
1093 static GTY ((length ("nnodes"))) struct cgraph_node **order;
1095 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
1096 function CALLBACK for every function in the call graph. Otherwise,
1097 call CALLBACK on the current function.
1098 This function is global so that plugins can use it. */
1100 do_per_function_toporder (void (*callback) (void *data), void *data)
1104 if (current_function_decl)
1108 gcc_assert (!order);
1109 order = GGC_NEWVEC (struct cgraph_node *, cgraph_n_nodes);
1110 nnodes = cgraph_postorder (order);
1111 for (i = nnodes - 1; i >= 0; i--)
1112 order[i]->process = 1;
1113 for (i = nnodes - 1; i >= 0; i--)
1115 struct cgraph_node *node = order[i];
1117 /* Allow possibly removed nodes to be garbage collected. */
1122 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
1123 current_function_decl = node->decl;
1125 free_dominance_info (CDI_DOMINATORS);
1126 free_dominance_info (CDI_POST_DOMINATORS);
1127 current_function_decl = NULL;
1138 /* Perform all TODO actions that ought to be done on each function. */
1141 execute_function_todo (void *data)
1143 unsigned int flags = (size_t)data;
1144 if (cfun->curr_properties & PROP_ssa)
1145 flags |= TODO_verify_ssa;
1146 flags &= ~cfun->last_verified;
1150 statistics_fini_pass ();
1152 /* Always cleanup the CFG before trying to update SSA. */
1153 if (flags & TODO_cleanup_cfg)
1155 bool cleanup = cleanup_tree_cfg ();
1157 if (cleanup && (cfun->curr_properties & PROP_ssa))
1158 flags |= TODO_remove_unused_locals;
1160 /* When cleanup_tree_cfg merges consecutive blocks, it may
1161 perform some simplistic propagation when removing single
1162 valued PHI nodes. This propagation may, in turn, cause the
1163 SSA form to become out-of-date (see PR 22037). So, even
1164 if the parent pass had not scheduled an SSA update, we may
1165 still need to do one. */
1166 if (!(flags & TODO_update_ssa_any) && need_ssa_update_p (cfun))
1167 flags |= TODO_update_ssa;
1170 if (flags & TODO_update_ssa_any)
1172 unsigned update_flags = flags & TODO_update_ssa_any;
1173 update_ssa (update_flags);
1174 cfun->last_verified &= ~TODO_verify_ssa;
1177 if (flags & TODO_update_address_taken)
1178 execute_update_addresses_taken (true);
1180 if (flags & TODO_rebuild_alias)
1182 if (!(flags & TODO_update_address_taken))
1183 execute_update_addresses_taken (true);
1184 compute_may_aliases ();
1187 if (flags & TODO_remove_unused_locals)
1188 remove_unused_locals ();
1190 if ((flags & TODO_dump_func) && dump_file && current_function_decl)
1192 if (cfun->curr_properties & PROP_trees)
1193 dump_function_to_file (current_function_decl, dump_file, dump_flags);
1196 if (dump_flags & TDF_SLIM)
1197 print_rtl_slim_with_bb (dump_file, get_insns (), dump_flags);
1198 else if ((cfun->curr_properties & PROP_cfg)
1199 && (dump_flags & TDF_BLOCKS))
1200 print_rtl_with_bb (dump_file, get_insns ());
1202 print_rtl (dump_file, get_insns ());
1204 if ((cfun->curr_properties & PROP_cfg)
1205 && graph_dump_format != no_graph
1206 && (dump_flags & TDF_GRAPH))
1207 print_rtl_graph_with_bb (dump_file_name, get_insns ());
1210 /* Flush the file. If verification fails, we won't be able to
1211 close the file before aborting. */
1215 if (flags & TODO_rebuild_frequencies)
1217 if (profile_status == PROFILE_GUESSED)
1219 loop_optimizer_init (0);
1220 add_noreturn_fake_exit_edges ();
1221 mark_irreducible_loops ();
1222 connect_infinite_loops_to_exit ();
1223 estimate_bb_frequencies ();
1224 remove_fake_exit_edges ();
1225 loop_optimizer_finalize ();
1227 else if (profile_status == PROFILE_READ)
1233 #if defined ENABLE_CHECKING
1234 if (flags & TODO_verify_ssa)
1236 if (flags & TODO_verify_flow)
1237 verify_flow_info ();
1238 if (flags & TODO_verify_stmts)
1240 if (flags & TODO_verify_loops)
1241 verify_loop_closed_ssa ();
1242 if (flags & TODO_verify_rtl_sharing)
1243 verify_rtl_sharing ();
1246 cfun->last_verified = flags & TODO_verify_all;
1249 /* Perform all TODO actions. */
1251 execute_todo (unsigned int flags)
1253 #if defined ENABLE_CHECKING
1255 && need_ssa_update_p (cfun))
1256 gcc_assert (flags & TODO_update_ssa_any);
1259 /* Inform the pass whether it is the first time it is run. */
1260 first_pass_instance = (flags & TODO_mark_first_instance) != 0;
1262 do_per_function (execute_function_todo, (void *)(size_t) flags);
1264 /* Always remove functions just as before inlining: IPA passes might be
1265 interested to see bodies of extern inline functions that are not inlined
1266 to analyze side effects. The full removal is done just at the end
1267 of IPA pass queue. */
1268 if (flags & TODO_remove_functions)
1271 cgraph_remove_unreachable_nodes (true, dump_file);
1274 if ((flags & TODO_dump_cgraph) && dump_file && !current_function_decl)
1277 dump_cgraph (dump_file);
1278 /* Flush the file. If verification fails, we won't be able to
1279 close the file before aborting. */
1283 if (flags & TODO_ggc_collect)
1286 /* Now that the dumping has been done, we can get rid of the optional
1288 if (flags & TODO_df_finish)
1289 df_finish_pass ((flags & TODO_df_verify) != 0);
1292 /* Verify invariants that should hold between passes. This is a place
1293 to put simple sanity checks. */
1296 verify_interpass_invariants (void)
1298 #ifdef ENABLE_CHECKING
1299 gcc_assert (!fold_deferring_overflow_warnings_p ());
1303 /* Clear the last verified flag. */
1306 clear_last_verified (void *data ATTRIBUTE_UNUSED)
1308 cfun->last_verified = 0;
1311 /* Helper function. Verify that the properties has been turn into the
1312 properties expected by the pass. */
1314 #ifdef ENABLE_CHECKING
1316 verify_curr_properties (void *data)
1318 unsigned int props = (size_t)data;
1319 gcc_assert ((cfun->curr_properties & props) == props);
1323 /* Initialize pass dump file. */
1324 /* This is non-static so that the plugins can use it. */
1327 pass_init_dump_file (struct opt_pass *pass)
1329 /* If a dump file name is present, open it if enabled. */
1330 if (pass->static_pass_number != -1)
1332 bool initializing_dump = !dump_initialized_p (pass->static_pass_number);
1333 dump_file_name = get_dump_file_name (pass->static_pass_number);
1334 dump_file = dump_begin (pass->static_pass_number, &dump_flags);
1335 if (dump_file && current_function_decl)
1337 const char *dname, *aname;
1338 dname = lang_hooks.decl_printable_name (current_function_decl, 2);
1339 aname = (IDENTIFIER_POINTER
1340 (DECL_ASSEMBLER_NAME (current_function_decl)));
1341 fprintf (dump_file, "\n;; Function %s (%s)%s\n\n", dname, aname,
1342 cfun->function_frequency == FUNCTION_FREQUENCY_HOT
1344 : cfun->function_frequency == FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
1345 ? " (unlikely executed)"
1348 return initializing_dump;
1354 /* Flush PASS dump file. */
1355 /* This is non-static so that plugins can use it. */
1358 pass_fini_dump_file (struct opt_pass *pass)
1360 /* Flush and close dump file. */
1363 free (CONST_CAST (char *, dump_file_name));
1364 dump_file_name = NULL;
1369 dump_end (pass->static_pass_number, dump_file);
1374 /* After executing the pass, apply expected changes to the function
1378 update_properties_after_pass (void *data)
1380 struct opt_pass *pass = (struct opt_pass *) data;
1381 cfun->curr_properties = (cfun->curr_properties | pass->properties_provided)
1382 & ~pass->properties_destroyed;
1385 /* Execute summary generation for all of the passes in IPA_PASS. */
1388 execute_ipa_summary_passes (struct ipa_opt_pass_d *ipa_pass)
1392 struct opt_pass *pass = &ipa_pass->pass;
1394 /* Execute all of the IPA_PASSes in the list. */
1395 if (ipa_pass->pass.type == IPA_PASS
1396 && (!pass->gate || pass->gate ())
1397 && ipa_pass->generate_summary)
1399 pass_init_dump_file (pass);
1401 /* If a timevar is present, start it. */
1403 timevar_push (pass->tv_id);
1405 ipa_pass->generate_summary ();
1409 timevar_pop (pass->tv_id);
1411 pass_fini_dump_file (pass);
1413 ipa_pass = (struct ipa_opt_pass_d *)ipa_pass->pass.next;
1417 /* Execute IPA_PASS function transform on NODE. */
1420 execute_one_ipa_transform_pass (struct cgraph_node *node,
1421 struct ipa_opt_pass_d *ipa_pass)
1423 struct opt_pass *pass = &ipa_pass->pass;
1424 unsigned int todo_after = 0;
1426 current_pass = pass;
1427 if (!ipa_pass->function_transform)
1430 /* Note that the folders should only create gimple expressions.
1431 This is a hack until the new folder is ready. */
1432 in_gimple_form = (cfun && (cfun->curr_properties & PROP_trees)) != 0;
1434 pass_init_dump_file (pass);
1436 /* Run pre-pass verification. */
1437 execute_todo (ipa_pass->function_transform_todo_flags_start);
1439 /* If a timevar is present, start it. */
1440 if (pass->tv_id != TV_NONE)
1441 timevar_push (pass->tv_id);
1444 todo_after = ipa_pass->function_transform (node);
1447 if (pass->tv_id != TV_NONE)
1448 timevar_pop (pass->tv_id);
1450 /* Run post-pass cleanup and verification. */
1451 execute_todo (todo_after);
1452 verify_interpass_invariants ();
1454 pass_fini_dump_file (pass);
1456 current_pass = NULL;
1459 /* For the current function, execute all ipa transforms. */
1462 execute_all_ipa_transforms (void)
1464 struct cgraph_node *node;
1467 node = cgraph_node (current_function_decl);
1468 if (node->ipa_transforms_to_apply)
1472 for (i = 0; i < VEC_length (ipa_opt_pass, node->ipa_transforms_to_apply);
1474 execute_one_ipa_transform_pass (node,
1475 VEC_index (ipa_opt_pass,
1476 node->ipa_transforms_to_apply,
1478 VEC_free (ipa_opt_pass, heap, node->ipa_transforms_to_apply);
1479 node->ipa_transforms_to_apply = NULL;
1486 execute_one_pass (struct opt_pass *pass)
1488 bool initializing_dump;
1489 unsigned int todo_after = 0;
1493 /* IPA passes are executed on whole program, so cfun should be NULL.
1494 Other passes need function context set. */
1495 if (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS)
1496 gcc_assert (!cfun && !current_function_decl);
1498 gcc_assert (cfun && current_function_decl);
1500 current_pass = pass;
1502 /* Check whether gate check should be avoided.
1503 User controls the value of the gate through the parameter "gate_status". */
1504 gate_status = (pass->gate == NULL) ? true : pass->gate();
1506 /* Override gate with plugin. */
1507 invoke_plugin_callbacks (PLUGIN_OVERRIDE_GATE, &gate_status);
1511 current_pass = NULL;
1515 /* Pass execution event trigger: useful to identify passes being
1517 invoke_plugin_callbacks (PLUGIN_PASS_EXECUTION, pass);
1519 if (!quiet_flag && !cfun)
1520 fprintf (stderr, " <%s>", pass->name ? pass->name : "");
1522 /* Note that the folders should only create gimple expressions.
1523 This is a hack until the new folder is ready. */
1524 in_gimple_form = (cfun && (cfun->curr_properties & PROP_trees)) != 0;
1526 initializing_dump = pass_init_dump_file (pass);
1528 /* Run pre-pass verification. */
1529 execute_todo (pass->todo_flags_start);
1531 #ifdef ENABLE_CHECKING
1532 do_per_function (verify_curr_properties,
1533 (void *)(size_t)pass->properties_required);
1536 /* If a timevar is present, start it. */
1537 if (pass->tv_id != TV_NONE)
1538 timevar_push (pass->tv_id);
1543 todo_after = pass->execute ();
1544 do_per_function (clear_last_verified, NULL);
1548 if (pass->tv_id != TV_NONE)
1549 timevar_pop (pass->tv_id);
1551 do_per_function (update_properties_after_pass, pass);
1553 if (initializing_dump
1555 && graph_dump_format != no_graph
1557 && (cfun->curr_properties & (PROP_cfg | PROP_rtl))
1558 == (PROP_cfg | PROP_rtl))
1560 get_dump_file_info (pass->static_pass_number)->flags |= TDF_GRAPH;
1561 dump_flags |= TDF_GRAPH;
1562 clean_graph_dump_file (dump_file_name);
1565 /* Run post-pass cleanup and verification. */
1566 execute_todo (todo_after | pass->todo_flags_finish);
1567 verify_interpass_invariants ();
1568 if (pass->type == IPA_PASS)
1570 struct cgraph_node *node;
1571 for (node = cgraph_nodes; node; node = node->next)
1573 VEC_safe_push (ipa_opt_pass, heap, node->ipa_transforms_to_apply,
1574 (struct ipa_opt_pass_d *)pass);
1577 if (!current_function_decl)
1578 cgraph_process_new_functions ();
1580 pass_fini_dump_file (pass);
1582 if (pass->type != SIMPLE_IPA_PASS && pass->type != IPA_PASS)
1583 gcc_assert (!(cfun->curr_properties & PROP_trees)
1584 || pass->type != RTL_PASS);
1586 current_pass = NULL;
1592 execute_pass_list (struct opt_pass *pass)
1596 gcc_assert (pass->type == GIMPLE_PASS
1597 || pass->type == RTL_PASS);
1598 if (execute_one_pass (pass) && pass->sub)
1599 execute_pass_list (pass->sub);
1605 /* Same as execute_pass_list but assume that subpasses of IPA passes
1606 are local passes. If SET is not NULL, write out summaries of only
1607 those node in SET. */
1610 ipa_write_summaries_2 (struct opt_pass *pass, cgraph_node_set set,
1611 struct lto_out_decl_state *state)
1615 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *)pass;
1616 gcc_assert (!current_function_decl);
1618 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
1619 if (pass->type == IPA_PASS
1620 && ipa_pass->write_summary
1621 && (!pass->gate || pass->gate ()))
1623 /* If a timevar is present, start it. */
1625 timevar_push (pass->tv_id);
1627 ipa_pass->write_summary (set);
1629 /* If a timevar is present, start it. */
1631 timevar_pop (pass->tv_id);
1634 if (pass->sub && pass->sub->type != GIMPLE_PASS)
1635 ipa_write_summaries_2 (pass->sub, set, state);
1641 /* Helper function of ipa_write_summaries. Creates and destroys the
1642 decl state and calls ipa_write_summaries_2 for all passes that have
1643 summaries. SET is the set of nodes to be written. */
1646 ipa_write_summaries_1 (cgraph_node_set set)
1648 struct lto_out_decl_state *state = lto_new_out_decl_state ();
1649 lto_push_out_decl_state (state);
1652 ipa_write_summaries_2 (all_regular_ipa_passes, set, state);
1653 ipa_write_summaries_2 (all_lto_gen_passes, set, state);
1655 gcc_assert (lto_get_out_decl_state () == state);
1656 lto_pop_out_decl_state ();
1657 lto_delete_out_decl_state (state);
1660 /* Write out summaries for all the nodes in the callgraph. */
1663 ipa_write_summaries (void)
1665 cgraph_node_set set;
1666 struct cgraph_node **order;
1669 if (!flag_generate_lto || errorcount || sorrycount)
1672 lto_new_extern_inline_states ();
1673 set = cgraph_node_set_new ();
1675 /* Create the callgraph set in the same order used in
1676 cgraph_expand_all_functions. This mostly facilitates debugging,
1677 since it causes the gimple file to be processed in the same order
1678 as the source code. */
1679 order = XCNEWVEC (struct cgraph_node *, cgraph_n_nodes);
1680 order_pos = cgraph_postorder (order);
1681 gcc_assert (order_pos == cgraph_n_nodes);
1683 for (i = order_pos - 1; i >= 0; i--)
1685 struct cgraph_node *node = order[i];
1689 /* When streaming out references to statements as part of some IPA
1690 pass summary, the statements need to have uids assigned and the
1691 following does that for all the IPA passes here. Naturally, this
1692 ordering then matches the one IPA-passes get in their stmt_fixup
1695 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
1696 renumber_gimple_stmt_uids ();
1699 cgraph_node_set_add (set, node);
1702 ipa_write_summaries_1 (set);
1703 lto_delete_extern_inline_states ();
1710 /* Write all the summaries for the cgraph nodes in SET. If SET is
1711 NULL, write out all summaries of all nodes. */
1714 ipa_write_summaries_of_cgraph_node_set (cgraph_node_set set)
1716 if (flag_generate_lto && !(errorcount || sorrycount))
1717 ipa_write_summaries_1 (set);
1720 /* Same as execute_pass_list but assume that subpasses of IPA passes
1721 are local passes. */
1724 ipa_read_summaries_1 (struct opt_pass *pass)
1728 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *) pass;
1730 gcc_assert (!current_function_decl);
1732 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
1734 if (pass->gate == NULL || pass->gate ())
1736 if (pass->type == IPA_PASS && ipa_pass->read_summary)
1738 /* If a timevar is present, start it. */
1740 timevar_push (pass->tv_id);
1742 ipa_pass->read_summary ();
1746 timevar_pop (pass->tv_id);
1749 if (pass->sub && pass->sub->type != GIMPLE_PASS)
1750 ipa_read_summaries_1 (pass->sub);
1757 /* Read all the summaries for all_regular_ipa_passes and all_lto_gen_passes. */
1760 ipa_read_summaries (void)
1763 ipa_read_summaries_1 (all_regular_ipa_passes);
1764 ipa_read_summaries_1 (all_lto_gen_passes);
1767 /* Same as execute_pass_list but assume that subpasses of IPA passes
1768 are local passes. */
1770 execute_ipa_pass_list (struct opt_pass *pass)
1774 gcc_assert (!current_function_decl);
1776 gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS);
1777 if (execute_one_pass (pass) && pass->sub)
1779 if (pass->sub->type == GIMPLE_PASS)
1781 invoke_plugin_callbacks (PLUGIN_EARLY_GIMPLE_PASSES_START, NULL);
1782 do_per_function_toporder ((void (*)(void *))execute_pass_list,
1784 invoke_plugin_callbacks (PLUGIN_EARLY_GIMPLE_PASSES_END, NULL);
1786 else if (pass->sub->type == SIMPLE_IPA_PASS
1787 || pass->sub->type == IPA_PASS)
1788 execute_ipa_pass_list (pass->sub);
1792 gcc_assert (!current_function_decl);
1793 cgraph_process_new_functions ();
1799 /* Execute stmt fixup hooks of all passes in PASS for NODE and STMTS. */
1802 execute_ipa_stmt_fixups (struct opt_pass *pass,
1803 struct cgraph_node *node, gimple *stmts)
1807 /* Execute all of the IPA_PASSes in the list. */
1808 if (pass->type == IPA_PASS
1809 && (!pass->gate || pass->gate ()))
1811 struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *) pass;
1813 if (ipa_pass->stmt_fixup)
1815 pass_init_dump_file (pass);
1816 /* If a timevar is present, start it. */
1818 timevar_push (pass->tv_id);
1820 ipa_pass->stmt_fixup (node, stmts);
1824 timevar_pop (pass->tv_id);
1825 pass_fini_dump_file (pass);
1828 execute_ipa_stmt_fixups (pass->sub, node, stmts);
1834 /* Execute stmt fixup hooks of all IPA passes for NODE and STMTS. */
1837 execute_all_ipa_stmt_fixups (struct cgraph_node *node, gimple *stmts)
1839 execute_ipa_stmt_fixups (all_regular_ipa_passes, node, stmts);
1843 extern void debug_properties (unsigned int);
1844 extern void dump_properties (FILE *, unsigned int);
1847 dump_properties (FILE *dump, unsigned int props)
1849 fprintf (dump, "Properties:\n");
1850 if (props & PROP_gimple_any)
1851 fprintf (dump, "PROP_gimple_any\n");
1852 if (props & PROP_gimple_lcf)
1853 fprintf (dump, "PROP_gimple_lcf\n");
1854 if (props & PROP_gimple_leh)
1855 fprintf (dump, "PROP_gimple_leh\n");
1856 if (props & PROP_cfg)
1857 fprintf (dump, "PROP_cfg\n");
1858 if (props & PROP_referenced_vars)
1859 fprintf (dump, "PROP_referenced_vars\n");
1860 if (props & PROP_ssa)
1861 fprintf (dump, "PROP_ssa\n");
1862 if (props & PROP_no_crit_edges)
1863 fprintf (dump, "PROP_no_crit_edges\n");
1864 if (props & PROP_rtl)
1865 fprintf (dump, "PROP_rtl\n");
1866 if (props & PROP_gimple_lomp)
1867 fprintf (dump, "PROP_gimple_lomp\n");
1871 debug_properties (unsigned int props)
1873 dump_properties (stderr, props);
1876 /* Called by local passes to see if function is called by already processed nodes.
1877 Because we process nodes in topological order, this means that function is
1878 in recursive cycle or we introduced new direct calls. */
1880 function_called_by_processed_nodes_p (void)
1882 struct cgraph_edge *e;
1883 for (e = cgraph_node (current_function_decl)->callers; e; e = e->next_caller)
1885 if (e->caller->decl == current_function_decl)
1887 if (!e->caller->analyzed)
1889 if (TREE_ASM_WRITTEN (e->caller->decl))
1891 if (!e->caller->process && !e->caller->global.inlined_to)
1896 fprintf (dump_file, "Already processed call to:\n");
1897 dump_cgraph_node (dump_file, e->caller);
1902 #include "gt-passes.h"