1 /* Top-level control of tree optimizations.
2 Copyright 2001, 2002, 2003, 2004, 2005, 2007 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 3, 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 COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
23 #include "coretypes.h"
28 #include "hard-reg-set.h"
29 #include "basic-block.h"
32 #include "diagnostic.h"
33 #include "basic-block.h"
35 #include "tree-flow.h"
36 #include "tree-dump.h"
39 #include "langhooks.h"
43 #include "tree-inline.h"
44 #include "tree-mudflap.h"
45 #include "tree-pass.h"
53 /* Gate: execute, or not, all of the non-trivial optimizations. */
56 gate_all_optimizations (void)
59 /* Don't bother doing anything if the program has errors.
60 We have to pass down the queue if we already went into SSA */
61 && (!(errorcount || sorrycount) || gimple_in_ssa_p (cfun)));
64 struct gimple_opt_pass pass_all_optimizations =
69 gate_all_optimizations, /* gate */
73 0, /* static_pass_number */
75 0, /* properties_required */
76 0, /* properties_provided */
77 0, /* properties_destroyed */
78 0, /* todo_flags_start */
79 0 /* todo_flags_finish */
83 /* Gate: execute, or not, all of the non-trivial optimizations. */
86 gate_all_early_local_passes (void)
88 /* Don't bother doing anything if the program has errors. */
89 return (!errorcount && !sorrycount);
92 struct simple_ipa_opt_pass pass_early_local_passes =
96 "early_local_cleanups", /* name */
97 gate_all_early_local_passes, /* gate */
101 0, /* static_pass_number */
103 0, /* properties_required */
104 0, /* properties_provided */
105 0, /* properties_destroyed */
106 0, /* todo_flags_start */
107 TODO_remove_functions /* todo_flags_finish */
112 execute_early_local_optimizations (void)
114 /* First time we start with early optimization we need to advance
115 cgraph state so newly inserted functions are also early optimized.
116 However we execute early local optimizations for lately inserted
117 functions, in that case don't reset cgraph state back to IPA_SSA. */
118 if (cgraph_state < CGRAPH_STATE_IPA_SSA)
119 cgraph_state = CGRAPH_STATE_IPA_SSA;
123 /* Gate: execute, or not, all of the non-trivial optimizations. */
126 gate_all_early_optimizations (void)
128 return (optimize >= 1
129 /* Don't bother doing anything if the program has errors. */
130 && !(errorcount || sorrycount));
133 struct gimple_opt_pass pass_all_early_optimizations =
137 "early_optimizations", /* name */
138 gate_all_early_optimizations, /* gate */
139 execute_early_local_optimizations, /* execute */
142 0, /* static_pass_number */
144 0, /* properties_required */
145 0, /* properties_provided */
146 0, /* properties_destroyed */
147 0, /* todo_flags_start */
148 0 /* todo_flags_finish */
152 /* Pass: cleanup the CFG just before expanding trees to RTL.
153 This is just a round of label cleanups and case node grouping
154 because after the tree optimizers have run such cleanups may
158 execute_cleanup_cfg_pre_ipa (void)
164 struct gimple_opt_pass pass_cleanup_cfg =
168 "cleanup_cfg", /* name */
170 execute_cleanup_cfg_pre_ipa, /* execute */
173 0, /* static_pass_number */
175 PROP_cfg, /* properties_required */
176 0, /* properties_provided */
177 0, /* properties_destroyed */
178 0, /* todo_flags_start */
179 TODO_dump_func /* todo_flags_finish */
184 /* Pass: cleanup the CFG just before expanding trees to RTL.
185 This is just a round of label cleanups and case node grouping
186 because after the tree optimizers have run such cleanups may
190 execute_cleanup_cfg_post_optimizing (void)
192 fold_cond_expr_cond ();
194 cleanup_dead_labels ();
195 group_case_labels ();
199 struct gimple_opt_pass pass_cleanup_cfg_post_optimizing =
203 "final_cleanup", /* name */
205 execute_cleanup_cfg_post_optimizing, /* execute */
208 0, /* static_pass_number */
210 PROP_cfg, /* properties_required */
211 0, /* properties_provided */
212 0, /* properties_destroyed */
213 0, /* todo_flags_start */
214 TODO_dump_func /* todo_flags_finish */
218 /* Pass: do the actions required to finish with tree-ssa optimization
222 execute_free_datastructures (void)
224 free_dominance_info (CDI_DOMINATORS);
225 free_dominance_info (CDI_POST_DOMINATORS);
227 /* Remove the ssa structures. */
233 struct gimple_opt_pass pass_free_datastructures =
239 execute_free_datastructures, /* execute */
242 0, /* static_pass_number */
244 PROP_cfg, /* properties_required */
245 0, /* properties_provided */
246 0, /* properties_destroyed */
247 0, /* todo_flags_start */
248 0 /* todo_flags_finish */
251 /* Pass: free cfg annotations. */
254 execute_free_cfg_annotations (void)
256 /* And get rid of annotations we no longer need. */
257 delete_tree_cfg_annotations ();
262 struct gimple_opt_pass pass_free_cfg_annotations =
268 execute_free_cfg_annotations, /* execute */
271 0, /* static_pass_number */
273 PROP_cfg, /* properties_required */
274 0, /* properties_provided */
275 0, /* properties_destroyed */
276 0, /* todo_flags_start */
277 0 /* todo_flags_finish */
281 /* Pass: fixup_cfg. IPA passes, compilation of earlier functions or inlining
282 might have changed some properties, such as marked functions nothrow.
283 Remove redundant edges and basic blocks, and create new ones if necessary.
285 This pass can't be executed as stand alone pass from pass manager, because
286 in between inlining and this fixup the verify_flow_info would fail. */
289 execute_fixup_cfg (void)
292 block_stmt_iterator bsi;
293 int todo = gimple_in_ssa_p (cfun) ? TODO_verify_ssa : 0;
295 cfun->after_inlining = true;
300 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
302 tree stmt = bsi_stmt (bsi);
303 tree call = get_call_expr_in (stmt);
304 tree decl = call ? get_callee_fndecl (call) : NULL;
306 if (decl && call_expr_flags (call) & (ECF_CONST | ECF_PURE
307 | ECF_LOOPING_CONST_OR_PURE)
308 && TREE_SIDE_EFFECTS (call))
310 if (gimple_in_ssa_p (cfun))
312 todo |= TODO_update_ssa | TODO_cleanup_cfg;
315 TREE_SIDE_EFFECTS (call) = 0;
317 if (decl && TREE_NOTHROW (decl))
318 TREE_NOTHROW (call) = 1;
319 if (!tree_could_throw_p (stmt) && lookup_stmt_eh_region (stmt))
320 remove_stmt_from_eh_region (stmt);
322 if (tree_purge_dead_eh_edges (bb))
323 todo |= TODO_cleanup_cfg;
326 /* Dump a textual representation of the flowgraph. */
328 dump_tree_cfg (dump_file, dump_flags);
333 /* Do the actions required to initialize internal data structures used
334 in tree-ssa optimization passes. */
337 execute_init_datastructures (void)
339 /* Allocate hash tables, arrays and other structures. */
340 init_tree_ssa (cfun);
344 struct gimple_opt_pass pass_init_datastructures =
350 execute_init_datastructures, /* execute */
353 0, /* static_pass_number */
355 PROP_cfg, /* properties_required */
356 0, /* properties_provided */
357 0, /* properties_destroyed */
358 0, /* todo_flags_start */
359 0 /* todo_flags_finish */
364 tree_lowering_passes (tree fn)
366 tree saved_current_function_decl = current_function_decl;
368 current_function_decl = fn;
369 push_cfun (DECL_STRUCT_FUNCTION (fn));
370 tree_register_cfg_hooks ();
371 bitmap_obstack_initialize (NULL);
372 execute_pass_list (all_lowering_passes);
373 if (optimize && cgraph_global_info_ready)
374 execute_pass_list (pass_early_local_passes.pass.sub);
375 free_dominance_info (CDI_POST_DOMINATORS);
376 free_dominance_info (CDI_DOMINATORS);
378 current_function_decl = saved_current_function_decl;
379 bitmap_obstack_release (NULL);
383 /* For functions-as-trees languages, this performs all optimization and
384 compilation for FNDECL. */
387 tree_rest_of_compilation (tree fndecl)
389 location_t saved_loc;
390 struct cgraph_node *node;
392 timevar_push (TV_EXPAND);
394 gcc_assert (cgraph_global_info_ready);
396 node = cgraph_node (fndecl);
398 /* Initialize the default bitmap obstack. */
399 bitmap_obstack_initialize (NULL);
401 /* Initialize the RTL code for the function. */
402 current_function_decl = fndecl;
403 saved_loc = input_location;
404 input_location = DECL_SOURCE_LOCATION (fndecl);
405 init_function_start (fndecl);
407 /* Even though we're inside a function body, we still don't want to
408 call expand_expr to calculate the size of a variable-sized array.
409 We haven't necessarily assigned RTL to all variables yet, so it's
410 not safe to try to expand expressions involving them. */
411 cfun->dont_save_pending_sizes_p = 1;
413 tree_register_cfg_hooks ();
415 bitmap_obstack_initialize (®_obstack); /* FIXME, only at RTL generation*/
416 /* Perform all tree transforms and optimizations. */
417 execute_pass_list (all_passes);
419 bitmap_obstack_release (®_obstack);
421 /* Release the default bitmap obstack. */
422 bitmap_obstack_release (NULL);
424 DECL_SAVED_TREE (fndecl) = NULL;
427 /* If requested, warn about function definitions where the function will
428 return a value (usually of some struct or union type) which itself will
429 take up a lot of stack space. */
430 if (warn_larger_than && !DECL_EXTERNAL (fndecl) && TREE_TYPE (fndecl))
432 tree ret_type = TREE_TYPE (TREE_TYPE (fndecl));
434 if (ret_type && TYPE_SIZE_UNIT (ret_type)
435 && TREE_CODE (TYPE_SIZE_UNIT (ret_type)) == INTEGER_CST
436 && 0 < compare_tree_int (TYPE_SIZE_UNIT (ret_type),
439 unsigned int size_as_int
440 = TREE_INT_CST_LOW (TYPE_SIZE_UNIT (ret_type));
442 if (compare_tree_int (TYPE_SIZE_UNIT (ret_type), size_as_int) == 0)
443 warning (OPT_Wlarger_than_eq, "size of return value of %q+D is %u bytes",
444 fndecl, size_as_int);
446 warning (OPT_Wlarger_than_eq, "size of return value of %q+D is larger than %wd bytes",
447 fndecl, larger_than_size);
451 DECL_SAVED_TREE (fndecl) = NULL;
452 if (DECL_STRUCT_FUNCTION (fndecl) == 0
453 && !cgraph_node (fndecl)->origin)
455 /* Stop pointing to the local nodes about to be freed.
456 But DECL_INITIAL must remain nonzero so we know this
457 was an actual function definition.
458 For a nested function, this is done in c_pop_function_context.
459 If rest_of_compilation set this to 0, leave it 0. */
460 if (DECL_INITIAL (fndecl) != 0)
461 DECL_INITIAL (fndecl) = error_mark_node;
464 input_location = saved_loc;
467 timevar_pop (TV_EXPAND);