Fixed typos, improved docu

[libfirm] / ir / ir / irnode.c

diff --git a/ir/ir/irnode.c b/ir/ir/irnode.c
index fa8c19f..89740b4 100644 (file)
--- a/ir/ir/irnode.c
+++ b/ir/ir/irnode.c
@@ -130,18 +130,19 @@ new_ir_node (dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op, ir_mode *mo
 {
   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 = (ir_node *) (p + firm_add_node_size);
 
   res->kind     = k_ir_node;
   res->op       = op;
   res->mode     = mode;
   res->visited  = 0;
-  res->node_idx = get_irg_next_node_idx(irg);
+  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 */
@@ -158,20 +159,14 @@ new_ir_node (dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op, ir_mode *mo
   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);
+  is_bl = is_Block(res);
+  if (is_bl)
+    INIT_LIST_HEAD(&res->attr.block.succ_head);
 
-    INIT_LIST_HEAD(&res->edge_info.outs_head);
-    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);
 
@@ -569,6 +564,15 @@ unsigned (get_irn_idx)(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;
+}
+
 /** manipulate fields of individual nodes **/
 
 /* this works for all except Block */
@@ -779,8 +783,13 @@ get_End_keepalive(ir_node *end, int pos) {
 
 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, end->in[l], NULL, irg);
 }
 
 void
@@ -795,14 +804,14 @@ void set_End_keepalives(ir_node *end, int n, ir_node *in[]) {
   ir_graph *irg = get_irn_irg(end);
 
   /* notify that edges are deleted */
-  for (i = END_KEEPALIVE_OFFSET; i < ARR_LEN(end->in); ++i) {
-    edges_notify_edge(end, i, in[i], NULL, irg);
+  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 + END_KEEPALIVE_OFFSET);
+  ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
 
   for (i = 0; i < n; ++i) {
-    end->in[END_KEEPALIVE_OFFSET + i] = in[i];
-    edges_notify_edge(end, END_KEEPALIVE_OFFSET + i, NULL, end->in[END_KEEPALIVE_OFFSET + i], irg);
+    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);
   }
 }
 
@@ -1752,37 +1761,43 @@ set_Free_where (ir_node *node, where_alloc where) {
   node->attr.f.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);
+}
+
 ir_type *get_Proj_type(ir_node *n)
 {
   ir_type *tp   = NULL;
@@ -2028,40 +2043,40 @@ 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 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) {
@@ -2436,6 +2451,24 @@ int
   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);