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