Mercurial > hg > CbC > CbC_gcc
annotate gcc/cfghooks.c @ 116:367f9f4f266e
fix gimple.h
| author | mir3636 |
|---|---|
| date | Tue, 28 Nov 2017 20:22:01 +0900 |
| parents | 04ced10e8804 |
| children | 84e7813d76e9 |
| rev | line source |
|---|---|
| 0 | 1 /* Hooks for cfg representation specific functions. |
| 111 | 2 Copyright (C) 2003-2017 Free Software Foundation, Inc. |
| 0 | 3 Contributed by Sebastian Pop <s.pop@laposte.net> |
| 4 | |
| 5 This file is part of GCC. | |
| 6 | |
| 7 GCC is free software; you can redistribute it and/or modify | |
| 8 it under the terms of the GNU General Public License as published by | |
| 9 the Free Software Foundation; either version 3, or (at your option) | |
| 10 any later version. | |
| 11 | |
| 12 GCC is distributed in the hope that it will be useful, | |
| 13 but WITHOUT ANY WARRANTY; without even the implied warranty of | |
| 14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
| 15 GNU General Public License for more details. | |
| 16 | |
| 17 You should have received a copy of the GNU General Public License | |
| 18 along with GCC; see the file COPYING3. If not see | |
| 19 <http://www.gnu.org/licenses/>. */ | |
| 20 | |
| 21 #include "config.h" | |
| 22 #include "system.h" | |
| 23 #include "coretypes.h" | |
| 111 | 24 #include "backend.h" |
| 0 | 25 #include "rtl.h" |
| 111 | 26 #include "cfghooks.h" |
| 0 | 27 #include "timevar.h" |
| 111 | 28 #include "pretty-print.h" |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
29 #include "diagnostic-core.h" |
| 111 | 30 #include "dumpfile.h" |
| 31 #include "cfganal.h" | |
| 32 #include "tree-ssa.h" | |
| 0 | 33 #include "cfgloop.h" |
| 34 | |
| 35 /* A pointer to one of the hooks containers. */ | |
| 36 static struct cfg_hooks *cfg_hooks; | |
| 37 | |
| 38 /* Initialization of functions specific to the rtl IR. */ | |
| 39 void | |
| 40 rtl_register_cfg_hooks (void) | |
| 41 { | |
| 42 cfg_hooks = &rtl_cfg_hooks; | |
| 43 } | |
| 44 | |
| 45 /* Initialization of functions specific to the rtl IR. */ | |
| 46 void | |
| 47 cfg_layout_rtl_register_cfg_hooks (void) | |
| 48 { | |
| 49 cfg_hooks = &cfg_layout_rtl_cfg_hooks; | |
| 50 } | |
| 51 | |
| 52 /* Initialization of functions specific to the tree IR. */ | |
| 53 | |
| 54 void | |
| 55 gimple_register_cfg_hooks (void) | |
| 56 { | |
| 57 cfg_hooks = &gimple_cfg_hooks; | |
| 58 } | |
| 59 | |
| 60 struct cfg_hooks | |
| 61 get_cfg_hooks (void) | |
| 62 { | |
| 63 return *cfg_hooks; | |
| 64 } | |
| 65 | |
| 66 void | |
| 67 set_cfg_hooks (struct cfg_hooks new_cfg_hooks) | |
| 68 { | |
| 69 *cfg_hooks = new_cfg_hooks; | |
| 70 } | |
| 71 | |
| 72 /* Returns current ir type. */ | |
| 73 | |
| 74 enum ir_type | |
| 75 current_ir_type (void) | |
| 76 { | |
| 77 if (cfg_hooks == &gimple_cfg_hooks) | |
| 78 return IR_GIMPLE; | |
| 79 else if (cfg_hooks == &rtl_cfg_hooks) | |
| 80 return IR_RTL_CFGRTL; | |
| 81 else if (cfg_hooks == &cfg_layout_rtl_cfg_hooks) | |
| 82 return IR_RTL_CFGLAYOUT; | |
| 83 else | |
| 84 gcc_unreachable (); | |
| 85 } | |
| 86 | |
| 87 /* Verify the CFG consistency. | |
| 88 | |
| 89 Currently it does following: checks edge and basic block list correctness | |
| 90 and calls into IL dependent checking then. */ | |
| 91 | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
92 DEBUG_FUNCTION void |
| 0 | 93 verify_flow_info (void) |
| 94 { | |
| 95 size_t *edge_checksum; | |
| 96 int err = 0; | |
| 97 basic_block bb, last_bb_seen; | |
| 98 basic_block *last_visited; | |
| 99 | |
| 100 timevar_push (TV_CFG_VERIFY); | |
| 111 | 101 last_visited = XCNEWVEC (basic_block, last_basic_block_for_fn (cfun)); |
| 102 edge_checksum = XCNEWVEC (size_t, last_basic_block_for_fn (cfun)); | |
| 0 | 103 |
| 104 /* Check bb chain & numbers. */ | |
| 111 | 105 last_bb_seen = ENTRY_BLOCK_PTR_FOR_FN (cfun); |
| 106 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb, NULL, next_bb) | |
| 0 | 107 { |
| 111 | 108 if (bb != EXIT_BLOCK_PTR_FOR_FN (cfun) |
| 109 && bb != BASIC_BLOCK_FOR_FN (cfun, bb->index)) | |
| 0 | 110 { |
| 111 error ("bb %d on wrong place", bb->index); | |
| 112 err = 1; | |
| 113 } | |
| 114 | |
| 115 if (bb->prev_bb != last_bb_seen) | |
| 116 { | |
| 117 error ("prev_bb of %d should be %d, not %d", | |
| 118 bb->index, last_bb_seen->index, bb->prev_bb->index); | |
| 119 err = 1; | |
| 120 } | |
| 121 | |
| 122 last_bb_seen = bb; | |
| 123 } | |
| 124 | |
| 125 /* Now check the basic blocks (boundaries etc.) */ | |
| 111 | 126 FOR_EACH_BB_REVERSE_FN (bb, cfun) |
| 0 | 127 { |
| 128 int n_fallthru = 0; | |
| 129 edge e; | |
| 130 edge_iterator ei; | |
| 131 | |
| 132 if (bb->loop_father != NULL && current_loops == NULL) | |
| 133 { | |
| 134 error ("verify_flow_info: Block %i has loop_father, but there are no loops", | |
| 135 bb->index); | |
| 136 err = 1; | |
| 137 } | |
| 138 if (bb->loop_father == NULL && current_loops != NULL) | |
| 139 { | |
| 140 error ("verify_flow_info: Block %i lacks loop_father", bb->index); | |
| 141 err = 1; | |
| 142 } | |
| 143 | |
| 111 | 144 if (!bb->count.verify ()) |
| 0 | 145 { |
| 111 | 146 error ("verify_flow_info: Wrong count of block %i", bb->index); |
| 0 | 147 err = 1; |
| 148 } | |
| 149 if (bb->frequency < 0) | |
| 150 { | |
| 151 error ("verify_flow_info: Wrong frequency of block %i %i", | |
| 152 bb->index, bb->frequency); | |
| 153 err = 1; | |
| 154 } | |
| 111 | 155 |
| 0 | 156 FOR_EACH_EDGE (e, ei, bb->succs) |
| 157 { | |
| 158 if (last_visited [e->dest->index] == bb) | |
| 159 { | |
| 160 error ("verify_flow_info: Duplicate edge %i->%i", | |
| 161 e->src->index, e->dest->index); | |
| 162 err = 1; | |
| 163 } | |
| 111 | 164 /* FIXME: Graphite and SLJL and target code still tends to produce |
| 165 edges with no probablity. */ | |
| 166 if (profile_status_for_fn (cfun) >= PROFILE_GUESSED | |
| 167 && !e->probability.initialized_p () && 0) | |
| 0 | 168 { |
| 111 | 169 error ("Uninitialized probability of edge %i->%i", e->src->index, |
| 170 e->dest->index); | |
| 0 | 171 err = 1; |
| 172 } | |
| 111 | 173 if (!e->probability.verify ()) |
| 0 | 174 { |
| 111 | 175 error ("verify_flow_info: Wrong probability of edge %i->%i", |
| 176 e->src->index, e->dest->index); | |
| 0 | 177 err = 1; |
| 178 } | |
| 179 | |
| 180 last_visited [e->dest->index] = bb; | |
| 181 | |
| 182 if (e->flags & EDGE_FALLTHRU) | |
| 183 n_fallthru++; | |
| 184 | |
| 185 if (e->src != bb) | |
| 186 { | |
| 187 error ("verify_flow_info: Basic block %d succ edge is corrupted", | |
| 188 bb->index); | |
| 189 fprintf (stderr, "Predecessor: "); | |
| 111 | 190 dump_edge_info (stderr, e, TDF_DETAILS, 0); |
| 0 | 191 fprintf (stderr, "\nSuccessor: "); |
| 111 | 192 dump_edge_info (stderr, e, TDF_DETAILS, 1); |
| 0 | 193 fprintf (stderr, "\n"); |
| 194 err = 1; | |
| 195 } | |
| 196 | |
| 197 edge_checksum[e->dest->index] += (size_t) e; | |
| 198 } | |
| 199 if (n_fallthru > 1) | |
| 200 { | |
| 201 error ("wrong amount of branch edges after unconditional jump %i", bb->index); | |
| 202 err = 1; | |
| 203 } | |
| 204 | |
| 205 FOR_EACH_EDGE (e, ei, bb->preds) | |
| 206 { | |
| 207 if (e->dest != bb) | |
| 208 { | |
| 209 error ("basic block %d pred edge is corrupted", bb->index); | |
| 210 fputs ("Predecessor: ", stderr); | |
| 111 | 211 dump_edge_info (stderr, e, TDF_DETAILS, 0); |
| 0 | 212 fputs ("\nSuccessor: ", stderr); |
| 111 | 213 dump_edge_info (stderr, e, TDF_DETAILS, 1); |
| 0 | 214 fputc ('\n', stderr); |
| 215 err = 1; | |
| 216 } | |
| 217 | |
| 218 if (ei.index != e->dest_idx) | |
| 219 { | |
| 220 error ("basic block %d pred edge is corrupted", bb->index); | |
| 221 error ("its dest_idx should be %d, not %d", | |
| 222 ei.index, e->dest_idx); | |
| 223 fputs ("Predecessor: ", stderr); | |
| 111 | 224 dump_edge_info (stderr, e, TDF_DETAILS, 0); |
| 0 | 225 fputs ("\nSuccessor: ", stderr); |
| 111 | 226 dump_edge_info (stderr, e, TDF_DETAILS, 1); |
| 0 | 227 fputc ('\n', stderr); |
| 228 err = 1; | |
| 229 } | |
| 230 | |
| 231 edge_checksum[e->dest->index] -= (size_t) e; | |
| 232 } | |
| 233 } | |
| 234 | |
| 235 /* Complete edge checksumming for ENTRY and EXIT. */ | |
| 236 { | |
| 237 edge e; | |
| 238 edge_iterator ei; | |
| 239 | |
| 111 | 240 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs) |
| 0 | 241 edge_checksum[e->dest->index] += (size_t) e; |
| 242 | |
| 111 | 243 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR_FOR_FN (cfun)->preds) |
| 0 | 244 edge_checksum[e->dest->index] -= (size_t) e; |
| 245 } | |
| 246 | |
| 111 | 247 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), NULL, next_bb) |
| 0 | 248 if (edge_checksum[bb->index]) |
| 249 { | |
| 250 error ("basic block %i edge lists are corrupted", bb->index); | |
| 251 err = 1; | |
| 252 } | |
| 253 | |
| 111 | 254 last_bb_seen = ENTRY_BLOCK_PTR_FOR_FN (cfun); |
| 0 | 255 |
| 256 /* Clean up. */ | |
| 257 free (last_visited); | |
| 258 free (edge_checksum); | |
| 259 | |
| 260 if (cfg_hooks->verify_flow_info) | |
| 261 err |= cfg_hooks->verify_flow_info (); | |
| 262 if (err) | |
| 263 internal_error ("verify_flow_info failed"); | |
| 264 timevar_pop (TV_CFG_VERIFY); | |
| 265 } | |
| 266 | |
| 111 | 267 /* Print out one basic block BB to file OUTF. INDENT is printed at the |
| 268 start of each new line. FLAGS are the TDF_* flags in dumpfile.h. | |
| 269 | |
| 270 This function takes care of the purely graph related information. | |
| 271 The cfg hook for the active representation should dump | |
| 272 representation-specific information. */ | |
| 0 | 273 |
| 274 void | |
| 111 | 275 dump_bb (FILE *outf, basic_block bb, int indent, dump_flags_t flags) |
| 0 | 276 { |
| 111 | 277 if (flags & TDF_BLOCKS) |
| 278 dump_bb_info (outf, bb, indent, flags, true, false); | |
| 279 if (cfg_hooks->dump_bb) | |
| 280 cfg_hooks->dump_bb (outf, bb, indent, flags); | |
| 281 if (flags & TDF_BLOCKS) | |
| 282 dump_bb_info (outf, bb, indent, flags, false, true); | |
| 283 fputc ('\n', outf); | |
| 284 } | |
| 0 | 285 |
| 111 | 286 DEBUG_FUNCTION void |
| 287 debug (basic_block_def &ref) | |
| 288 { | |
| 289 dump_bb (stderr, &ref, 0, 0); | |
| 290 } | |
| 0 | 291 |
| 111 | 292 DEBUG_FUNCTION void |
| 293 debug (basic_block_def *ptr) | |
| 294 { | |
| 295 if (ptr) | |
| 296 debug (*ptr); | |
| 0 | 297 else |
| 111 | 298 fprintf (stderr, "<nil>\n"); |
| 299 } | |
| 300 | |
| 301 | |
| 302 /* Dumps basic block BB to pretty-printer PP, for use as a label of | |
| 303 a DOT graph record-node. The implementation of this hook is | |
| 304 expected to write the label to the stream that is attached to PP. | |
| 305 Field separators between instructions are pipe characters printed | |
| 306 verbatim. Instructions should be written with some characters | |
| 307 escaped, using pp_write_text_as_dot_label_to_stream(). */ | |
| 0 | 308 |
| 111 | 309 void |
| 310 dump_bb_for_graph (pretty_printer *pp, basic_block bb) | |
| 311 { | |
| 312 if (!cfg_hooks->dump_bb_for_graph) | |
| 313 internal_error ("%s does not support dump_bb_for_graph", | |
| 314 cfg_hooks->name); | |
| 315 /* TODO: Add pretty printer for counter. */ | |
| 316 if (bb->count.initialized_p ()) | |
| 317 pp_printf (pp, "COUNT:" "%" PRId64, bb->count.to_gcov_type ()); | |
| 318 pp_printf (pp, " FREQ:%i |", bb->frequency); | |
| 319 pp_write_text_to_stream (pp); | |
| 320 if (!(dump_flags & TDF_SLIM)) | |
| 321 cfg_hooks->dump_bb_for_graph (pp, bb); | |
| 322 } | |
| 0 | 323 |
| 111 | 324 /* Dump the complete CFG to FILE. FLAGS are the TDF_* flags in dumpfile.h. */ |
| 325 void | |
| 326 dump_flow_info (FILE *file, dump_flags_t flags) | |
| 327 { | |
| 328 basic_block bb; | |
| 0 | 329 |
| 111 | 330 fprintf (file, "\n%d basic blocks, %d edges.\n", n_basic_blocks_for_fn (cfun), |
| 331 n_edges_for_fn (cfun)); | |
| 332 FOR_ALL_BB_FN (bb, cfun) | |
| 333 dump_bb (file, bb, 0, flags); | |
| 334 | |
| 335 putc ('\n', file); | |
| 336 } | |
| 337 | |
| 338 /* Like above, but dump to stderr. To be called from debuggers. */ | |
| 339 void debug_flow_info (void); | |
| 340 DEBUG_FUNCTION void | |
| 341 debug_flow_info (void) | |
| 342 { | |
| 343 dump_flow_info (stderr, TDF_DETAILS); | |
| 0 | 344 } |
| 345 | |
| 346 /* Redirect edge E to the given basic block DEST and update underlying program | |
| 347 representation. Returns edge representing redirected branch (that may not | |
| 348 be equivalent to E in the case of duplicate edges being removed) or NULL | |
| 349 if edge is not easily redirectable for whatever reason. */ | |
| 350 | |
| 351 edge | |
| 352 redirect_edge_and_branch (edge e, basic_block dest) | |
| 353 { | |
| 354 edge ret; | |
| 355 | |
| 356 if (!cfg_hooks->redirect_edge_and_branch) | |
| 357 internal_error ("%s does not support redirect_edge_and_branch", | |
| 358 cfg_hooks->name); | |
| 359 | |
| 360 ret = cfg_hooks->redirect_edge_and_branch (e, dest); | |
| 361 | |
| 362 /* If RET != E, then either the redirection failed, or the edge E | |
| 363 was removed since RET already lead to the same destination. */ | |
| 364 if (current_loops != NULL && ret == e) | |
| 365 rescan_loop_exit (e, false, false); | |
| 366 | |
| 367 return ret; | |
| 368 } | |
| 369 | |
| 370 /* Returns true if it is possible to remove the edge E by redirecting it | |
| 371 to the destination of the other edge going from its source. */ | |
| 372 | |
| 373 bool | |
| 374 can_remove_branch_p (const_edge e) | |
| 375 { | |
| 376 if (!cfg_hooks->can_remove_branch_p) | |
| 377 internal_error ("%s does not support can_remove_branch_p", | |
| 378 cfg_hooks->name); | |
| 379 | |
| 380 if (EDGE_COUNT (e->src->succs) != 2) | |
| 381 return false; | |
| 382 | |
| 383 return cfg_hooks->can_remove_branch_p (e); | |
| 384 } | |
| 385 | |
| 386 /* Removes E, by redirecting it to the destination of the other edge going | |
| 387 from its source. Can_remove_branch_p must be true for E, hence this | |
| 388 operation cannot fail. */ | |
| 389 | |
| 390 void | |
| 391 remove_branch (edge e) | |
| 392 { | |
| 393 edge other; | |
| 394 basic_block src = e->src; | |
| 395 int irr; | |
| 396 | |
| 397 gcc_assert (EDGE_COUNT (e->src->succs) == 2); | |
| 398 | |
| 399 other = EDGE_SUCC (src, EDGE_SUCC (src, 0) == e); | |
| 400 irr = other->flags & EDGE_IRREDUCIBLE_LOOP; | |
| 401 | |
| 402 e = redirect_edge_and_branch (e, other->dest); | |
| 403 gcc_assert (e != NULL); | |
| 404 | |
| 405 e->flags &= ~EDGE_IRREDUCIBLE_LOOP; | |
| 406 e->flags |= irr; | |
| 407 } | |
| 408 | |
| 409 /* Removes edge E from cfg. Unlike remove_branch, it does not update IL. */ | |
| 410 | |
| 411 void | |
| 412 remove_edge (edge e) | |
| 413 { | |
| 414 if (current_loops != NULL) | |
| 111 | 415 { |
| 416 rescan_loop_exit (e, false, true); | |
| 417 | |
| 418 /* Removal of an edge inside an irreducible region or which leads | |
| 419 to an irreducible region can turn the region into a natural loop. | |
| 420 In that case, ask for the loop structure fixups. | |
| 421 | |
| 422 FIXME: Note that LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS is not always | |
| 423 set, so always ask for fixups when removing an edge in that case. */ | |
| 424 if (!loops_state_satisfies_p (LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS) | |
| 425 || (e->flags & EDGE_IRREDUCIBLE_LOOP) | |
| 426 || (e->dest->flags & BB_IRREDUCIBLE_LOOP)) | |
| 427 loops_state_set (LOOPS_NEED_FIXUP); | |
| 428 } | |
| 429 | |
| 430 /* This is probably not needed, but it doesn't hurt. */ | |
| 431 /* FIXME: This should be called via a remove_edge hook. */ | |
| 432 if (current_ir_type () == IR_GIMPLE) | |
| 433 redirect_edge_var_map_clear (e); | |
| 0 | 434 |
| 435 remove_edge_raw (e); | |
| 436 } | |
| 437 | |
| 111 | 438 /* Like redirect_edge_succ but avoid possible duplicate edge. */ |
| 439 | |
| 440 edge | |
| 441 redirect_edge_succ_nodup (edge e, basic_block new_succ) | |
| 442 { | |
| 443 edge s; | |
| 444 | |
| 445 s = find_edge (e->src, new_succ); | |
| 446 if (s && s != e) | |
| 447 { | |
| 448 s->flags |= e->flags; | |
| 449 s->probability += e->probability; | |
| 450 /* FIXME: This should be called via a hook and only for IR_GIMPLE. */ | |
| 451 redirect_edge_var_map_dup (s, e); | |
| 452 remove_edge (e); | |
| 453 e = s; | |
| 454 } | |
| 455 else | |
| 456 redirect_edge_succ (e, new_succ); | |
| 457 | |
| 458 return e; | |
| 459 } | |
| 460 | |
| 0 | 461 /* Redirect the edge E to basic block DEST even if it requires creating |
| 462 of a new basic block; then it returns the newly created basic block. | |
| 463 Aborts when redirection is impossible. */ | |
| 464 | |
| 465 basic_block | |
| 466 redirect_edge_and_branch_force (edge e, basic_block dest) | |
| 467 { | |
| 468 basic_block ret, src = e->src; | |
| 469 | |
| 470 if (!cfg_hooks->redirect_edge_and_branch_force) | |
| 471 internal_error ("%s does not support redirect_edge_and_branch_force", | |
| 472 cfg_hooks->name); | |
| 473 | |
| 474 if (current_loops != NULL) | |
| 475 rescan_loop_exit (e, false, true); | |
| 476 | |
| 477 ret = cfg_hooks->redirect_edge_and_branch_force (e, dest); | |
| 111 | 478 |
| 479 if (ret != NULL && dom_info_available_p (CDI_DOMINATORS)) | |
| 0 | 480 set_immediate_dominator (CDI_DOMINATORS, ret, src); |
| 481 | |
| 482 if (current_loops != NULL) | |
| 483 { | |
| 484 if (ret != NULL) | |
| 485 { | |
| 111 | 486 struct loop *loop |
| 487 = find_common_loop (single_pred (ret)->loop_father, | |
| 488 single_succ (ret)->loop_father); | |
| 0 | 489 add_bb_to_loop (ret, loop); |
| 490 } | |
| 491 else if (find_edge (src, dest) == e) | |
| 492 rescan_loop_exit (e, true, false); | |
| 493 } | |
| 494 | |
| 495 return ret; | |
| 496 } | |
| 497 | |
| 498 /* Splits basic block BB after the specified instruction I (but at least after | |
| 499 the labels). If I is NULL, splits just after labels. The newly created edge | |
| 500 is returned. The new basic block is created just after the old one. */ | |
| 501 | |
| 111 | 502 static edge |
| 503 split_block_1 (basic_block bb, void *i) | |
| 0 | 504 { |
| 505 basic_block new_bb; | |
| 506 edge res; | |
| 507 | |
| 508 if (!cfg_hooks->split_block) | |
| 509 internal_error ("%s does not support split_block", cfg_hooks->name); | |
| 510 | |
| 511 new_bb = cfg_hooks->split_block (bb, i); | |
| 512 if (!new_bb) | |
| 513 return NULL; | |
| 514 | |
| 515 new_bb->count = bb->count; | |
| 516 new_bb->frequency = bb->frequency; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
517 new_bb->discriminator = bb->discriminator; |
| 0 | 518 |
| 519 if (dom_info_available_p (CDI_DOMINATORS)) | |
| 520 { | |
| 521 redirect_immediate_dominators (CDI_DOMINATORS, bb, new_bb); | |
| 522 set_immediate_dominator (CDI_DOMINATORS, new_bb, bb); | |
| 523 } | |
| 524 | |
| 525 if (current_loops != NULL) | |
| 526 { | |
| 111 | 527 edge_iterator ei; |
| 528 edge e; | |
| 0 | 529 add_bb_to_loop (new_bb, bb->loop_father); |
| 111 | 530 /* Identify all loops bb may have been the latch of and adjust them. */ |
| 531 FOR_EACH_EDGE (e, ei, new_bb->succs) | |
| 532 if (e->dest->loop_father->latch == bb) | |
| 533 e->dest->loop_father->latch = new_bb; | |
| 0 | 534 } |
| 535 | |
| 536 res = make_single_succ_edge (bb, new_bb, EDGE_FALLTHRU); | |
| 537 | |
| 538 if (bb->flags & BB_IRREDUCIBLE_LOOP) | |
| 539 { | |
| 540 new_bb->flags |= BB_IRREDUCIBLE_LOOP; | |
| 541 res->flags |= EDGE_IRREDUCIBLE_LOOP; | |
| 542 } | |
| 543 | |
| 544 return res; | |
| 545 } | |
| 546 | |
| 111 | 547 edge |
| 548 split_block (basic_block bb, gimple *i) | |
| 549 { | |
| 550 return split_block_1 (bb, i); | |
| 551 } | |
| 552 | |
| 553 edge | |
| 554 split_block (basic_block bb, rtx i) | |
| 555 { | |
| 556 return split_block_1 (bb, i); | |
| 557 } | |
| 558 | |
| 0 | 559 /* Splits block BB just after labels. The newly created edge is returned. */ |
| 560 | |
| 561 edge | |
| 562 split_block_after_labels (basic_block bb) | |
| 563 { | |
| 111 | 564 return split_block_1 (bb, NULL); |
| 0 | 565 } |
| 566 | |
| 567 /* Moves block BB immediately after block AFTER. Returns false if the | |
| 568 movement was impossible. */ | |
| 569 | |
| 570 bool | |
| 571 move_block_after (basic_block bb, basic_block after) | |
| 572 { | |
| 573 bool ret; | |
| 574 | |
| 575 if (!cfg_hooks->move_block_after) | |
| 576 internal_error ("%s does not support move_block_after", cfg_hooks->name); | |
| 577 | |
| 578 ret = cfg_hooks->move_block_after (bb, after); | |
| 579 | |
| 580 return ret; | |
| 581 } | |
| 582 | |
| 583 /* Deletes the basic block BB. */ | |
| 584 | |
| 585 void | |
| 586 delete_basic_block (basic_block bb) | |
| 587 { | |
| 588 if (!cfg_hooks->delete_basic_block) | |
| 589 internal_error ("%s does not support delete_basic_block", cfg_hooks->name); | |
| 590 | |
| 591 cfg_hooks->delete_basic_block (bb); | |
| 592 | |
| 593 if (current_loops != NULL) | |
| 594 { | |
| 595 struct loop *loop = bb->loop_father; | |
| 596 | |
| 597 /* If we remove the header or the latch of a loop, mark the loop for | |
| 111 | 598 removal. */ |
| 0 | 599 if (loop->latch == bb |
| 600 || loop->header == bb) | |
| 111 | 601 mark_loop_for_removal (loop); |
| 0 | 602 |
| 603 remove_bb_from_loops (bb); | |
| 604 } | |
| 605 | |
| 606 /* Remove the edges into and out of this block. Note that there may | |
| 607 indeed be edges in, if we are removing an unreachable loop. */ | |
| 608 while (EDGE_COUNT (bb->preds) != 0) | |
| 609 remove_edge (EDGE_PRED (bb, 0)); | |
| 610 while (EDGE_COUNT (bb->succs) != 0) | |
| 611 remove_edge (EDGE_SUCC (bb, 0)); | |
| 612 | |
| 613 if (dom_info_available_p (CDI_DOMINATORS)) | |
| 614 delete_from_dominance_info (CDI_DOMINATORS, bb); | |
| 615 if (dom_info_available_p (CDI_POST_DOMINATORS)) | |
| 616 delete_from_dominance_info (CDI_POST_DOMINATORS, bb); | |
| 617 | |
| 618 /* Remove the basic block from the array. */ | |
| 619 expunge_block (bb); | |
| 620 } | |
| 621 | |
| 622 /* Splits edge E and returns the newly created basic block. */ | |
| 623 | |
| 624 basic_block | |
| 625 split_edge (edge e) | |
| 626 { | |
| 627 basic_block ret; | |
| 111 | 628 profile_count count = e->count (); |
| 0 | 629 int freq = EDGE_FREQUENCY (e); |
| 630 edge f; | |
| 631 bool irr = (e->flags & EDGE_IRREDUCIBLE_LOOP) != 0; | |
| 632 struct loop *loop; | |
| 633 basic_block src = e->src, dest = e->dest; | |
| 634 | |
| 635 if (!cfg_hooks->split_edge) | |
| 636 internal_error ("%s does not support split_edge", cfg_hooks->name); | |
| 637 | |
| 638 if (current_loops != NULL) | |
| 639 rescan_loop_exit (e, false, true); | |
| 640 | |
| 641 ret = cfg_hooks->split_edge (e); | |
| 642 ret->count = count; | |
| 643 ret->frequency = freq; | |
| 111 | 644 single_succ_edge (ret)->probability = profile_probability::always (); |
| 0 | 645 |
| 646 if (irr) | |
| 647 { | |
| 648 ret->flags |= BB_IRREDUCIBLE_LOOP; | |
| 649 single_pred_edge (ret)->flags |= EDGE_IRREDUCIBLE_LOOP; | |
| 650 single_succ_edge (ret)->flags |= EDGE_IRREDUCIBLE_LOOP; | |
| 651 } | |
| 652 | |
| 653 if (dom_info_available_p (CDI_DOMINATORS)) | |
| 654 set_immediate_dominator (CDI_DOMINATORS, ret, single_pred (ret)); | |
| 655 | |
| 656 if (dom_info_state (CDI_DOMINATORS) >= DOM_NO_FAST_QUERY) | |
| 657 { | |
| 658 /* There are two cases: | |
| 659 | |
| 660 If the immediate dominator of e->dest is not e->src, it | |
| 661 remains unchanged. | |
| 662 | |
| 663 If immediate dominator of e->dest is e->src, it may become | |
| 664 ret, provided that all other predecessors of e->dest are | |
| 665 dominated by e->dest. */ | |
| 666 | |
| 667 if (get_immediate_dominator (CDI_DOMINATORS, single_succ (ret)) | |
| 668 == single_pred (ret)) | |
| 669 { | |
| 670 edge_iterator ei; | |
| 671 FOR_EACH_EDGE (f, ei, single_succ (ret)->preds) | |
| 672 { | |
| 673 if (f == single_succ_edge (ret)) | |
| 674 continue; | |
| 675 | |
| 676 if (!dominated_by_p (CDI_DOMINATORS, f->src, | |
| 677 single_succ (ret))) | |
| 678 break; | |
| 679 } | |
| 680 | |
| 681 if (!f) | |
| 682 set_immediate_dominator (CDI_DOMINATORS, single_succ (ret), ret); | |
| 683 } | |
| 684 } | |
| 685 | |
| 686 if (current_loops != NULL) | |
| 687 { | |
| 688 loop = find_common_loop (src->loop_father, dest->loop_father); | |
| 689 add_bb_to_loop (ret, loop); | |
| 690 | |
| 111 | 691 /* If we split the latch edge of loop adjust the latch block. */ |
| 692 if (loop->latch == src | |
| 693 && loop->header == dest) | |
| 0 | 694 loop->latch = ret; |
| 695 } | |
| 696 | |
| 697 return ret; | |
| 698 } | |
| 699 | |
| 700 /* Creates a new basic block just after the basic block AFTER. | |
| 701 HEAD and END are the first and the last statement belonging | |
| 702 to the block. If both are NULL, an empty block is created. */ | |
| 703 | |
| 111 | 704 static basic_block |
| 705 create_basic_block_1 (void *head, void *end, basic_block after) | |
| 0 | 706 { |
| 707 basic_block ret; | |
| 708 | |
| 709 if (!cfg_hooks->create_basic_block) | |
| 710 internal_error ("%s does not support create_basic_block", cfg_hooks->name); | |
| 711 | |
| 712 ret = cfg_hooks->create_basic_block (head, end, after); | |
| 713 | |
| 714 if (dom_info_available_p (CDI_DOMINATORS)) | |
| 715 add_to_dominance_info (CDI_DOMINATORS, ret); | |
| 716 if (dom_info_available_p (CDI_POST_DOMINATORS)) | |
| 717 add_to_dominance_info (CDI_POST_DOMINATORS, ret); | |
| 718 | |
| 719 return ret; | |
| 720 } | |
| 721 | |
| 111 | 722 basic_block |
| 723 create_basic_block (gimple_seq seq, basic_block after) | |
| 724 { | |
| 725 return create_basic_block_1 (seq, NULL, after); | |
| 726 } | |
| 727 | |
| 728 basic_block | |
| 729 create_basic_block (rtx head, rtx end, basic_block after) | |
| 730 { | |
| 731 return create_basic_block_1 (head, end, after); | |
| 732 } | |
| 733 | |
| 734 | |
| 0 | 735 /* Creates an empty basic block just after basic block AFTER. */ |
| 736 | |
| 737 basic_block | |
| 738 create_empty_bb (basic_block after) | |
| 739 { | |
| 111 | 740 return create_basic_block_1 (NULL, NULL, after); |
| 0 | 741 } |
| 742 | |
| 743 /* Checks whether we may merge blocks BB1 and BB2. */ | |
| 744 | |
| 745 bool | |
| 746 can_merge_blocks_p (basic_block bb1, basic_block bb2) | |
| 747 { | |
| 748 bool ret; | |
| 749 | |
| 750 if (!cfg_hooks->can_merge_blocks_p) | |
| 751 internal_error ("%s does not support can_merge_blocks_p", cfg_hooks->name); | |
| 752 | |
| 753 ret = cfg_hooks->can_merge_blocks_p (bb1, bb2); | |
| 754 | |
| 755 return ret; | |
| 756 } | |
| 757 | |
| 758 void | |
| 759 predict_edge (edge e, enum br_predictor predictor, int probability) | |
| 760 { | |
| 761 if (!cfg_hooks->predict_edge) | |
| 762 internal_error ("%s does not support predict_edge", cfg_hooks->name); | |
| 763 | |
| 764 cfg_hooks->predict_edge (e, predictor, probability); | |
| 765 } | |
| 766 | |
| 767 bool | |
| 768 predicted_by_p (const_basic_block bb, enum br_predictor predictor) | |
| 769 { | |
| 770 if (!cfg_hooks->predict_edge) | |
| 771 internal_error ("%s does not support predicted_by_p", cfg_hooks->name); | |
| 772 | |
| 773 return cfg_hooks->predicted_by_p (bb, predictor); | |
| 774 } | |
| 775 | |
| 776 /* Merges basic block B into basic block A. */ | |
| 777 | |
| 778 void | |
| 779 merge_blocks (basic_block a, basic_block b) | |
| 780 { | |
| 781 edge e; | |
| 782 edge_iterator ei; | |
| 783 | |
| 784 if (!cfg_hooks->merge_blocks) | |
| 785 internal_error ("%s does not support merge_blocks", cfg_hooks->name); | |
| 786 | |
| 787 cfg_hooks->merge_blocks (a, b); | |
| 788 | |
| 789 if (current_loops != NULL) | |
| 111 | 790 { |
| 791 /* If the block we merge into is a loop header do nothing unless ... */ | |
| 792 if (a->loop_father->header == a) | |
| 793 { | |
| 794 /* ... we merge two loop headers, in which case we kill | |
| 795 the inner loop. */ | |
| 796 if (b->loop_father->header == b) | |
| 797 mark_loop_for_removal (b->loop_father); | |
| 798 } | |
| 799 /* If we merge a loop header into its predecessor, update the loop | |
| 800 structure. */ | |
| 801 else if (b->loop_father->header == b) | |
| 802 { | |
| 803 remove_bb_from_loops (a); | |
| 804 add_bb_to_loop (a, b->loop_father); | |
| 805 a->loop_father->header = a; | |
| 806 } | |
| 807 /* If we merge a loop latch into its predecessor, update the loop | |
| 808 structure. */ | |
| 809 if (b->loop_father->latch | |
| 810 && b->loop_father->latch == b) | |
| 811 b->loop_father->latch = a; | |
| 812 remove_bb_from_loops (b); | |
| 813 } | |
| 0 | 814 |
| 815 /* Normally there should only be one successor of A and that is B, but | |
| 816 partway though the merge of blocks for conditional_execution we'll | |
| 817 be merging a TEST block with THEN and ELSE successors. Free the | |
| 818 whole lot of them and hope the caller knows what they're doing. */ | |
| 819 | |
| 820 while (EDGE_COUNT (a->succs) != 0) | |
| 821 remove_edge (EDGE_SUCC (a, 0)); | |
| 822 | |
| 823 /* Adjust the edges out of B for the new owner. */ | |
| 824 FOR_EACH_EDGE (e, ei, b->succs) | |
| 825 { | |
| 826 e->src = a; | |
| 827 if (current_loops != NULL) | |
| 111 | 828 { |
| 829 /* If b was a latch, a now is. */ | |
| 830 if (e->dest->loop_father->latch == b) | |
| 831 e->dest->loop_father->latch = a; | |
| 832 rescan_loop_exit (e, true, false); | |
| 833 } | |
| 0 | 834 } |
| 835 a->succs = b->succs; | |
| 836 a->flags |= b->flags; | |
| 837 | |
| 838 /* B hasn't quite yet ceased to exist. Attempt to prevent mishap. */ | |
| 839 b->preds = b->succs = NULL; | |
| 840 | |
| 841 if (dom_info_available_p (CDI_DOMINATORS)) | |
| 842 redirect_immediate_dominators (CDI_DOMINATORS, b, a); | |
| 843 | |
| 844 if (dom_info_available_p (CDI_DOMINATORS)) | |
| 845 delete_from_dominance_info (CDI_DOMINATORS, b); | |
| 846 if (dom_info_available_p (CDI_POST_DOMINATORS)) | |
| 847 delete_from_dominance_info (CDI_POST_DOMINATORS, b); | |
| 848 | |
| 849 expunge_block (b); | |
| 850 } | |
| 851 | |
| 852 /* Split BB into entry part and the rest (the rest is the newly created block). | |
| 853 Redirect those edges for that REDIRECT_EDGE_P returns true to the entry | |
| 854 part. Returns the edge connecting the entry part to the rest. */ | |
| 855 | |
| 856 edge | |
| 857 make_forwarder_block (basic_block bb, bool (*redirect_edge_p) (edge), | |
| 858 void (*new_bb_cbk) (basic_block)) | |
| 859 { | |
| 860 edge e, fallthru; | |
| 861 edge_iterator ei; | |
| 862 basic_block dummy, jump; | |
| 863 struct loop *loop, *ploop, *cloop; | |
| 864 | |
| 865 if (!cfg_hooks->make_forwarder_block) | |
| 866 internal_error ("%s does not support make_forwarder_block", | |
| 867 cfg_hooks->name); | |
| 868 | |
| 869 fallthru = split_block_after_labels (bb); | |
| 870 dummy = fallthru->src; | |
| 111 | 871 dummy->count = profile_count::zero (); |
| 872 dummy->frequency = 0; | |
| 0 | 873 bb = fallthru->dest; |
| 874 | |
| 875 /* Redirect back edges we want to keep. */ | |
| 876 for (ei = ei_start (dummy->preds); (e = ei_safe_edge (ei)); ) | |
| 877 { | |
| 878 basic_block e_src; | |
| 879 | |
| 880 if (redirect_edge_p (e)) | |
| 881 { | |
| 111 | 882 dummy->frequency += EDGE_FREQUENCY (e); |
| 883 if (dummy->frequency > BB_FREQ_MAX) | |
| 884 dummy->frequency = BB_FREQ_MAX; | |
| 885 | |
| 886 dummy->count += e->count (); | |
| 0 | 887 ei_next (&ei); |
| 888 continue; | |
| 889 } | |
| 890 | |
| 891 e_src = e->src; | |
| 892 jump = redirect_edge_and_branch_force (e, bb); | |
| 893 if (jump != NULL) | |
| 894 { | |
| 895 /* If we redirected the loop latch edge, the JUMP block now acts like | |
| 896 the new latch of the loop. */ | |
| 897 if (current_loops != NULL | |
| 898 && dummy->loop_father != NULL | |
| 899 && dummy->loop_father->header == dummy | |
| 900 && dummy->loop_father->latch == e_src) | |
| 901 dummy->loop_father->latch = jump; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
902 |
| 0 | 903 if (new_bb_cbk != NULL) |
| 904 new_bb_cbk (jump); | |
| 905 } | |
| 906 } | |
| 907 | |
| 908 if (dom_info_available_p (CDI_DOMINATORS)) | |
| 909 { | |
| 111 | 910 vec<basic_block> doms_to_fix; |
| 911 doms_to_fix.create (2); | |
| 912 doms_to_fix.quick_push (dummy); | |
| 913 doms_to_fix.quick_push (bb); | |
| 0 | 914 iterate_fix_dominators (CDI_DOMINATORS, doms_to_fix, false); |
| 111 | 915 doms_to_fix.release (); |
| 0 | 916 } |
| 917 | |
| 918 if (current_loops != NULL) | |
| 919 { | |
| 920 /* If we do not split a loop header, then both blocks belong to the | |
| 921 same loop. In case we split loop header and do not redirect the | |
| 922 latch edge to DUMMY, then DUMMY belongs to the outer loop, and | |
| 923 BB becomes the new header. If latch is not recorded for the loop, | |
| 924 we leave this updating on the caller (this may only happen during | |
| 925 loop analysis). */ | |
| 926 loop = dummy->loop_father; | |
| 927 if (loop->header == dummy | |
| 928 && loop->latch != NULL | |
| 929 && find_edge (loop->latch, dummy) == NULL) | |
| 930 { | |
| 931 remove_bb_from_loops (dummy); | |
| 932 loop->header = bb; | |
| 933 | |
| 934 cloop = loop; | |
| 935 FOR_EACH_EDGE (e, ei, dummy->preds) | |
| 936 { | |
| 937 cloop = find_common_loop (cloop, e->src->loop_father); | |
| 938 } | |
| 939 add_bb_to_loop (dummy, cloop); | |
| 940 } | |
| 941 | |
| 942 /* In case we split loop latch, update it. */ | |
| 943 for (ploop = loop; ploop; ploop = loop_outer (ploop)) | |
| 944 if (ploop->latch == dummy) | |
| 945 ploop->latch = bb; | |
| 946 } | |
| 947 | |
| 948 cfg_hooks->make_forwarder_block (fallthru); | |
| 949 | |
| 950 return fallthru; | |
| 951 } | |
| 952 | |
| 111 | 953 /* Try to make the edge fallthru. */ |
| 954 | |
| 0 | 955 void |
| 956 tidy_fallthru_edge (edge e) | |
| 957 { | |
| 958 if (cfg_hooks->tidy_fallthru_edge) | |
| 959 cfg_hooks->tidy_fallthru_edge (e); | |
| 960 } | |
| 961 | |
| 962 /* Fix up edges that now fall through, or rather should now fall through | |
| 963 but previously required a jump around now deleted blocks. Simplify | |
| 964 the search by only examining blocks numerically adjacent, since this | |
| 111 | 965 is how they were created. |
| 966 | |
| 967 ??? This routine is currently RTL specific. */ | |
| 0 | 968 |
| 969 void | |
| 970 tidy_fallthru_edges (void) | |
| 971 { | |
| 972 basic_block b, c; | |
| 973 | |
| 974 if (!cfg_hooks->tidy_fallthru_edge) | |
| 975 return; | |
| 976 | |
| 111 | 977 if (ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb == EXIT_BLOCK_PTR_FOR_FN (cfun)) |
| 0 | 978 return; |
| 979 | |
| 111 | 980 FOR_BB_BETWEEN (b, ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb, |
| 981 EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb, next_bb) | |
| 0 | 982 { |
| 983 edge s; | |
| 984 | |
| 985 c = b->next_bb; | |
| 986 | |
| 987 /* We care about simple conditional or unconditional jumps with | |
| 988 a single successor. | |
| 989 | |
| 990 If we had a conditional branch to the next instruction when | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
991 CFG was built, then there will only be one out edge for the |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
992 block which ended with the conditional branch (since we do |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
993 not create duplicate edges). |
| 0 | 994 |
| 995 Furthermore, the edge will be marked as a fallthru because we | |
| 996 merge the flags for the duplicate edges. So we do not want to | |
| 997 check that the edge is not a FALLTHRU edge. */ | |
| 998 | |
| 999 if (single_succ_p (b)) | |
| 1000 { | |
| 1001 s = single_succ_edge (b); | |
| 1002 if (! (s->flags & EDGE_COMPLEX) | |
| 1003 && s->dest == c | |
| 111 | 1004 && !(JUMP_P (BB_END (b)) && CROSSING_JUMP_P (BB_END (b)))) |
| 0 | 1005 tidy_fallthru_edge (s); |
| 1006 } | |
| 1007 } | |
| 1008 } | |
| 1009 | |
| 111 | 1010 /* Edge E is assumed to be fallthru edge. Emit needed jump instruction |
| 1011 (and possibly create new basic block) to make edge non-fallthru. | |
| 1012 Return newly created BB or NULL if none. */ | |
| 1013 | |
| 1014 basic_block | |
| 1015 force_nonfallthru (edge e) | |
| 1016 { | |
| 1017 basic_block ret, src = e->src; | |
| 1018 | |
| 1019 if (!cfg_hooks->force_nonfallthru) | |
| 1020 internal_error ("%s does not support force_nonfallthru", | |
| 1021 cfg_hooks->name); | |
| 1022 | |
| 1023 ret = cfg_hooks->force_nonfallthru (e); | |
| 1024 if (ret != NULL) | |
| 1025 { | |
| 1026 if (dom_info_available_p (CDI_DOMINATORS)) | |
| 1027 set_immediate_dominator (CDI_DOMINATORS, ret, src); | |
| 1028 | |
| 1029 if (current_loops != NULL) | |
| 1030 { | |
| 1031 basic_block pred = single_pred (ret); | |
| 1032 basic_block succ = single_succ (ret); | |
| 1033 struct loop *loop | |
| 1034 = find_common_loop (pred->loop_father, succ->loop_father); | |
| 1035 rescan_loop_exit (e, false, true); | |
| 1036 add_bb_to_loop (ret, loop); | |
| 1037 | |
| 1038 /* If we split the latch edge of loop adjust the latch block. */ | |
| 1039 if (loop->latch == pred | |
| 1040 && loop->header == succ) | |
| 1041 loop->latch = ret; | |
| 1042 } | |
| 1043 } | |
| 1044 | |
| 1045 return ret; | |
| 1046 } | |
| 1047 | |
| 0 | 1048 /* Returns true if we can duplicate basic block BB. */ |
| 1049 | |
| 1050 bool | |
| 1051 can_duplicate_block_p (const_basic_block bb) | |
| 1052 { | |
| 1053 if (!cfg_hooks->can_duplicate_block_p) | |
| 1054 internal_error ("%s does not support can_duplicate_block_p", | |
| 1055 cfg_hooks->name); | |
| 1056 | |
| 111 | 1057 if (bb == EXIT_BLOCK_PTR_FOR_FN (cfun) || bb == ENTRY_BLOCK_PTR_FOR_FN (cfun)) |
| 0 | 1058 return false; |
| 1059 | |
| 1060 return cfg_hooks->can_duplicate_block_p (bb); | |
| 1061 } | |
| 1062 | |
| 1063 /* Duplicates basic block BB and redirects edge E to it. Returns the | |
| 1064 new basic block. The new basic block is placed after the basic block | |
| 1065 AFTER. */ | |
| 1066 | |
| 1067 basic_block | |
| 1068 duplicate_block (basic_block bb, edge e, basic_block after) | |
| 1069 { | |
| 1070 edge s, n; | |
| 1071 basic_block new_bb; | |
| 111 | 1072 profile_count new_count = e ? e->count (): profile_count::uninitialized (); |
| 0 | 1073 edge_iterator ei; |
| 1074 | |
| 1075 if (!cfg_hooks->duplicate_block) | |
| 1076 internal_error ("%s does not support duplicate_block", | |
| 1077 cfg_hooks->name); | |
| 1078 | |
| 1079 if (bb->count < new_count) | |
| 1080 new_count = bb->count; | |
| 1081 | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1082 gcc_checking_assert (can_duplicate_block_p (bb)); |
| 0 | 1083 |
| 1084 new_bb = cfg_hooks->duplicate_block (bb); | |
| 1085 if (after) | |
| 1086 move_block_after (new_bb, after); | |
| 1087 | |
| 111 | 1088 new_bb->flags = (bb->flags & ~BB_DUPLICATED); |
| 0 | 1089 FOR_EACH_EDGE (s, ei, bb->succs) |
| 1090 { | |
| 1091 /* Since we are creating edges from a new block to successors | |
| 1092 of another block (which therefore are known to be disjoint), there | |
| 1093 is no need to actually check for duplicated edges. */ | |
| 1094 n = unchecked_make_edge (new_bb, s->dest, s->flags); | |
| 1095 n->probability = s->probability; | |
| 1096 n->aux = s->aux; | |
| 1097 } | |
| 1098 | |
| 1099 if (e) | |
| 1100 { | |
| 1101 new_bb->count = new_count; | |
| 1102 bb->count -= new_count; | |
| 1103 | |
| 1104 new_bb->frequency = EDGE_FREQUENCY (e); | |
| 1105 bb->frequency -= EDGE_FREQUENCY (e); | |
| 1106 | |
| 1107 redirect_edge_and_branch_force (e, new_bb); | |
| 1108 | |
| 1109 if (bb->frequency < 0) | |
| 1110 bb->frequency = 0; | |
| 1111 } | |
| 1112 else | |
| 1113 { | |
| 1114 new_bb->count = bb->count; | |
| 1115 new_bb->frequency = bb->frequency; | |
| 1116 } | |
| 1117 | |
| 1118 set_bb_original (new_bb, bb); | |
| 1119 set_bb_copy (bb, new_bb); | |
| 1120 | |
| 1121 /* Add the new block to the copy of the loop of BB, or directly to the loop | |
| 1122 of BB if the loop is not being copied. */ | |
| 1123 if (current_loops != NULL) | |
| 1124 { | |
| 1125 struct loop *cloop = bb->loop_father; | |
| 1126 struct loop *copy = get_loop_copy (cloop); | |
| 111 | 1127 /* If we copied the loop header block but not the loop |
| 1128 we have created a loop with multiple entries. Ditch the loop, | |
| 1129 add the new block to the outer loop and arrange for a fixup. */ | |
| 1130 if (!copy | |
| 1131 && cloop->header == bb) | |
| 1132 { | |
| 1133 add_bb_to_loop (new_bb, loop_outer (cloop)); | |
| 1134 mark_loop_for_removal (cloop); | |
| 1135 } | |
| 1136 else | |
| 1137 { | |
| 1138 add_bb_to_loop (new_bb, copy ? copy : cloop); | |
| 1139 /* If we copied the loop latch block but not the loop, adjust | |
| 1140 loop state. */ | |
| 1141 if (!copy | |
| 1142 && cloop->latch == bb) | |
| 1143 { | |
| 1144 cloop->latch = NULL; | |
| 1145 loops_state_set (LOOPS_MAY_HAVE_MULTIPLE_LATCHES); | |
| 1146 } | |
| 1147 } | |
| 0 | 1148 } |
| 1149 | |
| 1150 return new_bb; | |
| 1151 } | |
| 1152 | |
| 1153 /* Return 1 if BB ends with a call, possibly followed by some | |
| 1154 instructions that must stay with the call, 0 otherwise. */ | |
| 1155 | |
| 1156 bool | |
| 1157 block_ends_with_call_p (basic_block bb) | |
| 1158 { | |
| 1159 if (!cfg_hooks->block_ends_with_call_p) | |
| 1160 internal_error ("%s does not support block_ends_with_call_p", cfg_hooks->name); | |
| 1161 | |
| 1162 return (cfg_hooks->block_ends_with_call_p) (bb); | |
| 1163 } | |
| 1164 | |
| 1165 /* Return 1 if BB ends with a conditional branch, 0 otherwise. */ | |
| 1166 | |
| 1167 bool | |
| 1168 block_ends_with_condjump_p (const_basic_block bb) | |
| 1169 { | |
| 1170 if (!cfg_hooks->block_ends_with_condjump_p) | |
| 1171 internal_error ("%s does not support block_ends_with_condjump_p", | |
| 1172 cfg_hooks->name); | |
| 1173 | |
| 1174 return (cfg_hooks->block_ends_with_condjump_p) (bb); | |
| 1175 } | |
| 1176 | |
| 1177 /* Add fake edges to the function exit for any non constant and non noreturn | |
| 1178 calls, volatile inline assembly in the bitmap of blocks specified by | |
| 1179 BLOCKS or to the whole CFG if BLOCKS is zero. Return the number of blocks | |
| 1180 that were split. | |
| 1181 | |
| 1182 The goal is to expose cases in which entering a basic block does not imply | |
| 1183 that all subsequent instructions must be executed. */ | |
| 1184 | |
| 1185 int | |
| 1186 flow_call_edges_add (sbitmap blocks) | |
| 1187 { | |
| 1188 if (!cfg_hooks->flow_call_edges_add) | |
| 1189 internal_error ("%s does not support flow_call_edges_add", | |
| 1190 cfg_hooks->name); | |
| 1191 | |
| 1192 return (cfg_hooks->flow_call_edges_add) (blocks); | |
| 1193 } | |
| 1194 | |
| 1195 /* This function is called immediately after edge E is added to the | |
| 1196 edge vector E->dest->preds. */ | |
| 1197 | |
| 1198 void | |
| 1199 execute_on_growing_pred (edge e) | |
| 1200 { | |
| 111 | 1201 if (! (e->dest->flags & BB_DUPLICATED) |
| 1202 && cfg_hooks->execute_on_growing_pred) | |
| 0 | 1203 cfg_hooks->execute_on_growing_pred (e); |
| 1204 } | |
| 1205 | |
| 1206 /* This function is called immediately before edge E is removed from | |
| 1207 the edge vector E->dest->preds. */ | |
| 1208 | |
| 1209 void | |
| 1210 execute_on_shrinking_pred (edge e) | |
| 1211 { | |
| 111 | 1212 if (! (e->dest->flags & BB_DUPLICATED) |
| 1213 && cfg_hooks->execute_on_shrinking_pred) | |
| 0 | 1214 cfg_hooks->execute_on_shrinking_pred (e); |
| 1215 } | |
| 1216 | |
| 1217 /* This is used inside loop versioning when we want to insert | |
| 1218 stmts/insns on the edges, which have a different behavior | |
| 1219 in tree's and in RTL, so we made a CFG hook. */ | |
| 1220 void | |
| 1221 lv_flush_pending_stmts (edge e) | |
| 1222 { | |
| 1223 if (cfg_hooks->flush_pending_stmts) | |
| 1224 cfg_hooks->flush_pending_stmts (e); | |
| 1225 } | |
| 1226 | |
| 1227 /* Loop versioning uses the duplicate_loop_to_header_edge to create | |
| 1228 a new version of the loop basic-blocks, the parameters here are | |
| 1229 exactly the same as in duplicate_loop_to_header_edge or | |
| 1230 tree_duplicate_loop_to_header_edge; while in tree-ssa there is | |
| 1231 additional work to maintain ssa information that's why there is | |
| 1232 a need to call the tree_duplicate_loop_to_header_edge rather | |
| 1233 than duplicate_loop_to_header_edge when we are in tree mode. */ | |
| 1234 bool | |
| 1235 cfg_hook_duplicate_loop_to_header_edge (struct loop *loop, edge e, | |
| 1236 unsigned int ndupl, | |
| 1237 sbitmap wont_exit, edge orig, | |
| 111 | 1238 vec<edge> *to_remove, |
| 0 | 1239 int flags) |
| 1240 { | |
| 1241 gcc_assert (cfg_hooks->cfg_hook_duplicate_loop_to_header_edge); | |
| 1242 return cfg_hooks->cfg_hook_duplicate_loop_to_header_edge (loop, e, | |
| 1243 ndupl, wont_exit, | |
| 1244 orig, to_remove, | |
| 1245 flags); | |
| 1246 } | |
| 1247 | |
| 1248 /* Conditional jumps are represented differently in trees and RTL, | |
| 1249 this hook takes a basic block that is known to have a cond jump | |
| 1250 at its end and extracts the taken and not taken edges out of it | |
| 1251 and store it in E1 and E2 respectively. */ | |
| 1252 void | |
| 1253 extract_cond_bb_edges (basic_block b, edge *e1, edge *e2) | |
| 1254 { | |
| 1255 gcc_assert (cfg_hooks->extract_cond_bb_edges); | |
| 1256 cfg_hooks->extract_cond_bb_edges (b, e1, e2); | |
| 1257 } | |
| 1258 | |
| 1259 /* Responsible for updating the ssa info (PHI nodes) on the | |
| 1260 new condition basic block that guards the versioned loop. */ | |
| 1261 void | |
| 1262 lv_adjust_loop_header_phi (basic_block first, basic_block second, | |
| 1263 basic_block new_block, edge e) | |
| 1264 { | |
| 1265 if (cfg_hooks->lv_adjust_loop_header_phi) | |
| 1266 cfg_hooks->lv_adjust_loop_header_phi (first, second, new_block, e); | |
| 1267 } | |
| 1268 | |
| 1269 /* Conditions in trees and RTL are different so we need | |
| 1270 a different handling when we add the condition to the | |
| 1271 versioning code. */ | |
| 1272 void | |
| 1273 lv_add_condition_to_bb (basic_block first, basic_block second, | |
| 1274 basic_block new_block, void *cond) | |
| 1275 { | |
| 1276 gcc_assert (cfg_hooks->lv_add_condition_to_bb); | |
| 1277 cfg_hooks->lv_add_condition_to_bb (first, second, new_block, cond); | |
| 1278 } | |
| 111 | 1279 |
| 1280 /* Checks whether all N blocks in BBS array can be copied. */ | |
| 1281 bool | |
| 1282 can_copy_bbs_p (basic_block *bbs, unsigned n) | |
| 1283 { | |
| 1284 unsigned i; | |
| 1285 edge e; | |
| 1286 int ret = true; | |
| 1287 | |
| 1288 for (i = 0; i < n; i++) | |
| 1289 bbs[i]->flags |= BB_DUPLICATED; | |
| 1290 | |
| 1291 for (i = 0; i < n; i++) | |
| 1292 { | |
| 1293 /* In case we should redirect abnormal edge during duplication, fail. */ | |
| 1294 edge_iterator ei; | |
| 1295 FOR_EACH_EDGE (e, ei, bbs[i]->succs) | |
| 1296 if ((e->flags & EDGE_ABNORMAL) | |
| 1297 && (e->dest->flags & BB_DUPLICATED)) | |
| 1298 { | |
| 1299 ret = false; | |
| 1300 goto end; | |
| 1301 } | |
| 1302 | |
| 1303 if (!can_duplicate_block_p (bbs[i])) | |
| 1304 { | |
| 1305 ret = false; | |
| 1306 break; | |
| 1307 } | |
| 1308 } | |
| 1309 | |
| 1310 end: | |
| 1311 for (i = 0; i < n; i++) | |
| 1312 bbs[i]->flags &= ~BB_DUPLICATED; | |
| 1313 | |
| 1314 return ret; | |
| 1315 } | |
| 1316 | |
| 1317 /* Duplicates N basic blocks stored in array BBS. Newly created basic blocks | |
| 1318 are placed into array NEW_BBS in the same order. Edges from basic blocks | |
| 1319 in BBS are also duplicated and copies of those that lead into BBS are | |
| 1320 redirected to appropriate newly created block. The function assigns bbs | |
| 1321 into loops (copy of basic block bb is assigned to bb->loop_father->copy | |
| 1322 loop, so this must be set up correctly in advance) | |
| 1323 | |
| 1324 If UPDATE_DOMINANCE is true then this function updates dominators locally | |
| 1325 (LOOPS structure that contains the information about dominators is passed | |
| 1326 to enable this), otherwise it does not update the dominator information | |
| 1327 and it assumed that the caller will do this, perhaps by destroying and | |
| 1328 recreating it instead of trying to do an incremental update like this | |
| 1329 function does when update_dominance is true. | |
| 1330 | |
| 1331 BASE is the superloop to that basic block belongs; if its header or latch | |
| 1332 is copied, we do not set the new blocks as header or latch. | |
| 1333 | |
| 1334 Created copies of N_EDGES edges in array EDGES are stored in array NEW_EDGES, | |
| 1335 also in the same order. | |
| 1336 | |
| 1337 Newly created basic blocks are put after the basic block AFTER in the | |
| 1338 instruction stream, and the order of the blocks in BBS array is preserved. */ | |
| 1339 | |
| 1340 void | |
| 1341 copy_bbs (basic_block *bbs, unsigned n, basic_block *new_bbs, | |
| 1342 edge *edges, unsigned num_edges, edge *new_edges, | |
| 1343 struct loop *base, basic_block after, bool update_dominance) | |
| 1344 { | |
| 1345 unsigned i, j; | |
| 1346 basic_block bb, new_bb, dom_bb; | |
| 1347 edge e; | |
| 1348 | |
| 1349 /* Mark the blocks to be copied. This is used by edge creation hooks | |
| 1350 to decide whether to reallocate PHI nodes capacity to avoid reallocating | |
| 1351 PHIs in the set of source BBs. */ | |
| 1352 for (i = 0; i < n; i++) | |
| 1353 bbs[i]->flags |= BB_DUPLICATED; | |
| 1354 | |
| 1355 /* Duplicate bbs, update dominators, assign bbs to loops. */ | |
| 1356 for (i = 0; i < n; i++) | |
| 1357 { | |
| 1358 /* Duplicate. */ | |
| 1359 bb = bbs[i]; | |
| 1360 new_bb = new_bbs[i] = duplicate_block (bb, NULL, after); | |
| 1361 after = new_bb; | |
| 1362 if (bb->loop_father) | |
| 1363 { | |
| 1364 /* Possibly set loop header. */ | |
| 1365 if (bb->loop_father->header == bb && bb->loop_father != base) | |
| 1366 new_bb->loop_father->header = new_bb; | |
| 1367 /* Or latch. */ | |
| 1368 if (bb->loop_father->latch == bb && bb->loop_father != base) | |
| 1369 new_bb->loop_father->latch = new_bb; | |
| 1370 } | |
| 1371 } | |
| 1372 | |
| 1373 /* Set dominators. */ | |
| 1374 if (update_dominance) | |
| 1375 { | |
| 1376 for (i = 0; i < n; i++) | |
| 1377 { | |
| 1378 bb = bbs[i]; | |
| 1379 new_bb = new_bbs[i]; | |
| 1380 | |
| 1381 dom_bb = get_immediate_dominator (CDI_DOMINATORS, bb); | |
| 1382 if (dom_bb->flags & BB_DUPLICATED) | |
| 1383 { | |
| 1384 dom_bb = get_bb_copy (dom_bb); | |
| 1385 set_immediate_dominator (CDI_DOMINATORS, new_bb, dom_bb); | |
| 1386 } | |
| 1387 } | |
| 1388 } | |
| 1389 | |
| 1390 /* Redirect edges. */ | |
| 1391 for (j = 0; j < num_edges; j++) | |
| 1392 new_edges[j] = NULL; | |
| 1393 for (i = 0; i < n; i++) | |
| 1394 { | |
| 1395 edge_iterator ei; | |
| 1396 new_bb = new_bbs[i]; | |
| 1397 bb = bbs[i]; | |
| 1398 | |
| 1399 FOR_EACH_EDGE (e, ei, new_bb->succs) | |
| 1400 { | |
| 1401 for (j = 0; j < num_edges; j++) | |
| 1402 if (edges[j] && edges[j]->src == bb && edges[j]->dest == e->dest) | |
| 1403 new_edges[j] = e; | |
| 1404 | |
| 1405 if (!(e->dest->flags & BB_DUPLICATED)) | |
| 1406 continue; | |
| 1407 redirect_edge_and_branch_force (e, get_bb_copy (e->dest)); | |
| 1408 } | |
| 1409 } | |
| 1410 | |
| 1411 /* Clear information about duplicates. */ | |
| 1412 for (i = 0; i < n; i++) | |
| 1413 bbs[i]->flags &= ~BB_DUPLICATED; | |
| 1414 } | |
| 1415 | |
| 1416 /* Return true if BB contains only labels or non-executable | |
| 1417 instructions */ | |
| 1418 bool | |
| 1419 empty_block_p (basic_block bb) | |
| 1420 { | |
| 1421 gcc_assert (cfg_hooks->empty_block_p); | |
| 1422 return cfg_hooks->empty_block_p (bb); | |
| 1423 } | |
| 1424 | |
| 1425 /* Split a basic block if it ends with a conditional branch and if | |
| 1426 the other part of the block is not empty. */ | |
| 1427 basic_block | |
| 1428 split_block_before_cond_jump (basic_block bb) | |
| 1429 { | |
| 1430 gcc_assert (cfg_hooks->split_block_before_cond_jump); | |
| 1431 return cfg_hooks->split_block_before_cond_jump (bb); | |
| 1432 } | |
| 1433 | |
| 1434 /* Work-horse for passes.c:check_profile_consistency. | |
| 1435 Do book-keeping of the CFG for the profile consistency checker. | |
| 1436 If AFTER_PASS is 0, do pre-pass accounting, or if AFTER_PASS is 1 | |
| 1437 then do post-pass accounting. Store the counting in RECORD. */ | |
| 1438 | |
| 1439 void | |
| 1440 account_profile_record (struct profile_record *record, int after_pass) | |
| 1441 { | |
| 1442 basic_block bb; | |
| 1443 edge_iterator ei; | |
| 1444 edge e; | |
| 1445 | |
| 1446 FOR_ALL_BB_FN (bb, cfun) | |
| 1447 { | |
| 1448 if (bb != EXIT_BLOCK_PTR_FOR_FN (cfun) | |
| 1449 && profile_status_for_fn (cfun) != PROFILE_ABSENT) | |
| 1450 { | |
| 1451 profile_probability sum = profile_probability::never (); | |
| 1452 FOR_EACH_EDGE (e, ei, bb->succs) | |
| 1453 sum += e->probability; | |
| 1454 if (EDGE_COUNT (bb->succs) | |
| 1455 && sum.differs_from_p (profile_probability::always ())) | |
| 1456 record->num_mismatched_freq_out[after_pass]++; | |
| 1457 profile_count lsum = profile_count::zero (); | |
| 1458 FOR_EACH_EDGE (e, ei, bb->succs) | |
| 1459 lsum += e->count (); | |
| 1460 if (EDGE_COUNT (bb->succs) && (lsum.differs_from_p (bb->count))) | |
| 1461 record->num_mismatched_count_out[after_pass]++; | |
| 1462 } | |
| 1463 if (bb != ENTRY_BLOCK_PTR_FOR_FN (cfun) | |
| 1464 && profile_status_for_fn (cfun) != PROFILE_ABSENT) | |
| 1465 { | |
| 1466 int sum = 0; | |
| 1467 FOR_EACH_EDGE (e, ei, bb->preds) | |
| 1468 sum += EDGE_FREQUENCY (e); | |
| 1469 if (abs (sum - bb->frequency) > 100 | |
| 1470 || (MAX (sum, bb->frequency) > 10 | |
| 1471 && abs ((sum - bb->frequency) * 100 / (MAX (sum, bb->frequency) + 1)) > 10)) | |
| 1472 record->num_mismatched_freq_in[after_pass]++; | |
| 1473 profile_count lsum = profile_count::zero (); | |
| 1474 FOR_EACH_EDGE (e, ei, bb->preds) | |
| 1475 lsum += e->count (); | |
| 1476 if (lsum.differs_from_p (bb->count)) | |
| 1477 record->num_mismatched_count_in[after_pass]++; | |
| 1478 } | |
| 1479 if (bb == ENTRY_BLOCK_PTR_FOR_FN (cfun) | |
| 1480 || bb == EXIT_BLOCK_PTR_FOR_FN (cfun)) | |
| 1481 continue; | |
| 1482 gcc_assert (cfg_hooks->account_profile_record); | |
| 1483 cfg_hooks->account_profile_record (bb, after_pass, record); | |
| 1484 } | |
| 1485 } |