Subversion Repositories openrisc_me

/* Instruction scheduling pass.  This file contains definitions used

   internally in the scheduler.

   Copyright (C) 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

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

WARRANTY; without even the implied warranty of MERCHANTABILITY or

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 COPYING3.  If not see

<http://www.gnu.org/licenses/>.  */

#ifndef GCC_SEL_SCHED_IR_H

#define GCC_SEL_SCHED_IR_H

/* For state_t.  */

#include "insn-attr.h"

/* For regset_head.  */

#include "basic-block.h"

/* For reg_note.  */

#include "rtl.h"

#include "ggc.h"

#include "bitmap.h"

#include "vecprim.h"

#include "sched-int.h"

#include "cfgloop.h"

/* tc_t is a short for target context.  This is a state of the target

   backend.  */

typedef void *tc_t;

/* List data types used for av sets, fences, paths, and boundaries.  */

/* Forward declarations for types that are part of some list nodes.  */

struct _list_node;

/* List backend.  */

typedef struct _list_node *_list_t;

#define _LIST_NEXT(L) ((L)->next)

/* Instruction data that is part of vinsn type.  */

struct idata_def;

typedef struct idata_def *idata_t;

/* A virtual instruction, i.e. an instruction as seen by the scheduler.  */

struct vinsn_def;

typedef struct vinsn_def *vinsn_t;

/* RTX list.

   This type is the backend for ilist.  */

typedef _list_t _xlist_t;

#define _XLIST_X(L) ((L)->u.x)

#define _XLIST_NEXT(L) (_LIST_NEXT (L))

/* Instruction.  */

typedef rtx insn_t;

/* List of insns.  */

typedef _xlist_t ilist_t;

#define ILIST_INSN(L) (_XLIST_X (L))

#define ILIST_NEXT(L) (_XLIST_NEXT (L))

/* This lists possible transformations that done locally, i.e. in

   moveup_expr.  */

enum local_trans_type

  {

    TRANS_SUBSTITUTION,

    TRANS_SPECULATION

  };

/* This struct is used to record the history of expression's

   transformations.  */

struct expr_history_def_1

{

  /* UID of the insn.  */

  unsigned uid;

  /* How the expression looked like.  */

  vinsn_t old_expr_vinsn;

  /* How the expression looks after the transformation.  */

  vinsn_t new_expr_vinsn;

  /* And its speculative status.  */

  ds_t spec_ds;

  /* Type of the transformation.  */

  enum local_trans_type type;

};

typedef struct expr_history_def_1 expr_history_def;

DEF_VEC_O (expr_history_def);

DEF_VEC_ALLOC_O (expr_history_def, heap);

/* Expression information.  */

struct _expr

{

  /* Insn description.  */

  vinsn_t vinsn;

  /* SPEC is the degree of speculativeness.

     FIXME: now spec is increased when an rhs is moved through a

     conditional, thus showing only control speculativeness.  In the

     future we'd like to count data spec separately to allow a better

     control on scheduling.  */

  int spec;

  /* Degree of speculativeness measured as probability of executing

     instruction's original basic block given relative to

     the current scheduling point.  */

  int usefulness;

  /* A priority of this expression.  */

  int priority;

  /* A priority adjustment of this expression.  */

  int priority_adj;

  /* Number of times the insn was scheduled.  */

  int sched_times;

  /* A basic block index this was originated from.  Zero when there is

     more than one originator.  */

  int orig_bb_index;

  /* Instruction should be of SPEC_DONE_DS type in order to be moved to this

     point.  */

  ds_t spec_done_ds;

  /* SPEC_TO_CHECK_DS hold speculation types that should be checked

     (used only during move_op ()).  */

  ds_t spec_to_check_ds;

  /* Cycle on which original insn was scheduled.  Zero when it has not yet

     been scheduled or more than one originator.  */

  int orig_sched_cycle;

  /* This vector contains the history of insn's transformations.  */

  VEC(expr_history_def, heap) *history_of_changes;

  /* True (1) when original target (register or memory) of this instruction

     is available for scheduling, false otherwise.  -1 means we're not sure;

     please run find_used_regs to clarify.  */

  signed char target_available;

