/* Attributes private to construction: */
unsigned matured:1; /**< if set, all in-nodes of the block are fixed */
unsigned dead:1; /**< if set, the block is dead (and could be replace by a Bad */
- struct ir_node **graph_arr; /**< array to store all parameters */
+ ir_node **graph_arr; /**< array to store all parameters */
/* Attributes holding analyses information */
- struct 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. */
- /* exc_t exc; */ /**< role of this block for exception handling */
- /* ir_node *handler_entry; */ /**< handler entry block iff this block is part of a region */
+ 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. */
+ 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 */
+ * interprocedural_view, if they differ
+ * from intraprocedural predecessors */
int *backedge; /**< Field n set to true if pred n is backedge.
- @@@ @todo Ev. replace by bitfield! */
+ @@@ @todo Ev. replace by bit field! */
int *cg_backedge; /**< Field n set to true if pred n is interprocedural backedge.
- @@@ @todo Ev. replace by bitfield! */
+ @@@ @todo Ev. replace by bit field! */
ir_extblk *extblk; /**< the extended basic block this block belongs to */
struct list_head succ_head; /**< A list head for all successor edges of a block. */
#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 */
} free_attr;
/** InstOf attributes */
-typedef struct
-{
- ir_type *ent;
- int dfn;
+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 */
/** CallBegin attributes */
typedef struct {
- ir_node * call; /**< associated Call-operation */
+ ir_node * call; /**< Associated Call-operation. */
} callbegin_attr;
/** Cast attributes */
typedef struct {
- ir_type *totype; /**< type of the casted node */
+ 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 */
- ent_volatility volatility; /**< the volatility of a Load/Store operation */
+ except_attr exc; /**< The exception attribute. MUST be the first one. */
+ ir_mode *load_mode; /**< The mode of this Load operation. */
+ ent_volatility volatility; /**< The volatility of a Load/Store operation. */
} load_attr;
/** Store attributes */
typedef pn_Cmp confirm_attr; /**< Attribute to hold compare operation */
+/** CopyB attribute */
typedef struct {
- except_attr exc; /**< the exception attribute. MUST be the first one. */
- ir_type *data_type; /**< type of the copied entity */
+ 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;
+
/**
* Edge info to put into an irn.
*/
typedef struct _irn_edge_info_t {
- struct list_head outs_head; /**< The list of all outs */
- int out_count; /**< number of outs in the list */
+ struct list_head outs_head; /**< The list of all outs. */
+ int out_count; /**< Number of outs in the list. */
} irn_edge_info_t;
end_attr end; /**< For EndReg, EndExcept */
except_attr except; /**< For Phi node construction in case of exceptions */
copyb_attr copyb; /**< For CopyB operation */
+ bound_attr bound; /**< For Bound operation */
} attr;
firm_kind kind; /**< distinguishes this node from others */
ir_op *op; /**< Opcode of this node. */
ir_mode *mode; /**< Mode of this node. */
- unsigned long visited; /**< visited counter for walks of the graph */
struct ir_node **in; /**< array with predecessors / operands */
+ unsigned long visited; /**< 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. */
+ 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;
- int node_nr; /**< a unique node number for each node to make output
- readable. */
+ 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 */
struct abstval *av; /**< the abstract value of this node */
struct section *sec;
#endif
-#if FIRM_EDGES_INPLACE
irn_edge_info_t edge_info; /**< everlasting out edges */
-#endif
/* ------- Opcode depending fields -------- */
attr attr; /**< attribute 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. */
+/**
+ * Returns the array with the ins. The content of the array may not be
+ * changed.
+ * Note that this function returns the whole in array including the
+ * block predecessor. So, it is NOT symmetric with set_irn_in().
+ */
ir_node **get_irn_in (const ir_node *node);
/** @{ */
return node->op;
}
+static INLINE void
+_set_irn_op (ir_node *node, ir_op *op) {
+ assert (node);
+ node->op = op;
+}
+
/** Copies all attributes stored in the old node to the new node.
Assumes both have the same opcode and sufficient size. */
static INLINE void
return (node && _get_irn_op(node) == op_Unknown);
}
+static INLINE int
+_is_Return (const ir_node *node) {
+ assert(node);
+ return (node && _get_irn_op(node) == op_Return);
+}
+
+static INLINE int
+_is_Call (const ir_node *node) {
+ assert(node);
+ return (node && _get_irn_op(node) == op_Call);
+}
+
+static INLINE int
+_is_Sel (const ir_node *node) {
+ assert(node);
+ return (node && _get_irn_op(node) == op_Sel);
+}
+
+static INLINE int
+_is_Mux (const ir_node *node) {
+ assert(node);
+ if (node) {
+ ir_op *op = _get_irn_op(node);
+ return (op == op_Mux || ((op == op_Psi) && _get_irn_arity(node) == 3));
+ }
+ return 0;
+}
+
static INLINE int
_is_no_Block(const ir_node *node) {
assert(node && _is_ir_node(node));
return _get_irn_op(node)->ops.get_type(node);
}
-static INLINE ir_type *get_irn_type_attr(ir_node *node) {
+static INLINE ir_type *_get_irn_type_attr(ir_node *node) {
return _get_irn_op(node)->ops.get_type_attr(node);
}
-static INLINE entity *get_irn_entity_attr(ir_node *node) {
+static INLINE entity *_get_irn_entity_attr(ir_node *node) {
return _get_irn_op(node)->ops.get_entity_attr(node);
}
return is_op_constlike(_get_irn_op(node));
}
+static INLINE int _is_irn_keep(const ir_node *node) {
+ return is_op_keep(_get_irn_op(node));
+}
+
+static INLINE int _is_irn_machine_op(const ir_node *node) {
+ return is_op_machine(_get_irn_op(node));
+}
+
+static INLINE int _is_irn_machine_operand(const ir_node *node) {
+ return is_op_machine_operand(_get_irn_op(node));
+}
+
+static INLINE int _is_irn_machine_user(const ir_node *node, unsigned n) {
+ return is_op_machine_user(_get_irn_op(node), n);
+}
+
static INLINE cond_jmp_predicate _get_Cond_jmp_pred(ir_node *node) {
assert (_get_irn_op(node) == op_Cond);
return node->attr.c.pred;
node->attr.c.pred = pred;
}
+static INLINE int _get_Psi_n_conds(ir_node *node) {
+ assert(_get_irn_op(node) == op_Psi);
+ return _get_irn_arity(node) >> 1;
+}
+
+static INLINE unsigned _get_irn_idx(const ir_node *node) {
+ return node->node_idx;
+}
+
/* 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 get_irn_mode(node) _get_irn_mode(node)
#define set_irn_mode(node, mode) _set_irn_mode(node, mode)
#define get_irn_op(node) _get_irn_op(node)
+#define set_irn_op(node, op) _set_irn_op(node, op)
#define get_irn_opcode(node) _get_irn_opcode(node)
#define get_irn_visited(node) _get_irn_visited(node)
#define set_irn_visited(node, v) _set_irn_visited(node, v)
#define is_binop(node) _is_binop(node)
#define is_Const(node) _is_Const(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_Mux(node) _is_Mux(node)
#define is_Bad(node) _is_Bad(node)
#define is_no_Block(node) _is_no_Block(node)
#define is_Block(node) _is_Block(node)
#define classify_Const(node) _classify_Const(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_entity_attr(node) _get_irn_entity_attr(node)
#define is_irn_constlike(node) _is_irn_constlike(node)
+#define is_irn_keep(node) _is_irn_keep(node)
+#define is_irn_machine_op(node) _is_irn_machine_op(node)
+#define is_irn_machine_operand(node) _is_irn_machine_operand(node)
+#define is_irn_machine_user(node, n) _is_irn_machine_user(node, n)
#define get_Cond_jmp_pred(node) _get_Cond_jmp_pred(node)
#define set_Cond_jmp_pred(node, pred) _set_Cond_jmp_pred(node, pred)
+#define get_Psi_n_conds(node) _get_Psi_n_conds(node)
+#define get_irn_idx(node) _get_irn_idx(node)
# endif /* _IRNODE_T_H_ */