Mercurial > hg > CbC > CbC_gcc
annotate gcc/tree-ssa-live.c @ 128:fe568345ddd5
fix CbC-example
| author | mir3636 |
|---|---|
| date | Wed, 11 Apr 2018 19:32:28 +0900 |
| parents | 04ced10e8804 |
| children | 84e7813d76e9 |
| rev | line source |
|---|---|
| 0 | 1 /* Liveness for SSA trees. |
| 111 | 2 Copyright (C) 2003-2017 Free Software Foundation, Inc. |
| 0 | 3 Contributed by Andrew MacLeod <amacleod@redhat.com> |
| 4 | |
| 5 This file is part of GCC. | |
| 6 | |
| 7 GCC is free software; you can redistribute it and/or modify | |
| 8 it under the terms of the GNU General Public License as published by | |
| 9 the Free Software Foundation; either version 3, or (at your option) | |
| 10 any later version. | |
| 11 | |
| 12 GCC is distributed in the hope that it will be useful, | |
| 13 but WITHOUT ANY WARRANTY; without even the implied warranty of | |
| 14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
| 15 GNU General Public License for more details. | |
| 16 | |
| 17 You should have received a copy of the GNU General Public License | |
| 18 along with GCC; see the file COPYING3. If not see | |
| 19 <http://www.gnu.org/licenses/>. */ | |
| 20 | |
| 21 #include "config.h" | |
| 22 #include "system.h" | |
| 23 #include "coretypes.h" | |
| 111 | 24 #include "backend.h" |
| 25 #include "rtl.h" | |
| 0 | 26 #include "tree.h" |
| 111 | 27 #include "gimple.h" |
| 28 #include "timevar.h" | |
| 29 #include "ssa.h" | |
| 30 #include "cgraph.h" | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
31 #include "gimple-pretty-print.h" |
| 111 | 32 #include "diagnostic-core.h" |
| 33 #include "gimple-iterator.h" | |
| 34 #include "tree-dfa.h" | |
| 35 #include "dumpfile.h" | |
| 0 | 36 #include "tree-ssa-live.h" |
| 37 #include "debug.h" | |
| 111 | 38 #include "tree-ssa.h" |
| 39 #include "ipa-utils.h" | |
| 40 #include "cfgloop.h" | |
| 41 #include "stringpool.h" | |
| 42 #include "attribs.h" | |
| 0 | 43 |
| 111 | 44 static void verify_live_on_entry (tree_live_info_p); |
| 0 | 45 |
| 46 | |
| 47 /* VARMAP maintains a mapping from SSA version number to real variables. | |
| 48 | |
| 49 All SSA_NAMES are divided into partitions. Initially each ssa_name is the | |
| 50 only member of it's own partition. Coalescing will attempt to group any | |
| 51 ssa_names which occur in a copy or in a PHI node into the same partition. | |
| 52 | |
| 53 At the end of out-of-ssa, each partition becomes a "real" variable and is | |
| 54 rewritten as a compiler variable. | |
| 55 | |
| 56 The var_map data structure is used to manage these partitions. It allows | |
| 57 partitions to be combined, and determines which partition belongs to what | |
| 58 ssa_name or variable, and vice versa. */ | |
| 59 | |
| 60 | |
| 61 /* Remove the base table in MAP. */ | |
| 62 | |
| 63 static void | |
| 64 var_map_base_fini (var_map map) | |
| 65 { | |
| 66 /* Free the basevar info if it is present. */ | |
| 67 if (map->partition_to_base_index != NULL) | |
| 68 { | |
| 69 free (map->partition_to_base_index); | |
| 70 map->partition_to_base_index = NULL; | |
| 71 map->num_basevars = 0; | |
| 72 } | |
| 73 } | |
| 74 /* Create a variable partition map of SIZE, initialize and return it. */ | |
| 75 | |
| 76 var_map | |
| 77 init_var_map (int size) | |
| 78 { | |
| 79 var_map map; | |
| 80 | |
| 81 map = (var_map) xmalloc (sizeof (struct _var_map)); | |
| 82 map->var_partition = partition_new (size); | |
| 83 | |
| 84 map->partition_to_view = NULL; | |
| 85 map->view_to_partition = NULL; | |
| 86 map->num_partitions = size; | |
| 87 map->partition_size = size; | |
| 88 map->num_basevars = 0; | |
| 89 map->partition_to_base_index = NULL; | |
| 90 return map; | |
| 91 } | |
| 92 | |
| 93 | |
| 94 /* Free memory associated with MAP. */ | |
| 95 | |
| 96 void | |
| 97 delete_var_map (var_map map) | |
| 98 { | |
| 99 var_map_base_fini (map); | |
| 100 partition_delete (map->var_partition); | |
| 111 | 101 free (map->partition_to_view); |
| 102 free (map->view_to_partition); | |
| 0 | 103 free (map); |
| 104 } | |
| 105 | |
| 106 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
107 /* This function will combine the partitions in MAP for VAR1 and VAR2. It |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
108 Returns the partition which represents the new partition. If the two |
| 0 | 109 partitions cannot be combined, NO_PARTITION is returned. */ |
| 110 | |
| 111 int | |
| 112 var_union (var_map map, tree var1, tree var2) | |
| 113 { | |
| 114 int p1, p2, p3; | |
| 115 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
116 gcc_assert (TREE_CODE (var1) == SSA_NAME); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
117 gcc_assert (TREE_CODE (var2) == SSA_NAME); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
118 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
119 /* This is independent of partition_to_view. If partition_to_view is |
| 0 | 120 on, then whichever one of these partitions is absorbed will never have a |
| 121 dereference into the partition_to_view array any more. */ | |
| 122 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
123 p1 = partition_find (map->var_partition, SSA_NAME_VERSION (var1)); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
124 p2 = partition_find (map->var_partition, SSA_NAME_VERSION (var2)); |
| 0 | 125 |
| 126 gcc_assert (p1 != NO_PARTITION); | |
| 127 gcc_assert (p2 != NO_PARTITION); | |
| 128 | |
| 129 if (p1 == p2) | |
| 130 p3 = p1; | |
| 131 else | |
| 132 p3 = partition_union (map->var_partition, p1, p2); | |
| 133 | |
| 134 if (map->partition_to_view) | |
| 135 p3 = map->partition_to_view[p3]; | |
| 136 | |
| 137 return p3; | |
| 138 } | |
| 139 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
140 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
141 /* Compress the partition numbers in MAP such that they fall in the range |
| 0 | 142 0..(num_partitions-1) instead of wherever they turned out during |
| 143 the partitioning exercise. This removes any references to unused | |
| 144 partitions, thereby allowing bitmaps and other vectors to be much | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
145 denser. |
| 0 | 146 |
| 147 This is implemented such that compaction doesn't affect partitioning. | |
| 148 Ie., once partitions are created and possibly merged, running one | |
| 149 or more different kind of compaction will not affect the partitions | |
| 150 themselves. Their index might change, but all the same variables will | |
| 151 still be members of the same partition group. This allows work on reduced | |
| 152 sets, and no loss of information when a larger set is later desired. | |
| 153 | |
| 154 In particular, coalescing can work on partitions which have 2 or more | |
| 155 definitions, and then 'recompact' later to include all the single | |
| 156 definitions for assignment to program variables. */ | |
| 157 | |
| 158 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
159 /* Set MAP back to the initial state of having no partition view. Return a |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
160 bitmap which has a bit set for each partition number which is in use in the |
| 0 | 161 varmap. */ |
| 162 | |
| 163 static bitmap | |
| 164 partition_view_init (var_map map) | |
| 165 { | |
| 166 bitmap used; | |
| 167 int tmp; | |
| 168 unsigned int x; | |
| 169 | |
| 170 used = BITMAP_ALLOC (NULL); | |
| 171 | |
| 172 /* Already in a view? Abandon the old one. */ | |
| 173 if (map->partition_to_view) | |
| 174 { | |
| 175 free (map->partition_to_view); | |
| 176 map->partition_to_view = NULL; | |
| 177 } | |
| 178 if (map->view_to_partition) | |
| 179 { | |
| 180 free (map->view_to_partition); | |
| 181 map->view_to_partition = NULL; | |
| 182 } | |
| 183 | |
| 184 /* Find out which partitions are actually referenced. */ | |
| 185 for (x = 0; x < map->partition_size; x++) | |
| 186 { | |
| 187 tmp = partition_find (map->var_partition, x); | |
| 111 | 188 if (ssa_name (tmp) != NULL_TREE && !virtual_operand_p (ssa_name (tmp)) |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
189 && (!has_zero_uses (ssa_name (tmp)) |
| 111 | 190 || !SSA_NAME_IS_DEFAULT_DEF (ssa_name (tmp)) |
| 191 || (SSA_NAME_VAR (ssa_name (tmp)) | |
| 192 && !VAR_P (SSA_NAME_VAR (ssa_name (tmp)))))) | |
| 0 | 193 bitmap_set_bit (used, tmp); |
| 194 } | |
| 195 | |
| 196 map->num_partitions = map->partition_size; | |
| 197 return used; | |
| 198 } | |
| 199 | |
| 200 | |
| 201 /* This routine will finalize the view data for MAP based on the partitions | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
202 set in SELECTED. This is either the same bitmap returned from |
| 0 | 203 partition_view_init, or a trimmed down version if some of those partitions |
| 204 were not desired in this view. SELECTED is freed before returning. */ | |
| 205 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
206 static void |
| 0 | 207 partition_view_fini (var_map map, bitmap selected) |
| 208 { | |
| 209 bitmap_iterator bi; | |
| 210 unsigned count, i, x, limit; | |
| 211 | |
| 212 gcc_assert (selected); | |
| 213 | |
| 214 count = bitmap_count_bits (selected); | |
| 215 limit = map->partition_size; | |
| 216 | |
| 217 /* If its a one-to-one ratio, we don't need any view compaction. */ | |
| 218 if (count < limit) | |
| 219 { | |
| 220 map->partition_to_view = (int *)xmalloc (limit * sizeof (int)); | |
| 221 memset (map->partition_to_view, 0xff, (limit * sizeof (int))); | |
| 222 map->view_to_partition = (int *)xmalloc (count * sizeof (int)); | |
| 223 | |
| 224 i = 0; | |
| 225 /* Give each selected partition an index. */ | |
| 226 EXECUTE_IF_SET_IN_BITMAP (selected, 0, x, bi) | |
| 227 { | |
| 228 map->partition_to_view[x] = i; | |
| 229 map->view_to_partition[i] = x; | |
| 230 i++; | |
| 231 } | |
| 232 gcc_assert (i == count); | |
| 233 map->num_partitions = i; | |
| 234 } | |
| 235 | |
| 236 BITMAP_FREE (selected); | |
| 237 } | |
| 238 | |
| 239 | |
| 111 | 240 /* Create a partition view which includes all the used partitions in MAP. */ |
| 0 | 241 |
| 111 | 242 void |
| 243 partition_view_normal (var_map map) | |
| 0 | 244 { |
| 245 bitmap used; | |
| 246 | |
| 247 used = partition_view_init (map); | |
| 248 partition_view_fini (map, used); | |
| 249 | |
| 111 | 250 var_map_base_fini (map); |
| 0 | 251 } |
| 252 | |
| 253 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
254 /* Create a partition view in MAP which includes just partitions which occur in |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
255 the bitmap ONLY. If WANT_BASES is true, create the base variable map |
| 0 | 256 as well. */ |
| 257 | |
| 111 | 258 void |
| 259 partition_view_bitmap (var_map map, bitmap only) | |
| 0 | 260 { |
| 261 bitmap used; | |
| 262 bitmap new_partitions = BITMAP_ALLOC (NULL); | |
| 263 unsigned x, p; | |
| 264 bitmap_iterator bi; | |
| 265 | |
| 266 used = partition_view_init (map); | |
| 267 EXECUTE_IF_SET_IN_BITMAP (only, 0, x, bi) | |
| 268 { | |
| 269 p = partition_find (map->var_partition, x); | |
| 270 gcc_assert (bitmap_bit_p (used, p)); | |
| 271 bitmap_set_bit (new_partitions, p); | |
| 272 } | |
| 273 partition_view_fini (map, new_partitions); | |
| 274 | |
| 111 | 275 var_map_base_fini (map); |
| 0 | 276 } |
| 277 | |
| 278 | |
| 111 | 279 static bitmap usedvars; |
| 280 | |
| 281 /* Mark VAR as used, so that it'll be preserved during rtl expansion. | |
| 282 Returns true if VAR wasn't marked before. */ | |
| 283 | |
| 284 static inline bool | |
| 285 set_is_used (tree var) | |
| 286 { | |
| 287 return bitmap_set_bit (usedvars, DECL_UID (var)); | |
| 288 } | |
| 289 | |
| 290 /* Return true if VAR is marked as used. */ | |
| 291 | |
| 292 static inline bool | |
| 293 is_used_p (tree var) | |
| 294 { | |
| 295 return bitmap_bit_p (usedvars, DECL_UID (var)); | |
| 296 } | |
| 297 | |
| 298 static inline void mark_all_vars_used (tree *); | |
| 0 | 299 |
| 300 /* Helper function for mark_all_vars_used, called via walk_tree. */ | |
| 301 | |
| 302 static tree | |
| 111 | 303 mark_all_vars_used_1 (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED) |
| 0 | 304 { |
| 305 tree t = *tp; | |
| 306 enum tree_code_class c = TREE_CODE_CLASS (TREE_CODE (t)); | |
| 307 tree b; | |
| 308 | |
| 309 if (TREE_CODE (t) == SSA_NAME) | |
| 111 | 310 { |
| 311 *walk_subtrees = 0; | |
| 312 t = SSA_NAME_VAR (t); | |
| 313 if (!t) | |
| 314 return NULL; | |
| 315 } | |
| 0 | 316 |
| 317 if (IS_EXPR_CODE_CLASS (c) | |
| 318 && (b = TREE_BLOCK (t)) != NULL) | |
| 319 TREE_USED (b) = true; | |
| 320 | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
321 /* Ignore TMR_OFFSET and TMR_STEP for TARGET_MEM_REFS, as those |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
322 fields do not contain vars. */ |
| 0 | 323 if (TREE_CODE (t) == TARGET_MEM_REF) |
| 324 { | |
| 111 | 325 mark_all_vars_used (&TMR_BASE (t)); |
| 326 mark_all_vars_used (&TMR_INDEX (t)); | |
| 327 mark_all_vars_used (&TMR_INDEX2 (t)); | |
| 0 | 328 *walk_subtrees = 0; |
| 329 return NULL; | |
| 330 } | |
| 331 | |
| 332 /* Only need to mark VAR_DECLS; parameters and return results are not | |
| 333 eliminated as unused. */ | |
| 111 | 334 if (VAR_P (t)) |
| 0 | 335 { |
| 111 | 336 /* When a global var becomes used for the first time also walk its |
| 337 initializer (non global ones don't have any). */ | |
| 338 if (set_is_used (t) && is_global_var (t) | |
| 339 && DECL_CONTEXT (t) == current_function_decl) | |
| 340 mark_all_vars_used (&DECL_INITIAL (t)); | |
| 0 | 341 } |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
342 /* remove_unused_scope_block_p requires information about labels |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
343 which are not DECL_IGNORED_P to tell if they might be used in the IL. */ |
| 111 | 344 else if (TREE_CODE (t) == LABEL_DECL) |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
345 /* Although the TREE_USED values that the frontend uses would be |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
346 acceptable (albeit slightly over-conservative) for our purposes, |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
347 init_vars_expansion clears TREE_USED for LABEL_DECLs too, so we |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
348 must re-compute it here. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
349 TREE_USED (t) = 1; |
| 0 | 350 |
| 351 if (IS_TYPE_OR_DECL_P (t)) | |
| 352 *walk_subtrees = 0; | |
| 353 | |
| 354 return NULL; | |
| 355 } | |
| 356 | |
| 357 /* Mark the scope block SCOPE and its subblocks unused when they can be | |
| 358 possibly eliminated if dead. */ | |
| 359 | |
| 360 static void | |
| 361 mark_scope_block_unused (tree scope) | |
| 362 { | |
| 363 tree t; | |
| 364 TREE_USED (scope) = false; | |
| 365 if (!(*debug_hooks->ignore_block) (scope)) | |
| 366 TREE_USED (scope) = true; | |
| 367 for (t = BLOCK_SUBBLOCKS (scope); t ; t = BLOCK_CHAIN (t)) | |
| 368 mark_scope_block_unused (t); | |
| 369 } | |
| 370 | |
| 371 /* Look if the block is dead (by possibly eliminating its dead subblocks) | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
372 and return true if so. |
| 0 | 373 Block is declared dead if: |
| 374 1) No statements are associated with it. | |
| 375 2) Declares no live variables | |
| 376 3) All subblocks are dead | |
| 377 or there is precisely one subblocks and the block | |
| 378 has same abstract origin as outer block and declares | |
| 379 no variables, so it is pure wrapper. | |
| 380 When we are not outputting full debug info, we also eliminate dead variables | |
| 381 out of scope blocks to let them to be recycled by GGC and to save copying work | |
| 382 done by the inliner. */ | |
| 383 | |
| 384 static bool | |
| 111 | 385 remove_unused_scope_block_p (tree scope, bool in_ctor_dtor_block) |
| 0 | 386 { |
| 387 tree *t, *next; | |
| 388 bool unused = !TREE_USED (scope); | |
| 389 int nsubblocks = 0; | |
| 390 | |
| 111 | 391 /* For ipa-polymorphic-call.c purposes, preserve blocks: |
| 392 1) with BLOCK_ABSTRACT_ORIGIN of a ctor/dtor or their clones */ | |
| 393 if (inlined_polymorphic_ctor_dtor_block_p (scope, true)) | |
| 394 { | |
| 395 in_ctor_dtor_block = true; | |
| 396 unused = false; | |
| 397 } | |
| 398 /* 2) inside such blocks, the outermost block with block_ultimate_origin | |
| 399 being a FUNCTION_DECL. */ | |
| 400 else if (in_ctor_dtor_block) | |
| 401 { | |
| 402 tree fn = block_ultimate_origin (scope); | |
| 403 if (fn && TREE_CODE (fn) == FUNCTION_DECL) | |
| 404 { | |
| 405 in_ctor_dtor_block = false; | |
| 406 unused = false; | |
| 407 } | |
| 408 } | |
| 409 | |
| 0 | 410 for (t = &BLOCK_VARS (scope); *t; t = next) |
| 411 { | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
412 next = &DECL_CHAIN (*t); |
| 0 | 413 |
| 414 /* Debug info of nested function refers to the block of the | |
| 415 function. We might stil call it even if all statements | |
| 416 of function it was nested into was elliminated. | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
417 |
| 0 | 418 TODO: We can actually look into cgraph to see if function |
| 419 will be output to file. */ | |
| 420 if (TREE_CODE (*t) == FUNCTION_DECL) | |
| 421 unused = false; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
422 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
423 /* If a decl has a value expr, we need to instantiate it |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
424 regardless of debug info generation, to avoid codegen |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
425 differences in memory overlap tests. update_equiv_regs() may |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
426 indirectly call validate_equiv_mem() to test whether a |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
427 SET_DEST overlaps with others, and if the value expr changes |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
428 by virtual register instantiation, we may get end up with |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
429 different results. */ |
| 111 | 430 else if (VAR_P (*t) && DECL_HAS_VALUE_EXPR_P (*t)) |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
431 unused = false; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
432 |
| 111 | 433 /* Remove everything we don't generate debug info for. */ |
| 434 else if (DECL_IGNORED_P (*t)) | |
| 0 | 435 { |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
436 *t = DECL_CHAIN (*t); |
| 0 | 437 next = t; |
| 438 } | |
| 439 | |
| 440 /* When we are outputting debug info, we usually want to output | |
| 441 info about optimized-out variables in the scope blocks. | |
| 442 Exception are the scope blocks not containing any instructions | |
| 443 at all so user can't get into the scopes at first place. */ | |
| 111 | 444 else if (is_used_p (*t)) |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
445 unused = false; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
446 else if (TREE_CODE (*t) == LABEL_DECL && TREE_USED (*t)) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
447 /* For labels that are still used in the IL, the decision to |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
448 preserve them must not depend DEBUG_INFO_LEVEL, otherwise we |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
449 risk having different ordering in debug vs. non-debug builds |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
450 during inlining or versioning. |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
451 A label appearing here (we have already checked DECL_IGNORED_P) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
452 should not be used in the IL unless it has been explicitly used |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
453 before, so we use TREE_USED as an approximation. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
454 /* In principle, we should do the same here as for the debug case |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
455 below, however, when debugging, there might be additional nested |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
456 levels that keep an upper level with a label live, so we have to |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
457 force this block to be considered used, too. */ |
| 0 | 458 unused = false; |
| 459 | |
| 460 /* When we are not doing full debug info, we however can keep around | |
| 461 only the used variables for cfgexpand's memory packing saving quite | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
462 a lot of memory. |
| 0 | 463 |
| 464 For sake of -g3, we keep around those vars but we don't count this as | |
| 465 use of block, so innermost block with no used vars and no instructions | |
| 466 can be considered dead. We only want to keep around blocks user can | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
467 breakpoint into and ask about value of optimized out variables. |
| 0 | 468 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
469 Similarly we need to keep around types at least until all |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
470 variables of all nested blocks are gone. We track no |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
471 information on whether given type is used or not, so we have |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
472 to keep them even when not emitting debug information, |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
473 otherwise we may end up remapping variables and their (local) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
474 types in different orders depending on whether debug |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
475 information is being generated. */ |
| 0 | 476 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
477 else if (TREE_CODE (*t) == TYPE_DECL |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
478 || debug_info_level == DINFO_LEVEL_NORMAL |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
479 || debug_info_level == DINFO_LEVEL_VERBOSE) |
| 0 | 480 ; |
| 481 else | |
| 482 { | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
483 *t = DECL_CHAIN (*t); |
| 0 | 484 next = t; |
| 485 } | |
| 486 } | |
| 487 | |
| 488 for (t = &BLOCK_SUBBLOCKS (scope); *t ;) | |
| 111 | 489 if (remove_unused_scope_block_p (*t, in_ctor_dtor_block)) |
| 0 | 490 { |
| 491 if (BLOCK_SUBBLOCKS (*t)) | |
| 492 { | |
| 493 tree next = BLOCK_CHAIN (*t); | |
| 494 tree supercontext = BLOCK_SUPERCONTEXT (*t); | |
| 495 | |
| 496 *t = BLOCK_SUBBLOCKS (*t); | |
| 497 while (BLOCK_CHAIN (*t)) | |
| 498 { | |
| 499 BLOCK_SUPERCONTEXT (*t) = supercontext; | |
| 500 t = &BLOCK_CHAIN (*t); | |
| 501 } | |
| 502 BLOCK_CHAIN (*t) = next; | |
| 503 BLOCK_SUPERCONTEXT (*t) = supercontext; | |
| 504 t = &BLOCK_CHAIN (*t); | |
| 505 nsubblocks ++; | |
| 506 } | |
| 507 else | |
| 508 *t = BLOCK_CHAIN (*t); | |
| 509 } | |
| 510 else | |
| 511 { | |
| 512 t = &BLOCK_CHAIN (*t); | |
| 513 nsubblocks ++; | |
| 514 } | |
| 515 | |
| 516 | |
| 517 if (!unused) | |
| 518 ; | |
| 519 /* Outer scope is always used. */ | |
| 520 else if (!BLOCK_SUPERCONTEXT (scope) | |
| 521 || TREE_CODE (BLOCK_SUPERCONTEXT (scope)) == FUNCTION_DECL) | |
| 522 unused = false; | |
| 523 /* Innermost blocks with no live variables nor statements can be always | |
| 524 eliminated. */ | |
| 525 else if (!nsubblocks) | |
| 526 ; | |
| 111 | 527 /* When not generating debug info we can eliminate info on unused |
| 528 variables. */ | |
| 529 else if (!flag_auto_profile && debug_info_level == DINFO_LEVEL_NONE) | |
|
19
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
530 { |
| 111 | 531 /* Even for -g0 don't prune outer scopes from artificial |
|
19
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
532 functions, otherwise diagnostics using tree_nonartificial_location |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
533 will not be emitted properly. */ |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
534 if (inlined_function_outer_scope_p (scope)) |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
535 { |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
536 tree ao = scope; |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
537 |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
538 while (ao |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
539 && TREE_CODE (ao) == BLOCK |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
540 && BLOCK_ABSTRACT_ORIGIN (ao) != ao) |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
541 ao = BLOCK_ABSTRACT_ORIGIN (ao); |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
542 if (ao |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
543 && TREE_CODE (ao) == FUNCTION_DECL |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
544 && DECL_DECLARED_INLINE_P (ao) |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
545 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao))) |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
546 unused = false; |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
547 } |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
548 } |
| 0 | 549 else if (BLOCK_VARS (scope) || BLOCK_NUM_NONLOCALIZED_VARS (scope)) |
| 550 unused = false; | |
| 551 /* See if this block is important for representation of inlined function. | |
| 552 Inlined functions are always represented by block with | |
| 553 block_ultimate_origin being set to FUNCTION_DECL and DECL_SOURCE_LOCATION | |
| 554 set... */ | |
| 555 else if (inlined_function_outer_scope_p (scope)) | |
| 556 unused = false; | |
| 557 else | |
| 558 /* Verfify that only blocks with source location set | |
| 559 are entry points to the inlined functions. */ | |
| 111 | 560 gcc_assert (LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (scope)) |
| 561 == UNKNOWN_LOCATION); | |
|
19
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
562 |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
563 TREE_USED (scope) = !unused; |
| 0 | 564 return unused; |
| 565 } | |
| 566 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
567 /* Mark all VAR_DECLS under *EXPR_P as used, so that they won't be |
| 0 | 568 eliminated during the tree->rtl conversion process. */ |
| 569 | |
| 570 static inline void | |
| 111 | 571 mark_all_vars_used (tree *expr_p) |
| 0 | 572 { |
| 111 | 573 walk_tree (expr_p, mark_all_vars_used_1, NULL, NULL); |
| 574 } | |
| 575 | |
| 576 /* Helper function for clear_unused_block_pointer, called via walk_tree. */ | |
| 577 | |
| 578 static tree | |
| 579 clear_unused_block_pointer_1 (tree *tp, int *, void *) | |
| 580 { | |
| 581 if (EXPR_P (*tp) && TREE_BLOCK (*tp) | |
| 582 && !TREE_USED (TREE_BLOCK (*tp))) | |
| 583 TREE_SET_BLOCK (*tp, NULL); | |
| 584 return NULL_TREE; | |
| 0 | 585 } |
| 586 | |
| 111 | 587 /* Set all block pointer in debug or clobber stmt to NULL if the block |
| 588 is unused, so that they will not be streamed out. */ | |
| 589 | |
| 590 static void | |
| 591 clear_unused_block_pointer (void) | |
| 592 { | |
| 593 basic_block bb; | |
| 594 gimple_stmt_iterator gsi; | |
| 595 | |
| 596 FOR_EACH_BB_FN (bb, cfun) | |
| 597 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
| 598 { | |
| 599 unsigned i; | |
| 600 tree b; | |
| 601 gimple *stmt = gsi_stmt (gsi); | |
| 602 | |
| 603 if (!is_gimple_debug (stmt) && !gimple_clobber_p (stmt)) | |
| 604 continue; | |
| 605 b = gimple_block (stmt); | |
| 606 if (b && !TREE_USED (b)) | |
| 607 gimple_set_block (stmt, NULL); | |
| 608 for (i = 0; i < gimple_num_ops (stmt); i++) | |
| 609 walk_tree (gimple_op_ptr (stmt, i), clear_unused_block_pointer_1, | |
| 610 NULL, NULL); | |
| 611 } | |
| 612 } | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
613 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
614 /* Dump scope blocks starting at SCOPE to FILE. INDENT is the |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
615 indentation level and FLAGS is as in print_generic_expr. */ |
| 0 | 616 |
| 617 static void | |
| 111 | 618 dump_scope_block (FILE *file, int indent, tree scope, dump_flags_t flags) |
| 0 | 619 { |
| 620 tree var, t; | |
| 621 unsigned int i; | |
| 622 | |
| 623 fprintf (file, "\n%*s{ Scope block #%i%s%s",indent, "" , BLOCK_NUMBER (scope), | |
| 624 TREE_USED (scope) ? "" : " (unused)", | |
| 625 BLOCK_ABSTRACT (scope) ? " (abstract)": ""); | |
| 111 | 626 if (LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (scope)) != UNKNOWN_LOCATION) |
| 0 | 627 { |
| 628 expanded_location s = expand_location (BLOCK_SOURCE_LOCATION (scope)); | |
| 629 fprintf (file, " %s:%i", s.file, s.line); | |
| 630 } | |
| 631 if (BLOCK_ABSTRACT_ORIGIN (scope)) | |
| 632 { | |
| 633 tree origin = block_ultimate_origin (scope); | |
| 634 if (origin) | |
| 635 { | |
| 636 fprintf (file, " Originating from :"); | |
| 637 if (DECL_P (origin)) | |
| 638 print_generic_decl (file, origin, flags); | |
| 639 else | |
| 640 fprintf (file, "#%i", BLOCK_NUMBER (origin)); | |
| 641 } | |
| 642 } | |
| 643 fprintf (file, " \n"); | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
644 for (var = BLOCK_VARS (scope); var; var = DECL_CHAIN (var)) |
| 0 | 645 { |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
646 fprintf (file, "%*s", indent, ""); |
| 0 | 647 print_generic_decl (file, var, flags); |
| 111 | 648 fprintf (file, "\n"); |
| 0 | 649 } |
| 650 for (i = 0; i < BLOCK_NUM_NONLOCALIZED_VARS (scope); i++) | |
| 651 { | |
| 652 fprintf (file, "%*s",indent, ""); | |
| 653 print_generic_decl (file, BLOCK_NONLOCALIZED_VAR (scope, i), | |
| 654 flags); | |
| 655 fprintf (file, " (nonlocalized)\n"); | |
| 656 } | |
| 657 for (t = BLOCK_SUBBLOCKS (scope); t ; t = BLOCK_CHAIN (t)) | |
| 658 dump_scope_block (file, indent + 2, t, flags); | |
| 659 fprintf (file, "\n%*s}\n",indent, ""); | |
| 660 } | |
| 661 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
662 /* Dump the tree of lexical scopes starting at SCOPE to stderr. FLAGS |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
663 is as in print_generic_expr. */ |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
664 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
665 DEBUG_FUNCTION void |
| 111 | 666 debug_scope_block (tree scope, dump_flags_t flags) |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
667 { |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
668 dump_scope_block (stderr, 0, scope, flags); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
669 } |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
670 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
671 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
672 /* Dump the tree of lexical scopes of current_function_decl to FILE. |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
673 FLAGS is as in print_generic_expr. */ |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
674 |
| 0 | 675 void |
| 111 | 676 dump_scope_blocks (FILE *file, dump_flags_t flags) |
| 0 | 677 { |
| 678 dump_scope_block (file, 0, DECL_INITIAL (current_function_decl), flags); | |
| 679 } | |
| 680 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
681 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
682 /* Dump the tree of lexical scopes of current_function_decl to stderr. |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
683 FLAGS is as in print_generic_expr. */ |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
684 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
685 DEBUG_FUNCTION void |
| 111 | 686 debug_scope_blocks (dump_flags_t flags) |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
687 { |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
688 dump_scope_blocks (stderr, flags); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
689 } |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
690 |
| 0 | 691 /* Remove local variables that are not referenced in the IL. */ |
| 692 | |
| 693 void | |
| 694 remove_unused_locals (void) | |
| 695 { | |
| 696 basic_block bb; | |
| 111 | 697 tree var; |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
698 unsigned srcidx, dstidx, num; |
| 111 | 699 bool have_local_clobbers = false; |
| 0 | 700 |
|
19
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
701 /* Removing declarations from lexical blocks when not optimizing is |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
702 not only a waste of time, it actually causes differences in stack |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
703 layout. */ |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
704 if (!optimize) |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
705 return; |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
706 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
707 timevar_push (TV_REMOVE_UNUSED); |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
708 |
| 0 | 709 mark_scope_block_unused (DECL_INITIAL (current_function_decl)); |
| 710 | |
| 111 | 711 usedvars = BITMAP_ALLOC (NULL); |
| 0 | 712 |
| 713 /* Walk the CFG marking all referenced symbols. */ | |
| 111 | 714 FOR_EACH_BB_FN (bb, cfun) |
| 0 | 715 { |
| 716 gimple_stmt_iterator gsi; | |
| 717 size_t i; | |
| 718 edge_iterator ei; | |
| 719 edge e; | |
| 720 | |
| 721 /* Walk the statements. */ | |
| 722 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
| 723 { | |
| 111 | 724 gimple *stmt = gsi_stmt (gsi); |
| 0 | 725 tree b = gimple_block (stmt); |
| 726 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
727 if (is_gimple_debug (stmt)) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
728 continue; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
729 |
| 111 | 730 if (gimple_clobber_p (stmt)) |
| 731 { | |
| 732 have_local_clobbers = true; | |
| 733 continue; | |
| 734 } | |
| 735 | |
| 0 | 736 if (b) |
| 737 TREE_USED (b) = true; | |
| 738 | |
| 739 for (i = 0; i < gimple_num_ops (stmt); i++) | |
| 111 | 740 mark_all_vars_used (gimple_op_ptr (gsi_stmt (gsi), i)); |
| 0 | 741 } |
| 742 | |
| 111 | 743 for (gphi_iterator gpi = gsi_start_phis (bb); |
| 744 !gsi_end_p (gpi); | |
| 745 gsi_next (&gpi)) | |
| 0 | 746 { |
| 747 use_operand_p arg_p; | |
| 748 ssa_op_iter i; | |
| 749 tree def; | |
| 111 | 750 gphi *phi = gpi.phi (); |
| 0 | 751 |
| 111 | 752 if (virtual_operand_p (gimple_phi_result (phi))) |
| 0 | 753 continue; |
| 754 | |
| 755 def = gimple_phi_result (phi); | |
| 111 | 756 mark_all_vars_used (&def); |
| 0 | 757 |
| 758 FOR_EACH_PHI_ARG (arg_p, phi, i, SSA_OP_ALL_USES) | |
| 759 { | |
| 760 tree arg = USE_FROM_PTR (arg_p); | |
| 111 | 761 int index = PHI_ARG_INDEX_FROM_USE (arg_p); |
| 762 tree block = | |
| 763 LOCATION_BLOCK (gimple_phi_arg_location (phi, index)); | |
| 764 if (block != NULL) | |
| 765 TREE_USED (block) = true; | |
| 766 mark_all_vars_used (&arg); | |
| 0 | 767 } |
| 768 } | |
| 769 | |
| 770 FOR_EACH_EDGE (e, ei, bb->succs) | |
| 111 | 771 if (LOCATION_BLOCK (e->goto_locus) != NULL) |
| 772 TREE_USED (LOCATION_BLOCK (e->goto_locus)) = true; | |
| 773 } | |
| 774 | |
| 775 /* We do a two-pass approach about the out-of-scope clobbers. We want | |
| 776 to remove them if they are the only references to a local variable, | |
| 777 but we want to retain them when there's any other. So the first pass | |
| 778 ignores them, and the second pass (if there were any) tries to remove | |
| 779 them. */ | |
| 780 if (have_local_clobbers) | |
| 781 FOR_EACH_BB_FN (bb, cfun) | |
| 782 { | |
| 783 gimple_stmt_iterator gsi; | |
| 784 | |
| 785 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi);) | |
| 786 { | |
| 787 gimple *stmt = gsi_stmt (gsi); | |
| 788 tree b = gimple_block (stmt); | |
| 789 | |
| 790 if (gimple_clobber_p (stmt)) | |
| 791 { | |
| 792 tree lhs = gimple_assign_lhs (stmt); | |
| 793 tree base = get_base_address (lhs); | |
| 794 /* Remove clobbers referencing unused vars, or clobbers | |
| 795 with MEM_REF lhs referencing uninitialized pointers. */ | |
| 796 if ((VAR_P (base) && !is_used_p (base)) | |
| 797 || (TREE_CODE (lhs) == MEM_REF | |
| 798 && TREE_CODE (TREE_OPERAND (lhs, 0)) == SSA_NAME | |
| 799 && SSA_NAME_IS_DEFAULT_DEF (TREE_OPERAND (lhs, 0)) | |
| 800 && (TREE_CODE (SSA_NAME_VAR (TREE_OPERAND (lhs, 0))) | |
| 801 != PARM_DECL))) | |
| 802 { | |
| 803 unlink_stmt_vdef (stmt); | |
| 804 gsi_remove (&gsi, true); | |
| 805 release_defs (stmt); | |
| 806 continue; | |
| 807 } | |
| 808 if (b) | |
| 809 TREE_USED (b) = true; | |
| 810 } | |
| 811 gsi_next (&gsi); | |
| 812 } | |
| 813 } | |
| 814 | |
| 815 if (cfun->has_simduid_loops) | |
| 816 { | |
| 817 struct loop *loop; | |
| 818 FOR_EACH_LOOP (loop, 0) | |
| 819 if (loop->simduid && !is_used_p (loop->simduid)) | |
| 820 loop->simduid = NULL_TREE; | |
| 0 | 821 } |
| 822 | |
| 823 cfun->has_local_explicit_reg_vars = false; | |
| 824 | |
| 111 | 825 /* Remove unmarked local and global vars from local_decls. */ |
| 826 num = vec_safe_length (cfun->local_decls); | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
827 for (srcidx = 0, dstidx = 0; srcidx < num; srcidx++) |
| 0 | 828 { |
| 111 | 829 var = (*cfun->local_decls)[srcidx]; |
| 830 if (VAR_P (var)) | |
| 0 | 831 { |
| 111 | 832 if (!is_used_p (var)) |
| 0 | 833 { |
| 111 | 834 tree def; |
| 835 if (cfun->nonlocal_goto_save_area | |
| 836 && TREE_OPERAND (cfun->nonlocal_goto_save_area, 0) == var) | |
| 837 cfun->nonlocal_goto_save_area = NULL; | |
| 838 /* Release any default def associated with var. */ | |
| 839 if ((def = ssa_default_def (cfun, var)) != NULL_TREE) | |
| 840 { | |
| 841 set_ssa_default_def (cfun, var, NULL_TREE); | |
| 842 release_ssa_name (def); | |
| 843 } | |
| 844 continue; | |
| 0 | 845 } |
| 846 } | |
| 111 | 847 if (VAR_P (var) && DECL_HARD_REGISTER (var) && !is_global_var (var)) |
| 0 | 848 cfun->has_local_explicit_reg_vars = true; |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
849 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
850 if (srcidx != dstidx) |
| 111 | 851 (*cfun->local_decls)[dstidx] = var; |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
852 dstidx++; |
| 0 | 853 } |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
854 if (dstidx != num) |
| 0 | 855 { |
| 111 | 856 statistics_counter_event (cfun, "unused VAR_DECLs removed", num - dstidx); |
| 857 cfun->local_decls->truncate (dstidx); | |
| 0 | 858 } |
| 859 | |
| 111 | 860 remove_unused_scope_block_p (DECL_INITIAL (current_function_decl), |
| 861 polymorphic_ctor_dtor_p (current_function_decl, | |
| 862 true) != NULL_TREE); | |
| 863 clear_unused_block_pointer (); | |
| 864 | |
| 865 BITMAP_FREE (usedvars); | |
| 866 | |
| 0 | 867 if (dump_file && (dump_flags & TDF_DETAILS)) |
| 868 { | |
| 869 fprintf (dump_file, "Scope blocks after cleanups:\n"); | |
| 870 dump_scope_blocks (dump_file, dump_flags); | |
| 871 } | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
872 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
873 timevar_pop (TV_REMOVE_UNUSED); |
| 0 | 874 } |
| 875 | |
| 876 /* Allocate and return a new live range information object base on MAP. */ | |
| 877 | |
| 878 static tree_live_info_p | |
| 879 new_tree_live_info (var_map map) | |
| 880 { | |
| 881 tree_live_info_p live; | |
| 111 | 882 basic_block bb; |
| 0 | 883 |
| 111 | 884 live = XNEW (struct tree_live_info_d); |
| 0 | 885 live->map = map; |
| 111 | 886 live->num_blocks = last_basic_block_for_fn (cfun); |
| 0 | 887 |
| 111 | 888 bitmap_obstack_initialize (&live->livein_obstack); |
| 889 bitmap_obstack_initialize (&live->liveout_obstack); | |
| 890 live->livein = XNEWVEC (bitmap_head, last_basic_block_for_fn (cfun)); | |
| 891 FOR_EACH_BB_FN (bb, cfun) | |
| 892 bitmap_initialize (&live->livein[bb->index], &live->livein_obstack); | |
| 0 | 893 |
| 111 | 894 live->liveout = XNEWVEC (bitmap_head, last_basic_block_for_fn (cfun)); |
| 895 FOR_EACH_BB_FN (bb, cfun) | |
| 896 bitmap_initialize (&live->liveout[bb->index], &live->liveout_obstack); | |
| 0 | 897 |
| 111 | 898 live->work_stack = XNEWVEC (int, last_basic_block_for_fn (cfun)); |
| 0 | 899 live->stack_top = live->work_stack; |
| 900 | |
| 901 live->global = BITMAP_ALLOC (NULL); | |
| 902 return live; | |
| 903 } | |
| 904 | |
| 905 | |
| 906 /* Free storage for live range info object LIVE. */ | |
| 907 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
908 void |
| 0 | 909 delete_tree_live_info (tree_live_info_p live) |
| 910 { | |
| 111 | 911 if (live->livein) |
| 912 { | |
| 913 bitmap_obstack_release (&live->livein_obstack); | |
| 914 free (live->livein); | |
| 915 } | |
| 916 if (live->liveout) | |
| 917 { | |
| 918 bitmap_obstack_release (&live->liveout_obstack); | |
| 919 free (live->liveout); | |
| 920 } | |
| 0 | 921 BITMAP_FREE (live->global); |
| 922 free (live->work_stack); | |
| 923 free (live); | |
| 924 } | |
| 925 | |
| 926 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
927 /* Visit basic block BB and propagate any required live on entry bits from |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
928 LIVE into the predecessors. VISITED is the bitmap of visited blocks. |
| 0 | 929 TMP is a temporary work bitmap which is passed in to avoid reallocating |
| 930 it each time. */ | |
| 931 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
932 static void |
| 111 | 933 loe_visit_block (tree_live_info_p live, basic_block bb, sbitmap visited) |
| 0 | 934 { |
| 935 edge e; | |
| 936 bool change; | |
| 937 edge_iterator ei; | |
| 938 basic_block pred_bb; | |
| 939 bitmap loe; | |
| 940 | |
| 111 | 941 gcc_checking_assert (!bitmap_bit_p (visited, bb->index)); |
| 942 bitmap_set_bit (visited, bb->index); | |
| 943 | |
| 0 | 944 loe = live_on_entry (live, bb); |
| 945 | |
| 946 FOR_EACH_EDGE (e, ei, bb->preds) | |
| 947 { | |
| 948 pred_bb = e->src; | |
| 111 | 949 if (pred_bb == ENTRY_BLOCK_PTR_FOR_FN (cfun)) |
| 0 | 950 continue; |
| 111 | 951 /* Variables live-on-entry from BB that aren't defined in the |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
952 predecessor block. This should be the live on entry vars to pred. |
| 0 | 953 Note that liveout is the DEFs in a block while live on entry is |
| 111 | 954 being calculated. |
| 955 Add these bits to live-on-entry for the pred. if there are any | |
| 0 | 956 changes, and pred_bb has been visited already, add it to the |
| 957 revisit stack. */ | |
| 111 | 958 change = bitmap_ior_and_compl_into (live_on_entry (live, pred_bb), |
| 959 loe, &live->liveout[pred_bb->index]); | |
| 960 if (change | |
| 961 && bitmap_bit_p (visited, pred_bb->index)) | |
| 0 | 962 { |
| 111 | 963 bitmap_clear_bit (visited, pred_bb->index); |
| 0 | 964 *(live->stack_top)++ = pred_bb->index; |
| 965 } | |
| 966 } | |
| 967 } | |
| 968 | |
| 969 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
970 /* Using LIVE, fill in all the live-on-entry blocks between the defs and uses |
| 0 | 971 of all the variables. */ |
| 972 | |
| 973 static void | |
| 974 live_worklist (tree_live_info_p live) | |
| 975 { | |
| 976 unsigned b; | |
| 977 basic_block bb; | |
| 111 | 978 auto_sbitmap visited (last_basic_block_for_fn (cfun) + 1); |
| 0 | 979 |
| 111 | 980 bitmap_clear (visited); |
| 0 | 981 |
| 982 /* Visit all the blocks in reverse order and propagate live on entry values | |
| 983 into the predecessors blocks. */ | |
| 111 | 984 FOR_EACH_BB_REVERSE_FN (bb, cfun) |
| 985 loe_visit_block (live, bb, visited); | |
| 0 | 986 |
| 987 /* Process any blocks which require further iteration. */ | |
| 988 while (live->stack_top != live->work_stack) | |
| 989 { | |
| 990 b = *--(live->stack_top); | |
| 111 | 991 loe_visit_block (live, BASIC_BLOCK_FOR_FN (cfun, b), visited); |
| 0 | 992 } |
| 993 } | |
| 994 | |
| 995 | |
| 996 /* Calculate the initial live on entry vector for SSA_NAME using immediate_use | |
| 997 links. Set the live on entry fields in LIVE. Def's are marked temporarily | |
| 998 in the liveout vector. */ | |
| 999 | |
| 1000 static void | |
| 1001 set_var_live_on_entry (tree ssa_name, tree_live_info_p live) | |
| 1002 { | |
| 1003 int p; | |
| 111 | 1004 gimple *stmt; |
| 0 | 1005 use_operand_p use; |
| 1006 basic_block def_bb = NULL; | |
| 1007 imm_use_iterator imm_iter; | |
| 1008 bool global = false; | |
| 1009 | |
| 1010 p = var_to_partition (live->map, ssa_name); | |
| 1011 if (p == NO_PARTITION) | |
| 1012 return; | |
| 1013 | |
| 1014 stmt = SSA_NAME_DEF_STMT (ssa_name); | |
| 1015 if (stmt) | |
| 1016 { | |
| 1017 def_bb = gimple_bb (stmt); | |
| 1018 /* Mark defs in liveout bitmap temporarily. */ | |
| 1019 if (def_bb) | |
| 111 | 1020 bitmap_set_bit (&live->liveout[def_bb->index], p); |
| 0 | 1021 } |
| 1022 else | |
| 111 | 1023 def_bb = ENTRY_BLOCK_PTR_FOR_FN (cfun); |
| 1024 | |
| 1025 /* An undefined local variable does not need to be very alive. */ | |
| 1026 if (ssa_undefined_value_p (ssa_name, false)) | |
| 1027 return; | |
| 0 | 1028 |
| 1029 /* Visit each use of SSA_NAME and if it isn't in the same block as the def, | |
| 1030 add it to the list of live on entry blocks. */ | |
| 1031 FOR_EACH_IMM_USE_FAST (use, imm_iter, ssa_name) | |
| 1032 { | |
| 111 | 1033 gimple *use_stmt = USE_STMT (use); |
| 0 | 1034 basic_block add_block = NULL; |
| 1035 | |
| 1036 if (gimple_code (use_stmt) == GIMPLE_PHI) | |
| 1037 { | |
| 1038 /* Uses in PHI's are considered to be live at exit of the SRC block | |
| 1039 as this is where a copy would be inserted. Check to see if it is | |
| 1040 defined in that block, or whether its live on entry. */ | |
| 1041 int index = PHI_ARG_INDEX_FROM_USE (use); | |
| 111 | 1042 edge e = gimple_phi_arg_edge (as_a <gphi *> (use_stmt), index); |
| 1043 if (e->src != ENTRY_BLOCK_PTR_FOR_FN (cfun)) | |
| 0 | 1044 { |
| 1045 if (e->src != def_bb) | |
| 1046 add_block = e->src; | |
| 1047 } | |
| 1048 } | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1049 else if (is_gimple_debug (use_stmt)) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1050 continue; |
| 0 | 1051 else |
| 1052 { | |
| 1053 /* If its not defined in this block, its live on entry. */ | |
| 1054 basic_block use_bb = gimple_bb (use_stmt); | |
| 1055 if (use_bb != def_bb) | |
| 1056 add_block = use_bb; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1057 } |
| 0 | 1058 |
| 1059 /* If there was a live on entry use, set the bit. */ | |
| 1060 if (add_block) | |
| 1061 { | |
| 1062 global = true; | |
| 111 | 1063 bitmap_set_bit (&live->livein[add_block->index], p); |
| 0 | 1064 } |
| 1065 } | |
| 1066 | |
| 1067 /* If SSA_NAME is live on entry to at least one block, fill in all the live | |
| 1068 on entry blocks between the def and all the uses. */ | |
| 1069 if (global) | |
| 1070 bitmap_set_bit (live->global, p); | |
| 1071 } | |
| 1072 | |
| 1073 | |
| 1074 /* Calculate the live on exit vectors based on the entry info in LIVEINFO. */ | |
| 1075 | |
| 111 | 1076 static void |
| 0 | 1077 calculate_live_on_exit (tree_live_info_p liveinfo) |
| 1078 { | |
| 1079 basic_block bb; | |
| 1080 edge e; | |
| 1081 edge_iterator ei; | |
| 1082 | |
| 1083 /* live on entry calculations used liveout vectors for defs, clear them. */ | |
| 111 | 1084 FOR_EACH_BB_FN (bb, cfun) |
| 1085 bitmap_clear (&liveinfo->liveout[bb->index]); | |
| 0 | 1086 |
| 1087 /* Set all the live-on-exit bits for uses in PHIs. */ | |
| 111 | 1088 FOR_EACH_BB_FN (bb, cfun) |
| 0 | 1089 { |
| 111 | 1090 gphi_iterator gsi; |
| 0 | 1091 size_t i; |
| 1092 | |
| 1093 /* Mark the PHI arguments which are live on exit to the pred block. */ | |
| 1094 for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
| 1095 { | |
| 111 | 1096 gphi *phi = gsi.phi (); |
| 0 | 1097 for (i = 0; i < gimple_phi_num_args (phi); i++) |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1098 { |
| 0 | 1099 tree t = PHI_ARG_DEF (phi, i); |
| 1100 int p; | |
| 1101 | |
| 1102 if (TREE_CODE (t) != SSA_NAME) | |
| 1103 continue; | |
| 1104 | |
| 1105 p = var_to_partition (liveinfo->map, t); | |
| 1106 if (p == NO_PARTITION) | |
| 1107 continue; | |
| 1108 e = gimple_phi_arg_edge (phi, i); | |
| 111 | 1109 if (e->src != ENTRY_BLOCK_PTR_FOR_FN (cfun)) |
| 1110 bitmap_set_bit (&liveinfo->liveout[e->src->index], p); | |
| 0 | 1111 } |
| 1112 } | |
| 1113 | |
| 1114 /* Add each successors live on entry to this bock live on exit. */ | |
| 1115 FOR_EACH_EDGE (e, ei, bb->succs) | |
| 111 | 1116 if (e->dest != EXIT_BLOCK_PTR_FOR_FN (cfun)) |
| 1117 bitmap_ior_into (&liveinfo->liveout[bb->index], | |
| 0 | 1118 live_on_entry (liveinfo, e->dest)); |
| 1119 } | |
| 1120 } | |
| 1121 | |
| 1122 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1123 /* Given partition map MAP, calculate all the live on entry bitmaps for |
| 0 | 1124 each partition. Return a new live info object. */ |
| 1125 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1126 tree_live_info_p |
| 111 | 1127 calculate_live_ranges (var_map map, bool want_livein) |
| 0 | 1128 { |
| 1129 tree var; | |
| 1130 unsigned i; | |
| 1131 tree_live_info_p live; | |
| 1132 | |
| 1133 live = new_tree_live_info (map); | |
| 1134 for (i = 0; i < num_var_partitions (map); i++) | |
| 1135 { | |
| 1136 var = partition_to_var (map, i); | |
| 1137 if (var != NULL_TREE) | |
| 1138 set_var_live_on_entry (var, live); | |
| 1139 } | |
| 1140 | |
| 1141 live_worklist (live); | |
| 1142 | |
| 111 | 1143 if (flag_checking) |
| 1144 verify_live_on_entry (live); | |
| 0 | 1145 |
| 1146 calculate_live_on_exit (live); | |
| 111 | 1147 |
| 1148 if (!want_livein) | |
| 1149 { | |
| 1150 bitmap_obstack_release (&live->livein_obstack); | |
| 1151 free (live->livein); | |
| 1152 live->livein = NULL; | |
| 1153 } | |
| 1154 | |
| 0 | 1155 return live; |
| 1156 } | |
| 1157 | |
| 1158 | |
| 1159 /* Output partition map MAP to file F. */ | |
| 1160 | |
| 1161 void | |
| 1162 dump_var_map (FILE *f, var_map map) | |
| 1163 { | |
| 1164 int t; | |
| 1165 unsigned x, y; | |
| 1166 int p; | |
| 1167 | |
| 1168 fprintf (f, "\nPartition map \n\n"); | |
| 1169 | |
| 1170 for (x = 0; x < map->num_partitions; x++) | |
| 1171 { | |
| 1172 if (map->view_to_partition != NULL) | |
| 1173 p = map->view_to_partition[x]; | |
| 1174 else | |
| 1175 p = x; | |
| 1176 | |
| 111 | 1177 if (ssa_name (p) == NULL_TREE |
| 1178 || virtual_operand_p (ssa_name (p))) | |
| 0 | 1179 continue; |
| 1180 | |
| 1181 t = 0; | |
| 1182 for (y = 1; y < num_ssa_names; y++) | |
| 1183 { | |
| 1184 p = partition_find (map->var_partition, y); | |
| 1185 if (map->partition_to_view) | |
| 1186 p = map->partition_to_view[p]; | |
| 1187 if (p == (int)x) | |
| 1188 { | |
| 1189 if (t++ == 0) | |
| 1190 { | |
| 111 | 1191 fprintf (f, "Partition %d (", x); |
| 0 | 1192 print_generic_expr (f, partition_to_var (map, p), TDF_SLIM); |
| 1193 fprintf (f, " - "); | |
| 1194 } | |
| 1195 fprintf (f, "%d ", y); | |
| 1196 } | |
| 1197 } | |
| 1198 if (t != 0) | |
| 1199 fprintf (f, ")\n"); | |
| 1200 } | |
| 1201 fprintf (f, "\n"); | |
| 1202 } | |
| 1203 | |
| 1204 | |
| 111 | 1205 /* Generic dump for the above. */ |
| 1206 | |
| 1207 DEBUG_FUNCTION void | |
| 1208 debug (_var_map &ref) | |
| 1209 { | |
| 1210 dump_var_map (stderr, &ref); | |
| 1211 } | |
| 1212 | |
| 1213 DEBUG_FUNCTION void | |
| 1214 debug (_var_map *ptr) | |
| 1215 { | |
| 1216 if (ptr) | |
| 1217 debug (*ptr); | |
| 1218 else | |
| 1219 fprintf (stderr, "<nil>\n"); | |
| 1220 } | |
| 1221 | |
| 1222 | |
| 0 | 1223 /* Output live range info LIVE to file F, controlled by FLAG. */ |
| 1224 | |
| 1225 void | |
| 1226 dump_live_info (FILE *f, tree_live_info_p live, int flag) | |
| 1227 { | |
| 1228 basic_block bb; | |
| 1229 unsigned i; | |
| 1230 var_map map = live->map; | |
| 1231 bitmap_iterator bi; | |
| 1232 | |
| 1233 if ((flag & LIVEDUMP_ENTRY) && live->livein) | |
| 1234 { | |
| 111 | 1235 FOR_EACH_BB_FN (bb, cfun) |
| 0 | 1236 { |
| 1237 fprintf (f, "\nLive on entry to BB%d : ", bb->index); | |
| 111 | 1238 EXECUTE_IF_SET_IN_BITMAP (&live->livein[bb->index], 0, i, bi) |
| 0 | 1239 { |
| 1240 print_generic_expr (f, partition_to_var (map, i), TDF_SLIM); | |
| 1241 fprintf (f, " "); | |
| 1242 } | |
| 1243 fprintf (f, "\n"); | |
| 1244 } | |
| 1245 } | |
| 1246 | |
| 1247 if ((flag & LIVEDUMP_EXIT) && live->liveout) | |
| 1248 { | |
| 111 | 1249 FOR_EACH_BB_FN (bb, cfun) |
| 0 | 1250 { |
| 1251 fprintf (f, "\nLive on exit from BB%d : ", bb->index); | |
| 111 | 1252 EXECUTE_IF_SET_IN_BITMAP (&live->liveout[bb->index], 0, i, bi) |
| 0 | 1253 { |
| 1254 print_generic_expr (f, partition_to_var (map, i), TDF_SLIM); | |
| 1255 fprintf (f, " "); | |
| 1256 } | |
| 1257 fprintf (f, "\n"); | |
| 1258 } | |
| 1259 } | |
| 1260 } | |
| 1261 | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1262 |
| 111 | 1263 /* Generic dump for the above. */ |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1264 |
| 111 | 1265 DEBUG_FUNCTION void |
| 1266 debug (tree_live_info_d &ref) | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1267 { |
| 111 | 1268 dump_live_info (stderr, &ref, 0); |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1269 } |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1270 |
| 111 | 1271 DEBUG_FUNCTION void |
| 1272 debug (tree_live_info_d *ptr) | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1273 { |
| 111 | 1274 if (ptr) |
| 1275 debug (*ptr); | |
| 1276 else | |
| 1277 fprintf (stderr, "<nil>\n"); | |
| 0 | 1278 } |
| 1279 | |
| 1280 | |
| 1281 /* Verify that the info in LIVE matches the current cfg. */ | |
| 1282 | |
| 1283 static void | |
| 1284 verify_live_on_entry (tree_live_info_p live) | |
| 1285 { | |
| 1286 unsigned i; | |
| 1287 tree var; | |
| 111 | 1288 gimple *stmt; |
| 0 | 1289 basic_block bb; |
| 1290 edge e; | |
| 1291 int num; | |
| 1292 edge_iterator ei; | |
| 1293 var_map map = live->map; | |
| 1294 | |
| 1295 /* Check for live on entry partitions and report those with a DEF in | |
| 1296 the program. This will typically mean an optimization has done | |
| 1297 something wrong. */ | |
| 111 | 1298 bb = ENTRY_BLOCK_PTR_FOR_FN (cfun); |
| 0 | 1299 num = 0; |
| 1300 FOR_EACH_EDGE (e, ei, bb->succs) | |
| 1301 { | |
| 1302 int entry_block = e->dest->index; | |
| 111 | 1303 if (e->dest == EXIT_BLOCK_PTR_FOR_FN (cfun)) |
| 0 | 1304 continue; |
| 1305 for (i = 0; i < (unsigned)num_var_partitions (map); i++) | |
| 1306 { | |
| 1307 basic_block tmp; | |
| 111 | 1308 tree d = NULL_TREE; |
| 0 | 1309 bitmap loe; |
| 1310 var = partition_to_var (map, i); | |
| 1311 stmt = SSA_NAME_DEF_STMT (var); | |
| 1312 tmp = gimple_bb (stmt); | |
| 111 | 1313 if (SSA_NAME_VAR (var)) |
| 1314 d = ssa_default_def (cfun, SSA_NAME_VAR (var)); | |
| 0 | 1315 |
| 1316 loe = live_on_entry (live, e->dest); | |
| 1317 if (loe && bitmap_bit_p (loe, i)) | |
| 1318 { | |
| 1319 if (!gimple_nop_p (stmt)) | |
| 1320 { | |
| 1321 num++; | |
| 1322 print_generic_expr (stderr, var, TDF_SLIM); | |
| 1323 fprintf (stderr, " is defined "); | |
| 1324 if (tmp) | |
| 1325 fprintf (stderr, " in BB%d, ", tmp->index); | |
| 1326 fprintf (stderr, "by:\n"); | |
| 1327 print_gimple_stmt (stderr, stmt, 0, TDF_SLIM); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1328 fprintf (stderr, "\nIt is also live-on-entry to entry BB %d", |
| 0 | 1329 entry_block); |
| 1330 fprintf (stderr, " So it appears to have multiple defs.\n"); | |
| 1331 } | |
| 1332 else | |
| 1333 { | |
| 1334 if (d != var) | |
| 1335 { | |
| 1336 num++; | |
| 1337 print_generic_expr (stderr, var, TDF_SLIM); | |
| 1338 fprintf (stderr, " is live-on-entry to BB%d ", | |
| 1339 entry_block); | |
| 1340 if (d) | |
| 1341 { | |
| 1342 fprintf (stderr, " but is not the default def of "); | |
| 1343 print_generic_expr (stderr, d, TDF_SLIM); | |
| 1344 fprintf (stderr, "\n"); | |
| 1345 } | |
| 1346 else | |
| 1347 fprintf (stderr, " and there is no default def.\n"); | |
| 1348 } | |
| 1349 } | |
| 1350 } | |
| 1351 else | |
| 1352 if (d == var) | |
| 1353 { | |
| 111 | 1354 /* An undefined local variable does not need to be very |
| 1355 alive. */ | |
| 1356 if (ssa_undefined_value_p (var, false)) | |
| 1357 continue; | |
| 1358 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1359 /* The only way this var shouldn't be marked live on entry is |
| 0 | 1360 if it occurs in a PHI argument of the block. */ |
| 1361 size_t z; | |
| 1362 bool ok = false; | |
| 111 | 1363 gphi_iterator gsi; |
| 0 | 1364 for (gsi = gsi_start_phis (e->dest); |
| 1365 !gsi_end_p (gsi) && !ok; | |
| 1366 gsi_next (&gsi)) | |
| 1367 { | |
| 111 | 1368 gphi *phi = gsi.phi (); |
| 0 | 1369 for (z = 0; z < gimple_phi_num_args (phi); z++) |
| 1370 if (var == gimple_phi_arg_def (phi, z)) | |
| 1371 { | |
| 1372 ok = true; | |
| 1373 break; | |
| 1374 } | |
| 1375 } | |
| 1376 if (ok) | |
| 1377 continue; | |
| 111 | 1378 /* Expand adds unused default defs for PARM_DECLs and |
| 1379 RESULT_DECLs. They're ok. */ | |
| 1380 if (has_zero_uses (var) | |
| 1381 && SSA_NAME_VAR (var) | |
| 1382 && !VAR_P (SSA_NAME_VAR (var))) | |
| 1383 continue; | |
| 0 | 1384 num++; |
| 1385 print_generic_expr (stderr, var, TDF_SLIM); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1386 fprintf (stderr, " is not marked live-on-entry to entry BB%d ", |
| 0 | 1387 entry_block); |
| 1388 fprintf (stderr, "but it is a default def so it should be.\n"); | |
| 1389 } | |
| 1390 } | |
| 1391 } | |
| 1392 gcc_assert (num <= 0); | |
| 1393 } |