#include "iredgekinds.h"
#include "iredges_t.h"
#include "ircons.h"
+#include "error.h"
#include "irhooks.h"
#include "irtools.h"
forbid_new_data = 1;
}
+struct struct_align {
+ char c;
+ struct s {
+ int i;
+ float f;
+ double d;
+ } s;
+};
+
/*
* irnode constructor.
* Create a new irnode in irg, with an op, mode, arity and
ir_mode *mode, int arity, ir_node **in)
{
ir_node *res;
- size_t node_size = offsetof(ir_node, attr) + op->attr_size + firm_add_node_size;
+ unsigned align = offsetof(struct struct_align, s) - 1;
+ unsigned add_node_size = (firm_add_node_size + align) & ~align;
+ size_t node_size = offsetof(ir_node, attr) + op->attr_size + add_node_size;
char *p;
int i;
assert(mode);
p = obstack_alloc(irg->obst, node_size);
memset(p, 0, node_size);
- res = (ir_node *)(p + firm_add_node_size);
+ res = (ir_node *)(p + add_node_size);
res->kind = k_ir_node;
res->op = op;
if (get_irg_phase_state(irg) == phase_backend) {
be_info_new_node(res);
}
- // Init the VRP structures
- res->vrp.range_type = VRP_UNDEFINED;
- res->vrp.valid = 0;
- if (mode_is_int(mode)) {
- // We are assuming that 0 is always represented as 0x0000
- res->vrp.bits_set = new_tarval_from_long(0, mode);
- res->vrp.bits_not_set = new_tarval_from_long(0, mode);
- res->vrp.range_bottom = get_tarval_top();
- res->vrp.range_top = get_tarval_top();
- } else {
- res->vrp.bits_set = get_tarval_bad();
- res->vrp.bits_not_set = get_tarval_bad();
- res->vrp.range_bottom = get_tarval_bad();
- res->vrp.range_top = get_tarval_bad();
- }
- res->vrp.bits_node = NULL;
- res->vrp.range_node = NULL;
- res->vrp.range_op = VRP_NONE;
-
return res;
}
return node->node_nr;
}
-const_attr *get_irn_const_attr(ir_node *node)
-{
- assert(is_Const(node));
- return &node->attr.con;
-}
-
-long get_irn_proj_attr(ir_node *node)
-{
- /* BEWARE: check for true Proj node here, no Filter */
- assert(node->op == op_Proj);
- return node->attr.proj;
-}
-
-alloc_attr *get_irn_alloc_attr(ir_node *node)
-{
- assert(is_Alloc(node));
- return &node->attr.alloc;
-}
-
-free_attr *get_irn_free_attr(ir_node *node)
-{
- assert(is_Free(node));
- return &node->attr.free;
-}
-
-symconst_attr *get_irn_symconst_attr(ir_node *node)
-{
- assert(is_SymConst(node));
- return &node->attr.symc;
-}
-
-call_attr *get_irn_call_attr(ir_node *node)
-{
- assert(is_Call(node));
- return &node->attr.call;
-}
-
-sel_attr *get_irn_sel_attr(ir_node *node)
-{
- assert(is_Sel(node));
- return &node->attr.sel;
-}
-
-phi_attr *get_irn_phi_attr(ir_node *node)
-{
- return &node->attr.phi;
-}
-
-block_attr *get_irn_block_attr(ir_node *node)
-{
- assert(is_Block(node));
- return &node->attr.block;
-}
-
-load_attr *get_irn_load_attr(ir_node *node)
-{
- assert(is_Load(node));
- return &node->attr.load;
-}
-
-store_attr *get_irn_store_attr(ir_node *node)
-{
- assert(is_Store(node));
- return &node->attr.store;
-}
-
-except_attr *get_irn_except_attr(ir_node *node)
-{
- assert(node->op == op_Div || node->op == op_Quot ||
- node->op == op_DivMod || node->op == op_Mod || node->op == op_Call || node->op == op_Alloc || node->op == op_Bound);
- return &node->attr.except;
-}
-
-divmod_attr *get_irn_divmod_attr(ir_node *node)
-{
- assert(node->op == op_Div || node->op == op_Quot ||
- node->op == op_DivMod || node->op == op_Mod);
- return &node->attr.divmod;
-}
-
-builtin_attr *get_irn_builtin_attr(ir_node *node)
-{
- assert(is_Builtin(node));
- return &node->attr.builtin;
-}
-
void *(get_irn_generic_attr)(ir_node *node)
{
assert(is_ir_node(node));
return _Block_block_visited(node);
}
-ir_node *get_Block_graph_arr(ir_node *node, int pos)
-{
- assert(is_Block(node));
- return node->attr.block.graph_arr[pos+1];
-}
-
-void set_Block_graph_arr(ir_node *node, int pos, ir_node *value)
-{
- assert(is_Block(node));
- node->attr.block.graph_arr[pos+1] = value;
-}
-
#ifdef INTERPROCEDURAL_VIEW
void set_Block_cg_cfgpred_arr(ir_node *node, int arity, ir_node *in[])
{
in array afterwards ... */
}
-/* Return the target address of an IJmp */
-ir_node *get_IJmp_target(const ir_node *ijmp)
-{
- assert(is_IJmp(ijmp));
- return get_irn_n(ijmp, 0);
-}
-
-/** Sets the target address of an IJmp */
-void set_IJmp_target(ir_node *ijmp, ir_node *tgt)
-{
- assert(is_IJmp(ijmp));
- set_irn_n(ijmp, 0, tgt);
-}
-
-ir_node *get_Cond_selector(const ir_node *node)
-{
- assert(is_Cond(node));
- return get_irn_n(node, 0);
-}
-
-void set_Cond_selector(ir_node *node, ir_node *selector)
-{
- assert(is_Cond(node));
- set_irn_n(node, 0, selector);
-}
-
-long get_Cond_default_proj(const ir_node *node)
-{
- assert(is_Cond(node));
- return node->attr.cond.default_proj;
-}
-
-void set_Cond_default_proj(ir_node *node, long defproj)
-{
- assert(is_Cond(node));
- node->attr.cond.default_proj = defproj;
-}
-
-ir_node *get_Return_mem(const ir_node *node)
-{
- assert(is_Return(node));
- return get_irn_n(node, 0);
-}
-
-void set_Return_mem(ir_node *node, ir_node *mem)
-{
- assert(is_Return(node));
- set_irn_n(node, 0, mem);
-}
-
int get_Return_n_ress(const ir_node *node)
{
assert(is_Return(node));
set_irn_n(node, pos + RETURN_RESULT_OFFSET, res);
}
-tarval *(get_Const_tarval)(const ir_node *node)
-{
- return _get_Const_tarval(node);
-}
-
-void set_Const_tarval(ir_node *node, tarval *con)
-{
- assert(is_Const(node));
- node->attr.con.tv = con;
-}
-
int (is_Const_null)(const ir_node *node)
{
return _is_Const_null(node);
/* The source language type. Must be an atomic type. Mode of type must
be mode of node. For tarvals from entities type must be pointer to
entity type. */
-ir_type *get_Const_type(ir_node *node)
+ir_type *get_Const_type(const ir_node *node)
{
assert(is_Const(node));
return node->attr.con.tp;
node->attr.symc.sym.type_p = tp;
}
-ident *get_SymConst_name(const ir_node *node)
-{
- assert(is_SymConst(node) && SYMCONST_HAS_ID(get_SymConst_kind(node)));
- return node->attr.symc.sym.ident_p;
-}
-
-void set_SymConst_name(ir_node *node, ident *name)
-{
- assert(is_SymConst(node) && SYMCONST_HAS_ID(get_SymConst_kind(node)));
- node->attr.symc.sym.ident_p = name;
-}
-
/* Only to access SymConst of kind symconst_addr_ent. Else assertion: */
ir_entity *get_SymConst_entity(const ir_node *node)
node->attr.symc.sym = sym;
}
-ir_type *get_SymConst_value_type(ir_node *node)
+ir_type *get_SymConst_value_type(const ir_node *node)
{
assert(is_SymConst(node));
return node->attr.symc.tp;
node->attr.symc.tp = tp;
}
-ir_node *get_Sel_mem(const ir_node *node)
-{
- assert(is_Sel(node));
- return get_irn_n(node, 0);
-}
-
-void set_Sel_mem(ir_node *node, ir_node *mem)
-{
- assert(is_Sel(node));
- set_irn_n(node, 0, mem);
-}
-
-ir_node *get_Sel_ptr(const ir_node *node)
-{
- assert(is_Sel(node));
- return get_irn_n(node, 1);
-}
-
-void set_Sel_ptr(ir_node *node, ir_node *ptr)
-{
- assert(is_Sel(node));
- set_irn_n(node, 1, ptr);
-}
-
int get_Sel_n_indexs(const ir_node *node)
{
assert(is_Sel(node));
set_irn_n(node, pos + SEL_INDEX_OFFSET, index);
}
-ir_entity *get_Sel_entity(const ir_node *node)
-{
- assert(is_Sel(node));
- return node->attr.sel.entity;
-}
-
-/* need a version without const to prevent warning */
-static ir_entity *_get_Sel_entity(ir_node *node)
-{
- return get_Sel_entity(node);
-}
-
-void set_Sel_entity(ir_node *node, ir_entity *ent)
-{
- assert(is_Sel(node));
- node->attr.sel.entity = ent;
-}
-
/* For unary and binary arithmetic operations the access to the
operands can be factored out. Left is the first, right the
Shr, Shrs, Rotate, Cmp */
-ir_node *get_Call_mem(const ir_node *node)
-{
- assert(is_Call(node));
- return get_irn_n(node, 0);
-}
-
-void set_Call_mem(ir_node *node, ir_node *mem)
-{
- assert(is_Call(node));
- set_irn_n(node, 0, mem);
-}
-
-ir_node *get_Call_ptr(const ir_node *node)
-{
- assert(is_Call(node));
- return get_irn_n(node, 1);
-}
-
-void set_Call_ptr(ir_node *node, ir_node *ptr)
-{
- assert(is_Call(node));
- set_irn_n(node, 1, ptr);
-}
-
ir_node **get_Call_param_arr(ir_node *node)
{
assert(is_Call(node));
set_irn_n(node, pos + CALL_PARAM_OFFSET, param);
}
-ir_type *get_Call_type(ir_node *node)
-{
- assert(is_Call(node));
- return node->attr.call.type;
-}
-
-void set_Call_type(ir_node *node, ir_type *tp)
-{
- assert(is_Call(node));
- assert((get_unknown_type() == tp) || is_Method_type(tp));
- node->attr.call.type = tp;
-}
-
-unsigned get_Call_tail_call(const ir_node *node)
-{
- assert(is_Call(node));
- return node->attr.call.tail_call;
-}
-
-void set_Call_tail_call(ir_node *node, unsigned tail_call)
-{
- assert(is_Call(node));
- node->attr.call.tail_call = tail_call != 0;
-}
-
-ir_node *get_Builtin_mem(const ir_node *node)
-{
- assert(is_Builtin(node));
- return get_irn_n(node, 0);
-}
-
-void set_Builin_mem(ir_node *node, ir_node *mem)
-{
- assert(is_Builtin(node));
- set_irn_n(node, 0, mem);
-}
-
-ir_builtin_kind get_Builtin_kind(const ir_node *node)
-{
- assert(is_Builtin(node));
- return node->attr.builtin.kind;
-}
-
-void set_Builtin_kind(ir_node *node, ir_builtin_kind kind)
-{
- assert(is_Builtin(node));
- node->attr.builtin.kind = kind;
-}
-
ir_node **get_Builtin_param_arr(ir_node *node)
{
assert(is_Builtin(node));
set_irn_n(node, pos + BUILDIN_PARAM_OFFSET, param);
}
-ir_type *get_Builtin_type(ir_node *node)
-{
- assert(is_Builtin(node));
- return node->attr.builtin.type;
-}
-
-void set_Builtin_type(ir_node *node, ir_type *tp)
-{
- assert(is_Builtin(node));
- assert((get_unknown_type() == tp) || is_Method_type(tp));
- node->attr.builtin.type = tp;
-}
-
/* Returns a human readable string for the ir_builtin_kind. */
const char *get_builtin_kind_name(ir_builtin_kind kind)
{
-#define X(a) case a: return #a;
+#define X(a) case a: return #a
switch (kind) {
X(ir_bk_trap);
X(ir_bk_debugbreak);
node->attr.call.callee_arr = NULL;
}
-ir_node *get_CallBegin_ptr(const ir_node *node)
-{
- assert(is_CallBegin(node));
- return get_irn_n(node, 0);
-}
-
-void set_CallBegin_ptr(ir_node *node, ir_node *ptr)
-{
- assert(is_CallBegin(node));
- set_irn_n(node, 0, ptr);
-}
-
-ir_node *get_CallBegin_call(const ir_node *node)
-{
- assert(is_CallBegin(node));
- return node->attr.callbegin.call;
-}
-
-void set_CallBegin_call(ir_node *node, ir_node *call)
-{
- assert(is_CallBegin(node));
- node->attr.callbegin.call = call;
-}
-
/*
* Returns non-zero if a Call is surely a self-recursive Call.
* Beware: if this functions returns 0, the call might be self-recursive!
return 0;
}
-#define BINOP(OP) \
-ir_node * get_##OP##_left(const ir_node *node) { \
- assert(is_##OP(node)); \
- return get_irn_n(node, node->op->op_index); \
-} \
-void set_##OP##_left(ir_node *node, ir_node *left) { \
- assert(is_##OP(node)); \
- set_irn_n(node, node->op->op_index, left); \
-} \
-ir_node *get_##OP##_right(const ir_node *node) { \
- assert(is_##OP(node)); \
- return get_irn_n(node, node->op->op_index + 1); \
-} \
-void set_##OP##_right(ir_node *node, ir_node *right) { \
- assert(is_##OP(node)); \
- set_irn_n(node, node->op->op_index + 1, right); \
-}
-
-#define UNOP(OP) \
-ir_node *get_##OP##_op(const ir_node *node) { \
- assert(is_##OP(node)); \
- return get_irn_n(node, node->op->op_index); \
-} \
-void set_##OP##_op(ir_node *node, ir_node *op) { \
- assert(is_##OP(node)); \
- set_irn_n(node, node->op->op_index, op); \
-}
-
-#define BINOP_MEM(OP) \
-BINOP(OP) \
- \
-ir_node * \
-get_##OP##_mem(const ir_node *node) { \
- assert(is_##OP(node)); \
- return get_irn_n(node, 0); \
-} \
- \
-void \
-set_##OP##_mem(ir_node *node, ir_node *mem) { \
- assert(is_##OP(node)); \
- set_irn_n(node, 0, mem); \
-}
-
-#define DIVOP(OP) \
-BINOP_MEM(OP) \
- \
-ir_mode *get_##OP##_resmode(const ir_node *node) { \
- assert(is_##OP(node)); \
- return node->attr.divmod.resmode; \
-} \
- \
-void set_##OP##_resmode(ir_node *node, ir_mode *mode) { \
- assert(is_##OP(node)); \
- node->attr.divmod.resmode = mode; \
-}
-
-
-BINOP(Add)
-BINOP(Borrow)
-BINOP(Carry)
-BINOP(Sub)
-UNOP(Minus)
-BINOP(Mul)
-BINOP(Mulh)
-DIVOP(Quot)
-DIVOP(DivMod)
-DIVOP(Div)
-DIVOP(Mod)
-UNOP(Abs)
-BINOP(And)
-BINOP(Or)
-BINOP(Eor)
-UNOP(Not)
-BINOP(Shl)
-BINOP(Shr)
-BINOP(Shrs)
-BINOP(Rotl)
-BINOP(Cmp)
-UNOP(Conv)
-UNOP(Cast)
-
-int get_Div_no_remainder(const ir_node *node)
-{
- assert(is_Div(node));
- return node->attr.divmod.no_remainder;
-}
-
-void set_Div_no_remainder(ir_node *node, int no_remainder)
-{
- assert(is_Div(node));
- node->attr.divmod.no_remainder = no_remainder;
-}
-
-int get_Conv_strict(const ir_node *node)
-{
- assert(is_Conv(node));
- return node->attr.conv.strict;
-}
-
-void set_Conv_strict(ir_node *node, int strict_flag)
-{
- assert(is_Conv(node));
- node->attr.conv.strict = (char)strict_flag;
-}
-
-ir_type *get_Cast_type(ir_node *node)
-{
- assert(is_Cast(node));
- return node->attr.cast.type;
-}
-
-void set_Cast_type(ir_node *node, ir_type *to_tp)
-{
- assert(is_Cast(node));
- node->attr.cast.type = to_tp;
-}
-
-
/* Checks for upcast.
*
* Returns true if the Cast node casts a class type to a super type.
set_irn_n(node, 1, ptr);
}
-ir_node *get_Load_mem(const ir_node *node)
+ir_volatility get_Load_volatility(const ir_node *node)
{
assert(is_Load(node));
- return get_irn_n(node, 0);
+ return node->attr.load.volatility;
}
-void set_Load_mem(ir_node *node, ir_node *mem)
+void set_Load_volatility(ir_node *node, ir_volatility volatility)
{
assert(is_Load(node));
- set_irn_n(node, 0, mem);
+ node->attr.load.volatility = volatility;
}
-ir_node *get_Load_ptr(const ir_node *node)
+ir_align get_Load_align(const ir_node *node)
{
assert(is_Load(node));
- return get_irn_n(node, 1);
+ return node->attr.load.aligned;
}
-void set_Load_ptr(ir_node *node, ir_node *ptr)
+void set_Load_align(ir_node *node, ir_align align)
{
assert(is_Load(node));
- set_irn_n(node, 1, ptr);
+ node->attr.load.aligned = align;
}
-ir_mode *get_Load_mode(const ir_node *node)
-{
- assert(is_Load(node));
- return node->attr.load.mode;
-}
-
-void set_Load_mode(ir_node *node, ir_mode *mode)
-{
- assert(is_Load(node));
- node->attr.load.mode = mode;
-}
-
-ir_volatility get_Load_volatility(const ir_node *node)
-{
- assert(is_Load(node));
- return node->attr.load.volatility;
-}
-
-void set_Load_volatility(ir_node *node, ir_volatility volatility)
-{
- assert(is_Load(node));
- node->attr.load.volatility = volatility;
-}
-
-ir_align get_Load_align(const ir_node *node)
-{
- assert(is_Load(node));
- return node->attr.load.aligned;
-}
-
-void set_Load_align(ir_node *node, ir_align align)
-{
- assert(is_Load(node));
- node->attr.load.aligned = align;
-}
-
-
-ir_node *get_Store_mem(const ir_node *node)
-{
- assert(is_Store(node));
- return get_irn_n(node, 0);
-}
-
-void set_Store_mem(ir_node *node, ir_node *mem)
-{
- assert(is_Store(node));
- set_irn_n(node, 0, mem);
-}
-
-ir_node *get_Store_ptr(const ir_node *node)
-{
- assert(is_Store(node));
- return get_irn_n(node, 1);
-}
-
-void set_Store_ptr(ir_node *node, ir_node *ptr)
-{
- assert(is_Store(node));
- set_irn_n(node, 1, ptr);
-}
-
-ir_node *get_Store_value(const ir_node *node)
-{
- assert(is_Store(node));
- return get_irn_n(node, 2);
-}
-
-void set_Store_value(ir_node *node, ir_node *value)
-{
- assert(is_Store(node));
- set_irn_n(node, 2, value);
-}
ir_volatility get_Store_volatility(const ir_node *node)
{
}
-ir_node *get_Alloc_mem(const ir_node *node)
-{
- assert(is_Alloc(node));
- return get_irn_n(node, 0);
-}
-
-void set_Alloc_mem(ir_node *node, ir_node *mem)
-{
- assert(is_Alloc(node));
- set_irn_n(node, 0, mem);
-}
-
-ir_node *get_Alloc_size(const ir_node *node)
-{
- assert(is_Alloc(node));
- return get_irn_n(node, 1);
-}
-
-void set_Alloc_size(ir_node *node, ir_node *size)
-{
- assert(is_Alloc(node));
- set_irn_n(node, 1, size);
-}
-
-ir_type *get_Alloc_type(ir_node *node)
-{
- assert(is_Alloc(node));
- return node->attr.alloc.type;
-}
-
-void set_Alloc_type(ir_node *node, ir_type *tp)
-{
- assert(is_Alloc(node));
- node->attr.alloc.type = tp;
-}
-
-ir_where_alloc get_Alloc_where(const ir_node *node)
-{
- assert(is_Alloc(node));
- return node->attr.alloc.where;
-}
-
-void set_Alloc_where(ir_node *node, ir_where_alloc where)
-{
- assert(is_Alloc(node));
- node->attr.alloc.where = where;
-}
-
-
-ir_node *get_Free_mem(const ir_node *node)
-{
- assert(is_Free(node));
- return get_irn_n(node, 0);
-}
-
-void set_Free_mem(ir_node *node, ir_node *mem)
-{
- assert(is_Free(node));
- set_irn_n(node, 0, mem);
-}
-
-ir_node *get_Free_ptr(const ir_node *node)
-{
- assert(is_Free(node));
- return get_irn_n(node, 1);
-}
-
-void set_Free_ptr(ir_node *node, ir_node *ptr)
-{
- assert(is_Free(node));
- set_irn_n(node, 1, ptr);
-}
-
-ir_node *get_Free_size(const ir_node *node)
-{
- assert(is_Free(node));
- return get_irn_n(node, 2);
-}
-
-void set_Free_size(ir_node *node, ir_node *size)
-{
- assert(is_Free(node));
- set_irn_n(node, 2, size);
-}
-
-ir_type *get_Free_type(ir_node *node)
-{
- assert(is_Free(node));
- return node->attr.free.type;
-}
-
-void set_Free_type(ir_node *node, ir_type *tp)
-{
- assert(is_Free(node));
- node->attr.free.type = tp;
-}
-
-ir_where_alloc get_Free_where(const ir_node *node)
-{
- assert(is_Free(node));
- return node->attr.free.where;
-}
-
-void set_Free_where(ir_node *node, ir_where_alloc where)
-{
- assert(is_Free(node));
- node->attr.free.where = where;
-}
-
ir_node **get_Sync_preds_arr(ir_node *node)
{
assert(is_Sync(node));
}
/* Returns the source language type of a Proj node. */
-ir_type *get_Proj_type(ir_node *n)
+ir_type *get_Proj_type(const ir_node *n)
{
ir_type *tp = firm_unknown_type;
ir_node *pred = get_Proj_pred(n);
return tp;
}
-ir_node *get_Proj_pred(const ir_node *node)
-{
- assert(is_Proj(node));
- return get_irn_n(node, 0);
-}
-
-void set_Proj_pred(ir_node *node, ir_node *pred)
-{
- assert(is_Proj(node));
- set_irn_n(node, 0, pred);
-}
-
long get_Proj_proj(const ir_node *node)
{
#ifdef INTERPROCEDURAL_VIEW
set_irn_n(node, pos, pred);
}
-ir_node *get_Id_pred(const ir_node *node)
-{
- assert(is_Id(node));
- return get_irn_n(node, 0);
-}
-
-void set_Id_pred(ir_node *node, ir_node *pred)
-{
- assert(is_Id(node));
- set_irn_n(node, 0, pred);
-}
-
-ir_node *get_Confirm_value(const ir_node *node)
-{
- assert(is_Confirm(node));
- return get_irn_n(node, 0);
-}
-
-void set_Confirm_value(ir_node *node, ir_node *value)
-{
- assert(is_Confirm(node));
- set_irn_n(node, 0, value);
-}
-
-ir_node *get_Confirm_bound(const ir_node *node)
-{
- assert(is_Confirm(node));
- return get_irn_n(node, 1);
-}
-
-void set_Confirm_bound(ir_node *node, ir_node *bound)
-{
- assert(is_Confirm(node));
- set_irn_n(node, 0, bound);
-}
-
-pn_Cmp get_Confirm_cmp(const ir_node *node)
-{
- assert(is_Confirm(node));
- return node->attr.confirm.cmp;
-}
-
-void set_Confirm_cmp(ir_node *node, pn_Cmp cmp)
-{
- assert(is_Confirm(node));
- node->attr.confirm.cmp = cmp;
-}
-
-ir_node *get_Filter_pred(ir_node *node)
-{
- assert(is_Filter(node));
- return node->in[1];
-}
-
-void set_Filter_pred(ir_node *node, ir_node *pred)
-{
- assert(is_Filter(node));
- node->in[1] = pred;
-}
-
-long get_Filter_proj(ir_node *node)
-{
- assert(is_Filter(node));
- return node->attr.filter.proj;
-}
-
-void set_Filter_proj(ir_node *node, long proj)
-{
- assert(is_Filter(node));
- node->attr.filter.proj = proj;
-}
-
/* Don't use get_irn_arity, get_irn_n in implementation as access
shall work independent of view!!! */
void set_Filter_cg_pred_arr(ir_node *node, int arity, ir_node ** in)
node->attr.filter.in_cg[pos + 1] = pred;
}
-int get_Filter_n_cg_preds(ir_node *node)
+int get_Filter_n_cg_preds(const ir_node *node)
{
assert(is_Filter(node) && node->attr.filter.in_cg);
return (ARR_LEN(node->attr.filter.in_cg) - 1);
}
-ir_node *get_Filter_cg_pred(ir_node *node, int pos)
+ir_node *get_Filter_cg_pred(const ir_node *node, int pos)
{
int arity;
assert(is_Filter(node) && node->attr.filter.in_cg &&
return node->attr.filter.in_cg[pos + 1];
}
-/* Mux support */
-ir_node *get_Mux_sel(const ir_node *node)
-{
- assert(is_Mux(node));
- return node->in[1];
-}
-
-void set_Mux_sel(ir_node *node, ir_node *sel)
-{
- assert(is_Mux(node));
- node->in[1] = sel;
-}
-
-ir_node *get_Mux_false(const ir_node *node)
-{
- assert(is_Mux(node));
- return node->in[2];
-}
-
-void set_Mux_false(ir_node *node, ir_node *ir_false)
-{
- assert(is_Mux(node));
- node->in[2] = ir_false;
-}
-
-ir_node *get_Mux_true(const ir_node *node)
-{
- assert(is_Mux(node));
- return node->in[3];
-}
-
-void set_Mux_true(ir_node *node, ir_node *ir_true)
-{
- assert(is_Mux(node));
- node->in[3] = ir_true;
-}
-
-/* CopyB support */
-ir_node *get_CopyB_mem(const ir_node *node)
-{
- assert(is_CopyB(node));
- return get_irn_n(node, 0);
-}
-
-void set_CopyB_mem(ir_node *node, ir_node *mem)
-{
- assert(node->op == op_CopyB);
- set_irn_n(node, 0, mem);
-}
-
-ir_node *get_CopyB_dst(const ir_node *node)
-{
- assert(is_CopyB(node));
- return get_irn_n(node, 1);
-}
-
-void set_CopyB_dst(ir_node *node, ir_node *dst)
-{
- assert(is_CopyB(node));
- set_irn_n(node, 1, dst);
-}
-
-ir_node *get_CopyB_src(const ir_node *node)
-{
- assert(is_CopyB(node));
- return get_irn_n(node, 2);
-}
-
-void set_CopyB_src(ir_node *node, ir_node *src)
-{
- assert(is_CopyB(node));
- set_irn_n(node, 2, src);
-}
-
-ir_type *get_CopyB_type(ir_node *node)
-{
- assert(is_CopyB(node));
- return node->attr.copyb.type;
-}
-
-void set_CopyB_type(ir_node *node, ir_type *data_type)
-{
- assert(is_CopyB(node) && data_type);
- node->attr.copyb.type = data_type;
-}
-
-
-ir_type *get_InstOf_type(ir_node *node)
-{
- assert(node->op == op_InstOf);
- return node->attr.instof.type;
-}
-
-void set_InstOf_type(ir_node *node, ir_type *type)
-{
- assert(node->op == op_InstOf);
- node->attr.instof.type = type;
-}
-
-ir_node *get_InstOf_store(const ir_node *node)
-{
- assert(node->op == op_InstOf);
- return get_irn_n(node, 0);
-}
-
-void set_InstOf_store(ir_node *node, ir_node *obj)
-{
- assert(node->op == op_InstOf);
- set_irn_n(node, 0, obj);
-}
-
-ir_node *get_InstOf_obj(const ir_node *node)
-{
- assert(node->op == op_InstOf);
- return get_irn_n(node, 1);
-}
-
-void set_InstOf_obj(ir_node *node, ir_node *obj)
-{
- assert(node->op == op_InstOf);
- set_irn_n(node, 1, obj);
-}
-
-/* Returns the memory input of a Raise operation. */
-ir_node *get_Raise_mem(const ir_node *node)
-{
- assert(is_Raise(node));
- return get_irn_n(node, 0);
-}
-
-void set_Raise_mem(ir_node *node, ir_node *mem)
-{
- assert(is_Raise(node));
- set_irn_n(node, 0, mem);
-}
-
-ir_node *get_Raise_exo_ptr(const ir_node *node)
-{
- assert(is_Raise(node));
- return get_irn_n(node, 1);
-}
-
-void set_Raise_exo_ptr(ir_node *node, ir_node *exo_ptr)
-{
- assert(is_Raise(node));
- set_irn_n(node, 1, exo_ptr);
-}
-
-/* Bound support */
-
-/* Returns the memory input of a Bound operation. */
-ir_node *get_Bound_mem(const ir_node *bound)
-{
- assert(is_Bound(bound));
- return get_irn_n(bound, 0);
-}
-
-void set_Bound_mem(ir_node *bound, ir_node *mem)
-{
- assert(is_Bound(bound));
- set_irn_n(bound, 0, mem);
-}
-
-/* Returns the index input of a Bound operation. */
-ir_node *get_Bound_index(const ir_node *bound)
-{
- assert(is_Bound(bound));
- return get_irn_n(bound, 1);
-}
-
-void set_Bound_index(ir_node *bound, ir_node *idx)
-{
- assert(is_Bound(bound));
- set_irn_n(bound, 1, idx);
-}
-
-/* Returns the lower bound input of a Bound operation. */
-ir_node *get_Bound_lower(const ir_node *bound)
-{
- assert(is_Bound(bound));
- return get_irn_n(bound, 2);
-}
-
-void set_Bound_lower(ir_node *bound, ir_node *lower)
-{
- assert(is_Bound(bound));
- set_irn_n(bound, 2, lower);
-}
-
-/* Returns the upper bound input of a Bound operation. */
-ir_node *get_Bound_upper(const ir_node *bound)
-{
- assert(is_Bound(bound));
- return get_irn_n(bound, 3);
-}
-
-void set_Bound_upper(ir_node *bound, ir_node *upper)
-{
- assert(is_Bound(bound));
- set_irn_n(bound, 3, upper);
-}
-
-/* Return the operand of a Pin node. */
-ir_node *get_Pin_op(const ir_node *pin)
-{
- assert(is_Pin(pin));
- return get_irn_n(pin, 0);
-}
-
-void set_Pin_op(ir_node *pin, ir_node *node)
-{
- assert(is_Pin(pin));
- set_irn_n(pin, 0, node);
-}
-
-/* Return the assembler text of an ASM pseudo node. */
-ident *get_ASM_text(const ir_node *node)
-{
- assert(is_ASM(node));
- return node->attr.assem.asm_text;
-}
-
-/* Return the number of input constraints for an ASM node. */
int get_ASM_n_input_constraints(const ir_node *node)
{
assert(is_ASM(node));
- return ARR_LEN(node->attr.assem.inputs);
+ return ARR_LEN(node->attr.assem.input_constraints);
}
-/* Return the input constraints for an ASM node. This is a flexible array. */
-const ir_asm_constraint *get_ASM_input_constraints(const ir_node *node)
-{
- assert(is_ASM(node));
- return node->attr.assem.inputs;
-}
-
-/* Return the number of output constraints for an ASM node. */
int get_ASM_n_output_constraints(const ir_node *node)
{
assert(is_ASM(node));
- return ARR_LEN(node->attr.assem.outputs);
-}
-
-/* Return the output constraints for an ASM node. */
-const ir_asm_constraint *get_ASM_output_constraints(const ir_node *node)
-{
- assert(is_ASM(node));
- return node->attr.assem.outputs;
+ return ARR_LEN(node->attr.assem.output_constraints);
}
-/* Return the number of clobbered registers for an ASM node. */
int get_ASM_n_clobbers(const ir_node *node)
{
assert(is_ASM(node));
- return ARR_LEN(node->attr.assem.clobber);
-}
-
-/* Return the list of clobbered registers for an ASM node. */
-ident **get_ASM_clobbers(const ir_node *node)
-{
- assert(is_ASM(node));
- return node->attr.assem.clobber;
+ return ARR_LEN(node->attr.assem.clobbers);
}
/* returns the graph of a node */
-ir_graph *get_irn_irg(const ir_node *node)
+ir_graph *(get_irn_irg)(const ir_node *node)
{
- /*
- * Do not use get_nodes_Block() here, because this
- * will check the pinned state.
- * However even a 'wrong' block is always in the proper
- * irg.
- */
- if (! is_Block(node))
- node = get_irn_n(node, -1);
- /* note that get_Block_irg() can handle Bad nodes */
- return get_Block_irg(node);
+ return _get_irn_irg(node);
}
}
}
-void skip_Id_and_store(ir_node **node)
-{
- ir_node *n = *node;
-
- if (!n || (n->op != op_Id)) return;
-
- /* Don't use get_Id_pred(): We get into an endless loop for
- self-referencing Ids. */
- *node = skip_Id(n);
-}
-
int (is_strictConv)(const ir_node *node)
{
return _is_strictConv(node);
case iro_Bad :
case iro_Unknown:
return node;
- default: ;
- assert(0 && "should not be reached");
- return NULL;
+ default:
+ panic("should not be reached");
}
}
case iro_DivMod: return get_DivMod_resmode(node);
case iro_Div : return get_Div_resmode(node);
case iro_Mod : return get_Mod_resmode(node);
- default: ;
- assert(0 && "should not be reached");
- return NULL;
+ default:
+ panic("should not be reached");
}
}
return _is_irn_forking(node);
}
-void (copy_node_attr)(const ir_node *old_node, ir_node *new_node)
+void (copy_node_attr)(ir_graph *irg, const ir_node *old_node, ir_node *new_node)
{
- _copy_node_attr(old_node, new_node);
+ _copy_node_attr(irg, old_node, new_node);
}
/* Return the type associated with the value produced by n
/* Gets the string representation of the jump prediction .*/
const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred)
{
-#define X(a) case a: return #a;
+#define X(a) case a: return #a
switch (pred) {
X(COND_JMP_PRED_NONE);
X(COND_JMP_PRED_TRUE);
#undef X
}
-/* Returns the conditional jump prediction of a Cond node. */
-cond_jmp_predicate (get_Cond_jmp_pred)(const ir_node *cond)
-{
- return _get_Cond_jmp_pred(cond);
-}
-
-/* Sets a new conditional jump prediction. */
-void (set_Cond_jmp_pred)(ir_node *cond, cond_jmp_predicate pred)
-{
- _set_Cond_jmp_pred(cond, pred);
-}
-
/** the get_type operation must be always implemented and return a firm type */
-static ir_type *get_Default_type(ir_node *n)
+static ir_type *get_Default_type(const ir_node *n)
{
(void) n;
return get_unknown_type();
}
/** Return the attribute type of a SymConst node if exists */
-static ir_type *get_SymConst_attr_type(ir_node *self)
+static ir_type *get_SymConst_attr_type(const ir_node *self)
{
symconst_kind kind = get_SymConst_kind(self);
if (SYMCONST_HAS_TYPE(kind))
}
/** Return the attribute entity of a SymConst node if exists */
-static ir_entity *get_SymConst_attr_entity(ir_node *self)
+static ir_entity *get_SymConst_attr_entity(const ir_node *self)
{
symconst_kind kind = get_SymConst_kind(self);
if (SYMCONST_HAS_ENT(kind))
}
/** the get_type_attr operation must be always implemented */
-static ir_type *get_Null_type(ir_node *n)
+static ir_type *get_Null_type(const ir_node *n)
{
(void) n;
return firm_unknown_type;
}
/** the get_entity_attr operation must be always implemented */
-static ir_entity *get_Null_ent(ir_node *n)
+static ir_entity *get_Null_ent(const ir_node *n)
{
(void) n;
return NULL;
{
switch (code) {
case iro_SymConst: ops->get_entity_attr = get_SymConst_attr_entity; break;
- case iro_Sel: ops->get_entity_attr = _get_Sel_entity; break;
+ case iro_Sel: ops->get_entity_attr = get_Sel_entity; break;
default:
/* not allowed to be NULL */
if (! ops->get_entity_attr)
projects / libfirm / blobdiff