X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbera.h;h=fcab788da823ee204cafeb9257ae9f87b265947b;hb=8de03037b59f06f74adc8cf6dda0be7bd7f9a0b7;hp=cb0f5880937ba5c667d8c630113242b078544a55;hpb=ec76144ad07dbbd14127416c804be158c59fb2a5;p=libfirm

diff --git a/ir/be/bera.h b/ir/be/bera.h
index cb0f58809..fcab788da 100644
--- a/ir/be/bera.h
+++ b/ir/be/bera.h
@@ -1,48 +1,66 @@
+/*
+ * Copyright (C) 1995-2007 University of Karlsruhe.  All right reserved.
+ *
+ * This file is part of libFirm.
+ *
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
+ *
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
+ */
+
 /**
- * Register allocation functions.
- * @author Sebastian Hack
- * @date 13.1.2005
+ * @file
+ * @brief       Base routines for register allocation.
+ * @author      Sebastian Hack
+ * @date        13.01.2005
+ * @version     $Id$
  */
+#ifndef FIRM_BE_BERA_H
+#define FIRM_BE_BERA_H
 
-#ifndef _BERA_H
-#define _BERA_H
+#include <libcore/lc_timing.h>
 
-#include "firm_config.h"
+#include "irnode.h"
 
-#ifdef WITH_LIBCORE
-#include <libcore/lc_opts.h>
-#endif
+#include "belive.h"
+#include "beirg.h"
 
-#include "firm_types.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;
 
-#include "be.h"
+extern be_ra_timer_t *global_ra_timer;
 
-typedef struct {
-#ifdef WITH_LIBCORE
-	void (*register_options)(lc_opt_entry_t *grp);
-#endif
-	void (*allocate)(const be_irg_t *bi);
+typedef struct be_ra_t {
+	void (*allocate)(be_irg_t *bi);   /**< allocate registers on a graph */
 } be_ra_t;
 
-
+void be_register_allocator(const char *name, be_ra_t *allocator);
 
 /**
- * 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.
+ * Do register allocation with currently selected register allocator
  */
-int values_interfere(const ir_node *a, const ir_node *b);
+void be_allocate_registers(be_irg_t *birg);
 
-/**
- * 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);
+int (values_interfere)(const be_irg_t *birg, const ir_node *a, const ir_node *b);
 
-#endif /* _BERA_H */
+#endif /* FIRM_BE_BERA_H */