remove unnecessary members from be_abi_irg_t structure, cleanup beabi a bit

[libfirm] / ir / be / besched.c

diff --git a/ir/be/besched.c b/ir/be/besched.c
index 8e88f39..6fa533e 100644 (file)
--- a/ir/be/besched.c
+++ b/ir/be/besched.c
@@ -23,15 +23,10 @@
  * @author      Sebastian Hack
  * @version     $Id$
  */
-#ifdef HAVE_CONFIG_H
-# include "config.h"
-#endif
+#include "config.h"
 
-#ifdef HAVE_STDLIB_H
-# include <stdlib.h>
-#endif
+#include <stdlib.h>
 
-#include "impl.h"
 #include "irprintf.h"
 #include "irgwalk.h"
 #include "firm_types.h"
@@ -43,26 +38,11 @@
 #include "debug.h"
 
 #include "bemodule.h"
-#include "bearch_t.h"
-#include "besched_t.h"
+#include "bearch.h"
+#include "besched.h"
 #include "beutil.h"
 #include "belistsched.h"
-
-FIRM_IMPL1(have_sched_info, int, const ir_graph *)
-FIRM_IMPL1(sched_get_time_step, int, const ir_node *)
-FIRM_IMPL1(sched_has_next, int, const ir_node *)
-FIRM_IMPL1(sched_has_prev, int, const ir_node *)
-FIRM_IMPL1(sched_next, ir_node *, const ir_node *)
-FIRM_IMPL1(sched_prev, ir_node *, const ir_node *)
-FIRM_IMPL1(sched_is_scheduled, int, const ir_node *)
-FIRM_IMPL1(sched_first, ir_node *, const ir_node *)
-FIRM_IMPL1(sched_last, ir_node *, const ir_node *)
-FIRM_IMPL2_VOID(sched_add_after, const ir_node *, const ir_node *)
-FIRM_IMPL2_VOID(sched_add_before, const ir_node *, const ir_node *)
-FIRM_IMPL1_VOID(sched_init_block, const ir_node *)
-FIRM_IMPL1_VOID(sched_reset, const ir_node *)
-FIRM_IMPL2(sched_comes_after, int, const ir_node *, const ir_node *)
-FIRM_IMPL1_VOID(sched_remove, const ir_node *)
+#include "belive.h"
 
 size_t sched_irn_data_offset = 0;
 
@@ -84,14 +64,12 @@ void be_sched_dump(FILE *f, ir_graph *irg)
        irg_block_walk_graph(irg, block_sched_dumper, NULL, f);
 }
 
-/* Init the scheduling stuff. */
+BE_REGISTER_MODULE_CONSTRUCTOR(be_init_sched);
 void be_init_sched(void)
 {
        sched_irn_data_offset = firm_register_additional_node_data(sizeof(sched_info_t));
 }
 
-BE_REGISTER_MODULE_CONSTRUCTOR(be_init_sched);
-
 void sched_renumber(const ir_node *block)
 {
        ir_node *irn;
@@ -105,12 +83,14 @@ void sched_renumber(const ir_node *block)
        }
 }
 
-int sched_skip_cf_predicator(const ir_node *irn, void *data) {
-       arch_env_t *ae = data;
-       return arch_irn_class_is(ae, irn, branch);
+int sched_skip_cf_predicator(const ir_node *irn, void *data)
+{
+       (void)data;
+       return is_cfop(irn);
 }
 
-int sched_skip_phi_predicator(const ir_node *irn, void *data) {
+int sched_skip_phi_predicator(const ir_node *irn, void *data)
+{
        (void) data;
        return is_Phi(irn);
 }
@@ -169,21 +149,19 @@ static void remove_dead_nodes_walker(ir_node *block, void *data)
                if (bitset_is_set(env->reachable, get_irn_idx(node)))
                        continue;
 
-               if(env->lv)
+               if (env->lv)
                        be_liveness_remove(env->lv, node);
                sched_remove(node);
                kill_node(node);
        }
 }
 
-void be_remove_dead_nodes_from_schedule(be_irg_t *birg)
+void be_remove_dead_nodes_from_schedule(ir_graph *irg)
 {
-       ir_graph *irg = be_get_birg_irg(birg);
-
        remove_dead_nodes_env_t env;
        env.reachable = bitset_alloca(get_irg_last_idx(irg));
-       env.lv  = be_get_birg_liveness(birg);
-       env.irg = irg;
+       env.lv        = be_get_irg_liveness(irg);
+       env.irg       = irg;
 
        // mark all reachable nodes
        irg_walk_graph(irg, mark_dead_nodes_walker, NULL, &env);
@@ -192,23 +170,72 @@ void be_remove_dead_nodes_from_schedule(be_irg_t *birg)
        irg_block_walk_graph(irg, remove_dead_nodes_walker, NULL, &env);
 }
 
-static void *sched_irn_init(ir_phase *ph, const ir_node *irn, void *old)
+int (sched_get_time_step)(const ir_node *node)
+{
+       return _sched_get_time_step(node);
+}
+
+int (sched_has_next)(const ir_node *node)
 {
-       sched_info_t *info = old ? old : phase_alloc(ph, sizeof(*info));
+       return _sched_has_next(node);
+}
+
+int (sched_has_prev)(const ir_node *node)
+{
+       return _sched_has_prev(node);
+}
+
+ir_node *(sched_next)(const ir_node *node)
+{
+       return _sched_next(node);
+}
+
+ir_node *(sched_prev)(const ir_node *node)
+{
+       return _sched_prev(node);
+}
 
-       info->idx  = get_irn_idx(irn);
-       INIT_LIST_HEAD(&info->list);
-       info->scheduled = 0;
-       info->time_step = 0;
-       return info;
+int (sched_is_scheduled)(const ir_node *node)
+{
+       return _sched_is_scheduled(node);
+}
+
+ir_node *(sched_first)(const ir_node *node)
+{
+       return _sched_first(node);
+}
+
+ir_node *(sched_last)(const ir_node *node)
+{
+       return _sched_last(node);
+}
+
+void (sched_add_after)(ir_node *after, ir_node *node)
+{
+       _sched_add_after(after, node);
+}
+
+void (sched_add_before)(ir_node *before, ir_node *node)
+{
+       _sched_add_before(before, node);
+}
+
+void (sched_init_block)(ir_node *block)
+{
+       _sched_init_block(block);
+}
+
+void (sched_remove)(ir_node *node)
+{
+       _sched_remove(node);
 }
 
-void be_sched_init_phase(ir_graph *irg)
+void (sched_reset)(ir_node *node)
 {
-       init_irg_phase(irg, PHASE_BE_SCHED, 0, sched_irn_init);
+       _sched_reset(node);
 }
 
-void be_sched_free_phase(ir_graph *irg)
+int (sched_comes_after)(const ir_node *n1, const ir_node *n2)
 {
-       free_irg_phase(irg, PHASE_BE_SCHED);
+       return _sched_comes_after(n1, n2);
 }