  /* True when this expression needs a speculation check to be scheduled.

     This is used during find_used_regs.  */

  BOOL_BITFIELD needs_spec_check_p : 1;

  /* True when the expression was substituted.  Used for statistical

     purposes.  */

  BOOL_BITFIELD was_substituted : 1;

  /* True when the expression was renamed.  */

  BOOL_BITFIELD was_renamed : 1;

  /* True when expression can't be moved.  */

  BOOL_BITFIELD cant_move : 1;

};

typedef struct _expr expr_def;

typedef expr_def *expr_t;

#define EXPR_VINSN(EXPR) ((EXPR)->vinsn)

#define EXPR_INSN_RTX(EXPR) (VINSN_INSN_RTX (EXPR_VINSN (EXPR)))

#define EXPR_PATTERN(EXPR) (VINSN_PATTERN (EXPR_VINSN (EXPR)))

#define EXPR_LHS(EXPR) (VINSN_LHS (EXPR_VINSN (EXPR)))

#define EXPR_RHS(EXPR) (VINSN_RHS (EXPR_VINSN (EXPR)))

#define EXPR_TYPE(EXPR) (VINSN_TYPE (EXPR_VINSN (EXPR)))

#define EXPR_SEPARABLE_P(EXPR) (VINSN_SEPARABLE_P (EXPR_VINSN (EXPR)))

#define EXPR_SPEC(EXPR) ((EXPR)->spec)

#define EXPR_USEFULNESS(EXPR) ((EXPR)->usefulness)

#define EXPR_PRIORITY(EXPR) ((EXPR)->priority)

#define EXPR_PRIORITY_ADJ(EXPR) ((EXPR)->priority_adj)

#define EXPR_SCHED_TIMES(EXPR) ((EXPR)->sched_times)

#define EXPR_ORIG_BB_INDEX(EXPR) ((EXPR)->orig_bb_index)

#define EXPR_ORIG_SCHED_CYCLE(EXPR) ((EXPR)->orig_sched_cycle)

#define EXPR_SPEC_DONE_DS(EXPR) ((EXPR)->spec_done_ds)

#define EXPR_SPEC_TO_CHECK_DS(EXPR) ((EXPR)->spec_to_check_ds)

#define EXPR_HISTORY_OF_CHANGES(EXPR) ((EXPR)->history_of_changes)

#define EXPR_TARGET_AVAILABLE(EXPR) ((EXPR)->target_available)

#define EXPR_NEEDS_SPEC_CHECK_P(EXPR) ((EXPR)->needs_spec_check_p)

#define EXPR_WAS_SUBSTITUTED(EXPR) ((EXPR)->was_substituted)

#define EXPR_WAS_RENAMED(EXPR) ((EXPR)->was_renamed)

#define EXPR_CANT_MOVE(EXPR) ((EXPR)->cant_move)

#define EXPR_WAS_CHANGED(EXPR) (VEC_length (expr_history_def, \

                                            EXPR_HISTORY_OF_CHANGES (EXPR)) > 0)

/* Insn definition for list of original insns in find_used_regs.  */

struct _def

{

  insn_t orig_insn;

  /* FIXME: Get rid of CROSSES_CALL in each def, since if we're moving up

     rhs from two different places, but only one of the code motion paths

     crosses a call, we can't use any of the call_used_regs, no matter which

     path or whether all paths crosses a call.  Thus we should move CROSSES_CALL

     to static params.  */

  bool crosses_call;

};

typedef struct _def *def_t;

/* Availability sets are sets of expressions we're scheduling.  */

typedef _list_t av_set_t;

#define _AV_SET_EXPR(L) (&(L)->u.expr)

#define _AV_SET_NEXT(L) (_LIST_NEXT (L))

/* Boundary of the current fence group.  */

struct _bnd

{

  /* The actual boundary instruction.  */

  insn_t to;

  /* Its path to the fence.  */

  ilist_t ptr;

  /* Availability set at the boundary.  */

  av_set_t av;

  /* This set moved to the fence.  */

  av_set_t av1;

  /* Deps context at this boundary.  As long as we have one boundary per fence,

     this is just a pointer to the same deps context as in the corresponding

     fence.  */

