X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbespillbelady.c;h=6b6c66096e07468c9f9f2ce06f255a0ab60962ff;hb=39d4311ea8a4f1bd78d1e0282d77d71f7ef4efdb;hp=c3e2508817670552d32edc727b002462f87132d3;hpb=63bea6c02bc23bdd1f63f2847bc180bdaeecb461;p=libfirm

diff --git a/ir/be/bespillbelady.c b/ir/be/bespillbelady.c
index c3e250881..6b6c66096 100644
--- a/ir/be/bespillbelady.c
+++ b/ir/be/bespillbelady.c
@@ -1,9 +1,28 @@
-/**
- * Author:      Daniel Grund, Matthias Braun
- * Date:        20.09.2005
- * Copyright:   (c) Universitaet Karlsruhe
- * Licence:     This file protected by GPL -  GNU GENERAL PUBLIC LICENSE.
+/*
+ * 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.
+ */
+
+/**
+ * @file
+ * @brief       Beladys spillalgorithm.
+ * @author      Daniel Grund, Matthias Braun
+ * @date        20.09.2005
+ * @version     $Id$
  */
 #ifdef HAVE_CONFIG_H
 #include "config.h"
@@ -24,9 +43,9 @@
 #include "xmalloc.h"
 
 #include "beutil.h"
-#include "bearch.h"
+#include "bearch_t.h"
 #include "bespillbelady.h"
-#include "beuses_t.h"
+#include "beuses.h"
 #include "besched_t.h"
 #include "beirgmod.h"
 #include "belive_t.h"
@@ -34,6 +53,8 @@
 #include "bechordal_t.h"
 #include "bespilloptions.h"
 #include "beloopana.h"
+#include "beirg_t.h"
+#include "bemodule.h"
 
 #define DBG_SPILL   1
 #define DBG_WSETS   2
@@ -445,7 +466,7 @@ static void compute_live_ins(ir_node *block, void *data) {
 	}
 
 	pressure            = be_get_loop_pressure(env->loop_ana, env->cls, loop);
-	assert(ARR_LEN(delayed) <= pressure);
+	assert(ARR_LEN(delayed) <= (signed)pressure);
 	free_slots          = env->n_regs - ARR_LEN(starters);
 	free_pressure_slots = env->n_regs - (pressure - ARR_LEN(delayed));
 	free_slots          = MIN(free_slots, free_pressure_slots);
@@ -666,7 +687,15 @@ next_value:
 	}
 }
 
-void be_spill_belady(be_irg_t *birg, const arch_register_class_t *cls) {
+/**
+ * Do spilling for a register class on a graph using the belady heuristic.
+ * In the transformed graph, the register pressure never exceeds the number
+ * of available registers.
+ *
+ * @param birg  The backend graph
+ * @param cls   The register class to spill
+ */
+static void be_spill_belady(be_irg_t *birg, const arch_register_class_t *cls) {
 	be_spill_belady_spill_env(birg, cls, NULL);
 }
 
@@ -701,7 +730,6 @@ void be_spill_belady_spill_env(be_irg_t *birg, const arch_register_class_t *cls,
 	} else {
 		env.senv = spill_env;
 	}
-	DEBUG_ONLY(be_set_spill_env_dbg_module(env.senv, dbg);)
 
 	be_clear_links(irg);
 	/* Decide which phi nodes will be spilled and place copies for them into the graph */