1 /* Top-level control of tree optimizations.
2 Copyright 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
3 Contributed by Diego Novillo <dnovillo@redhat.com>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
24 #include "coretypes.h"
29 #include "hard-reg-set.h"
30 #include "basic-block.h"
33 #include "diagnostic.h"
34 #include "basic-block.h"
36 #include "tree-flow.h"
37 #include "tree-dump.h"
40 #include "langhooks.h"
44 #include "tree-inline.h"
45 #include "tree-mudflap.h"
46 #include "tree-pass.h"
47 #include "tree-alias-common.h"
52 /* Global variables used to communicate with passes. */
54 bitmap vars_to_rename
;
57 /* The root of the compilation pass tree, once constructed. */
58 static struct tree_opt_pass
*all_passes
;
60 /* Pass: gimplify the function if it's not been done. */
65 /* We have this test here rather than as the gate because we always
66 want to dump the original gimplified function. */
67 if (!lang_hooks
.gimple_before_inlining
)
68 gimplify_function_tree (current_function_decl
);
71 static struct tree_opt_pass pass_gimple
=
75 execute_gimple
, /* execute */
78 0, /* static_pass_number */
80 0, /* properties_required */
81 PROP_gimple_any
, /* properties_provided */
82 0, /* properties_destroyed */
83 0, /* todo_flags_start */
84 TODO_dump_func
/* todo_flags_finish */
87 /* Gate: execute, or not, all of the non-trivial optimizations. */
90 gate_all_optimizations (void)
93 /* Don't bother doing anything if the program has errors. */
94 && !(errorcount
|| sorrycount
));
97 static struct tree_opt_pass pass_all_optimizations
=
100 gate_all_optimizations
, /* gate */
104 0, /* static_pass_number */
106 0, /* properties_required */
107 0, /* properties_provided */
108 0, /* properties_destroyed */
109 0, /* todo_flags_start */
110 0 /* todo_flags_finish */
113 /* Pass: do the actions required to finish with tree-ssa optimization
117 execute_free_datastructures (void)
121 /* ??? This isn't the right place for this. Worse, it got computed
122 more or less at random in various passes. */
123 free_dominance_info (CDI_DOMINATORS
);
125 /* Emit gotos for implicit jumps. */
126 disband_implicit_edges ();
128 /* Remove the ssa structures. Do it here since this includes statement
129 annotations that need to be intact during disband_implicit_edges. */
132 /* Re-chain the statements from the blocks. */
133 chain
= &DECL_SAVED_TREE (current_function_decl
);
134 *chain
= alloc_stmt_list ();
136 /* And get rid of annotations we no longer need. */
137 delete_tree_cfg_annotations ();
140 static struct tree_opt_pass pass_free_datastructures
=
144 execute_free_datastructures
, /* execute */
147 0, /* static_pass_number */
149 PROP_cfg
, /* properties_required */
150 0, /* properties_provided */
151 0, /* properties_destroyed */
152 0, /* todo_flags_start */
153 0 /* todo_flags_finish */
156 /* Iterate over the pass tree allocating dump file numbers. We want
157 to do this depth first, and independent of whether the pass is
161 register_one_dump_file (struct tree_opt_pass
*pass
)
163 char *dot_name
, *flag_name
;
169 /* See below in dup_pass_1. */
171 if (pass
->static_pass_number
)
172 sprintf (num
, "%d", ((int) pass
->static_pass_number
< 0
173 ? 1 : pass
->static_pass_number
));
175 dot_name
= concat (".", pass
->name
, num
, NULL
);
176 flag_name
= concat ("tree-", pass
->name
, num
, NULL
);
178 pass
->static_pass_number
= dump_register (dot_name
, flag_name
);
182 register_dump_files (struct tree_opt_pass
*pass
, int properties
)
186 /* Verify that all required properties are present. */
187 if (pass
->properties_required
& ~properties
)
190 if (pass
->properties_destroyed
& pass
->properties_provided
)
193 pass
->properties_required
= properties
;
194 pass
->properties_provided
= properties
=
195 (properties
| pass
->properties_provided
) & ~pass
->properties_destroyed
;
197 if (properties
& PROP_trees
)
198 register_one_dump_file (pass
);
200 properties
= register_dump_files (pass
->sub
, properties
);
208 /* Duplicate a pass that's to be run more than once. */
210 static struct tree_opt_pass
*
211 dup_pass_1 (struct tree_opt_pass
*pass
)
213 struct tree_opt_pass
*new;
215 new = xmalloc (sizeof (*new));
216 memcpy (new, pass
, sizeof (*new));
218 /* Indicate to register_dump_files that this pass has duplicates,
219 and so it should rename the dump file. The first instance will
220 be < 0, and be number of duplicates = -static_pass_number + 1.
221 Subsequent instances will be > 0 and just the duplicate number. */
224 int n
, p
= pass
->static_pass_number
;
231 pass
->static_pass_number
= p
;
232 new->static_pass_number
= n
;
238 /* Construct the pass tree. */
241 init_tree_optimization_passes (void)
243 struct tree_opt_pass
**p
;
245 #define NEXT_PASS(PASS) (*p = &PASS, p = &(*p)->next)
246 #define DUP_PASS(PASS) (*dup_pass_1 (&PASS))
249 NEXT_PASS (pass_gimple
);
250 NEXT_PASS (pass_remove_useless_stmts
);
251 NEXT_PASS (pass_mudflap_1
);
252 NEXT_PASS (pass_lower_cf
);
253 NEXT_PASS (pass_lower_eh
);
254 NEXT_PASS (pass_build_cfg
);
255 NEXT_PASS (pass_tree_profile
);
256 NEXT_PASS (pass_all_optimizations
);
257 NEXT_PASS (pass_mudflap_2
);
258 NEXT_PASS (pass_free_datastructures
);
259 NEXT_PASS (pass_expand
);
260 NEXT_PASS (pass_rest_of_compilation
);
263 p
= &pass_all_optimizations
.sub
;
264 NEXT_PASS (pass_referenced_vars
);
265 NEXT_PASS (pass_build_pta
);
266 NEXT_PASS (pass_build_ssa
);
267 NEXT_PASS (pass_rename_ssa_copies
);
268 NEXT_PASS (pass_early_warn_uninitialized
);
269 NEXT_PASS (pass_dce
);
270 NEXT_PASS (pass_dominator
);
271 NEXT_PASS (pass_redundant_phi
);
272 NEXT_PASS (DUP_PASS (pass_dce
));
273 NEXT_PASS (pass_forwprop
);
274 NEXT_PASS (pass_phiopt
);
275 NEXT_PASS (pass_may_alias
);
276 NEXT_PASS (pass_tail_recursion
);
278 NEXT_PASS (pass_del_pta
);
279 NEXT_PASS (pass_profile
);
280 NEXT_PASS (pass_lower_complex
);
281 NEXT_PASS (pass_sra
);
282 NEXT_PASS (DUP_PASS (pass_rename_ssa_copies
));
283 NEXT_PASS (DUP_PASS (pass_dominator
));
284 NEXT_PASS (DUP_PASS (pass_redundant_phi
));
285 NEXT_PASS (DUP_PASS (pass_dce
));
286 NEXT_PASS (pass_dse
);
287 NEXT_PASS (DUP_PASS (pass_forwprop
));
288 NEXT_PASS (DUP_PASS (pass_phiopt
));
289 NEXT_PASS (pass_ccp
);
290 NEXT_PASS (DUP_PASS (pass_redundant_phi
));
291 NEXT_PASS (pass_fold_builtins
);
292 NEXT_PASS (pass_split_crit_edges
);
293 NEXT_PASS (pass_pre
);
294 NEXT_PASS (DUP_PASS (pass_dominator
));
295 NEXT_PASS (DUP_PASS (pass_redundant_phi
));
296 NEXT_PASS (pass_cd_dce
);
297 NEXT_PASS (DUP_PASS (pass_dse
));
298 NEXT_PASS (DUP_PASS (pass_forwprop
));
299 NEXT_PASS (DUP_PASS (pass_phiopt
));
300 NEXT_PASS (pass_tail_calls
);
301 NEXT_PASS (pass_late_warn_uninitialized
);
302 NEXT_PASS (pass_warn_function_return
);
303 NEXT_PASS (pass_del_ssa
);
304 NEXT_PASS (pass_nrv
);
305 NEXT_PASS (pass_remove_useless_vars
);
311 /* Register the passes with the tree dump code. */
312 register_dump_files (all_passes
, 0);
315 static void execute_pass_list (struct tree_opt_pass
*);
317 static unsigned int last_verified
;
320 execute_todo (unsigned int flags
)
322 if (flags
& TODO_rename_vars
)
324 if (bitmap_first_set_bit (vars_to_rename
) >= 0)
326 BITMAP_XFREE (vars_to_rename
);
329 if ((flags
& TODO_dump_func
) && dump_file
)
330 dump_function_to_file (current_function_decl
,
331 dump_file
, dump_flags
);
333 if (flags
& TODO_ggc_collect
)
336 #ifdef ENABLE_CHECKING
337 if (flags
& TODO_verify_ssa
)
339 if (flags
& TODO_verify_flow
)
341 if (flags
& TODO_verify_stmts
)
347 execute_one_pass (struct tree_opt_pass
*pass
)
351 /* See if we're supposed to run this pass. */
352 if (pass
->gate
&& !pass
->gate ())
355 /* Note that the folders should only create gimple expressions.
356 This is a hack until the new folder is ready. */
357 in_gimple_form
= (pass
->properties_provided
& PROP_trees
) != 0;
359 /* Run pre-pass verification. */
360 todo
= pass
->todo_flags_start
& ~last_verified
;
364 /* If a dump file name is present, open it if enabled. */
365 if (pass
->static_pass_number
)
367 dump_file
= dump_begin (pass
->static_pass_number
, &dump_flags
);
370 const char *dname
, *aname
;
371 dname
= lang_hooks
.decl_printable_name (current_function_decl
, 2);
372 aname
= (IDENTIFIER_POINTER
373 (DECL_ASSEMBLER_NAME (current_function_decl
)));
374 fprintf (dump_file
, "\n;; Function %s (%s)\n\n", dname
, aname
);
378 /* If a timevar is present, start it. */
380 timevar_push (pass
->tv_id
);
382 /* If the pass is requesting ssa variable renaming, allocate the bitmap. */
383 if (pass
->todo_flags_finish
& TODO_rename_vars
)
384 vars_to_rename
= BITMAP_XMALLOC ();
390 /* Run post-pass cleanup and verification. */
391 todo
= pass
->todo_flags_finish
;
392 last_verified
= todo
& TODO_verify_all
;
396 /* Close down timevar and dump file. */
398 timevar_pop (pass
->tv_id
);
401 dump_end (pass
->static_pass_number
, dump_file
);
409 execute_pass_list (struct tree_opt_pass
*pass
)
413 if (execute_one_pass (pass
) && pass
->sub
)
414 execute_pass_list (pass
->sub
);
421 /* For functions-as-trees languages, this performs all optimization and
422 compilation for FNDECL. */
425 tree_rest_of_compilation (tree fndecl
, bool nested_p
)
427 location_t saved_loc
;
428 struct cgraph_node
*saved_node
= NULL
, *node
;
430 timevar_push (TV_EXPAND
);
432 if (flag_unit_at_a_time
&& !cgraph_global_info_ready
)
435 /* Initialize the RTL code for the function. */
436 current_function_decl
= fndecl
;
437 saved_loc
= input_location
;
438 input_location
= DECL_SOURCE_LOCATION (fndecl
);
439 init_function_start (fndecl
);
441 /* This function is being processed in whole-function mode. */
442 cfun
->x_whole_function_mode_p
= 1;
444 /* Even though we're inside a function body, we still don't want to
445 call expand_expr to calculate the size of a variable-sized array.
446 We haven't necessarily assigned RTL to all variables yet, so it's
447 not safe to try to expand expressions involving them. */
448 immediate_size_expand
= 0;
449 cfun
->x_dont_save_pending_sizes_p
= 1;
451 node
= cgraph_node (fndecl
);
453 /* We might need the body of this function so that we can expand
454 it inline somewhere else. This means not lowering some constructs
455 such as exception handling. */
456 if (cgraph_preserve_function_body_p (fndecl
))
458 if (!flag_unit_at_a_time
)
460 struct cgraph_edge
*e
;
462 saved_node
= cgraph_clone_node (node
);
463 for (e
= saved_node
->callees
; e
; e
= e
->next_callee
)
464 if (!e
->inline_failed
)
465 cgraph_clone_inlined_nodes (e
, true);
467 cfun
->saved_tree
= save_body (fndecl
, &cfun
->saved_args
);
470 if (flag_inline_trees
)
472 struct cgraph_edge
*e
;
473 for (e
= node
->callees
; e
; e
= e
->next_callee
)
474 if (!e
->inline_failed
|| warn_inline
)
478 timevar_push (TV_INTEGRATION
);
479 optimize_inline_calls (fndecl
);
480 timevar_pop (TV_INTEGRATION
);
484 /* If this is a nested function, protect the local variables in the stack
485 above us from being collected while we're compiling this function. */
489 /* Perform all tree transforms and optimizations. */
490 execute_pass_list (all_passes
);
492 /* Restore original body if still needed. */
493 if (cfun
->saved_tree
)
495 DECL_SAVED_TREE (fndecl
) = cfun
->saved_tree
;
496 DECL_ARGUMENTS (fndecl
) = cfun
->saved_args
;
498 /* When not in unit-at-a-time mode, we must preserve out of line copy
499 representing node before inlining. Restore original outgoing edges
500 using clone we created earlier. */
501 if (!flag_unit_at_a_time
)
503 struct cgraph_edge
*e
;
504 while (node
->callees
)
505 cgraph_remove_edge (node
->callees
);
506 node
->callees
= saved_node
->callees
;
507 saved_node
->callees
= NULL
;
508 for (e
= saved_node
->callees
; e
; e
= e
->next_callee
)
510 cgraph_remove_node (saved_node
);
514 DECL_SAVED_TREE (fndecl
) = NULL
;
517 /* If requested, warn about function definitions where the function will
518 return a value (usually of some struct or union type) which itself will
519 take up a lot of stack space. */
520 if (warn_larger_than
&& !DECL_EXTERNAL (fndecl
) && TREE_TYPE (fndecl
))
522 tree ret_type
= TREE_TYPE (TREE_TYPE (fndecl
));
524 if (ret_type
&& TYPE_SIZE_UNIT (ret_type
)
525 && TREE_CODE (TYPE_SIZE_UNIT (ret_type
)) == INTEGER_CST
526 && 0 < compare_tree_int (TYPE_SIZE_UNIT (ret_type
),
529 unsigned int size_as_int
530 = TREE_INT_CST_LOW (TYPE_SIZE_UNIT (ret_type
));
532 if (compare_tree_int (TYPE_SIZE_UNIT (ret_type
), size_as_int
) == 0)
533 warning ("%Jsize of return value of '%D' is %u bytes",
534 fndecl
, fndecl
, size_as_int
);
536 warning ("%Jsize of return value of '%D' is larger than %wd bytes",
537 fndecl
, fndecl
, larger_than_size
);
541 if (!nested_p
&& !flag_inline_trees
)
543 DECL_SAVED_TREE (fndecl
) = NULL
;
544 if (DECL_STRUCT_FUNCTION (fndecl
) == 0
545 && !cgraph_node (fndecl
)->origin
)
547 /* Stop pointing to the local nodes about to be freed.
548 But DECL_INITIAL must remain nonzero so we know this
549 was an actual function definition.
550 For a nested function, this is done in c_pop_function_context.
551 If rest_of_compilation set this to 0, leave it 0. */
552 if (DECL_INITIAL (fndecl
) != 0)
553 DECL_INITIAL (fndecl
) = error_mark_node
;
557 input_location
= saved_loc
;
561 /* Undo the GC context switch. */
564 timevar_pop (TV_EXPAND
);