} spillcandidate_t;
static int compare_spillcandidates(const void *d1, const void *d2) {
const spillcandidate_t *cand1 = d1;
const spillcandidate_t *cand2 = d2;
} spillcandidate_t;
static int compare_spillcandidates(const void *d1, const void *d2) {
const spillcandidate_t *cand1 = d1;
const spillcandidate_t *cand2 = d2;
candidates = alloca(sizeof(candidates[0]) * candidatecount);
DBG((dbg, DBG_CHOOSE, "Candidates for loop %d\n", get_loop_loop_nr(loop_attr->loop)));
candidates = alloca(sizeof(candidates[0]) * candidatecount);
DBG((dbg, DBG_CHOOSE, "Candidates for loop %d\n", get_loop_loop_nr(loop_attr->loop)));
c = 0;
bitset_foreach(cand_bitset, idx) {
ir_node *node = get_idx_irn(env->irg, idx);
candidates[c].node = node;
c = 0;
bitset_foreach(cand_bitset, idx) {
ir_node *node = get_idx_irn(env->irg, idx);
candidates[c].node = node;
for(edge = set_first(loop_attr->out_edges); edge != NULL; edge = set_next(loop_attr->out_edges)) {
candidates[c].cost += be_get_reload_costs_on_edge(env->senv, node, edge->block, edge->pos);
}
for(edge = set_first(loop_attr->out_edges); edge != NULL; edge = set_next(loop_attr->out_edges)) {
candidates[c].cost += be_get_reload_costs_on_edge(env->senv, node, edge->block, edge->pos);
}
- DBG((dbg, DBG_CHOOSE, "%+F has costs %d\n", node, candidates[c].cost));
+ DBG((dbg, DBG_CHOOSE, "%+F has costs %f\n", node, candidates[c].cost));