  deps_t dc;

};

typedef struct _bnd *bnd_t;

#define BND_TO(B) ((B)->to)

/* PTR stands not for pointer as you might think, but as a Path To Root of the

   current instruction group from boundary B.  */

#define BND_PTR(B) ((B)->ptr)

#define BND_AV(B) ((B)->av)

#define BND_AV1(B) ((B)->av1)

#define BND_DC(B) ((B)->dc)

/* List of boundaries.  */

typedef _list_t blist_t;

#define BLIST_BND(L) (&(L)->u.bnd)

#define BLIST_NEXT(L) (_LIST_NEXT (L))

/* Fence information.  A fence represents current scheduling point and also

   blocks code motion through it when pipelining.  */

struct _fence

{

  /* Insn before which we gather an instruction group.*/

  insn_t insn;

  /* Modeled state of the processor pipeline.  */

  state_t state;

  /* Current cycle that is being scheduled on this fence.  */

  int cycle;

  /* Number of insns that were scheduled on the current cycle.

     This information has to be local to a fence.  */

  int cycle_issued_insns;

  /* At the end of fill_insns () this field holds the list of the instructions

     that are inner boundaries of the scheduled parallel group.  */

  ilist_t bnds;

  /* Deps context at this fence.  It is used to model dependencies at the

     fence so that insn ticks can be properly evaluated.  */

  deps_t dc;

  /* Target context at this fence.  Used to save and load any local target

     scheduling information when changing fences.  */

  tc_t tc;

  /* A vector of insns that are scheduled but not yet completed.  */

  VEC (rtx,gc) *executing_insns;

  /* A vector indexed by UIDs that caches the earliest cycle on which

     an insn can be scheduled on this fence.  */

  int *ready_ticks;

  /* Its size.  */

  int ready_ticks_size;

  /* Insn, which has been scheduled last on this fence.  */

  rtx last_scheduled_insn;

  /* The last value of can_issue_more variable on this fence.  */

  int issue_more;

  /* If non-NULL force the next scheduled insn to be SCHED_NEXT.  */

  rtx sched_next;

  /* True if fill_insns processed this fence.  */

  BOOL_BITFIELD processed_p : 1;

  /* True if fill_insns actually scheduled something on this fence.  */

  BOOL_BITFIELD scheduled_p : 1;

  /* True when the next insn scheduled here would start a cycle.  */

  BOOL_BITFIELD starts_cycle_p : 1;

  /* True when the next insn scheduled here would be scheduled after a stall.  */

  BOOL_BITFIELD after_stall_p : 1;

};

typedef struct _fence *fence_t;

#define FENCE_INSN(F) ((F)->insn)

#define FENCE_STATE(F) ((F)->state)

#define FENCE_BNDS(F) ((F)->bnds)

#define FENCE_PROCESSED_P(F) ((F)->processed_p)

#define FENCE_SCHEDULED_P(F) ((F)->scheduled_p)

#define FENCE_ISSUED_INSNS(F) ((F)->cycle_issued_insns)

#define FENCE_CYCLE(F) ((F)->cycle)

#define FENCE_STARTS_CYCLE_P(F) ((F)->starts_cycle_p)

#define FENCE_AFTER_STALL_P(F) ((F)->after_stall_p)

#define FENCE_DC(F) ((F)->dc)

#define FENCE_TC(F) ((F)->tc)

#define FENCE_LAST_SCHEDULED_INSN(F) ((F)->last_scheduled_insn)

#define FENCE_ISSUE_MORE(F) ((F)->issue_more)

#define FENCE_EXECUTING_INSNS(F) ((F)->executing_insns)

#define FENCE_READY_TICKS(F) ((F)->ready_ticks)

#define FENCE_READY_TICKS_SIZE(F) ((F)->ready_ticks_size)

#define FENCE_SCHED_NEXT(F) ((F)->sched_next)

/* List of fences.  */

typedef _list_t flist_t;

#define FLIST_FENCE(L) (&(L)->u.fence)

#define FLIST_NEXT(L) (_LIST_NEXT (L))

/* List of fences with pointer to the tail node.  */

struct flist_tail_def

{

