]>
Commit | Line | Data |
---|---|---|
f6db1481 | 1 | /* Top level of GCC compilers (cc1, cc1plus, etc.) |
85ec4feb | 2 | Copyright (C) 1987-2018 Free Software Foundation, Inc. |
f6db1481 RH |
3 | |
4 | This file is part of GCC. | |
5 | ||
6 | GCC is free software; you can redistribute it and/or modify it under | |
7 | the terms of the GNU General Public License as published by the Free | |
9dcd6f09 | 8 | Software Foundation; either version 3, or (at your option) any later |
f6db1481 RH |
9 | version. |
10 | ||
11 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
12 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
13 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
14 | for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
9dcd6f09 NC |
17 | along with GCC; see the file COPYING3. If not see |
18 | <http://www.gnu.org/licenses/>. */ | |
f6db1481 RH |
19 | |
20 | /* This is the top level of cc1/c++. | |
21 | It parses command args, opens files, invokes the various passes | |
22 | in the proper order, and counts the time used by each. | |
23 | Error messages and low-level interface to malloc also handled here. */ | |
24 | ||
25 | #include "config.h" | |
f6db1481 RH |
26 | #include "system.h" |
27 | #include "coretypes.h" | |
c7131fb2 | 28 | #include "backend.h" |
957060b5 AM |
29 | #include "target.h" |
30 | #include "rtl.h" | |
f6db1481 | 31 | #include "tree.h" |
c7131fb2 | 32 | #include "gimple.h" |
957060b5 | 33 | #include "cfghooks.h" |
c7131fb2 | 34 | #include "df.h" |
4d0cdd0c | 35 | #include "memmodel.h" |
957060b5 | 36 | #include "tm_p.h" |
c7131fb2 | 37 | #include "ssa.h" |
957060b5 | 38 | #include "emit-rtl.h" |
957060b5 | 39 | #include "cgraph.h" |
957060b5 | 40 | #include "lto-streamer.h" |
40e23961 | 41 | #include "fold-const.h" |
d8a2d370 | 42 | #include "varasm.h" |
f6db1481 | 43 | #include "output.h" |
f6db1481 | 44 | #include "graph.h" |
f6db1481 | 45 | #include "debug.h" |
f6db1481 | 46 | #include "cfgloop.h" |
f6db1481 | 47 | #include "value-prof.h" |
442b4905 | 48 | #include "tree-cfg.h" |
e28030cf | 49 | #include "tree-ssa-loop-manip.h" |
442b4905 AM |
50 | #include "tree-into-ssa.h" |
51 | #include "tree-dfa.h" | |
7a300452 | 52 | #include "tree-ssa.h" |
2f8e398b | 53 | #include "tree-pass.h" |
090fa0ab | 54 | #include "plugin.h" |
af8bca3c | 55 | #include "ipa-utils.h" |
6f4185d7 | 56 | #include "tree-pretty-print.h" /* for dump_function_header */ |
315f8c0e DM |
57 | #include "context.h" |
58 | #include "pass_manager.h" | |
e677a9d4 | 59 | #include "cfgrtl.h" |
c1bf2a39 | 60 | #include "tree-ssa-live.h" /* For remove_unused_locals. */ |
4484a35a | 61 | #include "tree-cfgcleanup.h" |
c2e84327 | 62 | #include "insn-addr.h" /* for INSN_ADDRESSES_ALLOC. */ |
a02d1ad2 | 63 | #include "diagnostic-core.h" /* for fnotice */ |
314e6352 ML |
64 | #include "stringpool.h" |
65 | #include "attribs.h" | |
315f8c0e DM |
66 | |
67 | using namespace gcc; | |
f6db1481 | 68 | |
6fb5fa3c | 69 | /* This is used for debugging. It allows the current pass to printed |
090fa0ab GF |
70 | from anywhere in compilation. |
71 | The variable current_pass is also used for statistics and plugins. */ | |
6a5ac314 | 72 | opt_pass *current_pass; |
6fb5fa3c | 73 | |
f7695dbf DM |
74 | /* Most passes are single-instance (within their context) and thus don't |
75 | need to implement cloning, but passes that support multiple instances | |
76 | *must* provide their own implementation of the clone method. | |
77 | ||
78 | Handle this by providing a default implemenation, but make it a fatal | |
79 | error to call it. */ | |
80 | ||
81 | opt_pass * | |
82 | opt_pass::clone () | |
83 | { | |
84 | internal_error ("pass %s does not support cloning", name); | |
85 | } | |
86 | ||
b0c77505 TV |
87 | void |
88 | opt_pass::set_pass_param (unsigned int, bool) | |
89 | { | |
90 | internal_error ("pass %s needs a set_pass_param implementation to handle the" | |
91 | " extra argument in NEXT_PASS", name); | |
92 | } | |
93 | ||
f7695dbf | 94 | bool |
1a3d085c | 95 | opt_pass::gate (function *) |
f7695dbf DM |
96 | { |
97 | return true; | |
98 | } | |
99 | ||
100 | unsigned int | |
be55bfe6 | 101 | opt_pass::execute (function *) |
f7695dbf DM |
102 | { |
103 | return 0; | |
104 | } | |
105 | ||
c3284718 RS |
106 | opt_pass::opt_pass (const pass_data &data, context *ctxt) |
107 | : pass_data (data), | |
108 | sub (NULL), | |
109 | next (NULL), | |
110 | static_pass_number (0), | |
65d3284b | 111 | m_ctxt (ctxt) |
f7695dbf DM |
112 | { |
113 | } | |
114 | ||
115 | ||
116 | void | |
117 | pass_manager::execute_early_local_passes () | |
118 | { | |
d5e254e1 | 119 | execute_pass_list (cfun, pass_build_ssa_passes_1->sub); |
2bb9e67f RB |
120 | if (flag_check_pointer_bounds) |
121 | execute_pass_list (cfun, pass_chkp_instrumentation_passes_1->sub); | |
d5e254e1 | 122 | execute_pass_list (cfun, pass_local_optimization_passes_1->sub); |
f7695dbf DM |
123 | } |
124 | ||
125 | unsigned int | |
126 | pass_manager::execute_pass_mode_switching () | |
127 | { | |
be55bfe6 | 128 | return pass_mode_switching_1->execute (cfun); |
f7695dbf DM |
129 | } |
130 | ||
131 | ||
6fb5fa3c DB |
132 | /* Call from anywhere to find out what pass this is. Useful for |
133 | printing out debugging information deep inside an service | |
134 | routine. */ | |
135 | void | |
136 | print_current_pass (FILE *file) | |
137 | { | |
138 | if (current_pass) | |
b8698a0f | 139 | fprintf (file, "current pass = %s (%d)\n", |
6fb5fa3c DB |
140 | current_pass->name, current_pass->static_pass_number); |
141 | else | |
142 | fprintf (file, "no current pass.\n"); | |
143 | } | |
144 | ||
145 | ||
146 | /* Call from the debugger to get the current pass name. */ | |
24e47c76 | 147 | DEBUG_FUNCTION void |
6fb5fa3c DB |
148 | debug_pass (void) |
149 | { | |
150 | print_current_pass (stderr); | |
b8698a0f | 151 | } |
6fb5fa3c DB |
152 | |
153 | ||
154 | ||
ef330312 | 155 | /* Global variables used to communicate with passes. */ |
ef330312 | 156 | bool in_gimple_form; |
f6db1481 | 157 | |
f6db1481 RH |
158 | |
159 | /* This is called from various places for FUNCTION_DECL, VAR_DECL, | |
160 | and TYPE_DECL nodes. | |
161 | ||
162 | This does nothing for local (non-static) variables, unless the | |
0e6df31e GK |
163 | variable is a register variable with DECL_ASSEMBLER_NAME set. In |
164 | that case, or if the variable is not an automatic, it sets up the | |
165 | RTL and outputs any assembler code (label definition, storage | |
166 | allocation and initialization). | |
f6db1481 | 167 | |
0e6df31e | 168 | DECL is the declaration. TOP_LEVEL is nonzero |
f6db1481 RH |
169 | if this declaration is not within a function. */ |
170 | ||
171 | void | |
172 | rest_of_decl_compilation (tree decl, | |
f6db1481 RH |
173 | int top_level, |
174 | int at_end) | |
175 | { | |
24fcf4bc JJ |
176 | bool finalize = true; |
177 | ||
f6db1481 RH |
178 | /* We deferred calling assemble_alias so that we could collect |
179 | other attributes such as visibility. Emit the alias now. */ | |
6e701822 | 180 | if (!in_lto_p) |
f6db1481 RH |
181 | { |
182 | tree alias; | |
183 | alias = lookup_attribute ("alias", DECL_ATTRIBUTES (decl)); | |
184 | if (alias) | |
185 | { | |
186 | alias = TREE_VALUE (TREE_VALUE (alias)); | |
187 | alias = get_identifier (TREE_STRING_POINTER (alias)); | |
f7fb2880 RG |
188 | /* A quirk of the initial implementation of aliases required that the |
189 | user add "extern" to all of them. Which is silly, but now | |
190 | historical. Do note that the symbol is in fact locally defined. */ | |
08346abd JH |
191 | DECL_EXTERNAL (decl) = 0; |
192 | TREE_STATIC (decl) = 1; | |
f6db1481 | 193 | assemble_alias (decl, alias); |
24fcf4bc | 194 | finalize = false; |
f6db1481 RH |
195 | } |
196 | } | |
197 | ||
0e6df31e GK |
198 | /* Can't defer this, because it needs to happen before any |
199 | later function definitions are processed. */ | |
a92f6726 NS |
200 | if (HAS_DECL_ASSEMBLER_NAME_P (decl) |
201 | && DECL_ASSEMBLER_NAME_SET_P (decl) | |
202 | && DECL_REGISTER (decl)) | |
0e6df31e GK |
203 | make_decl_rtl (decl); |
204 | ||
f6db1481 RH |
205 | /* Forward declarations for nested functions are not "external", |
206 | but we need to treat them as if they were. */ | |
207 | if (TREE_STATIC (decl) || DECL_EXTERNAL (decl) | |
208 | || TREE_CODE (decl) == FUNCTION_DECL) | |
209 | { | |
210 | timevar_push (TV_VARCONST); | |
211 | ||
f6db1481 RH |
212 | /* Don't output anything when a tentative file-scope definition |
213 | is seen. But at end of compilation, do output code for them. | |
214 | ||
7e8b322a | 215 | We do output all variables and rely on |
f6db1481 RH |
216 | callgraph code to defer them except for forward declarations |
217 | (see gcc.c-torture/compile/920624-1.c) */ | |
218 | if ((at_end | |
219 | || !DECL_DEFER_OUTPUT (decl) | |
cd9c7bd2 | 220 | || DECL_INITIAL (decl)) |
8813a647 | 221 | && (!VAR_P (decl) || !DECL_HAS_VALUE_EXPR_P (decl)) |
f6db1481 RH |
222 | && !DECL_EXTERNAL (decl)) |
223 | { | |
2942c502 JH |
224 | /* When reading LTO unit, we also read varpool, so do not |
225 | rebuild it. */ | |
226 | if (in_lto_p && !at_end) | |
227 | ; | |
24fcf4bc | 228 | else if (finalize && TREE_CODE (decl) != FUNCTION_DECL) |
9041d2e6 | 229 | varpool_node::finalize_decl (decl); |
f6db1481 RH |
230 | } |
231 | ||
232 | #ifdef ASM_FINISH_DECLARE_OBJECT | |
233 | if (decl == last_assemble_variable_decl) | |
234 | { | |
235 | ASM_FINISH_DECLARE_OBJECT (asm_out_file, decl, | |
236 | top_level, at_end); | |
237 | } | |
238 | #endif | |
239 | ||
63b0cb04 CB |
240 | /* Now that we have activated any function-specific attributes |
241 | that might affect function decl, particularly align, relayout it. */ | |
242 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
243 | targetm.target_option.relayout_function (decl); | |
244 | ||
f6db1481 RH |
245 | timevar_pop (TV_VARCONST); |
246 | } | |
ef11c839 SB |
247 | else if (TREE_CODE (decl) == TYPE_DECL |
248 | /* Like in rest_of_type_compilation, avoid confusing the debug | |
249 | information machinery when there are errors. */ | |
1da2ed5f | 250 | && !seen_error ()) |
f6db1481 RH |
251 | { |
252 | timevar_push (TV_SYMOUT); | |
253 | debug_hooks->type_decl (decl, !top_level); | |
254 | timevar_pop (TV_SYMOUT); | |
255 | } | |
e4d5432a | 256 | |
aabcd309 | 257 | /* Let cgraph know about the existence of variables. */ |
2942c502 JH |
258 | if (in_lto_p && !at_end) |
259 | ; | |
8813a647 | 260 | else if (VAR_P (decl) && !DECL_EXTERNAL (decl) |
a482b1f5 | 261 | && TREE_STATIC (decl)) |
9041d2e6 | 262 | varpool_node::get_create (decl); |
d7438551 AH |
263 | |
264 | /* Generate early debug for global variables. Any local variables will | |
265 | be handled by either handling reachable functions from | |
266 | finalize_compilation_unit (and by consequence, locally scoped | |
267 | symbols), or by rest_of_type_compilation below. | |
268 | ||
ff9baa5f PMR |
269 | For Go's hijack of the debug_hooks to implement -fdump-go-spec, pick up |
270 | function prototypes. Go's debug_hooks will not forward them to the | |
271 | wrapped hooks. */ | |
d7438551 AH |
272 | if (!in_lto_p |
273 | && (TREE_CODE (decl) != FUNCTION_DECL | |
274 | /* This will pick up function prototypes with no bodies, | |
275 | which are not visible in finalize_compilation_unit() | |
276 | while iterating with FOR_EACH_*_FUNCTION through the | |
277 | symbol table. */ | |
ff9baa5f PMR |
278 | || (flag_dump_go_spec != NULL |
279 | && !DECL_SAVED_TREE (decl) | |
280 | && DECL_STRUCT_FUNCTION (decl) == NULL)) | |
d7438551 AH |
281 | |
282 | /* We need to check both decl_function_context and | |
283 | current_function_decl here to make sure local extern | |
284 | declarations end up with the correct context. | |
285 | ||
286 | For local extern declarations, decl_function_context is | |
287 | empty, but current_function_decl is set to the function where | |
288 | the extern was declared . Without the check for | |
289 | !current_function_decl below, the local extern ends up | |
290 | incorrectly with a top-level context. | |
291 | ||
292 | For example: | |
293 | ||
294 | namespace S | |
295 | { | |
296 | int | |
297 | f() | |
298 | { | |
299 | { | |
300 | int i = 42; | |
301 | { | |
302 | extern int i; // Local extern declaration. | |
303 | return i; | |
304 | } | |
305 | } | |
306 | } | |
307 | } | |
308 | */ | |
309 | && !decl_function_context (decl) | |
310 | && !current_function_decl | |
522b7b88 | 311 | && DECL_SOURCE_LOCATION (decl) != BUILTINS_LOCATION |
bf2dbec4 RB |
312 | && (!decl_type_context (decl) |
313 | /* If we created a varpool node for the decl make sure to | |
314 | call early_global_decl. Otherwise we miss changes | |
315 | introduced by member definitions like | |
316 | struct A { static int staticdatamember; }; | |
317 | int A::staticdatamember; | |
318 | and thus have incomplete early debug and late debug | |
319 | called from varpool node removal fails to handle it | |
320 | properly. */ | |
b1e251ec | 321 | || (finalize |
8813a647 | 322 | && VAR_P (decl) |
bf2dbec4 | 323 | && TREE_STATIC (decl) && !DECL_EXTERNAL (decl))) |
f11cd829 RB |
324 | /* Avoid confusing the debug information machinery when there are |
325 | errors. */ | |
326 | && !seen_error ()) | |
d7438551 | 327 | (*debug_hooks->early_global_decl) (decl); |
f6db1481 RH |
328 | } |
329 | ||
330 | /* Called after finishing a record, union or enumeral type. */ | |
331 | ||
332 | void | |
333 | rest_of_type_compilation (tree type, int toplev) | |
334 | { | |
335 | /* Avoid confusing the debug information machinery when there are | |
336 | errors. */ | |
1da2ed5f | 337 | if (seen_error ()) |
f6db1481 RH |
338 | return; |
339 | ||
340 | timevar_push (TV_SYMOUT); | |
341 | debug_hooks->type_decl (TYPE_STUB_DECL (type), !toplev); | |
342 | timevar_pop (TV_SYMOUT); | |
343 | } | |
344 | ||
ef330312 | 345 | \f |
f6db1481 | 346 | |
ef330312 | 347 | void |
f7695dbf | 348 | pass_manager:: |
ef330312 | 349 | finish_optimization_passes (void) |
f6db1481 | 350 | { |
68fbd81b SB |
351 | int i; |
352 | struct dump_file_info *dfi; | |
353 | char *name; | |
47e0da37 | 354 | gcc::dump_manager *dumps = m_ctxt->get_dumps (); |
68fbd81b | 355 | |
ef330312 PB |
356 | timevar_push (TV_DUMP); |
357 | if (profile_arc_flag || flag_test_coverage || flag_branch_probabilities) | |
f6db1481 | 358 | { |
47e0da37 | 359 | dumps->dump_start (pass_profile_1->static_pass_number, NULL); |
ef330312 | 360 | end_branch_prob (); |
47e0da37 | 361 | dumps->dump_finish (pass_profile_1->static_pass_number); |
f6db1481 | 362 | } |
68fbd81b | 363 | |
ef330312 | 364 | if (optimize > 0) |
f6db1481 | 365 | { |
47e0da37 | 366 | dumps->dump_start (pass_profile_1->static_pass_number, NULL); |
78c60e3d | 367 | print_combine_total_stats (); |
47e0da37 | 368 | dumps->dump_finish (pass_profile_1->static_pass_number); |
f6db1481 | 369 | } |
68fbd81b SB |
370 | |
371 | /* Do whatever is necessary to finish printing the graphs. */ | |
47e0da37 | 372 | for (i = TDI_end; (dfi = dumps->get_dump_file_info (i)) != NULL; ++i) |
182c7868 | 373 | if (dfi->graph_dump_initialized) |
68fbd81b | 374 | { |
182c7868 | 375 | name = dumps->get_dump_file_name (dfi); |
68fbd81b SB |
376 | finish_graph_dump_file (name); |
377 | free (name); | |
378 | } | |
379 | ||
ef330312 | 380 | timevar_pop (TV_DUMP); |
f6db1481 | 381 | } |
f6db1481 | 382 | |
452aa9c5 | 383 | static unsigned int |
d5e254e1 | 384 | execute_build_ssa_passes (void) |
452aa9c5 RG |
385 | { |
386 | /* Once this pass (and its sub-passes) are complete, all functions | |
387 | will be in SSA form. Technically this state change is happening | |
388 | a tad early, since the sub-passes have not yet run, but since | |
389 | none of the sub-passes are IPA passes and do not create new | |
390 | functions, this is ok. We're setting this value for the benefit | |
391 | of IPA passes that follow. */ | |
3dafb85c ML |
392 | if (symtab->state < IPA_SSA) |
393 | symtab->state = IPA_SSA; | |
452aa9c5 RG |
394 | return 0; |
395 | } | |
396 | ||
27a4cd48 DM |
397 | namespace { |
398 | ||
d5e254e1 | 399 | const pass_data pass_data_build_ssa_passes = |
27a4cd48 DM |
400 | { |
401 | SIMPLE_IPA_PASS, /* type */ | |
d5e254e1 | 402 | "build_ssa_passes", /* name */ |
27a4cd48 | 403 | OPTGROUP_NONE, /* optinfo_flags */ |
27a4cd48 DM |
404 | TV_EARLY_LOCAL, /* tv_id */ |
405 | 0, /* properties_required */ | |
406 | 0, /* properties_provided */ | |
407 | 0, /* properties_destroyed */ | |
408 | 0, /* todo_flags_start */ | |
8605403e JH |
409 | /* todo_flags_finish is executed before subpases. For this reason |
410 | it makes no sense to remove unreachable functions here. */ | |
411 | 0, /* todo_flags_finish */ | |
452aa9c5 RG |
412 | }; |
413 | ||
d5e254e1 | 414 | class pass_build_ssa_passes : public simple_ipa_opt_pass |
27a4cd48 DM |
415 | { |
416 | public: | |
d5e254e1 IE |
417 | pass_build_ssa_passes (gcc::context *ctxt) |
418 | : simple_ipa_opt_pass (pass_data_build_ssa_passes, ctxt) | |
27a4cd48 DM |
419 | {} |
420 | ||
421 | /* opt_pass methods: */ | |
1a3d085c TS |
422 | virtual bool gate (function *) |
423 | { | |
424 | /* Don't bother doing anything if the program has errors. */ | |
425 | return (!seen_error () && !in_lto_p); | |
426 | } | |
427 | ||
be55bfe6 TS |
428 | virtual unsigned int execute (function *) |
429 | { | |
d5e254e1 | 430 | return execute_build_ssa_passes (); |
be55bfe6 | 431 | } |
27a4cd48 | 432 | |
d5e254e1 IE |
433 | }; // class pass_build_ssa_passes |
434 | ||
435 | const pass_data pass_data_chkp_instrumentation_passes = | |
436 | { | |
437 | SIMPLE_IPA_PASS, /* type */ | |
438 | "chkp_passes", /* name */ | |
439 | OPTGROUP_NONE, /* optinfo_flags */ | |
440 | TV_NONE, /* tv_id */ | |
441 | 0, /* properties_required */ | |
442 | 0, /* properties_provided */ | |
443 | 0, /* properties_destroyed */ | |
444 | 0, /* todo_flags_start */ | |
445 | 0, /* todo_flags_finish */ | |
446 | }; | |
447 | ||
448 | class pass_chkp_instrumentation_passes : public simple_ipa_opt_pass | |
449 | { | |
450 | public: | |
451 | pass_chkp_instrumentation_passes (gcc::context *ctxt) | |
452 | : simple_ipa_opt_pass (pass_data_chkp_instrumentation_passes, ctxt) | |
453 | {} | |
454 | ||
455 | /* opt_pass methods: */ | |
456 | virtual bool gate (function *) | |
457 | { | |
458 | /* Don't bother doing anything if the program has errors. */ | |
2bb9e67f RB |
459 | return (flag_check_pointer_bounds |
460 | && !seen_error () && !in_lto_p); | |
d5e254e1 IE |
461 | } |
462 | ||
463 | }; // class pass_chkp_instrumentation_passes | |
464 | ||
465 | const pass_data pass_data_local_optimization_passes = | |
466 | { | |
467 | SIMPLE_IPA_PASS, /* type */ | |
468 | "opt_local_passes", /* name */ | |
469 | OPTGROUP_NONE, /* optinfo_flags */ | |
470 | TV_NONE, /* tv_id */ | |
471 | 0, /* properties_required */ | |
472 | 0, /* properties_provided */ | |
473 | 0, /* properties_destroyed */ | |
474 | 0, /* todo_flags_start */ | |
475 | 0, /* todo_flags_finish */ | |
476 | }; | |
477 | ||
478 | class pass_local_optimization_passes : public simple_ipa_opt_pass | |
479 | { | |
480 | public: | |
481 | pass_local_optimization_passes (gcc::context *ctxt) | |
482 | : simple_ipa_opt_pass (pass_data_local_optimization_passes, ctxt) | |
483 | {} | |
484 | ||
485 | /* opt_pass methods: */ | |
486 | virtual bool gate (function *) | |
487 | { | |
488 | /* Don't bother doing anything if the program has errors. */ | |
489 | return (!seen_error () && !in_lto_p); | |
490 | } | |
491 | ||
492 | }; // class pass_local_optimization_passes | |
27a4cd48 DM |
493 | |
494 | } // anon namespace | |
495 | ||
496 | simple_ipa_opt_pass * | |
d5e254e1 IE |
497 | make_pass_build_ssa_passes (gcc::context *ctxt) |
498 | { | |
499 | return new pass_build_ssa_passes (ctxt); | |
500 | } | |
501 | ||
502 | simple_ipa_opt_pass * | |
503 | make_pass_chkp_instrumentation_passes (gcc::context *ctxt) | |
504 | { | |
505 | return new pass_chkp_instrumentation_passes (ctxt); | |
506 | } | |
507 | ||
508 | simple_ipa_opt_pass * | |
509 | make_pass_local_optimization_passes (gcc::context *ctxt) | |
27a4cd48 | 510 | { |
d5e254e1 | 511 | return new pass_local_optimization_passes (ctxt); |
27a4cd48 DM |
512 | } |
513 | ||
27a4cd48 DM |
514 | namespace { |
515 | ||
516 | const pass_data pass_data_all_early_optimizations = | |
517 | { | |
518 | GIMPLE_PASS, /* type */ | |
519 | "early_optimizations", /* name */ | |
520 | OPTGROUP_NONE, /* optinfo_flags */ | |
27a4cd48 DM |
521 | TV_NONE, /* tv_id */ |
522 | 0, /* properties_required */ | |
523 | 0, /* properties_provided */ | |
524 | 0, /* properties_destroyed */ | |
525 | 0, /* todo_flags_start */ | |
526 | 0, /* todo_flags_finish */ | |
452aa9c5 RG |
527 | }; |
528 | ||
27a4cd48 DM |
529 | class pass_all_early_optimizations : public gimple_opt_pass |
530 | { | |
531 | public: | |
c3284718 RS |
532 | pass_all_early_optimizations (gcc::context *ctxt) |
533 | : gimple_opt_pass (pass_data_all_early_optimizations, ctxt) | |
27a4cd48 DM |
534 | {} |
535 | ||
536 | /* opt_pass methods: */ | |
1a3d085c TS |
537 | virtual bool gate (function *) |
538 | { | |
539 | return (optimize >= 1 | |
540 | /* Don't bother doing anything if the program has errors. */ | |
541 | && !seen_error ()); | |
542 | } | |
27a4cd48 DM |
543 | |
544 | }; // class pass_all_early_optimizations | |
545 | ||
546 | } // anon namespace | |
547 | ||
548 | static gimple_opt_pass * | |
549 | make_pass_all_early_optimizations (gcc::context *ctxt) | |
550 | { | |
551 | return new pass_all_early_optimizations (ctxt); | |
552 | } | |
553 | ||
27a4cd48 DM |
554 | namespace { |
555 | ||
556 | const pass_data pass_data_all_optimizations = | |
557 | { | |
558 | GIMPLE_PASS, /* type */ | |
559 | "*all_optimizations", /* name */ | |
560 | OPTGROUP_NONE, /* optinfo_flags */ | |
27a4cd48 DM |
561 | TV_OPTIMIZE, /* tv_id */ |
562 | 0, /* properties_required */ | |
563 | 0, /* properties_provided */ | |
564 | 0, /* properties_destroyed */ | |
565 | 0, /* todo_flags_start */ | |
566 | 0, /* todo_flags_finish */ | |
452aa9c5 RG |
567 | }; |
568 | ||
27a4cd48 DM |
569 | class pass_all_optimizations : public gimple_opt_pass |
570 | { | |
571 | public: | |
c3284718 RS |
572 | pass_all_optimizations (gcc::context *ctxt) |
573 | : gimple_opt_pass (pass_data_all_optimizations, ctxt) | |
27a4cd48 DM |
574 | {} |
575 | ||
576 | /* opt_pass methods: */ | |
1a3d085c | 577 | virtual bool gate (function *) { return optimize >= 1 && !optimize_debug; } |
27a4cd48 DM |
578 | |
579 | }; // class pass_all_optimizations | |
580 | ||
581 | } // anon namespace | |
582 | ||
583 | static gimple_opt_pass * | |
584 | make_pass_all_optimizations (gcc::context *ctxt) | |
585 | { | |
586 | return new pass_all_optimizations (ctxt); | |
587 | } | |
588 | ||
27a4cd48 DM |
589 | namespace { |
590 | ||
591 | const pass_data pass_data_all_optimizations_g = | |
592 | { | |
593 | GIMPLE_PASS, /* type */ | |
594 | "*all_optimizations_g", /* name */ | |
595 | OPTGROUP_NONE, /* optinfo_flags */ | |
27a4cd48 DM |
596 | TV_OPTIMIZE, /* tv_id */ |
597 | 0, /* properties_required */ | |
598 | 0, /* properties_provided */ | |
599 | 0, /* properties_destroyed */ | |
600 | 0, /* todo_flags_start */ | |
601 | 0, /* todo_flags_finish */ | |
bf7a7185 RG |
602 | }; |
603 | ||
27a4cd48 DM |
604 | class pass_all_optimizations_g : public gimple_opt_pass |
605 | { | |
606 | public: | |
c3284718 RS |
607 | pass_all_optimizations_g (gcc::context *ctxt) |
608 | : gimple_opt_pass (pass_data_all_optimizations_g, ctxt) | |
27a4cd48 DM |
609 | {} |
610 | ||
611 | /* opt_pass methods: */ | |
1a3d085c | 612 | virtual bool gate (function *) { return optimize >= 1 && optimize_debug; } |
27a4cd48 DM |
613 | |
614 | }; // class pass_all_optimizations_g | |
615 | ||
616 | } // anon namespace | |
617 | ||
618 | static gimple_opt_pass * | |
619 | make_pass_all_optimizations_g (gcc::context *ctxt) | |
620 | { | |
621 | return new pass_all_optimizations_g (ctxt); | |
622 | } | |
623 | ||
27a4cd48 DM |
624 | namespace { |
625 | ||
626 | const pass_data pass_data_rest_of_compilation = | |
627 | { | |
628 | RTL_PASS, /* type */ | |
629 | "*rest_of_compilation", /* name */ | |
630 | OPTGROUP_NONE, /* optinfo_flags */ | |
27a4cd48 DM |
631 | TV_REST_OF_COMPILATION, /* tv_id */ |
632 | PROP_rtl, /* properties_required */ | |
633 | 0, /* properties_provided */ | |
634 | 0, /* properties_destroyed */ | |
635 | 0, /* todo_flags_start */ | |
636 | 0, /* todo_flags_finish */ | |
ef330312 | 637 | }; |
f6db1481 | 638 | |
27a4cd48 DM |
639 | class pass_rest_of_compilation : public rtl_opt_pass |
640 | { | |
641 | public: | |
c3284718 RS |
642 | pass_rest_of_compilation (gcc::context *ctxt) |
643 | : rtl_opt_pass (pass_data_rest_of_compilation, ctxt) | |
27a4cd48 DM |
644 | {} |
645 | ||
646 | /* opt_pass methods: */ | |
1a3d085c TS |
647 | virtual bool gate (function *) |
648 | { | |
649 | /* Early return if there were errors. We can run afoul of our | |
650 | consistency checks, and there's not really much point in fixing them. */ | |
651 | return !(rtl_dump_and_exit || flag_syntax_only || seen_error ()); | |
652 | } | |
27a4cd48 DM |
653 | |
654 | }; // class pass_rest_of_compilation | |
655 | ||
656 | } // anon namespace | |
657 | ||
658 | static rtl_opt_pass * | |
659 | make_pass_rest_of_compilation (gcc::context *ctxt) | |
660 | { | |
661 | return new pass_rest_of_compilation (ctxt); | |
662 | } | |
663 | ||
27a4cd48 DM |
664 | namespace { |
665 | ||
666 | const pass_data pass_data_postreload = | |
667 | { | |
668 | RTL_PASS, /* type */ | |
669 | "*all-postreload", /* name */ | |
670 | OPTGROUP_NONE, /* optinfo_flags */ | |
27a4cd48 DM |
671 | TV_POSTRELOAD, /* tv_id */ |
672 | PROP_rtl, /* properties_required */ | |
673 | 0, /* properties_provided */ | |
674 | 0, /* properties_destroyed */ | |
675 | 0, /* todo_flags_start */ | |
3bea341f | 676 | 0, /* todo_flags_finish */ |
ef330312 | 677 | }; |
f6db1481 | 678 | |
27a4cd48 DM |
679 | class pass_postreload : public rtl_opt_pass |
680 | { | |
681 | public: | |
c3284718 RS |
682 | pass_postreload (gcc::context *ctxt) |
683 | : rtl_opt_pass (pass_data_postreload, ctxt) | |
27a4cd48 DM |
684 | {} |
685 | ||
686 | /* opt_pass methods: */ | |
1a3d085c | 687 | virtual bool gate (function *) { return reload_completed; } |
27a4cd48 DM |
688 | |
689 | }; // class pass_postreload | |
690 | ||
691 | } // anon namespace | |
692 | ||
693 | static rtl_opt_pass * | |
694 | make_pass_postreload (gcc::context *ctxt) | |
695 | { | |
696 | return new pass_postreload (ctxt); | |
697 | } | |
698 | ||
433e4164 BS |
699 | namespace { |
700 | ||
701 | const pass_data pass_data_late_compilation = | |
702 | { | |
703 | RTL_PASS, /* type */ | |
704 | "*all-late_compilation", /* name */ | |
705 | OPTGROUP_NONE, /* optinfo_flags */ | |
706 | TV_LATE_COMPILATION, /* tv_id */ | |
707 | PROP_rtl, /* properties_required */ | |
708 | 0, /* properties_provided */ | |
709 | 0, /* properties_destroyed */ | |
710 | 0, /* todo_flags_start */ | |
711 | 0, /* todo_flags_finish */ | |
712 | }; | |
713 | ||
714 | class pass_late_compilation : public rtl_opt_pass | |
715 | { | |
716 | public: | |
717 | pass_late_compilation (gcc::context *ctxt) | |
718 | : rtl_opt_pass (pass_data_late_compilation, ctxt) | |
719 | {} | |
720 | ||
721 | /* opt_pass methods: */ | |
722 | virtual bool gate (function *) | |
723 | { | |
724 | return reload_completed || targetm.no_register_allocation; | |
725 | } | |
726 | ||
727 | }; // class pass_late_compilation | |
728 | ||
729 | } // anon namespace | |
730 | ||
731 | static rtl_opt_pass * | |
732 | make_pass_late_compilation (gcc::context *ctxt) | |
733 | { | |
734 | return new pass_late_compilation (ctxt); | |
735 | } | |
736 | ||
97b0ade3 | 737 | |
f6db1481 | 738 | |
9fe0cb7d RG |
739 | /* Set the static pass number of pass PASS to ID and record that |
740 | in the mapping from static pass number to pass. */ | |
741 | ||
315f8c0e DM |
742 | void |
743 | pass_manager:: | |
6a5ac314 | 744 | set_pass_for_id (int id, opt_pass *pass) |
9fe0cb7d RG |
745 | { |
746 | pass->static_pass_number = id; | |
747 | if (passes_by_id_size <= id) | |
748 | { | |
6a5ac314 | 749 | passes_by_id = XRESIZEVEC (opt_pass *, passes_by_id, id + 1); |
9fe0cb7d RG |
750 | memset (passes_by_id + passes_by_id_size, 0, |
751 | (id + 1 - passes_by_id_size) * sizeof (void *)); | |
752 | passes_by_id_size = id + 1; | |
753 | } | |
754 | passes_by_id[id] = pass; | |
755 | } | |
756 | ||
757 | /* Return the pass with the static pass number ID. */ | |
758 | ||
6a5ac314 | 759 | opt_pass * |
315f8c0e | 760 | pass_manager::get_pass_for_id (int id) const |
9fe0cb7d RG |
761 | { |
762 | if (id >= passes_by_id_size) | |
763 | return NULL; | |
764 | return passes_by_id[id]; | |
765 | } | |
766 | ||
ef330312 PB |
767 | /* Iterate over the pass tree allocating dump file numbers. We want |
768 | to do this depth first, and independent of whether the pass is | |
769 | enabled or not. */ | |
f6db1481 | 770 | |
68a607d8 | 771 | void |
6a5ac314 | 772 | register_one_dump_file (opt_pass *pass) |
315f8c0e DM |
773 | { |
774 | g->get_passes ()->register_one_dump_file (pass); | |
775 | } | |
776 | ||
777 | void | |
6a5ac314 | 778 | pass_manager::register_one_dump_file (opt_pass *pass) |
ef330312 PB |
779 | { |
780 | char *dot_name, *flag_name, *glob_name; | |
226c52aa | 781 | const char *name, *full_name, *prefix; |
3d7b83b6 MS |
782 | |
783 | /* Buffer big enough to format a 32-bit UINT_MAX into. */ | |
784 | char num[11]; | |
8264c84d | 785 | dump_kind dkind; |
1a817418 | 786 | int id; |
2b4e6bf1 | 787 | int optgroup_flags = OPTGROUP_NONE; |
47e0da37 | 788 | gcc::dump_manager *dumps = m_ctxt->get_dumps (); |
f6db1481 | 789 | |
ef330312 PB |
790 | /* See below in next_pass_1. */ |
791 | num[0] = '\0'; | |
792 | if (pass->static_pass_number != -1) | |
3d7b83b6 | 793 | sprintf (num, "%u", ((int) pass->static_pass_number < 0 |
ef330312 | 794 | ? 1 : pass->static_pass_number)); |
f6db1481 | 795 | |
e0a42b0f ZC |
796 | /* The name is both used to identify the pass for the purposes of plugins, |
797 | and to specify dump file name and option. | |
798 | The latter two might want something short which is not quite unique; for | |
799 | that reason, we may have a disambiguating prefix, followed by a space | |
800 | to mark the start of the following dump file name / option string. */ | |
801 | name = strchr (pass->name, ' '); | |
802 | name = name ? name + 1 : pass->name; | |
803 | dot_name = concat (".", name, num, NULL); | |
17653c00 | 804 | if (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS) |
2b4e6bf1 SS |
805 | { |
806 | prefix = "ipa-"; | |
8264c84d | 807 | dkind = DK_ipa; |
2b4e6bf1 SS |
808 | optgroup_flags |= OPTGROUP_IPA; |
809 | } | |
9e016eba | 810 | else if (pass->type == GIMPLE_PASS) |
2b4e6bf1 SS |
811 | { |
812 | prefix = "tree-"; | |
8264c84d | 813 | dkind = DK_tree; |
2b4e6bf1 | 814 | } |
f6db1481 | 815 | else |
2b4e6bf1 SS |
816 | { |
817 | prefix = "rtl-"; | |
8264c84d | 818 | dkind = DK_rtl; |
2b4e6bf1 | 819 | } |
bbbe4e7b | 820 | |
e0a42b0f ZC |
821 | flag_name = concat (prefix, name, num, NULL); |
822 | glob_name = concat (prefix, name, NULL); | |
2b4e6bf1 | 823 | optgroup_flags |= pass->optinfo_flags; |
103ff0d6 TJ |
824 | /* For any passes that do not have an optgroup set, and which are not |
825 | IPA passes setup above, set the optgroup to OPTGROUP_OTHER so that | |
826 | any dump messages are emitted properly under -fopt-info(-optall). */ | |
827 | if (optgroup_flags == OPTGROUP_NONE) | |
828 | optgroup_flags = OPTGROUP_OTHER; | |
8264c84d | 829 | id = dumps->dump_register (dot_name, flag_name, glob_name, dkind, |
10fdd6e9 DM |
830 | optgroup_flags, |
831 | true); | |
9fe0cb7d | 832 | set_pass_for_id (id, pass); |
226c52aa XDL |
833 | full_name = concat (prefix, pass->name, num, NULL); |
834 | register_pass_name (pass, full_name); | |
9f929ce6 | 835 | free (CONST_CAST (char *, full_name)); |
97b0ade3 PB |
836 | } |
837 | ||
a23c217d | 838 | /* Register the dump files for the pass_manager starting at PASS. */ |
bbbe4e7b | 839 | |
0cd11b40 | 840 | void |
a23c217d | 841 | pass_manager::register_dump_files (opt_pass *pass) |
97b0ade3 | 842 | { |
ef330312 PB |
843 | do |
844 | { | |
8e352cd3 | 845 | if (pass->name && pass->name[0] != '*') |
9e016eba | 846 | register_one_dump_file (pass); |
f6db1481 | 847 | |
ef330312 | 848 | if (pass->sub) |
a23c217d | 849 | register_dump_files (pass->sub); |
f6db1481 | 850 | |
ef330312 | 851 | pass = pass->next; |
f6db1481 | 852 | } |
ef330312 | 853 | while (pass); |
f6db1481 | 854 | } |
f9957958 | 855 | |
226c52aa XDL |
856 | /* Register PASS with NAME. */ |
857 | ||
58d4c836 DM |
858 | void |
859 | pass_manager::register_pass_name (opt_pass *pass, const char *name) | |
226c52aa | 860 | { |
58d4c836 DM |
861 | if (!m_name_to_pass_map) |
862 | m_name_to_pass_map = new hash_map<nofree_string_hash, opt_pass *> (256); | |
226c52aa | 863 | |
58d4c836 | 864 | if (m_name_to_pass_map->get (name)) |
226c52aa | 865 | return; /* Ignore plugin passes. */ |
f98df77c | 866 | |
58d4c836 DM |
867 | const char *unique_name = xstrdup (name); |
868 | m_name_to_pass_map->put (unique_name, pass); | |
226c52aa XDL |
869 | } |
870 | ||
deced1e2 XDL |
871 | /* Map from pass id to canonicalized pass name. */ |
872 | ||
873 | typedef const char *char_ptr; | |
7de76362 | 874 | static vec<char_ptr> pass_tab; |
deced1e2 XDL |
875 | |
876 | /* Callback function for traversing NAME_TO_PASS_MAP. */ | |
877 | ||
f98df77c TS |
878 | bool |
879 | passes_pass_traverse (const char *const &name, opt_pass *const &pass, void *) | |
deced1e2 | 880 | { |
deced1e2 | 881 | gcc_assert (pass->static_pass_number > 0); |
9771b263 | 882 | gcc_assert (pass_tab.exists ()); |
deced1e2 | 883 | |
f98df77c | 884 | pass_tab[pass->static_pass_number] = name; |
deced1e2 XDL |
885 | |
886 | return 1; | |
887 | } | |
888 | ||
889 | /* The function traverses NAME_TO_PASS_MAP and creates a pass info | |
890 | table for dumping purpose. */ | |
891 | ||
58d4c836 DM |
892 | void |
893 | pass_manager::create_pass_tab (void) const | |
deced1e2 XDL |
894 | { |
895 | if (!flag_dump_passes) | |
896 | return; | |
897 | ||
58d4c836 DM |
898 | pass_tab.safe_grow_cleared (passes_by_id_size + 1); |
899 | m_name_to_pass_map->traverse <void *, passes_pass_traverse> (NULL); | |
deced1e2 XDL |
900 | } |
901 | ||
6a5ac314 | 902 | static bool override_gate_status (opt_pass *, tree, bool); |
deced1e2 XDL |
903 | |
904 | /* Dump the instantiated name for PASS. IS_ON indicates if PASS | |
905 | is turned on or not. */ | |
906 | ||
907 | static void | |
6a5ac314 | 908 | dump_one_pass (opt_pass *pass, int pass_indent) |
deced1e2 XDL |
909 | { |
910 | int indent = 3 * pass_indent; | |
911 | const char *pn; | |
912 | bool is_on, is_really_on; | |
913 | ||
1a3d085c | 914 | is_on = pass->gate (cfun); |
deced1e2 XDL |
915 | is_really_on = override_gate_status (pass, current_function_decl, is_on); |
916 | ||
917 | if (pass->static_pass_number <= 0) | |
918 | pn = pass->name; | |
919 | else | |
9771b263 | 920 | pn = pass_tab[pass->static_pass_number]; |
deced1e2 XDL |
921 | |
922 | fprintf (stderr, "%*s%-40s%*s:%s%s\n", indent, " ", pn, | |
923 | (15 - indent < 0 ? 0 : 15 - indent), " ", | |
924 | is_on ? " ON" : " OFF", | |
925 | ((!is_on) == (!is_really_on) ? "" | |
926 | : (is_really_on ? " (FORCED_ON)" : " (FORCED_OFF)"))); | |
927 | } | |
928 | ||
929 | /* Dump pass list PASS with indentation INDENT. */ | |
930 | ||
931 | static void | |
6a5ac314 | 932 | dump_pass_list (opt_pass *pass, int indent) |
deced1e2 XDL |
933 | { |
934 | do | |
935 | { | |
936 | dump_one_pass (pass, indent); | |
937 | if (pass->sub) | |
938 | dump_pass_list (pass->sub, indent + 1); | |
939 | pass = pass->next; | |
940 | } | |
941 | while (pass); | |
942 | } | |
943 | ||
944 | /* Dump all optimization passes. */ | |
945 | ||
946 | void | |
947 | dump_passes (void) | |
315f8c0e DM |
948 | { |
949 | g->get_passes ()->dump_passes (); | |
950 | } | |
951 | ||
952 | void | |
953 | pass_manager::dump_passes () const | |
deced1e2 | 954 | { |
5283d1ec | 955 | push_dummy_function (true); |
deced1e2 | 956 | |
c3284718 | 957 | create_pass_tab (); |
deced1e2 | 958 | |
deced1e2 XDL |
959 | dump_pass_list (all_lowering_passes, 1); |
960 | dump_pass_list (all_small_ipa_passes, 1); | |
961 | dump_pass_list (all_regular_ipa_passes, 1); | |
febb1302 | 962 | dump_pass_list (all_late_ipa_passes, 1); |
deced1e2 XDL |
963 | dump_pass_list (all_passes, 1); |
964 | ||
5283d1ec | 965 | pop_dummy_function (); |
deced1e2 XDL |
966 | } |
967 | ||
226c52aa XDL |
968 | /* Returns the pass with NAME. */ |
969 | ||
58d4c836 DM |
970 | opt_pass * |
971 | pass_manager::get_pass_by_name (const char *name) | |
226c52aa | 972 | { |
58d4c836 | 973 | opt_pass **p = m_name_to_pass_map->get (name); |
f98df77c TS |
974 | if (p) |
975 | return *p; | |
226c52aa | 976 | |
f98df77c | 977 | return NULL; |
226c52aa XDL |
978 | } |
979 | ||
980 | ||
981 | /* Range [start, last]. */ | |
982 | ||
983 | struct uid_range | |
984 | { | |
985 | unsigned int start; | |
986 | unsigned int last; | |
bb5b1f5e | 987 | const char *assem_name; |
226c52aa XDL |
988 | struct uid_range *next; |
989 | }; | |
990 | ||
991 | typedef struct uid_range *uid_range_p; | |
992 | ||
226c52aa | 993 | |
7de76362 JJ |
994 | static vec<uid_range_p> enabled_pass_uid_range_tab; |
995 | static vec<uid_range_p> disabled_pass_uid_range_tab; | |
226c52aa | 996 | |
bb5b1f5e | 997 | |
226c52aa XDL |
998 | /* Parse option string for -fdisable- and -fenable- |
999 | The syntax of the options: | |
1000 | ||
1001 | -fenable-<pass_name> | |
1002 | -fdisable-<pass_name> | |
1003 | ||
1004 | -fenable-<pass_name>=s1:e1,s2:e2,... | |
1005 | -fdisable-<pass_name>=s1:e1,s2:e2,... | |
1006 | */ | |
1007 | ||
1008 | static void | |
1009 | enable_disable_pass (const char *arg, bool is_enable) | |
1010 | { | |
6a5ac314 | 1011 | opt_pass *pass; |
226c52aa XDL |
1012 | char *range_str, *phase_name; |
1013 | char *argstr = xstrdup (arg); | |
9771b263 | 1014 | vec<uid_range_p> *tab = 0; |
226c52aa XDL |
1015 | |
1016 | range_str = strchr (argstr,'='); | |
1017 | if (range_str) | |
1018 | { | |
1019 | *range_str = '\0'; | |
1020 | range_str++; | |
1021 | } | |
1022 | ||
1023 | phase_name = argstr; | |
1024 | if (!*phase_name) | |
1025 | { | |
1026 | if (is_enable) | |
1027 | error ("unrecognized option -fenable"); | |
1028 | else | |
1029 | error ("unrecognized option -fdisable"); | |
1030 | free (argstr); | |
1031 | return; | |
1032 | } | |
58d4c836 | 1033 | pass = g->get_passes ()->get_pass_by_name (phase_name); |
226c52aa XDL |
1034 | if (!pass || pass->static_pass_number == -1) |
1035 | { | |
1036 | if (is_enable) | |
1037 | error ("unknown pass %s specified in -fenable", phase_name); | |
1038 | else | |
1eb3478f | 1039 | error ("unknown pass %s specified in -fdisable", phase_name); |
226c52aa XDL |
1040 | free (argstr); |
1041 | return; | |
1042 | } | |
1043 | ||
1044 | if (is_enable) | |
1045 | tab = &enabled_pass_uid_range_tab; | |
1046 | else | |
1047 | tab = &disabled_pass_uid_range_tab; | |
1048 | ||
9771b263 DN |
1049 | if ((unsigned) pass->static_pass_number >= tab->length ()) |
1050 | tab->safe_grow_cleared (pass->static_pass_number + 1); | |
226c52aa XDL |
1051 | |
1052 | if (!range_str) | |
1053 | { | |
1054 | uid_range_p slot; | |
1055 | uid_range_p new_range = XCNEW (struct uid_range); | |
1056 | ||
1057 | new_range->start = 0; | |
1058 | new_range->last = (unsigned)-1; | |
1059 | ||
9771b263 | 1060 | slot = (*tab)[pass->static_pass_number]; |
226c52aa | 1061 | new_range->next = slot; |
9771b263 | 1062 | (*tab)[pass->static_pass_number] = new_range; |
226c52aa XDL |
1063 | if (is_enable) |
1064 | inform (UNKNOWN_LOCATION, "enable pass %s for functions in the range " | |
1065 | "of [%u, %u]", phase_name, new_range->start, new_range->last); | |
1066 | else | |
1067 | inform (UNKNOWN_LOCATION, "disable pass %s for functions in the range " | |
1068 | "of [%u, %u]", phase_name, new_range->start, new_range->last); | |
1069 | } | |
1070 | else | |
1071 | { | |
1072 | char *next_range = NULL; | |
1073 | char *one_range = range_str; | |
1074 | char *end_val = NULL; | |
1075 | ||
1076 | do | |
1077 | { | |
1078 | uid_range_p slot; | |
1079 | uid_range_p new_range; | |
1080 | char *invalid = NULL; | |
1081 | long start; | |
bb5b1f5e | 1082 | char *func_name = NULL; |
226c52aa XDL |
1083 | |
1084 | next_range = strchr (one_range, ','); | |
1085 | if (next_range) | |
1086 | { | |
1087 | *next_range = '\0'; | |
1088 | next_range++; | |
1089 | } | |
1090 | ||
1091 | end_val = strchr (one_range, ':'); | |
1092 | if (end_val) | |
1093 | { | |
1094 | *end_val = '\0'; | |
1095 | end_val++; | |
1096 | } | |
1097 | start = strtol (one_range, &invalid, 10); | |
1098 | if (*invalid || start < 0) | |
1099 | { | |
bb5b1f5e XDL |
1100 | if (end_val || (one_range[0] >= '0' |
1101 | && one_range[0] <= '9')) | |
1102 | { | |
1103 | error ("Invalid range %s in option %s", | |
1104 | one_range, | |
1105 | is_enable ? "-fenable" : "-fdisable"); | |
1106 | free (argstr); | |
1107 | return; | |
1108 | } | |
1109 | func_name = one_range; | |
226c52aa XDL |
1110 | } |
1111 | if (!end_val) | |
1112 | { | |
1113 | new_range = XCNEW (struct uid_range); | |
bb5b1f5e XDL |
1114 | if (!func_name) |
1115 | { | |
1116 | new_range->start = (unsigned) start; | |
1117 | new_range->last = (unsigned) start; | |
1118 | } | |
1119 | else | |
1120 | { | |
1121 | new_range->start = (unsigned) -1; | |
1122 | new_range->last = (unsigned) -1; | |
1123 | new_range->assem_name = xstrdup (func_name); | |
1124 | } | |
226c52aa XDL |
1125 | } |
1126 | else | |
1127 | { | |
1128 | long last = strtol (end_val, &invalid, 10); | |
1129 | if (*invalid || last < start) | |
1130 | { | |
1131 | error ("Invalid range %s in option %s", | |
1132 | end_val, | |
1133 | is_enable ? "-fenable" : "-fdisable"); | |
1134 | free (argstr); | |
1135 | return; | |
1136 | } | |
1137 | new_range = XCNEW (struct uid_range); | |
1138 | new_range->start = (unsigned) start; | |
1139 | new_range->last = (unsigned) last; | |
1140 | } | |
1141 | ||
9771b263 | 1142 | slot = (*tab)[pass->static_pass_number]; |
226c52aa | 1143 | new_range->next = slot; |
9771b263 | 1144 | (*tab)[pass->static_pass_number] = new_range; |
226c52aa | 1145 | if (is_enable) |
bb5b1f5e XDL |
1146 | { |
1147 | if (new_range->assem_name) | |
1148 | inform (UNKNOWN_LOCATION, | |
1149 | "enable pass %s for function %s", | |
1150 | phase_name, new_range->assem_name); | |
1151 | else | |
1152 | inform (UNKNOWN_LOCATION, | |
1153 | "enable pass %s for functions in the range of [%u, %u]", | |
1154 | phase_name, new_range->start, new_range->last); | |
1155 | } | |
226c52aa | 1156 | else |
bb5b1f5e XDL |
1157 | { |
1158 | if (new_range->assem_name) | |
1159 | inform (UNKNOWN_LOCATION, | |
1160 | "disable pass %s for function %s", | |
1161 | phase_name, new_range->assem_name); | |
1162 | else | |
1163 | inform (UNKNOWN_LOCATION, | |
1164 | "disable pass %s for functions in the range of [%u, %u]", | |
1165 | phase_name, new_range->start, new_range->last); | |
1166 | } | |
226c52aa XDL |
1167 | |
1168 | one_range = next_range; | |
1169 | } while (next_range); | |
1170 | } | |
1171 | ||
1172 | free (argstr); | |
1173 | } | |
1174 | ||
1175 | /* Enable pass specified by ARG. */ | |
1176 | ||
1177 | void | |
1178 | enable_pass (const char *arg) | |
1179 | { | |
1180 | enable_disable_pass (arg, true); | |
1181 | } | |
1182 | ||
1183 | /* Disable pass specified by ARG. */ | |
1184 | ||
1185 | void | |
1186 | disable_pass (const char *arg) | |
1187 | { | |
1188 | enable_disable_pass (arg, false); | |
1189 | } | |
1190 | ||
1191 | /* Returns true if PASS is explicitly enabled/disabled for FUNC. */ | |
1192 | ||
1193 | static bool | |
6a5ac314 | 1194 | is_pass_explicitly_enabled_or_disabled (opt_pass *pass, |
226c52aa | 1195 | tree func, |
9771b263 | 1196 | vec<uid_range_p> tab) |
226c52aa XDL |
1197 | { |
1198 | uid_range_p slot, range; | |
1199 | int cgraph_uid; | |
bb5b1f5e | 1200 | const char *aname = NULL; |
226c52aa | 1201 | |
9771b263 DN |
1202 | if (!tab.exists () |
1203 | || (unsigned) pass->static_pass_number >= tab.length () | |
226c52aa XDL |
1204 | || pass->static_pass_number == -1) |
1205 | return false; | |
1206 | ||
9771b263 | 1207 | slot = tab[pass->static_pass_number]; |
226c52aa XDL |
1208 | if (!slot) |
1209 | return false; | |
1210 | ||
d52f5295 | 1211 | cgraph_uid = func ? cgraph_node::get (func)->uid : 0; |
bb5b1f5e XDL |
1212 | if (func && DECL_ASSEMBLER_NAME_SET_P (func)) |
1213 | aname = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (func)); | |
226c52aa XDL |
1214 | |
1215 | range = slot; | |
1216 | while (range) | |
1217 | { | |
1218 | if ((unsigned) cgraph_uid >= range->start | |
1219 | && (unsigned) cgraph_uid <= range->last) | |
1220 | return true; | |
bb5b1f5e XDL |
1221 | if (range->assem_name && aname |
1222 | && !strcmp (range->assem_name, aname)) | |
1223 | return true; | |
226c52aa XDL |
1224 | range = range->next; |
1225 | } | |
1226 | ||
1227 | return false; | |
1228 | } | |
1229 | ||
f9957958 | 1230 | |
8ac69a6c DM |
1231 | /* Update static_pass_number for passes (and the flag |
1232 | TODO_mark_first_instance). | |
f6db1481 | 1233 | |
8ac69a6c DM |
1234 | Passes are constructed with static_pass_number preinitialized to 0 |
1235 | ||
1236 | This field is used in two different ways: initially as instance numbers | |
1237 | of their kind, and then as ids within the entire pass manager. | |
1238 | ||
1239 | Within pass_manager::pass_manager: | |
1240 | ||
1241 | * In add_pass_instance(), as called by next_pass_1 in | |
1242 | NEXT_PASS in init_optimization_passes | |
63a00e0d | 1243 | |
8ac69a6c DM |
1244 | * When the initial instance of a pass within a pass manager is seen, |
1245 | it is flagged, and its static_pass_number is set to -1 | |
f6db1481 | 1246 | |
8ac69a6c DM |
1247 | * On subsequent times that it is seen, the static pass number |
1248 | is decremented each time, so that if there are e.g. 4 dups, | |
1249 | they have static_pass_number -4, 2, 3, 4 respectively (note | |
1250 | how the initial one is negative and gives the count); these | |
1251 | can be thought of as instance numbers of the specific pass | |
1252 | ||
1253 | * Within the register_dump_files () traversal, set_pass_for_id() | |
1254 | is called on each pass, using these instance numbers to create | |
1255 | dumpfile switches, and then overwriting them with a pass id, | |
1256 | which are global to the whole pass manager (based on | |
1257 | (TDI_end + current value of extra_dump_files_in_use) ) */ | |
1258 | ||
1259 | static void | |
6a5ac314 | 1260 | add_pass_instance (opt_pass *new_pass, bool track_duplicates, |
8ac69a6c DM |
1261 | opt_pass *initial_pass) |
1262 | { | |
1263 | /* Are we dealing with the first pass of its kind, or a clone? */ | |
1264 | if (new_pass != initial_pass) | |
1265 | { | |
1266 | /* We're dealing with a clone. */ | |
82d6e6fc | 1267 | new_pass->todo_flags_start &= ~TODO_mark_first_instance; |
b02b9b53 | 1268 | |
ef330312 PB |
1269 | /* Indicate to register_dump_files that this pass has duplicates, |
1270 | and so it should rename the dump file. The first instance will | |
1271 | be -1, and be number of duplicates = -static_pass_number - 1. | |
1272 | Subsequent instances will be > 0 and just the duplicate number. */ | |
8ac69a6c | 1273 | if ((new_pass->name && new_pass->name[0] != '*') || track_duplicates) |
ef330312 | 1274 | { |
8ac69a6c DM |
1275 | initial_pass->static_pass_number -= 1; |
1276 | new_pass->static_pass_number = -initial_pass->static_pass_number; | |
ef330312 | 1277 | } |
ef330312 PB |
1278 | } |
1279 | else | |
1280 | { | |
8ac69a6c DM |
1281 | /* We're dealing with the first pass of its kind. */ |
1282 | new_pass->todo_flags_start |= TODO_mark_first_instance; | |
1283 | new_pass->static_pass_number = -1; | |
090fa0ab | 1284 | |
8ac69a6c | 1285 | invoke_plugin_callbacks (PLUGIN_NEW_PASS, new_pass); |
b8698a0f | 1286 | } |
b80b0fd9 ST |
1287 | } |
1288 | ||
1289 | /* Add a pass to the pass list. Duplicate the pass if it's already | |
1290 | in the list. */ | |
1291 | ||
6a5ac314 OE |
1292 | static opt_pass ** |
1293 | next_pass_1 (opt_pass **list, opt_pass *pass, opt_pass *initial_pass) | |
b80b0fd9 | 1294 | { |
e0a42b0f ZC |
1295 | /* Every pass should have a name so that plugins can refer to them. */ |
1296 | gcc_assert (pass->name != NULL); | |
1297 | ||
8ac69a6c DM |
1298 | add_pass_instance (pass, false, initial_pass); |
1299 | *list = pass; | |
b8698a0f | 1300 | |
ef330312 | 1301 | return &(*list)->next; |
f6db1481 RH |
1302 | } |
1303 | ||
b80b0fd9 ST |
1304 | /* List node for an inserted pass instance. We need to keep track of all |
1305 | the newly-added pass instances (with 'added_pass_nodes' defined below) | |
1306 | so that we can register their dump files after pass-positioning is finished. | |
1307 | Registering dumping files needs to be post-processed or the | |
1308 | static_pass_number of the opt_pass object would be modified and mess up | |
1309 | the dump file names of future pass instances to be added. */ | |
1310 | ||
1311 | struct pass_list_node | |
1312 | { | |
6a5ac314 | 1313 | opt_pass *pass; |
b80b0fd9 ST |
1314 | struct pass_list_node *next; |
1315 | }; | |
1316 | ||
1317 | static struct pass_list_node *added_pass_nodes = NULL; | |
1318 | static struct pass_list_node *prev_added_pass_node; | |
1319 | ||
b8698a0f | 1320 | /* Insert the pass at the proper position. Return true if the pass |
b80b0fd9 ST |
1321 | is successfully added. |
1322 | ||
1323 | NEW_PASS_INFO - new pass to be inserted | |
1324 | PASS_LIST - root of the pass list to insert the new pass to */ | |
1325 | ||
1326 | static bool | |
6a5ac314 | 1327 | position_pass (struct register_pass_info *new_pass_info, opt_pass **pass_list) |
b80b0fd9 | 1328 | { |
6a5ac314 | 1329 | opt_pass *pass = *pass_list, *prev_pass = NULL; |
b80b0fd9 ST |
1330 | bool success = false; |
1331 | ||
1332 | for ( ; pass; prev_pass = pass, pass = pass->next) | |
1333 | { | |
1334 | /* Check if the current pass is of the same type as the new pass and | |
1335 | matches the name and the instance number of the reference pass. */ | |
1336 | if (pass->type == new_pass_info->pass->type | |
1337 | && pass->name | |
1338 | && !strcmp (pass->name, new_pass_info->reference_pass_name) | |
1339 | && ((new_pass_info->ref_pass_instance_number == 0) | |
1340 | || (new_pass_info->ref_pass_instance_number == | |
1341 | pass->static_pass_number) | |
1342 | || (new_pass_info->ref_pass_instance_number == 1 | |
1343 | && pass->todo_flags_start & TODO_mark_first_instance))) | |
1344 | { | |
6a5ac314 | 1345 | opt_pass *new_pass; |
b80b0fd9 ST |
1346 | struct pass_list_node *new_pass_node; |
1347 | ||
8ac69a6c DM |
1348 | if (new_pass_info->ref_pass_instance_number == 0) |
1349 | { | |
1350 | new_pass = new_pass_info->pass->clone (); | |
1351 | add_pass_instance (new_pass, true, new_pass_info->pass); | |
1352 | } | |
1353 | else | |
1354 | { | |
1355 | new_pass = new_pass_info->pass; | |
1356 | add_pass_instance (new_pass, true, new_pass); | |
1357 | } | |
b8698a0f | 1358 | |
b80b0fd9 ST |
1359 | /* Insert the new pass instance based on the positioning op. */ |
1360 | switch (new_pass_info->pos_op) | |
1361 | { | |
1362 | case PASS_POS_INSERT_AFTER: | |
1363 | new_pass->next = pass->next; | |
1364 | pass->next = new_pass; | |
1365 | ||
1366 | /* Skip newly inserted pass to avoid repeated | |
1367 | insertions in the case where the new pass and the | |
1368 | existing one have the same name. */ | |
b8698a0f | 1369 | pass = new_pass; |
b80b0fd9 ST |
1370 | break; |
1371 | case PASS_POS_INSERT_BEFORE: | |
1372 | new_pass->next = pass; | |
1373 | if (prev_pass) | |
1374 | prev_pass->next = new_pass; | |
1375 | else | |
1376 | *pass_list = new_pass; | |
1377 | break; | |
1378 | case PASS_POS_REPLACE: | |
1379 | new_pass->next = pass->next; | |
1380 | if (prev_pass) | |
1381 | prev_pass->next = new_pass; | |
1382 | else | |
1383 | *pass_list = new_pass; | |
1384 | new_pass->sub = pass->sub; | |
1385 | new_pass->tv_id = pass->tv_id; | |
1386 | pass = new_pass; | |
1387 | break; | |
1388 | default: | |
d8a07487 | 1389 | error ("invalid pass positioning operation"); |
b80b0fd9 ST |
1390 | return false; |
1391 | } | |
1392 | ||
1393 | /* Save the newly added pass (instance) in the added_pass_nodes | |
1394 | list so that we can register its dump file later. Note that | |
1395 | we cannot register the dump file now because doing so will modify | |
1396 | the static_pass_number of the opt_pass object and therefore | |
1397 | mess up the dump file name of future instances. */ | |
1398 | new_pass_node = XCNEW (struct pass_list_node); | |
1399 | new_pass_node->pass = new_pass; | |
1400 | if (!added_pass_nodes) | |
1401 | added_pass_nodes = new_pass_node; | |
1402 | else | |
1403 | prev_added_pass_node->next = new_pass_node; | |
1404 | prev_added_pass_node = new_pass_node; | |
1405 | ||
1406 | success = true; | |
1407 | } | |
1408 | ||
1409 | if (pass->sub && position_pass (new_pass_info, &pass->sub)) | |
1410 | success = true; | |
1411 | } | |
1412 | ||
1413 | return success; | |
1414 | } | |
1415 | ||
1416 | /* Hooks a new pass into the pass lists. | |
1417 | ||
1418 | PASS_INFO - pass information that specifies the opt_pass object, | |
1419 | reference pass, instance number, and how to position | |
1420 | the pass */ | |
1421 | ||
1422 | void | |
1423 | register_pass (struct register_pass_info *pass_info) | |
315f8c0e DM |
1424 | { |
1425 | g->get_passes ()->register_pass (pass_info); | |
3fa3690d OE |
1426 | } |
1427 | ||
1428 | void | |
1429 | register_pass (opt_pass* pass, pass_positioning_ops pos, | |
1430 | const char* ref_pass_name, int ref_pass_inst_number) | |
1431 | { | |
1432 | register_pass_info i; | |
1433 | i.pass = pass; | |
1434 | i.reference_pass_name = ref_pass_name; | |
1435 | i.ref_pass_instance_number = ref_pass_inst_number; | |
1436 | i.pos_op = pos; | |
315f8c0e | 1437 | |
3fa3690d | 1438 | g->get_passes ()->register_pass (&i); |
315f8c0e DM |
1439 | } |
1440 | ||
1441 | void | |
1442 | pass_manager::register_pass (struct register_pass_info *pass_info) | |
b80b0fd9 | 1443 | { |
669887fc | 1444 | bool all_instances, success; |
47e0da37 | 1445 | gcc::dump_manager *dumps = m_ctxt->get_dumps (); |
669887fc | 1446 | |
b9e467a2 BS |
1447 | /* The checks below could fail in buggy plugins. Existing GCC |
1448 | passes should never fail these checks, so we mention plugin in | |
1449 | the messages. */ | |
b80b0fd9 | 1450 | if (!pass_info->pass) |
40fecdd6 | 1451 | fatal_error (input_location, "plugin cannot register a missing pass"); |
b9e467a2 BS |
1452 | |
1453 | if (!pass_info->pass->name) | |
40fecdd6 | 1454 | fatal_error (input_location, "plugin cannot register an unnamed pass"); |
b80b0fd9 ST |
1455 | |
1456 | if (!pass_info->reference_pass_name) | |
b9e467a2 | 1457 | fatal_error |
40fecdd6 JM |
1458 | (input_location, |
1459 | "plugin cannot register pass %qs without reference pass name", | |
b9e467a2 | 1460 | pass_info->pass->name); |
b80b0fd9 | 1461 | |
b9e467a2 | 1462 | /* Try to insert the new pass to the pass lists. We need to check |
669887fc | 1463 | all five lists as the reference pass could be in one (or all) of |
b9e467a2 | 1464 | them. */ |
669887fc DS |
1465 | all_instances = pass_info->ref_pass_instance_number == 0; |
1466 | success = position_pass (pass_info, &all_lowering_passes); | |
1467 | if (!success || all_instances) | |
1468 | success |= position_pass (pass_info, &all_small_ipa_passes); | |
1469 | if (!success || all_instances) | |
1470 | success |= position_pass (pass_info, &all_regular_ipa_passes); | |
febb1302 JH |
1471 | if (!success || all_instances) |
1472 | success |= position_pass (pass_info, &all_late_ipa_passes); | |
669887fc DS |
1473 | if (!success || all_instances) |
1474 | success |= position_pass (pass_info, &all_passes); | |
1475 | if (!success) | |
b9e467a2 | 1476 | fatal_error |
40fecdd6 JM |
1477 | (input_location, |
1478 | "pass %qs not found but is referenced by new pass %qs", | |
b9e467a2 | 1479 | pass_info->reference_pass_name, pass_info->pass->name); |
669887fc DS |
1480 | |
1481 | /* OK, we have successfully inserted the new pass. We need to register | |
1482 | the dump files for the newly added pass and its duplicates (if any). | |
1483 | Because the registration of plugin/backend passes happens after the | |
1484 | command-line options are parsed, the options that specify single | |
1485 | pass dumping (e.g. -fdump-tree-PASSNAME) cannot be used for new | |
1486 | passes. Therefore we currently can only enable dumping of | |
1487 | new passes when the 'dump-all' flags (e.g. -fdump-tree-all) | |
1488 | are specified. While doing so, we also delete the pass_list_node | |
1489 | objects created during pass positioning. */ | |
1490 | while (added_pass_nodes) | |
b80b0fd9 | 1491 | { |
669887fc DS |
1492 | struct pass_list_node *next_node = added_pass_nodes->next; |
1493 | enum tree_dump_index tdi; | |
1494 | register_one_dump_file (added_pass_nodes->pass); | |
1495 | if (added_pass_nodes->pass->type == SIMPLE_IPA_PASS | |
1496 | || added_pass_nodes->pass->type == IPA_PASS) | |
1497 | tdi = TDI_ipa_all; | |
1498 | else if (added_pass_nodes->pass->type == GIMPLE_PASS) | |
1499 | tdi = TDI_tree_all; | |
1500 | else | |
1501 | tdi = TDI_rtl_all; | |
1502 | /* Check if dump-all flag is specified. */ | |
47e0da37 | 1503 | if (dumps->get_dump_file_info (tdi)->pstate) |
da152c9f TV |
1504 | { |
1505 | dumps->get_dump_file_info (added_pass_nodes->pass->static_pass_number) | |
47e0da37 | 1506 | ->pstate = dumps->get_dump_file_info (tdi)->pstate; |
da152c9f TV |
1507 | dumps->get_dump_file_info (added_pass_nodes->pass->static_pass_number) |
1508 | ->pflags = dumps->get_dump_file_info (tdi)->pflags; | |
1509 | } | |
669887fc DS |
1510 | XDELETE (added_pass_nodes); |
1511 | added_pass_nodes = next_node; | |
b80b0fd9 ST |
1512 | } |
1513 | } | |
6fb5fa3c | 1514 | |
dd97d271 DN |
1515 | /* Construct the pass tree. The sequencing of passes is driven by |
1516 | the cgraph routines: | |
1517 | ||
65d630d4 | 1518 | finalize_compilation_unit () |
dd97d271 DN |
1519 | for each node N in the cgraph |
1520 | cgraph_analyze_function (N) | |
1521 | cgraph_lower_function (N) -> all_lowering_passes | |
1522 | ||
65d630d4 | 1523 | If we are optimizing, compile is then invoked: |
dd97d271 | 1524 | |
65d630d4 | 1525 | compile () |
d7f09764 | 1526 | ipa_passes () -> all_small_ipa_passes |
65d630d4 JH |
1527 | -> Analysis of all_regular_ipa_passes |
1528 | * possible LTO streaming at copmilation time * | |
1529 | -> Execution of all_regular_ipa_passes | |
1530 | * possible LTO streaming at link time * | |
1531 | -> all_late_ipa_passes | |
1532 | expand_all_functions () | |
dd97d271 | 1533 | for each node N in the cgraph |
65d630d4 JH |
1534 | expand_function (N) -> Transformation of all_regular_ipa_passes |
1535 | -> all_passes | |
dd97d271 | 1536 | */ |
97b0ade3 | 1537 | |
315f8c0e | 1538 | pass_manager::pass_manager (context *ctxt) |
c3284718 | 1539 | : all_passes (NULL), all_small_ipa_passes (NULL), all_lowering_passes (NULL), |
38f4f02f | 1540 | all_regular_ipa_passes (NULL), |
c3284718 | 1541 | all_late_ipa_passes (NULL), passes_by_id (NULL), passes_by_id_size (0), |
468afa1a | 1542 | m_ctxt (ctxt), m_name_to_pass_map (NULL) |
ef330312 | 1543 | { |
6a5ac314 | 1544 | opt_pass **p; |
ef330312 | 1545 | |
3c5b0ca4 RB |
1546 | /* Zero-initialize pass members. */ |
1547 | #define INSERT_PASSES_AFTER(PASS) | |
1548 | #define PUSH_INSERT_PASSES_WITHIN(PASS) | |
1549 | #define POP_INSERT_PASSES() | |
1550 | #define NEXT_PASS(PASS, NUM) PASS ## _ ## NUM = NULL | |
1551 | #define NEXT_PASS_WITH_ARG(PASS, NUM, ARG) NEXT_PASS (PASS, NUM) | |
1552 | #define TERMINATE_PASS_LIST(PASS) | |
1553 | #include "pass-instances.def" | |
1554 | #undef INSERT_PASSES_AFTER | |
1555 | #undef PUSH_INSERT_PASSES_WITHIN | |
1556 | #undef POP_INSERT_PASSES | |
1557 | #undef NEXT_PASS | |
1558 | #undef NEXT_PASS_WITH_ARG | |
1559 | #undef TERMINATE_PASS_LIST | |
1560 | ||
315f8c0e DM |
1561 | /* Initialize the pass_lists array. */ |
1562 | #define DEF_PASS_LIST(LIST) pass_lists[PASS_LIST_NO_##LIST] = &LIST; | |
1563 | GCC_PASS_LISTS | |
1564 | #undef DEF_PASS_LIST | |
1565 | ||
1566 | /* Build the tree of passes. */ | |
1567 | ||
17e7ab87 TV |
1568 | #define INSERT_PASSES_AFTER(PASS) \ |
1569 | { \ | |
1570 | opt_pass **p_start; \ | |
1571 | p_start = p = &(PASS); | |
1572 | ||
1573 | #define TERMINATE_PASS_LIST(PASS) \ | |
1574 | gcc_assert (p_start == &PASS); \ | |
1575 | *p = NULL; \ | |
1576 | } | |
2efa4087 DM |
1577 | |
1578 | #define PUSH_INSERT_PASSES_WITHIN(PASS) \ | |
1579 | { \ | |
6a5ac314 | 1580 | opt_pass **p = &(PASS ## _1)->sub; |
2efa4087 DM |
1581 | |
1582 | #define POP_INSERT_PASSES() \ | |
1583 | } | |
1584 | ||
f7695dbf DM |
1585 | #define NEXT_PASS(PASS, NUM) \ |
1586 | do { \ | |
01512446 | 1587 | gcc_assert (PASS ## _ ## NUM == NULL); \ |
f7695dbf | 1588 | if ((NUM) == 1) \ |
65d3284b | 1589 | PASS ## _1 = make_##PASS (m_ctxt); \ |
f7695dbf DM |
1590 | else \ |
1591 | { \ | |
1592 | gcc_assert (PASS ## _1); \ | |
1593 | PASS ## _ ## NUM = PASS ## _1->clone (); \ | |
1594 | } \ | |
8ac69a6c | 1595 | p = next_pass_1 (p, PASS ## _ ## NUM, PASS ## _1); \ |
f7695dbf | 1596 | } while (0) |
873aa8f5 | 1597 | |
b0c77505 TV |
1598 | #define NEXT_PASS_WITH_ARG(PASS, NUM, ARG) \ |
1599 | do { \ | |
1600 | NEXT_PASS (PASS, NUM); \ | |
1601 | PASS ## _ ## NUM->set_pass_param (0, ARG); \ | |
1602 | } while (0) | |
1603 | ||
a167b052 | 1604 | #include "pass-instances.def" |
ef330312 | 1605 | |
2efa4087 DM |
1606 | #undef INSERT_PASSES_AFTER |
1607 | #undef PUSH_INSERT_PASSES_WITHIN | |
1608 | #undef POP_INSERT_PASSES | |
ef330312 | 1609 | #undef NEXT_PASS |
b0c77505 | 1610 | #undef NEXT_PASS_WITH_ARG |
2efa4087 | 1611 | #undef TERMINATE_PASS_LIST |
ef330312 PB |
1612 | |
1613 | /* Register the passes with the tree dump code. */ | |
a23c217d TS |
1614 | register_dump_files (all_lowering_passes); |
1615 | register_dump_files (all_small_ipa_passes); | |
1616 | register_dump_files (all_regular_ipa_passes); | |
1617 | register_dump_files (all_late_ipa_passes); | |
1618 | register_dump_files (all_passes); | |
ef330312 PB |
1619 | } |
1620 | ||
10fdd6e9 DM |
1621 | static void |
1622 | delete_pass_tree (opt_pass *pass) | |
1623 | { | |
1624 | while (pass) | |
1625 | { | |
1626 | /* Recurse into child passes. */ | |
1627 | delete_pass_tree (pass->sub); | |
1628 | ||
1629 | opt_pass *next = pass->next; | |
1630 | ||
1631 | /* Delete this pass. */ | |
1632 | delete pass; | |
1633 | ||
1634 | /* Iterate onto sibling passes. */ | |
1635 | pass = next; | |
1636 | } | |
1637 | } | |
1638 | ||
1639 | pass_manager::~pass_manager () | |
1640 | { | |
1641 | XDELETEVEC (passes_by_id); | |
1642 | ||
1643 | /* Call delete_pass_tree on each of the pass_lists. */ | |
1644 | #define DEF_PASS_LIST(LIST) \ | |
1645 | delete_pass_tree (*pass_lists[PASS_LIST_NO_##LIST]); | |
1646 | GCC_PASS_LISTS | |
1647 | #undef DEF_PASS_LIST | |
1648 | ||
1649 | } | |
1650 | ||
a5093353 JH |
1651 | /* If we are in IPA mode (i.e., current_function_decl is NULL), call |
1652 | function CALLBACK for every function in the call graph. Otherwise, | |
b8698a0f | 1653 | call CALLBACK on the current function. */ |
bbbe4e7b | 1654 | |
ef330312 | 1655 | static void |
2cbf2d95 | 1656 | do_per_function (void (*callback) (function *, void *data), void *data) |
ef330312 | 1657 | { |
a5093353 | 1658 | if (current_function_decl) |
2cbf2d95 | 1659 | callback (cfun, data); |
a5093353 JH |
1660 | else |
1661 | { | |
1662 | struct cgraph_node *node; | |
65c70e6b | 1663 | FOR_EACH_DEFINED_FUNCTION (node) |
fd29c024 | 1664 | if (node->analyzed && (gimple_has_body_p (node->decl) && !in_lto_p) |
67348ccc | 1665 | && (!node->clone_of || node->decl != node->clone_of->decl)) |
2cbf2d95 | 1666 | callback (DECL_STRUCT_FUNCTION (node->decl), data); |
a5093353 JH |
1667 | } |
1668 | } | |
1669 | ||
873aa8f5 JH |
1670 | /* Because inlining might remove no-longer reachable nodes, we need to |
1671 | keep the array visible to garbage collector to avoid reading collected | |
1672 | out nodes. */ | |
1673 | static int nnodes; | |
d52f5295 | 1674 | static GTY ((length ("nnodes"))) cgraph_node **order; |
873aa8f5 | 1675 | |
005581f1 IE |
1676 | /* Hook called when NODE is removed and therefore should be |
1677 | excluded from order vector. DATA is an array of integers. | |
1678 | DATA[0] holds max index it may be accessed by. For cgraph | |
1679 | node DATA[node->uid + 1] holds index of this node in order | |
1680 | vector. */ | |
1681 | static void | |
1682 | remove_cgraph_node_from_order (cgraph_node *node, void *data) | |
1683 | { | |
1684 | int *order_idx = (int *)data; | |
1685 | ||
1686 | if (node->uid >= order_idx[0]) | |
1687 | return; | |
1688 | ||
1689 | int idx = order_idx[node->uid + 1]; | |
1690 | if (idx >= 0 && idx < nnodes && order[idx] == node) | |
1691 | order[idx] = NULL; | |
1692 | } | |
1693 | ||
873aa8f5 JH |
1694 | /* If we are in IPA mode (i.e., current_function_decl is NULL), call |
1695 | function CALLBACK for every function in the call graph. Otherwise, | |
090fa0ab GF |
1696 | call CALLBACK on the current function. |
1697 | This function is global so that plugins can use it. */ | |
1698 | void | |
2cbf2d95 | 1699 | do_per_function_toporder (void (*callback) (function *, void *data), void *data) |
873aa8f5 JH |
1700 | { |
1701 | int i; | |
1702 | ||
1703 | if (current_function_decl) | |
2cbf2d95 | 1704 | callback (cfun, data); |
873aa8f5 JH |
1705 | else |
1706 | { | |
005581f1 IE |
1707 | cgraph_node_hook_list *hook; |
1708 | int *order_idx; | |
873aa8f5 | 1709 | gcc_assert (!order); |
3dafb85c | 1710 | order = ggc_vec_alloc<cgraph_node *> (symtab->cgraph_count); |
005581f1 IE |
1711 | |
1712 | order_idx = XALLOCAVEC (int, symtab->cgraph_max_uid + 1); | |
1713 | memset (order_idx + 1, -1, sizeof (int) * symtab->cgraph_max_uid); | |
1714 | order_idx[0] = symtab->cgraph_max_uid; | |
1715 | ||
af8bca3c | 1716 | nnodes = ipa_reverse_postorder (order); |
257eb6e3 | 1717 | for (i = nnodes - 1; i >= 0; i--) |
005581f1 IE |
1718 | { |
1719 | order[i]->process = 1; | |
1720 | order_idx[order[i]->uid + 1] = i; | |
1721 | } | |
1722 | hook = symtab->add_cgraph_removal_hook (remove_cgraph_node_from_order, | |
1723 | order_idx); | |
873aa8f5 JH |
1724 | for (i = nnodes - 1; i >= 0; i--) |
1725 | { | |
005581f1 IE |
1726 | /* Function could be inlined and removed as unreachable. */ |
1727 | if (!order[i]) | |
1728 | continue; | |
1729 | ||
873aa8f5 JH |
1730 | struct cgraph_node *node = order[i]; |
1731 | ||
1732 | /* Allow possibly removed nodes to be garbage collected. */ | |
1733 | order[i] = NULL; | |
257eb6e3 | 1734 | node->process = 0; |
d52f5295 | 1735 | if (node->has_gimple_body_p ()) |
be373510 ML |
1736 | { |
1737 | struct function *fn = DECL_STRUCT_FUNCTION (node->decl); | |
1738 | push_cfun (fn); | |
1739 | callback (fn, data); | |
1740 | pop_cfun (); | |
1741 | } | |
873aa8f5 | 1742 | } |
005581f1 | 1743 | symtab->remove_cgraph_removal_hook (hook); |
873aa8f5 JH |
1744 | } |
1745 | ggc_free (order); | |
1746 | order = NULL; | |
1747 | nnodes = 0; | |
1748 | } | |
1749 | ||
22c5fa5f DL |
1750 | /* Helper function to perform function body dump. */ |
1751 | ||
1752 | static void | |
2cbf2d95 | 1753 | execute_function_dump (function *fn, void *data) |
22c5fa5f | 1754 | { |
9d5879a6 AH |
1755 | opt_pass *pass = (opt_pass *)data; |
1756 | ||
2cbf2d95 | 1757 | if (dump_file) |
22c5fa5f | 1758 | { |
2cbf2d95 RB |
1759 | push_cfun (fn); |
1760 | ||
1761 | if (fn->curr_properties & PROP_trees) | |
1762 | dump_function_to_file (fn->decl, dump_file, dump_flags); | |
22c5fa5f | 1763 | else |
a27a5de9 | 1764 | print_rtl_with_bb (dump_file, get_insns (), dump_flags); |
22c5fa5f DL |
1765 | |
1766 | /* Flush the file. If verification fails, we won't be able to | |
1767 | close the file before aborting. */ | |
1768 | fflush (dump_file); | |
a27a5de9 | 1769 | |
2cbf2d95 | 1770 | if ((fn->curr_properties & PROP_cfg) |
a27a5de9 | 1771 | && (dump_flags & TDF_GRAPH)) |
9d5879a6 | 1772 | { |
182c7868 TV |
1773 | gcc::dump_manager *dumps = g->get_dumps (); |
1774 | struct dump_file_info *dfi | |
1775 | = dumps->get_dump_file_info (pass->static_pass_number); | |
1776 | if (!dfi->graph_dump_initialized) | |
9d5879a6 AH |
1777 | { |
1778 | clean_graph_dump_file (dump_file_name); | |
182c7868 | 1779 | dfi->graph_dump_initialized = true; |
9d5879a6 | 1780 | } |
2cbf2d95 | 1781 | print_graph_cfg (dump_file_name, fn); |
9d5879a6 | 1782 | } |
2cbf2d95 RB |
1783 | |
1784 | pop_cfun (); | |
22c5fa5f DL |
1785 | } |
1786 | } | |
1787 | ||
a02d1ad2 AM |
1788 | /* This function is called when an internal compiler error is encountered. |
1789 | Ensure that function dump is made available before compiler is aborted. */ | |
1790 | ||
1791 | void | |
1792 | emergency_dump_function () | |
1793 | { | |
1794 | if (!current_pass) | |
1795 | return; | |
1796 | enum opt_pass_type pt = current_pass->type; | |
1797 | fnotice (stderr, "during %s pass: %s\n", | |
1798 | pt == GIMPLE_PASS ? "GIMPLE" : pt == RTL_PASS ? "RTL" : "IPA", | |
1799 | current_pass->name); | |
1800 | if (!dump_file || !cfun) | |
1801 | return; | |
1802 | fnotice (stderr, "dump file: %s\n", dump_file_name); | |
0281547a | 1803 | fprintf (dump_file, "\n\n\nEMERGENCY DUMP:\n\n"); |
a02d1ad2 AM |
1804 | execute_function_dump (cfun, current_pass); |
1805 | } | |
1806 | ||
37e5402b JH |
1807 | static struct profile_record *profile_record; |
1808 | ||
aa4723d7 SB |
1809 | /* Do profile consistency book-keeping for the pass with static number INDEX. |
1810 | If SUBPASS is zero, we run _before_ the pass, and if SUBPASS is one, then | |
1811 | we run _after_ the pass. RUN is true if the pass really runs, or FALSE | |
1812 | if we are only book-keeping on passes that may have selectively disabled | |
1813 | themselves on a given function. */ | |
37e5402b JH |
1814 | static void |
1815 | check_profile_consistency (int index, int subpass, bool run) | |
1816 | { | |
315f8c0e | 1817 | pass_manager *passes = g->get_passes (); |
37e5402b JH |
1818 | if (index == -1) |
1819 | return; | |
1820 | if (!profile_record) | |
1821 | profile_record = XCNEWVEC (struct profile_record, | |
315f8c0e DM |
1822 | passes->passes_by_id_size); |
1823 | gcc_assert (index < passes->passes_by_id_size && index >= 0); | |
37e5402b JH |
1824 | gcc_assert (subpass < 2); |
1825 | profile_record[index].run |= run; | |
aa4723d7 | 1826 | account_profile_record (&profile_record[index], subpass); |
37e5402b JH |
1827 | } |
1828 | ||
1829 | /* Output profile consistency. */ | |
1830 | ||
1831 | void | |
1832 | dump_profile_report (void) | |
315f8c0e DM |
1833 | { |
1834 | g->get_passes ()->dump_profile_report (); | |
1835 | } | |
1836 | ||
1837 | void | |
1838 | pass_manager::dump_profile_report () const | |
37e5402b JH |
1839 | { |
1840 | int i, j; | |
1841 | int last_freq_in = 0, last_count_in = 0, last_freq_out = 0, last_count_out = 0; | |
28d516bc | 1842 | gcov_type last_time = 0, last_size = 0; |
37e5402b | 1843 | double rel_time_change, rel_size_change; |
6ada5e7d | 1844 | int last_reported = 0; |
37e5402b JH |
1845 | |
1846 | if (!profile_record) | |
1847 | return; | |
1848 | fprintf (stderr, "\nProfile consistency report:\n\n"); | |
1849 | fprintf (stderr, "Pass name |mismatch in |mismated out|Overall\n"); | |
28d516bc | 1850 | fprintf (stderr, " |freq count |freq count |size time\n"); |
37e5402b JH |
1851 | |
1852 | for (i = 0; i < passes_by_id_size; i++) | |
1853 | for (j = 0 ; j < 2; j++) | |
1854 | if (profile_record[i].run) | |
1855 | { | |
1856 | if (last_time) | |
1857 | rel_time_change = (profile_record[i].time[j] | |
1858 | - (double)last_time) * 100 / (double)last_time; | |
1859 | else | |
1860 | rel_time_change = 0; | |
1861 | if (last_size) | |
1862 | rel_size_change = (profile_record[i].size[j] | |
1863 | - (double)last_size) * 100 / (double)last_size; | |
1864 | else | |
1865 | rel_size_change = 0; | |
1866 | ||
1867 | if (profile_record[i].num_mismatched_freq_in[j] != last_freq_in | |
1868 | || profile_record[i].num_mismatched_freq_out[j] != last_freq_out | |
1869 | || profile_record[i].num_mismatched_count_in[j] != last_count_in | |
1870 | || profile_record[i].num_mismatched_count_out[j] != last_count_out | |
1871 | || rel_time_change || rel_size_change) | |
1872 | { | |
1873 | last_reported = i; | |
1874 | fprintf (stderr, "%-20s %s", | |
1875 | passes_by_id [i]->name, | |
1876 | j ? "(after TODO)" : " "); | |
1877 | if (profile_record[i].num_mismatched_freq_in[j] != last_freq_in) | |
1878 | fprintf (stderr, "| %+5i", | |
1879 | profile_record[i].num_mismatched_freq_in[j] | |
1880 | - last_freq_in); | |
1881 | else | |
1882 | fprintf (stderr, "| "); | |
1883 | if (profile_record[i].num_mismatched_count_in[j] != last_count_in) | |
1884 | fprintf (stderr, " %+5i", | |
1885 | profile_record[i].num_mismatched_count_in[j] | |
1886 | - last_count_in); | |
1887 | else | |
1888 | fprintf (stderr, " "); | |
1889 | if (profile_record[i].num_mismatched_freq_out[j] != last_freq_out) | |
1890 | fprintf (stderr, "| %+5i", | |
1891 | profile_record[i].num_mismatched_freq_out[j] | |
1892 | - last_freq_out); | |
1893 | else | |
1894 | fprintf (stderr, "| "); | |
1895 | if (profile_record[i].num_mismatched_count_out[j] != last_count_out) | |
1896 | fprintf (stderr, " %+5i", | |
1897 | profile_record[i].num_mismatched_count_out[j] | |
1898 | - last_count_out); | |
1899 | else | |
1900 | fprintf (stderr, " "); | |
1901 | ||
1902 | /* Size/time units change across gimple and RTL. */ | |
f7695dbf | 1903 | if (i == pass_expand_1->static_pass_number) |
37e5402b JH |
1904 | fprintf (stderr, "|----------"); |
1905 | else | |
1906 | { | |
1907 | if (rel_size_change) | |
1908 | fprintf (stderr, "| %+8.4f%%", rel_size_change); | |
1909 | else | |
1910 | fprintf (stderr, "| "); | |
1911 | if (rel_time_change) | |
1912 | fprintf (stderr, " %+8.4f%%", rel_time_change); | |
1913 | } | |
1914 | fprintf (stderr, "\n"); | |
1915 | last_freq_in = profile_record[i].num_mismatched_freq_in[j]; | |
1916 | last_freq_out = profile_record[i].num_mismatched_freq_out[j]; | |
1917 | last_count_in = profile_record[i].num_mismatched_count_in[j]; | |
1918 | last_count_out = profile_record[i].num_mismatched_count_out[j]; | |
1919 | } | |
1920 | else if (j && last_reported != i) | |
1921 | { | |
1922 | last_reported = i; | |
1923 | fprintf (stderr, "%-20s ------------| | |\n", | |
1924 | passes_by_id [i]->name); | |
1925 | } | |
1926 | last_time = profile_record[i].time[j]; | |
1927 | last_size = profile_record[i].size[j]; | |
1928 | } | |
1929 | } | |
1930 | ||
a5093353 | 1931 | /* Perform all TODO actions that ought to be done on each function. */ |
ef330312 | 1932 | |
a5093353 | 1933 | static void |
2cbf2d95 | 1934 | execute_function_todo (function *fn, void *data) |
a5093353 | 1935 | { |
e9ff9caf | 1936 | bool from_ipa_pass = (cfun == NULL); |
a5093353 | 1937 | unsigned int flags = (size_t)data; |
2cbf2d95 | 1938 | flags &= ~fn->last_verified; |
bbbe4e7b PB |
1939 | if (!flags) |
1940 | return; | |
9fe0cb7d | 1941 | |
2cbf2d95 RB |
1942 | push_cfun (fn); |
1943 | ||
1994bfea | 1944 | /* Always cleanup the CFG before trying to update SSA. */ |
ef330312 PB |
1945 | if (flags & TODO_cleanup_cfg) |
1946 | { | |
c0e50f72 | 1947 | cleanup_tree_cfg (); |
b8698a0f | 1948 | |
c4f548b8 DN |
1949 | /* When cleanup_tree_cfg merges consecutive blocks, it may |
1950 | perform some simplistic propagation when removing single | |
1951 | valued PHI nodes. This propagation may, in turn, cause the | |
1952 | SSA form to become out-of-date (see PR 22037). So, even | |
1953 | if the parent pass had not scheduled an SSA update, we may | |
1954 | still need to do one. */ | |
5006671f | 1955 | if (!(flags & TODO_update_ssa_any) && need_ssa_update_p (cfun)) |
c4f548b8 | 1956 | flags |= TODO_update_ssa; |
ef330312 | 1957 | } |
f6db1481 | 1958 | |
563cb6be DN |
1959 | if (flags & TODO_update_ssa_any) |
1960 | { | |
1961 | unsigned update_flags = flags & TODO_update_ssa_any; | |
1962 | update_ssa (update_flags); | |
1963 | } | |
b8698a0f | 1964 | |
edb32daf RG |
1965 | if (flag_tree_pta && (flags & TODO_rebuild_alias)) |
1966 | compute_may_aliases (); | |
1967 | ||
1968 | if (optimize && (flags & TODO_update_address_taken)) | |
f61c8291 | 1969 | execute_update_addresses_taken (); |
b8698a0f | 1970 | |
3f519b35 RG |
1971 | if (flags & TODO_remove_unused_locals) |
1972 | remove_unused_locals (); | |
1973 | ||
45a80bb9 | 1974 | if (flags & TODO_rebuild_frequencies) |
b35366ce | 1975 | rebuild_frequencies (); |
45a80bb9 | 1976 | |
cf9712cc | 1977 | if (flags & TODO_rebuild_cgraph_edges) |
3dafb85c | 1978 | cgraph_edge::rebuild_edges (); |
cf9712cc | 1979 | |
cd6bbb33 | 1980 | gcc_assert (dom_info_state (fn, CDI_POST_DOMINATORS) == DOM_NONE); |
c9d6130e | 1981 | /* If we've seen errors do not bother running any verifiers. */ |
b2b29377 | 1982 | if (flag_checking && !seen_error ()) |
2cbf2d95 | 1983 | { |
e3f613cb RB |
1984 | dom_state pre_verify_state = dom_info_state (fn, CDI_DOMINATORS); |
1985 | dom_state pre_verify_pstate = dom_info_state (fn, CDI_POST_DOMINATORS); | |
1986 | ||
e9ff9caf | 1987 | if (flags & TODO_verify_il) |
9ba5fb43 | 1988 | { |
e9ff9caf RB |
1989 | if (cfun->curr_properties & PROP_trees) |
1990 | { | |
1991 | if (cfun->curr_properties & PROP_cfg) | |
1992 | /* IPA passes leave stmts to be fixed up, so make sure to | |
1993 | not verify stmts really throw. */ | |
1994 | verify_gimple_in_cfg (cfun, !from_ipa_pass); | |
1995 | else | |
1996 | verify_gimple_in_seq (gimple_body (cfun->decl)); | |
1997 | } | |
1998 | if (cfun->curr_properties & PROP_ssa) | |
1999 | /* IPA passes leave stmts to be fixed up, so make sure to | |
2000 | not verify SSA operands whose verifier will choke on that. */ | |
2001 | verify_ssa (true, !from_ipa_pass); | |
7e7f8713 RB |
2002 | /* IPA passes leave basic-blocks unsplit, so make sure to |
2003 | not trip on that. */ | |
2004 | if ((cfun->curr_properties & PROP_cfg) | |
2005 | && !from_ipa_pass) | |
2006 | verify_flow_info (); | |
e3f613cb | 2007 | if (current_loops |
687aed9c RB |
2008 | && ! loops_state_satisfies_p (LOOPS_NEED_FIXUP)) |
2009 | { | |
2010 | verify_loop_structure (); | |
2011 | if (loops_state_satisfies_p (LOOP_CLOSED_SSA)) | |
2012 | verify_loop_closed_ssa (false); | |
2013 | } | |
0db74577 RB |
2014 | if (cfun->curr_properties & PROP_rtl) |
2015 | verify_rtl_sharing (); | |
e3f613cb | 2016 | } |
e3f613cb RB |
2017 | |
2018 | /* Make sure verifiers don't change dominator state. */ | |
2019 | gcc_assert (dom_info_state (fn, CDI_DOMINATORS) == pre_verify_state); | |
2020 | gcc_assert (dom_info_state (fn, CDI_POST_DOMINATORS) == pre_verify_pstate); | |
e3f613cb | 2021 | } |
a5093353 | 2022 | |
2cbf2d95 RB |
2023 | fn->last_verified = flags & TODO_verify_all; |
2024 | ||
2025 | pop_cfun (); | |
e3f613cb RB |
2026 | |
2027 | /* For IPA passes make sure to release dominator info, it can be | |
2028 | computed by non-verifying TODOs. */ | |
e9ff9caf | 2029 | if (from_ipa_pass) |
e3f613cb RB |
2030 | { |
2031 | free_dominance_info (fn, CDI_DOMINATORS); | |
2032 | free_dominance_info (fn, CDI_POST_DOMINATORS); | |
2033 | } | |
a5093353 JH |
2034 | } |
2035 | ||
2036 | /* Perform all TODO actions. */ | |
2037 | static void | |
2038 | execute_todo (unsigned int flags) | |
2039 | { | |
b2b29377 MM |
2040 | if (flag_checking |
2041 | && cfun | |
5006671f | 2042 | && need_ssa_update_p (cfun)) |
a5093353 | 2043 | gcc_assert (flags & TODO_update_ssa_any); |
a5093353 | 2044 | |
0d6a035d JH |
2045 | statistics_fini_pass (); |
2046 | ||
a9335ba2 JJ |
2047 | if (flags) |
2048 | do_per_function (execute_function_todo, (void *)(size_t) flags); | |
a5093353 | 2049 | |
9447d255 JL |
2050 | /* At this point we should not have any unreachable code in the |
2051 | CFG, so it is safe to flush the pending freelist for SSA_NAMES. */ | |
2052 | if (cfun && cfun->gimple_df) | |
2053 | flush_ssaname_freelist (); | |
2054 | ||
f4b3ca72 JH |
2055 | /* Always remove functions just as before inlining: IPA passes might be |
2056 | interested to see bodies of extern inline functions that are not inlined | |
2057 | to analyze side effects. The full removal is done just at the end | |
2058 | of IPA pass queue. */ | |
2059 | if (flags & TODO_remove_functions) | |
a12f79f5 JH |
2060 | { |
2061 | gcc_assert (!cfun); | |
17e0fc92 | 2062 | symtab->remove_unreachable_nodes (dump_file); |
a12f79f5 | 2063 | } |
f4b3ca72 | 2064 | |
8f940ee6 | 2065 | if ((flags & TODO_dump_symtab) && dump_file && !current_function_decl) |
ef330312 | 2066 | { |
a12f79f5 | 2067 | gcc_assert (!cfun); |
6c52831d | 2068 | symtab->dump (dump_file); |
ef330312 PB |
2069 | /* Flush the file. If verification fails, we won't be able to |
2070 | close the file before aborting. */ | |
2071 | fflush (dump_file); | |
2072 | } | |
f6db1481 | 2073 | |
b8698a0f | 2074 | /* Now that the dumping has been done, we can get rid of the optional |
6fb5fa3c DB |
2075 | df problems. */ |
2076 | if (flags & TODO_df_finish) | |
0d475361 | 2077 | df_finish_pass ((flags & TODO_df_verify) != 0); |
a5093353 | 2078 | } |
97b0ade3 | 2079 | |
6ac01510 ILT |
2080 | /* Verify invariants that should hold between passes. This is a place |
2081 | to put simple sanity checks. */ | |
2082 | ||
2083 | static void | |
2084 | verify_interpass_invariants (void) | |
2085 | { | |
77a74ed7 | 2086 | gcc_checking_assert (!fold_deferring_overflow_warnings_p ()); |
6ac01510 ILT |
2087 | } |
2088 | ||
a5093353 JH |
2089 | /* Clear the last verified flag. */ |
2090 | ||
2091 | static void | |
2cbf2d95 | 2092 | clear_last_verified (function *fn, void *data ATTRIBUTE_UNUSED) |
a5093353 | 2093 | { |
2cbf2d95 | 2094 | fn->last_verified = 0; |
a5093353 JH |
2095 | } |
2096 | ||
2097 | /* Helper function. Verify that the properties has been turn into the | |
2098 | properties expected by the pass. */ | |
bbbe4e7b | 2099 | |
6d27d749 | 2100 | static void |
2cbf2d95 | 2101 | verify_curr_properties (function *fn, void *data) |
a5093353 JH |
2102 | { |
2103 | unsigned int props = (size_t)data; | |
2cbf2d95 | 2104 | gcc_assert ((fn->curr_properties & props) == props); |
a5093353 JH |
2105 | } |
2106 | ||
c8189787 ML |
2107 | /* Release dump file name if set. */ |
2108 | ||
2109 | static void | |
2110 | release_dump_file_name (void) | |
2111 | { | |
2112 | if (dump_file_name) | |
2113 | { | |
2114 | free (CONST_CAST (char *, dump_file_name)); | |
2115 | dump_file_name = NULL; | |
2116 | } | |
2117 | } | |
2118 | ||
17653c00 | 2119 | /* Initialize pass dump file. */ |
090fa0ab | 2120 | /* This is non-static so that the plugins can use it. */ |
17653c00 | 2121 | |
090fa0ab | 2122 | bool |
6a5ac314 | 2123 | pass_init_dump_file (opt_pass *pass) |
17653c00 JH |
2124 | { |
2125 | /* If a dump file name is present, open it if enabled. */ | |
2126 | if (pass->static_pass_number != -1) | |
2127 | { | |
41222ddf | 2128 | timevar_push (TV_DUMP); |
47e0da37 DM |
2129 | gcc::dump_manager *dumps = g->get_dumps (); |
2130 | bool initializing_dump = | |
2131 | !dumps->dump_initialized_p (pass->static_pass_number); | |
c8189787 | 2132 | release_dump_file_name (); |
47e0da37 DM |
2133 | dump_file_name = dumps->get_dump_file_name (pass->static_pass_number); |
2134 | dumps->dump_start (pass->static_pass_number, &dump_flags); | |
1ee62b92 | 2135 | if (dump_file && current_function_decl && ! (dump_flags & TDF_GIMPLE)) |
6d8402ac | 2136 | dump_function_header (dump_file, current_function_decl, dump_flags); |
68fbd81b SB |
2137 | if (initializing_dump |
2138 | && dump_file && (dump_flags & TDF_GRAPH) | |
41222ddf | 2139 | && cfun && (cfun->curr_properties & PROP_cfg)) |
9d5879a6 AH |
2140 | { |
2141 | clean_graph_dump_file (dump_file_name); | |
182c7868 TV |
2142 | struct dump_file_info *dfi |
2143 | = dumps->get_dump_file_info (pass->static_pass_number); | |
2144 | dfi->graph_dump_initialized = true; | |
9d5879a6 | 2145 | } |
41222ddf | 2146 | timevar_pop (TV_DUMP); |
17653c00 JH |
2147 | return initializing_dump; |
2148 | } | |
2149 | else | |
2150 | return false; | |
2151 | } | |
2152 | ||
2153 | /* Flush PASS dump file. */ | |
090fa0ab | 2154 | /* This is non-static so that plugins can use it. */ |
17653c00 | 2155 | |
090fa0ab | 2156 | void |
6a5ac314 | 2157 | pass_fini_dump_file (opt_pass *pass) |
17653c00 | 2158 | { |
41222ddf SB |
2159 | timevar_push (TV_DUMP); |
2160 | ||
17653c00 | 2161 | /* Flush and close dump file. */ |
c8189787 | 2162 | release_dump_file_name (); |
17653c00 | 2163 | |
47e0da37 | 2164 | g->get_dumps ()->dump_finish (pass->static_pass_number); |
41222ddf | 2165 | timevar_pop (TV_DUMP); |
17653c00 JH |
2166 | } |
2167 | ||
a5093353 JH |
2168 | /* After executing the pass, apply expected changes to the function |
2169 | properties. */ | |
17653c00 | 2170 | |
a5093353 | 2171 | static void |
2cbf2d95 | 2172 | update_properties_after_pass (function *fn, void *data) |
a5093353 | 2173 | { |
6a5ac314 | 2174 | opt_pass *pass = (opt_pass *) data; |
2cbf2d95 RB |
2175 | fn->curr_properties = (fn->curr_properties | pass->properties_provided) |
2176 | & ~pass->properties_destroyed; | |
f6db1481 RH |
2177 | } |
2178 | ||
1920df6c | 2179 | /* Execute summary generation for all of the passes in IPA_PASS. */ |
17653c00 | 2180 | |
d7f09764 | 2181 | void |
6a5ac314 | 2182 | execute_ipa_summary_passes (ipa_opt_pass_d *ipa_pass) |
17653c00 | 2183 | { |
1920df6c | 2184 | while (ipa_pass) |
17653c00 | 2185 | { |
6a5ac314 | 2186 | opt_pass *pass = ipa_pass; |
1920df6c KZ |
2187 | |
2188 | /* Execute all of the IPA_PASSes in the list. */ | |
f7695dbf | 2189 | if (ipa_pass->type == IPA_PASS |
1a3d085c | 2190 | && pass->gate (cfun) |
d7f09764 | 2191 | && ipa_pass->generate_summary) |
17653c00 JH |
2192 | { |
2193 | pass_init_dump_file (pass); | |
d7f09764 DN |
2194 | |
2195 | /* If a timevar is present, start it. */ | |
2196 | if (pass->tv_id) | |
2197 | timevar_push (pass->tv_id); | |
2198 | ||
3edf64aa | 2199 | current_pass = pass; |
1920df6c | 2200 | ipa_pass->generate_summary (); |
d7f09764 DN |
2201 | |
2202 | /* Stop timevar. */ | |
2203 | if (pass->tv_id) | |
2204 | timevar_pop (pass->tv_id); | |
2205 | ||
17653c00 JH |
2206 | pass_fini_dump_file (pass); |
2207 | } | |
6a5ac314 | 2208 | ipa_pass = (ipa_opt_pass_d *)ipa_pass->next; |
17653c00 JH |
2209 | } |
2210 | } | |
2211 | ||
2212 | /* Execute IPA_PASS function transform on NODE. */ | |
2213 | ||
2214 | static void | |
2215 | execute_one_ipa_transform_pass (struct cgraph_node *node, | |
6a5ac314 | 2216 | ipa_opt_pass_d *ipa_pass) |
17653c00 | 2217 | { |
6a5ac314 | 2218 | opt_pass *pass = ipa_pass; |
17653c00 JH |
2219 | unsigned int todo_after = 0; |
2220 | ||
2221 | current_pass = pass; | |
2222 | if (!ipa_pass->function_transform) | |
2223 | return; | |
2224 | ||
2225 | /* Note that the folders should only create gimple expressions. | |
2226 | This is a hack until the new folder is ready. */ | |
2227 | in_gimple_form = (cfun && (cfun->curr_properties & PROP_trees)) != 0; | |
2228 | ||
2229 | pass_init_dump_file (pass); | |
2230 | ||
17653c00 | 2231 | /* If a timevar is present, start it. */ |
7072a650 | 2232 | if (pass->tv_id != TV_NONE) |
17653c00 JH |
2233 | timevar_push (pass->tv_id); |
2234 | ||
8df06bd0 RB |
2235 | /* Run pre-pass verification. */ |
2236 | execute_todo (ipa_pass->function_transform_todo_flags_start); | |
2237 | ||
17653c00 JH |
2238 | /* Do it! */ |
2239 | todo_after = ipa_pass->function_transform (node); | |
2240 | ||
37e5402b JH |
2241 | if (profile_report && cfun && (cfun->curr_properties & PROP_cfg)) |
2242 | check_profile_consistency (pass->static_pass_number, 0, true); | |
2243 | ||
17653c00 JH |
2244 | /* Run post-pass cleanup and verification. */ |
2245 | execute_todo (todo_after); | |
2246 | verify_interpass_invariants (); | |
37e5402b JH |
2247 | if (profile_report && cfun && (cfun->curr_properties & PROP_cfg)) |
2248 | check_profile_consistency (pass->static_pass_number, 1, true); | |
17653c00 | 2249 | |
8df06bd0 RB |
2250 | /* Stop timevar. */ |
2251 | if (pass->tv_id != TV_NONE) | |
2252 | timevar_pop (pass->tv_id); | |
2253 | ||
a9335ba2 | 2254 | if (dump_file) |
5a15be97 | 2255 | do_per_function (execute_function_dump, pass); |
17653c00 JH |
2256 | pass_fini_dump_file (pass); |
2257 | ||
2258 | current_pass = NULL; | |
b3e46655 | 2259 | redirect_edge_var_map_empty (); |
bb313b93 RB |
2260 | |
2261 | /* Signal this is a suitable GC collection point. */ | |
d3afd9aa RB |
2262 | if (!(todo_after & TODO_do_not_ggc_collect)) |
2263 | ggc_collect (); | |
17653c00 JH |
2264 | } |
2265 | ||
d7f09764 | 2266 | /* For the current function, execute all ipa transforms. */ |
9e016eba | 2267 | |
d7f09764 DN |
2268 | void |
2269 | execute_all_ipa_transforms (void) | |
2270 | { | |
0e3776db JH |
2271 | struct cgraph_node *node; |
2272 | if (!cfun) | |
2273 | return; | |
d52f5295 | 2274 | node = cgraph_node::get (current_function_decl); |
bc58d7e1 | 2275 | |
9771b263 | 2276 | if (node->ipa_transforms_to_apply.exists ()) |
17653c00 JH |
2277 | { |
2278 | unsigned int i; | |
17653c00 | 2279 | |
9771b263 DN |
2280 | for (i = 0; i < node->ipa_transforms_to_apply.length (); i++) |
2281 | execute_one_ipa_transform_pass (node, node->ipa_transforms_to_apply[i]); | |
2282 | node->ipa_transforms_to_apply.release (); | |
17653c00 | 2283 | } |
d7f09764 DN |
2284 | } |
2285 | ||
226c52aa XDL |
2286 | /* Check if PASS is explicitly disabled or enabled and return |
2287 | the gate status. FUNC is the function to be processed, and | |
2288 | GATE_STATUS is the gate status determined by pass manager by | |
2289 | default. */ | |
2290 | ||
2291 | static bool | |
6a5ac314 | 2292 | override_gate_status (opt_pass *pass, tree func, bool gate_status) |
226c52aa XDL |
2293 | { |
2294 | bool explicitly_enabled = false; | |
2295 | bool explicitly_disabled = false; | |
2296 | ||
2297 | explicitly_enabled | |
2298 | = is_pass_explicitly_enabled_or_disabled (pass, func, | |
2299 | enabled_pass_uid_range_tab); | |
2300 | explicitly_disabled | |
2301 | = is_pass_explicitly_enabled_or_disabled (pass, func, | |
2302 | disabled_pass_uid_range_tab); | |
2303 | ||
2304 | gate_status = !explicitly_disabled && (gate_status || explicitly_enabled); | |
2305 | ||
2306 | return gate_status; | |
2307 | } | |
2308 | ||
bad86e8d DM |
2309 | /* Determine if PASS_NAME matches CRITERION. |
2310 | Not a pure predicate, since it can update CRITERION, to support | |
2311 | matching the Nth invocation of a pass. | |
2312 | Subroutine of should_skip_pass_p. */ | |
2313 | ||
2314 | static bool | |
2315 | determine_pass_name_match (const char *pass_name, char *criterion) | |
2316 | { | |
2317 | size_t namelen = strlen (pass_name); | |
2318 | if (! strncmp (pass_name, criterion, namelen)) | |
2319 | { | |
2320 | /* The following supports starting with the Nth invocation | |
2321 | of a pass (where N does not necessarily is equal to the | |
2322 | dump file suffix). */ | |
2323 | if (criterion[namelen] == '\0' | |
2324 | || (criterion[namelen] == '1' | |
2325 | && criterion[namelen + 1] == '\0')) | |
2326 | return true; | |
2327 | else | |
2328 | { | |
2329 | if (criterion[namelen + 1] == '\0') | |
2330 | --criterion[namelen]; | |
2331 | return false; | |
2332 | } | |
2333 | } | |
2334 | else | |
2335 | return false; | |
2336 | } | |
2337 | ||
2338 | /* For skipping passes until "startwith" pass. | |
2339 | Return true iff PASS should be skipped. | |
2340 | Clear cfun->pass_startwith when encountering the "startwith" pass, | |
2341 | so that all subsequent passes are run. */ | |
2342 | ||
2343 | static bool | |
2344 | should_skip_pass_p (opt_pass *pass) | |
2345 | { | |
2346 | if (!cfun) | |
2347 | return false; | |
2348 | if (!cfun->pass_startwith) | |
2349 | return false; | |
2350 | ||
c2e84327 DM |
2351 | /* For __GIMPLE functions, we have to at least start when we leave |
2352 | SSA. Hence, we need to detect the "expand" pass, and stop skipping | |
2353 | when we encounter it. A cheap way to identify "expand" is it to | |
2354 | detect the destruction of PROP_ssa. | |
2355 | For __RTL functions, we invoke "rest_of_compilation" directly, which | |
2356 | is after "expand", and hence we don't reach this conditional. */ | |
2357 | if (pass->properties_destroyed & PROP_ssa) | |
2358 | { | |
2359 | if (!quiet_flag) | |
2360 | fprintf (stderr, "starting anyway when leaving SSA: %s\n", pass->name); | |
2361 | cfun->pass_startwith = NULL; | |
2362 | return false; | |
2363 | } | |
bad86e8d DM |
2364 | |
2365 | if (determine_pass_name_match (pass->name, cfun->pass_startwith)) | |
2366 | { | |
c2e84327 DM |
2367 | if (!quiet_flag) |
2368 | fprintf (stderr, "found starting pass: %s\n", pass->name); | |
bad86e8d DM |
2369 | cfun->pass_startwith = NULL; |
2370 | return false; | |
2371 | } | |
2372 | ||
c2e84327 DM |
2373 | /* For GIMPLE passes, run any property provider (but continue skipping |
2374 | afterwards). | |
2375 | We don't want to force running RTL passes that are property providers: | |
2376 | "expand" is covered above, and the only pass other than "expand" that | |
2377 | provides a property is "into_cfglayout" (PROP_cfglayout), which does | |
2378 | too much for a dumped __RTL function. */ | |
2379 | if (pass->type == GIMPLE_PASS | |
2380 | && pass->properties_provided != 0) | |
bad86e8d DM |
2381 | return false; |
2382 | ||
c2e84327 DM |
2383 | /* Don't skip df init; later RTL passes need it. */ |
2384 | if (strstr (pass->name, "dfinit") != NULL) | |
2385 | return false; | |
2386 | ||
2387 | if (!quiet_flag) | |
2388 | fprintf (stderr, "skipping pass: %s\n", pass->name); | |
2389 | ||
bad86e8d DM |
2390 | /* If we get here, then we have a "startwith" that we haven't seen yet; |
2391 | skip the pass. */ | |
2392 | return true; | |
2393 | } | |
226c52aa | 2394 | |
c2e84327 DM |
2395 | /* Skip the given pass, for handling passes before "startwith" |
2396 | in __GIMPLE and__RTL-marked functions. | |
2397 | In theory, this ought to be a no-op, but some of the RTL passes | |
2398 | need additional processing here. */ | |
2399 | ||
2400 | static void | |
2401 | skip_pass (opt_pass *pass) | |
2402 | { | |
2403 | /* Pass "reload" sets the global "reload_completed", and many | |
2404 | things depend on this (e.g. instructions in .md files). */ | |
2405 | if (strcmp (pass->name, "reload") == 0) | |
2406 | reload_completed = 1; | |
2407 | ||
2408 | /* The INSN_ADDRESSES vec is normally set up by | |
2409 | shorten_branches; set it up for the benefit of passes that | |
2410 | run after this. */ | |
2411 | if (strcmp (pass->name, "shorten") == 0) | |
2412 | INSN_ADDRESSES_ALLOC (get_max_uid ()); | |
2413 | ||
2414 | /* Update the cfg hooks as appropriate. */ | |
2415 | if (strcmp (pass->name, "into_cfglayout") == 0) | |
2416 | { | |
2417 | cfg_layout_rtl_register_cfg_hooks (); | |
2418 | cfun->curr_properties |= PROP_cfglayout; | |
2419 | } | |
2420 | if (strcmp (pass->name, "outof_cfglayout") == 0) | |
2421 | { | |
2422 | rtl_register_cfg_hooks (); | |
2423 | cfun->curr_properties &= ~PROP_cfglayout; | |
2424 | } | |
2425 | } | |
2426 | ||
d7f09764 DN |
2427 | /* Execute PASS. */ |
2428 | ||
090fa0ab | 2429 | bool |
6a5ac314 | 2430 | execute_one_pass (opt_pass *pass) |
d7f09764 | 2431 | { |
d7f09764 DN |
2432 | unsigned int todo_after = 0; |
2433 | ||
090fa0ab GF |
2434 | bool gate_status; |
2435 | ||
d7f09764 DN |
2436 | /* IPA passes are executed on whole program, so cfun should be NULL. |
2437 | Other passes need function context set. */ | |
2438 | if (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS) | |
2439 | gcc_assert (!cfun && !current_function_decl); | |
2440 | else | |
2441 | gcc_assert (cfun && current_function_decl); | |
17653c00 | 2442 | |
6fb5fa3c | 2443 | current_pass = pass; |
726a989a | 2444 | |
090fa0ab GF |
2445 | /* Check whether gate check should be avoided. |
2446 | User controls the value of the gate through the parameter "gate_status". */ | |
1a3d085c | 2447 | gate_status = pass->gate (cfun); |
226c52aa | 2448 | gate_status = override_gate_status (pass, current_function_decl, gate_status); |
090fa0ab GF |
2449 | |
2450 | /* Override gate with plugin. */ | |
2451 | invoke_plugin_callbacks (PLUGIN_OVERRIDE_GATE, &gate_status); | |
2452 | ||
2453 | if (!gate_status) | |
2454 | { | |
37e5402b JH |
2455 | /* Run so passes selectively disabling themselves on a given function |
2456 | are not miscounted. */ | |
2457 | if (profile_report && cfun && (cfun->curr_properties & PROP_cfg)) | |
2458 | { | |
2459 | check_profile_consistency (pass->static_pass_number, 0, false); | |
2460 | check_profile_consistency (pass->static_pass_number, 1, false); | |
2461 | } | |
090fa0ab GF |
2462 | current_pass = NULL; |
2463 | return false; | |
2464 | } | |
2465 | ||
bad86e8d | 2466 | if (should_skip_pass_p (pass)) |
c2e84327 DM |
2467 | { |
2468 | skip_pass (pass); | |
2469 | return true; | |
2470 | } | |
1ee62b92 | 2471 | |
090fa0ab GF |
2472 | /* Pass execution event trigger: useful to identify passes being |
2473 | executed. */ | |
2474 | invoke_plugin_callbacks (PLUGIN_PASS_EXECUTION, pass); | |
f6db1481 | 2475 | |
b9cafe60 | 2476 | if (!quiet_flag && !cfun) |
873aa8f5 JH |
2477 | fprintf (stderr, " <%s>", pass->name ? pass->name : ""); |
2478 | ||
ef330312 PB |
2479 | /* Note that the folders should only create gimple expressions. |
2480 | This is a hack until the new folder is ready. */ | |
a5093353 | 2481 | in_gimple_form = (cfun && (cfun->curr_properties & PROP_trees)) != 0; |
f6db1481 | 2482 | |
41222ddf | 2483 | pass_init_dump_file (pass); |
5006671f | 2484 | |
8df06bd0 RB |
2485 | /* If a timevar is present, start it. */ |
2486 | if (pass->tv_id != TV_NONE) | |
2487 | timevar_push (pass->tv_id); | |
2488 | ||
ef330312 | 2489 | /* Run pre-pass verification. */ |
bbbe4e7b PB |
2490 | execute_todo (pass->todo_flags_start); |
2491 | ||
b2b29377 MM |
2492 | if (flag_checking) |
2493 | do_per_function (verify_curr_properties, | |
2494 | (void *)(size_t)pass->properties_required); | |
f6db1481 | 2495 | |
ef330312 | 2496 | /* Do it! */ |
558d2559 | 2497 | todo_after = pass->execute (cfun); |
d4aff57b ML |
2498 | |
2499 | if (todo_after & TODO_discard_function) | |
2500 | { | |
8df06bd0 RB |
2501 | /* Stop timevar. */ |
2502 | if (pass->tv_id != TV_NONE) | |
2503 | timevar_pop (pass->tv_id); | |
2504 | ||
d4aff57b ML |
2505 | pass_fini_dump_file (pass); |
2506 | ||
2507 | gcc_assert (cfun); | |
2508 | /* As cgraph_node::release_body expects release dominators info, | |
2509 | we have to release it. */ | |
2510 | if (dom_info_available_p (CDI_DOMINATORS)) | |
2511 | free_dominance_info (CDI_DOMINATORS); | |
2512 | ||
2513 | if (dom_info_available_p (CDI_POST_DOMINATORS)) | |
2514 | free_dominance_info (CDI_POST_DOMINATORS); | |
2515 | ||
2516 | tree fn = cfun->decl; | |
2517 | pop_cfun (); | |
2518 | gcc_assert (!cfun); | |
2519 | cgraph_node::get (fn)->release_body (); | |
2520 | ||
2521 | current_pass = NULL; | |
2522 | redirect_edge_var_map_empty (); | |
2523 | ||
2524 | ggc_collect (); | |
2525 | ||
2526 | return true; | |
2527 | } | |
2528 | ||
558d2559 | 2529 | do_per_function (clear_last_verified, NULL); |
f6db1481 | 2530 | |
a5093353 | 2531 | do_per_function (update_properties_after_pass, pass); |
bbbe4e7b | 2532 | |
37e5402b JH |
2533 | if (profile_report && cfun && (cfun->curr_properties & PROP_cfg)) |
2534 | check_profile_consistency (pass->static_pass_number, 0, true); | |
2535 | ||
ef330312 | 2536 | /* Run post-pass cleanup and verification. */ |
9ba5fb43 | 2537 | execute_todo (todo_after | pass->todo_flags_finish | TODO_verify_il); |
37e5402b JH |
2538 | if (profile_report && cfun && (cfun->curr_properties & PROP_cfg)) |
2539 | check_profile_consistency (pass->static_pass_number, 1, true); | |
2540 | ||
6ac01510 | 2541 | verify_interpass_invariants (); |
8df06bd0 RB |
2542 | |
2543 | /* Stop timevar. */ | |
2544 | if (pass->tv_id != TV_NONE) | |
2545 | timevar_pop (pass->tv_id); | |
2546 | ||
5a15be97 TV |
2547 | if (pass->type == IPA_PASS |
2548 | && ((ipa_opt_pass_d *)pass)->function_transform) | |
0e3776db JH |
2549 | { |
2550 | struct cgraph_node *node; | |
5a15be97 TV |
2551 | FOR_EACH_FUNCTION_WITH_GIMPLE_BODY (node) |
2552 | node->ipa_transforms_to_apply.safe_push ((ipa_opt_pass_d *)pass); | |
0e3776db | 2553 | } |
5a15be97 TV |
2554 | else if (dump_file) |
2555 | do_per_function (execute_function_dump, pass); | |
f6db1481 | 2556 | |
f45e0ad1 | 2557 | if (!current_function_decl) |
3dafb85c | 2558 | symtab->process_new_functions (); |
f45e0ad1 | 2559 | |
17653c00 | 2560 | pass_fini_dump_file (pass); |
f6db1481 | 2561 | |
17653c00 | 2562 | if (pass->type != SIMPLE_IPA_PASS && pass->type != IPA_PASS) |
e3b5732b JH |
2563 | gcc_assert (!(cfun->curr_properties & PROP_trees) |
2564 | || pass->type != RTL_PASS); | |
2565 | ||
6fb5fa3c | 2566 | current_pass = NULL; |
b3e46655 | 2567 | redirect_edge_var_map_empty (); |
91851351 | 2568 | |
bb313b93 | 2569 | /* Signal this is a suitable GC collection point. */ |
d3afd9aa RB |
2570 | if (!((todo_after | pass->todo_flags_finish) & TODO_do_not_ggc_collect)) |
2571 | ggc_collect (); | |
bb313b93 | 2572 | |
ef330312 | 2573 | return true; |
f6db1481 RH |
2574 | } |
2575 | ||
2cbf2d95 RB |
2576 | static void |
2577 | execute_pass_list_1 (opt_pass *pass) | |
f6db1481 | 2578 | { |
ef330312 | 2579 | do |
f6db1481 | 2580 | { |
9e016eba JH |
2581 | gcc_assert (pass->type == GIMPLE_PASS |
2582 | || pass->type == RTL_PASS); | |
be373510 ML |
2583 | |
2584 | if (cfun == NULL) | |
2585 | return; | |
ef330312 | 2586 | if (execute_one_pass (pass) && pass->sub) |
1ee62b92 | 2587 | execute_pass_list_1 (pass->sub); |
ef330312 | 2588 | pass = pass->next; |
f6db1481 | 2589 | } |
ef330312 | 2590 | while (pass); |
f6db1481 RH |
2591 | } |
2592 | ||
2cbf2d95 RB |
2593 | void |
2594 | execute_pass_list (function *fn, opt_pass *pass) | |
2595 | { | |
be373510 | 2596 | gcc_assert (fn == cfun); |
2cbf2d95 | 2597 | execute_pass_list_1 (pass); |
be373510 | 2598 | if (cfun && fn->cfg) |
2cbf2d95 RB |
2599 | { |
2600 | free_dominance_info (CDI_DOMINATORS); | |
2601 | free_dominance_info (CDI_POST_DOMINATORS); | |
2602 | } | |
2cbf2d95 RB |
2603 | } |
2604 | ||
38f4f02f BS |
2605 | /* Write out all LTO data. */ |
2606 | static void | |
2607 | write_lto (void) | |
2608 | { | |
2609 | timevar_push (TV_IPA_LTO_GIMPLE_OUT); | |
2610 | lto_output (); | |
2611 | timevar_pop (TV_IPA_LTO_GIMPLE_OUT); | |
2612 | timevar_push (TV_IPA_LTO_DECL_OUT); | |
2613 | produce_asm_for_decls (); | |
2614 | timevar_pop (TV_IPA_LTO_DECL_OUT); | |
2615 | } | |
2616 | ||
ef330312 | 2617 | /* Same as execute_pass_list but assume that subpasses of IPA passes |
d7f09764 DN |
2618 | are local passes. If SET is not NULL, write out summaries of only |
2619 | those node in SET. */ | |
2620 | ||
2621 | static void | |
6a5ac314 | 2622 | ipa_write_summaries_2 (opt_pass *pass, struct lto_out_decl_state *state) |
d7f09764 DN |
2623 | { |
2624 | while (pass) | |
2625 | { | |
6a5ac314 | 2626 | ipa_opt_pass_d *ipa_pass = (ipa_opt_pass_d *)pass; |
d7f09764 DN |
2627 | gcc_assert (!current_function_decl); |
2628 | gcc_assert (!cfun); | |
2629 | gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS); | |
2630 | if (pass->type == IPA_PASS | |
2631 | && ipa_pass->write_summary | |
1a3d085c | 2632 | && pass->gate (cfun)) |
d7f09764 DN |
2633 | { |
2634 | /* If a timevar is present, start it. */ | |
2635 | if (pass->tv_id) | |
2636 | timevar_push (pass->tv_id); | |
2637 | ||
f59292da JH |
2638 | pass_init_dump_file (pass); |
2639 | ||
3edf64aa | 2640 | current_pass = pass; |
f27c1867 | 2641 | ipa_pass->write_summary (); |
d7f09764 | 2642 | |
f59292da JH |
2643 | pass_fini_dump_file (pass); |
2644 | ||
d7f09764 DN |
2645 | /* If a timevar is present, start it. */ |
2646 | if (pass->tv_id) | |
2647 | timevar_pop (pass->tv_id); | |
2648 | } | |
2649 | ||
2650 | if (pass->sub && pass->sub->type != GIMPLE_PASS) | |
f27c1867 | 2651 | ipa_write_summaries_2 (pass->sub, state); |
d7f09764 DN |
2652 | |
2653 | pass = pass->next; | |
2654 | } | |
2655 | } | |
2656 | ||
2657 | /* Helper function of ipa_write_summaries. Creates and destroys the | |
2658 | decl state and calls ipa_write_summaries_2 for all passes that have | |
2659 | summaries. SET is the set of nodes to be written. */ | |
2660 | ||
2661 | static void | |
7b99cca4 | 2662 | ipa_write_summaries_1 (lto_symtab_encoder_t encoder) |
d7f09764 | 2663 | { |
315f8c0e | 2664 | pass_manager *passes = g->get_passes (); |
d7f09764 | 2665 | struct lto_out_decl_state *state = lto_new_out_decl_state (); |
b4661bfe | 2666 | state->symtab_node_encoder = encoder; |
5c4f225f | 2667 | |
db847fa8 | 2668 | lto_output_init_mode_table (); |
d7f09764 DN |
2669 | lto_push_out_decl_state (state); |
2670 | ||
e792884f | 2671 | gcc_assert (!flag_wpa); |
315f8c0e | 2672 | ipa_write_summaries_2 (passes->all_regular_ipa_passes, state); |
38f4f02f BS |
2673 | |
2674 | write_lto (); | |
d7f09764 DN |
2675 | |
2676 | gcc_assert (lto_get_out_decl_state () == state); | |
2677 | lto_pop_out_decl_state (); | |
2678 | lto_delete_out_decl_state (state); | |
2679 | } | |
2680 | ||
2681 | /* Write out summaries for all the nodes in the callgraph. */ | |
2682 | ||
ef330312 | 2683 | void |
837bac8c | 2684 | ipa_write_summaries (void) |
f6db1481 | 2685 | { |
7b99cca4 | 2686 | lto_symtab_encoder_t encoder; |
d7f09764 | 2687 | int i, order_pos; |
2c8326a5 | 2688 | varpool_node *vnode; |
40a7fe1e | 2689 | struct cgraph_node *node; |
7b99cca4 | 2690 | struct cgraph_node **order; |
b8698a0f | 2691 | |
f0d78df9 | 2692 | if ((!flag_generate_lto && !flag_generate_offload) || seen_error ()) |
d7f09764 DN |
2693 | return; |
2694 | ||
837bac8c | 2695 | select_what_to_stream (); |
1f6be682 | 2696 | |
e75f8f79 | 2697 | encoder = lto_symtab_encoder_new (false); |
d7f09764 DN |
2698 | |
2699 | /* Create the callgraph set in the same order used in | |
2700 | cgraph_expand_all_functions. This mostly facilitates debugging, | |
2701 | since it causes the gimple file to be processed in the same order | |
2702 | as the source code. */ | |
3dafb85c | 2703 | order = XCNEWVEC (struct cgraph_node *, symtab->cgraph_count); |
af8bca3c | 2704 | order_pos = ipa_reverse_postorder (order); |
3dafb85c | 2705 | gcc_assert (order_pos == symtab->cgraph_count); |
d7f09764 DN |
2706 | |
2707 | for (i = order_pos - 1; i >= 0; i--) | |
8b220502 MJ |
2708 | { |
2709 | struct cgraph_node *node = order[i]; | |
2710 | ||
d52f5295 | 2711 | if (node->has_gimple_body_p ()) |
8b220502 MJ |
2712 | { |
2713 | /* When streaming out references to statements as part of some IPA | |
2714 | pass summary, the statements need to have uids assigned and the | |
2715 | following does that for all the IPA passes here. Naturally, this | |
2716 | ordering then matches the one IPA-passes get in their stmt_fixup | |
2717 | hooks. */ | |
2718 | ||
67348ccc | 2719 | push_cfun (DECL_STRUCT_FUNCTION (node->decl)); |
8b220502 MJ |
2720 | renumber_gimple_stmt_uids (); |
2721 | pop_cfun (); | |
2722 | } | |
1f6be682 | 2723 | if (node->definition && node->need_lto_streaming) |
67348ccc | 2724 | lto_set_symtab_encoder_in_partition (encoder, node); |
8b220502 | 2725 | } |
d7f09764 | 2726 | |
40a7fe1e | 2727 | FOR_EACH_DEFINED_FUNCTION (node) |
1f6be682 | 2728 | if (node->alias && node->need_lto_streaming) |
67348ccc | 2729 | lto_set_symtab_encoder_in_partition (encoder, node); |
66058468 | 2730 | FOR_EACH_DEFINED_VARIABLE (vnode) |
1f6be682 IV |
2731 | if (vnode->need_lto_streaming) |
2732 | lto_set_symtab_encoder_in_partition (encoder, vnode); | |
2942c502 | 2733 | |
b4661bfe | 2734 | ipa_write_summaries_1 (compute_ltrans_boundary (encoder)); |
d7f09764 DN |
2735 | |
2736 | free (order); | |
d7f09764 DN |
2737 | } |
2738 | ||
e792884f JH |
2739 | /* Same as execute_pass_list but assume that subpasses of IPA passes |
2740 | are local passes. If SET is not NULL, write out optimization summaries of | |
2741 | only those node in SET. */ | |
d7f09764 | 2742 | |
e792884f | 2743 | static void |
6a5ac314 OE |
2744 | ipa_write_optimization_summaries_1 (opt_pass *pass, |
2745 | struct lto_out_decl_state *state) | |
e792884f JH |
2746 | { |
2747 | while (pass) | |
2748 | { | |
6a5ac314 | 2749 | ipa_opt_pass_d *ipa_pass = (ipa_opt_pass_d *)pass; |
e792884f JH |
2750 | gcc_assert (!current_function_decl); |
2751 | gcc_assert (!cfun); | |
2752 | gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS); | |
2753 | if (pass->type == IPA_PASS | |
2754 | && ipa_pass->write_optimization_summary | |
1a3d085c | 2755 | && pass->gate (cfun)) |
e792884f JH |
2756 | { |
2757 | /* If a timevar is present, start it. */ | |
2758 | if (pass->tv_id) | |
2759 | timevar_push (pass->tv_id); | |
2760 | ||
f59292da JH |
2761 | pass_init_dump_file (pass); |
2762 | ||
3edf64aa | 2763 | current_pass = pass; |
f27c1867 | 2764 | ipa_pass->write_optimization_summary (); |
e792884f | 2765 | |
f59292da JH |
2766 | pass_fini_dump_file (pass); |
2767 | ||
e792884f JH |
2768 | /* If a timevar is present, start it. */ |
2769 | if (pass->tv_id) | |
2770 | timevar_pop (pass->tv_id); | |
2771 | } | |
2772 | ||
2773 | if (pass->sub && pass->sub->type != GIMPLE_PASS) | |
f27c1867 | 2774 | ipa_write_optimization_summaries_1 (pass->sub, state); |
e792884f JH |
2775 | |
2776 | pass = pass->next; | |
2777 | } | |
2778 | } | |
2779 | ||
2780 | /* Write all the optimization summaries for the cgraph nodes in SET. If SET is | |
d7f09764 DN |
2781 | NULL, write out all summaries of all nodes. */ |
2782 | ||
2783 | void | |
7b99cca4 | 2784 | ipa_write_optimization_summaries (lto_symtab_encoder_t encoder) |
d7f09764 | 2785 | { |
e792884f | 2786 | struct lto_out_decl_state *state = lto_new_out_decl_state (); |
7b99cca4 | 2787 | lto_symtab_encoder_iterator lsei; |
b4661bfe | 2788 | state->symtab_node_encoder = encoder; |
f3380641 | 2789 | |
db847fa8 | 2790 | lto_output_init_mode_table (); |
e792884f | 2791 | lto_push_out_decl_state (state); |
7b99cca4 JH |
2792 | for (lsei = lsei_start_function_in_partition (encoder); |
2793 | !lsei_end_p (lsei); lsei_next_function_in_partition (&lsei)) | |
f1395d4a | 2794 | { |
7b99cca4 | 2795 | struct cgraph_node *node = lsei_cgraph_node (lsei); |
f1395d4a JH |
2796 | /* When streaming out references to statements as part of some IPA |
2797 | pass summary, the statements need to have uids assigned. | |
2798 | ||
2799 | For functions newly born at WPA stage we need to initialize | |
2800 | the uids here. */ | |
67348ccc DM |
2801 | if (node->definition |
2802 | && gimple_has_body_p (node->decl)) | |
f1395d4a | 2803 | { |
67348ccc | 2804 | push_cfun (DECL_STRUCT_FUNCTION (node->decl)); |
f1395d4a JH |
2805 | renumber_gimple_stmt_uids (); |
2806 | pop_cfun (); | |
2807 | } | |
2808 | } | |
e792884f JH |
2809 | |
2810 | gcc_assert (flag_wpa); | |
315f8c0e DM |
2811 | pass_manager *passes = g->get_passes (); |
2812 | ipa_write_optimization_summaries_1 (passes->all_regular_ipa_passes, state); | |
38f4f02f BS |
2813 | |
2814 | write_lto (); | |
e792884f JH |
2815 | |
2816 | gcc_assert (lto_get_out_decl_state () == state); | |
2817 | lto_pop_out_decl_state (); | |
2818 | lto_delete_out_decl_state (state); | |
d7f09764 DN |
2819 | } |
2820 | ||
2821 | /* Same as execute_pass_list but assume that subpasses of IPA passes | |
2822 | are local passes. */ | |
2823 | ||
2824 | static void | |
6a5ac314 | 2825 | ipa_read_summaries_1 (opt_pass *pass) |
d7f09764 DN |
2826 | { |
2827 | while (pass) | |
f6db1481 | 2828 | { |
6a5ac314 | 2829 | ipa_opt_pass_d *ipa_pass = (ipa_opt_pass_d *) pass; |
d7f09764 | 2830 | |
a5093353 JH |
2831 | gcc_assert (!current_function_decl); |
2832 | gcc_assert (!cfun); | |
17653c00 | 2833 | gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS); |
d7f09764 | 2834 | |
1a3d085c | 2835 | if (pass->gate (cfun)) |
17653c00 | 2836 | { |
d7f09764 | 2837 | if (pass->type == IPA_PASS && ipa_pass->read_summary) |
17653c00 | 2838 | { |
d7f09764 DN |
2839 | /* If a timevar is present, start it. */ |
2840 | if (pass->tv_id) | |
2841 | timevar_push (pass->tv_id); | |
2842 | ||
f59292da JH |
2843 | pass_init_dump_file (pass); |
2844 | ||
3edf64aa | 2845 | current_pass = pass; |
d7f09764 DN |
2846 | ipa_pass->read_summary (); |
2847 | ||
f59292da JH |
2848 | pass_fini_dump_file (pass); |
2849 | ||
d7f09764 DN |
2850 | /* Stop timevar. */ |
2851 | if (pass->tv_id) | |
2852 | timevar_pop (pass->tv_id); | |
17653c00 | 2853 | } |
d7f09764 DN |
2854 | |
2855 | if (pass->sub && pass->sub->type != GIMPLE_PASS) | |
2856 | ipa_read_summaries_1 (pass->sub); | |
17653c00 | 2857 | } |
d7f09764 DN |
2858 | pass = pass->next; |
2859 | } | |
2860 | } | |
2861 | ||
2862 | ||
38f4f02f | 2863 | /* Read all the summaries for all_regular_ipa_passes. */ |
d7f09764 DN |
2864 | |
2865 | void | |
2866 | ipa_read_summaries (void) | |
2867 | { | |
315f8c0e DM |
2868 | pass_manager *passes = g->get_passes (); |
2869 | ipa_read_summaries_1 (passes->all_regular_ipa_passes); | |
d7f09764 DN |
2870 | } |
2871 | ||
e792884f JH |
2872 | /* Same as execute_pass_list but assume that subpasses of IPA passes |
2873 | are local passes. */ | |
2874 | ||
2875 | static void | |
6a5ac314 | 2876 | ipa_read_optimization_summaries_1 (opt_pass *pass) |
e792884f JH |
2877 | { |
2878 | while (pass) | |
2879 | { | |
6a5ac314 | 2880 | ipa_opt_pass_d *ipa_pass = (ipa_opt_pass_d *) pass; |
e792884f JH |
2881 | |
2882 | gcc_assert (!current_function_decl); | |
2883 | gcc_assert (!cfun); | |
2884 | gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS); | |
2885 | ||
1a3d085c | 2886 | if (pass->gate (cfun)) |
e792884f JH |
2887 | { |
2888 | if (pass->type == IPA_PASS && ipa_pass->read_optimization_summary) | |
2889 | { | |
2890 | /* If a timevar is present, start it. */ | |
2891 | if (pass->tv_id) | |
2892 | timevar_push (pass->tv_id); | |
2893 | ||
f59292da JH |
2894 | pass_init_dump_file (pass); |
2895 | ||
3edf64aa | 2896 | current_pass = pass; |
e792884f JH |
2897 | ipa_pass->read_optimization_summary (); |
2898 | ||
f59292da JH |
2899 | pass_fini_dump_file (pass); |
2900 | ||
e792884f JH |
2901 | /* Stop timevar. */ |
2902 | if (pass->tv_id) | |
2903 | timevar_pop (pass->tv_id); | |
2904 | } | |
2905 | ||
2906 | if (pass->sub && pass->sub->type != GIMPLE_PASS) | |
2907 | ipa_read_optimization_summaries_1 (pass->sub); | |
2908 | } | |
2909 | pass = pass->next; | |
2910 | } | |
2911 | } | |
2912 | ||
38f4f02f | 2913 | /* Read all the summaries for all_regular_ipa_passes. */ |
e792884f JH |
2914 | |
2915 | void | |
2916 | ipa_read_optimization_summaries (void) | |
2917 | { | |
315f8c0e DM |
2918 | pass_manager *passes = g->get_passes (); |
2919 | ipa_read_optimization_summaries_1 (passes->all_regular_ipa_passes); | |
e792884f JH |
2920 | } |
2921 | ||
d7f09764 DN |
2922 | /* Same as execute_pass_list but assume that subpasses of IPA passes |
2923 | are local passes. */ | |
2924 | void | |
6a5ac314 | 2925 | execute_ipa_pass_list (opt_pass *pass) |
d7f09764 DN |
2926 | { |
2927 | do | |
2928 | { | |
2929 | gcc_assert (!current_function_decl); | |
2930 | gcc_assert (!cfun); | |
2931 | gcc_assert (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS); | |
ef330312 | 2932 | if (execute_one_pass (pass) && pass->sub) |
9e016eba JH |
2933 | { |
2934 | if (pass->sub->type == GIMPLE_PASS) | |
090fa0ab GF |
2935 | { |
2936 | invoke_plugin_callbacks (PLUGIN_EARLY_GIMPLE_PASSES_START, NULL); | |
2cbf2d95 RB |
2937 | do_per_function_toporder ((void (*)(function *, void *)) |
2938 | execute_pass_list, | |
090fa0ab GF |
2939 | pass->sub); |
2940 | invoke_plugin_callbacks (PLUGIN_EARLY_GIMPLE_PASSES_END, NULL); | |
2941 | } | |
17653c00 JH |
2942 | else if (pass->sub->type == SIMPLE_IPA_PASS |
2943 | || pass->sub->type == IPA_PASS) | |
9e016eba JH |
2944 | execute_ipa_pass_list (pass->sub); |
2945 | else | |
2946 | gcc_unreachable (); | |
2947 | } | |
d7f09764 | 2948 | gcc_assert (!current_function_decl); |
3dafb85c | 2949 | symtab->process_new_functions (); |
ef330312 | 2950 | pass = pass->next; |
f6db1481 | 2951 | } |
ef330312 | 2952 | while (pass); |
97b0ade3 | 2953 | } |
9fe0cb7d | 2954 | |
2c5721d9 MJ |
2955 | /* Execute stmt fixup hooks of all passes in PASS for NODE and STMTS. */ |
2956 | ||
2957 | static void | |
6a5ac314 | 2958 | execute_ipa_stmt_fixups (opt_pass *pass, |
355fe088 | 2959 | struct cgraph_node *node, gimple **stmts) |
2c5721d9 MJ |
2960 | { |
2961 | while (pass) | |
2962 | { | |
2963 | /* Execute all of the IPA_PASSes in the list. */ | |
2964 | if (pass->type == IPA_PASS | |
1a3d085c | 2965 | && pass->gate (cfun)) |
2c5721d9 | 2966 | { |
6a5ac314 | 2967 | ipa_opt_pass_d *ipa_pass = (ipa_opt_pass_d *) pass; |
2c5721d9 MJ |
2968 | |
2969 | if (ipa_pass->stmt_fixup) | |
2970 | { | |
2971 | pass_init_dump_file (pass); | |
2972 | /* If a timevar is present, start it. */ | |
2973 | if (pass->tv_id) | |
2974 | timevar_push (pass->tv_id); | |
2975 | ||
3edf64aa | 2976 | current_pass = pass; |
2c5721d9 MJ |
2977 | ipa_pass->stmt_fixup (node, stmts); |
2978 | ||
2979 | /* Stop timevar. */ | |
2980 | if (pass->tv_id) | |
2981 | timevar_pop (pass->tv_id); | |
2982 | pass_fini_dump_file (pass); | |
2983 | } | |
2984 | if (pass->sub) | |
2985 | execute_ipa_stmt_fixups (pass->sub, node, stmts); | |
2986 | } | |
2987 | pass = pass->next; | |
2988 | } | |
2989 | } | |
2990 | ||
2991 | /* Execute stmt fixup hooks of all IPA passes for NODE and STMTS. */ | |
2992 | ||
2993 | void | |
355fe088 | 2994 | execute_all_ipa_stmt_fixups (struct cgraph_node *node, gimple **stmts) |
2c5721d9 | 2995 | { |
315f8c0e DM |
2996 | pass_manager *passes = g->get_passes (); |
2997 | execute_ipa_stmt_fixups (passes->all_regular_ipa_passes, node, stmts); | |
2c5721d9 MJ |
2998 | } |
2999 | ||
3000 | ||
d7f09764 DN |
3001 | extern void debug_properties (unsigned int); |
3002 | extern void dump_properties (FILE *, unsigned int); | |
3003 | ||
24e47c76 | 3004 | DEBUG_FUNCTION void |
d7f09764 DN |
3005 | dump_properties (FILE *dump, unsigned int props) |
3006 | { | |
3007 | fprintf (dump, "Properties:\n"); | |
3008 | if (props & PROP_gimple_any) | |
3009 | fprintf (dump, "PROP_gimple_any\n"); | |
3010 | if (props & PROP_gimple_lcf) | |
3011 | fprintf (dump, "PROP_gimple_lcf\n"); | |
3012 | if (props & PROP_gimple_leh) | |
3013 | fprintf (dump, "PROP_gimple_leh\n"); | |
3014 | if (props & PROP_cfg) | |
3015 | fprintf (dump, "PROP_cfg\n"); | |
d7f09764 DN |
3016 | if (props & PROP_ssa) |
3017 | fprintf (dump, "PROP_ssa\n"); | |
3018 | if (props & PROP_no_crit_edges) | |
3019 | fprintf (dump, "PROP_no_crit_edges\n"); | |
3020 | if (props & PROP_rtl) | |
3021 | fprintf (dump, "PROP_rtl\n"); | |
3022 | if (props & PROP_gimple_lomp) | |
3023 | fprintf (dump, "PROP_gimple_lomp\n"); | |
4cea8675 AM |
3024 | if (props & PROP_gimple_lomp_dev) |
3025 | fprintf (dump, "PROP_gimple_lomp_dev\n"); | |
688a482d RG |
3026 | if (props & PROP_gimple_lcx) |
3027 | fprintf (dump, "PROP_gimple_lcx\n"); | |
6f37411d MG |
3028 | if (props & PROP_gimple_lvec) |
3029 | fprintf (dump, "PROP_gimple_lvec\n"); | |
24e47c76 JH |
3030 | if (props & PROP_cfglayout) |
3031 | fprintf (dump, "PROP_cfglayout\n"); | |
d7f09764 DN |
3032 | } |
3033 | ||
24e47c76 | 3034 | DEBUG_FUNCTION void |
d7f09764 DN |
3035 | debug_properties (unsigned int props) |
3036 | { | |
3037 | dump_properties (stderr, props); | |
3038 | } | |
3039 | ||
33977f81 JH |
3040 | /* Called by local passes to see if function is called by already processed nodes. |
3041 | Because we process nodes in topological order, this means that function is | |
3042 | in recursive cycle or we introduced new direct calls. */ | |
3043 | bool | |
3044 | function_called_by_processed_nodes_p (void) | |
3045 | { | |
3046 | struct cgraph_edge *e; | |
d52f5295 | 3047 | for (e = cgraph_node::get (current_function_decl)->callers; |
581985d7 MJ |
3048 | e; |
3049 | e = e->next_caller) | |
33977f81 | 3050 | { |
67348ccc | 3051 | if (e->caller->decl == current_function_decl) |
33977f81 | 3052 | continue; |
d52f5295 | 3053 | if (!e->caller->has_gimple_body_p ()) |
33977f81 | 3054 | continue; |
67348ccc | 3055 | if (TREE_ASM_WRITTEN (e->caller->decl)) |
33977f81 JH |
3056 | continue; |
3057 | if (!e->caller->process && !e->caller->global.inlined_to) | |
3058 | break; | |
3059 | } | |
3060 | if (dump_file && e) | |
3061 | { | |
3062 | fprintf (dump_file, "Already processed call to:\n"); | |
d52f5295 | 3063 | e->caller->dump (dump_file); |
33977f81 JH |
3064 | } |
3065 | return e != NULL; | |
3066 | } | |
3067 | ||
873aa8f5 | 3068 | #include "gt-passes.h" |