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 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
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"
86 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
87 #include "dwarf2out.h"
90 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
94 #ifdef SDB_DEBUGGING_INFO
98 #ifdef XCOFF_DEBUGGING_INFO
99 #include "xcoffout.h" /* Needed for external data
100 declarations for e.g. AIX 4.x. */
103 /* Global variables used to communicate with passes. */
108 /* This is called from various places for FUNCTION_DECL, VAR_DECL,
111 This does nothing for local (non-static) variables, unless the
112 variable is a register variable with DECL_ASSEMBLER_NAME set. In
113 that case, or if the variable is not an automatic, it sets up the
114 RTL and outputs any assembler code (label definition, storage
115 allocation and initialization).
117 DECL is the declaration. TOP_LEVEL is nonzero
118 if this declaration is not within a function. */
121 rest_of_decl_compilation (tree decl,
125 /* We deferred calling assemble_alias so that we could collect
126 other attributes such as visibility. Emit the alias now. */
129 alias = lookup_attribute ("alias", DECL_ATTRIBUTES (decl));
132 alias = TREE_VALUE (TREE_VALUE (alias));
133 alias = get_identifier (TREE_STRING_POINTER (alias));
134 assemble_alias (decl, alias);
138 /* Can't defer this, because it needs to happen before any
139 later function definitions are processed. */
140 if (DECL_ASSEMBLER_NAME_SET_P (decl) && DECL_REGISTER (decl))
141 make_decl_rtl (decl);
143 /* Forward declarations for nested functions are not "external",
144 but we need to treat them as if they were. */
145 if (TREE_STATIC (decl) || DECL_EXTERNAL (decl)
146 || TREE_CODE (decl) == FUNCTION_DECL)
148 timevar_push (TV_VARCONST);
150 /* Don't output anything when a tentative file-scope definition
151 is seen. But at end of compilation, do output code for them.
153 We do output all variables when unit-at-a-time is active and rely on
154 callgraph code to defer them except for forward declarations
155 (see gcc.c-torture/compile/920624-1.c) */
157 || !DECL_DEFER_OUTPUT (decl)
158 || DECL_INITIAL (decl))
159 && !DECL_EXTERNAL (decl))
161 if (TREE_CODE (decl) != FUNCTION_DECL)
162 cgraph_varpool_finalize_decl (decl);
164 assemble_variable (decl, top_level, at_end, 0);
167 #ifdef ASM_FINISH_DECLARE_OBJECT
168 if (decl == last_assemble_variable_decl)
170 ASM_FINISH_DECLARE_OBJECT (asm_out_file, decl,
175 timevar_pop (TV_VARCONST);
177 else if (TREE_CODE (decl) == TYPE_DECL
178 /* Like in rest_of_type_compilation, avoid confusing the debug
179 information machinery when there are errors. */
180 && !(sorrycount || errorcount))
182 timevar_push (TV_SYMOUT);
183 debug_hooks->type_decl (decl, !top_level);
184 timevar_pop (TV_SYMOUT);
187 /* Let cgraph know about the existence of variables. */
188 if (TREE_CODE (decl) == VAR_DECL && !DECL_EXTERNAL (decl))
189 cgraph_varpool_node (decl);
192 /* Called after finishing a record, union or enumeral type. */
195 rest_of_type_compilation (tree type, int toplev)
197 /* Avoid confusing the debug information machinery when there are
199 if (errorcount != 0 || sorrycount != 0)
202 timevar_push (TV_SYMOUT);
203 debug_hooks->type_decl (TYPE_STUB_DECL (type), !toplev);
204 timevar_pop (TV_SYMOUT);
210 finish_optimization_passes (void)
212 enum tree_dump_index i;
213 struct dump_file_info *dfi;
216 timevar_push (TV_DUMP);
217 if (profile_arc_flag || flag_test_coverage || flag_branch_probabilities)
219 dump_file = dump_begin (pass_profile.static_pass_number, NULL);
222 dump_end (pass_profile.static_pass_number, dump_file);
227 dump_file = dump_begin (pass_combine.static_pass_number, NULL);
230 dump_combine_total_stats (dump_file);
231 dump_end (pass_combine.static_pass_number, dump_file);
235 /* Do whatever is necessary to finish printing the graphs. */
236 if (graph_dump_format != no_graph)
237 for (i = TDI_end; (dfi = get_dump_file_info (i)) != NULL; ++i)
238 if (dump_initialized_p (i)
239 && (dfi->flags & TDF_GRAPH) != 0
240 && (name = get_dump_file_name (i)) != NULL)
242 finish_graph_dump_file (name);
246 timevar_pop (TV_DUMP);
250 gate_rest_of_compilation (void)
252 /* Early return if there were errors. We can run afoul of our
253 consistency checks, and there's not really much point in fixing them. */
254 return !(rtl_dump_and_exit || flag_syntax_only || errorcount || sorrycount);
257 struct tree_opt_pass pass_rest_of_compilation =
260 gate_rest_of_compilation, /* gate */
264 0, /* static_pass_number */
265 TV_REST_OF_COMPILATION, /* tv_id */
266 PROP_rtl, /* properties_required */
267 0, /* properties_provided */
268 0, /* properties_destroyed */
269 0, /* todo_flags_start */
270 TODO_ggc_collect, /* todo_flags_finish */
275 gate_postreload (void)
277 return reload_completed;
280 struct tree_opt_pass pass_postreload =
283 gate_postreload, /* gate */
287 0, /* static_pass_number */
289 PROP_rtl, /* properties_required */
290 0, /* properties_provided */
291 0, /* properties_destroyed */
292 0, /* todo_flags_start */
293 TODO_ggc_collect, /* todo_flags_finish */
299 /* The root of the compilation pass tree, once constructed. */
300 struct tree_opt_pass *all_passes, *all_ipa_passes, *all_lowering_passes;
302 /* Iterate over the pass tree allocating dump file numbers. We want
303 to do this depth first, and independent of whether the pass is
307 register_one_dump_file (struct tree_opt_pass *pass, bool ipa, int properties)
309 char *dot_name, *flag_name, *glob_name;
314 /* See below in next_pass_1. */
316 if (pass->static_pass_number != -1)
317 sprintf (num, "%d", ((int) pass->static_pass_number < 0
318 ? 1 : pass->static_pass_number));
320 dot_name = concat (".", pass->name, num, NULL);
322 prefix = "ipa-", flags = TDF_IPA;
323 else if (properties & PROP_trees)
324 prefix = "tree-", flags = TDF_TREE;
326 prefix = "rtl-", flags = TDF_RTL;
328 flag_name = concat (prefix, pass->name, num, NULL);
329 glob_name = concat (prefix, pass->name, NULL);
330 pass->static_pass_number = dump_register (dot_name, flag_name, glob_name,
331 flags, pass->letter);
334 /* Recursive worker function for register_dump_files. */
337 register_dump_files_1 (struct tree_opt_pass *pass, bool ipa, int properties)
341 int new_properties = (properties | pass->properties_provided)
342 & ~pass->properties_destroyed;
345 register_one_dump_file (pass, ipa, new_properties);
348 new_properties = register_dump_files_1 (pass->sub, false,
351 /* If we have a gate, combine the properties that we could have with
352 and without the pass being examined. */
354 properties &= new_properties;
356 properties = new_properties;
365 /* Register the dump files for the pipeline starting at PASS. IPA is
366 true if the pass is inter-procedural, and PROPERTIES reflects the
367 properties that are guaranteed to be available at the beginning of
371 register_dump_files (struct tree_opt_pass *pass, bool ipa, int properties)
373 pass->properties_required |= properties;
374 pass->todo_flags_start |= TODO_set_props;
375 register_dump_files_1 (pass, ipa, properties);
378 /* Add a pass to the pass list. Duplicate the pass if it's already
381 static struct tree_opt_pass **
382 next_pass_1 (struct tree_opt_pass **list, struct tree_opt_pass *pass)
384 /* A nonzero static_pass_number indicates that the
385 pass is already in the list. */
386 if (pass->static_pass_number)
388 struct tree_opt_pass *new;
390 new = xmalloc (sizeof (*new));
391 memcpy (new, pass, sizeof (*new));
393 /* Indicate to register_dump_files that this pass has duplicates,
394 and so it should rename the dump file. The first instance will
395 be -1, and be number of duplicates = -static_pass_number - 1.
396 Subsequent instances will be > 0 and just the duplicate number. */
399 pass->static_pass_number -= 1;
400 new->static_pass_number = -pass->static_pass_number;
407 pass->static_pass_number = -1;
411 return &(*list)->next;
415 /* Construct the pass tree. The sequencing of passes is driven by
418 cgraph_finalize_compilation_unit ()
419 for each node N in the cgraph
420 cgraph_analyze_function (N)
421 cgraph_lower_function (N) -> all_lowering_passes
423 If we are optimizing, cgraph_optimize is then invoked:
426 ipa_passes () -> all_ipa_passes
427 cgraph_expand_all_functions ()
428 for each node N in the cgraph
429 cgraph_expand_function (N)
430 cgraph_lower_function (N) -> Now a NOP.
431 lang_hooks.callgraph.expand_function (DECL (N))
432 tree_rest_of_compilation (DECL (N)) -> all_passes
436 init_optimization_passes (void)
438 struct tree_opt_pass **p;
440 #define NEXT_PASS(PASS) (p = next_pass_1 (p, &PASS))
441 /* Interprocedural optimization passes. */
443 NEXT_PASS (pass_early_ipa_inline);
444 NEXT_PASS (pass_early_local_passes);
445 NEXT_PASS (pass_ipa_cp);
446 NEXT_PASS (pass_ipa_inline);
447 NEXT_PASS (pass_ipa_reference);
448 NEXT_PASS (pass_ipa_pure_const);
449 NEXT_PASS (pass_ipa_type_escape);
450 NEXT_PASS (pass_ipa_pta);
453 /* All passes needed to lower the function into shape optimizers can
455 p = &all_lowering_passes;
456 NEXT_PASS (pass_remove_useless_stmts);
457 NEXT_PASS (pass_mudflap_1);
458 NEXT_PASS (pass_lower_omp);
459 NEXT_PASS (pass_lower_cf);
460 NEXT_PASS (pass_lower_eh);
461 NEXT_PASS (pass_build_cfg);
462 NEXT_PASS (pass_lower_complex_O0);
463 NEXT_PASS (pass_lower_vector);
464 NEXT_PASS (pass_warn_function_return);
465 NEXT_PASS (pass_early_tree_profile);
468 p = &pass_early_local_passes.sub;
469 NEXT_PASS (pass_tree_profile);
470 NEXT_PASS (pass_cleanup_cfg);
471 NEXT_PASS (pass_rebuild_cgraph_edges);
475 NEXT_PASS (pass_fixup_cfg);
476 NEXT_PASS (pass_init_datastructures);
477 NEXT_PASS (pass_expand_omp);
478 NEXT_PASS (pass_all_optimizations);
479 NEXT_PASS (pass_warn_function_noreturn);
480 NEXT_PASS (pass_mudflap_2);
481 NEXT_PASS (pass_free_datastructures);
482 NEXT_PASS (pass_free_cfg_annotations);
483 NEXT_PASS (pass_expand);
484 NEXT_PASS (pass_rest_of_compilation);
485 NEXT_PASS (pass_clean_state);
488 p = &pass_all_optimizations.sub;
489 NEXT_PASS (pass_referenced_vars);
490 NEXT_PASS (pass_create_structure_vars);
491 NEXT_PASS (pass_build_ssa);
492 NEXT_PASS (pass_may_alias);
493 NEXT_PASS (pass_return_slot);
494 NEXT_PASS (pass_rename_ssa_copies);
495 NEXT_PASS (pass_early_warn_uninitialized);
497 /* Initial scalar cleanups. */
498 NEXT_PASS (pass_ccp);
499 NEXT_PASS (pass_fre);
500 NEXT_PASS (pass_dce);
501 NEXT_PASS (pass_forwprop);
502 NEXT_PASS (pass_copy_prop);
503 NEXT_PASS (pass_merge_phi);
504 NEXT_PASS (pass_vrp);
505 NEXT_PASS (pass_dce);
506 NEXT_PASS (pass_dominator);
508 /* The only copy propagation opportunities left after DOM
509 should be due to degenerate PHI nodes. So rather than
510 run the full copy propagator, just discover and copy
511 propagate away the degenerate PHI nodes. */
512 NEXT_PASS (pass_phi_only_copy_prop);
514 NEXT_PASS (pass_phiopt);
515 NEXT_PASS (pass_may_alias);
516 NEXT_PASS (pass_tail_recursion);
517 NEXT_PASS (pass_profile);
519 NEXT_PASS (pass_stdarg);
520 NEXT_PASS (pass_lower_complex);
521 NEXT_PASS (pass_sra);
522 /* FIXME: SRA may generate arbitrary gimple code, exposing new
523 aliased and call-clobbered variables. As mentioned below,
524 pass_may_alias should be a TODO item. */
525 NEXT_PASS (pass_may_alias);
526 NEXT_PASS (pass_rename_ssa_copies);
527 NEXT_PASS (pass_dominator);
529 /* The only copy propagation opportunities left after DOM
530 should be due to degenerate PHI nodes. So rather than
531 run the full copy propagator, just discover and copy
532 propagate away the degenerate PHI nodes. */
533 NEXT_PASS (pass_phi_only_copy_prop);
535 NEXT_PASS (pass_reassoc);
536 NEXT_PASS (pass_dce);
537 NEXT_PASS (pass_dse);
538 NEXT_PASS (pass_may_alias);
539 NEXT_PASS (pass_forwprop);
540 NEXT_PASS (pass_phiopt);
541 NEXT_PASS (pass_object_sizes);
542 NEXT_PASS (pass_store_ccp);
543 NEXT_PASS (pass_store_copy_prop);
544 NEXT_PASS (pass_fold_builtins);
545 /* FIXME: May alias should a TODO but for 4.0.0,
546 we add may_alias right after fold builtins
547 which can create arbitrary GIMPLE. */
548 NEXT_PASS (pass_may_alias);
549 NEXT_PASS (pass_split_crit_edges);
550 NEXT_PASS (pass_pre);
551 NEXT_PASS (pass_may_alias);
552 NEXT_PASS (pass_sink_code);
553 NEXT_PASS (pass_tree_loop);
554 NEXT_PASS (pass_cse_reciprocals);
555 NEXT_PASS (pass_reassoc);
556 NEXT_PASS (pass_vrp);
557 NEXT_PASS (pass_dominator);
559 /* The only copy propagation opportunities left after DOM
560 should be due to degenerate PHI nodes. So rather than
561 run the full copy propagator, just discover and copy
562 propagate away the degenerate PHI nodes. */
563 NEXT_PASS (pass_phi_only_copy_prop);
565 NEXT_PASS (pass_cd_dce);
567 /* FIXME: If DCE is not run before checking for uninitialized uses,
568 we may get false warnings (e.g., testsuite/gcc.dg/uninit-5.c).
569 However, this also causes us to misdiagnose cases that should be
570 real warnings (e.g., testsuite/gcc.dg/pr18501.c).
572 To fix the false positives in uninit-5.c, we would have to
573 account for the predicates protecting the set and the use of each
574 variable. Using a representation like Gated Single Assignment
576 NEXT_PASS (pass_late_warn_uninitialized);
577 NEXT_PASS (pass_dse);
578 NEXT_PASS (pass_forwprop);
579 NEXT_PASS (pass_phiopt);
580 NEXT_PASS (pass_tail_calls);
581 NEXT_PASS (pass_rename_ssa_copies);
582 NEXT_PASS (pass_uncprop);
583 NEXT_PASS (pass_del_ssa);
584 NEXT_PASS (pass_nrv);
585 NEXT_PASS (pass_mark_used_blocks);
586 NEXT_PASS (pass_cleanup_cfg_post_optimizing);
589 p = &pass_tree_loop.sub;
590 NEXT_PASS (pass_tree_loop_init);
591 NEXT_PASS (pass_copy_prop);
592 NEXT_PASS (pass_lim);
593 NEXT_PASS (pass_tree_unswitch);
594 NEXT_PASS (pass_scev_cprop);
595 NEXT_PASS (pass_empty_loop);
596 NEXT_PASS (pass_record_bounds);
597 NEXT_PASS (pass_linear_transform);
598 NEXT_PASS (pass_iv_canon);
599 NEXT_PASS (pass_if_conversion);
600 NEXT_PASS (pass_vectorize);
601 /* NEXT_PASS (pass_may_alias) cannot be done again because the
602 vectorizer creates alias relations that are not supported by
604 NEXT_PASS (pass_complete_unroll);
605 NEXT_PASS (pass_loop_prefetch);
606 NEXT_PASS (pass_iv_optimize);
607 NEXT_PASS (pass_tree_loop_done);
610 p = &pass_vectorize.sub;
611 NEXT_PASS (pass_lower_vector_ssa);
612 NEXT_PASS (pass_dce_loop);
616 NEXT_PASS (pass_rtl_loop_init);
617 NEXT_PASS (pass_rtl_move_loop_invariants);
618 NEXT_PASS (pass_rtl_unswitch);
619 NEXT_PASS (pass_rtl_unroll_and_peel_loops);
620 NEXT_PASS (pass_rtl_doloop);
621 NEXT_PASS (pass_rtl_loop_done);
624 p = &pass_rest_of_compilation.sub;
625 NEXT_PASS (pass_init_function);
626 NEXT_PASS (pass_jump);
627 NEXT_PASS (pass_insn_locators_initialize);
628 NEXT_PASS (pass_rtl_eh);
629 NEXT_PASS (pass_initial_value_sets);
630 NEXT_PASS (pass_unshare_all_rtl);
631 NEXT_PASS (pass_instantiate_virtual_regs);
632 NEXT_PASS (pass_jump2);
633 NEXT_PASS (pass_cse);
634 NEXT_PASS (pass_gcse);
635 NEXT_PASS (pass_jump_bypass);
636 NEXT_PASS (pass_rtl_ifcvt);
637 NEXT_PASS (pass_tracer);
638 /* Perform loop optimizations. It might be better to do them a bit
639 sooner, but we want the profile feedback to work more
641 NEXT_PASS (pass_loop2);
642 NEXT_PASS (pass_web);
643 NEXT_PASS (pass_cse2);
644 NEXT_PASS (pass_life);
645 NEXT_PASS (pass_combine);
646 NEXT_PASS (pass_if_after_combine);
647 NEXT_PASS (pass_partition_blocks);
648 NEXT_PASS (pass_regmove);
649 NEXT_PASS (pass_split_all_insns);
650 NEXT_PASS (pass_mode_switching);
651 NEXT_PASS (pass_recompute_reg_usage);
652 NEXT_PASS (pass_sms);
653 NEXT_PASS (pass_sched);
654 NEXT_PASS (pass_local_alloc);
655 NEXT_PASS (pass_global_alloc);
656 NEXT_PASS (pass_postreload);
659 p = &pass_postreload.sub;
660 NEXT_PASS (pass_postreload_cse);
661 NEXT_PASS (pass_gcse2);
662 NEXT_PASS (pass_flow2);
663 NEXT_PASS (pass_rtl_seqabstr);
664 NEXT_PASS (pass_stack_adjustments);
665 NEXT_PASS (pass_peephole2);
666 NEXT_PASS (pass_if_after_reload);
667 NEXT_PASS (pass_regrename);
668 NEXT_PASS (pass_reorder_blocks);
669 NEXT_PASS (pass_branch_target_load_optimize);
670 NEXT_PASS (pass_leaf_regs);
671 NEXT_PASS (pass_sched2);
672 NEXT_PASS (pass_split_before_regstack);
673 NEXT_PASS (pass_stack_regs);
674 NEXT_PASS (pass_compute_alignments);
675 NEXT_PASS (pass_duplicate_computed_gotos);
676 NEXT_PASS (pass_variable_tracking);
677 NEXT_PASS (pass_free_cfg);
678 NEXT_PASS (pass_machine_reorg);
679 NEXT_PASS (pass_purge_lineno_notes);
680 NEXT_PASS (pass_cleanup_barriers);
681 NEXT_PASS (pass_delay_slots);
682 NEXT_PASS (pass_split_for_shorten_branches);
683 NEXT_PASS (pass_convert_to_eh_region_ranges);
684 NEXT_PASS (pass_shorten_branches);
685 NEXT_PASS (pass_set_nothrow_function_flags);
686 NEXT_PASS (pass_final);
691 /* Register the passes with the tree dump code. */
692 register_dump_files (all_ipa_passes, true,
693 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
695 register_dump_files (all_lowering_passes, false, PROP_gimple_any);
696 register_dump_files (all_passes, false,
697 PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh
701 static unsigned int last_verified;
702 static unsigned int curr_properties;
705 execute_todo (unsigned int flags)
707 #if defined ENABLE_CHECKING
708 if (need_ssa_update_p ())
709 gcc_assert (flags & TODO_update_ssa_any);
712 if (curr_properties & PROP_ssa)
713 flags |= TODO_verify_ssa;
714 flags &= ~last_verified;
718 /* Always recalculate SMT usage before doing anything else. */
719 if (flags & TODO_update_smt_usage)
720 recalculate_used_alone ();
722 /* Always cleanup the CFG before trying to update SSA . */
723 if (flags & TODO_cleanup_cfg)
726 cleanup_tree_cfg_loop ();
730 /* When cleanup_tree_cfg merges consecutive blocks, it may
731 perform some simplistic propagation when removing single
732 valued PHI nodes. This propagation may, in turn, cause the
733 SSA form to become out-of-date (see PR 22037). So, even
734 if the parent pass had not scheduled an SSA update, we may
735 still need to do one. */
736 if (!(flags & TODO_update_ssa_any) && need_ssa_update_p ())
737 flags |= TODO_update_ssa;
740 if (flags & TODO_update_ssa_any)
742 unsigned update_flags = flags & TODO_update_ssa_any;
743 update_ssa (update_flags);
744 last_verified &= ~TODO_verify_ssa;
747 if (flags & TODO_remove_unused_locals)
748 remove_unused_locals ();
750 if ((flags & TODO_dump_func)
751 && dump_file && current_function_decl)
753 if (curr_properties & PROP_trees)
754 dump_function_to_file (current_function_decl,
755 dump_file, dump_flags);
758 if (dump_flags & TDF_SLIM)
759 print_rtl_slim_with_bb (dump_file, get_insns (), dump_flags);
760 else if ((curr_properties & PROP_cfg) && (dump_flags & TDF_BLOCKS))
761 print_rtl_with_bb (dump_file, get_insns ());
763 print_rtl (dump_file, get_insns ());
765 if (curr_properties & PROP_cfg
766 && graph_dump_format != no_graph
767 && (dump_flags & TDF_GRAPH))
768 print_rtl_graph_with_bb (dump_file_name, get_insns ());
771 /* Flush the file. If verification fails, we won't be able to
772 close the file before aborting. */
775 if ((flags & TODO_dump_cgraph)
776 && dump_file && !current_function_decl)
778 dump_cgraph (dump_file);
779 /* Flush the file. If verification fails, we won't be able to
780 close the file before aborting. */
784 if (flags & TODO_ggc_collect)
789 #if defined ENABLE_CHECKING
790 if (flags & TODO_verify_ssa)
792 if (flags & TODO_verify_flow)
794 if (flags & TODO_verify_stmts)
796 if (flags & TODO_verify_loops)
797 verify_loop_closed_ssa ();
800 last_verified = flags & TODO_verify_all;
804 execute_one_pass (struct tree_opt_pass *pass)
806 bool initializing_dump;
807 unsigned int todo_after = 0;
809 /* See if we're supposed to run this pass. */
810 if (pass->gate && !pass->gate ())
813 if (pass->todo_flags_start & TODO_set_props)
814 curr_properties = pass->properties_required;
816 /* Note that the folders should only create gimple expressions.
817 This is a hack until the new folder is ready. */
818 in_gimple_form = (curr_properties & PROP_trees) != 0;
820 /* Run pre-pass verification. */
821 execute_todo (pass->todo_flags_start);
823 gcc_assert ((curr_properties & pass->properties_required)
824 == pass->properties_required);
826 if (pass->properties_destroyed & PROP_smt_usage)
827 updating_used_alone = true;
829 /* If a dump file name is present, open it if enabled. */
830 if (pass->static_pass_number != -1)
832 initializing_dump = !dump_initialized_p (pass->static_pass_number);
833 dump_file_name = get_dump_file_name (pass->static_pass_number);
834 dump_file = dump_begin (pass->static_pass_number, &dump_flags);
835 if (dump_file && current_function_decl)
837 const char *dname, *aname;
838 dname = lang_hooks.decl_printable_name (current_function_decl, 2);
839 aname = (IDENTIFIER_POINTER
840 (DECL_ASSEMBLER_NAME (current_function_decl)));
841 fprintf (dump_file, "\n;; Function %s (%s)%s\n\n", dname, aname,
842 cfun->function_frequency == FUNCTION_FREQUENCY_HOT
844 : cfun->function_frequency == FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
845 ? " (unlikely executed)"
850 initializing_dump = false;
852 /* If a timevar is present, start it. */
854 timevar_push (pass->tv_id);
859 todo_after = pass->execute ();
865 timevar_pop (pass->tv_id);
867 curr_properties = (curr_properties | pass->properties_provided)
868 & ~pass->properties_destroyed;
870 if (initializing_dump
872 && graph_dump_format != no_graph
873 && (curr_properties & (PROP_cfg | PROP_rtl)) == (PROP_cfg | PROP_rtl))
875 get_dump_file_info (pass->static_pass_number)->flags |= TDF_GRAPH;
876 dump_flags |= TDF_GRAPH;
877 clean_graph_dump_file (dump_file_name);
880 /* Run post-pass cleanup and verification. */
881 execute_todo (todo_after | pass->todo_flags_finish);
883 /* Flush and close dump file. */
886 free ((char *) dump_file_name);
887 dump_file_name = NULL;
891 dump_end (pass->static_pass_number, dump_file);
895 if (pass->properties_destroyed & PROP_smt_usage)
896 updating_used_alone = false;
902 execute_pass_list (struct tree_opt_pass *pass)
906 if (execute_one_pass (pass) && pass->sub)
907 execute_pass_list (pass->sub);
913 /* Same as execute_pass_list but assume that subpasses of IPA passes
916 execute_ipa_pass_list (struct tree_opt_pass *pass)
920 if (execute_one_pass (pass) && pass->sub)
922 struct cgraph_node *node;
923 for (node = cgraph_nodes; node; node = node->next)
926 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
927 current_function_decl = node->decl;
928 execute_pass_list (pass->sub);
929 free_dominance_info (CDI_DOMINATORS);
930 free_dominance_info (CDI_POST_DOMINATORS);
931 current_function_decl = NULL;