]>
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" | |
d8a2d370 | 25 | #include "stor-layout.h" |
6de9cd9a | 26 | #include "flags.h" |
6de9cd9a | 27 | #include "tm_p.h" |
e52201b6 | 28 | #include "target.h" |
6de9cd9a | 29 | #include "langhooks.h" |
6de9cd9a | 30 | #include "basic-block.h" |
6de9cd9a | 31 | #include "function.h" |
cf835838 | 32 | #include "gimple-pretty-print.h" |
d0ce8e4c | 33 | #include "pointer-set.h" |
2fb9a547 AM |
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" | |
18f429e2 | 39 | #include "gimple.h" |
45b0be94 | 40 | #include "gimplify.h" |
5be5c238 AM |
41 | #include "gimple-iterator.h" |
42 | #include "gimple-walk.h" | |
442b4905 AM |
43 | #include "gimple-ssa.h" |
44 | #include "tree-phinodes.h" | |
45 | #include "ssa-iterators.h" | |
d8a2d370 | 46 | #include "stringpool.h" |
442b4905 | 47 | #include "tree-ssanames.h" |
e28030cf | 48 | #include "tree-ssa-loop-manip.h" |
442b4905 AM |
49 | #include "tree-into-ssa.h" |
50 | #include "tree-ssa.h" | |
6de9cd9a | 51 | #include "tree-inline.h" |
6de9cd9a | 52 | #include "hashtab.h" |
6de9cd9a | 53 | #include "tree-pass.h" |
718f9c0f | 54 | #include "diagnostic-core.h" |
94e3faf6 | 55 | #include "cfgloop.h" |
1fe37220 | 56 | #include "cfgexpand.h" |
6de9cd9a | 57 | |
ea7e6d5a AH |
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 | |
9e227d60 | 65 | redirect_edge_var_map_add (edge e, tree result, tree def, source_location locus) |
ea7e6d5a AH |
66 | { |
67 | void **slot; | |
9771b263 | 68 | edge_var_map_vector *head; |
ea7e6d5a AH |
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); | |
9771b263 | 75 | head = (edge_var_map_vector *) *slot; |
ea7e6d5a | 76 | if (!head) |
6fa5e0ed | 77 | vec_safe_reserve (head, 5); |
ea7e6d5a AH |
78 | new_node.def = def; |
79 | new_node.result = result; | |
f5045c96 | 80 | new_node.locus = locus; |
ea7e6d5a | 81 | |
6fa5e0ed JJ |
82 | vec_safe_push (head, new_node); |
83 | *slot = head; | |
ea7e6d5a AH |
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; | |
9771b263 | 93 | edge_var_map_vector *head; |
ea7e6d5a AH |
94 | |
95 | if (!edge_var_maps) | |
96 | return; | |
97 | ||
98 | slot = pointer_map_contains (edge_var_maps, e); | |
99 | ||
100 | if (slot) | |
101 | { | |
9771b263 | 102 | head = (edge_var_map_vector *) *slot; |
6fa5e0ed | 103 | vec_free (head); |
ea7e6d5a AH |
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 | { | |
a97a7ae9 | 118 | void **new_slot, **old_slot; |
9771b263 | 119 | edge_var_map_vector *head; |
ea7e6d5a AH |
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; | |
9771b263 | 128 | head = (edge_var_map_vector *) *old_slot; |
ea7e6d5a | 129 | |
6fa5e0ed | 130 | edge_var_map_vector *new_head = NULL; |
ea7e6d5a | 131 | if (head) |
6fa5e0ed | 132 | new_head = vec_safe_copy (head); |
ea7e6d5a | 133 | else |
6fa5e0ed | 134 | vec_safe_reserve (new_head, 5); |
9771b263 | 135 | *new_slot = new_head; |
ea7e6d5a AH |
136 | } |
137 | ||
138 | ||
fa10beec | 139 | /* Return the variable mappings for a given edge. If there is none, return |
ea7e6d5a AH |
140 | NULL. */ |
141 | ||
9771b263 | 142 | edge_var_map_vector * |
ea7e6d5a AH |
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 | ||
9771b263 | 155 | return (edge_var_map_vector *) *slot; |
ea7e6d5a AH |
156 | } |
157 | ||
a97a7ae9 JH |
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 | { | |
9771b263 | 165 | edge_var_map_vector *head = (edge_var_map_vector *) *value; |
6fa5e0ed | 166 | vec_free (head); |
a97a7ae9 JH |
167 | return true; |
168 | } | |
ea7e6d5a AH |
169 | |
170 | /* Clear the edge variable mappings. */ | |
171 | ||
172 | void | |
173 | redirect_edge_var_map_destroy (void) | |
174 | { | |
175 | if (edge_var_maps) | |
176 | { | |
a97a7ae9 | 177 | pointer_map_traverse (edge_var_maps, free_var_map_entry, NULL); |
ea7e6d5a AH |
178 | pointer_map_destroy (edge_var_maps); |
179 | edge_var_maps = NULL; | |
180 | } | |
181 | } | |
182 | ||
183 | ||
f6144c34 BE |
184 | /* Remove the corresponding arguments from the PHI nodes in E's |
185 | destination block and redirect it to DEST. Return redirected edge. | |
ea7e6d5a AH |
186 | The list of removed arguments is stored in a vector accessed |
187 | through edge_var_maps. */ | |
6de9cd9a DN |
188 | |
189 | edge | |
190 | ssa_redirect_edge (edge e, basic_block dest) | |
191 | { | |
726a989a RB |
192 | gimple_stmt_iterator gsi; |
193 | gimple phi; | |
ea7e6d5a AH |
194 | |
195 | redirect_edge_var_map_clear (e); | |
6de9cd9a DN |
196 | |
197 | /* Remove the appropriate PHI arguments in E's destination block. */ | |
726a989a | 198 | for (gsi = gsi_start_phis (e->dest); !gsi_end_p (gsi); gsi_next (&gsi)) |
6de9cd9a | 199 | { |
726a989a | 200 | tree def; |
f5045c96 | 201 | source_location locus ; |
726a989a RB |
202 | |
203 | phi = gsi_stmt (gsi); | |
204 | def = gimple_phi_arg_def (phi, e->dest_idx); | |
f5045c96 | 205 | locus = gimple_phi_arg_location (phi, e->dest_idx); |
ea7e6d5a AH |
206 | |
207 | if (def == NULL_TREE) | |
6de9cd9a DN |
208 | continue; |
209 | ||
9e227d60 | 210 | redirect_edge_var_map_add (e, gimple_phi_result (phi), def, locus); |
6de9cd9a DN |
211 | } |
212 | ||
213 | e = redirect_edge_succ_nodup (e, dest); | |
6de9cd9a DN |
214 | |
215 | return e; | |
216 | } | |
217 | ||
726a989a | 218 | |
38635499 | 219 | /* Add PHI arguments queued in PENDING_STMT list on edge E to edge |
71882046 KH |
220 | E->dest. */ |
221 | ||
222 | void | |
223 | flush_pending_stmts (edge e) | |
224 | { | |
726a989a | 225 | gimple phi; |
9771b263 | 226 | edge_var_map_vector *v; |
ea7e6d5a AH |
227 | edge_var_map *vm; |
228 | int i; | |
726a989a | 229 | gimple_stmt_iterator gsi; |
71882046 | 230 | |
ea7e6d5a AH |
231 | v = redirect_edge_var_map_vector (e); |
232 | if (!v) | |
71882046 KH |
233 | return; |
234 | ||
726a989a | 235 | for (gsi = gsi_start_phis (e->dest), i = 0; |
9771b263 | 236 | !gsi_end_p (gsi) && v->iterate (i, &vm); |
726a989a | 237 | gsi_next (&gsi), i++) |
71882046 | 238 | { |
726a989a RB |
239 | tree def; |
240 | ||
241 | phi = gsi_stmt (gsi); | |
242 | def = redirect_edge_var_map_def (vm); | |
9e227d60 | 243 | add_phi_arg (phi, def, e, redirect_edge_var_map_location (vm)); |
71882046 KH |
244 | } |
245 | ||
ea7e6d5a | 246 | redirect_edge_var_map_clear (e); |
71882046 | 247 | } |
6de9cd9a | 248 | |
ff2a63a7 AM |
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 | ||
b5b8b0ac AO |
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 | ||
70b5e7dc RG |
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 | ||
46eb666a RG |
303 | if ((TREE_CODE (var) != VAR_DECL |
304 | || VAR_DECL_IS_VIRTUAL_OPERAND (var)) | |
b5b8b0ac AO |
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 | ||
46eb666a RG |
314 | /* var-tracking only tracks registers. */ |
315 | if (!is_gimple_reg_type (TREE_TYPE (var))) | |
316 | return NULL_TREE; | |
b5b8b0ac AO |
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 | ||
42a06e46 | 329 | if (wi && wi->is_lhs) |
b5b8b0ac AO |
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 | ||
0ca5af51 AO |
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 | ||
b5b8b0ac | 349 | void |
0ca5af51 | 350 | insert_debug_temp_for_var_def (gimple_stmt_iterator *gsi, tree var) |
b5b8b0ac AO |
351 | { |
352 | imm_use_iterator imm_iter; | |
b5b8b0ac | 353 | use_operand_p use_p; |
0ca5af51 AO |
354 | gimple stmt; |
355 | gimple def_stmt = NULL; | |
356 | int usecount = 0; | |
b5b8b0ac | 357 | tree value = NULL; |
b5b8b0ac AO |
358 | |
359 | if (!MAY_HAVE_DEBUG_STMTS) | |
360 | return; | |
361 | ||
74e12783 RH |
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. */ | |
0ca5af51 | 369 | FOR_EACH_IMM_USE_FAST (use_p, imm_iter, var) |
b5b8b0ac | 370 | { |
0ca5af51 | 371 | stmt = USE_STMT (use_p); |
b5b8b0ac | 372 | |
0ca5af51 | 373 | if (!gimple_debug_bind_p (stmt)) |
b5b8b0ac AO |
374 | continue; |
375 | ||
0ca5af51 AO |
376 | if (usecount++) |
377 | break; | |
378 | ||
379 | if (gimple_debug_bind_get_value (stmt) != var) | |
b5b8b0ac | 380 | { |
0ca5af51 AO |
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 | } | |
b5b8b0ac | 388 | |
0ca5af51 AO |
389 | if (!usecount) |
390 | return; | |
b5b8b0ac | 391 | |
0ca5af51 AO |
392 | if (gsi) |
393 | def_stmt = gsi_stmt (*gsi); | |
394 | else | |
395 | def_stmt = SSA_NAME_DEF_STMT (var); | |
b5b8b0ac | 396 | |
0ca5af51 AO |
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. */ | |
42a06e46 AO |
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; | |
0c5f6539 JJ |
405 | /* error_mark_node is what fixup_noreturn_call changes PHI arguments |
406 | to. */ | |
407 | else if (value == error_mark_node) | |
408 | value = NULL; | |
42a06e46 AO |
409 | } |
410 | else if (is_gimple_assign (def_stmt)) | |
0ca5af51 AO |
411 | { |
412 | bool no_value = false; | |
b5b8b0ac | 413 | |
0ca5af51 AO |
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)) | |
462b701b | 447 | || walk_gimple_op (def_stmt, find_released_ssa_name, &wi)) |
0ca5af51 | 448 | no_value = true; |
b5b8b0ac AO |
449 | } |
450 | ||
0ca5af51 AO |
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) | |
42a06e46 | 472 | || gimple_code (def_stmt) == GIMPLE_PHI |
0ca5af51 AO |
473 | || (usecount == 1 |
474 | && (!gimple_assign_single_p (def_stmt) | |
475 | || is_gimple_min_invariant (value))) | |
476 | || is_gimple_reg (value)) | |
2724573f | 477 | ; |
0ca5af51 | 478 | else |
b5b8b0ac | 479 | { |
0ca5af51 AO |
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)); | |
b5b8b0ac | 493 | |
0ca5af51 AO |
494 | if (gsi) |
495 | gsi_insert_before (gsi, def_temp, GSI_SAME_STMT); | |
496 | else | |
b5b8b0ac | 497 | { |
0ca5af51 AO |
498 | gimple_stmt_iterator ngsi = gsi_for_stmt (def_stmt); |
499 | gsi_insert_before (&ngsi, def_temp, GSI_SAME_STMT); | |
b5b8b0ac AO |
500 | } |
501 | ||
0ca5af51 | 502 | value = vexpr; |
b5b8b0ac | 503 | } |
0ca5af51 | 504 | } |
b5b8b0ac | 505 | |
0ca5af51 AO |
506 | FOR_EACH_IMM_USE_STMT (stmt, imm_iter, var) |
507 | { | |
508 | if (!gimple_debug_bind_p (stmt)) | |
509 | continue; | |
510 | ||
511 | if (value) | |
1bce4ff3 RG |
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. */ | |
2724573f | 519 | SET_USE (use_p, unshare_expr (value)); |
1bce4ff3 RG |
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) | |
59401b92 RG |
523 | { |
524 | gimple_stmt_iterator gsi = gsi_for_stmt (stmt); | |
525 | fold_stmt_inplace (&gsi); | |
526 | } | |
1bce4ff3 | 527 | } |
0ca5af51 AO |
528 | else |
529 | gimple_debug_bind_reset_value (stmt); | |
b5b8b0ac AO |
530 | |
531 | update_stmt (stmt); | |
532 | } | |
533 | } | |
534 | ||
535 | ||
0ca5af51 AO |
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. */ | |
b5b8b0ac AO |
539 | |
540 | void | |
0ca5af51 | 541 | insert_debug_temps_for_defs (gimple_stmt_iterator *gsi) |
b5b8b0ac | 542 | { |
0ca5af51 | 543 | gimple stmt; |
b5b8b0ac AO |
544 | ssa_op_iter op_iter; |
545 | def_operand_p def_p; | |
546 | ||
547 | if (!MAY_HAVE_DEBUG_STMTS) | |
548 | return; | |
549 | ||
0ca5af51 AO |
550 | stmt = gsi_stmt (*gsi); |
551 | ||
42a06e46 | 552 | FOR_EACH_PHI_OR_STMT_DEF (def_p, stmt, op_iter, SSA_OP_DEF) |
b5b8b0ac AO |
553 | { |
554 | tree var = DEF_FROM_PTR (def_p); | |
555 | ||
556 | if (TREE_CODE (var) != SSA_NAME) | |
557 | continue; | |
558 | ||
0ca5af51 | 559 | insert_debug_temp_for_var_def (gsi, var); |
b5b8b0ac AO |
560 | } |
561 | } | |
562 | ||
b03c3082 JJ |
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 | ||
ae0a4449 AO |
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 | ||
53b4bf74 | 662 | /* Return true if SSA_NAME is malformed and mark it visited. |
6de9cd9a | 663 | |
53b4bf74 DN |
664 | IS_VIRTUAL is true if this SSA_NAME was found inside a virtual |
665 | operand. */ | |
6de9cd9a DN |
666 | |
667 | static bool | |
53b4bf74 | 668 | verify_ssa_name (tree ssa_name, bool is_virtual) |
6de9cd9a | 669 | { |
6de9cd9a DN |
670 | if (TREE_CODE (ssa_name) != SSA_NAME) |
671 | { | |
ab532386 | 672 | error ("expected an SSA_NAME object"); |
53b4bf74 | 673 | return true; |
6de9cd9a DN |
674 | } |
675 | ||
a011aa39 | 676 | if (SSA_NAME_IN_FREE_LIST (ssa_name)) |
bbc630f5 | 677 | { |
a011aa39 | 678 | error ("found an SSA_NAME that had been released into the free pool"); |
bbc630f5 DN |
679 | return true; |
680 | } | |
681 | ||
a011aa39 RB |
682 | if (SSA_NAME_VAR (ssa_name) != NULL_TREE |
683 | && TREE_TYPE (ssa_name) != TREE_TYPE (SSA_NAME_VAR (ssa_name))) | |
53b4bf74 | 684 | { |
a011aa39 | 685 | error ("type mismatch between an SSA_NAME and its symbol"); |
53b4bf74 DN |
686 | return true; |
687 | } | |
688 | ||
ea057359 | 689 | if (is_virtual && !virtual_operand_p (ssa_name)) |
53b4bf74 | 690 | { |
ab532386 | 691 | error ("found a virtual definition for a GIMPLE register"); |
53b4bf74 DN |
692 | return true; |
693 | } | |
694 | ||
5006671f RG |
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 | ||
ea057359 | 701 | if (!is_virtual && virtual_operand_p (ssa_name)) |
53b4bf74 | 702 | { |
ab532386 | 703 | error ("found a real definition for a non-register"); |
53b4bf74 DN |
704 | return true; |
705 | } | |
706 | ||
38635499 | 707 | if (SSA_NAME_IS_DEFAULT_DEF (ssa_name) |
726a989a | 708 | && !gimple_nop_p (SSA_NAME_DEF_STMT (ssa_name))) |
38635499 DN |
709 | { |
710 | error ("found a default name with a non-empty defining statement"); | |
711 | return true; | |
712 | } | |
713 | ||
53b4bf74 DN |
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 | ||
38635499 | 727 | IS_VIRTUAL is true if SSA_NAME is created by a VDEF. */ |
53b4bf74 DN |
728 | |
729 | static bool | |
730 | verify_def (basic_block bb, basic_block *definition_block, tree ssa_name, | |
726a989a | 731 | gimple stmt, bool is_virtual) |
53b4bf74 DN |
732 | { |
733 | if (verify_ssa_name (ssa_name, is_virtual)) | |
734 | goto err; | |
735 | ||
70b5e7dc RG |
736 | if (SSA_NAME_VAR (ssa_name) |
737 | && TREE_CODE (SSA_NAME_VAR (ssa_name)) == RESULT_DECL | |
6938f93f JH |
738 | && DECL_BY_REFERENCE (SSA_NAME_VAR (ssa_name))) |
739 | { | |
d8a07487 | 740 | error ("RESULT_DECL should be read only when DECL_BY_REFERENCE is set"); |
6938f93f JH |
741 | goto err; |
742 | } | |
743 | ||
6de9cd9a DN |
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); | |
53b4bf74 | 748 | goto err; |
6de9cd9a DN |
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"); | |
6de9cd9a | 756 | fprintf (stderr, "Expected definition statement:\n"); |
726a989a | 757 | print_gimple_stmt (stderr, SSA_NAME_DEF_STMT (ssa_name), 4, TDF_VOPS); |
6de9cd9a | 758 | fprintf (stderr, "\nActual definition statement:\n"); |
726a989a | 759 | print_gimple_stmt (stderr, stmt, 4, TDF_VOPS); |
53b4bf74 | 760 | goto err; |
6de9cd9a DN |
761 | } |
762 | ||
53b4bf74 DN |
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"); | |
726a989a | 769 | print_gimple_stmt (stderr, stmt, 4, TDF_VOPS); |
53b4bf74 DN |
770 | |
771 | return true; | |
6de9cd9a DN |
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 | |
53b4bf74 DN |
784 | arguments). |
785 | ||
b1d16eff ZD |
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. */ | |
6de9cd9a DN |
788 | |
789 | static bool | |
f430bae8 | 790 | verify_use (basic_block bb, basic_block def_bb, use_operand_p use_p, |
726a989a | 791 | gimple stmt, bool check_abnormal, bitmap names_defined_in_bb) |
6de9cd9a DN |
792 | { |
793 | bool err = false; | |
f430bae8 | 794 | tree ssa_name = USE_FROM_PTR (use_p); |
6de9cd9a | 795 | |
f430bae8 AM |
796 | if (!TREE_VISITED (ssa_name)) |
797 | if (verify_imm_links (stderr, ssa_name)) | |
798 | err = true; | |
799 | ||
28a3618f | 800 | TREE_VISITED (ssa_name) = 1; |
53b4bf74 | 801 | |
726a989a | 802 | if (gimple_nop_p (SSA_NAME_DEF_STMT (ssa_name)) |
38635499 | 803 | && SSA_NAME_IS_DEFAULT_DEF (ssa_name)) |
53b4bf74 | 804 | ; /* Default definitions have empty statements. Nothing to do. */ |
6de9cd9a DN |
805 | else if (!def_bb) |
806 | { | |
ab532386 | 807 | error ("missing definition"); |
6de9cd9a DN |
808 | err = true; |
809 | } | |
810 | else if (bb != def_bb | |
811 | && !dominated_by_p (CDI_DOMINATORS, bb, def_bb)) | |
812 | { | |
ab532386 | 813 | error ("definition in block %i does not dominate use in block %i", |
6de9cd9a DN |
814 | def_bb->index, bb->index); |
815 | err = true; | |
816 | } | |
b1d16eff ZD |
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 | { | |
ab532386 | 821 | error ("definition in block %i follows the use", def_bb->index); |
b1d16eff ZD |
822 | err = true; |
823 | } | |
6de9cd9a DN |
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 | ||
b8698a0f | 832 | /* Make sure the use is in an appropriate list by checking the previous |
f3b569ca | 833 | element to make sure it's the same. */ |
f430bae8 AM |
834 | if (use_p->prev == NULL) |
835 | { | |
ab532386 | 836 | error ("no immediate_use list"); |
f430bae8 AM |
837 | err = true; |
838 | } | |
839 | else | |
840 | { | |
726a989a | 841 | tree listvar; |
f430bae8 | 842 | if (use_p->prev->use == NULL) |
726a989a | 843 | listvar = use_p->prev->loc.ssa_name; |
f430bae8 AM |
844 | else |
845 | listvar = USE_FROM_PTR (use_p->prev); | |
846 | if (listvar != ssa_name) | |
847 | { | |
ab532386 | 848 | error ("wrong immediate use list"); |
f430bae8 AM |
849 | err = true; |
850 | } | |
851 | } | |
852 | ||
6de9cd9a DN |
853 | if (err) |
854 | { | |
855 | fprintf (stderr, "for SSA_NAME: "); | |
7bab95ba | 856 | print_generic_expr (stderr, ssa_name, TDF_VOPS); |
0bca51f0 | 857 | fprintf (stderr, " in statement:\n"); |
726a989a | 858 | print_gimple_stmt (stderr, stmt, 0, TDF_VOPS); |
6de9cd9a DN |
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 | ||
38635499 DN |
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. */ | |
6de9cd9a DN |
872 | |
873 | static bool | |
726a989a | 874 | verify_phi_args (gimple phi, basic_block bb, basic_block *definition_block) |
6de9cd9a DN |
875 | { |
876 | edge e; | |
877 | bool err = false; | |
726a989a | 878 | size_t i, phi_num_args = gimple_phi_num_args (phi); |
6de9cd9a | 879 | |
609d9bed JL |
880 | if (EDGE_COUNT (bb->preds) != phi_num_args) |
881 | { | |
ab532386 | 882 | error ("incoming edge count does not match number of PHI arguments"); |
609d9bed JL |
883 | err = true; |
884 | goto error; | |
885 | } | |
886 | ||
6de9cd9a DN |
887 | for (i = 0; i < phi_num_args; i++) |
888 | { | |
726a989a | 889 | use_operand_p op_p = gimple_phi_arg_imm_use_ptr (phi, i); |
f430bae8 AM |
890 | tree op = USE_FROM_PTR (op_p); |
891 | ||
62112e35 | 892 | e = EDGE_PRED (bb, i); |
6b66c718 KH |
893 | |
894 | if (op == NULL_TREE) | |
895 | { | |
ab532386 | 896 | error ("PHI argument is missing for edge %d->%d", |
6b66c718 KH |
897 | e->src->index, |
898 | e->dest->index); | |
899 | err = true; | |
900 | goto error; | |
901 | } | |
902 | ||
609d9bed JL |
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 | ||
6de9cd9a | 909 | if (TREE_CODE (op) == SSA_NAME) |
38635499 | 910 | { |
ea057359 | 911 | err = verify_ssa_name (op, virtual_operand_p (gimple_phi_result (phi))); |
38635499 DN |
912 | err |= verify_use (e->src, definition_block[SSA_NAME_VERSION (op)], |
913 | op_p, phi, e->flags & EDGE_ABNORMAL, NULL); | |
914 | } | |
6de9cd9a | 915 | |
628c189e RG |
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 | ||
6de9cd9a DN |
931 | if (e->dest != bb) |
932 | { | |
ab532386 | 933 | error ("wrong edge %d->%d for PHI argument", |
ea40ba9c | 934 | e->src->index, e->dest->index); |
6de9cd9a DN |
935 | err = true; |
936 | } | |
937 | ||
6de9cd9a DN |
938 | if (err) |
939 | { | |
940 | fprintf (stderr, "PHI argument\n"); | |
7bab95ba | 941 | print_generic_stmt (stderr, op, TDF_VOPS); |
53b4bf74 | 942 | goto error; |
6de9cd9a | 943 | } |
6de9cd9a DN |
944 | } |
945 | ||
53b4bf74 | 946 | error: |
6de9cd9a DN |
947 | if (err) |
948 | { | |
949 | fprintf (stderr, "for PHI node\n"); | |
726a989a | 950 | print_gimple_stmt (stderr, phi, 0, TDF_VOPS|TDF_MEMSYMS); |
6de9cd9a DN |
951 | } |
952 | ||
953 | ||
954 | return err; | |
955 | } | |
956 | ||
957 | ||
958 | /* Verify common invariants in the SSA web. | |
959 | TODO: verify the variable annotations. */ | |
960 | ||
24e47c76 | 961 | DEBUG_FUNCTION void |
f430bae8 | 962 | verify_ssa (bool check_modified_stmt) |
6de9cd9a | 963 | { |
53b4bf74 | 964 | size_t i; |
6de9cd9a | 965 | basic_block bb; |
858904db | 966 | basic_block *definition_block = XCNEWVEC (basic_block, num_ssa_names); |
4c124b4c AM |
967 | ssa_op_iter iter; |
968 | tree op; | |
2b28c07a | 969 | enum dom_state orig_dom_state = dom_info_state (CDI_DOMINATORS); |
8bdbfff5 | 970 | bitmap names_defined_in_bb = BITMAP_ALLOC (NULL); |
6de9cd9a | 971 | |
5006671f | 972 | gcc_assert (!need_ssa_update_p (cfun)); |
84d65814 | 973 | |
6de9cd9a DN |
974 | timevar_push (TV_TREE_SSA_VERIFY); |
975 | ||
53b4bf74 DN |
976 | /* Keep track of SSA names present in the IL. */ |
977 | for (i = 1; i < num_ssa_names; i++) | |
6de9cd9a | 978 | { |
609d9bed JL |
979 | tree name = ssa_name (i); |
980 | if (name) | |
6de9cd9a | 981 | { |
726a989a | 982 | gimple stmt; |
609d9bed | 983 | TREE_VISITED (name) = 0; |
6de9cd9a | 984 | |
ea057359 | 985 | verify_ssa_name (name, virtual_operand_p (name)); |
bc590dfb | 986 | |
609d9bed | 987 | stmt = SSA_NAME_DEF_STMT (name); |
726a989a | 988 | if (!gimple_nop_p (stmt)) |
53b4bf74 | 989 | { |
726a989a | 990 | basic_block bb = gimple_bb (stmt); |
609d9bed | 991 | verify_def (bb, definition_block, |
ea057359 | 992 | name, stmt, virtual_operand_p (name)); |
609d9bed | 993 | |
6de9cd9a DN |
994 | } |
995 | } | |
996 | } | |
997 | ||
609d9bed | 998 | calculate_dominance_info (CDI_DOMINATORS); |
6de9cd9a DN |
999 | |
1000 | /* Now verify all the uses and make sure they agree with the definitions | |
1001 | found in the previous pass. */ | |
1002 | FOR_EACH_BB (bb) | |
1003 | { | |
1004 | edge e; | |
726a989a | 1005 | gimple phi; |
628f6a4e | 1006 | edge_iterator ei; |
726a989a | 1007 | gimple_stmt_iterator gsi; |
6de9cd9a DN |
1008 | |
1009 | /* Make sure that all edges have a clear 'aux' field. */ | |
628f6a4e | 1010 | FOR_EACH_EDGE (e, ei, bb->preds) |
6de9cd9a DN |
1011 | { |
1012 | if (e->aux) | |
1013 | { | |
ab532386 | 1014 | error ("AUX pointer initialized for edge %d->%d", e->src->index, |
6de9cd9a | 1015 | e->dest->index); |
53b4bf74 | 1016 | goto err; |
6de9cd9a DN |
1017 | } |
1018 | } | |
1019 | ||
1020 | /* Verify the arguments for every PHI node in the block. */ | |
726a989a | 1021 | for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
b1d16eff | 1022 | { |
726a989a | 1023 | phi = gsi_stmt (gsi); |
b1d16eff ZD |
1024 | if (verify_phi_args (phi, bb, definition_block)) |
1025 | goto err; | |
38635499 | 1026 | |
b1d16eff | 1027 | bitmap_set_bit (names_defined_in_bb, |
726a989a | 1028 | SSA_NAME_VERSION (gimple_phi_result (phi))); |
b1d16eff | 1029 | } |
6de9cd9a | 1030 | |
53b4bf74 | 1031 | /* Now verify all the uses and vuses in every statement of the block. */ |
726a989a | 1032 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
6de9cd9a | 1033 | { |
726a989a | 1034 | gimple stmt = gsi_stmt (gsi); |
f430bae8 AM |
1035 | use_operand_p use_p; |
1036 | ||
726a989a | 1037 | if (check_modified_stmt && gimple_modified_p (stmt)) |
f430bae8 | 1038 | { |
38635499 | 1039 | error ("stmt (%p) marked modified after optimization pass: ", |
f47c96aa | 1040 | (void *)stmt); |
726a989a | 1041 | print_gimple_stmt (stderr, stmt, 0, TDF_VOPS); |
f430bae8 AM |
1042 | goto err; |
1043 | } | |
6de9cd9a | 1044 | |
6a58ccca | 1045 | if (verify_ssa_operands (cfun, stmt)) |
5006671f | 1046 | { |
bc590dfb | 1047 | print_gimple_stmt (stderr, stmt, 0, TDF_VOPS); |
5006671f | 1048 | goto err; |
38635499 DN |
1049 | } |
1050 | ||
bc590dfb RG |
1051 | if (gimple_debug_bind_p (stmt) |
1052 | && !gimple_debug_bind_has_value_p (stmt)) | |
1053 | continue; | |
38635499 DN |
1054 | |
1055 | FOR_EACH_SSA_USE_OPERAND (use_p, stmt, iter, SSA_OP_USE|SSA_OP_VUSE) | |
6de9cd9a | 1056 | { |
f430bae8 | 1057 | op = USE_FROM_PTR (use_p); |
53b4bf74 | 1058 | if (verify_use (bb, definition_block[SSA_NAME_VERSION (op)], |
38635499 | 1059 | use_p, stmt, false, names_defined_in_bb)) |
b1d16eff ZD |
1060 | goto err; |
1061 | } | |
1062 | ||
1063 | FOR_EACH_SSA_TREE_OPERAND (op, stmt, iter, SSA_OP_ALL_DEFS) | |
5006671f RG |
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 | } | |
b1d16eff ZD |
1077 | } |
1078 | ||
b1d16eff | 1079 | bitmap_clear (names_defined_in_bb); |
6de9cd9a DN |
1080 | } |
1081 | ||
53b4bf74 | 1082 | free (definition_block); |
84d65814 | 1083 | |
b01d837f KH |
1084 | /* Restore the dominance information to its prior known state, so |
1085 | that we do not perturb the compiler's subsequent behavior. */ | |
03261822 NS |
1086 | if (orig_dom_state == DOM_NONE) |
1087 | free_dominance_info (CDI_DOMINATORS); | |
1088 | else | |
2b28c07a | 1089 | set_dom_info_availability (CDI_DOMINATORS, orig_dom_state); |
b8698a0f | 1090 | |
8bdbfff5 | 1091 | BITMAP_FREE (names_defined_in_bb); |
6de9cd9a | 1092 | timevar_pop (TV_TREE_SSA_VERIFY); |
53b4bf74 | 1093 | return; |
6de9cd9a | 1094 | |
53b4bf74 | 1095 | err: |
ab532386 | 1096 | internal_error ("verify_ssa failed"); |
6de9cd9a DN |
1097 | } |
1098 | ||
e445a2ff RG |
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 | ||
6de9cd9a | 1117 | |
6de9cd9a DN |
1118 | /* Initialize global DFA and SSA structures. */ |
1119 | ||
1120 | void | |
5db9ba0c | 1121 | init_tree_ssa (struct function *fn) |
6de9cd9a | 1122 | { |
a9429e29 | 1123 | fn->gimple_df = ggc_alloc_cleared_gimple_df (); |
b8698a0f | 1124 | fn->gimple_df->default_defs = htab_create_ggc (20, uid_ssaname_map_hash, |
5db9ba0c | 1125 | uid_ssaname_map_eq, NULL); |
5006671f | 1126 | pt_solution_reset (&fn->gimple_df->escaped); |
5db9ba0c | 1127 | init_ssanames (fn, 0); |
6de9cd9a DN |
1128 | } |
1129 | ||
452aa9c5 RG |
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. */ | |
afdec9bd | 1137 | gcc_assert (!cfun->gimple_df); |
452aa9c5 RG |
1138 | init_tree_ssa (cfun); |
1139 | return 0; | |
1140 | } | |
1141 | ||
afdec9bd JH |
1142 | /* Gate for IPCP optimization. */ |
1143 | ||
1144 | static bool | |
1145 | gate_init_datastructures (void) | |
1146 | { | |
1147 | /* Do nothing for funcions that was produced already in SSA form. */ | |
1148 | return !(cfun->curr_properties & PROP_ssa); | |
1149 | } | |
1150 | ||
27a4cd48 DM |
1151 | namespace { |
1152 | ||
1153 | const pass_data pass_data_init_datastructures = | |
452aa9c5 | 1154 | { |
27a4cd48 DM |
1155 | GIMPLE_PASS, /* type */ |
1156 | "*init_datastructures", /* name */ | |
1157 | OPTGROUP_NONE, /* optinfo_flags */ | |
afdec9bd | 1158 | true, /* has_gate */ |
27a4cd48 DM |
1159 | true, /* has_execute */ |
1160 | TV_NONE, /* tv_id */ | |
1161 | PROP_cfg, /* properties_required */ | |
1162 | 0, /* properties_provided */ | |
1163 | 0, /* properties_destroyed */ | |
1164 | 0, /* todo_flags_start */ | |
1165 | 0, /* todo_flags_finish */ | |
452aa9c5 | 1166 | }; |
6de9cd9a | 1167 | |
27a4cd48 DM |
1168 | class pass_init_datastructures : public gimple_opt_pass |
1169 | { | |
1170 | public: | |
c3284718 RS |
1171 | pass_init_datastructures (gcc::context *ctxt) |
1172 | : gimple_opt_pass (pass_data_init_datastructures, ctxt) | |
27a4cd48 DM |
1173 | {} |
1174 | ||
1175 | /* opt_pass methods: */ | |
afdec9bd | 1176 | bool gate () { return gate_init_datastructures (); } |
27a4cd48 DM |
1177 | unsigned int execute () { return execute_init_datastructures (); } |
1178 | ||
1179 | }; // class pass_init_datastructures | |
1180 | ||
1181 | } // anon namespace | |
1182 | ||
1183 | gimple_opt_pass * | |
1184 | make_pass_init_datastructures (gcc::context *ctxt) | |
1185 | { | |
1186 | return new pass_init_datastructures (ctxt); | |
1187 | } | |
1188 | ||
6de9cd9a DN |
1189 | /* Deallocate memory associated with SSA data structures for FNDECL. */ |
1190 | ||
1191 | void | |
1192 | delete_tree_ssa (void) | |
1193 | { | |
6de9cd9a | 1194 | fini_ssanames (); |
726a989a RB |
1195 | |
1196 | /* We no longer maintain the SSA operand cache at this point. */ | |
2eb712b4 | 1197 | if (ssa_operands_active (cfun)) |
6a58ccca | 1198 | fini_ssa_operands (cfun); |
6de9cd9a | 1199 | |
5cd4ec7f | 1200 | htab_delete (cfun->gimple_df->default_defs); |
adb6509f | 1201 | cfun->gimple_df->default_defs = NULL; |
5006671f | 1202 | pt_solution_reset (&cfun->gimple_df->escaped); |
55b34b5f RG |
1203 | if (cfun->gimple_df->decls_to_pointers != NULL) |
1204 | pointer_map_destroy (cfun->gimple_df->decls_to_pointers); | |
1205 | cfun->gimple_df->decls_to_pointers = NULL; | |
5cd4ec7f | 1206 | cfun->gimple_df->modified_noreturn_calls = NULL; |
adb6509f | 1207 | cfun->gimple_df = NULL; |
ea7e6d5a AH |
1208 | |
1209 | /* We no longer need the edge variable maps. */ | |
1210 | redirect_edge_var_map_destroy (); | |
6de9cd9a DN |
1211 | } |
1212 | ||
6de9cd9a DN |
1213 | /* Return true if EXPR is a useless type conversion, otherwise return |
1214 | false. */ | |
1215 | ||
1216 | bool | |
1217 | tree_ssa_useless_type_conversion (tree expr) | |
1218 | { | |
1219 | /* If we have an assignment that merely uses a NOP_EXPR to change | |
1220 | the top of the RHS to the type of the LHS and the type conversion | |
1221 | is "safe", then strip away the type conversion so that we can | |
1222 | enter LHS = RHS into the const_and_copies table. */ | |
1043771b | 1223 | if (CONVERT_EXPR_P (expr) |
580d124f RK |
1224 | || TREE_CODE (expr) == VIEW_CONVERT_EXPR |
1225 | || TREE_CODE (expr) == NON_LVALUE_EXPR) | |
36618b93 | 1226 | return useless_type_conversion_p |
5039610b | 1227 | (TREE_TYPE (expr), |
726a989a | 1228 | TREE_TYPE (TREE_OPERAND (expr, 0))); |
6de9cd9a DN |
1229 | |
1230 | return false; | |
1231 | } | |
1232 | ||
23314e77 AN |
1233 | /* Strip conversions from EXP according to |
1234 | tree_ssa_useless_type_conversion and return the resulting | |
1235 | expression. */ | |
1236 | ||
1237 | tree | |
1238 | tree_ssa_strip_useless_type_conversions (tree exp) | |
1239 | { | |
1240 | while (tree_ssa_useless_type_conversion (exp)) | |
1241 | exp = TREE_OPERAND (exp, 0); | |
1242 | return exp; | |
1243 | } | |
1244 | ||
6de9cd9a | 1245 | |
c152901f AM |
1246 | /* Return true if T, an SSA_NAME, has an undefined value. */ |
1247 | ||
1248 | bool | |
1249 | ssa_undefined_value_p (tree t) | |
1250 | { | |
1251 | tree var = SSA_NAME_VAR (t); | |
1252 | ||
1253 | if (!var) | |
1254 | ; | |
1255 | /* Parameters get their initial value from the function entry. */ | |
1256 | else if (TREE_CODE (var) == PARM_DECL) | |
1257 | return false; | |
1258 | /* When returning by reference the return address is actually a hidden | |
1259 | parameter. */ | |
1260 | else if (TREE_CODE (var) == RESULT_DECL && DECL_BY_REFERENCE (var)) | |
1261 | return false; | |
1262 | /* Hard register variables get their initial value from the ether. */ | |
1263 | else if (TREE_CODE (var) == VAR_DECL && DECL_HARD_REGISTER (var)) | |
1264 | return false; | |
1265 | ||
1266 | /* The value is undefined iff its definition statement is empty. */ | |
1267 | return gimple_nop_p (SSA_NAME_DEF_STMT (t)); | |
1268 | } | |
1269 | ||
1270 | ||
70f34814 RG |
1271 | /* If necessary, rewrite the base of the reference tree *TP from |
1272 | a MEM_REF to a plain or converted symbol. */ | |
1273 | ||
1274 | static void | |
13714310 | 1275 | maybe_rewrite_mem_ref_base (tree *tp, bitmap suitable_for_renaming) |
70f34814 RG |
1276 | { |
1277 | tree sym; | |
1278 | ||
1279 | while (handled_component_p (*tp)) | |
1280 | tp = &TREE_OPERAND (*tp, 0); | |
1281 | if (TREE_CODE (*tp) == MEM_REF | |
1282 | && TREE_CODE (TREE_OPERAND (*tp, 0)) == ADDR_EXPR | |
70f34814 RG |
1283 | && (sym = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0)) |
1284 | && DECL_P (sym) | |
1285 | && !TREE_ADDRESSABLE (sym) | |
13714310 | 1286 | && bitmap_bit_p (suitable_for_renaming, DECL_UID (sym))) |
70f34814 | 1287 | { |
b2ad5e37 RG |
1288 | if (TREE_CODE (TREE_TYPE (sym)) == VECTOR_TYPE |
1289 | && useless_type_conversion_p (TREE_TYPE (*tp), | |
1290 | TREE_TYPE (TREE_TYPE (sym))) | |
1291 | && multiple_of_p (sizetype, TREE_OPERAND (*tp, 1), | |
1292 | TYPE_SIZE_UNIT (TREE_TYPE (*tp)))) | |
1293 | { | |
1294 | *tp = build3 (BIT_FIELD_REF, TREE_TYPE (*tp), sym, | |
1295 | TYPE_SIZE (TREE_TYPE (*tp)), | |
1296 | int_const_binop (MULT_EXPR, | |
1297 | bitsize_int (BITS_PER_UNIT), | |
d35936ab | 1298 | TREE_OPERAND (*tp, 1))); |
b2ad5e37 | 1299 | } |
64a3d647 RG |
1300 | else if (TREE_CODE (TREE_TYPE (sym)) == COMPLEX_TYPE |
1301 | && useless_type_conversion_p (TREE_TYPE (*tp), | |
1302 | TREE_TYPE (TREE_TYPE (sym)))) | |
1303 | { | |
1304 | *tp = build1 (integer_zerop (TREE_OPERAND (*tp, 1)) | |
1305 | ? REALPART_EXPR : IMAGPART_EXPR, | |
1306 | TREE_TYPE (*tp), sym); | |
1307 | } | |
b2ad5e37 RG |
1308 | else if (integer_zerop (TREE_OPERAND (*tp, 1))) |
1309 | { | |
1310 | if (!useless_type_conversion_p (TREE_TYPE (*tp), | |
1311 | TREE_TYPE (sym))) | |
1312 | *tp = build1 (VIEW_CONVERT_EXPR, | |
1313 | TREE_TYPE (*tp), sym); | |
1314 | else | |
1315 | *tp = sym; | |
1316 | } | |
70f34814 RG |
1317 | } |
1318 | } | |
1319 | ||
ad650c92 RG |
1320 | /* For a tree REF return its base if it is the base of a MEM_REF |
1321 | that cannot be rewritten into SSA form. Otherwise return NULL_TREE. */ | |
1322 | ||
1323 | static tree | |
1324 | non_rewritable_mem_ref_base (tree ref) | |
1325 | { | |
1326 | tree base = ref; | |
1327 | ||
1328 | /* A plain decl does not need it set. */ | |
1329 | if (DECL_P (ref)) | |
1330 | return NULL_TREE; | |
1331 | ||
1332 | while (handled_component_p (base)) | |
1333 | base = TREE_OPERAND (base, 0); | |
1334 | ||
1335 | /* But watch out for MEM_REFs we cannot lower to a | |
b2ad5e37 | 1336 | VIEW_CONVERT_EXPR or a BIT_FIELD_REF. */ |
ad650c92 RG |
1337 | if (TREE_CODE (base) == MEM_REF |
1338 | && TREE_CODE (TREE_OPERAND (base, 0)) == ADDR_EXPR) | |
1339 | { | |
1340 | tree decl = TREE_OPERAND (TREE_OPERAND (base, 0), 0); | |
64a3d647 RG |
1341 | if ((TREE_CODE (TREE_TYPE (decl)) == VECTOR_TYPE |
1342 | || TREE_CODE (TREE_TYPE (decl)) == COMPLEX_TYPE) | |
b2ad5e37 RG |
1343 | && useless_type_conversion_p (TREE_TYPE (base), |
1344 | TREE_TYPE (TREE_TYPE (decl))) | |
27bcd47c LC |
1345 | && mem_ref_offset (base).fits_uhwi () |
1346 | && tree_to_double_int (TYPE_SIZE_UNIT (TREE_TYPE (decl))) | |
1347 | .ugt (mem_ref_offset (base)) | |
b2ad5e37 RG |
1348 | && multiple_of_p (sizetype, TREE_OPERAND (base, 1), |
1349 | TYPE_SIZE_UNIT (TREE_TYPE (base)))) | |
1350 | return NULL_TREE; | |
ad650c92 RG |
1351 | if (DECL_P (decl) |
1352 | && (!integer_zerop (TREE_OPERAND (base, 1)) | |
1353 | || (DECL_SIZE (decl) | |
02ff830b RG |
1354 | != TYPE_SIZE (TREE_TYPE (base))) |
1355 | || TREE_THIS_VOLATILE (decl) != TREE_THIS_VOLATILE (base))) | |
ad650c92 RG |
1356 | return decl; |
1357 | } | |
1358 | ||
1359 | return NULL_TREE; | |
1360 | } | |
1361 | ||
c0aae19c RG |
1362 | /* For an lvalue tree LHS return true if it cannot be rewritten into SSA form. |
1363 | Otherwise return true. */ | |
1364 | ||
1365 | static bool | |
1366 | non_rewritable_lvalue_p (tree lhs) | |
1367 | { | |
1368 | /* A plain decl is always rewritable. */ | |
1369 | if (DECL_P (lhs)) | |
1370 | return false; | |
1371 | ||
1372 | /* A decl that is wrapped inside a MEM-REF that covers | |
1373 | it full is also rewritable. | |
1374 | ??? The following could be relaxed allowing component | |
62902f3f | 1375 | references that do not change the access size. */ |
c0aae19c RG |
1376 | if (TREE_CODE (lhs) == MEM_REF |
1377 | && TREE_CODE (TREE_OPERAND (lhs, 0)) == ADDR_EXPR | |
1378 | && integer_zerop (TREE_OPERAND (lhs, 1))) | |
1379 | { | |
1380 | tree decl = TREE_OPERAND (TREE_OPERAND (lhs, 0), 0); | |
1381 | if (DECL_P (decl) | |
1382 | && DECL_SIZE (decl) == TYPE_SIZE (TREE_TYPE (lhs)) | |
1383 | && (TREE_THIS_VOLATILE (decl) == TREE_THIS_VOLATILE (lhs))) | |
1384 | return false; | |
1385 | } | |
1386 | ||
1387 | return true; | |
1388 | } | |
1389 | ||
f61c8291 EB |
1390 | /* When possible, clear TREE_ADDRESSABLE bit or set DECL_GIMPLE_REG_P bit and |
1391 | mark the variable VAR for conversion into SSA. Return true when updating | |
1392 | stmts is required. */ | |
ad650c92 | 1393 | |
13714310 RG |
1394 | static void |
1395 | maybe_optimize_var (tree var, bitmap addresses_taken, bitmap not_reg_needs, | |
1396 | bitmap suitable_for_renaming) | |
ad650c92 | 1397 | { |
ad650c92 RG |
1398 | /* Global Variables, result decls cannot be changed. */ |
1399 | if (is_global_var (var) | |
1400 | || TREE_CODE (var) == RESULT_DECL | |
1401 | || bitmap_bit_p (addresses_taken, DECL_UID (var))) | |
13714310 | 1402 | return; |
3f2930d8 | 1403 | |
ad650c92 RG |
1404 | if (TREE_ADDRESSABLE (var) |
1405 | /* Do not change TREE_ADDRESSABLE if we need to preserve var as | |
1406 | a non-register. Otherwise we are confused and forget to | |
1407 | add virtual operands for it. */ | |
1408 | && (!is_gimple_reg_type (TREE_TYPE (var)) | |
9a6b63c3 JJ |
1409 | || TREE_CODE (TREE_TYPE (var)) == VECTOR_TYPE |
1410 | || TREE_CODE (TREE_TYPE (var)) == COMPLEX_TYPE | |
ad650c92 RG |
1411 | || !bitmap_bit_p (not_reg_needs, DECL_UID (var)))) |
1412 | { | |
1413 | TREE_ADDRESSABLE (var) = 0; | |
1414 | if (is_gimple_reg (var)) | |
13714310 | 1415 | bitmap_set_bit (suitable_for_renaming, DECL_UID (var)); |
ad650c92 RG |
1416 | if (dump_file) |
1417 | { | |
f61c8291 | 1418 | fprintf (dump_file, "No longer having address taken: "); |
ad650c92 RG |
1419 | print_generic_expr (dump_file, var, 0); |
1420 | fprintf (dump_file, "\n"); | |
1421 | } | |
1422 | } | |
f61c8291 | 1423 | |
ad650c92 RG |
1424 | if (!DECL_GIMPLE_REG_P (var) |
1425 | && !bitmap_bit_p (not_reg_needs, DECL_UID (var)) | |
1426 | && (TREE_CODE (TREE_TYPE (var)) == COMPLEX_TYPE | |
1427 | || TREE_CODE (TREE_TYPE (var)) == VECTOR_TYPE) | |
1428 | && !TREE_THIS_VOLATILE (var) | |
1429 | && (TREE_CODE (var) != VAR_DECL || !DECL_HARD_REGISTER (var))) | |
1430 | { | |
1431 | DECL_GIMPLE_REG_P (var) = 1; | |
13714310 | 1432 | bitmap_set_bit (suitable_for_renaming, DECL_UID (var)); |
ad650c92 RG |
1433 | if (dump_file) |
1434 | { | |
f61c8291 | 1435 | fprintf (dump_file, "Now a gimple register: "); |
ad650c92 RG |
1436 | print_generic_expr (dump_file, var, 0); |
1437 | fprintf (dump_file, "\n"); | |
1438 | } | |
1439 | } | |
ad650c92 RG |
1440 | } |
1441 | ||
f22b7039 | 1442 | /* Compute TREE_ADDRESSABLE and DECL_GIMPLE_REG_P for local variables. */ |
201b2ead | 1443 | |
5006671f | 1444 | void |
f61c8291 | 1445 | execute_update_addresses_taken (void) |
201b2ead | 1446 | { |
726a989a | 1447 | gimple_stmt_iterator gsi; |
201b2ead JH |
1448 | basic_block bb; |
1449 | bitmap addresses_taken = BITMAP_ALLOC (NULL); | |
f22b7039 | 1450 | bitmap not_reg_needs = BITMAP_ALLOC (NULL); |
13714310 | 1451 | bitmap suitable_for_renaming = BITMAP_ALLOC (NULL); |
f61c8291 | 1452 | tree var; |
ad650c92 | 1453 | unsigned i; |
201b2ead | 1454 | |
a222c01a MM |
1455 | timevar_push (TV_ADDRESS_TAKEN); |
1456 | ||
201b2ead JH |
1457 | /* Collect into ADDRESSES_TAKEN all variables whose address is taken within |
1458 | the function body. */ | |
1459 | FOR_EACH_BB (bb) | |
1460 | { | |
726a989a | 1461 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
201b2ead | 1462 | { |
ccacdf06 | 1463 | gimple stmt = gsi_stmt (gsi); |
f22b7039 | 1464 | enum gimple_code code = gimple_code (stmt); |
ad650c92 | 1465 | tree decl; |
ccacdf06 RG |
1466 | |
1467 | /* Note all addresses taken by the stmt. */ | |
1468 | gimple_ior_addresses_taken (addresses_taken, stmt); | |
1469 | ||
f22b7039 AP |
1470 | /* If we have a call or an assignment, see if the lhs contains |
1471 | a local decl that requires not to be a gimple register. */ | |
1472 | if (code == GIMPLE_ASSIGN || code == GIMPLE_CALL) | |
1473 | { | |
fff1894c | 1474 | tree lhs = gimple_get_lhs (stmt); |
c0aae19c RG |
1475 | if (lhs |
1476 | && TREE_CODE (lhs) != SSA_NAME | |
1477 | && non_rewritable_lvalue_p (lhs)) | |
70f34814 | 1478 | { |
c0aae19c RG |
1479 | decl = get_base_address (lhs); |
1480 | if (DECL_P (decl)) | |
1481 | bitmap_set_bit (not_reg_needs, DECL_UID (decl)); | |
70f34814 RG |
1482 | } |
1483 | } | |
1484 | ||
1485 | if (gimple_assign_single_p (stmt)) | |
1486 | { | |
1487 | tree rhs = gimple_assign_rhs1 (stmt); | |
ad650c92 RG |
1488 | if ((decl = non_rewritable_mem_ref_base (rhs))) |
1489 | bitmap_set_bit (not_reg_needs, DECL_UID (decl)); | |
1490 | } | |
fff1894c | 1491 | |
ad650c92 RG |
1492 | else if (code == GIMPLE_CALL) |
1493 | { | |
1494 | for (i = 0; i < gimple_call_num_args (stmt); ++i) | |
70f34814 | 1495 | { |
ad650c92 RG |
1496 | tree arg = gimple_call_arg (stmt, i); |
1497 | if ((decl = non_rewritable_mem_ref_base (arg))) | |
1498 | bitmap_set_bit (not_reg_needs, DECL_UID (decl)); | |
1499 | } | |
1500 | } | |
1501 | ||
1502 | else if (code == GIMPLE_ASM) | |
1503 | { | |
1504 | for (i = 0; i < gimple_asm_noutputs (stmt); ++i) | |
1505 | { | |
1506 | tree link = gimple_asm_output_op (stmt, i); | |
e5160e93 | 1507 | tree lhs = TREE_VALUE (link); |
62902f3f | 1508 | if (TREE_CODE (lhs) != SSA_NAME) |
e5160e93 | 1509 | { |
c0aae19c | 1510 | decl = get_base_address (lhs); |
62902f3f RG |
1511 | if (DECL_P (decl) |
1512 | && (non_rewritable_lvalue_p (lhs) | |
1513 | /* We cannot move required conversions from | |
1514 | the lhs to the rhs in asm statements, so | |
1515 | require we do not need any. */ | |
1516 | || !useless_type_conversion_p | |
1517 | (TREE_TYPE (lhs), TREE_TYPE (decl)))) | |
c0aae19c | 1518 | bitmap_set_bit (not_reg_needs, DECL_UID (decl)); |
e5160e93 | 1519 | } |
ad650c92 RG |
1520 | } |
1521 | for (i = 0; i < gimple_asm_ninputs (stmt); ++i) | |
1522 | { | |
1523 | tree link = gimple_asm_input_op (stmt, i); | |
1524 | if ((decl = non_rewritable_mem_ref_base (TREE_VALUE (link)))) | |
1525 | bitmap_set_bit (not_reg_needs, DECL_UID (decl)); | |
1526 | } | |
f22b7039 | 1527 | } |
201b2ead | 1528 | } |
726a989a RB |
1529 | |
1530 | for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
201b2ead | 1531 | { |
726a989a RB |
1532 | size_t i; |
1533 | gimple phi = gsi_stmt (gsi); | |
1534 | ||
1535 | for (i = 0; i < gimple_phi_num_args (phi); i++) | |
201b2ead JH |
1536 | { |
1537 | tree op = PHI_ARG_DEF (phi, i), var; | |
1538 | if (TREE_CODE (op) == ADDR_EXPR | |
726a989a | 1539 | && (var = get_base_address (TREE_OPERAND (op, 0))) != NULL |
201b2ead JH |
1540 | && DECL_P (var)) |
1541 | bitmap_set_bit (addresses_taken, DECL_UID (var)); | |
1542 | } | |
1543 | } | |
1544 | } | |
1545 | ||
f61c8291 EB |
1546 | /* We cannot iterate over all referenced vars because that can contain |
1547 | unused vars from BLOCK trees, which causes code generation differences | |
1548 | for -g vs. -g0. */ | |
1549 | for (var = DECL_ARGUMENTS (cfun->decl); var; var = DECL_CHAIN (var)) | |
13714310 RG |
1550 | maybe_optimize_var (var, addresses_taken, not_reg_needs, |
1551 | suitable_for_renaming); | |
f61c8291 | 1552 | |
9771b263 | 1553 | FOR_EACH_VEC_SAFE_ELT (cfun->local_decls, i, var) |
13714310 RG |
1554 | maybe_optimize_var (var, addresses_taken, not_reg_needs, |
1555 | suitable_for_renaming); | |
201b2ead | 1556 | |
f61c8291 | 1557 | /* Operand caches need to be recomputed for operands referencing the updated |
13714310 RG |
1558 | variables and operands need to be rewritten to expose bare symbols. */ |
1559 | if (!bitmap_empty_p (suitable_for_renaming)) | |
5006671f RG |
1560 | { |
1561 | FOR_EACH_BB (bb) | |
c32f25b8 | 1562 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi);) |
70f34814 RG |
1563 | { |
1564 | gimple stmt = gsi_stmt (gsi); | |
5006671f | 1565 | |
70f34814 RG |
1566 | /* Re-write TARGET_MEM_REFs of symbols we want to |
1567 | rewrite into SSA form. */ | |
1568 | if (gimple_assign_single_p (stmt)) | |
1569 | { | |
1570 | tree lhs = gimple_assign_lhs (stmt); | |
1571 | tree rhs, *rhsp = gimple_assign_rhs1_ptr (stmt); | |
1572 | tree sym; | |
1573 | ||
1574 | /* We shouldn't have any fancy wrapping of | |
1575 | component-refs on the LHS, but look through | |
1576 | VIEW_CONVERT_EXPRs as that is easy. */ | |
1577 | while (TREE_CODE (lhs) == VIEW_CONVERT_EXPR) | |
1578 | lhs = TREE_OPERAND (lhs, 0); | |
1579 | if (TREE_CODE (lhs) == MEM_REF | |
1580 | && TREE_CODE (TREE_OPERAND (lhs, 0)) == ADDR_EXPR | |
1581 | && integer_zerop (TREE_OPERAND (lhs, 1)) | |
1582 | && (sym = TREE_OPERAND (TREE_OPERAND (lhs, 0), 0)) | |
1583 | && DECL_P (sym) | |
1584 | && !TREE_ADDRESSABLE (sym) | |
13714310 | 1585 | && bitmap_bit_p (suitable_for_renaming, DECL_UID (sym))) |
70f34814 RG |
1586 | lhs = sym; |
1587 | else | |
1588 | lhs = gimple_assign_lhs (stmt); | |
1589 | ||
1590 | /* Rewrite the RHS and make sure the resulting assignment | |
1591 | is validly typed. */ | |
13714310 | 1592 | maybe_rewrite_mem_ref_base (rhsp, suitable_for_renaming); |
70f34814 RG |
1593 | rhs = gimple_assign_rhs1 (stmt); |
1594 | if (gimple_assign_lhs (stmt) != lhs | |
1595 | && !useless_type_conversion_p (TREE_TYPE (lhs), | |
1596 | TREE_TYPE (rhs))) | |
1597 | rhs = fold_build1 (VIEW_CONVERT_EXPR, | |
1598 | TREE_TYPE (lhs), rhs); | |
1599 | ||
1600 | if (gimple_assign_lhs (stmt) != lhs) | |
1601 | gimple_assign_set_lhs (stmt, lhs); | |
1602 | ||
c32f25b8 JJ |
1603 | /* For var ={v} {CLOBBER}; where var lost |
1604 | TREE_ADDRESSABLE just remove the stmt. */ | |
1605 | if (DECL_P (lhs) | |
1606 | && TREE_CLOBBER_P (rhs) | |
13714310 | 1607 | && bitmap_bit_p (suitable_for_renaming, DECL_UID (lhs))) |
c32f25b8 JJ |
1608 | { |
1609 | unlink_stmt_vdef (stmt); | |
1610 | gsi_remove (&gsi, true); | |
1611 | release_defs (stmt); | |
1612 | continue; | |
1613 | } | |
1614 | ||
70f34814 RG |
1615 | if (gimple_assign_rhs1 (stmt) != rhs) |
1616 | { | |
1617 | gimple_stmt_iterator gsi = gsi_for_stmt (stmt); | |
1618 | gimple_assign_set_rhs_from_tree (&gsi, rhs); | |
1619 | } | |
1620 | } | |
1621 | ||
ad650c92 RG |
1622 | else if (gimple_code (stmt) == GIMPLE_CALL) |
1623 | { | |
1624 | unsigned i; | |
1625 | for (i = 0; i < gimple_call_num_args (stmt); ++i) | |
1626 | { | |
1627 | tree *argp = gimple_call_arg_ptr (stmt, i); | |
13714310 | 1628 | maybe_rewrite_mem_ref_base (argp, suitable_for_renaming); |
ad650c92 RG |
1629 | } |
1630 | } | |
1631 | ||
1632 | else if (gimple_code (stmt) == GIMPLE_ASM) | |
70f34814 RG |
1633 | { |
1634 | unsigned i; | |
1635 | for (i = 0; i < gimple_asm_noutputs (stmt); ++i) | |
1636 | { | |
1637 | tree link = gimple_asm_output_op (stmt, i); | |
13714310 RG |
1638 | maybe_rewrite_mem_ref_base (&TREE_VALUE (link), |
1639 | suitable_for_renaming); | |
70f34814 RG |
1640 | } |
1641 | for (i = 0; i < gimple_asm_ninputs (stmt); ++i) | |
1642 | { | |
1643 | tree link = gimple_asm_input_op (stmt, i); | |
13714310 RG |
1644 | maybe_rewrite_mem_ref_base (&TREE_VALUE (link), |
1645 | suitable_for_renaming); | |
70f34814 RG |
1646 | } |
1647 | } | |
1648 | ||
116bc3a4 JJ |
1649 | else if (gimple_debug_bind_p (stmt) |
1650 | && gimple_debug_bind_has_value_p (stmt)) | |
1651 | { | |
1652 | tree *valuep = gimple_debug_bind_get_value_ptr (stmt); | |
1653 | tree decl; | |
13714310 | 1654 | maybe_rewrite_mem_ref_base (valuep, suitable_for_renaming); |
116bc3a4 | 1655 | decl = non_rewritable_mem_ref_base (*valuep); |
13714310 RG |
1656 | if (decl |
1657 | && bitmap_bit_p (suitable_for_renaming, DECL_UID (decl))) | |
116bc3a4 JJ |
1658 | gimple_debug_bind_reset_value (stmt); |
1659 | } | |
1660 | ||
70f34814 RG |
1661 | if (gimple_references_memory_p (stmt) |
1662 | || is_gimple_debug (stmt)) | |
1663 | update_stmt (stmt); | |
c32f25b8 JJ |
1664 | |
1665 | gsi_next (&gsi); | |
70f34814 | 1666 | } |
5006671f RG |
1667 | |
1668 | /* Update SSA form here, we are called as non-pass as well. */ | |
0fc822d0 RB |
1669 | if (number_of_loops (cfun) > 1 |
1670 | && loops_state_satisfies_p (LOOP_CLOSED_SSA)) | |
94e3faf6 JJ |
1671 | rewrite_into_loop_closed_ssa (NULL, TODO_update_ssa); |
1672 | else | |
1673 | update_ssa (TODO_update_ssa); | |
5006671f | 1674 | } |
201b2ead | 1675 | |
f22b7039 | 1676 | BITMAP_FREE (not_reg_needs); |
201b2ead | 1677 | BITMAP_FREE (addresses_taken); |
13714310 | 1678 | BITMAP_FREE (suitable_for_renaming); |
a222c01a | 1679 | timevar_pop (TV_ADDRESS_TAKEN); |
201b2ead JH |
1680 | } |
1681 | ||
27a4cd48 DM |
1682 | namespace { |
1683 | ||
1684 | const pass_data pass_data_update_address_taken = | |
201b2ead | 1685 | { |
27a4cd48 DM |
1686 | GIMPLE_PASS, /* type */ |
1687 | "addressables", /* name */ | |
1688 | OPTGROUP_NONE, /* optinfo_flags */ | |
1689 | false, /* has_gate */ | |
1690 | false, /* has_execute */ | |
1691 | TV_ADDRESS_TAKEN, /* tv_id */ | |
1692 | PROP_ssa, /* properties_required */ | |
1693 | 0, /* properties_provided */ | |
1694 | 0, /* properties_destroyed */ | |
1695 | 0, /* todo_flags_start */ | |
1696 | TODO_update_address_taken, /* todo_flags_finish */ | |
201b2ead | 1697 | }; |
27a4cd48 DM |
1698 | |
1699 | class pass_update_address_taken : public gimple_opt_pass | |
1700 | { | |
1701 | public: | |
c3284718 RS |
1702 | pass_update_address_taken (gcc::context *ctxt) |
1703 | : gimple_opt_pass (pass_data_update_address_taken, ctxt) | |
27a4cd48 DM |
1704 | {} |
1705 | ||
1706 | /* opt_pass methods: */ | |
1707 | ||
1708 | }; // class pass_update_address_taken | |
1709 | ||
1710 | } // anon namespace | |
1711 | ||
1712 | gimple_opt_pass * | |
1713 | make_pass_update_address_taken (gcc::context *ctxt) | |
1714 | { | |
1715 | return new pass_update_address_taken (ctxt); | |
1716 | } |