waitq *best_starts = NULL;
col_cost_t *order = alloca(env->k * sizeof(order[0]));
bitset_t *visited;
- int col, idx, len, i;
+ int idx, len, i;
struct list_head changed_ones;
bitset_pos_t pos;
for (idx = 0, len = ARR_LEN(c->n); idx < len; ++idx) {
ir_node *irn = c->n[idx];
co_mst_irn_t *node = get_co_mst_irn(env, irn);
- int good = 0;
+ int good;
assert(! node->fixed && "Node must not have a fixed color.");
DB((dbg, LEVEL_4, "\t\tBringing %+F from color %d to color %d ...\n", irn, node->col, col));
one_good |= good;
did_all &= good;
- DB((dbg, LEVEL_4, "\t\t... %+F attempt from %d to %d %s\n", irn, node->col, col, one_good ? "succeeded" : "failed"));
+ DB((dbg, LEVEL_4, "\t\t... %+F attempt from %d to %d %s\n", irn, node->col, col, good ? "succeeded" : "failed"));
}
/* try next color when failed */