besched: Change sched_foreach_from(sched_next(x), y) to sched_foreach_after(x, y).

[libfirm] / ir / be / bera.h

diff --git a/ir/be/bera.h b/ir/be/bera.h
index 92e8cf9..ee107fb 100644 (file)
--- a/ir/be/bera.h
+++ b/ir/be/bera.h
@@ -1,32 +1,28 @@
+/*
+ * This file is part of libFirm.
+ * Copyright (C) 2012 University of Karlsruhe.
+ */
+
 /**
- * Register allocation functions.
- * @author Sebastian Hack
- * @date 13.1.2005
+ * @file
+ * @brief       Base routines for register allocation.
+ * @author      Sebastian Hack
+ * @date        13.01.2005
  */
+#ifndef FIRM_BE_BERA_H
+#define FIRM_BE_BERA_H
 
-#ifndef _BERA_H
-#define _BERA_H
+#include "firm_types.h"
 
-#include "irnode.h"
+typedef struct be_ra_t {
+       void (*allocate)(ir_graph *irg);   /**< allocate registers on a graph */
+} be_ra_t;
 
-/**
- * Check, if two values interfere.
- * @param a The first value.
- * @param b The second value.
- * @return 1, if @p a and @p b interfere, 0 if not.
- */
-int values_interfere(const ir_node *a, const ir_node *b);
+void be_register_allocator(const char *name, be_ra_t *allocator);
 
 /**
- * Check, if a value dominates the other one.
- * Note, that this function also consideres the schedule and does thus
- * more than block_dominates().
- *
- * @param a The first.
- * @param b The second value.
- * @return 1 if a dominates b, 0 else.
+ * Do register allocation with currently selected register allocator
  */
-int value_dominates(const ir_node *a, const ir_node *b);
-
+void be_allocate_registers(ir_graph *irg);
 
-#endif /* _BERA_H */
+#endif