1 /* Instruction scheduling pass. Selective scheduler and pipeliner.
2 Copyright (C) 2006-2014 Free Software Foundation, Inc.
4 This file is part of GCC.
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
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
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/>. */
22 #include "coretypes.h"
24 #include "diagnostic-core.h"
27 #include "hard-reg-set.h"
31 #include "insn-config.h"
32 #include "insn-attr.h"
37 #include "sched-int.h"
41 #include "langhooks.h"
42 #include "rtlhooks-def.h"
43 #include "emit-rtl.h" /* FIXME: Can go away once crtl is moved to rtl.h. */
45 #ifdef INSN_SCHEDULING
46 #include "sel-sched-ir.h"
47 /* We don't have to use it except for sel_print_insn. */
48 #include "sel-sched-dump.h"
50 /* A vector holding bb info for whole scheduling pass. */
51 vec
<sel_global_bb_info_def
>
52 sel_global_bb_info
= vNULL
;
54 /* A vector holding bb info. */
55 vec
<sel_region_bb_info_def
>
56 sel_region_bb_info
= vNULL
;
58 /* A pool for allocating all lists. */
59 alloc_pool sched_lists_pool
;
61 /* This contains information about successors for compute_av_set. */
62 struct succs_info current_succs
;
64 /* Data structure to describe interaction with the generic scheduler utils. */
65 static struct common_sched_info_def sel_common_sched_info
;
67 /* The loop nest being pipelined. */
68 struct loop
*current_loop_nest
;
70 /* LOOP_NESTS is a vector containing the corresponding loop nest for
72 static vec
<loop_p
> loop_nests
= vNULL
;
74 /* Saves blocks already in loop regions, indexed by bb->index. */
75 static sbitmap bbs_in_loop_rgns
= NULL
;
77 /* CFG hooks that are saved before changing create_basic_block hook. */
78 static struct cfg_hooks orig_cfg_hooks
;
81 /* Array containing reverse topological index of function basic blocks,
82 indexed by BB->INDEX. */
83 static int *rev_top_order_index
= NULL
;
85 /* Length of the above array. */
86 static int rev_top_order_index_len
= -1;
88 /* A regset pool structure. */
91 /* The stack to which regsets are returned. */
100 /* In VV we save all generated regsets so that, when destructing the
101 pool, we can compare it with V and check that every regset was returned
105 /* The pointer of VV stack. */
111 /* The difference between allocated and returned regsets. */
113 } regset_pool
= { NULL
, 0, 0, NULL
, 0, 0, 0 };
115 /* This represents the nop pool. */
118 /* The vector which holds previously emitted nops. */
126 } nop_pool
= { NULL
, 0, 0 };
128 /* The pool for basic block notes. */
129 static rtx_vec_t bb_note_pool
;
131 /* A NOP pattern used to emit placeholder insns. */
132 rtx nop_pattern
= NULL_RTX
;
133 /* A special instruction that resides in EXIT_BLOCK.
134 EXIT_INSN is successor of the insns that lead to EXIT_BLOCK. */
135 rtx exit_insn
= NULL_RTX
;
137 /* TRUE if while scheduling current region, which is loop, its preheader
139 bool preheader_removed
= false;
142 /* Forward static declarations. */
143 static void fence_clear (fence_t
);
145 static void deps_init_id (idata_t
, insn_t
, bool);
146 static void init_id_from_df (idata_t
, insn_t
, bool);
147 static expr_t
set_insn_init (expr_t
, vinsn_t
, int);
149 static void cfg_preds (basic_block
, insn_t
**, int *);
150 static void prepare_insn_expr (insn_t
, int);
151 static void free_history_vect (vec
<expr_history_def
> &);
153 static void move_bb_info (basic_block
, basic_block
);
154 static void remove_empty_bb (basic_block
, bool);
155 static void sel_merge_blocks (basic_block
, basic_block
);
156 static void sel_remove_loop_preheader (void);
157 static bool bb_has_removable_jump_to_p (basic_block
, basic_block
);
159 static bool insn_is_the_only_one_in_bb_p (insn_t
);
160 static void create_initial_data_sets (basic_block
);
162 static void free_av_set (basic_block
);
163 static void invalidate_av_set (basic_block
);
164 static void extend_insn_data (void);
165 static void sel_init_new_insn (insn_t
, int, int = -1);
166 static void finish_insns (void);
168 /* Various list functions. */
170 /* Copy an instruction list L. */
172 ilist_copy (ilist_t l
)
174 ilist_t head
= NULL
, *tailp
= &head
;
178 ilist_add (tailp
, ILIST_INSN (l
));
179 tailp
= &ILIST_NEXT (*tailp
);
186 /* Invert an instruction list L. */
188 ilist_invert (ilist_t l
)
194 ilist_add (&res
, ILIST_INSN (l
));
201 /* Add a new boundary to the LP list with parameters TO, PTR, and DC. */
203 blist_add (blist_t
*lp
, insn_t to
, ilist_t ptr
, deps_t dc
)
208 bnd
= BLIST_BND (*lp
);
213 BND_AV1 (bnd
) = NULL
;
217 /* Remove the list note pointed to by LP. */
219 blist_remove (blist_t
*lp
)
221 bnd_t b
= BLIST_BND (*lp
);
223 av_set_clear (&BND_AV (b
));
224 av_set_clear (&BND_AV1 (b
));
225 ilist_clear (&BND_PTR (b
));
230 /* Init a fence tail L. */
232 flist_tail_init (flist_tail_t l
)
234 FLIST_TAIL_HEAD (l
) = NULL
;
235 FLIST_TAIL_TAILP (l
) = &FLIST_TAIL_HEAD (l
);
238 /* Try to find fence corresponding to INSN in L. */
240 flist_lookup (flist_t l
, insn_t insn
)
244 if (FENCE_INSN (FLIST_FENCE (l
)) == insn
)
245 return FLIST_FENCE (l
);
253 /* Init the fields of F before running fill_insns. */
255 init_fence_for_scheduling (fence_t f
)
257 FENCE_BNDS (f
) = NULL
;
258 FENCE_PROCESSED_P (f
) = false;
259 FENCE_SCHEDULED_P (f
) = false;
262 /* Add new fence consisting of INSN and STATE to the list pointed to by LP. */
264 flist_add (flist_t
*lp
, insn_t insn
, state_t state
, deps_t dc
, void *tc
,
265 insn_t last_scheduled_insn
, vec
<rtx
, va_gc
> *executing_insns
,
266 int *ready_ticks
, int ready_ticks_size
, insn_t sched_next
,
267 int cycle
, int cycle_issued_insns
, int issue_more
,
268 bool starts_cycle_p
, bool after_stall_p
)
273 f
= FLIST_FENCE (*lp
);
275 FENCE_INSN (f
) = insn
;
277 gcc_assert (state
!= NULL
);
278 FENCE_STATE (f
) = state
;
280 FENCE_CYCLE (f
) = cycle
;
281 FENCE_ISSUED_INSNS (f
) = cycle_issued_insns
;
282 FENCE_STARTS_CYCLE_P (f
) = starts_cycle_p
;
283 FENCE_AFTER_STALL_P (f
) = after_stall_p
;
285 gcc_assert (dc
!= NULL
);
288 gcc_assert (tc
!= NULL
|| targetm
.sched
.alloc_sched_context
== NULL
);
291 FENCE_LAST_SCHEDULED_INSN (f
) = last_scheduled_insn
;
292 FENCE_ISSUE_MORE (f
) = issue_more
;
293 FENCE_EXECUTING_INSNS (f
) = executing_insns
;
294 FENCE_READY_TICKS (f
) = ready_ticks
;
295 FENCE_READY_TICKS_SIZE (f
) = ready_ticks_size
;
296 FENCE_SCHED_NEXT (f
) = sched_next
;
298 init_fence_for_scheduling (f
);
301 /* Remove the head node of the list pointed to by LP. */
303 flist_remove (flist_t
*lp
)
305 if (FENCE_INSN (FLIST_FENCE (*lp
)))
306 fence_clear (FLIST_FENCE (*lp
));
310 /* Clear the fence list pointed to by LP. */
312 flist_clear (flist_t
*lp
)
318 /* Add ORIGINAL_INSN the def list DL honoring CROSSES_CALL. */
320 def_list_add (def_list_t
*dl
, insn_t original_insn
, bool crosses_call
)
325 d
= DEF_LIST_DEF (*dl
);
327 d
->orig_insn
= original_insn
;
328 d
->crosses_call
= crosses_call
;
332 /* Functions to work with target contexts. */
334 /* Bulk target context. It is convenient for debugging purposes to ensure
335 that there are no uninitialized (null) target contexts. */
336 static tc_t bulk_tc
= (tc_t
) 1;
338 /* Target hooks wrappers. In the future we can provide some default
339 implementations for them. */
341 /* Allocate a store for the target context. */
343 alloc_target_context (void)
345 return (targetm
.sched
.alloc_sched_context
346 ? targetm
.sched
.alloc_sched_context () : bulk_tc
);
349 /* Init target context TC.
350 If CLEAN_P is true, then make TC as it is beginning of the scheduler.
351 Overwise, copy current backend context to TC. */
353 init_target_context (tc_t tc
, bool clean_p
)
355 if (targetm
.sched
.init_sched_context
)
356 targetm
.sched
.init_sched_context (tc
, clean_p
);
359 /* Allocate and initialize a target context. Meaning of CLEAN_P is the same as
360 int init_target_context (). */
362 create_target_context (bool clean_p
)
364 tc_t tc
= alloc_target_context ();
366 init_target_context (tc
, clean_p
);
370 /* Copy TC to the current backend context. */
372 set_target_context (tc_t tc
)
374 if (targetm
.sched
.set_sched_context
)
375 targetm
.sched
.set_sched_context (tc
);
378 /* TC is about to be destroyed. Free any internal data. */
380 clear_target_context (tc_t tc
)
382 if (targetm
.sched
.clear_sched_context
)
383 targetm
.sched
.clear_sched_context (tc
);
386 /* Clear and free it. */
388 delete_target_context (tc_t tc
)
390 clear_target_context (tc
);
392 if (targetm
.sched
.free_sched_context
)
393 targetm
.sched
.free_sched_context (tc
);
396 /* Make a copy of FROM in TO.
397 NB: May be this should be a hook. */
399 copy_target_context (tc_t to
, tc_t from
)
401 tc_t tmp
= create_target_context (false);
403 set_target_context (from
);
404 init_target_context (to
, false);
406 set_target_context (tmp
);
407 delete_target_context (tmp
);
410 /* Create a copy of TC. */
412 create_copy_of_target_context (tc_t tc
)
414 tc_t copy
= alloc_target_context ();
416 copy_target_context (copy
, tc
);
421 /* Clear TC and initialize it according to CLEAN_P. The meaning of CLEAN_P
422 is the same as in init_target_context (). */
424 reset_target_context (tc_t tc
, bool clean_p
)
426 clear_target_context (tc
);
427 init_target_context (tc
, clean_p
);
430 /* Functions to work with dependence contexts.
431 Dc (aka deps context, aka deps_t, aka struct deps_desc *) is short for dependence
432 context. It accumulates information about processed insns to decide if
433 current insn is dependent on the processed ones. */
435 /* Make a copy of FROM in TO. */
437 copy_deps_context (deps_t to
, deps_t from
)
439 init_deps (to
, false);
440 deps_join (to
, from
);
443 /* Allocate store for dep context. */
445 alloc_deps_context (void)
447 return XNEW (struct deps_desc
);
450 /* Allocate and initialize dep context. */
452 create_deps_context (void)
454 deps_t dc
= alloc_deps_context ();
456 init_deps (dc
, false);
460 /* Create a copy of FROM. */
462 create_copy_of_deps_context (deps_t from
)
464 deps_t to
= alloc_deps_context ();
466 copy_deps_context (to
, from
);
470 /* Clean up internal data of DC. */
472 clear_deps_context (deps_t dc
)
477 /* Clear and free DC. */
479 delete_deps_context (deps_t dc
)
481 clear_deps_context (dc
);
485 /* Clear and init DC. */
487 reset_deps_context (deps_t dc
)
489 clear_deps_context (dc
);
490 init_deps (dc
, false);
493 /* This structure describes the dependence analysis hooks for advancing
494 dependence context. */
495 static struct sched_deps_info_def advance_deps_context_sched_deps_info
=
499 NULL
, /* start_insn */
500 NULL
, /* finish_insn */
501 NULL
, /* start_lhs */
502 NULL
, /* finish_lhs */
503 NULL
, /* start_rhs */
504 NULL
, /* finish_rhs */
506 haifa_note_reg_clobber
,
508 NULL
, /* note_mem_dep */
514 /* Process INSN and add its impact on DC. */
516 advance_deps_context (deps_t dc
, insn_t insn
)
518 sched_deps_info
= &advance_deps_context_sched_deps_info
;
519 deps_analyze_insn (dc
, insn
);
523 /* Functions to work with DFA states. */
525 /* Allocate store for a DFA state. */
529 return xmalloc (dfa_state_size
);
532 /* Allocate and initialize DFA state. */
536 state_t state
= state_alloc ();
539 advance_state (state
);
543 /* Free DFA state. */
545 state_free (state_t state
)
550 /* Make a copy of FROM in TO. */
552 state_copy (state_t to
, state_t from
)
554 memcpy (to
, from
, dfa_state_size
);
557 /* Create a copy of FROM. */
559 state_create_copy (state_t from
)
561 state_t to
= state_alloc ();
563 state_copy (to
, from
);
568 /* Functions to work with fences. */
570 /* Clear the fence. */
572 fence_clear (fence_t f
)
574 state_t s
= FENCE_STATE (f
);
575 deps_t dc
= FENCE_DC (f
);
576 void *tc
= FENCE_TC (f
);
578 ilist_clear (&FENCE_BNDS (f
));
580 gcc_assert ((s
!= NULL
&& dc
!= NULL
&& tc
!= NULL
)
581 || (s
== NULL
&& dc
== NULL
&& tc
== NULL
));
586 delete_deps_context (dc
);
589 delete_target_context (tc
);
590 vec_free (FENCE_EXECUTING_INSNS (f
));
591 free (FENCE_READY_TICKS (f
));
592 FENCE_READY_TICKS (f
) = NULL
;
595 /* Init a list of fences with successors of OLD_FENCE. */
597 init_fences (insn_t old_fence
)
602 int ready_ticks_size
= get_max_uid () + 1;
604 FOR_EACH_SUCC_1 (succ
, si
, old_fence
,
605 SUCCS_NORMAL
| SUCCS_SKIP_TO_LOOP_EXITS
)
611 gcc_assert (flag_sel_sched_pipelining_outer_loops
);
613 flist_add (&fences
, succ
,
615 create_deps_context () /* dc */,
616 create_target_context (true) /* tc */,
617 NULL_RTX
/* last_scheduled_insn */,
618 NULL
, /* executing_insns */
619 XCNEWVEC (int, ready_ticks_size
), /* ready_ticks */
621 NULL_RTX
/* sched_next */,
622 1 /* cycle */, 0 /* cycle_issued_insns */,
623 issue_rate
, /* issue_more */
624 1 /* starts_cycle_p */, 0 /* after_stall_p */);
628 /* Merges two fences (filling fields of fence F with resulting values) by
629 following rules: 1) state, target context and last scheduled insn are
630 propagated from fallthrough edge if it is available;
631 2) deps context and cycle is propagated from more probable edge;
632 3) all other fields are set to corresponding constant values.
634 INSN, STATE, DC, TC, LAST_SCHEDULED_INSN, EXECUTING_INSNS,
635 READY_TICKS, READY_TICKS_SIZE, SCHED_NEXT, CYCLE, ISSUE_MORE
636 and AFTER_STALL_P are the corresponding fields of the second fence. */
638 merge_fences (fence_t f
, insn_t insn
,
639 state_t state
, deps_t dc
, void *tc
,
640 rtx last_scheduled_insn
, vec
<rtx
, va_gc
> *executing_insns
,
641 int *ready_ticks
, int ready_ticks_size
,
642 rtx sched_next
, int cycle
, int issue_more
, bool after_stall_p
)
644 insn_t last_scheduled_insn_old
= FENCE_LAST_SCHEDULED_INSN (f
);
646 gcc_assert (sel_bb_head_p (FENCE_INSN (f
))
647 && !sched_next
&& !FENCE_SCHED_NEXT (f
));
649 /* Check if we can decide which path fences came.
650 If we can't (or don't want to) - reset all. */
651 if (last_scheduled_insn
== NULL
652 || last_scheduled_insn_old
== NULL
653 /* This is a case when INSN is reachable on several paths from
654 one insn (this can happen when pipelining of outer loops is on and
655 there are two edges: one going around of inner loop and the other -
656 right through it; in such case just reset everything). */
657 || last_scheduled_insn
== last_scheduled_insn_old
)
659 state_reset (FENCE_STATE (f
));
662 reset_deps_context (FENCE_DC (f
));
663 delete_deps_context (dc
);
665 reset_target_context (FENCE_TC (f
), true);
666 delete_target_context (tc
);
668 if (cycle
> FENCE_CYCLE (f
))
669 FENCE_CYCLE (f
) = cycle
;
671 FENCE_LAST_SCHEDULED_INSN (f
) = NULL
;
672 FENCE_ISSUE_MORE (f
) = issue_rate
;
673 vec_free (executing_insns
);
675 if (FENCE_EXECUTING_INSNS (f
))
676 FENCE_EXECUTING_INSNS (f
)->block_remove (0,
677 FENCE_EXECUTING_INSNS (f
)->length ());
678 if (FENCE_READY_TICKS (f
))
679 memset (FENCE_READY_TICKS (f
), 0, FENCE_READY_TICKS_SIZE (f
));
683 edge edge_old
= NULL
, edge_new
= NULL
;
688 /* Find fallthrough edge. */
689 gcc_assert (BLOCK_FOR_INSN (insn
)->prev_bb
);
690 candidate
= find_fallthru_edge_from (BLOCK_FOR_INSN (insn
)->prev_bb
);
693 || (candidate
->src
!= BLOCK_FOR_INSN (last_scheduled_insn
)
694 && candidate
->src
!= BLOCK_FOR_INSN (last_scheduled_insn_old
)))
696 /* No fallthrough edge leading to basic block of INSN. */
697 state_reset (FENCE_STATE (f
));
700 reset_target_context (FENCE_TC (f
), true);
701 delete_target_context (tc
);
703 FENCE_LAST_SCHEDULED_INSN (f
) = NULL
;
704 FENCE_ISSUE_MORE (f
) = issue_rate
;
707 if (candidate
->src
== BLOCK_FOR_INSN (last_scheduled_insn
))
709 /* Would be weird if same insn is successor of several fallthrough
711 gcc_assert (BLOCK_FOR_INSN (insn
)->prev_bb
712 != BLOCK_FOR_INSN (last_scheduled_insn_old
));
714 state_free (FENCE_STATE (f
));
715 FENCE_STATE (f
) = state
;
717 delete_target_context (FENCE_TC (f
));
720 FENCE_LAST_SCHEDULED_INSN (f
) = last_scheduled_insn
;
721 FENCE_ISSUE_MORE (f
) = issue_more
;
725 /* Leave STATE, TC and LAST_SCHEDULED_INSN fields untouched. */
727 delete_target_context (tc
);
729 gcc_assert (BLOCK_FOR_INSN (insn
)->prev_bb
730 != BLOCK_FOR_INSN (last_scheduled_insn
));
733 /* Find edge of first predecessor (last_scheduled_insn_old->insn). */
734 FOR_EACH_SUCC_1 (succ
, si
, last_scheduled_insn_old
,
735 SUCCS_NORMAL
| SUCCS_SKIP_TO_LOOP_EXITS
)
739 /* No same successor allowed from several edges. */
740 gcc_assert (!edge_old
);
744 /* Find edge of second predecessor (last_scheduled_insn->insn). */
745 FOR_EACH_SUCC_1 (succ
, si
, last_scheduled_insn
,
746 SUCCS_NORMAL
| SUCCS_SKIP_TO_LOOP_EXITS
)
750 /* No same successor allowed from several edges. */
751 gcc_assert (!edge_new
);
756 /* Check if we can choose most probable predecessor. */
757 if (edge_old
== NULL
|| edge_new
== NULL
)
759 reset_deps_context (FENCE_DC (f
));
760 delete_deps_context (dc
);
761 vec_free (executing_insns
);
764 FENCE_CYCLE (f
) = MAX (FENCE_CYCLE (f
), cycle
);
765 if (FENCE_EXECUTING_INSNS (f
))
766 FENCE_EXECUTING_INSNS (f
)->block_remove (0,
767 FENCE_EXECUTING_INSNS (f
)->length ());
768 if (FENCE_READY_TICKS (f
))
769 memset (FENCE_READY_TICKS (f
), 0, FENCE_READY_TICKS_SIZE (f
));
772 if (edge_new
->probability
> edge_old
->probability
)
774 delete_deps_context (FENCE_DC (f
));
776 vec_free (FENCE_EXECUTING_INSNS (f
));
777 FENCE_EXECUTING_INSNS (f
) = executing_insns
;
778 free (FENCE_READY_TICKS (f
));
779 FENCE_READY_TICKS (f
) = ready_ticks
;
780 FENCE_READY_TICKS_SIZE (f
) = ready_ticks_size
;
781 FENCE_CYCLE (f
) = cycle
;
785 /* Leave DC and CYCLE untouched. */
786 delete_deps_context (dc
);
787 vec_free (executing_insns
);
792 /* Fill remaining invariant fields. */
794 FENCE_AFTER_STALL_P (f
) = 1;
796 FENCE_ISSUED_INSNS (f
) = 0;
797 FENCE_STARTS_CYCLE_P (f
) = 1;
798 FENCE_SCHED_NEXT (f
) = NULL
;
801 /* Add a new fence to NEW_FENCES list, initializing it from all
804 add_to_fences (flist_tail_t new_fences
, insn_t insn
,
805 state_t state
, deps_t dc
, void *tc
, rtx last_scheduled_insn
,
806 vec
<rtx
, va_gc
> *executing_insns
, int *ready_ticks
,
807 int ready_ticks_size
, rtx sched_next
, int cycle
,
808 int cycle_issued_insns
, int issue_rate
,
809 bool starts_cycle_p
, bool after_stall_p
)
811 fence_t f
= flist_lookup (FLIST_TAIL_HEAD (new_fences
), insn
);
815 flist_add (FLIST_TAIL_TAILP (new_fences
), insn
, state
, dc
, tc
,
816 last_scheduled_insn
, executing_insns
, ready_ticks
,
817 ready_ticks_size
, sched_next
, cycle
, cycle_issued_insns
,
818 issue_rate
, starts_cycle_p
, after_stall_p
);
820 FLIST_TAIL_TAILP (new_fences
)
821 = &FLIST_NEXT (*FLIST_TAIL_TAILP (new_fences
));
825 merge_fences (f
, insn
, state
, dc
, tc
, last_scheduled_insn
,
826 executing_insns
, ready_ticks
, ready_ticks_size
,
827 sched_next
, cycle
, issue_rate
, after_stall_p
);
831 /* Move the first fence in the OLD_FENCES list to NEW_FENCES. */
833 move_fence_to_fences (flist_t old_fences
, flist_tail_t new_fences
)
836 flist_t
*tailp
= FLIST_TAIL_TAILP (new_fences
);
838 old
= FLIST_FENCE (old_fences
);
839 f
= flist_lookup (FLIST_TAIL_HEAD (new_fences
),
840 FENCE_INSN (FLIST_FENCE (old_fences
)));
843 merge_fences (f
, old
->insn
, old
->state
, old
->dc
, old
->tc
,
844 old
->last_scheduled_insn
, old
->executing_insns
,
845 old
->ready_ticks
, old
->ready_ticks_size
,
846 old
->sched_next
, old
->cycle
, old
->issue_more
,
852 FLIST_TAIL_TAILP (new_fences
) = &FLIST_NEXT (*tailp
);
853 *FLIST_FENCE (*tailp
) = *old
;
854 init_fence_for_scheduling (FLIST_FENCE (*tailp
));
856 FENCE_INSN (old
) = NULL
;
859 /* Add a new fence to NEW_FENCES list and initialize most of its data
862 add_clean_fence_to_fences (flist_tail_t new_fences
, insn_t succ
, fence_t fence
)
864 int ready_ticks_size
= get_max_uid () + 1;
866 add_to_fences (new_fences
,
867 succ
, state_create (), create_deps_context (),
868 create_target_context (true),
870 XCNEWVEC (int, ready_ticks_size
), ready_ticks_size
,
871 NULL_RTX
, FENCE_CYCLE (fence
) + 1,
872 0, issue_rate
, 1, FENCE_AFTER_STALL_P (fence
));
875 /* Add a new fence to NEW_FENCES list and initialize all of its data
876 from FENCE and SUCC. */
878 add_dirty_fence_to_fences (flist_tail_t new_fences
, insn_t succ
, fence_t fence
)
880 int * new_ready_ticks
881 = XNEWVEC (int, FENCE_READY_TICKS_SIZE (fence
));
883 memcpy (new_ready_ticks
, FENCE_READY_TICKS (fence
),
884 FENCE_READY_TICKS_SIZE (fence
) * sizeof (int));
885 add_to_fences (new_fences
,
886 succ
, state_create_copy (FENCE_STATE (fence
)),
887 create_copy_of_deps_context (FENCE_DC (fence
)),
888 create_copy_of_target_context (FENCE_TC (fence
)),
889 FENCE_LAST_SCHEDULED_INSN (fence
),
890 vec_safe_copy (FENCE_EXECUTING_INSNS (fence
)),
892 FENCE_READY_TICKS_SIZE (fence
),
893 FENCE_SCHED_NEXT (fence
),
895 FENCE_ISSUED_INSNS (fence
),
896 FENCE_ISSUE_MORE (fence
),
897 FENCE_STARTS_CYCLE_P (fence
),
898 FENCE_AFTER_STALL_P (fence
));
902 /* Functions to work with regset and nop pools. */
904 /* Returns the new regset from pool. It might have some of the bits set
905 from the previous usage. */
907 get_regset_from_pool (void)
911 if (regset_pool
.n
!= 0)
912 rs
= regset_pool
.v
[--regset_pool
.n
];
914 /* We need to create the regset. */
916 rs
= ALLOC_REG_SET (®_obstack
);
918 if (regset_pool
.nn
== regset_pool
.ss
)
919 regset_pool
.vv
= XRESIZEVEC (regset
, regset_pool
.vv
,
920 (regset_pool
.ss
= 2 * regset_pool
.ss
+ 1));
921 regset_pool
.vv
[regset_pool
.nn
++] = rs
;
929 /* Same as above, but returns the empty regset. */
931 get_clear_regset_from_pool (void)
933 regset rs
= get_regset_from_pool ();
939 /* Return regset RS to the pool for future use. */
941 return_regset_to_pool (regset rs
)
946 if (regset_pool
.n
== regset_pool
.s
)
947 regset_pool
.v
= XRESIZEVEC (regset
, regset_pool
.v
,
948 (regset_pool
.s
= 2 * regset_pool
.s
+ 1));
949 regset_pool
.v
[regset_pool
.n
++] = rs
;
952 #ifdef ENABLE_CHECKING
953 /* This is used as a qsort callback for sorting regset pool stacks.
954 X and XX are addresses of two regsets. They are never equal. */
956 cmp_v_in_regset_pool (const void *x
, const void *xx
)
958 uintptr_t r1
= (uintptr_t) *((const regset
*) x
);
959 uintptr_t r2
= (uintptr_t) *((const regset
*) xx
);
968 /* Free the regset pool possibly checking for memory leaks. */
970 free_regset_pool (void)
972 #ifdef ENABLE_CHECKING
974 regset
*v
= regset_pool
.v
;
976 int n
= regset_pool
.n
;
978 regset
*vv
= regset_pool
.vv
;
980 int nn
= regset_pool
.nn
;
984 gcc_assert (n
<= nn
);
986 /* Sort both vectors so it will be possible to compare them. */
987 qsort (v
, n
, sizeof (*v
), cmp_v_in_regset_pool
);
988 qsort (vv
, nn
, sizeof (*vv
), cmp_v_in_regset_pool
);
995 /* VV[II] was lost. */
1001 gcc_assert (diff
== regset_pool
.diff
);
1005 /* If not true - we have a memory leak. */
1006 gcc_assert (regset_pool
.diff
== 0);
1008 while (regset_pool
.n
)
1011 FREE_REG_SET (regset_pool
.v
[regset_pool
.n
]);
1014 free (regset_pool
.v
);
1015 regset_pool
.v
= NULL
;
1018 free (regset_pool
.vv
);
1019 regset_pool
.vv
= NULL
;
1023 regset_pool
.diff
= 0;
1027 /* Functions to work with nop pools. NOP insns are used as temporary
1028 placeholders of the insns being scheduled to allow correct update of
1029 the data sets. When update is finished, NOPs are deleted. */
1031 /* A vinsn that is used to represent a nop. This vinsn is shared among all
1032 nops sel-sched generates. */
1033 static vinsn_t nop_vinsn
= NULL
;
1035 /* Emit a nop before INSN, taking it from pool. */
1037 get_nop_from_pool (insn_t insn
)
1040 bool old_p
= nop_pool
.n
!= 0;
1044 nop
= nop_pool
.v
[--nop_pool
.n
];
1048 nop
= emit_insn_before (nop
, insn
);
1051 flags
= INSN_INIT_TODO_SSID
;
1053 flags
= INSN_INIT_TODO_LUID
| INSN_INIT_TODO_SSID
;
1055 set_insn_init (INSN_EXPR (insn
), nop_vinsn
, INSN_SEQNO (insn
));
1056 sel_init_new_insn (nop
, flags
);
1061 /* Remove NOP from the instruction stream and return it to the pool. */
1063 return_nop_to_pool (insn_t nop
, bool full_tidying
)
1065 gcc_assert (INSN_IN_STREAM_P (nop
));
1066 sel_remove_insn (nop
, false, full_tidying
);
1068 /* We'll recycle this nop. */
1069 INSN_DELETED_P (nop
) = 0;
1071 if (nop_pool
.n
== nop_pool
.s
)
1072 nop_pool
.v
= XRESIZEVEC (rtx
, nop_pool
.v
,
1073 (nop_pool
.s
= 2 * nop_pool
.s
+ 1));
1074 nop_pool
.v
[nop_pool
.n
++] = nop
;
1077 /* Free the nop pool. */
1079 free_nop_pool (void)
1088 /* Skip unspec to support ia64 speculation. Called from rtx_equal_p_cb.
1089 The callback is given two rtxes XX and YY and writes the new rtxes
1090 to NX and NY in case some needs to be skipped. */
1092 skip_unspecs_callback (const_rtx
*xx
, const_rtx
*yy
, rtx
*nx
, rtx
* ny
)
1097 if (GET_CODE (x
) == UNSPEC
1098 && (targetm
.sched
.skip_rtx_p
== NULL
1099 || targetm
.sched
.skip_rtx_p (x
)))
1101 *nx
= XVECEXP (x
, 0, 0);
1102 *ny
= CONST_CAST_RTX (y
);
1106 if (GET_CODE (y
) == UNSPEC
1107 && (targetm
.sched
.skip_rtx_p
== NULL
1108 || targetm
.sched
.skip_rtx_p (y
)))
1110 *nx
= CONST_CAST_RTX (x
);
1111 *ny
= XVECEXP (y
, 0, 0);
1118 /* Callback, called from hash_rtx_cb. Helps to hash UNSPEC rtx X in a correct way
1119 to support ia64 speculation. When changes are needed, new rtx X and new mode
1120 NMODE are written, and the callback returns true. */
1122 hash_with_unspec_callback (const_rtx x
, enum machine_mode mode ATTRIBUTE_UNUSED
,
1123 rtx
*nx
, enum machine_mode
* nmode
)
1125 if (GET_CODE (x
) == UNSPEC
1126 && targetm
.sched
.skip_rtx_p
1127 && targetm
.sched
.skip_rtx_p (x
))
1129 *nx
= XVECEXP (x
, 0 ,0);
1137 /* Returns LHS and RHS are ok to be scheduled separately. */
1139 lhs_and_rhs_separable_p (rtx lhs
, rtx rhs
)
1141 if (lhs
== NULL
|| rhs
== NULL
)
1144 /* Do not schedule constants as rhs: no point to use reg, if const
1145 can be used. Moreover, scheduling const as rhs may lead to mode
1146 mismatch cause consts don't have modes but they could be merged
1147 from branches where the same const used in different modes. */
1148 if (CONSTANT_P (rhs
))
1151 /* ??? Do not rename predicate registers to avoid ICEs in bundling. */
1152 if (COMPARISON_P (rhs
))
1155 /* Do not allow single REG to be an rhs. */
1159 /* See comment at find_used_regs_1 (*1) for explanation of this
1161 /* FIXME: remove this later. */
1165 /* This will filter all tricky things like ZERO_EXTRACT etc.
1166 For now we don't handle it. */
1167 if (!REG_P (lhs
) && !MEM_P (lhs
))
1173 /* Initialize vinsn VI for INSN. Only for use from vinsn_create (). When
1174 FORCE_UNIQUE_P is true, the resulting vinsn will not be clonable. This is
1175 used e.g. for insns from recovery blocks. */
1177 vinsn_init (vinsn_t vi
, insn_t insn
, bool force_unique_p
)
1179 hash_rtx_callback_function hrcf
;
1182 VINSN_INSN_RTX (vi
) = insn
;
1183 VINSN_COUNT (vi
) = 0;
1186 if (INSN_NOP_P (insn
))
1189 if (DF_INSN_UID_SAFE_GET (INSN_UID (insn
)) != NULL
)
1190 init_id_from_df (VINSN_ID (vi
), insn
, force_unique_p
);
1192 deps_init_id (VINSN_ID (vi
), insn
, force_unique_p
);
1194 /* Hash vinsn depending on whether it is separable or not. */
1195 hrcf
= targetm
.sched
.skip_rtx_p
? hash_with_unspec_callback
: NULL
;
1196 if (VINSN_SEPARABLE_P (vi
))
1198 rtx rhs
= VINSN_RHS (vi
);
1200 VINSN_HASH (vi
) = hash_rtx_cb (rhs
, GET_MODE (rhs
),
1201 NULL
, NULL
, false, hrcf
);
1202 VINSN_HASH_RTX (vi
) = hash_rtx_cb (VINSN_PATTERN (vi
),
1203 VOIDmode
, NULL
, NULL
,
1208 VINSN_HASH (vi
) = hash_rtx_cb (VINSN_PATTERN (vi
), VOIDmode
,
1209 NULL
, NULL
, false, hrcf
);
1210 VINSN_HASH_RTX (vi
) = VINSN_HASH (vi
);
1213 insn_class
= haifa_classify_insn (insn
);
1215 && (!targetm
.sched
.get_insn_spec_ds
1216 || ((targetm
.sched
.get_insn_spec_ds (insn
) & BEGIN_CONTROL
)
1218 VINSN_MAY_TRAP_P (vi
) = true;
1220 VINSN_MAY_TRAP_P (vi
) = false;
1223 /* Indicate that VI has become the part of an rtx object. */
1225 vinsn_attach (vinsn_t vi
)
1227 /* Assert that VI is not pending for deletion. */
1228 gcc_assert (VINSN_INSN_RTX (vi
));
1233 /* Create and init VI from the INSN. Use UNIQUE_P for determining the correct
1236 vinsn_create (insn_t insn
, bool force_unique_p
)
1238 vinsn_t vi
= XCNEW (struct vinsn_def
);
1240 vinsn_init (vi
, insn
, force_unique_p
);
1244 /* Return a copy of VI. When REATTACH_P is true, detach VI and attach
1247 vinsn_copy (vinsn_t vi
, bool reattach_p
)
1250 bool unique
= VINSN_UNIQUE_P (vi
);
1253 copy
= create_copy_of_insn_rtx (VINSN_INSN_RTX (vi
));
1254 new_vi
= create_vinsn_from_insn_rtx (copy
, unique
);
1258 vinsn_attach (new_vi
);
1264 /* Delete the VI vinsn and free its data. */
1266 vinsn_delete (vinsn_t vi
)
1268 gcc_assert (VINSN_COUNT (vi
) == 0);
1270 if (!INSN_NOP_P (VINSN_INSN_RTX (vi
)))
1272 return_regset_to_pool (VINSN_REG_SETS (vi
));
1273 return_regset_to_pool (VINSN_REG_USES (vi
));
1274 return_regset_to_pool (VINSN_REG_CLOBBERS (vi
));
1280 /* Indicate that VI is no longer a part of some rtx object.
1281 Remove VI if it is no longer needed. */
1283 vinsn_detach (vinsn_t vi
)
1285 gcc_assert (VINSN_COUNT (vi
) > 0);
1287 if (--VINSN_COUNT (vi
) == 0)
1291 /* Returns TRUE if VI is a branch. */
1293 vinsn_cond_branch_p (vinsn_t vi
)
1297 if (!VINSN_UNIQUE_P (vi
))
1300 insn
= VINSN_INSN_RTX (vi
);
1301 if (BB_END (BLOCK_FOR_INSN (insn
)) != insn
)
1304 return control_flow_insn_p (insn
);
1307 /* Return latency of INSN. */
1309 sel_insn_rtx_cost (rtx insn
)
1313 /* A USE insn, or something else we don't need to
1314 understand. We can't pass these directly to
1315 result_ready_cost or insn_default_latency because it will
1316 trigger a fatal error for unrecognizable insns. */
1317 if (recog_memoized (insn
) < 0)
1321 cost
= insn_default_latency (insn
);
1330 /* Return the cost of the VI.
1331 !!! FIXME: Unify with haifa-sched.c: insn_cost (). */
1333 sel_vinsn_cost (vinsn_t vi
)
1335 int cost
= vi
->cost
;
1339 cost
= sel_insn_rtx_cost (VINSN_INSN_RTX (vi
));
1347 /* Functions for insn emitting. */
1349 /* Emit new insn after AFTER based on PATTERN and initialize its data from
1352 sel_gen_insn_from_rtx_after (rtx pattern
, expr_t expr
, int seqno
, insn_t after
)
1356 gcc_assert (EXPR_TARGET_AVAILABLE (expr
) == true);
1358 new_insn
= emit_insn_after (pattern
, after
);
1359 set_insn_init (expr
, NULL
, seqno
);
1360 sel_init_new_insn (new_insn
, INSN_INIT_TODO_LUID
| INSN_INIT_TODO_SSID
);
1365 /* Force newly generated vinsns to be unique. */
1366 static bool init_insn_force_unique_p
= false;
1368 /* Emit new speculation recovery insn after AFTER based on PATTERN and
1369 initialize its data from EXPR and SEQNO. */
1371 sel_gen_recovery_insn_from_rtx_after (rtx pattern
, expr_t expr
, int seqno
,
1376 gcc_assert (!init_insn_force_unique_p
);
1378 init_insn_force_unique_p
= true;
1379 insn
= sel_gen_insn_from_rtx_after (pattern
, expr
, seqno
, after
);
1380 CANT_MOVE (insn
) = 1;
1381 init_insn_force_unique_p
= false;
1386 /* Emit new insn after AFTER based on EXPR and SEQNO. If VINSN is not NULL,
1387 take it as a new vinsn instead of EXPR's vinsn.
1388 We simplify insns later, after scheduling region in
1389 simplify_changed_insns. */
1391 sel_gen_insn_from_expr_after (expr_t expr
, vinsn_t vinsn
, int seqno
,
1398 emit_expr
= set_insn_init (expr
, vinsn
? vinsn
: EXPR_VINSN (expr
),
1400 insn
= EXPR_INSN_RTX (emit_expr
);
1402 /* The insn may come from the transformation cache, which may hold already
1403 deleted insns, so mark it as not deleted. */
1404 INSN_DELETED_P (insn
) = 0;
1406 add_insn_after (insn
, after
, BLOCK_FOR_INSN (insn
));
1408 flags
= INSN_INIT_TODO_SSID
;
1409 if (INSN_LUID (insn
) == 0)
1410 flags
|= INSN_INIT_TODO_LUID
;
1411 sel_init_new_insn (insn
, flags
);
1416 /* Move insn from EXPR after AFTER. */
1418 sel_move_insn (expr_t expr
, int seqno
, insn_t after
)
1420 insn_t insn
= EXPR_INSN_RTX (expr
);
1421 basic_block bb
= BLOCK_FOR_INSN (after
);
1422 insn_t next
= NEXT_INSN (after
);
1424 /* Assert that in move_op we disconnected this insn properly. */
1425 gcc_assert (EXPR_VINSN (INSN_EXPR (insn
)) != NULL
);
1426 PREV_INSN (insn
) = after
;
1427 NEXT_INSN (insn
) = next
;
1429 NEXT_INSN (after
) = insn
;
1430 PREV_INSN (next
) = insn
;
1432 /* Update links from insn to bb and vice versa. */
1433 df_insn_change_bb (insn
, bb
);
1434 if (BB_END (bb
) == after
)
1437 prepare_insn_expr (insn
, seqno
);
1442 /* Functions to work with right-hand sides. */
1444 /* Search for a hash value determined by UID/NEW_VINSN in a sorted vector
1445 VECT and return true when found. Use NEW_VINSN for comparison only when
1446 COMPARE_VINSNS is true. Write to INDP the index on which
1447 the search has stopped, such that inserting the new element at INDP will
1448 retain VECT's sort order. */
1450 find_in_history_vect_1 (vec
<expr_history_def
> vect
,
1451 unsigned uid
, vinsn_t new_vinsn
,
1452 bool compare_vinsns
, int *indp
)
1454 expr_history_def
*arr
;
1455 int i
, j
, len
= vect
.length ();
1463 arr
= vect
.address ();
1468 unsigned auid
= arr
[i
].uid
;
1469 vinsn_t avinsn
= arr
[i
].new_expr_vinsn
;
1472 /* When undoing transformation on a bookkeeping copy, the new vinsn
1473 may not be exactly equal to the one that is saved in the vector.
1474 This is because the insn whose copy we're checking was possibly
1475 substituted itself. */
1476 && (! compare_vinsns
1477 || vinsn_equal_p (avinsn
, new_vinsn
)))
1482 else if (auid
> uid
)
1491 /* Search for a uid of INSN and NEW_VINSN in a sorted vector VECT. Return
1492 the position found or -1, if no such value is in vector.
1493 Search also for UIDs of insn's originators, if ORIGINATORS_P is true. */
1495 find_in_history_vect (vec
<expr_history_def
> vect
, rtx insn
,
1496 vinsn_t new_vinsn
, bool originators_p
)
1500 if (find_in_history_vect_1 (vect
, INSN_UID (insn
), new_vinsn
,
1504 if (INSN_ORIGINATORS (insn
) && originators_p
)
1509 EXECUTE_IF_SET_IN_BITMAP (INSN_ORIGINATORS (insn
), 0, uid
, bi
)
1510 if (find_in_history_vect_1 (vect
, uid
, new_vinsn
, false, &ind
))
1517 /* Insert new element in a sorted history vector pointed to by PVECT,
1518 if it is not there already. The element is searched using
1519 UID/NEW_EXPR_VINSN pair. TYPE, OLD_EXPR_VINSN and SPEC_DS save
1520 the history of a transformation. */
1522 insert_in_history_vect (vec
<expr_history_def
> *pvect
,
1523 unsigned uid
, enum local_trans_type type
,
1524 vinsn_t old_expr_vinsn
, vinsn_t new_expr_vinsn
,
1527 vec
<expr_history_def
> vect
= *pvect
;
1528 expr_history_def temp
;
1532 res
= find_in_history_vect_1 (vect
, uid
, new_expr_vinsn
, true, &ind
);
1536 expr_history_def
*phist
= &vect
[ind
];
1538 /* It is possible that speculation types of expressions that were
1539 propagated through different paths will be different here. In this
1540 case, merge the status to get the correct check later. */
1541 if (phist
->spec_ds
!= spec_ds
)
1542 phist
->spec_ds
= ds_max_merge (phist
->spec_ds
, spec_ds
);
1547 temp
.old_expr_vinsn
= old_expr_vinsn
;
1548 temp
.new_expr_vinsn
= new_expr_vinsn
;
1549 temp
.spec_ds
= spec_ds
;
1552 vinsn_attach (old_expr_vinsn
);
1553 vinsn_attach (new_expr_vinsn
);
1554 vect
.safe_insert (ind
, temp
);
1558 /* Free history vector PVECT. */
1560 free_history_vect (vec
<expr_history_def
> &pvect
)
1563 expr_history_def
*phist
;
1565 if (! pvect
.exists ())
1568 for (i
= 0; pvect
.iterate (i
, &phist
); i
++)
1570 vinsn_detach (phist
->old_expr_vinsn
);
1571 vinsn_detach (phist
->new_expr_vinsn
);
1577 /* Merge vector FROM to PVECT. */
1579 merge_history_vect (vec
<expr_history_def
> *pvect
,
1580 vec
<expr_history_def
> from
)
1582 expr_history_def
*phist
;
1585 /* We keep this vector sorted. */
1586 for (i
= 0; from
.iterate (i
, &phist
); i
++)
1587 insert_in_history_vect (pvect
, phist
->uid
, phist
->type
,
1588 phist
->old_expr_vinsn
, phist
->new_expr_vinsn
,
1592 /* Compare two vinsns as rhses if possible and as vinsns otherwise. */
1594 vinsn_equal_p (vinsn_t x
, vinsn_t y
)
1596 rtx_equal_p_callback_function repcf
;
1601 if (VINSN_TYPE (x
) != VINSN_TYPE (y
))
1604 if (VINSN_HASH (x
) != VINSN_HASH (y
))
1607 repcf
= targetm
.sched
.skip_rtx_p
? skip_unspecs_callback
: NULL
;
1608 if (VINSN_SEPARABLE_P (x
))
1610 /* Compare RHSes of VINSNs. */
1611 gcc_assert (VINSN_RHS (x
));
1612 gcc_assert (VINSN_RHS (y
));
1614 return rtx_equal_p_cb (VINSN_RHS (x
), VINSN_RHS (y
), repcf
);
1617 return rtx_equal_p_cb (VINSN_PATTERN (x
), VINSN_PATTERN (y
), repcf
);
1621 /* Functions for working with expressions. */
1623 /* Initialize EXPR. */
1625 init_expr (expr_t expr
, vinsn_t vi
, int spec
, int use
, int priority
,
1626 int sched_times
, int orig_bb_index
, ds_t spec_done_ds
,
1627 ds_t spec_to_check_ds
, int orig_sched_cycle
,
1628 vec
<expr_history_def
> history
,
1629 signed char target_available
,
1630 bool was_substituted
, bool was_renamed
, bool needs_spec_check_p
,
1635 EXPR_VINSN (expr
) = vi
;
1636 EXPR_SPEC (expr
) = spec
;
1637 EXPR_USEFULNESS (expr
) = use
;
1638 EXPR_PRIORITY (expr
) = priority
;
1639 EXPR_PRIORITY_ADJ (expr
) = 0;
1640 EXPR_SCHED_TIMES (expr
) = sched_times
;
1641 EXPR_ORIG_BB_INDEX (expr
) = orig_bb_index
;
1642 EXPR_ORIG_SCHED_CYCLE (expr
) = orig_sched_cycle
;
1643 EXPR_SPEC_DONE_DS (expr
) = spec_done_ds
;
1644 EXPR_SPEC_TO_CHECK_DS (expr
) = spec_to_check_ds
;
1646 if (history
.exists ())
1647 EXPR_HISTORY_OF_CHANGES (expr
) = history
;
1649 EXPR_HISTORY_OF_CHANGES (expr
).create (0);
1651 EXPR_TARGET_AVAILABLE (expr
) = target_available
;
1652 EXPR_WAS_SUBSTITUTED (expr
) = was_substituted
;
1653 EXPR_WAS_RENAMED (expr
) = was_renamed
;
1654 EXPR_NEEDS_SPEC_CHECK_P (expr
) = needs_spec_check_p
;
1655 EXPR_CANT_MOVE (expr
) = cant_move
;
1658 /* Make a copy of the expr FROM into the expr TO. */
1660 copy_expr (expr_t to
, expr_t from
)
1662 vec
<expr_history_def
> temp
= vNULL
;
1664 if (EXPR_HISTORY_OF_CHANGES (from
).exists ())
1667 expr_history_def
*phist
;
1669 temp
= EXPR_HISTORY_OF_CHANGES (from
).copy ();
1671 temp
.iterate (i
, &phist
);
1674 vinsn_attach (phist
->old_expr_vinsn
);
1675 vinsn_attach (phist
->new_expr_vinsn
);
1679 init_expr (to
, EXPR_VINSN (from
), EXPR_SPEC (from
),
1680 EXPR_USEFULNESS (from
), EXPR_PRIORITY (from
),
1681 EXPR_SCHED_TIMES (from
), EXPR_ORIG_BB_INDEX (from
),
1682 EXPR_SPEC_DONE_DS (from
), EXPR_SPEC_TO_CHECK_DS (from
),
1683 EXPR_ORIG_SCHED_CYCLE (from
), temp
,
1684 EXPR_TARGET_AVAILABLE (from
), EXPR_WAS_SUBSTITUTED (from
),
1685 EXPR_WAS_RENAMED (from
), EXPR_NEEDS_SPEC_CHECK_P (from
),
1686 EXPR_CANT_MOVE (from
));
1689 /* Same, but the final expr will not ever be in av sets, so don't copy
1690 "uninteresting" data such as bitmap cache. */
1692 copy_expr_onside (expr_t to
, expr_t from
)
1694 init_expr (to
, EXPR_VINSN (from
), EXPR_SPEC (from
), EXPR_USEFULNESS (from
),
1695 EXPR_PRIORITY (from
), EXPR_SCHED_TIMES (from
), 0,
1696 EXPR_SPEC_DONE_DS (from
), EXPR_SPEC_TO_CHECK_DS (from
), 0,
1698 EXPR_TARGET_AVAILABLE (from
), EXPR_WAS_SUBSTITUTED (from
),
1699 EXPR_WAS_RENAMED (from
), EXPR_NEEDS_SPEC_CHECK_P (from
),
1700 EXPR_CANT_MOVE (from
));
1703 /* Prepare the expr of INSN for scheduling. Used when moving insn and when
1704 initializing new insns. */
1706 prepare_insn_expr (insn_t insn
, int seqno
)
1708 expr_t expr
= INSN_EXPR (insn
);
1711 INSN_SEQNO (insn
) = seqno
;
1712 EXPR_ORIG_BB_INDEX (expr
) = BLOCK_NUM (insn
);
1713 EXPR_SPEC (expr
) = 0;
1714 EXPR_ORIG_SCHED_CYCLE (expr
) = 0;
1715 EXPR_WAS_SUBSTITUTED (expr
) = 0;
1716 EXPR_WAS_RENAMED (expr
) = 0;
1717 EXPR_TARGET_AVAILABLE (expr
) = 1;
1718 INSN_LIVE_VALID_P (insn
) = false;
1720 /* ??? If this expression is speculative, make its dependence
1721 as weak as possible. We can filter this expression later
1722 in process_spec_exprs, because we do not distinguish
1723 between the status we got during compute_av_set and the
1724 existing status. To be fixed. */
1725 ds
= EXPR_SPEC_DONE_DS (expr
);
1727 EXPR_SPEC_DONE_DS (expr
) = ds_get_max_dep_weak (ds
);
1729 free_history_vect (EXPR_HISTORY_OF_CHANGES (expr
));
1732 /* Update target_available bits when merging exprs TO and FROM. SPLIT_POINT
1733 is non-null when expressions are merged from different successors at
1736 update_target_availability (expr_t to
, expr_t from
, insn_t split_point
)
1738 if (EXPR_TARGET_AVAILABLE (to
) < 0
1739 || EXPR_TARGET_AVAILABLE (from
) < 0)
1740 EXPR_TARGET_AVAILABLE (to
) = -1;
1743 /* We try to detect the case when one of the expressions
1744 can only be reached through another one. In this case,
1745 we can do better. */
1746 if (split_point
== NULL
)
1750 toind
= EXPR_ORIG_BB_INDEX (to
);
1751 fromind
= EXPR_ORIG_BB_INDEX (from
);
1753 if (toind
&& toind
== fromind
)
1754 /* Do nothing -- everything is done in
1755 merge_with_other_exprs. */
1758 EXPR_TARGET_AVAILABLE (to
) = -1;
1760 else if (EXPR_TARGET_AVAILABLE (from
) == 0
1762 && REG_P (EXPR_LHS (from
))
1763 && REGNO (EXPR_LHS (to
)) != REGNO (EXPR_LHS (from
)))
1764 EXPR_TARGET_AVAILABLE (to
) = -1;
1766 EXPR_TARGET_AVAILABLE (to
) &= EXPR_TARGET_AVAILABLE (from
);
1770 /* Update speculation bits when merging exprs TO and FROM. SPLIT_POINT
1771 is non-null when expressions are merged from different successors at
1774 update_speculative_bits (expr_t to
, expr_t from
, insn_t split_point
)
1776 ds_t old_to_ds
, old_from_ds
;
1778 old_to_ds
= EXPR_SPEC_DONE_DS (to
);
1779 old_from_ds
= EXPR_SPEC_DONE_DS (from
);
1781 EXPR_SPEC_DONE_DS (to
) = ds_max_merge (old_to_ds
, old_from_ds
);
1782 EXPR_SPEC_TO_CHECK_DS (to
) |= EXPR_SPEC_TO_CHECK_DS (from
);
1783 EXPR_NEEDS_SPEC_CHECK_P (to
) |= EXPR_NEEDS_SPEC_CHECK_P (from
);
1785 /* When merging e.g. control & data speculative exprs, or a control
1786 speculative with a control&data speculative one, we really have
1787 to change vinsn too. Also, when speculative status is changed,
1788 we also need to record this as a transformation in expr's history. */
1789 if ((old_to_ds
& SPECULATIVE
) || (old_from_ds
& SPECULATIVE
))
1791 old_to_ds
= ds_get_speculation_types (old_to_ds
);
1792 old_from_ds
= ds_get_speculation_types (old_from_ds
);
1794 if (old_to_ds
!= old_from_ds
)
1798 /* When both expressions are speculative, we need to change
1800 if ((old_to_ds
& SPECULATIVE
) && (old_from_ds
& SPECULATIVE
))
1804 res
= speculate_expr (to
, EXPR_SPEC_DONE_DS (to
));
1805 gcc_assert (res
>= 0);
1808 if (split_point
!= NULL
)
1810 /* Record the change with proper status. */
1811 record_ds
= EXPR_SPEC_DONE_DS (to
) & SPECULATIVE
;
1812 record_ds
&= ~(old_to_ds
& SPECULATIVE
);
1813 record_ds
&= ~(old_from_ds
& SPECULATIVE
);
1815 insert_in_history_vect (&EXPR_HISTORY_OF_CHANGES (to
),
1816 INSN_UID (split_point
), TRANS_SPECULATION
,
1817 EXPR_VINSN (from
), EXPR_VINSN (to
),
1825 /* Merge bits of FROM expr to TO expr. When SPLIT_POINT is not NULL,
1826 this is done along different paths. */
1828 merge_expr_data (expr_t to
, expr_t from
, insn_t split_point
)
1830 /* Choose the maximum of the specs of merged exprs. This is required
1831 for correctness of bookkeeping. */
1832 if (EXPR_SPEC (to
) < EXPR_SPEC (from
))
1833 EXPR_SPEC (to
) = EXPR_SPEC (from
);
1836 EXPR_USEFULNESS (to
) += EXPR_USEFULNESS (from
);
1838 EXPR_USEFULNESS (to
) = MAX (EXPR_USEFULNESS (to
),
1839 EXPR_USEFULNESS (from
));
1841 if (EXPR_PRIORITY (to
) < EXPR_PRIORITY (from
))
1842 EXPR_PRIORITY (to
) = EXPR_PRIORITY (from
);
1844 if (EXPR_SCHED_TIMES (to
) > EXPR_SCHED_TIMES (from
))
1845 EXPR_SCHED_TIMES (to
) = EXPR_SCHED_TIMES (from
);
1847 if (EXPR_ORIG_BB_INDEX (to
) != EXPR_ORIG_BB_INDEX (from
))
1848 EXPR_ORIG_BB_INDEX (to
) = 0;
1850 EXPR_ORIG_SCHED_CYCLE (to
) = MIN (EXPR_ORIG_SCHED_CYCLE (to
),
1851 EXPR_ORIG_SCHED_CYCLE (from
));
1853 EXPR_WAS_SUBSTITUTED (to
) |= EXPR_WAS_SUBSTITUTED (from
);
1854 EXPR_WAS_RENAMED (to
) |= EXPR_WAS_RENAMED (from
);
1855 EXPR_CANT_MOVE (to
) |= EXPR_CANT_MOVE (from
);
1857 merge_history_vect (&EXPR_HISTORY_OF_CHANGES (to
),
1858 EXPR_HISTORY_OF_CHANGES (from
));
1859 update_target_availability (to
, from
, split_point
);
1860 update_speculative_bits (to
, from
, split_point
);
1863 /* Merge bits of FROM expr to TO expr. Vinsns in the exprs should be equal
1864 in terms of vinsn_equal_p. SPLIT_POINT is non-null when expressions
1865 are merged from different successors at a split point. */
1867 merge_expr (expr_t to
, expr_t from
, insn_t split_point
)
1869 vinsn_t to_vi
= EXPR_VINSN (to
);
1870 vinsn_t from_vi
= EXPR_VINSN (from
);
1872 gcc_assert (vinsn_equal_p (to_vi
, from_vi
));
1874 /* Make sure that speculative pattern is propagated into exprs that
1875 have non-speculative one. This will provide us with consistent
1876 speculative bits and speculative patterns inside expr. */
1877 if ((EXPR_SPEC_DONE_DS (from
) != 0
1878 && EXPR_SPEC_DONE_DS (to
) == 0)
1879 /* Do likewise for volatile insns, so that we always retain
1880 the may_trap_p bit on the resulting expression. */
1881 || (VINSN_MAY_TRAP_P (EXPR_VINSN (from
))
1882 && !VINSN_MAY_TRAP_P (EXPR_VINSN (to
))))
1883 change_vinsn_in_expr (to
, EXPR_VINSN (from
));
1885 merge_expr_data (to
, from
, split_point
);
1886 gcc_assert (EXPR_USEFULNESS (to
) <= REG_BR_PROB_BASE
);
1889 /* Clear the information of this EXPR. */
1891 clear_expr (expr_t expr
)
1894 vinsn_detach (EXPR_VINSN (expr
));
1895 EXPR_VINSN (expr
) = NULL
;
1897 free_history_vect (EXPR_HISTORY_OF_CHANGES (expr
));
1900 /* For a given LV_SET, mark EXPR having unavailable target register. */
1902 set_unavailable_target_for_expr (expr_t expr
, regset lv_set
)
1904 if (EXPR_SEPARABLE_P (expr
))
1906 if (REG_P (EXPR_LHS (expr
))
1907 && register_unavailable_p (lv_set
, EXPR_LHS (expr
)))
1909 /* If it's an insn like r1 = use (r1, ...), and it exists in
1910 different forms in each of the av_sets being merged, we can't say
1911 whether original destination register is available or not.
1912 However, this still works if destination register is not used
1913 in the original expression: if the branch at which LV_SET we're
1914 looking here is not actually 'other branch' in sense that same
1915 expression is available through it (but it can't be determined
1916 at computation stage because of transformations on one of the
1917 branches), it still won't affect the availability.
1918 Liveness of a register somewhere on a code motion path means
1919 it's either read somewhere on a codemotion path, live on
1920 'other' branch, live at the point immediately following
1921 the original operation, or is read by the original operation.
1922 The latter case is filtered out in the condition below.
1923 It still doesn't cover the case when register is defined and used
1924 somewhere within the code motion path, and in this case we could
1925 miss a unifying code motion along both branches using a renamed
1926 register, but it won't affect a code correctness since upon
1927 an actual code motion a bookkeeping code would be generated. */
1928 if (register_unavailable_p (VINSN_REG_USES (EXPR_VINSN (expr
)),
1930 EXPR_TARGET_AVAILABLE (expr
) = -1;
1932 EXPR_TARGET_AVAILABLE (expr
) = false;
1938 reg_set_iterator rsi
;
1940 EXECUTE_IF_SET_IN_REG_SET (VINSN_REG_SETS (EXPR_VINSN (expr
)),
1942 if (bitmap_bit_p (lv_set
, regno
))
1944 EXPR_TARGET_AVAILABLE (expr
) = false;
1948 EXECUTE_IF_SET_IN_REG_SET (VINSN_REG_CLOBBERS (EXPR_VINSN (expr
)),
1950 if (bitmap_bit_p (lv_set
, regno
))
1952 EXPR_TARGET_AVAILABLE (expr
) = false;
1958 /* Try to make EXPR speculative. Return 1 when EXPR's pattern
1959 or dependence status have changed, 2 when also the target register
1960 became unavailable, 0 if nothing had to be changed. */
1962 speculate_expr (expr_t expr
, ds_t ds
)
1967 ds_t target_ds
, current_ds
;
1969 /* Obtain the status we need to put on EXPR. */
1970 target_ds
= (ds
& SPECULATIVE
);
1971 current_ds
= EXPR_SPEC_DONE_DS (expr
);
1972 ds
= ds_full_merge (current_ds
, target_ds
, NULL_RTX
, NULL_RTX
);
1974 orig_insn_rtx
= EXPR_INSN_RTX (expr
);
1976 res
= sched_speculate_insn (orig_insn_rtx
, ds
, &spec_pat
);
1981 EXPR_SPEC_DONE_DS (expr
) = ds
;
1982 return current_ds
!= ds
? 1 : 0;
1986 rtx spec_insn_rtx
= create_insn_rtx_from_pattern (spec_pat
, NULL_RTX
);
1987 vinsn_t spec_vinsn
= create_vinsn_from_insn_rtx (spec_insn_rtx
, false);
1989 change_vinsn_in_expr (expr
, spec_vinsn
);
1990 EXPR_SPEC_DONE_DS (expr
) = ds
;
1991 EXPR_NEEDS_SPEC_CHECK_P (expr
) = true;
1993 /* Do not allow clobbering the address register of speculative
1995 if (register_unavailable_p (VINSN_REG_USES (EXPR_VINSN (expr
)),
1996 expr_dest_reg (expr
)))
1998 EXPR_TARGET_AVAILABLE (expr
) = false;
2014 /* Return a destination register, if any, of EXPR. */
2016 expr_dest_reg (expr_t expr
)
2018 rtx dest
= VINSN_LHS (EXPR_VINSN (expr
));
2020 if (dest
!= NULL_RTX
&& REG_P (dest
))
2026 /* Returns the REGNO of the R's destination. */
2028 expr_dest_regno (expr_t expr
)
2030 rtx dest
= expr_dest_reg (expr
);
2032 gcc_assert (dest
!= NULL_RTX
);
2033 return REGNO (dest
);
2036 /* For a given LV_SET, mark all expressions in JOIN_SET, but not present in
2037 AV_SET having unavailable target register. */
2039 mark_unavailable_targets (av_set_t join_set
, av_set_t av_set
, regset lv_set
)
2042 av_set_iterator avi
;
2044 FOR_EACH_EXPR (expr
, avi
, join_set
)
2045 if (av_set_lookup (av_set
, EXPR_VINSN (expr
)) == NULL
)
2046 set_unavailable_target_for_expr (expr
, lv_set
);
2050 /* Returns true if REG (at least partially) is present in REGS. */
2052 register_unavailable_p (regset regs
, rtx reg
)
2054 unsigned regno
, end_regno
;
2056 regno
= REGNO (reg
);
2057 if (bitmap_bit_p (regs
, regno
))
2060 end_regno
= END_REGNO (reg
);
2062 while (++regno
< end_regno
)
2063 if (bitmap_bit_p (regs
, regno
))
2069 /* Av set functions. */
2071 /* Add a new element to av set SETP.
2072 Return the element added. */
2074 av_set_add_element (av_set_t
*setp
)
2076 /* Insert at the beginning of the list. */
2081 /* Add EXPR to SETP. */
2083 av_set_add (av_set_t
*setp
, expr_t expr
)
2087 gcc_assert (!INSN_NOP_P (EXPR_INSN_RTX (expr
)));
2088 elem
= av_set_add_element (setp
);
2089 copy_expr (_AV_SET_EXPR (elem
), expr
);
2092 /* Same, but do not copy EXPR. */
2094 av_set_add_nocopy (av_set_t
*setp
, expr_t expr
)
2098 elem
= av_set_add_element (setp
);
2099 *_AV_SET_EXPR (elem
) = *expr
;
2102 /* Remove expr pointed to by IP from the av_set. */
2104 av_set_iter_remove (av_set_iterator
*ip
)
2106 clear_expr (_AV_SET_EXPR (*ip
->lp
));
2107 _list_iter_remove (ip
);
2110 /* Search for an expr in SET, such that it's equivalent to SOUGHT_VINSN in the
2111 sense of vinsn_equal_p function. Return NULL if no such expr is
2112 in SET was found. */
2114 av_set_lookup (av_set_t set
, vinsn_t sought_vinsn
)
2119 FOR_EACH_EXPR (expr
, i
, set
)
2120 if (vinsn_equal_p (EXPR_VINSN (expr
), sought_vinsn
))
2125 /* Same, but also remove the EXPR found. */
2127 av_set_lookup_and_remove (av_set_t
*setp
, vinsn_t sought_vinsn
)
2132 FOR_EACH_EXPR_1 (expr
, i
, setp
)
2133 if (vinsn_equal_p (EXPR_VINSN (expr
), sought_vinsn
))
2135 _list_iter_remove_nofree (&i
);
2141 /* Search for an expr in SET, such that it's equivalent to EXPR in the
2142 sense of vinsn_equal_p function of their vinsns, but not EXPR itself.
2143 Returns NULL if no such expr is in SET was found. */
2145 av_set_lookup_other_equiv_expr (av_set_t set
, expr_t expr
)
2150 FOR_EACH_EXPR (cur_expr
, i
, set
)
2152 if (cur_expr
== expr
)
2154 if (vinsn_equal_p (EXPR_VINSN (cur_expr
), EXPR_VINSN (expr
)))
2161 /* If other expression is already in AVP, remove one of them. */
2163 merge_with_other_exprs (av_set_t
*avp
, av_set_iterator
*ip
, expr_t expr
)
2167 expr2
= av_set_lookup_other_equiv_expr (*avp
, expr
);
2170 /* Reset target availability on merge, since taking it only from one
2171 of the exprs would be controversial for different code. */
2172 EXPR_TARGET_AVAILABLE (expr2
) = -1;
2173 EXPR_USEFULNESS (expr2
) = 0;
2175 merge_expr (expr2
, expr
, NULL
);
2177 /* Fix usefulness as it should be now REG_BR_PROB_BASE. */
2178 EXPR_USEFULNESS (expr2
) = REG_BR_PROB_BASE
;
2180 av_set_iter_remove (ip
);
2187 /* Return true if there is an expr that correlates to VI in SET. */
2189 av_set_is_in_p (av_set_t set
, vinsn_t vi
)
2191 return av_set_lookup (set
, vi
) != NULL
;
2194 /* Return a copy of SET. */
2196 av_set_copy (av_set_t set
)
2200 av_set_t res
= NULL
;
2202 FOR_EACH_EXPR (expr
, i
, set
)
2203 av_set_add (&res
, expr
);
2208 /* Join two av sets that do not have common elements by attaching second set
2209 (pointed to by FROMP) to the end of first set (TO_TAILP must point to
2210 _AV_SET_NEXT of first set's last element). */
2212 join_distinct_sets (av_set_t
*to_tailp
, av_set_t
*fromp
)
2214 gcc_assert (*to_tailp
== NULL
);
2219 /* Makes set pointed to by TO to be the union of TO and FROM. Clear av_set
2220 pointed to by FROMP afterwards. */
2222 av_set_union_and_clear (av_set_t
*top
, av_set_t
*fromp
, insn_t insn
)
2227 /* Delete from TOP all exprs, that present in FROMP. */
2228 FOR_EACH_EXPR_1 (expr1
, i
, top
)
2230 expr_t expr2
= av_set_lookup (*fromp
, EXPR_VINSN (expr1
));
2234 merge_expr (expr2
, expr1
, insn
);
2235 av_set_iter_remove (&i
);
2239 join_distinct_sets (i
.lp
, fromp
);
2242 /* Same as above, but also update availability of target register in
2243 TOP judging by TO_LV_SET and FROM_LV_SET. */
2245 av_set_union_and_live (av_set_t
*top
, av_set_t
*fromp
, regset to_lv_set
,
2246 regset from_lv_set
, insn_t insn
)
2250 av_set_t
*to_tailp
, in_both_set
= NULL
;
2252 /* Delete from TOP all expres, that present in FROMP. */
2253 FOR_EACH_EXPR_1 (expr1
, i
, top
)
2255 expr_t expr2
= av_set_lookup_and_remove (fromp
, EXPR_VINSN (expr1
));
2259 /* It may be that the expressions have different destination
2260 registers, in which case we need to check liveness here. */
2261 if (EXPR_SEPARABLE_P (expr1
))
2263 int regno1
= (REG_P (EXPR_LHS (expr1
))
2264 ? (int) expr_dest_regno (expr1
) : -1);
2265 int regno2
= (REG_P (EXPR_LHS (expr2
))
2266 ? (int) expr_dest_regno (expr2
) : -1);
2268 /* ??? We don't have a way to check restrictions for
2269 *other* register on the current path, we did it only
2270 for the current target register. Give up. */
2271 if (regno1
!= regno2
)
2272 EXPR_TARGET_AVAILABLE (expr2
) = -1;
2274 else if (EXPR_INSN_RTX (expr1
) != EXPR_INSN_RTX (expr2
))
2275 EXPR_TARGET_AVAILABLE (expr2
) = -1;
2277 merge_expr (expr2
, expr1
, insn
);
2278 av_set_add_nocopy (&in_both_set
, expr2
);
2279 av_set_iter_remove (&i
);
2282 /* EXPR1 is present in TOP, but not in FROMP. Check it on
2284 set_unavailable_target_for_expr (expr1
, from_lv_set
);
2288 /* These expressions are not present in TOP. Check liveness
2289 restrictions on TO_LV_SET. */
2290 FOR_EACH_EXPR (expr1
, i
, *fromp
)
2291 set_unavailable_target_for_expr (expr1
, to_lv_set
);
2293 join_distinct_sets (i
.lp
, &in_both_set
);
2294 join_distinct_sets (to_tailp
, fromp
);
2297 /* Clear av_set pointed to by SETP. */
2299 av_set_clear (av_set_t
*setp
)
2304 FOR_EACH_EXPR_1 (expr
, i
, setp
)
2305 av_set_iter_remove (&i
);
2307 gcc_assert (*setp
== NULL
);
2310 /* Leave only one non-speculative element in the SETP. */
2312 av_set_leave_one_nonspec (av_set_t
*setp
)
2316 bool has_one_nonspec
= false;
2318 /* Keep all speculative exprs, and leave one non-speculative
2320 FOR_EACH_EXPR_1 (expr
, i
, setp
)
2322 if (!EXPR_SPEC_DONE_DS (expr
))
2324 if (has_one_nonspec
)
2325 av_set_iter_remove (&i
);
2327 has_one_nonspec
= true;
2332 /* Return the N'th element of the SET. */
2334 av_set_element (av_set_t set
, int n
)
2339 FOR_EACH_EXPR (expr
, i
, set
)
2347 /* Deletes all expressions from AVP that are conditional branches (IFs). */
2349 av_set_substract_cond_branches (av_set_t
*avp
)
2354 FOR_EACH_EXPR_1 (expr
, i
, avp
)
2355 if (vinsn_cond_branch_p (EXPR_VINSN (expr
)))
2356 av_set_iter_remove (&i
);
2359 /* Multiplies usefulness attribute of each member of av-set *AVP by
2360 value PROB / ALL_PROB. */
2362 av_set_split_usefulness (av_set_t av
, int prob
, int all_prob
)
2367 FOR_EACH_EXPR (expr
, i
, av
)
2368 EXPR_USEFULNESS (expr
) = (all_prob
2369 ? (EXPR_USEFULNESS (expr
) * prob
) / all_prob
2373 /* Leave in AVP only those expressions, which are present in AV,
2374 and return it, merging history expressions. */
2376 av_set_code_motion_filter (av_set_t
*avp
, av_set_t av
)
2381 FOR_EACH_EXPR_1 (expr
, i
, avp
)
2382 if ((expr2
= av_set_lookup (av
, EXPR_VINSN (expr
))) == NULL
)
2383 av_set_iter_remove (&i
);
2385 /* When updating av sets in bookkeeping blocks, we can add more insns
2386 there which will be transformed but the upper av sets will not
2387 reflect those transformations. We then fail to undo those
2388 when searching for such insns. So merge the history saved
2389 in the av set of the block we are processing. */
2390 merge_history_vect (&EXPR_HISTORY_OF_CHANGES (expr
),
2391 EXPR_HISTORY_OF_CHANGES (expr2
));
2396 /* Dependence hooks to initialize insn data. */
2398 /* This is used in hooks callable from dependence analysis when initializing
2399 instruction's data. */
2402 /* Where the dependence was found (lhs/rhs). */
2405 /* The actual data object to initialize. */
2408 /* True when the insn should not be made clonable. */
2409 bool force_unique_p
;
2411 /* True when insn should be treated as of type USE, i.e. never renamed. */
2413 } deps_init_id_data
;
2416 /* Setup ID for INSN. FORCE_UNIQUE_P is true when INSN should not be
2419 setup_id_for_insn (idata_t id
, insn_t insn
, bool force_unique_p
)
2423 /* Determine whether INSN could be cloned and return appropriate vinsn type.
2424 That clonable insns which can be separated into lhs and rhs have type SET.
2425 Other clonable insns have type USE. */
2426 type
= GET_CODE (insn
);
2428 /* Only regular insns could be cloned. */
2429 if (type
== INSN
&& !force_unique_p
)
2431 else if (type
== JUMP_INSN
&& simplejump_p (insn
))
2433 else if (type
== DEBUG_INSN
)
2434 type
= !force_unique_p
? USE
: INSN
;
2436 IDATA_TYPE (id
) = type
;
2437 IDATA_REG_SETS (id
) = get_clear_regset_from_pool ();
2438 IDATA_REG_USES (id
) = get_clear_regset_from_pool ();
2439 IDATA_REG_CLOBBERS (id
) = get_clear_regset_from_pool ();
2442 /* Start initializing insn data. */
2444 deps_init_id_start_insn (insn_t insn
)
2446 gcc_assert (deps_init_id_data
.where
== DEPS_IN_NOWHERE
);
2448 setup_id_for_insn (deps_init_id_data
.id
, insn
,
2449 deps_init_id_data
.force_unique_p
);
2450 deps_init_id_data
.where
= DEPS_IN_INSN
;
2453 /* Start initializing lhs data. */
2455 deps_init_id_start_lhs (rtx lhs
)
2457 gcc_assert (deps_init_id_data
.where
== DEPS_IN_INSN
);
2458 gcc_assert (IDATA_LHS (deps_init_id_data
.id
) == NULL
);
2460 if (IDATA_TYPE (deps_init_id_data
.id
) == SET
)
2462 IDATA_LHS (deps_init_id_data
.id
) = lhs
;
2463 deps_init_id_data
.where
= DEPS_IN_LHS
;
2467 /* Finish initializing lhs data. */
2469 deps_init_id_finish_lhs (void)
2471 deps_init_id_data
.where
= DEPS_IN_INSN
;
2474 /* Note a set of REGNO. */
2476 deps_init_id_note_reg_set (int regno
)
2478 haifa_note_reg_set (regno
);
2480 if (deps_init_id_data
.where
== DEPS_IN_RHS
)
2481 deps_init_id_data
.force_use_p
= true;
2483 if (IDATA_TYPE (deps_init_id_data
.id
) != PC
)
2484 SET_REGNO_REG_SET (IDATA_REG_SETS (deps_init_id_data
.id
), regno
);
2487 /* Make instructions that set stack registers to be ineligible for
2488 renaming to avoid issues with find_used_regs. */
2489 if (IN_RANGE (regno
, FIRST_STACK_REG
, LAST_STACK_REG
))
2490 deps_init_id_data
.force_use_p
= true;
2494 /* Note a clobber of REGNO. */
2496 deps_init_id_note_reg_clobber (int regno
)
2498 haifa_note_reg_clobber (regno
);
2500 if (deps_init_id_data
.where
== DEPS_IN_RHS
)
2501 deps_init_id_data
.force_use_p
= true;
2503 if (IDATA_TYPE (deps_init_id_data
.id
) != PC
)
2504 SET_REGNO_REG_SET (IDATA_REG_CLOBBERS (deps_init_id_data
.id
), regno
);
2507 /* Note a use of REGNO. */
2509 deps_init_id_note_reg_use (int regno
)
2511 haifa_note_reg_use (regno
);
2513 if (IDATA_TYPE (deps_init_id_data
.id
) != PC
)
2514 SET_REGNO_REG_SET (IDATA_REG_USES (deps_init_id_data
.id
), regno
);
2517 /* Start initializing rhs data. */
2519 deps_init_id_start_rhs (rtx rhs
)
2521 gcc_assert (deps_init_id_data
.where
== DEPS_IN_INSN
);
2523 /* And there was no sel_deps_reset_to_insn (). */
2524 if (IDATA_LHS (deps_init_id_data
.id
) != NULL
)
2526 IDATA_RHS (deps_init_id_data
.id
) = rhs
;
2527 deps_init_id_data
.where
= DEPS_IN_RHS
;
2531 /* Finish initializing rhs data. */
2533 deps_init_id_finish_rhs (void)
2535 gcc_assert (deps_init_id_data
.where
== DEPS_IN_RHS
2536 || deps_init_id_data
.where
== DEPS_IN_INSN
);
2537 deps_init_id_data
.where
= DEPS_IN_INSN
;
2540 /* Finish initializing insn data. */
2542 deps_init_id_finish_insn (void)
2544 gcc_assert (deps_init_id_data
.where
== DEPS_IN_INSN
);
2546 if (IDATA_TYPE (deps_init_id_data
.id
) == SET
)
2548 rtx lhs
= IDATA_LHS (deps_init_id_data
.id
);
2549 rtx rhs
= IDATA_RHS (deps_init_id_data
.id
);
2551 if (lhs
== NULL
|| rhs
== NULL
|| !lhs_and_rhs_separable_p (lhs
, rhs
)
2552 || deps_init_id_data
.force_use_p
)
2554 /* This should be a USE, as we don't want to schedule its RHS
2555 separately. However, we still want to have them recorded
2556 for the purposes of substitution. That's why we don't
2557 simply call downgrade_to_use () here. */
2558 gcc_assert (IDATA_TYPE (deps_init_id_data
.id
) == SET
);
2559 gcc_assert (!lhs
== !rhs
);
2561 IDATA_TYPE (deps_init_id_data
.id
) = USE
;
2565 deps_init_id_data
.where
= DEPS_IN_NOWHERE
;
2568 /* This is dependence info used for initializing insn's data. */
2569 static struct sched_deps_info_def deps_init_id_sched_deps_info
;
2571 /* This initializes most of the static part of the above structure. */
2572 static const struct sched_deps_info_def const_deps_init_id_sched_deps_info
=
2576 deps_init_id_start_insn
,
2577 deps_init_id_finish_insn
,
2578 deps_init_id_start_lhs
,
2579 deps_init_id_finish_lhs
,
2580 deps_init_id_start_rhs
,
2581 deps_init_id_finish_rhs
,
2582 deps_init_id_note_reg_set
,
2583 deps_init_id_note_reg_clobber
,
2584 deps_init_id_note_reg_use
,
2585 NULL
, /* note_mem_dep */
2586 NULL
, /* note_dep */
2589 0, /* use_deps_list */
2590 0 /* generate_spec_deps */
2593 /* Initialize INSN's lhs and rhs in ID. When FORCE_UNIQUE_P is true,
2594 we don't actually need information about lhs and rhs. */
2596 setup_id_lhs_rhs (idata_t id
, insn_t insn
, bool force_unique_p
)
2598 rtx pat
= PATTERN (insn
);
2600 if (NONJUMP_INSN_P (insn
)
2601 && GET_CODE (pat
) == SET
2604 IDATA_RHS (id
) = SET_SRC (pat
);
2605 IDATA_LHS (id
) = SET_DEST (pat
);
2608 IDATA_LHS (id
) = IDATA_RHS (id
) = NULL
;
2611 /* Possibly downgrade INSN to USE. */
2613 maybe_downgrade_id_to_use (idata_t id
, insn_t insn
)
2615 bool must_be_use
= false;
2616 unsigned uid
= INSN_UID (insn
);
2618 rtx lhs
= IDATA_LHS (id
);
2619 rtx rhs
= IDATA_RHS (id
);
2621 /* We downgrade only SETs. */
2622 if (IDATA_TYPE (id
) != SET
)
2625 if (!lhs
|| !lhs_and_rhs_separable_p (lhs
, rhs
))
2627 IDATA_TYPE (id
) = USE
;
2631 for (rec
= DF_INSN_UID_DEFS (uid
); *rec
; rec
++)
2635 if (DF_REF_INSN (def
)
2636 && DF_REF_FLAGS_IS_SET (def
, DF_REF_PRE_POST_MODIFY
)
2637 && loc_mentioned_in_p (DF_REF_LOC (def
), IDATA_RHS (id
)))
2644 /* Make instructions that set stack registers to be ineligible for
2645 renaming to avoid issues with find_used_regs. */
2646 if (IN_RANGE (DF_REF_REGNO (def
), FIRST_STACK_REG
, LAST_STACK_REG
))
2655 IDATA_TYPE (id
) = USE
;
2658 /* Setup register sets describing INSN in ID. */
2660 setup_id_reg_sets (idata_t id
, insn_t insn
)
2662 unsigned uid
= INSN_UID (insn
);
2664 regset tmp
= get_clear_regset_from_pool ();
2666 for (rec
= DF_INSN_UID_DEFS (uid
); *rec
; rec
++)
2669 unsigned int regno
= DF_REF_REGNO (def
);
2671 /* Post modifies are treated like clobbers by sched-deps.c. */
2672 if (DF_REF_FLAGS_IS_SET (def
, (DF_REF_MUST_CLOBBER
2673 | DF_REF_PRE_POST_MODIFY
)))
2674 SET_REGNO_REG_SET (IDATA_REG_CLOBBERS (id
), regno
);
2675 else if (! DF_REF_FLAGS_IS_SET (def
, DF_REF_MAY_CLOBBER
))
2677 SET_REGNO_REG_SET (IDATA_REG_SETS (id
), regno
);
2680 /* For stack registers, treat writes to them as writes
2681 to the first one to be consistent with sched-deps.c. */
2682 if (IN_RANGE (regno
, FIRST_STACK_REG
, LAST_STACK_REG
))
2683 SET_REGNO_REG_SET (IDATA_REG_SETS (id
), FIRST_STACK_REG
);
2686 /* Mark special refs that generate read/write def pair. */
2687 if (DF_REF_FLAGS_IS_SET (def
, DF_REF_CONDITIONAL
)
2688 || regno
== STACK_POINTER_REGNUM
)
2689 bitmap_set_bit (tmp
, regno
);
2692 for (rec
= DF_INSN_UID_USES (uid
); *rec
; rec
++)
2695 unsigned int regno
= DF_REF_REGNO (use
);
2697 /* When these refs are met for the first time, skip them, as
2698 these uses are just counterparts of some defs. */
2699 if (bitmap_bit_p (tmp
, regno
))
2700 bitmap_clear_bit (tmp
, regno
);
2701 else if (! DF_REF_FLAGS_IS_SET (use
, DF_REF_CALL_STACK_USAGE
))
2703 SET_REGNO_REG_SET (IDATA_REG_USES (id
), regno
);
2706 /* For stack registers, treat reads from them as reads from
2707 the first one to be consistent with sched-deps.c. */
2708 if (IN_RANGE (regno
, FIRST_STACK_REG
, LAST_STACK_REG
))
2709 SET_REGNO_REG_SET (IDATA_REG_USES (id
), FIRST_STACK_REG
);
2714 return_regset_to_pool (tmp
);
2717 /* Initialize instruction data for INSN in ID using DF's data. */
2719 init_id_from_df (idata_t id
, insn_t insn
, bool force_unique_p
)
2721 gcc_assert (DF_INSN_UID_SAFE_GET (INSN_UID (insn
)) != NULL
);
2723 setup_id_for_insn (id
, insn
, force_unique_p
);
2724 setup_id_lhs_rhs (id
, insn
, force_unique_p
);
2726 if (INSN_NOP_P (insn
))
2729 maybe_downgrade_id_to_use (id
, insn
);
2730 setup_id_reg_sets (id
, insn
);
2733 /* Initialize instruction data for INSN in ID. */
2735 deps_init_id (idata_t id
, insn_t insn
, bool force_unique_p
)
2737 struct deps_desc _dc
, *dc
= &_dc
;
2739 deps_init_id_data
.where
= DEPS_IN_NOWHERE
;
2740 deps_init_id_data
.id
= id
;
2741 deps_init_id_data
.force_unique_p
= force_unique_p
;
2742 deps_init_id_data
.force_use_p
= false;
2744 init_deps (dc
, false);
2746 memcpy (&deps_init_id_sched_deps_info
,
2747 &const_deps_init_id_sched_deps_info
,
2748 sizeof (deps_init_id_sched_deps_info
));
2750 if (spec_info
!= NULL
)
2751 deps_init_id_sched_deps_info
.generate_spec_deps
= 1;
2753 sched_deps_info
= &deps_init_id_sched_deps_info
;
2755 deps_analyze_insn (dc
, insn
);
2759 deps_init_id_data
.id
= NULL
;
2763 struct sched_scan_info_def
2765 /* This hook notifies scheduler frontend to extend its internal per basic
2766 block data structures. This hook should be called once before a series of
2767 calls to bb_init (). */
2768 void (*extend_bb
) (void);
2770 /* This hook makes scheduler frontend to initialize its internal data
2771 structures for the passed basic block. */
2772 void (*init_bb
) (basic_block
);
2774 /* This hook notifies scheduler frontend to extend its internal per insn data
2775 structures. This hook should be called once before a series of calls to
2777 void (*extend_insn
) (void);
2779 /* This hook makes scheduler frontend to initialize its internal data
2780 structures for the passed insn. */
2781 void (*init_insn
) (rtx
);
2784 /* A driver function to add a set of basic blocks (BBS) to the
2785 scheduling region. */
2787 sched_scan (const struct sched_scan_info_def
*ssi
, bb_vec_t bbs
)
2796 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
2799 if (ssi
->extend_insn
)
2800 ssi
->extend_insn ();
2803 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
2807 FOR_BB_INSNS (bb
, insn
)
2808 ssi
->init_insn (insn
);
2812 /* Implement hooks for collecting fundamental insn properties like if insn is
2813 an ASM or is within a SCHED_GROUP. */
2815 /* True when a "one-time init" data for INSN was already inited. */
2817 first_time_insn_init (insn_t insn
)
2819 return INSN_LIVE (insn
) == NULL
;
2822 /* Hash an entry in a transformed_insns hashtable. */
2824 hash_transformed_insns (const void *p
)
2826 return VINSN_HASH_RTX (((const struct transformed_insns
*) p
)->vinsn_old
);
2829 /* Compare the entries in a transformed_insns hashtable. */
2831 eq_transformed_insns (const void *p
, const void *q
)
2833 rtx i1
= VINSN_INSN_RTX (((const struct transformed_insns
*) p
)->vinsn_old
);
2834 rtx i2
= VINSN_INSN_RTX (((const struct transformed_insns
*) q
)->vinsn_old
);
2836 if (INSN_UID (i1
) == INSN_UID (i2
))
2838 return rtx_equal_p (PATTERN (i1
), PATTERN (i2
));
2841 /* Free an entry in a transformed_insns hashtable. */
2843 free_transformed_insns (void *p
)
2845 struct transformed_insns
*pti
= (struct transformed_insns
*) p
;
2847 vinsn_detach (pti
->vinsn_old
);
2848 vinsn_detach (pti
->vinsn_new
);
2852 /* Init the s_i_d data for INSN which should be inited just once, when
2853 we first see the insn. */
2855 init_first_time_insn_data (insn_t insn
)
2857 /* This should not be set if this is the first time we init data for
2859 gcc_assert (first_time_insn_init (insn
));
2861 /* These are needed for nops too. */
2862 INSN_LIVE (insn
) = get_regset_from_pool ();
2863 INSN_LIVE_VALID_P (insn
) = false;
2865 if (!INSN_NOP_P (insn
))
2867 INSN_ANALYZED_DEPS (insn
) = BITMAP_ALLOC (NULL
);
2868 INSN_FOUND_DEPS (insn
) = BITMAP_ALLOC (NULL
);
2869 INSN_TRANSFORMED_INSNS (insn
)
2870 = htab_create (16, hash_transformed_insns
,
2871 eq_transformed_insns
, free_transformed_insns
);
2872 init_deps (&INSN_DEPS_CONTEXT (insn
), true);
2876 /* Free almost all above data for INSN that is scheduled already.
2877 Used for extra-large basic blocks. */
2879 free_data_for_scheduled_insn (insn_t insn
)
2881 gcc_assert (! first_time_insn_init (insn
));
2883 if (! INSN_ANALYZED_DEPS (insn
))
2886 BITMAP_FREE (INSN_ANALYZED_DEPS (insn
));
2887 BITMAP_FREE (INSN_FOUND_DEPS (insn
));
2888 htab_delete (INSN_TRANSFORMED_INSNS (insn
));
2890 /* This is allocated only for bookkeeping insns. */
2891 if (INSN_ORIGINATORS (insn
))
2892 BITMAP_FREE (INSN_ORIGINATORS (insn
));
2893 free_deps (&INSN_DEPS_CONTEXT (insn
));
2895 INSN_ANALYZED_DEPS (insn
) = NULL
;
2897 /* Clear the readonly flag so we would ICE when trying to recalculate
2898 the deps context (as we believe that it should not happen). */
2899 (&INSN_DEPS_CONTEXT (insn
))->readonly
= 0;
2902 /* Free the same data as above for INSN. */
2904 free_first_time_insn_data (insn_t insn
)
2906 gcc_assert (! first_time_insn_init (insn
));
2908 free_data_for_scheduled_insn (insn
);
2909 return_regset_to_pool (INSN_LIVE (insn
));
2910 INSN_LIVE (insn
) = NULL
;
2911 INSN_LIVE_VALID_P (insn
) = false;
2914 /* Initialize region-scope data structures for basic blocks. */
2916 init_global_and_expr_for_bb (basic_block bb
)
2918 if (sel_bb_empty_p (bb
))
2921 invalidate_av_set (bb
);
2924 /* Data for global dependency analysis (to initialize CANT_MOVE and
2928 /* Previous insn. */
2932 /* Determine if INSN is in the sched_group, is an asm or should not be
2933 cloned. After that initialize its expr. */
2935 init_global_and_expr_for_insn (insn_t insn
)
2940 if (NOTE_INSN_BASIC_BLOCK_P (insn
))
2942 init_global_data
.prev_insn
= NULL_RTX
;
2946 gcc_assert (INSN_P (insn
));
2948 if (SCHED_GROUP_P (insn
))
2949 /* Setup a sched_group. */
2951 insn_t prev_insn
= init_global_data
.prev_insn
;
2954 INSN_SCHED_NEXT (prev_insn
) = insn
;
2956 init_global_data
.prev_insn
= insn
;
2959 init_global_data
.prev_insn
= NULL_RTX
;
2961 if (GET_CODE (PATTERN (insn
)) == ASM_INPUT
2962 || asm_noperands (PATTERN (insn
)) >= 0)
2963 /* Mark INSN as an asm. */
2964 INSN_ASM_P (insn
) = true;
2967 bool force_unique_p
;
2970 /* Certain instructions cannot be cloned, and frame related insns and
2971 the insn adjacent to NOTE_INSN_EPILOGUE_BEG cannot be moved out of
2973 if (prologue_epilogue_contains (insn
))
2975 if (RTX_FRAME_RELATED_P (insn
))
2976 CANT_MOVE (insn
) = 1;
2980 for (note
= REG_NOTES (insn
); note
; note
= XEXP (note
, 1))
2981 if (REG_NOTE_KIND (note
) == REG_SAVE_NOTE
2982 && ((enum insn_note
) INTVAL (XEXP (note
, 0))
2983 == NOTE_INSN_EPILOGUE_BEG
))
2985 CANT_MOVE (insn
) = 1;
2989 force_unique_p
= true;
2992 if (CANT_MOVE (insn
)
2993 || INSN_ASM_P (insn
)
2994 || SCHED_GROUP_P (insn
)
2996 /* Exception handling insns are always unique. */
2997 || (cfun
->can_throw_non_call_exceptions
&& can_throw_internal (insn
))
2998 /* TRAP_IF though have an INSN code is control_flow_insn_p (). */
2999 || control_flow_insn_p (insn
)
3000 || volatile_insn_p (PATTERN (insn
))
3001 || (targetm
.cannot_copy_insn_p
3002 && targetm
.cannot_copy_insn_p (insn
)))
3003 force_unique_p
= true;
3005 force_unique_p
= false;
3007 if (targetm
.sched
.get_insn_spec_ds
)
3009 spec_done_ds
= targetm
.sched
.get_insn_spec_ds (insn
);
3010 spec_done_ds
= ds_get_max_dep_weak (spec_done_ds
);
3015 /* Initialize INSN's expr. */
3016 init_expr (INSN_EXPR (insn
), vinsn_create (insn
, force_unique_p
), 0,
3017 REG_BR_PROB_BASE
, INSN_PRIORITY (insn
), 0, BLOCK_NUM (insn
),
3018 spec_done_ds
, 0, 0, vNULL
, true,
3019 false, false, false, CANT_MOVE (insn
));
3022 init_first_time_insn_data (insn
);
3025 /* Scan the region and initialize instruction data for basic blocks BBS. */
3027 sel_init_global_and_expr (bb_vec_t bbs
)
3029 /* ??? It would be nice to implement push / pop scheme for sched_infos. */
3030 const struct sched_scan_info_def ssi
=
3032 NULL
, /* extend_bb */
3033 init_global_and_expr_for_bb
, /* init_bb */
3034 extend_insn_data
, /* extend_insn */
3035 init_global_and_expr_for_insn
/* init_insn */
3038 sched_scan (&ssi
, bbs
);
3041 /* Finalize region-scope data structures for basic blocks. */
3043 finish_global_and_expr_for_bb (basic_block bb
)
3045 av_set_clear (&BB_AV_SET (bb
));
3046 BB_AV_LEVEL (bb
) = 0;
3049 /* Finalize INSN's data. */
3051 finish_global_and_expr_insn (insn_t insn
)
3053 if (LABEL_P (insn
) || NOTE_INSN_BASIC_BLOCK_P (insn
))
3056 gcc_assert (INSN_P (insn
));
3058 if (INSN_LUID (insn
) > 0)
3060 free_first_time_insn_data (insn
);
3061 INSN_WS_LEVEL (insn
) = 0;
3062 CANT_MOVE (insn
) = 0;
3064 /* We can no longer assert this, as vinsns of this insn could be
3065 easily live in other insn's caches. This should be changed to
3066 a counter-like approach among all vinsns. */
3067 gcc_assert (true || VINSN_COUNT (INSN_VINSN (insn
)) == 1);
3068 clear_expr (INSN_EXPR (insn
));
3072 /* Finalize per instruction data for the whole region. */
3074 sel_finish_global_and_expr (void)
3080 bbs
.create (current_nr_blocks
);
3082 for (i
= 0; i
< current_nr_blocks
; i
++)
3083 bbs
.quick_push (BASIC_BLOCK_FOR_FN (cfun
, BB_TO_BLOCK (i
)));
3085 /* Clear AV_SETs and INSN_EXPRs. */
3087 const struct sched_scan_info_def ssi
=
3089 NULL
, /* extend_bb */
3090 finish_global_and_expr_for_bb
, /* init_bb */
3091 NULL
, /* extend_insn */
3092 finish_global_and_expr_insn
/* init_insn */
3095 sched_scan (&ssi
, bbs
);
3105 /* In the below hooks, we merely calculate whether or not a dependence
3106 exists, and in what part of insn. However, we will need more data
3107 when we'll start caching dependence requests. */
3109 /* Container to hold information for dependency analysis. */
3114 /* A variable to track which part of rtx we are scanning in
3115 sched-deps.c: sched_analyze_insn (). */
3118 /* Current producer. */
3121 /* Current consumer. */
3124 /* Is SEL_DEPS_HAS_DEP_P[DEPS_IN_X] is true, then X has a dependence.
3125 X is from { INSN, LHS, RHS }. */
3126 ds_t has_dep_p
[DEPS_IN_NOWHERE
];
3127 } has_dependence_data
;
3129 /* Start analyzing dependencies of INSN. */
3131 has_dependence_start_insn (insn_t insn ATTRIBUTE_UNUSED
)
3133 gcc_assert (has_dependence_data
.where
== DEPS_IN_NOWHERE
);
3135 has_dependence_data
.where
= DEPS_IN_INSN
;
3138 /* Finish analyzing dependencies of an insn. */
3140 has_dependence_finish_insn (void)
3142 gcc_assert (has_dependence_data
.where
== DEPS_IN_INSN
);
3144 has_dependence_data
.where
= DEPS_IN_NOWHERE
;
3147 /* Start analyzing dependencies of LHS. */
3149 has_dependence_start_lhs (rtx lhs ATTRIBUTE_UNUSED
)
3151 gcc_assert (has_dependence_data
.where
== DEPS_IN_INSN
);
3153 if (VINSN_LHS (has_dependence_data
.con
) != NULL
)
3154 has_dependence_data
.where
= DEPS_IN_LHS
;
3157 /* Finish analyzing dependencies of an lhs. */
3159 has_dependence_finish_lhs (void)
3161 has_dependence_data
.where
= DEPS_IN_INSN
;
3164 /* Start analyzing dependencies of RHS. */
3166 has_dependence_start_rhs (rtx rhs ATTRIBUTE_UNUSED
)
3168 gcc_assert (has_dependence_data
.where
== DEPS_IN_INSN
);
3170 if (VINSN_RHS (has_dependence_data
.con
) != NULL
)
3171 has_dependence_data
.where
= DEPS_IN_RHS
;
3174 /* Start analyzing dependencies of an rhs. */
3176 has_dependence_finish_rhs (void)
3178 gcc_assert (has_dependence_data
.where
== DEPS_IN_RHS
3179 || has_dependence_data
.where
== DEPS_IN_INSN
);
3181 has_dependence_data
.where
= DEPS_IN_INSN
;
3184 /* Note a set of REGNO. */
3186 has_dependence_note_reg_set (int regno
)
3188 struct deps_reg
*reg_last
= &has_dependence_data
.dc
->reg_last
[regno
];
3190 if (!sched_insns_conditions_mutex_p (has_dependence_data
.pro
,
3192 (has_dependence_data
.con
)))
3194 ds_t
*dsp
= &has_dependence_data
.has_dep_p
[has_dependence_data
.where
];
3196 if (reg_last
->sets
!= NULL
3197 || reg_last
->clobbers
!= NULL
)
3198 *dsp
= (*dsp
& ~SPECULATIVE
) | DEP_OUTPUT
;
3200 if (reg_last
->uses
|| reg_last
->implicit_sets
)
3201 *dsp
= (*dsp
& ~SPECULATIVE
) | DEP_ANTI
;
3205 /* Note a clobber of REGNO. */
3207 has_dependence_note_reg_clobber (int regno
)
3209 struct deps_reg
*reg_last
= &has_dependence_data
.dc
->reg_last
[regno
];
3211 if (!sched_insns_conditions_mutex_p (has_dependence_data
.pro
,
3213 (has_dependence_data
.con
)))
3215 ds_t
*dsp
= &has_dependence_data
.has_dep_p
[has_dependence_data
.where
];
3218 *dsp
= (*dsp
& ~SPECULATIVE
) | DEP_OUTPUT
;
3220 if (reg_last
->uses
|| reg_last
->implicit_sets
)
3221 *dsp
= (*dsp
& ~SPECULATIVE
) | DEP_ANTI
;
3225 /* Note a use of REGNO. */
3227 has_dependence_note_reg_use (int regno
)
3229 struct deps_reg
*reg_last
= &has_dependence_data
.dc
->reg_last
[regno
];
3231 if (!sched_insns_conditions_mutex_p (has_dependence_data
.pro
,
3233 (has_dependence_data
.con
)))
3235 ds_t
*dsp
= &has_dependence_data
.has_dep_p
[has_dependence_data
.where
];
3238 *dsp
= (*dsp
& ~SPECULATIVE
) | DEP_TRUE
;
3240 if (reg_last
->clobbers
|| reg_last
->implicit_sets
)
3241 *dsp
= (*dsp
& ~SPECULATIVE
) | DEP_ANTI
;
3243 /* Merge BE_IN_SPEC bits into *DSP when the dependency producer
3244 is actually a check insn. We need to do this for any register
3245 read-read dependency with the check unless we track properly
3246 all registers written by BE_IN_SPEC-speculated insns, as
3247 we don't have explicit dependence lists. See PR 53975. */
3250 ds_t pro_spec_checked_ds
;
3252 pro_spec_checked_ds
= INSN_SPEC_CHECKED_DS (has_dependence_data
.pro
);
3253 pro_spec_checked_ds
= ds_get_max_dep_weak (pro_spec_checked_ds
);
3255 if (pro_spec_checked_ds
!= 0)
3256 *dsp
= ds_full_merge (*dsp
, pro_spec_checked_ds
,
3257 NULL_RTX
, NULL_RTX
);
3262 /* Note a memory dependence. */
3264 has_dependence_note_mem_dep (rtx mem ATTRIBUTE_UNUSED
,
3265 rtx pending_mem ATTRIBUTE_UNUSED
,
3266 insn_t pending_insn ATTRIBUTE_UNUSED
,
3267 ds_t ds ATTRIBUTE_UNUSED
)
3269 if (!sched_insns_conditions_mutex_p (has_dependence_data
.pro
,
3270 VINSN_INSN_RTX (has_dependence_data
.con
)))
3272 ds_t
*dsp
= &has_dependence_data
.has_dep_p
[has_dependence_data
.where
];
3274 *dsp
= ds_full_merge (ds
, *dsp
, pending_mem
, mem
);
3278 /* Note a dependence. */
3280 has_dependence_note_dep (insn_t pro ATTRIBUTE_UNUSED
,
3281 ds_t ds ATTRIBUTE_UNUSED
)
3283 if (!sched_insns_conditions_mutex_p (has_dependence_data
.pro
,
3284 VINSN_INSN_RTX (has_dependence_data
.con
)))
3286 ds_t
*dsp
= &has_dependence_data
.has_dep_p
[has_dependence_data
.where
];
3288 *dsp
= ds_full_merge (ds
, *dsp
, NULL_RTX
, NULL_RTX
);
3292 /* Mark the insn as having a hard dependence that prevents speculation. */
3294 sel_mark_hard_insn (rtx insn
)
3298 /* Only work when we're in has_dependence_p mode.
3299 ??? This is a hack, this should actually be a hook. */
3300 if (!has_dependence_data
.dc
|| !has_dependence_data
.pro
)
3303 gcc_assert (insn
== VINSN_INSN_RTX (has_dependence_data
.con
));
3304 gcc_assert (has_dependence_data
.where
== DEPS_IN_INSN
);
3306 for (i
= 0; i
< DEPS_IN_NOWHERE
; i
++)
3307 has_dependence_data
.has_dep_p
[i
] &= ~SPECULATIVE
;
3310 /* This structure holds the hooks for the dependency analysis used when
3311 actually processing dependencies in the scheduler. */
3312 static struct sched_deps_info_def has_dependence_sched_deps_info
;
3314 /* This initializes most of the fields of the above structure. */
3315 static const struct sched_deps_info_def const_has_dependence_sched_deps_info
=
3319 has_dependence_start_insn
,
3320 has_dependence_finish_insn
,
3321 has_dependence_start_lhs
,
3322 has_dependence_finish_lhs
,
3323 has_dependence_start_rhs
,
3324 has_dependence_finish_rhs
,
3325 has_dependence_note_reg_set
,
3326 has_dependence_note_reg_clobber
,
3327 has_dependence_note_reg_use
,
3328 has_dependence_note_mem_dep
,
3329 has_dependence_note_dep
,
3332 0, /* use_deps_list */
3333 0 /* generate_spec_deps */
3336 /* Initialize has_dependence_sched_deps_info with extra spec field. */
3338 setup_has_dependence_sched_deps_info (void)
3340 memcpy (&has_dependence_sched_deps_info
,
3341 &const_has_dependence_sched_deps_info
,
3342 sizeof (has_dependence_sched_deps_info
));
3344 if (spec_info
!= NULL
)
3345 has_dependence_sched_deps_info
.generate_spec_deps
= 1;
3347 sched_deps_info
= &has_dependence_sched_deps_info
;
3350 /* Remove all dependences found and recorded in has_dependence_data array. */
3352 sel_clear_has_dependence (void)
3356 for (i
= 0; i
< DEPS_IN_NOWHERE
; i
++)
3357 has_dependence_data
.has_dep_p
[i
] = 0;
3360 /* Return nonzero if EXPR has is dependent upon PRED. Return the pointer
3361 to the dependence information array in HAS_DEP_PP. */
3363 has_dependence_p (expr_t expr
, insn_t pred
, ds_t
**has_dep_pp
)
3367 struct deps_desc
*dc
;
3369 if (INSN_SIMPLEJUMP_P (pred
))
3370 /* Unconditional jump is just a transfer of control flow.
3374 dc
= &INSN_DEPS_CONTEXT (pred
);
3376 /* We init this field lazily. */
3377 if (dc
->reg_last
== NULL
)
3378 init_deps_reg_last (dc
);
3382 has_dependence_data
.pro
= NULL
;
3383 /* Initialize empty dep context with information about PRED. */
3384 advance_deps_context (dc
, pred
);
3388 has_dependence_data
.where
= DEPS_IN_NOWHERE
;
3389 has_dependence_data
.pro
= pred
;
3390 has_dependence_data
.con
= EXPR_VINSN (expr
);
3391 has_dependence_data
.dc
= dc
;
3393 sel_clear_has_dependence ();
3395 /* Now catch all dependencies that would be generated between PRED and
3397 setup_has_dependence_sched_deps_info ();
3398 deps_analyze_insn (dc
, EXPR_INSN_RTX (expr
));
3399 has_dependence_data
.dc
= NULL
;
3401 /* When a barrier was found, set DEPS_IN_INSN bits. */
3402 if (dc
->last_reg_pending_barrier
== TRUE_BARRIER
)
3403 has_dependence_data
.has_dep_p
[DEPS_IN_INSN
] = DEP_TRUE
;
3404 else if (dc
->last_reg_pending_barrier
== MOVE_BARRIER
)
3405 has_dependence_data
.has_dep_p
[DEPS_IN_INSN
] = DEP_ANTI
;
3407 /* Do not allow stores to memory to move through checks. Currently
3408 we don't move this to sched-deps.c as the check doesn't have
3409 obvious places to which this dependence can be attached.
3410 FIMXE: this should go to a hook. */
3412 && MEM_P (EXPR_LHS (expr
))
3413 && sel_insn_is_speculation_check (pred
))
3414 has_dependence_data
.has_dep_p
[DEPS_IN_INSN
] = DEP_ANTI
;
3416 *has_dep_pp
= has_dependence_data
.has_dep_p
;
3418 for (i
= 0; i
< DEPS_IN_NOWHERE
; i
++)
3419 ds
= ds_full_merge (ds
, has_dependence_data
.has_dep_p
[i
],
3420 NULL_RTX
, NULL_RTX
);
3426 /* Dependence hooks implementation that checks dependence latency constraints
3427 on the insns being scheduled. The entry point for these routines is
3428 tick_check_p predicate. */
3432 /* An expr we are currently checking. */
3435 /* A minimal cycle for its scheduling. */
3438 /* Whether we have seen a true dependence while checking. */
3439 bool seen_true_dep_p
;
3442 /* Update minimal scheduling cycle for tick_check_insn given that it depends
3443 on PRO with status DS and weight DW. */
3445 tick_check_dep_with_dw (insn_t pro_insn
, ds_t ds
, dw_t dw
)
3447 expr_t con_expr
= tick_check_data
.expr
;
3448 insn_t con_insn
= EXPR_INSN_RTX (con_expr
);
3450 if (con_insn
!= pro_insn
)
3455 if (/* PROducer was removed from above due to pipelining. */
3456 !INSN_IN_STREAM_P (pro_insn
)
3457 /* Or PROducer was originally on the next iteration regarding the
3459 || (INSN_SCHED_TIMES (pro_insn
)
3460 - EXPR_SCHED_TIMES (con_expr
)) > 1)
3461 /* Don't count this dependence. */
3465 if (dt
== REG_DEP_TRUE
)
3466 tick_check_data
.seen_true_dep_p
= true;
3468 gcc_assert (INSN_SCHED_CYCLE (pro_insn
) > 0);
3471 dep_def _dep
, *dep
= &_dep
;
3473 init_dep (dep
, pro_insn
, con_insn
, dt
);
3475 tick
= INSN_SCHED_CYCLE (pro_insn
) + dep_cost_1 (dep
, dw
);
3478 /* When there are several kinds of dependencies between pro and con,
3479 only REG_DEP_TRUE should be taken into account. */
3480 if (tick
> tick_check_data
.cycle
3481 && (dt
== REG_DEP_TRUE
|| !tick_check_data
.seen_true_dep_p
))
3482 tick_check_data
.cycle
= tick
;
3486 /* An implementation of note_dep hook. */
3488 tick_check_note_dep (insn_t pro
, ds_t ds
)
3490 tick_check_dep_with_dw (pro
, ds
, 0);
3493 /* An implementation of note_mem_dep hook. */
3495 tick_check_note_mem_dep (rtx mem1
, rtx mem2
, insn_t pro
, ds_t ds
)
3499 dw
= (ds_to_dt (ds
) == REG_DEP_TRUE
3500 ? estimate_dep_weak (mem1
, mem2
)
3503 tick_check_dep_with_dw (pro
, ds
, dw
);
3506 /* This structure contains hooks for dependence analysis used when determining
3507 whether an insn is ready for scheduling. */
3508 static struct sched_deps_info_def tick_check_sched_deps_info
=
3519 haifa_note_reg_clobber
,
3521 tick_check_note_mem_dep
,
3522 tick_check_note_dep
,
3527 /* Estimate number of cycles from the current cycle of FENCE until EXPR can be
3528 scheduled. Return 0 if all data from producers in DC is ready. */
3530 tick_check_p (expr_t expr
, deps_t dc
, fence_t fence
)
3533 /* Initialize variables. */
3534 tick_check_data
.expr
= expr
;
3535 tick_check_data
.cycle
= 0;
3536 tick_check_data
.seen_true_dep_p
= false;
3537 sched_deps_info
= &tick_check_sched_deps_info
;
3539 gcc_assert (!dc
->readonly
);
3541 deps_analyze_insn (dc
, EXPR_INSN_RTX (expr
));
3544 cycles_left
= tick_check_data
.cycle
- FENCE_CYCLE (fence
);
3546 return cycles_left
>= 0 ? cycles_left
: 0;
3550 /* Functions to work with insns. */
3552 /* Returns true if LHS of INSN is the same as DEST of an insn
3555 lhs_of_insn_equals_to_dest_p (insn_t insn
, rtx dest
)
3557 rtx lhs
= INSN_LHS (insn
);
3559 if (lhs
== NULL
|| dest
== NULL
)
3562 return rtx_equal_p (lhs
, dest
);
3565 /* Return s_i_d entry of INSN. Callable from debugger. */
3567 insn_sid (insn_t insn
)
3572 /* True when INSN is a speculative check. We can tell this by looking
3573 at the data structures of the selective scheduler, not by examining
3576 sel_insn_is_speculation_check (rtx insn
)
3578 return s_i_d
.exists () && !! INSN_SPEC_CHECKED_DS (insn
);
3581 /* Extracts machine mode MODE and destination location DST_LOC
3584 get_dest_and_mode (rtx insn
, rtx
*dst_loc
, enum machine_mode
*mode
)
3586 rtx pat
= PATTERN (insn
);
3588 gcc_assert (dst_loc
);
3589 gcc_assert (GET_CODE (pat
) == SET
);
3591 *dst_loc
= SET_DEST (pat
);
3593 gcc_assert (*dst_loc
);
3594 gcc_assert (MEM_P (*dst_loc
) || REG_P (*dst_loc
));
3597 *mode
= GET_MODE (*dst_loc
);
3600 /* Returns true when moving through JUMP will result in bookkeeping
3603 bookkeeping_can_be_created_if_moved_through_p (insn_t jump
)
3608 FOR_EACH_SUCC (succ
, si
, jump
)
3609 if (sel_num_cfg_preds_gt_1 (succ
))
3615 /* Return 'true' if INSN is the only one in its basic block. */
3617 insn_is_the_only_one_in_bb_p (insn_t insn
)
3619 return sel_bb_head_p (insn
) && sel_bb_end_p (insn
);
3622 #ifdef ENABLE_CHECKING
3623 /* Check that the region we're scheduling still has at most one
3626 verify_backedges (void)
3634 for (i
= 0; i
< current_nr_blocks
; i
++)
3635 FOR_EACH_EDGE (e
, ei
, BASIC_BLOCK_FOR_FN (cfun
, BB_TO_BLOCK (i
))->succs
)
3636 if (in_current_region_p (e
->dest
)
3637 && BLOCK_TO_BB (e
->dest
->index
) < i
)
3640 gcc_assert (n
<= 1);
3646 /* Functions to work with control flow. */
3648 /* Recompute BLOCK_TO_BB and BB_FOR_BLOCK for current region so that blocks
3649 are sorted in topological order (it might have been invalidated by
3650 redirecting an edge). */
3652 sel_recompute_toporder (void)
3655 int *postorder
, n_blocks
;
3657 postorder
= XALLOCAVEC (int, n_basic_blocks_for_fn (cfun
));
3658 n_blocks
= post_order_compute (postorder
, false, false);
3660 rgn
= CONTAINING_RGN (BB_TO_BLOCK (0));
3661 for (n
= 0, i
= n_blocks
- 1; i
>= 0; i
--)
3662 if (CONTAINING_RGN (postorder
[i
]) == rgn
)
3664 BLOCK_TO_BB (postorder
[i
]) = n
;
3665 BB_TO_BLOCK (n
) = postorder
[i
];
3669 /* Assert that we updated info for all blocks. We may miss some blocks if
3670 this function is called when redirecting an edge made a block
3671 unreachable, but that block is not deleted yet. */
3672 gcc_assert (n
== RGN_NR_BLOCKS (rgn
));
3675 /* Tidy the possibly empty block BB. */
3677 maybe_tidy_empty_bb (basic_block bb
)
3679 basic_block succ_bb
, pred_bb
, note_bb
;
3680 vec
<basic_block
> dom_bbs
;
3685 /* Keep empty bb only if this block immediately precedes EXIT and
3686 has incoming non-fallthrough edge, or it has no predecessors or
3687 successors. Otherwise remove it. */
3688 if (!sel_bb_empty_p (bb
)
3689 || (single_succ_p (bb
)
3690 && single_succ (bb
) == EXIT_BLOCK_PTR_FOR_FN (cfun
)
3691 && (!single_pred_p (bb
)
3692 || !(single_pred_edge (bb
)->flags
& EDGE_FALLTHRU
)))
3693 || EDGE_COUNT (bb
->preds
) == 0
3694 || EDGE_COUNT (bb
->succs
) == 0)
3697 /* Do not attempt to redirect complex edges. */
3698 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
3699 if (e
->flags
& EDGE_COMPLEX
)
3701 else if (e
->flags
& EDGE_FALLTHRU
)
3704 /* If prev bb ends with asm goto, see if any of the
3705 ASM_OPERANDS_LABELs don't point to the fallthru
3706 label. Do not attempt to redirect it in that case. */
3707 if (JUMP_P (BB_END (e
->src
))
3708 && (note
= extract_asm_operands (PATTERN (BB_END (e
->src
)))))
3710 int i
, n
= ASM_OPERANDS_LABEL_LENGTH (note
);
3712 for (i
= 0; i
< n
; ++i
)
3713 if (XEXP (ASM_OPERANDS_LABEL (note
, i
), 0) == BB_HEAD (bb
))
3718 free_data_sets (bb
);
3720 /* Do not delete BB if it has more than one successor.
3721 That can occur when we moving a jump. */
3722 if (!single_succ_p (bb
))
3724 gcc_assert (can_merge_blocks_p (bb
->prev_bb
, bb
));
3725 sel_merge_blocks (bb
->prev_bb
, bb
);
3729 succ_bb
= single_succ (bb
);
3734 /* Save a pred/succ from the current region to attach the notes to. */
3736 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
3737 if (in_current_region_p (e
->src
))
3742 if (note_bb
== NULL
)
3745 /* Redirect all non-fallthru edges to the next bb. */
3750 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
3754 if (!(e
->flags
& EDGE_FALLTHRU
))
3756 /* We can not invalidate computed topological order by moving
3757 the edge destination block (E->SUCC) along a fallthru edge.
3759 We will update dominators here only when we'll get
3760 an unreachable block when redirecting, otherwise
3761 sel_redirect_edge_and_branch will take care of it. */
3763 && single_pred_p (e
->dest
))
3764 dom_bbs
.safe_push (e
->dest
);
3765 sel_redirect_edge_and_branch (e
, succ_bb
);
3769 /* If the edge is fallthru, but PRED_BB ends in a conditional jump
3770 to BB (so there is no non-fallthru edge from PRED_BB to BB), we
3771 still have to adjust it. */
3772 else if (single_succ_p (pred_bb
) && any_condjump_p (BB_END (pred_bb
)))
3774 /* If possible, try to remove the unneeded conditional jump. */
3775 if (INSN_SCHED_TIMES (BB_END (pred_bb
)) == 0
3776 && !IN_CURRENT_FENCE_P (BB_END (pred_bb
)))
3778 if (!sel_remove_insn (BB_END (pred_bb
), false, false))
3779 tidy_fallthru_edge (e
);
3782 sel_redirect_edge_and_branch (e
, succ_bb
);
3789 if (can_merge_blocks_p (bb
->prev_bb
, bb
))
3790 sel_merge_blocks (bb
->prev_bb
, bb
);
3793 /* This is a block without fallthru predecessor. Just delete it. */
3794 gcc_assert (note_bb
);
3795 move_bb_info (note_bb
, bb
);
3796 remove_empty_bb (bb
, true);
3799 if (!dom_bbs
.is_empty ())
3801 dom_bbs
.safe_push (succ_bb
);
3802 iterate_fix_dominators (CDI_DOMINATORS
, dom_bbs
, false);
3809 /* Tidy the control flow after we have removed original insn from
3810 XBB. Return true if we have removed some blocks. When FULL_TIDYING
3811 is true, also try to optimize control flow on non-empty blocks. */
3813 tidy_control_flow (basic_block xbb
, bool full_tidying
)
3815 bool changed
= true;
3818 /* First check whether XBB is empty. */
3819 changed
= maybe_tidy_empty_bb (xbb
);
3820 if (changed
|| !full_tidying
)
3823 /* Check if there is a unnecessary jump after insn left. */
3824 if (bb_has_removable_jump_to_p (xbb
, xbb
->next_bb
)
3825 && INSN_SCHED_TIMES (BB_END (xbb
)) == 0
3826 && !IN_CURRENT_FENCE_P (BB_END (xbb
)))
3828 if (sel_remove_insn (BB_END (xbb
), false, false))
3830 tidy_fallthru_edge (EDGE_SUCC (xbb
, 0));
3833 first
= sel_bb_head (xbb
);
3834 last
= sel_bb_end (xbb
);
3835 if (MAY_HAVE_DEBUG_INSNS
)
3837 if (first
!= last
&& DEBUG_INSN_P (first
))
3839 first
= NEXT_INSN (first
);
3840 while (first
!= last
&& (DEBUG_INSN_P (first
) || NOTE_P (first
)));
3842 if (first
!= last
&& DEBUG_INSN_P (last
))
3844 last
= PREV_INSN (last
);
3845 while (first
!= last
&& (DEBUG_INSN_P (last
) || NOTE_P (last
)));
3847 /* Check if there is an unnecessary jump in previous basic block leading
3848 to next basic block left after removing INSN from stream.
3849 If it is so, remove that jump and redirect edge to current
3850 basic block (where there was INSN before deletion). This way
3851 when NOP will be deleted several instructions later with its
3852 basic block we will not get a jump to next instruction, which
3855 && !sel_bb_empty_p (xbb
)
3856 && INSN_NOP_P (last
)
3857 /* Flow goes fallthru from current block to the next. */
3858 && EDGE_COUNT (xbb
->succs
) == 1
3859 && (EDGE_SUCC (xbb
, 0)->flags
& EDGE_FALLTHRU
)
3860 /* When successor is an EXIT block, it may not be the next block. */
3861 && single_succ (xbb
) != EXIT_BLOCK_PTR_FOR_FN (cfun
)
3862 /* And unconditional jump in previous basic block leads to
3863 next basic block of XBB and this jump can be safely removed. */
3864 && in_current_region_p (xbb
->prev_bb
)
3865 && bb_has_removable_jump_to_p (xbb
->prev_bb
, xbb
->next_bb
)
3866 && INSN_SCHED_TIMES (BB_END (xbb
->prev_bb
)) == 0
3867 /* Also this jump is not at the scheduling boundary. */
3868 && !IN_CURRENT_FENCE_P (BB_END (xbb
->prev_bb
)))
3870 bool recompute_toporder_p
;
3871 /* Clear data structures of jump - jump itself will be removed
3872 by sel_redirect_edge_and_branch. */
3873 clear_expr (INSN_EXPR (BB_END (xbb
->prev_bb
)));
3874 recompute_toporder_p
3875 = sel_redirect_edge_and_branch (EDGE_SUCC (xbb
->prev_bb
, 0), xbb
);
3877 gcc_assert (EDGE_SUCC (xbb
->prev_bb
, 0)->flags
& EDGE_FALLTHRU
);
3879 /* It can turn out that after removing unused jump, basic block
3880 that contained that jump, becomes empty too. In such case
3882 if (sel_bb_empty_p (xbb
->prev_bb
))
3883 changed
= maybe_tidy_empty_bb (xbb
->prev_bb
);
3884 if (recompute_toporder_p
)
3885 sel_recompute_toporder ();
3888 #ifdef ENABLE_CHECKING
3889 verify_backedges ();
3890 verify_dominators (CDI_DOMINATORS
);
3896 /* Purge meaningless empty blocks in the middle of a region. */
3898 purge_empty_blocks (void)
3902 /* Do not attempt to delete the first basic block in the region. */
3903 for (i
= 1; i
< current_nr_blocks
; )
3905 basic_block b
= BASIC_BLOCK_FOR_FN (cfun
, BB_TO_BLOCK (i
));
3907 if (maybe_tidy_empty_bb (b
))
3914 /* Rip-off INSN from the insn stream. When ONLY_DISCONNECT is true,
3915 do not delete insn's data, because it will be later re-emitted.
3916 Return true if we have removed some blocks afterwards. */
3918 sel_remove_insn (insn_t insn
, bool only_disconnect
, bool full_tidying
)
3920 basic_block bb
= BLOCK_FOR_INSN (insn
);
3922 gcc_assert (INSN_IN_STREAM_P (insn
));
3924 if (DEBUG_INSN_P (insn
) && BB_AV_SET_VALID_P (bb
))
3929 /* When we remove a debug insn that is head of a BB, it remains
3930 in the AV_SET of the block, but it shouldn't. */
3931 FOR_EACH_EXPR_1 (expr
, i
, &BB_AV_SET (bb
))
3932 if (EXPR_INSN_RTX (expr
) == insn
)
3934 av_set_iter_remove (&i
);
3939 if (only_disconnect
)
3944 clear_expr (INSN_EXPR (insn
));
3947 /* It is necessary to NULL these fields in case we are going to re-insert
3948 INSN into the insns stream, as will usually happen in the ONLY_DISCONNECT
3949 case, but also for NOPs that we will return to the nop pool. */
3950 PREV_INSN (insn
) = NULL_RTX
;
3951 NEXT_INSN (insn
) = NULL_RTX
;
3952 set_block_for_insn (insn
, NULL
);
3954 return tidy_control_flow (bb
, full_tidying
);
3957 /* Estimate number of the insns in BB. */
3959 sel_estimate_number_of_insns (basic_block bb
)
3962 insn_t insn
= NEXT_INSN (BB_HEAD (bb
)), next_tail
= NEXT_INSN (BB_END (bb
));
3964 for (; insn
!= next_tail
; insn
= NEXT_INSN (insn
))
3965 if (NONDEBUG_INSN_P (insn
))
3971 /* We don't need separate luids for notes or labels. */
3973 sel_luid_for_non_insn (rtx x
)
3975 gcc_assert (NOTE_P (x
) || LABEL_P (x
));
3980 /* Find the proper seqno for inserting at INSN by successors.
3981 Return -1 if no successors with positive seqno exist. */
3983 get_seqno_by_succs (rtx insn
)
3985 basic_block bb
= BLOCK_FOR_INSN (insn
);
3986 rtx tmp
= insn
, end
= BB_END (bb
);
3993 tmp
= NEXT_INSN (tmp
);
3995 return INSN_SEQNO (tmp
);
4000 FOR_EACH_SUCC_1 (succ
, si
, end
, SUCCS_NORMAL
)
4001 if (INSN_SEQNO (succ
) > 0)
4002 seqno
= MIN (seqno
, INSN_SEQNO (succ
));
4004 if (seqno
== INT_MAX
)
4010 /* Compute seqno for INSN by its preds or succs. Use OLD_SEQNO to compute
4011 seqno in corner cases. */
4013 get_seqno_for_a_jump (insn_t insn
, int old_seqno
)
4017 gcc_assert (INSN_SIMPLEJUMP_P (insn
));
4019 if (!sel_bb_head_p (insn
))
4020 seqno
= INSN_SEQNO (PREV_INSN (insn
));
4023 basic_block bb
= BLOCK_FOR_INSN (insn
);
4025 if (single_pred_p (bb
)
4026 && !in_current_region_p (single_pred (bb
)))
4028 /* We can have preds outside a region when splitting edges
4029 for pipelining of an outer loop. Use succ instead.
4030 There should be only one of them. */
4035 gcc_assert (flag_sel_sched_pipelining_outer_loops
4036 && current_loop_nest
);
4037 FOR_EACH_SUCC_1 (succ
, si
, insn
,
4038 SUCCS_NORMAL
| SUCCS_SKIP_TO_LOOP_EXITS
)
4044 gcc_assert (succ
!= NULL
);
4045 seqno
= INSN_SEQNO (succ
);
4052 cfg_preds (BLOCK_FOR_INSN (insn
), &preds
, &n
);
4055 /* For one predecessor, use simple method. */
4057 seqno
= INSN_SEQNO (preds
[0]);
4059 seqno
= get_seqno_by_preds (insn
);
4065 /* We were unable to find a good seqno among preds. */
4067 seqno
= get_seqno_by_succs (insn
);
4071 /* The only case where this could be here legally is that the only
4072 unscheduled insn was a conditional jump that got removed and turned
4073 into this unconditional one. Initialize from the old seqno
4074 of that jump passed down to here. */
4078 gcc_assert (seqno
>= 0);
4082 /* Find the proper seqno for inserting at INSN. Returns -1 if no predecessors
4083 with positive seqno exist. */
4085 get_seqno_by_preds (rtx insn
)
4087 basic_block bb
= BLOCK_FOR_INSN (insn
);
4088 rtx tmp
= insn
, head
= BB_HEAD (bb
);
4094 tmp
= PREV_INSN (tmp
);
4096 return INSN_SEQNO (tmp
);
4099 cfg_preds (bb
, &preds
, &n
);
4100 for (i
= 0, seqno
= -1; i
< n
; i
++)
4101 seqno
= MAX (seqno
, INSN_SEQNO (preds
[i
]));
4108 /* Extend pass-scope data structures for basic blocks. */
4110 sel_extend_global_bb_info (void)
4112 sel_global_bb_info
.safe_grow_cleared (last_basic_block_for_fn (cfun
));
4115 /* Extend region-scope data structures for basic blocks. */
4117 extend_region_bb_info (void)
4119 sel_region_bb_info
.safe_grow_cleared (last_basic_block_for_fn (cfun
));
4122 /* Extend all data structures to fit for all basic blocks. */
4124 extend_bb_info (void)
4126 sel_extend_global_bb_info ();
4127 extend_region_bb_info ();
4130 /* Finalize pass-scope data structures for basic blocks. */
4132 sel_finish_global_bb_info (void)
4134 sel_global_bb_info
.release ();
4137 /* Finalize region-scope data structures for basic blocks. */
4139 finish_region_bb_info (void)
4141 sel_region_bb_info
.release ();
4145 /* Data for each insn in current region. */
4146 vec
<sel_insn_data_def
> s_i_d
= vNULL
;
4148 /* Extend data structures for insns from current region. */
4150 extend_insn_data (void)
4154 sched_extend_target ();
4155 sched_deps_init (false);
4157 /* Extend data structures for insns from current region. */
4158 reserve
= (sched_max_luid
+ 1 - s_i_d
.length ());
4159 if (reserve
> 0 && ! s_i_d
.space (reserve
))
4163 if (sched_max_luid
/ 2 > 1024)
4164 size
= sched_max_luid
+ 1024;
4166 size
= 3 * sched_max_luid
/ 2;
4169 s_i_d
.safe_grow_cleared (size
);
4173 /* Finalize data structures for insns from current region. */
4179 /* Clear here all dependence contexts that may have left from insns that were
4180 removed during the scheduling. */
4181 for (i
= 0; i
< s_i_d
.length (); i
++)
4183 sel_insn_data_def
*sid_entry
= &s_i_d
[i
];
4185 if (sid_entry
->live
)
4186 return_regset_to_pool (sid_entry
->live
);
4187 if (sid_entry
->analyzed_deps
)
4189 BITMAP_FREE (sid_entry
->analyzed_deps
);
4190 BITMAP_FREE (sid_entry
->found_deps
);
4191 htab_delete (sid_entry
->transformed_insns
);
4192 free_deps (&sid_entry
->deps_context
);
4194 if (EXPR_VINSN (&sid_entry
->expr
))
4196 clear_expr (&sid_entry
->expr
);
4198 /* Also, clear CANT_MOVE bit here, because we really don't want it
4199 to be passed to the next region. */
4200 CANT_MOVE_BY_LUID (i
) = 0;
4207 /* A proxy to pass initialization data to init_insn (). */
4208 static sel_insn_data_def _insn_init_ssid
;
4209 static sel_insn_data_t insn_init_ssid
= &_insn_init_ssid
;
4211 /* If true create a new vinsn. Otherwise use the one from EXPR. */
4212 static bool insn_init_create_new_vinsn_p
;
4214 /* Set all necessary data for initialization of the new insn[s]. */
4216 set_insn_init (expr_t expr
, vinsn_t vi
, int seqno
)
4218 expr_t x
= &insn_init_ssid
->expr
;
4220 copy_expr_onside (x
, expr
);
4223 insn_init_create_new_vinsn_p
= false;
4224 change_vinsn_in_expr (x
, vi
);
4227 insn_init_create_new_vinsn_p
= true;
4229 insn_init_ssid
->seqno
= seqno
;
4233 /* Init data for INSN. */
4235 init_insn_data (insn_t insn
)
4238 sel_insn_data_t ssid
= insn_init_ssid
;
4240 /* The fields mentioned below are special and hence are not being
4241 propagated to the new insns. */
4242 gcc_assert (!ssid
->asm_p
&& ssid
->sched_next
== NULL
4243 && !ssid
->after_stall_p
&& ssid
->sched_cycle
== 0);
4244 gcc_assert (INSN_P (insn
) && INSN_LUID (insn
) > 0);
4246 expr
= INSN_EXPR (insn
);
4247 copy_expr (expr
, &ssid
->expr
);
4248 prepare_insn_expr (insn
, ssid
->seqno
);
4250 if (insn_init_create_new_vinsn_p
)
4251 change_vinsn_in_expr (expr
, vinsn_create (insn
, init_insn_force_unique_p
));
4253 if (first_time_insn_init (insn
))
4254 init_first_time_insn_data (insn
);
4257 /* This is used to initialize spurious jumps generated by
4258 sel_redirect_edge (). OLD_SEQNO is used for initializing seqnos
4259 in corner cases within get_seqno_for_a_jump. */
4261 init_simplejump_data (insn_t insn
, int old_seqno
)
4263 init_expr (INSN_EXPR (insn
), vinsn_create (insn
, false), 0,
4264 REG_BR_PROB_BASE
, 0, 0, 0, 0, 0, 0,
4265 vNULL
, true, false, false,
4267 INSN_SEQNO (insn
) = get_seqno_for_a_jump (insn
, old_seqno
);
4268 init_first_time_insn_data (insn
);
4271 /* Perform deferred initialization of insns. This is used to process
4272 a new jump that may be created by redirect_edge. OLD_SEQNO is used
4273 for initializing simplejumps in init_simplejump_data. */
4275 sel_init_new_insn (insn_t insn
, int flags
, int old_seqno
)
4277 /* We create data structures for bb when the first insn is emitted in it. */
4279 && INSN_IN_STREAM_P (insn
)
4280 && insn_is_the_only_one_in_bb_p (insn
))
4283 create_initial_data_sets (BLOCK_FOR_INSN (insn
));
4286 if (flags
& INSN_INIT_TODO_LUID
)
4288 sched_extend_luids ();
4289 sched_init_insn_luid (insn
);
4292 if (flags
& INSN_INIT_TODO_SSID
)
4294 extend_insn_data ();
4295 init_insn_data (insn
);
4296 clear_expr (&insn_init_ssid
->expr
);
4299 if (flags
& INSN_INIT_TODO_SIMPLEJUMP
)
4301 extend_insn_data ();
4302 init_simplejump_data (insn
, old_seqno
);
4305 gcc_assert (CONTAINING_RGN (BLOCK_NUM (insn
))
4306 == CONTAINING_RGN (BB_TO_BLOCK (0)));
4310 /* Functions to init/finish work with lv sets. */
4312 /* Init BB_LV_SET of BB from DF_LR_IN set of BB. */
4314 init_lv_set (basic_block bb
)
4316 gcc_assert (!BB_LV_SET_VALID_P (bb
));
4318 BB_LV_SET (bb
) = get_regset_from_pool ();
4319 COPY_REG_SET (BB_LV_SET (bb
), DF_LR_IN (bb
));
4320 BB_LV_SET_VALID_P (bb
) = true;
4323 /* Copy liveness information to BB from FROM_BB. */
4325 copy_lv_set_from (basic_block bb
, basic_block from_bb
)
4327 gcc_assert (!BB_LV_SET_VALID_P (bb
));
4329 COPY_REG_SET (BB_LV_SET (bb
), BB_LV_SET (from_bb
));
4330 BB_LV_SET_VALID_P (bb
) = true;
4333 /* Initialize lv set of all bb headers. */
4339 /* Initialize of LV sets. */
4340 FOR_EACH_BB_FN (bb
, cfun
)
4343 /* Don't forget EXIT_BLOCK. */
4344 init_lv_set (EXIT_BLOCK_PTR_FOR_FN (cfun
));
4347 /* Release lv set of HEAD. */
4349 free_lv_set (basic_block bb
)
4351 gcc_assert (BB_LV_SET (bb
) != NULL
);
4353 return_regset_to_pool (BB_LV_SET (bb
));
4354 BB_LV_SET (bb
) = NULL
;
4355 BB_LV_SET_VALID_P (bb
) = false;
4358 /* Finalize lv sets of all bb headers. */
4364 /* Don't forget EXIT_BLOCK. */
4365 free_lv_set (EXIT_BLOCK_PTR_FOR_FN (cfun
));
4368 FOR_EACH_BB_FN (bb
, cfun
)
4373 /* Mark AV_SET for BB as invalid, so this set will be updated the next time
4374 compute_av() processes BB. This function is called when creating new basic
4375 blocks, as well as for blocks (either new or existing) where new jumps are
4376 created when the control flow is being updated. */
4378 invalidate_av_set (basic_block bb
)
4380 BB_AV_LEVEL (bb
) = -1;
4383 /* Create initial data sets for BB (they will be invalid). */
4385 create_initial_data_sets (basic_block bb
)
4388 BB_LV_SET_VALID_P (bb
) = false;
4390 BB_LV_SET (bb
) = get_regset_from_pool ();
4391 invalidate_av_set (bb
);
4394 /* Free av set of BB. */
4396 free_av_set (basic_block bb
)
4398 av_set_clear (&BB_AV_SET (bb
));
4399 BB_AV_LEVEL (bb
) = 0;
4402 /* Free data sets of BB. */
4404 free_data_sets (basic_block bb
)
4410 /* Exchange lv sets of TO and FROM. */
4412 exchange_lv_sets (basic_block to
, basic_block from
)
4415 regset to_lv_set
= BB_LV_SET (to
);
4417 BB_LV_SET (to
) = BB_LV_SET (from
);
4418 BB_LV_SET (from
) = to_lv_set
;
4422 bool to_lv_set_valid_p
= BB_LV_SET_VALID_P (to
);
4424 BB_LV_SET_VALID_P (to
) = BB_LV_SET_VALID_P (from
);
4425 BB_LV_SET_VALID_P (from
) = to_lv_set_valid_p
;
4430 /* Exchange av sets of TO and FROM. */
4432 exchange_av_sets (basic_block to
, basic_block from
)
4435 av_set_t to_av_set
= BB_AV_SET (to
);
4437 BB_AV_SET (to
) = BB_AV_SET (from
);
4438 BB_AV_SET (from
) = to_av_set
;
4442 int to_av_level
= BB_AV_LEVEL (to
);
4444 BB_AV_LEVEL (to
) = BB_AV_LEVEL (from
);
4445 BB_AV_LEVEL (from
) = to_av_level
;
4449 /* Exchange data sets of TO and FROM. */
4451 exchange_data_sets (basic_block to
, basic_block from
)
4453 exchange_lv_sets (to
, from
);
4454 exchange_av_sets (to
, from
);
4457 /* Copy data sets of FROM to TO. */
4459 copy_data_sets (basic_block to
, basic_block from
)
4461 gcc_assert (!BB_LV_SET_VALID_P (to
) && !BB_AV_SET_VALID_P (to
));
4462 gcc_assert (BB_AV_SET (to
) == NULL
);
4464 BB_AV_LEVEL (to
) = BB_AV_LEVEL (from
);
4465 BB_LV_SET_VALID_P (to
) = BB_LV_SET_VALID_P (from
);
4467 if (BB_AV_SET_VALID_P (from
))
4469 BB_AV_SET (to
) = av_set_copy (BB_AV_SET (from
));
4471 if (BB_LV_SET_VALID_P (from
))
4473 gcc_assert (BB_LV_SET (to
) != NULL
);
4474 COPY_REG_SET (BB_LV_SET (to
), BB_LV_SET (from
));
4478 /* Return an av set for INSN, if any. */
4480 get_av_set (insn_t insn
)
4484 gcc_assert (AV_SET_VALID_P (insn
));
4486 if (sel_bb_head_p (insn
))
4487 av_set
= BB_AV_SET (BLOCK_FOR_INSN (insn
));
4494 /* Implementation of AV_LEVEL () macro. Return AV_LEVEL () of INSN. */
4496 get_av_level (insn_t insn
)
4500 gcc_assert (INSN_P (insn
));
4502 if (sel_bb_head_p (insn
))
4503 av_level
= BB_AV_LEVEL (BLOCK_FOR_INSN (insn
));
4505 av_level
= INSN_WS_LEVEL (insn
);
4512 /* Variables to work with control-flow graph. */
4514 /* The basic block that already has been processed by the sched_data_update (),
4515 but hasn't been in sel_add_bb () yet. */
4516 static vec
<basic_block
>
4517 last_added_blocks
= vNULL
;
4519 /* A pool for allocating successor infos. */
4522 /* A stack for saving succs_info structures. */
4523 struct succs_info
*stack
;
4528 /* Top of the stack. */
4531 /* Maximal value of the top. */
4535 /* Functions to work with control-flow graph. */
4537 /* Return basic block note of BB. */
4539 sel_bb_head (basic_block bb
)
4543 if (bb
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
4545 gcc_assert (exit_insn
!= NULL_RTX
);
4552 note
= bb_note (bb
);
4553 head
= next_nonnote_insn (note
);
4555 if (head
&& (BARRIER_P (head
) || BLOCK_FOR_INSN (head
) != bb
))
4562 /* Return true if INSN is a basic block header. */
4564 sel_bb_head_p (insn_t insn
)
4566 return sel_bb_head (BLOCK_FOR_INSN (insn
)) == insn
;
4569 /* Return last insn of BB. */
4571 sel_bb_end (basic_block bb
)
4573 if (sel_bb_empty_p (bb
))
4576 gcc_assert (bb
!= EXIT_BLOCK_PTR_FOR_FN (cfun
));
4581 /* Return true if INSN is the last insn in its basic block. */
4583 sel_bb_end_p (insn_t insn
)
4585 return insn
== sel_bb_end (BLOCK_FOR_INSN (insn
));
4588 /* Return true if BB consist of single NOTE_INSN_BASIC_BLOCK. */
4590 sel_bb_empty_p (basic_block bb
)
4592 return sel_bb_head (bb
) == NULL
;
4595 /* True when BB belongs to the current scheduling region. */
4597 in_current_region_p (basic_block bb
)
4599 if (bb
->index
< NUM_FIXED_BLOCKS
)
4602 return CONTAINING_RGN (bb
->index
) == CONTAINING_RGN (BB_TO_BLOCK (0));
4605 /* Return the block which is a fallthru bb of a conditional jump JUMP. */
4607 fallthru_bb_of_jump (rtx jump
)
4612 if (!any_condjump_p (jump
))
4615 /* A basic block that ends with a conditional jump may still have one successor
4616 (and be followed by a barrier), we are not interested. */
4617 if (single_succ_p (BLOCK_FOR_INSN (jump
)))
4620 return FALLTHRU_EDGE (BLOCK_FOR_INSN (jump
))->dest
;
4623 /* Remove all notes from BB. */
4625 init_bb (basic_block bb
)
4627 remove_notes (bb_note (bb
), BB_END (bb
));
4628 BB_NOTE_LIST (bb
) = note_list
;
4632 sel_init_bbs (bb_vec_t bbs
)
4634 const struct sched_scan_info_def ssi
=
4636 extend_bb_info
, /* extend_bb */
4637 init_bb
, /* init_bb */
4638 NULL
, /* extend_insn */
4639 NULL
/* init_insn */
4642 sched_scan (&ssi
, bbs
);
4645 /* Restore notes for the whole region. */
4647 sel_restore_notes (void)
4652 for (bb
= 0; bb
< current_nr_blocks
; bb
++)
4654 basic_block first
, last
;
4656 first
= EBB_FIRST_BB (bb
);
4657 last
= EBB_LAST_BB (bb
)->next_bb
;
4661 note_list
= BB_NOTE_LIST (first
);
4662 restore_other_notes (NULL
, first
);
4663 BB_NOTE_LIST (first
) = NULL_RTX
;
4665 FOR_BB_INSNS (first
, insn
)
4666 if (NONDEBUG_INSN_P (insn
))
4667 reemit_notes (insn
);
4669 first
= first
->next_bb
;
4671 while (first
!= last
);
4675 /* Free per-bb data structures. */
4677 sel_finish_bbs (void)
4679 sel_restore_notes ();
4681 /* Remove current loop preheader from this loop. */
4682 if (current_loop_nest
)
4683 sel_remove_loop_preheader ();
4685 finish_region_bb_info ();
4688 /* Return true if INSN has a single successor of type FLAGS. */
4690 sel_insn_has_single_succ_p (insn_t insn
, int flags
)
4694 bool first_p
= true;
4696 FOR_EACH_SUCC_1 (succ
, si
, insn
, flags
)
4707 /* Allocate successor's info. */
4708 static struct succs_info
*
4709 alloc_succs_info (void)
4711 if (succs_info_pool
.top
== succs_info_pool
.max_top
)
4715 if (++succs_info_pool
.max_top
>= succs_info_pool
.size
)
4718 i
= ++succs_info_pool
.top
;
4719 succs_info_pool
.stack
[i
].succs_ok
.create (10);
4720 succs_info_pool
.stack
[i
].succs_other
.create (10);
4721 succs_info_pool
.stack
[i
].probs_ok
.create (10);
4724 succs_info_pool
.top
++;
4726 return &succs_info_pool
.stack
[succs_info_pool
.top
];
4729 /* Free successor's info. */
4731 free_succs_info (struct succs_info
* sinfo
)
4733 gcc_assert (succs_info_pool
.top
>= 0
4734 && &succs_info_pool
.stack
[succs_info_pool
.top
] == sinfo
);
4735 succs_info_pool
.top
--;
4737 /* Clear stale info. */
4738 sinfo
->succs_ok
.block_remove (0, sinfo
->succs_ok
.length ());
4739 sinfo
->succs_other
.block_remove (0, sinfo
->succs_other
.length ());
4740 sinfo
->probs_ok
.block_remove (0, sinfo
->probs_ok
.length ());
4741 sinfo
->all_prob
= 0;
4742 sinfo
->succs_ok_n
= 0;
4743 sinfo
->all_succs_n
= 0;
4746 /* Compute successor info for INSN. FLAGS are the flags passed
4747 to the FOR_EACH_SUCC_1 iterator. */
4749 compute_succs_info (insn_t insn
, short flags
)
4753 struct succs_info
*sinfo
= alloc_succs_info ();
4755 /* Traverse *all* successors and decide what to do with each. */
4756 FOR_EACH_SUCC_1 (succ
, si
, insn
, SUCCS_ALL
)
4758 /* FIXME: this doesn't work for skipping to loop exits, as we don't
4759 perform code motion through inner loops. */
4760 short current_flags
= si
.current_flags
& ~SUCCS_SKIP_TO_LOOP_EXITS
;
4762 if (current_flags
& flags
)
4764 sinfo
->succs_ok
.safe_push (succ
);
4765 sinfo
->probs_ok
.safe_push (
4766 /* FIXME: Improve calculation when skipping
4767 inner loop to exits. */
4768 si
.bb_end
? si
.e1
->probability
: REG_BR_PROB_BASE
);
4769 sinfo
->succs_ok_n
++;
4772 sinfo
->succs_other
.safe_push (succ
);
4774 /* Compute all_prob. */
4776 sinfo
->all_prob
= REG_BR_PROB_BASE
;
4778 sinfo
->all_prob
+= si
.e1
->probability
;
4780 sinfo
->all_succs_n
++;
4786 /* Return the predecessors of BB in PREDS and their number in N.
4787 Empty blocks are skipped. SIZE is used to allocate PREDS. */
4789 cfg_preds_1 (basic_block bb
, insn_t
**preds
, int *n
, int *size
)
4794 gcc_assert (BLOCK_TO_BB (bb
->index
) != 0);
4796 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
4798 basic_block pred_bb
= e
->src
;
4799 insn_t bb_end
= BB_END (pred_bb
);
4801 if (!in_current_region_p (pred_bb
))
4803 gcc_assert (flag_sel_sched_pipelining_outer_loops
4804 && current_loop_nest
);
4808 if (sel_bb_empty_p (pred_bb
))
4809 cfg_preds_1 (pred_bb
, preds
, n
, size
);
4813 *preds
= XRESIZEVEC (insn_t
, *preds
,
4814 (*size
= 2 * *size
+ 1));
4815 (*preds
)[(*n
)++] = bb_end
;
4820 || (flag_sel_sched_pipelining_outer_loops
4821 && current_loop_nest
));
4824 /* Find all predecessors of BB and record them in PREDS and their number
4825 in N. Empty blocks are skipped, and only normal (forward in-region)
4826 edges are processed. */
4828 cfg_preds (basic_block bb
, insn_t
**preds
, int *n
)
4834 cfg_preds_1 (bb
, preds
, n
, &size
);
4837 /* Returns true if we are moving INSN through join point. */
4839 sel_num_cfg_preds_gt_1 (insn_t insn
)
4843 if (!sel_bb_head_p (insn
) || INSN_BB (insn
) == 0)
4846 bb
= BLOCK_FOR_INSN (insn
);
4850 if (EDGE_COUNT (bb
->preds
) > 1)
4853 gcc_assert (EDGE_PRED (bb
, 0)->dest
== bb
);
4854 bb
= EDGE_PRED (bb
, 0)->src
;
4856 if (!sel_bb_empty_p (bb
))
4863 /* Returns true when BB should be the end of an ebb. Adapted from the
4864 code in sched-ebb.c. */
4866 bb_ends_ebb_p (basic_block bb
)
4868 basic_block next_bb
= bb_next_bb (bb
);
4871 if (next_bb
== EXIT_BLOCK_PTR_FOR_FN (cfun
)
4872 || bitmap_bit_p (forced_ebb_heads
, next_bb
->index
)
4873 || (LABEL_P (BB_HEAD (next_bb
))
4874 /* NB: LABEL_NUSES () is not maintained outside of jump.c.
4875 Work around that. */
4876 && !single_pred_p (next_bb
)))
4879 if (!in_current_region_p (next_bb
))
4882 e
= find_fallthru_edge (bb
->succs
);
4885 gcc_assert (e
->dest
== next_bb
);
4893 /* Returns true when INSN and SUCC are in the same EBB, given that SUCC is a
4894 successor of INSN. */
4896 in_same_ebb_p (insn_t insn
, insn_t succ
)
4898 basic_block ptr
= BLOCK_FOR_INSN (insn
);
4902 if (ptr
== BLOCK_FOR_INSN (succ
))
4905 if (bb_ends_ebb_p (ptr
))
4908 ptr
= bb_next_bb (ptr
);
4915 /* Recomputes the reverse topological order for the function and
4916 saves it in REV_TOP_ORDER_INDEX. REV_TOP_ORDER_INDEX_LEN is also
4917 modified appropriately. */
4919 recompute_rev_top_order (void)
4924 if (!rev_top_order_index
4925 || rev_top_order_index_len
< last_basic_block_for_fn (cfun
))
4927 rev_top_order_index_len
= last_basic_block_for_fn (cfun
);
4928 rev_top_order_index
= XRESIZEVEC (int, rev_top_order_index
,
4929 rev_top_order_index_len
);
4932 postorder
= XNEWVEC (int, n_basic_blocks_for_fn (cfun
));
4934 n_blocks
= post_order_compute (postorder
, true, false);
4935 gcc_assert (n_basic_blocks_for_fn (cfun
) == n_blocks
);
4937 /* Build reverse function: for each basic block with BB->INDEX == K
4938 rev_top_order_index[K] is it's reverse topological sort number. */
4939 for (i
= 0; i
< n_blocks
; i
++)
4941 gcc_assert (postorder
[i
] < rev_top_order_index_len
);
4942 rev_top_order_index
[postorder
[i
]] = i
;
4948 /* Clear all flags from insns in BB that could spoil its rescheduling. */
4950 clear_outdated_rtx_info (basic_block bb
)
4954 FOR_BB_INSNS (bb
, insn
)
4957 SCHED_GROUP_P (insn
) = 0;
4958 INSN_AFTER_STALL_P (insn
) = 0;
4959 INSN_SCHED_TIMES (insn
) = 0;
4960 EXPR_PRIORITY_ADJ (INSN_EXPR (insn
)) = 0;
4962 /* We cannot use the changed caches, as previously we could ignore
4963 the LHS dependence due to enabled renaming and transform
4964 the expression, and currently we'll be unable to do this. */
4965 htab_empty (INSN_TRANSFORMED_INSNS (insn
));
4969 /* Add BB_NOTE to the pool of available basic block notes. */
4971 return_bb_to_pool (basic_block bb
)
4973 rtx note
= bb_note (bb
);
4975 gcc_assert (NOTE_BASIC_BLOCK (note
) == bb
4976 && bb
->aux
== NULL
);
4978 /* It turns out that current cfg infrastructure does not support
4979 reuse of basic blocks. Don't bother for now. */
4980 /*bb_note_pool.safe_push (note);*/
4983 /* Get a bb_note from pool or return NULL_RTX if pool is empty. */
4985 get_bb_note_from_pool (void)
4987 if (bb_note_pool
.is_empty ())
4991 rtx note
= bb_note_pool
.pop ();
4993 PREV_INSN (note
) = NULL_RTX
;
4994 NEXT_INSN (note
) = NULL_RTX
;
5000 /* Free bb_note_pool. */
5002 free_bb_note_pool (void)
5004 bb_note_pool
.release ();
5007 /* Setup scheduler pool and successor structure. */
5009 alloc_sched_pools (void)
5013 succs_size
= MAX_WS
+ 1;
5014 succs_info_pool
.stack
= XCNEWVEC (struct succs_info
, succs_size
);
5015 succs_info_pool
.size
= succs_size
;
5016 succs_info_pool
.top
= -1;
5017 succs_info_pool
.max_top
= -1;
5019 sched_lists_pool
= create_alloc_pool ("sel-sched-lists",
5020 sizeof (struct _list_node
), 500);
5023 /* Free the pools. */
5025 free_sched_pools (void)
5029 free_alloc_pool (sched_lists_pool
);
5030 gcc_assert (succs_info_pool
.top
== -1);
5031 for (i
= 0; i
<= succs_info_pool
.max_top
; i
++)
5033 succs_info_pool
.stack
[i
].succs_ok
.release ();
5034 succs_info_pool
.stack
[i
].succs_other
.release ();
5035 succs_info_pool
.stack
[i
].probs_ok
.release ();
5037 free (succs_info_pool
.stack
);
5041 /* Returns a position in RGN where BB can be inserted retaining
5042 topological order. */
5044 find_place_to_insert_bb (basic_block bb
, int rgn
)
5046 bool has_preds_outside_rgn
= false;
5050 /* Find whether we have preds outside the region. */
5051 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
5052 if (!in_current_region_p (e
->src
))
5054 has_preds_outside_rgn
= true;
5058 /* Recompute the top order -- needed when we have > 1 pred
5059 and in case we don't have preds outside. */
5060 if (flag_sel_sched_pipelining_outer_loops
5061 && (has_preds_outside_rgn
|| EDGE_COUNT (bb
->preds
) > 1))
5063 int i
, bbi
= bb
->index
, cur_bbi
;
5065 recompute_rev_top_order ();
5066 for (i
= RGN_NR_BLOCKS (rgn
) - 1; i
>= 0; i
--)
5068 cur_bbi
= BB_TO_BLOCK (i
);
5069 if (rev_top_order_index
[bbi
]
5070 < rev_top_order_index
[cur_bbi
])
5074 /* We skipped the right block, so we increase i. We accommodate
5075 it for increasing by step later, so we decrease i. */
5078 else if (has_preds_outside_rgn
)
5080 /* This is the case when we generate an extra empty block
5081 to serve as region head during pipelining. */
5082 e
= EDGE_SUCC (bb
, 0);
5083 gcc_assert (EDGE_COUNT (bb
->succs
) == 1
5084 && in_current_region_p (EDGE_SUCC (bb
, 0)->dest
)
5085 && (BLOCK_TO_BB (e
->dest
->index
) == 0));
5089 /* We don't have preds outside the region. We should have
5090 the only pred, because the multiple preds case comes from
5091 the pipelining of outer loops, and that is handled above.
5092 Just take the bbi of this single pred. */
5093 if (EDGE_COUNT (bb
->succs
) > 0)
5097 gcc_assert (EDGE_COUNT (bb
->preds
) == 1);
5099 pred_bbi
= EDGE_PRED (bb
, 0)->src
->index
;
5100 return BLOCK_TO_BB (pred_bbi
);
5103 /* BB has no successors. It is safe to put it in the end. */
5104 return current_nr_blocks
- 1;
5107 /* Deletes an empty basic block freeing its data. */
5109 delete_and_free_basic_block (basic_block bb
)
5111 gcc_assert (sel_bb_empty_p (bb
));
5116 bitmap_clear_bit (blocks_to_reschedule
, bb
->index
);
5118 /* Can't assert av_set properties because we use sel_aremove_bb
5119 when removing loop preheader from the region. At the point of
5120 removing the preheader we already have deallocated sel_region_bb_info. */
5121 gcc_assert (BB_LV_SET (bb
) == NULL
5122 && !BB_LV_SET_VALID_P (bb
)
5123 && BB_AV_LEVEL (bb
) == 0
5124 && BB_AV_SET (bb
) == NULL
);
5126 delete_basic_block (bb
);
5129 /* Add BB to the current region and update the region data. */
5131 add_block_to_current_region (basic_block bb
)
5133 int i
, pos
, bbi
= -2, rgn
;
5135 rgn
= CONTAINING_RGN (BB_TO_BLOCK (0));
5136 bbi
= find_place_to_insert_bb (bb
, rgn
);
5138 pos
= RGN_BLOCKS (rgn
) + bbi
;
5140 gcc_assert (RGN_HAS_REAL_EBB (rgn
) == 0
5141 && ebb_head
[bbi
] == pos
);
5143 /* Make a place for the new block. */
5146 for (i
= RGN_BLOCKS (rgn
+ 1) - 1; i
>= pos
; i
--)
5147 BLOCK_TO_BB (rgn_bb_table
[i
])++;
5149 memmove (rgn_bb_table
+ pos
+ 1,
5151 (RGN_BLOCKS (nr_regions
) - pos
) * sizeof (*rgn_bb_table
));
5153 /* Initialize data for BB. */
5154 rgn_bb_table
[pos
] = bb
->index
;
5155 BLOCK_TO_BB (bb
->index
) = bbi
;
5156 CONTAINING_RGN (bb
->index
) = rgn
;
5158 RGN_NR_BLOCKS (rgn
)++;
5160 for (i
= rgn
+ 1; i
<= nr_regions
; i
++)
5164 /* Remove BB from the current region and update the region data. */
5166 remove_bb_from_region (basic_block bb
)
5168 int i
, pos
, bbi
= -2, rgn
;
5170 rgn
= CONTAINING_RGN (BB_TO_BLOCK (0));
5171 bbi
= BLOCK_TO_BB (bb
->index
);
5172 pos
= RGN_BLOCKS (rgn
) + bbi
;
5174 gcc_assert (RGN_HAS_REAL_EBB (rgn
) == 0
5175 && ebb_head
[bbi
] == pos
);
5177 for (i
= RGN_BLOCKS (rgn
+ 1) - 1; i
>= pos
; i
--)
5178 BLOCK_TO_BB (rgn_bb_table
[i
])--;
5180 memmove (rgn_bb_table
+ pos
,
5181 rgn_bb_table
+ pos
+ 1,
5182 (RGN_BLOCKS (nr_regions
) - pos
) * sizeof (*rgn_bb_table
));
5184 RGN_NR_BLOCKS (rgn
)--;
5185 for (i
= rgn
+ 1; i
<= nr_regions
; i
++)
5189 /* Add BB to the current region and update all data. If BB is NULL, add all
5190 blocks from last_added_blocks vector. */
5192 sel_add_bb (basic_block bb
)
5194 /* Extend luids so that new notes will receive zero luids. */
5195 sched_extend_luids ();
5197 sel_init_bbs (last_added_blocks
);
5199 /* When bb is passed explicitly, the vector should contain
5200 the only element that equals to bb; otherwise, the vector
5201 should not be NULL. */
5202 gcc_assert (last_added_blocks
.exists ());
5206 gcc_assert (last_added_blocks
.length () == 1
5207 && last_added_blocks
[0] == bb
);
5208 add_block_to_current_region (bb
);
5210 /* We associate creating/deleting data sets with the first insn
5211 appearing / disappearing in the bb. */
5212 if (!sel_bb_empty_p (bb
) && BB_LV_SET (bb
) == NULL
)
5213 create_initial_data_sets (bb
);
5215 last_added_blocks
.release ();
5218 /* BB is NULL - process LAST_ADDED_BLOCKS instead. */
5221 basic_block temp_bb
= NULL
;
5224 last_added_blocks
.iterate (i
, &bb
); i
++)
5226 add_block_to_current_region (bb
);
5230 /* We need to fetch at least one bb so we know the region
5232 gcc_assert (temp_bb
!= NULL
);
5235 last_added_blocks
.release ();
5238 rgn_setup_region (CONTAINING_RGN (bb
->index
));
5241 /* Remove BB from the current region and update all data.
5242 If REMOVE_FROM_CFG_PBB is true, also remove the block cfom cfg. */
5244 sel_remove_bb (basic_block bb
, bool remove_from_cfg_p
)
5246 unsigned idx
= bb
->index
;
5248 gcc_assert (bb
!= NULL
&& BB_NOTE_LIST (bb
) == NULL_RTX
);
5250 remove_bb_from_region (bb
);
5251 return_bb_to_pool (bb
);
5252 bitmap_clear_bit (blocks_to_reschedule
, idx
);
5254 if (remove_from_cfg_p
)
5256 basic_block succ
= single_succ (bb
);
5257 delete_and_free_basic_block (bb
);
5258 set_immediate_dominator (CDI_DOMINATORS
, succ
,
5259 recompute_dominator (CDI_DOMINATORS
, succ
));
5262 rgn_setup_region (CONTAINING_RGN (idx
));
5265 /* Concatenate info of EMPTY_BB to info of MERGE_BB. */
5267 move_bb_info (basic_block merge_bb
, basic_block empty_bb
)
5269 if (in_current_region_p (merge_bb
))
5270 concat_note_lists (BB_NOTE_LIST (empty_bb
),
5271 &BB_NOTE_LIST (merge_bb
));
5272 BB_NOTE_LIST (empty_bb
) = NULL_RTX
;
5276 /* Remove EMPTY_BB. If REMOVE_FROM_CFG_P is false, remove EMPTY_BB from
5277 region, but keep it in CFG. */
5279 remove_empty_bb (basic_block empty_bb
, bool remove_from_cfg_p
)
5281 /* The block should contain just a note or a label.
5282 We try to check whether it is unused below. */
5283 gcc_assert (BB_HEAD (empty_bb
) == BB_END (empty_bb
)
5284 || LABEL_P (BB_HEAD (empty_bb
)));
5286 /* If basic block has predecessors or successors, redirect them. */
5287 if (remove_from_cfg_p
5288 && (EDGE_COUNT (empty_bb
->preds
) > 0
5289 || EDGE_COUNT (empty_bb
->succs
) > 0))
5294 /* We need to init PRED and SUCC before redirecting edges. */
5295 if (EDGE_COUNT (empty_bb
->preds
) > 0)
5299 gcc_assert (EDGE_COUNT (empty_bb
->preds
) == 1);
5301 e
= EDGE_PRED (empty_bb
, 0);
5302 gcc_assert (e
->src
== empty_bb
->prev_bb
5303 && (e
->flags
& EDGE_FALLTHRU
));
5305 pred
= empty_bb
->prev_bb
;
5310 if (EDGE_COUNT (empty_bb
->succs
) > 0)
5312 /* We do not check fallthruness here as above, because
5313 after removing a jump the edge may actually be not fallthru. */
5314 gcc_assert (EDGE_COUNT (empty_bb
->succs
) == 1);
5315 succ
= EDGE_SUCC (empty_bb
, 0)->dest
;
5320 if (EDGE_COUNT (empty_bb
->preds
) > 0 && succ
!= NULL
)
5322 edge e
= EDGE_PRED (empty_bb
, 0);
5324 if (e
->flags
& EDGE_FALLTHRU
)
5325 redirect_edge_succ_nodup (e
, succ
);
5327 sel_redirect_edge_and_branch (EDGE_PRED (empty_bb
, 0), succ
);
5330 if (EDGE_COUNT (empty_bb
->succs
) > 0 && pred
!= NULL
)
5332 edge e
= EDGE_SUCC (empty_bb
, 0);
5334 if (find_edge (pred
, e
->dest
) == NULL
)
5335 redirect_edge_pred (e
, pred
);
5339 /* Finish removing. */
5340 sel_remove_bb (empty_bb
, remove_from_cfg_p
);
5343 /* An implementation of create_basic_block hook, which additionally updates
5344 per-bb data structures. */
5346 sel_create_basic_block (void *headp
, void *endp
, basic_block after
)
5351 gcc_assert (flag_sel_sched_pipelining_outer_loops
5352 || !last_added_blocks
.exists ());
5354 new_bb_note
= get_bb_note_from_pool ();
5356 if (new_bb_note
== NULL_RTX
)
5357 new_bb
= orig_cfg_hooks
.create_basic_block (headp
, endp
, after
);
5360 new_bb
= create_basic_block_structure ((rtx
) headp
, (rtx
) endp
,
5361 new_bb_note
, after
);
5365 last_added_blocks
.safe_push (new_bb
);
5370 /* Implement sched_init_only_bb (). */
5372 sel_init_only_bb (basic_block bb
, basic_block after
)
5374 gcc_assert (after
== NULL
);
5377 rgn_make_new_region_out_of_new_block (bb
);
5380 /* Update the latch when we've splitted or merged it from FROM block to TO.
5381 This should be checked for all outer loops, too. */
5383 change_loops_latches (basic_block from
, basic_block to
)
5385 gcc_assert (from
!= to
);
5387 if (current_loop_nest
)
5391 for (loop
= current_loop_nest
; loop
; loop
= loop_outer (loop
))
5392 if (considered_for_pipelining_p (loop
) && loop
->latch
== from
)
5394 gcc_assert (loop
== current_loop_nest
);
5396 gcc_assert (loop_latch_edge (loop
));
5401 /* Splits BB on two basic blocks, adding it to the region and extending
5402 per-bb data structures. Returns the newly created bb. */
5404 sel_split_block (basic_block bb
, rtx after
)
5409 new_bb
= sched_split_block_1 (bb
, after
);
5410 sel_add_bb (new_bb
);
5412 /* This should be called after sel_add_bb, because this uses
5413 CONTAINING_RGN for the new block, which is not yet initialized.
5414 FIXME: this function may be a no-op now. */
5415 change_loops_latches (bb
, new_bb
);
5417 /* Update ORIG_BB_INDEX for insns moved into the new block. */
5418 FOR_BB_INSNS (new_bb
, insn
)
5420 EXPR_ORIG_BB_INDEX (INSN_EXPR (insn
)) = new_bb
->index
;
5422 if (sel_bb_empty_p (bb
))
5424 gcc_assert (!sel_bb_empty_p (new_bb
));
5426 /* NEW_BB has data sets that need to be updated and BB holds
5427 data sets that should be removed. Exchange these data sets
5428 so that we won't lose BB's valid data sets. */
5429 exchange_data_sets (new_bb
, bb
);
5430 free_data_sets (bb
);
5433 if (!sel_bb_empty_p (new_bb
)
5434 && bitmap_bit_p (blocks_to_reschedule
, bb
->index
))
5435 bitmap_set_bit (blocks_to_reschedule
, new_bb
->index
);
5440 /* If BB ends with a jump insn whose ID is bigger then PREV_MAX_UID, return it.
5441 Otherwise returns NULL. */
5443 check_for_new_jump (basic_block bb
, int prev_max_uid
)
5447 end
= sel_bb_end (bb
);
5448 if (end
&& INSN_UID (end
) >= prev_max_uid
)
5453 /* Look for a new jump either in FROM_BB block or in newly created JUMP_BB block.
5454 New means having UID at least equal to PREV_MAX_UID. */
5456 find_new_jump (basic_block from
, basic_block jump_bb
, int prev_max_uid
)
5460 /* Return immediately if no new insns were emitted. */
5461 if (get_max_uid () == prev_max_uid
)
5464 /* Now check both blocks for new jumps. It will ever be only one. */
5465 if ((jump
= check_for_new_jump (from
, prev_max_uid
)))
5469 && (jump
= check_for_new_jump (jump_bb
, prev_max_uid
)))
5474 /* Splits E and adds the newly created basic block to the current region.
5475 Returns this basic block. */
5477 sel_split_edge (edge e
)
5479 basic_block new_bb
, src
, other_bb
= NULL
;
5484 prev_max_uid
= get_max_uid ();
5485 new_bb
= split_edge (e
);
5487 if (flag_sel_sched_pipelining_outer_loops
5488 && current_loop_nest
)
5493 /* Some of the basic blocks might not have been added to the loop.
5494 Add them here, until this is fixed in force_fallthru. */
5496 last_added_blocks
.iterate (i
, &bb
); i
++)
5497 if (!bb
->loop_father
)
5499 add_bb_to_loop (bb
, e
->dest
->loop_father
);
5501 gcc_assert (!other_bb
&& (new_bb
->index
!= bb
->index
));
5506 /* Add all last_added_blocks to the region. */
5509 jump
= find_new_jump (src
, new_bb
, prev_max_uid
);
5511 sel_init_new_insn (jump
, INSN_INIT_TODO_LUID
| INSN_INIT_TODO_SIMPLEJUMP
);
5513 /* Put the correct lv set on this block. */
5514 if (other_bb
&& !sel_bb_empty_p (other_bb
))
5515 compute_live (sel_bb_head (other_bb
));
5520 /* Implement sched_create_empty_bb (). */
5522 sel_create_empty_bb (basic_block after
)
5526 new_bb
= sched_create_empty_bb_1 (after
);
5528 /* We'll explicitly initialize NEW_BB via sel_init_only_bb () a bit
5530 gcc_assert (last_added_blocks
.length () == 1
5531 && last_added_blocks
[0] == new_bb
);
5533 last_added_blocks
.release ();
5537 /* Implement sched_create_recovery_block. ORIG_INSN is where block
5538 will be splitted to insert a check. */
5540 sel_create_recovery_block (insn_t orig_insn
)
5542 basic_block first_bb
, second_bb
, recovery_block
;
5543 basic_block before_recovery
= NULL
;
5546 first_bb
= BLOCK_FOR_INSN (orig_insn
);
5547 if (sel_bb_end_p (orig_insn
))
5549 /* Avoid introducing an empty block while splitting. */
5550 gcc_assert (single_succ_p (first_bb
));
5551 second_bb
= single_succ (first_bb
);
5554 second_bb
= sched_split_block (first_bb
, orig_insn
);
5556 recovery_block
= sched_create_recovery_block (&before_recovery
);
5557 if (before_recovery
)
5558 copy_lv_set_from (before_recovery
, EXIT_BLOCK_PTR_FOR_FN (cfun
));
5560 gcc_assert (sel_bb_empty_p (recovery_block
));
5561 sched_create_recovery_edges (first_bb
, recovery_block
, second_bb
);
5562 if (current_loops
!= NULL
)
5563 add_bb_to_loop (recovery_block
, first_bb
->loop_father
);
5565 sel_add_bb (recovery_block
);
5567 jump
= BB_END (recovery_block
);
5568 gcc_assert (sel_bb_head (recovery_block
) == jump
);
5569 sel_init_new_insn (jump
, INSN_INIT_TODO_LUID
| INSN_INIT_TODO_SIMPLEJUMP
);
5571 return recovery_block
;
5574 /* Merge basic block B into basic block A. */
5576 sel_merge_blocks (basic_block a
, basic_block b
)
5578 gcc_assert (sel_bb_empty_p (b
)
5579 && EDGE_COUNT (b
->preds
) == 1
5580 && EDGE_PRED (b
, 0)->src
== b
->prev_bb
);
5582 move_bb_info (b
->prev_bb
, b
);
5583 remove_empty_bb (b
, false);
5584 merge_blocks (a
, b
);
5585 change_loops_latches (b
, a
);
5588 /* A wrapper for redirect_edge_and_branch_force, which also initializes
5589 data structures for possibly created bb and insns. */
5591 sel_redirect_edge_and_branch_force (edge e
, basic_block to
)
5593 basic_block jump_bb
, src
, orig_dest
= e
->dest
;
5598 /* This function is now used only for bookkeeping code creation, where
5599 we'll never get the single pred of orig_dest block and thus will not
5600 hit unreachable blocks when updating dominator info. */
5601 gcc_assert (!sel_bb_empty_p (e
->src
)
5602 && !single_pred_p (orig_dest
));
5604 prev_max_uid
= get_max_uid ();
5605 /* Compute and pass old_seqno down to sel_init_new_insn only for the case
5606 when the conditional jump being redirected may become unconditional. */
5607 if (any_condjump_p (BB_END (src
))
5608 && INSN_SEQNO (BB_END (src
)) >= 0)
5609 old_seqno
= INSN_SEQNO (BB_END (src
));
5611 jump_bb
= redirect_edge_and_branch_force (e
, to
);
5612 if (jump_bb
!= NULL
)
5613 sel_add_bb (jump_bb
);
5615 /* This function could not be used to spoil the loop structure by now,
5616 thus we don't care to update anything. But check it to be sure. */
5617 if (current_loop_nest
5619 gcc_assert (loop_latch_edge (current_loop_nest
));
5621 jump
= find_new_jump (src
, jump_bb
, prev_max_uid
);
5623 sel_init_new_insn (jump
, INSN_INIT_TODO_LUID
| INSN_INIT_TODO_SIMPLEJUMP
,
5625 set_immediate_dominator (CDI_DOMINATORS
, to
,
5626 recompute_dominator (CDI_DOMINATORS
, to
));
5627 set_immediate_dominator (CDI_DOMINATORS
, orig_dest
,
5628 recompute_dominator (CDI_DOMINATORS
, orig_dest
));
5631 /* A wrapper for redirect_edge_and_branch. Return TRUE if blocks connected by
5632 redirected edge are in reverse topological order. */
5634 sel_redirect_edge_and_branch (edge e
, basic_block to
)
5637 basic_block src
, orig_dest
= e
->dest
;
5641 bool recompute_toporder_p
= false;
5642 bool maybe_unreachable
= single_pred_p (orig_dest
);
5645 latch_edge_p
= (pipelining_p
5646 && current_loop_nest
5647 && e
== loop_latch_edge (current_loop_nest
));
5650 prev_max_uid
= get_max_uid ();
5652 /* Compute and pass old_seqno down to sel_init_new_insn only for the case
5653 when the conditional jump being redirected may become unconditional. */
5654 if (any_condjump_p (BB_END (src
))
5655 && INSN_SEQNO (BB_END (src
)) >= 0)
5656 old_seqno
= INSN_SEQNO (BB_END (src
));
5658 redirected
= redirect_edge_and_branch (e
, to
);
5660 gcc_assert (redirected
&& !last_added_blocks
.exists ());
5662 /* When we've redirected a latch edge, update the header. */
5665 current_loop_nest
->header
= to
;
5666 gcc_assert (loop_latch_edge (current_loop_nest
));
5669 /* In rare situations, the topological relation between the blocks connected
5670 by the redirected edge can change (see PR42245 for an example). Update
5671 block_to_bb/bb_to_block. */
5672 if (CONTAINING_RGN (e
->src
->index
) == CONTAINING_RGN (to
->index
)
5673 && BLOCK_TO_BB (e
->src
->index
) > BLOCK_TO_BB (to
->index
))
5674 recompute_toporder_p
= true;
5676 jump
= find_new_jump (src
, NULL
, prev_max_uid
);
5678 sel_init_new_insn (jump
, INSN_INIT_TODO_LUID
| INSN_INIT_TODO_SIMPLEJUMP
, old_seqno
);
5680 /* Only update dominator info when we don't have unreachable blocks.
5681 Otherwise we'll update in maybe_tidy_empty_bb. */
5682 if (!maybe_unreachable
)
5684 set_immediate_dominator (CDI_DOMINATORS
, to
,
5685 recompute_dominator (CDI_DOMINATORS
, to
));
5686 set_immediate_dominator (CDI_DOMINATORS
, orig_dest
,
5687 recompute_dominator (CDI_DOMINATORS
, orig_dest
));
5689 return recompute_toporder_p
;
5692 /* This variable holds the cfg hooks used by the selective scheduler. */
5693 static struct cfg_hooks sel_cfg_hooks
;
5695 /* Register sel-sched cfg hooks. */
5697 sel_register_cfg_hooks (void)
5699 sched_split_block
= sel_split_block
;
5701 orig_cfg_hooks
= get_cfg_hooks ();
5702 sel_cfg_hooks
= orig_cfg_hooks
;
5704 sel_cfg_hooks
.create_basic_block
= sel_create_basic_block
;
5706 set_cfg_hooks (sel_cfg_hooks
);
5708 sched_init_only_bb
= sel_init_only_bb
;
5709 sched_split_block
= sel_split_block
;
5710 sched_create_empty_bb
= sel_create_empty_bb
;
5713 /* Unregister sel-sched cfg hooks. */
5715 sel_unregister_cfg_hooks (void)
5717 sched_create_empty_bb
= NULL
;
5718 sched_split_block
= NULL
;
5719 sched_init_only_bb
= NULL
;
5721 set_cfg_hooks (orig_cfg_hooks
);
5725 /* Emit an insn rtx based on PATTERN. If a jump insn is wanted,
5726 LABEL is where this jump should be directed. */
5728 create_insn_rtx_from_pattern (rtx pattern
, rtx label
)
5732 gcc_assert (!INSN_P (pattern
));
5736 if (label
== NULL_RTX
)
5737 insn_rtx
= emit_insn (pattern
);
5738 else if (DEBUG_INSN_P (label
))
5739 insn_rtx
= emit_debug_insn (pattern
);
5742 insn_rtx
= emit_jump_insn (pattern
);
5743 JUMP_LABEL (insn_rtx
) = label
;
5744 ++LABEL_NUSES (label
);
5749 sched_extend_luids ();
5750 sched_extend_target ();
5751 sched_deps_init (false);
5753 /* Initialize INSN_CODE now. */
5754 recog_memoized (insn_rtx
);
5758 /* Create a new vinsn for INSN_RTX. FORCE_UNIQUE_P is true when the vinsn
5759 must not be clonable. */
5761 create_vinsn_from_insn_rtx (rtx insn_rtx
, bool force_unique_p
)
5763 gcc_assert (INSN_P (insn_rtx
) && !INSN_IN_STREAM_P (insn_rtx
));
5765 /* If VINSN_TYPE is not USE, retain its uniqueness. */
5766 return vinsn_create (insn_rtx
, force_unique_p
);
5769 /* Create a copy of INSN_RTX. */
5771 create_copy_of_insn_rtx (rtx insn_rtx
)
5775 if (DEBUG_INSN_P (insn_rtx
))
5776 return create_insn_rtx_from_pattern (copy_rtx (PATTERN (insn_rtx
)),
5779 gcc_assert (NONJUMP_INSN_P (insn_rtx
));
5781 res
= create_insn_rtx_from_pattern (copy_rtx (PATTERN (insn_rtx
)),
5784 /* Copy all REG_NOTES except REG_EQUAL/REG_EQUIV and REG_LABEL_OPERAND
5785 since mark_jump_label will make them. REG_LABEL_TARGETs are created
5786 there too, but are supposed to be sticky, so we copy them. */
5787 for (link
= REG_NOTES (insn_rtx
); link
; link
= XEXP (link
, 1))
5788 if (REG_NOTE_KIND (link
) != REG_LABEL_OPERAND
5789 && REG_NOTE_KIND (link
) != REG_EQUAL
5790 && REG_NOTE_KIND (link
) != REG_EQUIV
)
5792 if (GET_CODE (link
) == EXPR_LIST
)
5793 add_reg_note (res
, REG_NOTE_KIND (link
),
5794 copy_insn_1 (XEXP (link
, 0)));
5796 add_reg_note (res
, REG_NOTE_KIND (link
), XEXP (link
, 0));
5802 /* Change vinsn field of EXPR to hold NEW_VINSN. */
5804 change_vinsn_in_expr (expr_t expr
, vinsn_t new_vinsn
)
5806 vinsn_detach (EXPR_VINSN (expr
));
5808 EXPR_VINSN (expr
) = new_vinsn
;
5809 vinsn_attach (new_vinsn
);
5812 /* Helpers for global init. */
5813 /* This structure is used to be able to call existing bundling mechanism
5814 and calculate insn priorities. */
5815 static struct haifa_sched_info sched_sel_haifa_sched_info
=
5817 NULL
, /* init_ready_list */
5818 NULL
, /* can_schedule_ready_p */
5819 NULL
, /* schedule_more_p */
5820 NULL
, /* new_ready */
5821 NULL
, /* rgn_rank */
5822 sel_print_insn
, /* rgn_print_insn */
5823 contributes_to_priority
,
5824 NULL
, /* insn_finishes_block_p */
5830 NULL
, /* add_remove_insn */
5831 NULL
, /* begin_schedule_ready */
5832 NULL
, /* begin_move_insn */
5833 NULL
, /* advance_target_bb */
5841 /* Setup special insns used in the scheduler. */
5843 setup_nop_and_exit_insns (void)
5845 gcc_assert (nop_pattern
== NULL_RTX
5846 && exit_insn
== NULL_RTX
);
5848 nop_pattern
= constm1_rtx
;
5851 emit_insn (nop_pattern
);
5852 exit_insn
= get_insns ();
5854 set_block_for_insn (exit_insn
, EXIT_BLOCK_PTR_FOR_FN (cfun
));
5857 /* Free special insns used in the scheduler. */
5859 free_nop_and_exit_insns (void)
5861 exit_insn
= NULL_RTX
;
5862 nop_pattern
= NULL_RTX
;
5865 /* Setup a special vinsn used in new insns initialization. */
5867 setup_nop_vinsn (void)
5869 nop_vinsn
= vinsn_create (exit_insn
, false);
5870 vinsn_attach (nop_vinsn
);
5873 /* Free a special vinsn used in new insns initialization. */
5875 free_nop_vinsn (void)
5877 gcc_assert (VINSN_COUNT (nop_vinsn
) == 1);
5878 vinsn_detach (nop_vinsn
);
5882 /* Call a set_sched_flags hook. */
5884 sel_set_sched_flags (void)
5886 /* ??? This means that set_sched_flags were called, and we decided to
5887 support speculation. However, set_sched_flags also modifies flags
5888 on current_sched_info, doing this only at global init. And we
5889 sometimes change c_s_i later. So put the correct flags again. */
5890 if (spec_info
&& targetm
.sched
.set_sched_flags
)
5891 targetm
.sched
.set_sched_flags (spec_info
);
5894 /* Setup pointers to global sched info structures. */
5896 sel_setup_sched_infos (void)
5898 rgn_setup_common_sched_info ();
5900 memcpy (&sel_common_sched_info
, common_sched_info
,
5901 sizeof (sel_common_sched_info
));
5903 sel_common_sched_info
.fix_recovery_cfg
= NULL
;
5904 sel_common_sched_info
.add_block
= NULL
;
5905 sel_common_sched_info
.estimate_number_of_insns
5906 = sel_estimate_number_of_insns
;
5907 sel_common_sched_info
.luid_for_non_insn
= sel_luid_for_non_insn
;
5908 sel_common_sched_info
.sched_pass_id
= SCHED_SEL_PASS
;
5910 common_sched_info
= &sel_common_sched_info
;
5912 current_sched_info
= &sched_sel_haifa_sched_info
;
5913 current_sched_info
->sched_max_insns_priority
=
5914 get_rgn_sched_max_insns_priority ();
5916 sel_set_sched_flags ();
5920 /* Adds basic block BB to region RGN at the position *BB_ORD_INDEX,
5921 *BB_ORD_INDEX after that is increased. */
5923 sel_add_block_to_region (basic_block bb
, int *bb_ord_index
, int rgn
)
5925 RGN_NR_BLOCKS (rgn
) += 1;
5926 RGN_DONT_CALC_DEPS (rgn
) = 0;
5927 RGN_HAS_REAL_EBB (rgn
) = 0;
5928 CONTAINING_RGN (bb
->index
) = rgn
;
5929 BLOCK_TO_BB (bb
->index
) = *bb_ord_index
;
5930 rgn_bb_table
[RGN_BLOCKS (rgn
) + *bb_ord_index
] = bb
->index
;
5933 /* FIXME: it is true only when not scheduling ebbs. */
5934 RGN_BLOCKS (rgn
+ 1) = RGN_BLOCKS (rgn
) + RGN_NR_BLOCKS (rgn
);
5937 /* Functions to support pipelining of outer loops. */
5939 /* Creates a new empty region and returns it's number. */
5941 sel_create_new_region (void)
5943 int new_rgn_number
= nr_regions
;
5945 RGN_NR_BLOCKS (new_rgn_number
) = 0;
5947 /* FIXME: This will work only when EBBs are not created. */
5948 if (new_rgn_number
!= 0)
5949 RGN_BLOCKS (new_rgn_number
) = RGN_BLOCKS (new_rgn_number
- 1) +
5950 RGN_NR_BLOCKS (new_rgn_number
- 1);
5952 RGN_BLOCKS (new_rgn_number
) = 0;
5954 /* Set the blocks of the next region so the other functions may
5955 calculate the number of blocks in the region. */
5956 RGN_BLOCKS (new_rgn_number
+ 1) = RGN_BLOCKS (new_rgn_number
) +
5957 RGN_NR_BLOCKS (new_rgn_number
);
5961 return new_rgn_number
;
5964 /* If X has a smaller topological sort number than Y, returns -1;
5965 if greater, returns 1. */
5967 bb_top_order_comparator (const void *x
, const void *y
)
5969 basic_block bb1
= *(const basic_block
*) x
;
5970 basic_block bb2
= *(const basic_block
*) y
;
5972 gcc_assert (bb1
== bb2
5973 || rev_top_order_index
[bb1
->index
]
5974 != rev_top_order_index
[bb2
->index
]);
5976 /* It's a reverse topological order in REV_TOP_ORDER_INDEX, so
5977 bbs with greater number should go earlier. */
5978 if (rev_top_order_index
[bb1
->index
] > rev_top_order_index
[bb2
->index
])
5984 /* Create a region for LOOP and return its number. If we don't want
5985 to pipeline LOOP, return -1. */
5987 make_region_from_loop (struct loop
*loop
)
5990 int new_rgn_number
= -1;
5993 /* Basic block index, to be assigned to BLOCK_TO_BB. */
5994 int bb_ord_index
= 0;
5995 basic_block
*loop_blocks
;
5996 basic_block preheader_block
;
5999 > (unsigned) PARAM_VALUE (PARAM_MAX_PIPELINE_REGION_BLOCKS
))
6002 /* Don't pipeline loops whose latch belongs to some of its inner loops. */
6003 for (inner
= loop
->inner
; inner
; inner
= inner
->inner
)
6004 if (flow_bb_inside_loop_p (inner
, loop
->latch
))
6007 loop
->ninsns
= num_loop_insns (loop
);
6008 if ((int) loop
->ninsns
> PARAM_VALUE (PARAM_MAX_PIPELINE_REGION_INSNS
))
6011 loop_blocks
= get_loop_body_in_custom_order (loop
, bb_top_order_comparator
);
6013 for (i
= 0; i
< loop
->num_nodes
; i
++)
6014 if (loop_blocks
[i
]->flags
& BB_IRREDUCIBLE_LOOP
)
6020 preheader_block
= loop_preheader_edge (loop
)->src
;
6021 gcc_assert (preheader_block
);
6022 gcc_assert (loop_blocks
[0] == loop
->header
);
6024 new_rgn_number
= sel_create_new_region ();
6026 sel_add_block_to_region (preheader_block
, &bb_ord_index
, new_rgn_number
);
6027 bitmap_set_bit (bbs_in_loop_rgns
, preheader_block
->index
);
6029 for (i
= 0; i
< loop
->num_nodes
; i
++)
6031 /* Add only those blocks that haven't been scheduled in the inner loop.
6032 The exception is the basic blocks with bookkeeping code - they should
6033 be added to the region (and they actually don't belong to the loop
6034 body, but to the region containing that loop body). */
6036 gcc_assert (new_rgn_number
>= 0);
6038 if (! bitmap_bit_p (bbs_in_loop_rgns
, loop_blocks
[i
]->index
))
6040 sel_add_block_to_region (loop_blocks
[i
], &bb_ord_index
,
6042 bitmap_set_bit (bbs_in_loop_rgns
, loop_blocks
[i
]->index
);
6047 MARK_LOOP_FOR_PIPELINING (loop
);
6049 return new_rgn_number
;
6052 /* Create a new region from preheader blocks LOOP_BLOCKS. */
6054 make_region_from_loop_preheader (vec
<basic_block
> *&loop_blocks
)
6057 int new_rgn_number
= -1;
6060 /* Basic block index, to be assigned to BLOCK_TO_BB. */
6061 int bb_ord_index
= 0;
6063 new_rgn_number
= sel_create_new_region ();
6065 FOR_EACH_VEC_ELT (*loop_blocks
, i
, bb
)
6067 gcc_assert (new_rgn_number
>= 0);
6069 sel_add_block_to_region (bb
, &bb_ord_index
, new_rgn_number
);
6072 vec_free (loop_blocks
);
6076 /* Create region(s) from loop nest LOOP, such that inner loops will be
6077 pipelined before outer loops. Returns true when a region for LOOP
6080 make_regions_from_loop_nest (struct loop
*loop
)
6082 struct loop
*cur_loop
;
6085 /* Traverse all inner nodes of the loop. */
6086 for (cur_loop
= loop
->inner
; cur_loop
; cur_loop
= cur_loop
->next
)
6087 if (! bitmap_bit_p (bbs_in_loop_rgns
, cur_loop
->header
->index
))
6090 /* At this moment all regular inner loops should have been pipelined.
6091 Try to create a region from this loop. */
6092 rgn_number
= make_region_from_loop (loop
);
6097 loop_nests
.safe_push (loop
);
6101 /* Initalize data structures needed. */
6103 sel_init_pipelining (void)
6105 /* Collect loop information to be used in outer loops pipelining. */
6106 loop_optimizer_init (LOOPS_HAVE_PREHEADERS
6107 | LOOPS_HAVE_FALLTHRU_PREHEADERS
6108 | LOOPS_HAVE_RECORDED_EXITS
6109 | LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS
);
6110 current_loop_nest
= NULL
;
6112 bbs_in_loop_rgns
= sbitmap_alloc (last_basic_block_for_fn (cfun
));
6113 bitmap_clear (bbs_in_loop_rgns
);
6115 recompute_rev_top_order ();
6118 /* Returns a struct loop for region RGN. */
6120 get_loop_nest_for_rgn (unsigned int rgn
)
6122 /* Regions created with extend_rgns don't have corresponding loop nests,
6123 because they don't represent loops. */
6124 if (rgn
< loop_nests
.length ())
6125 return loop_nests
[rgn
];
6130 /* True when LOOP was included into pipelining regions. */
6132 considered_for_pipelining_p (struct loop
*loop
)
6134 if (loop_depth (loop
) == 0)
6137 /* Now, the loop could be too large or irreducible. Check whether its
6138 region is in LOOP_NESTS.
6139 We determine the region number of LOOP as the region number of its
6140 latch. We can't use header here, because this header could be
6141 just removed preheader and it will give us the wrong region number.
6142 Latch can't be used because it could be in the inner loop too. */
6143 if (LOOP_MARKED_FOR_PIPELINING_P (loop
))
6145 int rgn
= CONTAINING_RGN (loop
->latch
->index
);
6147 gcc_assert ((unsigned) rgn
< loop_nests
.length ());
6154 /* Makes regions from the rest of the blocks, after loops are chosen
6157 make_regions_from_the_rest (void)
6168 /* Index in rgn_bb_table where to start allocating new regions. */
6169 cur_rgn_blocks
= nr_regions
? RGN_BLOCKS (nr_regions
) : 0;
6171 /* Make regions from all the rest basic blocks - those that don't belong to
6172 any loop or belong to irreducible loops. Prepare the data structures
6175 /* LOOP_HDR[I] == -1 if I-th bb doesn't belong to any loop,
6176 LOOP_HDR[I] == LOOP_HDR[J] iff basic blocks I and J reside within the same
6178 loop_hdr
= XNEWVEC (int, last_basic_block_for_fn (cfun
));
6179 degree
= XCNEWVEC (int, last_basic_block_for_fn (cfun
));
6182 /* For each basic block that belongs to some loop assign the number
6183 of innermost loop it belongs to. */
6184 for (i
= 0; i
< last_basic_block_for_fn (cfun
); i
++)
6187 FOR_EACH_BB_FN (bb
, cfun
)
6189 if (bb
->loop_father
&& !bb
->loop_father
->num
== 0
6190 && !(bb
->flags
& BB_IRREDUCIBLE_LOOP
))
6191 loop_hdr
[bb
->index
] = bb
->loop_father
->num
;
6194 /* For each basic block degree is calculated as the number of incoming
6195 edges, that are going out of bbs that are not yet scheduled.
6196 The basic blocks that are scheduled have degree value of zero. */
6197 FOR_EACH_BB_FN (bb
, cfun
)
6199 degree
[bb
->index
] = 0;
6201 if (!bitmap_bit_p (bbs_in_loop_rgns
, bb
->index
))
6203 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
6204 if (!bitmap_bit_p (bbs_in_loop_rgns
, e
->src
->index
))
6205 degree
[bb
->index
]++;
6208 degree
[bb
->index
] = -1;
6211 extend_rgns (degree
, &cur_rgn_blocks
, bbs_in_loop_rgns
, loop_hdr
);
6213 /* Any block that did not end up in a region is placed into a region
6215 FOR_EACH_BB_FN (bb
, cfun
)
6216 if (degree
[bb
->index
] >= 0)
6218 rgn_bb_table
[cur_rgn_blocks
] = bb
->index
;
6219 RGN_NR_BLOCKS (nr_regions
) = 1;
6220 RGN_BLOCKS (nr_regions
) = cur_rgn_blocks
++;
6221 RGN_DONT_CALC_DEPS (nr_regions
) = 0;
6222 RGN_HAS_REAL_EBB (nr_regions
) = 0;
6223 CONTAINING_RGN (bb
->index
) = nr_regions
++;
6224 BLOCK_TO_BB (bb
->index
) = 0;
6231 /* Free data structures used in pipelining of loops. */
6232 void sel_finish_pipelining (void)
6236 /* Release aux fields so we don't free them later by mistake. */
6237 FOR_EACH_LOOP (loop
, 0)
6240 loop_optimizer_finalize ();
6242 loop_nests
.release ();
6244 free (rev_top_order_index
);
6245 rev_top_order_index
= NULL
;
6248 /* This function replaces the find_rgns when
6249 FLAG_SEL_SCHED_PIPELINING_OUTER_LOOPS is set. */
6251 sel_find_rgns (void)
6253 sel_init_pipelining ();
6260 FOR_EACH_LOOP (loop
, (flag_sel_sched_pipelining_outer_loops
6262 : LI_ONLY_INNERMOST
))
6263 make_regions_from_loop_nest (loop
);
6266 /* Make regions from all the rest basic blocks and schedule them.
6267 These blocks include blocks that don't belong to any loop or belong
6268 to irreducible loops. */
6269 make_regions_from_the_rest ();
6271 /* We don't need bbs_in_loop_rgns anymore. */
6272 sbitmap_free (bbs_in_loop_rgns
);
6273 bbs_in_loop_rgns
= NULL
;
6276 /* Add the preheader blocks from previous loop to current region taking
6277 it from LOOP_PREHEADER_BLOCKS (current_loop_nest) and record them in *BBS.
6278 This function is only used with -fsel-sched-pipelining-outer-loops. */
6280 sel_add_loop_preheaders (bb_vec_t
*bbs
)
6284 vec
<basic_block
> *preheader_blocks
6285 = LOOP_PREHEADER_BLOCKS (current_loop_nest
);
6287 if (!preheader_blocks
)
6290 for (i
= 0; preheader_blocks
->iterate (i
, &bb
); i
++)
6292 bbs
->safe_push (bb
);
6293 last_added_blocks
.safe_push (bb
);
6297 vec_free (preheader_blocks
);
6300 /* While pipelining outer loops, returns TRUE if BB is a loop preheader.
6301 Please note that the function should also work when pipelining_p is
6302 false, because it is used when deciding whether we should or should
6303 not reschedule pipelined code. */
6305 sel_is_loop_preheader_p (basic_block bb
)
6307 if (current_loop_nest
)
6311 if (preheader_removed
)
6314 /* Preheader is the first block in the region. */
6315 if (BLOCK_TO_BB (bb
->index
) == 0)
6318 /* We used to find a preheader with the topological information.
6319 Check that the above code is equivalent to what we did before. */
6321 if (in_current_region_p (current_loop_nest
->header
))
6322 gcc_assert (!(BLOCK_TO_BB (bb
->index
)
6323 < BLOCK_TO_BB (current_loop_nest
->header
->index
)));
6325 /* Support the situation when the latch block of outer loop
6326 could be from here. */
6327 for (outer
= loop_outer (current_loop_nest
);
6329 outer
= loop_outer (outer
))
6330 if (considered_for_pipelining_p (outer
) && outer
->latch
== bb
)
6337 /* Check whether JUMP_BB ends with a jump insn that leads only to DEST_BB and
6338 can be removed, making the corresponding edge fallthrough (assuming that
6339 all basic blocks between JUMP_BB and DEST_BB are empty). */
6341 bb_has_removable_jump_to_p (basic_block jump_bb
, basic_block dest_bb
)
6343 if (!onlyjump_p (BB_END (jump_bb
))
6344 || tablejump_p (BB_END (jump_bb
), NULL
, NULL
))
6347 /* Several outgoing edges, abnormal edge or destination of jump is
6349 if (EDGE_COUNT (jump_bb
->succs
) != 1
6350 || EDGE_SUCC (jump_bb
, 0)->flags
& (EDGE_ABNORMAL
| EDGE_CROSSING
)
6351 || EDGE_SUCC (jump_bb
, 0)->dest
!= dest_bb
)
6354 /* If not anything of the upper. */
6358 /* Removes the loop preheader from the current region and saves it in
6359 PREHEADER_BLOCKS of the father loop, so they will be added later to
6360 region that represents an outer loop. */
6362 sel_remove_loop_preheader (void)
6365 int cur_rgn
= CONTAINING_RGN (BB_TO_BLOCK (0));
6367 bool all_empty_p
= true;
6368 vec
<basic_block
> *preheader_blocks
6369 = LOOP_PREHEADER_BLOCKS (loop_outer (current_loop_nest
));
6371 vec_check_alloc (preheader_blocks
, 0);
6373 gcc_assert (current_loop_nest
);
6374 old_len
= preheader_blocks
->length ();
6376 /* Add blocks that aren't within the current loop to PREHEADER_BLOCKS. */
6377 for (i
= 0; i
< RGN_NR_BLOCKS (cur_rgn
); i
++)
6379 bb
= BASIC_BLOCK_FOR_FN (cfun
, BB_TO_BLOCK (i
));
6381 /* If the basic block belongs to region, but doesn't belong to
6382 corresponding loop, then it should be a preheader. */
6383 if (sel_is_loop_preheader_p (bb
))
6385 preheader_blocks
->safe_push (bb
);
6386 if (BB_END (bb
) != bb_note (bb
))
6387 all_empty_p
= false;
6391 /* Remove these blocks only after iterating over the whole region. */
6392 for (i
= preheader_blocks
->length () - 1; i
>= old_len
; i
--)
6394 bb
= (*preheader_blocks
)[i
];
6395 sel_remove_bb (bb
, false);
6398 if (!considered_for_pipelining_p (loop_outer (current_loop_nest
)))
6401 /* Immediately create new region from preheader. */
6402 make_region_from_loop_preheader (preheader_blocks
);
6405 /* If all preheader blocks are empty - dont create new empty region.
6406 Instead, remove them completely. */
6407 FOR_EACH_VEC_ELT (*preheader_blocks
, i
, bb
)
6411 basic_block prev_bb
= bb
->prev_bb
, next_bb
= bb
->next_bb
;
6413 /* Redirect all incoming edges to next basic block. */
6414 for (ei
= ei_start (bb
->preds
); (e
= ei_safe_edge (ei
)); )
6416 if (! (e
->flags
& EDGE_FALLTHRU
))
6417 redirect_edge_and_branch (e
, bb
->next_bb
);
6419 redirect_edge_succ (e
, bb
->next_bb
);
6421 gcc_assert (BB_NOTE_LIST (bb
) == NULL
);
6422 delete_and_free_basic_block (bb
);
6424 /* Check if after deleting preheader there is a nonconditional
6425 jump in PREV_BB that leads to the next basic block NEXT_BB.
6426 If it is so - delete this jump and clear data sets of its
6427 basic block if it becomes empty. */
6428 if (next_bb
->prev_bb
== prev_bb
6429 && prev_bb
!= ENTRY_BLOCK_PTR_FOR_FN (cfun
)
6430 && bb_has_removable_jump_to_p (prev_bb
, next_bb
))
6432 redirect_edge_and_branch (EDGE_SUCC (prev_bb
, 0), next_bb
);
6433 if (BB_END (prev_bb
) == bb_note (prev_bb
))
6434 free_data_sets (prev_bb
);
6437 set_immediate_dominator (CDI_DOMINATORS
, next_bb
,
6438 recompute_dominator (CDI_DOMINATORS
,
6442 vec_free (preheader_blocks
);
6445 /* Store preheader within the father's loop structure. */
6446 SET_LOOP_PREHEADER_BLOCKS (loop_outer (current_loop_nest
),