  flist_t head;

  flist_t *tailp;

};

typedef struct flist_tail_def *flist_tail_t;

#define FLIST_TAIL_HEAD(L) ((L)->head)

#define FLIST_TAIL_TAILP(L) ((L)->tailp)

/* List node information.  A list node can be any of the types above.  */

struct _list_node

{

  _list_t next;

  union

  {

    rtx x;

    struct _bnd bnd;

    expr_def expr;

    struct _fence fence;

    struct _def def;

    void *data;

  } u;

};

/* _list_t functions.

   All of _*list_* functions are used through accessor macros, thus

   we can't move them in sel-sched-ir.c.  */

extern alloc_pool sched_lists_pool;

static inline _list_t

_list_alloc (void)

{

  return (_list_t) pool_alloc (sched_lists_pool);

}

static inline void

_list_add (_list_t *lp)

{

  _list_t l = _list_alloc ();

  _LIST_NEXT (l) = *lp;

  *lp = l;

}

static inline void

_list_remove_nofree (_list_t *lp)

{

  _list_t n = *lp;

  *lp = _LIST_NEXT (n);

}

static inline void

_list_remove (_list_t *lp)

{

  _list_t n = *lp;

  *lp = _LIST_NEXT (n);

  pool_free (sched_lists_pool, n);

}

static inline void

_list_clear (_list_t *l)

{

  while (*l)

    _list_remove (l);

}

/* List iterator backend.  */

typedef struct

{

  /* The list we're iterating.  */

  _list_t *lp;

  /* True when this iterator supprts removing.  */

  bool can_remove_p;

  /* True when we've actually removed something.  */

  bool removed_p;

} _list_iterator;

static inline void

_list_iter_start (_list_iterator *ip, _list_t *lp, bool can_remove_p)

{

  ip->lp = lp;

  ip->can_remove_p = can_remove_p;

  ip->removed_p = false;

}

static inline void

_list_iter_next (_list_iterator *ip)

{

  if (!ip->removed_p)

    ip->lp = &_LIST_NEXT (*ip->lp);

  else

    ip->removed_p = false;

}

static inline void

_list_iter_remove (_list_iterator *ip)

{

  gcc_assert (!ip->removed_p && ip->can_remove_p);

  _list_remove (ip->lp);

  ip->removed_p = true;

}

static inline void

_list_iter_remove_nofree (_list_iterator *ip)

{

  gcc_assert (!ip->removed_p && ip->can_remove_p);

  _list_remove_nofree (ip->lp);

  ip->removed_p = true;

}

/* General macros to traverse a list.  FOR_EACH_* interfaces are

   implemented using these.  */

#define _FOR_EACH(TYPE, ELEM, I, L)                             \

  for (_list_iter_start (&(I), &(L), false);                    \

       _list_iter_cond_##TYPE (*(I).lp, &(ELEM));               \

       _list_iter_next (&(I)))

#define _FOR_EACH_1(TYPE, ELEM, I, LP)                              \

  for (_list_iter_start (&(I), (LP), true);                         \

       _list_iter_cond_##TYPE (*(I).lp, &(ELEM));                   \

       _list_iter_next (&(I)))

/* _xlist_t functions.  */

static inline void

_xlist_add (_xlist_t *lp, rtx x)

{

  _list_add (lp);

  _XLIST_X (*lp) = x;

}

#define _xlist_remove(LP) (_list_remove (LP))

#define _xlist_clear(LP) (_list_clear (LP))

static inline bool

_xlist_is_in_p (_xlist_t l, rtx x)

{

  while (l)

    {

      if (_XLIST_X (l) == x)

        return true;

      l = _XLIST_NEXT (l);

    }

  return false;

}

/* Used through _FOR_EACH.  */

static inline bool

_list_iter_cond_x (_xlist_t l, rtx *xp)

{

  if (l)

    {

      *xp = _XLIST_X (l);

      return true;

    }

  return false;

}

#define _xlist_iter_remove(IP) (_list_iter_remove (IP))

typedef _list_iterator _xlist_iterator;

#define _FOR_EACH_X(X, I, L) _FOR_EACH (x, (X), (I), (L))

