CbC/CbC_gcc: gcc/sched-int.h comparison

comparison gcc/sched-int.h @ 111:04ced10e8804

gcc 7

author	kono
date	Fri, 27 Oct 2017 22:46:09 +0900
parents	f6334be47118
children	84e7813d76e9

comparison

equal deleted inserted replaced

-:561a7518be6b
+:04ced10e8804
 /* Instruction scheduling pass.  This file contains definitions used
 internally in the scheduler.
-Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
+Copyright (C) 1992-2017 Free Software Foundation, Inc.
-2001, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
-Free Software Foundation, Inc.
 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
 #ifndef GCC_SCHED_INT_H
 #define GCC_SCHED_INT_H
 #ifdef INSN_SCHEDULING
-/* For state_t.  */
-#include "insn-attr.h"
-#include "df.h"
-#include "basic-block.h"
-/* For VEC (int, heap).  */
-#include "vecprim.h"
 /* Identificator of a scheduler pass.  */
 enum sched_pass_id_t { SCHED_PASS_UNKNOWN, SCHED_RGN_PASS, SCHED_EBB_PASS,
 		       SCHED_SMS_PASS, SCHED_SEL_PASS };
-typedef VEC (basic_block, heap) *bb_vec_t;
+/* The algorithm used to implement -fsched-pressure.  */
-typedef VEC (rtx, heap) *insn_vec_t;
+enum sched_pressure_algorithm
-typedef VEC(rtx, heap) *rtx_vec_t;
+{
+SCHED_PRESSURE_NONE,
-struct sched_scan_info_def
+SCHED_PRESSURE_WEIGHTED,
-{
+SCHED_PRESSURE_MODEL
-/* This hook notifies scheduler frontend to extend its internal per basic
+};
-block data structures.  This hook should be called once before a series of
-calls to bb_init ().  */
+typedef vec<basic_block> bb_vec_t;
-void (*extend_bb) (void);
+typedef vec<rtx_insn *> insn_vec_t;
+typedef vec<rtx_insn *> rtx_vec_t;
-/* This hook makes scheduler frontend to initialize its internal data
-structures for the passed basic block.  */
-void (*init_bb) (basic_block);
-/* This hook notifies scheduler frontend to extend its internal per insn data
-structures.  This hook should be called once before a series of calls to
-insn_init ().  */
-void (*extend_insn) (void);
-/* This hook makes scheduler frontend to initialize its internal data
-structures for the passed insn.  */
-void (*init_insn) (rtx);
-};
-extern const struct sched_scan_info_def *sched_scan_info;
-extern void sched_scan (const struct sched_scan_info_def *,
-			bb_vec_t, basic_block, insn_vec_t, rtx);
 extern void sched_init_bbs (void);
-extern void sched_init_luids (bb_vec_t, basic_block, insn_vec_t, rtx);
+extern void sched_extend_luids (void);
+extern void sched_init_insn_luid (rtx_insn *);
+extern void sched_init_luids (bb_vec_t);
 extern void sched_finish_luids (void);
 extern void sched_extend_target (void);
-extern void haifa_init_h_i_d (bb_vec_t, basic_block, insn_vec_t, rtx);
+extern void haifa_init_h_i_d (bb_vec_t);
 extern void haifa_finish_h_i_d (void);
 /* Hooks that are common to all the schedulers.  */
 struct common_sched_info_def
 {
 void (*fix_recovery_cfg) (int, int, int);
 /* Called to notify frontend, that new basic block is being added.
 The first parameter - new basic block.
 The second parameter - block, after which new basic block is being added,
-or EXIT_BLOCK_PTR, if recovery block is being added,
+or the exit block, if recovery block is being added,
 or NULL, if standalone block is being added.  */
 void (*add_block) (basic_block, basic_block);
 /* Estimate number of insns in the basic block.  */
 int (*estimate_number_of_insns) (basic_block);
 /* Increases effective priority for INSN by AMOUNT.  */
 extern void sel_add_to_insn_priority (rtx, int);
 /* True if during selective scheduling we need to emulate some of haifa
-scheduler behaviour.  */
+scheduler behavior.  */
 extern int sched_emulate_haifa_p;
 /* Mapping from INSN_UID to INSN_LUID.  In the end all other per insn data
 structures should be indexed by luid.  */
-extern VEC (int, heap) *sched_luids;
+extern vec<int> sched_luids;
-#define INSN_LUID(INSN) (VEC_index (int, sched_luids, INSN_UID (INSN)))
+#define INSN_LUID(INSN) (sched_luids[INSN_UID (INSN)])
-#define LUID_BY_UID(UID) (VEC_index (int, sched_luids, UID))
+#define LUID_BY_UID(UID) (sched_luids[UID])
 #define SET_INSN_LUID(INSN, LUID) \
-(VEC_replace (int, sched_luids, INSN_UID (INSN), (LUID)))
+(sched_luids[INSN_UID (INSN)] = (LUID))
 /* The highest INSN_LUID.  */
 extern int sched_max_luid;
 extern int insn_luid (rtx);
 /* This list holds ripped off notes from the current block.  These notes will
 be attached to the beginning of the block when its scheduling is
 finished.  */
-extern rtx note_list;
+extern rtx_insn *note_list;
-extern void remove_notes (rtx, rtx);
+extern void remove_notes (rtx_insn *, rtx_insn *);
-extern rtx restore_other_notes (rtx, basic_block);
+extern rtx_insn *restore_other_notes (rtx_insn *, basic_block);
 extern void sched_insns_init (rtx);
 extern void sched_insns_finish (void);
 extern void *xrecalloc (void *, size_t, size_t, size_t);
-extern rtx bb_note (basic_block);
+extern void reemit_notes (rtx_insn *);
-extern void reemit_notes (rtx);
 /* Functions in haifa-sched.c.  */
 extern int haifa_classify_insn (const_rtx);
 /* Functions in sel-sched-ir.c.  */
 priority.
 N_READY determines how many insns are on the ready list.
 N_DEBUG determines how many debug insns are on the ready list.  */
 struct ready_list
 {
-rtx *vec;
+rtx_insn **vec;
 int veclen;
 int first;
 int n_ready;
 int n_debug;
 };
-extern char *ready_try;
+extern signed char *ready_try;
 extern struct ready_list ready;
 extern int max_issue (struct ready_list *, int, state_t, bool, int *);
-extern void ebb_compute_jump_reg_dependencies (rtx, regset, regset, regset);
+extern void ebb_compute_jump_reg_dependencies (rtx, regset);
 extern edge find_fallthru_edge_from (basic_block);
 extern void (* sched_init_only_bb) (basic_block, basic_block);
 extern basic_block (* sched_split_block) (basic_block, rtx);
 /* Pointer to data describing the current DFA state.  */
 extern state_t curr_state;
 /* Type to represent status of a dependence.  */
-typedef int ds_t;
+typedef unsigned int ds_t;
+#define BITS_PER_DEP_STATUS HOST_BITS_PER_INT
 /* Type to represent weakness of speculative dependence.  */
-typedef int dw_t;
+typedef unsigned int dw_t;
 extern enum reg_note ds_to_dk (ds_t);
 extern ds_t dk_to_ds (enum reg_note);
+/* Describe a dependency that can be broken by making a replacement
+in one of the patterns.  LOC is the location, ORIG and NEWVAL the
+two alternative contents, and INSN the instruction that must be
+changed.  */
+struct dep_replacement
+{
+rtx *loc;
+rtx orig;
+rtx newval;
+rtx_insn *insn;
+};
 /* Information about the dependency.  */
 struct _dep
 {
 /* Producer.  */
-rtx pro;
+rtx_insn *pro;
 /* Consumer.  */
-rtx con;
+rtx_insn *con;
-/* Dependency major type.  This field is superseded by STATUS below.
+/* If nonnull, holds a pointer to information about how to break the
-Though, it is still in place because some targets use it.  */
+dependency by making a replacement in one of the insns.  There is
-enum reg_note type;
+only one such dependency for each insn that must be modified in
+order to break such a dependency.  */
+struct dep_replacement *replace;
 /* Dependency status.  This field holds all dependency types and additional
 information for speculative dependencies.  */
 ds_t status;
-};
+/* Dependency major type.  This field is superseded by STATUS above.
+Though, it is still in place because some targets use it.  */
+ENUM_BITFIELD(reg_note) type:6;
+unsigned nonreg:1;
+unsigned multiple:1;
+/* Cached cost of the dependency.  Make sure to update UNKNOWN_DEP_COST
+when changing the size of this field.  */
+int cost:20;
+};
+#define UNKNOWN_DEP_COST ((int) ((unsigned int) -1 << 19))
 typedef struct _dep dep_def;
 typedef dep_def *dep_t;
 #define DEP_PRO(D) ((D)->pro)
 #define DEP_CON(D) ((D)->con)
 #define DEP_TYPE(D) ((D)->type)
 #define DEP_STATUS(D) ((D)->status)
+#define DEP_COST(D) ((D)->cost)
+#define DEP_NONREG(D) ((D)->nonreg)
+#define DEP_MULTIPLE(D) ((D)->multiple)
+#define DEP_REPLACE(D) ((D)->replace)
 /* Functions to work with dep.  */
-extern void init_dep_1 (dep_t, rtx, rtx, enum reg_note, ds_t);
+extern void init_dep_1 (dep_t, rtx_insn *, rtx_insn *, enum reg_note, ds_t);
-extern void init_dep (dep_t, rtx, rtx, enum reg_note);
+extern void init_dep (dep_t, rtx_insn *, rtx_insn *, enum reg_note);
 extern void sd_debug_dep (dep_t);
 /* Definition of this struct resides below.  */
 struct _dep_node;
 };
 /* Insns which affect pseudo-registers.  */
 struct deps_reg
 {
-rtx uses;
+rtx_insn_list *uses;
-rtx sets;
+rtx_insn_list *sets;
-rtx implicit_sets;
+rtx_insn_list *implicit_sets;
-rtx clobbers;
+rtx_insn_list *control_uses;
+rtx_insn_list *clobbers;
 int uses_length;
 int clobbers_length;
 };
 /* Describe state of dependencies used during sched_analyze phase.  */
 may have multiple memory accesses, and hence needs to be on the list
 once for each memory access.  Add_dependence won't let you add an insn
 to a list more than once.  */
 /* An INSN_LIST containing all insns with pending read operations.  */
