* @brief First simple copy minimization heuristics.
* @author Daniel Grund
* @date 12.04.2005
- * @version $Id$
*
* Heuristic for minimizing copies using a queue which holds 'qnodes' not yet
* examined. A qnode has a 'target color', nodes out of the opt unit and
DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
+/** Defines an invalid register index. */
+#define NO_COLOR (-1)
+
#define SEARCH_FREE_COLORS
#define SLOTS_PINNED_GLOBAL 64
static int set_cmp_conflict_t(const void *x, const void *y, size_t size)
{
- const conflict_t *xx = x;
- const conflict_t *yy = y;
+ const conflict_t *xx = (const conflict_t*)x;
+ const conflict_t *yy = (const conflict_t*)y;
(void) size;
return xx->n1 != yy->n1 || xx->n2 != yy->n2;
c.n1 = n2;
c.n2 = n1;
}
- set_insert(qn->conflicts, &c, sizeof(c), HASH_CONFLICT(c));
+ (void)set_insert(conflict_t, qn->conflicts, &c, sizeof(c), HASH_CONFLICT(c));
}
/**
c.n1 = n2;
c.n2 = n1;
}
- return set_find(qn->conflicts, &c, sizeof(c), HASH_CONFLICT(c)) != 0;
+ return set_find(conflict_t, qn->conflicts, &c, sizeof(c), HASH_CONFLICT(c)) != 0;
}
static int set_cmp_node_stat_t(const void *x, const void *y, size_t size)
{
node_stat_t find;
find.irn = irn;
- return set_find(qn->changed_nodes, &find, sizeof(find), hash_irn(irn));
+ return set_find(node_stat_t, qn->changed_nodes, &find, sizeof(find), hash_irn(irn));
}
/**
find.irn = irn;
find.new_color = NO_COLOR;
find.pinned_local = 0;
- return set_insert(qn->changed_nodes, &find, sizeof(find), hash_irn(irn));
+ return set_insert(node_stat_t, qn->changed_nodes, &find, sizeof(find), hash_irn(irn));
}
/**
ir_node *sub_res, *curr;
be_ifg_t *ifg = chordal_env->ifg;
neighbours_iter_t iter;
-
+ const arch_register_req_t *req;
DBG((dbg, LEVEL_3, "\t %+F \tcaused col(%+F) \t%2d --> %2d\n", trigger, irn, irn_col, col));
return irn;
}
+ req = arch_get_irn_register_req(irn);
#ifdef SEARCH_FREE_COLORS
/* If we resolve conflicts (recursive calls) we can use any unused color.
* In case of the first call @p col must be used.
*/
if (irn != trigger) {
bitset_t *free_cols = bitset_alloca(cls->n_regs);
- const arch_register_req_t *req;
ir_node *curr;
int free_col;
bitset_copy(free_cols, co->cenv->allocatable_regs);
/* Exclude colors not assignable to the irn */
- req = arch_get_register_req_out(irn);
if (arch_register_req_is(req, limited)) {
bitset_t *limited = bitset_alloca(cls->n_regs);
rbitset_copy_to_bitset(req->limited, limited);
#endif /* SEARCH_FREE_COLORS */
/* If target color is not allocatable changing color is impossible */
- if (!arch_reg_out_is_allocatable(irn, arch_register_for_index(cls, col))) {
+ if (!arch_reg_is_allocatable(req, arch_register_for_index(cls, col))) {
DBG((dbg, LEVEL_3, "\t %+F impossible\n", irn));
return CHANGE_IMPOSSIBLE;
}
ir_node **safe, **unsafe;
int i, o, safe_count, safe_costs, unsafe_count, *unsafe_costs;
bitset_t *curr, *best;
- unsigned pos;
int next, curr_weight, best_weight = 0;
/* assign the nodes into two groups.
goto no_stable_set;
/* if we arrive here, we have a stable set */
- /* compute the weigth of the stable set*/
+ /* compute the weight of the stable set*/
curr_weight = 0;
bitset_foreach(curr, pos)
curr_weight += unsafe_costs[pos];
*/
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)
/* init queue */
INIT_LIST_HEAD(&ou->queue);
- req = arch_get_register_req_out(ou->nodes[0]);
+ req = arch_get_irn_register_req(ou->nodes[0]);
allocatable_regs = ou->co->cenv->allocatable_regs;
n_regs = req->cls->n_regs;
if (arch_register_req_is(req, limited)) {
/* apply the best found qnode */
if (curr->mis_size >= 2) {
- node_stat_t *ns;
int root_col = qnode_get_new_color(curr, ou->nodes[0]);
DBG((dbg, LEVEL_1, "\t Best color: %d Costs: %d << %d << %d\n", curr->color, ou->min_nodes_costs, ou->all_nodes_costs - curr->mis_costs, ou->all_nodes_costs));
/* globally pin root and all args which have the same color */
}
/* set color of all changed nodes */
- for (ns = set_first(curr->changed_nodes); ns; ns = set_next(curr->changed_nodes)) {
+ foreach_set(curr->changed_nodes, node_stat_t, ns) {
/* NO_COLOR is possible, if we had an undo */
if (ns->new_color != NO_COLOR) {
DBG((dbg, LEVEL_1, "\t color(%+F) := %d\n", ns->irn, ns->new_color));
- set_irn_col(ou->co, ns->irn, ns->new_color);
+ set_irn_col(ou->co->cls, ns->irn, ns->new_color);
}
}
}
*/
int co_solve_heuristic(copy_opt_t *co)
{
- unit_t *curr;
-
ASSERT_OU_AVAIL(co);
pinned_global = pset_new_ptr(SLOTS_PINNED_GLOBAL);
return 0;
}
-BE_REGISTER_MODULE_CONSTRUCTOR(be_init_copyheur);
+BE_REGISTER_MODULE_CONSTRUCTOR(be_init_copyheur)
void be_init_copyheur(void)
{
static co_algo_info copyheur = {
projects / libfirm / blobdiff