#define _FOR_EACH_X_1(X, I, LP) _FOR_EACH_1 (x, (X), (I), (LP))

/* ilist_t functions.  Instruction lists are simply RTX lists.  */

#define ilist_add(LP, INSN) (_xlist_add ((LP), (INSN)))

#define ilist_remove(LP) (_xlist_remove (LP))

#define ilist_clear(LP) (_xlist_clear (LP))

#define ilist_is_in_p(L, INSN) (_xlist_is_in_p ((L), (INSN)))

#define ilist_iter_remove(IP) (_xlist_iter_remove (IP))

typedef _xlist_iterator ilist_iterator;

#define FOR_EACH_INSN(INSN, I, L) _FOR_EACH_X (INSN, I, L)

#define FOR_EACH_INSN_1(INSN, I, LP) _FOR_EACH_X_1 (INSN, I, LP)

/* Av set iterators.  */

typedef _list_iterator av_set_iterator;

#define FOR_EACH_EXPR(EXPR, I, AV) _FOR_EACH (expr, (EXPR), (I), (AV))

#define FOR_EACH_EXPR_1(EXPR, I, AV) _FOR_EACH_1 (expr, (EXPR), (I), (AV))

static bool

_list_iter_cond_expr (av_set_t av, expr_t *exprp)

{

  if (av)

    {

      *exprp = _AV_SET_EXPR (av);

      return true;

    }

  return false;

}

/* Def list iterators.  */

typedef _list_t def_list_t;

typedef _list_iterator def_list_iterator;

#define DEF_LIST_NEXT(L) (_LIST_NEXT (L))

#define DEF_LIST_DEF(L) (&(L)->u.def)

#define FOR_EACH_DEF(DEF, I, DEF_LIST) _FOR_EACH (def, (DEF), (I), (DEF_LIST))

static inline bool

_list_iter_cond_def (def_list_t def_list, def_t *def)

{

  if (def_list)

    {

      *def = DEF_LIST_DEF (def_list);

      return true;

    }

  return false;

}

/* InstructionData.  Contains information about insn pattern.  */

struct idata_def

{

  /* Type of the insn.

     o CALL_INSN - Call insn

     o JUMP_INSN - Jump insn

     o INSN - INSN that cannot be cloned

     o USE - INSN that can be cloned

     o SET - INSN that can be cloned and separable into lhs and rhs

     o PC - simplejump.  Insns that simply redirect control flow should not

     have any dependencies.  Sched-deps.c, though, might consider them as

     producers or consumers of certain registers.  To avoid that we handle

     dependency for simple jumps ourselves.  */

  int type;

  /* If insn is a SET, this is its left hand side.  */

  rtx lhs;

  /* If insn is a SET, this is its right hand side.  */

  rtx rhs;

  /* Registers that are set/used by this insn.  This info is now gathered

     via sched-deps.c.  The downside of this is that we also use live info

     from flow that is accumulated in the basic blocks.  These two infos

     can be slightly inconsistent, hence in the beginning we make a pass

     through CFG and calculating the conservative solution for the info in

     basic blocks.  When this scheduler will be switched to use dataflow,

     this can be unified as df gives us both per basic block and per

     instruction info.  Actually, we don't do that pass and just hope

     for the best.  */

  regset reg_sets;

  regset reg_clobbers;

  regset reg_uses;

};

#define IDATA_TYPE(ID) ((ID)->type)

#define IDATA_LHS(ID) ((ID)->lhs)

#define IDATA_RHS(ID) ((ID)->rhs)

#define IDATA_REG_SETS(ID) ((ID)->reg_sets)

#define IDATA_REG_USES(ID) ((ID)->reg_uses)

#define IDATA_REG_CLOBBERS(ID) ((ID)->reg_clobbers)

/* Type to represent all needed info to emit an insn.

   This is a virtual equivalent of the insn.

   Every insn in the stream has an associated vinsn.  This is used

   to reduce memory consumption basing on the fact that many insns

   don't change through the scheduler.

   vinsn can be either normal or unique.

   * Normal vinsn is the one, that can be cloned multiple times and typically

   corresponds to normal instruction.

   * Unique vinsn derivates from CALL, ASM, JUMP (for a while) and other

   unusual stuff.  Such a vinsn is described by its INSN field, which is a

   reference to the original instruction.  */

