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

[libfirm] / ir / be / bespill.h

diff --git a/ir/be/bespill.h b/ir/be/bespill.h
index 5255113..dc6b475 100644 (file)
--- a/ir/be/bespill.h
+++ b/ir/be/bespill.h
@@ -1,20 +1,6 @@
 /*
- * Copyright (C) 1995-2008 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.
+ * Copyright (C) 2012 University of Karlsruhe.
  */
 
 /**
@@ -22,13 +8,11 @@
  * @brief       Option handling for spiller.
  * @author      Matthias Braun
  * @date        12.10.2006
- * @version     $Id$
  */
 #ifndef FIRM_BE_BESPILL_H
 #define FIRM_BE_BESPILL_H
 
 #include "bearch.h"
-#include "beirg.h"
 
 extern int be_coalesce_spill_slots;
 extern int be_do_remats;
@@ -40,10 +24,10 @@ typedef struct be_spiller_t {
        /**
         * The spill function.
         *
-        * @param birg  the graph to spill on
+        * @param irg   the graph to spill on
         * @param cls   the register class to spill
         */
-       void (*spill)(be_irg_t *birg, const arch_register_class_t *cls);
+       void (*spill)(ir_graph *irg, const arch_register_class_t *cls);
 } be_spiller_t;
 
 /**
@@ -58,16 +42,16 @@ void be_register_spiller(const char *name, be_spiller_t *spiller);
 /**
  * Execute the selected spill algorithm
  *
- * @param birg  the graph to spill on
+ * @param irg   the graph to spill on
  * @param cls   the register class to spill
  */
-void be_do_spill(be_irg_t *birg, const arch_register_class_t *cls);
+void be_do_spill(ir_graph *irg, const arch_register_class_t *cls);
 
 /**
  * Adds additional copies, so constraints needing additional registers to be
  * solved correctly induce the additional register pressure.
  */
-void be_pre_spill_prepare_constr(be_irg_t *birg,
+void be_pre_spill_prepare_constr(ir_graph *irg,
                                  const arch_register_class_t *cls);
 
 #endif