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