+ return cand1->cost - cand2->cost;
+}
+
+static void spill_values(morgan_env_t *env, const loop_attr_t *loop_attr, int spills) {
+ const bitset_t *cand_bitset = loop_attr->livethrough_unused;
+ int candidatecount = bitset_popcnt(cand_bitset);
+ spillcandidate_t *candidates;
+ int i, c;
+ loop_edge_t *edge;
+
+ assert(spills <= candidatecount);
+
+ candidates = alloca(sizeof(candidates[0]) * candidatecount);
+
+ DBG((dbg, DBG_CHOOSE, "Candidates for loop %d\n", get_loop_loop_nr(loop_attr->loop)));
+ // build candidiatelist
+ c = 0;
+ bitset_foreach(cand_bitset, i) {
+ ir_node *node = get_idx_irn(env->irg, i);
+ candidates[c].node = node;
+ candidates[c].cost = 0;
+
+ 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));
+
+ c++;
+ }
+ assert(c == candidatecount);
+
+ // sort list
+ qsort(candidates, candidatecount, sizeof(candidates[0]), compare_spillcandidates);
+
+ // spill values
+ for(i = 0; i < spills; ++i) {
+ ir_node *to_spill = candidates[i].node;
+ DBG((dbg, DBG_CHOOSE, "Spilling %+F ", to_spill));
+
+ for(edge = set_first(loop_attr->out_edges); edge != NULL; edge = set_next(loop_attr->out_edges)) {
+ be_add_reload_on_edge(env->senv, to_spill, edge->block, edge->pos, env->cls, 1);
+ }
+ }
+}
+
+static int reduce_register_pressure_in_block(morgan_env_t *env, const ir_node* block, int loop_unused_spills_possible) {
+ ir_node *node;
+ int max_pressure;