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
;
1170 /* Look at the static_pass_number and duplicate the pass
1171 if it is already added to a list. */
1173 static struct opt_pass
*
1174 make_pass_instance (struct opt_pass
*pass
, bool track_duplicates
)
1176 /* A nonzero static_pass_number indicates that the
1177 pass is already in the list. */
1178 if (pass
->static_pass_number
)
1180 struct opt_pass
*new_pass
;
1182 if (pass
->type
== GIMPLE_PASS
1183 || pass
->type
== RTL_PASS
1184 || pass
->type
== SIMPLE_IPA_PASS
)
1186 new_pass
= XNEW (struct opt_pass
);
1187 memcpy (new_pass
, pass
, sizeof (struct opt_pass
));
1189 else if (pass
->type
== IPA_PASS
)
1191 new_pass
= (struct opt_pass
*)XNEW (struct ipa_opt_pass_d
);
1192 memcpy (new_pass
, pass
, sizeof (struct ipa_opt_pass_d
));
1197 new_pass
->next
= NULL
;
1199 new_pass
->todo_flags_start
&= ~TODO_mark_first_instance
;
1201 /* Indicate to register_dump_files that this pass has duplicates,
1202 and so it should rename the dump file. The first instance will
1203 be -1, and be number of duplicates = -static_pass_number - 1.
1204 Subsequent instances will be > 0 and just the duplicate number. */
1205 if ((pass
->name
&& pass
->name
[0] != '*') || track_duplicates
)
1207 pass
->static_pass_number
-= 1;
1208 new_pass
->static_pass_number
= -pass
->static_pass_number
;
1214 pass
->todo_flags_start
|= TODO_mark_first_instance
;
1215 pass
->static_pass_number
= -1;
1217 invoke_plugin_callbacks (PLUGIN_NEW_PASS
, pass
);
1222 /* Add a pass to the pass list. Duplicate the pass if it's already
1225 static struct opt_pass
**
1226 next_pass_1 (struct opt_pass
**list
, struct opt_pass
*pass
)
1228 /* Every pass should have a name so that plugins can refer to them. */
1229 gcc_assert (pass
->name
!= NULL
);
1231 *list
= make_pass_instance (pass
, false);
1233 return &(*list
)->next
;
1236 /* List node for an inserted pass instance. We need to keep track of all
1237 the newly-added pass instances (with 'added_pass_nodes' defined below)
1238 so that we can register their dump files after pass-positioning is finished.
1239 Registering dumping files needs to be post-processed or the
1240 static_pass_number of the opt_pass object would be modified and mess up
1241 the dump file names of future pass instances to be added. */
1243 struct pass_list_node
1245 struct opt_pass
*pass
;
1246 struct pass_list_node
*next
;
1249 static struct pass_list_node
*added_pass_nodes
= NULL
;
1250 static struct pass_list_node
*prev_added_pass_node
;
1252 /* Insert the pass at the proper position. Return true if the pass
1253 is successfully added.
1255 NEW_PASS_INFO - new pass to be inserted
1256 PASS_LIST - root of the pass list to insert the new pass to */
1259 position_pass (struct register_pass_info
*new_pass_info
,
1260 struct opt_pass
**pass_list
)
1262 struct opt_pass
*pass
= *pass_list
, *prev_pass
= NULL
;
1263 bool success
= false;
1265 for ( ; pass
; prev_pass
= pass
, pass
= pass
->next
)
1267 /* Check if the current pass is of the same type as the new pass and
1268 matches the name and the instance number of the reference pass. */
1269 if (pass
->type
== new_pass_info
->pass
->type
1271 && !strcmp (pass
->name
, new_pass_info
->reference_pass_name
)
1272 && ((new_pass_info
->ref_pass_instance_number
== 0)
1273 || (new_pass_info
->ref_pass_instance_number
==
1274 pass
->static_pass_number
)
1275 || (new_pass_info
->ref_pass_instance_number
== 1
1276 && pass
->todo_flags_start
& TODO_mark_first_instance
)))
1278 struct opt_pass
*new_pass
;
1279 struct pass_list_node
*new_pass_node
;
1281 new_pass
= make_pass_instance (new_pass_info
->pass
, true);
1283 /* Insert the new pass instance based on the positioning op. */
1284 switch (new_pass_info
->pos_op
)
1286 case PASS_POS_INSERT_AFTER
:
1287 new_pass
->next
= pass
->next
;
1288 pass
->next
= new_pass
;
1290 /* Skip newly inserted pass to avoid repeated
1291 insertions in the case where the new pass and the
1292 existing one have the same name. */
1295 case PASS_POS_INSERT_BEFORE
:
1296 new_pass
->next
= pass
;
1298 prev_pass
->next
= new_pass
;
1300 *pass_list
= new_pass
;
1302 case PASS_POS_REPLACE
:
1303 new_pass
->next
= pass
->next
;
1305 prev_pass
->next
= new_pass
;
1307 *pass_list
= new_pass
;
1308 new_pass
->sub
= pass
->sub
;
1309 new_pass
->tv_id
= pass
->tv_id
;
1313 error ("invalid pass positioning operation");
1317 /* Save the newly added pass (instance) in the added_pass_nodes
1318 list so that we can register its dump file later. Note that
1319 we cannot register the dump file now because doing so will modify
1320 the static_pass_number of the opt_pass object and therefore
1321 mess up the dump file name of future instances. */
1322 new_pass_node
= XCNEW (struct pass_list_node
);
1323 new_pass_node
->pass
= new_pass
;
1324 if (!added_pass_nodes
)
1325 added_pass_nodes
= new_pass_node
;
1327 prev_added_pass_node
->next
= new_pass_node
;
1328 prev_added_pass_node
= new_pass_node
;
1333 if (pass
->sub
&& position_pass (new_pass_info
, &pass
->sub
))
1340 /* Hooks a new pass into the pass lists.
1342 PASS_INFO - pass information that specifies the opt_pass object,
1343 reference pass, instance number, and how to position
1347 register_pass (struct register_pass_info
*pass_info
)
1349 g
->get_passes ()->register_pass (pass_info
);
1354 pass_manager::register_pass (struct register_pass_info
*pass_info
)
1356 bool all_instances
, success
;
1358 /* The checks below could fail in buggy plugins. Existing GCC
1359 passes should never fail these checks, so we mention plugin in
1361 if (!pass_info
->pass
)
1362 fatal_error ("plugin cannot register a missing pass");
1364 if (!pass_info
->pass
->name
)
1365 fatal_error ("plugin cannot register an unnamed pass");
1367 if (!pass_info
->reference_pass_name
)
1369 ("plugin cannot register pass %qs without reference pass name",
1370 pass_info
->pass
->name
);
1372 /* Try to insert the new pass to the pass lists. We need to check
1373 all five lists as the reference pass could be in one (or all) of
1375 all_instances
= pass_info
->ref_pass_instance_number
== 0;
1376 success
= position_pass (pass_info
, &all_lowering_passes
);
1377 if (!success
|| all_instances
)
1378 success
|= position_pass (pass_info
, &all_small_ipa_passes
);
1379 if (!success
|| all_instances
)
1380 success
|= position_pass (pass_info
, &all_regular_ipa_passes
);
1381 if (!success
|| all_instances
)
1382 success
|= position_pass (pass_info
, &all_lto_gen_passes
);
1383 if (!success
|| all_instances
)
1384 success
|= position_pass (pass_info
, &all_late_ipa_passes
);
1385 if (!success
|| all_instances
)
1386 success
|= position_pass (pass_info
, &all_passes
);
1389 ("pass %qs not found but is referenced by new pass %qs",
1390 pass_info
->reference_pass_name
, pass_info
->pass
->name
);
1392 /* OK, we have successfully inserted the new pass. We need to register
1393 the dump files for the newly added pass and its duplicates (if any).
1394 Because the registration of plugin/backend passes happens after the
1395 command-line options are parsed, the options that specify single
1396 pass dumping (e.g. -fdump-tree-PASSNAME) cannot be used for new
1397 passes. Therefore we currently can only enable dumping of
1398 new passes when the 'dump-all' flags (e.g. -fdump-tree-all)
1399 are specified. While doing so, we also delete the pass_list_node
1400 objects created during pass positioning. */
1401 while (added_pass_nodes
)
1403 struct pass_list_node
*next_node
= added_pass_nodes
->next
;
1404 enum tree_dump_index tdi
;
1405 register_one_dump_file (added_pass_nodes
->pass
);
1406 if (added_pass_nodes
->pass
->type
== SIMPLE_IPA_PASS
1407 || added_pass_nodes
->pass
->type
== IPA_PASS
)
1409 else if (added_pass_nodes
->pass
->type
== GIMPLE_PASS
)
1413 /* Check if dump-all flag is specified. */
1414 if (get_dump_file_info (tdi
)->pstate
)
1415 get_dump_file_info (added_pass_nodes
->pass
->static_pass_number
)
1416 ->pstate
= get_dump_file_info (tdi
)->pstate
;
1417 XDELETE (added_pass_nodes
);
1418 added_pass_nodes
= next_node
;
1422 /* Construct the pass tree. The sequencing of passes is driven by
1423 the cgraph routines:
1425 finalize_compilation_unit ()
1426 for each node N in the cgraph
1427 cgraph_analyze_function (N)
1428 cgraph_lower_function (N) -> all_lowering_passes
1430 If we are optimizing, compile is then invoked:
1433 ipa_passes () -> all_small_ipa_passes
1434 -> Analysis of all_regular_ipa_passes
1435 * possible LTO streaming at copmilation time *
1436 -> Execution of all_regular_ipa_passes
1437 * possible LTO streaming at link time *
1438 -> all_late_ipa_passes
1439 expand_all_functions ()
1440 for each node N in the cgraph
1441 expand_function (N) -> Transformation of all_regular_ipa_passes
1446 pass_manager::operator new (size_t sz
)
1448 /* Ensure that all fields of the pass manager are zero-initialized. */
1449 return xcalloc (1, sz
);
1452 pass_manager::pass_manager (context
*ctxt
)
1453 : all_passes(NULL
), all_small_ipa_passes(NULL
), all_lowering_passes(NULL
),
1454 all_regular_ipa_passes(NULL
), all_lto_gen_passes(NULL
),
1455 all_late_ipa_passes(NULL
), passes_by_id(NULL
), passes_by_id_size(0),
1458 struct opt_pass
**p
;
1460 /* Initialize the pass_lists array. */
1461 #define DEF_PASS_LIST(LIST) pass_lists[PASS_LIST_NO_##LIST] = &LIST;
1463 #undef DEF_PASS_LIST
1465 /* Build the tree of passes. */
1467 #define INSERT_PASSES_AFTER(PASS) \
1470 #define PUSH_INSERT_PASSES_WITHIN(PASS) \
1472 struct opt_pass **p = &(PASS ## _1)->sub;
1474 #define POP_INSERT_PASSES() \
1477 #define NEXT_PASS(PASS, NUM) \
1479 gcc_assert (NULL == PASS ## _ ## NUM); \
1481 PASS ## _1 = make_##PASS (ctxt_); \
1484 gcc_assert (PASS ## _1); \
1485 PASS ## _ ## NUM = PASS ## _1->clone (); \
1487 p = next_pass_1 (p, PASS ## _ ## NUM); \
1490 #define TERMINATE_PASS_LIST() \
1493 #include "pass-instances.def"
1495 #undef INSERT_PASSES_AFTER
1496 #undef PUSH_INSERT_PASSES_WITHIN
1497 #undef POP_INSERT_PASSES
1499 #undef TERMINATE_PASS_LIST
1501 /* Register the passes with the tree dump code. */
1502 register_dump_files (all_lowering_passes
, PROP_gimple_any
);
1503 register_dump_files (all_small_ipa_passes
,
1504 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
1506 register_dump_files (all_regular_ipa_passes
,
1507 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
1509 register_dump_files (all_lto_gen_passes
,
1510 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
1512 register_dump_files (all_late_ipa_passes
,
1513 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
1515 register_dump_files (all_passes
,
1516 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
1520 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
1521 function CALLBACK for every function in the call graph. Otherwise,
1522 call CALLBACK on the current function. */
1525 do_per_function (void (*callback
) (void *data
), void *data
)
1527 if (current_function_decl
)
1531 struct cgraph_node
*node
;
1532 FOR_EACH_DEFINED_FUNCTION (node
)
1533 if (node
->symbol
.analyzed
&& gimple_has_body_p (node
->symbol
.decl
)
1534 && (!node
->clone_of
|| node
->symbol
.decl
!= node
->clone_of
->symbol
.decl
))
1536 push_cfun (DECL_STRUCT_FUNCTION (node
->symbol
.decl
));
1540 free_dominance_info (CDI_DOMINATORS
);
1541 free_dominance_info (CDI_POST_DOMINATORS
);
1549 /* Because inlining might remove no-longer reachable nodes, we need to
1550 keep the array visible to garbage collector to avoid reading collected
1553 static GTY ((length ("nnodes"))) cgraph_node_ptr
*order
;
1555 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
1556 function CALLBACK for every function in the call graph. Otherwise,
1557 call CALLBACK on the current function.
1558 This function is global so that plugins can use it. */
1560 do_per_function_toporder (void (*callback
) (void *data
), void *data
)
1564 if (current_function_decl
)
1568 gcc_assert (!order
);
1569 order
= ggc_alloc_vec_cgraph_node_ptr (cgraph_n_nodes
);
1570 nnodes
= ipa_reverse_postorder (order
);
1571 for (i
= nnodes
- 1; i
>= 0; i
--)
1572 order
[i
]->process
= 1;
1573 for (i
= nnodes
- 1; i
>= 0; i
--)
1575 struct cgraph_node
*node
= order
[i
];
1577 /* Allow possibly removed nodes to be garbage collected. */
1580 if (cgraph_function_with_gimple_body_p (node
))
1582 push_cfun (DECL_STRUCT_FUNCTION (node
->symbol
.decl
));
1584 free_dominance_info (CDI_DOMINATORS
);
1585 free_dominance_info (CDI_POST_DOMINATORS
);
1596 /* Helper function to perform function body dump. */
1599 execute_function_dump (void *data ATTRIBUTE_UNUSED
)
1601 if (dump_file
&& current_function_decl
)
1603 if (cfun
->curr_properties
& PROP_trees
)
1604 dump_function_to_file (current_function_decl
, dump_file
, dump_flags
);
1606 print_rtl_with_bb (dump_file
, get_insns (), dump_flags
);
1608 /* Flush the file. If verification fails, we won't be able to
1609 close the file before aborting. */
1612 if ((cfun
->curr_properties
& PROP_cfg
)
1613 && (dump_flags
& TDF_GRAPH
))
1614 print_graph_cfg (dump_file_name
, cfun
);
1618 static struct profile_record
*profile_record
;
1620 /* Do profile consistency book-keeping for the pass with static number INDEX.
1621 If SUBPASS is zero, we run _before_ the pass, and if SUBPASS is one, then
1622 we run _after_ the pass. RUN is true if the pass really runs, or FALSE
1623 if we are only book-keeping on passes that may have selectively disabled
1624 themselves on a given function. */
1626 check_profile_consistency (int index
, int subpass
, bool run
)
1628 pass_manager
*passes
= g
->get_passes ();
1631 if (!profile_record
)
1632 profile_record
= XCNEWVEC (struct profile_record
,
1633 passes
->passes_by_id_size
);
1634 gcc_assert (index
< passes
->passes_by_id_size
&& index
>= 0);
1635 gcc_assert (subpass
< 2);
1636 profile_record
[index
].run
|= run
;
1637 account_profile_record (&profile_record
[index
], subpass
);
1640 /* Output profile consistency. */
1643 dump_profile_report (void)
1645 g
->get_passes ()->dump_profile_report ();
1649 pass_manager::dump_profile_report () const
1652 int last_freq_in
= 0, last_count_in
= 0, last_freq_out
= 0, last_count_out
= 0;
1653 gcov_type last_time
= 0, last_size
= 0;
1654 double rel_time_change
, rel_size_change
;
1655 int last_reported
= 0;
1657 if (!profile_record
)
1659 fprintf (stderr
, "\nProfile consistency report:\n\n");
1660 fprintf (stderr
, "Pass name |mismatch in |mismated out|Overall\n");
1661 fprintf (stderr
, " |freq count |freq count |size time\n");
1663 for (i
= 0; i
< passes_by_id_size
; i
++)
1664 for (j
= 0 ; j
< 2; j
++)
1665 if (profile_record
[i
].run
)
1668 rel_time_change
= (profile_record
[i
].time
[j
]
1669 - (double)last_time
) * 100 / (double)last_time
;
1671 rel_time_change
= 0;
1673 rel_size_change
= (profile_record
[i
].size
[j
]
1674 - (double)last_size
) * 100 / (double)last_size
;
1676 rel_size_change
= 0;
1678 if (profile_record
[i
].num_mismatched_freq_in
[j
] != last_freq_in
1679 || profile_record
[i
].num_mismatched_freq_out
[j
] != last_freq_out
1680 || profile_record
[i
].num_mismatched_count_in
[j
] != last_count_in
1681 || profile_record
[i
].num_mismatched_count_out
[j
] != last_count_out
1682 || rel_time_change
|| rel_size_change
)
1685 fprintf (stderr
, "%-20s %s",
1686 passes_by_id
[i
]->name
,
1687 j
? "(after TODO)" : " ");
1688 if (profile_record
[i
].num_mismatched_freq_in
[j
] != last_freq_in
)
1689 fprintf (stderr
, "| %+5i",
1690 profile_record
[i
].num_mismatched_freq_in
[j
]
1693 fprintf (stderr
, "| ");
1694 if (profile_record
[i
].num_mismatched_count_in
[j
] != last_count_in
)
1695 fprintf (stderr
, " %+5i",
1696 profile_record
[i
].num_mismatched_count_in
[j
]
1699 fprintf (stderr
, " ");
1700 if (profile_record
[i
].num_mismatched_freq_out
[j
] != last_freq_out
)
1701 fprintf (stderr
, "| %+5i",
1702 profile_record
[i
].num_mismatched_freq_out
[j
]
1705 fprintf (stderr
, "| ");
1706 if (profile_record
[i
].num_mismatched_count_out
[j
] != last_count_out
)
1707 fprintf (stderr
, " %+5i",
1708 profile_record
[i
].num_mismatched_count_out
[j
]
1711 fprintf (stderr
, " ");
1713 /* Size/time units change across gimple and RTL. */
1714 if (i
== pass_expand_1
->static_pass_number
)
1715 fprintf (stderr
, "|----------");
1718 if (rel_size_change
)
1719 fprintf (stderr
, "| %+8.4f%%", rel_size_change
);
1721 fprintf (stderr
, "| ");
1722 if (rel_time_change
)
1723 fprintf (stderr
, " %+8.4f%%", rel_time_change
);
1725 fprintf (stderr
, "\n");
1726 last_freq_in
= profile_record
[i
].num_mismatched_freq_in
[j
];
1727 last_freq_out
= profile_record
[i
].num_mismatched_freq_out
[j
];
1728 last_count_in
= profile_record
[i
].num_mismatched_count_in
[j
];
1729 last_count_out
= profile_record
[i
].num_mismatched_count_out
[j
];
1731 else if (j
&& last_reported
!= i
)
1734 fprintf (stderr
, "%-20s ------------| | |\n",
1735 passes_by_id
[i
]->name
);
1737 last_time
= profile_record
[i
].time
[j
];
1738 last_size
= profile_record
[i
].size
[j
];
1742 /* Perform all TODO actions that ought to be done on each function. */
1745 execute_function_todo (void *data
)
1747 unsigned int flags
= (size_t)data
;
1748 flags
&= ~cfun
->last_verified
;
1752 /* Always cleanup the CFG before trying to update SSA. */
1753 if (flags
& TODO_cleanup_cfg
)
1755 cleanup_tree_cfg ();
1757 /* When cleanup_tree_cfg merges consecutive blocks, it may
1758 perform some simplistic propagation when removing single
1759 valued PHI nodes. This propagation may, in turn, cause the
1760 SSA form to become out-of-date (see PR 22037). So, even
1761 if the parent pass had not scheduled an SSA update, we may
1762 still need to do one. */
1763 if (!(flags
& TODO_update_ssa_any
) && need_ssa_update_p (cfun
))
1764 flags
|= TODO_update_ssa
;
1767 if (flags
& TODO_update_ssa_any
)
1769 unsigned update_flags
= flags
& TODO_update_ssa_any
;
1770 update_ssa (update_flags
);
1771 cfun
->last_verified
&= ~TODO_verify_ssa
;
1774 if (flag_tree_pta
&& (flags
& TODO_rebuild_alias
))
1775 compute_may_aliases ();
1777 if (optimize
&& (flags
& TODO_update_address_taken
))
1778 execute_update_addresses_taken ();
1780 if (flags
& TODO_remove_unused_locals
)
1781 remove_unused_locals ();
1783 if (flags
& TODO_rebuild_frequencies
)
1784 rebuild_frequencies ();
1786 if (flags
& TODO_rebuild_cgraph_edges
)
1787 rebuild_cgraph_edges ();
1789 /* If we've seen errors do not bother running any verifiers. */
1793 #if defined ENABLE_CHECKING
1794 if (flags
& TODO_verify_ssa
1795 || (current_loops
&& loops_state_satisfies_p (LOOP_CLOSED_SSA
)))
1797 verify_gimple_in_cfg (cfun
);
1800 else if (flags
& TODO_verify_stmts
)
1801 verify_gimple_in_cfg (cfun
);
1802 if (flags
& TODO_verify_flow
)
1803 verify_flow_info ();
1804 if (current_loops
&& loops_state_satisfies_p (LOOP_CLOSED_SSA
))
1805 verify_loop_closed_ssa (false);
1806 if (flags
& TODO_verify_rtl_sharing
)
1807 verify_rtl_sharing ();
1810 cfun
->last_verified
= flags
& TODO_verify_all
;
1813 /* Perform all TODO actions. */
1815 execute_todo (unsigned int flags
)
1817 #if defined ENABLE_CHECKING
1819 && need_ssa_update_p (cfun
))
1820 gcc_assert (flags
& TODO_update_ssa_any
);
1823 timevar_push (TV_TODO
);
1825 /* Inform the pass whether it is the first time it is run. */
1826 first_pass_instance
= (flags
& TODO_mark_first_instance
) != 0;
1828 statistics_fini_pass ();
1830 do_per_function (execute_function_todo
, (void *)(size_t) flags
);
1832 /* Always remove functions just as before inlining: IPA passes might be
1833 interested to see bodies of extern inline functions that are not inlined
1834 to analyze side effects. The full removal is done just at the end
1835 of IPA pass queue. */
1836 if (flags
& TODO_remove_functions
)
1839 symtab_remove_unreachable_nodes (true, dump_file
);
1842 if ((flags
& TODO_dump_symtab
) && dump_file
&& !current_function_decl
)
1845 dump_symtab (dump_file
);
1846 /* Flush the file. If verification fails, we won't be able to
1847 close the file before aborting. */
1851 /* Now that the dumping has been done, we can get rid of the optional
1853 if (flags
& TODO_df_finish
)
1854 df_finish_pass ((flags
& TODO_df_verify
) != 0);
1856 timevar_pop (TV_TODO
);
1859 /* Verify invariants that should hold between passes. This is a place
1860 to put simple sanity checks. */
1863 verify_interpass_invariants (void)
1865 gcc_checking_assert (!fold_deferring_overflow_warnings_p ());
1868 /* Clear the last verified flag. */
1871 clear_last_verified (void *data ATTRIBUTE_UNUSED
)
1873 cfun
->last_verified
= 0;
1876 /* Helper function. Verify that the properties has been turn into the
1877 properties expected by the pass. */
1879 #ifdef ENABLE_CHECKING
1881 verify_curr_properties (void *data
)
1883 unsigned int props
= (size_t)data
;
1884 gcc_assert ((cfun
->curr_properties
& props
) == props
);
1888 /* Initialize pass dump file. */
1889 /* This is non-static so that the plugins can use it. */
1892 pass_init_dump_file (struct opt_pass
*pass
)
1894 /* If a dump file name is present, open it if enabled. */
1895 if (pass
->static_pass_number
!= -1)
1897 timevar_push (TV_DUMP
);
1898 bool initializing_dump
= !dump_initialized_p (pass
->static_pass_number
);
1899 dump_file_name
= get_dump_file_name (pass
->static_pass_number
);
1900 dump_start (pass
->static_pass_number
, &dump_flags
);
1901 if (dump_file
&& current_function_decl
)
1902 dump_function_header (dump_file
, current_function_decl
, dump_flags
);
1903 if (initializing_dump
1904 && dump_file
&& (dump_flags
& TDF_GRAPH
)
1905 && cfun
&& (cfun
->curr_properties
& PROP_cfg
))
1906 clean_graph_dump_file (dump_file_name
);
1907 timevar_pop (TV_DUMP
);
1908 return initializing_dump
;
1914 /* Flush PASS dump file. */
1915 /* This is non-static so that plugins can use it. */
1918 pass_fini_dump_file (struct opt_pass
*pass
)
1920 timevar_push (TV_DUMP
);
1922 /* Flush and close dump file. */
1925 free (CONST_CAST (char *, dump_file_name
));
1926 dump_file_name
= NULL
;
1929 dump_finish (pass
->static_pass_number
);
1930 timevar_pop (TV_DUMP
);
1933 /* After executing the pass, apply expected changes to the function
1937 update_properties_after_pass (void *data
)
1939 struct opt_pass
*pass
= (struct opt_pass
*) data
;
1940 cfun
->curr_properties
= (cfun
->curr_properties
| pass
->properties_provided
)
1941 & ~pass
->properties_destroyed
;
1944 /* Execute summary generation for all of the passes in IPA_PASS. */
1947 execute_ipa_summary_passes (struct ipa_opt_pass_d
*ipa_pass
)
1951 struct opt_pass
*pass
= ipa_pass
;
1953 /* Execute all of the IPA_PASSes in the list. */
1954 if (ipa_pass
->type
== IPA_PASS
1955 && ((!pass
->has_gate
) || pass
->gate ())
1956 && ipa_pass
->generate_summary
)
1958 pass_init_dump_file (pass
);
1960 /* If a timevar is present, start it. */
1962 timevar_push (pass
->tv_id
);
1964 ipa_pass
->generate_summary ();
1968 timevar_pop (pass
->tv_id
);
1970 pass_fini_dump_file (pass
);
1972 ipa_pass
= (struct ipa_opt_pass_d
*)ipa_pass
->next
;
1976 /* Execute IPA_PASS function transform on NODE. */
1979 execute_one_ipa_transform_pass (struct cgraph_node
*node
,
1980 struct ipa_opt_pass_d
*ipa_pass
)
1982 struct opt_pass
*pass
= ipa_pass
;
1983 unsigned int todo_after
= 0;
1985 current_pass
= pass
;
1986 if (!ipa_pass
->function_transform
)
1989 /* Note that the folders should only create gimple expressions.
1990 This is a hack until the new folder is ready. */
1991 in_gimple_form
= (cfun
&& (cfun
->curr_properties
& PROP_trees
)) != 0;
1993 pass_init_dump_file (pass
);
1995 /* Run pre-pass verification. */
1996 execute_todo (ipa_pass
->function_transform_todo_flags_start
);
1998 /* If a timevar is present, start it. */
1999 if (pass
->tv_id
!= TV_NONE
)
2000 timevar_push (pass
->tv_id
);
2003 todo_after
= ipa_pass
->function_transform (node
);
2006 if (pass
->tv_id
!= TV_NONE
)
2007 timevar_pop (pass
->tv_id
);
2009 if (profile_report
&& cfun
&& (cfun
->curr_properties
& PROP_cfg
))
2010 check_profile_consistency (pass
->static_pass_number
, 0, true);
2012 /* Run post-pass cleanup and verification. */
2013 execute_todo (todo_after
);
2014 verify_interpass_invariants ();
2015 if (profile_report
&& cfun
&& (cfun
->curr_properties
& PROP_cfg
))
2016 check_profile_consistency (pass
->static_pass_number
, 1, true);
2018 do_per_function (execute_function_dump
, NULL
);
2019 pass_fini_dump_file (pass
);
2021 current_pass
= NULL
;
2023 /* Signal this is a suitable GC collection point. */
2024 if (!(todo_after
& TODO_do_not_ggc_collect
))
2028 /* For the current function, execute all ipa transforms. */
2031 execute_all_ipa_transforms (void)
2033 struct cgraph_node
*node
;
2036 node
= cgraph_get_node (current_function_decl
);
2038 if (node
->ipa_transforms_to_apply
.exists ())
2042 for (i
= 0; i
< node
->ipa_transforms_to_apply
.length (); i
++)
2043 execute_one_ipa_transform_pass (node
, node
->ipa_transforms_to_apply
[i
]);
2044 node
->ipa_transforms_to_apply
.release ();
2048 /* Callback for do_per_function to apply all IPA transforms. */
2051 apply_ipa_transforms (void *data
)
2053 struct cgraph_node
*node
= cgraph_get_node (current_function_decl
);
2054 if (!node
->global
.inlined_to
&& node
->ipa_transforms_to_apply
.exists ())
2056 *(bool *)data
= true;
2057 execute_all_ipa_transforms();
2058 rebuild_cgraph_edges ();
2062 /* Check if PASS is explicitly disabled or enabled and return
2063 the gate status. FUNC is the function to be processed, and
2064 GATE_STATUS is the gate status determined by pass manager by
2068 override_gate_status (struct opt_pass
*pass
, tree func
, bool gate_status
)
2070 bool explicitly_enabled
= false;
2071 bool explicitly_disabled
= false;
2074 = is_pass_explicitly_enabled_or_disabled (pass
, func
,
2075 enabled_pass_uid_range_tab
);
2077 = is_pass_explicitly_enabled_or_disabled (pass
, func
,
2078 disabled_pass_uid_range_tab
);
2080 gate_status
= !explicitly_disabled
&& (gate_status
|| explicitly_enabled
);
2089 execute_one_pass (struct opt_pass
*pass
)
2091 unsigned int todo_after
= 0;
2095 /* IPA passes are executed on whole program, so cfun should be NULL.
2096 Other passes need function context set. */
2097 if (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
)
2098 gcc_assert (!cfun
&& !current_function_decl
);
2100 gcc_assert (cfun
&& current_function_decl
);
2102 current_pass
= pass
;
2104 /* Check whether gate check should be avoided.
2105 User controls the value of the gate through the parameter "gate_status". */
2106 gate_status
= pass
->has_gate
? pass
->gate() : true;
2107 gate_status
= override_gate_status (pass
, current_function_decl
, gate_status
);
2109 /* Override gate with plugin. */
2110 invoke_plugin_callbacks (PLUGIN_OVERRIDE_GATE
, &gate_status
);
2114 /* Run so passes selectively disabling themselves on a given function
2115 are not miscounted. */
2116 if (profile_report
&& cfun
&& (cfun
->curr_properties
& PROP_cfg
))
2118 check_profile_consistency (pass
->static_pass_number
, 0, false);
2119 check_profile_consistency (pass
->static_pass_number
, 1, false);
2121 current_pass
= NULL
;
2125 /* Pass execution event trigger: useful to identify passes being
2127 invoke_plugin_callbacks (PLUGIN_PASS_EXECUTION
, pass
);
2129 /* SIPLE IPA passes do not handle callgraphs with IPA transforms in it.
2130 Apply all trnasforms first. */
2131 if (pass
->type
== SIMPLE_IPA_PASS
)
2133 bool applied
= false;
2134 do_per_function (apply_ipa_transforms
, (void *)&applied
);
2136 symtab_remove_unreachable_nodes (true, dump_file
);
2137 /* Restore current_pass. */
2138 current_pass
= pass
;
2141 if (!quiet_flag
&& !cfun
)
2142 fprintf (stderr
, " <%s>", pass
->name
? pass
->name
: "");
2144 /* Note that the folders should only create gimple expressions.
2145 This is a hack until the new folder is ready. */
2146 in_gimple_form
= (cfun
&& (cfun
->curr_properties
& PROP_trees
)) != 0;
2148 pass_init_dump_file (pass
);
2150 /* Run pre-pass verification. */
2151 execute_todo (pass
->todo_flags_start
);
2153 #ifdef ENABLE_CHECKING
2154 do_per_function (verify_curr_properties
,
2155 (void *)(size_t)pass
->properties_required
);
2158 /* If a timevar is present, start it. */
2159 if (pass
->tv_id
!= TV_NONE
)
2160 timevar_push (pass
->tv_id
);
2163 if (pass
->has_execute
)
2165 todo_after
= pass
->execute ();
2166 do_per_function (clear_last_verified
, NULL
);
2170 if (pass
->tv_id
!= TV_NONE
)
2171 timevar_pop (pass
->tv_id
);
2173 do_per_function (update_properties_after_pass
, pass
);
2175 if (profile_report
&& cfun
&& (cfun
->curr_properties
& PROP_cfg
))
2176 check_profile_consistency (pass
->static_pass_number
, 0, true);
2178 /* Run post-pass cleanup and verification. */
2179 execute_todo (todo_after
| pass
->todo_flags_finish
);
2180 if (profile_report
&& cfun
&& (cfun
->curr_properties
& PROP_cfg
))
2181 check_profile_consistency (pass
->static_pass_number
, 1, true);
2183 verify_interpass_invariants ();
2184 do_per_function (execute_function_dump
, NULL
);
2185 if (pass
->type
== IPA_PASS
)
2187 struct cgraph_node
*node
;
2188 FOR_EACH_FUNCTION_WITH_GIMPLE_BODY (node
)
2189 node
->ipa_transforms_to_apply
.safe_push ((struct ipa_opt_pass_d
*)pass
);
2192 if (!current_function_decl
)
2193 cgraph_process_new_functions ();
2195 pass_fini_dump_file (pass
);
2197 if (pass
->type
!= SIMPLE_IPA_PASS
&& pass
->type
!= IPA_PASS
)
2198 gcc_assert (!(cfun
->curr_properties
& PROP_trees
)
2199 || pass
->type
!= RTL_PASS
);
2201 current_pass
= NULL
;
2203 /* Signal this is a suitable GC collection point. */
2204 if (!((todo_after
| pass
->todo_flags_finish
) & TODO_do_not_ggc_collect
))
2211 execute_pass_list (struct opt_pass
*pass
)
2215 gcc_assert (pass
->type
== GIMPLE_PASS
2216 || pass
->type
== RTL_PASS
);
2217 if (execute_one_pass (pass
) && pass
->sub
)
2218 execute_pass_list (pass
->sub
);
2224 /* Same as execute_pass_list but assume that subpasses of IPA passes
2225 are local passes. If SET is not NULL, write out summaries of only
2226 those node in SET. */
2229 ipa_write_summaries_2 (struct opt_pass
*pass
, struct lto_out_decl_state
*state
)
2233 struct ipa_opt_pass_d
*ipa_pass
= (struct ipa_opt_pass_d
*)pass
;
2234 gcc_assert (!current_function_decl
);
2236 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
2237 if (pass
->type
== IPA_PASS
2238 && ipa_pass
->write_summary
2239 && ((!pass
->has_gate
) || pass
->gate ()))
2241 /* If a timevar is present, start it. */
2243 timevar_push (pass
->tv_id
);
2245 pass_init_dump_file (pass
);
2247 ipa_pass
->write_summary ();
2249 pass_fini_dump_file (pass
);
2251 /* If a timevar is present, start it. */
2253 timevar_pop (pass
->tv_id
);
2256 if (pass
->sub
&& pass
->sub
->type
!= GIMPLE_PASS
)
2257 ipa_write_summaries_2 (pass
->sub
, state
);
2263 /* Helper function of ipa_write_summaries. Creates and destroys the
2264 decl state and calls ipa_write_summaries_2 for all passes that have
2265 summaries. SET is the set of nodes to be written. */
2268 ipa_write_summaries_1 (lto_symtab_encoder_t encoder
)
2270 pass_manager
*passes
= g
->get_passes ();
2271 struct lto_out_decl_state
*state
= lto_new_out_decl_state ();
2272 state
->symtab_node_encoder
= encoder
;
2274 lto_push_out_decl_state (state
);
2276 gcc_assert (!flag_wpa
);
2277 ipa_write_summaries_2 (passes
->all_regular_ipa_passes
, state
);
2278 ipa_write_summaries_2 (passes
->all_lto_gen_passes
, state
);
2280 gcc_assert (lto_get_out_decl_state () == state
);
2281 lto_pop_out_decl_state ();
2282 lto_delete_out_decl_state (state
);
2285 /* Write out summaries for all the nodes in the callgraph. */
2288 ipa_write_summaries (void)
2290 lto_symtab_encoder_t encoder
;
2292 struct varpool_node
*vnode
;
2293 struct cgraph_node
*node
;
2294 struct cgraph_node
**order
;
2296 if (!flag_generate_lto
|| seen_error ())
2299 encoder
= lto_symtab_encoder_new (false);
2301 /* Create the callgraph set in the same order used in
2302 cgraph_expand_all_functions. This mostly facilitates debugging,
2303 since it causes the gimple file to be processed in the same order
2304 as the source code. */
2305 order
= XCNEWVEC (struct cgraph_node
*, cgraph_n_nodes
);
2306 order_pos
= ipa_reverse_postorder (order
);
2307 gcc_assert (order_pos
== cgraph_n_nodes
);
2309 for (i
= order_pos
- 1; i
>= 0; i
--)
2311 struct cgraph_node
*node
= order
[i
];
2313 if (cgraph_function_with_gimple_body_p (node
))
2315 /* When streaming out references to statements as part of some IPA
2316 pass summary, the statements need to have uids assigned and the
2317 following does that for all the IPA passes here. Naturally, this
2318 ordering then matches the one IPA-passes get in their stmt_fixup
2321 push_cfun (DECL_STRUCT_FUNCTION (node
->symbol
.decl
));
2322 renumber_gimple_stmt_uids ();
2325 if (node
->symbol
.definition
)
2326 lto_set_symtab_encoder_in_partition (encoder
, (symtab_node
)node
);
2329 FOR_EACH_DEFINED_FUNCTION (node
)
2330 if (node
->symbol
.alias
)
2331 lto_set_symtab_encoder_in_partition (encoder
, (symtab_node
)node
);
2332 FOR_EACH_DEFINED_VARIABLE (vnode
)
2333 lto_set_symtab_encoder_in_partition (encoder
, (symtab_node
)vnode
);
2335 ipa_write_summaries_1 (compute_ltrans_boundary (encoder
));
2340 /* Same as execute_pass_list but assume that subpasses of IPA passes
2341 are local passes. If SET is not NULL, write out optimization summaries of
2342 only those node in SET. */
2345 ipa_write_optimization_summaries_1 (struct opt_pass
*pass
, struct lto_out_decl_state
*state
)
2349 struct ipa_opt_pass_d
*ipa_pass
= (struct ipa_opt_pass_d
*)pass
;
2350 gcc_assert (!current_function_decl
);
2352 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
2353 if (pass
->type
== IPA_PASS
2354 && ipa_pass
->write_optimization_summary
2355 && ((!pass
->has_gate
) || pass
->gate ()))
2357 /* If a timevar is present, start it. */
2359 timevar_push (pass
->tv_id
);
2361 pass_init_dump_file (pass
);
2363 ipa_pass
->write_optimization_summary ();
2365 pass_fini_dump_file (pass
);
2367 /* If a timevar is present, start it. */
2369 timevar_pop (pass
->tv_id
);
2372 if (pass
->sub
&& pass
->sub
->type
!= GIMPLE_PASS
)
2373 ipa_write_optimization_summaries_1 (pass
->sub
, state
);
2379 /* Write all the optimization summaries for the cgraph nodes in SET. If SET is
2380 NULL, write out all summaries of all nodes. */
2383 ipa_write_optimization_summaries (lto_symtab_encoder_t encoder
)
2385 struct lto_out_decl_state
*state
= lto_new_out_decl_state ();
2386 lto_symtab_encoder_iterator lsei
;
2387 state
->symtab_node_encoder
= encoder
;
2389 lto_push_out_decl_state (state
);
2390 for (lsei
= lsei_start_function_in_partition (encoder
);
2391 !lsei_end_p (lsei
); lsei_next_function_in_partition (&lsei
))
2393 struct cgraph_node
*node
= lsei_cgraph_node (lsei
);
2394 /* When streaming out references to statements as part of some IPA
2395 pass summary, the statements need to have uids assigned.
2397 For functions newly born at WPA stage we need to initialize
2399 if (node
->symbol
.definition
2400 && gimple_has_body_p (node
->symbol
.decl
))
2402 push_cfun (DECL_STRUCT_FUNCTION (node
->symbol
.decl
));
2403 renumber_gimple_stmt_uids ();
2408 gcc_assert (flag_wpa
);
2409 pass_manager
*passes
= g
->get_passes ();
2410 ipa_write_optimization_summaries_1 (passes
->all_regular_ipa_passes
, state
);
2411 ipa_write_optimization_summaries_1 (passes
->all_lto_gen_passes
, state
);
2413 gcc_assert (lto_get_out_decl_state () == state
);
2414 lto_pop_out_decl_state ();
2415 lto_delete_out_decl_state (state
);
2418 /* Same as execute_pass_list but assume that subpasses of IPA passes
2419 are local passes. */
2422 ipa_read_summaries_1 (struct opt_pass
*pass
)
2426 struct ipa_opt_pass_d
*ipa_pass
= (struct ipa_opt_pass_d
*) pass
;
2428 gcc_assert (!current_function_decl
);
2430 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
2432 if ((!pass
->has_gate
) || pass
->gate ())
2434 if (pass
->type
== IPA_PASS
&& ipa_pass
->read_summary
)
2436 /* If a timevar is present, start it. */
2438 timevar_push (pass
->tv_id
);
2440 pass_init_dump_file (pass
);
2442 ipa_pass
->read_summary ();
2444 pass_fini_dump_file (pass
);
2448 timevar_pop (pass
->tv_id
);
2451 if (pass
->sub
&& pass
->sub
->type
!= GIMPLE_PASS
)
2452 ipa_read_summaries_1 (pass
->sub
);
2459 /* Read all the summaries for all_regular_ipa_passes and all_lto_gen_passes. */
2462 ipa_read_summaries (void)
2464 pass_manager
*passes
= g
->get_passes ();
2465 ipa_read_summaries_1 (passes
->all_regular_ipa_passes
);
2466 ipa_read_summaries_1 (passes
->all_lto_gen_passes
);
2469 /* Same as execute_pass_list but assume that subpasses of IPA passes
2470 are local passes. */
2473 ipa_read_optimization_summaries_1 (struct opt_pass
*pass
)
2477 struct ipa_opt_pass_d
*ipa_pass
= (struct ipa_opt_pass_d
*) pass
;
2479 gcc_assert (!current_function_decl
);
2481 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
2483 if ((!pass
->has_gate
) || pass
->gate ())
2485 if (pass
->type
== IPA_PASS
&& ipa_pass
->read_optimization_summary
)
2487 /* If a timevar is present, start it. */
2489 timevar_push (pass
->tv_id
);
2491 pass_init_dump_file (pass
);
2493 ipa_pass
->read_optimization_summary ();
2495 pass_fini_dump_file (pass
);
2499 timevar_pop (pass
->tv_id
);
2502 if (pass
->sub
&& pass
->sub
->type
!= GIMPLE_PASS
)
2503 ipa_read_optimization_summaries_1 (pass
->sub
);
2509 /* Read all the summaries for all_regular_ipa_passes and all_lto_gen_passes. */
2512 ipa_read_optimization_summaries (void)
2514 pass_manager
*passes
= g
->get_passes ();
2515 ipa_read_optimization_summaries_1 (passes
->all_regular_ipa_passes
);
2516 ipa_read_optimization_summaries_1 (passes
->all_lto_gen_passes
);
2519 /* Same as execute_pass_list but assume that subpasses of IPA passes
2520 are local passes. */
2522 execute_ipa_pass_list (struct opt_pass
*pass
)
2526 gcc_assert (!current_function_decl
);
2528 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
2529 if (execute_one_pass (pass
) && pass
->sub
)
2531 if (pass
->sub
->type
== GIMPLE_PASS
)
2533 invoke_plugin_callbacks (PLUGIN_EARLY_GIMPLE_PASSES_START
, NULL
);
2534 do_per_function_toporder ((void (*)(void *))execute_pass_list
,
2536 invoke_plugin_callbacks (PLUGIN_EARLY_GIMPLE_PASSES_END
, NULL
);
2538 else if (pass
->sub
->type
== SIMPLE_IPA_PASS
2539 || pass
->sub
->type
== IPA_PASS
)
2540 execute_ipa_pass_list (pass
->sub
);
2544 gcc_assert (!current_function_decl
);
2545 cgraph_process_new_functions ();
2551 /* Execute stmt fixup hooks of all passes in PASS for NODE and STMTS. */
2554 execute_ipa_stmt_fixups (struct opt_pass
*pass
,
2555 struct cgraph_node
*node
, gimple
*stmts
)
2559 /* Execute all of the IPA_PASSes in the list. */
2560 if (pass
->type
== IPA_PASS
2561 && ((!pass
->has_gate
) || pass
->gate ()))
2563 struct ipa_opt_pass_d
*ipa_pass
= (struct ipa_opt_pass_d
*) pass
;
2565 if (ipa_pass
->stmt_fixup
)
2567 pass_init_dump_file (pass
);
2568 /* If a timevar is present, start it. */
2570 timevar_push (pass
->tv_id
);
2572 ipa_pass
->stmt_fixup (node
, stmts
);
2576 timevar_pop (pass
->tv_id
);
2577 pass_fini_dump_file (pass
);
2580 execute_ipa_stmt_fixups (pass
->sub
, node
, stmts
);
2586 /* Execute stmt fixup hooks of all IPA passes for NODE and STMTS. */
2589 execute_all_ipa_stmt_fixups (struct cgraph_node
*node
, gimple
*stmts
)
2591 pass_manager
*passes
= g
->get_passes ();
2592 execute_ipa_stmt_fixups (passes
->all_regular_ipa_passes
, node
, stmts
);
2596 extern void debug_properties (unsigned int);
2597 extern void dump_properties (FILE *, unsigned int);
2600 dump_properties (FILE *dump
, unsigned int props
)
2602 fprintf (dump
, "Properties:\n");
2603 if (props
& PROP_gimple_any
)
2604 fprintf (dump
, "PROP_gimple_any\n");
2605 if (props
& PROP_gimple_lcf
)
2606 fprintf (dump
, "PROP_gimple_lcf\n");
2607 if (props
& PROP_gimple_leh
)
2608 fprintf (dump
, "PROP_gimple_leh\n");
2609 if (props
& PROP_cfg
)
2610 fprintf (dump
, "PROP_cfg\n");
2611 if (props
& PROP_ssa
)
2612 fprintf (dump
, "PROP_ssa\n");
2613 if (props
& PROP_no_crit_edges
)
2614 fprintf (dump
, "PROP_no_crit_edges\n");
2615 if (props
& PROP_rtl
)
2616 fprintf (dump
, "PROP_rtl\n");
2617 if (props
& PROP_gimple_lomp
)
2618 fprintf (dump
, "PROP_gimple_lomp\n");
2619 if (props
& PROP_gimple_lcx
)
2620 fprintf (dump
, "PROP_gimple_lcx\n");
2621 if (props
& PROP_gimple_lvec
)
2622 fprintf (dump
, "PROP_gimple_lvec\n");
2623 if (props
& PROP_cfglayout
)
2624 fprintf (dump
, "PROP_cfglayout\n");
2628 debug_properties (unsigned int props
)
2630 dump_properties (stderr
, props
);
2633 /* Called by local passes to see if function is called by already processed nodes.
2634 Because we process nodes in topological order, this means that function is
2635 in recursive cycle or we introduced new direct calls. */
2637 function_called_by_processed_nodes_p (void)
2639 struct cgraph_edge
*e
;
2640 for (e
= cgraph_get_node (current_function_decl
)->callers
;
2644 if (e
->caller
->symbol
.decl
== current_function_decl
)
2646 if (!cgraph_function_with_gimple_body_p (e
->caller
))
2648 if (TREE_ASM_WRITTEN (e
->caller
->symbol
.decl
))
2650 if (!e
->caller
->process
&& !e
->caller
->global
.inlined_to
)
2655 fprintf (dump_file
, "Already processed call to:\n");
2656 dump_cgraph_node (dump_file
, e
->caller
);
2661 #include "gt-passes.h"