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 : 10170112 : 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 : 7288388 : can_delete_label_p (const rtx_code_label *label)
126 : : {
127 : 7288388 : return (!LABEL_PRESERVE_P (label)
128 : : /* User declared labels must be preserved. */
129 : 7280778 : && LABEL_NAME (label) == 0
130 : 7288388 : && !vec_safe_contains<rtx_insn *> (forced_labels,
131 : 7241028 : const_cast<rtx_code_label *> (label)));
132 : : }
133 : :
134 : : /* Delete INSN by patching it out. */
135 : :
136 : : void
137 : 115761187 : delete_insn (rtx_insn *insn)
138 : : {
139 : 115761187 : rtx note;
140 : 115761187 : bool really_delete = true;
141 : :
142 : 115761187 : 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 : 7288388 : if (! can_delete_label_p (as_a <rtx_code_label *> (insn)))
148 : : {
149 : 47360 : const char *name = LABEL_NAME (insn);
150 : 47360 : basic_block bb = BLOCK_FOR_INSN (insn);
151 : 47360 : rtx_insn *bb_note = NEXT_INSN (insn);
152 : :
153 : 47360 : really_delete = false;
154 : 47360 : PUT_CODE (insn, NOTE);
155 : 47360 : NOTE_KIND (insn) = NOTE_INSN_DELETED_LABEL;
156 : 47360 : 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 : 47360 : if (bb_note != NULL_RTX
161 : 47286 : && NOTE_INSN_BASIC_BLOCK_P (bb_note)
162 : 10854 : && bb != NULL
163 : 58214 : && bb == BLOCK_FOR_INSN (bb_note))
164 : : {
165 : 8540 : reorder_insns_nobb (insn, insn, bb_note);
166 : 8540 : BB_HEAD (bb) = bb_note;
167 : 8540 : if (BB_END (bb) == bb_note)
168 : 1191 : BB_END (bb) = insn;
169 : : }
170 : : }
171 : :
172 : 7288388 : remove_node_from_insn_list (insn, &nonlocal_goto_handler_labels);
173 : : }
174 : :
175 : 7288388 : if (really_delete)
176 : : {
177 : : /* If this insn has already been deleted, something is very wrong. */
178 : 115713827 : gcc_assert (!insn->deleted ());
179 : 115713827 : if (INSN_P (insn))
180 : 82941807 : df_insn_delete (insn);
181 : 115713827 : remove_insn (insn);
182 : 115713827 : 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 : 115761187 : if (JUMP_P (insn))
188 : : {
189 : 6468064 : if (JUMP_LABEL (insn)
190 : 6467853 : && LABEL_P (JUMP_LABEL (insn)))
191 : 6459022 : LABEL_NUSES (JUMP_LABEL (insn))--;
192 : :
193 : : /* If there are more targets, remove them too. */
194 : : while ((note
195 : 12936128 : = find_reg_note (insn, REG_LABEL_TARGET, NULL_RTX)) != NULL_RTX
196 : 6468064 : && 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 : 231537990 : while ((note = find_reg_note (insn, REG_LABEL_OPERAND, NULL_RTX)) != NULL_RTX
205 : 115768995 : && LABEL_P (XEXP (note, 0)))
206 : : {
207 : 7808 : LABEL_NUSES (XEXP (note, 0))--;
208 : 7808 : remove_note (insn, note);
209 : : }
210 : :
211 : 115761187 : if (rtx_jump_table_data *table = dyn_cast <rtx_jump_table_data *> (insn))
212 : : {
213 : 8 : rtvec vec = table->get_labels ();
214 : 8 : int len = GET_NUM_ELEM (vec);
215 : 8 : int i;
216 : :
217 : 138 : for (i = 0; i < len; i++)
218 : : {
219 : 130 : 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 : 130 : if (!NOTE_P (label))
225 : 130 : LABEL_NUSES (label)--;
226 : : }
227 : : }
228 : 115761187 : }
229 : :
230 : : /* Like delete_insn but also purge dead edges from BB.
231 : : Return true if any edges are eliminated. */
232 : :
233 : : bool
234 : 11836257 : delete_insn_and_edges (rtx_insn *insn)
235 : : {
236 : 11836257 : bool purge = false;
237 : :
238 : 11836257 : if (NONDEBUG_INSN_P (insn) && BLOCK_FOR_INSN (insn))
239 : : {
240 : 11528574 : basic_block bb = BLOCK_FOR_INSN (insn);
241 : 11528574 : if (BB_END (bb) == insn)
242 : : purge = true;
243 : 10877574 : else if (DEBUG_INSN_P (BB_END (bb)))
244 : 844736 : for (rtx_insn *dinsn = NEXT_INSN (insn);
245 : 844736 : DEBUG_INSN_P (dinsn); dinsn = NEXT_INSN (dinsn))
246 : 511323 : if (BB_END (bb) == dinsn)
247 : : {
248 : : purge = true;
249 : : break;
250 : : }
251 : : }
252 : 11836257 : delete_insn (insn);
253 : 11836257 : if (purge)
254 : 707722 : 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 : 16566875 : 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 : 16566875 : rtx_insn *current = finish;
269 : 28265262 : while (1)
270 : : {
271 : 28265262 : rtx_insn *prev = PREV_INSN (current);
272 : 28265262 : if (NOTE_P (current) && !can_delete_note_p (as_a <rtx_note *> (current)))
273 : : ;
274 : : else
275 : 28260338 : delete_insn (current);
276 : :
277 : 28265262 : if (clear_bb && !current->deleted ())
278 : 42526 : set_block_for_insn (current, NULL);
279 : :
280 : 28265262 : if (current == start)
281 : : break;
282 : : current = prev;
283 : : }
284 : 16566875 : }
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 : 12372780 : create_basic_block_structure (rtx_insn *head, rtx_insn *end, rtx_note *bb_note,
296 : : basic_block after)
297 : : {
298 : 12372780 : basic_block bb;
299 : :
300 : 12372780 : if (bb_note
301 : 0 : && (bb = NOTE_BASIC_BLOCK (bb_note)) != NULL
302 : 12372780 : && 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 : 12372780 : bb = alloc_block ();
324 : :
325 : 12372780 : init_rtl_bb_info (bb);
326 : 12372780 : if (!head && !end)
327 : 446699 : head = end = bb_note
328 : 446699 : = emit_note_after (NOTE_INSN_BASIC_BLOCK, get_last_insn ());
329 : 11926081 : else if (LABEL_P (head) && end)
330 : : {
331 : 2547277 : bb_note = emit_note_after (NOTE_INSN_BASIC_BLOCK, head);
332 : 2547277 : if (head == end)
333 : 890311 : end = bb_note;
334 : : }
335 : : else
336 : : {
337 : 9378804 : bb_note = emit_note_before (NOTE_INSN_BASIC_BLOCK, head);
338 : 9378804 : head = bb_note;
339 : 9378804 : if (!end)
340 : 5168410 : end = head;
341 : : }
342 : :
343 : 12372780 : NOTE_BASIC_BLOCK (bb_note) = bb;
344 : : }
345 : :
346 : : /* Always include the bb note in the block. */
347 : 12372780 : if (NEXT_INSN (end) == bb_note)
348 : 0 : end = bb_note;
349 : :
350 : 12372780 : BB_HEAD (bb) = head;
351 : 12372780 : BB_END (bb) = end;
352 : 12372780 : bb->index = last_basic_block_for_fn (cfun)++;
353 : 12372780 : bb->flags = BB_NEW | BB_RTL;
354 : 12372780 : link_block (bb, after);
355 : 12372780 : SET_BASIC_BLOCK_FOR_FN (cfun, bb->index, bb);
356 : 12372780 : df_bb_refs_record (bb->index, false);
357 : 12372780 : update_bb_for_insn (bb);
358 : 12372780 : 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 : 12372780 : bb->aux = bb;
363 : :
364 : 12372780 : 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 : 12372780 : rtl_create_basic_block (void *headp, void *endp, basic_block after)
374 : : {
375 : 12372780 : rtx_insn *head = (rtx_insn *) headp;
376 : 12372780 : rtx_insn *end = (rtx_insn *) endp;
377 : 12372780 : basic_block bb;
378 : :
379 : : /* Grow the basic block array if needed. */
380 : 12372780 : if ((size_t) last_basic_block_for_fn (cfun)
381 : 12372780 : >= basic_block_info_for_fn (cfun)->length ())
382 : 826431 : vec_safe_grow_cleared (basic_block_info_for_fn (cfun),
383 : 826431 : last_basic_block_for_fn (cfun) + 1);
384 : :
385 : 12372780 : n_basic_blocks_for_fn (cfun)++;
386 : :
387 : 12372780 : bb = create_basic_block_structure (head, end, NULL, after);
388 : 12372780 : bb->aux = NULL;
389 : 12372780 : return bb;
390 : : }
391 : :
392 : : static basic_block
393 : 3925681 : cfg_layout_create_basic_block (void *head, void *end, basic_block after)
394 : : {
395 : 3925681 : basic_block newbb = rtl_create_basic_block (head, end, after);
396 : :
397 : 3925681 : 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 : 6361578 : rtl_delete_block (basic_block b)
410 : : {
411 : 6361578 : 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 : 6361578 : insn = BB_HEAD (b);
417 : :
418 : 6361578 : end = get_last_bb_insn (b);
419 : :
420 : : /* Selectively delete the entire chain. */
421 : 6361578 : BB_HEAD (b) = NULL;
422 : 6361578 : delete_insn_chain (insn, end, true);
423 : :
424 : :
425 : 6361578 : if (dump_file)
426 : 653 : fprintf (dump_file, "deleting block %d\n", b->index);
427 : 6361578 : df_bb_delete (b->index);
428 : 6361578 : }
429 : :
430 : : /* Records the basic block struct in BLOCK_FOR_INSN for every insn. */
431 : :
432 : : void
433 : 1431681 : compute_bb_for_insn (void)
434 : : {
435 : 1431681 : basic_block bb;
436 : :
437 : 14837541 : FOR_EACH_BB_FN (bb, cfun)
438 : : {
439 : 13405860 : rtx_insn *end = BB_END (bb);
440 : 13405860 : rtx_insn *insn;
441 : :
442 : 157878328 : for (insn = BB_HEAD (bb); ; insn = NEXT_INSN (insn))
443 : : {
444 : 144472468 : BLOCK_FOR_INSN (insn) = bb;
445 : 157878328 : if (insn == end)
446 : : break;
447 : : }
448 : : }
449 : 1431681 : }
450 : :
451 : : /* Release the basic_block_for_insn array. */
452 : :
453 : : void
454 : 2864007 : free_bb_for_insn (void)
455 : : {
456 : 2864007 : rtx_insn *insn;
457 : 188692284 : for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
458 : 185828277 : if (!BARRIER_P (insn))
459 : 181351277 : BLOCK_FOR_INSN (insn) = NULL;
460 : 2864007 : }
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 : 282866 : pass_free_cfg (gcc::context *ctxt)
481 : 565732 : : 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 : 1431623 : 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 : 1431623 : if (DELAY_SLOTS && optimize > 0 && flag_delayed_branch)
495 : : {
496 : : df_note_add_problem ();
497 : : df_analyze ();
498 : : }
499 : :
500 : 1431623 : if (crtl->has_bb_partition)
501 : 60093 : insert_section_boundary_note ();
502 : :
503 : 1431623 : free_bb_for_insn ();
504 : 1431623 : return 0;
505 : : }
506 : :
507 : : } // anon namespace
508 : :
509 : : rtl_opt_pass *
510 : 282866 : make_pass_free_cfg (gcc::context *ctxt)
511 : : {
512 : 282866 : 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 : 7592 : entry_of_function (void)
518 : : {
519 : 7592 : return (n_basic_blocks_for_fn (cfun) > NUM_FIXED_BLOCKS ?
520 : 7592 : 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 : : static void
542 : 31738933 : update_bb_for_insn_chain (rtx_insn *begin, rtx_insn *end, basic_block bb)
543 : : {
544 : 31738933 : rtx_insn *insn;
545 : :
546 : 31738933 : end = NEXT_INSN (end);
547 : 313502747 : for (insn = begin; insn != end; insn = NEXT_INSN (insn))
548 : 250024881 : if (!BARRIER_P (insn))
549 : 248234382 : df_insn_change_bb (insn, bb);
550 : 31738933 : }
551 : :
552 : : /* Update BLOCK_FOR_INSN of insns in BB to BB,
553 : : and notify df of the change. */
554 : :
555 : : void
556 : 27865384 : update_bb_for_insn (basic_block bb)
557 : : {
558 : 27865384 : update_bb_for_insn_chain (BB_HEAD (bb), BB_END (bb), bb);
559 : 27865384 : }
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 : 266728286 : flow_active_insn_p (const rtx_insn *insn)
567 : : {
568 : 266728286 : 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 : 148714353 : if ((GET_CODE (PATTERN (insn)) == CLOBBER
580 : 148648356 : || GET_CODE (PATTERN (insn)) == USE)
581 : 650762 : && REG_P (XEXP (PATTERN (insn), 0))
582 : 149358743 : && REG_FUNCTION_VALUE_P (XEXP (PATTERN (insn), 0)))
583 : 582553 : 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 : 292378418 : contains_no_active_insn_p (const_basic_block bb)
593 : : {
594 : 292378418 : rtx_insn *insn;
595 : :
596 : 292378418 : if (bb == EXIT_BLOCK_PTR_FOR_FN (cfun)
597 : 292378418 : || bb == ENTRY_BLOCK_PTR_FOR_FN (cfun)
598 : 411561023 : || !single_succ_p (bb)
599 : 428908604 : || (single_succ_edge (bb)->flags & EDGE_FAKE) != 0)
600 : : return false;
601 : :
602 : 485338260 : for (insn = BB_HEAD (bb); insn != BB_END (bb); insn = NEXT_INSN (insn))
603 : 441661283 : if (INSN_P (insn) && flow_active_insn_p (insn))
604 : : return false;
605 : :
606 : 43676977 : return (!INSN_P (insn)
607 : 33855921 : || (JUMP_P (insn) && simplejump_p (insn))
608 : 70323007 : || !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 : 292378418 : forwarder_block_p (const_basic_block bb)
616 : : {
617 : 292378418 : if (!contains_no_active_insn_p (bb))
618 : : return false;
619 : :
620 : : /* Protect loop latches, headers and preheaders. */
621 : 17347581 : if (current_loops)
622 : : {
623 : 8732021 : basic_block dest;
624 : 8732021 : if (bb->loop_father->header == bb)
625 : : return false;
626 : 8611477 : dest = EDGE_SUCC (bb, 0)->dest;
627 : 8611477 : if (dest->loop_father->header == dest)
628 : 1049001 : 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 : 42209337 : can_fallthru (basic_block src, basic_block target)
639 : : {
640 : 42209337 : rtx_insn *insn = BB_END (src);
641 : 42209337 : rtx_insn *insn2;
642 : 42209337 : edge e;
643 : 42209337 : edge_iterator ei;
644 : :
645 : 42209337 : if (target == EXIT_BLOCK_PTR_FOR_FN (cfun))
646 : : return true;
647 : 40873613 : if (src->next_bb != target)
648 : : return false;
649 : :
650 : : /* ??? Later we may add code to move jump tables offline. */
651 : 16233775 : if (tablejump_p (insn, NULL, NULL))
652 : : return false;
653 : :
654 : 44086957 : FOR_EACH_EDGE (e, ei, src->succs)
655 : 27853182 : if (e->dest == EXIT_BLOCK_PTR_FOR_FN (cfun)
656 : 0 : && e->flags & EDGE_FALLTHRU)
657 : : return false;
658 : :
659 : 16233775 : insn2 = BB_HEAD (target);
660 : 16233775 : if (!active_insn_p (insn2))
661 : 16233775 : insn2 = next_active_insn (insn2);
662 : :
663 : 16233775 : 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 : 2132648 : could_fall_through (basic_block src, basic_block target)
671 : : {
672 : 2132648 : edge e;
673 : 2132648 : edge_iterator ei;
674 : :
675 : 2132648 : if (target == EXIT_BLOCK_PTR_FOR_FN (cfun))
676 : : return true;
677 : 6397944 : FOR_EACH_EDGE (e, ei, src->succs)
678 : 4265296 : 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 : 39378724 : bb_note (basic_block bb)
687 : : {
688 : 39378724 : rtx_insn *note;
689 : :
690 : 39378724 : note = BB_HEAD (bb);
691 : 39378724 : if (LABEL_P (note))
692 : 19092140 : note = NEXT_INSN (note);
693 : :
694 : 39378724 : gcc_assert (NOTE_INSN_BASIC_BLOCK_P (note));
695 : 39378724 : 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 : 6396 : first_insn_after_basic_block_note (basic_block block)
703 : : {
704 : 6396 : rtx_insn *insn;
705 : :
706 : : /* Get the first instruction in the block. */
707 : 6396 : insn = BB_HEAD (block);
708 : :
709 : 6396 : if (insn == NULL_RTX)
710 : : return NULL;
711 : 6396 : if (LABEL_P (insn))
712 : 6392 : insn = NEXT_INSN (insn);
713 : 6396 : gcc_assert (NOTE_INSN_BASIC_BLOCK_P (insn));
714 : :
715 : 6396 : 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 : 2719015 : rtl_split_block (basic_block bb, void *insnp)
723 : : {
724 : 2719015 : basic_block new_bb;
725 : 2719015 : rtx_insn *insn = (rtx_insn *) insnp;
726 : 2719015 : edge e;
727 : 2719015 : edge_iterator ei;
728 : :
729 : 2719015 : if (!insn)
730 : : {
731 : 6396 : insn = first_insn_after_basic_block_note (bb);
732 : :
733 : 6396 : if (insn)
734 : : {
735 : 6374 : rtx_insn *next = insn;
736 : :
737 : 6374 : 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 : 6374 : if (insn != BB_END (bb)
744 : 6147 : && DEBUG_INSN_P (next)
745 : 761 : && DEBUG_INSN_P (BB_END (bb)))
746 : : {
747 : 267 : while (next != BB_END (bb) && DEBUG_INSN_P (next))
748 : 188 : next = NEXT_INSN (next);
749 : :
750 : 79 : if (next == BB_END (bb))
751 : 79 : emit_note_after (NOTE_INSN_DELETED, next);
752 : : }
753 : : }
754 : : else
755 : 22 : 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 : 2719015 : if (insn == BB_END (bb))
762 : 249 : emit_note_after (NOTE_INSN_DELETED, insn);
763 : :
764 : : /* Create the new basic block. */
765 : 2719015 : new_bb = create_basic_block (NEXT_INSN (insn), BB_END (bb), bb);
766 : 2719015 : BB_COPY_PARTITION (new_bb, bb);
767 : 2719015 : BB_END (bb) = insn;
768 : :
769 : : /* Redirect the outgoing edges. */
770 : 2719015 : new_bb->succs = bb->succs;
771 : 2719015 : bb->succs = NULL;
772 : 7493119 : FOR_EACH_EDGE (e, ei, new_bb->succs)
773 : 4774104 : e->src = new_bb;
774 : :
775 : : /* The new block starts off being dirty. */
776 : 2719015 : df_set_bb_dirty (bb);
777 : 2719015 : 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 : 1385367 : loc_equal (location_t loc1, location_t loc2)
785 : : {
786 : 1385367 : if (loc1 == loc2)
787 : : return true;
788 : :
789 : 756979 : expanded_location loce1 = expand_location (loc1);
790 : 756979 : expanded_location loce2 = expand_location (loc2);
791 : :
792 : 756979 : if (loce1.line != loce2.line
793 : 756979 : || loce1.column != loce2.column
794 : 413990 : || loce1.data != loce2.data)
795 : : return false;
796 : 379953 : 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 : 1125619 : unique_locus_on_edge_between_p (basic_block a, basic_block b)
808 : : {
809 : 1125619 : const location_t goto_locus = EDGE_SUCC (a, 0)->goto_locus;
810 : 1125619 : rtx_insn *insn, *end;
811 : :
812 : 1125619 : if (LOCATION_LOCUS (goto_locus) == UNKNOWN_LOCATION)
813 : : return false;
814 : :
815 : : /* First scan block A backward. */
816 : 523736 : insn = BB_END (a);
817 : 523736 : end = PREV_INSN (BB_HEAD (a));
818 : 1217125 : while (insn != end && (!NONDEBUG_INSN_P (insn) || !INSN_HAS_LOCATION (insn)))
819 : 169653 : insn = PREV_INSN (insn);
820 : :
821 : 523736 : if (insn != end && loc_equal (INSN_LOCATION (insn), goto_locus))
822 : : return false;
823 : :
824 : : /* Then scan block B forward. */
825 : 178832 : insn = BB_HEAD (b);
826 : 178832 : if (insn)
827 : : {
828 : 167662 : end = NEXT_INSN (BB_END (b));
829 : 336674 : while (insn != end && !NONDEBUG_INSN_P (insn))
830 : 1350 : insn = NEXT_INSN (insn);
831 : :
832 : 167437 : if (insn != end && INSN_HAS_LOCATION (insn)
833 : 334020 : && 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 : 1125619 : emit_nop_for_unique_locus_between (basic_block a, basic_block b)
845 : : {
846 : 1125619 : if (!unique_locus_on_edge_between_p (a, b))
847 : : return;
848 : :
849 : 19438 : BB_END (a) = emit_insn_after_noloc (gen_nop (), BB_END (a), a);
850 : 19438 : 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 : 3696134 : 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 : 3696134 : const bool forward_edge_locus
862 : 3696134 : = (b->flags & BB_FORWARDER_BLOCK) != 0
863 : 3696134 : && LOCATION_LOCUS (EDGE_SUCC (b, 0)->goto_locus) == UNKNOWN_LOCATION;
864 : 3696134 : rtx_insn *b_head = BB_HEAD (b), *b_end = BB_END (b), *a_end = BB_END (a);
865 : 3696134 : rtx_insn *del_first = NULL, *del_last = NULL;
866 : 3696134 : rtx_insn *b_debug_start = b_end, *b_debug_end = b_end;
867 : 3696134 : bool b_empty = false;
868 : :
869 : 3696134 : if (dump_file)
870 : 790 : fprintf (dump_file, "Merging block %d into block %d...\n", b->index,
871 : : a->index);
872 : :
873 : 4220956 : while (DEBUG_INSN_P (b_end))
874 : 524822 : b_end = PREV_INSN (b_debug_start = b_end);
875 : :
876 : : /* If there was a CODE_LABEL beginning B, delete it. */
877 : 3696134 : 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 : 1715689 : if (b_head == b_end)
882 : 0 : b_empty = true;
883 : :
884 : 1715689 : del_first = del_last = b_head;
885 : 1715689 : b_head = NEXT_INSN (b_head);
886 : : }
887 : :
888 : : /* Delete the basic block note and handle blocks containing just that
889 : : note. */
890 : 3696134 : if (NOTE_INSN_BASIC_BLOCK_P (b_head))
891 : : {
892 : 3696134 : if (b_head == b_end)
893 : 725738 : b_empty = true;
894 : 3696134 : if (! del_last)
895 : 1980445 : del_first = b_head;
896 : :
897 : 3696134 : del_last = b_head;
898 : 3696134 : b_head = NEXT_INSN (b_head);
899 : : }
900 : :
901 : : /* If there was a jump out of A, delete it. */
902 : 3696134 : if (JUMP_P (a_end))
903 : : {
904 : 47217 : rtx_insn *prev;
905 : :
906 : 48357 : for (prev = PREV_INSN (a_end); ; prev = PREV_INSN (prev))
907 : 48357 : if (!NOTE_P (prev)
908 : 1165 : || NOTE_INSN_BASIC_BLOCK_P (prev)
909 : 1140 : || prev == BB_HEAD (a))
910 : : break;
911 : :
912 : : del_first = a_end;
913 : :
914 : : a_end = PREV_INSN (del_first);
915 : : }
916 : 3648917 : 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 : 3696134 : BB_END (a) = a_end;
922 : 3696134 : BB_HEAD (b) = b_empty ? NULL : b_head;
923 : 3696134 : 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 : 3696134 : if (!optimize
928 : 1401104 : && !forward_edge_locus
929 : 4820547 : && !DECL_IGNORED_P (current_function_decl))
930 : : {
931 : 1121322 : emit_nop_for_unique_locus_between (a, b);
932 : 1121322 : a_end = BB_END (a);
933 : : }
934 : :
935 : : /* Reassociate the insns of B with A. */
936 : 3696134 : if (!b_empty)
937 : : {
938 : 2970396 : update_bb_for_insn_chain (a_end, b_debug_end, a);
939 : :
940 : 2970396 : BB_END (a) = b_debug_end;
941 : 2970396 : BB_HEAD (b) = NULL;
942 : : }
943 : 725738 : 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 : 28078 : if (NEXT_INSN (a_end) != b_debug_start)
950 : 121 : reorder_insns_nobb (NEXT_INSN (a_end), PREV_INSN (b_debug_start),
951 : : b_debug_end);
952 : 28078 : update_bb_for_insn_chain (b_debug_start, b_debug_end, a);
953 : 28078 : BB_END (a) = b_debug_end;
954 : : }
955 : :
956 : 3696134 : df_bb_delete (b->index);
957 : :
958 : 3696134 : if (forward_edge_locus)
959 : 692007 : EDGE_SUCC (b, 0)->goto_locus = EDGE_SUCC (a, 0)->goto_locus;
960 : :
961 : 3696134 : if (dump_file)
962 : 790 : fprintf (dump_file, "Merged blocks %d and %d.\n", a->index, b->index);
963 : 3696134 : }
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 : 16165218 : block_label (basic_block block)
1010 : : {
1011 : 16165218 : if (block == EXIT_BLOCK_PTR_FOR_FN (cfun))
1012 : : return NULL;
1013 : :
1014 : 16112050 : if (!LABEL_P (BB_HEAD (block)))
1015 : : {
1016 : 6223870 : BB_HEAD (block) = emit_label_before (gen_label_rtx (), BB_HEAD (block));
1017 : : }
1018 : :
1019 : 16112050 : 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 : 3509184 : remove_barriers_from_footer (basic_block bb)
1026 : : {
1027 : 3509184 : rtx_insn *insn = BB_FOOTER (bb);
1028 : :
1029 : : /* Remove barriers but keep jumptables. */
1030 : 6773375 : while (insn)
1031 : : {
1032 : 3264191 : if (BARRIER_P (insn))
1033 : : {
1034 : 3264176 : if (PREV_INSN (insn))
1035 : 20 : SET_NEXT_INSN (PREV_INSN (insn)) = NEXT_INSN (insn);
1036 : : else
1037 : 3264156 : BB_FOOTER (bb) = NEXT_INSN (insn);
1038 : 3264176 : if (NEXT_INSN (insn))
1039 : 33552 : SET_PREV_INSN (NEXT_INSN (insn)) = PREV_INSN (insn);
1040 : : }
1041 : 3264191 : if (LABEL_P (insn))
1042 : : return;
1043 : 3264191 : 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 : 46285395 : try_redirect_by_replacing_jump (edge e, basic_block target, bool in_cfglayout)
1054 : : {
1055 : 46285395 : basic_block src = e->src;
1056 : 46285395 : rtx_insn *insn = BB_END (src);
1057 : 46285395 : rtx set;
1058 : 46285395 : 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 : 46285395 : 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 : 46231849 : 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 : 46231849 : || (EDGE_COUNT (src->succs) == 2
1080 : 17410696 : && EDGE_SUCC (src, EDGE_SUCC (src, 0) == e)->dest != target))
1081 : : return NULL;
1082 : :
1083 : 28945633 : if (!onlyjump_p (insn))
1084 : : return NULL;
1085 : 27487994 : if ((!optimize || reload_completed) && tablejump_p (insn, NULL, NULL))
1086 : : return NULL;
1087 : :
1088 : : /* Avoid removing branch with side effects. */
1089 : 27487782 : set = single_set (insn);
1090 : 27487782 : if (!set || side_effects_p (set))
1091 : 0 : return NULL;
1092 : :
1093 : : /* See if we can create the fallthru edge. */
1094 : 27487782 : if (in_cfglayout || can_fallthru (src, target))
1095 : : {
1096 : 4359562 : if (dump_file)
1097 : 771 : fprintf (dump_file, "Removing jump %i.\n", INSN_UID (insn));
1098 : 4359562 : fallthru = true;
1099 : :
1100 : : /* Selectively unlink whole insn chain. */
1101 : 4359562 : if (in_cfglayout)
1102 : : {
1103 : 3509184 : delete_insn_chain (insn, BB_END (src), false);
1104 : 3509184 : remove_barriers_from_footer (src);
1105 : : }
1106 : : else
1107 : 850378 : delete_insn_chain (insn, PREV_INSN (BB_HEAD (target)), false);
1108 : : }
1109 : :
1110 : : /* If this already is simplejump, redirect it. */
1111 : 23128220 : else if (simplejump_p (insn))
1112 : : {
1113 : 23126087 : if (e->dest == target)
1114 : : return NULL;
1115 : 491695 : if (dump_file)
1116 : 40 : fprintf (dump_file, "Redirecting jump %i from %i to %i.\n",
1117 : 40 : INSN_UID (insn), e->dest->index, target->index);
1118 : 491695 : if (!redirect_jump (as_a <rtx_jump_insn *> (insn),
1119 : 491695 : 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 : 2133 : 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 : 2133 : rtx_code_label *target_label = block_label (target);
1134 : 2133 : rtx_insn *barrier;
1135 : 2133 : rtx_insn *label;
1136 : 2133 : rtx_jump_table_data *table;
1137 : :
1138 : 2133 : emit_jump_insn_after_noloc (targetm.gen_jump (target_label), insn);
1139 : 2133 : JUMP_LABEL (BB_END (src)) = target_label;
1140 : 2133 : LABEL_NUSES (target_label)++;
1141 : 2133 : 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 : 2133 : 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 : 2133 : if (tablejump_p (insn, &label, &table))
1152 : 2 : delete_insn_chain (label, table, false);
1153 : :
1154 : 2133 : barrier = next_nonnote_nondebug_insn (BB_END (src));
1155 : 2133 : if (!barrier || !BARRIER_P (barrier))
1156 : 2000 : emit_barrier_after (BB_END (src));
1157 : : else
1158 : : {
1159 : 133 : 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 : 1 : rtx_insn *new_insn = BB_END (src);
1165 : :
1166 : 1 : update_bb_for_insn_chain (NEXT_INSN (BB_END (src)),
1167 : : PREV_INSN (barrier), src);
1168 : :
1169 : 1 : SET_NEXT_INSN (PREV_INSN (new_insn)) = NEXT_INSN (new_insn);
1170 : 1 : SET_PREV_INSN (NEXT_INSN (new_insn)) = PREV_INSN (new_insn);
1171 : :
1172 : 1 : SET_NEXT_INSN (new_insn) = barrier;
1173 : 1 : SET_NEXT_INSN (PREV_INSN (barrier)) = new_insn;
1174 : :
1175 : 1 : SET_PREV_INSN (new_insn) = PREV_INSN (barrier);
1176 : 1 : SET_PREV_INSN (barrier) = new_insn;
1177 : : }
1178 : : }
1179 : : }
1180 : :
1181 : : /* Keep only one edge out and set proper flags. */
1182 : 4853390 : if (!single_succ_p (src))
1183 : 143241 : remove_edge (e);
1184 : 4853390 : gcc_assert (single_succ_p (src));
1185 : :
1186 : 4853390 : e = single_succ_edge (src);
1187 : 4853390 : if (fallthru)
1188 : 4359562 : e->flags = EDGE_FALLTHRU;
1189 : : else
1190 : 493828 : e->flags = 0;
1191 : :
1192 : 4853390 : e->probability = profile_probability::always ();
1193 : :
1194 : 4853390 : if (e->dest != target)
1195 : 682127 : 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 : 6368046 : patch_jump_insn (rtx_insn *insn, rtx_insn *old_label, basic_block new_bb)
1207 : : {
1208 : 6368046 : rtx_jump_table_data *table;
1209 : 6368046 : rtx tmp;
1210 : : /* Recognize a tablejump and adjust all matching cases. */
1211 : 6368046 : if (tablejump_p (insn, NULL, &table))
1212 : : {
1213 : 15638 : rtvec vec;
1214 : 15638 : int j;
1215 : 15638 : rtx_code_label *new_label = block_label (new_bb);
1216 : :
1217 : 15638 : if (new_bb == EXIT_BLOCK_PTR_FOR_FN (cfun))
1218 : : return false;
1219 : 15638 : vec = table->get_labels ();
1220 : :
1221 : 389668 : for (j = GET_NUM_ELEM (vec) - 1; j >= 0; --j)
1222 : 374030 : if (XEXP (RTVEC_ELT (vec, j), 0) == old_label)
1223 : : {
1224 : 53098 : RTVEC_ELT (vec, j) = gen_rtx_LABEL_REF (Pmode, new_label);
1225 : 53098 : --LABEL_NUSES (old_label);
1226 : 53098 : ++LABEL_NUSES (new_label);
1227 : : }
1228 : :
1229 : : /* Handle casesi dispatch insns. */
1230 : 15638 : if ((tmp = tablejump_casesi_pattern (insn)) != NULL_RTX
1231 : 15638 : && 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 : 6352408 : 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 : 6352052 : if (computed_jump_p (insn)
1287 : : /* A return instruction can't be redirected. */
1288 : 6352052 : || returnjump_p (insn))
1289 : 0 : return false;
1290 : :
1291 : 6352052 : 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 : 6320631 : 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 : 6320631 : if (!redirect_jump (as_a <rtx_jump_insn *> (insn),
1301 : 6320631 : 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 : 14196923 : redirect_branch_edge (edge e, basic_block target)
1317 : : {
1318 : 14196923 : rtx_insn *old_label = BB_HEAD (e->dest);
1319 : 14196923 : basic_block src = e->src;
1320 : 14196923 : rtx_insn *insn = BB_END (src);
1321 : :
1322 : : /* We can only redirect non-fallthru edges of jump insn. */
1323 : 14196923 : if (e->flags & EDGE_FALLTHRU)
1324 : : return NULL;
1325 : 6322143 : else if (!JUMP_P (insn) && !currently_expanding_to_rtl)
1326 : : return NULL;
1327 : :
1328 : 6322143 : if (!currently_expanding_to_rtl)
1329 : : {
1330 : 5810149 : 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 : 7115051 : FOR_BB_INSNS (src, insn)
1338 : 6603057 : if (JUMP_P (insn) && !patch_jump_insn (as_a <rtx_jump_insn *> (insn),
1339 : : old_label, target))
1340 : : return NULL;
1341 : :
1342 : 6322143 : if (dump_file)
1343 : 813 : fprintf (dump_file, "Edge %i->%i redirected to %i\n",
1344 : 813 : e->src->index, e->dest->index, target->index);
1345 : :
1346 : 6322143 : if (e->dest != target)
1347 : 6322143 : 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 : 17404925 : fixup_partition_crossing (edge e)
1358 : : {
1359 : 17404925 : if (e->src == ENTRY_BLOCK_PTR_FOR_FN (cfun) || e->dest
1360 : 17404925 : == 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 : 17404100 : if (BB_PARTITION (e->src) != BB_PARTITION (e->dest))
1367 : : {
1368 : 100048 : e->flags |= EDGE_CROSSING;
1369 : 100048 : if (JUMP_P (BB_END (e->src)))
1370 : 100048 : CROSSING_JUMP_P (BB_END (e->src)) = 1;
1371 : : }
1372 : 17304052 : else if (BB_PARTITION (e->src) == BB_PARTITION (e->dest))
1373 : : {
1374 : 17304052 : 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 : 17304052 : if (JUMP_P (BB_END (e->src)) && CROSSING_JUMP_P (BB_END (e->src)))
1379 : : {
1380 : 163409 : bool has_crossing_succ = false;
1381 : 163409 : edge e2;
1382 : 163409 : edge_iterator ei;
1383 : 265394 : FOR_EACH_EDGE (e2, ei, e->src->succs)
1384 : : {
1385 : 221222 : has_crossing_succ |= (e2->flags & EDGE_CROSSING);
1386 : 221222 : if (has_crossing_succ)
1387 : : break;
1388 : : }
1389 : 163409 : if (!has_crossing_succ)
1390 : 44172 : 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 : 322 : fixup_new_cold_bb (basic_block bb)
1401 : : {
1402 : 322 : edge e;
1403 : 322 : 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 : 659 : FOR_EACH_EDGE (e, ei, bb->preds)
1412 : : {
1413 : 337 : fixup_partition_crossing (e);
1414 : : }
1415 : :
1416 : : /* Possibly need to make bb's successor edges region crossing,
1417 : : or remove stale region crossing. */
1418 : 662 : 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 : 340 : if ((e->flags & EDGE_FALLTHRU)
1424 : 295 : && BB_PARTITION (bb) != BB_PARTITION (e->dest)
1425 : 271 : && e->dest != EXIT_BLOCK_PTR_FOR_FN (cfun))
1426 : 0 : force_nonfallthru (e);
1427 : : else
1428 : 340 : fixup_partition_crossing (e);
1429 : : }
1430 : 322 : }
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 : 10153345 : rtl_redirect_edge_and_branch (edge e, basic_block target)
1445 : : {
1446 : 10153345 : edge ret;
1447 : 10153345 : basic_block src = e->src;
1448 : 10153345 : basic_block dest = e->dest;
1449 : :
1450 : 10153345 : if (e->flags & (EDGE_ABNORMAL_CALL | EDGE_EH))
1451 : : return NULL;
1452 : :
1453 : 10153345 : if (dest == target)
1454 : : return e;
1455 : :
1456 : 10153340 : if ((ret = try_redirect_by_replacing_jump (e, target, false)) != NULL)
1457 : : {
1458 : 557015 : df_set_bb_dirty (src);
1459 : 557015 : fixup_partition_crossing (ret);
1460 : 557015 : return ret;
1461 : : }
1462 : :
1463 : 9596325 : ret = redirect_branch_edge (e, target);
1464 : 9596325 : if (!ret)
1465 : : return NULL;
1466 : :
1467 : 1721545 : df_set_bb_dirty (src);
1468 : 1721545 : fixup_partition_crossing (ret);
1469 : 1721545 : return ret;
1470 : : }
1471 : :
1472 : : /* Emit a barrier after BB, into the footer if we are in CFGLAYOUT mode. */
1473 : :
1474 : : void
1475 : 5087608 : emit_barrier_after_bb (basic_block bb)
1476 : : {
1477 : 5087608 : rtx_barrier *barrier = emit_barrier_after (BB_END (bb));
1478 : 5087608 : gcc_assert (current_ir_type () == IR_RTL_CFGRTL
1479 : : || current_ir_type () == IR_RTL_CFGLAYOUT);
1480 : 5087608 : if (current_ir_type () == IR_RTL_CFGLAYOUT)
1481 : : {
1482 : 70351 : rtx_insn *insn = unlink_insn_chain (barrier, barrier);
1483 : :
1484 : 70351 : if (BB_FOOTER (bb))
1485 : : {
1486 : : rtx_insn *footer_tail = BB_FOOTER (bb);
1487 : :
1488 : 2616 : while (NEXT_INSN (footer_tail))
1489 : : footer_tail = NEXT_INSN (footer_tail);
1490 : 2616 : 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 : 67735 : BB_FOOTER (bb) = insn;
1498 : : }
1499 : 5087608 : }
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 : 4963364 : force_nonfallthru_and_redirect (edge e, basic_block target, rtx jump_label)
1509 : : {
1510 : 4963364 : basic_block jump_block, new_bb = NULL, src = e->src;
1511 : 4963364 : rtx note;
1512 : 4963364 : edge new_edge;
1513 : 4963364 : int abnormal_edge_flags = 0;
1514 : 4963364 : 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 : 4963364 : if (e->src != ENTRY_BLOCK_PTR_FOR_FN (cfun)
1520 : 4963358 : && e->dest != EXIT_BLOCK_PTR_FOR_FN (cfun)
1521 : 4963358 : && any_condjump_p (BB_END (e->src))
1522 : 5755263 : && 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 : 4963364 : 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 : 4963364 : gcc_assert (e->flags & EDGE_FALLTHRU);
1556 : 4963364 : 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 : 4963364 : if (JUMP_P (BB_END (e->src))
1599 : 792012 : && target != EXIT_BLOCK_PTR_FOR_FN (cfun)
1600 : 791692 : && (e->flags & EDGE_FALLTHRU)
1601 : 5755056 : && (note = extract_asm_operands (PATTERN (BB_END (e->src)))))
1602 : : {
1603 : 113 : int i, n = ASM_OPERANDS_LABEL_LENGTH (note);
1604 : 113 : bool adjust_jump_target = false;
1605 : :
1606 : 286 : for (i = 0; i < n; ++i)
1607 : : {
1608 : 173 : if (XEXP (ASM_OPERANDS_LABEL (note, i), 0) == BB_HEAD (e->dest))
1609 : : {
1610 : 62 : LABEL_NUSES (XEXP (ASM_OPERANDS_LABEL (note, i), 0))--;
1611 : 62 : XEXP (ASM_OPERANDS_LABEL (note, i), 0) = block_label (target);
1612 : 62 : LABEL_NUSES (XEXP (ASM_OPERANDS_LABEL (note, i), 0))++;
1613 : 62 : adjust_jump_target = true;
1614 : : }
1615 : 173 : if (XEXP (ASM_OPERANDS_LABEL (note, i), 0) == BB_HEAD (target))
1616 : 62 : asm_goto_edge = true;
1617 : : }
1618 : 113 : if (adjust_jump_target)
1619 : : {
1620 : 61 : rtx_insn *insn = BB_END (e->src);
1621 : 61 : rtx note;
1622 : 61 : rtx_insn *old_label = BB_HEAD (e->dest);
1623 : 61 : rtx_insn *new_label = BB_HEAD (target);
1624 : :
1625 : 61 : if (JUMP_LABEL (insn) == old_label)
1626 : : {
1627 : 48 : JUMP_LABEL (insn) = new_label;
1628 : 48 : note = find_reg_note (insn, REG_LABEL_TARGET, new_label);
1629 : 48 : 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 : 122 : while ((note = find_reg_note (insn, REG_LABEL_OPERAND, old_label))
1642 : 61 : != NULL_RTX)
1643 : 0 : XEXP (note, 0) = new_label;
1644 : : }
1645 : : }
1646 : :
1647 : 4963364 : if (EDGE_COUNT (e->src->succs) >= 2 || abnormal_edge_flags || asm_goto_edge)
1648 : : {
1649 : 961331 : rtx_insn *new_head;
1650 : 961331 : profile_count count = e->count ();
1651 : 961331 : 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 : 961331 : rtx_jump_table_data *table;
1658 : 961331 : if (tablejump_p (BB_END (e->src), NULL, &table))
1659 : 0 : new_head = table;
1660 : : else
1661 : 961331 : new_head = BB_END (e->src);
1662 : 961331 : new_head = NEXT_INSN (new_head);
1663 : :
1664 : 961331 : jump_block = create_basic_block (new_head, NULL, e->src);
1665 : 961331 : jump_block->count = count;
1666 : :
1667 : : /* Make sure new block ends up in correct hot/cold section. */
1668 : :
1669 : 961331 : BB_COPY_PARTITION (jump_block, e->src);
1670 : :
1671 : : /* Wire edge in. */
1672 : 961331 : new_edge = make_edge (e->src, jump_block, EDGE_FALLTHRU);
1673 : 961331 : new_edge->probability = probability;
1674 : :
1675 : : /* Redirect old edge. */
1676 : 961331 : redirect_edge_pred (e, jump_block);
1677 : 961331 : 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 : 961331 : 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 : 961331 : if (asm_goto_edge)
1686 : : {
1687 : 61 : new_edge->probability /= 2;
1688 : 61 : jump_block->count /= 2;
1689 : 122 : edge new_edge2 = make_edge (new_edge->src, target,
1690 : 61 : e->flags & ~EDGE_FALLTHRU);
1691 : 61 : new_edge2->probability = probability - new_edge->probability;
1692 : : }
1693 : :
1694 : 961331 : new_bb = jump_block;
1695 : : }
1696 : : else
1697 : : jump_block = e->src;
1698 : :
1699 : 4963364 : const location_t loc = e->goto_locus;
1700 : 4963364 : e->flags &= ~EDGE_FALLTHRU;
1701 : 4963364 : if (target == EXIT_BLOCK_PTR_FOR_FN (cfun))
1702 : : {
1703 : 538 : 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 : 538 : gcc_assert (jump_label == simple_return_rtx);
1709 : 538 : emit_jump_insn_after_setloc (targetm.gen_simple_return (),
1710 : 538 : BB_END (jump_block), loc);
1711 : : }
1712 : 538 : set_return_jump_label (BB_END (jump_block));
1713 : : }
1714 : : else
1715 : : {
1716 : 4962826 : rtx_code_label *label = block_label (target);
1717 : 4962826 : emit_jump_insn_after_setloc (targetm.gen_jump (label),
1718 : 4962826 : BB_END (jump_block), loc);
1719 : 4962826 : JUMP_LABEL (BB_END (jump_block)) = label;
1720 : 4962826 : 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 : 4963364 : emit_barrier_after_bb (jump_block);
1726 : 4963364 : redirect_edge_succ_nodup (e, target);
1727 : :
1728 : 4963364 : if (abnormal_edge_flags)
1729 : 0 : make_edge (src, target, abnormal_edge_flags);
1730 : :
1731 : 4963364 : df_mark_solutions_dirty ();
1732 : 4963364 : fixup_partition_crossing (e);
1733 : 4963364 : 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 : 779727 : rtl_force_nonfallthru (edge e)
1742 : : {
1743 : 779727 : 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 : 437963 : rtl_redirect_edge_and_branch_force (edge e, basic_block target)
1752 : : {
1753 : 437963 : if (redirect_edge_and_branch (e, target)
1754 : 437963 : || 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 : 357389 : df_set_bb_dirty (e->src);
1760 : 357389 : 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 : 627747 : rtl_tidy_fallthru_edge (edge e)
1768 : : {
1769 : 627747 : rtx_insn *q;
1770 : 627747 : 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 : 1273135 : for (q = NEXT_INSN (BB_END (b)); q != BB_HEAD (c); q = NEXT_INSN (q))
1783 : 17641 : 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 : 627747 : q = BB_END (b);
1790 : 627747 : if (JUMP_P (q)
1791 : 25098 : && onlyjump_p (q)
1792 : 652835 : && (any_uncondjump_p (q)
1793 : 8062 : || single_succ_p (b)))
1794 : : {
1795 : 17076 : rtx_insn *label;
1796 : 17076 : rtx_jump_table_data *table;
1797 : :
1798 : 17076 : 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 : 17076 : 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 : 610671 : else if (JUMP_P (q) && any_uncondjump_p (q))
1817 : : return;
1818 : :
1819 : : /* Selectively unlink the sequence. */
1820 : 627747 : if (q != PREV_INSN (BB_HEAD (c)))
1821 : 17280 : delete_insn_chain (NEXT_INSN (q), PREV_INSN (BB_HEAD (c)), false);
1822 : :
1823 : 627747 : e->flags |= EDGE_FALLTHRU;
1824 : : }
1825 : :
1826 : : /* Should move basic block BB after basic block AFTER. NIY. */
1827 : :
1828 : : static bool
1829 : 665853 : rtl_move_block_after (basic_block bb ATTRIBUTE_UNUSED,
1830 : : basic_block after ATTRIBUTE_UNUSED)
1831 : : {
1832 : 665853 : return false;
1833 : : }
1834 : :
1835 : : /* Locate the last bb in the same partition as START_BB. */
1836 : :
1837 : : static basic_block
1838 : 34165 : last_bb_in_partition (basic_block start_bb)
1839 : : {
1840 : 34165 : basic_block bb;
1841 : 22461849 : FOR_BB_BETWEEN (bb, start_bb, EXIT_BLOCK_PTR_FOR_FN (cfun), next_bb)
1842 : : {
1843 : 22461849 : 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 : 1176072 : rtl_split_edge (edge edge_in)
1859 : : {
1860 : 1176072 : basic_block bb, new_bb;
1861 : 1176072 : rtx_insn *before;
1862 : :
1863 : : /* Abnormal edges cannot be split. */
1864 : 1176072 : 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 : 1176072 : if ((edge_in->flags & EDGE_FALLTHRU) == 0)
1869 : : {
1870 : 707872 : edge e = find_fallthru_edge (edge_in->dest->preds);
1871 : :
1872 : 707872 : if (e)
1873 : 553182 : force_nonfallthru (e);
1874 : : }
1875 : :
1876 : : /* Create the basic block note. */
1877 : 1176072 : if (edge_in->dest != EXIT_BLOCK_PTR_FOR_FN (cfun))
1878 : 935305 : 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 : 1176072 : if ((edge_in->flags & EDGE_FALLTHRU)
1885 : 468200 : && edge_in->dest == EXIT_BLOCK_PTR_FOR_FN (cfun))
1886 : : {
1887 : 240767 : before = NEXT_INSN (BB_END (edge_in->src));
1888 : 240767 : bb = create_basic_block (before, NULL, edge_in->src);
1889 : 240767 : BB_COPY_PARTITION (bb, edge_in->src);
1890 : 240767 : }
1891 : : else
1892 : : {
1893 : 935305 : if (edge_in->src == ENTRY_BLOCK_PTR_FOR_FN (cfun))
1894 : : {
1895 : 77183 : bb = create_basic_block (before, NULL, edge_in->dest->prev_bb);
1896 : 77183 : BB_COPY_PARTITION (bb, edge_in->dest);
1897 : : }
1898 : : else
1899 : : {
1900 : 858122 : 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 : 858122 : if (crtl->bb_reorder_complete
1909 : 62060 : && (edge_in->flags & EDGE_CROSSING))
1910 : : {
1911 : 34165 : after = last_bb_in_partition (edge_in->src);
1912 : 34165 : 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 : 34165 : gcc_checking_assert (BARRIER_P (before));
1916 : 34165 : before = NEXT_INSN (before);
1917 : : }
1918 : 858122 : 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 : 858122 : BB_COPY_PARTITION (bb, edge_in->src);
1924 : : }
1925 : : }
1926 : :
1927 : 1176072 : make_single_succ_edge (bb, edge_in->dest, EDGE_FALLTHRU);
1928 : :
1929 : : /* Can't allow a region crossing edge to be fallthrough. */
1930 : 1176072 : if (BB_PARTITION (bb) != BB_PARTITION (edge_in->dest)
1931 : 66079 : && edge_in->dest != EXIT_BLOCK_PTR_FOR_FN (cfun))
1932 : : {
1933 : 34482 : new_bb = force_nonfallthru (single_succ_edge (bb));
1934 : 34482 : 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 : 1176072 : if ((edge_in->flags & EDGE_FALLTHRU) == 0)
1940 : : {
1941 : 707872 : edge redirected = redirect_edge_and_branch (edge_in, bb);
1942 : 707872 : gcc_assert (redirected);
1943 : : }
1944 : : else
1945 : : {
1946 : 468200 : 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 : 391017 : rtx_insn *last = BB_END (edge_in->src);
1952 : 391017 : if (last
1953 : 391017 : && JUMP_P (last)
1954 : 166220 : && edge_in->dest != EXIT_BLOCK_PTR_FOR_FN (cfun)
1955 : 139974 : && (extract_asm_operands (PATTERN (last))
1956 : 139972 : || JUMP_LABEL (last) == before)
1957 : 391019 : && patch_jump_insn (last, before, bb))
1958 : 2 : df_set_bb_dirty (edge_in->src);
1959 : : }
1960 : 468200 : redirect_edge_succ (edge_in, bb);
1961 : : }
1962 : :
1963 : 1176072 : 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 : 5391626 : 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 : 5391626 : gcc_assert (!((e->flags & EDGE_ABNORMAL) && EDGE_CRITICAL_P (e)));
1977 : :
1978 : 5391626 : if (e->insns.r == NULL_RTX)
1979 : 4588666 : start_sequence ();
1980 : : else
1981 : 802960 : push_to_sequence (e->insns.r);
1982 : :
1983 : 5391626 : emit_insn (pattern);
1984 : :
1985 : 5391626 : e->insns.r = get_insns ();
1986 : 5391626 : end_sequence ();
1987 : 5391626 : }
1988 : :
1989 : : /* Like insert_insn_on_edge, but if there are already queued instructions
1990 : : on the edge, PATTERN is prepended to them. */
1991 : :
1992 : : void
1993 : 333 : prepend_insn_to_edge (rtx pattern, edge e)
1994 : : {
1995 : : /* We cannot insert instructions on an abnormal critical edge.
1996 : : It will be easier to find the culprit if we die now. */
1997 : 333 : gcc_assert (!((e->flags & EDGE_ABNORMAL) && EDGE_CRITICAL_P (e)));
1998 : :
1999 : 333 : start_sequence ();
2000 : :
2001 : 333 : emit_insn (pattern);
2002 : 333 : emit_insn (e->insns.r);
2003 : :
2004 : 333 : e->insns.r = get_insns ();
2005 : 333 : end_sequence ();
2006 : 333 : }
2007 : :
2008 : : /* Update the CFG for the instructions queued on edge E. */
2009 : :
2010 : : void
2011 : 4588977 : commit_one_edge_insertion (edge e)
2012 : : {
2013 : 4588977 : rtx_insn *before = NULL, *after = NULL, *insns, *tmp, *last;
2014 : 4588977 : basic_block bb;
2015 : :
2016 : : /* Pull the insns off the edge now since the edge might go away. */
2017 : 4588977 : insns = e->insns.r;
2018 : 4588977 : e->insns.r = NULL;
2019 : :
2020 : : /* Allow the sequence to contain internal jumps, such as a memcpy loop
2021 : : or an allocation loop. If such a sequence is emitted during RTL
2022 : : expansion, we'll create the appropriate basic blocks later,
2023 : : at the end of the pass. But if such a sequence is emitted after
2024 : : initial expansion, we'll need to find the subblocks ourselves. */
2025 : 4588977 : bool contains_jump = false;
2026 : 4588977 : if (!currently_expanding_to_rtl)
2027 : 13059648 : for (rtx_insn *insn = insns; insn; insn = NEXT_INSN (insn))
2028 : 11281585 : if (JUMP_P (insn))
2029 : : {
2030 : 1572735 : rebuild_jump_labels_chain (insns);
2031 : 1572735 : contains_jump = true;
2032 : 1572735 : break;
2033 : : }
2034 : :
2035 : : /* Figure out where to put these insns. If the destination has
2036 : : one predecessor, insert there. Except for the exit block. */
2037 : 4588977 : if (single_pred_p (e->dest) && e->dest != EXIT_BLOCK_PTR_FOR_FN (cfun))
2038 : : {
2039 : 1568074 : bb = e->dest;
2040 : :
2041 : : /* Get the location correct wrt a code label, and "nice" wrt
2042 : : a basic block note, and before everything else. */
2043 : 1568074 : tmp = BB_HEAD (bb);
2044 : 1568074 : if (LABEL_P (tmp))
2045 : 74247 : tmp = NEXT_INSN (tmp);
2046 : 1568074 : if (NOTE_INSN_BASIC_BLOCK_P (tmp))
2047 : 1568074 : tmp = NEXT_INSN (tmp);
2048 : 1568074 : if (tmp == BB_HEAD (bb))
2049 : : before = tmp;
2050 : 1568074 : else if (tmp)
2051 : 1568074 : after = PREV_INSN (tmp);
2052 : : else
2053 : 0 : after = get_last_insn ();
2054 : : }
2055 : :
2056 : : /* If the source has one successor and the edge is not abnormal,
2057 : : insert there. Except for the entry block.
2058 : : Don't do this if the predecessor ends in a jump other than
2059 : : unconditional simple jump. E.g. for asm goto that points all
2060 : : its labels at the fallthru basic block, we can't insert instructions
2061 : : before the asm goto, as the asm goto can have various of side effects,
2062 : : and can't emit instructions after the asm goto, as it must end
2063 : : the basic block. */
2064 : 3020903 : else if ((e->flags & EDGE_ABNORMAL) == 0
2065 : 3020903 : && single_succ_p (e->src)
2066 : 2125940 : && e->src != ENTRY_BLOCK_PTR_FOR_FN (cfun)
2067 : 5145421 : && (!JUMP_P (BB_END (e->src))
2068 : 304870 : || simplejump_p (BB_END (e->src))))
2069 : : {
2070 : 2124518 : bb = e->src;
2071 : :
2072 : : /* It is possible to have a non-simple jump here. Consider a target
2073 : : where some forms of unconditional jumps clobber a register. This
2074 : : happens on the fr30 for example.
2075 : :
2076 : : We know this block has a single successor, so we can just emit
2077 : : the queued insns before the jump. */
2078 : 2124518 : if (JUMP_P (BB_END (bb)))
2079 : : before = BB_END (bb);
2080 : : else
2081 : : {
2082 : : /* We'd better be fallthru, or we've lost track of what's what. */
2083 : 1819648 : gcc_assert (e->flags & EDGE_FALLTHRU);
2084 : :
2085 : : after = BB_END (bb);
2086 : : }
2087 : : }
2088 : :
2089 : : /* Otherwise we must split the edge. */
2090 : : else
2091 : : {
2092 : 896385 : bb = split_edge (e);
2093 : :
2094 : : /* If E crossed a partition boundary, we needed to make bb end in
2095 : : a region-crossing jump, even though it was originally fallthru. */
2096 : 896385 : if (JUMP_P (BB_END (bb)))
2097 : : before = BB_END (bb);
2098 : : else
2099 : : after = BB_END (bb);
2100 : : }
2101 : :
2102 : : /* Now that we've found the spot, do the insertion. */
2103 : 1568074 : if (before)
2104 : : {
2105 : 339351 : emit_insn_before_noloc (insns, before, bb);
2106 : 339351 : last = prev_nonnote_insn (before);
2107 : : }
2108 : : else
2109 : 4249626 : last = emit_insn_after_noloc (insns, after, bb);
2110 : :
2111 : 4588977 : if (returnjump_p (last))
2112 : : {
2113 : : /* ??? Remove all outgoing edges from BB and add one for EXIT.
2114 : : This is not currently a problem because this only happens
2115 : : for the (single) epilogue, which already has a fallthru edge
2116 : : to EXIT. */
2117 : :
2118 : 1312966 : e = single_succ_edge (bb);
2119 : 2625932 : gcc_assert (e->dest == EXIT_BLOCK_PTR_FOR_FN (cfun)
2120 : : && single_succ_p (bb) && (e->flags & EDGE_FALLTHRU));
2121 : :
2122 : 1312966 : e->flags &= ~EDGE_FALLTHRU;
2123 : 1312966 : emit_barrier_after (last);
2124 : :
2125 : 1312966 : if (before)
2126 : 0 : delete_insn (before);
2127 : : }
2128 : : else
2129 : : /* Sequences inserted after RTL expansion are expected to be SESE,
2130 : : with only internal branches allowed. If the sequence jumps outside
2131 : : itself then we do not know how to add the associated edges here. */
2132 : 3276011 : gcc_assert (!JUMP_P (last) || currently_expanding_to_rtl);
2133 : :
2134 : 4588977 : if (contains_jump)
2135 : 1572735 : find_sub_basic_blocks (bb);
2136 : 4588977 : }
2137 : :
2138 : : /* Update the CFG for all queued instructions. */
2139 : :
2140 : : void
2141 : 4375319 : commit_edge_insertions (void)
2142 : : {
2143 : 4375319 : basic_block bb;
2144 : :
2145 : : /* Optimization passes that invoke this routine can cause hot blocks
2146 : : previously reached by both hot and cold blocks to become dominated only
2147 : : by cold blocks. This will cause the verification below to fail,
2148 : : and lead to now cold code in the hot section. In some cases this
2149 : : may only be visible after newly unreachable blocks are deleted,
2150 : : which will be done by fixup_partitions. */
2151 : 4375319 : fixup_partitions ();
2152 : :
2153 : 4375319 : if (!currently_expanding_to_rtl)
2154 : 2942961 : checking_verify_flow_info ();
2155 : :
2156 : 62254381 : FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun),
2157 : : EXIT_BLOCK_PTR_FOR_FN (cfun), next_bb)
2158 : : {
2159 : 57879062 : edge e;
2160 : 57879062 : edge_iterator ei;
2161 : :
2162 : 138025886 : FOR_EACH_EDGE (e, ei, bb->succs)
2163 : 80146824 : if (e->insns.r)
2164 : : {
2165 : 4549357 : if (currently_expanding_to_rtl)
2166 : 1238179 : rebuild_jump_labels_chain (e->insns.r);
2167 : 4549357 : commit_one_edge_insertion (e);
2168 : : }
2169 : : }
2170 : 4375319 : }
2171 : :
2172 : :
2173 : : /* Print out RTL-specific basic block information (live information
2174 : : at start and end with TDF_DETAILS). FLAGS are the TDF_* masks
2175 : : documented in dumpfile.h. */
2176 : :
2177 : : static void
2178 : 2746 : rtl_dump_bb (FILE *outf, basic_block bb, int indent, dump_flags_t flags)
2179 : : {
2180 : 2746 : char *s_indent;
2181 : :
2182 : 2746 : s_indent = (char *) alloca ((size_t) indent + 1);
2183 : 2746 : memset (s_indent, ' ', (size_t) indent);
2184 : 2746 : s_indent[indent] = '\0';
2185 : :
2186 : 2746 : if (df && (flags & TDF_DETAILS))
2187 : : {
2188 : 735 : df_dump_top (bb, outf);
2189 : 735 : putc ('\n', outf);
2190 : : }
2191 : :
2192 : 2746 : if (bb->index != ENTRY_BLOCK && bb->index != EXIT_BLOCK
2193 : 2746 : && rtl_bb_info_initialized_p (bb))
2194 : : {
2195 : 2172 : rtx_insn *last = BB_END (bb);
2196 : 2172 : if (last)
2197 : 2172 : last = NEXT_INSN (last);
2198 : 15798 : for (rtx_insn *insn = BB_HEAD (bb); insn != last; insn = NEXT_INSN (insn))
2199 : : {
2200 : 13626 : if (flags & TDF_DETAILS)
2201 : 4206 : df_dump_insn_top (insn, outf);
2202 : 13626 : if (! (flags & TDF_SLIM))
2203 : 13594 : print_rtl_single (outf, insn);
2204 : : else
2205 : 32 : dump_insn_slim (outf, insn);
2206 : 13626 : if (flags & TDF_DETAILS)
2207 : 4206 : df_dump_insn_bottom (insn, outf);
2208 : : }
2209 : : }
2210 : :
2211 : 2746 : if (df && (flags & TDF_DETAILS))
2212 : : {
2213 : 735 : df_dump_bottom (bb, outf);
2214 : 735 : putc ('\n', outf);
2215 : : }
2216 : :
2217 : 2746 : }
2218 : :
2219 : : /* Like dump_function_to_file, but for RTL. Print out dataflow information
2220 : : for the start of each basic block. FLAGS are the TDF_* masks documented
2221 : : in dumpfile.h. */
2222 : :
2223 : : void
2224 : 4088 : print_rtl_with_bb (FILE *outf, const rtx_insn *rtx_first, dump_flags_t flags)
2225 : : {
2226 : 4088 : const rtx_insn *tmp_rtx;
2227 : 4088 : if (rtx_first == 0)
2228 : 0 : fprintf (outf, "(nil)\n");
2229 : : else
2230 : : {
2231 : 4088 : enum bb_state { NOT_IN_BB, IN_ONE_BB, IN_MULTIPLE_BB };
2232 : 4088 : int max_uid = get_max_uid ();
2233 : 4088 : basic_block *start = XCNEWVEC (basic_block, max_uid);
2234 : 4088 : basic_block *end = XCNEWVEC (basic_block, max_uid);
2235 : 4088 : enum bb_state *in_bb_p = XCNEWVEC (enum bb_state, max_uid);
2236 : 4088 : basic_block bb;
2237 : :
2238 : : /* After freeing the CFG, we still have BLOCK_FOR_INSN set on most
2239 : : insns, but the CFG is not maintained so the basic block info
2240 : : is not reliable. Therefore it's omitted from the dumps. */
2241 : 4088 : if (! (cfun->curr_properties & PROP_cfg))
2242 : 976 : flags &= ~TDF_BLOCKS;
2243 : :
2244 : 4088 : if (df)
2245 : 3224 : df_dump_start (outf);
2246 : :
2247 : 4088 : if (cfun->curr_properties & PROP_cfg)
2248 : : {
2249 : 21050 : FOR_EACH_BB_REVERSE_FN (bb, cfun)
2250 : : {
2251 : 17938 : rtx_insn *x;
2252 : :
2253 : 17938 : start[INSN_UID (BB_HEAD (bb))] = bb;
2254 : 17938 : end[INSN_UID (BB_END (bb))] = bb;
2255 : 17938 : if (flags & TDF_BLOCKS)
2256 : : {
2257 : 5223 : for (x = BB_HEAD (bb); x != NULL_RTX; x = NEXT_INSN (x))
2258 : : {
2259 : 5223 : enum bb_state state = IN_MULTIPLE_BB;
2260 : :
2261 : 5223 : if (in_bb_p[INSN_UID (x)] == NOT_IN_BB)
2262 : 5223 : state = IN_ONE_BB;
2263 : 5223 : in_bb_p[INSN_UID (x)] = state;
2264 : :
2265 : 5223 : if (x == BB_END (bb))
2266 : : break;
2267 : : }
2268 : : }
2269 : : }
2270 : : }
2271 : :
2272 : 159024 : for (tmp_rtx = rtx_first; tmp_rtx != NULL; tmp_rtx = NEXT_INSN (tmp_rtx))
2273 : : {
2274 : 154936 : if (flags & TDF_BLOCKS)
2275 : : {
2276 : 5957 : bb = start[INSN_UID (tmp_rtx)];
2277 : 5957 : if (bb != NULL)
2278 : : {
2279 : 851 : dump_bb_info (outf, bb, 0, dump_flags, true, false);
2280 : 851 : if (df && (flags & TDF_DETAILS))
2281 : 582 : df_dump_top (bb, outf);
2282 : : }
2283 : :
2284 : 5957 : if (in_bb_p[INSN_UID (tmp_rtx)] == NOT_IN_BB
2285 : 734 : && !NOTE_P (tmp_rtx)
2286 : 6143 : && !BARRIER_P (tmp_rtx))
2287 : 0 : fprintf (outf, ";; Insn is not within a basic block\n");
2288 : 5957 : else if (in_bb_p[INSN_UID (tmp_rtx)] == IN_MULTIPLE_BB)
2289 : 0 : fprintf (outf, ";; Insn is in multiple basic blocks\n");
2290 : : }
2291 : :
2292 : 154936 : if (flags & TDF_DETAILS)
2293 : 17499 : df_dump_insn_top (tmp_rtx, outf);
2294 : 154936 : if (! (flags & TDF_SLIM))
2295 : 154400 : print_rtl_single (outf, tmp_rtx);
2296 : : else
2297 : 536 : dump_insn_slim (outf, tmp_rtx);
2298 : 154936 : if (flags & TDF_DETAILS)
2299 : 17499 : df_dump_insn_bottom (tmp_rtx, outf);
2300 : :
2301 : 154936 : bb = end[INSN_UID (tmp_rtx)];
2302 : 154936 : if (bb != NULL)
2303 : : {
2304 : 17938 : if (flags & TDF_BLOCKS)
2305 : : {
2306 : 851 : dump_bb_info (outf, bb, 0, dump_flags, false, true);
2307 : 851 : if (df && (flags & TDF_DETAILS))
2308 : 582 : df_dump_bottom (bb, outf);
2309 : 851 : putc ('\n', outf);
2310 : : }
2311 : : /* Emit a hint if the fallthrough target of current basic block
2312 : : isn't the one placed right next. */
2313 : 171975 : else if (EDGE_COUNT (bb->succs) > 0)
2314 : : {
2315 : 17039 : gcc_assert (BB_END (bb) == tmp_rtx);
2316 : 17039 : const rtx_insn *ninsn = NEXT_INSN (tmp_rtx);
2317 : : /* Bypass intervening deleted-insn notes and debug insns. */
2318 : 17039 : while (ninsn
2319 : 18058 : && !NONDEBUG_INSN_P (ninsn)
2320 : 38751 : && !start[INSN_UID (ninsn)])
2321 : 3654 : ninsn = NEXT_INSN (ninsn);
2322 : 17039 : edge e = find_fallthru_edge (bb->succs);
2323 : 17039 : if (e && ninsn)
2324 : : {
2325 : 12538 : basic_block dest = e->dest;
2326 : 12538 : if (start[INSN_UID (ninsn)] != dest)
2327 : 2132 : fprintf (outf, "%s ; pc falls through to BB %d\n",
2328 : : print_rtx_head, dest->index);
2329 : : }
2330 : : }
2331 : : }
2332 : : }
2333 : :
2334 : 4088 : free (start);
2335 : 4088 : free (end);
2336 : 4088 : free (in_bb_p);
2337 : : }
2338 : 4088 : }
2339 : :
2340 : : /* Update the branch probability of BB if a REG_BR_PROB is present. */
2341 : :
2342 : : void
2343 : 9015225 : update_br_prob_note (basic_block bb)
2344 : : {
2345 : 9015225 : rtx note;
2346 : 9015225 : note = find_reg_note (BB_END (bb), REG_BR_PROB, NULL_RTX);
2347 : 9015225 : if (!JUMP_P (BB_END (bb)) || !BRANCH_EDGE (bb)->probability.initialized_p ())
2348 : : {
2349 : 218227 : if (note)
2350 : : {
2351 : 2 : rtx *note_link, this_rtx;
2352 : :
2353 : 2 : note_link = ®_NOTES (BB_END (bb));
2354 : 4 : for (this_rtx = *note_link; this_rtx; this_rtx = XEXP (this_rtx, 1))
2355 : 4 : if (this_rtx == note)
2356 : : {
2357 : 2 : *note_link = XEXP (this_rtx, 1);
2358 : 2 : break;
2359 : : }
2360 : : }
2361 : 218227 : return;
2362 : : }
2363 : 8796998 : if (!note
2364 : 8796998 : || XINT (note, 0) == BRANCH_EDGE (bb)->probability.to_reg_br_prob_note ())
2365 : : return;
2366 : 190362 : XINT (note, 0) = BRANCH_EDGE (bb)->probability.to_reg_br_prob_note ();
2367 : : }
2368 : :
2369 : : /* Get the last insn associated with block BB (that includes barriers and
2370 : : tablejumps after BB). */
2371 : : rtx_insn *
2372 : 6396409 : get_last_bb_insn (basic_block bb)
2373 : : {
2374 : 6396409 : rtx_jump_table_data *table;
2375 : 6396409 : rtx_insn *tmp;
2376 : 6396409 : rtx_insn *end = BB_END (bb);
2377 : :
2378 : : /* Include any jump table following the basic block. */
2379 : 6396409 : if (tablejump_p (end, NULL, &table))
2380 : 6 : end = table;
2381 : :
2382 : : /* Include any barriers that may follow the basic block. */
2383 : 6396409 : tmp = next_nonnote_nondebug_insn_bb (end);
2384 : 13338104 : while (tmp && BARRIER_P (tmp))
2385 : : {
2386 : 545286 : end = tmp;
2387 : 545286 : tmp = next_nonnote_nondebug_insn_bb (end);
2388 : : }
2389 : :
2390 : 6396409 : return end;
2391 : : }
2392 : :
2393 : : /* Add all BBs reachable from entry via hot paths into the SET. */
2394 : :
2395 : : void
2396 : 518759 : find_bbs_reachable_by_hot_paths (hash_set<basic_block> *set)
2397 : : {
2398 : 518759 : auto_vec<basic_block, 64> worklist;
2399 : :
2400 : 518759 : set->add (ENTRY_BLOCK_PTR_FOR_FN (cfun));
2401 : 518759 : worklist.safe_push (ENTRY_BLOCK_PTR_FOR_FN (cfun));
2402 : :
2403 : 15527461 : while (worklist.length () > 0)
2404 : : {
2405 : 14489943 : basic_block bb = worklist.pop ();
2406 : 14489943 : edge_iterator ei;
2407 : 14489943 : edge e;
2408 : :
2409 : 36806615 : FOR_EACH_EDGE (e, ei, bb->succs)
2410 : 22316672 : if (BB_PARTITION (e->dest) != BB_COLD_PARTITION
2411 : 22316672 : && !set->add (e->dest))
2412 : 13971184 : worklist.safe_push (e->dest);
2413 : : }
2414 : 518759 : }
2415 : :
2416 : : /* Sanity check partition hotness to ensure that basic blocks in
2417 : : Â the cold partition don't dominate basic blocks in the hot partition.
2418 : : If FLAG_ONLY is true, report violations as errors. Otherwise
2419 : : re-mark the dominated blocks as cold, since this is run after
2420 : : cfg optimizations that may make hot blocks previously reached
2421 : : by both hot and cold blocks now only reachable along cold paths. */
2422 : :
2423 : : static auto_vec<basic_block>
2424 : 458487 : find_partition_fixes (bool flag_only)
2425 : : {
2426 : 458487 : basic_block bb;
2427 : 458487 : auto_vec<basic_block> bbs_to_fix;
2428 : 458487 : hash_set<basic_block> set;
2429 : :
2430 : : /* Callers check this. */
2431 : 458487 : gcc_checking_assert (crtl->has_bb_partition);
2432 : :
2433 : 458487 : find_bbs_reachable_by_hot_paths (&set);
2434 : :
2435 : 14489507 : FOR_EACH_BB_FN (bb, cfun)
2436 : 14031020 : if (!set.contains (bb)
2437 : 14031020 : && BB_PARTITION (bb) != BB_COLD_PARTITION)
2438 : : {
2439 : 322 : if (flag_only)
2440 : 0 : error ("non-cold basic block %d reachable only "
2441 : : "by paths crossing the cold partition", bb->index);
2442 : : else
2443 : 322 : BB_SET_PARTITION (bb, BB_COLD_PARTITION);
2444 : 322 : bbs_to_fix.safe_push (bb);
2445 : : }
2446 : :
2447 : 458487 : return bbs_to_fix;
2448 : 458487 : }
2449 : :
2450 : : /* Perform cleanup on the hot/cold bb partitioning after optimization
2451 : : passes that modify the cfg. */
2452 : :
2453 : : void
2454 : 12381276 : fixup_partitions (void)
2455 : : {
2456 : 12381276 : if (!crtl->has_bb_partition)
2457 : 12038331 : return;
2458 : :
2459 : : /* Delete any blocks that became unreachable and weren't
2460 : : already cleaned up, for example during edge forwarding
2461 : : and convert_jumps_to_returns. This will expose more
2462 : : opportunities for fixing the partition boundaries here.
2463 : : Also, the calculation of the dominance graph during verification
2464 : : will assert if there are unreachable nodes. */
2465 : 342945 : delete_unreachable_blocks ();
2466 : :
2467 : : /* If there are partitions, do a sanity check on them: A basic block in
2468 : : Â a cold partition cannot dominate a basic block in a hot partition.
2469 : : Fixup any that now violate this requirement, as a result of edge
2470 : : forwarding and unreachable block deletion. Â */
2471 : 342945 : auto_vec<basic_block> bbs_to_fix = find_partition_fixes (false);
2472 : :
2473 : : /* Do the partition fixup after all necessary blocks have been converted to
2474 : : cold, so that we only update the region crossings the minimum number of
2475 : : places, which can require forcing edges to be non fallthru. */
2476 : 343228 : if (! bbs_to_fix.is_empty ())
2477 : : {
2478 : 322 : do
2479 : : {
2480 : 322 : basic_block bb = bbs_to_fix.pop ();
2481 : 322 : fixup_new_cold_bb (bb);
2482 : : }
2483 : 605 : while (! bbs_to_fix.is_empty ());
2484 : :
2485 : : /* Fix up hot cold block grouping if needed. */
2486 : 283 : if (crtl->bb_reorder_complete && current_ir_type () == IR_RTL_CFGRTL)
2487 : : {
2488 : 1 : basic_block bb, first = NULL, second = NULL;
2489 : 1 : int current_partition = BB_UNPARTITIONED;
2490 : :
2491 : 16 : FOR_EACH_BB_FN (bb, cfun)
2492 : : {
2493 : 15 : if (current_partition != BB_UNPARTITIONED
2494 : 14 : && BB_PARTITION (bb) != current_partition)
2495 : : {
2496 : 3 : if (first == NULL)
2497 : : first = bb;
2498 : 2 : else if (second == NULL)
2499 : : second = bb;
2500 : : else
2501 : : {
2502 : : /* If we switch partitions for the 3rd, 5th etc. time,
2503 : : move bbs first (inclusive) .. second (exclusive) right
2504 : : before bb. */
2505 : 1 : basic_block prev_first = first->prev_bb;
2506 : 1 : basic_block prev_second = second->prev_bb;
2507 : 1 : basic_block prev_bb = bb->prev_bb;
2508 : 1 : prev_first->next_bb = second;
2509 : 1 : second->prev_bb = prev_first;
2510 : 1 : prev_second->next_bb = bb;
2511 : 1 : bb->prev_bb = prev_second;
2512 : 1 : prev_bb->next_bb = first;
2513 : 1 : first->prev_bb = prev_bb;
2514 : 1 : rtx_insn *prev_first_insn = PREV_INSN (BB_HEAD (first));
2515 : 1 : rtx_insn *prev_second_insn
2516 : 1 : = PREV_INSN (BB_HEAD (second));
2517 : 1 : rtx_insn *prev_bb_insn = PREV_INSN (BB_HEAD (bb));
2518 : 1 : SET_NEXT_INSN (prev_first_insn) = BB_HEAD (second);
2519 : 1 : SET_PREV_INSN (BB_HEAD (second)) = prev_first_insn;
2520 : 1 : SET_NEXT_INSN (prev_second_insn) = BB_HEAD (bb);
2521 : 1 : SET_PREV_INSN (BB_HEAD (bb)) = prev_second_insn;
2522 : 1 : SET_NEXT_INSN (prev_bb_insn) = BB_HEAD (first);
2523 : 1 : SET_PREV_INSN (BB_HEAD (first)) = prev_bb_insn;
2524 : 1 : second = NULL;
2525 : : }
2526 : : }
2527 : 15 : current_partition = BB_PARTITION (bb);
2528 : : }
2529 : 1 : gcc_assert (!second);
2530 : : }
2531 : : }
2532 : 342945 : }
2533 : :
2534 : : /* Verify, in the basic block chain, that there is at most one switch
2535 : : between hot/cold partitions. This condition will not be true until
2536 : : after reorder_basic_blocks is called. */
2537 : :
2538 : : static bool
2539 : 58801642 : verify_hot_cold_block_grouping (void)
2540 : : {
2541 : 58801642 : basic_block bb;
2542 : 58801642 : bool err = false;
2543 : 58801642 : bool switched_sections = false;
2544 : 58801642 : int current_partition = BB_UNPARTITIONED;
2545 : :
2546 : : /* Even after bb reordering is complete, we go into cfglayout mode
2547 : : again (in compgoto). Ensure we don't call this before going back
2548 : : into linearized RTL when any layout fixes would have been committed. */
2549 : 58801642 : if (!crtl->bb_reorder_complete
2550 : 58801642 : || current_ir_type () != IR_RTL_CFGRTL)
2551 : 51722420 : return err;
2552 : :
2553 : 120456080 : FOR_EACH_BB_FN (bb, cfun)
2554 : : {
2555 : 113376858 : if (current_partition != BB_UNPARTITIONED
2556 : 46433606 : && BB_PARTITION (bb) != current_partition)
2557 : : {
2558 : 680607 : if (switched_sections)
2559 : : {
2560 : 0 : error ("multiple hot/cold transitions found (bb %i)",
2561 : : bb->index);
2562 : 0 : err = true;
2563 : : }
2564 : : else
2565 : : switched_sections = true;
2566 : :
2567 : 680607 : if (!crtl->has_bb_partition)
2568 : 0 : error ("partition found but function partition flag not set");
2569 : : }
2570 : 113376858 : current_partition = BB_PARTITION (bb);
2571 : : }
2572 : :
2573 : : return err;
2574 : : }
2575 : :
2576 : :
2577 : : /* Perform several checks on the edges out of each block, such as
2578 : : the consistency of the branch probabilities, the correctness
2579 : : of hot/cold partition crossing edges, and the number of expected
2580 : : successor edges. Also verify that the dominance relationship
2581 : : between hot/cold blocks is sane. */
2582 : :
2583 : : static bool
2584 : 92872424 : rtl_verify_edges (void)
2585 : : {
2586 : 92872424 : bool err = false;
2587 : 92872424 : basic_block bb;
2588 : :
2589 : 1072171702 : FOR_EACH_BB_REVERSE_FN (bb, cfun)
2590 : : {
2591 : 979299278 : int n_fallthru = 0, n_branch = 0, n_abnormal_call = 0, n_sibcall = 0;
2592 : 979299278 : int n_eh = 0, n_abnormal = 0;
2593 : 979299278 : edge e, fallthru = NULL;
2594 : 979299278 : edge_iterator ei;
2595 : 979299278 : rtx note;
2596 : 979299278 : bool has_crossing_edge = false;
2597 : :
2598 : 979299278 : if (JUMP_P (BB_END (bb))
2599 : 572040993 : && (note = find_reg_note (BB_END (bb), REG_BR_PROB, NULL_RTX))
2600 : 388044047 : && EDGE_COUNT (bb->succs) >= 2
2601 : 1367343325 : && any_condjump_p (BB_END (bb)))
2602 : : {
2603 : 388044047 : if (!BRANCH_EDGE (bb)->probability.initialized_p ())
2604 : : {
2605 : 158052 : if (profile_status_for_fn (cfun) != PROFILE_ABSENT)
2606 : : {
2607 : 0 : error ("verify_flow_info: "
2608 : : "REG_BR_PROB is set but cfg probability is not");
2609 : 0 : err = true;
2610 : : }
2611 : : }
2612 : 387885995 : else if (XINT (note, 0)
2613 : 387885995 : != BRANCH_EDGE (bb)->probability.to_reg_br_prob_note ()
2614 : 387885995 : && profile_status_for_fn (cfun) != PROFILE_ABSENT)
2615 : : {
2616 : 0 : error ("verify_flow_info: REG_BR_PROB does not match cfg %i %i",
2617 : : XINT (note, 0),
2618 : 0 : BRANCH_EDGE (bb)->probability.to_reg_br_prob_note ());
2619 : 0 : err = true;
2620 : : }
2621 : : }
2622 : :
2623 : 2403619391 : FOR_EACH_EDGE (e, ei, bb->succs)
2624 : : {
2625 : 1424320113 : bool is_crossing;
2626 : :
2627 : 1424320113 : if (e->flags & EDGE_FALLTHRU)
2628 : 778273470 : n_fallthru++, fallthru = e;
2629 : :
2630 : 2848640226 : is_crossing = (BB_PARTITION (e->src) != BB_PARTITION (e->dest)
2631 : 33213476 : && e->src != ENTRY_BLOCK_PTR_FOR_FN (cfun)
2632 : 1457533589 : && e->dest != EXIT_BLOCK_PTR_FOR_FN (cfun));
2633 : 1424320113 : has_crossing_edge |= is_crossing;
2634 : 1424320113 : if (e->flags & EDGE_CROSSING)
2635 : : {
2636 : 18378073 : if (!is_crossing)
2637 : : {
2638 : 0 : error ("EDGE_CROSSING incorrectly set across same section");
2639 : 0 : err = true;
2640 : : }
2641 : 18378073 : if (e->flags & EDGE_FALLTHRU)
2642 : : {
2643 : 0 : error ("fallthru edge crosses section boundary in bb %i",
2644 : 0 : e->src->index);
2645 : 0 : err = true;
2646 : : }
2647 : 18378073 : if (e->flags & EDGE_EH)
2648 : : {
2649 : 0 : error ("EH edge crosses section boundary in bb %i",
2650 : 0 : e->src->index);
2651 : 0 : err = true;
2652 : : }
2653 : 18378073 : if (JUMP_P (BB_END (bb)) && !CROSSING_JUMP_P (BB_END (bb)))
2654 : : {
2655 : 0 : error ("No region crossing jump at section boundary in bb %i",
2656 : : bb->index);
2657 : 0 : err = true;
2658 : : }
2659 : : }
2660 : 1405942040 : else if (is_crossing)
2661 : : {
2662 : 0 : error ("EDGE_CROSSING missing across section boundary");
2663 : 0 : err = true;
2664 : : }
2665 : :
2666 : 1424320113 : if ((e->flags & ~(EDGE_DFS_BACK
2667 : : | EDGE_CAN_FALLTHRU
2668 : : | EDGE_IRREDUCIBLE_LOOP
2669 : : | EDGE_LOOP_EXIT
2670 : : | EDGE_CROSSING
2671 : : | EDGE_PRESERVE)) == 0)
2672 : 577807381 : n_branch++;
2673 : :
2674 : 1424320113 : if (e->flags & EDGE_ABNORMAL_CALL)
2675 : 47531790 : n_abnormal_call++;
2676 : :
2677 : 1424320113 : if (e->flags & EDGE_SIBCALL)
2678 : 9406899 : n_sibcall++;
2679 : :
2680 : 1424320113 : if (e->flags & EDGE_EH)
2681 : 57046409 : n_eh++;
2682 : :
2683 : 1424320113 : if (e->flags & EDGE_ABNORMAL)
2684 : 67878617 : n_abnormal++;
2685 : : }
2686 : :
2687 : 979299278 : if (!has_crossing_edge
2688 : 960944153 : && JUMP_P (BB_END (bb))
2689 : 1532991113 : && CROSSING_JUMP_P (BB_END (bb)))
2690 : : {
2691 : 0 : print_rtl_with_bb (stderr, get_insns (), TDF_BLOCKS | TDF_DETAILS);
2692 : 0 : error ("Region crossing jump across same section in bb %i",
2693 : : bb->index);
2694 : 0 : err = true;
2695 : : }
2696 : :
2697 : 979299278 : if (n_eh && !find_reg_note (BB_END (bb), REG_EH_REGION, NULL_RTX))
2698 : : {
2699 : 0 : error ("missing REG_EH_REGION note at the end of bb %i", bb->index);
2700 : 0 : err = true;
2701 : : }
2702 : 979299278 : if (n_eh > 1)
2703 : : {
2704 : 0 : error ("too many exception handling edges in bb %i", bb->index);
2705 : 0 : err = true;
2706 : : }
2707 : 979299278 : if (n_branch
2708 : 979299278 : && (!JUMP_P (BB_END (bb))
2709 : 571948624 : || (n_branch > 1 && (any_uncondjump_p (BB_END (bb))
2710 : 580188 : || any_condjump_p (BB_END (bb))))))
2711 : : {
2712 : 0 : error ("too many outgoing branch edges from bb %i", bb->index);
2713 : 0 : err = true;
2714 : : }
2715 : 979299278 : if (n_fallthru && any_uncondjump_p (BB_END (bb)))
2716 : : {
2717 : 0 : error ("fallthru edge after unconditional jump in bb %i", bb->index);
2718 : 0 : err = true;
2719 : : }
2720 : 979299278 : if (n_branch != 1 && any_uncondjump_p (BB_END (bb)))
2721 : : {
2722 : 0 : error ("wrong number of branch edges after unconditional jump"
2723 : : " in bb %i", bb->index);
2724 : 0 : err = true;
2725 : : }
2726 : 407930842 : if (n_branch != 1 && any_condjump_p (BB_END (bb))
2727 : 979300560 : && JUMP_LABEL (BB_END (bb)) != BB_HEAD (fallthru->dest))
2728 : : {
2729 : 0 : error ("wrong amount of branch edges after conditional jump"
2730 : : " in bb %i", bb->index);
2731 : 0 : err = true;
2732 : : }
2733 : 979299278 : if (n_abnormal_call && !CALL_P (BB_END (bb)))
2734 : : {
2735 : 0 : error ("abnormal call edges for non-call insn in bb %i", bb->index);
2736 : 0 : err = true;
2737 : : }
2738 : 979299278 : if (n_sibcall && !CALL_P (BB_END (bb)))
2739 : : {
2740 : 0 : error ("sibcall edges for non-call insn in bb %i", bb->index);
2741 : 0 : err = true;
2742 : : }
2743 : 979299278 : if (n_abnormal > n_eh
2744 : 9605738 : && !(CALL_P (BB_END (bb))
2745 : 9586367 : && n_abnormal == n_abnormal_call + n_sibcall)
2746 : 979318649 : && (!JUMP_P (BB_END (bb))
2747 : 19371 : || any_condjump_p (BB_END (bb))
2748 : 19371 : || any_uncondjump_p (BB_END (bb))))
2749 : : {
2750 : 0 : error ("abnormal edges for no purpose in bb %i", bb->index);
2751 : 0 : err = true;
2752 : : }
2753 : :
2754 : 979299278 : int has_eh = -1;
2755 : 2397524147 : FOR_EACH_EDGE (e, ei, bb->preds)
2756 : : {
2757 : 1418224869 : if (has_eh == -1)
2758 : 979168656 : has_eh = (e->flags & EDGE_EH);
2759 : 1418224869 : if ((e->flags & EDGE_EH) == has_eh)
2760 : 1418224869 : continue;
2761 : 0 : error ("EH incoming edge mixed with non-EH incoming edges "
2762 : : "in bb %i", bb->index);
2763 : 0 : err = true;
2764 : 0 : break;
2765 : : }
2766 : : }
2767 : :
2768 : : /* If there are partitions, do a sanity check on them: A basic block in
2769 : : Â a cold partition cannot dominate a basic block in a hot partition. Â */
2770 : 2658163 : if (crtl->has_bb_partition && !err
2771 : 95530587 : && current_ir_type () == IR_RTL_CFGLAYOUT)
2772 : : {
2773 : 115542 : auto_vec<basic_block> bbs_to_fix = find_partition_fixes (true);
2774 : 231084 : err = !bbs_to_fix.is_empty ();
2775 : 115542 : }
2776 : :
2777 : : /* Clean up. */
2778 : 92872424 : return err;
2779 : : }
2780 : :
2781 : : /* Checks on the instructions within blocks. Currently checks that each
2782 : : block starts with a basic block note, and that basic block notes and
2783 : : control flow jumps are not found in the middle of the block. */
2784 : :
2785 : : static bool
2786 : 92872424 : rtl_verify_bb_insns (void)
2787 : : {
2788 : 92872424 : rtx_insn *x;
2789 : 92872424 : bool err = false;
2790 : 92872424 : basic_block bb;
2791 : :
2792 : 1072171702 : FOR_EACH_BB_REVERSE_FN (bb, cfun)
2793 : : {
2794 : : /* Now check the header of basic
2795 : : block. It ought to contain optional CODE_LABEL followed
2796 : : by NOTE_BASIC_BLOCK. */
2797 : 979299278 : x = BB_HEAD (bb);
2798 : 979299278 : if (LABEL_P (x))
2799 : : {
2800 : 470820469 : if (BB_END (bb) == x)
2801 : : {
2802 : 0 : error ("NOTE_INSN_BASIC_BLOCK is missing for block %d",
2803 : : bb->index);
2804 : 0 : err = true;
2805 : : }
2806 : :
2807 : 470820469 : x = NEXT_INSN (x);
2808 : : }
2809 : :
2810 : 979299278 : if (!NOTE_INSN_BASIC_BLOCK_P (x) || NOTE_BASIC_BLOCK (x) != bb)
2811 : : {
2812 : 0 : error ("NOTE_INSN_BASIC_BLOCK is missing for block %d",
2813 : : bb->index);
2814 : 0 : err = true;
2815 : : }
2816 : :
2817 : 979299278 : if (BB_END (bb) == x)
2818 : : /* Do checks for empty blocks here. */
2819 : : ;
2820 : : else
2821 : 10595642941 : for (x = NEXT_INSN (x); x; x = NEXT_INSN (x))
2822 : : {
2823 : 9633324128 : if (NOTE_INSN_BASIC_BLOCK_P (x))
2824 : : {
2825 : 0 : error ("NOTE_INSN_BASIC_BLOCK %d in middle of basic block %d",
2826 : 0 : INSN_UID (x), bb->index);
2827 : 0 : err = true;
2828 : : }
2829 : :
2830 : 9633324128 : if (x == BB_END (bb))
2831 : : break;
2832 : :
2833 : 8671005315 : if (control_flow_insn_p (x))
2834 : : {
2835 : 0 : error ("in basic block %d:", bb->index);
2836 : 0 : fatal_insn ("flow control insn inside a basic block", x);
2837 : : }
2838 : : }
2839 : : }
2840 : :
2841 : : /* Clean up. */
2842 : 92872424 : return err;
2843 : : }
2844 : :
2845 : : /* Verify that block pointers for instructions in basic blocks, headers and
2846 : : footers are set appropriately. */
2847 : :
2848 : : static bool
2849 : 92872424 : rtl_verify_bb_pointers (void)
2850 : : {
2851 : 92872424 : bool err = false;
2852 : 92872424 : basic_block bb;
2853 : :
2854 : : /* Check the general integrity of the basic blocks. */
2855 : 1072171702 : FOR_EACH_BB_REVERSE_FN (bb, cfun)
2856 : : {
2857 : 979299278 : rtx_insn *insn;
2858 : :
2859 : 979299278 : if (!(bb->flags & BB_RTL))
2860 : : {
2861 : 0 : error ("BB_RTL flag not set for block %d", bb->index);
2862 : 0 : err = true;
2863 : : }
2864 : :
2865 : 12062743153 : FOR_BB_INSNS (bb, insn)
2866 : 11083443875 : if (BLOCK_FOR_INSN (insn) != bb)
2867 : : {
2868 : 0 : error ("insn %d basic block pointer is %d, should be %d",
2869 : 0 : INSN_UID (insn),
2870 : 0 : BLOCK_FOR_INSN (insn) ? BLOCK_FOR_INSN (insn)->index : 0,
2871 : : bb->index);
2872 : 0 : err = true;
2873 : : }
2874 : :
2875 : 979728751 : for (insn = BB_HEADER (bb); insn; insn = NEXT_INSN (insn))
2876 : 429473 : if (!BARRIER_P (insn)
2877 : 429473 : && BLOCK_FOR_INSN (insn) != NULL)
2878 : : {
2879 : 0 : error ("insn %d in header of bb %d has non-NULL basic block",
2880 : 0 : INSN_UID (insn), bb->index);
2881 : 0 : err = true;
2882 : : }
2883 : 1005493403 : for (insn = BB_FOOTER (bb); insn; insn = NEXT_INSN (insn))
2884 : 26194125 : if (!BARRIER_P (insn)
2885 : 26194125 : && BLOCK_FOR_INSN (insn) != NULL)
2886 : : {
2887 : 0 : error ("insn %d in footer of bb %d has non-NULL basic block",
2888 : 0 : INSN_UID (insn), bb->index);
2889 : 0 : err = true;
2890 : : }
2891 : : }
2892 : :
2893 : : /* Clean up. */
2894 : 92872424 : return err;
2895 : : }
2896 : :
2897 : : /* Verify the CFG and RTL consistency common for both underlying RTL and
2898 : : cfglayout RTL.
2899 : :
2900 : : Currently it does following checks:
2901 : :
2902 : : - overlapping of basic blocks
2903 : : - insns with wrong BLOCK_FOR_INSN pointers
2904 : : - headers of basic blocks (the NOTE_INSN_BASIC_BLOCK note)
2905 : : - tails of basic blocks (ensure that boundary is necessary)
2906 : : - scans body of the basic block for JUMP_INSN, CODE_LABEL
2907 : : and NOTE_INSN_BASIC_BLOCK
2908 : : - verify that no fall_thru edge crosses hot/cold partition boundaries
2909 : : - verify that there are no pending RTL branch predictions
2910 : : - verify that hot blocks are not dominated by cold blocks
2911 : :
2912 : : In future it can be extended check a lot of other stuff as well
2913 : : (reachability of basic blocks, life information, etc. etc.). */
2914 : :
2915 : : static bool
2916 : 92872424 : rtl_verify_flow_info_1 (void)
2917 : : {
2918 : 92872424 : bool err = false;
2919 : :
2920 : 92872424 : if (rtl_verify_bb_pointers ())
2921 : : err = true;
2922 : :
2923 : 92872424 : if (rtl_verify_bb_insns ())
2924 : 0 : err = true;
2925 : :
2926 : 92872424 : if (rtl_verify_edges ())
2927 : 0 : err = true;
2928 : :
2929 : 92872424 : return err;
2930 : : }
2931 : :
2932 : : /* Walk the instruction chain and verify that bb head/end pointers
2933 : : are correct, and that instructions are in exactly one bb and have
2934 : : correct block pointers. */
2935 : :
2936 : : static bool
2937 : 58801642 : rtl_verify_bb_insn_chain (void)
2938 : : {
2939 : 58801642 : basic_block bb;
2940 : 58801642 : bool err = false;
2941 : 58801642 : rtx_insn *x;
2942 : 58801642 : rtx_insn *last_head = get_last_insn ();
2943 : 58801642 : basic_block *bb_info;
2944 : 58801642 : const int max_uid = get_max_uid ();
2945 : :
2946 : 58801642 : bb_info = XCNEWVEC (basic_block, max_uid);
2947 : :
2948 : 657901646 : FOR_EACH_BB_REVERSE_FN (bb, cfun)
2949 : : {
2950 : 599100004 : rtx_insn *head = BB_HEAD (bb);
2951 : 599100004 : rtx_insn *end = BB_END (bb);
2952 : :
2953 : 833422545 : for (x = last_head; x != NULL_RTX; x = PREV_INSN (x))
2954 : : {
2955 : : /* Verify the end of the basic block is in the INSN chain. */
2956 : 833422545 : if (x == end)
2957 : : break;
2958 : :
2959 : : /* And that the code outside of basic blocks has NULL bb field. */
2960 : 234322541 : if (!BARRIER_P (x)
2961 : 234322541 : && BLOCK_FOR_INSN (x) != NULL)
2962 : : {
2963 : 0 : error ("insn %d outside of basic blocks has non-NULL bb field",
2964 : 0 : INSN_UID (x));
2965 : 0 : err = true;
2966 : : }
2967 : : }
2968 : :
2969 : 599100004 : if (!x)
2970 : : {
2971 : 0 : error ("end insn %d for block %d not found in the insn stream",
2972 : 0 : INSN_UID (end), bb->index);
2973 : 0 : err = true;
2974 : : }
2975 : :
2976 : : /* Work backwards from the end to the head of the basic block
2977 : : to verify the head is in the RTL chain. */
2978 : 6769750658 : for (; x != NULL_RTX; x = PREV_INSN (x))
2979 : : {
2980 : : /* While walking over the insn chain, verify insns appear
2981 : : in only one basic block. */
2982 : 6769750658 : if (bb_info[INSN_UID (x)] != NULL)
2983 : : {
2984 : 0 : error ("insn %d is in multiple basic blocks (%d and %d)",
2985 : : INSN_UID (x), bb->index, bb_info[INSN_UID (x)]->index);
2986 : 0 : err = true;
2987 : : }
2988 : :
2989 : 6769750658 : bb_info[INSN_UID (x)] = bb;
2990 : :
2991 : 6769750658 : if (x == head)
2992 : : break;
2993 : : }
2994 : 599100004 : if (!x)
2995 : : {
2996 : 0 : error ("head insn %d for block %d not found in the insn stream",
2997 : 0 : INSN_UID (head), bb->index);
2998 : 0 : err = true;
2999 : : }
3000 : :
3001 : 599100004 : last_head = PREV_INSN (x);
3002 : : }
3003 : :
3004 : 118594998 : for (x = last_head; x != NULL_RTX; x = PREV_INSN (x))
3005 : : {
3006 : : /* Check that the code before the first basic block has NULL
3007 : : bb field. */
3008 : 59793356 : if (!BARRIER_P (x)
3009 : 59793356 : && BLOCK_FOR_INSN (x) != NULL)
3010 : : {
3011 : 0 : error ("insn %d outside of basic blocks has non-NULL bb field",
3012 : 0 : INSN_UID (x));
3013 : 0 : err = true;
3014 : : }
3015 : : }
3016 : 58801642 : free (bb_info);
3017 : :
3018 : 58801642 : return err;
3019 : : }
3020 : :
3021 : : /* Verify that fallthru edges point to adjacent blocks in layout order and
3022 : : that barriers exist after non-fallthru blocks. */
3023 : :
3024 : : static bool
3025 : 58801642 : rtl_verify_fallthru (void)
3026 : : {
3027 : 58801642 : basic_block bb;
3028 : 58801642 : bool err = false;
3029 : :
3030 : 657901646 : FOR_EACH_BB_REVERSE_FN (bb, cfun)
3031 : : {
3032 : 599100004 : edge e;
3033 : :
3034 : 599100004 : e = find_fallthru_edge (bb->succs);
3035 : 599100004 : if (!e)
3036 : : {
3037 : 175548335 : rtx_insn *insn;
3038 : :
3039 : : /* Ensure existence of barrier in BB with no fallthru edges. */
3040 : 175995622 : for (insn = NEXT_INSN (BB_END (bb)); ; insn = NEXT_INSN (insn))
3041 : : {
3042 : 175995622 : if (!insn || NOTE_INSN_BASIC_BLOCK_P (insn))
3043 : : {
3044 : 0 : error ("missing barrier after block %i", bb->index);
3045 : 0 : err = true;
3046 : 0 : break;
3047 : : }
3048 : 175995622 : if (BARRIER_P (insn))
3049 : : break;
3050 : : }
3051 : : }
3052 : 423551669 : else if (e->src != ENTRY_BLOCK_PTR_FOR_FN (cfun)
3053 : 423551669 : && e->dest != EXIT_BLOCK_PTR_FOR_FN (cfun))
3054 : : {
3055 : 395149631 : rtx_insn *insn;
3056 : :
3057 : 395149631 : if (e->src->next_bb != e->dest)
3058 : : {
3059 : 0 : error
3060 : 0 : ("verify_flow_info: Incorrect blocks for fallthru %i->%i",
3061 : : e->src->index, e->dest->index);
3062 : 0 : err = true;
3063 : : }
3064 : : else
3065 : 795661240 : for (insn = NEXT_INSN (BB_END (e->src)); insn != BB_HEAD (e->dest);
3066 : 5361978 : insn = NEXT_INSN (insn))
3067 : 5361978 : if (BARRIER_P (insn) || NONDEBUG_INSN_P (insn))
3068 : : {
3069 : 0 : error ("verify_flow_info: Incorrect fallthru %i->%i",
3070 : 0 : e->src->index, e->dest->index);
3071 : 0 : error ("wrong insn in the fallthru edge");
3072 : 0 : debug_rtx (insn);
3073 : 0 : err = true;
3074 : : }
3075 : : }
3076 : : }
3077 : :
3078 : 58801642 : return err;
3079 : : }
3080 : :
3081 : : /* Verify that blocks are laid out in consecutive order. While walking the
3082 : : instructions, verify that all expected instructions are inside the basic
3083 : : blocks, and that all returns are followed by barriers. */
3084 : :
3085 : : static bool
3086 : 58801642 : rtl_verify_bb_layout (void)
3087 : : {
3088 : 58801642 : basic_block bb;
3089 : 58801642 : bool err = false;
3090 : 58801642 : rtx_insn *x, *y;
3091 : 58801642 : int num_bb_notes;
3092 : 58801642 : rtx_insn * const rtx_first = get_insns ();
3093 : 58801642 : basic_block last_bb_seen = ENTRY_BLOCK_PTR_FOR_FN (cfun), curr_bb = NULL;
3094 : :
3095 : 58801642 : num_bb_notes = 0;
3096 : :
3097 : 7122341536 : for (x = rtx_first; x; x = NEXT_INSN (x))
3098 : : {
3099 : 7063539894 : if (NOTE_INSN_BASIC_BLOCK_P (x))
3100 : : {
3101 : 599100004 : bb = NOTE_BASIC_BLOCK (x);
3102 : :
3103 : 599100004 : num_bb_notes++;
3104 : 599100004 : if (bb != last_bb_seen->next_bb)
3105 : 0 : internal_error ("basic blocks not laid down consecutively");
3106 : :
3107 : : curr_bb = last_bb_seen = bb;
3108 : : }
3109 : :
3110 : 7063539894 : if (!curr_bb)
3111 : : {
3112 : 575811477 : switch (GET_CODE (x))
3113 : : {
3114 : : case BARRIER:
3115 : : case NOTE:
3116 : : break;
3117 : :
3118 : 282348902 : case CODE_LABEL:
3119 : : /* An ADDR_VEC is placed outside any basic block. */
3120 : 282348902 : if (NEXT_INSN (x)
3121 : 282348902 : && JUMP_TABLE_DATA_P (NEXT_INSN (x)))
3122 : : x = NEXT_INSN (x);
3123 : :
3124 : : /* But in any case, non-deletable labels can appear anywhere. */
3125 : : break;
3126 : :
3127 : 0 : default:
3128 : 0 : fatal_insn ("insn outside basic block", x);
3129 : : }
3130 : : }
3131 : :
3132 : 7063539894 : if (JUMP_P (x)
3133 : 399292839 : && returnjump_p (x) && ! condjump_p (x)
3134 : 7093144703 : && ! ((y = next_nonnote_nondebug_insn (x))
3135 : 29604809 : && BARRIER_P (y)))
3136 : 0 : fatal_insn ("return not followed by barrier", x);
3137 : :
3138 : 7063539894 : if (curr_bb && x == BB_END (curr_bb))
3139 : 1174911481 : curr_bb = NULL;
3140 : : }
3141 : :
3142 : 58801642 : if (num_bb_notes != n_basic_blocks_for_fn (cfun) - NUM_FIXED_BLOCKS)
3143 : 0 : internal_error
3144 : 0 : ("number of bb notes in insn chain (%d) != n_basic_blocks (%d)",
3145 : : num_bb_notes, n_basic_blocks_for_fn (cfun));
3146 : :
3147 : 58801642 : return err;
3148 : : }
3149 : :
3150 : : /* Verify the CFG and RTL consistency common for both underlying RTL and
3151 : : cfglayout RTL, plus consistency checks specific to linearized RTL mode.
3152 : :
3153 : : Currently it does following checks:
3154 : : - all checks of rtl_verify_flow_info_1
3155 : : - test head/end pointers
3156 : : - check that blocks are laid out in consecutive order
3157 : : - check that all insns are in the basic blocks
3158 : : (except the switch handling code, barriers and notes)
3159 : : - check that all returns are followed by barriers
3160 : : - check that all fallthru edge points to the adjacent blocks
3161 : : - verify that there is a single hot/cold partition boundary after bbro */
3162 : :
3163 : : static bool
3164 : 58801642 : rtl_verify_flow_info (void)
3165 : : {
3166 : 58801642 : bool err = false;
3167 : :
3168 : 58801642 : if (rtl_verify_flow_info_1 ())
3169 : : err = true;
3170 : :
3171 : 58801642 : if (rtl_verify_bb_insn_chain ())
3172 : 0 : err = true;
3173 : :
3174 : 58801642 : if (rtl_verify_fallthru ())
3175 : 0 : err = true;
3176 : :
3177 : 58801642 : if (rtl_verify_bb_layout ())
3178 : : err = true;
3179 : :
3180 : 58801642 : if (verify_hot_cold_block_grouping ())
3181 : 0 : err = true;
3182 : :
3183 : 58801642 : return err;
3184 : : }
3185 : :
3186 : : /* Assume that the preceding pass has possibly eliminated jump instructions
3187 : : or converted the unconditional jumps. Eliminate the edges from CFG.
3188 : : Return true if any edges are eliminated. */
3189 : :
3190 : : bool
3191 : 69308515 : purge_dead_edges (basic_block bb)
3192 : : {
3193 : 69308515 : edge e;
3194 : 69308515 : rtx_insn *insn = BB_END (bb);
3195 : 69308515 : rtx note;
3196 : 69308515 : bool purged = false;
3197 : 69308515 : bool found;
3198 : 69308515 : edge_iterator ei;
3199 : :
3200 : 69308515 : if ((DEBUG_INSN_P (insn) || NOTE_P (insn)) && insn != BB_HEAD (bb))
3201 : 14821663 : do
3202 : 14821663 : insn = PREV_INSN (insn);
3203 : 14821663 : while ((DEBUG_INSN_P (insn) || NOTE_P (insn)) && insn != BB_HEAD (bb));
3204 : :
3205 : : /* If this instruction cannot trap, remove REG_EH_REGION notes. */
3206 : 69308515 : if (NONJUMP_INSN_P (insn)
3207 : 69308515 : && (note = find_reg_note (insn, REG_EH_REGION, NULL)))
3208 : : {
3209 : 1297394 : rtx eqnote;
3210 : :
3211 : 1297394 : if (! may_trap_p (PATTERN (insn))
3212 : 1297394 : || ((eqnote = find_reg_equal_equiv_note (insn))
3213 : 164 : && ! may_trap_p (XEXP (eqnote, 0))))
3214 : 45096 : remove_note (insn, note);
3215 : : }
3216 : :
3217 : : /* Cleanup abnormal edges caused by exceptions or non-local gotos. */
3218 : 165978691 : for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
3219 : : {
3220 : 96670176 : bool remove = false;
3221 : :
3222 : : /* There are three types of edges we need to handle correctly here: EH
3223 : : edges, abnormal call EH edges, and abnormal call non-EH edges. The
3224 : : latter can appear when nonlocal gotos are used. */
3225 : 96670176 : if (e->flags & EDGE_ABNORMAL_CALL)
3226 : : {
3227 : 3169990 : if (!CALL_P (insn))
3228 : : remove = true;
3229 : 3169986 : else if (can_nonlocal_goto (insn))
3230 : : ;
3231 : 3093957 : else if ((e->flags & EDGE_EH) && can_throw_internal (insn))
3232 : : ;
3233 : 0 : else if (flag_tm && find_reg_note (insn, REG_TM, NULL))
3234 : : ;
3235 : : else
3236 : : remove = true;
3237 : : }
3238 : 93500186 : else if (e->flags & EDGE_EH)
3239 : 1864736 : remove = !can_throw_internal (insn);
3240 : :
3241 : 1864736 : if (remove)
3242 : : {
3243 : 369531 : remove_edge (e);
3244 : 369531 : df_set_bb_dirty (bb);
3245 : 369531 : purged = true;
3246 : : }
3247 : : else
3248 : 96300645 : ei_next (&ei);
3249 : : }
3250 : :
3251 : 69308515 : if (JUMP_P (insn))
3252 : : {
3253 : 37158801 : rtx note;
3254 : 37158801 : edge b,f;
3255 : 37158801 : edge_iterator ei;
3256 : :
3257 : : /* We do care only about conditional jumps and simplejumps. */
3258 : 37158801 : if (!any_condjump_p (insn)
3259 : 12368600 : && !returnjump_p (insn)
3260 : 46073795 : && !simplejump_p (insn))
3261 : : return purged;
3262 : :
3263 : : /* Branch probability/prediction notes are defined only for
3264 : : condjumps. We've possibly turned condjump into simplejump. */
3265 : 37122004 : if (simplejump_p (insn))
3266 : : {
3267 : 8878197 : note = find_reg_note (insn, REG_BR_PROB, NULL);
3268 : 8878197 : if (note)
3269 : 5882 : remove_note (insn, note);
3270 : 8878197 : while ((note = find_reg_note (insn, REG_BR_PRED, NULL)))
3271 : 0 : remove_note (insn, note);
3272 : : }
3273 : :
3274 : 99050134 : for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
3275 : : {
3276 : : /* Avoid abnormal flags to leak from computed jumps turned
3277 : : into simplejumps. */
3278 : :
3279 : 61928130 : e->flags &= ~EDGE_ABNORMAL;
3280 : :
3281 : : /* See if this edge is one we should keep. */
3282 : 61928130 : if ((e->flags & EDGE_FALLTHRU) && any_condjump_p (insn))
3283 : : /* A conditional jump can fall through into the next
3284 : : block, so we should keep the edge. */
3285 : : {
3286 : 24790201 : ei_next (&ei);
3287 : 24790201 : continue;
3288 : : }
3289 : 37137929 : else if (e->dest != EXIT_BLOCK_PTR_FOR_FN (cfun)
3290 : 33684323 : && BB_HEAD (e->dest) == JUMP_LABEL (insn))
3291 : : /* If the destination block is the target of the jump,
3292 : : keep the edge. */
3293 : : {
3294 : 33667684 : ei_next (&ei);
3295 : 33667684 : continue;
3296 : : }
3297 : 6923851 : else if (e->dest == EXIT_BLOCK_PTR_FOR_FN (cfun)
3298 : 3470245 : && returnjump_p (insn))
3299 : : /* If the destination block is the exit block, and this
3300 : : instruction is a return, then keep the edge. */
3301 : : {
3302 : 3453606 : ei_next (&ei);
3303 : 3453606 : continue;
3304 : : }
3305 : 16639 : else if ((e->flags & EDGE_EH) && can_throw_internal (insn))
3306 : : /* Keep the edges that correspond to exceptions thrown by
3307 : : this instruction and rematerialize the EDGE_ABNORMAL
3308 : : flag we just cleared above. */
3309 : : {
3310 : 0 : e->flags |= EDGE_ABNORMAL;
3311 : 0 : ei_next (&ei);
3312 : 0 : continue;
3313 : : }
3314 : :
3315 : : /* We do not need this edge. */
3316 : 16639 : df_set_bb_dirty (bb);
3317 : 16639 : purged = true;
3318 : 16639 : remove_edge (e);
3319 : : }
3320 : :
3321 : 37297377 : if (EDGE_COUNT (bb->succs) == 0 || !purged)
3322 : : return purged;
3323 : :
3324 : 138576 : if (dump_file)
3325 : 0 : fprintf (dump_file, "Purged edges from bb %i\n", bb->index);
3326 : :
3327 : 138576 : if (!optimize)
3328 : : return purged;
3329 : :
3330 : : /* Redistribute probabilities. */
3331 : 138100 : if (single_succ_p (bb))
3332 : : {
3333 : 138100 : single_succ_edge (bb)->probability = profile_probability::always ();
3334 : : }
3335 : : else
3336 : : {
3337 : 0 : note = find_reg_note (insn, REG_BR_PROB, NULL);
3338 : 0 : if (!note)
3339 : : return purged;
3340 : :
3341 : 0 : b = BRANCH_EDGE (bb);
3342 : 0 : f = FALLTHRU_EDGE (bb);
3343 : 0 : b->probability = profile_probability::from_reg_br_prob_note
3344 : 0 : (XINT (note, 0));
3345 : 0 : f->probability = b->probability.invert ();
3346 : : }
3347 : :
3348 : 138100 : return purged;
3349 : : }
3350 : 32149714 : else if (CALL_P (insn) && SIBLING_CALL_P (insn))
3351 : : {
3352 : : /* First, there should not be any EH or ABCALL edges resulting
3353 : : from non-local gotos and the like. If there were, we shouldn't
3354 : : have created the sibcall in the first place. Second, there
3355 : : should of course never have been a fallthru edge. */
3356 : 477308 : gcc_assert (single_succ_p (bb));
3357 : 477308 : gcc_assert (single_succ_edge (bb)->flags
3358 : : == (EDGE_SIBCALL | EDGE_ABNORMAL));
3359 : :
3360 : : return false;
3361 : : }
3362 : :
3363 : : /* If we don't see a jump insn, we don't know exactly why the block would
3364 : : have been broken at this point. Look for a simple, non-fallthru edge,
3365 : : as these are only created by conditional branches. If we find such an
3366 : : edge we know that there used to be a jump here and can then safely
3367 : : remove all non-fallthru edges. */
3368 : 31672406 : found = false;
3369 : 64811578 : FOR_EACH_EDGE (e, ei, bb->succs)
3370 : 33416950 : if (! (e->flags & (EDGE_COMPLEX | EDGE_FALLTHRU)))
3371 : : {
3372 : : found = true;
3373 : : break;
3374 : : }
3375 : :
3376 : 31672406 : if (!found)
3377 : : return purged;
3378 : :
3379 : : /* Remove all but the fake and fallthru edges. The fake edge may be
3380 : : the only successor for this block in the case of noreturn
3381 : : calls. */
3382 : 833466 : for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
3383 : : {
3384 : 555688 : if (!(e->flags & (EDGE_FALLTHRU | EDGE_FAKE)))
3385 : : {
3386 : 277910 : df_set_bb_dirty (bb);
3387 : 277910 : remove_edge (e);
3388 : 277910 : purged = true;
3389 : : }
3390 : : else
3391 : 277778 : ei_next (&ei);
3392 : : }
3393 : :
3394 : 277778 : gcc_assert (single_succ_p (bb));
3395 : :
3396 : 277778 : single_succ_edge (bb)->probability = profile_probability::always ();
3397 : :
3398 : 277778 : if (dump_file)
3399 : 1 : fprintf (dump_file, "Purged non-fallthru edges from bb %i\n",
3400 : : bb->index);
3401 : : return purged;
3402 : : }
3403 : :
3404 : : /* Search all basic blocks for potentially dead edges and purge them. Return
3405 : : true if some edge has been eliminated. */
3406 : :
3407 : : bool
3408 : 3205605 : purge_all_dead_edges (void)
3409 : : {
3410 : 3205605 : bool purged = false;
3411 : 3205605 : basic_block bb;
3412 : :
3413 : 45094767 : FOR_EACH_BB_FN (bb, cfun)
3414 : 41889162 : if (purge_dead_edges (bb))
3415 : 2334 : purged = true;
3416 : :
3417 : 3205605 : return purged;
3418 : : }
3419 : :
3420 : : /* This is used by a few passes that emit some instructions after abnormal
3421 : : calls, moving the basic block's end, while they in fact do want to emit
3422 : : them on the fallthru edge. Look for abnormal call edges, find backward
3423 : : the call in the block and insert the instructions on the edge instead.
3424 : :
3425 : : Similarly, handle instructions throwing exceptions internally.
3426 : :
3427 : : Return true when instructions have been found and inserted on edges. */
3428 : :
3429 : : bool
3430 : 1465675 : fixup_abnormal_edges (void)
3431 : : {
3432 : 1465675 : bool inserted = false;
3433 : 1465675 : basic_block bb;
3434 : :
3435 : 16299703 : FOR_EACH_BB_FN (bb, cfun)
3436 : : {
3437 : 14834028 : edge e;
3438 : 14834028 : edge_iterator ei;
3439 : :
3440 : : /* Look for cases we are interested in - calls or instructions causing
3441 : : exceptions. */
3442 : 34902881 : FOR_EACH_EDGE (e, ei, bb->succs)
3443 : 20738031 : if ((e->flags & EDGE_ABNORMAL_CALL)
3444 : 20182265 : || ((e->flags & (EDGE_ABNORMAL | EDGE_EH))
3445 : : == (EDGE_ABNORMAL | EDGE_EH)))
3446 : : break;
3447 : :
3448 : 14834028 : if (e && !CALL_P (BB_END (bb)) && !can_throw_internal (BB_END (bb)))
3449 : : {
3450 : 10460 : rtx_insn *insn;
3451 : :
3452 : : /* Get past the new insns generated. Allow notes, as the insns
3453 : : may be already deleted. */
3454 : 10460 : insn = BB_END (bb);
3455 : 17947 : while ((NONJUMP_INSN_P (insn) || NOTE_P (insn))
3456 : 16784 : && !can_throw_internal (insn)
3457 : 32323 : && insn != BB_HEAD (bb))
3458 : 9270 : insn = PREV_INSN (insn);
3459 : :
3460 : 10460 : if (CALL_P (insn) || can_throw_internal (insn))
3461 : : {
3462 : 7129 : rtx_insn *stop, *next;
3463 : :
3464 : 7129 : e = find_fallthru_edge (bb->succs);
3465 : :
3466 : 7129 : stop = NEXT_INSN (BB_END (bb));
3467 : 7129 : BB_END (bb) = insn;
3468 : :
3469 : 23338 : for (insn = NEXT_INSN (insn); insn != stop; insn = next)
3470 : : {
3471 : 9080 : next = NEXT_INSN (insn);
3472 : 9080 : if (INSN_P (insn))
3473 : : {
3474 : 7909 : delete_insn (insn);
3475 : :
3476 : : /* Sometimes there's still the return value USE.
3477 : : If it's placed after a trapping call (i.e. that
3478 : : call is the last insn anyway), we have no fallthru
3479 : : edge. Simply delete this use and don't try to insert
3480 : : on the non-existent edge.
3481 : : Similarly, sometimes a call that can throw is
3482 : : followed in the source with __builtin_unreachable (),
3483 : : meaning that there is UB if the call returns rather
3484 : : than throws. If there weren't any instructions
3485 : : following such calls before, supposedly even the ones
3486 : : we've deleted aren't significant and can be
3487 : : removed. */
3488 : 7909 : if (e)
3489 : : {
3490 : : /* We're not deleting it, we're moving it. */
3491 : 7908 : insn->set_undeleted ();
3492 : 7908 : SET_PREV_INSN (insn) = NULL_RTX;
3493 : 7908 : SET_NEXT_INSN (insn) = NULL_RTX;
3494 : :
3495 : 7908 : insert_insn_on_edge (insn, e);
3496 : 7908 : inserted = true;
3497 : : }
3498 : : }
3499 : 1171 : else if (!BARRIER_P (insn))
3500 : 1171 : set_block_for_insn (insn, NULL);
3501 : : }
3502 : : }
3503 : :
3504 : : /* It may be that we don't find any trapping insn. In this
3505 : : case we discovered quite late that the insn that had been
3506 : : marked as can_throw_internal in fact couldn't trap at all.
3507 : : So we should in fact delete the EH edges out of the block. */
3508 : : else
3509 : 3331 : purge_dead_edges (bb);
3510 : : }
3511 : : }
3512 : :
3513 : 1465675 : return inserted;
3514 : : }
3515 : :
3516 : : /* Delete the unconditional jump INSN and adjust the CFG correspondingly.
3517 : : Note that the INSN should be deleted *after* removing dead edges, so
3518 : : that the kept edge is the fallthrough edge for a (set (pc) (pc))
3519 : : but not for a (set (pc) (label_ref FOO)). */
3520 : :
3521 : : void
3522 : 4319 : update_cfg_for_uncondjump (rtx_insn *insn)
3523 : : {
3524 : 4319 : basic_block bb = BLOCK_FOR_INSN (insn);
3525 : 4319 : gcc_assert (BB_END (bb) == insn);
3526 : :
3527 : 4319 : purge_dead_edges (bb);
3528 : :
3529 : 4319 : if (current_ir_type () != IR_RTL_CFGLAYOUT)
3530 : : {
3531 : 5 : if (!find_fallthru_edge (bb->succs))
3532 : : {
3533 : 5 : auto barrier = next_nonnote_nondebug_insn (insn);
3534 : 5 : if (!barrier || !BARRIER_P (barrier))
3535 : 5 : emit_barrier_after (insn);
3536 : : }
3537 : 5 : return;
3538 : : }
3539 : :
3540 : 4314 : delete_insn (insn);
3541 : 4314 : if (EDGE_COUNT (bb->succs) == 1)
3542 : : {
3543 : 2257 : rtx_insn *insn;
3544 : :
3545 : 2257 : single_succ_edge (bb)->flags |= EDGE_FALLTHRU;
3546 : :
3547 : : /* Remove barriers from the footer if there are any. */
3548 : 2258 : for (insn = BB_FOOTER (bb); insn; insn = NEXT_INSN (insn))
3549 : 1 : if (BARRIER_P (insn))
3550 : : {
3551 : 1 : if (PREV_INSN (insn))
3552 : 0 : SET_NEXT_INSN (PREV_INSN (insn)) = NEXT_INSN (insn);
3553 : : else
3554 : 1 : BB_FOOTER (bb) = NEXT_INSN (insn);
3555 : 1 : if (NEXT_INSN (insn))
3556 : 0 : SET_PREV_INSN (NEXT_INSN (insn)) = PREV_INSN (insn);
3557 : : }
3558 : 0 : else if (LABEL_P (insn))
3559 : : break;
3560 : : }
3561 : : }
3562 : :
3563 : : /* Cut the insns from FIRST to LAST out of the insns stream. */
3564 : :
3565 : : rtx_insn *
3566 : 11425569 : unlink_insn_chain (rtx_insn *first, rtx_insn *last)
3567 : : {
3568 : 11425569 : rtx_insn *prevfirst = PREV_INSN (first);
3569 : 11425569 : rtx_insn *nextlast = NEXT_INSN (last);
3570 : :
3571 : 11425569 : SET_PREV_INSN (first) = NULL;
3572 : 11425569 : SET_NEXT_INSN (last) = NULL;
3573 : 11425569 : if (prevfirst)
3574 : 8990606 : SET_NEXT_INSN (prevfirst) = nextlast;
3575 : 11425569 : if (nextlast)
3576 : 10023123 : SET_PREV_INSN (nextlast) = prevfirst;
3577 : : else
3578 : 1402446 : set_last_insn (prevfirst);
3579 : 11425569 : if (!prevfirst)
3580 : 2434963 : set_first_insn (nextlast);
3581 : 11425569 : return first;
3582 : : }
3583 : :
3584 : : /* Skip over inter-block insns occurring after BB which are typically
3585 : : associated with BB (e.g., barriers). If there are any such insns,
3586 : : we return the last one. Otherwise, we return the end of BB. */
3587 : :
3588 : : static rtx_insn *
3589 : 24920699 : skip_insns_after_block (basic_block bb)
3590 : : {
3591 : 24920699 : rtx_insn *insn, *last_insn, *next_head, *prev;
3592 : :
3593 : 24920699 : next_head = NULL;
3594 : 24920699 : if (bb->next_bb != EXIT_BLOCK_PTR_FOR_FN (cfun))
3595 : 22485733 : next_head = BB_HEAD (bb->next_bb);
3596 : :
3597 : 33275427 : for (last_insn = insn = BB_END (bb); (insn = NEXT_INSN (insn)) != 0; )
3598 : : {
3599 : 30840461 : if (insn == next_head)
3600 : : break;
3601 : :
3602 : 8354728 : switch (GET_CODE (insn))
3603 : : {
3604 : 7310920 : case BARRIER:
3605 : 7310920 : last_insn = insn;
3606 : 7310920 : continue;
3607 : :
3608 : 1030764 : case NOTE:
3609 : 1030764 : gcc_assert (NOTE_KIND (insn) != NOTE_INSN_BLOCK_END);
3610 : 1030764 : continue;
3611 : :
3612 : 13044 : case CODE_LABEL:
3613 : 13044 : if (NEXT_INSN (insn)
3614 : 13044 : && JUMP_TABLE_DATA_P (NEXT_INSN (insn)))
3615 : : {
3616 : 13044 : insn = NEXT_INSN (insn);
3617 : 13044 : last_insn = insn;
3618 : 13044 : continue;
3619 : : }
3620 : : break;
3621 : :
3622 : : default:
3623 : : break;
3624 : : }
3625 : :
3626 : : break;
3627 : : }
3628 : :
3629 : : /* It is possible to hit contradictory sequence. For instance:
3630 : :
3631 : : jump_insn
3632 : : NOTE_INSN_BLOCK_BEG
3633 : : barrier
3634 : :
3635 : : Where barrier belongs to jump_insn, but the note does not. This can be
3636 : : created by removing the basic block originally following
3637 : : NOTE_INSN_BLOCK_BEG. In such case reorder the notes. */
3638 : :
3639 : 32257850 : for (insn = last_insn; insn != BB_END (bb); insn = prev)
3640 : : {
3641 : 7337151 : prev = PREV_INSN (insn);
3642 : 7337151 : if (NOTE_P (insn))
3643 : 143 : switch (NOTE_KIND (insn))
3644 : : {
3645 : 0 : case NOTE_INSN_BLOCK_END:
3646 : 0 : gcc_unreachable ();
3647 : 143 : break;
3648 : 143 : case NOTE_INSN_DELETED:
3649 : 143 : case NOTE_INSN_DELETED_LABEL:
3650 : 143 : case NOTE_INSN_DELETED_DEBUG_LABEL:
3651 : 143 : continue;
3652 : 0 : default:
3653 : 0 : reorder_insns (insn, insn, last_insn);
3654 : : }
3655 : : }
3656 : :
3657 : 24920699 : return last_insn;
3658 : : }
3659 : :
3660 : : /* Locate or create a label for a given basic block. */
3661 : :
3662 : : static rtx_insn *
3663 : 2132648 : label_for_bb (basic_block bb)
3664 : : {
3665 : 2132648 : rtx_insn *label = BB_HEAD (bb);
3666 : :
3667 : 2132648 : if (!LABEL_P (label))
3668 : : {
3669 : 1333511 : if (dump_file)
3670 : 10 : fprintf (dump_file, "Emitting label for block %d\n", bb->index);
3671 : :
3672 : 1333511 : label = block_label (bb);
3673 : : }
3674 : :
3675 : 2132648 : return label;
3676 : : }
3677 : :
3678 : : /* Locate the effective beginning and end of the insn chain for each
3679 : : block, as defined by skip_insns_after_block above. */
3680 : :
3681 : : static void
3682 : 2434966 : record_effective_endpoints (void)
3683 : : {
3684 : 2434966 : rtx_insn *next_insn;
3685 : 2434966 : basic_block bb;
3686 : 2434966 : rtx_insn *insn;
3687 : :
3688 : 2434966 : for (insn = get_insns ();
3689 : : insn
3690 : 4872428 : && NOTE_P (insn)
3691 : 9743804 : && NOTE_KIND (insn) != NOTE_INSN_BASIC_BLOCK;
3692 : 2437462 : insn = NEXT_INSN (insn))
3693 : 2437462 : continue;
3694 : : /* No basic blocks at all? */
3695 : 2434966 : gcc_assert (insn);
3696 : :
3697 : 2434966 : if (PREV_INSN (insn))
3698 : 2434963 : cfg_layout_function_header =
3699 : 2434963 : unlink_insn_chain (get_insns (), PREV_INSN (insn));
3700 : : else
3701 : 3 : cfg_layout_function_header = NULL;
3702 : :
3703 : 2434966 : next_insn = get_insns ();
3704 : 27355665 : FOR_EACH_BB_FN (bb, cfun)
3705 : : {
3706 : 24920699 : rtx_insn *end;
3707 : :
3708 : 24920699 : if (PREV_INSN (BB_HEAD (bb)) && next_insn != BB_HEAD (bb))
3709 : 41479 : BB_HEADER (bb) = unlink_insn_chain (next_insn,
3710 : 41479 : PREV_INSN (BB_HEAD (bb)));
3711 : 24920699 : end = skip_insns_after_block (bb);
3712 : 24920699 : if (NEXT_INSN (BB_END (bb)) && BB_END (bb) != end)
3713 : 7262862 : BB_FOOTER (bb) = unlink_insn_chain (NEXT_INSN (BB_END (bb)), end);
3714 : 24920699 : next_insn = NEXT_INSN (BB_END (bb));
3715 : : }
3716 : :
3717 : 2434966 : cfg_layout_function_footer = next_insn;
3718 : 2434966 : if (cfg_layout_function_footer)
3719 : 980781 : cfg_layout_function_footer = unlink_insn_chain (cfg_layout_function_footer, get_last_insn ());
3720 : 2437462 : }
3721 : :
3722 : : namespace {
3723 : :
3724 : : const pass_data pass_data_into_cfg_layout_mode =
3725 : : {
3726 : : RTL_PASS, /* type */
3727 : : "into_cfglayout", /* name */
3728 : : OPTGROUP_NONE, /* optinfo_flags */
3729 : : TV_CFG, /* tv_id */
3730 : : 0, /* properties_required */
3731 : : PROP_cfglayout, /* properties_provided */
3732 : : 0, /* properties_destroyed */
3733 : : 0, /* todo_flags_start */
3734 : : 0, /* todo_flags_finish */
3735 : : };
3736 : :
3737 : : class pass_into_cfg_layout_mode : public rtl_opt_pass
3738 : : {
3739 : : public:
3740 : 282866 : pass_into_cfg_layout_mode (gcc::context *ctxt)
3741 : 565732 : : rtl_opt_pass (pass_data_into_cfg_layout_mode, ctxt)
3742 : : {}
3743 : :
3744 : : /* opt_pass methods: */
3745 : 1431619 : unsigned int execute (function *) final override
3746 : : {
3747 : 1431619 : cfg_layout_initialize (0);
3748 : 1431619 : return 0;
3749 : : }
3750 : :
3751 : : }; // class pass_into_cfg_layout_mode
3752 : :
3753 : : } // anon namespace
3754 : :
3755 : : rtl_opt_pass *
3756 : 282866 : make_pass_into_cfg_layout_mode (gcc::context *ctxt)
3757 : : {
3758 : 282866 : return new pass_into_cfg_layout_mode (ctxt);
3759 : : }
3760 : :
3761 : : namespace {
3762 : :
3763 : : const pass_data pass_data_outof_cfg_layout_mode =
3764 : : {
3765 : : RTL_PASS, /* type */
3766 : : "outof_cfglayout", /* name */
3767 : : OPTGROUP_NONE, /* optinfo_flags */
3768 : : TV_CFG, /* tv_id */
3769 : : 0, /* properties_required */
3770 : : 0, /* properties_provided */
3771 : : PROP_cfglayout, /* properties_destroyed */
3772 : : 0, /* todo_flags_start */
3773 : : 0, /* todo_flags_finish */
3774 : : };
3775 : :
3776 : : class pass_outof_cfg_layout_mode : public rtl_opt_pass
3777 : : {
3778 : : public:
3779 : 282866 : pass_outof_cfg_layout_mode (gcc::context *ctxt)
3780 : 565732 : : rtl_opt_pass (pass_data_outof_cfg_layout_mode, ctxt)
3781 : : {}
3782 : :
3783 : : /* opt_pass methods: */
3784 : : unsigned int execute (function *) final override;
3785 : :
3786 : : }; // class pass_outof_cfg_layout_mode
3787 : :
3788 : : unsigned int
3789 : 1431620 : pass_outof_cfg_layout_mode::execute (function *fun)
3790 : : {
3791 : 1431620 : basic_block bb;
3792 : :
3793 : 14203965 : FOR_EACH_BB_FN (bb, fun)
3794 : 12772345 : if (bb->next_bb != EXIT_BLOCK_PTR_FOR_FN (fun))
3795 : 11340725 : bb->aux = bb->next_bb;
3796 : :
3797 : 1431620 : cfg_layout_finalize ();
3798 : :
3799 : 1431620 : return 0;
3800 : : }
3801 : :
3802 : : } // anon namespace
3803 : :
3804 : : rtl_opt_pass *
3805 : 282866 : make_pass_outof_cfg_layout_mode (gcc::context *ctxt)
3806 : : {
3807 : 282866 : return new pass_outof_cfg_layout_mode (ctxt);
3808 : : }
3809 : :
3810 : :
3811 : : /* Link the basic blocks in the correct order, compacting the basic
3812 : : block queue while at it. If STAY_IN_CFGLAYOUT_MODE is false, this
3813 : : function also clears the basic block header and footer fields.
3814 : :
3815 : : This function is usually called after a pass (e.g. tracer) finishes
3816 : : some transformations while in cfglayout mode. The required sequence
3817 : : of the basic blocks is in a linked list along the bb->aux field.
3818 : : This functions re-links the basic block prev_bb and next_bb pointers
3819 : : accordingly, and it compacts and renumbers the blocks.
3820 : :
3821 : : FIXME: This currently works only for RTL, but the only RTL-specific
3822 : : bits are the STAY_IN_CFGLAYOUT_MODE bits. The tracer pass was moved
3823 : : to GIMPLE a long time ago, but it doesn't relink the basic block
3824 : : chain. It could do that (to give better initial RTL) if this function
3825 : : is made IR-agnostic (and moved to cfganal.cc or cfg.cc while at it). */
3826 : :
3827 : : void
3828 : 3047690 : relink_block_chain (bool stay_in_cfglayout_mode)
3829 : : {
3830 : 3047690 : basic_block bb, prev_bb;
3831 : 3047690 : int index;
3832 : :
3833 : : /* Maybe dump the re-ordered sequence. */
3834 : 3047690 : if (dump_file)
3835 : : {
3836 : 168 : fprintf (dump_file, "Reordered sequence:\n");
3837 : 168 : for (bb = ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb, index =
3838 : : NUM_FIXED_BLOCKS;
3839 : 1116 : bb;
3840 : 948 : bb = (basic_block) bb->aux, index++)
3841 : : {
3842 : 948 : fprintf (dump_file, " %i ", index);
3843 : 948 : if (get_bb_original (bb))
3844 : 28 : fprintf (dump_file, "duplicate of %i\n",
3845 : 28 : get_bb_original (bb)->index);
3846 : 920 : else if (forwarder_block_p (bb)
3847 : 920 : && !LABEL_P (BB_HEAD (bb)))
3848 : 17 : fprintf (dump_file, "compensation\n");
3849 : : else
3850 : 903 : fprintf (dump_file, "bb %i\n", bb->index);
3851 : : }
3852 : : }
3853 : :
3854 : : /* Now reorder the blocks. */
3855 : 3047690 : prev_bb = ENTRY_BLOCK_PTR_FOR_FN (cfun);
3856 : 3047690 : bb = ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb;
3857 : 36302818 : for (; bb; prev_bb = bb, bb = (basic_block) bb->aux)
3858 : : {
3859 : 33255128 : bb->prev_bb = prev_bb;
3860 : 33255128 : prev_bb->next_bb = bb;
3861 : : }
3862 : 3047690 : prev_bb->next_bb = EXIT_BLOCK_PTR_FOR_FN (cfun);
3863 : 3047690 : EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb = prev_bb;
3864 : :
3865 : : /* Then, clean up the aux fields. */
3866 : 42398198 : FOR_ALL_BB_FN (bb, cfun)
3867 : : {
3868 : 39350508 : bb->aux = NULL;
3869 : 39350508 : if (!stay_in_cfglayout_mode)
3870 : 28318793 : BB_HEADER (bb) = BB_FOOTER (bb) = NULL;
3871 : : }
3872 : :
3873 : : /* Maybe reset the original copy tables, they are not valid anymore
3874 : : when we renumber the basic blocks in compact_blocks. If we are
3875 : : are going out of cfglayout mode, don't re-allocate the tables. */
3876 : 3047690 : if (original_copy_tables_initialized_p ())
3877 : 3047689 : free_original_copy_tables ();
3878 : 3047690 : if (stay_in_cfglayout_mode)
3879 : 612723 : initialize_original_copy_tables ();
3880 : :
3881 : : /* Finally, put basic_block_info in the new order. */
3882 : 3047690 : compact_blocks ();
3883 : 3047690 : }
3884 : :
3885 : :
3886 : : /* Given a reorder chain, rearrange the code to match. */
3887 : :
3888 : : static void
3889 : 2434967 : fixup_reorder_chain (void)
3890 : : {
3891 : 2434967 : basic_block bb;
3892 : 2434967 : rtx_insn *insn = NULL;
3893 : :
3894 : 2434967 : if (cfg_layout_function_header)
3895 : : {
3896 : 2434963 : set_first_insn (cfg_layout_function_header);
3897 : 2434963 : insn = cfg_layout_function_header;
3898 : 2437462 : while (NEXT_INSN (insn))
3899 : : insn = NEXT_INSN (insn);
3900 : : }
3901 : :
3902 : : /* First do the bulk reordering -- rechain the blocks without regard to
3903 : : the needed changes to jumps and labels. */
3904 : :
3905 : 25139354 : for (bb = ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb; bb; bb = (basic_block)
3906 : : bb->aux)
3907 : : {
3908 : 22704387 : if (BB_HEADER (bb))
3909 : : {
3910 : 40579 : if (insn)
3911 : 40579 : SET_NEXT_INSN (insn) = BB_HEADER (bb);
3912 : : else
3913 : 0 : set_first_insn (BB_HEADER (bb));
3914 : 40579 : SET_PREV_INSN (BB_HEADER (bb)) = insn;
3915 : 40579 : insn = BB_HEADER (bb);
3916 : 48564 : while (NEXT_INSN (insn))
3917 : : insn = NEXT_INSN (insn);
3918 : : }
3919 : 22704387 : if (insn)
3920 : 22704383 : SET_NEXT_INSN (insn) = BB_HEAD (bb);
3921 : : else
3922 : 4 : set_first_insn (BB_HEAD (bb));
3923 : 22704387 : SET_PREV_INSN (BB_HEAD (bb)) = insn;
3924 : 22704387 : insn = BB_END (bb);
3925 : 22704387 : if (BB_FOOTER (bb))
3926 : : {
3927 : 2853577 : SET_NEXT_INSN (insn) = BB_FOOTER (bb);
3928 : 2853577 : SET_PREV_INSN (BB_FOOTER (bb)) = insn;
3929 : 5749114 : while (NEXT_INSN (insn))
3930 : : insn = NEXT_INSN (insn);
3931 : : }
3932 : : }
3933 : :
3934 : 2434967 : SET_NEXT_INSN (insn) = cfg_layout_function_footer;
3935 : 2434967 : if (cfg_layout_function_footer)
3936 : 980788 : SET_PREV_INSN (cfg_layout_function_footer) = insn;
3937 : :
3938 : 3416410 : while (NEXT_INSN (insn))
3939 : : insn = NEXT_INSN (insn);
3940 : :
3941 : 2434967 : set_last_insn (insn);
3942 : 2434967 : if (flag_checking)
3943 : 2434929 : verify_insn_chain ();
3944 : :
3945 : : /* Now add jumps and labels as needed to match the blocks new
3946 : : outgoing edges. */
3947 : :
3948 : 2434967 : bool remove_unreachable_blocks = false;
3949 : 25139354 : for (bb = ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb; bb ; bb = (basic_block)
3950 : : bb->aux)
3951 : : {
3952 : 22704387 : edge e_fall, e_taken, e;
3953 : 22704387 : rtx_insn *bb_end_insn;
3954 : 22704387 : rtx ret_label = NULL_RTX;
3955 : 22704387 : basic_block nb;
3956 : 22704387 : edge_iterator ei;
3957 : 22704387 : bool asm_goto = false;
3958 : :
3959 : 22704387 : if (EDGE_COUNT (bb->succs) == 0)
3960 : 18878139 : continue;
3961 : :
3962 : : /* Find the old fallthru edge, and another non-EH edge for
3963 : : a taken jump. */
3964 : 21499234 : e_taken = e_fall = NULL;
3965 : :
3966 : 54813328 : FOR_EACH_EDGE (e, ei, bb->succs)
3967 : 33314094 : if (e->flags & EDGE_FALLTHRU)
3968 : : e_fall = e;
3969 : 13462355 : else if (! (e->flags & EDGE_EH))
3970 : 12219649 : e_taken = e;
3971 : :
3972 : 21499234 : bb_end_insn = BB_END (bb);
3973 : 21499234 : if (rtx_jump_insn *bb_end_jump = dyn_cast <rtx_jump_insn *> (bb_end_insn))
3974 : : {
3975 : 11811004 : ret_label = JUMP_LABEL (bb_end_jump);
3976 : 11811004 : if (any_condjump_p (bb_end_jump))
3977 : : {
3978 : : /* This might happen if the conditional jump has side
3979 : : effects and could therefore not be optimized away.
3980 : : Make the basic block to end with a barrier in order
3981 : : to prevent rtl_verify_flow_info from complaining. */
3982 : 10499989 : if (!e_fall)
3983 : : {
3984 : 0 : gcc_assert (!onlyjump_p (bb_end_jump)
3985 : : || returnjump_p (bb_end_jump)
3986 : : || (e_taken->flags & EDGE_CROSSING));
3987 : 0 : emit_barrier_after (bb_end_jump);
3988 : 0 : continue;
3989 : : }
3990 : :
3991 : : /* If the old fallthru is still next, nothing to do. */
3992 : 10499989 : if (bb->aux == e_fall->dest
3993 : 2584712 : || e_fall->dest == EXIT_BLOCK_PTR_FOR_FN (cfun))
3994 : 7915289 : continue;
3995 : :
3996 : : /* The degenerated case of conditional jump jumping to the next
3997 : : instruction can happen for jumps with side effects. We need
3998 : : to construct a forwarder block and this will be done just
3999 : : fine by force_nonfallthru below. */
4000 : 2584700 : if (!e_taken)
4001 : : ;
4002 : :
4003 : : /* There is another special case: if *neither* block is next,
4004 : : such as happens at the very end of a function, then we'll
4005 : : need to add a new unconditional jump. Choose the taken
4006 : : edge based on known or assumed probability. */
4007 : 2584700 : else if (bb->aux != e_taken->dest)
4008 : : {
4009 : 587794 : rtx note = find_reg_note (bb_end_jump, REG_BR_PROB, 0);
4010 : :
4011 : 587794 : if (note
4012 : : && profile_probability::from_reg_br_prob_note
4013 : 558784 : (XINT (note, 0)) < profile_probability::even ()
4014 : 782426 : && invert_jump (bb_end_jump,
4015 : 194632 : (e_fall->dest
4016 : 194632 : == EXIT_BLOCK_PTR_FOR_FN (cfun)
4017 : : ? NULL_RTX
4018 : 194632 : : label_for_bb (e_fall->dest)), 0))
4019 : : {
4020 : 194632 : e_fall->flags &= ~EDGE_FALLTHRU;
4021 : 194632 : gcc_checking_assert (could_fall_through
4022 : : (e_taken->src, e_taken->dest));
4023 : 194632 : e_taken->flags |= EDGE_FALLTHRU;
4024 : 194632 : update_br_prob_note (bb);
4025 : 194632 : e = e_fall, e_fall = e_taken, e_taken = e;
4026 : : }
4027 : : }
4028 : :
4029 : : /* If the "jumping" edge is a crossing edge, and the fall
4030 : : through edge is non-crossing, leave things as they are. */
4031 : 1996906 : else if ((e_taken->flags & EDGE_CROSSING)
4032 : 58890 : && !(e_fall->flags & EDGE_CROSSING))
4033 : 58890 : continue;
4034 : :
4035 : : /* Otherwise we can try to invert the jump. This will
4036 : : basically never fail, however, keep up the pretense. */
4037 : 1938016 : else if (invert_jump (bb_end_jump,
4038 : : (e_fall->dest
4039 : : == EXIT_BLOCK_PTR_FOR_FN (cfun)
4040 : : ? NULL_RTX
4041 : 1938016 : : label_for_bb (e_fall->dest)), 0))
4042 : : {
4043 : 1938016 : e_fall->flags &= ~EDGE_FALLTHRU;
4044 : 1938016 : gcc_checking_assert (could_fall_through
4045 : : (e_taken->src, e_taken->dest));
4046 : 1938016 : e_taken->flags |= EDGE_FALLTHRU;
4047 : 1938016 : update_br_prob_note (bb);
4048 : 1938016 : if (LABEL_NUSES (ret_label) == 0
4049 : 1938016 : && single_pred_p (e_taken->dest))
4050 : 1197636 : delete_insn (as_a<rtx_insn *> (ret_label));
4051 : 1938016 : continue;
4052 : : }
4053 : : }
4054 : 1311015 : else if (extract_asm_operands (PATTERN (bb_end_insn)) != NULL)
4055 : : {
4056 : : /* If the old fallthru is still next or if
4057 : : asm goto doesn't have a fallthru (e.g. when followed by
4058 : : __builtin_unreachable ()), nothing to do. */
4059 : 867 : if (! e_fall
4060 : 801 : || bb->aux == e_fall->dest
4061 : 71 : || e_fall->dest == EXIT_BLOCK_PTR_FOR_FN (cfun))
4062 : 796 : continue;
4063 : :
4064 : : /* Otherwise we'll have to use the fallthru fixup below.
4065 : : But avoid redirecting asm goto to EXIT. */
4066 : : asm_goto = true;
4067 : : }
4068 : : else
4069 : : {
4070 : : /* Otherwise we have some return, switch or computed
4071 : : jump. In the 99% case, there should not have been a
4072 : : fallthru edge. */
4073 : 1310148 : gcc_assert (returnjump_p (bb_end_insn) || !e_fall);
4074 : 1310148 : continue;
4075 : : }
4076 : : }
4077 : : else
4078 : : {
4079 : : /* No fallthru implies a noreturn function with EH edges, or
4080 : : something similarly bizarre. In any case, we don't need to
4081 : : do anything. */
4082 : 9688230 : if (! e_fall)
4083 : 337281 : continue;
4084 : :
4085 : : /* If the fallthru block is still next, nothing to do. */
4086 : 9350949 : if (bb->aux == e_fall->dest)
4087 : 4776854 : continue;
4088 : :
4089 : : /* A fallthru to exit block. */
4090 : 4574095 : if (e_fall->dest == EXIT_BLOCK_PTR_FOR_FN (cfun))
4091 : 1335712 : continue;
4092 : : }
4093 : :
4094 : : /* If E_FALL->dest is just a return block, then we can emit a
4095 : : return rather than a jump to the return block. */
4096 : 587794 : rtx_insn *ret, *use;
4097 : 587794 : basic_block dest;
4098 : 587794 : if (!asm_goto
4099 : 3826177 : && bb_is_just_return (e_fall->dest, &ret, &use)
4100 : 538 : && ((PATTERN (ret) == simple_return_rtx && targetm.have_simple_return ())
4101 : 0 : || (PATTERN (ret) == ret_rtx && targetm.have_return ())))
4102 : : {
4103 : 538 : ret_label = PATTERN (ret);
4104 : 538 : dest = EXIT_BLOCK_PTR_FOR_FN (cfun);
4105 : :
4106 : 538 : e_fall->flags &= ~EDGE_CROSSING;
4107 : : /* E_FALL->dest might become unreachable as a result of
4108 : : replacing the jump with a return. So arrange to remove
4109 : : unreachable blocks. */
4110 : 538 : remove_unreachable_blocks = true;
4111 : : }
4112 : : else
4113 : : {
4114 : 3825710 : dest = e_fall->dest;
4115 : : }
4116 : :
4117 : : /* We got here if we need to add a new jump insn.
4118 : : Note force_nonfallthru can delete E_FALL and thus we have to
4119 : : save E_FALL->src prior to the call to force_nonfallthru. */
4120 : 3826248 : nb = force_nonfallthru_and_redirect (e_fall, dest, ret_label);
4121 : 3826248 : if (nb)
4122 : : {
4123 : 744472 : nb->aux = bb->aux;
4124 : 744472 : bb->aux = nb;
4125 : : /* Don't process this new block. */
4126 : 744472 : bb = nb;
4127 : : }
4128 : : }
4129 : :
4130 : 2434967 : relink_block_chain (/*stay_in_cfglayout_mode=*/false);
4131 : :
4132 : : /* Annoying special case - jump around dead jumptables left in the code. */
4133 : 25942716 : FOR_EACH_BB_FN (bb, cfun)
4134 : : {
4135 : 23507749 : edge e = find_fallthru_edge (bb->succs);
4136 : :
4137 : 23507749 : if (e && !can_fallthru (e->src, e->dest))
4138 : 58890 : force_nonfallthru (e);
4139 : : }
4140 : :
4141 : : /* Ensure goto_locus from edges has some instructions with that locus in RTL
4142 : : when not optimizing. */
4143 : 2434967 : if (!optimize && !DECL_IGNORED_P (current_function_decl))
4144 : 3799298 : FOR_EACH_BB_FN (bb, cfun)
4145 : : {
4146 : 3372918 : edge e;
4147 : 3372918 : edge_iterator ei;
4148 : :
4149 : 8023887 : FOR_EACH_EDGE (e, ei, bb->succs)
4150 : 4650969 : if (LOCATION_LOCUS (e->goto_locus) != UNKNOWN_LOCATION
4151 : 4650969 : && !(e->flags & EDGE_ABNORMAL))
4152 : : {
4153 : 706624 : edge e2;
4154 : 706624 : edge_iterator ei2;
4155 : 706624 : basic_block dest, nb;
4156 : 706624 : rtx_insn *end;
4157 : :
4158 : 706624 : insn = BB_END (e->src);
4159 : 706624 : end = PREV_INSN (BB_HEAD (e->src));
4160 : 706624 : while (insn != end
4161 : 861590 : && (!NONDEBUG_INSN_P (insn) || !INSN_HAS_LOCATION (insn)))
4162 : 154966 : insn = PREV_INSN (insn);
4163 : 1189587 : if (insn != end
4164 : 706624 : && loc_equal (INSN_LOCATION (insn), e->goto_locus))
4165 : 504043 : continue;
4166 : 223661 : if (simplejump_p (BB_END (e->src))
4167 : 223661 : && !INSN_HAS_LOCATION (BB_END (e->src)))
4168 : : {
4169 : 0 : INSN_LOCATION (BB_END (e->src)) = e->goto_locus;
4170 : 0 : continue;
4171 : : }
4172 : 223661 : dest = e->dest;
4173 : 223661 : if (dest == EXIT_BLOCK_PTR_FOR_FN (cfun))
4174 : : {
4175 : : /* Non-fallthru edges to the exit block cannot be split. */
4176 : 145133 : if (!(e->flags & EDGE_FALLTHRU))
4177 : 0 : continue;
4178 : : }
4179 : : else
4180 : : {
4181 : 78528 : insn = BB_HEAD (dest);
4182 : 78528 : end = NEXT_INSN (BB_END (dest));
4183 : 309955 : while (insn != end && !NONDEBUG_INSN_P (insn))
4184 : 152899 : insn = NEXT_INSN (insn);
4185 : 50614 : if (insn != end && INSN_HAS_LOCATION (insn)
4186 : 127564 : && loc_equal (INSN_LOCATION (insn), e->goto_locus))
4187 : 21080 : continue;
4188 : : }
4189 : 202581 : nb = split_edge (e);
4190 : 202581 : if (!INSN_P (BB_END (nb)))
4191 : 202581 : BB_END (nb) = emit_insn_after_noloc (gen_nop (), BB_END (nb),
4192 : : nb);
4193 : 202581 : INSN_LOCATION (BB_END (nb)) = e->goto_locus;
4194 : :
4195 : : /* If there are other incoming edges to the destination block
4196 : : with the same goto locus, redirect them to the new block as
4197 : : well, this can prevent other such blocks from being created
4198 : : in subsequent iterations of the loop. */
4199 : 462204 : for (ei2 = ei_start (dest->preds); (e2 = ei_safe_edge (ei2)); )
4200 : 259623 : if (LOCATION_LOCUS (e2->goto_locus) != UNKNOWN_LOCATION
4201 : 41748 : && !(e2->flags & (EDGE_ABNORMAL | EDGE_FALLTHRU))
4202 : 301371 : && e->goto_locus == e2->goto_locus)
4203 : 22770 : redirect_edge_and_branch (e2, nb);
4204 : : else
4205 : 236853 : ei_next (&ei2);
4206 : : }
4207 : : }
4208 : :
4209 : : /* Replacing a jump with a return may have exposed an unreachable
4210 : : block. Conditionally remove them if such transformations were
4211 : : made. */
4212 : 2434967 : if (remove_unreachable_blocks)
4213 : 527 : delete_unreachable_blocks ();
4214 : 2434967 : }
4215 : :
4216 : : /* Perform sanity checks on the insn chain.
4217 : : 1. Check that next/prev pointers are consistent in both the forward and
4218 : : reverse direction.
4219 : : 2. Count insns in chain, going both directions, and check if equal.
4220 : : 3. Check that get_last_insn () returns the actual end of chain. */
4221 : :
4222 : : DEBUG_FUNCTION void
4223 : 4869858 : verify_insn_chain (void)
4224 : : {
4225 : 4869858 : rtx_insn *x, *prevx, *nextx;
4226 : 4869858 : int insn_cnt1, insn_cnt2;
4227 : :
4228 : 4869858 : for (prevx = NULL, insn_cnt1 = 1, x = get_insns ();
4229 : 552095900 : x != 0;
4230 : 547226042 : prevx = x, insn_cnt1++, x = NEXT_INSN (x))
4231 : 547226042 : gcc_assert (PREV_INSN (x) == prevx);
4232 : :
4233 : 4869858 : gcc_assert (prevx == get_last_insn ());
4234 : :
4235 : : for (nextx = NULL, insn_cnt2 = 1, x = get_last_insn ();
4236 : 552095900 : x != 0;
4237 : 547226042 : nextx = x, insn_cnt2++, x = PREV_INSN (x))
4238 : 547226042 : gcc_assert (NEXT_INSN (x) == nextx);
4239 : :
4240 : 4869858 : gcc_assert (insn_cnt1 == insn_cnt2);
4241 : 4869858 : }
4242 : :
4243 : : /* If we have assembler epilogues, the block falling through to exit must
4244 : : be the last one in the reordered chain when we reach final. Ensure
4245 : : that this condition is met. */
4246 : : static void
4247 : 0 : fixup_fallthru_exit_predecessor (void)
4248 : : {
4249 : 0 : edge e;
4250 : 0 : basic_block bb = NULL;
4251 : :
4252 : : /* This transformation is not valid before reload, because we might
4253 : : separate a call from the instruction that copies the return
4254 : : value. */
4255 : 0 : gcc_assert (reload_completed);
4256 : :
4257 : 0 : e = find_fallthru_edge (EXIT_BLOCK_PTR_FOR_FN (cfun)->preds);
4258 : 0 : if (e)
4259 : 0 : bb = e->src;
4260 : :
4261 : 0 : if (bb && bb->aux)
4262 : : {
4263 : 0 : basic_block c = ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb;
4264 : :
4265 : : /* If the very first block is the one with the fall-through exit
4266 : : edge, we have to split that block. */
4267 : 0 : if (c == bb)
4268 : : {
4269 : 0 : bb = split_block_after_labels (bb)->dest;
4270 : 0 : bb->aux = c->aux;
4271 : 0 : c->aux = bb;
4272 : 0 : BB_FOOTER (bb) = BB_FOOTER (c);
4273 : 0 : BB_FOOTER (c) = NULL;
4274 : : }
4275 : :
4276 : 0 : while (c->aux != bb)
4277 : : c = (basic_block) c->aux;
4278 : :
4279 : 0 : c->aux = bb->aux;
4280 : 0 : while (c->aux)
4281 : : c = (basic_block) c->aux;
4282 : :
4283 : 0 : c->aux = bb;
4284 : 0 : bb->aux = NULL;
4285 : : }
4286 : 0 : }
4287 : :
4288 : : /* In case there are more than one fallthru predecessors of exit, force that
4289 : : there is only one. */
4290 : :
4291 : : static void
4292 : 2434967 : force_one_exit_fallthru (void)
4293 : : {
4294 : 2434967 : edge e, predecessor = NULL;
4295 : 2434967 : bool more = false;
4296 : 2434967 : edge_iterator ei;
4297 : 2434967 : basic_block forwarder, bb;
4298 : :
4299 : 5159122 : FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR_FOR_FN (cfun)->preds)
4300 : 2724156 : if (e->flags & EDGE_FALLTHRU)
4301 : : {
4302 : 1335725 : if (predecessor == NULL)
4303 : : predecessor = e;
4304 : : else
4305 : : {
4306 : : more = true;
4307 : : break;
4308 : : }
4309 : : }
4310 : :
4311 : 2434967 : if (!more)
4312 : 2434966 : return;
4313 : :
4314 : : /* Exit has several fallthru predecessors. Create a forwarder block for
4315 : : them. */
4316 : 1 : forwarder = split_edge (predecessor);
4317 : 1 : for (ei = ei_start (EXIT_BLOCK_PTR_FOR_FN (cfun)->preds);
4318 : 3 : (e = ei_safe_edge (ei)); )
4319 : : {
4320 : 2 : if (e->src == forwarder
4321 : 1 : || !(e->flags & EDGE_FALLTHRU))
4322 : 1 : ei_next (&ei);
4323 : : else
4324 : 1 : redirect_edge_and_branch_force (e, forwarder);
4325 : : }
4326 : :
4327 : : /* Fix up the chain of blocks -- make FORWARDER immediately precede the
4328 : : exit block. */
4329 : 5 : FOR_EACH_BB_FN (bb, cfun)
4330 : : {
4331 : 5 : if (bb->aux == NULL && bb != forwarder)
4332 : : {
4333 : 1 : bb->aux = forwarder;
4334 : 1 : break;
4335 : : }
4336 : : }
4337 : : }
4338 : :
4339 : : /* Return true in case it is possible to duplicate the basic block BB. */
4340 : :
4341 : : static bool
4342 : 7658966 : cfg_layout_can_duplicate_bb_p (const_basic_block bb)
4343 : : {
4344 : : /* Do not attempt to duplicate tablejumps, as we need to unshare
4345 : : the dispatch table. This is difficult to do, as the instructions
4346 : : computing jump destination may be hoisted outside the basic block. */
4347 : 7658966 : if (tablejump_p (BB_END (bb), NULL, NULL))
4348 : : return false;
4349 : :
4350 : : /* Do not duplicate blocks containing insns that can't be copied. */
4351 : 7655554 : if (targetm.cannot_copy_insn_p)
4352 : : {
4353 : 0 : rtx_insn *insn = BB_HEAD (bb);
4354 : 0 : while (1)
4355 : : {
4356 : 0 : if (INSN_P (insn) && targetm.cannot_copy_insn_p (insn))
4357 : : return false;
4358 : 0 : if (insn == BB_END (bb))
4359 : : break;
4360 : 0 : insn = NEXT_INSN (insn);
4361 : : }
4362 : : }
4363 : :
4364 : : return true;
4365 : : }
4366 : :
4367 : : rtx_insn *
4368 : 874917 : duplicate_insn_chain (rtx_insn *from, rtx_insn *to,
4369 : : class loop *loop, copy_bb_data *id)
4370 : : {
4371 : 874917 : rtx_insn *insn, *next, *copy;
4372 : 874917 : rtx_note *last;
4373 : :
4374 : : /* Avoid updating of boundaries of previous basic block. The
4375 : : note will get removed from insn stream in fixup. */
4376 : 874917 : last = emit_note (NOTE_INSN_DELETED);
4377 : :
4378 : : /* Create copy at the end of INSN chain. The chain will
4379 : : be reordered later. */
4380 : 5960924 : for (insn = from; insn != NEXT_INSN (to); insn = NEXT_INSN (insn))
4381 : : {
4382 : 5086007 : switch (GET_CODE (insn))
4383 : : {
4384 : 1214373 : case DEBUG_INSN:
4385 : : /* Don't duplicate label debug insns. */
4386 : 1214373 : if (DEBUG_BIND_INSN_P (insn)
4387 : 909953 : && TREE_CODE (INSN_VAR_LOCATION_DECL (insn)) == LABEL_DECL)
4388 : : break;
4389 : : /* FALLTHRU */
4390 : 3363922 : case INSN:
4391 : 3363922 : case CALL_INSN:
4392 : 3363922 : case JUMP_INSN:
4393 : 3363922 : copy = emit_copy_of_insn_after (insn, get_last_insn ());
4394 : 3363922 : if (JUMP_P (insn) && JUMP_LABEL (insn) != NULL_RTX
4395 : 470176 : && ANY_RETURN_P (JUMP_LABEL (insn)))
4396 : 188635 : JUMP_LABEL (copy) = JUMP_LABEL (insn);
4397 : 3363922 : maybe_copy_prologue_epilogue_insn (insn, copy);
4398 : : /* If requested remap dependence info of cliques brought in
4399 : : via inlining. */
4400 : 3363922 : if (id)
4401 : : {
4402 : 1828910 : subrtx_iterator::array_type array;
4403 : 11151239 : FOR_EACH_SUBRTX (iter, array, PATTERN (insn), ALL)
4404 : 9325944 : if (MEM_P (*iter) && MEM_EXPR (*iter))
4405 : : {
4406 : 290491 : tree op = MEM_EXPR (*iter);
4407 : 290491 : if (TREE_CODE (op) == WITH_SIZE_EXPR)
4408 : 0 : op = TREE_OPERAND (op, 0);
4409 : 321110 : while (handled_component_p (op))
4410 : 30619 : op = TREE_OPERAND (op, 0);
4411 : 290491 : if ((TREE_CODE (op) == MEM_REF
4412 : 290491 : || TREE_CODE (op) == TARGET_MEM_REF)
4413 : 273870 : && MR_DEPENDENCE_CLIQUE (op) > 1
4414 : 300695 : && (!loop
4415 : 10204 : || (MR_DEPENDENCE_CLIQUE (op)
4416 : 10204 : != loop->owned_clique)))
4417 : : {
4418 : 1166 : if (!id->dependence_map)
4419 : 553 : id->dependence_map = new hash_map<dependence_hash,
4420 : : unsigned short>;
4421 : 1166 : bool existed;
4422 : 1166 : unsigned short &newc = id->dependence_map->get_or_insert
4423 : 1166 : (MR_DEPENDENCE_CLIQUE (op), &existed);
4424 : 1166 : if (!existed)
4425 : : {
4426 : 579 : gcc_assert
4427 : : (MR_DEPENDENCE_CLIQUE (op) <= cfun->last_clique);
4428 : 1158 : newc = get_new_clique (cfun);
4429 : : }
4430 : : /* We cannot adjust MR_DEPENDENCE_CLIQUE in-place
4431 : : since MEM_EXPR is shared so make a copy and
4432 : : walk to the subtree again. */
4433 : 1166 : tree new_expr = unshare_expr (MEM_EXPR (*iter));
4434 : 1166 : tree orig_new_expr = new_expr;
4435 : 1166 : if (TREE_CODE (new_expr) == WITH_SIZE_EXPR)
4436 : 0 : new_expr = TREE_OPERAND (new_expr, 0);
4437 : 1483 : while (handled_component_p (new_expr))
4438 : 317 : new_expr = TREE_OPERAND (new_expr, 0);
4439 : 1166 : MR_DEPENDENCE_CLIQUE (new_expr) = newc;
4440 : 1166 : set_mem_expr (const_cast <rtx> (*iter), orig_new_expr);
4441 : : }
4442 : : }
4443 : 1828910 : }
4444 : : break;
4445 : :
4446 : 0 : case JUMP_TABLE_DATA:
4447 : : /* Avoid copying of dispatch tables. We never duplicate
4448 : : tablejumps, so this can hit only in case the table got
4449 : : moved far from original jump.
4450 : : Avoid copying following barrier as well if any
4451 : : (and debug insns in between). */
4452 : 0 : for (next = NEXT_INSN (insn);
4453 : 0 : next != NEXT_INSN (to);
4454 : 0 : next = NEXT_INSN (next))
4455 : 0 : if (!DEBUG_INSN_P (next))
4456 : : break;
4457 : 0 : if (next != NEXT_INSN (to) && BARRIER_P (next))
4458 : 5086007 : insn = next;
4459 : : break;
4460 : :
4461 : : case CODE_LABEL:
4462 : : break;
4463 : :
4464 : 189929 : case BARRIER:
4465 : 189929 : emit_barrier ();
4466 : 189929 : break;
4467 : :
4468 : 910754 : case NOTE:
4469 : 910754 : switch (NOTE_KIND (insn))
4470 : : {
4471 : : /* In case prologue is empty and function contain label
4472 : : in first BB, we may want to copy the block. */
4473 : : case NOTE_INSN_PROLOGUE_END:
4474 : :
4475 : : case NOTE_INSN_DELETED:
4476 : : case NOTE_INSN_DELETED_LABEL:
4477 : : case NOTE_INSN_DELETED_DEBUG_LABEL:
4478 : : /* No problem to strip these. */
4479 : : case NOTE_INSN_FUNCTION_BEG:
4480 : : /* There is always just single entry to function. */
4481 : : case NOTE_INSN_BASIC_BLOCK:
4482 : : /* We should only switch text sections once. */
4483 : : case NOTE_INSN_SWITCH_TEXT_SECTIONS:
4484 : : break;
4485 : :
4486 : 186640 : case NOTE_INSN_EPILOGUE_BEG:
4487 : 186640 : case NOTE_INSN_UPDATE_SJLJ_CONTEXT:
4488 : 186640 : emit_note_copy (as_a <rtx_note *> (insn));
4489 : 186640 : break;
4490 : :
4491 : 0 : default:
4492 : : /* All other notes should have already been eliminated. */
4493 : 0 : gcc_unreachable ();
4494 : : }
4495 : : break;
4496 : 0 : default:
4497 : 0 : gcc_unreachable ();
4498 : : }
4499 : : }
4500 : 874917 : insn = NEXT_INSN (last);
4501 : 874917 : delete_insn (last);
4502 : 874917 : return insn;
4503 : : }
4504 : :
4505 : : /* Create a duplicate of the basic block BB. */
4506 : :
4507 : : static basic_block
4508 : 682942 : cfg_layout_duplicate_bb (basic_block bb, copy_bb_data *id)
4509 : : {
4510 : 682942 : rtx_insn *insn;
4511 : 682942 : basic_block new_bb;
4512 : :
4513 : 682942 : class loop *loop = (id && current_loops) ? bb->loop_father : NULL;
4514 : :
4515 : 682942 : insn = duplicate_insn_chain (BB_HEAD (bb), BB_END (bb), loop, id);
4516 : 682942 : new_bb = create_basic_block (insn,
4517 : : insn ? get_last_insn () : NULL,
4518 : 682942 : EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb);
4519 : :
4520 : 682942 : BB_COPY_PARTITION (new_bb, bb);
4521 : 682942 : if (BB_HEADER (bb))
4522 : : {
4523 : : insn = BB_HEADER (bb);
4524 : 2349 : while (NEXT_INSN (insn))
4525 : : insn = NEXT_INSN (insn);
4526 : 1910 : insn = duplicate_insn_chain (BB_HEADER (bb), insn, loop, id);
4527 : 1910 : if (insn)
4528 : 0 : BB_HEADER (new_bb) = unlink_insn_chain (insn, get_last_insn ());
4529 : : }
4530 : :
4531 : 682942 : if (BB_FOOTER (bb))
4532 : : {
4533 : : insn = BB_FOOTER (bb);
4534 : 190046 : while (NEXT_INSN (insn))
4535 : : insn = NEXT_INSN (insn);
4536 : 189857 : insn = duplicate_insn_chain (BB_FOOTER (bb), insn, loop, id);
4537 : 189857 : if (insn)
4538 : 189856 : BB_FOOTER (new_bb) = unlink_insn_chain (insn, get_last_insn ());
4539 : : }
4540 : :
4541 : 682942 : return new_bb;
4542 : : }
4543 : :
4544 : :
4545 : : /* Main entry point to this module - initialize the datastructures for
4546 : : CFG layout changes. It keeps LOOPS up-to-date if not null.
4547 : :
4548 : : FLAGS is a set of additional flags to pass to cleanup_cfg(). */
4549 : :
4550 : : void
4551 : 2434966 : cfg_layout_initialize (int flags)
4552 : : {
4553 : 2434966 : rtx_insn_list *x;
4554 : 2434966 : basic_block bb;
4555 : :
4556 : : /* Once bb partitioning is complete, cfg layout mode should not be
4557 : : re-entered. Entering cfg layout mode may require fixups. As an
4558 : : example, if edge forwarding performed when optimizing the cfg
4559 : : layout required moving a block from the hot to the cold
4560 : : section. This would create an illegal partitioning unless some
4561 : : manual fixup was performed. */
4562 : 2434966 : gcc_assert (!crtl->bb_reorder_complete || !crtl->has_bb_partition);
4563 : :
4564 : 2434966 : initialize_original_copy_tables ();
4565 : :
4566 : 2434966 : cfg_layout_rtl_register_cfg_hooks ();
4567 : :
4568 : 2434966 : record_effective_endpoints ();
4569 : :
4570 : : /* Make sure that the targets of non local gotos are marked. */
4571 : 2437341 : for (x = nonlocal_goto_handler_labels; x; x = x->next ())
4572 : : {
4573 : 2375 : bb = BLOCK_FOR_INSN (x->insn ());
4574 : 2375 : bb->flags |= BB_NON_LOCAL_GOTO_TARGET;
4575 : : }
4576 : :
4577 : 2434966 : cleanup_cfg (CLEANUP_CFGLAYOUT | flags);
4578 : 2434966 : }
4579 : :
4580 : : /* Splits superblocks. */
4581 : : void
4582 : 58214 : break_superblocks (void)
4583 : : {
4584 : 58214 : bool need = false;
4585 : 58214 : basic_block bb;
4586 : :
4587 : 58214 : auto_sbitmap superblocks (last_basic_block_for_fn (cfun));
4588 : 58214 : bitmap_clear (superblocks);
4589 : :
4590 : 3357460 : FOR_EACH_BB_FN (bb, cfun)
4591 : 3299246 : if (bb->flags & BB_SUPERBLOCK)
4592 : : {
4593 : 206599 : bb->flags &= ~BB_SUPERBLOCK;
4594 : 206599 : bitmap_set_bit (superblocks, bb->index);
4595 : 206599 : need = true;
4596 : : }
4597 : :
4598 : 58214 : if (need)
4599 : : {
4600 : 49658 : rebuild_jump_labels (get_insns ());
4601 : 49658 : find_many_sub_basic_blocks (superblocks);
4602 : : }
4603 : 58214 : }
4604 : :
4605 : : /* Finalize the changes: reorder insn list according to the sequence specified
4606 : : by aux pointers, enter compensation code, rebuild scope forest. */
4607 : :
4608 : : void
4609 : 2434967 : cfg_layout_finalize (void)
4610 : : {
4611 : 2434967 : free_dominance_info (CDI_DOMINATORS);
4612 : 2434967 : force_one_exit_fallthru ();
4613 : 2434967 : rtl_register_cfg_hooks ();
4614 : 2434967 : if (reload_completed && !targetm.have_epilogue ())
4615 : 0 : fixup_fallthru_exit_predecessor ();
4616 : 2434967 : fixup_reorder_chain ();
4617 : :
4618 : 2434967 : rebuild_jump_labels (get_insns ());
4619 : 2434967 : delete_dead_jumptables ();
4620 : :
4621 : 2434967 : if (flag_checking)
4622 : 2434929 : verify_insn_chain ();
4623 : 2434967 : checking_verify_flow_info ();
4624 : 2434967 : }
4625 : :
4626 : :
4627 : : /* Same as split_block but update cfg_layout structures. */
4628 : :
4629 : : static basic_block
4630 : 16470 : cfg_layout_split_block (basic_block bb, void *insnp)
4631 : : {
4632 : 16470 : rtx insn = (rtx) insnp;
4633 : 16470 : basic_block new_bb = rtl_split_block (bb, insn);
4634 : :
4635 : 16470 : BB_FOOTER (new_bb) = BB_FOOTER (bb);
4636 : 16470 : BB_FOOTER (bb) = NULL;
4637 : :
4638 : 16470 : return new_bb;
4639 : : }
4640 : :
4641 : : /* Redirect Edge to DEST. */
4642 : : static edge
4643 : 9469445 : cfg_layout_redirect_edge_and_branch (edge e, basic_block dest)
4644 : : {
4645 : 9469445 : basic_block src = e->src;
4646 : 9469445 : edge ret;
4647 : :
4648 : 9469445 : if (e->flags & (EDGE_ABNORMAL_CALL | EDGE_EH))
4649 : : return NULL;
4650 : :
4651 : 9469445 : if (e->dest == dest)
4652 : : return e;
4653 : :
4654 : 9469445 : if (e->flags & EDGE_CROSSING
4655 : 3 : && BB_PARTITION (e->src) == BB_PARTITION (dest)
4656 : 9469445 : && simplejump_p (BB_END (src)))
4657 : : {
4658 : 0 : if (dump_file)
4659 : 0 : fprintf (dump_file,
4660 : : "Removing crossing jump while redirecting edge form %i to %i\n",
4661 : 0 : e->src->index, dest->index);
4662 : 0 : delete_insn (BB_END (src));
4663 : 0 : remove_barriers_from_footer (src);
4664 : 0 : e->flags |= EDGE_FALLTHRU;
4665 : : }
4666 : :
4667 : 9469445 : if (e->src != ENTRY_BLOCK_PTR_FOR_FN (cfun)
4668 : 9469445 : && (ret = try_redirect_by_replacing_jump (e, dest, true)))
4669 : : {
4670 : 268353 : df_set_bb_dirty (src);
4671 : 268353 : return ret;
4672 : : }
4673 : :
4674 : 9201092 : if (e->src == ENTRY_BLOCK_PTR_FOR_FN (cfun)
4675 : 0 : && (e->flags & EDGE_FALLTHRU) && !(e->flags & EDGE_COMPLEX))
4676 : : {
4677 : 0 : if (dump_file)
4678 : 0 : fprintf (dump_file, "Redirecting entry edge from bb %i to %i\n",
4679 : : e->src->index, dest->index);
4680 : :
4681 : 0 : df_set_bb_dirty (e->src);
4682 : 0 : redirect_edge_succ (e, dest);
4683 : 0 : return e;
4684 : : }
4685 : :
4686 : : /* Redirect_edge_and_branch may decide to turn branch into fallthru edge
4687 : : in the case the basic block appears to be in sequence. Avoid this
4688 : : transformation. */
4689 : :
4690 : 9201092 : if (e->flags & EDGE_FALLTHRU)
4691 : : {
4692 : : /* Redirect any branch edges unified with the fallthru one. */
4693 : 4600593 : if (JUMP_P (BB_END (src))
4694 : 4600593 : && label_is_jump_target_p (BB_HEAD (e->dest),
4695 : : BB_END (src)))
4696 : : {
4697 : 99 : edge redirected;
4698 : :
4699 : 99 : if (dump_file)
4700 : 0 : fprintf (dump_file, "Fallthru edge unified with branch "
4701 : : "%i->%i redirected to %i\n",
4702 : 0 : e->src->index, e->dest->index, dest->index);
4703 : 99 : e->flags &= ~EDGE_FALLTHRU;
4704 : 99 : redirected = redirect_branch_edge (e, dest);
4705 : 99 : gcc_assert (redirected);
4706 : 99 : redirected->flags |= EDGE_FALLTHRU;
4707 : 99 : df_set_bb_dirty (redirected->src);
4708 : 99 : return redirected;
4709 : : }
4710 : : /* In case we are redirecting fallthru edge to the branch edge
4711 : : of conditional jump, remove it. */
4712 : 4600494 : if (EDGE_COUNT (src->succs) == 2)
4713 : : {
4714 : : /* Find the edge that is different from E. */
4715 : 3560541 : edge s = EDGE_SUCC (src, EDGE_SUCC (src, 0) == e);
4716 : :
4717 : 3560541 : if (s->dest == dest
4718 : 24 : && any_condjump_p (BB_END (src))
4719 : 3560541 : && onlyjump_p (BB_END (src)))
4720 : 0 : delete_insn (BB_END (src));
4721 : : }
4722 : 4600494 : if (dump_file)
4723 : 2204 : fprintf (dump_file, "Redirecting fallthru edge %i->%i to %i\n",
4724 : 2204 : e->src->index, e->dest->index, dest->index);
4725 : 4600494 : ret = redirect_edge_succ_nodup (e, dest);
4726 : : }
4727 : : else
4728 : 4600499 : ret = redirect_branch_edge (e, dest);
4729 : :
4730 : 9200993 : if (!ret)
4731 : : return NULL;
4732 : :
4733 : 9200993 : fixup_partition_crossing (ret);
4734 : : /* We don't want simplejumps in the insn stream during cfglayout. */
4735 : 9200993 : gcc_assert (!simplejump_p (BB_END (src)) || CROSSING_JUMP_P (BB_END (src)));
4736 : :
4737 : 9200993 : df_set_bb_dirty (src);
4738 : 9200993 : return ret;
4739 : : }
4740 : :
4741 : : /* Simple wrapper as we always can redirect fallthru edges. */
4742 : : static basic_block
4743 : 4470882 : cfg_layout_redirect_edge_and_branch_force (edge e, basic_block dest)
4744 : : {
4745 : 4470882 : edge redirected = cfg_layout_redirect_edge_and_branch (e, dest);
4746 : :
4747 : 4470882 : gcc_assert (redirected);
4748 : 4470882 : return NULL;
4749 : : }
4750 : :
4751 : : /* Same as delete_basic_block but update cfg_layout structures. */
4752 : :
4753 : : static void
4754 : 5266920 : cfg_layout_delete_block (basic_block bb)
4755 : : {
4756 : 5266920 : rtx_insn *insn, *next, *prev = PREV_INSN (BB_HEAD (bb)), *remaints;
4757 : 5266920 : rtx_insn **to;
4758 : :
4759 : 5266920 : if (BB_HEADER (bb))
4760 : : {
4761 : 44 : next = BB_HEAD (bb);
4762 : 44 : if (prev)
4763 : 44 : SET_NEXT_INSN (prev) = BB_HEADER (bb);
4764 : : else
4765 : 0 : set_first_insn (BB_HEADER (bb));
4766 : 44 : SET_PREV_INSN (BB_HEADER (bb)) = prev;
4767 : 44 : insn = BB_HEADER (bb);
4768 : 45 : while (NEXT_INSN (insn))
4769 : : insn = NEXT_INSN (insn);
4770 : 44 : SET_NEXT_INSN (insn) = next;
4771 : 44 : SET_PREV_INSN (next) = insn;
4772 : : }
4773 : 5266920 : next = NEXT_INSN (BB_END (bb));
4774 : 5266920 : if (BB_FOOTER (bb))
4775 : : {
4776 : : insn = BB_FOOTER (bb);
4777 : 2874365 : while (insn)
4778 : : {
4779 : 1437185 : if (BARRIER_P (insn))
4780 : : {
4781 : 1437182 : if (PREV_INSN (insn))
4782 : 2 : SET_NEXT_INSN (PREV_INSN (insn)) = NEXT_INSN (insn);
4783 : : else
4784 : 1437180 : BB_FOOTER (bb) = NEXT_INSN (insn);
4785 : 1437182 : if (NEXT_INSN (insn))
4786 : 3 : SET_PREV_INSN (NEXT_INSN (insn)) = PREV_INSN (insn);
4787 : : }
4788 : 1437185 : if (LABEL_P (insn))
4789 : : break;
4790 : 1437184 : insn = NEXT_INSN (insn);
4791 : : }
4792 : 1437181 : if (BB_FOOTER (bb))
4793 : : {
4794 : 3 : insn = BB_END (bb);
4795 : 3 : SET_NEXT_INSN (insn) = BB_FOOTER (bb);
4796 : 3 : SET_PREV_INSN (BB_FOOTER (bb)) = insn;
4797 : 8 : while (NEXT_INSN (insn))
4798 : : insn = NEXT_INSN (insn);
4799 : 3 : SET_NEXT_INSN (insn) = next;
4800 : 3 : if (next)
4801 : 2 : SET_PREV_INSN (next) = insn;
4802 : : else
4803 : 1 : set_last_insn (insn);
4804 : : }
4805 : : }
4806 : 5266920 : if (bb->next_bb != EXIT_BLOCK_PTR_FOR_FN (cfun))
4807 : 5235011 : to = &BB_HEADER (bb->next_bb);
4808 : : else
4809 : : to = &cfg_layout_function_footer;
4810 : :
4811 : 5266920 : rtl_delete_block (bb);
4812 : :
4813 : 5266920 : if (prev)
4814 : 5266920 : prev = NEXT_INSN (prev);
4815 : : else
4816 : 0 : prev = get_insns ();
4817 : 5266920 : if (next)
4818 : 5235005 : next = PREV_INSN (next);
4819 : : else
4820 : 31915 : next = get_last_insn ();
4821 : :
4822 : 10533840 : if (next && NEXT_INSN (next) != prev)
4823 : : {
4824 : 1338 : remaints = unlink_insn_chain (prev, next);
4825 : 1338 : insn = remaints;
4826 : 2855 : while (NEXT_INSN (insn))
4827 : : insn = NEXT_INSN (insn);
4828 : 1338 : SET_NEXT_INSN (insn) = *to;
4829 : 1338 : if (*to)
4830 : 207 : SET_PREV_INSN (*to) = insn;
4831 : 1338 : *to = remaints;
4832 : : }
4833 : 5266920 : }
4834 : :
4835 : : /* Return true when blocks A and B can be safely merged. */
4836 : :
4837 : : static bool
4838 : 2980349 : cfg_layout_can_merge_blocks_p (basic_block a, basic_block b)
4839 : : {
4840 : : /* If we are partitioning hot/cold basic blocks, we don't want to
4841 : : mess up unconditional or indirect jumps that cross between hot
4842 : : and cold sections.
4843 : :
4844 : : Basic block partitioning may result in some jumps that appear to
4845 : : be optimizable (or blocks that appear to be mergeable), but which really
4846 : : must be left untouched (they are required to make it safely across
4847 : : partition boundaries). See the comments at the top of
4848 : : bb-reorder.cc:partition_hot_cold_basic_blocks for complete details. */
4849 : :
4850 : 2980349 : if (BB_PARTITION (a) != BB_PARTITION (b))
4851 : : return false;
4852 : :
4853 : : /* Protect the loop latches. */
4854 : 2825355 : if (current_loops && b->loop_father->latch == b)
4855 : : return false;
4856 : :
4857 : : /* If we would end up moving B's instructions, make sure it doesn't fall
4858 : : through into the exit block, since we cannot recover from a fallthrough
4859 : : edge into the exit block occurring in the middle of a function. */
4860 : 2452409 : if (NEXT_INSN (BB_END (a)) != BB_HEAD (b))
4861 : : {
4862 : 1575416 : edge e = find_fallthru_edge (b->succs);
4863 : 1575416 : if (e && e->dest == EXIT_BLOCK_PTR_FOR_FN (cfun))
4864 : : return false;
4865 : : }
4866 : :
4867 : : /* There must be exactly one edge in between the blocks. */
4868 : 1774626 : return (single_succ_p (a)
4869 : 1774626 : && single_succ (a) == b
4870 : 1774626 : && single_pred_p (b) == 1
4871 : 1752191 : && a != b
4872 : : /* Must be simple edge. */
4873 : 1752191 : && !(single_succ_edge (a)->flags & EDGE_COMPLEX)
4874 : 1752191 : && a != ENTRY_BLOCK_PTR_FOR_FN (cfun)
4875 : 1752191 : && b != EXIT_BLOCK_PTR_FOR_FN (cfun)
4876 : : /* If the jump insn has side effects, we can't kill the edge.
4877 : : When not optimizing, try_redirect_by_replacing_jump will
4878 : : not allow us to redirect an edge by replacing a table jump. */
4879 : 3526817 : && (!JUMP_P (BB_END (a))
4880 : 80102 : || ((!optimize || reload_completed)
4881 : 64341 : ? simplejump_p (BB_END (a)) : onlyjump_p (BB_END (a)))));
4882 : : }
4883 : :
4884 : : /* Merge block A and B. The blocks must be mergeable. */
4885 : :
4886 : : static void
4887 : 875074 : cfg_layout_merge_blocks (basic_block a, basic_block b)
4888 : : {
4889 : : /* If B is a forwarder block whose outgoing edge has no location, we'll
4890 : : propagate the locus of the edge between A and B onto it. */
4891 : 875074 : const bool forward_edge_locus
4892 : 875074 : = (b->flags & BB_FORWARDER_BLOCK) != 0
4893 : 875074 : && LOCATION_LOCUS (EDGE_SUCC (b, 0)->goto_locus) == UNKNOWN_LOCATION;
4894 : 875074 : rtx_insn *insn;
4895 : :
4896 : 875074 : gcc_checking_assert (cfg_layout_can_merge_blocks_p (a, b));
4897 : :
4898 : 875074 : if (dump_file)
4899 : 74 : fprintf (dump_file, "Merging block %d into block %d...\n", b->index,
4900 : : a->index);
4901 : :
4902 : : /* If there was a CODE_LABEL beginning B, delete it. */
4903 : 875074 : if (LABEL_P (BB_HEAD (b)))
4904 : : {
4905 : 349115 : delete_insn (BB_HEAD (b));
4906 : : }
4907 : :
4908 : : /* We should have fallthru edge in a, or we can do dummy redirection to get
4909 : : it cleaned up. */
4910 : 875074 : if (JUMP_P (BB_END (a)))
4911 : 31149 : try_redirect_by_replacing_jump (EDGE_SUCC (a, 0), b, true);
4912 : 875074 : gcc_assert (!JUMP_P (BB_END (a)));
4913 : :
4914 : : /* If not optimizing, preserve the locus of the single edge between
4915 : : blocks A and B if necessary by emitting a nop. */
4916 : 875074 : if (!optimize
4917 : 4516 : && !forward_edge_locus
4918 : 879371 : && !DECL_IGNORED_P (current_function_decl))
4919 : 4297 : emit_nop_for_unique_locus_between (a, b);
4920 : :
4921 : : /* Move things from b->footer after a->footer. */
4922 : 875074 : if (BB_FOOTER (b))
4923 : : {
4924 : 203028 : if (!BB_FOOTER (a))
4925 : 203027 : BB_FOOTER (a) = BB_FOOTER (b);
4926 : : else
4927 : : {
4928 : : rtx_insn *last = BB_FOOTER (a);
4929 : :
4930 : 1 : while (NEXT_INSN (last))
4931 : : last = NEXT_INSN (last);
4932 : 1 : SET_NEXT_INSN (last) = BB_FOOTER (b);
4933 : 1 : SET_PREV_INSN (BB_FOOTER (b)) = last;
4934 : : }
4935 : 203028 : BB_FOOTER (b) = NULL;
4936 : : }
4937 : :
4938 : : /* Move things from b->header before a->footer.
4939 : : Note that this may include dead tablejump data, but we don't clean
4940 : : those up until we go out of cfglayout mode. */
4941 : 875074 : if (BB_HEADER (b))
4942 : : {
4943 : 1980 : if (! BB_FOOTER (a))
4944 : 916 : BB_FOOTER (a) = BB_HEADER (b);
4945 : : else
4946 : : {
4947 : : rtx_insn *last = BB_HEADER (b);
4948 : :
4949 : 1091 : while (NEXT_INSN (last))
4950 : : last = NEXT_INSN (last);
4951 : 1064 : SET_NEXT_INSN (last) = BB_FOOTER (a);
4952 : 1064 : SET_PREV_INSN (BB_FOOTER (a)) = last;
4953 : 1064 : BB_FOOTER (a) = BB_HEADER (b);
4954 : : }
4955 : 1980 : BB_HEADER (b) = NULL;
4956 : : }
4957 : :
4958 : : /* In the case basic blocks are not adjacent, move them around. */
4959 : 875074 : if (NEXT_INSN (BB_END (a)) != BB_HEAD (b))
4960 : : {
4961 : 443939 : insn = unlink_insn_chain (BB_HEAD (b), BB_END (b));
4962 : :
4963 : 443939 : emit_insn_after_noloc (insn, BB_END (a), a);
4964 : : }
4965 : : /* Otherwise just re-associate the instructions. */
4966 : : else
4967 : : {
4968 : 431135 : insn = BB_HEAD (b);
4969 : 431135 : BB_END (a) = BB_END (b);
4970 : : }
4971 : :
4972 : : /* emit_insn_after_noloc doesn't call df_insn_change_bb.
4973 : : We need to explicitly call. */
4974 : 875074 : update_bb_for_insn_chain (insn, BB_END (b), a);
4975 : :
4976 : : /* Skip possible DELETED_LABEL insn. */
4977 : 875074 : if (!NOTE_INSN_BASIC_BLOCK_P (insn))
4978 : 0 : insn = NEXT_INSN (insn);
4979 : 875074 : gcc_assert (NOTE_INSN_BASIC_BLOCK_P (insn));
4980 : 875074 : BB_HEAD (b) = BB_END (b) = NULL;
4981 : 875074 : delete_insn (insn);
4982 : :
4983 : 875074 : df_bb_delete (b->index);
4984 : :
4985 : 875074 : if (forward_edge_locus)
4986 : 183186 : EDGE_SUCC (b, 0)->goto_locus = EDGE_SUCC (a, 0)->goto_locus;
4987 : :
4988 : 875074 : if (dump_file)
4989 : 74 : fprintf (dump_file, "Merged blocks %d and %d.\n", a->index, b->index);
4990 : 875074 : }
4991 : :
4992 : : /* Split edge E. */
4993 : :
4994 : : static basic_block
4995 : 3252871 : cfg_layout_split_edge (edge e)
4996 : : {
4997 : 3252871 : basic_block new_bb =
4998 : 6505742 : create_basic_block (e->src != ENTRY_BLOCK_PTR_FOR_FN (cfun)
4999 : 3252871 : ? NEXT_INSN (BB_END (e->src)) : get_insns (),
5000 : : NULL_RTX, e->src);
5001 : :
5002 : 3252871 : if (e->dest == EXIT_BLOCK_PTR_FOR_FN (cfun))
5003 : 1 : BB_COPY_PARTITION (new_bb, e->src);
5004 : : else
5005 : 3252870 : BB_COPY_PARTITION (new_bb, e->dest);
5006 : 3252871 : make_edge (new_bb, e->dest, EDGE_FALLTHRU);
5007 : 3252871 : redirect_edge_and_branch_force (e, new_bb);
5008 : :
5009 : 3252871 : return new_bb;
5010 : : }
5011 : :
5012 : : /* Do postprocessing after making a forwarder block joined by edge FALLTHRU. */
5013 : :
5014 : : static void
5015 : 1735 : rtl_make_forwarder_block (edge fallthru ATTRIBUTE_UNUSED)
5016 : : {
5017 : 1735 : }
5018 : :
5019 : : /* Return true if BB contains only labels or non-executable
5020 : : instructions. */
5021 : :
5022 : : static bool
5023 : 0 : rtl_block_empty_p (basic_block bb)
5024 : : {
5025 : 0 : rtx_insn *insn;
5026 : :
5027 : 0 : if (bb == ENTRY_BLOCK_PTR_FOR_FN (cfun)
5028 : 0 : || bb == EXIT_BLOCK_PTR_FOR_FN (cfun))
5029 : : return true;
5030 : :
5031 : 0 : FOR_BB_INSNS (bb, insn)
5032 : 0 : if (NONDEBUG_INSN_P (insn)
5033 : 0 : && (!any_uncondjump_p (insn) || !onlyjump_p (insn)))
5034 : 0 : return false;
5035 : :
5036 : : return true;
5037 : : }
5038 : :
5039 : : /* Split a basic block if it ends with a conditional branch and if
5040 : : the other part of the block is not empty. */
5041 : :
5042 : : static basic_block
5043 : 0 : rtl_split_block_before_cond_jump (basic_block bb)
5044 : : {
5045 : 0 : rtx_insn *insn;
5046 : 0 : rtx_insn *split_point = NULL;
5047 : 0 : rtx_insn *last = NULL;
5048 : 0 : bool found_code = false;
5049 : :
5050 : 0 : FOR_BB_INSNS (bb, insn)
5051 : : {
5052 : 0 : if (any_condjump_p (insn))
5053 : : split_point = last;
5054 : 0 : else if (NONDEBUG_INSN_P (insn))
5055 : 0 : found_code = true;
5056 : 0 : last = insn;
5057 : : }
5058 : :
5059 : : /* Did not find everything. */
5060 : 0 : if (found_code && split_point)
5061 : 0 : return split_block (bb, split_point)->dest;
5062 : : else
5063 : : return NULL;
5064 : : }
5065 : :
5066 : : /* Return true if BB ends with a call, possibly followed by some
5067 : : instructions that must stay with the call, false otherwise. */
5068 : :
5069 : : static bool
5070 : 9049160 : rtl_block_ends_with_call_p (basic_block bb)
5071 : : {
5072 : 9049160 : rtx_insn *insn = BB_END (bb);
5073 : :
5074 : 9049160 : while (!CALL_P (insn)
5075 : 10184722 : && insn != BB_HEAD (bb)
5076 : 21585401 : && (keep_with_call_p (insn)
5077 : 10138310 : || NOTE_P (insn)
5078 : 10031286 : || DEBUG_INSN_P (insn)))
5079 : 2397568 : insn = PREV_INSN (insn);
5080 : 9049160 : return (CALL_P (insn));
5081 : : }
5082 : :
5083 : : /* Return true if BB ends with a conditional branch, false otherwise. */
5084 : :
5085 : : static bool
5086 : 0 : rtl_block_ends_with_condjump_p (const_basic_block bb)
5087 : : {
5088 : 0 : return any_condjump_p (BB_END (bb));
5089 : : }
5090 : :
5091 : : /* Return true if we need to add fake edge to exit.
5092 : : Helper function for rtl_flow_call_edges_add. */
5093 : :
5094 : : static bool
5095 : 0 : need_fake_edge_p (const rtx_insn *insn)
5096 : : {
5097 : 0 : if (!INSN_P (insn))
5098 : : return false;
5099 : :
5100 : 0 : if ((CALL_P (insn)
5101 : 0 : && !SIBLING_CALL_P (insn)
5102 : 0 : && !find_reg_note (insn, REG_NORETURN, NULL)
5103 : 0 : && !(RTL_CONST_OR_PURE_CALL_P (insn))))
5104 : : return true;
5105 : :
5106 : 0 : return ((GET_CODE (PATTERN (insn)) == ASM_OPERANDS
5107 : 0 : && MEM_VOLATILE_P (PATTERN (insn)))
5108 : 0 : || (GET_CODE (PATTERN (insn)) == PARALLEL
5109 : 0 : && asm_noperands (insn) != -1
5110 : 0 : && MEM_VOLATILE_P (XVECEXP (PATTERN (insn), 0, 0)))
5111 : 0 : || GET_CODE (PATTERN (insn)) == ASM_INPUT);
5112 : : }
5113 : :
5114 : : /* Add fake edges to the function exit for any non constant and non noreturn
5115 : : calls, volatile inline assembly in the bitmap of blocks specified by
5116 : : BLOCKS or to the whole CFG if BLOCKS is zero. Return the number of blocks
5117 : : that were split.
5118 : :
5119 : : The goal is to expose cases in which entering a basic block does not imply
5120 : : that all subsequent instructions must be executed. */
5121 : :
5122 : : static int
5123 : 0 : rtl_flow_call_edges_add (sbitmap blocks)
5124 : : {
5125 : 0 : int i;
5126 : 0 : int blocks_split = 0;
5127 : 0 : int last_bb = last_basic_block_for_fn (cfun);
5128 : 0 : bool check_last_block = false;
5129 : :
5130 : 0 : if (n_basic_blocks_for_fn (cfun) == NUM_FIXED_BLOCKS)
5131 : : return 0;
5132 : :
5133 : 0 : if (! blocks)
5134 : : check_last_block = true;
5135 : : else
5136 : 0 : check_last_block = bitmap_bit_p (blocks,
5137 : 0 : EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb->index);
5138 : :
5139 : : /* In the last basic block, before epilogue generation, there will be
5140 : : a fallthru edge to EXIT. Special care is required if the last insn
5141 : : of the last basic block is a call because make_edge folds duplicate
5142 : : edges, which would result in the fallthru edge also being marked
5143 : : fake, which would result in the fallthru edge being removed by
5144 : : remove_fake_edges, which would result in an invalid CFG.
5145 : :
5146 : : Moreover, we can't elide the outgoing fake edge, since the block
5147 : : profiler needs to take this into account in order to solve the minimal
5148 : : spanning tree in the case that the call doesn't return.
5149 : :
5150 : : Handle this by adding a dummy instruction in a new last basic block. */
5151 : 0 : if (check_last_block)
5152 : : {
5153 : 0 : basic_block bb = EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb;
5154 : 0 : rtx_insn *insn = BB_END (bb);
5155 : :
5156 : : /* Back up past insns that must be kept in the same block as a call. */
5157 : 0 : while (insn != BB_HEAD (bb)
5158 : 0 : && keep_with_call_p (insn))
5159 : 0 : insn = PREV_INSN (insn);
5160 : :
5161 : 0 : if (need_fake_edge_p (insn))
5162 : : {
5163 : 0 : edge e;
5164 : :
5165 : 0 : e = find_edge (bb, EXIT_BLOCK_PTR_FOR_FN (cfun));
5166 : 0 : if (e)
5167 : : {
5168 : 0 : insert_insn_on_edge (gen_use (const0_rtx), e);
5169 : 0 : commit_edge_insertions ();
5170 : : }
5171 : : }
5172 : : }
5173 : :
5174 : : /* Now add fake edges to the function exit for any non constant
5175 : : calls since there is no way that we can determine if they will
5176 : : return or not... */
5177 : :
5178 : 0 : for (i = NUM_FIXED_BLOCKS; i < last_bb; i++)
5179 : : {
5180 : 0 : basic_block bb = BASIC_BLOCK_FOR_FN (cfun, i);
5181 : 0 : rtx_insn *insn;
5182 : 0 : rtx_insn *prev_insn;
5183 : :
5184 : 0 : if (!bb)
5185 : 0 : continue;
5186 : :
5187 : 0 : if (blocks && !bitmap_bit_p (blocks, i))
5188 : 0 : continue;
5189 : :
5190 : 0 : for (insn = BB_END (bb); ; insn = prev_insn)
5191 : : {
5192 : 0 : prev_insn = PREV_INSN (insn);
5193 : 0 : if (need_fake_edge_p (insn))
5194 : : {
5195 : 0 : edge e;
5196 : 0 : rtx_insn *split_at_insn = insn;
5197 : :
5198 : : /* Don't split the block between a call and an insn that should
5199 : : remain in the same block as the call. */
5200 : 0 : if (CALL_P (insn))
5201 : 0 : while (split_at_insn != BB_END (bb)
5202 : 0 : && keep_with_call_p (NEXT_INSN (split_at_insn)))
5203 : 0 : split_at_insn = NEXT_INSN (split_at_insn);
5204 : :
5205 : : /* The handling above of the final block before the epilogue
5206 : : should be enough to verify that there is no edge to the exit
5207 : : block in CFG already. Calling make_edge in such case would
5208 : : cause us to mark that edge as fake and remove it later. */
5209 : :
5210 : 0 : if (flag_checking && split_at_insn == BB_END (bb))
5211 : : {
5212 : 0 : e = find_edge (bb, EXIT_BLOCK_PTR_FOR_FN (cfun));
5213 : 0 : gcc_assert (e == NULL);
5214 : : }
5215 : :
5216 : : /* Note that the following may create a new basic block
5217 : : and renumber the existing basic blocks. */
5218 : 0 : if (split_at_insn != BB_END (bb))
5219 : : {
5220 : 0 : e = split_block (bb, split_at_insn);
5221 : 0 : if (e)
5222 : 0 : blocks_split++;
5223 : : }
5224 : :
5225 : 0 : edge ne = make_edge (bb, EXIT_BLOCK_PTR_FOR_FN (cfun), EDGE_FAKE);
5226 : 0 : ne->probability = profile_probability::guessed_never ();
5227 : : }
5228 : :
5229 : 0 : if (insn == BB_HEAD (bb))
5230 : : break;
5231 : : }
5232 : : }
5233 : :
5234 : 0 : if (blocks_split)
5235 : 0 : verify_flow_info ();
5236 : :
5237 : : return blocks_split;
5238 : : }
5239 : :
5240 : : /* Add COMP_RTX as a condition at end of COND_BB. FIRST_HEAD is
5241 : : the conditional branch target, SECOND_HEAD should be the fall-thru
5242 : : there is no need to handle this here the loop versioning code handles
5243 : : this. the reason for SECON_HEAD is that it is needed for condition
5244 : : in trees, and this should be of the same type since it is a hook. */
5245 : : static void
5246 : 0 : rtl_lv_add_condition_to_bb (basic_block first_head ,
5247 : : basic_block second_head ATTRIBUTE_UNUSED,
5248 : : basic_block cond_bb, void *comp_rtx)
5249 : : {
5250 : 0 : rtx_code_label *label;
5251 : 0 : rtx_insn *seq, *jump;
5252 : 0 : rtx op0 = XEXP ((rtx)comp_rtx, 0);
5253 : 0 : rtx op1 = XEXP ((rtx)comp_rtx, 1);
5254 : 0 : enum rtx_code comp = GET_CODE ((rtx)comp_rtx);
5255 : 0 : machine_mode mode;
5256 : :
5257 : :
5258 : 0 : label = block_label (first_head);
5259 : 0 : mode = GET_MODE (op0);
5260 : 0 : if (mode == VOIDmode)
5261 : 0 : mode = GET_MODE (op1);
5262 : :
5263 : 0 : start_sequence ();
5264 : 0 : op0 = force_operand (op0, NULL_RTX);
5265 : 0 : op1 = force_operand (op1, NULL_RTX);
5266 : 0 : do_compare_rtx_and_jump (op0, op1, comp, 0, mode, NULL_RTX, NULL, label,
5267 : : profile_probability::uninitialized ());
5268 : 0 : jump = get_last_insn ();
5269 : 0 : JUMP_LABEL (jump) = label;
5270 : 0 : LABEL_NUSES (label)++;
5271 : 0 : seq = get_insns ();
5272 : 0 : end_sequence ();
5273 : :
5274 : : /* Add the new cond, in the new head. */
5275 : 0 : emit_insn_after (seq, BB_END (cond_bb));
5276 : 0 : }
5277 : :
5278 : :
5279 : : /* Given a block B with unconditional branch at its end, get the
5280 : : store the return the branch edge and the fall-thru edge in
5281 : : BRANCH_EDGE and FALLTHRU_EDGE respectively. */
5282 : : static void
5283 : 0 : rtl_extract_cond_bb_edges (basic_block b, edge *branch_edge,
5284 : : edge *fallthru_edge)
5285 : : {
5286 : 0 : edge e = EDGE_SUCC (b, 0);
5287 : :
5288 : 0 : if (e->flags & EDGE_FALLTHRU)
5289 : : {
5290 : 0 : *fallthru_edge = e;
5291 : 0 : *branch_edge = EDGE_SUCC (b, 1);
5292 : : }
5293 : : else
5294 : : {
5295 : 0 : *branch_edge = e;
5296 : 0 : *fallthru_edge = EDGE_SUCC (b, 1);
5297 : : }
5298 : 0 : }
5299 : :
5300 : : void
5301 : 27208905 : init_rtl_bb_info (basic_block bb)
5302 : : {
5303 : 27208905 : gcc_assert (!bb->il.x.rtl);
5304 : 27208905 : bb->il.x.head_ = NULL;
5305 : 27208905 : bb->il.x.rtl = ggc_cleared_alloc<rtl_bb_info> ();
5306 : 27208905 : }
5307 : :
5308 : : static bool
5309 : 2172 : rtl_bb_info_initialized_p (basic_block bb)
5310 : : {
5311 : 2172 : return bb->il.x.rtl;
5312 : : }
5313 : :
5314 : : /* Returns true if it is possible to remove edge E by redirecting
5315 : : it to the destination of the other edge from E->src. */
5316 : :
5317 : : static bool
5318 : 139699 : rtl_can_remove_branch_p (const_edge e)
5319 : : {
5320 : 139699 : const_basic_block src = e->src;
5321 : 139699 : const_basic_block target = EDGE_SUCC (src, EDGE_SUCC (src, 0) == e)->dest;
5322 : 139699 : const rtx_insn *insn = BB_END (src);
5323 : 139699 : rtx set;
5324 : :
5325 : : /* The conditions are taken from try_redirect_by_replacing_jump. */
5326 : 139699 : if (target == EXIT_BLOCK_PTR_FOR_FN (cfun))
5327 : : return false;
5328 : :
5329 : 139699 : if (e->flags & (EDGE_ABNORMAL_CALL | EDGE_EH))
5330 : : return false;
5331 : :
5332 : 139699 : if (BB_PARTITION (src) != BB_PARTITION (target))
5333 : : return false;
5334 : :
5335 : 139699 : if (!onlyjump_p (insn)
5336 : 139699 : || tablejump_p (insn, NULL, NULL))
5337 : 0 : return false;
5338 : :
5339 : 139699 : set = single_set (insn);
5340 : 139699 : if (!set || side_effects_p (set))
5341 : 0 : return false;
5342 : :
5343 : : return true;
5344 : : }
5345 : :
5346 : : static basic_block
5347 : 33834 : rtl_duplicate_bb (basic_block bb, copy_bb_data *id)
5348 : : {
5349 : 33834 : bb = cfg_layout_duplicate_bb (bb, id);
5350 : 33834 : bb->aux = NULL;
5351 : 33834 : return bb;
5352 : : }
5353 : :
5354 : : /* Do book-keeping of basic block BB for the profile consistency checker.
5355 : : Store the counting in RECORD. */
5356 : : static void
5357 : 0 : rtl_account_profile_record (basic_block bb, struct profile_record *record)
5358 : : {
5359 : 0 : rtx_insn *insn;
5360 : 0 : FOR_BB_INSNS (bb, insn)
5361 : 0 : if (INSN_P (insn))
5362 : : {
5363 : 0 : record->size += insn_cost (insn, false);
5364 : 0 : if (profile_info)
5365 : : {
5366 : 0 : if (ENTRY_BLOCK_PTR_FOR_FN (cfun)->count.ipa ().initialized_p ()
5367 : 0 : && ENTRY_BLOCK_PTR_FOR_FN (cfun)->count.ipa ().nonzero_p ()
5368 : 0 : && bb->count.ipa ().initialized_p ())
5369 : 0 : record->time
5370 : 0 : += insn_cost (insn, true) * bb->count.ipa ().to_gcov_type ();
5371 : : }
5372 : 0 : else if (bb->count.initialized_p ()
5373 : 0 : && ENTRY_BLOCK_PTR_FOR_FN (cfun)->count.initialized_p ())
5374 : 0 : record->time
5375 : 0 : += insn_cost (insn, true)
5376 : 0 : * bb->count.to_sreal_scale
5377 : 0 : (ENTRY_BLOCK_PTR_FOR_FN (cfun)->count).to_double ();
5378 : : else
5379 : 0 : record->time += insn_cost (insn, true);
5380 : : }
5381 : 0 : }
5382 : :
5383 : : /* Implementation of CFG manipulation for linearized RTL. */
5384 : : struct cfg_hooks rtl_cfg_hooks = {
5385 : : "rtl",
5386 : : rtl_verify_flow_info,
5387 : : rtl_dump_bb,
5388 : : rtl_dump_bb_for_graph,
5389 : : rtl_create_basic_block,
5390 : : rtl_redirect_edge_and_branch,
5391 : : rtl_redirect_edge_and_branch_force,
5392 : : rtl_can_remove_branch_p,
5393 : : rtl_delete_block,
5394 : : rtl_split_block,
5395 : : rtl_move_block_after,
5396 : : rtl_can_merge_blocks, /* can_merge_blocks_p */
5397 : : rtl_merge_blocks,
5398 : : rtl_predict_edge,
5399 : : rtl_predicted_by_p,
5400 : : cfg_layout_can_duplicate_bb_p,
5401 : : rtl_duplicate_bb,
5402 : : rtl_split_edge,
5403 : : rtl_make_forwarder_block,
5404 : : rtl_tidy_fallthru_edge,
5405 : : rtl_force_nonfallthru,
5406 : : rtl_block_ends_with_call_p,
5407 : : rtl_block_ends_with_condjump_p,
5408 : : rtl_flow_call_edges_add,
5409 : : NULL, /* execute_on_growing_pred */
5410 : : NULL, /* execute_on_shrinking_pred */
5411 : : NULL, /* duplicate loop for trees */
5412 : : NULL, /* lv_add_condition_to_bb */
5413 : : NULL, /* lv_adjust_loop_header_phi*/
5414 : : NULL, /* extract_cond_bb_edges */
5415 : : NULL, /* flush_pending_stmts */
5416 : : rtl_block_empty_p, /* block_empty_p */
5417 : : rtl_split_block_before_cond_jump, /* split_block_before_cond_jump */
5418 : : rtl_account_profile_record,
5419 : : };
5420 : :
5421 : : /* Implementation of CFG manipulation for cfg layout RTL, where
5422 : : basic block connected via fallthru edges does not have to be adjacent.
5423 : : This representation will hopefully become the default one in future
5424 : : version of the compiler. */
5425 : :
5426 : : struct cfg_hooks cfg_layout_rtl_cfg_hooks = {
5427 : : "cfglayout mode",
5428 : : rtl_verify_flow_info_1,
5429 : : rtl_dump_bb,
5430 : : rtl_dump_bb_for_graph,
5431 : : cfg_layout_create_basic_block,
5432 : : cfg_layout_redirect_edge_and_branch,
5433 : : cfg_layout_redirect_edge_and_branch_force,
5434 : : rtl_can_remove_branch_p,
5435 : : cfg_layout_delete_block,
5436 : : cfg_layout_split_block,
5437 : : rtl_move_block_after,
5438 : : cfg_layout_can_merge_blocks_p,
5439 : : cfg_layout_merge_blocks,
5440 : : rtl_predict_edge,
5441 : : rtl_predicted_by_p,
5442 : : cfg_layout_can_duplicate_bb_p,
5443 : : cfg_layout_duplicate_bb,
5444 : : cfg_layout_split_edge,
5445 : : rtl_make_forwarder_block,
5446 : : NULL, /* tidy_fallthru_edge */
5447 : : rtl_force_nonfallthru,
5448 : : rtl_block_ends_with_call_p,
5449 : : rtl_block_ends_with_condjump_p,
5450 : : rtl_flow_call_edges_add,
5451 : : NULL, /* execute_on_growing_pred */
5452 : : NULL, /* execute_on_shrinking_pred */
5453 : : duplicate_loop_body_to_header_edge, /* duplicate loop for rtl */
5454 : : rtl_lv_add_condition_to_bb, /* lv_add_condition_to_bb */
5455 : : NULL, /* lv_adjust_loop_header_phi*/
5456 : : rtl_extract_cond_bb_edges, /* extract_cond_bb_edges */
5457 : : NULL, /* flush_pending_stmts */
5458 : : rtl_block_empty_p, /* block_empty_p */
5459 : : rtl_split_block_before_cond_jump, /* split_block_before_cond_jump */
5460 : : rtl_account_profile_record,
5461 : : };
5462 : :
5463 : : #include "gt-cfgrtl.h"
5464 : :
5465 : : #if __GNUC__ >= 10
5466 : : # pragma GCC diagnostic pop
5467 : : #endif
|
