X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbespilldaemel.c;h=2950f690257673aa903e8a81557ab7a16a1ffcc7;hb=bb4b701ebadcf132a2a6637f41db3c845d51de78;hp=f1a1d0e78e4e700121f63a7fdccbfff66ae827b7;hpb=d2c1b0191844c3c23731158a153838d570dcd65a;p=libfirm

diff --git a/ir/be/bespilldaemel.c b/ir/be/bespilldaemel.c
index f1a1d0e78..2950f6902 100644
--- a/ir/be/bespilldaemel.c
+++ b/ir/be/bespilldaemel.c
@@ -23,7 +23,7 @@
  * @author      Matthias Braun
  * @date        20.09.2005
  * @version     $Id: bespillbelady.c 13913 2007-05-18 12:48:56Z matze $
- * @summary
+ * @brief
  *   This implements a naive spilling algorithm. It is designed to produce similar
  *   effects to the spill decisions produced by traditional graph coloring
  *   register allocators that spill while they are coloring the graph.
@@ -44,13 +44,13 @@
 #include "error.h"
 
 #include "beirg.h"
-#include "bespilloptions.h"
 #include "bespill.h"
+#include "bespillutil.h"
 #include "bemodule.h"
 #include "besched.h"
 #include "bearch.h"
 #include "be_t.h"
-#include "benode_t.h"
+#include "benode.h"
 #include "beirg.h"
 #include "belive.h"
 
@@ -221,7 +221,7 @@ static void do_spilling(ir_nodeset_t *live_nodes, ir_node *node)
 		cand_node = candidate->node;
 		++cand_idx;
 
-		if (arch_irn_is(cand_node, dont_spill))
+		if (arch_irn_is(skip_Proj_const(cand_node), dont_spill))
 			continue;
 
 		/* make sure the node is not an argument of the instruction */