]>
Commit | Line | Data |
---|---|---|
6de9cd9a | 1 | /* Liveness for SSA trees. |
fa10beec RW |
2 | Copyright (C) 2003, 2004, 2005, 2007, 2008 Free Software Foundation, |
3 | Inc. | |
6de9cd9a DN |
4 | Contributed by Andrew MacLeod <amacleod@redhat.com> |
5 | ||
6 | This file is part of GCC. | |
7 | ||
8 | GCC is free software; you can redistribute it and/or modify | |
9 | it under the terms of the GNU General Public License as published by | |
9dcd6f09 | 10 | the Free Software Foundation; either version 3, or (at your option) |
6de9cd9a DN |
11 | any later version. |
12 | ||
13 | GCC is distributed in the hope that it will be useful, | |
14 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
16 | GNU General Public License for more details. | |
17 | ||
18 | You should have received a copy of the GNU General Public License | |
9dcd6f09 NC |
19 | along with GCC; see the file COPYING3. If not see |
20 | <http://www.gnu.org/licenses/>. */ | |
6de9cd9a DN |
21 | |
22 | #include "config.h" | |
23 | #include "system.h" | |
24 | #include "coretypes.h" | |
25 | #include "tm.h" | |
26 | #include "tree.h" | |
6de9cd9a DN |
27 | #include "diagnostic.h" |
28 | #include "bitmap.h" | |
29 | #include "tree-flow.h" | |
6de9cd9a DN |
30 | #include "tree-dump.h" |
31 | #include "tree-ssa-live.h" | |
4c714dd4 | 32 | #include "toplev.h" |
aee46bbd JH |
33 | #include "debug.h" |
34 | #include "flags.h" | |
7290d709 | 35 | |
32ace6e2 AM |
36 | #ifdef ENABLE_CHECKING |
37 | static void verify_live_on_entry (tree_live_info_p); | |
38 | #endif | |
6de9cd9a | 39 | |
6de9cd9a | 40 | |
7290d709 AM |
41 | /* VARMAP maintains a mapping from SSA version number to real variables. |
42 | ||
43 | All SSA_NAMES are divided into partitions. Initially each ssa_name is the | |
44 | only member of it's own partition. Coalescing will attempt to group any | |
45 | ssa_names which occur in a copy or in a PHI node into the same partition. | |
46 | ||
47 | At the end of out-of-ssa, each partition becomes a "real" variable and is | |
48 | rewritten as a compiler variable. | |
49 | ||
fa10beec | 50 | The var_map data structure is used to manage these partitions. It allows |
7290d709 AM |
51 | partitions to be combined, and determines which partition belongs to what |
52 | ssa_name or variable, and vice versa. */ | |
53 | ||
54 | ||
55 | /* This routine will initialize the basevar fields of MAP. */ | |
56 | ||
57 | static void | |
58 | var_map_base_init (var_map map) | |
59 | { | |
60 | int x, num_part, num; | |
61 | tree var; | |
62 | var_ann_t ann; | |
63 | ||
64 | num = 0; | |
65 | num_part = num_var_partitions (map); | |
66 | ||
67 | /* If a base table already exists, clear it, otherwise create it. */ | |
68 | if (map->partition_to_base_index != NULL) | |
69 | { | |
70 | free (map->partition_to_base_index); | |
71 | VEC_truncate (tree, map->basevars, 0); | |
72 | } | |
73 | else | |
74 | map->basevars = VEC_alloc (tree, heap, MAX (40, (num_part / 10))); | |
75 | ||
76 | map->partition_to_base_index = (int *) xmalloc (sizeof (int) * num_part); | |
77 | ||
78 | /* Build the base variable list, and point partitions at their bases. */ | |
79 | for (x = 0; x < num_part; x++) | |
80 | { | |
81 | var = partition_to_var (map, x); | |
82 | if (TREE_CODE (var) == SSA_NAME) | |
83 | var = SSA_NAME_VAR (var); | |
84 | ann = var_ann (var); | |
85 | /* If base variable hasn't been seen, set it up. */ | |
86 | if (!ann->base_var_processed) | |
87 | { | |
88 | ann->base_var_processed = 1; | |
89 | VAR_ANN_BASE_INDEX (ann) = num++; | |
90 | VEC_safe_push (tree, heap, map->basevars, var); | |
91 | } | |
92 | map->partition_to_base_index[x] = VAR_ANN_BASE_INDEX (ann); | |
93 | } | |
94 | ||
95 | map->num_basevars = num; | |
96 | ||
97 | /* Now clear the processed bit. */ | |
98 | for (x = 0; x < num; x++) | |
99 | { | |
100 | var = VEC_index (tree, map->basevars, x); | |
101 | var_ann (var)->base_var_processed = 0; | |
102 | } | |
103 | ||
104 | #ifdef ENABLE_CHECKING | |
105 | for (x = 0; x < num_part; x++) | |
106 | { | |
107 | tree var2; | |
108 | var = SSA_NAME_VAR (partition_to_var (map, x)); | |
109 | var2 = VEC_index (tree, map->basevars, basevar_index (map, x)); | |
110 | gcc_assert (var == var2); | |
111 | } | |
112 | #endif | |
113 | } | |
114 | ||
6de9cd9a | 115 | |
7290d709 | 116 | /* Remove the base table in MAP. */ |
6de9cd9a | 117 | |
7290d709 AM |
118 | static void |
119 | var_map_base_fini (var_map map) | |
120 | { | |
121 | /* Free the basevar info if it is present. */ | |
122 | if (map->partition_to_base_index != NULL) | |
123 | { | |
124 | VEC_free (tree, heap, map->basevars); | |
125 | free (map->partition_to_base_index); | |
126 | map->partition_to_base_index = NULL; | |
127 | map->num_basevars = 0; | |
128 | } | |
129 | } | |
6de9cd9a DN |
130 | /* Create a variable partition map of SIZE, initialize and return it. */ |
131 | ||
132 | var_map | |
133 | init_var_map (int size) | |
134 | { | |
135 | var_map map; | |
136 | ||
137 | map = (var_map) xmalloc (sizeof (struct _var_map)); | |
138 | map->var_partition = partition_new (size); | |
139 | map->partition_to_var | |
140 | = (tree *)xmalloc (size * sizeof (tree)); | |
141 | memset (map->partition_to_var, 0, size * sizeof (tree)); | |
142 | ||
7290d709 AM |
143 | map->partition_to_view = NULL; |
144 | map->view_to_partition = NULL; | |
6de9cd9a DN |
145 | map->num_partitions = size; |
146 | map->partition_size = size; | |
7290d709 AM |
147 | map->num_basevars = 0; |
148 | map->partition_to_base_index = NULL; | |
149 | map->basevars = NULL; | |
6de9cd9a DN |
150 | return map; |
151 | } | |
152 | ||
153 | ||
154 | /* Free memory associated with MAP. */ | |
155 | ||
156 | void | |
157 | delete_var_map (var_map map) | |
158 | { | |
7290d709 | 159 | var_map_base_fini (map); |
6de9cd9a DN |
160 | free (map->partition_to_var); |
161 | partition_delete (map->var_partition); | |
7290d709 AM |
162 | if (map->partition_to_view) |
163 | free (map->partition_to_view); | |
164 | if (map->view_to_partition) | |
165 | free (map->view_to_partition); | |
6de9cd9a DN |
166 | free (map); |
167 | } | |
168 | ||
169 | ||
170 | /* This function will combine the partitions in MAP for VAR1 and VAR2. It | |
171 | Returns the partition which represents the new partition. If the two | |
9cf737f8 | 172 | partitions cannot be combined, NO_PARTITION is returned. */ |
6de9cd9a DN |
173 | |
174 | int | |
175 | var_union (var_map map, tree var1, tree var2) | |
176 | { | |
177 | int p1, p2, p3; | |
178 | tree root_var = NULL_TREE; | |
179 | tree other_var = NULL_TREE; | |
180 | ||
7290d709 | 181 | /* This is independent of partition_to_view. If partition_to_view is |
6de9cd9a | 182 | on, then whichever one of these partitions is absorbed will never have a |
7290d709 | 183 | dereference into the partition_to_view array any more. */ |
6de9cd9a DN |
184 | |
185 | if (TREE_CODE (var1) == SSA_NAME) | |
186 | p1 = partition_find (map->var_partition, SSA_NAME_VERSION (var1)); | |
187 | else | |
188 | { | |
189 | p1 = var_to_partition (map, var1); | |
7290d709 AM |
190 | if (map->view_to_partition) |
191 | p1 = map->view_to_partition[p1]; | |
6de9cd9a DN |
192 | root_var = var1; |
193 | } | |
194 | ||
195 | if (TREE_CODE (var2) == SSA_NAME) | |
196 | p2 = partition_find (map->var_partition, SSA_NAME_VERSION (var2)); | |
197 | else | |
198 | { | |
199 | p2 = var_to_partition (map, var2); | |
7290d709 AM |
200 | if (map->view_to_partition) |
201 | p2 = map->view_to_partition[p2]; | |
6de9cd9a | 202 | |
89dbed81 | 203 | /* If there is no root_var set, or it's not a user variable, set the |
6de9cd9a | 204 | root_var to this one. */ |
17ad5b5e | 205 | if (!root_var || (DECL_P (root_var) && DECL_IGNORED_P (root_var))) |
6de9cd9a DN |
206 | { |
207 | other_var = root_var; | |
208 | root_var = var2; | |
209 | } | |
210 | else | |
211 | other_var = var2; | |
212 | } | |
213 | ||
1e128c5f GB |
214 | gcc_assert (p1 != NO_PARTITION); |
215 | gcc_assert (p2 != NO_PARTITION); | |
6de9cd9a DN |
216 | |
217 | if (p1 == p2) | |
218 | p3 = p1; | |
219 | else | |
220 | p3 = partition_union (map->var_partition, p1, p2); | |
221 | ||
7290d709 AM |
222 | if (map->partition_to_view) |
223 | p3 = map->partition_to_view[p3]; | |
6de9cd9a DN |
224 | |
225 | if (root_var) | |
226 | change_partition_var (map, root_var, p3); | |
227 | if (other_var) | |
228 | change_partition_var (map, other_var, p3); | |
229 | ||
230 | return p3; | |
231 | } | |
232 | ||
7290d709 | 233 | |
6de9cd9a DN |
234 | /* Compress the partition numbers in MAP such that they fall in the range |
235 | 0..(num_partitions-1) instead of wherever they turned out during | |
236 | the partitioning exercise. This removes any references to unused | |
237 | partitions, thereby allowing bitmaps and other vectors to be much | |
7290d709 | 238 | denser. |
6de9cd9a DN |
239 | |
240 | This is implemented such that compaction doesn't affect partitioning. | |
241 | Ie., once partitions are created and possibly merged, running one | |
242 | or more different kind of compaction will not affect the partitions | |
243 | themselves. Their index might change, but all the same variables will | |
244 | still be members of the same partition group. This allows work on reduced | |
245 | sets, and no loss of information when a larger set is later desired. | |
246 | ||
247 | In particular, coalescing can work on partitions which have 2 or more | |
248 | definitions, and then 'recompact' later to include all the single | |
249 | definitions for assignment to program variables. */ | |
250 | ||
7290d709 AM |
251 | |
252 | /* Set MAP back to the initial state of having no partition view. Return a | |
253 | bitmap which has a bit set for each partition number which is in use in the | |
254 | varmap. */ | |
255 | ||
256 | static bitmap | |
257 | partition_view_init (var_map map) | |
6de9cd9a | 258 | { |
7290d709 AM |
259 | bitmap used; |
260 | int tmp; | |
261 | unsigned int x; | |
6de9cd9a | 262 | |
7290d709 | 263 | used = BITMAP_ALLOC (NULL); |
6de9cd9a | 264 | |
7290d709 AM |
265 | /* Already in a view? Abandon the old one. */ |
266 | if (map->partition_to_view) | |
6de9cd9a | 267 | { |
7290d709 AM |
268 | free (map->partition_to_view); |
269 | map->partition_to_view = NULL; | |
6de9cd9a | 270 | } |
7290d709 | 271 | if (map->view_to_partition) |
6de9cd9a | 272 | { |
7290d709 AM |
273 | free (map->view_to_partition); |
274 | map->view_to_partition = NULL; | |
6de9cd9a DN |
275 | } |
276 | ||
6de9cd9a | 277 | /* Find out which partitions are actually referenced. */ |
7290d709 | 278 | for (x = 0; x < map->partition_size; x++) |
6de9cd9a DN |
279 | { |
280 | tmp = partition_find (map->var_partition, x); | |
7290d709 AM |
281 | if (map->partition_to_var[tmp] != NULL_TREE && !bitmap_bit_p (used, tmp)) |
282 | bitmap_set_bit (used, tmp); | |
6de9cd9a DN |
283 | } |
284 | ||
7290d709 AM |
285 | map->num_partitions = map->partition_size; |
286 | return used; | |
287 | } | |
288 | ||
289 | ||
290 | /* This routine will finalize the view data for MAP based on the partitions | |
291 | set in SELECTED. This is either the same bitmap returned from | |
292 | partition_view_init, or a trimmed down version if some of those partitions | |
293 | were not desired in this view. SELECTED is freed before returning. */ | |
294 | ||
295 | static void | |
296 | partition_view_fini (var_map map, bitmap selected) | |
297 | { | |
298 | bitmap_iterator bi; | |
299 | unsigned count, i, x, limit; | |
300 | tree var; | |
301 | ||
302 | gcc_assert (selected); | |
303 | ||
304 | count = bitmap_count_bits (selected); | |
305 | limit = map->partition_size; | |
306 | ||
307 | /* If its a one-to-one ratio, we don't need any view compaction. */ | |
308 | if (count < limit) | |
6de9cd9a | 309 | { |
7290d709 AM |
310 | map->partition_to_view = (int *)xmalloc (limit * sizeof (int)); |
311 | memset (map->partition_to_view, 0xff, (limit * sizeof (int))); | |
312 | map->view_to_partition = (int *)xmalloc (count * sizeof (int)); | |
b6e7e9af | 313 | |
7290d709 AM |
314 | i = 0; |
315 | /* Give each selected partition an index. */ | |
316 | EXECUTE_IF_SET_IN_BITMAP (selected, 0, x, bi) | |
6de9cd9a | 317 | { |
7290d709 AM |
318 | map->partition_to_view[x] = i; |
319 | map->view_to_partition[i] = x; | |
6de9cd9a | 320 | var = map->partition_to_var[x]; |
7290d709 AM |
321 | /* If any one of the members of a partition is not an SSA_NAME, make |
322 | sure it is the representative. */ | |
6de9cd9a | 323 | if (TREE_CODE (var) != SSA_NAME) |
7290d709 AM |
324 | change_partition_var (map, var, i); |
325 | i++; | |
b6e7e9af | 326 | } |
7290d709 AM |
327 | gcc_assert (i == count); |
328 | map->num_partitions = i; | |
6de9cd9a | 329 | } |
7290d709 AM |
330 | |
331 | BITMAP_FREE (selected); | |
332 | } | |
333 | ||
334 | ||
335 | /* Create a partition view which includes all the used partitions in MAP. If | |
336 | WANT_BASES is true, create the base variable map as well. */ | |
337 | ||
338 | extern void | |
339 | partition_view_normal (var_map map, bool want_bases) | |
340 | { | |
341 | bitmap used; | |
342 | ||
343 | used = partition_view_init (map); | |
344 | partition_view_fini (map, used); | |
345 | ||
346 | if (want_bases) | |
347 | var_map_base_init (map); | |
6de9cd9a | 348 | else |
7290d709 AM |
349 | var_map_base_fini (map); |
350 | } | |
351 | ||
352 | ||
353 | /* Create a partition view in MAP which includes just partitions which occur in | |
354 | the bitmap ONLY. If WANT_BASES is true, create the base variable map | |
355 | as well. */ | |
356 | ||
357 | extern void | |
358 | partition_view_bitmap (var_map map, bitmap only, bool want_bases) | |
359 | { | |
360 | bitmap used; | |
361 | bitmap new_partitions = BITMAP_ALLOC (NULL); | |
362 | unsigned x, p; | |
363 | bitmap_iterator bi; | |
364 | ||
365 | used = partition_view_init (map); | |
366 | EXECUTE_IF_SET_IN_BITMAP (only, 0, x, bi) | |
6de9cd9a | 367 | { |
7290d709 AM |
368 | p = partition_find (map->var_partition, x); |
369 | gcc_assert (bitmap_bit_p (used, p)); | |
370 | bitmap_set_bit (new_partitions, p); | |
6de9cd9a | 371 | } |
7290d709 | 372 | partition_view_fini (map, new_partitions); |
6de9cd9a | 373 | |
7290d709 AM |
374 | BITMAP_FREE (used); |
375 | if (want_bases) | |
376 | var_map_base_init (map); | |
377 | else | |
378 | var_map_base_fini (map); | |
6de9cd9a DN |
379 | } |
380 | ||
381 | ||
382 | /* This function is used to change the representative variable in MAP for VAR's | |
7290d709 AM |
383 | partition to a regular non-ssa variable. This allows partitions to be |
384 | mapped back to real variables. */ | |
6de9cd9a DN |
385 | |
386 | void | |
387 | change_partition_var (var_map map, tree var, int part) | |
388 | { | |
389 | var_ann_t ann; | |
390 | ||
1e128c5f | 391 | gcc_assert (TREE_CODE (var) != SSA_NAME); |
6de9cd9a DN |
392 | |
393 | ann = var_ann (var); | |
394 | ann->out_of_ssa_tag = 1; | |
395 | VAR_ANN_PARTITION (ann) = part; | |
7290d709 AM |
396 | if (map->view_to_partition) |
397 | map->partition_to_var[map->view_to_partition[part]] = var; | |
6de9cd9a DN |
398 | } |
399 | ||
7290d709 | 400 | |
900461f3 | 401 | static inline void mark_all_vars_used (tree *, void *data); |
6de9cd9a | 402 | |
727a31fa RH |
403 | /* Helper function for mark_all_vars_used, called via walk_tree. */ |
404 | ||
405 | static tree | |
726a989a | 406 | mark_all_vars_used_1 (tree *tp, int *walk_subtrees, void *data) |
727a31fa RH |
407 | { |
408 | tree t = *tp; | |
aee46bbd JH |
409 | enum tree_code_class c = TREE_CODE_CLASS (TREE_CODE (t)); |
410 | tree b; | |
727a31fa | 411 | |
3f519b35 RG |
412 | if (TREE_CODE (t) == SSA_NAME) |
413 | t = SSA_NAME_VAR (t); | |
726a989a RB |
414 | |
415 | if (IS_EXPR_CODE_CLASS (c) | |
aee46bbd JH |
416 | && (b = TREE_BLOCK (t)) != NULL) |
417 | TREE_USED (b) = true; | |
3f519b35 | 418 | |
89632019 ZD |
419 | /* Ignore TREE_ORIGINAL for TARGET_MEM_REFS, as well as other |
420 | fields that do not contain vars. */ | |
421 | if (TREE_CODE (t) == TARGET_MEM_REF) | |
422 | { | |
900461f3 JJ |
423 | mark_all_vars_used (&TMR_SYMBOL (t), data); |
424 | mark_all_vars_used (&TMR_BASE (t), data); | |
425 | mark_all_vars_used (&TMR_INDEX (t), data); | |
89632019 ZD |
426 | *walk_subtrees = 0; |
427 | return NULL; | |
428 | } | |
429 | ||
727a31fa RH |
430 | /* Only need to mark VAR_DECLS; parameters and return results are not |
431 | eliminated as unused. */ | |
432 | if (TREE_CODE (t) == VAR_DECL) | |
900461f3 JJ |
433 | { |
434 | if (data != NULL && bitmap_bit_p ((bitmap) data, DECL_UID (t))) | |
435 | { | |
436 | bitmap_clear_bit ((bitmap) data, DECL_UID (t)); | |
437 | mark_all_vars_used (&DECL_INITIAL (t), data); | |
438 | } | |
439 | set_is_used (t); | |
440 | } | |
727a31fa | 441 | |
6615c446 | 442 | if (IS_TYPE_OR_DECL_P (t)) |
727a31fa RH |
443 | *walk_subtrees = 0; |
444 | ||
445 | return NULL; | |
446 | } | |
447 | ||
aee46bbd JH |
448 | /* Mark the scope block SCOPE and its subblocks unused when they can be |
449 | possibly eliminated if dead. */ | |
450 | ||
451 | static void | |
452 | mark_scope_block_unused (tree scope) | |
453 | { | |
454 | tree t; | |
455 | TREE_USED (scope) = false; | |
456 | if (!(*debug_hooks->ignore_block) (scope)) | |
457 | TREE_USED (scope) = true; | |
458 | for (t = BLOCK_SUBBLOCKS (scope); t ; t = BLOCK_CHAIN (t)) | |
459 | mark_scope_block_unused (t); | |
460 | } | |
461 | ||
462 | /* Look if the block is dead (by possibly eliminating its dead subblocks) | |
463 | and return true if so. | |
464 | Block is declared dead if: | |
465 | 1) No statements are associated with it. | |
466 | 2) Declares no live variables | |
467 | 3) All subblocks are dead | |
468 | or there is precisely one subblocks and the block | |
469 | has same abstract origin as outer block and declares | |
470 | no variables, so it is pure wrapper. | |
cea618ac | 471 | When we are not outputting full debug info, we also eliminate dead variables |
aee46bbd JH |
472 | out of scope blocks to let them to be recycled by GGC and to save copying work |
473 | done by the inliner. */ | |
474 | ||
475 | static bool | |
476 | remove_unused_scope_block_p (tree scope) | |
477 | { | |
d1aed86b | 478 | tree *t, *next; |
aee46bbd | 479 | bool unused = !TREE_USED (scope); |
d1aed86b | 480 | var_ann_t ann; |
aee46bbd JH |
481 | int nsubblocks = 0; |
482 | ||
d1aed86b AO |
483 | for (t = &BLOCK_VARS (scope); *t; t = next) |
484 | { | |
485 | next = &TREE_CHAIN (*t); | |
486 | ||
487 | /* Debug info of nested function refers to the block of the | |
488 | function. */ | |
489 | if (TREE_CODE (*t) == FUNCTION_DECL) | |
490 | unused = false; | |
491 | ||
b91bc349 JH |
492 | /* Remove everything we don't generate debug info for. */ |
493 | else if (DECL_IGNORED_P (*t)) | |
494 | { | |
495 | *t = TREE_CHAIN (*t); | |
496 | next = t; | |
497 | } | |
498 | ||
d1aed86b AO |
499 | /* When we are outputting debug info, we usually want to output |
500 | info about optimized-out variables in the scope blocks. | |
501 | Exception are the scope blocks not containing any instructions | |
502 | at all so user can't get into the scopes at first place. */ | |
503 | else if ((ann = var_ann (*t)) != NULL | |
504 | && ann->used) | |
505 | unused = false; | |
506 | ||
507 | /* When we are not doing full debug info, we however can keep around | |
508 | only the used variables for cfgexpand's memory packing saving quite | |
509 | a lot of memory. */ | |
3c8da8a5 AO |
510 | else if (debug_info_level == DINFO_LEVEL_NORMAL |
511 | || debug_info_level == DINFO_LEVEL_VERBOSE | |
512 | /* Removing declarations before inlining is going to affect | |
513 | DECL_UID that in turn is going to affect hashtables and | |
514 | code generation. */ | |
515 | || !cfun->after_inlining) | |
516 | unused = false; | |
517 | ||
518 | else | |
d1aed86b AO |
519 | { |
520 | *t = TREE_CHAIN (*t); | |
521 | next = t; | |
522 | } | |
523 | } | |
524 | ||
aee46bbd JH |
525 | for (t = &BLOCK_SUBBLOCKS (scope); *t ;) |
526 | if (remove_unused_scope_block_p (*t)) | |
527 | { | |
528 | if (BLOCK_SUBBLOCKS (*t)) | |
529 | { | |
530 | tree next = BLOCK_CHAIN (*t); | |
531 | tree supercontext = BLOCK_SUPERCONTEXT (*t); | |
532 | *t = BLOCK_SUBBLOCKS (*t); | |
533 | gcc_assert (!BLOCK_CHAIN (*t)); | |
534 | BLOCK_CHAIN (*t) = next; | |
535 | BLOCK_SUPERCONTEXT (*t) = supercontext; | |
536 | t = &BLOCK_CHAIN (*t); | |
537 | nsubblocks ++; | |
538 | } | |
539 | else | |
3c8da8a5 AO |
540 | { |
541 | gcc_assert (!BLOCK_VARS (*t)); | |
542 | *t = BLOCK_CHAIN (*t); | |
543 | } | |
aee46bbd JH |
544 | } |
545 | else | |
546 | { | |
547 | t = &BLOCK_CHAIN (*t); | |
548 | nsubblocks ++; | |
549 | } | |
550 | /* Outer scope is always used. */ | |
551 | if (!BLOCK_SUPERCONTEXT (scope) | |
552 | || TREE_CODE (BLOCK_SUPERCONTEXT (scope)) == FUNCTION_DECL) | |
553 | unused = false; | |
554 | /* If there are more than one live subblocks, it is used. */ | |
555 | else if (nsubblocks > 1) | |
556 | unused = false; | |
557 | /* When there is only one subblock, see if it is just wrapper we can | |
558 | ignore. Wrappers are not declaring any variables and not changing | |
559 | abstract origin. */ | |
d1aed86b | 560 | else if (nsubblocks == 1 |
aee46bbd | 561 | && (BLOCK_VARS (scope) |
d1aed86b AO |
562 | || ((debug_info_level == DINFO_LEVEL_NORMAL |
563 | || debug_info_level == DINFO_LEVEL_VERBOSE) | |
564 | && ((BLOCK_ABSTRACT_ORIGIN (scope) | |
565 | != BLOCK_ABSTRACT_ORIGIN (BLOCK_SUPERCONTEXT (scope))))))) | |
aee46bbd JH |
566 | unused = false; |
567 | return unused; | |
568 | } | |
7290d709 | 569 | |
727a31fa RH |
570 | /* Mark all VAR_DECLS under *EXPR_P as used, so that they won't be |
571 | eliminated during the tree->rtl conversion process. */ | |
572 | ||
573 | static inline void | |
900461f3 | 574 | mark_all_vars_used (tree *expr_p, void *data) |
727a31fa | 575 | { |
900461f3 | 576 | walk_tree (expr_p, mark_all_vars_used_1, data, NULL); |
727a31fa RH |
577 | } |
578 | ||
3f519b35 RG |
579 | |
580 | /* Remove local variables that are not referenced in the IL. */ | |
581 | ||
582 | void | |
583 | remove_unused_locals (void) | |
584 | { | |
585 | basic_block bb; | |
586 | tree t, *cell; | |
326648f1 JH |
587 | referenced_var_iterator rvi; |
588 | var_ann_t ann; | |
900461f3 | 589 | bitmap global_unused_vars = NULL; |
3f519b35 | 590 | |
c72321c9 JH |
591 | if (optimize) |
592 | mark_scope_block_unused (DECL_INITIAL (current_function_decl)); | |
726a989a | 593 | |
3f519b35 | 594 | /* Assume all locals are unused. */ |
326648f1 JH |
595 | FOR_EACH_REFERENCED_VAR (t, rvi) |
596 | var_ann (t)->used = false; | |
3f519b35 RG |
597 | |
598 | /* Walk the CFG marking all referenced symbols. */ | |
599 | FOR_EACH_BB (bb) | |
600 | { | |
726a989a RB |
601 | gimple_stmt_iterator gsi; |
602 | size_t i; | |
cc2a64dd JJ |
603 | edge_iterator ei; |
604 | edge e; | |
3f519b35 RG |
605 | |
606 | /* Walk the statements. */ | |
726a989a RB |
607 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
608 | { | |
609 | gimple stmt = gsi_stmt (gsi); | |
610 | tree b = gimple_block (stmt); | |
611 | ||
612 | if (b) | |
613 | TREE_USED (b) = true; | |
3f519b35 | 614 | |
726a989a RB |
615 | for (i = 0; i < gimple_num_ops (stmt); i++) |
616 | mark_all_vars_used (gimple_op_ptr (gsi_stmt (gsi), i), NULL); | |
617 | } | |
618 | ||
619 | for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
3f519b35 RG |
620 | { |
621 | use_operand_p arg_p; | |
622 | ssa_op_iter i; | |
726a989a RB |
623 | tree def; |
624 | gimple phi = gsi_stmt (gsi); | |
3f519b35 RG |
625 | |
626 | /* No point processing globals. */ | |
726a989a | 627 | if (is_global_var (SSA_NAME_VAR (gimple_phi_result (phi)))) |
3f519b35 RG |
628 | continue; |
629 | ||
726a989a | 630 | def = gimple_phi_result (phi); |
900461f3 | 631 | mark_all_vars_used (&def, NULL); |
3f519b35 RG |
632 | |
633 | FOR_EACH_PHI_ARG (arg_p, phi, i, SSA_OP_ALL_USES) | |
634 | { | |
635 | tree arg = USE_FROM_PTR (arg_p); | |
900461f3 | 636 | mark_all_vars_used (&arg, NULL); |
3f519b35 RG |
637 | } |
638 | } | |
cc2a64dd JJ |
639 | |
640 | FOR_EACH_EDGE (e, ei, bb->succs) | |
641 | if (e->goto_locus) | |
642 | TREE_USED (e->goto_block) = true; | |
3f519b35 RG |
643 | } |
644 | ||
cb91fab0 JH |
645 | /* Remove unmarked local vars from local_decls. */ |
646 | for (cell = &cfun->local_decls; *cell; ) | |
3f519b35 RG |
647 | { |
648 | tree var = TREE_VALUE (*cell); | |
3f519b35 RG |
649 | |
650 | if (TREE_CODE (var) != FUNCTION_DECL | |
651 | && (!(ann = var_ann (var)) | |
652 | || !ann->used)) | |
653 | { | |
900461f3 JJ |
654 | if (is_global_var (var)) |
655 | { | |
656 | if (global_unused_vars == NULL) | |
657 | global_unused_vars = BITMAP_ALLOC (NULL); | |
658 | bitmap_set_bit (global_unused_vars, DECL_UID (var)); | |
659 | } | |
660 | else | |
661 | { | |
662 | *cell = TREE_CHAIN (*cell); | |
663 | continue; | |
664 | } | |
3f519b35 | 665 | } |
3f519b35 RG |
666 | cell = &TREE_CHAIN (*cell); |
667 | } | |
326648f1 | 668 | |
cb91fab0 | 669 | /* Remove unmarked global vars from local_decls. */ |
900461f3 JJ |
670 | if (global_unused_vars != NULL) |
671 | { | |
cb91fab0 | 672 | for (t = cfun->local_decls; t; t = TREE_CHAIN (t)) |
900461f3 JJ |
673 | { |
674 | tree var = TREE_VALUE (t); | |
675 | ||
676 | if (TREE_CODE (var) == VAR_DECL | |
677 | && is_global_var (var) | |
678 | && (ann = var_ann (var)) != NULL | |
679 | && ann->used) | |
680 | mark_all_vars_used (&DECL_INITIAL (var), global_unused_vars); | |
681 | } | |
682 | ||
cb91fab0 | 683 | for (cell = &cfun->local_decls; *cell; ) |
900461f3 JJ |
684 | { |
685 | tree var = TREE_VALUE (*cell); | |
686 | ||
687 | if (TREE_CODE (var) == VAR_DECL | |
688 | && is_global_var (var) | |
c72321c9 JH |
689 | && bitmap_bit_p (global_unused_vars, DECL_UID (var)) |
690 | && (optimize || DECL_ARTIFICIAL (var))) | |
900461f3 JJ |
691 | *cell = TREE_CHAIN (*cell); |
692 | else | |
693 | cell = &TREE_CHAIN (*cell); | |
694 | } | |
695 | BITMAP_FREE (global_unused_vars); | |
696 | } | |
697 | ||
d37d06fe DN |
698 | /* Remove unused variables from REFERENCED_VARs. As a special |
699 | exception keep the variables that are believed to be aliased. | |
700 | Those can't be easily removed from the alias sets and operand | |
701 | caches. They will be removed shortly after the next may_alias | |
702 | pass is performed. */ | |
326648f1 JH |
703 | FOR_EACH_REFERENCED_VAR (t, rvi) |
704 | if (!is_global_var (t) | |
705 | && !MTAG_P (t) | |
706 | && TREE_CODE (t) != PARM_DECL | |
707 | && TREE_CODE (t) != RESULT_DECL | |
708 | && !(ann = var_ann (t))->used | |
d37d06fe | 709 | && !ann->symbol_mem_tag |
c72321c9 JH |
710 | && !TREE_ADDRESSABLE (t) |
711 | && (optimize || DECL_ARTIFICIAL (t))) | |
d37d06fe | 712 | remove_referenced_var (t); |
c72321c9 JH |
713 | if (optimize) |
714 | remove_unused_scope_block_p (DECL_INITIAL (current_function_decl)); | |
3f519b35 RG |
715 | } |
716 | ||
6de9cd9a DN |
717 | |
718 | /* Allocate and return a new live range information object base on MAP. */ | |
719 | ||
720 | static tree_live_info_p | |
721 | new_tree_live_info (var_map map) | |
722 | { | |
723 | tree_live_info_p live; | |
3cd8c58a | 724 | unsigned x; |
6de9cd9a DN |
725 | |
726 | live = (tree_live_info_p) xmalloc (sizeof (struct tree_live_info_d)); | |
727 | live->map = map; | |
728 | live->num_blocks = last_basic_block; | |
729 | ||
32ace6e2 AM |
730 | live->livein = (bitmap *)xmalloc (last_basic_block * sizeof (bitmap)); |
731 | for (x = 0; x < (unsigned)last_basic_block; x++) | |
8bdbfff5 | 732 | live->livein[x] = BITMAP_ALLOC (NULL); |
6de9cd9a | 733 | |
32ace6e2 AM |
734 | live->liveout = (bitmap *)xmalloc (last_basic_block * sizeof (bitmap)); |
735 | for (x = 0; x < (unsigned)last_basic_block; x++) | |
736 | live->liveout[x] = BITMAP_ALLOC (NULL); | |
737 | ||
738 | live->work_stack = XNEWVEC (int, last_basic_block); | |
739 | live->stack_top = live->work_stack; | |
740 | ||
741 | live->global = BITMAP_ALLOC (NULL); | |
6de9cd9a DN |
742 | return live; |
743 | } | |
744 | ||
745 | ||
746 | /* Free storage for live range info object LIVE. */ | |
747 | ||
748 | void | |
749 | delete_tree_live_info (tree_live_info_p live) | |
750 | { | |
751 | int x; | |
6de9cd9a | 752 | |
32ace6e2 AM |
753 | BITMAP_FREE (live->global); |
754 | free (live->work_stack); | |
6de9cd9a | 755 | |
32ace6e2 AM |
756 | for (x = live->num_blocks - 1; x >= 0; x--) |
757 | BITMAP_FREE (live->liveout[x]); | |
758 | free (live->liveout); | |
6de9cd9a | 759 | |
32ace6e2 AM |
760 | for (x = live->num_blocks - 1; x >= 0; x--) |
761 | BITMAP_FREE (live->livein[x]); | |
762 | free (live->livein); | |
6de9cd9a | 763 | |
32ace6e2 | 764 | free (live); |
6de9cd9a DN |
765 | } |
766 | ||
767 | ||
110abdbc | 768 | /* Visit basic block BB and propagate any required live on entry bits from |
32ace6e2 | 769 | LIVE into the predecessors. VISITED is the bitmap of visited blocks. |
2e226e66 | 770 | TMP is a temporary work bitmap which is passed in to avoid reallocating |
32ace6e2 | 771 | it each time. */ |
6de9cd9a | 772 | |
32ace6e2 AM |
773 | static void |
774 | loe_visit_block (tree_live_info_p live, basic_block bb, sbitmap visited, | |
775 | bitmap tmp) | |
6de9cd9a | 776 | { |
32ace6e2 AM |
777 | edge e; |
778 | bool change; | |
779 | edge_iterator ei; | |
780 | basic_block pred_bb; | |
781 | bitmap loe; | |
782 | gcc_assert (!TEST_BIT (visited, bb->index)); | |
6de9cd9a | 783 | |
32ace6e2 AM |
784 | SET_BIT (visited, bb->index); |
785 | loe = live_on_entry (live, bb); | |
6de9cd9a | 786 | |
32ace6e2 | 787 | FOR_EACH_EDGE (e, ei, bb->preds) |
6de9cd9a | 788 | { |
32ace6e2 AM |
789 | pred_bb = e->src; |
790 | if (pred_bb == ENTRY_BLOCK_PTR) | |
791 | continue; | |
7290d709 AM |
792 | /* TMP is variables live-on-entry from BB that aren't defined in the |
793 | predecessor block. This should be the live on entry vars to pred. | |
32ace6e2 AM |
794 | Note that liveout is the DEFs in a block while live on entry is |
795 | being calculated. */ | |
796 | bitmap_and_compl (tmp, loe, live->liveout[pred_bb->index]); | |
797 | ||
798 | /* Add these bits to live-on-entry for the pred. if there are any | |
799 | changes, and pred_bb has been visited already, add it to the | |
800 | revisit stack. */ | |
801 | change = bitmap_ior_into (live_on_entry (live, pred_bb), tmp); | |
802 | if (TEST_BIT (visited, pred_bb->index) && change) | |
803 | { | |
804 | RESET_BIT (visited, pred_bb->index); | |
805 | *(live->stack_top)++ = pred_bb->index; | |
806 | } | |
6de9cd9a DN |
807 | } |
808 | } | |
809 | ||
810 | ||
32ace6e2 | 811 | /* Using LIVE, fill in all the live-on-entry blocks between the defs and uses |
2e226e66 | 812 | of all the variables. */ |
6de9cd9a | 813 | |
32ace6e2 AM |
814 | static void |
815 | live_worklist (tree_live_info_p live) | |
6de9cd9a | 816 | { |
32ace6e2 | 817 | unsigned b; |
6de9cd9a | 818 | basic_block bb; |
32ace6e2 AM |
819 | sbitmap visited = sbitmap_alloc (last_basic_block + 1); |
820 | bitmap tmp = BITMAP_ALLOC (NULL); | |
6de9cd9a | 821 | |
32ace6e2 | 822 | sbitmap_zero (visited); |
6de9cd9a | 823 | |
110abdbc | 824 | /* Visit all the blocks in reverse order and propagate live on entry values |
32ace6e2 AM |
825 | into the predecessors blocks. */ |
826 | FOR_EACH_BB_REVERSE (bb) | |
827 | loe_visit_block (live, bb, visited, tmp); | |
6de9cd9a | 828 | |
32ace6e2 AM |
829 | /* Process any blocks which require further iteration. */ |
830 | while (live->stack_top != live->work_stack) | |
6de9cd9a | 831 | { |
32ace6e2 AM |
832 | b = *--(live->stack_top); |
833 | loe_visit_block (live, BASIC_BLOCK (b), visited, tmp); | |
834 | } | |
6de9cd9a | 835 | |
32ace6e2 AM |
836 | BITMAP_FREE (tmp); |
837 | sbitmap_free (visited); | |
838 | } | |
6de9cd9a | 839 | |
6de9cd9a | 840 | |
2e226e66 | 841 | /* Calculate the initial live on entry vector for SSA_NAME using immediate_use |
32ace6e2 AM |
842 | links. Set the live on entry fields in LIVE. Def's are marked temporarily |
843 | in the liveout vector. */ | |
6de9cd9a | 844 | |
32ace6e2 AM |
845 | static void |
846 | set_var_live_on_entry (tree ssa_name, tree_live_info_p live) | |
847 | { | |
848 | int p; | |
726a989a | 849 | gimple stmt; |
32ace6e2 AM |
850 | use_operand_p use; |
851 | basic_block def_bb = NULL; | |
852 | imm_use_iterator imm_iter; | |
853 | bool global = false; | |
6de9cd9a | 854 | |
32ace6e2 AM |
855 | p = var_to_partition (live->map, ssa_name); |
856 | if (p == NO_PARTITION) | |
857 | return; | |
6de9cd9a | 858 | |
32ace6e2 AM |
859 | stmt = SSA_NAME_DEF_STMT (ssa_name); |
860 | if (stmt) | |
6de9cd9a | 861 | { |
726a989a | 862 | def_bb = gimple_bb (stmt); |
7290d709 | 863 | /* Mark defs in liveout bitmap temporarily. */ |
32ace6e2 AM |
864 | if (def_bb) |
865 | bitmap_set_bit (live->liveout[def_bb->index], p); | |
87c476a2 | 866 | } |
32ace6e2 AM |
867 | else |
868 | def_bb = ENTRY_BLOCK_PTR; | |
6de9cd9a | 869 | |
32ace6e2 AM |
870 | /* Visit each use of SSA_NAME and if it isn't in the same block as the def, |
871 | add it to the list of live on entry blocks. */ | |
872 | FOR_EACH_IMM_USE_FAST (use, imm_iter, ssa_name) | |
6de9cd9a | 873 | { |
726a989a | 874 | gimple use_stmt = USE_STMT (use); |
32ace6e2 | 875 | basic_block add_block = NULL; |
6de9cd9a | 876 | |
726a989a | 877 | if (gimple_code (use_stmt) == GIMPLE_PHI) |
32ace6e2 AM |
878 | { |
879 | /* Uses in PHI's are considered to be live at exit of the SRC block | |
880 | as this is where a copy would be inserted. Check to see if it is | |
881 | defined in that block, or whether its live on entry. */ | |
882 | int index = PHI_ARG_INDEX_FROM_USE (use); | |
726a989a | 883 | edge e = gimple_phi_arg_edge (use_stmt, index); |
32ace6e2 | 884 | if (e->src != ENTRY_BLOCK_PTR) |
6de9cd9a | 885 | { |
32ace6e2 AM |
886 | if (e->src != def_bb) |
887 | add_block = e->src; | |
6de9cd9a | 888 | } |
32ace6e2 AM |
889 | } |
890 | else | |
891 | { | |
892 | /* If its not defined in this block, its live on entry. */ | |
726a989a | 893 | basic_block use_bb = gimple_bb (use_stmt); |
32ace6e2 AM |
894 | if (use_bb != def_bb) |
895 | add_block = use_bb; | |
896 | } | |
897 | ||
898 | /* If there was a live on entry use, set the bit. */ | |
899 | if (add_block) | |
900 | { | |
901 | global = true; | |
902 | bitmap_set_bit (live->livein[add_block->index], p); | |
6de9cd9a DN |
903 | } |
904 | } | |
6de9cd9a | 905 | |
32ace6e2 AM |
906 | /* If SSA_NAME is live on entry to at least one block, fill in all the live |
907 | on entry blocks between the def and all the uses. */ | |
908 | if (global) | |
909 | bitmap_set_bit (live->global, p); | |
6de9cd9a DN |
910 | } |
911 | ||
912 | ||
913 | /* Calculate the live on exit vectors based on the entry info in LIVEINFO. */ | |
914 | ||
915 | void | |
916 | calculate_live_on_exit (tree_live_info_p liveinfo) | |
917 | { | |
6de9cd9a DN |
918 | basic_block bb; |
919 | edge e; | |
32ace6e2 | 920 | edge_iterator ei; |
6de9cd9a | 921 | |
7290d709 | 922 | /* live on entry calculations used liveout vectors for defs, clear them. */ |
32ace6e2 AM |
923 | FOR_EACH_BB (bb) |
924 | bitmap_clear (liveinfo->liveout[bb->index]); | |
6de9cd9a DN |
925 | |
926 | /* Set all the live-on-exit bits for uses in PHIs. */ | |
927 | FOR_EACH_BB (bb) | |
928 | { | |
726a989a RB |
929 | gimple_stmt_iterator gsi; |
930 | size_t i; | |
931 | ||
32ace6e2 | 932 | /* Mark the PHI arguments which are live on exit to the pred block. */ |
726a989a RB |
933 | for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
934 | { | |
935 | gimple phi = gsi_stmt (gsi); | |
936 | for (i = 0; i < gimple_phi_num_args (phi); i++) | |
937 | { | |
938 | tree t = PHI_ARG_DEF (phi, i); | |
939 | int p; | |
940 | ||
941 | if (TREE_CODE (t) != SSA_NAME) | |
942 | continue; | |
943 | ||
944 | p = var_to_partition (liveinfo->map, t); | |
945 | if (p == NO_PARTITION) | |
946 | continue; | |
947 | e = gimple_phi_arg_edge (phi, i); | |
948 | if (e->src != ENTRY_BLOCK_PTR) | |
949 | bitmap_set_bit (liveinfo->liveout[e->src->index], p); | |
950 | } | |
951 | } | |
32ace6e2 | 952 | |
7290d709 | 953 | /* Add each successors live on entry to this bock live on exit. */ |
32ace6e2 AM |
954 | FOR_EACH_EDGE (e, ei, bb->succs) |
955 | if (e->dest != EXIT_BLOCK_PTR) | |
956 | bitmap_ior_into (liveinfo->liveout[bb->index], | |
957 | live_on_entry (liveinfo, e->dest)); | |
6de9cd9a | 958 | } |
32ace6e2 AM |
959 | } |
960 | ||
7290d709 | 961 | |
32ace6e2 AM |
962 | /* Given partition map MAP, calculate all the live on entry bitmaps for |
963 | each partition. Return a new live info object. */ | |
964 | ||
965 | tree_live_info_p | |
966 | calculate_live_ranges (var_map map) | |
967 | { | |
968 | tree var; | |
969 | unsigned i; | |
970 | tree_live_info_p live; | |
6de9cd9a | 971 | |
32ace6e2 | 972 | live = new_tree_live_info (map); |
6de9cd9a DN |
973 | for (i = 0; i < num_var_partitions (map); i++) |
974 | { | |
32ace6e2 AM |
975 | var = partition_to_var (map, i); |
976 | if (var != NULL_TREE) | |
977 | set_var_live_on_entry (var, live); | |
6de9cd9a DN |
978 | } |
979 | ||
32ace6e2 AM |
980 | live_worklist (live); |
981 | ||
982 | #ifdef ENABLE_CHECKING | |
983 | verify_live_on_entry (live); | |
984 | #endif | |
985 | ||
986 | calculate_live_on_exit (live); | |
987 | return live; | |
6de9cd9a DN |
988 | } |
989 | ||
990 | ||
6de9cd9a DN |
991 | /* Output partition map MAP to file F. */ |
992 | ||
993 | void | |
994 | dump_var_map (FILE *f, var_map map) | |
995 | { | |
996 | int t; | |
997 | unsigned x, y; | |
998 | int p; | |
999 | ||
1000 | fprintf (f, "\nPartition map \n\n"); | |
1001 | ||
1002 | for (x = 0; x < map->num_partitions; x++) | |
1003 | { | |
7290d709 AM |
1004 | if (map->view_to_partition != NULL) |
1005 | p = map->view_to_partition[x]; | |
6de9cd9a DN |
1006 | else |
1007 | p = x; | |
1008 | ||
1009 | if (map->partition_to_var[p] == NULL_TREE) | |
1010 | continue; | |
1011 | ||
1012 | t = 0; | |
95a3742c | 1013 | for (y = 1; y < num_ssa_names; y++) |
6de9cd9a DN |
1014 | { |
1015 | p = partition_find (map->var_partition, y); | |
7290d709 AM |
1016 | if (map->partition_to_view) |
1017 | p = map->partition_to_view[p]; | |
6de9cd9a DN |
1018 | if (p == (int)x) |
1019 | { | |
1020 | if (t++ == 0) | |
1021 | { | |
1022 | fprintf(f, "Partition %d (", x); | |
1023 | print_generic_expr (f, partition_to_var (map, p), TDF_SLIM); | |
1024 | fprintf (f, " - "); | |
1025 | } | |
1026 | fprintf (f, "%d ", y); | |
1027 | } | |
1028 | } | |
1029 | if (t != 0) | |
1030 | fprintf (f, ")\n"); | |
1031 | } | |
1032 | fprintf (f, "\n"); | |
1033 | } | |
1034 | ||
1035 | ||
1036 | /* Output live range info LIVE to file F, controlled by FLAG. */ | |
1037 | ||
1038 | void | |
1039 | dump_live_info (FILE *f, tree_live_info_p live, int flag) | |
1040 | { | |
1041 | basic_block bb; | |
3cd8c58a | 1042 | unsigned i; |
6de9cd9a | 1043 | var_map map = live->map; |
87c476a2 | 1044 | bitmap_iterator bi; |
6de9cd9a DN |
1045 | |
1046 | if ((flag & LIVEDUMP_ENTRY) && live->livein) | |
1047 | { | |
1048 | FOR_EACH_BB (bb) | |
1049 | { | |
1050 | fprintf (f, "\nLive on entry to BB%d : ", bb->index); | |
32ace6e2 | 1051 | EXECUTE_IF_SET_IN_BITMAP (live->livein[bb->index], 0, i, bi) |
6de9cd9a | 1052 | { |
32ace6e2 AM |
1053 | print_generic_expr (f, partition_to_var (map, i), TDF_SLIM); |
1054 | fprintf (f, " "); | |
6de9cd9a DN |
1055 | } |
1056 | fprintf (f, "\n"); | |
1057 | } | |
1058 | } | |
1059 | ||
1060 | if ((flag & LIVEDUMP_EXIT) && live->liveout) | |
1061 | { | |
1062 | FOR_EACH_BB (bb) | |
1063 | { | |
1064 | fprintf (f, "\nLive on exit from BB%d : ", bb->index); | |
87c476a2 | 1065 | EXECUTE_IF_SET_IN_BITMAP (live->liveout[bb->index], 0, i, bi) |
6de9cd9a DN |
1066 | { |
1067 | print_generic_expr (f, partition_to_var (map, i), TDF_SLIM); | |
1068 | fprintf (f, " "); | |
87c476a2 | 1069 | } |
6de9cd9a DN |
1070 | fprintf (f, "\n"); |
1071 | } | |
1072 | } | |
1073 | } | |
1e128c5f | 1074 | |
7290d709 | 1075 | |
1e128c5f | 1076 | #ifdef ENABLE_CHECKING |
7290d709 AM |
1077 | /* Verify that SSA_VAR is a non-virtual SSA_NAME. */ |
1078 | ||
1e128c5f GB |
1079 | void |
1080 | register_ssa_partition_check (tree ssa_var) | |
1081 | { | |
1082 | gcc_assert (TREE_CODE (ssa_var) == SSA_NAME); | |
1083 | if (!is_gimple_reg (SSA_NAME_VAR (ssa_var))) | |
1084 | { | |
1085 | fprintf (stderr, "Illegally registering a virtual SSA name :"); | |
1086 | print_generic_expr (stderr, ssa_var, TDF_SLIM); | |
1087 | fprintf (stderr, " in the SSA->Normal phase.\n"); | |
1088 | internal_error ("SSA corruption"); | |
1089 | } | |
1090 | } | |
32ace6e2 AM |
1091 | |
1092 | ||
1093 | /* Verify that the info in LIVE matches the current cfg. */ | |
7290d709 | 1094 | |
32ace6e2 AM |
1095 | static void |
1096 | verify_live_on_entry (tree_live_info_p live) | |
1097 | { | |
1098 | unsigned i; | |
1099 | tree var; | |
726a989a | 1100 | gimple stmt; |
32ace6e2 AM |
1101 | basic_block bb; |
1102 | edge e; | |
1103 | int num; | |
1104 | edge_iterator ei; | |
1105 | var_map map = live->map; | |
1106 | ||
1107 | /* Check for live on entry partitions and report those with a DEF in | |
1108 | the program. This will typically mean an optimization has done | |
1109 | something wrong. */ | |
32ace6e2 AM |
1110 | bb = ENTRY_BLOCK_PTR; |
1111 | num = 0; | |
1112 | FOR_EACH_EDGE (e, ei, bb->succs) | |
1113 | { | |
1114 | int entry_block = e->dest->index; | |
1115 | if (e->dest == EXIT_BLOCK_PTR) | |
1116 | continue; | |
1117 | for (i = 0; i < (unsigned)num_var_partitions (map); i++) | |
1118 | { | |
1119 | basic_block tmp; | |
1120 | tree d; | |
1121 | bitmap loe; | |
1122 | var = partition_to_var (map, i); | |
1123 | stmt = SSA_NAME_DEF_STMT (var); | |
726a989a | 1124 | tmp = gimple_bb (stmt); |
32ace6e2 AM |
1125 | d = gimple_default_def (cfun, SSA_NAME_VAR (var)); |
1126 | ||
1127 | loe = live_on_entry (live, e->dest); | |
1128 | if (loe && bitmap_bit_p (loe, i)) | |
1129 | { | |
726a989a | 1130 | if (!gimple_nop_p (stmt)) |
32ace6e2 AM |
1131 | { |
1132 | num++; | |
1133 | print_generic_expr (stderr, var, TDF_SLIM); | |
1134 | fprintf (stderr, " is defined "); | |
1135 | if (tmp) | |
1136 | fprintf (stderr, " in BB%d, ", tmp->index); | |
1137 | fprintf (stderr, "by:\n"); | |
726a989a | 1138 | print_gimple_stmt (stderr, stmt, 0, TDF_SLIM); |
32ace6e2 AM |
1139 | fprintf (stderr, "\nIt is also live-on-entry to entry BB %d", |
1140 | entry_block); | |
1141 | fprintf (stderr, " So it appears to have multiple defs.\n"); | |
1142 | } | |
1143 | else | |
1144 | { | |
1145 | if (d != var) | |
1146 | { | |
1147 | num++; | |
1148 | print_generic_expr (stderr, var, TDF_SLIM); | |
726a989a RB |
1149 | fprintf (stderr, " is live-on-entry to BB%d ", |
1150 | entry_block); | |
32ace6e2 AM |
1151 | if (d) |
1152 | { | |
1153 | fprintf (stderr, " but is not the default def of "); | |
1154 | print_generic_expr (stderr, d, TDF_SLIM); | |
1155 | fprintf (stderr, "\n"); | |
1156 | } | |
1157 | else | |
1158 | fprintf (stderr, " and there is no default def.\n"); | |
1159 | } | |
1160 | } | |
1161 | } | |
1162 | else | |
1163 | if (d == var) | |
1164 | { | |
1165 | /* The only way this var shouldn't be marked live on entry is | |
1166 | if it occurs in a PHI argument of the block. */ | |
726a989a RB |
1167 | size_t z; |
1168 | bool ok = false; | |
1169 | gimple_stmt_iterator gsi; | |
1170 | for (gsi = gsi_start_phis (e->dest); | |
1171 | !gsi_end_p (gsi) && !ok; | |
1172 | gsi_next (&gsi)) | |
32ace6e2 | 1173 | { |
726a989a RB |
1174 | gimple phi = gsi_stmt (gsi); |
1175 | for (z = 0; z < gimple_phi_num_args (phi); z++) | |
1176 | if (var == gimple_phi_arg_def (phi, z)) | |
32ace6e2 | 1177 | { |
726a989a | 1178 | ok = true; |
32ace6e2 AM |
1179 | break; |
1180 | } | |
1181 | } | |
1182 | if (ok) | |
1183 | continue; | |
1184 | num++; | |
1185 | print_generic_expr (stderr, var, TDF_SLIM); | |
1186 | fprintf (stderr, " is not marked live-on-entry to entry BB%d ", | |
1187 | entry_block); | |
1188 | fprintf (stderr, "but it is a default def so it should be.\n"); | |
1189 | } | |
1190 | } | |
1191 | } | |
1192 | gcc_assert (num <= 0); | |
1193 | } | |
1e128c5f | 1194 | #endif |