return code;
}
-/**
- * Indicates, whether additional data can be registered to ir nodes.
- * If set to 1, this is not possible anymore.
- */
-static int forbid_new_data = 0;
-
-unsigned firm_add_node_size = 0;
-
-
-unsigned firm_register_additional_node_data(unsigned size)
-{
- assert(!forbid_new_data && "Too late to register additional node data");
-
- if (forbid_new_data)
- return 0;
-
- return firm_add_node_size += size;
-}
-
-
-void init_irnode(void)
-{
- /* Forbid the addition of new data to an ir node. */
- forbid_new_data = 1;
-}
-
-struct struct_align {
- char c;
- struct s {
- int i;
- float f;
- double d;
- } s;
-};
-
ir_node *new_ir_node(dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op,
ir_mode *mode, int arity, ir_node *const *in)
{
- ir_node *res;
- 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(irg);
assert(op);
assert(mode);
- p = (char*)obstack_alloc(irg->obst, node_size);
- memset(p, 0, node_size);
- res = (ir_node *)(p + add_node_size);
+
+ size_t const node_size = offsetof(ir_node, attr) + op->attr_size;
+ ir_node *const res = (ir_node*)OALLOCNZ(irg->obst, char, node_size);
res->kind = k_ir_node;
res->op = op;
res->in[0] = block;
set_irn_dbg_info(res, db);
- res->out = NULL;
res->node_nr = get_irp_new_node_nr();
for (i = 0; i < EDGE_KIND_LAST; ++i) {
}
/* don't put this into the for loop, arity is -1 for some nodes! */
- edges_notify_edge(res, -1, res->in[0], NULL, irg);
+ if (block != NULL)
+ edges_notify_edge(res, -1, block, NULL, irg);
for (i = 1; i <= arity; ++i)
edges_notify_edge(res, i - 1, res->in[i], NULL, irg);
hook_new_node(irg, res);
- if (get_irg_phase_state(irg) == phase_backend) {
+ if (irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
be_info_new_node(irg, res);
}
/* Call the hook */
hook_set_irn_n(node, pos, node->in[pos + 1], NULL);
+ /* update irg flags */
+ clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
+
return pos;
}
+static void del_irn_n(ir_node *node, int n)
+{
+ ir_graph *irg = get_irn_irg(node);
+
+ /* remove the edge */
+ ir_node *pred = node->in[n+1];
+ edges_notify_edge(node, n, NULL, pred, irg);
+
+ int arity = get_irn_arity(node);
+ if (n != arity-1) {
+ /* exchange with the last one */
+ ir_node *old = node->in[arity];
+ edges_notify_edge(node, arity-1, NULL, old, irg);
+ node->in[n+1] = old;
+ edges_notify_edge(node, n, old, NULL, irg);
+ }
+ ARR_SHRINKLEN(node->in, arity);
+
+ /* update irg flags */
+ clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
+}
+
void del_Sync_n(ir_node *n, int i)
{
- int arity = get_Sync_n_preds(n);
- ir_node *last_pred = get_Sync_pred(n, arity - 1);
- set_Sync_pred(n, i, last_pred);
- edges_notify_edge(n, arity - 1, NULL, last_pred, get_irn_irg(n));
- ARR_SHRINKLEN(get_irn_in(n), arity);
+ del_irn_n(n, i);
}
int (get_irn_deps)(const 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;
-}
-
ir_node *(get_nodes_block)(const ir_node *node)
{
return get_nodes_block_(node);
void set_nodes_block(ir_node *node, ir_node *block)
{
- assert(node->op != op_Block);
+ assert(!is_Block(node));
set_irn_n(node, -1, block);
}
void remove_End_keepalive(ir_node *end, ir_node *irn)
{
- int n = get_End_n_keepalives(end);
- ir_graph *irg;
-
+ int n = get_End_n_keepalives(end);
int idx = -1;
for (int i = n;;) {
if (i-- == 0)
/* find irn */
if (old_ka == irn) {
- idx = i;
+ idx = END_KEEPALIVE_OFFSET + i;
break;
}
}
- irg = get_irn_irg(end);
-
- /* remove the edge */
- edges_notify_edge(end, idx, NULL, irn, irg);
-
- if (idx != n - 1) {
- /* exchange with the last one */
- ir_node *old = end->in[1 + END_KEEPALIVE_OFFSET + n - 1];
- edges_notify_edge(end, n - 1, NULL, old, irg);
- end->in[1 + END_KEEPALIVE_OFFSET + idx] = old;
- edges_notify_edge(end, idx, old, NULL, irg);
- }
- /* now n - 1 keeps, 1 block input */
- ARR_RESIZE(ir_node *, end->in, (n - 1) + 1 + END_KEEPALIVE_OFFSET);
-
- /* update irg flags */
- clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
+ assert(idx != -1);
+ del_irn_n(end, idx);
}
void remove_End_Bads_and_doublets(ir_node *end)
if (is_Bad(ka) || is_NoMem(ka) || pset_new_contains(&keeps, ka)) {
changed = true;
- /* remove the edge */
- edges_notify_edge(end, idx, NULL, ka, irg);
-
- if (idx != n - 1) {
- /* exchange with the last one */
- ir_node *old = end->in[1 + END_KEEPALIVE_OFFSET + n - 1];
- edges_notify_edge(end, n - 1, NULL, old, irg);
- end->in[1 + END_KEEPALIVE_OFFSET + idx] = old;
- edges_notify_edge(end, idx, old, NULL, irg);
- }
+ del_irn_n(end, idx - END_KEEPALIVE_OFFSET);
--n;
} else {
pset_new_insert(&keeps, ka);
}
}
- /* n keeps, 1 block input */
- ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
-
pset_new_destroy(&keeps);
if (changed) {
}
}
-int (is_strictConv)(const ir_node *node)
-{
- return is_strictConv_(node);
-}
-
int (is_SymConst_addr_ent)(const ir_node *node)
{
return is_SymConst_addr_ent_(node);
return res;
}
+bool only_used_by_keepalive(const ir_node *node)
+{
+ foreach_out_edge(node, edge) {
+ ir_node *succ = get_edge_src_irn(edge);
+ if (is_End(succ))
+ continue;
+ if (is_Proj(succ) && only_used_by_keepalive(succ))
+ return true;
+ /* found a real user */
+ return false;
+ }
+ return true;
+}
+
/* include generated code */
#include "gen_irnode.c.inl"
projects / libfirm / blobdiff