]>
Commit | Line | Data |
---|---|---|
ca6c03ca JH |
1 | /* Control flow graph manipulation code for GNU compiler. |
2 | Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, | |
a3e6a37b JJ |
3 | 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, |
4 | 2011, 2012 Free Software Foundation, Inc. | |
ca6c03ca JH |
5 | |
6 | This file is part of GCC. | |
7 | ||
8 | GCC is free software; you can redistribute it and/or modify it under | |
9 | the terms of the GNU General Public License as published by the Free | |
9dcd6f09 | 10 | Software Foundation; either version 3, or (at your option) any later |
ca6c03ca JH |
11 | version. |
12 | ||
13 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
14 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
15 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
16 | 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/>. */ | |
ca6c03ca | 21 | |
5f0d2358 RK |
22 | /* This file contains low level functions to manipulate the CFG and analyze it |
23 | that are aware of the RTL intermediate language. | |
ca6c03ca JH |
24 | |
25 | Available functionality: | |
bc35512f | 26 | - Basic CFG/RTL manipulation API documented in cfghooks.h |
5f0d2358 | 27 | - CFG-aware instruction chain manipulation |
ca6c03ca | 28 | delete_insn, delete_insn_chain |
bc35512f JH |
29 | - Edge splitting and committing to edges |
30 | insert_insn_on_edge, commit_edge_insertions | |
31 | - CFG updating after insn simplification | |
32 | purge_dead_edges, purge_all_dead_edges | |
ba5e9aca EB |
33 | - CFG fixing after coarse manipulation |
34 | fixup_abnormal_edges | |
bc35512f JH |
35 | |
36 | Functions not supposed for generic use: | |
5f0d2358 | 37 | - Infrastructure to determine quickly basic block for insn |
ca6c03ca | 38 | compute_bb_for_insn, update_bb_for_insn, set_block_for_insn, |
5f0d2358 | 39 | - Edge redirection with updating and optimizing of insn chain |
bc35512f | 40 | block_label, tidy_fallthru_edge, force_nonfallthru */ |
ca6c03ca JH |
41 | \f |
42 | #include "config.h" | |
43 | #include "system.h" | |
4977bab6 ZW |
44 | #include "coretypes.h" |
45 | #include "tm.h" | |
ca6c03ca | 46 | #include "tree.h" |
ca6c03ca JH |
47 | #include "hard-reg-set.h" |
48 | #include "basic-block.h" | |
49 | #include "regs.h" | |
50 | #include "flags.h" | |
ca6c03ca JH |
51 | #include "function.h" |
52 | #include "except.h" | |
0cbd9993 | 53 | #include "rtl-error.h" |
ca6c03ca JH |
54 | #include "tm_p.h" |
55 | #include "obstack.h" | |
2a34bece | 56 | #include "insn-attr.h" |
0a2ed1f1 | 57 | #include "insn-config.h" |
ff25ef99 | 58 | #include "expr.h" |
9fb32434 | 59 | #include "target.h" |
677f3fa8 | 60 | #include "common/common-target.h" |
1cb7dfc3 | 61 | #include "cfgloop.h" |
5e2d947c | 62 | #include "ggc.h" |
ef330312 | 63 | #include "tree-pass.h" |
6fb5fa3c | 64 | #include "df.h" |
ca6c03ca | 65 | |
78bde837 SB |
66 | /* Holds the interesting leading and trailing notes for the function. |
67 | Only applicable if the CFG is in cfglayout mode. */ | |
68 | static GTY(()) rtx cfg_layout_function_footer; | |
69 | static GTY(()) rtx cfg_layout_function_header; | |
70 | ||
71 | static rtx skip_insns_after_block (basic_block); | |
72 | static void record_effective_endpoints (void); | |
73 | static rtx label_for_bb (basic_block); | |
74 | static void fixup_reorder_chain (void); | |
75 | ||
76 | void verify_insn_chain (void); | |
77 | static void fixup_fallthru_exit_predecessor (void); | |
9678086d KG |
78 | static int can_delete_note_p (const_rtx); |
79 | static int can_delete_label_p (const_rtx); | |
d329e058 | 80 | static basic_block rtl_split_edge (edge); |
f470c378 | 81 | static bool rtl_move_block_after (basic_block, basic_block); |
d329e058 | 82 | static int rtl_verify_flow_info (void); |
f470c378 | 83 | static basic_block cfg_layout_split_block (basic_block, void *); |
6de9cd9a | 84 | static edge cfg_layout_redirect_edge_and_branch (edge, basic_block); |
d329e058 AJ |
85 | static basic_block cfg_layout_redirect_edge_and_branch_force (edge, basic_block); |
86 | static void cfg_layout_delete_block (basic_block); | |
87 | static void rtl_delete_block (basic_block); | |
88 | static basic_block rtl_redirect_edge_and_branch_force (edge, basic_block); | |
6de9cd9a | 89 | static edge rtl_redirect_edge_and_branch (edge, basic_block); |
f470c378 | 90 | static basic_block rtl_split_block (basic_block, void *); |
a315c44c | 91 | static void rtl_dump_bb (FILE *, basic_block, int, int); |
d329e058 | 92 | static int rtl_verify_flow_info_1 (void); |
f470c378 | 93 | static void rtl_make_forwarder_block (edge); |
ca6c03ca JH |
94 | \f |
95 | /* Return true if NOTE is not one of the ones that must be kept paired, | |
5f0d2358 | 96 | so that we may simply delete it. */ |
ca6c03ca JH |
97 | |
98 | static int | |
9678086d | 99 | can_delete_note_p (const_rtx note) |
ca6c03ca | 100 | { |
cd9c1ca8 RH |
101 | switch (NOTE_KIND (note)) |
102 | { | |
103 | case NOTE_INSN_DELETED: | |
104 | case NOTE_INSN_BASIC_BLOCK: | |
105 | case NOTE_INSN_EPILOGUE_BEG: | |
106 | return true; | |
107 | ||
108 | default: | |
109 | return false; | |
110 | } | |
ca6c03ca JH |
111 | } |
112 | ||
113 | /* True if a given label can be deleted. */ | |
114 | ||
115 | static int | |
9678086d | 116 | can_delete_label_p (const_rtx label) |
ca6c03ca | 117 | { |
5f0d2358 RK |
118 | return (!LABEL_PRESERVE_P (label) |
119 | /* User declared labels must be preserved. */ | |
120 | && LABEL_NAME (label) == 0 | |
610d2478 | 121 | && !in_expr_list_p (forced_labels, label)); |
ca6c03ca JH |
122 | } |
123 | ||
03fbe718 | 124 | /* Delete INSN by patching it out. */ |
ca6c03ca | 125 | |
03fbe718 | 126 | void |
d329e058 | 127 | delete_insn (rtx insn) |
ca6c03ca | 128 | { |
ca6c03ca JH |
129 | rtx note; |
130 | bool really_delete = true; | |
131 | ||
4b4bf941 | 132 | if (LABEL_P (insn)) |
ca6c03ca JH |
133 | { |
134 | /* Some labels can't be directly removed from the INSN chain, as they | |
c22cacf3 MS |
135 | might be references via variables, constant pool etc. |
136 | Convert them to the special NOTE_INSN_DELETED_LABEL note. */ | |
ca6c03ca JH |
137 | if (! can_delete_label_p (insn)) |
138 | { | |
139 | const char *name = LABEL_NAME (insn); | |
03fbe718 TV |
140 | basic_block bb = BLOCK_FOR_INSN (insn); |
141 | rtx bb_note = NEXT_INSN (insn); | |
ca6c03ca JH |
142 | |
143 | really_delete = false; | |
144 | PUT_CODE (insn, NOTE); | |
a38e7aa5 | 145 | NOTE_KIND (insn) = NOTE_INSN_DELETED_LABEL; |
6773e15f | 146 | NOTE_DELETED_LABEL_NAME (insn) = name; |
03fbe718 TV |
147 | |
148 | if (bb_note != NULL_RTX && NOTE_INSN_BASIC_BLOCK_P (bb_note) | |
149 | && BLOCK_FOR_INSN (bb_note) == bb) | |
150 | { | |
151 | reorder_insns_nobb (insn, insn, bb_note); | |
152 | BB_HEAD (bb) = bb_note; | |
153 | if (BB_END (bb) == bb_note) | |
154 | BB_END (bb) = insn; | |
155 | } | |
ca6c03ca | 156 | } |
5f0d2358 | 157 | |
ca6c03ca JH |
158 | remove_node_from_expr_list (insn, &nonlocal_goto_handler_labels); |
159 | } | |
160 | ||
161 | if (really_delete) | |
162 | { | |
cda94cbb | 163 | /* If this insn has already been deleted, something is very wrong. */ |
341c100f | 164 | gcc_assert (!INSN_DELETED_P (insn)); |
ca6c03ca JH |
165 | remove_insn (insn); |
166 | INSN_DELETED_P (insn) = 1; | |
167 | } | |
168 | ||
169 | /* If deleting a jump, decrement the use count of the label. Deleting | |
170 | the label itself should happen in the normal course of block merging. */ | |
cf7c4aa6 | 171 | if (JUMP_P (insn)) |
9295a326 | 172 | { |
cf7c4aa6 HPN |
173 | if (JUMP_LABEL (insn) |
174 | && LABEL_P (JUMP_LABEL (insn))) | |
175 | LABEL_NUSES (JUMP_LABEL (insn))--; | |
176 | ||
177 | /* If there are more targets, remove them too. */ | |
178 | while ((note | |
179 | = find_reg_note (insn, REG_LABEL_TARGET, NULL_RTX)) != NULL_RTX | |
4b4bf941 | 180 | && LABEL_P (XEXP (note, 0))) |
9295a326 JZ |
181 | { |
182 | LABEL_NUSES (XEXP (note, 0))--; | |
183 | remove_note (insn, note); | |
184 | } | |
185 | } | |
ca6c03ca | 186 | |
cf7c4aa6 HPN |
187 | /* Also if deleting any insn that references a label as an operand. */ |
188 | while ((note = find_reg_note (insn, REG_LABEL_OPERAND, NULL_RTX)) != NULL_RTX | |
189 | && LABEL_P (XEXP (note, 0))) | |
190 | { | |
191 | LABEL_NUSES (XEXP (note, 0))--; | |
192 | remove_note (insn, note); | |
193 | } | |
194 | ||
481683e1 | 195 | if (JUMP_TABLE_DATA_P (insn)) |
ca6c03ca JH |
196 | { |
197 | rtx pat = PATTERN (insn); | |
198 | int diff_vec_p = GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC; | |
199 | int len = XVECLEN (pat, diff_vec_p); | |
200 | int i; | |
201 | ||
202 | for (i = 0; i < len; i++) | |
a124fcda RH |
203 | { |
204 | rtx label = XEXP (XVECEXP (pat, diff_vec_p, i), 0); | |
205 | ||
206 | /* When deleting code in bulk (e.g. removing many unreachable | |
207 | blocks) we can delete a label that's a target of the vector | |
208 | before deleting the vector itself. */ | |
4b4bf941 | 209 | if (!NOTE_P (label)) |
a124fcda RH |
210 | LABEL_NUSES (label)--; |
211 | } | |
ca6c03ca | 212 | } |
ca6c03ca JH |
213 | } |
214 | ||
3dec4024 | 215 | /* Like delete_insn but also purge dead edges from BB. */ |
9ed7b221 | 216 | |
03fbe718 | 217 | void |
d329e058 | 218 | delete_insn_and_edges (rtx insn) |
3dec4024 | 219 | { |
3dec4024 JH |
220 | bool purge = false; |
221 | ||
ba4f7968 | 222 | if (INSN_P (insn) |
3dec4024 | 223 | && BLOCK_FOR_INSN (insn) |
a813c111 | 224 | && BB_END (BLOCK_FOR_INSN (insn)) == insn) |
3dec4024 | 225 | purge = true; |
03fbe718 | 226 | delete_insn (insn); |
3dec4024 JH |
227 | if (purge) |
228 | purge_dead_edges (BLOCK_FOR_INSN (insn)); | |
3dec4024 JH |
229 | } |
230 | ||
ca6c03ca | 231 | /* Unlink a chain of insns between START and FINISH, leaving notes |
a7b87f73 ZD |
232 | that must be paired. If CLEAR_BB is true, we set bb field for |
233 | insns that cannot be removed to NULL. */ | |
ca6c03ca JH |
234 | |
235 | void | |
a7b87f73 | 236 | delete_insn_chain (rtx start, rtx finish, bool clear_bb) |
ca6c03ca | 237 | { |
03fbe718 | 238 | rtx prev, current; |
ca6c03ca | 239 | |
5f0d2358 RK |
240 | /* Unchain the insns one by one. It would be quicker to delete all of these |
241 | with a single unchaining, rather than one at a time, but we need to keep | |
242 | the NOTE's. */ | |
03fbe718 | 243 | current = finish; |
ca6c03ca JH |
244 | while (1) |
245 | { | |
03fbe718 TV |
246 | prev = PREV_INSN (current); |
247 | if (NOTE_P (current) && !can_delete_note_p (current)) | |
ca6c03ca JH |
248 | ; |
249 | else | |
03fbe718 | 250 | delete_insn (current); |
ca6c03ca | 251 | |
03fbe718 TV |
252 | if (clear_bb && !INSN_DELETED_P (current)) |
253 | set_block_for_insn (current, NULL); | |
a7b87f73 | 254 | |
03fbe718 | 255 | if (current == start) |
ca6c03ca | 256 | break; |
03fbe718 | 257 | current = prev; |
ca6c03ca JH |
258 | } |
259 | } | |
260 | \f | |
5f0d2358 RK |
261 | /* Create a new basic block consisting of the instructions between HEAD and END |
262 | inclusive. This function is designed to allow fast BB construction - reuses | |
263 | the note and basic block struct in BB_NOTE, if any and do not grow | |
264 | BASIC_BLOCK chain and should be used directly only by CFG construction code. | |
265 | END can be NULL in to create new empty basic block before HEAD. Both END | |
918ed612 ZD |
266 | and HEAD can be NULL to create basic block at the end of INSN chain. |
267 | AFTER is the basic block we should be put after. */ | |
ca6c03ca JH |
268 | |
269 | basic_block | |
d329e058 | 270 | create_basic_block_structure (rtx head, rtx end, rtx bb_note, basic_block after) |
ca6c03ca JH |
271 | { |
272 | basic_block bb; | |
273 | ||
274 | if (bb_note | |
ca6c03ca JH |
275 | && (bb = NOTE_BASIC_BLOCK (bb_note)) != NULL |
276 | && bb->aux == NULL) | |
277 | { | |
278 | /* If we found an existing note, thread it back onto the chain. */ | |
279 | ||
280 | rtx after; | |
281 | ||
4b4bf941 | 282 | if (LABEL_P (head)) |
ca6c03ca JH |
283 | after = head; |
284 | else | |
285 | { | |
286 | after = PREV_INSN (head); | |
287 | head = bb_note; | |
288 | } | |
289 | ||
290 | if (after != bb_note && NEXT_INSN (after) != bb_note) | |
ba4f7968 | 291 | reorder_insns_nobb (bb_note, bb_note, after); |
ca6c03ca JH |
292 | } |
293 | else | |
294 | { | |
295 | /* Otherwise we must create a note and a basic block structure. */ | |
296 | ||
297 | bb = alloc_block (); | |
298 | ||
5e2d947c | 299 | init_rtl_bb_info (bb); |
ca6c03ca | 300 | if (!head && !end) |
5f0d2358 RK |
301 | head = end = bb_note |
302 | = emit_note_after (NOTE_INSN_BASIC_BLOCK, get_last_insn ()); | |
4b4bf941 | 303 | else if (LABEL_P (head) && end) |
ca6c03ca JH |
304 | { |
305 | bb_note = emit_note_after (NOTE_INSN_BASIC_BLOCK, head); | |
306 | if (head == end) | |
307 | end = bb_note; | |
308 | } | |
309 | else | |
310 | { | |
311 | bb_note = emit_note_before (NOTE_INSN_BASIC_BLOCK, head); | |
312 | head = bb_note; | |
313 | if (!end) | |
314 | end = head; | |
315 | } | |
5f0d2358 | 316 | |
ca6c03ca JH |
317 | NOTE_BASIC_BLOCK (bb_note) = bb; |
318 | } | |
319 | ||
320 | /* Always include the bb note in the block. */ | |
321 | if (NEXT_INSN (end) == bb_note) | |
322 | end = bb_note; | |
323 | ||
a813c111 SB |
324 | BB_HEAD (bb) = head; |
325 | BB_END (bb) = end; | |
852c6ec7 | 326 | bb->index = last_basic_block++; |
5e2d947c | 327 | bb->flags = BB_NEW | BB_RTL; |
918ed612 | 328 | link_block (bb, after); |
68f9b844 | 329 | SET_BASIC_BLOCK (bb->index, bb); |
6fb5fa3c | 330 | df_bb_refs_record (bb->index, false); |
ba4f7968 | 331 | update_bb_for_insn (bb); |
076c7ab8 | 332 | BB_SET_PARTITION (bb, BB_UNPARTITIONED); |
ca6c03ca JH |
333 | |
334 | /* Tag the block so that we know it has been used when considering | |
335 | other basic block notes. */ | |
336 | bb->aux = bb; | |
337 | ||
338 | return bb; | |
339 | } | |
340 | ||
5f0d2358 | 341 | /* Create new basic block consisting of instructions in between HEAD and END |
ffe14686 AM |
342 | and place it to the BB chain after block AFTER. END can be NULL to |
343 | create a new empty basic block before HEAD. Both END and HEAD can be | |
344 | NULL to create basic block at the end of INSN chain. */ | |
ca6c03ca | 345 | |
bc35512f JH |
346 | static basic_block |
347 | rtl_create_basic_block (void *headp, void *endp, basic_block after) | |
ca6c03ca | 348 | { |
ae50c0cb | 349 | rtx head = (rtx) headp, end = (rtx) endp; |
ca6c03ca | 350 | basic_block bb; |
0b17ab2f | 351 | |
7eca0767 | 352 | /* Grow the basic block array if needed. */ |
68f9b844 | 353 | if ((size_t) last_basic_block >= VEC_length (basic_block, basic_block_info)) |
7eca0767 JH |
354 | { |
355 | size_t new_size = last_basic_block + (last_basic_block + 3) / 4; | |
a590ac65 | 356 | VEC_safe_grow_cleared (basic_block, gc, basic_block_info, new_size); |
7eca0767 | 357 | } |
0b17ab2f | 358 | |
bf77398c | 359 | n_basic_blocks++; |
ca6c03ca | 360 | |
852c6ec7 | 361 | bb = create_basic_block_structure (head, end, NULL, after); |
ca6c03ca JH |
362 | bb->aux = NULL; |
363 | return bb; | |
364 | } | |
bc35512f JH |
365 | |
366 | static basic_block | |
367 | cfg_layout_create_basic_block (void *head, void *end, basic_block after) | |
368 | { | |
369 | basic_block newbb = rtl_create_basic_block (head, end, after); | |
370 | ||
bc35512f JH |
371 | return newbb; |
372 | } | |
ca6c03ca JH |
373 | \f |
374 | /* Delete the insns in a (non-live) block. We physically delete every | |
375 | non-deleted-note insn, and update the flow graph appropriately. | |
376 | ||
377 | Return nonzero if we deleted an exception handler. */ | |
378 | ||
379 | /* ??? Preserving all such notes strikes me as wrong. It would be nice | |
380 | to post-process the stream to remove empty blocks, loops, ranges, etc. */ | |
381 | ||
f0fda11c | 382 | static void |
d329e058 | 383 | rtl_delete_block (basic_block b) |
ca6c03ca | 384 | { |
96370780 | 385 | rtx insn, end; |
ca6c03ca JH |
386 | |
387 | /* If the head of this block is a CODE_LABEL, then it might be the | |
f39e46ba SB |
388 | label for an exception handler which can't be reached. We need |
389 | to remove the label from the exception_handler_label list. */ | |
a813c111 | 390 | insn = BB_HEAD (b); |
ca6c03ca | 391 | |
96370780 | 392 | end = get_last_bb_insn (b); |
ca6c03ca JH |
393 | |
394 | /* Selectively delete the entire chain. */ | |
a813c111 | 395 | BB_HEAD (b) = NULL; |
a7b87f73 ZD |
396 | delete_insn_chain (insn, end, true); |
397 | ||
6fb5fa3c DB |
398 | |
399 | if (dump_file) | |
400 | fprintf (dump_file, "deleting block %d\n", b->index); | |
401 | df_bb_delete (b->index); | |
ca6c03ca JH |
402 | } |
403 | \f | |
852c6ec7 | 404 | /* Records the basic block struct in BLOCK_FOR_INSN for every insn. */ |
ca6c03ca JH |
405 | |
406 | void | |
d329e058 | 407 | compute_bb_for_insn (void) |
ca6c03ca | 408 | { |
e0082a72 | 409 | basic_block bb; |
ca6c03ca | 410 | |
e0082a72 | 411 | FOR_EACH_BB (bb) |
ca6c03ca | 412 | { |
a813c111 | 413 | rtx end = BB_END (bb); |
5f0d2358 | 414 | rtx insn; |
ca6c03ca | 415 | |
a813c111 | 416 | for (insn = BB_HEAD (bb); ; insn = NEXT_INSN (insn)) |
ca6c03ca | 417 | { |
ba4f7968 | 418 | BLOCK_FOR_INSN (insn) = bb; |
ca6c03ca JH |
419 | if (insn == end) |
420 | break; | |
ca6c03ca JH |
421 | } |
422 | } | |
423 | } | |
424 | ||
425 | /* Release the basic_block_for_insn array. */ | |
426 | ||
c2924966 | 427 | unsigned int |
d329e058 | 428 | free_bb_for_insn (void) |
ca6c03ca | 429 | { |
ba4f7968 JH |
430 | rtx insn; |
431 | for (insn = get_insns (); insn; insn = NEXT_INSN (insn)) | |
4b4bf941 | 432 | if (!BARRIER_P (insn)) |
ba4f7968 | 433 | BLOCK_FOR_INSN (insn) = NULL; |
c2924966 | 434 | return 0; |
ca6c03ca JH |
435 | } |
436 | ||
2a34bece EB |
437 | static unsigned int |
438 | rest_of_pass_free_cfg (void) | |
439 | { | |
440 | #ifdef DELAY_SLOTS | |
441 | /* The resource.c machinery uses DF but the CFG isn't guaranteed to be | |
442 | valid at that point so it would be too late to call df_analyze. */ | |
443 | if (optimize > 0 && flag_delayed_branch) | |
ad78b8a6 EB |
444 | { |
445 | df_note_add_problem (); | |
446 | df_analyze (); | |
447 | } | |
2a34bece EB |
448 | #endif |
449 | ||
450 | free_bb_for_insn (); | |
451 | return 0; | |
452 | } | |
453 | ||
8ddbbcae | 454 | struct rtl_opt_pass pass_free_cfg = |
ef330312 | 455 | { |
8ddbbcae JH |
456 | { |
457 | RTL_PASS, | |
e0a42b0f | 458 | "*free_cfg", /* name */ |
ef330312 | 459 | NULL, /* gate */ |
2a34bece | 460 | rest_of_pass_free_cfg, /* execute */ |
ef330312 PB |
461 | NULL, /* sub */ |
462 | NULL, /* next */ | |
463 | 0, /* static_pass_number */ | |
7072a650 | 464 | TV_NONE, /* tv_id */ |
ef330312 PB |
465 | 0, /* properties_required */ |
466 | 0, /* properties_provided */ | |
467 | PROP_cfg, /* properties_destroyed */ | |
468 | 0, /* todo_flags_start */ | |
469 | 0, /* todo_flags_finish */ | |
8ddbbcae | 470 | } |
ef330312 PB |
471 | }; |
472 | ||
91278841 AP |
473 | /* Return RTX to emit after when we want to emit code on the entry of function. */ |
474 | rtx | |
475 | entry_of_function (void) | |
476 | { | |
c22cacf3 | 477 | return (n_basic_blocks > NUM_FIXED_BLOCKS ? |
24bd1a0b | 478 | BB_HEAD (ENTRY_BLOCK_PTR->next_bb) : get_insns ()); |
91278841 AP |
479 | } |
480 | ||
11b904a1 BS |
481 | /* Emit INSN at the entry point of the function, ensuring that it is only |
482 | executed once per function. */ | |
483 | void | |
484 | emit_insn_at_entry (rtx insn) | |
485 | { | |
486 | edge_iterator ei = ei_start (ENTRY_BLOCK_PTR->succs); | |
487 | edge e = ei_safe_edge (ei); | |
5419bc7f | 488 | gcc_assert (e->flags & EDGE_FALLTHRU); |
11b904a1 BS |
489 | |
490 | insert_insn_on_edge (insn, e); | |
491 | commit_edge_insertions (); | |
492 | } | |
493 | ||
6c3d0e31 | 494 | /* Update BLOCK_FOR_INSN of insns between BEGIN and END |
b8698a0f | 495 | (or BARRIER if found) and notify df of the bb change. |
6c3d0e31 SP |
496 | The insn chain range is inclusive |
497 | (i.e. both BEGIN and END will be updated. */ | |
ca6c03ca | 498 | |
6c3d0e31 SP |
499 | static void |
500 | update_bb_for_insn_chain (rtx begin, rtx end, basic_block bb) | |
ca6c03ca JH |
501 | { |
502 | rtx insn; | |
503 | ||
6c3d0e31 SP |
504 | end = NEXT_INSN (end); |
505 | for (insn = begin; insn != end; insn = NEXT_INSN (insn)) | |
63642d5a AO |
506 | if (!BARRIER_P (insn)) |
507 | df_insn_change_bb (insn, bb); | |
ca6c03ca | 508 | } |
6c3d0e31 SP |
509 | |
510 | /* Update BLOCK_FOR_INSN of insns in BB to BB, | |
511 | and notify df of the change. */ | |
512 | ||
513 | void | |
514 | update_bb_for_insn (basic_block bb) | |
515 | { | |
516 | update_bb_for_insn_chain (BB_HEAD (bb), BB_END (bb), bb); | |
517 | } | |
518 | ||
532aafad SB |
519 | \f |
520 | /* Like active_insn_p, except keep the return value clobber around | |
521 | even after reload. */ | |
522 | ||
523 | static bool | |
524 | flow_active_insn_p (const_rtx insn) | |
525 | { | |
526 | if (active_insn_p (insn)) | |
527 | return true; | |
528 | ||
529 | /* A clobber of the function return value exists for buggy | |
530 | programs that fail to return a value. Its effect is to | |
531 | keep the return value from being live across the entire | |
532 | function. If we allow it to be skipped, we introduce the | |
533 | possibility for register lifetime confusion. */ | |
534 | if (GET_CODE (PATTERN (insn)) == CLOBBER | |
535 | && REG_P (XEXP (PATTERN (insn), 0)) | |
536 | && REG_FUNCTION_VALUE_P (XEXP (PATTERN (insn), 0))) | |
537 | return true; | |
538 | ||
539 | return false; | |
540 | } | |
541 | ||
542 | /* Return true if the block has no effect and only forwards control flow to | |
543 | its single destination. */ | |
544 | /* FIXME: Make this a cfg hook. */ | |
545 | ||
546 | bool | |
547 | forwarder_block_p (const_basic_block bb) | |
548 | { | |
549 | rtx insn; | |
550 | ||
551 | if (bb == EXIT_BLOCK_PTR || bb == ENTRY_BLOCK_PTR | |
552 | || !single_succ_p (bb)) | |
553 | return false; | |
554 | ||
555 | /* Protect loop latches, headers and preheaders. */ | |
556 | if (current_loops) | |
557 | { | |
558 | basic_block dest; | |
559 | if (bb->loop_father->header == bb) | |
560 | return false; | |
561 | dest = EDGE_SUCC (bb, 0)->dest; | |
562 | if (dest->loop_father->header == dest) | |
563 | return false; | |
564 | } | |
565 | ||
566 | for (insn = BB_HEAD (bb); insn != BB_END (bb); insn = NEXT_INSN (insn)) | |
567 | if (INSN_P (insn) && flow_active_insn_p (insn)) | |
568 | return false; | |
569 | ||
570 | return (!INSN_P (insn) | |
571 | || (JUMP_P (insn) && simplejump_p (insn)) | |
572 | || !flow_active_insn_p (insn)); | |
573 | } | |
574 | ||
575 | /* Return nonzero if we can reach target from src by falling through. */ | |
576 | /* FIXME: Make this a cfg hook. */ | |
577 | ||
578 | bool | |
579 | can_fallthru (basic_block src, basic_block target) | |
580 | { | |
581 | rtx insn = BB_END (src); | |
582 | rtx insn2; | |
583 | edge e; | |
584 | edge_iterator ei; | |
585 | ||
586 | if (target == EXIT_BLOCK_PTR) | |
587 | return true; | |
588 | if (src->next_bb != target) | |
589 | return 0; | |
590 | FOR_EACH_EDGE (e, ei, src->succs) | |
591 | if (e->dest == EXIT_BLOCK_PTR | |
592 | && e->flags & EDGE_FALLTHRU) | |
593 | return 0; | |
594 | ||
595 | insn2 = BB_HEAD (target); | |
596 | if (insn2 && !active_insn_p (insn2)) | |
597 | insn2 = next_active_insn (insn2); | |
598 | ||
599 | /* ??? Later we may add code to move jump tables offline. */ | |
600 | return next_active_insn (insn) == insn2; | |
601 | } | |
602 | ||
603 | /* Return nonzero if we could reach target from src by falling through, | |
604 | if the target was made adjacent. If we already have a fall-through | |
605 | edge to the exit block, we can't do that. */ | |
606 | static bool | |
607 | could_fall_through (basic_block src, basic_block target) | |
608 | { | |
609 | edge e; | |
610 | edge_iterator ei; | |
611 | ||
612 | if (target == EXIT_BLOCK_PTR) | |
613 | return true; | |
614 | FOR_EACH_EDGE (e, ei, src->succs) | |
615 | if (e->dest == EXIT_BLOCK_PTR | |
616 | && e->flags & EDGE_FALLTHRU) | |
617 | return 0; | |
618 | return true; | |
619 | } | |
ca6c03ca | 620 | \f |
ef2be249 RS |
621 | /* Return the NOTE_INSN_BASIC_BLOCK of BB. */ |
622 | rtx | |
623 | bb_note (basic_block bb) | |
624 | { | |
625 | rtx note; | |
626 | ||
627 | note = BB_HEAD (bb); | |
628 | if (LABEL_P (note)) | |
629 | note = NEXT_INSN (note); | |
630 | ||
631 | gcc_assert (NOTE_INSN_BASIC_BLOCK_P (note)); | |
632 | return note; | |
633 | } | |
634 | ||
6fb5fa3c DB |
635 | /* Return the INSN immediately following the NOTE_INSN_BASIC_BLOCK |
636 | note associated with the BLOCK. */ | |
637 | ||
638 | static rtx | |
639 | first_insn_after_basic_block_note (basic_block block) | |
640 | { | |
641 | rtx insn; | |
642 | ||
643 | /* Get the first instruction in the block. */ | |
644 | insn = BB_HEAD (block); | |
645 | ||
646 | if (insn == NULL_RTX) | |
647 | return NULL_RTX; | |
648 | if (LABEL_P (insn)) | |
649 | insn = NEXT_INSN (insn); | |
650 | gcc_assert (NOTE_INSN_BASIC_BLOCK_P (insn)); | |
651 | ||
652 | return NEXT_INSN (insn); | |
653 | } | |
654 | ||
f470c378 ZD |
655 | /* Creates a new basic block just after basic block B by splitting |
656 | everything after specified instruction I. */ | |
ca6c03ca | 657 | |
f470c378 | 658 | static basic_block |
d329e058 | 659 | rtl_split_block (basic_block bb, void *insnp) |
ca6c03ca JH |
660 | { |
661 | basic_block new_bb; | |
ae50c0cb | 662 | rtx insn = (rtx) insnp; |
f470c378 | 663 | edge e; |
628f6a4e | 664 | edge_iterator ei; |
ca6c03ca | 665 | |
f470c378 ZD |
666 | if (!insn) |
667 | { | |
668 | insn = first_insn_after_basic_block_note (bb); | |
669 | ||
670 | if (insn) | |
b5b8b0ac AO |
671 | { |
672 | rtx next = insn; | |
673 | ||
674 | insn = PREV_INSN (insn); | |
675 | ||
676 | /* If the block contains only debug insns, insn would have | |
677 | been NULL in a non-debug compilation, and then we'd end | |
678 | up emitting a DELETED note. For -fcompare-debug | |
679 | stability, emit the note too. */ | |
680 | if (insn != BB_END (bb) | |
681 | && DEBUG_INSN_P (next) | |
682 | && DEBUG_INSN_P (BB_END (bb))) | |
683 | { | |
684 | while (next != BB_END (bb) && DEBUG_INSN_P (next)) | |
685 | next = NEXT_INSN (next); | |
686 | ||
687 | if (next == BB_END (bb)) | |
688 | emit_note_after (NOTE_INSN_DELETED, next); | |
689 | } | |
690 | } | |
f470c378 ZD |
691 | else |
692 | insn = get_last_insn (); | |
693 | } | |
694 | ||
695 | /* We probably should check type of the insn so that we do not create | |
696 | inconsistent cfg. It is checked in verify_flow_info anyway, so do not | |
697 | bother. */ | |
698 | if (insn == BB_END (bb)) | |
699 | emit_note_after (NOTE_INSN_DELETED, insn); | |
ca6c03ca JH |
700 | |
701 | /* Create the new basic block. */ | |
a813c111 | 702 | new_bb = create_basic_block (NEXT_INSN (insn), BB_END (bb), bb); |
076c7ab8 | 703 | BB_COPY_PARTITION (new_bb, bb); |
a813c111 | 704 | BB_END (bb) = insn; |
ca6c03ca JH |
705 | |
706 | /* Redirect the outgoing edges. */ | |
628f6a4e BE |
707 | new_bb->succs = bb->succs; |
708 | bb->succs = NULL; | |
709 | FOR_EACH_EDGE (e, ei, new_bb->succs) | |
ca6c03ca JH |
710 | e->src = new_bb; |
711 | ||
6fb5fa3c DB |
712 | /* The new block starts off being dirty. */ |
713 | df_set_bb_dirty (bb); | |
f470c378 | 714 | return new_bb; |
bc35512f JH |
715 | } |
716 | ||
9be94227 EB |
717 | /* Return true if the single edge between blocks A and B is the only place |
718 | in RTL which holds some unique locus. */ | |
719 | ||
720 | static bool | |
721 | unique_locus_on_edge_between_p (basic_block a, basic_block b) | |
722 | { | |
723 | const int goto_locus = EDGE_SUCC (a, 0)->goto_locus; | |
724 | rtx insn, end; | |
725 | ||
726 | if (!goto_locus) | |
727 | return false; | |
728 | ||
729 | /* First scan block A backward. */ | |
730 | insn = BB_END (a); | |
731 | end = PREV_INSN (BB_HEAD (a)); | |
732 | while (insn != end && (!NONDEBUG_INSN_P (insn) || INSN_LOCATOR (insn) == 0)) | |
733 | insn = PREV_INSN (insn); | |
734 | ||
735 | if (insn != end && locator_eq (INSN_LOCATOR (insn), goto_locus)) | |
736 | return false; | |
737 | ||
738 | /* Then scan block B forward. */ | |
739 | insn = BB_HEAD (b); | |
740 | if (insn) | |
741 | { | |
742 | end = NEXT_INSN (BB_END (b)); | |
743 | while (insn != end && !NONDEBUG_INSN_P (insn)) | |
744 | insn = NEXT_INSN (insn); | |
745 | ||
746 | if (insn != end && INSN_LOCATOR (insn) != 0 | |
747 | && locator_eq (INSN_LOCATOR (insn), goto_locus)) | |
748 | return false; | |
749 | } | |
750 | ||
751 | return true; | |
752 | } | |
753 | ||
754 | /* If the single edge between blocks A and B is the only place in RTL which | |
755 | holds some unique locus, emit a nop with that locus between the blocks. */ | |
756 | ||
757 | static void | |
758 | emit_nop_for_unique_locus_between (basic_block a, basic_block b) | |
759 | { | |
760 | if (!unique_locus_on_edge_between_p (a, b)) | |
761 | return; | |
762 | ||
763 | BB_END (a) = emit_insn_after_noloc (gen_nop (), BB_END (a), a); | |
764 | INSN_LOCATOR (BB_END (a)) = EDGE_SUCC (a, 0)->goto_locus; | |
765 | } | |
766 | ||
ca6c03ca | 767 | /* Blocks A and B are to be merged into a single block A. The insns |
bc35512f | 768 | are already contiguous. */ |
ca6c03ca | 769 | |
bc35512f JH |
770 | static void |
771 | rtl_merge_blocks (basic_block a, basic_block b) | |
ca6c03ca | 772 | { |
a813c111 | 773 | rtx b_head = BB_HEAD (b), b_end = BB_END (b), a_end = BB_END (a); |
ca6c03ca | 774 | rtx del_first = NULL_RTX, del_last = NULL_RTX; |
b5b8b0ac | 775 | rtx b_debug_start = b_end, b_debug_end = b_end; |
50a36e42 | 776 | bool forwarder_p = (b->flags & BB_FORWARDER_BLOCK) != 0; |
ca6c03ca JH |
777 | int b_empty = 0; |
778 | ||
6fb5fa3c | 779 | if (dump_file) |
50a36e42 EB |
780 | fprintf (dump_file, "Merging block %d into block %d...\n", b->index, |
781 | a->index); | |
6fb5fa3c | 782 | |
b5b8b0ac AO |
783 | while (DEBUG_INSN_P (b_end)) |
784 | b_end = PREV_INSN (b_debug_start = b_end); | |
785 | ||
ca6c03ca | 786 | /* If there was a CODE_LABEL beginning B, delete it. */ |
4b4bf941 | 787 | if (LABEL_P (b_head)) |
ca6c03ca JH |
788 | { |
789 | /* Detect basic blocks with nothing but a label. This can happen | |
790 | in particular at the end of a function. */ | |
791 | if (b_head == b_end) | |
792 | b_empty = 1; | |
5f0d2358 | 793 | |
ca6c03ca JH |
794 | del_first = del_last = b_head; |
795 | b_head = NEXT_INSN (b_head); | |
796 | } | |
797 | ||
5f0d2358 RK |
798 | /* Delete the basic block note and handle blocks containing just that |
799 | note. */ | |
ca6c03ca JH |
800 | if (NOTE_INSN_BASIC_BLOCK_P (b_head)) |
801 | { | |
802 | if (b_head == b_end) | |
803 | b_empty = 1; | |
804 | if (! del_last) | |
805 | del_first = b_head; | |
5f0d2358 | 806 | |
ca6c03ca JH |
807 | del_last = b_head; |
808 | b_head = NEXT_INSN (b_head); | |
809 | } | |
810 | ||
811 | /* If there was a jump out of A, delete it. */ | |
4b4bf941 | 812 | if (JUMP_P (a_end)) |
ca6c03ca JH |
813 | { |
814 | rtx prev; | |
815 | ||
816 | for (prev = PREV_INSN (a_end); ; prev = PREV_INSN (prev)) | |
4b4bf941 | 817 | if (!NOTE_P (prev) |
a38e7aa5 | 818 | || NOTE_INSN_BASIC_BLOCK_P (prev) |
a813c111 | 819 | || prev == BB_HEAD (a)) |
ca6c03ca JH |
820 | break; |
821 | ||
822 | del_first = a_end; | |
823 | ||
824 | #ifdef HAVE_cc0 | |
825 | /* If this was a conditional jump, we need to also delete | |
826 | the insn that set cc0. */ | |
827 | if (only_sets_cc0_p (prev)) | |
828 | { | |
829 | rtx tmp = prev; | |
5f0d2358 | 830 | |
ca6c03ca JH |
831 | prev = prev_nonnote_insn (prev); |
832 | if (!prev) | |
a813c111 | 833 | prev = BB_HEAD (a); |
ca6c03ca JH |
834 | del_first = tmp; |
835 | } | |
836 | #endif | |
837 | ||
838 | a_end = PREV_INSN (del_first); | |
839 | } | |
4b4bf941 | 840 | else if (BARRIER_P (NEXT_INSN (a_end))) |
ca6c03ca JH |
841 | del_first = NEXT_INSN (a_end); |
842 | ||
ca6c03ca JH |
843 | /* Delete everything marked above as well as crap that might be |
844 | hanging out between the two blocks. */ | |
9be94227 EB |
845 | BB_END (a) = a_end; |
846 | BB_HEAD (b) = b_empty ? NULL_RTX : b_head; | |
a7b87f73 | 847 | delete_insn_chain (del_first, del_last, true); |
ca6c03ca | 848 | |
9be94227 EB |
849 | /* When not optimizing CFG and the edge is the only place in RTL which holds |
850 | some unique locus, emit a nop with that locus in between. */ | |
851 | if (!optimize) | |
852 | { | |
853 | emit_nop_for_unique_locus_between (a, b); | |
854 | a_end = BB_END (a); | |
855 | } | |
856 | ||
ca6c03ca JH |
857 | /* Reassociate the insns of B with A. */ |
858 | if (!b_empty) | |
859 | { | |
b5b8b0ac | 860 | update_bb_for_insn_chain (a_end, b_debug_end, a); |
5f0d2358 | 861 | |
9be94227 EB |
862 | BB_END (a) = b_debug_end; |
863 | BB_HEAD (b) = NULL_RTX; | |
b5b8b0ac AO |
864 | } |
865 | else if (b_end != b_debug_end) | |
866 | { | |
867 | /* Move any deleted labels and other notes between the end of A | |
868 | and the debug insns that make up B after the debug insns, | |
869 | bringing the debug insns into A while keeping the notes after | |
870 | the end of A. */ | |
871 | if (NEXT_INSN (a_end) != b_debug_start) | |
872 | reorder_insns_nobb (NEXT_INSN (a_end), PREV_INSN (b_debug_start), | |
873 | b_debug_end); | |
874 | update_bb_for_insn_chain (b_debug_start, b_debug_end, a); | |
9be94227 | 875 | BB_END (a) = b_debug_end; |
ca6c03ca | 876 | } |
5f0d2358 | 877 | |
6fb5fa3c | 878 | df_bb_delete (b->index); |
50a36e42 EB |
879 | |
880 | /* If B was a forwarder block, propagate the locus on the edge. */ | |
881 | if (forwarder_p && !EDGE_SUCC (b, 0)->goto_locus) | |
882 | EDGE_SUCC (b, 0)->goto_locus = EDGE_SUCC (a, 0)->goto_locus; | |
883 | ||
884 | if (dump_file) | |
885 | fprintf (dump_file, "Merged blocks %d and %d.\n", a->index, b->index); | |
ca6c03ca | 886 | } |
bc35512f | 887 | |
6fb5fa3c | 888 | |
bc35512f | 889 | /* Return true when block A and B can be merged. */ |
9678086d | 890 | |
b48d0358 DN |
891 | static bool |
892 | rtl_can_merge_blocks (basic_block a, basic_block b) | |
bc35512f | 893 | { |
750054a2 CT |
894 | /* If we are partitioning hot/cold basic blocks, we don't want to |
895 | mess up unconditional or indirect jumps that cross between hot | |
076c7ab8 ZW |
896 | and cold sections. |
897 | ||
8e8d5162 | 898 | Basic block partitioning may result in some jumps that appear to |
c22cacf3 MS |
899 | be optimizable (or blocks that appear to be mergeable), but which really |
900 | must be left untouched (they are required to make it safely across | |
901 | partition boundaries). See the comments at the top of | |
8e8d5162 | 902 | bb-reorder.c:partition_hot_cold_basic_blocks for complete details. */ |
076c7ab8 | 903 | |
87c8b4be | 904 | if (BB_PARTITION (a) != BB_PARTITION (b)) |
076c7ab8 | 905 | return false; |
750054a2 | 906 | |
7d776ee2 RG |
907 | /* Protect the loop latches. */ |
908 | if (current_loops && b->loop_father->latch == b) | |
909 | return false; | |
910 | ||
bc35512f | 911 | /* There must be exactly one edge in between the blocks. */ |
c5cbcccf ZD |
912 | return (single_succ_p (a) |
913 | && single_succ (a) == b | |
914 | && single_pred_p (b) | |
628f6a4e | 915 | && a != b |
bc35512f | 916 | /* Must be simple edge. */ |
c5cbcccf | 917 | && !(single_succ_edge (a)->flags & EDGE_COMPLEX) |
bc35512f JH |
918 | && a->next_bb == b |
919 | && a != ENTRY_BLOCK_PTR && b != EXIT_BLOCK_PTR | |
920 | /* If the jump insn has side effects, | |
921 | we can't kill the edge. */ | |
4b4bf941 | 922 | && (!JUMP_P (BB_END (a)) |
e24e7211 | 923 | || (reload_completed |
a813c111 | 924 | ? simplejump_p (BB_END (a)) : onlyjump_p (BB_END (a))))); |
bc35512f | 925 | } |
ca6c03ca | 926 | \f |
5f0d2358 RK |
927 | /* Return the label in the head of basic block BLOCK. Create one if it doesn't |
928 | exist. */ | |
ca6c03ca JH |
929 | |
930 | rtx | |
d329e058 | 931 | block_label (basic_block block) |
ca6c03ca JH |
932 | { |
933 | if (block == EXIT_BLOCK_PTR) | |
934 | return NULL_RTX; | |
5f0d2358 | 935 | |
4b4bf941 | 936 | if (!LABEL_P (BB_HEAD (block))) |
ca6c03ca | 937 | { |
a813c111 | 938 | BB_HEAD (block) = emit_label_before (gen_label_rtx (), BB_HEAD (block)); |
ca6c03ca | 939 | } |
5f0d2358 | 940 | |
a813c111 | 941 | return BB_HEAD (block); |
ca6c03ca JH |
942 | } |
943 | ||
944 | /* Attempt to perform edge redirection by replacing possibly complex jump | |
5f0d2358 RK |
945 | instruction by unconditional jump or removing jump completely. This can |
946 | apply only if all edges now point to the same block. The parameters and | |
947 | return values are equivalent to redirect_edge_and_branch. */ | |
ca6c03ca | 948 | |
6de9cd9a | 949 | edge |
bc35512f | 950 | try_redirect_by_replacing_jump (edge e, basic_block target, bool in_cfglayout) |
ca6c03ca JH |
951 | { |
952 | basic_block src = e->src; | |
a813c111 | 953 | rtx insn = BB_END (src), kill_from; |
e1233a7d | 954 | rtx set; |
ca6c03ca | 955 | int fallthru = 0; |
750054a2 CT |
956 | |
957 | /* If we are partitioning hot/cold basic blocks, we don't want to | |
958 | mess up unconditional or indirect jumps that cross between hot | |
8e8d5162 CT |
959 | and cold sections. |
960 | ||
961 | Basic block partitioning may result in some jumps that appear to | |
c22cacf3 MS |
962 | be optimizable (or blocks that appear to be mergeable), but which really |
963 | must be left untouched (they are required to make it safely across | |
964 | partition boundaries). See the comments at the top of | |
8e8d5162 | 965 | bb-reorder.c:partition_hot_cold_basic_blocks for complete details. */ |
c22cacf3 | 966 | |
87c8b4be CT |
967 | if (find_reg_note (insn, REG_CROSSING_JUMP, NULL_RTX) |
968 | || BB_PARTITION (src) != BB_PARTITION (target)) | |
9cf84a3c | 969 | return NULL; |
750054a2 | 970 | |
6a66a8a7 KH |
971 | /* We can replace or remove a complex jump only when we have exactly |
972 | two edges. Also, if we have exactly one outgoing edge, we can | |
973 | redirect that. */ | |
974 | if (EDGE_COUNT (src->succs) >= 3 | |
975 | /* Verify that all targets will be TARGET. Specifically, the | |
976 | edge that is not E must also go to TARGET. */ | |
977 | || (EDGE_COUNT (src->succs) == 2 | |
978 | && EDGE_SUCC (src, EDGE_SUCC (src, 0) == e)->dest != target)) | |
979 | return NULL; | |
5f0d2358 | 980 | |
6a66a8a7 | 981 | if (!onlyjump_p (insn)) |
6de9cd9a | 982 | return NULL; |
3348b696 | 983 | if ((!optimize || reload_completed) && tablejump_p (insn, NULL, NULL)) |
6de9cd9a | 984 | return NULL; |
ca6c03ca JH |
985 | |
986 | /* Avoid removing branch with side effects. */ | |
987 | set = single_set (insn); | |
988 | if (!set || side_effects_p (set)) | |
6de9cd9a | 989 | return NULL; |
ca6c03ca JH |
990 | |
991 | /* In case we zap a conditional jump, we'll need to kill | |
992 | the cc0 setter too. */ | |
993 | kill_from = insn; | |
994 | #ifdef HAVE_cc0 | |
9caea4a7 RS |
995 | if (reg_mentioned_p (cc0_rtx, PATTERN (insn)) |
996 | && only_sets_cc0_p (PREV_INSN (insn))) | |
ca6c03ca JH |
997 | kill_from = PREV_INSN (insn); |
998 | #endif | |
999 | ||
1000 | /* See if we can create the fallthru edge. */ | |
bc35512f | 1001 | if (in_cfglayout || can_fallthru (src, target)) |
ca6c03ca | 1002 | { |
c263766c RH |
1003 | if (dump_file) |
1004 | fprintf (dump_file, "Removing jump %i.\n", INSN_UID (insn)); | |
ca6c03ca JH |
1005 | fallthru = 1; |
1006 | ||
eaec9b3d | 1007 | /* Selectively unlink whole insn chain. */ |
bc35512f JH |
1008 | if (in_cfglayout) |
1009 | { | |
bcc708fc | 1010 | rtx insn = BB_FOOTER (src); |
bc35512f | 1011 | |
a7b87f73 | 1012 | delete_insn_chain (kill_from, BB_END (src), false); |
bc35512f JH |
1013 | |
1014 | /* Remove barriers but keep jumptables. */ | |
1015 | while (insn) | |
1016 | { | |
4b4bf941 | 1017 | if (BARRIER_P (insn)) |
bc35512f JH |
1018 | { |
1019 | if (PREV_INSN (insn)) | |
1020 | NEXT_INSN (PREV_INSN (insn)) = NEXT_INSN (insn); | |
1021 | else | |
bcc708fc | 1022 | BB_FOOTER (src) = NEXT_INSN (insn); |
bc35512f JH |
1023 | if (NEXT_INSN (insn)) |
1024 | PREV_INSN (NEXT_INSN (insn)) = PREV_INSN (insn); | |
1025 | } | |
4b4bf941 | 1026 | if (LABEL_P (insn)) |
bc35512f JH |
1027 | break; |
1028 | insn = NEXT_INSN (insn); | |
1029 | } | |
1030 | } | |
1031 | else | |
a7b87f73 ZD |
1032 | delete_insn_chain (kill_from, PREV_INSN (BB_HEAD (target)), |
1033 | false); | |
ca6c03ca | 1034 | } |
5f0d2358 | 1035 | |
ca6c03ca JH |
1036 | /* If this already is simplejump, redirect it. */ |
1037 | else if (simplejump_p (insn)) | |
1038 | { | |
1039 | if (e->dest == target) | |
6de9cd9a | 1040 | return NULL; |
c263766c RH |
1041 | if (dump_file) |
1042 | fprintf (dump_file, "Redirecting jump %i from %i to %i.\n", | |
0b17ab2f | 1043 | INSN_UID (insn), e->dest->index, target->index); |
6ee3c8e4 JJ |
1044 | if (!redirect_jump (insn, block_label (target), 0)) |
1045 | { | |
341c100f NS |
1046 | gcc_assert (target == EXIT_BLOCK_PTR); |
1047 | return NULL; | |
6ee3c8e4 | 1048 | } |
ca6c03ca | 1049 | } |
5f0d2358 | 1050 | |
6ee3c8e4 JJ |
1051 | /* Cannot do anything for target exit block. */ |
1052 | else if (target == EXIT_BLOCK_PTR) | |
6de9cd9a | 1053 | return NULL; |
6ee3c8e4 | 1054 | |
ca6c03ca JH |
1055 | /* Or replace possibly complicated jump insn by simple jump insn. */ |
1056 | else | |
1057 | { | |
1058 | rtx target_label = block_label (target); | |
eb5b8ad4 | 1059 | rtx barrier, label, table; |
ca6c03ca | 1060 | |
a7102479 | 1061 | emit_jump_insn_after_noloc (gen_jump (target_label), insn); |
a813c111 | 1062 | JUMP_LABEL (BB_END (src)) = target_label; |
ca6c03ca | 1063 | LABEL_NUSES (target_label)++; |
c263766c RH |
1064 | if (dump_file) |
1065 | fprintf (dump_file, "Replacing insn %i by jump %i\n", | |
a813c111 | 1066 | INSN_UID (insn), INSN_UID (BB_END (src))); |
ca6c03ca | 1067 | |
4da2eb6b | 1068 | |
ba4807a0 LB |
1069 | delete_insn_chain (kill_from, insn, false); |
1070 | ||
4da2eb6b RH |
1071 | /* Recognize a tablejump that we are converting to a |
1072 | simple jump and remove its associated CODE_LABEL | |
1073 | and ADDR_VEC or ADDR_DIFF_VEC. */ | |
ba4807a0 LB |
1074 | if (tablejump_p (insn, &label, &table)) |
1075 | delete_insn_chain (label, table, false); | |
eb5b8ad4 | 1076 | |
a813c111 | 1077 | barrier = next_nonnote_insn (BB_END (src)); |
4b4bf941 | 1078 | if (!barrier || !BARRIER_P (barrier)) |
a813c111 | 1079 | emit_barrier_after (BB_END (src)); |
5d693491 JZ |
1080 | else |
1081 | { | |
a813c111 | 1082 | if (barrier != NEXT_INSN (BB_END (src))) |
5d693491 JZ |
1083 | { |
1084 | /* Move the jump before barrier so that the notes | |
1085 | which originally were or were created before jump table are | |
1086 | inside the basic block. */ | |
a813c111 | 1087 | rtx new_insn = BB_END (src); |
5d693491 | 1088 | |
6c3d0e31 SP |
1089 | update_bb_for_insn_chain (NEXT_INSN (BB_END (src)), |
1090 | PREV_INSN (barrier), src); | |
5d693491 JZ |
1091 | |
1092 | NEXT_INSN (PREV_INSN (new_insn)) = NEXT_INSN (new_insn); | |
1093 | PREV_INSN (NEXT_INSN (new_insn)) = PREV_INSN (new_insn); | |
1094 | ||
1095 | NEXT_INSN (new_insn) = barrier; | |
1096 | NEXT_INSN (PREV_INSN (barrier)) = new_insn; | |
1097 | ||
1098 | PREV_INSN (new_insn) = PREV_INSN (barrier); | |
1099 | PREV_INSN (barrier) = new_insn; | |
1100 | } | |
1101 | } | |
ca6c03ca JH |
1102 | } |
1103 | ||
1104 | /* Keep only one edge out and set proper flags. */ | |
c5cbcccf | 1105 | if (!single_succ_p (src)) |
628f6a4e | 1106 | remove_edge (e); |
c5cbcccf | 1107 | gcc_assert (single_succ_p (src)); |
628f6a4e | 1108 | |
c5cbcccf | 1109 | e = single_succ_edge (src); |
ca6c03ca JH |
1110 | if (fallthru) |
1111 | e->flags = EDGE_FALLTHRU; | |
1112 | else | |
1113 | e->flags = 0; | |
5f0d2358 | 1114 | |
ca6c03ca JH |
1115 | e->probability = REG_BR_PROB_BASE; |
1116 | e->count = src->count; | |
1117 | ||
ca6c03ca JH |
1118 | if (e->dest != target) |
1119 | redirect_edge_succ (e, target); | |
6de9cd9a | 1120 | return e; |
ca6c03ca JH |
1121 | } |
1122 | ||
4e3825db MM |
1123 | /* Subroutine of redirect_branch_edge that tries to patch the jump |
1124 | instruction INSN so that it reaches block NEW. Do this | |
1125 | only when it originally reached block OLD. Return true if this | |
1126 | worked or the original target wasn't OLD, return false if redirection | |
1127 | doesn't work. */ | |
1128 | ||
1129 | static bool | |
1130 | patch_jump_insn (rtx insn, rtx old_label, basic_block new_bb) | |
ca6c03ca JH |
1131 | { |
1132 | rtx tmp; | |
ca6c03ca | 1133 | /* Recognize a tablejump and adjust all matching cases. */ |
e1233a7d | 1134 | if (tablejump_p (insn, NULL, &tmp)) |
ca6c03ca JH |
1135 | { |
1136 | rtvec vec; | |
1137 | int j; | |
4e3825db | 1138 | rtx new_label = block_label (new_bb); |
ca6c03ca | 1139 | |
4e3825db MM |
1140 | if (new_bb == EXIT_BLOCK_PTR) |
1141 | return false; | |
ca6c03ca JH |
1142 | if (GET_CODE (PATTERN (tmp)) == ADDR_VEC) |
1143 | vec = XVEC (PATTERN (tmp), 0); | |
1144 | else | |
1145 | vec = XVEC (PATTERN (tmp), 1); | |
1146 | ||
1147 | for (j = GET_NUM_ELEM (vec) - 1; j >= 0; --j) | |
1148 | if (XEXP (RTVEC_ELT (vec, j), 0) == old_label) | |
1149 | { | |
1150 | RTVEC_ELT (vec, j) = gen_rtx_LABEL_REF (Pmode, new_label); | |
1151 | --LABEL_NUSES (old_label); | |
1152 | ++LABEL_NUSES (new_label); | |
1153 | } | |
1154 | ||
f9da5064 | 1155 | /* Handle casesi dispatch insns. */ |
ca6c03ca JH |
1156 | if ((tmp = single_set (insn)) != NULL |
1157 | && SET_DEST (tmp) == pc_rtx | |
1158 | && GET_CODE (SET_SRC (tmp)) == IF_THEN_ELSE | |
1159 | && GET_CODE (XEXP (SET_SRC (tmp), 2)) == LABEL_REF | |
1160 | && XEXP (XEXP (SET_SRC (tmp), 2), 0) == old_label) | |
1161 | { | |
4c33cb26 | 1162 | XEXP (SET_SRC (tmp), 2) = gen_rtx_LABEL_REF (Pmode, |
ca6c03ca JH |
1163 | new_label); |
1164 | --LABEL_NUSES (old_label); | |
1165 | ++LABEL_NUSES (new_label); | |
1166 | } | |
1167 | } | |
1c384bf1 RH |
1168 | else if ((tmp = extract_asm_operands (PATTERN (insn))) != NULL) |
1169 | { | |
1170 | int i, n = ASM_OPERANDS_LABEL_LENGTH (tmp); | |
1171 | rtx new_label, note; | |
1172 | ||
1173 | if (new_bb == EXIT_BLOCK_PTR) | |
1174 | return false; | |
1175 | new_label = block_label (new_bb); | |
1176 | ||
1177 | for (i = 0; i < n; ++i) | |
1178 | { | |
1179 | rtx old_ref = ASM_OPERANDS_LABEL (tmp, i); | |
1180 | gcc_assert (GET_CODE (old_ref) == LABEL_REF); | |
1181 | if (XEXP (old_ref, 0) == old_label) | |
1182 | { | |
1183 | ASM_OPERANDS_LABEL (tmp, i) | |
1184 | = gen_rtx_LABEL_REF (Pmode, new_label); | |
1185 | --LABEL_NUSES (old_label); | |
1186 | ++LABEL_NUSES (new_label); | |
1187 | } | |
1188 | } | |
1189 | ||
1190 | if (JUMP_LABEL (insn) == old_label) | |
1191 | { | |
1192 | JUMP_LABEL (insn) = new_label; | |
1193 | note = find_reg_note (insn, REG_LABEL_TARGET, new_label); | |
1194 | if (note) | |
1195 | remove_note (insn, note); | |
1196 | } | |
1197 | else | |
1198 | { | |
1199 | note = find_reg_note (insn, REG_LABEL_TARGET, old_label); | |
1200 | if (note) | |
1201 | remove_note (insn, note); | |
1202 | if (JUMP_LABEL (insn) != new_label | |
1203 | && !find_reg_note (insn, REG_LABEL_TARGET, new_label)) | |
1204 | add_reg_note (insn, REG_LABEL_TARGET, new_label); | |
1205 | } | |
3b5fda81 JJ |
1206 | while ((note = find_reg_note (insn, REG_LABEL_OPERAND, old_label)) |
1207 | != NULL_RTX) | |
1208 | XEXP (note, 0) = new_label; | |
1c384bf1 | 1209 | } |
ca6c03ca JH |
1210 | else |
1211 | { | |
1212 | /* ?? We may play the games with moving the named labels from | |
1213 | one basic block to the other in case only one computed_jump is | |
1214 | available. */ | |
5f0d2358 RK |
1215 | if (computed_jump_p (insn) |
1216 | /* A return instruction can't be redirected. */ | |
1217 | || returnjump_p (insn)) | |
4e3825db | 1218 | return false; |
6ee3c8e4 | 1219 | |
4e3825db | 1220 | if (!currently_expanding_to_rtl || JUMP_LABEL (insn) == old_label) |
6ee3c8e4 | 1221 | { |
4e3825db MM |
1222 | /* If the insn doesn't go where we think, we're confused. */ |
1223 | gcc_assert (JUMP_LABEL (insn) == old_label); | |
1224 | ||
1225 | /* If the substitution doesn't succeed, die. This can happen | |
1226 | if the back end emitted unrecognizable instructions or if | |
1227 | target is exit block on some arches. */ | |
1228 | if (!redirect_jump (insn, block_label (new_bb), 0)) | |
1229 | { | |
1230 | gcc_assert (new_bb == EXIT_BLOCK_PTR); | |
1231 | return false; | |
1232 | } | |
6ee3c8e4 | 1233 | } |
ca6c03ca | 1234 | } |
4e3825db MM |
1235 | return true; |
1236 | } | |
1237 | ||
1238 | ||
1239 | /* Redirect edge representing branch of (un)conditional jump or tablejump, | |
1240 | NULL on failure */ | |
1241 | static edge | |
1242 | redirect_branch_edge (edge e, basic_block target) | |
1243 | { | |
1244 | rtx old_label = BB_HEAD (e->dest); | |
1245 | basic_block src = e->src; | |
1246 | rtx insn = BB_END (src); | |
1247 | ||
1248 | /* We can only redirect non-fallthru edges of jump insn. */ | |
1249 | if (e->flags & EDGE_FALLTHRU) | |
1250 | return NULL; | |
1251 | else if (!JUMP_P (insn) && !currently_expanding_to_rtl) | |
1252 | return NULL; | |
1253 | ||
1254 | if (!currently_expanding_to_rtl) | |
1255 | { | |
1256 | if (!patch_jump_insn (insn, old_label, target)) | |
1257 | return NULL; | |
1258 | } | |
1259 | else | |
1260 | /* When expanding this BB might actually contain multiple | |
1261 | jumps (i.e. not yet split by find_many_sub_basic_blocks). | |
1262 | Redirect all of those that match our label. */ | |
0f346928 | 1263 | FOR_BB_INSNS (src, insn) |
4e3825db MM |
1264 | if (JUMP_P (insn) && !patch_jump_insn (insn, old_label, target)) |
1265 | return NULL; | |
ca6c03ca | 1266 | |
c263766c RH |
1267 | if (dump_file) |
1268 | fprintf (dump_file, "Edge %i->%i redirected to %i\n", | |
0b17ab2f | 1269 | e->src->index, e->dest->index, target->index); |
5f0d2358 | 1270 | |
ca6c03ca | 1271 | if (e->dest != target) |
6de9cd9a | 1272 | e = redirect_edge_succ_nodup (e, target); |
6fb5fa3c | 1273 | |
6de9cd9a | 1274 | return e; |
bc35512f JH |
1275 | } |
1276 | ||
1277 | /* Attempt to change code to redirect edge E to TARGET. Don't do that on | |
1278 | expense of adding new instructions or reordering basic blocks. | |
1279 | ||
1280 | Function can be also called with edge destination equivalent to the TARGET. | |
1281 | Then it should try the simplifications and do nothing if none is possible. | |
1282 | ||
6de9cd9a DN |
1283 | Return edge representing the branch if transformation succeeded. Return NULL |
1284 | on failure. | |
1285 | We still return NULL in case E already destinated TARGET and we didn't | |
1286 | managed to simplify instruction stream. */ | |
bc35512f | 1287 | |
6de9cd9a | 1288 | static edge |
5671bf27 | 1289 | rtl_redirect_edge_and_branch (edge e, basic_block target) |
bc35512f | 1290 | { |
6de9cd9a | 1291 | edge ret; |
f345f21a JH |
1292 | basic_block src = e->src; |
1293 | ||
bc35512f | 1294 | if (e->flags & (EDGE_ABNORMAL_CALL | EDGE_EH)) |
6de9cd9a | 1295 | return NULL; |
bc35512f | 1296 | |
3348b696 | 1297 | if (e->dest == target) |
6de9cd9a | 1298 | return e; |
3348b696 | 1299 | |
6de9cd9a | 1300 | if ((ret = try_redirect_by_replacing_jump (e, target, false)) != NULL) |
f345f21a | 1301 | { |
6fb5fa3c | 1302 | df_set_bb_dirty (src); |
6de9cd9a | 1303 | return ret; |
f345f21a | 1304 | } |
bc35512f | 1305 | |
6de9cd9a DN |
1306 | ret = redirect_branch_edge (e, target); |
1307 | if (!ret) | |
1308 | return NULL; | |
5f0d2358 | 1309 | |
6fb5fa3c | 1310 | df_set_bb_dirty (src); |
6de9cd9a | 1311 | return ret; |
ca6c03ca JH |
1312 | } |
1313 | ||
4fe9b91c | 1314 | /* Like force_nonfallthru below, but additionally performs redirection |
26898771 BS |
1315 | Used by redirect_edge_and_branch_force. JUMP_LABEL is used only |
1316 | when redirecting to the EXIT_BLOCK, it is either ret_rtx or | |
1317 | simple_return_rtx, indicating which kind of returnjump to create. | |
1318 | It should be NULL otherwise. */ | |
ca6c03ca | 1319 | |
dc0ff1c8 | 1320 | basic_block |
26898771 | 1321 | force_nonfallthru_and_redirect (edge e, basic_block target, rtx jump_label) |
ca6c03ca | 1322 | { |
a3716585 | 1323 | basic_block jump_block, new_bb = NULL, src = e->src; |
ca6c03ca JH |
1324 | rtx note; |
1325 | edge new_edge; | |
a3716585 | 1326 | int abnormal_edge_flags = 0; |
a3e6a37b | 1327 | bool asm_goto_edge = false; |
7241571e | 1328 | int loc; |
ca6c03ca | 1329 | |
cb9a1d9b JH |
1330 | /* In the case the last instruction is conditional jump to the next |
1331 | instruction, first redirect the jump itself and then continue | |
b20b352b | 1332 | by creating a basic block afterwards to redirect fallthru edge. */ |
cb9a1d9b | 1333 | if (e->src != ENTRY_BLOCK_PTR && e->dest != EXIT_BLOCK_PTR |
a813c111 | 1334 | && any_condjump_p (BB_END (e->src)) |
a813c111 | 1335 | && JUMP_LABEL (BB_END (e->src)) == BB_HEAD (e->dest)) |
cb9a1d9b JH |
1336 | { |
1337 | rtx note; | |
58e6ae30 | 1338 | edge b = unchecked_make_edge (e->src, target, 0); |
341c100f | 1339 | bool redirected; |
cb9a1d9b | 1340 | |
341c100f NS |
1341 | redirected = redirect_jump (BB_END (e->src), block_label (target), 0); |
1342 | gcc_assert (redirected); | |
c22cacf3 | 1343 | |
a813c111 | 1344 | note = find_reg_note (BB_END (e->src), REG_BR_PROB, NULL_RTX); |
cb9a1d9b JH |
1345 | if (note) |
1346 | { | |
1347 | int prob = INTVAL (XEXP (note, 0)); | |
1348 | ||
1349 | b->probability = prob; | |
1350 | b->count = e->count * prob / REG_BR_PROB_BASE; | |
1351 | e->probability -= e->probability; | |
1352 | e->count -= b->count; | |
1353 | if (e->probability < 0) | |
1354 | e->probability = 0; | |
1355 | if (e->count < 0) | |
1356 | e->count = 0; | |
1357 | } | |
1358 | } | |
1359 | ||
ca6c03ca | 1360 | if (e->flags & EDGE_ABNORMAL) |
a3716585 JH |
1361 | { |
1362 | /* Irritating special case - fallthru edge to the same block as abnormal | |
1363 | edge. | |
1364 | We can't redirect abnormal edge, but we still can split the fallthru | |
d329e058 | 1365 | one and create separate abnormal edge to original destination. |
a3716585 | 1366 | This allows bb-reorder to make such edge non-fallthru. */ |
341c100f | 1367 | gcc_assert (e->dest == target); |
ee44c28d SB |
1368 | abnormal_edge_flags = e->flags & ~EDGE_FALLTHRU; |
1369 | e->flags &= EDGE_FALLTHRU; | |
a3716585 | 1370 | } |
341c100f | 1371 | else |
24c545ff | 1372 | { |
341c100f NS |
1373 | gcc_assert (e->flags & EDGE_FALLTHRU); |
1374 | if (e->src == ENTRY_BLOCK_PTR) | |
1375 | { | |
1376 | /* We can't redirect the entry block. Create an empty block | |
628f6a4e BE |
1377 | at the start of the function which we use to add the new |
1378 | jump. */ | |
1379 | edge tmp; | |
1380 | edge_iterator ei; | |
1381 | bool found = false; | |
c22cacf3 | 1382 | |
628f6a4e | 1383 | basic_block bb = create_basic_block (BB_HEAD (e->dest), NULL, ENTRY_BLOCK_PTR); |
c22cacf3 | 1384 | |
341c100f NS |
1385 | /* Change the existing edge's source to be the new block, and add |
1386 | a new edge from the entry block to the new block. */ | |
1387 | e->src = bb; | |
628f6a4e BE |
1388 | for (ei = ei_start (ENTRY_BLOCK_PTR->succs); (tmp = ei_safe_edge (ei)); ) |
1389 | { | |
1390 | if (tmp == e) | |
1391 | { | |
865851d0 | 1392 | VEC_unordered_remove (edge, ENTRY_BLOCK_PTR->succs, ei.index); |
628f6a4e BE |
1393 | found = true; |
1394 | break; | |
1395 | } | |
1396 | else | |
1397 | ei_next (&ei); | |
1398 | } | |
c22cacf3 | 1399 | |
628f6a4e | 1400 | gcc_assert (found); |
c22cacf3 | 1401 | |
d4e6fecb | 1402 | VEC_safe_push (edge, gc, bb->succs, e); |
341c100f NS |
1403 | make_single_succ_edge (ENTRY_BLOCK_PTR, bb, EDGE_FALLTHRU); |
1404 | } | |
24c545ff BS |
1405 | } |
1406 | ||
a3e6a37b | 1407 | /* If e->src ends with asm goto, see if any of the ASM_OPERANDS_LABELs |
891ca07d | 1408 | don't point to the target or fallthru label. */ |
a3e6a37b JJ |
1409 | if (JUMP_P (BB_END (e->src)) |
1410 | && target != EXIT_BLOCK_PTR | |
a3e6a37b JJ |
1411 | && (e->flags & EDGE_FALLTHRU) |
1412 | && (note = extract_asm_operands (PATTERN (BB_END (e->src))))) | |
ca6c03ca | 1413 | { |
a3e6a37b JJ |
1414 | int i, n = ASM_OPERANDS_LABEL_LENGTH (note); |
1415 | ||
1416 | for (i = 0; i < n; ++i) | |
891ca07d JJ |
1417 | { |
1418 | if (XEXP (ASM_OPERANDS_LABEL (note, i), 0) == BB_HEAD (e->dest)) | |
1419 | XEXP (ASM_OPERANDS_LABEL (note, i), 0) = block_label (target); | |
1420 | if (XEXP (ASM_OPERANDS_LABEL (note, i), 0) == BB_HEAD (target)) | |
a3e6a37b | 1421 | asm_goto_edge = true; |
891ca07d | 1422 | } |
a3e6a37b JJ |
1423 | } |
1424 | ||
1425 | if (EDGE_COUNT (e->src->succs) >= 2 || abnormal_edge_flags || asm_goto_edge) | |
1426 | { | |
1427 | gcov_type count = e->count; | |
1428 | int probability = e->probability; | |
ca6c03ca | 1429 | /* Create the new structures. */ |
31a78298 | 1430 | |
79019985 RH |
1431 | /* If the old block ended with a tablejump, skip its table |
1432 | by searching forward from there. Otherwise start searching | |
1433 | forward from the last instruction of the old block. */ | |
a813c111 SB |
1434 | if (!tablejump_p (BB_END (e->src), NULL, ¬e)) |
1435 | note = BB_END (e->src); | |
31a78298 RH |
1436 | note = NEXT_INSN (note); |
1437 | ||
31a78298 | 1438 | jump_block = create_basic_block (note, NULL, e->src); |
a3e6a37b | 1439 | jump_block->count = count; |
ca6c03ca JH |
1440 | jump_block->frequency = EDGE_FREQUENCY (e); |
1441 | jump_block->loop_depth = target->loop_depth; | |
1442 | ||
750054a2 CT |
1443 | /* Make sure new block ends up in correct hot/cold section. */ |
1444 | ||
076c7ab8 | 1445 | BB_COPY_PARTITION (jump_block, e->src); |
9fb32434 | 1446 | if (flag_reorder_blocks_and_partition |
677f3fa8 | 1447 | && targetm_common.have_named_sections |
87c8b4be CT |
1448 | && JUMP_P (BB_END (jump_block)) |
1449 | && !any_condjump_p (BB_END (jump_block)) | |
1450 | && (EDGE_SUCC (jump_block, 0)->flags & EDGE_CROSSING)) | |
65c5f2a6 | 1451 | add_reg_note (BB_END (jump_block), REG_CROSSING_JUMP, NULL_RTX); |
c22cacf3 | 1452 | |
ca6c03ca JH |
1453 | /* Wire edge in. */ |
1454 | new_edge = make_edge (e->src, jump_block, EDGE_FALLTHRU); | |
a3e6a37b JJ |
1455 | new_edge->probability = probability; |
1456 | new_edge->count = count; | |
ca6c03ca JH |
1457 | |
1458 | /* Redirect old edge. */ | |
1459 | redirect_edge_pred (e, jump_block); | |
1460 | e->probability = REG_BR_PROB_BASE; | |
1461 | ||
a3e6a37b JJ |
1462 | /* If asm goto has any label refs to target's label, |
1463 | add also edge from asm goto bb to target. */ | |
1464 | if (asm_goto_edge) | |
1465 | { | |
1466 | new_edge->probability /= 2; | |
1467 | new_edge->count /= 2; | |
1468 | jump_block->count /= 2; | |
1469 | jump_block->frequency /= 2; | |
1470 | new_edge = make_edge (new_edge->src, target, | |
1471 | e->flags & ~EDGE_FALLTHRU); | |
1472 | new_edge->probability = probability - probability / 2; | |
1473 | new_edge->count = count - count / 2; | |
1474 | } | |
1475 | ||
ca6c03ca JH |
1476 | new_bb = jump_block; |
1477 | } | |
1478 | else | |
1479 | jump_block = e->src; | |
5f0d2358 | 1480 | |
7241571e JJ |
1481 | if (e->goto_locus && e->goto_block == NULL) |
1482 | loc = e->goto_locus; | |
1483 | else | |
1484 | loc = 0; | |
ca6c03ca JH |
1485 | e->flags &= ~EDGE_FALLTHRU; |
1486 | if (target == EXIT_BLOCK_PTR) | |
1487 | { | |
26898771 BS |
1488 | if (jump_label == ret_rtx) |
1489 | { | |
cf22ce3c | 1490 | #ifdef HAVE_return |
26898771 | 1491 | emit_jump_insn_after_setloc (gen_return (), BB_END (jump_block), loc); |
cf22ce3c | 1492 | #else |
26898771 | 1493 | gcc_unreachable (); |
cf22ce3c | 1494 | #endif |
26898771 BS |
1495 | } |
1496 | else | |
1497 | { | |
1498 | gcc_assert (jump_label == simple_return_rtx); | |
1499 | #ifdef HAVE_simple_return | |
1500 | emit_jump_insn_after_setloc (gen_simple_return (), | |
1501 | BB_END (jump_block), loc); | |
1502 | #else | |
1503 | gcc_unreachable (); | |
1504 | #endif | |
1505 | } | |
387748de | 1506 | set_return_jump_label (BB_END (jump_block)); |
ca6c03ca JH |
1507 | } |
1508 | else | |
1509 | { | |
1510 | rtx label = block_label (target); | |
7241571e | 1511 | emit_jump_insn_after_setloc (gen_jump (label), BB_END (jump_block), loc); |
a813c111 | 1512 | JUMP_LABEL (BB_END (jump_block)) = label; |
ca6c03ca JH |
1513 | LABEL_NUSES (label)++; |
1514 | } | |
5f0d2358 | 1515 | |
a813c111 | 1516 | emit_barrier_after (BB_END (jump_block)); |
ca6c03ca JH |
1517 | redirect_edge_succ_nodup (e, target); |
1518 | ||
a3716585 JH |
1519 | if (abnormal_edge_flags) |
1520 | make_edge (src, target, abnormal_edge_flags); | |
1521 | ||
b8698a0f | 1522 | df_mark_solutions_dirty (); |
ca6c03ca JH |
1523 | return new_bb; |
1524 | } | |
1525 | ||
1526 | /* Edge E is assumed to be fallthru edge. Emit needed jump instruction | |
1527 | (and possibly create new basic block) to make edge non-fallthru. | |
1528 | Return newly created BB or NULL if none. */ | |
5f0d2358 | 1529 | |
cf103ca4 EB |
1530 | static basic_block |
1531 | rtl_force_nonfallthru (edge e) | |
ca6c03ca | 1532 | { |
26898771 | 1533 | return force_nonfallthru_and_redirect (e, e->dest, NULL_RTX); |
ca6c03ca JH |
1534 | } |
1535 | ||
1536 | /* Redirect edge even at the expense of creating new jump insn or | |
1537 | basic block. Return new basic block if created, NULL otherwise. | |
41806d92 | 1538 | Conversion must be possible. */ |
ca6c03ca | 1539 | |
9ee634e3 | 1540 | static basic_block |
d329e058 | 1541 | rtl_redirect_edge_and_branch_force (edge e, basic_block target) |
ca6c03ca | 1542 | { |
5f0d2358 RK |
1543 | if (redirect_edge_and_branch (e, target) |
1544 | || e->dest == target) | |
ca6c03ca JH |
1545 | return NULL; |
1546 | ||
1547 | /* In case the edge redirection failed, try to force it to be non-fallthru | |
1548 | and redirect newly created simplejump. */ | |
6fb5fa3c | 1549 | df_set_bb_dirty (e->src); |
26898771 | 1550 | return force_nonfallthru_and_redirect (e, target, NULL_RTX); |
ca6c03ca JH |
1551 | } |
1552 | ||
1553 | /* The given edge should potentially be a fallthru edge. If that is in | |
1554 | fact true, delete the jump and barriers that are in the way. */ | |
1555 | ||
f470c378 ZD |
1556 | static void |
1557 | rtl_tidy_fallthru_edge (edge e) | |
ca6c03ca JH |
1558 | { |
1559 | rtx q; | |
f470c378 ZD |
1560 | basic_block b = e->src, c = b->next_bb; |
1561 | ||
ca6c03ca JH |
1562 | /* ??? In a late-running flow pass, other folks may have deleted basic |
1563 | blocks by nopping out blocks, leaving multiple BARRIERs between here | |
0fa2e4df | 1564 | and the target label. They ought to be chastised and fixed. |
ca6c03ca JH |
1565 | |
1566 | We can also wind up with a sequence of undeletable labels between | |
1567 | one block and the next. | |
1568 | ||
1569 | So search through a sequence of barriers, labels, and notes for | |
1570 | the head of block C and assert that we really do fall through. */ | |
1571 | ||
a813c111 | 1572 | for (q = NEXT_INSN (BB_END (b)); q != BB_HEAD (c); q = NEXT_INSN (q)) |
9c0a0632 RH |
1573 | if (INSN_P (q)) |
1574 | return; | |
ca6c03ca JH |
1575 | |
1576 | /* Remove what will soon cease being the jump insn from the source block. | |
1577 | If block B consisted only of this single jump, turn it into a deleted | |
1578 | note. */ | |
a813c111 | 1579 | q = BB_END (b); |
4b4bf941 | 1580 | if (JUMP_P (q) |
ca6c03ca JH |
1581 | && onlyjump_p (q) |
1582 | && (any_uncondjump_p (q) | |
c5cbcccf | 1583 | || single_succ_p (b))) |
ca6c03ca JH |
1584 | { |
1585 | #ifdef HAVE_cc0 | |
1586 | /* If this was a conditional jump, we need to also delete | |
1587 | the insn that set cc0. */ | |
1588 | if (any_condjump_p (q) && only_sets_cc0_p (PREV_INSN (q))) | |
1589 | q = PREV_INSN (q); | |
1590 | #endif | |
1591 | ||
1592 | q = PREV_INSN (q); | |
ca6c03ca JH |
1593 | } |
1594 | ||
1595 | /* Selectively unlink the sequence. */ | |
a813c111 | 1596 | if (q != PREV_INSN (BB_HEAD (c))) |
a7b87f73 | 1597 | delete_insn_chain (NEXT_INSN (q), PREV_INSN (BB_HEAD (c)), false); |
ca6c03ca JH |
1598 | |
1599 | e->flags |= EDGE_FALLTHRU; | |
1600 | } | |
ca6c03ca | 1601 | \f |
f470c378 ZD |
1602 | /* Should move basic block BB after basic block AFTER. NIY. */ |
1603 | ||
1604 | static bool | |
1605 | rtl_move_block_after (basic_block bb ATTRIBUTE_UNUSED, | |
1606 | basic_block after ATTRIBUTE_UNUSED) | |
1607 | { | |
1608 | return false; | |
1609 | } | |
1610 | ||
ca6c03ca | 1611 | /* Split a (typically critical) edge. Return the new block. |
41806d92 | 1612 | The edge must not be abnormal. |
ca6c03ca JH |
1613 | |
1614 | ??? The code generally expects to be called on critical edges. | |
1615 | The case of a block ending in an unconditional jump to a | |
1616 | block with multiple predecessors is not handled optimally. */ | |
1617 | ||
8ce33230 | 1618 | static basic_block |
d329e058 | 1619 | rtl_split_edge (edge edge_in) |
ca6c03ca JH |
1620 | { |
1621 | basic_block bb; | |
ca6c03ca JH |
1622 | rtx before; |
1623 | ||
1624 | /* Abnormal edges cannot be split. */ | |
341c100f | 1625 | gcc_assert (!(edge_in->flags & EDGE_ABNORMAL)); |
ca6c03ca JH |
1626 | |
1627 | /* We are going to place the new block in front of edge destination. | |
eaec9b3d | 1628 | Avoid existence of fallthru predecessors. */ |
ca6c03ca JH |
1629 | if ((edge_in->flags & EDGE_FALLTHRU) == 0) |
1630 | { | |
0fd4b31d | 1631 | edge e = find_fallthru_edge (edge_in->dest->preds); |
ca6c03ca JH |
1632 | |
1633 | if (e) | |
1634 | force_nonfallthru (e); | |
1635 | } | |
1636 | ||
96e82e0a ZD |
1637 | /* Create the basic block note. */ |
1638 | if (edge_in->dest != EXIT_BLOCK_PTR) | |
a813c111 | 1639 | before = BB_HEAD (edge_in->dest); |
ca6c03ca JH |
1640 | else |
1641 | before = NULL_RTX; | |
1642 | ||
623a66fa | 1643 | /* If this is a fall through edge to the exit block, the blocks might be |
ffe14686 AM |
1644 | not adjacent, and the right place is after the source. */ |
1645 | if ((edge_in->flags & EDGE_FALLTHRU) && edge_in->dest == EXIT_BLOCK_PTR) | |
623a66fa R |
1646 | { |
1647 | before = NEXT_INSN (BB_END (edge_in->src)); | |
623a66fa | 1648 | bb = create_basic_block (before, NULL, edge_in->src); |
076c7ab8 | 1649 | BB_COPY_PARTITION (bb, edge_in->src); |
623a66fa R |
1650 | } |
1651 | else | |
9fb32434 CT |
1652 | { |
1653 | bb = create_basic_block (before, NULL, edge_in->dest->prev_bb); | |
076c7ab8 ZW |
1654 | /* ??? Why not edge_in->dest->prev_bb here? */ |
1655 | BB_COPY_PARTITION (bb, edge_in->dest); | |
9fb32434 | 1656 | } |
ca6c03ca | 1657 | |
4977bab6 | 1658 | make_single_succ_edge (bb, edge_in->dest, EDGE_FALLTHRU); |
ca6c03ca | 1659 | |
4d6922ee | 1660 | /* For non-fallthru edges, we must adjust the predecessor's |
ca6c03ca JH |
1661 | jump instruction to target our new block. */ |
1662 | if ((edge_in->flags & EDGE_FALLTHRU) == 0) | |
1663 | { | |
341c100f NS |
1664 | edge redirected = redirect_edge_and_branch (edge_in, bb); |
1665 | gcc_assert (redirected); | |
ca6c03ca JH |
1666 | } |
1667 | else | |
3b5fda81 JJ |
1668 | { |
1669 | if (edge_in->src != ENTRY_BLOCK_PTR) | |
1670 | { | |
1671 | /* For asm goto even splitting of fallthru edge might | |
1672 | need insn patching, as other labels might point to the | |
1673 | old label. */ | |
1674 | rtx last = BB_END (edge_in->src); | |
1675 | if (last | |
1676 | && JUMP_P (last) | |
1677 | && edge_in->dest != EXIT_BLOCK_PTR | |
1678 | && extract_asm_operands (PATTERN (last)) != NULL_RTX | |
1679 | && patch_jump_insn (last, before, bb)) | |
1680 | df_set_bb_dirty (edge_in->src); | |
1681 | } | |
1682 | redirect_edge_succ (edge_in, bb); | |
1683 | } | |
ca6c03ca JH |
1684 | |
1685 | return bb; | |
1686 | } | |
1687 | ||
1688 | /* Queue instructions for insertion on an edge between two basic blocks. | |
1689 | The new instructions and basic blocks (if any) will not appear in the | |
1690 | CFG until commit_edge_insertions is called. */ | |
1691 | ||
1692 | void | |
d329e058 | 1693 | insert_insn_on_edge (rtx pattern, edge e) |
ca6c03ca JH |
1694 | { |
1695 | /* We cannot insert instructions on an abnormal critical edge. | |
1696 | It will be easier to find the culprit if we die now. */ | |
341c100f | 1697 | gcc_assert (!((e->flags & EDGE_ABNORMAL) && EDGE_CRITICAL_P (e))); |
ca6c03ca | 1698 | |
6de9cd9a | 1699 | if (e->insns.r == NULL_RTX) |
ca6c03ca JH |
1700 | start_sequence (); |
1701 | else | |
6de9cd9a | 1702 | push_to_sequence (e->insns.r); |
ca6c03ca JH |
1703 | |
1704 | emit_insn (pattern); | |
1705 | ||
6de9cd9a | 1706 | e->insns.r = get_insns (); |
ca6c03ca JH |
1707 | end_sequence (); |
1708 | } | |
1709 | ||
1710 | /* Update the CFG for the instructions queued on edge E. */ | |
1711 | ||
4e3825db | 1712 | void |
2ac66157 | 1713 | commit_one_edge_insertion (edge e) |
ca6c03ca JH |
1714 | { |
1715 | rtx before = NULL_RTX, after = NULL_RTX, insns, tmp, last; | |
898c90c0 | 1716 | basic_block bb; |
ca6c03ca JH |
1717 | |
1718 | /* Pull the insns off the edge now since the edge might go away. */ | |
6de9cd9a DN |
1719 | insns = e->insns.r; |
1720 | e->insns.r = NULL_RTX; | |
ca6c03ca | 1721 | |
898c90c0 EB |
1722 | /* Figure out where to put these insns. If the destination has |
1723 | one predecessor, insert there. Except for the exit block. */ | |
1724 | if (single_pred_p (e->dest) && e->dest != EXIT_BLOCK_PTR) | |
ca6c03ca | 1725 | { |
898c90c0 EB |
1726 | bb = e->dest; |
1727 | ||
1728 | /* Get the location correct wrt a code label, and "nice" wrt | |
1729 | a basic block note, and before everything else. */ | |
1730 | tmp = BB_HEAD (bb); | |
1731 | if (LABEL_P (tmp)) | |
1732 | tmp = NEXT_INSN (tmp); | |
1733 | if (NOTE_INSN_BASIC_BLOCK_P (tmp)) | |
1734 | tmp = NEXT_INSN (tmp); | |
1735 | if (tmp == BB_HEAD (bb)) | |
1736 | before = tmp; | |
1737 | else if (tmp) | |
1738 | after = PREV_INSN (tmp); | |
1739 | else | |
1740 | after = get_last_insn (); | |
1741 | } | |
3dec4024 | 1742 | |
898c90c0 EB |
1743 | /* If the source has one successor and the edge is not abnormal, |
1744 | insert there. Except for the entry block. */ | |
1745 | else if ((e->flags & EDGE_ABNORMAL) == 0 | |
1746 | && single_succ_p (e->src) | |
1747 | && e->src != ENTRY_BLOCK_PTR) | |
1748 | { | |
1749 | bb = e->src; | |
3dec4024 | 1750 | |
898c90c0 EB |
1751 | /* It is possible to have a non-simple jump here. Consider a target |
1752 | where some forms of unconditional jumps clobber a register. This | |
1753 | happens on the fr30 for example. | |
ca6c03ca | 1754 | |
898c90c0 EB |
1755 | We know this block has a single successor, so we can just emit |
1756 | the queued insns before the jump. */ | |
1757 | if (JUMP_P (BB_END (bb))) | |
1758 | before = BB_END (bb); | |
3dec4024 JH |
1759 | else |
1760 | { | |
898c90c0 EB |
1761 | /* We'd better be fallthru, or we've lost track of what's what. */ |
1762 | gcc_assert (e->flags & EDGE_FALLTHRU); | |
750054a2 | 1763 | |
898c90c0 | 1764 | after = BB_END (bb); |
ca6c03ca JH |
1765 | } |
1766 | } | |
1767 | ||
898c90c0 EB |
1768 | /* Otherwise we must split the edge. */ |
1769 | else | |
1770 | { | |
1771 | bb = split_edge (e); | |
1772 | after = BB_END (bb); | |
ca6c03ca | 1773 | |
898c90c0 | 1774 | if (flag_reorder_blocks_and_partition |
677f3fa8 | 1775 | && targetm_common.have_named_sections |
898c90c0 EB |
1776 | && e->src != ENTRY_BLOCK_PTR |
1777 | && BB_PARTITION (e->src) == BB_COLD_PARTITION | |
1778 | && !(e->flags & EDGE_CROSSING) | |
1779 | && JUMP_P (after) | |
1780 | && !any_condjump_p (after) | |
1781 | && (single_succ_edge (bb)->flags & EDGE_CROSSING)) | |
1782 | add_reg_note (after, REG_CROSSING_JUMP, NULL_RTX); | |
1783 | } | |
1784 | ||
1785 | /* Now that we've found the spot, do the insertion. */ | |
ca6c03ca JH |
1786 | if (before) |
1787 | { | |
6fb5fa3c | 1788 | emit_insn_before_noloc (insns, before, bb); |
ca6c03ca JH |
1789 | last = prev_nonnote_insn (before); |
1790 | } | |
1791 | else | |
6fb5fa3c | 1792 | last = emit_insn_after_noloc (insns, after, bb); |
ca6c03ca JH |
1793 | |
1794 | if (returnjump_p (last)) | |
1795 | { | |
1796 | /* ??? Remove all outgoing edges from BB and add one for EXIT. | |
c22cacf3 MS |
1797 | This is not currently a problem because this only happens |
1798 | for the (single) epilogue, which already has a fallthru edge | |
1799 | to EXIT. */ | |
ca6c03ca | 1800 | |
c5cbcccf | 1801 | e = single_succ_edge (bb); |
341c100f | 1802 | gcc_assert (e->dest == EXIT_BLOCK_PTR |
c5cbcccf | 1803 | && single_succ_p (bb) && (e->flags & EDGE_FALLTHRU)); |
ca6c03ca | 1804 | |
5f0d2358 | 1805 | e->flags &= ~EDGE_FALLTHRU; |
ca6c03ca | 1806 | emit_barrier_after (last); |
0b17ab2f | 1807 | |
ca6c03ca JH |
1808 | if (before) |
1809 | delete_insn (before); | |
1810 | } | |
341c100f NS |
1811 | else |
1812 | gcc_assert (!JUMP_P (last)); | |
ca6c03ca JH |
1813 | } |
1814 | ||
1815 | /* Update the CFG for all queued instructions. */ | |
1816 | ||
1817 | void | |
d329e058 | 1818 | commit_edge_insertions (void) |
ca6c03ca | 1819 | { |
ca6c03ca JH |
1820 | basic_block bb; |
1821 | ||
1822 | #ifdef ENABLE_CHECKING | |
1823 | verify_flow_info (); | |
1824 | #endif | |
1825 | ||
e0082a72 | 1826 | FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb) |
ca6c03ca | 1827 | { |
628f6a4e BE |
1828 | edge e; |
1829 | edge_iterator ei; | |
ca6c03ca | 1830 | |
628f6a4e BE |
1831 | FOR_EACH_EDGE (e, ei, bb->succs) |
1832 | if (e->insns.r) | |
cf103ca4 | 1833 | commit_one_edge_insertion (e); |
3dec4024 | 1834 | } |
ca6c03ca JH |
1835 | } |
1836 | \f | |
6fb5fa3c | 1837 | |
f470c378 | 1838 | /* Print out RTL-specific basic block information (live information |
a315c44c SB |
1839 | at start and end with TDF_DETAILS). FLAGS are the TDF_* masks |
1840 | documented in dumpfile.h. */ | |
ca6c03ca | 1841 | |
10e9fecc | 1842 | static void |
a315c44c | 1843 | rtl_dump_bb (FILE *outf, basic_block bb, int indent, int flags) |
ca6c03ca JH |
1844 | { |
1845 | rtx insn; | |
1846 | rtx last; | |
f470c378 | 1847 | char *s_indent; |
ca6c03ca | 1848 | |
ae50c0cb | 1849 | s_indent = (char *) alloca ((size_t) indent + 1); |
400e39e3 | 1850 | memset (s_indent, ' ', (size_t) indent); |
f470c378 | 1851 | s_indent[indent] = '\0'; |
b8698a0f | 1852 | |
a315c44c | 1853 | if (df && (flags & TDF_DETAILS)) |
6fb5fa3c DB |
1854 | { |
1855 | df_dump_top (bb, outf); | |
1856 | putc ('\n', outf); | |
1857 | } | |
ca6c03ca | 1858 | |
68cc3174 EB |
1859 | if (bb->index != ENTRY_BLOCK && bb->index != EXIT_BLOCK) |
1860 | for (insn = BB_HEAD (bb), last = NEXT_INSN (BB_END (bb)); insn != last; | |
1861 | insn = NEXT_INSN (insn)) | |
a315c44c SB |
1862 | { |
1863 | if (! (flags & TDF_SLIM)) | |
1864 | print_rtl_single (outf, insn); | |
1865 | else | |
1866 | dump_insn_slim (outf, insn); | |
ca6c03ca | 1867 | |
a315c44c SB |
1868 | } |
1869 | ||
1870 | if (df && (flags & TDF_DETAILS)) | |
6fb5fa3c DB |
1871 | { |
1872 | df_dump_bottom (bb, outf); | |
1873 | putc ('\n', outf); | |
1874 | } | |
1875 | ||
ca6c03ca JH |
1876 | } |
1877 | \f | |
1878 | /* Like print_rtl, but also print out live information for the start of each | |
a315c44c | 1879 | basic block. FLAGS are the flags documented in dumpfile.h. */ |
ca6c03ca JH |
1880 | |
1881 | void | |
a315c44c | 1882 | print_rtl_with_bb (FILE *outf, const_rtx rtx_first, int flags) |
ca6c03ca | 1883 | { |
22ea9ec0 | 1884 | const_rtx tmp_rtx; |
ca6c03ca JH |
1885 | if (rtx_first == 0) |
1886 | fprintf (outf, "(nil)\n"); | |
1887 | else | |
1888 | { | |
ca6c03ca JH |
1889 | enum bb_state { NOT_IN_BB, IN_ONE_BB, IN_MULTIPLE_BB }; |
1890 | int max_uid = get_max_uid (); | |
5ed6ace5 MD |
1891 | basic_block *start = XCNEWVEC (basic_block, max_uid); |
1892 | basic_block *end = XCNEWVEC (basic_block, max_uid); | |
1893 | enum bb_state *in_bb_p = XCNEWVEC (enum bb_state, max_uid); | |
ca6c03ca | 1894 | |
e0082a72 ZD |
1895 | basic_block bb; |
1896 | ||
6fb5fa3c DB |
1897 | if (df) |
1898 | df_dump_start (outf); | |
1899 | ||
e0082a72 | 1900 | FOR_EACH_BB_REVERSE (bb) |
ca6c03ca | 1901 | { |
ca6c03ca JH |
1902 | rtx x; |
1903 | ||
a813c111 SB |
1904 | start[INSN_UID (BB_HEAD (bb))] = bb; |
1905 | end[INSN_UID (BB_END (bb))] = bb; | |
1906 | for (x = BB_HEAD (bb); x != NULL_RTX; x = NEXT_INSN (x)) | |
ca6c03ca JH |
1907 | { |
1908 | enum bb_state state = IN_MULTIPLE_BB; | |
5f0d2358 | 1909 | |
ca6c03ca JH |
1910 | if (in_bb_p[INSN_UID (x)] == NOT_IN_BB) |
1911 | state = IN_ONE_BB; | |
1912 | in_bb_p[INSN_UID (x)] = state; | |
1913 | ||
a813c111 | 1914 | if (x == BB_END (bb)) |
ca6c03ca JH |
1915 | break; |
1916 | } | |
1917 | } | |
1918 | ||
1919 | for (tmp_rtx = rtx_first; NULL != tmp_rtx; tmp_rtx = NEXT_INSN (tmp_rtx)) | |
1920 | { | |
510a442a RH |
1921 | bb = start[INSN_UID (tmp_rtx)]; |
1922 | if (bb != NULL) | |
a315c44c | 1923 | dump_bb_info (outf, bb, 0, dump_flags | TDF_COMMENT, true, false); |
ca6c03ca JH |
1924 | |
1925 | if (in_bb_p[INSN_UID (tmp_rtx)] == NOT_IN_BB | |
4b4bf941 JQ |
1926 | && !NOTE_P (tmp_rtx) |
1927 | && !BARRIER_P (tmp_rtx)) | |
ca6c03ca JH |
1928 | fprintf (outf, ";; Insn is not within a basic block\n"); |
1929 | else if (in_bb_p[INSN_UID (tmp_rtx)] == IN_MULTIPLE_BB) | |
1930 | fprintf (outf, ";; Insn is in multiple basic blocks\n"); | |
1931 | ||
a315c44c SB |
1932 | if (! (flags & TDF_SLIM)) |
1933 | print_rtl_single (outf, tmp_rtx); | |
1934 | else | |
1935 | dump_insn_slim (outf, tmp_rtx); | |
ca6c03ca | 1936 | |
510a442a RH |
1937 | bb = end[INSN_UID (tmp_rtx)]; |
1938 | if (bb != NULL) | |
a315c44c SB |
1939 | dump_bb_info (outf, bb, 0, dump_flags | TDF_COMMENT, false, true); |
1940 | ||
1941 | putc ('\n', outf); | |
ca6c03ca JH |
1942 | } |
1943 | ||
1944 | free (start); | |
1945 | free (end); | |
1946 | free (in_bb_p); | |
1947 | } | |
1948 | ||
cb91fab0 | 1949 | if (crtl->epilogue_delay_list != 0) |
ca6c03ca JH |
1950 | { |
1951 | fprintf (outf, "\n;; Insns in epilogue delay list:\n\n"); | |
cb91fab0 | 1952 | for (tmp_rtx = crtl->epilogue_delay_list; tmp_rtx != 0; |
ca6c03ca JH |
1953 | tmp_rtx = XEXP (tmp_rtx, 1)) |
1954 | print_rtl_single (outf, XEXP (tmp_rtx, 0)); | |
1955 | } | |
1956 | } | |
1957 | \f | |
532aafad SB |
1958 | /* Update the branch probability of BB if a REG_BR_PROB is present. */ |
1959 | ||
b446e5a2 | 1960 | void |
d329e058 | 1961 | update_br_prob_note (basic_block bb) |
b446e5a2 JH |
1962 | { |
1963 | rtx note; | |
4b4bf941 | 1964 | if (!JUMP_P (BB_END (bb))) |
b446e5a2 | 1965 | return; |
a813c111 | 1966 | note = find_reg_note (BB_END (bb), REG_BR_PROB, NULL_RTX); |
b446e5a2 JH |
1967 | if (!note || INTVAL (XEXP (note, 0)) == BRANCH_EDGE (bb)->probability) |
1968 | return; | |
1969 | XEXP (note, 0) = GEN_INT (BRANCH_EDGE (bb)->probability); | |
1970 | } | |
96370780 MK |
1971 | |
1972 | /* Get the last insn associated with block BB (that includes barriers and | |
1973 | tablejumps after BB). */ | |
1974 | rtx | |
1975 | get_last_bb_insn (basic_block bb) | |
1976 | { | |
1977 | rtx tmp; | |
1978 | rtx end = BB_END (bb); | |
1979 | ||
1980 | /* Include any jump table following the basic block. */ | |
1981 | if (tablejump_p (end, NULL, &tmp)) | |
1982 | end = tmp; | |
1983 | ||
1984 | /* Include any barriers that may follow the basic block. */ | |
1e211590 | 1985 | tmp = next_nonnote_insn_bb (end); |
96370780 MK |
1986 | while (tmp && BARRIER_P (tmp)) |
1987 | { | |
1988 | end = tmp; | |
1e211590 | 1989 | tmp = next_nonnote_insn_bb (end); |
96370780 MK |
1990 | } |
1991 | ||
1992 | return end; | |
1993 | } | |
b446e5a2 | 1994 | \f |
10e9fecc JH |
1995 | /* Verify the CFG and RTL consistency common for both underlying RTL and |
1996 | cfglayout RTL. | |
ca6c03ca JH |
1997 | |
1998 | Currently it does following checks: | |
1999 | ||
ca6c03ca | 2000 | - overlapping of basic blocks |
9eab6785 | 2001 | - insns with wrong BLOCK_FOR_INSN pointers |
ca6c03ca | 2002 | - headers of basic blocks (the NOTE_INSN_BASIC_BLOCK note) |
f63d1bf7 | 2003 | - tails of basic blocks (ensure that boundary is necessary) |
ca6c03ca JH |
2004 | - scans body of the basic block for JUMP_INSN, CODE_LABEL |
2005 | and NOTE_INSN_BASIC_BLOCK | |
750054a2 | 2006 | - verify that no fall_thru edge crosses hot/cold partition boundaries |
9eab6785 | 2007 | - verify that there are no pending RTL branch predictions |
ca6c03ca JH |
2008 | |
2009 | In future it can be extended check a lot of other stuff as well | |
2010 | (reachability of basic blocks, life information, etc. etc.). */ | |
f470c378 | 2011 | |
10e9fecc | 2012 | static int |
d329e058 | 2013 | rtl_verify_flow_info_1 (void) |
ca6c03ca | 2014 | { |
ca6c03ca | 2015 | rtx x; |
10e9fecc | 2016 | int err = 0; |
94eb5ddb | 2017 | basic_block bb; |
ca6c03ca | 2018 | |
9eab6785 | 2019 | /* Check the general integrity of the basic blocks. */ |
e0082a72 | 2020 | FOR_EACH_BB_REVERSE (bb) |
ca6c03ca | 2021 | { |
9eab6785 | 2022 | rtx insn; |
5f0d2358 | 2023 | |
5e2d947c JH |
2024 | if (!(bb->flags & BB_RTL)) |
2025 | { | |
2026 | error ("BB_RTL flag not set for block %d", bb->index); | |
2027 | err = 1; | |
2028 | } | |
2029 | ||
9eab6785 | 2030 | FOR_BB_INSNS (bb, insn) |
8ce9fd5d | 2031 | if (BLOCK_FOR_INSN (insn) != bb) |
9eab6785 SB |
2032 | { |
2033 | error ("insn %d basic block pointer is %d, should be %d", | |
2034 | INSN_UID (insn), | |
2035 | BLOCK_FOR_INSN (insn) ? BLOCK_FOR_INSN (insn)->index : 0, | |
2036 | bb->index); | |
2037 | err = 1; | |
2038 | } | |
a7b87f73 | 2039 | |
bcc708fc | 2040 | for (insn = BB_HEADER (bb); insn; insn = NEXT_INSN (insn)) |
a7b87f73 ZD |
2041 | if (!BARRIER_P (insn) |
2042 | && BLOCK_FOR_INSN (insn) != NULL) | |
2043 | { | |
2044 | error ("insn %d in header of bb %d has non-NULL basic block", | |
2045 | INSN_UID (insn), bb->index); | |
2046 | err = 1; | |
2047 | } | |
bcc708fc | 2048 | for (insn = BB_FOOTER (bb); insn; insn = NEXT_INSN (insn)) |
a7b87f73 ZD |
2049 | if (!BARRIER_P (insn) |
2050 | && BLOCK_FOR_INSN (insn) != NULL) | |
2051 | { | |
2052 | error ("insn %d in footer of bb %d has non-NULL basic block", | |
2053 | INSN_UID (insn), bb->index); | |
2054 | err = 1; | |
2055 | } | |
ca6c03ca JH |
2056 | } |
2057 | ||
2058 | /* Now check the basic blocks (boundaries etc.) */ | |
e0082a72 | 2059 | FOR_EACH_BB_REVERSE (bb) |
ca6c03ca | 2060 | { |
3dec4024 | 2061 | int n_fallthru = 0, n_eh = 0, n_call = 0, n_abnormal = 0, n_branch = 0; |
3cf54412 | 2062 | edge e, fallthru = NULL; |
5a1a3e5e | 2063 | rtx note; |
628f6a4e | 2064 | edge_iterator ei; |
ca6c03ca | 2065 | |
2085a21f | 2066 | if (JUMP_P (BB_END (bb)) |
a813c111 | 2067 | && (note = find_reg_note (BB_END (bb), REG_BR_PROB, NULL_RTX)) |
628f6a4e | 2068 | && EDGE_COUNT (bb->succs) >= 2 |
a813c111 | 2069 | && any_condjump_p (BB_END (bb))) |
5a1a3e5e | 2070 | { |
e53de54d JH |
2071 | if (INTVAL (XEXP (note, 0)) != BRANCH_EDGE (bb)->probability |
2072 | && profile_status != PROFILE_ABSENT) | |
5a1a3e5e | 2073 | { |
0108ae51 | 2074 | error ("verify_flow_info: REG_BR_PROB does not match cfg %wi %i", |
5a1a3e5e JH |
2075 | INTVAL (XEXP (note, 0)), BRANCH_EDGE (bb)->probability); |
2076 | err = 1; | |
2077 | } | |
2078 | } | |
628f6a4e | 2079 | FOR_EACH_EDGE (e, ei, bb->succs) |
ca6c03ca | 2080 | { |
0be7e7a6 RH |
2081 | bool is_crossing; |
2082 | ||
ca6c03ca | 2083 | if (e->flags & EDGE_FALLTHRU) |
0be7e7a6 RH |
2084 | n_fallthru++, fallthru = e; |
2085 | ||
2086 | is_crossing = (BB_PARTITION (e->src) != BB_PARTITION (e->dest) | |
2087 | && e->src != ENTRY_BLOCK_PTR | |
2088 | && e->dest != EXIT_BLOCK_PTR); | |
2089 | if (e->flags & EDGE_CROSSING) | |
750054a2 | 2090 | { |
0be7e7a6 RH |
2091 | if (!is_crossing) |
2092 | { | |
2093 | error ("EDGE_CROSSING incorrectly set across same section"); | |
2094 | err = 1; | |
2095 | } | |
2096 | if (e->flags & EDGE_FALLTHRU) | |
2097 | { | |
ab532386 | 2098 | error ("fallthru edge crosses section boundary (bb %i)", |
750054a2 CT |
2099 | e->src->index); |
2100 | err = 1; | |
2101 | } | |
0be7e7a6 RH |
2102 | if (e->flags & EDGE_EH) |
2103 | { | |
2104 | error ("EH edge crosses section boundary (bb %i)", | |
2105 | e->src->index); | |
2106 | err = 1; | |
2107 | } | |
2108 | } | |
2109 | else if (is_crossing) | |
2110 | { | |
2111 | error ("EDGE_CROSSING missing across section boundary"); | |
2112 | err = 1; | |
750054a2 | 2113 | } |
3dec4024 | 2114 | |
65f43cdf ZD |
2115 | if ((e->flags & ~(EDGE_DFS_BACK |
2116 | | EDGE_CAN_FALLTHRU | |
2117 | | EDGE_IRREDUCIBLE_LOOP | |
9beb1c84 | 2118 | | EDGE_LOOP_EXIT |
7e872b90 JJ |
2119 | | EDGE_CROSSING |
2120 | | EDGE_PRESERVE)) == 0) | |
3dec4024 JH |
2121 | n_branch++; |
2122 | ||
2123 | if (e->flags & EDGE_ABNORMAL_CALL) | |
2124 | n_call++; | |
2125 | ||
2126 | if (e->flags & EDGE_EH) | |
2127 | n_eh++; | |
2128 | else if (e->flags & EDGE_ABNORMAL) | |
2129 | n_abnormal++; | |
ca6c03ca | 2130 | } |
5f0d2358 | 2131 | |
1d65f45c | 2132 | if (n_eh && !find_reg_note (BB_END (bb), REG_EH_REGION, NULL_RTX)) |
3dec4024 | 2133 | { |
ab532386 | 2134 | error ("missing REG_EH_REGION note in the end of bb %i", bb->index); |
3dec4024 JH |
2135 | err = 1; |
2136 | } | |
1d65f45c RH |
2137 | if (n_eh > 1) |
2138 | { | |
2139 | error ("too many eh edges %i", bb->index); | |
2140 | err = 1; | |
2141 | } | |
3dec4024 | 2142 | if (n_branch |
4b4bf941 | 2143 | && (!JUMP_P (BB_END (bb)) |
a813c111 SB |
2144 | || (n_branch > 1 && (any_uncondjump_p (BB_END (bb)) |
2145 | || any_condjump_p (BB_END (bb)))))) | |
3dec4024 | 2146 | { |
ab532386 | 2147 | error ("too many outgoing branch edges from bb %i", bb->index); |
3dec4024 JH |
2148 | err = 1; |
2149 | } | |
a813c111 | 2150 | if (n_fallthru && any_uncondjump_p (BB_END (bb))) |
3dec4024 | 2151 | { |
ab532386 | 2152 | error ("fallthru edge after unconditional jump %i", bb->index); |
3dec4024 JH |
2153 | err = 1; |
2154 | } | |
a813c111 | 2155 | if (n_branch != 1 && any_uncondjump_p (BB_END (bb))) |
3dec4024 | 2156 | { |
1d65f45c RH |
2157 | error ("wrong number of branch edges after unconditional jump %i", |
2158 | bb->index); | |
3dec4024 JH |
2159 | err = 1; |
2160 | } | |
a813c111 | 2161 | if (n_branch != 1 && any_condjump_p (BB_END (bb)) |
c11fd0b2 | 2162 | && JUMP_LABEL (BB_END (bb)) != BB_HEAD (fallthru->dest)) |
3dec4024 | 2163 | { |
c11fd0b2 RG |
2164 | error ("wrong amount of branch edges after conditional jump %i", |
2165 | bb->index); | |
3dec4024 JH |
2166 | err = 1; |
2167 | } | |
4b4bf941 | 2168 | if (n_call && !CALL_P (BB_END (bb))) |
3dec4024 | 2169 | { |
ab532386 | 2170 | error ("call edges for non-call insn in bb %i", bb->index); |
3dec4024 JH |
2171 | err = 1; |
2172 | } | |
2173 | if (n_abnormal | |
4b4bf941 JQ |
2174 | && (!CALL_P (BB_END (bb)) && n_call != n_abnormal) |
2175 | && (!JUMP_P (BB_END (bb)) | |
a813c111 SB |
2176 | || any_condjump_p (BB_END (bb)) |
2177 | || any_uncondjump_p (BB_END (bb)))) | |
3dec4024 | 2178 | { |
ab532386 | 2179 | error ("abnormal edges for no purpose in bb %i", bb->index); |
3dec4024 JH |
2180 | err = 1; |
2181 | } | |
f87c27b4 | 2182 | |
a813c111 | 2183 | for (x = BB_HEAD (bb); x != NEXT_INSN (BB_END (bb)); x = NEXT_INSN (x)) |
0ca541aa | 2184 | /* We may have a barrier inside a basic block before dead code |
9524880c HPN |
2185 | elimination. There is no BLOCK_FOR_INSN field in a barrier. */ |
2186 | if (!BARRIER_P (x) && BLOCK_FOR_INSN (x) != bb) | |
5f0d2358 RK |
2187 | { |
2188 | debug_rtx (x); | |
2189 | if (! BLOCK_FOR_INSN (x)) | |
2190 | error | |
2191 | ("insn %d inside basic block %d but block_for_insn is NULL", | |
0b17ab2f | 2192 | INSN_UID (x), bb->index); |
5f0d2358 RK |
2193 | else |
2194 | error | |
2195 | ("insn %d inside basic block %d but block_for_insn is %i", | |
0b17ab2f | 2196 | INSN_UID (x), bb->index, BLOCK_FOR_INSN (x)->index); |
5f0d2358 RK |
2197 | |
2198 | err = 1; | |
2199 | } | |
ca6c03ca JH |
2200 | |
2201 | /* OK pointers are correct. Now check the header of basic | |
c22cacf3 | 2202 | block. It ought to contain optional CODE_LABEL followed |
ca6c03ca | 2203 | by NOTE_BASIC_BLOCK. */ |
a813c111 | 2204 | x = BB_HEAD (bb); |
4b4bf941 | 2205 | if (LABEL_P (x)) |
ca6c03ca | 2206 | { |
a813c111 | 2207 | if (BB_END (bb) == x) |
ca6c03ca JH |
2208 | { |
2209 | error ("NOTE_INSN_BASIC_BLOCK is missing for block %d", | |
0b17ab2f | 2210 | bb->index); |
ca6c03ca JH |
2211 | err = 1; |
2212 | } | |
5f0d2358 | 2213 | |
ca6c03ca JH |
2214 | x = NEXT_INSN (x); |
2215 | } | |
5f0d2358 | 2216 | |
ca6c03ca JH |
2217 | if (!NOTE_INSN_BASIC_BLOCK_P (x) || NOTE_BASIC_BLOCK (x) != bb) |
2218 | { | |
2219 | error ("NOTE_INSN_BASIC_BLOCK is missing for block %d", | |
0b17ab2f | 2220 | bb->index); |
ca6c03ca JH |
2221 | err = 1; |
2222 | } | |
2223 | ||
a813c111 | 2224 | if (BB_END (bb) == x) |
49243025 | 2225 | /* Do checks for empty blocks here. */ |
5f0d2358 | 2226 | ; |
ca6c03ca | 2227 | else |
5f0d2358 RK |
2228 | for (x = NEXT_INSN (x); x; x = NEXT_INSN (x)) |
2229 | { | |
2230 | if (NOTE_INSN_BASIC_BLOCK_P (x)) | |
2231 | { | |
2232 | error ("NOTE_INSN_BASIC_BLOCK %d in middle of basic block %d", | |
0b17ab2f | 2233 | INSN_UID (x), bb->index); |
5f0d2358 RK |
2234 | err = 1; |
2235 | } | |
2236 | ||
a813c111 | 2237 | if (x == BB_END (bb)) |
5f0d2358 | 2238 | break; |
ca6c03ca | 2239 | |
83fd323c | 2240 | if (control_flow_insn_p (x)) |
5f0d2358 | 2241 | { |
0b17ab2f | 2242 | error ("in basic block %d:", bb->index); |
5f0d2358 RK |
2243 | fatal_insn ("flow control insn inside a basic block", x); |
2244 | } | |
2245 | } | |
ca6c03ca JH |
2246 | } |
2247 | ||
10e9fecc | 2248 | /* Clean up. */ |
10e9fecc JH |
2249 | return err; |
2250 | } | |
5f0d2358 | 2251 | |
10e9fecc JH |
2252 | /* Verify the CFG and RTL consistency common for both underlying RTL and |
2253 | cfglayout RTL. | |
5f0d2358 | 2254 | |
10e9fecc JH |
2255 | Currently it does following checks: |
2256 | - all checks of rtl_verify_flow_info_1 | |
9eab6785 | 2257 | - test head/end pointers |
10e9fecc JH |
2258 | - check that all insns are in the basic blocks |
2259 | (except the switch handling code, barriers and notes) | |
2260 | - check that all returns are followed by barriers | |
2261 | - check that all fallthru edge points to the adjacent blocks. */ | |
9eab6785 | 2262 | |
10e9fecc | 2263 | static int |
d329e058 | 2264 | rtl_verify_flow_info (void) |
10e9fecc JH |
2265 | { |
2266 | basic_block bb; | |
2267 | int err = rtl_verify_flow_info_1 (); | |
2268 | rtx x; | |
9eab6785 SB |
2269 | rtx last_head = get_last_insn (); |
2270 | basic_block *bb_info; | |
10e9fecc JH |
2271 | int num_bb_notes; |
2272 | const rtx rtx_first = get_insns (); | |
2273 | basic_block last_bb_seen = ENTRY_BLOCK_PTR, curr_bb = NULL; | |
9eab6785 SB |
2274 | const int max_uid = get_max_uid (); |
2275 | ||
2276 | bb_info = XCNEWVEC (basic_block, max_uid); | |
ca6c03ca | 2277 | |
10e9fecc JH |
2278 | FOR_EACH_BB_REVERSE (bb) |
2279 | { | |
2280 | edge e; | |
9eab6785 SB |
2281 | rtx head = BB_HEAD (bb); |
2282 | rtx end = BB_END (bb); | |
628f6a4e | 2283 | |
9eab6785 | 2284 | for (x = last_head; x != NULL_RTX; x = PREV_INSN (x)) |
a7b87f73 ZD |
2285 | { |
2286 | /* Verify the end of the basic block is in the INSN chain. */ | |
2287 | if (x == end) | |
2288 | break; | |
2289 | ||
2290 | /* And that the code outside of basic blocks has NULL bb field. */ | |
2291 | if (!BARRIER_P (x) | |
2292 | && BLOCK_FOR_INSN (x) != NULL) | |
2293 | { | |
2294 | error ("insn %d outside of basic blocks has non-NULL bb field", | |
2295 | INSN_UID (x)); | |
2296 | err = 1; | |
2297 | } | |
2298 | } | |
9eab6785 SB |
2299 | |
2300 | if (!x) | |
2301 | { | |
2302 | error ("end insn %d for block %d not found in the insn stream", | |
2303 | INSN_UID (end), bb->index); | |
2304 | err = 1; | |
2305 | } | |
2306 | ||
2307 | /* Work backwards from the end to the head of the basic block | |
2308 | to verify the head is in the RTL chain. */ | |
2309 | for (; x != NULL_RTX; x = PREV_INSN (x)) | |
a00d11f0 | 2310 | { |
9eab6785 SB |
2311 | /* While walking over the insn chain, verify insns appear |
2312 | in only one basic block. */ | |
2313 | if (bb_info[INSN_UID (x)] != NULL) | |
2314 | { | |
2315 | error ("insn %d is in multiple basic blocks (%d and %d)", | |
2316 | INSN_UID (x), bb->index, bb_info[INSN_UID (x)]->index); | |
2317 | err = 1; | |
2318 | } | |
2319 | ||
2320 | bb_info[INSN_UID (x)] = bb; | |
2321 | ||
2322 | if (x == head) | |
2323 | break; | |
2324 | } | |
2325 | if (!x) | |
2326 | { | |
2327 | error ("head insn %d for block %d not found in the insn stream", | |
2328 | INSN_UID (head), bb->index); | |
a00d11f0 JH |
2329 | err = 1; |
2330 | } | |
2331 | ||
a7b87f73 | 2332 | last_head = PREV_INSN (x); |
9eab6785 | 2333 | |
0fd4b31d | 2334 | e = find_fallthru_edge (bb->succs); |
10e9fecc JH |
2335 | if (!e) |
2336 | { | |
2337 | rtx insn; | |
2338 | ||
2339 | /* Ensure existence of barrier in BB with no fallthru edges. */ | |
468059bc DD |
2340 | for (insn = NEXT_INSN (BB_END (bb)); ; insn = NEXT_INSN (insn)) |
2341 | { | |
2342 | if (!insn || NOTE_INSN_BASIC_BLOCK_P (insn)) | |
10e9fecc JH |
2343 | { |
2344 | error ("missing barrier after block %i", bb->index); | |
2345 | err = 1; | |
2346 | break; | |
2347 | } | |
468059bc DD |
2348 | if (BARRIER_P (insn)) |
2349 | break; | |
2350 | } | |
10e9fecc JH |
2351 | } |
2352 | else if (e->src != ENTRY_BLOCK_PTR | |
2353 | && e->dest != EXIT_BLOCK_PTR) | |
c22cacf3 | 2354 | { |
10e9fecc JH |
2355 | rtx insn; |
2356 | ||
2357 | if (e->src->next_bb != e->dest) | |
2358 | { | |
2359 | error | |
2360 | ("verify_flow_info: Incorrect blocks for fallthru %i->%i", | |
2361 | e->src->index, e->dest->index); | |
2362 | err = 1; | |
2363 | } | |
2364 | else | |
a813c111 | 2365 | for (insn = NEXT_INSN (BB_END (e->src)); insn != BB_HEAD (e->dest); |
10e9fecc | 2366 | insn = NEXT_INSN (insn)) |
6be85b25 | 2367 | if (BARRIER_P (insn) || INSN_P (insn)) |
10e9fecc JH |
2368 | { |
2369 | error ("verify_flow_info: Incorrect fallthru %i->%i", | |
2370 | e->src->index, e->dest->index); | |
2371 | fatal_insn ("wrong insn in the fallthru edge", insn); | |
2372 | err = 1; | |
2373 | } | |
c22cacf3 | 2374 | } |
10e9fecc | 2375 | } |
ca6c03ca | 2376 | |
a7b87f73 ZD |
2377 | for (x = last_head; x != NULL_RTX; x = PREV_INSN (x)) |
2378 | { | |
2379 | /* Check that the code before the first basic block has NULL | |
2380 | bb field. */ | |
2381 | if (!BARRIER_P (x) | |
2382 | && BLOCK_FOR_INSN (x) != NULL) | |
2383 | { | |
2384 | error ("insn %d outside of basic blocks has non-NULL bb field", | |
2385 | INSN_UID (x)); | |
2386 | err = 1; | |
2387 | } | |
2388 | } | |
9eab6785 SB |
2389 | free (bb_info); |
2390 | ||
ca6c03ca | 2391 | num_bb_notes = 0; |
e0082a72 ZD |
2392 | last_bb_seen = ENTRY_BLOCK_PTR; |
2393 | ||
5f0d2358 | 2394 | for (x = rtx_first; x; x = NEXT_INSN (x)) |
ca6c03ca JH |
2395 | { |
2396 | if (NOTE_INSN_BASIC_BLOCK_P (x)) | |
2397 | { | |
bf77398c | 2398 | bb = NOTE_BASIC_BLOCK (x); |
5f0d2358 | 2399 | |
ca6c03ca | 2400 | num_bb_notes++; |
e0082a72 | 2401 | if (bb != last_bb_seen->next_bb) |
10e9fecc | 2402 | internal_error ("basic blocks not laid down consecutively"); |
ca6c03ca | 2403 | |
10e9fecc | 2404 | curr_bb = last_bb_seen = bb; |
ca6c03ca JH |
2405 | } |
2406 | ||
10e9fecc | 2407 | if (!curr_bb) |
ca6c03ca JH |
2408 | { |
2409 | switch (GET_CODE (x)) | |
2410 | { | |
2411 | case BARRIER: | |
2412 | case NOTE: | |
2413 | break; | |
2414 | ||
2415 | case CODE_LABEL: | |
666c27b9 | 2416 | /* An addr_vec is placed outside any basic block. */ |
ca6c03ca | 2417 | if (NEXT_INSN (x) |
481683e1 | 2418 | && JUMP_TABLE_DATA_P (NEXT_INSN (x))) |
5f0d2358 | 2419 | x = NEXT_INSN (x); |
ca6c03ca JH |
2420 | |
2421 | /* But in any case, non-deletable labels can appear anywhere. */ | |
2422 | break; | |
2423 | ||
2424 | default: | |
1f978f5f | 2425 | fatal_insn ("insn outside basic block", x); |
ca6c03ca JH |
2426 | } |
2427 | } | |
2428 | ||
26cae194 | 2429 | if (JUMP_P (x) |
ca6c03ca | 2430 | && returnjump_p (x) && ! condjump_p (x) |
15eb3a2e | 2431 | && ! (next_nonnote_insn (x) && BARRIER_P (next_nonnote_insn (x)))) |
1f978f5f | 2432 | fatal_insn ("return not followed by barrier", x); |
a813c111 | 2433 | if (curr_bb && x == BB_END (curr_bb)) |
10e9fecc | 2434 | curr_bb = NULL; |
ca6c03ca JH |
2435 | } |
2436 | ||
24bd1a0b | 2437 | if (num_bb_notes != n_basic_blocks - NUM_FIXED_BLOCKS) |
ca6c03ca | 2438 | internal_error |
0b17ab2f RH |
2439 | ("number of bb notes in insn chain (%d) != n_basic_blocks (%d)", |
2440 | num_bb_notes, n_basic_blocks); | |
ca6c03ca | 2441 | |
10e9fecc | 2442 | return err; |
ca6c03ca JH |
2443 | } |
2444 | \f | |
eaec9b3d | 2445 | /* Assume that the preceding pass has possibly eliminated jump instructions |
ca6c03ca JH |
2446 | or converted the unconditional jumps. Eliminate the edges from CFG. |
2447 | Return true if any edges are eliminated. */ | |
2448 | ||
2449 | bool | |
d329e058 | 2450 | purge_dead_edges (basic_block bb) |
ca6c03ca | 2451 | { |
628f6a4e | 2452 | edge e; |
a813c111 | 2453 | rtx insn = BB_END (bb), note; |
ca6c03ca | 2454 | bool purged = false; |
628f6a4e BE |
2455 | bool found; |
2456 | edge_iterator ei; | |
ca6c03ca | 2457 | |
b5b8b0ac AO |
2458 | if (DEBUG_INSN_P (insn) && insn != BB_HEAD (bb)) |
2459 | do | |
2460 | insn = PREV_INSN (insn); | |
2461 | while ((DEBUG_INSN_P (insn) || NOTE_P (insn)) && insn != BB_HEAD (bb)); | |
2462 | ||
70da1d03 | 2463 | /* If this instruction cannot trap, remove REG_EH_REGION notes. */ |
4b4bf941 | 2464 | if (NONJUMP_INSN_P (insn) |
70da1d03 JH |
2465 | && (note = find_reg_note (insn, REG_EH_REGION, NULL))) |
2466 | { | |
2467 | rtx eqnote; | |
2468 | ||
2469 | if (! may_trap_p (PATTERN (insn)) | |
2470 | || ((eqnote = find_reg_equal_equiv_note (insn)) | |
2471 | && ! may_trap_p (XEXP (eqnote, 0)))) | |
2472 | remove_note (insn, note); | |
2473 | } | |
2474 | ||
546c093e | 2475 | /* Cleanup abnormal edges caused by exceptions or non-local gotos. */ |
628f6a4e | 2476 | for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) |
546c093e | 2477 | { |
1d65f45c RH |
2478 | bool remove = false; |
2479 | ||
e5f9a909 JW |
2480 | /* There are three types of edges we need to handle correctly here: EH |
2481 | edges, abnormal call EH edges, and abnormal call non-EH edges. The | |
2482 | latter can appear when nonlocal gotos are used. */ | |
1d65f45c | 2483 | if (e->flags & EDGE_ABNORMAL_CALL) |
546c093e | 2484 | { |
1d65f45c RH |
2485 | if (!CALL_P (insn)) |
2486 | remove = true; | |
2487 | else if (can_nonlocal_goto (insn)) | |
2488 | ; | |
2489 | else if ((e->flags & EDGE_EH) && can_throw_internal (insn)) | |
2490 | ; | |
0a35513e AH |
2491 | else if (flag_tm && find_reg_note (insn, REG_TM, NULL)) |
2492 | ; | |
1d65f45c RH |
2493 | else |
2494 | remove = true; | |
546c093e | 2495 | } |
1d65f45c RH |
2496 | else if (e->flags & EDGE_EH) |
2497 | remove = !can_throw_internal (insn); | |
2498 | ||
2499 | if (remove) | |
546c093e | 2500 | { |
1d65f45c RH |
2501 | remove_edge (e); |
2502 | df_set_bb_dirty (bb); | |
2503 | purged = true; | |
546c093e RH |
2504 | } |
2505 | else | |
1d65f45c | 2506 | ei_next (&ei); |
546c093e | 2507 | } |
5f0d2358 | 2508 | |
4b4bf941 | 2509 | if (JUMP_P (insn)) |
ca6c03ca JH |
2510 | { |
2511 | rtx note; | |
2512 | edge b,f; | |
628f6a4e | 2513 | edge_iterator ei; |
5f0d2358 | 2514 | |
ca6c03ca JH |
2515 | /* We do care only about conditional jumps and simplejumps. */ |
2516 | if (!any_condjump_p (insn) | |
2517 | && !returnjump_p (insn) | |
2518 | && !simplejump_p (insn)) | |
c51d95ec | 2519 | return purged; |
5f0d2358 | 2520 | |
5a1a3e5e JH |
2521 | /* Branch probability/prediction notes are defined only for |
2522 | condjumps. We've possibly turned condjump into simplejump. */ | |
2523 | if (simplejump_p (insn)) | |
2524 | { | |
2525 | note = find_reg_note (insn, REG_BR_PROB, NULL); | |
2526 | if (note) | |
2527 | remove_note (insn, note); | |
2528 | while ((note = find_reg_note (insn, REG_BR_PRED, NULL))) | |
2529 | remove_note (insn, note); | |
2530 | } | |
2531 | ||
628f6a4e | 2532 | for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) |
ca6c03ca | 2533 | { |
7fcd7218 JH |
2534 | /* Avoid abnormal flags to leak from computed jumps turned |
2535 | into simplejumps. */ | |
f87c27b4 | 2536 | |
0e1638d4 | 2537 | e->flags &= ~EDGE_ABNORMAL; |
7fcd7218 | 2538 | |
5a566bed MM |
2539 | /* See if this edge is one we should keep. */ |
2540 | if ((e->flags & EDGE_FALLTHRU) && any_condjump_p (insn)) | |
2541 | /* A conditional jump can fall through into the next | |
2542 | block, so we should keep the edge. */ | |
628f6a4e BE |
2543 | { |
2544 | ei_next (&ei); | |
2545 | continue; | |
2546 | } | |
5f0d2358 | 2547 | else if (e->dest != EXIT_BLOCK_PTR |
a813c111 | 2548 | && BB_HEAD (e->dest) == JUMP_LABEL (insn)) |
5a566bed MM |
2549 | /* If the destination block is the target of the jump, |
2550 | keep the edge. */ | |
628f6a4e BE |
2551 | { |
2552 | ei_next (&ei); | |
2553 | continue; | |
2554 | } | |
5a566bed MM |
2555 | else if (e->dest == EXIT_BLOCK_PTR && returnjump_p (insn)) |
2556 | /* If the destination block is the exit block, and this | |
2557 | instruction is a return, then keep the edge. */ | |
628f6a4e BE |
2558 | { |
2559 | ei_next (&ei); | |
2560 | continue; | |
2561 | } | |
5a566bed MM |
2562 | else if ((e->flags & EDGE_EH) && can_throw_internal (insn)) |
2563 | /* Keep the edges that correspond to exceptions thrown by | |
0b75beaa EB |
2564 | this instruction and rematerialize the EDGE_ABNORMAL |
2565 | flag we just cleared above. */ | |
2566 | { | |
2567 | e->flags |= EDGE_ABNORMAL; | |
628f6a4e | 2568 | ei_next (&ei); |
0b75beaa EB |
2569 | continue; |
2570 | } | |
5f0d2358 | 2571 | |
5a566bed | 2572 | /* We do not need this edge. */ |
6fb5fa3c | 2573 | df_set_bb_dirty (bb); |
ca6c03ca JH |
2574 | purged = true; |
2575 | remove_edge (e); | |
2576 | } | |
5f0d2358 | 2577 | |
628f6a4e | 2578 | if (EDGE_COUNT (bb->succs) == 0 || !purged) |
c51d95ec | 2579 | return purged; |
5f0d2358 | 2580 | |
c263766c RH |
2581 | if (dump_file) |
2582 | fprintf (dump_file, "Purged edges from bb %i\n", bb->index); | |
5f0d2358 | 2583 | |
ca6c03ca JH |
2584 | if (!optimize) |
2585 | return purged; | |
2586 | ||
2587 | /* Redistribute probabilities. */ | |
c5cbcccf | 2588 | if (single_succ_p (bb)) |
ca6c03ca | 2589 | { |
c5cbcccf ZD |
2590 | single_succ_edge (bb)->probability = REG_BR_PROB_BASE; |
2591 | single_succ_edge (bb)->count = bb->count; | |
f87c27b4 | 2592 | } |
ca6c03ca JH |
2593 | else |
2594 | { | |
2595 | note = find_reg_note (insn, REG_BR_PROB, NULL); | |
2596 | if (!note) | |
2597 | return purged; | |
5f0d2358 | 2598 | |
ca6c03ca JH |
2599 | b = BRANCH_EDGE (bb); |
2600 | f = FALLTHRU_EDGE (bb); | |
2601 | b->probability = INTVAL (XEXP (note, 0)); | |
2602 | f->probability = REG_BR_PROB_BASE - b->probability; | |
2603 | b->count = bb->count * b->probability / REG_BR_PROB_BASE; | |
2604 | f->count = bb->count * f->probability / REG_BR_PROB_BASE; | |
2605 | } | |
5f0d2358 | 2606 | |
ca6c03ca JH |
2607 | return purged; |
2608 | } | |
4b4bf941 | 2609 | else if (CALL_P (insn) && SIBLING_CALL_P (insn)) |
1722c2c8 RH |
2610 | { |
2611 | /* First, there should not be any EH or ABCALL edges resulting | |
2612 | from non-local gotos and the like. If there were, we shouldn't | |
2613 | have created the sibcall in the first place. Second, there | |
2614 | should of course never have been a fallthru edge. */ | |
c5cbcccf ZD |
2615 | gcc_assert (single_succ_p (bb)); |
2616 | gcc_assert (single_succ_edge (bb)->flags | |
2617 | == (EDGE_SIBCALL | EDGE_ABNORMAL)); | |
1722c2c8 RH |
2618 | |
2619 | return 0; | |
2620 | } | |
ca6c03ca | 2621 | |
ca6c03ca JH |
2622 | /* If we don't see a jump insn, we don't know exactly why the block would |
2623 | have been broken at this point. Look for a simple, non-fallthru edge, | |
2624 | as these are only created by conditional branches. If we find such an | |
2625 | edge we know that there used to be a jump here and can then safely | |
2626 | remove all non-fallthru edges. */ | |
628f6a4e BE |
2627 | found = false; |
2628 | FOR_EACH_EDGE (e, ei, bb->succs) | |
2629 | if (! (e->flags & (EDGE_COMPLEX | EDGE_FALLTHRU))) | |
2630 | { | |
2631 | found = true; | |
2632 | break; | |
2633 | } | |
5f0d2358 | 2634 | |
628f6a4e | 2635 | if (!found) |
ca6c03ca | 2636 | return purged; |
5f0d2358 | 2637 | |
2afa8dce DB |
2638 | /* Remove all but the fake and fallthru edges. The fake edge may be |
2639 | the only successor for this block in the case of noreturn | |
2640 | calls. */ | |
628f6a4e | 2641 | for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) |
ca6c03ca | 2642 | { |
2afa8dce | 2643 | if (!(e->flags & (EDGE_FALLTHRU | EDGE_FAKE))) |
c51d95ec | 2644 | { |
6fb5fa3c | 2645 | df_set_bb_dirty (bb); |
c51d95ec JH |
2646 | remove_edge (e); |
2647 | purged = true; | |
2648 | } | |
628f6a4e BE |
2649 | else |
2650 | ei_next (&ei); | |
ca6c03ca | 2651 | } |
5f0d2358 | 2652 | |
c5cbcccf | 2653 | gcc_assert (single_succ_p (bb)); |
5f0d2358 | 2654 | |
c5cbcccf ZD |
2655 | single_succ_edge (bb)->probability = REG_BR_PROB_BASE; |
2656 | single_succ_edge (bb)->count = bb->count; | |
ca6c03ca | 2657 | |
c263766c RH |
2658 | if (dump_file) |
2659 | fprintf (dump_file, "Purged non-fallthru edges from bb %i\n", | |
0b17ab2f | 2660 | bb->index); |
ca6c03ca JH |
2661 | return purged; |
2662 | } | |
2663 | ||
5f0d2358 RK |
2664 | /* Search all basic blocks for potentially dead edges and purge them. Return |
2665 | true if some edge has been eliminated. */ | |
ca6c03ca JH |
2666 | |
2667 | bool | |
25cd19de | 2668 | purge_all_dead_edges (void) |
ca6c03ca | 2669 | { |
e0082a72 | 2670 | int purged = false; |
e0082a72 | 2671 | basic_block bb; |
473fb060 | 2672 | |
e0082a72 | 2673 | FOR_EACH_BB (bb) |
473fb060 | 2674 | { |
e0082a72 | 2675 | bool purged_here = purge_dead_edges (bb); |
5f0d2358 | 2676 | |
473fb060 | 2677 | purged |= purged_here; |
473fb060 | 2678 | } |
5f0d2358 | 2679 | |
ca6c03ca JH |
2680 | return purged; |
2681 | } | |
9ee634e3 | 2682 | |
ba5e9aca EB |
2683 | /* This is used by a few passes that emit some instructions after abnormal |
2684 | calls, moving the basic block's end, while they in fact do want to emit | |
2685 | them on the fallthru edge. Look for abnormal call edges, find backward | |
2686 | the call in the block and insert the instructions on the edge instead. | |
2687 | ||
2688 | Similarly, handle instructions throwing exceptions internally. | |
2689 | ||
2690 | Return true when instructions have been found and inserted on edges. */ | |
2691 | ||
2692 | bool | |
2693 | fixup_abnormal_edges (void) | |
2694 | { | |
2695 | bool inserted = false; | |
2696 | basic_block bb; | |
2697 | ||
2698 | FOR_EACH_BB (bb) | |
2699 | { | |
2700 | edge e; | |
2701 | edge_iterator ei; | |
2702 | ||
2703 | /* Look for cases we are interested in - calls or instructions causing | |
2704 | exceptions. */ | |
2705 | FOR_EACH_EDGE (e, ei, bb->succs) | |
2706 | if ((e->flags & EDGE_ABNORMAL_CALL) | |
2707 | || ((e->flags & (EDGE_ABNORMAL | EDGE_EH)) | |
2708 | == (EDGE_ABNORMAL | EDGE_EH))) | |
2709 | break; | |
2710 | ||
2711 | if (e && !CALL_P (BB_END (bb)) && !can_throw_internal (BB_END (bb))) | |
2712 | { | |
2713 | rtx insn; | |
2714 | ||
2715 | /* Get past the new insns generated. Allow notes, as the insns | |
2716 | may be already deleted. */ | |
2717 | insn = BB_END (bb); | |
2718 | while ((NONJUMP_INSN_P (insn) || NOTE_P (insn)) | |
2719 | && !can_throw_internal (insn) | |
2720 | && insn != BB_HEAD (bb)) | |
2721 | insn = PREV_INSN (insn); | |
2722 | ||
2723 | if (CALL_P (insn) || can_throw_internal (insn)) | |
2724 | { | |
2725 | rtx stop, next; | |
2726 | ||
2727 | e = find_fallthru_edge (bb->succs); | |
2728 | ||
2729 | stop = NEXT_INSN (BB_END (bb)); | |
2730 | BB_END (bb) = insn; | |
2731 | ||
2732 | for (insn = NEXT_INSN (insn); insn != stop; insn = next) | |
2733 | { | |
2734 | next = NEXT_INSN (insn); | |
2735 | if (INSN_P (insn)) | |
2736 | { | |
2737 | delete_insn (insn); | |
2738 | ||
2739 | /* Sometimes there's still the return value USE. | |
2740 | If it's placed after a trapping call (i.e. that | |
2741 | call is the last insn anyway), we have no fallthru | |
2742 | edge. Simply delete this use and don't try to insert | |
2743 | on the non-existent edge. */ | |
2744 | if (GET_CODE (PATTERN (insn)) != USE) | |
2745 | { | |
2746 | /* We're not deleting it, we're moving it. */ | |
2747 | INSN_DELETED_P (insn) = 0; | |
2748 | PREV_INSN (insn) = NULL_RTX; | |
2749 | NEXT_INSN (insn) = NULL_RTX; | |
2750 | ||
2751 | insert_insn_on_edge (insn, e); | |
2752 | inserted = true; | |
2753 | } | |
2754 | } | |
2755 | else if (!BARRIER_P (insn)) | |
2756 | set_block_for_insn (insn, NULL); | |
2757 | } | |
2758 | } | |
2759 | ||
2760 | /* It may be that we don't find any trapping insn. In this | |
2761 | case we discovered quite late that the insn that had been | |
2762 | marked as can_throw_internal in fact couldn't trap at all. | |
2763 | So we should in fact delete the EH edges out of the block. */ | |
2764 | else | |
2765 | purge_dead_edges (bb); | |
2766 | } | |
2767 | } | |
2768 | ||
2769 | return inserted; | |
2770 | } | |
78bde837 SB |
2771 | \f |
2772 | /* Cut the insns from FIRST to LAST out of the insns stream. */ | |
2773 | ||
2774 | rtx | |
2775 | unlink_insn_chain (rtx first, rtx last) | |
2776 | { | |
2777 | rtx prevfirst = PREV_INSN (first); | |
2778 | rtx nextlast = NEXT_INSN (last); | |
2779 | ||
2780 | PREV_INSN (first) = NULL; | |
2781 | NEXT_INSN (last) = NULL; | |
2782 | if (prevfirst) | |
2783 | NEXT_INSN (prevfirst) = nextlast; | |
2784 | if (nextlast) | |
2785 | PREV_INSN (nextlast) = prevfirst; | |
2786 | else | |
2787 | set_last_insn (prevfirst); | |
2788 | if (!prevfirst) | |
2789 | set_first_insn (nextlast); | |
2790 | return first; | |
2791 | } | |
2792 | \f | |
2793 | /* Skip over inter-block insns occurring after BB which are typically | |
2794 | associated with BB (e.g., barriers). If there are any such insns, | |
2795 | we return the last one. Otherwise, we return the end of BB. */ | |
2796 | ||
2797 | static rtx | |
2798 | skip_insns_after_block (basic_block bb) | |
2799 | { | |
2800 | rtx insn, last_insn, next_head, prev; | |
2801 | ||
2802 | next_head = NULL_RTX; | |
2803 | if (bb->next_bb != EXIT_BLOCK_PTR) | |
2804 | next_head = BB_HEAD (bb->next_bb); | |
2805 | ||
2806 | for (last_insn = insn = BB_END (bb); (insn = NEXT_INSN (insn)) != 0; ) | |
2807 | { | |
2808 | if (insn == next_head) | |
2809 | break; | |
2810 | ||
2811 | switch (GET_CODE (insn)) | |
2812 | { | |
2813 | case BARRIER: | |
2814 | last_insn = insn; | |
2815 | continue; | |
2816 | ||
2817 | case NOTE: | |
2818 | switch (NOTE_KIND (insn)) | |
2819 | { | |
2820 | case NOTE_INSN_BLOCK_END: | |
2821 | gcc_unreachable (); | |
2822 | continue; | |
2823 | default: | |
2824 | continue; | |
2825 | break; | |
2826 | } | |
2827 | break; | |
2828 | ||
2829 | case CODE_LABEL: | |
2830 | if (NEXT_INSN (insn) | |
2831 | && JUMP_TABLE_DATA_P (NEXT_INSN (insn))) | |
2832 | { | |
2833 | insn = NEXT_INSN (insn); | |
2834 | last_insn = insn; | |
2835 | continue; | |
2836 | } | |
2837 | break; | |
2838 | ||
2839 | default: | |
2840 | break; | |
2841 | } | |
2842 | ||
2843 | break; | |
2844 | } | |
2845 | ||
2846 | /* It is possible to hit contradictory sequence. For instance: | |
2847 | ||
2848 | jump_insn | |
2849 | NOTE_INSN_BLOCK_BEG | |
2850 | barrier | |
2851 | ||
2852 | Where barrier belongs to jump_insn, but the note does not. This can be | |
2853 | created by removing the basic block originally following | |
2854 | NOTE_INSN_BLOCK_BEG. In such case reorder the notes. */ | |
2855 | ||
2856 | for (insn = last_insn; insn != BB_END (bb); insn = prev) | |
2857 | { | |
2858 | prev = PREV_INSN (insn); | |
2859 | if (NOTE_P (insn)) | |
2860 | switch (NOTE_KIND (insn)) | |
2861 | { | |
2862 | case NOTE_INSN_BLOCK_END: | |
2863 | gcc_unreachable (); | |
2864 | break; | |
2865 | case NOTE_INSN_DELETED: | |
2866 | case NOTE_INSN_DELETED_LABEL: | |
2867 | case NOTE_INSN_DELETED_DEBUG_LABEL: | |
2868 | continue; | |
2869 | default: | |
2870 | reorder_insns (insn, insn, last_insn); | |
2871 | } | |
2872 | } | |
2873 | ||
2874 | return last_insn; | |
2875 | } | |
2876 | ||
2877 | /* Locate or create a label for a given basic block. */ | |
2878 | ||
2879 | static rtx | |
2880 | label_for_bb (basic_block bb) | |
2881 | { | |
2882 | rtx label = BB_HEAD (bb); | |
2883 | ||
2884 | if (!LABEL_P (label)) | |
2885 | { | |
2886 | if (dump_file) | |
2887 | fprintf (dump_file, "Emitting label for block %d\n", bb->index); | |
2888 | ||
2889 | label = block_label (bb); | |
2890 | } | |
2891 | ||
2892 | return label; | |
2893 | } | |
2894 | ||
2895 | /* Locate the effective beginning and end of the insn chain for each | |
2896 | block, as defined by skip_insns_after_block above. */ | |
2897 | ||
2898 | static void | |
2899 | record_effective_endpoints (void) | |
2900 | { | |
2901 | rtx next_insn; | |
2902 | basic_block bb; | |
2903 | rtx insn; | |
2904 | ||
2905 | for (insn = get_insns (); | |
2906 | insn | |
2907 | && NOTE_P (insn) | |
2908 | && NOTE_KIND (insn) != NOTE_INSN_BASIC_BLOCK; | |
2909 | insn = NEXT_INSN (insn)) | |
2910 | continue; | |
2911 | /* No basic blocks at all? */ | |
2912 | gcc_assert (insn); | |
2913 | ||
2914 | if (PREV_INSN (insn)) | |
2915 | cfg_layout_function_header = | |
2916 | unlink_insn_chain (get_insns (), PREV_INSN (insn)); | |
2917 | else | |
2918 | cfg_layout_function_header = NULL_RTX; | |
2919 | ||
2920 | next_insn = get_insns (); | |
2921 | FOR_EACH_BB (bb) | |
2922 | { | |
2923 | rtx end; | |
2924 | ||
2925 | if (PREV_INSN (BB_HEAD (bb)) && next_insn != BB_HEAD (bb)) | |
2926 | BB_HEADER (bb) = unlink_insn_chain (next_insn, | |
2927 | PREV_INSN (BB_HEAD (bb))); | |
2928 | end = skip_insns_after_block (bb); | |
2929 | if (NEXT_INSN (BB_END (bb)) && BB_END (bb) != end) | |
2930 | BB_FOOTER (bb) = unlink_insn_chain (NEXT_INSN (BB_END (bb)), end); | |
2931 | next_insn = NEXT_INSN (BB_END (bb)); | |
2932 | } | |
2933 | ||
2934 | cfg_layout_function_footer = next_insn; | |
2935 | if (cfg_layout_function_footer) | |
2936 | cfg_layout_function_footer = unlink_insn_chain (cfg_layout_function_footer, get_last_insn ()); | |
2937 | } | |
2938 | \f | |
2939 | static unsigned int | |
2940 | into_cfg_layout_mode (void) | |
2941 | { | |
2942 | cfg_layout_initialize (0); | |
2943 | return 0; | |
2944 | } | |
2945 | ||
2946 | static unsigned int | |
2947 | outof_cfg_layout_mode (void) | |
2948 | { | |
2949 | basic_block bb; | |
2950 | ||
2951 | FOR_EACH_BB (bb) | |
2952 | if (bb->next_bb != EXIT_BLOCK_PTR) | |
2953 | bb->aux = bb->next_bb; | |
2954 | ||
2955 | cfg_layout_finalize (); | |
2956 | ||
2957 | return 0; | |
2958 | } | |
2959 | ||
2960 | struct rtl_opt_pass pass_into_cfg_layout_mode = | |
2961 | { | |
2962 | { | |
2963 | RTL_PASS, | |
2964 | "into_cfglayout", /* name */ | |
2965 | NULL, /* gate */ | |
2966 | into_cfg_layout_mode, /* execute */ | |
2967 | NULL, /* sub */ | |
2968 | NULL, /* next */ | |
2969 | 0, /* static_pass_number */ | |
2970 | TV_CFG, /* tv_id */ | |
2971 | 0, /* properties_required */ | |
2972 | PROP_cfglayout, /* properties_provided */ | |
2973 | 0, /* properties_destroyed */ | |
2974 | 0, /* todo_flags_start */ | |
2975 | 0 /* todo_flags_finish */ | |
2976 | } | |
2977 | }; | |
2978 | ||
2979 | struct rtl_opt_pass pass_outof_cfg_layout_mode = | |
2980 | { | |
2981 | { | |
2982 | RTL_PASS, | |
2983 | "outof_cfglayout", /* name */ | |
2984 | NULL, /* gate */ | |
2985 | outof_cfg_layout_mode, /* execute */ | |
2986 | NULL, /* sub */ | |
2987 | NULL, /* next */ | |
2988 | 0, /* static_pass_number */ | |
2989 | TV_CFG, /* tv_id */ | |
2990 | 0, /* properties_required */ | |
2991 | 0, /* properties_provided */ | |
2992 | PROP_cfglayout, /* properties_destroyed */ | |
2993 | 0, /* todo_flags_start */ | |
2994 | 0 /* todo_flags_finish */ | |
2995 | } | |
2996 | }; | |
2997 | \f | |
2998 | ||
2999 | /* Link the basic blocks in the correct order, compacting the basic | |
3000 | block queue while at it. If STAY_IN_CFGLAYOUT_MODE is false, this | |
3001 | function also clears the basic block header and footer fields. | |
3002 | ||
3003 | This function is usually called after a pass (e.g. tracer) finishes | |
3004 | some transformations while in cfglayout mode. The required sequence | |
3005 | of the basic blocks is in a linked list along the bb->aux field. | |
3006 | This functions re-links the basic block prev_bb and next_bb pointers | |
532aafad SB |
3007 | accordingly, and it compacts and renumbers the blocks. |
3008 | ||
3009 | FIXME: This currently works only for RTL, but the only RTL-specific | |
3010 | bits are the STAY_IN_CFGLAYOUT_MODE bits. The tracer pass was moved | |
3011 | to GIMPLE a long time ago, but it doesn't relink the basic block | |
3012 | chain. It could do that (to give better initial RTL) if this function | |
3013 | is made IR-agnostic (and moved to cfganal.c or cfg.c while at it). */ | |
78bde837 SB |
3014 | |
3015 | void | |
3016 | relink_block_chain (bool stay_in_cfglayout_mode) | |
3017 | { | |
3018 | basic_block bb, prev_bb; | |
3019 | int index; | |
3020 | ||
3021 | /* Maybe dump the re-ordered sequence. */ | |
3022 | if (dump_file) | |
3023 | { | |
3024 | fprintf (dump_file, "Reordered sequence:\n"); | |
3025 | for (bb = ENTRY_BLOCK_PTR->next_bb, index = NUM_FIXED_BLOCKS; | |
3026 | bb; | |
3027 | bb = (basic_block) bb->aux, index++) | |
3028 | { | |
3029 | fprintf (dump_file, " %i ", index); | |
3030 | if (get_bb_original (bb)) | |
3031 | fprintf (dump_file, "duplicate of %i ", | |
3032 | get_bb_original (bb)->index); | |
3033 | else if (forwarder_block_p (bb) | |
3034 | && !LABEL_P (BB_HEAD (bb))) | |
3035 | fprintf (dump_file, "compensation "); | |
3036 | else | |
3037 | fprintf (dump_file, "bb %i ", bb->index); | |
3038 | fprintf (dump_file, " [%i]\n", bb->frequency); | |
3039 | } | |
3040 | } | |
3041 | ||
3042 | /* Now reorder the blocks. */ | |
3043 | prev_bb = ENTRY_BLOCK_PTR; | |
3044 | bb = ENTRY_BLOCK_PTR->next_bb; | |
3045 | for (; bb; prev_bb = bb, bb = (basic_block) bb->aux) | |
3046 | { | |
3047 | bb->prev_bb = prev_bb; | |
3048 | prev_bb->next_bb = bb; | |
3049 | } | |
3050 | prev_bb->next_bb = EXIT_BLOCK_PTR; | |
3051 | EXIT_BLOCK_PTR->prev_bb = prev_bb; | |
3052 | ||
3053 | /* Then, clean up the aux fields. */ | |
3054 | FOR_ALL_BB (bb) | |
3055 | { | |
3056 | bb->aux = NULL; | |
3057 | if (!stay_in_cfglayout_mode) | |
3058 | BB_HEADER (bb) = BB_FOOTER (bb) = NULL; | |
3059 | } | |
3060 | ||
3061 | /* Maybe reset the original copy tables, they are not valid anymore | |
3062 | when we renumber the basic blocks in compact_blocks. If we are | |
3063 | are going out of cfglayout mode, don't re-allocate the tables. */ | |
3064 | free_original_copy_tables (); | |
3065 | if (stay_in_cfglayout_mode) | |
3066 | initialize_original_copy_tables (); | |
3067 | ||
3068 | /* Finally, put basic_block_info in the new order. */ | |
3069 | compact_blocks (); | |
3070 | } | |
3071 | \f | |
3072 | ||
3073 | /* Given a reorder chain, rearrange the code to match. */ | |
3074 | ||
3075 | static void | |
3076 | fixup_reorder_chain (void) | |
3077 | { | |
3078 | basic_block bb; | |
3079 | rtx insn = NULL; | |
3080 | ||
3081 | if (cfg_layout_function_header) | |
3082 | { | |
3083 | set_first_insn (cfg_layout_function_header); | |
3084 | insn = cfg_layout_function_header; | |
3085 | while (NEXT_INSN (insn)) | |
3086 | insn = NEXT_INSN (insn); | |
3087 | } | |
3088 | ||
3089 | /* First do the bulk reordering -- rechain the blocks without regard to | |
3090 | the needed changes to jumps and labels. */ | |
3091 | ||
3092 | for (bb = ENTRY_BLOCK_PTR->next_bb; bb; bb = (basic_block) bb->aux) | |
3093 | { | |
3094 | if (BB_HEADER (bb)) | |
3095 | { | |
3096 | if (insn) | |
3097 | NEXT_INSN (insn) = BB_HEADER (bb); | |
3098 | else | |
3099 | set_first_insn (BB_HEADER (bb)); | |
3100 | PREV_INSN (BB_HEADER (bb)) = insn; | |
3101 | insn = BB_HEADER (bb); | |
3102 | while (NEXT_INSN (insn)) | |
3103 | insn = NEXT_INSN (insn); | |
3104 | } | |
3105 | if (insn) | |
3106 | NEXT_INSN (insn) = BB_HEAD (bb); | |
3107 | else | |
3108 | set_first_insn (BB_HEAD (bb)); | |
3109 | PREV_INSN (BB_HEAD (bb)) = insn; | |
3110 | insn = BB_END (bb); | |
3111 | if (BB_FOOTER (bb)) | |
3112 | { | |
3113 | NEXT_INSN (insn) = BB_FOOTER (bb); | |
3114 | PREV_INSN (BB_FOOTER (bb)) = insn; | |
3115 | while (NEXT_INSN (insn)) | |
3116 | insn = NEXT_INSN (insn); | |
3117 | } | |
3118 | } | |
3119 | ||
3120 | NEXT_INSN (insn) = cfg_layout_function_footer; | |
3121 | if (cfg_layout_function_footer) | |
3122 | PREV_INSN (cfg_layout_function_footer) = insn; | |
3123 | ||
3124 | while (NEXT_INSN (insn)) | |
3125 | insn = NEXT_INSN (insn); | |
3126 | ||
3127 | set_last_insn (insn); | |
3128 | #ifdef ENABLE_CHECKING | |
3129 | verify_insn_chain (); | |
3130 | #endif | |
3131 | ||
3132 | /* Now add jumps and labels as needed to match the blocks new | |
3133 | outgoing edges. */ | |
3134 | ||
3135 | for (bb = ENTRY_BLOCK_PTR->next_bb; bb ; bb = (basic_block) bb->aux) | |
3136 | { | |
3137 | edge e_fall, e_taken, e; | |
3138 | rtx bb_end_insn; | |
3139 | rtx ret_label = NULL_RTX; | |
3140 | basic_block nb, src_bb; | |
3141 | edge_iterator ei; | |
3142 | ||
3143 | if (EDGE_COUNT (bb->succs) == 0) | |
3144 | continue; | |
3145 | ||
3146 | /* Find the old fallthru edge, and another non-EH edge for | |
3147 | a taken jump. */ | |
3148 | e_taken = e_fall = NULL; | |
3149 | ||
3150 | FOR_EACH_EDGE (e, ei, bb->succs) | |
3151 | if (e->flags & EDGE_FALLTHRU) | |
3152 | e_fall = e; | |
3153 | else if (! (e->flags & EDGE_EH)) | |
3154 | e_taken = e; | |
3155 | ||
3156 | bb_end_insn = BB_END (bb); | |
3157 | if (JUMP_P (bb_end_insn)) | |
3158 | { | |
3159 | ret_label = JUMP_LABEL (bb_end_insn); | |
3160 | if (any_condjump_p (bb_end_insn)) | |
3161 | { | |
3162 | /* This might happen if the conditional jump has side | |
3163 | effects and could therefore not be optimized away. | |
3164 | Make the basic block to end with a barrier in order | |
3165 | to prevent rtl_verify_flow_info from complaining. */ | |
3166 | if (!e_fall) | |
3167 | { | |
3168 | gcc_assert (!onlyjump_p (bb_end_insn) | |
3169 | || returnjump_p (bb_end_insn)); | |
3170 | BB_FOOTER (bb) = emit_barrier_after (bb_end_insn); | |
3171 | continue; | |
3172 | } | |
3173 | ||
3174 | /* If the old fallthru is still next, nothing to do. */ | |
3175 | if (bb->aux == e_fall->dest | |
3176 | || e_fall->dest == EXIT_BLOCK_PTR) | |
3177 | continue; | |
3178 | ||
3179 | /* The degenerated case of conditional jump jumping to the next | |
3180 | instruction can happen for jumps with side effects. We need | |
3181 | to construct a forwarder block and this will be done just | |
3182 | fine by force_nonfallthru below. */ | |
3183 | if (!e_taken) | |
3184 | ; | |
3185 | ||
3186 | /* There is another special case: if *neither* block is next, | |
3187 | such as happens at the very end of a function, then we'll | |
3188 | need to add a new unconditional jump. Choose the taken | |
3189 | edge based on known or assumed probability. */ | |
3190 | else if (bb->aux != e_taken->dest) | |
3191 | { | |
3192 | rtx note = find_reg_note (bb_end_insn, REG_BR_PROB, 0); | |
3193 | ||
3194 | if (note | |
3195 | && INTVAL (XEXP (note, 0)) < REG_BR_PROB_BASE / 2 | |
3196 | && invert_jump (bb_end_insn, | |
3197 | (e_fall->dest == EXIT_BLOCK_PTR | |
3198 | ? NULL_RTX | |
3199 | : label_for_bb (e_fall->dest)), 0)) | |
3200 | { | |
3201 | e_fall->flags &= ~EDGE_FALLTHRU; | |
3202 | gcc_checking_assert (could_fall_through | |
3203 | (e_taken->src, e_taken->dest)); | |
3204 | e_taken->flags |= EDGE_FALLTHRU; | |
3205 | update_br_prob_note (bb); | |
3206 | e = e_fall, e_fall = e_taken, e_taken = e; | |
3207 | } | |
3208 | } | |
3209 | ||
3210 | /* If the "jumping" edge is a crossing edge, and the fall | |
3211 | through edge is non-crossing, leave things as they are. */ | |
3212 | else if ((e_taken->flags & EDGE_CROSSING) | |
3213 | && !(e_fall->flags & EDGE_CROSSING)) | |
3214 | continue; | |
3215 | ||
3216 | /* Otherwise we can try to invert the jump. This will | |
3217 | basically never fail, however, keep up the pretense. */ | |
3218 | else if (invert_jump (bb_end_insn, | |
3219 | (e_fall->dest == EXIT_BLOCK_PTR | |
3220 | ? NULL_RTX | |
3221 | : label_for_bb (e_fall->dest)), 0)) | |
3222 | { | |
3223 | e_fall->flags &= ~EDGE_FALLTHRU; | |
3224 | gcc_checking_assert (could_fall_through | |
3225 | (e_taken->src, e_taken->dest)); | |
3226 | e_taken->flags |= EDGE_FALLTHRU; | |
3227 | update_br_prob_note (bb); | |
3228 | if (LABEL_NUSES (ret_label) == 0 | |
3229 | && single_pred_p (e_taken->dest)) | |
3230 | delete_insn (ret_label); | |
3231 | continue; | |
3232 | } | |
3233 | } | |
3234 | else if (extract_asm_operands (PATTERN (bb_end_insn)) != NULL) | |
3235 | { | |
3236 | /* If the old fallthru is still next or if | |
3237 | asm goto doesn't have a fallthru (e.g. when followed by | |
3238 | __builtin_unreachable ()), nothing to do. */ | |
3239 | if (! e_fall | |
3240 | || bb->aux == e_fall->dest | |
3241 | || e_fall->dest == EXIT_BLOCK_PTR) | |
3242 | continue; | |
3243 | ||
3244 | /* Otherwise we'll have to use the fallthru fixup below. */ | |
3245 | } | |
3246 | else | |
3247 | { | |
3248 | /* Otherwise we have some return, switch or computed | |
3249 | jump. In the 99% case, there should not have been a | |
3250 | fallthru edge. */ | |
3251 | gcc_assert (returnjump_p (bb_end_insn) || !e_fall); | |
3252 | continue; | |
3253 | } | |
3254 | } | |
3255 | else | |
3256 | { | |
3257 | /* No fallthru implies a noreturn function with EH edges, or | |
3258 | something similarly bizarre. In any case, we don't need to | |
3259 | do anything. */ | |
3260 | if (! e_fall) | |
3261 | continue; | |
3262 | ||
3263 | /* If the fallthru block is still next, nothing to do. */ | |
3264 | if (bb->aux == e_fall->dest) | |
3265 | continue; | |
3266 | ||
3267 | /* A fallthru to exit block. */ | |
3268 | if (e_fall->dest == EXIT_BLOCK_PTR) | |
3269 | continue; | |
3270 | } | |
3271 | ||
3272 | /* We got here if we need to add a new jump insn. | |
3273 | Note force_nonfallthru can delete E_FALL and thus we have to | |
3274 | save E_FALL->src prior to the call to force_nonfallthru. */ | |
3275 | src_bb = e_fall->src; | |
3276 | nb = force_nonfallthru_and_redirect (e_fall, e_fall->dest, ret_label); | |
3277 | if (nb) | |
3278 | { | |
3279 | nb->aux = bb->aux; | |
3280 | bb->aux = nb; | |
3281 | /* Don't process this new block. */ | |
3282 | bb = nb; | |
3283 | ||
3284 | /* Make sure new bb is tagged for correct section (same as | |
3285 | fall-thru source, since you cannot fall-thru across | |
3286 | section boundaries). */ | |
3287 | BB_COPY_PARTITION (src_bb, single_pred (bb)); | |
3288 | if (flag_reorder_blocks_and_partition | |
3289 | && targetm_common.have_named_sections | |
3290 | && JUMP_P (BB_END (bb)) | |
3291 | && !any_condjump_p (BB_END (bb)) | |
3292 | && (EDGE_SUCC (bb, 0)->flags & EDGE_CROSSING)) | |
3293 | add_reg_note (BB_END (bb), REG_CROSSING_JUMP, NULL_RTX); | |
3294 | } | |
3295 | } | |
3296 | ||
3297 | relink_block_chain (/*stay_in_cfglayout_mode=*/false); | |
3298 | ||
3299 | /* Annoying special case - jump around dead jumptables left in the code. */ | |
3300 | FOR_EACH_BB (bb) | |
3301 | { | |
3302 | edge e = find_fallthru_edge (bb->succs); | |
3303 | ||
3304 | if (e && !can_fallthru (e->src, e->dest)) | |
3305 | force_nonfallthru (e); | |
3306 | } | |
3307 | ||
3308 | /* Ensure goto_locus from edges has some instructions with that locus | |
3309 | in RTL. */ | |
3310 | if (!optimize) | |
3311 | FOR_EACH_BB (bb) | |
3312 | { | |
3313 | edge e; | |
3314 | edge_iterator ei; | |
3315 | ||
3316 | FOR_EACH_EDGE (e, ei, bb->succs) | |
3317 | if (e->goto_locus && !(e->flags & EDGE_ABNORMAL)) | |
3318 | { | |
3319 | edge e2; | |
3320 | edge_iterator ei2; | |
3321 | basic_block dest, nb; | |
3322 | rtx end; | |
3323 | ||
3324 | insn = BB_END (e->src); | |
3325 | end = PREV_INSN (BB_HEAD (e->src)); | |
3326 | while (insn != end | |
3327 | && (!NONDEBUG_INSN_P (insn) || INSN_LOCATOR (insn) == 0)) | |
3328 | insn = PREV_INSN (insn); | |
3329 | if (insn != end | |
3330 | && locator_eq (INSN_LOCATOR (insn), (int) e->goto_locus)) | |
3331 | continue; | |
3332 | if (simplejump_p (BB_END (e->src)) | |
3333 | && INSN_LOCATOR (BB_END (e->src)) == 0) | |
3334 | { | |
3335 | INSN_LOCATOR (BB_END (e->src)) = e->goto_locus; | |
3336 | continue; | |
3337 | } | |
3338 | dest = e->dest; | |
3339 | if (dest == EXIT_BLOCK_PTR) | |
3340 | { | |
3341 | /* Non-fallthru edges to the exit block cannot be split. */ | |
3342 | if (!(e->flags & EDGE_FALLTHRU)) | |
3343 | continue; | |
3344 | } | |
3345 | else | |
3346 | { | |
3347 | insn = BB_HEAD (dest); | |
3348 | end = NEXT_INSN (BB_END (dest)); | |
3349 | while (insn != end && !NONDEBUG_INSN_P (insn)) | |
3350 | insn = NEXT_INSN (insn); | |
3351 | if (insn != end && INSN_LOCATOR (insn) | |
3352 | && locator_eq (INSN_LOCATOR (insn), (int) e->goto_locus)) | |
3353 | continue; | |
3354 | } | |
3355 | nb = split_edge (e); | |
3356 | if (!INSN_P (BB_END (nb))) | |
3357 | BB_END (nb) = emit_insn_after_noloc (gen_nop (), BB_END (nb), | |
3358 | nb); | |
3359 | INSN_LOCATOR (BB_END (nb)) = e->goto_locus; | |
3360 | ||
3361 | /* If there are other incoming edges to the destination block | |
3362 | with the same goto locus, redirect them to the new block as | |
3363 | well, this can prevent other such blocks from being created | |
3364 | in subsequent iterations of the loop. */ | |
3365 | for (ei2 = ei_start (dest->preds); (e2 = ei_safe_edge (ei2)); ) | |
3366 | if (e2->goto_locus | |
3367 | && !(e2->flags & (EDGE_ABNORMAL | EDGE_FALLTHRU)) | |
3368 | && locator_eq (e->goto_locus, e2->goto_locus)) | |
3369 | redirect_edge_and_branch (e2, nb); | |
3370 | else | |
3371 | ei_next (&ei2); | |
3372 | } | |
3373 | } | |
3374 | } | |
3375 | \f | |
3376 | /* Perform sanity checks on the insn chain. | |
3377 | 1. Check that next/prev pointers are consistent in both the forward and | |
3378 | reverse direction. | |
3379 | 2. Count insns in chain, going both directions, and check if equal. | |
3380 | 3. Check that get_last_insn () returns the actual end of chain. */ | |
3381 | ||
3382 | DEBUG_FUNCTION void | |
3383 | verify_insn_chain (void) | |
3384 | { | |
3385 | rtx x, prevx, nextx; | |
3386 | int insn_cnt1, insn_cnt2; | |
3387 | ||
3388 | for (prevx = NULL, insn_cnt1 = 1, x = get_insns (); | |
3389 | x != 0; | |
3390 | prevx = x, insn_cnt1++, x = NEXT_INSN (x)) | |
3391 | gcc_assert (PREV_INSN (x) == prevx); | |
3392 | ||
3393 | gcc_assert (prevx == get_last_insn ()); | |
3394 | ||
3395 | for (nextx = NULL, insn_cnt2 = 1, x = get_last_insn (); | |
3396 | x != 0; | |
3397 | nextx = x, insn_cnt2++, x = PREV_INSN (x)) | |
3398 | gcc_assert (NEXT_INSN (x) == nextx); | |
3399 | ||
3400 | gcc_assert (insn_cnt1 == insn_cnt2); | |
3401 | } | |
3402 | \f | |
3403 | /* If we have assembler epilogues, the block falling through to exit must | |
3404 | be the last one in the reordered chain when we reach final. Ensure | |
3405 | that this condition is met. */ | |
3406 | static void | |
3407 | fixup_fallthru_exit_predecessor (void) | |
3408 | { | |
3409 | edge e; | |
3410 | basic_block bb = NULL; | |
3411 | ||
3412 | /* This transformation is not valid before reload, because we might | |
3413 | separate a call from the instruction that copies the return | |
3414 | value. */ | |
3415 | gcc_assert (reload_completed); | |
3416 | ||
3417 | e = find_fallthru_edge (EXIT_BLOCK_PTR->preds); | |
3418 | if (e) | |
3419 | bb = e->src; | |
3420 | ||
3421 | if (bb && bb->aux) | |
3422 | { | |
3423 | basic_block c = ENTRY_BLOCK_PTR->next_bb; | |
3424 | ||
3425 | /* If the very first block is the one with the fall-through exit | |
3426 | edge, we have to split that block. */ | |
3427 | if (c == bb) | |
3428 | { | |
3429 | bb = split_block (bb, NULL)->dest; | |
3430 | bb->aux = c->aux; | |
3431 | c->aux = bb; | |
3432 | BB_FOOTER (bb) = BB_FOOTER (c); | |
3433 | BB_FOOTER (c) = NULL; | |
3434 | } | |
3435 | ||
3436 | while (c->aux != bb) | |
3437 | c = (basic_block) c->aux; | |
3438 | ||
3439 | c->aux = bb->aux; | |
3440 | while (c->aux) | |
3441 | c = (basic_block) c->aux; | |
3442 | ||
3443 | c->aux = bb; | |
3444 | bb->aux = NULL; | |
3445 | } | |
3446 | } | |
3447 | ||
3448 | /* In case there are more than one fallthru predecessors of exit, force that | |
3449 | there is only one. */ | |
3450 | ||
3451 | static void | |
3452 | force_one_exit_fallthru (void) | |
3453 | { | |
3454 | edge e, predecessor = NULL; | |
3455 | bool more = false; | |
3456 | edge_iterator ei; | |
3457 | basic_block forwarder, bb; | |
3458 | ||
3459 | FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds) | |
3460 | if (e->flags & EDGE_FALLTHRU) | |
3461 | { | |
3462 | if (predecessor == NULL) | |
3463 | predecessor = e; | |
3464 | else | |
3465 | { | |
3466 | more = true; | |
3467 | break; | |
3468 | } | |
3469 | } | |
3470 | ||
3471 | if (!more) | |
3472 | return; | |
3473 | ||
3474 | /* Exit has several fallthru predecessors. Create a forwarder block for | |
3475 | them. */ | |
3476 | forwarder = split_edge (predecessor); | |
3477 | for (ei = ei_start (EXIT_BLOCK_PTR->preds); (e = ei_safe_edge (ei)); ) | |
3478 | { | |
3479 | if (e->src == forwarder | |
3480 | || !(e->flags & EDGE_FALLTHRU)) | |
3481 | ei_next (&ei); | |
3482 | else | |
3483 | redirect_edge_and_branch_force (e, forwarder); | |
3484 | } | |
3485 | ||
3486 | /* Fix up the chain of blocks -- make FORWARDER immediately precede the | |
3487 | exit block. */ | |
3488 | FOR_EACH_BB (bb) | |
3489 | { | |
3490 | if (bb->aux == NULL && bb != forwarder) | |
3491 | { | |
3492 | bb->aux = forwarder; | |
3493 | break; | |
3494 | } | |
3495 | } | |
3496 | } | |
3497 | \f | |
3498 | /* Return true in case it is possible to duplicate the basic block BB. */ | |
3499 | ||
3500 | static bool | |
3501 | cfg_layout_can_duplicate_bb_p (const_basic_block bb) | |
3502 | { | |
3503 | /* Do not attempt to duplicate tablejumps, as we need to unshare | |
3504 | the dispatch table. This is difficult to do, as the instructions | |
3505 | computing jump destination may be hoisted outside the basic block. */ | |
3506 | if (tablejump_p (BB_END (bb), NULL, NULL)) | |
3507 | return false; | |
3508 | ||
3509 | /* Do not duplicate blocks containing insns that can't be copied. */ | |
3510 | if (targetm.cannot_copy_insn_p) | |
3511 | { | |
3512 | rtx insn = BB_HEAD (bb); | |
3513 | while (1) | |
3514 | { | |
3515 | if (INSN_P (insn) && targetm.cannot_copy_insn_p (insn)) | |
3516 | return false; | |
3517 | if (insn == BB_END (bb)) | |
3518 | break; | |
3519 | insn = NEXT_INSN (insn); | |
3520 | } | |
3521 | } | |
3522 | ||
3523 | return true; | |
3524 | } | |
3525 | ||
3526 | rtx | |
3527 | duplicate_insn_chain (rtx from, rtx to) | |
3528 | { | |
3529 | rtx insn, last, copy; | |
3530 | ||
3531 | /* Avoid updating of boundaries of previous basic block. The | |
3532 | note will get removed from insn stream in fixup. */ | |
3533 | last = emit_note (NOTE_INSN_DELETED); | |
3534 | ||
3535 | /* Create copy at the end of INSN chain. The chain will | |
3536 | be reordered later. */ | |
3537 | for (insn = from; insn != NEXT_INSN (to); insn = NEXT_INSN (insn)) | |
3538 | { | |
3539 | switch (GET_CODE (insn)) | |
3540 | { | |
3541 | case DEBUG_INSN: | |
3542 | /* Don't duplicate label debug insns. */ | |
3543 | if (TREE_CODE (INSN_VAR_LOCATION_DECL (insn)) == LABEL_DECL) | |
3544 | break; | |
3545 | /* FALLTHRU */ | |
3546 | case INSN: | |
3547 | case CALL_INSN: | |
3548 | case JUMP_INSN: | |
3549 | /* Avoid copying of dispatch tables. We never duplicate | |
3550 | tablejumps, so this can hit only in case the table got | |
3551 | moved far from original jump. */ | |
3552 | if (GET_CODE (PATTERN (insn)) == ADDR_VEC | |
3553 | || GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC) | |
3554 | { | |
3555 | /* Avoid copying following barrier as well if any | |
3556 | (and debug insns in between). */ | |
3557 | rtx next; | |
3558 | ||
3559 | for (next = NEXT_INSN (insn); | |
3560 | next != NEXT_INSN (to); | |
3561 | next = NEXT_INSN (next)) | |
3562 | if (!DEBUG_INSN_P (next)) | |
3563 | break; | |
3564 | if (next != NEXT_INSN (to) && BARRIER_P (next)) | |
3565 | insn = next; | |
3566 | break; | |
3567 | } | |
3568 | copy = emit_copy_of_insn_after (insn, get_last_insn ()); | |
3569 | if (JUMP_P (insn) && JUMP_LABEL (insn) != NULL_RTX | |
3570 | && ANY_RETURN_P (JUMP_LABEL (insn))) | |
3571 | JUMP_LABEL (copy) = JUMP_LABEL (insn); | |
3572 | maybe_copy_prologue_epilogue_insn (insn, copy); | |
3573 | break; | |
3574 | ||
3575 | case CODE_LABEL: | |
3576 | break; | |
3577 | ||
3578 | case BARRIER: | |
3579 | emit_barrier (); | |
3580 | break; | |
3581 | ||
3582 | case NOTE: | |
3583 | switch (NOTE_KIND (insn)) | |
3584 | { | |
3585 | /* In case prologue is empty and function contain label | |
3586 | in first BB, we may want to copy the block. */ | |
3587 | case NOTE_INSN_PROLOGUE_END: | |
3588 | ||
3589 | case NOTE_INSN_DELETED: | |
3590 | case NOTE_INSN_DELETED_LABEL: | |
3591 | case NOTE_INSN_DELETED_DEBUG_LABEL: | |
3592 | /* No problem to strip these. */ | |
3593 | case NOTE_INSN_FUNCTION_BEG: | |
3594 | /* There is always just single entry to function. */ | |
3595 | case NOTE_INSN_BASIC_BLOCK: | |
3596 | break; | |
3597 | ||
3598 | case NOTE_INSN_EPILOGUE_BEG: | |
3599 | case NOTE_INSN_SWITCH_TEXT_SECTIONS: | |
3600 | emit_note_copy (insn); | |
3601 | break; | |
3602 | ||
3603 | default: | |
3604 | /* All other notes should have already been eliminated. */ | |
3605 | gcc_unreachable (); | |
3606 | } | |
3607 | break; | |
3608 | default: | |
3609 | gcc_unreachable (); | |
3610 | } | |
3611 | } | |
3612 | insn = NEXT_INSN (last); | |
3613 | delete_insn (last); | |
3614 | return insn; | |
3615 | } | |
3616 | ||
3617 | /* Create a duplicate of the basic block BB. */ | |
3618 | ||
3619 | static basic_block | |
3620 | cfg_layout_duplicate_bb (basic_block bb) | |
3621 | { | |
3622 | rtx insn; | |
3623 | basic_block new_bb; | |
3624 | ||
3625 | insn = duplicate_insn_chain (BB_HEAD (bb), BB_END (bb)); | |
3626 | new_bb = create_basic_block (insn, | |
3627 | insn ? get_last_insn () : NULL, | |
3628 | EXIT_BLOCK_PTR->prev_bb); | |
3629 | ||
3630 | BB_COPY_PARTITION (new_bb, bb); | |
3631 | if (BB_HEADER (bb)) | |
3632 | { | |
3633 | insn = BB_HEADER (bb); | |
3634 | while (NEXT_INSN (insn)) | |
3635 | insn = NEXT_INSN (insn); | |
3636 | insn = duplicate_insn_chain (BB_HEADER (bb), insn); | |
3637 | if (insn) | |
3638 | BB_HEADER (new_bb) = unlink_insn_chain (insn, get_last_insn ()); | |
3639 | } | |
3640 | ||
3641 | if (BB_FOOTER (bb)) | |
3642 | { | |
3643 | insn = BB_FOOTER (bb); | |
3644 | while (NEXT_INSN (insn)) | |
3645 | insn = NEXT_INSN (insn); | |
3646 | insn = duplicate_insn_chain (BB_FOOTER (bb), insn); | |
3647 | if (insn) | |
3648 | BB_FOOTER (new_bb) = unlink_insn_chain (insn, get_last_insn ()); | |
3649 | } | |
3650 | ||
3651 | return new_bb; | |
3652 | } | |
3653 | ||
3654 | \f | |
3655 | /* Main entry point to this module - initialize the datastructures for | |
3656 | CFG layout changes. It keeps LOOPS up-to-date if not null. | |
3657 | ||
3658 | FLAGS is a set of additional flags to pass to cleanup_cfg(). */ | |
3659 | ||
3660 | void | |
3661 | cfg_layout_initialize (unsigned int flags) | |
3662 | { | |
3663 | rtx x; | |
3664 | basic_block bb; | |
3665 | ||
3666 | initialize_original_copy_tables (); | |
3667 | ||
3668 | cfg_layout_rtl_register_cfg_hooks (); | |
3669 | ||
3670 | record_effective_endpoints (); | |
3671 | ||
3672 | /* Make sure that the targets of non local gotos are marked. */ | |
3673 | for (x = nonlocal_goto_handler_labels; x; x = XEXP (x, 1)) | |
3674 | { | |
3675 | bb = BLOCK_FOR_INSN (XEXP (x, 0)); | |
3676 | bb->flags |= BB_NON_LOCAL_GOTO_TARGET; | |
3677 | } | |
3678 | ||
3679 | cleanup_cfg (CLEANUP_CFGLAYOUT | flags); | |
3680 | } | |
3681 | ||
3682 | /* Splits superblocks. */ | |
3683 | void | |
3684 | break_superblocks (void) | |
3685 | { | |
3686 | sbitmap superblocks; | |
3687 | bool need = false; | |
3688 | basic_block bb; | |
3689 | ||
3690 | superblocks = sbitmap_alloc (last_basic_block); | |
3691 | sbitmap_zero (superblocks); | |
3692 | ||
3693 | FOR_EACH_BB (bb) | |
3694 | if (bb->flags & BB_SUPERBLOCK) | |
3695 | { | |
3696 | bb->flags &= ~BB_SUPERBLOCK; | |
3697 | SET_BIT (superblocks, bb->index); | |
3698 | need = true; | |
3699 | } | |
3700 | ||
3701 | if (need) | |
3702 | { | |
3703 | rebuild_jump_labels (get_insns ()); | |
3704 | find_many_sub_basic_blocks (superblocks); | |
3705 | } | |
3706 | ||
3707 | free (superblocks); | |
3708 | } | |
3709 | ||
3710 | /* Finalize the changes: reorder insn list according to the sequence specified | |
3711 | by aux pointers, enter compensation code, rebuild scope forest. */ | |
3712 | ||
3713 | void | |
3714 | cfg_layout_finalize (void) | |
3715 | { | |
3716 | #ifdef ENABLE_CHECKING | |
3717 | verify_flow_info (); | |
3718 | #endif | |
3719 | force_one_exit_fallthru (); | |
3720 | rtl_register_cfg_hooks (); | |
3721 | if (reload_completed | |
3722 | #ifdef HAVE_epilogue | |
3723 | && !HAVE_epilogue | |
3724 | #endif | |
3725 | ) | |
3726 | fixup_fallthru_exit_predecessor (); | |
3727 | fixup_reorder_chain (); | |
3728 | ||
3729 | rebuild_jump_labels (get_insns ()); | |
3730 | delete_dead_jumptables (); | |
3731 | ||
3732 | #ifdef ENABLE_CHECKING | |
3733 | verify_insn_chain (); | |
3734 | verify_flow_info (); | |
3735 | #endif | |
3736 | } | |
3737 | ||
ba5e9aca | 3738 | |
9ee634e3 | 3739 | /* Same as split_block but update cfg_layout structures. */ |
f470c378 ZD |
3740 | |
3741 | static basic_block | |
d329e058 | 3742 | cfg_layout_split_block (basic_block bb, void *insnp) |
9ee634e3 | 3743 | { |
ae50c0cb | 3744 | rtx insn = (rtx) insnp; |
f470c378 | 3745 | basic_block new_bb = rtl_split_block (bb, insn); |
9ee634e3 | 3746 | |
bcc708fc MM |
3747 | BB_FOOTER (new_bb) = BB_FOOTER (bb); |
3748 | BB_FOOTER (bb) = NULL; | |
9ee634e3 | 3749 | |
f470c378 | 3750 | return new_bb; |
9ee634e3 JH |
3751 | } |
3752 | ||
9ee634e3 | 3753 | /* Redirect Edge to DEST. */ |
6de9cd9a | 3754 | static edge |
d329e058 | 3755 | cfg_layout_redirect_edge_and_branch (edge e, basic_block dest) |
9ee634e3 JH |
3756 | { |
3757 | basic_block src = e->src; | |
6de9cd9a | 3758 | edge ret; |
9ee634e3 | 3759 | |
bc35512f | 3760 | if (e->flags & (EDGE_ABNORMAL_CALL | EDGE_EH)) |
6de9cd9a | 3761 | return NULL; |
bc35512f | 3762 | |
3348b696 | 3763 | if (e->dest == dest) |
6de9cd9a | 3764 | return e; |
bc35512f | 3765 | |
3348b696 | 3766 | if (e->src != ENTRY_BLOCK_PTR |
6de9cd9a | 3767 | && (ret = try_redirect_by_replacing_jump (e, dest, true))) |
f345f21a | 3768 | { |
6fb5fa3c | 3769 | df_set_bb_dirty (src); |
6de9cd9a | 3770 | return ret; |
f345f21a | 3771 | } |
bc35512f JH |
3772 | |
3773 | if (e->src == ENTRY_BLOCK_PTR | |
3774 | && (e->flags & EDGE_FALLTHRU) && !(e->flags & EDGE_COMPLEX)) | |
3775 | { | |
c263766c RH |
3776 | if (dump_file) |
3777 | fprintf (dump_file, "Redirecting entry edge from bb %i to %i\n", | |
bc35512f JH |
3778 | e->src->index, dest->index); |
3779 | ||
6fb5fa3c | 3780 | df_set_bb_dirty (e->src); |
bc35512f | 3781 | redirect_edge_succ (e, dest); |
6de9cd9a | 3782 | return e; |
bc35512f JH |
3783 | } |
3784 | ||
9ee634e3 JH |
3785 | /* Redirect_edge_and_branch may decide to turn branch into fallthru edge |
3786 | in the case the basic block appears to be in sequence. Avoid this | |
3787 | transformation. */ | |
3788 | ||
9ee634e3 JH |
3789 | if (e->flags & EDGE_FALLTHRU) |
3790 | { | |
3791 | /* Redirect any branch edges unified with the fallthru one. */ | |
4b4bf941 | 3792 | if (JUMP_P (BB_END (src)) |
432f982f JH |
3793 | && label_is_jump_target_p (BB_HEAD (e->dest), |
3794 | BB_END (src))) | |
9ee634e3 | 3795 | { |
341c100f | 3796 | edge redirected; |
c22cacf3 | 3797 | |
c263766c RH |
3798 | if (dump_file) |
3799 | fprintf (dump_file, "Fallthru edge unified with branch " | |
432f982f JH |
3800 | "%i->%i redirected to %i\n", |
3801 | e->src->index, e->dest->index, dest->index); | |
3802 | e->flags &= ~EDGE_FALLTHRU; | |
341c100f NS |
3803 | redirected = redirect_branch_edge (e, dest); |
3804 | gcc_assert (redirected); | |
0c617be4 JL |
3805 | redirected->flags |= EDGE_FALLTHRU; |
3806 | df_set_bb_dirty (redirected->src); | |
3807 | return redirected; | |
9ee634e3 JH |
3808 | } |
3809 | /* In case we are redirecting fallthru edge to the branch edge | |
c22cacf3 | 3810 | of conditional jump, remove it. */ |
628f6a4e | 3811 | if (EDGE_COUNT (src->succs) == 2) |
9ee634e3 | 3812 | { |
03101c6f KH |
3813 | /* Find the edge that is different from E. */ |
3814 | edge s = EDGE_SUCC (src, EDGE_SUCC (src, 0) == e); | |
628f6a4e | 3815 | |
9ee634e3 | 3816 | if (s->dest == dest |
a813c111 SB |
3817 | && any_condjump_p (BB_END (src)) |
3818 | && onlyjump_p (BB_END (src))) | |
3819 | delete_insn (BB_END (src)); | |
9ee634e3 | 3820 | } |
c263766c | 3821 | if (dump_file) |
dc764d10 | 3822 | fprintf (dump_file, "Redirecting fallthru edge %i->%i to %i\n", |
bc35512f | 3823 | e->src->index, e->dest->index, dest->index); |
0c617be4 | 3824 | ret = redirect_edge_succ_nodup (e, dest); |
9ee634e3 JH |
3825 | } |
3826 | else | |
bc35512f | 3827 | ret = redirect_branch_edge (e, dest); |
9ee634e3 JH |
3828 | |
3829 | /* We don't want simplejumps in the insn stream during cfglayout. */ | |
341c100f | 3830 | gcc_assert (!simplejump_p (BB_END (src))); |
9ee634e3 | 3831 | |
6fb5fa3c | 3832 | df_set_bb_dirty (src); |
9ee634e3 JH |
3833 | return ret; |
3834 | } | |
3835 | ||
3836 | /* Simple wrapper as we always can redirect fallthru edges. */ | |
3837 | static basic_block | |
d329e058 | 3838 | cfg_layout_redirect_edge_and_branch_force (edge e, basic_block dest) |
9ee634e3 | 3839 | { |
341c100f NS |
3840 | edge redirected = cfg_layout_redirect_edge_and_branch (e, dest); |
3841 | ||
3842 | gcc_assert (redirected); | |
9ee634e3 JH |
3843 | return NULL; |
3844 | } | |
3845 | ||
f470c378 ZD |
3846 | /* Same as delete_basic_block but update cfg_layout structures. */ |
3847 | ||
9ee634e3 | 3848 | static void |
d329e058 | 3849 | cfg_layout_delete_block (basic_block bb) |
9ee634e3 | 3850 | { |
a813c111 | 3851 | rtx insn, next, prev = PREV_INSN (BB_HEAD (bb)), *to, remaints; |
9ee634e3 | 3852 | |
bcc708fc | 3853 | if (BB_HEADER (bb)) |
9ee634e3 | 3854 | { |
a813c111 | 3855 | next = BB_HEAD (bb); |
9ee634e3 | 3856 | if (prev) |
bcc708fc | 3857 | NEXT_INSN (prev) = BB_HEADER (bb); |
9ee634e3 | 3858 | else |
bcc708fc MM |
3859 | set_first_insn (BB_HEADER (bb)); |
3860 | PREV_INSN (BB_HEADER (bb)) = prev; | |
3861 | insn = BB_HEADER (bb); | |
9ee634e3 JH |
3862 | while (NEXT_INSN (insn)) |
3863 | insn = NEXT_INSN (insn); | |
3864 | NEXT_INSN (insn) = next; | |
3865 | PREV_INSN (next) = insn; | |
3866 | } | |
a813c111 | 3867 | next = NEXT_INSN (BB_END (bb)); |
bcc708fc | 3868 | if (BB_FOOTER (bb)) |
9ee634e3 | 3869 | { |
bcc708fc | 3870 | insn = BB_FOOTER (bb); |
bc35512f JH |
3871 | while (insn) |
3872 | { | |
4b4bf941 | 3873 | if (BARRIER_P (insn)) |
bc35512f JH |
3874 | { |
3875 | if (PREV_INSN (insn)) | |
3876 | NEXT_INSN (PREV_INSN (insn)) = NEXT_INSN (insn); | |
3877 | else | |
bcc708fc | 3878 | BB_FOOTER (bb) = NEXT_INSN (insn); |
bc35512f JH |
3879 | if (NEXT_INSN (insn)) |
3880 | PREV_INSN (NEXT_INSN (insn)) = PREV_INSN (insn); | |
3881 | } | |
4b4bf941 | 3882 | if (LABEL_P (insn)) |
bc35512f JH |
3883 | break; |
3884 | insn = NEXT_INSN (insn); | |
3885 | } | |
bcc708fc | 3886 | if (BB_FOOTER (bb)) |
bc35512f | 3887 | { |
a813c111 | 3888 | insn = BB_END (bb); |
bcc708fc MM |
3889 | NEXT_INSN (insn) = BB_FOOTER (bb); |
3890 | PREV_INSN (BB_FOOTER (bb)) = insn; | |
bc35512f JH |
3891 | while (NEXT_INSN (insn)) |
3892 | insn = NEXT_INSN (insn); | |
3893 | NEXT_INSN (insn) = next; | |
3894 | if (next) | |
3895 | PREV_INSN (next) = insn; | |
3896 | else | |
3897 | set_last_insn (insn); | |
3898 | } | |
9ee634e3 JH |
3899 | } |
3900 | if (bb->next_bb != EXIT_BLOCK_PTR) | |
bcc708fc | 3901 | to = &BB_HEADER (bb->next_bb); |
9ee634e3 JH |
3902 | else |
3903 | to = &cfg_layout_function_footer; | |
997de8ed | 3904 | |
9ee634e3 JH |
3905 | rtl_delete_block (bb); |
3906 | ||
3907 | if (prev) | |
3908 | prev = NEXT_INSN (prev); | |
d329e058 | 3909 | else |
9ee634e3 JH |
3910 | prev = get_insns (); |
3911 | if (next) | |
3912 | next = PREV_INSN (next); | |
d329e058 | 3913 | else |
9ee634e3 JH |
3914 | next = get_last_insn (); |
3915 | ||
3916 | if (next && NEXT_INSN (next) != prev) | |
3917 | { | |
3918 | remaints = unlink_insn_chain (prev, next); | |
3919 | insn = remaints; | |
3920 | while (NEXT_INSN (insn)) | |
3921 | insn = NEXT_INSN (insn); | |
3922 | NEXT_INSN (insn) = *to; | |
3923 | if (*to) | |
3924 | PREV_INSN (*to) = insn; | |
3925 | *to = remaints; | |
3926 | } | |
3927 | } | |
3928 | ||
beb235f8 | 3929 | /* Return true when blocks A and B can be safely merged. */ |
b48d0358 | 3930 | |
bc35512f | 3931 | static bool |
b48d0358 | 3932 | cfg_layout_can_merge_blocks_p (basic_block a, basic_block b) |
bc35512f | 3933 | { |
750054a2 CT |
3934 | /* If we are partitioning hot/cold basic blocks, we don't want to |
3935 | mess up unconditional or indirect jumps that cross between hot | |
076c7ab8 ZW |
3936 | and cold sections. |
3937 | ||
8e8d5162 | 3938 | Basic block partitioning may result in some jumps that appear to |
c22cacf3 MS |
3939 | be optimizable (or blocks that appear to be mergeable), but which really |
3940 | must be left untouched (they are required to make it safely across | |
3941 | partition boundaries). See the comments at the top of | |
8e8d5162 CT |
3942 | bb-reorder.c:partition_hot_cold_basic_blocks for complete details. */ |
3943 | ||
87c8b4be | 3944 | if (BB_PARTITION (a) != BB_PARTITION (b)) |
076c7ab8 | 3945 | return false; |
750054a2 | 3946 | |
7d776ee2 RG |
3947 | /* Protect the loop latches. */ |
3948 | if (current_loops && b->loop_father->latch == b) | |
3949 | return false; | |
3950 | ||
894a84b5 BS |
3951 | /* If we would end up moving B's instructions, make sure it doesn't fall |
3952 | through into the exit block, since we cannot recover from a fallthrough | |
3953 | edge into the exit block occurring in the middle of a function. */ | |
3954 | if (NEXT_INSN (BB_END (a)) != BB_HEAD (b)) | |
3955 | { | |
3956 | edge e = find_fallthru_edge (b->succs); | |
3957 | if (e && e->dest == EXIT_BLOCK_PTR) | |
3958 | return false; | |
3959 | } | |
3960 | ||
bc35512f | 3961 | /* There must be exactly one edge in between the blocks. */ |
c5cbcccf ZD |
3962 | return (single_succ_p (a) |
3963 | && single_succ (a) == b | |
3964 | && single_pred_p (b) == 1 | |
628f6a4e | 3965 | && a != b |
bc35512f | 3966 | /* Must be simple edge. */ |
c5cbcccf | 3967 | && !(single_succ_edge (a)->flags & EDGE_COMPLEX) |
bc35512f | 3968 | && a != ENTRY_BLOCK_PTR && b != EXIT_BLOCK_PTR |
49ea3702 SB |
3969 | /* If the jump insn has side effects, we can't kill the edge. |
3970 | When not optimizing, try_redirect_by_replacing_jump will | |
3971 | not allow us to redirect an edge by replacing a table jump. */ | |
4b4bf941 | 3972 | && (!JUMP_P (BB_END (a)) |
49ea3702 | 3973 | || ((!optimize || reload_completed) |
a813c111 | 3974 | ? simplejump_p (BB_END (a)) : onlyjump_p (BB_END (a))))); |
bc35512f JH |
3975 | } |
3976 | ||
41806d92 NS |
3977 | /* Merge block A and B. The blocks must be mergeable. */ |
3978 | ||
bc35512f JH |
3979 | static void |
3980 | cfg_layout_merge_blocks (basic_block a, basic_block b) | |
3981 | { | |
50a36e42 | 3982 | bool forwarder_p = (b->flags & BB_FORWARDER_BLOCK) != 0; |
f9df6f16 | 3983 | rtx insn; |
50a36e42 | 3984 | |
77a74ed7 | 3985 | gcc_checking_assert (cfg_layout_can_merge_blocks_p (a, b)); |
bc35512f | 3986 | |
6fb5fa3c | 3987 | if (dump_file) |
50a36e42 EB |
3988 | fprintf (dump_file, "Merging block %d into block %d...\n", b->index, |
3989 | a->index); | |
6fb5fa3c | 3990 | |
bc35512f | 3991 | /* If there was a CODE_LABEL beginning B, delete it. */ |
4b4bf941 | 3992 | if (LABEL_P (BB_HEAD (b))) |
2c97f8e4 | 3993 | { |
2c97f8e4 RH |
3994 | delete_insn (BB_HEAD (b)); |
3995 | } | |
bc35512f JH |
3996 | |
3997 | /* We should have fallthru edge in a, or we can do dummy redirection to get | |
3998 | it cleaned up. */ | |
4b4bf941 | 3999 | if (JUMP_P (BB_END (a))) |
628f6a4e | 4000 | try_redirect_by_replacing_jump (EDGE_SUCC (a, 0), b, true); |
341c100f | 4001 | gcc_assert (!JUMP_P (BB_END (a))); |
bc35512f | 4002 | |
9be94227 | 4003 | /* When not optimizing CFG and the edge is the only place in RTL which holds |
7241571e | 4004 | some unique locus, emit a nop with that locus in between. */ |
9be94227 EB |
4005 | if (!optimize) |
4006 | emit_nop_for_unique_locus_between (a, b); | |
7241571e | 4007 | |
bc35512f | 4008 | /* Possible line number notes should appear in between. */ |
bcc708fc | 4009 | if (BB_HEADER (b)) |
bc35512f | 4010 | { |
a813c111 | 4011 | rtx first = BB_END (a), last; |
bc35512f | 4012 | |
bcc708fc | 4013 | last = emit_insn_after_noloc (BB_HEADER (b), BB_END (a), a); |
bd73623c JJ |
4014 | /* The above might add a BARRIER as BB_END, but as barriers |
4015 | aren't valid parts of a bb, remove_insn doesn't update | |
4016 | BB_END if it is a barrier. So adjust BB_END here. */ | |
4017 | while (BB_END (a) != first && BARRIER_P (BB_END (a))) | |
4018 | BB_END (a) = PREV_INSN (BB_END (a)); | |
a7b87f73 | 4019 | delete_insn_chain (NEXT_INSN (first), last, false); |
bcc708fc | 4020 | BB_HEADER (b) = NULL; |
bc35512f JH |
4021 | } |
4022 | ||
4023 | /* In the case basic blocks are not adjacent, move them around. */ | |
a813c111 | 4024 | if (NEXT_INSN (BB_END (a)) != BB_HEAD (b)) |
bc35512f | 4025 | { |
f9df6f16 | 4026 | insn = unlink_insn_chain (BB_HEAD (b), BB_END (b)); |
6c3d0e31 | 4027 | |
f9df6f16 | 4028 | emit_insn_after_noloc (insn, BB_END (a), a); |
bc35512f JH |
4029 | } |
4030 | /* Otherwise just re-associate the instructions. */ | |
4031 | else | |
4032 | { | |
a813c111 | 4033 | insn = BB_HEAD (b); |
a813c111 | 4034 | BB_END (a) = BB_END (b); |
bc35512f JH |
4035 | } |
4036 | ||
f9df6f16 JJ |
4037 | /* emit_insn_after_noloc doesn't call df_insn_change_bb. |
4038 | We need to explicitly call. */ | |
4039 | update_bb_for_insn_chain (insn, BB_END (b), a); | |
4040 | ||
4041 | /* Skip possible DELETED_LABEL insn. */ | |
4042 | if (!NOTE_INSN_BASIC_BLOCK_P (insn)) | |
4043 | insn = NEXT_INSN (insn); | |
4044 | gcc_assert (NOTE_INSN_BASIC_BLOCK_P (insn)); | |
4045 | BB_HEAD (b) = NULL; | |
4046 | delete_insn (insn); | |
4047 | ||
6fb5fa3c DB |
4048 | df_bb_delete (b->index); |
4049 | ||
bc35512f | 4050 | /* Possible tablejumps and barriers should appear after the block. */ |
bcc708fc | 4051 | if (BB_FOOTER (b)) |
bc35512f | 4052 | { |
bcc708fc MM |
4053 | if (!BB_FOOTER (a)) |
4054 | BB_FOOTER (a) = BB_FOOTER (b); | |
bc35512f JH |
4055 | else |
4056 | { | |
bcc708fc | 4057 | rtx last = BB_FOOTER (a); |
bc35512f JH |
4058 | |
4059 | while (NEXT_INSN (last)) | |
4060 | last = NEXT_INSN (last); | |
bcc708fc MM |
4061 | NEXT_INSN (last) = BB_FOOTER (b); |
4062 | PREV_INSN (BB_FOOTER (b)) = last; | |
bc35512f | 4063 | } |
bcc708fc | 4064 | BB_FOOTER (b) = NULL; |
bc35512f JH |
4065 | } |
4066 | ||
50a36e42 EB |
4067 | /* If B was a forwarder block, propagate the locus on the edge. */ |
4068 | if (forwarder_p && !EDGE_SUCC (b, 0)->goto_locus) | |
4069 | EDGE_SUCC (b, 0)->goto_locus = EDGE_SUCC (a, 0)->goto_locus; | |
4070 | ||
c263766c | 4071 | if (dump_file) |
50a36e42 | 4072 | fprintf (dump_file, "Merged blocks %d and %d.\n", a->index, b->index); |
bc35512f JH |
4073 | } |
4074 | ||
4075 | /* Split edge E. */ | |
f470c378 | 4076 | |
bc35512f JH |
4077 | static basic_block |
4078 | cfg_layout_split_edge (edge e) | |
4079 | { | |
bc35512f JH |
4080 | basic_block new_bb = |
4081 | create_basic_block (e->src != ENTRY_BLOCK_PTR | |
a813c111 | 4082 | ? NEXT_INSN (BB_END (e->src)) : get_insns (), |
bc35512f JH |
4083 | NULL_RTX, e->src); |
4084 | ||
3e7eb734 JJ |
4085 | if (e->dest == EXIT_BLOCK_PTR) |
4086 | BB_COPY_PARTITION (new_bb, e->src); | |
4087 | else | |
4088 | BB_COPY_PARTITION (new_bb, e->dest); | |
a9b2ee88 | 4089 | make_edge (new_bb, e->dest, EDGE_FALLTHRU); |
bc35512f JH |
4090 | redirect_edge_and_branch_force (e, new_bb); |
4091 | ||
4092 | return new_bb; | |
4093 | } | |
4094 | ||
f470c378 ZD |
4095 | /* Do postprocessing after making a forwarder block joined by edge FALLTHRU. */ |
4096 | ||
4097 | static void | |
4098 | rtl_make_forwarder_block (edge fallthru ATTRIBUTE_UNUSED) | |
4099 | { | |
4100 | } | |
4101 | ||
6de9cd9a DN |
4102 | /* Return 1 if BB ends with a call, possibly followed by some |
4103 | instructions that must stay with the call, 0 otherwise. */ | |
4104 | ||
4105 | static bool | |
b48d0358 | 4106 | rtl_block_ends_with_call_p (basic_block bb) |
6de9cd9a DN |
4107 | { |
4108 | rtx insn = BB_END (bb); | |
4109 | ||
4b4bf941 | 4110 | while (!CALL_P (insn) |
6de9cd9a | 4111 | && insn != BB_HEAD (bb) |
92ddef69 | 4112 | && (keep_with_call_p (insn) |
b5b8b0ac AO |
4113 | || NOTE_P (insn) |
4114 | || DEBUG_INSN_P (insn))) | |
6de9cd9a | 4115 | insn = PREV_INSN (insn); |
4b4bf941 | 4116 | return (CALL_P (insn)); |
6de9cd9a DN |
4117 | } |
4118 | ||
4119 | /* Return 1 if BB ends with a conditional branch, 0 otherwise. */ | |
4120 | ||
4121 | static bool | |
9678086d | 4122 | rtl_block_ends_with_condjump_p (const_basic_block bb) |
6de9cd9a DN |
4123 | { |
4124 | return any_condjump_p (BB_END (bb)); | |
4125 | } | |
4126 | ||
4127 | /* Return true if we need to add fake edge to exit. | |
4128 | Helper function for rtl_flow_call_edges_add. */ | |
4129 | ||
4130 | static bool | |
9678086d | 4131 | need_fake_edge_p (const_rtx insn) |
6de9cd9a DN |
4132 | { |
4133 | if (!INSN_P (insn)) | |
4134 | return false; | |
4135 | ||
4b4bf941 | 4136 | if ((CALL_P (insn) |
6de9cd9a DN |
4137 | && !SIBLING_CALL_P (insn) |
4138 | && !find_reg_note (insn, REG_NORETURN, NULL) | |
becfd6e5 | 4139 | && !(RTL_CONST_OR_PURE_CALL_P (insn)))) |
6de9cd9a DN |
4140 | return true; |
4141 | ||
4142 | return ((GET_CODE (PATTERN (insn)) == ASM_OPERANDS | |
4143 | && MEM_VOLATILE_P (PATTERN (insn))) | |
4144 | || (GET_CODE (PATTERN (insn)) == PARALLEL | |
4145 | && asm_noperands (insn) != -1 | |
4146 | && MEM_VOLATILE_P (XVECEXP (PATTERN (insn), 0, 0))) | |
4147 | || GET_CODE (PATTERN (insn)) == ASM_INPUT); | |
4148 | } | |
4149 | ||
4150 | /* Add fake edges to the function exit for any non constant and non noreturn | |
4151 | calls, volatile inline assembly in the bitmap of blocks specified by | |
4152 | BLOCKS or to the whole CFG if BLOCKS is zero. Return the number of blocks | |
4153 | that were split. | |
4154 | ||
4155 | The goal is to expose cases in which entering a basic block does not imply | |
4156 | that all subsequent instructions must be executed. */ | |
4157 | ||
4158 | static int | |
4159 | rtl_flow_call_edges_add (sbitmap blocks) | |
4160 | { | |
4161 | int i; | |
4162 | int blocks_split = 0; | |
4163 | int last_bb = last_basic_block; | |
4164 | bool check_last_block = false; | |
4165 | ||
24bd1a0b | 4166 | if (n_basic_blocks == NUM_FIXED_BLOCKS) |
6de9cd9a DN |
4167 | return 0; |
4168 | ||
4169 | if (! blocks) | |
4170 | check_last_block = true; | |
4171 | else | |
4172 | check_last_block = TEST_BIT (blocks, EXIT_BLOCK_PTR->prev_bb->index); | |
4173 | ||
4174 | /* In the last basic block, before epilogue generation, there will be | |
4175 | a fallthru edge to EXIT. Special care is required if the last insn | |
4176 | of the last basic block is a call because make_edge folds duplicate | |
4177 | edges, which would result in the fallthru edge also being marked | |
4178 | fake, which would result in the fallthru edge being removed by | |
4179 | remove_fake_edges, which would result in an invalid CFG. | |
4180 | ||
4181 | Moreover, we can't elide the outgoing fake edge, since the block | |
4182 | profiler needs to take this into account in order to solve the minimal | |
4183 | spanning tree in the case that the call doesn't return. | |
4184 | ||
4185 | Handle this by adding a dummy instruction in a new last basic block. */ | |
4186 | if (check_last_block) | |
4187 | { | |
4188 | basic_block bb = EXIT_BLOCK_PTR->prev_bb; | |
4189 | rtx insn = BB_END (bb); | |
4190 | ||
4191 | /* Back up past insns that must be kept in the same block as a call. */ | |
4192 | while (insn != BB_HEAD (bb) | |
4193 | && keep_with_call_p (insn)) | |
4194 | insn = PREV_INSN (insn); | |
4195 | ||
4196 | if (need_fake_edge_p (insn)) | |
4197 | { | |
4198 | edge e; | |
4199 | ||
9ff3d2de JL |
4200 | e = find_edge (bb, EXIT_BLOCK_PTR); |
4201 | if (e) | |
4202 | { | |
c41c1387 | 4203 | insert_insn_on_edge (gen_use (const0_rtx), e); |
9ff3d2de JL |
4204 | commit_edge_insertions (); |
4205 | } | |
6de9cd9a DN |
4206 | } |
4207 | } | |
4208 | ||
4209 | /* Now add fake edges to the function exit for any non constant | |
4210 | calls since there is no way that we can determine if they will | |
4211 | return or not... */ | |
4212 | ||
24bd1a0b | 4213 | for (i = NUM_FIXED_BLOCKS; i < last_bb; i++) |
6de9cd9a DN |
4214 | { |
4215 | basic_block bb = BASIC_BLOCK (i); | |
4216 | rtx insn; | |
4217 | rtx prev_insn; | |
4218 | ||
4219 | if (!bb) | |
4220 | continue; | |
4221 | ||
4222 | if (blocks && !TEST_BIT (blocks, i)) | |
4223 | continue; | |
4224 | ||
4225 | for (insn = BB_END (bb); ; insn = prev_insn) | |
4226 | { | |
4227 | prev_insn = PREV_INSN (insn); | |
4228 | if (need_fake_edge_p (insn)) | |
4229 | { | |
4230 | edge e; | |
4231 | rtx split_at_insn = insn; | |
4232 | ||
4233 | /* Don't split the block between a call and an insn that should | |
c22cacf3 | 4234 | remain in the same block as the call. */ |
4b4bf941 | 4235 | if (CALL_P (insn)) |
6de9cd9a DN |
4236 | while (split_at_insn != BB_END (bb) |
4237 | && keep_with_call_p (NEXT_INSN (split_at_insn))) | |
4238 | split_at_insn = NEXT_INSN (split_at_insn); | |
4239 | ||
4240 | /* The handling above of the final block before the epilogue | |
c22cacf3 | 4241 | should be enough to verify that there is no edge to the exit |
6de9cd9a DN |
4242 | block in CFG already. Calling make_edge in such case would |
4243 | cause us to mark that edge as fake and remove it later. */ | |
4244 | ||
4245 | #ifdef ENABLE_CHECKING | |
4246 | if (split_at_insn == BB_END (bb)) | |
628f6a4e | 4247 | { |
9ff3d2de JL |
4248 | e = find_edge (bb, EXIT_BLOCK_PTR); |
4249 | gcc_assert (e == NULL); | |
628f6a4e | 4250 | } |
6de9cd9a DN |
4251 | #endif |
4252 | ||
4253 | /* Note that the following may create a new basic block | |
4254 | and renumber the existing basic blocks. */ | |
4255 | if (split_at_insn != BB_END (bb)) | |
4256 | { | |
4257 | e = split_block (bb, split_at_insn); | |
4258 | if (e) | |
4259 | blocks_split++; | |
4260 | } | |
4261 | ||
4262 | make_edge (bb, EXIT_BLOCK_PTR, EDGE_FAKE); | |
4263 | } | |
4264 | ||
4265 | if (insn == BB_HEAD (bb)) | |
4266 | break; | |
4267 | } | |
4268 | } | |
4269 | ||
4270 | if (blocks_split) | |
4271 | verify_flow_info (); | |
4272 | ||
4273 | return blocks_split; | |
4274 | } | |
4275 | ||
1cb7dfc3 | 4276 | /* Add COMP_RTX as a condition at end of COND_BB. FIRST_HEAD is |
315682fb | 4277 | the conditional branch target, SECOND_HEAD should be the fall-thru |
1cb7dfc3 MH |
4278 | there is no need to handle this here the loop versioning code handles |
4279 | this. the reason for SECON_HEAD is that it is needed for condition | |
4280 | in trees, and this should be of the same type since it is a hook. */ | |
4281 | static void | |
4282 | rtl_lv_add_condition_to_bb (basic_block first_head , | |
c22cacf3 MS |
4283 | basic_block second_head ATTRIBUTE_UNUSED, |
4284 | basic_block cond_bb, void *comp_rtx) | |
1cb7dfc3 MH |
4285 | { |
4286 | rtx label, seq, jump; | |
4287 | rtx op0 = XEXP ((rtx)comp_rtx, 0); | |
4288 | rtx op1 = XEXP ((rtx)comp_rtx, 1); | |
4289 | enum rtx_code comp = GET_CODE ((rtx)comp_rtx); | |
4290 | enum machine_mode mode; | |
4291 | ||
4292 | ||
4293 | label = block_label (first_head); | |
4294 | mode = GET_MODE (op0); | |
4295 | if (mode == VOIDmode) | |
4296 | mode = GET_MODE (op1); | |
4297 | ||
4298 | start_sequence (); | |
4299 | op0 = force_operand (op0, NULL_RTX); | |
4300 | op1 = force_operand (op1, NULL_RTX); | |
4301 | do_compare_rtx_and_jump (op0, op1, comp, 0, | |
40e90eac | 4302 | mode, NULL_RTX, NULL_RTX, label, -1); |
1cb7dfc3 MH |
4303 | jump = get_last_insn (); |
4304 | JUMP_LABEL (jump) = label; | |
4305 | LABEL_NUSES (label)++; | |
4306 | seq = get_insns (); | |
4307 | end_sequence (); | |
4308 | ||
4309 | /* Add the new cond , in the new head. */ | |
4310 | emit_insn_after(seq, BB_END(cond_bb)); | |
4311 | } | |
4312 | ||
4313 | ||
4314 | /* Given a block B with unconditional branch at its end, get the | |
4315 | store the return the branch edge and the fall-thru edge in | |
4316 | BRANCH_EDGE and FALLTHRU_EDGE respectively. */ | |
4317 | static void | |
4318 | rtl_extract_cond_bb_edges (basic_block b, edge *branch_edge, | |
4319 | edge *fallthru_edge) | |
4320 | { | |
4321 | edge e = EDGE_SUCC (b, 0); | |
4322 | ||
4323 | if (e->flags & EDGE_FALLTHRU) | |
4324 | { | |
4325 | *fallthru_edge = e; | |
4326 | *branch_edge = EDGE_SUCC (b, 1); | |
4327 | } | |
4328 | else | |
4329 | { | |
4330 | *branch_edge = e; | |
4331 | *fallthru_edge = EDGE_SUCC (b, 1); | |
4332 | } | |
4333 | } | |
4334 | ||
5e2d947c JH |
4335 | void |
4336 | init_rtl_bb_info (basic_block bb) | |
4337 | { | |
bcc708fc MM |
4338 | gcc_assert (!bb->il.x.rtl); |
4339 | bb->il.x.head_ = NULL; | |
4340 | bb->il.x.rtl = ggc_alloc_cleared_rtl_bb_info (); | |
5e2d947c JH |
4341 | } |
4342 | ||
14fa2cc0 ZD |
4343 | /* Returns true if it is possible to remove edge E by redirecting |
4344 | it to the destination of the other edge from E->src. */ | |
4345 | ||
4346 | static bool | |
9678086d | 4347 | rtl_can_remove_branch_p (const_edge e) |
14fa2cc0 | 4348 | { |
9678086d KG |
4349 | const_basic_block src = e->src; |
4350 | const_basic_block target = EDGE_SUCC (src, EDGE_SUCC (src, 0) == e)->dest; | |
4351 | const_rtx insn = BB_END (src), set; | |
14fa2cc0 ZD |
4352 | |
4353 | /* The conditions are taken from try_redirect_by_replacing_jump. */ | |
4354 | if (target == EXIT_BLOCK_PTR) | |
4355 | return false; | |
4356 | ||
4357 | if (e->flags & (EDGE_ABNORMAL_CALL | EDGE_EH)) | |
4358 | return false; | |
4359 | ||
4360 | if (find_reg_note (insn, REG_CROSSING_JUMP, NULL_RTX) | |
4361 | || BB_PARTITION (src) != BB_PARTITION (target)) | |
4362 | return false; | |
4363 | ||
4364 | if (!onlyjump_p (insn) | |
4365 | || tablejump_p (insn, NULL, NULL)) | |
4366 | return false; | |
4367 | ||
4368 | set = single_set (insn); | |
4369 | if (!set || side_effects_p (set)) | |
4370 | return false; | |
4371 | ||
4372 | return true; | |
4373 | } | |
4374 | ||
ffe14686 AM |
4375 | static basic_block |
4376 | rtl_duplicate_bb (basic_block bb) | |
4377 | { | |
4378 | bb = cfg_layout_duplicate_bb (bb); | |
4379 | bb->aux = NULL; | |
4380 | return bb; | |
4381 | } | |
4382 | ||
9ee634e3 JH |
4383 | /* Implementation of CFG manipulation for linearized RTL. */ |
4384 | struct cfg_hooks rtl_cfg_hooks = { | |
f470c378 | 4385 | "rtl", |
9ee634e3 | 4386 | rtl_verify_flow_info, |
10e9fecc | 4387 | rtl_dump_bb, |
bc35512f | 4388 | rtl_create_basic_block, |
9ee634e3 JH |
4389 | rtl_redirect_edge_and_branch, |
4390 | rtl_redirect_edge_and_branch_force, | |
14fa2cc0 | 4391 | rtl_can_remove_branch_p, |
9ee634e3 JH |
4392 | rtl_delete_block, |
4393 | rtl_split_block, | |
f470c378 | 4394 | rtl_move_block_after, |
bc35512f JH |
4395 | rtl_can_merge_blocks, /* can_merge_blocks_p */ |
4396 | rtl_merge_blocks, | |
6de9cd9a DN |
4397 | rtl_predict_edge, |
4398 | rtl_predicted_by_p, | |
ffe14686 AM |
4399 | cfg_layout_can_duplicate_bb_p, |
4400 | rtl_duplicate_bb, | |
f470c378 ZD |
4401 | rtl_split_edge, |
4402 | rtl_make_forwarder_block, | |
6de9cd9a | 4403 | rtl_tidy_fallthru_edge, |
cf103ca4 | 4404 | rtl_force_nonfallthru, |
6de9cd9a DN |
4405 | rtl_block_ends_with_call_p, |
4406 | rtl_block_ends_with_condjump_p, | |
d9d4706f KH |
4407 | rtl_flow_call_edges_add, |
4408 | NULL, /* execute_on_growing_pred */ | |
1cb7dfc3 MH |
4409 | NULL, /* execute_on_shrinking_pred */ |
4410 | NULL, /* duplicate loop for trees */ | |
4411 | NULL, /* lv_add_condition_to_bb */ | |
4412 | NULL, /* lv_adjust_loop_header_phi*/ | |
4413 | NULL, /* extract_cond_bb_edges */ | |
c22cacf3 | 4414 | NULL /* flush_pending_stmts */ |
9ee634e3 JH |
4415 | }; |
4416 | ||
4417 | /* Implementation of CFG manipulation for cfg layout RTL, where | |
4418 | basic block connected via fallthru edges does not have to be adjacent. | |
4419 | This representation will hopefully become the default one in future | |
4420 | version of the compiler. */ | |
6de9cd9a | 4421 | |
9ee634e3 | 4422 | struct cfg_hooks cfg_layout_rtl_cfg_hooks = { |
f470c378 | 4423 | "cfglayout mode", |
bc35512f | 4424 | rtl_verify_flow_info_1, |
10e9fecc | 4425 | rtl_dump_bb, |
bc35512f | 4426 | cfg_layout_create_basic_block, |
9ee634e3 JH |
4427 | cfg_layout_redirect_edge_and_branch, |
4428 | cfg_layout_redirect_edge_and_branch_force, | |
14fa2cc0 | 4429 | rtl_can_remove_branch_p, |
9ee634e3 JH |
4430 | cfg_layout_delete_block, |
4431 | cfg_layout_split_block, | |
f470c378 | 4432 | rtl_move_block_after, |
bc35512f JH |
4433 | cfg_layout_can_merge_blocks_p, |
4434 | cfg_layout_merge_blocks, | |
6de9cd9a DN |
4435 | rtl_predict_edge, |
4436 | rtl_predicted_by_p, | |
4437 | cfg_layout_can_duplicate_bb_p, | |
4438 | cfg_layout_duplicate_bb, | |
f470c378 ZD |
4439 | cfg_layout_split_edge, |
4440 | rtl_make_forwarder_block, | |
cf103ca4 EB |
4441 | NULL, /* tidy_fallthru_edge */ |
4442 | rtl_force_nonfallthru, | |
6de9cd9a DN |
4443 | rtl_block_ends_with_call_p, |
4444 | rtl_block_ends_with_condjump_p, | |
d9d4706f KH |
4445 | rtl_flow_call_edges_add, |
4446 | NULL, /* execute_on_growing_pred */ | |
1cb7dfc3 MH |
4447 | NULL, /* execute_on_shrinking_pred */ |
4448 | duplicate_loop_to_header_edge, /* duplicate loop for trees */ | |
4449 | rtl_lv_add_condition_to_bb, /* lv_add_condition_to_bb */ | |
4450 | NULL, /* lv_adjust_loop_header_phi*/ | |
4451 | rtl_extract_cond_bb_edges, /* extract_cond_bb_edges */ | |
c22cacf3 | 4452 | NULL /* flush_pending_stmts */ |
9ee634e3 | 4453 | }; |
78bde837 SB |
4454 | |
4455 | #include "gt-cfgrtl.h" |