{
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, n;
- int not_a_block = is_no_Block(res);
-
- INIT_LIST_HEAD(&res->edge_info.outs_head);
- if(!not_a_block)
- 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 = 0, n = arity + not_a_block; i < n; ++i)
- edges_notify_edge(res, i - not_a_block, 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;
}
ir_op *
-(get_irn_op)(const ir_node *node)
-{
+(get_irn_op)(const ir_node *node) {
return _get_irn_op(node);
}
/* should be private to the library: */
void
-set_irn_op (ir_node *node, ir_op *op)
-{
- assert (node);
- node->op = op;
+(set_irn_op)(ir_node *node, ir_op *op) {
+ _set_irn_op(node, op);
}
opcode
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 */
int
(get_Block_n_cfgpreds)(ir_node *node) {
- return get_Block_n_cfgpreds(node);
+ return _get_Block_n_cfgpreds(node);
}
ir_node *
(get_Block_cfgpred)(ir_node *node, int pos) {
- return get_Block_cfgpred(node, pos);
+ return _get_Block_cfgpred(node, pos);
}
void
}
ir_extblk *get_Block_extbb(const ir_node *block) {
+ ir_extblk *res;
assert(is_Block(block));
- return block->attr.block.extblk;
+ res = block->attr.block.extblk;
+ assert(res == NULL || is_ir_extbb(res));
+ return res;
}
void set_Block_extbb(ir_node *block, ir_extblk *extblk) {
assert(is_Block(block));
+ assert(extblk == NULL || is_ir_extbb(extblk));
block->attr.block.extblk = extblk;
}
-void
-set_Start_irg(ir_node *node, ir_graph *irg) {
- assert(node->op == op_Start);
- assert(is_ir_graph(irg));
- assert(0 && " Why set irg? -- use set_irn_irg");
-}
-
int
get_End_n_keepalives(ir_node *end) {
assert (end->op == op_End);
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, 1 + 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 ... */
}
/* Mux support */
ir_node *get_Mux_sel (ir_node *node) {
+ if (node->op == op_Psi) {
+ assert(get_irn_arity(node) == 3);
+ return get_Psi_cond(node, 0);
+ }
assert(node->op == op_Mux);
return node->in[1];
}
void set_Mux_sel (ir_node *node, ir_node *sel) {
- assert(node->op == op_Mux);
- node->in[1] = sel;
+ if (node->op == op_Psi) {
+ assert(get_irn_arity(node) == 3);
+ set_Psi_cond(node, 0, sel);
+ }
+ else {
+ assert(node->op == op_Mux);
+ node->in[1] = sel;
+ }
}
ir_node *get_Mux_false (ir_node *node) {
+ if (node->op == op_Psi) {
+ assert(get_irn_arity(node) == 3);
+ return get_Psi_default(node);
+ }
assert(node->op == op_Mux);
return node->in[2];
}
void set_Mux_false (ir_node *node, ir_node *ir_false) {
- assert(node->op == op_Mux);
- node->in[2] = ir_false;
+ if (node->op == op_Psi) {
+ assert(get_irn_arity(node) == 3);
+ set_Psi_default(node, ir_false);
+ }
+ else {
+ assert(node->op == op_Mux);
+ node->in[2] = ir_false;
+ }
}
ir_node *get_Mux_true (ir_node *node) {
+ if (node->op == op_Psi) {
+ assert(get_irn_arity(node) == 3);
+ return get_Psi_val(node, 0);
+ }
assert(node->op == op_Mux);
return node->in[3];
}
void set_Mux_true (ir_node *node, ir_node *ir_true) {
- assert(node->op == op_Mux);
- node->in[3] = ir_true;
+ if (node->op == op_Psi) {
+ assert(get_irn_arity(node) == 3);
+ set_Psi_val(node, 0, ir_true);
+ }
+ else {
+ assert(node->op == op_Mux);
+ node->in[3] = ir_true;
+ }
+}
+
+/* Psi support */
+ir_node *get_Psi_cond (ir_node *node, int pos) {
+ int num_conds = get_Psi_n_conds(node);
+ assert(node->op == op_Psi);
+ assert(pos < num_conds);
+ 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);
+ 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 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);
+ set_irn_n(node, 2 * pos + 1, val);
+}
+
+ir_node *get_Psi_default(ir_node *node) {
+ int def_pos = get_irn_arity(node) - 1;
+ assert(node->op == op_Psi);
+ 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);
+ set_irn_n(node, def_pos, val);
+}
+
+int (get_Psi_n_conds)(ir_node *node) {
+ return _get_Psi_n_conds(node);
}
/* CopyB support */
return _is_Sel(node);
}
+/* returns true if node is a Mux node or a Psi with only one condition. */
+int
+(is_Mux)(const ir_node *node) {
+ return _is_Mux(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)
{
projects / libfirm / blobdiff