]>
Commit | Line | Data |
---|---|---|
6de9cd9a | 1 | /* Miscellaneous SSA utility functions. |
d1e082c2 | 2 | Copyright (C) 2001-2013 Free Software Foundation, Inc. |
6de9cd9a DN |
3 | |
4 | This file is part of GCC. | |
5 | ||
6 | GCC is free software; you can redistribute it and/or modify | |
7 | it under the terms of the GNU General Public License as published by | |
9dcd6f09 | 8 | the Free Software Foundation; either version 3, or (at your option) |
6de9cd9a DN |
9 | any later version. |
10 | ||
11 | GCC is distributed in the hope that it will be useful, | |
12 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | GNU General Public License for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
9dcd6f09 NC |
17 | along with GCC; see the file COPYING3. If not see |
18 | <http://www.gnu.org/licenses/>. */ | |
6de9cd9a DN |
19 | |
20 | #include "config.h" | |
21 | #include "system.h" | |
22 | #include "coretypes.h" | |
23 | #include "tm.h" | |
24 | #include "tree.h" | |
25 | #include "flags.h" | |
6de9cd9a | 26 | #include "tm_p.h" |
e52201b6 | 27 | #include "target.h" |
6de9cd9a DN |
28 | #include "ggc.h" |
29 | #include "langhooks.h" | |
6de9cd9a | 30 | #include "basic-block.h" |
6de9cd9a | 31 | #include "function.h" |
cf835838 | 32 | #include "gimple-pretty-print.h" |
6de9cd9a | 33 | #include "bitmap.h" |
d0ce8e4c | 34 | #include "pointer-set.h" |
6de9cd9a | 35 | #include "tree-flow.h" |
726a989a | 36 | #include "gimple.h" |
6de9cd9a | 37 | #include "tree-inline.h" |
6de9cd9a | 38 | #include "hashtab.h" |
6de9cd9a | 39 | #include "tree-pass.h" |
718f9c0f | 40 | #include "diagnostic-core.h" |
94e3faf6 | 41 | #include "cfgloop.h" |
6de9cd9a | 42 | |
ea7e6d5a AH |
43 | /* Pointer map of variable mappings, keyed by edge. */ |
44 | static struct pointer_map_t *edge_var_maps; | |
45 | ||
46 | ||
47 | /* Add a mapping with PHI RESULT and PHI DEF associated with edge E. */ | |
48 | ||
49 | void | |
9e227d60 | 50 | redirect_edge_var_map_add (edge e, tree result, tree def, source_location locus) |
ea7e6d5a AH |
51 | { |
52 | void **slot; | |
9771b263 | 53 | edge_var_map_vector *head; |
ea7e6d5a AH |
54 | edge_var_map new_node; |
55 | ||
56 | if (edge_var_maps == NULL) | |
57 | edge_var_maps = pointer_map_create (); | |
58 | ||
59 | slot = pointer_map_insert (edge_var_maps, e); | |
9771b263 | 60 | head = (edge_var_map_vector *) *slot; |
ea7e6d5a | 61 | if (!head) |
6fa5e0ed | 62 | vec_safe_reserve (head, 5); |
ea7e6d5a AH |
63 | new_node.def = def; |
64 | new_node.result = result; | |
f5045c96 | 65 | new_node.locus = locus; |
ea7e6d5a | 66 | |
6fa5e0ed JJ |
67 | vec_safe_push (head, new_node); |
68 | *slot = head; | |
ea7e6d5a AH |
69 | } |
70 | ||
71 | ||
72 | /* Clear the var mappings in edge E. */ | |
73 | ||
74 | void | |
75 | redirect_edge_var_map_clear (edge e) | |
76 | { | |
77 | void **slot; | |
9771b263 | 78 | edge_var_map_vector *head; |
ea7e6d5a AH |
79 | |
80 | if (!edge_var_maps) | |
81 | return; | |
82 | ||
83 | slot = pointer_map_contains (edge_var_maps, e); | |
84 | ||
85 | if (slot) | |
86 | { | |
9771b263 | 87 | head = (edge_var_map_vector *) *slot; |
6fa5e0ed | 88 | vec_free (head); |
ea7e6d5a AH |
89 | *slot = NULL; |
90 | } | |
91 | } | |
92 | ||
93 | ||
94 | /* Duplicate the redirected var mappings in OLDE in NEWE. | |
95 | ||
96 | Since we can't remove a mapping, let's just duplicate it. This assumes a | |
97 | pointer_map can have multiple edges mapping to the same var_map (many to | |
98 | one mapping), since we don't remove the previous mappings. */ | |
99 | ||
100 | void | |
101 | redirect_edge_var_map_dup (edge newe, edge olde) | |
102 | { | |
a97a7ae9 | 103 | void **new_slot, **old_slot; |
9771b263 | 104 | edge_var_map_vector *head; |
ea7e6d5a AH |
105 | |
106 | if (!edge_var_maps) | |
107 | return; | |
108 | ||
109 | new_slot = pointer_map_insert (edge_var_maps, newe); | |
110 | old_slot = pointer_map_contains (edge_var_maps, olde); | |
111 | if (!old_slot) | |
112 | return; | |
9771b263 | 113 | head = (edge_var_map_vector *) *old_slot; |
ea7e6d5a | 114 | |
6fa5e0ed | 115 | edge_var_map_vector *new_head = NULL; |
ea7e6d5a | 116 | if (head) |
6fa5e0ed | 117 | new_head = vec_safe_copy (head); |
ea7e6d5a | 118 | else |
6fa5e0ed | 119 | vec_safe_reserve (new_head, 5); |
9771b263 | 120 | *new_slot = new_head; |
ea7e6d5a AH |
121 | } |
122 | ||
123 | ||
fa10beec | 124 | /* Return the variable mappings for a given edge. If there is none, return |
ea7e6d5a AH |
125 | NULL. */ |
126 | ||
9771b263 | 127 | edge_var_map_vector * |
ea7e6d5a AH |
128 | redirect_edge_var_map_vector (edge e) |
129 | { | |
130 | void **slot; | |
131 | ||
132 | /* Hey, what kind of idiot would... you'd be surprised. */ | |
133 | if (!edge_var_maps) | |
134 | return NULL; | |
135 | ||
136 | slot = pointer_map_contains (edge_var_maps, e); | |
137 | if (!slot) | |
138 | return NULL; | |
139 | ||
9771b263 | 140 | return (edge_var_map_vector *) *slot; |
ea7e6d5a AH |
141 | } |
142 | ||
a97a7ae9 JH |
143 | /* Used by redirect_edge_var_map_destroy to free all memory. */ |
144 | ||
145 | static bool | |
146 | free_var_map_entry (const void *key ATTRIBUTE_UNUSED, | |
147 | void **value, | |
148 | void *data ATTRIBUTE_UNUSED) | |
149 | { | |
9771b263 | 150 | edge_var_map_vector *head = (edge_var_map_vector *) *value; |
6fa5e0ed | 151 | vec_free (head); |
a97a7ae9 JH |
152 | return true; |
153 | } | |
ea7e6d5a AH |
154 | |
155 | /* Clear the edge variable mappings. */ | |
156 | ||
157 | void | |
158 | redirect_edge_var_map_destroy (void) | |
159 | { | |
160 | if (edge_var_maps) | |
161 | { | |
a97a7ae9 | 162 | pointer_map_traverse (edge_var_maps, free_var_map_entry, NULL); |
ea7e6d5a AH |
163 | pointer_map_destroy (edge_var_maps); |
164 | edge_var_maps = NULL; | |
165 | } | |
166 | } | |
167 | ||
168 | ||
f6144c34 BE |
169 | /* Remove the corresponding arguments from the PHI nodes in E's |
170 | destination block and redirect it to DEST. Return redirected edge. | |
ea7e6d5a AH |
171 | The list of removed arguments is stored in a vector accessed |
172 | through edge_var_maps. */ | |
6de9cd9a DN |
173 | |
174 | edge | |
175 | ssa_redirect_edge (edge e, basic_block dest) | |
176 | { | |
726a989a RB |
177 | gimple_stmt_iterator gsi; |
178 | gimple phi; | |
ea7e6d5a AH |
179 | |
180 | redirect_edge_var_map_clear (e); | |
6de9cd9a DN |
181 | |
182 | /* Remove the appropriate PHI arguments in E's destination block. */ | |
726a989a | 183 | for (gsi = gsi_start_phis (e->dest); !gsi_end_p (gsi); gsi_next (&gsi)) |
6de9cd9a | 184 | { |
726a989a | 185 | tree def; |
f5045c96 | 186 | source_location locus ; |
726a989a RB |
187 | |
188 | phi = gsi_stmt (gsi); | |
189 | def = gimple_phi_arg_def (phi, e->dest_idx); | |
f5045c96 | 190 | locus = gimple_phi_arg_location (phi, e->dest_idx); |
ea7e6d5a AH |
191 | |
192 | if (def == NULL_TREE) | |
6de9cd9a DN |
193 | continue; |
194 | ||
9e227d60 | 195 | redirect_edge_var_map_add (e, gimple_phi_result (phi), def, locus); |
6de9cd9a DN |
196 | } |
197 | ||
198 | e = redirect_edge_succ_nodup (e, dest); | |
6de9cd9a DN |
199 | |
200 | return e; | |
201 | } | |
202 | ||
726a989a | 203 | |
38635499 | 204 | /* Add PHI arguments queued in PENDING_STMT list on edge E to edge |
71882046 KH |
205 | E->dest. */ |
206 | ||
207 | void | |
208 | flush_pending_stmts (edge e) | |
209 | { | |
726a989a | 210 | gimple phi; |
9771b263 | 211 | edge_var_map_vector *v; |
ea7e6d5a AH |
212 | edge_var_map *vm; |
213 | int i; | |
726a989a | 214 | gimple_stmt_iterator gsi; |
71882046 | 215 | |
ea7e6d5a AH |
216 | v = redirect_edge_var_map_vector (e); |
217 | if (!v) | |
71882046 KH |
218 | return; |
219 | ||
726a989a | 220 | for (gsi = gsi_start_phis (e->dest), i = 0; |
9771b263 | 221 | !gsi_end_p (gsi) && v->iterate (i, &vm); |
726a989a | 222 | gsi_next (&gsi), i++) |
71882046 | 223 | { |
726a989a RB |
224 | tree def; |
225 | ||
226 | phi = gsi_stmt (gsi); | |
227 | def = redirect_edge_var_map_def (vm); | |
9e227d60 | 228 | add_phi_arg (phi, def, e, redirect_edge_var_map_location (vm)); |
71882046 KH |
229 | } |
230 | ||
ea7e6d5a | 231 | redirect_edge_var_map_clear (e); |
71882046 | 232 | } |
6de9cd9a | 233 | |
b5b8b0ac AO |
234 | /* Given a tree for an expression for which we might want to emit |
235 | locations or values in debug information (generally a variable, but | |
236 | we might deal with other kinds of trees in the future), return the | |
237 | tree that should be used as the variable of a DEBUG_BIND STMT or | |
238 | VAR_LOCATION INSN or NOTE. Return NULL if VAR is not to be tracked. */ | |
239 | ||
240 | tree | |
241 | target_for_debug_bind (tree var) | |
242 | { | |
243 | if (!MAY_HAVE_DEBUG_STMTS) | |
244 | return NULL_TREE; | |
245 | ||
70b5e7dc RG |
246 | if (TREE_CODE (var) == SSA_NAME) |
247 | { | |
248 | var = SSA_NAME_VAR (var); | |
249 | if (var == NULL_TREE) | |
250 | return NULL_TREE; | |
251 | } | |
252 | ||
46eb666a RG |
253 | if ((TREE_CODE (var) != VAR_DECL |
254 | || VAR_DECL_IS_VIRTUAL_OPERAND (var)) | |
b5b8b0ac AO |
255 | && TREE_CODE (var) != PARM_DECL) |
256 | return NULL_TREE; | |
257 | ||
258 | if (DECL_HAS_VALUE_EXPR_P (var)) | |
259 | return target_for_debug_bind (DECL_VALUE_EXPR (var)); | |
260 | ||
261 | if (DECL_IGNORED_P (var)) | |
262 | return NULL_TREE; | |
263 | ||
46eb666a RG |
264 | /* var-tracking only tracks registers. */ |
265 | if (!is_gimple_reg_type (TREE_TYPE (var))) | |
266 | return NULL_TREE; | |
b5b8b0ac AO |
267 | |
268 | return var; | |
269 | } | |
270 | ||
271 | /* Called via walk_tree, look for SSA_NAMEs that have already been | |
272 | released. */ | |
273 | ||
274 | static tree | |
275 | find_released_ssa_name (tree *tp, int *walk_subtrees, void *data_) | |
276 | { | |
277 | struct walk_stmt_info *wi = (struct walk_stmt_info *) data_; | |
278 | ||
42a06e46 | 279 | if (wi && wi->is_lhs) |
b5b8b0ac AO |
280 | return NULL_TREE; |
281 | ||
282 | if (TREE_CODE (*tp) == SSA_NAME) | |
283 | { | |
284 | if (SSA_NAME_IN_FREE_LIST (*tp)) | |
285 | return *tp; | |
286 | ||
287 | *walk_subtrees = 0; | |
288 | } | |
289 | else if (IS_TYPE_OR_DECL_P (*tp)) | |
290 | *walk_subtrees = 0; | |
291 | ||
292 | return NULL_TREE; | |
293 | } | |
294 | ||
0ca5af51 AO |
295 | /* Insert a DEBUG BIND stmt before the DEF of VAR if VAR is referenced |
296 | by other DEBUG stmts, and replace uses of the DEF with the | |
297 | newly-created debug temp. */ | |
298 | ||
b5b8b0ac | 299 | void |
0ca5af51 | 300 | insert_debug_temp_for_var_def (gimple_stmt_iterator *gsi, tree var) |
b5b8b0ac AO |
301 | { |
302 | imm_use_iterator imm_iter; | |
b5b8b0ac | 303 | use_operand_p use_p; |
0ca5af51 AO |
304 | gimple stmt; |
305 | gimple def_stmt = NULL; | |
306 | int usecount = 0; | |
b5b8b0ac | 307 | tree value = NULL; |
b5b8b0ac AO |
308 | |
309 | if (!MAY_HAVE_DEBUG_STMTS) | |
310 | return; | |
311 | ||
74e12783 RH |
312 | /* If this name has already been registered for replacement, do nothing |
313 | as anything that uses this name isn't in SSA form. */ | |
314 | if (name_registered_for_update_p (var)) | |
315 | return; | |
316 | ||
317 | /* Check whether there are debug stmts that reference this variable and, | |
318 | if there are, decide whether we should use a debug temp. */ | |
0ca5af51 | 319 | FOR_EACH_IMM_USE_FAST (use_p, imm_iter, var) |
b5b8b0ac | 320 | { |
0ca5af51 | 321 | stmt = USE_STMT (use_p); |
b5b8b0ac | 322 | |
0ca5af51 | 323 | if (!gimple_debug_bind_p (stmt)) |
b5b8b0ac AO |
324 | continue; |
325 | ||
0ca5af51 AO |
326 | if (usecount++) |
327 | break; | |
328 | ||
329 | if (gimple_debug_bind_get_value (stmt) != var) | |
b5b8b0ac | 330 | { |
0ca5af51 AO |
331 | /* Count this as an additional use, so as to make sure we |
332 | use a temp unless VAR's definition has a SINGLE_RHS that | |
333 | can be shared. */ | |
334 | usecount++; | |
335 | break; | |
336 | } | |
337 | } | |
b5b8b0ac | 338 | |
0ca5af51 AO |
339 | if (!usecount) |
340 | return; | |
b5b8b0ac | 341 | |
0ca5af51 AO |
342 | if (gsi) |
343 | def_stmt = gsi_stmt (*gsi); | |
344 | else | |
345 | def_stmt = SSA_NAME_DEF_STMT (var); | |
b5b8b0ac | 346 | |
0ca5af51 AO |
347 | /* If we didn't get an insertion point, and the stmt has already |
348 | been removed, we won't be able to insert the debug bind stmt, so | |
349 | we'll have to drop debug information. */ | |
42a06e46 AO |
350 | if (gimple_code (def_stmt) == GIMPLE_PHI) |
351 | { | |
352 | value = degenerate_phi_result (def_stmt); | |
353 | if (value && walk_tree (&value, find_released_ssa_name, NULL, NULL)) | |
354 | value = NULL; | |
0c5f6539 JJ |
355 | /* error_mark_node is what fixup_noreturn_call changes PHI arguments |
356 | to. */ | |
357 | else if (value == error_mark_node) | |
358 | value = NULL; | |
42a06e46 AO |
359 | } |
360 | else if (is_gimple_assign (def_stmt)) | |
0ca5af51 AO |
361 | { |
362 | bool no_value = false; | |
b5b8b0ac | 363 | |
0ca5af51 AO |
364 | if (!dom_info_available_p (CDI_DOMINATORS)) |
365 | { | |
366 | struct walk_stmt_info wi; | |
367 | ||
368 | memset (&wi, 0, sizeof (wi)); | |
369 | ||
370 | /* When removing blocks without following reverse dominance | |
371 | order, we may sometimes encounter SSA_NAMEs that have | |
372 | already been released, referenced in other SSA_DEFs that | |
373 | we're about to release. Consider: | |
374 | ||
375 | <bb X>: | |
376 | v_1 = foo; | |
377 | ||
378 | <bb Y>: | |
379 | w_2 = v_1 + bar; | |
380 | # DEBUG w => w_2 | |
381 | ||
382 | If we deleted BB X first, propagating the value of w_2 | |
383 | won't do us any good. It's too late to recover their | |
384 | original definition of v_1: when it was deleted, it was | |
385 | only referenced in other DEFs, it couldn't possibly know | |
386 | it should have been retained, and propagating every | |
387 | single DEF just in case it might have to be propagated | |
388 | into a DEBUG STMT would probably be too wasteful. | |
389 | ||
390 | When dominator information is not readily available, we | |
391 | check for and accept some loss of debug information. But | |
392 | if it is available, there's no excuse for us to remove | |
393 | blocks in the wrong order, so we don't even check for | |
394 | dead SSA NAMEs. SSA verification shall catch any | |
395 | errors. */ | |
396 | if ((!gsi && !gimple_bb (def_stmt)) | |
462b701b | 397 | || walk_gimple_op (def_stmt, find_released_ssa_name, &wi)) |
0ca5af51 | 398 | no_value = true; |
b5b8b0ac AO |
399 | } |
400 | ||
0ca5af51 AO |
401 | if (!no_value) |
402 | value = gimple_assign_rhs_to_tree (def_stmt); | |
403 | } | |
404 | ||
405 | if (value) | |
406 | { | |
407 | /* If there's a single use of VAR, and VAR is the entire debug | |
408 | expression (usecount would have been incremented again | |
409 | otherwise), and the definition involves only constants and | |
410 | SSA names, then we can propagate VALUE into this single use, | |
411 | avoiding the temp. | |
412 | ||
413 | We can also avoid using a temp if VALUE can be shared and | |
414 | propagated into all uses, without generating expressions that | |
415 | wouldn't be valid gimple RHSs. | |
416 | ||
417 | Other cases that would require unsharing or non-gimple RHSs | |
418 | are deferred to a debug temp, although we could avoid temps | |
419 | at the expense of duplication of expressions. */ | |
420 | ||
421 | if (CONSTANT_CLASS_P (value) | |
42a06e46 | 422 | || gimple_code (def_stmt) == GIMPLE_PHI |
0ca5af51 AO |
423 | || (usecount == 1 |
424 | && (!gimple_assign_single_p (def_stmt) | |
425 | || is_gimple_min_invariant (value))) | |
426 | || is_gimple_reg (value)) | |
2724573f | 427 | ; |
0ca5af51 | 428 | else |
b5b8b0ac | 429 | { |
0ca5af51 AO |
430 | gimple def_temp; |
431 | tree vexpr = make_node (DEBUG_EXPR_DECL); | |
432 | ||
433 | def_temp = gimple_build_debug_bind (vexpr, | |
434 | unshare_expr (value), | |
435 | def_stmt); | |
436 | ||
437 | DECL_ARTIFICIAL (vexpr) = 1; | |
438 | TREE_TYPE (vexpr) = TREE_TYPE (value); | |
439 | if (DECL_P (value)) | |
440 | DECL_MODE (vexpr) = DECL_MODE (value); | |
441 | else | |
442 | DECL_MODE (vexpr) = TYPE_MODE (TREE_TYPE (value)); | |
b5b8b0ac | 443 | |
0ca5af51 AO |
444 | if (gsi) |
445 | gsi_insert_before (gsi, def_temp, GSI_SAME_STMT); | |
446 | else | |
b5b8b0ac | 447 | { |
0ca5af51 AO |
448 | gimple_stmt_iterator ngsi = gsi_for_stmt (def_stmt); |
449 | gsi_insert_before (&ngsi, def_temp, GSI_SAME_STMT); | |
b5b8b0ac AO |
450 | } |
451 | ||
0ca5af51 | 452 | value = vexpr; |
b5b8b0ac | 453 | } |
0ca5af51 | 454 | } |
b5b8b0ac | 455 | |
0ca5af51 AO |
456 | FOR_EACH_IMM_USE_STMT (stmt, imm_iter, var) |
457 | { | |
458 | if (!gimple_debug_bind_p (stmt)) | |
459 | continue; | |
460 | ||
461 | if (value) | |
1bce4ff3 RG |
462 | { |
463 | FOR_EACH_IMM_USE_ON_STMT (use_p, imm_iter) | |
464 | /* unshare_expr is not needed here. vexpr is either a | |
465 | SINGLE_RHS, that can be safely shared, some other RHS | |
466 | that was unshared when we found it had a single debug | |
467 | use, or a DEBUG_EXPR_DECL, that can be safely | |
468 | shared. */ | |
2724573f | 469 | SET_USE (use_p, unshare_expr (value)); |
1bce4ff3 RG |
470 | /* If we didn't replace uses with a debug decl fold the |
471 | resulting expression. Otherwise we end up with invalid IL. */ | |
472 | if (TREE_CODE (value) != DEBUG_EXPR_DECL) | |
59401b92 RG |
473 | { |
474 | gimple_stmt_iterator gsi = gsi_for_stmt (stmt); | |
475 | fold_stmt_inplace (&gsi); | |
476 | } | |
1bce4ff3 | 477 | } |
0ca5af51 AO |
478 | else |
479 | gimple_debug_bind_reset_value (stmt); | |
b5b8b0ac AO |
480 | |
481 | update_stmt (stmt); | |
482 | } | |
483 | } | |
484 | ||
485 | ||
0ca5af51 AO |
486 | /* Insert a DEBUG BIND stmt before STMT for each DEF referenced by |
487 | other DEBUG stmts, and replace uses of the DEF with the | |
488 | newly-created debug temp. */ | |
b5b8b0ac AO |
489 | |
490 | void | |
0ca5af51 | 491 | insert_debug_temps_for_defs (gimple_stmt_iterator *gsi) |
b5b8b0ac | 492 | { |
0ca5af51 | 493 | gimple stmt; |
b5b8b0ac AO |
494 | ssa_op_iter op_iter; |
495 | def_operand_p def_p; | |
496 | ||
497 | if (!MAY_HAVE_DEBUG_STMTS) | |
498 | return; | |
499 | ||
0ca5af51 AO |
500 | stmt = gsi_stmt (*gsi); |
501 | ||
42a06e46 | 502 | FOR_EACH_PHI_OR_STMT_DEF (def_p, stmt, op_iter, SSA_OP_DEF) |
b5b8b0ac AO |
503 | { |
504 | tree var = DEF_FROM_PTR (def_p); | |
505 | ||
506 | if (TREE_CODE (var) != SSA_NAME) | |
507 | continue; | |
508 | ||
0ca5af51 | 509 | insert_debug_temp_for_var_def (gsi, var); |
b5b8b0ac AO |
510 | } |
511 | } | |
512 | ||
b03c3082 JJ |
513 | /* Reset all debug stmts that use SSA_NAME(s) defined in STMT. */ |
514 | ||
515 | void | |
516 | reset_debug_uses (gimple stmt) | |
517 | { | |
518 | ssa_op_iter op_iter; | |
519 | def_operand_p def_p; | |
520 | imm_use_iterator imm_iter; | |
521 | gimple use_stmt; | |
522 | ||
523 | if (!MAY_HAVE_DEBUG_STMTS) | |
524 | return; | |
525 | ||
526 | FOR_EACH_PHI_OR_STMT_DEF (def_p, stmt, op_iter, SSA_OP_DEF) | |
527 | { | |
528 | tree var = DEF_FROM_PTR (def_p); | |
529 | ||
530 | if (TREE_CODE (var) != SSA_NAME) | |
531 | continue; | |
532 | ||
533 | FOR_EACH_IMM_USE_STMT (use_stmt, imm_iter, var) | |
534 | { | |
535 | if (!gimple_debug_bind_p (use_stmt)) | |
536 | continue; | |
537 | ||
538 | gimple_debug_bind_reset_value (use_stmt); | |
539 | update_stmt (use_stmt); | |
540 | } | |
541 | } | |
542 | } | |
543 | ||
ae0a4449 AO |
544 | /* Delete SSA DEFs for SSA versions in the TOREMOVE bitmap, removing |
545 | dominated stmts before their dominators, so that release_ssa_defs | |
546 | stands a chance of propagating DEFs into debug bind stmts. */ | |
547 | ||
548 | void | |
549 | release_defs_bitset (bitmap toremove) | |
550 | { | |
551 | unsigned j; | |
552 | bitmap_iterator bi; | |
553 | ||
554 | /* Performing a topological sort is probably overkill, this will | |
555 | most likely run in slightly superlinear time, rather than the | |
556 | pathological quadratic worst case. */ | |
557 | while (!bitmap_empty_p (toremove)) | |
558 | EXECUTE_IF_SET_IN_BITMAP (toremove, 0, j, bi) | |
559 | { | |
560 | bool remove_now = true; | |
561 | tree var = ssa_name (j); | |
562 | gimple stmt; | |
563 | imm_use_iterator uit; | |
564 | ||
565 | FOR_EACH_IMM_USE_STMT (stmt, uit, var) | |
566 | { | |
567 | ssa_op_iter dit; | |
568 | def_operand_p def_p; | |
569 | ||
570 | /* We can't propagate PHI nodes into debug stmts. */ | |
571 | if (gimple_code (stmt) == GIMPLE_PHI | |
572 | || is_gimple_debug (stmt)) | |
573 | continue; | |
574 | ||
575 | /* If we find another definition to remove that uses | |
576 | the one we're looking at, defer the removal of this | |
577 | one, so that it can be propagated into debug stmts | |
578 | after the other is. */ | |
579 | FOR_EACH_SSA_DEF_OPERAND (def_p, stmt, dit, SSA_OP_DEF) | |
580 | { | |
581 | tree odef = DEF_FROM_PTR (def_p); | |
582 | ||
583 | if (bitmap_bit_p (toremove, SSA_NAME_VERSION (odef))) | |
584 | { | |
585 | remove_now = false; | |
586 | break; | |
587 | } | |
588 | } | |
589 | ||
590 | if (!remove_now) | |
591 | BREAK_FROM_IMM_USE_STMT (uit); | |
592 | } | |
593 | ||
594 | if (remove_now) | |
595 | { | |
596 | gimple def = SSA_NAME_DEF_STMT (var); | |
597 | gimple_stmt_iterator gsi = gsi_for_stmt (def); | |
598 | ||
599 | if (gimple_code (def) == GIMPLE_PHI) | |
600 | remove_phi_node (&gsi, true); | |
601 | else | |
602 | { | |
603 | gsi_remove (&gsi, true); | |
604 | release_defs (def); | |
605 | } | |
606 | ||
607 | bitmap_clear_bit (toremove, j); | |
608 | } | |
609 | } | |
610 | } | |
611 | ||
53b4bf74 | 612 | /* Return true if SSA_NAME is malformed and mark it visited. |
6de9cd9a | 613 | |
53b4bf74 DN |
614 | IS_VIRTUAL is true if this SSA_NAME was found inside a virtual |
615 | operand. */ | |
6de9cd9a DN |
616 | |
617 | static bool | |
53b4bf74 | 618 | verify_ssa_name (tree ssa_name, bool is_virtual) |
6de9cd9a | 619 | { |
6de9cd9a DN |
620 | if (TREE_CODE (ssa_name) != SSA_NAME) |
621 | { | |
ab532386 | 622 | error ("expected an SSA_NAME object"); |
53b4bf74 | 623 | return true; |
6de9cd9a DN |
624 | } |
625 | ||
a011aa39 | 626 | if (SSA_NAME_IN_FREE_LIST (ssa_name)) |
bbc630f5 | 627 | { |
a011aa39 | 628 | error ("found an SSA_NAME that had been released into the free pool"); |
bbc630f5 DN |
629 | return true; |
630 | } | |
631 | ||
a011aa39 RB |
632 | if (SSA_NAME_VAR (ssa_name) != NULL_TREE |
633 | && TREE_TYPE (ssa_name) != TREE_TYPE (SSA_NAME_VAR (ssa_name))) | |
53b4bf74 | 634 | { |
a011aa39 | 635 | error ("type mismatch between an SSA_NAME and its symbol"); |
53b4bf74 DN |
636 | return true; |
637 | } | |
638 | ||
ea057359 | 639 | if (is_virtual && !virtual_operand_p (ssa_name)) |
53b4bf74 | 640 | { |
ab532386 | 641 | error ("found a virtual definition for a GIMPLE register"); |
53b4bf74 DN |
642 | return true; |
643 | } | |
644 | ||
5006671f RG |
645 | if (is_virtual && SSA_NAME_VAR (ssa_name) != gimple_vop (cfun)) |
646 | { | |
647 | error ("virtual SSA name for non-VOP decl"); | |
648 | return true; | |
649 | } | |
650 | ||
ea057359 | 651 | if (!is_virtual && virtual_operand_p (ssa_name)) |
53b4bf74 | 652 | { |
ab532386 | 653 | error ("found a real definition for a non-register"); |
53b4bf74 DN |
654 | return true; |
655 | } | |
656 | ||
38635499 | 657 | if (SSA_NAME_IS_DEFAULT_DEF (ssa_name) |
726a989a | 658 | && !gimple_nop_p (SSA_NAME_DEF_STMT (ssa_name))) |
38635499 DN |
659 | { |
660 | error ("found a default name with a non-empty defining statement"); | |
661 | return true; | |
662 | } | |
663 | ||
53b4bf74 DN |
664 | return false; |
665 | } | |
666 | ||
667 | ||
668 | /* Return true if the definition of SSA_NAME at block BB is malformed. | |
669 | ||
670 | STMT is the statement where SSA_NAME is created. | |
671 | ||
672 | DEFINITION_BLOCK is an array of basic blocks indexed by SSA_NAME | |
673 | version numbers. If DEFINITION_BLOCK[SSA_NAME_VERSION] is set, | |
674 | it means that the block in that array slot contains the | |
675 | definition of SSA_NAME. | |
676 | ||
38635499 | 677 | IS_VIRTUAL is true if SSA_NAME is created by a VDEF. */ |
53b4bf74 DN |
678 | |
679 | static bool | |
680 | verify_def (basic_block bb, basic_block *definition_block, tree ssa_name, | |
726a989a | 681 | gimple stmt, bool is_virtual) |
53b4bf74 DN |
682 | { |
683 | if (verify_ssa_name (ssa_name, is_virtual)) | |
684 | goto err; | |
685 | ||
70b5e7dc RG |
686 | if (SSA_NAME_VAR (ssa_name) |
687 | && TREE_CODE (SSA_NAME_VAR (ssa_name)) == RESULT_DECL | |
6938f93f JH |
688 | && DECL_BY_REFERENCE (SSA_NAME_VAR (ssa_name))) |
689 | { | |
d8a07487 | 690 | error ("RESULT_DECL should be read only when DECL_BY_REFERENCE is set"); |
6938f93f JH |
691 | goto err; |
692 | } | |
693 | ||
6de9cd9a DN |
694 | if (definition_block[SSA_NAME_VERSION (ssa_name)]) |
695 | { | |
696 | error ("SSA_NAME created in two different blocks %i and %i", | |
697 | definition_block[SSA_NAME_VERSION (ssa_name)]->index, bb->index); | |
53b4bf74 | 698 | goto err; |
6de9cd9a DN |
699 | } |
700 | ||
701 | definition_block[SSA_NAME_VERSION (ssa_name)] = bb; | |
702 | ||
703 | if (SSA_NAME_DEF_STMT (ssa_name) != stmt) | |
704 | { | |
705 | error ("SSA_NAME_DEF_STMT is wrong"); | |
6de9cd9a | 706 | fprintf (stderr, "Expected definition statement:\n"); |
726a989a | 707 | print_gimple_stmt (stderr, SSA_NAME_DEF_STMT (ssa_name), 4, TDF_VOPS); |
6de9cd9a | 708 | fprintf (stderr, "\nActual definition statement:\n"); |
726a989a | 709 | print_gimple_stmt (stderr, stmt, 4, TDF_VOPS); |
53b4bf74 | 710 | goto err; |
6de9cd9a DN |
711 | } |
712 | ||
53b4bf74 DN |
713 | return false; |
714 | ||
715 | err: | |
716 | fprintf (stderr, "while verifying SSA_NAME "); | |
717 | print_generic_expr (stderr, ssa_name, 0); | |
718 | fprintf (stderr, " in statement\n"); | |
726a989a | 719 | print_gimple_stmt (stderr, stmt, 4, TDF_VOPS); |
53b4bf74 DN |
720 | |
721 | return true; | |
6de9cd9a DN |
722 | } |
723 | ||
724 | ||
725 | /* Return true if the use of SSA_NAME at statement STMT in block BB is | |
726 | malformed. | |
727 | ||
728 | DEF_BB is the block where SSA_NAME was found to be created. | |
729 | ||
730 | IDOM contains immediate dominator information for the flowgraph. | |
731 | ||
732 | CHECK_ABNORMAL is true if the caller wants to check whether this use | |
733 | is flowing through an abnormal edge (only used when checking PHI | |
53b4bf74 DN |
734 | arguments). |
735 | ||
b1d16eff ZD |
736 | If NAMES_DEFINED_IN_BB is not NULL, it contains a bitmap of ssa names |
737 | that are defined before STMT in basic block BB. */ | |
6de9cd9a DN |
738 | |
739 | static bool | |
f430bae8 | 740 | verify_use (basic_block bb, basic_block def_bb, use_operand_p use_p, |
726a989a | 741 | gimple stmt, bool check_abnormal, bitmap names_defined_in_bb) |
6de9cd9a DN |
742 | { |
743 | bool err = false; | |
f430bae8 | 744 | tree ssa_name = USE_FROM_PTR (use_p); |
6de9cd9a | 745 | |
f430bae8 AM |
746 | if (!TREE_VISITED (ssa_name)) |
747 | if (verify_imm_links (stderr, ssa_name)) | |
748 | err = true; | |
749 | ||
28a3618f | 750 | TREE_VISITED (ssa_name) = 1; |
53b4bf74 | 751 | |
726a989a | 752 | if (gimple_nop_p (SSA_NAME_DEF_STMT (ssa_name)) |
38635499 | 753 | && SSA_NAME_IS_DEFAULT_DEF (ssa_name)) |
53b4bf74 | 754 | ; /* Default definitions have empty statements. Nothing to do. */ |
6de9cd9a DN |
755 | else if (!def_bb) |
756 | { | |
ab532386 | 757 | error ("missing definition"); |
6de9cd9a DN |
758 | err = true; |
759 | } | |
760 | else if (bb != def_bb | |
761 | && !dominated_by_p (CDI_DOMINATORS, bb, def_bb)) | |
762 | { | |
ab532386 | 763 | error ("definition in block %i does not dominate use in block %i", |
6de9cd9a DN |
764 | def_bb->index, bb->index); |
765 | err = true; | |
766 | } | |
b1d16eff ZD |
767 | else if (bb == def_bb |
768 | && names_defined_in_bb != NULL | |
769 | && !bitmap_bit_p (names_defined_in_bb, SSA_NAME_VERSION (ssa_name))) | |
770 | { | |
ab532386 | 771 | error ("definition in block %i follows the use", def_bb->index); |
b1d16eff ZD |
772 | err = true; |
773 | } | |
6de9cd9a DN |
774 | |
775 | if (check_abnormal | |
776 | && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ssa_name)) | |
777 | { | |
778 | error ("SSA_NAME_OCCURS_IN_ABNORMAL_PHI should be set"); | |
779 | err = true; | |
780 | } | |
781 | ||
b8698a0f | 782 | /* Make sure the use is in an appropriate list by checking the previous |
f3b569ca | 783 | element to make sure it's the same. */ |
f430bae8 AM |
784 | if (use_p->prev == NULL) |
785 | { | |
ab532386 | 786 | error ("no immediate_use list"); |
f430bae8 AM |
787 | err = true; |
788 | } | |
789 | else | |
790 | { | |
726a989a | 791 | tree listvar; |
f430bae8 | 792 | if (use_p->prev->use == NULL) |
726a989a | 793 | listvar = use_p->prev->loc.ssa_name; |
f430bae8 AM |
794 | else |
795 | listvar = USE_FROM_PTR (use_p->prev); | |
796 | if (listvar != ssa_name) | |
797 | { | |
ab532386 | 798 | error ("wrong immediate use list"); |
f430bae8 AM |
799 | err = true; |
800 | } | |
801 | } | |
802 | ||
6de9cd9a DN |
803 | if (err) |
804 | { | |
805 | fprintf (stderr, "for SSA_NAME: "); | |
7bab95ba | 806 | print_generic_expr (stderr, ssa_name, TDF_VOPS); |
0bca51f0 | 807 | fprintf (stderr, " in statement:\n"); |
726a989a | 808 | print_gimple_stmt (stderr, stmt, 0, TDF_VOPS); |
6de9cd9a DN |
809 | } |
810 | ||
811 | return err; | |
812 | } | |
813 | ||
814 | ||
815 | /* Return true if any of the arguments for PHI node PHI at block BB is | |
816 | malformed. | |
817 | ||
38635499 DN |
818 | DEFINITION_BLOCK is an array of basic blocks indexed by SSA_NAME |
819 | version numbers. If DEFINITION_BLOCK[SSA_NAME_VERSION] is set, | |
820 | it means that the block in that array slot contains the | |
821 | definition of SSA_NAME. */ | |
6de9cd9a DN |
822 | |
823 | static bool | |
726a989a | 824 | verify_phi_args (gimple phi, basic_block bb, basic_block *definition_block) |
6de9cd9a DN |
825 | { |
826 | edge e; | |
827 | bool err = false; | |
726a989a | 828 | size_t i, phi_num_args = gimple_phi_num_args (phi); |
6de9cd9a | 829 | |
609d9bed JL |
830 | if (EDGE_COUNT (bb->preds) != phi_num_args) |
831 | { | |
ab532386 | 832 | error ("incoming edge count does not match number of PHI arguments"); |
609d9bed JL |
833 | err = true; |
834 | goto error; | |
835 | } | |
836 | ||
6de9cd9a DN |
837 | for (i = 0; i < phi_num_args; i++) |
838 | { | |
726a989a | 839 | use_operand_p op_p = gimple_phi_arg_imm_use_ptr (phi, i); |
f430bae8 AM |
840 | tree op = USE_FROM_PTR (op_p); |
841 | ||
62112e35 | 842 | e = EDGE_PRED (bb, i); |
6b66c718 KH |
843 | |
844 | if (op == NULL_TREE) | |
845 | { | |
ab532386 | 846 | error ("PHI argument is missing for edge %d->%d", |
6b66c718 KH |
847 | e->src->index, |
848 | e->dest->index); | |
849 | err = true; | |
850 | goto error; | |
851 | } | |
852 | ||
609d9bed JL |
853 | if (TREE_CODE (op) != SSA_NAME && !is_gimple_min_invariant (op)) |
854 | { | |
855 | error ("PHI argument is not SSA_NAME, or invariant"); | |
856 | err = true; | |
857 | } | |
858 | ||
6de9cd9a | 859 | if (TREE_CODE (op) == SSA_NAME) |
38635499 | 860 | { |
ea057359 | 861 | err = verify_ssa_name (op, virtual_operand_p (gimple_phi_result (phi))); |
38635499 DN |
862 | err |= verify_use (e->src, definition_block[SSA_NAME_VERSION (op)], |
863 | op_p, phi, e->flags & EDGE_ABNORMAL, NULL); | |
864 | } | |
6de9cd9a | 865 | |
628c189e RG |
866 | if (TREE_CODE (op) == ADDR_EXPR) |
867 | { | |
868 | tree base = TREE_OPERAND (op, 0); | |
869 | while (handled_component_p (base)) | |
870 | base = TREE_OPERAND (base, 0); | |
871 | if ((TREE_CODE (base) == VAR_DECL | |
872 | || TREE_CODE (base) == PARM_DECL | |
873 | || TREE_CODE (base) == RESULT_DECL) | |
874 | && !TREE_ADDRESSABLE (base)) | |
875 | { | |
876 | error ("address taken, but ADDRESSABLE bit not set"); | |
877 | err = true; | |
878 | } | |
879 | } | |
880 | ||
6de9cd9a DN |
881 | if (e->dest != bb) |
882 | { | |
ab532386 | 883 | error ("wrong edge %d->%d for PHI argument", |
ea40ba9c | 884 | e->src->index, e->dest->index); |
6de9cd9a DN |
885 | err = true; |
886 | } | |
887 | ||
6de9cd9a DN |
888 | if (err) |
889 | { | |
890 | fprintf (stderr, "PHI argument\n"); | |
7bab95ba | 891 | print_generic_stmt (stderr, op, TDF_VOPS); |
53b4bf74 | 892 | goto error; |
6de9cd9a | 893 | } |
6de9cd9a DN |
894 | } |
895 | ||
53b4bf74 | 896 | error: |
6de9cd9a DN |
897 | if (err) |
898 | { | |
899 | fprintf (stderr, "for PHI node\n"); | |
726a989a | 900 | print_gimple_stmt (stderr, phi, 0, TDF_VOPS|TDF_MEMSYMS); |
6de9cd9a DN |
901 | } |
902 | ||
903 | ||
904 | return err; | |
905 | } | |
906 | ||
907 | ||
908 | /* Verify common invariants in the SSA web. | |
909 | TODO: verify the variable annotations. */ | |
910 | ||
24e47c76 | 911 | DEBUG_FUNCTION void |
f430bae8 | 912 | verify_ssa (bool check_modified_stmt) |
6de9cd9a | 913 | { |
53b4bf74 | 914 | size_t i; |
6de9cd9a | 915 | basic_block bb; |
858904db | 916 | basic_block *definition_block = XCNEWVEC (basic_block, num_ssa_names); |
4c124b4c AM |
917 | ssa_op_iter iter; |
918 | tree op; | |
2b28c07a | 919 | enum dom_state orig_dom_state = dom_info_state (CDI_DOMINATORS); |
8bdbfff5 | 920 | bitmap names_defined_in_bb = BITMAP_ALLOC (NULL); |
6de9cd9a | 921 | |
5006671f | 922 | gcc_assert (!need_ssa_update_p (cfun)); |
84d65814 | 923 | |
6de9cd9a DN |
924 | timevar_push (TV_TREE_SSA_VERIFY); |
925 | ||
53b4bf74 DN |
926 | /* Keep track of SSA names present in the IL. */ |
927 | for (i = 1; i < num_ssa_names; i++) | |
6de9cd9a | 928 | { |
609d9bed JL |
929 | tree name = ssa_name (i); |
930 | if (name) | |
6de9cd9a | 931 | { |
726a989a | 932 | gimple stmt; |
609d9bed | 933 | TREE_VISITED (name) = 0; |
6de9cd9a | 934 | |
ea057359 | 935 | verify_ssa_name (name, virtual_operand_p (name)); |
bc590dfb | 936 | |
609d9bed | 937 | stmt = SSA_NAME_DEF_STMT (name); |
726a989a | 938 | if (!gimple_nop_p (stmt)) |
53b4bf74 | 939 | { |
726a989a | 940 | basic_block bb = gimple_bb (stmt); |
609d9bed | 941 | verify_def (bb, definition_block, |
ea057359 | 942 | name, stmt, virtual_operand_p (name)); |
609d9bed | 943 | |
6de9cd9a DN |
944 | } |
945 | } | |
946 | } | |
947 | ||
609d9bed | 948 | calculate_dominance_info (CDI_DOMINATORS); |
6de9cd9a DN |
949 | |
950 | /* Now verify all the uses and make sure they agree with the definitions | |
951 | found in the previous pass. */ | |
952 | FOR_EACH_BB (bb) | |
953 | { | |
954 | edge e; | |
726a989a | 955 | gimple phi; |
628f6a4e | 956 | edge_iterator ei; |
726a989a | 957 | gimple_stmt_iterator gsi; |
6de9cd9a DN |
958 | |
959 | /* Make sure that all edges have a clear 'aux' field. */ | |
628f6a4e | 960 | FOR_EACH_EDGE (e, ei, bb->preds) |
6de9cd9a DN |
961 | { |
962 | if (e->aux) | |
963 | { | |
ab532386 | 964 | error ("AUX pointer initialized for edge %d->%d", e->src->index, |
6de9cd9a | 965 | e->dest->index); |
53b4bf74 | 966 | goto err; |
6de9cd9a DN |
967 | } |
968 | } | |
969 | ||
970 | /* Verify the arguments for every PHI node in the block. */ | |
726a989a | 971 | for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
b1d16eff | 972 | { |
726a989a | 973 | phi = gsi_stmt (gsi); |
b1d16eff ZD |
974 | if (verify_phi_args (phi, bb, definition_block)) |
975 | goto err; | |
38635499 | 976 | |
b1d16eff | 977 | bitmap_set_bit (names_defined_in_bb, |
726a989a | 978 | SSA_NAME_VERSION (gimple_phi_result (phi))); |
b1d16eff | 979 | } |
6de9cd9a | 980 | |
53b4bf74 | 981 | /* Now verify all the uses and vuses in every statement of the block. */ |
726a989a | 982 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
6de9cd9a | 983 | { |
726a989a | 984 | gimple stmt = gsi_stmt (gsi); |
f430bae8 AM |
985 | use_operand_p use_p; |
986 | ||
726a989a | 987 | if (check_modified_stmt && gimple_modified_p (stmt)) |
f430bae8 | 988 | { |
38635499 | 989 | error ("stmt (%p) marked modified after optimization pass: ", |
f47c96aa | 990 | (void *)stmt); |
726a989a | 991 | print_gimple_stmt (stderr, stmt, 0, TDF_VOPS); |
f430bae8 AM |
992 | goto err; |
993 | } | |
6de9cd9a | 994 | |
bc590dfb | 995 | if (verify_ssa_operands (stmt)) |
5006671f | 996 | { |
bc590dfb | 997 | print_gimple_stmt (stderr, stmt, 0, TDF_VOPS); |
5006671f | 998 | goto err; |
38635499 DN |
999 | } |
1000 | ||
bc590dfb RG |
1001 | if (gimple_debug_bind_p (stmt) |
1002 | && !gimple_debug_bind_has_value_p (stmt)) | |
1003 | continue; | |
38635499 DN |
1004 | |
1005 | FOR_EACH_SSA_USE_OPERAND (use_p, stmt, iter, SSA_OP_USE|SSA_OP_VUSE) | |
6de9cd9a | 1006 | { |
f430bae8 | 1007 | op = USE_FROM_PTR (use_p); |
53b4bf74 | 1008 | if (verify_use (bb, definition_block[SSA_NAME_VERSION (op)], |
38635499 | 1009 | use_p, stmt, false, names_defined_in_bb)) |
b1d16eff ZD |
1010 | goto err; |
1011 | } | |
1012 | ||
1013 | FOR_EACH_SSA_TREE_OPERAND (op, stmt, iter, SSA_OP_ALL_DEFS) | |
5006671f RG |
1014 | { |
1015 | if (SSA_NAME_DEF_STMT (op) != stmt) | |
1016 | { | |
1017 | error ("SSA_NAME_DEF_STMT is wrong"); | |
1018 | fprintf (stderr, "Expected definition statement:\n"); | |
1019 | print_gimple_stmt (stderr, stmt, 4, TDF_VOPS); | |
1020 | fprintf (stderr, "\nActual definition statement:\n"); | |
1021 | print_gimple_stmt (stderr, SSA_NAME_DEF_STMT (op), | |
1022 | 4, TDF_VOPS); | |
1023 | goto err; | |
1024 | } | |
1025 | bitmap_set_bit (names_defined_in_bb, SSA_NAME_VERSION (op)); | |
1026 | } | |
b1d16eff ZD |
1027 | } |
1028 | ||
b1d16eff | 1029 | bitmap_clear (names_defined_in_bb); |
6de9cd9a DN |
1030 | } |
1031 | ||
53b4bf74 | 1032 | free (definition_block); |
84d65814 | 1033 | |
b01d837f KH |
1034 | /* Restore the dominance information to its prior known state, so |
1035 | that we do not perturb the compiler's subsequent behavior. */ | |
03261822 NS |
1036 | if (orig_dom_state == DOM_NONE) |
1037 | free_dominance_info (CDI_DOMINATORS); | |
1038 | else | |
2b28c07a | 1039 | set_dom_info_availability (CDI_DOMINATORS, orig_dom_state); |
b8698a0f | 1040 | |
8bdbfff5 | 1041 | BITMAP_FREE (names_defined_in_bb); |
6de9cd9a | 1042 | timevar_pop (TV_TREE_SSA_VERIFY); |
53b4bf74 | 1043 | return; |
6de9cd9a | 1044 | |
53b4bf74 | 1045 | err: |
ab532386 | 1046 | internal_error ("verify_ssa failed"); |
6de9cd9a DN |
1047 | } |
1048 | ||
e445a2ff RG |
1049 | /* Return true if the DECL_UID in both trees are equal. */ |
1050 | ||
1051 | static int | |
1052 | uid_ssaname_map_eq (const void *va, const void *vb) | |
1053 | { | |
1054 | const_tree a = (const_tree) va; | |
1055 | const_tree b = (const_tree) vb; | |
1056 | return (a->ssa_name.var->decl_minimal.uid == b->ssa_name.var->decl_minimal.uid); | |
1057 | } | |
1058 | ||
1059 | /* Hash a tree in a uid_decl_map. */ | |
1060 | ||
1061 | static unsigned int | |
1062 | uid_ssaname_map_hash (const void *item) | |
1063 | { | |
1064 | return ((const_tree)item)->ssa_name.var->decl_minimal.uid; | |
1065 | } | |
1066 | ||
6de9cd9a | 1067 | |
6de9cd9a DN |
1068 | /* Initialize global DFA and SSA structures. */ |
1069 | ||
1070 | void | |
5db9ba0c | 1071 | init_tree_ssa (struct function *fn) |
6de9cd9a | 1072 | { |
a9429e29 | 1073 | fn->gimple_df = ggc_alloc_cleared_gimple_df (); |
b8698a0f | 1074 | fn->gimple_df->default_defs = htab_create_ggc (20, uid_ssaname_map_hash, |
5db9ba0c | 1075 | uid_ssaname_map_eq, NULL); |
5006671f | 1076 | pt_solution_reset (&fn->gimple_df->escaped); |
5db9ba0c | 1077 | init_ssanames (fn, 0); |
6de9cd9a DN |
1078 | } |
1079 | ||
452aa9c5 RG |
1080 | /* Do the actions required to initialize internal data structures used |
1081 | in tree-ssa optimization passes. */ | |
1082 | ||
1083 | static unsigned int | |
1084 | execute_init_datastructures (void) | |
1085 | { | |
1086 | /* Allocate hash tables, arrays and other structures. */ | |
1087 | init_tree_ssa (cfun); | |
1088 | return 0; | |
1089 | } | |
1090 | ||
1091 | struct gimple_opt_pass pass_init_datastructures = | |
1092 | { | |
1093 | { | |
1094 | GIMPLE_PASS, | |
1095 | "*init_datastructures", /* name */ | |
2b4e6bf1 | 1096 | OPTGROUP_NONE, /* optinfo_flags */ |
452aa9c5 RG |
1097 | NULL, /* gate */ |
1098 | execute_init_datastructures, /* execute */ | |
1099 | NULL, /* sub */ | |
1100 | NULL, /* next */ | |
1101 | 0, /* static_pass_number */ | |
1102 | TV_NONE, /* tv_id */ | |
1103 | PROP_cfg, /* properties_required */ | |
1104 | 0, /* properties_provided */ | |
1105 | 0, /* properties_destroyed */ | |
1106 | 0, /* todo_flags_start */ | |
1107 | 0 /* todo_flags_finish */ | |
1108 | } | |
1109 | }; | |
6de9cd9a DN |
1110 | |
1111 | /* Deallocate memory associated with SSA data structures for FNDECL. */ | |
1112 | ||
1113 | void | |
1114 | delete_tree_ssa (void) | |
1115 | { | |
6de9cd9a | 1116 | fini_ssanames (); |
726a989a RB |
1117 | |
1118 | /* We no longer maintain the SSA operand cache at this point. */ | |
2eb712b4 | 1119 | if (ssa_operands_active (cfun)) |
f7bc70c5 | 1120 | fini_ssa_operands (); |
6de9cd9a | 1121 | |
5cd4ec7f | 1122 | htab_delete (cfun->gimple_df->default_defs); |
adb6509f | 1123 | cfun->gimple_df->default_defs = NULL; |
5006671f | 1124 | pt_solution_reset (&cfun->gimple_df->escaped); |
55b34b5f RG |
1125 | if (cfun->gimple_df->decls_to_pointers != NULL) |
1126 | pointer_map_destroy (cfun->gimple_df->decls_to_pointers); | |
1127 | cfun->gimple_df->decls_to_pointers = NULL; | |
5cd4ec7f | 1128 | cfun->gimple_df->modified_noreturn_calls = NULL; |
adb6509f | 1129 | cfun->gimple_df = NULL; |
ea7e6d5a AH |
1130 | |
1131 | /* We no longer need the edge variable maps. */ | |
1132 | redirect_edge_var_map_destroy (); | |
6de9cd9a DN |
1133 | } |
1134 | ||
4f4e722e RG |
1135 | /* Return true if the conversion from INNER_TYPE to OUTER_TYPE is a |
1136 | useless type conversion, otherwise return false. | |
6de9cd9a | 1137 | |
4f4e722e RG |
1138 | This function implicitly defines the middle-end type system. With |
1139 | the notion of 'a < b' meaning that useless_type_conversion_p (a, b) | |
1140 | holds and 'a > b' meaning that useless_type_conversion_p (b, a) holds, | |
1141 | the following invariants shall be fulfilled: | |
1142 | ||
1143 | 1) useless_type_conversion_p is transitive. | |
1144 | If a < b and b < c then a < c. | |
1145 | ||
1146 | 2) useless_type_conversion_p is not symmetric. | |
1147 | From a < b does not follow a > b. | |
1148 | ||
1149 | 3) Types define the available set of operations applicable to values. | |
1150 | A type conversion is useless if the operations for the target type | |
1151 | is a subset of the operations for the source type. For example | |
1152 | casts to void* are useless, casts from void* are not (void* can't | |
1153 | be dereferenced or offsetted, but copied, hence its set of operations | |
1154 | is a strict subset of that of all other data pointer types). Casts | |
1155 | to const T* are useless (can't be written to), casts from const T* | |
1156 | to T* are not. */ | |
1157 | ||
1158 | bool | |
1159 | useless_type_conversion_p (tree outer_type, tree inner_type) | |
6de9cd9a | 1160 | { |
f7c0ffb4 RG |
1161 | /* Do the following before stripping toplevel qualifiers. */ |
1162 | if (POINTER_TYPE_P (inner_type) | |
1163 | && POINTER_TYPE_P (outer_type)) | |
1164 | { | |
09e881c9 BE |
1165 | /* Do not lose casts between pointers to different address spaces. */ |
1166 | if (TYPE_ADDR_SPACE (TREE_TYPE (outer_type)) | |
1167 | != TYPE_ADDR_SPACE (TREE_TYPE (inner_type))) | |
1168 | return false; | |
f7c0ffb4 RG |
1169 | } |
1170 | ||
1171 | /* From now on qualifiers on value types do not matter. */ | |
4fc66945 RG |
1172 | inner_type = TYPE_MAIN_VARIANT (inner_type); |
1173 | outer_type = TYPE_MAIN_VARIANT (outer_type); | |
1174 | ||
4f380bf8 RS |
1175 | if (inner_type == outer_type) |
1176 | return true; | |
1177 | ||
e11e491d RG |
1178 | /* If we know the canonical types, compare them. */ |
1179 | if (TYPE_CANONICAL (inner_type) | |
1180 | && TYPE_CANONICAL (inner_type) == TYPE_CANONICAL (outer_type)) | |
1181 | return true; | |
1182 | ||
e52201b6 RG |
1183 | /* Changes in machine mode are never useless conversions unless we |
1184 | deal with aggregate types in which case we defer to later checks. */ | |
1185 | if (TYPE_MODE (inner_type) != TYPE_MODE (outer_type) | |
1186 | && !AGGREGATE_TYPE_P (inner_type)) | |
4f380bf8 RS |
1187 | return false; |
1188 | ||
85b19f61 RG |
1189 | /* If both the inner and outer types are integral types, then the |
1190 | conversion is not necessary if they have the same mode and | |
1191 | signedness and precision, and both or neither are boolean. */ | |
1192 | if (INTEGRAL_TYPE_P (inner_type) | |
1193 | && INTEGRAL_TYPE_P (outer_type)) | |
1194 | { | |
1195 | /* Preserve changes in signedness or precision. */ | |
1196 | if (TYPE_UNSIGNED (inner_type) != TYPE_UNSIGNED (outer_type) | |
1197 | || TYPE_PRECISION (inner_type) != TYPE_PRECISION (outer_type)) | |
1198 | return false; | |
1199 | ||
7f3ff782 KT |
1200 | /* Preserve conversions to/from BOOLEAN_TYPE if types are not |
1201 | of precision one. */ | |
1202 | if (((TREE_CODE (inner_type) == BOOLEAN_TYPE) | |
1203 | != (TREE_CODE (outer_type) == BOOLEAN_TYPE)) | |
51c213f7 RG |
1204 | && TYPE_PRECISION (outer_type) != 1) |
1205 | return false; | |
1206 | ||
d40055ab RG |
1207 | /* We don't need to preserve changes in the types minimum or |
1208 | maximum value in general as these do not generate code | |
1209 | unless the types precisions are different. */ | |
85b19f61 RG |
1210 | return true; |
1211 | } | |
af62f6f9 | 1212 | |
4fc66945 RG |
1213 | /* Scalar floating point types with the same mode are compatible. */ |
1214 | else if (SCALAR_FLOAT_TYPE_P (inner_type) | |
1215 | && SCALAR_FLOAT_TYPE_P (outer_type)) | |
1216 | return true; | |
1217 | ||
907dd6ae RG |
1218 | /* Fixed point types with the same mode are compatible. */ |
1219 | else if (FIXED_POINT_TYPE_P (inner_type) | |
1220 | && FIXED_POINT_TYPE_P (outer_type)) | |
1221 | return true; | |
1222 | ||
85b19f61 | 1223 | /* We need to take special care recursing to pointed-to types. */ |
6de9cd9a | 1224 | else if (POINTER_TYPE_P (inner_type) |
85b19f61 RG |
1225 | && POINTER_TYPE_P (outer_type)) |
1226 | { | |
70f34814 RG |
1227 | /* Do not lose casts to function pointer types. */ |
1228 | if ((TREE_CODE (TREE_TYPE (outer_type)) == FUNCTION_TYPE | |
1229 | || TREE_CODE (TREE_TYPE (outer_type)) == METHOD_TYPE) | |
f20ca725 RG |
1230 | && !(TREE_CODE (TREE_TYPE (inner_type)) == FUNCTION_TYPE |
1231 | || TREE_CODE (TREE_TYPE (inner_type)) == METHOD_TYPE)) | |
85b19f61 RG |
1232 | return false; |
1233 | ||
16ac8575 RG |
1234 | /* We do not care for const qualification of the pointed-to types |
1235 | as const qualification has no semantic value to the middle-end. */ | |
4fc66945 | 1236 | |
70f34814 RG |
1237 | /* Otherwise pointers/references are equivalent. */ |
1238 | return true; | |
bc15d0ef | 1239 | } |
6de9cd9a DN |
1240 | |
1241 | /* Recurse for complex types. */ | |
1242 | else if (TREE_CODE (inner_type) == COMPLEX_TYPE | |
85b19f61 | 1243 | && TREE_CODE (outer_type) == COMPLEX_TYPE) |
0d17b70a RG |
1244 | return useless_type_conversion_p (TREE_TYPE (outer_type), |
1245 | TREE_TYPE (inner_type)); | |
6de9cd9a | 1246 | |
4fc66945 RG |
1247 | /* Recurse for vector types with the same number of subparts. */ |
1248 | else if (TREE_CODE (inner_type) == VECTOR_TYPE | |
1249 | && TREE_CODE (outer_type) == VECTOR_TYPE | |
1250 | && TYPE_PRECISION (inner_type) == TYPE_PRECISION (outer_type)) | |
0d17b70a RG |
1251 | return useless_type_conversion_p (TREE_TYPE (outer_type), |
1252 | TREE_TYPE (inner_type)); | |
4fc66945 | 1253 | |
e52201b6 RG |
1254 | else if (TREE_CODE (inner_type) == ARRAY_TYPE |
1255 | && TREE_CODE (outer_type) == ARRAY_TYPE) | |
4fc66945 | 1256 | { |
e52201b6 RG |
1257 | /* Preserve string attributes. */ |
1258 | if (TYPE_STRING_FLAG (inner_type) != TYPE_STRING_FLAG (outer_type)) | |
4fc66945 RG |
1259 | return false; |
1260 | ||
16c33770 RG |
1261 | /* Conversions from array types with unknown extent to |
1262 | array types with known extent are not useless. */ | |
e52201b6 | 1263 | if (!TYPE_DOMAIN (inner_type) |
16c33770 RG |
1264 | && TYPE_DOMAIN (outer_type)) |
1265 | return false; | |
1266 | ||
e52201b6 RG |
1267 | /* Nor are conversions from array types with non-constant size to |
1268 | array types with constant size or to different size. */ | |
1269 | if (TYPE_SIZE (outer_type) | |
1270 | && TREE_CODE (TYPE_SIZE (outer_type)) == INTEGER_CST | |
1271 | && (!TYPE_SIZE (inner_type) | |
1272 | || TREE_CODE (TYPE_SIZE (inner_type)) != INTEGER_CST | |
1273 | || !tree_int_cst_equal (TYPE_SIZE (outer_type), | |
1274 | TYPE_SIZE (inner_type)))) | |
1275 | return false; | |
1276 | ||
1277 | /* Check conversions between arrays with partially known extents. | |
1278 | If the array min/max values are constant they have to match. | |
1279 | Otherwise allow conversions to unknown and variable extents. | |
1280 | In particular this declares conversions that may change the | |
1281 | mode to BLKmode as useless. */ | |
1282 | if (TYPE_DOMAIN (inner_type) | |
1283 | && TYPE_DOMAIN (outer_type) | |
1284 | && TYPE_DOMAIN (inner_type) != TYPE_DOMAIN (outer_type)) | |
1285 | { | |
1286 | tree inner_min = TYPE_MIN_VALUE (TYPE_DOMAIN (inner_type)); | |
1287 | tree outer_min = TYPE_MIN_VALUE (TYPE_DOMAIN (outer_type)); | |
1288 | tree inner_max = TYPE_MAX_VALUE (TYPE_DOMAIN (inner_type)); | |
1289 | tree outer_max = TYPE_MAX_VALUE (TYPE_DOMAIN (outer_type)); | |
1290 | ||
1291 | /* After gimplification a variable min/max value carries no | |
1292 | additional information compared to a NULL value. All that | |
1293 | matters has been lowered to be part of the IL. */ | |
1294 | if (inner_min && TREE_CODE (inner_min) != INTEGER_CST) | |
1295 | inner_min = NULL_TREE; | |
1296 | if (outer_min && TREE_CODE (outer_min) != INTEGER_CST) | |
1297 | outer_min = NULL_TREE; | |
1298 | if (inner_max && TREE_CODE (inner_max) != INTEGER_CST) | |
1299 | inner_max = NULL_TREE; | |
1300 | if (outer_max && TREE_CODE (outer_max) != INTEGER_CST) | |
1301 | outer_max = NULL_TREE; | |
1302 | ||
1303 | /* Conversions NULL / variable <- cst are useless, but not | |
1304 | the other way around. */ | |
1305 | if (outer_min | |
1306 | && (!inner_min | |
1307 | || !tree_int_cst_equal (inner_min, outer_min))) | |
1308 | return false; | |
1309 | if (outer_max | |
1310 | && (!inner_max | |
1311 | || !tree_int_cst_equal (inner_max, outer_max))) | |
1312 | return false; | |
1313 | } | |
1314 | ||
1315 | /* Recurse on the element check. */ | |
1316 | return useless_type_conversion_p (TREE_TYPE (outer_type), | |
1317 | TREE_TYPE (inner_type)); | |
1318 | } | |
1319 | ||
1320 | else if ((TREE_CODE (inner_type) == FUNCTION_TYPE | |
1321 | || TREE_CODE (inner_type) == METHOD_TYPE) | |
1322 | && TREE_CODE (inner_type) == TREE_CODE (outer_type)) | |
1323 | { | |
1324 | tree outer_parm, inner_parm; | |
1325 | ||
1326 | /* If the return types are not compatible bail out. */ | |
1327 | if (!useless_type_conversion_p (TREE_TYPE (outer_type), | |
1328 | TREE_TYPE (inner_type))) | |
1329 | return false; | |
1330 | ||
1331 | /* Method types should belong to a compatible base class. */ | |
1332 | if (TREE_CODE (inner_type) == METHOD_TYPE | |
1333 | && !useless_type_conversion_p (TYPE_METHOD_BASETYPE (outer_type), | |
1334 | TYPE_METHOD_BASETYPE (inner_type))) | |
1335 | return false; | |
1336 | ||
1337 | /* A conversion to an unprototyped argument list is ok. */ | |
f4da8dce | 1338 | if (!prototype_p (outer_type)) |
e52201b6 RG |
1339 | return true; |
1340 | ||
575140c2 RG |
1341 | /* If the unqualified argument types are compatible the conversion |
1342 | is useless. */ | |
e52201b6 RG |
1343 | if (TYPE_ARG_TYPES (outer_type) == TYPE_ARG_TYPES (inner_type)) |
1344 | return true; | |
1345 | ||
1346 | for (outer_parm = TYPE_ARG_TYPES (outer_type), | |
1347 | inner_parm = TYPE_ARG_TYPES (inner_type); | |
1348 | outer_parm && inner_parm; | |
1349 | outer_parm = TREE_CHAIN (outer_parm), | |
1350 | inner_parm = TREE_CHAIN (inner_parm)) | |
575140c2 RG |
1351 | if (!useless_type_conversion_p |
1352 | (TYPE_MAIN_VARIANT (TREE_VALUE (outer_parm)), | |
1353 | TYPE_MAIN_VARIANT (TREE_VALUE (inner_parm)))) | |
e52201b6 RG |
1354 | return false; |
1355 | ||
1356 | /* If there is a mismatch in the number of arguments the functions | |
1357 | are not compatible. */ | |
1358 | if (outer_parm || inner_parm) | |
1359 | return false; | |
1360 | ||
1361 | /* Defer to the target if necessary. */ | |
1362 | if (TYPE_ATTRIBUTES (inner_type) || TYPE_ATTRIBUTES (outer_type)) | |
ac9a30ae | 1363 | return comp_type_attributes (outer_type, inner_type) != 0; |
e52201b6 RG |
1364 | |
1365 | return true; | |
1366 | } | |
1367 | ||
daad0278 RG |
1368 | /* For aggregates we rely on TYPE_CANONICAL exclusively and require |
1369 | explicit conversions for types involving to be structurally | |
1370 | compared types. */ | |
e52201b6 RG |
1371 | else if (AGGREGATE_TYPE_P (inner_type) |
1372 | && TREE_CODE (inner_type) == TREE_CODE (outer_type)) | |
4490cae6 | 1373 | return false; |
b8698a0f | 1374 | |
4fc66945 | 1375 | return false; |
6de9cd9a DN |
1376 | } |
1377 | ||
f4088621 RG |
1378 | /* Return true if a conversion from either type of TYPE1 and TYPE2 |
1379 | to the other is not required. Otherwise return false. */ | |
1380 | ||
1381 | bool | |
1382 | types_compatible_p (tree type1, tree type2) | |
1383 | { | |
1384 | return (type1 == type2 | |
1385 | || (useless_type_conversion_p (type1, type2) | |
1386 | && useless_type_conversion_p (type2, type1))); | |
1387 | } | |
1388 | ||
6de9cd9a DN |
1389 | /* Return true if EXPR is a useless type conversion, otherwise return |
1390 | false. */ | |
1391 | ||
1392 | bool | |
1393 | tree_ssa_useless_type_conversion (tree expr) | |
1394 | { | |
1395 | /* If we have an assignment that merely uses a NOP_EXPR to change | |
1396 | the top of the RHS to the type of the LHS and the type conversion | |
1397 | is "safe", then strip away the type conversion so that we can | |
1398 | enter LHS = RHS into the const_and_copies table. */ | |
1043771b | 1399 | if (CONVERT_EXPR_P (expr) |
580d124f RK |
1400 | || TREE_CODE (expr) == VIEW_CONVERT_EXPR |
1401 | || TREE_CODE (expr) == NON_LVALUE_EXPR) | |
36618b93 | 1402 | return useless_type_conversion_p |
5039610b | 1403 | (TREE_TYPE (expr), |
726a989a | 1404 | TREE_TYPE (TREE_OPERAND (expr, 0))); |
6de9cd9a DN |
1405 | |
1406 | return false; | |
1407 | } | |
1408 | ||
23314e77 AN |
1409 | /* Strip conversions from EXP according to |
1410 | tree_ssa_useless_type_conversion and return the resulting | |
1411 | expression. */ | |
1412 | ||
1413 | tree | |
1414 | tree_ssa_strip_useless_type_conversions (tree exp) | |
1415 | { | |
1416 | while (tree_ssa_useless_type_conversion (exp)) | |
1417 | exp = TREE_OPERAND (exp, 0); | |
1418 | return exp; | |
1419 | } | |
1420 | ||
6de9cd9a DN |
1421 | |
1422 | /* Internal helper for walk_use_def_chains. VAR, FN and DATA are as | |
53b4bf74 | 1423 | described in walk_use_def_chains. |
b8698a0f | 1424 | |
d0ce8e4c SB |
1425 | VISITED is a pointer set used to mark visited SSA_NAMEs to avoid |
1426 | infinite loops. We used to have a bitmap for this to just mark | |
1427 | SSA versions we had visited. But non-sparse bitmaps are way too | |
1428 | expensive, while sparse bitmaps may cause quadratic behavior. | |
53b4bf74 DN |
1429 | |
1430 | IS_DFS is true if the caller wants to perform a depth-first search | |
1431 | when visiting PHI nodes. A DFS will visit each PHI argument and | |
1432 | call FN after each one. Otherwise, all the arguments are | |
1433 | visited first and then FN is called with each of the visited | |
1434 | arguments in a separate pass. */ | |
6de9cd9a DN |
1435 | |
1436 | static bool | |
1437 | walk_use_def_chains_1 (tree var, walk_use_def_chains_fn fn, void *data, | |
d0ce8e4c | 1438 | struct pointer_set_t *visited, bool is_dfs) |
6de9cd9a | 1439 | { |
726a989a | 1440 | gimple def_stmt; |
6de9cd9a | 1441 | |
d0ce8e4c | 1442 | if (pointer_set_insert (visited, var)) |
6de9cd9a DN |
1443 | return false; |
1444 | ||
6de9cd9a DN |
1445 | def_stmt = SSA_NAME_DEF_STMT (var); |
1446 | ||
726a989a | 1447 | if (gimple_code (def_stmt) != GIMPLE_PHI) |
6de9cd9a DN |
1448 | { |
1449 | /* If we reached the end of the use-def chain, call FN. */ | |
53b4bf74 | 1450 | return fn (var, def_stmt, data); |
6de9cd9a DN |
1451 | } |
1452 | else | |
1453 | { | |
726a989a | 1454 | size_t i; |
6de9cd9a | 1455 | |
53b4bf74 DN |
1456 | /* When doing a breadth-first search, call FN before following the |
1457 | use-def links for each argument. */ | |
1458 | if (!is_dfs) | |
726a989a RB |
1459 | for (i = 0; i < gimple_phi_num_args (def_stmt); i++) |
1460 | if (fn (gimple_phi_arg_def (def_stmt, i), def_stmt, data)) | |
53b4bf74 DN |
1461 | return true; |
1462 | ||
1463 | /* Follow use-def links out of each PHI argument. */ | |
726a989a | 1464 | for (i = 0; i < gimple_phi_num_args (def_stmt); i++) |
6de9cd9a | 1465 | { |
726a989a | 1466 | tree arg = gimple_phi_arg_def (def_stmt, i); |
38635499 DN |
1467 | |
1468 | /* ARG may be NULL for newly introduced PHI nodes. */ | |
1469 | if (arg | |
1470 | && TREE_CODE (arg) == SSA_NAME | |
53b4bf74 | 1471 | && walk_use_def_chains_1 (arg, fn, data, visited, is_dfs)) |
6de9cd9a DN |
1472 | return true; |
1473 | } | |
53b4bf74 DN |
1474 | |
1475 | /* When doing a depth-first search, call FN after following the | |
1476 | use-def links for each argument. */ | |
1477 | if (is_dfs) | |
726a989a RB |
1478 | for (i = 0; i < gimple_phi_num_args (def_stmt); i++) |
1479 | if (fn (gimple_phi_arg_def (def_stmt, i), def_stmt, data)) | |
53b4bf74 | 1480 | return true; |
6de9cd9a | 1481 | } |
b8698a0f | 1482 | |
6de9cd9a DN |
1483 | return false; |
1484 | } | |
b8698a0f | 1485 | |
6de9cd9a DN |
1486 | |
1487 | ||
53b4bf74 DN |
1488 | /* Walk use-def chains starting at the SSA variable VAR. Call |
1489 | function FN at each reaching definition found. FN takes three | |
1490 | arguments: VAR, its defining statement (DEF_STMT) and a generic | |
1491 | pointer to whatever state information that FN may want to maintain | |
1492 | (DATA). FN is able to stop the walk by returning true, otherwise | |
b8698a0f | 1493 | in order to continue the walk, FN should return false. |
6de9cd9a DN |
1494 | |
1495 | Note, that if DEF_STMT is a PHI node, the semantics are slightly | |
53b4bf74 DN |
1496 | different. The first argument to FN is no longer the original |
1497 | variable VAR, but the PHI argument currently being examined. If FN | |
1498 | wants to get at VAR, it should call PHI_RESULT (PHI). | |
1499 | ||
1500 | If IS_DFS is true, this function will: | |
6de9cd9a | 1501 | |
53b4bf74 DN |
1502 | 1- walk the use-def chains for all the PHI arguments, and, |
1503 | 2- call (*FN) (ARG, PHI, DATA) on all the PHI arguments. | |
1504 | ||
1505 | If IS_DFS is false, the two steps above are done in reverse order | |
1506 | (i.e., a breadth-first search). */ | |
6de9cd9a | 1507 | |
6de9cd9a | 1508 | void |
53b4bf74 DN |
1509 | walk_use_def_chains (tree var, walk_use_def_chains_fn fn, void *data, |
1510 | bool is_dfs) | |
6de9cd9a | 1511 | { |
726a989a | 1512 | gimple def_stmt; |
6de9cd9a | 1513 | |
1e128c5f | 1514 | gcc_assert (TREE_CODE (var) == SSA_NAME); |
6de9cd9a DN |
1515 | |
1516 | def_stmt = SSA_NAME_DEF_STMT (var); | |
1517 | ||
1518 | /* We only need to recurse if the reaching definition comes from a PHI | |
1519 | node. */ | |
726a989a | 1520 | if (gimple_code (def_stmt) != GIMPLE_PHI) |
6de9cd9a DN |
1521 | (*fn) (var, def_stmt, data); |
1522 | else | |
1523 | { | |
d0ce8e4c | 1524 | struct pointer_set_t *visited = pointer_set_create (); |
53b4bf74 | 1525 | walk_use_def_chains_1 (var, fn, data, visited, is_dfs); |
d0ce8e4c | 1526 | pointer_set_destroy (visited); |
6de9cd9a DN |
1527 | } |
1528 | } | |
1529 | ||
6de9cd9a DN |
1530 | \f |
1531 | /* Emit warnings for uninitialized variables. This is done in two passes. | |
1532 | ||
7b7e6ecd | 1533 | The first pass notices real uses of SSA names with undefined values. |
6de9cd9a DN |
1534 | Such uses are unconditionally uninitialized, and we can be certain that |
1535 | such a use is a mistake. This pass is run before most optimizations, | |
1536 | so that we catch as many as we can. | |
1537 | ||
1538 | The second pass follows PHI nodes to find uses that are potentially | |
1539 | uninitialized. In this case we can't necessarily prove that the use | |
1540 | is really uninitialized. This pass is run after most optimizations, | |
1541 | so that we thread as many jumps and possible, and delete as much dead | |
1542 | code as possible, in order to reduce false positives. We also look | |
1543 | again for plain uninitialized variables, since optimization may have | |
1544 | changed conditionally uninitialized to unconditionally uninitialized. */ | |
1545 | ||
8d2b0410 RG |
1546 | /* Emit a warning for EXPR based on variable VAR at the point in the |
1547 | program T, an SSA_NAME, is used being uninitialized. The exact | |
2f964ad6 XDL |
1548 | warning text is in MSGID and LOCUS may contain a location or be null. |
1549 | WC is the warning code. */ | |
6de9cd9a | 1550 | |
34f97b94 | 1551 | void |
8d2b0410 RG |
1552 | warn_uninit (enum opt_code wc, tree t, |
1553 | tree expr, tree var, const char *gmsgid, void *data) | |
6de9cd9a | 1554 | { |
726a989a | 1555 | gimple context = (gimple) data; |
2d48bdca | 1556 | location_t location, cfun_loc; |
50f606a6 | 1557 | expanded_location xloc, floc; |
6de9cd9a | 1558 | |
7b7e6ecd | 1559 | if (!ssa_undefined_value_p (t)) |
6de9cd9a DN |
1560 | return; |
1561 | ||
1562 | /* TREE_NO_WARNING either means we already warned, or the front end | |
1563 | wishes to suppress the warning. */ | |
8d2b0410 RG |
1564 | if ((context |
1565 | && (gimple_no_warning_p (context) | |
1566 | || (gimple_assign_single_p (context) | |
1567 | && TREE_NO_WARNING (gimple_assign_rhs1 (context))))) | |
1568 | || TREE_NO_WARNING (expr)) | |
87fe2bd0 | 1569 | return; |
b8698a0f | 1570 | |
726a989a RB |
1571 | location = (context != NULL && gimple_has_location (context)) |
1572 | ? gimple_location (context) | |
1573 | : DECL_SOURCE_LOCATION (var); | |
2d48bdca DS |
1574 | location = linemap_resolve_location (line_table, location, |
1575 | LRK_SPELLING_LOCATION, | |
1576 | NULL); | |
1577 | cfun_loc = DECL_SOURCE_LOCATION (cfun->decl); | |
726a989a | 1578 | xloc = expand_location (location); |
2d48bdca | 1579 | floc = expand_location (cfun_loc); |
8d2b0410 | 1580 | if (warning_at (location, wc, gmsgid, expr)) |
71205d17 | 1581 | { |
8d2b0410 | 1582 | TREE_NO_WARNING (expr) = 1; |
227e9f62 | 1583 | |
426797b2 BS |
1584 | if (location == DECL_SOURCE_LOCATION (var)) |
1585 | return; | |
71205d17 | 1586 | if (xloc.file != floc.file |
2d48bdca DS |
1587 | || linemap_location_before_p (line_table, |
1588 | location, cfun_loc) | |
1589 | || linemap_location_before_p (line_table, | |
1590 | cfun->function_end_locus, | |
1591 | location)) | |
c5d75364 | 1592 | inform (DECL_SOURCE_LOCATION (var), "%qD was declared here", var); |
71205d17 | 1593 | } |
6de9cd9a | 1594 | } |
8cb3ee37 | 1595 | |
34f97b94 | 1596 | unsigned int |
de9a4397 | 1597 | warn_uninitialized_vars (bool warn_possibly_uninitialized) |
6de9cd9a | 1598 | { |
726a989a | 1599 | gimple_stmt_iterator gsi; |
6de9cd9a DN |
1600 | basic_block bb; |
1601 | ||
1602 | FOR_EACH_BB (bb) | |
8cb3ee37 | 1603 | { |
8d2b0410 | 1604 | bool always_executed = dominated_by_p (CDI_POST_DOMINATORS, |
8cb3ee37 | 1605 | single_succ (ENTRY_BLOCK_PTR), bb); |
726a989a RB |
1606 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
1607 | { | |
8d2b0410 RG |
1608 | gimple stmt = gsi_stmt (gsi); |
1609 | use_operand_p use_p; | |
1610 | ssa_op_iter op_iter; | |
1611 | tree use; | |
1612 | ||
1613 | if (is_gimple_debug (stmt)) | |
b5b8b0ac | 1614 | continue; |
8d2b0410 RG |
1615 | |
1616 | /* We only do data flow with SSA_NAMEs, so that's all we | |
1617 | can warn about. */ | |
1618 | FOR_EACH_SSA_USE_OPERAND (use_p, stmt, op_iter, SSA_OP_USE) | |
1619 | { | |
1620 | use = USE_FROM_PTR (use_p); | |
1621 | if (always_executed) | |
1622 | warn_uninit (OPT_Wuninitialized, use, | |
1623 | SSA_NAME_VAR (use), SSA_NAME_VAR (use), | |
1624 | "%qD is used uninitialized in this function", | |
1625 | stmt); | |
1626 | else if (warn_possibly_uninitialized) | |
ea3c6c07 | 1627 | warn_uninit (OPT_Wmaybe_uninitialized, use, |
8d2b0410 RG |
1628 | SSA_NAME_VAR (use), SSA_NAME_VAR (use), |
1629 | "%qD may be used uninitialized in this function", | |
1630 | stmt); | |
1631 | } | |
1632 | ||
1633 | /* For memory the only cheap thing we can do is see if we | |
1634 | have a use of the default def of the virtual operand. | |
1635 | ??? Note that at -O0 we do not have virtual operands. | |
1636 | ??? Not so cheap would be to use the alias oracle via | |
1637 | walk_aliased_vdefs, if we don't find any aliasing vdef | |
1638 | warn as is-used-uninitialized, if we don't find an aliasing | |
1639 | vdef that kills our use (stmt_kills_ref_p), warn as | |
1640 | may-be-used-uninitialized. But this walk is quadratic and | |
1641 | so must be limited which means we would miss warning | |
1642 | opportunities. */ | |
1643 | use = gimple_vuse (stmt); | |
1644 | if (use | |
1645 | && gimple_assign_single_p (stmt) | |
1646 | && !gimple_vdef (stmt) | |
1647 | && SSA_NAME_IS_DEFAULT_DEF (use)) | |
1648 | { | |
1649 | tree rhs = gimple_assign_rhs1 (stmt); | |
1650 | tree base = get_base_address (rhs); | |
1651 | ||
1652 | /* Do not warn if it can be initialized outside this function. */ | |
1653 | if (TREE_CODE (base) != VAR_DECL | |
1654 | || DECL_HARD_REGISTER (base) | |
1655 | || is_global_var (base)) | |
1656 | continue; | |
1657 | ||
1658 | if (always_executed) | |
ea3c6c07 EB |
1659 | warn_uninit (OPT_Wuninitialized, use, |
1660 | gimple_assign_rhs1 (stmt), base, | |
8d2b0410 RG |
1661 | "%qE is used uninitialized in this function", |
1662 | stmt); | |
1663 | else if (warn_possibly_uninitialized) | |
ea3c6c07 EB |
1664 | warn_uninit (OPT_Wmaybe_uninitialized, use, |
1665 | gimple_assign_rhs1 (stmt), base, | |
8d2b0410 RG |
1666 | "%qE may be used uninitialized in this function", |
1667 | stmt); | |
1668 | } | |
726a989a | 1669 | } |
8cb3ee37 | 1670 | } |
e9d51dc6 | 1671 | |
c2924966 | 1672 | return 0; |
6de9cd9a DN |
1673 | } |
1674 | ||
de9a4397 MLI |
1675 | static unsigned int |
1676 | execute_early_warn_uninitialized (void) | |
1677 | { | |
1678 | /* Currently, this pass runs always but | |
1679 | execute_late_warn_uninitialized only runs with optimization. With | |
1680 | optimization we want to warn about possible uninitialized as late | |
1681 | as possible, thus don't do it here. However, without | |
1682 | optimization we need to warn here about "may be uninitialized". | |
1683 | */ | |
34f97b94 | 1684 | calculate_dominance_info (CDI_POST_DOMINATORS); |
6de9cd9a | 1685 | |
34f97b94 | 1686 | warn_uninitialized_vars (/*warn_possibly_uninitialized=*/!optimize); |
6de9cd9a | 1687 | |
34f97b94 XDL |
1688 | /* Post-dominator information can not be reliably updated. Free it |
1689 | after the use. */ | |
726a989a | 1690 | |
34f97b94 | 1691 | free_dominance_info (CDI_POST_DOMINATORS); |
c2924966 | 1692 | return 0; |
6de9cd9a DN |
1693 | } |
1694 | ||
1695 | static bool | |
1696 | gate_warn_uninitialized (void) | |
1697 | { | |
1698 | return warn_uninitialized != 0; | |
1699 | } | |
1700 | ||
8ddbbcae | 1701 | struct gimple_opt_pass pass_early_warn_uninitialized = |
6de9cd9a | 1702 | { |
8ddbbcae JH |
1703 | { |
1704 | GIMPLE_PASS, | |
e0a42b0f | 1705 | "*early_warn_uninitialized", /* name */ |
2b4e6bf1 | 1706 | OPTGROUP_NONE, /* optinfo_flags */ |
6de9cd9a DN |
1707 | gate_warn_uninitialized, /* gate */ |
1708 | execute_early_warn_uninitialized, /* execute */ | |
1709 | NULL, /* sub */ | |
1710 | NULL, /* next */ | |
1711 | 0, /* static_pass_number */ | |
a222c01a | 1712 | TV_TREE_UNINIT, /* tv_id */ |
6de9cd9a DN |
1713 | PROP_ssa, /* properties_required */ |
1714 | 0, /* properties_provided */ | |
1715 | 0, /* properties_destroyed */ | |
1716 | 0, /* todo_flags_start */ | |
8ddbbcae JH |
1717 | 0 /* todo_flags_finish */ |
1718 | } | |
6de9cd9a DN |
1719 | }; |
1720 | ||
70f34814 RG |
1721 | |
1722 | /* If necessary, rewrite the base of the reference tree *TP from | |
1723 | a MEM_REF to a plain or converted symbol. */ | |
1724 | ||
1725 | static void | |
13714310 | 1726 | maybe_rewrite_mem_ref_base (tree *tp, bitmap suitable_for_renaming) |
70f34814 RG |
1727 | { |
1728 | tree sym; | |
1729 | ||
1730 | while (handled_component_p (*tp)) | |
1731 | tp = &TREE_OPERAND (*tp, 0); | |
1732 | if (TREE_CODE (*tp) == MEM_REF | |
1733 | && TREE_CODE (TREE_OPERAND (*tp, 0)) == ADDR_EXPR | |
70f34814 RG |
1734 | && (sym = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0)) |
1735 | && DECL_P (sym) | |
1736 | && !TREE_ADDRESSABLE (sym) | |
13714310 | 1737 | && bitmap_bit_p (suitable_for_renaming, DECL_UID (sym))) |
70f34814 | 1738 | { |
b2ad5e37 RG |
1739 | if (TREE_CODE (TREE_TYPE (sym)) == VECTOR_TYPE |
1740 | && useless_type_conversion_p (TREE_TYPE (*tp), | |
1741 | TREE_TYPE (TREE_TYPE (sym))) | |
1742 | && multiple_of_p (sizetype, TREE_OPERAND (*tp, 1), | |
1743 | TYPE_SIZE_UNIT (TREE_TYPE (*tp)))) | |
1744 | { | |
1745 | *tp = build3 (BIT_FIELD_REF, TREE_TYPE (*tp), sym, | |
1746 | TYPE_SIZE (TREE_TYPE (*tp)), | |
1747 | int_const_binop (MULT_EXPR, | |
1748 | bitsize_int (BITS_PER_UNIT), | |
d35936ab | 1749 | TREE_OPERAND (*tp, 1))); |
b2ad5e37 | 1750 | } |
64a3d647 RG |
1751 | else if (TREE_CODE (TREE_TYPE (sym)) == COMPLEX_TYPE |
1752 | && useless_type_conversion_p (TREE_TYPE (*tp), | |
1753 | TREE_TYPE (TREE_TYPE (sym)))) | |
1754 | { | |
1755 | *tp = build1 (integer_zerop (TREE_OPERAND (*tp, 1)) | |
1756 | ? REALPART_EXPR : IMAGPART_EXPR, | |
1757 | TREE_TYPE (*tp), sym); | |
1758 | } | |
b2ad5e37 RG |
1759 | else if (integer_zerop (TREE_OPERAND (*tp, 1))) |
1760 | { | |
1761 | if (!useless_type_conversion_p (TREE_TYPE (*tp), | |
1762 | TREE_TYPE (sym))) | |
1763 | *tp = build1 (VIEW_CONVERT_EXPR, | |
1764 | TREE_TYPE (*tp), sym); | |
1765 | else | |
1766 | *tp = sym; | |
1767 | } | |
70f34814 RG |
1768 | } |
1769 | } | |
1770 | ||
ad650c92 RG |
1771 | /* For a tree REF return its base if it is the base of a MEM_REF |
1772 | that cannot be rewritten into SSA form. Otherwise return NULL_TREE. */ | |
1773 | ||
1774 | static tree | |
1775 | non_rewritable_mem_ref_base (tree ref) | |
1776 | { | |
1777 | tree base = ref; | |
1778 | ||
1779 | /* A plain decl does not need it set. */ | |
1780 | if (DECL_P (ref)) | |
1781 | return NULL_TREE; | |
1782 | ||
1783 | while (handled_component_p (base)) | |
1784 | base = TREE_OPERAND (base, 0); | |
1785 | ||
1786 | /* But watch out for MEM_REFs we cannot lower to a | |
b2ad5e37 | 1787 | VIEW_CONVERT_EXPR or a BIT_FIELD_REF. */ |
ad650c92 RG |
1788 | if (TREE_CODE (base) == MEM_REF |
1789 | && TREE_CODE (TREE_OPERAND (base, 0)) == ADDR_EXPR) | |
1790 | { | |
1791 | tree decl = TREE_OPERAND (TREE_OPERAND (base, 0), 0); | |
64a3d647 RG |
1792 | if ((TREE_CODE (TREE_TYPE (decl)) == VECTOR_TYPE |
1793 | || TREE_CODE (TREE_TYPE (decl)) == COMPLEX_TYPE) | |
b2ad5e37 RG |
1794 | && useless_type_conversion_p (TREE_TYPE (base), |
1795 | TREE_TYPE (TREE_TYPE (decl))) | |
27bcd47c LC |
1796 | && mem_ref_offset (base).fits_uhwi () |
1797 | && tree_to_double_int (TYPE_SIZE_UNIT (TREE_TYPE (decl))) | |
1798 | .ugt (mem_ref_offset (base)) | |
b2ad5e37 RG |
1799 | && multiple_of_p (sizetype, TREE_OPERAND (base, 1), |
1800 | TYPE_SIZE_UNIT (TREE_TYPE (base)))) | |
1801 | return NULL_TREE; | |
ad650c92 RG |
1802 | if (DECL_P (decl) |
1803 | && (!integer_zerop (TREE_OPERAND (base, 1)) | |
1804 | || (DECL_SIZE (decl) | |
02ff830b RG |
1805 | != TYPE_SIZE (TREE_TYPE (base))) |
1806 | || TREE_THIS_VOLATILE (decl) != TREE_THIS_VOLATILE (base))) | |
ad650c92 RG |
1807 | return decl; |
1808 | } | |
1809 | ||
1810 | return NULL_TREE; | |
1811 | } | |
1812 | ||
c0aae19c RG |
1813 | /* For an lvalue tree LHS return true if it cannot be rewritten into SSA form. |
1814 | Otherwise return true. */ | |
1815 | ||
1816 | static bool | |
1817 | non_rewritable_lvalue_p (tree lhs) | |
1818 | { | |
1819 | /* A plain decl is always rewritable. */ | |
1820 | if (DECL_P (lhs)) | |
1821 | return false; | |
1822 | ||
1823 | /* A decl that is wrapped inside a MEM-REF that covers | |
1824 | it full is also rewritable. | |
1825 | ??? The following could be relaxed allowing component | |
62902f3f | 1826 | references that do not change the access size. */ |
c0aae19c RG |
1827 | if (TREE_CODE (lhs) == MEM_REF |
1828 | && TREE_CODE (TREE_OPERAND (lhs, 0)) == ADDR_EXPR | |
1829 | && integer_zerop (TREE_OPERAND (lhs, 1))) | |
1830 | { | |
1831 | tree decl = TREE_OPERAND (TREE_OPERAND (lhs, 0), 0); | |
1832 | if (DECL_P (decl) | |
1833 | && DECL_SIZE (decl) == TYPE_SIZE (TREE_TYPE (lhs)) | |
1834 | && (TREE_THIS_VOLATILE (decl) == TREE_THIS_VOLATILE (lhs))) | |
1835 | return false; | |
1836 | } | |
1837 | ||
1838 | return true; | |
1839 | } | |
1840 | ||
f61c8291 EB |
1841 | /* When possible, clear TREE_ADDRESSABLE bit or set DECL_GIMPLE_REG_P bit and |
1842 | mark the variable VAR for conversion into SSA. Return true when updating | |
1843 | stmts is required. */ | |
ad650c92 | 1844 | |
13714310 RG |
1845 | static void |
1846 | maybe_optimize_var (tree var, bitmap addresses_taken, bitmap not_reg_needs, | |
1847 | bitmap suitable_for_renaming) | |
ad650c92 | 1848 | { |
ad650c92 RG |
1849 | /* Global Variables, result decls cannot be changed. */ |
1850 | if (is_global_var (var) | |
1851 | || TREE_CODE (var) == RESULT_DECL | |
1852 | || bitmap_bit_p (addresses_taken, DECL_UID (var))) | |
13714310 | 1853 | return; |
3f2930d8 | 1854 | |
ad650c92 RG |
1855 | if (TREE_ADDRESSABLE (var) |
1856 | /* Do not change TREE_ADDRESSABLE if we need to preserve var as | |
1857 | a non-register. Otherwise we are confused and forget to | |
1858 | add virtual operands for it. */ | |
1859 | && (!is_gimple_reg_type (TREE_TYPE (var)) | |
9a6b63c3 JJ |
1860 | || TREE_CODE (TREE_TYPE (var)) == VECTOR_TYPE |
1861 | || TREE_CODE (TREE_TYPE (var)) == COMPLEX_TYPE | |
ad650c92 RG |
1862 | || !bitmap_bit_p (not_reg_needs, DECL_UID (var)))) |
1863 | { | |
1864 | TREE_ADDRESSABLE (var) = 0; | |
1865 | if (is_gimple_reg (var)) | |
13714310 | 1866 | bitmap_set_bit (suitable_for_renaming, DECL_UID (var)); |
ad650c92 RG |
1867 | if (dump_file) |
1868 | { | |
f61c8291 | 1869 | fprintf (dump_file, "No longer having address taken: "); |
ad650c92 RG |
1870 | print_generic_expr (dump_file, var, 0); |
1871 | fprintf (dump_file, "\n"); | |
1872 | } | |
1873 | } | |
f61c8291 | 1874 | |
ad650c92 RG |
1875 | if (!DECL_GIMPLE_REG_P (var) |
1876 | && !bitmap_bit_p (not_reg_needs, DECL_UID (var)) | |
1877 | && (TREE_CODE (TREE_TYPE (var)) == COMPLEX_TYPE | |
1878 | || TREE_CODE (TREE_TYPE (var)) == VECTOR_TYPE) | |
1879 | && !TREE_THIS_VOLATILE (var) | |
1880 | && (TREE_CODE (var) != VAR_DECL || !DECL_HARD_REGISTER (var))) | |
1881 | { | |
1882 | DECL_GIMPLE_REG_P (var) = 1; | |
13714310 | 1883 | bitmap_set_bit (suitable_for_renaming, DECL_UID (var)); |
ad650c92 RG |
1884 | if (dump_file) |
1885 | { | |
f61c8291 | 1886 | fprintf (dump_file, "Now a gimple register: "); |
ad650c92 RG |
1887 | print_generic_expr (dump_file, var, 0); |
1888 | fprintf (dump_file, "\n"); | |
1889 | } | |
1890 | } | |
ad650c92 RG |
1891 | } |
1892 | ||
f22b7039 | 1893 | /* Compute TREE_ADDRESSABLE and DECL_GIMPLE_REG_P for local variables. */ |
201b2ead | 1894 | |
5006671f | 1895 | void |
f61c8291 | 1896 | execute_update_addresses_taken (void) |
201b2ead | 1897 | { |
726a989a | 1898 | gimple_stmt_iterator gsi; |
201b2ead JH |
1899 | basic_block bb; |
1900 | bitmap addresses_taken = BITMAP_ALLOC (NULL); | |
f22b7039 | 1901 | bitmap not_reg_needs = BITMAP_ALLOC (NULL); |
13714310 | 1902 | bitmap suitable_for_renaming = BITMAP_ALLOC (NULL); |
f61c8291 | 1903 | tree var; |
ad650c92 | 1904 | unsigned i; |
201b2ead | 1905 | |
a222c01a MM |
1906 | timevar_push (TV_ADDRESS_TAKEN); |
1907 | ||
201b2ead JH |
1908 | /* Collect into ADDRESSES_TAKEN all variables whose address is taken within |
1909 | the function body. */ | |
1910 | FOR_EACH_BB (bb) | |
1911 | { | |
726a989a | 1912 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
201b2ead | 1913 | { |
ccacdf06 | 1914 | gimple stmt = gsi_stmt (gsi); |
f22b7039 | 1915 | enum gimple_code code = gimple_code (stmt); |
ad650c92 | 1916 | tree decl; |
ccacdf06 RG |
1917 | |
1918 | /* Note all addresses taken by the stmt. */ | |
1919 | gimple_ior_addresses_taken (addresses_taken, stmt); | |
1920 | ||
f22b7039 AP |
1921 | /* If we have a call or an assignment, see if the lhs contains |
1922 | a local decl that requires not to be a gimple register. */ | |
1923 | if (code == GIMPLE_ASSIGN || code == GIMPLE_CALL) | |
1924 | { | |
fff1894c | 1925 | tree lhs = gimple_get_lhs (stmt); |
c0aae19c RG |
1926 | if (lhs |
1927 | && TREE_CODE (lhs) != SSA_NAME | |
1928 | && non_rewritable_lvalue_p (lhs)) | |
70f34814 | 1929 | { |
c0aae19c RG |
1930 | decl = get_base_address (lhs); |
1931 | if (DECL_P (decl)) | |
1932 | bitmap_set_bit (not_reg_needs, DECL_UID (decl)); | |
70f34814 RG |
1933 | } |
1934 | } | |
1935 | ||
1936 | if (gimple_assign_single_p (stmt)) | |
1937 | { | |
1938 | tree rhs = gimple_assign_rhs1 (stmt); | |
ad650c92 RG |
1939 | if ((decl = non_rewritable_mem_ref_base (rhs))) |
1940 | bitmap_set_bit (not_reg_needs, DECL_UID (decl)); | |
1941 | } | |
fff1894c | 1942 | |
ad650c92 RG |
1943 | else if (code == GIMPLE_CALL) |
1944 | { | |
1945 | for (i = 0; i < gimple_call_num_args (stmt); ++i) | |
70f34814 | 1946 | { |
ad650c92 RG |
1947 | tree arg = gimple_call_arg (stmt, i); |
1948 | if ((decl = non_rewritable_mem_ref_base (arg))) | |
1949 | bitmap_set_bit (not_reg_needs, DECL_UID (decl)); | |
1950 | } | |
1951 | } | |
1952 | ||
1953 | else if (code == GIMPLE_ASM) | |
1954 | { | |
1955 | for (i = 0; i < gimple_asm_noutputs (stmt); ++i) | |
1956 | { | |
1957 | tree link = gimple_asm_output_op (stmt, i); | |
e5160e93 | 1958 | tree lhs = TREE_VALUE (link); |
62902f3f | 1959 | if (TREE_CODE (lhs) != SSA_NAME) |
e5160e93 | 1960 | { |
c0aae19c | 1961 | decl = get_base_address (lhs); |
62902f3f RG |
1962 | if (DECL_P (decl) |
1963 | && (non_rewritable_lvalue_p (lhs) | |
1964 | /* We cannot move required conversions from | |
1965 | the lhs to the rhs in asm statements, so | |
1966 | require we do not need any. */ | |
1967 | || !useless_type_conversion_p | |
1968 | (TREE_TYPE (lhs), TREE_TYPE (decl)))) | |
c0aae19c | 1969 | bitmap_set_bit (not_reg_needs, DECL_UID (decl)); |
e5160e93 | 1970 | } |
ad650c92 RG |
1971 | } |
1972 | for (i = 0; i < gimple_asm_ninputs (stmt); ++i) | |
1973 | { | |
1974 | tree link = gimple_asm_input_op (stmt, i); | |
1975 | if ((decl = non_rewritable_mem_ref_base (TREE_VALUE (link)))) | |
1976 | bitmap_set_bit (not_reg_needs, DECL_UID (decl)); | |
1977 | } | |
f22b7039 | 1978 | } |
201b2ead | 1979 | } |
726a989a RB |
1980 | |
1981 | for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
201b2ead | 1982 | { |
726a989a RB |
1983 | size_t i; |
1984 | gimple phi = gsi_stmt (gsi); | |
1985 | ||
1986 | for (i = 0; i < gimple_phi_num_args (phi); i++) | |
201b2ead JH |
1987 | { |
1988 | tree op = PHI_ARG_DEF (phi, i), var; | |
1989 | if (TREE_CODE (op) == ADDR_EXPR | |
726a989a | 1990 | && (var = get_base_address (TREE_OPERAND (op, 0))) != NULL |
201b2ead JH |
1991 | && DECL_P (var)) |
1992 | bitmap_set_bit (addresses_taken, DECL_UID (var)); | |
1993 | } | |
1994 | } | |
1995 | } | |
1996 | ||
f61c8291 EB |
1997 | /* We cannot iterate over all referenced vars because that can contain |
1998 | unused vars from BLOCK trees, which causes code generation differences | |
1999 | for -g vs. -g0. */ | |
2000 | for (var = DECL_ARGUMENTS (cfun->decl); var; var = DECL_CHAIN (var)) | |
13714310 RG |
2001 | maybe_optimize_var (var, addresses_taken, not_reg_needs, |
2002 | suitable_for_renaming); | |
f61c8291 | 2003 | |
9771b263 | 2004 | FOR_EACH_VEC_SAFE_ELT (cfun->local_decls, i, var) |
13714310 RG |
2005 | maybe_optimize_var (var, addresses_taken, not_reg_needs, |
2006 | suitable_for_renaming); | |
201b2ead | 2007 | |
f61c8291 | 2008 | /* Operand caches need to be recomputed for operands referencing the updated |
13714310 RG |
2009 | variables and operands need to be rewritten to expose bare symbols. */ |
2010 | if (!bitmap_empty_p (suitable_for_renaming)) | |
5006671f RG |
2011 | { |
2012 | FOR_EACH_BB (bb) | |
c32f25b8 | 2013 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi);) |
70f34814 RG |
2014 | { |
2015 | gimple stmt = gsi_stmt (gsi); | |
5006671f | 2016 | |
70f34814 RG |
2017 | /* Re-write TARGET_MEM_REFs of symbols we want to |
2018 | rewrite into SSA form. */ | |
2019 | if (gimple_assign_single_p (stmt)) | |
2020 | { | |
2021 | tree lhs = gimple_assign_lhs (stmt); | |
2022 | tree rhs, *rhsp = gimple_assign_rhs1_ptr (stmt); | |
2023 | tree sym; | |
2024 | ||
2025 | /* We shouldn't have any fancy wrapping of | |
2026 | component-refs on the LHS, but look through | |
2027 | VIEW_CONVERT_EXPRs as that is easy. */ | |
2028 | while (TREE_CODE (lhs) == VIEW_CONVERT_EXPR) | |
2029 | lhs = TREE_OPERAND (lhs, 0); | |
2030 | if (TREE_CODE (lhs) == MEM_REF | |
2031 | && TREE_CODE (TREE_OPERAND (lhs, 0)) == ADDR_EXPR | |
2032 | && integer_zerop (TREE_OPERAND (lhs, 1)) | |
2033 | && (sym = TREE_OPERAND (TREE_OPERAND (lhs, 0), 0)) | |
2034 | && DECL_P (sym) | |
2035 | && !TREE_ADDRESSABLE (sym) | |
13714310 | 2036 | && bitmap_bit_p (suitable_for_renaming, DECL_UID (sym))) |
70f34814 RG |
2037 | lhs = sym; |
2038 | else | |
2039 | lhs = gimple_assign_lhs (stmt); | |
2040 | ||
2041 | /* Rewrite the RHS and make sure the resulting assignment | |
2042 | is validly typed. */ | |
13714310 | 2043 | maybe_rewrite_mem_ref_base (rhsp, suitable_for_renaming); |
70f34814 RG |
2044 | rhs = gimple_assign_rhs1 (stmt); |
2045 | if (gimple_assign_lhs (stmt) != lhs | |
2046 | && !useless_type_conversion_p (TREE_TYPE (lhs), | |
2047 | TREE_TYPE (rhs))) | |
2048 | rhs = fold_build1 (VIEW_CONVERT_EXPR, | |
2049 | TREE_TYPE (lhs), rhs); | |
2050 | ||
2051 | if (gimple_assign_lhs (stmt) != lhs) | |
2052 | gimple_assign_set_lhs (stmt, lhs); | |
2053 | ||
c32f25b8 JJ |
2054 | /* For var ={v} {CLOBBER}; where var lost |
2055 | TREE_ADDRESSABLE just remove the stmt. */ | |
2056 | if (DECL_P (lhs) | |
2057 | && TREE_CLOBBER_P (rhs) | |
13714310 | 2058 | && bitmap_bit_p (suitable_for_renaming, DECL_UID (lhs))) |
c32f25b8 JJ |
2059 | { |
2060 | unlink_stmt_vdef (stmt); | |
2061 | gsi_remove (&gsi, true); | |
2062 | release_defs (stmt); | |
2063 | continue; | |
2064 | } | |
2065 | ||
70f34814 RG |
2066 | if (gimple_assign_rhs1 (stmt) != rhs) |
2067 | { | |
2068 | gimple_stmt_iterator gsi = gsi_for_stmt (stmt); | |
2069 | gimple_assign_set_rhs_from_tree (&gsi, rhs); | |
2070 | } | |
2071 | } | |
2072 | ||
ad650c92 RG |
2073 | else if (gimple_code (stmt) == GIMPLE_CALL) |
2074 | { | |
2075 | unsigned i; | |
2076 | for (i = 0; i < gimple_call_num_args (stmt); ++i) | |
2077 | { | |
2078 | tree *argp = gimple_call_arg_ptr (stmt, i); | |
13714310 | 2079 | maybe_rewrite_mem_ref_base (argp, suitable_for_renaming); |
ad650c92 RG |
2080 | } |
2081 | } | |
2082 | ||
2083 | else if (gimple_code (stmt) == GIMPLE_ASM) | |
70f34814 RG |
2084 | { |
2085 | unsigned i; | |
2086 | for (i = 0; i < gimple_asm_noutputs (stmt); ++i) | |
2087 | { | |
2088 | tree link = gimple_asm_output_op (stmt, i); | |
13714310 RG |
2089 | maybe_rewrite_mem_ref_base (&TREE_VALUE (link), |
2090 | suitable_for_renaming); | |
70f34814 RG |
2091 | } |
2092 | for (i = 0; i < gimple_asm_ninputs (stmt); ++i) | |
2093 | { | |
2094 | tree link = gimple_asm_input_op (stmt, i); | |
13714310 RG |
2095 | maybe_rewrite_mem_ref_base (&TREE_VALUE (link), |
2096 | suitable_for_renaming); | |
70f34814 RG |
2097 | } |
2098 | } | |
2099 | ||
116bc3a4 JJ |
2100 | else if (gimple_debug_bind_p (stmt) |
2101 | && gimple_debug_bind_has_value_p (stmt)) | |
2102 | { | |
2103 | tree *valuep = gimple_debug_bind_get_value_ptr (stmt); | |
2104 | tree decl; | |
13714310 | 2105 | maybe_rewrite_mem_ref_base (valuep, suitable_for_renaming); |
116bc3a4 | 2106 | decl = non_rewritable_mem_ref_base (*valuep); |
13714310 RG |
2107 | if (decl |
2108 | && bitmap_bit_p (suitable_for_renaming, DECL_UID (decl))) | |
116bc3a4 JJ |
2109 | gimple_debug_bind_reset_value (stmt); |
2110 | } | |
2111 | ||
70f34814 RG |
2112 | if (gimple_references_memory_p (stmt) |
2113 | || is_gimple_debug (stmt)) | |
2114 | update_stmt (stmt); | |
c32f25b8 JJ |
2115 | |
2116 | gsi_next (&gsi); | |
70f34814 | 2117 | } |
5006671f RG |
2118 | |
2119 | /* Update SSA form here, we are called as non-pass as well. */ | |
0fc822d0 RB |
2120 | if (number_of_loops (cfun) > 1 |
2121 | && loops_state_satisfies_p (LOOP_CLOSED_SSA)) | |
94e3faf6 JJ |
2122 | rewrite_into_loop_closed_ssa (NULL, TODO_update_ssa); |
2123 | else | |
2124 | update_ssa (TODO_update_ssa); | |
5006671f | 2125 | } |
201b2ead | 2126 | |
f22b7039 | 2127 | BITMAP_FREE (not_reg_needs); |
201b2ead | 2128 | BITMAP_FREE (addresses_taken); |
13714310 | 2129 | BITMAP_FREE (suitable_for_renaming); |
a222c01a | 2130 | timevar_pop (TV_ADDRESS_TAKEN); |
201b2ead JH |
2131 | } |
2132 | ||
8ddbbcae | 2133 | struct gimple_opt_pass pass_update_address_taken = |
201b2ead | 2134 | { |
8ddbbcae JH |
2135 | { |
2136 | GIMPLE_PASS, | |
201b2ead | 2137 | "addressables", /* name */ |
2b4e6bf1 | 2138 | OPTGROUP_NONE, /* optinfo_flags */ |
201b2ead | 2139 | NULL, /* gate */ |
5006671f | 2140 | NULL, /* execute */ |
201b2ead JH |
2141 | NULL, /* sub */ |
2142 | NULL, /* next */ | |
2143 | 0, /* static_pass_number */ | |
a222c01a | 2144 | TV_ADDRESS_TAKEN, /* tv_id */ |
201b2ead JH |
2145 | PROP_ssa, /* properties_required */ |
2146 | 0, /* properties_provided */ | |
2147 | 0, /* properties_destroyed */ | |
2148 | 0, /* todo_flags_start */ | |
22c5fa5f | 2149 | TODO_update_address_taken /* todo_flags_finish */ |
8ddbbcae | 2150 | } |
201b2ead | 2151 | }; |