/*
- * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
/** @{ */
/** access attributes directly */
const_attr *get_irn_const_attr (ir_node *node);
-long get_irn_proj_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);
-int get_irn_phi0_attr (ir_node *node);
+phi_attr *get_irn_phi_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);
+divmod_attr *get_irn_divmod_attr (ir_node *node);
/** @} */
/**
return _get_irn_intra_arity(node);
}
+#ifdef INTERPROCEDURAL_VIEW
/**
* Returns the number of predecessors without the block predecessor.
* Intern version for libFirm.
*/
extern int (*_get_irn_arity)(const ir_node *node);
+#else
+
+#define _get_irn_arity(n) _get_irn_intra_arity(n)
+#endif
+
/**
* Intern version for libFirm.
*/
return _get_irn_intra_n(node, n);
}
+/**
+ * returns a hash value for a node
+ */
+static INLINE unsigned hash_irn(const ir_node *node)
+{
+ return (unsigned) get_irn_idx(node);
+}
+
/**
* Access to the predecessors of a node.
* To iterate over the operands iterate from 0 to i < get_irn_arity(),
* If it is a block, the entry -1 is NULL.
* Intern version for libFirm.
*/
+#ifdef INTERPROCEDURAL_VIEW
extern ir_node *(*_get_irn_n)(const ir_node *node, int n);
+#else
+#define _get_irn_n(n,i) _get_irn_intra_n(n,i)
+#endif
static INLINE int _get_irn_deps(const ir_node *node) {
return node->deps ? ARR_LEN(node->deps) : 0;
*/
static INLINE void
_set_irn_link(ir_node *node, void *link) {
- assert(node);
- /* Link field is used for Phi construction and various optimizations
- in iropt. */
- assert(get_irg_phase_state(get_irn_irg(node)) != phase_building);
-
+ assert(node);
node->link = link;
}
return (node->op->opar == oparity_binary);
}
+static INLINE int
+_is_Phi(const ir_node *node) {
+ ir_op *op;
+ assert(node);
+
+ op = get_irn_op(node);
+#ifdef INTERPROCEDURAL_VIEW
+ if (op == op_Filter) return get_interprocedural_view();
+#endif
+ return (op == op_Phi);
+}
+
+static INLINE int
+_is_Proj(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Proj);
+}
+
static INLINE int
_is_Bad(const ir_node *node) {
assert(node);
return (_get_irn_op(node) == op_Minus);
}
+static INLINE int
+_is_Abs(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Abs);
+}
+
static INLINE int
_is_Mod(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_Tuple);
}
+static INLINE int
+_is_Bound(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Bound);
+}
+
static INLINE int
_is_Start(const ir_node *node) {
assert(node);
return (_get_irn_op(node) == op_Conv);
}
+static INLINE int
+_is_strictConv(const ir_node *node) {
+ return _is_Conv(node) && get_Conv_strict(node);
+}
+
+static INLINE int
+_is_Cast(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Cast);
+}
+
static INLINE int
_is_CopyB(const ir_node *node) {
assert(node);
return (_get_irn_op(node) == op_Mul);
}
+static INLINE int
+_is_Mulh(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Mulh);
+}
+
static INLINE int
_is_Mux(const ir_node *node) {
assert(node);
return (_get_irn_op(node) == op_SymConst);
}
+static INLINE int
+_is_SymConst_addr_ent(const ir_node *node) {
+ return is_SymConst(node) && get_SymConst_kind(node) == symconst_addr_ent;
+}
+
static INLINE int
_is_Cond(const ir_node *node) {
assert(node);
}
static INLINE ir_node *
-_get_Block_cfgpred(ir_node *node, int pos) {
+_get_Block_cfgpred(const ir_node *node, int pos) {
assert(0 <= pos && pos < get_irn_arity(node));
assert(_is_Block(node));
return _get_irn_n(node, pos);
* Start, but the Bad node.
*/
static INLINE ir_node *
-_get_Block_cfgpred_block(ir_node *node, int pos) {
+_get_Block_cfgpred_block(const ir_node *node, int pos) {
ir_node *res = skip_Proj(get_Block_cfgpred(node, pos));
if (!is_Bad(res))
res = get_nodes_block(res);
static INLINE ir_node *
_set_Block_dead(ir_node *block) {
assert(_get_irn_op(block) == op_Block);
+ block->attr.block.dom.dom_depth = -1;
block->attr.block.is_dead = 1;
return block;
}
return node->attr.con.tv;
}
-static INLINE cnst_classify_t _classify_Const(ir_node *node) {
- ir_op *op;
- assert(_is_ir_node(node));
-
- op = _get_irn_op(node);
+static INLINE int _is_Const_null(const ir_node *node) {
+ return tarval_is_null(_get_Const_tarval(node));
+}
- if (op == op_Const)
- return classify_tarval(_get_Const_tarval(node));
- else if(op == op_SymConst)
- return CNST_SYMCONST;
+static INLINE int _is_Const_one(const ir_node *node) {
+ return tarval_is_one(_get_Const_tarval(node));
+}
- return CNST_NO_CONST;
+static INLINE int _is_Const_all_one(const ir_node *node) {
+ return tarval_is_all_one(_get_Const_tarval(node));
}
static INLINE int _is_irn_forking(const ir_node *node) {
node->attr.cond.pred = pred;
}
-static INLINE int _get_Psi_n_conds(ir_node *node) {
+static INLINE int _get_Psi_n_conds(const ir_node *node) {
assert(_get_irn_op(node) == op_Psi);
return _get_irn_arity(node) >> 1;
}
n->dbi = db;
}
+/**
+ * Sets the Phi list of a block.
+ */
+static INLINE void
+_set_Block_phis(ir_node *block, ir_node *phi) {
+ assert(_is_Block(block));
+ assert(phi == NULL || _is_Phi(phi));
+ block->attr.block.phis = phi;
+}
+
+/**
+ * Returns the link of a node.
+ * Intern version of libFirm.
+ */
+static INLINE ir_node *
+_get_Block_phis(const ir_node *block) {
+ assert(_is_Block(block));
+ return block->attr.block.phis;
+}
+
+/**
+ * Sets the next link of a Phi.
+ */
+static INLINE void
+_set_Phi_next(ir_node *phi, ir_node *next) {
+ assert(_is_Phi(phi));
+ phi->attr.phi.next = next;
+}
+
+/**
+ * Returns the link of a node.
+ * Intern version of libFirm.
+ */
+static INLINE ir_node *
+_get_Phi_next(const ir_node *phi) {
+ assert(_is_Phi(phi));
+ return phi->attr.phi.next;
+}
+
/* 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_irn_pinned_in_irg(node) _is_irn_pinned_in_irg(node)
#define is_unop(node) _is_unop(node)
#define is_binop(node) _is_binop(node)
+#define is_Proj(node) _is_Proj(node)
+#define is_Phi(node) _is_Phi(node)
#define is_Const(node) _is_Const(node)
#define is_Conv(node) _is_Conv(node)
+#define is_strictConv(node) _is_strictConv(node)
+#define is_Cast(node) _is_Cast(node)
#define is_Unknown(node) _is_Unknown(node)
#define is_Return(node) _is_Return(node)
#define is_Call(node) _is_Call(node)
#define is_Sel(node) _is_Sel(node)
#define is_Mul(node) _is_Mul(node)
+#define is_Mulh(node) _is_Mulh(node)
#define is_Mux(node) _is_Mux(node)
#define is_Load(node) _is_Load(node)
#define is_Sync(node) _is_Sync(node)
#define is_Confirm(node) _is_Confirm(node)
#define is_Pin(node) _is_Pin(node)
#define is_SymConst(node) _is_SymConst(node)
+#define is_SymConst_addr_ent(node) _is_SymConst_addr_ent(node)
#define is_Cond(node) _is_Cond(node)
#define is_CopyB(node) _is_CopyB(node)
#define is_Cmp(node) _is_Cmp(node)
#define is_Start(node) _is_Start(node)
#define is_End(node) _is_End(node)
#define is_Minus(node) _is_Minus(node)
+#define is_Abs(node) _is_Abs(node)
#define is_Mod(node) _is_Mod(node)
#define is_Div(node) _is_Div(node)
#define is_DivMod(node) _is_DivMod(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_Bound(node) _is_Bound(node)
#define is_no_Block(node) _is_no_Block(node)
#define is_Block(node) _is_Block(node)
#define get_Block_n_cfgpreds(node) _get_Block_n_cfgpreds(node)
#define set_Block_dead(block) _set_Block_dead(block)
#define is_Block_dead(block) _is_Block_dead(block)
#define get_Const_tarval(node) _get_Const_tarval(node)
-#define classify_Const(node) _classify_Const(node)
+#define is_Const_null(node) _is_Const_null(node)
+#define is_Const_one(node) _is_Const_one(node)
+#define is_Const_all_one(node) _is_Const_all_one(node)
#define is_irn_forking(node) _is_irn_forking(node)
#define get_irn_type(node) _get_irn_type(node)
#define get_irn_type_attr(node) _get_irn_type_attr(node)
#define get_irn_dbg_info(node) _get_irn_dbg_info(node)
#define set_irn_dbg_info(node, db) _set_irn_dbg_info(node, db)
+#define set_Block_phis(node, phi) _set_Block_phis(node, phi)
+#define get_Block_phis(node) _get_Block_phis(node)
+#define set_Phi_next(node, phi) _set_Phi_next(node, phi)
+#define get_Phi_next(node) _get_Phi_next(node)
+
#endif
projects / libfirm / blobdiff