]>
Commit | Line | Data |
---|---|---|
9ee634e3 | 1 | /* Hooks for cfg representation specific functions. |
fa10beec RW |
2 | Copyright (C) 2003, 2004, 2005, 2007, 2008 Free Software Foundation, |
3 | Inc. | |
9ee634e3 JH |
4 | Contributed by Sebastian Pop <s.pop@laposte.net> |
5 | ||
6 | This file is part of GCC. | |
7 | ||
8 | GCC is free software; you can redistribute it and/or modify | |
9 | it under the terms of the GNU General Public License as published by | |
9dcd6f09 | 10 | the Free Software Foundation; either version 3, or (at your option) |
9ee634e3 JH |
11 | any later version. |
12 | ||
13 | GCC is distributed in the hope that it will be useful, | |
14 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
16 | GNU General Public License for more details. | |
17 | ||
18 | You should have received a copy of the GNU General Public License | |
9dcd6f09 NC |
19 | along with GCC; see the file COPYING3. If not see |
20 | <http://www.gnu.org/licenses/>. */ | |
9ee634e3 JH |
21 | |
22 | #include "config.h" | |
23 | #include "system.h" | |
24 | #include "coretypes.h" | |
25 | #include "tm.h" | |
26 | #include "tree.h" | |
27 | #include "rtl.h" | |
28 | #include "basic-block.h" | |
6de9cd9a | 29 | #include "tree-flow.h" |
f470c378 | 30 | #include "timevar.h" |
718f9c0f | 31 | #include "diagnostic-core.h" |
598ec7bd | 32 | #include "cfgloop.h" |
9ee634e3 JH |
33 | |
34 | /* A pointer to one of the hooks containers. */ | |
f470c378 | 35 | static struct cfg_hooks *cfg_hooks; |
9ee634e3 JH |
36 | |
37 | /* Initialization of functions specific to the rtl IR. */ | |
d329e058 AJ |
38 | void |
39 | rtl_register_cfg_hooks (void) | |
9ee634e3 JH |
40 | { |
41 | cfg_hooks = &rtl_cfg_hooks; | |
42 | } | |
43 | ||
44 | /* Initialization of functions specific to the rtl IR. */ | |
d329e058 AJ |
45 | void |
46 | cfg_layout_rtl_register_cfg_hooks (void) | |
9ee634e3 JH |
47 | { |
48 | cfg_hooks = &cfg_layout_rtl_cfg_hooks; | |
49 | } | |
f470c378 | 50 | |
6de9cd9a DN |
51 | /* Initialization of functions specific to the tree IR. */ |
52 | ||
53 | void | |
726a989a | 54 | gimple_register_cfg_hooks (void) |
6de9cd9a | 55 | { |
726a989a | 56 | cfg_hooks = &gimple_cfg_hooks; |
6de9cd9a DN |
57 | } |
58 | ||
e855c69d AB |
59 | struct cfg_hooks |
60 | get_cfg_hooks (void) | |
61 | { | |
62 | return *cfg_hooks; | |
63 | } | |
64 | ||
65 | void | |
66 | set_cfg_hooks (struct cfg_hooks new_cfg_hooks) | |
67 | { | |
68 | *cfg_hooks = new_cfg_hooks; | |
69 | } | |
70 | ||
52bca999 | 71 | /* Returns current ir type. */ |
6de9cd9a | 72 | |
52bca999 SB |
73 | enum ir_type |
74 | current_ir_type (void) | |
6de9cd9a | 75 | { |
726a989a | 76 | if (cfg_hooks == &gimple_cfg_hooks) |
52bca999 SB |
77 | return IR_GIMPLE; |
78 | else if (cfg_hooks == &rtl_cfg_hooks) | |
79 | return IR_RTL_CFGRTL; | |
80 | else if (cfg_hooks == &cfg_layout_rtl_cfg_hooks) | |
81 | return IR_RTL_CFGLAYOUT; | |
82 | else | |
83 | gcc_unreachable (); | |
6de9cd9a DN |
84 | } |
85 | ||
f470c378 ZD |
86 | /* Verify the CFG consistency. |
87 | ||
88 | Currently it does following: checks edge and basic block list correctness | |
89 | and calls into IL dependent checking then. */ | |
90 | ||
24e47c76 | 91 | DEBUG_FUNCTION void |
f470c378 ZD |
92 | verify_flow_info (void) |
93 | { | |
94 | size_t *edge_checksum; | |
50f63b1a | 95 | int err = 0; |
f470c378 ZD |
96 | basic_block bb, last_bb_seen; |
97 | basic_block *last_visited; | |
98 | ||
99 | timevar_push (TV_CFG_VERIFY); | |
5ed6ace5 MD |
100 | last_visited = XCNEWVEC (basic_block, last_basic_block); |
101 | edge_checksum = XCNEWVEC (size_t, last_basic_block); | |
f470c378 ZD |
102 | |
103 | /* Check bb chain & numbers. */ | |
104 | last_bb_seen = ENTRY_BLOCK_PTR; | |
105 | FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR->next_bb, NULL, next_bb) | |
106 | { | |
107 | if (bb != EXIT_BLOCK_PTR | |
108 | && bb != BASIC_BLOCK (bb->index)) | |
109 | { | |
110 | error ("bb %d on wrong place", bb->index); | |
111 | err = 1; | |
112 | } | |
113 | ||
114 | if (bb->prev_bb != last_bb_seen) | |
115 | { | |
116 | error ("prev_bb of %d should be %d, not %d", | |
117 | bb->index, last_bb_seen->index, bb->prev_bb->index); | |
118 | err = 1; | |
119 | } | |
120 | ||
121 | last_bb_seen = bb; | |
122 | } | |
123 | ||
124 | /* Now check the basic blocks (boundaries etc.) */ | |
125 | FOR_EACH_BB_REVERSE (bb) | |
126 | { | |
127 | int n_fallthru = 0; | |
128 | edge e; | |
628f6a4e | 129 | edge_iterator ei; |
f470c378 | 130 | |
598ec7bd ZD |
131 | if (bb->loop_father != NULL && current_loops == NULL) |
132 | { | |
133 | error ("verify_flow_info: Block %i has loop_father, but there are no loops", | |
134 | bb->index); | |
135 | err = 1; | |
136 | } | |
137 | if (bb->loop_father == NULL && current_loops != NULL) | |
138 | { | |
139 | error ("verify_flow_info: Block %i lacks loop_father", bb->index); | |
140 | err = 1; | |
141 | } | |
142 | ||
f470c378 ZD |
143 | if (bb->count < 0) |
144 | { | |
145 | error ("verify_flow_info: Wrong count of block %i %i", | |
c22cacf3 | 146 | bb->index, (int)bb->count); |
f470c378 ZD |
147 | err = 1; |
148 | } | |
149 | if (bb->frequency < 0) | |
150 | { | |
151 | error ("verify_flow_info: Wrong frequency of block %i %i", | |
c22cacf3 | 152 | bb->index, bb->frequency); |
f470c378 ZD |
153 | err = 1; |
154 | } | |
628f6a4e | 155 | FOR_EACH_EDGE (e, ei, bb->succs) |
f470c378 | 156 | { |
24bd1a0b | 157 | if (last_visited [e->dest->index] == bb) |
f470c378 ZD |
158 | { |
159 | error ("verify_flow_info: Duplicate edge %i->%i", | |
160 | e->src->index, e->dest->index); | |
161 | err = 1; | |
162 | } | |
163 | if (e->probability < 0 || e->probability > REG_BR_PROB_BASE) | |
164 | { | |
165 | error ("verify_flow_info: Wrong probability of edge %i->%i %i", | |
166 | e->src->index, e->dest->index, e->probability); | |
167 | err = 1; | |
168 | } | |
169 | if (e->count < 0) | |
170 | { | |
171 | error ("verify_flow_info: Wrong count of edge %i->%i %i", | |
172 | e->src->index, e->dest->index, (int)e->count); | |
173 | err = 1; | |
174 | } | |
175 | ||
24bd1a0b | 176 | last_visited [e->dest->index] = bb; |
f470c378 ZD |
177 | |
178 | if (e->flags & EDGE_FALLTHRU) | |
179 | n_fallthru++; | |
180 | ||
181 | if (e->src != bb) | |
182 | { | |
183 | error ("verify_flow_info: Basic block %d succ edge is corrupted", | |
184 | bb->index); | |
185 | fprintf (stderr, "Predecessor: "); | |
186 | dump_edge_info (stderr, e, 0); | |
187 | fprintf (stderr, "\nSuccessor: "); | |
188 | dump_edge_info (stderr, e, 1); | |
189 | fprintf (stderr, "\n"); | |
190 | err = 1; | |
191 | } | |
192 | ||
24bd1a0b | 193 | edge_checksum[e->dest->index] += (size_t) e; |
f470c378 ZD |
194 | } |
195 | if (n_fallthru > 1) | |
196 | { | |
ab532386 | 197 | error ("wrong amount of branch edges after unconditional jump %i", bb->index); |
f470c378 ZD |
198 | err = 1; |
199 | } | |
200 | ||
628f6a4e | 201 | FOR_EACH_EDGE (e, ei, bb->preds) |
f470c378 ZD |
202 | { |
203 | if (e->dest != bb) | |
204 | { | |
205 | error ("basic block %d pred edge is corrupted", bb->index); | |
206 | fputs ("Predecessor: ", stderr); | |
207 | dump_edge_info (stderr, e, 0); | |
208 | fputs ("\nSuccessor: ", stderr); | |
209 | dump_edge_info (stderr, e, 1); | |
210 | fputc ('\n', stderr); | |
211 | err = 1; | |
212 | } | |
73553871 KH |
213 | |
214 | if (ei.index != e->dest_idx) | |
215 | { | |
216 | error ("basic block %d pred edge is corrupted", bb->index); | |
217 | error ("its dest_idx should be %d, not %d", | |
218 | ei.index, e->dest_idx); | |
219 | fputs ("Predecessor: ", stderr); | |
220 | dump_edge_info (stderr, e, 0); | |
221 | fputs ("\nSuccessor: ", stderr); | |
222 | dump_edge_info (stderr, e, 1); | |
223 | fputc ('\n', stderr); | |
224 | err = 1; | |
225 | } | |
226 | ||
24bd1a0b | 227 | edge_checksum[e->dest->index] -= (size_t) e; |
f470c378 ZD |
228 | } |
229 | } | |
230 | ||
231 | /* Complete edge checksumming for ENTRY and EXIT. */ | |
232 | { | |
233 | edge e; | |
628f6a4e | 234 | edge_iterator ei; |
f470c378 | 235 | |
628f6a4e | 236 | FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs) |
24bd1a0b | 237 | edge_checksum[e->dest->index] += (size_t) e; |
f470c378 | 238 | |
628f6a4e | 239 | FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds) |
24bd1a0b | 240 | edge_checksum[e->dest->index] -= (size_t) e; |
f470c378 ZD |
241 | } |
242 | ||
243 | FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb) | |
24bd1a0b | 244 | if (edge_checksum[bb->index]) |
f470c378 ZD |
245 | { |
246 | error ("basic block %i edge lists are corrupted", bb->index); | |
247 | err = 1; | |
248 | } | |
249 | ||
f470c378 ZD |
250 | last_bb_seen = ENTRY_BLOCK_PTR; |
251 | ||
252 | /* Clean up. */ | |
253 | free (last_visited); | |
254 | free (edge_checksum); | |
255 | ||
256 | if (cfg_hooks->verify_flow_info) | |
257 | err |= cfg_hooks->verify_flow_info (); | |
258 | if (err) | |
259 | internal_error ("verify_flow_info failed"); | |
260 | timevar_pop (TV_CFG_VERIFY); | |
261 | } | |
262 | ||
263 | /* Print out one basic block. This function takes care of the purely | |
264 | graph related information. The cfg hook for the active representation | |
265 | should dump representation-specific information. */ | |
266 | ||
267 | void | |
268 | dump_bb (basic_block bb, FILE *outf, int indent) | |
269 | { | |
270 | edge e; | |
628f6a4e | 271 | edge_iterator ei; |
f470c378 | 272 | char *s_indent; |
c22cacf3 | 273 | |
ae50c0cb | 274 | s_indent = (char *) alloca ((size_t) indent + 1); |
400e39e3 | 275 | memset (s_indent, ' ', (size_t) indent); |
f470c378 ZD |
276 | s_indent[indent] = '\0'; |
277 | ||
278 | fprintf (outf, ";;%s basic block %d, loop depth %d, count ", | |
279 | s_indent, bb->index, bb->loop_depth); | |
280 | fprintf (outf, HOST_WIDEST_INT_PRINT_DEC, (HOST_WIDEST_INT) bb->count); | |
281 | putc ('\n', outf); | |
282 | ||
283 | fprintf (outf, ";;%s prev block ", s_indent); | |
284 | if (bb->prev_bb) | |
285 | fprintf (outf, "%d, ", bb->prev_bb->index); | |
286 | else | |
287 | fprintf (outf, "(nil), "); | |
288 | fprintf (outf, "next block "); | |
289 | if (bb->next_bb) | |
290 | fprintf (outf, "%d", bb->next_bb->index); | |
291 | else | |
292 | fprintf (outf, "(nil)"); | |
293 | putc ('\n', outf); | |
294 | ||
295 | fprintf (outf, ";;%s pred: ", s_indent); | |
628f6a4e | 296 | FOR_EACH_EDGE (e, ei, bb->preds) |
f470c378 ZD |
297 | dump_edge_info (outf, e, 0); |
298 | putc ('\n', outf); | |
299 | ||
300 | fprintf (outf, ";;%s succ: ", s_indent); | |
628f6a4e | 301 | FOR_EACH_EDGE (e, ei, bb->succs) |
f470c378 ZD |
302 | dump_edge_info (outf, e, 1); |
303 | putc ('\n', outf); | |
304 | ||
305 | if (cfg_hooks->dump_bb) | |
726a989a | 306 | cfg_hooks->dump_bb (bb, outf, indent, 0); |
f470c378 ZD |
307 | } |
308 | ||
309 | /* Redirect edge E to the given basic block DEST and update underlying program | |
310 | representation. Returns edge representing redirected branch (that may not | |
311 | be equivalent to E in the case of duplicate edges being removed) or NULL | |
312 | if edge is not easily redirectable for whatever reason. */ | |
313 | ||
6de9cd9a | 314 | edge |
f470c378 ZD |
315 | redirect_edge_and_branch (edge e, basic_block dest) |
316 | { | |
6de9cd9a | 317 | edge ret; |
f470c378 ZD |
318 | |
319 | if (!cfg_hooks->redirect_edge_and_branch) | |
ab532386 | 320 | internal_error ("%s does not support redirect_edge_and_branch", |
f470c378 ZD |
321 | cfg_hooks->name); |
322 | ||
323 | ret = cfg_hooks->redirect_edge_and_branch (e, dest); | |
324 | ||
452ba14d ZD |
325 | /* If RET != E, then either the redirection failed, or the edge E |
326 | was removed since RET already lead to the same destination. */ | |
327 | if (current_loops != NULL && ret == e) | |
328 | rescan_loop_exit (e, false, false); | |
6270df4c | 329 | |
f470c378 ZD |
330 | return ret; |
331 | } | |
332 | ||
14fa2cc0 ZD |
333 | /* Returns true if it is possible to remove the edge E by redirecting it |
334 | to the destination of the other edge going from its source. */ | |
335 | ||
336 | bool | |
9678086d | 337 | can_remove_branch_p (const_edge e) |
14fa2cc0 ZD |
338 | { |
339 | if (!cfg_hooks->can_remove_branch_p) | |
340 | internal_error ("%s does not support can_remove_branch_p", | |
341 | cfg_hooks->name); | |
342 | ||
343 | if (EDGE_COUNT (e->src->succs) != 2) | |
344 | return false; | |
345 | ||
346 | return cfg_hooks->can_remove_branch_p (e); | |
347 | } | |
348 | ||
349 | /* Removes E, by redirecting it to the destination of the other edge going | |
350 | from its source. Can_remove_branch_p must be true for E, hence this | |
351 | operation cannot fail. */ | |
352 | ||
353 | void | |
354 | remove_branch (edge e) | |
355 | { | |
356 | edge other; | |
357 | basic_block src = e->src; | |
358 | int irr; | |
359 | ||
360 | gcc_assert (EDGE_COUNT (e->src->succs) == 2); | |
361 | ||
362 | other = EDGE_SUCC (src, EDGE_SUCC (src, 0) == e); | |
363 | irr = other->flags & EDGE_IRREDUCIBLE_LOOP; | |
364 | ||
14fa2cc0 ZD |
365 | e = redirect_edge_and_branch (e, other->dest); |
366 | gcc_assert (e != NULL); | |
367 | ||
368 | e->flags &= ~EDGE_IRREDUCIBLE_LOOP; | |
369 | e->flags |= irr; | |
370 | } | |
371 | ||
452ba14d ZD |
372 | /* Removes edge E from cfg. Unlike remove_branch, it does not update IL. */ |
373 | ||
374 | void | |
375 | remove_edge (edge e) | |
376 | { | |
377 | if (current_loops != NULL) | |
378 | rescan_loop_exit (e, false, true); | |
379 | ||
380 | remove_edge_raw (e); | |
381 | } | |
382 | ||
f470c378 ZD |
383 | /* Redirect the edge E to basic block DEST even if it requires creating |
384 | of a new basic block; then it returns the newly created basic block. | |
385 | Aborts when redirection is impossible. */ | |
386 | ||
387 | basic_block | |
388 | redirect_edge_and_branch_force (edge e, basic_block dest) | |
389 | { | |
6270df4c | 390 | basic_block ret, src = e->src; |
598ec7bd | 391 | struct loop *loop; |
f470c378 ZD |
392 | |
393 | if (!cfg_hooks->redirect_edge_and_branch_force) | |
ab532386 | 394 | internal_error ("%s does not support redirect_edge_and_branch_force", |
f470c378 ZD |
395 | cfg_hooks->name); |
396 | ||
6270df4c ZD |
397 | if (current_loops != NULL) |
398 | rescan_loop_exit (e, false, true); | |
399 | ||
f470c378 | 400 | ret = cfg_hooks->redirect_edge_and_branch_force (e, dest); |
89f8f30f ZD |
401 | if (ret != NULL |
402 | && dom_info_available_p (CDI_DOMINATORS)) | |
403 | set_immediate_dominator (CDI_DOMINATORS, ret, src); | |
404 | ||
6270df4c | 405 | if (current_loops != NULL) |
598ec7bd | 406 | { |
6270df4c ZD |
407 | if (ret != NULL) |
408 | { | |
409 | loop = find_common_loop (single_pred (ret)->loop_father, | |
410 | single_succ (ret)->loop_father); | |
411 | add_bb_to_loop (ret, loop); | |
412 | } | |
413 | else if (find_edge (src, dest) == e) | |
414 | rescan_loop_exit (e, true, false); | |
598ec7bd | 415 | } |
f470c378 ZD |
416 | |
417 | return ret; | |
418 | } | |
419 | ||
420 | /* Splits basic block BB after the specified instruction I (but at least after | |
421 | the labels). If I is NULL, splits just after labels. The newly created edge | |
422 | is returned. The new basic block is created just after the old one. */ | |
423 | ||
424 | edge | |
425 | split_block (basic_block bb, void *i) | |
426 | { | |
427 | basic_block new_bb; | |
ede7cba0 | 428 | edge res; |
f470c378 ZD |
429 | |
430 | if (!cfg_hooks->split_block) | |
ab532386 | 431 | internal_error ("%s does not support split_block", cfg_hooks->name); |
f470c378 ZD |
432 | |
433 | new_bb = cfg_hooks->split_block (bb, i); | |
434 | if (!new_bb) | |
435 | return NULL; | |
436 | ||
437 | new_bb->count = bb->count; | |
438 | new_bb->frequency = bb->frequency; | |
439 | new_bb->loop_depth = bb->loop_depth; | |
cbea518e | 440 | new_bb->discriminator = bb->discriminator; |
f470c378 | 441 | |
fce22de5 | 442 | if (dom_info_available_p (CDI_DOMINATORS)) |
f470c378 ZD |
443 | { |
444 | redirect_immediate_dominators (CDI_DOMINATORS, bb, new_bb); | |
445 | set_immediate_dominator (CDI_DOMINATORS, new_bb, bb); | |
446 | } | |
447 | ||
598ec7bd | 448 | if (current_loops != NULL) |
dbdc7f97 ZD |
449 | { |
450 | add_bb_to_loop (new_bb, bb->loop_father); | |
451 | if (bb->loop_father->latch == bb) | |
452 | bb->loop_father->latch = new_bb; | |
453 | } | |
598ec7bd | 454 | |
ede7cba0 SP |
455 | res = make_single_succ_edge (bb, new_bb, EDGE_FALLTHRU); |
456 | ||
457 | if (bb->flags & BB_IRREDUCIBLE_LOOP) | |
458 | { | |
459 | new_bb->flags |= BB_IRREDUCIBLE_LOOP; | |
460 | res->flags |= EDGE_IRREDUCIBLE_LOOP; | |
461 | } | |
462 | ||
463 | return res; | |
f470c378 ZD |
464 | } |
465 | ||
466 | /* Splits block BB just after labels. The newly created edge is returned. */ | |
467 | ||
468 | edge | |
469 | split_block_after_labels (basic_block bb) | |
470 | { | |
471 | return split_block (bb, NULL); | |
472 | } | |
473 | ||
321440fd | 474 | /* Moves block BB immediately after block AFTER. Returns false if the |
f470c378 ZD |
475 | movement was impossible. */ |
476 | ||
477 | bool | |
478 | move_block_after (basic_block bb, basic_block after) | |
479 | { | |
480 | bool ret; | |
481 | ||
482 | if (!cfg_hooks->move_block_after) | |
ab532386 | 483 | internal_error ("%s does not support move_block_after", cfg_hooks->name); |
f470c378 ZD |
484 | |
485 | ret = cfg_hooks->move_block_after (bb, after); | |
486 | ||
487 | return ret; | |
488 | } | |
489 | ||
490 | /* Deletes the basic block BB. */ | |
491 | ||
492 | void | |
493 | delete_basic_block (basic_block bb) | |
494 | { | |
495 | if (!cfg_hooks->delete_basic_block) | |
ab532386 | 496 | internal_error ("%s does not support delete_basic_block", cfg_hooks->name); |
f470c378 ZD |
497 | |
498 | cfg_hooks->delete_basic_block (bb); | |
499 | ||
598ec7bd ZD |
500 | if (current_loops != NULL) |
501 | { | |
502 | struct loop *loop = bb->loop_father; | |
503 | ||
504 | /* If we remove the header or the latch of a loop, mark the loop for | |
505 | removal by setting its header and latch to NULL. */ | |
506 | if (loop->latch == bb | |
507 | || loop->header == bb) | |
508 | { | |
509 | loop->header = NULL; | |
510 | loop->latch = NULL; | |
511 | } | |
512 | ||
513 | remove_bb_from_loops (bb); | |
514 | } | |
515 | ||
f470c378 ZD |
516 | /* Remove the edges into and out of this block. Note that there may |
517 | indeed be edges in, if we are removing an unreachable loop. */ | |
628f6a4e BE |
518 | while (EDGE_COUNT (bb->preds) != 0) |
519 | remove_edge (EDGE_PRED (bb, 0)); | |
520 | while (EDGE_COUNT (bb->succs) != 0) | |
521 | remove_edge (EDGE_SUCC (bb, 0)); | |
f470c378 | 522 | |
2b28c07a | 523 | if (dom_info_available_p (CDI_DOMINATORS)) |
f470c378 | 524 | delete_from_dominance_info (CDI_DOMINATORS, bb); |
2b28c07a | 525 | if (dom_info_available_p (CDI_POST_DOMINATORS)) |
f470c378 ZD |
526 | delete_from_dominance_info (CDI_POST_DOMINATORS, bb); |
527 | ||
528 | /* Remove the basic block from the array. */ | |
529 | expunge_block (bb); | |
530 | } | |
531 | ||
532 | /* Splits edge E and returns the newly created basic block. */ | |
533 | ||
534 | basic_block | |
535 | split_edge (edge e) | |
536 | { | |
537 | basic_block ret; | |
538 | gcov_type count = e->count; | |
539 | int freq = EDGE_FREQUENCY (e); | |
017b3258 | 540 | edge f; |
a746fd8c | 541 | bool irr = (e->flags & EDGE_IRREDUCIBLE_LOOP) != 0; |
598ec7bd ZD |
542 | struct loop *loop; |
543 | basic_block src = e->src, dest = e->dest; | |
f470c378 ZD |
544 | |
545 | if (!cfg_hooks->split_edge) | |
ab532386 | 546 | internal_error ("%s does not support split_edge", cfg_hooks->name); |
f470c378 | 547 | |
6270df4c ZD |
548 | if (current_loops != NULL) |
549 | rescan_loop_exit (e, false, true); | |
550 | ||
f470c378 ZD |
551 | ret = cfg_hooks->split_edge (e); |
552 | ret->count = count; | |
553 | ret->frequency = freq; | |
c5cbcccf ZD |
554 | single_succ_edge (ret)->probability = REG_BR_PROB_BASE; |
555 | single_succ_edge (ret)->count = count; | |
f470c378 | 556 | |
a746fd8c ZD |
557 | if (irr) |
558 | { | |
559 | ret->flags |= BB_IRREDUCIBLE_LOOP; | |
c5cbcccf ZD |
560 | single_pred_edge (ret)->flags |= EDGE_IRREDUCIBLE_LOOP; |
561 | single_succ_edge (ret)->flags |= EDGE_IRREDUCIBLE_LOOP; | |
a746fd8c ZD |
562 | } |
563 | ||
2b28c07a | 564 | if (dom_info_available_p (CDI_DOMINATORS)) |
c5cbcccf | 565 | set_immediate_dominator (CDI_DOMINATORS, ret, single_pred (ret)); |
f470c378 | 566 | |
2b28c07a | 567 | if (dom_info_state (CDI_DOMINATORS) >= DOM_NO_FAST_QUERY) |
017b3258 ZD |
568 | { |
569 | /* There are two cases: | |
570 | ||
571 | If the immediate dominator of e->dest is not e->src, it | |
572 | remains unchanged. | |
573 | ||
574 | If immediate dominator of e->dest is e->src, it may become | |
575 | ret, provided that all other predecessors of e->dest are | |
576 | dominated by e->dest. */ | |
577 | ||
c5cbcccf ZD |
578 | if (get_immediate_dominator (CDI_DOMINATORS, single_succ (ret)) |
579 | == single_pred (ret)) | |
017b3258 | 580 | { |
628f6a4e | 581 | edge_iterator ei; |
c5cbcccf | 582 | FOR_EACH_EDGE (f, ei, single_succ (ret)->preds) |
017b3258 | 583 | { |
c5cbcccf | 584 | if (f == single_succ_edge (ret)) |
017b3258 ZD |
585 | continue; |
586 | ||
587 | if (!dominated_by_p (CDI_DOMINATORS, f->src, | |
c5cbcccf | 588 | single_succ (ret))) |
017b3258 ZD |
589 | break; |
590 | } | |
591 | ||
592 | if (!f) | |
c5cbcccf | 593 | set_immediate_dominator (CDI_DOMINATORS, single_succ (ret), ret); |
017b3258 | 594 | } |
598ec7bd ZD |
595 | } |
596 | ||
597 | if (current_loops != NULL) | |
598 | { | |
599 | loop = find_common_loop (src->loop_father, dest->loop_father); | |
600 | add_bb_to_loop (ret, loop); | |
601 | ||
602 | if (loop->latch == src) | |
603 | loop->latch = ret; | |
604 | } | |
f470c378 ZD |
605 | |
606 | return ret; | |
607 | } | |
608 | ||
609 | /* Creates a new basic block just after the basic block AFTER. | |
610 | HEAD and END are the first and the last statement belonging | |
611 | to the block. If both are NULL, an empty block is created. */ | |
612 | ||
613 | basic_block | |
614 | create_basic_block (void *head, void *end, basic_block after) | |
615 | { | |
616 | basic_block ret; | |
617 | ||
618 | if (!cfg_hooks->create_basic_block) | |
ab532386 | 619 | internal_error ("%s does not support create_basic_block", cfg_hooks->name); |
f470c378 ZD |
620 | |
621 | ret = cfg_hooks->create_basic_block (head, end, after); | |
622 | ||
2b28c07a | 623 | if (dom_info_available_p (CDI_DOMINATORS)) |
f470c378 | 624 | add_to_dominance_info (CDI_DOMINATORS, ret); |
2b28c07a | 625 | if (dom_info_available_p (CDI_POST_DOMINATORS)) |
f470c378 ZD |
626 | add_to_dominance_info (CDI_POST_DOMINATORS, ret); |
627 | ||
628 | return ret; | |
629 | } | |
630 | ||
631 | /* Creates an empty basic block just after basic block AFTER. */ | |
632 | ||
633 | basic_block | |
634 | create_empty_bb (basic_block after) | |
635 | { | |
636 | return create_basic_block (NULL, NULL, after); | |
637 | } | |
638 | ||
639 | /* Checks whether we may merge blocks BB1 and BB2. */ | |
640 | ||
641 | bool | |
b48d0358 | 642 | can_merge_blocks_p (basic_block bb1, basic_block bb2) |
f470c378 ZD |
643 | { |
644 | bool ret; | |
645 | ||
646 | if (!cfg_hooks->can_merge_blocks_p) | |
ab532386 | 647 | internal_error ("%s does not support can_merge_blocks_p", cfg_hooks->name); |
f470c378 ZD |
648 | |
649 | ret = cfg_hooks->can_merge_blocks_p (bb1, bb2); | |
650 | ||
651 | return ret; | |
652 | } | |
653 | ||
6de9cd9a DN |
654 | void |
655 | predict_edge (edge e, enum br_predictor predictor, int probability) | |
656 | { | |
657 | if (!cfg_hooks->predict_edge) | |
ab532386 | 658 | internal_error ("%s does not support predict_edge", cfg_hooks->name); |
6de9cd9a DN |
659 | |
660 | cfg_hooks->predict_edge (e, predictor, probability); | |
661 | } | |
662 | ||
663 | bool | |
9678086d | 664 | predicted_by_p (const_basic_block bb, enum br_predictor predictor) |
6de9cd9a DN |
665 | { |
666 | if (!cfg_hooks->predict_edge) | |
ab532386 | 667 | internal_error ("%s does not support predicted_by_p", cfg_hooks->name); |
6de9cd9a DN |
668 | |
669 | return cfg_hooks->predicted_by_p (bb, predictor); | |
670 | } | |
671 | ||
f470c378 ZD |
672 | /* Merges basic block B into basic block A. */ |
673 | ||
674 | void | |
675 | merge_blocks (basic_block a, basic_block b) | |
676 | { | |
677 | edge e; | |
628f6a4e | 678 | edge_iterator ei; |
f470c378 ZD |
679 | |
680 | if (!cfg_hooks->merge_blocks) | |
ab532386 | 681 | internal_error ("%s does not support merge_blocks", cfg_hooks->name); |
f470c378 | 682 | |
9e824336 ZD |
683 | cfg_hooks->merge_blocks (a, b); |
684 | ||
598ec7bd ZD |
685 | if (current_loops != NULL) |
686 | remove_bb_from_loops (b); | |
687 | ||
f470c378 ZD |
688 | /* Normally there should only be one successor of A and that is B, but |
689 | partway though the merge of blocks for conditional_execution we'll | |
690 | be merging a TEST block with THEN and ELSE successors. Free the | |
691 | whole lot of them and hope the caller knows what they're doing. */ | |
628f6a4e BE |
692 | |
693 | while (EDGE_COUNT (a->succs) != 0) | |
452ba14d | 694 | remove_edge (EDGE_SUCC (a, 0)); |
f470c378 ZD |
695 | |
696 | /* Adjust the edges out of B for the new owner. */ | |
628f6a4e | 697 | FOR_EACH_EDGE (e, ei, b->succs) |
6270df4c ZD |
698 | { |
699 | e->src = a; | |
700 | if (current_loops != NULL) | |
701 | rescan_loop_exit (e, true, false); | |
702 | } | |
628f6a4e | 703 | a->succs = b->succs; |
f470c378 ZD |
704 | a->flags |= b->flags; |
705 | ||
706 | /* B hasn't quite yet ceased to exist. Attempt to prevent mishap. */ | |
628f6a4e | 707 | b->preds = b->succs = NULL; |
f470c378 | 708 | |
2b28c07a | 709 | if (dom_info_available_p (CDI_DOMINATORS)) |
f470c378 ZD |
710 | redirect_immediate_dominators (CDI_DOMINATORS, b, a); |
711 | ||
2b28c07a | 712 | if (dom_info_available_p (CDI_DOMINATORS)) |
f470c378 | 713 | delete_from_dominance_info (CDI_DOMINATORS, b); |
2b28c07a | 714 | if (dom_info_available_p (CDI_POST_DOMINATORS)) |
f470c378 ZD |
715 | delete_from_dominance_info (CDI_POST_DOMINATORS, b); |
716 | ||
717 | expunge_block (b); | |
718 | } | |
719 | ||
720 | /* Split BB into entry part and the rest (the rest is the newly created block). | |
721 | Redirect those edges for that REDIRECT_EDGE_P returns true to the entry | |
722 | part. Returns the edge connecting the entry part to the rest. */ | |
723 | ||
724 | edge | |
725 | make_forwarder_block (basic_block bb, bool (*redirect_edge_p) (edge), | |
726 | void (*new_bb_cbk) (basic_block)) | |
727 | { | |
628f6a4e BE |
728 | edge e, fallthru; |
729 | edge_iterator ei; | |
f470c378 | 730 | basic_block dummy, jump; |
598ec7bd | 731 | struct loop *loop, *ploop, *cloop; |
f470c378 ZD |
732 | |
733 | if (!cfg_hooks->make_forwarder_block) | |
ab532386 | 734 | internal_error ("%s does not support make_forwarder_block", |
f470c378 ZD |
735 | cfg_hooks->name); |
736 | ||
737 | fallthru = split_block_after_labels (bb); | |
738 | dummy = fallthru->src; | |
739 | bb = fallthru->dest; | |
740 | ||
741 | /* Redirect back edges we want to keep. */ | |
628f6a4e | 742 | for (ei = ei_start (dummy->preds); (e = ei_safe_edge (ei)); ) |
f470c378 | 743 | { |
e855c69d AB |
744 | basic_block e_src; |
745 | ||
f470c378 | 746 | if (redirect_edge_p (e)) |
628f6a4e BE |
747 | { |
748 | ei_next (&ei); | |
749 | continue; | |
750 | } | |
f470c378 ZD |
751 | |
752 | dummy->frequency -= EDGE_FREQUENCY (e); | |
753 | dummy->count -= e->count; | |
754 | if (dummy->frequency < 0) | |
755 | dummy->frequency = 0; | |
756 | if (dummy->count < 0) | |
757 | dummy->count = 0; | |
649b2789 PH |
758 | fallthru->count -= e->count; |
759 | if (fallthru->count < 0) | |
760 | fallthru->count = 0; | |
f470c378 | 761 | |
e855c69d | 762 | e_src = e->src; |
f470c378 | 763 | jump = redirect_edge_and_branch_force (e, bb); |
e855c69d AB |
764 | if (jump != NULL) |
765 | { | |
766 | /* If we redirected the loop latch edge, the JUMP block now acts like | |
767 | the new latch of the loop. */ | |
768 | if (current_loops != NULL | |
769 | && dummy->loop_father != NULL | |
770 | && dummy->loop_father->header == dummy | |
771 | && dummy->loop_father->latch == e_src) | |
772 | dummy->loop_father->latch = jump; | |
b8698a0f | 773 | |
e855c69d AB |
774 | if (new_bb_cbk != NULL) |
775 | new_bb_cbk (jump); | |
776 | } | |
f470c378 ZD |
777 | } |
778 | ||
fce22de5 | 779 | if (dom_info_available_p (CDI_DOMINATORS)) |
f470c378 | 780 | { |
66f97d31 ZD |
781 | VEC (basic_block, heap) *doms_to_fix = VEC_alloc (basic_block, heap, 2); |
782 | VEC_quick_push (basic_block, doms_to_fix, dummy); | |
783 | VEC_quick_push (basic_block, doms_to_fix, bb); | |
784 | iterate_fix_dominators (CDI_DOMINATORS, doms_to_fix, false); | |
785 | VEC_free (basic_block, heap, doms_to_fix); | |
f470c378 ZD |
786 | } |
787 | ||
598ec7bd ZD |
788 | if (current_loops != NULL) |
789 | { | |
790 | /* If we do not split a loop header, then both blocks belong to the | |
791 | same loop. In case we split loop header and do not redirect the | |
792 | latch edge to DUMMY, then DUMMY belongs to the outer loop, and | |
89f8f30f ZD |
793 | BB becomes the new header. If latch is not recorded for the loop, |
794 | we leave this updating on the caller (this may only happen during | |
795 | loop analysis). */ | |
598ec7bd ZD |
796 | loop = dummy->loop_father; |
797 | if (loop->header == dummy | |
89f8f30f | 798 | && loop->latch != NULL |
598ec7bd ZD |
799 | && find_edge (loop->latch, dummy) == NULL) |
800 | { | |
801 | remove_bb_from_loops (dummy); | |
802 | loop->header = bb; | |
803 | ||
804 | cloop = loop; | |
805 | FOR_EACH_EDGE (e, ei, dummy->preds) | |
806 | { | |
807 | cloop = find_common_loop (cloop, e->src->loop_father); | |
808 | } | |
809 | add_bb_to_loop (dummy, cloop); | |
810 | } | |
811 | ||
812 | /* In case we split loop latch, update it. */ | |
9ba025a2 | 813 | for (ploop = loop; ploop; ploop = loop_outer (ploop)) |
598ec7bd ZD |
814 | if (ploop->latch == dummy) |
815 | ploop->latch = bb; | |
816 | } | |
817 | ||
f470c378 ZD |
818 | cfg_hooks->make_forwarder_block (fallthru); |
819 | ||
820 | return fallthru; | |
821 | } | |
822 | ||
823 | void | |
824 | tidy_fallthru_edge (edge e) | |
825 | { | |
826 | if (cfg_hooks->tidy_fallthru_edge) | |
827 | cfg_hooks->tidy_fallthru_edge (e); | |
828 | } | |
829 | ||
830 | /* Fix up edges that now fall through, or rather should now fall through | |
831 | but previously required a jump around now deleted blocks. Simplify | |
832 | the search by only examining blocks numerically adjacent, since this | |
3cabd6d1 | 833 | is how they were created. */ |
f470c378 ZD |
834 | |
835 | void | |
836 | tidy_fallthru_edges (void) | |
837 | { | |
838 | basic_block b, c; | |
839 | ||
840 | if (!cfg_hooks->tidy_fallthru_edge) | |
841 | return; | |
842 | ||
843 | if (ENTRY_BLOCK_PTR->next_bb == EXIT_BLOCK_PTR) | |
844 | return; | |
845 | ||
846 | FOR_BB_BETWEEN (b, ENTRY_BLOCK_PTR->next_bb, EXIT_BLOCK_PTR->prev_bb, next_bb) | |
847 | { | |
848 | edge s; | |
849 | ||
850 | c = b->next_bb; | |
851 | ||
852 | /* We care about simple conditional or unconditional jumps with | |
853 | a single successor. | |
854 | ||
855 | If we had a conditional branch to the next instruction when | |
3cabd6d1 LB |
856 | CFG was built, then there will only be one out edge for the |
857 | block which ended with the conditional branch (since we do | |
858 | not create duplicate edges). | |
f470c378 ZD |
859 | |
860 | Furthermore, the edge will be marked as a fallthru because we | |
861 | merge the flags for the duplicate edges. So we do not want to | |
862 | check that the edge is not a FALLTHRU edge. */ | |
863 | ||
c5cbcccf | 864 | if (single_succ_p (b)) |
628f6a4e | 865 | { |
c5cbcccf | 866 | s = single_succ_edge (b); |
628f6a4e BE |
867 | if (! (s->flags & EDGE_COMPLEX) |
868 | && s->dest == c | |
869 | && !find_reg_note (BB_END (b), REG_CROSSING_JUMP, NULL_RTX)) | |
870 | tidy_fallthru_edge (s); | |
871 | } | |
f470c378 ZD |
872 | } |
873 | } | |
6de9cd9a DN |
874 | |
875 | /* Returns true if we can duplicate basic block BB. */ | |
876 | ||
877 | bool | |
9678086d | 878 | can_duplicate_block_p (const_basic_block bb) |
6de9cd9a | 879 | { |
6de9cd9a | 880 | if (!cfg_hooks->can_duplicate_block_p) |
ab532386 | 881 | internal_error ("%s does not support can_duplicate_block_p", |
6de9cd9a DN |
882 | cfg_hooks->name); |
883 | ||
884 | if (bb == EXIT_BLOCK_PTR || bb == ENTRY_BLOCK_PTR) | |
885 | return false; | |
886 | ||
6de9cd9a DN |
887 | return cfg_hooks->can_duplicate_block_p (bb); |
888 | } | |
889 | ||
890 | /* Duplicates basic block BB and redirects edge E to it. Returns the | |
b9a66240 ZD |
891 | new basic block. The new basic block is placed after the basic block |
892 | AFTER. */ | |
6de9cd9a DN |
893 | |
894 | basic_block | |
b9a66240 | 895 | duplicate_block (basic_block bb, edge e, basic_block after) |
6de9cd9a DN |
896 | { |
897 | edge s, n; | |
898 | basic_block new_bb; | |
899 | gcov_type new_count = e ? e->count : 0; | |
628f6a4e | 900 | edge_iterator ei; |
6de9cd9a DN |
901 | |
902 | if (!cfg_hooks->duplicate_block) | |
ab532386 | 903 | internal_error ("%s does not support duplicate_block", |
6de9cd9a DN |
904 | cfg_hooks->name); |
905 | ||
906 | if (bb->count < new_count) | |
907 | new_count = bb->count; | |
e376fe58 | 908 | |
77a74ed7 | 909 | gcc_checking_assert (can_duplicate_block_p (bb)); |
6de9cd9a DN |
910 | |
911 | new_bb = cfg_hooks->duplicate_block (bb); | |
b9a66240 ZD |
912 | if (after) |
913 | move_block_after (new_bb, after); | |
6de9cd9a DN |
914 | |
915 | new_bb->loop_depth = bb->loop_depth; | |
916 | new_bb->flags = bb->flags; | |
628f6a4e | 917 | FOR_EACH_EDGE (s, ei, bb->succs) |
6de9cd9a DN |
918 | { |
919 | /* Since we are creating edges from a new block to successors | |
920 | of another block (which therefore are known to be disjoint), there | |
921 | is no need to actually check for duplicated edges. */ | |
922 | n = unchecked_make_edge (new_bb, s->dest, s->flags); | |
923 | n->probability = s->probability; | |
924 | if (e && bb->count) | |
925 | { | |
926 | /* Take care for overflows! */ | |
927 | n->count = s->count * (new_count * 10000 / bb->count) / 10000; | |
928 | s->count -= n->count; | |
929 | } | |
930 | else | |
931 | n->count = s->count; | |
932 | n->aux = s->aux; | |
933 | } | |
934 | ||
935 | if (e) | |
936 | { | |
937 | new_bb->count = new_count; | |
938 | bb->count -= new_count; | |
939 | ||
940 | new_bb->frequency = EDGE_FREQUENCY (e); | |
941 | bb->frequency -= EDGE_FREQUENCY (e); | |
942 | ||
943 | redirect_edge_and_branch_force (e, new_bb); | |
944 | ||
945 | if (bb->count < 0) | |
946 | bb->count = 0; | |
947 | if (bb->frequency < 0) | |
948 | bb->frequency = 0; | |
949 | } | |
950 | else | |
951 | { | |
952 | new_bb->count = bb->count; | |
953 | new_bb->frequency = bb->frequency; | |
954 | } | |
955 | ||
6580ee77 JH |
956 | set_bb_original (new_bb, bb); |
957 | set_bb_copy (bb, new_bb); | |
6de9cd9a | 958 | |
b02b9b53 ZD |
959 | /* Add the new block to the copy of the loop of BB, or directly to the loop |
960 | of BB if the loop is not being copied. */ | |
598ec7bd | 961 | if (current_loops != NULL) |
b02b9b53 ZD |
962 | { |
963 | struct loop *cloop = bb->loop_father; | |
561e8a90 ZD |
964 | struct loop *copy = get_loop_copy (cloop); |
965 | add_bb_to_loop (new_bb, copy ? copy : cloop); | |
b02b9b53 | 966 | } |
598ec7bd | 967 | |
6de9cd9a DN |
968 | return new_bb; |
969 | } | |
970 | ||
971 | /* Return 1 if BB ends with a call, possibly followed by some | |
972 | instructions that must stay with the call, 0 otherwise. */ | |
973 | ||
c22cacf3 | 974 | bool |
b48d0358 | 975 | block_ends_with_call_p (basic_block bb) |
6de9cd9a DN |
976 | { |
977 | if (!cfg_hooks->block_ends_with_call_p) | |
978 | internal_error ("%s does not support block_ends_with_call_p", cfg_hooks->name); | |
979 | ||
980 | return (cfg_hooks->block_ends_with_call_p) (bb); | |
981 | } | |
982 | ||
983 | /* Return 1 if BB ends with a conditional branch, 0 otherwise. */ | |
984 | ||
c22cacf3 | 985 | bool |
9678086d | 986 | block_ends_with_condjump_p (const_basic_block bb) |
6de9cd9a DN |
987 | { |
988 | if (!cfg_hooks->block_ends_with_condjump_p) | |
989 | internal_error ("%s does not support block_ends_with_condjump_p", | |
990 | cfg_hooks->name); | |
991 | ||
992 | return (cfg_hooks->block_ends_with_condjump_p) (bb); | |
993 | } | |
994 | ||
995 | /* Add fake edges to the function exit for any non constant and non noreturn | |
996 | calls, volatile inline assembly in the bitmap of blocks specified by | |
997 | BLOCKS or to the whole CFG if BLOCKS is zero. Return the number of blocks | |
998 | that were split. | |
999 | ||
1000 | The goal is to expose cases in which entering a basic block does not imply | |
1001 | that all subsequent instructions must be executed. */ | |
1002 | ||
1003 | int | |
1004 | flow_call_edges_add (sbitmap blocks) | |
1005 | { | |
1006 | if (!cfg_hooks->flow_call_edges_add) | |
c22cacf3 | 1007 | internal_error ("%s does not support flow_call_edges_add", |
6de9cd9a DN |
1008 | cfg_hooks->name); |
1009 | ||
1010 | return (cfg_hooks->flow_call_edges_add) (blocks); | |
1011 | } | |
d9d4706f KH |
1012 | |
1013 | /* This function is called immediately after edge E is added to the | |
1014 | edge vector E->dest->preds. */ | |
1015 | ||
1016 | void | |
1017 | execute_on_growing_pred (edge e) | |
1018 | { | |
1019 | if (cfg_hooks->execute_on_growing_pred) | |
1020 | cfg_hooks->execute_on_growing_pred (e); | |
1021 | } | |
1022 | ||
1023 | /* This function is called immediately before edge E is removed from | |
1024 | the edge vector E->dest->preds. */ | |
1025 | ||
1026 | void | |
1027 | execute_on_shrinking_pred (edge e) | |
1028 | { | |
1029 | if (cfg_hooks->execute_on_shrinking_pred) | |
1030 | cfg_hooks->execute_on_shrinking_pred (e); | |
1031 | } | |
1cb7dfc3 | 1032 | |
c22cacf3 MS |
1033 | /* This is used inside loop versioning when we want to insert |
1034 | stmts/insns on the edges, which have a different behavior | |
1cb7dfc3 MH |
1035 | in tree's and in RTL, so we made a CFG hook. */ |
1036 | void | |
1037 | lv_flush_pending_stmts (edge e) | |
1038 | { | |
1039 | if (cfg_hooks->flush_pending_stmts) | |
1040 | cfg_hooks->flush_pending_stmts (e); | |
1041 | } | |
1042 | ||
1043 | /* Loop versioning uses the duplicate_loop_to_header_edge to create | |
1044 | a new version of the loop basic-blocks, the parameters here are | |
1045 | exactly the same as in duplicate_loop_to_header_edge or | |
1046 | tree_duplicate_loop_to_header_edge; while in tree-ssa there is | |
1047 | additional work to maintain ssa information that's why there is | |
1048 | a need to call the tree_duplicate_loop_to_header_edge rather | |
1049 | than duplicate_loop_to_header_edge when we are in tree mode. */ | |
1050 | bool | |
1051 | cfg_hook_duplicate_loop_to_header_edge (struct loop *loop, edge e, | |
d73be268 | 1052 | unsigned int ndupl, |
1cb7dfc3 | 1053 | sbitmap wont_exit, edge orig, |
ee8c1b05 ZD |
1054 | VEC (edge, heap) **to_remove, |
1055 | int flags) | |
1cb7dfc3 MH |
1056 | { |
1057 | gcc_assert (cfg_hooks->cfg_hook_duplicate_loop_to_header_edge); | |
d73be268 | 1058 | return cfg_hooks->cfg_hook_duplicate_loop_to_header_edge (loop, e, |
1cb7dfc3 MH |
1059 | ndupl, wont_exit, |
1060 | orig, to_remove, | |
ee8c1b05 | 1061 | flags); |
1cb7dfc3 MH |
1062 | } |
1063 | ||
1064 | /* Conditional jumps are represented differently in trees and RTL, | |
1065 | this hook takes a basic block that is known to have a cond jump | |
fa10beec | 1066 | at its end and extracts the taken and not taken edges out of it |
1cb7dfc3 MH |
1067 | and store it in E1 and E2 respectively. */ |
1068 | void | |
1069 | extract_cond_bb_edges (basic_block b, edge *e1, edge *e2) | |
1070 | { | |
1071 | gcc_assert (cfg_hooks->extract_cond_bb_edges); | |
1072 | cfg_hooks->extract_cond_bb_edges (b, e1, e2); | |
1073 | } | |
1074 | ||
1075 | /* Responsible for updating the ssa info (PHI nodes) on the | |
315682fb | 1076 | new condition basic block that guards the versioned loop. */ |
1cb7dfc3 MH |
1077 | void |
1078 | lv_adjust_loop_header_phi (basic_block first, basic_block second, | |
ae50c0cb | 1079 | basic_block new_block, edge e) |
1cb7dfc3 MH |
1080 | { |
1081 | if (cfg_hooks->lv_adjust_loop_header_phi) | |
ae50c0cb | 1082 | cfg_hooks->lv_adjust_loop_header_phi (first, second, new_block, e); |
1cb7dfc3 MH |
1083 | } |
1084 | ||
1085 | /* Conditions in trees and RTL are different so we need | |
1086 | a different handling when we add the condition to the | |
1087 | versioning code. */ | |
1088 | void | |
1089 | lv_add_condition_to_bb (basic_block first, basic_block second, | |
ae50c0cb | 1090 | basic_block new_block, void *cond) |
1cb7dfc3 MH |
1091 | { |
1092 | gcc_assert (cfg_hooks->lv_add_condition_to_bb); | |
ae50c0cb | 1093 | cfg_hooks->lv_add_condition_to_bb (first, second, new_block, cond); |
c22cacf3 | 1094 | } |