X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbera.h;h=a5798d6720bf1931066259107190a20429857fa6;hb=c6571686bfbfb3c87ae24ae1dc568e685d6cd49a;hp=5097c88d376de322a34dce0962c3430d1678692b;hpb=4d5c3365a58cba59993045a9e08e686d8ae079a7;p=libfirm

diff --git a/ir/be/bera.h b/ir/be/bera.h
index 5097c88d3..a5798d672 100644
--- a/ir/be/bera.h
+++ b/ir/be/bera.h
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 1995-2007 University of Karlsruhe.  All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
  *
  * This file is part of libFirm.
  *
@@ -18,42 +18,21 @@
  */
 
 /**
- * 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 _BERA_H
-#define _BERA_H
+#ifndef FIRM_BE_BERA_H
+#define FIRM_BE_BERA_H
 
-#include "firm_config.h"
+#include "irnode.h"
 
-#include <libcore/lc_timing.h>
-
-#include "firm_types.h"
-
-#include "be.h"
 #include "belive.h"
 #include "beirg.h"
-#include "bemodule.h"
-
-typedef struct {
-	lc_timer_t *t_prolog;      /**< timer for prolog */
-	lc_timer_t *t_epilog;      /**< timer for epilog */
-	lc_timer_t *t_live;        /**< timer for liveness calculation */
-	lc_timer_t *t_spill;       /**< timer for spilling */
-	lc_timer_t *t_spillslots;  /**< spillslot coalescing */
-	lc_timer_t *t_color;       /**< timer for graph coloring */
-	lc_timer_t *t_ifg;         /**< timer for building interference graph */
-	lc_timer_t *t_copymin;     /**< timer for copy minimization */
-	lc_timer_t *t_ssa;         /**< timer for ssa destruction */
-	lc_timer_t *t_verify;      /**< timer for verification runs */
-	lc_timer_t *t_other;       /**< timer for remaining stuff */
-} be_ra_timer_t;
-
-extern be_ra_timer_t *global_ra_timer;
 
 typedef struct be_ra_t {
-	void (*allocate)(be_irg_t *bi);   /**< allocate registers on a graph */
+	void (*allocate)(ir_graph *irg);   /**< allocate registers on a graph */
 } be_ra_t;
 
 void be_register_allocator(const char *name, be_ra_t *allocator);
@@ -61,31 +40,6 @@ void be_register_allocator(const char *name, be_ra_t *allocator);
 /**
  * Do register allocation with currently selected register allocator
  */
-void be_allocate_registers(be_irg_t *birg);
-
-/**
- * Check, if two values interfere.
- * @param lv Liveness information.
- * @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 be_lv_t *lv, const ir_node *a, const ir_node *b);
-
-/**
- * Check, if a value dominates the other one.
- * Note, that this function also considers 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.
- */
-int value_dominates(const ir_node *a, const ir_node *b);
-
-/**
- * Like value_dominates(), but the nodes have to be in the same block
- */
-int value_dominates_intrablock(const ir_node *a, const ir_node *b);
+void be_allocate_registers(ir_graph *irg);
 
-#endif /* _BERA_H */
+#endif