{
ir_node *res;
size_t node_size = offsetof(ir_node, attr) + op->attr_size + firm_add_node_size;
- char *p;
+ char *p;
+ int i, is_bl;
assert(irg && op && mode);
p = obstack_alloc (irg->obst, node_size);
memset(p, 0, node_size);
- res = (ir_node *) (p + firm_add_node_size);
-
- res->kind = k_ir_node;
- res->op = op;
- res->mode = mode;
- res->visited = 0;
- res->link = NULL;
+ res = (ir_node *) (p + firm_add_node_size);
+
+ res->kind = k_ir_node;
+ res->op = op;
+ res->mode = mode;
+ res->visited = 0;
+ res->node_idx = irg_register_node_idx(irg, res);
+ res->link = NULL;
if (arity < 0) {
res->in = NEW_ARR_F (ir_node *, 1); /* 1: space for block */
} else {
res->node_nr = get_irp_new_node_nr();
#endif
-#if FIRM_EDGES_INPLACE
- {
- int i;
- int is_bl = is_Block(res);
-
- INIT_LIST_HEAD(&res->edge_info.outs_head);
- if(is_bl)
- INIT_LIST_HEAD(&res->attr.block.succ_head);
+ INIT_LIST_HEAD(&res->edge_info.outs_head);
+ is_bl = is_Block(res);
+ if (is_bl)
+ INIT_LIST_HEAD(&res->attr.block.succ_head);
- for (i = is_bl; i <= arity; ++i)
- edges_notify_edge(res, i - 1, res->in[i], NULL, irg);
- }
-#endif
+ for (i = is_bl; i <= arity; ++i)
+ edges_notify_edge(res, i - 1, res->in[i], NULL, irg);
hook_new_node(irg, res);
arr = &node->in;
}
- for (i = 0; i < arity; i++) {
- if (i < ARR_LEN(*arr)-1)
- edges_notify_edge(node, i, in[i], (*arr)[i+1], irg);
- else
- edges_notify_edge(node, i, in[i], NULL, irg);
+ for (i = 0; i < arity; i++) {
+ if (i < ARR_LEN(*arr)-1)
+ edges_notify_edge(node, i, in[i], (*arr)[i+1], irg);
+ else
+ edges_notify_edge(node, i, in[i], NULL, irg);
+ }
+ for(;i < ARR_LEN(*arr)-1; i++) {
+ edges_notify_edge(node, i, NULL, (*arr)[i+1], irg);
}
- for(;i < ARR_LEN(*arr)-1; i++) {
- edges_notify_edge(node, i, NULL, (*arr)[i+1], irg);
- }
- if (arity != ARR_LEN(*arr) - 1) {
+ if (arity != ARR_LEN(*arr) - 1) {
ir_node * block = (*arr)[0];
*arr = NEW_ARR_D(ir_node *, irg->obst, arity + 1);
(*arr)[0] = block;
get_irn_alloc_attr (ir_node *node)
{
assert (node->op == op_Alloc);
- return node->attr.a;
+ return node->attr.alloc;
}
free_attr
get_irn_free_attr (ir_node *node)
{
assert (node->op == op_Free);
- return node->attr.f;
+ return node->attr.free;
}
symconst_attr
get_irn_symconst_attr (ir_node *node)
{
assert (node->op == op_SymConst);
- return node->attr.i;
+ return node->attr.symc;
}
ir_type *
get_irn_sel_attr (ir_node *node)
{
assert (node->op == op_Sel);
- return node->attr.s;
+ return node->attr.sel;
}
int
return &node->attr;
}
+unsigned (get_irn_idx)(const ir_node *node) {
+ assert(is_ir_node(node));
+ return _get_irn_idx(node);
+}
+
+int get_irn_pred_pos(ir_node *node, ir_node *arg) {
+ int i;
+ for (i = get_irn_arity(node) - 1; i >= 0; i--) {
+ if (get_irn_n(node, i) == arg)
+ return i;
+ }
+ return -1;
+}
+
/** manipulate fields of individual nodes **/
/* this works for all except Block */
/* Test whether arbitrary node is frame pointer, i.e. Proj(pn_Start_P_frame_base)
* from Start. If so returns frame type, else Null. */
ir_type *is_frame_pointer(ir_node *n) {
- if ((get_irn_op(n) == op_Proj) &&
- (get_Proj_proj(n) == pn_Start_P_frame_base)) {
+ if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_frame_base)) {
ir_node *start = get_Proj_pred(n);
if (get_irn_op(start) == op_Start) {
return get_irg_frame_type(get_irn_irg(start));
/* Test whether arbitrary node is globals pointer, i.e. Proj(pn_Start_P_globals)
* from Start. If so returns global type, else Null. */
ir_type *is_globals_pointer(ir_node *n) {
- if ((get_irn_op(n) == op_Proj) &&
- (get_Proj_proj(n) == pn_Start_P_globals)) {
+ if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_globals)) {
ir_node *start = get_Proj_pred(n);
if (get_irn_op(start) == op_Start) {
return get_glob_type();
return NULL;
}
+/* Test whether arbitrary node is tls pointer, i.e. Proj(pn_Start_P_tls)
+ * from Start. If so returns tls type, else Null. */
+ir_type *is_tls_pointer(ir_node *n) {
+ if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_globals)) {
+ ir_node *start = get_Proj_pred(n);
+ if (get_irn_op(start) == op_Start) {
+ return get_tls_type();
+ }
+ }
+ return NULL;
+}
+
/* Test whether arbitrary node is value arg base, i.e. Proj(pn_Start_P_value_arg_base)
* from Start. If so returns 1, else 0. */
int is_value_arg_pointer(ir_node *n) {
void
add_End_keepalive (ir_node *end, ir_node *ka) {
- assert (end->op == op_End);
- ARR_APP1 (ir_node *, end->in, ka);
+ int l;
+ ir_graph *irg = get_irn_irg(end);
+
+ assert(end->op == op_End);
+ l = ARR_LEN(end->in);
+ ARR_APP1(ir_node *, end->in, ka);
+ edges_notify_edge(end, l - 1, end->in[l], NULL, irg);
}
void
set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
}
+/* Set new keep-alives */
+void set_End_keepalives(ir_node *end, int n, ir_node *in[]) {
+ int i;
+ ir_graph *irg = get_irn_irg(end);
+
+ /* notify that edges are deleted */
+ for (i = 1 + END_KEEPALIVE_OFFSET; i < ARR_LEN(end->in); ++i) {
+ edges_notify_edge(end, i, end->in[i], NULL, irg);
+ }
+ ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
+
+ for (i = 0; i < n; ++i) {
+ end->in[1 + END_KEEPALIVE_OFFSET + i] = in[i];
+ edges_notify_edge(end, END_KEEPALIVE_OFFSET + i, NULL, end->in[1 + END_KEEPALIVE_OFFSET + i], irg);
+ }
+}
+
void
free_End (ir_node *end) {
assert (end->op == op_End);
end->kind = k_BAD;
- DEL_ARR_F(end->in); /* GL @@@ tut nicht ! */
+ DEL_ARR_F(end->in);
end->in = NULL; /* @@@ make sure we get an error if we use the
in array afterwards ... */
}
cond_kind
get_Cond_kind (ir_node *node) {
assert (node->op == op_Cond);
- return node->attr.c.kind;
+ return node->attr.cond.kind;
}
void
set_Cond_kind (ir_node *node, cond_kind kind) {
assert (node->op == op_Cond);
- node->attr.c.kind = kind;
+ node->attr.cond.kind = kind;
}
long
get_Cond_defaultProj (ir_node *node) {
assert (node->op == op_Cond);
- return node->attr.c.default_proj;
+ return node->attr.cond.default_proj;
}
ir_node *
symconst_kind
get_SymConst_kind (const ir_node *node) {
assert (node->op == op_SymConst);
- return node->attr.i.num;
+ return node->attr.symc.num;
}
void
set_SymConst_kind (ir_node *node, symconst_kind num) {
assert (node->op == op_SymConst);
- node->attr.i.num = num;
+ node->attr.symc.num = num;
}
ir_type *
get_SymConst_type (ir_node *node) {
- assert ( (node->op == op_SymConst)
- && ( get_SymConst_kind(node) == symconst_type_tag
- || get_SymConst_kind(node) == symconst_size));
- return node->attr.i.sym.type_p = skip_tid(node->attr.i.sym.type_p);
+ assert( (node->op == op_SymConst)
+ && (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
+ return node->attr.symc.sym.type_p = skip_tid(node->attr.symc.sym.type_p);
}
void
set_SymConst_type (ir_node *node, ir_type *tp) {
- assert ( (node->op == op_SymConst)
- && ( get_SymConst_kind(node) == symconst_type_tag
- || get_SymConst_kind(node) == symconst_size));
- node->attr.i.sym.type_p = tp;
+ assert( (node->op == op_SymConst)
+ && (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
+ node->attr.symc.sym.type_p = tp;
}
ident *
get_SymConst_name (ir_node *node) {
assert ( (node->op == op_SymConst)
&& (get_SymConst_kind(node) == symconst_addr_name));
- return node->attr.i.sym.ident_p;
+ return node->attr.symc.sym.ident_p;
}
void
set_SymConst_name (ir_node *node, ident *name) {
assert ( (node->op == op_SymConst)
&& (get_SymConst_kind(node) == symconst_addr_name));
- node->attr.i.sym.ident_p = name;
+ node->attr.symc.sym.ident_p = name;
}
entity *get_SymConst_entity (ir_node *node) {
assert ( (node->op == op_SymConst)
&& (get_SymConst_kind (node) == symconst_addr_ent));
- return node->attr.i.sym.entity_p;
+ return node->attr.symc.sym.entity_p;
}
void set_SymConst_entity (ir_node *node, entity *ent) {
assert ( (node->op == op_SymConst)
&& (get_SymConst_kind(node) == symconst_addr_ent));
- node->attr.i.sym.entity_p = ent;
+ node->attr.symc.sym.entity_p = ent;
}
union symconst_symbol
get_SymConst_symbol (ir_node *node) {
assert (node->op == op_SymConst);
- return node->attr.i.sym;
+ return node->attr.symc.sym;
}
void
set_SymConst_symbol (ir_node *node, union symconst_symbol sym) {
assert (node->op == op_SymConst);
- //memcpy (&(node->attr.i.sym), sym, sizeof(type_or_id));
- node->attr.i.sym = sym;
+ node->attr.symc.sym = sym;
}
ir_type *
get_SymConst_value_type (ir_node *node) {
assert (node->op == op_SymConst);
- if (node->attr.i.tp) node->attr.i.tp = skip_tid(node->attr.i.tp);
- return node->attr.i.tp;
+ if (node->attr.symc.tp) node->attr.symc.tp = skip_tid(node->attr.symc.tp);
+ return node->attr.symc.tp;
}
void
set_SymConst_value_type (ir_node *node, ir_type *tp) {
assert (node->op == op_SymConst);
- node->attr.i.tp = tp;
+ node->attr.symc.tp = tp;
}
ir_node *
entity *
get_Sel_entity (ir_node *node) {
assert (node->op == op_Sel);
- return node->attr.s.ent;
+ return node->attr.sel.ent;
}
void
set_Sel_entity (ir_node *node, entity *ent) {
assert (node->op == op_Sel);
- node->attr.s.ent = ent;
+ node->attr.sel.ent = ent;
}
ir_node *
get_Mod_mem (ir_node *node) {
- assert (node->op == op_Mod);
+ assert(node->op == op_Mod);
return get_irn_n(node, 0);
}
void
set_Mod_mem (ir_node *node, ir_node *mem) {
- assert (node->op == op_Mod);
+ assert(node->op == op_Mod);
set_irn_n(node, 0, mem);
}
UNOP(Conv)
UNOP(Cast)
+int get_Conv_strict(ir_node *node) {
+ assert(node->op == op_Conv);
+ return node->attr.conv.strict;
+}
+
+void set_Conv_strict(ir_node *node, int strict_flag) {
+ assert(node->op == op_Conv);
+ node->attr.conv.strict = (char)strict_flag;
+}
+
ir_type *
get_Cast_type (ir_node *node) {
- assert (node->op == op_Cast);
+ assert(node->op == op_Cast);
return node->attr.cast.totype;
}
void
set_Cast_type (ir_node *node, ir_type *to_tp) {
- assert (node->op == op_Cast);
+ assert(node->op == op_Cast);
node->attr.cast.totype = to_tp;
}
ir_type *
get_Alloc_type (ir_node *node) {
assert (node->op == op_Alloc);
- return node->attr.a.type = skip_tid(node->attr.a.type);
+ return node->attr.alloc.type = skip_tid(node->attr.alloc.type);
}
void
set_Alloc_type (ir_node *node, ir_type *tp) {
assert (node->op == op_Alloc);
- node->attr.a.type = tp;
+ node->attr.alloc.type = tp;
}
where_alloc
get_Alloc_where (ir_node *node) {
assert (node->op == op_Alloc);
- return node->attr.a.where;
+ return node->attr.alloc.where;
}
void
set_Alloc_where (ir_node *node, where_alloc where) {
assert (node->op == op_Alloc);
- node->attr.a.where = where;
+ node->attr.alloc.where = where;
}
ir_type *
get_Free_type (ir_node *node) {
assert (node->op == op_Free);
- return node->attr.f.type = skip_tid(node->attr.f.type);
+ return node->attr.free.type = skip_tid(node->attr.free.type);
}
void
set_Free_type (ir_node *node, ir_type *tp) {
assert (node->op == op_Free);
- node->attr.f.type = tp;
+ node->attr.free.type = tp;
}
where_alloc
get_Free_where (ir_node *node) {
assert (node->op == op_Free);
- return node->attr.f.where;
+ return node->attr.free.where;
}
void
set_Free_where (ir_node *node, where_alloc where) {
assert (node->op == op_Free);
- node->attr.f.where = where;
+ node->attr.free.where = where;
}
-ir_node **
-get_Sync_preds_arr (ir_node *node) {
+ir_node **get_Sync_preds_arr (ir_node *node) {
assert (node->op == op_Sync);
return (ir_node **)&(get_irn_in(node)[1]);
}
-int
-get_Sync_n_preds (ir_node *node) {
- assert (node->op == op_Sync);
+int get_Sync_n_preds (ir_node *node) {
+ assert(node->op == op_Sync);
return (get_irn_arity(node));
}
/*
-void
-set_Sync_n_preds (ir_node *node, int n_preds) {
+void set_Sync_n_preds (ir_node *node, int n_preds) {
assert (node->op == op_Sync);
}
*/
-ir_node *
-get_Sync_pred (ir_node *node, int pos) {
- assert (node->op == op_Sync);
+ir_node *get_Sync_pred (ir_node *node, int pos) {
+ assert(node->op == op_Sync);
return get_irn_n(node, pos);
}
-void
-set_Sync_pred (ir_node *node, int pos, ir_node *pred) {
- assert (node->op == op_Sync);
+void set_Sync_pred (ir_node *node, int pos, ir_node *pred) {
+ assert(node->op == op_Sync);
set_irn_n(node, pos, pred);
}
+/* Add a new Sync predecessor */
+void add_Sync_pred (ir_node *node, ir_node *pred) {
+ int l;
+ ir_graph *irg = get_irn_irg(node);
+
+ assert(node->op == op_Sync);
+ l = ARR_LEN(node->in);
+ ARR_APP1(ir_node *, node->in, pred);
+ edges_notify_edge(node, l, node->in[l], NULL, irg);
+}
+
+/* Returns the source language type of a Proj node. */
ir_type *get_Proj_type(ir_node *n)
{
- ir_type *tp = NULL;
+ ir_type *tp = firm_unknown_type;
ir_node *pred = get_Proj_pred(n);
switch (get_irn_opcode(pred)) {
int num_conds = get_Psi_n_conds(node);
assert(node->op == op_Psi);
assert(pos < num_conds);
- return node->in[1 + 2 * pos];
+ return get_irn_n(node, 2 * pos);
}
void set_Psi_cond (ir_node *node, int pos, ir_node *cond) {
int num_conds = get_Psi_n_conds(node);
assert(node->op == op_Psi);
assert(pos < num_conds);
- node->in[1 + 2 * pos] = cond;
+ set_irn_n(node, 2 * pos, cond);
}
ir_node *get_Psi_val (ir_node *node, int pos) {
int num_vals = get_Psi_n_conds(node);
assert(node->op == op_Psi);
assert(pos < num_vals);
- return node->in[1 + 2 * pos + 1];
+ return get_irn_n(node, 2 * pos + 1);
}
void set_Psi_val (ir_node *node, int pos, ir_node *val) {
int num_vals = get_Psi_n_conds(node);
assert(node->op == op_Psi);
assert(pos < num_vals);
- node->in[1 + 2 * pos + 1] = val;
+ set_irn_n(node, 2 * pos + 1, val);
}
ir_node *get_Psi_default(ir_node *node) {
- int def_pos = get_irn_arity(node);
+ int def_pos = get_irn_arity(node) - 1;
assert(node->op == op_Psi);
- return node->in[def_pos];
+ return get_irn_n(node, def_pos);
}
void set_Psi_default(ir_node *node, ir_node *val) {
int def_pos = get_irn_arity(node);
assert(node->op == op_Psi);
- node->in[def_pos] = node;
+ set_irn_n(node, def_pos, val);
}
int (get_Psi_n_conds)(ir_node *node) {
ir_type *
get_InstOf_type (ir_node *node) {
assert (node->op = op_InstOf);
- return node->attr.io.type;
+ return node->attr.instof.type;
}
void
set_InstOf_type (ir_node *node, ir_type *type) {
assert (node->op = op_InstOf);
- node->attr.io.type = type;
+ node->attr.instof.type = type;
}
ir_node *
return _is_Mux(node);
}
+/* returns true if node is a Load node. */
+int
+(is_Load)(const ir_node *node) {
+ return _is_Load(node);
+}
+
+/* returns true if node is a Sync node. */
+int
+(is_Sync)(const ir_node *node) {
+ return _is_Sync(node);
+}
+
+/* returns true if node is a Confirm node. */
+int
+(is_Confirm)(const ir_node *node) {
+ return _is_Confirm(node);
+}
+
int
is_Proj (const ir_node *node) {
assert(node);
return _is_irn_keep(node);
}
+/* Returns non-zero for nodes that are machine operations. */
+int (is_irn_machine_op)(const ir_node *node) {
+ return _is_irn_machine_op(node);
+}
+
+/* Returns non-zero for nodes that are machine operands. */
+int (is_irn_machine_operand)(const ir_node *node) {
+ return _is_irn_machine_operand(node);
+}
+
+/* Returns non-zero for nodes that have the n'th user machine flag set. */
+int (is_irn_machine_user)(const ir_node *node, unsigned n) {
+ return _is_irn_machine_user(node, n);
+}
+
+
/* Gets the string representation of the jump prediction .*/
const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred)
{
/** Return the attribute type of a SymConst node if exists */
static ir_type *get_SymConst_attr_type(ir_node *self) {
symconst_kind kind = get_SymConst_kind(self);
- if (kind == symconst_type_tag || kind == symconst_size)
+ if (SYMCONST_HAS_TYPE(kind))
return get_SymConst_type(self);
return NULL;
}
/** Return the attribute entity of a SymConst node if exists */
static entity *get_SymConst_attr_entity(ir_node *self) {
symconst_kind kind = get_SymConst_kind(self);
- if (kind == symconst_addr_ent)
+ if (SYMCONST_HAS_ENT(kind))
return get_SymConst_entity(self);
return NULL;
}
projects / libfirm / blobdiff