* @brief Naive spilling algorithm
* @author Matthias Braun
* @date 20.09.2005
- * @version $Id: bespillbelady.c 13913 2007-05-18 12:48:56Z matze $
* @brief
* This implements a naive spilling algorithm. It is designed to produce
* similar effects to the spill decisions produced by traditional graph
static unsigned get_value_width(const ir_node *node)
{
- const arch_register_req_t *req = arch_get_register_req_out(node);
+ const arch_register_req_t *req = arch_get_irn_register_req(node);
return req->width;
}
if (n_regs == 0)
return;
- be_liveness_assure_sets(be_assure_liveness(irg));
+ be_assure_live_sets(irg);
spill_env = be_new_spill_env(irg);
cls = new_cls;
be_delete_spill_env(spill_env);
}
-BE_REGISTER_MODULE_CONSTRUCTOR(be_init_daemelspill);
+BE_REGISTER_MODULE_CONSTRUCTOR(be_init_daemelspill)
void be_init_daemelspill(void)
{
static be_spiller_t daemel_spiller = {