c.n1 = n2;
c.n2 = n1;
}
- set_insert(conflict_t, qn->conflicts, &c, sizeof(c), HASH_CONFLICT(c));
+ (void)set_insert(conflict_t, qn->conflicts, &c, sizeof(c), HASH_CONFLICT(c));
}
/**
ir_node **safe, **unsafe;
int i, o, safe_count, safe_costs, unsafe_count, *unsafe_costs;
bitset_t *curr, *best;
- size_t pos;
int next, curr_weight, best_weight = 0;
/* assign the nodes into two groups.
*/
static void ou_optimize(unit_t *ou)
{
- qnode_t *curr = NULL;
- qnode_t *tmp;
- const arch_register_req_t *req;
- bitset_t const* allocatable_regs;
- unsigned n_regs;
- unsigned idx;
- int i;
+ qnode_t *curr = NULL;
+ const arch_register_req_t *req;
+ bitset_t const* allocatable_regs;
+ unsigned n_regs;
+ unsigned idx;
+ int i;
DBG((dbg, LEVEL_1, "\tOptimizing unit:\n"));
for (i=0; i<ou->node_count; ++i)
*/
int co_solve_heuristic(copy_opt_t *co)
{
- unit_t *curr;
-
ASSERT_OU_AVAIL(co);
pinned_global = pset_new_ptr(SLOTS_PINNED_GLOBAL);