Mercurial > hg > CbC > CbC_gcc
annotate gcc/tree-ssa-loop-im.c @ 63:b7f97abdc517 gcc-4.6-20100522
update gcc from gcc-4.5.0 to gcc-4.6
| author | ryoma <e075725@ie.u-ryukyu.ac.jp> |
|---|---|
| date | Mon, 24 May 2010 12:47:05 +0900 |
| parents | 77e2b8dfacca |
| children | f6334be47118 |
| rev | line source |
|---|---|
| 0 | 1 /* Loop invariant motion. |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2 Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2010 |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
3 Free Software Foundation, Inc. |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
4 |
| 0 | 5 This file is part of GCC. |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
6 |
| 0 | 7 GCC is free software; you can redistribute it and/or modify it |
| 8 under the terms of the GNU General Public License as published by the | |
| 9 Free Software Foundation; either version 3, or (at your option) any | |
| 10 later version. | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
11 |
| 0 | 12 GCC is distributed in the hope that it will be useful, but WITHOUT |
| 13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
| 15 for more details. | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
16 |
| 0 | 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" | |
| 24 #include "tm.h" | |
| 25 #include "tree.h" | |
| 26 #include "tm_p.h" | |
| 27 #include "basic-block.h" | |
| 28 #include "output.h" | |
| 29 #include "diagnostic.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
|
30 #include "gimple-pretty-print.h" |
|
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 "tree-pretty-print.h" |
| 0 | 32 #include "tree-flow.h" |
| 33 #include "tree-dump.h" | |
| 34 #include "timevar.h" | |
| 35 #include "cfgloop.h" | |
| 36 #include "domwalk.h" | |
| 37 #include "params.h" | |
| 38 #include "tree-pass.h" | |
| 39 #include "flags.h" | |
| 40 #include "hashtab.h" | |
| 41 #include "tree-affine.h" | |
| 42 #include "pointer-set.h" | |
| 43 #include "tree-ssa-propagate.h" | |
| 44 | |
| 45 /* TODO: Support for predicated code motion. I.e. | |
| 46 | |
| 47 while (1) | |
| 48 { | |
| 49 if (cond) | |
| 50 { | |
| 51 a = inv; | |
| 52 something; | |
| 53 } | |
| 54 } | |
| 55 | |
| 56 Where COND and INV are is invariants, but evaluating INV may trap or be | |
| 57 invalid from some other reason if !COND. This may be transformed to | |
| 58 | |
| 59 if (cond) | |
| 60 a = inv; | |
| 61 while (1) | |
| 62 { | |
| 63 if (cond) | |
| 64 something; | |
| 65 } */ | |
| 66 | |
| 67 /* A type for the list of statements that have to be moved in order to be able | |
| 68 to hoist an invariant computation. */ | |
| 69 | |
| 70 struct depend | |
| 71 { | |
| 72 gimple stmt; | |
| 73 struct depend *next; | |
| 74 }; | |
| 75 | |
| 76 /* The auxiliary data kept for each statement. */ | |
| 77 | |
| 78 struct lim_aux_data | |
| 79 { | |
| 80 struct loop *max_loop; /* The outermost loop in that the statement | |
| 81 is invariant. */ | |
| 82 | |
| 83 struct loop *tgt_loop; /* The loop out of that we want to move the | |
| 84 invariant. */ | |
| 85 | |
| 86 struct loop *always_executed_in; | |
| 87 /* The outermost loop for that we are sure | |
| 88 the statement is executed if the loop | |
| 89 is entered. */ | |
| 90 | |
| 91 unsigned cost; /* Cost of the computation performed by the | |
| 92 statement. */ | |
| 93 | |
| 94 struct depend *depends; /* List of statements that must be also hoisted | |
| 95 out of the loop when this statement is | |
| 96 hoisted; i.e. those that define the operands | |
| 97 of the statement and are inside of the | |
| 98 MAX_LOOP loop. */ | |
| 99 }; | |
| 100 | |
| 101 /* Maps statements to their lim_aux_data. */ | |
| 102 | |
| 103 static struct pointer_map_t *lim_aux_data_map; | |
| 104 | |
| 105 /* Description of a memory reference location. */ | |
| 106 | |
| 107 typedef struct mem_ref_loc | |
| 108 { | |
| 109 tree *ref; /* The reference itself. */ | |
| 110 gimple stmt; /* The statement in that it occurs. */ | |
| 111 } *mem_ref_loc_p; | |
| 112 | |
| 113 DEF_VEC_P(mem_ref_loc_p); | |
| 114 DEF_VEC_ALLOC_P(mem_ref_loc_p, heap); | |
| 115 | |
| 116 /* The list of memory reference locations in a loop. */ | |
| 117 | |
| 118 typedef struct mem_ref_locs | |
| 119 { | |
| 120 VEC (mem_ref_loc_p, heap) *locs; | |
| 121 } *mem_ref_locs_p; | |
| 122 | |
| 123 DEF_VEC_P(mem_ref_locs_p); | |
| 124 DEF_VEC_ALLOC_P(mem_ref_locs_p, heap); | |
| 125 | |
| 126 /* Description of a memory reference. */ | |
| 127 | |
| 128 typedef struct mem_ref | |
| 129 { | |
| 130 tree mem; /* The memory itself. */ | |
| 131 unsigned id; /* ID assigned to the memory reference | |
| 132 (its index in memory_accesses.refs_list) */ | |
| 133 hashval_t hash; /* Its hash value. */ | |
| 134 bitmap stored; /* The set of loops in that this memory location | |
| 135 is stored to. */ | |
| 136 VEC (mem_ref_locs_p, heap) *accesses_in_loop; | |
| 137 /* The locations of the accesses. Vector | |
| 138 indexed by the loop number. */ | |
| 139 bitmap vops; /* Vops corresponding to this memory | |
| 140 location. */ | |
| 141 | |
| 142 /* The following sets are computed on demand. We keep both set and | |
| 143 its complement, so that we know whether the information was | |
| 144 already computed or not. */ | |
| 145 bitmap indep_loop; /* The set of loops in that the memory | |
| 146 reference is independent, meaning: | |
| 147 If it is stored in the loop, this store | |
| 148 is independent on all other loads and | |
| 149 stores. | |
| 150 If it is only loaded, then it is independent | |
| 151 on all stores in the loop. */ | |
| 152 bitmap dep_loop; /* The complement of INDEP_LOOP. */ | |
| 153 | |
| 154 bitmap indep_ref; /* The set of memory references on that | |
| 155 this reference is independent. */ | |
| 156 bitmap dep_ref; /* The complement of DEP_REF. */ | |
| 157 } *mem_ref_p; | |
| 158 | |
| 159 DEF_VEC_P(mem_ref_p); | |
| 160 DEF_VEC_ALLOC_P(mem_ref_p, heap); | |
| 161 | |
| 162 DEF_VEC_P(bitmap); | |
| 163 DEF_VEC_ALLOC_P(bitmap, heap); | |
| 164 | |
| 165 DEF_VEC_P(htab_t); | |
| 166 DEF_VEC_ALLOC_P(htab_t, heap); | |
| 167 | |
| 168 /* Description of memory accesses in loops. */ | |
| 169 | |
| 170 static struct | |
| 171 { | |
| 172 /* The hash table of memory references accessed in loops. */ | |
| 173 htab_t refs; | |
| 174 | |
| 175 /* The list of memory references. */ | |
| 176 VEC (mem_ref_p, heap) *refs_list; | |
| 177 | |
| 178 /* The set of memory references accessed in each loop. */ | |
| 179 VEC (bitmap, heap) *refs_in_loop; | |
| 180 | |
| 181 /* The set of memory references accessed in each loop, including | |
| 182 subloops. */ | |
| 183 VEC (bitmap, heap) *all_refs_in_loop; | |
| 184 | |
| 185 /* The set of virtual operands clobbered in a given loop. */ | |
| 186 VEC (bitmap, heap) *clobbered_vops; | |
| 187 | |
| 188 /* Map from the pair (loop, virtual operand) to the set of refs that | |
| 189 touch the virtual operand in the loop. */ | |
| 190 VEC (htab_t, heap) *vop_ref_map; | |
| 191 | |
| 192 /* Cache for expanding memory addresses. */ | |
| 193 struct pointer_map_t *ttae_cache; | |
| 194 } memory_accesses; | |
| 195 | |
| 196 static bool ref_indep_loop_p (struct loop *, mem_ref_p); | |
| 197 | |
| 198 /* Minimum cost of an expensive expression. */ | |
| 199 #define LIM_EXPENSIVE ((unsigned) PARAM_VALUE (PARAM_LIM_EXPENSIVE)) | |
| 200 | |
| 201 /* The outermost loop for that execution of the header guarantees that the | |
| 202 block will be executed. */ | |
| 203 #define ALWAYS_EXECUTED_IN(BB) ((struct loop *) (BB)->aux) | |
| 204 | |
| 205 static struct lim_aux_data * | |
| 206 init_lim_data (gimple stmt) | |
| 207 { | |
| 208 void **p = pointer_map_insert (lim_aux_data_map, stmt); | |
| 209 | |
| 210 *p = XCNEW (struct lim_aux_data); | |
| 211 return (struct lim_aux_data *) *p; | |
| 212 } | |
| 213 | |
| 214 static struct lim_aux_data * | |
| 215 get_lim_data (gimple stmt) | |
| 216 { | |
| 217 void **p = pointer_map_contains (lim_aux_data_map, stmt); | |
| 218 if (!p) | |
| 219 return NULL; | |
| 220 | |
| 221 return (struct lim_aux_data *) *p; | |
| 222 } | |
| 223 | |
| 224 /* Releases the memory occupied by DATA. */ | |
| 225 | |
| 226 static void | |
| 227 free_lim_aux_data (struct lim_aux_data *data) | |
| 228 { | |
| 229 struct depend *dep, *next; | |
| 230 | |
| 231 for (dep = data->depends; dep; dep = next) | |
| 232 { | |
| 233 next = dep->next; | |
| 234 free (dep); | |
| 235 } | |
| 236 free (data); | |
| 237 } | |
| 238 | |
| 239 static void | |
| 240 clear_lim_data (gimple stmt) | |
| 241 { | |
| 242 void **p = pointer_map_contains (lim_aux_data_map, stmt); | |
| 243 if (!p) | |
| 244 return; | |
| 245 | |
| 246 free_lim_aux_data ((struct lim_aux_data *) *p); | |
| 247 *p = NULL; | |
| 248 } | |
| 249 | |
| 250 /* Calls CBCK for each index in memory reference ADDR_P. There are two | |
| 251 kinds situations handled; in each of these cases, the memory reference | |
| 252 and DATA are passed to the callback: | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
253 |
| 0 | 254 Access to an array: ARRAY_{RANGE_}REF (base, index). In this case we also |
| 255 pass the pointer to the index to the callback. | |
| 256 | |
| 257 Pointer dereference: INDIRECT_REF (addr). In this case we also pass the | |
| 258 pointer to addr to the callback. | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
259 |
| 0 | 260 If the callback returns false, the whole search stops and false is returned. |
| 261 Otherwise the function returns true after traversing through the whole | |
| 262 reference *ADDR_P. */ | |
| 263 | |
| 264 bool | |
| 265 for_each_index (tree *addr_p, bool (*cbck) (tree, tree *, void *), void *data) | |
| 266 { | |
| 267 tree *nxt, *idx; | |
| 268 | |
| 269 for (; ; addr_p = nxt) | |
| 270 { | |
| 271 switch (TREE_CODE (*addr_p)) | |
| 272 { | |
| 273 case SSA_NAME: | |
| 274 return cbck (*addr_p, addr_p, data); | |
| 275 | |
| 276 case MISALIGNED_INDIRECT_REF: | |
| 277 case ALIGN_INDIRECT_REF: | |
| 278 case INDIRECT_REF: | |
| 279 nxt = &TREE_OPERAND (*addr_p, 0); | |
| 280 return cbck (*addr_p, nxt, data); | |
| 281 | |
| 282 case BIT_FIELD_REF: | |
| 283 case VIEW_CONVERT_EXPR: | |
| 284 case REALPART_EXPR: | |
| 285 case IMAGPART_EXPR: | |
| 286 nxt = &TREE_OPERAND (*addr_p, 0); | |
| 287 break; | |
| 288 | |
| 289 case COMPONENT_REF: | |
| 290 /* If the component has varying offset, it behaves like index | |
| 291 as well. */ | |
| 292 idx = &TREE_OPERAND (*addr_p, 2); | |
| 293 if (*idx | |
| 294 && !cbck (*addr_p, idx, data)) | |
| 295 return false; | |
| 296 | |
| 297 nxt = &TREE_OPERAND (*addr_p, 0); | |
| 298 break; | |
| 299 | |
| 300 case ARRAY_REF: | |
| 301 case ARRAY_RANGE_REF: | |
| 302 nxt = &TREE_OPERAND (*addr_p, 0); | |
| 303 if (!cbck (*addr_p, &TREE_OPERAND (*addr_p, 1), data)) | |
| 304 return false; | |
| 305 break; | |
| 306 | |
| 307 case VAR_DECL: | |
| 308 case PARM_DECL: | |
| 309 case STRING_CST: | |
| 310 case RESULT_DECL: | |
| 311 case VECTOR_CST: | |
| 312 case COMPLEX_CST: | |
| 313 case INTEGER_CST: | |
| 314 case REAL_CST: | |
| 315 case FIXED_CST: | |
| 316 case CONSTRUCTOR: | |
| 317 return true; | |
| 318 | |
| 319 case ADDR_EXPR: | |
| 320 gcc_assert (is_gimple_min_invariant (*addr_p)); | |
| 321 return true; | |
| 322 | |
| 323 case TARGET_MEM_REF: | |
| 324 idx = &TMR_BASE (*addr_p); | |
| 325 if (*idx | |
| 326 && !cbck (*addr_p, idx, data)) | |
| 327 return false; | |
| 328 idx = &TMR_INDEX (*addr_p); | |
| 329 if (*idx | |
| 330 && !cbck (*addr_p, idx, data)) | |
| 331 return false; | |
| 332 return true; | |
| 333 | |
| 334 default: | |
| 335 gcc_unreachable (); | |
| 336 } | |
| 337 } | |
| 338 } | |
| 339 | |
| 340 /* If it is possible to hoist the statement STMT unconditionally, | |
| 341 returns MOVE_POSSIBLE. | |
| 342 If it is possible to hoist the statement STMT, but we must avoid making | |
| 343 it executed if it would not be executed in the original program (e.g. | |
| 344 because it may trap), return MOVE_PRESERVE_EXECUTION. | |
| 345 Otherwise return MOVE_IMPOSSIBLE. */ | |
| 346 | |
| 347 enum move_pos | |
| 348 movement_possibility (gimple stmt) | |
| 349 { | |
| 350 tree lhs; | |
| 351 enum move_pos ret = MOVE_POSSIBLE; | |
| 352 | |
| 353 if (flag_unswitch_loops | |
| 354 && gimple_code (stmt) == GIMPLE_COND) | |
| 355 { | |
| 356 /* If we perform unswitching, force the operands of the invariant | |
| 357 condition to be moved out of the loop. */ | |
| 358 return MOVE_POSSIBLE; | |
| 359 } | |
| 360 | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
361 if (gimple_code (stmt) == GIMPLE_PHI |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
362 && gimple_phi_num_args (stmt) <= 2 |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
363 && is_gimple_reg (gimple_phi_result (stmt)) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
364 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (gimple_phi_result (stmt))) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
365 return MOVE_POSSIBLE; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
366 |
| 0 | 367 if (gimple_get_lhs (stmt) == NULL_TREE) |
| 368 return MOVE_IMPOSSIBLE; | |
| 369 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
370 if (gimple_vdef (stmt)) |
| 0 | 371 return MOVE_IMPOSSIBLE; |
| 372 | |
| 373 if (stmt_ends_bb_p (stmt) | |
| 374 || gimple_has_volatile_ops (stmt) | |
| 375 || gimple_has_side_effects (stmt) | |
| 376 || stmt_could_throw_p (stmt)) | |
| 377 return MOVE_IMPOSSIBLE; | |
| 378 | |
| 379 if (is_gimple_call (stmt)) | |
| 380 { | |
| 381 /* While pure or const call is guaranteed to have no side effects, we | |
| 382 cannot move it arbitrarily. Consider code like | |
| 383 | |
| 384 char *s = something (); | |
| 385 | |
| 386 while (1) | |
| 387 { | |
| 388 if (s) | |
| 389 t = strlen (s); | |
| 390 else | |
| 391 t = 0; | |
| 392 } | |
| 393 | |
| 394 Here the strlen call cannot be moved out of the loop, even though | |
| 395 s is invariant. In addition to possibly creating a call with | |
| 396 invalid arguments, moving out a function call that is not executed | |
| 397 may cause performance regressions in case the call is costly and | |
| 398 not executed at all. */ | |
| 399 ret = MOVE_PRESERVE_EXECUTION; | |
| 400 lhs = gimple_call_lhs (stmt); | |
| 401 } | |
| 402 else if (is_gimple_assign (stmt)) | |
| 403 lhs = gimple_assign_lhs (stmt); | |
| 404 else | |
| 405 return MOVE_IMPOSSIBLE; | |
| 406 | |
| 407 if (TREE_CODE (lhs) == SSA_NAME | |
| 408 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (lhs)) | |
| 409 return MOVE_IMPOSSIBLE; | |
| 410 | |
| 411 if (TREE_CODE (lhs) != SSA_NAME | |
| 412 || gimple_could_trap_p (stmt)) | |
| 413 return MOVE_PRESERVE_EXECUTION; | |
| 414 | |
| 415 return ret; | |
| 416 } | |
| 417 | |
| 418 /* Suppose that operand DEF is used inside the LOOP. Returns the outermost | |
| 419 loop to that we could move the expression using DEF if it did not have | |
| 420 other operands, i.e. the outermost loop enclosing LOOP in that the value | |
| 421 of DEF is invariant. */ | |
| 422 | |
| 423 static struct loop * | |
| 424 outermost_invariant_loop (tree def, struct loop *loop) | |
| 425 { | |
| 426 gimple def_stmt; | |
| 427 basic_block def_bb; | |
| 428 struct loop *max_loop; | |
| 429 struct lim_aux_data *lim_data; | |
| 430 | |
| 431 if (!def) | |
| 432 return superloop_at_depth (loop, 1); | |
| 433 | |
| 434 if (TREE_CODE (def) != SSA_NAME) | |
| 435 { | |
| 436 gcc_assert (is_gimple_min_invariant (def)); | |
| 437 return superloop_at_depth (loop, 1); | |
| 438 } | |
| 439 | |
| 440 def_stmt = SSA_NAME_DEF_STMT (def); | |
| 441 def_bb = gimple_bb (def_stmt); | |
| 442 if (!def_bb) | |
| 443 return superloop_at_depth (loop, 1); | |
| 444 | |
| 445 max_loop = find_common_loop (loop, def_bb->loop_father); | |
| 446 | |
| 447 lim_data = get_lim_data (def_stmt); | |
| 448 if (lim_data != NULL && lim_data->max_loop != NULL) | |
| 449 max_loop = find_common_loop (max_loop, | |
| 450 loop_outer (lim_data->max_loop)); | |
| 451 if (max_loop == loop) | |
| 452 return NULL; | |
| 453 max_loop = superloop_at_depth (loop, loop_depth (max_loop) + 1); | |
| 454 | |
| 455 return max_loop; | |
| 456 } | |
| 457 | |
| 458 /* DATA is a structure containing information associated with a statement | |
| 459 inside LOOP. DEF is one of the operands of this statement. | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
460 |
| 0 | 461 Find the outermost loop enclosing LOOP in that value of DEF is invariant |
| 462 and record this in DATA->max_loop field. If DEF itself is defined inside | |
| 463 this loop as well (i.e. we need to hoist it out of the loop if we want | |
| 464 to hoist the statement represented by DATA), record the statement in that | |
| 465 DEF is defined to the DATA->depends list. Additionally if ADD_COST is true, | |
| 466 add the cost of the computation of DEF to the DATA->cost. | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
467 |
| 0 | 468 If DEF is not invariant in LOOP, return false. Otherwise return TRUE. */ |
| 469 | |
| 470 static bool | |
| 471 add_dependency (tree def, struct lim_aux_data *data, struct loop *loop, | |
| 472 bool add_cost) | |
| 473 { | |
| 474 gimple def_stmt = SSA_NAME_DEF_STMT (def); | |
| 475 basic_block def_bb = gimple_bb (def_stmt); | |
| 476 struct loop *max_loop; | |
| 477 struct depend *dep; | |
| 478 struct lim_aux_data *def_data; | |
| 479 | |
| 480 if (!def_bb) | |
| 481 return true; | |
| 482 | |
| 483 max_loop = outermost_invariant_loop (def, loop); | |
| 484 if (!max_loop) | |
| 485 return false; | |
| 486 | |
| 487 if (flow_loop_nested_p (data->max_loop, max_loop)) | |
| 488 data->max_loop = max_loop; | |
| 489 | |
| 490 def_data = get_lim_data (def_stmt); | |
| 491 if (!def_data) | |
| 492 return true; | |
| 493 | |
| 494 if (add_cost | |
| 495 /* Only add the cost if the statement defining DEF is inside LOOP, | |
| 496 i.e. if it is likely that by moving the invariants dependent | |
| 497 on it, we will be able to avoid creating a new register for | |
| 498 it (since it will be only used in these dependent invariants). */ | |
| 499 && def_bb->loop_father == loop) | |
| 500 data->cost += def_data->cost; | |
| 501 | |
| 502 dep = XNEW (struct depend); | |
| 503 dep->stmt = def_stmt; | |
| 504 dep->next = data->depends; | |
| 505 data->depends = dep; | |
| 506 | |
| 507 return true; | |
| 508 } | |
| 509 | |
| 510 /* Returns an estimate for a cost of statement STMT. TODO -- the values here | |
| 511 are just ad-hoc constants. The estimates should be based on target-specific | |
| 512 values. */ | |
| 513 | |
| 514 static unsigned | |
| 515 stmt_cost (gimple stmt) | |
| 516 { | |
| 517 tree fndecl; | |
| 518 unsigned cost = 1; | |
| 519 | |
| 520 /* Always try to create possibilities for unswitching. */ | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
521 if (gimple_code (stmt) == GIMPLE_COND |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
522 || gimple_code (stmt) == GIMPLE_PHI) |
| 0 | 523 return LIM_EXPENSIVE; |
| 524 | |
| 525 /* Hoisting memory references out should almost surely be a win. */ | |
| 526 if (gimple_references_memory_p (stmt)) | |
| 527 cost += 20; | |
| 528 | |
| 529 if (is_gimple_call (stmt)) | |
| 530 { | |
| 531 /* We should be hoisting calls if possible. */ | |
| 532 | |
| 533 /* Unless the call is a builtin_constant_p; this always folds to a | |
| 534 constant, so moving it is useless. */ | |
| 535 fndecl = gimple_call_fndecl (stmt); | |
| 536 if (fndecl | |
| 537 && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL | |
| 538 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CONSTANT_P) | |
| 539 return 0; | |
| 540 | |
| 541 return cost + 20; | |
| 542 } | |
| 543 | |
| 544 if (gimple_code (stmt) != GIMPLE_ASSIGN) | |
| 545 return cost; | |
| 546 | |
| 547 switch (gimple_assign_rhs_code (stmt)) | |
| 548 { | |
| 549 case MULT_EXPR: | |
| 550 case TRUNC_DIV_EXPR: | |
| 551 case CEIL_DIV_EXPR: | |
| 552 case FLOOR_DIV_EXPR: | |
| 553 case ROUND_DIV_EXPR: | |
| 554 case EXACT_DIV_EXPR: | |
| 555 case CEIL_MOD_EXPR: | |
| 556 case FLOOR_MOD_EXPR: | |
| 557 case ROUND_MOD_EXPR: | |
| 558 case TRUNC_MOD_EXPR: | |
| 559 case RDIV_EXPR: | |
| 560 /* Division and multiplication are usually expensive. */ | |
| 561 cost += 20; | |
| 562 break; | |
| 563 | |
| 564 case LSHIFT_EXPR: | |
| 565 case RSHIFT_EXPR: | |
| 566 cost += 20; | |
| 567 break; | |
| 568 | |
| 569 default: | |
| 570 break; | |
| 571 } | |
| 572 | |
| 573 return cost; | |
| 574 } | |
| 575 | |
| 576 /* Finds the outermost loop between OUTER and LOOP in that the memory reference | |
| 577 REF is independent. If REF is not independent in LOOP, NULL is returned | |
| 578 instead. */ | |
| 579 | |
| 580 static struct loop * | |
| 581 outermost_indep_loop (struct loop *outer, struct loop *loop, mem_ref_p ref) | |
| 582 { | |
| 583 struct loop *aloop; | |
| 584 | |
| 585 if (bitmap_bit_p (ref->stored, loop->num)) | |
| 586 return NULL; | |
| 587 | |
| 588 for (aloop = outer; | |
| 589 aloop != loop; | |
| 590 aloop = superloop_at_depth (loop, loop_depth (aloop) + 1)) | |
| 591 if (!bitmap_bit_p (ref->stored, aloop->num) | |
| 592 && ref_indep_loop_p (aloop, ref)) | |
| 593 return aloop; | |
| 594 | |
| 595 if (ref_indep_loop_p (loop, ref)) | |
| 596 return loop; | |
| 597 else | |
| 598 return NULL; | |
| 599 } | |
| 600 | |
| 601 /* If there is a simple load or store to a memory reference in STMT, returns | |
| 602 the location of the memory reference, and sets IS_STORE according to whether | |
| 603 it is a store or load. Otherwise, returns NULL. */ | |
| 604 | |
| 605 static tree * | |
| 606 simple_mem_ref_in_stmt (gimple stmt, bool *is_store) | |
| 607 { | |
| 608 tree *lhs; | |
| 609 enum tree_code code; | |
| 610 | |
| 611 /* Recognize MEM = (SSA_NAME | invariant) and SSA_NAME = MEM patterns. */ | |
| 612 if (gimple_code (stmt) != GIMPLE_ASSIGN) | |
| 613 return NULL; | |
| 614 | |
| 615 code = gimple_assign_rhs_code (stmt); | |
| 616 | |
| 617 lhs = gimple_assign_lhs_ptr (stmt); | |
| 618 | |
| 619 if (TREE_CODE (*lhs) == SSA_NAME) | |
| 620 { | |
| 621 if (get_gimple_rhs_class (code) != GIMPLE_SINGLE_RHS | |
| 622 || !is_gimple_addressable (gimple_assign_rhs1 (stmt))) | |
| 623 return NULL; | |
| 624 | |
| 625 *is_store = false; | |
| 626 return gimple_assign_rhs1_ptr (stmt); | |
| 627 } | |
| 628 else if (code == SSA_NAME | |
| 629 || (get_gimple_rhs_class (code) == GIMPLE_SINGLE_RHS | |
| 630 && is_gimple_min_invariant (gimple_assign_rhs1 (stmt)))) | |
| 631 { | |
| 632 *is_store = true; | |
| 633 return lhs; | |
| 634 } | |
| 635 else | |
| 636 return NULL; | |
| 637 } | |
| 638 | |
| 639 /* Returns the memory reference contained in STMT. */ | |
| 640 | |
| 641 static mem_ref_p | |
| 642 mem_ref_in_stmt (gimple stmt) | |
| 643 { | |
| 644 bool store; | |
| 645 tree *mem = simple_mem_ref_in_stmt (stmt, &store); | |
| 646 hashval_t hash; | |
| 647 mem_ref_p ref; | |
| 648 | |
| 649 if (!mem) | |
| 650 return NULL; | |
| 651 gcc_assert (!store); | |
| 652 | |
| 653 hash = iterative_hash_expr (*mem, 0); | |
| 654 ref = (mem_ref_p) htab_find_with_hash (memory_accesses.refs, *mem, hash); | |
| 655 | |
| 656 gcc_assert (ref != NULL); | |
| 657 return ref; | |
| 658 } | |
| 659 | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
660 /* From a controlling predicate in DOM determine the arguments from |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
661 the PHI node PHI that are chosen if the predicate evaluates to |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
662 true and false and store them to *TRUE_ARG_P and *FALSE_ARG_P if |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
663 they are non-NULL. Returns true if the arguments can be determined, |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
664 else return false. */ |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
665 |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
666 static bool |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
667 extract_true_false_args_from_phi (basic_block dom, gimple phi, |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
668 tree *true_arg_p, tree *false_arg_p) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
669 { |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
670 basic_block bb = gimple_bb (phi); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
671 edge true_edge, false_edge, tem; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
672 tree arg0 = NULL_TREE, arg1 = NULL_TREE; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
673 |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
674 /* We have to verify that one edge into the PHI node is dominated |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
675 by the true edge of the predicate block and the other edge |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
676 dominated by the false edge. This ensures that the PHI argument |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
677 we are going to take is completely determined by the path we |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
678 take from the predicate block. */ |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
679 extract_true_false_edges_from_block (dom, &true_edge, &false_edge); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
680 tem = EDGE_PRED (bb, 0); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
681 if (tem == true_edge |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
682 || tem->src == true_edge->dest |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
683 || dominated_by_p (CDI_DOMINATORS, |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
684 tem->src, true_edge->dest)) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
685 arg0 = PHI_ARG_DEF (phi, tem->dest_idx); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
686 else if (tem == false_edge |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
687 || tem->src == false_edge->dest |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
688 || dominated_by_p (CDI_DOMINATORS, |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
689 tem->src, false_edge->dest)) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
690 arg1 = PHI_ARG_DEF (phi, tem->dest_idx); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
691 else |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
692 return false; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
693 tem = EDGE_PRED (bb, 1); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
694 if (tem == true_edge |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
695 || tem->src == true_edge->dest |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
696 || dominated_by_p (CDI_DOMINATORS, |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
697 tem->src, true_edge->dest)) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
698 arg0 = PHI_ARG_DEF (phi, tem->dest_idx); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
699 else if (tem == false_edge |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
700 || tem->src == false_edge->dest |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
701 || dominated_by_p (CDI_DOMINATORS, |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
702 tem->src, false_edge->dest)) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
703 arg1 = PHI_ARG_DEF (phi, tem->dest_idx); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
704 else |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
705 return false; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
706 if (!arg0 || !arg1) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
707 return false; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
708 |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
709 if (true_arg_p) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
710 *true_arg_p = arg0; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
711 if (false_arg_p) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
712 *false_arg_p = arg1; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
713 |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
714 return true; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
715 } |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
716 |
| 0 | 717 /* Determine the outermost loop to that it is possible to hoist a statement |
| 718 STMT and store it to LIM_DATA (STMT)->max_loop. To do this we determine | |
| 719 the outermost loop in that the value computed by STMT is invariant. | |
| 720 If MUST_PRESERVE_EXEC is true, additionally choose such a loop that | |
| 721 we preserve the fact whether STMT is executed. It also fills other related | |
| 722 information to LIM_DATA (STMT). | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
723 |
| 0 | 724 The function returns false if STMT cannot be hoisted outside of the loop it |
| 725 is defined in, and true otherwise. */ | |
| 726 | |
| 727 static bool | |
| 728 determine_max_movement (gimple stmt, bool must_preserve_exec) | |
| 729 { | |
| 730 basic_block bb = gimple_bb (stmt); | |
| 731 struct loop *loop = bb->loop_father; | |
| 732 struct loop *level; | |
| 733 struct lim_aux_data *lim_data = get_lim_data (stmt); | |
| 734 tree val; | |
| 735 ssa_op_iter iter; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
736 |
| 0 | 737 if (must_preserve_exec) |
| 738 level = ALWAYS_EXECUTED_IN (bb); | |
| 739 else | |
| 740 level = superloop_at_depth (loop, 1); | |
| 741 lim_data->max_loop = level; | |
| 742 | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
743 if (gimple_code (stmt) == GIMPLE_PHI) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
744 { |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
745 use_operand_p use_p; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
746 unsigned min_cost = UINT_MAX; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
747 unsigned total_cost = 0; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
748 struct lim_aux_data *def_data; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
749 |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
750 /* We will end up promoting dependencies to be unconditionally |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
751 evaluated. For this reason the PHI cost (and thus the |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
752 cost we remove from the loop by doing the invariant motion) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
753 is that of the cheapest PHI argument dependency chain. */ |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
754 FOR_EACH_PHI_ARG (use_p, stmt, iter, SSA_OP_USE) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
755 { |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
756 val = USE_FROM_PTR (use_p); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
757 if (TREE_CODE (val) != SSA_NAME) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
758 continue; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
759 if (!add_dependency (val, lim_data, loop, false)) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
760 return false; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
761 def_data = get_lim_data (SSA_NAME_DEF_STMT (val)); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
762 if (def_data) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
763 { |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
764 min_cost = MIN (min_cost, def_data->cost); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
765 total_cost += def_data->cost; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
766 } |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
767 } |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
768 |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
769 lim_data->cost += min_cost; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
770 |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
771 if (gimple_phi_num_args (stmt) > 1) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
772 { |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
773 basic_block dom = get_immediate_dominator (CDI_DOMINATORS, bb); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
774 gimple cond; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
775 if (gsi_end_p (gsi_last_bb (dom))) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
776 return false; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
777 cond = gsi_stmt (gsi_last_bb (dom)); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
778 if (gimple_code (cond) != GIMPLE_COND) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
779 return false; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
780 /* Verify that this is an extended form of a diamond and |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
781 the PHI arguments are completely controlled by the |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
782 predicate in DOM. */ |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
783 if (!extract_true_false_args_from_phi (dom, stmt, NULL, NULL)) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
784 return false; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
785 |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
786 /* Fold in dependencies and cost of the condition. */ |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
787 FOR_EACH_SSA_TREE_OPERAND (val, cond, iter, SSA_OP_USE) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
788 { |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
789 if (!add_dependency (val, lim_data, loop, false)) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
790 return false; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
791 def_data = get_lim_data (SSA_NAME_DEF_STMT (val)); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
792 if (def_data) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
793 total_cost += def_data->cost; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
794 } |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
795 |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
796 /* We want to avoid unconditionally executing very expensive |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
797 operations. As costs for our dependencies cannot be |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
798 negative just claim we are not invariand for this case. |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
799 We also are not sure whether the control-flow inside the |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
800 loop will vanish. */ |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
801 if (total_cost - min_cost >= 2 * LIM_EXPENSIVE |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
802 && !(min_cost != 0 |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
803 && total_cost / min_cost <= 2)) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
804 return false; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
805 |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
806 /* Assume that the control-flow in the loop will vanish. |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
807 ??? We should verify this and not artificially increase |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
808 the cost if that is not the case. */ |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
809 lim_data->cost += stmt_cost (stmt); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
810 } |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
811 |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
812 return true; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
813 } |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
814 else |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
815 FOR_EACH_SSA_TREE_OPERAND (val, stmt, iter, SSA_OP_USE) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
816 if (!add_dependency (val, lim_data, loop, true)) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
817 return false; |
| 0 | 818 |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
819 if (gimple_vuse (stmt)) |
| 0 | 820 { |
| 821 mem_ref_p ref = mem_ref_in_stmt (stmt); | |
| 822 | |
| 823 if (ref) | |
| 824 { | |
| 825 lim_data->max_loop | |
| 826 = outermost_indep_loop (lim_data->max_loop, loop, ref); | |
| 827 if (!lim_data->max_loop) | |
| 828 return false; | |
| 829 } | |
| 830 else | |
| 831 { | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
832 if ((val = gimple_vuse (stmt)) != NULL_TREE) |
| 0 | 833 { |
| 834 if (!add_dependency (val, lim_data, loop, false)) | |
| 835 return false; | |
| 836 } | |
| 837 } | |
| 838 } | |
| 839 | |
| 840 lim_data->cost += stmt_cost (stmt); | |
| 841 | |
| 842 return true; | |
| 843 } | |
| 844 | |
| 845 /* Suppose that some statement in ORIG_LOOP is hoisted to the loop LEVEL, | |
| 846 and that one of the operands of this statement is computed by STMT. | |
| 847 Ensure that STMT (together with all the statements that define its | |
| 848 operands) is hoisted at least out of the loop LEVEL. */ | |
| 849 | |
| 850 static void | |
| 851 set_level (gimple stmt, struct loop *orig_loop, struct loop *level) | |
| 852 { | |
| 853 struct loop *stmt_loop = gimple_bb (stmt)->loop_father; | |
| 854 struct depend *dep; | |
| 855 struct lim_aux_data *lim_data; | |
| 856 | |
| 857 stmt_loop = find_common_loop (orig_loop, stmt_loop); | |
| 858 lim_data = get_lim_data (stmt); | |
| 859 if (lim_data != NULL && lim_data->tgt_loop != NULL) | |
| 860 stmt_loop = find_common_loop (stmt_loop, | |
| 861 loop_outer (lim_data->tgt_loop)); | |
| 862 if (flow_loop_nested_p (stmt_loop, level)) | |
| 863 return; | |
| 864 | |
| 865 gcc_assert (level == lim_data->max_loop | |
| 866 || flow_loop_nested_p (lim_data->max_loop, level)); | |
| 867 | |
| 868 lim_data->tgt_loop = level; | |
| 869 for (dep = lim_data->depends; dep; dep = dep->next) | |
| 870 set_level (dep->stmt, orig_loop, level); | |
| 871 } | |
| 872 | |
| 873 /* Determines an outermost loop from that we want to hoist the statement STMT. | |
| 874 For now we chose the outermost possible loop. TODO -- use profiling | |
| 875 information to set it more sanely. */ | |
| 876 | |
| 877 static void | |
| 878 set_profitable_level (gimple stmt) | |
| 879 { | |
| 880 set_level (stmt, gimple_bb (stmt)->loop_father, get_lim_data (stmt)->max_loop); | |
| 881 } | |
| 882 | |
| 883 /* Returns true if STMT is a call that has side effects. */ | |
| 884 | |
| 885 static bool | |
| 886 nonpure_call_p (gimple stmt) | |
| 887 { | |
| 888 if (gimple_code (stmt) != GIMPLE_CALL) | |
| 889 return false; | |
| 890 | |
| 891 return gimple_has_side_effects (stmt); | |
| 892 } | |
| 893 | |
| 894 /* Rewrite a/b to a*(1/b). Return the invariant stmt to process. */ | |
| 895 | |
| 896 static gimple | |
| 897 rewrite_reciprocal (gimple_stmt_iterator *bsi) | |
| 898 { | |
| 899 gimple stmt, stmt1, stmt2; | |
| 900 tree var, name, lhs, type; | |
| 901 tree real_one; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
902 gimple_stmt_iterator gsi; |
| 0 | 903 |
| 904 stmt = gsi_stmt (*bsi); | |
| 905 lhs = gimple_assign_lhs (stmt); | |
| 906 type = TREE_TYPE (lhs); | |
| 907 | |
| 908 var = create_tmp_var (type, "reciptmp"); | |
| 909 add_referenced_var (var); | |
| 910 DECL_GIMPLE_REG_P (var) = 1; | |
| 911 | |
| 912 /* For vectors, create a VECTOR_CST full of 1's. */ | |
| 913 if (TREE_CODE (type) == VECTOR_TYPE) | |
| 914 { | |
| 915 int i, len; | |
| 916 tree list = NULL_TREE; | |
| 917 real_one = build_real (TREE_TYPE (type), dconst1); | |
| 918 len = TYPE_VECTOR_SUBPARTS (type); | |
| 919 for (i = 0; i < len; i++) | |
| 920 list = tree_cons (NULL, real_one, list); | |
| 921 real_one = build_vector (type, list); | |
| 922 } | |
| 923 else | |
| 924 real_one = build_real (type, dconst1); | |
| 925 | |
| 926 stmt1 = gimple_build_assign_with_ops (RDIV_EXPR, | |
| 927 var, real_one, gimple_assign_rhs2 (stmt)); | |
| 928 name = make_ssa_name (var, stmt1); | |
| 929 gimple_assign_set_lhs (stmt1, name); | |
| 930 | |
| 931 stmt2 = gimple_build_assign_with_ops (MULT_EXPR, lhs, name, | |
| 932 gimple_assign_rhs1 (stmt)); | |
| 933 | |
| 934 /* Replace division stmt with reciprocal and multiply stmts. | |
| 935 The multiply stmt is not invariant, so update iterator | |
| 936 and avoid rescanning. */ | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
937 gsi = *bsi; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
938 gsi_insert_before (bsi, stmt1, GSI_NEW_STMT); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
939 gsi_replace (&gsi, stmt2, true); |
| 0 | 940 |
| 941 /* Continue processing with invariant reciprocal statement. */ | |
| 942 return stmt1; | |
| 943 } | |
| 944 | |
| 945 /* Check if the pattern at *BSI is a bittest of the form | |
| 946 (A >> B) & 1 != 0 and in this case rewrite it to A & (1 << B) != 0. */ | |
| 947 | |
| 948 static gimple | |
| 949 rewrite_bittest (gimple_stmt_iterator *bsi) | |
| 950 { | |
| 951 gimple stmt, use_stmt, stmt1, stmt2; | |
| 952 tree lhs, var, name, t, a, b; | |
| 953 use_operand_p use; | |
| 954 | |
| 955 stmt = gsi_stmt (*bsi); | |
| 956 lhs = gimple_assign_lhs (stmt); | |
| 957 | |
| 958 /* Verify that the single use of lhs is a comparison against zero. */ | |
| 959 if (TREE_CODE (lhs) != SSA_NAME | |
| 960 || !single_imm_use (lhs, &use, &use_stmt) | |
| 961 || gimple_code (use_stmt) != GIMPLE_COND) | |
| 962 return stmt; | |
| 963 if (gimple_cond_lhs (use_stmt) != lhs | |
| 964 || (gimple_cond_code (use_stmt) != NE_EXPR | |
| 965 && gimple_cond_code (use_stmt) != EQ_EXPR) | |
| 966 || !integer_zerop (gimple_cond_rhs (use_stmt))) | |
| 967 return stmt; | |
| 968 | |
| 969 /* Get at the operands of the shift. The rhs is TMP1 & 1. */ | |
| 970 stmt1 = SSA_NAME_DEF_STMT (gimple_assign_rhs1 (stmt)); | |
| 971 if (gimple_code (stmt1) != GIMPLE_ASSIGN) | |
| 972 return stmt; | |
| 973 | |
| 974 /* There is a conversion in between possibly inserted by fold. */ | |
| 975 if (CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt1))) | |
| 976 { | |
| 977 t = gimple_assign_rhs1 (stmt1); | |
| 978 if (TREE_CODE (t) != SSA_NAME | |
| 979 || !has_single_use (t)) | |
| 980 return stmt; | |
| 981 stmt1 = SSA_NAME_DEF_STMT (t); | |
| 982 if (gimple_code (stmt1) != GIMPLE_ASSIGN) | |
| 983 return stmt; | |
| 984 } | |
| 985 | |
| 986 /* Verify that B is loop invariant but A is not. Verify that with | |
| 987 all the stmt walking we are still in the same loop. */ | |
| 988 if (gimple_assign_rhs_code (stmt1) != RSHIFT_EXPR | |
| 989 || loop_containing_stmt (stmt1) != loop_containing_stmt (stmt)) | |
| 990 return stmt; | |
| 991 | |
| 992 a = gimple_assign_rhs1 (stmt1); | |
| 993 b = gimple_assign_rhs2 (stmt1); | |
| 994 | |
| 995 if (outermost_invariant_loop (b, loop_containing_stmt (stmt1)) != NULL | |
| 996 && outermost_invariant_loop (a, loop_containing_stmt (stmt1)) == NULL) | |
| 997 { | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
998 gimple_stmt_iterator rsi; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
999 |
| 0 | 1000 /* 1 << B */ |
| 1001 var = create_tmp_var (TREE_TYPE (a), "shifttmp"); | |
| 1002 add_referenced_var (var); | |
| 1003 t = fold_build2 (LSHIFT_EXPR, TREE_TYPE (a), | |
| 1004 build_int_cst (TREE_TYPE (a), 1), b); | |
| 1005 stmt1 = gimple_build_assign (var, t); | |
| 1006 name = make_ssa_name (var, stmt1); | |
| 1007 gimple_assign_set_lhs (stmt1, name); | |
| 1008 | |
| 1009 /* A & (1 << B) */ | |
| 1010 t = fold_build2 (BIT_AND_EXPR, TREE_TYPE (a), a, name); | |
| 1011 stmt2 = gimple_build_assign (var, t); | |
| 1012 name = make_ssa_name (var, stmt2); | |
| 1013 gimple_assign_set_lhs (stmt2, name); | |
| 1014 | |
| 1015 /* Replace the SSA_NAME we compare against zero. Adjust | |
| 1016 the type of zero accordingly. */ | |
| 1017 SET_USE (use, name); | |
| 1018 gimple_cond_set_rhs (use_stmt, build_int_cst_type (TREE_TYPE (name), 0)); | |
| 1019 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
1020 /* Don't use gsi_replace here, none of the new assignments sets |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
1021 the variable originally set in stmt. Move bsi to stmt1, and |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
1022 then remove the original stmt, so that we get a chance to |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
1023 retain debug info for it. */ |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
1024 rsi = *bsi; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
1025 gsi_insert_before (bsi, stmt1, GSI_NEW_STMT); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
1026 gsi_insert_before (&rsi, stmt2, GSI_SAME_STMT); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
1027 gsi_remove (&rsi, true); |
| 0 | 1028 |
| 1029 return stmt1; | |
| 1030 } | |
| 1031 | |
| 1032 return stmt; | |
| 1033 } | |
| 1034 | |
| 1035 | |
| 1036 /* Determine the outermost loops in that statements in basic block BB are | |
| 1037 invariant, and record them to the LIM_DATA associated with the statements. | |
| 1038 Callback for walk_dominator_tree. */ | |
| 1039 | |
| 1040 static void | |
| 1041 determine_invariantness_stmt (struct dom_walk_data *dw_data ATTRIBUTE_UNUSED, | |
| 1042 basic_block bb) | |
| 1043 { | |
| 1044 enum move_pos pos; | |
| 1045 gimple_stmt_iterator bsi; | |
| 1046 gimple stmt; | |
| 1047 bool maybe_never = ALWAYS_EXECUTED_IN (bb) == NULL; | |
| 1048 struct loop *outermost = ALWAYS_EXECUTED_IN (bb); | |
| 1049 struct lim_aux_data *lim_data; | |
| 1050 | |
| 1051 if (!loop_outer (bb->loop_father)) | |
| 1052 return; | |
| 1053 | |
| 1054 if (dump_file && (dump_flags & TDF_DETAILS)) | |
| 1055 fprintf (dump_file, "Basic block %d (loop %d -- depth %d):\n\n", | |
| 1056 bb->index, bb->loop_father->num, loop_depth (bb->loop_father)); | |
| 1057 | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1058 /* Look at PHI nodes, but only if there is at most two. |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1059 ??? We could relax this further by post-processing the inserted |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1060 code and transforming adjacent cond-exprs with the same predicate |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1061 to control flow again. */ |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1062 bsi = gsi_start_phis (bb); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1063 if (!gsi_end_p (bsi) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1064 && ((gsi_next (&bsi), gsi_end_p (bsi)) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1065 || (gsi_next (&bsi), gsi_end_p (bsi)))) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1066 for (bsi = gsi_start_phis (bb); !gsi_end_p (bsi); gsi_next (&bsi)) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1067 { |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1068 stmt = gsi_stmt (bsi); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1069 |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1070 pos = movement_possibility (stmt); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1071 if (pos == MOVE_IMPOSSIBLE) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1072 continue; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1073 |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1074 lim_data = init_lim_data (stmt); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1075 lim_data->always_executed_in = outermost; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1076 |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1077 if (!determine_max_movement (stmt, false)) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1078 { |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1079 lim_data->max_loop = NULL; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1080 continue; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1081 } |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1082 |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1083 if (dump_file && (dump_flags & TDF_DETAILS)) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1084 { |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1085 print_gimple_stmt (dump_file, stmt, 2, 0); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1086 fprintf (dump_file, " invariant up to level %d, cost %d.\n\n", |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1087 loop_depth (lim_data->max_loop), |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1088 lim_data->cost); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1089 } |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1090 |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1091 if (lim_data->cost >= LIM_EXPENSIVE) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1092 set_profitable_level (stmt); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1093 } |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1094 |
| 0 | 1095 for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi)) |
| 1096 { | |
| 1097 stmt = gsi_stmt (bsi); | |
| 1098 | |
| 1099 pos = movement_possibility (stmt); | |
| 1100 if (pos == MOVE_IMPOSSIBLE) | |
| 1101 { | |
| 1102 if (nonpure_call_p (stmt)) | |
| 1103 { | |
| 1104 maybe_never = true; | |
| 1105 outermost = NULL; | |
| 1106 } | |
| 1107 /* Make sure to note always_executed_in for stores to make | |
| 1108 store-motion work. */ | |
| 1109 else if (stmt_makes_single_store (stmt)) | |
| 1110 { | |
| 1111 struct lim_aux_data *lim_data = init_lim_data (stmt); | |
| 1112 lim_data->always_executed_in = outermost; | |
| 1113 } | |
| 1114 continue; | |
| 1115 } | |
| 1116 | |
| 1117 if (is_gimple_assign (stmt) | |
| 1118 && (get_gimple_rhs_class (gimple_assign_rhs_code (stmt)) | |
| 1119 == GIMPLE_BINARY_RHS)) | |
| 1120 { | |
| 1121 tree op0 = gimple_assign_rhs1 (stmt); | |
| 1122 tree op1 = gimple_assign_rhs2 (stmt); | |
| 1123 struct loop *ol1 = outermost_invariant_loop (op1, | |
| 1124 loop_containing_stmt (stmt)); | |
| 1125 | |
| 1126 /* If divisor is invariant, convert a/b to a*(1/b), allowing reciprocal | |
| 1127 to be hoisted out of loop, saving expensive divide. */ | |
| 1128 if (pos == MOVE_POSSIBLE | |
| 1129 && gimple_assign_rhs_code (stmt) == RDIV_EXPR | |
| 1130 && flag_unsafe_math_optimizations | |
| 1131 && !flag_trapping_math | |
| 1132 && ol1 != NULL | |
| 1133 && outermost_invariant_loop (op0, ol1) == NULL) | |
| 1134 stmt = rewrite_reciprocal (&bsi); | |
| 1135 | |
| 1136 /* If the shift count is invariant, convert (A >> B) & 1 to | |
| 1137 A & (1 << B) allowing the bit mask to be hoisted out of the loop | |
| 1138 saving an expensive shift. */ | |
| 1139 if (pos == MOVE_POSSIBLE | |
| 1140 && gimple_assign_rhs_code (stmt) == BIT_AND_EXPR | |
| 1141 && integer_onep (op1) | |
| 1142 && TREE_CODE (op0) == SSA_NAME | |
| 1143 && has_single_use (op0)) | |
| 1144 stmt = rewrite_bittest (&bsi); | |
| 1145 } | |
| 1146 | |
| 1147 lim_data = init_lim_data (stmt); | |
| 1148 lim_data->always_executed_in = outermost; | |
| 1149 | |
| 1150 if (maybe_never && pos == MOVE_PRESERVE_EXECUTION) | |
| 1151 continue; | |
| 1152 | |
| 1153 if (!determine_max_movement (stmt, pos == MOVE_PRESERVE_EXECUTION)) | |
| 1154 { | |
| 1155 lim_data->max_loop = NULL; | |
| 1156 continue; | |
| 1157 } | |
| 1158 | |
| 1159 if (dump_file && (dump_flags & TDF_DETAILS)) | |
| 1160 { | |
| 1161 print_gimple_stmt (dump_file, stmt, 2, 0); | |
| 1162 fprintf (dump_file, " invariant up to level %d, cost %d.\n\n", | |
| 1163 loop_depth (lim_data->max_loop), | |
| 1164 lim_data->cost); | |
| 1165 } | |
| 1166 | |
| 1167 if (lim_data->cost >= LIM_EXPENSIVE) | |
| 1168 set_profitable_level (stmt); | |
| 1169 } | |
| 1170 } | |
| 1171 | |
| 1172 /* For each statement determines the outermost loop in that it is invariant, | |
| 1173 statements on whose motion it depends and the cost of the computation. | |
| 1174 This information is stored to the LIM_DATA structure associated with | |
| 1175 each statement. */ | |
| 1176 | |
| 1177 static void | |
| 1178 determine_invariantness (void) | |
| 1179 { | |
| 1180 struct dom_walk_data walk_data; | |
| 1181 | |
| 1182 memset (&walk_data, 0, sizeof (struct dom_walk_data)); | |
| 1183 walk_data.dom_direction = CDI_DOMINATORS; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
1184 walk_data.before_dom_children = determine_invariantness_stmt; |
| 0 | 1185 |
| 1186 init_walk_dominator_tree (&walk_data); | |
| 1187 walk_dominator_tree (&walk_data, ENTRY_BLOCK_PTR); | |
| 1188 fini_walk_dominator_tree (&walk_data); | |
| 1189 } | |
| 1190 | |
| 1191 /* Hoist the statements in basic block BB out of the loops prescribed by | |
| 1192 data stored in LIM_DATA structures associated with each statement. Callback | |
| 1193 for walk_dominator_tree. */ | |
| 1194 | |
| 1195 static void | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1196 move_computations_stmt (struct dom_walk_data *dw_data, |
| 0 | 1197 basic_block bb) |
| 1198 { | |
| 1199 struct loop *level; | |
| 1200 gimple_stmt_iterator bsi; | |
| 1201 gimple stmt; | |
| 1202 unsigned cost = 0; | |
| 1203 struct lim_aux_data *lim_data; | |
| 1204 | |
| 1205 if (!loop_outer (bb->loop_father)) | |
| 1206 return; | |
| 1207 | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1208 for (bsi = gsi_start_phis (bb); !gsi_end_p (bsi); ) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1209 { |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1210 gimple new_stmt; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1211 stmt = gsi_stmt (bsi); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1212 |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1213 lim_data = get_lim_data (stmt); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1214 if (lim_data == NULL) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1215 { |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1216 gsi_next (&bsi); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1217 continue; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1218 } |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1219 |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1220 cost = lim_data->cost; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1221 level = lim_data->tgt_loop; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1222 clear_lim_data (stmt); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1223 |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1224 if (!level) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1225 { |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1226 gsi_next (&bsi); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1227 continue; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1228 } |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1229 |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1230 if (dump_file && (dump_flags & TDF_DETAILS)) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1231 { |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1232 fprintf (dump_file, "Moving PHI node\n"); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1233 print_gimple_stmt (dump_file, stmt, 0, 0); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1234 fprintf (dump_file, "(cost %u) out of loop %d.\n\n", |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1235 cost, level->num); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1236 } |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1237 |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1238 if (gimple_phi_num_args (stmt) == 1) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1239 { |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1240 tree arg = PHI_ARG_DEF (stmt, 0); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1241 new_stmt = gimple_build_assign_with_ops (TREE_CODE (arg), |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1242 gimple_phi_result (stmt), |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1243 arg, NULL_TREE); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1244 SSA_NAME_DEF_STMT (gimple_phi_result (stmt)) = new_stmt; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1245 } |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1246 else |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1247 { |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1248 basic_block dom = get_immediate_dominator (CDI_DOMINATORS, bb); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1249 gimple cond = gsi_stmt (gsi_last_bb (dom)); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1250 tree arg0 = NULL_TREE, arg1 = NULL_TREE, t; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1251 /* Get the PHI arguments corresponding to the true and false |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1252 edges of COND. */ |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1253 extract_true_false_args_from_phi (dom, stmt, &arg0, &arg1); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1254 gcc_assert (arg0 && arg1); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1255 t = build2 (gimple_cond_code (cond), boolean_type_node, |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1256 gimple_cond_lhs (cond), gimple_cond_rhs (cond)); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1257 t = build3 (COND_EXPR, TREE_TYPE (gimple_phi_result (stmt)), |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1258 t, arg0, arg1); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1259 new_stmt = gimple_build_assign_with_ops (COND_EXPR, |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1260 gimple_phi_result (stmt), |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1261 t, NULL_TREE); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1262 SSA_NAME_DEF_STMT (gimple_phi_result (stmt)) = new_stmt; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1263 *((unsigned int *)(dw_data->global_data)) |= TODO_cleanup_cfg; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1264 } |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1265 gsi_insert_on_edge (loop_preheader_edge (level), new_stmt); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1266 remove_phi_node (&bsi, false); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1267 } |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1268 |
| 0 | 1269 for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); ) |
| 1270 { | |
| 1271 stmt = gsi_stmt (bsi); | |
| 1272 | |
| 1273 lim_data = get_lim_data (stmt); | |
| 1274 if (lim_data == NULL) | |
| 1275 { | |
| 1276 gsi_next (&bsi); | |
| 1277 continue; | |
| 1278 } | |
| 1279 | |
| 1280 cost = lim_data->cost; | |
| 1281 level = lim_data->tgt_loop; | |
| 1282 clear_lim_data (stmt); | |
| 1283 | |
| 1284 if (!level) | |
| 1285 { | |
| 1286 gsi_next (&bsi); | |
| 1287 continue; | |
| 1288 } | |
| 1289 | |
| 1290 /* We do not really want to move conditionals out of the loop; we just | |
| 1291 placed it here to force its operands to be moved if necessary. */ | |
| 1292 if (gimple_code (stmt) == GIMPLE_COND) | |
| 1293 continue; | |
| 1294 | |
| 1295 if (dump_file && (dump_flags & TDF_DETAILS)) | |
| 1296 { | |
| 1297 fprintf (dump_file, "Moving statement\n"); | |
| 1298 print_gimple_stmt (dump_file, stmt, 0, 0); | |
| 1299 fprintf (dump_file, "(cost %u) out of loop %d.\n\n", | |
| 1300 cost, level->num); | |
| 1301 } | |
| 1302 | |
| 1303 mark_virtual_ops_for_renaming (stmt); | |
| 1304 gsi_insert_on_edge (loop_preheader_edge (level), stmt); | |
| 1305 gsi_remove (&bsi, false); | |
| 1306 } | |
| 1307 } | |
| 1308 | |
| 1309 /* Hoist the statements out of the loops prescribed by data stored in | |
| 1310 LIM_DATA structures associated with each statement.*/ | |
| 1311 | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1312 static unsigned int |
| 0 | 1313 move_computations (void) |
| 1314 { | |
| 1315 struct dom_walk_data walk_data; | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1316 unsigned int todo = 0; |
| 0 | 1317 |
| 1318 memset (&walk_data, 0, sizeof (struct dom_walk_data)); | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1319 walk_data.global_data = &todo; |
| 0 | 1320 walk_data.dom_direction = CDI_DOMINATORS; |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
1321 walk_data.before_dom_children = move_computations_stmt; |
| 0 | 1322 |
| 1323 init_walk_dominator_tree (&walk_data); | |
| 1324 walk_dominator_tree (&walk_data, ENTRY_BLOCK_PTR); | |
| 1325 fini_walk_dominator_tree (&walk_data); | |
| 1326 | |
| 1327 gsi_commit_edge_inserts (); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
1328 if (need_ssa_update_p (cfun)) |
| 0 | 1329 rewrite_into_loop_closed_ssa (NULL, TODO_update_ssa); |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1330 |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1331 return todo; |
| 0 | 1332 } |
| 1333 | |
| 1334 /* Checks whether the statement defining variable *INDEX can be hoisted | |
| 1335 out of the loop passed in DATA. Callback for for_each_index. */ | |
| 1336 | |
| 1337 static bool | |
| 1338 may_move_till (tree ref, tree *index, void *data) | |
| 1339 { | |
| 1340 struct loop *loop = (struct loop *) data, *max_loop; | |
| 1341 | |
| 1342 /* If REF is an array reference, check also that the step and the lower | |
| 1343 bound is invariant in LOOP. */ | |
| 1344 if (TREE_CODE (ref) == ARRAY_REF) | |
| 1345 { | |
| 1346 tree step = TREE_OPERAND (ref, 3); | |
| 1347 tree lbound = TREE_OPERAND (ref, 2); | |
| 1348 | |
| 1349 max_loop = outermost_invariant_loop (step, loop); | |
| 1350 if (!max_loop) | |
| 1351 return false; | |
| 1352 | |
| 1353 max_loop = outermost_invariant_loop (lbound, loop); | |
| 1354 if (!max_loop) | |
| 1355 return false; | |
| 1356 } | |
| 1357 | |
| 1358 max_loop = outermost_invariant_loop (*index, loop); | |
| 1359 if (!max_loop) | |
| 1360 return false; | |
| 1361 | |
| 1362 return true; | |
| 1363 } | |
| 1364 | |
| 1365 /* If OP is SSA NAME, force the statement that defines it to be | |
| 1366 moved out of the LOOP. ORIG_LOOP is the loop in that EXPR is used. */ | |
| 1367 | |
| 1368 static void | |
| 1369 force_move_till_op (tree op, struct loop *orig_loop, struct loop *loop) | |
| 1370 { | |
| 1371 gimple stmt; | |
| 1372 | |
| 1373 if (!op | |
| 1374 || is_gimple_min_invariant (op)) | |
| 1375 return; | |
| 1376 | |
| 1377 gcc_assert (TREE_CODE (op) == SSA_NAME); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
1378 |
| 0 | 1379 stmt = SSA_NAME_DEF_STMT (op); |
| 1380 if (gimple_nop_p (stmt)) | |
| 1381 return; | |
| 1382 | |
| 1383 set_level (stmt, orig_loop, loop); | |
| 1384 } | |
| 1385 | |
| 1386 /* Forces statement defining invariants in REF (and *INDEX) to be moved out of | |
| 1387 the LOOP. The reference REF is used in the loop ORIG_LOOP. Callback for | |
| 1388 for_each_index. */ | |
| 1389 | |
| 1390 struct fmt_data | |
| 1391 { | |
| 1392 struct loop *loop; | |
| 1393 struct loop *orig_loop; | |
| 1394 }; | |
| 1395 | |
| 1396 static bool | |
| 1397 force_move_till (tree ref, tree *index, void *data) | |
| 1398 { | |
| 1399 struct fmt_data *fmt_data = (struct fmt_data *) data; | |
| 1400 | |
| 1401 if (TREE_CODE (ref) == ARRAY_REF) | |
| 1402 { | |
| 1403 tree step = TREE_OPERAND (ref, 3); | |
| 1404 tree lbound = TREE_OPERAND (ref, 2); | |
| 1405 | |
| 1406 force_move_till_op (step, fmt_data->orig_loop, fmt_data->loop); | |
| 1407 force_move_till_op (lbound, fmt_data->orig_loop, fmt_data->loop); | |
| 1408 } | |
| 1409 | |
| 1410 force_move_till_op (*index, fmt_data->orig_loop, fmt_data->loop); | |
| 1411 | |
| 1412 return true; | |
| 1413 } | |
| 1414 | |
| 1415 /* A hash function for struct mem_ref object OBJ. */ | |
| 1416 | |
| 1417 static hashval_t | |
| 1418 memref_hash (const void *obj) | |
| 1419 { | |
| 1420 const struct mem_ref *const mem = (const struct mem_ref *) obj; | |
| 1421 | |
| 1422 return mem->hash; | |
| 1423 } | |
| 1424 | |
| 1425 /* An equality function for struct mem_ref object OBJ1 with | |
| 1426 memory reference OBJ2. */ | |
| 1427 | |
| 1428 static int | |
| 1429 memref_eq (const void *obj1, const void *obj2) | |
| 1430 { | |
| 1431 const struct mem_ref *const mem1 = (const struct mem_ref *) obj1; | |
| 1432 | |
| 1433 return operand_equal_p (mem1->mem, (const_tree) obj2, 0); | |
| 1434 } | |
| 1435 | |
| 1436 /* Releases list of memory reference locations ACCS. */ | |
| 1437 | |
| 1438 static void | |
| 1439 free_mem_ref_locs (mem_ref_locs_p accs) | |
| 1440 { | |
| 1441 unsigned i; | |
| 1442 mem_ref_loc_p loc; | |
| 1443 | |
| 1444 if (!accs) | |
| 1445 return; | |
| 1446 | |
| 1447 for (i = 0; VEC_iterate (mem_ref_loc_p, accs->locs, i, loc); i++) | |
| 1448 free (loc); | |
| 1449 VEC_free (mem_ref_loc_p, heap, accs->locs); | |
| 1450 free (accs); | |
| 1451 } | |
| 1452 | |
| 1453 /* A function to free the mem_ref object OBJ. */ | |
| 1454 | |
| 1455 static void | |
| 1456 memref_free (void *obj) | |
| 1457 { | |
| 1458 struct mem_ref *const mem = (struct mem_ref *) obj; | |
| 1459 unsigned i; | |
| 1460 mem_ref_locs_p accs; | |
| 1461 | |
| 1462 BITMAP_FREE (mem->stored); | |
| 1463 BITMAP_FREE (mem->indep_loop); | |
| 1464 BITMAP_FREE (mem->dep_loop); | |
| 1465 BITMAP_FREE (mem->indep_ref); | |
| 1466 BITMAP_FREE (mem->dep_ref); | |
| 1467 | |
| 1468 for (i = 0; VEC_iterate (mem_ref_locs_p, mem->accesses_in_loop, i, accs); i++) | |
| 1469 free_mem_ref_locs (accs); | |
| 1470 VEC_free (mem_ref_locs_p, heap, mem->accesses_in_loop); | |
| 1471 | |
| 1472 BITMAP_FREE (mem->vops); | |
| 1473 free (mem); | |
| 1474 } | |
| 1475 | |
| 1476 /* Allocates and returns a memory reference description for MEM whose hash | |
| 1477 value is HASH and id is ID. */ | |
| 1478 | |
| 1479 static mem_ref_p | |
| 1480 mem_ref_alloc (tree mem, unsigned hash, unsigned id) | |
| 1481 { | |
| 1482 mem_ref_p ref = XNEW (struct mem_ref); | |
| 1483 ref->mem = mem; | |
| 1484 ref->id = id; | |
| 1485 ref->hash = hash; | |
| 1486 ref->stored = BITMAP_ALLOC (NULL); | |
| 1487 ref->indep_loop = BITMAP_ALLOC (NULL); | |
| 1488 ref->dep_loop = BITMAP_ALLOC (NULL); | |
| 1489 ref->indep_ref = BITMAP_ALLOC (NULL); | |
| 1490 ref->dep_ref = BITMAP_ALLOC (NULL); | |
| 1491 ref->accesses_in_loop = NULL; | |
| 1492 ref->vops = BITMAP_ALLOC (NULL); | |
| 1493 | |
| 1494 return ref; | |
| 1495 } | |
| 1496 | |
| 1497 /* Allocates and returns the new list of locations. */ | |
| 1498 | |
| 1499 static mem_ref_locs_p | |
| 1500 mem_ref_locs_alloc (void) | |
| 1501 { | |
| 1502 mem_ref_locs_p accs = XNEW (struct mem_ref_locs); | |
| 1503 accs->locs = NULL; | |
| 1504 return accs; | |
| 1505 } | |
| 1506 | |
| 1507 /* Records memory reference location *LOC in LOOP to the memory reference | |
| 1508 description REF. The reference occurs in statement STMT. */ | |
| 1509 | |
| 1510 static void | |
| 1511 record_mem_ref_loc (mem_ref_p ref, struct loop *loop, gimple stmt, tree *loc) | |
| 1512 { | |
| 1513 mem_ref_loc_p aref = XNEW (struct mem_ref_loc); | |
| 1514 mem_ref_locs_p accs; | |
| 1515 bitmap ril = VEC_index (bitmap, memory_accesses.refs_in_loop, loop->num); | |
| 1516 | |
| 1517 if (VEC_length (mem_ref_locs_p, ref->accesses_in_loop) | |
| 1518 <= (unsigned) loop->num) | |
| 1519 VEC_safe_grow_cleared (mem_ref_locs_p, heap, ref->accesses_in_loop, | |
| 1520 loop->num + 1); | |
| 1521 accs = VEC_index (mem_ref_locs_p, ref->accesses_in_loop, loop->num); | |
| 1522 if (!accs) | |
| 1523 { | |
| 1524 accs = mem_ref_locs_alloc (); | |
| 1525 VEC_replace (mem_ref_locs_p, ref->accesses_in_loop, loop->num, accs); | |
| 1526 } | |
| 1527 | |
| 1528 aref->stmt = stmt; | |
| 1529 aref->ref = loc; | |
| 1530 | |
| 1531 VEC_safe_push (mem_ref_loc_p, heap, accs->locs, aref); | |
| 1532 bitmap_set_bit (ril, ref->id); | |
| 1533 } | |
| 1534 | |
| 1535 /* Marks reference REF as stored in LOOP. */ | |
| 1536 | |
| 1537 static void | |
| 1538 mark_ref_stored (mem_ref_p ref, struct loop *loop) | |
| 1539 { | |
| 1540 for (; | |
| 1541 loop != current_loops->tree_root | |
| 1542 && !bitmap_bit_p (ref->stored, loop->num); | |
| 1543 loop = loop_outer (loop)) | |
| 1544 bitmap_set_bit (ref->stored, loop->num); | |
| 1545 } | |
| 1546 | |
| 1547 /* Gathers memory references in statement STMT in LOOP, storing the | |
| 1548 information about them in the memory_accesses structure. Marks | |
| 1549 the vops accessed through unrecognized statements there as | |
| 1550 well. */ | |
| 1551 | |
| 1552 static void | |
| 1553 gather_mem_refs_stmt (struct loop *loop, gimple stmt) | |
| 1554 { | |
| 1555 tree *mem = NULL; | |
| 1556 hashval_t hash; | |
| 1557 PTR *slot; | |
| 1558 mem_ref_p ref; | |
| 1559 tree vname; | |
| 1560 bool is_stored; | |
| 1561 bitmap clvops; | |
| 1562 unsigned id; | |
| 1563 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
1564 if (!gimple_vuse (stmt)) |
| 0 | 1565 return; |
| 1566 | |
| 1567 mem = simple_mem_ref_in_stmt (stmt, &is_stored); | |
| 1568 if (!mem) | |
| 1569 goto fail; | |
| 1570 | |
| 1571 hash = iterative_hash_expr (*mem, 0); | |
| 1572 slot = htab_find_slot_with_hash (memory_accesses.refs, *mem, hash, INSERT); | |
| 1573 | |
| 1574 if (*slot) | |
| 1575 { | |
| 1576 ref = (mem_ref_p) *slot; | |
| 1577 id = ref->id; | |
| 1578 } | |
| 1579 else | |
| 1580 { | |
| 1581 id = VEC_length (mem_ref_p, memory_accesses.refs_list); | |
| 1582 ref = mem_ref_alloc (*mem, hash, id); | |
| 1583 VEC_safe_push (mem_ref_p, heap, memory_accesses.refs_list, ref); | |
| 1584 *slot = ref; | |
| 1585 | |
| 1586 if (dump_file && (dump_flags & TDF_DETAILS)) | |
| 1587 { | |
| 1588 fprintf (dump_file, "Memory reference %u: ", id); | |
| 1589 print_generic_expr (dump_file, ref->mem, TDF_SLIM); | |
| 1590 fprintf (dump_file, "\n"); | |
| 1591 } | |
| 1592 } | |
| 1593 if (is_stored) | |
| 1594 mark_ref_stored (ref, loop); | |
| 1595 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
1596 if ((vname = gimple_vuse (stmt)) != NULL_TREE) |
| 0 | 1597 bitmap_set_bit (ref->vops, DECL_UID (SSA_NAME_VAR (vname))); |
| 1598 record_mem_ref_loc (ref, loop, stmt, mem); | |
| 1599 return; | |
| 1600 | |
| 1601 fail: | |
| 1602 clvops = VEC_index (bitmap, memory_accesses.clobbered_vops, loop->num); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
1603 if ((vname = gimple_vuse (stmt)) != NULL_TREE) |
| 0 | 1604 bitmap_set_bit (clvops, DECL_UID (SSA_NAME_VAR (vname))); |
| 1605 } | |
| 1606 | |
| 1607 /* Gathers memory references in loops. */ | |
| 1608 | |
| 1609 static void | |
| 1610 gather_mem_refs_in_loops (void) | |
| 1611 { | |
| 1612 gimple_stmt_iterator bsi; | |
| 1613 basic_block bb; | |
| 1614 struct loop *loop; | |
| 1615 loop_iterator li; | |
| 1616 bitmap clvo, clvi; | |
| 1617 bitmap lrefs, alrefs, alrefso; | |
| 1618 | |
| 1619 FOR_EACH_BB (bb) | |
| 1620 { | |
| 1621 loop = bb->loop_father; | |
| 1622 if (loop == current_loops->tree_root) | |
| 1623 continue; | |
| 1624 | |
| 1625 for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi)) | |
| 1626 gather_mem_refs_stmt (loop, gsi_stmt (bsi)); | |
| 1627 } | |
| 1628 | |
| 1629 /* Propagate the information about clobbered vops and accessed memory | |
| 1630 references up the loop hierarchy. */ | |
| 1631 FOR_EACH_LOOP (li, loop, LI_FROM_INNERMOST) | |
| 1632 { | |
| 1633 lrefs = VEC_index (bitmap, memory_accesses.refs_in_loop, loop->num); | |
| 1634 alrefs = VEC_index (bitmap, memory_accesses.all_refs_in_loop, loop->num); | |
| 1635 bitmap_ior_into (alrefs, lrefs); | |
| 1636 | |
| 1637 if (loop_outer (loop) == current_loops->tree_root) | |
| 1638 continue; | |
| 1639 | |
| 1640 clvi = VEC_index (bitmap, memory_accesses.clobbered_vops, loop->num); | |
| 1641 clvo = VEC_index (bitmap, memory_accesses.clobbered_vops, | |
| 1642 loop_outer (loop)->num); | |
| 1643 bitmap_ior_into (clvo, clvi); | |
| 1644 | |
| 1645 alrefso = VEC_index (bitmap, memory_accesses.all_refs_in_loop, | |
| 1646 loop_outer (loop)->num); | |
| 1647 bitmap_ior_into (alrefso, alrefs); | |
| 1648 } | |
| 1649 } | |
| 1650 | |
| 1651 /* Element of the hash table that maps vops to memory references. */ | |
| 1652 | |
| 1653 struct vop_to_refs_elt | |
| 1654 { | |
| 1655 /* DECL_UID of the vop. */ | |
| 1656 unsigned uid; | |
| 1657 | |
| 1658 /* List of the all references. */ | |
| 1659 bitmap refs_all; | |
| 1660 | |
| 1661 /* List of stored references. */ | |
| 1662 bitmap refs_stored; | |
| 1663 }; | |
| 1664 | |
| 1665 /* A hash function for struct vop_to_refs_elt object OBJ. */ | |
| 1666 | |
| 1667 static hashval_t | |
| 1668 vtoe_hash (const void *obj) | |
| 1669 { | |
| 1670 const struct vop_to_refs_elt *const vtoe = | |
| 1671 (const struct vop_to_refs_elt *) obj; | |
| 1672 | |
| 1673 return vtoe->uid; | |
| 1674 } | |
| 1675 | |
| 1676 /* An equality function for struct vop_to_refs_elt object OBJ1 with | |
| 1677 uid of a vop OBJ2. */ | |
| 1678 | |
| 1679 static int | |
| 1680 vtoe_eq (const void *obj1, const void *obj2) | |
| 1681 { | |
| 1682 const struct vop_to_refs_elt *const vtoe = | |
| 1683 (const struct vop_to_refs_elt *) obj1; | |
| 1684 const unsigned *const uid = (const unsigned *) obj2; | |
| 1685 | |
| 1686 return vtoe->uid == *uid; | |
| 1687 } | |
| 1688 | |
| 1689 /* A function to free the struct vop_to_refs_elt object. */ | |
| 1690 | |
| 1691 static void | |
| 1692 vtoe_free (void *obj) | |
| 1693 { | |
| 1694 struct vop_to_refs_elt *const vtoe = | |
| 1695 (struct vop_to_refs_elt *) obj; | |
| 1696 | |
| 1697 BITMAP_FREE (vtoe->refs_all); | |
| 1698 BITMAP_FREE (vtoe->refs_stored); | |
| 1699 free (vtoe); | |
| 1700 } | |
| 1701 | |
| 1702 /* Records REF to hashtable VOP_TO_REFS for the index VOP. STORED is true | |
| 1703 if the reference REF is stored. */ | |
| 1704 | |
| 1705 static void | |
| 1706 record_vop_access (htab_t vop_to_refs, unsigned vop, unsigned ref, bool stored) | |
| 1707 { | |
| 1708 void **slot = htab_find_slot_with_hash (vop_to_refs, &vop, vop, INSERT); | |
| 1709 struct vop_to_refs_elt *vtoe; | |
| 1710 | |
| 1711 if (!*slot) | |
| 1712 { | |
| 1713 vtoe = XNEW (struct vop_to_refs_elt); | |
| 1714 vtoe->uid = vop; | |
| 1715 vtoe->refs_all = BITMAP_ALLOC (NULL); | |
| 1716 vtoe->refs_stored = BITMAP_ALLOC (NULL); | |
| 1717 *slot = vtoe; | |
| 1718 } | |
| 1719 else | |
| 1720 vtoe = (struct vop_to_refs_elt *) *slot; | |
| 1721 | |
| 1722 bitmap_set_bit (vtoe->refs_all, ref); | |
| 1723 if (stored) | |
| 1724 bitmap_set_bit (vtoe->refs_stored, ref); | |
| 1725 } | |
| 1726 | |
| 1727 /* Returns the set of references that access VOP according to the table | |
| 1728 VOP_TO_REFS. */ | |
| 1729 | |
| 1730 static bitmap | |
| 1731 get_vop_accesses (htab_t vop_to_refs, unsigned vop) | |
| 1732 { | |
| 1733 struct vop_to_refs_elt *const vtoe = | |
| 1734 (struct vop_to_refs_elt *) htab_find_with_hash (vop_to_refs, &vop, vop); | |
| 1735 return vtoe->refs_all; | |
| 1736 } | |
| 1737 | |
| 1738 /* Returns the set of stores that access VOP according to the table | |
| 1739 VOP_TO_REFS. */ | |
| 1740 | |
| 1741 static bitmap | |
| 1742 get_vop_stores (htab_t vop_to_refs, unsigned vop) | |
| 1743 { | |
| 1744 struct vop_to_refs_elt *const vtoe = | |
| 1745 (struct vop_to_refs_elt *) htab_find_with_hash (vop_to_refs, &vop, vop); | |
| 1746 return vtoe->refs_stored; | |
| 1747 } | |
| 1748 | |
| 1749 /* Adds REF to mapping from virtual operands to references in LOOP. */ | |
| 1750 | |
| 1751 static void | |
| 1752 add_vop_ref_mapping (struct loop *loop, mem_ref_p ref) | |
| 1753 { | |
| 1754 htab_t map = VEC_index (htab_t, memory_accesses.vop_ref_map, loop->num); | |
| 1755 bool stored = bitmap_bit_p (ref->stored, loop->num); | |
| 1756 bitmap clobbers = VEC_index (bitmap, memory_accesses.clobbered_vops, | |
| 1757 loop->num); | |
| 1758 bitmap_iterator bi; | |
| 1759 unsigned vop; | |
| 1760 | |
| 1761 EXECUTE_IF_AND_COMPL_IN_BITMAP (ref->vops, clobbers, 0, vop, bi) | |
| 1762 { | |
| 1763 record_vop_access (map, vop, ref->id, stored); | |
| 1764 } | |
| 1765 } | |
| 1766 | |
| 1767 /* Create a mapping from virtual operands to references that touch them | |
| 1768 in LOOP. */ | |
| 1769 | |
| 1770 static void | |
| 1771 create_vop_ref_mapping_loop (struct loop *loop) | |
| 1772 { | |
| 1773 bitmap refs = VEC_index (bitmap, memory_accesses.refs_in_loop, loop->num); | |
| 1774 struct loop *sloop; | |
| 1775 bitmap_iterator bi; | |
| 1776 unsigned i; | |
| 1777 mem_ref_p ref; | |
| 1778 | |
| 1779 EXECUTE_IF_SET_IN_BITMAP (refs, 0, i, bi) | |
| 1780 { | |
| 1781 ref = VEC_index (mem_ref_p, memory_accesses.refs_list, i); | |
| 1782 for (sloop = loop; sloop != current_loops->tree_root; sloop = loop_outer (sloop)) | |
| 1783 add_vop_ref_mapping (sloop, ref); | |
| 1784 } | |
| 1785 } | |
| 1786 | |
| 1787 /* For each non-clobbered virtual operand and each loop, record the memory | |
| 1788 references in this loop that touch the operand. */ | |
| 1789 | |
| 1790 static void | |
| 1791 create_vop_ref_mapping (void) | |
| 1792 { | |
| 1793 loop_iterator li; | |
| 1794 struct loop *loop; | |
| 1795 | |
| 1796 FOR_EACH_LOOP (li, loop, 0) | |
| 1797 { | |
| 1798 create_vop_ref_mapping_loop (loop); | |
| 1799 } | |
| 1800 } | |
| 1801 | |
| 1802 /* Gathers information about memory accesses in the loops. */ | |
| 1803 | |
| 1804 static void | |
| 1805 analyze_memory_references (void) | |
| 1806 { | |
| 1807 unsigned i; | |
| 1808 bitmap empty; | |
| 1809 htab_t hempty; | |
| 1810 | |
| 1811 memory_accesses.refs | |
| 1812 = htab_create (100, memref_hash, memref_eq, memref_free); | |
| 1813 memory_accesses.refs_list = NULL; | |
| 1814 memory_accesses.refs_in_loop = VEC_alloc (bitmap, heap, | |
| 1815 number_of_loops ()); | |
| 1816 memory_accesses.all_refs_in_loop = VEC_alloc (bitmap, heap, | |
| 1817 number_of_loops ()); | |
| 1818 memory_accesses.clobbered_vops = VEC_alloc (bitmap, heap, | |
| 1819 number_of_loops ()); | |
| 1820 memory_accesses.vop_ref_map = VEC_alloc (htab_t, heap, | |
| 1821 number_of_loops ()); | |
| 1822 | |
| 1823 for (i = 0; i < number_of_loops (); i++) | |
| 1824 { | |
| 1825 empty = BITMAP_ALLOC (NULL); | |
| 1826 VEC_quick_push (bitmap, memory_accesses.refs_in_loop, empty); | |
| 1827 empty = BITMAP_ALLOC (NULL); | |
| 1828 VEC_quick_push (bitmap, memory_accesses.all_refs_in_loop, empty); | |
| 1829 empty = BITMAP_ALLOC (NULL); | |
| 1830 VEC_quick_push (bitmap, memory_accesses.clobbered_vops, empty); | |
| 1831 hempty = htab_create (10, vtoe_hash, vtoe_eq, vtoe_free); | |
| 1832 VEC_quick_push (htab_t, memory_accesses.vop_ref_map, hempty); | |
| 1833 } | |
| 1834 | |
| 1835 memory_accesses.ttae_cache = NULL; | |
| 1836 | |
| 1837 gather_mem_refs_in_loops (); | |
| 1838 create_vop_ref_mapping (); | |
| 1839 } | |
| 1840 | |
| 1841 /* Returns true if a region of size SIZE1 at position 0 and a region of | |
| 1842 size SIZE2 at position DIFF cannot overlap. */ | |
| 1843 | |
| 1844 static bool | |
| 1845 cannot_overlap_p (aff_tree *diff, double_int size1, double_int size2) | |
| 1846 { | |
| 1847 double_int d, bound; | |
| 1848 | |
| 1849 /* Unless the difference is a constant, we fail. */ | |
| 1850 if (diff->n != 0) | |
| 1851 return false; | |
| 1852 | |
| 1853 d = diff->offset; | |
| 1854 if (double_int_negative_p (d)) | |
| 1855 { | |
| 1856 /* The second object is before the first one, we succeed if the last | |
| 1857 element of the second object is before the start of the first one. */ | |
| 1858 bound = double_int_add (d, double_int_add (size2, double_int_minus_one)); | |
| 1859 return double_int_negative_p (bound); | |
| 1860 } | |
| 1861 else | |
| 1862 { | |
| 1863 /* We succeed if the second object starts after the first one ends. */ | |
| 1864 return double_int_scmp (size1, d) <= 0; | |
| 1865 } | |
| 1866 } | |
| 1867 | |
| 1868 /* Returns true if MEM1 and MEM2 may alias. TTAE_CACHE is used as a cache in | |
| 1869 tree_to_aff_combination_expand. */ | |
| 1870 | |
| 1871 static bool | |
| 1872 mem_refs_may_alias_p (tree mem1, tree mem2, struct pointer_map_t **ttae_cache) | |
| 1873 { | |
| 1874 /* Perform BASE + OFFSET analysis -- if MEM1 and MEM2 are based on the same | |
| 1875 object and their offset differ in such a way that the locations cannot | |
| 1876 overlap, then they cannot alias. */ | |
| 1877 double_int size1, size2; | |
| 1878 aff_tree off1, off2; | |
| 1879 | |
| 1880 /* Perform basic offset and type-based disambiguation. */ | |
| 1881 if (!refs_may_alias_p (mem1, mem2)) | |
| 1882 return false; | |
| 1883 | |
| 1884 /* The expansion of addresses may be a bit expensive, thus we only do | |
| 1885 the check at -O2 and higher optimization levels. */ | |
| 1886 if (optimize < 2) | |
| 1887 return true; | |
| 1888 | |
| 1889 get_inner_reference_aff (mem1, &off1, &size1); | |
| 1890 get_inner_reference_aff (mem2, &off2, &size2); | |
| 1891 aff_combination_expand (&off1, ttae_cache); | |
| 1892 aff_combination_expand (&off2, ttae_cache); | |
| 1893 aff_combination_scale (&off1, double_int_minus_one); | |
| 1894 aff_combination_add (&off2, &off1); | |
| 1895 | |
| 1896 if (cannot_overlap_p (&off2, size1, size2)) | |
| 1897 return false; | |
| 1898 | |
| 1899 return true; | |
| 1900 } | |
| 1901 | |
| 1902 /* Rewrites location LOC by TMP_VAR. */ | |
| 1903 | |
| 1904 static void | |
| 1905 rewrite_mem_ref_loc (mem_ref_loc_p loc, tree tmp_var) | |
| 1906 { | |
| 1907 mark_virtual_ops_for_renaming (loc->stmt); | |
| 1908 *loc->ref = tmp_var; | |
| 1909 update_stmt (loc->stmt); | |
| 1910 } | |
| 1911 | |
| 1912 /* Adds all locations of REF in LOOP and its subloops to LOCS. */ | |
| 1913 | |
| 1914 static void | |
| 1915 get_all_locs_in_loop (struct loop *loop, mem_ref_p ref, | |
| 1916 VEC (mem_ref_loc_p, heap) **locs) | |
| 1917 { | |
| 1918 mem_ref_locs_p accs; | |
| 1919 unsigned i; | |
| 1920 mem_ref_loc_p loc; | |
| 1921 bitmap refs = VEC_index (bitmap, memory_accesses.all_refs_in_loop, | |
| 1922 loop->num); | |
| 1923 struct loop *subloop; | |
| 1924 | |
| 1925 if (!bitmap_bit_p (refs, ref->id)) | |
| 1926 return; | |
| 1927 | |
| 1928 if (VEC_length (mem_ref_locs_p, ref->accesses_in_loop) | |
| 1929 > (unsigned) loop->num) | |
| 1930 { | |
| 1931 accs = VEC_index (mem_ref_locs_p, ref->accesses_in_loop, loop->num); | |
| 1932 if (accs) | |
| 1933 { | |
| 1934 for (i = 0; VEC_iterate (mem_ref_loc_p, accs->locs, i, loc); i++) | |
| 1935 VEC_safe_push (mem_ref_loc_p, heap, *locs, loc); | |
| 1936 } | |
| 1937 } | |
| 1938 | |
| 1939 for (subloop = loop->inner; subloop != NULL; subloop = subloop->next) | |
| 1940 get_all_locs_in_loop (subloop, ref, locs); | |
| 1941 } | |
| 1942 | |
| 1943 /* Rewrites all references to REF in LOOP by variable TMP_VAR. */ | |
| 1944 | |
| 1945 static void | |
| 1946 rewrite_mem_refs (struct loop *loop, mem_ref_p ref, tree tmp_var) | |
| 1947 { | |
| 1948 unsigned i; | |
| 1949 mem_ref_loc_p loc; | |
| 1950 VEC (mem_ref_loc_p, heap) *locs = NULL; | |
| 1951 | |
| 1952 get_all_locs_in_loop (loop, ref, &locs); | |
| 1953 for (i = 0; VEC_iterate (mem_ref_loc_p, locs, i, loc); i++) | |
| 1954 rewrite_mem_ref_loc (loc, tmp_var); | |
| 1955 VEC_free (mem_ref_loc_p, heap, locs); | |
| 1956 } | |
| 1957 | |
| 1958 /* The name and the length of the currently generated variable | |
| 1959 for lsm. */ | |
| 1960 #define MAX_LSM_NAME_LENGTH 40 | |
| 1961 static char lsm_tmp_name[MAX_LSM_NAME_LENGTH + 1]; | |
| 1962 static int lsm_tmp_name_length; | |
| 1963 | |
| 1964 /* Adds S to lsm_tmp_name. */ | |
| 1965 | |
| 1966 static void | |
| 1967 lsm_tmp_name_add (const char *s) | |
| 1968 { | |
| 1969 int l = strlen (s) + lsm_tmp_name_length; | |
| 1970 if (l > MAX_LSM_NAME_LENGTH) | |
| 1971 return; | |
| 1972 | |
| 1973 strcpy (lsm_tmp_name + lsm_tmp_name_length, s); | |
| 1974 lsm_tmp_name_length = l; | |
| 1975 } | |
| 1976 | |
| 1977 /* Stores the name for temporary variable that replaces REF to | |
| 1978 lsm_tmp_name. */ | |
| 1979 | |
| 1980 static void | |
| 1981 gen_lsm_tmp_name (tree ref) | |
| 1982 { | |
| 1983 const char *name; | |
| 1984 | |
| 1985 switch (TREE_CODE (ref)) | |
| 1986 { | |
| 1987 case MISALIGNED_INDIRECT_REF: | |
| 1988 case ALIGN_INDIRECT_REF: | |
| 1989 case INDIRECT_REF: | |
| 1990 gen_lsm_tmp_name (TREE_OPERAND (ref, 0)); | |
| 1991 lsm_tmp_name_add ("_"); | |
| 1992 break; | |
| 1993 | |
| 1994 case BIT_FIELD_REF: | |
| 1995 case VIEW_CONVERT_EXPR: | |
| 1996 case ARRAY_RANGE_REF: | |
| 1997 gen_lsm_tmp_name (TREE_OPERAND (ref, 0)); | |
| 1998 break; | |
| 1999 | |
| 2000 case REALPART_EXPR: | |
| 2001 gen_lsm_tmp_name (TREE_OPERAND (ref, 0)); | |
| 2002 lsm_tmp_name_add ("_RE"); | |
| 2003 break; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
2004 |
| 0 | 2005 case IMAGPART_EXPR: |
| 2006 gen_lsm_tmp_name (TREE_OPERAND (ref, 0)); | |
| 2007 lsm_tmp_name_add ("_IM"); | |
| 2008 break; | |
| 2009 | |
| 2010 case COMPONENT_REF: | |
| 2011 gen_lsm_tmp_name (TREE_OPERAND (ref, 0)); | |
| 2012 lsm_tmp_name_add ("_"); | |
| 2013 name = get_name (TREE_OPERAND (ref, 1)); | |
| 2014 if (!name) | |
| 2015 name = "F"; | |
| 2016 lsm_tmp_name_add (name); | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2017 break; |
| 0 | 2018 |
| 2019 case ARRAY_REF: | |
| 2020 gen_lsm_tmp_name (TREE_OPERAND (ref, 0)); | |
| 2021 lsm_tmp_name_add ("_I"); | |
| 2022 break; | |
| 2023 | |
| 2024 case SSA_NAME: | |
| 2025 ref = SSA_NAME_VAR (ref); | |
| 2026 /* Fallthru. */ | |
| 2027 | |
| 2028 case VAR_DECL: | |
| 2029 case PARM_DECL: | |
| 2030 name = get_name (ref); | |
| 2031 if (!name) | |
| 2032 name = "D"; | |
| 2033 lsm_tmp_name_add (name); | |
| 2034 break; | |
| 2035 | |
| 2036 case STRING_CST: | |
| 2037 lsm_tmp_name_add ("S"); | |
| 2038 break; | |
| 2039 | |
| 2040 case RESULT_DECL: | |
| 2041 lsm_tmp_name_add ("R"); | |
| 2042 break; | |
| 2043 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
2044 case INTEGER_CST: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
2045 /* Nothing. */ |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
2046 break; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
47
diff
changeset
|
2047 |
| 0 | 2048 default: |
| 2049 gcc_unreachable (); | |
| 2050 } | |
| 2051 } | |
| 2052 | |
| 2053 /* Determines name for temporary variable that replaces REF. | |
| 2054 The name is accumulated into the lsm_tmp_name variable. | |
| 2055 N is added to the name of the temporary. */ | |
| 2056 | |
| 2057 char * | |
| 2058 get_lsm_tmp_name (tree ref, unsigned n) | |
| 2059 { | |
| 2060 char ns[2]; | |
| 2061 | |
| 2062 lsm_tmp_name_length = 0; | |
| 2063 gen_lsm_tmp_name (ref); | |
| 2064 lsm_tmp_name_add ("_lsm"); | |
| 2065 if (n < 10) | |
| 2066 { | |
| 2067 ns[0] = '0' + n; | |
| 2068 ns[1] = 0; | |
| 2069 lsm_tmp_name_add (ns); | |
| 2070 } | |
| 2071 return lsm_tmp_name; | |
| 2072 } | |
| 2073 | |
| 2074 /* Executes store motion of memory reference REF from LOOP. | |
| 2075 Exits from the LOOP are stored in EXITS. The initialization of the | |
| 2076 temporary variable is put to the preheader of the loop, and assignments | |
| 2077 to the reference from the temporary variable are emitted to exits. */ | |
| 2078 | |
| 2079 static void | |
| 2080 execute_sm (struct loop *loop, VEC (edge, heap) *exits, mem_ref_p ref) | |
| 2081 { | |
| 2082 tree tmp_var; | |
| 2083 unsigned i; | |
| 2084 gimple load, store; | |
| 2085 struct fmt_data fmt_data; | |
| 2086 edge ex; | |
| 2087 struct lim_aux_data *lim_data; | |
| 2088 | |
| 2089 if (dump_file && (dump_flags & TDF_DETAILS)) | |
| 2090 { | |
| 2091 fprintf (dump_file, "Executing store motion of "); | |
| 2092 print_generic_expr (dump_file, ref->mem, 0); | |
| 2093 fprintf (dump_file, " from loop %d\n", loop->num); | |
| 2094 } | |
| 2095 | |
| 2096 tmp_var = make_rename_temp (TREE_TYPE (ref->mem), | |
| 2097 get_lsm_tmp_name (ref->mem, ~0)); | |
| 2098 | |
| 2099 fmt_data.loop = loop; | |
| 2100 fmt_data.orig_loop = loop; | |
| 2101 for_each_index (&ref->mem, force_move_till, &fmt_data); | |
| 2102 | |
| 2103 rewrite_mem_refs (loop, ref, tmp_var); | |
| 2104 | |
| 2105 /* Emit the load & stores. */ | |
| 2106 load = gimple_build_assign (tmp_var, unshare_expr (ref->mem)); | |
| 2107 lim_data = init_lim_data (load); | |
| 2108 lim_data->max_loop = loop; | |
| 2109 lim_data->tgt_loop = loop; | |
| 2110 | |
| 2111 /* Put this into the latch, so that we are sure it will be processed after | |
| 2112 all dependencies. */ | |
| 2113 gsi_insert_on_edge (loop_latch_edge (loop), load); | |
| 2114 | |
| 2115 for (i = 0; VEC_iterate (edge, exits, i, ex); i++) | |
| 2116 { | |
| 2117 store = gimple_build_assign (unshare_expr (ref->mem), tmp_var); | |
| 2118 gsi_insert_on_edge (ex, store); | |
| 2119 } | |
| 2120 } | |
| 2121 | |
| 2122 /* Hoists memory references MEM_REFS out of LOOP. EXITS is the list of exit | |
| 2123 edges of the LOOP. */ | |
| 2124 | |
| 2125 static void | |
| 2126 hoist_memory_references (struct loop *loop, bitmap mem_refs, | |
| 2127 VEC (edge, heap) *exits) | |
| 2128 { | |
| 2129 mem_ref_p ref; | |
| 2130 unsigned i; | |
| 2131 bitmap_iterator bi; | |
| 2132 | |
| 2133 EXECUTE_IF_SET_IN_BITMAP (mem_refs, 0, i, bi) | |
| 2134 { | |
| 2135 ref = VEC_index (mem_ref_p, memory_accesses.refs_list, i); | |
| 2136 execute_sm (loop, exits, ref); | |
| 2137 } | |
| 2138 } | |
| 2139 | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2140 /* Returns true if REF is always accessed in LOOP. If STORED_P is true |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2141 make sure REF is always stored to in LOOP. */ |
| 0 | 2142 |
| 2143 static bool | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2144 ref_always_accessed_p (struct loop *loop, mem_ref_p ref, bool stored_p) |
| 0 | 2145 { |
| 2146 VEC (mem_ref_loc_p, heap) *locs = NULL; | |
| 2147 unsigned i; | |
| 2148 mem_ref_loc_p loc; | |
| 2149 bool ret = false; | |
| 2150 struct loop *must_exec; | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2151 tree base; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2152 |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2153 base = get_base_address (ref->mem); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2154 if (INDIRECT_REF_P (base)) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2155 base = TREE_OPERAND (base, 0); |
| 0 | 2156 |
| 2157 get_all_locs_in_loop (loop, ref, &locs); | |
| 2158 for (i = 0; VEC_iterate (mem_ref_loc_p, locs, i, loc); i++) | |
| 2159 { | |
| 2160 if (!get_lim_data (loc->stmt)) | |
| 2161 continue; | |
| 2162 | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2163 /* If we require an always executed store make sure the statement |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2164 stores to the reference. */ |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2165 if (stored_p) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2166 { |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2167 tree lhs; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2168 if (!gimple_get_lhs (loc->stmt)) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2169 continue; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2170 lhs = get_base_address (gimple_get_lhs (loc->stmt)); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2171 if (!lhs) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2172 continue; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2173 if (INDIRECT_REF_P (lhs)) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2174 lhs = TREE_OPERAND (lhs, 0); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2175 if (lhs != base) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2176 continue; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2177 } |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2178 |
| 0 | 2179 must_exec = get_lim_data (loc->stmt)->always_executed_in; |
| 2180 if (!must_exec) | |
| 2181 continue; | |
| 2182 | |
| 2183 if (must_exec == loop | |
| 2184 || flow_loop_nested_p (must_exec, loop)) | |
| 2185 { | |
| 2186 ret = true; | |
| 2187 break; | |
| 2188 } | |
| 2189 } | |
| 2190 VEC_free (mem_ref_loc_p, heap, locs); | |
| 2191 | |
| 2192 return ret; | |
| 2193 } | |
| 2194 | |
| 2195 /* Returns true if REF1 and REF2 are independent. */ | |
| 2196 | |
| 2197 static bool | |
| 2198 refs_independent_p (mem_ref_p ref1, mem_ref_p ref2) | |
| 2199 { | |
| 2200 if (ref1 == ref2 | |
| 2201 || bitmap_bit_p (ref1->indep_ref, ref2->id)) | |
| 2202 return true; | |
| 2203 if (bitmap_bit_p (ref1->dep_ref, ref2->id)) | |
| 2204 return false; | |
| 2205 | |
| 2206 if (dump_file && (dump_flags & TDF_DETAILS)) | |
| 2207 fprintf (dump_file, "Querying dependency of refs %u and %u: ", | |
| 2208 ref1->id, ref2->id); | |
| 2209 | |
| 2210 if (mem_refs_may_alias_p (ref1->mem, ref2->mem, | |
| 2211 &memory_accesses.ttae_cache)) | |
| 2212 { | |
| 2213 bitmap_set_bit (ref1->dep_ref, ref2->id); | |
| 2214 bitmap_set_bit (ref2->dep_ref, ref1->id); | |
| 2215 if (dump_file && (dump_flags & TDF_DETAILS)) | |
| 2216 fprintf (dump_file, "dependent.\n"); | |
| 2217 return false; | |
| 2218 } | |
| 2219 else | |
| 2220 { | |
| 2221 bitmap_set_bit (ref1->indep_ref, ref2->id); | |
| 2222 bitmap_set_bit (ref2->indep_ref, ref1->id); | |
| 2223 if (dump_file && (dump_flags & TDF_DETAILS)) | |
| 2224 fprintf (dump_file, "independent.\n"); | |
| 2225 return true; | |
| 2226 } | |
| 2227 } | |
| 2228 | |
| 2229 /* Records the information whether REF is independent in LOOP (according | |
| 2230 to INDEP). */ | |
| 2231 | |
| 2232 static void | |
| 2233 record_indep_loop (struct loop *loop, mem_ref_p ref, bool indep) | |
| 2234 { | |
| 2235 if (indep) | |
| 2236 bitmap_set_bit (ref->indep_loop, loop->num); | |
| 2237 else | |
| 2238 bitmap_set_bit (ref->dep_loop, loop->num); | |
| 2239 } | |
| 2240 | |
| 2241 /* Returns true if REF is independent on all other memory references in | |
| 2242 LOOP. */ | |
| 2243 | |
| 2244 static bool | |
| 2245 ref_indep_loop_p_1 (struct loop *loop, mem_ref_p ref) | |
| 2246 { | |
| 2247 bitmap clobbers, refs_to_check, refs; | |
| 2248 unsigned i; | |
| 2249 bitmap_iterator bi; | |
| 2250 bool ret = true, stored = bitmap_bit_p (ref->stored, loop->num); | |
| 2251 htab_t map; | |
| 2252 mem_ref_p aref; | |
| 2253 | |
| 2254 /* If the reference is clobbered, it is not independent. */ | |
| 2255 clobbers = VEC_index (bitmap, memory_accesses.clobbered_vops, loop->num); | |
| 2256 if (bitmap_intersect_p (ref->vops, clobbers)) | |
| 2257 return false; | |
| 2258 | |
| 2259 refs_to_check = BITMAP_ALLOC (NULL); | |
| 2260 | |
| 2261 map = VEC_index (htab_t, memory_accesses.vop_ref_map, loop->num); | |
| 2262 EXECUTE_IF_AND_COMPL_IN_BITMAP (ref->vops, clobbers, 0, i, bi) | |
| 2263 { | |
| 2264 if (stored) | |
| 2265 refs = get_vop_accesses (map, i); | |
| 2266 else | |
| 2267 refs = get_vop_stores (map, i); | |
| 2268 | |
| 2269 bitmap_ior_into (refs_to_check, refs); | |
| 2270 } | |
| 2271 | |
| 2272 EXECUTE_IF_SET_IN_BITMAP (refs_to_check, 0, i, bi) | |
| 2273 { | |
| 2274 aref = VEC_index (mem_ref_p, memory_accesses.refs_list, i); | |
| 2275 if (!refs_independent_p (ref, aref)) | |
| 2276 { | |
| 2277 ret = false; | |
| 2278 record_indep_loop (loop, aref, false); | |
| 2279 break; | |
| 2280 } | |
| 2281 } | |
| 2282 | |
| 2283 BITMAP_FREE (refs_to_check); | |
| 2284 return ret; | |
| 2285 } | |
| 2286 | |
| 2287 /* Returns true if REF is independent on all other memory references in | |
| 2288 LOOP. Wrapper over ref_indep_loop_p_1, caching its results. */ | |
| 2289 | |
| 2290 static bool | |
| 2291 ref_indep_loop_p (struct loop *loop, mem_ref_p ref) | |
| 2292 { | |
| 2293 bool ret; | |
| 2294 | |
| 2295 if (bitmap_bit_p (ref->indep_loop, loop->num)) | |
| 2296 return true; | |
| 2297 if (bitmap_bit_p (ref->dep_loop, loop->num)) | |
| 2298 return false; | |
| 2299 | |
| 2300 ret = ref_indep_loop_p_1 (loop, ref); | |
| 2301 | |
| 2302 if (dump_file && (dump_flags & TDF_DETAILS)) | |
| 2303 fprintf (dump_file, "Querying dependencies of ref %u in loop %d: %s\n", | |
| 2304 ref->id, loop->num, ret ? "independent" : "dependent"); | |
| 2305 | |
| 2306 record_indep_loop (loop, ref, ret); | |
| 2307 | |
| 2308 return ret; | |
| 2309 } | |
| 2310 | |
| 2311 /* Returns true if we can perform store motion of REF from LOOP. */ | |
| 2312 | |
| 2313 static bool | |
| 2314 can_sm_ref_p (struct loop *loop, mem_ref_p ref) | |
| 2315 { | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2316 tree base; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2317 |
| 0 | 2318 /* Unless the reference is stored in the loop, there is nothing to do. */ |
| 2319 if (!bitmap_bit_p (ref->stored, loop->num)) | |
| 2320 return false; | |
| 2321 | |
| 2322 /* It should be movable. */ | |
| 2323 if (!is_gimple_reg_type (TREE_TYPE (ref->mem)) | |
| 2324 || TREE_THIS_VOLATILE (ref->mem) | |
| 2325 || !for_each_index (&ref->mem, may_move_till, loop)) | |
| 2326 return false; | |
| 2327 | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2328 /* If it can trap, it must be always executed in LOOP. |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2329 Readonly memory locations may trap when storing to them, but |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2330 tree_could_trap_p is a predicate for rvalues, so check that |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2331 explicitly. */ |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2332 base = get_base_address (ref->mem); |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2333 if ((tree_could_trap_p (ref->mem) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2334 || (DECL_P (base) && TREE_READONLY (base))) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2335 && !ref_always_accessed_p (loop, ref, true)) |
| 0 | 2336 return false; |
| 2337 | |
| 2338 /* And it must be independent on all other memory references | |
| 2339 in LOOP. */ | |
| 2340 if (!ref_indep_loop_p (loop, ref)) | |
| 2341 return false; | |
| 2342 | |
| 2343 return true; | |
| 2344 } | |
| 2345 | |
| 2346 /* Marks the references in LOOP for that store motion should be performed | |
| 2347 in REFS_TO_SM. SM_EXECUTED is the set of references for that store | |
| 2348 motion was performed in one of the outer loops. */ | |
| 2349 | |
| 2350 static void | |
| 2351 find_refs_for_sm (struct loop *loop, bitmap sm_executed, bitmap refs_to_sm) | |
| 2352 { | |
| 2353 bitmap refs = VEC_index (bitmap, memory_accesses.all_refs_in_loop, | |
| 2354 loop->num); | |
| 2355 unsigned i; | |
| 2356 bitmap_iterator bi; | |
| 2357 mem_ref_p ref; | |
| 2358 | |
| 2359 EXECUTE_IF_AND_COMPL_IN_BITMAP (refs, sm_executed, 0, i, bi) | |
| 2360 { | |
| 2361 ref = VEC_index (mem_ref_p, memory_accesses.refs_list, i); | |
| 2362 if (can_sm_ref_p (loop, ref)) | |
| 2363 bitmap_set_bit (refs_to_sm, i); | |
| 2364 } | |
| 2365 } | |
| 2366 | |
| 2367 /* Checks whether LOOP (with exits stored in EXITS array) is suitable | |
| 2368 for a store motion optimization (i.e. whether we can insert statement | |
| 2369 on its exits). */ | |
| 2370 | |
| 2371 static bool | |
| 2372 loop_suitable_for_sm (struct loop *loop ATTRIBUTE_UNUSED, | |
| 2373 VEC (edge, heap) *exits) | |
| 2374 { | |
| 2375 unsigned i; | |
| 2376 edge ex; | |
| 2377 | |
| 2378 for (i = 0; VEC_iterate (edge, exits, i, ex); i++) | |
| 2379 if (ex->flags & EDGE_ABNORMAL) | |
| 2380 return false; | |
| 2381 | |
| 2382 return true; | |
| 2383 } | |
| 2384 | |
| 2385 /* Try to perform store motion for all memory references modified inside | |
| 2386 LOOP. SM_EXECUTED is the bitmap of the memory references for that | |
| 2387 store motion was executed in one of the outer loops. */ | |
| 2388 | |
| 2389 static void | |
| 2390 store_motion_loop (struct loop *loop, bitmap sm_executed) | |
| 2391 { | |
| 2392 VEC (edge, heap) *exits = get_loop_exit_edges (loop); | |
| 2393 struct loop *subloop; | |
| 2394 bitmap sm_in_loop = BITMAP_ALLOC (NULL); | |
| 2395 | |
| 2396 if (loop_suitable_for_sm (loop, exits)) | |
| 2397 { | |
| 2398 find_refs_for_sm (loop, sm_executed, sm_in_loop); | |
| 2399 hoist_memory_references (loop, sm_in_loop, exits); | |
| 2400 } | |
| 2401 VEC_free (edge, heap, exits); | |
| 2402 | |
| 2403 bitmap_ior_into (sm_executed, sm_in_loop); | |
| 2404 for (subloop = loop->inner; subloop != NULL; subloop = subloop->next) | |
| 2405 store_motion_loop (subloop, sm_executed); | |
| 2406 bitmap_and_compl_into (sm_executed, sm_in_loop); | |
| 2407 BITMAP_FREE (sm_in_loop); | |
| 2408 } | |
| 2409 | |
| 2410 /* Try to perform store motion for all memory references modified inside | |
| 2411 loops. */ | |
| 2412 | |
| 2413 static void | |
| 2414 store_motion (void) | |
| 2415 { | |
| 2416 struct loop *loop; | |
| 2417 bitmap sm_executed = BITMAP_ALLOC (NULL); | |
| 2418 | |
| 2419 for (loop = current_loops->tree_root->inner; loop != NULL; loop = loop->next) | |
| 2420 store_motion_loop (loop, sm_executed); | |
| 2421 | |
| 2422 BITMAP_FREE (sm_executed); | |
| 2423 gsi_commit_edge_inserts (); | |
| 2424 } | |
| 2425 | |
| 2426 /* Fills ALWAYS_EXECUTED_IN information for basic blocks of LOOP, i.e. | |
| 2427 for each such basic block bb records the outermost loop for that execution | |
| 2428 of its header implies execution of bb. CONTAINS_CALL is the bitmap of | |
| 2429 blocks that contain a nonpure call. */ | |
| 2430 | |
| 2431 static void | |
| 2432 fill_always_executed_in (struct loop *loop, sbitmap contains_call) | |
| 2433 { | |
| 2434 basic_block bb = NULL, *bbs, last = NULL; | |
| 2435 unsigned i; | |
| 2436 edge e; | |
| 2437 struct loop *inn_loop = loop; | |
| 2438 | |
| 2439 if (!loop->header->aux) | |
| 2440 { | |
| 2441 bbs = get_loop_body_in_dom_order (loop); | |
| 2442 | |
| 2443 for (i = 0; i < loop->num_nodes; i++) | |
| 2444 { | |
| 2445 edge_iterator ei; | |
| 2446 bb = bbs[i]; | |
| 2447 | |
| 2448 if (dominated_by_p (CDI_DOMINATORS, loop->latch, bb)) | |
| 2449 last = bb; | |
| 2450 | |
| 2451 if (TEST_BIT (contains_call, bb->index)) | |
| 2452 break; | |
| 2453 | |
| 2454 FOR_EACH_EDGE (e, ei, bb->succs) | |
| 2455 if (!flow_bb_inside_loop_p (loop, e->dest)) | |
| 2456 break; | |
| 2457 if (e) | |
| 2458 break; | |
| 2459 | |
| 2460 /* A loop might be infinite (TODO use simple loop analysis | |
| 2461 to disprove this if possible). */ | |
| 2462 if (bb->flags & BB_IRREDUCIBLE_LOOP) | |
| 2463 break; | |
| 2464 | |
| 2465 if (!flow_bb_inside_loop_p (inn_loop, bb)) | |
| 2466 break; | |
| 2467 | |
| 2468 if (bb->loop_father->header == bb) | |
| 2469 { | |
| 2470 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, bb)) | |
| 2471 break; | |
| 2472 | |
| 2473 /* In a loop that is always entered we may proceed anyway. | |
| 2474 But record that we entered it and stop once we leave it. */ | |
| 2475 inn_loop = bb->loop_father; | |
| 2476 } | |
| 2477 } | |
| 2478 | |
| 2479 while (1) | |
| 2480 { | |
| 2481 last->aux = loop; | |
| 2482 if (last == loop->header) | |
| 2483 break; | |
| 2484 last = get_immediate_dominator (CDI_DOMINATORS, last); | |
| 2485 } | |
| 2486 | |
| 2487 free (bbs); | |
| 2488 } | |
| 2489 | |
| 2490 for (loop = loop->inner; loop; loop = loop->next) | |
| 2491 fill_always_executed_in (loop, contains_call); | |
| 2492 } | |
| 2493 | |
| 2494 /* Compute the global information needed by the loop invariant motion pass. */ | |
| 2495 | |
| 2496 static void | |
| 2497 tree_ssa_lim_initialize (void) | |
| 2498 { | |
| 2499 sbitmap contains_call = sbitmap_alloc (last_basic_block); | |
| 2500 gimple_stmt_iterator bsi; | |
| 2501 struct loop *loop; | |
| 2502 basic_block bb; | |
| 2503 | |
| 2504 sbitmap_zero (contains_call); | |
| 2505 FOR_EACH_BB (bb) | |
| 2506 { | |
| 2507 for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi)) | |
| 2508 { | |
| 2509 if (nonpure_call_p (gsi_stmt (bsi))) | |
| 2510 break; | |
| 2511 } | |
| 2512 | |
| 2513 if (!gsi_end_p (bsi)) | |
| 2514 SET_BIT (contains_call, bb->index); | |
| 2515 } | |
| 2516 | |
| 2517 for (loop = current_loops->tree_root->inner; loop; loop = loop->next) | |
| 2518 fill_always_executed_in (loop, contains_call); | |
| 2519 | |
| 2520 sbitmap_free (contains_call); | |
| 2521 | |
| 2522 lim_aux_data_map = pointer_map_create (); | |
| 2523 } | |
| 2524 | |
| 2525 /* Cleans up after the invariant motion pass. */ | |
| 2526 | |
| 2527 static void | |
| 2528 tree_ssa_lim_finalize (void) | |
| 2529 { | |
| 2530 basic_block bb; | |
| 2531 unsigned i; | |
| 2532 bitmap b; | |
| 2533 htab_t h; | |
| 2534 | |
| 2535 FOR_EACH_BB (bb) | |
| 2536 { | |
| 2537 bb->aux = NULL; | |
| 2538 } | |
| 2539 | |
| 2540 pointer_map_destroy (lim_aux_data_map); | |
| 2541 | |
| 2542 VEC_free (mem_ref_p, heap, memory_accesses.refs_list); | |
| 2543 htab_delete (memory_accesses.refs); | |
| 2544 | |
| 2545 for (i = 0; VEC_iterate (bitmap, memory_accesses.refs_in_loop, i, b); i++) | |
| 2546 BITMAP_FREE (b); | |
| 2547 VEC_free (bitmap, heap, memory_accesses.refs_in_loop); | |
| 2548 | |
| 2549 for (i = 0; VEC_iterate (bitmap, memory_accesses.all_refs_in_loop, i, b); i++) | |
| 2550 BITMAP_FREE (b); | |
| 2551 VEC_free (bitmap, heap, memory_accesses.all_refs_in_loop); | |
| 2552 | |
| 2553 for (i = 0; VEC_iterate (bitmap, memory_accesses.clobbered_vops, i, b); i++) | |
| 2554 BITMAP_FREE (b); | |
| 2555 VEC_free (bitmap, heap, memory_accesses.clobbered_vops); | |
| 2556 | |
| 2557 for (i = 0; VEC_iterate (htab_t, memory_accesses.vop_ref_map, i, h); i++) | |
| 2558 htab_delete (h); | |
| 2559 VEC_free (htab_t, heap, memory_accesses.vop_ref_map); | |
| 2560 | |
| 2561 if (memory_accesses.ttae_cache) | |
| 2562 pointer_map_destroy (memory_accesses.ttae_cache); | |
| 2563 } | |
| 2564 | |
| 2565 /* Moves invariants from loops. Only "expensive" invariants are moved out -- | |
| 2566 i.e. those that are likely to be win regardless of the register pressure. */ | |
| 2567 | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2568 unsigned int |
| 0 | 2569 tree_ssa_lim (void) |
| 2570 { | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2571 unsigned int todo; |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2572 |
| 0 | 2573 tree_ssa_lim_initialize (); |
| 2574 | |
| 2575 /* Gathers information about memory accesses in the loops. */ | |
| 2576 analyze_memory_references (); | |
| 2577 | |
| 2578 /* For each statement determine the outermost loop in that it is | |
| 2579 invariant and cost for computing the invariant. */ | |
| 2580 determine_invariantness (); | |
| 2581 | |
| 2582 /* Execute store motion. Force the necessary invariants to be moved | |
| 2583 out of the loops as well. */ | |
| 2584 store_motion (); | |
| 2585 | |
| 2586 /* Move the expressions that are expensive enough. */ | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2587 todo = move_computations (); |
| 0 | 2588 |
| 2589 tree_ssa_lim_finalize (); | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2590 |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2591 return todo; |
| 0 | 2592 } |