+static INLINE ir_node *be_peephole_get_reg_value(const arch_register_t *reg)
+{
+ unsigned regclass_idx = arch_register_class_index(arch_register_get_class(reg));
+ unsigned register_idx = arch_register_get_index(reg);
+
+ return be_peephole_get_value(regclass_idx, register_idx);
+}
+
+/**
+ * Datatype of the generic op handler for optimisation.
+ */
+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. */
+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. */
+void be_peephole_exchange(ir_node *old, ir_node *nw);
+
+/**
+ * Tries to optimize a beIncSp node with it's previous IncSP node.
+ * Must be run from a be_peephole_opt() context.
+ *
+ * @param node a be_IncSP node
+ *
+ * @return the new IncSP node or node itself
+ */
+ir_node *be_peephole_IncSP_IncSP(ir_node *node);
+
+/**
+ * Do peephole optimisations. It traverses the schedule of all blocks in
+ * backward direction. The register_values variable indicates which (live)
+ * values are stored in which register.
+ * The generic op handler is called for each node if it exists. That's where
+ * backend specific optimisations should be performed based on the
+ * register-liveness information.
+ */