]>
Commit | Line | Data |
---|---|---|
a49a878f | 1 | /* Top level of GCC compilers (cc1, cc1plus, etc.) |
2 | Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, | |
f0b5f617 | 3 | 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 |
1a6a0f2a | 4 | Free Software Foundation, Inc. |
a49a878f | 5 | |
6 | This file is part of GCC. | |
7 | ||
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 | |
8c4c00c1 | 10 | Software Foundation; either version 3, or (at your option) any later |
a49a878f | 11 | version. |
12 | ||
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 | |
16 | for more details. | |
17 | ||
18 | You should have received a copy of the GNU General Public License | |
8c4c00c1 | 19 | along with GCC; see the file COPYING3. If not see |
20 | <http://www.gnu.org/licenses/>. */ | |
a49a878f | 21 | |
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. */ | |
26 | ||
27 | #include "config.h" | |
28 | #undef FLOAT /* This is for hpux. They should change hpux. */ | |
29 | #undef FFS /* Some systems define this in param.h. */ | |
30 | #include "system.h" | |
31 | #include "coretypes.h" | |
32 | #include "tm.h" | |
33 | #include <signal.h> | |
34 | ||
35 | #ifdef HAVE_SYS_RESOURCE_H | |
36 | # include <sys/resource.h> | |
37 | #endif | |
38 | ||
39 | #ifdef HAVE_SYS_TIMES_H | |
40 | # include <sys/times.h> | |
41 | #endif | |
42 | ||
43 | #include "line-map.h" | |
44 | #include "input.h" | |
45 | #include "tree.h" | |
46 | #include "rtl.h" | |
47 | #include "tm_p.h" | |
48 | #include "flags.h" | |
49 | #include "insn-attr.h" | |
50 | #include "insn-config.h" | |
51 | #include "insn-flags.h" | |
52 | #include "hard-reg-set.h" | |
53 | #include "recog.h" | |
54 | #include "output.h" | |
55 | #include "except.h" | |
56 | #include "function.h" | |
57 | #include "toplev.h" | |
58 | #include "expr.h" | |
59 | #include "basic-block.h" | |
60 | #include "intl.h" | |
61 | #include "ggc.h" | |
62 | #include "graph.h" | |
a49a878f | 63 | #include "regs.h" |
64 | #include "timevar.h" | |
65 | #include "diagnostic.h" | |
66 | #include "params.h" | |
67 | #include "reload.h" | |
68 | #include "dwarf2asm.h" | |
69 | #include "integrate.h" | |
70 | #include "real.h" | |
71 | #include "debug.h" | |
72 | #include "target.h" | |
73 | #include "langhooks.h" | |
74 | #include "cfglayout.h" | |
75 | #include "cfgloop.h" | |
76 | #include "hosthooks.h" | |
77 | #include "cgraph.h" | |
78 | #include "opts.h" | |
79 | #include "coverage.h" | |
80 | #include "value-prof.h" | |
77fce4cd | 81 | #include "tree-inline.h" |
82 | #include "tree-flow.h" | |
5290ebdb | 83 | #include "tree-pass.h" |
0f9005dd | 84 | #include "tree-dump.h" |
3072d30e | 85 | #include "df.h" |
4ae20857 | 86 | #include "predict.h" |
a49a878f | 87 | |
88 | #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO) | |
89 | #include "dwarf2out.h" | |
90 | #endif | |
91 | ||
da2f1613 | 92 | #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO) |
a49a878f | 93 | #include "dbxout.h" |
94 | #endif | |
95 | ||
96 | #ifdef SDB_DEBUGGING_INFO | |
97 | #include "sdbout.h" | |
98 | #endif | |
99 | ||
100 | #ifdef XCOFF_DEBUGGING_INFO | |
101 | #include "xcoffout.h" /* Needed for external data | |
102 | declarations for e.g. AIX 4.x. */ | |
103 | #endif | |
104 | ||
3072d30e | 105 | /* This is used for debugging. It allows the current pass to printed |
106 | from anywhere in compilation. */ | |
20099e35 | 107 | struct opt_pass *current_pass; |
3072d30e | 108 | |
109 | /* Call from anywhere to find out what pass this is. Useful for | |
110 | printing out debugging information deep inside an service | |
111 | routine. */ | |
112 | void | |
113 | print_current_pass (FILE *file) | |
114 | { | |
115 | if (current_pass) | |
116 | fprintf (file, "current pass = %s (%d)\n", | |
117 | current_pass->name, current_pass->static_pass_number); | |
118 | else | |
119 | fprintf (file, "no current pass.\n"); | |
120 | } | |
121 | ||
122 | ||
123 | /* Call from the debugger to get the current pass name. */ | |
124 | void | |
125 | debug_pass (void) | |
126 | { | |
127 | print_current_pass (stderr); | |
128 | } | |
129 | ||
130 | ||
131 | ||
77fce4cd | 132 | /* Global variables used to communicate with passes. */ |
133 | int dump_flags; | |
134 | bool in_gimple_form; | |
7e0311ae | 135 | bool first_pass_instance; |
a49a878f | 136 | |
a49a878f | 137 | |
138 | /* This is called from various places for FUNCTION_DECL, VAR_DECL, | |
139 | and TYPE_DECL nodes. | |
140 | ||
141 | This does nothing for local (non-static) variables, unless the | |
b2c4af5e | 142 | variable is a register variable with DECL_ASSEMBLER_NAME set. In |
143 | that case, or if the variable is not an automatic, it sets up the | |
144 | RTL and outputs any assembler code (label definition, storage | |
145 | allocation and initialization). | |
a49a878f | 146 | |
b2c4af5e | 147 | DECL is the declaration. TOP_LEVEL is nonzero |
a49a878f | 148 | if this declaration is not within a function. */ |
149 | ||
150 | void | |
151 | rest_of_decl_compilation (tree decl, | |
a49a878f | 152 | int top_level, |
153 | int at_end) | |
154 | { | |
155 | /* We deferred calling assemble_alias so that we could collect | |
156 | other attributes such as visibility. Emit the alias now. */ | |
157 | { | |
158 | tree alias; | |
159 | alias = lookup_attribute ("alias", DECL_ATTRIBUTES (decl)); | |
160 | if (alias) | |
161 | { | |
162 | alias = TREE_VALUE (TREE_VALUE (alias)); | |
163 | alias = get_identifier (TREE_STRING_POINTER (alias)); | |
164 | assemble_alias (decl, alias); | |
165 | } | |
166 | } | |
167 | ||
b2c4af5e | 168 | /* Can't defer this, because it needs to happen before any |
169 | later function definitions are processed. */ | |
5ded8c6f | 170 | if (DECL_ASSEMBLER_NAME_SET_P (decl) && DECL_REGISTER (decl)) |
b2c4af5e | 171 | make_decl_rtl (decl); |
172 | ||
a49a878f | 173 | /* Forward declarations for nested functions are not "external", |
174 | but we need to treat them as if they were. */ | |
175 | if (TREE_STATIC (decl) || DECL_EXTERNAL (decl) | |
176 | || TREE_CODE (decl) == FUNCTION_DECL) | |
177 | { | |
178 | timevar_push (TV_VARCONST); | |
179 | ||
a49a878f | 180 | /* Don't output anything when a tentative file-scope definition |
181 | is seen. But at end of compilation, do output code for them. | |
182 | ||
183 | We do output all variables when unit-at-a-time is active and rely on | |
184 | callgraph code to defer them except for forward declarations | |
185 | (see gcc.c-torture/compile/920624-1.c) */ | |
186 | if ((at_end | |
187 | || !DECL_DEFER_OUTPUT (decl) | |
c1dcd13c | 188 | || DECL_INITIAL (decl)) |
a49a878f | 189 | && !DECL_EXTERNAL (decl)) |
190 | { | |
c131e678 | 191 | if (TREE_CODE (decl) != FUNCTION_DECL) |
1d416bd7 | 192 | varpool_finalize_decl (decl); |
a49a878f | 193 | else |
194 | assemble_variable (decl, top_level, at_end, 0); | |
195 | } | |
196 | ||
197 | #ifdef ASM_FINISH_DECLARE_OBJECT | |
198 | if (decl == last_assemble_variable_decl) | |
199 | { | |
200 | ASM_FINISH_DECLARE_OBJECT (asm_out_file, decl, | |
201 | top_level, at_end); | |
202 | } | |
203 | #endif | |
204 | ||
205 | timevar_pop (TV_VARCONST); | |
206 | } | |
76512af6 | 207 | else if (TREE_CODE (decl) == TYPE_DECL |
208 | /* Like in rest_of_type_compilation, avoid confusing the debug | |
209 | information machinery when there are errors. */ | |
210 | && !(sorrycount || errorcount)) | |
a49a878f | 211 | { |
212 | timevar_push (TV_SYMOUT); | |
213 | debug_hooks->type_decl (decl, !top_level); | |
214 | timevar_pop (TV_SYMOUT); | |
215 | } | |
d7401838 | 216 | |
06b27565 | 217 | /* Let cgraph know about the existence of variables. */ |
d7401838 | 218 | if (TREE_CODE (decl) == VAR_DECL && !DECL_EXTERNAL (decl)) |
1d416bd7 | 219 | varpool_node (decl); |
a49a878f | 220 | } |
221 | ||
222 | /* Called after finishing a record, union or enumeral type. */ | |
223 | ||
224 | void | |
225 | rest_of_type_compilation (tree type, int toplev) | |
226 | { | |
227 | /* Avoid confusing the debug information machinery when there are | |
228 | errors. */ | |
229 | if (errorcount != 0 || sorrycount != 0) | |
230 | return; | |
231 | ||
232 | timevar_push (TV_SYMOUT); | |
233 | debug_hooks->type_decl (TYPE_STUB_DECL (type), !toplev); | |
234 | timevar_pop (TV_SYMOUT); | |
235 | } | |
236 | ||
77fce4cd | 237 | \f |
a49a878f | 238 | |
77fce4cd | 239 | void |
240 | finish_optimization_passes (void) | |
a49a878f | 241 | { |
77fce4cd | 242 | enum tree_dump_index i; |
243 | struct dump_file_info *dfi; | |
244 | char *name; | |
a49a878f | 245 | |
77fce4cd | 246 | timevar_push (TV_DUMP); |
247 | if (profile_arc_flag || flag_test_coverage || flag_branch_probabilities) | |
a49a878f | 248 | { |
20099e35 | 249 | dump_file = dump_begin (pass_profile.pass.static_pass_number, NULL); |
77fce4cd | 250 | end_branch_prob (); |
251 | if (dump_file) | |
20099e35 | 252 | dump_end (pass_profile.pass.static_pass_number, dump_file); |
a49a878f | 253 | } |
a49a878f | 254 | |
77fce4cd | 255 | if (optimize > 0) |
a49a878f | 256 | { |
20099e35 | 257 | dump_file = dump_begin (pass_combine.pass.static_pass_number, NULL); |
77fce4cd | 258 | if (dump_file) |
a49a878f | 259 | { |
77fce4cd | 260 | dump_combine_total_stats (dump_file); |
20099e35 | 261 | dump_end (pass_combine.pass.static_pass_number, dump_file); |
a49a878f | 262 | } |
263 | } | |
264 | ||
77fce4cd | 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) | |
5f0ef107 | 269 | && (dfi->flags & TDF_GRAPH) != 0 |
77fce4cd | 270 | && (name = get_dump_file_name (i)) != NULL) |
5f0ef107 | 271 | { |
272 | finish_graph_dump_file (name); | |
273 | free (name); | |
274 | } | |
a49a878f | 275 | |
77fce4cd | 276 | timevar_pop (TV_DUMP); |
a49a878f | 277 | } |
a49a878f | 278 | |
77fce4cd | 279 | static bool |
280 | gate_rest_of_compilation (void) | |
a49a878f | 281 | { |
77fce4cd | 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 || errorcount || sorrycount); | |
a49a878f | 285 | } |
286 | ||
20099e35 | 287 | struct gimple_opt_pass pass_rest_of_compilation = |
a49a878f | 288 | { |
20099e35 | 289 | { |
290 | GIMPLE_PASS, | |
77fce4cd | 291 | NULL, /* name */ |
292 | gate_rest_of_compilation, /* gate */ | |
293 | NULL, /* execute */ | |
294 | NULL, /* sub */ | |
295 | NULL, /* next */ | |
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 */ | |
20099e35 | 302 | TODO_ggc_collect /* todo_flags_finish */ |
303 | } | |
77fce4cd | 304 | }; |
a49a878f | 305 | |
77fce4cd | 306 | static bool |
307 | gate_postreload (void) | |
308 | { | |
309 | return reload_completed; | |
a49a878f | 310 | } |
311 | ||
20099e35 | 312 | struct rtl_opt_pass pass_postreload = |
a49a878f | 313 | { |
20099e35 | 314 | { |
315 | RTL_PASS, | |
77fce4cd | 316 | NULL, /* name */ |
317 | gate_postreload, /* gate */ | |
318 | NULL, /* execute */ | |
319 | NULL, /* sub */ | |
320 | NULL, /* next */ | |
321 | 0, /* static_pass_number */ | |
322 | 0, /* tv_id */ | |
323 | PROP_rtl, /* properties_required */ | |
324 | 0, /* properties_provided */ | |
325 | 0, /* properties_destroyed */ | |
326 | 0, /* todo_flags_start */ | |
20099e35 | 327 | TODO_ggc_collect | TODO_verify_rtl_sharing /* todo_flags_finish */ |
328 | } | |
77fce4cd | 329 | }; |
a49a878f | 330 | |
da2f1613 | 331 | |
a49a878f | 332 | |
77fce4cd | 333 | /* The root of the compilation pass tree, once constructed. */ |
20099e35 | 334 | struct opt_pass *all_passes, *all_ipa_passes, *all_lowering_passes; |
a49a878f | 335 | |
9659d177 | 336 | /* A map from static pass id to optimization pass. */ |
337 | struct opt_pass **passes_by_id; | |
338 | int passes_by_id_size; | |
339 | ||
340 | /* Set the static pass number of pass PASS to ID and record that | |
341 | in the mapping from static pass number to pass. */ | |
342 | ||
343 | static void | |
344 | set_pass_for_id (int id, struct opt_pass *pass) | |
345 | { | |
346 | pass->static_pass_number = id; | |
347 | if (passes_by_id_size <= id) | |
348 | { | |
4077bf7a | 349 | passes_by_id = XRESIZEVEC (struct opt_pass *, passes_by_id, id + 1); |
9659d177 | 350 | memset (passes_by_id + passes_by_id_size, 0, |
351 | (id + 1 - passes_by_id_size) * sizeof (void *)); | |
352 | passes_by_id_size = id + 1; | |
353 | } | |
354 | passes_by_id[id] = pass; | |
355 | } | |
356 | ||
357 | /* Return the pass with the static pass number ID. */ | |
358 | ||
359 | struct opt_pass * | |
360 | get_pass_for_id (int id) | |
361 | { | |
362 | if (id >= passes_by_id_size) | |
363 | return NULL; | |
364 | return passes_by_id[id]; | |
365 | } | |
366 | ||
77fce4cd | 367 | /* Iterate over the pass tree allocating dump file numbers. We want |
368 | to do this depth first, and independent of whether the pass is | |
369 | enabled or not. */ | |
a49a878f | 370 | |
77fce4cd | 371 | static void |
5d48fdb4 | 372 | register_one_dump_file (struct opt_pass *pass) |
77fce4cd | 373 | { |
374 | char *dot_name, *flag_name, *glob_name; | |
6354626c | 375 | const char *prefix; |
77fce4cd | 376 | char num[10]; |
9659d177 | 377 | int flags, id; |
a49a878f | 378 | |
77fce4cd | 379 | /* See below in next_pass_1. */ |
380 | num[0] = '\0'; | |
381 | if (pass->static_pass_number != -1) | |
382 | sprintf (num, "%d", ((int) pass->static_pass_number < 0 | |
383 | ? 1 : pass->static_pass_number)); | |
a49a878f | 384 | |
77fce4cd | 385 | dot_name = concat (".", pass->name, num, NULL); |
68e3904e | 386 | if (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS) |
6354626c | 387 | prefix = "ipa-", flags = TDF_IPA; |
5d48fdb4 | 388 | else if (pass->type == GIMPLE_PASS) |
6354626c | 389 | prefix = "tree-", flags = TDF_TREE; |
a49a878f | 390 | else |
6354626c | 391 | prefix = "rtl-", flags = TDF_RTL; |
392 | ||
393 | flag_name = concat (prefix, pass->name, num, NULL); | |
394 | glob_name = concat (prefix, pass->name, NULL); | |
9659d177 | 395 | id = dump_register (dot_name, flag_name, glob_name, flags); |
396 | set_pass_for_id (id, pass); | |
da2f1613 | 397 | } |
398 | ||
6354626c | 399 | /* Recursive worker function for register_dump_files. */ |
400 | ||
77fce4cd | 401 | static int |
5d48fdb4 | 402 | register_dump_files_1 (struct opt_pass *pass, int properties) |
da2f1613 | 403 | { |
77fce4cd | 404 | do |
405 | { | |
6354626c | 406 | int new_properties = (properties | pass->properties_provided) |
407 | & ~pass->properties_destroyed; | |
a49a878f | 408 | |
77fce4cd | 409 | if (pass->name) |
5d48fdb4 | 410 | register_one_dump_file (pass); |
a49a878f | 411 | |
77fce4cd | 412 | if (pass->sub) |
5d48fdb4 | 413 | new_properties = register_dump_files_1 (pass->sub, new_properties); |
a49a878f | 414 | |
77fce4cd | 415 | /* If we have a gate, combine the properties that we could have with |
416 | and without the pass being examined. */ | |
417 | if (pass->gate) | |
418 | properties &= new_properties; | |
419 | else | |
420 | properties = new_properties; | |
a49a878f | 421 | |
77fce4cd | 422 | pass = pass->next; |
a49a878f | 423 | } |
77fce4cd | 424 | while (pass); |
a49a878f | 425 | |
77fce4cd | 426 | return properties; |
a49a878f | 427 | } |
839f8415 | 428 | |
5d48fdb4 | 429 | /* Register the dump files for the pipeline starting at PASS. |
430 | PROPERTIES reflects the properties that are guaranteed to be available at | |
431 | the beginning of the pipeline. */ | |
6354626c | 432 | |
433 | static void | |
5d48fdb4 | 434 | register_dump_files (struct opt_pass *pass,int properties) |
6354626c | 435 | { |
436 | pass->properties_required |= properties; | |
5d48fdb4 | 437 | register_dump_files_1 (pass, properties); |
6354626c | 438 | } |
439 | ||
77fce4cd | 440 | /* Add a pass to the pass list. Duplicate the pass if it's already |
441 | in the list. */ | |
839f8415 | 442 | |
20099e35 | 443 | static struct opt_pass ** |
444 | next_pass_1 (struct opt_pass **list, struct opt_pass *pass) | |
a49a878f | 445 | { |
77fce4cd | 446 | /* A nonzero static_pass_number indicates that the |
447 | pass is already in the list. */ | |
448 | if (pass->static_pass_number) | |
449 | { | |
20099e35 | 450 | struct opt_pass *new; |
a49a878f | 451 | |
4077bf7a | 452 | new = XNEW (struct opt_pass); |
77fce4cd | 453 | memcpy (new, pass, sizeof (*new)); |
d3a5fc6b | 454 | new->next = NULL; |
a49a878f | 455 | |
7e0311ae | 456 | new->todo_flags_start &= ~TODO_mark_first_instance; |
457 | ||
77fce4cd | 458 | /* Indicate to register_dump_files that this pass has duplicates, |
459 | and so it should rename the dump file. The first instance will | |
460 | be -1, and be number of duplicates = -static_pass_number - 1. | |
461 | Subsequent instances will be > 0 and just the duplicate number. */ | |
462 | if (pass->name) | |
463 | { | |
464 | pass->static_pass_number -= 1; | |
465 | new->static_pass_number = -pass->static_pass_number; | |
466 | } | |
467 | ||
468 | *list = new; | |
469 | } | |
470 | else | |
471 | { | |
7e0311ae | 472 | pass->todo_flags_start |= TODO_mark_first_instance; |
77fce4cd | 473 | pass->static_pass_number = -1; |
474 | *list = pass; | |
475 | } | |
476 | ||
477 | return &(*list)->next; | |
478 | ||
a49a878f | 479 | } |
480 | ||
3072d30e | 481 | |
ae6ad54a | 482 | /* Construct the pass tree. The sequencing of passes is driven by |
483 | the cgraph routines: | |
484 | ||
485 | cgraph_finalize_compilation_unit () | |
486 | for each node N in the cgraph | |
487 | cgraph_analyze_function (N) | |
488 | cgraph_lower_function (N) -> all_lowering_passes | |
489 | ||
490 | If we are optimizing, cgraph_optimize is then invoked: | |
491 | ||
492 | cgraph_optimize () | |
493 | ipa_passes () -> all_ipa_passes | |
494 | cgraph_expand_all_functions () | |
495 | for each node N in the cgraph | |
496 | cgraph_expand_function (N) | |
84e10000 | 497 | tree_rest_of_compilation (DECL (N)) -> all_passes |
ae6ad54a | 498 | */ |
da2f1613 | 499 | |
77fce4cd | 500 | void |
501 | init_optimization_passes (void) | |
502 | { | |
20099e35 | 503 | struct opt_pass **p; |
77fce4cd | 504 | |
20099e35 | 505 | #define NEXT_PASS(PASS) (p = next_pass_1 (p, &((PASS).pass))) |
09a2e412 | 506 | |
fdd35027 | 507 | /* All passes needed to lower the function into shape optimizers can |
508 | operate on. These passes are always run first on the function, but | |
509 | backend might produce already lowered functions that are not processed | |
510 | by these passes. */ | |
77fce4cd | 511 | p = &all_lowering_passes; |
512 | NEXT_PASS (pass_remove_useless_stmts); | |
513 | NEXT_PASS (pass_mudflap_1); | |
1e8e9920 | 514 | NEXT_PASS (pass_lower_omp); |
77fce4cd | 515 | NEXT_PASS (pass_lower_cf); |
4888ab9a | 516 | NEXT_PASS (pass_refactor_eh); |
77fce4cd | 517 | NEXT_PASS (pass_lower_eh); |
518 | NEXT_PASS (pass_build_cfg); | |
519 | NEXT_PASS (pass_lower_complex_O0); | |
520 | NEXT_PASS (pass_lower_vector); | |
521 | NEXT_PASS (pass_warn_function_return); | |
e7c352d1 | 522 | NEXT_PASS (pass_build_cgraph_edges); |
09a2e412 | 523 | NEXT_PASS (pass_inline_parameters); |
77fce4cd | 524 | *p = NULL; |
525 | ||
fdd35027 | 526 | /* Interprocedural optimization passes. |
527 | All these passes are ignored in -fno-unit-at-a-time | |
f6a0d06f | 528 | except for subpasses of early_local_passes. */ |
fdd35027 | 529 | p = &all_ipa_passes; |
530 | NEXT_PASS (pass_ipa_function_and_variable_visibility); | |
531 | NEXT_PASS (pass_ipa_early_inline); | |
532 | { | |
20099e35 | 533 | struct opt_pass **p = &pass_ipa_early_inline.pass.sub; |
fdd35027 | 534 | NEXT_PASS (pass_early_inline); |
535 | NEXT_PASS (pass_inline_parameters); | |
536 | NEXT_PASS (pass_rebuild_cgraph_edges); | |
537 | } | |
538 | NEXT_PASS (pass_early_local_passes); | |
539 | { | |
20099e35 | 540 | struct opt_pass **p = &pass_early_local_passes.pass.sub; |
fdd35027 | 541 | NEXT_PASS (pass_tree_profile); |
542 | NEXT_PASS (pass_cleanup_cfg); | |
543 | NEXT_PASS (pass_init_datastructures); | |
544 | NEXT_PASS (pass_expand_omp); | |
bff4202c | 545 | |
546 | NEXT_PASS (pass_referenced_vars); | |
547 | NEXT_PASS (pass_reset_cc_flags); | |
548 | NEXT_PASS (pass_build_ssa); | |
fdd35027 | 549 | NEXT_PASS (pass_all_early_optimizations); |
550 | { | |
20099e35 | 551 | struct opt_pass **p = &pass_all_early_optimizations.pass.sub; |
fdd35027 | 552 | NEXT_PASS (pass_early_warn_uninitialized); |
553 | NEXT_PASS (pass_rebuild_cgraph_edges); | |
554 | NEXT_PASS (pass_early_inline); | |
555 | NEXT_PASS (pass_cleanup_cfg); | |
556 | NEXT_PASS (pass_rename_ssa_copies); | |
557 | NEXT_PASS (pass_ccp); | |
558 | NEXT_PASS (pass_forwprop); | |
83cfcdaf | 559 | NEXT_PASS (pass_update_address_taken); |
560 | NEXT_PASS (pass_simple_dse); | |
1f0a4df8 | 561 | NEXT_PASS (pass_sra_early); |
fdd35027 | 562 | NEXT_PASS (pass_copy_prop); |
563 | NEXT_PASS (pass_merge_phi); | |
564 | NEXT_PASS (pass_dce); | |
e6a23add | 565 | /* Ideally the function call conditional |
566 | dead code elimination phase can be delayed | |
567 | till later where potentially more opportunities | |
568 | can be found. Due to lack of good ways to | |
569 | update VDEFs associated with the shrink-wrapped | |
570 | calls, it is better to do the transformation | |
571 | here where memory SSA is not built yet. */ | |
572 | NEXT_PASS (pass_call_cdce); | |
83cfcdaf | 573 | NEXT_PASS (pass_update_address_taken); |
574 | NEXT_PASS (pass_simple_dse); | |
fdd35027 | 575 | NEXT_PASS (pass_tail_recursion); |
a347af29 | 576 | NEXT_PASS (pass_convert_switch); |
4ae20857 | 577 | NEXT_PASS (pass_profile); |
fdd35027 | 578 | } |
bff4202c | 579 | NEXT_PASS (pass_release_ssa_names); |
fdd35027 | 580 | NEXT_PASS (pass_rebuild_cgraph_edges); |
fdd35027 | 581 | } |
582 | NEXT_PASS (pass_ipa_increase_alignment); | |
604cde73 | 583 | NEXT_PASS (pass_ipa_matrix_reorg); |
fdd35027 | 584 | NEXT_PASS (pass_ipa_cp); |
585 | NEXT_PASS (pass_ipa_inline); | |
586 | NEXT_PASS (pass_ipa_reference); | |
587 | NEXT_PASS (pass_ipa_pure_const); | |
588 | NEXT_PASS (pass_ipa_type_escape); | |
589 | NEXT_PASS (pass_ipa_pta); | |
f27ac341 | 590 | NEXT_PASS (pass_ipa_struct_reorg); |
f517b36e | 591 | *p = NULL; |
592 | ||
48a12060 | 593 | /* These passes are run after IPA passes on every function that is being |
594 | output to the assembler file. */ | |
77fce4cd | 595 | p = &all_passes; |
7309a3bb | 596 | NEXT_PASS (pass_O0_always_inline); |
77fce4cd | 597 | NEXT_PASS (pass_all_optimizations); |
fdd35027 | 598 | { |
20099e35 | 599 | struct opt_pass **p = &pass_all_optimizations.pass.sub; |
70393469 | 600 | /* pass_build_alias is a dummy pass that ensures that we |
601 | execute TODO_rebuild_alias at this point. */ | |
df3f0669 | 602 | NEXT_PASS (pass_build_alias); |
fdd35027 | 603 | NEXT_PASS (pass_return_slot); |
604 | NEXT_PASS (pass_rename_ssa_copies); | |
605 | ||
606 | /* Initial scalar cleanups. */ | |
d88fd237 | 607 | NEXT_PASS (pass_complete_unrolli); |
fdd35027 | 608 | NEXT_PASS (pass_ccp); |
37361b38 | 609 | NEXT_PASS (pass_phiprop); |
fdd35027 | 610 | NEXT_PASS (pass_fre); |
611 | NEXT_PASS (pass_dce); | |
612 | NEXT_PASS (pass_forwprop); | |
613 | NEXT_PASS (pass_copy_prop); | |
614 | NEXT_PASS (pass_merge_phi); | |
615 | NEXT_PASS (pass_vrp); | |
616 | NEXT_PASS (pass_dce); | |
e6d0e152 | 617 | NEXT_PASS (pass_cselim); |
fdd35027 | 618 | NEXT_PASS (pass_dominator); |
fdd35027 | 619 | /* The only const/copy propagation opportunities left after |
620 | DOM should be due to degenerate PHI nodes. So rather than | |
621 | run the full propagators, run a specialized pass which | |
622 | only examines PHIs to discover const/copy propagation | |
623 | opportunities. */ | |
624 | NEXT_PASS (pass_phi_only_cprop); | |
8530c7be | 625 | NEXT_PASS (pass_tree_ifcombine); |
fdd35027 | 626 | NEXT_PASS (pass_phiopt); |
fdd35027 | 627 | NEXT_PASS (pass_tail_recursion); |
fdd35027 | 628 | NEXT_PASS (pass_ch); |
629 | NEXT_PASS (pass_stdarg); | |
630 | NEXT_PASS (pass_lower_complex); | |
631 | NEXT_PASS (pass_sra); | |
fdd35027 | 632 | NEXT_PASS (pass_rename_ssa_copies); |
633 | NEXT_PASS (pass_dominator); | |
634 | ||
635 | /* The only const/copy propagation opportunities left after | |
636 | DOM should be due to degenerate PHI nodes. So rather than | |
637 | run the full propagators, run a specialized pass which | |
638 | only examines PHIs to discover const/copy propagation | |
639 | opportunities. */ | |
640 | NEXT_PASS (pass_phi_only_cprop); | |
641 | ||
642 | NEXT_PASS (pass_reassoc); | |
643 | NEXT_PASS (pass_dce); | |
644 | NEXT_PASS (pass_dse); | |
fdd35027 | 645 | NEXT_PASS (pass_forwprop); |
646 | NEXT_PASS (pass_phiopt); | |
647 | NEXT_PASS (pass_object_sizes); | |
648 | NEXT_PASS (pass_store_ccp); | |
317d3b82 | 649 | NEXT_PASS (pass_copy_prop); |
fdd35027 | 650 | NEXT_PASS (pass_fold_builtins); |
651 | NEXT_PASS (pass_cse_sincos); | |
fdd35027 | 652 | NEXT_PASS (pass_split_crit_edges); |
653 | NEXT_PASS (pass_pre); | |
fdd35027 | 654 | NEXT_PASS (pass_sink_code); |
655 | NEXT_PASS (pass_tree_loop); | |
656 | { | |
20099e35 | 657 | struct opt_pass **p = &pass_tree_loop.pass.sub; |
fdd35027 | 658 | NEXT_PASS (pass_tree_loop_init); |
659 | NEXT_PASS (pass_copy_prop); | |
ad4a85ad | 660 | NEXT_PASS (pass_dce_loop); |
fdd35027 | 661 | NEXT_PASS (pass_lim); |
ad4a85ad | 662 | NEXT_PASS (pass_predcom); |
fdd35027 | 663 | NEXT_PASS (pass_tree_unswitch); |
664 | NEXT_PASS (pass_scev_cprop); | |
665 | NEXT_PASS (pass_empty_loop); | |
666 | NEXT_PASS (pass_record_bounds); | |
355572cc | 667 | NEXT_PASS (pass_check_data_deps); |
801c5610 | 668 | NEXT_PASS (pass_loop_distribution); |
fdd35027 | 669 | NEXT_PASS (pass_linear_transform); |
670 | NEXT_PASS (pass_iv_canon); | |
671 | NEXT_PASS (pass_if_conversion); | |
672 | NEXT_PASS (pass_vectorize); | |
673 | { | |
20099e35 | 674 | struct opt_pass **p = &pass_vectorize.pass.sub; |
fdd35027 | 675 | NEXT_PASS (pass_lower_vector_ssa); |
676 | NEXT_PASS (pass_dce_loop); | |
677 | } | |
fdd35027 | 678 | NEXT_PASS (pass_complete_unroll); |
28c92cbb | 679 | NEXT_PASS (pass_parallelize_loops); |
fdd35027 | 680 | NEXT_PASS (pass_loop_prefetch); |
681 | NEXT_PASS (pass_iv_optimize); | |
682 | NEXT_PASS (pass_tree_loop_done); | |
683 | } | |
684 | NEXT_PASS (pass_cse_reciprocals); | |
e174638f | 685 | NEXT_PASS (pass_convert_to_rsqrt); |
fdd35027 | 686 | NEXT_PASS (pass_reassoc); |
687 | NEXT_PASS (pass_vrp); | |
688 | NEXT_PASS (pass_dominator); | |
b1b7c0c4 | 689 | |
fdd35027 | 690 | /* The only const/copy propagation opportunities left after |
691 | DOM should be due to degenerate PHI nodes. So rather than | |
692 | run the full propagators, run a specialized pass which | |
693 | only examines PHIs to discover const/copy propagation | |
694 | opportunities. */ | |
695 | NEXT_PASS (pass_phi_only_cprop); | |
696 | ||
697 | NEXT_PASS (pass_cd_dce); | |
3ddccd57 | 698 | NEXT_PASS (pass_tracer); |
fdd35027 | 699 | |
700 | /* FIXME: If DCE is not run before checking for uninitialized uses, | |
701 | we may get false warnings (e.g., testsuite/gcc.dg/uninit-5.c). | |
702 | However, this also causes us to misdiagnose cases that should be | |
703 | real warnings (e.g., testsuite/gcc.dg/pr18501.c). | |
704 | ||
705 | To fix the false positives in uninit-5.c, we would have to | |
706 | account for the predicates protecting the set and the use of each | |
707 | variable. Using a representation like Gated Single Assignment | |
708 | may help. */ | |
709 | NEXT_PASS (pass_late_warn_uninitialized); | |
710 | NEXT_PASS (pass_dse); | |
711 | NEXT_PASS (pass_forwprop); | |
712 | NEXT_PASS (pass_phiopt); | |
713 | NEXT_PASS (pass_tail_calls); | |
714 | NEXT_PASS (pass_rename_ssa_copies); | |
715 | NEXT_PASS (pass_uncprop); | |
fdd35027 | 716 | } |
bff4202c | 717 | NEXT_PASS (pass_del_ssa); |
718 | NEXT_PASS (pass_nrv); | |
719 | NEXT_PASS (pass_mark_used_blocks); | |
720 | NEXT_PASS (pass_cleanup_cfg_post_optimizing); | |
721 | ||
77fce4cd | 722 | NEXT_PASS (pass_warn_function_noreturn); |
77fce4cd | 723 | NEXT_PASS (pass_free_datastructures); |
fa784ce1 | 724 | NEXT_PASS (pass_mudflap_2); |
77fce4cd | 725 | NEXT_PASS (pass_free_cfg_annotations); |
726 | NEXT_PASS (pass_expand); | |
727 | NEXT_PASS (pass_rest_of_compilation); | |
fdd35027 | 728 | { |
20099e35 | 729 | struct opt_pass **p = &pass_rest_of_compilation.pass.sub; |
fdd35027 | 730 | NEXT_PASS (pass_init_function); |
731 | NEXT_PASS (pass_jump); | |
fdd35027 | 732 | NEXT_PASS (pass_rtl_eh); |
733 | NEXT_PASS (pass_initial_value_sets); | |
734 | NEXT_PASS (pass_unshare_all_rtl); | |
735 | NEXT_PASS (pass_instantiate_virtual_regs); | |
154480b1 | 736 | NEXT_PASS (pass_into_cfg_layout_mode); |
fdd35027 | 737 | NEXT_PASS (pass_jump2); |
738 | NEXT_PASS (pass_lower_subreg); | |
3072d30e | 739 | NEXT_PASS (pass_df_initialize_opt); |
fdd35027 | 740 | NEXT_PASS (pass_cse); |
741 | NEXT_PASS (pass_rtl_fwprop); | |
742 | NEXT_PASS (pass_gcse); | |
fdd35027 | 743 | NEXT_PASS (pass_rtl_ifcvt); |
fdd35027 | 744 | /* Perform loop optimizations. It might be better to do them a bit |
745 | sooner, but we want the profile feedback to work more | |
746 | efficiently. */ | |
747 | NEXT_PASS (pass_loop2); | |
748 | { | |
20099e35 | 749 | struct opt_pass **p = &pass_loop2.pass.sub; |
fdd35027 | 750 | NEXT_PASS (pass_rtl_loop_init); |
751 | NEXT_PASS (pass_rtl_move_loop_invariants); | |
752 | NEXT_PASS (pass_rtl_unswitch); | |
753 | NEXT_PASS (pass_rtl_unroll_and_peel_loops); | |
754 | NEXT_PASS (pass_rtl_doloop); | |
755 | NEXT_PASS (pass_rtl_loop_done); | |
756 | *p = NULL; | |
757 | } | |
758 | NEXT_PASS (pass_web); | |
ec028b54 | 759 | NEXT_PASS (pass_jump_bypass); |
fdd35027 | 760 | NEXT_PASS (pass_cse2); |
3072d30e | 761 | NEXT_PASS (pass_rtl_dse1); |
fdd35027 | 762 | NEXT_PASS (pass_rtl_fwprop_addr); |
3072d30e | 763 | NEXT_PASS (pass_regclass_init); |
764 | NEXT_PASS (pass_inc_dec); | |
765 | NEXT_PASS (pass_initialize_regs); | |
207c7ab2 | 766 | NEXT_PASS (pass_outof_cfg_layout_mode); |
3072d30e | 767 | NEXT_PASS (pass_ud_rtl_dce); |
fdd35027 | 768 | NEXT_PASS (pass_combine); |
769 | NEXT_PASS (pass_if_after_combine); | |
770 | NEXT_PASS (pass_partition_blocks); | |
771 | NEXT_PASS (pass_regmove); | |
772 | NEXT_PASS (pass_split_all_insns); | |
773 | NEXT_PASS (pass_lower_subreg2); | |
3072d30e | 774 | NEXT_PASS (pass_df_initialize_no_opt); |
775 | NEXT_PASS (pass_stack_ptr_mod); | |
fdd35027 | 776 | NEXT_PASS (pass_mode_switching); |
777 | NEXT_PASS (pass_see); | |
9dc6d5bb | 778 | NEXT_PASS (pass_match_asm_constraints); |
fdd35027 | 779 | NEXT_PASS (pass_sms); |
780 | NEXT_PASS (pass_sched); | |
3072d30e | 781 | NEXT_PASS (pass_subregs_of_mode_init); |
fdd35027 | 782 | NEXT_PASS (pass_local_alloc); |
783 | NEXT_PASS (pass_global_alloc); | |
3072d30e | 784 | NEXT_PASS (pass_subregs_of_mode_finish); |
fdd35027 | 785 | NEXT_PASS (pass_postreload); |
786 | { | |
20099e35 | 787 | struct opt_pass **p = &pass_postreload.pass.sub; |
fdd35027 | 788 | NEXT_PASS (pass_postreload_cse); |
789 | NEXT_PASS (pass_gcse2); | |
3072d30e | 790 | NEXT_PASS (pass_split_after_reload); |
791 | NEXT_PASS (pass_branch_target_load_optimize1); | |
792 | NEXT_PASS (pass_thread_prologue_and_epilogue); | |
793 | NEXT_PASS (pass_rtl_dse2); | |
fdd35027 | 794 | NEXT_PASS (pass_rtl_seqabstr); |
795 | NEXT_PASS (pass_stack_adjustments); | |
796 | NEXT_PASS (pass_peephole2); | |
797 | NEXT_PASS (pass_if_after_reload); | |
798 | NEXT_PASS (pass_regrename); | |
3072d30e | 799 | NEXT_PASS (pass_cprop_hardreg); |
800 | NEXT_PASS (pass_fast_rtl_dce); | |
fdd35027 | 801 | NEXT_PASS (pass_reorder_blocks); |
3072d30e | 802 | NEXT_PASS (pass_branch_target_load_optimize2); |
fdd35027 | 803 | NEXT_PASS (pass_leaf_regs); |
3072d30e | 804 | NEXT_PASS (pass_split_before_sched2); |
fdd35027 | 805 | NEXT_PASS (pass_sched2); |
fdd35027 | 806 | NEXT_PASS (pass_stack_regs); |
3072d30e | 807 | { |
20099e35 | 808 | struct opt_pass **p = &pass_stack_regs.pass.sub; |
3072d30e | 809 | NEXT_PASS (pass_split_before_regstack); |
810 | NEXT_PASS (pass_stack_regs_run); | |
811 | } | |
fdd35027 | 812 | NEXT_PASS (pass_compute_alignments); |
813 | NEXT_PASS (pass_duplicate_computed_gotos); | |
814 | NEXT_PASS (pass_variable_tracking); | |
815 | NEXT_PASS (pass_free_cfg); | |
816 | NEXT_PASS (pass_machine_reorg); | |
817 | NEXT_PASS (pass_cleanup_barriers); | |
818 | NEXT_PASS (pass_delay_slots); | |
819 | NEXT_PASS (pass_split_for_shorten_branches); | |
820 | NEXT_PASS (pass_convert_to_eh_region_ranges); | |
821 | NEXT_PASS (pass_shorten_branches); | |
822 | NEXT_PASS (pass_set_nothrow_function_flags); | |
823 | NEXT_PASS (pass_final); | |
824 | } | |
829545fe | 825 | NEXT_PASS (pass_df_finish); |
fdd35027 | 826 | } |
77fce4cd | 827 | NEXT_PASS (pass_clean_state); |
828 | *p = NULL; | |
829 | ||
77fce4cd | 830 | #undef NEXT_PASS |
831 | ||
832 | /* Register the passes with the tree dump code. */ | |
5d48fdb4 | 833 | register_dump_files (all_lowering_passes, PROP_gimple_any); |
80f94d49 | 834 | all_lowering_passes->todo_flags_start |= TODO_set_props; |
5d48fdb4 | 835 | register_dump_files (all_ipa_passes, |
6354626c | 836 | PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh |
837 | | PROP_cfg); | |
5d48fdb4 | 838 | register_dump_files (all_passes, |
6354626c | 839 | PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh |
840 | | PROP_cfg); | |
77fce4cd | 841 | } |
842 | ||
80f94d49 | 843 | /* If we are in IPA mode (i.e., current_function_decl is NULL), call |
844 | function CALLBACK for every function in the call graph. Otherwise, | |
845 | call CALLBACK on the current function. */ | |
6354626c | 846 | |
77fce4cd | 847 | static void |
80f94d49 | 848 | do_per_function (void (*callback) (void *data), void *data) |
77fce4cd | 849 | { |
80f94d49 | 850 | if (current_function_decl) |
851 | callback (data); | |
852 | else | |
853 | { | |
854 | struct cgraph_node *node; | |
855 | for (node = cgraph_nodes; node; node = node->next) | |
856 | if (node->analyzed) | |
857 | { | |
858 | push_cfun (DECL_STRUCT_FUNCTION (node->decl)); | |
859 | current_function_decl = node->decl; | |
860 | callback (data); | |
861 | free_dominance_info (CDI_DOMINATORS); | |
862 | free_dominance_info (CDI_POST_DOMINATORS); | |
863 | current_function_decl = NULL; | |
864 | pop_cfun (); | |
865 | ggc_collect (); | |
866 | } | |
867 | } | |
868 | } | |
869 | ||
09a2e412 | 870 | /* Because inlining might remove no-longer reachable nodes, we need to |
871 | keep the array visible to garbage collector to avoid reading collected | |
872 | out nodes. */ | |
873 | static int nnodes; | |
874 | static GTY ((length ("nnodes"))) struct cgraph_node **order; | |
875 | ||
876 | /* If we are in IPA mode (i.e., current_function_decl is NULL), call | |
877 | function CALLBACK for every function in the call graph. Otherwise, | |
878 | call CALLBACK on the current function. */ | |
879 | ||
880 | static void | |
881 | do_per_function_toporder (void (*callback) (void *data), void *data) | |
882 | { | |
883 | int i; | |
884 | ||
885 | if (current_function_decl) | |
886 | callback (data); | |
887 | else | |
888 | { | |
889 | gcc_assert (!order); | |
4077bf7a | 890 | order = GGC_NEWVEC (struct cgraph_node *, cgraph_n_nodes); |
09a2e412 | 891 | nnodes = cgraph_postorder (order); |
892 | for (i = nnodes - 1; i >= 0; i--) | |
893 | { | |
894 | struct cgraph_node *node = order[i]; | |
895 | ||
896 | /* Allow possibly removed nodes to be garbage collected. */ | |
897 | order[i] = NULL; | |
898 | if (node->analyzed && (node->needed || node->reachable)) | |
899 | { | |
900 | push_cfun (DECL_STRUCT_FUNCTION (node->decl)); | |
901 | current_function_decl = node->decl; | |
902 | callback (data); | |
903 | free_dominance_info (CDI_DOMINATORS); | |
904 | free_dominance_info (CDI_POST_DOMINATORS); | |
905 | current_function_decl = NULL; | |
906 | pop_cfun (); | |
907 | ggc_collect (); | |
908 | } | |
909 | } | |
910 | } | |
911 | ggc_free (order); | |
912 | order = NULL; | |
913 | nnodes = 0; | |
914 | } | |
915 | ||
80f94d49 | 916 | /* Perform all TODO actions that ought to be done on each function. */ |
77fce4cd | 917 | |
80f94d49 | 918 | static void |
919 | execute_function_todo (void *data) | |
920 | { | |
921 | unsigned int flags = (size_t)data; | |
922 | if (cfun->curr_properties & PROP_ssa) | |
6354626c | 923 | flags |= TODO_verify_ssa; |
80f94d49 | 924 | flags &= ~cfun->last_verified; |
6354626c | 925 | if (!flags) |
926 | return; | |
9659d177 | 927 | |
928 | statistics_fini_pass (); | |
929 | ||
6fa78c7b | 930 | /* Always cleanup the CFG before trying to update SSA. */ |
77fce4cd | 931 | if (flags & TODO_cleanup_cfg) |
932 | { | |
eb2a640e | 933 | bool cleanup = cleanup_tree_cfg (); |
ae79515f | 934 | |
6fa78c7b | 935 | if (cleanup && (cfun->curr_properties & PROP_ssa)) |
936 | flags |= TODO_remove_unused_locals; | |
937 | ||
ae79515f | 938 | /* When cleanup_tree_cfg merges consecutive blocks, it may |
939 | perform some simplistic propagation when removing single | |
940 | valued PHI nodes. This propagation may, in turn, cause the | |
941 | SSA form to become out-of-date (see PR 22037). So, even | |
942 | if the parent pass had not scheduled an SSA update, we may | |
943 | still need to do one. */ | |
944 | if (!(flags & TODO_update_ssa_any) && need_ssa_update_p ()) | |
945 | flags |= TODO_update_ssa; | |
77fce4cd | 946 | } |
a49a878f | 947 | |
91be5bb8 | 948 | if (flags & TODO_update_ssa_any) |
949 | { | |
950 | unsigned update_flags = flags & TODO_update_ssa_any; | |
951 | update_ssa (update_flags); | |
80f94d49 | 952 | cfun->last_verified &= ~TODO_verify_ssa; |
91be5bb8 | 953 | } |
b1b7c0c4 | 954 | |
955 | if (flags & TODO_rebuild_alias) | |
956 | { | |
957 | compute_may_aliases (); | |
958 | cfun->curr_properties |= PROP_alias; | |
959 | } | |
960 | ||
db22d3cc | 961 | if (flags & TODO_remove_unused_locals) |
962 | remove_unused_locals (); | |
963 | ||
77fce4cd | 964 | if ((flags & TODO_dump_func) |
965 | && dump_file && current_function_decl) | |
966 | { | |
80f94d49 | 967 | if (cfun->curr_properties & PROP_trees) |
77fce4cd | 968 | dump_function_to_file (current_function_decl, |
969 | dump_file, dump_flags); | |
75ab26dc | 970 | else |
5f0ef107 | 971 | { |
75ab26dc | 972 | if (dump_flags & TDF_SLIM) |
973 | print_rtl_slim_with_bb (dump_file, get_insns (), dump_flags); | |
80f94d49 | 974 | else if ((cfun->curr_properties & PROP_cfg) |
975 | && (dump_flags & TDF_BLOCKS)) | |
75ab26dc | 976 | print_rtl_with_bb (dump_file, get_insns ()); |
977 | else | |
978 | print_rtl (dump_file, get_insns ()); | |
979 | ||
80f94d49 | 980 | if (cfun->curr_properties & PROP_cfg |
75ab26dc | 981 | && graph_dump_format != no_graph |
5f0ef107 | 982 | && (dump_flags & TDF_GRAPH)) |
983 | print_rtl_graph_with_bb (dump_file_name, get_insns ()); | |
984 | } | |
77fce4cd | 985 | |
986 | /* Flush the file. If verification fails, we won't be able to | |
987 | close the file before aborting. */ | |
988 | fflush (dump_file); | |
989 | } | |
80f94d49 | 990 | |
4ae20857 | 991 | if (flags & TODO_rebuild_frequencies) |
992 | { | |
993 | if (profile_status == PROFILE_GUESSED) | |
994 | { | |
995 | loop_optimizer_init (0); | |
996 | add_noreturn_fake_exit_edges (); | |
997 | mark_irreducible_loops (); | |
998 | connect_infinite_loops_to_exit (); | |
999 | estimate_bb_frequencies (); | |
1000 | remove_fake_exit_edges (); | |
1001 | loop_optimizer_finalize (); | |
1002 | } | |
1003 | else if (profile_status == PROFILE_READ) | |
1004 | counts_to_freqs (); | |
1005 | else | |
1006 | gcc_unreachable (); | |
1007 | } | |
1008 | ||
80f94d49 | 1009 | #if defined ENABLE_CHECKING |
1010 | if (flags & TODO_verify_ssa) | |
1011 | verify_ssa (true); | |
1012 | if (flags & TODO_verify_flow) | |
1013 | verify_flow_info (); | |
1014 | if (flags & TODO_verify_stmts) | |
1015 | verify_stmts (); | |
1016 | if (flags & TODO_verify_loops) | |
1017 | verify_loop_closed_ssa (); | |
0806b508 | 1018 | if (flags & TODO_verify_rtl_sharing) |
1019 | verify_rtl_sharing (); | |
80f94d49 | 1020 | #endif |
1021 | ||
1022 | cfun->last_verified = flags & TODO_verify_all; | |
1023 | } | |
1024 | ||
1025 | /* Perform all TODO actions. */ | |
1026 | static void | |
1027 | execute_todo (unsigned int flags) | |
1028 | { | |
1029 | #if defined ENABLE_CHECKING | |
1030 | if (need_ssa_update_p ()) | |
1031 | gcc_assert (flags & TODO_update_ssa_any); | |
1032 | #endif | |
1033 | ||
7e0311ae | 1034 | /* Inform the pass whether it is the first time it is run. */ |
1035 | first_pass_instance = (flags & TODO_mark_first_instance) != 0; | |
1036 | ||
80f94d49 | 1037 | do_per_function (execute_function_todo, (void *)(size_t) flags); |
1038 | ||
f37a5008 | 1039 | /* Always remove functions just as before inlining: IPA passes might be |
1040 | interested to see bodies of extern inline functions that are not inlined | |
1041 | to analyze side effects. The full removal is done just at the end | |
1042 | of IPA pass queue. */ | |
1043 | if (flags & TODO_remove_functions) | |
fba7ae09 | 1044 | { |
1045 | gcc_assert (!cfun); | |
1046 | cgraph_remove_unreachable_nodes (true, dump_file); | |
1047 | } | |
f37a5008 | 1048 | |
77fce4cd | 1049 | if ((flags & TODO_dump_cgraph) |
1050 | && dump_file && !current_function_decl) | |
1051 | { | |
fba7ae09 | 1052 | gcc_assert (!cfun); |
77fce4cd | 1053 | dump_cgraph (dump_file); |
1054 | /* Flush the file. If verification fails, we won't be able to | |
1055 | close the file before aborting. */ | |
1056 | fflush (dump_file); | |
1057 | } | |
a49a878f | 1058 | |
77fce4cd | 1059 | if (flags & TODO_ggc_collect) |
1060 | { | |
1061 | ggc_collect (); | |
1062 | } | |
3072d30e | 1063 | |
1064 | /* Now that the dumping has been done, we can get rid of the optional | |
1065 | df problems. */ | |
1066 | if (flags & TODO_df_finish) | |
314966f4 | 1067 | df_finish_pass ((flags & TODO_df_verify) != 0); |
80f94d49 | 1068 | } |
da2f1613 | 1069 | |
add6ee5e | 1070 | /* Verify invariants that should hold between passes. This is a place |
1071 | to put simple sanity checks. */ | |
1072 | ||
1073 | static void | |
1074 | verify_interpass_invariants (void) | |
1075 | { | |
1076 | #ifdef ENABLE_CHECKING | |
1077 | gcc_assert (!fold_deferring_overflow_warnings_p ()); | |
1078 | #endif | |
1079 | } | |
1080 | ||
80f94d49 | 1081 | /* Clear the last verified flag. */ |
1082 | ||
1083 | static void | |
1084 | clear_last_verified (void *data ATTRIBUTE_UNUSED) | |
1085 | { | |
1086 | cfun->last_verified = 0; | |
1087 | } | |
1088 | ||
1089 | /* Helper function. Verify that the properties has been turn into the | |
1090 | properties expected by the pass. */ | |
6354626c | 1091 | |
14c14128 | 1092 | #ifdef ENABLE_CHECKING |
80f94d49 | 1093 | static void |
1094 | verify_curr_properties (void *data) | |
1095 | { | |
1096 | unsigned int props = (size_t)data; | |
1097 | gcc_assert ((cfun->curr_properties & props) == props); | |
1098 | } | |
14c14128 | 1099 | #endif |
80f94d49 | 1100 | |
68e3904e | 1101 | /* Initialize pass dump file. */ |
1102 | ||
1103 | static bool | |
1104 | pass_init_dump_file (struct opt_pass *pass) | |
1105 | { | |
1106 | /* If a dump file name is present, open it if enabled. */ | |
1107 | if (pass->static_pass_number != -1) | |
1108 | { | |
1109 | bool initializing_dump = !dump_initialized_p (pass->static_pass_number); | |
1110 | dump_file_name = get_dump_file_name (pass->static_pass_number); | |
1111 | dump_file = dump_begin (pass->static_pass_number, &dump_flags); | |
1112 | if (dump_file && current_function_decl) | |
1113 | { | |
1114 | const char *dname, *aname; | |
1115 | dname = lang_hooks.decl_printable_name (current_function_decl, 2); | |
1116 | aname = (IDENTIFIER_POINTER | |
1117 | (DECL_ASSEMBLER_NAME (current_function_decl))); | |
0300832e | 1118 | fprintf (dump_file, "\n;; Function %s (%s)%s\n\n", dname, aname, |
68e3904e | 1119 | cfun->function_frequency == FUNCTION_FREQUENCY_HOT |
1120 | ? " (hot)" | |
1121 | : cfun->function_frequency == FUNCTION_FREQUENCY_UNLIKELY_EXECUTED | |
1122 | ? " (unlikely executed)" | |
1123 | : ""); | |
1124 | } | |
1125 | return initializing_dump; | |
1126 | } | |
1127 | else | |
1128 | return false; | |
1129 | } | |
1130 | ||
1131 | /* Flush PASS dump file. */ | |
1132 | ||
1133 | static void | |
1134 | pass_fini_dump_file (struct opt_pass *pass) | |
1135 | { | |
1136 | /* Flush and close dump file. */ | |
1137 | if (dump_file_name) | |
1138 | { | |
1139 | free (CONST_CAST (char *, dump_file_name)); | |
1140 | dump_file_name = NULL; | |
1141 | } | |
1142 | ||
1143 | if (dump_file) | |
1144 | { | |
1145 | dump_end (pass->static_pass_number, dump_file); | |
1146 | dump_file = NULL; | |
1147 | } | |
1148 | } | |
1149 | ||
80f94d49 | 1150 | /* After executing the pass, apply expected changes to the function |
1151 | properties. */ | |
68e3904e | 1152 | |
80f94d49 | 1153 | static void |
1154 | update_properties_after_pass (void *data) | |
1155 | { | |
4077bf7a | 1156 | struct opt_pass *pass = (struct opt_pass *) data; |
80f94d49 | 1157 | cfun->curr_properties = (cfun->curr_properties | pass->properties_provided) |
1158 | & ~pass->properties_destroyed; | |
a49a878f | 1159 | } |
1160 | ||
68e3904e | 1161 | /* Schedule IPA transform pass DATA for CFUN. */ |
1162 | ||
1163 | static void | |
1164 | add_ipa_transform_pass (void *data) | |
1165 | { | |
1166 | struct ipa_opt_pass *ipa_pass = (struct ipa_opt_pass *) data; | |
1167 | VEC_safe_push (ipa_opt_pass, heap, cfun->ipa_transforms_to_apply, ipa_pass); | |
1168 | } | |
1169 | ||
9c1bff7a | 1170 | /* Execute summary generation for all of the passes in IPA_PASS. */ |
68e3904e | 1171 | |
1172 | static void | |
9c1bff7a | 1173 | execute_ipa_summary_passes (struct ipa_opt_pass *ipa_pass) |
68e3904e | 1174 | { |
9c1bff7a | 1175 | while (ipa_pass) |
68e3904e | 1176 | { |
1177 | struct opt_pass *pass = &ipa_pass->pass; | |
9c1bff7a | 1178 | |
1179 | /* Execute all of the IPA_PASSes in the list. */ | |
1180 | if (ipa_pass->pass.type == IPA_PASS | |
1181 | && (!pass->gate || pass->gate ())) | |
68e3904e | 1182 | { |
1183 | pass_init_dump_file (pass); | |
9c1bff7a | 1184 | ipa_pass->generate_summary (); |
68e3904e | 1185 | pass_fini_dump_file (pass); |
1186 | } | |
1187 | ipa_pass = (struct ipa_opt_pass *)ipa_pass->pass.next; | |
1188 | } | |
1189 | } | |
1190 | ||
1191 | /* Execute IPA_PASS function transform on NODE. */ | |
1192 | ||
1193 | static void | |
1194 | execute_one_ipa_transform_pass (struct cgraph_node *node, | |
1195 | struct ipa_opt_pass *ipa_pass) | |
1196 | { | |
1197 | struct opt_pass *pass = &ipa_pass->pass; | |
1198 | unsigned int todo_after = 0; | |
1199 | ||
1200 | current_pass = pass; | |
1201 | if (!ipa_pass->function_transform) | |
1202 | return; | |
1203 | ||
1204 | /* Note that the folders should only create gimple expressions. | |
1205 | This is a hack until the new folder is ready. */ | |
1206 | in_gimple_form = (cfun && (cfun->curr_properties & PROP_trees)) != 0; | |
1207 | ||
1208 | pass_init_dump_file (pass); | |
1209 | ||
1210 | /* Run pre-pass verification. */ | |
fba7ae09 | 1211 | execute_todo (ipa_pass->function_transform_todo_flags_start); |
68e3904e | 1212 | |
1213 | /* If a timevar is present, start it. */ | |
1214 | if (pass->tv_id) | |
1215 | timevar_push (pass->tv_id); | |
1216 | ||
1217 | /* Do it! */ | |
1218 | todo_after = ipa_pass->function_transform (node); | |
1219 | ||
1220 | /* Stop timevar. */ | |
1221 | if (pass->tv_id) | |
1222 | timevar_pop (pass->tv_id); | |
1223 | ||
1224 | /* Run post-pass cleanup and verification. */ | |
1225 | execute_todo (todo_after); | |
1226 | verify_interpass_invariants (); | |
1227 | ||
1228 | pass_fini_dump_file (pass); | |
1229 | ||
1230 | current_pass = NULL; | |
1231 | /* Reset in_gimple_form to not break non-unit-at-a-time mode. */ | |
1232 | in_gimple_form = false; | |
1233 | } | |
1234 | ||
77fce4cd | 1235 | static bool |
20099e35 | 1236 | execute_one_pass (struct opt_pass *pass) |
a49a878f | 1237 | { |
6354626c | 1238 | bool initializing_dump; |
2a1990e9 | 1239 | unsigned int todo_after = 0; |
da2f1613 | 1240 | |
5d48fdb4 | 1241 | /* IPA passes are executed on whole program, so cfun should be NULL. |
f0b5f617 | 1242 | Other passes need function context set. */ |
68e3904e | 1243 | if (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS) |
5d48fdb4 | 1244 | gcc_assert (!cfun && !current_function_decl); |
1245 | else | |
18d50ae6 | 1246 | gcc_assert (cfun && current_function_decl); |
5d48fdb4 | 1247 | |
68e3904e | 1248 | if (cfun && cfun->ipa_transforms_to_apply) |
1249 | { | |
1250 | unsigned int i; | |
1251 | struct cgraph_node *node = cgraph_node (current_function_decl); | |
1252 | ||
1253 | for (i = 0; i < VEC_length (ipa_opt_pass, cfun->ipa_transforms_to_apply); | |
1254 | i++) | |
1255 | execute_one_ipa_transform_pass (node, | |
1256 | VEC_index (ipa_opt_pass, | |
1257 | cfun->ipa_transforms_to_apply, | |
1258 | i)); | |
1259 | VEC_free (ipa_opt_pass, heap, cfun->ipa_transforms_to_apply); | |
1260 | cfun->ipa_transforms_to_apply = NULL; | |
1261 | } | |
1262 | ||
3072d30e | 1263 | current_pass = pass; |
77fce4cd | 1264 | /* See if we're supposed to run this pass. */ |
1265 | if (pass->gate && !pass->gate ()) | |
1266 | return false; | |
a49a878f | 1267 | |
09a2e412 | 1268 | if (!quiet_flag && !cfun) |
1269 | fprintf (stderr, " <%s>", pass->name ? pass->name : ""); | |
1270 | ||
6354626c | 1271 | if (pass->todo_flags_start & TODO_set_props) |
80f94d49 | 1272 | cfun->curr_properties = pass->properties_required; |
6354626c | 1273 | |
77fce4cd | 1274 | /* Note that the folders should only create gimple expressions. |
1275 | This is a hack until the new folder is ready. */ | |
80f94d49 | 1276 | in_gimple_form = (cfun && (cfun->curr_properties & PROP_trees)) != 0; |
a49a878f | 1277 | |
77fce4cd | 1278 | /* Run pre-pass verification. */ |
6354626c | 1279 | execute_todo (pass->todo_flags_start); |
1280 | ||
80f94d49 | 1281 | #ifdef ENABLE_CHECKING |
1282 | do_per_function (verify_curr_properties, | |
1283 | (void *)(size_t)pass->properties_required); | |
1284 | #endif | |
a49a878f | 1285 | |
68e3904e | 1286 | initializing_dump = pass_init_dump_file (pass); |
a49a878f | 1287 | |
77fce4cd | 1288 | /* If a timevar is present, start it. */ |
1289 | if (pass->tv_id) | |
1290 | timevar_push (pass->tv_id); | |
a49a878f | 1291 | |
77fce4cd | 1292 | /* Do it! */ |
1293 | if (pass->execute) | |
6354626c | 1294 | { |
2a1990e9 | 1295 | todo_after = pass->execute (); |
80f94d49 | 1296 | do_per_function (clear_last_verified, NULL); |
6354626c | 1297 | } |
a49a878f | 1298 | |
77fce4cd | 1299 | /* Stop timevar. */ |
1300 | if (pass->tv_id) | |
1301 | timevar_pop (pass->tv_id); | |
a49a878f | 1302 | |
80f94d49 | 1303 | do_per_function (update_properties_after_pass, pass); |
6354626c | 1304 | |
1305 | if (initializing_dump | |
1306 | && dump_file | |
1307 | && graph_dump_format != no_graph | |
80f94d49 | 1308 | && (cfun->curr_properties & (PROP_cfg | PROP_rtl)) |
1309 | == (PROP_cfg | PROP_rtl)) | |
6354626c | 1310 | { |
1311 | get_dump_file_info (pass->static_pass_number)->flags |= TDF_GRAPH; | |
1312 | dump_flags |= TDF_GRAPH; | |
1313 | clean_graph_dump_file (dump_file_name); | |
1314 | } | |
1315 | ||
77fce4cd | 1316 | /* Run post-pass cleanup and verification. */ |
2a1990e9 | 1317 | execute_todo (todo_after | pass->todo_flags_finish); |
add6ee5e | 1318 | verify_interpass_invariants (); |
68e3904e | 1319 | if (pass->type == IPA_PASS) |
1320 | do_per_function (add_ipa_transform_pass, pass); | |
a49a878f | 1321 | |
523c1122 | 1322 | if (!current_function_decl) |
1323 | cgraph_process_new_functions (); | |
1324 | ||
68e3904e | 1325 | pass_fini_dump_file (pass); |
a49a878f | 1326 | |
68e3904e | 1327 | if (pass->type != SIMPLE_IPA_PASS && pass->type != IPA_PASS) |
18d50ae6 | 1328 | gcc_assert (!(cfun->curr_properties & PROP_trees) |
1329 | || pass->type != RTL_PASS); | |
1330 | ||
3072d30e | 1331 | current_pass = NULL; |
159787b7 | 1332 | /* Reset in_gimple_form to not break non-unit-at-a-time mode. */ |
1333 | in_gimple_form = false; | |
1334 | ||
77fce4cd | 1335 | return true; |
a49a878f | 1336 | } |
1337 | ||
77fce4cd | 1338 | void |
20099e35 | 1339 | execute_pass_list (struct opt_pass *pass) |
a49a878f | 1340 | { |
77fce4cd | 1341 | do |
a49a878f | 1342 | { |
5d48fdb4 | 1343 | gcc_assert (pass->type == GIMPLE_PASS |
1344 | || pass->type == RTL_PASS); | |
77fce4cd | 1345 | if (execute_one_pass (pass) && pass->sub) |
1346 | execute_pass_list (pass->sub); | |
1347 | pass = pass->next; | |
a49a878f | 1348 | } |
77fce4cd | 1349 | while (pass); |
a49a878f | 1350 | } |
1351 | ||
77fce4cd | 1352 | /* Same as execute_pass_list but assume that subpasses of IPA passes |
1353 | are local passes. */ | |
1354 | void | |
20099e35 | 1355 | execute_ipa_pass_list (struct opt_pass *pass) |
a49a878f | 1356 | { |
68e3904e | 1357 | bool summaries_generated = false; |
77fce4cd | 1358 | do |
a49a878f | 1359 | { |
80f94d49 | 1360 | gcc_assert (!current_function_decl); |
1361 | gcc_assert (!cfun); | |
68e3904e | 1362 | gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS); |
1363 | if (pass->type == IPA_PASS && (!pass->gate || pass->gate ())) | |
1364 | { | |
1365 | if (!summaries_generated) | |
1366 | { | |
1367 | if (!quiet_flag && !cfun) | |
1368 | fprintf (stderr, " <summary generate>"); | |
9c1bff7a | 1369 | execute_ipa_summary_passes ((struct ipa_opt_pass *) pass); |
68e3904e | 1370 | } |
1371 | summaries_generated = true; | |
1372 | } | |
77fce4cd | 1373 | if (execute_one_pass (pass) && pass->sub) |
5d48fdb4 | 1374 | { |
1375 | if (pass->sub->type == GIMPLE_PASS) | |
1376 | do_per_function_toporder ((void (*)(void *))execute_pass_list, | |
1377 | pass->sub); | |
68e3904e | 1378 | else if (pass->sub->type == SIMPLE_IPA_PASS |
1379 | || pass->sub->type == IPA_PASS) | |
5d48fdb4 | 1380 | execute_ipa_pass_list (pass->sub); |
1381 | else | |
1382 | gcc_unreachable (); | |
1383 | } | |
523c1122 | 1384 | if (!current_function_decl) |
1385 | cgraph_process_new_functions (); | |
77fce4cd | 1386 | pass = pass->next; |
a49a878f | 1387 | } |
77fce4cd | 1388 | while (pass); |
da2f1613 | 1389 | } |
9659d177 | 1390 | |
09a2e412 | 1391 | #include "gt-passes.h" |