* @author Matthias Braun
* @version $Id$
*/
-
#ifndef BEPEEPHOLE_H
#define BEPEEPHOLE_H
#include "beirg.h"
-#include "bearch_t.h"
+#include "bearch.h"
extern ir_node ***register_values;
-static INLINE ir_node *be_peephole_get_value(unsigned regclass_idx,
+static inline ir_node *be_peephole_get_value(unsigned regclass_idx,
unsigned register_idx)
{
return register_values[regclass_idx][register_idx];
}
-static INLINE ir_node *be_peephole_get_reg_value(const arch_register_t *reg)
+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);
void be_peephole_exchange(ir_node *old, ir_node *nw);
/**
- * Tries to optimize a beIncSp node with it's previous IncSP node.
+ * 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
*/
ir_node *be_peephole_IncSP_IncSP(ir_node *node);
+bool be_has_only_one_user(ir_node *node);
+
/**
* Do peephole optimisations. It traverses the schedule of all blocks in
* backward direction. The register_values variable indicates which (live)
* backend specific optimisations should be performed based on the
* register-liveness information.
*/
-void be_peephole_opt(be_irg_t *birg);
+void be_peephole_opt(ir_graph *irg);
#endif