* algorithm optimized for the 1-register case.
* @author Matthias Braun
* @date 26.03.2007
- * @version $Id$
*/
#ifndef FIRM_BE_BESTATE_H
#define FIRM_BE_BESTATE_H
#include "firm_types.h"
-#include "beirg.h"
#include "bearch.h"
/**
* This functions asserts that the state is switched to fullfill all state
* requirements of nodes.
*/
-void be_assure_state(be_irg_t *birg, const arch_register_t *reg, void *func_env,
+void be_assure_state(ir_graph *irg, const arch_register_t *reg, void *func_env,
create_spill_func spill_func,
create_reload_func reload_func);
-#endif /* FIRM_BE_BESTATE_H */
+#endif