-rtx pending_read_insns;
+rtx_insn_list *pending_read_insns;
 /* An EXPR_LIST containing all MEM rtx's which are pending reads.  */
-rtx pending_read_mems;
+rtx_expr_list *pending_read_mems;
 /* An INSN_LIST containing all insns with pending write operations.  */
-rtx pending_write_insns;
+rtx_insn_list *pending_write_insns;
 /* An EXPR_LIST containing all MEM rtx's which are pending writes.  */
-rtx pending_write_mems;
+rtx_expr_list *pending_write_mems;
+/* An INSN_LIST containing all jump insns.  */
+rtx_insn_list *pending_jump_insns;
 /* We must prevent the above lists from ever growing too large since
 the number of dependencies produced is at least O(N*N),
 and execution time is at least O(4*N*N), as a function of the
 length of these pending lists.  */
 int pending_read_list_length;
 /* Indicates the length of the pending_write list.  */
 int pending_write_list_length;
-/* Length of the pending memory flush list. Large functions with no
+/* Length of the pending memory flush list plus the length of the pending
-calls may build up extremely large lists.  */
+jump insn list.  Large functions with no calls may build up extremely
+large lists.  */
 int pending_flush_length;
 /* The last insn upon which all memory references must depend.
 This is an insn which flushed the pending lists, creating a dependency
 between it and all previously pending memory references.  This creates
 This includes all non constant CALL_INSNs.  When we do interprocedural
 alias analysis, this restriction can be relaxed.
 This may also be an INSN that writes memory if the pending lists grow
 too large.  */
-rtx last_pending_memory_flush;
+rtx_insn_list *last_pending_memory_flush;
 /* A list of the last function calls we have seen.  We use a list to
 represent last function calls from multiple predecessor blocks.
 Used to prevent register lifetimes from expanding unnecessarily.  */
-rtx last_function_call;
+rtx_insn_list *last_function_call;
 /* A list of the last function calls that may not return normally
 we have seen.  We use a list to represent last function calls from
 multiple predecessor blocks.  Used to prevent moving trapping insns
 across such calls.  */
-rtx last_function_call_may_noreturn;
+rtx_insn_list *last_function_call_may_noreturn;
 /* A list of insns which use a pseudo register that does not already
 cross a call.  We create dependencies between each of those insn
 and the next call insn, to ensure that they won't cross a call after
 scheduling is done.  */
-rtx sched_before_next_call;
+rtx_insn_list *sched_before_next_call;
+/* Similarly, a list of insns which should not cross a branch.  */
+rtx_insn_list *sched_before_next_jump;
 /* Used to keep post-call pseudo/hard reg movements together with
 the call.  */
 enum post_call_group in_post_call_group_p;
 /* The last debug insn we've seen.  */
-rtx last_debug_insn;
+rtx_insn *last_debug_insn;
+/* The last insn bearing REG_ARGS_SIZE that we've seen.  */
+rtx_insn *last_args_size;
+/* A list of all prologue insns we have seen without intervening epilogue
+insns, and one of all epilogue insns we have seen without intervening
+prologue insns.  This is used to prevent mixing prologue and epilogue
+insns.  See PR78029.  */
+rtx_insn_list *last_prologue;
+rtx_insn_list *last_epilogue;
+/* Whether the last *logue insn was an epilogue insn or a prologue insn
+instead.  */
+bool last_logue_was_epilogue;
 /* The maximum register number for the following arrays.  Before reload
 this is max_reg_num; after reload it is FIRST_PSEUDO_REGISTER.  */
 int max_reg;
 struct deps_reg *reg_last;
 /* Element N is set for each register that has any nonzero element
 in reg_last[N].{uses,sets,clobbers}.  */
 regset_head reg_last_in_use;
