]>
Commit | Line | Data |
---|---|---|
4ee9c684 | 1 | /* Miscellaneous SSA utility functions. |
3aea1f79 | 2 | Copyright (C) 2001-2014 Free Software Foundation, Inc. |
4ee9c684 | 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 | |
8c4c00c1 | 8 | the Free Software Foundation; either version 3, or (at your option) |
4ee9c684 | 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 | |
8c4c00c1 | 17 | along with GCC; see the file COPYING3. If not see |
18 | <http://www.gnu.org/licenses/>. */ | |
4ee9c684 | 19 | |
20 | #include "config.h" | |
21 | #include "system.h" | |
22 | #include "coretypes.h" | |
23 | #include "tm.h" | |
24 | #include "tree.h" | |
9ed99284 | 25 | #include "stor-layout.h" |
4ee9c684 | 26 | #include "flags.h" |
4ee9c684 | 27 | #include "tm_p.h" |
9fa67218 | 28 | #include "target.h" |
4ee9c684 | 29 | #include "langhooks.h" |
4ee9c684 | 30 | #include "basic-block.h" |
4ee9c684 | 31 | #include "function.h" |
ce084dfc | 32 | #include "gimple-pretty-print.h" |
dd940949 | 33 | #include "pointer-set.h" |
bc61cadb | 34 | #include "tree-ssa-alias.h" |
35 | #include "internal-fn.h" | |
36 | #include "gimple-fold.h" | |
37 | #include "gimple-expr.h" | |
38 | #include "is-a.h" | |
75a70cf9 | 39 | #include "gimple.h" |
a8783bee | 40 | #include "gimplify.h" |
dcf1a1ec | 41 | #include "gimple-iterator.h" |
42 | #include "gimple-walk.h" | |
073c1fd5 | 43 | #include "gimple-ssa.h" |
44 | #include "tree-phinodes.h" | |
45 | #include "ssa-iterators.h" | |
9ed99284 | 46 | #include "stringpool.h" |
073c1fd5 | 47 | #include "tree-ssanames.h" |
05d9c18a | 48 | #include "tree-ssa-loop-manip.h" |
073c1fd5 | 49 | #include "tree-into-ssa.h" |
50 | #include "tree-ssa.h" | |
4ee9c684 | 51 | #include "tree-inline.h" |
4ee9c684 | 52 | #include "hashtab.h" |
4ee9c684 | 53 | #include "tree-pass.h" |
0b205f4c | 54 | #include "diagnostic-core.h" |
0ab72b53 | 55 | #include "cfgloop.h" |
e797f49f | 56 | #include "cfgexpand.h" |
4ee9c684 | 57 | |
d03ba86f | 58 | /* Pointer map of variable mappings, keyed by edge. */ |
59 | static struct pointer_map_t *edge_var_maps; | |
60 | ||
61 | ||
62 | /* Add a mapping with PHI RESULT and PHI DEF associated with edge E. */ | |
63 | ||
64 | void | |
60d535d2 | 65 | redirect_edge_var_map_add (edge e, tree result, tree def, source_location locus) |
d03ba86f | 66 | { |
67 | void **slot; | |
f1f41a6c | 68 | edge_var_map_vector *head; |
d03ba86f | 69 | edge_var_map new_node; |
70 | ||
71 | if (edge_var_maps == NULL) | |
72 | edge_var_maps = pointer_map_create (); | |
73 | ||
74 | slot = pointer_map_insert (edge_var_maps, e); | |
f1f41a6c | 75 | head = (edge_var_map_vector *) *slot; |
d03ba86f | 76 | if (!head) |
dcd56d11 | 77 | vec_safe_reserve (head, 5); |
d03ba86f | 78 | new_node.def = def; |
79 | new_node.result = result; | |
efbcb6de | 80 | new_node.locus = locus; |
d03ba86f | 81 | |
dcd56d11 | 82 | vec_safe_push (head, new_node); |
83 | *slot = head; | |
d03ba86f | 84 | } |
85 | ||
86 | ||
87 | /* Clear the var mappings in edge E. */ | |
88 | ||
89 | void | |
90 | redirect_edge_var_map_clear (edge e) | |
91 | { | |
92 | void **slot; | |
f1f41a6c | 93 | edge_var_map_vector *head; |
d03ba86f | 94 | |
95 | if (!edge_var_maps) | |
96 | return; | |
97 | ||
98 | slot = pointer_map_contains (edge_var_maps, e); | |
99 | ||
100 | if (slot) | |
101 | { | |
f1f41a6c | 102 | head = (edge_var_map_vector *) *slot; |
dcd56d11 | 103 | vec_free (head); |
d03ba86f | 104 | *slot = NULL; |
105 | } | |
106 | } | |
107 | ||
108 | ||
109 | /* Duplicate the redirected var mappings in OLDE in NEWE. | |
110 | ||
111 | Since we can't remove a mapping, let's just duplicate it. This assumes a | |
112 | pointer_map can have multiple edges mapping to the same var_map (many to | |
113 | one mapping), since we don't remove the previous mappings. */ | |
114 | ||
115 | void | |
116 | redirect_edge_var_map_dup (edge newe, edge olde) | |
117 | { | |
182db9cf | 118 | void **new_slot, **old_slot; |
f1f41a6c | 119 | edge_var_map_vector *head; |
d03ba86f | 120 | |
121 | if (!edge_var_maps) | |
122 | return; | |
123 | ||
124 | new_slot = pointer_map_insert (edge_var_maps, newe); | |
125 | old_slot = pointer_map_contains (edge_var_maps, olde); | |
126 | if (!old_slot) | |
127 | return; | |
f1f41a6c | 128 | head = (edge_var_map_vector *) *old_slot; |
d03ba86f | 129 | |
dcd56d11 | 130 | edge_var_map_vector *new_head = NULL; |
d03ba86f | 131 | if (head) |
dcd56d11 | 132 | new_head = vec_safe_copy (head); |
d03ba86f | 133 | else |
dcd56d11 | 134 | vec_safe_reserve (new_head, 5); |
f1f41a6c | 135 | *new_slot = new_head; |
d03ba86f | 136 | } |
137 | ||
138 | ||
f0b5f617 | 139 | /* Return the variable mappings for a given edge. If there is none, return |
d03ba86f | 140 | NULL. */ |
141 | ||
f1f41a6c | 142 | edge_var_map_vector * |
d03ba86f | 143 | redirect_edge_var_map_vector (edge e) |
144 | { | |
145 | void **slot; | |
146 | ||
147 | /* Hey, what kind of idiot would... you'd be surprised. */ | |
148 | if (!edge_var_maps) | |
149 | return NULL; | |
150 | ||
151 | slot = pointer_map_contains (edge_var_maps, e); | |
152 | if (!slot) | |
153 | return NULL; | |
154 | ||
f1f41a6c | 155 | return (edge_var_map_vector *) *slot; |
d03ba86f | 156 | } |
157 | ||
182db9cf | 158 | /* Used by redirect_edge_var_map_destroy to free all memory. */ |
159 | ||
160 | static bool | |
161 | free_var_map_entry (const void *key ATTRIBUTE_UNUSED, | |
162 | void **value, | |
163 | void *data ATTRIBUTE_UNUSED) | |
164 | { | |
f1f41a6c | 165 | edge_var_map_vector *head = (edge_var_map_vector *) *value; |
dcd56d11 | 166 | vec_free (head); |
182db9cf | 167 | return true; |
168 | } | |
d03ba86f | 169 | |
170 | /* Clear the edge variable mappings. */ | |
171 | ||
172 | void | |
173 | redirect_edge_var_map_destroy (void) | |
174 | { | |
175 | if (edge_var_maps) | |
176 | { | |
182db9cf | 177 | pointer_map_traverse (edge_var_maps, free_var_map_entry, NULL); |
d03ba86f | 178 | pointer_map_destroy (edge_var_maps); |
179 | edge_var_maps = NULL; | |
180 | } | |
181 | } | |
182 | ||
183 | ||
a61b7bc4 | 184 | /* Remove the corresponding arguments from the PHI nodes in E's |
185 | destination block and redirect it to DEST. Return redirected edge. | |
d03ba86f | 186 | The list of removed arguments is stored in a vector accessed |
187 | through edge_var_maps. */ | |
4ee9c684 | 188 | |
189 | edge | |
190 | ssa_redirect_edge (edge e, basic_block dest) | |
191 | { | |
75a70cf9 | 192 | gimple_stmt_iterator gsi; |
193 | gimple phi; | |
d03ba86f | 194 | |
195 | redirect_edge_var_map_clear (e); | |
4ee9c684 | 196 | |
197 | /* Remove the appropriate PHI arguments in E's destination block. */ | |
75a70cf9 | 198 | for (gsi = gsi_start_phis (e->dest); !gsi_end_p (gsi); gsi_next (&gsi)) |
4ee9c684 | 199 | { |
75a70cf9 | 200 | tree def; |
efbcb6de | 201 | source_location locus ; |
75a70cf9 | 202 | |
203 | phi = gsi_stmt (gsi); | |
204 | def = gimple_phi_arg_def (phi, e->dest_idx); | |
efbcb6de | 205 | locus = gimple_phi_arg_location (phi, e->dest_idx); |
d03ba86f | 206 | |
207 | if (def == NULL_TREE) | |
4ee9c684 | 208 | continue; |
209 | ||
60d535d2 | 210 | redirect_edge_var_map_add (e, gimple_phi_result (phi), def, locus); |
4ee9c684 | 211 | } |
212 | ||
213 | e = redirect_edge_succ_nodup (e, dest); | |
4ee9c684 | 214 | |
215 | return e; | |
216 | } | |
217 | ||
75a70cf9 | 218 | |
4fb5e5ca | 219 | /* Add PHI arguments queued in PENDING_STMT list on edge E to edge |
44a46103 | 220 | E->dest. */ |
221 | ||
222 | void | |
223 | flush_pending_stmts (edge e) | |
224 | { | |
75a70cf9 | 225 | gimple phi; |
f1f41a6c | 226 | edge_var_map_vector *v; |
d03ba86f | 227 | edge_var_map *vm; |
228 | int i; | |
75a70cf9 | 229 | gimple_stmt_iterator gsi; |
44a46103 | 230 | |
d03ba86f | 231 | v = redirect_edge_var_map_vector (e); |
232 | if (!v) | |
44a46103 | 233 | return; |
234 | ||
75a70cf9 | 235 | for (gsi = gsi_start_phis (e->dest), i = 0; |
f1f41a6c | 236 | !gsi_end_p (gsi) && v->iterate (i, &vm); |
75a70cf9 | 237 | gsi_next (&gsi), i++) |
44a46103 | 238 | { |
75a70cf9 | 239 | tree def; |
240 | ||
241 | phi = gsi_stmt (gsi); | |
242 | def = redirect_edge_var_map_def (vm); | |
60d535d2 | 243 | add_phi_arg (phi, def, e, redirect_edge_var_map_location (vm)); |
44a46103 | 244 | } |
245 | ||
d03ba86f | 246 | redirect_edge_var_map_clear (e); |
44a46103 | 247 | } |
4ee9c684 | 248 | |
9a4a3348 | 249 | /* Replace the LHS of STMT, an assignment, either a GIMPLE_ASSIGN or a |
250 | GIMPLE_CALL, with NLHS, in preparation for modifying the RHS to an | |
251 | expression with a different value. | |
252 | ||
253 | This will update any annotations (say debug bind stmts) referring | |
254 | to the original LHS, so that they use the RHS instead. This is | |
255 | done even if NLHS and LHS are the same, for it is understood that | |
256 | the RHS will be modified afterwards, and NLHS will not be assigned | |
257 | an equivalent value. | |
258 | ||
259 | Adjusting any non-annotation uses of the LHS, if needed, is a | |
260 | responsibility of the caller. | |
261 | ||
262 | The effect of this call should be pretty much the same as that of | |
263 | inserting a copy of STMT before STMT, and then removing the | |
264 | original stmt, at which time gsi_remove() would have update | |
265 | annotations, but using this function saves all the inserting, | |
266 | copying and removing. */ | |
267 | ||
268 | void | |
269 | gimple_replace_ssa_lhs (gimple stmt, tree nlhs) | |
270 | { | |
271 | if (MAY_HAVE_DEBUG_STMTS) | |
272 | { | |
273 | tree lhs = gimple_get_lhs (stmt); | |
274 | ||
275 | gcc_assert (SSA_NAME_DEF_STMT (lhs) == stmt); | |
276 | ||
277 | insert_debug_temp_for_var_def (NULL, lhs); | |
278 | } | |
279 | ||
280 | gimple_set_lhs (stmt, nlhs); | |
281 | } | |
282 | ||
283 | ||
9845d120 | 284 | /* Given a tree for an expression for which we might want to emit |
285 | locations or values in debug information (generally a variable, but | |
286 | we might deal with other kinds of trees in the future), return the | |
287 | tree that should be used as the variable of a DEBUG_BIND STMT or | |
288 | VAR_LOCATION INSN or NOTE. Return NULL if VAR is not to be tracked. */ | |
289 | ||
290 | tree | |
291 | target_for_debug_bind (tree var) | |
292 | { | |
293 | if (!MAY_HAVE_DEBUG_STMTS) | |
294 | return NULL_TREE; | |
295 | ||
ec11736b | 296 | if (TREE_CODE (var) == SSA_NAME) |
297 | { | |
298 | var = SSA_NAME_VAR (var); | |
299 | if (var == NULL_TREE) | |
300 | return NULL_TREE; | |
301 | } | |
302 | ||
b03e5397 | 303 | if ((TREE_CODE (var) != VAR_DECL |
304 | || VAR_DECL_IS_VIRTUAL_OPERAND (var)) | |
9845d120 | 305 | && TREE_CODE (var) != PARM_DECL) |
306 | return NULL_TREE; | |
307 | ||
308 | if (DECL_HAS_VALUE_EXPR_P (var)) | |
309 | return target_for_debug_bind (DECL_VALUE_EXPR (var)); | |
310 | ||
311 | if (DECL_IGNORED_P (var)) | |
312 | return NULL_TREE; | |
313 | ||
b03e5397 | 314 | /* var-tracking only tracks registers. */ |
315 | if (!is_gimple_reg_type (TREE_TYPE (var))) | |
316 | return NULL_TREE; | |
9845d120 | 317 | |
318 | return var; | |
319 | } | |
320 | ||
321 | /* Called via walk_tree, look for SSA_NAMEs that have already been | |
322 | released. */ | |
323 | ||
324 | static tree | |
325 | find_released_ssa_name (tree *tp, int *walk_subtrees, void *data_) | |
326 | { | |
327 | struct walk_stmt_info *wi = (struct walk_stmt_info *) data_; | |
328 | ||
43e54ec3 | 329 | if (wi && wi->is_lhs) |
9845d120 | 330 | return NULL_TREE; |
331 | ||
332 | if (TREE_CODE (*tp) == SSA_NAME) | |
333 | { | |
334 | if (SSA_NAME_IN_FREE_LIST (*tp)) | |
335 | return *tp; | |
336 | ||
337 | *walk_subtrees = 0; | |
338 | } | |
339 | else if (IS_TYPE_OR_DECL_P (*tp)) | |
340 | *walk_subtrees = 0; | |
341 | ||
342 | return NULL_TREE; | |
343 | } | |
344 | ||
688ff29b | 345 | /* Insert a DEBUG BIND stmt before the DEF of VAR if VAR is referenced |
346 | by other DEBUG stmts, and replace uses of the DEF with the | |
347 | newly-created debug temp. */ | |
348 | ||
9845d120 | 349 | void |
688ff29b | 350 | insert_debug_temp_for_var_def (gimple_stmt_iterator *gsi, tree var) |
9845d120 | 351 | { |
352 | imm_use_iterator imm_iter; | |
9845d120 | 353 | use_operand_p use_p; |
688ff29b | 354 | gimple stmt; |
355 | gimple def_stmt = NULL; | |
356 | int usecount = 0; | |
9845d120 | 357 | tree value = NULL; |
9845d120 | 358 | |
359 | if (!MAY_HAVE_DEBUG_STMTS) | |
360 | return; | |
361 | ||
afed704c | 362 | /* If this name has already been registered for replacement, do nothing |
363 | as anything that uses this name isn't in SSA form. */ | |
364 | if (name_registered_for_update_p (var)) | |
365 | return; | |
366 | ||
367 | /* Check whether there are debug stmts that reference this variable and, | |
368 | if there are, decide whether we should use a debug temp. */ | |
688ff29b | 369 | FOR_EACH_IMM_USE_FAST (use_p, imm_iter, var) |
9845d120 | 370 | { |
688ff29b | 371 | stmt = USE_STMT (use_p); |
9845d120 | 372 | |
688ff29b | 373 | if (!gimple_debug_bind_p (stmt)) |
9845d120 | 374 | continue; |
375 | ||
688ff29b | 376 | if (usecount++) |
377 | break; | |
378 | ||
379 | if (gimple_debug_bind_get_value (stmt) != var) | |
9845d120 | 380 | { |
688ff29b | 381 | /* Count this as an additional use, so as to make sure we |
382 | use a temp unless VAR's definition has a SINGLE_RHS that | |
383 | can be shared. */ | |
384 | usecount++; | |
385 | break; | |
386 | } | |
387 | } | |
9845d120 | 388 | |
688ff29b | 389 | if (!usecount) |
390 | return; | |
9845d120 | 391 | |
688ff29b | 392 | if (gsi) |
393 | def_stmt = gsi_stmt (*gsi); | |
394 | else | |
395 | def_stmt = SSA_NAME_DEF_STMT (var); | |
9845d120 | 396 | |
688ff29b | 397 | /* If we didn't get an insertion point, and the stmt has already |
398 | been removed, we won't be able to insert the debug bind stmt, so | |
399 | we'll have to drop debug information. */ | |
43e54ec3 | 400 | if (gimple_code (def_stmt) == GIMPLE_PHI) |
401 | { | |
402 | value = degenerate_phi_result (def_stmt); | |
403 | if (value && walk_tree (&value, find_released_ssa_name, NULL, NULL)) | |
404 | value = NULL; | |
a05063ec | 405 | /* error_mark_node is what fixup_noreturn_call changes PHI arguments |
406 | to. */ | |
407 | else if (value == error_mark_node) | |
408 | value = NULL; | |
43e54ec3 | 409 | } |
410 | else if (is_gimple_assign (def_stmt)) | |
688ff29b | 411 | { |
412 | bool no_value = false; | |
9845d120 | 413 | |
688ff29b | 414 | if (!dom_info_available_p (CDI_DOMINATORS)) |
415 | { | |
416 | struct walk_stmt_info wi; | |
417 | ||
418 | memset (&wi, 0, sizeof (wi)); | |
419 | ||
420 | /* When removing blocks without following reverse dominance | |
421 | order, we may sometimes encounter SSA_NAMEs that have | |
422 | already been released, referenced in other SSA_DEFs that | |
423 | we're about to release. Consider: | |
424 | ||
425 | <bb X>: | |
426 | v_1 = foo; | |
427 | ||
428 | <bb Y>: | |
429 | w_2 = v_1 + bar; | |
430 | # DEBUG w => w_2 | |
431 | ||
432 | If we deleted BB X first, propagating the value of w_2 | |
433 | won't do us any good. It's too late to recover their | |
434 | original definition of v_1: when it was deleted, it was | |
435 | only referenced in other DEFs, it couldn't possibly know | |
436 | it should have been retained, and propagating every | |
437 | single DEF just in case it might have to be propagated | |
438 | into a DEBUG STMT would probably be too wasteful. | |
439 | ||
440 | When dominator information is not readily available, we | |
441 | check for and accept some loss of debug information. But | |
442 | if it is available, there's no excuse for us to remove | |
443 | blocks in the wrong order, so we don't even check for | |
444 | dead SSA NAMEs. SSA verification shall catch any | |
445 | errors. */ | |
446 | if ((!gsi && !gimple_bb (def_stmt)) | |
7f9256fe | 447 | || walk_gimple_op (def_stmt, find_released_ssa_name, &wi)) |
688ff29b | 448 | no_value = true; |
9845d120 | 449 | } |
450 | ||
688ff29b | 451 | if (!no_value) |
452 | value = gimple_assign_rhs_to_tree (def_stmt); | |
453 | } | |
454 | ||
455 | if (value) | |
456 | { | |
457 | /* If there's a single use of VAR, and VAR is the entire debug | |
458 | expression (usecount would have been incremented again | |
459 | otherwise), and the definition involves only constants and | |
460 | SSA names, then we can propagate VALUE into this single use, | |
461 | avoiding the temp. | |
462 | ||
463 | We can also avoid using a temp if VALUE can be shared and | |
464 | propagated into all uses, without generating expressions that | |
465 | wouldn't be valid gimple RHSs. | |
466 | ||
467 | Other cases that would require unsharing or non-gimple RHSs | |
468 | are deferred to a debug temp, although we could avoid temps | |
469 | at the expense of duplication of expressions. */ | |
470 | ||
471 | if (CONSTANT_CLASS_P (value) | |
43e54ec3 | 472 | || gimple_code (def_stmt) == GIMPLE_PHI |
688ff29b | 473 | || (usecount == 1 |
474 | && (!gimple_assign_single_p (def_stmt) | |
475 | || is_gimple_min_invariant (value))) | |
476 | || is_gimple_reg (value)) | |
11db727d | 477 | ; |
688ff29b | 478 | else |
9845d120 | 479 | { |
688ff29b | 480 | gimple def_temp; |
481 | tree vexpr = make_node (DEBUG_EXPR_DECL); | |
482 | ||
483 | def_temp = gimple_build_debug_bind (vexpr, | |
484 | unshare_expr (value), | |
485 | def_stmt); | |
486 | ||
487 | DECL_ARTIFICIAL (vexpr) = 1; | |
488 | TREE_TYPE (vexpr) = TREE_TYPE (value); | |
489 | if (DECL_P (value)) | |
490 | DECL_MODE (vexpr) = DECL_MODE (value); | |
491 | else | |
492 | DECL_MODE (vexpr) = TYPE_MODE (TREE_TYPE (value)); | |
9845d120 | 493 | |
688ff29b | 494 | if (gsi) |
495 | gsi_insert_before (gsi, def_temp, GSI_SAME_STMT); | |
496 | else | |
9845d120 | 497 | { |
688ff29b | 498 | gimple_stmt_iterator ngsi = gsi_for_stmt (def_stmt); |
499 | gsi_insert_before (&ngsi, def_temp, GSI_SAME_STMT); | |
9845d120 | 500 | } |
501 | ||
688ff29b | 502 | value = vexpr; |
9845d120 | 503 | } |
688ff29b | 504 | } |
9845d120 | 505 | |
688ff29b | 506 | FOR_EACH_IMM_USE_STMT (stmt, imm_iter, var) |
507 | { | |
508 | if (!gimple_debug_bind_p (stmt)) | |
509 | continue; | |
510 | ||
511 | if (value) | |
02a562db | 512 | { |
513 | FOR_EACH_IMM_USE_ON_STMT (use_p, imm_iter) | |
514 | /* unshare_expr is not needed here. vexpr is either a | |
515 | SINGLE_RHS, that can be safely shared, some other RHS | |
516 | that was unshared when we found it had a single debug | |
517 | use, or a DEBUG_EXPR_DECL, that can be safely | |
518 | shared. */ | |
11db727d | 519 | SET_USE (use_p, unshare_expr (value)); |
02a562db | 520 | /* If we didn't replace uses with a debug decl fold the |
521 | resulting expression. Otherwise we end up with invalid IL. */ | |
522 | if (TREE_CODE (value) != DEBUG_EXPR_DECL) | |
50aacf4c | 523 | { |
524 | gimple_stmt_iterator gsi = gsi_for_stmt (stmt); | |
525 | fold_stmt_inplace (&gsi); | |
526 | } | |
02a562db | 527 | } |
688ff29b | 528 | else |
529 | gimple_debug_bind_reset_value (stmt); | |
9845d120 | 530 | |
531 | update_stmt (stmt); | |
532 | } | |
533 | } | |
534 | ||
535 | ||
688ff29b | 536 | /* Insert a DEBUG BIND stmt before STMT for each DEF referenced by |
537 | other DEBUG stmts, and replace uses of the DEF with the | |
538 | newly-created debug temp. */ | |
9845d120 | 539 | |
540 | void | |
688ff29b | 541 | insert_debug_temps_for_defs (gimple_stmt_iterator *gsi) |
9845d120 | 542 | { |
688ff29b | 543 | gimple stmt; |
9845d120 | 544 | ssa_op_iter op_iter; |
545 | def_operand_p def_p; | |
546 | ||
547 | if (!MAY_HAVE_DEBUG_STMTS) | |
548 | return; | |
549 | ||
688ff29b | 550 | stmt = gsi_stmt (*gsi); |
551 | ||
43e54ec3 | 552 | FOR_EACH_PHI_OR_STMT_DEF (def_p, stmt, op_iter, SSA_OP_DEF) |
9845d120 | 553 | { |
554 | tree var = DEF_FROM_PTR (def_p); | |
555 | ||
556 | if (TREE_CODE (var) != SSA_NAME) | |
557 | continue; | |
558 | ||
688ff29b | 559 | insert_debug_temp_for_var_def (gsi, var); |
9845d120 | 560 | } |
561 | } | |
562 | ||
8ebd8f29 | 563 | /* Reset all debug stmts that use SSA_NAME(s) defined in STMT. */ |
564 | ||
565 | void | |
566 | reset_debug_uses (gimple stmt) | |
567 | { | |
568 | ssa_op_iter op_iter; | |
569 | def_operand_p def_p; | |
570 | imm_use_iterator imm_iter; | |
571 | gimple use_stmt; | |
572 | ||
573 | if (!MAY_HAVE_DEBUG_STMTS) | |
574 | return; | |
575 | ||
576 | FOR_EACH_PHI_OR_STMT_DEF (def_p, stmt, op_iter, SSA_OP_DEF) | |
577 | { | |
578 | tree var = DEF_FROM_PTR (def_p); | |
579 | ||
580 | if (TREE_CODE (var) != SSA_NAME) | |
581 | continue; | |
582 | ||
583 | FOR_EACH_IMM_USE_STMT (use_stmt, imm_iter, var) | |
584 | { | |
585 | if (!gimple_debug_bind_p (use_stmt)) | |
586 | continue; | |
587 | ||
588 | gimple_debug_bind_reset_value (use_stmt); | |
589 | update_stmt (use_stmt); | |
590 | } | |
591 | } | |
592 | } | |
593 | ||
1b223194 | 594 | /* Delete SSA DEFs for SSA versions in the TOREMOVE bitmap, removing |
595 | dominated stmts before their dominators, so that release_ssa_defs | |
596 | stands a chance of propagating DEFs into debug bind stmts. */ | |
597 | ||
598 | void | |
599 | release_defs_bitset (bitmap toremove) | |
600 | { | |
601 | unsigned j; | |
602 | bitmap_iterator bi; | |
603 | ||
604 | /* Performing a topological sort is probably overkill, this will | |
605 | most likely run in slightly superlinear time, rather than the | |
606 | pathological quadratic worst case. */ | |
607 | while (!bitmap_empty_p (toremove)) | |
608 | EXECUTE_IF_SET_IN_BITMAP (toremove, 0, j, bi) | |
609 | { | |
610 | bool remove_now = true; | |
611 | tree var = ssa_name (j); | |
612 | gimple stmt; | |
613 | imm_use_iterator uit; | |
614 | ||
615 | FOR_EACH_IMM_USE_STMT (stmt, uit, var) | |
616 | { | |
617 | ssa_op_iter dit; | |
618 | def_operand_p def_p; | |
619 | ||
620 | /* We can't propagate PHI nodes into debug stmts. */ | |
621 | if (gimple_code (stmt) == GIMPLE_PHI | |
622 | || is_gimple_debug (stmt)) | |
623 | continue; | |
624 | ||
625 | /* If we find another definition to remove that uses | |
626 | the one we're looking at, defer the removal of this | |
627 | one, so that it can be propagated into debug stmts | |
628 | after the other is. */ | |
629 | FOR_EACH_SSA_DEF_OPERAND (def_p, stmt, dit, SSA_OP_DEF) | |
630 | { | |
631 | tree odef = DEF_FROM_PTR (def_p); | |
632 | ||
633 | if (bitmap_bit_p (toremove, SSA_NAME_VERSION (odef))) | |
634 | { | |
635 | remove_now = false; | |
636 | break; | |
637 | } | |
638 | } | |
639 | ||
640 | if (!remove_now) | |
641 | BREAK_FROM_IMM_USE_STMT (uit); | |
642 | } | |
643 | ||
644 | if (remove_now) | |
645 | { | |
646 | gimple def = SSA_NAME_DEF_STMT (var); | |
647 | gimple_stmt_iterator gsi = gsi_for_stmt (def); | |
648 | ||
649 | if (gimple_code (def) == GIMPLE_PHI) | |
650 | remove_phi_node (&gsi, true); | |
651 | else | |
652 | { | |
653 | gsi_remove (&gsi, true); | |
654 | release_defs (def); | |
655 | } | |
656 | ||
657 | bitmap_clear_bit (toremove, j); | |
658 | } | |
659 | } | |
660 | } | |
661 | ||
81d08033 | 662 | /* Return true if SSA_NAME is malformed and mark it visited. |
4ee9c684 | 663 | |
81d08033 | 664 | IS_VIRTUAL is true if this SSA_NAME was found inside a virtual |
665 | operand. */ | |
4ee9c684 | 666 | |
667 | static bool | |
81d08033 | 668 | verify_ssa_name (tree ssa_name, bool is_virtual) |
4ee9c684 | 669 | { |
4ee9c684 | 670 | if (TREE_CODE (ssa_name) != SSA_NAME) |
671 | { | |
0a81f5a0 | 672 | error ("expected an SSA_NAME object"); |
81d08033 | 673 | return true; |
4ee9c684 | 674 | } |
675 | ||
bcef4e8e | 676 | if (SSA_NAME_IN_FREE_LIST (ssa_name)) |
cbbefea4 | 677 | { |
bcef4e8e | 678 | error ("found an SSA_NAME that had been released into the free pool"); |
cbbefea4 | 679 | return true; |
680 | } | |
681 | ||
bcef4e8e | 682 | if (SSA_NAME_VAR (ssa_name) != NULL_TREE |
683 | && TREE_TYPE (ssa_name) != TREE_TYPE (SSA_NAME_VAR (ssa_name))) | |
81d08033 | 684 | { |
bcef4e8e | 685 | error ("type mismatch between an SSA_NAME and its symbol"); |
81d08033 | 686 | return true; |
687 | } | |
688 | ||
7c782c9b | 689 | if (is_virtual && !virtual_operand_p (ssa_name)) |
81d08033 | 690 | { |
0a81f5a0 | 691 | error ("found a virtual definition for a GIMPLE register"); |
81d08033 | 692 | return true; |
693 | } | |
694 | ||
dd277d48 | 695 | if (is_virtual && SSA_NAME_VAR (ssa_name) != gimple_vop (cfun)) |
696 | { | |
697 | error ("virtual SSA name for non-VOP decl"); | |
698 | return true; | |
699 | } | |
700 | ||
7c782c9b | 701 | if (!is_virtual && virtual_operand_p (ssa_name)) |
81d08033 | 702 | { |
0a81f5a0 | 703 | error ("found a real definition for a non-register"); |
81d08033 | 704 | return true; |
705 | } | |
706 | ||
4fb5e5ca | 707 | if (SSA_NAME_IS_DEFAULT_DEF (ssa_name) |
75a70cf9 | 708 | && !gimple_nop_p (SSA_NAME_DEF_STMT (ssa_name))) |
4fb5e5ca | 709 | { |
710 | error ("found a default name with a non-empty defining statement"); | |
711 | return true; | |
712 | } | |
713 | ||
81d08033 | 714 | return false; |
715 | } | |
716 | ||
717 | ||
718 | /* Return true if the definition of SSA_NAME at block BB is malformed. | |
719 | ||
720 | STMT is the statement where SSA_NAME is created. | |
721 | ||
722 | DEFINITION_BLOCK is an array of basic blocks indexed by SSA_NAME | |
723 | version numbers. If DEFINITION_BLOCK[SSA_NAME_VERSION] is set, | |
724 | it means that the block in that array slot contains the | |
725 | definition of SSA_NAME. | |
726 | ||
4fb5e5ca | 727 | IS_VIRTUAL is true if SSA_NAME is created by a VDEF. */ |
81d08033 | 728 | |
729 | static bool | |
730 | verify_def (basic_block bb, basic_block *definition_block, tree ssa_name, | |
75a70cf9 | 731 | gimple stmt, bool is_virtual) |
81d08033 | 732 | { |
733 | if (verify_ssa_name (ssa_name, is_virtual)) | |
734 | goto err; | |
735 | ||
ec11736b | 736 | if (SSA_NAME_VAR (ssa_name) |
737 | && TREE_CODE (SSA_NAME_VAR (ssa_name)) == RESULT_DECL | |
524a0531 | 738 | && DECL_BY_REFERENCE (SSA_NAME_VAR (ssa_name))) |
739 | { | |
bf776685 | 740 | error ("RESULT_DECL should be read only when DECL_BY_REFERENCE is set"); |
524a0531 | 741 | goto err; |
742 | } | |
743 | ||
4ee9c684 | 744 | if (definition_block[SSA_NAME_VERSION (ssa_name)]) |
745 | { | |
746 | error ("SSA_NAME created in two different blocks %i and %i", | |
747 | definition_block[SSA_NAME_VERSION (ssa_name)]->index, bb->index); | |
81d08033 | 748 | goto err; |
4ee9c684 | 749 | } |
750 | ||
751 | definition_block[SSA_NAME_VERSION (ssa_name)] = bb; | |
752 | ||
753 | if (SSA_NAME_DEF_STMT (ssa_name) != stmt) | |
754 | { | |
755 | error ("SSA_NAME_DEF_STMT is wrong"); | |
4ee9c684 | 756 | fprintf (stderr, "Expected definition statement:\n"); |
75a70cf9 | 757 | print_gimple_stmt (stderr, SSA_NAME_DEF_STMT (ssa_name), 4, TDF_VOPS); |
4ee9c684 | 758 | fprintf (stderr, "\nActual definition statement:\n"); |
75a70cf9 | 759 | print_gimple_stmt (stderr, stmt, 4, TDF_VOPS); |
81d08033 | 760 | goto err; |
4ee9c684 | 761 | } |
762 | ||
81d08033 | 763 | return false; |
764 | ||
765 | err: | |
766 | fprintf (stderr, "while verifying SSA_NAME "); | |
767 | print_generic_expr (stderr, ssa_name, 0); | |
768 | fprintf (stderr, " in statement\n"); | |
75a70cf9 | 769 | print_gimple_stmt (stderr, stmt, 4, TDF_VOPS); |
81d08033 | 770 | |
771 | return true; | |
4ee9c684 | 772 | } |
773 | ||
774 | ||
775 | /* Return true if the use of SSA_NAME at statement STMT in block BB is | |
776 | malformed. | |
777 | ||
778 | DEF_BB is the block where SSA_NAME was found to be created. | |
779 | ||
780 | IDOM contains immediate dominator information for the flowgraph. | |
781 | ||
782 | CHECK_ABNORMAL is true if the caller wants to check whether this use | |
783 | is flowing through an abnormal edge (only used when checking PHI | |
81d08033 | 784 | arguments). |
785 | ||
e599eacb | 786 | If NAMES_DEFINED_IN_BB is not NULL, it contains a bitmap of ssa names |
787 | that are defined before STMT in basic block BB. */ | |
4ee9c684 | 788 | |
789 | static bool | |
22aa74c4 | 790 | verify_use (basic_block bb, basic_block def_bb, use_operand_p use_p, |
75a70cf9 | 791 | gimple stmt, bool check_abnormal, bitmap names_defined_in_bb) |
4ee9c684 | 792 | { |
793 | bool err = false; | |
22aa74c4 | 794 | tree ssa_name = USE_FROM_PTR (use_p); |
4ee9c684 | 795 | |
22aa74c4 | 796 | if (!TREE_VISITED (ssa_name)) |
797 | if (verify_imm_links (stderr, ssa_name)) | |
798 | err = true; | |
799 | ||
06c1e160 | 800 | TREE_VISITED (ssa_name) = 1; |
81d08033 | 801 | |
75a70cf9 | 802 | if (gimple_nop_p (SSA_NAME_DEF_STMT (ssa_name)) |
4fb5e5ca | 803 | && SSA_NAME_IS_DEFAULT_DEF (ssa_name)) |
81d08033 | 804 | ; /* Default definitions have empty statements. Nothing to do. */ |
4ee9c684 | 805 | else if (!def_bb) |
806 | { | |
0a81f5a0 | 807 | error ("missing definition"); |
4ee9c684 | 808 | err = true; |
809 | } | |
810 | else if (bb != def_bb | |
811 | && !dominated_by_p (CDI_DOMINATORS, bb, def_bb)) | |
812 | { | |
0a81f5a0 | 813 | error ("definition in block %i does not dominate use in block %i", |
4ee9c684 | 814 | def_bb->index, bb->index); |
815 | err = true; | |
816 | } | |
e599eacb | 817 | else if (bb == def_bb |
818 | && names_defined_in_bb != NULL | |
819 | && !bitmap_bit_p (names_defined_in_bb, SSA_NAME_VERSION (ssa_name))) | |
820 | { | |
0a81f5a0 | 821 | error ("definition in block %i follows the use", def_bb->index); |
e599eacb | 822 | err = true; |
823 | } | |
4ee9c684 | 824 | |
825 | if (check_abnormal | |
826 | && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ssa_name)) | |
827 | { | |
828 | error ("SSA_NAME_OCCURS_IN_ABNORMAL_PHI should be set"); | |
829 | err = true; | |
830 | } | |
831 | ||
48e1416a | 832 | /* Make sure the use is in an appropriate list by checking the previous |
20833d12 | 833 | element to make sure it's the same. */ |
22aa74c4 | 834 | if (use_p->prev == NULL) |
835 | { | |
0a81f5a0 | 836 | error ("no immediate_use list"); |
22aa74c4 | 837 | err = true; |
838 | } | |
839 | else | |
840 | { | |
75a70cf9 | 841 | tree listvar; |
22aa74c4 | 842 | if (use_p->prev->use == NULL) |
75a70cf9 | 843 | listvar = use_p->prev->loc.ssa_name; |
22aa74c4 | 844 | else |
845 | listvar = USE_FROM_PTR (use_p->prev); | |
846 | if (listvar != ssa_name) | |
847 | { | |
0a81f5a0 | 848 | error ("wrong immediate use list"); |
22aa74c4 | 849 | err = true; |
850 | } | |
851 | } | |
852 | ||
4ee9c684 | 853 | if (err) |
854 | { | |
855 | fprintf (stderr, "for SSA_NAME: "); | |
94dcc41f | 856 | print_generic_expr (stderr, ssa_name, TDF_VOPS); |
88dbf20f | 857 | fprintf (stderr, " in statement:\n"); |
75a70cf9 | 858 | print_gimple_stmt (stderr, stmt, 0, TDF_VOPS); |
4ee9c684 | 859 | } |
860 | ||
861 | return err; | |
862 | } | |
863 | ||
864 | ||
865 | /* Return true if any of the arguments for PHI node PHI at block BB is | |
866 | malformed. | |
867 | ||
4fb5e5ca | 868 | DEFINITION_BLOCK is an array of basic blocks indexed by SSA_NAME |
869 | version numbers. If DEFINITION_BLOCK[SSA_NAME_VERSION] is set, | |
870 | it means that the block in that array slot contains the | |
871 | definition of SSA_NAME. */ | |
4ee9c684 | 872 | |
873 | static bool | |
75a70cf9 | 874 | verify_phi_args (gimple phi, basic_block bb, basic_block *definition_block) |
4ee9c684 | 875 | { |
876 | edge e; | |
877 | bool err = false; | |
75a70cf9 | 878 | size_t i, phi_num_args = gimple_phi_num_args (phi); |
4ee9c684 | 879 | |
79aae762 | 880 | if (EDGE_COUNT (bb->preds) != phi_num_args) |
881 | { | |
0a81f5a0 | 882 | error ("incoming edge count does not match number of PHI arguments"); |
79aae762 | 883 | err = true; |
884 | goto error; | |
885 | } | |
886 | ||
4ee9c684 | 887 | for (i = 0; i < phi_num_args; i++) |
888 | { | |
75a70cf9 | 889 | use_operand_p op_p = gimple_phi_arg_imm_use_ptr (phi, i); |
22aa74c4 | 890 | tree op = USE_FROM_PTR (op_p); |
891 | ||
e0ebfc19 | 892 | e = EDGE_PRED (bb, i); |
cc890649 | 893 | |
894 | if (op == NULL_TREE) | |
895 | { | |
0a81f5a0 | 896 | error ("PHI argument is missing for edge %d->%d", |
cc890649 | 897 | e->src->index, |
898 | e->dest->index); | |
899 | err = true; | |
900 | goto error; | |
901 | } | |
902 | ||
79aae762 | 903 | if (TREE_CODE (op) != SSA_NAME && !is_gimple_min_invariant (op)) |
904 | { | |
905 | error ("PHI argument is not SSA_NAME, or invariant"); | |
906 | err = true; | |
907 | } | |
908 | ||
4ee9c684 | 909 | if (TREE_CODE (op) == SSA_NAME) |
4fb5e5ca | 910 | { |
7c782c9b | 911 | err = verify_ssa_name (op, virtual_operand_p (gimple_phi_result (phi))); |
4fb5e5ca | 912 | err |= verify_use (e->src, definition_block[SSA_NAME_VERSION (op)], |
913 | op_p, phi, e->flags & EDGE_ABNORMAL, NULL); | |
914 | } | |
4ee9c684 | 915 | |
86f2ad37 | 916 | if (TREE_CODE (op) == ADDR_EXPR) |
917 | { | |
918 | tree base = TREE_OPERAND (op, 0); | |
919 | while (handled_component_p (base)) | |
920 | base = TREE_OPERAND (base, 0); | |
921 | if ((TREE_CODE (base) == VAR_DECL | |
922 | || TREE_CODE (base) == PARM_DECL | |
923 | || TREE_CODE (base) == RESULT_DECL) | |
924 | && !TREE_ADDRESSABLE (base)) | |
925 | { | |
926 | error ("address taken, but ADDRESSABLE bit not set"); | |
927 | err = true; | |
928 | } | |
929 | } | |
930 | ||
4ee9c684 | 931 | if (e->dest != bb) |
932 | { | |
0a81f5a0 | 933 | error ("wrong edge %d->%d for PHI argument", |
7781aa77 | 934 | e->src->index, e->dest->index); |
4ee9c684 | 935 | err = true; |
936 | } | |
937 | ||
4ee9c684 | 938 | if (err) |
939 | { | |
940 | fprintf (stderr, "PHI argument\n"); | |
94dcc41f | 941 | print_generic_stmt (stderr, op, TDF_VOPS); |
81d08033 | 942 | goto error; |
4ee9c684 | 943 | } |
4ee9c684 | 944 | } |
945 | ||
81d08033 | 946 | error: |
4ee9c684 | 947 | if (err) |
948 | { | |
949 | fprintf (stderr, "for PHI node\n"); | |
75a70cf9 | 950 | print_gimple_stmt (stderr, phi, 0, TDF_VOPS|TDF_MEMSYMS); |
4ee9c684 | 951 | } |
952 | ||
953 | ||
954 | return err; | |
955 | } | |
956 | ||
957 | ||
958 | /* Verify common invariants in the SSA web. | |
959 | TODO: verify the variable annotations. */ | |
960 | ||
4b987fac | 961 | DEBUG_FUNCTION void |
71b65939 | 962 | verify_ssa (bool check_modified_stmt, bool check_ssa_operands) |
4ee9c684 | 963 | { |
81d08033 | 964 | size_t i; |
4ee9c684 | 965 | basic_block bb; |
680a19b9 | 966 | basic_block *definition_block = XCNEWVEC (basic_block, num_ssa_names); |
43daa21e | 967 | ssa_op_iter iter; |
968 | tree op; | |
50b08d37 | 969 | enum dom_state orig_dom_state = dom_info_state (CDI_DOMINATORS); |
27335ffd | 970 | bitmap names_defined_in_bb = BITMAP_ALLOC (NULL); |
4ee9c684 | 971 | |
dd277d48 | 972 | gcc_assert (!need_ssa_update_p (cfun)); |
095dcfa3 | 973 | |
4ee9c684 | 974 | timevar_push (TV_TREE_SSA_VERIFY); |
975 | ||
81d08033 | 976 | /* Keep track of SSA names present in the IL. */ |
977 | for (i = 1; i < num_ssa_names; i++) | |
4ee9c684 | 978 | { |
79aae762 | 979 | tree name = ssa_name (i); |
980 | if (name) | |
4ee9c684 | 981 | { |
75a70cf9 | 982 | gimple stmt; |
79aae762 | 983 | TREE_VISITED (name) = 0; |
4ee9c684 | 984 | |
7c782c9b | 985 | verify_ssa_name (name, virtual_operand_p (name)); |
85f3d834 | 986 | |
79aae762 | 987 | stmt = SSA_NAME_DEF_STMT (name); |
75a70cf9 | 988 | if (!gimple_nop_p (stmt)) |
81d08033 | 989 | { |
75a70cf9 | 990 | basic_block bb = gimple_bb (stmt); |
fcf70d14 | 991 | if (verify_def (bb, definition_block, |
992 | name, stmt, virtual_operand_p (name))) | |
993 | goto err; | |
4ee9c684 | 994 | } |
995 | } | |
996 | } | |
997 | ||
79aae762 | 998 | calculate_dominance_info (CDI_DOMINATORS); |
4ee9c684 | 999 | |
1000 | /* Now verify all the uses and make sure they agree with the definitions | |
1001 | found in the previous pass. */ | |
fc00614f | 1002 | FOR_EACH_BB_FN (bb, cfun) |
4ee9c684 | 1003 | { |
1004 | edge e; | |
75a70cf9 | 1005 | gimple phi; |
cd665a06 | 1006 | edge_iterator ei; |
75a70cf9 | 1007 | gimple_stmt_iterator gsi; |
4ee9c684 | 1008 | |
1009 | /* Make sure that all edges have a clear 'aux' field. */ | |
cd665a06 | 1010 | FOR_EACH_EDGE (e, ei, bb->preds) |
4ee9c684 | 1011 | { |
1012 | if (e->aux) | |
1013 | { | |
0a81f5a0 | 1014 | error ("AUX pointer initialized for edge %d->%d", e->src->index, |
4ee9c684 | 1015 | e->dest->index); |
81d08033 | 1016 | goto err; |
4ee9c684 | 1017 | } |
1018 | } | |
1019 | ||
1020 | /* Verify the arguments for every PHI node in the block. */ | |
75a70cf9 | 1021 | for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
e599eacb | 1022 | { |
75a70cf9 | 1023 | phi = gsi_stmt (gsi); |
e599eacb | 1024 | if (verify_phi_args (phi, bb, definition_block)) |
1025 | goto err; | |
4fb5e5ca | 1026 | |
e599eacb | 1027 | bitmap_set_bit (names_defined_in_bb, |
75a70cf9 | 1028 | SSA_NAME_VERSION (gimple_phi_result (phi))); |
e599eacb | 1029 | } |
4ee9c684 | 1030 | |
81d08033 | 1031 | /* Now verify all the uses and vuses in every statement of the block. */ |
75a70cf9 | 1032 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
4ee9c684 | 1033 | { |
75a70cf9 | 1034 | gimple stmt = gsi_stmt (gsi); |
22aa74c4 | 1035 | use_operand_p use_p; |
1036 | ||
75a70cf9 | 1037 | if (check_modified_stmt && gimple_modified_p (stmt)) |
22aa74c4 | 1038 | { |
4fb5e5ca | 1039 | error ("stmt (%p) marked modified after optimization pass: ", |
b66731e8 | 1040 | (void *)stmt); |
75a70cf9 | 1041 | print_gimple_stmt (stderr, stmt, 0, TDF_VOPS); |
22aa74c4 | 1042 | goto err; |
1043 | } | |
4ee9c684 | 1044 | |
71b65939 | 1045 | if (check_ssa_operands && verify_ssa_operands (cfun, stmt)) |
dd277d48 | 1046 | { |
85f3d834 | 1047 | print_gimple_stmt (stderr, stmt, 0, TDF_VOPS); |
dd277d48 | 1048 | goto err; |
4fb5e5ca | 1049 | } |
1050 | ||
85f3d834 | 1051 | if (gimple_debug_bind_p (stmt) |
1052 | && !gimple_debug_bind_has_value_p (stmt)) | |
1053 | continue; | |
4fb5e5ca | 1054 | |
1055 | FOR_EACH_SSA_USE_OPERAND (use_p, stmt, iter, SSA_OP_USE|SSA_OP_VUSE) | |
4ee9c684 | 1056 | { |
22aa74c4 | 1057 | op = USE_FROM_PTR (use_p); |
81d08033 | 1058 | if (verify_use (bb, definition_block[SSA_NAME_VERSION (op)], |
4fb5e5ca | 1059 | use_p, stmt, false, names_defined_in_bb)) |
e599eacb | 1060 | goto err; |
1061 | } | |
1062 | ||
1063 | FOR_EACH_SSA_TREE_OPERAND (op, stmt, iter, SSA_OP_ALL_DEFS) | |
dd277d48 | 1064 | { |
1065 | if (SSA_NAME_DEF_STMT (op) != stmt) | |
1066 | { | |
1067 | error ("SSA_NAME_DEF_STMT is wrong"); | |
1068 | fprintf (stderr, "Expected definition statement:\n"); | |
1069 | print_gimple_stmt (stderr, stmt, 4, TDF_VOPS); | |
1070 | fprintf (stderr, "\nActual definition statement:\n"); | |
1071 | print_gimple_stmt (stderr, SSA_NAME_DEF_STMT (op), | |
1072 | 4, TDF_VOPS); | |
1073 | goto err; | |
1074 | } | |
1075 | bitmap_set_bit (names_defined_in_bb, SSA_NAME_VERSION (op)); | |
1076 | } | |
e599eacb | 1077 | } |
1078 | ||
e599eacb | 1079 | bitmap_clear (names_defined_in_bb); |
4ee9c684 | 1080 | } |
1081 | ||
81d08033 | 1082 | free (definition_block); |
095dcfa3 | 1083 | |
c26a6416 | 1084 | /* Restore the dominance information to its prior known state, so |
1085 | that we do not perturb the compiler's subsequent behavior. */ | |
08323300 | 1086 | if (orig_dom_state == DOM_NONE) |
1087 | free_dominance_info (CDI_DOMINATORS); | |
1088 | else | |
50b08d37 | 1089 | set_dom_info_availability (CDI_DOMINATORS, orig_dom_state); |
48e1416a | 1090 | |
27335ffd | 1091 | BITMAP_FREE (names_defined_in_bb); |
4ee9c684 | 1092 | timevar_pop (TV_TREE_SSA_VERIFY); |
81d08033 | 1093 | return; |
4ee9c684 | 1094 | |
81d08033 | 1095 | err: |
0a81f5a0 | 1096 | internal_error ("verify_ssa failed"); |
4ee9c684 | 1097 | } |
1098 | ||
24239da3 | 1099 | /* Return true if the DECL_UID in both trees are equal. */ |
1100 | ||
1101 | static int | |
1102 | uid_ssaname_map_eq (const void *va, const void *vb) | |
1103 | { | |
1104 | const_tree a = (const_tree) va; | |
1105 | const_tree b = (const_tree) vb; | |
1106 | return (a->ssa_name.var->decl_minimal.uid == b->ssa_name.var->decl_minimal.uid); | |
1107 | } | |
1108 | ||
1109 | /* Hash a tree in a uid_decl_map. */ | |
1110 | ||
1111 | static unsigned int | |
1112 | uid_ssaname_map_hash (const void *item) | |
1113 | { | |
1114 | return ((const_tree)item)->ssa_name.var->decl_minimal.uid; | |
1115 | } | |
1116 | ||
4ee9c684 | 1117 | |
4ee9c684 | 1118 | /* Initialize global DFA and SSA structures. */ |
1119 | ||
1120 | void | |
bcaa2770 | 1121 | init_tree_ssa (struct function *fn) |
4ee9c684 | 1122 | { |
25a27413 | 1123 | fn->gimple_df = ggc_cleared_alloc<gimple_df> (); |
48e1416a | 1124 | fn->gimple_df->default_defs = htab_create_ggc (20, uid_ssaname_map_hash, |
bcaa2770 | 1125 | uid_ssaname_map_eq, NULL); |
dd277d48 | 1126 | pt_solution_reset (&fn->gimple_df->escaped); |
bcaa2770 | 1127 | init_ssanames (fn, 0); |
4ee9c684 | 1128 | } |
1129 | ||
3db65b62 | 1130 | /* Do the actions required to initialize internal data structures used |
1131 | in tree-ssa optimization passes. */ | |
1132 | ||
1133 | static unsigned int | |
1134 | execute_init_datastructures (void) | |
1135 | { | |
1136 | /* Allocate hash tables, arrays and other structures. */ | |
6e1aa353 | 1137 | gcc_assert (!cfun->gimple_df); |
3db65b62 | 1138 | init_tree_ssa (cfun); |
1139 | return 0; | |
1140 | } | |
1141 | ||
cbe8bda8 | 1142 | namespace { |
1143 | ||
1144 | const pass_data pass_data_init_datastructures = | |
3db65b62 | 1145 | { |
cbe8bda8 | 1146 | GIMPLE_PASS, /* type */ |
1147 | "*init_datastructures", /* name */ | |
1148 | OPTGROUP_NONE, /* optinfo_flags */ | |
cbe8bda8 | 1149 | TV_NONE, /* tv_id */ |
1150 | PROP_cfg, /* properties_required */ | |
1151 | 0, /* properties_provided */ | |
1152 | 0, /* properties_destroyed */ | |
1153 | 0, /* todo_flags_start */ | |
1154 | 0, /* todo_flags_finish */ | |
3db65b62 | 1155 | }; |
4ee9c684 | 1156 | |
cbe8bda8 | 1157 | class pass_init_datastructures : public gimple_opt_pass |
1158 | { | |
1159 | public: | |
9af5ce0c | 1160 | pass_init_datastructures (gcc::context *ctxt) |
1161 | : gimple_opt_pass (pass_data_init_datastructures, ctxt) | |
cbe8bda8 | 1162 | {} |
1163 | ||
1164 | /* opt_pass methods: */ | |
31315c24 | 1165 | virtual bool gate (function *fun) |
1166 | { | |
1167 | /* Do nothing for funcions that was produced already in SSA form. */ | |
1168 | return !(fun->curr_properties & PROP_ssa); | |
1169 | } | |
1170 | ||
65b0537f | 1171 | virtual unsigned int execute (function *) |
1172 | { | |
1173 | return execute_init_datastructures (); | |
1174 | } | |
cbe8bda8 | 1175 | |
1176 | }; // class pass_init_datastructures | |
1177 | ||
1178 | } // anon namespace | |
1179 | ||
1180 | gimple_opt_pass * | |
1181 | make_pass_init_datastructures (gcc::context *ctxt) | |
1182 | { | |
1183 | return new pass_init_datastructures (ctxt); | |
1184 | } | |
1185 | ||
4ee9c684 | 1186 | /* Deallocate memory associated with SSA data structures for FNDECL. */ |
1187 | ||
1188 | void | |
1189 | delete_tree_ssa (void) | |
1190 | { | |
4ee9c684 | 1191 | fini_ssanames (); |
75a70cf9 | 1192 | |
1193 | /* We no longer maintain the SSA operand cache at this point. */ | |
8d672d12 | 1194 | if (ssa_operands_active (cfun)) |
861b4e39 | 1195 | fini_ssa_operands (cfun); |
4ee9c684 | 1196 | |
2d04fd8d | 1197 | htab_delete (cfun->gimple_df->default_defs); |
f5ab006b | 1198 | cfun->gimple_df->default_defs = NULL; |
dd277d48 | 1199 | pt_solution_reset (&cfun->gimple_df->escaped); |
3a443843 | 1200 | if (cfun->gimple_df->decls_to_pointers != NULL) |
1201 | pointer_map_destroy (cfun->gimple_df->decls_to_pointers); | |
1202 | cfun->gimple_df->decls_to_pointers = NULL; | |
2d04fd8d | 1203 | cfun->gimple_df->modified_noreturn_calls = NULL; |
f5ab006b | 1204 | cfun->gimple_df = NULL; |
d03ba86f | 1205 | |
1206 | /* We no longer need the edge variable maps. */ | |
1207 | redirect_edge_var_map_destroy (); | |
4ee9c684 | 1208 | } |
1209 | ||
4ee9c684 | 1210 | /* Return true if EXPR is a useless type conversion, otherwise return |
1211 | false. */ | |
1212 | ||
1213 | bool | |
1214 | tree_ssa_useless_type_conversion (tree expr) | |
1215 | { | |
1216 | /* If we have an assignment that merely uses a NOP_EXPR to change | |
1217 | the top of the RHS to the type of the LHS and the type conversion | |
1218 | is "safe", then strip away the type conversion so that we can | |
1219 | enter LHS = RHS into the const_and_copies table. */ | |
72dd6141 | 1220 | if (CONVERT_EXPR_P (expr) |
b6b93727 | 1221 | || TREE_CODE (expr) == VIEW_CONVERT_EXPR |
1222 | || TREE_CODE (expr) == NON_LVALUE_EXPR) | |
548044d8 | 1223 | return useless_type_conversion_p |
c2f47e15 | 1224 | (TREE_TYPE (expr), |
75a70cf9 | 1225 | TREE_TYPE (TREE_OPERAND (expr, 0))); |
4ee9c684 | 1226 | |
1227 | return false; | |
1228 | } | |
1229 | ||
98112881 | 1230 | /* Strip conversions from EXP according to |
1231 | tree_ssa_useless_type_conversion and return the resulting | |
1232 | expression. */ | |
1233 | ||
1234 | tree | |
1235 | tree_ssa_strip_useless_type_conversions (tree exp) | |
1236 | { | |
1237 | while (tree_ssa_useless_type_conversion (exp)) | |
1238 | exp = TREE_OPERAND (exp, 0); | |
1239 | return exp; | |
1240 | } | |
1241 | ||
4ee9c684 | 1242 | |
1d2fabca | 1243 | /* Return true if T, an SSA_NAME, has an undefined value. */ |
1244 | ||
1245 | bool | |
1246 | ssa_undefined_value_p (tree t) | |
1247 | { | |
f772e50c | 1248 | gimple def_stmt; |
1d2fabca | 1249 | tree var = SSA_NAME_VAR (t); |
1250 | ||
1251 | if (!var) | |
1252 | ; | |
1253 | /* Parameters get their initial value from the function entry. */ | |
1254 | else if (TREE_CODE (var) == PARM_DECL) | |
1255 | return false; | |
1256 | /* When returning by reference the return address is actually a hidden | |
1257 | parameter. */ | |
1258 | else if (TREE_CODE (var) == RESULT_DECL && DECL_BY_REFERENCE (var)) | |
1259 | return false; | |
1260 | /* Hard register variables get their initial value from the ether. */ | |
1261 | else if (TREE_CODE (var) == VAR_DECL && DECL_HARD_REGISTER (var)) | |
1262 | return false; | |
1263 | ||
1264 | /* The value is undefined iff its definition statement is empty. */ | |
f772e50c | 1265 | def_stmt = SSA_NAME_DEF_STMT (t); |
1266 | if (gimple_nop_p (def_stmt)) | |
1267 | return true; | |
1268 | ||
1269 | /* Check if the complex was not only partially defined. */ | |
1270 | if (is_gimple_assign (def_stmt) | |
1271 | && gimple_assign_rhs_code (def_stmt) == COMPLEX_EXPR) | |
1272 | { | |
1273 | tree rhs1, rhs2; | |
1274 | ||
1275 | rhs1 = gimple_assign_rhs1 (def_stmt); | |
1276 | rhs2 = gimple_assign_rhs2 (def_stmt); | |
1277 | return (TREE_CODE (rhs1) == SSA_NAME && ssa_undefined_value_p (rhs1)) | |
1278 | || (TREE_CODE (rhs2) == SSA_NAME && ssa_undefined_value_p (rhs2)); | |
1279 | } | |
1280 | return false; | |
1d2fabca | 1281 | } |
1282 | ||
1283 | ||
182cf5a9 | 1284 | /* If necessary, rewrite the base of the reference tree *TP from |
1285 | a MEM_REF to a plain or converted symbol. */ | |
1286 | ||
1287 | static void | |
e70e8b13 | 1288 | maybe_rewrite_mem_ref_base (tree *tp, bitmap suitable_for_renaming) |
182cf5a9 | 1289 | { |
1290 | tree sym; | |
1291 | ||
1292 | while (handled_component_p (*tp)) | |
1293 | tp = &TREE_OPERAND (*tp, 0); | |
1294 | if (TREE_CODE (*tp) == MEM_REF | |
1295 | && TREE_CODE (TREE_OPERAND (*tp, 0)) == ADDR_EXPR | |
182cf5a9 | 1296 | && (sym = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0)) |
1297 | && DECL_P (sym) | |
1298 | && !TREE_ADDRESSABLE (sym) | |
e70e8b13 | 1299 | && bitmap_bit_p (suitable_for_renaming, DECL_UID (sym))) |
182cf5a9 | 1300 | { |
8a62fbb0 | 1301 | if (TREE_CODE (TREE_TYPE (sym)) == VECTOR_TYPE |
1302 | && useless_type_conversion_p (TREE_TYPE (*tp), | |
1303 | TREE_TYPE (TREE_TYPE (sym))) | |
1304 | && multiple_of_p (sizetype, TREE_OPERAND (*tp, 1), | |
1305 | TYPE_SIZE_UNIT (TREE_TYPE (*tp)))) | |
1306 | { | |
1307 | *tp = build3 (BIT_FIELD_REF, TREE_TYPE (*tp), sym, | |
1308 | TYPE_SIZE (TREE_TYPE (*tp)), | |
1309 | int_const_binop (MULT_EXPR, | |
1310 | bitsize_int (BITS_PER_UNIT), | |
317e2a67 | 1311 | TREE_OPERAND (*tp, 1))); |
8a62fbb0 | 1312 | } |
8ba0d70d | 1313 | else if (TREE_CODE (TREE_TYPE (sym)) == COMPLEX_TYPE |
1314 | && useless_type_conversion_p (TREE_TYPE (*tp), | |
1315 | TREE_TYPE (TREE_TYPE (sym)))) | |
1316 | { | |
1317 | *tp = build1 (integer_zerop (TREE_OPERAND (*tp, 1)) | |
1318 | ? REALPART_EXPR : IMAGPART_EXPR, | |
1319 | TREE_TYPE (*tp), sym); | |
1320 | } | |
8a62fbb0 | 1321 | else if (integer_zerop (TREE_OPERAND (*tp, 1))) |
1322 | { | |
1323 | if (!useless_type_conversion_p (TREE_TYPE (*tp), | |
1324 | TREE_TYPE (sym))) | |
1325 | *tp = build1 (VIEW_CONVERT_EXPR, | |
1326 | TREE_TYPE (*tp), sym); | |
1327 | else | |
1328 | *tp = sym; | |
1329 | } | |
182cf5a9 | 1330 | } |
1331 | } | |
1332 | ||
cfe3cae3 | 1333 | /* For a tree REF return its base if it is the base of a MEM_REF |
1334 | that cannot be rewritten into SSA form. Otherwise return NULL_TREE. */ | |
1335 | ||
1336 | static tree | |
1337 | non_rewritable_mem_ref_base (tree ref) | |
1338 | { | |
1339 | tree base = ref; | |
1340 | ||
1341 | /* A plain decl does not need it set. */ | |
1342 | if (DECL_P (ref)) | |
1343 | return NULL_TREE; | |
1344 | ||
1345 | while (handled_component_p (base)) | |
1346 | base = TREE_OPERAND (base, 0); | |
1347 | ||
1348 | /* But watch out for MEM_REFs we cannot lower to a | |
8a62fbb0 | 1349 | VIEW_CONVERT_EXPR or a BIT_FIELD_REF. */ |
cfe3cae3 | 1350 | if (TREE_CODE (base) == MEM_REF |
1351 | && TREE_CODE (TREE_OPERAND (base, 0)) == ADDR_EXPR) | |
1352 | { | |
1353 | tree decl = TREE_OPERAND (TREE_OPERAND (base, 0), 0); | |
8ba0d70d | 1354 | if ((TREE_CODE (TREE_TYPE (decl)) == VECTOR_TYPE |
1355 | || TREE_CODE (TREE_TYPE (decl)) == COMPLEX_TYPE) | |
8a62fbb0 | 1356 | && useless_type_conversion_p (TREE_TYPE (base), |
1357 | TREE_TYPE (TREE_TYPE (decl))) | |
796b6678 | 1358 | && wi::fits_uhwi_p (mem_ref_offset (base)) |
cd9b5516 | 1359 | && wi::gtu_p (wi::to_offset (TYPE_SIZE_UNIT (TREE_TYPE (decl))), |
796b6678 | 1360 | mem_ref_offset (base)) |
8a62fbb0 | 1361 | && multiple_of_p (sizetype, TREE_OPERAND (base, 1), |
1362 | TYPE_SIZE_UNIT (TREE_TYPE (base)))) | |
1363 | return NULL_TREE; | |
cfe3cae3 | 1364 | if (DECL_P (decl) |
1365 | && (!integer_zerop (TREE_OPERAND (base, 1)) | |
1366 | || (DECL_SIZE (decl) | |
f698147c | 1367 | != TYPE_SIZE (TREE_TYPE (base))) |
1368 | || TREE_THIS_VOLATILE (decl) != TREE_THIS_VOLATILE (base))) | |
cfe3cae3 | 1369 | return decl; |
1370 | } | |
1371 | ||
1372 | return NULL_TREE; | |
1373 | } | |
1374 | ||
b88d109e | 1375 | /* For an lvalue tree LHS return true if it cannot be rewritten into SSA form. |
1376 | Otherwise return true. */ | |
1377 | ||
1378 | static bool | |
1379 | non_rewritable_lvalue_p (tree lhs) | |
1380 | { | |
1381 | /* A plain decl is always rewritable. */ | |
1382 | if (DECL_P (lhs)) | |
1383 | return false; | |
1384 | ||
1385 | /* A decl that is wrapped inside a MEM-REF that covers | |
1386 | it full is also rewritable. | |
1387 | ??? The following could be relaxed allowing component | |
ef618bb8 | 1388 | references that do not change the access size. */ |
b88d109e | 1389 | if (TREE_CODE (lhs) == MEM_REF |
1390 | && TREE_CODE (TREE_OPERAND (lhs, 0)) == ADDR_EXPR | |
1391 | && integer_zerop (TREE_OPERAND (lhs, 1))) | |
1392 | { | |
1393 | tree decl = TREE_OPERAND (TREE_OPERAND (lhs, 0), 0); | |
1394 | if (DECL_P (decl) | |
1395 | && DECL_SIZE (decl) == TYPE_SIZE (TREE_TYPE (lhs)) | |
1396 | && (TREE_THIS_VOLATILE (decl) == TREE_THIS_VOLATILE (lhs))) | |
1397 | return false; | |
1398 | } | |
1399 | ||
1400 | return true; | |
1401 | } | |
1402 | ||
5ea2e42f | 1403 | /* When possible, clear TREE_ADDRESSABLE bit or set DECL_GIMPLE_REG_P bit and |
1404 | mark the variable VAR for conversion into SSA. Return true when updating | |
1405 | stmts is required. */ | |
cfe3cae3 | 1406 | |
e70e8b13 | 1407 | static void |
1408 | maybe_optimize_var (tree var, bitmap addresses_taken, bitmap not_reg_needs, | |
1409 | bitmap suitable_for_renaming) | |
cfe3cae3 | 1410 | { |
cfe3cae3 | 1411 | /* Global Variables, result decls cannot be changed. */ |
1412 | if (is_global_var (var) | |
1413 | || TREE_CODE (var) == RESULT_DECL | |
1414 | || bitmap_bit_p (addresses_taken, DECL_UID (var))) | |
e70e8b13 | 1415 | return; |
11bbec13 | 1416 | |
cfe3cae3 | 1417 | if (TREE_ADDRESSABLE (var) |
1418 | /* Do not change TREE_ADDRESSABLE if we need to preserve var as | |
1419 | a non-register. Otherwise we are confused and forget to | |
1420 | add virtual operands for it. */ | |
1421 | && (!is_gimple_reg_type (TREE_TYPE (var)) | |
7e21e36b | 1422 | || TREE_CODE (TREE_TYPE (var)) == VECTOR_TYPE |
1423 | || TREE_CODE (TREE_TYPE (var)) == COMPLEX_TYPE | |
cfe3cae3 | 1424 | || !bitmap_bit_p (not_reg_needs, DECL_UID (var)))) |
1425 | { | |
1426 | TREE_ADDRESSABLE (var) = 0; | |
1427 | if (is_gimple_reg (var)) | |
e70e8b13 | 1428 | bitmap_set_bit (suitable_for_renaming, DECL_UID (var)); |
cfe3cae3 | 1429 | if (dump_file) |
1430 | { | |
5ea2e42f | 1431 | fprintf (dump_file, "No longer having address taken: "); |
cfe3cae3 | 1432 | print_generic_expr (dump_file, var, 0); |
1433 | fprintf (dump_file, "\n"); | |
1434 | } | |
1435 | } | |
5ea2e42f | 1436 | |
cfe3cae3 | 1437 | if (!DECL_GIMPLE_REG_P (var) |
1438 | && !bitmap_bit_p (not_reg_needs, DECL_UID (var)) | |
1439 | && (TREE_CODE (TREE_TYPE (var)) == COMPLEX_TYPE | |
1440 | || TREE_CODE (TREE_TYPE (var)) == VECTOR_TYPE) | |
1441 | && !TREE_THIS_VOLATILE (var) | |
1442 | && (TREE_CODE (var) != VAR_DECL || !DECL_HARD_REGISTER (var))) | |
1443 | { | |
1444 | DECL_GIMPLE_REG_P (var) = 1; | |
e70e8b13 | 1445 | bitmap_set_bit (suitable_for_renaming, DECL_UID (var)); |
cfe3cae3 | 1446 | if (dump_file) |
1447 | { | |
5ea2e42f | 1448 | fprintf (dump_file, "Now a gimple register: "); |
cfe3cae3 | 1449 | print_generic_expr (dump_file, var, 0); |
1450 | fprintf (dump_file, "\n"); | |
1451 | } | |
1452 | } | |
cfe3cae3 | 1453 | } |
1454 | ||
3f99bd94 | 1455 | /* Compute TREE_ADDRESSABLE and DECL_GIMPLE_REG_P for local variables. */ |
83cfcdaf | 1456 | |
dd277d48 | 1457 | void |
5ea2e42f | 1458 | execute_update_addresses_taken (void) |
83cfcdaf | 1459 | { |
75a70cf9 | 1460 | gimple_stmt_iterator gsi; |
83cfcdaf | 1461 | basic_block bb; |
1462 | bitmap addresses_taken = BITMAP_ALLOC (NULL); | |
3f99bd94 | 1463 | bitmap not_reg_needs = BITMAP_ALLOC (NULL); |
e70e8b13 | 1464 | bitmap suitable_for_renaming = BITMAP_ALLOC (NULL); |
5ea2e42f | 1465 | tree var; |
cfe3cae3 | 1466 | unsigned i; |
83cfcdaf | 1467 | |
4b366dd3 | 1468 | timevar_push (TV_ADDRESS_TAKEN); |
1469 | ||
83cfcdaf | 1470 | /* Collect into ADDRESSES_TAKEN all variables whose address is taken within |
1471 | the function body. */ | |
fc00614f | 1472 | FOR_EACH_BB_FN (bb, cfun) |
83cfcdaf | 1473 | { |
75a70cf9 | 1474 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
83cfcdaf | 1475 | { |
6d5ec6f8 | 1476 | gimple stmt = gsi_stmt (gsi); |
3f99bd94 | 1477 | enum gimple_code code = gimple_code (stmt); |
cfe3cae3 | 1478 | tree decl; |
6d5ec6f8 | 1479 | |
1480 | /* Note all addresses taken by the stmt. */ | |
1481 | gimple_ior_addresses_taken (addresses_taken, stmt); | |
1482 | ||
3f99bd94 | 1483 | /* If we have a call or an assignment, see if the lhs contains |
1484 | a local decl that requires not to be a gimple register. */ | |
1485 | if (code == GIMPLE_ASSIGN || code == GIMPLE_CALL) | |
1486 | { | |
d29f7fa8 | 1487 | tree lhs = gimple_get_lhs (stmt); |
b88d109e | 1488 | if (lhs |
1489 | && TREE_CODE (lhs) != SSA_NAME | |
1490 | && non_rewritable_lvalue_p (lhs)) | |
182cf5a9 | 1491 | { |
b88d109e | 1492 | decl = get_base_address (lhs); |
1493 | if (DECL_P (decl)) | |
1494 | bitmap_set_bit (not_reg_needs, DECL_UID (decl)); | |
182cf5a9 | 1495 | } |
1496 | } | |
1497 | ||
1498 | if (gimple_assign_single_p (stmt)) | |
1499 | { | |
1500 | tree rhs = gimple_assign_rhs1 (stmt); | |
cfe3cae3 | 1501 | if ((decl = non_rewritable_mem_ref_base (rhs))) |
1502 | bitmap_set_bit (not_reg_needs, DECL_UID (decl)); | |
1503 | } | |
d29f7fa8 | 1504 | |
cfe3cae3 | 1505 | else if (code == GIMPLE_CALL) |
1506 | { | |
1507 | for (i = 0; i < gimple_call_num_args (stmt); ++i) | |
182cf5a9 | 1508 | { |
cfe3cae3 | 1509 | tree arg = gimple_call_arg (stmt, i); |
1510 | if ((decl = non_rewritable_mem_ref_base (arg))) | |
1511 | bitmap_set_bit (not_reg_needs, DECL_UID (decl)); | |
1512 | } | |
1513 | } | |
1514 | ||
1515 | else if (code == GIMPLE_ASM) | |
1516 | { | |
1517 | for (i = 0; i < gimple_asm_noutputs (stmt); ++i) | |
1518 | { | |
1519 | tree link = gimple_asm_output_op (stmt, i); | |
737f8866 | 1520 | tree lhs = TREE_VALUE (link); |
ef618bb8 | 1521 | if (TREE_CODE (lhs) != SSA_NAME) |
737f8866 | 1522 | { |
b88d109e | 1523 | decl = get_base_address (lhs); |
ef618bb8 | 1524 | if (DECL_P (decl) |
1525 | && (non_rewritable_lvalue_p (lhs) | |
1526 | /* We cannot move required conversions from | |
1527 | the lhs to the rhs in asm statements, so | |
1528 | require we do not need any. */ | |
1529 | || !useless_type_conversion_p | |
1530 | (TREE_TYPE (lhs), TREE_TYPE (decl)))) | |
b88d109e | 1531 | bitmap_set_bit (not_reg_needs, DECL_UID (decl)); |
737f8866 | 1532 | } |
cfe3cae3 | 1533 | } |
1534 | for (i = 0; i < gimple_asm_ninputs (stmt); ++i) | |
1535 | { | |
1536 | tree link = gimple_asm_input_op (stmt, i); | |
1537 | if ((decl = non_rewritable_mem_ref_base (TREE_VALUE (link)))) | |
1538 | bitmap_set_bit (not_reg_needs, DECL_UID (decl)); | |
1539 | } | |
3f99bd94 | 1540 | } |
83cfcdaf | 1541 | } |
75a70cf9 | 1542 | |
1543 | for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
83cfcdaf | 1544 | { |
75a70cf9 | 1545 | size_t i; |
1546 | gimple phi = gsi_stmt (gsi); | |
1547 | ||
1548 | for (i = 0; i < gimple_phi_num_args (phi); i++) | |
83cfcdaf | 1549 | { |
1550 | tree op = PHI_ARG_DEF (phi, i), var; | |
1551 | if (TREE_CODE (op) == ADDR_EXPR | |
75a70cf9 | 1552 | && (var = get_base_address (TREE_OPERAND (op, 0))) != NULL |
83cfcdaf | 1553 | && DECL_P (var)) |
1554 | bitmap_set_bit (addresses_taken, DECL_UID (var)); | |
1555 | } | |
1556 | } | |
1557 | } | |
1558 | ||
5ea2e42f | 1559 | /* We cannot iterate over all referenced vars because that can contain |
1560 | unused vars from BLOCK trees, which causes code generation differences | |
1561 | for -g vs. -g0. */ | |
1562 | for (var = DECL_ARGUMENTS (cfun->decl); var; var = DECL_CHAIN (var)) | |
e70e8b13 | 1563 | maybe_optimize_var (var, addresses_taken, not_reg_needs, |
1564 | suitable_for_renaming); | |
5ea2e42f | 1565 | |
f1f41a6c | 1566 | FOR_EACH_VEC_SAFE_ELT (cfun->local_decls, i, var) |
e70e8b13 | 1567 | maybe_optimize_var (var, addresses_taken, not_reg_needs, |
1568 | suitable_for_renaming); | |
83cfcdaf | 1569 | |
5ea2e42f | 1570 | /* Operand caches need to be recomputed for operands referencing the updated |
e70e8b13 | 1571 | variables and operands need to be rewritten to expose bare symbols. */ |
1572 | if (!bitmap_empty_p (suitable_for_renaming)) | |
dd277d48 | 1573 | { |
fc00614f | 1574 | FOR_EACH_BB_FN (bb, cfun) |
9b57c1ed | 1575 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi);) |
182cf5a9 | 1576 | { |
1577 | gimple stmt = gsi_stmt (gsi); | |
dd277d48 | 1578 | |
182cf5a9 | 1579 | /* Re-write TARGET_MEM_REFs of symbols we want to |
1580 | rewrite into SSA form. */ | |
1581 | if (gimple_assign_single_p (stmt)) | |
1582 | { | |
1583 | tree lhs = gimple_assign_lhs (stmt); | |
1584 | tree rhs, *rhsp = gimple_assign_rhs1_ptr (stmt); | |
1585 | tree sym; | |
1586 | ||
1587 | /* We shouldn't have any fancy wrapping of | |
1588 | component-refs on the LHS, but look through | |
1589 | VIEW_CONVERT_EXPRs as that is easy. */ | |
1590 | while (TREE_CODE (lhs) == VIEW_CONVERT_EXPR) | |
1591 | lhs = TREE_OPERAND (lhs, 0); | |
1592 | if (TREE_CODE (lhs) == MEM_REF | |
1593 | && TREE_CODE (TREE_OPERAND (lhs, 0)) == ADDR_EXPR | |
1594 | && integer_zerop (TREE_OPERAND (lhs, 1)) | |
1595 | && (sym = TREE_OPERAND (TREE_OPERAND (lhs, 0), 0)) | |
1596 | && DECL_P (sym) | |
1597 | && !TREE_ADDRESSABLE (sym) | |
e70e8b13 | 1598 | && bitmap_bit_p (suitable_for_renaming, DECL_UID (sym))) |
182cf5a9 | 1599 | lhs = sym; |
1600 | else | |
1601 | lhs = gimple_assign_lhs (stmt); | |
1602 | ||
1603 | /* Rewrite the RHS and make sure the resulting assignment | |
1604 | is validly typed. */ | |
e70e8b13 | 1605 | maybe_rewrite_mem_ref_base (rhsp, suitable_for_renaming); |
182cf5a9 | 1606 | rhs = gimple_assign_rhs1 (stmt); |
1607 | if (gimple_assign_lhs (stmt) != lhs | |
1608 | && !useless_type_conversion_p (TREE_TYPE (lhs), | |
1609 | TREE_TYPE (rhs))) | |
1610 | rhs = fold_build1 (VIEW_CONVERT_EXPR, | |
1611 | TREE_TYPE (lhs), rhs); | |
1612 | ||
1613 | if (gimple_assign_lhs (stmt) != lhs) | |
1614 | gimple_assign_set_lhs (stmt, lhs); | |
1615 | ||
9b57c1ed | 1616 | /* For var ={v} {CLOBBER}; where var lost |
1617 | TREE_ADDRESSABLE just remove the stmt. */ | |
1618 | if (DECL_P (lhs) | |
1619 | && TREE_CLOBBER_P (rhs) | |
e70e8b13 | 1620 | && bitmap_bit_p (suitable_for_renaming, DECL_UID (lhs))) |
9b57c1ed | 1621 | { |
1622 | unlink_stmt_vdef (stmt); | |
1623 | gsi_remove (&gsi, true); | |
1624 | release_defs (stmt); | |
1625 | continue; | |
1626 | } | |
1627 | ||
182cf5a9 | 1628 | if (gimple_assign_rhs1 (stmt) != rhs) |
1629 | { | |
1630 | gimple_stmt_iterator gsi = gsi_for_stmt (stmt); | |
1631 | gimple_assign_set_rhs_from_tree (&gsi, rhs); | |
1632 | } | |
1633 | } | |
1634 | ||
cfe3cae3 | 1635 | else if (gimple_code (stmt) == GIMPLE_CALL) |
1636 | { | |
1637 | unsigned i; | |
1638 | for (i = 0; i < gimple_call_num_args (stmt); ++i) | |
1639 | { | |
1640 | tree *argp = gimple_call_arg_ptr (stmt, i); | |
e70e8b13 | 1641 | maybe_rewrite_mem_ref_base (argp, suitable_for_renaming); |
cfe3cae3 | 1642 | } |
1643 | } | |
1644 | ||
1645 | else if (gimple_code (stmt) == GIMPLE_ASM) | |
182cf5a9 | 1646 | { |
1647 | unsigned i; | |
1648 | for (i = 0; i < gimple_asm_noutputs (stmt); ++i) | |
1649 | { | |
1650 | tree link = gimple_asm_output_op (stmt, i); | |
e70e8b13 | 1651 | maybe_rewrite_mem_ref_base (&TREE_VALUE (link), |
1652 | suitable_for_renaming); | |
182cf5a9 | 1653 | } |
1654 | for (i = 0; i < gimple_asm_ninputs (stmt); ++i) | |
1655 | { | |
1656 | tree link = gimple_asm_input_op (stmt, i); | |
e70e8b13 | 1657 | maybe_rewrite_mem_ref_base (&TREE_VALUE (link), |
1658 | suitable_for_renaming); | |
182cf5a9 | 1659 | } |
1660 | } | |
1661 | ||
fd2b4bf0 | 1662 | else if (gimple_debug_bind_p (stmt) |
1663 | && gimple_debug_bind_has_value_p (stmt)) | |
1664 | { | |
1665 | tree *valuep = gimple_debug_bind_get_value_ptr (stmt); | |
1666 | tree decl; | |
e70e8b13 | 1667 | maybe_rewrite_mem_ref_base (valuep, suitable_for_renaming); |
fd2b4bf0 | 1668 | decl = non_rewritable_mem_ref_base (*valuep); |
e70e8b13 | 1669 | if (decl |
1670 | && bitmap_bit_p (suitable_for_renaming, DECL_UID (decl))) | |
fd2b4bf0 | 1671 | gimple_debug_bind_reset_value (stmt); |
1672 | } | |
1673 | ||
182cf5a9 | 1674 | if (gimple_references_memory_p (stmt) |
1675 | || is_gimple_debug (stmt)) | |
1676 | update_stmt (stmt); | |
9b57c1ed | 1677 | |
1678 | gsi_next (&gsi); | |
182cf5a9 | 1679 | } |
dd277d48 | 1680 | |
1681 | /* Update SSA form here, we are called as non-pass as well. */ | |
41f75a99 | 1682 | if (number_of_loops (cfun) > 1 |
1683 | && loops_state_satisfies_p (LOOP_CLOSED_SSA)) | |
0ab72b53 | 1684 | rewrite_into_loop_closed_ssa (NULL, TODO_update_ssa); |
1685 | else | |
1686 | update_ssa (TODO_update_ssa); | |
dd277d48 | 1687 | } |
83cfcdaf | 1688 | |
3f99bd94 | 1689 | BITMAP_FREE (not_reg_needs); |
83cfcdaf | 1690 | BITMAP_FREE (addresses_taken); |
e70e8b13 | 1691 | BITMAP_FREE (suitable_for_renaming); |
4b366dd3 | 1692 | timevar_pop (TV_ADDRESS_TAKEN); |
83cfcdaf | 1693 | } |
1694 | ||
cbe8bda8 | 1695 | namespace { |
1696 | ||
1697 | const pass_data pass_data_update_address_taken = | |
83cfcdaf | 1698 | { |
cbe8bda8 | 1699 | GIMPLE_PASS, /* type */ |
1700 | "addressables", /* name */ | |
1701 | OPTGROUP_NONE, /* optinfo_flags */ | |
cbe8bda8 | 1702 | TV_ADDRESS_TAKEN, /* tv_id */ |
1703 | PROP_ssa, /* properties_required */ | |
1704 | 0, /* properties_provided */ | |
1705 | 0, /* properties_destroyed */ | |
1706 | 0, /* todo_flags_start */ | |
1707 | TODO_update_address_taken, /* todo_flags_finish */ | |
83cfcdaf | 1708 | }; |
cbe8bda8 | 1709 | |
1710 | class pass_update_address_taken : public gimple_opt_pass | |
1711 | { | |
1712 | public: | |
9af5ce0c | 1713 | pass_update_address_taken (gcc::context *ctxt) |
1714 | : gimple_opt_pass (pass_data_update_address_taken, ctxt) | |
cbe8bda8 | 1715 | {} |
1716 | ||
1717 | /* opt_pass methods: */ | |
1718 | ||
1719 | }; // class pass_update_address_taken | |
1720 | ||
1721 | } // anon namespace | |
1722 | ||
1723 | gimple_opt_pass * | |
1724 | make_pass_update_address_taken (gcc::context *ctxt) | |
1725 | { | |
1726 | return new pass_update_address_taken (ctxt); | |
1727 | } |