#include "irbitset.h"
#include "error.h"
#include "list.h"
+#include "statev.h"
+
+#include "irbitset.h"
#include "bearch.h"
#include "beifg.h"
#define AFF_NEIGHBOUR_FIX_BENEFIT 128.0
#define NEIGHBOUR_CONSTR_COSTS 64.0
-#ifdef NDEBUG
-
-#define DBG_AFF_CHUNK(env, level, chunk)
-#define DBG_COL_COST(env, level, cost)
-#else
+#ifdef DEBUG_libfirm
-static firm_dbg_module_t *dbg = NULL;
#define DBG_AFF_CHUNK(env, level, chunk) do { if (firm_dbg_get_mask(dbg) & (level)) dbg_aff_chunk((env), (chunk)); } while(0)
#define DBG_COL_COST(env, level, cost) do { if (firm_dbg_get_mask(dbg) & (level)) dbg_col_cost((env), (cost)); } while(0)
+static firm_dbg_module_t *dbg = NULL;
+
+#else
+
+#define DBG_AFF_CHUNK(env, level, chunk)
+#define DBG_COL_COST(env, level, cost)
+
#endif
-static int last_chunk_id = 0;
+static int last_chunk_id = 0;
+static int recolor_limit = 4;
+static double dislike_influence = 0.1;
typedef struct _col_cost_t {
int col;
* An affinity chunk.
*/
typedef struct _aff_chunk_t {
- ir_node **n; /**< An ARR_F containing all nodes of the chunk. */
- bitset_t *nodes; /**< A bitset containing all nodes inside this chunk. */
- bitset_t *interfere; /**< A bitset containing all interfering neighbours of the nodes in this chunk. */
- int weight; /**< Weight of this chunk */
- unsigned weight_consistent : 1; /**< Set if the weight is consistent. */
- unsigned deleted : 1; /**< Set if the was deleted. */
- int id; /**< For debugging: An id of this chunk. */
+ ir_node **n; /**< An ARR_F containing all nodes of the chunk. */
+ bitset_t *nodes; /**< A bitset containing all nodes inside this chunk. */
+ bitset_t *interfere; /**< A bitset containing all interfering neighbours of the nodes in this chunk. */
+ int weight; /**< Weight of this chunk */
+ unsigned weight_consistent : 1; /**< Set if the weight is consistent. */
+ unsigned deleted : 1; /**< Set if the was deleted. */
+ int id; /**< For debugging: An id of this chunk. */
+ int visited;
+ col_cost_t *color_affinity;
} aff_chunk_t;
/**
be_ifg_t *ifg; /**< the interference graph */
const arch_env_t *aenv; /**< the arch environment */
copy_opt_t *co; /**< the copy opt object */
+ int chunk_visited;
+ col_cost_t **single_cols;
} co_mst_env_t;
/* stores coalescing related information for a node */
int tmp_col; /**< a temporary assigned color */
unsigned fixed : 1; /**< the color is fixed */
struct list_head list; /**< Queue for coloring undo. */
+ double constr_factor;
} co_mst_irn_t;
#define get_co_mst_irn(mst_env, irn) (phase_get_or_set_irn_data(&(mst_env)->ph, (irn)))
*/
static void dbg_col_cost(const co_mst_env_t *env, const col_cost_t *cost) {
int i;
- for (i = 0; i < env->n_regs; ++i) {
- if (cost[i].cost == COL_COST_INFEASIBLE)
- fprintf(stderr, " (%d, INF)", cost[i].col);
- else
- fprintf(stderr, " (%d, %.1f)", cost[i].col, cost[i].cost);
- }
+ for (i = 0; i < env->n_regs; ++i)
+ fprintf(stderr, " (%d, %.4f)", cost[i].col, cost[i].cost);
}
#endif /* DEBUG_libfirm */
}
/** compares to color-cost pairs */
-static int cmp_col_cost(const void *a, const void *b) {
+static __attribute__((unused)) int cmp_col_cost_lt(const void *a, const void *b) {
const col_cost_t *c1 = a;
const col_cost_t *c2 = b;
+ double diff = c1->cost - c2->cost;
+ return (diff > 0) - (diff < 0);
+}
- return c1->cost < c2->cost ? -1 : 1;
+static int cmp_col_cost_gt(const void *a, const void *b) {
+ const col_cost_t *c1 = a;
+ const col_cost_t *c2 = b;
+ double diff = c2->cost - c1->cost;
+ return (diff > 0) - (diff < 0);
}
/**
c->n = NEW_ARR_F(ir_node *, 0);
c->nodes = bitset_irg_malloc(env->co->irg);
c->interfere = bitset_irg_malloc(env->co->irg);
+ c->color_affinity = xmalloc(env->n_regs * sizeof(c->color_affinity[0]));
c->id = last_chunk_id++;
+ c->visited = 0;
pset_insert(env->chunkset, c, c->id);
return c;
}
pset_remove(env->chunkset, c, c->id);
bitset_free(c->nodes);
bitset_free(c->interfere);
+ xfree(c->color_affinity);
DEL_ARR_F(c->n);
c->deleted = 1;
free(c);
co_mst_irn_t *res = old ? old : phase_alloc(ph, sizeof(res[0]));
co_mst_env_t *env = ph->priv;
- if (res != old) {
+ if (!old) {
const arch_register_req_t *req;
void *nodes_it = be_ifg_nodes_iter_alloca(env->ifg);
ir_node *neigh;
/* exclude global ignore registers as well */
bitset_andnot(res->adm_colors, env->ignore_regs);
+ /* compute the constraint factor */
+ res->constr_factor = (double) (1 + env->n_regs - bitset_popcnt(res->adm_colors)) / env->n_regs;
+
/* set the number of interfering affinity neighbours to -1, they are calculated later */
res->int_aff_neigh = -1;
* @return 1 if there are interferences between nodes of c1 and c2, 0 otherwise.
*/
static INLINE int aff_chunks_interfere(co_mst_env_t *env, const aff_chunk_t *c1, const aff_chunk_t *c2) {
- bitset_t *tmp;
-
+ (void) env;
if (c1 == c2)
return 0;
/* check if there is a node in c2 having an interfering neighbor in c1 */
- tmp = bitset_alloca(get_irg_last_idx(env->co->irg));
- tmp = bitset_copy(tmp, c1->interfere);
- tmp = bitset_and(tmp, c2->nodes);
-
- return bitset_popcnt(tmp) > 0;
+ return bitset_intersect(c1->interfere, c2->nodes);
}
/**
aff_chunk_t *c1 = get_aff_chunk(env, src);
aff_chunk_t *c2 = get_aff_chunk(env, tgt);
-#ifndef NDEBUG
+#ifdef DEBUG_libfirm
DB((dbg, LEVEL_4, "Attempt to let c1 (id %d): ", c1 ? c1->id : -1));
if (c1) {
DBG_AFF_CHUNK(env, LEVEL_4, c1);
} else if (c1 != c2 && ! aff_chunks_interfere(env, c1, c2)) {
int idx, len;
- for (idx = 0, len = ARR_LEN(c2->n); idx < len; ++idx) {
- ir_node *n = c2->n[idx];
- co_mst_irn_t *mn = get_co_mst_irn(env, n);
-
- mn->chunk = c1;
+ for (idx = 0, len = ARR_LEN(c2->n); idx < len; ++idx)
+ aff_chunk_add_node(c1, get_co_mst_irn(env, c2->n[idx]));
- if (! bitset_is_set(c1->nodes, get_irn_idx(n)))
- ARR_APP1(ir_node *, c1->n, n);
- }
-
- bitset_or(c1->nodes, c2->nodes);
bitset_or(c1->interfere, c2->interfere);
c1->weight_consistent = 0;
/**
* Assures that the weight of the given chunk is consistent.
*/
-static void aff_chunk_assure_weight(const co_mst_env_t *env, aff_chunk_t *c) {
+static void aff_chunk_assure_weight(co_mst_env_t *env, aff_chunk_t *c) {
if (! c->weight_consistent) {
int w = 0;
- int idx, len;
+ int idx, len, i;
+
+ for (i = 0; i < env->n_regs; ++i) {
+ c->color_affinity[i].col = i;
+ c->color_affinity[i].cost = 0.0;
+ }
for (idx = 0, len = ARR_LEN(c->n); idx < len; ++idx) {
- ir_node *n = c->n[idx];
- const affinity_node_t *an = get_affinity_info(env->co, n);
+ ir_node *n = c->n[idx];
+ const affinity_node_t *an = get_affinity_info(env->co, n);
+ co_mst_irn_t *node = get_co_mst_irn(env, n);
+
+ node->chunk = c;
+ if (node->constr_factor > 0.0) {
+ bitset_pos_t col;
+ bitset_foreach (node->adm_colors, col)
+ c->color_affinity[col].cost += node->constr_factor;
+ }
if (an != NULL) {
neighb_t *neigh;
}
}
+ for (i = 0; i < env->n_regs; ++i)
+ c->color_affinity[i].cost *= (1.0 / ARR_LEN(c->n));
+
c->weight = w;
+ // c->weight = bitset_popcnt(c->nodes);
c->weight_consistent = 1;
}
}
* these weights are pure hackery ;-).
* It's not chriswue's fault but mine.
*/
- edge.weight = (double)neigh->costs / (double)(1 + n1->int_aff_neigh + n2->int_aff_neigh);
+ edge.weight = neigh->costs;
ARR_APP1(aff_edge_t, edges, edge);
}
}
DEL_ARR_F(edges);
}
+static __attribute__((unused)) void chunk_order_nodes(co_mst_env_t *env, aff_chunk_t *chunk)
+{
+ pqueue *grow = new_pqueue();
+ int i;
+ int max_weight = 0;
+ ir_node *max_node = NULL;
+
+ for (i = ARR_LEN(chunk->n) - 1; i >= 0; i--) {
+ ir_node *irn = chunk->n[i];
+ affinity_node_t *an = get_affinity_info(env->co, irn);
+ int w = 0;
+ neighb_t *neigh;
+
+ if (arch_irn_is(env->aenv, irn, ignore))
+ continue;
+
+ if (an) {
+ co_gs_foreach_neighb(an, neigh)
+ w += neigh->costs;
+
+ if (w > max_weight) {
+ max_weight = w;
+ max_node = irn;
+ }
+ }
+ }
+
+ if (max_node) {
+ bitset_t *visited = bitset_irg_malloc(env->co->irg);
+
+ for (i = ARR_LEN(chunk->n) - 1; i >= 0; --i)
+ bitset_add_irn(visited, chunk->n[i]);
+
+ pqueue_put(grow, max_node, max_weight);
+ bitset_remv_irn(visited, max_node);
+ i = 0;
+ while (!pqueue_empty(grow)) {
+ ir_node *irn = pqueue_get(grow);
+ affinity_node_t *an = get_affinity_info(env->co, irn);
+ neighb_t *neigh;
+
+ if (arch_irn_is(env->aenv, irn, ignore))
+ continue;
+
+ assert(i <= ARR_LEN(chunk->n));
+ chunk->n[i++] = irn;
+
+ assert(an);
+
+ /* build the affinity edges */
+ co_gs_foreach_neighb(an, neigh) {
+ co_mst_irn_t *node = get_co_mst_irn(env, neigh->irn);
+
+ if (bitset_contains_irn(visited, node->irn)) {
+ pqueue_put(grow, neigh->irn, neigh->costs);
+ bitset_remv_irn(visited, node->irn);
+ }
+ }
+ }
+
+ del_pqueue(grow);
+ bitset_free(visited);
+ }
+}
+
/**
* Greedy collect affinity neighbours into thew new chunk @p chunk starting at node @p node.
*/
return best;
}
-/**
- * Initializes an array of color-cost pairs.
- * Sets forbidden colors to costs COL_COST_INFEASIBLE and all others to @p c.
- */
-static INLINE void col_cost_init(co_mst_env_t *env, col_cost_t *cost, double c) {
- int i;
-
- for (i = 0; i < env->n_regs; ++i) {
- cost[i].col = i;
- if (bitset_is_set(env->ignore_regs, i))
- cost[i].cost = COL_COST_INFEASIBLE;
- else
- cost[i].cost = c;
- }
-}
-
-/**
- * Initializes an array of color-cost pairs.
- * Sets all colors except color @p col to COL_COST_INFEASIBLE and @p col to 0.0
- */
-static INLINE void col_cost_init_single(co_mst_env_t *env, col_cost_t *cost, int col) {
- assert(! bitset_is_set(env->ignore_regs, col) && "Attempt to use forbidden color.");
- col_cost_init(env, cost, COL_COST_INFEASIBLE);
- cost[col].col = 0;
- cost[0].col = col;
- cost[0].cost = 0.0;
-}
-
/**
* Resets the temporary fixed color of all nodes within wait queue @p nodes.
* ATTENTION: the queue is empty after calling this function!
assert(!node->fixed);
assert(node->tmp_col < 0);
assert(node->list.next == &node->list && node->list.prev == &node->list);
+ assert(bitset_is_set(node->adm_colors, col));
list_add_tail(&node->list, changed);
node->tmp_col = col;
* Determines the costs for each color if it would be assigned to node @p node.
*/
static void determine_color_costs(co_mst_env_t *env, co_mst_irn_t *node, col_cost_t *costs) {
- affinity_node_t *an = get_affinity_info(env->co, node->irn);
- neighb_t *aff_neigh;
- bitset_pos_t idx;
- int i;
-
- col_cost_init(env, costs, 0.0);
-
- /* calculate (negative) costs for affinity neighbours */
- if (an != NULL) {
- co_gs_foreach_neighb(an, aff_neigh) {
- ir_node *m = aff_neigh->irn;
- co_mst_irn_t *neigh;
- double c;
-
- /* skip ignore nodes */
- if (arch_irn_is(env->aenv, m, ignore))
- continue;
-
- neigh = get_co_mst_irn(env, m);
- c = (double)aff_neigh->costs;
+ int *neigh_cols = alloca(env->n_regs * sizeof(*neigh_cols));
+ int n_loose = 0;
+ double coeff;
+ int i;
- /* calculate costs for fixed affinity neighbours */
- if (!is_loose(neigh)) {
- int col = get_mst_irn_col(neigh);
- costs[col].cost -= c * AFF_NEIGHBOUR_FIX_BENEFIT;
- }
- }
+ for (i = 0; i < env->n_regs; ++i) {
+ neigh_cols[i] = 0;
+ costs[i].col = i;
+ costs[i].cost = bitset_is_set(node->adm_colors, i) ? node->constr_factor : 0.0;
}
- /* calculate (positive) costs for interfering neighbours */
for (i = 0; i < node->n_neighs; ++i) {
- co_mst_irn_t *neigh;
- int col, col_cnt;
- ir_node *int_neigh;
-
- int_neigh = node->int_neighs[i];
-
- /* skip ignore nodes */
- if (arch_irn_is(env->aenv, int_neigh, ignore))
- continue;
-
- neigh = get_co_mst_irn(env, int_neigh);
- col = get_mst_irn_col(neigh);
- col_cnt = bitset_popcnt(neigh->adm_colors);
-
- if (!is_loose(neigh)) {
- /* colors of fixed interfering neighbours are infeasible */
- costs[col].cost = COL_COST_INFEASIBLE;
- }
- else if (col_cnt < env->k) {
- /* calculate costs for constrained interfering neighbours */
- double ratio = 1.0 - ((double)col_cnt / (double)env->k);
-
- bitset_foreach_clear(neigh->adm_colors, idx) {
- /* check only explicitly forbidden colors (skip global forbidden ones) */
- if (! bitset_is_set(env->ignore_regs, idx)) {
- costs[col].cost += ratio * NEIGHBOUR_CONSTR_COSTS;
- }
- }
+ co_mst_irn_t *n = get_co_mst_irn(env, node->int_neighs[i]);
+ int col = get_mst_irn_col(n);
+ if (is_loose(n)) {
+ ++n_loose;
+ ++neigh_cols[col];
}
- DB((dbg, LEVEL_4, "\tneigh %+F, loose: %d, color: %d\n", int_neigh, is_loose(neigh), col));
+ else
+ costs[col].cost = 0.0;
}
- /* set all not admissible colors to COL_COST_INFEASIBLE */
- bitset_foreach_clear(node->adm_colors, idx)
- costs[idx].cost = COL_COST_INFEASIBLE;
+ if (n_loose > 0) {
+ coeff = 1.0 / n_loose;
+ for (i = 0; i < env->n_regs; ++i)
+ costs[i].cost *= 1.0 - coeff * neigh_cols[i];
+ }
}
/* need forward declaration due to recursive call */
-static int recolor_nodes(co_mst_env_t *env, co_mst_irn_t *node, col_cost_t *costs, struct list_head *changed_ones);
+static int recolor_nodes(co_mst_env_t *env, co_mst_irn_t *node, col_cost_t *costs, struct list_head *changed_ones, int depth, int *max_depth, int *trip);
/**
* Tries to change node to a color but @p explude_col.
* @return 1 if succeeded, 0 otherwise.
*/
-static int change_node_color_excluded(co_mst_env_t *env, co_mst_irn_t *node, int exclude_col, struct list_head *changed_ones) {
+static int change_node_color_excluded(co_mst_env_t *env, co_mst_irn_t *node, int exclude_col, struct list_head *changed, int depth, int *max_depth, int *trip) {
int col = get_mst_irn_col(node);
int res = 0;
/* neighbours has already a different color -> good, temporary fix it */
if (col != exclude_col) {
if (is_loose(node))
- set_temp_color(node, col, changed_ones);
+ set_temp_color(node, col, changed);
return 1;
}
determine_color_costs(env, node, costs);
/* Since the node must not have the not_col, set the costs for that color to "infinity" */
- costs[exclude_col].cost = COL_COST_INFEASIBLE;
+ costs[exclude_col].cost = 0.0;
/* sort the colors according costs, cheapest first. */
- qsort(costs, env->n_regs, sizeof(costs[0]), cmp_col_cost);
+ qsort(costs, env->n_regs, sizeof(costs[0]), cmp_col_cost_gt);
/* Try recoloring the node using the color list. */
- res = recolor_nodes(env, node, costs, changed_ones);
+ res = recolor_nodes(env, node, costs, changed, depth + 1, max_depth, trip);
}
return res;
* ATTENTION: Expect @p costs already sorted by increasing costs.
* @return 1 if coloring could be applied, 0 otherwise.
*/
-static int recolor_nodes(co_mst_env_t *env, co_mst_irn_t *node, col_cost_t *costs, struct list_head *changed_ones) {
+static int recolor_nodes(co_mst_env_t *env, co_mst_irn_t *node, col_cost_t *costs, struct list_head *changed, int depth, int *max_depth, int *trip) {
int i;
struct list_head local_changed;
- DBG((dbg, LEVEL_1, "\tRecoloring %+F with color-costs", node->irn));
- DBG_COL_COST(env, LEVEL_1, costs);
- DB((dbg, LEVEL_1, "\n"));
+ ++*trip;
+ if (depth > *max_depth)
+ *max_depth = depth;
+
+ if (depth >= recolor_limit)
+ return 0;
+
+ DBG((dbg, LEVEL_4, "\tRecoloring %+F with color-costs", node->irn));
+ DBG_COL_COST(env, LEVEL_4, costs);
+ DB((dbg, LEVEL_4, "\n"));
for (i = 0; i < env->n_regs; ++i) {
int tgt_col = costs[i].col;
int j;
/* If the costs for that color (and all successive) are infinite, bail out we won't make it anyway. */
- if (costs[i].cost == COL_COST_INFEASIBLE) {
+ if (costs[i].cost == 0.0)
return 0;
- }
/* Set the new color of the node and mark the node as temporarily fixed. */
assert(node->tmp_col < 0 && "Node must not have been temporary fixed.");
*/
if (get_mst_irn_col(nn) == tgt_col) {
/* try to color neighbour with tgt_col forbidden */
- neigh_ok = change_node_color_excluded(env, nn, tgt_col, &local_changed);
+ neigh_ok = change_node_color_excluded(env, nn, tgt_col, &local_changed, depth + 1, max_depth, trip);
if (!neigh_ok)
break;
*/
if (neigh_ok) {
/* append the local_changed ones to global ones */
- list_splice(&local_changed, changed_ones);
+ list_splice(&local_changed, changed);
return 1;
}
else {
* Tries to bring node @p node and all it's neighbours to color @p tgt_col.
* @return 1 if color @p col could be applied, 0 otherwise
*/
-static int change_node_color(co_mst_env_t *env, co_mst_irn_t *node, int tgt_col, struct list_head *changed_ones) {
+static int change_node_color(co_mst_env_t *env, co_mst_irn_t *node, int tgt_col, struct list_head *changed) {
int col = get_mst_irn_col(node);
/* if node already has the target color -> good, temporary fix it */
if (col == tgt_col) {
DBG((dbg, LEVEL_4, "\t\tCNC: %+F has already color %d, fix temporary\n", node->irn, tgt_col));
if (is_loose(node))
- set_temp_color(node, tgt_col, changed_ones);
+ set_temp_color(node, tgt_col, changed);
return 1;
}
-> try to recolor node and it's affinity neighbours
*/
if (is_loose(node) && bitset_is_set(node->adm_colors, tgt_col)) {
- col_cost_t *costs = alloca(env->n_regs * sizeof(costs[0]));
- int res;
+ col_cost_t *costs = env->single_cols[tgt_col];
+ int res, max_depth, trip;
- col_cost_init_single(env, costs, tgt_col);
+ max_depth = 0;
+ trip = 0;
DBG((dbg, LEVEL_4, "\t\tCNC: Attempt to recolor %+F ===>>\n", node->irn));
- res = recolor_nodes(env, node, costs, changed_ones);
+ res = recolor_nodes(env, node, costs, changed, 0, &max_depth, &trip);
DBG((dbg, LEVEL_4, "\t\tCNC: <<=== Recoloring of %+F %s\n", node->irn, res ? "succeeded" : "failed"));
+ stat_ev_int("heur4_recolor_depth_max", max_depth);
+ stat_ev_int("heur4_recolor_trip", trip);
+
return res;
}
-#ifndef NDEBUG
+#ifdef DEBUG_libfirm
if (firm_dbg_get_mask(dbg) & LEVEL_4) {
if (!is_loose(node))
DB((dbg, LEVEL_4, "\t\tCNC: %+F has already fixed color %d\n", node->irn, col));
*/
static void color_aff_chunk(co_mst_env_t *env, aff_chunk_t *c) {
aff_chunk_t *best_chunk = NULL;
+ int n_nodes = ARR_LEN(c->n);
int best_color = -1;
- int did_all = 0;
+ int n_int_chunks = 0;
waitq *tmp_chunks = new_waitq();
waitq *best_starts = NULL;
+ col_cost_t *order = alloca(env->n_regs * sizeof(order[0]));
bitset_t *visited;
- int col, idx, len;
- struct list_head changed_ones;
+ int idx, len, i;
+ struct list_head changed;
+ bitset_pos_t pos;
DB((dbg, LEVEL_2, "fragmentizing chunk #%d", c->id));
DBG_AFF_CHUNK(env, LEVEL_2, c);
DB((dbg, LEVEL_2, "\n"));
+ stat_ev_ctx_push_fmt("heur4_color_chunk", "%d", c->id);
+
+ ++env->chunk_visited;
+
+ /* compute color preference */
+ memset(order, 0, env->n_regs * sizeof(order[0]));
+
+ bitset_foreach (c->interfere, pos) {
+ ir_node *n = get_idx_irn(env->co->irg, pos);
+ co_mst_irn_t *node = get_co_mst_irn(env, n);
+ aff_chunk_t *chunk = node->chunk;
+
+ if (is_loose(node) && chunk && chunk->visited < env->chunk_visited && !chunk->deleted) {
+ chunk->visited = env->chunk_visited;
+ ++n_int_chunks;
+
+ aff_chunk_assure_weight(env, chunk);
+ for (i = 0; i < env->n_regs; ++i)
+ order[i].cost += chunk->color_affinity[i].cost;
+ }
+ }
+
+ for (i = 0; i < env->n_regs; ++i) {
+ double dislike = n_int_chunks > 0 ? 1.0 - order[i].cost / n_int_chunks : 0.0;
+ order[i].col = i;
+ order[i].cost = (1.0 - dislike_influence) * c->color_affinity[i].cost + dislike_influence * dislike;
+ }
+
+ qsort(order, env->n_regs, sizeof(order[0]), cmp_col_cost_gt);
+
+ DBG_COL_COST(env, LEVEL_2, order);
+ DB((dbg, LEVEL_2, "\n"));
/* check which color is the "best" for the given chunk.
* if we found a color which was ok for all nodes, we take it
* TODO Sebastian: Perhaps we should at all nodes and figure out
* a suitable color using costs as done above (determine_color_costs).
*/
- for (col = 0; col < env->n_regs && !did_all; ++col) {
- int one_good = 0;
+ for (i = 0; i < env->k; ++i) {
+ int col = order[i].col;
waitq *good_starts = new_waitq();
aff_chunk_t *local_best;
+ int n_succeeded;
/* skip ignore colors */
if (bitset_is_set(env->ignore_regs, col))
continue;
- DB((dbg, LEVEL_3, "\ttrying color %d\n", col));
-
- /* suppose we can color all nodes to the same color */
- did_all = 1;
+ DB((dbg, LEVEL_2, "\ttrying color %d\n", col));
- INIT_LIST_HEAD(&changed_ones);
+ n_succeeded = 0;
/* try to bring all nodes of given chunk to the current color. */
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;
+ ir_node *irn = c->n[idx];
+ co_mst_irn_t *node = get_co_mst_irn(env, irn);
+ 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));
The order of the colored nodes is important, so we record the successfully
colored ones in the order they appeared.
*/
- good = change_node_color(env, node, col, &changed_ones);
+ INIT_LIST_HEAD(&changed);
+ stat_ev_tim_push();
+ good = change_node_color(env, node, col, &changed);
+ stat_ev_tim_pop("heur4_recolor");
if (good) {
waitq_put(good_starts, node);
+ materialize_coloring(&changed);
+ node->fixed = 1;
}
- one_good |= good;
- did_all &= good;
+ else
+ reject_coloring(&changed);
- DB((dbg, LEVEL_4, "\t\t... %+F attempt from %d to %d %s\n", irn, node->col, col, one_good ? "succeeded" : "failed"));
+ n_succeeded += good;
+ DB((dbg, LEVEL_4, "\t\t... %+F attempt from %d to %d %s\n", irn, node->col, col, good ? "succeeded" : "failed"));
+ }
+
+ /* unfix all nodes */
+ for (idx = 0, len = ARR_LEN(c->n); idx < len; ++idx) {
+ co_mst_irn_t *node = get_co_mst_irn(env, c->n[idx]);
+ node->fixed = 0;
}
/* try next color when failed */
- if (! one_good) {
- reject_coloring(&changed_ones);
+ if (n_succeeded == 0)
continue;
- }
/* fragment the chunk according to the coloring */
local_best = fragment_chunk(env, col, c, tmp_chunks);
if (local_best) {
aff_chunk_assure_weight(env, local_best);
- DB((dbg, LEVEL_4, "\t\tlocal best chunk (id %d) for color %d: ", local_best->id, col));
- DBG_AFF_CHUNK(env, LEVEL_4, local_best);
+ DB((dbg, LEVEL_3, "\t\tlocal best chunk (id %d) for color %d: ", local_best->id, col));
+ DBG_AFF_CHUNK(env, LEVEL_3, local_best);
if (! best_chunk || best_chunk->weight < local_best->weight) {
best_chunk = local_best;
if (best_starts)
del_waitq(best_starts);
best_starts = good_starts;
- DB((dbg, LEVEL_4, "\n\t\t... setting global best chunk (id %d), color %d\n", best_chunk->id, best_color));
+ DB((dbg, LEVEL_3, "\n\t\t... setting global best chunk (id %d), color %d\n", best_chunk->id, best_color));
} else {
- DB((dbg, LEVEL_4, "\n\t\t... omitting, global best is better\n"));
+ DB((dbg, LEVEL_3, "\n\t\t... omitting, global best is better\n"));
del_waitq(good_starts);
}
}
del_waitq(good_starts);
}
- reject_coloring(&changed_ones);
+ /* if all nodes were recolored, bail out */
+ if (n_succeeded == n_nodes)
+ break;
}
+ stat_ev_int("heur4_colors_tried", i);
+
/* free all intermediate created chunks except best one */
while (! waitq_empty(tmp_chunks)) {
aff_chunk_t *tmp = waitq_get(tmp_chunks);
DBG_AFF_CHUNK(env, LEVEL_2, best_chunk);
DB((dbg, LEVEL_2, "using color %d\n", best_color));
- INIT_LIST_HEAD(&changed_ones);
for (idx = 0, len = ARR_LEN(best_chunk->n); idx < len; ++idx) {
ir_node *irn = best_chunk->n[idx];
co_mst_irn_t *node = get_co_mst_irn(env, irn);
/* bring the node to the color. */
DB((dbg, LEVEL_4, "\tManifesting color %d for %+F, chunk #%d\n", best_color, node->irn, best_chunk->id));
- INIT_LIST_HEAD(&changed_ones);
- res = change_node_color(env, node, best_color, &changed_ones);
+ INIT_LIST_HEAD(&changed);
+ stat_ev_tim_push();
+ res = change_node_color(env, node, best_color, &changed);
+ stat_ev_tim_pop("heur4_recolor");
if (res) {
- materialize_coloring(&changed_ones);
+ materialize_coloring(&changed);
node->fixed = 1;
}
+ assert(list_empty(&changed));
}
/* remove the nodes in best chunk from original chunk */
}
}
+ for (idx = 0, len = ARR_LEN(best_chunk->n); idx < len; ++idx) {
+ ir_node *n = best_chunk->n[idx];
+ co_mst_irn_t *nn = get_co_mst_irn(env, n);
+ nn->chunk = NULL;
+ }
+
/* clear obsolete chunks and free some memory */
delete_aff_chunk(env, best_chunk);
bitset_free(visited);
if (best_starts)
del_waitq(best_starts);
+
+ stat_ev_ctx_pop("heur4_color_chunk");
}
/**
int co_solve_heuristic_mst(copy_opt_t *co) {
unsigned n_regs = co->cls->n_regs;
bitset_t *ignore_regs = bitset_alloca(n_regs);
- unsigned k;
+ unsigned i, j, k;
ir_node *irn;
co_mst_env_t mst_env;
+ stat_ev_tim_push();
+
/* init phase */
phase_init(&mst_env.ph, "co_mst", co->irg, PHASE_DEFAULT_GROWTH, co_mst_irn_init, &mst_env);
k = be_put_ignore_regs(co->cenv->birg, co->cls, ignore_regs);
k = n_regs - k;
- mst_env.n_regs = n_regs;
- mst_env.k = k;
- mst_env.chunks = new_pqueue();
- mst_env.co = co;
- mst_env.ignore_regs = ignore_regs;
- mst_env.ifg = co->cenv->ifg;
- mst_env.aenv = co->aenv;
- mst_env.chunkset = pset_new_ptr(512);
+ mst_env.n_regs = n_regs;
+ mst_env.k = k;
+ mst_env.chunks = new_pqueue();
+ mst_env.co = co;
+ mst_env.ignore_regs = ignore_regs;
+ mst_env.ifg = co->cenv->ifg;
+ mst_env.aenv = co->aenv;
+ mst_env.chunkset = pset_new_ptr(512);
+ mst_env.chunk_visited = 0;
+ mst_env.single_cols = phase_alloc(&mst_env.ph, sizeof(*mst_env.single_cols) * n_regs);
+
+ for (i = 0; i < n_regs; ++i) {
+ col_cost_t *vec = phase_alloc(&mst_env.ph, sizeof(*vec) * n_regs);
+
+ mst_env.single_cols[i] = vec;
+ for (j = 0; j < n_regs; ++j) {
+ vec[j].col = j;
+ vec[j].cost = 0.0;
+ }
+ vec[i].col = 0;
+ vec[0].col = i;
+ vec[0].cost = 1.0;
+ }
DBG((dbg, LEVEL_1, "==== Coloring %+F, class %s ====\n", co->irg, co->cls->name));
/* build affinity chunks */
+ stat_ev_tim_push();
build_affinity_chunks(&mst_env);
+ stat_ev_tim_pop("heur4_initial_chunk");
/* color chunks as long as there are some */
while (! pqueue_empty(mst_env.chunks)) {
phase_free(&mst_env.ph);
del_pset(mst_env.chunkset);
+ stat_ev_tim_pop("heur4_total");
+
return 0;
}
+static const lc_opt_table_entry_t options[] = {
+ LC_OPT_ENT_INT ("limit", "limit recoloring", &recolor_limit),
+ LC_OPT_ENT_DBL ("di", "dislike influence", &dislike_influence),
+ LC_OPT_LAST
+};
+
+
void be_init_copyheur4(void) {
+ lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
+ lc_opt_entry_t *ra_grp = lc_opt_get_grp(be_grp, "ra");
+ lc_opt_entry_t *chordal_grp = lc_opt_get_grp(ra_grp, "chordal");
+ lc_opt_entry_t *co_grp = lc_opt_get_grp(chordal_grp, "co");
+ lc_opt_entry_t *heur4_grp = lc_opt_get_grp(co_grp, "heur4");
+
+ lc_opt_add_table(heur4_grp, options);
FIRM_DBG_REGISTER(dbg, "firm.be.co.heur4");
}
projects / libfirm / blobdiff