-/* Element N is set for each register that is conditionally set.  */
-regset_head reg_conditional_sets;
 /* Shows the last value of reg_pending_barrier associated with the insn.  */
 enum reg_pending_barrier_mode last_reg_pending_barrier;
 /* True when this context should be treated as a readonly by
 /* Add all insns that are initially ready to the ready list.  Called once
 before scheduling a set of insns.  */
 void (*init_ready_list) (void);
 /* Called after taking an insn from the ready list.  Returns nonzero if
 this insn can be scheduled, nonzero if we should silently discard it.  */
-int (*can_schedule_ready_p) (rtx);
+int (*can_schedule_ready_p) (rtx_insn *);
 /* Return nonzero if there are more insns that should be scheduled.  */
 int (*schedule_more_p) (void);
 /* Called after an insn has all its hard dependencies resolved.
 Adjusts status of instruction (which is passed through second parameter)
 to indicate if instruction should be moved to the ready list or the
 queue, or if it should silently discard it (until next resolved
 dependence).  */
-ds_t (*new_ready) (rtx, ds_t);
+ds_t (*new_ready) (rtx_insn *, ds_t);
 /* Compare priority of two insns.  Return a positive number if the second
 insn is to be preferred for scheduling, and a negative one if the first
 is to be preferred.  Zero if they are equally good.  */
-int (*rank) (rtx, rtx);
+int (*rank) (rtx_insn *, rtx_insn *);
 /* Return a string that contains the insn uid and optionally anything else
 necessary to identify this insn in an output.  It's valid to use a
 static buffer for this.  The ALIGNED parameter should cause the string
 to be formatted so that multiple output lines will line up nicely.  */
-const char *(*print_insn) (const_rtx, int);
+const char *(*print_insn) (const rtx_insn *, int);
 /* Return nonzero if an insn should be included in priority
 calculations.  */
-int (*contributes_to_priority) (rtx, rtx);
+int (*contributes_to_priority) (rtx_insn *, rtx_insn *);
 /* Return true if scheduling insn (passed as the parameter) will trigger
 finish of scheduling current block.  */
-bool (*insn_finishes_block_p) (rtx);
+bool (*insn_finishes_block_p) (rtx_insn *);
 /* The boundaries of the set of insns to be scheduled.  */
-rtx prev_head, next_tail;
+rtx_insn *prev_head, *next_tail;
 /* Filled in after the schedule is finished; the first and last scheduled
 insns.  */
-rtx head, tail;
+rtx_insn *head, *tail;
 /* If nonzero, enables an additional sanity check in schedule_block.  */
 unsigned int queue_must_finish_empty:1;
 /* Maximum priority that has been assigned to an insn.  */
 /* Hooks to support speculative scheduling.  */
 /* Called to notify frontend that instruction is being added (second
 parameter == 0) or removed (second parameter == 1).  */
-void (*add_remove_insn) (rtx, int);
+void (*add_remove_insn) (rtx_insn *, int);
-/* Called to notify frontend that instruction is being scheduled.
+/* Called to notify the frontend that instruction INSN is being
-The first parameter - instruction to scheduled, the second parameter -
+scheduled.  */
-last scheduled instruction.  */
+void (*begin_schedule_ready) (rtx_insn *insn);
-void (*begin_schedule_ready) (rtx, rtx);
+/* Called to notify the frontend that an instruction INSN is about to be
+moved to its correct place in the final schedule.  This is done for all
+insns in order of the schedule.  LAST indicates the last scheduled
+instruction.  */
+void (*begin_move_insn) (rtx_insn *insn, rtx_insn *last);
 /* If the second parameter is not NULL, return nonnull value, if the
 basic block should be advanced.
 If the second parameter is NULL, return the next basic block in EBB.
 The first parameter is the current basic block in EBB.  */
-basic_block (*advance_target_bb) (basic_block, rtx);
+basic_block (*advance_target_bb) (basic_block, rtx_insn *);
+/* Allocate memory, store the frontend scheduler state in it, and
+return it.  */
+void *(*save_state) (void);
+/* Restore frontend scheduler state from the argument, and free the
+memory.  */
+void (*restore_state) (void *);
 /* ??? FIXME: should use straight bitfields inside sched_info instead of
 this flag field.  */
 unsigned int flags;
 };
 extern struct haifa_sched_info *current_sched_info;
 /* Do register pressure sensitive insn scheduling if the flag is set
 up.  */
-extern bool sched_pressure_p;
+extern enum sched_pressure_algorithm sched_pressure;
-/* Map regno -> its cover class.  The map defined only when
+/* Map regno -> its pressure class.  The map defined only when
 SCHED_PRESSURE_P is true.  */
-extern enum reg_class *sched_regno_cover_class;
+extern enum reg_class *sched_regno_pressure_class;
 /* Indexed by INSN_UID, the collection of all data associated with
 a single instruction.  */
 struct _haifa_deps_insn_data
 /* A list of scheduled consumers of the instruction.  Links are being moved
 from 'forw_deps' to 'resolved_forw_deps' while scheduling to fasten the
 search in 'forw_deps'.  */
 deps_list_t resolved_forw_deps;
+/* If the insn is conditional (either through COND_EXEC, or because
+it is a conditional branch), this records the condition.  NULL
+for insns that haven't been seen yet or don't have a condition;
+const_true_rtx to mark an insn without a condition, or with a
+condition that has been clobbered by a subsequent insn.  */
+rtx cond;
+/* For a conditional insn, a list of insns that could set the condition
+register.  Used when generating control dependencies.  */
+rtx_insn_list *cond_deps;
+/* True if the condition in 'cond' should be reversed to get the actual
+condition.  */
+unsigned int reverse_cond : 1;
 /* Some insns (e.g. call) are not allowed to move across blocks.  */
 unsigned int cant_move : 1;
 };
 /* Bits used for storing values of the fields in the following
 structure.  */
 #define INCREASE_BITS 8
 /* The structure describes how the corresponding insn increases the
-register pressure for each cover class.  */
+register pressure for each pressure class.  */
 struct reg_pressure_data
 {
 /* Pressure increase for given class because of clobber.  */
 unsigned int clobber_increase : INCREASE_BITS;
 /* Increase in register pressure for given class because of register
 struct reg_use_data
 {
 /* Regno used in the insn.  */
 int regno;
 /* Insn using the regno.  */
-rtx insn;
+rtx_insn *insn;
 /* Cyclic list of elements with the same regno.  */
 struct reg_use_data *next_regno_use;
 /* List of elements with the same insn.  */
 struct reg_use_data *next_insn_use;
 };
 /* The following structure describes used sets of registers by insns.
-Registers are pseudos whose cover class is not NO_REGS or hard
+Registers are pseudos whose pressure class is not NO_REGS or hard
 registers available for allocations.  */
 struct reg_set_data
 {
 /* Regno used in the insn.  */
 int regno;
 rtx insn;
 /* List of elements with the same insn.  */
 struct reg_set_data *next_insn_set;
 };
