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"
77 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
78 #include "dwarf2out.h"
81 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
85 #ifdef SDB_DEBUGGING_INFO
89 #ifdef XCOFF_DEBUGGING_INFO
90 #include "xcoffout.h" /* Needed for external data
91 declarations for e.g. AIX 4.x. */
94 /* This is used for debugging. It allows the current pass to printed
95 from anywhere in compilation.
96 The variable current_pass is also used for statistics and plugins. */
97 struct opt_pass
*current_pass
;
99 /* Call from anywhere to find out what pass this is. Useful for
100 printing out debugging information deep inside an service
103 print_current_pass (FILE *file
)
106 fprintf (file
, "current pass = %s (%d)\n",
107 current_pass
->name
, current_pass
->static_pass_number
);
109 fprintf (file
, "no current pass.\n");
113 /* Call from the debugger to get the current pass name. */
117 print_current_pass (stderr
);
122 /* Global variables used to communicate with passes. */
125 bool first_pass_instance
;
128 /* This is called from various places for FUNCTION_DECL, VAR_DECL,
131 This does nothing for local (non-static) variables, unless the
132 variable is a register variable with DECL_ASSEMBLER_NAME set. In
133 that case, or if the variable is not an automatic, it sets up the
134 RTL and outputs any assembler code (label definition, storage
135 allocation and initialization).
137 DECL is the declaration. TOP_LEVEL is nonzero
138 if this declaration is not within a function. */
141 rest_of_decl_compilation (tree decl
,
145 /* We deferred calling assemble_alias so that we could collect
146 other attributes such as visibility. Emit the alias now. */
150 alias
= lookup_attribute ("alias", DECL_ATTRIBUTES (decl
));
153 alias
= TREE_VALUE (TREE_VALUE (alias
));
154 alias
= get_identifier (TREE_STRING_POINTER (alias
));
155 assemble_alias (decl
, alias
);
159 /* Can't defer this, because it needs to happen before any
160 later function definitions are processed. */
161 if (DECL_ASSEMBLER_NAME_SET_P (decl
) && DECL_REGISTER (decl
))
162 make_decl_rtl (decl
);
164 /* Forward declarations for nested functions are not "external",
165 but we need to treat them as if they were. */
166 if (TREE_STATIC (decl
) || DECL_EXTERNAL (decl
)
167 || TREE_CODE (decl
) == FUNCTION_DECL
)
169 timevar_push (TV_VARCONST
);
171 /* Don't output anything when a tentative file-scope definition
172 is seen. But at end of compilation, do output code for them.
174 We do output all variables and rely on
175 callgraph code to defer them except for forward declarations
176 (see gcc.c-torture/compile/920624-1.c) */
178 || !DECL_DEFER_OUTPUT (decl
)
179 || DECL_INITIAL (decl
))
180 && !DECL_EXTERNAL (decl
))
182 /* When reading LTO unit, we also read varpool, so do not
184 if (in_lto_p
&& !at_end
)
186 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
187 varpool_finalize_decl (decl
);
190 #ifdef ASM_FINISH_DECLARE_OBJECT
191 if (decl
== last_assemble_variable_decl
)
193 ASM_FINISH_DECLARE_OBJECT (asm_out_file
, decl
,
198 timevar_pop (TV_VARCONST
);
200 else if (TREE_CODE (decl
) == TYPE_DECL
201 /* Like in rest_of_type_compilation, avoid confusing the debug
202 information machinery when there are errors. */
205 timevar_push (TV_SYMOUT
);
206 debug_hooks
->type_decl (decl
, !top_level
);
207 timevar_pop (TV_SYMOUT
);
210 /* Let cgraph know about the existence of variables. */
211 if (in_lto_p
&& !at_end
)
213 else if (TREE_CODE (decl
) == VAR_DECL
&& !DECL_EXTERNAL (decl
)
214 && TREE_STATIC (decl
))
218 /* Called after finishing a record, union or enumeral type. */
221 rest_of_type_compilation (tree type
, int toplev
)
223 /* Avoid confusing the debug information machinery when there are
228 timevar_push (TV_SYMOUT
);
229 debug_hooks
->type_decl (TYPE_STUB_DECL (type
), !toplev
);
230 timevar_pop (TV_SYMOUT
);
236 finish_optimization_passes (void)
239 struct dump_file_info
*dfi
;
242 timevar_push (TV_DUMP
);
243 if (profile_arc_flag
|| flag_test_coverage
|| flag_branch_probabilities
)
245 dump_file
= dump_begin (pass_profile
.pass
.static_pass_number
, NULL
);
248 dump_end (pass_profile
.pass
.static_pass_number
, dump_file
);
253 dump_file
= dump_begin (pass_combine
.pass
.static_pass_number
, NULL
);
256 dump_combine_total_stats (dump_file
);
257 dump_end (pass_combine
.pass
.static_pass_number
, dump_file
);
261 /* Do whatever is necessary to finish printing the graphs. */
262 if (graph_dump_format
!= no_graph
)
263 for (i
= TDI_end
; (dfi
= get_dump_file_info (i
)) != NULL
; ++i
)
264 if (dump_initialized_p (i
)
265 && (dfi
->flags
& TDF_GRAPH
) != 0
266 && (name
= get_dump_file_name (i
)) != NULL
)
268 finish_graph_dump_file (name
);
272 timevar_pop (TV_DUMP
);
276 gate_rest_of_compilation (void)
278 /* Early return if there were errors. We can run afoul of our
279 consistency checks, and there's not really much point in fixing them. */
280 return !(rtl_dump_and_exit
|| flag_syntax_only
|| seen_error ());
283 struct gimple_opt_pass pass_rest_of_compilation
=
287 "*rest_of_compilation", /* name */
288 gate_rest_of_compilation
, /* gate */
292 0, /* static_pass_number */
293 TV_REST_OF_COMPILATION
, /* tv_id */
294 PROP_rtl
, /* properties_required */
295 0, /* properties_provided */
296 0, /* properties_destroyed */
297 0, /* todo_flags_start */
298 TODO_ggc_collect
/* todo_flags_finish */
303 gate_postreload (void)
305 return reload_completed
;
308 struct rtl_opt_pass pass_postreload
=
312 "*all-postreload", /* name */
313 gate_postreload
, /* gate */
317 0, /* static_pass_number */
318 TV_POSTRELOAD
, /* tv_id */
319 PROP_rtl
, /* properties_required */
320 0, /* properties_provided */
321 0, /* properties_destroyed */
322 0, /* todo_flags_start */
323 TODO_ggc_collect
| TODO_verify_rtl_sharing
/* todo_flags_finish */
329 /* The root of the compilation pass tree, once constructed. */
330 struct opt_pass
*all_passes
, *all_small_ipa_passes
, *all_lowering_passes
,
331 *all_regular_ipa_passes
, *all_lto_gen_passes
;
333 /* This is used by plugins, and should also be used in register_pass. */
334 #define DEF_PASS_LIST(LIST) &LIST,
335 struct opt_pass
**gcc_pass_lists
[] = { GCC_PASS_LISTS NULL
};
338 /* A map from static pass id to optimization pass. */
339 struct opt_pass
**passes_by_id
;
340 int passes_by_id_size
;
342 /* Set the static pass number of pass PASS to ID and record that
343 in the mapping from static pass number to pass. */
346 set_pass_for_id (int id
, struct opt_pass
*pass
)
348 pass
->static_pass_number
= id
;
349 if (passes_by_id_size
<= id
)
351 passes_by_id
= XRESIZEVEC (struct opt_pass
*, passes_by_id
, id
+ 1);
352 memset (passes_by_id
+ passes_by_id_size
, 0,
353 (id
+ 1 - passes_by_id_size
) * sizeof (void *));
354 passes_by_id_size
= id
+ 1;
356 passes_by_id
[id
] = pass
;
359 /* Return the pass with the static pass number ID. */
362 get_pass_for_id (int id
)
364 if (id
>= passes_by_id_size
)
366 return passes_by_id
[id
];
369 /* Iterate over the pass tree allocating dump file numbers. We want
370 to do this depth first, and independent of whether the pass is
374 register_one_dump_file (struct opt_pass
*pass
)
376 char *dot_name
, *flag_name
, *glob_name
;
377 const char *name
, *prefix
;
381 /* See below in next_pass_1. */
383 if (pass
->static_pass_number
!= -1)
384 sprintf (num
, "%d", ((int) pass
->static_pass_number
< 0
385 ? 1 : pass
->static_pass_number
));
387 /* The name is both used to identify the pass for the purposes of plugins,
388 and to specify dump file name and option.
389 The latter two might want something short which is not quite unique; for
390 that reason, we may have a disambiguating prefix, followed by a space
391 to mark the start of the following dump file name / option string. */
392 name
= strchr (pass
->name
, ' ');
393 name
= name
? name
+ 1 : pass
->name
;
394 dot_name
= concat (".", name
, num
, NULL
);
395 if (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
)
396 prefix
= "ipa-", flags
= TDF_IPA
;
397 else if (pass
->type
== GIMPLE_PASS
)
398 prefix
= "tree-", flags
= TDF_TREE
;
400 prefix
= "rtl-", flags
= TDF_RTL
;
402 flag_name
= concat (prefix
, name
, num
, NULL
);
403 glob_name
= concat (prefix
, name
, NULL
);
404 id
= dump_register (dot_name
, flag_name
, glob_name
, flags
);
405 set_pass_for_id (id
, pass
);
408 /* Recursive worker function for register_dump_files. */
411 register_dump_files_1 (struct opt_pass
*pass
, int properties
)
415 int new_properties
= (properties
| pass
->properties_provided
)
416 & ~pass
->properties_destroyed
;
418 if (pass
->name
&& pass
->name
[0] != '*')
419 register_one_dump_file (pass
);
422 new_properties
= register_dump_files_1 (pass
->sub
, new_properties
);
424 /* If we have a gate, combine the properties that we could have with
425 and without the pass being examined. */
427 properties
&= new_properties
;
429 properties
= new_properties
;
438 /* Register the dump files for the pipeline starting at PASS.
439 PROPERTIES reflects the properties that are guaranteed to be available at
440 the beginning of the pipeline. */
443 register_dump_files (struct opt_pass
*pass
,int properties
)
445 pass
->properties_required
|= properties
;
446 register_dump_files_1 (pass
, properties
);
449 /* Look at the static_pass_number and duplicate the pass
450 if it is already added to a list. */
452 static struct opt_pass
*
453 make_pass_instance (struct opt_pass
*pass
, bool track_duplicates
)
455 /* A nonzero static_pass_number indicates that the
456 pass is already in the list. */
457 if (pass
->static_pass_number
)
459 struct opt_pass
*new_pass
;
461 if (pass
->type
== GIMPLE_PASS
462 || pass
->type
== RTL_PASS
463 || pass
->type
== SIMPLE_IPA_PASS
)
465 new_pass
= XNEW (struct opt_pass
);
466 memcpy (new_pass
, pass
, sizeof (struct opt_pass
));
468 else if (pass
->type
== IPA_PASS
)
470 new_pass
= (struct opt_pass
*)XNEW (struct ipa_opt_pass_d
);
471 memcpy (new_pass
, pass
, sizeof (struct ipa_opt_pass_d
));
476 new_pass
->next
= NULL
;
478 new_pass
->todo_flags_start
&= ~TODO_mark_first_instance
;
480 /* Indicate to register_dump_files that this pass has duplicates,
481 and so it should rename the dump file. The first instance will
482 be -1, and be number of duplicates = -static_pass_number - 1.
483 Subsequent instances will be > 0 and just the duplicate number. */
484 if ((pass
->name
&& pass
->name
[0] != '*') || track_duplicates
)
486 pass
->static_pass_number
-= 1;
487 new_pass
->static_pass_number
= -pass
->static_pass_number
;
493 pass
->todo_flags_start
|= TODO_mark_first_instance
;
494 pass
->static_pass_number
= -1;
496 invoke_plugin_callbacks (PLUGIN_NEW_PASS
, pass
);
501 /* Add a pass to the pass list. Duplicate the pass if it's already
504 static struct opt_pass
**
505 next_pass_1 (struct opt_pass
**list
, struct opt_pass
*pass
)
507 /* Every pass should have a name so that plugins can refer to them. */
508 gcc_assert (pass
->name
!= NULL
);
510 *list
= make_pass_instance (pass
, false);
512 return &(*list
)->next
;
515 /* List node for an inserted pass instance. We need to keep track of all
516 the newly-added pass instances (with 'added_pass_nodes' defined below)
517 so that we can register their dump files after pass-positioning is finished.
518 Registering dumping files needs to be post-processed or the
519 static_pass_number of the opt_pass object would be modified and mess up
520 the dump file names of future pass instances to be added. */
522 struct pass_list_node
524 struct opt_pass
*pass
;
525 struct pass_list_node
*next
;
528 static struct pass_list_node
*added_pass_nodes
= NULL
;
529 static struct pass_list_node
*prev_added_pass_node
;
531 /* Insert the pass at the proper position. Return true if the pass
532 is successfully added.
534 NEW_PASS_INFO - new pass to be inserted
535 PASS_LIST - root of the pass list to insert the new pass to */
538 position_pass (struct register_pass_info
*new_pass_info
,
539 struct opt_pass
**pass_list
)
541 struct opt_pass
*pass
= *pass_list
, *prev_pass
= NULL
;
542 bool success
= false;
544 for ( ; pass
; prev_pass
= pass
, pass
= pass
->next
)
546 /* Check if the current pass is of the same type as the new pass and
547 matches the name and the instance number of the reference pass. */
548 if (pass
->type
== new_pass_info
->pass
->type
550 && !strcmp (pass
->name
, new_pass_info
->reference_pass_name
)
551 && ((new_pass_info
->ref_pass_instance_number
== 0)
552 || (new_pass_info
->ref_pass_instance_number
==
553 pass
->static_pass_number
)
554 || (new_pass_info
->ref_pass_instance_number
== 1
555 && pass
->todo_flags_start
& TODO_mark_first_instance
)))
557 struct opt_pass
*new_pass
;
558 struct pass_list_node
*new_pass_node
;
560 new_pass
= make_pass_instance (new_pass_info
->pass
, true);
562 /* Insert the new pass instance based on the positioning op. */
563 switch (new_pass_info
->pos_op
)
565 case PASS_POS_INSERT_AFTER
:
566 new_pass
->next
= pass
->next
;
567 pass
->next
= new_pass
;
569 /* Skip newly inserted pass to avoid repeated
570 insertions in the case where the new pass and the
571 existing one have the same name. */
574 case PASS_POS_INSERT_BEFORE
:
575 new_pass
->next
= pass
;
577 prev_pass
->next
= new_pass
;
579 *pass_list
= new_pass
;
581 case PASS_POS_REPLACE
:
582 new_pass
->next
= pass
->next
;
584 prev_pass
->next
= new_pass
;
586 *pass_list
= new_pass
;
587 new_pass
->sub
= pass
->sub
;
588 new_pass
->tv_id
= pass
->tv_id
;
592 error ("invalid pass positioning operation");
596 /* Save the newly added pass (instance) in the added_pass_nodes
597 list so that we can register its dump file later. Note that
598 we cannot register the dump file now because doing so will modify
599 the static_pass_number of the opt_pass object and therefore
600 mess up the dump file name of future instances. */
601 new_pass_node
= XCNEW (struct pass_list_node
);
602 new_pass_node
->pass
= new_pass
;
603 if (!added_pass_nodes
)
604 added_pass_nodes
= new_pass_node
;
606 prev_added_pass_node
->next
= new_pass_node
;
607 prev_added_pass_node
= new_pass_node
;
612 if (pass
->sub
&& position_pass (new_pass_info
, &pass
->sub
))
619 /* Hooks a new pass into the pass lists.
621 PASS_INFO - pass information that specifies the opt_pass object,
622 reference pass, instance number, and how to position
626 register_pass (struct register_pass_info
*pass_info
)
628 bool all_instances
, success
;
630 /* The checks below could fail in buggy plugins. Existing GCC
631 passes should never fail these checks, so we mention plugin in
633 if (!pass_info
->pass
)
634 fatal_error ("plugin cannot register a missing pass");
636 if (!pass_info
->pass
->name
)
637 fatal_error ("plugin cannot register an unnamed pass");
639 if (!pass_info
->reference_pass_name
)
641 ("plugin cannot register pass %qs without reference pass name",
642 pass_info
->pass
->name
);
644 /* Try to insert the new pass to the pass lists. We need to check
645 all five lists as the reference pass could be in one (or all) of
647 all_instances
= pass_info
->ref_pass_instance_number
== 0;
648 success
= position_pass (pass_info
, &all_lowering_passes
);
649 if (!success
|| all_instances
)
650 success
|= position_pass (pass_info
, &all_small_ipa_passes
);
651 if (!success
|| all_instances
)
652 success
|= position_pass (pass_info
, &all_regular_ipa_passes
);
653 if (!success
|| all_instances
)
654 success
|= position_pass (pass_info
, &all_lto_gen_passes
);
655 if (!success
|| all_instances
)
656 success
|= position_pass (pass_info
, &all_passes
);
659 ("pass %qs not found but is referenced by new pass %qs",
660 pass_info
->reference_pass_name
, pass_info
->pass
->name
);
662 /* OK, we have successfully inserted the new pass. We need to register
663 the dump files for the newly added pass and its duplicates (if any).
664 Because the registration of plugin/backend passes happens after the
665 command-line options are parsed, the options that specify single
666 pass dumping (e.g. -fdump-tree-PASSNAME) cannot be used for new
667 passes. Therefore we currently can only enable dumping of
668 new passes when the 'dump-all' flags (e.g. -fdump-tree-all)
669 are specified. While doing so, we also delete the pass_list_node
670 objects created during pass positioning. */
671 while (added_pass_nodes
)
673 struct pass_list_node
*next_node
= added_pass_nodes
->next
;
674 enum tree_dump_index tdi
;
675 register_one_dump_file (added_pass_nodes
->pass
);
676 if (added_pass_nodes
->pass
->type
== SIMPLE_IPA_PASS
677 || added_pass_nodes
->pass
->type
== IPA_PASS
)
679 else if (added_pass_nodes
->pass
->type
== GIMPLE_PASS
)
683 /* Check if dump-all flag is specified. */
684 if (get_dump_file_info (tdi
)->state
)
685 get_dump_file_info (added_pass_nodes
->pass
->static_pass_number
)
686 ->state
= get_dump_file_info (tdi
)->state
;
687 XDELETE (added_pass_nodes
);
688 added_pass_nodes
= next_node
;
692 /* Construct the pass tree. The sequencing of passes is driven by
695 cgraph_finalize_compilation_unit ()
696 for each node N in the cgraph
697 cgraph_analyze_function (N)
698 cgraph_lower_function (N) -> all_lowering_passes
700 If we are optimizing, cgraph_optimize is then invoked:
703 ipa_passes () -> all_small_ipa_passes
704 cgraph_expand_all_functions ()
705 for each node N in the cgraph
706 cgraph_expand_function (N)
707 tree_rest_of_compilation (DECL (N)) -> all_passes
711 init_optimization_passes (void)
715 #define NEXT_PASS(PASS) (p = next_pass_1 (p, &((PASS).pass)))
717 /* All passes needed to lower the function into shape optimizers can
718 operate on. These passes are always run first on the function, but
719 backend might produce already lowered functions that are not processed
721 p
= &all_lowering_passes
;
722 NEXT_PASS (pass_warn_unused_result
);
723 NEXT_PASS (pass_diagnose_omp_blocks
);
724 NEXT_PASS (pass_mudflap_1
);
725 NEXT_PASS (pass_lower_omp
);
726 NEXT_PASS (pass_lower_cf
);
727 NEXT_PASS (pass_refactor_eh
);
728 NEXT_PASS (pass_lower_eh
);
729 NEXT_PASS (pass_build_cfg
);
730 NEXT_PASS (pass_warn_function_return
);
731 NEXT_PASS (pass_build_cgraph_edges
);
734 /* Interprocedural optimization passes. */
735 p
= &all_small_ipa_passes
;
736 NEXT_PASS (pass_ipa_free_lang_data
);
737 NEXT_PASS (pass_ipa_function_and_variable_visibility
);
738 NEXT_PASS (pass_early_local_passes
);
740 struct opt_pass
**p
= &pass_early_local_passes
.pass
.sub
;
741 NEXT_PASS (pass_fixup_cfg
);
742 NEXT_PASS (pass_init_datastructures
);
743 NEXT_PASS (pass_expand_omp
);
745 NEXT_PASS (pass_referenced_vars
);
746 NEXT_PASS (pass_build_ssa
);
747 NEXT_PASS (pass_lower_vector
);
748 NEXT_PASS (pass_early_warn_uninitialized
);
749 NEXT_PASS (pass_rebuild_cgraph_edges
);
750 NEXT_PASS (pass_inline_parameters
);
751 NEXT_PASS (pass_early_inline
);
752 NEXT_PASS (pass_all_early_optimizations
);
754 struct opt_pass
**p
= &pass_all_early_optimizations
.pass
.sub
;
755 NEXT_PASS (pass_remove_cgraph_callee_edges
);
756 NEXT_PASS (pass_rename_ssa_copies
);
757 NEXT_PASS (pass_ccp
);
758 NEXT_PASS (pass_forwprop
);
759 /* pass_build_ealias is a dummy pass that ensures that we
760 execute TODO_rebuild_alias at this point. Re-building
761 alias information also rewrites no longer addressed
762 locals into SSA form if possible. */
763 NEXT_PASS (pass_build_ealias
);
764 NEXT_PASS (pass_sra_early
);
765 NEXT_PASS (pass_fre
);
766 NEXT_PASS (pass_copy_prop
);
767 NEXT_PASS (pass_merge_phi
);
768 NEXT_PASS (pass_cd_dce
);
769 NEXT_PASS (pass_early_ipa_sra
);
770 NEXT_PASS (pass_tail_recursion
);
771 NEXT_PASS (pass_convert_switch
);
772 NEXT_PASS (pass_cleanup_eh
);
773 NEXT_PASS (pass_profile
);
774 NEXT_PASS (pass_local_pure_const
);
775 /* Split functions creates parts that are not run through
776 early optimizations again. It is thus good idea to do this
778 NEXT_PASS (pass_split_functions
);
780 NEXT_PASS (pass_release_ssa_names
);
781 NEXT_PASS (pass_rebuild_cgraph_edges
);
782 NEXT_PASS (pass_inline_parameters
);
784 NEXT_PASS (pass_ipa_tree_profile
);
786 struct opt_pass
**p
= &pass_ipa_tree_profile
.pass
.sub
;
787 NEXT_PASS (pass_feedback_split_functions
);
789 NEXT_PASS (pass_ipa_increase_alignment
);
790 NEXT_PASS (pass_ipa_matrix_reorg
);
791 NEXT_PASS (pass_ipa_lower_emutls
);
794 p
= &all_regular_ipa_passes
;
795 NEXT_PASS (pass_ipa_whole_program_visibility
);
796 NEXT_PASS (pass_ipa_profile
);
797 NEXT_PASS (pass_ipa_cp
);
798 NEXT_PASS (pass_ipa_cdtor_merge
);
799 NEXT_PASS (pass_ipa_inline
);
800 NEXT_PASS (pass_ipa_pure_const
);
801 NEXT_PASS (pass_ipa_reference
);
802 NEXT_PASS (pass_ipa_pta
);
805 p
= &all_lto_gen_passes
;
806 NEXT_PASS (pass_ipa_lto_gimple_out
);
807 NEXT_PASS (pass_ipa_lto_finish_out
); /* This must be the last LTO pass. */
810 /* These passes are run after IPA passes on every function that is being
811 output to the assembler file. */
813 NEXT_PASS (pass_lower_eh_dispatch
);
814 NEXT_PASS (pass_all_optimizations
);
816 struct opt_pass
**p
= &pass_all_optimizations
.pass
.sub
;
817 NEXT_PASS (pass_remove_cgraph_callee_edges
);
818 /* Initial scalar cleanups before alias computation.
819 They ensure memory accesses are not indirect wherever possible. */
820 NEXT_PASS (pass_strip_predict_hints
);
821 NEXT_PASS (pass_rename_ssa_copies
);
822 NEXT_PASS (pass_complete_unrolli
);
823 NEXT_PASS (pass_ccp
);
824 NEXT_PASS (pass_forwprop
);
825 NEXT_PASS (pass_call_cdce
);
826 /* pass_build_alias is a dummy pass that ensures that we
827 execute TODO_rebuild_alias at this point. Re-building
828 alias information also rewrites no longer addressed
829 locals into SSA form if possible. */
830 NEXT_PASS (pass_build_alias
);
831 NEXT_PASS (pass_return_slot
);
832 NEXT_PASS (pass_phiprop
);
833 NEXT_PASS (pass_fre
);
834 NEXT_PASS (pass_copy_prop
);
835 NEXT_PASS (pass_merge_phi
);
836 NEXT_PASS (pass_vrp
);
837 NEXT_PASS (pass_dce
);
838 NEXT_PASS (pass_cselim
);
839 NEXT_PASS (pass_tree_ifcombine
);
840 NEXT_PASS (pass_phiopt
);
841 NEXT_PASS (pass_tail_recursion
);
843 NEXT_PASS (pass_stdarg
);
844 NEXT_PASS (pass_lower_complex
);
845 NEXT_PASS (pass_sra
);
846 NEXT_PASS (pass_rename_ssa_copies
);
847 /* The dom pass will also resolve all __builtin_constant_p calls
848 that are still there to 0. This has to be done after some
849 propagations have already run, but before some more dead code
850 is removed, and this place fits nicely. Remember this when
851 trying to move or duplicate pass_dominator somewhere earlier. */
852 NEXT_PASS (pass_dominator
);
853 /* The only const/copy propagation opportunities left after
854 DOM should be due to degenerate PHI nodes. So rather than
855 run the full propagators, run a specialized pass which
856 only examines PHIs to discover const/copy propagation
858 NEXT_PASS (pass_phi_only_cprop
);
859 NEXT_PASS (pass_dse
);
860 NEXT_PASS (pass_reassoc
);
861 NEXT_PASS (pass_dce
);
862 NEXT_PASS (pass_forwprop
);
863 NEXT_PASS (pass_phiopt
);
864 NEXT_PASS (pass_object_sizes
);
865 NEXT_PASS (pass_ccp
);
866 NEXT_PASS (pass_copy_prop
);
867 NEXT_PASS (pass_cse_sincos
);
868 NEXT_PASS (pass_optimize_bswap
);
869 NEXT_PASS (pass_split_crit_edges
);
870 NEXT_PASS (pass_pre
);
871 NEXT_PASS (pass_sink_code
);
872 NEXT_PASS (pass_tree_loop
);
874 struct opt_pass
**p
= &pass_tree_loop
.pass
.sub
;
875 NEXT_PASS (pass_tree_loop_init
);
876 NEXT_PASS (pass_lim
);
877 NEXT_PASS (pass_copy_prop
);
878 NEXT_PASS (pass_dce_loop
);
879 NEXT_PASS (pass_tree_unswitch
);
880 NEXT_PASS (pass_scev_cprop
);
881 NEXT_PASS (pass_record_bounds
);
882 NEXT_PASS (pass_check_data_deps
);
883 NEXT_PASS (pass_loop_distribution
);
884 NEXT_PASS (pass_copy_prop
);
885 NEXT_PASS (pass_graphite
);
887 struct opt_pass
**p
= &pass_graphite
.pass
.sub
;
888 NEXT_PASS (pass_graphite_transforms
);
889 NEXT_PASS (pass_lim
);
890 NEXT_PASS (pass_copy_prop
);
891 NEXT_PASS (pass_dce_loop
);
893 NEXT_PASS (pass_iv_canon
);
894 NEXT_PASS (pass_if_conversion
);
895 NEXT_PASS (pass_vectorize
);
897 struct opt_pass
**p
= &pass_vectorize
.pass
.sub
;
898 NEXT_PASS (pass_lower_vector_ssa
);
899 NEXT_PASS (pass_dce_loop
);
901 NEXT_PASS (pass_predcom
);
902 NEXT_PASS (pass_complete_unroll
);
903 NEXT_PASS (pass_slp_vectorize
);
904 NEXT_PASS (pass_parallelize_loops
);
905 NEXT_PASS (pass_loop_prefetch
);
906 NEXT_PASS (pass_iv_optimize
);
907 NEXT_PASS (pass_tree_loop_done
);
909 NEXT_PASS (pass_cse_reciprocals
);
910 NEXT_PASS (pass_reassoc
);
911 NEXT_PASS (pass_vrp
);
912 NEXT_PASS (pass_dominator
);
913 /* The only const/copy propagation opportunities left after
914 DOM should be due to degenerate PHI nodes. So rather than
915 run the full propagators, run a specialized pass which
916 only examines PHIs to discover const/copy propagation
918 NEXT_PASS (pass_phi_only_cprop
);
919 NEXT_PASS (pass_cd_dce
);
920 NEXT_PASS (pass_tracer
);
922 /* FIXME: If DCE is not run before checking for uninitialized uses,
923 we may get false warnings (e.g., testsuite/gcc.dg/uninit-5.c).
924 However, this also causes us to misdiagnose cases that should be
925 real warnings (e.g., testsuite/gcc.dg/pr18501.c).
927 To fix the false positives in uninit-5.c, we would have to
928 account for the predicates protecting the set and the use of each
929 variable. Using a representation like Gated Single Assignment
931 NEXT_PASS (pass_late_warn_uninitialized
);
932 NEXT_PASS (pass_dse
);
933 NEXT_PASS (pass_forwprop
);
934 NEXT_PASS (pass_phiopt
);
935 NEXT_PASS (pass_fold_builtins
);
936 NEXT_PASS (pass_optimize_widening_mul
);
937 NEXT_PASS (pass_tail_calls
);
938 NEXT_PASS (pass_rename_ssa_copies
);
939 NEXT_PASS (pass_uncprop
);
940 NEXT_PASS (pass_local_pure_const
);
942 NEXT_PASS (pass_lower_complex_O0
);
943 NEXT_PASS (pass_cleanup_eh
);
944 NEXT_PASS (pass_lower_resx
);
945 NEXT_PASS (pass_nrv
);
946 NEXT_PASS (pass_mudflap_2
);
947 NEXT_PASS (pass_cleanup_cfg_post_optimizing
);
948 NEXT_PASS (pass_warn_function_noreturn
);
950 NEXT_PASS (pass_expand
);
952 NEXT_PASS (pass_rest_of_compilation
);
954 struct opt_pass
**p
= &pass_rest_of_compilation
.pass
.sub
;
955 NEXT_PASS (pass_init_function
);
956 NEXT_PASS (pass_jump
);
957 NEXT_PASS (pass_rtl_eh
);
958 NEXT_PASS (pass_initial_value_sets
);
959 NEXT_PASS (pass_unshare_all_rtl
);
960 NEXT_PASS (pass_instantiate_virtual_regs
);
961 NEXT_PASS (pass_into_cfg_layout_mode
);
962 NEXT_PASS (pass_jump2
);
963 NEXT_PASS (pass_lower_subreg
);
964 NEXT_PASS (pass_df_initialize_opt
);
965 NEXT_PASS (pass_cse
);
966 NEXT_PASS (pass_rtl_fwprop
);
967 NEXT_PASS (pass_rtl_cprop
);
968 NEXT_PASS (pass_rtl_pre
);
969 NEXT_PASS (pass_rtl_hoist
);
970 NEXT_PASS (pass_rtl_cprop
);
971 NEXT_PASS (pass_rtl_store_motion
);
972 NEXT_PASS (pass_cse_after_global_opts
);
973 NEXT_PASS (pass_rtl_ifcvt
);
974 NEXT_PASS (pass_reginfo_init
);
975 /* Perform loop optimizations. It might be better to do them a bit
976 sooner, but we want the profile feedback to work more
978 NEXT_PASS (pass_loop2
);
980 struct opt_pass
**p
= &pass_loop2
.pass
.sub
;
981 NEXT_PASS (pass_rtl_loop_init
);
982 NEXT_PASS (pass_rtl_move_loop_invariants
);
983 NEXT_PASS (pass_rtl_unswitch
);
984 NEXT_PASS (pass_rtl_unroll_and_peel_loops
);
985 NEXT_PASS (pass_rtl_doloop
);
986 NEXT_PASS (pass_rtl_loop_done
);
989 NEXT_PASS (pass_web
);
990 NEXT_PASS (pass_rtl_cprop
);
991 NEXT_PASS (pass_cse2
);
992 NEXT_PASS (pass_rtl_dse1
);
993 NEXT_PASS (pass_rtl_fwprop_addr
);
994 NEXT_PASS (pass_inc_dec
);
995 NEXT_PASS (pass_initialize_regs
);
996 NEXT_PASS (pass_ud_rtl_dce
);
997 NEXT_PASS (pass_combine
);
998 NEXT_PASS (pass_if_after_combine
);
999 NEXT_PASS (pass_partition_blocks
);
1000 NEXT_PASS (pass_regmove
);
1001 NEXT_PASS (pass_outof_cfg_layout_mode
);
1002 NEXT_PASS (pass_split_all_insns
);
1003 NEXT_PASS (pass_lower_subreg2
);
1004 NEXT_PASS (pass_df_initialize_no_opt
);
1005 NEXT_PASS (pass_stack_ptr_mod
);
1006 NEXT_PASS (pass_mode_switching
);
1007 NEXT_PASS (pass_match_asm_constraints
);
1008 NEXT_PASS (pass_sms
);
1009 NEXT_PASS (pass_sched
);
1010 NEXT_PASS (pass_ira
);
1011 NEXT_PASS (pass_postreload
);
1013 struct opt_pass
**p
= &pass_postreload
.pass
.sub
;
1014 NEXT_PASS (pass_postreload_cse
);
1015 NEXT_PASS (pass_gcse2
);
1016 NEXT_PASS (pass_split_after_reload
);
1017 NEXT_PASS (pass_implicit_zee
);
1018 NEXT_PASS (pass_compare_elim_after_reload
);
1019 NEXT_PASS (pass_branch_target_load_optimize1
);
1020 NEXT_PASS (pass_thread_prologue_and_epilogue
);
1021 NEXT_PASS (pass_rtl_dse2
);
1022 NEXT_PASS (pass_stack_adjustments
);
1023 NEXT_PASS (pass_peephole2
);
1024 NEXT_PASS (pass_if_after_reload
);
1025 NEXT_PASS (pass_regrename
);
1026 NEXT_PASS (pass_cprop_hardreg
);
1027 NEXT_PASS (pass_fast_rtl_dce
);
1028 NEXT_PASS (pass_reorder_blocks
);
1029 NEXT_PASS (pass_branch_target_load_optimize2
);
1030 NEXT_PASS (pass_leaf_regs
);
1031 NEXT_PASS (pass_split_before_sched2
);
1032 NEXT_PASS (pass_sched2
);
1033 NEXT_PASS (pass_stack_regs
);
1035 struct opt_pass
**p
= &pass_stack_regs
.pass
.sub
;
1036 NEXT_PASS (pass_split_before_regstack
);
1037 NEXT_PASS (pass_stack_regs_run
);
1039 NEXT_PASS (pass_compute_alignments
);
1040 NEXT_PASS (pass_duplicate_computed_gotos
);
1041 NEXT_PASS (pass_variable_tracking
);
1042 NEXT_PASS (pass_free_cfg
);
1043 NEXT_PASS (pass_machine_reorg
);
1044 NEXT_PASS (pass_cleanup_barriers
);
1045 NEXT_PASS (pass_delay_slots
);
1046 NEXT_PASS (pass_split_for_shorten_branches
);
1047 NEXT_PASS (pass_convert_to_eh_region_ranges
);
1048 NEXT_PASS (pass_shorten_branches
);
1049 NEXT_PASS (pass_set_nothrow_function_flags
);
1050 NEXT_PASS (pass_final
);
1052 NEXT_PASS (pass_df_finish
);
1054 NEXT_PASS (pass_clean_state
);
1059 /* Register the passes with the tree dump code. */
1060 register_dump_files (all_lowering_passes
, PROP_gimple_any
);
1061 register_dump_files (all_small_ipa_passes
,
1062 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
1064 register_dump_files (all_regular_ipa_passes
,
1065 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
1067 register_dump_files (all_lto_gen_passes
,
1068 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
1070 register_dump_files (all_passes
,
1071 PROP_gimple_any
| PROP_gimple_lcf
| PROP_gimple_leh
1075 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
1076 function CALLBACK for every function in the call graph. Otherwise,
1077 call CALLBACK on the current function. */
1080 do_per_function (void (*callback
) (void *data
), void *data
)
1082 if (current_function_decl
)
1086 struct cgraph_node
*node
;
1087 for (node
= cgraph_nodes
; node
; node
= node
->next
)
1088 if (node
->analyzed
&& gimple_has_body_p (node
->decl
)
1089 && (!node
->clone_of
|| node
->decl
!= node
->clone_of
->decl
))
1091 push_cfun (DECL_STRUCT_FUNCTION (node
->decl
));
1092 current_function_decl
= node
->decl
;
1096 free_dominance_info (CDI_DOMINATORS
);
1097 free_dominance_info (CDI_POST_DOMINATORS
);
1099 current_function_decl
= NULL
;
1106 /* Because inlining might remove no-longer reachable nodes, we need to
1107 keep the array visible to garbage collector to avoid reading collected
1110 static GTY ((length ("nnodes"))) cgraph_node_ptr
*order
;
1112 /* If we are in IPA mode (i.e., current_function_decl is NULL), call
1113 function CALLBACK for every function in the call graph. Otherwise,
1114 call CALLBACK on the current function.
1115 This function is global so that plugins can use it. */
1117 do_per_function_toporder (void (*callback
) (void *data
), void *data
)
1121 if (current_function_decl
)
1125 gcc_assert (!order
);
1126 order
= ggc_alloc_vec_cgraph_node_ptr (cgraph_n_nodes
);
1127 nnodes
= cgraph_postorder (order
);
1128 for (i
= nnodes
- 1; i
>= 0; i
--)
1129 order
[i
]->process
= 1;
1130 for (i
= nnodes
- 1; i
>= 0; i
--)
1132 struct cgraph_node
*node
= order
[i
];
1134 /* Allow possibly removed nodes to be garbage collected. */
1139 push_cfun (DECL_STRUCT_FUNCTION (node
->decl
));
1140 current_function_decl
= node
->decl
;
1142 free_dominance_info (CDI_DOMINATORS
);
1143 free_dominance_info (CDI_POST_DOMINATORS
);
1144 current_function_decl
= NULL
;
1155 /* Perform all TODO actions that ought to be done on each function. */
1158 execute_function_todo (void *data
)
1160 unsigned int flags
= (size_t)data
;
1161 flags
&= ~cfun
->last_verified
;
1165 /* Always cleanup the CFG before trying to update SSA. */
1166 if (flags
& TODO_cleanup_cfg
)
1168 bool cleanup
= cleanup_tree_cfg ();
1170 if (cleanup
&& (cfun
->curr_properties
& PROP_ssa
))
1171 flags
|= TODO_remove_unused_locals
;
1173 /* When cleanup_tree_cfg merges consecutive blocks, it may
1174 perform some simplistic propagation when removing single
1175 valued PHI nodes. This propagation may, in turn, cause the
1176 SSA form to become out-of-date (see PR 22037). So, even
1177 if the parent pass had not scheduled an SSA update, we may
1178 still need to do one. */
1179 if (!(flags
& TODO_update_ssa_any
) && need_ssa_update_p (cfun
))
1180 flags
|= TODO_update_ssa
;
1183 if (flags
& TODO_update_ssa_any
)
1185 unsigned update_flags
= flags
& TODO_update_ssa_any
;
1186 update_ssa (update_flags
);
1187 cfun
->last_verified
&= ~TODO_verify_ssa
;
1190 if (flags
& TODO_rebuild_alias
)
1192 execute_update_addresses_taken ();
1193 compute_may_aliases ();
1195 else if (optimize
&& (flags
& TODO_update_address_taken
))
1196 execute_update_addresses_taken ();
1198 if (flags
& TODO_remove_unused_locals
)
1199 remove_unused_locals ();
1201 if ((flags
& TODO_dump_func
) && dump_file
&& current_function_decl
)
1203 if (cfun
->curr_properties
& PROP_trees
)
1204 dump_function_to_file (current_function_decl
, dump_file
, dump_flags
);
1207 if (dump_flags
& TDF_SLIM
)
1208 print_rtl_slim_with_bb (dump_file
, get_insns (), dump_flags
);
1209 else if ((cfun
->curr_properties
& PROP_cfg
)
1210 && (dump_flags
& TDF_BLOCKS
))
1211 print_rtl_with_bb (dump_file
, get_insns ());
1213 print_rtl (dump_file
, get_insns ());
1215 if ((cfun
->curr_properties
& PROP_cfg
)
1216 && graph_dump_format
!= no_graph
1217 && (dump_flags
& TDF_GRAPH
))
1218 print_rtl_graph_with_bb (dump_file_name
, get_insns ());
1221 /* Flush the file. If verification fails, we won't be able to
1222 close the file before aborting. */
1226 if (flags
& TODO_rebuild_frequencies
)
1227 rebuild_frequencies ();
1229 if (flags
& TODO_rebuild_cgraph_edges
)
1230 rebuild_cgraph_edges ();
1232 /* If we've seen errors do not bother running any verifiers. */
1236 #if defined ENABLE_CHECKING
1237 if (flags
& TODO_verify_ssa
1238 || (current_loops
&& loops_state_satisfies_p (LOOP_CLOSED_SSA
)))
1240 if (flags
& TODO_verify_flow
)
1241 verify_flow_info ();
1242 if (flags
& TODO_verify_stmts
)
1244 if (current_loops
&& loops_state_satisfies_p (LOOP_CLOSED_SSA
))
1245 verify_loop_closed_ssa (false);
1246 if (flags
& TODO_verify_rtl_sharing
)
1247 verify_rtl_sharing ();
1250 cfun
->last_verified
= flags
& TODO_verify_all
;
1253 /* Perform all TODO actions. */
1255 execute_todo (unsigned int flags
)
1257 #if defined ENABLE_CHECKING
1259 && need_ssa_update_p (cfun
))
1260 gcc_assert (flags
& TODO_update_ssa_any
);
1263 timevar_push (TV_TODO
);
1265 /* Inform the pass whether it is the first time it is run. */
1266 first_pass_instance
= (flags
& TODO_mark_first_instance
) != 0;
1268 statistics_fini_pass ();
1270 do_per_function (execute_function_todo
, (void *)(size_t) flags
);
1272 /* Always remove functions just as before inlining: IPA passes might be
1273 interested to see bodies of extern inline functions that are not inlined
1274 to analyze side effects. The full removal is done just at the end
1275 of IPA pass queue. */
1276 if (flags
& TODO_remove_functions
)
1279 cgraph_remove_unreachable_nodes (true, dump_file
);
1282 if ((flags
& TODO_dump_cgraph
) && dump_file
&& !current_function_decl
)
1285 dump_cgraph (dump_file
);
1286 /* Flush the file. If verification fails, we won't be able to
1287 close the file before aborting. */
1291 if (flags
& TODO_ggc_collect
)
1294 /* Now that the dumping has been done, we can get rid of the optional
1296 if (flags
& TODO_df_finish
)
1297 df_finish_pass ((flags
& TODO_df_verify
) != 0);
1299 timevar_pop (TV_TODO
);
1302 /* Verify invariants that should hold between passes. This is a place
1303 to put simple sanity checks. */
1306 verify_interpass_invariants (void)
1308 gcc_checking_assert (!fold_deferring_overflow_warnings_p ());
1311 /* Clear the last verified flag. */
1314 clear_last_verified (void *data ATTRIBUTE_UNUSED
)
1316 cfun
->last_verified
= 0;
1319 /* Helper function. Verify that the properties has been turn into the
1320 properties expected by the pass. */
1322 #ifdef ENABLE_CHECKING
1324 verify_curr_properties (void *data
)
1326 unsigned int props
= (size_t)data
;
1327 gcc_assert ((cfun
->curr_properties
& props
) == props
);
1331 /* Initialize pass dump file. */
1332 /* This is non-static so that the plugins can use it. */
1335 pass_init_dump_file (struct opt_pass
*pass
)
1337 /* If a dump file name is present, open it if enabled. */
1338 if (pass
->static_pass_number
!= -1)
1340 bool initializing_dump
= !dump_initialized_p (pass
->static_pass_number
);
1341 dump_file_name
= get_dump_file_name (pass
->static_pass_number
);
1342 dump_file
= dump_begin (pass
->static_pass_number
, &dump_flags
);
1343 if (dump_file
&& current_function_decl
)
1345 const char *dname
, *aname
;
1346 struct cgraph_node
*node
= cgraph_node (current_function_decl
);
1347 dname
= lang_hooks
.decl_printable_name (current_function_decl
, 2);
1348 aname
= (IDENTIFIER_POINTER
1349 (DECL_ASSEMBLER_NAME (current_function_decl
)));
1350 fprintf (dump_file
, "\n;; Function %s (%s)%s\n\n", dname
, aname
,
1351 node
->frequency
== NODE_FREQUENCY_HOT
1353 : node
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
1354 ? " (unlikely executed)"
1355 : node
->frequency
== NODE_FREQUENCY_EXECUTED_ONCE
1356 ? " (executed once)"
1359 return initializing_dump
;
1365 /* Flush PASS dump file. */
1366 /* This is non-static so that plugins can use it. */
1369 pass_fini_dump_file (struct opt_pass
*pass
)
1371 /* Flush and close dump file. */
1374 free (CONST_CAST (char *, dump_file_name
));
1375 dump_file_name
= NULL
;
1380 dump_end (pass
->static_pass_number
, dump_file
);
1385 /* After executing the pass, apply expected changes to the function
1389 update_properties_after_pass (void *data
)
1391 struct opt_pass
*pass
= (struct opt_pass
*) data
;
1392 cfun
->curr_properties
= (cfun
->curr_properties
| pass
->properties_provided
)
1393 & ~pass
->properties_destroyed
;
1396 /* Execute summary generation for all of the passes in IPA_PASS. */
1399 execute_ipa_summary_passes (struct ipa_opt_pass_d
*ipa_pass
)
1403 struct opt_pass
*pass
= &ipa_pass
->pass
;
1405 /* Execute all of the IPA_PASSes in the list. */
1406 if (ipa_pass
->pass
.type
== IPA_PASS
1407 && (!pass
->gate
|| pass
->gate ())
1408 && ipa_pass
->generate_summary
)
1410 pass_init_dump_file (pass
);
1412 /* If a timevar is present, start it. */
1414 timevar_push (pass
->tv_id
);
1416 ipa_pass
->generate_summary ();
1420 timevar_pop (pass
->tv_id
);
1422 pass_fini_dump_file (pass
);
1424 ipa_pass
= (struct ipa_opt_pass_d
*)ipa_pass
->pass
.next
;
1428 /* Execute IPA_PASS function transform on NODE. */
1431 execute_one_ipa_transform_pass (struct cgraph_node
*node
,
1432 struct ipa_opt_pass_d
*ipa_pass
)
1434 struct opt_pass
*pass
= &ipa_pass
->pass
;
1435 unsigned int todo_after
= 0;
1437 current_pass
= pass
;
1438 if (!ipa_pass
->function_transform
)
1441 /* Note that the folders should only create gimple expressions.
1442 This is a hack until the new folder is ready. */
1443 in_gimple_form
= (cfun
&& (cfun
->curr_properties
& PROP_trees
)) != 0;
1445 pass_init_dump_file (pass
);
1447 /* Run pre-pass verification. */
1448 execute_todo (ipa_pass
->function_transform_todo_flags_start
);
1450 /* If a timevar is present, start it. */
1451 if (pass
->tv_id
!= TV_NONE
)
1452 timevar_push (pass
->tv_id
);
1455 todo_after
= ipa_pass
->function_transform (node
);
1458 if (pass
->tv_id
!= TV_NONE
)
1459 timevar_pop (pass
->tv_id
);
1461 /* Run post-pass cleanup and verification. */
1462 execute_todo (todo_after
);
1463 verify_interpass_invariants ();
1465 pass_fini_dump_file (pass
);
1467 current_pass
= NULL
;
1470 /* For the current function, execute all ipa transforms. */
1473 execute_all_ipa_transforms (void)
1475 struct cgraph_node
*node
;
1478 node
= cgraph_node (current_function_decl
);
1480 if (node
->ipa_transforms_to_apply
)
1484 for (i
= 0; i
< VEC_length (ipa_opt_pass
, node
->ipa_transforms_to_apply
);
1486 execute_one_ipa_transform_pass (node
,
1487 VEC_index (ipa_opt_pass
,
1488 node
->ipa_transforms_to_apply
,
1490 VEC_free (ipa_opt_pass
, heap
, node
->ipa_transforms_to_apply
);
1491 node
->ipa_transforms_to_apply
= NULL
;
1498 execute_one_pass (struct opt_pass
*pass
)
1500 bool initializing_dump
;
1501 unsigned int todo_after
= 0;
1505 /* IPA passes are executed on whole program, so cfun should be NULL.
1506 Other passes need function context set. */
1507 if (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
)
1508 gcc_assert (!cfun
&& !current_function_decl
);
1510 gcc_assert (cfun
&& current_function_decl
);
1512 current_pass
= pass
;
1514 /* Check whether gate check should be avoided.
1515 User controls the value of the gate through the parameter "gate_status". */
1516 gate_status
= (pass
->gate
== NULL
) ? true : pass
->gate();
1518 /* Override gate with plugin. */
1519 invoke_plugin_callbacks (PLUGIN_OVERRIDE_GATE
, &gate_status
);
1523 current_pass
= NULL
;
1527 /* Pass execution event trigger: useful to identify passes being
1529 invoke_plugin_callbacks (PLUGIN_PASS_EXECUTION
, pass
);
1531 if (!quiet_flag
&& !cfun
)
1532 fprintf (stderr
, " <%s>", pass
->name
? pass
->name
: "");
1534 /* Note that the folders should only create gimple expressions.
1535 This is a hack until the new folder is ready. */
1536 in_gimple_form
= (cfun
&& (cfun
->curr_properties
& PROP_trees
)) != 0;
1538 initializing_dump
= pass_init_dump_file (pass
);
1540 /* Run pre-pass verification. */
1541 execute_todo (pass
->todo_flags_start
);
1543 #ifdef ENABLE_CHECKING
1544 do_per_function (verify_curr_properties
,
1545 (void *)(size_t)pass
->properties_required
);
1548 /* If a timevar is present, start it. */
1549 if (pass
->tv_id
!= TV_NONE
)
1550 timevar_push (pass
->tv_id
);
1555 todo_after
= pass
->execute ();
1556 do_per_function (clear_last_verified
, NULL
);
1560 if (pass
->tv_id
!= TV_NONE
)
1561 timevar_pop (pass
->tv_id
);
1563 do_per_function (update_properties_after_pass
, pass
);
1565 if (initializing_dump
1567 && graph_dump_format
!= no_graph
1569 && (cfun
->curr_properties
& (PROP_cfg
| PROP_rtl
))
1570 == (PROP_cfg
| PROP_rtl
))
1572 get_dump_file_info (pass
->static_pass_number
)->flags
|= TDF_GRAPH
;
1573 dump_flags
|= TDF_GRAPH
;
1574 clean_graph_dump_file (dump_file_name
);
1577 /* Run post-pass cleanup and verification. */
1578 execute_todo (todo_after
| pass
->todo_flags_finish
);
1579 verify_interpass_invariants ();
1580 if (pass
->type
== IPA_PASS
)
1582 struct cgraph_node
*node
;
1583 for (node
= cgraph_nodes
; node
; node
= node
->next
)
1585 VEC_safe_push (ipa_opt_pass
, heap
, node
->ipa_transforms_to_apply
,
1586 (struct ipa_opt_pass_d
*)pass
);
1589 if (!current_function_decl
)
1590 cgraph_process_new_functions ();
1592 pass_fini_dump_file (pass
);
1594 if (pass
->type
!= SIMPLE_IPA_PASS
&& pass
->type
!= IPA_PASS
)
1595 gcc_assert (!(cfun
->curr_properties
& PROP_trees
)
1596 || pass
->type
!= RTL_PASS
);
1598 current_pass
= NULL
;
1604 execute_pass_list (struct opt_pass
*pass
)
1608 gcc_assert (pass
->type
== GIMPLE_PASS
1609 || pass
->type
== RTL_PASS
);
1610 if (execute_one_pass (pass
) && pass
->sub
)
1611 execute_pass_list (pass
->sub
);
1617 /* Same as execute_pass_list but assume that subpasses of IPA passes
1618 are local passes. If SET is not NULL, write out summaries of only
1619 those node in SET. */
1622 ipa_write_summaries_2 (struct opt_pass
*pass
, cgraph_node_set set
,
1623 varpool_node_set vset
,
1624 struct lto_out_decl_state
*state
)
1628 struct ipa_opt_pass_d
*ipa_pass
= (struct ipa_opt_pass_d
*)pass
;
1629 gcc_assert (!current_function_decl
);
1631 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
1632 if (pass
->type
== IPA_PASS
1633 && ipa_pass
->write_summary
1634 && (!pass
->gate
|| pass
->gate ()))
1636 /* If a timevar is present, start it. */
1638 timevar_push (pass
->tv_id
);
1640 pass_init_dump_file (pass
);
1642 ipa_pass
->write_summary (set
,vset
);
1644 pass_fini_dump_file (pass
);
1646 /* If a timevar is present, start it. */
1648 timevar_pop (pass
->tv_id
);
1651 if (pass
->sub
&& pass
->sub
->type
!= GIMPLE_PASS
)
1652 ipa_write_summaries_2 (pass
->sub
, set
, vset
, state
);
1658 /* Helper function of ipa_write_summaries. Creates and destroys the
1659 decl state and calls ipa_write_summaries_2 for all passes that have
1660 summaries. SET is the set of nodes to be written. */
1663 ipa_write_summaries_1 (cgraph_node_set set
, varpool_node_set vset
)
1665 struct lto_out_decl_state
*state
= lto_new_out_decl_state ();
1666 compute_ltrans_boundary (state
, set
, vset
);
1668 lto_push_out_decl_state (state
);
1670 gcc_assert (!flag_wpa
);
1671 ipa_write_summaries_2 (all_regular_ipa_passes
, set
, vset
, state
);
1672 ipa_write_summaries_2 (all_lto_gen_passes
, set
, vset
, state
);
1674 gcc_assert (lto_get_out_decl_state () == state
);
1675 lto_pop_out_decl_state ();
1676 lto_delete_out_decl_state (state
);
1679 /* Write out summaries for all the nodes in the callgraph. */
1682 ipa_write_summaries (void)
1684 cgraph_node_set set
;
1685 varpool_node_set vset
;
1686 struct cgraph_node
**order
;
1687 struct varpool_node
*vnode
;
1690 if (!flag_generate_lto
|| seen_error ())
1693 set
= cgraph_node_set_new ();
1695 /* Create the callgraph set in the same order used in
1696 cgraph_expand_all_functions. This mostly facilitates debugging,
1697 since it causes the gimple file to be processed in the same order
1698 as the source code. */
1699 order
= XCNEWVEC (struct cgraph_node
*, cgraph_n_nodes
);
1700 order_pos
= cgraph_postorder (order
);
1701 gcc_assert (order_pos
== cgraph_n_nodes
);
1703 for (i
= order_pos
- 1; i
>= 0; i
--)
1705 struct cgraph_node
*node
= order
[i
];
1709 /* When streaming out references to statements as part of some IPA
1710 pass summary, the statements need to have uids assigned and the
1711 following does that for all the IPA passes here. Naturally, this
1712 ordering then matches the one IPA-passes get in their stmt_fixup
1715 push_cfun (DECL_STRUCT_FUNCTION (node
->decl
));
1716 renumber_gimple_stmt_uids ();
1720 cgraph_node_set_add (set
, node
);
1722 vset
= varpool_node_set_new ();
1724 for (vnode
= varpool_nodes
; vnode
; vnode
= vnode
->next
)
1725 if (vnode
->needed
&& !vnode
->alias
)
1726 varpool_node_set_add (vset
, vnode
);
1728 ipa_write_summaries_1 (set
, vset
);
1735 /* Same as execute_pass_list but assume that subpasses of IPA passes
1736 are local passes. If SET is not NULL, write out optimization summaries of
1737 only those node in SET. */
1740 ipa_write_optimization_summaries_1 (struct opt_pass
*pass
, cgraph_node_set set
,
1741 varpool_node_set vset
,
1742 struct lto_out_decl_state
*state
)
1746 struct ipa_opt_pass_d
*ipa_pass
= (struct ipa_opt_pass_d
*)pass
;
1747 gcc_assert (!current_function_decl
);
1749 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
1750 if (pass
->type
== IPA_PASS
1751 && ipa_pass
->write_optimization_summary
1752 && (!pass
->gate
|| pass
->gate ()))
1754 /* If a timevar is present, start it. */
1756 timevar_push (pass
->tv_id
);
1758 pass_init_dump_file (pass
);
1760 ipa_pass
->write_optimization_summary (set
, vset
);
1762 pass_fini_dump_file (pass
);
1764 /* If a timevar is present, start it. */
1766 timevar_pop (pass
->tv_id
);
1769 if (pass
->sub
&& pass
->sub
->type
!= GIMPLE_PASS
)
1770 ipa_write_optimization_summaries_1 (pass
->sub
, set
, vset
, state
);
1776 /* Write all the optimization summaries for the cgraph nodes in SET. If SET is
1777 NULL, write out all summaries of all nodes. */
1780 ipa_write_optimization_summaries (cgraph_node_set set
, varpool_node_set vset
)
1782 struct lto_out_decl_state
*state
= lto_new_out_decl_state ();
1783 cgraph_node_set_iterator csi
;
1784 compute_ltrans_boundary (state
, set
, vset
);
1786 lto_push_out_decl_state (state
);
1787 for (csi
= csi_start (set
); !csi_end_p (csi
); csi_next (&csi
))
1789 struct cgraph_node
*node
= csi_node (csi
);
1790 /* When streaming out references to statements as part of some IPA
1791 pass summary, the statements need to have uids assigned.
1793 For functions newly born at WPA stage we need to initialize
1796 && gimple_has_body_p (node
->decl
))
1798 push_cfun (DECL_STRUCT_FUNCTION (node
->decl
));
1799 renumber_gimple_stmt_uids ();
1804 gcc_assert (flag_wpa
);
1805 ipa_write_optimization_summaries_1 (all_regular_ipa_passes
, set
, vset
, state
);
1806 ipa_write_optimization_summaries_1 (all_lto_gen_passes
, set
, vset
, state
);
1808 gcc_assert (lto_get_out_decl_state () == state
);
1809 lto_pop_out_decl_state ();
1810 lto_delete_out_decl_state (state
);
1813 /* Same as execute_pass_list but assume that subpasses of IPA passes
1814 are local passes. */
1817 ipa_read_summaries_1 (struct opt_pass
*pass
)
1821 struct ipa_opt_pass_d
*ipa_pass
= (struct ipa_opt_pass_d
*) pass
;
1823 gcc_assert (!current_function_decl
);
1825 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
1827 if (pass
->gate
== NULL
|| pass
->gate ())
1829 if (pass
->type
== IPA_PASS
&& ipa_pass
->read_summary
)
1831 /* If a timevar is present, start it. */
1833 timevar_push (pass
->tv_id
);
1835 pass_init_dump_file (pass
);
1837 ipa_pass
->read_summary ();
1839 pass_fini_dump_file (pass
);
1843 timevar_pop (pass
->tv_id
);
1846 if (pass
->sub
&& pass
->sub
->type
!= GIMPLE_PASS
)
1847 ipa_read_summaries_1 (pass
->sub
);
1854 /* Read all the summaries for all_regular_ipa_passes and all_lto_gen_passes. */
1857 ipa_read_summaries (void)
1859 ipa_read_summaries_1 (all_regular_ipa_passes
);
1860 ipa_read_summaries_1 (all_lto_gen_passes
);
1863 /* Same as execute_pass_list but assume that subpasses of IPA passes
1864 are local passes. */
1867 ipa_read_optimization_summaries_1 (struct opt_pass
*pass
)
1871 struct ipa_opt_pass_d
*ipa_pass
= (struct ipa_opt_pass_d
*) pass
;
1873 gcc_assert (!current_function_decl
);
1875 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
1877 if (pass
->gate
== NULL
|| pass
->gate ())
1879 if (pass
->type
== IPA_PASS
&& ipa_pass
->read_optimization_summary
)
1881 /* If a timevar is present, start it. */
1883 timevar_push (pass
->tv_id
);
1885 pass_init_dump_file (pass
);
1887 ipa_pass
->read_optimization_summary ();
1889 pass_fini_dump_file (pass
);
1893 timevar_pop (pass
->tv_id
);
1896 if (pass
->sub
&& pass
->sub
->type
!= GIMPLE_PASS
)
1897 ipa_read_optimization_summaries_1 (pass
->sub
);
1903 /* Read all the summaries for all_regular_ipa_passes and all_lto_gen_passes. */
1906 ipa_read_optimization_summaries (void)
1908 ipa_read_optimization_summaries_1 (all_regular_ipa_passes
);
1909 ipa_read_optimization_summaries_1 (all_lto_gen_passes
);
1912 /* Same as execute_pass_list but assume that subpasses of IPA passes
1913 are local passes. */
1915 execute_ipa_pass_list (struct opt_pass
*pass
)
1919 gcc_assert (!current_function_decl
);
1921 gcc_assert (pass
->type
== SIMPLE_IPA_PASS
|| pass
->type
== IPA_PASS
);
1922 if (execute_one_pass (pass
) && pass
->sub
)
1924 if (pass
->sub
->type
== GIMPLE_PASS
)
1926 invoke_plugin_callbacks (PLUGIN_EARLY_GIMPLE_PASSES_START
, NULL
);
1927 do_per_function_toporder ((void (*)(void *))execute_pass_list
,
1929 invoke_plugin_callbacks (PLUGIN_EARLY_GIMPLE_PASSES_END
, NULL
);
1931 else if (pass
->sub
->type
== SIMPLE_IPA_PASS
1932 || pass
->sub
->type
== IPA_PASS
)
1933 execute_ipa_pass_list (pass
->sub
);
1937 gcc_assert (!current_function_decl
);
1938 cgraph_process_new_functions ();
1944 /* Execute stmt fixup hooks of all passes in PASS for NODE and STMTS. */
1947 execute_ipa_stmt_fixups (struct opt_pass
*pass
,
1948 struct cgraph_node
*node
, gimple
*stmts
)
1952 /* Execute all of the IPA_PASSes in the list. */
1953 if (pass
->type
== IPA_PASS
1954 && (!pass
->gate
|| pass
->gate ()))
1956 struct ipa_opt_pass_d
*ipa_pass
= (struct ipa_opt_pass_d
*) pass
;
1958 if (ipa_pass
->stmt_fixup
)
1960 pass_init_dump_file (pass
);
1961 /* If a timevar is present, start it. */
1963 timevar_push (pass
->tv_id
);
1965 ipa_pass
->stmt_fixup (node
, stmts
);
1969 timevar_pop (pass
->tv_id
);
1970 pass_fini_dump_file (pass
);
1973 execute_ipa_stmt_fixups (pass
->sub
, node
, stmts
);
1979 /* Execute stmt fixup hooks of all IPA passes for NODE and STMTS. */
1982 execute_all_ipa_stmt_fixups (struct cgraph_node
*node
, gimple
*stmts
)
1984 execute_ipa_stmt_fixups (all_regular_ipa_passes
, node
, stmts
);
1988 extern void debug_properties (unsigned int);
1989 extern void dump_properties (FILE *, unsigned int);
1992 dump_properties (FILE *dump
, unsigned int props
)
1994 fprintf (dump
, "Properties:\n");
1995 if (props
& PROP_gimple_any
)
1996 fprintf (dump
, "PROP_gimple_any\n");
1997 if (props
& PROP_gimple_lcf
)
1998 fprintf (dump
, "PROP_gimple_lcf\n");
1999 if (props
& PROP_gimple_leh
)
2000 fprintf (dump
, "PROP_gimple_leh\n");
2001 if (props
& PROP_cfg
)
2002 fprintf (dump
, "PROP_cfg\n");
2003 if (props
& PROP_referenced_vars
)
2004 fprintf (dump
, "PROP_referenced_vars\n");
2005 if (props
& PROP_ssa
)
2006 fprintf (dump
, "PROP_ssa\n");
2007 if (props
& PROP_no_crit_edges
)
2008 fprintf (dump
, "PROP_no_crit_edges\n");
2009 if (props
& PROP_rtl
)
2010 fprintf (dump
, "PROP_rtl\n");
2011 if (props
& PROP_gimple_lomp
)
2012 fprintf (dump
, "PROP_gimple_lomp\n");
2013 if (props
& PROP_gimple_lcx
)
2014 fprintf (dump
, "PROP_gimple_lcx\n");
2015 if (props
& PROP_cfglayout
)
2016 fprintf (dump
, "PROP_cfglayout\n");
2020 debug_properties (unsigned int props
)
2022 dump_properties (stderr
, props
);
2025 /* Called by local passes to see if function is called by already processed nodes.
2026 Because we process nodes in topological order, this means that function is
2027 in recursive cycle or we introduced new direct calls. */
2029 function_called_by_processed_nodes_p (void)
2031 struct cgraph_edge
*e
;
2032 for (e
= cgraph_node (current_function_decl
)->callers
; e
; e
= e
->next_caller
)
2034 if (e
->caller
->decl
== current_function_decl
)
2036 if (!e
->caller
->analyzed
)
2038 if (TREE_ASM_WRITTEN (e
->caller
->decl
))
2040 if (!e
->caller
->process
&& !e
->caller
->global
.inlined_to
)
2045 fprintf (dump_file
, "Already processed call to:\n");
2046 dump_cgraph_node (dump_file
, e
->caller
);
2051 #include "gt-passes.h"