1 /* Top level of GCC compilers (cc1, cc1plus, etc.)
2 Copyright (C) 1987-2013 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"
36 #include "insn-attr.h"
37 #include "insn-config.h"
38 #include "insn-flags.h"
39 #include "hard-reg-set.h"
46 #include "basic-block.h"
50 #include "diagnostic-core.h"
55 #include "langhooks.h"
57 #include "hosthooks.h"
60 #include "value-prof.h"
61 #include "tree-inline.h"
62 #include "tree-ssa-alias.h"
63 #include "internal-fn.h"
64 #include "gimple-expr.h"
67 #include "gimple-ssa.h"
69 #include "stringpool.h"
70 #include "tree-ssanames.h"
71 #include "tree-ssa-loop-manip.h"
72 #include "tree-into-ssa.h"
75 #include "tree-pass.h"
76 #include "tree-dump.h"
79 #include "lto-streamer.h"
81 #include "ipa-utils.h"
82 #include "tree-pretty-print.h" /* for dump_function_header */
84 #include "pass_manager.h"
85 #include "tree-ssa-live.h" /* For remove_unused_locals. */
86 #include "tree-cfgcleanup.h"
90 /* This is used for debugging. It allows the current pass to printed
91 from anywhere in compilation.
92 The variable current_pass is also used for statistics and plugins. */
93 opt_pass
*current_pass
;
95 static void register_pass_name (opt_pass
*, const char *);
97 /* Most passes are single-instance (within their context) and thus don't
98 need to implement cloning, but passes that support multiple instances
99 *must* provide their own implementation of the clone method.
101 Handle this by providing a default implemenation, but make it a fatal
107 internal_error ("pass %s does not support cloning", name
);
122 opt_pass::opt_pass (const pass_data
&data
, context
*ctxt
)
126 static_pass_number (0),
133 pass_manager::execute_early_local_passes ()
135 execute_pass_list (pass_early_local_passes_1
->sub
);
139 pass_manager::execute_pass_mode_switching ()
141 return pass_mode_switching_1
->execute ();
145 /* Call from anywhere to find out what pass this is. Useful for
146 printing out debugging information deep inside an service
149 print_current_pass (FILE *file
)
152 fprintf (file
, "current pass = %s (%d)\n",
153 current_pass
->name
, current_pass
->static_pass_number
);
155 fprintf (file
, "no current pass.\n");
159 /* Call from the debugger to get the current pass name. */
163 print_current_pass (stderr
);
168 /* Global variables used to communicate with passes. */
170 bool first_pass_instance
;
173 /* This is called from various places for FUNCTION_DECL, VAR_DECL,
176 This does nothing for local (non-static) variables, unless the
177 variable is a register variable with DECL_ASSEMBLER_NAME set. In
178 that case, or if the variable is not an automatic, it sets up the
179 RTL and outputs any assembler code (label definition, storage
180 allocation and initialization).
182 DECL is the declaration. TOP_LEVEL is nonzero
183 if this declaration is not within a function. */
186 rest_of_decl_compilation (tree decl
,
190 /* We deferred calling assemble_alias so that we could collect
191 other attributes such as visibility. Emit the alias now. */
195 alias
= lookup_attribute ("alias", DECL_ATTRIBUTES (decl
));
198 alias
= TREE_VALUE (TREE_VALUE (alias
));
199 alias
= get_identifier (TREE_STRING_POINTER (alias
));
200 /* A quirk of the initial implementation of aliases required that the
201 user add "extern" to all of them. Which is silly, but now
202 historical. Do note that the symbol is in fact locally defined. */
203 DECL_EXTERNAL (decl
) = 0;
204 TREE_STATIC (decl
) = 1;
205 assemble_alias (decl
, alias
);
209 /* Can't defer this, because it needs to happen before any
210 later function definitions are processed. */
211 if (DECL_ASSEMBLER_NAME_SET_P (decl
) && DECL_REGISTER (decl
))
212 make_decl_rtl (decl
);
214 /* Forward declarations for nested functions are not "external",
215 but we need to treat them as if they were. */
216 if (TREE_STATIC (decl
) || DECL_EXTERNAL (decl
)
217 || TREE_CODE (decl
) == FUNCTION_DECL
)
219 timevar_push (TV_VARCONST
);
221 /* Don't output anything when a tentative file-scope definition
222 is seen. But at end of compilation, do output code for them.
224 We do output all variables and rely on
225 callgraph code to defer them except for forward declarations
226 (see gcc.c-torture/compile/920624-1.c) */
228 || !DECL_DEFER_OUTPUT (decl
)
229 || DECL_INITIAL (decl
))
230 && (TREE_CODE (decl
) != VAR_DECL
|| !DECL_HAS_VALUE_EXPR_P (decl
))
231 && !DECL_EXTERNAL (decl
))
233 /* When reading LTO unit, we also read varpool, so do not
235 if (in_lto_p
&& !at_end
)
237 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
238 varpool_finalize_decl (decl
);
241 #ifdef ASM_FINISH_DECLARE_OBJECT
242 if (decl
== last_assemble_variable_decl
)
244 ASM_FINISH_DECLARE_OBJECT (asm_out_file
, decl
,
249 timevar_pop (TV_VARCONST
);
251 else if (TREE_CODE (decl
) == TYPE_DECL
252 /* Like in rest_of_type_compilation, avoid confusing the debug
253 information machinery when there are errors. */
256 timevar_push (TV_SYMOUT
);
257 debug_hooks
->type_decl (decl
, !top_level
);
258 timevar_pop (TV_SYMOUT
);
261 /* Let cgraph know about the existence of variables. */
262 if (in_lto_p
&& !at_end
)
264 else if (TREE_CODE (decl
) == VAR_DECL
&& !DECL_EXTERNAL (decl
)
265 && TREE_STATIC (decl
))
266 varpool_node_for_decl (decl
);
269 /* Called after finishing a record, union or enumeral type. */
272 rest_of_type_compilation (tree type
, int toplev
)
274 /* Avoid confusing the debug information machinery when there are
279 timevar_push (TV_SYMOUT
);
280 debug_hooks
->type_decl (TYPE_STUB_DECL (type
), !toplev
);
281 timevar_pop (TV_SYMOUT
);
288 finish_optimization_passes (void)
291 struct dump_file_info
*dfi
;
293 gcc::dump_manager
*dumps
= m_ctxt
->get_dumps ();
295 timevar_push (TV_DUMP
);
296 if (profile_arc_flag
|| flag_test_coverage
|| flag_branch_probabilities
)
298 dumps
->dump_start (pass_profile_1
->static_pass_number
, NULL
);
300 dumps
->dump_finish (pass_profile_1
->static_pass_number
);
305 dumps
->dump_start (pass_profile_1
->static_pass_number
, NULL
);
306 print_combine_total_stats ();
307 dumps
->dump_finish (pass_profile_1
->static_pass_number
);
310 /* Do whatever is necessary to finish printing the graphs. */
311 for (i
= TDI_end
; (dfi
= dumps
->get_dump_file_info (i
)) != NULL
; ++i
)
312 if (dumps
->dump_initialized_p (i
)
313 && (dfi
->pflags
& TDF_GRAPH
) != 0
314 && (name
= dumps
->get_dump_file_name (i
)) != NULL
)
316 finish_graph_dump_file (name
);
320 timevar_pop (TV_DUMP
);
324 execute_all_early_local_passes (void)
326 /* Once this pass (and its sub-passes) are complete, all functions
327 will be in SSA form. Technically this state change is happening
328 a tad early, since the sub-passes have not yet run, but since
329 none of the sub-passes are IPA passes and do not create new
330 functions, this is ok. We're setting this value for the benefit
331 of IPA passes that follow. */
332 if (cgraph_state
< CGRAPH_STATE_IPA_SSA
)
333 cgraph_state
= CGRAPH_STATE_IPA_SSA
;
337 /* Gate: execute, or not, all of the non-trivial optimizations. */
340 gate_all_early_local_passes (void)
342 /* Don't bother doing anything if the program has errors. */
343 return (!seen_error () && !in_lto_p
);
348 const pass_data pass_data_early_local_passes
=
350 SIMPLE_IPA_PASS
, /* type */
351 "early_local_cleanups", /* name */
352 OPTGROUP_NONE
, /* optinfo_flags */
354 true, /* has_execute */
355 TV_EARLY_LOCAL
, /* tv_id */
356 0, /* properties_required */
357 0, /* properties_provided */
358 0, /* properties_destroyed */
359 0, /* todo_flags_start */
360 TODO_remove_functions
, /* todo_flags_finish */
363 class pass_early_local_passes
: public simple_ipa_opt_pass
366 pass_early_local_passes (gcc::context
*ctxt
)
367 : simple_ipa_opt_pass (pass_data_early_local_passes
, ctxt
)
370 /* opt_pass methods: */
371 bool gate () { return gate_all_early_local_passes (); }
372 unsigned int execute () { return execute_all_early_local_passes (); }
374 }; // class pass_early_local_passes
378 simple_ipa_opt_pass
*
379 make_pass_early_local_passes (gcc::context
*ctxt
)
381 return new pass_early_local_passes (ctxt
);
384 /* Gate: execute, or not, all of the non-trivial optimizations. */
387 gate_all_early_optimizations (void)
389 return (optimize
>= 1
390 /* Don't bother doing anything if the program has errors. */
396 const pass_data pass_data_all_early_optimizations
=
398 GIMPLE_PASS
, /* type */
399 "early_optimizations", /* name */
400 OPTGROUP_NONE
, /* optinfo_flags */
402 false, /* has_execute */
404 0, /* properties_required */
405 0, /* properties_provided */
406 0, /* properties_destroyed */
407 0, /* todo_flags_start */
408 0, /* todo_flags_finish */
411 class pass_all_early_optimizations
: public gimple_opt_pass
414 pass_all_early_optimizations (gcc::context
*ctxt
)
415 : gimple_opt_pass (pass_data_all_early_optimizations
, ctxt
)
418 /* opt_pass methods: */
419 bool gate () { return gate_all_early_optimizations (); }
421 }; // class pass_all_early_optimizations
425 static gimple_opt_pass
*
426 make_pass_all_early_optimizations (gcc::context
*ctxt
)
428 return new pass_all_early_optimizations (ctxt
);
431 /* Gate: execute, or not, all of the non-trivial optimizations. */
434 gate_all_optimizations (void)
436 return optimize
>= 1 && !optimize_debug
;
441 const pass_data pass_data_all_optimizations
=
443 GIMPLE_PASS
, /* type */
444 "*all_optimizations", /* name */
445 OPTGROUP_NONE
, /* optinfo_flags */
447 false, /* has_execute */
448 TV_OPTIMIZE
, /* tv_id */
449 0, /* properties_required */
450 0, /* properties_provided */
451 0, /* properties_destroyed */
452 0, /* todo_flags_start */
453 0, /* todo_flags_finish */
456 class pass_all_optimizations
: public gimple_opt_pass
459 pass_all_optimizations (gcc::context
*ctxt
)
460 : gimple_opt_pass (pass_data_all_optimizations
, ctxt
)
463 /* opt_pass methods: */
464 bool gate () { return gate_all_optimizations (); }
466 }; // class pass_all_optimizations
470 static gimple_opt_pass
*
471 make_pass_all_optimizations (gcc::context
*ctxt
)
473 return new pass_all_optimizations (ctxt
);
476 /* Gate: execute, or not, all of the non-trivial optimizations. */
479 gate_all_optimizations_g (void)
481 return optimize
>= 1 && optimize_debug
;
486 const pass_data pass_data_all_optimizations_g
=
488 GIMPLE_PASS
, /* type */
489 "*all_optimizations_g", /* name */
490 OPTGROUP_NONE
, /* optinfo_flags */
492 false, /* has_execute */
493 TV_OPTIMIZE
, /* tv_id */
494 0, /* properties_required */
495 0, /* properties_provided */
496 0, /* properties_destroyed */
497 0, /* todo_flags_start */
498 0, /* todo_flags_finish */
501 class pass_all_optimizations_g
: public gimple_opt_pass
504 pass_all_optimizations_g (gcc::context
*ctxt
)
505 : gimple_opt_pass (pass_data_all_optimizations_g
, ctxt
)
508 /* opt_pass methods: */
509 bool gate () { return gate_all_optimizations_g (); }
511 }; // class pass_all_optimizations_g
515 static gimple_opt_pass
*
516 make_pass_all_optimizations_g (gcc::context
*ctxt
)
518 return new pass_all_optimizations_g (ctxt
);
522 gate_rest_of_compilation (void)
524 /* Early return if there were errors. We can run afoul of our
525 consistency checks, and there's not really much point in fixing them. */
526 return !(rtl_dump_and_exit
|| flag_syntax_only
|| seen_error ());
531 const pass_data pass_data_rest_of_compilation
=
534 "*rest_of_compilation", /* name */
535 OPTGROUP_NONE
, /* optinfo_flags */
537 false, /* has_execute */
538 TV_REST_OF_COMPILATION
, /* tv_id */
539 PROP_rtl
, /* properties_required */
540 0, /* properties_provided */
541 0, /* properties_destroyed */
542 0, /* todo_flags_start */
543 0, /* todo_flags_finish */
546 class pass_rest_of_compilation
: public rtl_opt_pass
549 pass_rest_of_compilation (gcc::context
*ctxt
)
550 : rtl_opt_pass (pass_data_rest_of_compilation
, ctxt
)
553 /* opt_pass methods: */
554 bool gate () { return gate_rest_of_compilation (); }
556 }; // class pass_rest_of_compilation
560 static rtl_opt_pass
*
561 make_pass_rest_of_compilation (gcc::context
*ctxt
)
563 return new pass_rest_of_compilation (ctxt
);
567 gate_postreload (void)
569 return reload_completed
;
574 const pass_data pass_data_postreload
=
577 "*all-postreload", /* name */
578 OPTGROUP_NONE
, /* optinfo_flags */
580 false, /* has_execute */
581 TV_POSTRELOAD
, /* tv_id */
582 PROP_rtl
, /* properties_required */
583 0, /* properties_provided */
584 0, /* properties_destroyed */
585 0, /* todo_flags_start */
586 TODO_verify_rtl_sharing
, /* todo_flags_finish */
589 class pass_postreload
: public rtl_opt_pass
592 pass_postreload (gcc::context
*ctxt
)
593 : rtl_opt_pass (pass_data_postreload
, ctxt
)
596 /* opt_pass methods: */
597 bool gate () { return gate_postreload (); }
599 }; // class pass_postreload
603 static rtl_opt_pass
*
604 make_pass_postreload (gcc::context
*ctxt
)
606 return new pass_postreload (ctxt
);
611 /* Set the static pass number of pass PASS to ID and record that
612 in the mapping from static pass number to pass. */
616 set_pass_for_id (int id
, opt_pass
*pass
)
618 pass
->static_pass_number
= id
;
619 if (passes_by_id_size
<= id
)
621 passes_by_id
= XRESIZEVEC (opt_pass
*, passes_by_id
, id
+ 1);
622 memset (passes_by_id
+ passes_by_id_size
, 0,
623 (id
+ 1 - passes_by_id_size
) * sizeof (void *));
624 passes_by_id_size
= id
+ 1;
626 passes_by_id
[id
] = pass
;
629 /* Return the pass with the static pass number ID. */
632 pass_manager::get_pass_for_id (int id
) const
634 if (id
>= passes_by_id_size
)
636 return passes_by_id
[id
];
639 /* Iterate over the pass tree allocating dump file numbers. We want
640 to do this depth first, and independent of whether the pass is
644 register_one_dump_file (opt_pass
*pass
)
646 g
->get_passes ()->register_one_dump_file (pass
);
650 pass_manager::register_one_dump_file (opt_pass
*pass
)
652 char *dot_name
, *flag_name
, *glob_name
;
653 const char *name
, *full_name
, *prefix
;
656 int optgroup_flags
= OPTGROUP_NONE
;
657 gcc::dump_manager
*dumps
= m_ctxt
->get_dumps ();
659 /* See below in next_pass_1. */
661 if (pass
->static_pass_number
!= -1)
662 sprintf (num
, "%d", ((int) pass
->static_pass_number
< 0
663 ? 1 : pass
->static_pass_number
));
665 /* The name is both used to identify the pass for the purposes of plugins,
666 and to specify dump file name and option.
667 The latter two might want something short which is not quite unique; for
668 that reason, we may have a disambiguating prefix, followed by a space
669 to mark the start of the following dump file name / option string. */
670 name
= strchr (pass
->name
, ' ');
671 name
= name
? name
+ 1 : pass
->name
;
672 dot_name
= concat (".", name
, num
, NULL
);
673 if (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
)
677 optgroup_flags
|= OPTGROUP_IPA
;
679 else if (pass
->type
== GIMPLE_PASS
)
690 flag_name
= concat (prefix
, name
, num
, NULL
);
691 glob_name
= concat (prefix
, name
, NULL
);
692 optgroup_flags
|= pass
->optinfo_flags
;
693 /* For any passes that do not have an optgroup set, and which are not
694 IPA passes setup above, set the optgroup to OPTGROUP_OTHER so that
695 any dump messages are emitted properly under -fopt-info(-optall). */
696 if (optgroup_flags
== OPTGROUP_NONE
)
697 optgroup_flags
= OPTGROUP_OTHER
;
698 id
= dumps
->dump_register (dot_name
, flag_name
, glob_name
, flags
,
700 set_pass_for_id (id
, pass
);
701 full_name
= concat (prefix
, pass
->name
, num
, NULL
);
702 register_pass_name (pass
, full_name
);
703 free (CONST_CAST (char *, full_name
));
706 /* Recursive worker function for register_dump_files. */
710 register_dump_files_1 (opt_pass
*pass
, int properties
)
714 int new_properties
= (properties
| pass
->properties_provided
)
715 & ~pass
->properties_destroyed
;
717 if (pass
->name
&& pass
->name
[0] != '*')
718 register_one_dump_file (pass
);
721 new_properties
= register_dump_files_1 (pass
->sub
, new_properties
);
723 /* If we have a gate, combine the properties that we could have with
724 and without the pass being examined. */
726 properties
&= new_properties
;
728 properties
= new_properties
;
737 /* Register the dump files for the pass_manager starting at PASS.
738 PROPERTIES reflects the properties that are guaranteed to be available at
739 the beginning of the pipeline. */
743 register_dump_files (opt_pass
*pass
,int properties
)
745 pass
->properties_required
|= properties
;
746 register_dump_files_1 (pass
, properties
);
751 const char* unique_name
;
755 /* Helper for pass_registry hash table. */
757 struct pass_registry_hasher
: typed_noop_remove
<pass_registry
>
759 typedef pass_registry value_type
;
760 typedef pass_registry compare_type
;
761 static inline hashval_t
hash (const value_type
*);
762 static inline bool equal (const value_type
*, const compare_type
*);
765 /* Pass registry hash function. */
768 pass_registry_hasher::hash (const value_type
*s
)
770 return htab_hash_string (s
->unique_name
);
773 /* Hash equal function */
776 pass_registry_hasher::equal (const value_type
*s1
, const compare_type
*s2
)
778 return !strcmp (s1
->unique_name
, s2
->unique_name
);
781 static hash_table
<pass_registry_hasher
> name_to_pass_map
;
783 /* Register PASS with NAME. */
786 register_pass_name (opt_pass
*pass
, const char *name
)
788 struct pass_registry
**slot
;
789 struct pass_registry pr
;
791 if (!name_to_pass_map
.is_created ())
792 name_to_pass_map
.create (256);
794 pr
.unique_name
= name
;
795 slot
= name_to_pass_map
.find_slot (&pr
, INSERT
);
798 struct pass_registry
*new_pr
;
800 new_pr
= XCNEW (struct pass_registry
);
801 new_pr
->unique_name
= xstrdup (name
);
806 return; /* Ignore plugin passes. */
809 /* Map from pass id to canonicalized pass name. */
811 typedef const char *char_ptr
;
812 static vec
<char_ptr
> pass_tab
= vNULL
;
814 /* Callback function for traversing NAME_TO_PASS_MAP. */
817 passes_pass_traverse (pass_registry
**p
, void *data ATTRIBUTE_UNUSED
)
819 opt_pass
*pass
= (*p
)->pass
;
821 gcc_assert (pass
->static_pass_number
> 0);
822 gcc_assert (pass_tab
.exists ());
824 pass_tab
[pass
->static_pass_number
] = (*p
)->unique_name
;
829 /* The function traverses NAME_TO_PASS_MAP and creates a pass info
830 table for dumping purpose. */
833 create_pass_tab (void)
835 if (!flag_dump_passes
)
838 pass_tab
.safe_grow_cleared (g
->get_passes ()->passes_by_id_size
+ 1);
839 name_to_pass_map
.traverse
<void *, passes_pass_traverse
> (NULL
);
842 static bool override_gate_status (opt_pass
*, tree
, bool);
844 /* Dump the instantiated name for PASS. IS_ON indicates if PASS
845 is turned on or not. */
848 dump_one_pass (opt_pass
*pass
, int pass_indent
)
850 int indent
= 3 * pass_indent
;
852 bool is_on
, is_really_on
;
854 is_on
= pass
->has_gate
? pass
->gate () : true;
855 is_really_on
= override_gate_status (pass
, current_function_decl
, is_on
);
857 if (pass
->static_pass_number
<= 0)
860 pn
= pass_tab
[pass
->static_pass_number
];
862 fprintf (stderr
, "%*s%-40s%*s:%s%s\n", indent
, " ", pn
,
863 (15 - indent
< 0 ? 0 : 15 - indent
), " ",
864 is_on
? " ON" : " OFF",
865 ((!is_on
) == (!is_really_on
) ? ""
866 : (is_really_on
? " (FORCED_ON)" : " (FORCED_OFF)")));
869 /* Dump pass list PASS with indentation INDENT. */
872 dump_pass_list (opt_pass
*pass
, int indent
)
876 dump_one_pass (pass
, indent
);
878 dump_pass_list (pass
->sub
, indent
+ 1);
884 /* Dump all optimization passes. */
889 g
->get_passes ()->dump_passes ();
893 pass_manager::dump_passes () const
895 struct cgraph_node
*n
, *node
= NULL
;
899 FOR_EACH_FUNCTION (n
)
900 if (DECL_STRUCT_FUNCTION (n
->decl
))
909 push_cfun (DECL_STRUCT_FUNCTION (node
->decl
));
911 dump_pass_list (all_lowering_passes
, 1);
912 dump_pass_list (all_small_ipa_passes
, 1);
913 dump_pass_list (all_regular_ipa_passes
, 1);
914 dump_pass_list (all_late_ipa_passes
, 1);
915 dump_pass_list (all_passes
, 1);
921 /* Returns the pass with NAME. */
924 get_pass_by_name (const char *name
)
926 struct pass_registry
**slot
, pr
;
928 pr
.unique_name
= name
;
929 slot
= name_to_pass_map
.find_slot (&pr
, NO_INSERT
);
934 return (*slot
)->pass
;
938 /* Range [start, last]. */
944 const char *assem_name
;
945 struct uid_range
*next
;
948 typedef struct uid_range
*uid_range_p
;
951 static vec
<uid_range_p
>
952 enabled_pass_uid_range_tab
= vNULL
;
953 static vec
<uid_range_p
>
954 disabled_pass_uid_range_tab
= vNULL
;
957 /* Parse option string for -fdisable- and -fenable-
958 The syntax of the options:
961 -fdisable-<pass_name>
963 -fenable-<pass_name>=s1:e1,s2:e2,...
964 -fdisable-<pass_name>=s1:e1,s2:e2,...
968 enable_disable_pass (const char *arg
, bool is_enable
)
971 char *range_str
, *phase_name
;
972 char *argstr
= xstrdup (arg
);
973 vec
<uid_range_p
> *tab
= 0;
975 range_str
= strchr (argstr
,'=');
986 error ("unrecognized option -fenable");
988 error ("unrecognized option -fdisable");
992 pass
= get_pass_by_name (phase_name
);
993 if (!pass
|| pass
->static_pass_number
== -1)
996 error ("unknown pass %s specified in -fenable", phase_name
);
998 error ("unknown pass %s specified in -fdisable", phase_name
);
1004 tab
= &enabled_pass_uid_range_tab
;
1006 tab
= &disabled_pass_uid_range_tab
;
1008 if ((unsigned) pass
->static_pass_number
>= tab
->length ())
1009 tab
->safe_grow_cleared (pass
->static_pass_number
+ 1);
1014 uid_range_p new_range
= XCNEW (struct uid_range
);
1016 new_range
->start
= 0;
1017 new_range
->last
= (unsigned)-1;
1019 slot
= (*tab
)[pass
->static_pass_number
];
1020 new_range
->next
= slot
;
1021 (*tab
)[pass
->static_pass_number
] = new_range
;
1023 inform (UNKNOWN_LOCATION
, "enable pass %s for functions in the range "
1024 "of [%u, %u]", phase_name
, new_range
->start
, new_range
->last
);
1026 inform (UNKNOWN_LOCATION
, "disable pass %s for functions in the range "
1027 "of [%u, %u]", phase_name
, new_range
->start
, new_range
->last
);
1031 char *next_range
= NULL
;
1032 char *one_range
= range_str
;
1033 char *end_val
= NULL
;
1038 uid_range_p new_range
;
1039 char *invalid
= NULL
;
1041 char *func_name
= NULL
;
1043 next_range
= strchr (one_range
, ',');
1050 end_val
= strchr (one_range
, ':');
1056 start
= strtol (one_range
, &invalid
, 10);
1057 if (*invalid
|| start
< 0)
1059 if (end_val
|| (one_range
[0] >= '0'
1060 && one_range
[0] <= '9'))
1062 error ("Invalid range %s in option %s",
1064 is_enable
? "-fenable" : "-fdisable");
1068 func_name
= one_range
;
1072 new_range
= XCNEW (struct uid_range
);
1075 new_range
->start
= (unsigned) start
;
1076 new_range
->last
= (unsigned) start
;
1080 new_range
->start
= (unsigned) -1;
1081 new_range
->last
= (unsigned) -1;
1082 new_range
->assem_name
= xstrdup (func_name
);
1087 long last
= strtol (end_val
, &invalid
, 10);
1088 if (*invalid
|| last
< start
)
1090 error ("Invalid range %s in option %s",
1092 is_enable
? "-fenable" : "-fdisable");
1096 new_range
= XCNEW (struct uid_range
);
1097 new_range
->start
= (unsigned) start
;
1098 new_range
->last
= (unsigned) last
;
1101 slot
= (*tab
)[pass
->static_pass_number
];
1102 new_range
->next
= slot
;
1103 (*tab
)[pass
->static_pass_number
] = new_range
;
1106 if (new_range
->assem_name
)
1107 inform (UNKNOWN_LOCATION
,
1108 "enable pass %s for function %s",
1109 phase_name
, new_range
->assem_name
);
1111 inform (UNKNOWN_LOCATION
,
1112 "enable pass %s for functions in the range of [%u, %u]",
1113 phase_name
, new_range
->start
, new_range
->last
);
1117 if (new_range
->assem_name
)
1118 inform (UNKNOWN_LOCATION
,
1119 "disable pass %s for function %s",
1120 phase_name
, new_range
->assem_name
);
1122 inform (UNKNOWN_LOCATION
,
1123 "disable pass %s for functions in the range of [%u, %u]",
1124 phase_name
, new_range
->start
, new_range
->last
);
1127 one_range
= next_range
;
1128 } while (next_range
);
1134 /* Enable pass specified by ARG. */
1137 enable_pass (const char *arg
)
1139 enable_disable_pass (arg
, true);
1142 /* Disable pass specified by ARG. */
1145 disable_pass (const char *arg
)
1147 enable_disable_pass (arg
, false);
1150 /* Returns true if PASS is explicitly enabled/disabled for FUNC. */
1153 is_pass_explicitly_enabled_or_disabled (opt_pass
*pass
,
1155 vec
<uid_range_p
> tab
)
1157 uid_range_p slot
, range
;
1159 const char *aname
= NULL
;
1162 || (unsigned) pass
->static_pass_number
>= tab
.length ()
1163 || pass
->static_pass_number
== -1)
1166 slot
= tab
[pass
->static_pass_number
];
1170 cgraph_uid
= func
? cgraph_get_node (func
)->uid
: 0;
1171 if (func
&& DECL_ASSEMBLER_NAME_SET_P (func
))
1172 aname
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (func
));
1177 if ((unsigned) cgraph_uid
>= range
->start
1178 && (unsigned) cgraph_uid
<= range
->last
)
1180 if (range
->assem_name
&& aname
1181 && !strcmp (range
->assem_name
, aname
))
1183 range
= range
->next
;
1190 /* Update static_pass_number for passes (and the flag
1191 TODO_mark_first_instance).
1193 Passes are constructed with static_pass_number preinitialized to 0
1195 This field is used in two different ways: initially as instance numbers
1196 of their kind, and then as ids within the entire pass manager.
1198 Within pass_manager::pass_manager:
1200 * In add_pass_instance(), as called by next_pass_1 in
1201 NEXT_PASS in init_optimization_passes
1203 * When the initial instance of a pass within a pass manager is seen,
1204 it is flagged, and its static_pass_number is set to -1
1206 * On subsequent times that it is seen, the static pass number
1207 is decremented each time, so that if there are e.g. 4 dups,
1208 they have static_pass_number -4, 2, 3, 4 respectively (note
1209 how the initial one is negative and gives the count); these
1210 can be thought of as instance numbers of the specific pass
1212 * Within the register_dump_files () traversal, set_pass_for_id()
1213 is called on each pass, using these instance numbers to create
1214 dumpfile switches, and then overwriting them with a pass id,
1215 which are global to the whole pass manager (based on
1216 (TDI_end + current value of extra_dump_files_in_use) ) */
1219 add_pass_instance (opt_pass
*new_pass
, bool track_duplicates
,
1220 opt_pass
*initial_pass
)
1222 /* Are we dealing with the first pass of its kind, or a clone? */
1223 if (new_pass
!= initial_pass
)
1225 /* We're dealing with a clone. */
1226 new_pass
->todo_flags_start
&= ~TODO_mark_first_instance
;
1228 /* Indicate to register_dump_files that this pass has duplicates,
1229 and so it should rename the dump file. The first instance will
1230 be -1, and be number of duplicates = -static_pass_number - 1.
1231 Subsequent instances will be > 0 and just the duplicate number. */
1232 if ((new_pass
->name
&& new_pass
->name
[0] != '*') || track_duplicates
)
1234 initial_pass
->static_pass_number
-= 1;
1235 new_pass
->static_pass_number
= -initial_pass
->static_pass_number
;
1240 /* We're dealing with the first pass of its kind. */
1241 new_pass
->todo_flags_start
|= TODO_mark_first_instance
;
1242 new_pass
->static_pass_number
= -1;
1244 invoke_plugin_callbacks (PLUGIN_NEW_PASS
, new_pass
);
1248 /* Add a pass to the pass list. Duplicate the pass if it's already
1252 next_pass_1 (opt_pass
**list
, opt_pass
*pass
, opt_pass
*initial_pass
)
1254 /* Every pass should have a name so that plugins can refer to them. */
1255 gcc_assert (pass
->name
!= NULL
);
1257 add_pass_instance (pass
, false, initial_pass
);
1260 return &(*list
)->next
;
1263 /* List node for an inserted pass instance. We need to keep track of all
1264 the newly-added pass instances (with 'added_pass_nodes' defined below)
1265 so that we can register their dump files after pass-positioning is finished.
1266 Registering dumping files needs to be post-processed or the
1267 static_pass_number of the opt_pass object would be modified and mess up
1268 the dump file names of future pass instances to be added. */
1270 struct pass_list_node
1273 struct pass_list_node
*next
;
1276 static struct pass_list_node
*added_pass_nodes
= NULL
;
1277 static struct pass_list_node
*prev_added_pass_node
;
1279 /* Insert the pass at the proper position. Return true if the pass
1280 is successfully added.
1282 NEW_PASS_INFO - new pass to be inserted
1283 PASS_LIST - root of the pass list to insert the new pass to */
1286 position_pass (struct register_pass_info
*new_pass_info
, opt_pass
**pass_list
)
1288 opt_pass
*pass
= *pass_list
, *prev_pass
= NULL
;
1289 bool success
= false;
1291 for ( ; pass
; prev_pass
= pass
, pass
= pass
->next
)
1293 /* Check if the current pass is of the same type as the new pass and
1294 matches the name and the instance number of the reference pass. */
1295 if (pass
->type
== new_pass_info
->pass
->type
1297 && !strcmp (pass
->name
, new_pass_info
->reference_pass_name
)
1298 && ((new_pass_info
->ref_pass_instance_number
== 0)
1299 || (new_pass_info
->ref_pass_instance_number
==
1300 pass
->static_pass_number
)
1301 || (new_pass_info
->ref_pass_instance_number
== 1
1302 && pass
->todo_flags_start
& TODO_mark_first_instance
)))
1305 struct pass_list_node
*new_pass_node
;
1307 if (new_pass_info
->ref_pass_instance_number
== 0)
1309 new_pass
= new_pass_info
->pass
->clone ();
1310 add_pass_instance (new_pass
, true, new_pass_info
->pass
);
1314 new_pass
= new_pass_info
->pass
;
1315 add_pass_instance (new_pass
, true, new_pass
);
1318 /* Insert the new pass instance based on the positioning op. */
1319 switch (new_pass_info
->pos_op
)
1321 case PASS_POS_INSERT_AFTER
:
1322 new_pass
->next
= pass
->next
;
1323 pass
->next
= new_pass
;
1325 /* Skip newly inserted pass to avoid repeated
1326 insertions in the case where the new pass and the
1327 existing one have the same name. */
1330 case PASS_POS_INSERT_BEFORE
:
1331 new_pass
->next
= pass
;
1333 prev_pass
->next
= new_pass
;
1335 *pass_list
= new_pass
;
1337 case PASS_POS_REPLACE
:
1338 new_pass
->next
= pass
->next
;
1340 prev_pass
->next
= new_pass
;
1342 *pass_list
= new_pass
;
1343 new_pass
->sub
= pass
->sub
;
1344 new_pass
->tv_id
= pass
->tv_id
;
1348 error ("invalid pass positioning operation");
1352 /* Save the newly added pass (instance) in the added_pass_nodes
1353 list so that we can register its dump file later. Note that
1354 we cannot register the dump file now because doing so will modify
1355 the static_pass_number of the opt_pass object and therefore
1356 mess up the dump file name of future instances. */
1357 new_pass_node
= XCNEW (struct pass_list_node
);
1358 new_pass_node
->pass
= new_pass
;
1359 if (!added_pass_nodes
)
1360 added_pass_nodes
= new_pass_node
;
1362 prev_added_pass_node
->next
= new_pass_node
;
1363 prev_added_pass_node
= new_pass_node
;
1368 if (pass
->sub
&& position_pass (new_pass_info
, &pass
->sub
))
1375 /* Hooks a new pass into the pass lists.
1377 PASS_INFO - pass information that specifies the opt_pass object,
1378 reference pass, instance number, and how to position
1382 register_pass (struct register_pass_info
*pass_info
)
1384 g
->get_passes ()->register_pass (pass_info
);
1388 register_pass (opt_pass
* pass
, pass_positioning_ops pos
,
1389 const char* ref_pass_name
, int ref_pass_inst_number
)
1391 register_pass_info i
;
1393 i
.reference_pass_name
= ref_pass_name
;
1394 i
.ref_pass_instance_number
= ref_pass_inst_number
;
1397 g
->get_passes ()->register_pass (&i
);
1401 pass_manager::register_pass (struct register_pass_info
*pass_info
)
1403 bool all_instances
, success
;
1404 gcc::dump_manager
*dumps
= m_ctxt
->get_dumps ();
1406 /* The checks below could fail in buggy plugins. Existing GCC
1407 passes should never fail these checks, so we mention plugin in
1409 if (!pass_info
->pass
)
1410 fatal_error ("plugin cannot register a missing pass");
1412 if (!pass_info
->pass
->name
)
1413 fatal_error ("plugin cannot register an unnamed pass");
1415 if (!pass_info
->reference_pass_name
)
1417 ("plugin cannot register pass %qs without reference pass name",
1418 pass_info
->pass
->name
);
1420 /* Try to insert the new pass to the pass lists. We need to check
1421 all five lists as the reference pass could be in one (or all) of
1423 all_instances
= pass_info
->ref_pass_instance_number
== 0;
1424 success
= position_pass (pass_info
, &all_lowering_passes
);
1425 if (!success
|| all_instances
)
1426 success
|= position_pass (pass_info
, &all_small_ipa_passes
);
1427 if (!success
|| all_instances
)
1428 success
|= position_pass (pass_info
, &all_regular_ipa_passes
);
1429 if (!success
|| all_instances
)
1430 success
|= position_pass (pass_info
, &all_late_ipa_passes
);
1431 if (!success
|| all_instances
)
1432 success
|= position_pass (pass_info
, &all_passes
);
1435 ("pass %qs not found but is referenced by new pass %qs",
1436 pass_info
->reference_pass_name
, pass_info
->pass
->name
);
1438 /* OK, we have successfully inserted the new pass. We need to register
1439 the dump files for the newly added pass and its duplicates (if any).
1440 Because the registration of plugin/backend passes happens after the
1441 command-line options are parsed, the options that specify single
1442 pass dumping (e.g. -fdump-tree-PASSNAME) cannot be used for new
1443 passes. Therefore we currently can only enable dumping of
1444 new passes when the 'dump-all' flags (e.g. -fdump-tree-all)
1445 are specified. While doing so, we also delete the pass_list_node
1446 objects created during pass positioning. */
1447 while (added_pass_nodes
)
1449 struct pass_list_node
*next_node
= added_pass_nodes
->next
;
1450 enum tree_dump_index tdi
;
1451 register_one_dump_file (added_pass_nodes
->pass
);
1452 if (added_pass_nodes
->pass
->type
== SIMPLE_IPA_PASS
1453 || added_pass_nodes
->pass
->type
== IPA_PASS
)
1455 else if (added_pass_nodes
->pass
->type
== GIMPLE_PASS
)
1459 /* Check if dump-all flag is specified. */
1460 if (dumps
->get_dump_file_info (tdi
)->pstate
)
1461 dumps
->get_dump_file_info (added_pass_nodes
->pass
->static_pass_number
)
1462 ->pstate
= dumps
->get_dump_file_info (tdi
)->pstate
;
1463 XDELETE (added_pass_nodes
);
1464 added_pass_nodes
= next_node
;
1468 /* Construct the pass tree. The sequencing of passes is driven by
1469 the cgraph routines:
1471 finalize_compilation_unit ()
1472 for each node N in the cgraph
1473 cgraph_analyze_function (N)
1474 cgraph_lower_function (N) -> all_lowering_passes
1476 If we are optimizing, compile is then invoked:
1479 ipa_passes () -> all_small_ipa_passes
1480 -> Analysis of all_regular_ipa_passes
1481 * possible LTO streaming at copmilation time *
1482 -> Execution of all_regular_ipa_passes
1483 * possible LTO streaming at link time *
1484 -> all_late_ipa_passes
1485 expand_all_functions ()
1486 for each node N in the cgraph
1487 expand_function (N) -> Transformation of all_regular_ipa_passes
1492 pass_manager::operator new (size_t sz
)
1494 /* Ensure that all fields of the pass manager are zero-initialized. */
1495 return xcalloc (1, sz
);
1498 pass_manager::pass_manager (context
*ctxt
)
1499 : all_passes (NULL
), all_small_ipa_passes (NULL
), all_lowering_passes (NULL
),
1500 all_regular_ipa_passes (NULL
),
1501 all_late_ipa_passes (NULL
), passes_by_id (NULL
), passes_by_id_size (0),
1506 /* Initialize the pass_lists array. */
1507 #define DEF_PASS_LIST(LIST) pass_lists[PASS_LIST_NO_##LIST] = &LIST;
1509 #undef DEF_PASS_LIST
1511 /* Build the tree of passes. */
1513 #define INSERT_PASSES_AFTER(PASS) \
1516 #define PUSH_INSERT_PASSES_WITHIN(PASS) \
1518 opt_pass **p = &(PASS ## _1)->sub;
1520 #define POP_INSERT_PASSES() \
1523 #define NEXT_PASS(PASS, NUM) \
1525 gcc_assert (NULL == PASS ## _ ## NUM); \
1527 PASS ## _1 = make_##PASS (m_ctxt); \
1530 gcc_assert (PASS ## _1); \
1531 PASS ## _ ## NUM = PASS ## _1->clone (); \
1533 p = next_pass_1 (p, PASS ## _ ## NUM, PASS ## _1); \
1536 #define TERMINATE_PASS_LIST() \
1539 #include "pass-instances.def"
1541 #undef INSERT_PASSES_AFTER
1542 #undef PUSH_INSERT_PASSES_WITHIN
1543 #undef POP_INSERT_PASSES
1545 #undef TERMINATE_PASS_LIST
1547 /* Register the passes with the tree dump code. */
1548 register_dump_files (all_lowering_passes
, PROP_gimple_any
);
1549 register_dump_files (all_small_ipa_passes
,
1550 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
1552 register_dump_files (all_regular_ipa_passes
,
1553 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
1555 register_dump_files (all_late_ipa_passes
,
1556 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
1558 register_dump_files (all_passes
,
1559 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
1563 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
1564 function CALLBACK for every function in the call graph. Otherwise,
1565 call CALLBACK on the current function. */
1568 do_per_function (void (*callback
) (void *data
), void *data
)
1570 if (current_function_decl
)
1574 struct cgraph_node
*node
;
1575 FOR_EACH_DEFINED_FUNCTION (node
)
1576 if (node
->analyzed
&& gimple_has_body_p (node
->decl
)
1577 && (!node
->clone_of
|| node
->decl
!= node
->clone_of
->decl
))
1579 push_cfun (DECL_STRUCT_FUNCTION (node
->decl
));
1583 free_dominance_info (CDI_DOMINATORS
);
1584 free_dominance_info (CDI_POST_DOMINATORS
);
1592 /* Because inlining might remove no-longer reachable nodes, we need to
1593 keep the array visible to garbage collector to avoid reading collected
1596 static GTY ((length ("nnodes"))) cgraph_node_ptr
*order
;
1598 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
1599 function CALLBACK for every function in the call graph. Otherwise,
1600 call CALLBACK on the current function.
1601 This function is global so that plugins can use it. */
1603 do_per_function_toporder (void (*callback
) (void *data
), void *data
)
1607 if (current_function_decl
)
1611 gcc_assert (!order
);
1612 order
= ggc_alloc_vec_cgraph_node_ptr (cgraph_n_nodes
);
1613 nnodes
= ipa_reverse_postorder (order
);
1614 for (i
= nnodes
- 1; i
>= 0; i
--)
1615 order
[i
]->process
= 1;
1616 for (i
= nnodes
- 1; i
>= 0; i
--)
1618 struct cgraph_node
*node
= order
[i
];
1620 /* Allow possibly removed nodes to be garbage collected. */
1623 if (cgraph_function_with_gimple_body_p (node
))
1625 cgraph_get_body (node
);
1626 push_cfun (DECL_STRUCT_FUNCTION (node
->decl
));
1628 free_dominance_info (CDI_DOMINATORS
);
1629 free_dominance_info (CDI_POST_DOMINATORS
);
1640 /* Helper function to perform function body dump. */
1643 execute_function_dump (void *data
)
1645 opt_pass
*pass
= (opt_pass
*)data
;
1647 if (dump_file
&& current_function_decl
)
1649 if (cfun
->curr_properties
& PROP_trees
)
1650 dump_function_to_file (current_function_decl
, dump_file
, dump_flags
);
1652 print_rtl_with_bb (dump_file
, get_insns (), dump_flags
);
1654 /* Flush the file. If verification fails, we won't be able to
1655 close the file before aborting. */
1658 if ((cfun
->curr_properties
& PROP_cfg
)
1659 && (dump_flags
& TDF_GRAPH
))
1661 if (!pass
->graph_dump_initialized
)
1663 clean_graph_dump_file (dump_file_name
);
1664 pass
->graph_dump_initialized
= true;
1666 print_graph_cfg (dump_file_name
, cfun
);
1671 static struct profile_record
*profile_record
;
1673 /* Do profile consistency book-keeping for the pass with static number INDEX.
1674 If SUBPASS is zero, we run _before_ the pass, and if SUBPASS is one, then
1675 we run _after_ the pass. RUN is true if the pass really runs, or FALSE
1676 if we are only book-keeping on passes that may have selectively disabled
1677 themselves on a given function. */
1679 check_profile_consistency (int index
, int subpass
, bool run
)
1681 pass_manager
*passes
= g
->get_passes ();
1684 if (!profile_record
)
1685 profile_record
= XCNEWVEC (struct profile_record
,
1686 passes
->passes_by_id_size
);
1687 gcc_assert (index
< passes
->passes_by_id_size
&& index
>= 0);
1688 gcc_assert (subpass
< 2);
1689 profile_record
[index
].run
|= run
;
1690 account_profile_record (&profile_record
[index
], subpass
);
1693 /* Output profile consistency. */
1696 dump_profile_report (void)
1698 g
->get_passes ()->dump_profile_report ();
1702 pass_manager::dump_profile_report () const
1705 int last_freq_in
= 0, last_count_in
= 0, last_freq_out
= 0, last_count_out
= 0;
1706 gcov_type last_time
= 0, last_size
= 0;
1707 double rel_time_change
, rel_size_change
;
1708 int last_reported
= 0;
1710 if (!profile_record
)
1712 fprintf (stderr
, "\nProfile consistency report:\n\n");
1713 fprintf (stderr
, "Pass name |mismatch in |mismated out|Overall\n");
1714 fprintf (stderr
, " |freq count |freq count |size time\n");
1716 for (i
= 0; i
< passes_by_id_size
; i
++)
1717 for (j
= 0 ; j
< 2; j
++)
1718 if (profile_record
[i
].run
)
1721 rel_time_change
= (profile_record
[i
].time
[j
]
1722 - (double)last_time
) * 100 / (double)last_time
;
1724 rel_time_change
= 0;
1726 rel_size_change
= (profile_record
[i
].size
[j
]
1727 - (double)last_size
) * 100 / (double)last_size
;
1729 rel_size_change
= 0;
1731 if (profile_record
[i
].num_mismatched_freq_in
[j
] != last_freq_in
1732 || profile_record
[i
].num_mismatched_freq_out
[j
] != last_freq_out
1733 || profile_record
[i
].num_mismatched_count_in
[j
] != last_count_in
1734 || profile_record
[i
].num_mismatched_count_out
[j
] != last_count_out
1735 || rel_time_change
|| rel_size_change
)
1738 fprintf (stderr
, "%-20s %s",
1739 passes_by_id
[i
]->name
,
1740 j
? "(after TODO)" : " ");
1741 if (profile_record
[i
].num_mismatched_freq_in
[j
] != last_freq_in
)
1742 fprintf (stderr
, "| %+5i",
1743 profile_record
[i
].num_mismatched_freq_in
[j
]
1746 fprintf (stderr
, "| ");
1747 if (profile_record
[i
].num_mismatched_count_in
[j
] != last_count_in
)
1748 fprintf (stderr
, " %+5i",
1749 profile_record
[i
].num_mismatched_count_in
[j
]
1752 fprintf (stderr
, " ");
1753 if (profile_record
[i
].num_mismatched_freq_out
[j
] != last_freq_out
)
1754 fprintf (stderr
, "| %+5i",
1755 profile_record
[i
].num_mismatched_freq_out
[j
]
1758 fprintf (stderr
, "| ");
1759 if (profile_record
[i
].num_mismatched_count_out
[j
] != last_count_out
)
1760 fprintf (stderr
, " %+5i",
1761 profile_record
[i
].num_mismatched_count_out
[j
]
1764 fprintf (stderr
, " ");
1766 /* Size/time units change across gimple and RTL. */
1767 if (i
== pass_expand_1
->static_pass_number
)
1768 fprintf (stderr
, "|----------");
1771 if (rel_size_change
)
1772 fprintf (stderr
, "| %+8.4f%%", rel_size_change
);
1774 fprintf (stderr
, "| ");
1775 if (rel_time_change
)
1776 fprintf (stderr
, " %+8.4f%%", rel_time_change
);
1778 fprintf (stderr
, "\n");
1779 last_freq_in
= profile_record
[i
].num_mismatched_freq_in
[j
];
1780 last_freq_out
= profile_record
[i
].num_mismatched_freq_out
[j
];
1781 last_count_in
= profile_record
[i
].num_mismatched_count_in
[j
];
1782 last_count_out
= profile_record
[i
].num_mismatched_count_out
[j
];
1784 else if (j
&& last_reported
!= i
)
1787 fprintf (stderr
, "%-20s ------------| | |\n",
1788 passes_by_id
[i
]->name
);
1790 last_time
= profile_record
[i
].time
[j
];
1791 last_size
= profile_record
[i
].size
[j
];
1795 /* Perform all TODO actions that ought to be done on each function. */
1798 execute_function_todo (void *data
)
1800 unsigned int flags
= (size_t)data
;
1801 flags
&= ~cfun
->last_verified
;
1805 /* Always cleanup the CFG before trying to update SSA. */
1806 if (flags
& TODO_cleanup_cfg
)
1808 cleanup_tree_cfg ();
1810 /* When cleanup_tree_cfg merges consecutive blocks, it may
1811 perform some simplistic propagation when removing single
1812 valued PHI nodes. This propagation may, in turn, cause the
1813 SSA form to become out-of-date (see PR 22037). So, even
1814 if the parent pass had not scheduled an SSA update, we may
1815 still need to do one. */
1816 if (!(flags
& TODO_update_ssa_any
) && need_ssa_update_p (cfun
))
1817 flags
|= TODO_update_ssa
;
1820 if (flags
& TODO_update_ssa_any
)
1822 unsigned update_flags
= flags
& TODO_update_ssa_any
;
1823 update_ssa (update_flags
);
1824 cfun
->last_verified
&= ~TODO_verify_ssa
;
1827 if (flag_tree_pta
&& (flags
& TODO_rebuild_alias
))
1828 compute_may_aliases ();
1830 if (optimize
&& (flags
& TODO_update_address_taken
))
1831 execute_update_addresses_taken ();
1833 if (flags
& TODO_remove_unused_locals
)
1834 remove_unused_locals ();
1836 if (flags
& TODO_rebuild_frequencies
)
1837 rebuild_frequencies ();
1839 if (flags
& TODO_rebuild_cgraph_edges
)
1840 rebuild_cgraph_edges ();
1842 /* If we've seen errors do not bother running any verifiers. */
1846 #if defined ENABLE_CHECKING
1847 if (flags
& TODO_verify_ssa
1848 || (current_loops
&& loops_state_satisfies_p (LOOP_CLOSED_SSA
)))
1850 verify_gimple_in_cfg (cfun
);
1853 else if (flags
& TODO_verify_stmts
)
1854 verify_gimple_in_cfg (cfun
);
1855 if (flags
& TODO_verify_flow
)
1856 verify_flow_info ();
1857 if (current_loops
&& loops_state_satisfies_p (LOOP_CLOSED_SSA
))
1858 verify_loop_closed_ssa (false);
1859 if (flags
& TODO_verify_rtl_sharing
)
1860 verify_rtl_sharing ();
1863 cfun
->last_verified
= flags
& TODO_verify_all
;
1866 /* Perform all TODO actions. */
1868 execute_todo (unsigned int flags
)
1870 #if defined ENABLE_CHECKING
1872 && need_ssa_update_p (cfun
))
1873 gcc_assert (flags
& TODO_update_ssa_any
);
1876 timevar_push (TV_TODO
);
1878 /* Inform the pass whether it is the first time it is run. */
1879 first_pass_instance
= (flags
& TODO_mark_first_instance
) != 0;
1881 statistics_fini_pass ();
1884 do_per_function (execute_function_todo
, (void *)(size_t) flags
);
1886 /* Always remove functions just as before inlining: IPA passes might be
1887 interested to see bodies of extern inline functions that are not inlined
1888 to analyze side effects. The full removal is done just at the end
1889 of IPA pass queue. */
1890 if (flags
& TODO_remove_functions
)
1893 symtab_remove_unreachable_nodes (true, dump_file
);
1896 if ((flags
& TODO_dump_symtab
) && dump_file
&& !current_function_decl
)
1899 dump_symtab (dump_file
);
1900 /* Flush the file. If verification fails, we won't be able to
1901 close the file before aborting. */
1905 /* Now that the dumping has been done, we can get rid of the optional
1907 if (flags
& TODO_df_finish
)
1908 df_finish_pass ((flags
& TODO_df_verify
) != 0);
1910 timevar_pop (TV_TODO
);
1913 /* Verify invariants that should hold between passes. This is a place
1914 to put simple sanity checks. */
1917 verify_interpass_invariants (void)
1919 gcc_checking_assert (!fold_deferring_overflow_warnings_p ());
1922 /* Clear the last verified flag. */
1925 clear_last_verified (void *data ATTRIBUTE_UNUSED
)
1927 cfun
->last_verified
= 0;
1930 /* Helper function. Verify that the properties has been turn into the
1931 properties expected by the pass. */
1933 #ifdef ENABLE_CHECKING
1935 verify_curr_properties (void *data
)
1937 unsigned int props
= (size_t)data
;
1938 gcc_assert ((cfun
->curr_properties
& props
) == props
);
1942 /* Initialize pass dump file. */
1943 /* This is non-static so that the plugins can use it. */
1946 pass_init_dump_file (opt_pass
*pass
)
1948 pass
->graph_dump_initialized
= false;
1949 /* If a dump file name is present, open it if enabled. */
1950 if (pass
->static_pass_number
!= -1)
1952 timevar_push (TV_DUMP
);
1953 gcc::dump_manager
*dumps
= g
->get_dumps ();
1954 bool initializing_dump
=
1955 !dumps
->dump_initialized_p (pass
->static_pass_number
);
1956 dump_file_name
= dumps
->get_dump_file_name (pass
->static_pass_number
);
1957 dumps
->dump_start (pass
->static_pass_number
, &dump_flags
);
1958 if (dump_file
&& current_function_decl
)
1959 dump_function_header (dump_file
, current_function_decl
, dump_flags
);
1960 if (initializing_dump
1961 && dump_file
&& (dump_flags
& TDF_GRAPH
)
1962 && cfun
&& (cfun
->curr_properties
& PROP_cfg
))
1964 clean_graph_dump_file (dump_file_name
);
1965 pass
->graph_dump_initialized
= true;
1967 timevar_pop (TV_DUMP
);
1968 return initializing_dump
;
1974 /* Flush PASS dump file. */
1975 /* This is non-static so that plugins can use it. */
1978 pass_fini_dump_file (opt_pass
*pass
)
1980 timevar_push (TV_DUMP
);
1982 /* Flush and close dump file. */
1985 free (CONST_CAST (char *, dump_file_name
));
1986 dump_file_name
= NULL
;
1989 g
->get_dumps ()->dump_finish (pass
->static_pass_number
);
1990 timevar_pop (TV_DUMP
);
1993 /* After executing the pass, apply expected changes to the function
1997 update_properties_after_pass (void *data
)
1999 opt_pass
*pass
= (opt_pass
*) data
;
2000 cfun
->curr_properties
= (cfun
->curr_properties
| pass
->properties_provided
)
2001 & ~pass
->properties_destroyed
;
2004 /* Execute summary generation for all of the passes in IPA_PASS. */
2007 execute_ipa_summary_passes (ipa_opt_pass_d
*ipa_pass
)
2011 opt_pass
*pass
= ipa_pass
;
2013 /* Execute all of the IPA_PASSes in the list. */
2014 if (ipa_pass
->type
== IPA_PASS
2015 && ((!pass
->has_gate
) || pass
->gate ())
2016 && ipa_pass
->generate_summary
)
2018 pass_init_dump_file (pass
);
2020 /* If a timevar is present, start it. */
2022 timevar_push (pass
->tv_id
);
2024 ipa_pass
->generate_summary ();
2028 timevar_pop (pass
->tv_id
);
2030 pass_fini_dump_file (pass
);
2032 ipa_pass
= (ipa_opt_pass_d
*)ipa_pass
->next
;
2036 /* Execute IPA_PASS function transform on NODE. */
2039 execute_one_ipa_transform_pass (struct cgraph_node
*node
,
2040 ipa_opt_pass_d
*ipa_pass
)
2042 opt_pass
*pass
= ipa_pass
;
2043 unsigned int todo_after
= 0;
2045 current_pass
= pass
;
2046 if (!ipa_pass
->function_transform
)
2049 /* Note that the folders should only create gimple expressions.
2050 This is a hack until the new folder is ready. */
2051 in_gimple_form
= (cfun
&& (cfun
->curr_properties
& PROP_trees
)) != 0;
2053 pass_init_dump_file (pass
);
2055 /* Run pre-pass verification. */
2056 execute_todo (ipa_pass
->function_transform_todo_flags_start
);
2058 /* If a timevar is present, start it. */
2059 if (pass
->tv_id
!= TV_NONE
)
2060 timevar_push (pass
->tv_id
);
2063 todo_after
= ipa_pass
->function_transform (node
);
2066 if (pass
->tv_id
!= TV_NONE
)
2067 timevar_pop (pass
->tv_id
);
2069 if (profile_report
&& cfun
&& (cfun
->curr_properties
& PROP_cfg
))
2070 check_profile_consistency (pass
->static_pass_number
, 0, true);
2072 /* Run post-pass cleanup and verification. */
2073 execute_todo (todo_after
);
2074 verify_interpass_invariants ();
2075 if (profile_report
&& cfun
&& (cfun
->curr_properties
& PROP_cfg
))
2076 check_profile_consistency (pass
->static_pass_number
, 1, true);
2079 do_per_function (execute_function_dump
, NULL
);
2080 pass_fini_dump_file (pass
);
2082 current_pass
= NULL
;
2084 /* Signal this is a suitable GC collection point. */
2085 if (!(todo_after
& TODO_do_not_ggc_collect
))
2089 /* For the current function, execute all ipa transforms. */
2092 execute_all_ipa_transforms (void)
2094 struct cgraph_node
*node
;
2097 node
= cgraph_get_node (current_function_decl
);
2099 if (node
->ipa_transforms_to_apply
.exists ())
2103 for (i
= 0; i
< node
->ipa_transforms_to_apply
.length (); i
++)
2104 execute_one_ipa_transform_pass (node
, node
->ipa_transforms_to_apply
[i
]);
2105 node
->ipa_transforms_to_apply
.release ();
2109 /* Callback for do_per_function to apply all IPA transforms. */
2112 apply_ipa_transforms (void *data
)
2114 struct cgraph_node
*node
= cgraph_get_node (current_function_decl
);
2115 if (!node
->global
.inlined_to
&& node
->ipa_transforms_to_apply
.exists ())
2117 *(bool *)data
= true;
2118 execute_all_ipa_transforms ();
2119 rebuild_cgraph_edges ();
2123 /* Check if PASS is explicitly disabled or enabled and return
2124 the gate status. FUNC is the function to be processed, and
2125 GATE_STATUS is the gate status determined by pass manager by
2129 override_gate_status (opt_pass
*pass
, tree func
, bool gate_status
)
2131 bool explicitly_enabled
= false;
2132 bool explicitly_disabled
= false;
2135 = is_pass_explicitly_enabled_or_disabled (pass
, func
,
2136 enabled_pass_uid_range_tab
);
2138 = is_pass_explicitly_enabled_or_disabled (pass
, func
,
2139 disabled_pass_uid_range_tab
);
2141 gate_status
= !explicitly_disabled
&& (gate_status
|| explicitly_enabled
);
2150 execute_one_pass (opt_pass
*pass
)
2152 unsigned int todo_after
= 0;
2156 /* IPA passes are executed on whole program, so cfun should be NULL.
2157 Other passes need function context set. */
2158 if (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
)
2159 gcc_assert (!cfun
&& !current_function_decl
);
2161 gcc_assert (cfun
&& current_function_decl
);
2163 current_pass
= pass
;
2165 /* Check whether gate check should be avoided.
2166 User controls the value of the gate through the parameter "gate_status". */
2167 gate_status
= pass
->has_gate
? pass
->gate () : true;
2168 gate_status
= override_gate_status (pass
, current_function_decl
, gate_status
);
2170 /* Override gate with plugin. */
2171 invoke_plugin_callbacks (PLUGIN_OVERRIDE_GATE
, &gate_status
);
2175 /* Run so passes selectively disabling themselves on a given function
2176 are not miscounted. */
2177 if (profile_report
&& cfun
&& (cfun
->curr_properties
& PROP_cfg
))
2179 check_profile_consistency (pass
->static_pass_number
, 0, false);
2180 check_profile_consistency (pass
->static_pass_number
, 1, false);
2182 current_pass
= NULL
;
2186 /* Pass execution event trigger: useful to identify passes being
2188 invoke_plugin_callbacks (PLUGIN_PASS_EXECUTION
, pass
);
2190 /* SIPLE IPA passes do not handle callgraphs with IPA transforms in it.
2191 Apply all trnasforms first. */
2192 if (pass
->type
== SIMPLE_IPA_PASS
)
2194 bool applied
= false;
2195 do_per_function (apply_ipa_transforms
, (void *)&applied
);
2197 symtab_remove_unreachable_nodes (true, dump_file
);
2198 /* Restore current_pass. */
2199 current_pass
= pass
;
2202 if (!quiet_flag
&& !cfun
)
2203 fprintf (stderr
, " <%s>", pass
->name
? pass
->name
: "");
2205 /* Note that the folders should only create gimple expressions.
2206 This is a hack until the new folder is ready. */
2207 in_gimple_form
= (cfun
&& (cfun
->curr_properties
& PROP_trees
)) != 0;
2209 pass_init_dump_file (pass
);
2211 /* Run pre-pass verification. */
2212 execute_todo (pass
->todo_flags_start
);
2214 #ifdef ENABLE_CHECKING
2215 do_per_function (verify_curr_properties
,
2216 (void *)(size_t)pass
->properties_required
);
2219 /* If a timevar is present, start it. */
2220 if (pass
->tv_id
!= TV_NONE
)
2221 timevar_push (pass
->tv_id
);
2224 if (pass
->has_execute
)
2226 todo_after
= pass
->execute ();
2227 do_per_function (clear_last_verified
, NULL
);
2231 if (pass
->tv_id
!= TV_NONE
)
2232 timevar_pop (pass
->tv_id
);
2234 do_per_function (update_properties_after_pass
, pass
);
2236 if (profile_report
&& cfun
&& (cfun
->curr_properties
& PROP_cfg
))
2237 check_profile_consistency (pass
->static_pass_number
, 0, true);
2239 /* Run post-pass cleanup and verification. */
2240 execute_todo (todo_after
| pass
->todo_flags_finish
);
2241 if (profile_report
&& cfun
&& (cfun
->curr_properties
& PROP_cfg
))
2242 check_profile_consistency (pass
->static_pass_number
, 1, true);
2244 verify_interpass_invariants ();
2246 do_per_function (execute_function_dump
, pass
);
2247 if (pass
->type
== IPA_PASS
)
2249 struct cgraph_node
*node
;
2250 FOR_EACH_FUNCTION_WITH_GIMPLE_BODY (node
)
2251 node
->ipa_transforms_to_apply
.safe_push ((ipa_opt_pass_d
*)pass
);
2254 if (!current_function_decl
)
2255 cgraph_process_new_functions ();
2257 pass_fini_dump_file (pass
);
2259 if (pass
->type
!= SIMPLE_IPA_PASS
&& pass
->type
!= IPA_PASS
)
2260 gcc_assert (!(cfun
->curr_properties
& PROP_trees
)
2261 || pass
->type
!= RTL_PASS
);
2263 current_pass
= NULL
;
2265 /* Signal this is a suitable GC collection point. */
2266 if (!((todo_after
| pass
->todo_flags_finish
) & TODO_do_not_ggc_collect
))
2273 execute_pass_list (opt_pass
*pass
)
2277 gcc_assert (pass
->type
== GIMPLE_PASS
2278 || pass
->type
== RTL_PASS
);
2279 if (execute_one_pass (pass
) && pass
->sub
)
2280 execute_pass_list (pass
->sub
);
2286 /* Write out all LTO data. */
2290 timevar_push (TV_IPA_LTO_GIMPLE_OUT
);
2292 timevar_pop (TV_IPA_LTO_GIMPLE_OUT
);
2293 timevar_push (TV_IPA_LTO_DECL_OUT
);
2294 produce_asm_for_decls ();
2295 timevar_pop (TV_IPA_LTO_DECL_OUT
);
2298 /* Same as execute_pass_list but assume that subpasses of IPA passes
2299 are local passes. If SET is not NULL, write out summaries of only
2300 those node in SET. */
2303 ipa_write_summaries_2 (opt_pass
*pass
, struct lto_out_decl_state
*state
)
2307 ipa_opt_pass_d
*ipa_pass
= (ipa_opt_pass_d
*)pass
;
2308 gcc_assert (!current_function_decl
);
2310 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
2311 if (pass
->type
== IPA_PASS
2312 && ipa_pass
->write_summary
2313 && ((!pass
->has_gate
) || pass
->gate ()))
2315 /* If a timevar is present, start it. */
2317 timevar_push (pass
->tv_id
);
2319 pass_init_dump_file (pass
);
2321 ipa_pass
->write_summary ();
2323 pass_fini_dump_file (pass
);
2325 /* If a timevar is present, start it. */
2327 timevar_pop (pass
->tv_id
);
2330 if (pass
->sub
&& pass
->sub
->type
!= GIMPLE_PASS
)
2331 ipa_write_summaries_2 (pass
->sub
, state
);
2337 /* Helper function of ipa_write_summaries. Creates and destroys the
2338 decl state and calls ipa_write_summaries_2 for all passes that have
2339 summaries. SET is the set of nodes to be written. */
2342 ipa_write_summaries_1 (lto_symtab_encoder_t encoder
)
2344 pass_manager
*passes
= g
->get_passes ();
2345 struct lto_out_decl_state
*state
= lto_new_out_decl_state ();
2346 state
->symtab_node_encoder
= encoder
;
2348 lto_push_out_decl_state (state
);
2350 gcc_assert (!flag_wpa
);
2351 ipa_write_summaries_2 (passes
->all_regular_ipa_passes
, state
);
2355 gcc_assert (lto_get_out_decl_state () == state
);
2356 lto_pop_out_decl_state ();
2357 lto_delete_out_decl_state (state
);
2360 /* Write out summaries for all the nodes in the callgraph. */
2363 ipa_write_summaries (void)
2365 lto_symtab_encoder_t encoder
;
2367 varpool_node
*vnode
;
2368 struct cgraph_node
*node
;
2369 struct cgraph_node
**order
;
2371 if (!flag_generate_lto
|| seen_error ())
2374 encoder
= lto_symtab_encoder_new (false);
2376 /* Create the callgraph set in the same order used in
2377 cgraph_expand_all_functions. This mostly facilitates debugging,
2378 since it causes the gimple file to be processed in the same order
2379 as the source code. */
2380 order
= XCNEWVEC (struct cgraph_node
*, cgraph_n_nodes
);
2381 order_pos
= ipa_reverse_postorder (order
);
2382 gcc_assert (order_pos
== cgraph_n_nodes
);
2384 for (i
= order_pos
- 1; i
>= 0; i
--)
2386 struct cgraph_node
*node
= order
[i
];
2388 if (cgraph_function_with_gimple_body_p (node
))
2390 /* When streaming out references to statements as part of some IPA
2391 pass summary, the statements need to have uids assigned and the
2392 following does that for all the IPA passes here. Naturally, this
2393 ordering then matches the one IPA-passes get in their stmt_fixup
2396 push_cfun (DECL_STRUCT_FUNCTION (node
->decl
));
2397 renumber_gimple_stmt_uids ();
2400 if (node
->definition
)
2401 lto_set_symtab_encoder_in_partition (encoder
, node
);
2404 FOR_EACH_DEFINED_FUNCTION (node
)
2406 lto_set_symtab_encoder_in_partition (encoder
, node
);
2407 FOR_EACH_DEFINED_VARIABLE (vnode
)
2408 lto_set_symtab_encoder_in_partition (encoder
, vnode
);
2410 ipa_write_summaries_1 (compute_ltrans_boundary (encoder
));
2415 /* Same as execute_pass_list but assume that subpasses of IPA passes
2416 are local passes. If SET is not NULL, write out optimization summaries of
2417 only those node in SET. */
2420 ipa_write_optimization_summaries_1 (opt_pass
*pass
,
2421 struct lto_out_decl_state
*state
)
2425 ipa_opt_pass_d
*ipa_pass
= (ipa_opt_pass_d
*)pass
;
2426 gcc_assert (!current_function_decl
);
2428 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
2429 if (pass
->type
== IPA_PASS
2430 && ipa_pass
->write_optimization_summary
2431 && ((!pass
->has_gate
) || pass
->gate ()))
2433 /* If a timevar is present, start it. */
2435 timevar_push (pass
->tv_id
);
2437 pass_init_dump_file (pass
);
2439 ipa_pass
->write_optimization_summary ();
2441 pass_fini_dump_file (pass
);
2443 /* If a timevar is present, start it. */
2445 timevar_pop (pass
->tv_id
);
2448 if (pass
->sub
&& pass
->sub
->type
!= GIMPLE_PASS
)
2449 ipa_write_optimization_summaries_1 (pass
->sub
, state
);
2455 /* Write all the optimization summaries for the cgraph nodes in SET. If SET is
2456 NULL, write out all summaries of all nodes. */
2459 ipa_write_optimization_summaries (lto_symtab_encoder_t encoder
)
2461 struct lto_out_decl_state
*state
= lto_new_out_decl_state ();
2462 lto_symtab_encoder_iterator lsei
;
2463 state
->symtab_node_encoder
= encoder
;
2465 lto_push_out_decl_state (state
);
2466 for (lsei
= lsei_start_function_in_partition (encoder
);
2467 !lsei_end_p (lsei
); lsei_next_function_in_partition (&lsei
))
2469 struct cgraph_node
*node
= lsei_cgraph_node (lsei
);
2470 /* When streaming out references to statements as part of some IPA
2471 pass summary, the statements need to have uids assigned.
2473 For functions newly born at WPA stage we need to initialize
2475 if (node
->definition
2476 && gimple_has_body_p (node
->decl
))
2478 push_cfun (DECL_STRUCT_FUNCTION (node
->decl
));
2479 renumber_gimple_stmt_uids ();
2484 gcc_assert (flag_wpa
);
2485 pass_manager
*passes
= g
->get_passes ();
2486 ipa_write_optimization_summaries_1 (passes
->all_regular_ipa_passes
, state
);
2490 gcc_assert (lto_get_out_decl_state () == state
);
2491 lto_pop_out_decl_state ();
2492 lto_delete_out_decl_state (state
);
2495 /* Same as execute_pass_list but assume that subpasses of IPA passes
2496 are local passes. */
2499 ipa_read_summaries_1 (opt_pass
*pass
)
2503 ipa_opt_pass_d
*ipa_pass
= (ipa_opt_pass_d
*) pass
;
2505 gcc_assert (!current_function_decl
);
2507 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
2509 if ((!pass
->has_gate
) || pass
->gate ())
2511 if (pass
->type
== IPA_PASS
&& ipa_pass
->read_summary
)
2513 /* If a timevar is present, start it. */
2515 timevar_push (pass
->tv_id
);
2517 pass_init_dump_file (pass
);
2519 ipa_pass
->read_summary ();
2521 pass_fini_dump_file (pass
);
2525 timevar_pop (pass
->tv_id
);
2528 if (pass
->sub
&& pass
->sub
->type
!= GIMPLE_PASS
)
2529 ipa_read_summaries_1 (pass
->sub
);
2536 /* Read all the summaries for all_regular_ipa_passes. */
2539 ipa_read_summaries (void)
2541 pass_manager
*passes
= g
->get_passes ();
2542 ipa_read_summaries_1 (passes
->all_regular_ipa_passes
);
2545 /* Same as execute_pass_list but assume that subpasses of IPA passes
2546 are local passes. */
2549 ipa_read_optimization_summaries_1 (opt_pass
*pass
)
2553 ipa_opt_pass_d
*ipa_pass
= (ipa_opt_pass_d
*) pass
;
2555 gcc_assert (!current_function_decl
);
2557 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
2559 if ((!pass
->has_gate
) || pass
->gate ())
2561 if (pass
->type
== IPA_PASS
&& ipa_pass
->read_optimization_summary
)
2563 /* If a timevar is present, start it. */
2565 timevar_push (pass
->tv_id
);
2567 pass_init_dump_file (pass
);
2569 ipa_pass
->read_optimization_summary ();
2571 pass_fini_dump_file (pass
);
2575 timevar_pop (pass
->tv_id
);
2578 if (pass
->sub
&& pass
->sub
->type
!= GIMPLE_PASS
)
2579 ipa_read_optimization_summaries_1 (pass
->sub
);
2585 /* Read all the summaries for all_regular_ipa_passes. */
2588 ipa_read_optimization_summaries (void)
2590 pass_manager
*passes
= g
->get_passes ();
2591 ipa_read_optimization_summaries_1 (passes
->all_regular_ipa_passes
);
2594 /* Same as execute_pass_list but assume that subpasses of IPA passes
2595 are local passes. */
2597 execute_ipa_pass_list (opt_pass
*pass
)
2601 gcc_assert (!current_function_decl
);
2603 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
2604 if (execute_one_pass (pass
) && pass
->sub
)
2606 if (pass
->sub
->type
== GIMPLE_PASS
)
2608 invoke_plugin_callbacks (PLUGIN_EARLY_GIMPLE_PASSES_START
, NULL
);
2609 do_per_function_toporder ((void (*)(void *))execute_pass_list
,
2611 invoke_plugin_callbacks (PLUGIN_EARLY_GIMPLE_PASSES_END
, NULL
);
2613 else if (pass
->sub
->type
== SIMPLE_IPA_PASS
2614 || pass
->sub
->type
== IPA_PASS
)
2615 execute_ipa_pass_list (pass
->sub
);
2619 gcc_assert (!current_function_decl
);
2620 cgraph_process_new_functions ();
2626 /* Execute stmt fixup hooks of all passes in PASS for NODE and STMTS. */
2629 execute_ipa_stmt_fixups (opt_pass
*pass
,
2630 struct cgraph_node
*node
, gimple
*stmts
)
2634 /* Execute all of the IPA_PASSes in the list. */
2635 if (pass
->type
== IPA_PASS
2636 && ((!pass
->has_gate
) || pass
->gate ()))
2638 ipa_opt_pass_d
*ipa_pass
= (ipa_opt_pass_d
*) pass
;
2640 if (ipa_pass
->stmt_fixup
)
2642 pass_init_dump_file (pass
);
2643 /* If a timevar is present, start it. */
2645 timevar_push (pass
->tv_id
);
2647 ipa_pass
->stmt_fixup (node
, stmts
);
2651 timevar_pop (pass
->tv_id
);
2652 pass_fini_dump_file (pass
);
2655 execute_ipa_stmt_fixups (pass
->sub
, node
, stmts
);
2661 /* Execute stmt fixup hooks of all IPA passes for NODE and STMTS. */
2664 execute_all_ipa_stmt_fixups (struct cgraph_node
*node
, gimple
*stmts
)
2666 pass_manager
*passes
= g
->get_passes ();
2667 execute_ipa_stmt_fixups (passes
->all_regular_ipa_passes
, node
, stmts
);
2671 extern void debug_properties (unsigned int);
2672 extern void dump_properties (FILE *, unsigned int);
2675 dump_properties (FILE *dump
, unsigned int props
)
2677 fprintf (dump
, "Properties:\n");
2678 if (props
& PROP_gimple_any
)
2679 fprintf (dump
, "PROP_gimple_any\n");
2680 if (props
& PROP_gimple_lcf
)
2681 fprintf (dump
, "PROP_gimple_lcf\n");
2682 if (props
& PROP_gimple_leh
)
2683 fprintf (dump
, "PROP_gimple_leh\n");
2684 if (props
& PROP_cfg
)
2685 fprintf (dump
, "PROP_cfg\n");
2686 if (props
& PROP_ssa
)
2687 fprintf (dump
, "PROP_ssa\n");
2688 if (props
& PROP_no_crit_edges
)
2689 fprintf (dump
, "PROP_no_crit_edges\n");
2690 if (props
& PROP_rtl
)
2691 fprintf (dump
, "PROP_rtl\n");
2692 if (props
& PROP_gimple_lomp
)
2693 fprintf (dump
, "PROP_gimple_lomp\n");
2694 if (props
& PROP_gimple_lcx
)
2695 fprintf (dump
, "PROP_gimple_lcx\n");
2696 if (props
& PROP_gimple_lvec
)
2697 fprintf (dump
, "PROP_gimple_lvec\n");
2698 if (props
& PROP_cfglayout
)
2699 fprintf (dump
, "PROP_cfglayout\n");
2703 debug_properties (unsigned int props
)
2705 dump_properties (stderr
, props
);
2708 /* Called by local passes to see if function is called by already processed nodes.
2709 Because we process nodes in topological order, this means that function is
2710 in recursive cycle or we introduced new direct calls. */
2712 function_called_by_processed_nodes_p (void)
2714 struct cgraph_edge
*e
;
2715 for (e
= cgraph_get_node (current_function_decl
)->callers
;
2719 if (e
->caller
->decl
== current_function_decl
)
2721 if (!cgraph_function_with_gimple_body_p (e
->caller
))
2723 if (TREE_ASM_WRITTEN (e
->caller
->decl
))
2725 if (!e
->caller
->process
&& !e
->caller
->global
.inlined_to
)
2730 fprintf (dump_file
, "Already processed call to:\n");
2731 dump_cgraph_node (dump_file
, e
->caller
);
2736 #include "gt-passes.h"