4 * Copyright: (c) Universitaet Karlsruhe
5 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
7 * Heuristic for minimizing copies using a queue which holds 'qnodes' not yet
8 * examined. A qnode has a 'target color', nodes out of the opt unit and
9 * a 'conflict graph'. 'Conflict graph' = "Interference graph' + 'conflict edges'
10 * A 'max indep set' is determined form these. We try to color this mis using a
11 * color-exchanging mechanism. Occuring conflicts are modeled with 'conflict edges'
12 * and the qnode is reinserted in the queue. The first qnode colored without
13 * conflicts is the best one.
27 #include "becopyopt.h"
28 #include "becopystat.h"
30 #define DEBUG_LVL 0 //SET_LEVEL_1
31 static firm_dbg_module_t *dbg = NULL;
33 #define SLOTS_PINNED_GLOBAL 256
34 #define SLOTS_CONFLICTS 8
35 #define SLOTS_CHANGED_NODES 32
37 #define MIN(a,b) ((a<b)?(a):(b))
38 #define list_entry_queue(lh) list_entry(lh, qnode_t, queue)
39 #define HASH_CONFLICT(c) (HASH_PTR(c.n1) ^ HASH_PTR(c.n2))
42 * Modeling additional conflicts between nodes. NOT live range interference
44 typedef struct _conflict_t {
45 const ir_node *n1, *n2;
49 * If an irn is changed, the changes first get stored in a node_stat_t,
50 * to allow undo of changes (=drop new data) in case of conflicts.
52 typedef struct _node_stat_t {
59 * Represents a node in the optimization queue.
61 typedef struct _qnode_t {
62 struct list_head queue; /**< chaining of unit_t->queue */
63 const unit_t *ou; /**< the opt unit this qnode belongs to */
64 int color; /**< target color */
65 set *conflicts; /**< contains conflict_t's. All internal conflicts */
66 int mis_size; /**< number of nodes in the mis. */
67 ir_node **mis; /**< the nodes of unit_t->nodes[] being part of the max independent set */
68 set *changed_nodes; /**< contains node_stat_t's. */
71 pset *pinned_global; /**< optimized nodes should not be altered any more */
73 static int set_cmp_conflict_t(const void *x, const void *y, size_t size) {
74 const conflict_t *xx = x;
75 const conflict_t *yy = y;
76 return ! (xx->n1 == yy->n1 && xx->n2 == yy->n2);
80 * If a local pinned conflict occurs, a new edge in the conflict graph is added.
81 * The next maximum independent set build, will regard it.
83 static INLINE void qnode_add_conflict(const qnode_t *qn, const ir_node *n1, const ir_node *n2) {
85 DBG((dbg, LEVEL_4, "\t %n -- %n\n", n1, n2));
87 if ((int)n1 < (int)n2) {
94 set_insert(qn->conflicts, &c, sizeof(c), HASH_CONFLICT(c));
98 * Checks if two nodes are in a conflict.
100 static INLINE int qnode_are_conflicting(const qnode_t *qn, const ir_node *n1, const ir_node *n2) {
102 /* search for live range interference */
103 if (n1!=n2 && nodes_interfere(qn->ou->co->chordal_env, n1, n2))
105 /* search for recoloring conflicts */
106 if ((int)n1 < (int)n2) {
113 return (int) set_find(qn->conflicts, &c, sizeof(c), HASH_CONFLICT(c));
116 static int set_cmp_node_stat_t(const void *x, const void *y, size_t size) {
117 return ((node_stat_t *)x)->irn != ((node_stat_t *)y)->irn;
121 * Finds a node status entry of a node if existent. Otherwise return NULL
123 static INLINE node_stat_t *qnode_find_node(const qnode_t *qn, ir_node *irn) {
126 return set_find(qn->changed_nodes, &find, sizeof(find), HASH_PTR(irn));
130 * Finds a node status entry of a node if existent. Otherwise it will return
131 * an initialized new entry for this node.
133 static INLINE node_stat_t *qnode_find_or_insert_node(const qnode_t *qn, ir_node *irn) {
136 find.new_color = NO_COLOR;
137 find.pinned_local = 0;
138 return set_insert(qn->changed_nodes, &find, sizeof(find), HASH_PTR(irn));
142 * Returns the virtual color of a node if set before, else returns the real color.
144 static INLINE int qnode_get_new_color(const qnode_t *qn, ir_node *irn) {
145 node_stat_t *found = qnode_find_node(qn, irn);
147 return found->new_color;
149 return get_irn_col(qn->ou->co, irn);
153 * Sets the virtual color of a node.
155 static INLINE void qnode_set_new_color(const qnode_t *qn, ir_node *irn, int color) {
156 node_stat_t *found = qnode_find_or_insert_node(qn, irn);
157 found->new_color = color;
161 * Checks if a node is local pinned. A node is local pinned, iff it belongs
162 * to the same optimization unit and has been optimized before the current
165 static INLINE int qnode_is_pinned_local(const qnode_t *qn, ir_node *irn) {
166 node_stat_t *found = qnode_find_node(qn, irn);
168 return found->pinned_local;
174 * Local-pins a node, so optimizations of further nodes of the same opt unit
175 * can handle situations in which a color change would undo prior optimizations.
177 static INLINE void qnode_pin_local(const qnode_t *qn, ir_node *irn) {
178 node_stat_t *found = qnode_find_or_insert_node(qn, irn);
179 found->pinned_local = 1;
183 * Possible return values of qnode_color_irn()
185 #define CHANGE_SAVE NULL
186 #define CHANGE_IMPOSSIBLE (ir_node *)1
187 #define is_conflicting_node(n) (((int)n) > 1)
190 * Performs virtual re-coloring of node @p n to color @p col. Virtual colors of
191 * other nodes are changed too, as required to preserve correctness. Function is
192 * aware of local and global pinning. Recursive.
193 * @param irn The node to set the color for
194 * @param col The color to set
195 * @param trigger The irn that caused the wish to change the color of the irn
196 * @return CHANGE_SAVE iff setting the color is possible, with all transitive effects.
197 * CHANGE_IMPOSSIBLE iff conflicts with reg-constraintsis occured.
198 * Else the first conflicting ir_node encountered is returned.
200 * ASSUMPTION: Assumes that a life range of a single value can't be split into
201 * several smaller intervals where other values can live in between.
202 * This should be true in SSA.
204 static ir_node *qnode_color_irn(const qnode_t *qn, ir_node *irn, int col, const ir_node *trigger) {
206 struct obstack confl_ob;
207 ir_node **confl, *cn;
209 const be_chordal_env_t *chordal_env = qn->ou->co->chordal_env;
210 const arch_env_t *arch_env = chordal_env->arch_env;
211 const arch_register_class_t *cls = chordal_env->cls;
213 DBG((dbg, LEVEL_3, "\t %n \tcaused col(%n) \t%2d --> %2d\n", trigger, irn, qnode_get_new_color(qn, irn), col));
214 obstack_init(&confl_ob);
215 irn_col = qnode_get_new_color(qn, irn);
219 if (pset_find_ptr(pinned_global, irn) || qnode_is_pinned_local(qn, irn)) {
223 if (!arch_reg_is_allocatable(arch_env,
225 arch_pos_make_out(0),
226 arch_register_for_index(cls, col)))
229 /* get all nodes which would conflict with this change */
235 irn_bl = get_nodes_block(irn);
237 /* first check for a conflicting node which is 'living in' the irns block */
240 pset *live_ins = get_live_in(irn_bl);
241 for (n = pset_first(live_ins); n; n = pset_next(live_ins))
242 if (arch_irn_has_reg_class(arch_env, n, arch_pos_make_out(0), cls)
243 && n != trigger && qnode_get_new_color(qn, n) == col
244 && nodes_interfere(chordal_env, irn, n)) {
246 DBG((dbg, LEVEL_4, "\t %n\ttroubles\n", n));
247 obstack_ptr_grow(&confl_ob, n);
248 pset_break(live_ins);
253 /* setup the queue of blocks. */
255 obstack_ptr_grow(&q, irn_bl);
259 /* process the queue. The code below checks for every block dominated
260 * by the irns one, and in which the irn is live, if there are
261 * conflicting nodes */
263 ir_node *curr_bl, *sub_bl;
266 curr_bl = ((ir_node **)obstack_base(&q))[out++];
268 /* Add to the result all nodes in the block, which have
269 * the target color and interfere with the irn */
270 for (i = 0, max = get_irn_n_outs(curr_bl); i < max; ++i) {
271 ir_node *n = get_irn_out(curr_bl, i);
272 if (arch_irn_has_reg_class(arch_env, n, arch_pos_make_out(0), cls)
273 && n != trigger && qnode_get_new_color(qn, n) == col
274 && nodes_interfere(chordal_env, irn, n)) {
276 DBG((dbg, LEVEL_4, "\t %n\ttroubles\n", n));
277 obstack_ptr_grow(&confl_ob, n);
281 /* If irn lives out check i-dominated blocks where the irn lives in */
283 if (is_live_out(curr_bl, irn)) {
284 dominates_for_each(curr_bl, sub_bl)
285 if (is_live_in(sub_bl, irn)) {
286 obstack_ptr_grow(&q, sub_bl);
291 obstack_free(&q, NULL);
292 obstack_ptr_grow(&confl_ob, NULL);
293 confl = (ir_node **) obstack_finish(&confl_ob);
296 /* process all nodes which would conflict with this change */
297 for (i = 0, cn = confl[0]; cn; cn = confl[++i]) {
300 /* try to color the conflicting node cn with the color of the irn itself */
301 sub_res = qnode_color_irn(qn, cn, irn_col, irn);
302 if (sub_res != CHANGE_SAVE) {
307 /* if we arrive here all sub changes can be applied, so it's save to change this irn */
310 DBG((dbg, LEVEL_3, "\t %n save\n", irn));
311 obstack_free(&confl_ob, NULL);
312 qnode_set_new_color(qn, irn, col);
316 DBG((dbg, LEVEL_3, "\t %n impossible\n", irn));
317 obstack_free(&confl_ob, NULL);
318 return CHANGE_IMPOSSIBLE;
321 DBG((dbg, LEVEL_3, "\t %n conflicting\n", irn));
322 obstack_free(&confl_ob, NULL);
327 * Tries to set the colors for all members of this queue node;
328 * to the target color qn->color
329 * @returns 1 iff all members colors could be set
332 static int qnode_try_color(const qnode_t *qn) {
334 for (i=0; i<qn->mis_size; ++i) {
335 ir_node *test_node, *confl_node;
337 test_node = qn->mis[i];
338 DBG((dbg, LEVEL_3, "\t Testing %n\n", test_node));
339 confl_node = qnode_color_irn(qn, test_node, qn->color, test_node);
341 if (confl_node == CHANGE_SAVE) {
342 DBG((dbg, LEVEL_3, "\t Save --> pin local\n"));
343 qnode_pin_local(qn, test_node);
344 } else if (confl_node == CHANGE_IMPOSSIBLE) {
345 DBG((dbg, LEVEL_3, "\t Impossible --> remove from qnode\n"));
346 qnode_add_conflict(qn, test_node, test_node);
348 if (qnode_is_pinned_local(qn, confl_node)) {
349 /* changing test_node would change back a node of current ou */
350 DBG((dbg, LEVEL_3, "\t Conflicting local --> add conflict\n"));
351 qnode_add_conflict(qn, confl_node, test_node);
353 if (pset_find_ptr(pinned_global, confl_node)) {
354 /* changing test_node would change back a node of a prior ou */
355 DBG((dbg, LEVEL_3, "\t Conflicting global --> remove from qnode\n"));
356 qnode_add_conflict(qn, test_node, test_node);
360 if (confl_node != CHANGE_SAVE)
367 * Determines a maximum independent set with respect to the interference and
368 * conflict edges of all nodes in a qnode.
370 static INLINE void qnode_max_ind_set(qnode_t *qn, const unit_t *ou) {
371 int all_size, curr_size, i, o;
373 ir_node **curr, **all = alloca(ou->node_count * sizeof(*all));
375 /* all contains all nodes not removed in this qn */
377 for (i=0; i<ou->node_count; ++i)
378 if (!qnode_are_conflicting(qn, ou->nodes[i], ou->nodes[i]))
379 all[all_size++] = ou->nodes[i];
381 /* which[i] says which element to take out of all[] and put into curr[i] */
382 which = alloca(all_size*sizeof(*which));
383 for (curr_size=0; curr_size<all_size; ++curr_size)
384 which[curr_size] = curr_size;
386 /* stores the currently examined set */
387 curr = alloca(all_size*sizeof(*curr));
389 while (1) { /* this loop will terminate because at least a single node will be a max indep. set */
390 /* build current set */
391 for (i=0; i<curr_size; ++i)
392 curr[i] = all[which[all_size-curr_size+i]];
394 /* check current set */
395 for (i=0; i<curr_size; ++i)
396 for (o=i+1; o<curr_size; ++o)
397 if (qnode_are_conflicting(qn, curr[i], curr[o]))
400 /* We had no conflict. This is the max indep. set */
401 qn->mis_size = curr_size;
402 for (i=0; i<curr_size; ++i)
403 qn->mis[i] = curr[i];
407 /* We had a conflict. Generate next set */
408 if (which[all_size-curr_size+1] == all_size-curr_size+1) {
410 for (i=0; i<curr_size; ++i)
411 which[all_size-curr_size+i] = i;
418 } while (!(which[pos] = (which[pos]+1) % all_size));
420 for (i=pos+1; i<all_size; ++i)
421 which[i] = MIN(which[i-1]+1, all_size-1);
424 for (i=all_size-curr_size; i<all_size-1; ++i)
425 if (which[i]>=which[i+1]) {
435 * Creates a new qnode
437 static INLINE qnode_t *new_qnode(const unit_t *ou, int color) {
438 qnode_t *qn = xmalloc(sizeof(*qn));
441 qn->mis = malloc(ou->node_count * sizeof(*qn->mis));
442 qn->conflicts = new_set(set_cmp_conflict_t, SLOTS_CONFLICTS);
443 qn->changed_nodes = new_set(set_cmp_node_stat_t, SLOTS_CHANGED_NODES);
448 * Frees space used by a queue node
450 static INLINE void free_qnode(qnode_t *qn) {
451 del_set(qn->conflicts);
452 del_set(qn->changed_nodes);
458 * Inserts a qnode in the sorted queue of the optimization unit. Queue is
459 * ordered by field 'size' (the size of the mis) in decreasing order.
461 static INLINE void ou_insert_qnode(unit_t *ou, qnode_t *qn) {
462 struct list_head *lh;
464 if (qnode_are_conflicting(qn, ou->nodes[0], ou->nodes[0])) {
465 /* root node is not in qnode */
470 qnode_max_ind_set(qn, ou);
471 /* do the insertion */
472 DBG((dbg, LEVEL_4, "\t Insert qnode color %d with size %d\n", qn->color, qn->mis_size));
474 while (lh->next != &ou->queue) {
475 qnode_t *curr = list_entry_queue(lh->next);
476 if (curr->mis_size <= qn->mis_size)
480 list_add(&qn->queue, lh);
484 * Tries to re-allocate colors of nodes in this opt unit, to achieve a lower
485 * number of copy instructions placed during SSA-destruction and lowering.
486 * Works only for opt units with exactly 1 root node, which is the
487 * case for approximately 80% of all phi classes and all register constrained
488 * nodes. (All other phi classes are reduced to this case.)
490 static void ou_optimize(unit_t *ou) {
493 bitset_t *pos_regs = bitset_alloca(ou->co->chordal_env->cls->n_regs);
495 DBG((dbg, LEVEL_1, "\tOptimizing unit:\n"));
496 for (i=0; i<ou->node_count; ++i)
497 DBG((dbg, LEVEL_1, "\t %n\n", ou->nodes[i]));
500 INIT_LIST_HEAD(&ou->queue);
501 arch_get_allocatable_regs(ou->co->chordal_env->arch_env, ou->nodes[0], arch_pos_make_out(0), ou->co->chordal_env->cls, pos_regs);
502 bitset_foreach(pos_regs, i)
503 ou_insert_qnode(ou, new_qnode(ou, i));
506 while (!list_empty(&ou->queue)) {
507 /* get head of queue */
508 curr = list_entry_queue(ou->queue.next);
509 list_del(&curr->queue);
510 DBG((dbg, LEVEL_2, "\t Examine qnode color %d with size %d\n", curr->color, curr->mis_size));
513 if (qnode_try_color(curr))
515 /* no success, so re-insert */
516 del_set(curr->changed_nodes);
517 curr->changed_nodes = new_set(set_cmp_node_stat_t, SLOTS_CHANGED_NODES);
518 ou_insert_qnode(ou, curr);
521 /* apply the best found qnode */
522 if (curr->mis_size >= 2) {
525 DBG((dbg, LEVEL_1, "\t Best color: %d Copies: %d/%d\n", curr->color, ou->interf+ou->node_count-curr->mis_size, ou->interf+ou->node_count-1));
526 /* globally pin root and eventually others */
527 pset_insert_ptr(pinned_global, ou->nodes[0]);
528 for (i=1; i<ou->node_count; ++i) {
529 ir_node *irn = ou->nodes[i];
530 int nc = qnode_get_new_color(curr, irn);
531 if (nc != NO_COLOR && nc == qnode_get_new_color(curr, ou->nodes[0]))
532 pset_insert_ptr(pinned_global, irn);
535 /* set color of all changed nodes */
536 for (ns = set_first(curr->changed_nodes); ns; ns = set_next(curr->changed_nodes)) {
537 /* NO_COLOR is possible, if we had an undo */
538 if (ns->new_color != NO_COLOR) {
539 DBG((dbg, LEVEL_2, "\t color(%n) := %d\n", ns->irn, ns->new_color));
540 set_irn_col(ou->co, ns->irn, ns->new_color);
545 /* free best qnode (curr) and queue */
547 list_for_each_entry_safe(qnode_t, curr, tmp, &ou->queue, queue)
551 void co_heur_opt(copy_opt_t *co) {
553 dbg = firm_dbg_register("ir.be.copyoptheur");
554 firm_dbg_set_mask(dbg, DEBUG_LVL);
555 if (!strcmp(co->name, DEBUG_IRG))
556 firm_dbg_set_mask(dbg, DEBUG_LVL_HEUR);
558 firm_dbg_set_mask(dbg, DEBUG_LVL);
560 pinned_global = pset_new_ptr(SLOTS_PINNED_GLOBAL);
561 list_for_each_entry(unit_t, curr, &co->units, units)
562 if (curr->node_count > 1)
565 del_pset(pinned_global);