bepeephole: Inline be_peephole_new_node() into its only caller.

[libfirm] / ir / be / bepeephole.h

diff --git a/ir/be/bepeephole.h b/ir/be/bepeephole.h
index 1aeb422..26a53c3 100644 (file)
--- a/ir/be/bepeephole.h
+++ b/ir/be/bepeephole.h
@@ -1,16 +1,77 @@
+/*
+ * This file is part of libFirm.
+ * Copyright (C) 2012 University of Karlsruhe.
+ */
+
+/**
+ * @file
+ * @brief       peephole optimisation framework
+ * @author      Matthias Braun
+ */
 #ifndef BEPEEPHOLE_H
 #define BEPEEPHOLE_H
 
-#include "beirg.h"
+#include "bearch.h"
 
-extern ir_node ***register_values;
+extern ir_node **register_values;
 
-static inline ir_node *get_value_in_reg(unsigned regclass_idx,
-                                        unsigned register_idx)
+static inline ir_node *be_peephole_get_value(unsigned register_idx)
 {
-       return register_values[regclass_idx][register_idx];
+       return register_values[register_idx];
 }
 
-void be_peephole_opt(be_irg_t *birg);
+static inline ir_node *be_peephole_get_reg_value(const arch_register_t *reg)
+{
+       unsigned register_idx = reg->global_index;
+       return be_peephole_get_value(register_idx);
+}
+
+/**
+ * Datatype of the generic op handler for optimisation.
+ */
+typedef void (*peephole_opt_func) (ir_node *node);
+
+/**
+ * When doing peephole optimisation use this function instead of plain
+ * 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);
+
+/**
+ * Tries to optimize a beIncSp node with its 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);
+
+bool be_has_only_one_user(ir_node *node);
+
+/**
+ * In a scheduled program with registers assigned,
+ * checks whether @p node can be moved before @p before without changing program
+ * semantics.
+ *
+ * Note: It is allowed to use this function without being in a peephole
+ * optimization phase.
+ */
+bool be_can_move_down(ir_heights_t *heights, const ir_node *node,
+                      const ir_node *before);
+
+bool be_can_move_up(ir_heights_t *heights, const ir_node *node,
+                    const ir_node *after);
+
+/**
+ * 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.
+ */
+void be_peephole_opt(ir_graph *irg);
 
 #endif