+enum autopref_multipass_data_status {
+/* Entry is irrelevant for auto-prefetcher.  */
+AUTOPREF_MULTIPASS_DATA_IRRELEVANT = -2,
+/* Entry is uninitialized.  */
+AUTOPREF_MULTIPASS_DATA_UNINITIALIZED = -1,
+/* Entry is relevant for auto-prefetcher and insn can be delayed
+to allow another insn through.  */
+AUTOPREF_MULTIPASS_DATA_NORMAL = 0,
+/* Entry is relevant for auto-prefetcher, but insn should not be
+delayed as that will break scheduling.  */
+AUTOPREF_MULTIPASS_DATA_DONT_DELAY = 1
+};
+/* Data for modeling cache auto-prefetcher.  */
+struct autopref_multipass_data_
+{
+/* Base part of memory address.  */
+rtx base;
+/* Memory offsets from the base.  */
+int offset;
+/* Entry status.  */
+enum autopref_multipass_data_status status;
+};
+typedef struct autopref_multipass_data_ autopref_multipass_data_def;
+typedef autopref_multipass_data_def *autopref_multipass_data_t;
 struct _haifa_insn_data
 {
 /* We can't place 'struct _deps_list' into h_i_d instead of deps_list_t
 because when h_i_d extends, addresses of the deps_list->first
 change without updating deps_list->first->next->prev_nextp.  */
 int luid;
 /* A priority for each insn.  */
 int priority;
+/* The fusion priority for each insn.  */
+int fusion_priority;
 /* The minimum clock tick at which the insn becomes ready.  This is
 used to note timing constraints for the insns in the pending list.  */
 int tick;
+/* For insns that are scheduled at a fixed difference from another,
+this records the tick in which they must be ready.  */
+int exact_tick;
 /* INTER_TICK is used to adjust INSN_TICKs of instructions from the
 subsequent blocks in a region.  */
 int inter_tick;
+/* Used temporarily to estimate an INSN_TICK value for an insn given
+current knowledge.  */
+int tick_estimate;
 /* See comment on QUEUE_INDEX macro in haifa-sched.c.  */
 int queue_index;
 short cost;
+/* '> 0' if priority is valid,
+'== 0' if priority was not yet computed,
+'< 0' if priority in invalid and should be recomputed.  */
+signed char priority_status;
 /* Set if there's DEF-USE dependence between some speculatively
 moved load insn and this one.  */
 unsigned int fed_by_spec_load : 1;
 unsigned int is_load_insn : 1;
+/* Nonzero if this insn has negative-cost forward dependencies against
-/* '> 0' if priority is valid,
+an already scheduled insn.  */
-'== 0' if priority was not yet computed,
+unsigned int feeds_backtrack_insn : 1;
-'< 0' if priority in invalid and should be recomputed.  */
-signed char priority_status;
+/* Nonzero if this insn is a shadow of another, scheduled after a fixed
+delay.  We only emit shadows at the end of a cycle, with no other
+real insns following them.  */
+unsigned int shadow_p : 1;
+/* Used internally in unschedule_insns_until to mark insns that must have
+their TODO_SPEC recomputed.  */
+unsigned int must_recompute_spec : 1;
 /* What speculations are necessary to apply to schedule the instruction.  */
 ds_t todo_spec;
 /* What speculations were already applied.  */
 /* Recovery block for speculation checks.  */
 basic_block recovery_block;
 /* Original pattern of the instruction.  */
 rtx orig_pat;
+/* For insns with DEP_CONTROL dependencies, the predicated pattern if it
+was ever successfully constructed.  */
+rtx predicated_pat;
 /* The following array contains info how the insn increases register
 pressure.  There is an element for each cover class of pseudos
 referenced in insns.  */
 struct reg_pressure_data *reg_pressure;
 /* The following array contains maximal reg pressure between last
 scheduled insn and given insn.  There is an element for each
-cover class of pseudos referenced in insns.  This info updated
+pressure class of pseudos referenced in insns.  This info updated
 after scheduling each insn for each insn between the two
 mentioned insns.  */
 int *max_reg_pressure;
 /* The following list contains info about used pseudos and hard
 registers available for allocation.  */
 registers available for allocation.  */
 struct reg_set_data *reg_set_list;
 /* Info about how scheduling the insn changes cost of register
 pressure excess (between source and target).  */
 int reg_pressure_excess_cost_change;
+int model_index;
+/* Original order of insns in the ready list.  */
+int rfs_debug_orig_order;
+/* The deciding reason for INSN's place in the ready list.  */
+int last_rfs_win;
+/* Two entries for cache auto-prefetcher model: one for mem reads,
+and one for mem writes.  */
+autopref_multipass_data_def autopref_multipass_data[2];
 };
 typedef struct _haifa_insn_data haifa_insn_data_def;
 typedef haifa_insn_data_def *haifa_insn_data_t;
-DEF_VEC_O (haifa_insn_data_def);
-DEF_VEC_ALLOC_O (haifa_insn_data_def, heap);
+extern vec<haifa_insn_data_def> h_i_d;
-extern VEC(haifa_insn_data_def, heap) *h_i_d;
+#define HID(INSN) (&h_i_d[INSN_UID (INSN)])
-#define HID(INSN) (VEC_index (haifa_insn_data_def, h_i_d, INSN_UID (INSN)))
 /* Accessor macros for h_i_d.  There are more in haifa-sched.c and
 sched-rgn.c.  */
 #define INSN_PRIORITY(INSN) (HID (INSN)->priority)
+#define INSN_FUSION_PRIORITY(INSN) (HID (INSN)->fusion_priority)
 #define INSN_REG_PRESSURE(INSN) (HID (INSN)->reg_pressure)
 #define INSN_MAX_REG_PRESSURE(INSN) (HID (INSN)->max_reg_pressure)
 #define INSN_REG_USE_LIST(INSN) (HID (INSN)->reg_use_list)
 #define INSN_REG_SET_LIST(INSN) (HID (INSN)->reg_set_list)
 #define INSN_REG_PRESSURE_EXCESS_COST_CHANGE(INSN) \
 (HID (INSN)->reg_pressure_excess_cost_change)
 #define INSN_PRIORITY_STATUS(INSN) (HID (INSN)->priority_status)
