- Added 2 new blockschedulers, a greedy algorithm and an "optimal" ILP that

[libfirm] / ir / be / beuses.c

diff --git a/ir/be/beuses.c b/ir/be/beuses.c
index 559ebb8..9be130e 100644 (file)
--- a/ir/be/beuses.c
+++ b/ir/be/beuses.c
@@ -48,7 +48,7 @@ typedef struct _be_use_t {
 struct _be_uses_t {
        set *uses;
        ir_graph *irg;
-       const exec_freq_t *execfreqs;
+       const ir_exec_freq *execfreqs;
        const be_lv_t *lv;
        DEBUG_ONLY(firm_dbg_module_t *dbg;)
 };
@@ -95,7 +95,7 @@ unsigned be_get_next_use(be_uses_t *uses, const ir_node *from,
 
        if(skip_from_uses) {
                step++;
-               node = sched_next(node);
+               from = sched_next(from);
        }
 
        sched_foreach_from(from, node) {
@@ -159,7 +159,7 @@ unsigned be_get_next_use(be_uses_t *uses, const ir_node *from,
 #endif
 }
 
-be_uses_t *be_begin_uses(ir_graph *irg, const exec_freq_t *execfreqs, const be_lv_t *lv)
+be_uses_t *be_begin_uses(ir_graph *irg, const ir_exec_freq *execfreqs, const be_lv_t *lv)
 {
        be_uses_t *uses = xmalloc(sizeof(uses[0]));