]>
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, | |
c75c517d | 3 | 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010 |
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" | |
f6db1481 RH |
28 | #include "system.h" |
29 | #include "coretypes.h" | |
30 | #include "tm.h" | |
f6db1481 RH |
31 | #include "line-map.h" |
32 | #include "input.h" | |
33 | #include "tree.h" | |
34 | #include "rtl.h" | |
35 | #include "tm_p.h" | |
36 | #include "flags.h" | |
37 | #include "insn-attr.h" | |
38 | #include "insn-config.h" | |
39 | #include "insn-flags.h" | |
40 | #include "hard-reg-set.h" | |
41 | #include "recog.h" | |
42 | #include "output.h" | |
43 | #include "except.h" | |
44 | #include "function.h" | |
45 | #include "toplev.h" | |
46 | #include "expr.h" | |
47 | #include "basic-block.h" | |
48 | #include "intl.h" | |
49 | #include "ggc.h" | |
50 | #include "graph.h" | |
f6db1481 RH |
51 | #include "regs.h" |
52 | #include "timevar.h" | |
1da2ed5f | 53 | #include "diagnostic-core.h" |
f6db1481 RH |
54 | #include "params.h" |
55 | #include "reload.h" | |
56 | #include "dwarf2asm.h" | |
57 | #include "integrate.h" | |
f6db1481 RH |
58 | #include "debug.h" |
59 | #include "target.h" | |
60 | #include "langhooks.h" | |
61 | #include "cfglayout.h" | |
62 | #include "cfgloop.h" | |
63 | #include "hosthooks.h" | |
64 | #include "cgraph.h" | |
65 | #include "opts.h" | |
66 | #include "coverage.h" | |
67 | #include "value-prof.h" | |
ef330312 PB |
68 | #include "tree-inline.h" |
69 | #include "tree-flow.h" | |
2f8e398b | 70 | #include "tree-pass.h" |
9f8628ba | 71 | #include "tree-dump.h" |
6fb5fa3c | 72 | #include "df.h" |
45a80bb9 | 73 | #include "predict.h" |
d7f09764 | 74 | #include "lto-streamer.h" |
090fa0ab | 75 | #include "plugin.h" |
af8bca3c | 76 | #include "ipa-utils.h" |
f6db1481 RH |
77 | |
78 | #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO) | |
79 | #include "dwarf2out.h" | |
80 | #endif | |
81 | ||
97b0ade3 | 82 | #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO) |
f6db1481 RH |
83 | #include "dbxout.h" |
84 | #endif | |
85 | ||
86 | #ifdef SDB_DEBUGGING_INFO | |
87 | #include "sdbout.h" | |
88 | #endif | |
89 | ||
90 | #ifdef XCOFF_DEBUGGING_INFO | |
91 | #include "xcoffout.h" /* Needed for external data | |
92 | declarations for e.g. AIX 4.x. */ | |
93 | #endif | |
94 | ||
6fb5fa3c | 95 | /* This is used for debugging. It allows the current pass to printed |
090fa0ab GF |
96 | from anywhere in compilation. |
97 | The variable current_pass is also used for statistics and plugins. */ | |
8ddbbcae | 98 | struct opt_pass *current_pass; |
6fb5fa3c DB |
99 | |
100 | /* Call from anywhere to find out what pass this is. Useful for | |
101 | printing out debugging information deep inside an service | |
102 | routine. */ | |
103 | void | |
104 | print_current_pass (FILE *file) | |
105 | { | |
106 | if (current_pass) | |
b8698a0f | 107 | fprintf (file, "current pass = %s (%d)\n", |
6fb5fa3c DB |
108 | current_pass->name, current_pass->static_pass_number); |
109 | else | |
110 | fprintf (file, "no current pass.\n"); | |
111 | } | |
112 | ||
113 | ||
114 | /* Call from the debugger to get the current pass name. */ | |
24e47c76 | 115 | DEBUG_FUNCTION void |
6fb5fa3c DB |
116 | debug_pass (void) |
117 | { | |
118 | print_current_pass (stderr); | |
b8698a0f | 119 | } |
6fb5fa3c DB |
120 | |
121 | ||
122 | ||
ef330312 PB |
123 | /* Global variables used to communicate with passes. */ |
124 | int dump_flags; | |
125 | bool in_gimple_form; | |
b02b9b53 | 126 | bool first_pass_instance; |
f6db1481 | 127 | |
f6db1481 RH |
128 | |
129 | /* This is called from various places for FUNCTION_DECL, VAR_DECL, | |
130 | and TYPE_DECL nodes. | |
131 | ||
132 | This does nothing for local (non-static) variables, unless the | |
0e6df31e GK |
133 | variable is a register variable with DECL_ASSEMBLER_NAME set. In |
134 | that case, or if the variable is not an automatic, it sets up the | |
135 | RTL and outputs any assembler code (label definition, storage | |
136 | allocation and initialization). | |
f6db1481 | 137 | |
0e6df31e | 138 | DECL is the declaration. TOP_LEVEL is nonzero |
f6db1481 RH |
139 | if this declaration is not within a function. */ |
140 | ||
141 | void | |
142 | rest_of_decl_compilation (tree decl, | |
f6db1481 RH |
143 | int top_level, |
144 | int at_end) | |
145 | { | |
146 | /* We deferred calling assemble_alias so that we could collect | |
147 | other attributes such as visibility. Emit the alias now. */ | |
6e701822 | 148 | if (!in_lto_p) |
f6db1481 RH |
149 | { |
150 | tree alias; | |
151 | alias = lookup_attribute ("alias", DECL_ATTRIBUTES (decl)); | |
152 | if (alias) | |
153 | { | |
154 | alias = TREE_VALUE (TREE_VALUE (alias)); | |
155 | alias = get_identifier (TREE_STRING_POINTER (alias)); | |
156 | assemble_alias (decl, alias); | |
157 | } | |
158 | } | |
159 | ||
0e6df31e GK |
160 | /* Can't defer this, because it needs to happen before any |
161 | later function definitions are processed. */ | |
820cc88f | 162 | if (DECL_ASSEMBLER_NAME_SET_P (decl) && DECL_REGISTER (decl)) |
0e6df31e GK |
163 | make_decl_rtl (decl); |
164 | ||
f6db1481 RH |
165 | /* Forward declarations for nested functions are not "external", |
166 | but we need to treat them as if they were. */ | |
167 | if (TREE_STATIC (decl) || DECL_EXTERNAL (decl) | |
168 | || TREE_CODE (decl) == FUNCTION_DECL) | |
169 | { | |
170 | timevar_push (TV_VARCONST); | |
171 | ||
f6db1481 RH |
172 | /* Don't output anything when a tentative file-scope definition |
173 | is seen. But at end of compilation, do output code for them. | |
174 | ||
7e8b322a | 175 | We do output all variables and rely on |
f6db1481 RH |
176 | callgraph code to defer them except for forward declarations |
177 | (see gcc.c-torture/compile/920624-1.c) */ | |
178 | if ((at_end | |
179 | || !DECL_DEFER_OUTPUT (decl) | |
cd9c7bd2 | 180 | || DECL_INITIAL (decl)) |
f6db1481 RH |
181 | && !DECL_EXTERNAL (decl)) |
182 | { | |
2942c502 JH |
183 | /* When reading LTO unit, we also read varpool, so do not |
184 | rebuild it. */ | |
185 | if (in_lto_p && !at_end) | |
186 | ; | |
187 | else if (TREE_CODE (decl) != FUNCTION_DECL) | |
8a4a83ed | 188 | varpool_finalize_decl (decl); |
f6db1481 RH |
189 | } |
190 | ||
191 | #ifdef ASM_FINISH_DECLARE_OBJECT | |
192 | if (decl == last_assemble_variable_decl) | |
193 | { | |
194 | ASM_FINISH_DECLARE_OBJECT (asm_out_file, decl, | |
195 | top_level, at_end); | |
196 | } | |
197 | #endif | |
198 | ||
199 | timevar_pop (TV_VARCONST); | |
200 | } | |
ef11c839 SB |
201 | else if (TREE_CODE (decl) == TYPE_DECL |
202 | /* Like in rest_of_type_compilation, avoid confusing the debug | |
203 | information machinery when there are errors. */ | |
1da2ed5f | 204 | && !seen_error ()) |
f6db1481 RH |
205 | { |
206 | timevar_push (TV_SYMOUT); | |
207 | debug_hooks->type_decl (decl, !top_level); | |
208 | timevar_pop (TV_SYMOUT); | |
209 | } | |
e4d5432a | 210 | |
aabcd309 | 211 | /* Let cgraph know about the existence of variables. */ |
2942c502 JH |
212 | if (in_lto_p && !at_end) |
213 | ; | |
a482b1f5 JH |
214 | else if (TREE_CODE (decl) == VAR_DECL && !DECL_EXTERNAL (decl) |
215 | && TREE_STATIC (decl)) | |
8a4a83ed | 216 | varpool_node (decl); |
f6db1481 RH |
217 | } |
218 | ||
219 | /* Called after finishing a record, union or enumeral type. */ | |
220 | ||
221 | void | |
222 | rest_of_type_compilation (tree type, int toplev) | |
223 | { | |
224 | /* Avoid confusing the debug information machinery when there are | |
225 | errors. */ | |
1da2ed5f | 226 | if (seen_error ()) |
f6db1481 RH |
227 | return; |
228 | ||
229 | timevar_push (TV_SYMOUT); | |
230 | debug_hooks->type_decl (TYPE_STUB_DECL (type), !toplev); | |
231 | timevar_pop (TV_SYMOUT); | |
232 | } | |
233 | ||
ef330312 | 234 | \f |
f6db1481 | 235 | |
ef330312 PB |
236 | void |
237 | finish_optimization_passes (void) | |
f6db1481 | 238 | { |
09639a83 | 239 | int i; |
ef330312 PB |
240 | struct dump_file_info *dfi; |
241 | char *name; | |
f6db1481 | 242 | |
ef330312 PB |
243 | timevar_push (TV_DUMP); |
244 | if (profile_arc_flag || flag_test_coverage || flag_branch_probabilities) | |
f6db1481 | 245 | { |
8ddbbcae | 246 | dump_file = dump_begin (pass_profile.pass.static_pass_number, NULL); |
ef330312 PB |
247 | end_branch_prob (); |
248 | if (dump_file) | |
8ddbbcae | 249 | dump_end (pass_profile.pass.static_pass_number, dump_file); |
f6db1481 | 250 | } |
f6db1481 | 251 | |
ef330312 | 252 | if (optimize > 0) |
f6db1481 | 253 | { |
8ddbbcae | 254 | dump_file = dump_begin (pass_combine.pass.static_pass_number, NULL); |
ef330312 | 255 | if (dump_file) |
f6db1481 | 256 | { |
ef330312 | 257 | dump_combine_total_stats (dump_file); |
8ddbbcae | 258 | dump_end (pass_combine.pass.static_pass_number, dump_file); |
f6db1481 RH |
259 | } |
260 | } | |
261 | ||
ef330312 PB |
262 | /* Do whatever is necessary to finish printing the graphs. */ |
263 | if (graph_dump_format != no_graph) | |
264 | for (i = TDI_end; (dfi = get_dump_file_info (i)) != NULL; ++i) | |
265 | if (dump_initialized_p (i) | |
5e34206b | 266 | && (dfi->flags & TDF_GRAPH) != 0 |
ef330312 | 267 | && (name = get_dump_file_name (i)) != NULL) |
5e34206b JJ |
268 | { |
269 | finish_graph_dump_file (name); | |
270 | free (name); | |
271 | } | |
f6db1481 | 272 | |
ef330312 | 273 | timevar_pop (TV_DUMP); |
f6db1481 | 274 | } |
f6db1481 | 275 | |
ef330312 PB |
276 | static bool |
277 | gate_rest_of_compilation (void) | |
f6db1481 | 278 | { |
ef330312 PB |
279 | /* Early return if there were errors. We can run afoul of our |
280 | consistency checks, and there's not really much point in fixing them. */ | |
1da2ed5f | 281 | return !(rtl_dump_and_exit || flag_syntax_only || seen_error ()); |
f6db1481 RH |
282 | } |
283 | ||
8ddbbcae | 284 | struct gimple_opt_pass pass_rest_of_compilation = |
f6db1481 | 285 | { |
8ddbbcae JH |
286 | { |
287 | GIMPLE_PASS, | |
cf400ddb | 288 | "*rest_of_compilation", /* name */ |
ef330312 PB |
289 | gate_rest_of_compilation, /* gate */ |
290 | NULL, /* execute */ | |
291 | NULL, /* sub */ | |
292 | NULL, /* next */ | |
293 | 0, /* static_pass_number */ | |
294 | TV_REST_OF_COMPILATION, /* tv_id */ | |
295 | PROP_rtl, /* properties_required */ | |
296 | 0, /* properties_provided */ | |
297 | 0, /* properties_destroyed */ | |
298 | 0, /* todo_flags_start */ | |
8ddbbcae JH |
299 | TODO_ggc_collect /* todo_flags_finish */ |
300 | } | |
ef330312 | 301 | }; |
f6db1481 | 302 | |
ef330312 PB |
303 | static bool |
304 | gate_postreload (void) | |
305 | { | |
306 | return reload_completed; | |
f6db1481 RH |
307 | } |
308 | ||
8ddbbcae | 309 | struct rtl_opt_pass pass_postreload = |
f6db1481 | 310 | { |
8ddbbcae JH |
311 | { |
312 | RTL_PASS, | |
e0a42b0f | 313 | "*all-postreload", /* name */ |
ef330312 PB |
314 | gate_postreload, /* gate */ |
315 | NULL, /* execute */ | |
316 | NULL, /* sub */ | |
317 | NULL, /* next */ | |
318 | 0, /* static_pass_number */ | |
a222c01a | 319 | TV_POSTRELOAD, /* tv_id */ |
ef330312 PB |
320 | PROP_rtl, /* properties_required */ |
321 | 0, /* properties_provided */ | |
322 | 0, /* properties_destroyed */ | |
323 | 0, /* todo_flags_start */ | |
8ddbbcae JH |
324 | TODO_ggc_collect | TODO_verify_rtl_sharing /* todo_flags_finish */ |
325 | } | |
ef330312 | 326 | }; |
f6db1481 | 327 | |
97b0ade3 | 328 | |
f6db1481 | 329 | |
ef330312 | 330 | /* The root of the compilation pass tree, once constructed. */ |
d7f09764 DN |
331 | struct opt_pass *all_passes, *all_small_ipa_passes, *all_lowering_passes, |
332 | *all_regular_ipa_passes, *all_lto_gen_passes; | |
f6db1481 | 333 | |
2a5e9d16 JR |
334 | /* This is used by plugins, and should also be used in register_pass. */ |
335 | #define DEF_PASS_LIST(LIST) &LIST, | |
336 | struct opt_pass **gcc_pass_lists[] = { GCC_PASS_LISTS NULL }; | |
337 | #undef DEF_PASS_LIST | |
338 | ||
9fe0cb7d RG |
339 | /* A map from static pass id to optimization pass. */ |
340 | struct opt_pass **passes_by_id; | |
341 | int passes_by_id_size; | |
342 | ||
343 | /* Set the static pass number of pass PASS to ID and record that | |
344 | in the mapping from static pass number to pass. */ | |
345 | ||
346 | static void | |
347 | set_pass_for_id (int id, struct opt_pass *pass) | |
348 | { | |
349 | pass->static_pass_number = id; | |
350 | if (passes_by_id_size <= id) | |
351 | { | |
d3bfe4de | 352 | passes_by_id = XRESIZEVEC (struct opt_pass *, passes_by_id, id + 1); |
9fe0cb7d RG |
353 | memset (passes_by_id + passes_by_id_size, 0, |
354 | (id + 1 - passes_by_id_size) * sizeof (void *)); | |
355 | passes_by_id_size = id + 1; | |
356 | } | |
357 | passes_by_id[id] = pass; | |
358 | } | |
359 | ||
360 | /* Return the pass with the static pass number ID. */ | |
361 | ||
362 | struct opt_pass * | |
363 | get_pass_for_id (int id) | |
364 | { | |
365 | if (id >= passes_by_id_size) | |
366 | return NULL; | |
367 | return passes_by_id[id]; | |
368 | } | |
369 | ||
ef330312 PB |
370 | /* Iterate over the pass tree allocating dump file numbers. We want |
371 | to do this depth first, and independent of whether the pass is | |
372 | enabled or not. */ | |
f6db1481 | 373 | |
68a607d8 | 374 | void |
9e016eba | 375 | register_one_dump_file (struct opt_pass *pass) |
ef330312 PB |
376 | { |
377 | char *dot_name, *flag_name, *glob_name; | |
e0a42b0f | 378 | const char *name, *prefix; |
ef330312 | 379 | char num[10]; |
9fe0cb7d | 380 | int flags, id; |
f6db1481 | 381 | |
ef330312 PB |
382 | /* See below in next_pass_1. */ |
383 | num[0] = '\0'; | |
384 | if (pass->static_pass_number != -1) | |
385 | sprintf (num, "%d", ((int) pass->static_pass_number < 0 | |
386 | ? 1 : pass->static_pass_number)); | |
f6db1481 | 387 | |
e0a42b0f ZC |
388 | /* The name is both used to identify the pass for the purposes of plugins, |
389 | and to specify dump file name and option. | |
390 | The latter two might want something short which is not quite unique; for | |
391 | that reason, we may have a disambiguating prefix, followed by a space | |
392 | to mark the start of the following dump file name / option string. */ | |
393 | name = strchr (pass->name, ' '); | |
394 | name = name ? name + 1 : pass->name; | |
395 | dot_name = concat (".", name, num, NULL); | |
17653c00 | 396 | if (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS) |
bbbe4e7b | 397 | prefix = "ipa-", flags = TDF_IPA; |
9e016eba | 398 | else if (pass->type == GIMPLE_PASS) |
bbbe4e7b | 399 | prefix = "tree-", flags = TDF_TREE; |
f6db1481 | 400 | else |
bbbe4e7b PB |
401 | prefix = "rtl-", flags = TDF_RTL; |
402 | ||
e0a42b0f ZC |
403 | flag_name = concat (prefix, name, num, NULL); |
404 | glob_name = concat (prefix, name, NULL); | |
9fe0cb7d RG |
405 | id = dump_register (dot_name, flag_name, glob_name, flags); |
406 | set_pass_for_id (id, pass); | |
97b0ade3 PB |
407 | } |
408 | ||
bbbe4e7b PB |
409 | /* Recursive worker function for register_dump_files. */ |
410 | ||
b8698a0f | 411 | static int |
9e016eba | 412 | register_dump_files_1 (struct opt_pass *pass, int properties) |
97b0ade3 | 413 | { |
ef330312 PB |
414 | do |
415 | { | |
bbbe4e7b PB |
416 | int new_properties = (properties | pass->properties_provided) |
417 | & ~pass->properties_destroyed; | |
f6db1481 | 418 | |
8e352cd3 | 419 | if (pass->name && pass->name[0] != '*') |
9e016eba | 420 | register_one_dump_file (pass); |
f6db1481 | 421 | |
ef330312 | 422 | if (pass->sub) |
9e016eba | 423 | new_properties = register_dump_files_1 (pass->sub, new_properties); |
f6db1481 | 424 | |
ef330312 PB |
425 | /* If we have a gate, combine the properties that we could have with |
426 | and without the pass being examined. */ | |
427 | if (pass->gate) | |
428 | properties &= new_properties; | |
429 | else | |
430 | properties = new_properties; | |
f6db1481 | 431 | |
ef330312 | 432 | pass = pass->next; |
f6db1481 | 433 | } |
ef330312 | 434 | while (pass); |
f6db1481 | 435 | |
ef330312 | 436 | return properties; |
f6db1481 | 437 | } |
f9957958 | 438 | |
b8698a0f | 439 | /* Register the dump files for the pipeline starting at PASS. |
9e016eba JH |
440 | PROPERTIES reflects the properties that are guaranteed to be available at |
441 | the beginning of the pipeline. */ | |
bbbe4e7b | 442 | |
b8698a0f | 443 | static void |
9e016eba | 444 | register_dump_files (struct opt_pass *pass,int properties) |
bbbe4e7b PB |
445 | { |
446 | pass->properties_required |= properties; | |
9e016eba | 447 | register_dump_files_1 (pass, properties); |
bbbe4e7b PB |
448 | } |
449 | ||
b80b0fd9 ST |
450 | /* Look at the static_pass_number and duplicate the pass |
451 | if it is already added to a list. */ | |
f9957958 | 452 | |
b80b0fd9 ST |
453 | static struct opt_pass * |
454 | make_pass_instance (struct opt_pass *pass, bool track_duplicates) | |
f6db1481 | 455 | { |
ef330312 PB |
456 | /* A nonzero static_pass_number indicates that the |
457 | pass is already in the list. */ | |
458 | if (pass->static_pass_number) | |
459 | { | |
82d6e6fc | 460 | struct opt_pass *new_pass; |
f6db1481 | 461 | |
63a00e0d DS |
462 | if (pass->type == GIMPLE_PASS |
463 | || pass->type == RTL_PASS | |
464 | || pass->type == SIMPLE_IPA_PASS) | |
465 | { | |
466 | new_pass = XNEW (struct opt_pass); | |
467 | memcpy (new_pass, pass, sizeof (struct opt_pass)); | |
468 | } | |
469 | else if (pass->type == IPA_PASS) | |
470 | { | |
471 | new_pass = (struct opt_pass *)XNEW (struct ipa_opt_pass_d); | |
472 | memcpy (new_pass, pass, sizeof (struct ipa_opt_pass_d)); | |
473 | } | |
474 | else | |
475 | gcc_unreachable (); | |
476 | ||
82d6e6fc | 477 | new_pass->next = NULL; |
f6db1481 | 478 | |
82d6e6fc | 479 | new_pass->todo_flags_start &= ~TODO_mark_first_instance; |
b02b9b53 | 480 | |
ef330312 PB |
481 | /* Indicate to register_dump_files that this pass has duplicates, |
482 | and so it should rename the dump file. The first instance will | |
483 | be -1, and be number of duplicates = -static_pass_number - 1. | |
484 | Subsequent instances will be > 0 and just the duplicate number. */ | |
e0a42b0f | 485 | if ((pass->name && pass->name[0] != '*') || track_duplicates) |
ef330312 PB |
486 | { |
487 | pass->static_pass_number -= 1; | |
82d6e6fc | 488 | new_pass->static_pass_number = -pass->static_pass_number; |
ef330312 | 489 | } |
b80b0fd9 | 490 | return new_pass; |
ef330312 PB |
491 | } |
492 | else | |
493 | { | |
b02b9b53 | 494 | pass->todo_flags_start |= TODO_mark_first_instance; |
ef330312 | 495 | pass->static_pass_number = -1; |
090fa0ab GF |
496 | |
497 | invoke_plugin_callbacks (PLUGIN_NEW_PASS, pass); | |
b8698a0f L |
498 | } |
499 | return pass; | |
b80b0fd9 ST |
500 | } |
501 | ||
502 | /* Add a pass to the pass list. Duplicate the pass if it's already | |
503 | in the list. */ | |
504 | ||
505 | static struct opt_pass ** | |
506 | next_pass_1 (struct opt_pass **list, struct opt_pass *pass) | |
507 | { | |
e0a42b0f ZC |
508 | /* Every pass should have a name so that plugins can refer to them. */ |
509 | gcc_assert (pass->name != NULL); | |
510 | ||
b80b0fd9 | 511 | *list = make_pass_instance (pass, false); |
b8698a0f | 512 | |
ef330312 | 513 | return &(*list)->next; |
f6db1481 RH |
514 | } |
515 | ||
b80b0fd9 ST |
516 | /* List node for an inserted pass instance. We need to keep track of all |
517 | the newly-added pass instances (with 'added_pass_nodes' defined below) | |
518 | so that we can register their dump files after pass-positioning is finished. | |
519 | Registering dumping files needs to be post-processed or the | |
520 | static_pass_number of the opt_pass object would be modified and mess up | |
521 | the dump file names of future pass instances to be added. */ | |
522 | ||
523 | struct pass_list_node | |
524 | { | |
525 | struct opt_pass *pass; | |
526 | struct pass_list_node *next; | |
527 | }; | |
528 | ||
529 | static struct pass_list_node *added_pass_nodes = NULL; | |
530 | static struct pass_list_node *prev_added_pass_node; | |
531 | ||
b8698a0f | 532 | /* Insert the pass at the proper position. Return true if the pass |
b80b0fd9 ST |
533 | is successfully added. |
534 | ||
535 | NEW_PASS_INFO - new pass to be inserted | |
536 | PASS_LIST - root of the pass list to insert the new pass to */ | |
537 | ||
538 | static bool | |
539 | position_pass (struct register_pass_info *new_pass_info, | |
540 | struct opt_pass **pass_list) | |
541 | { | |
542 | struct opt_pass *pass = *pass_list, *prev_pass = NULL; | |
543 | bool success = false; | |
544 | ||
545 | for ( ; pass; prev_pass = pass, pass = pass->next) | |
546 | { | |
547 | /* Check if the current pass is of the same type as the new pass and | |
548 | matches the name and the instance number of the reference pass. */ | |
549 | if (pass->type == new_pass_info->pass->type | |
550 | && pass->name | |
551 | && !strcmp (pass->name, new_pass_info->reference_pass_name) | |
552 | && ((new_pass_info->ref_pass_instance_number == 0) | |
553 | || (new_pass_info->ref_pass_instance_number == | |
554 | pass->static_pass_number) | |
555 | || (new_pass_info->ref_pass_instance_number == 1 | |
556 | && pass->todo_flags_start & TODO_mark_first_instance))) | |
557 | { | |
558 | struct opt_pass *new_pass; | |
559 | struct pass_list_node *new_pass_node; | |
560 | ||
561 | new_pass = make_pass_instance (new_pass_info->pass, true); | |
b8698a0f | 562 | |
b80b0fd9 ST |
563 | /* Insert the new pass instance based on the positioning op. */ |
564 | switch (new_pass_info->pos_op) | |
565 | { | |
566 | case PASS_POS_INSERT_AFTER: | |
567 | new_pass->next = pass->next; | |
568 | pass->next = new_pass; | |
569 | ||
570 | /* Skip newly inserted pass to avoid repeated | |
571 | insertions in the case where the new pass and the | |
572 | existing one have the same name. */ | |
b8698a0f | 573 | pass = new_pass; |
b80b0fd9 ST |
574 | break; |
575 | case PASS_POS_INSERT_BEFORE: | |
576 | new_pass->next = pass; | |
577 | if (prev_pass) | |
578 | prev_pass->next = new_pass; | |
579 | else | |
580 | *pass_list = new_pass; | |
581 | break; | |
582 | case PASS_POS_REPLACE: | |
583 | new_pass->next = pass->next; | |
584 | if (prev_pass) | |
585 | prev_pass->next = new_pass; | |
586 | else | |
587 | *pass_list = new_pass; | |
588 | new_pass->sub = pass->sub; | |
589 | new_pass->tv_id = pass->tv_id; | |
590 | pass = new_pass; | |
591 | break; | |
592 | default: | |
d8a07487 | 593 | error ("invalid pass positioning operation"); |
b80b0fd9 ST |
594 | return false; |
595 | } | |
596 | ||
597 | /* Save the newly added pass (instance) in the added_pass_nodes | |
598 | list so that we can register its dump file later. Note that | |
599 | we cannot register the dump file now because doing so will modify | |
600 | the static_pass_number of the opt_pass object and therefore | |
601 | mess up the dump file name of future instances. */ | |
602 | new_pass_node = XCNEW (struct pass_list_node); | |
603 | new_pass_node->pass = new_pass; | |
604 | if (!added_pass_nodes) | |
605 | added_pass_nodes = new_pass_node; | |
606 | else | |
607 | prev_added_pass_node->next = new_pass_node; | |
608 | prev_added_pass_node = new_pass_node; | |
609 | ||
610 | success = true; | |
611 | } | |
612 | ||
613 | if (pass->sub && position_pass (new_pass_info, &pass->sub)) | |
614 | success = true; | |
615 | } | |
616 | ||
617 | return success; | |
618 | } | |
619 | ||
620 | /* Hooks a new pass into the pass lists. | |
621 | ||
622 | PASS_INFO - pass information that specifies the opt_pass object, | |
623 | reference pass, instance number, and how to position | |
624 | the pass */ | |
625 | ||
626 | void | |
627 | register_pass (struct register_pass_info *pass_info) | |
628 | { | |
669887fc DS |
629 | bool all_instances, success; |
630 | ||
b9e467a2 BS |
631 | /* The checks below could fail in buggy plugins. Existing GCC |
632 | passes should never fail these checks, so we mention plugin in | |
633 | the messages. */ | |
b80b0fd9 | 634 | if (!pass_info->pass) |
b9e467a2 BS |
635 | fatal_error ("plugin cannot register a missing pass"); |
636 | ||
637 | if (!pass_info->pass->name) | |
638 | fatal_error ("plugin cannot register an unnamed pass"); | |
b80b0fd9 ST |
639 | |
640 | if (!pass_info->reference_pass_name) | |
b9e467a2 BS |
641 | fatal_error |
642 | ("plugin cannot register pass %qs without reference pass name", | |
643 | pass_info->pass->name); | |
b80b0fd9 | 644 | |
b9e467a2 | 645 | /* Try to insert the new pass to the pass lists. We need to check |
669887fc | 646 | all five lists as the reference pass could be in one (or all) of |
b9e467a2 | 647 | them. */ |
669887fc DS |
648 | all_instances = pass_info->ref_pass_instance_number == 0; |
649 | success = position_pass (pass_info, &all_lowering_passes); | |
650 | if (!success || all_instances) | |
651 | success |= position_pass (pass_info, &all_small_ipa_passes); | |
652 | if (!success || all_instances) | |
653 | success |= position_pass (pass_info, &all_regular_ipa_passes); | |
654 | if (!success || all_instances) | |
655 | success |= position_pass (pass_info, &all_lto_gen_passes); | |
656 | if (!success || all_instances) | |
657 | success |= position_pass (pass_info, &all_passes); | |
658 | if (!success) | |
b9e467a2 BS |
659 | fatal_error |
660 | ("pass %qs not found but is referenced by new pass %qs", | |
661 | pass_info->reference_pass_name, pass_info->pass->name); | |
669887fc DS |
662 | |
663 | /* OK, we have successfully inserted the new pass. We need to register | |
664 | the dump files for the newly added pass and its duplicates (if any). | |
665 | Because the registration of plugin/backend passes happens after the | |
666 | command-line options are parsed, the options that specify single | |
667 | pass dumping (e.g. -fdump-tree-PASSNAME) cannot be used for new | |
668 | passes. Therefore we currently can only enable dumping of | |
669 | new passes when the 'dump-all' flags (e.g. -fdump-tree-all) | |
670 | are specified. While doing so, we also delete the pass_list_node | |
671 | objects created during pass positioning. */ | |
672 | while (added_pass_nodes) | |
b80b0fd9 | 673 | { |
669887fc DS |
674 | struct pass_list_node *next_node = added_pass_nodes->next; |
675 | enum tree_dump_index tdi; | |
676 | register_one_dump_file (added_pass_nodes->pass); | |
677 | if (added_pass_nodes->pass->type == SIMPLE_IPA_PASS | |
678 | || added_pass_nodes->pass->type == IPA_PASS) | |
679 | tdi = TDI_ipa_all; | |
680 | else if (added_pass_nodes->pass->type == GIMPLE_PASS) | |
681 | tdi = TDI_tree_all; | |
682 | else | |
683 | tdi = TDI_rtl_all; | |
684 | /* Check if dump-all flag is specified. */ | |
685 | if (get_dump_file_info (tdi)->state) | |
686 | get_dump_file_info (added_pass_nodes->pass->static_pass_number) | |
687 | ->state = get_dump_file_info (tdi)->state; | |
688 | XDELETE (added_pass_nodes); | |
689 | added_pass_nodes = next_node; | |
b80b0fd9 ST |
690 | } |
691 | } | |
6fb5fa3c | 692 | |
dd97d271 DN |
693 | /* Construct the pass tree. The sequencing of passes is driven by |
694 | the cgraph routines: | |
695 | ||
696 | cgraph_finalize_compilation_unit () | |
697 | for each node N in the cgraph | |
698 | cgraph_analyze_function (N) | |
699 | cgraph_lower_function (N) -> all_lowering_passes | |
700 | ||
701 | If we are optimizing, cgraph_optimize is then invoked: | |
702 | ||
703 | cgraph_optimize () | |
d7f09764 | 704 | ipa_passes () -> all_small_ipa_passes |
dd97d271 DN |
705 | cgraph_expand_all_functions () |
706 | for each node N in the cgraph | |
707 | cgraph_expand_function (N) | |
e89d6010 | 708 | tree_rest_of_compilation (DECL (N)) -> all_passes |
dd97d271 | 709 | */ |
97b0ade3 | 710 | |
ef330312 PB |
711 | void |
712 | init_optimization_passes (void) | |
713 | { | |
8ddbbcae | 714 | struct opt_pass **p; |
ef330312 | 715 | |
8ddbbcae | 716 | #define NEXT_PASS(PASS) (p = next_pass_1 (p, &((PASS).pass))) |
873aa8f5 | 717 | |
f1bd2543 JH |
718 | /* All passes needed to lower the function into shape optimizers can |
719 | operate on. These passes are always run first on the function, but | |
720 | backend might produce already lowered functions that are not processed | |
721 | by these passes. */ | |
ef330312 | 722 | p = &all_lowering_passes; |
a406865a RG |
723 | NEXT_PASS (pass_warn_unused_result); |
724 | NEXT_PASS (pass_diagnose_omp_blocks); | |
ef330312 | 725 | NEXT_PASS (pass_mudflap_1); |
953ff289 | 726 | NEXT_PASS (pass_lower_omp); |
ef330312 | 727 | NEXT_PASS (pass_lower_cf); |
a24549d4 | 728 | NEXT_PASS (pass_refactor_eh); |
ef330312 PB |
729 | NEXT_PASS (pass_lower_eh); |
730 | NEXT_PASS (pass_build_cfg); | |
ef330312 | 731 | NEXT_PASS (pass_warn_function_return); |
2dee695b | 732 | NEXT_PASS (pass_build_cgraph_edges); |
ef330312 PB |
733 | *p = NULL; |
734 | ||
7e8b322a | 735 | /* Interprocedural optimization passes. */ |
d7f09764 | 736 | p = &all_small_ipa_passes; |
b6050cb7 | 737 | NEXT_PASS (pass_ipa_free_lang_data); |
f1bd2543 | 738 | NEXT_PASS (pass_ipa_function_and_variable_visibility); |
f1bd2543 JH |
739 | NEXT_PASS (pass_early_local_passes); |
740 | { | |
8ddbbcae | 741 | struct opt_pass **p = &pass_early_local_passes.pass.sub; |
6f1873a1 | 742 | NEXT_PASS (pass_fixup_cfg); |
f1bd2543 JH |
743 | NEXT_PASS (pass_init_datastructures); |
744 | NEXT_PASS (pass_expand_omp); | |
c72321c9 JH |
745 | |
746 | NEXT_PASS (pass_referenced_vars); | |
c72321c9 | 747 | NEXT_PASS (pass_build_ssa); |
47853c73 | 748 | NEXT_PASS (pass_lower_vector); |
2dc74010 | 749 | NEXT_PASS (pass_early_warn_uninitialized); |
d7f09764 | 750 | NEXT_PASS (pass_rebuild_cgraph_edges); |
bb7e6d55 | 751 | NEXT_PASS (pass_inline_parameters); |
d7f09764 | 752 | NEXT_PASS (pass_early_inline); |
f1bd2543 JH |
753 | NEXT_PASS (pass_all_early_optimizations); |
754 | { | |
8ddbbcae | 755 | struct opt_pass **p = &pass_all_early_optimizations.pass.sub; |
133f9369 | 756 | NEXT_PASS (pass_remove_cgraph_callee_edges); |
f1bd2543 JH |
757 | NEXT_PASS (pass_rename_ssa_copies); |
758 | NEXT_PASS (pass_ccp); | |
759 | NEXT_PASS (pass_forwprop); | |
6b8ed145 RG |
760 | /* pass_build_ealias is a dummy pass that ensures that we |
761 | execute TODO_rebuild_alias at this point. Re-building | |
762 | alias information also rewrites no longer addressed | |
763 | locals into SSA form if possible. */ | |
764 | NEXT_PASS (pass_build_ealias); | |
029f45bd | 765 | NEXT_PASS (pass_sra_early); |
605896f5 | 766 | NEXT_PASS (pass_fre); |
f1bd2543 JH |
767 | NEXT_PASS (pass_copy_prop); |
768 | NEXT_PASS (pass_merge_phi); | |
11b08ee9 | 769 | NEXT_PASS (pass_cd_dce); |
07ffa034 | 770 | NEXT_PASS (pass_early_ipa_sra); |
f1bd2543 | 771 | NEXT_PASS (pass_tail_recursion); |
b6e99746 | 772 | NEXT_PASS (pass_convert_switch); |
a8da523f | 773 | NEXT_PASS (pass_cleanup_eh); |
45a80bb9 | 774 | NEXT_PASS (pass_profile); |
33977f81 | 775 | NEXT_PASS (pass_local_pure_const); |
3e485f62 JH |
776 | /* Split functions creates parts that are not run through |
777 | early optimizations again. It is thus good idea to do this | |
778 | late. */ | |
779 | NEXT_PASS (pass_split_functions); | |
f1bd2543 | 780 | } |
c72321c9 | 781 | NEXT_PASS (pass_release_ssa_names); |
f1bd2543 | 782 | NEXT_PASS (pass_rebuild_cgraph_edges); |
b91bc349 | 783 | NEXT_PASS (pass_inline_parameters); |
f1bd2543 | 784 | } |
4d3814a5 | 785 | NEXT_PASS (pass_ipa_tree_profile); |
cf9712cc JH |
786 | { |
787 | struct opt_pass **p = &pass_ipa_tree_profile.pass.sub; | |
788 | NEXT_PASS (pass_feedback_split_functions); | |
789 | } | |
f1bd2543 | 790 | NEXT_PASS (pass_ipa_increase_alignment); |
43d861a5 | 791 | NEXT_PASS (pass_ipa_matrix_reorg); |
8b84c596 | 792 | NEXT_PASS (pass_ipa_lower_emutls); |
d7f09764 DN |
793 | *p = NULL; |
794 | ||
795 | p = &all_regular_ipa_passes; | |
b20996ff | 796 | NEXT_PASS (pass_ipa_whole_program_visibility); |
e65bb9be | 797 | NEXT_PASS (pass_ipa_profile); |
f1bd2543 | 798 | NEXT_PASS (pass_ipa_cp); |
9e97ff61 | 799 | NEXT_PASS (pass_ipa_cdtor_merge); |
f1bd2543 | 800 | NEXT_PASS (pass_ipa_inline); |
b8698a0f | 801 | NEXT_PASS (pass_ipa_pure_const); |
514f01ad | 802 | NEXT_PASS (pass_ipa_reference); |
f1bd2543 | 803 | NEXT_PASS (pass_ipa_pta); |
d7f09764 DN |
804 | *p = NULL; |
805 | ||
806 | p = &all_lto_gen_passes; | |
807 | NEXT_PASS (pass_ipa_lto_gimple_out); | |
d7f09764 | 808 | NEXT_PASS (pass_ipa_lto_finish_out); /* This must be the last LTO pass. */ |
7a388ee4 JH |
809 | *p = NULL; |
810 | ||
b3f7d793 DN |
811 | /* These passes are run after IPA passes on every function that is being |
812 | output to the assembler file. */ | |
ef330312 | 813 | p = &all_passes; |
1d65f45c | 814 | NEXT_PASS (pass_lower_eh_dispatch); |
ef330312 | 815 | NEXT_PASS (pass_all_optimizations); |
f1bd2543 | 816 | { |
8ddbbcae | 817 | struct opt_pass **p = &pass_all_optimizations.pass.sub; |
133f9369 | 818 | NEXT_PASS (pass_remove_cgraph_callee_edges); |
11b08ee9 RG |
819 | /* Initial scalar cleanups before alias computation. |
820 | They ensure memory accesses are not indirect wherever possible. */ | |
7299cb99 | 821 | NEXT_PASS (pass_strip_predict_hints); |
f1bd2543 | 822 | NEXT_PASS (pass_rename_ssa_copies); |
d6e840ee | 823 | NEXT_PASS (pass_complete_unrolli); |
f1bd2543 | 824 | NEXT_PASS (pass_ccp); |
e2081a1d | 825 | NEXT_PASS (pass_forwprop); |
11b08ee9 RG |
826 | NEXT_PASS (pass_call_cdce); |
827 | /* pass_build_alias is a dummy pass that ensures that we | |
828 | execute TODO_rebuild_alias at this point. Re-building | |
829 | alias information also rewrites no longer addressed | |
830 | locals into SSA form if possible. */ | |
831 | NEXT_PASS (pass_build_alias); | |
832 | NEXT_PASS (pass_return_slot); | |
3b48ccbc | 833 | NEXT_PASS (pass_phiprop); |
f1bd2543 | 834 | NEXT_PASS (pass_fre); |
f1bd2543 JH |
835 | NEXT_PASS (pass_copy_prop); |
836 | NEXT_PASS (pass_merge_phi); | |
837 | NEXT_PASS (pass_vrp); | |
838 | NEXT_PASS (pass_dce); | |
a5828d1e | 839 | NEXT_PASS (pass_cselim); |
18d08014 | 840 | NEXT_PASS (pass_tree_ifcombine); |
f1bd2543 | 841 | NEXT_PASS (pass_phiopt); |
f1bd2543 | 842 | NEXT_PASS (pass_tail_recursion); |
f1bd2543 JH |
843 | NEXT_PASS (pass_ch); |
844 | NEXT_PASS (pass_stdarg); | |
845 | NEXT_PASS (pass_lower_complex); | |
846 | NEXT_PASS (pass_sra); | |
f1bd2543 | 847 | NEXT_PASS (pass_rename_ssa_copies); |
44e10129 MM |
848 | /* The dom pass will also resolve all __builtin_constant_p calls |
849 | that are still there to 0. This has to be done after some | |
850 | propagations have already run, but before some more dead code | |
851 | is removed, and this place fits nicely. Remember this when | |
852 | trying to move or duplicate pass_dominator somewhere earlier. */ | |
f1bd2543 | 853 | NEXT_PASS (pass_dominator); |
f1bd2543 JH |
854 | /* The only const/copy propagation opportunities left after |
855 | DOM should be due to degenerate PHI nodes. So rather than | |
856 | run the full propagators, run a specialized pass which | |
857 | only examines PHIs to discover const/copy propagation | |
858 | opportunities. */ | |
859 | NEXT_PASS (pass_phi_only_cprop); | |
25c6036a | 860 | NEXT_PASS (pass_dse); |
f1bd2543 JH |
861 | NEXT_PASS (pass_reassoc); |
862 | NEXT_PASS (pass_dce); | |
f1bd2543 JH |
863 | NEXT_PASS (pass_forwprop); |
864 | NEXT_PASS (pass_phiopt); | |
865 | NEXT_PASS (pass_object_sizes); | |
a4b8a65f | 866 | NEXT_PASS (pass_ccp); |
324d2217 | 867 | NEXT_PASS (pass_copy_prop); |
f1bd2543 | 868 | NEXT_PASS (pass_cse_sincos); |
03bd2f1a | 869 | NEXT_PASS (pass_optimize_bswap); |
f1bd2543 JH |
870 | NEXT_PASS (pass_split_crit_edges); |
871 | NEXT_PASS (pass_pre); | |
f1bd2543 JH |
872 | NEXT_PASS (pass_sink_code); |
873 | NEXT_PASS (pass_tree_loop); | |
874 | { | |
8ddbbcae | 875 | struct opt_pass **p = &pass_tree_loop.pass.sub; |
f1bd2543 | 876 | NEXT_PASS (pass_tree_loop_init); |
c86a3947 | 877 | NEXT_PASS (pass_lim); |
f1bd2543 | 878 | NEXT_PASS (pass_copy_prop); |
bbc8a8dc | 879 | NEXT_PASS (pass_dce_loop); |
f1bd2543 JH |
880 | NEXT_PASS (pass_tree_unswitch); |
881 | NEXT_PASS (pass_scev_cprop); | |
f1bd2543 | 882 | NEXT_PASS (pass_record_bounds); |
3d8864c0 | 883 | NEXT_PASS (pass_check_data_deps); |
dea61d92 | 884 | NEXT_PASS (pass_loop_distribution); |
d4332d00 SP |
885 | NEXT_PASS (pass_copy_prop); |
886 | NEXT_PASS (pass_graphite); | |
204b560f | 887 | { |
d4332d00 | 888 | struct opt_pass **p = &pass_graphite.pass.sub; |
d4332d00 | 889 | NEXT_PASS (pass_graphite_transforms); |
9dac82c4 | 890 | NEXT_PASS (pass_lim); |
caaf41d0 | 891 | NEXT_PASS (pass_copy_prop); |
204b560f | 892 | NEXT_PASS (pass_dce_loop); |
204b560f | 893 | } |
f1bd2543 JH |
894 | NEXT_PASS (pass_iv_canon); |
895 | NEXT_PASS (pass_if_conversion); | |
896 | NEXT_PASS (pass_vectorize); | |
897 | { | |
8ddbbcae | 898 | struct opt_pass **p = &pass_vectorize.pass.sub; |
f1bd2543 JH |
899 | NEXT_PASS (pass_lower_vector_ssa); |
900 | NEXT_PASS (pass_dce_loop); | |
901 | } | |
6a753d5f | 902 | NEXT_PASS (pass_predcom); |
f1bd2543 | 903 | NEXT_PASS (pass_complete_unroll); |
a70d6342 | 904 | NEXT_PASS (pass_slp_vectorize); |
5f40b3cb | 905 | NEXT_PASS (pass_parallelize_loops); |
f1bd2543 JH |
906 | NEXT_PASS (pass_loop_prefetch); |
907 | NEXT_PASS (pass_iv_optimize); | |
908 | NEXT_PASS (pass_tree_loop_done); | |
909 | } | |
910 | NEXT_PASS (pass_cse_reciprocals); | |
911 | NEXT_PASS (pass_reassoc); | |
912 | NEXT_PASS (pass_vrp); | |
913 | NEXT_PASS (pass_dominator); | |
f1bd2543 JH |
914 | /* The only const/copy propagation opportunities left after |
915 | DOM should be due to degenerate PHI nodes. So rather than | |
916 | run the full propagators, run a specialized pass which | |
917 | only examines PHIs to discover const/copy propagation | |
918 | opportunities. */ | |
919 | NEXT_PASS (pass_phi_only_cprop); | |
f1bd2543 | 920 | NEXT_PASS (pass_cd_dce); |
232abc3f | 921 | NEXT_PASS (pass_tracer); |
f1bd2543 JH |
922 | |
923 | /* FIXME: If DCE is not run before checking for uninitialized uses, | |
924 | we may get false warnings (e.g., testsuite/gcc.dg/uninit-5.c). | |
925 | However, this also causes us to misdiagnose cases that should be | |
926 | real warnings (e.g., testsuite/gcc.dg/pr18501.c). | |
b8698a0f | 927 | |
f1bd2543 JH |
928 | To fix the false positives in uninit-5.c, we would have to |
929 | account for the predicates protecting the set and the use of each | |
930 | variable. Using a representation like Gated Single Assignment | |
931 | may help. */ | |
932 | NEXT_PASS (pass_late_warn_uninitialized); | |
933 | NEXT_PASS (pass_dse); | |
934 | NEXT_PASS (pass_forwprop); | |
935 | NEXT_PASS (pass_phiopt); | |
44e10129 | 936 | NEXT_PASS (pass_fold_builtins); |
5b58b39b | 937 | NEXT_PASS (pass_optimize_widening_mul); |
f1bd2543 JH |
938 | NEXT_PASS (pass_tail_calls); |
939 | NEXT_PASS (pass_rename_ssa_copies); | |
940 | NEXT_PASS (pass_uncprop); | |
33977f81 | 941 | NEXT_PASS (pass_local_pure_const); |
f1bd2543 | 942 | } |
688a482d | 943 | NEXT_PASS (pass_lower_complex_O0); |
6d07ad98 | 944 | NEXT_PASS (pass_cleanup_eh); |
1d65f45c | 945 | NEXT_PASS (pass_lower_resx); |
c72321c9 | 946 | NEXT_PASS (pass_nrv); |
4e3825db | 947 | NEXT_PASS (pass_mudflap_2); |
c72321c9 | 948 | NEXT_PASS (pass_cleanup_cfg_post_optimizing); |
ef330312 | 949 | NEXT_PASS (pass_warn_function_noreturn); |
726a989a | 950 | |
ef330312 | 951 | NEXT_PASS (pass_expand); |
4e3825db | 952 | |
ef330312 | 953 | NEXT_PASS (pass_rest_of_compilation); |
f1bd2543 | 954 | { |
8ddbbcae | 955 | struct opt_pass **p = &pass_rest_of_compilation.pass.sub; |
f1bd2543 JH |
956 | NEXT_PASS (pass_init_function); |
957 | NEXT_PASS (pass_jump); | |
f1bd2543 JH |
958 | NEXT_PASS (pass_rtl_eh); |
959 | NEXT_PASS (pass_initial_value_sets); | |
960 | NEXT_PASS (pass_unshare_all_rtl); | |
7114321e | 961 | NEXT_PASS (pass_instantiate_virtual_regs); |
45dbce1b | 962 | NEXT_PASS (pass_into_cfg_layout_mode); |
f1bd2543 JH |
963 | NEXT_PASS (pass_jump2); |
964 | NEXT_PASS (pass_lower_subreg); | |
6fb5fa3c | 965 | NEXT_PASS (pass_df_initialize_opt); |
f1bd2543 JH |
966 | NEXT_PASS (pass_cse); |
967 | NEXT_PASS (pass_rtl_fwprop); | |
5f39ad47 SB |
968 | NEXT_PASS (pass_rtl_cprop); |
969 | NEXT_PASS (pass_rtl_pre); | |
970 | NEXT_PASS (pass_rtl_hoist); | |
971 | NEXT_PASS (pass_rtl_cprop); | |
972 | NEXT_PASS (pass_rtl_store_motion); | |
973 | NEXT_PASS (pass_cse_after_global_opts); | |
f1bd2543 | 974 | NEXT_PASS (pass_rtl_ifcvt); |
1833192f | 975 | NEXT_PASS (pass_reginfo_init); |
f1bd2543 JH |
976 | /* Perform loop optimizations. It might be better to do them a bit |
977 | sooner, but we want the profile feedback to work more | |
978 | efficiently. */ | |
979 | NEXT_PASS (pass_loop2); | |
980 | { | |
8ddbbcae | 981 | struct opt_pass **p = &pass_loop2.pass.sub; |
f1bd2543 JH |
982 | NEXT_PASS (pass_rtl_loop_init); |
983 | NEXT_PASS (pass_rtl_move_loop_invariants); | |
984 | NEXT_PASS (pass_rtl_unswitch); | |
985 | NEXT_PASS (pass_rtl_unroll_and_peel_loops); | |
986 | NEXT_PASS (pass_rtl_doloop); | |
987 | NEXT_PASS (pass_rtl_loop_done); | |
988 | *p = NULL; | |
989 | } | |
990 | NEXT_PASS (pass_web); | |
5f39ad47 | 991 | NEXT_PASS (pass_rtl_cprop); |
f1bd2543 | 992 | NEXT_PASS (pass_cse2); |
6fb5fa3c | 993 | NEXT_PASS (pass_rtl_dse1); |
f1bd2543 | 994 | NEXT_PASS (pass_rtl_fwprop_addr); |
6fb5fa3c DB |
995 | NEXT_PASS (pass_inc_dec); |
996 | NEXT_PASS (pass_initialize_regs); | |
6fb5fa3c | 997 | NEXT_PASS (pass_ud_rtl_dce); |
f1bd2543 JH |
998 | NEXT_PASS (pass_combine); |
999 | NEXT_PASS (pass_if_after_combine); | |
1000 | NEXT_PASS (pass_partition_blocks); | |
1001 | NEXT_PASS (pass_regmove); | |
d25aa7ab | 1002 | NEXT_PASS (pass_outof_cfg_layout_mode); |
f1bd2543 JH |
1003 | NEXT_PASS (pass_split_all_insns); |
1004 | NEXT_PASS (pass_lower_subreg2); | |
6fb5fa3c DB |
1005 | NEXT_PASS (pass_df_initialize_no_opt); |
1006 | NEXT_PASS (pass_stack_ptr_mod); | |
f1bd2543 | 1007 | NEXT_PASS (pass_mode_switching); |
d8d72314 | 1008 | NEXT_PASS (pass_match_asm_constraints); |
f1bd2543 | 1009 | NEXT_PASS (pass_sms); |
ce18efcb | 1010 | NEXT_PASS (pass_sched); |
058e97ec | 1011 | NEXT_PASS (pass_ira); |
f1bd2543 JH |
1012 | NEXT_PASS (pass_postreload); |
1013 | { | |
8ddbbcae | 1014 | struct opt_pass **p = &pass_postreload.pass.sub; |
f1bd2543 JH |
1015 | NEXT_PASS (pass_postreload_cse); |
1016 | NEXT_PASS (pass_gcse2); | |
6fb5fa3c | 1017 | NEXT_PASS (pass_split_after_reload); |
87a0ebfd | 1018 | NEXT_PASS (pass_implicit_zee); |
e692f276 | 1019 | NEXT_PASS (pass_compare_elim_after_reload); |
6fb5fa3c DB |
1020 | NEXT_PASS (pass_branch_target_load_optimize1); |
1021 | NEXT_PASS (pass_thread_prologue_and_epilogue); | |
1022 | NEXT_PASS (pass_rtl_dse2); | |
f1bd2543 JH |
1023 | NEXT_PASS (pass_stack_adjustments); |
1024 | NEXT_PASS (pass_peephole2); | |
1025 | NEXT_PASS (pass_if_after_reload); | |
1026 | NEXT_PASS (pass_regrename); | |
6fb5fa3c DB |
1027 | NEXT_PASS (pass_cprop_hardreg); |
1028 | NEXT_PASS (pass_fast_rtl_dce); | |
f1bd2543 | 1029 | NEXT_PASS (pass_reorder_blocks); |
6fb5fa3c | 1030 | NEXT_PASS (pass_branch_target_load_optimize2); |
f1bd2543 | 1031 | NEXT_PASS (pass_leaf_regs); |
6fb5fa3c | 1032 | NEXT_PASS (pass_split_before_sched2); |
f1bd2543 | 1033 | NEXT_PASS (pass_sched2); |
f1bd2543 | 1034 | NEXT_PASS (pass_stack_regs); |
6fb5fa3c | 1035 | { |
8ddbbcae | 1036 | struct opt_pass **p = &pass_stack_regs.pass.sub; |
6fb5fa3c DB |
1037 | NEXT_PASS (pass_split_before_regstack); |
1038 | NEXT_PASS (pass_stack_regs_run); | |
1039 | } | |
f1bd2543 JH |
1040 | NEXT_PASS (pass_compute_alignments); |
1041 | NEXT_PASS (pass_duplicate_computed_gotos); | |
1042 | NEXT_PASS (pass_variable_tracking); | |
1043 | NEXT_PASS (pass_free_cfg); | |
1044 | NEXT_PASS (pass_machine_reorg); | |
1045 | NEXT_PASS (pass_cleanup_barriers); | |
1046 | NEXT_PASS (pass_delay_slots); | |
1047 | NEXT_PASS (pass_split_for_shorten_branches); | |
1048 | NEXT_PASS (pass_convert_to_eh_region_ranges); | |
1049 | NEXT_PASS (pass_shorten_branches); | |
1050 | NEXT_PASS (pass_set_nothrow_function_flags); | |
1051 | NEXT_PASS (pass_final); | |
1052 | } | |
0b738568 | 1053 | NEXT_PASS (pass_df_finish); |
f1bd2543 | 1054 | } |
ef330312 PB |
1055 | NEXT_PASS (pass_clean_state); |
1056 | *p = NULL; | |
1057 | ||
ef330312 PB |
1058 | #undef NEXT_PASS |
1059 | ||
1060 | /* Register the passes with the tree dump code. */ | |
9e016eba | 1061 | register_dump_files (all_lowering_passes, PROP_gimple_any); |
b8698a0f | 1062 | register_dump_files (all_small_ipa_passes, |
d7f09764 DN |
1063 | PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh |
1064 | | PROP_cfg); | |
b8698a0f | 1065 | register_dump_files (all_regular_ipa_passes, |
d7f09764 DN |
1066 | PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh |
1067 | | PROP_cfg); | |
b8698a0f | 1068 | register_dump_files (all_lto_gen_passes, |
bbbe4e7b PB |
1069 | PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh |
1070 | | PROP_cfg); | |
b8698a0f | 1071 | register_dump_files (all_passes, |
bbbe4e7b PB |
1072 | PROP_gimple_any | PROP_gimple_lcf | PROP_gimple_leh |
1073 | | PROP_cfg); | |
ef330312 PB |
1074 | } |
1075 | ||
a5093353 JH |
1076 | /* If we are in IPA mode (i.e., current_function_decl is NULL), call |
1077 | function CALLBACK for every function in the call graph. Otherwise, | |
b8698a0f | 1078 | call CALLBACK on the current function. */ |
bbbe4e7b | 1079 | |
ef330312 | 1080 | static void |
a5093353 | 1081 | do_per_function (void (*callback) (void *data), void *data) |
ef330312 | 1082 | { |
a5093353 JH |
1083 | if (current_function_decl) |
1084 | callback (data); | |
1085 | else | |
1086 | { | |
1087 | struct cgraph_node *node; | |
1088 | for (node = cgraph_nodes; node; node = node->next) | |
21ecdec5 JH |
1089 | if (node->analyzed && gimple_has_body_p (node->decl) |
1090 | && (!node->clone_of || node->decl != node->clone_of->decl)) | |
a5093353 JH |
1091 | { |
1092 | push_cfun (DECL_STRUCT_FUNCTION (node->decl)); | |
1093 | current_function_decl = node->decl; | |
1094 | callback (data); | |
d7f09764 DN |
1095 | if (!flag_wpa) |
1096 | { | |
1097 | free_dominance_info (CDI_DOMINATORS); | |
1098 | free_dominance_info (CDI_POST_DOMINATORS); | |
1099 | } | |
a5093353 JH |
1100 | current_function_decl = NULL; |
1101 | pop_cfun (); | |
1102 | ggc_collect (); | |
1103 | } | |
1104 | } | |
1105 | } | |
1106 | ||
873aa8f5 JH |
1107 | /* Because inlining might remove no-longer reachable nodes, we need to |
1108 | keep the array visible to garbage collector to avoid reading collected | |
1109 | out nodes. */ | |
1110 | static int nnodes; | |
a9429e29 | 1111 | static GTY ((length ("nnodes"))) cgraph_node_ptr *order; |
873aa8f5 JH |
1112 | |
1113 | /* If we are in IPA mode (i.e., current_function_decl is NULL), call | |
1114 | function CALLBACK for every function in the call graph. Otherwise, | |
090fa0ab GF |
1115 | call CALLBACK on the current function. |
1116 | This function is global so that plugins can use it. */ | |
1117 | void | |
873aa8f5 JH |
1118 | do_per_function_toporder (void (*callback) (void *data), void *data) |
1119 | { | |
1120 | int i; | |
1121 | ||
1122 | if (current_function_decl) | |
1123 | callback (data); | |
1124 | else | |
1125 | { | |
1126 | gcc_assert (!order); | |
a9429e29 | 1127 | order = ggc_alloc_vec_cgraph_node_ptr (cgraph_n_nodes); |
af8bca3c | 1128 | nnodes = ipa_reverse_postorder (order); |
257eb6e3 JH |
1129 | for (i = nnodes - 1; i >= 0; i--) |
1130 | order[i]->process = 1; | |
873aa8f5 JH |
1131 | for (i = nnodes - 1; i >= 0; i--) |
1132 | { | |
1133 | struct cgraph_node *node = order[i]; | |
1134 | ||
1135 | /* Allow possibly removed nodes to be garbage collected. */ | |
1136 | order[i] = NULL; | |
257eb6e3 | 1137 | node->process = 0; |
c47d0034 | 1138 | if (cgraph_function_with_gimple_body_p (node)) |
873aa8f5 JH |
1139 | { |
1140 | push_cfun (DECL_STRUCT_FUNCTION (node->decl)); | |
1141 | current_function_decl = node->decl; | |
1142 | callback (data); | |
1143 | free_dominance_info (CDI_DOMINATORS); | |
1144 | free_dominance_info (CDI_POST_DOMINATORS); | |
1145 | current_function_decl = NULL; | |
1146 | pop_cfun (); | |
1147 | ggc_collect (); | |
1148 | } | |
1149 | } | |
1150 | } | |
1151 | ggc_free (order); | |
1152 | order = NULL; | |
1153 | nnodes = 0; | |
1154 | } | |
1155 | ||
a5093353 | 1156 | /* Perform all TODO actions that ought to be done on each function. */ |
ef330312 | 1157 | |
a5093353 JH |
1158 | static void |
1159 | execute_function_todo (void *data) | |
1160 | { | |
1161 | unsigned int flags = (size_t)data; | |
a5093353 | 1162 | flags &= ~cfun->last_verified; |
bbbe4e7b PB |
1163 | if (!flags) |
1164 | return; | |
9fe0cb7d | 1165 | |
1994bfea | 1166 | /* Always cleanup the CFG before trying to update SSA. */ |
ef330312 PB |
1167 | if (flags & TODO_cleanup_cfg) |
1168 | { | |
592c303d | 1169 | bool cleanup = cleanup_tree_cfg (); |
c4f548b8 | 1170 | |
1994bfea JH |
1171 | if (cleanup && (cfun->curr_properties & PROP_ssa)) |
1172 | flags |= TODO_remove_unused_locals; | |
b8698a0f | 1173 | |
c4f548b8 DN |
1174 | /* When cleanup_tree_cfg merges consecutive blocks, it may |
1175 | perform some simplistic propagation when removing single | |
1176 | valued PHI nodes. This propagation may, in turn, cause the | |
1177 | SSA form to become out-of-date (see PR 22037). So, even | |
1178 | if the parent pass had not scheduled an SSA update, we may | |
1179 | still need to do one. */ | |
5006671f | 1180 | if (!(flags & TODO_update_ssa_any) && need_ssa_update_p (cfun)) |
c4f548b8 | 1181 | flags |= TODO_update_ssa; |
ef330312 | 1182 | } |
f6db1481 | 1183 | |
563cb6be DN |
1184 | if (flags & TODO_update_ssa_any) |
1185 | { | |
1186 | unsigned update_flags = flags & TODO_update_ssa_any; | |
1187 | update_ssa (update_flags); | |
a5093353 | 1188 | cfun->last_verified &= ~TODO_verify_ssa; |
563cb6be | 1189 | } |
b8698a0f | 1190 | |
7b0e48fb DB |
1191 | if (flags & TODO_rebuild_alias) |
1192 | { | |
f61c8291 | 1193 | execute_update_addresses_taken (); |
7b0e48fb | 1194 | compute_may_aliases (); |
7b0e48fb | 1195 | } |
f61c8291 EB |
1196 | else if (optimize && (flags & TODO_update_address_taken)) |
1197 | execute_update_addresses_taken (); | |
b8698a0f | 1198 | |
3f519b35 RG |
1199 | if (flags & TODO_remove_unused_locals) |
1200 | remove_unused_locals (); | |
1201 | ||
726a989a | 1202 | if ((flags & TODO_dump_func) && dump_file && current_function_decl) |
ef330312 | 1203 | { |
a5093353 | 1204 | if (cfun->curr_properties & PROP_trees) |
726a989a | 1205 | dump_function_to_file (current_function_decl, dump_file, dump_flags); |
a68e7e6c | 1206 | else |
5e34206b | 1207 | { |
a68e7e6c PB |
1208 | if (dump_flags & TDF_SLIM) |
1209 | print_rtl_slim_with_bb (dump_file, get_insns (), dump_flags); | |
a5093353 JH |
1210 | else if ((cfun->curr_properties & PROP_cfg) |
1211 | && (dump_flags & TDF_BLOCKS)) | |
a68e7e6c PB |
1212 | print_rtl_with_bb (dump_file, get_insns ()); |
1213 | else | |
1214 | print_rtl (dump_file, get_insns ()); | |
1215 | ||
726a989a | 1216 | if ((cfun->curr_properties & PROP_cfg) |
a68e7e6c | 1217 | && graph_dump_format != no_graph |
5e34206b JJ |
1218 | && (dump_flags & TDF_GRAPH)) |
1219 | print_rtl_graph_with_bb (dump_file_name, get_insns ()); | |
1220 | } | |
ef330312 PB |
1221 | |
1222 | /* Flush the file. If verification fails, we won't be able to | |
1223 | close the file before aborting. */ | |
1224 | fflush (dump_file); | |
1225 | } | |
a5093353 | 1226 | |
45a80bb9 | 1227 | if (flags & TODO_rebuild_frequencies) |
b35366ce | 1228 | rebuild_frequencies (); |
45a80bb9 | 1229 | |
cf9712cc JH |
1230 | if (flags & TODO_rebuild_cgraph_edges) |
1231 | rebuild_cgraph_edges (); | |
1232 | ||
c9d6130e RG |
1233 | /* If we've seen errors do not bother running any verifiers. */ |
1234 | if (seen_error ()) | |
1235 | return; | |
1236 | ||
a5093353 | 1237 | #if defined ENABLE_CHECKING |
a3b9e73c SP |
1238 | if (flags & TODO_verify_ssa |
1239 | || (current_loops && loops_state_satisfies_p (LOOP_CLOSED_SSA))) | |
a5093353 JH |
1240 | verify_ssa (true); |
1241 | if (flags & TODO_verify_flow) | |
1242 | verify_flow_info (); | |
1243 | if (flags & TODO_verify_stmts) | |
34019e28 | 1244 | verify_gimple_in_cfg (cfun); |
98b6e9dd | 1245 | if (current_loops && loops_state_satisfies_p (LOOP_CLOSED_SSA)) |
a3b9e73c | 1246 | verify_loop_closed_ssa (false); |
a36b8a1e JH |
1247 | if (flags & TODO_verify_rtl_sharing) |
1248 | verify_rtl_sharing (); | |
a5093353 JH |
1249 | #endif |
1250 | ||
1251 | cfun->last_verified = flags & TODO_verify_all; | |
1252 | } | |
1253 | ||
1254 | /* Perform all TODO actions. */ | |
1255 | static void | |
1256 | execute_todo (unsigned int flags) | |
1257 | { | |
1258 | #if defined ENABLE_CHECKING | |
5006671f RG |
1259 | if (cfun |
1260 | && need_ssa_update_p (cfun)) | |
a5093353 JH |
1261 | gcc_assert (flags & TODO_update_ssa_any); |
1262 | #endif | |
1263 | ||
a222c01a MM |
1264 | timevar_push (TV_TODO); |
1265 | ||
b02b9b53 ZD |
1266 | /* Inform the pass whether it is the first time it is run. */ |
1267 | first_pass_instance = (flags & TODO_mark_first_instance) != 0; | |
1268 | ||
0d6a035d JH |
1269 | statistics_fini_pass (); |
1270 | ||
a5093353 JH |
1271 | do_per_function (execute_function_todo, (void *)(size_t) flags); |
1272 | ||
f4b3ca72 JH |
1273 | /* Always remove functions just as before inlining: IPA passes might be |
1274 | interested to see bodies of extern inline functions that are not inlined | |
1275 | to analyze side effects. The full removal is done just at the end | |
1276 | of IPA pass queue. */ | |
1277 | if (flags & TODO_remove_functions) | |
a12f79f5 JH |
1278 | { |
1279 | gcc_assert (!cfun); | |
1280 | cgraph_remove_unreachable_nodes (true, dump_file); | |
1281 | } | |
f4b3ca72 | 1282 | |
726a989a | 1283 | if ((flags & TODO_dump_cgraph) && dump_file && !current_function_decl) |
ef330312 | 1284 | { |
a12f79f5 | 1285 | gcc_assert (!cfun); |
ef330312 PB |
1286 | dump_cgraph (dump_file); |
1287 | /* Flush the file. If verification fails, we won't be able to | |
1288 | close the file before aborting. */ | |
1289 | fflush (dump_file); | |
1290 | } | |
f6db1481 | 1291 | |
ef330312 | 1292 | if (flags & TODO_ggc_collect) |
726a989a | 1293 | ggc_collect (); |
6fb5fa3c | 1294 | |
b8698a0f | 1295 | /* Now that the dumping has been done, we can get rid of the optional |
6fb5fa3c DB |
1296 | df problems. */ |
1297 | if (flags & TODO_df_finish) | |
0d475361 | 1298 | df_finish_pass ((flags & TODO_df_verify) != 0); |
a222c01a MM |
1299 | |
1300 | timevar_pop (TV_TODO); | |
a5093353 | 1301 | } |
97b0ade3 | 1302 | |
6ac01510 ILT |
1303 | /* Verify invariants that should hold between passes. This is a place |
1304 | to put simple sanity checks. */ | |
1305 | ||
1306 | static void | |
1307 | verify_interpass_invariants (void) | |
1308 | { | |
77a74ed7 | 1309 | gcc_checking_assert (!fold_deferring_overflow_warnings_p ()); |
6ac01510 ILT |
1310 | } |
1311 | ||
a5093353 JH |
1312 | /* Clear the last verified flag. */ |
1313 | ||
1314 | static void | |
1315 | clear_last_verified (void *data ATTRIBUTE_UNUSED) | |
1316 | { | |
1317 | cfun->last_verified = 0; | |
1318 | } | |
1319 | ||
1320 | /* Helper function. Verify that the properties has been turn into the | |
1321 | properties expected by the pass. */ | |
bbbe4e7b | 1322 | |
582fd9ce | 1323 | #ifdef ENABLE_CHECKING |
a5093353 JH |
1324 | static void |
1325 | verify_curr_properties (void *data) | |
1326 | { | |
1327 | unsigned int props = (size_t)data; | |
1328 | gcc_assert ((cfun->curr_properties & props) == props); | |
1329 | } | |
582fd9ce | 1330 | #endif |
a5093353 | 1331 | |
17653c00 | 1332 | /* Initialize pass dump file. */ |
090fa0ab | 1333 | /* This is non-static so that the plugins can use it. */ |
17653c00 | 1334 | |
090fa0ab | 1335 | bool |
17653c00 JH |
1336 | pass_init_dump_file (struct opt_pass *pass) |
1337 | { | |
1338 | /* If a dump file name is present, open it if enabled. */ | |
1339 | if (pass->static_pass_number != -1) | |
1340 | { | |
1341 | bool initializing_dump = !dump_initialized_p (pass->static_pass_number); | |
1342 | dump_file_name = get_dump_file_name (pass->static_pass_number); | |
1343 | dump_file = dump_begin (pass->static_pass_number, &dump_flags); | |
1344 | if (dump_file && current_function_decl) | |
1345 | { | |
1346 | const char *dname, *aname; | |
581985d7 | 1347 | struct cgraph_node *node = cgraph_get_node (current_function_decl); |
17653c00 JH |
1348 | dname = lang_hooks.decl_printable_name (current_function_decl, 2); |
1349 | aname = (IDENTIFIER_POINTER | |
1350 | (DECL_ASSEMBLER_NAME (current_function_decl))); | |
3716f233 | 1351 | fprintf (dump_file, "\n;; Function %s (%s)%s\n\n", dname, aname, |
5fefcf92 | 1352 | node->frequency == NODE_FREQUENCY_HOT |
17653c00 | 1353 | ? " (hot)" |
5fefcf92 | 1354 | : node->frequency == NODE_FREQUENCY_UNLIKELY_EXECUTED |
17653c00 | 1355 | ? " (unlikely executed)" |
5fefcf92 JH |
1356 | : node->frequency == NODE_FREQUENCY_EXECUTED_ONCE |
1357 | ? " (executed once)" | |
17653c00 JH |
1358 | : ""); |
1359 | } | |
1360 | return initializing_dump; | |
1361 | } | |
1362 | else | |
1363 | return false; | |
1364 | } | |
1365 | ||
1366 | /* Flush PASS dump file. */ | |
090fa0ab | 1367 | /* This is non-static so that plugins can use it. */ |
17653c00 | 1368 | |
090fa0ab | 1369 | void |
17653c00 JH |
1370 | pass_fini_dump_file (struct opt_pass *pass) |
1371 | { | |
1372 | /* Flush and close dump file. */ | |
1373 | if (dump_file_name) | |
1374 | { | |
1375 | free (CONST_CAST (char *, dump_file_name)); | |
1376 | dump_file_name = NULL; | |
1377 | } | |
1378 | ||
1379 | if (dump_file) | |
1380 | { | |
1381 | dump_end (pass->static_pass_number, dump_file); | |
1382 | dump_file = NULL; | |
1383 | } | |
1384 | } | |
1385 | ||
a5093353 JH |
1386 | /* After executing the pass, apply expected changes to the function |
1387 | properties. */ | |
17653c00 | 1388 | |
a5093353 JH |
1389 | static void |
1390 | update_properties_after_pass (void *data) | |
1391 | { | |
d3bfe4de | 1392 | struct opt_pass *pass = (struct opt_pass *) data; |
a5093353 JH |
1393 | cfun->curr_properties = (cfun->curr_properties | pass->properties_provided) |
1394 | & ~pass->properties_destroyed; | |
f6db1481 RH |
1395 | } |
1396 | ||
1920df6c | 1397 | /* Execute summary generation for all of the passes in IPA_PASS. */ |
17653c00 | 1398 | |
d7f09764 | 1399 | void |
7e5487a2 | 1400 | execute_ipa_summary_passes (struct ipa_opt_pass_d *ipa_pass) |
17653c00 | 1401 | { |
1920df6c | 1402 | while (ipa_pass) |
17653c00 JH |
1403 | { |
1404 | struct opt_pass *pass = &ipa_pass->pass; | |
1920df6c KZ |
1405 | |
1406 | /* Execute all of the IPA_PASSes in the list. */ | |
b8698a0f | 1407 | if (ipa_pass->pass.type == IPA_PASS |
d7f09764 DN |
1408 | && (!pass->gate || pass->gate ()) |
1409 | && ipa_pass->generate_summary) | |
17653c00 JH |
1410 | { |
1411 | pass_init_dump_file (pass); | |
d7f09764 DN |
1412 | |
1413 | /* If a timevar is present, start it. */ | |
1414 | if (pass->tv_id) | |
1415 | timevar_push (pass->tv_id); | |
1416 | ||
1920df6c | 1417 | ipa_pass->generate_summary (); |
d7f09764 DN |
1418 | |
1419 | /* Stop timevar. */ | |
1420 | if (pass->tv_id) | |
1421 | timevar_pop (pass->tv_id); | |
1422 | ||
17653c00 JH |
1423 | pass_fini_dump_file (pass); |
1424 | } | |
7e5487a2 | 1425 | ipa_pass = (struct ipa_opt_pass_d *)ipa_pass->pass.next; |
17653c00 JH |
1426 | } |
1427 | } | |
1428 | ||
1429 | /* Execute IPA_PASS function transform on NODE. */ | |
1430 | ||
1431 | static void | |
1432 | execute_one_ipa_transform_pass (struct cgraph_node *node, | |
7e5487a2 | 1433 | struct ipa_opt_pass_d *ipa_pass) |
17653c00 JH |
1434 | { |
1435 | struct opt_pass *pass = &ipa_pass->pass; | |
1436 | unsigned int todo_after = 0; | |
1437 | ||
1438 | current_pass = pass; | |
1439 | if (!ipa_pass->function_transform) | |
1440 | return; | |
1441 | ||
1442 | /* Note that the folders should only create gimple expressions. | |
1443 | This is a hack until the new folder is ready. */ | |
1444 | in_gimple_form = (cfun && (cfun->curr_properties & PROP_trees)) != 0; | |
1445 | ||
1446 | pass_init_dump_file (pass); | |
1447 | ||
1448 | /* Run pre-pass verification. */ | |
a12f79f5 | 1449 | execute_todo (ipa_pass->function_transform_todo_flags_start); |
17653c00 JH |
1450 | |
1451 | /* If a timevar is present, start it. */ | |
7072a650 | 1452 | if (pass->tv_id != TV_NONE) |
17653c00 JH |
1453 | timevar_push (pass->tv_id); |
1454 | ||
1455 | /* Do it! */ | |
1456 | todo_after = ipa_pass->function_transform (node); | |
1457 | ||
1458 | /* Stop timevar. */ | |
7072a650 | 1459 | if (pass->tv_id != TV_NONE) |
17653c00 JH |
1460 | timevar_pop (pass->tv_id); |
1461 | ||
1462 | /* Run post-pass cleanup and verification. */ | |
1463 | execute_todo (todo_after); | |
1464 | verify_interpass_invariants (); | |
1465 | ||
1466 | pass_fini_dump_file (pass); | |
1467 | ||
1468 | current_pass = NULL; | |
17653c00 JH |
1469 | } |
1470 | ||
d7f09764 | 1471 | /* For the current function, execute all ipa transforms. */ |
9e016eba | 1472 | |
d7f09764 DN |
1473 | void |
1474 | execute_all_ipa_transforms (void) | |
1475 | { | |
0e3776db JH |
1476 | struct cgraph_node *node; |
1477 | if (!cfun) | |
1478 | return; | |
581985d7 | 1479 | node = cgraph_get_node (current_function_decl); |
bc58d7e1 | 1480 | |
0e3776db | 1481 | if (node->ipa_transforms_to_apply) |
17653c00 JH |
1482 | { |
1483 | unsigned int i; | |
17653c00 | 1484 | |
0e3776db | 1485 | for (i = 0; i < VEC_length (ipa_opt_pass, node->ipa_transforms_to_apply); |
17653c00 JH |
1486 | i++) |
1487 | execute_one_ipa_transform_pass (node, | |
d7f09764 | 1488 | VEC_index (ipa_opt_pass, |
0e3776db | 1489 | node->ipa_transforms_to_apply, |
17653c00 | 1490 | i)); |
0e3776db JH |
1491 | VEC_free (ipa_opt_pass, heap, node->ipa_transforms_to_apply); |
1492 | node->ipa_transforms_to_apply = NULL; | |
17653c00 | 1493 | } |
d7f09764 DN |
1494 | } |
1495 | ||
1496 | /* Execute PASS. */ | |
1497 | ||
090fa0ab | 1498 | bool |
d7f09764 DN |
1499 | execute_one_pass (struct opt_pass *pass) |
1500 | { | |
1501 | bool initializing_dump; | |
1502 | unsigned int todo_after = 0; | |
1503 | ||
090fa0ab GF |
1504 | bool gate_status; |
1505 | ||
d7f09764 DN |
1506 | /* IPA passes are executed on whole program, so cfun should be NULL. |
1507 | Other passes need function context set. */ | |
1508 | if (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS) | |
1509 | gcc_assert (!cfun && !current_function_decl); | |
1510 | else | |
1511 | gcc_assert (cfun && current_function_decl); | |
17653c00 | 1512 | |
6fb5fa3c | 1513 | current_pass = pass; |
726a989a | 1514 | |
090fa0ab GF |
1515 | /* Check whether gate check should be avoided. |
1516 | User controls the value of the gate through the parameter "gate_status". */ | |
1517 | gate_status = (pass->gate == NULL) ? true : pass->gate(); | |
1518 | ||
1519 | /* Override gate with plugin. */ | |
1520 | invoke_plugin_callbacks (PLUGIN_OVERRIDE_GATE, &gate_status); | |
1521 | ||
1522 | if (!gate_status) | |
1523 | { | |
1524 | current_pass = NULL; | |
1525 | return false; | |
1526 | } | |
1527 | ||
1528 | /* Pass execution event trigger: useful to identify passes being | |
1529 | executed. */ | |
1530 | invoke_plugin_callbacks (PLUGIN_PASS_EXECUTION, pass); | |
f6db1481 | 1531 | |
b9cafe60 | 1532 | if (!quiet_flag && !cfun) |
873aa8f5 JH |
1533 | fprintf (stderr, " <%s>", pass->name ? pass->name : ""); |
1534 | ||
ef330312 PB |
1535 | /* Note that the folders should only create gimple expressions. |
1536 | This is a hack until the new folder is ready. */ | |
a5093353 | 1537 | in_gimple_form = (cfun && (cfun->curr_properties & PROP_trees)) != 0; |
f6db1481 | 1538 | |
5006671f RG |
1539 | initializing_dump = pass_init_dump_file (pass); |
1540 | ||
ef330312 | 1541 | /* Run pre-pass verification. */ |
bbbe4e7b PB |
1542 | execute_todo (pass->todo_flags_start); |
1543 | ||
a5093353 JH |
1544 | #ifdef ENABLE_CHECKING |
1545 | do_per_function (verify_curr_properties, | |
1546 | (void *)(size_t)pass->properties_required); | |
1547 | #endif | |
f6db1481 | 1548 | |
ef330312 | 1549 | /* If a timevar is present, start it. */ |
7072a650 | 1550 | if (pass->tv_id != TV_NONE) |
ef330312 | 1551 | timevar_push (pass->tv_id); |
f6db1481 | 1552 | |
ef330312 PB |
1553 | /* Do it! */ |
1554 | if (pass->execute) | |
bbbe4e7b | 1555 | { |
c2924966 | 1556 | todo_after = pass->execute (); |
a5093353 | 1557 | do_per_function (clear_last_verified, NULL); |
bbbe4e7b | 1558 | } |
f6db1481 | 1559 | |
ef330312 | 1560 | /* Stop timevar. */ |
7072a650 | 1561 | if (pass->tv_id != TV_NONE) |
ef330312 | 1562 | timevar_pop (pass->tv_id); |
f6db1481 | 1563 | |
a5093353 | 1564 | do_per_function (update_properties_after_pass, pass); |
bbbe4e7b PB |
1565 | |
1566 | if (initializing_dump | |
1567 | && dump_file | |
1568 | && graph_dump_format != no_graph | |
6f1fe305 | 1569 | && cfun |
a5093353 JH |
1570 | && (cfun->curr_properties & (PROP_cfg | PROP_rtl)) |
1571 | == (PROP_cfg | PROP_rtl)) | |
bbbe4e7b PB |
1572 | { |
1573 | get_dump_file_info (pass->static_pass_number)->flags |= TDF_GRAPH; | |
1574 | dump_flags |= TDF_GRAPH; | |
1575 | clean_graph_dump_file (dump_file_name); | |
1576 | } | |
1577 | ||
ef330312 | 1578 | /* Run post-pass cleanup and verification. */ |
c2924966 | 1579 | execute_todo (todo_after | pass->todo_flags_finish); |
6ac01510 | 1580 | verify_interpass_invariants (); |
17653c00 | 1581 | if (pass->type == IPA_PASS) |
0e3776db JH |
1582 | { |
1583 | struct cgraph_node *node; | |
c47d0034 JH |
1584 | FOR_EACH_FUNCTION_WITH_GIMPLE_BODY (node) |
1585 | VEC_safe_push (ipa_opt_pass, heap, node->ipa_transforms_to_apply, | |
1586 | (struct ipa_opt_pass_d *)pass); | |
0e3776db | 1587 | } |
f6db1481 | 1588 | |
f45e0ad1 JH |
1589 | if (!current_function_decl) |
1590 | cgraph_process_new_functions (); | |
1591 | ||
17653c00 | 1592 | pass_fini_dump_file (pass); |
f6db1481 | 1593 | |
17653c00 | 1594 | if (pass->type != SIMPLE_IPA_PASS && pass->type != IPA_PASS) |
e3b5732b JH |
1595 | gcc_assert (!(cfun->curr_properties & PROP_trees) |
1596 | || pass->type != RTL_PASS); | |
1597 | ||
6fb5fa3c | 1598 | current_pass = NULL; |
91851351 | 1599 | |
ef330312 | 1600 | return true; |
f6db1481 RH |
1601 | } |
1602 | ||
ef330312 | 1603 | void |
8ddbbcae | 1604 | execute_pass_list (struct opt_pass *pass) |
f6db1481 | 1605 | { |
ef330312 | 1606 | do |
f6db1481 | 1607 | { |
9e016eba JH |
1608 | gcc_assert (pass->type == GIMPLE_PASS |
1609 | || pass->type == RTL_PASS); | |
ef330312 PB |
1610 | if (execute_one_pass (pass) && pass->sub) |
1611 | execute_pass_list (pass->sub); | |
1612 | pass = pass->next; | |
f6db1481 | 1613 | } |
ef330312 | 1614 | while (pass); |
f6db1481 RH |
1615 | } |
1616 | ||
ef330312 | 1617 | /* Same as execute_pass_list but assume that subpasses of IPA passes |
d7f09764 DN |
1618 | are local passes. If SET is not NULL, write out summaries of only |
1619 | those node in SET. */ | |
1620 | ||
1621 | static void | |
1622 | ipa_write_summaries_2 (struct opt_pass *pass, cgraph_node_set set, | |
2942c502 | 1623 | varpool_node_set vset, |
d7f09764 DN |
1624 | struct lto_out_decl_state *state) |
1625 | { | |
1626 | while (pass) | |
1627 | { | |
1628 | struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *)pass; | |
1629 | gcc_assert (!current_function_decl); | |
1630 | gcc_assert (!cfun); | |
1631 | gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS); | |
1632 | if (pass->type == IPA_PASS | |
1633 | && ipa_pass->write_summary | |
1634 | && (!pass->gate || pass->gate ())) | |
1635 | { | |
1636 | /* If a timevar is present, start it. */ | |
1637 | if (pass->tv_id) | |
1638 | timevar_push (pass->tv_id); | |
1639 | ||
f59292da JH |
1640 | pass_init_dump_file (pass); |
1641 | ||
2942c502 | 1642 | ipa_pass->write_summary (set,vset); |
d7f09764 | 1643 | |
f59292da JH |
1644 | pass_fini_dump_file (pass); |
1645 | ||
d7f09764 DN |
1646 | /* If a timevar is present, start it. */ |
1647 | if (pass->tv_id) | |
1648 | timevar_pop (pass->tv_id); | |
1649 | } | |
1650 | ||
1651 | if (pass->sub && pass->sub->type != GIMPLE_PASS) | |
2942c502 | 1652 | ipa_write_summaries_2 (pass->sub, set, vset, state); |
d7f09764 DN |
1653 | |
1654 | pass = pass->next; | |
1655 | } | |
1656 | } | |
1657 | ||
1658 | /* Helper function of ipa_write_summaries. Creates and destroys the | |
1659 | decl state and calls ipa_write_summaries_2 for all passes that have | |
1660 | summaries. SET is the set of nodes to be written. */ | |
1661 | ||
1662 | static void | |
2942c502 | 1663 | ipa_write_summaries_1 (cgraph_node_set set, varpool_node_set vset) |
d7f09764 DN |
1664 | { |
1665 | struct lto_out_decl_state *state = lto_new_out_decl_state (); | |
f3380641 | 1666 | compute_ltrans_boundary (state, set, vset); |
5c4f225f | 1667 | |
d7f09764 DN |
1668 | lto_push_out_decl_state (state); |
1669 | ||
e792884f | 1670 | gcc_assert (!flag_wpa); |
2942c502 JH |
1671 | ipa_write_summaries_2 (all_regular_ipa_passes, set, vset, state); |
1672 | ipa_write_summaries_2 (all_lto_gen_passes, set, vset, state); | |
d7f09764 DN |
1673 | |
1674 | gcc_assert (lto_get_out_decl_state () == state); | |
1675 | lto_pop_out_decl_state (); | |
1676 | lto_delete_out_decl_state (state); | |
1677 | } | |
1678 | ||
1679 | /* Write out summaries for all the nodes in the callgraph. */ | |
1680 | ||
ef330312 | 1681 | void |
d7f09764 | 1682 | ipa_write_summaries (void) |
f6db1481 | 1683 | { |
d7f09764 | 1684 | cgraph_node_set set; |
2942c502 | 1685 | varpool_node_set vset; |
d7f09764 | 1686 | struct cgraph_node **order; |
2942c502 | 1687 | struct varpool_node *vnode; |
d7f09764 | 1688 | int i, order_pos; |
b8698a0f | 1689 | |
1da2ed5f | 1690 | if (!flag_generate_lto || seen_error ()) |
d7f09764 DN |
1691 | return; |
1692 | ||
d7f09764 DN |
1693 | set = cgraph_node_set_new (); |
1694 | ||
1695 | /* Create the callgraph set in the same order used in | |
1696 | cgraph_expand_all_functions. This mostly facilitates debugging, | |
1697 | since it causes the gimple file to be processed in the same order | |
1698 | as the source code. */ | |
1699 | order = XCNEWVEC (struct cgraph_node *, cgraph_n_nodes); | |
af8bca3c | 1700 | order_pos = ipa_reverse_postorder (order); |
d7f09764 DN |
1701 | gcc_assert (order_pos == cgraph_n_nodes); |
1702 | ||
1703 | for (i = order_pos - 1; i >= 0; i--) | |
8b220502 MJ |
1704 | { |
1705 | struct cgraph_node *node = order[i]; | |
1706 | ||
c47d0034 | 1707 | if (cgraph_function_with_gimple_body_p (node)) |
8b220502 MJ |
1708 | { |
1709 | /* When streaming out references to statements as part of some IPA | |
1710 | pass summary, the statements need to have uids assigned and the | |
1711 | following does that for all the IPA passes here. Naturally, this | |
1712 | ordering then matches the one IPA-passes get in their stmt_fixup | |
1713 | hooks. */ | |
1714 | ||
1715 | push_cfun (DECL_STRUCT_FUNCTION (node->decl)); | |
1716 | renumber_gimple_stmt_uids (); | |
1717 | pop_cfun (); | |
1718 | } | |
9b3cf76a | 1719 | if (node->analyzed) |
c47d0034 | 1720 | cgraph_node_set_add (set, node); |
8b220502 | 1721 | } |
2942c502 | 1722 | vset = varpool_node_set_new (); |
d7f09764 | 1723 | |
2942c502 JH |
1724 | for (vnode = varpool_nodes; vnode; vnode = vnode->next) |
1725 | if (vnode->needed && !vnode->alias) | |
1726 | varpool_node_set_add (vset, vnode); | |
1727 | ||
1728 | ipa_write_summaries_1 (set, vset); | |
d7f09764 DN |
1729 | |
1730 | free (order); | |
1cb1a99f JH |
1731 | free_cgraph_node_set (set); |
1732 | free_varpool_node_set (vset); | |
d7f09764 DN |
1733 | } |
1734 | ||
e792884f JH |
1735 | /* Same as execute_pass_list but assume that subpasses of IPA passes |
1736 | are local passes. If SET is not NULL, write out optimization summaries of | |
1737 | only those node in SET. */ | |
d7f09764 | 1738 | |
e792884f JH |
1739 | static void |
1740 | ipa_write_optimization_summaries_1 (struct opt_pass *pass, cgraph_node_set set, | |
2942c502 | 1741 | varpool_node_set vset, |
e792884f JH |
1742 | struct lto_out_decl_state *state) |
1743 | { | |
1744 | while (pass) | |
1745 | { | |
1746 | struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *)pass; | |
1747 | gcc_assert (!current_function_decl); | |
1748 | gcc_assert (!cfun); | |
1749 | gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS); | |
1750 | if (pass->type == IPA_PASS | |
1751 | && ipa_pass->write_optimization_summary | |
1752 | && (!pass->gate || pass->gate ())) | |
1753 | { | |
1754 | /* If a timevar is present, start it. */ | |
1755 | if (pass->tv_id) | |
1756 | timevar_push (pass->tv_id); | |
1757 | ||
f59292da JH |
1758 | pass_init_dump_file (pass); |
1759 | ||
2942c502 | 1760 | ipa_pass->write_optimization_summary (set, vset); |
e792884f | 1761 | |
f59292da JH |
1762 | pass_fini_dump_file (pass); |
1763 | ||
e792884f JH |
1764 | /* If a timevar is present, start it. */ |
1765 | if (pass->tv_id) | |
1766 | timevar_pop (pass->tv_id); | |
1767 | } | |
1768 | ||
1769 | if (pass->sub && pass->sub->type != GIMPLE_PASS) | |
2942c502 | 1770 | ipa_write_optimization_summaries_1 (pass->sub, set, vset, state); |
e792884f JH |
1771 | |
1772 | pass = pass->next; | |
1773 | } | |
1774 | } | |
1775 | ||
1776 | /* Write all the optimization summaries for the cgraph nodes in SET. If SET is | |
d7f09764 DN |
1777 | NULL, write out all summaries of all nodes. */ |
1778 | ||
1779 | void | |
2942c502 | 1780 | ipa_write_optimization_summaries (cgraph_node_set set, varpool_node_set vset) |
d7f09764 | 1781 | { |
e792884f | 1782 | struct lto_out_decl_state *state = lto_new_out_decl_state (); |
f1395d4a | 1783 | cgraph_node_set_iterator csi; |
f3380641 JH |
1784 | compute_ltrans_boundary (state, set, vset); |
1785 | ||
e792884f | 1786 | lto_push_out_decl_state (state); |
f1395d4a JH |
1787 | for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi)) |
1788 | { | |
1789 | struct cgraph_node *node = csi_node (csi); | |
1790 | /* When streaming out references to statements as part of some IPA | |
1791 | pass summary, the statements need to have uids assigned. | |
1792 | ||
1793 | For functions newly born at WPA stage we need to initialize | |
1794 | the uids here. */ | |
1795 | if (node->analyzed | |
1796 | && gimple_has_body_p (node->decl)) | |
1797 | { | |
1798 | push_cfun (DECL_STRUCT_FUNCTION (node->decl)); | |
1799 | renumber_gimple_stmt_uids (); | |
1800 | pop_cfun (); | |
1801 | } | |
1802 | } | |
e792884f JH |
1803 | |
1804 | gcc_assert (flag_wpa); | |
2942c502 JH |
1805 | ipa_write_optimization_summaries_1 (all_regular_ipa_passes, set, vset, state); |
1806 | ipa_write_optimization_summaries_1 (all_lto_gen_passes, set, vset, state); | |
e792884f JH |
1807 | |
1808 | gcc_assert (lto_get_out_decl_state () == state); | |
1809 | lto_pop_out_decl_state (); | |
1810 | lto_delete_out_decl_state (state); | |
d7f09764 DN |
1811 | } |
1812 | ||
1813 | /* Same as execute_pass_list but assume that subpasses of IPA passes | |
1814 | are local passes. */ | |
1815 | ||
1816 | static void | |
1817 | ipa_read_summaries_1 (struct opt_pass *pass) | |
1818 | { | |
1819 | while (pass) | |
f6db1481 | 1820 | { |
d7f09764 DN |
1821 | struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *) pass; |
1822 | ||
a5093353 JH |
1823 | gcc_assert (!current_function_decl); |
1824 | gcc_assert (!cfun); | |
17653c00 | 1825 | gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS); |
d7f09764 DN |
1826 | |
1827 | if (pass->gate == NULL || pass->gate ()) | |
17653c00 | 1828 | { |
d7f09764 | 1829 | if (pass->type == IPA_PASS && ipa_pass->read_summary) |
17653c00 | 1830 | { |
d7f09764 DN |
1831 | /* If a timevar is present, start it. */ |
1832 | if (pass->tv_id) | |
1833 | timevar_push (pass->tv_id); | |
1834 | ||
f59292da JH |
1835 | pass_init_dump_file (pass); |
1836 | ||
d7f09764 DN |
1837 | ipa_pass->read_summary (); |
1838 | ||
f59292da JH |
1839 | pass_fini_dump_file (pass); |
1840 | ||
d7f09764 DN |
1841 | /* Stop timevar. */ |
1842 | if (pass->tv_id) | |
1843 | timevar_pop (pass->tv_id); | |
17653c00 | 1844 | } |
d7f09764 DN |
1845 | |
1846 | if (pass->sub && pass->sub->type != GIMPLE_PASS) | |
1847 | ipa_read_summaries_1 (pass->sub); | |
17653c00 | 1848 | } |
d7f09764 DN |
1849 | pass = pass->next; |
1850 | } | |
1851 | } | |
1852 | ||
1853 | ||
1854 | /* Read all the summaries for all_regular_ipa_passes and all_lto_gen_passes. */ | |
1855 | ||
1856 | void | |
1857 | ipa_read_summaries (void) | |
1858 | { | |
e792884f | 1859 | ipa_read_summaries_1 (all_regular_ipa_passes); |
d7f09764 DN |
1860 | ipa_read_summaries_1 (all_lto_gen_passes); |
1861 | } | |
1862 | ||
e792884f JH |
1863 | /* Same as execute_pass_list but assume that subpasses of IPA passes |
1864 | are local passes. */ | |
1865 | ||
1866 | static void | |
1867 | ipa_read_optimization_summaries_1 (struct opt_pass *pass) | |
1868 | { | |
1869 | while (pass) | |
1870 | { | |
1871 | struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *) pass; | |
1872 | ||
1873 | gcc_assert (!current_function_decl); | |
1874 | gcc_assert (!cfun); | |
1875 | gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS); | |
1876 | ||
1877 | if (pass->gate == NULL || pass->gate ()) | |
1878 | { | |
1879 | if (pass->type == IPA_PASS && ipa_pass->read_optimization_summary) | |
1880 | { | |
1881 | /* If a timevar is present, start it. */ | |
1882 | if (pass->tv_id) | |
1883 | timevar_push (pass->tv_id); | |
1884 | ||
f59292da JH |
1885 | pass_init_dump_file (pass); |
1886 | ||
e792884f JH |
1887 | ipa_pass->read_optimization_summary (); |
1888 | ||
f59292da JH |
1889 | pass_fini_dump_file (pass); |
1890 | ||
e792884f JH |
1891 | /* Stop timevar. */ |
1892 | if (pass->tv_id) | |
1893 | timevar_pop (pass->tv_id); | |
1894 | } | |
1895 | ||
1896 | if (pass->sub && pass->sub->type != GIMPLE_PASS) | |
1897 | ipa_read_optimization_summaries_1 (pass->sub); | |
1898 | } | |
1899 | pass = pass->next; | |
1900 | } | |
1901 | } | |
1902 | ||
1903 | /* Read all the summaries for all_regular_ipa_passes and all_lto_gen_passes. */ | |
1904 | ||
1905 | void | |
1906 | ipa_read_optimization_summaries (void) | |
1907 | { | |
1908 | ipa_read_optimization_summaries_1 (all_regular_ipa_passes); | |
1909 | ipa_read_optimization_summaries_1 (all_lto_gen_passes); | |
1910 | } | |
1911 | ||
d7f09764 DN |
1912 | /* Same as execute_pass_list but assume that subpasses of IPA passes |
1913 | are local passes. */ | |
1914 | void | |
1915 | execute_ipa_pass_list (struct opt_pass *pass) | |
1916 | { | |
1917 | do | |
1918 | { | |
1919 | gcc_assert (!current_function_decl); | |
1920 | gcc_assert (!cfun); | |
1921 | gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS); | |
ef330312 | 1922 | if (execute_one_pass (pass) && pass->sub) |
9e016eba JH |
1923 | { |
1924 | if (pass->sub->type == GIMPLE_PASS) | |
090fa0ab GF |
1925 | { |
1926 | invoke_plugin_callbacks (PLUGIN_EARLY_GIMPLE_PASSES_START, NULL); | |
1927 | do_per_function_toporder ((void (*)(void *))execute_pass_list, | |
1928 | pass->sub); | |
1929 | invoke_plugin_callbacks (PLUGIN_EARLY_GIMPLE_PASSES_END, NULL); | |
1930 | } | |
17653c00 JH |
1931 | else if (pass->sub->type == SIMPLE_IPA_PASS |
1932 | || pass->sub->type == IPA_PASS) | |
9e016eba JH |
1933 | execute_ipa_pass_list (pass->sub); |
1934 | else | |
1935 | gcc_unreachable (); | |
1936 | } | |
d7f09764 DN |
1937 | gcc_assert (!current_function_decl); |
1938 | cgraph_process_new_functions (); | |
ef330312 | 1939 | pass = pass->next; |
f6db1481 | 1940 | } |
ef330312 | 1941 | while (pass); |
97b0ade3 | 1942 | } |
9fe0cb7d | 1943 | |
2c5721d9 MJ |
1944 | /* Execute stmt fixup hooks of all passes in PASS for NODE and STMTS. */ |
1945 | ||
1946 | static void | |
1947 | execute_ipa_stmt_fixups (struct opt_pass *pass, | |
1948 | struct cgraph_node *node, gimple *stmts) | |
1949 | { | |
1950 | while (pass) | |
1951 | { | |
1952 | /* Execute all of the IPA_PASSes in the list. */ | |
1953 | if (pass->type == IPA_PASS | |
1954 | && (!pass->gate || pass->gate ())) | |
1955 | { | |
1956 | struct ipa_opt_pass_d *ipa_pass = (struct ipa_opt_pass_d *) pass; | |
1957 | ||
1958 | if (ipa_pass->stmt_fixup) | |
1959 | { | |
1960 | pass_init_dump_file (pass); | |
1961 | /* If a timevar is present, start it. */ | |
1962 | if (pass->tv_id) | |
1963 | timevar_push (pass->tv_id); | |
1964 | ||
1965 | ipa_pass->stmt_fixup (node, stmts); | |
1966 | ||
1967 | /* Stop timevar. */ | |
1968 | if (pass->tv_id) | |
1969 | timevar_pop (pass->tv_id); | |
1970 | pass_fini_dump_file (pass); | |
1971 | } | |
1972 | if (pass->sub) | |
1973 | execute_ipa_stmt_fixups (pass->sub, node, stmts); | |
1974 | } | |
1975 | pass = pass->next; | |
1976 | } | |
1977 | } | |
1978 | ||
1979 | /* Execute stmt fixup hooks of all IPA passes for NODE and STMTS. */ | |
1980 | ||
1981 | void | |
1982 | execute_all_ipa_stmt_fixups (struct cgraph_node *node, gimple *stmts) | |
1983 | { | |
1984 | execute_ipa_stmt_fixups (all_regular_ipa_passes, node, stmts); | |
1985 | } | |
1986 | ||
1987 | ||
d7f09764 DN |
1988 | extern void debug_properties (unsigned int); |
1989 | extern void dump_properties (FILE *, unsigned int); | |
1990 | ||
24e47c76 | 1991 | DEBUG_FUNCTION void |
d7f09764 DN |
1992 | dump_properties (FILE *dump, unsigned int props) |
1993 | { | |
1994 | fprintf (dump, "Properties:\n"); | |
1995 | if (props & PROP_gimple_any) | |
1996 | fprintf (dump, "PROP_gimple_any\n"); | |
1997 | if (props & PROP_gimple_lcf) | |
1998 | fprintf (dump, "PROP_gimple_lcf\n"); | |
1999 | if (props & PROP_gimple_leh) | |
2000 | fprintf (dump, "PROP_gimple_leh\n"); | |
2001 | if (props & PROP_cfg) | |
2002 | fprintf (dump, "PROP_cfg\n"); | |
2003 | if (props & PROP_referenced_vars) | |
2004 | fprintf (dump, "PROP_referenced_vars\n"); | |
2005 | if (props & PROP_ssa) | |
2006 | fprintf (dump, "PROP_ssa\n"); | |
2007 | if (props & PROP_no_crit_edges) | |
2008 | fprintf (dump, "PROP_no_crit_edges\n"); | |
2009 | if (props & PROP_rtl) | |
2010 | fprintf (dump, "PROP_rtl\n"); | |
2011 | if (props & PROP_gimple_lomp) | |
2012 | fprintf (dump, "PROP_gimple_lomp\n"); | |
688a482d RG |
2013 | if (props & PROP_gimple_lcx) |
2014 | fprintf (dump, "PROP_gimple_lcx\n"); | |
24e47c76 JH |
2015 | if (props & PROP_cfglayout) |
2016 | fprintf (dump, "PROP_cfglayout\n"); | |
d7f09764 DN |
2017 | } |
2018 | ||
24e47c76 | 2019 | DEBUG_FUNCTION void |
d7f09764 DN |
2020 | debug_properties (unsigned int props) |
2021 | { | |
2022 | dump_properties (stderr, props); | |
2023 | } | |
2024 | ||
33977f81 JH |
2025 | /* Called by local passes to see if function is called by already processed nodes. |
2026 | Because we process nodes in topological order, this means that function is | |
2027 | in recursive cycle or we introduced new direct calls. */ | |
2028 | bool | |
2029 | function_called_by_processed_nodes_p (void) | |
2030 | { | |
2031 | struct cgraph_edge *e; | |
581985d7 MJ |
2032 | for (e = cgraph_get_node (current_function_decl)->callers; |
2033 | e; | |
2034 | e = e->next_caller) | |
33977f81 JH |
2035 | { |
2036 | if (e->caller->decl == current_function_decl) | |
2037 | continue; | |
c47d0034 | 2038 | if (!cgraph_function_with_gimple_body_p (e->caller)) |
33977f81 JH |
2039 | continue; |
2040 | if (TREE_ASM_WRITTEN (e->caller->decl)) | |
2041 | continue; | |
2042 | if (!e->caller->process && !e->caller->global.inlined_to) | |
2043 | break; | |
2044 | } | |
2045 | if (dump_file && e) | |
2046 | { | |
2047 | fprintf (dump_file, "Already processed call to:\n"); | |
2048 | dump_cgraph_node (dump_file, e->caller); | |
2049 | } | |
2050 | return e != NULL; | |
2051 | } | |
2052 | ||
873aa8f5 | 2053 | #include "gt-passes.h" |