* @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.
#include "besched.h"
#include "bearch.h"
#include "be_t.h"
-#include "benode_t.h"
+#include "benode.h"
#include "beirg.h"
#include "belive.h"
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 */