]>
Commit | Line | Data |
---|---|---|
f6db1481 RH |
1 | /* Top level of GCC compilers (cc1, cc1plus, etc.) |
2 | Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, | |
fa10beec | 3 | 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 |
e53a16e7 | 4 | Free Software Foundation, Inc. |
f6db1481 RH |
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 | |
9dcd6f09 | 10 | Software Foundation; either version 3, or (at your option) any later |
f6db1481 RH |
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 | |
9dcd6f09 NC |
19 | along with GCC; see the file COPYING3. If not see |
20 | <http://www.gnu.org/licenses/>. */ | |
f6db1481 RH |
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" | |
f6db1481 RH |
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" | |
ef330312 PB |
81 | #include "tree-inline.h" |
82 | #include "tree-flow.h" | |
2f8e398b | 83 | #include "tree-pass.h" |
9f8628ba | 84 | #include "tree-dump.h" |
6fb5fa3c | 85 | #include "df.h" |
45a80bb9 | 86 | #include "predict.h" |
f6db1481 RH |
87 | |
88 | #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO) | |
89 | #include "dwarf2out.h" | |
90 | #endif | |
91 | ||
97b0ade3 | 92 | #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO) |
f6db1481 RH |
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 | ||
6fb5fa3c DB |
105 | /* This is used for debugging. It allows the current pass to printed |
106 | from anywhere in compilation. */ | |
8ddbbcae | 107 | struct opt_pass *current_pass; |
6fb5fa3c DB |
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 | ||
ef330312 PB |
132 | /* Global variables used to communicate with passes. */ |
133 | int dump_flags; | |
134 | bool in_gimple_form; | |
b02b9b53 | 135 | bool first_pass_instance; |
f6db1481 | 136 | |
f6db1481 RH |
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 | |
0e6df31e GK |
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). | |
f6db1481 | 146 | |
0e6df31e | 147 | DECL is the declaration. TOP_LEVEL is nonzero |
f6db1481 RH |
148 | if this declaration is not within a function. */ |
149 | ||
150 | void | |
151 | rest_of_decl_compilation (tree decl, | |
f6db1481 RH |
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 | ||
0e6df31e GK |
168 | /* Can't defer this, because it needs to happen before any |
169 | later function definitions are processed. */ | |
820cc88f | 170 | if (DECL_ASSEMBLER_NAME_SET_P (decl) && DECL_REGISTER (decl)) |
0e6df31e GK |
171 | make_decl_rtl (decl); |
172 | ||
f6db1481 RH |
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 | ||
f6db1481 RH |
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 | ||
7e8b322a | 183 | We do output all variables and rely on |
f6db1481 RH |
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) | |
cd9c7bd2 | 188 | || DECL_INITIAL (decl)) |
f6db1481 RH |
189 | && !DECL_EXTERNAL (decl)) |
190 | { | |
db5f8b93 | 191 | if (TREE_CODE (decl) != FUNCTION_DECL) |
8a4a83ed | 192 | varpool_finalize_decl (decl); |
f6db1481 RH |
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 | } | |
ef11c839 SB |
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)) | |
f6db1481 RH |
211 | { |
212 | timevar_push (TV_SYMOUT); | |
213 | debug_hooks->type_decl (decl, !top_level); | |
214 | timevar_pop (TV_SYMOUT); | |
215 | } | |
e4d5432a | 216 | |
aabcd309 | 217 | /* Let cgraph know about the existence of variables. */ |
e4d5432a | 218 | if (TREE_CODE (decl) == VAR_DECL && !DECL_EXTERNAL (decl)) |
8a4a83ed | 219 | varpool_node (decl); |
f6db1481 RH |
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 | ||
ef330312 | 237 | \f |
f6db1481 | 238 | |
ef330312 PB |
239 | void |
240 | finish_optimization_passes (void) | |
f6db1481 | 241 | { |
ef330312 PB |
242 | enum tree_dump_index i; |
243 | struct dump_file_info *dfi; | |
244 | char *name; | |
f6db1481 | 245 | |
ef330312 PB |
246 | timevar_push (TV_DUMP); |
247 | if (profile_arc_flag || flag_test_coverage || flag_branch_probabilities) | |
f6db1481 | 248 | { |
8ddbbcae | 249 | dump_file = dump_begin (pass_profile.pass.static_pass_number, NULL); |
ef330312 PB |
250 | end_branch_prob (); |
251 | if (dump_file) | |
8ddbbcae | 252 | dump_end (pass_profile.pass.static_pass_number, dump_file); |
f6db1481 | 253 | } |
f6db1481 | 254 | |
ef330312 | 255 | if (optimize > 0) |
f6db1481 | 256 | { |
8ddbbcae | 257 | dump_file = dump_begin (pass_combine.pass.static_pass_number, NULL); |
ef330312 | 258 | if (dump_file) |
f6db1481 | 259 | { |
ef330312 | 260 | dump_combine_total_stats (dump_file); |
8ddbbcae | 261 | dump_end (pass_combine.pass.static_pass_number, dump_file); |
f6db1481 RH |
262 | } |
263 | } | |
264 | ||
ef330312 PB |
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) | |
5e34206b | 269 | && (dfi->flags & TDF_GRAPH) != 0 |
ef330312 | 270 | && (name = get_dump_file_name (i)) != NULL) |
5e34206b JJ |
271 | { |
272 | finish_graph_dump_file (name); | |
273 | free (name); | |
274 | } | |
f6db1481 | 275 | |
ef330312 | 276 | timevar_pop (TV_DUMP); |
f6db1481 | 277 | } |
f6db1481 | 278 | |
ef330312 PB |
279 | static bool |
280 | gate_rest_of_compilation (void) | |
f6db1481 | 281 | { |
ef330312 PB |
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); | |
f6db1481 RH |
285 | } |
286 | ||
8ddbbcae | 287 | struct gimple_opt_pass pass_rest_of_compilation = |
f6db1481 | 288 | { |
8ddbbcae JH |
289 | { |
290 | GIMPLE_PASS, | |
ef330312 PB |
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 */ | |
8ddbbcae JH |
302 | TODO_ggc_collect /* todo_flags_finish */ |
303 | } | |
ef330312 | 304 | }; |
f6db1481 | 305 | |
ef330312 PB |
306 | static bool |
307 | gate_postreload (void) | |
308 | { | |
309 | return reload_completed; | |
f6db1481 RH |
310 | } |
311 | ||
8ddbbcae | 312 | struct rtl_opt_pass pass_postreload = |
f6db1481 | 313 | { |
8ddbbcae JH |
314 | { |
315 | RTL_PASS, | |
ef330312 PB |
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 */ | |
8ddbbcae JH |
327 | TODO_ggc_collect | TODO_verify_rtl_sharing /* todo_flags_finish */ |
328 | } | |
ef330312 | 329 | }; |
f6db1481 | 330 | |
97b0ade3 | 331 | |
f6db1481 | 332 | |
ef330312 | 333 | /* The root of the compilation pass tree, once constructed. */ |
8ddbbcae | 334 | struct opt_pass *all_passes, *all_ipa_passes, *all_lowering_passes; |
f6db1481 | 335 | |
9fe0cb7d RG |
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 | { | |
d3bfe4de | 349 | passes_by_id = XRESIZEVEC (struct opt_pass *, passes_by_id, id + 1); |
9fe0cb7d RG |
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 | ||
ef330312 PB |
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. */ | |
f6db1481 | 370 | |
ef330312 | 371 | static void |
9e016eba | 372 | register_one_dump_file (struct opt_pass *pass) |
ef330312 PB |
373 | { |
374 | char *dot_name, *flag_name, *glob_name; | |
bbbe4e7b | 375 | const char *prefix; |
ef330312 | 376 | char num[10]; |
9fe0cb7d | 377 | int flags, id; |
f6db1481 | 378 | |
ef330312 PB |
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)); | |
f6db1481 | 384 | |
ef330312 | 385 | dot_name = concat (".", pass->name, num, NULL); |
17653c00 | 386 | if (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS) |
bbbe4e7b | 387 | prefix = "ipa-", flags = TDF_IPA; |
9e016eba | 388 | else if (pass->type == GIMPLE_PASS) |
bbbe4e7b | 389 | prefix = "tree-", flags = TDF_TREE; |
f6db1481 | 390 | else |
bbbe4e7b PB |
391 | prefix = "rtl-", flags = TDF_RTL; |
392 | ||
393 | flag_name = concat (prefix, pass->name, num, NULL); | |
394 | glob_name = concat (prefix, pass->name, NULL); | |
9fe0cb7d RG |
395 | id = dump_register (dot_name, flag_name, glob_name, flags); |
396 | set_pass_for_id (id, pass); | |
97b0ade3 PB |
397 | } |
398 | ||
bbbe4e7b PB |
399 | /* Recursive worker function for register_dump_files. */ |
400 | ||
ef330312 | 401 | static int |
9e016eba | 402 | register_dump_files_1 (struct opt_pass *pass, int properties) |
97b0ade3 | 403 | { |
ef330312 PB |
404 | do |
405 | { | |
bbbe4e7b PB |
406 | int new_properties = (properties | pass->properties_provided) |
407 | & ~pass->properties_destroyed; | |
f6db1481 | 408 | |
8e352cd3 | 409 | if (pass->name && pass->name[0] != '*') |
9e016eba | 410 | register_one_dump_file (pass); |
f6db1481 | 411 | |
ef330312 | 412 | if (pass->sub) |
9e016eba | 413 | new_properties = register_dump_files_1 (pass->sub, new_properties); |
f6db1481 | 414 | |
ef330312 PB |
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; | |
f6db1481 | 421 | |
ef330312 | 422 | pass = pass->next; |
f6db1481 | 423 | } |
ef330312 | 424 | while (pass); |
f6db1481 | 425 | |
ef330312 | 426 | return properties; |
f6db1481 | 427 | } |
f9957958 | 428 | |
9e016eba JH |
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. */ | |
bbbe4e7b PB |
432 | |
433 | static void | |
9e016eba | 434 | register_dump_files (struct opt_pass *pass,int properties) |
bbbe4e7b PB |
435 | { |
436 | pass->properties_required |= properties; | |
9e016eba | 437 | register_dump_files_1 (pass, properties); |
bbbe4e7b PB |
438 | } |
439 | ||
ef330312 PB |
440 | /* Add a pass to the pass list. Duplicate the pass if it's already |
441 | in the list. */ | |
f9957958 | 442 | |
8ddbbcae JH |
443 | static struct opt_pass ** |
444 | next_pass_1 (struct opt_pass **list, struct opt_pass *pass) | |
f6db1481 | 445 | { |
ef330312 PB |
446 | /* A nonzero static_pass_number indicates that the |
447 | pass is already in the list. */ | |
448 | if (pass->static_pass_number) | |
449 | { | |
82d6e6fc | 450 | struct opt_pass *new_pass; |
f6db1481 | 451 | |
82d6e6fc KG |
452 | new_pass = XNEW (struct opt_pass); |
453 | memcpy (new_pass, pass, sizeof (*new_pass)); | |
454 | new_pass->next = NULL; | |
f6db1481 | 455 | |
82d6e6fc | 456 | new_pass->todo_flags_start &= ~TODO_mark_first_instance; |
b02b9b53 | 457 | |
ef330312 PB |
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; | |
82d6e6fc | 465 | new_pass->static_pass_number = -pass->static_pass_number; |
ef330312 PB |
466 | } |
467 | ||
82d6e6fc | 468 | *list = new_pass; |
ef330312 PB |
469 | } |
470 | else | |
471 | { | |
b02b9b53 | 472 | pass->todo_flags_start |= TODO_mark_first_instance; |
ef330312 PB |
473 | pass->static_pass_number = -1; |
474 | *list = pass; | |
475 | } | |
476 | ||
477 | return &(*list)->next; | |
478 | ||
f6db1481 RH |
479 | } |
480 | ||
6fb5fa3c | 481 | |
dd97d271 DN |
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) | |
e89d6010 | 497 | tree_rest_of_compilation (DECL (N)) -> all_passes |
dd97d271 | 498 | */ |
97b0ade3 | 499 | |
ef330312 PB |
500 | void |
501 | init_optimization_passes (void) | |
502 | { | |
8ddbbcae | 503 | struct opt_pass **p; |
ef330312 | 504 | |
8ddbbcae | 505 | #define NEXT_PASS(PASS) (p = next_pass_1 (p, &((PASS).pass))) |
873aa8f5 | 506 | |
f1bd2543 JH |
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. */ | |
ef330312 PB |
511 | p = &all_lowering_passes; |
512 | NEXT_PASS (pass_remove_useless_stmts); | |
513 | NEXT_PASS (pass_mudflap_1); | |
953ff289 | 514 | NEXT_PASS (pass_lower_omp); |
ef330312 | 515 | NEXT_PASS (pass_lower_cf); |
a24549d4 | 516 | NEXT_PASS (pass_refactor_eh); |
ef330312 PB |
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); | |
2dee695b | 522 | NEXT_PASS (pass_build_cgraph_edges); |
873aa8f5 | 523 | NEXT_PASS (pass_inline_parameters); |
ef330312 PB |
524 | *p = NULL; |
525 | ||
7e8b322a | 526 | /* Interprocedural optimization passes. */ |
f1bd2543 JH |
527 | p = &all_ipa_passes; |
528 | NEXT_PASS (pass_ipa_function_and_variable_visibility); | |
529 | NEXT_PASS (pass_ipa_early_inline); | |
530 | { | |
8ddbbcae | 531 | struct opt_pass **p = &pass_ipa_early_inline.pass.sub; |
f1bd2543 JH |
532 | NEXT_PASS (pass_early_inline); |
533 | NEXT_PASS (pass_inline_parameters); | |
534 | NEXT_PASS (pass_rebuild_cgraph_edges); | |
535 | } | |
536 | NEXT_PASS (pass_early_local_passes); | |
537 | { | |
8ddbbcae | 538 | struct opt_pass **p = &pass_early_local_passes.pass.sub; |
f1bd2543 JH |
539 | NEXT_PASS (pass_tree_profile); |
540 | NEXT_PASS (pass_cleanup_cfg); | |
541 | NEXT_PASS (pass_init_datastructures); | |
542 | NEXT_PASS (pass_expand_omp); | |
c72321c9 JH |
543 | |
544 | NEXT_PASS (pass_referenced_vars); | |
545 | NEXT_PASS (pass_reset_cc_flags); | |
546 | NEXT_PASS (pass_build_ssa); | |
2dc74010 | 547 | NEXT_PASS (pass_early_warn_uninitialized); |
f1bd2543 JH |
548 | NEXT_PASS (pass_all_early_optimizations); |
549 | { | |
8ddbbcae | 550 | struct opt_pass **p = &pass_all_early_optimizations.pass.sub; |
f1bd2543 JH |
551 | NEXT_PASS (pass_rebuild_cgraph_edges); |
552 | NEXT_PASS (pass_early_inline); | |
f1bd2543 JH |
553 | NEXT_PASS (pass_rename_ssa_copies); |
554 | NEXT_PASS (pass_ccp); | |
555 | NEXT_PASS (pass_forwprop); | |
201b2ead | 556 | NEXT_PASS (pass_update_address_taken); |
029f45bd | 557 | NEXT_PASS (pass_sra_early); |
f1bd2543 JH |
558 | NEXT_PASS (pass_copy_prop); |
559 | NEXT_PASS (pass_merge_phi); | |
11b08ee9 | 560 | NEXT_PASS (pass_cd_dce); |
201b2ead | 561 | NEXT_PASS (pass_simple_dse); |
f1bd2543 | 562 | NEXT_PASS (pass_tail_recursion); |
b6e99746 | 563 | NEXT_PASS (pass_convert_switch); |
45a80bb9 | 564 | NEXT_PASS (pass_profile); |
f1bd2543 | 565 | } |
c72321c9 | 566 | NEXT_PASS (pass_release_ssa_names); |
f1bd2543 | 567 | NEXT_PASS (pass_rebuild_cgraph_edges); |
b91bc349 | 568 | NEXT_PASS (pass_inline_parameters); |
f1bd2543 JH |
569 | } |
570 | NEXT_PASS (pass_ipa_increase_alignment); | |
43d861a5 | 571 | NEXT_PASS (pass_ipa_matrix_reorg); |
f1bd2543 JH |
572 | NEXT_PASS (pass_ipa_cp); |
573 | NEXT_PASS (pass_ipa_inline); | |
574 | NEXT_PASS (pass_ipa_reference); | |
575 | NEXT_PASS (pass_ipa_pure_const); | |
576 | NEXT_PASS (pass_ipa_type_escape); | |
577 | NEXT_PASS (pass_ipa_pta); | |
e1dc98b2 | 578 | NEXT_PASS (pass_ipa_struct_reorg); |
7a388ee4 JH |
579 | *p = NULL; |
580 | ||
b3f7d793 DN |
581 | /* These passes are run after IPA passes on every function that is being |
582 | output to the assembler file. */ | |
ef330312 | 583 | p = &all_passes; |
ef330312 | 584 | NEXT_PASS (pass_all_optimizations); |
f1bd2543 | 585 | { |
8ddbbcae | 586 | struct opt_pass **p = &pass_all_optimizations.pass.sub; |
11b08ee9 RG |
587 | /* Initial scalar cleanups before alias computation. |
588 | They ensure memory accesses are not indirect wherever possible. */ | |
7299cb99 | 589 | NEXT_PASS (pass_strip_predict_hints); |
11b08ee9 | 590 | NEXT_PASS (pass_update_address_taken); |
f1bd2543 | 591 | NEXT_PASS (pass_rename_ssa_copies); |
d6e840ee | 592 | NEXT_PASS (pass_complete_unrolli); |
f1bd2543 | 593 | NEXT_PASS (pass_ccp); |
e2081a1d | 594 | NEXT_PASS (pass_forwprop); |
11b08ee9 RG |
595 | /* Ideally the function call conditional |
596 | dead code elimination phase can be delayed | |
597 | till later where potentially more opportunities | |
598 | can be found. Due to lack of good ways to | |
599 | update VDEFs associated with the shrink-wrapped | |
600 | calls, it is better to do the transformation | |
601 | here where memory SSA is not built yet. */ | |
602 | NEXT_PASS (pass_call_cdce); | |
603 | /* pass_build_alias is a dummy pass that ensures that we | |
604 | execute TODO_rebuild_alias at this point. Re-building | |
605 | alias information also rewrites no longer addressed | |
606 | locals into SSA form if possible. */ | |
607 | NEXT_PASS (pass_build_alias); | |
608 | NEXT_PASS (pass_return_slot); | |
3b48ccbc | 609 | NEXT_PASS (pass_phiprop); |
f1bd2543 | 610 | NEXT_PASS (pass_fre); |
f1bd2543 JH |
611 | NEXT_PASS (pass_copy_prop); |
612 | NEXT_PASS (pass_merge_phi); | |
613 | NEXT_PASS (pass_vrp); | |
614 | NEXT_PASS (pass_dce); | |
a5828d1e | 615 | NEXT_PASS (pass_cselim); |
18d08014 | 616 | NEXT_PASS (pass_tree_ifcombine); |
f1bd2543 | 617 | NEXT_PASS (pass_phiopt); |
f1bd2543 | 618 | NEXT_PASS (pass_tail_recursion); |
f1bd2543 JH |
619 | NEXT_PASS (pass_ch); |
620 | NEXT_PASS (pass_stdarg); | |
621 | NEXT_PASS (pass_lower_complex); | |
622 | NEXT_PASS (pass_sra); | |
f1bd2543 JH |
623 | NEXT_PASS (pass_rename_ssa_copies); |
624 | NEXT_PASS (pass_dominator); | |
f1bd2543 JH |
625 | /* The only const/copy propagation opportunities left after |
626 | DOM should be due to degenerate PHI nodes. So rather than | |
627 | run the full propagators, run a specialized pass which | |
628 | only examines PHIs to discover const/copy propagation | |
629 | opportunities. */ | |
630 | NEXT_PASS (pass_phi_only_cprop); | |
25c6036a | 631 | NEXT_PASS (pass_dse); |
f1bd2543 JH |
632 | NEXT_PASS (pass_reassoc); |
633 | NEXT_PASS (pass_dce); | |
f1bd2543 JH |
634 | NEXT_PASS (pass_forwprop); |
635 | NEXT_PASS (pass_phiopt); | |
636 | NEXT_PASS (pass_object_sizes); | |
a4b8a65f | 637 | NEXT_PASS (pass_ccp); |
324d2217 | 638 | NEXT_PASS (pass_copy_prop); |
f1bd2543 JH |
639 | NEXT_PASS (pass_fold_builtins); |
640 | NEXT_PASS (pass_cse_sincos); | |
f1bd2543 JH |
641 | NEXT_PASS (pass_split_crit_edges); |
642 | NEXT_PASS (pass_pre); | |
f1bd2543 JH |
643 | NEXT_PASS (pass_sink_code); |
644 | NEXT_PASS (pass_tree_loop); | |
645 | { | |
8ddbbcae | 646 | struct opt_pass **p = &pass_tree_loop.pass.sub; |
f1bd2543 JH |
647 | NEXT_PASS (pass_tree_loop_init); |
648 | NEXT_PASS (pass_copy_prop); | |
bbc8a8dc | 649 | NEXT_PASS (pass_dce_loop); |
f1bd2543 | 650 | NEXT_PASS (pass_lim); |
bbc8a8dc | 651 | NEXT_PASS (pass_predcom); |
f1bd2543 JH |
652 | NEXT_PASS (pass_tree_unswitch); |
653 | NEXT_PASS (pass_scev_cprop); | |
654 | NEXT_PASS (pass_empty_loop); | |
655 | NEXT_PASS (pass_record_bounds); | |
3d8864c0 | 656 | NEXT_PASS (pass_check_data_deps); |
dea61d92 | 657 | NEXT_PASS (pass_loop_distribution); |
f1bd2543 | 658 | NEXT_PASS (pass_linear_transform); |
f8bf9252 | 659 | NEXT_PASS (pass_graphite_transforms); |
f1bd2543 JH |
660 | NEXT_PASS (pass_iv_canon); |
661 | NEXT_PASS (pass_if_conversion); | |
662 | NEXT_PASS (pass_vectorize); | |
663 | { | |
8ddbbcae | 664 | struct opt_pass **p = &pass_vectorize.pass.sub; |
f1bd2543 JH |
665 | NEXT_PASS (pass_lower_vector_ssa); |
666 | NEXT_PASS (pass_dce_loop); | |
667 | } | |
f1bd2543 | 668 | NEXT_PASS (pass_complete_unroll); |
5f40b3cb | 669 | NEXT_PASS (pass_parallelize_loops); |
f1bd2543 JH |
670 | NEXT_PASS (pass_loop_prefetch); |
671 | NEXT_PASS (pass_iv_optimize); | |
672 | NEXT_PASS (pass_tree_loop_done); | |
673 | } | |
674 | NEXT_PASS (pass_cse_reciprocals); | |
6b889d89 | 675 | NEXT_PASS (pass_convert_to_rsqrt); |
f1bd2543 JH |
676 | NEXT_PASS (pass_reassoc); |
677 | NEXT_PASS (pass_vrp); | |
678 | NEXT_PASS (pass_dominator); | |
f1bd2543 JH |
679 | /* The only const/copy propagation opportunities left after |
680 | DOM should be due to degenerate PHI nodes. So rather than | |
681 | run the full propagators, run a specialized pass which | |
682 | only examines PHIs to discover const/copy propagation | |
683 | opportunities. */ | |
684 | NEXT_PASS (pass_phi_only_cprop); | |
f1bd2543 | 685 | NEXT_PASS (pass_cd_dce); |
232abc3f | 686 | NEXT_PASS (pass_tracer); |
f1bd2543 JH |
687 | |
688 | /* FIXME: If DCE is not run before checking for uninitialized uses, | |
689 | we may get false warnings (e.g., testsuite/gcc.dg/uninit-5.c). | |
690 | However, this also causes us to misdiagnose cases that should be | |
691 | real warnings (e.g., testsuite/gcc.dg/pr18501.c). | |
692 | ||
693 | To fix the false positives in uninit-5.c, we would have to | |
694 | account for the predicates protecting the set and the use of each | |
695 | variable. Using a representation like Gated Single Assignment | |
696 | may help. */ | |
697 | NEXT_PASS (pass_late_warn_uninitialized); | |
698 | NEXT_PASS (pass_dse); | |
699 | NEXT_PASS (pass_forwprop); | |
700 | NEXT_PASS (pass_phiopt); | |
701 | NEXT_PASS (pass_tail_calls); | |
702 | NEXT_PASS (pass_rename_ssa_copies); | |
703 | NEXT_PASS (pass_uncprop); | |
f1bd2543 | 704 | } |
c72321c9 JH |
705 | NEXT_PASS (pass_del_ssa); |
706 | NEXT_PASS (pass_nrv); | |
707 | NEXT_PASS (pass_mark_used_blocks); | |
708 | NEXT_PASS (pass_cleanup_cfg_post_optimizing); | |
709 | ||
ef330312 | 710 | NEXT_PASS (pass_warn_function_noreturn); |
ef330312 | 711 | NEXT_PASS (pass_free_datastructures); |
ed1a2abd | 712 | NEXT_PASS (pass_mudflap_2); |
726a989a | 713 | |
ef330312 PB |
714 | NEXT_PASS (pass_free_cfg_annotations); |
715 | NEXT_PASS (pass_expand); | |
716 | NEXT_PASS (pass_rest_of_compilation); | |
f1bd2543 | 717 | { |
8ddbbcae | 718 | struct opt_pass **p = &pass_rest_of_compilation.pass.sub; |
f1bd2543 JH |
719 | NEXT_PASS (pass_init_function); |
720 | NEXT_PASS (pass_jump); | |
f1bd2543 JH |
721 | NEXT_PASS (pass_rtl_eh); |
722 | NEXT_PASS (pass_initial_value_sets); | |
723 | NEXT_PASS (pass_unshare_all_rtl); | |
724 | NEXT_PASS (pass_instantiate_virtual_regs); | |
dacb3cda | 725 | NEXT_PASS (pass_into_cfg_layout_mode); |
f1bd2543 JH |
726 | NEXT_PASS (pass_jump2); |
727 | NEXT_PASS (pass_lower_subreg); | |
6fb5fa3c | 728 | NEXT_PASS (pass_df_initialize_opt); |
f1bd2543 JH |
729 | NEXT_PASS (pass_cse); |
730 | NEXT_PASS (pass_rtl_fwprop); | |
731 | NEXT_PASS (pass_gcse); | |
f1bd2543 | 732 | NEXT_PASS (pass_rtl_ifcvt); |
f1bd2543 JH |
733 | /* Perform loop optimizations. It might be better to do them a bit |
734 | sooner, but we want the profile feedback to work more | |
735 | efficiently. */ | |
736 | NEXT_PASS (pass_loop2); | |
737 | { | |
8ddbbcae | 738 | struct opt_pass **p = &pass_loop2.pass.sub; |
f1bd2543 JH |
739 | NEXT_PASS (pass_rtl_loop_init); |
740 | NEXT_PASS (pass_rtl_move_loop_invariants); | |
741 | NEXT_PASS (pass_rtl_unswitch); | |
742 | NEXT_PASS (pass_rtl_unroll_and_peel_loops); | |
743 | NEXT_PASS (pass_rtl_doloop); | |
744 | NEXT_PASS (pass_rtl_loop_done); | |
745 | *p = NULL; | |
746 | } | |
747 | NEXT_PASS (pass_web); | |
bae8b6b2 | 748 | NEXT_PASS (pass_jump_bypass); |
f1bd2543 | 749 | NEXT_PASS (pass_cse2); |
6fb5fa3c | 750 | NEXT_PASS (pass_rtl_dse1); |
f1bd2543 | 751 | NEXT_PASS (pass_rtl_fwprop_addr); |
6fb5fa3c DB |
752 | NEXT_PASS (pass_regclass_init); |
753 | NEXT_PASS (pass_inc_dec); | |
754 | NEXT_PASS (pass_initialize_regs); | |
ad21dab7 | 755 | NEXT_PASS (pass_outof_cfg_layout_mode); |
6fb5fa3c | 756 | NEXT_PASS (pass_ud_rtl_dce); |
f1bd2543 JH |
757 | NEXT_PASS (pass_combine); |
758 | NEXT_PASS (pass_if_after_combine); | |
759 | NEXT_PASS (pass_partition_blocks); | |
760 | NEXT_PASS (pass_regmove); | |
761 | NEXT_PASS (pass_split_all_insns); | |
762 | NEXT_PASS (pass_lower_subreg2); | |
6fb5fa3c DB |
763 | NEXT_PASS (pass_df_initialize_no_opt); |
764 | NEXT_PASS (pass_stack_ptr_mod); | |
f1bd2543 JH |
765 | NEXT_PASS (pass_mode_switching); |
766 | NEXT_PASS (pass_see); | |
d8d72314 | 767 | NEXT_PASS (pass_match_asm_constraints); |
f1bd2543 JH |
768 | NEXT_PASS (pass_sms); |
769 | NEXT_PASS (pass_sched); | |
6fb5fa3c | 770 | NEXT_PASS (pass_subregs_of_mode_init); |
f1bd2543 JH |
771 | NEXT_PASS (pass_local_alloc); |
772 | NEXT_PASS (pass_global_alloc); | |
058e97ec | 773 | NEXT_PASS (pass_ira); |
6fb5fa3c | 774 | NEXT_PASS (pass_subregs_of_mode_finish); |
f1bd2543 JH |
775 | NEXT_PASS (pass_postreload); |
776 | { | |
8ddbbcae | 777 | struct opt_pass **p = &pass_postreload.pass.sub; |
f1bd2543 JH |
778 | NEXT_PASS (pass_postreload_cse); |
779 | NEXT_PASS (pass_gcse2); | |
6fb5fa3c DB |
780 | NEXT_PASS (pass_split_after_reload); |
781 | NEXT_PASS (pass_branch_target_load_optimize1); | |
782 | NEXT_PASS (pass_thread_prologue_and_epilogue); | |
783 | NEXT_PASS (pass_rtl_dse2); | |
f1bd2543 JH |
784 | NEXT_PASS (pass_rtl_seqabstr); |
785 | NEXT_PASS (pass_stack_adjustments); | |
786 | NEXT_PASS (pass_peephole2); | |
787 | NEXT_PASS (pass_if_after_reload); | |
788 | NEXT_PASS (pass_regrename); | |
6fb5fa3c DB |
789 | NEXT_PASS (pass_cprop_hardreg); |
790 | NEXT_PASS (pass_fast_rtl_dce); | |
f1bd2543 | 791 | NEXT_PASS (pass_reorder_blocks); |
6fb5fa3c | 792 | NEXT_PASS (pass_branch_target_load_optimize2); |
f1bd2543 | 793 | NEXT_PASS (pass_leaf_regs); |
6fb5fa3c | 794 | NEXT_PASS (pass_split_before_sched2); |
f1bd2543 | 795 | NEXT_PASS (pass_sched2); |
f1bd2543 | 796 | NEXT_PASS (pass_stack_regs); |
6fb5fa3c | 797 | { |
8ddbbcae | 798 | struct opt_pass **p = &pass_stack_regs.pass.sub; |
6fb5fa3c DB |
799 | NEXT_PASS (pass_split_before_regstack); |
800 | NEXT_PASS (pass_stack_regs_run); | |
801 | } | |
f1bd2543 JH |
802 | NEXT_PASS (pass_compute_alignments); |
803 | NEXT_PASS (pass_duplicate_computed_gotos); | |
804 | NEXT_PASS (pass_variable_tracking); | |
805 | NEXT_PASS (pass_free_cfg); | |
806 | NEXT_PASS (pass_machine_reorg); | |
807 | NEXT_PASS (pass_cleanup_barriers); | |
808 | NEXT_PASS (pass_delay_slots); | |
809 | NEXT_PASS (pass_split_for_shorten_branches); | |
810 | NEXT_PASS (pass_convert_to_eh_region_ranges); | |
811 | NEXT_PASS (pass_shorten_branches); | |
812 | NEXT_PASS (pass_set_nothrow_function_flags); | |
813 | NEXT_PASS (pass_final); | |
814 | } | |
0b738568 | 815 | NEXT_PASS (pass_df_finish); |
f1bd2543 | 816 | } |
ef330312 PB |
817 | NEXT_PASS (pass_clean_state); |
818 | *p = NULL; | |
819 | ||
ef330312 PB |
820 | #undef NEXT_PASS |
821 | ||
822 | /* Register the passes with the tree dump code. */ | |
9e016eba | 823 | register_dump_files (all_lowering_passes, PROP_gimple_any); |
a5093353 | 824 | all_lowering_passes->todo_flags_start |= TODO_set_props; |
9e016eba | 825 | register_dump_files (all_ipa_passes, |
bbbe4e7b PB |
826 | PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh |
827 | | PROP_cfg); | |
9e016eba | 828 | register_dump_files (all_passes, |
bbbe4e7b PB |
829 | PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh |
830 | | PROP_cfg); | |
ef330312 PB |
831 | } |
832 | ||
a5093353 JH |
833 | /* If we are in IPA mode (i.e., current_function_decl is NULL), call |
834 | function CALLBACK for every function in the call graph. Otherwise, | |
835 | call CALLBACK on the current function. */ | |
bbbe4e7b | 836 | |
ef330312 | 837 | static void |
a5093353 | 838 | do_per_function (void (*callback) (void *data), void *data) |
ef330312 | 839 | { |
a5093353 JH |
840 | if (current_function_decl) |
841 | callback (data); | |
842 | else | |
843 | { | |
844 | struct cgraph_node *node; | |
845 | for (node = cgraph_nodes; node; node = node->next) | |
846 | if (node->analyzed) | |
847 | { | |
848 | push_cfun (DECL_STRUCT_FUNCTION (node->decl)); | |
849 | current_function_decl = node->decl; | |
850 | callback (data); | |
851 | free_dominance_info (CDI_DOMINATORS); | |
852 | free_dominance_info (CDI_POST_DOMINATORS); | |
853 | current_function_decl = NULL; | |
854 | pop_cfun (); | |
855 | ggc_collect (); | |
856 | } | |
857 | } | |
858 | } | |
859 | ||
873aa8f5 JH |
860 | /* Because inlining might remove no-longer reachable nodes, we need to |
861 | keep the array visible to garbage collector to avoid reading collected | |
862 | out nodes. */ | |
863 | static int nnodes; | |
864 | static GTY ((length ("nnodes"))) struct cgraph_node **order; | |
865 | ||
866 | /* If we are in IPA mode (i.e., current_function_decl is NULL), call | |
867 | function CALLBACK for every function in the call graph. Otherwise, | |
868 | call CALLBACK on the current function. */ | |
869 | ||
870 | static void | |
871 | do_per_function_toporder (void (*callback) (void *data), void *data) | |
872 | { | |
873 | int i; | |
874 | ||
875 | if (current_function_decl) | |
876 | callback (data); | |
877 | else | |
878 | { | |
879 | gcc_assert (!order); | |
d3bfe4de | 880 | order = GGC_NEWVEC (struct cgraph_node *, cgraph_n_nodes); |
873aa8f5 JH |
881 | nnodes = cgraph_postorder (order); |
882 | for (i = nnodes - 1; i >= 0; i--) | |
883 | { | |
884 | struct cgraph_node *node = order[i]; | |
885 | ||
886 | /* Allow possibly removed nodes to be garbage collected. */ | |
887 | order[i] = NULL; | |
888 | if (node->analyzed && (node->needed || node->reachable)) | |
889 | { | |
890 | push_cfun (DECL_STRUCT_FUNCTION (node->decl)); | |
891 | current_function_decl = node->decl; | |
892 | callback (data); | |
893 | free_dominance_info (CDI_DOMINATORS); | |
894 | free_dominance_info (CDI_POST_DOMINATORS); | |
895 | current_function_decl = NULL; | |
896 | pop_cfun (); | |
897 | ggc_collect (); | |
898 | } | |
899 | } | |
900 | } | |
901 | ggc_free (order); | |
902 | order = NULL; | |
903 | nnodes = 0; | |
904 | } | |
905 | ||
a5093353 | 906 | /* Perform all TODO actions that ought to be done on each function. */ |
ef330312 | 907 | |
a5093353 JH |
908 | static void |
909 | execute_function_todo (void *data) | |
910 | { | |
911 | unsigned int flags = (size_t)data; | |
912 | if (cfun->curr_properties & PROP_ssa) | |
bbbe4e7b | 913 | flags |= TODO_verify_ssa; |
a5093353 | 914 | flags &= ~cfun->last_verified; |
bbbe4e7b PB |
915 | if (!flags) |
916 | return; | |
9fe0cb7d RG |
917 | |
918 | statistics_fini_pass (); | |
919 | ||
1994bfea | 920 | /* Always cleanup the CFG before trying to update SSA. */ |
ef330312 PB |
921 | if (flags & TODO_cleanup_cfg) |
922 | { | |
592c303d | 923 | bool cleanup = cleanup_tree_cfg (); |
c4f548b8 | 924 | |
1994bfea JH |
925 | if (cleanup && (cfun->curr_properties & PROP_ssa)) |
926 | flags |= TODO_remove_unused_locals; | |
927 | ||
c4f548b8 DN |
928 | /* When cleanup_tree_cfg merges consecutive blocks, it may |
929 | perform some simplistic propagation when removing single | |
930 | valued PHI nodes. This propagation may, in turn, cause the | |
931 | SSA form to become out-of-date (see PR 22037). So, even | |
932 | if the parent pass had not scheduled an SSA update, we may | |
933 | still need to do one. */ | |
934 | if (!(flags & TODO_update_ssa_any) && need_ssa_update_p ()) | |
935 | flags |= TODO_update_ssa; | |
ef330312 | 936 | } |
f6db1481 | 937 | |
563cb6be DN |
938 | if (flags & TODO_update_ssa_any) |
939 | { | |
940 | unsigned update_flags = flags & TODO_update_ssa_any; | |
941 | update_ssa (update_flags); | |
a5093353 | 942 | cfun->last_verified &= ~TODO_verify_ssa; |
563cb6be | 943 | } |
7b0e48fb DB |
944 | |
945 | if (flags & TODO_rebuild_alias) | |
946 | { | |
947 | compute_may_aliases (); | |
948 | cfun->curr_properties |= PROP_alias; | |
949 | } | |
950 | ||
3f519b35 RG |
951 | if (flags & TODO_remove_unused_locals) |
952 | remove_unused_locals (); | |
953 | ||
726a989a | 954 | if ((flags & TODO_dump_func) && dump_file && current_function_decl) |
ef330312 | 955 | { |
a5093353 | 956 | if (cfun->curr_properties & PROP_trees) |
726a989a | 957 | dump_function_to_file (current_function_decl, dump_file, dump_flags); |
a68e7e6c | 958 | else |
5e34206b | 959 | { |
a68e7e6c PB |
960 | if (dump_flags & TDF_SLIM) |
961 | print_rtl_slim_with_bb (dump_file, get_insns (), dump_flags); | |
a5093353 JH |
962 | else if ((cfun->curr_properties & PROP_cfg) |
963 | && (dump_flags & TDF_BLOCKS)) | |
a68e7e6c PB |
964 | print_rtl_with_bb (dump_file, get_insns ()); |
965 | else | |
966 | print_rtl (dump_file, get_insns ()); | |
967 | ||
726a989a | 968 | if ((cfun->curr_properties & PROP_cfg) |
a68e7e6c | 969 | && graph_dump_format != no_graph |
5e34206b JJ |
970 | && (dump_flags & TDF_GRAPH)) |
971 | print_rtl_graph_with_bb (dump_file_name, get_insns ()); | |
972 | } | |
ef330312 PB |
973 | |
974 | /* Flush the file. If verification fails, we won't be able to | |
975 | close the file before aborting. */ | |
976 | fflush (dump_file); | |
977 | } | |
a5093353 | 978 | |
45a80bb9 JH |
979 | if (flags & TODO_rebuild_frequencies) |
980 | { | |
981 | if (profile_status == PROFILE_GUESSED) | |
982 | { | |
983 | loop_optimizer_init (0); | |
984 | add_noreturn_fake_exit_edges (); | |
985 | mark_irreducible_loops (); | |
986 | connect_infinite_loops_to_exit (); | |
987 | estimate_bb_frequencies (); | |
988 | remove_fake_exit_edges (); | |
989 | loop_optimizer_finalize (); | |
990 | } | |
991 | else if (profile_status == PROFILE_READ) | |
992 | counts_to_freqs (); | |
993 | else | |
994 | gcc_unreachable (); | |
995 | } | |
996 | ||
a5093353 JH |
997 | #if defined ENABLE_CHECKING |
998 | if (flags & TODO_verify_ssa) | |
999 | verify_ssa (true); | |
1000 | if (flags & TODO_verify_flow) | |
1001 | verify_flow_info (); | |
1002 | if (flags & TODO_verify_stmts) | |
1003 | verify_stmts (); | |
1004 | if (flags & TODO_verify_loops) | |
1005 | verify_loop_closed_ssa (); | |
a36b8a1e JH |
1006 | if (flags & TODO_verify_rtl_sharing) |
1007 | verify_rtl_sharing (); | |
a5093353 JH |
1008 | #endif |
1009 | ||
1010 | cfun->last_verified = flags & TODO_verify_all; | |
1011 | } | |
1012 | ||
1013 | /* Perform all TODO actions. */ | |
1014 | static void | |
1015 | execute_todo (unsigned int flags) | |
1016 | { | |
1017 | #if defined ENABLE_CHECKING | |
1018 | if (need_ssa_update_p ()) | |
1019 | gcc_assert (flags & TODO_update_ssa_any); | |
1020 | #endif | |
1021 | ||
b02b9b53 ZD |
1022 | /* Inform the pass whether it is the first time it is run. */ |
1023 | first_pass_instance = (flags & TODO_mark_first_instance) != 0; | |
1024 | ||
a5093353 JH |
1025 | do_per_function (execute_function_todo, (void *)(size_t) flags); |
1026 | ||
f4b3ca72 JH |
1027 | /* Always remove functions just as before inlining: IPA passes might be |
1028 | interested to see bodies of extern inline functions that are not inlined | |
1029 | to analyze side effects. The full removal is done just at the end | |
1030 | of IPA pass queue. */ | |
1031 | if (flags & TODO_remove_functions) | |
a12f79f5 JH |
1032 | { |
1033 | gcc_assert (!cfun); | |
1034 | cgraph_remove_unreachable_nodes (true, dump_file); | |
1035 | } | |
f4b3ca72 | 1036 | |
726a989a | 1037 | if ((flags & TODO_dump_cgraph) && dump_file && !current_function_decl) |
ef330312 | 1038 | { |
a12f79f5 | 1039 | gcc_assert (!cfun); |
ef330312 PB |
1040 | dump_cgraph (dump_file); |
1041 | /* Flush the file. If verification fails, we won't be able to | |
1042 | close the file before aborting. */ | |
1043 | fflush (dump_file); | |
1044 | } | |
f6db1481 | 1045 | |
ef330312 | 1046 | if (flags & TODO_ggc_collect) |
726a989a | 1047 | ggc_collect (); |
6fb5fa3c DB |
1048 | |
1049 | /* Now that the dumping has been done, we can get rid of the optional | |
1050 | df problems. */ | |
1051 | if (flags & TODO_df_finish) | |
0d475361 | 1052 | df_finish_pass ((flags & TODO_df_verify) != 0); |
a5093353 | 1053 | } |
97b0ade3 | 1054 | |
6ac01510 ILT |
1055 | /* Verify invariants that should hold between passes. This is a place |
1056 | to put simple sanity checks. */ | |
1057 | ||
1058 | static void | |
1059 | verify_interpass_invariants (void) | |
1060 | { | |
1061 | #ifdef ENABLE_CHECKING | |
1062 | gcc_assert (!fold_deferring_overflow_warnings_p ()); | |
1063 | #endif | |
1064 | } | |
1065 | ||
a5093353 JH |
1066 | /* Clear the last verified flag. */ |
1067 | ||
1068 | static void | |
1069 | clear_last_verified (void *data ATTRIBUTE_UNUSED) | |
1070 | { | |
1071 | cfun->last_verified = 0; | |
1072 | } | |
1073 | ||
1074 | /* Helper function. Verify that the properties has been turn into the | |
1075 | properties expected by the pass. */ | |
bbbe4e7b | 1076 | |
582fd9ce | 1077 | #ifdef ENABLE_CHECKING |
a5093353 JH |
1078 | static void |
1079 | verify_curr_properties (void *data) | |
1080 | { | |
1081 | unsigned int props = (size_t)data; | |
1082 | gcc_assert ((cfun->curr_properties & props) == props); | |
1083 | } | |
582fd9ce | 1084 | #endif |
a5093353 | 1085 | |
17653c00 JH |
1086 | /* Initialize pass dump file. */ |
1087 | ||
1088 | static bool | |
1089 | pass_init_dump_file (struct opt_pass *pass) | |
1090 | { | |
1091 | /* If a dump file name is present, open it if enabled. */ | |
1092 | if (pass->static_pass_number != -1) | |
1093 | { | |
1094 | bool initializing_dump = !dump_initialized_p (pass->static_pass_number); | |
1095 | dump_file_name = get_dump_file_name (pass->static_pass_number); | |
1096 | dump_file = dump_begin (pass->static_pass_number, &dump_flags); | |
1097 | if (dump_file && current_function_decl) | |
1098 | { | |
1099 | const char *dname, *aname; | |
1100 | dname = lang_hooks.decl_printable_name (current_function_decl, 2); | |
1101 | aname = (IDENTIFIER_POINTER | |
1102 | (DECL_ASSEMBLER_NAME (current_function_decl))); | |
3716f233 | 1103 | fprintf (dump_file, "\n;; Function %s (%s)%s\n\n", dname, aname, |
17653c00 JH |
1104 | cfun->function_frequency == FUNCTION_FREQUENCY_HOT |
1105 | ? " (hot)" | |
1106 | : cfun->function_frequency == FUNCTION_FREQUENCY_UNLIKELY_EXECUTED | |
1107 | ? " (unlikely executed)" | |
1108 | : ""); | |
1109 | } | |
1110 | return initializing_dump; | |
1111 | } | |
1112 | else | |
1113 | return false; | |
1114 | } | |
1115 | ||
1116 | /* Flush PASS dump file. */ | |
1117 | ||
1118 | static void | |
1119 | pass_fini_dump_file (struct opt_pass *pass) | |
1120 | { | |
1121 | /* Flush and close dump file. */ | |
1122 | if (dump_file_name) | |
1123 | { | |
1124 | free (CONST_CAST (char *, dump_file_name)); | |
1125 | dump_file_name = NULL; | |
1126 | } | |
1127 | ||
1128 | if (dump_file) | |
1129 | { | |
1130 | dump_end (pass->static_pass_number, dump_file); | |
1131 | dump_file = NULL; | |
1132 | } | |
1133 | } | |
1134 | ||
a5093353 JH |
1135 | /* After executing the pass, apply expected changes to the function |
1136 | properties. */ | |
17653c00 | 1137 | |
a5093353 JH |
1138 | static void |
1139 | update_properties_after_pass (void *data) | |
1140 | { | |
d3bfe4de | 1141 | struct opt_pass *pass = (struct opt_pass *) data; |
a5093353 JH |
1142 | cfun->curr_properties = (cfun->curr_properties | pass->properties_provided) |
1143 | & ~pass->properties_destroyed; | |
f6db1481 RH |
1144 | } |
1145 | ||
17653c00 JH |
1146 | /* Schedule IPA transform pass DATA for CFUN. */ |
1147 | ||
1148 | static void | |
1149 | add_ipa_transform_pass (void *data) | |
1150 | { | |
1151 | struct ipa_opt_pass *ipa_pass = (struct ipa_opt_pass *) data; | |
1152 | VEC_safe_push (ipa_opt_pass, heap, cfun->ipa_transforms_to_apply, ipa_pass); | |
1153 | } | |
1154 | ||
1920df6c | 1155 | /* Execute summary generation for all of the passes in IPA_PASS. */ |
17653c00 JH |
1156 | |
1157 | static void | |
1920df6c | 1158 | execute_ipa_summary_passes (struct ipa_opt_pass *ipa_pass) |
17653c00 | 1159 | { |
1920df6c | 1160 | while (ipa_pass) |
17653c00 JH |
1161 | { |
1162 | struct opt_pass *pass = &ipa_pass->pass; | |
1920df6c KZ |
1163 | |
1164 | /* Execute all of the IPA_PASSes in the list. */ | |
1165 | if (ipa_pass->pass.type == IPA_PASS | |
1166 | && (!pass->gate || pass->gate ())) | |
17653c00 JH |
1167 | { |
1168 | pass_init_dump_file (pass); | |
1920df6c | 1169 | ipa_pass->generate_summary (); |
17653c00 JH |
1170 | pass_fini_dump_file (pass); |
1171 | } | |
1172 | ipa_pass = (struct ipa_opt_pass *)ipa_pass->pass.next; | |
1173 | } | |
1174 | } | |
1175 | ||
1176 | /* Execute IPA_PASS function transform on NODE. */ | |
1177 | ||
1178 | static void | |
1179 | execute_one_ipa_transform_pass (struct cgraph_node *node, | |
1180 | struct ipa_opt_pass *ipa_pass) | |
1181 | { | |
1182 | struct opt_pass *pass = &ipa_pass->pass; | |
1183 | unsigned int todo_after = 0; | |
1184 | ||
1185 | current_pass = pass; | |
1186 | if (!ipa_pass->function_transform) | |
1187 | return; | |
1188 | ||
1189 | /* Note that the folders should only create gimple expressions. | |
1190 | This is a hack until the new folder is ready. */ | |
1191 | in_gimple_form = (cfun && (cfun->curr_properties & PROP_trees)) != 0; | |
1192 | ||
1193 | pass_init_dump_file (pass); | |
1194 | ||
1195 | /* Run pre-pass verification. */ | |
a12f79f5 | 1196 | execute_todo (ipa_pass->function_transform_todo_flags_start); |
17653c00 JH |
1197 | |
1198 | /* If a timevar is present, start it. */ | |
1199 | if (pass->tv_id) | |
1200 | timevar_push (pass->tv_id); | |
1201 | ||
1202 | /* Do it! */ | |
1203 | todo_after = ipa_pass->function_transform (node); | |
1204 | ||
1205 | /* Stop timevar. */ | |
1206 | if (pass->tv_id) | |
1207 | timevar_pop (pass->tv_id); | |
1208 | ||
1209 | /* Run post-pass cleanup and verification. */ | |
1210 | execute_todo (todo_after); | |
1211 | verify_interpass_invariants (); | |
1212 | ||
1213 | pass_fini_dump_file (pass); | |
1214 | ||
1215 | current_pass = NULL; | |
17653c00 JH |
1216 | } |
1217 | ||
ef330312 | 1218 | static bool |
8ddbbcae | 1219 | execute_one_pass (struct opt_pass *pass) |
f6db1481 | 1220 | { |
bbbe4e7b | 1221 | bool initializing_dump; |
c2924966 | 1222 | unsigned int todo_after = 0; |
97b0ade3 | 1223 | |
9e016eba | 1224 | /* IPA passes are executed on whole program, so cfun should be NULL. |
fa10beec | 1225 | Other passes need function context set. */ |
17653c00 | 1226 | if (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS) |
9e016eba JH |
1227 | gcc_assert (!cfun && !current_function_decl); |
1228 | else | |
e3b5732b | 1229 | gcc_assert (cfun && current_function_decl); |
9e016eba | 1230 | |
17653c00 JH |
1231 | if (cfun && cfun->ipa_transforms_to_apply) |
1232 | { | |
1233 | unsigned int i; | |
1234 | struct cgraph_node *node = cgraph_node (current_function_decl); | |
1235 | ||
1236 | for (i = 0; i < VEC_length (ipa_opt_pass, cfun->ipa_transforms_to_apply); | |
1237 | i++) | |
1238 | execute_one_ipa_transform_pass (node, | |
1239 | VEC_index (ipa_opt_pass, | |
1240 | cfun->ipa_transforms_to_apply, | |
1241 | i)); | |
1242 | VEC_free (ipa_opt_pass, heap, cfun->ipa_transforms_to_apply); | |
1243 | cfun->ipa_transforms_to_apply = NULL; | |
1244 | } | |
1245 | ||
6fb5fa3c | 1246 | current_pass = pass; |
726a989a | 1247 | |
ef330312 PB |
1248 | /* See if we're supposed to run this pass. */ |
1249 | if (pass->gate && !pass->gate ()) | |
1250 | return false; | |
f6db1481 | 1251 | |
873aa8f5 JH |
1252 | if (!quiet_flag && !cfun) |
1253 | fprintf (stderr, " <%s>", pass->name ? pass->name : ""); | |
1254 | ||
bbbe4e7b | 1255 | if (pass->todo_flags_start & TODO_set_props) |
a5093353 | 1256 | cfun->curr_properties = pass->properties_required; |
bbbe4e7b | 1257 | |
ef330312 PB |
1258 | /* Note that the folders should only create gimple expressions. |
1259 | This is a hack until the new folder is ready. */ | |
a5093353 | 1260 | in_gimple_form = (cfun && (cfun->curr_properties & PROP_trees)) != 0; |
f6db1481 | 1261 | |
ef330312 | 1262 | /* Run pre-pass verification. */ |
bbbe4e7b PB |
1263 | execute_todo (pass->todo_flags_start); |
1264 | ||
a5093353 JH |
1265 | #ifdef ENABLE_CHECKING |
1266 | do_per_function (verify_curr_properties, | |
1267 | (void *)(size_t)pass->properties_required); | |
1268 | #endif | |
f6db1481 | 1269 | |
17653c00 | 1270 | initializing_dump = pass_init_dump_file (pass); |
f6db1481 | 1271 | |
ef330312 PB |
1272 | /* If a timevar is present, start it. */ |
1273 | if (pass->tv_id) | |
1274 | timevar_push (pass->tv_id); | |
f6db1481 | 1275 | |
ef330312 PB |
1276 | /* Do it! */ |
1277 | if (pass->execute) | |
bbbe4e7b | 1278 | { |
c2924966 | 1279 | todo_after = pass->execute (); |
a5093353 | 1280 | do_per_function (clear_last_verified, NULL); |
bbbe4e7b | 1281 | } |
f6db1481 | 1282 | |
ef330312 PB |
1283 | /* Stop timevar. */ |
1284 | if (pass->tv_id) | |
1285 | timevar_pop (pass->tv_id); | |
f6db1481 | 1286 | |
a5093353 | 1287 | do_per_function (update_properties_after_pass, pass); |
bbbe4e7b PB |
1288 | |
1289 | if (initializing_dump | |
1290 | && dump_file | |
1291 | && graph_dump_format != no_graph | |
6f1fe305 | 1292 | && cfun |
a5093353 JH |
1293 | && (cfun->curr_properties & (PROP_cfg | PROP_rtl)) |
1294 | == (PROP_cfg | PROP_rtl)) | |
bbbe4e7b PB |
1295 | { |
1296 | get_dump_file_info (pass->static_pass_number)->flags |= TDF_GRAPH; | |
1297 | dump_flags |= TDF_GRAPH; | |
1298 | clean_graph_dump_file (dump_file_name); | |
1299 | } | |
1300 | ||
ef330312 | 1301 | /* Run post-pass cleanup and verification. */ |
c2924966 | 1302 | execute_todo (todo_after | pass->todo_flags_finish); |
6ac01510 | 1303 | verify_interpass_invariants (); |
17653c00 JH |
1304 | if (pass->type == IPA_PASS) |
1305 | do_per_function (add_ipa_transform_pass, pass); | |
f6db1481 | 1306 | |
f45e0ad1 JH |
1307 | if (!current_function_decl) |
1308 | cgraph_process_new_functions (); | |
1309 | ||
17653c00 | 1310 | pass_fini_dump_file (pass); |
f6db1481 | 1311 | |
17653c00 | 1312 | if (pass->type != SIMPLE_IPA_PASS && pass->type != IPA_PASS) |
e3b5732b JH |
1313 | gcc_assert (!(cfun->curr_properties & PROP_trees) |
1314 | || pass->type != RTL_PASS); | |
1315 | ||
6fb5fa3c | 1316 | current_pass = NULL; |
91851351 | 1317 | |
ef330312 | 1318 | return true; |
f6db1481 RH |
1319 | } |
1320 | ||
ef330312 | 1321 | void |
8ddbbcae | 1322 | execute_pass_list (struct opt_pass *pass) |
f6db1481 | 1323 | { |
ef330312 | 1324 | do |
f6db1481 | 1325 | { |
9e016eba JH |
1326 | gcc_assert (pass->type == GIMPLE_PASS |
1327 | || pass->type == RTL_PASS); | |
ef330312 PB |
1328 | if (execute_one_pass (pass) && pass->sub) |
1329 | execute_pass_list (pass->sub); | |
1330 | pass = pass->next; | |
f6db1481 | 1331 | } |
ef330312 | 1332 | while (pass); |
f6db1481 RH |
1333 | } |
1334 | ||
ef330312 PB |
1335 | /* Same as execute_pass_list but assume that subpasses of IPA passes |
1336 | are local passes. */ | |
1337 | void | |
8ddbbcae | 1338 | execute_ipa_pass_list (struct opt_pass *pass) |
f6db1481 | 1339 | { |
17653c00 | 1340 | bool summaries_generated = false; |
ef330312 | 1341 | do |
f6db1481 | 1342 | { |
a5093353 JH |
1343 | gcc_assert (!current_function_decl); |
1344 | gcc_assert (!cfun); | |
17653c00 JH |
1345 | gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS); |
1346 | if (pass->type == IPA_PASS && (!pass->gate || pass->gate ())) | |
1347 | { | |
1348 | if (!summaries_generated) | |
1349 | { | |
1350 | if (!quiet_flag && !cfun) | |
1351 | fprintf (stderr, " <summary generate>"); | |
1920df6c | 1352 | execute_ipa_summary_passes ((struct ipa_opt_pass *) pass); |
17653c00 JH |
1353 | } |
1354 | summaries_generated = true; | |
1355 | } | |
ef330312 | 1356 | if (execute_one_pass (pass) && pass->sub) |
9e016eba JH |
1357 | { |
1358 | if (pass->sub->type == GIMPLE_PASS) | |
1359 | do_per_function_toporder ((void (*)(void *))execute_pass_list, | |
1360 | pass->sub); | |
17653c00 JH |
1361 | else if (pass->sub->type == SIMPLE_IPA_PASS |
1362 | || pass->sub->type == IPA_PASS) | |
9e016eba JH |
1363 | execute_ipa_pass_list (pass->sub); |
1364 | else | |
1365 | gcc_unreachable (); | |
1366 | } | |
f45e0ad1 JH |
1367 | if (!current_function_decl) |
1368 | cgraph_process_new_functions (); | |
ef330312 | 1369 | pass = pass->next; |
f6db1481 | 1370 | } |
ef330312 | 1371 | while (pass); |
97b0ade3 | 1372 | } |
9fe0cb7d | 1373 | |
873aa8f5 | 1374 | #include "gt-passes.h" |