X-Git-Url: http://git.sourceforge.jp/view?p=pf3gnuchains%2Fgcc-fork.git;a=blobdiff_plain;f=gcc%2Fsched-ebb.c;h=cae9f70417844743ba942c8450716d84cf328075;hp=5f1464b9c147b510dbe3f48661be6e2462dd2e3c;hb=190437a65276c9433a1ad61b5343655c665c9ddc;hpb=40734805198ef874623eb7be9ec3de9251c799b7 diff --git a/gcc/sched-ebb.c b/gcc/sched-ebb.c index 5f1464b9c14..cae9f704178 100644 --- a/gcc/sched-ebb.c +++ b/gcc/sched-ebb.c @@ -1,6 +1,7 @@ /* Instruction scheduling pass. - Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, - 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, + 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 + Free Software Foundation, Inc. Contributed by Michael Tiemann (tiemann@cygnus.com) Enhanced by, and currently maintained by, Jim Wilson (wilson@cygnus.com) @@ -8,7 +9,7 @@ This file is part of GCC. GCC is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free -Software Foundation; either version 2, or (at your option) any later +Software Foundation; either version 3, or (at your option) any later version. GCC is distributed in the hope that it will be useful, but WITHOUT ANY @@ -17,109 +18,198 @@ FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License -along with GCC; see the file COPYING. If not, write to the Free -Software Foundation, 59 Temple Place - Suite 330, Boston, MA -02111-1307, USA. */ +along with GCC; see the file COPYING3. If not see +. */ #include "config.h" #include "system.h" -#include "toplev.h" +#include "coretypes.h" +#include "tm.h" +#include "diagnostic-core.h" #include "rtl.h" #include "tm_p.h" #include "hard-reg-set.h" -#include "basic-block.h" #include "regs.h" #include "function.h" #include "flags.h" #include "insn-config.h" #include "insn-attr.h" #include "except.h" -#include "toplev.h" #include "recog.h" #include "cfglayout.h" +#include "params.h" #include "sched-int.h" +#include "target.h" +#include "output.h" + +#ifdef INSN_SCHEDULING + /* The number of insns to be scheduled in total. */ -static int target_n_insns; +static int rgn_n_insns; + /* The number of insns scheduled so far. */ -static int sched_n_insns; +static int sched_rgn_n_insns; + +/* Set of blocks, that already have their dependencies calculated. */ +static bitmap_head dont_calc_deps; + +/* Last basic block in current ebb. */ +static basic_block last_bb; /* Implementations of the sched_info functions for region scheduling. */ -static void init_ready_list PARAMS ((struct ready_list *)); -static int can_schedule_ready_p PARAMS ((rtx)); -static int new_ready PARAMS ((rtx)); -static int schedule_more_p PARAMS ((void)); -static const char *ebb_print_insn PARAMS ((rtx, int)); -static int rank PARAMS ((rtx, rtx)); -static int contributes_to_priority PARAMS ((rtx, rtx)); -static void compute_jump_reg_dependencies PARAMS ((rtx, regset)); -static void schedule_ebb PARAMS ((rtx, rtx)); +static void init_ready_list (void); +static void begin_schedule_ready (rtx); +static int schedule_more_p (void); +static const char *ebb_print_insn (const_rtx, int); +static int rank (rtx, rtx); +static int ebb_contributes_to_priority (rtx, rtx); +static basic_block earliest_block_with_similiar_load (basic_block, rtx); +static void add_deps_for_risky_insns (rtx, rtx); +static void debug_ebb_dependencies (rtx, rtx); + +static void ebb_add_remove_insn (rtx, int); +static void ebb_add_block (basic_block, basic_block); +static basic_block advance_target_bb (basic_block, rtx); +static void ebb_fix_recovery_cfg (int, int, int); + +/* Allocate memory and store the state of the frontend. Return the allocated + memory. */ +static void * +save_ebb_state (void) +{ + int *p = XNEW (int); + *p = sched_rgn_n_insns; + return p; +} + +/* Restore the state of the frontend from P_, then free it. */ +static void +restore_ebb_state (void *p_) +{ + int *p = (int *)p_; + sched_rgn_n_insns = *p; + free (p_); +} /* Return nonzero if there are more insns that should be scheduled. */ static int -schedule_more_p () +schedule_more_p (void) { - return sched_n_insns < target_n_insns; + return sched_rgn_n_insns < rgn_n_insns; +} + +/* Print dependency information about ebb between HEAD and TAIL. */ +static void +debug_ebb_dependencies (rtx head, rtx tail) +{ + fprintf (sched_dump, + ";; --------------- forward dependences: ------------ \n"); + + fprintf (sched_dump, "\n;; --- EBB Dependences --- from bb%d to bb%d \n", + BLOCK_NUM (head), BLOCK_NUM (tail)); + + debug_dependencies (head, tail); } /* Add all insns that are initially ready to the ready list READY. Called once before scheduling a set of insns. */ static void -init_ready_list (ready) - struct ready_list *ready; +init_ready_list (void) { + int n = 0; rtx prev_head = current_sched_info->prev_head; rtx next_tail = current_sched_info->next_tail; rtx insn; - target_n_insns = 0; - sched_n_insns = 0; + sched_rgn_n_insns = 0; -#if 0 /* Print debugging information. */ if (sched_verbose >= 5) - debug_dependencies (); -#endif + debug_ebb_dependencies (NEXT_INSN (prev_head), PREV_INSN (next_tail)); /* Initialize ready list with all 'ready' insns in target block. Count number of insns in the target block being scheduled. */ for (insn = NEXT_INSN (prev_head); insn != next_tail; insn = NEXT_INSN (insn)) { - rtx next; - - if (! INSN_P (insn)) - continue; - next = NEXT_INSN (insn); - - if (INSN_DEP_COUNT (insn) == 0 - && (SCHED_GROUP_P (next) == 0 || ! INSN_P (next))) - ready_add (ready, insn); - if (!(SCHED_GROUP_P (insn))) - target_n_insns++; + try_ready (insn); + n++; } -} -/* Called after taking INSN from the ready list. Returns nonzero if this - insn can be scheduled, nonzero if we should silently discard it. */ + gcc_assert (n == rgn_n_insns); +} -static int -can_schedule_ready_p (insn) - rtx insn ATTRIBUTE_UNUSED; +/* INSN is being scheduled after LAST. Update counters. */ +static void +begin_schedule_ready (rtx insn ATTRIBUTE_UNUSED) { - sched_n_insns++; - return 1; + sched_rgn_n_insns++; } -/* Called after INSN has all its dependencies resolved. Return nonzero - if it should be moved to the ready list or the queue, or zero if we - should silently discard it. */ -static int -new_ready (next) - rtx next ATTRIBUTE_UNUSED; +/* INSN is being moved to its place in the schedule, after LAST. */ +static void +begin_move_insn (rtx insn, rtx last) { - return 1; + if (BLOCK_FOR_INSN (insn) == last_bb + /* INSN is a jump in the last block, ... */ + && control_flow_insn_p (insn) + /* that is going to be moved over some instructions. */ + && last != PREV_INSN (insn)) + { + edge e; + basic_block bb; + + /* An obscure special case, where we do have partially dead + instruction scheduled after last control flow instruction. + In this case we can create new basic block. It is + always exactly one basic block last in the sequence. */ + + e = find_fallthru_edge (last_bb->succs); + + gcc_checking_assert (!e || !(e->flags & EDGE_COMPLEX)); + + gcc_checking_assert (BLOCK_FOR_INSN (insn) == last_bb + && !IS_SPECULATION_CHECK_P (insn) + && BB_HEAD (last_bb) != insn + && BB_END (last_bb) == insn); + + { + rtx x; + + x = NEXT_INSN (insn); + if (e) + gcc_checking_assert (NOTE_P (x) || LABEL_P (x)); + else + gcc_checking_assert (BARRIER_P (x)); + } + + if (e) + { + bb = split_edge (e); + gcc_assert (NOTE_INSN_BASIC_BLOCK_P (BB_END (bb))); + } + else + { + /* Create an empty unreachable block after the INSN. */ + rtx next = NEXT_INSN (insn); + if (next && BARRIER_P (next)) + next = NEXT_INSN (next); + bb = create_basic_block (next, NULL_RTX, last_bb); + } + + /* split_edge () creates BB before E->DEST. Keep in mind, that + this operation extends scheduling region till the end of BB. + Hence, we need to shift NEXT_TAIL, so haifa-sched.c won't go out + of the scheduling region. */ + current_sched_info->next_tail = NEXT_INSN (BB_END (bb)); + gcc_assert (current_sched_info->next_tail); + + /* Append new basic block to the end of the ebb. */ + sched_init_only_bb (bb, last_bb); + gcc_assert (last_bb == bb); + } } /* Return a string that contains the insn uid and optionally anything else @@ -128,13 +218,16 @@ new_ready (next) to be formatted so that multiple output lines will line up nicely. */ static const char * -ebb_print_insn (insn, aligned) - rtx insn; - int aligned ATTRIBUTE_UNUSED; +ebb_print_insn (const_rtx insn, int aligned ATTRIBUTE_UNUSED) { static char tmp[80]; - sprintf (tmp, "%4d", INSN_UID (insn)); + /* '+' before insn means it is a new cycle start. */ + if (GET_MODE (insn) == TImode) + sprintf (tmp, "+ %4d", INSN_UID (insn)); + else + sprintf (tmp, " %4d", INSN_UID (insn)); + return tmp; } @@ -143,9 +236,17 @@ ebb_print_insn (insn, aligned) is to be preferred. Zero if they are equally good. */ static int -rank (insn1, insn2) - rtx insn1 ATTRIBUTE_UNUSED, insn2 ATTRIBUTE_UNUSED; +rank (rtx insn1, rtx insn2) { + basic_block bb1 = BLOCK_FOR_INSN (insn1); + basic_block bb2 = BLOCK_FOR_INSN (insn2); + + if (bb1->count > bb2->count + || bb1->frequency > bb2->frequency) + return -1; + if (bb1->count < bb2->count + || bb1->frequency < bb2->frequency) + return 1; return 0; } @@ -154,209 +255,493 @@ rank (insn1, insn2) calculations. */ static int -contributes_to_priority (next, insn) - rtx next ATTRIBUTE_UNUSED, insn ATTRIBUTE_UNUSED; +ebb_contributes_to_priority (rtx next ATTRIBUTE_UNUSED, + rtx insn ATTRIBUTE_UNUSED) { return 1; } -/* INSN is a JUMP_INSN. Store the set of registers that must be considered - to be set by this jump in SET. */ + /* INSN is a JUMP_INSN. Store the set of registers that + must be considered as used by this jump in USED. */ -static void -compute_jump_reg_dependencies (insn, set) - rtx insn; - regset set; +void +ebb_compute_jump_reg_dependencies (rtx insn, regset used) { basic_block b = BLOCK_FOR_INSN (insn); edge e; - for (e = b->succ; e; e = e->succ_next) + edge_iterator ei; + + FOR_EACH_EDGE (e, ei, b->succs) if ((e->flags & EDGE_FALLTHRU) == 0) - { - bitmap_operation (set, set, e->dest->global_live_at_start, - BITMAP_IOR); - } + bitmap_ior_into (used, df_get_live_in (e->dest)); } /* Used in schedule_insns to initialize current_sched_info for scheduling regions (or single basic blocks). */ -static struct sched_info ebb_sched_info = +static struct common_sched_info_def ebb_common_sched_info; + +static struct sched_deps_info_def ebb_sched_deps_info = + { + ebb_compute_jump_reg_dependencies, + NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, + NULL, + 1, 0, 0 + }; + +static struct haifa_sched_info ebb_sched_info = { init_ready_list, - can_schedule_ready_p, + NULL, schedule_more_p, - new_ready, + NULL, rank, ebb_print_insn, - contributes_to_priority, - compute_jump_reg_dependencies, + ebb_contributes_to_priority, + NULL, /* insn_finishes_block_p */ NULL, NULL, NULL, NULL, - 0, 1 + 1, 0, + + ebb_add_remove_insn, + begin_schedule_ready, + begin_move_insn, + advance_target_bb, + + save_ebb_state, + restore_ebb_state, + + SCHED_EBB + /* We can create new blocks in begin_schedule_ready (). */ + | NEW_BBS }; -/* Schedule a single extended basic block, defined by the boundaries HEAD - and TAIL. */ +/* Returns the earliest block in EBB currently being processed where a + "similar load" 'insn2' is found, and hence LOAD_INSN can move + speculatively into the found block. All the following must hold: + + (1) both loads have 1 base register (PFREE_CANDIDATEs). + (2) load_insn and load2 have a def-use dependence upon + the same insn 'insn1'. + + From all these we can conclude that the two loads access memory + addresses that differ at most by a constant, and hence if moving + load_insn would cause an exception, it would have been caused by + load2 anyhow. + + The function uses list (given by LAST_BLOCK) of already processed + blocks in EBB. The list is formed in `add_deps_for_risky_insns'. */ + +static basic_block +earliest_block_with_similiar_load (basic_block last_block, rtx load_insn) +{ + sd_iterator_def back_sd_it; + dep_t back_dep; + basic_block bb, earliest_block = NULL; + + FOR_EACH_DEP (load_insn, SD_LIST_BACK, back_sd_it, back_dep) + { + rtx insn1 = DEP_PRO (back_dep); + + if (DEP_TYPE (back_dep) == REG_DEP_TRUE) + /* Found a DEF-USE dependence (insn1, load_insn). */ + { + sd_iterator_def fore_sd_it; + dep_t fore_dep; + + FOR_EACH_DEP (insn1, SD_LIST_FORW, fore_sd_it, fore_dep) + { + rtx insn2 = DEP_CON (fore_dep); + basic_block insn2_block = BLOCK_FOR_INSN (insn2); + + if (DEP_TYPE (fore_dep) == REG_DEP_TRUE) + { + if (earliest_block != NULL + && earliest_block->index < insn2_block->index) + continue; + + /* Found a DEF-USE dependence (insn1, insn2). */ + if (haifa_classify_insn (insn2) != PFREE_CANDIDATE) + /* insn2 not guaranteed to be a 1 base reg load. */ + continue; + + for (bb = last_block; bb; bb = (basic_block) bb->aux) + if (insn2_block == bb) + break; + + if (!bb) + /* insn2 is the similar load. */ + earliest_block = insn2_block; + } + } + } + } + + return earliest_block; +} + +/* The following function adds dependencies between jumps and risky + insns in given ebb. */ static void -schedule_ebb (head, tail) - rtx head, tail; +add_deps_for_risky_insns (rtx head, rtx tail) +{ + rtx insn, prev; + int classification; + rtx last_jump = NULL_RTX; + rtx next_tail = NEXT_INSN (tail); + basic_block last_block = NULL, bb; + + for (insn = head; insn != next_tail; insn = NEXT_INSN (insn)) + { + add_delay_dependencies (insn); + if (control_flow_insn_p (insn)) + { + bb = BLOCK_FOR_INSN (insn); + bb->aux = last_block; + last_block = bb; + /* Ensure blocks stay in the same order. */ + if (last_jump) + add_dependence (insn, last_jump, REG_DEP_ANTI); + last_jump = insn; + } + else if (INSN_P (insn) && last_jump != NULL_RTX) + { + classification = haifa_classify_insn (insn); + prev = last_jump; + + switch (classification) + { + case PFREE_CANDIDATE: + if (flag_schedule_speculative_load) + { + bb = earliest_block_with_similiar_load (last_block, insn); + if (bb) + { + bb = (basic_block) bb->aux; + if (!bb) + break; + prev = BB_END (bb); + } + } + /* Fall through. */ + case TRAP_RISKY: + case IRISKY: + case PRISKY_CANDIDATE: + /* ??? We could implement better checking PRISKY_CANDIDATEs + analogous to sched-rgn.c. */ + /* We can not change the mode of the backward + dependency because REG_DEP_ANTI has the lowest + rank. */ + if (! sched_insns_conditions_mutex_p (insn, prev)) + { + if ((current_sched_info->flags & DO_SPECULATION) + && (spec_info->mask & BEGIN_CONTROL)) + { + dep_def _dep, *dep = &_dep; + + init_dep (dep, prev, insn, REG_DEP_ANTI); + + if (current_sched_info->flags & USE_DEPS_LIST) + { + DEP_STATUS (dep) = set_dep_weak (DEP_ANTI, BEGIN_CONTROL, + MAX_DEP_WEAK); + + } + sd_add_or_update_dep (dep, false); + } + else + add_dependence (insn, prev, REG_DEP_CONTROL); + } + + break; + + default: + break; + } + } + } + /* Maintain the invariant that bb->aux is clear after use. */ + while (last_block) + { + bb = (basic_block) last_block->aux; + last_block->aux = NULL; + last_block = bb; + } +} + +/* Schedule a single extended basic block, defined by the boundaries + HEAD and TAIL. + + We change our expectations about scheduler behaviour depending on + whether MODULO_SCHEDULING is true. If it is, we expect that the + caller has already called set_modulo_params and created delay pairs + as appropriate. If the modulo schedule failed, we return + NULL_RTX. */ + +basic_block +schedule_ebb (rtx head, rtx tail, bool modulo_scheduling) { - int n_insns; - struct deps tmp_deps; + basic_block first_bb, target_bb; + struct deps_desc tmp_deps; + bool success; + + /* Blah. We should fix the rest of the code not to get confused by + a note or two. */ + while (head != tail) + { + if (NOTE_P (head) || DEBUG_INSN_P (head)) + head = NEXT_INSN (head); + else if (NOTE_P (tail) || DEBUG_INSN_P (tail)) + tail = PREV_INSN (tail); + else if (LABEL_P (head)) + head = NEXT_INSN (head); + else + break; + } + + first_bb = BLOCK_FOR_INSN (head); + last_bb = BLOCK_FOR_INSN (tail); if (no_real_insns_p (head, tail)) - return; + return BLOCK_FOR_INSN (tail); + + gcc_assert (INSN_P (head) && INSN_P (tail)); + + if (!bitmap_bit_p (&dont_calc_deps, first_bb->index)) + { + init_deps_global (); - init_deps_global (); + /* Compute dependencies. */ + init_deps (&tmp_deps, false); + sched_analyze (&tmp_deps, head, tail); + free_deps (&tmp_deps); - /* Compute LOG_LINKS. */ - init_deps (&tmp_deps); - sched_analyze (&tmp_deps, head, tail); - free_deps (&tmp_deps); + add_deps_for_risky_insns (head, tail); - /* Compute INSN_DEPEND. */ - compute_forward_dependences (head, tail); + if (targetm.sched.dependencies_evaluation_hook) + targetm.sched.dependencies_evaluation_hook (head, tail); + + finish_deps_global (); + } + else + /* Only recovery blocks can have their dependencies already calculated, + and they always are single block ebbs. */ + gcc_assert (first_bb == last_bb); /* Set priorities. */ - n_insns = set_priorities (head, tail); + current_sched_info->sched_max_insns_priority = 0; + rgn_n_insns = set_priorities (head, tail); + current_sched_info->sched_max_insns_priority++; current_sched_info->prev_head = PREV_INSN (head); current_sched_info->next_tail = NEXT_INSN (tail); - if (write_symbols != NO_DEBUG) - { - save_line_notes (0, head, tail); - rm_line_notes (head, tail); - } + remove_notes (head, tail); + + unlink_bb_notes (first_bb, last_bb); + + target_bb = first_bb; + + /* Make ready list big enough to hold all the instructions from the ebb. */ + sched_extend_ready_list (rgn_n_insns); + success = schedule_block (&target_bb); + gcc_assert (success || modulo_scheduling); + + /* Free ready list. */ + sched_finish_ready_list (); + + /* We might pack all instructions into fewer blocks, + so we may made some of them empty. Can't assert (b == last_bb). */ + + /* Sanity check: verify that all region insns were scheduled. */ + gcc_assert (modulo_scheduling || sched_rgn_n_insns == rgn_n_insns); - /* rm_other_notes only removes notes which are _inside_ the - block---that is, it won't remove notes before the first real insn - or after the last real insn of the block. So if the first insn - has a REG_SAVE_NOTE which would otherwise be emitted before the - insn, it is redundant with the note before the start of the - block, and so we have to take it out. */ - if (INSN_P (head)) + /* Free dependencies. */ + sched_free_deps (current_sched_info->head, current_sched_info->tail, true); + + gcc_assert (haifa_recovery_bb_ever_added_p + || deps_pools_are_empty_p ()); + + if (EDGE_COUNT (last_bb->preds) == 0) + /* LAST_BB is unreachable. */ { - rtx note; - - for (note = REG_NOTES (head); note; note = XEXP (note, 1)) - if (REG_NOTE_KIND (note) == REG_SAVE_NOTE) - { - remove_note (head, note); - note = XEXP (note, 1); - remove_note (head, note); - } + gcc_assert (first_bb != last_bb + && EDGE_COUNT (last_bb->succs) == 0); + last_bb = last_bb->prev_bb; + delete_basic_block (last_bb->next_bb); } - /* Remove remaining note insns from the block, save them in - note_list. These notes are restored at the end of - schedule_block (). */ - rm_other_notes (head, tail); + return success ? last_bb : NULL; +} - current_sched_info->queue_must_finish_empty = 1; +/* Perform initializations before running schedule_ebbs or a single + schedule_ebb. */ +void +schedule_ebbs_init (void) +{ + /* Setup infos. */ + { + memcpy (&ebb_common_sched_info, &haifa_common_sched_info, + sizeof (ebb_common_sched_info)); - schedule_block (-1, n_insns); + ebb_common_sched_info.fix_recovery_cfg = ebb_fix_recovery_cfg; + ebb_common_sched_info.add_block = ebb_add_block; + ebb_common_sched_info.sched_pass_id = SCHED_EBB_PASS; - /* Sanity check: verify that all region insns were scheduled. */ - if (sched_n_insns != n_insns) - abort (); - head = current_sched_info->head; - tail = current_sched_info->tail; + common_sched_info = &ebb_common_sched_info; + sched_deps_info = &ebb_sched_deps_info; + current_sched_info = &ebb_sched_info; + } - if (write_symbols != NO_DEBUG) - restore_line_notes (head, tail); + haifa_sched_init (); - finish_deps_global (); + compute_bb_for_insn (); + + /* Initialize DONT_CALC_DEPS and ebb-{start, end} markers. */ + bitmap_initialize (&dont_calc_deps, 0); + bitmap_clear (&dont_calc_deps); } -/* The one entry point in this file. DUMP_FILE is the dump file for - this pass. */ +/* Perform cleanups after scheduling using schedules_ebbs or schedule_ebb. */ +void +schedule_ebbs_finish (void) +{ + bitmap_clear (&dont_calc_deps); + + /* Reposition the prologue and epilogue notes in case we moved the + prologue/epilogue insns. */ + if (reload_completed) + reposition_prologue_and_epilogue_notes (); + + haifa_sched_finish (); +} + +/* The main entry point in this file. */ void -schedule_ebbs (dump_file) - FILE *dump_file; +schedule_ebbs (void) { - int i; + basic_block bb; + int probability_cutoff; + rtx tail; /* Taking care of this degenerate case makes the rest of this code simpler. */ - if (n_basic_blocks == 0) + if (n_basic_blocks == NUM_FIXED_BLOCKS) return; - scope_to_insns_initialize (); - - sched_init (dump_file); + if (profile_info && flag_branch_probabilities) + probability_cutoff = PARAM_VALUE (TRACER_MIN_BRANCH_PROBABILITY_FEEDBACK); + else + probability_cutoff = PARAM_VALUE (TRACER_MIN_BRANCH_PROBABILITY); + probability_cutoff = REG_BR_PROB_BASE / 100 * probability_cutoff; - current_sched_info = &ebb_sched_info; - - allocate_reg_life_data (); - compute_bb_for_insn (get_max_uid ()); + schedule_ebbs_init (); /* Schedule every region in the subroutine. */ - for (i = 0; i < n_basic_blocks; i++) + FOR_EACH_BB (bb) { - rtx head = BASIC_BLOCK (i)->head; - rtx tail; + rtx head = BB_HEAD (bb); + + if (bb->flags & BB_DISABLE_SCHEDULE) + continue; for (;;) { - basic_block b = BASIC_BLOCK (i); edge e; - tail = b->end; - if (i + 1 == n_basic_blocks - || GET_CODE (BLOCK_HEAD (i + 1)) == CODE_LABEL) + tail = BB_END (bb); + if (bb->next_bb == EXIT_BLOCK_PTR + || LABEL_P (BB_HEAD (bb->next_bb))) break; - for (e = b->succ; e; e = e->succ_next) - if ((e->flags & EDGE_FALLTHRU) != 0) - break; + e = find_fallthru_edge (bb->succs); if (! e) break; - if (GET_CODE (tail) == JUMP_INSN) - { - rtx x = find_reg_note (tail, REG_BR_PROB, 0); - if (x) - { - int pred_val = INTVAL (XEXP (x, 0)); - if (pred_val > REG_BR_PROB_BASE / 2) - break; - } - } - - i++; - } - - /* Blah. We should fix the rest of the code not to get confused by - a note or two. */ - while (head != tail) - { - if (GET_CODE (head) == NOTE) - head = NEXT_INSN (head); - else if (GET_CODE (tail) == NOTE) - tail = PREV_INSN (tail); - else if (GET_CODE (head) == CODE_LABEL) - head = NEXT_INSN (head); - else + if (e->probability <= probability_cutoff) break; + if (e->dest->flags & BB_DISABLE_SCHEDULE) + break; + bb = bb->next_bb; } - schedule_ebb (head, tail); + bb = schedule_ebb (head, tail, false); } + schedule_ebbs_finish (); +} - /* It doesn't make much sense to try and update life information here - we - probably messed up even the flow graph. */ +/* INSN has been added to/removed from current ebb. */ +static void +ebb_add_remove_insn (rtx insn ATTRIBUTE_UNUSED, int remove_p) +{ + if (!remove_p) + rgn_n_insns++; + else + rgn_n_insns--; +} - /* Reposition the prologue and epilogue notes in case we moved the - prologue/epilogue insns. */ - if (reload_completed) - reposition_prologue_and_epilogue_notes (get_insns ()); +/* BB was added to ebb after AFTER. */ +static void +ebb_add_block (basic_block bb, basic_block after) +{ + /* Recovery blocks are always bounded by BARRIERS, + therefore, they always form single block EBB, + therefore, we can use rec->index to identify such EBBs. */ + if (after == EXIT_BLOCK_PTR) + bitmap_set_bit (&dont_calc_deps, bb->index); + else if (after == last_bb) + last_bb = bb; +} - if (write_symbols != NO_DEBUG) - rm_redundant_line_notes (); +/* Return next block in ebb chain. For parameter meaning please refer to + sched-int.h: struct sched_info: advance_target_bb. */ +static basic_block +advance_target_bb (basic_block bb, rtx insn) +{ + if (insn) + { + if (BLOCK_FOR_INSN (insn) != bb + && control_flow_insn_p (insn) + /* We handle interblock movement of the speculation check + or over a speculation check in + haifa-sched.c: move_block_after_check (). */ + && !IS_SPECULATION_BRANCHY_CHECK_P (insn) + && !IS_SPECULATION_BRANCHY_CHECK_P (BB_END (bb))) + { + /* Assert that we don't move jumps across blocks. */ + gcc_assert (!control_flow_insn_p (BB_END (bb)) + && NOTE_INSN_BASIC_BLOCK_P (BB_HEAD (bb->next_bb))); + return bb; + } + else + return 0; + } + else + /* Return next non empty block. */ + { + do + { + gcc_assert (bb != last_bb); + + bb = bb->next_bb; + } + while (bb_note (bb) == BB_END (bb)); + + return bb; + } +} - scope_to_insns_finalize (); +/* Fix internal data after interblock movement of jump instruction. + For parameter meaning please refer to + sched-int.h: struct sched_info: fix_recovery_cfg. */ +static void +ebb_fix_recovery_cfg (int bbi ATTRIBUTE_UNUSED, int jump_bbi, + int jump_bb_nexti) +{ + gcc_assert (last_bb->index != bbi); - sched_finish (); + if (jump_bb_nexti == last_bb->index) + last_bb = BASIC_BLOCK (jump_bbi); } + +#endif /* INSN_SCHEDULING */