1 /* Instruction scheduling pass. Selective scheduler and pipeliner.
2 Copyright (C) 2006, 2007, 2008, 2009, 2010 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"
38 #include "tree-pass.h"
39 #include "sched-int.h"
43 #include "langhooks.h"
44 #include "rtlhooks-def.h"
45 #include "emit-rtl.h" /* FIXME: Can go away once crtl is moved to rtl.h. */
47 #ifdef INSN_SCHEDULING
48 #include "sel-sched-ir.h"
49 /* We don't have to use it except for sel_print_insn. */
50 #include "sel-sched-dump.h"
52 /* A vector holding bb info for whole scheduling pass. */
53 VEC(sel_global_bb_info_def, heap) *sel_global_bb_info = NULL;
55 /* A vector holding bb info. */
56 VEC(sel_region_bb_info_def, heap) *sel_region_bb_info = NULL;
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, heap) *loop_nests = NULL;
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, heap) **);
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);
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,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));
587 delete_deps_context (dc);
590 delete_target_context (tc);
591 VEC_free (rtx, gc, FENCE_EXECUTING_INSNS (f));
592 free (FENCE_READY_TICKS (f));
593 FENCE_READY_TICKS (f) = NULL;
596 /* Init a list of fences with successors of OLD_FENCE. */
598 init_fences (insn_t old_fence)
603 int ready_ticks_size = get_max_uid () + 1;
605 FOR_EACH_SUCC_1 (succ, si, old_fence,
606 SUCCS_NORMAL | SUCCS_SKIP_TO_LOOP_EXITS)
612 gcc_assert (flag_sel_sched_pipelining_outer_loops);
614 flist_add (&fences, succ,
616 create_deps_context () /* dc */,
617 create_target_context (true) /* tc */,
618 NULL_RTX /* last_scheduled_insn */,
619 NULL, /* executing_insns */
620 XCNEWVEC (int, ready_ticks_size), /* ready_ticks */
622 NULL_RTX /* sched_next */,
623 1 /* cycle */, 0 /* cycle_issued_insns */,
624 issue_rate, /* issue_more */
625 1 /* starts_cycle_p */, 0 /* after_stall_p */);
629 /* Merges two fences (filling fields of fence F with resulting values) by
630 following rules: 1) state, target context and last scheduled insn are
631 propagated from fallthrough edge if it is available;
632 2) deps context and cycle is propagated from more probable edge;
633 3) all other fields are set to corresponding constant values.
635 INSN, STATE, DC, TC, LAST_SCHEDULED_INSN, EXECUTING_INSNS,
636 READY_TICKS, READY_TICKS_SIZE, SCHED_NEXT, CYCLE, ISSUE_MORE
637 and AFTER_STALL_P are the corresponding fields of the second fence. */
639 merge_fences (fence_t f, insn_t insn,
640 state_t state, deps_t dc, void *tc,
641 rtx last_scheduled_insn, VEC(rtx, gc) *executing_insns,
642 int *ready_ticks, int ready_ticks_size,
643 rtx sched_next, int cycle, int issue_more, bool after_stall_p)
645 insn_t last_scheduled_insn_old = FENCE_LAST_SCHEDULED_INSN (f);
647 gcc_assert (sel_bb_head_p (FENCE_INSN (f))
648 && !sched_next && !FENCE_SCHED_NEXT (f));
650 /* Check if we can decide which path fences came.
651 If we can't (or don't want to) - reset all. */
652 if (last_scheduled_insn == NULL
653 || last_scheduled_insn_old == NULL
654 /* This is a case when INSN is reachable on several paths from
655 one insn (this can happen when pipelining of outer loops is on and
656 there are two edges: one going around of inner loop and the other -
657 right through it; in such case just reset everything). */
658 || last_scheduled_insn == last_scheduled_insn_old)
660 state_reset (FENCE_STATE (f));
663 reset_deps_context (FENCE_DC (f));
664 delete_deps_context (dc);
666 reset_target_context (FENCE_TC (f), true);
667 delete_target_context (tc);
669 if (cycle > FENCE_CYCLE (f))
670 FENCE_CYCLE (f) = cycle;
672 FENCE_LAST_SCHEDULED_INSN (f) = NULL;
673 FENCE_ISSUE_MORE (f) = issue_rate;
674 VEC_free (rtx, gc, executing_insns);
676 if (FENCE_EXECUTING_INSNS (f))
677 VEC_block_remove (rtx, FENCE_EXECUTING_INSNS (f), 0,
678 VEC_length (rtx, FENCE_EXECUTING_INSNS (f)));
679 if (FENCE_READY_TICKS (f))
680 memset (FENCE_READY_TICKS (f), 0, FENCE_READY_TICKS_SIZE (f));
684 edge edge_old = NULL, edge_new = NULL;
689 /* Find fallthrough edge. */
690 gcc_assert (BLOCK_FOR_INSN (insn)->prev_bb);
691 candidate = find_fallthru_edge_from (BLOCK_FOR_INSN (insn)->prev_bb);
694 || (candidate->src != BLOCK_FOR_INSN (last_scheduled_insn)
695 && candidate->src != BLOCK_FOR_INSN (last_scheduled_insn_old)))
697 /* No fallthrough edge leading to basic block of INSN. */
698 state_reset (FENCE_STATE (f));
701 reset_target_context (FENCE_TC (f), true);
702 delete_target_context (tc);
704 FENCE_LAST_SCHEDULED_INSN (f) = NULL;
705 FENCE_ISSUE_MORE (f) = issue_rate;
708 if (candidate->src == BLOCK_FOR_INSN (last_scheduled_insn))
710 /* Would be weird if same insn is successor of several fallthrough
712 gcc_assert (BLOCK_FOR_INSN (insn)->prev_bb
713 != BLOCK_FOR_INSN (last_scheduled_insn_old));
715 state_free (FENCE_STATE (f));
716 FENCE_STATE (f) = state;
718 delete_target_context (FENCE_TC (f));
721 FENCE_LAST_SCHEDULED_INSN (f) = last_scheduled_insn;
722 FENCE_ISSUE_MORE (f) = issue_more;
726 /* Leave STATE, TC and LAST_SCHEDULED_INSN fields untouched. */
728 delete_target_context (tc);
730 gcc_assert (BLOCK_FOR_INSN (insn)->prev_bb
731 != BLOCK_FOR_INSN (last_scheduled_insn));
734 /* Find edge of first predecessor (last_scheduled_insn_old->insn). */
735 FOR_EACH_SUCC_1 (succ, si, last_scheduled_insn_old,
736 SUCCS_NORMAL | SUCCS_SKIP_TO_LOOP_EXITS)
740 /* No same successor allowed from several edges. */
741 gcc_assert (!edge_old);
745 /* Find edge of second predecessor (last_scheduled_insn->insn). */
746 FOR_EACH_SUCC_1 (succ, si, last_scheduled_insn,
747 SUCCS_NORMAL | SUCCS_SKIP_TO_LOOP_EXITS)
751 /* No same successor allowed from several edges. */
752 gcc_assert (!edge_new);
757 /* Check if we can choose most probable predecessor. */
758 if (edge_old == NULL || edge_new == NULL)
760 reset_deps_context (FENCE_DC (f));
761 delete_deps_context (dc);
762 VEC_free (rtx, gc, executing_insns);
765 FENCE_CYCLE (f) = MAX (FENCE_CYCLE (f), cycle);
766 if (FENCE_EXECUTING_INSNS (f))
767 VEC_block_remove (rtx, FENCE_EXECUTING_INSNS (f), 0,
768 VEC_length (rtx, FENCE_EXECUTING_INSNS (f)));
769 if (FENCE_READY_TICKS (f))
770 memset (FENCE_READY_TICKS (f), 0, FENCE_READY_TICKS_SIZE (f));
773 if (edge_new->probability > edge_old->probability)
775 delete_deps_context (FENCE_DC (f));
777 VEC_free (rtx, gc, FENCE_EXECUTING_INSNS (f));
778 FENCE_EXECUTING_INSNS (f) = executing_insns;
779 free (FENCE_READY_TICKS (f));
780 FENCE_READY_TICKS (f) = ready_ticks;
781 FENCE_READY_TICKS_SIZE (f) = ready_ticks_size;
782 FENCE_CYCLE (f) = cycle;
786 /* Leave DC and CYCLE untouched. */
787 delete_deps_context (dc);
788 VEC_free (rtx, gc, executing_insns);
793 /* Fill remaining invariant fields. */
795 FENCE_AFTER_STALL_P (f) = 1;
797 FENCE_ISSUED_INSNS (f) = 0;
798 FENCE_STARTS_CYCLE_P (f) = 1;
799 FENCE_SCHED_NEXT (f) = NULL;
802 /* Add a new fence to NEW_FENCES list, initializing it from all
805 add_to_fences (flist_tail_t new_fences, insn_t insn,
806 state_t state, deps_t dc, void *tc, rtx last_scheduled_insn,
807 VEC(rtx, gc) *executing_insns, int *ready_ticks,
808 int ready_ticks_size, rtx sched_next, int cycle,
809 int cycle_issued_insns, int issue_rate,
810 bool starts_cycle_p, bool after_stall_p)
812 fence_t f = flist_lookup (FLIST_TAIL_HEAD (new_fences), insn);
816 flist_add (FLIST_TAIL_TAILP (new_fences), insn, state, dc, tc,
817 last_scheduled_insn, executing_insns, ready_ticks,
818 ready_ticks_size, sched_next, cycle, cycle_issued_insns,
819 issue_rate, starts_cycle_p, after_stall_p);
821 FLIST_TAIL_TAILP (new_fences)
822 = &FLIST_NEXT (*FLIST_TAIL_TAILP (new_fences));
826 merge_fences (f, insn, state, dc, tc, last_scheduled_insn,
827 executing_insns, ready_ticks, ready_ticks_size,
828 sched_next, cycle, issue_rate, after_stall_p);
832 /* Move the first fence in the OLD_FENCES list to NEW_FENCES. */
834 move_fence_to_fences (flist_t old_fences, flist_tail_t new_fences)
837 flist_t *tailp = FLIST_TAIL_TAILP (new_fences);
839 old = FLIST_FENCE (old_fences);
840 f = flist_lookup (FLIST_TAIL_HEAD (new_fences),
841 FENCE_INSN (FLIST_FENCE (old_fences)));
844 merge_fences (f, old->insn, old->state, old->dc, old->tc,
845 old->last_scheduled_insn, old->executing_insns,
846 old->ready_ticks, old->ready_ticks_size,
847 old->sched_next, old->cycle, old->issue_more,
853 FLIST_TAIL_TAILP (new_fences) = &FLIST_NEXT (*tailp);
854 *FLIST_FENCE (*tailp) = *old;
855 init_fence_for_scheduling (FLIST_FENCE (*tailp));
857 FENCE_INSN (old) = NULL;
860 /* Add a new fence to NEW_FENCES list and initialize most of its data
863 add_clean_fence_to_fences (flist_tail_t new_fences, insn_t succ, fence_t fence)
865 int ready_ticks_size = get_max_uid () + 1;
867 add_to_fences (new_fences,
868 succ, state_create (), create_deps_context (),
869 create_target_context (true),
871 XCNEWVEC (int, ready_ticks_size), ready_ticks_size,
872 NULL_RTX, FENCE_CYCLE (fence) + 1,
873 0, issue_rate, 1, FENCE_AFTER_STALL_P (fence));
876 /* Add a new fence to NEW_FENCES list and initialize all of its data
877 from FENCE and SUCC. */
879 add_dirty_fence_to_fences (flist_tail_t new_fences, insn_t succ, fence_t fence)
881 int * new_ready_ticks
882 = XNEWVEC (int, FENCE_READY_TICKS_SIZE (fence));
884 memcpy (new_ready_ticks, FENCE_READY_TICKS (fence),
885 FENCE_READY_TICKS_SIZE (fence) * sizeof (int));
886 add_to_fences (new_fences,
887 succ, state_create_copy (FENCE_STATE (fence)),
888 create_copy_of_deps_context (FENCE_DC (fence)),
889 create_copy_of_target_context (FENCE_TC (fence)),
890 FENCE_LAST_SCHEDULED_INSN (fence),
891 VEC_copy (rtx, gc, FENCE_EXECUTING_INSNS (fence)),
893 FENCE_READY_TICKS_SIZE (fence),
894 FENCE_SCHED_NEXT (fence),
896 FENCE_ISSUED_INSNS (fence),
897 FENCE_ISSUE_MORE (fence),
898 FENCE_STARTS_CYCLE_P (fence),
899 FENCE_AFTER_STALL_P (fence));
903 /* Functions to work with regset and nop pools. */
905 /* Returns the new regset from pool. It might have some of the bits set
906 from the previous usage. */
908 get_regset_from_pool (void)
912 if (regset_pool.n != 0)
913 rs = regset_pool.v[--regset_pool.n];
915 /* We need to create the regset. */
917 rs = ALLOC_REG_SET (®_obstack);
919 if (regset_pool.nn == regset_pool.ss)
920 regset_pool.vv = XRESIZEVEC (regset, regset_pool.vv,
921 (regset_pool.ss = 2 * regset_pool.ss + 1));
922 regset_pool.vv[regset_pool.nn++] = rs;
930 /* Same as above, but returns the empty regset. */
932 get_clear_regset_from_pool (void)
934 regset rs = get_regset_from_pool ();
940 /* Return regset RS to the pool for future use. */
942 return_regset_to_pool (regset rs)
947 if (regset_pool.n == regset_pool.s)
948 regset_pool.v = XRESIZEVEC (regset, regset_pool.v,
949 (regset_pool.s = 2 * regset_pool.s + 1));
950 regset_pool.v[regset_pool.n++] = rs;
953 #ifdef ENABLE_CHECKING
954 /* This is used as a qsort callback for sorting regset pool stacks.
955 X and XX are addresses of two regsets. They are never equal. */
957 cmp_v_in_regset_pool (const void *x, const void *xx)
959 return *((const regset *) x) - *((const regset *) xx);
963 /* Free the regset pool possibly checking for memory leaks. */
965 free_regset_pool (void)
967 #ifdef ENABLE_CHECKING
969 regset *v = regset_pool.v;
971 int n = regset_pool.n;
973 regset *vv = regset_pool.vv;
975 int nn = regset_pool.nn;
979 gcc_assert (n <= nn);
981 /* Sort both vectors so it will be possible to compare them. */
982 qsort (v, n, sizeof (*v), cmp_v_in_regset_pool);
983 qsort (vv, nn, sizeof (*vv), cmp_v_in_regset_pool);
990 /* VV[II] was lost. */
996 gcc_assert (diff == regset_pool.diff);
1000 /* If not true - we have a memory leak. */
1001 gcc_assert (regset_pool.diff == 0);
1003 while (regset_pool.n)
1006 FREE_REG_SET (regset_pool.v[regset_pool.n]);
1009 free (regset_pool.v);
1010 regset_pool.v = NULL;
1013 free (regset_pool.vv);
1014 regset_pool.vv = NULL;
1018 regset_pool.diff = 0;
1022 /* Functions to work with nop pools. NOP insns are used as temporary
1023 placeholders of the insns being scheduled to allow correct update of
1024 the data sets. When update is finished, NOPs are deleted. */
1026 /* A vinsn that is used to represent a nop. This vinsn is shared among all
1027 nops sel-sched generates. */
1028 static vinsn_t nop_vinsn = NULL;
1030 /* Emit a nop before INSN, taking it from pool. */
1032 get_nop_from_pool (insn_t insn)
1035 bool old_p = nop_pool.n != 0;
1039 nop = nop_pool.v[--nop_pool.n];
1043 nop = emit_insn_before (nop, insn);
1046 flags = INSN_INIT_TODO_SSID;
1048 flags = INSN_INIT_TODO_LUID | INSN_INIT_TODO_SSID;
1050 set_insn_init (INSN_EXPR (insn), nop_vinsn, INSN_SEQNO (insn));
1051 sel_init_new_insn (nop, flags);
1056 /* Remove NOP from the instruction stream and return it to the pool. */
1058 return_nop_to_pool (insn_t nop, bool full_tidying)
1060 gcc_assert (INSN_IN_STREAM_P (nop));
1061 sel_remove_insn (nop, false, full_tidying);
1063 if (nop_pool.n == nop_pool.s)
1064 nop_pool.v = XRESIZEVEC (rtx, nop_pool.v,
1065 (nop_pool.s = 2 * nop_pool.s + 1));
1066 nop_pool.v[nop_pool.n++] = nop;
1069 /* Free the nop pool. */
1071 free_nop_pool (void)
1080 /* Skip unspec to support ia64 speculation. Called from rtx_equal_p_cb.
1081 The callback is given two rtxes XX and YY and writes the new rtxes
1082 to NX and NY in case some needs to be skipped. */
1084 skip_unspecs_callback (const_rtx *xx, const_rtx *yy, rtx *nx, rtx* ny)
1089 if (GET_CODE (x) == UNSPEC
1090 && (targetm.sched.skip_rtx_p == NULL
1091 || targetm.sched.skip_rtx_p (x)))
1093 *nx = XVECEXP (x, 0, 0);
1094 *ny = CONST_CAST_RTX (y);
1098 if (GET_CODE (y) == UNSPEC
1099 && (targetm.sched.skip_rtx_p == NULL
1100 || targetm.sched.skip_rtx_p (y)))
1102 *nx = CONST_CAST_RTX (x);
1103 *ny = XVECEXP (y, 0, 0);
1110 /* Callback, called from hash_rtx_cb. Helps to hash UNSPEC rtx X in a correct way
1111 to support ia64 speculation. When changes are needed, new rtx X and new mode
1112 NMODE are written, and the callback returns true. */
1114 hash_with_unspec_callback (const_rtx x, enum machine_mode mode ATTRIBUTE_UNUSED,
1115 rtx *nx, enum machine_mode* nmode)
1117 if (GET_CODE (x) == UNSPEC
1118 && targetm.sched.skip_rtx_p
1119 && targetm.sched.skip_rtx_p (x))
1121 *nx = XVECEXP (x, 0 ,0);
1129 /* Returns LHS and RHS are ok to be scheduled separately. */
1131 lhs_and_rhs_separable_p (rtx lhs, rtx rhs)
1133 if (lhs == NULL || rhs == NULL)
1136 /* Do not schedule CONST, CONST_INT and CONST_DOUBLE etc as rhs: no point
1137 to use reg, if const can be used. Moreover, scheduling const as rhs may
1138 lead to mode mismatch cause consts don't have modes but they could be
1139 merged from branches where the same const used in different modes. */
1140 if (CONSTANT_P (rhs))
1143 /* ??? Do not rename predicate registers to avoid ICEs in bundling. */
1144 if (COMPARISON_P (rhs))
1147 /* Do not allow single REG to be an rhs. */
1151 /* See comment at find_used_regs_1 (*1) for explanation of this
1153 /* FIXME: remove this later. */
1157 /* This will filter all tricky things like ZERO_EXTRACT etc.
1158 For now we don't handle it. */
1159 if (!REG_P (lhs) && !MEM_P (lhs))
1165 /* Initialize vinsn VI for INSN. Only for use from vinsn_create (). When
1166 FORCE_UNIQUE_P is true, the resulting vinsn will not be clonable. This is
1167 used e.g. for insns from recovery blocks. */
1169 vinsn_init (vinsn_t vi, insn_t insn, bool force_unique_p)
1171 hash_rtx_callback_function hrcf;
1174 VINSN_INSN_RTX (vi) = insn;
1175 VINSN_COUNT (vi) = 0;
1178 if (INSN_NOP_P (insn))
1181 if (DF_INSN_UID_SAFE_GET (INSN_UID (insn)) != NULL)
1182 init_id_from_df (VINSN_ID (vi), insn, force_unique_p);
1184 deps_init_id (VINSN_ID (vi), insn, force_unique_p);
1186 /* Hash vinsn depending on whether it is separable or not. */
1187 hrcf = targetm.sched.skip_rtx_p ? hash_with_unspec_callback : NULL;
1188 if (VINSN_SEPARABLE_P (vi))
1190 rtx rhs = VINSN_RHS (vi);
1192 VINSN_HASH (vi) = hash_rtx_cb (rhs, GET_MODE (rhs),
1193 NULL, NULL, false, hrcf);
1194 VINSN_HASH_RTX (vi) = hash_rtx_cb (VINSN_PATTERN (vi),
1195 VOIDmode, NULL, NULL,
1200 VINSN_HASH (vi) = hash_rtx_cb (VINSN_PATTERN (vi), VOIDmode,
1201 NULL, NULL, false, hrcf);
1202 VINSN_HASH_RTX (vi) = VINSN_HASH (vi);
1205 insn_class = haifa_classify_insn (insn);
1207 && (!targetm.sched.get_insn_spec_ds
1208 || ((targetm.sched.get_insn_spec_ds (insn) & BEGIN_CONTROL)
1210 VINSN_MAY_TRAP_P (vi) = true;
1212 VINSN_MAY_TRAP_P (vi) = false;
1215 /* Indicate that VI has become the part of an rtx object. */
1217 vinsn_attach (vinsn_t vi)
1219 /* Assert that VI is not pending for deletion. */
1220 gcc_assert (VINSN_INSN_RTX (vi));
1225 /* Create and init VI from the INSN. Use UNIQUE_P for determining the correct
1228 vinsn_create (insn_t insn, bool force_unique_p)
1230 vinsn_t vi = XCNEW (struct vinsn_def);
1232 vinsn_init (vi, insn, force_unique_p);
1236 /* Return a copy of VI. When REATTACH_P is true, detach VI and attach
1239 vinsn_copy (vinsn_t vi, bool reattach_p)
1242 bool unique = VINSN_UNIQUE_P (vi);
1245 copy = create_copy_of_insn_rtx (VINSN_INSN_RTX (vi));
1246 new_vi = create_vinsn_from_insn_rtx (copy, unique);
1250 vinsn_attach (new_vi);
1256 /* Delete the VI vinsn and free its data. */
1258 vinsn_delete (vinsn_t vi)
1260 gcc_assert (VINSN_COUNT (vi) == 0);
1262 if (!INSN_NOP_P (VINSN_INSN_RTX (vi)))
1264 return_regset_to_pool (VINSN_REG_SETS (vi));
1265 return_regset_to_pool (VINSN_REG_USES (vi));
1266 return_regset_to_pool (VINSN_REG_CLOBBERS (vi));
1272 /* Indicate that VI is no longer a part of some rtx object.
1273 Remove VI if it is no longer needed. */
1275 vinsn_detach (vinsn_t vi)
1277 gcc_assert (VINSN_COUNT (vi) > 0);
1279 if (--VINSN_COUNT (vi) == 0)
1283 /* Returns TRUE if VI is a branch. */
1285 vinsn_cond_branch_p (vinsn_t vi)
1289 if (!VINSN_UNIQUE_P (vi))
1292 insn = VINSN_INSN_RTX (vi);
1293 if (BB_END (BLOCK_FOR_INSN (insn)) != insn)
1296 return control_flow_insn_p (insn);
1299 /* Return latency of INSN. */
1301 sel_insn_rtx_cost (rtx insn)
1305 /* A USE insn, or something else we don't need to
1306 understand. We can't pass these directly to
1307 result_ready_cost or insn_default_latency because it will
1308 trigger a fatal error for unrecognizable insns. */
1309 if (recog_memoized (insn) < 0)
1313 cost = insn_default_latency (insn);
1322 /* Return the cost of the VI.
1323 !!! FIXME: Unify with haifa-sched.c: insn_cost (). */
1325 sel_vinsn_cost (vinsn_t vi)
1327 int cost = vi->cost;
1331 cost = sel_insn_rtx_cost (VINSN_INSN_RTX (vi));
1339 /* Functions for insn emitting. */
1341 /* Emit new insn after AFTER based on PATTERN and initialize its data from
1344 sel_gen_insn_from_rtx_after (rtx pattern, expr_t expr, int seqno, insn_t after)
1348 gcc_assert (EXPR_TARGET_AVAILABLE (expr) == true);
1350 new_insn = emit_insn_after (pattern, after);
1351 set_insn_init (expr, NULL, seqno);
1352 sel_init_new_insn (new_insn, INSN_INIT_TODO_LUID | INSN_INIT_TODO_SSID);
1357 /* Force newly generated vinsns to be unique. */
1358 static bool init_insn_force_unique_p = false;
1360 /* Emit new speculation recovery insn after AFTER based on PATTERN and
1361 initialize its data from EXPR and SEQNO. */
1363 sel_gen_recovery_insn_from_rtx_after (rtx pattern, expr_t expr, int seqno,
1368 gcc_assert (!init_insn_force_unique_p);
1370 init_insn_force_unique_p = true;
1371 insn = sel_gen_insn_from_rtx_after (pattern, expr, seqno, after);
1372 CANT_MOVE (insn) = 1;
1373 init_insn_force_unique_p = false;
1378 /* Emit new insn after AFTER based on EXPR and SEQNO. If VINSN is not NULL,
1379 take it as a new vinsn instead of EXPR's vinsn.
1380 We simplify insns later, after scheduling region in
1381 simplify_changed_insns. */
1383 sel_gen_insn_from_expr_after (expr_t expr, vinsn_t vinsn, int seqno,
1390 emit_expr = set_insn_init (expr, vinsn ? vinsn : EXPR_VINSN (expr),
1392 insn = EXPR_INSN_RTX (emit_expr);
1393 add_insn_after (insn, after, BLOCK_FOR_INSN (insn));
1395 flags = INSN_INIT_TODO_SSID;
1396 if (INSN_LUID (insn) == 0)
1397 flags |= INSN_INIT_TODO_LUID;
1398 sel_init_new_insn (insn, flags);
1403 /* Move insn from EXPR after AFTER. */
1405 sel_move_insn (expr_t expr, int seqno, insn_t after)
1407 insn_t insn = EXPR_INSN_RTX (expr);
1408 basic_block bb = BLOCK_FOR_INSN (after);
1409 insn_t next = NEXT_INSN (after);
1411 /* Assert that in move_op we disconnected this insn properly. */
1412 gcc_assert (EXPR_VINSN (INSN_EXPR (insn)) != NULL);
1413 PREV_INSN (insn) = after;
1414 NEXT_INSN (insn) = next;
1416 NEXT_INSN (after) = insn;
1417 PREV_INSN (next) = insn;
1419 /* Update links from insn to bb and vice versa. */
1420 df_insn_change_bb (insn, bb);
1421 if (BB_END (bb) == after)
1424 prepare_insn_expr (insn, seqno);
1429 /* Functions to work with right-hand sides. */
1431 /* Search for a hash value determined by UID/NEW_VINSN in a sorted vector
1432 VECT and return true when found. Use NEW_VINSN for comparison only when
1433 COMPARE_VINSNS is true. Write to INDP the index on which
1434 the search has stopped, such that inserting the new element at INDP will
1435 retain VECT's sort order. */
1437 find_in_history_vect_1 (VEC(expr_history_def, heap) *vect,
1438 unsigned uid, vinsn_t new_vinsn,
1439 bool compare_vinsns, int *indp)
1441 expr_history_def *arr;
1442 int i, j, len = VEC_length (expr_history_def, vect);
1450 arr = VEC_address (expr_history_def, vect);
1455 unsigned auid = arr[i].uid;
1456 vinsn_t avinsn = arr[i].new_expr_vinsn;
1459 /* When undoing transformation on a bookkeeping copy, the new vinsn
1460 may not be exactly equal to the one that is saved in the vector.
1461 This is because the insn whose copy we're checking was possibly
1462 substituted itself. */
1463 && (! compare_vinsns
1464 || vinsn_equal_p (avinsn, new_vinsn)))
1469 else if (auid > uid)
1478 /* Search for a uid of INSN and NEW_VINSN in a sorted vector VECT. Return
1479 the position found or -1, if no such value is in vector.
1480 Search also for UIDs of insn's originators, if ORIGINATORS_P is true. */
1482 find_in_history_vect (VEC(expr_history_def, heap) *vect, rtx insn,
1483 vinsn_t new_vinsn, bool originators_p)
1487 if (find_in_history_vect_1 (vect, INSN_UID (insn), new_vinsn,
1491 if (INSN_ORIGINATORS (insn) && originators_p)
1496 EXECUTE_IF_SET_IN_BITMAP (INSN_ORIGINATORS (insn), 0, uid, bi)
1497 if (find_in_history_vect_1 (vect, uid, new_vinsn, false, &ind))
1504 /* Insert new element in a sorted history vector pointed to by PVECT,
1505 if it is not there already. The element is searched using
1506 UID/NEW_EXPR_VINSN pair. TYPE, OLD_EXPR_VINSN and SPEC_DS save
1507 the history of a transformation. */
1509 insert_in_history_vect (VEC (expr_history_def, heap) **pvect,
1510 unsigned uid, enum local_trans_type type,
1511 vinsn_t old_expr_vinsn, vinsn_t new_expr_vinsn,
1514 VEC(expr_history_def, heap) *vect = *pvect;
1515 expr_history_def temp;
1519 res = find_in_history_vect_1 (vect, uid, new_expr_vinsn, true, &ind);
1523 expr_history_def *phist = VEC_index (expr_history_def, vect, ind);
1525 /* It is possible that speculation types of expressions that were
1526 propagated through different paths will be different here. In this
1527 case, merge the status to get the correct check later. */
1528 if (phist->spec_ds != spec_ds)
1529 phist->spec_ds = ds_max_merge (phist->spec_ds, spec_ds);
1534 temp.old_expr_vinsn = old_expr_vinsn;
1535 temp.new_expr_vinsn = new_expr_vinsn;
1536 temp.spec_ds = spec_ds;
1539 vinsn_attach (old_expr_vinsn);
1540 vinsn_attach (new_expr_vinsn);
1541 VEC_safe_insert (expr_history_def, heap, vect, ind, &temp);
1545 /* Free history vector PVECT. */
1547 free_history_vect (VEC (expr_history_def, heap) **pvect)
1550 expr_history_def *phist;
1556 VEC_iterate (expr_history_def, *pvect, i, phist);
1559 vinsn_detach (phist->old_expr_vinsn);
1560 vinsn_detach (phist->new_expr_vinsn);
1563 VEC_free (expr_history_def, heap, *pvect);
1567 /* Merge vector FROM to PVECT. */
1569 merge_history_vect (VEC (expr_history_def, heap) **pvect,
1570 VEC (expr_history_def, heap) *from)
1572 expr_history_def *phist;
1575 /* We keep this vector sorted. */
1576 for (i = 0; VEC_iterate (expr_history_def, from, i, phist); i++)
1577 insert_in_history_vect (pvect, phist->uid, phist->type,
1578 phist->old_expr_vinsn, phist->new_expr_vinsn,
1582 /* Compare two vinsns as rhses if possible and as vinsns otherwise. */
1584 vinsn_equal_p (vinsn_t x, vinsn_t y)
1586 rtx_equal_p_callback_function repcf;
1591 if (VINSN_TYPE (x) != VINSN_TYPE (y))
1594 if (VINSN_HASH (x) != VINSN_HASH (y))
1597 repcf = targetm.sched.skip_rtx_p ? skip_unspecs_callback : NULL;
1598 if (VINSN_SEPARABLE_P (x))
1600 /* Compare RHSes of VINSNs. */
1601 gcc_assert (VINSN_RHS (x));
1602 gcc_assert (VINSN_RHS (y));
1604 return rtx_equal_p_cb (VINSN_RHS (x), VINSN_RHS (y), repcf);
1607 return rtx_equal_p_cb (VINSN_PATTERN (x), VINSN_PATTERN (y), repcf);
1611 /* Functions for working with expressions. */
1613 /* Initialize EXPR. */
1615 init_expr (expr_t expr, vinsn_t vi, int spec, int use, int priority,
1616 int sched_times, int orig_bb_index, ds_t spec_done_ds,
1617 ds_t spec_to_check_ds, int orig_sched_cycle,
1618 VEC(expr_history_def, heap) *history, signed char target_available,
1619 bool was_substituted, bool was_renamed, bool needs_spec_check_p,
1624 EXPR_VINSN (expr) = vi;
1625 EXPR_SPEC (expr) = spec;
1626 EXPR_USEFULNESS (expr) = use;
1627 EXPR_PRIORITY (expr) = priority;
1628 EXPR_PRIORITY_ADJ (expr) = 0;
1629 EXPR_SCHED_TIMES (expr) = sched_times;
1630 EXPR_ORIG_BB_INDEX (expr) = orig_bb_index;
1631 EXPR_ORIG_SCHED_CYCLE (expr) = orig_sched_cycle;
1632 EXPR_SPEC_DONE_DS (expr) = spec_done_ds;
1633 EXPR_SPEC_TO_CHECK_DS (expr) = spec_to_check_ds;
1636 EXPR_HISTORY_OF_CHANGES (expr) = history;
1638 EXPR_HISTORY_OF_CHANGES (expr) = NULL;
1640 EXPR_TARGET_AVAILABLE (expr) = target_available;
1641 EXPR_WAS_SUBSTITUTED (expr) = was_substituted;
1642 EXPR_WAS_RENAMED (expr) = was_renamed;
1643 EXPR_NEEDS_SPEC_CHECK_P (expr) = needs_spec_check_p;
1644 EXPR_CANT_MOVE (expr) = cant_move;
1647 /* Make a copy of the expr FROM into the expr TO. */
1649 copy_expr (expr_t to, expr_t from)
1651 VEC(expr_history_def, heap) *temp = NULL;
1653 if (EXPR_HISTORY_OF_CHANGES (from))
1656 expr_history_def *phist;
1658 temp = VEC_copy (expr_history_def, heap, EXPR_HISTORY_OF_CHANGES (from));
1660 VEC_iterate (expr_history_def, temp, i, phist);
1663 vinsn_attach (phist->old_expr_vinsn);
1664 vinsn_attach (phist->new_expr_vinsn);
1668 init_expr (to, EXPR_VINSN (from), EXPR_SPEC (from),
1669 EXPR_USEFULNESS (from), EXPR_PRIORITY (from),
1670 EXPR_SCHED_TIMES (from), EXPR_ORIG_BB_INDEX (from),
1671 EXPR_SPEC_DONE_DS (from), EXPR_SPEC_TO_CHECK_DS (from),
1672 EXPR_ORIG_SCHED_CYCLE (from), temp,
1673 EXPR_TARGET_AVAILABLE (from), EXPR_WAS_SUBSTITUTED (from),
1674 EXPR_WAS_RENAMED (from), EXPR_NEEDS_SPEC_CHECK_P (from),
1675 EXPR_CANT_MOVE (from));
1678 /* Same, but the final expr will not ever be in av sets, so don't copy
1679 "uninteresting" data such as bitmap cache. */
1681 copy_expr_onside (expr_t to, expr_t from)
1683 init_expr (to, EXPR_VINSN (from), EXPR_SPEC (from), EXPR_USEFULNESS (from),
1684 EXPR_PRIORITY (from), EXPR_SCHED_TIMES (from), 0,
1685 EXPR_SPEC_DONE_DS (from), EXPR_SPEC_TO_CHECK_DS (from), 0, NULL,
1686 EXPR_TARGET_AVAILABLE (from), EXPR_WAS_SUBSTITUTED (from),
1687 EXPR_WAS_RENAMED (from), EXPR_NEEDS_SPEC_CHECK_P (from),
1688 EXPR_CANT_MOVE (from));
1691 /* Prepare the expr of INSN for scheduling. Used when moving insn and when
1692 initializing new insns. */
1694 prepare_insn_expr (insn_t insn, int seqno)
1696 expr_t expr = INSN_EXPR (insn);
1699 INSN_SEQNO (insn) = seqno;
1700 EXPR_ORIG_BB_INDEX (expr) = BLOCK_NUM (insn);
1701 EXPR_SPEC (expr) = 0;
1702 EXPR_ORIG_SCHED_CYCLE (expr) = 0;
1703 EXPR_WAS_SUBSTITUTED (expr) = 0;
1704 EXPR_WAS_RENAMED (expr) = 0;
1705 EXPR_TARGET_AVAILABLE (expr) = 1;
1706 INSN_LIVE_VALID_P (insn) = false;
1708 /* ??? If this expression is speculative, make its dependence
1709 as weak as possible. We can filter this expression later
1710 in process_spec_exprs, because we do not distinguish
1711 between the status we got during compute_av_set and the
1712 existing status. To be fixed. */
1713 ds = EXPR_SPEC_DONE_DS (expr);
1715 EXPR_SPEC_DONE_DS (expr) = ds_get_max_dep_weak (ds);
1717 free_history_vect (&EXPR_HISTORY_OF_CHANGES (expr));
1720 /* Update target_available bits when merging exprs TO and FROM. SPLIT_POINT
1721 is non-null when expressions are merged from different successors at
1724 update_target_availability (expr_t to, expr_t from, insn_t split_point)
1726 if (EXPR_TARGET_AVAILABLE (to) < 0
1727 || EXPR_TARGET_AVAILABLE (from) < 0)
1728 EXPR_TARGET_AVAILABLE (to) = -1;
1731 /* We try to detect the case when one of the expressions
1732 can only be reached through another one. In this case,
1733 we can do better. */
1734 if (split_point == NULL)
1738 toind = EXPR_ORIG_BB_INDEX (to);
1739 fromind = EXPR_ORIG_BB_INDEX (from);
1741 if (toind && toind == fromind)
1742 /* Do nothing -- everything is done in
1743 merge_with_other_exprs. */
1746 EXPR_TARGET_AVAILABLE (to) = -1;
1749 EXPR_TARGET_AVAILABLE (to) &= EXPR_TARGET_AVAILABLE (from);
1753 /* Update speculation bits when merging exprs TO and FROM. SPLIT_POINT
1754 is non-null when expressions are merged from different successors at
1757 update_speculative_bits (expr_t to, expr_t from, insn_t split_point)
1759 ds_t old_to_ds, old_from_ds;
1761 old_to_ds = EXPR_SPEC_DONE_DS (to);
1762 old_from_ds = EXPR_SPEC_DONE_DS (from);
1764 EXPR_SPEC_DONE_DS (to) = ds_max_merge (old_to_ds, old_from_ds);
1765 EXPR_SPEC_TO_CHECK_DS (to) |= EXPR_SPEC_TO_CHECK_DS (from);
1766 EXPR_NEEDS_SPEC_CHECK_P (to) |= EXPR_NEEDS_SPEC_CHECK_P (from);
1768 /* When merging e.g. control & data speculative exprs, or a control
1769 speculative with a control&data speculative one, we really have
1770 to change vinsn too. Also, when speculative status is changed,
1771 we also need to record this as a transformation in expr's history. */
1772 if ((old_to_ds & SPECULATIVE) || (old_from_ds & SPECULATIVE))
1774 old_to_ds = ds_get_speculation_types (old_to_ds);
1775 old_from_ds = ds_get_speculation_types (old_from_ds);
1777 if (old_to_ds != old_from_ds)
1781 /* When both expressions are speculative, we need to change
1783 if ((old_to_ds & SPECULATIVE) && (old_from_ds & SPECULATIVE))
1787 res = speculate_expr (to, EXPR_SPEC_DONE_DS (to));
1788 gcc_assert (res >= 0);
1791 if (split_point != NULL)
1793 /* Record the change with proper status. */
1794 record_ds = EXPR_SPEC_DONE_DS (to) & SPECULATIVE;
1795 record_ds &= ~(old_to_ds & SPECULATIVE);
1796 record_ds &= ~(old_from_ds & SPECULATIVE);
1798 insert_in_history_vect (&EXPR_HISTORY_OF_CHANGES (to),
1799 INSN_UID (split_point), TRANS_SPECULATION,
1800 EXPR_VINSN (from), EXPR_VINSN (to),
1808 /* Merge bits of FROM expr to TO expr. When SPLIT_POINT is not NULL,
1809 this is done along different paths. */
1811 merge_expr_data (expr_t to, expr_t from, insn_t split_point)
1813 /* For now, we just set the spec of resulting expr to be minimum of the specs
1815 if (EXPR_SPEC (to) > EXPR_SPEC (from))
1816 EXPR_SPEC (to) = EXPR_SPEC (from);
1819 EXPR_USEFULNESS (to) += EXPR_USEFULNESS (from);
1821 EXPR_USEFULNESS (to) = MAX (EXPR_USEFULNESS (to),
1822 EXPR_USEFULNESS (from));
1824 if (EXPR_PRIORITY (to) < EXPR_PRIORITY (from))
1825 EXPR_PRIORITY (to) = EXPR_PRIORITY (from);
1827 if (EXPR_SCHED_TIMES (to) > EXPR_SCHED_TIMES (from))
1828 EXPR_SCHED_TIMES (to) = EXPR_SCHED_TIMES (from);
1830 if (EXPR_ORIG_BB_INDEX (to) != EXPR_ORIG_BB_INDEX (from))
1831 EXPR_ORIG_BB_INDEX (to) = 0;
1833 EXPR_ORIG_SCHED_CYCLE (to) = MIN (EXPR_ORIG_SCHED_CYCLE (to),
1834 EXPR_ORIG_SCHED_CYCLE (from));
1836 EXPR_WAS_SUBSTITUTED (to) |= EXPR_WAS_SUBSTITUTED (from);
1837 EXPR_WAS_RENAMED (to) |= EXPR_WAS_RENAMED (from);
1838 EXPR_CANT_MOVE (to) |= EXPR_CANT_MOVE (from);
1840 merge_history_vect (&EXPR_HISTORY_OF_CHANGES (to),
1841 EXPR_HISTORY_OF_CHANGES (from));
1842 update_target_availability (to, from, split_point);
1843 update_speculative_bits (to, from, split_point);
1846 /* Merge bits of FROM expr to TO expr. Vinsns in the exprs should be equal
1847 in terms of vinsn_equal_p. SPLIT_POINT is non-null when expressions
1848 are merged from different successors at a split point. */
1850 merge_expr (expr_t to, expr_t from, insn_t split_point)
1852 vinsn_t to_vi = EXPR_VINSN (to);
1853 vinsn_t from_vi = EXPR_VINSN (from);
1855 gcc_assert (vinsn_equal_p (to_vi, from_vi));
1857 /* Make sure that speculative pattern is propagated into exprs that
1858 have non-speculative one. This will provide us with consistent
1859 speculative bits and speculative patterns inside expr. */
1860 if ((EXPR_SPEC_DONE_DS (from) != 0
1861 && EXPR_SPEC_DONE_DS (to) == 0)
1862 /* Do likewise for volatile insns, so that we always retain
1863 the may_trap_p bit on the resulting expression. */
1864 || (VINSN_MAY_TRAP_P (EXPR_VINSN (from))
1865 && !VINSN_MAY_TRAP_P (EXPR_VINSN (to))))
1866 change_vinsn_in_expr (to, EXPR_VINSN (from));
1868 merge_expr_data (to, from, split_point);
1869 gcc_assert (EXPR_USEFULNESS (to) <= REG_BR_PROB_BASE);
1872 /* Clear the information of this EXPR. */
1874 clear_expr (expr_t expr)
1877 vinsn_detach (EXPR_VINSN (expr));
1878 EXPR_VINSN (expr) = NULL;
1880 free_history_vect (&EXPR_HISTORY_OF_CHANGES (expr));
1883 /* For a given LV_SET, mark EXPR having unavailable target register. */
1885 set_unavailable_target_for_expr (expr_t expr, regset lv_set)
1887 if (EXPR_SEPARABLE_P (expr))
1889 if (REG_P (EXPR_LHS (expr))
1890 && bitmap_bit_p (lv_set, REGNO (EXPR_LHS (expr))))
1892 /* If it's an insn like r1 = use (r1, ...), and it exists in
1893 different forms in each of the av_sets being merged, we can't say
1894 whether original destination register is available or not.
1895 However, this still works if destination register is not used
1896 in the original expression: if the branch at which LV_SET we're
1897 looking here is not actually 'other branch' in sense that same
1898 expression is available through it (but it can't be determined
1899 at computation stage because of transformations on one of the
1900 branches), it still won't affect the availability.
1901 Liveness of a register somewhere on a code motion path means
1902 it's either read somewhere on a codemotion path, live on
1903 'other' branch, live at the point immediately following
1904 the original operation, or is read by the original operation.
1905 The latter case is filtered out in the condition below.
1906 It still doesn't cover the case when register is defined and used
1907 somewhere within the code motion path, and in this case we could
1908 miss a unifying code motion along both branches using a renamed
1909 register, but it won't affect a code correctness since upon
1910 an actual code motion a bookkeeping code would be generated. */
1911 if (bitmap_bit_p (VINSN_REG_USES (EXPR_VINSN (expr)),
1912 REGNO (EXPR_LHS (expr))))
1913 EXPR_TARGET_AVAILABLE (expr) = -1;
1915 EXPR_TARGET_AVAILABLE (expr) = false;
1921 reg_set_iterator rsi;
1923 EXECUTE_IF_SET_IN_REG_SET (VINSN_REG_SETS (EXPR_VINSN (expr)),
1925 if (bitmap_bit_p (lv_set, regno))
1927 EXPR_TARGET_AVAILABLE (expr) = false;
1931 EXECUTE_IF_SET_IN_REG_SET (VINSN_REG_CLOBBERS (EXPR_VINSN (expr)),
1933 if (bitmap_bit_p (lv_set, regno))
1935 EXPR_TARGET_AVAILABLE (expr) = false;
1941 /* Try to make EXPR speculative. Return 1 when EXPR's pattern
1942 or dependence status have changed, 2 when also the target register
1943 became unavailable, 0 if nothing had to be changed. */
1945 speculate_expr (expr_t expr, ds_t ds)
1950 ds_t target_ds, current_ds;
1952 /* Obtain the status we need to put on EXPR. */
1953 target_ds = (ds & SPECULATIVE);
1954 current_ds = EXPR_SPEC_DONE_DS (expr);
1955 ds = ds_full_merge (current_ds, target_ds, NULL_RTX, NULL_RTX);
1957 orig_insn_rtx = EXPR_INSN_RTX (expr);
1959 res = sched_speculate_insn (orig_insn_rtx, ds, &spec_pat);
1964 EXPR_SPEC_DONE_DS (expr) = ds;
1965 return current_ds != ds ? 1 : 0;
1969 rtx spec_insn_rtx = create_insn_rtx_from_pattern (spec_pat, NULL_RTX);
1970 vinsn_t spec_vinsn = create_vinsn_from_insn_rtx (spec_insn_rtx, false);
1972 change_vinsn_in_expr (expr, spec_vinsn);
1973 EXPR_SPEC_DONE_DS (expr) = ds;
1974 EXPR_NEEDS_SPEC_CHECK_P (expr) = true;
1976 /* Do not allow clobbering the address register of speculative
1978 if (bitmap_bit_p (VINSN_REG_USES (EXPR_VINSN (expr)),
1979 expr_dest_regno (expr)))
1981 EXPR_TARGET_AVAILABLE (expr) = false;
1997 /* Return a destination register, if any, of EXPR. */
1999 expr_dest_reg (expr_t expr)
2001 rtx dest = VINSN_LHS (EXPR_VINSN (expr));
2003 if (dest != NULL_RTX && REG_P (dest))
2009 /* Returns the REGNO of the R's destination. */
2011 expr_dest_regno (expr_t expr)
2013 rtx dest = expr_dest_reg (expr);
2015 gcc_assert (dest != NULL_RTX);
2016 return REGNO (dest);
2019 /* For a given LV_SET, mark all expressions in JOIN_SET, but not present in
2020 AV_SET having unavailable target register. */
2022 mark_unavailable_targets (av_set_t join_set, av_set_t av_set, regset lv_set)
2025 av_set_iterator avi;
2027 FOR_EACH_EXPR (expr, avi, join_set)
2028 if (av_set_lookup (av_set, EXPR_VINSN (expr)) == NULL)
2029 set_unavailable_target_for_expr (expr, lv_set);
2033 /* Av set functions. */
2035 /* Add a new element to av set SETP.
2036 Return the element added. */
2038 av_set_add_element (av_set_t *setp)
2040 /* Insert at the beginning of the list. */
2045 /* Add EXPR to SETP. */
2047 av_set_add (av_set_t *setp, expr_t expr)
2051 gcc_assert (!INSN_NOP_P (EXPR_INSN_RTX (expr)));
2052 elem = av_set_add_element (setp);
2053 copy_expr (_AV_SET_EXPR (elem), expr);
2056 /* Same, but do not copy EXPR. */
2058 av_set_add_nocopy (av_set_t *setp, expr_t expr)
2062 elem = av_set_add_element (setp);
2063 *_AV_SET_EXPR (elem) = *expr;
2066 /* Remove expr pointed to by IP from the av_set. */
2068 av_set_iter_remove (av_set_iterator *ip)
2070 clear_expr (_AV_SET_EXPR (*ip->lp));
2071 _list_iter_remove (ip);
2074 /* Search for an expr in SET, such that it's equivalent to SOUGHT_VINSN in the
2075 sense of vinsn_equal_p function. Return NULL if no such expr is
2076 in SET was found. */
2078 av_set_lookup (av_set_t set, vinsn_t sought_vinsn)
2083 FOR_EACH_EXPR (expr, i, set)
2084 if (vinsn_equal_p (EXPR_VINSN (expr), sought_vinsn))
2089 /* Same, but also remove the EXPR found. */
2091 av_set_lookup_and_remove (av_set_t *setp, vinsn_t sought_vinsn)
2096 FOR_EACH_EXPR_1 (expr, i, setp)
2097 if (vinsn_equal_p (EXPR_VINSN (expr), sought_vinsn))
2099 _list_iter_remove_nofree (&i);
2105 /* Search for an expr in SET, such that it's equivalent to EXPR in the
2106 sense of vinsn_equal_p function of their vinsns, but not EXPR itself.
2107 Returns NULL if no such expr is in SET was found. */
2109 av_set_lookup_other_equiv_expr (av_set_t set, expr_t expr)
2114 FOR_EACH_EXPR (cur_expr, i, set)
2116 if (cur_expr == expr)
2118 if (vinsn_equal_p (EXPR_VINSN (cur_expr), EXPR_VINSN (expr)))
2125 /* If other expression is already in AVP, remove one of them. */
2127 merge_with_other_exprs (av_set_t *avp, av_set_iterator *ip, expr_t expr)
2131 expr2 = av_set_lookup_other_equiv_expr (*avp, expr);
2134 /* Reset target availability on merge, since taking it only from one
2135 of the exprs would be controversial for different code. */
2136 EXPR_TARGET_AVAILABLE (expr2) = -1;
2137 EXPR_USEFULNESS (expr2) = 0;
2139 merge_expr (expr2, expr, NULL);
2141 /* Fix usefulness as it should be now REG_BR_PROB_BASE. */
2142 EXPR_USEFULNESS (expr2) = REG_BR_PROB_BASE;
2144 av_set_iter_remove (ip);
2151 /* Return true if there is an expr that correlates to VI in SET. */
2153 av_set_is_in_p (av_set_t set, vinsn_t vi)
2155 return av_set_lookup (set, vi) != NULL;
2158 /* Return a copy of SET. */
2160 av_set_copy (av_set_t set)
2164 av_set_t res = NULL;
2166 FOR_EACH_EXPR (expr, i, set)
2167 av_set_add (&res, expr);
2172 /* Join two av sets that do not have common elements by attaching second set
2173 (pointed to by FROMP) to the end of first set (TO_TAILP must point to
2174 _AV_SET_NEXT of first set's last element). */
2176 join_distinct_sets (av_set_t *to_tailp, av_set_t *fromp)
2178 gcc_assert (*to_tailp == NULL);
2183 /* Makes set pointed to by TO to be the union of TO and FROM. Clear av_set
2184 pointed to by FROMP afterwards. */
2186 av_set_union_and_clear (av_set_t *top, av_set_t *fromp, insn_t insn)
2191 /* Delete from TOP all exprs, that present in FROMP. */
2192 FOR_EACH_EXPR_1 (expr1, i, top)
2194 expr_t expr2 = av_set_lookup (*fromp, EXPR_VINSN (expr1));
2198 merge_expr (expr2, expr1, insn);
2199 av_set_iter_remove (&i);
2203 join_distinct_sets (i.lp, fromp);
2206 /* Same as above, but also update availability of target register in
2207 TOP judging by TO_LV_SET and FROM_LV_SET. */
2209 av_set_union_and_live (av_set_t *top, av_set_t *fromp, regset to_lv_set,
2210 regset from_lv_set, insn_t insn)
2214 av_set_t *to_tailp, in_both_set = NULL;
2216 /* Delete from TOP all expres, that present in FROMP. */
2217 FOR_EACH_EXPR_1 (expr1, i, top)
2219 expr_t expr2 = av_set_lookup_and_remove (fromp, EXPR_VINSN (expr1));
2223 /* It may be that the expressions have different destination
2224 registers, in which case we need to check liveness here. */
2225 if (EXPR_SEPARABLE_P (expr1))
2227 int regno1 = (REG_P (EXPR_LHS (expr1))
2228 ? (int) expr_dest_regno (expr1) : -1);
2229 int regno2 = (REG_P (EXPR_LHS (expr2))
2230 ? (int) expr_dest_regno (expr2) : -1);
2232 /* ??? We don't have a way to check restrictions for
2233 *other* register on the current path, we did it only
2234 for the current target register. Give up. */
2235 if (regno1 != regno2)
2236 EXPR_TARGET_AVAILABLE (expr2) = -1;
2238 else if (EXPR_INSN_RTX (expr1) != EXPR_INSN_RTX (expr2))
2239 EXPR_TARGET_AVAILABLE (expr2) = -1;
2241 merge_expr (expr2, expr1, insn);
2242 av_set_add_nocopy (&in_both_set, expr2);
2243 av_set_iter_remove (&i);
2246 /* EXPR1 is present in TOP, but not in FROMP. Check it on
2248 set_unavailable_target_for_expr (expr1, from_lv_set);
2252 /* These expressions are not present in TOP. Check liveness
2253 restrictions on TO_LV_SET. */
2254 FOR_EACH_EXPR (expr1, i, *fromp)
2255 set_unavailable_target_for_expr (expr1, to_lv_set);
2257 join_distinct_sets (i.lp, &in_both_set);
2258 join_distinct_sets (to_tailp, fromp);
2261 /* Clear av_set pointed to by SETP. */
2263 av_set_clear (av_set_t *setp)
2268 FOR_EACH_EXPR_1 (expr, i, setp)
2269 av_set_iter_remove (&i);
2271 gcc_assert (*setp == NULL);
2274 /* Leave only one non-speculative element in the SETP. */
2276 av_set_leave_one_nonspec (av_set_t *setp)
2280 bool has_one_nonspec = false;
2282 /* Keep all speculative exprs, and leave one non-speculative
2284 FOR_EACH_EXPR_1 (expr, i, setp)
2286 if (!EXPR_SPEC_DONE_DS (expr))
2288 if (has_one_nonspec)
2289 av_set_iter_remove (&i);
2291 has_one_nonspec = true;
2296 /* Return the N'th element of the SET. */
2298 av_set_element (av_set_t set, int n)
2303 FOR_EACH_EXPR (expr, i, set)
2311 /* Deletes all expressions from AVP that are conditional branches (IFs). */
2313 av_set_substract_cond_branches (av_set_t *avp)
2318 FOR_EACH_EXPR_1 (expr, i, avp)
2319 if (vinsn_cond_branch_p (EXPR_VINSN (expr)))
2320 av_set_iter_remove (&i);
2323 /* Multiplies usefulness attribute of each member of av-set *AVP by
2324 value PROB / ALL_PROB. */
2326 av_set_split_usefulness (av_set_t av, int prob, int all_prob)
2331 FOR_EACH_EXPR (expr, i, av)
2332 EXPR_USEFULNESS (expr) = (all_prob
2333 ? (EXPR_USEFULNESS (expr) * prob) / all_prob
2337 /* Leave in AVP only those expressions, which are present in AV,
2338 and return it, merging history expressions. */
2340 av_set_code_motion_filter (av_set_t *avp, av_set_t av)
2345 FOR_EACH_EXPR_1 (expr, i, avp)
2346 if ((expr2 = av_set_lookup (av, EXPR_VINSN (expr))) == NULL)
2347 av_set_iter_remove (&i);
2349 /* When updating av sets in bookkeeping blocks, we can add more insns
2350 there which will be transformed but the upper av sets will not
2351 reflect those transformations. We then fail to undo those
2352 when searching for such insns. So merge the history saved
2353 in the av set of the block we are processing. */
2354 merge_history_vect (&EXPR_HISTORY_OF_CHANGES (expr),
2355 EXPR_HISTORY_OF_CHANGES (expr2));
2360 /* Dependence hooks to initialize insn data. */
2362 /* This is used in hooks callable from dependence analysis when initializing
2363 instruction's data. */
2366 /* Where the dependence was found (lhs/rhs). */
2369 /* The actual data object to initialize. */
2372 /* True when the insn should not be made clonable. */
2373 bool force_unique_p;
2375 /* True when insn should be treated as of type USE, i.e. never renamed. */
2377 } deps_init_id_data;
2380 /* Setup ID for INSN. FORCE_UNIQUE_P is true when INSN should not be
2383 setup_id_for_insn (idata_t id, insn_t insn, bool force_unique_p)
2387 /* Determine whether INSN could be cloned and return appropriate vinsn type.
2388 That clonable insns which can be separated into lhs and rhs have type SET.
2389 Other clonable insns have type USE. */
2390 type = GET_CODE (insn);
2392 /* Only regular insns could be cloned. */
2393 if (type == INSN && !force_unique_p)
2395 else if (type == JUMP_INSN && simplejump_p (insn))
2397 else if (type == DEBUG_INSN)
2398 type = !force_unique_p ? USE : INSN;
2400 IDATA_TYPE (id) = type;
2401 IDATA_REG_SETS (id) = get_clear_regset_from_pool ();
2402 IDATA_REG_USES (id) = get_clear_regset_from_pool ();
2403 IDATA_REG_CLOBBERS (id) = get_clear_regset_from_pool ();
2406 /* Start initializing insn data. */
2408 deps_init_id_start_insn (insn_t insn)
2410 gcc_assert (deps_init_id_data.where == DEPS_IN_NOWHERE);
2412 setup_id_for_insn (deps_init_id_data.id, insn,
2413 deps_init_id_data.force_unique_p);
2414 deps_init_id_data.where = DEPS_IN_INSN;
2417 /* Start initializing lhs data. */
2419 deps_init_id_start_lhs (rtx lhs)
2421 gcc_assert (deps_init_id_data.where == DEPS_IN_INSN);
2422 gcc_assert (IDATA_LHS (deps_init_id_data.id) == NULL);
2424 if (IDATA_TYPE (deps_init_id_data.id) == SET)
2426 IDATA_LHS (deps_init_id_data.id) = lhs;
2427 deps_init_id_data.where = DEPS_IN_LHS;
2431 /* Finish initializing lhs data. */
2433 deps_init_id_finish_lhs (void)
2435 deps_init_id_data.where = DEPS_IN_INSN;
2438 /* Note a set of REGNO. */
2440 deps_init_id_note_reg_set (int regno)
2442 haifa_note_reg_set (regno);
2444 if (deps_init_id_data.where == DEPS_IN_RHS)
2445 deps_init_id_data.force_use_p = true;
2447 if (IDATA_TYPE (deps_init_id_data.id) != PC)
2448 SET_REGNO_REG_SET (IDATA_REG_SETS (deps_init_id_data.id), regno);
2451 /* Make instructions that set stack registers to be ineligible for
2452 renaming to avoid issues with find_used_regs. */
2453 if (IN_RANGE (regno, FIRST_STACK_REG, LAST_STACK_REG))
2454 deps_init_id_data.force_use_p = true;
2458 /* Note a clobber of REGNO. */
2460 deps_init_id_note_reg_clobber (int regno)
2462 haifa_note_reg_clobber (regno);
2464 if (deps_init_id_data.where == DEPS_IN_RHS)
2465 deps_init_id_data.force_use_p = true;
2467 if (IDATA_TYPE (deps_init_id_data.id) != PC)
2468 SET_REGNO_REG_SET (IDATA_REG_CLOBBERS (deps_init_id_data.id), regno);
2471 /* Note a use of REGNO. */
2473 deps_init_id_note_reg_use (int regno)
2475 haifa_note_reg_use (regno);
2477 if (IDATA_TYPE (deps_init_id_data.id) != PC)
2478 SET_REGNO_REG_SET (IDATA_REG_USES (deps_init_id_data.id), regno);
2481 /* Start initializing rhs data. */
2483 deps_init_id_start_rhs (rtx rhs)
2485 gcc_assert (deps_init_id_data.where == DEPS_IN_INSN);
2487 /* And there was no sel_deps_reset_to_insn (). */
2488 if (IDATA_LHS (deps_init_id_data.id) != NULL)
2490 IDATA_RHS (deps_init_id_data.id) = rhs;
2491 deps_init_id_data.where = DEPS_IN_RHS;
2495 /* Finish initializing rhs data. */
2497 deps_init_id_finish_rhs (void)
2499 gcc_assert (deps_init_id_data.where == DEPS_IN_RHS
2500 || deps_init_id_data.where == DEPS_IN_INSN);
2501 deps_init_id_data.where = DEPS_IN_INSN;
2504 /* Finish initializing insn data. */
2506 deps_init_id_finish_insn (void)
2508 gcc_assert (deps_init_id_data.where == DEPS_IN_INSN);
2510 if (IDATA_TYPE (deps_init_id_data.id) == SET)
2512 rtx lhs = IDATA_LHS (deps_init_id_data.id);
2513 rtx rhs = IDATA_RHS (deps_init_id_data.id);
2515 if (lhs == NULL || rhs == NULL || !lhs_and_rhs_separable_p (lhs, rhs)
2516 || deps_init_id_data.force_use_p)
2518 /* This should be a USE, as we don't want to schedule its RHS
2519 separately. However, we still want to have them recorded
2520 for the purposes of substitution. That's why we don't
2521 simply call downgrade_to_use () here. */
2522 gcc_assert (IDATA_TYPE (deps_init_id_data.id) == SET);
2523 gcc_assert (!lhs == !rhs);
2525 IDATA_TYPE (deps_init_id_data.id) = USE;
2529 deps_init_id_data.where = DEPS_IN_NOWHERE;
2532 /* This is dependence info used for initializing insn's data. */
2533 static struct sched_deps_info_def deps_init_id_sched_deps_info;
2535 /* This initializes most of the static part of the above structure. */
2536 static const struct sched_deps_info_def const_deps_init_id_sched_deps_info =
2540 deps_init_id_start_insn,
2541 deps_init_id_finish_insn,
2542 deps_init_id_start_lhs,
2543 deps_init_id_finish_lhs,
2544 deps_init_id_start_rhs,
2545 deps_init_id_finish_rhs,
2546 deps_init_id_note_reg_set,
2547 deps_init_id_note_reg_clobber,
2548 deps_init_id_note_reg_use,
2549 NULL, /* note_mem_dep */
2550 NULL, /* note_dep */
2553 0, /* use_deps_list */
2554 0 /* generate_spec_deps */
2557 /* Initialize INSN's lhs and rhs in ID. When FORCE_UNIQUE_P is true,
2558 we don't actually need information about lhs and rhs. */
2560 setup_id_lhs_rhs (idata_t id, insn_t insn, bool force_unique_p)
2562 rtx pat = PATTERN (insn);
2564 if (NONJUMP_INSN_P (insn)
2565 && GET_CODE (pat) == SET
2568 IDATA_RHS (id) = SET_SRC (pat);
2569 IDATA_LHS (id) = SET_DEST (pat);
2572 IDATA_LHS (id) = IDATA_RHS (id) = NULL;
2575 /* Possibly downgrade INSN to USE. */
2577 maybe_downgrade_id_to_use (idata_t id, insn_t insn)
2579 bool must_be_use = false;
2580 unsigned uid = INSN_UID (insn);
2582 rtx lhs = IDATA_LHS (id);
2583 rtx rhs = IDATA_RHS (id);
2585 /* We downgrade only SETs. */
2586 if (IDATA_TYPE (id) != SET)
2589 if (!lhs || !lhs_and_rhs_separable_p (lhs, rhs))
2591 IDATA_TYPE (id) = USE;
2595 for (rec = DF_INSN_UID_DEFS (uid); *rec; rec++)
2599 if (DF_REF_INSN (def)
2600 && DF_REF_FLAGS_IS_SET (def, DF_REF_PRE_POST_MODIFY)
2601 && loc_mentioned_in_p (DF_REF_LOC (def), IDATA_RHS (id)))
2608 /* Make instructions that set stack registers to be ineligible for
2609 renaming to avoid issues with find_used_regs. */
2610 if (IN_RANGE (DF_REF_REGNO (def), FIRST_STACK_REG, LAST_STACK_REG))
2619 IDATA_TYPE (id) = USE;
2622 /* Setup register sets describing INSN in ID. */
2624 setup_id_reg_sets (idata_t id, insn_t insn)
2626 unsigned uid = INSN_UID (insn);
2628 regset tmp = get_clear_regset_from_pool ();
2630 for (rec = DF_INSN_UID_DEFS (uid); *rec; rec++)
2633 unsigned int regno = DF_REF_REGNO (def);
2635 /* Post modifies are treated like clobbers by sched-deps.c. */
2636 if (DF_REF_FLAGS_IS_SET (def, (DF_REF_MUST_CLOBBER
2637 | DF_REF_PRE_POST_MODIFY)))
2638 SET_REGNO_REG_SET (IDATA_REG_CLOBBERS (id), regno);
2639 else if (! DF_REF_FLAGS_IS_SET (def, DF_REF_MAY_CLOBBER))
2641 SET_REGNO_REG_SET (IDATA_REG_SETS (id), regno);
2644 /* For stack registers, treat writes to them as writes
2645 to the first one to be consistent with sched-deps.c. */
2646 if (IN_RANGE (regno, FIRST_STACK_REG, LAST_STACK_REG))
2647 SET_REGNO_REG_SET (IDATA_REG_SETS (id), FIRST_STACK_REG);
2650 /* Mark special refs that generate read/write def pair. */
2651 if (DF_REF_FLAGS_IS_SET (def, DF_REF_CONDITIONAL)
2652 || regno == STACK_POINTER_REGNUM)
2653 bitmap_set_bit (tmp, regno);
2656 for (rec = DF_INSN_UID_USES (uid); *rec; rec++)
2659 unsigned int regno = DF_REF_REGNO (use);
2661 /* When these refs are met for the first time, skip them, as
2662 these uses are just counterparts of some defs. */
2663 if (bitmap_bit_p (tmp, regno))
2664 bitmap_clear_bit (tmp, regno);
2665 else if (! DF_REF_FLAGS_IS_SET (use, DF_REF_CALL_STACK_USAGE))
2667 SET_REGNO_REG_SET (IDATA_REG_USES (id), regno);
2670 /* For stack registers, treat reads from them as reads from
2671 the first one to be consistent with sched-deps.c. */
2672 if (IN_RANGE (regno, FIRST_STACK_REG, LAST_STACK_REG))
2673 SET_REGNO_REG_SET (IDATA_REG_USES (id), FIRST_STACK_REG);
2678 return_regset_to_pool (tmp);
2681 /* Initialize instruction data for INSN in ID using DF's data. */
2683 init_id_from_df (idata_t id, insn_t insn, bool force_unique_p)
2685 gcc_assert (DF_INSN_UID_SAFE_GET (INSN_UID (insn)) != NULL);
2687 setup_id_for_insn (id, insn, force_unique_p);
2688 setup_id_lhs_rhs (id, insn, force_unique_p);
2690 if (INSN_NOP_P (insn))
2693 maybe_downgrade_id_to_use (id, insn);
2694 setup_id_reg_sets (id, insn);
2697 /* Initialize instruction data for INSN in ID. */
2699 deps_init_id (idata_t id, insn_t insn, bool force_unique_p)
2701 struct deps_desc _dc, *dc = &_dc;
2703 deps_init_id_data.where = DEPS_IN_NOWHERE;
2704 deps_init_id_data.id = id;
2705 deps_init_id_data.force_unique_p = force_unique_p;
2706 deps_init_id_data.force_use_p = false;
2708 init_deps (dc, false);
2710 memcpy (&deps_init_id_sched_deps_info,
2711 &const_deps_init_id_sched_deps_info,
2712 sizeof (deps_init_id_sched_deps_info));
2714 if (spec_info != NULL)
2715 deps_init_id_sched_deps_info.generate_spec_deps = 1;
2717 sched_deps_info = &deps_init_id_sched_deps_info;
2719 deps_analyze_insn (dc, insn);
2723 deps_init_id_data.id = NULL;
2728 /* Implement hooks for collecting fundamental insn properties like if insn is
2729 an ASM or is within a SCHED_GROUP. */
2731 /* True when a "one-time init" data for INSN was already inited. */
2733 first_time_insn_init (insn_t insn)
2735 return INSN_LIVE (insn) == NULL;
2738 /* Hash an entry in a transformed_insns hashtable. */
2740 hash_transformed_insns (const void *p)
2742 return VINSN_HASH_RTX (((const struct transformed_insns *) p)->vinsn_old);
2745 /* Compare the entries in a transformed_insns hashtable. */
2747 eq_transformed_insns (const void *p, const void *q)
2749 rtx i1 = VINSN_INSN_RTX (((const struct transformed_insns *) p)->vinsn_old);
2750 rtx i2 = VINSN_INSN_RTX (((const struct transformed_insns *) q)->vinsn_old);
2752 if (INSN_UID (i1) == INSN_UID (i2))
2754 return rtx_equal_p (PATTERN (i1), PATTERN (i2));
2757 /* Free an entry in a transformed_insns hashtable. */
2759 free_transformed_insns (void *p)
2761 struct transformed_insns *pti = (struct transformed_insns *) p;
2763 vinsn_detach (pti->vinsn_old);
2764 vinsn_detach (pti->vinsn_new);
2768 /* Init the s_i_d data for INSN which should be inited just once, when
2769 we first see the insn. */
2771 init_first_time_insn_data (insn_t insn)
2773 /* This should not be set if this is the first time we init data for
2775 gcc_assert (first_time_insn_init (insn));
2777 /* These are needed for nops too. */
2778 INSN_LIVE (insn) = get_regset_from_pool ();
2779 INSN_LIVE_VALID_P (insn) = false;
2781 if (!INSN_NOP_P (insn))
2783 INSN_ANALYZED_DEPS (insn) = BITMAP_ALLOC (NULL);
2784 INSN_FOUND_DEPS (insn) = BITMAP_ALLOC (NULL);
2785 INSN_TRANSFORMED_INSNS (insn)
2786 = htab_create (16, hash_transformed_insns,
2787 eq_transformed_insns, free_transformed_insns);
2788 init_deps (&INSN_DEPS_CONTEXT (insn), true);
2792 /* Free almost all above data for INSN that is scheduled already.
2793 Used for extra-large basic blocks. */
2795 free_data_for_scheduled_insn (insn_t insn)
2797 gcc_assert (! first_time_insn_init (insn));
2799 if (! INSN_ANALYZED_DEPS (insn))
2802 BITMAP_FREE (INSN_ANALYZED_DEPS (insn));
2803 BITMAP_FREE (INSN_FOUND_DEPS (insn));
2804 htab_delete (INSN_TRANSFORMED_INSNS (insn));
2806 /* This is allocated only for bookkeeping insns. */
2807 if (INSN_ORIGINATORS (insn))
2808 BITMAP_FREE (INSN_ORIGINATORS (insn));
2809 free_deps (&INSN_DEPS_CONTEXT (insn));
2811 INSN_ANALYZED_DEPS (insn) = NULL;
2813 /* Clear the readonly flag so we would ICE when trying to recalculate
2814 the deps context (as we believe that it should not happen). */
2815 (&INSN_DEPS_CONTEXT (insn))->readonly = 0;
2818 /* Free the same data as above for INSN. */
2820 free_first_time_insn_data (insn_t insn)
2822 gcc_assert (! first_time_insn_init (insn));
2824 free_data_for_scheduled_insn (insn);
2825 return_regset_to_pool (INSN_LIVE (insn));
2826 INSN_LIVE (insn) = NULL;
2827 INSN_LIVE_VALID_P (insn) = false;
2830 /* Initialize region-scope data structures for basic blocks. */
2832 init_global_and_expr_for_bb (basic_block bb)
2834 if (sel_bb_empty_p (bb))
2837 invalidate_av_set (bb);
2840 /* Data for global dependency analysis (to initialize CANT_MOVE and
2844 /* Previous insn. */
2848 /* Determine if INSN is in the sched_group, is an asm or should not be
2849 cloned. After that initialize its expr. */
2851 init_global_and_expr_for_insn (insn_t insn)
2856 if (NOTE_INSN_BASIC_BLOCK_P (insn))
2858 init_global_data.prev_insn = NULL_RTX;
2862 gcc_assert (INSN_P (insn));
2864 if (SCHED_GROUP_P (insn))
2865 /* Setup a sched_group. */
2867 insn_t prev_insn = init_global_data.prev_insn;
2870 INSN_SCHED_NEXT (prev_insn) = insn;
2872 init_global_data.prev_insn = insn;
2875 init_global_data.prev_insn = NULL_RTX;
2877 if (GET_CODE (PATTERN (insn)) == ASM_INPUT
2878 || asm_noperands (PATTERN (insn)) >= 0)
2879 /* Mark INSN as an asm. */
2880 INSN_ASM_P (insn) = true;
2883 bool force_unique_p;
2886 /* Certain instructions cannot be cloned, and frame related insns and
2887 the insn adjacent to NOTE_INSN_EPILOGUE_BEG cannot be moved out of
2889 if (prologue_epilogue_contains (insn))
2891 if (RTX_FRAME_RELATED_P (insn))
2892 CANT_MOVE (insn) = 1;
2896 for (note = REG_NOTES (insn); note; note = XEXP (note, 1))
2897 if (REG_NOTE_KIND (note) == REG_SAVE_NOTE
2898 && ((enum insn_note) INTVAL (XEXP (note, 0))
2899 == NOTE_INSN_EPILOGUE_BEG))
2901 CANT_MOVE (insn) = 1;
2905 force_unique_p = true;
2908 if (CANT_MOVE (insn)
2909 || INSN_ASM_P (insn)
2910 || SCHED_GROUP_P (insn)
2912 /* Exception handling insns are always unique. */
2913 || (cfun->can_throw_non_call_exceptions && can_throw_internal (insn))
2914 /* TRAP_IF though have an INSN code is control_flow_insn_p (). */
2915 || control_flow_insn_p (insn))
2916 force_unique_p = true;
2918 force_unique_p = false;
2920 if (targetm.sched.get_insn_spec_ds)
2922 spec_done_ds = targetm.sched.get_insn_spec_ds (insn);
2923 spec_done_ds = ds_get_max_dep_weak (spec_done_ds);
2928 /* Initialize INSN's expr. */
2929 init_expr (INSN_EXPR (insn), vinsn_create (insn, force_unique_p), 0,
2930 REG_BR_PROB_BASE, INSN_PRIORITY (insn), 0, BLOCK_NUM (insn),
2931 spec_done_ds, 0, 0, NULL, true, false, false, false,
2935 init_first_time_insn_data (insn);
2938 /* Scan the region and initialize instruction data for basic blocks BBS. */
2940 sel_init_global_and_expr (bb_vec_t bbs)
2942 /* ??? It would be nice to implement push / pop scheme for sched_infos. */
2943 const struct sched_scan_info_def ssi =
2945 NULL, /* extend_bb */
2946 init_global_and_expr_for_bb, /* init_bb */
2947 extend_insn_data, /* extend_insn */
2948 init_global_and_expr_for_insn /* init_insn */
2951 sched_scan (&ssi, bbs, NULL, NULL, NULL);
2954 /* Finalize region-scope data structures for basic blocks. */
2956 finish_global_and_expr_for_bb (basic_block bb)
2958 av_set_clear (&BB_AV_SET (bb));
2959 BB_AV_LEVEL (bb) = 0;
2962 /* Finalize INSN's data. */
2964 finish_global_and_expr_insn (insn_t insn)
2966 if (LABEL_P (insn) || NOTE_INSN_BASIC_BLOCK_P (insn))
2969 gcc_assert (INSN_P (insn));
2971 if (INSN_LUID (insn) > 0)
2973 free_first_time_insn_data (insn);
2974 INSN_WS_LEVEL (insn) = 0;
2975 CANT_MOVE (insn) = 0;
2977 /* We can no longer assert this, as vinsns of this insn could be
2978 easily live in other insn's caches. This should be changed to
2979 a counter-like approach among all vinsns. */
2980 gcc_assert (true || VINSN_COUNT (INSN_VINSN (insn)) == 1);
2981 clear_expr (INSN_EXPR (insn));
2985 /* Finalize per instruction data for the whole region. */
2987 sel_finish_global_and_expr (void)
2993 bbs = VEC_alloc (basic_block, heap, current_nr_blocks);
2995 for (i = 0; i < current_nr_blocks; i++)
2996 VEC_quick_push (basic_block, bbs, BASIC_BLOCK (BB_TO_BLOCK (i)));
2998 /* Clear AV_SETs and INSN_EXPRs. */
3000 const struct sched_scan_info_def ssi =
3002 NULL, /* extend_bb */
3003 finish_global_and_expr_for_bb, /* init_bb */
3004 NULL, /* extend_insn */
3005 finish_global_and_expr_insn /* init_insn */
3008 sched_scan (&ssi, bbs, NULL, NULL, NULL);
3011 VEC_free (basic_block, heap, bbs);
3018 /* In the below hooks, we merely calculate whether or not a dependence
3019 exists, and in what part of insn. However, we will need more data
3020 when we'll start caching dependence requests. */
3022 /* Container to hold information for dependency analysis. */
3027 /* A variable to track which part of rtx we are scanning in
3028 sched-deps.c: sched_analyze_insn (). */
3031 /* Current producer. */
3034 /* Current consumer. */
3037 /* Is SEL_DEPS_HAS_DEP_P[DEPS_IN_X] is true, then X has a dependence.
3038 X is from { INSN, LHS, RHS }. */
3039 ds_t has_dep_p[DEPS_IN_NOWHERE];
3040 } has_dependence_data;
3042 /* Start analyzing dependencies of INSN. */
3044 has_dependence_start_insn (insn_t insn ATTRIBUTE_UNUSED)
3046 gcc_assert (has_dependence_data.where == DEPS_IN_NOWHERE);
3048 has_dependence_data.where = DEPS_IN_INSN;
3051 /* Finish analyzing dependencies of an insn. */
3053 has_dependence_finish_insn (void)
3055 gcc_assert (has_dependence_data.where == DEPS_IN_INSN);
3057 has_dependence_data.where = DEPS_IN_NOWHERE;
3060 /* Start analyzing dependencies of LHS. */
3062 has_dependence_start_lhs (rtx lhs ATTRIBUTE_UNUSED)
3064 gcc_assert (has_dependence_data.where == DEPS_IN_INSN);
3066 if (VINSN_LHS (has_dependence_data.con) != NULL)
3067 has_dependence_data.where = DEPS_IN_LHS;
3070 /* Finish analyzing dependencies of an lhs. */
3072 has_dependence_finish_lhs (void)
3074 has_dependence_data.where = DEPS_IN_INSN;
3077 /* Start analyzing dependencies of RHS. */
3079 has_dependence_start_rhs (rtx rhs ATTRIBUTE_UNUSED)
3081 gcc_assert (has_dependence_data.where == DEPS_IN_INSN);
3083 if (VINSN_RHS (has_dependence_data.con) != NULL)
3084 has_dependence_data.where = DEPS_IN_RHS;
3087 /* Start analyzing dependencies of an rhs. */
3089 has_dependence_finish_rhs (void)
3091 gcc_assert (has_dependence_data.where == DEPS_IN_RHS
3092 || has_dependence_data.where == DEPS_IN_INSN);
3094 has_dependence_data.where = DEPS_IN_INSN;
3097 /* Note a set of REGNO. */
3099 has_dependence_note_reg_set (int regno)
3101 struct deps_reg *reg_last = &has_dependence_data.dc->reg_last[regno];
3103 if (!sched_insns_conditions_mutex_p (has_dependence_data.pro,
3105 (has_dependence_data.con)))
3107 ds_t *dsp = &has_dependence_data.has_dep_p[has_dependence_data.where];
3109 if (reg_last->sets != NULL
3110 || reg_last->clobbers != NULL)
3111 *dsp = (*dsp & ~SPECULATIVE) | DEP_OUTPUT;
3114 *dsp = (*dsp & ~SPECULATIVE) | DEP_ANTI;
3118 /* Note a clobber of REGNO. */
3120 has_dependence_note_reg_clobber (int regno)
3122 struct deps_reg *reg_last = &has_dependence_data.dc->reg_last[regno];
3124 if (!sched_insns_conditions_mutex_p (has_dependence_data.pro,
3126 (has_dependence_data.con)))
3128 ds_t *dsp = &has_dependence_data.has_dep_p[has_dependence_data.where];
3131 *dsp = (*dsp & ~SPECULATIVE) | DEP_OUTPUT;
3134 *dsp = (*dsp & ~SPECULATIVE) | DEP_ANTI;
3138 /* Note a use of REGNO. */
3140 has_dependence_note_reg_use (int regno)
3142 struct deps_reg *reg_last = &has_dependence_data.dc->reg_last[regno];
3144 if (!sched_insns_conditions_mutex_p (has_dependence_data.pro,
3146 (has_dependence_data.con)))
3148 ds_t *dsp = &has_dependence_data.has_dep_p[has_dependence_data.where];
3151 *dsp = (*dsp & ~SPECULATIVE) | DEP_TRUE;
3153 if (reg_last->clobbers)
3154 *dsp = (*dsp & ~SPECULATIVE) | DEP_ANTI;
3156 /* Handle BE_IN_SPEC. */
3159 ds_t pro_spec_checked_ds;
3161 pro_spec_checked_ds = INSN_SPEC_CHECKED_DS (has_dependence_data.pro);
3162 pro_spec_checked_ds = ds_get_max_dep_weak (pro_spec_checked_ds);
3164 if (pro_spec_checked_ds != 0)
3165 /* Merge BE_IN_SPEC bits into *DSP. */
3166 *dsp = ds_full_merge (*dsp, pro_spec_checked_ds,
3167 NULL_RTX, NULL_RTX);
3172 /* Note a memory dependence. */
3174 has_dependence_note_mem_dep (rtx mem ATTRIBUTE_UNUSED,
3175 rtx pending_mem ATTRIBUTE_UNUSED,
3176 insn_t pending_insn ATTRIBUTE_UNUSED,
3177 ds_t ds ATTRIBUTE_UNUSED)
3179 if (!sched_insns_conditions_mutex_p (has_dependence_data.pro,
3180 VINSN_INSN_RTX (has_dependence_data.con)))
3182 ds_t *dsp = &has_dependence_data.has_dep_p[has_dependence_data.where];
3184 *dsp = ds_full_merge (ds, *dsp, pending_mem, mem);
3188 /* Note a dependence. */
3190 has_dependence_note_dep (insn_t pro ATTRIBUTE_UNUSED,
3191 ds_t ds ATTRIBUTE_UNUSED)
3193 if (!sched_insns_conditions_mutex_p (has_dependence_data.pro,
3194 VINSN_INSN_RTX (has_dependence_data.con)))
3196 ds_t *dsp = &has_dependence_data.has_dep_p[has_dependence_data.where];
3198 *dsp = ds_full_merge (ds, *dsp, NULL_RTX, NULL_RTX);
3202 /* Mark the insn as having a hard dependence that prevents speculation. */
3204 sel_mark_hard_insn (rtx insn)
3208 /* Only work when we're in has_dependence_p mode.
3209 ??? This is a hack, this should actually be a hook. */
3210 if (!has_dependence_data.dc || !has_dependence_data.pro)
3213 gcc_assert (insn == VINSN_INSN_RTX (has_dependence_data.con));
3214 gcc_assert (has_dependence_data.where == DEPS_IN_INSN);
3216 for (i = 0; i < DEPS_IN_NOWHERE; i++)
3217 has_dependence_data.has_dep_p[i] &= ~SPECULATIVE;
3220 /* This structure holds the hooks for the dependency analysis used when
3221 actually processing dependencies in the scheduler. */
3222 static struct sched_deps_info_def has_dependence_sched_deps_info;
3224 /* This initializes most of the fields of the above structure. */
3225 static const struct sched_deps_info_def const_has_dependence_sched_deps_info =
3229 has_dependence_start_insn,
3230 has_dependence_finish_insn,
3231 has_dependence_start_lhs,
3232 has_dependence_finish_lhs,
3233 has_dependence_start_rhs,
3234 has_dependence_finish_rhs,
3235 has_dependence_note_reg_set,
3236 has_dependence_note_reg_clobber,
3237 has_dependence_note_reg_use,
3238 has_dependence_note_mem_dep,
3239 has_dependence_note_dep,
3242 0, /* use_deps_list */
3243 0 /* generate_spec_deps */
3246 /* Initialize has_dependence_sched_deps_info with extra spec field. */
3248 setup_has_dependence_sched_deps_info (void)
3250 memcpy (&has_dependence_sched_deps_info,
3251 &const_has_dependence_sched_deps_info,
3252 sizeof (has_dependence_sched_deps_info));
3254 if (spec_info != NULL)
3255 has_dependence_sched_deps_info.generate_spec_deps = 1;
3257 sched_deps_info = &has_dependence_sched_deps_info;
3260 /* Remove all dependences found and recorded in has_dependence_data array. */
3262 sel_clear_has_dependence (void)
3266 for (i = 0; i < DEPS_IN_NOWHERE; i++)
3267 has_dependence_data.has_dep_p[i] = 0;
3270 /* Return nonzero if EXPR has is dependent upon PRED. Return the pointer
3271 to the dependence information array in HAS_DEP_PP. */
3273 has_dependence_p (expr_t expr, insn_t pred, ds_t **has_dep_pp)
3277 struct deps_desc *dc;
3279 if (INSN_SIMPLEJUMP_P (pred))
3280 /* Unconditional jump is just a transfer of control flow.
3284 dc = &INSN_DEPS_CONTEXT (pred);
3286 /* We init this field lazily. */
3287 if (dc->reg_last == NULL)
3288 init_deps_reg_last (dc);
3292 has_dependence_data.pro = NULL;
3293 /* Initialize empty dep context with information about PRED. */
3294 advance_deps_context (dc, pred);
3298 has_dependence_data.where = DEPS_IN_NOWHERE;
3299 has_dependence_data.pro = pred;
3300 has_dependence_data.con = EXPR_VINSN (expr);
3301 has_dependence_data.dc = dc;
3303 sel_clear_has_dependence ();
3305 /* Now catch all dependencies that would be generated between PRED and
3307 setup_has_dependence_sched_deps_info ();
3308 deps_analyze_insn (dc, EXPR_INSN_RTX (expr));
3309 has_dependence_data.dc = NULL;
3311 /* When a barrier was found, set DEPS_IN_INSN bits. */
3312 if (dc->last_reg_pending_barrier == TRUE_BARRIER)
3313 has_dependence_data.has_dep_p[DEPS_IN_INSN] = DEP_TRUE;
3314 else if (dc->last_reg_pending_barrier == MOVE_BARRIER)
3315 has_dependence_data.has_dep_p[DEPS_IN_INSN] = DEP_ANTI;
3317 /* Do not allow stores to memory to move through checks. Currently
3318 we don't move this to sched-deps.c as the check doesn't have
3319 obvious places to which this dependence can be attached.
3320 FIMXE: this should go to a hook. */
3322 && MEM_P (EXPR_LHS (expr))
3323 && sel_insn_is_speculation_check (pred))
3324 has_dependence_data.has_dep_p[DEPS_IN_INSN] = DEP_ANTI;
3326 *has_dep_pp = has_dependence_data.has_dep_p;
3328 for (i = 0; i < DEPS_IN_NOWHERE; i++)
3329 ds = ds_full_merge (ds, has_dependence_data.has_dep_p[i],
3330 NULL_RTX, NULL_RTX);
3336 /* Dependence hooks implementation that checks dependence latency constraints
3337 on the insns being scheduled. The entry point for these routines is
3338 tick_check_p predicate. */
3342 /* An expr we are currently checking. */
3345 /* A minimal cycle for its scheduling. */
3348 /* Whether we have seen a true dependence while checking. */
3349 bool seen_true_dep_p;
3352 /* Update minimal scheduling cycle for tick_check_insn given that it depends
3353 on PRO with status DS and weight DW. */
3355 tick_check_dep_with_dw (insn_t pro_insn, ds_t ds, dw_t dw)
3357 expr_t con_expr = tick_check_data.expr;
3358 insn_t con_insn = EXPR_INSN_RTX (con_expr);
3360 if (con_insn != pro_insn)
3365 if (/* PROducer was removed from above due to pipelining. */
3366 !INSN_IN_STREAM_P (pro_insn)
3367 /* Or PROducer was originally on the next iteration regarding the
3369 || (INSN_SCHED_TIMES (pro_insn)
3370 - EXPR_SCHED_TIMES (con_expr)) > 1)
3371 /* Don't count this dependence. */
3375 if (dt == REG_DEP_TRUE)
3376 tick_check_data.seen_true_dep_p = true;
3378 gcc_assert (INSN_SCHED_CYCLE (pro_insn) > 0);
3381 dep_def _dep, *dep = &_dep;
3383 init_dep (dep, pro_insn, con_insn, dt);
3385 tick = INSN_SCHED_CYCLE (pro_insn) + dep_cost_1 (dep, dw);
3388 /* When there are several kinds of dependencies between pro and con,
3389 only REG_DEP_TRUE should be taken into account. */
3390 if (tick > tick_check_data.cycle
3391 && (dt == REG_DEP_TRUE || !tick_check_data.seen_true_dep_p))
3392 tick_check_data.cycle = tick;
3396 /* An implementation of note_dep hook. */
3398 tick_check_note_dep (insn_t pro, ds_t ds)
3400 tick_check_dep_with_dw (pro, ds, 0);
3403 /* An implementation of note_mem_dep hook. */
3405 tick_check_note_mem_dep (rtx mem1, rtx mem2, insn_t pro, ds_t ds)
3409 dw = (ds_to_dt (ds) == REG_DEP_TRUE
3410 ? estimate_dep_weak (mem1, mem2)
3413 tick_check_dep_with_dw (pro, ds, dw);
3416 /* This structure contains hooks for dependence analysis used when determining
3417 whether an insn is ready for scheduling. */
3418 static struct sched_deps_info_def tick_check_sched_deps_info =
3429 haifa_note_reg_clobber,
3431 tick_check_note_mem_dep,
3432 tick_check_note_dep,
3437 /* Estimate number of cycles from the current cycle of FENCE until EXPR can be
3438 scheduled. Return 0 if all data from producers in DC is ready. */
3440 tick_check_p (expr_t expr, deps_t dc, fence_t fence)
3443 /* Initialize variables. */
3444 tick_check_data.expr = expr;
3445 tick_check_data.cycle = 0;
3446 tick_check_data.seen_true_dep_p = false;
3447 sched_deps_info = &tick_check_sched_deps_info;
3449 gcc_assert (!dc->readonly);
3451 deps_analyze_insn (dc, EXPR_INSN_RTX (expr));
3454 cycles_left = tick_check_data.cycle - FENCE_CYCLE (fence);
3456 return cycles_left >= 0 ? cycles_left : 0;
3460 /* Functions to work with insns. */
3462 /* Returns true if LHS of INSN is the same as DEST of an insn
3465 lhs_of_insn_equals_to_dest_p (insn_t insn, rtx dest)
3467 rtx lhs = INSN_LHS (insn);
3469 if (lhs == NULL || dest == NULL)
3472 return rtx_equal_p (lhs, dest);
3475 /* Return s_i_d entry of INSN. Callable from debugger. */
3477 insn_sid (insn_t insn)
3482 /* True when INSN is a speculative check. We can tell this by looking
3483 at the data structures of the selective scheduler, not by examining
3486 sel_insn_is_speculation_check (rtx insn)
3488 return s_i_d && !! INSN_SPEC_CHECKED_DS (insn);
3491 /* Extracts machine mode MODE and destination location DST_LOC
3494 get_dest_and_mode (rtx insn, rtx *dst_loc, enum machine_mode *mode)
3496 rtx pat = PATTERN (insn);
3498 gcc_assert (dst_loc);
3499 gcc_assert (GET_CODE (pat) == SET);
3501 *dst_loc = SET_DEST (pat);
3503 gcc_assert (*dst_loc);
3504 gcc_assert (MEM_P (*dst_loc) || REG_P (*dst_loc));
3507 *mode = GET_MODE (*dst_loc);
3510 /* Returns true when moving through JUMP will result in bookkeeping
3513 bookkeeping_can_be_created_if_moved_through_p (insn_t jump)
3518 FOR_EACH_SUCC (succ, si, jump)
3519 if (sel_num_cfg_preds_gt_1 (succ))
3525 /* Return 'true' if INSN is the only one in its basic block. */
3527 insn_is_the_only_one_in_bb_p (insn_t insn)
3529 return sel_bb_head_p (insn) && sel_bb_end_p (insn);
3532 #ifdef ENABLE_CHECKING
3533 /* Check that the region we're scheduling still has at most one
3536 verify_backedges (void)
3544 for (i = 0; i < current_nr_blocks; i++)
3545 FOR_EACH_EDGE (e, ei, BASIC_BLOCK (BB_TO_BLOCK (i))->succs)
3546 if (in_current_region_p (e->dest)
3547 && BLOCK_TO_BB (e->dest->index) < i)
3550 gcc_assert (n <= 1);
3556 /* Functions to work with control flow. */
3558 /* Recompute BLOCK_TO_BB and BB_FOR_BLOCK for current region so that blocks
3559 are sorted in topological order (it might have been invalidated by
3560 redirecting an edge). */
3562 sel_recompute_toporder (void)
3565 int *postorder, n_blocks;
3567 postorder = XALLOCAVEC (int, n_basic_blocks);
3568 n_blocks = post_order_compute (postorder, false, false);
3570 rgn = CONTAINING_RGN (BB_TO_BLOCK (0));
3571 for (n = 0, i = n_blocks - 1; i >= 0; i--)
3572 if (CONTAINING_RGN (postorder[i]) == rgn)
3574 BLOCK_TO_BB (postorder[i]) = n;
3575 BB_TO_BLOCK (n) = postorder[i];
3579 /* Assert that we updated info for all blocks. We may miss some blocks if
3580 this function is called when redirecting an edge made a block
3581 unreachable, but that block is not deleted yet. */
3582 gcc_assert (n == RGN_NR_BLOCKS (rgn));
3585 /* Tidy the possibly empty block BB. */
3587 maybe_tidy_empty_bb (basic_block bb)
3589 basic_block succ_bb, pred_bb;
3590 VEC (basic_block, heap) *dom_bbs;
3595 /* Keep empty bb only if this block immediately precedes EXIT and
3596 has incoming non-fallthrough edge, or it has no predecessors or
3597 successors. Otherwise remove it. */
3598 if (!sel_bb_empty_p (bb)
3599 || (single_succ_p (bb)
3600 && single_succ (bb) == EXIT_BLOCK_PTR
3601 && (!single_pred_p (bb)
3602 || !(single_pred_edge (bb)->flags & EDGE_FALLTHRU)))
3603 || EDGE_COUNT (bb->preds) == 0
3604 || EDGE_COUNT (bb->succs) == 0)
3607 /* Do not attempt to redirect complex edges. */
3608 FOR_EACH_EDGE (e, ei, bb->preds)
3609 if (e->flags & EDGE_COMPLEX)
3612 free_data_sets (bb);
3614 /* Do not delete BB if it has more than one successor.
3615 That can occur when we moving a jump. */
3616 if (!single_succ_p (bb))
3618 gcc_assert (can_merge_blocks_p (bb->prev_bb, bb));
3619 sel_merge_blocks (bb->prev_bb, bb);
3623 succ_bb = single_succ (bb);
3628 /* Redirect all non-fallthru edges to the next bb. */
3633 FOR_EACH_EDGE (e, ei, bb->preds)
3637 if (!(e->flags & EDGE_FALLTHRU))
3639 /* We can not invalidate computed topological order by moving
3640 the edge destination block (E->SUCC) along a fallthru edge.
3642 We will update dominators here only when we'll get
3643 an unreachable block when redirecting, otherwise
3644 sel_redirect_edge_and_branch will take care of it. */
3646 && single_pred_p (e->dest))
3647 VEC_safe_push (basic_block, heap, dom_bbs, e->dest);
3648 sel_redirect_edge_and_branch (e, succ_bb);
3652 /* If the edge is fallthru, but PRED_BB ends in a conditional jump
3653 to BB (so there is no non-fallthru edge from PRED_BB to BB), we
3654 still have to adjust it. */
3655 else if (single_succ_p (pred_bb) && any_condjump_p (BB_END (pred_bb)))
3657 /* If possible, try to remove the unneeded conditional jump. */
3658 if (INSN_SCHED_TIMES (BB_END (pred_bb)) == 0
3659 && !IN_CURRENT_FENCE_P (BB_END (pred_bb)))
3661 if (!sel_remove_insn (BB_END (pred_bb), false, false))
3662 tidy_fallthru_edge (e);
3665 sel_redirect_edge_and_branch (e, succ_bb);
3672 if (can_merge_blocks_p (bb->prev_bb, bb))
3673 sel_merge_blocks (bb->prev_bb, bb);
3676 /* This is a block without fallthru predecessor. Just delete it. */
3677 gcc_assert (pred_bb != NULL);
3679 if (in_current_region_p (pred_bb))
3680 move_bb_info (pred_bb, bb);
3681 remove_empty_bb (bb, true);
3684 if (!VEC_empty (basic_block, dom_bbs))
3686 VEC_safe_push (basic_block, heap, dom_bbs, succ_bb);
3687 iterate_fix_dominators (CDI_DOMINATORS, dom_bbs, false);
3688 VEC_free (basic_block, heap, dom_bbs);
3694 /* Tidy the control flow after we have removed original insn from
3695 XBB. Return true if we have removed some blocks. When FULL_TIDYING
3696 is true, also try to optimize control flow on non-empty blocks. */
3698 tidy_control_flow (basic_block xbb, bool full_tidying)
3700 bool changed = true;
3703 /* First check whether XBB is empty. */
3704 changed = maybe_tidy_empty_bb (xbb);
3705 if (changed || !full_tidying)
3708 /* Check if there is a unnecessary jump after insn left. */
3709 if (bb_has_removable_jump_to_p (xbb, xbb->next_bb)
3710 && INSN_SCHED_TIMES (BB_END (xbb)) == 0
3711 && !IN_CURRENT_FENCE_P (BB_END (xbb)))
3713 if (sel_remove_insn (BB_END (xbb), false, false))
3715 tidy_fallthru_edge (EDGE_SUCC (xbb, 0));
3718 first = sel_bb_head (xbb);
3719 last = sel_bb_end (xbb);
3720 if (MAY_HAVE_DEBUG_INSNS)
3722 if (first != last && DEBUG_INSN_P (first))
3724 first = NEXT_INSN (first);
3725 while (first != last && (DEBUG_INSN_P (first) || NOTE_P (first)));
3727 if (first != last && DEBUG_INSN_P (last))
3729 last = PREV_INSN (last);
3730 while (first != last && (DEBUG_INSN_P (last) || NOTE_P (last)));
3732 /* Check if there is an unnecessary jump in previous basic block leading
3733 to next basic block left after removing INSN from stream.
3734 If it is so, remove that jump and redirect edge to current
3735 basic block (where there was INSN before deletion). This way
3736 when NOP will be deleted several instructions later with its
3737 basic block we will not get a jump to next instruction, which
3740 && !sel_bb_empty_p (xbb)
3741 && INSN_NOP_P (last)
3742 /* Flow goes fallthru from current block to the next. */
3743 && EDGE_COUNT (xbb->succs) == 1
3744 && (EDGE_SUCC (xbb, 0)->flags & EDGE_FALLTHRU)
3745 /* When successor is an EXIT block, it may not be the next block. */
3746 && single_succ (xbb) != EXIT_BLOCK_PTR
3747 /* And unconditional jump in previous basic block leads to
3748 next basic block of XBB and this jump can be safely removed. */
3749 && in_current_region_p (xbb->prev_bb)
3750 && bb_has_removable_jump_to_p (xbb->prev_bb, xbb->next_bb)
3751 && INSN_SCHED_TIMES (BB_END (xbb->prev_bb)) == 0
3752 /* Also this jump is not at the scheduling boundary. */
3753 && !IN_CURRENT_FENCE_P (BB_END (xbb->prev_bb)))
3755 bool recompute_toporder_p;
3756 /* Clear data structures of jump - jump itself will be removed
3757 by sel_redirect_edge_and_branch. */
3758 clear_expr (INSN_EXPR (BB_END (xbb->prev_bb)));
3759 recompute_toporder_p
3760 = sel_redirect_edge_and_branch (EDGE_SUCC (xbb->prev_bb, 0), xbb);
3762 gcc_assert (EDGE_SUCC (xbb->prev_bb, 0)->flags & EDGE_FALLTHRU);
3764 /* It can turn out that after removing unused jump, basic block
3765 that contained that jump, becomes empty too. In such case
3767 if (sel_bb_empty_p (xbb->prev_bb))
3768 changed = maybe_tidy_empty_bb (xbb->prev_bb);
3769 if (recompute_toporder_p)
3770 sel_recompute_toporder ();
3773 #ifdef ENABLE_CHECKING
3774 verify_backedges ();
3775 verify_dominators (CDI_DOMINATORS);
3781 /* Purge meaningless empty blocks in the middle of a region. */
3783 purge_empty_blocks (void)
3787 /* Do not attempt to delete the first basic block in the region. */
3788 for (i = 1; i < current_nr_blocks; )
3790 basic_block b = BASIC_BLOCK (BB_TO_BLOCK (i));
3792 if (maybe_tidy_empty_bb (b))
3799 /* Rip-off INSN from the insn stream. When ONLY_DISCONNECT is true,
3800 do not delete insn's data, because it will be later re-emitted.
3801 Return true if we have removed some blocks afterwards. */
3803 sel_remove_insn (insn_t insn, bool only_disconnect, bool full_tidying)
3805 basic_block bb = BLOCK_FOR_INSN (insn);
3807 gcc_assert (INSN_IN_STREAM_P (insn));
3809 if (DEBUG_INSN_P (insn) && BB_AV_SET_VALID_P (bb))
3814 /* When we remove a debug insn that is head of a BB, it remains
3815 in the AV_SET of the block, but it shouldn't. */
3816 FOR_EACH_EXPR_1 (expr, i, &BB_AV_SET (bb))
3817 if (EXPR_INSN_RTX (expr) == insn)
3819 av_set_iter_remove (&i);
3824 if (only_disconnect)
3826 insn_t prev = PREV_INSN (insn);
3827 insn_t next = NEXT_INSN (insn);
3828 basic_block bb = BLOCK_FOR_INSN (insn);
3830 NEXT_INSN (prev) = next;
3831 PREV_INSN (next) = prev;
3833 if (BB_HEAD (bb) == insn)
3835 gcc_assert (BLOCK_FOR_INSN (prev) == bb);
3836 BB_HEAD (bb) = prev;
3838 if (BB_END (bb) == insn)
3844 clear_expr (INSN_EXPR (insn));
3847 /* It is necessary to null this fields before calling add_insn (). */
3848 PREV_INSN (insn) = NULL_RTX;
3849 NEXT_INSN (insn) = NULL_RTX;
3851 return tidy_control_flow (bb, full_tidying);
3854 /* Estimate number of the insns in BB. */
3856 sel_estimate_number_of_insns (basic_block bb)
3859 insn_t insn = NEXT_INSN (BB_HEAD (bb)), next_tail = NEXT_INSN (BB_END (bb));
3861 for (; insn != next_tail; insn = NEXT_INSN (insn))
3862 if (NONDEBUG_INSN_P (insn))
3868 /* We don't need separate luids for notes or labels. */
3870 sel_luid_for_non_insn (rtx x)
3872 gcc_assert (NOTE_P (x) || LABEL_P (x));
3877 /* Return seqno of the only predecessor of INSN. */
3879 get_seqno_of_a_pred (insn_t insn)
3883 gcc_assert (INSN_SIMPLEJUMP_P (insn));
3885 if (!sel_bb_head_p (insn))
3886 seqno = INSN_SEQNO (PREV_INSN (insn));
3889 basic_block bb = BLOCK_FOR_INSN (insn);
3891 if (single_pred_p (bb)
3892 && !in_current_region_p (single_pred (bb)))
3894 /* We can have preds outside a region when splitting edges
3895 for pipelining of an outer loop. Use succ instead.
3896 There should be only one of them. */
3901 gcc_assert (flag_sel_sched_pipelining_outer_loops
3902 && current_loop_nest);
3903 FOR_EACH_SUCC_1 (succ, si, insn,
3904 SUCCS_NORMAL | SUCCS_SKIP_TO_LOOP_EXITS)
3910 gcc_assert (succ != NULL);
3911 seqno = INSN_SEQNO (succ);
3918 cfg_preds (BLOCK_FOR_INSN (insn), &preds, &n);
3919 gcc_assert (n == 1);
3921 seqno = INSN_SEQNO (preds[0]);
3930 /* Find the proper seqno for inserting at INSN. Returns -1 if no predecessors
3931 with positive seqno exist. */
3933 get_seqno_by_preds (rtx insn)
3935 basic_block bb = BLOCK_FOR_INSN (insn);
3936 rtx tmp = insn, head = BB_HEAD (bb);
3942 return INSN_SEQNO (tmp);
3944 tmp = PREV_INSN (tmp);
3946 cfg_preds (bb, &preds, &n);
3947 for (i = 0, seqno = -1; i < n; i++)
3948 seqno = MAX (seqno, INSN_SEQNO (preds[i]));
3955 /* Extend pass-scope data structures for basic blocks. */
3957 sel_extend_global_bb_info (void)
3959 VEC_safe_grow_cleared (sel_global_bb_info_def, heap, sel_global_bb_info,
3963 /* Extend region-scope data structures for basic blocks. */
3965 extend_region_bb_info (void)
3967 VEC_safe_grow_cleared (sel_region_bb_info_def, heap, sel_region_bb_info,
3971 /* Extend all data structures to fit for all basic blocks. */
3973 extend_bb_info (void)
3975 sel_extend_global_bb_info ();
3976 extend_region_bb_info ();
3979 /* Finalize pass-scope data structures for basic blocks. */
3981 sel_finish_global_bb_info (void)
3983 VEC_free (sel_global_bb_info_def, heap, sel_global_bb_info);
3986 /* Finalize region-scope data structures for basic blocks. */
3988 finish_region_bb_info (void)
3990 VEC_free (sel_region_bb_info_def, heap, sel_region_bb_info);
3994 /* Data for each insn in current region. */
3995 VEC (sel_insn_data_def, heap) *s_i_d = NULL;
3997 /* A vector for the insns we've emitted. */
3998 static insn_vec_t new_insns = NULL;
4000 /* Extend data structures for insns from current region. */
4002 extend_insn_data (void)
4006 sched_extend_target ();
4007 sched_deps_init (false);
4009 /* Extend data structures for insns from current region. */
4010 reserve = (sched_max_luid + 1
4011 - VEC_length (sel_insn_data_def, s_i_d));
4013 && ! VEC_space (sel_insn_data_def, s_i_d, reserve))
4017 if (sched_max_luid / 2 > 1024)
4018 size = sched_max_luid + 1024;
4020 size = 3 * sched_max_luid / 2;
4023 VEC_safe_grow_cleared (sel_insn_data_def, heap, s_i_d, size);
4027 /* Finalize data structures for insns from current region. */
4033 /* Clear here all dependence contexts that may have left from insns that were
4034 removed during the scheduling. */
4035 for (i = 0; i < VEC_length (sel_insn_data_def, s_i_d); i++)
4037 sel_insn_data_def *sid_entry = VEC_index (sel_insn_data_def, s_i_d, i);
4039 if (sid_entry->live)
4040 return_regset_to_pool (sid_entry->live);
4041 if (sid_entry->analyzed_deps)
4043 BITMAP_FREE (sid_entry->analyzed_deps);
4044 BITMAP_FREE (sid_entry->found_deps);
4045 htab_delete (sid_entry->transformed_insns);
4046 free_deps (&sid_entry->deps_context);
4048 if (EXPR_VINSN (&sid_entry->expr))
4050 clear_expr (&sid_entry->expr);
4052 /* Also, clear CANT_MOVE bit here, because we really don't want it
4053 to be passed to the next region. */
4054 CANT_MOVE_BY_LUID (i) = 0;
4058 VEC_free (sel_insn_data_def, heap, s_i_d);
4061 /* A proxy to pass initialization data to init_insn (). */
4062 static sel_insn_data_def _insn_init_ssid;
4063 static sel_insn_data_t insn_init_ssid = &_insn_init_ssid;
4065 /* If true create a new vinsn. Otherwise use the one from EXPR. */
4066 static bool insn_init_create_new_vinsn_p;
4068 /* Set all necessary data for initialization of the new insn[s]. */
4070 set_insn_init (expr_t expr, vinsn_t vi, int seqno)
4072 expr_t x = &insn_init_ssid->expr;
4074 copy_expr_onside (x, expr);
4077 insn_init_create_new_vinsn_p = false;
4078 change_vinsn_in_expr (x, vi);
4081 insn_init_create_new_vinsn_p = true;
4083 insn_init_ssid->seqno = seqno;
4087 /* Init data for INSN. */
4089 init_insn_data (insn_t insn)
4092 sel_insn_data_t ssid = insn_init_ssid;
4094 /* The fields mentioned below are special and hence are not being
4095 propagated to the new insns. */
4096 gcc_assert (!ssid->asm_p && ssid->sched_next == NULL
4097 && !ssid->after_stall_p && ssid->sched_cycle == 0);
4098 gcc_assert (INSN_P (insn) && INSN_LUID (insn) > 0);
4100 expr = INSN_EXPR (insn);
4101 copy_expr (expr, &ssid->expr);
4102 prepare_insn_expr (insn, ssid->seqno);
4104 if (insn_init_create_new_vinsn_p)
4105 change_vinsn_in_expr (expr, vinsn_create (insn, init_insn_force_unique_p));
4107 if (first_time_insn_init (insn))
4108 init_first_time_insn_data (insn);
4111 /* This is used to initialize spurious jumps generated by
4112 sel_redirect_edge (). */
4114 init_simplejump_data (insn_t insn)
4116 init_expr (INSN_EXPR (insn), vinsn_create (insn, false), 0,
4117 REG_BR_PROB_BASE, 0, 0, 0, 0, 0, 0, NULL, true, false, false,
4119 INSN_SEQNO (insn) = get_seqno_of_a_pred (insn);
4120 init_first_time_insn_data (insn);
4123 /* Perform deferred initialization of insns. This is used to process
4124 a new jump that may be created by redirect_edge. */
4126 sel_init_new_insn (insn_t insn, int flags)
4128 /* We create data structures for bb when the first insn is emitted in it. */
4130 && INSN_IN_STREAM_P (insn)
4131 && insn_is_the_only_one_in_bb_p (insn))
4134 create_initial_data_sets (BLOCK_FOR_INSN (insn));
4137 if (flags & INSN_INIT_TODO_LUID)
4138 sched_init_luids (NULL, NULL, NULL, insn);
4140 if (flags & INSN_INIT_TODO_SSID)
4142 extend_insn_data ();
4143 init_insn_data (insn);
4144 clear_expr (&insn_init_ssid->expr);
4147 if (flags & INSN_INIT_TODO_SIMPLEJUMP)
4149 extend_insn_data ();
4150 init_simplejump_data (insn);
4153 gcc_assert (CONTAINING_RGN (BLOCK_NUM (insn))
4154 == CONTAINING_RGN (BB_TO_BLOCK (0)));
4158 /* Functions to init/finish work with lv sets. */
4160 /* Init BB_LV_SET of BB from DF_LR_IN set of BB. */
4162 init_lv_set (basic_block bb)
4164 gcc_assert (!BB_LV_SET_VALID_P (bb));
4166 BB_LV_SET (bb) = get_regset_from_pool ();
4167 COPY_REG_SET (BB_LV_SET (bb), DF_LR_IN (bb));
4168 BB_LV_SET_VALID_P (bb) = true;
4171 /* Copy liveness information to BB from FROM_BB. */
4173 copy_lv_set_from (basic_block bb, basic_block from_bb)
4175 gcc_assert (!BB_LV_SET_VALID_P (bb));
4177 COPY_REG_SET (BB_LV_SET (bb), BB_LV_SET (from_bb));
4178 BB_LV_SET_VALID_P (bb) = true;
4181 /* Initialize lv set of all bb headers. */
4187 /* Initialize of LV sets. */
4191 /* Don't forget EXIT_BLOCK. */
4192 init_lv_set (EXIT_BLOCK_PTR);
4195 /* Release lv set of HEAD. */
4197 free_lv_set (basic_block bb)
4199 gcc_assert (BB_LV_SET (bb) != NULL);
4201 return_regset_to_pool (BB_LV_SET (bb));
4202 BB_LV_SET (bb) = NULL;
4203 BB_LV_SET_VALID_P (bb) = false;
4206 /* Finalize lv sets of all bb headers. */
4212 /* Don't forget EXIT_BLOCK. */
4213 free_lv_set (EXIT_BLOCK_PTR);
4221 /* Initialize an invalid AV_SET for BB.
4222 This set will be updated next time compute_av () process BB. */
4224 invalidate_av_set (basic_block bb)
4226 gcc_assert (BB_AV_LEVEL (bb) <= 0
4227 && BB_AV_SET (bb) == NULL);
4229 BB_AV_LEVEL (bb) = -1;
4232 /* Create initial data sets for BB (they will be invalid). */
4234 create_initial_data_sets (basic_block bb)
4237 BB_LV_SET_VALID_P (bb) = false;
4239 BB_LV_SET (bb) = get_regset_from_pool ();
4240 invalidate_av_set (bb);
4243 /* Free av set of BB. */
4245 free_av_set (basic_block bb)
4247 av_set_clear (&BB_AV_SET (bb));
4248 BB_AV_LEVEL (bb) = 0;
4251 /* Free data sets of BB. */
4253 free_data_sets (basic_block bb)
4259 /* Exchange lv sets of TO and FROM. */
4261 exchange_lv_sets (basic_block to, basic_block from)
4264 regset to_lv_set = BB_LV_SET (to);
4266 BB_LV_SET (to) = BB_LV_SET (from);
4267 BB_LV_SET (from) = to_lv_set;
4271 bool to_lv_set_valid_p = BB_LV_SET_VALID_P (to);
4273 BB_LV_SET_VALID_P (to) = BB_LV_SET_VALID_P (from);
4274 BB_LV_SET_VALID_P (from) = to_lv_set_valid_p;
4279 /* Exchange av sets of TO and FROM. */
4281 exchange_av_sets (basic_block to, basic_block from)
4284 av_set_t to_av_set = BB_AV_SET (to);
4286 BB_AV_SET (to) = BB_AV_SET (from);
4287 BB_AV_SET (from) = to_av_set;
4291 int to_av_level = BB_AV_LEVEL (to);
4293 BB_AV_LEVEL (to) = BB_AV_LEVEL (from);
4294 BB_AV_LEVEL (from) = to_av_level;
4298 /* Exchange data sets of TO and FROM. */
4300 exchange_data_sets (basic_block to, basic_block from)
4302 exchange_lv_sets (to, from);
4303 exchange_av_sets (to, from);
4306 /* Copy data sets of FROM to TO. */
4308 copy_data_sets (basic_block to, basic_block from)
4310 gcc_assert (!BB_LV_SET_VALID_P (to) && !BB_AV_SET_VALID_P (to));
4311 gcc_assert (BB_AV_SET (to) == NULL);
4313 BB_AV_LEVEL (to) = BB_AV_LEVEL (from);
4314 BB_LV_SET_VALID_P (to) = BB_LV_SET_VALID_P (from);
4316 if (BB_AV_SET_VALID_P (from))
4318 BB_AV_SET (to) = av_set_copy (BB_AV_SET (from));
4320 if (BB_LV_SET_VALID_P (from))
4322 gcc_assert (BB_LV_SET (to) != NULL);
4323 COPY_REG_SET (BB_LV_SET (to), BB_LV_SET (from));
4327 /* Return an av set for INSN, if any. */
4329 get_av_set (insn_t insn)
4333 gcc_assert (AV_SET_VALID_P (insn));
4335 if (sel_bb_head_p (insn))
4336 av_set = BB_AV_SET (BLOCK_FOR_INSN (insn));
4343 /* Implementation of AV_LEVEL () macro. Return AV_LEVEL () of INSN. */
4345 get_av_level (insn_t insn)
4349 gcc_assert (INSN_P (insn));
4351 if (sel_bb_head_p (insn))
4352 av_level = BB_AV_LEVEL (BLOCK_FOR_INSN (insn));
4354 av_level = INSN_WS_LEVEL (insn);
4361 /* Variables to work with control-flow graph. */
4363 /* The basic block that already has been processed by the sched_data_update (),
4364 but hasn't been in sel_add_bb () yet. */
4365 static VEC (basic_block, heap) *last_added_blocks = NULL;
4367 /* A pool for allocating successor infos. */
4370 /* A stack for saving succs_info structures. */
4371 struct succs_info *stack;
4376 /* Top of the stack. */
4379 /* Maximal value of the top. */
4383 /* Functions to work with control-flow graph. */
4385 /* Return basic block note of BB. */
4387 sel_bb_head (basic_block bb)
4391 if (bb == EXIT_BLOCK_PTR)
4393 gcc_assert (exit_insn != NULL_RTX);
4400 note = bb_note (bb);
4401 head = next_nonnote_insn (note);
4403 if (head && (BARRIER_P (head) || BLOCK_FOR_INSN (head) != bb))
4410 /* Return true if INSN is a basic block header. */
4412 sel_bb_head_p (insn_t insn)
4414 return sel_bb_head (BLOCK_FOR_INSN (insn)) == insn;
4417 /* Return last insn of BB. */
4419 sel_bb_end (basic_block bb)
4421 if (sel_bb_empty_p (bb))
4424 gcc_assert (bb != EXIT_BLOCK_PTR);
4429 /* Return true if INSN is the last insn in its basic block. */
4431 sel_bb_end_p (insn_t insn)
4433 return insn == sel_bb_end (BLOCK_FOR_INSN (insn));
4436 /* Return true if BB consist of single NOTE_INSN_BASIC_BLOCK. */
4438 sel_bb_empty_p (basic_block bb)
4440 return sel_bb_head (bb) == NULL;
4443 /* True when BB belongs to the current scheduling region. */
4445 in_current_region_p (basic_block bb)
4447 if (bb->index < NUM_FIXED_BLOCKS)
4450 return CONTAINING_RGN (bb->index) == CONTAINING_RGN (BB_TO_BLOCK (0));
4453 /* Return the block which is a fallthru bb of a conditional jump JUMP. */
4455 fallthru_bb_of_jump (rtx jump)
4460 if (!any_condjump_p (jump))
4463 /* A basic block that ends with a conditional jump may still have one successor
4464 (and be followed by a barrier), we are not interested. */
4465 if (single_succ_p (BLOCK_FOR_INSN (jump)))
4468 return FALLTHRU_EDGE (BLOCK_FOR_INSN (jump))->dest;
4471 /* Remove all notes from BB. */
4473 init_bb (basic_block bb)
4475 remove_notes (bb_note (bb), BB_END (bb));
4476 BB_NOTE_LIST (bb) = note_list;
4480 sel_init_bbs (bb_vec_t bbs, basic_block bb)
4482 const struct sched_scan_info_def ssi =
4484 extend_bb_info, /* extend_bb */
4485 init_bb, /* init_bb */
4486 NULL, /* extend_insn */
4487 NULL /* init_insn */
4490 sched_scan (&ssi, bbs, bb, new_insns, NULL);
4493 /* Restore notes for the whole region. */
4495 sel_restore_notes (void)
4500 for (bb = 0; bb < current_nr_blocks; bb++)
4502 basic_block first, last;
4504 first = EBB_FIRST_BB (bb);
4505 last = EBB_LAST_BB (bb)->next_bb;
4509 note_list = BB_NOTE_LIST (first);
4510 restore_other_notes (NULL, first);
4511 BB_NOTE_LIST (first) = NULL_RTX;
4513 FOR_BB_INSNS (first, insn)
4514 if (NONDEBUG_INSN_P (insn))
4515 reemit_notes (insn);
4517 first = first->next_bb;
4519 while (first != last);
4523 /* Free per-bb data structures. */
4525 sel_finish_bbs (void)
4527 sel_restore_notes ();
4529 /* Remove current loop preheader from this loop. */
4530 if (current_loop_nest)
4531 sel_remove_loop_preheader ();
4533 finish_region_bb_info ();
4536 /* Return true if INSN has a single successor of type FLAGS. */
4538 sel_insn_has_single_succ_p (insn_t insn, int flags)
4542 bool first_p = true;
4544 FOR_EACH_SUCC_1 (succ, si, insn, flags)
4555 /* Allocate successor's info. */
4556 static struct succs_info *
4557 alloc_succs_info (void)
4559 if (succs_info_pool.top == succs_info_pool.max_top)
4563 if (++succs_info_pool.max_top >= succs_info_pool.size)
4566 i = ++succs_info_pool.top;
4567 succs_info_pool.stack[i].succs_ok = VEC_alloc (rtx, heap, 10);
4568 succs_info_pool.stack[i].succs_other = VEC_alloc (rtx, heap, 10);
4569 succs_info_pool.stack[i].probs_ok = VEC_alloc (int, heap, 10);
4572 succs_info_pool.top++;
4574 return &succs_info_pool.stack[succs_info_pool.top];
4577 /* Free successor's info. */
4579 free_succs_info (struct succs_info * sinfo)
4581 gcc_assert (succs_info_pool.top >= 0
4582 && &succs_info_pool.stack[succs_info_pool.top] == sinfo);
4583 succs_info_pool.top--;
4585 /* Clear stale info. */
4586 VEC_block_remove (rtx, sinfo->succs_ok,
4587 0, VEC_length (rtx, sinfo->succs_ok));
4588 VEC_block_remove (rtx, sinfo->succs_other,
4589 0, VEC_length (rtx, sinfo->succs_other));
4590 VEC_block_remove (int, sinfo->probs_ok,
4591 0, VEC_length (int, sinfo->probs_ok));
4592 sinfo->all_prob = 0;
4593 sinfo->succs_ok_n = 0;
4594 sinfo->all_succs_n = 0;
4597 /* Compute successor info for INSN. FLAGS are the flags passed
4598 to the FOR_EACH_SUCC_1 iterator. */
4600 compute_succs_info (insn_t insn, short flags)
4604 struct succs_info *sinfo = alloc_succs_info ();
4606 /* Traverse *all* successors and decide what to do with each. */
4607 FOR_EACH_SUCC_1 (succ, si, insn, SUCCS_ALL)
4609 /* FIXME: this doesn't work for skipping to loop exits, as we don't
4610 perform code motion through inner loops. */
4611 short current_flags = si.current_flags & ~SUCCS_SKIP_TO_LOOP_EXITS;
4613 if (current_flags & flags)
4615 VEC_safe_push (rtx, heap, sinfo->succs_ok, succ);
4616 VEC_safe_push (int, heap, sinfo->probs_ok,
4617 /* FIXME: Improve calculation when skipping
4618 inner loop to exits. */
4620 ? si.e1->probability
4621 : REG_BR_PROB_BASE));
4622 sinfo->succs_ok_n++;
4625 VEC_safe_push (rtx, heap, sinfo->succs_other, succ);
4627 /* Compute all_prob. */
4629 sinfo->all_prob = REG_BR_PROB_BASE;
4631 sinfo->all_prob += si.e1->probability;
4633 sinfo->all_succs_n++;
4639 /* Return the predecessors of BB in PREDS and their number in N.
4640 Empty blocks are skipped. SIZE is used to allocate PREDS. */
4642 cfg_preds_1 (basic_block bb, insn_t **preds, int *n, int *size)
4647 gcc_assert (BLOCK_TO_BB (bb->index) != 0);
4649 FOR_EACH_EDGE (e, ei, bb->preds)
4651 basic_block pred_bb = e->src;
4652 insn_t bb_end = BB_END (pred_bb);
4654 if (!in_current_region_p (pred_bb))
4656 gcc_assert (flag_sel_sched_pipelining_outer_loops
4657 && current_loop_nest);
4661 if (sel_bb_empty_p (pred_bb))
4662 cfg_preds_1 (pred_bb, preds, n, size);
4666 *preds = XRESIZEVEC (insn_t, *preds,
4667 (*size = 2 * *size + 1));
4668 (*preds)[(*n)++] = bb_end;
4673 || (flag_sel_sched_pipelining_outer_loops
4674 && current_loop_nest));
4677 /* Find all predecessors of BB and record them in PREDS and their number
4678 in N. Empty blocks are skipped, and only normal (forward in-region)
4679 edges are processed. */
4681 cfg_preds (basic_block bb, insn_t **preds, int *n)
4687 cfg_preds_1 (bb, preds, n, &size);
4690 /* Returns true if we are moving INSN through join point. */
4692 sel_num_cfg_preds_gt_1 (insn_t insn)
4696 if (!sel_bb_head_p (insn) || INSN_BB (insn) == 0)
4699 bb = BLOCK_FOR_INSN (insn);
4703 if (EDGE_COUNT (bb->preds) > 1)
4706 gcc_assert (EDGE_PRED (bb, 0)->dest == bb);
4707 bb = EDGE_PRED (bb, 0)->src;
4709 if (!sel_bb_empty_p (bb))
4716 /* Returns true when BB should be the end of an ebb. Adapted from the
4717 code in sched-ebb.c. */
4719 bb_ends_ebb_p (basic_block bb)
4721 basic_block next_bb = bb_next_bb (bb);
4724 if (next_bb == EXIT_BLOCK_PTR
4725 || bitmap_bit_p (forced_ebb_heads, next_bb->index)
4726 || (LABEL_P (BB_HEAD (next_bb))
4727 /* NB: LABEL_NUSES () is not maintained outside of jump.c.
4728 Work around that. */
4729 && !single_pred_p (next_bb)))
4732 if (!in_current_region_p (next_bb))
4735 e = find_fallthru_edge (bb->succs);
4738 gcc_assert (e->dest == next_bb);
4746 /* Returns true when INSN and SUCC are in the same EBB, given that SUCC is a
4747 successor of INSN. */
4749 in_same_ebb_p (insn_t insn, insn_t succ)
4751 basic_block ptr = BLOCK_FOR_INSN (insn);
4755 if (ptr == BLOCK_FOR_INSN (succ))
4758 if (bb_ends_ebb_p (ptr))
4761 ptr = bb_next_bb (ptr);
4768 /* Recomputes the reverse topological order for the function and
4769 saves it in REV_TOP_ORDER_INDEX. REV_TOP_ORDER_INDEX_LEN is also
4770 modified appropriately. */
4772 recompute_rev_top_order (void)
4777 if (!rev_top_order_index || rev_top_order_index_len < last_basic_block)
4779 rev_top_order_index_len = last_basic_block;
4780 rev_top_order_index = XRESIZEVEC (int, rev_top_order_index,
4781 rev_top_order_index_len);
4784 postorder = XNEWVEC (int, n_basic_blocks);
4786 n_blocks = post_order_compute (postorder, true, false);
4787 gcc_assert (n_basic_blocks == n_blocks);
4789 /* Build reverse function: for each basic block with BB->INDEX == K
4790 rev_top_order_index[K] is it's reverse topological sort number. */
4791 for (i = 0; i < n_blocks; i++)
4793 gcc_assert (postorder[i] < rev_top_order_index_len);
4794 rev_top_order_index[postorder[i]] = i;
4800 /* Clear all flags from insns in BB that could spoil its rescheduling. */
4802 clear_outdated_rtx_info (basic_block bb)
4806 FOR_BB_INSNS (bb, insn)
4809 SCHED_GROUP_P (insn) = 0;
4810 INSN_AFTER_STALL_P (insn) = 0;
4811 INSN_SCHED_TIMES (insn) = 0;
4812 EXPR_PRIORITY_ADJ (INSN_EXPR (insn)) = 0;
4814 /* We cannot use the changed caches, as previously we could ignore
4815 the LHS dependence due to enabled renaming and transform
4816 the expression, and currently we'll be unable to do this. */
4817 htab_empty (INSN_TRANSFORMED_INSNS (insn));
4821 /* Add BB_NOTE to the pool of available basic block notes. */
4823 return_bb_to_pool (basic_block bb)
4825 rtx note = bb_note (bb);
4827 gcc_assert (NOTE_BASIC_BLOCK (note) == bb
4828 && bb->aux == NULL);
4830 /* It turns out that current cfg infrastructure does not support
4831 reuse of basic blocks. Don't bother for now. */
4832 /*VEC_safe_push (rtx, heap, bb_note_pool, note);*/
4835 /* Get a bb_note from pool or return NULL_RTX if pool is empty. */
4837 get_bb_note_from_pool (void)
4839 if (VEC_empty (rtx, bb_note_pool))
4843 rtx note = VEC_pop (rtx, bb_note_pool);
4845 PREV_INSN (note) = NULL_RTX;
4846 NEXT_INSN (note) = NULL_RTX;
4852 /* Free bb_note_pool. */
4854 free_bb_note_pool (void)
4856 VEC_free (rtx, heap, bb_note_pool);
4859 /* Setup scheduler pool and successor structure. */
4861 alloc_sched_pools (void)
4865 succs_size = MAX_WS + 1;
4866 succs_info_pool.stack = XCNEWVEC (struct succs_info, succs_size);
4867 succs_info_pool.size = succs_size;
4868 succs_info_pool.top = -1;
4869 succs_info_pool.max_top = -1;
4871 sched_lists_pool = create_alloc_pool ("sel-sched-lists",
4872 sizeof (struct _list_node), 500);
4875 /* Free the pools. */
4877 free_sched_pools (void)
4881 free_alloc_pool (sched_lists_pool);
4882 gcc_assert (succs_info_pool.top == -1);
4883 for (i = 0; i <= succs_info_pool.max_top; i++)
4885 VEC_free (rtx, heap, succs_info_pool.stack[i].succs_ok);
4886 VEC_free (rtx, heap, succs_info_pool.stack[i].succs_other);
4887 VEC_free (int, heap, succs_info_pool.stack[i].probs_ok);
4889 free (succs_info_pool.stack);
4893 /* Returns a position in RGN where BB can be inserted retaining
4894 topological order. */
4896 find_place_to_insert_bb (basic_block bb, int rgn)
4898 bool has_preds_outside_rgn = false;
4902 /* Find whether we have preds outside the region. */
4903 FOR_EACH_EDGE (e, ei, bb->preds)
4904 if (!in_current_region_p (e->src))
4906 has_preds_outside_rgn = true;
4910 /* Recompute the top order -- needed when we have > 1 pred
4911 and in case we don't have preds outside. */
4912 if (flag_sel_sched_pipelining_outer_loops
4913 && (has_preds_outside_rgn || EDGE_COUNT (bb->preds) > 1))
4915 int i, bbi = bb->index, cur_bbi;
4917 recompute_rev_top_order ();
4918 for (i = RGN_NR_BLOCKS (rgn) - 1; i >= 0; i--)
4920 cur_bbi = BB_TO_BLOCK (i);
4921 if (rev_top_order_index[bbi]
4922 < rev_top_order_index[cur_bbi])
4926 /* We skipped the right block, so we increase i. We accomodate
4927 it for increasing by step later, so we decrease i. */
4930 else if (has_preds_outside_rgn)
4932 /* This is the case when we generate an extra empty block
4933 to serve as region head during pipelining. */
4934 e = EDGE_SUCC (bb, 0);
4935 gcc_assert (EDGE_COUNT (bb->succs) == 1
4936 && in_current_region_p (EDGE_SUCC (bb, 0)->dest)
4937 && (BLOCK_TO_BB (e->dest->index) == 0));
4941 /* We don't have preds outside the region. We should have
4942 the only pred, because the multiple preds case comes from
4943 the pipelining of outer loops, and that is handled above.
4944 Just take the bbi of this single pred. */
4945 if (EDGE_COUNT (bb->succs) > 0)
4949 gcc_assert (EDGE_COUNT (bb->preds) == 1);
4951 pred_bbi = EDGE_PRED (bb, 0)->src->index;
4952 return BLOCK_TO_BB (pred_bbi);
4955 /* BB has no successors. It is safe to put it in the end. */
4956 return current_nr_blocks - 1;
4959 /* Deletes an empty basic block freeing its data. */
4961 delete_and_free_basic_block (basic_block bb)
4963 gcc_assert (sel_bb_empty_p (bb));
4968 bitmap_clear_bit (blocks_to_reschedule, bb->index);
4970 /* Can't assert av_set properties because we use sel_aremove_bb
4971 when removing loop preheader from the region. At the point of
4972 removing the preheader we already have deallocated sel_region_bb_info. */
4973 gcc_assert (BB_LV_SET (bb) == NULL
4974 && !BB_LV_SET_VALID_P (bb)
4975 && BB_AV_LEVEL (bb) == 0
4976 && BB_AV_SET (bb) == NULL);
4978 delete_basic_block (bb);
4981 /* Add BB to the current region and update the region data. */
4983 add_block_to_current_region (basic_block bb)
4985 int i, pos, bbi = -2, rgn;
4987 rgn = CONTAINING_RGN (BB_TO_BLOCK (0));
4988 bbi = find_place_to_insert_bb (bb, rgn);
4990 pos = RGN_BLOCKS (rgn) + bbi;
4992 gcc_assert (RGN_HAS_REAL_EBB (rgn) == 0
4993 && ebb_head[bbi] == pos);
4995 /* Make a place for the new block. */
4998 for (i = RGN_BLOCKS (rgn + 1) - 1; i >= pos; i--)
4999 BLOCK_TO_BB (rgn_bb_table[i])++;
5001 memmove (rgn_bb_table + pos + 1,
5003 (RGN_BLOCKS (nr_regions) - pos) * sizeof (*rgn_bb_table));
5005 /* Initialize data for BB. */
5006 rgn_bb_table[pos] = bb->index;
5007 BLOCK_TO_BB (bb->index) = bbi;
5008 CONTAINING_RGN (bb->index) = rgn;
5010 RGN_NR_BLOCKS (rgn)++;
5012 for (i = rgn + 1; i <= nr_regions; i++)
5016 /* Remove BB from the current region and update the region data. */
5018 remove_bb_from_region (basic_block bb)
5020 int i, pos, bbi = -2, rgn;
5022 rgn = CONTAINING_RGN (BB_TO_BLOCK (0));
5023 bbi = BLOCK_TO_BB (bb->index);
5024 pos = RGN_BLOCKS (rgn) + bbi;
5026 gcc_assert (RGN_HAS_REAL_EBB (rgn) == 0
5027 && ebb_head[bbi] == pos);
5029 for (i = RGN_BLOCKS (rgn + 1) - 1; i >= pos; i--)
5030 BLOCK_TO_BB (rgn_bb_table[i])--;
5032 memmove (rgn_bb_table + pos,
5033 rgn_bb_table + pos + 1,
5034 (RGN_BLOCKS (nr_regions) - pos) * sizeof (*rgn_bb_table));
5036 RGN_NR_BLOCKS (rgn)--;
5037 for (i = rgn + 1; i <= nr_regions; i++)
5041 /* Add BB to the current region and update all data. If BB is NULL, add all
5042 blocks from last_added_blocks vector. */
5044 sel_add_bb (basic_block bb)
5046 /* Extend luids so that new notes will receive zero luids. */
5047 sched_init_luids (NULL, NULL, NULL, NULL);
5049 sel_init_bbs (last_added_blocks, NULL);
5051 /* When bb is passed explicitly, the vector should contain
5052 the only element that equals to bb; otherwise, the vector
5053 should not be NULL. */
5054 gcc_assert (last_added_blocks != NULL);
5058 gcc_assert (VEC_length (basic_block, last_added_blocks) == 1
5059 && VEC_index (basic_block,
5060 last_added_blocks, 0) == bb);
5061 add_block_to_current_region (bb);
5063 /* We associate creating/deleting data sets with the first insn
5064 appearing / disappearing in the bb. */
5065 if (!sel_bb_empty_p (bb) && BB_LV_SET (bb) == NULL)
5066 create_initial_data_sets (bb);
5068 VEC_free (basic_block, heap, last_added_blocks);
5071 /* BB is NULL - process LAST_ADDED_BLOCKS instead. */
5074 basic_block temp_bb = NULL;
5077 VEC_iterate (basic_block, last_added_blocks, i, bb); i++)
5079 add_block_to_current_region (bb);
5083 /* We need to fetch at least one bb so we know the region
5085 gcc_assert (temp_bb != NULL);
5088 VEC_free (basic_block, heap, last_added_blocks);
5091 rgn_setup_region (CONTAINING_RGN (bb->index));
5094 /* Remove BB from the current region and update all data.
5095 If REMOVE_FROM_CFG_PBB is true, also remove the block cfom cfg. */
5097 sel_remove_bb (basic_block bb, bool remove_from_cfg_p)
5099 unsigned idx = bb->index;
5101 gcc_assert (bb != NULL && BB_NOTE_LIST (bb) == NULL_RTX);
5103 remove_bb_from_region (bb);
5104 return_bb_to_pool (bb);
5105 bitmap_clear_bit (blocks_to_reschedule, idx);
5107 if (remove_from_cfg_p)
5109 basic_block succ = single_succ (bb);
5110 delete_and_free_basic_block (bb);
5111 set_immediate_dominator (CDI_DOMINATORS, succ,
5112 recompute_dominator (CDI_DOMINATORS, succ));
5115 rgn_setup_region (CONTAINING_RGN (idx));
5118 /* Concatenate info of EMPTY_BB to info of MERGE_BB. */
5120 move_bb_info (basic_block merge_bb, basic_block empty_bb)
5122 gcc_assert (in_current_region_p (merge_bb));
5124 concat_note_lists (BB_NOTE_LIST (empty_bb),
5125 &BB_NOTE_LIST (merge_bb));
5126 BB_NOTE_LIST (empty_bb) = NULL_RTX;
5130 /* Remove EMPTY_BB. If REMOVE_FROM_CFG_P is false, remove EMPTY_BB from
5131 region, but keep it in CFG. */
5133 remove_empty_bb (basic_block empty_bb, bool remove_from_cfg_p)
5135 /* The block should contain just a note or a label.
5136 We try to check whether it is unused below. */
5137 gcc_assert (BB_HEAD (empty_bb) == BB_END (empty_bb)
5138 || LABEL_P (BB_HEAD (empty_bb)));
5140 /* If basic block has predecessors or successors, redirect them. */
5141 if (remove_from_cfg_p
5142 && (EDGE_COUNT (empty_bb->preds) > 0
5143 || EDGE_COUNT (empty_bb->succs) > 0))
5148 /* We need to init PRED and SUCC before redirecting edges. */
5149 if (EDGE_COUNT (empty_bb->preds) > 0)
5153 gcc_assert (EDGE_COUNT (empty_bb->preds) == 1);
5155 e = EDGE_PRED (empty_bb, 0);
5156 gcc_assert (e->src == empty_bb->prev_bb
5157 && (e->flags & EDGE_FALLTHRU));
5159 pred = empty_bb->prev_bb;
5164 if (EDGE_COUNT (empty_bb->succs) > 0)
5166 /* We do not check fallthruness here as above, because
5167 after removing a jump the edge may actually be not fallthru. */
5168 gcc_assert (EDGE_COUNT (empty_bb->succs) == 1);
5169 succ = EDGE_SUCC (empty_bb, 0)->dest;
5174 if (EDGE_COUNT (empty_bb->preds) > 0 && succ != NULL)
5176 edge e = EDGE_PRED (empty_bb, 0);
5178 if (e->flags & EDGE_FALLTHRU)
5179 redirect_edge_succ_nodup (e, succ);
5181 sel_redirect_edge_and_branch (EDGE_PRED (empty_bb, 0), succ);
5184 if (EDGE_COUNT (empty_bb->succs) > 0 && pred != NULL)
5186 edge e = EDGE_SUCC (empty_bb, 0);
5188 if (find_edge (pred, e->dest) == NULL)
5189 redirect_edge_pred (e, pred);
5193 /* Finish removing. */
5194 sel_remove_bb (empty_bb, remove_from_cfg_p);
5197 /* An implementation of create_basic_block hook, which additionally updates
5198 per-bb data structures. */
5200 sel_create_basic_block (void *headp, void *endp, basic_block after)
5205 gcc_assert (flag_sel_sched_pipelining_outer_loops
5206 || last_added_blocks == NULL);
5208 new_bb_note = get_bb_note_from_pool ();
5210 if (new_bb_note == NULL_RTX)
5211 new_bb = orig_cfg_hooks.create_basic_block (headp, endp, after);
5214 new_bb = create_basic_block_structure ((rtx) headp, (rtx) endp,
5215 new_bb_note, after);
5219 VEC_safe_push (basic_block, heap, last_added_blocks, new_bb);
5224 /* Implement sched_init_only_bb (). */
5226 sel_init_only_bb (basic_block bb, basic_block after)
5228 gcc_assert (after == NULL);
5231 rgn_make_new_region_out_of_new_block (bb);
5234 /* Update the latch when we've splitted or merged it from FROM block to TO.
5235 This should be checked for all outer loops, too. */
5237 change_loops_latches (basic_block from, basic_block to)
5239 gcc_assert (from != to);
5241 if (current_loop_nest)
5245 for (loop = current_loop_nest; loop; loop = loop_outer (loop))
5246 if (considered_for_pipelining_p (loop) && loop->latch == from)
5248 gcc_assert (loop == current_loop_nest);
5250 gcc_assert (loop_latch_edge (loop));
5255 /* Splits BB on two basic blocks, adding it to the region and extending
5256 per-bb data structures. Returns the newly created bb. */
5258 sel_split_block (basic_block bb, rtx after)
5263 new_bb = sched_split_block_1 (bb, after);
5264 sel_add_bb (new_bb);
5266 /* This should be called after sel_add_bb, because this uses
5267 CONTAINING_RGN for the new block, which is not yet initialized.
5268 FIXME: this function may be a no-op now. */
5269 change_loops_latches (bb, new_bb);
5271 /* Update ORIG_BB_INDEX for insns moved into the new block. */
5272 FOR_BB_INSNS (new_bb, insn)
5274 EXPR_ORIG_BB_INDEX (INSN_EXPR (insn)) = new_bb->index;
5276 if (sel_bb_empty_p (bb))
5278 gcc_assert (!sel_bb_empty_p (new_bb));
5280 /* NEW_BB has data sets that need to be updated and BB holds
5281 data sets that should be removed. Exchange these data sets
5282 so that we won't lose BB's valid data sets. */
5283 exchange_data_sets (new_bb, bb);
5284 free_data_sets (bb);
5287 if (!sel_bb_empty_p (new_bb)
5288 && bitmap_bit_p (blocks_to_reschedule, bb->index))
5289 bitmap_set_bit (blocks_to_reschedule, new_bb->index);
5294 /* If BB ends with a jump insn whose ID is bigger then PREV_MAX_UID, return it.
5295 Otherwise returns NULL. */
5297 check_for_new_jump (basic_block bb, int prev_max_uid)
5301 end = sel_bb_end (bb);
5302 if (end && INSN_UID (end) >= prev_max_uid)
5307 /* Look for a new jump either in FROM_BB block or in newly created JUMP_BB block.
5308 New means having UID at least equal to PREV_MAX_UID. */
5310 find_new_jump (basic_block from, basic_block jump_bb, int prev_max_uid)
5314 /* Return immediately if no new insns were emitted. */
5315 if (get_max_uid () == prev_max_uid)
5318 /* Now check both blocks for new jumps. It will ever be only one. */
5319 if ((jump = check_for_new_jump (from, prev_max_uid)))
5323 && (jump = check_for_new_jump (jump_bb, prev_max_uid)))
5328 /* Splits E and adds the newly created basic block to the current region.
5329 Returns this basic block. */
5331 sel_split_edge (edge e)
5333 basic_block new_bb, src, other_bb = NULL;
5338 prev_max_uid = get_max_uid ();
5339 new_bb = split_edge (e);
5341 if (flag_sel_sched_pipelining_outer_loops
5342 && current_loop_nest)
5347 /* Some of the basic blocks might not have been added to the loop.
5348 Add them here, until this is fixed in force_fallthru. */
5350 VEC_iterate (basic_block, last_added_blocks, i, bb); i++)
5351 if (!bb->loop_father)
5353 add_bb_to_loop (bb, e->dest->loop_father);
5355 gcc_assert (!other_bb && (new_bb->index != bb->index));
5360 /* Add all last_added_blocks to the region. */
5363 jump = find_new_jump (src, new_bb, prev_max_uid);
5365 sel_init_new_insn (jump, INSN_INIT_TODO_LUID | INSN_INIT_TODO_SIMPLEJUMP);
5367 /* Put the correct lv set on this block. */
5368 if (other_bb && !sel_bb_empty_p (other_bb))
5369 compute_live (sel_bb_head (other_bb));
5374 /* Implement sched_create_empty_bb (). */
5376 sel_create_empty_bb (basic_block after)
5380 new_bb = sched_create_empty_bb_1 (after);
5382 /* We'll explicitly initialize NEW_BB via sel_init_only_bb () a bit
5384 gcc_assert (VEC_length (basic_block, last_added_blocks) == 1
5385 && VEC_index (basic_block, last_added_blocks, 0) == new_bb);
5387 VEC_free (basic_block, heap, last_added_blocks);
5391 /* Implement sched_create_recovery_block. ORIG_INSN is where block
5392 will be splitted to insert a check. */
5394 sel_create_recovery_block (insn_t orig_insn)
5396 basic_block first_bb, second_bb, recovery_block;
5397 basic_block before_recovery = NULL;
5400 first_bb = BLOCK_FOR_INSN (orig_insn);
5401 if (sel_bb_end_p (orig_insn))
5403 /* Avoid introducing an empty block while splitting. */
5404 gcc_assert (single_succ_p (first_bb));
5405 second_bb = single_succ (first_bb);
5408 second_bb = sched_split_block (first_bb, orig_insn);
5410 recovery_block = sched_create_recovery_block (&before_recovery);
5411 if (before_recovery)
5412 copy_lv_set_from (before_recovery, EXIT_BLOCK_PTR);
5414 gcc_assert (sel_bb_empty_p (recovery_block));
5415 sched_create_recovery_edges (first_bb, recovery_block, second_bb);
5416 if (current_loops != NULL)
5417 add_bb_to_loop (recovery_block, first_bb->loop_father);
5419 sel_add_bb (recovery_block);
5421 jump = BB_END (recovery_block);
5422 gcc_assert (sel_bb_head (recovery_block) == jump);
5423 sel_init_new_insn (jump, INSN_INIT_TODO_LUID | INSN_INIT_TODO_SIMPLEJUMP);
5425 return recovery_block;
5428 /* Merge basic block B into basic block A. */
5430 sel_merge_blocks (basic_block a, basic_block b)
5432 gcc_assert (sel_bb_empty_p (b)
5433 && EDGE_COUNT (b->preds) == 1
5434 && EDGE_PRED (b, 0)->src == b->prev_bb);
5436 move_bb_info (b->prev_bb, b);
5437 remove_empty_bb (b, false);
5438 merge_blocks (a, b);
5439 change_loops_latches (b, a);
5442 /* A wrapper for redirect_edge_and_branch_force, which also initializes
5443 data structures for possibly created bb and insns. Returns the newly
5444 added bb or NULL, when a bb was not needed. */
5446 sel_redirect_edge_and_branch_force (edge e, basic_block to)
5448 basic_block jump_bb, src, orig_dest = e->dest;
5452 /* This function is now used only for bookkeeping code creation, where
5453 we'll never get the single pred of orig_dest block and thus will not
5454 hit unreachable blocks when updating dominator info. */
5455 gcc_assert (!sel_bb_empty_p (e->src)
5456 && !single_pred_p (orig_dest));
5458 prev_max_uid = get_max_uid ();
5459 jump_bb = redirect_edge_and_branch_force (e, to);
5461 if (jump_bb != NULL)
5462 sel_add_bb (jump_bb);
5464 /* This function could not be used to spoil the loop structure by now,
5465 thus we don't care to update anything. But check it to be sure. */
5466 if (current_loop_nest
5468 gcc_assert (loop_latch_edge (current_loop_nest));
5470 jump = find_new_jump (src, jump_bb, prev_max_uid);
5472 sel_init_new_insn (jump, INSN_INIT_TODO_LUID | INSN_INIT_TODO_SIMPLEJUMP);
5473 set_immediate_dominator (CDI_DOMINATORS, to,
5474 recompute_dominator (CDI_DOMINATORS, to));
5475 set_immediate_dominator (CDI_DOMINATORS, orig_dest,
5476 recompute_dominator (CDI_DOMINATORS, orig_dest));
5479 /* A wrapper for redirect_edge_and_branch. Return TRUE if blocks connected by
5480 redirected edge are in reverse topological order. */
5482 sel_redirect_edge_and_branch (edge e, basic_block to)
5485 basic_block src, orig_dest = e->dest;
5489 bool recompute_toporder_p = false;
5490 bool maybe_unreachable = single_pred_p (orig_dest);
5492 latch_edge_p = (pipelining_p
5493 && current_loop_nest
5494 && e == loop_latch_edge (current_loop_nest));
5497 prev_max_uid = get_max_uid ();
5499 redirected = redirect_edge_and_branch (e, to);
5501 gcc_assert (redirected && last_added_blocks == NULL);
5503 /* When we've redirected a latch edge, update the header. */
5506 current_loop_nest->header = to;
5507 gcc_assert (loop_latch_edge (current_loop_nest));
5510 /* In rare situations, the topological relation between the blocks connected
5511 by the redirected edge can change (see PR42245 for an example). Update
5512 block_to_bb/bb_to_block. */
5513 if (CONTAINING_RGN (e->src->index) == CONTAINING_RGN (to->index)
5514 && BLOCK_TO_BB (e->src->index) > BLOCK_TO_BB (to->index))
5515 recompute_toporder_p = true;
5517 jump = find_new_jump (src, NULL, prev_max_uid);
5519 sel_init_new_insn (jump, INSN_INIT_TODO_LUID | INSN_INIT_TODO_SIMPLEJUMP);
5521 /* Only update dominator info when we don't have unreachable blocks.
5522 Otherwise we'll update in maybe_tidy_empty_bb. */
5523 if (!maybe_unreachable)
5525 set_immediate_dominator (CDI_DOMINATORS, to,
5526 recompute_dominator (CDI_DOMINATORS, to));
5527 set_immediate_dominator (CDI_DOMINATORS, orig_dest,
5528 recompute_dominator (CDI_DOMINATORS, orig_dest));
5530 return recompute_toporder_p;
5533 /* This variable holds the cfg hooks used by the selective scheduler. */
5534 static struct cfg_hooks sel_cfg_hooks;
5536 /* Register sel-sched cfg hooks. */
5538 sel_register_cfg_hooks (void)
5540 sched_split_block = sel_split_block;
5542 orig_cfg_hooks = get_cfg_hooks ();
5543 sel_cfg_hooks = orig_cfg_hooks;
5545 sel_cfg_hooks.create_basic_block = sel_create_basic_block;
5547 set_cfg_hooks (sel_cfg_hooks);
5549 sched_init_only_bb = sel_init_only_bb;
5550 sched_split_block = sel_split_block;
5551 sched_create_empty_bb = sel_create_empty_bb;
5554 /* Unregister sel-sched cfg hooks. */
5556 sel_unregister_cfg_hooks (void)
5558 sched_create_empty_bb = NULL;
5559 sched_split_block = NULL;
5560 sched_init_only_bb = NULL;
5562 set_cfg_hooks (orig_cfg_hooks);
5566 /* Emit an insn rtx based on PATTERN. If a jump insn is wanted,
5567 LABEL is where this jump should be directed. */
5569 create_insn_rtx_from_pattern (rtx pattern, rtx label)
5573 gcc_assert (!INSN_P (pattern));
5577 if (label == NULL_RTX)
5578 insn_rtx = emit_insn (pattern);
5579 else if (DEBUG_INSN_P (label))
5580 insn_rtx = emit_debug_insn (pattern);
5583 insn_rtx = emit_jump_insn (pattern);
5584 JUMP_LABEL (insn_rtx) = label;
5585 ++LABEL_NUSES (label);
5590 sched_init_luids (NULL, NULL, NULL, NULL);
5591 sched_extend_target ();
5592 sched_deps_init (false);
5594 /* Initialize INSN_CODE now. */
5595 recog_memoized (insn_rtx);
5599 /* Create a new vinsn for INSN_RTX. FORCE_UNIQUE_P is true when the vinsn
5600 must not be clonable. */
5602 create_vinsn_from_insn_rtx (rtx insn_rtx, bool force_unique_p)
5604 gcc_assert (INSN_P (insn_rtx) && !INSN_IN_STREAM_P (insn_rtx));
5606 /* If VINSN_TYPE is not USE, retain its uniqueness. */
5607 return vinsn_create (insn_rtx, force_unique_p);
5610 /* Create a copy of INSN_RTX. */
5612 create_copy_of_insn_rtx (rtx insn_rtx)
5616 if (DEBUG_INSN_P (insn_rtx))
5617 return create_insn_rtx_from_pattern (copy_rtx (PATTERN (insn_rtx)),
5620 gcc_assert (NONJUMP_INSN_P (insn_rtx));
5622 res = create_insn_rtx_from_pattern (copy_rtx (PATTERN (insn_rtx)),
5627 /* Change vinsn field of EXPR to hold NEW_VINSN. */
5629 change_vinsn_in_expr (expr_t expr, vinsn_t new_vinsn)
5631 vinsn_detach (EXPR_VINSN (expr));
5633 EXPR_VINSN (expr) = new_vinsn;
5634 vinsn_attach (new_vinsn);
5637 /* Helpers for global init. */
5638 /* This structure is used to be able to call existing bundling mechanism
5639 and calculate insn priorities. */
5640 static struct haifa_sched_info sched_sel_haifa_sched_info =
5642 NULL, /* init_ready_list */
5643 NULL, /* can_schedule_ready_p */
5644 NULL, /* schedule_more_p */
5645 NULL, /* new_ready */
5646 NULL, /* rgn_rank */
5647 sel_print_insn, /* rgn_print_insn */
5648 contributes_to_priority,
5649 NULL, /* insn_finishes_block_p */
5655 NULL, /* add_remove_insn */
5656 NULL, /* begin_schedule_ready */
5657 NULL, /* advance_target_bb */
5661 /* Setup special insns used in the scheduler. */
5663 setup_nop_and_exit_insns (void)
5665 gcc_assert (nop_pattern == NULL_RTX
5666 && exit_insn == NULL_RTX);
5668 nop_pattern = constm1_rtx;
5671 emit_insn (nop_pattern);
5672 exit_insn = get_insns ();
5674 set_block_for_insn (exit_insn, EXIT_BLOCK_PTR);
5677 /* Free special insns used in the scheduler. */
5679 free_nop_and_exit_insns (void)
5681 exit_insn = NULL_RTX;
5682 nop_pattern = NULL_RTX;
5685 /* Setup a special vinsn used in new insns initialization. */
5687 setup_nop_vinsn (void)
5689 nop_vinsn = vinsn_create (exit_insn, false);
5690 vinsn_attach (nop_vinsn);
5693 /* Free a special vinsn used in new insns initialization. */
5695 free_nop_vinsn (void)
5697 gcc_assert (VINSN_COUNT (nop_vinsn) == 1);
5698 vinsn_detach (nop_vinsn);
5702 /* Call a set_sched_flags hook. */
5704 sel_set_sched_flags (void)
5706 /* ??? This means that set_sched_flags were called, and we decided to
5707 support speculation. However, set_sched_flags also modifies flags
5708 on current_sched_info, doing this only at global init. And we
5709 sometimes change c_s_i later. So put the correct flags again. */
5710 if (spec_info && targetm.sched.set_sched_flags)
5711 targetm.sched.set_sched_flags (spec_info);
5714 /* Setup pointers to global sched info structures. */
5716 sel_setup_sched_infos (void)
5718 rgn_setup_common_sched_info ();
5720 memcpy (&sel_common_sched_info, common_sched_info,
5721 sizeof (sel_common_sched_info));
5723 sel_common_sched_info.fix_recovery_cfg = NULL;
5724 sel_common_sched_info.add_block = NULL;
5725 sel_common_sched_info.estimate_number_of_insns
5726 = sel_estimate_number_of_insns;
5727 sel_common_sched_info.luid_for_non_insn = sel_luid_for_non_insn;
5728 sel_common_sched_info.sched_pass_id = SCHED_SEL_PASS;
5730 common_sched_info = &sel_common_sched_info;
5732 current_sched_info = &sched_sel_haifa_sched_info;
5733 current_sched_info->sched_max_insns_priority =
5734 get_rgn_sched_max_insns_priority ();
5736 sel_set_sched_flags ();
5740 /* Adds basic block BB to region RGN at the position *BB_ORD_INDEX,
5741 *BB_ORD_INDEX after that is increased. */
5743 sel_add_block_to_region (basic_block bb, int *bb_ord_index, int rgn)
5745 RGN_NR_BLOCKS (rgn) += 1;
5746 RGN_DONT_CALC_DEPS (rgn) = 0;
5747 RGN_HAS_REAL_EBB (rgn) = 0;
5748 CONTAINING_RGN (bb->index) = rgn;
5749 BLOCK_TO_BB (bb->index) = *bb_ord_index;
5750 rgn_bb_table[RGN_BLOCKS (rgn) + *bb_ord_index] = bb->index;
5753 /* FIXME: it is true only when not scheduling ebbs. */
5754 RGN_BLOCKS (rgn + 1) = RGN_BLOCKS (rgn) + RGN_NR_BLOCKS (rgn);
5757 /* Functions to support pipelining of outer loops. */
5759 /* Creates a new empty region and returns it's number. */
5761 sel_create_new_region (void)
5763 int new_rgn_number = nr_regions;
5765 RGN_NR_BLOCKS (new_rgn_number) = 0;
5767 /* FIXME: This will work only when EBBs are not created. */
5768 if (new_rgn_number != 0)
5769 RGN_BLOCKS (new_rgn_number) = RGN_BLOCKS (new_rgn_number - 1) +
5770 RGN_NR_BLOCKS (new_rgn_number - 1);
5772 RGN_BLOCKS (new_rgn_number) = 0;
5774 /* Set the blocks of the next region so the other functions may
5775 calculate the number of blocks in the region. */
5776 RGN_BLOCKS (new_rgn_number + 1) = RGN_BLOCKS (new_rgn_number) +
5777 RGN_NR_BLOCKS (new_rgn_number);
5781 return new_rgn_number;
5784 /* If X has a smaller topological sort number than Y, returns -1;
5785 if greater, returns 1. */
5787 bb_top_order_comparator (const void *x, const void *y)
5789 basic_block bb1 = *(const basic_block *) x;
5790 basic_block bb2 = *(const basic_block *) y;
5792 gcc_assert (bb1 == bb2
5793 || rev_top_order_index[bb1->index]
5794 != rev_top_order_index[bb2->index]);
5796 /* It's a reverse topological order in REV_TOP_ORDER_INDEX, so
5797 bbs with greater number should go earlier. */
5798 if (rev_top_order_index[bb1->index] > rev_top_order_index[bb2->index])
5804 /* Create a region for LOOP and return its number. If we don't want
5805 to pipeline LOOP, return -1. */
5807 make_region_from_loop (struct loop *loop)
5810 int new_rgn_number = -1;
5813 /* Basic block index, to be assigned to BLOCK_TO_BB. */
5814 int bb_ord_index = 0;
5815 basic_block *loop_blocks;
5816 basic_block preheader_block;
5819 > (unsigned) PARAM_VALUE (PARAM_MAX_PIPELINE_REGION_BLOCKS))
5822 /* Don't pipeline loops whose latch belongs to some of its inner loops. */
5823 for (inner = loop->inner; inner; inner = inner->inner)
5824 if (flow_bb_inside_loop_p (inner, loop->latch))
5827 loop->ninsns = num_loop_insns (loop);
5828 if ((int) loop->ninsns > PARAM_VALUE (PARAM_MAX_PIPELINE_REGION_INSNS))
5831 loop_blocks = get_loop_body_in_custom_order (loop, bb_top_order_comparator);
5833 for (i = 0; i < loop->num_nodes; i++)
5834 if (loop_blocks[i]->flags & BB_IRREDUCIBLE_LOOP)
5840 preheader_block = loop_preheader_edge (loop)->src;
5841 gcc_assert (preheader_block);
5842 gcc_assert (loop_blocks[0] == loop->header);
5844 new_rgn_number = sel_create_new_region ();
5846 sel_add_block_to_region (preheader_block, &bb_ord_index, new_rgn_number);
5847 SET_BIT (bbs_in_loop_rgns, preheader_block->index);
5849 for (i = 0; i < loop->num_nodes; i++)
5851 /* Add only those blocks that haven't been scheduled in the inner loop.
5852 The exception is the basic blocks with bookkeeping code - they should
5853 be added to the region (and they actually don't belong to the loop
5854 body, but to the region containing that loop body). */
5856 gcc_assert (new_rgn_number >= 0);
5858 if (! TEST_BIT (bbs_in_loop_rgns, loop_blocks[i]->index))
5860 sel_add_block_to_region (loop_blocks[i], &bb_ord_index,
5862 SET_BIT (bbs_in_loop_rgns, loop_blocks[i]->index);
5867 MARK_LOOP_FOR_PIPELINING (loop);
5869 return new_rgn_number;
5872 /* Create a new region from preheader blocks LOOP_BLOCKS. */
5874 make_region_from_loop_preheader (VEC(basic_block, heap) **loop_blocks)
5877 int new_rgn_number = -1;
5880 /* Basic block index, to be assigned to BLOCK_TO_BB. */
5881 int bb_ord_index = 0;
5883 new_rgn_number = sel_create_new_region ();
5885 FOR_EACH_VEC_ELT (basic_block, *loop_blocks, i, bb)
5887 gcc_assert (new_rgn_number >= 0);
5889 sel_add_block_to_region (bb, &bb_ord_index, new_rgn_number);
5892 VEC_free (basic_block, heap, *loop_blocks);
5893 gcc_assert (*loop_blocks == NULL);
5897 /* Create region(s) from loop nest LOOP, such that inner loops will be
5898 pipelined before outer loops. Returns true when a region for LOOP
5901 make_regions_from_loop_nest (struct loop *loop)
5903 struct loop *cur_loop;
5906 /* Traverse all inner nodes of the loop. */
5907 for (cur_loop = loop->inner; cur_loop; cur_loop = cur_loop->next)
5908 if (! TEST_BIT (bbs_in_loop_rgns, cur_loop->header->index))
5911 /* At this moment all regular inner loops should have been pipelined.
5912 Try to create a region from this loop. */
5913 rgn_number = make_region_from_loop (loop);
5918 VEC_safe_push (loop_p, heap, loop_nests, loop);
5922 /* Initalize data structures needed. */
5924 sel_init_pipelining (void)
5926 /* Collect loop information to be used in outer loops pipelining. */
5927 loop_optimizer_init (LOOPS_HAVE_PREHEADERS
5928 | LOOPS_HAVE_FALLTHRU_PREHEADERS
5929 | LOOPS_HAVE_RECORDED_EXITS
5930 | LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS);
5931 current_loop_nest = NULL;
5933 bbs_in_loop_rgns = sbitmap_alloc (last_basic_block);
5934 sbitmap_zero (bbs_in_loop_rgns);
5936 recompute_rev_top_order ();
5939 /* Returns a struct loop for region RGN. */
5941 get_loop_nest_for_rgn (unsigned int rgn)
5943 /* Regions created with extend_rgns don't have corresponding loop nests,
5944 because they don't represent loops. */
5945 if (rgn < VEC_length (loop_p, loop_nests))
5946 return VEC_index (loop_p, loop_nests, rgn);
5951 /* True when LOOP was included into pipelining regions. */
5953 considered_for_pipelining_p (struct loop *loop)
5955 if (loop_depth (loop) == 0)
5958 /* Now, the loop could be too large or irreducible. Check whether its
5959 region is in LOOP_NESTS.
5960 We determine the region number of LOOP as the region number of its
5961 latch. We can't use header here, because this header could be
5962 just removed preheader and it will give us the wrong region number.
5963 Latch can't be used because it could be in the inner loop too. */
5964 if (LOOP_MARKED_FOR_PIPELINING_P (loop))
5966 int rgn = CONTAINING_RGN (loop->latch->index);
5968 gcc_assert ((unsigned) rgn < VEC_length (loop_p, loop_nests));
5975 /* Makes regions from the rest of the blocks, after loops are chosen
5978 make_regions_from_the_rest (void)
5989 /* Index in rgn_bb_table where to start allocating new regions. */
5990 cur_rgn_blocks = nr_regions ? RGN_BLOCKS (nr_regions) : 0;
5992 /* Make regions from all the rest basic blocks - those that don't belong to
5993 any loop or belong to irreducible loops. Prepare the data structures
5996 /* LOOP_HDR[I] == -1 if I-th bb doesn't belong to any loop,
5997 LOOP_HDR[I] == LOOP_HDR[J] iff basic blocks I and J reside within the same
5999 loop_hdr = XNEWVEC (int, last_basic_block);
6000 degree = XCNEWVEC (int, last_basic_block);
6003 /* For each basic block that belongs to some loop assign the number
6004 of innermost loop it belongs to. */
6005 for (i = 0; i < last_basic_block; i++)
6010 if (bb->loop_father && !bb->loop_father->num == 0
6011 && !(bb->flags & BB_IRREDUCIBLE_LOOP))
6012 loop_hdr[bb->index] = bb->loop_father->num;
6015 /* For each basic block degree is calculated as the number of incoming
6016 edges, that are going out of bbs that are not yet scheduled.
6017 The basic blocks that are scheduled have degree value of zero. */
6020 degree[bb->index] = 0;
6022 if (!TEST_BIT (bbs_in_loop_rgns, bb->index))
6024 FOR_EACH_EDGE (e, ei, bb->preds)
6025 if (!TEST_BIT (bbs_in_loop_rgns, e->src->index))
6026 degree[bb->index]++;
6029 degree[bb->index] = -1;
6032 extend_rgns (degree, &cur_rgn_blocks, bbs_in_loop_rgns, loop_hdr);
6034 /* Any block that did not end up in a region is placed into a region
6037 if (degree[bb->index] >= 0)
6039 rgn_bb_table[cur_rgn_blocks] = bb->index;
6040 RGN_NR_BLOCKS (nr_regions) = 1;
6041 RGN_BLOCKS (nr_regions) = cur_rgn_blocks++;
6042 RGN_DONT_CALC_DEPS (nr_regions) = 0;
6043 RGN_HAS_REAL_EBB (nr_regions) = 0;
6044 CONTAINING_RGN (bb->index) = nr_regions++;
6045 BLOCK_TO_BB (bb->index) = 0;
6052 /* Free data structures used in pipelining of loops. */
6053 void sel_finish_pipelining (void)
6058 /* Release aux fields so we don't free them later by mistake. */
6059 FOR_EACH_LOOP (li, loop, 0)
6062 loop_optimizer_finalize ();
6064 VEC_free (loop_p, heap, loop_nests);
6066 free (rev_top_order_index);
6067 rev_top_order_index = NULL;
6070 /* This function replaces the find_rgns when
6071 FLAG_SEL_SCHED_PIPELINING_OUTER_LOOPS is set. */
6073 sel_find_rgns (void)
6075 sel_init_pipelining ();
6083 FOR_EACH_LOOP (li, loop, (flag_sel_sched_pipelining_outer_loops
6085 : LI_ONLY_INNERMOST))
6086 make_regions_from_loop_nest (loop);
6089 /* Make regions from all the rest basic blocks and schedule them.
6090 These blocks include blocks that don't belong to any loop or belong
6091 to irreducible loops. */
6092 make_regions_from_the_rest ();
6094 /* We don't need bbs_in_loop_rgns anymore. */
6095 sbitmap_free (bbs_in_loop_rgns);
6096 bbs_in_loop_rgns = NULL;
6099 /* Adds the preheader blocks from previous loop to current region taking
6100 it from LOOP_PREHEADER_BLOCKS (current_loop_nest).
6101 This function is only used with -fsel-sched-pipelining-outer-loops. */
6103 sel_add_loop_preheaders (void)
6107 VEC(basic_block, heap) *preheader_blocks
6108 = LOOP_PREHEADER_BLOCKS (current_loop_nest);
6111 VEC_iterate (basic_block, preheader_blocks, i, bb);
6114 VEC_safe_push (basic_block, heap, last_added_blocks, bb);
6118 VEC_free (basic_block, heap, preheader_blocks);
6121 /* While pipelining outer loops, returns TRUE if BB is a loop preheader.
6122 Please note that the function should also work when pipelining_p is
6123 false, because it is used when deciding whether we should or should
6124 not reschedule pipelined code. */
6126 sel_is_loop_preheader_p (basic_block bb)
6128 if (current_loop_nest)
6132 if (preheader_removed)
6135 /* Preheader is the first block in the region. */
6136 if (BLOCK_TO_BB (bb->index) == 0)
6139 /* We used to find a preheader with the topological information.
6140 Check that the above code is equivalent to what we did before. */
6142 if (in_current_region_p (current_loop_nest->header))
6143 gcc_assert (!(BLOCK_TO_BB (bb->index)
6144 < BLOCK_TO_BB (current_loop_nest->header->index)));
6146 /* Support the situation when the latch block of outer loop
6147 could be from here. */
6148 for (outer = loop_outer (current_loop_nest);
6150 outer = loop_outer (outer))
6151 if (considered_for_pipelining_p (outer) && outer->latch == bb)
6158 /* Check whether JUMP_BB ends with a jump insn that leads only to DEST_BB and
6159 can be removed, making the corresponding edge fallthrough (assuming that
6160 all basic blocks between JUMP_BB and DEST_BB are empty). */
6162 bb_has_removable_jump_to_p (basic_block jump_bb, basic_block dest_bb)
6164 if (!onlyjump_p (BB_END (jump_bb))
6165 || tablejump_p (BB_END (jump_bb), NULL, NULL))
6168 /* Several outgoing edges, abnormal edge or destination of jump is
6170 if (EDGE_COUNT (jump_bb->succs) != 1
6171 || EDGE_SUCC (jump_bb, 0)->flags & (EDGE_ABNORMAL | EDGE_CROSSING)
6172 || EDGE_SUCC (jump_bb, 0)->dest != dest_bb)
6175 /* If not anything of the upper. */
6179 /* Removes the loop preheader from the current region and saves it in
6180 PREHEADER_BLOCKS of the father loop, so they will be added later to
6181 region that represents an outer loop. */
6183 sel_remove_loop_preheader (void)
6186 int cur_rgn = CONTAINING_RGN (BB_TO_BLOCK (0));
6188 bool all_empty_p = true;
6189 VEC(basic_block, heap) *preheader_blocks
6190 = LOOP_PREHEADER_BLOCKS (loop_outer (current_loop_nest));
6192 gcc_assert (current_loop_nest);
6193 old_len = VEC_length (basic_block, preheader_blocks);
6195 /* Add blocks that aren't within the current loop to PREHEADER_BLOCKS. */
6196 for (i = 0; i < RGN_NR_BLOCKS (cur_rgn); i++)
6198 bb = BASIC_BLOCK (BB_TO_BLOCK (i));
6200 /* If the basic block belongs to region, but doesn't belong to
6201 corresponding loop, then it should be a preheader. */
6202 if (sel_is_loop_preheader_p (bb))
6204 VEC_safe_push (basic_block, heap, preheader_blocks, bb);
6205 if (BB_END (bb) != bb_note (bb))
6206 all_empty_p = false;
6210 /* Remove these blocks only after iterating over the whole region. */
6211 for (i = VEC_length (basic_block, preheader_blocks) - 1;
6215 bb = VEC_index (basic_block, preheader_blocks, i);
6216 sel_remove_bb (bb, false);
6219 if (!considered_for_pipelining_p (loop_outer (current_loop_nest)))
6222 /* Immediately create new region from preheader. */
6223 make_region_from_loop_preheader (&preheader_blocks);
6226 /* If all preheader blocks are empty - dont create new empty region.
6227 Instead, remove them completely. */
6228 FOR_EACH_VEC_ELT (basic_block, preheader_blocks, i, bb)
6232 basic_block prev_bb = bb->prev_bb, next_bb = bb->next_bb;
6234 /* Redirect all incoming edges to next basic block. */
6235 for (ei = ei_start (bb->preds); (e = ei_safe_edge (ei)); )
6237 if (! (e->flags & EDGE_FALLTHRU))
6238 redirect_edge_and_branch (e, bb->next_bb);
6240 redirect_edge_succ (e, bb->next_bb);
6242 gcc_assert (BB_NOTE_LIST (bb) == NULL);
6243 delete_and_free_basic_block (bb);
6245 /* Check if after deleting preheader there is a nonconditional
6246 jump in PREV_BB that leads to the next basic block NEXT_BB.
6247 If it is so - delete this jump and clear data sets of its
6248 basic block if it becomes empty. */
6249 if (next_bb->prev_bb == prev_bb
6250 && prev_bb != ENTRY_BLOCK_PTR
6251 && bb_has_removable_jump_to_p (prev_bb, next_bb))
6253 redirect_edge_and_branch (EDGE_SUCC (prev_bb, 0), next_bb);
6254 if (BB_END (prev_bb) == bb_note (prev_bb))
6255 free_data_sets (prev_bb);
6258 set_immediate_dominator (CDI_DOMINATORS, next_bb,
6259 recompute_dominator (CDI_DOMINATORS,
6263 VEC_free (basic_block, heap, preheader_blocks);
6266 /* Store preheader within the father's loop structure. */
6267 SET_LOOP_PREHEADER_BLOCKS (loop_outer (current_loop_nest),