+#define INSN_MODEL_INDEX(INSN) (HID (INSN)->model_index)
+#define INSN_AUTOPREF_MULTIPASS_DATA(INSN) \
+(HID (INSN)->autopref_multipass_data)
 typedef struct _haifa_deps_insn_data haifa_deps_insn_data_def;
 typedef haifa_deps_insn_data_def *haifa_deps_insn_data_t;
-DEF_VEC_O (haifa_deps_insn_data_def);
-DEF_VEC_ALLOC_O (haifa_deps_insn_data_def, heap);
+extern vec<haifa_deps_insn_data_def> h_d_i_d;
-extern VEC(haifa_deps_insn_data_def, heap) *h_d_i_d;
+#define HDID(INSN) (&h_d_i_d[INSN_LUID (INSN)])
-#define HDID(INSN) (VEC_index (haifa_deps_insn_data_def, h_d_i_d,	\
-			       INSN_LUID (INSN)))
 #define INSN_DEP_COUNT(INSN)	(HDID (INSN)->dep_count)
 #define HAS_INTERNAL_DEP(INSN)  (HDID (INSN)->has_internal_dep)
 #define INSN_FORW_DEPS(INSN) (HDID (INSN)->forw_deps)
 #define INSN_RESOLVED_BACK_DEPS(INSN) (HDID (INSN)->resolved_back_deps)
 #define INSN_RESOLVED_FORW_DEPS(INSN) (HDID (INSN)->resolved_forw_deps)
 #define INSN_HARD_BACK_DEPS(INSN) (HDID (INSN)->hard_back_deps)
 #define INSN_SPEC_BACK_DEPS(INSN) (HDID (INSN)->spec_back_deps)
+#define INSN_CACHED_COND(INSN)	(HDID (INSN)->cond)
+#define INSN_REVERSE_COND(INSN) (HDID (INSN)->reverse_cond)
+#define INSN_COND_DEPS(INSN)	(HDID (INSN)->cond_deps)
 #define CANT_MOVE(INSN)	(HDID (INSN)->cant_move)
-#define CANT_MOVE_BY_LUID(LUID)	(VEC_index (haifa_deps_insn_data_def, h_d_i_d, \
+#define CANT_MOVE_BY_LUID(LUID)	(h_d_i_d[LUID].cant_move)
-LUID)->cant_move)
 #define INSN_PRIORITY(INSN)	(HID (INSN)->priority)
 #define INSN_PRIORITY_STATUS(INSN) (HID (INSN)->priority_status)
 #define INSN_PRIORITY_KNOWN(INSN) (INSN_PRIORITY_STATUS (INSN) > 0)
 #define TODO_SPEC(INSN) (HID (INSN)->todo_spec)
 #define DONE_SPEC(INSN) (HID (INSN)->done_spec)
 #define CHECK_SPEC(INSN) (HID (INSN)->check_spec)
 #define RECOVERY_BLOCK(INSN) (HID (INSN)->recovery_block)
 #define ORIG_PAT(INSN) (HID (INSN)->orig_pat)
+#define PREDICATED_PAT(INSN) (HID (INSN)->predicated_pat)
 /* INSN is either a simple or a branchy speculation check.  */
 #define IS_SPECULATION_CHECK_P(INSN) \
 (sel_sched_p () ? sel_insn_is_speculation_check (INSN) : RECOVERY_BLOCK (INSN) != NULL)
 /* INSN is a speculation check that will simply reexecute the speculatively
 scheduled instruction if the speculation fails.  */
 #define IS_SPECULATION_SIMPLE_CHECK_P(INSN) \
-(RECOVERY_BLOCK (INSN) == EXIT_BLOCK_PTR)
+(RECOVERY_BLOCK (INSN) == EXIT_BLOCK_PTR_FOR_FN (cfun))
 /* INSN is a speculation check that will branch to RECOVERY_BLOCK if the
 speculation fails.  Insns in that block will reexecute the speculatively
 scheduled code and then will return immediately after INSN thus preserving
 semantics of the program.  */
 #define IS_SPECULATION_BRANCHY_CHECK_P(INSN) \
-(RECOVERY_BLOCK (INSN) != NULL && RECOVERY_BLOCK (INSN) != EXIT_BLOCK_PTR)
+(RECOVERY_BLOCK (INSN) != NULL             \
+&& RECOVERY_BLOCK (INSN) != EXIT_BLOCK_PTR_FOR_FN (cfun))
-/* Dep status (aka ds_t) of the link encapsulates information, that is needed
-for speculative scheduling.  Namely, it is 4 integers in the range
-[0, MAX_DEP_WEAK] and 3 bits.
+/* Dep status (aka ds_t) of the link encapsulates all information for a given
-The integers correspond to the probability of the dependence to *not*
+dependency, including everything that is needed for speculative scheduling.
-exist, it is the probability, that overcoming of this dependence will
-not be followed by execution of the recovery code.  Nevertheless,
+The lay-out of a ds_t is as follows:
-whatever high the probability of success is, recovery code should still
-be generated to preserve semantics of the program.  To find a way to
+1. Integers corresponding to the probability of the dependence to *not*
-get/set these integers, please refer to the {get, set}_dep_weak ()
+exist.  This is the probability that overcoming this dependence will
-functions in sched-deps.c .
+not be followed by execution of the recovery code.  Note that however
-The 3 bits in the DEP_STATUS correspond to 3 dependence types: true-,
+high this probability is, the recovery code should still always be
-output- and anti- dependence.  It is not enough for speculative scheduling
+generated to preserve semantics of the program.
-to know just the major type of all the dependence between two instructions,
-as only true dependence can be overcome.
+The probability values can be set or retrieved using the functions
-There also is the 4-th bit in the DEP_STATUS (HARD_DEP), that is reserved
+the set_dep_weak() and get_dep_weak() in sched-deps.c.  The values
-for using to describe instruction's status.  It is set whenever instruction
+are always in the range [0, MAX_DEP_WEAK].
-has at least one dependence, that cannot be overcame.
+	BEGIN_DATA	: BITS_PER_DEP_WEAK
+	BE_IN_DATA	: BITS_PER_DEP_WEAK
+	BEGIN_CONTROL	: BITS_PER_DEP_WEAK
+	BE_IN_CONTROL	: BITS_PER_DEP_WEAK
+The basic type of DS_T is a host int.  For a 32-bits int, the values
+will each take 6 bits.
+2. The type of dependence.  This supercedes the old-style REG_NOTE_KIND
+values.  TODO: Use this field instead of DEP_TYPE, or make DEP_TYPE
+extract the dependence type from here.
+	dep_type	:  4 => DEP_{TRUE|OUTPUT|ANTI|CONTROL}
+3. Various flags:
+	HARD_DEP	:  1 =>	Set if an instruction has a non-speculative
+				dependence.  This is an instruction property
+				so this bit can only appear in the TODO_SPEC
+				field of an instruction.
+	DEP_POSTPONED	:  1 =>	Like HARD_DEP, but the hard dependence may
+				still be broken by adjusting the instruction.
+	DEP_CANCELLED	:  1 =>	Set if a dependency has been broken using
+				some form of speculation.
+	RESERVED	:  1 => Reserved for use in the delay slot scheduler.
 See also: check_dep_status () in sched-deps.c .  */
