1 /* Top level of GCC compilers (cc1, cc1plus, etc.)
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* This is the top level of cc1/c++.
23 It parses command args, opens files, invokes the various passes
24 in the proper order, and counts the time used by each.
25 Error messages and low-level interface to malloc also handled here. */
29 #include "coretypes.h"
37 #include "insn-attr.h"
38 #include "insn-config.h"
39 #include "insn-flags.h"
40 #include "hard-reg-set.h"
47 #include "basic-block.h"
53 #include "diagnostic-core.h"
56 #include "dwarf2asm.h"
57 #include "integrate.h"
60 #include "langhooks.h"
61 #include "cfglayout.h"
63 #include "hosthooks.h"
67 #include "value-prof.h"
68 #include "tree-inline.h"
69 #include "tree-flow.h"
70 #include "tree-pass.h"
71 #include "tree-dump.h"
74 #include "lto-streamer.h"
76 #include "ipa-utils.h"
77 #include "tree-pretty-print.h"
79 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
80 #include "dwarf2out.h"
83 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
87 #ifdef SDB_DEBUGGING_INFO
91 #ifdef XCOFF_DEBUGGING_INFO
92 #include "xcoffout.h" /* Needed for external data
93 declarations for e.g. AIX 4.x. */
96 /* This is used for debugging. It allows the current pass to printed
97 from anywhere in compilation.
98 The variable current_pass is also used for statistics and plugins. */
99 struct opt_pass
*current_pass
;
101 static void register_pass_name (struct opt_pass
*, const char *);
103 /* Call from anywhere to find out what pass this is. Useful for
104 printing out debugging information deep inside an service
107 print_current_pass (FILE *file
)
110 fprintf (file
, "current pass = %s (%d)\n",
111 current_pass
->name
, current_pass
->static_pass_number
);
113 fprintf (file
, "no current pass.\n");
117 /* Call from the debugger to get the current pass name. */
121 print_current_pass (stderr
);
126 /* Global variables used to communicate with passes. */
129 bool first_pass_instance
;
132 /* This is called from various places for FUNCTION_DECL, VAR_DECL,
135 This does nothing for local (non-static) variables, unless the
136 variable is a register variable with DECL_ASSEMBLER_NAME set. In
137 that case, or if the variable is not an automatic, it sets up the
138 RTL and outputs any assembler code (label definition, storage
139 allocation and initialization).
141 DECL is the declaration. TOP_LEVEL is nonzero
142 if this declaration is not within a function. */
145 rest_of_decl_compilation (tree decl
,
149 /* We deferred calling assemble_alias so that we could collect
150 other attributes such as visibility. Emit the alias now. */
154 alias
= lookup_attribute ("alias", DECL_ATTRIBUTES (decl
));
157 alias
= TREE_VALUE (TREE_VALUE (alias
));
158 alias
= get_identifier (TREE_STRING_POINTER (alias
));
159 assemble_alias (decl
, alias
);
163 /* Can't defer this, because it needs to happen before any
164 later function definitions are processed. */
165 if (DECL_ASSEMBLER_NAME_SET_P (decl
) && DECL_REGISTER (decl
))
166 make_decl_rtl (decl
);
168 /* Forward declarations for nested functions are not "external",
169 but we need to treat them as if they were. */
170 if (TREE_STATIC (decl
) || DECL_EXTERNAL (decl
)
171 || TREE_CODE (decl
) == FUNCTION_DECL
)
173 timevar_push (TV_VARCONST
);
175 /* Don't output anything when a tentative file-scope definition
176 is seen. But at end of compilation, do output code for them.
178 We do output all variables and rely on
179 callgraph code to defer them except for forward declarations
180 (see gcc.c-torture/compile/920624-1.c) */
182 || !DECL_DEFER_OUTPUT (decl
)
183 || DECL_INITIAL (decl
))
184 && !DECL_EXTERNAL (decl
))
186 /* When reading LTO unit, we also read varpool, so do not
188 if (in_lto_p
&& !at_end
)
190 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
191 varpool_finalize_decl (decl
);
194 #ifdef ASM_FINISH_DECLARE_OBJECT
195 if (decl
== last_assemble_variable_decl
)
197 ASM_FINISH_DECLARE_OBJECT (asm_out_file
, decl
,
202 timevar_pop (TV_VARCONST
);
204 else if (TREE_CODE (decl
) == TYPE_DECL
205 /* Like in rest_of_type_compilation, avoid confusing the debug
206 information machinery when there are errors. */
209 timevar_push (TV_SYMOUT
);
210 debug_hooks
->type_decl (decl
, !top_level
);
211 timevar_pop (TV_SYMOUT
);
214 /* Let cgraph know about the existence of variables. */
215 if (in_lto_p
&& !at_end
)
217 else if (TREE_CODE (decl
) == VAR_DECL
&& !DECL_EXTERNAL (decl
)
218 && TREE_STATIC (decl
))
222 /* Called after finishing a record, union or enumeral type. */
225 rest_of_type_compilation (tree type
, int toplev
)
227 /* Avoid confusing the debug information machinery when there are
232 timevar_push (TV_SYMOUT
);
233 debug_hooks
->type_decl (TYPE_STUB_DECL (type
), !toplev
);
234 timevar_pop (TV_SYMOUT
);
240 finish_optimization_passes (void)
243 struct dump_file_info
*dfi
;
246 timevar_push (TV_DUMP
);
247 if (profile_arc_flag
|| flag_test_coverage
|| flag_branch_probabilities
)
249 dump_file
= dump_begin (pass_profile
.pass
.static_pass_number
, NULL
);
252 dump_end (pass_profile
.pass
.static_pass_number
, dump_file
);
257 dump_file
= dump_begin (pass_combine
.pass
.static_pass_number
, NULL
);
260 dump_combine_total_stats (dump_file
);
261 dump_end (pass_combine
.pass
.static_pass_number
, dump_file
);
265 /* Do whatever is necessary to finish printing the graphs. */
266 if (graph_dump_format
!= no_graph
)
267 for (i
= TDI_end
; (dfi
= get_dump_file_info (i
)) != NULL
; ++i
)
268 if (dump_initialized_p (i
)
269 && (dfi
->flags
& TDF_GRAPH
) != 0
270 && (name
= get_dump_file_name (i
)) != NULL
)
272 finish_graph_dump_file (name
);
276 timevar_pop (TV_DUMP
);
280 gate_rest_of_compilation (void)
282 /* Early return if there were errors. We can run afoul of our
283 consistency checks, and there's not really much point in fixing them. */
284 return !(rtl_dump_and_exit
|| flag_syntax_only
|| seen_error ());
287 struct gimple_opt_pass pass_rest_of_compilation
=
291 "*rest_of_compilation", /* name */
292 gate_rest_of_compilation
, /* gate */
296 0, /* static_pass_number */
297 TV_REST_OF_COMPILATION
, /* tv_id */
298 PROP_rtl
, /* properties_required */
299 0, /* properties_provided */
300 0, /* properties_destroyed */
301 0, /* todo_flags_start */
302 TODO_ggc_collect
/* todo_flags_finish */
307 gate_postreload (void)
309 return reload_completed
;
312 struct rtl_opt_pass pass_postreload
=
316 "*all-postreload", /* name */
317 gate_postreload
, /* gate */
321 0, /* static_pass_number */
322 TV_POSTRELOAD
, /* tv_id */
323 PROP_rtl
, /* properties_required */
324 0, /* properties_provided */
325 0, /* properties_destroyed */
326 0, /* todo_flags_start */
327 TODO_ggc_collect
| TODO_verify_rtl_sharing
/* todo_flags_finish */
333 /* The root of the compilation pass tree, once constructed. */
334 struct opt_pass
*all_passes
, *all_small_ipa_passes
, *all_lowering_passes
,
335 *all_regular_ipa_passes
, *all_lto_gen_passes
;
337 /* This is used by plugins, and should also be used in register_pass. */
338 #define DEF_PASS_LIST(LIST) &LIST,
339 struct opt_pass
**gcc_pass_lists
[] = { GCC_PASS_LISTS NULL
};
342 /* A map from static pass id to optimization pass. */
343 struct opt_pass
**passes_by_id
;
344 int passes_by_id_size
;
346 /* Set the static pass number of pass PASS to ID and record that
347 in the mapping from static pass number to pass. */
350 set_pass_for_id (int id
, struct opt_pass
*pass
)
352 pass
->static_pass_number
= id
;
353 if (passes_by_id_size
<= id
)
355 passes_by_id
= XRESIZEVEC (struct opt_pass
*, passes_by_id
, id
+ 1);
356 memset (passes_by_id
+ passes_by_id_size
, 0,
357 (id
+ 1 - passes_by_id_size
) * sizeof (void *));
358 passes_by_id_size
= id
+ 1;
360 passes_by_id
[id
] = pass
;
363 /* Return the pass with the static pass number ID. */
366 get_pass_for_id (int id
)
368 if (id
>= passes_by_id_size
)
370 return passes_by_id
[id
];
373 /* Iterate over the pass tree allocating dump file numbers. We want
374 to do this depth first, and independent of whether the pass is
378 register_one_dump_file (struct opt_pass
*pass
)
380 char *dot_name
, *flag_name
, *glob_name
;
381 const char *name
, *full_name
, *prefix
;
385 /* See below in next_pass_1. */
387 if (pass
->static_pass_number
!= -1)
388 sprintf (num
, "%d", ((int) pass
->static_pass_number
< 0
389 ? 1 : pass
->static_pass_number
));
391 /* The name is both used to identify the pass for the purposes of plugins,
392 and to specify dump file name and option.
393 The latter two might want something short which is not quite unique; for
394 that reason, we may have a disambiguating prefix, followed by a space
395 to mark the start of the following dump file name / option string. */
396 name
= strchr (pass
->name
, ' ');
397 name
= name
? name
+ 1 : pass
->name
;
398 dot_name
= concat (".", name
, num
, NULL
);
399 if (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
)
400 prefix
= "ipa-", flags
= TDF_IPA
;
401 else if (pass
->type
== GIMPLE_PASS
)
402 prefix
= "tree-", flags
= TDF_TREE
;
404 prefix
= "rtl-", flags
= TDF_RTL
;
406 flag_name
= concat (prefix
, name
, num
, NULL
);
407 glob_name
= concat (prefix
, name
, NULL
);
408 id
= dump_register (dot_name
, flag_name
, glob_name
, flags
);
409 set_pass_for_id (id
, pass
);
410 full_name
= concat (prefix
, pass
->name
, num
, NULL
);
411 register_pass_name (pass
, full_name
);
414 /* Recursive worker function for register_dump_files. */
417 register_dump_files_1 (struct opt_pass
*pass
, int properties
)
421 int new_properties
= (properties
| pass
->properties_provided
)
422 & ~pass
->properties_destroyed
;
424 if (pass
->name
&& pass
->name
[0] != '*')
425 register_one_dump_file (pass
);
428 new_properties
= register_dump_files_1 (pass
->sub
, new_properties
);
430 /* If we have a gate, combine the properties that we could have with
431 and without the pass being examined. */
433 properties
&= new_properties
;
435 properties
= new_properties
;
444 /* Register the dump files for the pipeline starting at PASS.
445 PROPERTIES reflects the properties that are guaranteed to be available at
446 the beginning of the pipeline. */
449 register_dump_files (struct opt_pass
*pass
,int properties
)
451 pass
->properties_required
|= properties
;
452 register_dump_files_1 (pass
, properties
);
457 const char* unique_name
;
458 struct opt_pass
*pass
;
461 /* Pass registry hash function. */
464 passr_hash (const void *p
)
466 const struct pass_registry
*const s
= (const struct pass_registry
*const) p
;
467 return htab_hash_string (s
->unique_name
);
470 /* Hash equal function */
473 passr_eq (const void *p1
, const void *p2
)
475 const struct pass_registry
*const s1
= (const struct pass_registry
*const) p1
;
476 const struct pass_registry
*const s2
= (const struct pass_registry
*const) p2
;
478 return !strcmp (s1
->unique_name
, s2
->unique_name
);
481 static htab_t name_to_pass_map
= NULL
;
483 /* Register PASS with NAME. */
486 register_pass_name (struct opt_pass
*pass
, const char *name
)
488 struct pass_registry
**slot
;
489 struct pass_registry pr
;
491 if (!name_to_pass_map
)
492 name_to_pass_map
= htab_create (256, passr_hash
, passr_eq
, NULL
);
494 pr
.unique_name
= name
;
495 slot
= (struct pass_registry
**) htab_find_slot (name_to_pass_map
, &pr
, INSERT
);
498 struct pass_registry
*new_pr
;
500 new_pr
= XCNEW (struct pass_registry
);
501 new_pr
->unique_name
= xstrdup (name
);
506 return; /* Ignore plugin passes. */
509 /* Map from pass id to canonicalized pass name. */
511 typedef const char *char_ptr
;
513 DEF_VEC_ALLOC_P(char_ptr
, heap
);
514 static VEC(char_ptr
, heap
) *pass_tab
= NULL
;
516 /* Callback function for traversing NAME_TO_PASS_MAP. */
519 pass_traverse (void **slot
, void *data ATTRIBUTE_UNUSED
)
521 struct pass_registry
**p
= (struct pass_registry
**)slot
;
522 struct opt_pass
*pass
= (*p
)->pass
;
524 gcc_assert (pass
->static_pass_number
> 0);
525 gcc_assert (pass_tab
);
527 VEC_replace (char_ptr
, pass_tab
, pass
->static_pass_number
,
533 /* The function traverses NAME_TO_PASS_MAP and creates a pass info
534 table for dumping purpose. */
537 create_pass_tab (void)
539 if (!flag_dump_passes
)
542 VEC_safe_grow_cleared (char_ptr
, heap
,
543 pass_tab
, passes_by_id_size
+ 1);
544 htab_traverse (name_to_pass_map
, pass_traverse
, NULL
);
547 static bool override_gate_status (struct opt_pass
*, tree
, bool);
549 /* Dump the instantiated name for PASS. IS_ON indicates if PASS
550 is turned on or not. */
553 dump_one_pass (struct opt_pass
*pass
, int pass_indent
)
555 int indent
= 3 * pass_indent
;
557 bool is_on
, is_really_on
;
559 is_on
= (pass
->gate
== NULL
) ? true : pass
->gate();
560 is_really_on
= override_gate_status (pass
, current_function_decl
, is_on
);
562 if (pass
->static_pass_number
<= 0)
565 pn
= VEC_index (char_ptr
, pass_tab
, pass
->static_pass_number
);
567 fprintf (stderr
, "%*s%-40s%*s:%s%s\n", indent
, " ", pn
,
568 (15 - indent
< 0 ? 0 : 15 - indent
), " ",
569 is_on
? " ON" : " OFF",
570 ((!is_on
) == (!is_really_on
) ? ""
571 : (is_really_on
? " (FORCED_ON)" : " (FORCED_OFF)")));
574 /* Dump pass list PASS with indentation INDENT. */
577 dump_pass_list (struct opt_pass
*pass
, int indent
)
581 dump_one_pass (pass
, indent
);
583 dump_pass_list (pass
->sub
, indent
+ 1);
589 /* Dump all optimization passes. */
594 struct cgraph_node
*n
, *node
= NULL
;
595 tree save_fndecl
= current_function_decl
;
602 if (DECL_STRUCT_FUNCTION (n
->decl
))
613 push_cfun (DECL_STRUCT_FUNCTION (node
->decl
));
614 current_function_decl
= node
->decl
;
616 dump_pass_list (all_lowering_passes
, 1);
617 dump_pass_list (all_small_ipa_passes
, 1);
618 dump_pass_list (all_regular_ipa_passes
, 1);
619 dump_pass_list (all_lto_gen_passes
, 1);
620 dump_pass_list (all_passes
, 1);
623 current_function_decl
= save_fndecl
;
627 /* Returns the pass with NAME. */
629 static struct opt_pass
*
630 get_pass_by_name (const char *name
)
632 struct pass_registry
**slot
, pr
;
634 pr
.unique_name
= name
;
635 slot
= (struct pass_registry
**) htab_find_slot (name_to_pass_map
,
641 return (*slot
)->pass
;
645 /* Range [start, last]. */
651 const char *assem_name
;
652 struct uid_range
*next
;
655 typedef struct uid_range
*uid_range_p
;
657 DEF_VEC_P(uid_range_p
);
658 DEF_VEC_ALLOC_P(uid_range_p
, heap
);
660 static VEC(uid_range_p
, heap
) *enabled_pass_uid_range_tab
= NULL
;
661 static VEC(uid_range_p
, heap
) *disabled_pass_uid_range_tab
= NULL
;
664 /* Parse option string for -fdisable- and -fenable-
665 The syntax of the options:
668 -fdisable-<pass_name>
670 -fenable-<pass_name>=s1:e1,s2:e2,...
671 -fdisable-<pass_name>=s1:e1,s2:e2,...
675 enable_disable_pass (const char *arg
, bool is_enable
)
677 struct opt_pass
*pass
;
678 char *range_str
, *phase_name
;
679 char *argstr
= xstrdup (arg
);
680 VEC(uid_range_p
, heap
) **tab
= 0;
682 range_str
= strchr (argstr
,'=');
693 error ("unrecognized option -fenable");
695 error ("unrecognized option -fdisable");
699 pass
= get_pass_by_name (phase_name
);
700 if (!pass
|| pass
->static_pass_number
== -1)
703 error ("unknown pass %s specified in -fenable", phase_name
);
705 error ("unknown pass %s specified in -fdisble", phase_name
);
711 tab
= &enabled_pass_uid_range_tab
;
713 tab
= &disabled_pass_uid_range_tab
;
715 if ((unsigned) pass
->static_pass_number
>= VEC_length (uid_range_p
, *tab
))
716 VEC_safe_grow_cleared (uid_range_p
, heap
,
717 *tab
, pass
->static_pass_number
+ 1);
722 uid_range_p new_range
= XCNEW (struct uid_range
);
724 new_range
->start
= 0;
725 new_range
->last
= (unsigned)-1;
727 slot
= VEC_index (uid_range_p
, *tab
, pass
->static_pass_number
);
728 new_range
->next
= slot
;
729 VEC_replace (uid_range_p
, *tab
, pass
->static_pass_number
,
732 inform (UNKNOWN_LOCATION
, "enable pass %s for functions in the range "
733 "of [%u, %u]", phase_name
, new_range
->start
, new_range
->last
);
735 inform (UNKNOWN_LOCATION
, "disable pass %s for functions in the range "
736 "of [%u, %u]", phase_name
, new_range
->start
, new_range
->last
);
740 char *next_range
= NULL
;
741 char *one_range
= range_str
;
742 char *end_val
= NULL
;
747 uid_range_p new_range
;
748 char *invalid
= NULL
;
750 char *func_name
= NULL
;
752 next_range
= strchr (one_range
, ',');
759 end_val
= strchr (one_range
, ':');
765 start
= strtol (one_range
, &invalid
, 10);
766 if (*invalid
|| start
< 0)
768 if (end_val
|| (one_range
[0] >= '0'
769 && one_range
[0] <= '9'))
771 error ("Invalid range %s in option %s",
773 is_enable
? "-fenable" : "-fdisable");
777 func_name
= one_range
;
781 new_range
= XCNEW (struct uid_range
);
784 new_range
->start
= (unsigned) start
;
785 new_range
->last
= (unsigned) start
;
789 new_range
->start
= (unsigned) -1;
790 new_range
->last
= (unsigned) -1;
791 new_range
->assem_name
= xstrdup (func_name
);
796 long last
= strtol (end_val
, &invalid
, 10);
797 if (*invalid
|| last
< start
)
799 error ("Invalid range %s in option %s",
801 is_enable
? "-fenable" : "-fdisable");
805 new_range
= XCNEW (struct uid_range
);
806 new_range
->start
= (unsigned) start
;
807 new_range
->last
= (unsigned) last
;
810 slot
= VEC_index (uid_range_p
, *tab
, pass
->static_pass_number
);
811 new_range
->next
= slot
;
812 VEC_replace (uid_range_p
, *tab
, pass
->static_pass_number
,
816 if (new_range
->assem_name
)
817 inform (UNKNOWN_LOCATION
,
818 "enable pass %s for function %s",
819 phase_name
, new_range
->assem_name
);
821 inform (UNKNOWN_LOCATION
,
822 "enable pass %s for functions in the range of [%u, %u]",
823 phase_name
, new_range
->start
, new_range
->last
);
827 if (new_range
->assem_name
)
828 inform (UNKNOWN_LOCATION
,
829 "disable pass %s for function %s",
830 phase_name
, new_range
->assem_name
);
832 inform (UNKNOWN_LOCATION
,
833 "disable pass %s for functions in the range of [%u, %u]",
834 phase_name
, new_range
->start
, new_range
->last
);
837 one_range
= next_range
;
838 } while (next_range
);
844 /* Enable pass specified by ARG. */
847 enable_pass (const char *arg
)
849 enable_disable_pass (arg
, true);
852 /* Disable pass specified by ARG. */
855 disable_pass (const char *arg
)
857 enable_disable_pass (arg
, false);
860 /* Returns true if PASS is explicitly enabled/disabled for FUNC. */
863 is_pass_explicitly_enabled_or_disabled (struct opt_pass
*pass
,
865 VEC(uid_range_p
, heap
) *tab
)
867 uid_range_p slot
, range
;
869 const char *aname
= NULL
;
872 || (unsigned) pass
->static_pass_number
>= VEC_length (uid_range_p
, tab
)
873 || pass
->static_pass_number
== -1)
876 slot
= VEC_index (uid_range_p
, tab
, pass
->static_pass_number
);
880 cgraph_uid
= func
? cgraph_get_node (func
)->uid
: 0;
881 if (func
&& DECL_ASSEMBLER_NAME_SET_P (func
))
882 aname
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (func
));
887 if ((unsigned) cgraph_uid
>= range
->start
888 && (unsigned) cgraph_uid
<= range
->last
)
890 if (range
->assem_name
&& aname
891 && !strcmp (range
->assem_name
, aname
))
899 /* Look at the static_pass_number and duplicate the pass
900 if it is already added to a list. */
902 static struct opt_pass
*
903 make_pass_instance (struct opt_pass
*pass
, bool track_duplicates
)
905 /* A nonzero static_pass_number indicates that the
906 pass is already in the list. */
907 if (pass
->static_pass_number
)
909 struct opt_pass
*new_pass
;
911 if (pass
->type
== GIMPLE_PASS
912 || pass
->type
== RTL_PASS
913 || pass
->type
== SIMPLE_IPA_PASS
)
915 new_pass
= XNEW (struct opt_pass
);
916 memcpy (new_pass
, pass
, sizeof (struct opt_pass
));
918 else if (pass
->type
== IPA_PASS
)
920 new_pass
= (struct opt_pass
*)XNEW (struct ipa_opt_pass_d
);
921 memcpy (new_pass
, pass
, sizeof (struct ipa_opt_pass_d
));
926 new_pass
->next
= NULL
;
928 new_pass
->todo_flags_start
&= ~TODO_mark_first_instance
;
930 /* Indicate to register_dump_files that this pass has duplicates,
931 and so it should rename the dump file. The first instance will
932 be -1, and be number of duplicates = -static_pass_number - 1.
933 Subsequent instances will be > 0 and just the duplicate number. */
934 if ((pass
->name
&& pass
->name
[0] != '*') || track_duplicates
)
936 pass
->static_pass_number
-= 1;
937 new_pass
->static_pass_number
= -pass
->static_pass_number
;
943 pass
->todo_flags_start
|= TODO_mark_first_instance
;
944 pass
->static_pass_number
= -1;
946 invoke_plugin_callbacks (PLUGIN_NEW_PASS
, pass
);
951 /* Add a pass to the pass list. Duplicate the pass if it's already
954 static struct opt_pass
**
955 next_pass_1 (struct opt_pass
**list
, struct opt_pass
*pass
)
957 /* Every pass should have a name so that plugins can refer to them. */
958 gcc_assert (pass
->name
!= NULL
);
960 *list
= make_pass_instance (pass
, false);
962 return &(*list
)->next
;
965 /* List node for an inserted pass instance. We need to keep track of all
966 the newly-added pass instances (with 'added_pass_nodes' defined below)
967 so that we can register their dump files after pass-positioning is finished.
968 Registering dumping files needs to be post-processed or the
969 static_pass_number of the opt_pass object would be modified and mess up
970 the dump file names of future pass instances to be added. */
972 struct pass_list_node
974 struct opt_pass
*pass
;
975 struct pass_list_node
*next
;
978 static struct pass_list_node
*added_pass_nodes
= NULL
;
979 static struct pass_list_node
*prev_added_pass_node
;
981 /* Insert the pass at the proper position. Return true if the pass
982 is successfully added.
984 NEW_PASS_INFO - new pass to be inserted
985 PASS_LIST - root of the pass list to insert the new pass to */
988 position_pass (struct register_pass_info
*new_pass_info
,
989 struct opt_pass
**pass_list
)
991 struct opt_pass
*pass
= *pass_list
, *prev_pass
= NULL
;
992 bool success
= false;
994 for ( ; pass
; prev_pass
= pass
, pass
= pass
->next
)
996 /* Check if the current pass is of the same type as the new pass and
997 matches the name and the instance number of the reference pass. */
998 if (pass
->type
== new_pass_info
->pass
->type
1000 && !strcmp (pass
->name
, new_pass_info
->reference_pass_name
)
1001 && ((new_pass_info
->ref_pass_instance_number
== 0)
1002 || (new_pass_info
->ref_pass_instance_number
==
1003 pass
->static_pass_number
)
1004 || (new_pass_info
->ref_pass_instance_number
== 1
1005 && pass
->todo_flags_start
& TODO_mark_first_instance
)))
1007 struct opt_pass
*new_pass
;
1008 struct pass_list_node
*new_pass_node
;
1010 new_pass
= make_pass_instance (new_pass_info
->pass
, true);
1012 /* Insert the new pass instance based on the positioning op. */
1013 switch (new_pass_info
->pos_op
)
1015 case PASS_POS_INSERT_AFTER
:
1016 new_pass
->next
= pass
->next
;
1017 pass
->next
= new_pass
;
1019 /* Skip newly inserted pass to avoid repeated
1020 insertions in the case where the new pass and the
1021 existing one have the same name. */
1024 case PASS_POS_INSERT_BEFORE
:
1025 new_pass
->next
= pass
;
1027 prev_pass
->next
= new_pass
;
1029 *pass_list
= new_pass
;
1031 case PASS_POS_REPLACE
:
1032 new_pass
->next
= pass
->next
;
1034 prev_pass
->next
= new_pass
;
1036 *pass_list
= new_pass
;
1037 new_pass
->sub
= pass
->sub
;
1038 new_pass
->tv_id
= pass
->tv_id
;
1042 error ("invalid pass positioning operation");
1046 /* Save the newly added pass (instance) in the added_pass_nodes
1047 list so that we can register its dump file later. Note that
1048 we cannot register the dump file now because doing so will modify
1049 the static_pass_number of the opt_pass object and therefore
1050 mess up the dump file name of future instances. */
1051 new_pass_node
= XCNEW (struct pass_list_node
);
1052 new_pass_node
->pass
= new_pass
;
1053 if (!added_pass_nodes
)
1054 added_pass_nodes
= new_pass_node
;
1056 prev_added_pass_node
->next
= new_pass_node
;
1057 prev_added_pass_node
= new_pass_node
;
1062 if (pass
->sub
&& position_pass (new_pass_info
, &pass
->sub
))
1069 /* Hooks a new pass into the pass lists.
1071 PASS_INFO - pass information that specifies the opt_pass object,
1072 reference pass, instance number, and how to position
1076 register_pass (struct register_pass_info
*pass_info
)
1078 bool all_instances
, success
;
1080 /* The checks below could fail in buggy plugins. Existing GCC
1081 passes should never fail these checks, so we mention plugin in
1083 if (!pass_info
->pass
)
1084 fatal_error ("plugin cannot register a missing pass");
1086 if (!pass_info
->pass
->name
)
1087 fatal_error ("plugin cannot register an unnamed pass");
1089 if (!pass_info
->reference_pass_name
)
1091 ("plugin cannot register pass %qs without reference pass name",
1092 pass_info
->pass
->name
);
1094 /* Try to insert the new pass to the pass lists. We need to check
1095 all five lists as the reference pass could be in one (or all) of
1097 all_instances
= pass_info
->ref_pass_instance_number
== 0;
1098 success
= position_pass (pass_info
, &all_lowering_passes
);
1099 if (!success
|| all_instances
)
1100 success
|= position_pass (pass_info
, &all_small_ipa_passes
);
1101 if (!success
|| all_instances
)
1102 success
|= position_pass (pass_info
, &all_regular_ipa_passes
);
1103 if (!success
|| all_instances
)
1104 success
|= position_pass (pass_info
, &all_lto_gen_passes
);
1105 if (!success
|| all_instances
)
1106 success
|= position_pass (pass_info
, &all_passes
);
1109 ("pass %qs not found but is referenced by new pass %qs",
1110 pass_info
->reference_pass_name
, pass_info
->pass
->name
);
1112 /* OK, we have successfully inserted the new pass. We need to register
1113 the dump files for the newly added pass and its duplicates (if any).
1114 Because the registration of plugin/backend passes happens after the
1115 command-line options are parsed, the options that specify single
1116 pass dumping (e.g. -fdump-tree-PASSNAME) cannot be used for new
1117 passes. Therefore we currently can only enable dumping of
1118 new passes when the 'dump-all' flags (e.g. -fdump-tree-all)
1119 are specified. While doing so, we also delete the pass_list_node
1120 objects created during pass positioning. */
1121 while (added_pass_nodes
)
1123 struct pass_list_node
*next_node
= added_pass_nodes
->next
;
1124 enum tree_dump_index tdi
;
1125 register_one_dump_file (added_pass_nodes
->pass
);
1126 if (added_pass_nodes
->pass
->type
== SIMPLE_IPA_PASS
1127 || added_pass_nodes
->pass
->type
== IPA_PASS
)
1129 else if (added_pass_nodes
->pass
->type
== GIMPLE_PASS
)
1133 /* Check if dump-all flag is specified. */
1134 if (get_dump_file_info (tdi
)->state
)
1135 get_dump_file_info (added_pass_nodes
->pass
->static_pass_number
)
1136 ->state
= get_dump_file_info (tdi
)->state
;
1137 XDELETE (added_pass_nodes
);
1138 added_pass_nodes
= next_node
;
1142 /* Construct the pass tree. The sequencing of passes is driven by
1143 the cgraph routines:
1145 cgraph_finalize_compilation_unit ()
1146 for each node N in the cgraph
1147 cgraph_analyze_function (N)
1148 cgraph_lower_function (N) -> all_lowering_passes
1150 If we are optimizing, cgraph_optimize is then invoked:
1153 ipa_passes () -> all_small_ipa_passes
1154 cgraph_expand_all_functions ()
1155 for each node N in the cgraph
1156 cgraph_expand_function (N)
1157 tree_rest_of_compilation (DECL (N)) -> all_passes
1161 init_optimization_passes (void)
1163 struct opt_pass
**p
;
1165 #define NEXT_PASS(PASS) (p = next_pass_1 (p, &((PASS).pass)))
1167 /* All passes needed to lower the function into shape optimizers can
1168 operate on. These passes are always run first on the function, but
1169 backend might produce already lowered functions that are not processed
1171 p
= &all_lowering_passes
;
1172 NEXT_PASS (pass_warn_unused_result
);
1173 NEXT_PASS (pass_diagnose_omp_blocks
);
1174 NEXT_PASS (pass_mudflap_1
);
1175 NEXT_PASS (pass_lower_omp
);
1176 NEXT_PASS (pass_lower_cf
);
1177 NEXT_PASS (pass_refactor_eh
);
1178 NEXT_PASS (pass_lower_eh
);
1179 NEXT_PASS (pass_build_cfg
);
1180 NEXT_PASS (pass_warn_function_return
);
1181 NEXT_PASS (pass_build_cgraph_edges
);
1184 /* Interprocedural optimization passes. */
1185 p
= &all_small_ipa_passes
;
1186 NEXT_PASS (pass_ipa_free_lang_data
);
1187 NEXT_PASS (pass_ipa_function_and_variable_visibility
);
1188 NEXT_PASS (pass_early_local_passes
);
1190 struct opt_pass
**p
= &pass_early_local_passes
.pass
.sub
;
1191 NEXT_PASS (pass_fixup_cfg
);
1192 NEXT_PASS (pass_init_datastructures
);
1193 NEXT_PASS (pass_expand_omp
);
1195 NEXT_PASS (pass_referenced_vars
);
1196 NEXT_PASS (pass_build_ssa
);
1197 NEXT_PASS (pass_lower_vector
);
1198 NEXT_PASS (pass_early_warn_uninitialized
);
1199 NEXT_PASS (pass_rebuild_cgraph_edges
);
1200 NEXT_PASS (pass_inline_parameters
);
1201 NEXT_PASS (pass_early_inline
);
1202 NEXT_PASS (pass_all_early_optimizations
);
1204 struct opt_pass
**p
= &pass_all_early_optimizations
.pass
.sub
;
1205 NEXT_PASS (pass_remove_cgraph_callee_edges
);
1206 NEXT_PASS (pass_rename_ssa_copies
);
1207 NEXT_PASS (pass_ccp
);
1208 NEXT_PASS (pass_forwprop
);
1209 /* pass_build_ealias is a dummy pass that ensures that we
1210 execute TODO_rebuild_alias at this point. Re-building
1211 alias information also rewrites no longer addressed
1212 locals into SSA form if possible. */
1213 NEXT_PASS (pass_build_ealias
);
1214 NEXT_PASS (pass_sra_early
);
1215 NEXT_PASS (pass_fre
);
1216 NEXT_PASS (pass_copy_prop
);
1217 NEXT_PASS (pass_merge_phi
);
1218 NEXT_PASS (pass_cd_dce
);
1219 NEXT_PASS (pass_early_ipa_sra
);
1220 NEXT_PASS (pass_tail_recursion
);
1221 NEXT_PASS (pass_convert_switch
);
1222 NEXT_PASS (pass_cleanup_eh
);
1223 NEXT_PASS (pass_profile
);
1224 NEXT_PASS (pass_local_pure_const
);
1225 /* Split functions creates parts that are not run through
1226 early optimizations again. It is thus good idea to do this
1228 NEXT_PASS (pass_split_functions
);
1230 NEXT_PASS (pass_release_ssa_names
);
1231 NEXT_PASS (pass_rebuild_cgraph_edges
);
1232 NEXT_PASS (pass_inline_parameters
);
1234 NEXT_PASS (pass_ipa_tree_profile
);
1236 struct opt_pass
**p
= &pass_ipa_tree_profile
.pass
.sub
;
1237 NEXT_PASS (pass_feedback_split_functions
);
1239 NEXT_PASS (pass_ipa_increase_alignment
);
1240 NEXT_PASS (pass_ipa_matrix_reorg
);
1241 NEXT_PASS (pass_ipa_lower_emutls
);
1244 p
= &all_regular_ipa_passes
;
1245 NEXT_PASS (pass_ipa_whole_program_visibility
);
1246 NEXT_PASS (pass_ipa_profile
);
1247 NEXT_PASS (pass_ipa_cp
);
1248 NEXT_PASS (pass_ipa_cdtor_merge
);
1249 NEXT_PASS (pass_ipa_inline
);
1250 NEXT_PASS (pass_ipa_pure_const
);
1251 NEXT_PASS (pass_ipa_reference
);
1252 NEXT_PASS (pass_ipa_pta
);
1255 p
= &all_lto_gen_passes
;
1256 NEXT_PASS (pass_ipa_lto_gimple_out
);
1257 NEXT_PASS (pass_ipa_lto_finish_out
); /* This must be the last LTO pass. */
1260 /* These passes are run after IPA passes on every function that is being
1261 output to the assembler file. */
1263 NEXT_PASS (pass_lower_eh_dispatch
);
1264 NEXT_PASS (pass_all_optimizations
);
1266 struct opt_pass
**p
= &pass_all_optimizations
.pass
.sub
;
1267 NEXT_PASS (pass_remove_cgraph_callee_edges
);
1268 /* Initial scalar cleanups before alias computation.
1269 They ensure memory accesses are not indirect wherever possible. */
1270 NEXT_PASS (pass_strip_predict_hints
);
1271 NEXT_PASS (pass_rename_ssa_copies
);
1272 NEXT_PASS (pass_complete_unrolli
);
1273 NEXT_PASS (pass_ccp
);
1274 NEXT_PASS (pass_forwprop
);
1275 NEXT_PASS (pass_call_cdce
);
1276 /* pass_build_alias is a dummy pass that ensures that we
1277 execute TODO_rebuild_alias at this point. Re-building
1278 alias information also rewrites no longer addressed
1279 locals into SSA form if possible. */
1280 NEXT_PASS (pass_build_alias
);
1281 NEXT_PASS (pass_return_slot
);
1282 NEXT_PASS (pass_phiprop
);
1283 NEXT_PASS (pass_fre
);
1284 NEXT_PASS (pass_copy_prop
);
1285 NEXT_PASS (pass_merge_phi
);
1286 NEXT_PASS (pass_vrp
);
1287 NEXT_PASS (pass_dce
);
1288 NEXT_PASS (pass_cselim
);
1289 NEXT_PASS (pass_tree_ifcombine
);
1290 NEXT_PASS (pass_phiopt
);
1291 NEXT_PASS (pass_tail_recursion
);
1292 NEXT_PASS (pass_ch
);
1293 NEXT_PASS (pass_stdarg
);
1294 NEXT_PASS (pass_lower_complex
);
1295 NEXT_PASS (pass_sra
);
1296 NEXT_PASS (pass_rename_ssa_copies
);
1297 /* The dom pass will also resolve all __builtin_constant_p calls
1298 that are still there to 0. This has to be done after some
1299 propagations have already run, but before some more dead code
1300 is removed, and this place fits nicely. Remember this when
1301 trying to move or duplicate pass_dominator somewhere earlier. */
1302 NEXT_PASS (pass_dominator
);
1303 /* The only const/copy propagation opportunities left after
1304 DOM should be due to degenerate PHI nodes. So rather than
1305 run the full propagators, run a specialized pass which
1306 only examines PHIs to discover const/copy propagation
1308 NEXT_PASS (pass_phi_only_cprop
);
1309 NEXT_PASS (pass_dse
);
1310 NEXT_PASS (pass_reassoc
);
1311 NEXT_PASS (pass_dce
);
1312 NEXT_PASS (pass_forwprop
);
1313 NEXT_PASS (pass_phiopt
);
1314 NEXT_PASS (pass_object_sizes
);
1315 NEXT_PASS (pass_ccp
);
1316 NEXT_PASS (pass_copy_prop
);
1317 NEXT_PASS (pass_cse_sincos
);
1318 NEXT_PASS (pass_optimize_bswap
);
1319 NEXT_PASS (pass_split_crit_edges
);
1320 NEXT_PASS (pass_pre
);
1321 NEXT_PASS (pass_sink_code
);
1322 NEXT_PASS (pass_tree_loop
);
1324 struct opt_pass
**p
= &pass_tree_loop
.pass
.sub
;
1325 NEXT_PASS (pass_tree_loop_init
);
1326 NEXT_PASS (pass_lim
);
1327 NEXT_PASS (pass_copy_prop
);
1328 NEXT_PASS (pass_dce_loop
);
1329 NEXT_PASS (pass_tree_unswitch
);
1330 NEXT_PASS (pass_scev_cprop
);
1331 NEXT_PASS (pass_record_bounds
);
1332 NEXT_PASS (pass_check_data_deps
);
1333 NEXT_PASS (pass_loop_distribution
);
1334 NEXT_PASS (pass_copy_prop
);
1335 NEXT_PASS (pass_graphite
);
1337 struct opt_pass
**p
= &pass_graphite
.pass
.sub
;
1338 NEXT_PASS (pass_graphite_transforms
);
1339 NEXT_PASS (pass_lim
);
1340 NEXT_PASS (pass_copy_prop
);
1341 NEXT_PASS (pass_dce_loop
);
1343 NEXT_PASS (pass_iv_canon
);
1344 NEXT_PASS (pass_if_conversion
);
1345 NEXT_PASS (pass_vectorize
);
1347 struct opt_pass
**p
= &pass_vectorize
.pass
.sub
;
1348 NEXT_PASS (pass_lower_vector_ssa
);
1349 NEXT_PASS (pass_dce_loop
);
1351 NEXT_PASS (pass_predcom
);
1352 NEXT_PASS (pass_complete_unroll
);
1353 NEXT_PASS (pass_slp_vectorize
);
1354 NEXT_PASS (pass_parallelize_loops
);
1355 NEXT_PASS (pass_loop_prefetch
);
1356 NEXT_PASS (pass_iv_optimize
);
1357 NEXT_PASS (pass_tree_loop_done
);
1359 NEXT_PASS (pass_cse_reciprocals
);
1360 NEXT_PASS (pass_reassoc
);
1361 NEXT_PASS (pass_vrp
);
1362 NEXT_PASS (pass_dominator
);
1363 /* The only const/copy propagation opportunities left after
1364 DOM should be due to degenerate PHI nodes. So rather than
1365 run the full propagators, run a specialized pass which
1366 only examines PHIs to discover const/copy propagation
1368 NEXT_PASS (pass_phi_only_cprop
);
1369 NEXT_PASS (pass_cd_dce
);
1370 NEXT_PASS (pass_tracer
);
1372 /* FIXME: If DCE is not run before checking for uninitialized uses,
1373 we may get false warnings (e.g., testsuite/gcc.dg/uninit-5.c).
1374 However, this also causes us to misdiagnose cases that should be
1375 real warnings (e.g., testsuite/gcc.dg/pr18501.c).
1377 To fix the false positives in uninit-5.c, we would have to
1378 account for the predicates protecting the set and the use of each
1379 variable. Using a representation like Gated Single Assignment
1381 NEXT_PASS (pass_late_warn_uninitialized
);
1382 NEXT_PASS (pass_dse
);
1383 NEXT_PASS (pass_forwprop
);
1384 NEXT_PASS (pass_phiopt
);
1385 NEXT_PASS (pass_fold_builtins
);
1386 NEXT_PASS (pass_optimize_widening_mul
);
1387 NEXT_PASS (pass_tail_calls
);
1388 NEXT_PASS (pass_rename_ssa_copies
);
1389 NEXT_PASS (pass_uncprop
);
1390 NEXT_PASS (pass_local_pure_const
);
1392 NEXT_PASS (pass_lower_complex_O0
);
1393 NEXT_PASS (pass_cleanup_eh
);
1394 NEXT_PASS (pass_lower_resx
);
1395 NEXT_PASS (pass_nrv
);
1396 NEXT_PASS (pass_mudflap_2
);
1397 NEXT_PASS (pass_cleanup_cfg_post_optimizing
);
1398 NEXT_PASS (pass_warn_function_noreturn
);
1400 NEXT_PASS (pass_expand
);
1402 NEXT_PASS (pass_rest_of_compilation
);
1404 struct opt_pass
**p
= &pass_rest_of_compilation
.pass
.sub
;
1405 NEXT_PASS (pass_init_function
);
1406 NEXT_PASS (pass_jump
);
1407 NEXT_PASS (pass_rtl_eh
);
1408 NEXT_PASS (pass_initial_value_sets
);
1409 NEXT_PASS (pass_unshare_all_rtl
);
1410 NEXT_PASS (pass_instantiate_virtual_regs
);
1411 NEXT_PASS (pass_into_cfg_layout_mode
);
1412 NEXT_PASS (pass_jump2
);
1413 NEXT_PASS (pass_lower_subreg
);
1414 NEXT_PASS (pass_df_initialize_opt
);
1415 NEXT_PASS (pass_cse
);
1416 NEXT_PASS (pass_rtl_fwprop
);
1417 NEXT_PASS (pass_rtl_cprop
);
1418 NEXT_PASS (pass_rtl_pre
);
1419 NEXT_PASS (pass_rtl_hoist
);
1420 NEXT_PASS (pass_rtl_cprop
);
1421 NEXT_PASS (pass_rtl_store_motion
);
1422 NEXT_PASS (pass_cse_after_global_opts
);
1423 NEXT_PASS (pass_rtl_ifcvt
);
1424 NEXT_PASS (pass_reginfo_init
);
1425 /* Perform loop optimizations. It might be better to do them a bit
1426 sooner, but we want the profile feedback to work more
1428 NEXT_PASS (pass_loop2
);
1430 struct opt_pass
**p
= &pass_loop2
.pass
.sub
;
1431 NEXT_PASS (pass_rtl_loop_init
);
1432 NEXT_PASS (pass_rtl_move_loop_invariants
);
1433 NEXT_PASS (pass_rtl_unswitch
);
1434 NEXT_PASS (pass_rtl_unroll_and_peel_loops
);
1435 NEXT_PASS (pass_rtl_doloop
);
1436 NEXT_PASS (pass_rtl_loop_done
);
1439 NEXT_PASS (pass_web
);
1440 NEXT_PASS (pass_rtl_cprop
);
1441 NEXT_PASS (pass_cse2
);
1442 NEXT_PASS (pass_rtl_dse1
);
1443 NEXT_PASS (pass_rtl_fwprop_addr
);
1444 NEXT_PASS (pass_inc_dec
);
1445 NEXT_PASS (pass_initialize_regs
);
1446 NEXT_PASS (pass_ud_rtl_dce
);
1447 NEXT_PASS (pass_combine
);
1448 NEXT_PASS (pass_if_after_combine
);
1449 NEXT_PASS (pass_partition_blocks
);
1450 NEXT_PASS (pass_regmove
);
1451 NEXT_PASS (pass_outof_cfg_layout_mode
);
1452 NEXT_PASS (pass_split_all_insns
);
1453 NEXT_PASS (pass_lower_subreg2
);
1454 NEXT_PASS (pass_df_initialize_no_opt
);
1455 NEXT_PASS (pass_stack_ptr_mod
);
1456 NEXT_PASS (pass_mode_switching
);
1457 NEXT_PASS (pass_match_asm_constraints
);
1458 NEXT_PASS (pass_sms
);
1459 NEXT_PASS (pass_sched
);
1460 NEXT_PASS (pass_ira
);
1461 NEXT_PASS (pass_postreload
);
1463 struct opt_pass
**p
= &pass_postreload
.pass
.sub
;
1464 NEXT_PASS (pass_postreload_cse
);
1465 NEXT_PASS (pass_gcse2
);
1466 NEXT_PASS (pass_split_after_reload
);
1467 NEXT_PASS (pass_implicit_zee
);
1468 NEXT_PASS (pass_compare_elim_after_reload
);
1469 NEXT_PASS (pass_branch_target_load_optimize1
);
1470 NEXT_PASS (pass_thread_prologue_and_epilogue
);
1471 NEXT_PASS (pass_rtl_dse2
);
1472 NEXT_PASS (pass_stack_adjustments
);
1473 NEXT_PASS (pass_peephole2
);
1474 NEXT_PASS (pass_if_after_reload
);
1475 NEXT_PASS (pass_regrename
);
1476 NEXT_PASS (pass_cprop_hardreg
);
1477 NEXT_PASS (pass_fast_rtl_dce
);
1478 NEXT_PASS (pass_reorder_blocks
);
1479 NEXT_PASS (pass_branch_target_load_optimize2
);
1480 NEXT_PASS (pass_leaf_regs
);
1481 NEXT_PASS (pass_split_before_sched2
);
1482 NEXT_PASS (pass_sched2
);
1483 NEXT_PASS (pass_stack_regs
);
1485 struct opt_pass
**p
= &pass_stack_regs
.pass
.sub
;
1486 NEXT_PASS (pass_split_before_regstack
);
1487 NEXT_PASS (pass_stack_regs_run
);
1489 NEXT_PASS (pass_compute_alignments
);
1490 NEXT_PASS (pass_duplicate_computed_gotos
);
1491 NEXT_PASS (pass_variable_tracking
);
1492 NEXT_PASS (pass_free_cfg
);
1493 NEXT_PASS (pass_machine_reorg
);
1494 NEXT_PASS (pass_cleanup_barriers
);
1495 NEXT_PASS (pass_delay_slots
);
1496 NEXT_PASS (pass_split_for_shorten_branches
);
1497 NEXT_PASS (pass_convert_to_eh_region_ranges
);
1498 NEXT_PASS (pass_shorten_branches
);
1499 NEXT_PASS (pass_set_nothrow_function_flags
);
1500 NEXT_PASS (pass_final
);
1502 NEXT_PASS (pass_df_finish
);
1504 NEXT_PASS (pass_clean_state
);
1509 /* Register the passes with the tree dump code. */
1510 register_dump_files (all_lowering_passes
, PROP_gimple_any
);
1511 register_dump_files (all_small_ipa_passes
,
1512 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
1514 register_dump_files (all_regular_ipa_passes
,
1515 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
1517 register_dump_files (all_lto_gen_passes
,
1518 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
1520 register_dump_files (all_passes
,
1521 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
1525 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
1526 function CALLBACK for every function in the call graph. Otherwise,
1527 call CALLBACK on the current function. */
1530 do_per_function (void (*callback
) (void *data
), void *data
)
1532 if (current_function_decl
)
1536 struct cgraph_node
*node
;
1537 for (node
= cgraph_nodes
; node
; node
= node
->next
)
1538 if (node
->analyzed
&& gimple_has_body_p (node
->decl
)
1539 && (!node
->clone_of
|| node
->decl
!= node
->clone_of
->decl
))
1541 push_cfun (DECL_STRUCT_FUNCTION (node
->decl
));
1542 current_function_decl
= node
->decl
;
1546 free_dominance_info (CDI_DOMINATORS
);
1547 free_dominance_info (CDI_POST_DOMINATORS
);
1549 current_function_decl
= NULL
;
1556 /* Because inlining might remove no-longer reachable nodes, we need to
1557 keep the array visible to garbage collector to avoid reading collected
1560 static GTY ((length ("nnodes"))) cgraph_node_ptr
*order
;
1562 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
1563 function CALLBACK for every function in the call graph. Otherwise,
1564 call CALLBACK on the current function.
1565 This function is global so that plugins can use it. */
1567 do_per_function_toporder (void (*callback
) (void *data
), void *data
)
1571 if (current_function_decl
)
1575 gcc_assert (!order
);
1576 order
= ggc_alloc_vec_cgraph_node_ptr (cgraph_n_nodes
);
1577 nnodes
= ipa_reverse_postorder (order
);
1578 for (i
= nnodes
- 1; i
>= 0; i
--)
1579 order
[i
]->process
= 1;
1580 for (i
= nnodes
- 1; i
>= 0; i
--)
1582 struct cgraph_node
*node
= order
[i
];
1584 /* Allow possibly removed nodes to be garbage collected. */
1587 if (cgraph_function_with_gimple_body_p (node
))
1589 push_cfun (DECL_STRUCT_FUNCTION (node
->decl
));
1590 current_function_decl
= node
->decl
;
1592 free_dominance_info (CDI_DOMINATORS
);
1593 free_dominance_info (CDI_POST_DOMINATORS
);
1594 current_function_decl
= NULL
;
1605 /* Helper function to perform function body dump. */
1608 execute_function_dump (void *data ATTRIBUTE_UNUSED
)
1610 if (dump_file
&& current_function_decl
)
1612 if (cfun
->curr_properties
& PROP_trees
)
1613 dump_function_to_file (current_function_decl
, dump_file
, dump_flags
);
1616 if (dump_flags
& TDF_SLIM
)
1617 print_rtl_slim_with_bb (dump_file
, get_insns (), dump_flags
);
1618 else if ((cfun
->curr_properties
& PROP_cfg
)
1619 && (dump_flags
& TDF_BLOCKS
))
1620 print_rtl_with_bb (dump_file
, get_insns ());
1622 print_rtl (dump_file
, get_insns ());
1624 if ((cfun
->curr_properties
& PROP_cfg
)
1625 && graph_dump_format
!= no_graph
1626 && (dump_flags
& TDF_GRAPH
))
1627 print_rtl_graph_with_bb (dump_file_name
, get_insns ());
1630 /* Flush the file. If verification fails, we won't be able to
1631 close the file before aborting. */
1636 /* Perform all TODO actions that ought to be done on each function. */
1639 execute_function_todo (void *data
)
1641 unsigned int flags
= (size_t)data
;
1642 flags
&= ~cfun
->last_verified
;
1646 /* Always cleanup the CFG before trying to update SSA. */
1647 if (flags
& TODO_cleanup_cfg
)
1649 bool cleanup
= cleanup_tree_cfg ();
1651 if (cleanup
&& (cfun
->curr_properties
& PROP_ssa
))
1652 flags
|= TODO_remove_unused_locals
;
1654 /* When cleanup_tree_cfg merges consecutive blocks, it may
1655 perform some simplistic propagation when removing single
1656 valued PHI nodes. This propagation may, in turn, cause the
1657 SSA form to become out-of-date (see PR 22037). So, even
1658 if the parent pass had not scheduled an SSA update, we may
1659 still need to do one. */
1660 if (!(flags
& TODO_update_ssa_any
) && need_ssa_update_p (cfun
))
1661 flags
|= TODO_update_ssa
;
1664 if (flags
& TODO_update_ssa_any
)
1666 unsigned update_flags
= flags
& TODO_update_ssa_any
;
1667 update_ssa (update_flags
);
1668 cfun
->last_verified
&= ~TODO_verify_ssa
;
1671 if (flags
& TODO_rebuild_alias
)
1673 execute_update_addresses_taken ();
1674 compute_may_aliases ();
1676 else if (optimize
&& (flags
& TODO_update_address_taken
))
1677 execute_update_addresses_taken ();
1679 if (flags
& TODO_remove_unused_locals
)
1680 remove_unused_locals ();
1682 if (flags
& TODO_rebuild_frequencies
)
1683 rebuild_frequencies ();
1685 if (flags
& TODO_rebuild_cgraph_edges
)
1686 rebuild_cgraph_edges ();
1688 /* If we've seen errors do not bother running any verifiers. */
1692 #if defined ENABLE_CHECKING
1693 if (flags
& TODO_verify_ssa
1694 || (current_loops
&& loops_state_satisfies_p (LOOP_CLOSED_SSA
)))
1696 if (flags
& TODO_verify_flow
)
1697 verify_flow_info ();
1698 if (flags
& TODO_verify_stmts
)
1699 verify_gimple_in_cfg (cfun
);
1700 if (current_loops
&& loops_state_satisfies_p (LOOP_CLOSED_SSA
))
1701 verify_loop_closed_ssa (false);
1702 if (flags
& TODO_verify_rtl_sharing
)
1703 verify_rtl_sharing ();
1706 cfun
->last_verified
= flags
& TODO_verify_all
;
1709 /* Perform all TODO actions. */
1711 execute_todo (unsigned int flags
)
1713 #if defined ENABLE_CHECKING
1715 && need_ssa_update_p (cfun
))
1716 gcc_assert (flags
& TODO_update_ssa_any
);
1719 timevar_push (TV_TODO
);
1721 /* Inform the pass whether it is the first time it is run. */
1722 first_pass_instance
= (flags
& TODO_mark_first_instance
) != 0;
1724 statistics_fini_pass ();
1726 do_per_function (execute_function_todo
, (void *)(size_t) flags
);
1728 /* Always remove functions just as before inlining: IPA passes might be
1729 interested to see bodies of extern inline functions that are not inlined
1730 to analyze side effects. The full removal is done just at the end
1731 of IPA pass queue. */
1732 if (flags
& TODO_remove_functions
)
1735 cgraph_remove_unreachable_nodes (true, dump_file
);
1738 if ((flags
& TODO_dump_cgraph
) && dump_file
&& !current_function_decl
)
1741 dump_cgraph (dump_file
);
1742 /* Flush the file. If verification fails, we won't be able to
1743 close the file before aborting. */
1747 if (flags
& TODO_ggc_collect
)
1750 /* Now that the dumping has been done, we can get rid of the optional
1752 if (flags
& TODO_df_finish
)
1753 df_finish_pass ((flags
& TODO_df_verify
) != 0);
1755 timevar_pop (TV_TODO
);
1758 /* Verify invariants that should hold between passes. This is a place
1759 to put simple sanity checks. */
1762 verify_interpass_invariants (void)
1764 gcc_checking_assert (!fold_deferring_overflow_warnings_p ());
1767 /* Clear the last verified flag. */
1770 clear_last_verified (void *data ATTRIBUTE_UNUSED
)
1772 cfun
->last_verified
= 0;
1775 /* Helper function. Verify that the properties has been turn into the
1776 properties expected by the pass. */
1778 #ifdef ENABLE_CHECKING
1780 verify_curr_properties (void *data
)
1782 unsigned int props
= (size_t)data
;
1783 gcc_assert ((cfun
->curr_properties
& props
) == props
);
1787 /* Initialize pass dump file. */
1788 /* This is non-static so that the plugins can use it. */
1791 pass_init_dump_file (struct opt_pass
*pass
)
1793 /* If a dump file name is present, open it if enabled. */
1794 if (pass
->static_pass_number
!= -1)
1796 bool initializing_dump
= !dump_initialized_p (pass
->static_pass_number
);
1797 dump_file_name
= get_dump_file_name (pass
->static_pass_number
);
1798 dump_file
= dump_begin (pass
->static_pass_number
, &dump_flags
);
1799 if (dump_file
&& current_function_decl
)
1800 dump_function_header (dump_file
, current_function_decl
, dump_flags
);
1801 return initializing_dump
;
1807 /* Flush PASS dump file. */
1808 /* This is non-static so that plugins can use it. */
1811 pass_fini_dump_file (struct opt_pass
*pass
)
1813 /* Flush and close dump file. */
1816 free (CONST_CAST (char *, dump_file_name
));
1817 dump_file_name
= NULL
;
1822 dump_end (pass
->static_pass_number
, dump_file
);
1827 /* After executing the pass, apply expected changes to the function
1831 update_properties_after_pass (void *data
)
1833 struct opt_pass
*pass
= (struct opt_pass
*) data
;
1834 cfun
->curr_properties
= (cfun
->curr_properties
| pass
->properties_provided
)
1835 & ~pass
->properties_destroyed
;
1838 /* Execute summary generation for all of the passes in IPA_PASS. */
1841 execute_ipa_summary_passes (struct ipa_opt_pass_d
*ipa_pass
)
1845 struct opt_pass
*pass
= &ipa_pass
->pass
;
1847 /* Execute all of the IPA_PASSes in the list. */
1848 if (ipa_pass
->pass
.type
== IPA_PASS
1849 && (!pass
->gate
|| pass
->gate ())
1850 && ipa_pass
->generate_summary
)
1852 pass_init_dump_file (pass
);
1854 /* If a timevar is present, start it. */
1856 timevar_push (pass
->tv_id
);
1858 ipa_pass
->generate_summary ();
1862 timevar_pop (pass
->tv_id
);
1864 pass_fini_dump_file (pass
);
1866 ipa_pass
= (struct ipa_opt_pass_d
*)ipa_pass
->pass
.next
;
1870 /* Execute IPA_PASS function transform on NODE. */
1873 execute_one_ipa_transform_pass (struct cgraph_node
*node
,
1874 struct ipa_opt_pass_d
*ipa_pass
)
1876 struct opt_pass
*pass
= &ipa_pass
->pass
;
1877 unsigned int todo_after
= 0;
1879 current_pass
= pass
;
1880 if (!ipa_pass
->function_transform
)
1883 /* Note that the folders should only create gimple expressions.
1884 This is a hack until the new folder is ready. */
1885 in_gimple_form
= (cfun
&& (cfun
->curr_properties
& PROP_trees
)) != 0;
1887 pass_init_dump_file (pass
);
1889 /* Run pre-pass verification. */
1890 execute_todo (ipa_pass
->function_transform_todo_flags_start
);
1892 /* If a timevar is present, start it. */
1893 if (pass
->tv_id
!= TV_NONE
)
1894 timevar_push (pass
->tv_id
);
1897 todo_after
= ipa_pass
->function_transform (node
);
1900 if (pass
->tv_id
!= TV_NONE
)
1901 timevar_pop (pass
->tv_id
);
1903 /* Run post-pass cleanup and verification. */
1904 execute_todo (todo_after
);
1905 verify_interpass_invariants ();
1907 do_per_function (execute_function_dump
, NULL
);
1908 pass_fini_dump_file (pass
);
1910 current_pass
= NULL
;
1913 /* For the current function, execute all ipa transforms. */
1916 execute_all_ipa_transforms (void)
1918 struct cgraph_node
*node
;
1921 node
= cgraph_get_node (current_function_decl
);
1923 if (node
->ipa_transforms_to_apply
)
1927 for (i
= 0; i
< VEC_length (ipa_opt_pass
, node
->ipa_transforms_to_apply
);
1929 execute_one_ipa_transform_pass (node
,
1930 VEC_index (ipa_opt_pass
,
1931 node
->ipa_transforms_to_apply
,
1933 VEC_free (ipa_opt_pass
, heap
, node
->ipa_transforms_to_apply
);
1934 node
->ipa_transforms_to_apply
= NULL
;
1938 /* Check if PASS is explicitly disabled or enabled and return
1939 the gate status. FUNC is the function to be processed, and
1940 GATE_STATUS is the gate status determined by pass manager by
1944 override_gate_status (struct opt_pass
*pass
, tree func
, bool gate_status
)
1946 bool explicitly_enabled
= false;
1947 bool explicitly_disabled
= false;
1950 = is_pass_explicitly_enabled_or_disabled (pass
, func
,
1951 enabled_pass_uid_range_tab
);
1953 = is_pass_explicitly_enabled_or_disabled (pass
, func
,
1954 disabled_pass_uid_range_tab
);
1956 gate_status
= !explicitly_disabled
&& (gate_status
|| explicitly_enabled
);
1965 execute_one_pass (struct opt_pass
*pass
)
1967 bool initializing_dump
;
1968 unsigned int todo_after
= 0;
1972 /* IPA passes are executed on whole program, so cfun should be NULL.
1973 Other passes need function context set. */
1974 if (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
)
1975 gcc_assert (!cfun
&& !current_function_decl
);
1977 gcc_assert (cfun
&& current_function_decl
);
1979 current_pass
= pass
;
1981 /* Check whether gate check should be avoided.
1982 User controls the value of the gate through the parameter "gate_status". */
1983 gate_status
= (pass
->gate
== NULL
) ? true : pass
->gate();
1984 gate_status
= override_gate_status (pass
, current_function_decl
, gate_status
);
1986 /* Override gate with plugin. */
1987 invoke_plugin_callbacks (PLUGIN_OVERRIDE_GATE
, &gate_status
);
1991 current_pass
= NULL
;
1995 /* Pass execution event trigger: useful to identify passes being
1997 invoke_plugin_callbacks (PLUGIN_PASS_EXECUTION
, pass
);
1999 if (!quiet_flag
&& !cfun
)
2000 fprintf (stderr
, " <%s>", pass
->name
? pass
->name
: "");
2002 /* Note that the folders should only create gimple expressions.
2003 This is a hack until the new folder is ready. */
2004 in_gimple_form
= (cfun
&& (cfun
->curr_properties
& PROP_trees
)) != 0;
2006 initializing_dump
= pass_init_dump_file (pass
);
2008 /* Run pre-pass verification. */
2009 execute_todo (pass
->todo_flags_start
);
2011 #ifdef ENABLE_CHECKING
2012 do_per_function (verify_curr_properties
,
2013 (void *)(size_t)pass
->properties_required
);
2016 /* If a timevar is present, start it. */
2017 if (pass
->tv_id
!= TV_NONE
)
2018 timevar_push (pass
->tv_id
);
2023 todo_after
= pass
->execute ();
2024 do_per_function (clear_last_verified
, NULL
);
2028 if (pass
->tv_id
!= TV_NONE
)
2029 timevar_pop (pass
->tv_id
);
2031 do_per_function (update_properties_after_pass
, pass
);
2033 if (initializing_dump
2035 && graph_dump_format
!= no_graph
2037 && (cfun
->curr_properties
& (PROP_cfg
| PROP_rtl
))
2038 == (PROP_cfg
| PROP_rtl
))
2040 get_dump_file_info (pass
->static_pass_number
)->flags
|= TDF_GRAPH
;
2041 dump_flags
|= TDF_GRAPH
;
2042 clean_graph_dump_file (dump_file_name
);
2045 /* Run post-pass cleanup and verification. */
2046 execute_todo (todo_after
| pass
->todo_flags_finish
);
2047 verify_interpass_invariants ();
2048 do_per_function (execute_function_dump
, NULL
);
2049 if (pass
->type
== IPA_PASS
)
2051 struct cgraph_node
*node
;
2052 FOR_EACH_FUNCTION_WITH_GIMPLE_BODY (node
)
2053 VEC_safe_push (ipa_opt_pass
, heap
, node
->ipa_transforms_to_apply
,
2054 (struct ipa_opt_pass_d
*)pass
);
2057 if (!current_function_decl
)
2058 cgraph_process_new_functions ();
2060 pass_fini_dump_file (pass
);
2062 if (pass
->type
!= SIMPLE_IPA_PASS
&& pass
->type
!= IPA_PASS
)
2063 gcc_assert (!(cfun
->curr_properties
& PROP_trees
)
2064 || pass
->type
!= RTL_PASS
);
2066 current_pass
= NULL
;
2072 execute_pass_list (struct opt_pass
*pass
)
2076 gcc_assert (pass
->type
== GIMPLE_PASS
2077 || pass
->type
== RTL_PASS
);
2078 if (execute_one_pass (pass
) && pass
->sub
)
2079 execute_pass_list (pass
->sub
);
2085 /* Same as execute_pass_list but assume that subpasses of IPA passes
2086 are local passes. If SET is not NULL, write out summaries of only
2087 those node in SET. */
2090 ipa_write_summaries_2 (struct opt_pass
*pass
, cgraph_node_set set
,
2091 varpool_node_set vset
,
2092 struct lto_out_decl_state
*state
)
2096 struct ipa_opt_pass_d
*ipa_pass
= (struct ipa_opt_pass_d
*)pass
;
2097 gcc_assert (!current_function_decl
);
2099 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
2100 if (pass
->type
== IPA_PASS
2101 && ipa_pass
->write_summary
2102 && (!pass
->gate
|| pass
->gate ()))
2104 /* If a timevar is present, start it. */
2106 timevar_push (pass
->tv_id
);
2108 pass_init_dump_file (pass
);
2110 ipa_pass
->write_summary (set
,vset
);
2112 pass_fini_dump_file (pass
);
2114 /* If a timevar is present, start it. */
2116 timevar_pop (pass
->tv_id
);
2119 if (pass
->sub
&& pass
->sub
->type
!= GIMPLE_PASS
)
2120 ipa_write_summaries_2 (pass
->sub
, set
, vset
, state
);
2126 /* Helper function of ipa_write_summaries. Creates and destroys the
2127 decl state and calls ipa_write_summaries_2 for all passes that have
2128 summaries. SET is the set of nodes to be written. */
2131 ipa_write_summaries_1 (cgraph_node_set set
, varpool_node_set vset
)
2133 struct lto_out_decl_state
*state
= lto_new_out_decl_state ();
2134 compute_ltrans_boundary (state
, set
, vset
);
2136 lto_push_out_decl_state (state
);
2138 gcc_assert (!flag_wpa
);
2139 ipa_write_summaries_2 (all_regular_ipa_passes
, set
, vset
, state
);
2140 ipa_write_summaries_2 (all_lto_gen_passes
, set
, vset
, state
);
2142 gcc_assert (lto_get_out_decl_state () == state
);
2143 lto_pop_out_decl_state ();
2144 lto_delete_out_decl_state (state
);
2147 /* Write out summaries for all the nodes in the callgraph. */
2150 ipa_write_summaries (void)
2152 cgraph_node_set set
;
2153 varpool_node_set vset
;
2154 struct cgraph_node
**order
;
2155 struct varpool_node
*vnode
;
2158 if (!flag_generate_lto
|| seen_error ())
2161 set
= cgraph_node_set_new ();
2163 /* Create the callgraph set in the same order used in
2164 cgraph_expand_all_functions. This mostly facilitates debugging,
2165 since it causes the gimple file to be processed in the same order
2166 as the source code. */
2167 order
= XCNEWVEC (struct cgraph_node
*, cgraph_n_nodes
);
2168 order_pos
= ipa_reverse_postorder (order
);
2169 gcc_assert (order_pos
== cgraph_n_nodes
);
2171 for (i
= order_pos
- 1; i
>= 0; i
--)
2173 struct cgraph_node
*node
= order
[i
];
2175 if (cgraph_function_with_gimple_body_p (node
))
2177 /* When streaming out references to statements as part of some IPA
2178 pass summary, the statements need to have uids assigned and the
2179 following does that for all the IPA passes here. Naturally, this
2180 ordering then matches the one IPA-passes get in their stmt_fixup
2183 push_cfun (DECL_STRUCT_FUNCTION (node
->decl
));
2184 renumber_gimple_stmt_uids ();
2188 cgraph_node_set_add (set
, node
);
2190 vset
= varpool_node_set_new ();
2192 for (vnode
= varpool_nodes
; vnode
; vnode
= vnode
->next
)
2193 if (vnode
->needed
&& (!vnode
->alias
|| vnode
->alias_of
))
2194 varpool_node_set_add (vset
, vnode
);
2196 ipa_write_summaries_1 (set
, vset
);
2199 free_cgraph_node_set (set
);
2200 free_varpool_node_set (vset
);
2203 /* Same as execute_pass_list but assume that subpasses of IPA passes
2204 are local passes. If SET is not NULL, write out optimization summaries of
2205 only those node in SET. */
2208 ipa_write_optimization_summaries_1 (struct opt_pass
*pass
, cgraph_node_set set
,
2209 varpool_node_set vset
,
2210 struct lto_out_decl_state
*state
)
2214 struct ipa_opt_pass_d
*ipa_pass
= (struct ipa_opt_pass_d
*)pass
;
2215 gcc_assert (!current_function_decl
);
2217 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
2218 if (pass
->type
== IPA_PASS
2219 && ipa_pass
->write_optimization_summary
2220 && (!pass
->gate
|| pass
->gate ()))
2222 /* If a timevar is present, start it. */
2224 timevar_push (pass
->tv_id
);
2226 pass_init_dump_file (pass
);
2228 ipa_pass
->write_optimization_summary (set
, vset
);
2230 pass_fini_dump_file (pass
);
2232 /* If a timevar is present, start it. */
2234 timevar_pop (pass
->tv_id
);
2237 if (pass
->sub
&& pass
->sub
->type
!= GIMPLE_PASS
)
2238 ipa_write_optimization_summaries_1 (pass
->sub
, set
, vset
, state
);
2244 /* Write all the optimization summaries for the cgraph nodes in SET. If SET is
2245 NULL, write out all summaries of all nodes. */
2248 ipa_write_optimization_summaries (cgraph_node_set set
, varpool_node_set vset
)
2250 struct lto_out_decl_state
*state
= lto_new_out_decl_state ();
2251 cgraph_node_set_iterator csi
;
2252 compute_ltrans_boundary (state
, set
, vset
);
2254 lto_push_out_decl_state (state
);
2255 for (csi
= csi_start (set
); !csi_end_p (csi
); csi_next (&csi
))
2257 struct cgraph_node
*node
= csi_node (csi
);
2258 /* When streaming out references to statements as part of some IPA
2259 pass summary, the statements need to have uids assigned.
2261 For functions newly born at WPA stage we need to initialize
2264 && gimple_has_body_p (node
->decl
))
2266 push_cfun (DECL_STRUCT_FUNCTION (node
->decl
));
2267 renumber_gimple_stmt_uids ();
2272 gcc_assert (flag_wpa
);
2273 ipa_write_optimization_summaries_1 (all_regular_ipa_passes
, set
, vset
, state
);
2274 ipa_write_optimization_summaries_1 (all_lto_gen_passes
, set
, vset
, state
);
2276 gcc_assert (lto_get_out_decl_state () == state
);
2277 lto_pop_out_decl_state ();
2278 lto_delete_out_decl_state (state
);
2281 /* Same as execute_pass_list but assume that subpasses of IPA passes
2282 are local passes. */
2285 ipa_read_summaries_1 (struct opt_pass
*pass
)
2289 struct ipa_opt_pass_d
*ipa_pass
= (struct ipa_opt_pass_d
*) pass
;
2291 gcc_assert (!current_function_decl
);
2293 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
2295 if (pass
->gate
== NULL
|| pass
->gate ())
2297 if (pass
->type
== IPA_PASS
&& ipa_pass
->read_summary
)
2299 /* If a timevar is present, start it. */
2301 timevar_push (pass
->tv_id
);
2303 pass_init_dump_file (pass
);
2305 ipa_pass
->read_summary ();
2307 pass_fini_dump_file (pass
);
2311 timevar_pop (pass
->tv_id
);
2314 if (pass
->sub
&& pass
->sub
->type
!= GIMPLE_PASS
)
2315 ipa_read_summaries_1 (pass
->sub
);
2322 /* Read all the summaries for all_regular_ipa_passes and all_lto_gen_passes. */
2325 ipa_read_summaries (void)
2327 ipa_read_summaries_1 (all_regular_ipa_passes
);
2328 ipa_read_summaries_1 (all_lto_gen_passes
);
2331 /* Same as execute_pass_list but assume that subpasses of IPA passes
2332 are local passes. */
2335 ipa_read_optimization_summaries_1 (struct opt_pass
*pass
)
2339 struct ipa_opt_pass_d
*ipa_pass
= (struct ipa_opt_pass_d
*) pass
;
2341 gcc_assert (!current_function_decl
);
2343 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
2345 if (pass
->gate
== NULL
|| pass
->gate ())
2347 if (pass
->type
== IPA_PASS
&& ipa_pass
->read_optimization_summary
)
2349 /* If a timevar is present, start it. */
2351 timevar_push (pass
->tv_id
);
2353 pass_init_dump_file (pass
);
2355 ipa_pass
->read_optimization_summary ();
2357 pass_fini_dump_file (pass
);
2361 timevar_pop (pass
->tv_id
);
2364 if (pass
->sub
&& pass
->sub
->type
!= GIMPLE_PASS
)
2365 ipa_read_optimization_summaries_1 (pass
->sub
);
2371 /* Read all the summaries for all_regular_ipa_passes and all_lto_gen_passes. */
2374 ipa_read_optimization_summaries (void)
2376 ipa_read_optimization_summaries_1 (all_regular_ipa_passes
);
2377 ipa_read_optimization_summaries_1 (all_lto_gen_passes
);
2380 /* Same as execute_pass_list but assume that subpasses of IPA passes
2381 are local passes. */
2383 execute_ipa_pass_list (struct opt_pass
*pass
)
2387 gcc_assert (!current_function_decl
);
2389 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
2390 if (execute_one_pass (pass
) && pass
->sub
)
2392 if (pass
->sub
->type
== GIMPLE_PASS
)
2394 invoke_plugin_callbacks (PLUGIN_EARLY_GIMPLE_PASSES_START
, NULL
);
2395 do_per_function_toporder ((void (*)(void *))execute_pass_list
,
2397 invoke_plugin_callbacks (PLUGIN_EARLY_GIMPLE_PASSES_END
, NULL
);
2399 else if (pass
->sub
->type
== SIMPLE_IPA_PASS
2400 || pass
->sub
->type
== IPA_PASS
)
2401 execute_ipa_pass_list (pass
->sub
);
2405 gcc_assert (!current_function_decl
);
2406 cgraph_process_new_functions ();
2412 /* Execute stmt fixup hooks of all passes in PASS for NODE and STMTS. */
2415 execute_ipa_stmt_fixups (struct opt_pass
*pass
,
2416 struct cgraph_node
*node
, gimple
*stmts
)
2420 /* Execute all of the IPA_PASSes in the list. */
2421 if (pass
->type
== IPA_PASS
2422 && (!pass
->gate
|| pass
->gate ()))
2424 struct ipa_opt_pass_d
*ipa_pass
= (struct ipa_opt_pass_d
*) pass
;
2426 if (ipa_pass
->stmt_fixup
)
2428 pass_init_dump_file (pass
);
2429 /* If a timevar is present, start it. */
2431 timevar_push (pass
->tv_id
);
2433 ipa_pass
->stmt_fixup (node
, stmts
);
2437 timevar_pop (pass
->tv_id
);
2438 pass_fini_dump_file (pass
);
2441 execute_ipa_stmt_fixups (pass
->sub
, node
, stmts
);
2447 /* Execute stmt fixup hooks of all IPA passes for NODE and STMTS. */
2450 execute_all_ipa_stmt_fixups (struct cgraph_node
*node
, gimple
*stmts
)
2452 execute_ipa_stmt_fixups (all_regular_ipa_passes
, node
, stmts
);
2456 extern void debug_properties (unsigned int);
2457 extern void dump_properties (FILE *, unsigned int);
2460 dump_properties (FILE *dump
, unsigned int props
)
2462 fprintf (dump
, "Properties:\n");
2463 if (props
& PROP_gimple_any
)
2464 fprintf (dump
, "PROP_gimple_any\n");
2465 if (props
& PROP_gimple_lcf
)
2466 fprintf (dump
, "PROP_gimple_lcf\n");
2467 if (props
& PROP_gimple_leh
)
2468 fprintf (dump
, "PROP_gimple_leh\n");
2469 if (props
& PROP_cfg
)
2470 fprintf (dump
, "PROP_cfg\n");
2471 if (props
& PROP_referenced_vars
)
2472 fprintf (dump
, "PROP_referenced_vars\n");
2473 if (props
& PROP_ssa
)
2474 fprintf (dump
, "PROP_ssa\n");
2475 if (props
& PROP_no_crit_edges
)
2476 fprintf (dump
, "PROP_no_crit_edges\n");
2477 if (props
& PROP_rtl
)
2478 fprintf (dump
, "PROP_rtl\n");
2479 if (props
& PROP_gimple_lomp
)
2480 fprintf (dump
, "PROP_gimple_lomp\n");
2481 if (props
& PROP_gimple_lcx
)
2482 fprintf (dump
, "PROP_gimple_lcx\n");
2483 if (props
& PROP_cfglayout
)
2484 fprintf (dump
, "PROP_cfglayout\n");
2488 debug_properties (unsigned int props
)
2490 dump_properties (stderr
, props
);
2493 /* Called by local passes to see if function is called by already processed nodes.
2494 Because we process nodes in topological order, this means that function is
2495 in recursive cycle or we introduced new direct calls. */
2497 function_called_by_processed_nodes_p (void)
2499 struct cgraph_edge
*e
;
2500 for (e
= cgraph_get_node (current_function_decl
)->callers
;
2504 if (e
->caller
->decl
== current_function_decl
)
2506 if (!cgraph_function_with_gimple_body_p (e
->caller
))
2508 if (TREE_ASM_WRITTEN (e
->caller
->decl
))
2510 if (!e
->caller
->process
&& !e
->caller
->global
.inlined_to
)
2515 fprintf (dump_file
, "Already processed call to:\n");
2516 dump_cgraph_node (dump_file
, e
->caller
);
2521 #include "gt-passes.h"