Branch data Line data Source code
1 : : /* Control flow graph manipulation code for GNU compiler.
2 : : Copyright (C) 1987-2025 Free Software Foundation, Inc.
3 : :
4 : : This file is part of GCC.
5 : :
6 : : GCC is free software; you can redistribute it and/or modify it under
7 : : the terms of the GNU General Public License as published by the Free
8 : : Software Foundation; either version 3, or (at your option) any later
9 : : version.
10 : :
11 : : GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 : : WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 : : FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 : : for more details.
15 : :
16 : : You should have received a copy of the GNU General Public License
17 : : along with GCC; see the file COPYING3. If not see
18 : : <http://www.gnu.org/licenses/>. */
19 : :
20 : : /* This file contains low level functions to manipulate the CFG and analyze it
21 : : that are aware of the RTL intermediate language.
22 : :
23 : : Available functionality:
24 : : - Basic CFG/RTL manipulation API documented in cfghooks.h
25 : : - CFG-aware instruction chain manipulation
26 : : delete_insn, delete_insn_chain
27 : : - Edge splitting and committing to edges
28 : : insert_insn_on_edge, prepend_insn_to_edge, commit_edge_insertions
29 : : - CFG updating after insn simplification
30 : : purge_dead_edges, purge_all_dead_edges
31 : : - CFG fixing after coarse manipulation
32 : : fixup_abnormal_edges
33 : :
34 : : Functions not supposed for generic use:
35 : : - Infrastructure to determine quickly basic block for insn
36 : : compute_bb_for_insn, update_bb_for_insn, set_block_for_insn,
37 : : - Edge redirection with updating and optimizing of insn chain
38 : : block_label, tidy_fallthru_edge, force_nonfallthru */
39 : :
40 : : #include "config.h"
41 : : #include "system.h"
42 : : #include "coretypes.h"
43 : : #include "backend.h"
44 : : #include "target.h"
45 : : #include "rtl.h"
46 : : #include "tree.h"
47 : : #include "cfghooks.h"
48 : : #include "df.h"
49 : : #include "insn-config.h"
50 : : #include "memmodel.h"
51 : : #include "emit-rtl.h"
52 : : #include "cfgrtl.h"
53 : : #include "cfganal.h"
54 : : #include "cfgbuild.h"
55 : : #include "cfgcleanup.h"
56 : : #include "bb-reorder.h"
57 : : #include "rtl-error.h"
58 : : #include "insn-attr.h"
59 : : #include "dojump.h"
60 : : #include "expr.h"
61 : : #include "cfgloop.h"
62 : : #include "tree-pass.h"
63 : : #include "print-rtl.h"
64 : : #include "rtl-iter.h"
65 : : #include "gimplify.h"
66 : : #include "profile.h"
67 : : #include "sreal.h"
68 : :
69 : : /* Disable warnings about missing quoting in GCC diagnostics. */
70 : : #if __GNUC__ >= 10
71 : : # pragma GCC diagnostic push
72 : : # pragma GCC diagnostic ignored "-Wformat-diag"
73 : : #endif
74 : :
75 : : /* Holds the interesting leading and trailing notes for the function.
76 : : Only applicable if the CFG is in cfglayout mode. */
77 : : static GTY(()) rtx_insn *cfg_layout_function_footer;
78 : : static GTY(()) rtx_insn *cfg_layout_function_header;
79 : :
80 : : static rtx_insn *skip_insns_after_block (basic_block);
81 : : static void record_effective_endpoints (void);
82 : : static void fixup_reorder_chain (void);
83 : :
84 : : void verify_insn_chain (void);
85 : : static void fixup_fallthru_exit_predecessor (void);
86 : : static bool can_delete_note_p (const rtx_note *);
87 : : static bool can_delete_label_p (const rtx_code_label *);
88 : : static basic_block rtl_split_edge (edge);
89 : : static bool rtl_move_block_after (basic_block, basic_block);
90 : : static bool rtl_verify_flow_info (void);
91 : : static basic_block cfg_layout_split_block (basic_block, void *);
92 : : static edge cfg_layout_redirect_edge_and_branch (edge, basic_block);
93 : : static basic_block cfg_layout_redirect_edge_and_branch_force (edge, basic_block);
94 : : static void cfg_layout_delete_block (basic_block);
95 : : static void rtl_delete_block (basic_block);
96 : : static basic_block rtl_redirect_edge_and_branch_force (edge, basic_block);
97 : : static edge rtl_redirect_edge_and_branch (edge, basic_block);
98 : : static basic_block rtl_split_block (basic_block, void *);
99 : : static void rtl_dump_bb (FILE *, basic_block, int, dump_flags_t);
100 : : static bool rtl_verify_flow_info_1 (void);
101 : : static void rtl_make_forwarder_block (edge);
102 : : static bool rtl_bb_info_initialized_p (basic_block bb);
103 : :
104 : : /* Return true if NOTE is not one of the ones that must be kept paired,
105 : : so that we may simply delete it. */
106 : :
107 : : static bool
108 : 10726959 : can_delete_note_p (const rtx_note *note)
109 : : {
110 : 0 : switch (NOTE_KIND (note))
111 : : {
112 : : case NOTE_INSN_DELETED:
113 : : case NOTE_INSN_BASIC_BLOCK:
114 : : case NOTE_INSN_EPILOGUE_BEG:
115 : : return true;
116 : :
117 : 0 : default:
118 : 0 : return false;
119 : : }
120 : : }
121 : :
122 : : /* True if a given label can be deleted. */
123 : :
124 : : static bool
125 : 7689896 : can_delete_label_p (const rtx_code_label *label)
126 : : {
127 : 7689896 : return (!LABEL_PRESERVE_P (label)
128 : : /* User declared labels must be preserved. */
129 : 7682642 : && LABEL_NAME (label) == 0
130 : 7689896 : && !vec_safe_contains<rtx_insn *> (forced_labels,
131 : 7645471 : const_cast<rtx_code_label *> (label)));
132 : : }
133 : :
134 : : /* Delete INSN by patching it out. */
135 : :
136 : : void
137 : 127297437 : delete_insn (rtx_insn *insn)
138 : : {
139 : 127297437 : rtx note;
140 : 127297437 : bool really_delete = true;
141 : :
142 : 127297437 : if (LABEL_P (insn))
143 : : {
144 : : /* Some labels can't be directly removed from the INSN chain, as they
145 : : might be references via variables, constant pool etc.
146 : : Convert them to the special NOTE_INSN_DELETED_LABEL note. */
147 : 7689896 : if (! can_delete_label_p (as_a <rtx_code_label *> (insn)))
148 : : {
149 : 44425 : const char *name = LABEL_NAME (insn);
150 : 44425 : basic_block bb = BLOCK_FOR_INSN (insn);
151 : 44425 : rtx_insn *bb_note = NEXT_INSN (insn);
152 : :
153 : 44425 : really_delete = false;
154 : 44425 : PUT_CODE (insn, NOTE);
155 : 44425 : NOTE_KIND (insn) = NOTE_INSN_DELETED_LABEL;
156 : 44425 : NOTE_DELETED_LABEL_NAME (insn) = name;
157 : :
158 : : /* If the note following the label starts a basic block, and the
159 : : label is a member of the same basic block, interchange the two. */
160 : 44425 : if (bb_note != NULL_RTX
161 : 44327 : && NOTE_INSN_BASIC_BLOCK_P (bb_note)
162 : 10476 : && bb != NULL
163 : 54901 : && bb == BLOCK_FOR_INSN (bb_note))
164 : : {
165 : 8555 : reorder_insns_nobb (insn, insn, bb_note);
166 : 8555 : BB_HEAD (bb) = bb_note;
167 : 8555 : if (BB_END (bb) == bb_note)
168 : 1173 : BB_END (bb) = insn;
169 : : }
170 : : }
171 : :
172 : 7689896 : remove_node_from_insn_list (insn, &nonlocal_goto_handler_labels);
173 : : }
174 : :
175 : 7689896 : if (really_delete)
176 : : {
177 : : /* If this insn has already been deleted, something is very wrong. */
178 : 127253012 : gcc_assert (!insn->deleted ());
179 : 127253012 : if (INSN_P (insn))
180 : 93031736 : df_insn_delete (insn);
181 : 127253012 : remove_insn (insn);
182 : 127253012 : insn->set_deleted ();
183 : : }
184 : :
185 : : /* If deleting a jump, decrement the use count of the label. Deleting
186 : : the label itself should happen in the normal course of block merging. */
187 : 127297437 : if (JUMP_P (insn))
188 : : {
189 : 6973743 : if (JUMP_LABEL (insn)
190 : 6973536 : && LABEL_P (JUMP_LABEL (insn)))
191 : 6964283 : LABEL_NUSES (JUMP_LABEL (insn))--;
192 : :
193 : : /* If there are more targets, remove them too. */
194 : : while ((note
195 : 13947486 : = find_reg_note (insn, REG_LABEL_TARGET, NULL_RTX)) != NULL_RTX
196 : 6973743 : && LABEL_P (XEXP (note, 0)))
197 : : {
198 : 0 : LABEL_NUSES (XEXP (note, 0))--;
199 : 0 : remove_note (insn, note);
200 : : }
201 : : }
202 : :
203 : : /* Also if deleting any insn that references a label as an operand. */
204 : 254617188 : while ((note = find_reg_note (insn, REG_LABEL_OPERAND, NULL_RTX)) != NULL_RTX
205 : 127308594 : && LABEL_P (XEXP (note, 0)))
206 : : {
207 : 11157 : LABEL_NUSES (XEXP (note, 0))--;
208 : 11157 : remove_note (insn, note);
209 : : }
210 : :
211 : 127297437 : if (rtx_jump_table_data *table = dyn_cast <rtx_jump_table_data *> (insn))
212 : : {
213 : 10 : rtvec vec = table->get_labels ();
214 : 10 : int len = GET_NUM_ELEM (vec);
215 : 10 : int i;
216 : :
217 : 123 : for (i = 0; i < len; i++)
218 : : {
219 : 113 : rtx label = XEXP (RTVEC_ELT (vec, i), 0);
220 : :
221 : : /* When deleting code in bulk (e.g. removing many unreachable
222 : : blocks) we can delete a label that's a target of the vector
223 : : before deleting the vector itself. */
224 : 113 : if (!NOTE_P (label))
225 : 113 : LABEL_NUSES (label)--;
226 : : }
227 : : }
228 : 127297437 : }
229 : :
230 : : /* Like delete_insn but also purge dead edges from BB.
231 : : Return true if any edges are eliminated. */
232 : :
233 : : bool
234 : 12373180 : delete_insn_and_edges (rtx_insn *insn)
235 : : {
236 : 12373180 : bool purge = false;
237 : :
238 : 12373180 : if (NONDEBUG_INSN_P (insn) && BLOCK_FOR_INSN (insn))
239 : : {
240 : 12019637 : basic_block bb = BLOCK_FOR_INSN (insn);
241 : 12019637 : if (BB_END (bb) == insn)
242 : : purge = true;
243 : 11346131 : else if (DEBUG_INSN_P (BB_END (bb)))
244 : 1055853 : for (rtx_insn *dinsn = NEXT_INSN (insn);
245 : 1055853 : DEBUG_INSN_P (dinsn); dinsn = NEXT_INSN (dinsn))
246 : 682063 : if (BB_END (bb) == dinsn)
247 : : {
248 : : purge = true;
249 : : break;
250 : : }
251 : : }
252 : 12373180 : delete_insn (insn);
253 : 12373180 : if (purge)
254 : 738323 : return purge_dead_edges (BLOCK_FOR_INSN (insn));
255 : : return false;
256 : : }
257 : :
258 : : /* Unlink a chain of insns between START and FINISH, leaving notes
259 : : that must be paired. If CLEAR_BB is true, we set bb field for
260 : : insns that cannot be removed to NULL. */
261 : :
262 : : void
263 : 17494015 : delete_insn_chain (rtx start, rtx_insn *finish, bool clear_bb)
264 : : {
265 : : /* Unchain the insns one by one. It would be quicker to delete all of these
266 : : with a single unchaining, rather than one at a time, but we need to keep
267 : : the NOTE's. */
268 : 17494015 : rtx_insn *current = finish;
269 : 30323468 : while (1)
270 : : {
271 : 30323468 : rtx_insn *prev = PREV_INSN (current);
272 : 30323468 : if (NOTE_P (current) && !can_delete_note_p (as_a <rtx_note *> (current)))
273 : : ;
274 : : else
275 : 30318558 : delete_insn (current);
276 : :
277 : 30323468 : if (clear_bb && !current->deleted ())
278 : 39600 : set_block_for_insn (current, NULL);
279 : :
280 : 30323468 : if (current == start)
281 : : break;
282 : : current = prev;
283 : : }
284 : 17494015 : }
285 : :
286 : : /* Create a new basic block consisting of the instructions between HEAD and END
287 : : inclusive. This function is designed to allow fast BB construction - reuses
288 : : the note and basic block struct in BB_NOTE, if any and do not grow
289 : : BASIC_BLOCK chain and should be used directly only by CFG construction code.
290 : : END can be NULL in to create new empty basic block before HEAD. Both END
291 : : and HEAD can be NULL to create basic block at the end of INSN chain.
292 : : AFTER is the basic block we should be put after. */
293 : :
294 : : basic_block
295 : 13023202 : create_basic_block_structure (rtx_insn *head, rtx_insn *end, rtx_note *bb_note,
296 : : basic_block after)
297 : : {
298 : 13023202 : basic_block bb;
299 : :
300 : 13023202 : if (bb_note
301 : 0 : && (bb = NOTE_BASIC_BLOCK (bb_note)) != NULL
302 : 13023202 : && bb->aux == NULL)
303 : : {
304 : : /* If we found an existing note, thread it back onto the chain. */
305 : :
306 : 0 : rtx_insn *after;
307 : :
308 : 0 : if (LABEL_P (head))
309 : : after = head;
310 : : else
311 : : {
312 : 0 : after = PREV_INSN (head);
313 : 0 : head = bb_note;
314 : : }
315 : :
316 : 0 : if (after != bb_note && NEXT_INSN (after) != bb_note)
317 : 0 : reorder_insns_nobb (bb_note, bb_note, after);
318 : : }
319 : : else
320 : : {
321 : : /* Otherwise we must create a note and a basic block structure. */
322 : :
323 : 13023202 : bb = alloc_block ();
324 : :
325 : 13023202 : init_rtl_bb_info (bb);
326 : 13023202 : if (!head && !end)
327 : 446288 : head = end = bb_note
328 : 446288 : = emit_note_after (NOTE_INSN_BASIC_BLOCK, get_last_insn ());
329 : 12576914 : else if (LABEL_P (head) && end)
330 : : {
331 : 2591804 : bb_note = emit_note_after (NOTE_INSN_BASIC_BLOCK, head);
332 : 2591804 : if (head == end)
333 : 903663 : end = bb_note;
334 : : }
335 : : else
336 : : {
337 : 9985110 : bb_note = emit_note_before (NOTE_INSN_BASIC_BLOCK, head);
338 : 9985110 : head = bb_note;
339 : 9985110 : if (!end)
340 : 5596346 : end = head;
341 : : }
342 : :
343 : 13023202 : NOTE_BASIC_BLOCK (bb_note) = bb;
344 : : }
345 : :
346 : : /* Always include the bb note in the block. */
347 : 13023202 : if (NEXT_INSN (end) == bb_note)
348 : 0 : end = bb_note;
349 : :
350 : 13023202 : BB_HEAD (bb) = head;
351 : 13023202 : BB_END (bb) = end;
352 : 13023202 : bb->index = last_basic_block_for_fn (cfun)++;
353 : 13023202 : bb->flags = BB_NEW | BB_RTL;
354 : 13023202 : link_block (bb, after);
355 : 13023202 : SET_BASIC_BLOCK_FOR_FN (cfun, bb->index, bb);
356 : 13023202 : df_bb_refs_record (bb->index, false);
357 : 13023202 : update_bb_for_insn (bb);
358 : 13023202 : BB_SET_PARTITION (bb, BB_UNPARTITIONED);
359 : :
360 : : /* Tag the block so that we know it has been used when considering
361 : : other basic block notes. */
362 : 13023202 : bb->aux = bb;
363 : :
364 : 13023202 : return bb;
365 : : }
366 : :
367 : : /* Create new basic block consisting of instructions in between HEAD and END
368 : : and place it to the BB chain after block AFTER. END can be NULL to
369 : : create a new empty basic block before HEAD. Both END and HEAD can be
370 : : NULL to create basic block at the end of INSN chain. */
371 : :
372 : : static basic_block
373 : 13023202 : rtl_create_basic_block (void *headp, void *endp, basic_block after)
374 : : {
375 : 13023202 : rtx_insn *head = (rtx_insn *) headp;
376 : 13023202 : rtx_insn *end = (rtx_insn *) endp;
377 : 13023202 : basic_block bb;
378 : :
379 : : /* Grow the basic block array if needed. */
380 : 13023202 : if ((size_t) last_basic_block_for_fn (cfun)
381 : 13023202 : >= basic_block_info_for_fn (cfun)->length ())
382 : 792075 : vec_safe_grow_cleared (basic_block_info_for_fn (cfun),
383 : 792075 : last_basic_block_for_fn (cfun) + 1);
384 : :
385 : 13023202 : n_basic_blocks_for_fn (cfun)++;
386 : :
387 : 13023202 : bb = create_basic_block_structure (head, end, NULL, after);
388 : 13023202 : bb->aux = NULL;
389 : 13023202 : return bb;
390 : : }
391 : :
392 : : static basic_block
393 : 4141597 : cfg_layout_create_basic_block (void *head, void *end, basic_block after)
394 : : {
395 : 4141597 : basic_block newbb = rtl_create_basic_block (head, end, after);
396 : :
397 : 4141597 : return newbb;
398 : : }
399 : :
400 : : /* Delete the insns in a (non-live) block. We physically delete every
401 : : non-deleted-note insn, and update the flow graph appropriately.
402 : :
403 : : Return nonzero if we deleted an exception handler. */
404 : :
405 : : /* ??? Preserving all such notes strikes me as wrong. It would be nice
406 : : to post-process the stream to remove empty blocks, loops, ranges, etc. */
407 : :
408 : : static void
409 : 6871072 : rtl_delete_block (basic_block b)
410 : : {
411 : 6871072 : rtx_insn *insn, *end;
412 : :
413 : : /* If the head of this block is a CODE_LABEL, then it might be the
414 : : label for an exception handler which can't be reached. We need
415 : : to remove the label from the exception_handler_label list. */
416 : 6871072 : insn = BB_HEAD (b);
417 : :
418 : 6871072 : end = get_last_bb_insn (b);
419 : :
420 : : /* Selectively delete the entire chain. */
421 : 6871072 : BB_HEAD (b) = NULL;
422 : 6871072 : delete_insn_chain (insn, end, true);
423 : :
424 : :
425 : 6871072 : if (dump_file)
426 : 724 : fprintf (dump_file, "deleting block %d\n", b->index);
427 : 6871072 : df_bb_delete (b->index);
428 : 6871072 : }
429 : :
430 : : /* Records the basic block struct in BLOCK_FOR_INSN for every insn. */
431 : :
432 : : void
433 : 1449914 : compute_bb_for_insn (void)
434 : : {
435 : 1449914 : basic_block bb;
436 : :
437 : 15539254 : FOR_EACH_BB_FN (bb, cfun)
438 : : {
439 : 14089340 : rtx_insn *end = BB_END (bb);
440 : 14089340 : rtx_insn *insn;
441 : :
442 : 169340088 : for (insn = BB_HEAD (bb); ; insn = NEXT_INSN (insn))
443 : : {
444 : 169340088 : BLOCK_FOR_INSN (insn) = bb;
445 : 169340088 : if (insn == end)
446 : : break;
447 : : }
448 : : }
449 : 1449914 : }
450 : :
451 : : /* Release the basic_block_for_insn array. */
452 : :
453 : : void
454 : 2900523 : free_bb_for_insn (void)
455 : : {
456 : 2900523 : rtx_insn *insn;
457 : 203189820 : for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
458 : 200289297 : if (!BARRIER_P (insn))
459 : 195590548 : BLOCK_FOR_INSN (insn) = NULL;
460 : 2900523 : }
461 : :
462 : : namespace {
463 : :
464 : : const pass_data pass_data_free_cfg =
465 : : {
466 : : RTL_PASS, /* type */
467 : : "*free_cfg", /* name */
468 : : OPTGROUP_NONE, /* optinfo_flags */
469 : : TV_NONE, /* tv_id */
470 : : 0, /* properties_required */
471 : : 0, /* properties_provided */
472 : : PROP_cfg, /* properties_destroyed */
473 : : 0, /* todo_flags_start */
474 : : 0, /* todo_flags_finish */
475 : : };
476 : :
477 : : class pass_free_cfg : public rtl_opt_pass
478 : : {
479 : : public:
480 : 285081 : pass_free_cfg (gcc::context *ctxt)
481 : 570162 : : rtl_opt_pass (pass_data_free_cfg, ctxt)
482 : : {}
483 : :
484 : : /* opt_pass methods: */
485 : : unsigned int execute (function *) final override;
486 : :
487 : : }; // class pass_free_cfg
488 : :
489 : : unsigned int
490 : 1449856 : pass_free_cfg::execute (function *)
491 : : {
492 : : /* The resource.cc machinery uses DF but the CFG isn't guaranteed to be
493 : : valid at that point so it would be too late to call df_analyze. */
494 : 1449856 : if (DELAY_SLOTS && optimize > 0 && flag_delayed_branch)
495 : : {
496 : : df_note_add_problem ();
497 : : df_analyze ();
498 : : }
499 : :
500 : 1449856 : if (crtl->has_bb_partition)
501 : 61957 : insert_section_boundary_note ();
502 : :
503 : 1449856 : free_bb_for_insn ();
504 : 1449856 : return 0;
505 : : }
506 : :
507 : : } // anon namespace
508 : :
509 : : rtl_opt_pass *
510 : 285081 : make_pass_free_cfg (gcc::context *ctxt)
511 : : {
512 : 285081 : return new pass_free_cfg (ctxt);
513 : : }
514 : :
515 : : /* Return RTX to emit after when we want to emit code on the entry of function. */
516 : : rtx_insn *
517 : 7605 : entry_of_function (void)
518 : : {
519 : 7605 : return (n_basic_blocks_for_fn (cfun) > NUM_FIXED_BLOCKS ?
520 : 7605 : BB_HEAD (ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb) : get_insns ());
521 : : }
522 : :
523 : : /* Emit INSN at the entry point of the function, ensuring that it is only
524 : : executed once per function. */
525 : : void
526 : 0 : emit_insn_at_entry (rtx insn)
527 : : {
528 : 0 : edge_iterator ei = ei_start (ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs);
529 : 0 : edge e = ei_safe_edge (ei);
530 : 0 : gcc_assert (e->flags & EDGE_FALLTHRU);
531 : :
532 : 0 : insert_insn_on_edge (insn, e);
533 : 0 : commit_edge_insertions ();
534 : 0 : }
535 : :
536 : : /* Update BLOCK_FOR_INSN of insns between BEGIN and END
537 : : (or BARRIER if found) and notify df of the bb change.
538 : : The insn chain range is inclusive
539 : : (i.e. both BEGIN and END will be updated. */
540 : :
541 : : void
542 : 33153595 : update_bb_for_insn_chain (rtx_insn *begin, rtx_insn *end, basic_block bb)
543 : : {
544 : 33153595 : rtx_insn *insn;
545 : :
546 : 33153595 : end = NEXT_INSN (end);
547 : 331834248 : for (insn = begin; insn != end; insn = NEXT_INSN (insn))
548 : 265527058 : if (!BARRIER_P (insn))
549 : 263679543 : df_insn_change_bb (insn, bb);
550 : 33153595 : }
551 : :
552 : : /* Update BLOCK_FOR_INSN of insns in BB to BB,
553 : : and notify df of the change. */
554 : :
555 : : void
556 : 16639029 : update_bb_for_insn (basic_block bb)
557 : : {
558 : 16639029 : update_bb_for_insn_chain (BB_HEAD (bb), BB_END (bb), bb);
559 : 16639029 : }
560 : :
561 : :
562 : : /* Like active_insn_p, except keep the return value use or clobber around
563 : : even after reload. */
564 : :
565 : : static bool
566 : 299152643 : flow_active_insn_p (const rtx_insn *insn)
567 : : {
568 : 299152643 : if (active_insn_p (insn))
569 : : return true;
570 : :
571 : : /* A clobber of the function return value exists for buggy
572 : : programs that fail to return a value. Its effect is to
573 : : keep the return value from being live across the entire
574 : : function. If we allow it to be skipped, we introduce the
575 : : possibility for register lifetime confusion.
576 : : Similarly, keep a USE of the function return value, otherwise
577 : : the USE is dropped and we could fail to thread jump if USE
578 : : appears on some paths and not on others, see PR90257. */
579 : 173494167 : if ((GET_CODE (PATTERN (insn)) == CLOBBER
580 : 173428402 : || GET_CODE (PATTERN (insn)) == USE)
581 : 666912 : && REG_P (XEXP (PATTERN (insn), 0))
582 : 174154667 : && REG_FUNCTION_VALUE_P (XEXP (PATTERN (insn), 0)))
583 : 598952 : return true;
584 : :
585 : : return false;
586 : : }
587 : :
588 : : /* Return true if the block has no effect and only forwards control flow to
589 : : its single destination. */
590 : :
591 : : bool
592 : 311633099 : contains_no_active_insn_p (const_basic_block bb)
593 : : {
594 : 311633099 : rtx_insn *insn;
595 : :
596 : 311633099 : if (bb == EXIT_BLOCK_PTR_FOR_FN (cfun)
597 : 311633099 : || bb == ENTRY_BLOCK_PTR_FOR_FN (cfun)
598 : 438531497 : || !single_succ_p (bb)
599 : 457092574 : || (single_succ_edge (bb)->flags & EDGE_FAKE) != 0)
600 : : return false;
601 : :
602 : 531989464 : for (insn = BB_HEAD (bb); insn != BB_END (bb); insn = NEXT_INSN (insn))
603 : 485064362 : if (INSN_P (insn) && flow_active_insn_p (insn))
604 : : return false;
605 : :
606 : 46925102 : return (!INSN_P (insn)
607 : 36585284 : || (JUMP_P (insn) && simplejump_p (insn))
608 : 75615314 : || !flow_active_insn_p (insn));
609 : : }
610 : :
611 : : /* Likewise, but protect loop latches, headers and preheaders. */
612 : : /* FIXME: Make this a cfg hook. */
613 : :
614 : : bool
615 : 311633099 : forwarder_block_p (const_basic_block bb)
616 : : {
617 : 311633099 : if (!contains_no_active_insn_p (bb))
618 : : return false;
619 : :
620 : : /* Protect loop latches, headers and preheaders. */
621 : 18561077 : if (current_loops)
622 : : {
623 : 9210095 : basic_block dest;
624 : 9210095 : if (bb->loop_father->header == bb)
625 : : return false;
626 : 9062855 : dest = EDGE_SUCC (bb, 0)->dest;
627 : 9062855 : if (dest->loop_father->header == dest)
628 : 1124869 : return false;
629 : : }
630 : :
631 : : return true;
632 : : }
633 : :
634 : : /* Return nonzero if we can reach target from src by falling through. */
635 : : /* FIXME: Make this a cfg hook, the result is only valid in cfgrtl mode. */
636 : :
637 : : bool
638 : 45623841 : can_fallthru (basic_block src, basic_block target)
639 : : {
640 : 45623841 : rtx_insn *insn = BB_END (src);
641 : 45623841 : rtx_insn *insn2;
642 : 45623841 : edge e;
643 : 45623841 : edge_iterator ei;
644 : :
645 : 45623841 : if (target == EXIT_BLOCK_PTR_FOR_FN (cfun))
646 : : return true;
647 : 44274291 : if (src->next_bb != target)
648 : : return false;
649 : :
650 : : /* ??? Later we may add code to move jump tables offline. */
651 : 17165607 : if (tablejump_p (insn, NULL, NULL))
652 : : return false;
653 : :
654 : 46622992 : FOR_EACH_EDGE (e, ei, src->succs)
655 : 29457385 : if (e->dest == EXIT_BLOCK_PTR_FOR_FN (cfun)
656 : 0 : && e->flags & EDGE_FALLTHRU)
657 : : return false;
658 : :
659 : 17165607 : insn2 = BB_HEAD (target);
660 : 17165607 : if (!active_insn_p (insn2))
661 : 17165607 : insn2 = next_active_insn (insn2);
662 : :
663 : 17165607 : return next_active_insn (insn) == insn2;
664 : : }
665 : :
666 : : /* Return nonzero if we could reach target from src by falling through,
667 : : if the target was made adjacent. If we already have a fall-through
668 : : edge to the exit block, we can't do that. */
669 : : static bool
670 : 2280822 : could_fall_through (basic_block src, basic_block target)
671 : : {
672 : 2280822 : edge e;
673 : 2280822 : edge_iterator ei;
674 : :
675 : 2280822 : if (target == EXIT_BLOCK_PTR_FOR_FN (cfun))
676 : : return true;
677 : 6842466 : FOR_EACH_EDGE (e, ei, src->succs)
678 : 4561644 : if (e->dest == EXIT_BLOCK_PTR_FOR_FN (cfun)
679 : 0 : && e->flags & EDGE_FALLTHRU)
680 : : return 0;
681 : : return true;
682 : : }
683 : :
684 : : /* Return the NOTE_INSN_BASIC_BLOCK of BB. */
685 : : rtx_note *
686 : 42092952 : bb_note (basic_block bb)
687 : : {
688 : 42092952 : rtx_insn *note;
689 : :
690 : 42092952 : note = BB_HEAD (bb);
691 : 42092952 : if (LABEL_P (note))
692 : 20610203 : note = NEXT_INSN (note);
693 : :
694 : 42092952 : gcc_assert (NOTE_INSN_BASIC_BLOCK_P (note));
695 : 42092952 : return as_a <rtx_note *> (note);
696 : : }
697 : :
698 : : /* Return the INSN immediately following the NOTE_INSN_BASIC_BLOCK
699 : : note associated with the BLOCK. */
700 : :
701 : : static rtx_insn *
702 : 6797 : first_insn_after_basic_block_note (basic_block block)
703 : : {
704 : 6797 : rtx_insn *insn;
705 : :
706 : : /* Get the first instruction in the block. */
707 : 6797 : insn = BB_HEAD (block);
708 : :
709 : 6797 : if (insn == NULL_RTX)
710 : : return NULL;
711 : 6797 : if (LABEL_P (insn))
712 : 6783 : insn = NEXT_INSN (insn);
713 : 6797 : gcc_assert (NOTE_INSN_BASIC_BLOCK_P (insn));
714 : :
715 : 6797 : return NEXT_INSN (insn);
716 : : }
717 : :
718 : : /* Creates a new basic block just after basic block BB by splitting
719 : : everything after specified instruction INSNP. */
720 : :
721 : : static basic_block
722 : 2841968 : rtl_split_block (basic_block bb, void *insnp)
723 : : {
724 : 2841968 : basic_block new_bb;
725 : 2841968 : rtx_insn *insn = (rtx_insn *) insnp;
726 : 2841968 : edge e;
727 : 2841968 : edge_iterator ei;
728 : :
729 : 2841968 : if (!insn)
730 : : {
731 : 6797 : insn = first_insn_after_basic_block_note (bb);
732 : :
733 : 6797 : if (insn)
734 : : {
735 : 6778 : rtx_insn *next = insn;
736 : :
737 : 6778 : insn = PREV_INSN (insn);
738 : :
739 : : /* If the block contains only debug insns, insn would have
740 : : been NULL in a non-debug compilation, and then we'd end
741 : : up emitting a DELETED note. For -fcompare-debug
742 : : stability, emit the note too. */
743 : 6778 : if (insn != BB_END (bb)
744 : 6529 : && DEBUG_INSN_P (next)
745 : 793 : && DEBUG_INSN_P (BB_END (bb)))
746 : : {
747 : 309 : while (next != BB_END (bb) && DEBUG_INSN_P (next))
748 : 226 : next = NEXT_INSN (next);
749 : :
750 : 83 : if (next == BB_END (bb))
751 : 83 : emit_note_after (NOTE_INSN_DELETED, next);
752 : : }
753 : : }
754 : : else
755 : 19 : insn = get_last_insn ();
756 : : }
757 : :
758 : : /* We probably should check type of the insn so that we do not create
759 : : inconsistent cfg. It is checked in verify_flow_info anyway, so do not
760 : : bother. */
761 : 2841968 : if (insn == BB_END (bb))
762 : 268 : emit_note_after (NOTE_INSN_DELETED, insn);
763 : :
764 : : /* Create the new basic block. */
765 : 2841968 : new_bb = create_basic_block (NEXT_INSN (insn), BB_END (bb), bb);
766 : 2841968 : BB_COPY_PARTITION (new_bb, bb);
767 : 2841968 : BB_END (bb) = insn;
768 : :
769 : : /* Redirect the outgoing edges. */
770 : 2841968 : new_bb->succs = bb->succs;
771 : 2841968 : bb->succs = NULL;
772 : 7787176 : FOR_EACH_EDGE (e, ei, new_bb->succs)
773 : 4945208 : e->src = new_bb;
774 : :
775 : : /* The new block starts off being dirty. */
776 : 2841968 : df_set_bb_dirty (bb);
777 : 2841968 : return new_bb;
778 : : }
779 : :
780 : : /* Return true if LOC1 and LOC2 are equivalent for
781 : : unique_locus_on_edge_between_p purposes. */
782 : :
783 : : static bool
784 : 1373166 : loc_equal (location_t loc1, location_t loc2)
785 : : {
786 : 1373166 : if (loc1 == loc2)
787 : : return true;
788 : :
789 : 750398 : expanded_location loce1 = expand_location (loc1);
790 : 750398 : expanded_location loce2 = expand_location (loc2);
791 : :
792 : 750398 : if (loce1.line != loce2.line
793 : 539646 : || loce1.column != loce2.column
794 : 419256 : || loce1.data != loce2.data)
795 : : return false;
796 : 384717 : if (loce1.file == loce2.file)
797 : : return true;
798 : 0 : return (loce1.file != NULL
799 : 0 : && loce2.file != NULL
800 : 0 : && filename_cmp (loce1.file, loce2.file) == 0);
801 : : }
802 : :
803 : : /* Return true if the single edge between blocks A and B is the only place
804 : : in RTL which holds some unique locus. */
805 : :
806 : : static bool
807 : 1116661 : unique_locus_on_edge_between_p (basic_block a, basic_block b)
808 : : {
809 : 1116661 : const location_t goto_locus = EDGE_SUCC (a, 0)->goto_locus;
810 : 1116661 : rtx_insn *insn, *end;
811 : :
812 : 1116661 : if (LOCATION_LOCUS (goto_locus) == UNKNOWN_LOCATION)
813 : : return false;
814 : :
815 : : /* First scan block A backward. */
816 : 517813 : insn = BB_END (a);
817 : 517813 : end = PREV_INSN (BB_HEAD (a));
818 : 1191037 : while (insn != end && (!NONDEBUG_INSN_P (insn) || !INSN_HAS_LOCATION (insn)))
819 : 155411 : insn = PREV_INSN (insn);
820 : :
821 : 517813 : if (insn != end && loc_equal (INSN_LOCATION (insn), goto_locus))
822 : : return false;
823 : :
824 : : /* Then scan block B forward. */
825 : 175505 : insn = BB_HEAD (b);
826 : 175505 : if (insn)
827 : : {
828 : 164886 : end = NEXT_INSN (BB_END (b));
829 : 331113 : while (insn != end && !NONDEBUG_INSN_P (insn))
830 : 1341 : insn = NEXT_INSN (insn);
831 : :
832 : 164665 : if (insn != end && INSN_HAS_LOCATION (insn)
833 : 328441 : && loc_equal (INSN_LOCATION (insn), goto_locus))
834 : : return false;
835 : : }
836 : :
837 : : return true;
838 : : }
839 : :
840 : : /* If the single edge between blocks A and B is the only place in RTL which
841 : : holds some unique locus, emit a nop with that locus between the blocks. */
842 : :
843 : : static void
844 : 1116661 : emit_nop_for_unique_locus_between (basic_block a, basic_block b)
845 : : {
846 : 1116661 : if (!unique_locus_on_edge_between_p (a, b))
847 : : return;
848 : :
849 : 18967 : BB_END (a) = emit_insn_after_noloc (gen_nop (), BB_END (a), a);
850 : 18967 : INSN_LOCATION (BB_END (a)) = EDGE_SUCC (a, 0)->goto_locus;
851 : : }
852 : :
853 : : /* Blocks A and B are to be merged into a single block A. The insns
854 : : are already contiguous. */
855 : :
856 : : static void
857 : 3742185 : rtl_merge_blocks (basic_block a, basic_block b)
858 : : {
859 : : /* If B is a forwarder block whose outgoing edge has no location, we'll
860 : : propagate the locus of the edge between A and B onto it. */
861 : 3742185 : const bool forward_edge_locus
862 : 3742185 : = (b->flags & BB_FORWARDER_BLOCK) != 0
863 : 3742185 : && LOCATION_LOCUS (EDGE_SUCC (b, 0)->goto_locus) == UNKNOWN_LOCATION;
864 : 3742185 : rtx_insn *b_head = BB_HEAD (b), *b_end = BB_END (b), *a_end = BB_END (a);
865 : 3742185 : rtx_insn *del_first = NULL, *del_last = NULL;
866 : 3742185 : rtx_insn *b_debug_start = b_end, *b_debug_end = b_end;
867 : 3742185 : bool b_empty = false;
868 : :
869 : 3742185 : if (dump_file)
870 : 816 : fprintf (dump_file, "Merging block %d into block %d...\n", b->index,
871 : : a->index);
872 : :
873 : 4295929 : while (DEBUG_INSN_P (b_end))
874 : 553744 : b_end = PREV_INSN (b_debug_start = b_end);
875 : :
876 : : /* If there was a CODE_LABEL beginning B, delete it. */
877 : 3742185 : if (LABEL_P (b_head))
878 : : {
879 : : /* Detect basic blocks with nothing but a label. This can happen
880 : : in particular at the end of a function. */
881 : 1740045 : if (b_head == b_end)
882 : 0 : b_empty = true;
883 : :
884 : 1740045 : del_first = del_last = b_head;
885 : 1740045 : b_head = NEXT_INSN (b_head);
886 : : }
887 : :
888 : : /* Delete the basic block note and handle blocks containing just that
889 : : note. */
890 : 3742185 : if (NOTE_INSN_BASIC_BLOCK_P (b_head))
891 : : {
892 : 3742185 : if (b_head == b_end)
893 : 728037 : b_empty = true;
894 : 3742185 : if (! del_last)
895 : 2002140 : del_first = b_head;
896 : :
897 : 3742185 : del_last = b_head;
898 : 3742185 : b_head = NEXT_INSN (b_head);
899 : : }
900 : :
901 : : /* If there was a jump out of A, delete it. */
902 : 3742185 : if (JUMP_P (a_end))
903 : : {
904 : 51975 : rtx_insn *prev;
905 : :
906 : 53021 : for (prev = PREV_INSN (a_end); ; prev = PREV_INSN (prev))
907 : 53021 : if (!NOTE_P (prev)
908 : 1067 : || NOTE_INSN_BASIC_BLOCK_P (prev)
909 : 1046 : || prev == BB_HEAD (a))
910 : : break;
911 : :
912 : : del_first = a_end;
913 : :
914 : : a_end = PREV_INSN (del_first);
915 : : }
916 : 3690210 : else if (BARRIER_P (NEXT_INSN (a_end)))
917 : 0 : del_first = NEXT_INSN (a_end);
918 : :
919 : : /* Delete everything marked above as well as crap that might be
920 : : hanging out between the two blocks. */
921 : 3742185 : BB_END (a) = a_end;
922 : 3742185 : BB_HEAD (b) = b_empty ? NULL : b_head;
923 : 3742185 : delete_insn_chain (del_first, del_last, true);
924 : :
925 : : /* If not optimizing, preserve the locus of the single edge between
926 : : blocks A and B if necessary by emitting a nop. */
927 : 3742185 : if (!optimize
928 : 1391194 : && !forward_edge_locus
929 : 4857480 : && !DECL_IGNORED_P (current_function_decl))
930 : : {
931 : 1112109 : emit_nop_for_unique_locus_between (a, b);
932 : 1112109 : a_end = BB_END (a);
933 : : }
934 : :
935 : : /* Reassociate the insns of B with A. */
936 : 3742185 : if (!b_empty)
937 : : {
938 : 3014148 : update_bb_for_insn_chain (a_end, b_debug_end, a);
939 : :
940 : 3014148 : BB_END (a) = b_debug_end;
941 : 3014148 : BB_HEAD (b) = NULL;
942 : : }
943 : 728037 : else if (b_end != b_debug_end)
944 : : {
945 : : /* Move any deleted labels and other notes between the end of A
946 : : and the debug insns that make up B after the debug insns,
947 : : bringing the debug insns into A while keeping the notes after
948 : : the end of A. */
949 : 31106 : if (NEXT_INSN (a_end) != b_debug_start)
950 : 122 : reorder_insns_nobb (NEXT_INSN (a_end), PREV_INSN (b_debug_start),
951 : : b_debug_end);
952 : 31106 : update_bb_for_insn_chain (b_debug_start, b_debug_end, a);
953 : 31106 : BB_END (a) = b_debug_end;
954 : : }
955 : :
956 : 3742185 : df_bb_delete (b->index);
957 : :
958 : 3742185 : if (forward_edge_locus)
959 : 708448 : EDGE_SUCC (b, 0)->goto_locus = EDGE_SUCC (a, 0)->goto_locus;
960 : :
961 : 3742185 : if (dump_file)
962 : 816 : fprintf (dump_file, "Merged blocks %d and %d.\n", a->index, b->index);
963 : 3742185 : }
964 : :
965 : :
966 : : /* Return true when block A and B can be merged. */
967 : :
968 : : static bool
969 : 48 : rtl_can_merge_blocks (basic_block a, basic_block b)
970 : : {
971 : : /* If we are partitioning hot/cold basic blocks, we don't want to
972 : : mess up unconditional or indirect jumps that cross between hot
973 : : and cold sections.
974 : :
975 : : Basic block partitioning may result in some jumps that appear to
976 : : be optimizable (or blocks that appear to be mergeable), but which really
977 : : must be left untouched (they are required to make it safely across
978 : : partition boundaries). See the comments at the top of
979 : : bb-reorder.cc:partition_hot_cold_basic_blocks for complete details. */
980 : :
981 : 48 : if (BB_PARTITION (a) != BB_PARTITION (b))
982 : : return false;
983 : :
984 : : /* Protect the loop latches. */
985 : 48 : if (current_loops && b->loop_father->latch == b)
986 : : return false;
987 : :
988 : : /* There must be exactly one edge in between the blocks. */
989 : 48 : return (single_succ_p (a)
990 : 44 : && single_succ (a) == b
991 : 33 : && single_pred_p (b)
992 : 33 : && a != b
993 : : /* Must be simple edge. */
994 : 33 : && !(single_succ_edge (a)->flags & EDGE_COMPLEX)
995 : 33 : && a->next_bb == b
996 : 33 : && a != ENTRY_BLOCK_PTR_FOR_FN (cfun)
997 : 33 : && b != EXIT_BLOCK_PTR_FOR_FN (cfun)
998 : : /* If the jump insn has side effects,
999 : : we can't kill the edge. */
1000 : 81 : && (!JUMP_P (BB_END (a))
1001 : 0 : || (reload_completed
1002 : 0 : ? simplejump_p (BB_END (a)) : onlyjump_p (BB_END (a)))));
1003 : : }
1004 : :
1005 : : /* Return the label in the head of basic block BLOCK. Create one if it doesn't
1006 : : exist. */
1007 : :
1008 : : rtx_code_label *
1009 : 15747744 : block_label (basic_block block)
1010 : : {
1011 : 15747744 : if (block == EXIT_BLOCK_PTR_FOR_FN (cfun))
1012 : : return NULL;
1013 : :
1014 : 15692993 : if (!LABEL_P (BB_HEAD (block)))
1015 : : {
1016 : 5667357 : BB_HEAD (block) = emit_label_before (gen_label_rtx (), BB_HEAD (block));
1017 : : }
1018 : :
1019 : 15692993 : return as_a <rtx_code_label *> (BB_HEAD (block));
1020 : : }
1021 : :
1022 : : /* Remove all barriers from BB_FOOTER of a BB. */
1023 : :
1024 : : static void
1025 : 3779743 : remove_barriers_from_footer (basic_block bb)
1026 : : {
1027 : 3779743 : rtx_insn *insn = BB_FOOTER (bb);
1028 : :
1029 : : /* Remove barriers but keep jumptables. */
1030 : 7308349 : while (insn)
1031 : : {
1032 : 3528606 : if (BARRIER_P (insn))
1033 : : {
1034 : 3528591 : if (PREV_INSN (insn))
1035 : 16 : SET_NEXT_INSN (PREV_INSN (insn)) = NEXT_INSN (insn);
1036 : : else
1037 : 3528575 : BB_FOOTER (bb) = NEXT_INSN (insn);
1038 : 3528591 : if (NEXT_INSN (insn))
1039 : 34253 : SET_PREV_INSN (NEXT_INSN (insn)) = PREV_INSN (insn);
1040 : : }
1041 : 3528606 : if (LABEL_P (insn))
1042 : : return;
1043 : 3528606 : insn = NEXT_INSN (insn);
1044 : : }
1045 : : }
1046 : :
1047 : : /* Attempt to perform edge redirection by replacing possibly complex jump
1048 : : instruction by unconditional jump or removing jump completely. This can
1049 : : apply only if all edges now point to the same block. The parameters and
1050 : : return values are equivalent to redirect_edge_and_branch. */
1051 : :
1052 : : edge
1053 : 50442031 : try_redirect_by_replacing_jump (edge e, basic_block target, bool in_cfglayout)
1054 : : {
1055 : 50442031 : basic_block src = e->src;
1056 : 50442031 : rtx_insn *insn = BB_END (src);
1057 : 50442031 : rtx set;
1058 : 50442031 : bool fallthru = false;
1059 : :
1060 : : /* If we are partitioning hot/cold basic blocks, we don't want to
1061 : : mess up unconditional or indirect jumps that cross between hot
1062 : : and cold sections.
1063 : :
1064 : : Basic block partitioning may result in some jumps that appear to
1065 : : be optimizable (or blocks that appear to be mergeable), but which really
1066 : : must be left untouched (they are required to make it safely across
1067 : : partition boundaries). See the comments at the top of
1068 : : bb-reorder.cc:partition_hot_cold_basic_blocks for complete details. */
1069 : :
1070 : 50442031 : if (BB_PARTITION (src) != BB_PARTITION (target))
1071 : : return NULL;
1072 : :
1073 : : /* We can replace or remove a complex jump only when we have exactly
1074 : : two edges. Also, if we have exactly one outgoing edge, we can
1075 : : redirect that. */
1076 : 50387399 : if (EDGE_COUNT (src->succs) >= 3
1077 : : /* Verify that all targets will be TARGET. Specifically, the
1078 : : edge that is not E must also go to TARGET. */
1079 : 50387399 : || (EDGE_COUNT (src->succs) == 2
1080 : 18881279 : && EDGE_SUCC (src, EDGE_SUCC (src, 0) == e)->dest != target))
1081 : : return NULL;
1082 : :
1083 : 31628799 : if (!onlyjump_p (insn))
1084 : : return NULL;
1085 : 30104342 : if ((!optimize || reload_completed) && tablejump_p (insn, NULL, NULL))
1086 : : return NULL;
1087 : :
1088 : : /* Avoid removing branch with side effects. */
1089 : 30104130 : set = single_set (insn);
1090 : 30104130 : if (!set || side_effects_p (set))
1091 : 0 : return NULL;
1092 : :
1093 : : /* See if we can create the fallthru edge. */
1094 : 30104130 : if (in_cfglayout || can_fallthru (src, target))
1095 : : {
1096 : 4641526 : if (dump_file)
1097 : 773 : fprintf (dump_file, "Removing jump %i.\n", INSN_UID (insn));
1098 : 4641526 : fallthru = true;
1099 : :
1100 : : /* Selectively unlink whole insn chain. */
1101 : 4641526 : if (in_cfglayout)
1102 : : {
1103 : 3779743 : delete_insn_chain (insn, BB_END (src), false);
1104 : 3779743 : remove_barriers_from_footer (src);
1105 : : }
1106 : : else
1107 : 861783 : delete_insn_chain (insn, PREV_INSN (BB_HEAD (target)), false);
1108 : : }
1109 : :
1110 : : /* If this already is simplejump, redirect it. */
1111 : 25462604 : else if (simplejump_p (insn))
1112 : : {
1113 : 25460360 : if (e->dest == target)
1114 : : return NULL;
1115 : 524278 : if (dump_file)
1116 : 45 : fprintf (dump_file, "Redirecting jump %i from %i to %i.\n",
1117 : 45 : INSN_UID (insn), e->dest->index, target->index);
1118 : 524278 : if (!redirect_jump (as_a <rtx_jump_insn *> (insn),
1119 : 524278 : block_label (target), 0))
1120 : : {
1121 : 0 : gcc_assert (target == EXIT_BLOCK_PTR_FOR_FN (cfun));
1122 : : return NULL;
1123 : : }
1124 : : }
1125 : :
1126 : : /* Cannot do anything for target exit block. */
1127 : 2244 : else if (target == EXIT_BLOCK_PTR_FOR_FN (cfun))
1128 : : return NULL;
1129 : :
1130 : : /* Or replace possibly complicated jump insn by simple jump insn. */
1131 : : else
1132 : : {
1133 : 2244 : rtx_code_label *target_label = block_label (target);
1134 : 2244 : rtx_insn *barrier;
1135 : 2244 : rtx_insn *label;
1136 : 2244 : rtx_jump_table_data *table;
1137 : :
1138 : 2244 : emit_jump_insn_after_noloc (targetm.gen_jump (target_label), insn);
1139 : 2244 : JUMP_LABEL (BB_END (src)) = target_label;
1140 : 2244 : LABEL_NUSES (target_label)++;
1141 : 2244 : if (dump_file)
1142 : 0 : fprintf (dump_file, "Replacing insn %i by jump %i\n",
1143 : 0 : INSN_UID (insn), INSN_UID (BB_END (src)));
1144 : :
1145 : :
1146 : 2244 : delete_insn_chain (insn, insn, false);
1147 : :
1148 : : /* Recognize a tablejump that we are converting to a
1149 : : simple jump and remove its associated CODE_LABEL
1150 : : and ADDR_VEC or ADDR_DIFF_VEC. */
1151 : 2244 : if (tablejump_p (insn, &label, &table))
1152 : 2 : delete_insn_chain (label, table, false);
1153 : :
1154 : 2244 : barrier = next_nonnote_nondebug_insn (BB_END (src));
1155 : 2244 : if (!barrier || !BARRIER_P (barrier))
1156 : 2109 : emit_barrier_after (BB_END (src));
1157 : : else
1158 : : {
1159 : 135 : if (barrier != NEXT_INSN (BB_END (src)))
1160 : : {
1161 : : /* Move the jump before barrier so that the notes
1162 : : which originally were or were created before jump table are
1163 : : inside the basic block. */
1164 : 2 : rtx_insn *new_insn = BB_END (src);
1165 : :
1166 : 2 : update_bb_for_insn_chain (NEXT_INSN (BB_END (src)),
1167 : : PREV_INSN (barrier), src);
1168 : :
1169 : 2 : SET_NEXT_INSN (PREV_INSN (new_insn)) = NEXT_INSN (new_insn);
1170 : 2 : SET_PREV_INSN (NEXT_INSN (new_insn)) = PREV_INSN (new_insn);
1171 : :
1172 : 2 : SET_NEXT_INSN (new_insn) = barrier;
1173 : 2 : SET_NEXT_INSN (PREV_INSN (barrier)) = new_insn;
1174 : :
1175 : 2 : SET_PREV_INSN (new_insn) = PREV_INSN (barrier);
1176 : 2 : SET_PREV_INSN (barrier) = new_insn;
1177 : : }
1178 : : }
1179 : : }
1180 : :
1181 : : /* Keep only one edge out and set proper flags. */
1182 : 5168048 : if (!single_succ_p (src))
1183 : 145874 : remove_edge (e);
1184 : 5168048 : gcc_assert (single_succ_p (src));
1185 : :
1186 : 5168048 : e = single_succ_edge (src);
1187 : 5168048 : if (fallthru)
1188 : 4641526 : e->flags = EDGE_FALLTHRU;
1189 : : else
1190 : 526522 : e->flags = 0;
1191 : :
1192 : 5168048 : e->probability = profile_probability::always ();
1193 : :
1194 : 5168048 : if (e->dest != target)
1195 : 726777 : redirect_edge_succ (e, target);
1196 : : return e;
1197 : : }
1198 : :
1199 : : /* Subroutine of redirect_branch_edge that tries to patch the jump
1200 : : instruction INSN so that it reaches block NEW. Do this
1201 : : only when it originally reached block OLD. Return true if this
1202 : : worked or the original target wasn't OLD, return false if redirection
1203 : : doesn't work. */
1204 : :
1205 : : static bool
1206 : 6848646 : patch_jump_insn (rtx_insn *insn, rtx_insn *old_label, basic_block new_bb)
1207 : : {
1208 : 6848646 : rtx_jump_table_data *table;
1209 : 6848646 : rtx tmp;
1210 : : /* Recognize a tablejump and adjust all matching cases. */
1211 : 6848646 : if (tablejump_p (insn, NULL, &table))
1212 : : {
1213 : 20104 : rtvec vec;
1214 : 20104 : int j;
1215 : 20104 : rtx_code_label *new_label = block_label (new_bb);
1216 : :
1217 : 20104 : if (new_bb == EXIT_BLOCK_PTR_FOR_FN (cfun))
1218 : : return false;
1219 : 20104 : vec = table->get_labels ();
1220 : :
1221 : 509029 : for (j = GET_NUM_ELEM (vec) - 1; j >= 0; --j)
1222 : 488925 : if (XEXP (RTVEC_ELT (vec, j), 0) == old_label)
1223 : : {
1224 : 104073 : RTVEC_ELT (vec, j) = gen_rtx_LABEL_REF (Pmode, new_label);
1225 : 98093 : --LABEL_NUSES (old_label);
1226 : 98093 : ++LABEL_NUSES (new_label);
1227 : : }
1228 : :
1229 : : /* Handle casesi dispatch insns. */
1230 : 20104 : if ((tmp = tablejump_casesi_pattern (insn)) != NULL_RTX
1231 : 20104 : && label_ref_label (XEXP (SET_SRC (tmp), 2)) == old_label)
1232 : : {
1233 : 0 : XEXP (SET_SRC (tmp), 2) = gen_rtx_LABEL_REF (Pmode,
1234 : : new_label);
1235 : 0 : --LABEL_NUSES (old_label);
1236 : 0 : ++LABEL_NUSES (new_label);
1237 : : }
1238 : : }
1239 : 6828542 : else if ((tmp = extract_asm_operands (PATTERN (insn))) != NULL)
1240 : : {
1241 : 356 : int i, n = ASM_OPERANDS_LABEL_LENGTH (tmp);
1242 : 356 : rtx note;
1243 : :
1244 : 356 : if (new_bb == EXIT_BLOCK_PTR_FOR_FN (cfun))
1245 : : return false;
1246 : 356 : rtx_code_label *new_label = block_label (new_bb);
1247 : :
1248 : 965 : for (i = 0; i < n; ++i)
1249 : : {
1250 : 609 : rtx old_ref = ASM_OPERANDS_LABEL (tmp, i);
1251 : 609 : gcc_assert (GET_CODE (old_ref) == LABEL_REF);
1252 : 609 : if (XEXP (old_ref, 0) == old_label)
1253 : : {
1254 : 706 : ASM_OPERANDS_LABEL (tmp, i)
1255 : 353 : = gen_rtx_LABEL_REF (Pmode, new_label);
1256 : 353 : --LABEL_NUSES (old_label);
1257 : 353 : ++LABEL_NUSES (new_label);
1258 : : }
1259 : : }
1260 : :
1261 : 356 : if (JUMP_LABEL (insn) == old_label)
1262 : : {
1263 : 266 : JUMP_LABEL (insn) = new_label;
1264 : 266 : note = find_reg_note (insn, REG_LABEL_TARGET, new_label);
1265 : 266 : if (note)
1266 : 0 : remove_note (insn, note);
1267 : : }
1268 : : else
1269 : : {
1270 : 90 : note = find_reg_note (insn, REG_LABEL_TARGET, old_label);
1271 : 90 : if (note)
1272 : 82 : remove_note (insn, note);
1273 : 90 : if (JUMP_LABEL (insn) != new_label
1274 : 90 : && !find_reg_note (insn, REG_LABEL_TARGET, new_label))
1275 : 83 : add_reg_note (insn, REG_LABEL_TARGET, new_label);
1276 : : }
1277 : 712 : while ((note = find_reg_note (insn, REG_LABEL_OPERAND, old_label))
1278 : 356 : != NULL_RTX)
1279 : 0 : XEXP (note, 0) = new_label;
1280 : : }
1281 : : else
1282 : : {
1283 : : /* ?? We may play the games with moving the named labels from
1284 : : one basic block to the other in case only one computed_jump is
1285 : : available. */
1286 : 6828186 : if (computed_jump_p (insn)
1287 : : /* A return instruction can't be redirected. */
1288 : 6828186 : || returnjump_p (insn))
1289 : 0 : return false;
1290 : :
1291 : 6828186 : if (!currently_expanding_to_rtl || JUMP_LABEL (insn) == old_label)
1292 : : {
1293 : : /* If the insn doesn't go where we think, we're confused. */
1294 : 6798647 : gcc_assert (JUMP_LABEL (insn) == old_label);
1295 : :
1296 : : /* If the substitution doesn't succeed, die. This can happen
1297 : : if the back end emitted unrecognizable instructions or if
1298 : : target is exit block on some arches. Or for crossing
1299 : : jumps. */
1300 : 6798647 : if (!redirect_jump (as_a <rtx_jump_insn *> (insn),
1301 : 6798647 : block_label (new_bb), 0))
1302 : : {
1303 : 0 : gcc_assert (new_bb == EXIT_BLOCK_PTR_FOR_FN (cfun)
1304 : : || CROSSING_JUMP_P (insn));
1305 : : return false;
1306 : : }
1307 : : }
1308 : : }
1309 : : return true;
1310 : : }
1311 : :
1312 : :
1313 : : /* Redirect edge representing branch of (un)conditional jump or tablejump,
1314 : : NULL on failure */
1315 : : static edge
1316 : 15472681 : redirect_branch_edge (edge e, basic_block target)
1317 : : {
1318 : 15472681 : rtx_insn *old_label = BB_HEAD (e->dest);
1319 : 15472681 : basic_block src = e->src;
1320 : 15472681 : rtx_insn *insn = BB_END (src);
1321 : :
1322 : : /* We can only redirect non-fallthru edges of jump insn. */
1323 : 15472681 : if (e->flags & EDGE_FALLTHRU)
1324 : : return NULL;
1325 : 6804628 : else if (!JUMP_P (insn) && !currently_expanding_to_rtl)
1326 : : return NULL;
1327 : :
1328 : 6804628 : if (!currently_expanding_to_rtl)
1329 : : {
1330 : 6253454 : if (!patch_jump_insn (as_a <rtx_jump_insn *> (insn), old_label, target))
1331 : : return NULL;
1332 : : }
1333 : : else
1334 : : /* When expanding this BB might actually contain multiple
1335 : : jumps (i.e. not yet split by find_many_sub_basic_blocks).
1336 : : Redirect all of those that match our label. */
1337 : 8182170 : FOR_BB_INSNS (src, insn)
1338 : 7630996 : if (JUMP_P (insn) && !patch_jump_insn (as_a <rtx_jump_insn *> (insn),
1339 : : old_label, target))
1340 : : return NULL;
1341 : :
1342 : 6804628 : if (dump_file)
1343 : 846 : fprintf (dump_file, "Edge %i->%i redirected to %i\n",
1344 : 846 : e->src->index, e->dest->index, target->index);
1345 : :
1346 : 6804628 : if (e->dest != target)
1347 : 6804628 : e = redirect_edge_succ_nodup (e, target);
1348 : :
1349 : : return e;
1350 : : }
1351 : :
1352 : : /* Called when edge E has been redirected to a new destination,
1353 : : in order to update the region crossing flag on the edge and
1354 : : jump. */
1355 : :
1356 : : static void
1357 : 18772690 : fixup_partition_crossing (edge e)
1358 : : {
1359 : 18772690 : if (e->src == ENTRY_BLOCK_PTR_FOR_FN (cfun) || e->dest
1360 : 18772690 : == EXIT_BLOCK_PTR_FOR_FN (cfun))
1361 : : return;
1362 : : /* If we redirected an existing edge, it may already be marked
1363 : : crossing, even though the new src is missing a reg crossing note.
1364 : : But make sure reg crossing note doesn't already exist before
1365 : : inserting. */
1366 : 18771563 : if (BB_PARTITION (e->src) != BB_PARTITION (e->dest))
1367 : : {
1368 : 108762 : e->flags |= EDGE_CROSSING;
1369 : 108762 : if (JUMP_P (BB_END (e->src)))
1370 : 108762 : CROSSING_JUMP_P (BB_END (e->src)) = 1;
1371 : : }
1372 : 18662801 : else if (BB_PARTITION (e->src) == BB_PARTITION (e->dest))
1373 : : {
1374 : 18662801 : e->flags &= ~EDGE_CROSSING;
1375 : : /* Remove the section crossing note from jump at end of
1376 : : src if it exists, and if no other successors are
1377 : : still crossing. */
1378 : 18662801 : if (JUMP_P (BB_END (e->src)) && CROSSING_JUMP_P (BB_END (e->src)))
1379 : : {
1380 : 179826 : bool has_crossing_succ = false;
1381 : 179826 : edge e2;
1382 : 179826 : edge_iterator ei;
1383 : 306362 : FOR_EACH_EDGE (e2, ei, e->src->succs)
1384 : : {
1385 : 254550 : has_crossing_succ |= (e2->flags & EDGE_CROSSING);
1386 : 254550 : if (has_crossing_succ)
1387 : : break;
1388 : : }
1389 : 179826 : if (!has_crossing_succ)
1390 : 51812 : CROSSING_JUMP_P (BB_END (e->src)) = 0;
1391 : : }
1392 : : }
1393 : : }
1394 : :
1395 : : /* Called when block BB has been reassigned to the cold partition,
1396 : : because it is now dominated by another cold block,
1397 : : to ensure that the region crossing attributes are updated. */
1398 : :
1399 : : static void
1400 : 319 : fixup_new_cold_bb (basic_block bb)
1401 : : {
1402 : 319 : edge e;
1403 : 319 : edge_iterator ei;
1404 : :
1405 : : /* This is called when a hot bb is found to now be dominated
1406 : : by a cold bb and therefore needs to become cold. Therefore,
1407 : : its preds will no longer be region crossing. Any non-dominating
1408 : : preds that were previously hot would also have become cold
1409 : : in the caller for the same region. Any preds that were previously
1410 : : region-crossing will be adjusted in fixup_partition_crossing. */
1411 : 653 : FOR_EACH_EDGE (e, ei, bb->preds)
1412 : : {
1413 : 334 : fixup_partition_crossing (e);
1414 : : }
1415 : :
1416 : : /* Possibly need to make bb's successor edges region crossing,
1417 : : or remove stale region crossing. */
1418 : 656 : FOR_EACH_EDGE (e, ei, bb->succs)
1419 : : {
1420 : : /* We can't have fall-through edges across partition boundaries.
1421 : : Note that force_nonfallthru will do any necessary partition
1422 : : boundary fixup by calling fixup_partition_crossing itself. */
1423 : 337 : if ((e->flags & EDGE_FALLTHRU)
1424 : 292 : && BB_PARTITION (bb) != BB_PARTITION (e->dest)
1425 : 268 : && e->dest != EXIT_BLOCK_PTR_FOR_FN (cfun))
1426 : 0 : force_nonfallthru (e);
1427 : : else
1428 : 337 : fixup_partition_crossing (e);
1429 : : }
1430 : 319 : }
1431 : :
1432 : : /* Attempt to change code to redirect edge E to TARGET. Don't do that on
1433 : : expense of adding new instructions or reordering basic blocks.
1434 : :
1435 : : Function can be also called with edge destination equivalent to the TARGET.
1436 : : Then it should try the simplifications and do nothing if none is possible.
1437 : :
1438 : : Return edge representing the branch if transformation succeeded. Return NULL
1439 : : on failure.
1440 : : We still return NULL in case E already destinated TARGET and we didn't
1441 : : managed to simplify instruction stream. */
1442 : :
1443 : : static edge
1444 : 11149382 : rtl_redirect_edge_and_branch (edge e, basic_block target)
1445 : : {
1446 : 11149382 : edge ret;
1447 : 11149382 : basic_block src = e->src;
1448 : 11149382 : basic_block dest = e->dest;
1449 : :
1450 : 11149382 : if (e->flags & (EDGE_ABNORMAL_CALL | EDGE_EH))
1451 : : return NULL;
1452 : :
1453 : 11149382 : if (dest == target)
1454 : : return e;
1455 : :
1456 : 11149377 : if ((ret = try_redirect_by_replacing_jump (e, target, false)) != NULL)
1457 : : {
1458 : 591095 : df_set_bb_dirty (src);
1459 : 591095 : fixup_partition_crossing (ret);
1460 : 591095 : return ret;
1461 : : }
1462 : :
1463 : 10558282 : ret = redirect_branch_edge (e, target);
1464 : 10558282 : if (!ret)
1465 : : return NULL;
1466 : :
1467 : 1890229 : df_set_bb_dirty (src);
1468 : 1890229 : fixup_partition_crossing (ret);
1469 : 1890229 : return ret;
1470 : : }
1471 : :
1472 : : /* Emit a barrier after BB, into the footer if we are in CFGLAYOUT mode. */
1473 : :
1474 : : void
1475 : 5578561 : emit_barrier_after_bb (basic_block bb)
1476 : : {
1477 : 5578561 : rtx_barrier *barrier = emit_barrier_after (BB_END (bb));
1478 : 5578561 : gcc_assert (current_ir_type () == IR_RTL_CFGRTL
1479 : : || current_ir_type () == IR_RTL_CFGLAYOUT);
1480 : 5578561 : if (current_ir_type () == IR_RTL_CFGLAYOUT)
1481 : : {
1482 : 70103 : rtx_insn *insn = unlink_insn_chain (barrier, barrier);
1483 : :
1484 : 70103 : if (BB_FOOTER (bb))
1485 : : {
1486 : : rtx_insn *footer_tail = BB_FOOTER (bb);
1487 : :
1488 : 2601 : while (NEXT_INSN (footer_tail))
1489 : : footer_tail = NEXT_INSN (footer_tail);
1490 : 2601 : if (!BARRIER_P (footer_tail))
1491 : : {
1492 : 0 : SET_NEXT_INSN (footer_tail) = insn;
1493 : 0 : SET_PREV_INSN (insn) = footer_tail;
1494 : : }
1495 : : }
1496 : : else
1497 : 67502 : BB_FOOTER (bb) = insn;
1498 : : }
1499 : 5578561 : }
1500 : :
1501 : : /* Like force_nonfallthru below, but additionally performs redirection
1502 : : Used by redirect_edge_and_branch_force. JUMP_LABEL is used only
1503 : : when redirecting to the EXIT_BLOCK, it is either ret_rtx or
1504 : : simple_return_rtx, indicating which kind of returnjump to create.
1505 : : It should be NULL otherwise. */
1506 : :
1507 : : basic_block
1508 : 5450757 : force_nonfallthru_and_redirect (edge e, basic_block target, rtx jump_label)
1509 : : {
1510 : 5450757 : basic_block jump_block, new_bb = NULL, src = e->src;
1511 : 5450757 : rtx note;
1512 : 5450757 : edge new_edge;
1513 : 5450757 : int abnormal_edge_flags = 0;
1514 : 5450757 : bool asm_goto_edge = false;
1515 : :
1516 : : /* In the case the last instruction is conditional jump to the next
1517 : : instruction, first redirect the jump itself and then continue
1518 : : by creating a basic block afterwards to redirect fallthru edge. */
1519 : 5450757 : if (e->src != ENTRY_BLOCK_PTR_FOR_FN (cfun)
1520 : 5450751 : && e->dest != EXIT_BLOCK_PTR_FOR_FN (cfun)
1521 : 5450751 : && any_condjump_p (BB_END (e->src))
1522 : 6309960 : && JUMP_LABEL (BB_END (e->src)) == BB_HEAD (e->dest))
1523 : : {
1524 : 0 : rtx note;
1525 : 0 : edge b = unchecked_make_edge (e->src, target, 0);
1526 : 0 : bool redirected;
1527 : :
1528 : 0 : redirected = redirect_jump (as_a <rtx_jump_insn *> (BB_END (e->src)),
1529 : 0 : block_label (target), 0);
1530 : 0 : gcc_assert (redirected);
1531 : :
1532 : 0 : note = find_reg_note (BB_END (e->src), REG_BR_PROB, NULL_RTX);
1533 : 0 : if (note)
1534 : : {
1535 : 0 : int prob = XINT (note, 0);
1536 : :
1537 : 0 : b->probability = profile_probability::from_reg_br_prob_note (prob);
1538 : 0 : e->probability -= e->probability;
1539 : : }
1540 : : }
1541 : :
1542 : 5450757 : if (e->flags & EDGE_ABNORMAL)
1543 : : {
1544 : : /* Irritating special case - fallthru edge to the same block as abnormal
1545 : : edge.
1546 : : We can't redirect abnormal edge, but we still can split the fallthru
1547 : : one and create separate abnormal edge to original destination.
1548 : : This allows bb-reorder to make such edge non-fallthru. */
1549 : 0 : gcc_assert (e->dest == target);
1550 : 0 : abnormal_edge_flags = e->flags & ~EDGE_FALLTHRU;
1551 : 0 : e->flags &= EDGE_FALLTHRU;
1552 : : }
1553 : : else
1554 : : {
1555 : 5450757 : gcc_assert (e->flags & EDGE_FALLTHRU);
1556 : 5450757 : if (e->src == ENTRY_BLOCK_PTR_FOR_FN (cfun))
1557 : : {
1558 : : /* We can't redirect the entry block. Create an empty block
1559 : : at the start of the function which we use to add the new
1560 : : jump. */
1561 : 6 : edge tmp;
1562 : 6 : edge_iterator ei;
1563 : 6 : bool found = false;
1564 : :
1565 : 6 : basic_block bb = create_basic_block (BB_HEAD (e->dest), NULL,
1566 : : ENTRY_BLOCK_PTR_FOR_FN (cfun));
1567 : 6 : bb->count = ENTRY_BLOCK_PTR_FOR_FN (cfun)->count;
1568 : :
1569 : : /* Make sure new block ends up in correct hot/cold section. */
1570 : 6 : BB_COPY_PARTITION (bb, e->dest);
1571 : :
1572 : : /* Change the existing edge's source to be the new block, and add
1573 : : a new edge from the entry block to the new block. */
1574 : 6 : e->src = bb;
1575 : 6 : for (ei = ei_start (ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs);
1576 : 6 : (tmp = ei_safe_edge (ei)); )
1577 : : {
1578 : 6 : if (tmp == e)
1579 : : {
1580 : 6 : ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs->unordered_remove (ei.index);
1581 : 6 : found = true;
1582 : 6 : break;
1583 : : }
1584 : : else
1585 : 0 : ei_next (&ei);
1586 : : }
1587 : :
1588 : 0 : gcc_assert (found);
1589 : :
1590 : 6 : vec_safe_push (bb->succs, e);
1591 : 6 : make_single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun), bb,
1592 : : EDGE_FALLTHRU);
1593 : : }
1594 : : }
1595 : :
1596 : : /* If e->src ends with asm goto, see if any of the ASM_OPERANDS_LABELs
1597 : : don't point to the target or fallthru label. */
1598 : 5450757 : if (JUMP_P (BB_END (e->src))
1599 : 859317 : && target != EXIT_BLOCK_PTR_FOR_FN (cfun)
1600 : 858701 : && (e->flags & EDGE_FALLTHRU)
1601 : 6309458 : && (note = extract_asm_operands (PATTERN (BB_END (e->src)))))
1602 : : {
1603 : 114 : int i, n = ASM_OPERANDS_LABEL_LENGTH (note);
1604 : 114 : bool adjust_jump_target = false;
1605 : :
1606 : 288 : for (i = 0; i < n; ++i)
1607 : : {
1608 : 174 : if (XEXP (ASM_OPERANDS_LABEL (note, i), 0) == BB_HEAD (e->dest))
1609 : : {
1610 : 63 : LABEL_NUSES (XEXP (ASM_OPERANDS_LABEL (note, i), 0))--;
1611 : 63 : XEXP (ASM_OPERANDS_LABEL (note, i), 0) = block_label (target);
1612 : 63 : LABEL_NUSES (XEXP (ASM_OPERANDS_LABEL (note, i), 0))++;
1613 : 63 : adjust_jump_target = true;
1614 : : }
1615 : 174 : if (XEXP (ASM_OPERANDS_LABEL (note, i), 0) == BB_HEAD (target))
1616 : 63 : asm_goto_edge = true;
1617 : : }
1618 : 114 : if (adjust_jump_target)
1619 : : {
1620 : 62 : rtx_insn *insn = BB_END (e->src);
1621 : 62 : rtx note;
1622 : 62 : rtx_insn *old_label = BB_HEAD (e->dest);
1623 : 62 : rtx_insn *new_label = BB_HEAD (target);
1624 : :
1625 : 62 : if (JUMP_LABEL (insn) == old_label)
1626 : : {
1627 : 49 : JUMP_LABEL (insn) = new_label;
1628 : 49 : note = find_reg_note (insn, REG_LABEL_TARGET, new_label);
1629 : 49 : if (note)
1630 : 0 : remove_note (insn, note);
1631 : : }
1632 : : else
1633 : : {
1634 : 13 : note = find_reg_note (insn, REG_LABEL_TARGET, old_label);
1635 : 13 : if (note)
1636 : 13 : remove_note (insn, note);
1637 : 13 : if (JUMP_LABEL (insn) != new_label
1638 : 13 : && !find_reg_note (insn, REG_LABEL_TARGET, new_label))
1639 : 13 : add_reg_note (insn, REG_LABEL_TARGET, new_label);
1640 : : }
1641 : 124 : while ((note = find_reg_note (insn, REG_LABEL_OPERAND, old_label))
1642 : 62 : != NULL_RTX)
1643 : 0 : XEXP (note, 0) = new_label;
1644 : : }
1645 : : }
1646 : :
1647 : 5450757 : if (EDGE_COUNT (e->src->succs) >= 2 || abnormal_edge_flags || asm_goto_edge)
1648 : : {
1649 : 1060614 : rtx_insn *new_head;
1650 : 1060614 : profile_count count = e->count ();
1651 : 1060614 : profile_probability probability = e->probability;
1652 : : /* Create the new structures. */
1653 : :
1654 : : /* If the old block ended with a tablejump, skip its table
1655 : : by searching forward from there. Otherwise start searching
1656 : : forward from the last instruction of the old block. */
1657 : 1060614 : rtx_jump_table_data *table;
1658 : 1060614 : if (tablejump_p (BB_END (e->src), NULL, &table))
1659 : 0 : new_head = table;
1660 : : else
1661 : 1060614 : new_head = BB_END (e->src);
1662 : 1060614 : new_head = NEXT_INSN (new_head);
1663 : :
1664 : 1060614 : jump_block = create_basic_block (new_head, NULL, e->src);
1665 : 1060614 : jump_block->count = count;
1666 : :
1667 : : /* Make sure new block ends up in correct hot/cold section. */
1668 : :
1669 : 1060614 : BB_COPY_PARTITION (jump_block, e->src);
1670 : :
1671 : : /* Wire edge in. */
1672 : 1060614 : new_edge = make_edge (e->src, jump_block, EDGE_FALLTHRU);
1673 : 1060614 : new_edge->probability = probability;
1674 : :
1675 : : /* Redirect old edge. */
1676 : 1060614 : redirect_edge_pred (e, jump_block);
1677 : 1060614 : e->probability = profile_probability::always ();
1678 : :
1679 : : /* If e->src was previously region crossing, it no longer is
1680 : : and the reg crossing note should be removed. */
1681 : 1060614 : fixup_partition_crossing (new_edge);
1682 : :
1683 : : /* If asm goto has any label refs to target's label,
1684 : : add also edge from asm goto bb to target. */
1685 : 1060614 : if (asm_goto_edge)
1686 : : {
1687 : 62 : new_edge->probability /= 2;
1688 : 62 : jump_block->count /= 2;
1689 : 124 : edge new_edge2 = make_edge (new_edge->src, target,
1690 : 62 : e->flags & ~EDGE_FALLTHRU);
1691 : 62 : new_edge2->probability = probability - new_edge->probability;
1692 : : }
1693 : :
1694 : 1060614 : new_bb = jump_block;
1695 : : }
1696 : : else
1697 : : jump_block = e->src;
1698 : :
1699 : 5450757 : const location_t loc = e->goto_locus;
1700 : 5450757 : e->flags &= ~EDGE_FALLTHRU;
1701 : 5450757 : if (target == EXIT_BLOCK_PTR_FOR_FN (cfun))
1702 : : {
1703 : 843 : if (jump_label == ret_rtx)
1704 : 0 : emit_jump_insn_after_setloc (targetm.gen_return (),
1705 : 0 : BB_END (jump_block), loc);
1706 : : else
1707 : : {
1708 : 843 : gcc_assert (jump_label == simple_return_rtx);
1709 : 843 : emit_jump_insn_after_setloc (targetm.gen_simple_return (),
1710 : 843 : BB_END (jump_block), loc);
1711 : : }
1712 : 843 : set_return_jump_label (BB_END (jump_block));
1713 : : }
1714 : : else
1715 : : {
1716 : 5449914 : rtx_code_label *label = block_label (target);
1717 : 5449914 : emit_jump_insn_after_setloc (targetm.gen_jump (label),
1718 : 5449914 : BB_END (jump_block), loc);
1719 : 5449914 : JUMP_LABEL (BB_END (jump_block)) = label;
1720 : 5449914 : LABEL_NUSES (label)++;
1721 : : }
1722 : :
1723 : : /* We might be in cfg layout mode, and if so, the following routine will
1724 : : insert the barrier correctly. */
1725 : 5450757 : emit_barrier_after_bb (jump_block);
1726 : 5450757 : redirect_edge_succ_nodup (e, target);
1727 : :
1728 : 5450757 : if (abnormal_edge_flags)
1729 : 0 : make_edge (src, target, abnormal_edge_flags);
1730 : :
1731 : 5450757 : df_mark_solutions_dirty ();
1732 : 5450757 : fixup_partition_crossing (e);
1733 : 5450757 : return new_bb;
1734 : : }
1735 : :
1736 : : /* Edge E is assumed to be fallthru edge. Emit needed jump instruction
1737 : : (and possibly create new basic block) to make edge non-fallthru.
1738 : : Return newly created BB or NULL if none. */
1739 : :
1740 : : static basic_block
1741 : 871511 : rtl_force_nonfallthru (edge e)
1742 : : {
1743 : 871511 : return force_nonfallthru_and_redirect (e, e->dest, NULL_RTX);
1744 : : }
1745 : :
1746 : : /* Redirect edge even at the expense of creating new jump insn or
1747 : : basic block. Return new basic block if created, NULL otherwise.
1748 : : Conversion must be possible. */
1749 : :
1750 : : static basic_block
1751 : 508190 : rtl_redirect_edge_and_branch_force (edge e, basic_block target)
1752 : : {
1753 : 508190 : if (redirect_edge_and_branch (e, target)
1754 : 508190 : || e->dest == target)
1755 : : return NULL;
1756 : :
1757 : : /* In case the edge redirection failed, try to force it to be non-fallthru
1758 : : and redirect newly created simplejump. */
1759 : 420604 : df_set_bb_dirty (e->src);
1760 : 420604 : return force_nonfallthru_and_redirect (e, target, NULL_RTX);
1761 : : }
1762 : :
1763 : : /* The given edge should potentially be a fallthru edge. If that is in
1764 : : fact true, delete the jump and barriers that are in the way. */
1765 : :
1766 : : static void
1767 : 777132 : rtl_tidy_fallthru_edge (edge e)
1768 : : {
1769 : 777132 : rtx_insn *q;
1770 : 777132 : basic_block b = e->src, c = b->next_bb;
1771 : :
1772 : : /* ??? In a late-running flow pass, other folks may have deleted basic
1773 : : blocks by nopping out blocks, leaving multiple BARRIERs between here
1774 : : and the target label. They ought to be chastised and fixed.
1775 : :
1776 : : We can also wind up with a sequence of undeletable labels between
1777 : : one block and the next.
1778 : :
1779 : : So search through a sequence of barriers, labels, and notes for
1780 : : the head of block C and assert that we really do fall through. */
1781 : :
1782 : 1576197 : for (q = NEXT_INSN (BB_END (b)); q != BB_HEAD (c); q = NEXT_INSN (q))
1783 : 21933 : if (NONDEBUG_INSN_P (q))
1784 : : return;
1785 : :
1786 : : /* Remove what will soon cease being the jump insn from the source block.
1787 : : If block B consisted only of this single jump, turn it into a deleted
1788 : : note. */
1789 : 777132 : q = BB_END (b);
1790 : 777132 : if (JUMP_P (q)
1791 : 29207 : && onlyjump_p (q)
1792 : 806326 : && (any_uncondjump_p (q)
1793 : 7720 : || single_succ_p (b)))
1794 : : {
1795 : 21521 : rtx_insn *label;
1796 : 21521 : rtx_jump_table_data *table;
1797 : :
1798 : 21521 : if (tablejump_p (q, &label, &table))
1799 : : {
1800 : : /* The label is likely mentioned in some instruction before
1801 : : the tablejump and might not be DCEd, so turn it into
1802 : : a note instead and move before the tablejump that is going to
1803 : : be deleted. */
1804 : 0 : const char *name = LABEL_NAME (label);
1805 : 0 : PUT_CODE (label, NOTE);
1806 : 0 : NOTE_KIND (label) = NOTE_INSN_DELETED_LABEL;
1807 : 0 : NOTE_DELETED_LABEL_NAME (label) = name;
1808 : 0 : reorder_insns (label, label, PREV_INSN (q));
1809 : 0 : delete_insn (table);
1810 : : }
1811 : :
1812 : 21521 : q = PREV_INSN (q);
1813 : : }
1814 : : /* Unconditional jumps with side-effects (i.e. which we can't just delete
1815 : : together with the barrier) should never have a fallthru edge. */
1816 : 755611 : else if (JUMP_P (q) && any_uncondjump_p (q))
1817 : : return;
1818 : :
1819 : : /* Selectively unlink the sequence. */
1820 : 777132 : if (q != PREV_INSN (BB_HEAD (c)))
1821 : 21681 : delete_insn_chain (NEXT_INSN (q), PREV_INSN (BB_HEAD (c)), false);
1822 : :
1823 : 777132 : e->flags |= EDGE_FALLTHRU;
1824 : : }
1825 : :
1826 : : /* Should move basic block BB after basic block AFTER. NIY. */
1827 : :
1828 : : static bool
1829 : 670558 : rtl_move_block_after (basic_block bb ATTRIBUTE_UNUSED,
1830 : : basic_block after ATTRIBUTE_UNUSED)
1831 : : {
1832 : 670558 : return false;
1833 : : }
1834 : :
1835 : : /* Locate the last bb in the same partition as START_BB. */
1836 : :
1837 : : static basic_block
1838 : 34186 : last_bb_in_partition (basic_block start_bb)
1839 : : {
1840 : 34186 : basic_block bb;
1841 : 22462452 : FOR_BB_BETWEEN (bb, start_bb, EXIT_BLOCK_PTR_FOR_FN (cfun), next_bb)
1842 : : {
1843 : 22462452 : if (BB_PARTITION (start_bb) != BB_PARTITION (bb->next_bb))
1844 : : return bb;
1845 : : }
1846 : : /* Return bb before the exit block. */
1847 : 0 : return bb->prev_bb;
1848 : : }
1849 : :
1850 : : /* Split a (typically critical) edge. Return the new block.
1851 : : The edge must not be abnormal.
1852 : :
1853 : : ??? The code generally expects to be called on critical edges.
1854 : : The case of a block ending in an unconditional jump to a
1855 : : block with multiple predecessors is not handled optimally. */
1856 : :
1857 : : static basic_block
1858 : 1288128 : rtl_split_edge (edge edge_in)
1859 : : {
1860 : 1288128 : basic_block bb, new_bb;
1861 : 1288128 : rtx_insn *before;
1862 : :
1863 : : /* Abnormal edges cannot be split. */
1864 : 1288128 : gcc_assert (!(edge_in->flags & EDGE_ABNORMAL));
1865 : :
1866 : : /* We are going to place the new block in front of edge destination.
1867 : : Avoid existence of fallthru predecessors. */
1868 : 1288128 : if ((edge_in->flags & EDGE_FALLTHRU) == 0)
1869 : : {
1870 : 805188 : edge e = find_fallthru_edge (edge_in->dest->preds);
1871 : :
1872 : 805188 : if (e)
1873 : 628040 : force_nonfallthru (e);
1874 : : }
1875 : :
1876 : : /* Create the basic block note. */
1877 : 1288128 : if (edge_in->dest != EXIT_BLOCK_PTR_FOR_FN (cfun))
1878 : 1052531 : before = BB_HEAD (edge_in->dest);
1879 : : else
1880 : : before = NULL;
1881 : :
1882 : : /* If this is a fall through edge to the exit block, the blocks might be
1883 : : not adjacent, and the right place is after the source. */
1884 : 1288128 : if ((edge_in->flags & EDGE_FALLTHRU)
1885 : 482940 : && edge_in->dest == EXIT_BLOCK_PTR_FOR_FN (cfun))
1886 : : {
1887 : 235597 : before = NEXT_INSN (BB_END (edge_in->src));
1888 : 235597 : bb = create_basic_block (before, NULL, edge_in->src);
1889 : 235597 : BB_COPY_PARTITION (bb, edge_in->src);
1890 : 235597 : }
1891 : : else
1892 : : {
1893 : 1052531 : if (edge_in->src == ENTRY_BLOCK_PTR_FOR_FN (cfun))
1894 : : {
1895 : 75295 : bb = create_basic_block (before, NULL, edge_in->dest->prev_bb);
1896 : 75295 : BB_COPY_PARTITION (bb, edge_in->dest);
1897 : : }
1898 : : else
1899 : : {
1900 : 977236 : basic_block after = edge_in->dest->prev_bb;
1901 : : /* If this is post-bb reordering, and the edge crosses a partition
1902 : : boundary, the new block needs to be inserted in the bb chain
1903 : : at the end of the src partition (since we put the new bb into
1904 : : that partition, see below). Otherwise we may end up creating
1905 : : an extra partition crossing in the chain, which is illegal.
1906 : : It can't go after the src, because src may have a fall-through
1907 : : to a different block. */
1908 : 977236 : if (crtl->bb_reorder_complete
1909 : 63148 : && (edge_in->flags & EDGE_CROSSING))
1910 : : {
1911 : 34186 : after = last_bb_in_partition (edge_in->src);
1912 : 34186 : before = get_last_bb_insn (after);
1913 : : /* The instruction following the last bb in partition should
1914 : : be a barrier, since it cannot end in a fall-through. */
1915 : 34186 : gcc_checking_assert (BARRIER_P (before));
1916 : 34186 : before = NEXT_INSN (before);
1917 : : }
1918 : 977236 : bb = create_basic_block (before, NULL, after);
1919 : : /* Put the split bb into the src partition, to avoid creating
1920 : : a situation where a cold bb dominates a hot bb, in the case
1921 : : where src is cold and dest is hot. The src will dominate
1922 : : the new bb (whereas it might not have dominated dest). */
1923 : 977236 : BB_COPY_PARTITION (bb, edge_in->src);
1924 : : }
1925 : : }
1926 : :
1927 : 1288128 : make_single_succ_edge (bb, edge_in->dest, EDGE_FALLTHRU);
1928 : :
1929 : : /* Can't allow a region crossing edge to be fallthrough. */
1930 : 1288128 : if (BB_PARTITION (bb) != BB_PARTITION (edge_in->dest)
1931 : 72772 : && edge_in->dest != EXIT_BLOCK_PTR_FOR_FN (cfun))
1932 : : {
1933 : 41016 : new_bb = force_nonfallthru (single_succ_edge (bb));
1934 : 41016 : gcc_assert (!new_bb);
1935 : : }
1936 : :
1937 : : /* For non-fallthru edges, we must adjust the predecessor's
1938 : : jump instruction to target our new block. */
1939 : 1288128 : if ((edge_in->flags & EDGE_FALLTHRU) == 0)
1940 : : {
1941 : 805188 : edge redirected = redirect_edge_and_branch (edge_in, bb);
1942 : 805188 : gcc_assert (redirected);
1943 : : }
1944 : : else
1945 : : {
1946 : 482940 : if (edge_in->src != ENTRY_BLOCK_PTR_FOR_FN (cfun))
1947 : : {
1948 : : /* For asm goto even splitting of fallthru edge might
1949 : : need insn patching, as other labels might point to the
1950 : : old label. */
1951 : 407645 : rtx_insn *last = BB_END (edge_in->src);
1952 : 407645 : if (last
1953 : 407645 : && JUMP_P (last)
1954 : 188936 : && edge_in->dest != EXIT_BLOCK_PTR_FOR_FN (cfun)
1955 : 162515 : && (extract_asm_operands (PATTERN (last))
1956 : 162513 : || JUMP_LABEL (last) == before)
1957 : 407647 : && patch_jump_insn (last, before, bb))
1958 : 2 : df_set_bb_dirty (edge_in->src);
1959 : : }
1960 : 482940 : redirect_edge_succ (edge_in, bb);
1961 : : }
1962 : :
1963 : 1288128 : return bb;
1964 : : }
1965 : :
1966 : : /* Queue instructions for insertion on an edge between two basic blocks.
1967 : : The new instructions and basic blocks (if any) will not appear in the
1968 : : CFG until commit_edge_insertions is called. If there are already
1969 : : queued instructions on the edge, PATTERN is appended to them. */
1970 : :
1971 : : void
1972 : 5743817 : insert_insn_on_edge (rtx pattern, edge e)
1973 : : {
1974 : : /* We cannot insert instructions on an abnormal critical edge.
1975 : : It will be easier to find the culprit if we die now. */
1976 : 5743817 : gcc_assert (!((e->flags & EDGE_ABNORMAL) && EDGE_CRITICAL_P (e)));
1977 : :
1978 : 5743817 : if (e->insns.r == NULL_RTX)
1979 : 4844271 : start_sequence ();
1980 : : else
1981 : 899546 : push_to_sequence (e->insns.r);
1982 : :
1983 : 5743817 : emit_insn (pattern);
1984 : :
1985 : 5743817 : e->insns.r = end_sequence ();
1986 : 5743817 : }
1987 : :
1988 : : /* Like insert_insn_on_edge, but if there are already queued instructions
1989 : : on the edge, PATTERN is prepended to them. */
1990 : :
1991 : : void
1992 : 333 : prepend_insn_to_edge (rtx pattern, edge e)
1993 : : {
1994 : : /* We cannot insert instructions on an abnormal critical edge.
1995 : : It will be easier to find the culprit if we die now. */
1996 : 333 : gcc_assert (!((e->flags & EDGE_ABNORMAL) && EDGE_CRITICAL_P (e)));
1997 : :
1998 : 333 : start_sequence ();
1999 : :
2000 : 333 : emit_insn (pattern);
2001 : 333 : emit_insn (e->insns.r);
2002 : :
2003 : 333 : e->insns.r = end_sequence ();
2004 : 333 : }
2005 : :
2006 : : /* Update the CFG for the instructions queued on edge E. */
2007 : :
2008 : : void
2009 : 4812904 : commit_one_edge_insertion (edge e)
2010 : : {
2011 : 4812904 : rtx_insn *before = NULL, *after = NULL, *insns, *tmp, *last;
2012 : 4812904 : basic_block bb;
2013 : :
2014 : : /* Pull the insns off the edge now since the edge might go away. */
2015 : 4812904 : insns = e->insns.r;
2016 : 4812904 : e->insns.r = NULL;
2017 : :
2018 : : /* Allow the sequence to contain internal jumps, such as a memcpy loop
2019 : : or an allocation loop. If such a sequence is emitted during RTL
2020 : : expansion, we'll create the appropriate basic blocks later,
2021 : : at the end of the pass. But if such a sequence is emitted after
2022 : : initial expansion, we'll need to find the subblocks ourselves. */
2023 : 4812904 : bool contains_jump = false;
2024 : 4812904 : if (!currently_expanding_to_rtl)
2025 : 13345020 : for (rtx_insn *insn = insns; insn; insn = NEXT_INSN (insn))
2026 : 11451560 : if (JUMP_P (insn))
2027 : : {
2028 : 1585766 : rebuild_jump_labels_chain (insns);
2029 : 1585766 : contains_jump = true;
2030 : 1585766 : break;
2031 : : }
2032 : :
2033 : : /* Figure out where to put these insns. If the destination has
2034 : : one predecessor, insert there. Except for the exit block. */
2035 : 4812904 : if (single_pred_p (e->dest) && e->dest != EXIT_BLOCK_PTR_FOR_FN (cfun))
2036 : : {
2037 : 1599316 : bb = e->dest;
2038 : :
2039 : : /* Get the location correct wrt a code label, and "nice" wrt
2040 : : a basic block note, and before everything else. */
2041 : 1599316 : tmp = BB_HEAD (bb);
2042 : 1599316 : if (LABEL_P (tmp))
2043 : 82510 : tmp = NEXT_INSN (tmp);
2044 : 1599316 : if (NOTE_INSN_BASIC_BLOCK_P (tmp))
2045 : 1599316 : tmp = NEXT_INSN (tmp);
2046 : 1599316 : if (tmp == BB_HEAD (bb))
2047 : : before = tmp;
2048 : 1599316 : else if (tmp)
2049 : 1599316 : after = PREV_INSN (tmp);
2050 : : else
2051 : 0 : after = get_last_insn ();
2052 : : }
2053 : :
2054 : : /* If the source has one successor and the edge is not abnormal,
2055 : : insert there. Except for the entry block.
2056 : : Don't do this if the predecessor ends in a jump other than
2057 : : unconditional simple jump. E.g. for asm goto that points all
2058 : : its labels at the fallthru basic block, we can't insert instructions
2059 : : before the asm goto, as the asm goto can have various of side effects,
2060 : : and can't emit instructions after the asm goto, as it must end
2061 : : the basic block. */
2062 : 3213588 : else if ((e->flags & EDGE_ABNORMAL) == 0
2063 : 3213588 : && single_succ_p (e->src)
2064 : 2195543 : && e->src != ENTRY_BLOCK_PTR_FOR_FN (cfun)
2065 : 5407698 : && (!JUMP_P (BB_END (e->src))
2066 : 338807 : || simplejump_p (BB_END (e->src))))
2067 : : {
2068 : 2194110 : bb = e->src;
2069 : :
2070 : : /* It is possible to have a non-simple jump here. Consider a target
2071 : : where some forms of unconditional jumps clobber a register. This
2072 : : happens on the fr30 for example.
2073 : :
2074 : : We know this block has a single successor, so we can just emit
2075 : : the queued insns before the jump. */
2076 : 2194110 : if (JUMP_P (BB_END (bb)))
2077 : : before = BB_END (bb);
2078 : : else
2079 : : {
2080 : : /* We'd better be fallthru, or we've lost track of what's what. */
2081 : 1855303 : gcc_assert (e->flags & EDGE_FALLTHRU);
2082 : :
2083 : : after = BB_END (bb);
2084 : : }
2085 : : }
2086 : :
2087 : : /* Otherwise we must split the edge. */
2088 : : else
2089 : : {
2090 : 1019478 : bb = split_edge (e);
2091 : :
2092 : : /* If E crossed a partition boundary, we needed to make bb end in
2093 : : a region-crossing jump, even though it was originally fallthru. */
2094 : 1019478 : if (JUMP_P (BB_END (bb)))
2095 : : before = BB_END (bb);
2096 : : else
2097 : : after = BB_END (bb);
2098 : : }
2099 : :
2100 : : /* Now that we've found the spot, do the insertion. */
2101 : 1599316 : if (before)
2102 : : {
2103 : 379822 : emit_insn_before_noloc (insns, before, bb);
2104 : 379822 : last = prev_nonnote_insn (before);
2105 : : }
2106 : : else
2107 : 4433082 : last = emit_insn_after_noloc (insns, after, bb);
2108 : :
2109 : 4812904 : if (returnjump_p (last))
2110 : : {
2111 : : /* ??? Remove all outgoing edges from BB and add one for EXIT.
2112 : : This is not currently a problem because this only happens
2113 : : for the (single) epilogue, which already has a fallthru edge
2114 : : to EXIT. */
2115 : :
2116 : 1325967 : e = single_succ_edge (bb);
2117 : 2651934 : gcc_assert (e->dest == EXIT_BLOCK_PTR_FOR_FN (cfun)
2118 : : && single_succ_p (bb) && (e->flags & EDGE_FALLTHRU));
2119 : :
2120 : 1325967 : e->flags &= ~EDGE_FALLTHRU;
2121 : 1325967 : emit_barrier_after (last);
2122 : :
2123 : 1325967 : if (before)
2124 : 0 : delete_insn (before);
2125 : : }
2126 : : else
2127 : : /* Sequences inserted after RTL expansion are expected to be SESE,
2128 : : with only internal branches allowed. If the sequence jumps outside
2129 : : itself then we do not know how to add the associated edges here. */
2130 : 3486937 : gcc_assert (!JUMP_P (last) || currently_expanding_to_rtl);
2131 : :
2132 : 4812904 : if (contains_jump)
2133 : 1585766 : find_sub_basic_blocks (bb);
2134 : 4812904 : }
2135 : :
2136 : : /* Update the CFG for all queued instructions. */
2137 : :
2138 : : void
2139 : 4475073 : commit_edge_insertions (void)
2140 : : {
2141 : 4475073 : basic_block bb;
2142 : :
2143 : : /* Optimization passes that invoke this routine can cause hot blocks
2144 : : previously reached by both hot and cold blocks to become dominated only
2145 : : by cold blocks. This will cause the verification below to fail,
2146 : : and lead to now cold code in the hot section. In some cases this
2147 : : may only be visible after newly unreachable blocks are deleted,
2148 : : which will be done by fixup_partitions. */
2149 : 4475073 : fixup_partitions ();
2150 : :
2151 : 4475073 : if (!currently_expanding_to_rtl)
2152 : 3024444 : checking_verify_flow_info ();
2153 : :
2154 : 66835752 : FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun),
2155 : : EXIT_BLOCK_PTR_FOR_FN (cfun), next_bb)
2156 : : {
2157 : 62360679 : edge e;
2158 : 62360679 : edge_iterator ei;
2159 : :
2160 : 148971176 : FOR_EACH_EDGE (e, ei, bb->succs)
2161 : 86610497 : if (e->insns.r)
2162 : : {
2163 : 4773120 : if (currently_expanding_to_rtl)
2164 : 1333678 : rebuild_jump_labels_chain (e->insns.r);
2165 : 4773120 : commit_one_edge_insertion (e);
2166 : : }
2167 : : }
2168 : 4475073 : }
2169 : :
2170 : :
2171 : : /* Print out RTL-specific basic block information (live information
2172 : : at start and end with TDF_DETAILS). FLAGS are the TDF_* masks
2173 : : documented in dumpfile.h. */
2174 : :
2175 : : static void
2176 : 2762 : rtl_dump_bb (FILE *outf, basic_block bb, int indent, dump_flags_t flags)
2177 : : {
2178 : 2762 : char *s_indent;
2179 : :
2180 : 2762 : s_indent = (char *) alloca ((size_t) indent + 1);
2181 : 2762 : memset (s_indent, ' ', (size_t) indent);
2182 : 2762 : s_indent[indent] = '\0';
2183 : :
2184 : 2762 : if (df && (flags & TDF_DETAILS))
2185 : : {
2186 : 743 : df_dump_top (bb, outf);
2187 : 743 : putc ('\n', outf);
2188 : : }
2189 : :
2190 : 2762 : if (bb->index != ENTRY_BLOCK && bb->index != EXIT_BLOCK
2191 : 2762 : && rtl_bb_info_initialized_p (bb))
2192 : : {
2193 : 2188 : rtx_insn *last = BB_END (bb);
2194 : 2188 : if (last)
2195 : 2188 : last = NEXT_INSN (last);
2196 : 15822 : for (rtx_insn *insn = BB_HEAD (bb); insn != last; insn = NEXT_INSN (insn))
2197 : : {
2198 : 13634 : if (flags & TDF_DETAILS)
2199 : 4238 : df_dump_insn_top (insn, outf);
2200 : 13634 : if (! (flags & TDF_SLIM))
2201 : 13602 : print_rtl_single (outf, insn);
2202 : : else
2203 : 32 : dump_insn_slim (outf, insn);
2204 : 13634 : if (flags & TDF_DETAILS)
2205 : 4238 : df_dump_insn_bottom (insn, outf);
2206 : : }
2207 : : }
2208 : :
2209 : 2762 : if (df && (flags & TDF_DETAILS))
2210 : : {
2211 : 743 : df_dump_bottom (bb, outf);
2212 : 743 : putc ('\n', outf);
2213 : : }
2214 : :
2215 : 2762 : }
2216 : :
2217 : : /* Like dump_function_to_file, but for RTL. Print out dataflow information
2218 : : for the start of each basic block. FLAGS are the TDF_* masks documented
2219 : : in dumpfile.h. */
2220 : :
2221 : : void
2222 : 4147 : print_rtl_with_bb (FILE *outf, const rtx_insn *rtx_first, dump_flags_t flags)
2223 : : {
2224 : 4147 : const rtx_insn *tmp_rtx;
2225 : 4147 : if (rtx_first == 0)
2226 : 0 : fprintf (outf, "(nil)\n");
2227 : : else
2228 : : {
2229 : 4147 : enum bb_state { NOT_IN_BB, IN_ONE_BB, IN_MULTIPLE_BB };
2230 : 4147 : int max_uid = get_max_uid ();
2231 : 4147 : basic_block *start = XCNEWVEC (basic_block, max_uid);
2232 : 4147 : basic_block *end = XCNEWVEC (basic_block, max_uid);
2233 : 4147 : enum bb_state *in_bb_p = XCNEWVEC (enum bb_state, max_uid);
2234 : 4147 : basic_block bb;
2235 : :
2236 : : /* After freeing the CFG, we still have BLOCK_FOR_INSN set on most
2237 : : insns, but the CFG is not maintained so the basic block info
2238 : : is not reliable. Therefore it's omitted from the dumps. */
2239 : 4147 : if (! (cfun->curr_properties & PROP_cfg))
2240 : 976 : flags &= ~TDF_BLOCKS;
2241 : :
2242 : 4147 : if (df)
2243 : 3264 : df_dump_start (outf);
2244 : :
2245 : 4147 : if (cfun->curr_properties & PROP_cfg)
2246 : : {
2247 : 21785 : FOR_EACH_BB_REVERSE_FN (bb, cfun)
2248 : : {
2249 : 18614 : rtx_insn *x;
2250 : :
2251 : 18614 : start[INSN_UID (BB_HEAD (bb))] = bb;
2252 : 18614 : end[INSN_UID (BB_END (bb))] = bb;
2253 : 18614 : if (flags & TDF_BLOCKS)
2254 : : {
2255 : 5289 : for (x = BB_HEAD (bb); x != NULL_RTX; x = NEXT_INSN (x))
2256 : : {
2257 : 5289 : enum bb_state state = IN_MULTIPLE_BB;
2258 : :
2259 : 5289 : if (in_bb_p[INSN_UID (x)] == NOT_IN_BB)
2260 : 5289 : state = IN_ONE_BB;
2261 : 5289 : in_bb_p[INSN_UID (x)] = state;
2262 : :
2263 : 5289 : if (x == BB_END (bb))
2264 : : break;
2265 : : }
2266 : : }
2267 : : }
2268 : : }
2269 : :
2270 : 163282 : for (tmp_rtx = rtx_first; tmp_rtx != NULL; tmp_rtx = NEXT_INSN (tmp_rtx))
2271 : : {
2272 : 159135 : if (flags & TDF_BLOCKS)
2273 : : {
2274 : 6067 : bb = start[INSN_UID (tmp_rtx)];
2275 : 6067 : if (bb != NULL)
2276 : : {
2277 : 873 : dump_bb_info (outf, bb, 0, dump_flags, true, false);
2278 : 873 : if (df && (flags & TDF_DETAILS))
2279 : 582 : df_dump_top (bb, outf);
2280 : : }
2281 : :
2282 : 6067 : if (in_bb_p[INSN_UID (tmp_rtx)] == NOT_IN_BB
2283 : 778 : && !NOTE_P (tmp_rtx)
2284 : 6275 : && !BARRIER_P (tmp_rtx))
2285 : 0 : fprintf (outf, ";; Insn is not within a basic block\n");
2286 : 6067 : else if (in_bb_p[INSN_UID (tmp_rtx)] == IN_MULTIPLE_BB)
2287 : 0 : fprintf (outf, ";; Insn is in multiple basic blocks\n");
2288 : : }
2289 : :
2290 : 159135 : if (flags & TDF_DETAILS)
2291 : 17605 : df_dump_insn_top (tmp_rtx, outf);
2292 : 159135 : if (! (flags & TDF_SLIM))
2293 : 158599 : print_rtl_single (outf, tmp_rtx);
2294 : : else
2295 : 536 : dump_insn_slim (outf, tmp_rtx);
2296 : 159135 : if (flags & TDF_DETAILS)
2297 : 17605 : df_dump_insn_bottom (tmp_rtx, outf);
2298 : :
2299 : 159135 : bb = end[INSN_UID (tmp_rtx)];
2300 : 159135 : if (bb != NULL)
2301 : : {
2302 : 18614 : if (flags & TDF_BLOCKS)
2303 : : {
2304 : 873 : dump_bb_info (outf, bb, 0, dump_flags, false, true);
2305 : 873 : if (df && (flags & TDF_DETAILS))
2306 : 582 : df_dump_bottom (bb, outf);
2307 : 873 : putc ('\n', outf);
2308 : : }
2309 : : /* Emit a hint if the fallthrough target of current basic block
2310 : : isn't the one placed right next. */
2311 : 176825 : else if (EDGE_COUNT (bb->succs) > 0)
2312 : : {
2313 : 17690 : gcc_assert (BB_END (bb) == tmp_rtx);
2314 : 17690 : const rtx_insn *ninsn = NEXT_INSN (tmp_rtx);
2315 : : /* Bypass intervening deleted-insn notes and debug insns. */
2316 : 17690 : while (ninsn
2317 : 18804 : && !NONDEBUG_INSN_P (ninsn)
2318 : 40280 : && !start[INSN_UID (ninsn)])
2319 : 3786 : ninsn = NEXT_INSN (ninsn);
2320 : 17690 : edge e = find_fallthru_edge (bb->succs);
2321 : 17690 : if (e && ninsn)
2322 : : {
2323 : 13064 : basic_block dest = e->dest;
2324 : 13064 : if (start[INSN_UID (ninsn)] != dest)
2325 : 2194 : fprintf (outf, "%s ; pc falls through to BB %d\n",
2326 : : print_rtx_head, dest->index);
2327 : : }
2328 : : }
2329 : : }
2330 : : }
2331 : :
2332 : 4147 : free (start);
2333 : 4147 : free (end);
2334 : 4147 : free (in_bb_p);
2335 : : }
2336 : 4147 : }
2337 : :
2338 : : /* Update the branch probability of BB if a REG_BR_PROB is present. */
2339 : :
2340 : : void
2341 : 9636975 : update_br_prob_note (basic_block bb)
2342 : : {
2343 : 9636975 : rtx note;
2344 : 9636975 : note = find_reg_note (BB_END (bb), REG_BR_PROB, NULL_RTX);
2345 : 9636975 : if (!JUMP_P (BB_END (bb)) || !BRANCH_EDGE (bb)->probability.initialized_p ())
2346 : : {
2347 : 262859 : if (note)
2348 : : {
2349 : 3 : rtx *note_link, this_rtx;
2350 : :
2351 : 3 : note_link = ®_NOTES (BB_END (bb));
2352 : 6 : for (this_rtx = *note_link; this_rtx; this_rtx = XEXP (this_rtx, 1))
2353 : 6 : if (this_rtx == note)
2354 : : {
2355 : 3 : *note_link = XEXP (this_rtx, 1);
2356 : 3 : break;
2357 : : }
2358 : : }
2359 : 262859 : return;
2360 : : }
2361 : 9374116 : if (!note
2362 : 9374116 : || XINT (note, 0) == BRANCH_EDGE (bb)->probability.to_reg_br_prob_note ())
2363 : : return;
2364 : 197381 : XINT (note, 0) = BRANCH_EDGE (bb)->probability.to_reg_br_prob_note ();
2365 : : }
2366 : :
2367 : : /* Get the last insn associated with block BB (that includes barriers and
2368 : : tablejumps after BB). */
2369 : : rtx_insn *
2370 : 6906062 : get_last_bb_insn (basic_block bb)
2371 : : {
2372 : 6906062 : rtx_jump_table_data *table;
2373 : 6906062 : rtx_insn *tmp;
2374 : 6906062 : rtx_insn *end = BB_END (bb);
2375 : :
2376 : : /* Include any jump table following the basic block. */
2377 : 6906062 : if (tablejump_p (end, NULL, &table))
2378 : 8 : end = table;
2379 : :
2380 : : /* Include any barriers that may follow the basic block. */
2381 : 6906062 : tmp = next_nonnote_nondebug_insn_bb (end);
2382 : 14453418 : while (tmp && BARRIER_P (tmp))
2383 : : {
2384 : 641294 : end = tmp;
2385 : 641294 : tmp = next_nonnote_nondebug_insn_bb (end);
2386 : : }
2387 : :
2388 : 6906062 : return end;
2389 : : }
2390 : :
2391 : : /* Add all BBs reachable from entry via hot paths into the SET. */
2392 : :
2393 : : void
2394 : 543243 : find_bbs_reachable_by_hot_paths (hash_set<basic_block> *set)
2395 : : {
2396 : 543243 : auto_vec<basic_block, 64> worklist;
2397 : :
2398 : 543243 : set->add (ENTRY_BLOCK_PTR_FOR_FN (cfun));
2399 : 543243 : worklist.safe_push (ENTRY_BLOCK_PTR_FOR_FN (cfun));
2400 : :
2401 : 18455411 : while (worklist.length () > 0)
2402 : : {
2403 : 17368925 : basic_block bb = worklist.pop ();
2404 : 17368925 : edge_iterator ei;
2405 : 17368925 : edge e;
2406 : :
2407 : 44178947 : FOR_EACH_EDGE (e, ei, bb->succs)
2408 : 26810022 : if (BB_PARTITION (e->dest) != BB_COLD_PARTITION
2409 : 26810022 : && !set->add (e->dest))
2410 : 16825682 : worklist.safe_push (e->dest);
2411 : : }
2412 : 543243 : }
2413 : :
2414 : : /* Sanity check partition hotness to ensure that basic blocks in
2415 : : the cold partition don't dominate basic blocks in the hot partition.
2416 : : If FLAG_ONLY is true, report violations as errors. Otherwise
2417 : : re-mark the dominated blocks as cold, since this is run after
2418 : : cfg optimizations that may make hot blocks previously reached
2419 : : by both hot and cold blocks now only reachable along cold paths. */
2420 : :
2421 : : static auto_vec<basic_block>
2422 : 481068 : find_partition_fixes (bool flag_only)
2423 : : {
2424 : 481068 : basic_block bb;
2425 : 481068 : auto_vec<basic_block> bbs_to_fix;
2426 : 481068 : hash_set<basic_block> set;
2427 : :
2428 : : /* Callers check this. */
2429 : 481068 : gcc_checking_assert (crtl->has_bb_partition);
2430 : :
2431 : 481068 : find_bbs_reachable_by_hot_paths (&set);
2432 : :
2433 : 17311885 : FOR_EACH_BB_FN (bb, cfun)
2434 : 16830817 : if (!set.contains (bb)
2435 : 16830817 : && BB_PARTITION (bb) != BB_COLD_PARTITION)
2436 : : {
2437 : 319 : if (flag_only)
2438 : 0 : error ("non-cold basic block %d reachable only "
2439 : : "by paths crossing the cold partition", bb->index);
2440 : : else
2441 : 319 : BB_SET_PARTITION (bb, BB_COLD_PARTITION);
2442 : 319 : bbs_to_fix.safe_push (bb);
2443 : : }
2444 : :
2445 : 481068 : return bbs_to_fix;
2446 : 481068 : }
2447 : :
2448 : : /* Perform cleanup on the hot/cold bb partitioning after optimization
2449 : : passes that modify the cfg. */
2450 : :
2451 : : void
2452 : 12681081 : fixup_partitions (void)
2453 : : {
2454 : 12681081 : if (!crtl->has_bb_partition)
2455 : 12318960 : return;
2456 : :
2457 : : /* Delete any blocks that became unreachable and weren't
2458 : : already cleaned up, for example during edge forwarding
2459 : : and convert_jumps_to_returns. This will expose more
2460 : : opportunities for fixing the partition boundaries here.
2461 : : Also, the calculation of the dominance graph during verification
2462 : : will assert if there are unreachable nodes. */
2463 : 362121 : delete_unreachable_blocks ();
2464 : :
2465 : : /* If there are partitions, do a sanity check on them: A basic block in
2466 : : a cold partition cannot dominate a basic block in a hot partition.
2467 : : Fixup any that now violate this requirement, as a result of edge
2468 : : forwarding and unreachable block deletion. */
2469 : 362121 : auto_vec<basic_block> bbs_to_fix = find_partition_fixes (false);
2470 : :
2471 : : /* Do the partition fixup after all necessary blocks have been converted to
2472 : : cold, so that we only update the region crossings the minimum number of
2473 : : places, which can require forcing edges to be non fallthru. */
2474 : 362401 : if (! bbs_to_fix.is_empty ())
2475 : : {
2476 : 319 : do
2477 : : {
2478 : 319 : basic_block bb = bbs_to_fix.pop ();
2479 : 319 : fixup_new_cold_bb (bb);
2480 : : }
2481 : 599 : while (! bbs_to_fix.is_empty ());
2482 : :
2483 : : /* Fix up hot cold block grouping if needed. */
2484 : 280 : if (crtl->bb_reorder_complete && current_ir_type () == IR_RTL_CFGRTL)
2485 : : {
2486 : 1 : basic_block bb, first = NULL, second = NULL;
2487 : 1 : int current_partition = BB_UNPARTITIONED;
2488 : :
2489 : 16 : FOR_EACH_BB_FN (bb, cfun)
2490 : : {
2491 : 15 : if (current_partition != BB_UNPARTITIONED
2492 : 14 : && BB_PARTITION (bb) != current_partition)
2493 : : {
2494 : 3 : if (first == NULL)
2495 : : first = bb;
2496 : 2 : else if (second == NULL)
2497 : : second = bb;
2498 : : else
2499 : : {
2500 : : /* If we switch partitions for the 3rd, 5th etc. time,
2501 : : move bbs first (inclusive) .. second (exclusive) right
2502 : : before bb. */
2503 : 1 : basic_block prev_first = first->prev_bb;
2504 : 1 : basic_block prev_second = second->prev_bb;
2505 : 1 : basic_block prev_bb = bb->prev_bb;
2506 : 1 : prev_first->next_bb = second;
2507 : 1 : second->prev_bb = prev_first;
2508 : 1 : prev_second->next_bb = bb;
2509 : 1 : bb->prev_bb = prev_second;
2510 : 1 : prev_bb->next_bb = first;
2511 : 1 : first->prev_bb = prev_bb;
2512 : 1 : rtx_insn *prev_first_insn = PREV_INSN (BB_HEAD (first));
2513 : 1 : rtx_insn *prev_second_insn
2514 : 1 : = PREV_INSN (BB_HEAD (second));
2515 : 1 : rtx_insn *prev_bb_insn = PREV_INSN (BB_HEAD (bb));
2516 : 1 : SET_NEXT_INSN (prev_first_insn) = BB_HEAD (second);
2517 : 1 : SET_PREV_INSN (BB_HEAD (second)) = prev_first_insn;
2518 : 1 : SET_NEXT_INSN (prev_second_insn) = BB_HEAD (bb);
2519 : 1 : SET_PREV_INSN (BB_HEAD (bb)) = prev_second_insn;
2520 : 1 : SET_NEXT_INSN (prev_bb_insn) = BB_HEAD (first);
2521 : 1 : SET_PREV_INSN (BB_HEAD (first)) = prev_bb_insn;
2522 : 1 : second = NULL;
2523 : : }
2524 : : }
2525 : 15 : current_partition = BB_PARTITION (bb);
2526 : : }
2527 : 1 : gcc_assert (!second);
2528 : : }
2529 : : }
2530 : 362121 : }
2531 : :
2532 : : /* Verify, in the basic block chain, that there is at most one switch
2533 : : between hot/cold partitions. This condition will not be true until
2534 : : after reorder_basic_blocks is called. */
2535 : :
2536 : : static bool
2537 : 59773506 : verify_hot_cold_block_grouping (void)
2538 : : {
2539 : 59773506 : basic_block bb;
2540 : 59773506 : bool err = false;
2541 : 59773506 : bool switched_sections = false;
2542 : 59773506 : int current_partition = BB_UNPARTITIONED;
2543 : :
2544 : : /* Even after bb reordering is complete, we go into cfglayout mode
2545 : : again (in compgoto). Ensure we don't call this before going back
2546 : : into linearized RTL when any layout fixes would have been committed. */
2547 : 59773506 : if (!crtl->bb_reorder_complete
2548 : 59773506 : || current_ir_type () != IR_RTL_CFGRTL)
2549 : 52503659 : return err;
2550 : :
2551 : 128729072 : FOR_EACH_BB_FN (bb, cfun)
2552 : : {
2553 : 121459225 : if (current_partition != BB_UNPARTITIONED
2554 : 47965668 : && BB_PARTITION (bb) != current_partition)
2555 : : {
2556 : 702123 : if (switched_sections)
2557 : : {
2558 : 0 : error ("multiple hot/cold transitions found (bb %i)",
2559 : : bb->index);
2560 : 0 : err = true;
2561 : : }
2562 : : else
2563 : : switched_sections = true;
2564 : :
2565 : 702123 : if (!crtl->has_bb_partition)
2566 : 0 : error ("partition found but function partition flag not set");
2567 : : }
2568 : 121459225 : current_partition = BB_PARTITION (bb);
2569 : : }
2570 : :
2571 : : return err;
2572 : : }
2573 : :
2574 : :
2575 : : /* Perform several checks on the edges out of each block, such as
2576 : : the consistency of the branch probabilities, the correctness
2577 : : of hot/cold partition crossing edges, and the number of expected
2578 : : successor edges. Also verify that the dominance relationship
2579 : : between hot/cold blocks is sane. */
2580 : :
2581 : : static bool
2582 : 95527611 : rtl_verify_edges (void)
2583 : : {
2584 : 95527611 : bool err = false;
2585 : 95527611 : basic_block bb;
2586 : :
2587 : 1146846832 : FOR_EACH_BB_REVERSE_FN (bb, cfun)
2588 : : {
2589 : 1051319221 : int n_fallthru = 0, n_branch = 0, n_abnormal_call = 0, n_sibcall = 0;
2590 : 1051319221 : int n_eh = 0, n_abnormal = 0;
2591 : 1051319221 : edge e, fallthru = NULL;
2592 : 1051319221 : edge_iterator ei;
2593 : 1051319221 : rtx note;
2594 : 1051319221 : bool has_crossing_edge = false;
2595 : :
2596 : 1051319221 : if (JUMP_P (BB_END (bb))
2597 : 614943166 : && (note = find_reg_note (BB_END (bb), REG_BR_PROB, NULL_RTX))
2598 : 420469185 : && EDGE_COUNT (bb->succs) >= 2
2599 : 1471788406 : && any_condjump_p (BB_END (bb)))
2600 : : {
2601 : 420469185 : if (!BRANCH_EDGE (bb)->probability.initialized_p ())
2602 : : {
2603 : 216947 : if (profile_status_for_fn (cfun) != PROFILE_ABSENT)
2604 : : {
2605 : 0 : error ("verify_flow_info: "
2606 : : "REG_BR_PROB is set but cfg probability is not");
2607 : 0 : err = true;
2608 : : }
2609 : : }
2610 : 420252238 : else if (XINT (note, 0)
2611 : 420252238 : != BRANCH_EDGE (bb)->probability.to_reg_br_prob_note ()
2612 : 420252238 : && profile_status_for_fn (cfun) != PROFILE_ABSENT)
2613 : : {
2614 : 0 : error ("verify_flow_info: REG_BR_PROB does not match cfg %i %i",
2615 : : XINT (note, 0),
2616 : 0 : BRANCH_EDGE (bb)->probability.to_reg_br_prob_note ());
2617 : 0 : err = true;
2618 : : }
2619 : : }
2620 : :
2621 : 2582098433 : FOR_EACH_EDGE (e, ei, bb->succs)
2622 : : {
2623 : 1530779212 : bool is_crossing;
2624 : :
2625 : 1530779212 : if (e->flags & EDGE_FALLTHRU)
2626 : 835825732 : n_fallthru++, fallthru = e;
2627 : :
2628 : 3061558424 : is_crossing = (BB_PARTITION (e->src) != BB_PARTITION (e->dest)
2629 : 33785086 : && e->src != ENTRY_BLOCK_PTR_FOR_FN (cfun)
2630 : 1564564298 : && e->dest != EXIT_BLOCK_PTR_FOR_FN (cfun));
2631 : 1530779212 : has_crossing_edge |= is_crossing;
2632 : 1530779212 : if (e->flags & EDGE_CROSSING)
2633 : : {
2634 : 18833818 : if (!is_crossing)
2635 : : {
2636 : 0 : error ("EDGE_CROSSING incorrectly set across same section");
2637 : 0 : err = true;
2638 : : }
2639 : 18833818 : if (e->flags & EDGE_FALLTHRU)
2640 : : {
2641 : 0 : error ("fallthru edge crosses section boundary in bb %i",
2642 : 0 : e->src->index);
2643 : 0 : err = true;
2644 : : }
2645 : 18833818 : if (e->flags & EDGE_EH)
2646 : : {
2647 : 0 : error ("EH edge crosses section boundary in bb %i",
2648 : 0 : e->src->index);
2649 : 0 : err = true;
2650 : : }
2651 : 18833818 : if (JUMP_P (BB_END (bb)) && !CROSSING_JUMP_P (BB_END (bb)))
2652 : : {
2653 : 0 : error ("No region crossing jump at section boundary in bb %i",
2654 : : bb->index);
2655 : 0 : err = true;
2656 : : }
2657 : : }
2658 : 1511945394 : else if (is_crossing)
2659 : : {
2660 : 0 : error ("EDGE_CROSSING missing across section boundary");
2661 : 0 : err = true;
2662 : : }
2663 : :
2664 : 1530779212 : if ((e->flags & ~(EDGE_DFS_BACK
2665 : : | EDGE_CAN_FALLTHRU
2666 : : | EDGE_IRREDUCIBLE_LOOP
2667 : : | EDGE_LOOP_EXIT
2668 : : | EDGE_CROSSING
2669 : : | EDGE_PRESERVE)) == 0)
2670 : 622100341 : n_branch++;
2671 : :
2672 : 1530779212 : if (e->flags & EDGE_ABNORMAL_CALL)
2673 : 51186090 : n_abnormal_call++;
2674 : :
2675 : 1530779212 : if (e->flags & EDGE_SIBCALL)
2676 : 10130170 : n_sibcall++;
2677 : :
2678 : 1530779212 : if (e->flags & EDGE_EH)
2679 : 60881222 : n_eh++;
2680 : :
2681 : 1530779212 : if (e->flags & EDGE_ABNORMAL)
2682 : 72441661 : n_abnormal++;
2683 : : }
2684 : :
2685 : 1051319221 : if (!has_crossing_edge
2686 : 1032513587 : && JUMP_P (BB_END (bb))
2687 : 1647462720 : && CROSSING_JUMP_P (BB_END (bb)))
2688 : : {
2689 : 0 : print_rtl_with_bb (stderr, get_insns (), TDF_BLOCKS | TDF_DETAILS);
2690 : 0 : error ("Region crossing jump across same section in bb %i",
2691 : : bb->index);
2692 : 0 : err = true;
2693 : : }
2694 : :
2695 : 1051319221 : if (n_eh && !find_reg_note (BB_END (bb), REG_EH_REGION, NULL_RTX))
2696 : : {
2697 : 0 : error ("missing REG_EH_REGION note at the end of bb %i", bb->index);
2698 : 0 : err = true;
2699 : : }
2700 : 1051319221 : if (n_eh > 1)
2701 : : {
2702 : 0 : error ("too many exception handling edges in bb %i", bb->index);
2703 : 0 : err = true;
2704 : : }
2705 : 1051319221 : if (n_branch
2706 : 1051319221 : && (!JUMP_P (BB_END (bb))
2707 : 614849795 : || (n_branch > 1 && (any_uncondjump_p (BB_END (bb))
2708 : 892559 : || any_condjump_p (BB_END (bb))))))
2709 : : {
2710 : 0 : error ("too many outgoing branch edges from bb %i", bb->index);
2711 : 0 : err = true;
2712 : : }
2713 : 1051319221 : if (n_fallthru && any_uncondjump_p (BB_END (bb)))
2714 : : {
2715 : 0 : error ("fallthru edge after unconditional jump in bb %i", bb->index);
2716 : 0 : err = true;
2717 : : }
2718 : 1051319221 : if (n_branch != 1 && any_uncondjump_p (BB_END (bb)))
2719 : : {
2720 : 0 : error ("wrong number of branch edges after unconditional jump"
2721 : : " in bb %i", bb->index);
2722 : 0 : err = true;
2723 : : }
2724 : 437361985 : if (n_branch != 1 && any_condjump_p (BB_END (bb))
2725 : 1051320506 : && JUMP_LABEL (BB_END (bb)) != BB_HEAD (fallthru->dest))
2726 : : {
2727 : 0 : error ("wrong amount of branch edges after conditional jump"
2728 : : " in bb %i", bb->index);
2729 : 0 : err = true;
2730 : : }
2731 : 1051319221 : if (n_abnormal_call && !CALL_P (BB_END (bb)))
2732 : : {
2733 : 0 : error ("abnormal call edges for non-call insn in bb %i", bb->index);
2734 : 0 : err = true;
2735 : : }
2736 : 1051319221 : if (n_sibcall && !CALL_P (BB_END (bb)))
2737 : : {
2738 : 0 : error ("sibcall edges for non-call insn in bb %i", bb->index);
2739 : 0 : err = true;
2740 : : }
2741 : 1051319221 : if (n_abnormal > n_eh
2742 : 10331042 : && !(CALL_P (BB_END (bb))
2743 : 10311458 : && n_abnormal == n_abnormal_call + n_sibcall)
2744 : 1051338805 : && (!JUMP_P (BB_END (bb))
2745 : 19584 : || any_condjump_p (BB_END (bb))
2746 : 19584 : || any_uncondjump_p (BB_END (bb))))
2747 : : {
2748 : 0 : error ("abnormal edges for no purpose in bb %i", bb->index);
2749 : 0 : err = true;
2750 : : }
2751 : :
2752 : 1051319221 : int has_eh = -1;
2753 : 2575617507 : FOR_EACH_EDGE (e, ei, bb->preds)
2754 : : {
2755 : 1524298286 : if (has_eh == -1)
2756 : 1051187442 : has_eh = (e->flags & EDGE_EH);
2757 : 1524298286 : if ((e->flags & EDGE_EH) == has_eh)
2758 : 1524298286 : continue;
2759 : 0 : error ("EH incoming edge mixed with non-EH incoming edges "
2760 : : "in bb %i", bb->index);
2761 : 0 : err = true;
2762 : 0 : break;
2763 : : }
2764 : : }
2765 : :
2766 : : /* If there are partitions, do a sanity check on them: A basic block in
2767 : : a cold partition cannot dominate a basic block in a hot partition. */
2768 : 2749954 : if (crtl->has_bb_partition && !err
2769 : 98277565 : && current_ir_type () == IR_RTL_CFGLAYOUT)
2770 : : {
2771 : 118947 : auto_vec<basic_block> bbs_to_fix = find_partition_fixes (true);
2772 : 237894 : err = !bbs_to_fix.is_empty ();
2773 : 118947 : }
2774 : :
2775 : : /* Clean up. */
2776 : 95527611 : return err;
2777 : : }
2778 : :
2779 : : /* Checks on the instructions within blocks. Currently checks that each
2780 : : block starts with a basic block note, and that basic block notes and
2781 : : control flow jumps are not found in the middle of the block. */
2782 : :
2783 : : static bool
2784 : 95527611 : rtl_verify_bb_insns (void)
2785 : : {
2786 : 95527611 : rtx_insn *x;
2787 : 95527611 : bool err = false;
2788 : 95527611 : basic_block bb;
2789 : :
2790 : 1146846832 : FOR_EACH_BB_REVERSE_FN (bb, cfun)
2791 : : {
2792 : : /* Now check the header of basic
2793 : : block. It ought to contain optional CODE_LABEL followed
2794 : : by NOTE_BASIC_BLOCK. */
2795 : 1051319221 : x = BB_HEAD (bb);
2796 : 1051319221 : if (LABEL_P (x))
2797 : : {
2798 : 510744793 : if (BB_END (bb) == x)
2799 : : {
2800 : 0 : error ("NOTE_INSN_BASIC_BLOCK is missing for block %d",
2801 : : bb->index);
2802 : 0 : err = true;
2803 : : }
2804 : :
2805 : 510744793 : x = NEXT_INSN (x);
2806 : : }
2807 : :
2808 : 1051319221 : if (!NOTE_INSN_BASIC_BLOCK_P (x) || NOTE_BASIC_BLOCK (x) != bb)
2809 : : {
2810 : 0 : error ("NOTE_INSN_BASIC_BLOCK is missing for block %d",
2811 : : bb->index);
2812 : 0 : err = true;
2813 : : }
2814 : :
2815 : 1051319221 : if (BB_END (bb) == x)
2816 : : /* Do checks for empty blocks here. */
2817 : : ;
2818 : : else
2819 : 11752615327 : for (x = NEXT_INSN (x); x; x = NEXT_INSN (x))
2820 : : {
2821 : 10719296453 : if (NOTE_INSN_BASIC_BLOCK_P (x))
2822 : : {
2823 : 0 : error ("NOTE_INSN_BASIC_BLOCK %d in middle of basic block %d",
2824 : 0 : INSN_UID (x), bb->index);
2825 : 0 : err = true;
2826 : : }
2827 : :
2828 : 10719296453 : if (x == BB_END (bb))
2829 : : break;
2830 : :
2831 : 9685977579 : if (control_flow_insn_p (x))
2832 : : {
2833 : 0 : error ("in basic block %d:", bb->index);
2834 : 0 : fatal_insn ("flow control insn inside a basic block", x);
2835 : : }
2836 : : }
2837 : : }
2838 : :
2839 : : /* Clean up. */
2840 : 95527611 : return err;
2841 : : }
2842 : :
2843 : : /* Verify that block pointers for instructions in basic blocks, headers and
2844 : : footers are set appropriately. */
2845 : :
2846 : : static bool
2847 : 95527611 : rtl_verify_bb_pointers (void)
2848 : : {
2849 : 95527611 : bool err = false;
2850 : 95527611 : basic_block bb;
2851 : :
2852 : : /* Check the general integrity of the basic blocks. */
2853 : 1146846832 : FOR_EACH_BB_REVERSE_FN (bb, cfun)
2854 : : {
2855 : 1051319221 : rtx_insn *insn;
2856 : :
2857 : 1051319221 : if (!(bb->flags & BB_RTL))
2858 : : {
2859 : 0 : error ("BB_RTL flag not set for block %d", bb->index);
2860 : 0 : err = true;
2861 : : }
2862 : :
2863 : 13332679688 : FOR_BB_INSNS (bb, insn)
2864 : 12281360467 : if (BLOCK_FOR_INSN (insn) != bb)
2865 : : {
2866 : 0 : error ("insn %d basic block pointer is %d, should be %d",
2867 : 0 : INSN_UID (insn),
2868 : 0 : BLOCK_FOR_INSN (insn) ? BLOCK_FOR_INSN (insn)->index : 0,
2869 : : bb->index);
2870 : 0 : err = true;
2871 : : }
2872 : :
2873 : 1051711929 : for (insn = BB_HEADER (bb); insn; insn = NEXT_INSN (insn))
2874 : 392708 : if (!BARRIER_P (insn)
2875 : 392708 : && BLOCK_FOR_INSN (insn) != NULL)
2876 : : {
2877 : 0 : error ("insn %d in header of bb %d has non-NULL basic block",
2878 : 0 : INSN_UID (insn), bb->index);
2879 : 0 : err = true;
2880 : : }
2881 : 1080147789 : for (insn = BB_FOOTER (bb); insn; insn = NEXT_INSN (insn))
2882 : 28828568 : if (!BARRIER_P (insn)
2883 : 28828568 : && BLOCK_FOR_INSN (insn) != NULL)
2884 : : {
2885 : 0 : error ("insn %d in footer of bb %d has non-NULL basic block",
2886 : 0 : INSN_UID (insn), bb->index);
2887 : 0 : err = true;
2888 : : }
2889 : : }
2890 : :
2891 : : /* Clean up. */
2892 : 95527611 : return err;
2893 : : }
2894 : :
2895 : : /* Verify the CFG and RTL consistency common for both underlying RTL and
2896 : : cfglayout RTL.
2897 : :
2898 : : Currently it does following checks:
2899 : :
2900 : : - overlapping of basic blocks
2901 : : - insns with wrong BLOCK_FOR_INSN pointers
2902 : : - headers of basic blocks (the NOTE_INSN_BASIC_BLOCK note)
2903 : : - tails of basic blocks (ensure that boundary is necessary)
2904 : : - scans body of the basic block for JUMP_INSN, CODE_LABEL
2905 : : and NOTE_INSN_BASIC_BLOCK
2906 : : - verify that no fall_thru edge crosses hot/cold partition boundaries
2907 : : - verify that there are no pending RTL branch predictions
2908 : : - verify that hot blocks are not dominated by cold blocks
2909 : :
2910 : : In future it can be extended check a lot of other stuff as well
2911 : : (reachability of basic blocks, life information, etc. etc.). */
2912 : :
2913 : : static bool
2914 : 95527611 : rtl_verify_flow_info_1 (void)
2915 : : {
2916 : 95527611 : bool err = false;
2917 : :
2918 : 95527611 : if (rtl_verify_bb_pointers ())
2919 : : err = true;
2920 : :
2921 : 95527611 : if (rtl_verify_bb_insns ())
2922 : 0 : err = true;
2923 : :
2924 : 95527611 : if (rtl_verify_edges ())
2925 : 0 : err = true;
2926 : :
2927 : 95527611 : return err;
2928 : : }
2929 : :
2930 : : /* Walk the instruction chain and verify that bb head/end pointers
2931 : : are correct, and that instructions are in exactly one bb and have
2932 : : correct block pointers. */
2933 : :
2934 : : static bool
2935 : 59773506 : rtl_verify_bb_insn_chain (void)
2936 : : {
2937 : 59773506 : basic_block bb;
2938 : 59773506 : bool err = false;
2939 : 59773506 : rtx_insn *x;
2940 : 59773506 : rtx_insn *last_head = get_last_insn ();
2941 : 59773506 : basic_block *bb_info;
2942 : 59773506 : const int max_uid = get_max_uid ();
2943 : :
2944 : 59773506 : bb_info = XCNEWVEC (basic_block, max_uid);
2945 : :
2946 : 696093795 : FOR_EACH_BB_REVERSE_FN (bb, cfun)
2947 : : {
2948 : 636320289 : rtx_insn *head = BB_HEAD (bb);
2949 : 636320289 : rtx_insn *end = BB_END (bb);
2950 : :
2951 : 886765525 : for (x = last_head; x != NULL_RTX; x = PREV_INSN (x))
2952 : : {
2953 : : /* Verify the end of the basic block is in the INSN chain. */
2954 : 886765525 : if (x == end)
2955 : : break;
2956 : :
2957 : : /* And that the code outside of basic blocks has NULL bb field. */
2958 : 250445236 : if (!BARRIER_P (x)
2959 : 250445236 : && BLOCK_FOR_INSN (x) != NULL)
2960 : : {
2961 : 0 : error ("insn %d outside of basic blocks has non-NULL bb field",
2962 : 0 : INSN_UID (x));
2963 : 0 : err = true;
2964 : : }
2965 : : }
2966 : :
2967 : 636320289 : if (!x)
2968 : : {
2969 : 0 : error ("end insn %d for block %d not found in the insn stream",
2970 : 0 : INSN_UID (end), bb->index);
2971 : 0 : err = true;
2972 : : }
2973 : :
2974 : : /* Work backwards from the end to the head of the basic block
2975 : : to verify the head is in the RTL chain. */
2976 : 7399245799 : for (; x != NULL_RTX; x = PREV_INSN (x))
2977 : : {
2978 : : /* While walking over the insn chain, verify insns appear
2979 : : in only one basic block. */
2980 : 7399245799 : if (bb_info[INSN_UID (x)] != NULL)
2981 : : {
2982 : 0 : error ("insn %d is in multiple basic blocks (%d and %d)",
2983 : : INSN_UID (x), bb->index, bb_info[INSN_UID (x)]->index);
2984 : 0 : err = true;
2985 : : }
2986 : :
2987 : 7399245799 : bb_info[INSN_UID (x)] = bb;
2988 : :
2989 : 7399245799 : if (x == head)
2990 : : break;
2991 : : }
2992 : 636320289 : if (!x)
2993 : : {
2994 : 0 : error ("head insn %d for block %d not found in the insn stream",
2995 : 0 : INSN_UID (head), bb->index);
2996 : 0 : err = true;
2997 : : }
2998 : :
2999 : 636320289 : last_head = PREV_INSN (x);
3000 : : }
3001 : :
3002 : 120575147 : for (x = last_head; x != NULL_RTX; x = PREV_INSN (x))
3003 : : {
3004 : : /* Check that the code before the first basic block has NULL
3005 : : bb field. */
3006 : 60801641 : if (!BARRIER_P (x)
3007 : 60801641 : && BLOCK_FOR_INSN (x) != NULL)
3008 : : {
3009 : 0 : error ("insn %d outside of basic blocks has non-NULL bb field",
3010 : 0 : INSN_UID (x));
3011 : 0 : err = true;
3012 : : }
3013 : : }
3014 : 59773506 : free (bb_info);
3015 : :
3016 : 59773506 : return err;
3017 : : }
3018 : :
3019 : : /* Verify that fallthru edges point to adjacent blocks in layout order and
3020 : : that barriers exist after non-fallthru blocks. */
3021 : :
3022 : : static bool
3023 : 59773506 : rtl_verify_fallthru (void)
3024 : : {
3025 : 59773506 : basic_block bb;
3026 : 59773506 : bool err = false;
3027 : :
3028 : 696093795 : FOR_EACH_BB_REVERSE_FN (bb, cfun)
3029 : : {
3030 : 636320289 : edge e;
3031 : :
3032 : 636320289 : e = find_fallthru_edge (bb->succs);
3033 : 636320289 : if (!e)
3034 : : {
3035 : 187810005 : rtx_insn *insn;
3036 : :
3037 : : /* Ensure existence of barrier in BB with no fallthru edges. */
3038 : 188304524 : for (insn = NEXT_INSN (BB_END (bb)); ; insn = NEXT_INSN (insn))
3039 : : {
3040 : 188304524 : if (!insn || NOTE_INSN_BASIC_BLOCK_P (insn))
3041 : : {
3042 : 0 : error ("missing barrier after block %i", bb->index);
3043 : 0 : err = true;
3044 : 0 : break;
3045 : : }
3046 : 188304524 : if (BARRIER_P (insn))
3047 : : break;
3048 : : }
3049 : : }
3050 : 448510284 : else if (e->src != ENTRY_BLOCK_PTR_FOR_FN (cfun)
3051 : 448510284 : && e->dest != EXIT_BLOCK_PTR_FOR_FN (cfun))
3052 : : {
3053 : 419728128 : rtx_insn *insn;
3054 : :
3055 : 419728128 : if (e->src->next_bb != e->dest)
3056 : : {
3057 : 0 : error
3058 : 0 : ("verify_flow_info: Incorrect blocks for fallthru %i->%i",
3059 : : e->src->index, e->dest->index);
3060 : 0 : err = true;
3061 : : }
3062 : : else
3063 : 845523070 : for (insn = NEXT_INSN (BB_END (e->src)); insn != BB_HEAD (e->dest);
3064 : 6066814 : insn = NEXT_INSN (insn))
3065 : 6066814 : if (BARRIER_P (insn) || NONDEBUG_INSN_P (insn))
3066 : : {
3067 : 0 : error ("verify_flow_info: Incorrect fallthru %i->%i",
3068 : 0 : e->src->index, e->dest->index);
3069 : 0 : error ("wrong insn in the fallthru edge");
3070 : 0 : debug_rtx (insn);
3071 : 0 : err = true;
3072 : : }
3073 : : }
3074 : : }
3075 : :
3076 : 59773506 : return err;
3077 : : }
3078 : :
3079 : : /* Verify that blocks are laid out in consecutive order. While walking the
3080 : : instructions, verify that all expected instructions are inside the basic
3081 : : blocks, and that all returns are followed by barriers. */
3082 : :
3083 : : static bool
3084 : 59773506 : rtl_verify_bb_layout (void)
3085 : : {
3086 : 59773506 : basic_block bb;
3087 : 59773506 : bool err = false;
3088 : 59773506 : rtx_insn *x, *y;
3089 : 59773506 : int num_bb_notes;
3090 : 59773506 : rtx_insn * const rtx_first = get_insns ();
3091 : 59773506 : basic_block last_bb_seen = ENTRY_BLOCK_PTR_FOR_FN (cfun), curr_bb = NULL;
3092 : :
3093 : 59773506 : num_bb_notes = 0;
3094 : :
3095 : 7769769153 : for (x = rtx_first; x; x = NEXT_INSN (x))
3096 : : {
3097 : 7709995647 : if (NOTE_INSN_BASIC_BLOCK_P (x))
3098 : : {
3099 : 636320289 : bb = NOTE_BASIC_BLOCK (x);
3100 : :
3101 : 636320289 : num_bb_notes++;
3102 : 636320289 : if (bb != last_bb_seen->next_bb)
3103 : 0 : internal_error ("basic blocks not laid down consecutively");
3104 : :
3105 : : curr_bb = last_bb_seen = bb;
3106 : : }
3107 : :
3108 : 7709995647 : if (!curr_bb)
3109 : : {
3110 : 613548235 : switch (GET_CODE (x))
3111 : : {
3112 : : case BARRIER:
3113 : : case NOTE:
3114 : : break;
3115 : :
3116 : 303295416 : case CODE_LABEL:
3117 : : /* An ADDR_VEC is placed outside any basic block. */
3118 : 303295416 : if (NEXT_INSN (x)
3119 : 303295416 : && JUMP_TABLE_DATA_P (NEXT_INSN (x)))
3120 : : x = NEXT_INSN (x);
3121 : :
3122 : : /* But in any case, non-deletable labels can appear anywhere. */
3123 : : break;
3124 : :
3125 : 0 : default:
3126 : 0 : fatal_insn ("insn outside basic block", x);
3127 : : }
3128 : : }
3129 : :
3130 : 7709995647 : if (JUMP_P (x)
3131 : 425790175 : && returnjump_p (x) && ! condjump_p (x)
3132 : 7740023014 : && ! ((y = next_nonnote_nondebug_insn (x))
3133 : 30027367 : && BARRIER_P (y)))
3134 : 0 : fatal_insn ("return not followed by barrier", x);
3135 : :
3136 : 7709995647 : if (curr_bb && x == BB_END (curr_bb))
3137 : 1249868524 : curr_bb = NULL;
3138 : : }
3139 : :
3140 : 59773506 : if (num_bb_notes != n_basic_blocks_for_fn (cfun) - NUM_FIXED_BLOCKS)
3141 : 0 : internal_error
3142 : 0 : ("number of bb notes in insn chain (%d) != n_basic_blocks (%d)",
3143 : : num_bb_notes, n_basic_blocks_for_fn (cfun));
3144 : :
3145 : 59773506 : return err;
3146 : : }
3147 : :
3148 : : /* Verify the CFG and RTL consistency common for both underlying RTL and
3149 : : cfglayout RTL, plus consistency checks specific to linearized RTL mode.
3150 : :
3151 : : Currently it does following checks:
3152 : : - all checks of rtl_verify_flow_info_1
3153 : : - test head/end pointers
3154 : : - check that blocks are laid out in consecutive order
3155 : : - check that all insns are in the basic blocks
3156 : : (except the switch handling code, barriers and notes)
3157 : : - check that all returns are followed by barriers
3158 : : - check that all fallthru edge points to the adjacent blocks
3159 : : - verify that there is a single hot/cold partition boundary after bbro */
3160 : :
3161 : : static bool
3162 : 59773506 : rtl_verify_flow_info (void)
3163 : : {
3164 : 59773506 : bool err = false;
3165 : :
3166 : 59773506 : if (rtl_verify_flow_info_1 ())
3167 : : err = true;
3168 : :
3169 : 59773506 : if (rtl_verify_bb_insn_chain ())
3170 : 0 : err = true;
3171 : :
3172 : 59773506 : if (rtl_verify_fallthru ())
3173 : 0 : err = true;
3174 : :
3175 : 59773506 : if (rtl_verify_bb_layout ())
3176 : : err = true;
3177 : :
3178 : 59773506 : if (verify_hot_cold_block_grouping ())
3179 : 0 : err = true;
3180 : :
3181 : 59773506 : return err;
3182 : : }
3183 : :
3184 : : /* Assume that the preceding pass has possibly eliminated jump instructions
3185 : : or converted the unconditional jumps. Eliminate the edges from CFG.
3186 : : Return true if any edges are eliminated. */
3187 : :
3188 : : bool
3189 : 72341611 : purge_dead_edges (basic_block bb)
3190 : : {
3191 : 72341611 : edge e;
3192 : 72341611 : rtx_insn *insn = BB_END (bb);
3193 : 72341611 : rtx note;
3194 : 72341611 : bool purged = false;
3195 : 72341611 : bool found;
3196 : 72341611 : edge_iterator ei;
3197 : :
3198 : 72341611 : if ((DEBUG_INSN_P (insn) || NOTE_P (insn)) && insn != BB_HEAD (bb))
3199 : 16046405 : do
3200 : 16046405 : insn = PREV_INSN (insn);
3201 : 16046405 : while ((DEBUG_INSN_P (insn) || NOTE_P (insn)) && insn != BB_HEAD (bb));
3202 : :
3203 : : /* If this instruction cannot trap, remove REG_EH_REGION notes. */
3204 : 72341611 : if (NONJUMP_INSN_P (insn)
3205 : 72341611 : && (note = find_reg_note (insn, REG_EH_REGION, NULL)))
3206 : : {
3207 : 1296308 : rtx eqnote;
3208 : :
3209 : 1296308 : if (! may_trap_p (PATTERN (insn))
3210 : 1296308 : || ((eqnote = find_reg_equal_equiv_note (insn))
3211 : 164 : && ! may_trap_p (XEXP (eqnote, 0))))
3212 : 45086 : remove_note (insn, note);
3213 : : }
3214 : : /* A tail call cannot trap either. The tailc/musttail pass could have
3215 : : allowed a tail call if it could throw internally, but perform no
3216 : : actual statements and then caused the exception to be thrown externally
3217 : : in the hope that it is cleaned up later. If it is not, just
3218 : : remove REG_EH_REGION note. While the call maybe can throw, the
3219 : : current function's frame will not be there anymore when it does. */
3220 : 72341611 : if (CALL_P (insn)
3221 : 8937125 : && SIBLING_CALL_P (insn)
3222 : 72849020 : && (note = find_reg_note (insn, REG_EH_REGION, NULL)))
3223 : 77759 : remove_note (insn, note);
3224 : :
3225 : : /* Cleanup abnormal edges caused by exceptions or non-local gotos. */
3226 : 173443446 : for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
3227 : : {
3228 : 101101835 : bool remove = false;
3229 : :
3230 : : /* There are three types of edges we need to handle correctly here: EH
3231 : : edges, abnormal call EH edges, and abnormal call non-EH edges. The
3232 : : latter can appear when nonlocal gotos are used. */
3233 : 101101835 : if (e->flags & EDGE_ABNORMAL_CALL)
3234 : : {
3235 : 3284144 : if (!CALL_P (insn))
3236 : : remove = true;
3237 : 3284140 : else if (can_nonlocal_goto (insn))
3238 : : ;
3239 : 3208111 : else if ((e->flags & EDGE_EH) && can_throw_internal (insn))
3240 : : ;
3241 : 0 : else if (flag_tm && find_reg_note (insn, REG_TM, NULL))
3242 : : ;
3243 : : else
3244 : : remove = true;
3245 : : }
3246 : 97817691 : else if (e->flags & EDGE_EH)
3247 : 1903467 : remove = !can_throw_internal (insn);
3248 : :
3249 : 1903467 : if (remove)
3250 : : {
3251 : 400177 : remove_edge (e);
3252 : 400177 : df_set_bb_dirty (bb);
3253 : 400177 : purged = true;
3254 : : }
3255 : : else
3256 : 100701658 : ei_next (&ei);
3257 : : }
3258 : :
3259 : 72341611 : if (JUMP_P (insn))
3260 : : {
3261 : 38962066 : rtx note;
3262 : 38962066 : edge b,f;
3263 : 38962066 : edge_iterator ei;
3264 : :
3265 : : /* We do care only about conditional jumps and simplejumps. */
3266 : 38962066 : if (!any_condjump_p (insn)
3267 : 12856743 : && !returnjump_p (insn)
3268 : 48336149 : && !simplejump_p (insn))
3269 : : return purged;
3270 : :
3271 : : /* Branch probability/prediction notes are defined only for
3272 : : condjumps. We've possibly turned condjump into simplejump. */
3273 : 38911679 : if (simplejump_p (insn))
3274 : : {
3275 : 9323696 : note = find_reg_note (insn, REG_BR_PROB, NULL);
3276 : 9323696 : if (note)
3277 : 6086 : remove_note (insn, note);
3278 : 9323696 : while ((note = find_reg_note (insn, REG_BR_PRED, NULL)))
3279 : 0 : remove_note (insn, note);
3280 : : }
3281 : :
3282 : 103938617 : for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
3283 : : {
3284 : : /* Avoid abnormal flags to leak from computed jumps turned
3285 : : into simplejumps. */
3286 : :
3287 : 65026938 : e->flags &= ~EDGE_ABNORMAL;
3288 : :
3289 : : /* See if this edge is one we should keep. */
3290 : 65026938 : if ((e->flags & EDGE_FALLTHRU) && any_condjump_p (insn))
3291 : : /* A conditional jump can fall through into the next
3292 : : block, so we should keep the edge. */
3293 : : {
3294 : 26105323 : ei_next (&ei);
3295 : 26105323 : continue;
3296 : : }
3297 : 38921615 : else if (e->dest != EXIT_BLOCK_PTR_FOR_FN (cfun)
3298 : 35438955 : && BB_HEAD (e->dest) == JUMP_LABEL (insn))
3299 : : /* If the destination block is the target of the jump,
3300 : : keep the edge. */
3301 : : {
3302 : 35428304 : ei_next (&ei);
3303 : 35428304 : continue;
3304 : : }
3305 : 6975971 : else if (e->dest == EXIT_BLOCK_PTR_FOR_FN (cfun)
3306 : 3493311 : && returnjump_p (insn))
3307 : : /* If the destination block is the exit block, and this
3308 : : instruction is a return, then keep the edge. */
3309 : : {
3310 : 3482660 : ei_next (&ei);
3311 : 3482660 : continue;
3312 : : }
3313 : 10651 : else if ((e->flags & EDGE_EH) && can_throw_internal (insn))
3314 : : /* Keep the edges that correspond to exceptions thrown by
3315 : : this instruction and rematerialize the EDGE_ABNORMAL
3316 : : flag we just cleared above. */
3317 : : {
3318 : 0 : e->flags |= EDGE_ABNORMAL;
3319 : 0 : ei_next (&ei);
3320 : 0 : continue;
3321 : : }
3322 : :
3323 : : /* We do not need this edge. */
3324 : 10651 : df_set_bb_dirty (bb);
3325 : 10651 : purged = true;
3326 : 10651 : remove_edge (e);
3327 : : }
3328 : :
3329 : 39114965 : if (EDGE_COUNT (bb->succs) == 0 || !purged)
3330 : : return purged;
3331 : :
3332 : 152899 : if (dump_file)
3333 : 0 : fprintf (dump_file, "Purged edges from bb %i\n", bb->index);
3334 : :
3335 : 152899 : if (!optimize)
3336 : : return purged;
3337 : :
3338 : : /* Redistribute probabilities. */
3339 : 152379 : if (single_succ_p (bb))
3340 : : {
3341 : 152379 : single_succ_edge (bb)->probability = profile_probability::always ();
3342 : : }
3343 : : else
3344 : : {
3345 : 0 : note = find_reg_note (insn, REG_BR_PROB, NULL);
3346 : 0 : if (!note)
3347 : : return purged;
3348 : :
3349 : 0 : b = BRANCH_EDGE (bb);
3350 : 0 : f = FALLTHRU_EDGE (bb);
3351 : 0 : b->probability = profile_probability::from_reg_br_prob_note
3352 : 0 : (XINT (note, 0));
3353 : 0 : f->probability = b->probability.invert ();
3354 : : }
3355 : :
3356 : 152379 : return purged;
3357 : : }
3358 : 33379545 : else if (CALL_P (insn) && SIBLING_CALL_P (insn))
3359 : : {
3360 : : /* First, there should not be any EH or ABCALL edges resulting
3361 : : from non-local gotos and the like. If there were, we shouldn't
3362 : : have created the sibcall in the first place. Second, there
3363 : : should of course never have been a fallthru edge. */
3364 : 507409 : gcc_assert (single_succ_p (bb));
3365 : 507409 : gcc_assert (single_succ_edge (bb)->flags
3366 : : == (EDGE_SIBCALL | EDGE_ABNORMAL));
3367 : :
3368 : : return false;
3369 : : }
3370 : :
3371 : : /* If we don't see a jump insn, we don't know exactly why the block would
3372 : : have been broken at this point. Look for a simple, non-fallthru edge,
3373 : : as these are only created by conditional branches. If we find such an
3374 : : edge we know that there used to be a jump here and can then safely
3375 : : remove all non-fallthru edges. */
3376 : 32872136 : found = false;
3377 : 67204894 : FOR_EACH_EDGE (e, ei, bb->succs)
3378 : 34613994 : if (! (e->flags & (EDGE_COMPLEX | EDGE_FALLTHRU)))
3379 : : {
3380 : : found = true;
3381 : : break;
3382 : : }
3383 : :
3384 : 32872136 : if (!found)
3385 : : return purged;
3386 : :
3387 : : /* Remove all but the fake and fallthru edges. The fake edge may be
3388 : : the only successor for this block in the case of noreturn
3389 : : calls. */
3390 : 843840 : for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
3391 : : {
3392 : 562604 : if (!(e->flags & (EDGE_FALLTHRU | EDGE_FAKE)))
3393 : : {
3394 : 281368 : df_set_bb_dirty (bb);
3395 : 281368 : remove_edge (e);
3396 : 281368 : purged = true;
3397 : : }
3398 : : else
3399 : 281236 : ei_next (&ei);
3400 : : }
3401 : :
3402 : 281236 : gcc_assert (single_succ_p (bb));
3403 : :
3404 : 281236 : single_succ_edge (bb)->probability = profile_probability::always ();
3405 : :
3406 : 281236 : if (dump_file)
3407 : 1 : fprintf (dump_file, "Purged non-fallthru edges from bb %i\n",
3408 : : bb->index);
3409 : : return purged;
3410 : : }
3411 : :
3412 : : /* Search all basic blocks for potentially dead edges and purge them. Return
3413 : : true if some edge has been eliminated. */
3414 : :
3415 : : bool
3416 : 3256718 : purge_all_dead_edges (void)
3417 : : {
3418 : 3256718 : bool purged = false;
3419 : 3256718 : basic_block bb;
3420 : :
3421 : 47181741 : FOR_EACH_BB_FN (bb, cfun)
3422 : 43925023 : if (purge_dead_edges (bb))
3423 : 2822 : purged = true;
3424 : :
3425 : 3256718 : return purged;
3426 : : }
3427 : :
3428 : : /* This is used by a few passes that emit some instructions after abnormal
3429 : : calls, moving the basic block's end, while they in fact do want to emit
3430 : : them on the fallthru edge. Look for abnormal call edges, find backward
3431 : : the call in the block and insert the instructions on the edge instead.
3432 : :
3433 : : Similarly, handle instructions throwing exceptions internally.
3434 : :
3435 : : Return true when instructions have been found and inserted on edges. */
3436 : :
3437 : : bool
3438 : 1483969 : fixup_abnormal_edges (void)
3439 : : {
3440 : 1483969 : bool inserted = false;
3441 : 1483969 : basic_block bb;
3442 : :
3443 : 17020665 : FOR_EACH_BB_FN (bb, cfun)
3444 : : {
3445 : 15536696 : edge e;
3446 : 15536696 : edge_iterator ei;
3447 : :
3448 : : /* Look for cases we are interested in - calls or instructions causing
3449 : : exceptions. */
3450 : 36561946 : FOR_EACH_EDGE (e, ei, bb->succs)
3451 : 21734349 : if ((e->flags & EDGE_ABNORMAL_CALL)
3452 : 21140252 : || ((e->flags & (EDGE_ABNORMAL | EDGE_EH))
3453 : : == (EDGE_ABNORMAL | EDGE_EH)))
3454 : : break;
3455 : :
3456 : 15536696 : if (e && !CALL_P (BB_END (bb)) && !can_throw_internal (BB_END (bb)))
3457 : : {
3458 : 10513 : rtx_insn *insn;
3459 : :
3460 : : /* Get past the new insns generated. Allow notes, as the insns
3461 : : may be already deleted. */
3462 : 10513 : insn = BB_END (bb);
3463 : 18431 : while ((NONJUMP_INSN_P (insn) || NOTE_P (insn))
3464 : 16617 : && !can_throw_internal (insn)
3465 : 31639 : && insn != BB_HEAD (bb))
3466 : 8364 : insn = PREV_INSN (insn);
3467 : :
3468 : 10513 : if (CALL_P (insn) || can_throw_internal (insn))
3469 : : {
3470 : 6105 : rtx_insn *stop, *next;
3471 : :
3472 : 6105 : e = find_fallthru_edge (bb->succs);
3473 : :
3474 : 6105 : stop = NEXT_INSN (BB_END (bb));
3475 : 6105 : BB_END (bb) = insn;
3476 : :
3477 : 20366 : for (insn = NEXT_INSN (insn); insn != stop; insn = next)
3478 : : {
3479 : 8156 : next = NEXT_INSN (insn);
3480 : 8156 : if (INSN_P (insn))
3481 : : {
3482 : 6946 : delete_insn (insn);
3483 : :
3484 : : /* Sometimes there's still the return value USE.
3485 : : If it's placed after a trapping call (i.e. that
3486 : : call is the last insn anyway), we have no fallthru
3487 : : edge. Simply delete this use and don't try to insert
3488 : : on the non-existent edge.
3489 : : Similarly, sometimes a call that can throw is
3490 : : followed in the source with __builtin_unreachable (),
3491 : : meaning that there is UB if the call returns rather
3492 : : than throws. If there weren't any instructions
3493 : : following such calls before, supposedly even the ones
3494 : : we've deleted aren't significant and can be
3495 : : removed. */
3496 : 6946 : if (e)
3497 : : {
3498 : : /* We're not deleting it, we're moving it. */
3499 : 6945 : insn->set_undeleted ();
3500 : 6945 : SET_PREV_INSN (insn) = NULL_RTX;
3501 : 6945 : SET_NEXT_INSN (insn) = NULL_RTX;
3502 : :
3503 : 6945 : insert_insn_on_edge (insn, e);
3504 : 6945 : inserted = true;
3505 : : }
3506 : : }
3507 : 1210 : else if (!BARRIER_P (insn))
3508 : 1210 : set_block_for_insn (insn, NULL);
3509 : : }
3510 : : }
3511 : :
3512 : : /* It may be that we don't find any trapping insn. In this
3513 : : case we discovered quite late that the insn that had been
3514 : : marked as can_throw_internal in fact couldn't trap at all.
3515 : : So we should in fact delete the EH edges out of the block. */
3516 : : else
3517 : 4408 : purge_dead_edges (bb);
3518 : : }
3519 : : }
3520 : :
3521 : 1483969 : return inserted;
3522 : : }
3523 : :
3524 : : /* Delete the unconditional jump INSN and adjust the CFG correspondingly.
3525 : : Note that the INSN should be deleted *after* removing dead edges, so
3526 : : that the kept edge is the fallthrough edge for a (set (pc) (pc))
3527 : : but not for a (set (pc) (label_ref FOO)). */
3528 : :
3529 : : void
3530 : 4880 : update_cfg_for_uncondjump (rtx_insn *insn)
3531 : : {
3532 : 4880 : basic_block bb = BLOCK_FOR_INSN (insn);
3533 : 4880 : gcc_assert (BB_END (bb) == insn);
3534 : :
3535 : 4880 : purge_dead_edges (bb);
3536 : :
3537 : 4880 : if (current_ir_type () != IR_RTL_CFGLAYOUT)
3538 : : {
3539 : 18 : if (!find_fallthru_edge (bb->succs))
3540 : : {
3541 : 18 : auto barrier = next_nonnote_nondebug_insn (insn);
3542 : 18 : if (!barrier || !BARRIER_P (barrier))
3543 : 18 : emit_barrier_after (insn);
3544 : : }
3545 : 18 : return;
3546 : : }
3547 : :
3548 : 4862 : delete_insn (insn);
3549 : 4862 : if (EDGE_COUNT (bb->succs) == 1)
3550 : : {
3551 : 2402 : rtx_insn *insn;
3552 : :
3553 : 2402 : single_succ_edge (bb)->flags |= EDGE_FALLTHRU;
3554 : :
3555 : : /* Remove barriers from the footer if there are any. */
3556 : 2403 : for (insn = BB_FOOTER (bb); insn; insn = NEXT_INSN (insn))
3557 : 1 : if (BARRIER_P (insn))
3558 : : {
3559 : 1 : if (PREV_INSN (insn))
3560 : 0 : SET_NEXT_INSN (PREV_INSN (insn)) = NEXT_INSN (insn);
3561 : : else
3562 : 1 : BB_FOOTER (bb) = NEXT_INSN (insn);
3563 : 1 : if (NEXT_INSN (insn))
3564 : 0 : SET_PREV_INSN (NEXT_INSN (insn)) = PREV_INSN (insn);
3565 : : }
3566 : 0 : else if (LABEL_P (insn))
3567 : : break;
3568 : : }
3569 : : }
3570 : :
3571 : : /* Cut the insns from FIRST to LAST out of the insns stream. */
3572 : :
3573 : : rtx_insn *
3574 : 11976358 : unlink_insn_chain (rtx_insn *first, rtx_insn *last)
3575 : : {
3576 : 11976358 : rtx_insn *prevfirst = PREV_INSN (first);
3577 : 11976358 : rtx_insn *nextlast = NEXT_INSN (last);
3578 : :
3579 : 11976358 : SET_PREV_INSN (first) = NULL;
3580 : 11976358 : SET_NEXT_INSN (last) = NULL;
3581 : 11976358 : if (prevfirst)
3582 : 9502577 : SET_NEXT_INSN (prevfirst) = nextlast;
3583 : 11976358 : if (nextlast)
3584 : 10551358 : SET_PREV_INSN (nextlast) = prevfirst;
3585 : : else
3586 : 1425000 : set_last_insn (prevfirst);
3587 : 11976358 : if (!prevfirst)
3588 : 2473781 : set_first_insn (nextlast);
3589 : 11976358 : return first;
3590 : : }
3591 : :
3592 : : /* Skip over inter-block insns occurring after BB which are typically
3593 : : associated with BB (e.g., barriers). If there are any such insns,
3594 : : we return the last one. Otherwise, we return the end of BB. */
3595 : :
3596 : : static rtx_insn *
3597 : 26396840 : skip_insns_after_block (basic_block bb)
3598 : : {
3599 : 26396840 : rtx_insn *insn, *last_insn, *next_head, *prev;
3600 : :
3601 : 26396840 : next_head = NULL;
3602 : 26396840 : if (bb->next_bb != EXIT_BLOCK_PTR_FOR_FN (cfun))
3603 : 23923044 : next_head = BB_HEAD (bb->next_bb);
3604 : :
3605 : 35275121 : for (last_insn = insn = BB_END (bb); (insn = NEXT_INSN (insn)) != 0; )
3606 : : {
3607 : 32801325 : if (insn == next_head)
3608 : : break;
3609 : :
3610 : 8878281 : switch (GET_CODE (insn))
3611 : : {
3612 : 7810160 : case BARRIER:
3613 : 7810160 : last_insn = insn;
3614 : 7810160 : continue;
3615 : :
3616 : 1048447 : case NOTE:
3617 : 1048447 : gcc_assert (NOTE_KIND (insn) != NOTE_INSN_BLOCK_END);
3618 : 1048447 : continue;
3619 : :
3620 : 19674 : case CODE_LABEL:
3621 : 19674 : if (NEXT_INSN (insn)
3622 : 19674 : && JUMP_TABLE_DATA_P (NEXT_INSN (insn)))
3623 : : {
3624 : 19674 : insn = NEXT_INSN (insn);
3625 : 19674 : last_insn = insn;
3626 : 19674 : continue;
3627 : : }
3628 : : break;
3629 : :
3630 : : default:
3631 : : break;
3632 : : }
3633 : :
3634 : : break;
3635 : : }
3636 : :
3637 : : /* It is possible to hit contradictory sequence. For instance:
3638 : :
3639 : : jump_insn
3640 : : NOTE_INSN_BLOCK_BEG
3641 : : barrier
3642 : :
3643 : : Where barrier belongs to jump_insn, but the note does not. This can be
3644 : : created by removing the basic block originally following
3645 : : NOTE_INSN_BLOCK_BEG. In such case reorder the notes. */
3646 : :
3647 : 34246491 : for (insn = last_insn; insn != BB_END (bb); insn = prev)
3648 : : {
3649 : 7849651 : prev = PREV_INSN (insn);
3650 : 7849651 : if (NOTE_P (insn))
3651 : 143 : switch (NOTE_KIND (insn))
3652 : : {
3653 : 0 : case NOTE_INSN_BLOCK_END:
3654 : 0 : gcc_unreachable ();
3655 : 143 : break;
3656 : 143 : case NOTE_INSN_DELETED:
3657 : 143 : case NOTE_INSN_DELETED_LABEL:
3658 : 143 : case NOTE_INSN_DELETED_DEBUG_LABEL:
3659 : 143 : continue;
3660 : 0 : default:
3661 : 0 : reorder_insns (insn, insn, last_insn);
3662 : : }
3663 : : }
3664 : :
3665 : 26396840 : return last_insn;
3666 : : }
3667 : :
3668 : : /* Locate or create a label for a given basic block. */
3669 : :
3670 : : static rtx_insn *
3671 : 2280822 : label_for_bb (basic_block bb)
3672 : : {
3673 : 2280822 : rtx_insn *label = BB_HEAD (bb);
3674 : :
3675 : 2280822 : if (!LABEL_P (label))
3676 : : {
3677 : 1424657 : if (dump_file)
3678 : 10 : fprintf (dump_file, "Emitting label for block %d\n", bb->index);
3679 : :
3680 : 1424657 : label = block_label (bb);
3681 : : }
3682 : :
3683 : 2280822 : return label;
3684 : : }
3685 : :
3686 : : /* Locate the effective beginning and end of the insn chain for each
3687 : : block, as defined by skip_insns_after_block above. */
3688 : :
3689 : : static void
3690 : 2473796 : record_effective_endpoints (void)
3691 : : {
3692 : 2473796 : rtx_insn *next_insn;
3693 : 2473796 : basic_block bb;
3694 : 2473796 : rtx_insn *insn;
3695 : :
3696 : 2473796 : for (insn = get_insns ();
3697 : : insn
3698 : 4950094 : && NOTE_P (insn)
3699 : 9899124 : && NOTE_KIND (insn) != NOTE_INSN_BASIC_BLOCK;
3700 : 2476298 : insn = NEXT_INSN (insn))
3701 : 2476298 : continue;
3702 : : /* No basic blocks at all? */
3703 : 2473796 : gcc_assert (insn);
3704 : :
3705 : 2473796 : if (PREV_INSN (insn))
3706 : 2473781 : cfg_layout_function_header =
3707 : 2473781 : unlink_insn_chain (get_insns (), PREV_INSN (insn));
3708 : : else
3709 : 15 : cfg_layout_function_header = NULL;
3710 : :
3711 : 2473796 : next_insn = get_insns ();
3712 : 28870636 : FOR_EACH_BB_FN (bb, cfun)
3713 : : {
3714 : 26396840 : rtx_insn *end;
3715 : :
3716 : 26396840 : if (PREV_INSN (BB_HEAD (bb)) && next_insn != BB_HEAD (bb))
3717 : 41597 : BB_HEADER (bb) = unlink_insn_chain (next_insn,
3718 : 41597 : PREV_INSN (BB_HEAD (bb)));
3719 : 26396840 : end = skip_insns_after_block (bb);
3720 : 26396840 : if (NEXT_INSN (BB_END (bb)) && BB_END (bb) != end)
3721 : 7754065 : BB_FOOTER (bb) = unlink_insn_chain (NEXT_INSN (BB_END (bb)), end);
3722 : 26396840 : next_insn = NEXT_INSN (BB_END (bb));
3723 : : }
3724 : :
3725 : 2473796 : cfg_layout_function_footer = next_insn;
3726 : 2473796 : if (cfg_layout_function_footer)
3727 : 1000660 : cfg_layout_function_footer = unlink_insn_chain (cfg_layout_function_footer, get_last_insn ());
3728 : 2476298 : }
3729 : :
3730 : : namespace {
3731 : :
3732 : : const pass_data pass_data_into_cfg_layout_mode =
3733 : : {
3734 : : RTL_PASS, /* type */
3735 : : "into_cfglayout", /* name */
3736 : : OPTGROUP_NONE, /* optinfo_flags */
3737 : : TV_CFG, /* tv_id */
3738 : : 0, /* properties_required */
3739 : : PROP_cfglayout, /* properties_provided */
3740 : : 0, /* properties_destroyed */
3741 : : 0, /* todo_flags_start */
3742 : : 0, /* todo_flags_finish */
3743 : : };
3744 : :
3745 : : class pass_into_cfg_layout_mode : public rtl_opt_pass
3746 : : {
3747 : : public:
3748 : 285081 : pass_into_cfg_layout_mode (gcc::context *ctxt)
3749 : 570162 : : rtl_opt_pass (pass_data_into_cfg_layout_mode, ctxt)
3750 : : {}
3751 : :
3752 : : /* opt_pass methods: */
3753 : 1449852 : unsigned int execute (function *) final override
3754 : : {
3755 : 1449852 : cfg_layout_initialize (0);
3756 : 1449852 : return 0;
3757 : : }
3758 : :
3759 : : }; // class pass_into_cfg_layout_mode
3760 : :
3761 : : } // anon namespace
3762 : :
3763 : : rtl_opt_pass *
3764 : 285081 : make_pass_into_cfg_layout_mode (gcc::context *ctxt)
3765 : : {
3766 : 285081 : return new pass_into_cfg_layout_mode (ctxt);
3767 : : }
3768 : :
3769 : : namespace {
3770 : :
3771 : : const pass_data pass_data_outof_cfg_layout_mode =
3772 : : {
3773 : : RTL_PASS, /* type */
3774 : : "outof_cfglayout", /* name */
3775 : : OPTGROUP_NONE, /* optinfo_flags */
3776 : : TV_CFG, /* tv_id */
3777 : : 0, /* properties_required */
3778 : : 0, /* properties_provided */
3779 : : PROP_cfglayout, /* properties_destroyed */
3780 : : 0, /* todo_flags_start */
3781 : : 0, /* todo_flags_finish */
3782 : : };
3783 : :
3784 : : class pass_outof_cfg_layout_mode : public rtl_opt_pass
3785 : : {
3786 : : public:
3787 : 285081 : pass_outof_cfg_layout_mode (gcc::context *ctxt)
3788 : 570162 : : rtl_opt_pass (pass_data_outof_cfg_layout_mode, ctxt)
3789 : : {}
3790 : :
3791 : : /* opt_pass methods: */
3792 : : unsigned int execute (function *) final override;
3793 : :
3794 : : }; // class pass_outof_cfg_layout_mode
3795 : :
3796 : : unsigned int
3797 : 1449853 : pass_outof_cfg_layout_mode::execute (function *fun)
3798 : : {
3799 : 1449853 : basic_block bb;
3800 : :
3801 : 14852626 : FOR_EACH_BB_FN (bb, fun)
3802 : 13402773 : if (bb->next_bb != EXIT_BLOCK_PTR_FOR_FN (fun))
3803 : 11952920 : bb->aux = bb->next_bb;
3804 : :
3805 : 1449853 : cfg_layout_finalize ();
3806 : :
3807 : 1449853 : return 0;
3808 : : }
3809 : :
3810 : : } // anon namespace
3811 : :
3812 : : rtl_opt_pass *
3813 : 285081 : make_pass_outof_cfg_layout_mode (gcc::context *ctxt)
3814 : : {
3815 : 285081 : return new pass_outof_cfg_layout_mode (ctxt);
3816 : : }
3817 : :
3818 : :
3819 : : /* Link the basic blocks in the correct order, compacting the basic
3820 : : block queue while at it. If STAY_IN_CFGLAYOUT_MODE is false, this
3821 : : function also clears the basic block header and footer fields.
3822 : :
3823 : : This function is usually called after a pass (e.g. tracer) finishes
3824 : : some transformations while in cfglayout mode. The required sequence
3825 : : of the basic blocks is in a linked list along the bb->aux field.
3826 : : This functions re-links the basic block prev_bb and next_bb pointers
3827 : : accordingly, and it compacts and renumbers the blocks.
3828 : :
3829 : : FIXME: This currently works only for RTL, but the only RTL-specific
3830 : : bits are the STAY_IN_CFGLAYOUT_MODE bits. The tracer pass was moved
3831 : : to GIMPLE a long time ago, but it doesn't relink the basic block
3832 : : chain. It could do that (to give better initial RTL) if this function
3833 : : is made IR-agnostic (and moved to cfganal.cc or cfg.cc while at it). */
3834 : :
3835 : : void
3836 : 3102580 : relink_block_chain (bool stay_in_cfglayout_mode)
3837 : : {
3838 : 3102580 : basic_block bb, prev_bb;
3839 : 3102580 : int index;
3840 : :
3841 : : /* Maybe dump the re-ordered sequence. */
3842 : 3102580 : if (dump_file)
3843 : : {
3844 : 168 : fprintf (dump_file, "Reordered sequence:\n");
3845 : 168 : for (bb = ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb, index =
3846 : : NUM_FIXED_BLOCKS;
3847 : 1132 : bb;
3848 : 964 : bb = (basic_block) bb->aux, index++)
3849 : : {
3850 : 964 : fprintf (dump_file, " %i ", index);
3851 : 964 : if (get_bb_original (bb))
3852 : 28 : fprintf (dump_file, "duplicate of %i\n",
3853 : 28 : get_bb_original (bb)->index);
3854 : 936 : else if (forwarder_block_p (bb)
3855 : 936 : && !LABEL_P (BB_HEAD (bb)))
3856 : 17 : fprintf (dump_file, "compensation\n");
3857 : : else
3858 : 919 : fprintf (dump_file, "bb %i\n", bb->index);
3859 : : }
3860 : : }
3861 : :
3862 : : /* Now reorder the blocks. */
3863 : 3102580 : prev_bb = ENTRY_BLOCK_PTR_FOR_FN (cfun);
3864 : 3102580 : bb = ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb;
3865 : 38401345 : for (; bb; prev_bb = bb, bb = (basic_block) bb->aux)
3866 : : {
3867 : 35298765 : bb->prev_bb = prev_bb;
3868 : 35298765 : prev_bb->next_bb = bb;
3869 : : }
3870 : 3102580 : prev_bb->next_bb = EXIT_BLOCK_PTR_FOR_FN (cfun);
3871 : 3102580 : EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb = prev_bb;
3872 : :
3873 : : /* Then, clean up the aux fields. */
3874 : 44606505 : FOR_ALL_BB_FN (bb, cfun)
3875 : : {
3876 : 41503925 : bb->aux = NULL;
3877 : 41503925 : if (!stay_in_cfglayout_mode)
3878 : 29769911 : BB_HEADER (bb) = BB_FOOTER (bb) = NULL;
3879 : : }
3880 : :
3881 : : /* Maybe reset the original copy tables, they are not valid anymore
3882 : : when we renumber the basic blocks in compact_blocks. If we are
3883 : : are going out of cfglayout mode, don't re-allocate the tables. */
3884 : 3102580 : if (original_copy_tables_initialized_p ())
3885 : 3102579 : free_original_copy_tables ();
3886 : 3102580 : if (stay_in_cfglayout_mode)
3887 : 628783 : initialize_original_copy_tables ();
3888 : :
3889 : : /* Finally, put basic_block_info in the new order. */
3890 : 3102580 : compact_blocks ();
3891 : 3102580 : }
3892 : :
3893 : :
3894 : : /* Given a reorder chain, rearrange the code to match. */
3895 : :
3896 : : static void
3897 : 2473797 : fixup_reorder_chain (void)
3898 : : {
3899 : 2473797 : basic_block bb;
3900 : 2473797 : rtx_insn *insn = NULL;
3901 : :
3902 : 2473797 : if (cfg_layout_function_header)
3903 : : {
3904 : 2473781 : set_first_insn (cfg_layout_function_header);
3905 : 2473781 : insn = cfg_layout_function_header;
3906 : 2476298 : while (NEXT_INSN (insn))
3907 : : insn = NEXT_INSN (insn);
3908 : : }
3909 : :
3910 : : /* First do the bulk reordering -- rechain the blocks without regard to
3911 : : the needed changes to jumps and labels. */
3912 : :
3913 : 26476405 : for (bb = ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb; bb; bb = (basic_block)
3914 : : bb->aux)
3915 : : {
3916 : 24002608 : if (BB_HEADER (bb))
3917 : : {
3918 : 40764 : if (insn)
3919 : 40764 : SET_NEXT_INSN (insn) = BB_HEADER (bb);
3920 : : else
3921 : 0 : set_first_insn (BB_HEADER (bb));
3922 : 40764 : SET_PREV_INSN (BB_HEADER (bb)) = insn;
3923 : 40764 : insn = BB_HEADER (bb);
3924 : 46428 : while (NEXT_INSN (insn))
3925 : : insn = NEXT_INSN (insn);
3926 : : }
3927 : 24002608 : if (insn)
3928 : 24002592 : SET_NEXT_INSN (insn) = BB_HEAD (bb);
3929 : : else
3930 : 16 : set_first_insn (BB_HEAD (bb));
3931 : 24002608 : SET_PREV_INSN (BB_HEAD (bb)) = insn;
3932 : 24002608 : insn = BB_END (bb);
3933 : 24002608 : if (BB_FOOTER (bb))
3934 : : {
3935 : 2955407 : SET_NEXT_INSN (insn) = BB_FOOTER (bb);
3936 : 2955407 : SET_PREV_INSN (BB_FOOTER (bb)) = insn;
3937 : 5973366 : while (NEXT_INSN (insn))
3938 : : insn = NEXT_INSN (insn);
3939 : : }
3940 : : }
3941 : :
3942 : 2473797 : SET_NEXT_INSN (insn) = cfg_layout_function_footer;
3943 : 2473797 : if (cfg_layout_function_footer)
3944 : 1000669 : SET_PREV_INSN (cfg_layout_function_footer) = insn;
3945 : :
3946 : 3475147 : while (NEXT_INSN (insn))
3947 : : insn = NEXT_INSN (insn);
3948 : :
3949 : 2473797 : set_last_insn (insn);
3950 : 2473797 : if (flag_checking)
3951 : 2473759 : verify_insn_chain ();
3952 : :
3953 : : /* Now add jumps and labels as needed to match the blocks new
3954 : : outgoing edges. */
3955 : :
3956 : 2473797 : bool remove_unreachable_blocks = false;
3957 : 26476405 : for (bb = ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb; bb ; bb = (basic_block)
3958 : : bb->aux)
3959 : : {
3960 : 24002608 : edge e_fall, e_taken, e;
3961 : 24002608 : rtx_insn *bb_end_insn;
3962 : 24002608 : rtx ret_label = NULL_RTX;
3963 : 24002608 : basic_block nb;
3964 : 24002608 : edge_iterator ei;
3965 : 24002608 : bool asm_goto = false;
3966 : :
3967 : 24002608 : if (EDGE_COUNT (bb->succs) == 0)
3968 : 19843966 : continue;
3969 : :
3970 : : /* Find the old fallthru edge, and another non-EH edge for
3971 : : a taken jump. */
3972 : 22739985 : e_taken = e_fall = NULL;
3973 : :
3974 : 58000862 : FOR_EACH_EDGE (e, ei, bb->succs)
3975 : 35260877 : if (e->flags & EDGE_FALLTHRU)
3976 : : e_fall = e;
3977 : 14212733 : else if (! (e->flags & EDGE_EH))
3978 : 12898616 : e_taken = e;
3979 : :
3980 : 22739985 : bb_end_insn = BB_END (bb);
3981 : 22739985 : if (rtx_jump_insn *bb_end_jump = dyn_cast <rtx_jump_insn *> (bb_end_insn))
3982 : : {
3983 : 12446506 : ret_label = JUMP_LABEL (bb_end_jump);
3984 : 12446506 : if (any_condjump_p (bb_end_jump))
3985 : : {
3986 : : /* This might happen if the conditional jump has side
3987 : : effects and could therefore not be optimized away.
3988 : : Make the basic block to end with a barrier in order
3989 : : to prevent rtl_verify_flow_info from complaining. */
3990 : 11106529 : if (!e_fall)
3991 : : {
3992 : 0 : gcc_assert (!onlyjump_p (bb_end_jump)
3993 : : || returnjump_p (bb_end_jump)
3994 : : || (e_taken->flags & EDGE_CROSSING));
3995 : 0 : emit_barrier_after (bb_end_jump);
3996 : 0 : continue;
3997 : : }
3998 : :
3999 : : /* If the old fallthru is still next, nothing to do. */
4000 : 11106529 : if (bb->aux == e_fall->dest
4001 : 2761641 : || e_fall->dest == EXIT_BLOCK_PTR_FOR_FN (cfun))
4002 : 8344900 : continue;
4003 : :
4004 : : /* The degenerated case of conditional jump jumping to the next
4005 : : instruction can happen for jumps with side effects. We need
4006 : : to construct a forwarder block and this will be done just
4007 : : fine by force_nonfallthru below. */
4008 : 2761629 : if (!e_taken)
4009 : : ;
4010 : :
4011 : : /* There is another special case: if *neither* block is next,
4012 : : such as happens at the very end of a function, then we'll
4013 : : need to add a new unconditional jump. Choose the taken
4014 : : edge based on known or assumed probability. */
4015 : 2761629 : else if (bb->aux != e_taken->dest)
4016 : : {
4017 : 634449 : rtx note = find_reg_note (bb_end_jump, REG_BR_PROB, 0);
4018 : :
4019 : 634449 : if (note
4020 : : && profile_probability::from_reg_br_prob_note
4021 : 606052 : (XINT (note, 0)) < profile_probability::even ()
4022 : 851634 : && invert_jump (bb_end_jump,
4023 : 217185 : (e_fall->dest
4024 : 217185 : == EXIT_BLOCK_PTR_FOR_FN (cfun)
4025 : : ? NULL_RTX
4026 : 217185 : : label_for_bb (e_fall->dest)), 0))
4027 : : {
4028 : 217185 : e_fall->flags &= ~EDGE_FALLTHRU;
4029 : 217185 : gcc_checking_assert (could_fall_through
4030 : : (e_taken->src, e_taken->dest));
4031 : 217185 : e_taken->flags |= EDGE_FALLTHRU;
4032 : 217185 : update_br_prob_note (bb);
4033 : 217185 : e = e_fall, e_fall = e_taken, e_taken = e;
4034 : : }
4035 : : }
4036 : :
4037 : : /* If the "jumping" edge is a crossing edge, and the fall
4038 : : through edge is non-crossing, leave things as they are. */
4039 : 2127180 : else if ((e_taken->flags & EDGE_CROSSING)
4040 : 63543 : && !(e_fall->flags & EDGE_CROSSING))
4041 : 63543 : continue;
4042 : :
4043 : : /* Otherwise we can try to invert the jump. This will
4044 : : basically never fail, however, keep up the pretense. */
4045 : 2063637 : else if (invert_jump (bb_end_jump,
4046 : : (e_fall->dest
4047 : : == EXIT_BLOCK_PTR_FOR_FN (cfun)
4048 : : ? NULL_RTX
4049 : 2063637 : : label_for_bb (e_fall->dest)), 0))
4050 : : {
4051 : 2063637 : e_fall->flags &= ~EDGE_FALLTHRU;
4052 : 2063637 : gcc_checking_assert (could_fall_through
4053 : : (e_taken->src, e_taken->dest));
4054 : 2063637 : e_taken->flags |= EDGE_FALLTHRU;
4055 : 2063637 : update_br_prob_note (bb);
4056 : 2063637 : if (LABEL_NUSES (ret_label) == 0
4057 : 2063637 : && single_pred_p (e_taken->dest))
4058 : 1279091 : delete_insn (as_a<rtx_insn *> (ret_label));
4059 : 2063637 : continue;
4060 : : }
4061 : : }
4062 : 1339977 : else if (extract_asm_operands (PATTERN (bb_end_insn)) != NULL)
4063 : : {
4064 : : /* If the old fallthru is still next or if
4065 : : asm goto doesn't have a fallthru (e.g. when followed by
4066 : : __builtin_unreachable ()), nothing to do. */
4067 : 867 : if (! e_fall
4068 : 801 : || bb->aux == e_fall->dest
4069 : 72 : || e_fall->dest == EXIT_BLOCK_PTR_FOR_FN (cfun))
4070 : 795 : continue;
4071 : :
4072 : : /* Otherwise we'll have to use the fallthru fixup below.
4073 : : But avoid redirecting asm goto to EXIT. */
4074 : : asm_goto = true;
4075 : : }
4076 : : else
4077 : : {
4078 : : /* Otherwise we have some return, switch or computed
4079 : : jump. In the 99% case, there should not have been a
4080 : : fallthru edge. */
4081 : 1339110 : gcc_assert (returnjump_p (bb_end_insn) || !e_fall);
4082 : 1339110 : continue;
4083 : : }
4084 : : }
4085 : : else
4086 : : {
4087 : : /* No fallthru implies a noreturn function with EH edges, or
4088 : : something similarly bizarre. In any case, we don't need to
4089 : : do anything. */
4090 : 10293479 : if (! e_fall)
4091 : 352665 : continue;
4092 : :
4093 : : /* If the fallthru block is still next, nothing to do. */
4094 : 9940814 : if (bb->aux == e_fall->dest)
4095 : 5067155 : continue;
4096 : :
4097 : : /* A fallthru to exit block. */
4098 : 4873659 : if (e_fall->dest == EXIT_BLOCK_PTR_FOR_FN (cfun))
4099 : 1349538 : continue;
4100 : : }
4101 : :
4102 : : /* If E_FALL->dest is just a return block, then we can emit a
4103 : : return rather than a jump to the return block. */
4104 : 634449 : rtx_insn *ret, *use;
4105 : 634449 : basic_block dest;
4106 : 634449 : if (!asm_goto
4107 : 4158570 : && bb_is_just_return (e_fall->dest, &ret, &use)
4108 : 843 : && ((PATTERN (ret) == simple_return_rtx && targetm.have_simple_return ())
4109 : 0 : || (PATTERN (ret) == ret_rtx && targetm.have_return ())))
4110 : : {
4111 : 843 : ret_label = PATTERN (ret);
4112 : 843 : dest = EXIT_BLOCK_PTR_FOR_FN (cfun);
4113 : :
4114 : 843 : e_fall->flags &= ~EDGE_CROSSING;
4115 : : /* E_FALL->dest might become unreachable as a result of
4116 : : replacing the jump with a return. So arrange to remove
4117 : : unreachable blocks. */
4118 : 843 : remove_unreachable_blocks = true;
4119 : : }
4120 : : else
4121 : : {
4122 : 4157799 : dest = e_fall->dest;
4123 : : }
4124 : :
4125 : : /* We got here if we need to add a new jump insn.
4126 : : Note force_nonfallthru can delete E_FALL and thus we have to
4127 : : save E_FALL->src prior to the call to force_nonfallthru. */
4128 : 4158642 : nb = force_nonfallthru_and_redirect (e_fall, dest, ret_label);
4129 : 4158642 : if (nb)
4130 : : {
4131 : 819709 : nb->aux = bb->aux;
4132 : 819709 : bb->aux = nb;
4133 : : /* Don't process this new block. */
4134 : 819709 : bb = nb;
4135 : : }
4136 : : }
4137 : :
4138 : 2473797 : relink_block_chain (/*stay_in_cfglayout_mode=*/false);
4139 : :
4140 : : /* Annoying special case - jump around dead jumptables left in the code. */
4141 : 27359657 : FOR_EACH_BB_FN (bb, cfun)
4142 : : {
4143 : 24885860 : edge e = find_fallthru_edge (bb->succs);
4144 : :
4145 : 24885860 : if (e && !can_fallthru (e->src, e->dest))
4146 : 63543 : force_nonfallthru (e);
4147 : : }
4148 : :
4149 : : /* Ensure goto_locus from edges has some instructions with that locus in RTL
4150 : : when not optimizing. */
4151 : 2473797 : if (!optimize && !DECL_IGNORED_P (current_function_decl))
4152 : 3787121 : FOR_EACH_BB_FN (bb, cfun)
4153 : : {
4154 : 3363161 : edge e;
4155 : 3363161 : edge_iterator ei;
4156 : :
4157 : 8003412 : FOR_EACH_EDGE (e, ei, bb->succs)
4158 : 4640251 : if (LOCATION_LOCUS (e->goto_locus) != UNKNOWN_LOCATION
4159 : 4640251 : && !(e->flags & EDGE_ABNORMAL))
4160 : : {
4161 : 703874 : edge e2;
4162 : 703874 : edge_iterator ei2;
4163 : 703874 : basic_block dest, nb;
4164 : 703874 : rtx_insn *end;
4165 : :
4166 : 703874 : insn = BB_END (e->src);
4167 : 703874 : end = PREV_INSN (BB_HEAD (e->src));
4168 : 703874 : while (insn != end
4169 : 849287 : && (!NONDEBUG_INSN_P (insn) || !INSN_HAS_LOCATION (insn)))
4170 : 145413 : insn = PREV_INSN (insn);
4171 : 1193356 : if (insn != end
4172 : 703874 : && loc_equal (INSN_LOCATION (insn), e->goto_locus))
4173 : 508639 : continue;
4174 : 214392 : if (simplejump_p (BB_END (e->src))
4175 : 214392 : && !INSN_HAS_LOCATION (BB_END (e->src)))
4176 : : {
4177 : 0 : INSN_LOCATION (BB_END (e->src)) = e->goto_locus;
4178 : 0 : continue;
4179 : : }
4180 : 214392 : dest = e->dest;
4181 : 214392 : if (dest == EXIT_BLOCK_PTR_FOR_FN (cfun))
4182 : : {
4183 : : /* Non-fallthru edges to the exit block cannot be split. */
4184 : 141626 : if (!(e->flags & EDGE_FALLTHRU))
4185 : 0 : continue;
4186 : : }
4187 : : else
4188 : : {
4189 : 72766 : insn = BB_HEAD (dest);
4190 : 72766 : end = NEXT_INSN (BB_END (dest));
4191 : 286926 : while (insn != end && !NONDEBUG_INSN_P (insn))
4192 : 141394 : insn = NEXT_INSN (insn);
4193 : 45782 : if (insn != end && INSN_HAS_LOCATION (insn)
4194 : 117077 : && loc_equal (INSN_LOCATION (insn), e->goto_locus))
4195 : 19157 : continue;
4196 : : }
4197 : 195235 : nb = split_edge (e);
4198 : 195235 : if (!INSN_P (BB_END (nb)))
4199 : 195235 : BB_END (nb) = emit_insn_after_noloc (gen_nop (), BB_END (nb),
4200 : : nb);
4201 : 195235 : INSN_LOCATION (BB_END (nb)) = e->goto_locus;
4202 : :
4203 : : /* If there are other incoming edges to the destination block
4204 : : with the same goto locus, redirect them to the new block as
4205 : : well, this can prevent other such blocks from being created
4206 : : in subsequent iterations of the loop. */
4207 : 444010 : for (ei2 = ei_start (dest->preds); (e2 = ei_safe_edge (ei2)); )
4208 : 248775 : if (LOCATION_LOCUS (e2->goto_locus) != UNKNOWN_LOCATION
4209 : 39391 : && !(e2->flags & (EDGE_ABNORMAL | EDGE_FALLTHRU))
4210 : 288166 : && e->goto_locus == e2->goto_locus)
4211 : 21714 : redirect_edge_and_branch (e2, nb);
4212 : : else
4213 : 227061 : ei_next (&ei2);
4214 : : }
4215 : : }
4216 : :
4217 : : /* Replacing a jump with a return may have exposed an unreachable
4218 : : block. Conditionally remove them if such transformations were
4219 : : made. */
4220 : 2473797 : if (remove_unreachable_blocks)
4221 : 828 : delete_unreachable_blocks ();
4222 : 2473797 : }
4223 : :
4224 : : /* Perform sanity checks on the insn chain.
4225 : : 1. Check that next/prev pointers are consistent in both the forward and
4226 : : reverse direction.
4227 : : 2. Count insns in chain, going both directions, and check if equal.
4228 : : 3. Check that get_last_insn () returns the actual end of chain. */
4229 : :
4230 : : DEBUG_FUNCTION void
4231 : 4947518 : verify_insn_chain (void)
4232 : : {
4233 : 4947518 : rtx_insn *x, *prevx, *nextx;
4234 : 4947518 : int insn_cnt1, insn_cnt2;
4235 : :
4236 : 4947518 : for (prevx = NULL, insn_cnt1 = 1, x = get_insns ();
4237 : 600554337 : x != 0;
4238 : 595606819 : prevx = x, insn_cnt1++, x = NEXT_INSN (x))
4239 : 595606819 : gcc_assert (PREV_INSN (x) == prevx);
4240 : :
4241 : 4947518 : gcc_assert (prevx == get_last_insn ());
4242 : :
4243 : : for (nextx = NULL, insn_cnt2 = 1, x = get_last_insn ();
4244 : 600554337 : x != 0;
4245 : 595606819 : nextx = x, insn_cnt2++, x = PREV_INSN (x))
4246 : 595606819 : gcc_assert (NEXT_INSN (x) == nextx);
4247 : :
4248 : 4947518 : gcc_assert (insn_cnt1 == insn_cnt2);
4249 : 4947518 : }
4250 : :
4251 : : /* If we have assembler epilogues, the block falling through to exit must
4252 : : be the last one in the reordered chain when we reach final. Ensure
4253 : : that this condition is met. */
4254 : : static void
4255 : 0 : fixup_fallthru_exit_predecessor (void)
4256 : : {
4257 : 0 : edge e;
4258 : 0 : basic_block bb = NULL;
4259 : :
4260 : : /* This transformation is not valid before reload, because we might
4261 : : separate a call from the instruction that copies the return
4262 : : value. */
4263 : 0 : gcc_assert (reload_completed);
4264 : :
4265 : 0 : e = find_fallthru_edge (EXIT_BLOCK_PTR_FOR_FN (cfun)->preds);
4266 : 0 : if (e)
4267 : 0 : bb = e->src;
4268 : :
4269 : 0 : if (bb && bb->aux)
4270 : : {
4271 : 0 : basic_block c = ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb;
4272 : :
4273 : : /* If the very first block is the one with the fall-through exit
4274 : : edge, we have to split that block. */
4275 : 0 : if (c == bb)
4276 : : {
4277 : 0 : bb = split_block_after_labels (bb)->dest;
4278 : 0 : bb->aux = c->aux;
4279 : 0 : c->aux = bb;
4280 : 0 : BB_FOOTER (bb) = BB_FOOTER (c);
4281 : 0 : BB_FOOTER (c) = NULL;
4282 : : }
4283 : :
4284 : 0 : while (c->aux != bb)
4285 : : c = (basic_block) c->aux;
4286 : :
4287 : 0 : c->aux = bb->aux;
4288 : 0 : while (c->aux)
4289 : : c = (basic_block) c->aux;
4290 : :
4291 : 0 : c->aux = bb;
4292 : 0 : bb->aux = NULL;
4293 : : }
4294 : 0 : }
4295 : :
4296 : : /* In case there are more than one fallthru predecessors of exit, force that
4297 : : there is only one. */
4298 : :
4299 : : static void
4300 : 2473797 : force_one_exit_fallthru (void)
4301 : : {
4302 : 2473797 : edge e, predecessor = NULL;
4303 : 2473797 : bool more = false;
4304 : 2473797 : edge_iterator ei;
4305 : 2473797 : basic_block forwarder, bb;
4306 : :
4307 : 5241231 : FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR_FOR_FN (cfun)->preds)
4308 : 2767435 : if (e->flags & EDGE_FALLTHRU)
4309 : : {
4310 : 1349551 : if (predecessor == NULL)
4311 : : predecessor = e;
4312 : : else
4313 : : {
4314 : : more = true;
4315 : : break;
4316 : : }
4317 : : }
4318 : :
4319 : 2473797 : if (!more)
4320 : 2473796 : return;
4321 : :
4322 : : /* Exit has several fallthru predecessors. Create a forwarder block for
4323 : : them. */
4324 : 1 : forwarder = split_edge (predecessor);
4325 : 1 : for (ei = ei_start (EXIT_BLOCK_PTR_FOR_FN (cfun)->preds);
4326 : 3 : (e = ei_safe_edge (ei)); )
4327 : : {
4328 : 2 : if (e->src == forwarder
4329 : 1 : || !(e->flags & EDGE_FALLTHRU))
4330 : 1 : ei_next (&ei);
4331 : : else
4332 : 1 : redirect_edge_and_branch_force (e, forwarder);
4333 : : }
4334 : :
4335 : : /* Fix up the chain of blocks -- make FORWARDER immediately precede the
4336 : : exit block. */
4337 : 5 : FOR_EACH_BB_FN (bb, cfun)
4338 : : {
4339 : 5 : if (bb->aux == NULL && bb != forwarder)
4340 : : {
4341 : 1 : bb->aux = forwarder;
4342 : 1 : break;
4343 : : }
4344 : : }
4345 : : }
4346 : :
4347 : : /* Return true in case it is possible to duplicate the basic block BB. */
4348 : :
4349 : : static bool
4350 : 8240183 : cfg_layout_can_duplicate_bb_p (const_basic_block bb)
4351 : : {
4352 : : /* Do not attempt to duplicate tablejumps, as we need to unshare
4353 : : the dispatch table. This is difficult to do, as the instructions
4354 : : computing jump destination may be hoisted outside the basic block. */
4355 : 8240183 : if (tablejump_p (BB_END (bb), NULL, NULL))
4356 : : return false;
4357 : :
4358 : : /* Do not duplicate blocks containing insns that can't be copied. */
4359 : 8235757 : if (targetm.cannot_copy_insn_p)
4360 : : {
4361 : 0 : rtx_insn *insn = BB_HEAD (bb);
4362 : 0 : while (1)
4363 : : {
4364 : 0 : if (INSN_P (insn) && targetm.cannot_copy_insn_p (insn))
4365 : : return false;
4366 : 0 : if (insn == BB_END (bb))
4367 : : break;
4368 : 0 : insn = NEXT_INSN (insn);
4369 : : }
4370 : : }
4371 : :
4372 : : return true;
4373 : : }
4374 : :
4375 : : rtx_insn *
4376 : 877385 : duplicate_insn_chain (rtx_insn *from, rtx_insn *to,
4377 : : class loop *loop, copy_bb_data *id)
4378 : : {
4379 : 877385 : rtx_insn *insn, *next, *copy;
4380 : 877385 : rtx_note *last;
4381 : :
4382 : : /* Avoid updating of boundaries of previous basic block. The
4383 : : note will get removed from insn stream in fixup. */
4384 : 877385 : last = emit_note (NOTE_INSN_DELETED);
4385 : :
4386 : : /* Create copy at the end of INSN chain. The chain will
4387 : : be reordered later. */
4388 : 6078611 : for (insn = from; insn != NEXT_INSN (to); insn = NEXT_INSN (insn))
4389 : : {
4390 : 5201226 : switch (GET_CODE (insn))
4391 : : {
4392 : 1329056 : case DEBUG_INSN:
4393 : : /* Don't duplicate label debug insns. */
4394 : 1329056 : if (DEBUG_BIND_INSN_P (insn)
4395 : 992688 : && TREE_CODE (INSN_VAR_LOCATION_DECL (insn)) == LABEL_DECL)
4396 : : break;
4397 : : /* FALLTHRU */
4398 : 3484802 : case INSN:
4399 : 3484802 : case CALL_INSN:
4400 : 3484802 : case JUMP_INSN:
4401 : 3484802 : copy = emit_copy_of_insn_after (insn, get_last_insn ());
4402 : 3484802 : if (JUMP_P (insn) && JUMP_LABEL (insn) != NULL_RTX
4403 : 473167 : && ANY_RETURN_P (JUMP_LABEL (insn)))
4404 : 184431 : JUMP_LABEL (copy) = JUMP_LABEL (insn);
4405 : 3484802 : maybe_copy_prologue_epilogue_insn (insn, copy);
4406 : : /* If requested remap dependence info of cliques brought in
4407 : : via inlining. */
4408 : 3484802 : if (id)
4409 : : {
4410 : 1890266 : subrtx_iterator::array_type array;
4411 : 11449752 : FOR_EACH_SUBRTX (iter, array, PATTERN (insn), ALL)
4412 : 9564256 : if (MEM_P (*iter) && MEM_EXPR (*iter))
4413 : : {
4414 : 307668 : tree op = MEM_EXPR (*iter);
4415 : 307668 : if (TREE_CODE (op) == WITH_SIZE_EXPR)
4416 : 0 : op = TREE_OPERAND (op, 0);
4417 : 339053 : while (handled_component_p (op))
4418 : 31385 : op = TREE_OPERAND (op, 0);
4419 : 307668 : if ((TREE_CODE (op) == MEM_REF
4420 : 307668 : || TREE_CODE (op) == TARGET_MEM_REF)
4421 : 290559 : && MR_DEPENDENCE_CLIQUE (op) > 1
4422 : 319429 : && (!loop
4423 : 11761 : || (MR_DEPENDENCE_CLIQUE (op)
4424 : 11761 : != loop->owned_clique)))
4425 : : {
4426 : 1177 : if (!id->dependence_map)
4427 : 590 : id->dependence_map = new hash_map<dependence_hash,
4428 : : unsigned short>;
4429 : 1177 : bool existed;
4430 : 1177 : unsigned short &newc = id->dependence_map->get_or_insert
4431 : 1177 : (MR_DEPENDENCE_CLIQUE (op), &existed);
4432 : 1177 : if (!existed)
4433 : : {
4434 : 604 : gcc_assert
4435 : : (MR_DEPENDENCE_CLIQUE (op) <= cfun->last_clique);
4436 : 1208 : newc = get_new_clique (cfun);
4437 : : }
4438 : : /* We cannot adjust MR_DEPENDENCE_CLIQUE in-place
4439 : : since MEM_EXPR is shared so make a copy and
4440 : : walk to the subtree again. */
4441 : 1177 : tree new_expr = unshare_expr (MEM_EXPR (*iter));
4442 : 1177 : tree orig_new_expr = new_expr;
4443 : 1177 : if (TREE_CODE (new_expr) == WITH_SIZE_EXPR)
4444 : 0 : new_expr = TREE_OPERAND (new_expr, 0);
4445 : 1554 : while (handled_component_p (new_expr))
4446 : 377 : new_expr = TREE_OPERAND (new_expr, 0);
4447 : 1177 : MR_DEPENDENCE_CLIQUE (new_expr) = newc;
4448 : 1177 : set_mem_expr (const_cast <rtx> (*iter), orig_new_expr);
4449 : : }
4450 : : }
4451 : 1890266 : }
4452 : : break;
4453 : :
4454 : 0 : case JUMP_TABLE_DATA:
4455 : : /* Avoid copying of dispatch tables. We never duplicate
4456 : : tablejumps, so this can hit only in case the table got
4457 : : moved far from original jump.
4458 : : Avoid copying following barrier as well if any
4459 : : (and debug insns in between). */
4460 : 0 : for (next = NEXT_INSN (insn);
4461 : 0 : next != NEXT_INSN (to);
4462 : 0 : next = NEXT_INSN (next))
4463 : 0 : if (!DEBUG_INSN_P (next))
4464 : : break;
4465 : 0 : if (next != NEXT_INSN (to) && BARRIER_P (next))
4466 : 5201226 : insn = next;
4467 : : break;
4468 : :
4469 : : case CODE_LABEL:
4470 : : break;
4471 : :
4472 : 185664 : case BARRIER:
4473 : 185664 : emit_barrier ();
4474 : 185664 : break;
4475 : :
4476 : 908314 : case NOTE:
4477 : 908314 : switch (NOTE_KIND (insn))
4478 : : {
4479 : : /* In case prologue is empty and function contain label
4480 : : in first BB, we may want to copy the block. */
4481 : : case NOTE_INSN_PROLOGUE_END:
4482 : :
4483 : : case NOTE_INSN_DELETED:
4484 : : case NOTE_INSN_DELETED_LABEL:
4485 : : case NOTE_INSN_DELETED_DEBUG_LABEL:
4486 : : /* No problem to strip these. */
4487 : : case NOTE_INSN_FUNCTION_BEG:
4488 : : /* There is always just single entry to function. */
4489 : : case NOTE_INSN_BASIC_BLOCK:
4490 : : /* We should only switch text sections once. */
4491 : : case NOTE_INSN_SWITCH_TEXT_SECTIONS:
4492 : : break;
4493 : :
4494 : 182081 : case NOTE_INSN_EPILOGUE_BEG:
4495 : 182081 : case NOTE_INSN_UPDATE_SJLJ_CONTEXT:
4496 : 182081 : emit_note_copy (as_a <rtx_note *> (insn));
4497 : 182081 : break;
4498 : :
4499 : 0 : default:
4500 : : /* All other notes should have already been eliminated. */
4501 : 0 : gcc_unreachable ();
4502 : : }
4503 : : break;
4504 : 0 : default:
4505 : 0 : gcc_unreachable ();
4506 : : }
4507 : : }
4508 : 877385 : insn = NEXT_INSN (last);
4509 : 877385 : delete_insn (last);
4510 : 877385 : return insn;
4511 : : }
4512 : :
4513 : : /* Create a duplicate of the basic block BB. */
4514 : :
4515 : : static basic_block
4516 : 689351 : cfg_layout_duplicate_bb (basic_block bb, copy_bb_data *id)
4517 : : {
4518 : 689351 : rtx_insn *insn;
4519 : 689351 : basic_block new_bb;
4520 : :
4521 : 689351 : class loop *loop = (id && current_loops) ? bb->loop_father : NULL;
4522 : :
4523 : 689351 : insn = duplicate_insn_chain (BB_HEAD (bb), BB_END (bb), loop, id);
4524 : 689351 : new_bb = create_basic_block (insn,
4525 : : insn ? get_last_insn () : NULL,
4526 : 689351 : EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb);
4527 : :
4528 : 689351 : BB_COPY_PARTITION (new_bb, bb);
4529 : 689351 : if (BB_HEADER (bb))
4530 : : {
4531 : : insn = BB_HEADER (bb);
4532 : 2460 : while (NEXT_INSN (insn))
4533 : : insn = NEXT_INSN (insn);
4534 : 2237 : insn = duplicate_insn_chain (BB_HEADER (bb), insn, loop, id);
4535 : 2237 : if (insn)
4536 : 0 : BB_HEADER (new_bb) = unlink_insn_chain (insn, get_last_insn ());
4537 : : }
4538 : :
4539 : 689351 : if (BB_FOOTER (bb))
4540 : : {
4541 : : insn = BB_FOOTER (bb);
4542 : 185785 : while (NEXT_INSN (insn))
4543 : : insn = NEXT_INSN (insn);
4544 : 185589 : insn = duplicate_insn_chain (BB_FOOTER (bb), insn, loop, id);
4545 : 185589 : if (insn)
4546 : 185588 : BB_FOOTER (new_bb) = unlink_insn_chain (insn, get_last_insn ());
4547 : : }
4548 : :
4549 : 689351 : return new_bb;
4550 : : }
4551 : :
4552 : :
4553 : : /* Main entry point to this module - initialize the datastructures for
4554 : : CFG layout changes. It keeps LOOPS up-to-date if not null.
4555 : :
4556 : : FLAGS is a set of additional flags to pass to cleanup_cfg(). */
4557 : :
4558 : : void
4559 : 2473796 : cfg_layout_initialize (int flags)
4560 : : {
4561 : 2473796 : rtx_insn_list *x;
4562 : 2473796 : basic_block bb;
4563 : :
4564 : : /* Once bb partitioning is complete, cfg layout mode should not be
4565 : : re-entered. Entering cfg layout mode may require fixups. As an
4566 : : example, if edge forwarding performed when optimizing the cfg
4567 : : layout required moving a block from the hot to the cold
4568 : : section. This would create an illegal partitioning unless some
4569 : : manual fixup was performed. */
4570 : 2473796 : gcc_assert (!crtl->bb_reorder_complete || !crtl->has_bb_partition);
4571 : :
4572 : 2473796 : initialize_original_copy_tables ();
4573 : :
4574 : 2473796 : cfg_layout_rtl_register_cfg_hooks ();
4575 : :
4576 : 2473796 : record_effective_endpoints ();
4577 : :
4578 : : /* Make sure that the targets of non local gotos are marked. */
4579 : 2476171 : for (x = nonlocal_goto_handler_labels; x; x = x->next ())
4580 : : {
4581 : 2375 : bb = BLOCK_FOR_INSN (x->insn ());
4582 : 2375 : bb->flags |= BB_NON_LOCAL_GOTO_TARGET;
4583 : : }
4584 : :
4585 : 2473796 : cleanup_cfg (CLEANUP_CFGLAYOUT | flags);
4586 : 2473796 : }
4587 : :
4588 : : /* Splits superblocks. */
4589 : : void
4590 : 65046 : break_superblocks (void)
4591 : : {
4592 : 65046 : bool need = false;
4593 : 65046 : basic_block bb;
4594 : :
4595 : 65046 : auto_sbitmap superblocks (last_basic_block_for_fn (cfun));
4596 : 65046 : bitmap_clear (superblocks);
4597 : :
4598 : 3794919 : FOR_EACH_BB_FN (bb, cfun)
4599 : 3729873 : if (bb->flags & BB_SUPERBLOCK)
4600 : : {
4601 : 221492 : bb->flags &= ~BB_SUPERBLOCK;
4602 : 221492 : bitmap_set_bit (superblocks, bb->index);
4603 : 221492 : need = true;
4604 : : }
4605 : :
4606 : 65046 : if (need)
4607 : : {
4608 : 56179 : rebuild_jump_labels (get_insns ());
4609 : 56179 : find_many_sub_basic_blocks (superblocks);
4610 : : }
4611 : 65046 : }
4612 : :
4613 : : /* Finalize the changes: reorder insn list according to the sequence specified
4614 : : by aux pointers, enter compensation code, rebuild scope forest. */
4615 : :
4616 : : void
4617 : 2473797 : cfg_layout_finalize (void)
4618 : : {
4619 : 2473797 : free_dominance_info (CDI_DOMINATORS);
4620 : 2473797 : force_one_exit_fallthru ();
4621 : 2473797 : rtl_register_cfg_hooks ();
4622 : 2473797 : if (reload_completed && !targetm.have_epilogue ())
4623 : 0 : fixup_fallthru_exit_predecessor ();
4624 : 2473797 : fixup_reorder_chain ();
4625 : :
4626 : 2473797 : rebuild_jump_labels (get_insns ());
4627 : 2473797 : delete_dead_jumptables ();
4628 : :
4629 : 2473797 : if (flag_checking)
4630 : 2473759 : verify_insn_chain ();
4631 : 2473797 : checking_verify_flow_info ();
4632 : 2473797 : }
4633 : :
4634 : :
4635 : : /* Same as split_block but update cfg_layout structures. */
4636 : :
4637 : : static basic_block
4638 : 16684 : cfg_layout_split_block (basic_block bb, void *insnp)
4639 : : {
4640 : 16684 : rtx insn = (rtx) insnp;
4641 : 16684 : basic_block new_bb = rtl_split_block (bb, insn);
4642 : :
4643 : 16684 : BB_FOOTER (new_bb) = BB_FOOTER (bb);
4644 : 16684 : BB_FOOTER (bb) = NULL;
4645 : :
4646 : 16684 : return new_bb;
4647 : : }
4648 : :
4649 : : /* Redirect Edge to DEST. */
4650 : : static edge
4651 : 10060979 : cfg_layout_redirect_edge_and_branch (edge e, basic_block dest)
4652 : : {
4653 : 10060979 : basic_block src = e->src;
4654 : 10060979 : edge ret;
4655 : :
4656 : 10060979 : if (e->flags & (EDGE_ABNORMAL_CALL | EDGE_EH))
4657 : : return NULL;
4658 : :
4659 : 10060979 : if (e->dest == dest)
4660 : : return e;
4661 : :
4662 : 10060979 : if (e->flags & EDGE_CROSSING
4663 : 3 : && BB_PARTITION (e->src) == BB_PARTITION (dest)
4664 : 10060979 : && simplejump_p (BB_END (src)))
4665 : : {
4666 : 0 : if (dump_file)
4667 : 0 : fprintf (dump_file,
4668 : : "Removing crossing jump while redirecting edge form %i to %i\n",
4669 : 0 : e->src->index, dest->index);
4670 : 0 : delete_insn (BB_END (src));
4671 : 0 : remove_barriers_from_footer (src);
4672 : 0 : e->flags |= EDGE_FALLTHRU;
4673 : : }
4674 : :
4675 : 10060979 : if (e->src != ENTRY_BLOCK_PTR_FOR_FN (cfun)
4676 : 10060979 : && (ret = try_redirect_by_replacing_jump (e, dest, true)))
4677 : : {
4678 : 281556 : df_set_bb_dirty (src);
4679 : 281556 : return ret;
4680 : : }
4681 : :
4682 : 9779423 : if (e->src == ENTRY_BLOCK_PTR_FOR_FN (cfun)
4683 : 0 : && (e->flags & EDGE_FALLTHRU) && !(e->flags & EDGE_COMPLEX))
4684 : : {
4685 : 0 : if (dump_file)
4686 : 0 : fprintf (dump_file, "Redirecting entry edge from bb %i to %i\n",
4687 : : e->src->index, dest->index);
4688 : :
4689 : 0 : df_set_bb_dirty (e->src);
4690 : 0 : redirect_edge_succ (e, dest);
4691 : 0 : return e;
4692 : : }
4693 : :
4694 : : /* Redirect_edge_and_branch may decide to turn branch into fallthru edge
4695 : : in the case the basic block appears to be in sequence. Avoid this
4696 : : transformation. */
4697 : :
4698 : 9779423 : if (e->flags & EDGE_FALLTHRU)
4699 : : {
4700 : : /* Redirect any branch edges unified with the fallthru one. */
4701 : 4865123 : if (JUMP_P (BB_END (src))
4702 : 4865123 : && label_is_jump_target_p (BB_HEAD (e->dest),
4703 : : BB_END (src)))
4704 : : {
4705 : 99 : edge redirected;
4706 : :
4707 : 99 : if (dump_file)
4708 : 0 : fprintf (dump_file, "Fallthru edge unified with branch "
4709 : : "%i->%i redirected to %i\n",
4710 : 0 : e->src->index, e->dest->index, dest->index);
4711 : 99 : e->flags &= ~EDGE_FALLTHRU;
4712 : 99 : redirected = redirect_branch_edge (e, dest);
4713 : 99 : gcc_assert (redirected);
4714 : 99 : redirected->flags |= EDGE_FALLTHRU;
4715 : 99 : df_set_bb_dirty (redirected->src);
4716 : 99 : return redirected;
4717 : : }
4718 : : /* In case we are redirecting fallthru edge to the branch edge
4719 : : of conditional jump, remove it. */
4720 : 4865024 : if (EDGE_COUNT (src->succs) == 2)
4721 : : {
4722 : : /* Find the edge that is different from E. */
4723 : 3818018 : edge s = EDGE_SUCC (src, EDGE_SUCC (src, 0) == e);
4724 : :
4725 : 3818018 : if (s->dest == dest
4726 : 25 : && any_condjump_p (BB_END (src))
4727 : 3818018 : && onlyjump_p (BB_END (src)))
4728 : 0 : delete_insn (BB_END (src));
4729 : : }
4730 : 4865024 : if (dump_file)
4731 : 2200 : fprintf (dump_file, "Redirecting fallthru edge %i->%i to %i\n",
4732 : 2200 : e->src->index, e->dest->index, dest->index);
4733 : 4865024 : ret = redirect_edge_succ_nodup (e, dest);
4734 : : }
4735 : : else
4736 : 4914300 : ret = redirect_branch_edge (e, dest);
4737 : :
4738 : 9779324 : if (!ret)
4739 : : return NULL;
4740 : :
4741 : 9779324 : fixup_partition_crossing (ret);
4742 : : /* We don't want simplejumps in the insn stream during cfglayout. */
4743 : 9779324 : gcc_assert (!simplejump_p (BB_END (src)) || CROSSING_JUMP_P (BB_END (src)));
4744 : :
4745 : 9779324 : df_set_bb_dirty (src);
4746 : 9779324 : return ret;
4747 : : }
4748 : :
4749 : : /* Simple wrapper as we always can redirect fallthru edges. */
4750 : : static basic_block
4751 : 4701240 : cfg_layout_redirect_edge_and_branch_force (edge e, basic_block dest)
4752 : : {
4753 : 4701240 : edge redirected = cfg_layout_redirect_edge_and_branch (e, dest);
4754 : :
4755 : 4701240 : gcc_assert (redirected);
4756 : 4701240 : return NULL;
4757 : : }
4758 : :
4759 : : /* Same as delete_basic_block but update cfg_layout structures. */
4760 : :
4761 : : static void
4762 : 5643516 : cfg_layout_delete_block (basic_block bb)
4763 : : {
4764 : 5643516 : rtx_insn *insn, *next, *prev = PREV_INSN (BB_HEAD (bb)), *remaints;
4765 : 5643516 : rtx_insn **to;
4766 : :
4767 : 5643516 : if (BB_HEADER (bb))
4768 : : {
4769 : 52 : next = BB_HEAD (bb);
4770 : 52 : if (prev)
4771 : 52 : SET_NEXT_INSN (prev) = BB_HEADER (bb);
4772 : : else
4773 : 0 : set_first_insn (BB_HEADER (bb));
4774 : 52 : SET_PREV_INSN (BB_HEADER (bb)) = prev;
4775 : 52 : insn = BB_HEADER (bb);
4776 : 53 : while (NEXT_INSN (insn))
4777 : : insn = NEXT_INSN (insn);
4778 : 52 : SET_NEXT_INSN (insn) = next;
4779 : 52 : SET_PREV_INSN (next) = insn;
4780 : : }
4781 : 5643516 : next = NEXT_INSN (BB_END (bb));
4782 : 5643516 : if (BB_FOOTER (bb))
4783 : : {
4784 : : insn = BB_FOOTER (bb);
4785 : 3116707 : while (insn)
4786 : : {
4787 : 1558356 : if (BARRIER_P (insn))
4788 : : {
4789 : 1558354 : if (PREV_INSN (insn))
4790 : 2 : SET_NEXT_INSN (PREV_INSN (insn)) = NEXT_INSN (insn);
4791 : : else
4792 : 1558352 : BB_FOOTER (bb) = NEXT_INSN (insn);
4793 : 1558354 : if (NEXT_INSN (insn))
4794 : 3 : SET_PREV_INSN (NEXT_INSN (insn)) = PREV_INSN (insn);
4795 : : }
4796 : 1558356 : if (LABEL_P (insn))
4797 : : break;
4798 : 1558355 : insn = NEXT_INSN (insn);
4799 : : }
4800 : 1558352 : if (BB_FOOTER (bb))
4801 : : {
4802 : 2 : insn = BB_END (bb);
4803 : 2 : SET_NEXT_INSN (insn) = BB_FOOTER (bb);
4804 : 2 : SET_PREV_INSN (BB_FOOTER (bb)) = insn;
4805 : 6 : while (NEXT_INSN (insn))
4806 : : insn = NEXT_INSN (insn);
4807 : 2 : SET_NEXT_INSN (insn) = next;
4808 : 2 : if (next)
4809 : 1 : SET_PREV_INSN (next) = insn;
4810 : : else
4811 : 1 : set_last_insn (insn);
4812 : : }
4813 : : }
4814 : 5643516 : if (bb->next_bb != EXIT_BLOCK_PTR_FOR_FN (cfun))
4815 : 5610781 : to = &BB_HEADER (bb->next_bb);
4816 : : else
4817 : : to = &cfg_layout_function_footer;
4818 : :
4819 : 5643516 : rtl_delete_block (bb);
4820 : :
4821 : 5643516 : if (prev)
4822 : 5643516 : prev = NEXT_INSN (prev);
4823 : : else
4824 : 0 : prev = get_insns ();
4825 : 5643516 : if (next)
4826 : 5610775 : next = PREV_INSN (next);
4827 : : else
4828 : 32741 : next = get_last_insn ();
4829 : :
4830 : 11287032 : if (next && NEXT_INSN (next) != prev)
4831 : : {
4832 : 1440 : remaints = unlink_insn_chain (prev, next);
4833 : 1440 : insn = remaints;
4834 : 3059 : while (NEXT_INSN (insn))
4835 : : insn = NEXT_INSN (insn);
4836 : 1440 : SET_NEXT_INSN (insn) = *to;
4837 : 1440 : if (*to)
4838 : 224 : SET_PREV_INSN (*to) = insn;
4839 : 1440 : *to = remaints;
4840 : : }
4841 : 5643516 : }
4842 : :
4843 : : /* Return true when blocks A and B can be safely merged. */
4844 : :
4845 : : static bool
4846 : 3074251 : cfg_layout_can_merge_blocks_p (basic_block a, basic_block b)
4847 : : {
4848 : : /* If we are partitioning hot/cold basic blocks, we don't want to
4849 : : mess up unconditional or indirect jumps that cross between hot
4850 : : and cold sections.
4851 : :
4852 : : Basic block partitioning may result in some jumps that appear to
4853 : : be optimizable (or blocks that appear to be mergeable), but which really
4854 : : must be left untouched (they are required to make it safely across
4855 : : partition boundaries). See the comments at the top of
4856 : : bb-reorder.cc:partition_hot_cold_basic_blocks for complete details. */
4857 : :
4858 : 3074251 : if (BB_PARTITION (a) != BB_PARTITION (b))
4859 : : return false;
4860 : :
4861 : : /* Protect the loop latches. */
4862 : 2921029 : if (current_loops && b->loop_father->latch == b)
4863 : : return false;
4864 : :
4865 : : /* If we would end up moving B's instructions, make sure it doesn't fall
4866 : : through into the exit block, since we cannot recover from a fallthrough
4867 : : edge into the exit block occurring in the middle of a function. */
4868 : 2539361 : if (NEXT_INSN (BB_END (a)) != BB_HEAD (b))
4869 : : {
4870 : 1637465 : edge e = find_fallthru_edge (b->succs);
4871 : 1637465 : if (e && e->dest == EXIT_BLOCK_PTR_FOR_FN (cfun))
4872 : : return false;
4873 : : }
4874 : :
4875 : : /* There must be exactly one edge in between the blocks. */
4876 : 1811515 : return (single_succ_p (a)
4877 : 1811515 : && single_succ (a) == b
4878 : 1811515 : && single_pred_p (b) == 1
4879 : 1786665 : && a != b
4880 : : /* Must be simple edge. */
4881 : 1786665 : && !(single_succ_edge (a)->flags & EDGE_COMPLEX)
4882 : 1786665 : && a != ENTRY_BLOCK_PTR_FOR_FN (cfun)
4883 : 1786665 : && b != EXIT_BLOCK_PTR_FOR_FN (cfun)
4884 : : /* If the jump insn has side effects, we can't kill the edge.
4885 : : When not optimizing, try_redirect_by_replacing_jump will
4886 : : not allow us to redirect an edge by replacing a table jump. */
4887 : 3598180 : && (!JUMP_P (BB_END (a))
4888 : 80976 : || ((!optimize || reload_completed)
4889 : 63799 : ? simplejump_p (BB_END (a)) : onlyjump_p (BB_END (a)))));
4890 : : }
4891 : :
4892 : : /* Merge block A and B. The blocks must be mergeable. */
4893 : :
4894 : : static void
4895 : 892314 : cfg_layout_merge_blocks (basic_block a, basic_block b)
4896 : : {
4897 : : /* If B is a forwarder block whose outgoing edge has no location, we'll
4898 : : propagate the locus of the edge between A and B onto it. */
4899 : 892314 : const bool forward_edge_locus
4900 : 892314 : = (b->flags & BB_FORWARDER_BLOCK) != 0
4901 : 892314 : && LOCATION_LOCUS (EDGE_SUCC (b, 0)->goto_locus) == UNKNOWN_LOCATION;
4902 : 892314 : rtx_insn *insn;
4903 : :
4904 : 892314 : gcc_checking_assert (cfg_layout_can_merge_blocks_p (a, b));
4905 : :
4906 : 892314 : if (dump_file)
4907 : 74 : fprintf (dump_file, "Merging block %d into block %d...\n", b->index,
4908 : : a->index);
4909 : :
4910 : : /* If there was a CODE_LABEL beginning B, delete it. */
4911 : 892314 : if (LABEL_P (BB_HEAD (b)))
4912 : : {
4913 : 359921 : delete_insn (BB_HEAD (b));
4914 : : }
4915 : :
4916 : : /* We should have fallthru edge in a, or we can do dummy redirection to get
4917 : : it cleaned up. */
4918 : 892314 : if (JUMP_P (BB_END (a)))
4919 : 30881 : try_redirect_by_replacing_jump (EDGE_SUCC (a, 0), b, true);
4920 : 892314 : gcc_assert (!JUMP_P (BB_END (a)));
4921 : :
4922 : : /* If not optimizing, preserve the locus of the single edge between
4923 : : blocks A and B if necessary by emitting a nop. */
4924 : 892314 : if (!optimize
4925 : 4879 : && !forward_edge_locus
4926 : 896866 : && !DECL_IGNORED_P (current_function_decl))
4927 : 4552 : emit_nop_for_unique_locus_between (a, b);
4928 : :
4929 : : /* Move things from b->footer after a->footer. */
4930 : 892314 : if (BB_FOOTER (b))
4931 : : {
4932 : 201774 : if (!BB_FOOTER (a))
4933 : 201773 : BB_FOOTER (a) = BB_FOOTER (b);
4934 : : else
4935 : : {
4936 : : rtx_insn *last = BB_FOOTER (a);
4937 : :
4938 : 1 : while (NEXT_INSN (last))
4939 : : last = NEXT_INSN (last);
4940 : 1 : SET_NEXT_INSN (last) = BB_FOOTER (b);
4941 : 1 : SET_PREV_INSN (BB_FOOTER (b)) = last;
4942 : : }
4943 : 201774 : BB_FOOTER (b) = NULL;
4944 : : }
4945 : :
4946 : : /* Move things from b->header before a->footer.
4947 : : Note that this may include dead tablejump data, but we don't clean
4948 : : those up until we go out of cfglayout mode. */
4949 : 892314 : if (BB_HEADER (b))
4950 : : {
4951 : 1988 : if (! BB_FOOTER (a))
4952 : 929 : BB_FOOTER (a) = BB_HEADER (b);
4953 : : else
4954 : : {
4955 : : rtx_insn *last = BB_HEADER (b);
4956 : :
4957 : 1086 : while (NEXT_INSN (last))
4958 : : last = NEXT_INSN (last);
4959 : 1059 : SET_NEXT_INSN (last) = BB_FOOTER (a);
4960 : 1059 : SET_PREV_INSN (BB_FOOTER (a)) = last;
4961 : 1059 : BB_FOOTER (a) = BB_HEADER (b);
4962 : : }
4963 : 1988 : BB_HEADER (b) = NULL;
4964 : : }
4965 : :
4966 : : /* In the case basic blocks are not adjacent, move them around. */
4967 : 892314 : if (NEXT_INSN (BB_END (a)) != BB_HEAD (b))
4968 : : {
4969 : 449124 : insn = unlink_insn_chain (BB_HEAD (b), BB_END (b));
4970 : :
4971 : 449124 : emit_insn_after_noloc (insn, BB_END (a), a);
4972 : : }
4973 : : /* Otherwise just re-associate the instructions. */
4974 : : else
4975 : : {
4976 : 443190 : insn = BB_HEAD (b);
4977 : 443190 : BB_END (a) = BB_END (b);
4978 : : }
4979 : :
4980 : : /* emit_insn_after_noloc doesn't call df_insn_change_bb.
4981 : : We need to explicitly call. */
4982 : 892314 : update_bb_for_insn_chain (insn, BB_END (b), a);
4983 : :
4984 : : /* Skip possible DELETED_LABEL insn. */
4985 : 892314 : if (!NOTE_INSN_BASIC_BLOCK_P (insn))
4986 : 0 : insn = NEXT_INSN (insn);
4987 : 892314 : gcc_assert (NOTE_INSN_BASIC_BLOCK_P (insn));
4988 : 892314 : BB_HEAD (b) = BB_END (b) = NULL;
4989 : 892314 : delete_insn (insn);
4990 : :
4991 : 892314 : df_bb_delete (b->index);
4992 : :
4993 : 892314 : if (forward_edge_locus)
4994 : 182993 : EDGE_SUCC (b, 0)->goto_locus = EDGE_SUCC (a, 0)->goto_locus;
4995 : :
4996 : 892314 : if (dump_file)
4997 : 74 : fprintf (dump_file, "Merged blocks %d and %d.\n", a->index, b->index);
4998 : 892314 : }
4999 : :
5000 : : /* Split edge E. */
5001 : :
5002 : : static basic_block
5003 : 3465259 : cfg_layout_split_edge (edge e)
5004 : : {
5005 : 3465259 : basic_block new_bb =
5006 : 6930518 : create_basic_block (e->src != ENTRY_BLOCK_PTR_FOR_FN (cfun)
5007 : 3465259 : ? NEXT_INSN (BB_END (e->src)) : get_insns (),
5008 : : NULL_RTX, e->src);
5009 : :
5010 : 3465259 : if (e->dest == EXIT_BLOCK_PTR_FOR_FN (cfun))
5011 : 1 : BB_COPY_PARTITION (new_bb, e->src);
5012 : : else
5013 : 3465258 : BB_COPY_PARTITION (new_bb, e->dest);
5014 : 3465259 : make_edge (new_bb, e->dest, EDGE_FALLTHRU);
5015 : 3465259 : redirect_edge_and_branch_force (e, new_bb);
5016 : :
5017 : 3465259 : return new_bb;
5018 : : }
5019 : :
5020 : : /* Do postprocessing after making a forwarder block joined by edge FALLTHRU. */
5021 : :
5022 : : static void
5023 : 1754 : rtl_make_forwarder_block (edge fallthru ATTRIBUTE_UNUSED)
5024 : : {
5025 : 1754 : }
5026 : :
5027 : : /* Return true if BB contains only labels or non-executable
5028 : : instructions. */
5029 : :
5030 : : static bool
5031 : 0 : rtl_block_empty_p (basic_block bb)
5032 : : {
5033 : 0 : rtx_insn *insn;
5034 : :
5035 : 0 : if (bb == ENTRY_BLOCK_PTR_FOR_FN (cfun)
5036 : 0 : || bb == EXIT_BLOCK_PTR_FOR_FN (cfun))
5037 : : return true;
5038 : :
5039 : 0 : FOR_BB_INSNS (bb, insn)
5040 : 0 : if (NONDEBUG_INSN_P (insn)
5041 : 0 : && (!any_uncondjump_p (insn) || !onlyjump_p (insn)))
5042 : 0 : return false;
5043 : :
5044 : : return true;
5045 : : }
5046 : :
5047 : : /* Split a basic block if it ends with a conditional branch and if
5048 : : the other part of the block is not empty. */
5049 : :
5050 : : static basic_block
5051 : 0 : rtl_split_block_before_cond_jump (basic_block bb)
5052 : : {
5053 : 0 : rtx_insn *insn;
5054 : 0 : rtx_insn *split_point = NULL;
5055 : 0 : rtx_insn *last = NULL;
5056 : 0 : bool found_code = false;
5057 : :
5058 : 0 : FOR_BB_INSNS (bb, insn)
5059 : : {
5060 : 0 : if (any_condjump_p (insn))
5061 : : split_point = last;
5062 : 0 : else if (NONDEBUG_INSN_P (insn))
5063 : 0 : found_code = true;
5064 : 0 : last = insn;
5065 : : }
5066 : :
5067 : : /* Did not find everything. */
5068 : 0 : if (found_code && split_point)
5069 : 0 : return split_block (bb, split_point)->dest;
5070 : : else
5071 : : return NULL;
5072 : : }
5073 : :
5074 : : /* Return true if BB ends with a call, possibly followed by some
5075 : : instructions that must stay with the call, false otherwise. */
5076 : :
5077 : : static bool
5078 : 9704744 : rtl_block_ends_with_call_p (basic_block bb)
5079 : : {
5080 : 9704744 : rtx_insn *insn = BB_END (bb);
5081 : :
5082 : 9704744 : while (!CALL_P (insn)
5083 : 10941720 : && insn != BB_HEAD (bb)
5084 : 23163331 : && (keep_with_call_p (insn)
5085 : 10885452 : || NOTE_P (insn)
5086 : 10769587 : || DEBUG_INSN_P (insn)))
5087 : 2572784 : insn = PREV_INSN (insn);
5088 : 9704744 : return (CALL_P (insn));
5089 : : }
5090 : :
5091 : : /* Return true if BB ends with a conditional branch, false otherwise. */
5092 : :
5093 : : static bool
5094 : 0 : rtl_block_ends_with_condjump_p (const_basic_block bb)
5095 : : {
5096 : 0 : return any_condjump_p (BB_END (bb));
5097 : : }
5098 : :
5099 : : /* Return true if we need to add fake edge to exit.
5100 : : Helper function for rtl_flow_call_edges_add. */
5101 : :
5102 : : static bool
5103 : 0 : need_fake_edge_p (const rtx_insn *insn)
5104 : : {
5105 : 0 : if (!INSN_P (insn))
5106 : : return false;
5107 : :
5108 : 0 : if ((CALL_P (insn)
5109 : 0 : && !SIBLING_CALL_P (insn)
5110 : 0 : && !find_reg_note (insn, REG_NORETURN, NULL)
5111 : 0 : && !(RTL_CONST_OR_PURE_CALL_P (insn))))
5112 : : return true;
5113 : :
5114 : 0 : return ((GET_CODE (PATTERN (insn)) == ASM_OPERANDS
5115 : 0 : && MEM_VOLATILE_P (PATTERN (insn)))
5116 : 0 : || (GET_CODE (PATTERN (insn)) == PARALLEL
5117 : 0 : && asm_noperands (insn) != -1
5118 : 0 : && MEM_VOLATILE_P (XVECEXP (PATTERN (insn), 0, 0)))
5119 : 0 : || GET_CODE (PATTERN (insn)) == ASM_INPUT);
5120 : : }
5121 : :
5122 : : /* Add fake edges to the function exit for any non constant and non noreturn
5123 : : calls, volatile inline assembly in the bitmap of blocks specified by
5124 : : BLOCKS or to the whole CFG if BLOCKS is zero. Return the number of blocks
5125 : : that were split.
5126 : :
5127 : : The goal is to expose cases in which entering a basic block does not imply
5128 : : that all subsequent instructions must be executed. */
5129 : :
5130 : : static int
5131 : 0 : rtl_flow_call_edges_add (sbitmap blocks)
5132 : : {
5133 : 0 : int i;
5134 : 0 : int blocks_split = 0;
5135 : 0 : int last_bb = last_basic_block_for_fn (cfun);
5136 : 0 : bool check_last_block = false;
5137 : :
5138 : 0 : if (n_basic_blocks_for_fn (cfun) == NUM_FIXED_BLOCKS)
5139 : : return 0;
5140 : :
5141 : 0 : if (! blocks)
5142 : : check_last_block = true;
5143 : : else
5144 : 0 : check_last_block = bitmap_bit_p (blocks,
5145 : 0 : EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb->index);
5146 : :
5147 : : /* In the last basic block, before epilogue generation, there will be
5148 : : a fallthru edge to EXIT. Special care is required if the last insn
5149 : : of the last basic block is a call because make_edge folds duplicate
5150 : : edges, which would result in the fallthru edge also being marked
5151 : : fake, which would result in the fallthru edge being removed by
5152 : : remove_fake_edges, which would result in an invalid CFG.
5153 : :
5154 : : Moreover, we can't elide the outgoing fake edge, since the block
5155 : : profiler needs to take this into account in order to solve the minimal
5156 : : spanning tree in the case that the call doesn't return.
5157 : :
5158 : : Handle this by adding a dummy instruction in a new last basic block. */
5159 : 0 : if (check_last_block)
5160 : : {
5161 : 0 : basic_block bb = EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb;
5162 : 0 : rtx_insn *insn = BB_END (bb);
5163 : :
5164 : : /* Back up past insns that must be kept in the same block as a call. */
5165 : 0 : while (insn != BB_HEAD (bb)
5166 : 0 : && keep_with_call_p (insn))
5167 : 0 : insn = PREV_INSN (insn);
5168 : :
5169 : 0 : if (need_fake_edge_p (insn))
5170 : : {
5171 : 0 : edge e;
5172 : :
5173 : 0 : e = find_edge (bb, EXIT_BLOCK_PTR_FOR_FN (cfun));
5174 : 0 : if (e)
5175 : : {
5176 : 0 : insert_insn_on_edge (gen_use (const0_rtx), e);
5177 : 0 : commit_edge_insertions ();
5178 : : }
5179 : : }
5180 : : }
5181 : :
5182 : : /* Now add fake edges to the function exit for any non constant
5183 : : calls since there is no way that we can determine if they will
5184 : : return or not... */
5185 : :
5186 : 0 : for (i = NUM_FIXED_BLOCKS; i < last_bb; i++)
5187 : : {
5188 : 0 : basic_block bb = BASIC_BLOCK_FOR_FN (cfun, i);
5189 : 0 : rtx_insn *insn;
5190 : 0 : rtx_insn *prev_insn;
5191 : :
5192 : 0 : if (!bb)
5193 : 0 : continue;
5194 : :
5195 : 0 : if (blocks && !bitmap_bit_p (blocks, i))
5196 : 0 : continue;
5197 : :
5198 : 0 : for (insn = BB_END (bb); ; insn = prev_insn)
5199 : : {
5200 : 0 : prev_insn = PREV_INSN (insn);
5201 : 0 : if (need_fake_edge_p (insn))
5202 : : {
5203 : 0 : edge e;
5204 : 0 : rtx_insn *split_at_insn = insn;
5205 : :
5206 : : /* Don't split the block between a call and an insn that should
5207 : : remain in the same block as the call. */
5208 : 0 : if (CALL_P (insn))
5209 : 0 : while (split_at_insn != BB_END (bb)
5210 : 0 : && keep_with_call_p (NEXT_INSN (split_at_insn)))
5211 : 0 : split_at_insn = NEXT_INSN (split_at_insn);
5212 : :
5213 : : /* The handling above of the final block before the epilogue
5214 : : should be enough to verify that there is no edge to the exit
5215 : : block in CFG already. Calling make_edge in such case would
5216 : : cause us to mark that edge as fake and remove it later. */
5217 : :
5218 : 0 : if (flag_checking && split_at_insn == BB_END (bb))
5219 : : {
5220 : 0 : e = find_edge (bb, EXIT_BLOCK_PTR_FOR_FN (cfun));
5221 : 0 : gcc_assert (e == NULL);
5222 : : }
5223 : :
5224 : : /* Note that the following may create a new basic block
5225 : : and renumber the existing basic blocks. */
5226 : 0 : if (split_at_insn != BB_END (bb))
5227 : : {
5228 : 0 : e = split_block (bb, split_at_insn);
5229 : 0 : if (e)
5230 : 0 : blocks_split++;
5231 : : }
5232 : :
5233 : 0 : edge ne = make_edge (bb, EXIT_BLOCK_PTR_FOR_FN (cfun), EDGE_FAKE);
5234 : 0 : ne->probability = profile_probability::guessed_never ();
5235 : : }
5236 : :
5237 : 0 : if (insn == BB_HEAD (bb))
5238 : : break;
5239 : : }
5240 : : }
5241 : :
5242 : 0 : if (blocks_split)
5243 : 0 : verify_flow_info ();
5244 : :
5245 : : return blocks_split;
5246 : : }
5247 : :
5248 : : /* Add COMP_RTX as a condition at end of COND_BB. FIRST_HEAD is
5249 : : the conditional branch target, SECOND_HEAD should be the fall-thru
5250 : : there is no need to handle this here the loop versioning code handles
5251 : : this. the reason for SECON_HEAD is that it is needed for condition
5252 : : in trees, and this should be of the same type since it is a hook. */
5253 : : static void
5254 : 0 : rtl_lv_add_condition_to_bb (basic_block first_head ,
5255 : : basic_block second_head ATTRIBUTE_UNUSED,
5256 : : basic_block cond_bb, void *comp_rtx)
5257 : : {
5258 : 0 : rtx_code_label *label;
5259 : 0 : rtx_insn *seq, *jump;
5260 : 0 : rtx op0 = XEXP ((rtx)comp_rtx, 0);
5261 : 0 : rtx op1 = XEXP ((rtx)comp_rtx, 1);
5262 : 0 : enum rtx_code comp = GET_CODE ((rtx)comp_rtx);
5263 : 0 : machine_mode mode;
5264 : :
5265 : :
5266 : 0 : label = block_label (first_head);
5267 : 0 : mode = GET_MODE (op0);
5268 : 0 : if (mode == VOIDmode)
5269 : 0 : mode = GET_MODE (op1);
5270 : :
5271 : 0 : start_sequence ();
5272 : 0 : op0 = force_operand (op0, NULL_RTX);
5273 : 0 : op1 = force_operand (op1, NULL_RTX);
5274 : 0 : do_compare_rtx_and_jump (op0, op1, comp, 0, mode, NULL_RTX, NULL, label,
5275 : : profile_probability::uninitialized ());
5276 : 0 : jump = get_last_insn ();
5277 : 0 : JUMP_LABEL (jump) = label;
5278 : 0 : LABEL_NUSES (label)++;
5279 : 0 : seq = end_sequence ();
5280 : :
5281 : : /* Add the new cond, in the new head. */
5282 : 0 : emit_insn_after (seq, BB_END (cond_bb));
5283 : 0 : }
5284 : :
5285 : :
5286 : : /* Given a block B with unconditional branch at its end, get the
5287 : : store the return the branch edge and the fall-thru edge in
5288 : : BRANCH_EDGE and FALLTHRU_EDGE respectively. */
5289 : : static void
5290 : 0 : rtl_extract_cond_bb_edges (basic_block b, edge *branch_edge,
5291 : : edge *fallthru_edge)
5292 : : {
5293 : 0 : edge e = EDGE_SUCC (b, 0);
5294 : :
5295 : 0 : if (e->flags & EDGE_FALLTHRU)
5296 : : {
5297 : 0 : *fallthru_edge = e;
5298 : 0 : *branch_edge = EDGE_SUCC (b, 1);
5299 : : }
5300 : : else
5301 : : {
5302 : 0 : *branch_edge = e;
5303 : 0 : *fallthru_edge = EDGE_SUCC (b, 1);
5304 : : }
5305 : 0 : }
5306 : :
5307 : : void
5308 : 28501791 : init_rtl_bb_info (basic_block bb)
5309 : : {
5310 : 28501791 : gcc_assert (!bb->il.x.rtl);
5311 : 28501791 : bb->il.x.head_ = NULL;
5312 : 28501791 : bb->il.x.rtl = ggc_cleared_alloc<rtl_bb_info> ();
5313 : 28501791 : }
5314 : :
5315 : : static bool
5316 : 2188 : rtl_bb_info_initialized_p (basic_block bb)
5317 : : {
5318 : 2188 : return bb->il.x.rtl;
5319 : : }
5320 : :
5321 : : /* Returns true if it is possible to remove edge E by redirecting
5322 : : it to the destination of the other edge from E->src. */
5323 : :
5324 : : static bool
5325 : 142153 : rtl_can_remove_branch_p (const_edge e)
5326 : : {
5327 : 142153 : const_basic_block src = e->src;
5328 : 142153 : const_basic_block target = EDGE_SUCC (src, EDGE_SUCC (src, 0) == e)->dest;
5329 : 142153 : const rtx_insn *insn = BB_END (src);
5330 : 142153 : rtx set;
5331 : :
5332 : : /* The conditions are taken from try_redirect_by_replacing_jump. */
5333 : 142153 : if (target == EXIT_BLOCK_PTR_FOR_FN (cfun))
5334 : : return false;
5335 : :
5336 : 142153 : if (e->flags & (EDGE_ABNORMAL_CALL | EDGE_EH))
5337 : : return false;
5338 : :
5339 : 142153 : if (BB_PARTITION (src) != BB_PARTITION (target))
5340 : : return false;
5341 : :
5342 : 142153 : if (!onlyjump_p (insn)
5343 : 142153 : || tablejump_p (insn, NULL, NULL))
5344 : 0 : return false;
5345 : :
5346 : 142153 : set = single_set (insn);
5347 : 142153 : if (!set || side_effects_p (set))
5348 : 0 : return false;
5349 : :
5350 : : return true;
5351 : : }
5352 : :
5353 : : static basic_block
5354 : 37296 : rtl_duplicate_bb (basic_block bb, copy_bb_data *id)
5355 : : {
5356 : 37296 : bb = cfg_layout_duplicate_bb (bb, id);
5357 : 37296 : bb->aux = NULL;
5358 : 37296 : return bb;
5359 : : }
5360 : :
5361 : : /* Do book-keeping of basic block BB for the profile consistency checker.
5362 : : Store the counting in RECORD. */
5363 : : static void
5364 : 0 : rtl_account_profile_record (basic_block bb, struct profile_record *record)
5365 : : {
5366 : 0 : rtx_insn *insn;
5367 : 0 : FOR_BB_INSNS (bb, insn)
5368 : 0 : if (INSN_P (insn))
5369 : : {
5370 : 0 : record->size += insn_cost (insn, false);
5371 : 0 : if (profile_info)
5372 : : {
5373 : 0 : if (ENTRY_BLOCK_PTR_FOR_FN (cfun)->count.ipa ().initialized_p ()
5374 : 0 : && ENTRY_BLOCK_PTR_FOR_FN (cfun)->count.ipa ().nonzero_p ()
5375 : 0 : && bb->count.ipa ().initialized_p ())
5376 : 0 : record->time
5377 : 0 : += insn_cost (insn, true) * bb->count.ipa ().to_gcov_type ();
5378 : : }
5379 : 0 : else if (bb->count.initialized_p ()
5380 : 0 : && ENTRY_BLOCK_PTR_FOR_FN (cfun)->count.initialized_p ())
5381 : 0 : record->time
5382 : 0 : += insn_cost (insn, true)
5383 : 0 : * bb->count.to_sreal_scale
5384 : 0 : (ENTRY_BLOCK_PTR_FOR_FN (cfun)->count).to_double ();
5385 : : else
5386 : 0 : record->time += insn_cost (insn, true);
5387 : : }
5388 : 0 : }
5389 : :
5390 : : /* Implementation of CFG manipulation for linearized RTL. */
5391 : : struct cfg_hooks rtl_cfg_hooks = {
5392 : : "rtl",
5393 : : rtl_verify_flow_info,
5394 : : rtl_dump_bb,
5395 : : rtl_dump_bb_for_graph,
5396 : : rtl_create_basic_block,
5397 : : rtl_redirect_edge_and_branch,
5398 : : rtl_redirect_edge_and_branch_force,
5399 : : rtl_can_remove_branch_p,
5400 : : rtl_delete_block,
5401 : : rtl_split_block,
5402 : : rtl_move_block_after,
5403 : : rtl_can_merge_blocks, /* can_merge_blocks_p */
5404 : : rtl_merge_blocks,
5405 : : rtl_predict_edge,
5406 : : rtl_predicted_by_p,
5407 : : cfg_layout_can_duplicate_bb_p,
5408 : : rtl_duplicate_bb,
5409 : : rtl_split_edge,
5410 : : rtl_make_forwarder_block,
5411 : : rtl_tidy_fallthru_edge,
5412 : : rtl_force_nonfallthru,
5413 : : rtl_block_ends_with_call_p,
5414 : : rtl_block_ends_with_condjump_p,
5415 : : rtl_flow_call_edges_add,
5416 : : NULL, /* execute_on_growing_pred */
5417 : : NULL, /* execute_on_shrinking_pred */
5418 : : NULL, /* duplicate loop for trees */
5419 : : NULL, /* lv_add_condition_to_bb */
5420 : : NULL, /* lv_adjust_loop_header_phi*/
5421 : : NULL, /* extract_cond_bb_edges */
5422 : : NULL, /* flush_pending_stmts */
5423 : : rtl_block_empty_p, /* block_empty_p */
5424 : : rtl_split_block_before_cond_jump, /* split_block_before_cond_jump */
5425 : : rtl_account_profile_record,
5426 : : };
5427 : :
5428 : : /* Implementation of CFG manipulation for cfg layout RTL, where
5429 : : basic block connected via fallthru edges does not have to be adjacent.
5430 : : This representation will hopefully become the default one in future
5431 : : version of the compiler. */
5432 : :
5433 : : struct cfg_hooks cfg_layout_rtl_cfg_hooks = {
5434 : : "cfglayout mode",
5435 : : rtl_verify_flow_info_1,
5436 : : rtl_dump_bb,
5437 : : rtl_dump_bb_for_graph,
5438 : : cfg_layout_create_basic_block,
5439 : : cfg_layout_redirect_edge_and_branch,
5440 : : cfg_layout_redirect_edge_and_branch_force,
5441 : : rtl_can_remove_branch_p,
5442 : : cfg_layout_delete_block,
5443 : : cfg_layout_split_block,
5444 : : rtl_move_block_after,
5445 : : cfg_layout_can_merge_blocks_p,
5446 : : cfg_layout_merge_blocks,
5447 : : rtl_predict_edge,
5448 : : rtl_predicted_by_p,
5449 : : cfg_layout_can_duplicate_bb_p,
5450 : : cfg_layout_duplicate_bb,
5451 : : cfg_layout_split_edge,
5452 : : rtl_make_forwarder_block,
5453 : : NULL, /* tidy_fallthru_edge */
5454 : : rtl_force_nonfallthru,
5455 : : rtl_block_ends_with_call_p,
5456 : : rtl_block_ends_with_condjump_p,
5457 : : rtl_flow_call_edges_add,
5458 : : NULL, /* execute_on_growing_pred */
5459 : : NULL, /* execute_on_shrinking_pred */
5460 : : duplicate_loop_body_to_header_edge, /* duplicate loop for rtl */
5461 : : rtl_lv_add_condition_to_bb, /* lv_add_condition_to_bb */
5462 : : NULL, /* lv_adjust_loop_header_phi*/
5463 : : rtl_extract_cond_bb_edges, /* extract_cond_bb_edges */
5464 : : NULL, /* flush_pending_stmts */
5465 : : rtl_block_empty_p, /* block_empty_p */
5466 : : rtl_split_block_before_cond_jump, /* split_block_before_cond_jump */
5467 : : rtl_account_profile_record,
5468 : : };
5469 : :
5470 : : #include "gt-cfgrtl.h"
5471 : :
5472 : : #if __GNUC__ >= 10
5473 : : # pragma GCC diagnostic pop
5474 : : #endif
|