struct vinsn_def

{

  /* Associated insn.  */

  rtx insn_rtx;

  /* Its description.  */

  struct idata_def id;

  /* Hash of vinsn.  It is computed either from pattern or from rhs using

     hash_rtx.  It is not placed in ID for faster compares.  */

  unsigned hash;

  /* Hash of the insn_rtx pattern.  */

  unsigned hash_rtx;

  /* Smart pointer counter.  */

  int count;

  /* Cached cost of the vinsn.  To access it please use vinsn_cost ().  */

  int cost;

  /* Mark insns that may trap so we don't move them through jumps.  */

  bool may_trap_p;

};

#define VINSN_INSN_RTX(VI) ((VI)->insn_rtx)

#define VINSN_PATTERN(VI) (PATTERN (VINSN_INSN_RTX (VI)))

#define VINSN_ID(VI) (&((VI)->id))

#define VINSN_HASH(VI) ((VI)->hash)

#define VINSN_HASH_RTX(VI) ((VI)->hash_rtx)

#define VINSN_TYPE(VI) (IDATA_TYPE (VINSN_ID (VI)))

#define VINSN_SEPARABLE_P(VI) (VINSN_TYPE (VI) == SET)

#define VINSN_CLONABLE_P(VI) (VINSN_SEPARABLE_P (VI) || VINSN_TYPE (VI) == USE)

#define VINSN_UNIQUE_P(VI) (!VINSN_CLONABLE_P (VI))

#define VINSN_LHS(VI) (IDATA_LHS (VINSN_ID (VI)))

#define VINSN_RHS(VI) (IDATA_RHS (VINSN_ID (VI)))

#define VINSN_REG_SETS(VI) (IDATA_REG_SETS (VINSN_ID (VI)))

#define VINSN_REG_USES(VI) (IDATA_REG_USES (VINSN_ID (VI)))

#define VINSN_REG_CLOBBERS(VI) (IDATA_REG_CLOBBERS (VINSN_ID (VI)))

#define VINSN_COUNT(VI) ((VI)->count)

#define VINSN_MAY_TRAP_P(VI) ((VI)->may_trap_p)

/* An entry of the hashtable describing transformations happened when

   moving up through an insn.  */

struct transformed_insns

{

  /* Previous vinsn.  Used to find the proper element.  */

  vinsn_t vinsn_old;

  /* A new vinsn.  */

  vinsn_t vinsn_new;

  /* Speculative status.  */

  ds_t ds;

  /* Type of transformation happened.  */

  enum local_trans_type type;

  /* Whether a conflict on the target register happened.  */

  BOOL_BITFIELD was_target_conflict : 1;

  /* Whether a check was needed.  */

  BOOL_BITFIELD needs_check : 1;

};

/* Indexed by INSN_LUID, the collection of all data associated with

   a single instruction that is in the stream.  */

struct _sel_insn_data

{

  /* The expression that contains vinsn for this insn and some

     flow-sensitive data like priority.  */

  expr_def expr;

  /* If (WS_LEVEL == GLOBAL_LEVEL) then AV is empty.  */

  int ws_level;

  /* A number that helps in defining a traversing order for a region.  */

  int seqno;

  /* A liveness data computed above this insn.  */

  regset live;

  /* An INSN_UID bit is set when deps analysis result is already known.  */

  bitmap analyzed_deps;

  /* An INSN_UID bit is set when a hard dep was found, not set when

     no dependence is found.  This is meaningful only when the analyzed_deps

     bitmap has its bit set.  */

  bitmap found_deps;

  /* An INSN_UID bit is set when this is a bookkeeping insn generated from

     a parent with this uid.  If a parent is a bookkeeping copy, all its

     originators are transitively included in this set.  */

  bitmap originators;

  /* A hashtable caching the result of insn transformations through this one.  */

  htab_t transformed_insns;

  /* A context incapsulating this insn.  */

  struct deps_desc deps_context;

  /* This field is initialized at the beginning of scheduling and is used

     to handle sched group instructions.  If it is non-null, then it points

     to the instruction, which should be forced to schedule next.  Such

     instructions are unique.  */

