/*
- * 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.
*
} else {
/* don't use get_nodes_block here, we allow turn_into_tuple for unpinned nodes */
ir_node *block = get_irn_n(node, -1);
- /* Allocate new array, don't free old in_array, it's on the obstack. */
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 the block back */
set_irn_n(node, -1, block);
}
}
*/
static void collect(ir_node *n, void *env) {
ir_node *pred;
+ (void) env;
if (is_Phi(n)) {
set_irn_link(n, get_irn_link(get_nodes_block(n)));
set_irn_link(new_block, phi);
set_irn_link(old_block, NULL);
while (phi) {
- if(get_nodes_block(phi) == old_block); /* @@@ inlinening chokes on phis that don't
- obey this condition. How do they get into
- the list??? Example: InterfaceIII */
set_nodes_block(phi, new_block);
phi = get_irn_link(phi);
}
set_optimize(rem_opt);
}
+
+/* kill a node by setting its predecessors to Bad and finally exchange the node by Bad itself. */
+void kill_node(ir_node *node) {
+ ir_graph *irg = get_irn_irg(node);
+ ir_node *bad = get_irg_bad(irg);
+ int i;
+
+ for (i = get_irn_arity(node) - 1; i >= -1; --i) {
+ set_irn_n(node, i, bad);
+ }
+ exchange(node, bad);
+}