BugFix: equivalent_node_Bound() was too greedy, reduced to a safe minimum (now mostly...

[libfirm] / ir / ir / irgmod.c

diff --git a/ir/ir/irgmod.c b/ir/ir/irgmod.c
index 88c5497..6a4039a 100644 (file)
--- a/ir/ir/irgmod.c
+++ b/ir/ir/irgmod.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 1995-2007 University of Karlsruhe.  All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
  *
  * This file is part of libFirm.
  *
@@ -52,13 +52,15 @@ void turn_into_tuple(ir_node *node, int arity) {
        if (get_irn_arity(node) == arity) {
                /* keep old array */
        } else {
-               ir_node *block = get_nodes_block(node);
-               /* Allocate new array, don't free old in_array, it's on the obstack. */
+               /* don't use get_nodes_block here, we allow turn_into_tuple for unpinned nodes */
+               ir_node *block = get_irn_n(node, -1);
                edges_node_deleted(node, current_ir_graph);
+               /* Allocate new array, don't free old in_array, it's on the obstack. */
                node->in = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity+1);
                /* clear the new in array, else edge_notify tries to delete garbage */
                memset(node->in, 0, (arity+1) * sizeof(node->in[0]));
-               set_nodes_block(node, block);
+               /* set the block back */
+               set_irn_n(node, -1, block);
        }
 }