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"
30 #include "hash-table.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"
51 #include "diagnostic-core.h"
56 #include "langhooks.h"
58 #include "hosthooks.h"
62 #include "value-prof.h"
63 #include "tree-inline.h"
64 #include "tree-flow.h"
65 #include "tree-pass.h"
66 #include "tree-dump.h"
69 #include "lto-streamer.h"
71 #include "ipa-utils.h"
72 #include "tree-pretty-print.h" /* for dump_function_header */
74 #include "pass_manager.h"
78 /* This is used for debugging. It allows the current pass to printed
79 from anywhere in compilation.
80 The variable current_pass is also used for statistics and plugins. */
81 struct opt_pass
*current_pass
;
83 static void register_pass_name (struct opt_pass
*, const char *);
85 /* Most passes are single-instance (within their context) and thus don't
86 need to implement cloning, but passes that support multiple instances
87 *must* provide their own implementation of the clone method.
89 Handle this by providing a default implemenation, but make it a fatal
95 internal_error ("pass %s does not support cloning", name
);
110 opt_pass::opt_pass(const pass_data
&data
, context
*ctxt
)
114 static_pass_number(0),
121 pass_manager::execute_early_local_passes ()
123 execute_pass_list (pass_early_local_passes_1
->sub
);
127 pass_manager::execute_pass_mode_switching ()
129 return pass_mode_switching_1
->execute ();
133 /* Call from anywhere to find out what pass this is. Useful for
134 printing out debugging information deep inside an service
137 print_current_pass (FILE *file
)
140 fprintf (file
, "current pass = %s (%d)\n",
141 current_pass
->name
, current_pass
->static_pass_number
);
143 fprintf (file
, "no current pass.\n");
147 /* Call from the debugger to get the current pass name. */
151 print_current_pass (stderr
);
156 /* Global variables used to communicate with passes. */
158 bool first_pass_instance
;
161 /* This is called from various places for FUNCTION_DECL, VAR_DECL,
164 This does nothing for local (non-static) variables, unless the
165 variable is a register variable with DECL_ASSEMBLER_NAME set. In
166 that case, or if the variable is not an automatic, it sets up the
167 RTL and outputs any assembler code (label definition, storage
168 allocation and initialization).
170 DECL is the declaration. TOP_LEVEL is nonzero
171 if this declaration is not within a function. */
174 rest_of_decl_compilation (tree decl
,
178 /* We deferred calling assemble_alias so that we could collect
179 other attributes such as visibility. Emit the alias now. */
183 alias
= lookup_attribute ("alias", DECL_ATTRIBUTES (decl
));
186 alias
= TREE_VALUE (TREE_VALUE (alias
));
187 alias
= get_identifier (TREE_STRING_POINTER (alias
));
188 /* A quirk of the initial implementation of aliases required that the
189 user add "extern" to all of them. Which is silly, but now
190 historical. Do note that the symbol is in fact locally defined. */
191 DECL_EXTERNAL (decl
) = 0;
192 TREE_STATIC (decl
) = 1;
193 assemble_alias (decl
, alias
);
197 /* Can't defer this, because it needs to happen before any
198 later function definitions are processed. */
199 if (DECL_ASSEMBLER_NAME_SET_P (decl
) && DECL_REGISTER (decl
))
200 make_decl_rtl (decl
);
202 /* Forward declarations for nested functions are not "external",
203 but we need to treat them as if they were. */
204 if (TREE_STATIC (decl
) || DECL_EXTERNAL (decl
)
205 || TREE_CODE (decl
) == FUNCTION_DECL
)
207 timevar_push (TV_VARCONST
);
209 /* Don't output anything when a tentative file-scope definition
210 is seen. But at end of compilation, do output code for them.
212 We do output all variables and rely on
213 callgraph code to defer them except for forward declarations
214 (see gcc.c-torture/compile/920624-1.c) */
216 || !DECL_DEFER_OUTPUT (decl
)
217 || DECL_INITIAL (decl
))
218 && (TREE_CODE (decl
) != VAR_DECL
|| !DECL_HAS_VALUE_EXPR_P (decl
))
219 && !DECL_EXTERNAL (decl
))
221 /* When reading LTO unit, we also read varpool, so do not
223 if (in_lto_p
&& !at_end
)
225 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
226 varpool_finalize_decl (decl
);
229 #ifdef ASM_FINISH_DECLARE_OBJECT
230 if (decl
== last_assemble_variable_decl
)
232 ASM_FINISH_DECLARE_OBJECT (asm_out_file
, decl
,
237 timevar_pop (TV_VARCONST
);
239 else if (TREE_CODE (decl
) == TYPE_DECL
240 /* Like in rest_of_type_compilation, avoid confusing the debug
241 information machinery when there are errors. */
244 timevar_push (TV_SYMOUT
);
245 debug_hooks
->type_decl (decl
, !top_level
);
246 timevar_pop (TV_SYMOUT
);
249 /* Let cgraph know about the existence of variables. */
250 if (in_lto_p
&& !at_end
)
252 else if (TREE_CODE (decl
) == VAR_DECL
&& !DECL_EXTERNAL (decl
)
253 && TREE_STATIC (decl
))
254 varpool_node_for_decl (decl
);
257 /* Called after finishing a record, union or enumeral type. */
260 rest_of_type_compilation (tree type
, int toplev
)
262 /* Avoid confusing the debug information machinery when there are
267 timevar_push (TV_SYMOUT
);
268 debug_hooks
->type_decl (TYPE_STUB_DECL (type
), !toplev
);
269 timevar_pop (TV_SYMOUT
);
276 finish_optimization_passes (void)
279 struct dump_file_info
*dfi
;
282 timevar_push (TV_DUMP
);
283 if (profile_arc_flag
|| flag_test_coverage
|| flag_branch_probabilities
)
285 dump_start (pass_profile_1
->static_pass_number
, NULL
);
287 dump_finish (pass_profile_1
->static_pass_number
);
292 dump_start (pass_profile_1
->static_pass_number
, NULL
);
293 print_combine_total_stats ();
294 dump_finish (pass_profile_1
->static_pass_number
);
297 /* Do whatever is necessary to finish printing the graphs. */
298 for (i
= TDI_end
; (dfi
= get_dump_file_info (i
)) != NULL
; ++i
)
299 if (dump_initialized_p (i
)
300 && (dfi
->pflags
& TDF_GRAPH
) != 0
301 && (name
= get_dump_file_name (i
)) != NULL
)
303 finish_graph_dump_file (name
);
307 timevar_pop (TV_DUMP
);
311 execute_all_early_local_passes (void)
313 /* Once this pass (and its sub-passes) are complete, all functions
314 will be in SSA form. Technically this state change is happening
315 a tad early, since the sub-passes have not yet run, but since
316 none of the sub-passes are IPA passes and do not create new
317 functions, this is ok. We're setting this value for the benefit
318 of IPA passes that follow. */
319 if (cgraph_state
< CGRAPH_STATE_IPA_SSA
)
320 cgraph_state
= CGRAPH_STATE_IPA_SSA
;
324 /* Gate: execute, or not, all of the non-trivial optimizations. */
327 gate_all_early_local_passes (void)
329 /* Don't bother doing anything if the program has errors. */
330 return (!seen_error () && !in_lto_p
);
335 const pass_data pass_data_early_local_passes
=
337 SIMPLE_IPA_PASS
, /* type */
338 "early_local_cleanups", /* name */
339 OPTGROUP_NONE
, /* optinfo_flags */
341 true, /* has_execute */
342 TV_EARLY_LOCAL
, /* tv_id */
343 0, /* properties_required */
344 0, /* properties_provided */
345 0, /* properties_destroyed */
346 0, /* todo_flags_start */
347 TODO_remove_functions
, /* todo_flags_finish */
350 class pass_early_local_passes
: public simple_ipa_opt_pass
353 pass_early_local_passes(gcc::context
*ctxt
)
354 : simple_ipa_opt_pass(pass_data_early_local_passes
, ctxt
)
357 /* opt_pass methods: */
358 bool gate () { return gate_all_early_local_passes (); }
359 unsigned int execute () { return execute_all_early_local_passes (); }
361 }; // class pass_early_local_passes
365 simple_ipa_opt_pass
*
366 make_pass_early_local_passes (gcc::context
*ctxt
)
368 return new pass_early_local_passes (ctxt
);
371 /* Gate: execute, or not, all of the non-trivial optimizations. */
374 gate_all_early_optimizations (void)
376 return (optimize
>= 1
377 /* Don't bother doing anything if the program has errors. */
383 const pass_data pass_data_all_early_optimizations
=
385 GIMPLE_PASS
, /* type */
386 "early_optimizations", /* name */
387 OPTGROUP_NONE
, /* optinfo_flags */
389 false, /* has_execute */
391 0, /* properties_required */
392 0, /* properties_provided */
393 0, /* properties_destroyed */
394 0, /* todo_flags_start */
395 0, /* todo_flags_finish */
398 class pass_all_early_optimizations
: public gimple_opt_pass
401 pass_all_early_optimizations(gcc::context
*ctxt
)
402 : gimple_opt_pass(pass_data_all_early_optimizations
, ctxt
)
405 /* opt_pass methods: */
406 bool gate () { return gate_all_early_optimizations (); }
408 }; // class pass_all_early_optimizations
412 static gimple_opt_pass
*
413 make_pass_all_early_optimizations (gcc::context
*ctxt
)
415 return new pass_all_early_optimizations (ctxt
);
418 /* Gate: execute, or not, all of the non-trivial optimizations. */
421 gate_all_optimizations (void)
423 return optimize
>= 1 && !optimize_debug
;
428 const pass_data pass_data_all_optimizations
=
430 GIMPLE_PASS
, /* type */
431 "*all_optimizations", /* name */
432 OPTGROUP_NONE
, /* optinfo_flags */
434 false, /* has_execute */
435 TV_OPTIMIZE
, /* tv_id */
436 0, /* properties_required */
437 0, /* properties_provided */
438 0, /* properties_destroyed */
439 0, /* todo_flags_start */
440 0, /* todo_flags_finish */
443 class pass_all_optimizations
: public gimple_opt_pass
446 pass_all_optimizations(gcc::context
*ctxt
)
447 : gimple_opt_pass(pass_data_all_optimizations
, ctxt
)
450 /* opt_pass methods: */
451 bool gate () { return gate_all_optimizations (); }
453 }; // class pass_all_optimizations
457 static gimple_opt_pass
*
458 make_pass_all_optimizations (gcc::context
*ctxt
)
460 return new pass_all_optimizations (ctxt
);
463 /* Gate: execute, or not, all of the non-trivial optimizations. */
466 gate_all_optimizations_g (void)
468 return optimize
>= 1 && optimize_debug
;
473 const pass_data pass_data_all_optimizations_g
=
475 GIMPLE_PASS
, /* type */
476 "*all_optimizations_g", /* name */
477 OPTGROUP_NONE
, /* optinfo_flags */
479 false, /* has_execute */
480 TV_OPTIMIZE
, /* tv_id */
481 0, /* properties_required */
482 0, /* properties_provided */
483 0, /* properties_destroyed */
484 0, /* todo_flags_start */
485 0, /* todo_flags_finish */
488 class pass_all_optimizations_g
: public gimple_opt_pass
491 pass_all_optimizations_g(gcc::context
*ctxt
)
492 : gimple_opt_pass(pass_data_all_optimizations_g
, ctxt
)
495 /* opt_pass methods: */
496 bool gate () { return gate_all_optimizations_g (); }
498 }; // class pass_all_optimizations_g
502 static gimple_opt_pass
*
503 make_pass_all_optimizations_g (gcc::context
*ctxt
)
505 return new pass_all_optimizations_g (ctxt
);
509 gate_rest_of_compilation (void)
511 /* Early return if there were errors. We can run afoul of our
512 consistency checks, and there's not really much point in fixing them. */
513 return !(rtl_dump_and_exit
|| flag_syntax_only
|| seen_error ());
518 const pass_data pass_data_rest_of_compilation
=
521 "*rest_of_compilation", /* name */
522 OPTGROUP_NONE
, /* optinfo_flags */
524 false, /* has_execute */
525 TV_REST_OF_COMPILATION
, /* tv_id */
526 PROP_rtl
, /* properties_required */
527 0, /* properties_provided */
528 0, /* properties_destroyed */
529 0, /* todo_flags_start */
530 0, /* todo_flags_finish */
533 class pass_rest_of_compilation
: public rtl_opt_pass
536 pass_rest_of_compilation(gcc::context
*ctxt
)
537 : rtl_opt_pass(pass_data_rest_of_compilation
, ctxt
)
540 /* opt_pass methods: */
541 bool gate () { return gate_rest_of_compilation (); }
543 }; // class pass_rest_of_compilation
547 static rtl_opt_pass
*
548 make_pass_rest_of_compilation (gcc::context
*ctxt
)
550 return new pass_rest_of_compilation (ctxt
);
554 gate_postreload (void)
556 return reload_completed
;
561 const pass_data pass_data_postreload
=
564 "*all-postreload", /* name */
565 OPTGROUP_NONE
, /* optinfo_flags */
567 false, /* has_execute */
568 TV_POSTRELOAD
, /* tv_id */
569 PROP_rtl
, /* properties_required */
570 0, /* properties_provided */
571 0, /* properties_destroyed */
572 0, /* todo_flags_start */
573 TODO_verify_rtl_sharing
, /* todo_flags_finish */
576 class pass_postreload
: public rtl_opt_pass
579 pass_postreload(gcc::context
*ctxt
)
580 : rtl_opt_pass(pass_data_postreload
, ctxt
)
583 /* opt_pass methods: */
584 bool gate () { return gate_postreload (); }
586 }; // class pass_postreload
590 static rtl_opt_pass
*
591 make_pass_postreload (gcc::context
*ctxt
)
593 return new pass_postreload (ctxt
);
598 /* Set the static pass number of pass PASS to ID and record that
599 in the mapping from static pass number to pass. */
603 set_pass_for_id (int id
, struct opt_pass
*pass
)
605 pass
->static_pass_number
= id
;
606 if (passes_by_id_size
<= id
)
608 passes_by_id
= XRESIZEVEC (struct opt_pass
*, passes_by_id
, id
+ 1);
609 memset (passes_by_id
+ passes_by_id_size
, 0,
610 (id
+ 1 - passes_by_id_size
) * sizeof (void *));
611 passes_by_id_size
= id
+ 1;
613 passes_by_id
[id
] = pass
;
616 /* Return the pass with the static pass number ID. */
619 pass_manager::get_pass_for_id (int id
) const
621 if (id
>= passes_by_id_size
)
623 return passes_by_id
[id
];
626 /* Iterate over the pass tree allocating dump file numbers. We want
627 to do this depth first, and independent of whether the pass is
631 register_one_dump_file (struct opt_pass
*pass
)
633 g
->get_passes ()->register_one_dump_file (pass
);
637 pass_manager::register_one_dump_file (struct opt_pass
*pass
)
639 char *dot_name
, *flag_name
, *glob_name
;
640 const char *name
, *full_name
, *prefix
;
643 int optgroup_flags
= OPTGROUP_NONE
;
645 /* See below in next_pass_1. */
647 if (pass
->static_pass_number
!= -1)
648 sprintf (num
, "%d", ((int) pass
->static_pass_number
< 0
649 ? 1 : pass
->static_pass_number
));
651 /* The name is both used to identify the pass for the purposes of plugins,
652 and to specify dump file name and option.
653 The latter two might want something short which is not quite unique; for
654 that reason, we may have a disambiguating prefix, followed by a space
655 to mark the start of the following dump file name / option string. */
656 name
= strchr (pass
->name
, ' ');
657 name
= name
? name
+ 1 : pass
->name
;
658 dot_name
= concat (".", name
, num
, NULL
);
659 if (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
)
663 optgroup_flags
|= OPTGROUP_IPA
;
665 else if (pass
->type
== GIMPLE_PASS
)
676 flag_name
= concat (prefix
, name
, num
, NULL
);
677 glob_name
= concat (prefix
, name
, NULL
);
678 optgroup_flags
|= pass
->optinfo_flags
;
679 id
= dump_register (dot_name
, flag_name
, glob_name
, flags
, optgroup_flags
);
680 set_pass_for_id (id
, pass
);
681 full_name
= concat (prefix
, pass
->name
, num
, NULL
);
682 register_pass_name (pass
, full_name
);
683 free (CONST_CAST (char *, full_name
));
686 /* Recursive worker function for register_dump_files. */
690 register_dump_files_1 (struct opt_pass
*pass
, int properties
)
694 int new_properties
= (properties
| pass
->properties_provided
)
695 & ~pass
->properties_destroyed
;
697 if (pass
->name
&& pass
->name
[0] != '*')
698 register_one_dump_file (pass
);
701 new_properties
= register_dump_files_1 (pass
->sub
, new_properties
);
703 /* If we have a gate, combine the properties that we could have with
704 and without the pass being examined. */
706 properties
&= new_properties
;
708 properties
= new_properties
;
717 /* Register the dump files for the pass_manager starting at PASS.
718 PROPERTIES reflects the properties that are guaranteed to be available at
719 the beginning of the pipeline. */
723 register_dump_files (struct opt_pass
*pass
,int properties
)
725 pass
->properties_required
|= properties
;
726 register_dump_files_1 (pass
, properties
);
731 const char* unique_name
;
732 struct opt_pass
*pass
;
735 /* Helper for pass_registry hash table. */
737 struct pass_registry_hasher
: typed_noop_remove
<pass_registry
>
739 typedef pass_registry value_type
;
740 typedef pass_registry compare_type
;
741 static inline hashval_t
hash (const value_type
*);
742 static inline bool equal (const value_type
*, const compare_type
*);
745 /* Pass registry hash function. */
748 pass_registry_hasher::hash (const value_type
*s
)
750 return htab_hash_string (s
->unique_name
);
753 /* Hash equal function */
756 pass_registry_hasher::equal (const value_type
*s1
, const compare_type
*s2
)
758 return !strcmp (s1
->unique_name
, s2
->unique_name
);
761 static hash_table
<pass_registry_hasher
> name_to_pass_map
;
763 /* Register PASS with NAME. */
766 register_pass_name (struct opt_pass
*pass
, const char *name
)
768 struct pass_registry
**slot
;
769 struct pass_registry pr
;
771 if (!name_to_pass_map
.is_created ())
772 name_to_pass_map
.create (256);
774 pr
.unique_name
= name
;
775 slot
= name_to_pass_map
.find_slot (&pr
, INSERT
);
778 struct pass_registry
*new_pr
;
780 new_pr
= XCNEW (struct pass_registry
);
781 new_pr
->unique_name
= xstrdup (name
);
786 return; /* Ignore plugin passes. */
789 /* Map from pass id to canonicalized pass name. */
791 typedef const char *char_ptr
;
792 static vec
<char_ptr
> pass_tab
= vNULL
;
794 /* Callback function for traversing NAME_TO_PASS_MAP. */
797 passes_pass_traverse (pass_registry
**p
, void *data ATTRIBUTE_UNUSED
)
799 struct opt_pass
*pass
= (*p
)->pass
;
801 gcc_assert (pass
->static_pass_number
> 0);
802 gcc_assert (pass_tab
.exists ());
804 pass_tab
[pass
->static_pass_number
] = (*p
)->unique_name
;
809 /* The function traverses NAME_TO_PASS_MAP and creates a pass info
810 table for dumping purpose. */
813 create_pass_tab (void)
815 if (!flag_dump_passes
)
818 pass_tab
.safe_grow_cleared (g
->get_passes ()->passes_by_id_size
+ 1);
819 name_to_pass_map
.traverse
<void *, passes_pass_traverse
> (NULL
);
822 static bool override_gate_status (struct opt_pass
*, tree
, bool);
824 /* Dump the instantiated name for PASS. IS_ON indicates if PASS
825 is turned on or not. */
828 dump_one_pass (struct opt_pass
*pass
, int pass_indent
)
830 int indent
= 3 * pass_indent
;
832 bool is_on
, is_really_on
;
834 is_on
= pass
->has_gate
? pass
->gate() : true;
835 is_really_on
= override_gate_status (pass
, current_function_decl
, is_on
);
837 if (pass
->static_pass_number
<= 0)
840 pn
= pass_tab
[pass
->static_pass_number
];
842 fprintf (stderr
, "%*s%-40s%*s:%s%s\n", indent
, " ", pn
,
843 (15 - indent
< 0 ? 0 : 15 - indent
), " ",
844 is_on
? " ON" : " OFF",
845 ((!is_on
) == (!is_really_on
) ? ""
846 : (is_really_on
? " (FORCED_ON)" : " (FORCED_OFF)")));
849 /* Dump pass list PASS with indentation INDENT. */
852 dump_pass_list (struct opt_pass
*pass
, int indent
)
856 dump_one_pass (pass
, indent
);
858 dump_pass_list (pass
->sub
, indent
+ 1);
864 /* Dump all optimization passes. */
869 g
->get_passes ()->dump_passes ();
873 pass_manager::dump_passes () const
875 struct cgraph_node
*n
, *node
= NULL
;
879 FOR_EACH_FUNCTION (n
)
880 if (DECL_STRUCT_FUNCTION (n
->symbol
.decl
))
889 push_cfun (DECL_STRUCT_FUNCTION (node
->symbol
.decl
));
891 dump_pass_list (all_lowering_passes
, 1);
892 dump_pass_list (all_small_ipa_passes
, 1);
893 dump_pass_list (all_regular_ipa_passes
, 1);
894 dump_pass_list (all_lto_gen_passes
, 1);
895 dump_pass_list (all_late_ipa_passes
, 1);
896 dump_pass_list (all_passes
, 1);
902 /* Returns the pass with NAME. */
904 static struct opt_pass
*
905 get_pass_by_name (const char *name
)
907 struct pass_registry
**slot
, pr
;
909 pr
.unique_name
= name
;
910 slot
= name_to_pass_map
.find_slot (&pr
, NO_INSERT
);
915 return (*slot
)->pass
;
919 /* Range [start, last]. */
925 const char *assem_name
;
926 struct uid_range
*next
;
929 typedef struct uid_range
*uid_range_p
;
932 static vec
<uid_range_p
>
933 enabled_pass_uid_range_tab
= vNULL
;
934 static vec
<uid_range_p
>
935 disabled_pass_uid_range_tab
= vNULL
;
938 /* Parse option string for -fdisable- and -fenable-
939 The syntax of the options:
942 -fdisable-<pass_name>
944 -fenable-<pass_name>=s1:e1,s2:e2,...
945 -fdisable-<pass_name>=s1:e1,s2:e2,...
949 enable_disable_pass (const char *arg
, bool is_enable
)
951 struct opt_pass
*pass
;
952 char *range_str
, *phase_name
;
953 char *argstr
= xstrdup (arg
);
954 vec
<uid_range_p
> *tab
= 0;
956 range_str
= strchr (argstr
,'=');
967 error ("unrecognized option -fenable");
969 error ("unrecognized option -fdisable");
973 pass
= get_pass_by_name (phase_name
);
974 if (!pass
|| pass
->static_pass_number
== -1)
977 error ("unknown pass %s specified in -fenable", phase_name
);
979 error ("unknown pass %s specified in -fdisable", phase_name
);
985 tab
= &enabled_pass_uid_range_tab
;
987 tab
= &disabled_pass_uid_range_tab
;
989 if ((unsigned) pass
->static_pass_number
>= tab
->length ())
990 tab
->safe_grow_cleared (pass
->static_pass_number
+ 1);
995 uid_range_p new_range
= XCNEW (struct uid_range
);
997 new_range
->start
= 0;
998 new_range
->last
= (unsigned)-1;
1000 slot
= (*tab
)[pass
->static_pass_number
];
1001 new_range
->next
= slot
;
1002 (*tab
)[pass
->static_pass_number
] = new_range
;
1004 inform (UNKNOWN_LOCATION
, "enable pass %s for functions in the range "
1005 "of [%u, %u]", phase_name
, new_range
->start
, new_range
->last
);
1007 inform (UNKNOWN_LOCATION
, "disable pass %s for functions in the range "
1008 "of [%u, %u]", phase_name
, new_range
->start
, new_range
->last
);
1012 char *next_range
= NULL
;
1013 char *one_range
= range_str
;
1014 char *end_val
= NULL
;
1019 uid_range_p new_range
;
1020 char *invalid
= NULL
;
1022 char *func_name
= NULL
;
1024 next_range
= strchr (one_range
, ',');
1031 end_val
= strchr (one_range
, ':');
1037 start
= strtol (one_range
, &invalid
, 10);
1038 if (*invalid
|| start
< 0)
1040 if (end_val
|| (one_range
[0] >= '0'
1041 && one_range
[0] <= '9'))
1043 error ("Invalid range %s in option %s",
1045 is_enable
? "-fenable" : "-fdisable");
1049 func_name
= one_range
;
1053 new_range
= XCNEW (struct uid_range
);
1056 new_range
->start
= (unsigned) start
;
1057 new_range
->last
= (unsigned) start
;
1061 new_range
->start
= (unsigned) -1;
1062 new_range
->last
= (unsigned) -1;
1063 new_range
->assem_name
= xstrdup (func_name
);
1068 long last
= strtol (end_val
, &invalid
, 10);
1069 if (*invalid
|| last
< start
)
1071 error ("Invalid range %s in option %s",
1073 is_enable
? "-fenable" : "-fdisable");
1077 new_range
= XCNEW (struct uid_range
);
1078 new_range
->start
= (unsigned) start
;
1079 new_range
->last
= (unsigned) last
;
1082 slot
= (*tab
)[pass
->static_pass_number
];
1083 new_range
->next
= slot
;
1084 (*tab
)[pass
->static_pass_number
] = new_range
;
1087 if (new_range
->assem_name
)
1088 inform (UNKNOWN_LOCATION
,
1089 "enable pass %s for function %s",
1090 phase_name
, new_range
->assem_name
);
1092 inform (UNKNOWN_LOCATION
,
1093 "enable pass %s for functions in the range of [%u, %u]",
1094 phase_name
, new_range
->start
, new_range
->last
);
1098 if (new_range
->assem_name
)
1099 inform (UNKNOWN_LOCATION
,
1100 "disable pass %s for function %s",
1101 phase_name
, new_range
->assem_name
);
1103 inform (UNKNOWN_LOCATION
,
1104 "disable pass %s for functions in the range of [%u, %u]",
1105 phase_name
, new_range
->start
, new_range
->last
);
1108 one_range
= next_range
;
1109 } while (next_range
);
1115 /* Enable pass specified by ARG. */
1118 enable_pass (const char *arg
)
1120 enable_disable_pass (arg
, true);
1123 /* Disable pass specified by ARG. */
1126 disable_pass (const char *arg
)
1128 enable_disable_pass (arg
, false);
1131 /* Returns true if PASS is explicitly enabled/disabled for FUNC. */
1134 is_pass_explicitly_enabled_or_disabled (struct opt_pass
*pass
,
1136 vec
<uid_range_p
> tab
)
1138 uid_range_p slot
, range
;
1140 const char *aname
= NULL
;
1143 || (unsigned) pass
->static_pass_number
>= tab
.length ()
1144 || pass
->static_pass_number
== -1)
1147 slot
= tab
[pass
->static_pass_number
];
1151 cgraph_uid
= func
? cgraph_get_node (func
)->uid
: 0;
1152 if (func
&& DECL_ASSEMBLER_NAME_SET_P (func
))
1153 aname
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (func
));
1158 if ((unsigned) cgraph_uid
>= range
->start
1159 && (unsigned) cgraph_uid
<= range
->last
)
1161 if (range
->assem_name
&& aname
1162 && !strcmp (range
->assem_name
, aname
))
1164 range
= range
->next
;
1171 /* Update static_pass_number for passes (and the flag
1172 TODO_mark_first_instance).
1174 Passes are constructed with static_pass_number preinitialized to 0
1176 This field is used in two different ways: initially as instance numbers
1177 of their kind, and then as ids within the entire pass manager.
1179 Within pass_manager::pass_manager:
1181 * In add_pass_instance(), as called by next_pass_1 in
1182 NEXT_PASS in init_optimization_passes
1184 * When the initial instance of a pass within a pass manager is seen,
1185 it is flagged, and its static_pass_number is set to -1
1187 * On subsequent times that it is seen, the static pass number
1188 is decremented each time, so that if there are e.g. 4 dups,
1189 they have static_pass_number -4, 2, 3, 4 respectively (note
1190 how the initial one is negative and gives the count); these
1191 can be thought of as instance numbers of the specific pass
1193 * Within the register_dump_files () traversal, set_pass_for_id()
1194 is called on each pass, using these instance numbers to create
1195 dumpfile switches, and then overwriting them with a pass id,
1196 which are global to the whole pass manager (based on
1197 (TDI_end + current value of extra_dump_files_in_use) ) */
1200 add_pass_instance (struct opt_pass
*new_pass
, bool track_duplicates
,
1201 opt_pass
*initial_pass
)
1203 /* Are we dealing with the first pass of its kind, or a clone? */
1204 if (new_pass
!= initial_pass
)
1206 /* We're dealing with a clone. */
1207 new_pass
->todo_flags_start
&= ~TODO_mark_first_instance
;
1209 /* Indicate to register_dump_files that this pass has duplicates,
1210 and so it should rename the dump file. The first instance will
1211 be -1, and be number of duplicates = -static_pass_number - 1.
1212 Subsequent instances will be > 0 and just the duplicate number. */
1213 if ((new_pass
->name
&& new_pass
->name
[0] != '*') || track_duplicates
)
1215 initial_pass
->static_pass_number
-= 1;
1216 new_pass
->static_pass_number
= -initial_pass
->static_pass_number
;
1221 /* We're dealing with the first pass of its kind. */
1222 new_pass
->todo_flags_start
|= TODO_mark_first_instance
;
1223 new_pass
->static_pass_number
= -1;
1225 invoke_plugin_callbacks (PLUGIN_NEW_PASS
, new_pass
);
1229 /* Add a pass to the pass list. Duplicate the pass if it's already
1232 static struct opt_pass
**
1233 next_pass_1 (struct opt_pass
**list
, struct opt_pass
*pass
,
1234 struct opt_pass
*initial_pass
)
1236 /* Every pass should have a name so that plugins can refer to them. */
1237 gcc_assert (pass
->name
!= NULL
);
1239 add_pass_instance (pass
, false, initial_pass
);
1242 return &(*list
)->next
;
1245 /* List node for an inserted pass instance. We need to keep track of all
1246 the newly-added pass instances (with 'added_pass_nodes' defined below)
1247 so that we can register their dump files after pass-positioning is finished.
1248 Registering dumping files needs to be post-processed or the
1249 static_pass_number of the opt_pass object would be modified and mess up
1250 the dump file names of future pass instances to be added. */
1252 struct pass_list_node
1254 struct opt_pass
*pass
;
1255 struct pass_list_node
*next
;
1258 static struct pass_list_node
*added_pass_nodes
= NULL
;
1259 static struct pass_list_node
*prev_added_pass_node
;
1261 /* Insert the pass at the proper position. Return true if the pass
1262 is successfully added.
1264 NEW_PASS_INFO - new pass to be inserted
1265 PASS_LIST - root of the pass list to insert the new pass to */
1268 position_pass (struct register_pass_info
*new_pass_info
,
1269 struct opt_pass
**pass_list
)
1271 struct opt_pass
*pass
= *pass_list
, *prev_pass
= NULL
;
1272 bool success
= false;
1274 for ( ; pass
; prev_pass
= pass
, pass
= pass
->next
)
1276 /* Check if the current pass is of the same type as the new pass and
1277 matches the name and the instance number of the reference pass. */
1278 if (pass
->type
== new_pass_info
->pass
->type
1280 && !strcmp (pass
->name
, new_pass_info
->reference_pass_name
)
1281 && ((new_pass_info
->ref_pass_instance_number
== 0)
1282 || (new_pass_info
->ref_pass_instance_number
==
1283 pass
->static_pass_number
)
1284 || (new_pass_info
->ref_pass_instance_number
== 1
1285 && pass
->todo_flags_start
& TODO_mark_first_instance
)))
1287 struct opt_pass
*new_pass
;
1288 struct pass_list_node
*new_pass_node
;
1290 if (new_pass_info
->ref_pass_instance_number
== 0)
1292 new_pass
= new_pass_info
->pass
->clone ();
1293 add_pass_instance (new_pass
, true, new_pass_info
->pass
);
1297 new_pass
= new_pass_info
->pass
;
1298 add_pass_instance (new_pass
, true, new_pass
);
1301 /* Insert the new pass instance based on the positioning op. */
1302 switch (new_pass_info
->pos_op
)
1304 case PASS_POS_INSERT_AFTER
:
1305 new_pass
->next
= pass
->next
;
1306 pass
->next
= new_pass
;
1308 /* Skip newly inserted pass to avoid repeated
1309 insertions in the case where the new pass and the
1310 existing one have the same name. */
1313 case PASS_POS_INSERT_BEFORE
:
1314 new_pass
->next
= pass
;
1316 prev_pass
->next
= new_pass
;
1318 *pass_list
= new_pass
;
1320 case PASS_POS_REPLACE
:
1321 new_pass
->next
= pass
->next
;
1323 prev_pass
->next
= new_pass
;
1325 *pass_list
= new_pass
;
1326 new_pass
->sub
= pass
->sub
;
1327 new_pass
->tv_id
= pass
->tv_id
;
1331 error ("invalid pass positioning operation");
1335 /* Save the newly added pass (instance) in the added_pass_nodes
1336 list so that we can register its dump file later. Note that
1337 we cannot register the dump file now because doing so will modify
1338 the static_pass_number of the opt_pass object and therefore
1339 mess up the dump file name of future instances. */
1340 new_pass_node
= XCNEW (struct pass_list_node
);
1341 new_pass_node
->pass
= new_pass
;
1342 if (!added_pass_nodes
)
1343 added_pass_nodes
= new_pass_node
;
1345 prev_added_pass_node
->next
= new_pass_node
;
1346 prev_added_pass_node
= new_pass_node
;
1351 if (pass
->sub
&& position_pass (new_pass_info
, &pass
->sub
))
1358 /* Hooks a new pass into the pass lists.
1360 PASS_INFO - pass information that specifies the opt_pass object,
1361 reference pass, instance number, and how to position
1365 register_pass (struct register_pass_info
*pass_info
)
1367 g
->get_passes ()->register_pass (pass_info
);
1372 pass_manager::register_pass (struct register_pass_info
*pass_info
)
1374 bool all_instances
, success
;
1376 /* The checks below could fail in buggy plugins. Existing GCC
1377 passes should never fail these checks, so we mention plugin in
1379 if (!pass_info
->pass
)
1380 fatal_error ("plugin cannot register a missing pass");
1382 if (!pass_info
->pass
->name
)
1383 fatal_error ("plugin cannot register an unnamed pass");
1385 if (!pass_info
->reference_pass_name
)
1387 ("plugin cannot register pass %qs without reference pass name",
1388 pass_info
->pass
->name
);
1390 /* Try to insert the new pass to the pass lists. We need to check
1391 all five lists as the reference pass could be in one (or all) of
1393 all_instances
= pass_info
->ref_pass_instance_number
== 0;
1394 success
= position_pass (pass_info
, &all_lowering_passes
);
1395 if (!success
|| all_instances
)
1396 success
|= position_pass (pass_info
, &all_small_ipa_passes
);
1397 if (!success
|| all_instances
)
1398 success
|= position_pass (pass_info
, &all_regular_ipa_passes
);
1399 if (!success
|| all_instances
)
1400 success
|= position_pass (pass_info
, &all_lto_gen_passes
);
1401 if (!success
|| all_instances
)
1402 success
|= position_pass (pass_info
, &all_late_ipa_passes
);
1403 if (!success
|| all_instances
)
1404 success
|= position_pass (pass_info
, &all_passes
);
1407 ("pass %qs not found but is referenced by new pass %qs",
1408 pass_info
->reference_pass_name
, pass_info
->pass
->name
);
1410 /* OK, we have successfully inserted the new pass. We need to register
1411 the dump files for the newly added pass and its duplicates (if any).
1412 Because the registration of plugin/backend passes happens after the
1413 command-line options are parsed, the options that specify single
1414 pass dumping (e.g. -fdump-tree-PASSNAME) cannot be used for new
1415 passes. Therefore we currently can only enable dumping of
1416 new passes when the 'dump-all' flags (e.g. -fdump-tree-all)
1417 are specified. While doing so, we also delete the pass_list_node
1418 objects created during pass positioning. */
1419 while (added_pass_nodes
)
1421 struct pass_list_node
*next_node
= added_pass_nodes
->next
;
1422 enum tree_dump_index tdi
;
1423 register_one_dump_file (added_pass_nodes
->pass
);
1424 if (added_pass_nodes
->pass
->type
== SIMPLE_IPA_PASS
1425 || added_pass_nodes
->pass
->type
== IPA_PASS
)
1427 else if (added_pass_nodes
->pass
->type
== GIMPLE_PASS
)
1431 /* Check if dump-all flag is specified. */
1432 if (get_dump_file_info (tdi
)->pstate
)
1433 get_dump_file_info (added_pass_nodes
->pass
->static_pass_number
)
1434 ->pstate
= get_dump_file_info (tdi
)->pstate
;
1435 XDELETE (added_pass_nodes
);
1436 added_pass_nodes
= next_node
;
1440 /* Construct the pass tree. The sequencing of passes is driven by
1441 the cgraph routines:
1443 finalize_compilation_unit ()
1444 for each node N in the cgraph
1445 cgraph_analyze_function (N)
1446 cgraph_lower_function (N) -> all_lowering_passes
1448 If we are optimizing, compile is then invoked:
1451 ipa_passes () -> all_small_ipa_passes
1452 -> Analysis of all_regular_ipa_passes
1453 * possible LTO streaming at copmilation time *
1454 -> Execution of all_regular_ipa_passes
1455 * possible LTO streaming at link time *
1456 -> all_late_ipa_passes
1457 expand_all_functions ()
1458 for each node N in the cgraph
1459 expand_function (N) -> Transformation of all_regular_ipa_passes
1464 pass_manager::operator new (size_t sz
)
1466 /* Ensure that all fields of the pass manager are zero-initialized. */
1467 return xcalloc (1, sz
);
1470 pass_manager::pass_manager (context
*ctxt
)
1471 : all_passes(NULL
), all_small_ipa_passes(NULL
), all_lowering_passes(NULL
),
1472 all_regular_ipa_passes(NULL
), all_lto_gen_passes(NULL
),
1473 all_late_ipa_passes(NULL
), passes_by_id(NULL
), passes_by_id_size(0),
1476 struct opt_pass
**p
;
1478 /* Initialize the pass_lists array. */
1479 #define DEF_PASS_LIST(LIST) pass_lists[PASS_LIST_NO_##LIST] = &LIST;
1481 #undef DEF_PASS_LIST
1483 /* Build the tree of passes. */
1485 #define INSERT_PASSES_AFTER(PASS) \
1488 #define PUSH_INSERT_PASSES_WITHIN(PASS) \
1490 struct opt_pass **p = &(PASS ## _1)->sub;
1492 #define POP_INSERT_PASSES() \
1495 #define NEXT_PASS(PASS, NUM) \
1497 gcc_assert (NULL == PASS ## _ ## NUM); \
1499 PASS ## _1 = make_##PASS (ctxt_); \
1502 gcc_assert (PASS ## _1); \
1503 PASS ## _ ## NUM = PASS ## _1->clone (); \
1505 p = next_pass_1 (p, PASS ## _ ## NUM, PASS ## _1); \
1508 #define TERMINATE_PASS_LIST() \
1511 #include "pass-instances.def"
1513 #undef INSERT_PASSES_AFTER
1514 #undef PUSH_INSERT_PASSES_WITHIN
1515 #undef POP_INSERT_PASSES
1517 #undef TERMINATE_PASS_LIST
1519 /* Register the passes with the tree dump code. */
1520 register_dump_files (all_lowering_passes
, PROP_gimple_any
);
1521 register_dump_files (all_small_ipa_passes
,
1522 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
1524 register_dump_files (all_regular_ipa_passes
,
1525 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
1527 register_dump_files (all_lto_gen_passes
,
1528 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
1530 register_dump_files (all_late_ipa_passes
,
1531 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
1533 register_dump_files (all_passes
,
1534 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
1538 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
1539 function CALLBACK for every function in the call graph. Otherwise,
1540 call CALLBACK on the current function. */
1543 do_per_function (void (*callback
) (void *data
), void *data
)
1545 if (current_function_decl
)
1549 struct cgraph_node
*node
;
1550 FOR_EACH_DEFINED_FUNCTION (node
)
1551 if (node
->symbol
.analyzed
&& gimple_has_body_p (node
->symbol
.decl
)
1552 && (!node
->clone_of
|| node
->symbol
.decl
!= node
->clone_of
->symbol
.decl
))
1554 push_cfun (DECL_STRUCT_FUNCTION (node
->symbol
.decl
));
1558 free_dominance_info (CDI_DOMINATORS
);
1559 free_dominance_info (CDI_POST_DOMINATORS
);
1567 /* Because inlining might remove no-longer reachable nodes, we need to
1568 keep the array visible to garbage collector to avoid reading collected
1571 static GTY ((length ("nnodes"))) cgraph_node_ptr
*order
;
1573 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
1574 function CALLBACK for every function in the call graph. Otherwise,
1575 call CALLBACK on the current function.
1576 This function is global so that plugins can use it. */
1578 do_per_function_toporder (void (*callback
) (void *data
), void *data
)
1582 if (current_function_decl
)
1586 gcc_assert (!order
);
1587 order
= ggc_alloc_vec_cgraph_node_ptr (cgraph_n_nodes
);
1588 nnodes
= ipa_reverse_postorder (order
);
1589 for (i
= nnodes
- 1; i
>= 0; i
--)
1590 order
[i
]->process
= 1;
1591 for (i
= nnodes
- 1; i
>= 0; i
--)
1593 struct cgraph_node
*node
= order
[i
];
1595 /* Allow possibly removed nodes to be garbage collected. */
1598 if (cgraph_function_with_gimple_body_p (node
))
1600 cgraph_get_body (node
);
1601 push_cfun (DECL_STRUCT_FUNCTION (node
->symbol
.decl
));
1603 free_dominance_info (CDI_DOMINATORS
);
1604 free_dominance_info (CDI_POST_DOMINATORS
);
1615 /* Helper function to perform function body dump. */
1618 execute_function_dump (void *data ATTRIBUTE_UNUSED
)
1620 if (dump_file
&& current_function_decl
)
1622 if (cfun
->curr_properties
& PROP_trees
)
1623 dump_function_to_file (current_function_decl
, dump_file
, dump_flags
);
1625 print_rtl_with_bb (dump_file
, get_insns (), dump_flags
);
1627 /* Flush the file. If verification fails, we won't be able to
1628 close the file before aborting. */
1631 if ((cfun
->curr_properties
& PROP_cfg
)
1632 && (dump_flags
& TDF_GRAPH
))
1633 print_graph_cfg (dump_file_name
, cfun
);
1637 static struct profile_record
*profile_record
;
1639 /* Do profile consistency book-keeping for the pass with static number INDEX.
1640 If SUBPASS is zero, we run _before_ the pass, and if SUBPASS is one, then
1641 we run _after_ the pass. RUN is true if the pass really runs, or FALSE
1642 if we are only book-keeping on passes that may have selectively disabled
1643 themselves on a given function. */
1645 check_profile_consistency (int index
, int subpass
, bool run
)
1647 pass_manager
*passes
= g
->get_passes ();
1650 if (!profile_record
)
1651 profile_record
= XCNEWVEC (struct profile_record
,
1652 passes
->passes_by_id_size
);
1653 gcc_assert (index
< passes
->passes_by_id_size
&& index
>= 0);
1654 gcc_assert (subpass
< 2);
1655 profile_record
[index
].run
|= run
;
1656 account_profile_record (&profile_record
[index
], subpass
);
1659 /* Output profile consistency. */
1662 dump_profile_report (void)
1664 g
->get_passes ()->dump_profile_report ();
1668 pass_manager::dump_profile_report () const
1671 int last_freq_in
= 0, last_count_in
= 0, last_freq_out
= 0, last_count_out
= 0;
1672 gcov_type last_time
= 0, last_size
= 0;
1673 double rel_time_change
, rel_size_change
;
1674 int last_reported
= 0;
1676 if (!profile_record
)
1678 fprintf (stderr
, "\nProfile consistency report:\n\n");
1679 fprintf (stderr
, "Pass name |mismatch in |mismated out|Overall\n");
1680 fprintf (stderr
, " |freq count |freq count |size time\n");
1682 for (i
= 0; i
< passes_by_id_size
; i
++)
1683 for (j
= 0 ; j
< 2; j
++)
1684 if (profile_record
[i
].run
)
1687 rel_time_change
= (profile_record
[i
].time
[j
]
1688 - (double)last_time
) * 100 / (double)last_time
;
1690 rel_time_change
= 0;
1692 rel_size_change
= (profile_record
[i
].size
[j
]
1693 - (double)last_size
) * 100 / (double)last_size
;
1695 rel_size_change
= 0;
1697 if (profile_record
[i
].num_mismatched_freq_in
[j
] != last_freq_in
1698 || profile_record
[i
].num_mismatched_freq_out
[j
] != last_freq_out
1699 || profile_record
[i
].num_mismatched_count_in
[j
] != last_count_in
1700 || profile_record
[i
].num_mismatched_count_out
[j
] != last_count_out
1701 || rel_time_change
|| rel_size_change
)
1704 fprintf (stderr
, "%-20s %s",
1705 passes_by_id
[i
]->name
,
1706 j
? "(after TODO)" : " ");
1707 if (profile_record
[i
].num_mismatched_freq_in
[j
] != last_freq_in
)
1708 fprintf (stderr
, "| %+5i",
1709 profile_record
[i
].num_mismatched_freq_in
[j
]
1712 fprintf (stderr
, "| ");
1713 if (profile_record
[i
].num_mismatched_count_in
[j
] != last_count_in
)
1714 fprintf (stderr
, " %+5i",
1715 profile_record
[i
].num_mismatched_count_in
[j
]
1718 fprintf (stderr
, " ");
1719 if (profile_record
[i
].num_mismatched_freq_out
[j
] != last_freq_out
)
1720 fprintf (stderr
, "| %+5i",
1721 profile_record
[i
].num_mismatched_freq_out
[j
]
1724 fprintf (stderr
, "| ");
1725 if (profile_record
[i
].num_mismatched_count_out
[j
] != last_count_out
)
1726 fprintf (stderr
, " %+5i",
1727 profile_record
[i
].num_mismatched_count_out
[j
]
1730 fprintf (stderr
, " ");
1732 /* Size/time units change across gimple and RTL. */
1733 if (i
== pass_expand_1
->static_pass_number
)
1734 fprintf (stderr
, "|----------");
1737 if (rel_size_change
)
1738 fprintf (stderr
, "| %+8.4f%%", rel_size_change
);
1740 fprintf (stderr
, "| ");
1741 if (rel_time_change
)
1742 fprintf (stderr
, " %+8.4f%%", rel_time_change
);
1744 fprintf (stderr
, "\n");
1745 last_freq_in
= profile_record
[i
].num_mismatched_freq_in
[j
];
1746 last_freq_out
= profile_record
[i
].num_mismatched_freq_out
[j
];
1747 last_count_in
= profile_record
[i
].num_mismatched_count_in
[j
];
1748 last_count_out
= profile_record
[i
].num_mismatched_count_out
[j
];
1750 else if (j
&& last_reported
!= i
)
1753 fprintf (stderr
, "%-20s ------------| | |\n",
1754 passes_by_id
[i
]->name
);
1756 last_time
= profile_record
[i
].time
[j
];
1757 last_size
= profile_record
[i
].size
[j
];
1761 /* Perform all TODO actions that ought to be done on each function. */
1764 execute_function_todo (void *data
)
1766 unsigned int flags
= (size_t)data
;
1767 flags
&= ~cfun
->last_verified
;
1771 /* Always cleanup the CFG before trying to update SSA. */
1772 if (flags
& TODO_cleanup_cfg
)
1774 cleanup_tree_cfg ();
1776 /* When cleanup_tree_cfg merges consecutive blocks, it may
1777 perform some simplistic propagation when removing single
1778 valued PHI nodes. This propagation may, in turn, cause the
1779 SSA form to become out-of-date (see PR 22037). So, even
1780 if the parent pass had not scheduled an SSA update, we may
1781 still need to do one. */
1782 if (!(flags
& TODO_update_ssa_any
) && need_ssa_update_p (cfun
))
1783 flags
|= TODO_update_ssa
;
1786 if (flags
& TODO_update_ssa_any
)
1788 unsigned update_flags
= flags
& TODO_update_ssa_any
;
1789 update_ssa (update_flags
);
1790 cfun
->last_verified
&= ~TODO_verify_ssa
;
1793 if (flag_tree_pta
&& (flags
& TODO_rebuild_alias
))
1794 compute_may_aliases ();
1796 if (optimize
&& (flags
& TODO_update_address_taken
))
1797 execute_update_addresses_taken ();
1799 if (flags
& TODO_remove_unused_locals
)
1800 remove_unused_locals ();
1802 if (flags
& TODO_rebuild_frequencies
)
1803 rebuild_frequencies ();
1805 if (flags
& TODO_rebuild_cgraph_edges
)
1806 rebuild_cgraph_edges ();
1808 /* If we've seen errors do not bother running any verifiers. */
1812 #if defined ENABLE_CHECKING
1813 if (flags
& TODO_verify_ssa
1814 || (current_loops
&& loops_state_satisfies_p (LOOP_CLOSED_SSA
)))
1816 verify_gimple_in_cfg (cfun
);
1819 else if (flags
& TODO_verify_stmts
)
1820 verify_gimple_in_cfg (cfun
);
1821 if (flags
& TODO_verify_flow
)
1822 verify_flow_info ();
1823 if (current_loops
&& loops_state_satisfies_p (LOOP_CLOSED_SSA
))
1824 verify_loop_closed_ssa (false);
1825 if (flags
& TODO_verify_rtl_sharing
)
1826 verify_rtl_sharing ();
1829 cfun
->last_verified
= flags
& TODO_verify_all
;
1832 /* Perform all TODO actions. */
1834 execute_todo (unsigned int flags
)
1836 #if defined ENABLE_CHECKING
1838 && need_ssa_update_p (cfun
))
1839 gcc_assert (flags
& TODO_update_ssa_any
);
1842 timevar_push (TV_TODO
);
1844 /* Inform the pass whether it is the first time it is run. */
1845 first_pass_instance
= (flags
& TODO_mark_first_instance
) != 0;
1847 statistics_fini_pass ();
1849 do_per_function (execute_function_todo
, (void *)(size_t) flags
);
1851 /* Always remove functions just as before inlining: IPA passes might be
1852 interested to see bodies of extern inline functions that are not inlined
1853 to analyze side effects. The full removal is done just at the end
1854 of IPA pass queue. */
1855 if (flags
& TODO_remove_functions
)
1858 symtab_remove_unreachable_nodes (true, dump_file
);
1861 if ((flags
& TODO_dump_symtab
) && dump_file
&& !current_function_decl
)
1864 dump_symtab (dump_file
);
1865 /* Flush the file. If verification fails, we won't be able to
1866 close the file before aborting. */
1870 /* Now that the dumping has been done, we can get rid of the optional
1872 if (flags
& TODO_df_finish
)
1873 df_finish_pass ((flags
& TODO_df_verify
) != 0);
1875 timevar_pop (TV_TODO
);
1878 /* Verify invariants that should hold between passes. This is a place
1879 to put simple sanity checks. */
1882 verify_interpass_invariants (void)
1884 gcc_checking_assert (!fold_deferring_overflow_warnings_p ());
1887 /* Clear the last verified flag. */
1890 clear_last_verified (void *data ATTRIBUTE_UNUSED
)
1892 cfun
->last_verified
= 0;
1895 /* Helper function. Verify that the properties has been turn into the
1896 properties expected by the pass. */
1898 #ifdef ENABLE_CHECKING
1900 verify_curr_properties (void *data
)
1902 unsigned int props
= (size_t)data
;
1903 gcc_assert ((cfun
->curr_properties
& props
) == props
);
1907 /* Initialize pass dump file. */
1908 /* This is non-static so that the plugins can use it. */
1911 pass_init_dump_file (struct opt_pass
*pass
)
1913 /* If a dump file name is present, open it if enabled. */
1914 if (pass
->static_pass_number
!= -1)
1916 timevar_push (TV_DUMP
);
1917 bool initializing_dump
= !dump_initialized_p (pass
->static_pass_number
);
1918 dump_file_name
= get_dump_file_name (pass
->static_pass_number
);
1919 dump_start (pass
->static_pass_number
, &dump_flags
);
1920 if (dump_file
&& current_function_decl
)
1921 dump_function_header (dump_file
, current_function_decl
, dump_flags
);
1922 if (initializing_dump
1923 && dump_file
&& (dump_flags
& TDF_GRAPH
)
1924 && cfun
&& (cfun
->curr_properties
& PROP_cfg
))
1925 clean_graph_dump_file (dump_file_name
);
1926 timevar_pop (TV_DUMP
);
1927 return initializing_dump
;
1933 /* Flush PASS dump file. */
1934 /* This is non-static so that plugins can use it. */
1937 pass_fini_dump_file (struct opt_pass
*pass
)
1939 timevar_push (TV_DUMP
);
1941 /* Flush and close dump file. */
1944 free (CONST_CAST (char *, dump_file_name
));
1945 dump_file_name
= NULL
;
1948 dump_finish (pass
->static_pass_number
);
1949 timevar_pop (TV_DUMP
);
1952 /* After executing the pass, apply expected changes to the function
1956 update_properties_after_pass (void *data
)
1958 struct opt_pass
*pass
= (struct opt_pass
*) data
;
1959 cfun
->curr_properties
= (cfun
->curr_properties
| pass
->properties_provided
)
1960 & ~pass
->properties_destroyed
;
1963 /* Execute summary generation for all of the passes in IPA_PASS. */
1966 execute_ipa_summary_passes (struct ipa_opt_pass_d
*ipa_pass
)
1970 struct opt_pass
*pass
= ipa_pass
;
1972 /* Execute all of the IPA_PASSes in the list. */
1973 if (ipa_pass
->type
== IPA_PASS
1974 && ((!pass
->has_gate
) || pass
->gate ())
1975 && ipa_pass
->generate_summary
)
1977 pass_init_dump_file (pass
);
1979 /* If a timevar is present, start it. */
1981 timevar_push (pass
->tv_id
);
1983 ipa_pass
->generate_summary ();
1987 timevar_pop (pass
->tv_id
);
1989 pass_fini_dump_file (pass
);
1991 ipa_pass
= (struct ipa_opt_pass_d
*)ipa_pass
->next
;
1995 /* Execute IPA_PASS function transform on NODE. */
1998 execute_one_ipa_transform_pass (struct cgraph_node
*node
,
1999 struct ipa_opt_pass_d
*ipa_pass
)
2001 struct opt_pass
*pass
= ipa_pass
;
2002 unsigned int todo_after
= 0;
2004 current_pass
= pass
;
2005 if (!ipa_pass
->function_transform
)
2008 /* Note that the folders should only create gimple expressions.
2009 This is a hack until the new folder is ready. */
2010 in_gimple_form
= (cfun
&& (cfun
->curr_properties
& PROP_trees
)) != 0;
2012 pass_init_dump_file (pass
);
2014 /* Run pre-pass verification. */
2015 execute_todo (ipa_pass
->function_transform_todo_flags_start
);
2017 /* If a timevar is present, start it. */
2018 if (pass
->tv_id
!= TV_NONE
)
2019 timevar_push (pass
->tv_id
);
2022 todo_after
= ipa_pass
->function_transform (node
);
2025 if (pass
->tv_id
!= TV_NONE
)
2026 timevar_pop (pass
->tv_id
);
2028 if (profile_report
&& cfun
&& (cfun
->curr_properties
& PROP_cfg
))
2029 check_profile_consistency (pass
->static_pass_number
, 0, true);
2031 /* Run post-pass cleanup and verification. */
2032 execute_todo (todo_after
);
2033 verify_interpass_invariants ();
2034 if (profile_report
&& cfun
&& (cfun
->curr_properties
& PROP_cfg
))
2035 check_profile_consistency (pass
->static_pass_number
, 1, true);
2037 do_per_function (execute_function_dump
, NULL
);
2038 pass_fini_dump_file (pass
);
2040 current_pass
= NULL
;
2042 /* Signal this is a suitable GC collection point. */
2043 if (!(todo_after
& TODO_do_not_ggc_collect
))
2047 /* For the current function, execute all ipa transforms. */
2050 execute_all_ipa_transforms (void)
2052 struct cgraph_node
*node
;
2055 node
= cgraph_get_node (current_function_decl
);
2057 if (node
->ipa_transforms_to_apply
.exists ())
2061 for (i
= 0; i
< node
->ipa_transforms_to_apply
.length (); i
++)
2062 execute_one_ipa_transform_pass (node
, node
->ipa_transforms_to_apply
[i
]);
2063 node
->ipa_transforms_to_apply
.release ();
2067 /* Callback for do_per_function to apply all IPA transforms. */
2070 apply_ipa_transforms (void *data
)
2072 struct cgraph_node
*node
= cgraph_get_node (current_function_decl
);
2073 if (!node
->global
.inlined_to
&& node
->ipa_transforms_to_apply
.exists ())
2075 *(bool *)data
= true;
2076 execute_all_ipa_transforms();
2077 rebuild_cgraph_edges ();
2081 /* Check if PASS is explicitly disabled or enabled and return
2082 the gate status. FUNC is the function to be processed, and
2083 GATE_STATUS is the gate status determined by pass manager by
2087 override_gate_status (struct opt_pass
*pass
, tree func
, bool gate_status
)
2089 bool explicitly_enabled
= false;
2090 bool explicitly_disabled
= false;
2093 = is_pass_explicitly_enabled_or_disabled (pass
, func
,
2094 enabled_pass_uid_range_tab
);
2096 = is_pass_explicitly_enabled_or_disabled (pass
, func
,
2097 disabled_pass_uid_range_tab
);
2099 gate_status
= !explicitly_disabled
&& (gate_status
|| explicitly_enabled
);
2108 execute_one_pass (struct opt_pass
*pass
)
2110 unsigned int todo_after
= 0;
2114 /* IPA passes are executed on whole program, so cfun should be NULL.
2115 Other passes need function context set. */
2116 if (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
)
2117 gcc_assert (!cfun
&& !current_function_decl
);
2119 gcc_assert (cfun
&& current_function_decl
);
2121 current_pass
= pass
;
2123 /* Check whether gate check should be avoided.
2124 User controls the value of the gate through the parameter "gate_status". */
2125 gate_status
= pass
->has_gate
? pass
->gate() : true;
2126 gate_status
= override_gate_status (pass
, current_function_decl
, gate_status
);
2128 /* Override gate with plugin. */
2129 invoke_plugin_callbacks (PLUGIN_OVERRIDE_GATE
, &gate_status
);
2133 /* Run so passes selectively disabling themselves on a given function
2134 are not miscounted. */
2135 if (profile_report
&& cfun
&& (cfun
->curr_properties
& PROP_cfg
))
2137 check_profile_consistency (pass
->static_pass_number
, 0, false);
2138 check_profile_consistency (pass
->static_pass_number
, 1, false);
2140 current_pass
= NULL
;
2144 /* Pass execution event trigger: useful to identify passes being
2146 invoke_plugin_callbacks (PLUGIN_PASS_EXECUTION
, pass
);
2148 /* SIPLE IPA passes do not handle callgraphs with IPA transforms in it.
2149 Apply all trnasforms first. */
2150 if (pass
->type
== SIMPLE_IPA_PASS
)
2152 bool applied
= false;
2153 do_per_function (apply_ipa_transforms
, (void *)&applied
);
2155 symtab_remove_unreachable_nodes (true, dump_file
);
2156 /* Restore current_pass. */
2157 current_pass
= pass
;
2160 if (!quiet_flag
&& !cfun
)
2161 fprintf (stderr
, " <%s>", pass
->name
? pass
->name
: "");
2163 /* Note that the folders should only create gimple expressions.
2164 This is a hack until the new folder is ready. */
2165 in_gimple_form
= (cfun
&& (cfun
->curr_properties
& PROP_trees
)) != 0;
2167 pass_init_dump_file (pass
);
2169 /* Run pre-pass verification. */
2170 execute_todo (pass
->todo_flags_start
);
2172 #ifdef ENABLE_CHECKING
2173 do_per_function (verify_curr_properties
,
2174 (void *)(size_t)pass
->properties_required
);
2177 /* If a timevar is present, start it. */
2178 if (pass
->tv_id
!= TV_NONE
)
2179 timevar_push (pass
->tv_id
);
2182 if (pass
->has_execute
)
2184 todo_after
= pass
->execute ();
2185 do_per_function (clear_last_verified
, NULL
);
2189 if (pass
->tv_id
!= TV_NONE
)
2190 timevar_pop (pass
->tv_id
);
2192 do_per_function (update_properties_after_pass
, pass
);
2194 if (profile_report
&& cfun
&& (cfun
->curr_properties
& PROP_cfg
))
2195 check_profile_consistency (pass
->static_pass_number
, 0, true);
2197 /* Run post-pass cleanup and verification. */
2198 execute_todo (todo_after
| pass
->todo_flags_finish
);
2199 if (profile_report
&& cfun
&& (cfun
->curr_properties
& PROP_cfg
))
2200 check_profile_consistency (pass
->static_pass_number
, 1, true);
2202 verify_interpass_invariants ();
2203 do_per_function (execute_function_dump
, NULL
);
2204 if (pass
->type
== IPA_PASS
)
2206 struct cgraph_node
*node
;
2207 FOR_EACH_FUNCTION_WITH_GIMPLE_BODY (node
)
2208 node
->ipa_transforms_to_apply
.safe_push ((struct ipa_opt_pass_d
*)pass
);
2211 if (!current_function_decl
)
2212 cgraph_process_new_functions ();
2214 pass_fini_dump_file (pass
);
2216 if (pass
->type
!= SIMPLE_IPA_PASS
&& pass
->type
!= IPA_PASS
)
2217 gcc_assert (!(cfun
->curr_properties
& PROP_trees
)
2218 || pass
->type
!= RTL_PASS
);
2220 current_pass
= NULL
;
2222 /* Signal this is a suitable GC collection point. */
2223 if (!((todo_after
| pass
->todo_flags_finish
) & TODO_do_not_ggc_collect
))
2230 execute_pass_list (struct opt_pass
*pass
)
2234 gcc_assert (pass
->type
== GIMPLE_PASS
2235 || pass
->type
== RTL_PASS
);
2236 if (execute_one_pass (pass
) && pass
->sub
)
2237 execute_pass_list (pass
->sub
);
2243 /* Same as execute_pass_list but assume that subpasses of IPA passes
2244 are local passes. If SET is not NULL, write out summaries of only
2245 those node in SET. */
2248 ipa_write_summaries_2 (struct opt_pass
*pass
, struct lto_out_decl_state
*state
)
2252 struct ipa_opt_pass_d
*ipa_pass
= (struct ipa_opt_pass_d
*)pass
;
2253 gcc_assert (!current_function_decl
);
2255 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
2256 if (pass
->type
== IPA_PASS
2257 && ipa_pass
->write_summary
2258 && ((!pass
->has_gate
) || pass
->gate ()))
2260 /* If a timevar is present, start it. */
2262 timevar_push (pass
->tv_id
);
2264 pass_init_dump_file (pass
);
2266 ipa_pass
->write_summary ();
2268 pass_fini_dump_file (pass
);
2270 /* If a timevar is present, start it. */
2272 timevar_pop (pass
->tv_id
);
2275 if (pass
->sub
&& pass
->sub
->type
!= GIMPLE_PASS
)
2276 ipa_write_summaries_2 (pass
->sub
, state
);
2282 /* Helper function of ipa_write_summaries. Creates and destroys the
2283 decl state and calls ipa_write_summaries_2 for all passes that have
2284 summaries. SET is the set of nodes to be written. */
2287 ipa_write_summaries_1 (lto_symtab_encoder_t encoder
)
2289 pass_manager
*passes
= g
->get_passes ();
2290 struct lto_out_decl_state
*state
= lto_new_out_decl_state ();
2291 state
->symtab_node_encoder
= encoder
;
2293 lto_push_out_decl_state (state
);
2295 gcc_assert (!flag_wpa
);
2296 ipa_write_summaries_2 (passes
->all_regular_ipa_passes
, state
);
2297 ipa_write_summaries_2 (passes
->all_lto_gen_passes
, state
);
2299 gcc_assert (lto_get_out_decl_state () == state
);
2300 lto_pop_out_decl_state ();
2301 lto_delete_out_decl_state (state
);
2304 /* Write out summaries for all the nodes in the callgraph. */
2307 ipa_write_summaries (void)
2309 lto_symtab_encoder_t encoder
;
2311 struct varpool_node
*vnode
;
2312 struct cgraph_node
*node
;
2313 struct cgraph_node
**order
;
2315 if (!flag_generate_lto
|| seen_error ())
2318 encoder
= lto_symtab_encoder_new (false);
2320 /* Create the callgraph set in the same order used in
2321 cgraph_expand_all_functions. This mostly facilitates debugging,
2322 since it causes the gimple file to be processed in the same order
2323 as the source code. */
2324 order
= XCNEWVEC (struct cgraph_node
*, cgraph_n_nodes
);
2325 order_pos
= ipa_reverse_postorder (order
);
2326 gcc_assert (order_pos
== cgraph_n_nodes
);
2328 for (i
= order_pos
- 1; i
>= 0; i
--)
2330 struct cgraph_node
*node
= order
[i
];
2332 if (cgraph_function_with_gimple_body_p (node
))
2334 /* When streaming out references to statements as part of some IPA
2335 pass summary, the statements need to have uids assigned and the
2336 following does that for all the IPA passes here. Naturally, this
2337 ordering then matches the one IPA-passes get in their stmt_fixup
2340 push_cfun (DECL_STRUCT_FUNCTION (node
->symbol
.decl
));
2341 renumber_gimple_stmt_uids ();
2344 if (node
->symbol
.definition
)
2345 lto_set_symtab_encoder_in_partition (encoder
, (symtab_node
)node
);
2348 FOR_EACH_DEFINED_FUNCTION (node
)
2349 if (node
->symbol
.alias
)
2350 lto_set_symtab_encoder_in_partition (encoder
, (symtab_node
)node
);
2351 FOR_EACH_DEFINED_VARIABLE (vnode
)
2352 lto_set_symtab_encoder_in_partition (encoder
, (symtab_node
)vnode
);
2354 ipa_write_summaries_1 (compute_ltrans_boundary (encoder
));
2359 /* Same as execute_pass_list but assume that subpasses of IPA passes
2360 are local passes. If SET is not NULL, write out optimization summaries of
2361 only those node in SET. */
2364 ipa_write_optimization_summaries_1 (struct opt_pass
*pass
, struct lto_out_decl_state
*state
)
2368 struct ipa_opt_pass_d
*ipa_pass
= (struct ipa_opt_pass_d
*)pass
;
2369 gcc_assert (!current_function_decl
);
2371 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
2372 if (pass
->type
== IPA_PASS
2373 && ipa_pass
->write_optimization_summary
2374 && ((!pass
->has_gate
) || pass
->gate ()))
2376 /* If a timevar is present, start it. */
2378 timevar_push (pass
->tv_id
);
2380 pass_init_dump_file (pass
);
2382 ipa_pass
->write_optimization_summary ();
2384 pass_fini_dump_file (pass
);
2386 /* If a timevar is present, start it. */
2388 timevar_pop (pass
->tv_id
);
2391 if (pass
->sub
&& pass
->sub
->type
!= GIMPLE_PASS
)
2392 ipa_write_optimization_summaries_1 (pass
->sub
, state
);
2398 /* Write all the optimization summaries for the cgraph nodes in SET. If SET is
2399 NULL, write out all summaries of all nodes. */
2402 ipa_write_optimization_summaries (lto_symtab_encoder_t encoder
)
2404 struct lto_out_decl_state
*state
= lto_new_out_decl_state ();
2405 lto_symtab_encoder_iterator lsei
;
2406 state
->symtab_node_encoder
= encoder
;
2408 lto_push_out_decl_state (state
);
2409 for (lsei
= lsei_start_function_in_partition (encoder
);
2410 !lsei_end_p (lsei
); lsei_next_function_in_partition (&lsei
))
2412 struct cgraph_node
*node
= lsei_cgraph_node (lsei
);
2413 /* When streaming out references to statements as part of some IPA
2414 pass summary, the statements need to have uids assigned.
2416 For functions newly born at WPA stage we need to initialize
2418 if (node
->symbol
.definition
2419 && gimple_has_body_p (node
->symbol
.decl
))
2421 push_cfun (DECL_STRUCT_FUNCTION (node
->symbol
.decl
));
2422 renumber_gimple_stmt_uids ();
2427 gcc_assert (flag_wpa
);
2428 pass_manager
*passes
= g
->get_passes ();
2429 ipa_write_optimization_summaries_1 (passes
->all_regular_ipa_passes
, state
);
2430 ipa_write_optimization_summaries_1 (passes
->all_lto_gen_passes
, state
);
2432 gcc_assert (lto_get_out_decl_state () == state
);
2433 lto_pop_out_decl_state ();
2434 lto_delete_out_decl_state (state
);
2437 /* Same as execute_pass_list but assume that subpasses of IPA passes
2438 are local passes. */
2441 ipa_read_summaries_1 (struct opt_pass
*pass
)
2445 struct ipa_opt_pass_d
*ipa_pass
= (struct ipa_opt_pass_d
*) pass
;
2447 gcc_assert (!current_function_decl
);
2449 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
2451 if ((!pass
->has_gate
) || pass
->gate ())
2453 if (pass
->type
== IPA_PASS
&& ipa_pass
->read_summary
)
2455 /* If a timevar is present, start it. */
2457 timevar_push (pass
->tv_id
);
2459 pass_init_dump_file (pass
);
2461 ipa_pass
->read_summary ();
2463 pass_fini_dump_file (pass
);
2467 timevar_pop (pass
->tv_id
);
2470 if (pass
->sub
&& pass
->sub
->type
!= GIMPLE_PASS
)
2471 ipa_read_summaries_1 (pass
->sub
);
2478 /* Read all the summaries for all_regular_ipa_passes and all_lto_gen_passes. */
2481 ipa_read_summaries (void)
2483 pass_manager
*passes
= g
->get_passes ();
2484 ipa_read_summaries_1 (passes
->all_regular_ipa_passes
);
2485 ipa_read_summaries_1 (passes
->all_lto_gen_passes
);
2488 /* Same as execute_pass_list but assume that subpasses of IPA passes
2489 are local passes. */
2492 ipa_read_optimization_summaries_1 (struct opt_pass
*pass
)
2496 struct ipa_opt_pass_d
*ipa_pass
= (struct ipa_opt_pass_d
*) pass
;
2498 gcc_assert (!current_function_decl
);
2500 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
2502 if ((!pass
->has_gate
) || pass
->gate ())
2504 if (pass
->type
== IPA_PASS
&& ipa_pass
->read_optimization_summary
)
2506 /* If a timevar is present, start it. */
2508 timevar_push (pass
->tv_id
);
2510 pass_init_dump_file (pass
);
2512 ipa_pass
->read_optimization_summary ();
2514 pass_fini_dump_file (pass
);
2518 timevar_pop (pass
->tv_id
);
2521 if (pass
->sub
&& pass
->sub
->type
!= GIMPLE_PASS
)
2522 ipa_read_optimization_summaries_1 (pass
->sub
);
2528 /* Read all the summaries for all_regular_ipa_passes and all_lto_gen_passes. */
2531 ipa_read_optimization_summaries (void)
2533 pass_manager
*passes
= g
->get_passes ();
2534 ipa_read_optimization_summaries_1 (passes
->all_regular_ipa_passes
);
2535 ipa_read_optimization_summaries_1 (passes
->all_lto_gen_passes
);
2538 /* Same as execute_pass_list but assume that subpasses of IPA passes
2539 are local passes. */
2541 execute_ipa_pass_list (struct opt_pass
*pass
)
2545 gcc_assert (!current_function_decl
);
2547 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
2548 if (execute_one_pass (pass
) && pass
->sub
)
2550 if (pass
->sub
->type
== GIMPLE_PASS
)
2552 invoke_plugin_callbacks (PLUGIN_EARLY_GIMPLE_PASSES_START
, NULL
);
2553 do_per_function_toporder ((void (*)(void *))execute_pass_list
,
2555 invoke_plugin_callbacks (PLUGIN_EARLY_GIMPLE_PASSES_END
, NULL
);
2557 else if (pass
->sub
->type
== SIMPLE_IPA_PASS
2558 || pass
->sub
->type
== IPA_PASS
)
2559 execute_ipa_pass_list (pass
->sub
);
2563 gcc_assert (!current_function_decl
);
2564 cgraph_process_new_functions ();
2570 /* Execute stmt fixup hooks of all passes in PASS for NODE and STMTS. */
2573 execute_ipa_stmt_fixups (struct opt_pass
*pass
,
2574 struct cgraph_node
*node
, gimple
*stmts
)
2578 /* Execute all of the IPA_PASSes in the list. */
2579 if (pass
->type
== IPA_PASS
2580 && ((!pass
->has_gate
) || pass
->gate ()))
2582 struct ipa_opt_pass_d
*ipa_pass
= (struct ipa_opt_pass_d
*) pass
;
2584 if (ipa_pass
->stmt_fixup
)
2586 pass_init_dump_file (pass
);
2587 /* If a timevar is present, start it. */
2589 timevar_push (pass
->tv_id
);
2591 ipa_pass
->stmt_fixup (node
, stmts
);
2595 timevar_pop (pass
->tv_id
);
2596 pass_fini_dump_file (pass
);
2599 execute_ipa_stmt_fixups (pass
->sub
, node
, stmts
);
2605 /* Execute stmt fixup hooks of all IPA passes for NODE and STMTS. */
2608 execute_all_ipa_stmt_fixups (struct cgraph_node
*node
, gimple
*stmts
)
2610 pass_manager
*passes
= g
->get_passes ();
2611 execute_ipa_stmt_fixups (passes
->all_regular_ipa_passes
, node
, stmts
);
2615 extern void debug_properties (unsigned int);
2616 extern void dump_properties (FILE *, unsigned int);
2619 dump_properties (FILE *dump
, unsigned int props
)
2621 fprintf (dump
, "Properties:\n");
2622 if (props
& PROP_gimple_any
)
2623 fprintf (dump
, "PROP_gimple_any\n");
2624 if (props
& PROP_gimple_lcf
)
2625 fprintf (dump
, "PROP_gimple_lcf\n");
2626 if (props
& PROP_gimple_leh
)
2627 fprintf (dump
, "PROP_gimple_leh\n");
2628 if (props
& PROP_cfg
)
2629 fprintf (dump
, "PROP_cfg\n");
2630 if (props
& PROP_ssa
)
2631 fprintf (dump
, "PROP_ssa\n");
2632 if (props
& PROP_no_crit_edges
)
2633 fprintf (dump
, "PROP_no_crit_edges\n");
2634 if (props
& PROP_rtl
)
2635 fprintf (dump
, "PROP_rtl\n");
2636 if (props
& PROP_gimple_lomp
)
2637 fprintf (dump
, "PROP_gimple_lomp\n");
2638 if (props
& PROP_gimple_lcx
)
2639 fprintf (dump
, "PROP_gimple_lcx\n");
2640 if (props
& PROP_gimple_lvec
)
2641 fprintf (dump
, "PROP_gimple_lvec\n");
2642 if (props
& PROP_cfglayout
)
2643 fprintf (dump
, "PROP_cfglayout\n");
2647 debug_properties (unsigned int props
)
2649 dump_properties (stderr
, props
);
2652 /* Called by local passes to see if function is called by already processed nodes.
2653 Because we process nodes in topological order, this means that function is
2654 in recursive cycle or we introduced new direct calls. */
2656 function_called_by_processed_nodes_p (void)
2658 struct cgraph_edge
*e
;
2659 for (e
= cgraph_get_node (current_function_decl
)->callers
;
2663 if (e
->caller
->symbol
.decl
== current_function_decl
)
2665 if (!cgraph_function_with_gimple_body_p (e
->caller
))
2667 if (TREE_ASM_WRITTEN (e
->caller
->symbol
.decl
))
2669 if (!e
->caller
->process
&& !e
->caller
->global
.inlined_to
)
2674 fprintf (dump_file
, "Already processed call to:\n");
2675 dump_cgraph_node (dump_file
, e
->caller
);
2680 #include "gt-passes.h"