* @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;
* Note: It is allowed to use this function without being in a peephole
* optimization phase.
*/
-bool be_can_move_before(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