}
}
-void be_peephole_new_node(ir_node * nw)
-{
- be_liveness_introduce(lv, nw);
-}
-
/**
* must be called from peephole optimisations before a node will be killed
* and its users will be redirected to new_node.
be_peephole_before_exchange(old, nw);
sched_remove(old);
exchange(old, nw);
- be_peephole_new_node(nw);
+ be_liveness_introduce(lv, nw);
}
/**
*/
typedef void (*peephole_opt_func) (ir_node *node);
-/**
- * Notify the peephole phase about a newly added node, so it can update its
- * internal state. This is not needed for the new node, when
- * be_peephole_exchange() is used.
- * Note: Contrary to normal exchange you mustn't remove the node from the
- * schedule either before exchange. Exchange will do that for you.
- */
-void be_peephole_new_node(ir_node *nw);
-
/**
* When doing peephole optimisation use this function instead of plain
- * exchange(), so it can update its internal state. */
+ * exchange(), so it can update its internal state. This function also removes
+ * the old node from the schedule.
+ */
void be_peephole_exchange(ir_node *old, ir_node *nw);
/**