1 /** vim: set sw=4 ts=4:
4 * @author Adam M. Szalkowski & Sebastian Hack
6 * ILP based spilling & rematerialization
8 * Copyright (C) 2006 Universitaet Karlsruhe
9 * Released under the GPL
37 #include <lpp/lpp_net.h>
38 #include <lpp/lpp_cplex.h>
39 //#include <lc_pset.h>
40 #include <libcore/lc_bitset.h>
44 #include "besched_t.h"
49 #include "bespillremat.h"
52 #include "bechordal_t.h"
58 //#define KEEPALIVE /* keep alive all inserted remats and dump graph with remats */
59 #define COLLECT_REMATS /* enable rematerialization */
60 #define COLLECT_INVERSE_REMATS /* enable placement of inverse remats */
61 #define REMAT_WHILE_LIVE /* only remat values that are live */
62 //#define NO_ENLARGE_L1V3N355 /* do not remat after the death of some operand */
63 //#define EXECFREQ_LOOPDEPH /* compute execution frequency from loop depth only */
64 //#define MAY_DIE_AT_PRE_REMAT /* allow values to die after a pre remat */
65 #define CHECK_POST_REMAT /* check pressure after post remats (conservative but otherwise we can temporarily exceed the register pressure) */
66 #define NO_SINGLE_USE_REMATS /* do not repair schedule */
67 //#define KEEPALIVE_SPILLS
68 //#define KEEPALIVE_RELOADS
69 //#define GOODWIN_REDUCTION
73 #define LPP_SERVER "i44pc52"
74 #define LPP_SOLVER "cplex"
80 #define ILP_TIMEOUT 90
84 typedef struct _spill_ilp_t {
85 const arch_register_class_t *cls;
87 const be_chordal_env_t *chordal_env;
92 pset *all_possible_remats;
97 set *values; /**< for collecting all definitions of values before running ssa-construction */
101 DEBUG_ONLY(firm_dbg_module_t * dbg);
104 typedef int ilp_var_t;
105 typedef int ilp_cst_t;
107 typedef struct _spill_bb_t {
113 typedef struct _remat_t {
114 const ir_node *op; /**< for copy_irn */
115 const ir_node *proj; /**< not NULL if the above op produces a tuple */
116 const ir_node *value; /**< the value which is being recomputed by this remat */
117 int cost; /**< cost of this remat */
118 int inverse; /**< nonzero if this is an inverse remat */
122 * Data to be attached to each IR node. For remats this contains the ilp_var
123 * for this remat and for normal ops this contains the ilp_vars for
124 * reloading each operand
126 typedef struct _op_t {
131 remat_t *remat; /** the remat this op belongs to */
132 int pre; /** 1, if this is a pressure-increasing remat */
136 ir_node *op; /** the operation this live range belongs to */
142 typedef struct _defs_t {
144 ir_node *spills; /**< points to the first spill for this value (linked by link field) */
145 ir_node *remats; /**< points to the first definition for this value (linked by link field) */
148 typedef struct _remat_info_t {
149 const ir_node *irn; /**< the irn to which these remats belong */
150 pset *remats; /**< possible remats for this value */
151 pset *remats_by_operand; /**< remats with this value as operand */
154 typedef struct _keyval_t {
159 typedef struct _spill_t {
169 has_reg_class(const spill_ilp_t * si, const ir_node * irn)
171 return chordal_has_class(si->chordal_env, irn);
176 cmp_remat(const void *a, const void *b)
178 const keyval_t *p = a;
179 const keyval_t *q = b;
180 const remat_t *r = p->val;
181 const remat_t *s = q->val;
185 return !(r == s || r->op == s->op);
189 cmp_remat(const void *a, const void *b)
191 const remat_t *r = a;
192 const remat_t *s = a;
194 return !(r == s || r->op == s->op);
198 cmp_spill(const void *a, const void *b, size_t size)
200 const spill_t *p = a;
201 const spill_t *q = b;
203 // return !(p->irn == q->irn && p->bb == q->bb);
204 return !(p->irn == q->irn);
208 set_find_keyval(set * set, void * key)
213 return set_find(set, &query, sizeof(query), HASH_PTR(key));
217 set_insert_keyval(set * set, void * key, void * val)
223 return set_insert(set, &query, sizeof(query), HASH_PTR(key));
227 set_find_def(set * set, ir_node * value)
232 return set_find(set, &query, sizeof(query), HASH_PTR(value));
236 set_insert_def(set * set, ir_node * value)
243 return set_insert(set, &query, sizeof(query), HASH_PTR(value));
247 set_find_spill(set * set, ir_node * value)
252 return set_find(set, &query, sizeof(query), HASH_PTR(value));
255 #define pset_foreach(s,i) for((i)=pset_first((s)); (i); (i)=pset_next((s)))
256 #define set_foreach(s,i) for((i)=set_first((s)); (i); (i)=set_next((s)))
257 #define foreach_post_remat(s,i) for((i)=next_post_remat((s)); (i); (i)=next_post_remat((i)))
258 #define foreach_pre_remat(si,s,i) for((i)=next_pre_remat((si),(s)); (i); (i)=next_pre_remat((si),(i)))
259 #define sched_foreach_op(s,i) for((i)=sched_next_op((s));!sched_is_end((i));(i)=sched_next_op((i)))
262 cmp_remat_info(const void *a, const void *b, size_t size)
264 const remat_info_t *p = a;
265 const remat_info_t *q = b;
267 return !(p->irn == q->irn);
271 cmp_defs(const void *a, const void *b, size_t size)
276 return !(p->value == q->value);
280 cmp_keyval(const void *a, const void *b, size_t size)
282 const keyval_t *p = a;
283 const keyval_t *q = b;
285 return !(p->key == q->key);
289 execution_frequency(const spill_ilp_t * si, const ir_node * irn)
293 return get_block_execfreq(si->execfreqs, irn);
295 return get_block_execfreq(si->execfreqs, get_nodes_block(irn));
299 return exp(get_loop_depth(get_irn_loop(irn)) * log(10));
301 return exp(get_loop_depth(get_irn_loop(get_nodes_block(irn))) * log(10));
306 * Checks, whether node and its operands have suitable reg classes
309 is_rematerializable(const spill_ilp_t * si, const ir_node * irn)
313 const arch_env_t *arch_env = si->chordal_env->birg->main_env->arch_env;
314 int remat = (arch_irn_get_flags(arch_env, irn) & arch_irn_flags_rematerializable) != 0;
318 ir_fprintf(stderr, " Node %+F is not rematerializable\n", irn);
321 for (i = 0, n = get_irn_arity(irn); i < n && remat; ++i) {
322 ir_node *op = get_irn_n(irn, i);
323 remat &= has_reg_class(si, op) || arch_irn_get_flags(arch_env, op) & arch_irn_flags_ignore || (get_irn_op(op) == op_NoMem);
326 // ir_fprintf(stderr, " Argument %d (%+F) of Node %+F has wrong regclass\n", i, op, irn);
333 * Try to create a remat from @p op with destination value @p dest_value
335 static INLINE remat_t *
336 get_remat_from_op(spill_ilp_t * si, const ir_node * dest_value, const ir_node * op)
338 remat_t *remat = NULL;
340 // if(!mode_is_datab(get_irn_mode(dest_value)))
343 if(dest_value == op) {
344 const ir_node *proj = NULL;
346 if(is_Proj(dest_value)) {
347 op = get_irn_n(op, 0);
351 if(!is_rematerializable(si, op))
354 remat = obstack_alloc(si->obst, sizeof(*remat));
356 remat->cost = arch_get_op_estimated_cost(si->chordal_env->birg->main_env->arch_env, op);
357 remat->value = dest_value;
361 arch_inverse_t inverse;
365 /* get the index of the operand we want to retrieve by the inverse op */
366 for (i = 0, n = get_irn_arity(op); i < n; ++i) {
367 ir_node *arg = get_irn_n(op, i);
369 if(arg == dest_value) break;
371 if(i == n) return NULL;
373 DBG((si->dbg, LEVEL_5, "\t requesting inverse op for argument %d of op %+F\n", i, op));
375 /* else ask the backend to give an inverse op */
376 if(arch_get_inverse(si->chordal_env->birg->main_env->arch_env, op, i, &inverse, si->obst)) {
379 DBG((si->dbg, LEVEL_4, "\t backend gave us an inverse op with %d nodes and cost %d\n", inverse.n, inverse.costs));
381 assert(inverse.n > 0 && "inverse op should have at least one node");
383 for(i=0; i<inverse.n; ++i) {
384 pset_insert_ptr(si->inverse_ops, inverse.nodes[i]);
388 remat = obstack_alloc(si->obst, sizeof(*remat));
389 remat->op = inverse.nodes[0];
390 remat->cost = inverse.costs;
391 remat->value = dest_value;
392 remat->proj = (inverse.n==2)?inverse.nodes[1]:NULL;
395 assert(is_Proj(remat->proj));
397 assert(0 && "I can not handle remats with more than 2 nodes");
404 DBG((si->dbg, LEVEL_3, "\t >Found remat %+F for %+F from %+F with %+F\n", remat->op, dest_value, op, remat->proj));
406 DBG((si->dbg, LEVEL_3, "\t >Found remat %+F for %+F from %+F\n", remat->op, dest_value, op));
414 add_remat(const spill_ilp_t * si, const remat_t * remat)
416 remat_info_t *remat_info,
422 assert(remat->value);
424 query.irn = remat->value;
426 query.remats_by_operand = NULL;
427 remat_info = set_insert(si->remat_info, &query, sizeof(query), HASH_PTR(remat->value));
429 if(remat_info->remats == NULL) {
430 remat_info->remats = new_pset(cmp_remat, 4096);
432 pset_insert(remat_info->remats, remat, HASH_PTR(remat->op));
434 /* insert the remat into the remats_be_operand set of each argument of the remat op */
435 for (i = 0, n = get_irn_arity(remat->op); i < n; ++i) {
436 ir_node *arg = get_irn_n(remat->op, i);
440 query.remats_by_operand = NULL;
441 remat_info = set_insert(si->remat_info, &query, sizeof(query), HASH_PTR(arg));
443 if(remat_info->remats_by_operand == NULL) {
444 remat_info->remats_by_operand = new_pset(cmp_remat, 4096);
446 pset_insert(remat_info->remats_by_operand, remat, HASH_PTR(remat->op));
451 get_irn_n_nonremat_edges(const spill_ilp_t * si, const ir_node * irn)
453 const ir_edge_t *edge = get_irn_out_edge_first(irn);
457 if(!pset_find_ptr(si->inverse_ops, edge->src)) {
460 edge = get_irn_out_edge_next(irn, edge);
467 get_remats_from_op(spill_ilp_t * si, const ir_node * op)
473 #ifdef NO_SINGLE_USE_REMATS
474 if(has_reg_class(si, op) && (get_irn_n_nonremat_edges(si, op) > 1)) {
476 if(has_reg_class(si, op)) {
478 remat = get_remat_from_op(si, op, op);
480 add_remat(si, remat);
484 #ifdef COLLECT_INVERSE_REMATS
485 /* repeat the whole stuff for each remat retrieved by get_remat_from_op(op, arg)
487 for (i = 0, n = get_irn_arity(op); i < n; ++i) {
488 ir_node *arg = get_irn_n(op, i);
490 if(has_reg_class(si, arg)) {
491 /* try to get an inverse remat */
492 remat = get_remat_from_op(si, arg, op);
494 add_remat(si, remat);
503 value_is_defined_before(const spill_ilp_t * si, const ir_node * pos, const ir_node * val)
506 ir_node *def_block = get_nodes_block(val);
512 /* if pos is at end of a basic block */
514 ret = (pos == def_block || block_dominates(def_block, pos));
515 // ir_fprintf(stderr, "(def(bb)=%d) ", ret);
519 /* else if this is a normal operation */
520 block = get_nodes_block(pos);
521 if(block == def_block) {
522 if(!sched_is_scheduled(val)) return 1;
524 ret = sched_comes_after(val, pos);
525 // ir_fprintf(stderr, "(def(same block)=%d) ",ret);
529 ret = block_dominates(def_block, block);
530 // ir_fprintf(stderr, "(def(other block)=%d) ", ret);
534 static INLINE ir_node *
535 sched_block_last_noncf(const spill_ilp_t * si, const ir_node * bb)
537 return sched_skip((ir_node*)bb, 0, sched_skip_cf_predicator, (void *) si->chordal_env->birg->main_env->arch_env);
541 * Returns first non-Phi node of block @p bb
543 static INLINE ir_node *
544 sched_block_first_nonphi(const ir_node * bb)
546 return sched_skip((ir_node*)bb, 1, sched_skip_phi_predicator, NULL);
550 sched_skip_proj_predicator(const ir_node * irn, void * data)
552 return (is_Proj(irn));
555 static INLINE ir_node *
556 sched_next_nonproj(const ir_node * irn, int forward)
558 return sched_skip((ir_node*)irn, forward, sched_skip_proj_predicator, NULL);
562 * Returns next operation node (non-Proj) after @p irn
563 * or the basic block of this node
565 static INLINE ir_node *
566 sched_next_op(const ir_node * irn)
568 ir_node *next = sched_next(irn);
573 return sched_next_nonproj(next, 1);
577 * Returns previous operation node (non-Proj) before @p irn
578 * or the basic block of this node
580 static INLINE ir_node *
581 sched_prev_op(const ir_node * irn)
583 ir_node *prev = sched_prev(irn);
588 return sched_next_nonproj(prev, 0);
592 sched_put_after(ir_node * insert, ir_node * irn)
594 if(is_Block(insert)) {
595 insert = sched_block_first_nonphi(insert);
597 insert = sched_next_op(insert);
599 sched_add_before(insert, irn);
603 sched_put_before(const spill_ilp_t * si, ir_node * insert, ir_node * irn)
605 if(is_Block(insert)) {
606 insert = sched_block_last_noncf(si, insert);
608 insert = sched_next_nonproj(insert, 0);
609 insert = sched_prev(insert);
611 sched_add_after(insert, irn);
615 * Tells you whether a @p remat can be placed before the irn @p pos
618 can_remat_before(const spill_ilp_t * si, const remat_t * remat, const ir_node * pos, const pset * live)
620 const ir_node *op = remat->op;
627 prev = sched_block_last_noncf(si, pos);
628 prev = sched_next_nonproj(prev, 0);
630 prev = sched_prev_op(pos);
632 /* do not remat if the rematted value is defined immediately before this op */
633 if(prev == remat->op) {
638 /* this should be just fine, the following OP will be using this value, right? */
640 /* only remat AFTER the real definition of a value (?) */
641 if(!value_is_defined_before(si, pos, remat->value)) {
642 // ir_fprintf(stderr, "error(not defined)");
647 for(i=0, n=get_irn_arity(op); i<n && res; ++i) {
648 const ir_node *arg = get_irn_n(op, i);
650 #ifdef NO_ENLARGE_L1V3N355
651 if(has_reg_class(si, arg) && live) {
652 res &= pset_find_ptr(live, arg)?1:0;
654 res &= value_is_defined_before(si, pos, arg);
657 res &= value_is_defined_before(si, pos, arg);
665 * Tells you whether a @p remat can be placed after the irn @p pos
668 can_remat_after(const spill_ilp_t * si, const remat_t * remat, const ir_node * pos, const pset * live)
671 pos = sched_block_first_nonphi(pos);
673 pos = sched_next_op(pos);
676 /* only remat AFTER the real definition of a value (?) */
677 if(!value_is_defined_before(si, pos, remat->value)) {
681 return can_remat_before(si, remat, pos, live);
685 * Collect potetially rematerializable OPs
688 walker_remat_collector(ir_node * irn, void * data)
690 spill_ilp_t *si = data;
692 if(!is_Block(irn) && !is_Phi(irn)) {
693 DBG((si->dbg, LEVEL_4, "\t Processing %+F\n", irn));
694 get_remats_from_op(si, irn);
699 * Inserts a copy of @p irn before @p pos
702 insert_copy_before(const spill_ilp_t * si, const ir_node * irn, ir_node * pos)
707 bb = is_Block(pos)?pos:get_nodes_block(pos);
708 copy = exact_copy(irn);
709 set_nodes_block(copy, bb);
710 sched_put_before(si, pos, copy);
716 * Inserts a copy of @p irn after @p pos
719 insert_copy_after(const spill_ilp_t * si, const ir_node * irn, ir_node * pos)
724 bb = is_Block(pos)?pos:get_nodes_block(pos);
725 copy = exact_copy(irn);
726 set_nodes_block(copy, bb);
727 sched_put_after(pos, copy);
733 insert_remat_after(spill_ilp_t * si, const remat_t * remat, const ir_node * pos, const pset * live)
737 if(can_remat_after(si, remat, pos, live)) {
742 DBG((si->dbg, LEVEL_3, "\t >inserting remat %+F\n", remat->op));
744 copy = insert_copy_after(si, remat->op, pos);
746 // ir_snprintf(buf, sizeof(buf), "remat2_%N_%N", remat->value, pos);
747 ir_snprintf(buf, sizeof(buf), "remat2_%N_%N", copy, pos);
748 op = obstack_alloc(si->obst, sizeof(*op));
750 op->attr.remat.remat = remat;
751 op->attr.remat.pre = 0;
752 op->attr.remat.ilp = lpp_add_var(si->lpp, buf, lpp_binary, remat->cost*execution_frequency(si, pos));
754 set_irn_link(copy, op);
755 pset_insert_ptr(si->all_possible_remats, copy);
757 proj_copy = insert_copy_after(si, remat->proj, copy);
758 set_irn_n(proj_copy, 0, copy);
759 set_irn_link(proj_copy, op);
760 pset_insert_ptr(si->all_possible_remats, proj_copy);
768 insert_remat_before(spill_ilp_t * si, const remat_t * remat, const ir_node * pos, const pset * live)
772 if(can_remat_before(si, remat, pos, live)) {
777 DBG((si->dbg, LEVEL_3, "\t >inserting remat %+F\n", remat->op));
779 copy = insert_copy_before(si, remat->op, pos);
781 // ir_snprintf(buf, sizeof(buf), "remat_%N_%N", remat->value, pos);
782 ir_snprintf(buf, sizeof(buf), "remat_%N_%N", copy, pos);
783 op = obstack_alloc(si->obst, sizeof(*op));
785 op->attr.remat.remat = remat;
786 op->attr.remat.pre = 1;
787 op->attr.remat.ilp = lpp_add_var(si->lpp, buf, lpp_binary, remat->cost*execution_frequency(si, pos));
789 set_irn_link(copy, op);
790 pset_insert_ptr(si->all_possible_remats, copy);
792 proj_copy = insert_copy_after(si, remat->proj, copy);
793 set_irn_n(proj_copy, 0, copy);
794 set_irn_link(proj_copy, op);
795 pset_insert_ptr(si->all_possible_remats, proj_copy);
802 static int get_block_n_succs(ir_node *block) {
803 const ir_edge_t *edge;
805 assert(edges_activated(current_ir_graph));
807 edge = get_block_succ_first(block);
811 edge = get_block_succ_next(block, edge);
816 * Insert (so far unused) remats into the irg to
817 * recompute the potential liveness of all values
820 walker_remat_insertor(ir_node * bb, void * data)
822 spill_ilp_t *si = data;
823 spill_bb_t *spill_bb;
828 pset *live = pset_new_ptr_default();
830 DBG((si->dbg, LEVEL_3, "\t Entering %+F\n\n", bb));
832 live_foreach(bb, li) {
833 ir_node *value = (ir_node *) li->irn;
835 /* add remats at end of block */
836 if (live_is_end(li) && has_reg_class(si, value)) {
837 pset_insert_ptr(live, value);
841 spill_bb = obstack_alloc(si->obst, sizeof(*spill_bb));
842 set_irn_link(bb, spill_bb);
844 irn = sched_last(bb);
845 while(!sched_is_end(irn)) {
851 next = sched_prev(irn);
853 DBG((si->dbg, LEVEL_5, "\t at %+F (next: %+F)\n", irn, next));
855 if(is_Phi(irn) || is_Proj(irn)) {
858 if(has_reg_class(si, irn)) {
859 pset_remove_ptr(live, irn);
862 op = obstack_alloc(si->obst, sizeof(*op));
864 op->attr.live_range.reloads = NULL;
865 op->attr.live_range.ilp = ILP_UNDEF;
866 set_irn_link(irn, op);
872 op = obstack_alloc(si->obst, sizeof(*op));
874 op->attr.live_range.ilp = ILP_UNDEF;
875 op->attr.live_range.reloads = obstack_alloc(si->obst, sizeof(*op->attr.live_range.reloads) * get_irn_arity(irn));
876 memset(op->attr.live_range.reloads, 0xFF, sizeof(*op->attr.live_range.reloads) * get_irn_arity(irn));
877 set_irn_link(irn, op);
879 args = pset_new_ptr_default();
881 /* collect arguments of op */
882 for (i = 0, n = get_irn_arity(irn); i < n; ++i) {
883 ir_node *arg = get_irn_n(irn, i);
885 pset_insert_ptr(args, arg);
888 /* set args of op live in epilog */
889 pset_foreach(args, arg) {
890 if(has_reg_class(si, arg)) {
891 pset_insert_ptr(live, arg);
895 /* insert all possible remats after irn */
896 pset_foreach(args, arg) {
897 remat_info_t *remat_info,
901 /* continue if the operand has the wrong reg class
903 if(!has_reg_class(si, arg))
908 query.remats_by_operand = NULL;
909 remat_info = set_find(si->remat_info, &query, sizeof(query), HASH_PTR(arg));
915 /* do not place post remats after jumps */
916 if(sched_skip_cf_predicator(irn, si->chordal_env->birg->main_env->arch_env)) continue;
918 if(remat_info->remats_by_operand) {
919 pset_foreach(remat_info->remats_by_operand, remat) {
920 /* do not insert remats producing the same value as one of the operands */
921 if(!pset_find_ptr(args, remat->value)) {
922 DBG((si->dbg, LEVEL_4, "\t considering remat %+F with arg %+F\n", remat->op, arg));
923 #ifdef REMAT_WHILE_LIVE
924 if(pset_find_ptr(live, remat->value)) {
925 insert_remat_after(si, remat, irn, live);
928 insert_remat_after(si, remat, irn, live);
935 /* delete defined value from live set */
936 if(has_reg_class(si, irn)) {
937 pset_remove_ptr(live, irn);
940 /* insert all possible remats before irn */
941 pset_foreach(args, arg) {
942 remat_info_t *remat_info,
946 /* continue if the operand has the wrong reg class
948 if(!has_reg_class(si, arg))
953 query.remats_by_operand = NULL;
954 remat_info = set_find(si->remat_info, &query, sizeof(query), HASH_PTR(arg));
960 if(remat_info->remats) {
961 pset_foreach(remat_info->remats, remat) {
962 DBG((si->dbg, LEVEL_4, "\t considering remat %+F for arg %+F\n", remat->op, arg));
963 #ifdef REMAT_WHILE_LIVE
964 if(pset_find_ptr(live, remat->value)) {
965 insert_remat_before(si, remat, irn, live);
968 insert_remat_before(si, remat, irn, live);
978 live_foreach(bb, li) {
979 ir_node *value = (ir_node *) li->irn;
981 #ifdef GOODWIN_REDUCTION
982 /* add remats at end if successor has multiple predecessors */
983 if(get_block_n_succs(bb) == 1 && get_Block_n_cfgpreds(get_block_succ_first(bb)->src) > 1) {
985 /* add remats at end of block */
986 if (live_is_end(li) && has_reg_class(si, value)) {
987 remat_info_t *remat_info,
993 query.remats_by_operand = NULL;
994 remat_info = set_find(si->remat_info, &query, sizeof(query), HASH_PTR(value));
996 if(remat_info && remat_info->remats) {
997 pset_foreach(remat_info->remats, remat) {
998 DBG((si->dbg, LEVEL_4, "\t considering remat %+F at end of block %+F\n", remat->op, bb));
1000 insert_remat_before(si, remat, bb, NULL);
1005 #ifdef GOODWIN_REDUCTION
1007 if(get_Block_n_cfgpreds(bb) == 1 && get_block_n_succs(get_Block_cfgpred_block(bb,0)) > 1) {
1009 /* add remat2s at beginning of block */
1010 if ((live_is_in(li) || (is_Phi(value) && get_nodes_block(value)==bb)) && has_reg_class(si, value)) {
1011 remat_info_t *remat_info,
1016 query.remats = NULL;
1017 query.remats_by_operand = NULL;
1018 remat_info = set_find(si->remat_info, &query, sizeof(query), HASH_PTR(value));
1020 if(remat_info && remat_info->remats) {
1021 pset_foreach(remat_info->remats, remat) {
1022 DBG((si->dbg, LEVEL_4, "\t considering remat %+F at beginning of block %+F\n", remat->op, bb));
1024 /* put the remat here if all its args are available */
1025 insert_remat_after(si, remat, bb, NULL);
1031 #ifdef GOODWIN_REDUCTION
1039 * Preparation of blocks' ends for Luke Blockwalker(tm)(R)
1042 luke_endwalker(ir_node * bb, void * data)
1044 spill_ilp_t *si = (spill_ilp_t*)data;
1051 spill_bb_t *spill_bb = get_irn_link(bb);
1054 live = pset_new_ptr_default();
1055 use_end = pset_new_ptr_default();
1057 live_foreach(bb, li) {
1058 irn = (ir_node *) li->irn;
1059 if (live_is_end(li) && has_reg_class(si, irn) && !pset_find_ptr(si->all_possible_remats, irn)) {
1062 pset_insert_ptr(live, irn);
1063 op = get_irn_link(irn);
1064 assert(!op->is_remat);
1068 /* collect values used by cond jumps etc. at bb end (use_end) -> always live */
1069 /* their reg_out is unimportant because it can always be set */
1070 sched_foreach_reverse(bb, irn) {
1074 if(!sched_skip_cf_predicator(irn, si->chordal_env->birg->main_env->arch_env)) break;
1076 for (i = 0, n = get_irn_arity(irn); i < n; ++i) {
1077 ir_node *irn_arg = get_irn_n(irn, i);
1078 if(has_reg_class(si, irn_arg)) {
1079 pset_insert_ptr(use_end, irn);
1084 ir_snprintf(buf, sizeof(buf), "check_end_%N", bb);
1085 cst = lpp_add_cst(si->lpp, buf, lpp_less, si->n_regs - pset_count(use_end));
1087 spill_bb->ilp = new_set(cmp_spill, 16);
1089 live_foreach(bb, li) {
1090 irn = (ir_node *) li->irn;
1091 if (live_is_end(li) && has_reg_class(si, irn) && !pset_find_ptr(si->all_possible_remats, irn)) {
1096 spill = set_insert(spill_bb->ilp, &query, sizeof(query), HASH_PTR(irn));
1098 ir_snprintf(buf, sizeof(buf), "reg_out_%N_%N", irn, bb);
1099 spill->reg_out = lpp_add_var(si->lpp, buf, lpp_binary, 0.0);
1100 /* if irn is used at the end of the block, then it is live anyway */
1101 if(!pset_find_ptr(use_end, irn))
1102 lpp_set_factor_fast(si->lpp, cst, spill->reg_out, 1.0);
1104 ir_snprintf(buf, sizeof(buf), "mem_out_%N_%N", irn, bb);
1105 spill->mem_out = lpp_add_var(si->lpp, buf, lpp_binary, 0.0);
1107 #ifdef GOODWIN_REDUCTION
1108 if(get_Block_n_cfgpreds(bb) == 1 && get_block_n_succs(get_Block_cfgpred_block(bb,0)) > 1) {
1109 ir_snprintf(buf, sizeof(buf), "spill_%N_%N", irn, bb);
1110 spill->spill = lpp_add_var(si->lpp, buf, lpp_binary, COST_STORE*execution_frequency(si, bb));
1112 spill->spill = ILP_UNDEF;
1115 ir_snprintf(buf, sizeof(buf), "spill_%N_%N", irn, bb);
1116 spill->spill = lpp_add_var(si->lpp, buf, lpp_binary, COST_STORE*execution_frequency(si, bb));
1119 spill->reg_in = ILP_UNDEF;
1120 spill->mem_in = ILP_UNDEF;
1129 next_post_remat(const ir_node * irn)
1134 irn = sched_block_first_nonphi(irn);
1136 irn = sched_next_op(irn);
1139 if(sched_is_end(irn))
1142 op = (op_t*)get_irn_link(irn);
1143 if(op->is_remat && !op->attr.remat.pre) {
1152 next_pre_remat(const spill_ilp_t * si, const ir_node * irn)
1158 ret = sched_block_last_noncf(si, irn);
1159 ret = sched_next(ret);
1160 ret = sched_prev_op(ret);
1162 ret = sched_prev_op(irn);
1165 if(sched_is_end(ret) || is_Phi(ret))
1168 op = (op_t*)get_irn_link(ret);
1169 if(op->is_remat && op->attr.remat.pre) {
1177 * Find a remat of value @p value in the epilog of @p pos
1180 find_post_remat(const ir_node * value, const ir_node * pos)
1182 while((pos = next_post_remat(pos)) != NULL) {
1185 op = get_irn_link(pos);
1186 assert(op->is_remat && !op->attr.remat.pre);
1188 if(op->attr.remat.remat->value == value)
1189 return (ir_node*)pos;
1192 const ir_edge_t *edge;
1193 foreach_out_edge(pos, edge) {
1194 ir_node *proj = get_edge_src_irn(edge);
1195 assert(is_Proj(proj));
1205 * Find a remat of value @p value in the prolog of @p pos
1208 find_pre_remat(const spill_ilp_t * si, const ir_node * value, const ir_node * pos)
1210 while((pos = next_pre_remat(si,pos)) != NULL) {
1213 op = get_irn_link(pos);
1214 assert(op->is_remat && op->attr.remat.pre);
1216 if(op->attr.remat.remat->value == value)
1217 return (ir_node*)pos;
1224 add_to_spill_bb(spill_ilp_t * si, ir_node * bb, ir_node * irn)
1226 spill_bb_t *spill_bb = get_irn_link(bb);
1232 spill = set_find(spill_bb->ilp, &query, sizeof(query), HASH_PTR(irn));
1234 spill = set_insert(spill_bb->ilp, &query, sizeof(query), HASH_PTR(irn));
1236 spill->reg_out = ILP_UNDEF;
1237 spill->reg_in = ILP_UNDEF;
1238 spill->mem_in = ILP_UNDEF;
1240 ir_snprintf(buf, sizeof(buf), "mem_out_%N_%N", irn, bb);
1241 spill->mem_out = lpp_add_var(si->lpp, buf, lpp_binary, 0.0);
1243 #ifdef GOODWIN_REDUCTION
1244 if(get_Block_n_cfgpreds(bb) == 1 && get_block_n_succs(get_Block_cfgpred_block(bb,0)) > 1) {
1245 ir_snprintf(buf, sizeof(buf), "spill_%N_%N", irn, bb);
1246 spill->spill = lpp_add_var(si->lpp, buf, lpp_binary, COST_STORE*execution_frequency(si, bb));
1248 spill->spill = ILP_UNDEF;
1251 ir_snprintf(buf, sizeof(buf), "spill_%N_%N", irn, bb);
1252 spill->spill = lpp_add_var(si->lpp, buf, lpp_binary, COST_STORE*execution_frequency(si, bb));
1260 * Walk all irg blocks and emit this ILP
1263 luke_blockwalker(ir_node * bb, void * data)
1265 spill_ilp_t *si = (spill_ilp_t*)data;
1271 spill_bb_t *spill_bb = get_irn_link(bb);
1277 live = pset_new_ptr_default();
1279 /* do something at the end of the block */
1281 /* init live values at end of block */
1282 live_foreach(bb, li) {
1283 ir_node *irn = (ir_node *) li->irn;
1285 if (live_is_end(li) && has_reg_class(si, irn) && !pset_find_ptr(si->all_possible_remats, irn)) {
1286 pset_insert_ptr(live, irn);
1290 #ifdef GOODWIN_REDUCTION
1291 if(get_block_n_succs(bb) == 1 && get_Block_n_cfgpreds(get_block_succ_first(bb)->src) > 1) {
1292 spill_bb->reloads = obstack_alloc(si->obst, pset_count(live) * sizeof(*spill_bb->reloads));
1293 memset(spill_bb->reloads, 0xFF, pset_count(live) * sizeof(*spill_bb->reloads));
1295 spill_bb->reloads = NULL;
1298 spill_bb->reloads = obstack_alloc(si->obst, pset_count(live) * sizeof(*spill_bb->reloads));
1299 memset(spill_bb->reloads, 0xFF, pset_count(live) * sizeof(*spill_bb->reloads));
1303 live_foreach(bb, li) {
1304 ir_node *irn = (ir_node *) li->irn;
1307 if (live_is_end(li) && has_reg_class(si, irn) && !pset_find_ptr(si->all_possible_remats, irn)) {
1308 spill = set_find_spill(spill_bb->ilp, irn);
1311 if(spill_bb->reloads) {
1312 ir_snprintf(buf, sizeof(buf), "reload_%N_%N", bb, irn);
1313 spill_bb->reloads[i] = lpp_add_var(si->lpp, buf, lpp_binary, COST_LOAD*execution_frequency(si, bb));
1315 /* reload <= mem_out */
1316 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1317 lpp_set_factor_fast(si->lpp, cst, spill_bb->reloads[i], 1.0);
1318 lpp_set_factor_fast(si->lpp, cst, spill->mem_out, -1.0);
1321 op = get_irn_link(irn);
1322 assert(!op->is_remat);
1324 ir_snprintf(buf, sizeof(buf), "lr_%N_%N", irn, bb);
1325 op->attr.live_range.ilp = lpp_add_var(si->lpp, buf, lpp_binary, 0.0);
1326 op->attr.live_range.op = bb;
1328 ir_snprintf(buf, sizeof(buf), "reg_out_%N_%N", bb, irn);
1329 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1331 /* reg_out - reload - remat - live_range <= 0 */
1332 lpp_set_factor_fast(si->lpp, cst, spill->reg_out, 1.0);
1333 if(spill_bb->reloads) lpp_set_factor_fast(si->lpp, cst, spill_bb->reloads[i], -1.0);
1334 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.ilp, -1.0);
1335 foreach_pre_remat(si, bb, tmp) {
1336 op_t *remat_op = get_irn_link(tmp);
1337 if(remat_op->attr.remat.remat->value == irn) {
1338 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, -1.0);
1345 DBG((si->dbg, LEVEL_4, "\t %d values live at end of block %+F\n", pset_count(live), bb));
1347 sched_foreach_reverse(bb, irn) {
1353 ilp_cst_t check_pre,
1355 #ifdef CHECK_POST_REMAT
1356 ilp_cst_t check_post_remat;
1358 set *args = new_set(cmp_keyval, get_irn_arity(irn));
1364 op = get_irn_link(irn);
1366 if(op->is_remat) continue;
1367 DBG((si->dbg, LEVEL_4, "\t at node %+F\n", irn));
1369 if(has_reg_class(si, irn)) {
1370 assert(pset_find_ptr(live, irn));
1371 pset_remove_ptr(live, irn);
1374 /* init set of irn's arguments */
1375 for (i = 0, n = get_irn_arity(irn); i < n; ++i) {
1376 ir_node *irn_arg = get_irn_n(irn, i);
1377 if(has_reg_class(si, irn_arg)) {
1378 set_insert_keyval(args, irn_arg, (void*)i);
1382 #ifdef CHECK_POST_REMAT
1383 /* check the register pressure after the epilog */
1384 ir_snprintf(buf, sizeof(buf), "check_post_remat_%N", irn);
1385 check_post_remat = lpp_add_cst(si->lpp, buf, lpp_less, si->n_regs);
1387 /* iterate over L\U */
1388 pset_foreach(live, tmp) {
1389 if(!set_find_keyval(args, tmp)) {
1390 /* if a live value is not used by irn */
1391 tmp_op = get_irn_link(tmp);
1392 // assert(tmp_op->attr.live_range.op != irn);
1393 lpp_set_factor_fast(si->lpp, check_post_remat, tmp_op->attr.live_range.ilp, 1.0);
1396 /* iterate over following remats and remove possibly defined values again from check_post_remat */
1397 foreach_post_remat(irn, tmp) {
1398 op_t *remat_op = get_irn_link(tmp);
1399 const ir_node *value = remat_op->attr.remat.remat->value;
1400 op_t *val_op = get_irn_link(value);
1402 assert(remat_op->is_remat && !remat_op->attr.remat.pre);
1404 /* values that are defined by remat2s are not counted */
1405 #ifdef REMAT_WHILE_LIVE
1406 assert(val_op->attr.live_range.ilp);
1407 lpp_set_factor_fast(si->lpp, check_post_remat, val_op->attr.live_range.ilp, 0.0);
1409 if(val_op->attr.live_range.ilp != ILP_UNDEF) {
1410 lpp_set_factor_fast(si->lpp, check_post_remat, val_op->attr.live_range.ilp, 0.0);
1412 #endif /* REMAT_WHILE_LIVE */
1414 #endif /* CHECK_POST_REMAT */
1417 /* new live ranges for values from L\U defined by remat2s or used by remats */
1418 pset_foreach(live, tmp) {
1419 ir_node *value = tmp;//remat_op->attr.remat.remat->value;
1420 op_t *value_op = get_irn_link(value);
1422 if(!set_find_keyval(args, value)) {
1423 ilp_var_t prev_lr = ILP_UNDEF;
1427 foreach_post_remat(irn, remat) {
1428 op_t *remat_op = get_irn_link(remat);
1430 /* if value is being rematerialized by this remat */
1431 if(value == remat_op->attr.remat.remat->value) {
1432 if(cst == ILP_UNDEF) {
1433 /* next_live_range <= prev_live_range + sum remat2s */
1434 ir_snprintf(buf, sizeof(buf), "next_lr_%N_%N", value, irn);
1435 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1436 ir_snprintf(buf, sizeof(buf), "lr_%N_%N", value, irn);
1437 prev_lr = lpp_add_var(si->lpp, buf, lpp_binary, 0.0);
1438 lpp_set_factor_fast(si->lpp, cst, value_op->attr.live_range.ilp, 1.0);
1439 lpp_set_factor_fast(si->lpp, cst, prev_lr, -1.0);
1442 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, -1.0);
1446 #ifdef MAY_DIE_AT_PRE_REMAT
1447 if(cst == ILP_UNDEF) {
1448 foreach_pre_remat(si, irn, remat) {
1452 for (i = 0, n = get_irn_arity(remat); i < n; ++i) {
1453 ir_node *remat_arg = get_irn_n(remat, i);
1455 /* if value is being used by this remat */
1456 if(value == remat_arg) {
1457 /* next_live_range <= prev_live_range */
1458 ir_snprintf(buf, sizeof(buf), "lr_%N_%N", value, irn);
1459 prev_lr = lpp_add_var(si->lpp, buf, lpp_binary, 0.0);
1461 ir_snprintf(buf, sizeof(buf), "next_lr_%N_%N", value, irn);
1462 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1463 lpp_set_factor_fast(si->lpp, cst, value_op->attr.live_range.ilp, 1.0);
1464 lpp_set_factor_fast(si->lpp, cst, prev_lr, -1.0);
1467 /* TODO check afterwards whether lr dies after a pre-remat (should not happen) */
1474 if(prev_lr != ILP_UNDEF) {
1475 value_op->attr.live_range.ilp = prev_lr;
1476 value_op->attr.live_range.op = irn;
1481 /* get count of values in my register class defined by irn */
1482 /* also add defined values to check_post_remat; do this before iterating over args */
1483 if(get_irn_mode(irn) == mode_T) {
1484 ir_node *proj = sched_next(irn);
1485 op_t *proj_op = get_irn_link(proj);
1487 while(is_Proj(proj)) {
1488 if(has_reg_class(si, proj)) {
1490 #ifdef CHECK_POST_REMAT
1491 lpp_set_factor_fast(si->lpp, check_post_remat, proj_op->attr.live_range.ilp, 1.0);
1494 proj = sched_next(proj);
1495 proj_op = get_irn_link(proj);
1498 if(has_reg_class(si, irn)) {
1500 #ifdef CHECK_POST_REMAT
1501 lpp_set_factor_fast(si->lpp, check_post_remat, op->attr.live_range.ilp, 1.0);
1505 DBG((si->dbg, LEVEL_4, "\t %+F produces %d values in my register class\n", irn, d));
1507 /* count how many regs irn needs for arguments */
1508 k = set_count(args);
1510 /* check the register pressure in the prolog */
1511 /* sum_{L\U} lr <= n - |U| */
1512 ir_snprintf(buf, sizeof(buf), "check_pre_%N", irn);
1513 check_pre = lpp_add_cst(si->lpp, buf, lpp_less, si->n_regs - k);
1515 /* check the register pressure in the epilog */
1516 ir_snprintf(buf, sizeof(buf), "check_post_%N", irn);
1517 check_post = lpp_add_cst(si->lpp, buf, lpp_less, si->n_regs - d);
1519 set_foreach(args, keyval) {
1525 ir_node *arg = keyval->key;
1527 spill = add_to_spill_bb(si, bb, arg);
1529 ir_snprintf(buf, sizeof(buf), "lr_%N_%N", arg, irn);
1530 next_lr = lpp_add_var(si->lpp, buf, lpp_binary, 0.0);
1532 i = (int)keyval->val;
1535 ir_snprintf(buf, sizeof(buf), "reload_%N_%N", arg, irn);
1536 op->attr.live_range.reloads[i] = lpp_add_var(si->lpp, buf, lpp_binary, COST_LOAD*execution_frequency(si, irn));
1538 /* reload <= mem_out */
1539 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1540 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.reloads[i], 1.0);
1541 lpp_set_factor_fast(si->lpp, cst, spill->mem_out, -1.0);
1543 arg_op = get_irn_link(arg);
1545 /* requirement: arg must be in register for use */
1546 /* reload + remat + live_range == 1 */
1547 ir_snprintf(buf, sizeof(buf), "req_%N_%N", irn, arg);
1548 cst = lpp_add_cst(si->lpp, buf, lpp_equal, 1.0);
1550 lpp_set_factor_fast(si->lpp, cst, next_lr, 1.0);
1551 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.reloads[i], 1.0);
1552 foreach_pre_remat(si, irn, tmp) {
1553 op_t *remat_op = get_irn_link(tmp);
1554 if(remat_op->attr.remat.remat->value == arg) {
1555 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
1559 /* the epilog stuff - including post_use, post, post_remat */
1560 ir_snprintf(buf, sizeof(buf), "post_use_%N_%N", arg, irn);
1561 post_use = lpp_add_var(si->lpp, buf, lpp_binary, 0.0);
1563 lpp_set_factor_fast(si->lpp, check_post, post_use, 1.0);
1565 /* arg is live throughout epilog if the next live_range is in a register */
1566 if(pset_find_ptr(live, arg)) {
1567 DBG((si->dbg, LEVEL_3, "\t arg %+F is possibly live in epilog of %+F\n", arg, irn));
1569 ir_snprintf(buf, sizeof(buf), "post_use_%N_%N-%d", arg, irn, p++);
1570 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1571 lpp_set_factor_fast(si->lpp, cst, post_use, -1.0);
1572 lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, 1.0);
1574 #ifdef CHECK_POST_REMAT
1575 lpp_set_factor_fast(si->lpp, check_post_remat, arg_op->attr.live_range.ilp, 1.0);
1579 /*forall remat2 which use arg add a similar cst*/
1580 foreach_post_remat(irn, tmp) {
1584 for (i = 0, n = get_irn_arity(tmp); i < n; ++i) {
1585 ir_node *remat_arg = get_irn_n(tmp, i);
1586 op_t *remat_op = get_irn_link(tmp);
1588 if(remat_arg == arg) {
1589 DBG((si->dbg, LEVEL_3, "\t found remat with arg %+F in epilog of %+F\n", arg, irn));
1591 ir_snprintf(buf, sizeof(buf), "post_use_%N_%N-%d", arg, irn, p++);
1592 cst = lpp_add_cst(si->lpp, buf, lpp_greater, 0.0);
1593 lpp_set_factor_fast(si->lpp, cst, post_use, 1.0);
1594 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, -1.0);
1599 /* new live range begins for each argument */
1600 arg_op->attr.live_range.ilp = next_lr;
1601 arg_op->attr.live_range.op = irn;
1603 pset_insert_ptr(live, arg);
1606 /* start new live ranges for values used by remats */
1607 foreach_pre_remat(si, irn, tmp) {
1611 for (i = 0, n = get_irn_arity(tmp); i < n; ++i) {
1612 ir_node *remat_arg = get_irn_n(tmp, i);
1613 op_t *arg_op = get_irn_link(remat_arg);
1616 if(!has_reg_class(si, remat_arg)) continue;
1618 /* if value is becoming live through use by remat */
1619 if(!pset_find_ptr(live, remat_arg)) {
1620 ir_snprintf(buf, sizeof(buf), "lr_%N_%N", remat_arg, irn);
1621 prev_lr = lpp_add_var(si->lpp, buf, lpp_binary, 0.0);
1623 arg_op->attr.live_range.ilp = prev_lr;
1624 arg_op->attr.live_range.op = irn;
1626 DBG((si->dbg, LEVEL_4, " value %+F becoming live through use by remat %+F\n", remat_arg, tmp));
1628 /* TODO ist das hier die richtige Stelle???? */
1629 pset_insert_ptr(live, remat_arg);
1630 add_to_spill_bb(si, bb, remat_arg);
1632 /* TODO check afterwards whether lr dies after a pre-remat (should not happen) */
1636 /* iterate over L\U */
1637 pset_foreach(live, tmp) {
1638 if(!set_find_keyval(args, tmp)) {
1639 /* if a live value is not used by irn */
1640 tmp_op = get_irn_link(tmp);
1641 // assert(tmp_op->attr.live_range.op != irn);
1642 lpp_set_factor_fast(si->lpp, check_pre, tmp_op->attr.live_range.ilp, 1.0);
1643 lpp_set_factor_fast(si->lpp, check_post, tmp_op->attr.live_range.ilp, 1.0);
1647 /* requirements for remats */
1648 foreach_pre_remat(si, irn, tmp) {
1649 op_t *remat_op = get_irn_link(tmp);
1653 for (i = 0, n = get_irn_arity(tmp); i < n; ++i) {
1654 ir_node *remat_arg = get_irn_n(tmp, i);
1655 op_t *arg_op = get_irn_link(remat_arg);
1657 if(!has_reg_class(si, remat_arg)) continue;
1659 /* remat <= live_rang(remat_arg) [ + reload(remat_arg) ] */
1660 ir_snprintf(buf, sizeof(buf), "req_remat_%N_arg_%N", tmp, remat_arg);
1661 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1663 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
1664 lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, -1.0);
1666 /* if remat arg is also used by current op then we can use reload placed for this argument */
1667 if((keyval = set_find_keyval(args, remat_arg)) != NULL) {
1668 int index = (int)keyval->val;
1670 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.reloads[index], -1.0);
1675 /* requirements for remats2
1677 * TODO unsure if this does the right thing.
1678 * should insert values into set if they do not become live through remat and
1681 foreach_post_remat(irn, tmp) {
1682 op_t *remat_op = get_irn_link(tmp);
1686 for (i = 0, n = get_irn_arity(tmp); i < n; ++i) {
1687 ir_node *remat_arg = get_irn_n(tmp, i);
1688 op_t *arg_op = get_irn_link(remat_arg);
1690 if(!has_reg_class(si, remat_arg)) continue;
1692 /* only for values in L\U, the others are handled with post_use */
1693 if(!set_find_keyval(args, remat_arg)) {
1694 /* remat <= live_rang(remat_arg) */
1695 ir_snprintf(buf, sizeof(buf), "req_remat2_%N_arg_%N", tmp, remat_arg);
1696 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1698 /* if value is becoming live through use by remat2 */
1699 if(!pset_find_ptr(live, remat_arg)) {
1702 ir_snprintf(buf, sizeof(buf), "lr_%N_%N", remat_arg, irn);
1703 lr = lpp_add_var(si->lpp, buf, lpp_binary, 0.0);
1705 arg_op->attr.live_range.ilp = lr;
1706 arg_op->attr.live_range.op = irn;
1708 DBG((si->dbg, LEVEL_3, " value %+F becoming live through use by remat2 %+F\n", remat_arg, tmp));
1710 pset_insert_ptr(live, remat_arg);
1711 add_to_spill_bb(si, bb, remat_arg);
1714 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
1715 lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, -1.0);
1720 #ifdef CHECK_POST_REMAT
1721 /* iterate over following remats and add them to check_post_remat */
1722 foreach_post_remat(irn, tmp) {
1723 op_t *remat_op = get_irn_link(tmp);
1725 assert(remat_op->is_remat && !remat_op->attr.remat.pre);
1727 lpp_set_factor_fast(si->lpp, check_post_remat, remat_op->attr.remat.ilp, 1.0);
1733 DBG((si->dbg, LEVEL_4, "\t %d values live at %+F\n", pset_count(live), irn));
1735 pset_foreach(live, tmp) {
1736 assert(has_reg_class(si, tmp));
1739 for (i = 0, n = get_irn_arity(irn); i < n; ++i) {
1740 ir_node *arg = get_irn_n(irn, i);
1742 assert(!find_post_remat(arg, irn) && "there should be no post remat for an argument of an op");
1750 /* do something at the beginning of the block */
1752 /* we are now at the beginning of the basic block, there are only \Phis in front of us */
1753 DBG((si->dbg, LEVEL_3, "\t %d values live at beginning of block %+F\n", pset_count(live), bb));
1755 pset_foreach(live, irn) {
1756 assert(is_Phi(irn) || get_nodes_block(irn) != bb);
1759 /* construct mem_outs for all values */
1761 set_foreach(spill_bb->ilp, spill) {
1762 ir_snprintf(buf, sizeof(buf), "mem_out_%N_%N", spill->irn, bb);
1763 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1765 lpp_set_factor_fast(si->lpp, cst, spill->mem_out, 1.0);
1766 if(spill->spill != ILP_UNDEF) {
1767 lpp_set_factor_fast(si->lpp, cst, spill->spill, -1.0);
1770 if(pset_find_ptr(live, spill->irn)) {
1771 DBG((si->dbg, LEVEL_5, "\t %+F live at beginning of block %+F\n", spill->irn, bb));
1773 ir_snprintf(buf, sizeof(buf), "mem_in_%N_%N", spill->irn, bb);
1774 spill->mem_in = lpp_add_var(si->lpp, buf, lpp_binary, 0.0);
1776 lpp_set_factor_fast(si->lpp, cst, spill->mem_in, -1.0);
1781 /* L\U is empty at bb start */
1782 /* arg is live throughout epilog if it is reg_in into this block */
1784 /* check the register pressure at the beginning of the block
1787 ir_snprintf(buf, sizeof(buf), "check_start_%N", bb);
1788 cst = lpp_add_cst(si->lpp, buf, lpp_less, si->n_regs);
1790 pset_foreach(live, irn) {
1791 spill = set_find_spill(spill_bb->ilp, irn);
1794 ir_snprintf(buf, sizeof(buf), "reg_in_%N_%N", irn, bb);
1795 spill->reg_in = lpp_add_var(si->lpp, buf, lpp_binary, 0.0);
1797 lpp_set_factor_fast(si->lpp, cst, spill->reg_in, 1.0);
1799 foreach_post_remat(bb, irn) {
1800 op_t *remat_op = get_irn_link(irn);
1802 DBG((si->dbg, LEVEL_4, "\t next post remat: %+F\n", irn));
1803 assert(remat_op->is_remat && !remat_op->attr.remat.pre);
1805 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
1808 /* forall remat2 add requirements */
1809 foreach_post_remat(bb, tmp) {
1813 for (i = 0, n = get_irn_arity(tmp); i < n; ++i) {
1814 ir_node *remat_arg = get_irn_n(tmp, i);
1815 op_t *remat_op = get_irn_link(tmp);
1817 if(!has_reg_class(si, remat_arg)) continue;
1819 spill = set_find_spill(spill_bb->ilp, remat_arg);
1822 /* TODO verify this is placed correctly */
1823 ir_snprintf(buf, sizeof(buf), "req_remat2_%N_%N_arg_%N", tmp, bb, remat_arg);
1824 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1825 lpp_set_factor_fast(si->lpp, cst, spill->reg_in, -1.0);
1826 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
1830 /* mem_in/reg_in for live_in values, especially phis and their arguments */
1831 pset_foreach(live, irn) {
1836 spill = set_find_spill(spill_bb->ilp, irn);
1837 assert(spill && spill->irn == irn);
1839 if(is_Phi(irn) && get_nodes_block(irn) == bb) {
1840 for (i = 0, n = get_Phi_n_preds(irn); i < n; ++i) {
1843 ir_node *phi_arg = get_Phi_pred(irn, i);
1844 ir_node *bb_p = get_Block_cfgpred_block(bb, i);
1845 spill_bb_t *spill_bb_p = get_irn_link(bb_p);
1848 /* although the phi is in the right regclass one or more of
1849 * its arguments can be in a different one or at least to
1852 if(has_reg_class(si, phi_arg)) {
1853 ir_snprintf(buf, sizeof(buf), "mem_in_%N_%N-%d", irn, bb, p);
1854 mem_in = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1855 ir_snprintf(buf, sizeof(buf), "reg_in_%N_%N-%d", irn, bb, p++);
1856 reg_in = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1858 lpp_set_factor_fast(si->lpp, mem_in, spill->mem_in, 1.0);
1859 lpp_set_factor_fast(si->lpp, reg_in, spill->reg_in, 1.0);
1861 spill_p = set_find_spill(spill_bb_p->ilp, phi_arg);
1864 lpp_set_factor_fast(si->lpp, mem_in, spill_p->mem_out, -1.0);
1865 lpp_set_factor_fast(si->lpp, reg_in, spill_p->reg_out, -1.0);
1869 /* else assure the value arrives on all paths in the same resource */
1871 for (i = 0, n = get_Block_n_cfgpreds(bb); i < n; ++i) {
1874 ir_node *bb_p = get_Block_cfgpred_block(bb, i);
1875 spill_bb_t *spill_bb_p = get_irn_link(bb_p);
1878 ir_snprintf(buf, sizeof(buf), "mem_in_%N_%N-%d", irn, bb, p);
1879 mem_in = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1880 ir_snprintf(buf, sizeof(buf), "reg_in_%N_%N-%d", irn, bb, p++);
1881 reg_in = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1883 lpp_set_factor_fast(si->lpp, mem_in, spill->mem_in, 1.0);
1884 lpp_set_factor_fast(si->lpp, reg_in, spill->reg_in, 1.0);
1886 spill_p = set_find_spill(spill_bb_p->ilp, irn);
1889 lpp_set_factor_fast(si->lpp, mem_in, spill_p->mem_out, -1.0);
1890 lpp_set_factor_fast(si->lpp, reg_in, spill_p->reg_out, -1.0);
1895 /* first live ranges from reg_ins */
1896 pset_foreach(live, irn) {
1897 op_t *op = get_irn_link(irn);
1899 spill = set_find_spill(spill_bb->ilp, irn);
1900 assert(spill && spill->irn == irn);
1902 ir_snprintf(buf, sizeof(buf), "first_lr_%N_%N", irn, bb);
1903 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1904 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.ilp, 1.0);
1905 lpp_set_factor_fast(si->lpp, cst, spill->reg_in, -1.0);
1907 foreach_post_remat(bb, tmp) {
1908 op_t *remat_op = get_irn_link(tmp);
1910 if(remat_op->attr.remat.remat->value == irn) {
1911 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, -1.0);
1916 /* walk forward now and compute constraints for placing spills */
1917 /* this must only be done for values that are not defined in this block */
1918 #ifdef GOODWIN_REDUCTION
1919 if(get_Block_n_cfgpreds(bb) == 1 && get_block_n_succs(get_Block_cfgpred_block(bb,0)) > 1) {
1921 pset_foreach(live, irn) {
1922 ir_snprintf(buf, sizeof(buf), "req_spill_%N_%N", spill->irn, bb);
1923 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1925 spill = set_find_spill(spill_bb->ilp, irn);
1928 lpp_set_factor_fast(si->lpp, cst, spill->spill, 1.0);
1929 lpp_set_factor_fast(si->lpp, cst, spill->reg_in, -1.0);
1931 sched_foreach_op(bb, tmp) {
1932 op_t *op = get_irn_link(tmp);
1934 if(is_Phi(tmp)) continue;
1935 assert(!is_Proj(tmp));
1938 ir_node *value = op->attr.remat.remat->value;
1941 /* only collect remats up to the first use of a value */
1942 lpp_set_factor_fast(si->lpp, cst, op->attr.remat.ilp, -1.0);
1948 for (i = 0, n = get_irn_arity(tmp); i < n; ++i) {
1949 ir_node *arg = get_irn_n(tmp, i);
1952 /* if a value is used stop collecting remats */
1958 if(cst == ILP_UNDEF) break;
1961 #ifdef GOODWIN_REDUCTION
1966 /* if a value is used by a mem-phi, then mem_in of this value is 0 (has to be spilled again into a different slot)
1967 mem_in(phi) -> not mem_in(orig_value) TODO: how does this depend on a certain predecessor?
1970 /* mem_in of mem-phi has associated costs (but first one is free) */
1971 /* define n_mem_copies as positive integer in each predecessor block,
1972 #mem_in into this block from predecessor block - 1 weighted with SPILL_COST*execfreq(predecessor)
1982 * Speicherkopienminimierung: teste Speicherwerte auf Interferenz
1983 * und weise Spillkontexte zu. Sorge bei Phis dafuer, dass gleiche
1984 * Kontexte zusammenfliessen (Operanden und Ergebnis hat gleichen
1991 return fabs(x) < 0.00001;
1996 is_spilled(const spill_ilp_t * si, const live_range_t * lr)
1998 return !is_zero(lpp_get_var_sol(si->lpp, lr->in_mem_var));
2003 is_mem_phi(const ir_node * phi, void *data)
2005 spill_ilp_t *si = data;
2006 // return is_spilled(si, get_use_head(si, phi)->closest_use);
2011 static int mark_remat_nodes_hook(FILE *F, ir_node *n, ir_node *l)
2013 spill_ilp_t *si = get_irg_link(current_ir_graph);
2015 if(pset_find_ptr(si->all_possible_remats, n)) {
2016 op_t *op = (op_t*)get_irn_link(n);
2017 assert(op && op->is_remat);
2019 if(!op->attr.remat.remat->inverse) {
2020 if(op->attr.remat.pre) {
2021 ir_fprintf(F, "color:red info3:\"remat value: %+F\"", op->attr.remat.remat->value);
2023 ir_fprintf(F, "color:orange info3:\"remat2 value: %+F\"", op->attr.remat.remat->value);
2028 op_t *op = (op_t*)get_irn_link(n);
2029 assert(op && op->is_remat);
2031 if(op->attr.remat.pre) {
2032 ir_fprintf(F, "color:cyan info3:\"remat inverse value: %+F\"", op->attr.remat.remat->value);
2034 ir_fprintf(F, "color:lightcyan info3:\"remat2 inverse value: %+F\"", op->attr.remat.remat->value);
2045 dump_graph_with_remats(ir_graph * irg, const char * suffix)
2047 set_dump_node_vcgattr_hook(mark_remat_nodes_hook);
2048 be_dump(irg, suffix, dump_ir_block_graph_sched);
2049 set_dump_node_vcgattr_hook(NULL);
2054 * Edge hook to dump the schedule edges with annotated register pressure.
2057 sched_pressure_edge_hook(FILE *F, ir_node *irn)
2059 if(sched_is_scheduled(irn) && sched_has_prev(irn)) {
2060 ir_node *prev = sched_prev(irn);
2061 fprintf(F, "edge:{sourcename:\"");
2063 fprintf(F, "\" targetname:\"");
2065 fprintf(F, "\" label:\"%d", (int)get_irn_link(irn));
2066 fprintf(F, "\" color:magenta}\n");
2072 dump_ir_block_graph_sched_pressure(ir_graph *irg, const char *suffix)
2074 DUMP_NODE_EDGE_FUNC old = get_dump_node_edge_hook();
2076 dump_consts_local(0);
2077 set_dump_node_edge_hook(sched_pressure_edge_hook);
2078 dump_ir_block_graph(irg, suffix);
2079 set_dump_node_edge_hook(old);
2083 walker_pressure_annotator(ir_node * bb, void * data)
2085 spill_ilp_t *si = data;
2090 pset *live = pset_new_ptr_default();
2093 live_foreach(bb, li) {
2094 irn = (ir_node *) li->irn;
2096 if (live_is_end(li) && has_reg_class(si, irn)) {
2097 pset_insert_ptr(live, irn);
2101 set_irn_link(bb, INT_TO_PTR(pset_count(live)));
2103 sched_foreach_reverse(bb, irn) {
2105 set_irn_link(irn, INT_TO_PTR(pset_count(live)));
2109 if(has_reg_class(si, irn)) {
2110 pset_remove_ptr(live, irn);
2111 if(is_Proj(irn)) ++projs;
2114 if(!is_Proj(irn)) projs = 0;
2116 for (i = 0, n = get_irn_arity(irn); i < n; ++i) {
2117 ir_node *arg = get_irn_n(irn, i);
2119 if(has_reg_class(si, arg)) pset_insert_ptr(live, arg);
2121 set_irn_link(irn, INT_TO_PTR(pset_count(live)+projs));
2128 dump_pressure_graph(spill_ilp_t * si, const char *suffix)
2130 be_dump(si->chordal_env->irg, suffix, dump_ir_block_graph_sched_pressure);
2135 connect_all_remats_with_keep(spill_ilp_t * si)
2143 n_remats = pset_count(si->all_possible_remats);
2145 ins = obstack_alloc(si->obst, n_remats * sizeof(*ins));
2148 pset_foreach(si->all_possible_remats, irn) {
2153 si->keep = be_new_Keep(si->chordal_env->cls, si->chordal_env->irg, get_irg_end_block(si->chordal_env->irg), n_remats, ins);
2155 obstack_free(si->obst, ins);
2161 connect_all_spills_with_keep(spill_ilp_t * si)
2170 n_spills = pset_count(si->spills);
2172 ins = obstack_alloc(si->obst, n_spills * sizeof(*ins));
2175 pset_foreach(si->spills, irn) {
2180 keep = be_new_Keep(si->chordal_env->cls, si->chordal_env->irg, get_irg_end_block(si->chordal_env->irg), n_spills, ins);
2182 obstack_free(si->obst, ins);
2186 /** insert a spill at an arbitrary position */
2187 ir_node *be_spill2(const arch_env_t *arch_env, ir_node *irn, ir_node *insert, ir_node *ctx)
2189 ir_node *bl = is_Block(insert)?insert:get_nodes_block(insert);
2190 ir_graph *irg = get_irn_irg(bl);
2191 ir_node *frame = get_irg_frame(irg);
2195 const arch_register_class_t *cls = arch_get_irn_reg_class(arch_env, irn, -1);
2196 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
2198 spill = be_new_Spill(cls, cls_frame, irg, bl, frame, irn, ctx);
2201 * search the right insertion point. a spill of a phi cannot be put
2202 * directly after the phi, if there are some phis behind the one which
2203 * is spilled. Also, a spill of a Proj must be after all Projs of the
2206 * Here's one special case:
2207 * If the spill is in the start block, the spill must be after the frame
2208 * pointer is set up. This is done by setting insert to the end of the block
2209 * which is its default initialization (see above).
2212 if(bl == get_irg_start_block(irg) && sched_get_time_step(frame) >= sched_get_time_step(insert))
2215 for (next = sched_next(insert); is_Phi(next) || is_Proj(next); next = sched_next(insert))
2218 sched_add_after(insert, spill);
2223 delete_remat(spill_ilp_t * si, ir_node * remat) {
2226 ir_node *bad = get_irg_bad(si->chordal_env->irg);
2228 sched_remove(remat);
2230 /* kill links to operands */
2231 for (i = -1, n = get_irn_arity(remat); i < n; ++i) {
2232 set_irn_n(remat, i, bad);
2237 clean_remat_info(spill_ilp_t * si)
2242 remat_info_t *remat_info;
2243 ir_node *bad = get_irg_bad(si->chordal_env->irg);
2245 set_foreach(si->remat_info, remat_info) {
2246 if(!remat_info->remats) continue;
2248 pset_foreach(remat_info->remats, remat)
2250 if(remat->proj && get_irn_n_edges(remat->proj) == 0) {
2251 set_irn_n(remat->proj, -1, bad);
2252 set_irn_n(remat->proj, 0, bad);
2255 if(get_irn_n_edges(remat->op) == 0) {
2256 for (i = -1, n = get_irn_arity(remat->op); i < n; ++i) {
2257 set_irn_n(remat->op, i, bad);
2262 if(remat_info->remats) del_pset(remat_info->remats);
2263 if(remat_info->remats_by_operand) del_pset(remat_info->remats_by_operand);
2268 delete_unnecessary_remats(spill_ilp_t * si)
2273 ir_node *bad = get_irg_bad(si->chordal_env->irg);
2276 ir_node *end = get_irg_end(si->chordal_env->irg);
2279 for (i = 0, n = get_irn_arity(si->keep); i < n; ++i) {
2280 ir_node *keep_arg = get_irn_n(si->keep, i);
2281 op_t *arg_op = get_irn_link(keep_arg);
2284 assert(arg_op->is_remat);
2286 name = si->lpp->vars[arg_op->attr.remat.ilp];
2288 if(is_zero(name->value)) {
2289 DBG((si->dbg, LEVEL_3, "\t deleting remat %+F\n", keep_arg));
2290 /* TODO check whether reload is preferred over remat (could be bug) */
2291 delete_remat(si, keep_arg);
2293 if(!arg_op->attr.remat.remat->inverse) {
2294 if(arg_op->attr.remat.pre) {
2295 DBG((si->dbg, LEVEL_2, "\t**remat kept: %+F\n", keep_arg));
2297 DBG((si->dbg, LEVEL_2, "\t%%%%remat2 kept: %+F\n", keep_arg));
2300 if(arg_op->attr.remat.pre) {
2301 DBG((si->dbg, LEVEL_2, "\t**INVERSE remat kept: %+F\n", keep_arg));
2303 DBG((si->dbg, LEVEL_2, "\t%%%%INVERSE remat2 kept: %+F\n", keep_arg));
2308 set_irn_n(si->keep, i, bad);
2311 for (i = 0, n = get_End_n_keepalives(end); i < n; ++i) {
2312 ir_node *end_arg = get_End_keepalive(end, i);
2314 if(end_arg != si->keep) {
2315 obstack_grow(si->obst, &end_arg, sizeof(end_arg));
2318 keeps = obstack_finish(si->obst);
2319 set_End_keepalives(end, n-1, keeps);
2320 obstack_free(si->obst, keeps);
2323 DBG((si->dbg, LEVEL_2, "\t no remats to delete (none have been inserted)\n"));
2328 pset_foreach(si->all_possible_remats, remat) {
2329 op_t *remat_op = get_irn_link(remat);
2330 lpp_name_t *name = si->lpp->vars[remat_op->attr.remat.ilp];
2332 if(is_zero(name->value)) {
2333 DBG((si->dbg, LEVEL_3, "\t deleting remat %+F\n", remat));
2334 /* TODO check whether reload is preferred over remat (could be bug) */
2335 delete_remat(si, remat);
2337 if(!remat_op->attr.remat.remat->inverse) {
2338 if(remat_op->attr.remat.pre) {
2339 DBG((si->dbg, LEVEL_2, "\t**remat kept: %+F\n", remat));
2341 DBG((si->dbg, LEVEL_2, "\t%%%%remat2 kept: %+F\n", remat));
2344 if(remat_op->attr.remat.pre) {
2345 DBG((si->dbg, LEVEL_2, "\t**INVERSE remat kept: %+F\n", remat));
2347 DBG((si->dbg, LEVEL_2, "\t%%%%INVERSE remat2 kept: %+F\n", remat));
2356 * @param before The node after which the spill will be placed in the schedule
2358 /* TODO set context properly */
2360 insert_spill(spill_ilp_t * si, const ir_node * irn, const ir_node * value, const ir_node * before)
2364 const arch_env_t *arch_env = si->chordal_env->birg->main_env->arch_env;
2366 DBG((si->dbg, LEVEL_3, "\t inserting spill for value %+F after %+F\n", irn, before));
2368 spill = be_spill2(arch_env, irn, before, irn);
2370 defs = set_insert_def(si->values, value);
2373 /* enter into the linked list */
2374 set_irn_link(spill, defs->spills);
2375 defs->spills = spill;
2377 #ifdef KEEPALIVE_SPILLS
2378 pset_insert_ptr(si->spills, spill);
2385 * @param before The Phi node which has to be spilled
2388 insert_mem_phi(spill_ilp_t * si, const ir_node * phi)
2396 NEW_ARR_A(ir_node*, ins, get_irn_arity(phi));
2398 for(i=0,n=get_irn_arity(phi); i<n; ++i) {
2399 ins[i] = si->m_unknown;
2402 mem_phi = new_r_Phi(si->chordal_env->irg, get_nodes_block(phi), get_irn_arity(phi), ins, mode_M);
2404 defs = set_insert_def(si->values, phi);
2407 /* enter into the linked list */
2408 set_irn_link(mem_phi, defs->spills);
2409 defs->spills = mem_phi;
2411 #ifdef KEEPALIVE_SPILLS
2412 pset_insert_ptr(si->spills, mem_phi);
2419 * Add remat to list of defs, destroys link field!
2422 insert_remat(spill_ilp_t * si, ir_node * remat)
2425 op_t *remat_op = get_irn_link(remat);
2427 assert(remat_op->is_remat);
2429 defs = set_insert_def(si->values, remat_op->attr.remat.remat->value);
2432 /* enter into the linked list */
2433 set_irn_link(remat, defs->remats);
2434 defs->remats = remat;
2439 collect_spills(spill_ilp_t * si, ir_node * value, pset * spills, pset * visited)
2444 defs = set_find_def(si->values, value);
2446 if(defs && defs->spills) {
2447 for(next = defs->spills; next; next = get_irn_link(next)) {
2448 pset_insert_ptr(spills, next);
2450 } else if (is_Phi(value)) {
2452 if(!pset_find_ptr(visited, value)) {
2456 pset_insert_ptr(visited, value);
2457 for(i=0, n=get_irn_arity(value); i<n; ++i) {
2458 ir_node *arg = get_irn_n(value, i);
2460 collect_spills(si, arg, spills, visited);
2464 // assert(0 && "Phi operand not spilled");
2470 get_spills_for_value(spill_ilp_t * si, ir_node * value)
2472 pset *spills = pset_new_ptr_default();
2473 // pset *visited = pset_new_ptr_default();
2475 // collect_spills(si, value, spills, visited);
2476 // del_pset(visited);
2480 defs = set_find_def(si->values, value);
2482 if(defs && defs->spills) {
2483 for(next = defs->spills; next; next = get_irn_link(next)) {
2484 pset_insert_ptr(spills, next);
2492 * Add reload before operation and add to list of defs
2495 insert_reload(spill_ilp_t * si, const ir_node * value, const ir_node * after)
2500 const arch_env_t *arch_env = si->chordal_env->birg->main_env->arch_env;
2502 DBG((si->dbg, LEVEL_3, "\t inserting reload for value %+F before %+F\n", value, after));
2504 defs = set_find_def(si->values, value);
2505 /* get a spill of this value */
2507 if((!defs || !defs->spills) && is_Phi(value)) {
2510 spills = get_spills_for_value(si, value);
2512 spill = pset_first(spills);
2516 defs = set_insert_def(si->values, value);
2518 defs->spills = spill;
2519 set_irn_link(spill, NULL);
2521 spill = defs->spills;
2524 spill = defs->spills;
2525 assert(spill && "no spill placed before reload");
2527 reload = be_reload(arch_env, si->cls, after, get_irn_mode(value), spill);
2529 /* enter into the linked list */
2530 set_irn_link(reload, defs->remats);
2531 defs->remats = reload;
2537 walker_spill_placer(ir_node * bb, void * data) {
2538 spill_ilp_t *si = (spill_ilp_t*)data;
2540 spill_bb_t *spill_bb = get_irn_link(bb);
2541 pset *spills_to_do = pset_new_ptr_default();
2544 set_foreach(spill_bb->ilp, spill) {
2547 if(is_Phi(spill->irn) && get_nodes_block(spill->irn) == bb) {
2548 name = si->lpp->vars[spill->mem_in];
2549 if(!is_zero(name->value)) {
2552 mem_phi = insert_mem_phi(si, spill->irn);
2554 DBG((si->dbg, LEVEL_2, "\t >>spilled Phi %+F -> %+F\n", spill->irn, mem_phi));
2558 if(spill->spill != ILP_UNDEF) {
2559 name = si->lpp->vars[spill->spill];
2560 if(!is_zero(name->value)) {
2561 if(spill->reg_in > 0) {
2562 name = si->lpp->vars[spill->reg_in];
2563 if(!is_zero(name->value)) {
2564 insert_spill(si, spill->irn, spill->irn, bb);
2568 pset_insert_ptr(spills_to_do, spill->irn);
2572 DBG((si->dbg, LEVEL_3, "\t %d spills to do in block %+F\n", pset_count(spills_to_do), bb));
2575 for(irn = sched_block_first_nonphi(bb); !sched_is_end(irn); irn = sched_next(irn)) {
2576 op_t *op = get_irn_link(irn);
2578 if(be_is_Spill(irn)) continue;
2581 /* TODO fix this if we want to support remats with more than two nodes */
2582 if(get_irn_mode(irn) != mode_T && pset_find_ptr(spills_to_do, op->attr.remat.remat->value)) {
2583 pset_remove_ptr(spills_to_do, op->attr.remat.remat->value);
2585 insert_spill(si, irn, op->attr.remat.remat->value, irn);
2588 if(pset_find_ptr(spills_to_do, irn)) {
2589 pset_remove_ptr(spills_to_do, irn);
2591 insert_spill(si, irn, irn, irn);
2597 assert(pset_count(spills_to_do) == 0);
2599 /* afterwards free data in block */
2600 del_pset(spills_to_do);
2604 phim_fixer(spill_ilp_t *si) {
2607 set_foreach(si->values, defs) {
2608 const ir_node *phi = defs->value;
2609 const ir_node *phi_m = defs->spills;
2613 if(!is_Phi(phi)) continue;
2614 if(!phi_m || !is_Phi(phi_m) || get_irn_mode(phi_m) != mode_M) continue;
2616 for(i=0,n=get_irn_arity(phi); i<n; ++i) {
2617 const ir_node *value = get_irn_n(phi, i);
2618 defs_t *val_defs = set_find_def(si->values, value);
2620 /* get a spill of this value */
2621 ir_node *spill = val_defs->spills;
2623 assert(spill && "no spill placed before PhiM");
2625 set_irn_n(phi_m, i, spill);
2631 walker_reload_placer(ir_node * bb, void * data) {
2632 spill_ilp_t *si = (spill_ilp_t*)data;
2634 spill_bb_t *spill_bb = get_irn_link(bb);
2638 sched_foreach_reverse(bb, irn) {
2639 op_t *op = get_irn_link(irn);
2641 if(be_is_Reload(irn) || be_is_Spill(irn)) continue;
2642 if(is_Phi(irn)) break;
2645 if(get_irn_mode(irn) != mode_T) {
2646 insert_remat(si, irn);
2651 for (i = 0, n = get_irn_arity(irn); i < n; ++i) {
2652 ir_node *arg = get_irn_n(irn, i);
2654 if(op->attr.live_range.reloads && op->attr.live_range.reloads[i] != ILP_UNDEF) {
2657 name = si->lpp->vars[op->attr.live_range.reloads[i]];
2658 if(!is_zero(name->value)) {
2660 ir_node *insert_pos = irn;
2661 ir_node *prev = sched_prev(insert_pos);
2662 op_t *prev_op = get_irn_link(prev);
2664 /* insert reload before pre-remats */
2665 while(!sched_is_end(prev) && !be_is_Reload(prev) && !be_is_Spill(prev)
2666 && prev_op->is_remat && prev_op->attr.remat.pre) {
2669 prev = sched_prev(insert_pos);
2670 prev_op = get_irn_link(prev);
2673 reload = insert_reload(si, arg, insert_pos);
2675 set_irn_n(irn, i, reload);
2677 #ifdef KEEPALIVE_RELOADS
2678 pset_insert_ptr(si->spills, reload);
2686 /* reloads at end of block */
2687 if(spill_bb->reloads) {
2689 live_foreach(bb, li) {
2690 ir_node *irn = (ir_node *) li->irn;
2692 if (live_is_end(li) && has_reg_class(si, irn) && !pset_find_ptr(si->all_possible_remats, irn)) {
2695 name = si->lpp->vars[spill_bb->reloads[i]];
2696 if(!is_zero(name->value)) {
2698 ir_node *insert_pos = bb;
2699 ir_node *prev = sched_prev(insert_pos);
2700 op_t *prev_op = get_irn_link(prev);
2702 /* insert reload before pre-remats */
2703 while(!sched_is_end(prev) && !be_is_Reload(prev) && !be_is_Spill(prev)
2704 && prev_op->is_remat && prev_op->attr.remat.pre) {
2707 prev = sched_prev(insert_pos);
2708 prev_op = get_irn_link(prev);
2711 reload = insert_reload(si, irn, insert_pos);
2713 #ifdef KEEPALIVE_RELOADS
2714 pset_insert_ptr(si->spills, reload);
2722 del_set(spill_bb->ilp);
2726 walker_collect_used(ir_node * irn, void * data)
2728 lc_bitset_t *used = data;
2730 lc_bitset_set(used, get_irn_idx(irn));
2734 walker_kill_unused(ir_node * bb, void * data)
2736 lc_bitset_t *used = data;
2737 const ir_node *bad = get_irg_bad(get_irn_irg(bb));
2741 for(irn=sched_first(bb); !sched_is_end(irn);) {
2742 ir_node *next = sched_next(irn);
2746 if(!lc_bitset_is_set(used, get_irn_idx(irn))) {
2747 assert(!be_is_Spill(irn) && !be_is_Reload(irn) && "something is fishy, spill or remat is unused");
2751 set_nodes_block(irn, bad);
2752 for (i = 0, n = get_irn_arity(irn); i < n; ++i) {
2753 set_irn_n(irn, i, bad);
2761 kill_all_unused_values_in_schedule(spill_ilp_t * si)
2763 lc_bitset_t *used = lc_bitset_malloc(get_irg_last_idx(si->chordal_env->irg));
2765 irg_walk_graph(si->chordal_env->irg, walker_collect_used, NULL, used);
2766 irg_block_walk_graph(si->chordal_env->irg, walker_kill_unused, NULL, used);
2768 lc_bitset_free(used);
2772 print_irn_pset(pset * p)
2776 pset_foreach(p, irn) {
2777 ir_printf("%+F\n", irn);
2782 rewire_uses(spill_ilp_t * si)
2784 dom_front_info_t *dfi = be_compute_dominance_frontiers(si->chordal_env->irg);
2787 /* then fix uses of spills */
2788 set_foreach(si->values, defs) {
2791 ir_node *next = defs->remats;
2795 reloads = pset_new_ptr_default();
2798 if(be_is_Reload(next)) {
2799 pset_insert_ptr(reloads, next);
2803 next = get_irn_link(next);
2806 spills = get_spills_for_value(si, defs->value);
2807 DBG((si->dbg, LEVEL_2, "\t %d remats, %d reloads, and %d spills for value %+F\n", remats, pset_count(reloads), pset_count(spills), defs->value));
2808 if(pset_count(spills) > 1) {
2809 assert(pset_count(reloads) > 0);
2810 // print_irn_pset(spills);
2811 // print_irn_pset(reloads);
2813 // be_ssa_constr_set_uses(dfi, spills, reloads);
2814 be_ssa_constr_set(dfi, spills);
2822 /* first fix uses of remats and reloads */
2823 set_foreach(si->values, defs) {
2825 ir_node *next = defs->remats;
2828 nodes = pset_new_ptr_default();
2829 pset_insert_ptr(nodes, defs->value);
2832 pset_insert_ptr(nodes, next);
2833 next = get_irn_link(next);
2836 if(pset_count(nodes) > 1) {
2837 DBG((si->dbg, LEVEL_4, "\t %d new definitions for value %+F\n", pset_count(nodes)-1, defs->value));
2838 be_ssa_constr_set(dfi, nodes);
2845 // remove_unused_defs(si);
2847 be_free_dominance_frontiers(dfi);
2851 writeback_results(spill_ilp_t * si)
2853 /* walk through the graph and collect all spills, reloads and remats for a value */
2855 si->values = new_set(cmp_defs, 4096);
2857 DBG((si->dbg, LEVEL_1, "Applying results\n"));
2858 delete_unnecessary_remats(si);
2859 si->m_unknown = new_r_Unknown(si->chordal_env->irg, mode_M);
2860 irg_block_walk_graph(si->chordal_env->irg, walker_spill_placer, NULL, si);
2862 irg_block_walk_graph(si->chordal_env->irg, walker_reload_placer, NULL, si);
2864 /* clean the remat info! there are still back-edges leading there! */
2865 clean_remat_info(si);
2869 connect_all_spills_with_keep(si);
2871 del_set(si->values);
2875 get_n_regs(spill_ilp_t * si)
2877 int arch_n_regs = arch_register_class_n_regs(si->cls);
2881 for(i=0; i<arch_n_regs; i++) {
2882 if(!arch_register_type_is(&si->cls->regs[i], ignore)) {
2887 DBG((si->dbg, LEVEL_1, "\tArchitecture has %d free registers in class %s\n", free, si->cls->name));
2892 walker_reload_mover(ir_node * bb, void * data)
2894 spill_ilp_t *si = data;
2897 sched_foreach(bb, tmp) {
2898 if(be_is_Reload(tmp) && has_reg_class(si, tmp)) {
2899 ir_node *reload = tmp;
2902 /* move reload upwards */
2904 int pressure = (int)get_irn_link(reload);
2905 if(pressure < si->n_regs) {
2906 irn = sched_prev(reload);
2907 DBG((si->dbg, LEVEL_5, "regpressure before %+F: %d\n", reload, pressure));
2908 sched_remove(reload);
2909 pressure = (int)get_irn_link(irn);
2911 while(pressure < si->n_regs) {
2912 if(sched_is_end(irn) || (be_is_Reload(irn) && has_reg_class(si, irn))) break;
2914 set_irn_link(irn, INT_TO_PTR(pressure+1));
2915 DBG((si->dbg, LEVEL_5, "new regpressure before %+F: %d\n", irn, pressure+1));
2916 irn = sched_prev(irn);
2918 pressure = (int)get_irn_link(irn);
2921 DBG((si->dbg, LEVEL_3, "putting reload %+F after %+F\n", reload, irn));
2922 sched_put_after(irn, reload);
2929 move_reloads_upward(spill_ilp_t * si)
2931 irg_block_walk_graph(si->chordal_env->irg, walker_reload_mover, NULL, si);
2935 be_spill_remat(const be_chordal_env_t * chordal_env)
2937 char problem_name[256];
2938 char dump_suffix[256];
2939 char dump_suffix2[256];
2940 char dump_suffix3[256];
2941 struct obstack obst;
2944 ir_snprintf(problem_name, sizeof(problem_name), "%F_%s", chordal_env->irg, chordal_env->cls->name);
2945 ir_snprintf(dump_suffix, sizeof(dump_suffix), "-%s-remats", chordal_env->cls->name);
2946 ir_snprintf(dump_suffix2, sizeof(dump_suffix2), "-%s-pressure", chordal_env->cls->name);
2947 ir_snprintf(dump_suffix3, sizeof(dump_suffix3), "-%s-reloads_moved", chordal_env->cls->name);
2949 FIRM_DBG_REGISTER(si.dbg, "firm.be.ra.spillremat");
2950 DBG((si.dbg, LEVEL_1, "\n\n\t\t===== Processing %s =====\n\n", problem_name));
2952 obstack_init(&obst);
2953 si.chordal_env = chordal_env;
2955 si.senv = be_new_spill_env(chordal_env, is_mem_phi, &si);
2956 si.cls = chordal_env->cls;
2957 si.lpp = new_lpp(problem_name, lpp_minimize);
2958 si.remat_info = new_set(cmp_remat_info, 4096);
2959 si.all_possible_remats = pset_new_ptr_default();
2960 si.spills = pset_new_ptr_default();
2961 si.inverse_ops = pset_new_ptr_default();
2962 #ifndef EXECFREQ_LOOPDEPH
2963 si.execfreqs = compute_execfreq(chordal_env->irg);
2965 si.execfreqs = NULL;
2970 si.n_regs = get_n_regs(&si);
2972 set_irg_link(chordal_env->irg, &si);
2973 compute_doms(chordal_env->irg);
2975 #ifdef COLLECT_REMATS
2976 /* collect remats */
2977 DBG((si.dbg, LEVEL_1, "Collecting remats\n"));
2978 irg_walk_graph(chordal_env->irg, walker_remat_collector, NULL, &si);
2981 /* insert possible remats */
2982 DBG((si.dbg, LEVEL_1, "Inserting possible remats\n"));
2983 irg_block_walk_graph(chordal_env->irg, walker_remat_insertor, NULL, &si);
2984 DBG((si.dbg, LEVEL_2, " -> inserted %d possible remats\n", pset_count(si.all_possible_remats)));
2987 DBG((si.dbg, LEVEL_1, "Connecting remats with keep and dumping\n"));
2988 connect_all_remats_with_keep(&si);
2989 /* dump graph with inserted remats */
2990 dump_graph_with_remats(chordal_env->irg, dump_suffix);
2994 /* recompute liveness */
2995 DBG((si.dbg, LEVEL_1, "Recomputing liveness\n"));
2996 be_liveness(chordal_env->irg);
3000 DBG((si.dbg, LEVEL_1, "\tBuilding ILP\n"));
3001 DBG((si.dbg, LEVEL_2, "\t endwalker\n"));
3002 irg_block_walk_graph(chordal_env->irg, luke_endwalker, NULL, &si);
3004 DBG((si.dbg, LEVEL_2, "\t blockwalker\n"));
3005 irg_block_walk_graph(chordal_env->irg, luke_blockwalker, NULL, &si);
3012 ir_snprintf(buf, sizeof(buf), "%s-spillremat.ilp", problem_name);
3013 if ((f = fopen(buf, "wt")) != NULL) {
3014 lpp_dump_plain(si.lpp, f);
3021 DBG((si.dbg, LEVEL_1, "\tSolving %F\n", chordal_env->irg));
3022 lpp_set_time_limit(si.lpp, ILP_TIMEOUT);
3025 lpp_solve_cplex(si.lpp);
3027 lpp_solve_net(si.lpp, LPP_SERVER, LPP_SOLVER);
3029 assert(lpp_is_sol_valid(si.lpp)
3030 && "solution of ILP must be valid");
3032 DBG((si.dbg, LEVEL_1, "\t%s: iterations: %d, solution time: %g, objective function: %g\n", problem_name, si.lpp->iterations, si.lpp->sol_time, is_zero(si.lpp->objval)?0.0:si.lpp->objval));
3034 #ifdef DUMP_SOLUTION
3039 ir_snprintf(buf, sizeof(buf), "%s-spillremat.sol", problem_name);
3040 if ((f = fopen(buf, "wt")) != NULL) {
3042 for (i = 0; i < si.lpp->var_next; ++i) {
3043 lpp_name_t *name = si.lpp->vars[i];
3044 fprintf(f, "%20s %4d %10f\n", name->name, name->nr, name->value);
3051 writeback_results(&si);
3055 kill_all_unused_values_in_schedule(&si);
3057 // be_dump(chordal_env->irg, "-bla", dump_ir_block_graph);
3059 be_liveness(chordal_env->irg);
3060 irg_block_walk_graph(chordal_env->irg, walker_pressure_annotator, NULL, &si);
3062 dump_pressure_graph(&si, dump_suffix2);
3064 // TODO fix temporarily exceeded regpressure due to remat2s
3066 // TODO insert copys to fix interferences in memory
3068 // move reloads upwards
3069 move_reloads_upward(&si);
3070 irg_block_walk_graph(chordal_env->irg, walker_pressure_annotator, NULL, &si);
3071 dump_pressure_graph(&si, dump_suffix3);
3073 free_dom(chordal_env->irg);
3074 del_pset(si.inverse_ops);
3075 del_pset(si.all_possible_remats);
3076 del_pset(si.spills);
3077 #ifndef EXECFREQ_LOOPDEPH
3078 free_execfreq(si.execfreqs);
3081 obstack_free(&obst, NULL);
3085 #else /* WITH_ILP */
3088 only_that_you_can_compile_without_WITH_ILP_defined(void)
3092 #endif /* WITH_ILP */