-/* We exclude sign bit.  */
+/* The number of bits per weakness probability.  There are 4 weakness types
-#define BITS_PER_DEP_STATUS (HOST_BITS_PER_INT - 1)
+and we need 8 bits for other data in a DS_T.  */
+#define BITS_PER_DEP_WEAK ((BITS_PER_DEP_STATUS - 8) / 4)
-/* First '4' stands for 3 dep type bits and HARD_DEP bit.
-Second '4' stands for BEGIN_{DATA, CONTROL}, BE_IN_{DATA, CONTROL}
-dep weakness.  */
-#define BITS_PER_DEP_WEAK ((BITS_PER_DEP_STATUS - 4) / 4)
 /* Mask of speculative weakness in dep_status.  */
 #define DEP_WEAK_MASK ((1 << BITS_PER_DEP_WEAK) - 1)
 /* This constant means that dependence is fake with 99.999...% probability.
 bad idea to overcome it (though this can be done, preserving program
 semantics).  */
 #define MIN_DEP_WEAK 1
 /* This constant represents 100% probability.
-E.g. it is used to represent weakness of dependence, that doesn't exist.  */
+E.g. it is used to represent weakness of dependence, that doesn't exist.
+This value never appears in a ds_t, it is only used for computing the
+weakness of a dependence.  */
 #define NO_DEP_WEAK (MAX_DEP_WEAK + MIN_DEP_WEAK)
 /* Default weakness of speculative dependence.  Used when we can't say
 neither bad nor good about the dependence.  */
 #define UNCERTAIN_DEP_WEAK (MAX_DEP_WEAK - MAX_DEP_WEAK / 4)
 BE_IN_DATA_BITS_OFFSET = BEGIN_DATA_BITS_OFFSET + BITS_PER_DEP_WEAK,
 BEGIN_CONTROL_BITS_OFFSET = BE_IN_DATA_BITS_OFFSET + BITS_PER_DEP_WEAK,
 BE_IN_CONTROL_BITS_OFFSET = BEGIN_CONTROL_BITS_OFFSET + BITS_PER_DEP_WEAK
 };
-/* The following defines provide numerous constants used to distinguish between
+/* The following defines provide numerous constants used to distinguish
-different types of speculative dependencies.  */
+between different types of speculative dependencies.  They are also
+used as masks to clear/preserve the bits corresponding to the type
+of dependency weakness.  */
 /* Dependence can be overcome with generation of new data speculative
 instruction.  */
 #define BEGIN_DATA (((ds_t) DEP_WEAK_MASK) << BEGIN_DATA_BITS_OFFSET)
 (e.g. true and output). This fields enhance REG_NOTE_KIND information
 of the dependence.  */
 #define DEP_TRUE (((ds_t) 1) << (BE_IN_CONTROL_BITS_OFFSET + BITS_PER_DEP_WEAK))
 #define DEP_OUTPUT (DEP_TRUE << 1)
 #define DEP_ANTI (DEP_OUTPUT << 1)
