} block_attr;
-/** Start attributes */
-typedef struct {
- char dummy;
- /* ir_graph *irg; @@@ now in block */
-} start_attr;
-
-/** Cond attributes */
+/** 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 */
+/** 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 */
+/** Sel attributes. */
typedef struct {
entity *ent; /**< entity to select */
} sel_attr;
-/** Exception attributes */
+/** 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
#endif
} except_attr;
-/** Call attributes */
+/** Call attributes. */
typedef struct {
except_attr exc; /**< the exception attribute. MUST be the first one. */
ir_type *cld_tp; /**< type of called procedure */
entity ** callee_arr; /**< result of callee analysis */
} call_attr;
-/** Alloc attributes */
+/** 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 */
+/** 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 */
+/** 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 */
+/** Filter attributes. */
typedef struct {
long proj; /**< contains the result position to project (Proj) */
ir_node ** in_cg; /**< array with interprocedural predecessors (Phi) */
@todo Ev. replace by bitfield! */
} filter_attr;
-/** EndReg/EndExcept attributes */
+/** EndReg/EndExcept attributes. */
typedef struct {
char dummy;
} end_attr;
-/** CallBegin attributes */
+/** CallBegin attributes. */
typedef struct {
ir_node * call; /**< Associated Call-operation. */
} callbegin_attr;
-/** Cast attributes */
+/** Cast attributes. */
typedef struct {
ir_type *totype; /**< Type of the casted node. */
} cast_attr;
-/** Load attributes */
+/** 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. */
} load_attr;
-/** Store attributes */
+/** Store attributes. */
typedef struct {
except_attr exc; /**< the exception attribute. MUST be the first one. */
ent_volatility volatility; /**< the volatility of a Store operation */
typedef pn_Cmp confirm_attr; /**< Attribute to hold compare operation */
-/** CopyB attribute */
+/** 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 */
+/** 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;
+
/**
* Edge info to put into an irn.
*/
/** Some IR-nodes just have one attribute, these are stored here,
some have more. Their name is 'irnodename_attr' */
typedef union {
- start_attr start; /**< For Start */
- block_attr block; /**< For Block: Fields needed to construct it */
- cond_attr c; /**< For Cond. */
- const_attr con; /**< For Const: contains the value of the constant and a type */
- symconst_attr i; /**< For SymConst. */
- sel_attr s; /**< For Sel. */
- call_attr call; /**< For Call: pointer to the type of the method to call */
+ 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 a; /**< For Alloc. */
- free_attr f; /**< For Free. */
- io_attr io; /**< For InstOf */
- cast_attr cast; /**< For Cast. */
- load_attr load; /**< For Load. */
+ 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. */
int phi0_pos; /**< For Phi. Used to remember the value defined by
this Phi node. Needed when the Phi is completed
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 */
} attr;
ir_mode *mode; /**< Mode of this node. */
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 out_valid;
long node_nr; /**< a unique node number for each node to make output
- readable. */
+ 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. */
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_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_Load (const ir_node *node) {
+ assert(node);
+ return (node && _get_irn_op(node) == op_Load);
+}
+
+static INLINE int
+_is_Sync (const ir_node *node) {
+ assert(node);
+ return (node && _get_irn_op(node) == op_Sync);
+}
+
+static INLINE int
+_is_Confirm (const ir_node *node) {
+ assert(node);
+ return (node && _get_irn_op(node) == op_Confirm);
+}
+
static INLINE int
_is_no_Block(const ir_node *node) {
assert(node && _is_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;
+ return node->attr.cond.pred;
}
static INLINE void _set_Cond_jmp_pred(ir_node *node, cond_jmp_predicate pred) {
assert (_get_irn_op(node) == op_Cond);
- node->attr.c.pred = pred;
+ node->attr.cond.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 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_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_Load(node) _is_Load(node)
+#define is_Sync(node) _is_Sync(node)
+#define is_Confirm(node) _is_Confirm(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 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_ */
projects / libfirm / blobdiff