#define FIRM_IR_IRNODE_T_H
#include "firm_config.h"
+#include "irtypes.h"
#include "irnode.h"
#include "irop_t.h"
#include "irgraph_t.h"
#include "irflag_t.h"
#include "firm_common_t.h"
-#include "irdom_t.h" /* For size of struct dom_info. */
-#include "dbginfo.h"
-#include "irloop.h"
-#include "iredgekinds.h"
#include "array.h"
-#include "set.h"
-#include "list.h"
-#include "entity_t.h"
-#include "type_t.h"
-#include "tv_t.h"
-#include "irextbb_t.h"
-
-
-/** ir node attributes **/
-
-/** Block attributes */
-typedef struct {
- /* General attributes */
- ir_graph *irg; /**< The graph this block belongs to. */
- unsigned long block_visited; /**< For the walker that walks over all blocks. */
- /* Attributes private to construction: */
- unsigned is_matured:1; /**< If set, all in-nodes of the block are fixed. */
- unsigned is_dead:1; /**< If set, the block is dead (and could be replace by a Bad. */
- unsigned is_mb_head:1; /**< Set if this block is a macroblock head. */
- ir_node **graph_arr; /**< An array to store all parameters. */
- /* Attributes holding analyses information */
- ir_dom_info dom; /**< Datastructure that holds information about dominators.
- @@@ @todo
- Eventually overlay with graph_arr as only valid
- in different phases. Eventually inline the whole
- datastructure. */
- ir_dom_info pdom; /**< Datastructure that holds information about post-dominators. */
- ir_node ** in_cg; /**< array with predecessors in
- * interprocedural_view, if they differ
- * from intraprocedural predecessors */
- int *backedge; /**< Field n set to true if pred n is backedge.
- @@@ @todo Ev. replace by bit field! */
- int *cg_backedge; /**< Field n set to true if pred n is interprocedural backedge.
- @@@ @todo Ev. replace by bit field! */
- ir_extblk *extblk; /**< The extended basic block this block belongs to. */
- ir_region *region; /**< The immediate structural region this block belongs to. */
- unsigned mb_depth; /**< The macroblock depth: A distance from the macroblock header */
- unsigned long exc_region; /**< The exception region number for this block. */
-
- struct list_head succ_head; /**< A list head for all successor edges of a block. */
-} block_attr;
-
-/** Cond attributes. */
-typedef struct {
- cond_kind kind; /**< flavor of Cond */
- long default_proj; /**< only for non-binary Conds: biggest Proj number, i.e. the one used for default. */
- cond_jmp_predicate pred; /**< only for binary Conds: The jump predication. */
-} cond_attr;
-
-/** Const attributes. */
-typedef struct {
- tarval *tv; /**< the target value */
- ir_type *tp; /**< the source type, for analyses. default: type_unknown. */
-} const_attr;
-
-/** SymConst attributes. */
-typedef struct {
- symconst_symbol sym; // old tori
- symconst_kind num;
- ir_type *tp; /**< the source type, for analyses. default: type_unknown. */
-} symconst_attr;
-
-/** Sel attributes. */
-typedef struct {
- ir_entity *ent; /**< entity to select */
-} sel_attr;
-
-/** Exception attributes. */
-typedef struct {
- op_pin_state pin_state; /**< the pin state for operations that might generate a exception:
- If it's know that no exception will be generated, could be set to
- op_pin_state_floats. */
-#if PRECISE_EXC_CONTEXT
- struct ir_node **frag_arr; /**< For Phi node construction in case of exception */
-#endif
-} except_attr;
-
-/** Call attributes. */
-typedef struct {
- except_attr exc; /**< the exception attribute. MUST be the first one. */
- ir_type *cld_tp; /**< type of called procedure */
- ir_entity ** callee_arr; /**< result of callee analysis */
-} call_attr;
-
-/** Alloc attributes. */
-typedef struct {
- except_attr exc; /**< the exception attribute. MUST be the first one. */
- ir_type *type; /**< Type of the allocated object. */
- where_alloc where; /**< stack, heap or other managed part of memory */
-} alloc_attr;
-
-/** Free attributes. */
-typedef struct {
- ir_type *type; /**< Type of the allocated object. */
- where_alloc where; /**< stack, heap or other managed part of memory */
-} free_attr;
-
-/** InstOf attributes. */
-typedef struct {
- except_attr exc; /**< the exception attribute. MUST be the first one. */
- ir_type *type; /**< the type of which the object pointer must be */
-} io_attr;
-
-/** Filter attributes. */
-typedef struct {
- long proj; /**< contains the result position to project (Proj) */
- ir_node ** in_cg; /**< array with interprocedural predecessors (Phi) */
- int *backedge; /**< Field n set to true if pred n is backedge.
- @todo Ev. replace by bitfield! */
-} filter_attr;
-
-/** CallBegin attributes. */
-typedef struct {
- ir_node * call; /**< Associated Call-operation. */
-} callbegin_attr;
-
-/** Cast attributes. */
-typedef struct {
- ir_type *totype; /**< Type of the casted node. */
-} cast_attr;
-
-/** Load attributes. */
-typedef struct {
- except_attr exc; /**< The exception attribute. MUST be the first one. */
- ir_mode *load_mode; /**< The mode of this Load operation. */
- ir_volatility volatility; /**< The volatility of a Load/Store operation. */
-} load_attr;
-
-/** Store attributes. */
-typedef struct {
- except_attr exc; /**< the exception attribute. MUST be the first one. */
- ir_volatility volatility; /**< the volatility of a Store operation */
-} store_attr;
-
-typedef struct {
- int pos; /**< For Phi0. Used to remember the value defined by
- this Phi node. Needed when the Phi is completed
- to call get_r_internal_value to find the
- predecessors. If this attribute is set, the Phi
- node takes the role of the obsolete Phi0 node,
- therefore the name. */
-} phi0_attr;
-
-
-/**< Confirm attribute. */
-typedef struct {
- pn_Cmp cmp; /**< The compare operation. */
- unsigned long exc_region; /**< If non-null: the region for which this confirm is restricted to. */
-} confirm_attr;
-
-/** CopyB attribute. */
-typedef struct {
- except_attr exc; /**< The exception attribute. MUST be the first one. */
- ir_type *data_type; /**< Type of the copied entity. */
-} copyb_attr;
-
-/** Bound attribute. */
-typedef struct {
- except_attr exc; /**< The exception attribute. MUST be the first one. */
-} bound_attr;
-
-/** Conv attribute. */
-typedef struct {
- char strict; /**< If set, this is a strict Conv that cannot be removed. */
-} conv_attr;
-
-/** Div/Mod/DivMod/Quot attribute. */
-typedef struct {
- except_attr exc; /**< The exception attribute. MUST be the first one. */
- ir_mode *res_mode; /**< Result mode for the division. */
-} divmod_attr;
-
-/** Inline Assembler support attribute. */
-typedef struct {
- op_pin_state pin_state; /**< the pin state for operations that might generate a exception */
- ident *asm_text; /**< The inline assembler text. */
- ir_asm_constraint *inputs; /**< Input constraints. */
- ir_asm_constraint *outputs; /**< Output constraints. */
- ident **clobber; /**< List of clobbered registers. */
-} asm_attr;
-
-/** Some IR-nodes just have one attribute, these are stored here,
- some have more. Their name is 'irnodename_attr' */
-typedef union {
- block_attr block; /**< For Block: Fields needed to construct it */
- cond_attr cond; /**< For Cond. */
- const_attr con; /**< For Const: contains the value of the constant and a type */
- symconst_attr symc; /**< For SymConst. */
- sel_attr sel; /**< For Sel. */
- call_attr call; /**< For Call: pointer to the type of the method to call */
- callbegin_attr callbegin; /**< For CallBegin */
- alloc_attr alloc; /**< For Alloc. */
- free_attr free; /**< For Free. */
- io_attr instof; /**< For InstOf */
- cast_attr cast; /**< For Cast. */
- load_attr load; /**< For Load. */
- store_attr store; /**< For Store. */
- phi0_attr phi0; /**< for Phi0 nodes. */
- int *phi_backedge; /**< For Phi after construction.
- Field n set to true if pred n is backedge.
- @todo Ev. replace by bitfield! */
- long proj; /**< For Proj: contains the result position to project */
- confirm_attr confirm; /**< For Confirm: compare operation and region. */
- filter_attr filter; /**< For Filter */
- except_attr except; /**< For Phi node construction in case of exceptions */
- copyb_attr copyb; /**< For CopyB operation */
- bound_attr bound; /**< For Bound operation */
- conv_attr conv; /**< For Conv operation */
- divmod_attr divmod; /**< For Div/Mod/DivMod operation */
- asm_attr assem; /**< For ASM operation. */
-} attr;
-
-/**
- * Edge info to put into an irn.
- */
-typedef struct _irn_edge_kind_info_t {
- struct list_head outs_head; /**< The list of all outs. */
- int out_count; /**< Number of outs in the list. */
-} irn_edge_info_t;
-
-typedef irn_edge_info_t irn_edges_info_t[EDGE_KIND_LAST];
-
-/**
- * The common structure of an irnode.
- * If the node has some attributes, they are stored in the attr field.
- */
-struct ir_node {
- /* ------- Basics of the representation ------- */
- firm_kind kind; /**< Distinguishes this node from others. */
- ir_op *op; /**< The Opcode of this node. */
- ir_mode *mode; /**< The Mode of this node. */
- struct ir_node **in; /**< The array of predecessors / operands. */
- unsigned long visited; /**< The visited counter for walks of the graph. */
- unsigned node_idx; /**< The node index of this node in its graph. */
- void *link; /**< To attach additional information to the node, e.g.
- used while construction to link Phi0 nodes and
- during optimization to link to nodes that
- shall replace a node. */
- /* ------- Fields for optimizations / analysis information ------- */
- struct ir_node **out; /**< @deprecated array of out edges. */
- struct dbg_info *dbi; /**< A pointer to information for debug support. */
- /* ------- For debugging ------- */
-#ifdef DEBUG_libfirm
- int out_valid;
- long node_nr; /**< A unique node number for each node to make output
- readable. */
-#endif
- /* ------- For analyses -------- */
- ir_loop *loop; /**< the loop the node is in. Access routines in irloop.h */
-#ifdef DO_HEAPANALYSIS
- struct abstval *av; /**< Heapanalysis: The abstract value of this node. */
- struct section *sec; /**< Heapanalysis: The section of this node. */
-#endif
- struct ir_node **deps; /**< Additional dependencies induced by state. */
- irn_edges_info_t edge_info; /**< Everlasting out edges. */
- /* ------- Opcode depending fields -------- */
- attr attr; /**< The set of attributes of this node. Depends on opcode.
- Must be last field of struct ir_node. */
-};
-
-
/**
* Returns the array with the ins. The content of the array may not be
* changed.
/** @{ */
/** access attributes directly */
-const_attr get_irn_const_attr (ir_node *node);
+const_attr *get_irn_const_attr (ir_node *node);
long get_irn_proj_attr (ir_node *node);
-alloc_attr get_irn_alloc_attr (ir_node *node);
-free_attr get_irn_free_attr (ir_node *node);
-symconst_attr get_irn_symconst_attr (ir_node *node);
-ir_type *get_irn_call_attr (ir_node *node);
-ir_type *get_irn_funccall_attr (ir_node *node);
-sel_attr get_irn_sel_attr (ir_node *node);
+alloc_attr *get_irn_alloc_attr (ir_node *node);
+free_attr *get_irn_free_attr (ir_node *node);
+symconst_attr *get_irn_symconst_attr (ir_node *node);
+ir_type *get_irn_call_attr (ir_node *node);
+ir_type *get_irn_funccall_attr (ir_node *node);
+sel_attr *get_irn_sel_attr (ir_node *node);
int get_irn_phi0_attr (ir_node *node);
-block_attr get_irn_block_attr (ir_node *node);
-load_attr get_irn_load_attr (ir_node *node);
-store_attr get_irn_store_attr (ir_node *node);
-except_attr get_irn_except_attr (ir_node *node);
+block_attr *get_irn_block_attr (ir_node *node);
+load_attr *get_irn_load_attr (ir_node *node);
+store_attr *get_irn_store_attr (ir_node *node);
+except_attr *get_irn_except_attr (ir_node *node);
/** @} */
/**
* Gets the opcode of a node.
* Intern version for libFirm.
*/
-static INLINE ir_opcode
+static INLINE unsigned
_get_irn_opcode(const ir_node *node) {
assert(k_ir_node == get_kind(node));
assert(node->op);
nn = node->in[n + 1];
if (nn == NULL) {
- /* only block inputs are allowed to be NULL */
- assert(n == -1 && "NULL input of a node");
+ /* only block and Anchor inputs are allowed to be NULL */
+ assert((node->op == op_Anchor || n == -1) && "NULL input of a node");
return NULL;
}
if (nn->op != op_Id) return nn;
return (_get_irn_op(node) == op_Add);
}
+static INLINE int
+_is_And(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_And);
+}
+
+static INLINE int
+_is_Or(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Or);
+}
+
+static INLINE int
+_is_Eor(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Eor);
+}
+
static INLINE int
_is_Sub(const ir_node *node) {
assert(node);
return (_get_irn_op(node) == op_Sub);
}
+static INLINE int
+_is_Not(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Not);
+}
+
+static INLINE int
+_is_Shl(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Shl);
+}
+
+static INLINE int
+_is_Shr(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Shr);
+}
+
+static INLINE int
+_is_Shrs(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Shrs);
+}
+
+static INLINE int
+_is_Rot(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Rot);
+}
+
+static INLINE int
+_is_Psi(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Psi);
+}
+
static INLINE int
_is_Tuple(const ir_node *node) {
assert(node);
return (_get_irn_op(node) == op_ASM);
}
+static INLINE int
+_is_Anchor(const ir_node *node) {
+ return (_get_irn_op(node) == op_Anchor);
+}
+
static INLINE int
_is_no_Block(const ir_node *node) {
assert(node && _is_ir_node(node));
return node->node_idx;
}
+static INLINE dbg_info *_get_irn_dbg_info(const ir_node *n) {
+ return n->dbi;
+} /* get_irn_dbg_info */
+
+static INLINE void _set_irn_dbg_info(ir_node *n, dbg_info *db) {
+ n->dbi = db;
+}
+
/* this section MUST contain all inline functions */
#define is_ir_node(thing) _is_ir_node(thing)
#define get_irn_intra_arity(node) _get_irn_intra_arity(node)
#define is_Jmp(node) _is_Jmp(node)
#define is_Raise(node) _is_Raise(node)
#define is_ASM(node) _is_ASM(node)
+#define is_Anchor(node) _is_Anchor(node)
#define is_Bad(node) _is_Bad(node)
#define is_NoMem(node) _is_NoMem(node)
#define is_Start(node) _is_Start(node)
#define is_DivMod(node) _is_DivMod(node)
#define is_Quot(node) _is_Quot(node)
#define is_Add(node) _is_Add(node)
+#define is_And(node) _is_And(node)
+#define is_Or(node) _is_Or(node)
+#define is_Eor(node) _is_Eor(node)
#define is_Sub(node) _is_Sub(node)
+#define is_Not(node) _is_Not(node)
+#define is_Shl(node) _is_Shl(node)
+#define is_Shr(node) _is_Shr(node)
+#define is_Shrs(node) _is_Shrs(node)
+#define is_Rot(node) _is_Rot(node)
+#define is_Psi(node) _is_Psi(node)
#define is_Tuple(node) _is_Tuple(node)
#define is_no_Block(node) _is_no_Block(node)
#define is_Block(node) _is_Block(node)
#define get_irn_ins_or_deps(node) _get_irn_ins_or_deps(node)
#define get_irn_in_or_dep(node, pos) _get_irn_in_or_dep(node, pos)
+#define get_irn_dbg_info(node) _get_irn_dbg_info(node)
+#define set_irn_dbg_info(node, db) _set_irn_dbg_info(node, db)
+
#endif