+#define DEP_CONTROL (DEP_ANTI << 1)
-#define DEP_TYPES (DEP_TRUE | DEP_OUTPUT | DEP_ANTI)
+#define DEP_TYPES (DEP_TRUE | DEP_OUTPUT | DEP_ANTI | DEP_CONTROL)
 /* Instruction has non-speculative dependence.  This bit represents the
 property of an instruction - not the one of a dependence.
-Therefore, it can appear only in TODO_SPEC field of an instruction.  */
+Therefore, it can appear only in the TODO_SPEC field of an instruction.  */
-#define HARD_DEP (DEP_ANTI << 1)
+#define HARD_DEP (DEP_CONTROL << 1)
+/* Like HARD_DEP, but dependencies can perhaps be broken by modifying
+the instructions.  This is used for example to change:
+rn++		=>	rm=[rn + 4]
+rm=[rn]		rn++
+For instructions that have this bit set, one of the dependencies of
+the instructions will have a non-NULL REPLACE field in its DEP_T.
+Just like HARD_DEP, this bit is only ever set in TODO_SPEC.  */
+#define DEP_POSTPONED (HARD_DEP << 1)
+/* Set if a dependency is cancelled via speculation.  */
+#define DEP_CANCELLED (DEP_POSTPONED << 1)
 /* This represents the results of calling sched-deps.c functions,
 which modify dependencies.  */
 enum DEPS_ADJUST_RESULT {
 /* No dependence needed (e.g. producer == consumer).  */
 DEP_NODEP,
 USE_DEPS_LIST = 1,
 /* Perform data or control (or both) speculation.
 Results in generation of data and control speculative dependencies.
 Requires USE_DEPS_LIST set.  */
 DO_SPECULATION = USE_DEPS_LIST << 1,
-SCHED_RGN = DO_SPECULATION << 1,
+DO_BACKTRACKING = DO_SPECULATION << 1,
+DO_PREDICATION = DO_BACKTRACKING << 1,
+DONT_BREAK_DEPENDENCIES = DO_PREDICATION << 1,
+SCHED_RGN = DONT_BREAK_DEPENDENCIES << 1,
 SCHED_EBB = SCHED_RGN << 1,
 /* Scheduler can possibly create new basic blocks.  Used for assertions.  */
 NEW_BBS = SCHED_EBB << 1,
 SEL_SCHED = NEW_BBS << 1
 };
 enum SPEC_SCHED_FLAGS {
 COUNT_SPEC_IN_CRITICAL_PATH = 1,
-PREFER_NON_DATA_SPEC = COUNT_SPEC_IN_CRITICAL_PATH << 1,
+SEL_SCHED_SPEC_DONT_CHECK_CONTROL = COUNT_SPEC_IN_CRITICAL_PATH << 1
-PREFER_NON_CONTROL_SPEC = PREFER_NON_DATA_SPEC << 1,
-SEL_SCHED_SPEC_DONT_CHECK_CONTROL = PREFER_NON_CONTROL_SPEC << 1
 };
 #define NOTE_NOT_BB_P(NOTE) (NOTE_P (NOTE) && (NOTE_KIND (NOTE)	\
 					       != NOTE_INSN_BASIC_BLOCK))
 struct sched_deps_info_def
 {
 /* Called when computing dependencies for a JUMP_INSN.  This function
 should store the set of registers that must be considered as set by
 the jump in the regset.  */
-void (*compute_jump_reg_dependencies) (rtx, regset, regset, regset);
+void (*compute_jump_reg_dependencies) (rtx, regset);
 /* Start analyzing insn.  */
-void (*start_insn) (rtx);
+void (*start_insn) (rtx_insn *);
 /* Finish analyzing insn.  */
 void (*finish_insn) (void);
 /* Start analyzing insn LHS (Left Hand Side).  */
 /* Note use of the register.  */
 void (*note_reg_use) (int);
 /* Note memory dependence of type DS between MEM1 and MEM2 (which is
 in the INSN2).  */
-void (*note_mem_dep) (rtx mem1, rtx mem2, rtx insn2, ds_t ds);
+void (*note_mem_dep) (rtx mem1, rtx mem2, rtx_insn *insn2, ds_t ds);
 /* Note a dependence of type DS from the INSN.  */
-void (*note_dep) (rtx insn, ds_t ds);
+void (*note_dep) (rtx_insn *, ds_t ds);
 /* Nonzero if we should use cselib for better alias analysis.  This
 must be 0 if the dependency information is used after sched_analyze
 has completed, e.g. if we're using it to initialize state for successor
 blocks in region scheduling.  */
 extern struct sched_deps_info_def *sched_deps_info;
 /* Functions in sched-deps.c.  */
-extern bool sched_insns_conditions_mutex_p (const_rtx, const_rtx);
+extern rtx sched_get_reverse_condition_uncached (const rtx_insn *);
-extern bool sched_insn_is_legitimate_for_speculation_p (const_rtx, ds_t);
+extern bool sched_insns_conditions_mutex_p (const rtx_insn *,
-extern void add_dependence (rtx, rtx, enum reg_note);
+					    const rtx_insn *);
-extern void sched_analyze (struct deps_desc *, rtx, rtx);
+extern bool sched_insn_is_legitimate_for_speculation_p (const rtx_insn *, ds_t);
+extern void add_dependence (rtx_insn *, rtx_insn *, enum reg_note);
+extern void sched_analyze (struct deps_desc *, rtx_insn *, rtx_insn *);
 extern void init_deps (struct deps_desc *, bool);
 extern void init_deps_reg_last (struct deps_desc *);
 extern void free_deps (struct deps_desc *);
 extern void init_deps_global (void);
 extern void finish_deps_global (void);
-extern void deps_analyze_insn (struct deps_desc *, rtx);
+extern void deps_analyze_insn (struct deps_desc *, rtx_insn *);
-extern void remove_from_deps (struct deps_desc *, rtx);
+extern void remove_from_deps (struct deps_desc *, rtx_insn *);
+extern void init_insn_reg_pressure_info (rtx_insn *);
-extern dw_t get_dep_weak_1 (ds_t, ds_t);
+extern void get_implicit_reg_pending_clobbers (HARD_REG_SET *, rtx_insn *);
 extern dw_t get_dep_weak (ds_t, ds_t);
 extern ds_t set_dep_weak (ds_t, ds_t, dw_t);
 extern dw_t estimate_dep_weak (rtx, rtx);
 extern ds_t ds_merge (ds_t, ds_t);
 extern ds_t ds_full_merge (ds_t, ds_t, rtx, rtx);
 extern void haifa_note_reg_clobber (int);
 extern void haifa_note_reg_use (int);
 extern void maybe_extend_reg_info_p (void);
-extern void deps_start_bb (struct deps_desc *, rtx);
+extern void deps_start_bb (struct deps_desc *, rtx_insn *);
 extern enum reg_note ds_to_dt (ds_t);
 extern bool deps_pools_are_empty_p (void);
-extern void sched_free_deps (rtx, rtx, bool);
+extern void sched_free_deps (rtx_insn *, rtx_insn *, bool);
 extern void extend_dependency_caches (int, bool);
 extern void debug_ds (ds_t);
 /* Functions in haifa-sched.c.  */
+extern void initialize_live_range_shrinkage (void);
+extern void finish_live_range_shrinkage (void);
 extern void sched_init_region_reg_pressure_info (void);
+extern void free_global_sched_pressure_data (void);
 extern int haifa_classify_insn (const_rtx);
-extern void get_ebb_head_tail (basic_block, basic_block, rtx *, rtx *);
+extern void get_ebb_head_tail (basic_block, basic_block,
-extern int no_real_insns_p (const_rtx, const_rtx);
+			       rtx_insn **, rtx_insn **);
+extern int no_real_insns_p (const rtx_insn *, const rtx_insn *);
-extern int insn_cost (rtx);
+extern int insn_sched_cost (rtx_insn *);
 extern int dep_cost_1 (dep_t, dw_t);
 extern int dep_cost (dep_t);
-extern int set_priorities (rtx, rtx);
+extern int set_priorities (rtx_insn *, rtx_insn *);
-extern void sched_setup_bb_reg_pressure_info (basic_block, rtx);
+extern void sched_setup_bb_reg_pressure_info (basic_block, rtx_insn *);
-extern void schedule_block (basic_block *);
+extern bool schedule_block (basic_block *, state_t);
 extern int cycle_issued_insns;
 extern int issue_rate;
 extern int dfa_lookahead;
-extern void ready_sort (struct ready_list *);
+extern int autopref_multipass_dfa_lookahead_guard (rtx_insn *, int);
-extern rtx ready_element (struct ready_list *, int);
-extern rtx *ready_lastpos (struct ready_list *);
+extern rtx_insn *ready_element (struct ready_list *, int);
+extern rtx_insn **ready_lastpos (struct ready_list *);
-extern int try_ready (rtx);
+extern int try_ready (rtx_insn *);
 extern void sched_extend_ready_list (int);
 extern void sched_finish_ready_list (void);
 extern void sched_change_pattern (rtx, rtx);
-extern int sched_speculate_insn (rtx, ds_t, rtx *);
+extern int sched_speculate_insn (rtx_insn *, ds_t, rtx *);
 extern void unlink_bb_notes (basic_block, basic_block);
 extern void add_block (basic_block, basic_block);
-extern rtx bb_note (basic_block);
+extern rtx_note *bb_note (basic_block);
-extern void concat_note_lists (rtx, rtx *);
+extern void concat_note_lists (rtx_insn *, rtx_insn **);
-extern rtx sched_emit_insn (rtx);
+extern rtx_insn *sched_emit_insn (rtx);
-extern rtx get_ready_element (int);
+extern rtx_insn *get_ready_element (int);
 extern int number_in_ready (void);
+/* Types and functions in sched-ebb.c.  */
+extern basic_block schedule_ebb (rtx_insn *, rtx_insn *, bool);
+extern void schedule_ebbs_init (void);
+extern void schedule_ebbs_finish (void);
 /* Types and functions in sched-rgn.c.  */
 /* A region is the main entity for interblock scheduling: insns
 are allowed to move between blocks in the same region, along
 control flow graph edges, in the 'up' direction.  */
-typedef struct
+struct region
 {
 /* Number of extended basic blocks in region.  */
 int rgn_nr_blocks;
 /* cblocks in the region (actually index in rgn_bb_table).  */
 int rgn_blocks;
 /* Dependencies for this region are already computed.  Basically, indicates,
 that this is a recovery block.  */
 unsigned int dont_calc_deps : 1;
 /* This region has at least one non-trivial ebb.  */
 unsigned int has_real_ebb : 1;
-}
+};
-region;
 extern int nr_regions;
 extern region *rgn_table;
 extern int *rgn_bb_table;
 extern int *block_to_bb;
 #define CONTAINING_RGN(block) (containing_rgn[block])
 /* The mapping from ebb to block.  */
 extern int *ebb_head;
 #define BB_TO_BLOCK(ebb) (rgn_bb_table[ebb_head[ebb]])
