1 /* Top level of GCC compilers (cc1, cc1plus, etc.)
2 Copyright (C) 1987-2020 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* This is the top level of cc1/c++.
21 It parses command args, opens files, invokes the various passes
22 in the proper order, and counts the time used by each.
23 Error messages and low-level interface to malloc also handled here. */
27 #include "coretypes.h"
40 #include "lto-streamer.h"
41 #include "fold-const.h"
47 #include "value-prof.h"
49 #include "tree-ssa-loop-manip.h"
50 #include "tree-into-ssa.h"
53 #include "tree-pass.h"
55 #include "ipa-utils.h"
56 #include "tree-pretty-print.h" /* for dump_function_header */
58 #include "pass_manager.h"
60 #include "tree-ssa-live.h" /* For remove_unused_locals. */
61 #include "tree-cfgcleanup.h"
62 #include "insn-addr.h" /* for INSN_ADDRESSES_ALLOC. */
63 #include "diagnostic-core.h" /* for fnotice */
64 #include "stringpool.h"
69 /* This is used for debugging. It allows the current pass to printed
70 from anywhere in compilation.
71 The variable current_pass is also used for statistics and plugins. */
72 opt_pass
*current_pass
;
74 /* Most passes are single-instance (within their context) and thus don't
75 need to implement cloning, but passes that support multiple instances
76 *must* provide their own implementation of the clone method.
78 Handle this by providing a default implemenation, but make it a fatal
84 internal_error ("pass %s does not support cloning", name
);
88 opt_pass::set_pass_param (unsigned int, bool)
90 internal_error ("pass %s needs a %<set_pass_param%> implementation "
91 "to handle the extra argument in %<NEXT_PASS%>", name
);
95 opt_pass::gate (function
*)
101 opt_pass::execute (function
*)
106 opt_pass::opt_pass (const pass_data
&data
, context
*ctxt
)
110 static_pass_number (0),
117 pass_manager::execute_early_local_passes ()
119 execute_pass_list (cfun
, pass_build_ssa_passes_1
->sub
);
120 execute_pass_list (cfun
, pass_local_optimization_passes_1
->sub
);
124 pass_manager::execute_pass_mode_switching ()
126 return pass_mode_switching_1
->execute (cfun
);
130 /* Call from anywhere to find out what pass this is. Useful for
131 printing out debugging information deep inside an service
134 print_current_pass (FILE *file
)
137 fprintf (file
, "current pass = %s (%d)\n",
138 current_pass
->name
, current_pass
->static_pass_number
);
140 fprintf (file
, "no current pass.\n");
144 /* Call from the debugger to get the current pass name. */
148 print_current_pass (stderr
);
153 /* Global variables used to communicate with passes. */
157 /* This is called from various places for FUNCTION_DECL, VAR_DECL,
160 This does nothing for local (non-static) variables, unless the
161 variable is a register variable with DECL_ASSEMBLER_NAME set. In
162 that case, or if the variable is not an automatic, it sets up the
163 RTL and outputs any assembler code (label definition, storage
164 allocation and initialization).
166 DECL is the declaration. TOP_LEVEL is nonzero
167 if this declaration is not within a function. */
170 rest_of_decl_compilation (tree decl
,
174 bool finalize
= true;
176 /* We deferred calling assemble_alias so that we could collect
177 other attributes such as visibility. Emit the alias now. */
181 alias
= lookup_attribute ("alias", DECL_ATTRIBUTES (decl
));
184 alias
= TREE_VALUE (TREE_VALUE (alias
));
185 alias
= get_identifier (TREE_STRING_POINTER (alias
));
186 /* A quirk of the initial implementation of aliases required that the
187 user add "extern" to all of them. Which is silly, but now
188 historical. Do note that the symbol is in fact locally defined. */
189 DECL_EXTERNAL (decl
) = 0;
190 TREE_STATIC (decl
) = 1;
191 assemble_alias (decl
, alias
);
196 /* Can't defer this, because it needs to happen before any
197 later function definitions are processed. */
198 if (HAS_DECL_ASSEMBLER_NAME_P (decl
)
199 && DECL_ASSEMBLER_NAME_SET_P (decl
)
200 && DECL_REGISTER (decl
))
201 make_decl_rtl (decl
);
203 /* Forward declarations for nested functions are not "external",
204 but we need to treat them as if they were. */
205 if (TREE_STATIC (decl
) || DECL_EXTERNAL (decl
)
206 || TREE_CODE (decl
) == FUNCTION_DECL
)
208 timevar_push (TV_VARCONST
);
210 /* Don't output anything when a tentative file-scope definition
211 is seen. But at end of compilation, do output code for them.
213 We do output all variables and rely on
214 callgraph code to defer them except for forward declarations
215 (see gcc.c-torture/compile/920624-1.c) */
217 || !DECL_DEFER_OUTPUT (decl
)
218 || DECL_INITIAL (decl
))
219 && (!VAR_P (decl
) || !DECL_HAS_VALUE_EXPR_P (decl
))
220 && !DECL_EXTERNAL (decl
))
222 /* When reading LTO unit, we also read varpool, so do not
224 if (in_lto_p
&& !at_end
)
226 else if (finalize
&& TREE_CODE (decl
) != FUNCTION_DECL
)
227 varpool_node::finalize_decl (decl
);
230 #ifdef ASM_FINISH_DECLARE_OBJECT
231 if (decl
== last_assemble_variable_decl
)
233 ASM_FINISH_DECLARE_OBJECT (asm_out_file
, decl
,
238 /* Now that we have activated any function-specific attributes
239 that might affect function decl, particularly align, relayout it. */
240 if (TREE_CODE (decl
) == FUNCTION_DECL
)
241 targetm
.target_option
.relayout_function (decl
);
243 timevar_pop (TV_VARCONST
);
245 else if (TREE_CODE (decl
) == TYPE_DECL
246 /* Like in rest_of_type_compilation, avoid confusing the debug
247 information machinery when there are errors. */
250 timevar_push (TV_SYMOUT
);
251 debug_hooks
->type_decl (decl
, !top_level
);
252 timevar_pop (TV_SYMOUT
);
255 /* Let cgraph know about the existence of variables. */
256 if (in_lto_p
&& !at_end
)
258 else if (VAR_P (decl
) && !DECL_EXTERNAL (decl
)
259 && TREE_STATIC (decl
))
260 varpool_node::get_create (decl
);
262 /* Generate early debug for global variables. Any local variables will
263 be handled by either handling reachable functions from
264 finalize_compilation_unit (and by consequence, locally scoped
265 symbols), or by rest_of_type_compilation below.
267 For Go's hijack of the debug_hooks to implement -fdump-go-spec, pick up
268 function prototypes. Go's debug_hooks will not forward them to the
271 && (TREE_CODE (decl
) != FUNCTION_DECL
272 /* This will pick up function prototypes with no bodies,
273 which are not visible in finalize_compilation_unit()
274 while iterating with FOR_EACH_*_FUNCTION through the
276 || (flag_dump_go_spec
!= NULL
277 && !DECL_SAVED_TREE (decl
)
278 && DECL_STRUCT_FUNCTION (decl
) == NULL
))
280 /* We need to check both decl_function_context and
281 current_function_decl here to make sure local extern
282 declarations end up with the correct context.
284 For local extern declarations, decl_function_context is
285 empty, but current_function_decl is set to the function where
286 the extern was declared . Without the check for
287 !current_function_decl below, the local extern ends up
288 incorrectly with a top-level context.
300 extern int i; // Local extern declaration.
307 && !decl_function_context (decl
)
308 && !current_function_decl
309 && DECL_SOURCE_LOCATION (decl
) != BUILTINS_LOCATION
310 && (!decl_type_context (decl
)
311 /* If we created a varpool node for the decl make sure to
312 call early_global_decl. Otherwise we miss changes
313 introduced by member definitions like
314 struct A { static int staticdatamember; };
315 int A::staticdatamember;
316 and thus have incomplete early debug and late debug
317 called from varpool node removal fails to handle it
321 && TREE_STATIC (decl
) && !DECL_EXTERNAL (decl
)))
322 /* Avoid confusing the debug information machinery when there are
325 (*debug_hooks
->early_global_decl
) (decl
);
328 /* Called after finishing a record, union or enumeral type. */
331 rest_of_type_compilation (tree type
, int toplev
)
333 /* Avoid confusing the debug information machinery when there are
338 timevar_push (TV_SYMOUT
);
339 debug_hooks
->type_decl (TYPE_STUB_DECL (type
), !toplev
);
340 timevar_pop (TV_SYMOUT
);
347 finish_optimization_passes (void)
350 struct dump_file_info
*dfi
;
352 gcc::dump_manager
*dumps
= m_ctxt
->get_dumps ();
354 timevar_push (TV_DUMP
);
355 if (profile_arc_flag
|| flag_test_coverage
|| flag_branch_probabilities
)
357 dumps
->dump_start (pass_profile_1
->static_pass_number
, NULL
);
359 dumps
->dump_finish (pass_profile_1
->static_pass_number
);
364 dumps
->dump_start (pass_combine_1
->static_pass_number
, NULL
);
365 print_combine_total_stats ();
366 dumps
->dump_finish (pass_combine_1
->static_pass_number
);
369 /* Do whatever is necessary to finish printing the graphs. */
370 for (i
= TDI_end
; (dfi
= dumps
->get_dump_file_info (i
)) != NULL
; ++i
)
371 if (dfi
->graph_dump_initialized
)
373 name
= dumps
->get_dump_file_name (dfi
);
374 finish_graph_dump_file (name
);
378 timevar_pop (TV_DUMP
);
382 execute_build_ssa_passes (void)
384 /* Once this pass (and its sub-passes) are complete, all functions
385 will be in SSA form. Technically this state change is happening
386 a tad early, since the sub-passes have not yet run, but since
387 none of the sub-passes are IPA passes and do not create new
388 functions, this is ok. We're setting this value for the benefit
389 of IPA passes that follow. */
390 if (symtab
->state
< IPA_SSA
)
391 symtab
->state
= IPA_SSA
;
397 const pass_data pass_data_build_ssa_passes
=
399 SIMPLE_IPA_PASS
, /* type */
400 "build_ssa_passes", /* name */
401 OPTGROUP_NONE
, /* optinfo_flags */
402 TV_EARLY_LOCAL
, /* tv_id */
403 0, /* properties_required */
404 0, /* properties_provided */
405 0, /* properties_destroyed */
406 0, /* todo_flags_start */
407 /* todo_flags_finish is executed before subpases. For this reason
408 it makes no sense to remove unreachable functions here. */
409 0, /* todo_flags_finish */
412 class pass_build_ssa_passes
: public simple_ipa_opt_pass
415 pass_build_ssa_passes (gcc::context
*ctxt
)
416 : simple_ipa_opt_pass (pass_data_build_ssa_passes
, ctxt
)
419 /* opt_pass methods: */
420 virtual bool gate (function
*)
422 /* Don't bother doing anything if the program has errors. */
423 return (!seen_error () && !in_lto_p
);
426 virtual unsigned int execute (function
*)
428 return execute_build_ssa_passes ();
431 }; // class pass_build_ssa_passes
433 const pass_data pass_data_local_optimization_passes
=
435 SIMPLE_IPA_PASS
, /* type */
436 "opt_local_passes", /* name */
437 OPTGROUP_NONE
, /* optinfo_flags */
439 0, /* properties_required */
440 0, /* properties_provided */
441 0, /* properties_destroyed */
442 0, /* todo_flags_start */
443 0, /* todo_flags_finish */
446 class pass_local_optimization_passes
: public simple_ipa_opt_pass
449 pass_local_optimization_passes (gcc::context
*ctxt
)
450 : simple_ipa_opt_pass (pass_data_local_optimization_passes
, ctxt
)
453 /* opt_pass methods: */
454 virtual bool gate (function
*)
456 /* Don't bother doing anything if the program has errors. */
457 return (!seen_error () && !in_lto_p
);
460 }; // class pass_local_optimization_passes
462 const pass_data pass_data_ipa_remove_symbols
=
464 SIMPLE_IPA_PASS
, /* type */
465 "remove_symbols", /* name */
466 OPTGROUP_NONE
, /* optinfo_flags */
468 0, /* properties_required */
469 0, /* properties_provided */
470 0, /* properties_destroyed */
471 0, /* todo_flags_start */
472 TODO_remove_functions
| TODO_dump_symtab
, /* todo_flags_finish */
475 class pass_ipa_remove_symbols
: public simple_ipa_opt_pass
478 pass_ipa_remove_symbols (gcc::context
*ctxt
)
479 : simple_ipa_opt_pass (pass_data_ipa_remove_symbols
, ctxt
)
482 /* opt_pass methods: */
483 virtual bool gate (function
*)
485 /* Don't bother doing anything if the program has errors. */
486 return (!seen_error () && !in_lto_p
);
489 }; // class pass_local_optimization_passes
493 simple_ipa_opt_pass
*
494 make_pass_build_ssa_passes (gcc::context
*ctxt
)
496 return new pass_build_ssa_passes (ctxt
);
499 simple_ipa_opt_pass
*
500 make_pass_local_optimization_passes (gcc::context
*ctxt
)
502 return new pass_local_optimization_passes (ctxt
);
505 simple_ipa_opt_pass
*
506 make_pass_ipa_remove_symbols (gcc::context
*ctxt
)
508 return new pass_ipa_remove_symbols (ctxt
);
513 const pass_data pass_data_all_early_optimizations
=
515 GIMPLE_PASS
, /* type */
516 "early_optimizations", /* name */
517 OPTGROUP_NONE
, /* optinfo_flags */
519 0, /* properties_required */
520 0, /* properties_provided */
521 0, /* properties_destroyed */
522 0, /* todo_flags_start */
523 0, /* todo_flags_finish */
526 class pass_all_early_optimizations
: public gimple_opt_pass
529 pass_all_early_optimizations (gcc::context
*ctxt
)
530 : gimple_opt_pass (pass_data_all_early_optimizations
, ctxt
)
533 /* opt_pass methods: */
534 virtual bool gate (function
*)
536 return (optimize
>= 1
537 /* Don't bother doing anything if the program has errors. */
541 }; // class pass_all_early_optimizations
545 static gimple_opt_pass
*
546 make_pass_all_early_optimizations (gcc::context
*ctxt
)
548 return new pass_all_early_optimizations (ctxt
);
553 const pass_data pass_data_all_optimizations
=
555 GIMPLE_PASS
, /* type */
556 "*all_optimizations", /* name */
557 OPTGROUP_NONE
, /* optinfo_flags */
558 TV_OPTIMIZE
, /* tv_id */
559 0, /* properties_required */
560 0, /* properties_provided */
561 0, /* properties_destroyed */
562 0, /* todo_flags_start */
563 0, /* todo_flags_finish */
566 class pass_all_optimizations
: public gimple_opt_pass
569 pass_all_optimizations (gcc::context
*ctxt
)
570 : gimple_opt_pass (pass_data_all_optimizations
, ctxt
)
573 /* opt_pass methods: */
574 virtual bool gate (function
*) { return optimize
>= 1 && !optimize_debug
; }
576 }; // class pass_all_optimizations
580 static gimple_opt_pass
*
581 make_pass_all_optimizations (gcc::context
*ctxt
)
583 return new pass_all_optimizations (ctxt
);
588 const pass_data pass_data_all_optimizations_g
=
590 GIMPLE_PASS
, /* type */
591 "*all_optimizations_g", /* name */
592 OPTGROUP_NONE
, /* optinfo_flags */
593 TV_OPTIMIZE
, /* tv_id */
594 0, /* properties_required */
595 0, /* properties_provided */
596 0, /* properties_destroyed */
597 0, /* todo_flags_start */
598 0, /* todo_flags_finish */
601 class pass_all_optimizations_g
: public gimple_opt_pass
604 pass_all_optimizations_g (gcc::context
*ctxt
)
605 : gimple_opt_pass (pass_data_all_optimizations_g
, ctxt
)
608 /* opt_pass methods: */
609 virtual bool gate (function
*) { return optimize
>= 1 && optimize_debug
; }
611 }; // class pass_all_optimizations_g
615 static gimple_opt_pass
*
616 make_pass_all_optimizations_g (gcc::context
*ctxt
)
618 return new pass_all_optimizations_g (ctxt
);
623 const pass_data pass_data_rest_of_compilation
=
626 "*rest_of_compilation", /* name */
627 OPTGROUP_NONE
, /* optinfo_flags */
628 TV_REST_OF_COMPILATION
, /* tv_id */
629 PROP_rtl
, /* properties_required */
630 0, /* properties_provided */
631 0, /* properties_destroyed */
632 0, /* todo_flags_start */
633 0, /* todo_flags_finish */
636 class pass_rest_of_compilation
: public rtl_opt_pass
639 pass_rest_of_compilation (gcc::context
*ctxt
)
640 : rtl_opt_pass (pass_data_rest_of_compilation
, ctxt
)
643 /* opt_pass methods: */
644 virtual bool gate (function
*)
646 /* Early return if there were errors. We can run afoul of our
647 consistency checks, and there's not really much point in fixing them. */
648 return !(rtl_dump_and_exit
|| flag_syntax_only
|| seen_error ());
651 }; // class pass_rest_of_compilation
655 static rtl_opt_pass
*
656 make_pass_rest_of_compilation (gcc::context
*ctxt
)
658 return new pass_rest_of_compilation (ctxt
);
663 const pass_data pass_data_postreload
=
666 "*all-postreload", /* name */
667 OPTGROUP_NONE
, /* optinfo_flags */
668 TV_POSTRELOAD
, /* tv_id */
669 PROP_rtl
, /* properties_required */
670 0, /* properties_provided */
671 0, /* properties_destroyed */
672 0, /* todo_flags_start */
673 0, /* todo_flags_finish */
676 class pass_postreload
: public rtl_opt_pass
679 pass_postreload (gcc::context
*ctxt
)
680 : rtl_opt_pass (pass_data_postreload
, ctxt
)
683 /* opt_pass methods: */
684 virtual bool gate (function
*) { return reload_completed
; }
686 }; // class pass_postreload
690 static rtl_opt_pass
*
691 make_pass_postreload (gcc::context
*ctxt
)
693 return new pass_postreload (ctxt
);
698 const pass_data pass_data_late_compilation
=
701 "*all-late_compilation", /* name */
702 OPTGROUP_NONE
, /* optinfo_flags */
703 TV_LATE_COMPILATION
, /* tv_id */
704 PROP_rtl
, /* properties_required */
705 0, /* properties_provided */
706 0, /* properties_destroyed */
707 0, /* todo_flags_start */
708 0, /* todo_flags_finish */
711 class pass_late_compilation
: public rtl_opt_pass
714 pass_late_compilation (gcc::context
*ctxt
)
715 : rtl_opt_pass (pass_data_late_compilation
, ctxt
)
718 /* opt_pass methods: */
719 virtual bool gate (function
*)
721 return reload_completed
|| targetm
.no_register_allocation
;
724 }; // class pass_late_compilation
728 static rtl_opt_pass
*
729 make_pass_late_compilation (gcc::context
*ctxt
)
731 return new pass_late_compilation (ctxt
);
734 /* Pre-SLP scalar cleanup, it has several cleanup passes like FRE, DSE. */
738 const pass_data pass_data_pre_slp_scalar_cleanup
=
740 GIMPLE_PASS
, /* type */
741 "*pre_slp_scalar_cleanup", /* name */
742 OPTGROUP_LOOP
, /* optinfo_flags */
743 TV_SCALAR_CLEANUP
, /* tv_id */
744 ( PROP_cfg
| PROP_ssa
), /* properties_required */
745 0, /* properties_provided */
746 0, /* properties_destroyed */
747 0, /* todo_flags_start */
748 0, /* todo_flags_finish */
751 class pass_pre_slp_scalar_cleanup
: public gimple_opt_pass
754 pass_pre_slp_scalar_cleanup (gcc::context
*ctxt
)
755 : gimple_opt_pass (pass_data_pre_slp_scalar_cleanup
, ctxt
)
762 return flag_tree_slp_vectorize
763 && (fun
->pending_TODOs
& PENDING_TODO_force_next_scalar_cleanup
);
767 execute (function
*fun
)
769 fun
->pending_TODOs
&= ~PENDING_TODO_force_next_scalar_cleanup
;
773 }; // class pass_pre_slp_scalar_cleanup
778 make_pass_pre_slp_scalar_cleanup (gcc::context
*ctxt
)
780 return new pass_pre_slp_scalar_cleanup (ctxt
);
783 /* Set the static pass number of pass PASS to ID and record that
784 in the mapping from static pass number to pass. */
788 set_pass_for_id (int id
, opt_pass
*pass
)
790 pass
->static_pass_number
= id
;
791 if (passes_by_id_size
<= id
)
793 passes_by_id
= XRESIZEVEC (opt_pass
*, passes_by_id
, id
+ 1);
794 memset (passes_by_id
+ passes_by_id_size
, 0,
795 (id
+ 1 - passes_by_id_size
) * sizeof (void *));
796 passes_by_id_size
= id
+ 1;
798 passes_by_id
[id
] = pass
;
801 /* Return the pass with the static pass number ID. */
804 pass_manager::get_pass_for_id (int id
) const
806 if (id
>= passes_by_id_size
)
808 return passes_by_id
[id
];
811 /* Iterate over the pass tree allocating dump file numbers. We want
812 to do this depth first, and independent of whether the pass is
816 register_one_dump_file (opt_pass
*pass
)
818 g
->get_passes ()->register_one_dump_file (pass
);
822 pass_manager::register_one_dump_file (opt_pass
*pass
)
824 char *dot_name
, *flag_name
, *glob_name
;
825 const char *name
, *full_name
, *prefix
;
827 /* Buffer big enough to format a 32-bit UINT_MAX into. */
831 optgroup_flags_t optgroup_flags
= OPTGROUP_NONE
;
832 gcc::dump_manager
*dumps
= m_ctxt
->get_dumps ();
834 /* See below in next_pass_1. */
836 if (pass
->static_pass_number
!= -1)
837 sprintf (num
, "%u", ((int) pass
->static_pass_number
< 0
838 ? 1 : pass
->static_pass_number
));
840 /* The name is both used to identify the pass for the purposes of plugins,
841 and to specify dump file name and option.
842 The latter two might want something short which is not quite unique; for
843 that reason, we may have a disambiguating prefix, followed by a space
844 to mark the start of the following dump file name / option string. */
845 name
= strchr (pass
->name
, ' ');
846 name
= name
? name
+ 1 : pass
->name
;
847 dot_name
= concat (".", name
, num
, NULL
);
848 if (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
)
852 optgroup_flags
|= OPTGROUP_IPA
;
854 else if (pass
->type
== GIMPLE_PASS
)
865 flag_name
= concat (prefix
, name
, num
, NULL
);
866 glob_name
= concat (prefix
, name
, NULL
);
867 optgroup_flags
|= pass
->optinfo_flags
;
868 /* For any passes that do not have an optgroup set, and which are not
869 IPA passes setup above, set the optgroup to OPTGROUP_OTHER so that
870 any dump messages are emitted properly under -fopt-info(-optall). */
871 if (optgroup_flags
== OPTGROUP_NONE
)
872 optgroup_flags
= OPTGROUP_OTHER
;
873 id
= dumps
->dump_register (dot_name
, flag_name
, glob_name
, dkind
,
876 set_pass_for_id (id
, pass
);
877 full_name
= concat (prefix
, pass
->name
, num
, NULL
);
878 register_pass_name (pass
, full_name
);
879 free (CONST_CAST (char *, full_name
));
882 /* Register the dump files for the pass_manager starting at PASS. */
885 pass_manager::register_dump_files (opt_pass
*pass
)
889 if (pass
->name
&& pass
->name
[0] != '*')
890 register_one_dump_file (pass
);
893 register_dump_files (pass
->sub
);
900 /* Register PASS with NAME. */
903 pass_manager::register_pass_name (opt_pass
*pass
, const char *name
)
905 if (!m_name_to_pass_map
)
906 m_name_to_pass_map
= new hash_map
<nofree_string_hash
, opt_pass
*> (256);
908 if (m_name_to_pass_map
->get (name
))
909 return; /* Ignore plugin passes. */
911 const char *unique_name
= xstrdup (name
);
912 m_name_to_pass_map
->put (unique_name
, pass
);
915 /* Map from pass id to canonicalized pass name. */
917 typedef const char *char_ptr
;
918 static vec
<char_ptr
> pass_tab
;
920 /* Callback function for traversing NAME_TO_PASS_MAP. */
923 passes_pass_traverse (const char *const &name
, opt_pass
*const &pass
, void *)
925 gcc_assert (pass
->static_pass_number
> 0);
926 gcc_assert (pass_tab
.exists ());
928 pass_tab
[pass
->static_pass_number
] = name
;
933 /* The function traverses NAME_TO_PASS_MAP and creates a pass info
934 table for dumping purpose. */
937 pass_manager::create_pass_tab (void) const
939 if (!flag_dump_passes
)
942 pass_tab
.safe_grow_cleared (passes_by_id_size
+ 1, true);
943 m_name_to_pass_map
->traverse
<void *, passes_pass_traverse
> (NULL
);
946 static bool override_gate_status (opt_pass
*, tree
, bool);
948 /* Dump the instantiated name for PASS. IS_ON indicates if PASS
949 is turned on or not. */
952 dump_one_pass (opt_pass
*pass
, int pass_indent
)
954 int indent
= 3 * pass_indent
;
956 bool is_on
, is_really_on
;
958 is_on
= pass
->gate (cfun
);
959 is_really_on
= override_gate_status (pass
, current_function_decl
, is_on
);
961 if (pass
->static_pass_number
<= 0)
964 pn
= pass_tab
[pass
->static_pass_number
];
966 fprintf (stderr
, "%*s%-40s%*s:%s%s\n", indent
, " ", pn
,
967 (15 - indent
< 0 ? 0 : 15 - indent
), " ",
968 is_on
? " ON" : " OFF",
969 ((!is_on
) == (!is_really_on
) ? ""
970 : (is_really_on
? " (FORCED_ON)" : " (FORCED_OFF)")));
973 /* Dump pass list PASS with indentation INDENT. */
976 dump_pass_list (opt_pass
*pass
, int indent
)
980 dump_one_pass (pass
, indent
);
982 dump_pass_list (pass
->sub
, indent
+ 1);
988 /* Dump all optimization passes. */
993 g
->get_passes ()->dump_passes ();
997 pass_manager::dump_passes () const
999 push_dummy_function (true);
1000 cgraph_node
*node
= cgraph_node::get_create (current_function_decl
);
1004 dump_pass_list (all_lowering_passes
, 1);
1005 dump_pass_list (all_small_ipa_passes
, 1);
1006 dump_pass_list (all_regular_ipa_passes
, 1);
1007 dump_pass_list (all_late_ipa_passes
, 1);
1008 dump_pass_list (all_passes
, 1);
1011 pop_dummy_function ();
1014 /* Returns the pass with NAME. */
1017 pass_manager::get_pass_by_name (const char *name
)
1019 opt_pass
**p
= m_name_to_pass_map
->get (name
);
1027 /* Range [start, last]. */
1033 const char *assem_name
;
1034 struct uid_range
*next
;
1037 typedef struct uid_range
*uid_range_p
;
1040 static vec
<uid_range_p
> enabled_pass_uid_range_tab
;
1041 static vec
<uid_range_p
> disabled_pass_uid_range_tab
;
1044 /* Parse option string for -fdisable- and -fenable-
1045 The syntax of the options:
1047 -fenable-<pass_name>
1048 -fdisable-<pass_name>
1050 -fenable-<pass_name>=s1:e1,s2:e2,...
1051 -fdisable-<pass_name>=s1:e1,s2:e2,...
1055 enable_disable_pass (const char *arg
, bool is_enable
)
1058 char *range_str
, *phase_name
;
1059 char *argstr
= xstrdup (arg
);
1060 vec
<uid_range_p
> *tab
= 0;
1062 range_str
= strchr (argstr
,'=');
1069 phase_name
= argstr
;
1073 error ("unrecognized option %<-fenable%>");
1075 error ("unrecognized option %<-fdisable%>");
1079 pass
= g
->get_passes ()->get_pass_by_name (phase_name
);
1080 if (!pass
|| pass
->static_pass_number
== -1)
1083 error ("unknown pass %s specified in %<-fenable%>", phase_name
);
1085 error ("unknown pass %s specified in %<-fdisable%>", phase_name
);
1091 tab
= &enabled_pass_uid_range_tab
;
1093 tab
= &disabled_pass_uid_range_tab
;
1095 if ((unsigned) pass
->static_pass_number
>= tab
->length ())
1096 tab
->safe_grow_cleared (pass
->static_pass_number
+ 1, true);
1101 uid_range_p new_range
= XCNEW (struct uid_range
);
1103 new_range
->start
= 0;
1104 new_range
->last
= (unsigned)-1;
1106 slot
= (*tab
)[pass
->static_pass_number
];
1107 new_range
->next
= slot
;
1108 (*tab
)[pass
->static_pass_number
] = new_range
;
1110 inform (UNKNOWN_LOCATION
, "enable pass %s for functions in the range "
1111 "of [%u, %u]", phase_name
, new_range
->start
, new_range
->last
);
1113 inform (UNKNOWN_LOCATION
, "disable pass %s for functions in the range "
1114 "of [%u, %u]", phase_name
, new_range
->start
, new_range
->last
);
1118 char *next_range
= NULL
;
1119 char *one_range
= range_str
;
1120 char *end_val
= NULL
;
1125 uid_range_p new_range
;
1126 char *invalid
= NULL
;
1128 char *func_name
= NULL
;
1130 next_range
= strchr (one_range
, ',');
1137 end_val
= strchr (one_range
, ':');
1143 start
= strtol (one_range
, &invalid
, 10);
1144 if (*invalid
|| start
< 0)
1146 if (end_val
|| (one_range
[0] >= '0'
1147 && one_range
[0] <= '9'))
1149 error ("Invalid range %s in option %s",
1151 is_enable
? "-fenable" : "-fdisable");
1155 func_name
= one_range
;
1159 new_range
= XCNEW (struct uid_range
);
1162 new_range
->start
= (unsigned) start
;
1163 new_range
->last
= (unsigned) start
;
1167 new_range
->start
= (unsigned) -1;
1168 new_range
->last
= (unsigned) -1;
1169 new_range
->assem_name
= xstrdup (func_name
);
1174 long last
= strtol (end_val
, &invalid
, 10);
1175 if (*invalid
|| last
< start
)
1177 error ("Invalid range %s in option %s",
1179 is_enable
? "-fenable" : "-fdisable");
1183 new_range
= XCNEW (struct uid_range
);
1184 new_range
->start
= (unsigned) start
;
1185 new_range
->last
= (unsigned) last
;
1188 slot
= (*tab
)[pass
->static_pass_number
];
1189 new_range
->next
= slot
;
1190 (*tab
)[pass
->static_pass_number
] = new_range
;
1193 if (new_range
->assem_name
)
1194 inform (UNKNOWN_LOCATION
,
1195 "enable pass %s for function %s",
1196 phase_name
, new_range
->assem_name
);
1198 inform (UNKNOWN_LOCATION
,
1199 "enable pass %s for functions in the range of [%u, %u]",
1200 phase_name
, new_range
->start
, new_range
->last
);
1204 if (new_range
->assem_name
)
1205 inform (UNKNOWN_LOCATION
,
1206 "disable pass %s for function %s",
1207 phase_name
, new_range
->assem_name
);
1209 inform (UNKNOWN_LOCATION
,
1210 "disable pass %s for functions in the range of [%u, %u]",
1211 phase_name
, new_range
->start
, new_range
->last
);
1214 one_range
= next_range
;
1215 } while (next_range
);
1221 /* Enable pass specified by ARG. */
1224 enable_pass (const char *arg
)
1226 enable_disable_pass (arg
, true);
1229 /* Disable pass specified by ARG. */
1232 disable_pass (const char *arg
)
1234 enable_disable_pass (arg
, false);
1237 /* Returns true if PASS is explicitly enabled/disabled for FUNC. */
1240 is_pass_explicitly_enabled_or_disabled (opt_pass
*pass
,
1242 vec
<uid_range_p
> tab
)
1244 uid_range_p slot
, range
;
1246 const char *aname
= NULL
;
1249 || (unsigned) pass
->static_pass_number
>= tab
.length ()
1250 || pass
->static_pass_number
== -1)
1253 slot
= tab
[pass
->static_pass_number
];
1257 cgraph_uid
= func
? cgraph_node::get (func
)->get_uid () : 0;
1258 if (func
&& DECL_ASSEMBLER_NAME_SET_P (func
))
1259 aname
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (func
));
1264 if ((unsigned) cgraph_uid
>= range
->start
1265 && (unsigned) cgraph_uid
<= range
->last
)
1267 if (range
->assem_name
&& aname
1268 && !strcmp (range
->assem_name
, aname
))
1270 range
= range
->next
;
1277 /* Update static_pass_number for passes (and the flag
1278 TODO_mark_first_instance).
1280 Passes are constructed with static_pass_number preinitialized to 0
1282 This field is used in two different ways: initially as instance numbers
1283 of their kind, and then as ids within the entire pass manager.
1285 Within pass_manager::pass_manager:
1287 * In add_pass_instance(), as called by next_pass_1 in
1288 NEXT_PASS in init_optimization_passes
1290 * When the initial instance of a pass within a pass manager is seen,
1291 it is flagged, and its static_pass_number is set to -1
1293 * On subsequent times that it is seen, the static pass number
1294 is decremented each time, so that if there are e.g. 4 dups,
1295 they have static_pass_number -4, 2, 3, 4 respectively (note
1296 how the initial one is negative and gives the count); these
1297 can be thought of as instance numbers of the specific pass
1299 * Within the register_dump_files () traversal, set_pass_for_id()
1300 is called on each pass, using these instance numbers to create
1301 dumpfile switches, and then overwriting them with a pass id,
1302 which are global to the whole pass manager (based on
1303 (TDI_end + current value of extra_dump_files_in_use) ) */
1306 add_pass_instance (opt_pass
*new_pass
, bool track_duplicates
,
1307 opt_pass
*initial_pass
)
1309 /* Are we dealing with the first pass of its kind, or a clone? */
1310 if (new_pass
!= initial_pass
)
1312 /* We're dealing with a clone. */
1313 new_pass
->todo_flags_start
&= ~TODO_mark_first_instance
;
1315 /* Indicate to register_dump_files that this pass has duplicates,
1316 and so it should rename the dump file. The first instance will
1317 be -1, and be number of duplicates = -static_pass_number - 1.
1318 Subsequent instances will be > 0 and just the duplicate number. */
1319 if ((new_pass
->name
&& new_pass
->name
[0] != '*') || track_duplicates
)
1321 initial_pass
->static_pass_number
-= 1;
1322 new_pass
->static_pass_number
= -initial_pass
->static_pass_number
;
1327 /* We're dealing with the first pass of its kind. */
1328 new_pass
->todo_flags_start
|= TODO_mark_first_instance
;
1329 new_pass
->static_pass_number
= -1;
1331 invoke_plugin_callbacks (PLUGIN_NEW_PASS
, new_pass
);
1335 /* Add a pass to the pass list. Duplicate the pass if it's already
1339 next_pass_1 (opt_pass
**list
, opt_pass
*pass
, opt_pass
*initial_pass
)
1341 /* Every pass should have a name so that plugins can refer to them. */
1342 gcc_assert (pass
->name
!= NULL
);
1344 add_pass_instance (pass
, false, initial_pass
);
1347 return &(*list
)->next
;
1350 /* List node for an inserted pass instance. We need to keep track of all
1351 the newly-added pass instances (with 'added_pass_nodes' defined below)
1352 so that we can register their dump files after pass-positioning is finished.
1353 Registering dumping files needs to be post-processed or the
1354 static_pass_number of the opt_pass object would be modified and mess up
1355 the dump file names of future pass instances to be added. */
1357 struct pass_list_node
1360 struct pass_list_node
*next
;
1363 static struct pass_list_node
*added_pass_nodes
= NULL
;
1364 static struct pass_list_node
*prev_added_pass_node
;
1366 /* Insert the pass at the proper position. Return true if the pass
1367 is successfully added.
1369 NEW_PASS_INFO - new pass to be inserted
1370 PASS_LIST - root of the pass list to insert the new pass to */
1373 position_pass (struct register_pass_info
*new_pass_info
, opt_pass
**pass_list
)
1375 opt_pass
*pass
= *pass_list
, *prev_pass
= NULL
;
1376 bool success
= false;
1378 for ( ; pass
; prev_pass
= pass
, pass
= pass
->next
)
1380 /* Check if the current pass is of the same type as the new pass and
1381 matches the name and the instance number of the reference pass. */
1382 if (pass
->type
== new_pass_info
->pass
->type
1384 && !strcmp (pass
->name
, new_pass_info
->reference_pass_name
)
1385 && ((new_pass_info
->ref_pass_instance_number
== 0)
1386 || (new_pass_info
->ref_pass_instance_number
==
1387 pass
->static_pass_number
)
1388 || (new_pass_info
->ref_pass_instance_number
== 1
1389 && pass
->todo_flags_start
& TODO_mark_first_instance
)))
1392 struct pass_list_node
*new_pass_node
;
1394 if (new_pass_info
->ref_pass_instance_number
== 0)
1396 new_pass
= new_pass_info
->pass
->clone ();
1397 add_pass_instance (new_pass
, true, new_pass_info
->pass
);
1401 new_pass
= new_pass_info
->pass
;
1402 add_pass_instance (new_pass
, true, new_pass
);
1405 /* Insert the new pass instance based on the positioning op. */
1406 switch (new_pass_info
->pos_op
)
1408 case PASS_POS_INSERT_AFTER
:
1409 new_pass
->next
= pass
->next
;
1410 pass
->next
= new_pass
;
1412 /* Skip newly inserted pass to avoid repeated
1413 insertions in the case where the new pass and the
1414 existing one have the same name. */
1417 case PASS_POS_INSERT_BEFORE
:
1418 new_pass
->next
= pass
;
1420 prev_pass
->next
= new_pass
;
1422 *pass_list
= new_pass
;
1424 case PASS_POS_REPLACE
:
1425 new_pass
->next
= pass
->next
;
1427 prev_pass
->next
= new_pass
;
1429 *pass_list
= new_pass
;
1430 new_pass
->sub
= pass
->sub
;
1431 new_pass
->tv_id
= pass
->tv_id
;
1435 error ("invalid pass positioning operation");
1439 /* Save the newly added pass (instance) in the added_pass_nodes
1440 list so that we can register its dump file later. Note that
1441 we cannot register the dump file now because doing so will modify
1442 the static_pass_number of the opt_pass object and therefore
1443 mess up the dump file name of future instances. */
1444 new_pass_node
= XCNEW (struct pass_list_node
);
1445 new_pass_node
->pass
= new_pass
;
1446 if (!added_pass_nodes
)
1447 added_pass_nodes
= new_pass_node
;
1449 prev_added_pass_node
->next
= new_pass_node
;
1450 prev_added_pass_node
= new_pass_node
;
1455 if (pass
->sub
&& position_pass (new_pass_info
, &pass
->sub
))
1462 /* Hooks a new pass into the pass lists.
1464 PASS_INFO - pass information that specifies the opt_pass object,
1465 reference pass, instance number, and how to position
1469 register_pass (struct register_pass_info
*pass_info
)
1471 g
->get_passes ()->register_pass (pass_info
);
1475 register_pass (opt_pass
* pass
, pass_positioning_ops pos
,
1476 const char* ref_pass_name
, int ref_pass_inst_number
)
1478 register_pass_info i
;
1480 i
.reference_pass_name
= ref_pass_name
;
1481 i
.ref_pass_instance_number
= ref_pass_inst_number
;
1484 g
->get_passes ()->register_pass (&i
);
1488 pass_manager::register_pass (struct register_pass_info
*pass_info
)
1490 bool all_instances
, success
;
1492 /* The checks below could fail in buggy plugins. Existing GCC
1493 passes should never fail these checks, so we mention plugin in
1495 if (!pass_info
->pass
)
1496 fatal_error (input_location
, "plugin cannot register a missing pass");
1498 if (!pass_info
->pass
->name
)
1499 fatal_error (input_location
, "plugin cannot register an unnamed pass");
1501 if (!pass_info
->reference_pass_name
)
1504 "plugin cannot register pass %qs without reference pass name",
1505 pass_info
->pass
->name
);
1507 /* Try to insert the new pass to the pass lists. We need to check
1508 all five lists as the reference pass could be in one (or all) of
1510 all_instances
= pass_info
->ref_pass_instance_number
== 0;
1511 success
= position_pass (pass_info
, &all_lowering_passes
);
1512 if (!success
|| all_instances
)
1513 success
|= position_pass (pass_info
, &all_small_ipa_passes
);
1514 if (!success
|| all_instances
)
1515 success
|= position_pass (pass_info
, &all_regular_ipa_passes
);
1516 if (!success
|| all_instances
)
1517 success
|= position_pass (pass_info
, &all_late_ipa_passes
);
1518 if (!success
|| all_instances
)
1519 success
|= position_pass (pass_info
, &all_passes
);
1523 "pass %qs not found but is referenced by new pass %qs",
1524 pass_info
->reference_pass_name
, pass_info
->pass
->name
);
1526 /* OK, we have successfully inserted the new pass. We need to register
1527 the dump files for the newly added pass and its duplicates (if any).
1528 While doing so, we also delete the pass_list_node
1529 objects created during pass positioning. */
1530 gcc::dump_manager
*dumps
= m_ctxt
->get_dumps ();
1531 while (added_pass_nodes
)
1533 struct pass_list_node
*next_node
= added_pass_nodes
->next
;
1535 /* Handle -fdump-* and -fopt-info. */
1536 dumps
->register_pass (added_pass_nodes
->pass
);
1538 XDELETE (added_pass_nodes
);
1539 added_pass_nodes
= next_node
;
1543 /* Construct the pass tree. The sequencing of passes is driven by
1544 the cgraph routines:
1546 finalize_compilation_unit ()
1547 for each node N in the cgraph
1548 cgraph_analyze_function (N)
1549 cgraph_lower_function (N) -> all_lowering_passes
1551 If we are optimizing, compile is then invoked:
1554 ipa_passes () -> all_small_ipa_passes
1555 -> Analysis of all_regular_ipa_passes
1556 * possible LTO streaming at copmilation time *
1557 -> Execution of all_regular_ipa_passes
1558 * possible LTO streaming at link time *
1559 -> all_late_ipa_passes
1560 expand_all_functions ()
1561 for each node N in the cgraph
1562 expand_function (N) -> Transformation of all_regular_ipa_passes
1566 pass_manager::pass_manager (context
*ctxt
)
1567 : all_passes (NULL
), all_small_ipa_passes (NULL
), all_lowering_passes (NULL
),
1568 all_regular_ipa_passes (NULL
),
1569 all_late_ipa_passes (NULL
), passes_by_id (NULL
), passes_by_id_size (0),
1570 m_ctxt (ctxt
), m_name_to_pass_map (NULL
)
1574 /* Zero-initialize pass members. */
1575 #define INSERT_PASSES_AFTER(PASS)
1576 #define PUSH_INSERT_PASSES_WITHIN(PASS)
1577 #define POP_INSERT_PASSES()
1578 #define NEXT_PASS(PASS, NUM) PASS ## _ ## NUM = NULL
1579 #define NEXT_PASS_WITH_ARG(PASS, NUM, ARG) NEXT_PASS (PASS, NUM)
1580 #define TERMINATE_PASS_LIST(PASS)
1581 #include "pass-instances.def"
1582 #undef INSERT_PASSES_AFTER
1583 #undef PUSH_INSERT_PASSES_WITHIN
1584 #undef POP_INSERT_PASSES
1586 #undef NEXT_PASS_WITH_ARG
1587 #undef TERMINATE_PASS_LIST
1589 /* Initialize the pass_lists array. */
1590 #define DEF_PASS_LIST(LIST) pass_lists[PASS_LIST_NO_##LIST] = &LIST;
1592 #undef DEF_PASS_LIST
1594 /* Build the tree of passes. */
1596 #define INSERT_PASSES_AFTER(PASS) \
1598 opt_pass **p_start; \
1599 p_start = p = &(PASS);
1601 #define TERMINATE_PASS_LIST(PASS) \
1602 gcc_assert (p_start == &PASS); \
1606 #define PUSH_INSERT_PASSES_WITHIN(PASS) \
1608 opt_pass **p = &(PASS ## _1)->sub;
1610 #define POP_INSERT_PASSES() \
1613 #define NEXT_PASS(PASS, NUM) \
1615 gcc_assert (PASS ## _ ## NUM == NULL); \
1617 PASS ## _1 = make_##PASS (m_ctxt); \
1620 gcc_assert (PASS ## _1); \
1621 PASS ## _ ## NUM = PASS ## _1->clone (); \
1623 p = next_pass_1 (p, PASS ## _ ## NUM, PASS ## _1); \
1626 #define NEXT_PASS_WITH_ARG(PASS, NUM, ARG) \
1628 NEXT_PASS (PASS, NUM); \
1629 PASS ## _ ## NUM->set_pass_param (0, ARG); \
1632 #include "pass-instances.def"
1634 #undef INSERT_PASSES_AFTER
1635 #undef PUSH_INSERT_PASSES_WITHIN
1636 #undef POP_INSERT_PASSES
1638 #undef NEXT_PASS_WITH_ARG
1639 #undef TERMINATE_PASS_LIST
1641 /* Register the passes with the tree dump code. */
1642 register_dump_files (all_lowering_passes
);
1643 register_dump_files (all_small_ipa_passes
);
1644 register_dump_files (all_regular_ipa_passes
);
1645 register_dump_files (all_late_ipa_passes
);
1646 register_dump_files (all_passes
);
1650 delete_pass_tree (opt_pass
*pass
)
1654 /* Recurse into child passes. */
1655 delete_pass_tree (pass
->sub
);
1657 opt_pass
*next
= pass
->next
;
1659 /* Delete this pass. */
1662 /* Iterate onto sibling passes. */
1667 pass_manager::~pass_manager ()
1669 XDELETEVEC (passes_by_id
);
1671 /* Call delete_pass_tree on each of the pass_lists. */
1672 #define DEF_PASS_LIST(LIST) \
1673 delete_pass_tree (*pass_lists[PASS_LIST_NO_##LIST]);
1675 #undef DEF_PASS_LIST
1679 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
1680 function CALLBACK for every function in the call graph. Otherwise,
1681 call CALLBACK on the current function. */
1684 do_per_function (void (*callback
) (function
*, void *data
), void *data
)
1686 if (current_function_decl
)
1687 callback (cfun
, data
);
1690 struct cgraph_node
*node
;
1691 FOR_EACH_DEFINED_FUNCTION (node
)
1692 if (node
->analyzed
&& (gimple_has_body_p (node
->decl
) && !in_lto_p
)
1693 && (!node
->clone_of
|| node
->decl
!= node
->clone_of
->decl
))
1694 callback (DECL_STRUCT_FUNCTION (node
->decl
), data
);
1698 /* Hook called when NODE is removed and therefore should be
1699 excluded from order vector. DATA is a hash set with removed nodes. */
1702 remove_cgraph_node_from_order (cgraph_node
*node
, void *data
)
1704 hash_set
<cgraph_node
*> *removed_nodes
= (hash_set
<cgraph_node
*> *)data
;
1705 removed_nodes
->add (node
);
1708 /* Hook called when NODE is insert and therefore should be
1709 excluded from removed_nodes. DATA is a hash set with removed nodes. */
1712 insert_cgraph_node_to_order (cgraph_node
*node
, void *data
)
1714 hash_set
<cgraph_node
*> *removed_nodes
= (hash_set
<cgraph_node
*> *)data
;
1715 removed_nodes
->remove (node
);
1718 /* Hook called when NODE is duplicated and therefore should be
1719 excluded from removed_nodes. DATA is a hash set with removed nodes. */
1722 duplicate_cgraph_node_to_order (cgraph_node
*node
, cgraph_node
*node2
,
1725 hash_set
<cgraph_node
*> *removed_nodes
= (hash_set
<cgraph_node
*> *)data
;
1726 gcc_checking_assert (!removed_nodes
->contains (node
));
1727 removed_nodes
->remove (node2
);
1731 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
1732 function CALLBACK for every function in the call graph. Otherwise,
1733 call CALLBACK on the current function.
1734 This function is global so that plugins can use it. */
1736 do_per_function_toporder (void (*callback
) (function
*, void *data
), void *data
)
1740 if (current_function_decl
)
1741 callback (cfun
, data
);
1744 hash_set
<cgraph_node
*> removed_nodes
;
1745 unsigned nnodes
= symtab
->cgraph_count
;
1746 cgraph_node
**order
= XNEWVEC (cgraph_node
*, nnodes
);
1748 nnodes
= ipa_reverse_postorder (order
);
1749 for (i
= nnodes
- 1; i
>= 0; i
--)
1750 order
[i
]->process
= 1;
1751 cgraph_node_hook_list
*removal_hook
1752 = symtab
->add_cgraph_removal_hook (remove_cgraph_node_from_order
,
1754 cgraph_node_hook_list
*insertion_hook
1755 = symtab
->add_cgraph_insertion_hook (insert_cgraph_node_to_order
,
1757 cgraph_2node_hook_list
*duplication_hook
1758 = symtab
->add_cgraph_duplication_hook (duplicate_cgraph_node_to_order
,
1760 for (i
= nnodes
- 1; i
>= 0; i
--)
1762 cgraph_node
*node
= order
[i
];
1764 /* Function could be inlined and removed as unreachable. */
1765 if (node
== NULL
|| removed_nodes
.contains (node
))
1769 if (node
->has_gimple_body_p ())
1771 struct function
*fn
= DECL_STRUCT_FUNCTION (node
->decl
);
1773 callback (fn
, data
);
1777 symtab
->remove_cgraph_removal_hook (removal_hook
);
1778 symtab
->remove_cgraph_insertion_hook (insertion_hook
);
1779 symtab
->remove_cgraph_duplication_hook (duplication_hook
);
1785 /* Helper function to perform function body dump. */
1788 execute_function_dump (function
*fn
, void *data
)
1790 opt_pass
*pass
= (opt_pass
*)data
;
1796 if (fn
->curr_properties
& PROP_trees
)
1797 dump_function_to_file (fn
->decl
, dump_file
, dump_flags
);
1799 print_rtl_with_bb (dump_file
, get_insns (), dump_flags
);
1801 /* Flush the file. If verification fails, we won't be able to
1802 close the file before aborting. */
1805 if ((fn
->curr_properties
& PROP_cfg
)
1806 && (dump_flags
& TDF_GRAPH
))
1808 gcc::dump_manager
*dumps
= g
->get_dumps ();
1809 struct dump_file_info
*dfi
1810 = dumps
->get_dump_file_info (pass
->static_pass_number
);
1811 if (!dfi
->graph_dump_initialized
)
1813 clean_graph_dump_file (dump_file_name
);
1814 dfi
->graph_dump_initialized
= true;
1816 print_graph_cfg (dump_file_name
, fn
);
1823 /* This function is called when an internal compiler error is encountered.
1824 Ensure that function dump is made available before compiler is aborted. */
1827 emergency_dump_function ()
1831 enum opt_pass_type pt
= current_pass
->type
;
1832 fnotice (stderr
, "during %s pass: %s\n",
1833 pt
== GIMPLE_PASS
? "GIMPLE" : pt
== RTL_PASS
? "RTL" : "IPA",
1834 current_pass
->name
);
1835 if (!dump_file
|| !cfun
)
1837 fnotice (stderr
, "dump file: %s\n", dump_file_name
);
1838 fprintf (dump_file
, "\n\n\nEMERGENCY DUMP:\n\n");
1839 execute_function_dump (cfun
, current_pass
);
1842 static struct profile_record
*profile_record
;
1844 /* Do profile consistency book-keeping for the pass with static number INDEX.
1845 RUN is true if the pass really runs, or FALSE
1846 if we are only book-keeping on passes that may have selectively disabled
1847 themselves on a given function. */
1850 check_profile_consistency (int index
, bool run
)
1852 pass_manager
*passes
= g
->get_passes ();
1855 if (!profile_record
)
1856 profile_record
= XCNEWVEC (struct profile_record
,
1857 passes
->passes_by_id_size
);
1858 gcc_assert (index
< passes
->passes_by_id_size
&& index
>= 0);
1859 profile_record
[index
].run
|= run
;
1860 profile_record_check_consistency (&profile_record
[index
]);
1863 /* Account profile the pass with static number INDEX.
1864 RUN is true if the pass really runs, or FALSE
1865 if we are only book-keeping on passes that may have selectively disabled
1866 themselves on a given function. */
1869 account_profile (int index
, bool run
)
1871 pass_manager
*passes
= g
->get_passes ();
1874 if (!profile_record
)
1875 profile_record
= XCNEWVEC (struct profile_record
,
1876 passes
->passes_by_id_size
);
1877 gcc_assert (index
< passes
->passes_by_id_size
&& index
>= 0);
1878 profile_record
[index
].run
|= run
;
1879 profile_record_account_profile (&profile_record
[index
]);
1882 /* Output profile consistency. */
1885 dump_profile_report (void)
1887 g
->get_passes ()->dump_profile_report ();
1891 pass_manager::dump_profile_report () const
1893 int last_freq_in
= 0, last_count_in
= 0, last_freq_out
= 0, last_count_out
= 0;
1894 gcov_type last_time
= 0, last_size
= 0;
1895 double rel_time_change
, rel_size_change
;
1896 int last_reported
= 0;
1898 if (!profile_record
)
1901 FILE *dump_file
= dump_begin (TDI_profile_report
, NULL
);
1902 if (dump_file
== NULL
)
1905 fprintf (dump_file
, "Profile consistency report:\n\n");
1906 fprintf (dump_file
, " |mismatch |mismatch | |\n");
1907 fprintf (dump_file
, "Pass name |IN |IN |OUT |OUT |overall |\n");
1908 fprintf (dump_file
, " |freq |count |freq |count |size |time |\n");
1910 for (int i
= 1; i
< passes_by_id_size
; i
++)
1911 if (profile_record
[i
].run
)
1914 rel_time_change
= (profile_record
[i
].time
1915 - (double)last_time
) * 100 / (double)last_time
;
1917 rel_time_change
= 0;
1919 rel_size_change
= (profile_record
[i
].size
1920 - (double)last_size
) * 100 / (double)last_size
;
1922 rel_size_change
= 0;
1924 if (profile_record
[i
].num_mismatched_freq_in
!= last_freq_in
1925 || profile_record
[i
].num_mismatched_freq_out
!= last_freq_out
1926 || profile_record
[i
].num_mismatched_count_in
!= last_count_in
1927 || profile_record
[i
].num_mismatched_count_out
!= last_count_out
1928 || rel_time_change
|| rel_size_change
)
1931 fprintf (dump_file
, "%-33s", passes_by_id
[i
]->name
);
1932 if (profile_record
[i
].num_mismatched_freq_in
!= last_freq_in
)
1933 fprintf (dump_file
, "| %+5i",
1934 profile_record
[i
].num_mismatched_freq_in
1937 fprintf (dump_file
, "| ");
1938 if (profile_record
[i
].num_mismatched_count_in
!= last_count_in
)
1939 fprintf (dump_file
, "| %+5i",
1940 profile_record
[i
].num_mismatched_count_in
1943 fprintf (dump_file
, "| ");
1944 if (profile_record
[i
].num_mismatched_freq_out
!= last_freq_out
)
1945 fprintf (dump_file
, "| %+5i",
1946 profile_record
[i
].num_mismatched_freq_out
1949 fprintf (dump_file
, "| ");
1950 if (profile_record
[i
].num_mismatched_count_out
!= last_count_out
)
1951 fprintf (dump_file
, "| %+5i",
1952 profile_record
[i
].num_mismatched_count_out
1955 fprintf (dump_file
, "| ");
1957 /* Size/time units change across gimple and RTL. */
1958 if (i
== pass_expand_1
->static_pass_number
)
1959 fprintf (dump_file
, "|----------|----------");
1962 if (rel_size_change
)
1963 fprintf (dump_file
, "| %+8.1f%%", rel_size_change
);
1965 fprintf (dump_file
, "| ");
1966 if (rel_time_change
)
1967 fprintf (dump_file
, "| %+8.1f%%", rel_time_change
);
1969 fprintf (dump_file
, "| ");
1971 fprintf (dump_file
, "|\n");
1972 last_freq_in
= profile_record
[i
].num_mismatched_freq_in
;
1973 last_freq_out
= profile_record
[i
].num_mismatched_freq_out
;
1974 last_count_in
= profile_record
[i
].num_mismatched_count_in
;
1975 last_count_out
= profile_record
[i
].num_mismatched_count_out
;
1977 else if (last_reported
!= i
)
1980 fprintf (dump_file
, "%-20s ------------| | | | | | |\n",
1981 passes_by_id
[i
]->name
);
1983 last_time
= profile_record
[i
].time
;
1984 last_size
= profile_record
[i
].size
;
1987 dump_end (TDI_profile_report
, dump_file
);
1990 /* Perform all TODO actions that ought to be done on each function. */
1993 execute_function_todo (function
*fn
, void *data
)
1995 bool from_ipa_pass
= (cfun
== NULL
);
1996 unsigned int flags
= (size_t)data
;
1997 flags
&= ~fn
->last_verified
;
2003 /* If we need to cleanup the CFG let it perform a needed SSA update. */
2004 if (flags
& TODO_cleanup_cfg
)
2005 cleanup_tree_cfg (flags
& TODO_update_ssa_any
);
2006 else if (flags
& TODO_update_ssa_any
)
2007 update_ssa (flags
& TODO_update_ssa_any
);
2008 gcc_assert (!need_ssa_update_p (fn
));
2010 if (flag_tree_pta
&& (flags
& TODO_rebuild_alias
))
2011 compute_may_aliases ();
2013 if (optimize
&& (flags
& TODO_update_address_taken
))
2014 execute_update_addresses_taken ();
2016 if (flags
& TODO_remove_unused_locals
)
2017 remove_unused_locals ();
2019 if (flags
& TODO_rebuild_frequencies
)
2020 rebuild_frequencies ();
2022 if (flags
& TODO_rebuild_cgraph_edges
)
2023 cgraph_edge::rebuild_edges ();
2025 gcc_assert (dom_info_state (fn
, CDI_POST_DOMINATORS
) == DOM_NONE
);
2026 /* If we've seen errors do not bother running any verifiers. */
2027 if (flag_checking
&& !seen_error ())
2029 dom_state pre_verify_state
= dom_info_state (fn
, CDI_DOMINATORS
);
2030 dom_state pre_verify_pstate
= dom_info_state (fn
, CDI_POST_DOMINATORS
);
2032 if (flags
& TODO_verify_il
)
2034 if (cfun
->curr_properties
& PROP_trees
)
2036 if (cfun
->curr_properties
& PROP_cfg
)
2037 /* IPA passes leave stmts to be fixed up, so make sure to
2038 not verify stmts really throw. */
2039 verify_gimple_in_cfg (cfun
, !from_ipa_pass
);
2041 verify_gimple_in_seq (gimple_body (cfun
->decl
));
2043 if (cfun
->curr_properties
& PROP_ssa
)
2044 /* IPA passes leave stmts to be fixed up, so make sure to
2045 not verify SSA operands whose verifier will choke on that. */
2046 verify_ssa (true, !from_ipa_pass
);
2047 /* IPA passes leave basic-blocks unsplit, so make sure to
2048 not trip on that. */
2049 if ((cfun
->curr_properties
& PROP_cfg
)
2051 verify_flow_info ();
2053 && ! loops_state_satisfies_p (LOOPS_NEED_FIXUP
))
2055 verify_loop_structure ();
2056 if (loops_state_satisfies_p (LOOP_CLOSED_SSA
))
2057 verify_loop_closed_ssa (false);
2059 if (cfun
->curr_properties
& PROP_rtl
)
2060 verify_rtl_sharing ();
2063 /* Make sure verifiers don't change dominator state. */
2064 gcc_assert (dom_info_state (fn
, CDI_DOMINATORS
) == pre_verify_state
);
2065 gcc_assert (dom_info_state (fn
, CDI_POST_DOMINATORS
) == pre_verify_pstate
);
2068 fn
->last_verified
= flags
& TODO_verify_all
;
2072 /* For IPA passes make sure to release dominator info, it can be
2073 computed by non-verifying TODOs. */
2076 free_dominance_info (fn
, CDI_DOMINATORS
);
2077 free_dominance_info (fn
, CDI_POST_DOMINATORS
);
2081 /* Perform all TODO actions. */
2083 execute_todo (unsigned int flags
)
2087 && need_ssa_update_p (cfun
))
2088 gcc_assert (flags
& TODO_update_ssa_any
);
2090 statistics_fini_pass ();
2093 do_per_function (execute_function_todo
, (void *)(size_t) flags
);
2095 /* At this point we should not have any unreachable code in the
2096 CFG, so it is safe to flush the pending freelist for SSA_NAMES. */
2097 if (cfun
&& cfun
->gimple_df
)
2098 flush_ssaname_freelist ();
2100 /* Always remove functions just as before inlining: IPA passes might be
2101 interested to see bodies of extern inline functions that are not inlined
2102 to analyze side effects. The full removal is done just at the end
2103 of IPA pass queue. */
2104 if (flags
& TODO_remove_functions
)
2107 symtab
->remove_unreachable_nodes (dump_file
);
2110 if ((flags
& TODO_dump_symtab
) && dump_file
&& !current_function_decl
)
2113 symtab
->dump (dump_file
);
2114 /* Flush the file. If verification fails, we won't be able to
2115 close the file before aborting. */
2119 /* Now that the dumping has been done, we can get rid of the optional
2121 if (flags
& TODO_df_finish
)
2122 df_finish_pass ((flags
& TODO_df_verify
) != 0);
2125 /* Verify invariants that should hold between passes. This is a place
2126 to put simple sanity checks. */
2129 verify_interpass_invariants (void)
2131 gcc_checking_assert (!fold_deferring_overflow_warnings_p ());
2134 /* Clear the last verified flag. */
2137 clear_last_verified (function
*fn
, void *data ATTRIBUTE_UNUSED
)
2139 fn
->last_verified
= 0;
2142 /* Helper function. Verify that the properties has been turn into the
2143 properties expected by the pass. */
2146 verify_curr_properties (function
*fn
, void *data
)
2148 unsigned int props
= (size_t)data
;
2149 gcc_assert ((fn
->curr_properties
& props
) == props
);
2152 /* Release dump file name if set. */
2155 release_dump_file_name (void)
2159 free (CONST_CAST (char *, dump_file_name
));
2160 dump_file_name
= NULL
;
2164 /* Initialize pass dump file. */
2165 /* This is non-static so that the plugins can use it. */
2168 pass_init_dump_file (opt_pass
*pass
)
2170 /* If a dump file name is present, open it if enabled. */
2171 if (pass
->static_pass_number
!= -1)
2173 timevar_push (TV_DUMP
);
2174 gcc::dump_manager
*dumps
= g
->get_dumps ();
2175 bool initializing_dump
=
2176 !dumps
->dump_initialized_p (pass
->static_pass_number
);
2177 release_dump_file_name ();
2178 dump_file_name
= dumps
->get_dump_file_name (pass
->static_pass_number
);
2179 dumps
->dump_start (pass
->static_pass_number
, &dump_flags
);
2180 if (dump_file
&& current_function_decl
&& ! (dump_flags
& TDF_GIMPLE
))
2181 dump_function_header (dump_file
, current_function_decl
, dump_flags
);
2182 if (initializing_dump
2183 && dump_file
&& (dump_flags
& TDF_GRAPH
)
2184 && cfun
&& (cfun
->curr_properties
& PROP_cfg
))
2186 clean_graph_dump_file (dump_file_name
);
2187 struct dump_file_info
*dfi
2188 = dumps
->get_dump_file_info (pass
->static_pass_number
);
2189 dfi
->graph_dump_initialized
= true;
2191 timevar_pop (TV_DUMP
);
2192 return initializing_dump
;
2198 /* Flush PASS dump file. */
2199 /* This is non-static so that plugins can use it. */
2202 pass_fini_dump_file (opt_pass
*pass
)
2204 timevar_push (TV_DUMP
);
2206 /* Flush and close dump file. */
2207 release_dump_file_name ();
2209 g
->get_dumps ()->dump_finish (pass
->static_pass_number
);
2210 timevar_pop (TV_DUMP
);
2213 /* After executing the pass, apply expected changes to the function
2217 update_properties_after_pass (function
*fn
, void *data
)
2219 opt_pass
*pass
= (opt_pass
*) data
;
2220 fn
->curr_properties
= (fn
->curr_properties
| pass
->properties_provided
)
2221 & ~pass
->properties_destroyed
;
2224 /* Execute summary generation for all of the passes in IPA_PASS. */
2227 execute_ipa_summary_passes (ipa_opt_pass_d
*ipa_pass
)
2231 opt_pass
*pass
= ipa_pass
;
2233 /* Execute all of the IPA_PASSes in the list. */
2234 if (ipa_pass
->type
== IPA_PASS
2235 && pass
->gate (cfun
)
2236 && ipa_pass
->generate_summary
)
2238 pass_init_dump_file (pass
);
2240 /* If a timevar is present, start it. */
2242 timevar_push (pass
->tv_id
);
2244 current_pass
= pass
;
2245 ipa_pass
->generate_summary ();
2249 timevar_pop (pass
->tv_id
);
2251 pass_fini_dump_file (pass
);
2253 ipa_pass
= (ipa_opt_pass_d
*)ipa_pass
->next
;
2257 /* Execute IPA_PASS function transform on NODE. */
2260 execute_one_ipa_transform_pass (struct cgraph_node
*node
,
2261 ipa_opt_pass_d
*ipa_pass
, bool do_not_collect
)
2263 opt_pass
*pass
= ipa_pass
;
2264 unsigned int todo_after
= 0;
2266 current_pass
= pass
;
2267 if (!ipa_pass
->function_transform
)
2270 /* Note that the folders should only create gimple expressions.
2271 This is a hack until the new folder is ready. */
2272 in_gimple_form
= (cfun
&& (cfun
->curr_properties
& PROP_trees
)) != 0;
2274 pass_init_dump_file (pass
);
2276 /* If a timevar is present, start it. */
2277 if (pass
->tv_id
!= TV_NONE
)
2278 timevar_push (pass
->tv_id
);
2280 if (profile_report
&& cfun
&& (cfun
->curr_properties
& PROP_cfg
))
2281 check_profile_consistency (pass
->static_pass_number
, true);
2283 /* Run pre-pass verification. */
2284 execute_todo (ipa_pass
->function_transform_todo_flags_start
);
2287 todo_after
= ipa_pass
->function_transform (node
);
2289 /* Run post-pass cleanup and verification. */
2290 execute_todo (todo_after
);
2291 verify_interpass_invariants ();
2292 if (profile_report
&& cfun
&& (cfun
->curr_properties
& PROP_cfg
))
2293 account_profile (pass
->static_pass_number
, true);
2296 if (pass
->tv_id
!= TV_NONE
)
2297 timevar_pop (pass
->tv_id
);
2300 do_per_function (execute_function_dump
, pass
);
2301 pass_fini_dump_file (pass
);
2303 current_pass
= NULL
;
2304 redirect_edge_var_map_empty ();
2306 /* Signal this is a suitable GC collection point. */
2307 if (!do_not_collect
&& !(todo_after
& TODO_do_not_ggc_collect
))
2311 /* For the current function, execute all ipa transforms. */
2314 execute_all_ipa_transforms (bool do_not_collect
)
2316 struct cgraph_node
*node
;
2319 node
= cgraph_node::get (current_function_decl
);
2321 cgraph_node
*next_clone
;
2322 for (cgraph_node
*n
= node
->clones
; n
; n
= next_clone
)
2324 next_clone
= n
->next_sibling_clone
;
2325 if (n
->decl
!= node
->decl
)
2326 n
->materialize_clone ();
2329 if (node
->ipa_transforms_to_apply
.exists ())
2333 for (i
= 0; i
< node
->ipa_transforms_to_apply
.length (); i
++)
2334 execute_one_ipa_transform_pass (node
, node
->ipa_transforms_to_apply
[i
],
2336 node
->ipa_transforms_to_apply
.release ();
2340 /* Check if PASS is explicitly disabled or enabled and return
2341 the gate status. FUNC is the function to be processed, and
2342 GATE_STATUS is the gate status determined by pass manager by
2346 override_gate_status (opt_pass
*pass
, tree func
, bool gate_status
)
2348 bool explicitly_enabled
= false;
2349 bool explicitly_disabled
= false;
2352 = is_pass_explicitly_enabled_or_disabled (pass
, func
,
2353 enabled_pass_uid_range_tab
);
2355 = is_pass_explicitly_enabled_or_disabled (pass
, func
,
2356 disabled_pass_uid_range_tab
);
2358 gate_status
= !explicitly_disabled
&& (gate_status
|| explicitly_enabled
);
2363 /* Determine if PASS_NAME matches CRITERION.
2364 Not a pure predicate, since it can update CRITERION, to support
2365 matching the Nth invocation of a pass.
2366 Subroutine of should_skip_pass_p. */
2369 determine_pass_name_match (const char *pass_name
, char *criterion
)
2371 size_t namelen
= strlen (pass_name
);
2372 if (! strncmp (pass_name
, criterion
, namelen
))
2374 /* The following supports starting with the Nth invocation
2375 of a pass (where N does not necessarily is equal to the
2376 dump file suffix). */
2377 if (criterion
[namelen
] == '\0'
2378 || (criterion
[namelen
] == '1'
2379 && criterion
[namelen
+ 1] == '\0'))
2383 if (criterion
[namelen
+ 1] == '\0')
2384 --criterion
[namelen
];
2392 /* For skipping passes until "startwith" pass.
2393 Return true iff PASS should be skipped.
2394 Clear cfun->pass_startwith when encountering the "startwith" pass,
2395 so that all subsequent passes are run. */
2398 should_skip_pass_p (opt_pass
*pass
)
2402 if (!cfun
->pass_startwith
)
2405 /* For __GIMPLE functions, we have to at least start when we leave
2406 SSA. Hence, we need to detect the "expand" pass, and stop skipping
2407 when we encounter it. A cheap way to identify "expand" is it to
2408 detect the destruction of PROP_ssa.
2409 For __RTL functions, we invoke "rest_of_compilation" directly, which
2410 is after "expand", and hence we don't reach this conditional. */
2411 if (pass
->properties_destroyed
& PROP_ssa
)
2414 fprintf (stderr
, "starting anyway when leaving SSA: %s\n", pass
->name
);
2415 cfun
->pass_startwith
= NULL
;
2419 if (determine_pass_name_match (pass
->name
, cfun
->pass_startwith
))
2422 fprintf (stderr
, "found starting pass: %s\n", pass
->name
);
2423 cfun
->pass_startwith
= NULL
;
2427 /* For GIMPLE passes, run any property provider (but continue skipping
2429 We don't want to force running RTL passes that are property providers:
2430 "expand" is covered above, and the only pass other than "expand" that
2431 provides a property is "into_cfglayout" (PROP_cfglayout), which does
2432 too much for a dumped __RTL function. */
2433 if (pass
->type
== GIMPLE_PASS
2434 && pass
->properties_provided
!= 0)
2437 /* We need to (re-)build cgraph edges as needed. */
2438 if (strstr (pass
->name
, "build_cgraph_edges") != NULL
)
2441 /* Don't skip df init; later RTL passes need it. */
2442 if (strstr (pass
->name
, "dfinit") != NULL
2443 || strstr (pass
->name
, "dfinish") != NULL
)
2447 fprintf (stderr
, "skipping pass: %s\n", pass
->name
);
2449 /* If we get here, then we have a "startwith" that we haven't seen yet;
2454 /* Skip the given pass, for handling passes before "startwith"
2455 in __GIMPLE and__RTL-marked functions.
2456 In theory, this ought to be a no-op, but some of the RTL passes
2457 need additional processing here. */
2460 skip_pass (opt_pass
*pass
)
2462 /* Pass "reload" sets the global "reload_completed", and many
2463 things depend on this (e.g. instructions in .md files). */
2464 if (strcmp (pass
->name
, "reload") == 0)
2465 reload_completed
= 1;
2467 /* Similar for pass "pro_and_epilogue" and the "epilogue_completed" global
2469 if (strcmp (pass
->name
, "pro_and_epilogue") == 0)
2470 epilogue_completed
= 1;
2472 /* The INSN_ADDRESSES vec is normally set up by
2473 shorten_branches; set it up for the benefit of passes that
2475 if (strcmp (pass
->name
, "shorten") == 0)
2476 INSN_ADDRESSES_ALLOC (get_max_uid ());
2478 /* Update the cfg hooks as appropriate. */
2479 if (strcmp (pass
->name
, "into_cfglayout") == 0)
2481 cfg_layout_rtl_register_cfg_hooks ();
2482 cfun
->curr_properties
|= PROP_cfglayout
;
2484 if (strcmp (pass
->name
, "outof_cfglayout") == 0)
2486 rtl_register_cfg_hooks ();
2487 cfun
->curr_properties
&= ~PROP_cfglayout
;
2494 execute_one_pass (opt_pass
*pass
)
2496 unsigned int todo_after
= 0;
2500 /* IPA passes are executed on whole program, so cfun should be NULL.
2501 Other passes need function context set. */
2502 if (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
)
2503 gcc_assert (!cfun
&& !current_function_decl
);
2505 gcc_assert (cfun
&& current_function_decl
);
2507 current_pass
= pass
;
2509 /* Check whether gate check should be avoided.
2510 User controls the value of the gate through the parameter "gate_status". */
2511 gate_status
= pass
->gate (cfun
);
2512 gate_status
= override_gate_status (pass
, current_function_decl
, gate_status
);
2514 /* Override gate with plugin. */
2515 invoke_plugin_callbacks (PLUGIN_OVERRIDE_GATE
, &gate_status
);
2519 /* Run so passes selectively disabling themselves on a given function
2520 are not miscounted. */
2521 if (profile_report
&& cfun
&& (cfun
->curr_properties
& PROP_cfg
))
2523 check_profile_consistency (pass
->static_pass_number
, false);
2524 account_profile (pass
->static_pass_number
, false);
2526 current_pass
= NULL
;
2530 if (should_skip_pass_p (pass
))
2536 /* Pass execution event trigger: useful to identify passes being
2538 invoke_plugin_callbacks (PLUGIN_PASS_EXECUTION
, pass
);
2540 if (!quiet_flag
&& !cfun
)
2541 fprintf (stderr
, " <%s>", pass
->name
? pass
->name
: "");
2543 /* Note that the folders should only create gimple expressions.
2544 This is a hack until the new folder is ready. */
2545 in_gimple_form
= (cfun
&& (cfun
->curr_properties
& PROP_trees
)) != 0;
2547 pass_init_dump_file (pass
);
2549 /* If a timevar is present, start it. */
2550 if (pass
->tv_id
!= TV_NONE
)
2551 timevar_push (pass
->tv_id
);
2553 if (profile_report
&& cfun
&& (cfun
->curr_properties
& PROP_cfg
))
2554 check_profile_consistency (pass
->static_pass_number
, true);
2556 /* Run pre-pass verification. */
2557 execute_todo (pass
->todo_flags_start
);
2560 do_per_function (verify_curr_properties
,
2561 (void *)(size_t)pass
->properties_required
);
2564 todo_after
= pass
->execute (cfun
);
2566 if (todo_after
& TODO_discard_function
)
2569 if (pass
->tv_id
!= TV_NONE
)
2570 timevar_pop (pass
->tv_id
);
2572 pass_fini_dump_file (pass
);
2575 /* As cgraph_node::release_body expects release dominators info,
2576 we have to release it. */
2577 if (dom_info_available_p (CDI_DOMINATORS
))
2578 free_dominance_info (CDI_DOMINATORS
);
2580 if (dom_info_available_p (CDI_POST_DOMINATORS
))
2581 free_dominance_info (CDI_POST_DOMINATORS
);
2583 tree fn
= cfun
->decl
;
2586 cgraph_node::get (fn
)->release_body ();
2588 current_pass
= NULL
;
2589 redirect_edge_var_map_empty ();
2596 do_per_function (clear_last_verified
, NULL
);
2598 do_per_function (update_properties_after_pass
, pass
);
2600 /* Run post-pass cleanup and verification. */
2601 execute_todo (todo_after
| pass
->todo_flags_finish
| TODO_verify_il
);
2602 if (profile_report
&& cfun
&& (cfun
->curr_properties
& PROP_cfg
))
2603 account_profile (pass
->static_pass_number
, true);
2605 verify_interpass_invariants ();
2608 if (pass
->tv_id
!= TV_NONE
)
2609 timevar_pop (pass
->tv_id
);
2611 if (pass
->type
== IPA_PASS
2612 && ((ipa_opt_pass_d
*)pass
)->function_transform
)
2614 struct cgraph_node
*node
;
2615 FOR_EACH_FUNCTION_WITH_GIMPLE_BODY (node
)
2616 if (!node
->inlined_to
)
2617 node
->ipa_transforms_to_apply
.safe_push ((ipa_opt_pass_d
*)pass
);
2620 do_per_function (execute_function_dump
, pass
);
2622 if (!current_function_decl
)
2623 symtab
->process_new_functions ();
2625 pass_fini_dump_file (pass
);
2627 if (pass
->type
!= SIMPLE_IPA_PASS
&& pass
->type
!= IPA_PASS
)
2628 gcc_assert (!(cfun
->curr_properties
& PROP_trees
)
2629 || pass
->type
!= RTL_PASS
);
2631 current_pass
= NULL
;
2632 redirect_edge_var_map_empty ();
2634 /* Signal this is a suitable GC collection point. */
2635 if (!((todo_after
| pass
->todo_flags_finish
) & TODO_do_not_ggc_collect
))
2638 if (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
)
2639 report_heap_memory_use ();
2644 execute_pass_list_1 (opt_pass
*pass
)
2648 gcc_assert (pass
->type
== GIMPLE_PASS
2649 || pass
->type
== RTL_PASS
);
2653 if (execute_one_pass (pass
) && pass
->sub
)
2654 execute_pass_list_1 (pass
->sub
);
2661 execute_pass_list (function
*fn
, opt_pass
*pass
)
2663 gcc_assert (fn
== cfun
);
2664 execute_pass_list_1 (pass
);
2665 if (cfun
&& fn
->cfg
)
2667 free_dominance_info (CDI_DOMINATORS
);
2668 free_dominance_info (CDI_POST_DOMINATORS
);
2672 /* Write out all LTO data. */
2676 timevar_push (TV_IPA_LTO_GIMPLE_OUT
);
2678 timevar_pop (TV_IPA_LTO_GIMPLE_OUT
);
2679 timevar_push (TV_IPA_LTO_DECL_OUT
);
2680 produce_asm_for_decls ();
2681 timevar_pop (TV_IPA_LTO_DECL_OUT
);
2684 /* Same as execute_pass_list but assume that subpasses of IPA passes
2685 are local passes. If SET is not NULL, write out summaries of only
2686 those node in SET. */
2689 ipa_write_summaries_2 (opt_pass
*pass
, struct lto_out_decl_state
*state
)
2693 ipa_opt_pass_d
*ipa_pass
= (ipa_opt_pass_d
*)pass
;
2694 gcc_assert (!current_function_decl
);
2696 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
2697 if (pass
->type
== IPA_PASS
2698 && ipa_pass
->write_summary
2699 && pass
->gate (cfun
))
2701 /* If a timevar is present, start it. */
2703 timevar_push (pass
->tv_id
);
2705 pass_init_dump_file (pass
);
2707 current_pass
= pass
;
2708 ipa_pass
->write_summary ();
2710 pass_fini_dump_file (pass
);
2712 /* If a timevar is present, start it. */
2714 timevar_pop (pass
->tv_id
);
2717 if (pass
->sub
&& pass
->sub
->type
!= GIMPLE_PASS
)
2718 ipa_write_summaries_2 (pass
->sub
, state
);
2724 /* Helper function of ipa_write_summaries. Creates and destroys the
2725 decl state and calls ipa_write_summaries_2 for all passes that have
2726 summaries. SET is the set of nodes to be written. */
2729 ipa_write_summaries_1 (lto_symtab_encoder_t encoder
)
2731 pass_manager
*passes
= g
->get_passes ();
2732 struct lto_out_decl_state
*state
= lto_new_out_decl_state ();
2733 state
->symtab_node_encoder
= encoder
;
2735 lto_output_init_mode_table ();
2736 lto_push_out_decl_state (state
);
2738 gcc_assert (!flag_wpa
);
2739 ipa_write_summaries_2 (passes
->all_regular_ipa_passes
, state
);
2743 gcc_assert (lto_get_out_decl_state () == state
);
2744 lto_pop_out_decl_state ();
2745 lto_delete_out_decl_state (state
);
2748 /* Write out summaries for all the nodes in the callgraph. */
2751 ipa_write_summaries (void)
2753 lto_symtab_encoder_t encoder
;
2755 varpool_node
*vnode
;
2756 struct cgraph_node
*node
;
2757 struct cgraph_node
**order
;
2759 if ((!flag_generate_lto
&& !flag_generate_offload
) || seen_error ())
2762 gcc_assert (!dump_file
);
2763 streamer_dump_file
= dump_begin (TDI_lto_stream_out
, NULL
);
2765 select_what_to_stream ();
2767 encoder
= lto_symtab_encoder_new (false);
2769 /* Create the callgraph set in the same order used in
2770 cgraph_expand_all_functions. This mostly facilitates debugging,
2771 since it causes the gimple file to be processed in the same order
2772 as the source code. */
2773 order
= XCNEWVEC (struct cgraph_node
*, symtab
->cgraph_count
);
2774 order_pos
= ipa_reverse_postorder (order
);
2775 gcc_assert (order_pos
== symtab
->cgraph_count
);
2777 for (i
= order_pos
- 1; i
>= 0; i
--)
2779 struct cgraph_node
*node
= order
[i
];
2781 if ((node
->definition
|| node
->declare_variant_alt
)
2782 && node
->need_lto_streaming
)
2784 if (gimple_has_body_p (node
->decl
))
2785 lto_prepare_function_for_streaming (node
);
2786 lto_set_symtab_encoder_in_partition (encoder
, node
);
2790 FOR_EACH_DEFINED_FUNCTION (node
)
2791 if (node
->alias
&& node
->need_lto_streaming
)
2792 lto_set_symtab_encoder_in_partition (encoder
, node
);
2793 FOR_EACH_DEFINED_VARIABLE (vnode
)
2794 if (vnode
->need_lto_streaming
)
2795 lto_set_symtab_encoder_in_partition (encoder
, vnode
);
2797 ipa_write_summaries_1 (compute_ltrans_boundary (encoder
));
2800 if (streamer_dump_file
)
2802 dump_end (TDI_lto_stream_out
, streamer_dump_file
);
2803 streamer_dump_file
= NULL
;
2807 /* Same as execute_pass_list but assume that subpasses of IPA passes
2808 are local passes. If SET is not NULL, write out optimization summaries of
2809 only those node in SET. */
2812 ipa_write_optimization_summaries_1 (opt_pass
*pass
,
2813 struct lto_out_decl_state
*state
)
2817 ipa_opt_pass_d
*ipa_pass
= (ipa_opt_pass_d
*)pass
;
2818 gcc_assert (!current_function_decl
);
2820 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
2821 if (pass
->type
== IPA_PASS
2822 && ipa_pass
->write_optimization_summary
2823 && pass
->gate (cfun
))
2825 /* If a timevar is present, start it. */
2827 timevar_push (pass
->tv_id
);
2829 pass_init_dump_file (pass
);
2831 current_pass
= pass
;
2832 ipa_pass
->write_optimization_summary ();
2834 pass_fini_dump_file (pass
);
2836 /* If a timevar is present, start it. */
2838 timevar_pop (pass
->tv_id
);
2841 if (pass
->sub
&& pass
->sub
->type
!= GIMPLE_PASS
)
2842 ipa_write_optimization_summaries_1 (pass
->sub
, state
);
2848 /* Write all the optimization summaries for the cgraph nodes in SET. If SET is
2849 NULL, write out all summaries of all nodes. */
2852 ipa_write_optimization_summaries (lto_symtab_encoder_t encoder
)
2854 struct lto_out_decl_state
*state
= lto_new_out_decl_state ();
2855 state
->symtab_node_encoder
= encoder
;
2857 lto_output_init_mode_table ();
2858 lto_push_out_decl_state (state
);
2860 /* Be sure that we did not forget to renumber stmt uids. */
2861 gcc_checking_assert (flag_wpa
);
2863 gcc_assert (flag_wpa
);
2864 pass_manager
*passes
= g
->get_passes ();
2865 ipa_write_optimization_summaries_1 (passes
->all_regular_ipa_passes
, state
);
2869 gcc_assert (lto_get_out_decl_state () == state
);
2870 lto_pop_out_decl_state ();
2871 lto_delete_out_decl_state (state
);
2874 /* Same as execute_pass_list but assume that subpasses of IPA passes
2875 are local passes. */
2878 ipa_read_summaries_1 (opt_pass
*pass
)
2882 ipa_opt_pass_d
*ipa_pass
= (ipa_opt_pass_d
*) pass
;
2884 gcc_assert (!current_function_decl
);
2886 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
2888 if (pass
->gate (cfun
))
2890 if (pass
->type
== IPA_PASS
&& ipa_pass
->read_summary
)
2892 /* If a timevar is present, start it. */
2894 timevar_push (pass
->tv_id
);
2896 fprintf (stderr
, " <%s>", pass
->name
? pass
->name
: "");
2898 pass_init_dump_file (pass
);
2900 current_pass
= pass
;
2901 ipa_pass
->read_summary ();
2903 pass_fini_dump_file (pass
);
2907 timevar_pop (pass
->tv_id
);
2909 report_heap_memory_use ();
2912 if (pass
->sub
&& pass
->sub
->type
!= GIMPLE_PASS
)
2913 ipa_read_summaries_1 (pass
->sub
);
2920 /* Read all the summaries for all_regular_ipa_passes. */
2923 ipa_read_summaries (void)
2925 pass_manager
*passes
= g
->get_passes ();
2926 ipa_read_summaries_1 (passes
->all_regular_ipa_passes
);
2929 /* Same as execute_pass_list but assume that subpasses of IPA passes
2930 are local passes. */
2933 ipa_read_optimization_summaries_1 (opt_pass
*pass
)
2937 ipa_opt_pass_d
*ipa_pass
= (ipa_opt_pass_d
*) pass
;
2939 gcc_assert (!current_function_decl
);
2941 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
2943 if (pass
->gate (cfun
))
2945 if (pass
->type
== IPA_PASS
&& ipa_pass
->read_optimization_summary
)
2947 /* If a timevar is present, start it. */
2949 timevar_push (pass
->tv_id
);
2951 fprintf (stderr
, " <%s>", pass
->name
? pass
->name
: "");
2953 pass_init_dump_file (pass
);
2955 current_pass
= pass
;
2956 ipa_pass
->read_optimization_summary ();
2958 pass_fini_dump_file (pass
);
2962 timevar_pop (pass
->tv_id
);
2965 if (pass
->sub
&& pass
->sub
->type
!= GIMPLE_PASS
)
2966 ipa_read_optimization_summaries_1 (pass
->sub
);
2968 report_heap_memory_use ();
2974 /* Read all the summaries for all_regular_ipa_passes. */
2977 ipa_read_optimization_summaries (void)
2979 pass_manager
*passes
= g
->get_passes ();
2980 ipa_read_optimization_summaries_1 (passes
->all_regular_ipa_passes
);
2983 /* Same as execute_pass_list but assume that subpasses of IPA passes
2984 are local passes. */
2986 execute_ipa_pass_list (opt_pass
*pass
)
2990 gcc_assert (!current_function_decl
);
2992 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
2993 if (execute_one_pass (pass
) && pass
->sub
)
2995 if (pass
->sub
->type
== GIMPLE_PASS
)
2997 invoke_plugin_callbacks (PLUGIN_EARLY_GIMPLE_PASSES_START
, NULL
);
2998 do_per_function_toporder ((void (*)(function
*, void *))
3001 invoke_plugin_callbacks (PLUGIN_EARLY_GIMPLE_PASSES_END
, NULL
);
3003 else if (pass
->sub
->type
== SIMPLE_IPA_PASS
3004 || pass
->sub
->type
== IPA_PASS
)
3005 execute_ipa_pass_list (pass
->sub
);
3009 gcc_assert (!current_function_decl
);
3010 symtab
->process_new_functions ();
3016 /* Execute stmt fixup hooks of all passes in PASS for NODE and STMTS. */
3019 execute_ipa_stmt_fixups (opt_pass
*pass
,
3020 struct cgraph_node
*node
, gimple
**stmts
)
3024 /* Execute all of the IPA_PASSes in the list. */
3025 if (pass
->type
== IPA_PASS
3026 && pass
->gate (cfun
))
3028 ipa_opt_pass_d
*ipa_pass
= (ipa_opt_pass_d
*) pass
;
3030 if (ipa_pass
->stmt_fixup
)
3032 pass_init_dump_file (pass
);
3033 /* If a timevar is present, start it. */
3035 timevar_push (pass
->tv_id
);
3037 current_pass
= pass
;
3038 ipa_pass
->stmt_fixup (node
, stmts
);
3042 timevar_pop (pass
->tv_id
);
3043 pass_fini_dump_file (pass
);
3046 execute_ipa_stmt_fixups (pass
->sub
, node
, stmts
);
3052 /* Execute stmt fixup hooks of all IPA passes for NODE and STMTS. */
3055 execute_all_ipa_stmt_fixups (struct cgraph_node
*node
, gimple
**stmts
)
3057 pass_manager
*passes
= g
->get_passes ();
3058 execute_ipa_stmt_fixups (passes
->all_regular_ipa_passes
, node
, stmts
);
3062 extern void debug_properties (unsigned int);
3063 extern void dump_properties (FILE *, unsigned int);
3066 dump_properties (FILE *dump
, unsigned int props
)
3068 fprintf (dump
, "Properties:\n");
3069 if (props
& PROP_gimple_any
)
3070 fprintf (dump
, "PROP_gimple_any\n");
3071 if (props
& PROP_gimple_lcf
)
3072 fprintf (dump
, "PROP_gimple_lcf\n");
3073 if (props
& PROP_gimple_leh
)
3074 fprintf (dump
, "PROP_gimple_leh\n");
3075 if (props
& PROP_cfg
)
3076 fprintf (dump
, "PROP_cfg\n");
3077 if (props
& PROP_ssa
)
3078 fprintf (dump
, "PROP_ssa\n");
3079 if (props
& PROP_no_crit_edges
)
3080 fprintf (dump
, "PROP_no_crit_edges\n");
3081 if (props
& PROP_rtl
)
3082 fprintf (dump
, "PROP_rtl\n");
3083 if (props
& PROP_gimple_lomp
)
3084 fprintf (dump
, "PROP_gimple_lomp\n");
3085 if (props
& PROP_gimple_lomp_dev
)
3086 fprintf (dump
, "PROP_gimple_lomp_dev\n");
3087 if (props
& PROP_gimple_lcx
)
3088 fprintf (dump
, "PROP_gimple_lcx\n");
3089 if (props
& PROP_gimple_lvec
)
3090 fprintf (dump
, "PROP_gimple_lvec\n");
3091 if (props
& PROP_cfglayout
)
3092 fprintf (dump
, "PROP_cfglayout\n");
3096 debug_properties (unsigned int props
)
3098 dump_properties (stderr
, props
);
3101 /* Called by local passes to see if function is called by already processed nodes.
3102 Because we process nodes in topological order, this means that function is
3103 in recursive cycle or we introduced new direct calls. */
3105 function_called_by_processed_nodes_p (void)
3107 struct cgraph_edge
*e
;
3108 for (e
= cgraph_node::get (current_function_decl
)->callers
;
3112 if (e
->caller
->decl
== current_function_decl
)
3114 if (!e
->caller
->has_gimple_body_p ())
3116 if (TREE_ASM_WRITTEN (e
->caller
->decl
))
3118 if (!e
->caller
->process
&& !e
->caller
->inlined_to
)
3123 fprintf (dump_file
, "Already processed call to:\n");
3124 e
->caller
->dump (dump_file
);