tv: Remove mul_table[][][] and simply use * and <<.

[libfirm] / ir / be / bepeephole.h

diff --git a/ir/be/bepeephole.h b/ir/be/bepeephole.h
index c31d66c..ac7d415 100644 (file)
--- a/ir/be/bepeephole.h
+++ b/ir/be/bepeephole.h
@@ -21,12 +21,10 @@
  * @file
  * @brief       peephole optimisation framework
  * @author      Matthias Braun
- * @version     $Id$
  */
 #ifndef BEPEEPHOLE_H
 #define BEPEEPHOLE_H
 
-#include "beirg.h"
 #include "bearch.h"
 
 extern ir_node **register_values;
@@ -75,14 +73,17 @@ bool be_has_only_one_user(ir_node *node);
 
 /**
  * In a scheduled program with registers assigned,
- * checks wether @p node can be moved before @p before without changing program
+ * 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_before(ir_heights_t *heights, const ir_node *node,
-                        const ir_node *before);
+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