-#define EBB_FIRST_BB(ebb) BASIC_BLOCK (BB_TO_BLOCK (ebb))
+#define EBB_FIRST_BB(ebb) BASIC_BLOCK_FOR_FN (cfun, BB_TO_BLOCK (ebb))
-#define EBB_LAST_BB(ebb) BASIC_BLOCK (rgn_bb_table[ebb_head[ebb + 1] - 1])
+#define EBB_LAST_BB(ebb) \
+BASIC_BLOCK_FOR_FN (cfun, rgn_bb_table[ebb_head[ebb + 1] - 1])
 #define INSN_BB(INSN) (BLOCK_TO_BB (BLOCK_NUM (INSN)))
 extern int current_nr_blocks;
 extern int current_blocks;
 extern int target_bb;
+extern bool sched_no_dce;
+extern void set_modulo_params (int, int, int, int);
+extern void record_delay_slot_pair (rtx_insn *, rtx_insn *, int, int);
+extern rtx_insn *real_insn_for_shadow (rtx_insn *);
+extern void discard_delay_pairs_above (int);
+extern void free_delay_pairs (void);
+extern void add_delay_dependencies (rtx_insn *);
 extern bool sched_is_disabled_for_current_region_p (void);
 extern void sched_rgn_init (bool);
 extern void sched_rgn_finish (void);
 extern void rgn_setup_region (int);
 extern void sched_rgn_compute_dependencies (int);
 extern void sched_rgn_local_free (void);
 extern void extend_regions (void);
 extern void rgn_make_new_region_out_of_new_block (basic_block);
 extern void compute_priorities (void);
-extern void increase_insn_priority (rtx, int);
+extern void increase_insn_priority (rtx_insn *, int);
 extern void debug_rgn_dependencies (int);
-extern void debug_dependencies (rtx, rtx);
+extern void debug_dependencies (rtx_insn *, rtx_insn *);
+extern void dump_rgn_dependencies_dot (FILE *);
+extern void dump_rgn_dependencies_dot (const char *);
 extern void free_rgn_deps (void);
-extern int contributes_to_priority (rtx, rtx);
+extern int contributes_to_priority (rtx_insn *, rtx_insn *);
 extern void extend_rgns (int *, int *, sbitmap, int *);
 extern void deps_join (struct deps_desc *, struct deps_desc *);
 extern void rgn_setup_common_sched_info (void);
 extern void rgn_setup_sched_infos (void);
 extern void dump_region_dot (FILE *, int);
 extern void dump_region_dot_file (const char *, int);
 extern void haifa_sched_init (void);
 extern void haifa_sched_finish (void);
+extern void find_modifiable_mems (rtx_insn *, rtx_insn *);
 /* sched-deps.c interface to walk, add, search, update, resolve, delete
 and debug instruction dependencies.  */
 /* Constants defining dependences lists.  */
 /* Return the current element.  */
 static inline bool
 sd_iterator_cond (sd_iterator_def *it_ptr, dep_t *dep_ptr)
 {
-dep_link_t link = *it_ptr->linkp;
+while (true)
-if (link != NULL)
 {
-*dep_ptr = DEP_LINK_DEP (link);
+dep_link_t link = *it_ptr->linkp;
-return true;
-}
+if (link != NULL)
-else
-{
-sd_list_types_def types = it_ptr->types;
-if (types != SD_LIST_NONE)
-	/* Switch to next list.  */
 	{
-	  deps_list_t list;
+	  *dep_ptr = DEP_LINK_DEP (link);
+	  return true;
-	  sd_next_list (it_ptr->insn,
-			&it_ptr->types, &list, &it_ptr->resolved_p);
-	  it_ptr->linkp = &DEPS_LIST_FIRST (list);
-	  if (list)
-	    return sd_iterator_cond (it_ptr, dep_ptr);
 	}
+else
-*dep_ptr = NULL;
+	{
-return false;
+	  sd_list_types_def types = it_ptr->types;
-}
+	  if (types != SD_LIST_NONE)
+	    /* Switch to next list.  */
+	    {
+	      deps_list_t list;
+	      sd_next_list (it_ptr->insn,
+			    &it_ptr->types, &list, &it_ptr->resolved_p);
+	      if (list)
+		{
+		  it_ptr->linkp = &DEPS_LIST_FIRST (list);
+		  continue;
+		}
+	    }
+	  *dep_ptr = NULL;
+	  return false;
+	}
+}
 }
 /* Advance iterator.  */
 static inline void
 sd_iterator_next (sd_iterator_def *it_ptr)
 #define DISPATCH_INIT 5
 #define ADD_TO_DISPATCH_WINDOW 6
 extern int sd_lists_size (const_rtx, sd_list_types_def);
 extern bool sd_lists_empty_p (const_rtx, sd_list_types_def);
-extern void sd_init_insn (rtx);
+extern void sd_init_insn (rtx_insn *);
-extern void sd_finish_insn (rtx);
+extern void sd_finish_insn (rtx_insn *);
 extern dep_t sd_find_dep_between (rtx, rtx, bool);
 extern void sd_add_dep (dep_t, bool);
 extern enum DEPS_ADJUST_RESULT sd_add_or_update_dep (dep_t, bool);
 extern void sd_resolve_dep (sd_iterator_def);
-extern void sd_copy_back_deps (rtx, rtx, bool);
+extern void sd_unresolve_dep (sd_iterator_def);
+extern void sd_copy_back_deps (rtx_insn *, rtx_insn *, bool);
 extern void sd_delete_dep (sd_iterator_def);
 extern void sd_debug_lists (rtx, sd_list_types_def);
+/* Macros and declarations for scheduling fusion.  */
+#define FUSION_MAX_PRIORITY (INT_MAX)
+extern bool sched_fusion;
 #endif /* INSN_SCHEDULING */
-/* Functions in sched-vis.c.  These must be outside INSN_SCHEDULING as
-sched-vis.c is compiled always.  */
-extern void print_insn (char *, const_rtx, int);
-extern void print_pattern (char *, const_rtx, int);
-extern void print_value (char *, const_rtx, int);
 #endif /* GCC_SCHED_INT_H */

Mercurial > hg > CbC > CbC_gcc

comparison gcc/sched-int.h @ 111:04ced10e8804