  insn_t sched_next;

  /* Cycle at which insn was scheduled.  It is greater than zero if insn was

     scheduled.  This is used for bundling.  */

  int sched_cycle;

  /* Cycle at which insn's data will be fully ready.  */

  int ready_cycle;

  /* Speculations that are being checked by this insn.  */

  ds_t spec_checked_ds;

  /* Whether the live set valid or not.  */

  BOOL_BITFIELD live_valid_p : 1;

  /* Insn is an ASM.  */

  BOOL_BITFIELD asm_p : 1;

  /* True when an insn is scheduled after we've determined that a stall is

     required.

     This is used when emulating the Haifa scheduler for bundling.  */

  BOOL_BITFIELD after_stall_p : 1;

};

typedef struct _sel_insn_data sel_insn_data_def;

typedef sel_insn_data_def *sel_insn_data_t;

DEF_VEC_O (sel_insn_data_def);

DEF_VEC_ALLOC_O (sel_insn_data_def, heap);

extern VEC (sel_insn_data_def, heap) *s_i_d;

/* Accessor macros for s_i_d.  */

#define SID(INSN) (VEC_index (sel_insn_data_def, s_i_d, INSN_LUID (INSN)))

#define SID_BY_UID(UID) (VEC_index (sel_insn_data_def, s_i_d,   LUID_BY_UID (UID)))

extern sel_insn_data_def insn_sid (insn_t);

#define INSN_ASM_P(INSN) (SID (INSN)->asm_p)

#define INSN_SCHED_NEXT(INSN) (SID (INSN)->sched_next)

#define INSN_ANALYZED_DEPS(INSN) (SID (INSN)->analyzed_deps)

#define INSN_FOUND_DEPS(INSN) (SID (INSN)->found_deps)

#define INSN_DEPS_CONTEXT(INSN) (SID (INSN)->deps_context)

#define INSN_ORIGINATORS(INSN) (SID (INSN)->originators)

#define INSN_ORIGINATORS_BY_UID(UID) (SID_BY_UID (UID)->originators)

#define INSN_TRANSFORMED_INSNS(INSN) (SID (INSN)->transformed_insns)

#define INSN_EXPR(INSN) (&SID (INSN)->expr)

#define INSN_LIVE(INSN) (SID (INSN)->live)

#define INSN_LIVE_VALID_P(INSN) (SID (INSN)->live_valid_p)

#define INSN_VINSN(INSN) (EXPR_VINSN (INSN_EXPR (INSN)))

#define INSN_TYPE(INSN) (VINSN_TYPE (INSN_VINSN (INSN)))

#define INSN_SIMPLEJUMP_P(INSN) (INSN_TYPE (INSN) == PC)

#define INSN_LHS(INSN) (VINSN_LHS (INSN_VINSN (INSN)))

#define INSN_RHS(INSN) (VINSN_RHS (INSN_VINSN (INSN)))

#define INSN_REG_SETS(INSN) (VINSN_REG_SETS (INSN_VINSN (INSN)))

#define INSN_REG_CLOBBERS(INSN) (VINSN_REG_CLOBBERS (INSN_VINSN (INSN)))

#define INSN_REG_USES(INSN) (VINSN_REG_USES (INSN_VINSN (INSN)))

#define INSN_SCHED_TIMES(INSN) (EXPR_SCHED_TIMES (INSN_EXPR (INSN)))

#define INSN_SEQNO(INSN) (SID (INSN)->seqno)

#define INSN_AFTER_STALL_P(INSN) (SID (INSN)->after_stall_p)

#define INSN_SCHED_CYCLE(INSN) (SID (INSN)->sched_cycle)

#define INSN_READY_CYCLE(INSN) (SID (INSN)->ready_cycle)

#define INSN_SPEC_CHECKED_DS(INSN) (SID (INSN)->spec_checked_ds)

/* A global level shows whether an insn is valid or not.  */

extern int global_level;

#define INSN_WS_LEVEL(INSN) (SID (INSN)->ws_level)

extern av_set_t get_av_set (insn_t);

extern int get_av_level (insn_t);