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
32 #include "phiclass_t.h"
39 #include <lpp/lpp_net.h>
40 #include <lpp/lpp_cplex.h>
41 //#include <lc_pset.h>
42 #include <libcore/lc_bitset.h>
46 #include "besched_t.h"
51 #include "bespillremat.h"
53 #include "bepressurestat.h"
55 #include "bechordal_t.h"
58 #include <libcore/lc_opts.h>
59 #include <libcore/lc_opts_enum.h>
60 #endif /* WITH_LIBCORE */
62 #define DUMP_PROBLEM 1
64 #define DUMP_SOLUTION 4
66 #define KEEPALIVE_REMATS 1
67 #define KEEPALIVE_SPILLS 2
68 #define KEEPALIVE_RELOADS 4
70 #define VERIFY_MEMINTERF 1
71 #define VERIFY_DOMINANCE 2
74 #define REMATS_BRIGGS 1
75 #define REMATS_NOINVERSE 2
78 static int opt_dump_flags = 0;
79 static int opt_log = 0;
80 static int opt_keep_alive = 0;
81 static int opt_goodwin = 1;
82 static int opt_memcopies = 1;
83 static int opt_memoperands = 1;
84 static int opt_verify = VERIFY_MEMINTERF;
85 static int opt_remats = REMATS_ALL;
86 static int opt_repair_schedule = 0;
87 static int opt_no_enlarge_liveness = 0;
88 static int opt_remat_while_live = 1;
89 static int opt_timeout = 300;
90 static double opt_cost_reload = 8.0;
91 static double opt_cost_memoperand = 7.0;
92 static double opt_cost_spill = 50.0;
93 static double opt_cost_remat = 1.0;
97 static const lc_opt_enum_mask_items_t dump_items[] = {
98 { "problem", DUMP_PROBLEM },
100 { "solution", DUMP_SOLUTION },
104 static lc_opt_enum_mask_var_t dump_var = {
105 &opt_dump_flags, dump_items
108 static const lc_opt_enum_mask_items_t keepalive_items[] = {
109 { "remats", KEEPALIVE_REMATS },
110 { "spills", KEEPALIVE_SPILLS },
111 { "reloads", KEEPALIVE_RELOADS },
115 static lc_opt_enum_mask_var_t keep_alive_var = {
116 &opt_keep_alive, keepalive_items
119 static const lc_opt_enum_mask_items_t remats_items[] = {
120 { "none", REMATS_NONE },
121 { "briggs", REMATS_BRIGGS },
122 { "noinverse", REMATS_NOINVERSE },
123 { "all", REMATS_ALL },
127 static lc_opt_enum_mask_var_t remats_var = {
128 &opt_remats, remats_items
131 static const lc_opt_table_entry_t options[] = {
132 LC_OPT_ENT_ENUM_MASK("keepalive", "keep alive remats, spills or reloads", &keep_alive_var),
134 LC_OPT_ENT_BOOL ("goodwin", "activate goodwin reduction", &opt_goodwin),
135 LC_OPT_ENT_BOOL ("memcopies", "activate memcopy handling", &opt_memcopies),
136 LC_OPT_ENT_BOOL ("memoperands", "activate memoperands", &opt_memoperands),
137 LC_OPT_ENT_ENUM_INT ("remats", "type of remats to insert (none, briggs, noinverse or all)",&remats_var),
138 LC_OPT_ENT_BOOL ("repair_schedule", "repair the schedule by rematting once used nodes",&opt_repair_schedule),
139 LC_OPT_ENT_BOOL ("no_enlage_liveness", "do not enlarge liveness of operands of remats",&opt_no_enlarge_liveness),
140 LC_OPT_ENT_BOOL ("remat_while_live", "remat only values that can be used by real ops", &opt_remat_while_live),
142 LC_OPT_ENT_ENUM_MASK("dump", "dump problem, mps or solution", &dump_var),
143 LC_OPT_ENT_BOOL ("log", "activate the lpp log", &opt_log),
144 LC_OPT_ENT_INT ("timeout", "ILP solver timeout", &opt_timeout),
146 LC_OPT_ENT_DBL ("cost_reload", "cost of a reload", &opt_cost_reload),
147 LC_OPT_ENT_DBL ("cost_memoperand", "cost of a memory operand", &opt_cost_memoperand),
148 LC_OPT_ENT_DBL ("cost_spill", "cost of a spill instruction", &opt_cost_spill),
149 LC_OPT_ENT_DBL ("cost_remat", "cost of a rematerialization", &opt_cost_remat),
153 void be_spill_remat_register_options(lc_opt_entry_t *grp)
155 lc_opt_entry_t *my_grp = lc_opt_get_grp(grp, "remat");
156 lc_opt_add_table(my_grp, options);
161 //#define EXECFREQ_LOOPDEPH /* compute execution frequency from loop depth only */
162 //#define SCHEDULE_PHIM /* insert phim nodes into schedule */
165 //#define SOLVE_LOCAL
166 #define LPP_SERVER "i44pc52"
167 #define LPP_SOLVER "cplex"
170 #define MAX_PATHS INT_MAX
173 typedef struct _spill_ilp_t {
174 const arch_register_class_t *cls;
176 const be_chordal_env_t *chordal_env;
179 struct obstack *obst;
181 pset *all_possible_remats;
184 set *values; /**< for collecting all definitions of values before running ssa-construction */
189 DEBUG_ONLY(firm_dbg_module_t * dbg);
192 typedef int ilp_var_t;
193 typedef int ilp_cst_t;
195 typedef struct _spill_bb_t {
200 typedef struct _remat_t {
201 const ir_node *op; /**< for copy_irn */
202 const ir_node *value; /**< the value which is being recomputed by this remat */
203 const ir_node *proj; /**< not NULL if the above op produces a tuple */
204 int cost; /**< cost of this remat */
205 int inverse; /**< nonzero if this is an inverse remat */
209 * Data to be attached to each IR node. For remats this contains the ilp_var
210 * for this remat and for normal ops this contains the ilp_vars for
211 * reloading each operand
213 typedef struct _op_t {
218 const remat_t *remat; /** the remat this op belongs to */
219 int pre; /** 1, if this is a pressure-increasing remat */
223 ir_node *op; /** the operation this live range belongs to */
232 typedef struct _defs_t {
233 const ir_node *value;
234 ir_node *spills; /**< points to the first spill for this value (linked by link field) */
235 ir_node *remats; /**< points to the first definition for this value (linked by link field) */
238 typedef struct _remat_info_t {
239 const ir_node *irn; /**< the irn to which these remats belong */
240 pset *remats; /**< possible remats for this value */
241 pset *remats_by_operand; /**< remats with this value as operand */
244 typedef struct _keyval_t {
249 typedef struct _spill_t {
258 typedef struct _memoperand_t {
259 ir_node *irn; /**< the irn */
260 unsigned int pos; /**< the position of the argument */
261 ilp_var_t ilp; /**< the ilp var for this memory operand */
265 has_reg_class(const spill_ilp_t * si, const ir_node * irn)
267 return chordal_has_class(si->chordal_env, irn);
272 cmp_remat(const void *a, const void *b)
274 const keyval_t *p = a;
275 const keyval_t *q = b;
276 const remat_t *r = p->val;
277 const remat_t *s = q->val;
281 return !(r == s || r->op == s->op);
285 cmp_remat(const void *a, const void *b)
287 const remat_t *r = a;
288 const remat_t *s = a;
290 return !(r == s || r->op == s->op);
294 cmp_spill(const void *a, const void *b, size_t size)
296 const spill_t *p = a;
297 const spill_t *q = b;
299 // return !(p->irn == q->irn && p->bb == q->bb);
300 return !(p->irn == q->irn);
304 cmp_memoperands(const void *a, const void *b, size_t size)
306 const memoperand_t *p = a;
307 const memoperand_t *q = b;
309 return !(p->irn == q->irn && p->pos == q->pos);
313 set_find_keyval(set * set, const void * key)
318 return set_find(set, &query, sizeof(query), HASH_PTR(key));
322 set_insert_keyval(set * set, void * key, void * val)
328 return set_insert(set, &query, sizeof(query), HASH_PTR(key));
332 set_find_def(set * set, const ir_node * value)
337 return set_find(set, &query, sizeof(query), HASH_PTR(value));
341 set_insert_def(set * set, const ir_node * value)
348 return set_insert(set, &query, sizeof(query), HASH_PTR(value));
351 static memoperand_t *
352 set_insert_memoperand(set * set, ir_node * irn, unsigned int pos, ilp_var_t ilp)
359 return set_insert(set, &query, sizeof(query), HASH_PTR(irn)+pos);
362 static memoperand_t *
363 set_find_memoperand(set * set, const ir_node * irn, unsigned int pos)
367 query.irn = (ir_node*)irn;
369 return set_find(set, &query, sizeof(query), HASH_PTR(irn)+pos);
374 set_find_spill(set * set, const ir_node * value)
378 query.irn = (ir_node*)value;
379 return set_find(set, &query, sizeof(query), HASH_PTR(value));
382 #define pset_foreach(s,i) for((i)=pset_first((s)); (i); (i)=pset_next((s)))
383 #define set_foreach(s,i) for((i)=set_first((s)); (i); (i)=set_next((s)))
384 #define foreach_post_remat(s,i) for((i)=next_post_remat((s)); (i); (i)=next_post_remat((i)))
385 #define foreach_pre_remat(si,s,i) for((i)=next_pre_remat((si),(s)); (i); (i)=next_pre_remat((si),(i)))
386 #define sched_foreach_op(s,i) for((i)=sched_next_op((s));!sched_is_end((i));(i)=sched_next_op((i)))
389 cmp_remat_info(const void *a, const void *b, size_t size)
391 const remat_info_t *p = a;
392 const remat_info_t *q = b;
394 return !(p->irn == q->irn);
398 cmp_defs(const void *a, const void *b, size_t size)
403 return !(p->value == q->value);
407 cmp_keyval(const void *a, const void *b, size_t size)
409 const keyval_t *p = a;
410 const keyval_t *q = b;
412 return !(p->key == q->key);
416 execution_frequency(const spill_ilp_t *si, const ir_node * irn)
419 #ifndef EXECFREQ_LOOPDEPH
420 return get_block_execfreq(si->chordal_env->exec_freq, get_block(irn)) + FUDGE;
423 return exp(get_loop_depth(get_irn_loop(irn)) * log(10)) + FUDGE;
425 return exp(get_loop_depth(get_irn_loop(get_nodes_block(irn))) * log(10)) + FUDGE;
430 get_cost(const spill_ilp_t * si, const ir_node * irn)
432 if(be_is_Spill(irn)) {
433 return opt_cost_spill;
434 } else if(be_is_Reload(irn)){
435 return opt_cost_reload;
437 return arch_get_op_estimated_cost(si->chordal_env->birg->main_env->arch_env, irn);
442 * Checks, whether node and its operands have suitable reg classes
445 is_rematerializable(const spill_ilp_t * si, const ir_node * irn)
448 const arch_env_t *arch_env = si->chordal_env->birg->main_env->arch_env;
449 int remat = (arch_irn_get_flags(arch_env, irn) & arch_irn_flags_rematerializable) != 0;
453 ir_fprintf(stderr, " Node %+F is not rematerializable\n", irn);
456 for (n = get_irn_arity(irn)-1; n>=0 && remat; --n) {
457 ir_node *op = get_irn_n(irn, n);
458 remat &= has_reg_class(si, op) || arch_irn_get_flags(arch_env, op) & arch_irn_flags_ignore || (get_irn_op(op) == op_NoMem);
461 // ir_fprintf(stderr, " Argument %d (%+F) of Node %+F has wrong regclass\n", i, op, irn);
468 * Try to create a remat from @p op with destination value @p dest_value
470 static INLINE remat_t *
471 get_remat_from_op(spill_ilp_t * si, const ir_node * dest_value, const ir_node * op)
473 remat_t *remat = NULL;
475 // if(!mode_is_datab(get_irn_mode(dest_value)))
478 if(dest_value == op) {
479 const ir_node *proj = NULL;
481 if(is_Proj(dest_value)) {
482 op = get_Proj_pred(op);
486 if(!is_rematerializable(si, op))
489 remat = obstack_alloc(si->obst, sizeof(*remat));
491 remat->cost = get_cost(si, op);
492 remat->value = dest_value;
496 arch_inverse_t inverse;
499 /* get the index of the operand we want to retrieve by the inverse op */
500 for (n = get_irn_arity(op)-1; n>=0; --n) {
501 ir_node *arg = get_irn_n(op, n);
503 if(arg == dest_value) break;
507 DBG((si->dbg, LEVEL_5, "\t requesting inverse op for argument %d of op %+F\n", n, op));
509 /* else ask the backend to give an inverse op */
510 if(arch_get_inverse(si->chordal_env->birg->main_env->arch_env, op, n, &inverse, si->obst)) {
513 DBG((si->dbg, LEVEL_4, "\t backend gave us an inverse op with %d nodes and cost %d\n", inverse.n, inverse.costs));
515 assert(inverse.n > 0 && "inverse op should have at least one node");
517 for(i=inverse.n-1; i>=0; --i) {
518 pset_insert_ptr(si->inverse_ops, inverse.nodes[i]);
522 remat = obstack_alloc(si->obst, sizeof(*remat));
523 remat->op = inverse.nodes[0];
524 remat->cost = inverse.costs;
525 remat->value = dest_value;
526 remat->proj = (inverse.n==2)?inverse.nodes[1]:NULL;
529 assert(is_Proj(remat->proj));
531 assert(0 && "I can not handle remats with more than 2 nodes");
538 DBG((si->dbg, LEVEL_3, "\t >Found remat %+F for %+F from %+F with %+F\n", remat->op, dest_value, op, remat->proj));
540 DBG((si->dbg, LEVEL_3, "\t >Found remat %+F for %+F from %+F\n", remat->op, dest_value, op));
548 add_remat(const spill_ilp_t * si, const remat_t * remat)
550 remat_info_t *remat_info,
555 assert(remat->value);
557 query.irn = remat->value;
559 query.remats_by_operand = NULL;
560 remat_info = set_insert(si->remat_info, &query, sizeof(query), HASH_PTR(remat->value));
562 if(remat_info->remats == NULL) {
563 remat_info->remats = new_pset(cmp_remat, 4096);
565 pset_insert(remat_info->remats, remat, HASH_PTR(remat->op));
567 /* insert the remat into the remats_be_operand set of each argument of the remat op */
568 for (n = get_irn_arity(remat->op)-1; n>=0; --n) {
569 ir_node *arg = get_irn_n(remat->op, n);
573 query.remats_by_operand = NULL;
574 remat_info = set_insert(si->remat_info, &query, sizeof(query), HASH_PTR(arg));
576 if(remat_info->remats_by_operand == NULL) {
577 remat_info->remats_by_operand = new_pset(cmp_remat, 4096);
579 pset_insert(remat_info->remats_by_operand, remat, HASH_PTR(remat->op));
584 get_irn_n_nonremat_edges(const spill_ilp_t * si, const ir_node * irn)
586 const ir_edge_t *edge = get_irn_out_edge_first(irn);
590 if(!pset_find_ptr(si->inverse_ops, edge->src)) {
593 edge = get_irn_out_edge_next(irn, edge);
600 get_irn_n_nonignore_args(const spill_ilp_t * si, const ir_node * irn)
606 // irn = get_Proj_pred(irn);
608 for(n=get_irn_arity(irn)-1; n>=0; --n) {
609 const ir_node *arg = get_irn_n(irn, n);
611 if(has_reg_class(si, arg)) ++ret;
618 get_remats_from_op(spill_ilp_t * si, const ir_node * op)
623 if( has_reg_class(si, op)
624 && (opt_repair_schedule || get_irn_n_nonremat_edges(si, op) > 1)
625 && (opt_remats != REMATS_BRIGGS || get_irn_n_nonignore_args(si, op) == 0)
627 remat = get_remat_from_op(si, op, op);
629 add_remat(si, remat);
633 if(opt_remats == REMATS_ALL) {
634 /* repeat the whole stuff for each remat retrieved by get_remat_from_op(op, arg)
636 for (n = get_irn_arity(op)-1; n>=0; --n) {
637 ir_node *arg = get_irn_n(op, n);
639 if(has_reg_class(si, arg)) {
640 /* try to get an inverse remat */
641 remat = get_remat_from_op(si, arg, op);
643 add_remat(si, remat);
651 value_is_defined_before(const spill_ilp_t * si, const ir_node * pos, const ir_node * val)
654 ir_node *def_block = get_nodes_block(val);
660 /* if pos is at end of a basic block */
662 ret = (pos == def_block || block_dominates(def_block, pos));
663 // ir_fprintf(stderr, "(def(bb)=%d) ", ret);
667 /* else if this is a normal operation */
668 block = get_nodes_block(pos);
669 if(block == def_block) {
670 if(!sched_is_scheduled(val)) return 1;
672 ret = sched_comes_after(val, pos);
673 // ir_fprintf(stderr, "(def(same block)=%d) ",ret);
677 ret = block_dominates(def_block, block);
678 // ir_fprintf(stderr, "(def(other block)=%d) ", ret);
682 static INLINE ir_node *
683 sched_block_last_noncf(const spill_ilp_t * si, const ir_node * bb)
685 return sched_skip((ir_node*)bb, 0, sched_skip_cf_predicator, (void *) si->chordal_env->birg->main_env->arch_env);
689 * Returns first non-Phi node of block @p bb
691 static INLINE ir_node *
692 sched_block_first_nonphi(const ir_node * bb)
694 return sched_skip((ir_node*)bb, 1, sched_skip_phi_predicator, NULL);
698 sched_skip_proj_predicator(const ir_node * irn, void * data)
700 return (is_Proj(irn));
703 static INLINE ir_node *
704 sched_next_nonproj(const ir_node * irn, int forward)
706 return sched_skip((ir_node*)irn, forward, sched_skip_proj_predicator, NULL);
710 * Returns next operation node (non-Proj) after @p irn
711 * or the basic block of this node
713 static INLINE ir_node *
714 sched_next_op(const ir_node * irn)
716 ir_node *next = sched_next(irn);
721 return sched_next_nonproj(next, 1);
725 * Returns previous operation node (non-Proj) before @p irn
726 * or the basic block of this node
728 static INLINE ir_node *
729 sched_prev_op(const ir_node * irn)
731 ir_node *prev = sched_prev(irn);
736 return sched_next_nonproj(prev, 0);
740 sched_put_after(ir_node * insert, ir_node * irn)
742 if(is_Block(insert)) {
743 insert = sched_block_first_nonphi(insert);
745 insert = sched_next_op(insert);
747 sched_add_before(insert, irn);
751 sched_put_before(const spill_ilp_t * si, ir_node * insert, ir_node * irn)
753 if(is_Block(insert)) {
754 insert = sched_block_last_noncf(si, insert);
756 insert = sched_next_nonproj(insert, 0);
757 insert = sched_prev(insert);
759 sched_add_after(insert, irn);
763 * Tells you whether a @p remat can be placed before the irn @p pos
766 can_remat_before(const spill_ilp_t * si, const remat_t * remat, const ir_node * pos, const pset * live)
768 const ir_node *op = remat->op;
774 prev = sched_block_last_noncf(si, pos);
775 prev = sched_next_nonproj(prev, 0);
777 prev = sched_prev_op(pos);
779 /* do not remat if the rematted value is defined immediately before this op */
780 if(prev == remat->op) {
785 /* this should be just fine, the following OP will be using this value, right? */
787 /* only remat AFTER the real definition of a value (?) */
788 if(!value_is_defined_before(si, pos, remat->value)) {
789 // ir_fprintf(stderr, "error(not defined)");
794 for(n=get_irn_arity(op)-1; n>=0 && res; --n) {
795 const ir_node *arg = get_irn_n(op, n);
797 if(opt_no_enlarge_liveness) {
798 if(has_reg_class(si, arg) && live) {
799 res &= pset_find_ptr((pset*)live, arg)?1:0;
801 res &= value_is_defined_before(si, pos, arg);
804 res &= value_is_defined_before(si, pos, arg);
812 * Tells you whether a @p remat can be placed after the irn @p pos
815 can_remat_after(const spill_ilp_t * si, const remat_t * remat, const ir_node * pos, const pset * live)
818 pos = sched_block_first_nonphi(pos);
820 pos = sched_next_op(pos);
823 /* only remat AFTER the real definition of a value (?) */
824 if(!value_is_defined_before(si, pos, remat->value)) {
828 return can_remat_before(si, remat, pos, live);
832 * Collect potetially rematerializable OPs
835 walker_remat_collector(ir_node * irn, void * data)
837 spill_ilp_t *si = data;
839 if(!is_Block(irn) && !is_Phi(irn)) {
840 DBG((si->dbg, LEVEL_4, "\t Processing %+F\n", irn));
841 get_remats_from_op(si, irn);
846 * Inserts a copy of @p irn before @p pos
849 insert_copy_before(const spill_ilp_t * si, const ir_node * irn, ir_node * pos)
854 bb = is_Block(pos)?pos:get_nodes_block(pos);
855 copy = exact_copy(irn);
857 _set_phi_class(copy, NULL);
858 set_nodes_block(copy, bb);
859 sched_put_before(si, pos, copy);
865 * Inserts a copy of @p irn after @p pos
868 insert_copy_after(const spill_ilp_t * si, const ir_node * irn, ir_node * pos)
873 bb = is_Block(pos)?pos:get_nodes_block(pos);
874 copy = exact_copy(irn);
876 _set_phi_class(copy, NULL);
877 set_nodes_block(copy, bb);
878 sched_put_after(pos, copy);
884 insert_remat_after(spill_ilp_t * si, const remat_t * remat, ir_node * pos, const pset * live)
888 if(can_remat_after(si, remat, pos, live)) {
893 DBG((si->dbg, LEVEL_3, "\t >inserting remat2 %+F\n", remat->op));
895 copy = insert_copy_after(si, remat->op, pos);
897 ir_snprintf(buf, sizeof(buf), "remat2_%N_%N", copy, pos);
898 op = obstack_alloc(si->obst, sizeof(*op));
900 op->attr.remat.remat = remat;
901 op->attr.remat.pre = 0;
902 op->attr.remat.ilp = lpp_add_var_default(si->lpp, buf, lpp_binary, remat->cost*execution_frequency(si, pos), 0.0);
904 set_irn_link(copy, op);
905 pset_insert_ptr(si->all_possible_remats, copy);
907 proj_copy = insert_copy_after(si, remat->proj, copy);
908 set_irn_n(proj_copy, 0, copy);
909 set_irn_link(proj_copy, op);
910 pset_insert_ptr(si->all_possible_remats, proj_copy);
922 insert_remat_before(spill_ilp_t * si, const remat_t * remat, ir_node * pos, const pset * live)
926 if(can_remat_before(si, remat, pos, live)) {
931 DBG((si->dbg, LEVEL_3, "\t >inserting remat %+F\n", remat->op));
933 copy = insert_copy_before(si, remat->op, pos);
935 ir_snprintf(buf, sizeof(buf), "remat_%N_%N", copy, pos);
936 op = obstack_alloc(si->obst, sizeof(*op));
938 op->attr.remat.remat = remat;
939 op->attr.remat.pre = 1;
940 op->attr.remat.ilp = lpp_add_var_default(si->lpp, buf, lpp_binary, remat->cost*execution_frequency(si, pos), 0.0);
942 set_irn_link(copy, op);
943 pset_insert_ptr(si->all_possible_remats, copy);
945 proj_copy = insert_copy_after(si, remat->proj, copy);
946 set_irn_n(proj_copy, 0, copy);
947 set_irn_link(proj_copy, op);
948 pset_insert_ptr(si->all_possible_remats, proj_copy);
960 get_block_n_succs(const ir_node *block) {
961 const ir_edge_t *edge;
963 assert(edges_activated(current_ir_graph));
965 edge = get_block_succ_first(block);
969 edge = get_block_succ_next(block, edge);
974 is_start_block(const ir_node * bb)
976 return get_irg_start_block(get_irn_irg(bb)) == bb;
980 is_before_frame(const ir_node * bb, const ir_node * irn)
982 const ir_node *frame = get_irg_frame(get_irn_irg(bb));
984 if(is_start_block(bb) && sched_get_time_step(frame) >= sched_get_time_step(irn))
991 is_merge_edge(const ir_node * bb)
993 if(is_start_block(bb))
997 return get_block_n_succs(bb) == 1;
1003 is_diverge_edge(const ir_node * bb)
1005 if(is_start_block(bb))
1009 return get_Block_n_cfgpreds(bb) == 1;
1015 walker_regclass_copy_insertor(ir_node * irn, void * data)
1017 spill_ilp_t *si = data;
1019 if(is_Phi(irn) && has_reg_class(si, irn)) {
1022 for(n=get_irn_arity(irn)-1; n>=0; --n) {
1023 ir_node *phi_arg = get_irn_n(irn, n);
1024 ir_node *bb = get_Block_cfgpred_block(get_nodes_block(irn), n);
1026 if(!has_reg_class(si, phi_arg)) {
1027 ir_node *copy = be_new_Copy(si->cls, si->chordal_env->irg, bb, phi_arg);
1028 ir_node *pos = sched_block_last_noncf(si, bb);
1029 op_t *op = obstack_alloc(si->obst, sizeof(*op));
1031 DBG((si->dbg, LEVEL_2, "\t copy to my regclass for arg %+F of %+F\n", phi_arg, irn));
1032 sched_add_after(pos, copy);
1033 set_irn_n(irn, n, copy);
1036 op->attr.live_range.args.reloads = NULL;
1037 op->attr.live_range.ilp = ILP_UNDEF;
1038 set_irn_link(copy, op);
1046 * Insert (so far unused) remats into the irg to
1047 * recompute the potential liveness of all values
1050 walker_remat_insertor(ir_node * bb, void * data)
1052 spill_ilp_t *si = data;
1053 spill_bb_t *spill_bb;
1056 pset *live = pset_new_ptr_default();
1058 DBG((si->dbg, LEVEL_3, "\t Entering %+F\n\n", bb));
1060 be_lv_foreach(si->lv, bb, be_lv_state_end, i) {
1061 ir_node *value = be_lv_get_irn(si->lv, bb, i);
1063 /* add remats at end of block */
1064 if (has_reg_class(si, value)) {
1065 pset_insert_ptr(live, value);
1069 spill_bb = obstack_alloc(si->obst, sizeof(*spill_bb));
1070 set_irn_link(bb, spill_bb);
1072 irn = sched_last(bb);
1073 while(!sched_is_end(irn)) {
1080 next = sched_prev(irn);
1082 DBG((si->dbg, LEVEL_5, "\t at %+F (next: %+F)\n", irn, next));
1084 if(is_Phi(irn) || is_Proj(irn)) {
1087 if(has_reg_class(si, irn)) {
1088 pset_remove_ptr(live, irn);
1091 op = obstack_alloc(si->obst, sizeof(*op));
1093 op->attr.live_range.args.reloads = NULL;
1094 op->attr.live_range.ilp = ILP_UNDEF;
1095 set_irn_link(irn, op);
1101 op = obstack_alloc(si->obst, sizeof(*op));
1103 op->attr.live_range.ilp = ILP_UNDEF;
1104 op->attr.live_range.args.reloads = obstack_alloc(si->obst, sizeof(*op->attr.live_range.args.reloads) * get_irn_arity(irn));
1105 memset(op->attr.live_range.args.reloads, 0xFF, sizeof(*op->attr.live_range.args.reloads) * get_irn_arity(irn));
1106 set_irn_link(irn, op);
1108 args = pset_new_ptr_default();
1110 /* collect arguments of op */
1111 for (n = get_irn_arity(irn)-1; n>=0; --n) {
1112 ir_node *arg = get_irn_n(irn, n);
1114 pset_insert_ptr(args, arg);
1117 /* set args of op already live in epilog */
1118 pset_foreach(args, arg) {
1119 if(has_reg_class(si, arg)) {
1120 pset_insert_ptr(live, arg);
1123 /* delete defined value from live set */
1124 if(has_reg_class(si, irn)) {
1125 pset_remove_ptr(live, irn);
1129 remat_args = pset_new_ptr_default();
1131 /* insert all possible remats before irn */
1132 pset_foreach(args, arg) {
1133 remat_info_t *remat_info,
1137 /* continue if the operand has the wrong reg class
1139 if(!has_reg_class(si, arg))
1143 query.remats = NULL;
1144 query.remats_by_operand = NULL;
1145 remat_info = set_find(si->remat_info, &query, sizeof(query), HASH_PTR(arg));
1151 if(remat_info->remats) {
1152 pset_foreach(remat_info->remats, remat) {
1153 ir_node *remat_irn = NULL;
1155 DBG((si->dbg, LEVEL_4, "\t considering remat %+F for arg %+F\n", remat->op, arg));
1156 if(opt_remat_while_live) {
1157 if(pset_find_ptr(live, remat->value)) {
1158 remat_irn = insert_remat_before(si, remat, irn, live);
1161 remat_irn = insert_remat_before(si, remat, irn, live);
1164 for(n=get_irn_arity(remat_irn)-1; n>=0; --n) {
1165 ir_node *remat_arg = get_irn_n(remat_irn, n);
1167 if(!has_reg_class(si, remat_arg)) continue;
1169 pset_insert_ptr(remat_args, remat_arg);
1176 /* now we add remat args to op's args because they could also die at this op */
1177 pset_foreach(args,arg) {
1178 if(pset_find_ptr(remat_args, arg)) {
1179 pset_remove_ptr(remat_args, arg);
1182 pset_foreach(remat_args,arg) {
1183 pset_insert_ptr(args, arg);
1186 /* insert all possible remats after irn */
1187 pset_foreach(args, arg) {
1188 remat_info_t *remat_info,
1192 /* continue if the operand has the wrong reg class */
1193 if(!has_reg_class(si, arg))
1197 query.remats = NULL;
1198 query.remats_by_operand = NULL;
1199 remat_info = set_find(si->remat_info, &query, sizeof(query), HASH_PTR(arg));
1205 /* do not place post remats after jumps */
1206 if(sched_skip_cf_predicator(irn, si->chordal_env->birg->main_env->arch_env)) continue;
1208 if(remat_info->remats_by_operand) {
1209 pset_foreach(remat_info->remats_by_operand, remat) {
1210 /* do not insert remats producing the same value as one of the operands */
1211 if(!pset_find_ptr(args, remat->value)) {
1212 DBG((si->dbg, LEVEL_4, "\t considering remat %+F with arg %+F\n", remat->op, arg));
1213 if(opt_remat_while_live) {
1214 if(pset_find_ptr(live, remat->value)) {
1215 insert_remat_after(si, remat, irn, live);
1218 insert_remat_after(si, remat, irn, live);
1225 del_pset(remat_args);
1230 /* add remats at end if successor has multiple predecessors */
1231 if(is_merge_edge(bb)) {
1232 pset *live_out = pset_new_ptr_default();
1235 be_lv_foreach(si->lv, bb, be_lv_state_end, i) {
1236 value = be_lv_get_irn(si->lv, bb, i);
1238 if (be_is_live_end(si->lv, bb, value) && has_reg_class(si, value)) {
1239 pset_insert_ptr(live_out, value);
1243 /* add remats at end of block */
1244 pset_foreach(live_out, value) {
1245 remat_info_t *remat_info,
1250 query.remats = NULL;
1251 query.remats_by_operand = NULL;
1252 remat_info = set_find(si->remat_info, &query, sizeof(query), HASH_PTR(value));
1254 if(remat_info && remat_info->remats) {
1255 pset_foreach(remat_info->remats, remat) {
1256 DBG((si->dbg, LEVEL_4, "\t considering remat %+F at end of block %+F\n", remat->op, bb));
1258 insert_remat_before(si, remat, bb, live_out);
1265 if(is_diverge_edge(bb)) {
1266 pset *live_in = pset_new_ptr_default();
1269 be_lv_foreach(si->lv, bb, be_lv_state_in, i) {
1270 value = be_lv_get_irn(si->lv, bb, i);
1272 if (has_reg_class(si, value)) {
1273 pset_insert_ptr(live_in, value);
1277 /* add remat2s at beginning of block */
1278 pset_foreach(live_in, value) {
1279 if ((be_is_live_in(si->lv, bb, value) || (is_Phi(value) && get_nodes_block(value)==bb)) && has_reg_class(si, value)) {
1280 remat_info_t *remat_info,
1285 query.remats = NULL;
1286 query.remats_by_operand = NULL;
1287 remat_info = set_find(si->remat_info, &query, sizeof(query), HASH_PTR(value));
1289 if(remat_info && remat_info->remats_by_operand) {
1290 pset_foreach(remat_info->remats_by_operand, remat) {
1291 DBG((si->dbg, LEVEL_4, "\t considering remat2 %+F at beginning of block %+F\n", remat->op, bb));
1293 /* put the remat here if all its args are available */
1294 insert_remat_after(si, remat, bb, live_in);
1305 * Preparation of blocks' ends for Luke Blockwalker(tm)(R)
1308 luke_endwalker(ir_node * bb, void * data)
1310 spill_ilp_t *si = (spill_ilp_t*)data;
1316 spill_bb_t *spill_bb = get_irn_link(bb);
1320 live = pset_new_ptr_default();
1321 use_end = pset_new_ptr_default();
1323 be_lv_foreach(si->lv, bb, be_lv_state_end, i) {
1324 irn = be_lv_get_irn(si->lv, bb, i);
1325 if (has_reg_class(si, irn) && !pset_find_ptr(si->all_possible_remats, irn)) {
1328 pset_insert_ptr(live, irn);
1329 op = get_irn_link(irn);
1330 assert(!op->is_remat);
1334 /* collect values used by cond jumps etc. at bb end (use_end) -> always live */
1335 /* their reg_out must always be set */
1336 sched_foreach_reverse(bb, irn) {
1339 if(!sched_skip_cf_predicator(irn, si->chordal_env->birg->main_env->arch_env)) break;
1341 for (n=get_irn_arity(irn)-1; n>=0; --n) {
1342 ir_node *irn_arg = get_irn_n(irn, n);
1344 if(has_reg_class(si, irn_arg)) {
1345 pset_insert_ptr(use_end, irn_arg);
1350 ir_snprintf(buf, sizeof(buf), "check_end_%N", bb);
1351 //cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, si->n_regs);
1352 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, si->n_regs - pset_count(use_end));
1354 spill_bb->ilp = new_set(cmp_spill, pset_count(live)+pset_count(use_end));
1356 /* if this is a merge edge we can reload at the end of this block */
1357 if(is_merge_edge(bb)) {
1358 spill_bb->reloads = new_set(cmp_keyval, pset_count(live)+pset_count(use_end));
1359 } else if(pset_count(use_end)){
1360 spill_bb->reloads = new_set(cmp_keyval, pset_count(use_end));
1362 spill_bb->reloads = NULL;
1365 pset_foreach(live,irn) {
1369 int default_spilled;
1372 /* handle values used by control flow nodes later separately */
1373 if(pset_find_ptr(use_end, irn)) continue;
1376 spill = set_insert(spill_bb->ilp, &query, sizeof(query), HASH_PTR(irn));
1378 spill_cost = is_Unknown(irn)?0.0001:opt_cost_spill*execution_frequency(si, bb);
1380 ir_snprintf(buf, sizeof(buf), "reg_out_%N_%N", irn, bb);
1381 spill->reg_out = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
1382 lpp_set_factor_fast(si->lpp, cst, spill->reg_out, 1.0);
1384 ir_snprintf(buf, sizeof(buf), "mem_out_%N_%N", irn, bb);
1385 spill->mem_out = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
1387 ir_snprintf(buf, sizeof(buf), "spill_%N_%N", irn, bb);
1388 /* by default spill value right after definition */
1389 default_spilled = be_is_live_in(si->lv, bb, irn) || is_Phi(irn);
1390 spill->spill = lpp_add_var_default(si->lpp, buf, lpp_binary, spill_cost, !default_spilled);
1392 if(is_merge_edge(bb)) {
1396 ir_snprintf(buf, sizeof(buf), "reload_%N_%N", bb, irn);
1397 reload = lpp_add_var_default(si->lpp, buf, lpp_binary, opt_cost_reload*execution_frequency(si, bb), 1.0);
1398 set_insert_keyval(spill_bb->reloads, irn, INT_TO_PTR(reload));
1400 /* reload <= mem_out */
1401 rel_cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
1402 lpp_set_factor_fast(si->lpp, rel_cst, reload, 1.0);
1403 lpp_set_factor_fast(si->lpp, rel_cst, spill->mem_out, -1.0);
1406 spill->reg_in = ILP_UNDEF;
1407 spill->mem_in = ILP_UNDEF;
1410 pset_foreach(use_end,irn) {
1414 ilp_cst_t end_use_req,
1417 int default_spilled;
1420 spill = set_insert(spill_bb->ilp, &query, sizeof(query), HASH_PTR(irn));
1422 spill_cost = is_Unknown(irn)?0.0001:opt_cost_spill*execution_frequency(si, bb);
1424 ir_snprintf(buf, sizeof(buf), "reg_out_%N_%N", irn, bb);
1425 spill->reg_out = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
1426 /* if irn is used at the end of the block, then it is live anyway */
1427 //lpp_set_factor_fast(si->lpp, cst, spill->reg_out, 1.0);
1429 ir_snprintf(buf, sizeof(buf), "mem_out_%N_%N", irn, bb);
1430 spill->mem_out = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
1432 ir_snprintf(buf, sizeof(buf), "spill_%N_%N", irn, bb);
1433 default_spilled = be_is_live_in(si->lv, bb, irn) || is_Phi(irn);
1434 spill->spill = lpp_add_var_default(si->lpp, buf, lpp_binary, spill_cost, !default_spilled);
1436 /* reload for use be control flow op */
1437 ir_snprintf(buf, sizeof(buf), "reload_%N_%N", bb, irn);
1438 reload = lpp_add_var_default(si->lpp, buf, lpp_binary, opt_cost_reload*execution_frequency(si, bb), 1.0);
1439 set_insert_keyval(spill_bb->reloads, irn, INT_TO_PTR(reload));
1441 /* reload <= mem_out */
1442 rel_cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
1443 lpp_set_factor_fast(si->lpp, rel_cst, reload, 1.0);
1444 lpp_set_factor_fast(si->lpp, rel_cst, spill->mem_out, -1.0);
1446 spill->reg_in = ILP_UNDEF;
1447 spill->mem_in = ILP_UNDEF;
1449 ir_snprintf(buf, sizeof(buf), "req_cf_end_%N_%N", irn, bb);
1450 end_use_req = lpp_add_cst_uniq(si->lpp, buf, lpp_equal, 1);
1451 lpp_set_factor_fast(si->lpp, end_use_req, spill->reg_out, 1.0);
1459 next_post_remat(const ir_node * irn)
1465 next = sched_block_first_nonphi(irn);
1467 next = sched_next_op(irn);
1470 if(sched_is_end(next))
1473 op = get_irn_link(next);
1474 if(op->is_remat && !op->attr.remat.pre) {
1483 next_pre_remat(const spill_ilp_t * si, const ir_node * irn)
1489 ret = sched_block_last_noncf(si, irn);
1490 ret = sched_next(ret);
1491 ret = sched_prev_op(ret);
1493 ret = sched_prev_op(irn);
1496 if(sched_is_end(ret) || is_Phi(ret))
1499 op = (op_t*)get_irn_link(ret);
1500 if(op->is_remat && op->attr.remat.pre) {
1508 * Find a remat of value @p value in the epilog of @p pos
1511 find_post_remat(const ir_node * value, const ir_node * pos)
1513 while((pos = next_post_remat(pos)) != NULL) {
1516 op = get_irn_link(pos);
1517 assert(op->is_remat && !op->attr.remat.pre);
1519 if(op->attr.remat.remat->value == value)
1520 return (ir_node*)pos;
1523 const ir_edge_t *edge;
1524 foreach_out_edge(pos, edge) {
1525 ir_node *proj = get_edge_src_irn(edge);
1526 assert(is_Proj(proj));
1536 add_to_spill_bb(spill_ilp_t * si, ir_node * bb, ir_node * irn)
1538 spill_bb_t *spill_bb = get_irn_link(bb);
1542 int default_spilled;
1545 spill = set_find(spill_bb->ilp, &query, sizeof(query), HASH_PTR(irn));
1547 double spill_cost = is_Unknown(irn)?0.0001:opt_cost_spill*execution_frequency(si, bb);
1549 spill = set_insert(spill_bb->ilp, &query, sizeof(query), HASH_PTR(irn));
1551 spill->reg_out = ILP_UNDEF;
1552 spill->reg_in = ILP_UNDEF;
1553 spill->mem_in = ILP_UNDEF;
1555 ir_snprintf(buf, sizeof(buf), "mem_out_%N_%N", irn, bb);
1556 spill->mem_out = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
1558 ir_snprintf(buf, sizeof(buf), "spill_%N_%N", irn, bb);
1559 default_spilled = be_is_live_in(si->lv, bb, irn) || is_Phi(irn);
1560 spill->spill = lpp_add_var_default(si->lpp, buf, lpp_binary, spill_cost, !default_spilled);
1567 get_live_end(spill_ilp_t * si, ir_node * bb, pset * live)
1572 be_lv_foreach(si->lv, bb, be_lv_state_end, i) {
1573 irn = be_lv_get_irn(si->lv, bb, i);
1575 if (has_reg_class(si, irn) && !pset_find_ptr(si->all_possible_remats, irn)) {
1576 pset_insert_ptr(live, irn);
1580 irn = sched_last(bb);
1582 /* all values eaten by control flow operations are also live until the end of the block */
1583 sched_foreach_reverse(bb, irn) {
1586 if(!sched_skip_cf_predicator(irn, si->chordal_env->birg->main_env->arch_env)) break;
1588 for(i=get_irn_arity(irn)-1; i>=0; --i) {
1589 ir_node *arg = get_irn_n(irn,i);
1591 if(has_reg_class(si, arg)) {
1592 pset_insert_ptr(live, arg);
1599 * Inserts ILP-constraints and variables for memory copying before the given position
1602 insert_mem_copy_position(spill_ilp_t * si, pset * live, const ir_node * block)
1604 const ir_node *succ;
1605 const ir_edge_t *edge;
1606 spill_bb_t *spill_bb = get_irn_link(block);
1615 assert(edges_activated(current_ir_graph));
1617 edge = get_block_succ_first(block);
1623 edge = get_block_succ_next(block, edge);
1624 /* next block can only contain phis, if this is a merge edge */
1627 ir_snprintf(buf, sizeof(buf), "copyreg_%N", block);
1628 copyreg = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
1630 ir_snprintf(buf, sizeof(buf), "check_copyreg_%N", block);
1631 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, si->n_regs);
1633 pset_foreach(live, tmp) {
1636 op_t *op = get_irn_link(irn);
1637 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.ilp, 1.0);
1639 spill = set_find_spill(spill_bb->ilp, tmp);
1642 lpp_set_factor_fast(si->lpp, cst, spill->reg_out, 1.0);
1644 lpp_set_factor_fast(si->lpp, cst, copyreg, 1.0);
1646 sched_foreach(succ, phi) {
1647 const ir_node *to_copy;
1649 spill_t *to_copy_spill;
1650 op_t *phi_op = get_irn_link(phi);
1651 ilp_var_t reload = ILP_UNDEF;
1654 if(!is_Phi(phi)) break;
1655 if(!has_reg_class(si, phi)) continue;
1657 to_copy = get_irn_n(phi, pos);
1659 to_copy_op = get_irn_link(to_copy);
1661 to_copy_spill = set_find_spill(spill_bb->ilp, to_copy);
1662 assert(to_copy_spill);
1664 if(spill_bb->reloads) {
1665 keyval_t *keyval = set_find_keyval(spill_bb->reloads, to_copy);
1668 reload = PTR_TO_INT(keyval->val);
1672 ir_snprintf(buf, sizeof(buf), "req_copy_%N_%N_%N", block, phi, to_copy);
1673 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
1675 /* copy - reg_out - reload - remat - live_range <= 0 */
1676 lpp_set_factor_fast(si->lpp, cst, phi_op->attr.live_range.args.copies[pos], 1.0);
1677 lpp_set_factor_fast(si->lpp, cst, to_copy_spill->reg_out, -1.0);
1678 if(reload != ILP_UNDEF) lpp_set_factor_fast(si->lpp, cst, reload, -1.0);
1679 lpp_set_factor_fast(si->lpp, cst, to_copy_op->attr.live_range.ilp, -1.0);
1680 foreach_pre_remat(si, block, tmp) {
1681 op_t *remat_op = get_irn_link(tmp);
1682 if(remat_op->attr.remat.remat->value == to_copy) {
1683 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, -1.0);
1687 ir_snprintf(buf, sizeof(buf), "copyreg_%N_%N_%N", block, phi, to_copy);
1688 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
1690 /* copy - reg_out - copyreg <= 0 */
1691 lpp_set_factor_fast(si->lpp, cst, phi_op->attr.live_range.args.copies[pos], 1.0);
1692 lpp_set_factor_fast(si->lpp, cst, to_copy_spill->reg_out, -1.0);
1693 lpp_set_factor_fast(si->lpp, cst, copyreg, -1.0);
1699 * Walk all irg blocks and emit this ILP
1702 luke_blockwalker(ir_node * bb, void * data)
1704 spill_ilp_t *si = (spill_ilp_t*)data;
1709 spill_bb_t *spill_bb = get_irn_link(bb);
1712 pset *defs = pset_new_ptr_default();
1713 const arch_env_t *arch_env = si->chordal_env->birg->main_env->arch_env;
1716 live = pset_new_ptr_default();
1718 /****************************************
1719 * B A S I C B L O C K E N D
1720 ***************************************/
1723 /* init live values at end of block */
1724 get_live_end(si, bb, live);
1726 pset_foreach(live, irn) {
1728 ilp_var_t reload = ILP_UNDEF;
1730 spill = set_find_spill(spill_bb->ilp, irn);
1733 if(spill_bb->reloads) {
1734 keyval_t *keyval = set_find_keyval(spill_bb->reloads, irn);
1737 reload = PTR_TO_INT(keyval->val);
1741 op = get_irn_link(irn);
1742 assert(!op->is_remat);
1744 ir_snprintf(buf, sizeof(buf), "lr_%N_%N", irn, bb);
1745 op->attr.live_range.ilp = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
1746 op->attr.live_range.op = bb;
1748 ir_snprintf(buf, sizeof(buf), "reg_out_%N_%N", bb, irn);
1749 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
1751 /* reg_out - reload - remat - live_range <= 0 */
1752 lpp_set_factor_fast(si->lpp, cst, spill->reg_out, 1.0);
1753 if(reload != ILP_UNDEF) lpp_set_factor_fast(si->lpp, cst, reload, -1.0);
1754 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.ilp, -1.0);
1755 foreach_pre_remat(si, bb, tmp) {
1756 op_t *remat_op = get_irn_link(tmp);
1757 if(remat_op->attr.remat.remat->value == irn) {
1758 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, -1.0);
1761 /* maybe we should also assure that reg_out >= live_range etc. */
1765 insert_mem_copy_position(si, live, bb);
1768 * start new live ranges for values used by remats at end of block
1769 * and assure the remat args are available
1771 foreach_pre_remat(si, bb, tmp) {
1772 op_t *remat_op = get_irn_link(tmp);
1775 for (n=get_irn_arity(tmp)-1; n>=0; --n) {
1776 ir_node *remat_arg = get_irn_n(tmp, n);
1777 op_t *arg_op = get_irn_link(remat_arg);
1780 if(!has_reg_class(si, remat_arg)) continue;
1782 /* if value is becoming live through use by remat */
1783 if(!pset_find_ptr(live, remat_arg)) {
1784 ir_snprintf(buf, sizeof(buf), "lr_%N_end%N", remat_arg, bb);
1785 prev_lr = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
1787 arg_op->attr.live_range.ilp = prev_lr;
1788 arg_op->attr.live_range.op = bb;
1790 DBG((si->dbg, LEVEL_4, " value %+F becoming live through use by remat at end of block %+F\n", remat_arg, tmp));
1792 pset_insert_ptr(live, remat_arg);
1793 add_to_spill_bb(si, bb, remat_arg);
1796 /* remat <= live_rang(remat_arg) [ + reload(remat_arg) ] */
1797 ir_snprintf(buf, sizeof(buf), "req_remat_%N_arg_%N", tmp, remat_arg);
1798 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1800 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
1801 lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, -1.0);
1803 /* use reload placed for this argument */
1804 if(spill_bb->reloads) {
1805 keyval_t *keyval = set_find_keyval(spill_bb->reloads, remat_arg);
1808 ilp_var_t reload = PTR_TO_INT(keyval->val);
1810 lpp_set_factor_fast(si->lpp, cst, reload, -1.0);
1815 DBG((si->dbg, LEVEL_4, "\t %d values live at end of block %+F\n", pset_count(live), bb));
1820 /**************************************
1821 * B A S I C B L O C K B O D Y
1822 **************************************/
1824 sched_foreach_reverse_from(sched_block_last_noncf(si, bb), irn) {
1830 ilp_cst_t check_pre,
1836 ilp_cst_t one_memoperand;
1838 /* iterate only until first phi */
1842 op = get_irn_link(irn);
1844 if(op->is_remat) continue;
1845 DBG((si->dbg, LEVEL_4, "\t at node %+F\n", irn));
1847 /* collect defined values */
1848 if(has_reg_class(si, irn)) {
1849 pset_insert_ptr(defs, irn);
1853 if(is_Proj(irn)) continue;
1856 * init set of irn's arguments
1857 * and all possibly used values around this op
1858 * and values defined by post remats
1860 args = new_set(cmp_keyval, get_irn_arity(irn));
1861 used = pset_new_ptr(pset_count(live) + get_irn_arity(irn));
1862 remat_defs = pset_new_ptr(pset_count(live));
1864 for (n=get_irn_arity(irn)-1; n>=0; --n) {
1865 ir_node *irn_arg = get_irn_n(irn, n);
1866 if(has_reg_class(si, irn_arg)) {
1867 set_insert_keyval(args, irn_arg, (void*)n);
1868 pset_insert_ptr(used, irn_arg);
1871 foreach_post_remat(irn, tmp) {
1872 op_t *remat_op = get_irn_link(tmp);
1874 pset_insert_ptr(remat_defs, remat_op->attr.remat.remat->value);
1876 for (n=get_irn_arity(tmp)-1; n>=0; --n) {
1877 ir_node *remat_arg = get_irn_n(tmp, n);
1878 if(has_reg_class(si, remat_arg)) {
1879 pset_insert_ptr(used, remat_arg);
1883 foreach_pre_remat(si, irn, tmp) {
1884 for (n=get_irn_arity(tmp)-1; n>=0; --n) {
1885 ir_node *remat_arg = get_irn_n(tmp, n);
1886 if(has_reg_class(si, remat_arg)) {
1887 pset_insert_ptr(used, remat_arg);
1892 /**********************************
1893 * I N E P I L O G O F irn
1894 **********************************/
1896 /* ensure each dying value is used by only one post remat */
1897 pset_foreach(used, tmp) {
1898 ir_node *value = tmp;
1899 op_t *value_op = get_irn_link(value);
1904 foreach_post_remat(irn, remat) {
1905 op_t *remat_op = get_irn_link(remat);
1907 for(n=get_irn_arity(remat)-1; n>=0; --n) {
1908 ir_node *remat_arg = get_irn_n(remat, n);
1910 /* if value is used by this remat add it to constraint */
1911 if(remat_arg == value) {
1913 /* sum remat2s <= 1 + n_remats*live_range */
1914 ir_snprintf(buf, sizeof(buf), "dying_lr_%N_%N", value, irn);
1915 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 1.0);
1919 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
1925 // value_op->attr.live_range.ilp != ILP_UNDEF
1926 if(pset_find_ptr(live, value) && cst != ILP_UNDEF) {
1927 lpp_set_factor_fast(si->lpp, cst, value_op->attr.live_range.ilp, -n_remats);
1931 /* ensure at least one value dies at post remat */
1932 foreach_post_remat(irn, tmp) {
1933 op_t *remat_op = get_irn_link(tmp);
1934 pset *remat_args = pset_new_ptr(get_irn_arity(tmp));
1937 for(n=get_irn_arity(tmp)-1; n>=0; --n) {
1938 remat_arg = get_irn_n(tmp, n);
1940 if(has_reg_class(si, remat_arg)) {
1942 /* does arg always die at this op? */
1943 if(!pset_find_ptr(live, remat_arg))
1944 goto skip_one_must_die;
1946 pset_insert_ptr(remat_args, remat_arg);
1950 /* remat + \sum live_range(remat_arg) <= |args| */
1951 ir_snprintf(buf, sizeof(buf), "one_must_die_%+F", tmp);
1952 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, pset_count(remat_args));
1953 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
1955 pset_foreach(remat_args, remat_arg) {
1956 op_t *arg_op = get_irn_link(remat_arg);
1958 lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, 1.0);
1962 del_pset(remat_args);
1965 /* new live ranges for values from L\U defined by post remats */
1966 pset_foreach(live, tmp) {
1967 ir_node *value = tmp;
1968 op_t *value_op = get_irn_link(value);
1970 if(!set_find_keyval(args, value) && !pset_find_ptr(defs, value)) {
1971 ilp_var_t prev_lr = ILP_UNDEF;
1974 if(pset_find_ptr(remat_defs, value)) {
1976 /* next_live_range <= prev_live_range + sum remat2s */
1977 ir_snprintf(buf, sizeof(buf), "next_lr_%N_%N", value, irn);
1978 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
1980 ir_snprintf(buf, sizeof(buf), "lr_%N_%N", value, irn);
1981 prev_lr = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
1983 lpp_set_factor_fast(si->lpp, cst, value_op->attr.live_range.ilp, 1.0);
1984 lpp_set_factor_fast(si->lpp, cst, prev_lr, -1.0);
1986 foreach_post_remat(irn, remat) {
1987 op_t *remat_op = get_irn_link(remat);
1989 /* if value is being rematerialized by this remat */
1990 if(value == remat_op->attr.remat.remat->value) {
1991 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, -1.0);
1995 value_op->attr.live_range.ilp = prev_lr;
1996 value_op->attr.live_range.op = irn;
2001 /* requirements for post remats and start live ranges from L/U' for values dying here */
2002 foreach_post_remat(irn, tmp) {
2003 op_t *remat_op = get_irn_link(tmp);
2006 for (n=get_irn_arity(tmp)-1; n>=0; --n) {
2007 ir_node *remat_arg = get_irn_n(tmp, n);
2008 op_t *arg_op = get_irn_link(remat_arg);
2010 if(!has_reg_class(si, remat_arg)) continue;
2012 /* only for values in L\U (TODO and D?), the others are handled with post_use */
2013 if(!pset_find_ptr(used, remat_arg)) {
2014 /* remat <= live_range(remat_arg) */
2015 ir_snprintf(buf, sizeof(buf), "req_remat2_%N_arg_%N", tmp, remat_arg);
2016 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
2018 /* if value is becoming live through use by remat2 */
2019 if(!pset_find_ptr(live, remat_arg)) {
2022 ir_snprintf(buf, sizeof(buf), "lr_%N_%N", remat_arg, irn);
2023 lr = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
2025 arg_op->attr.live_range.ilp = lr;
2026 arg_op->attr.live_range.op = irn;
2028 DBG((si->dbg, LEVEL_3, " value %+F becoming live through use by remat2 %+F\n", remat_arg, tmp));
2030 pset_insert_ptr(live, remat_arg);
2031 add_to_spill_bb(si, bb, remat_arg);
2034 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
2035 lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, -1.0);
2040 d = pset_count(defs);
2041 DBG((si->dbg, LEVEL_4, "\t %+F produces %d values in my register class\n", irn, d));
2043 /* count how many regs irn needs for arguments */
2044 u = set_count(args);
2047 /* check the register pressure in the epilog */
2048 /* sum_{L\U'} lr + sum_{U'} post_use <= k - |D| */
2049 ir_snprintf(buf, sizeof(buf), "check_post_%N", irn);
2050 check_post = lpp_add_cst_uniq(si->lpp, buf, lpp_less, si->n_regs - d);
2052 /* add L\U' to check_post */
2053 pset_foreach(live, tmp) {
2054 if(!pset_find_ptr(used, tmp) && !pset_find_ptr(defs, tmp)) {
2055 /* if a live value is not used by irn */
2056 tmp_op = get_irn_link(tmp);
2057 lpp_set_factor_fast(si->lpp, check_post, tmp_op->attr.live_range.ilp, 1.0);
2061 /***********************************************************
2062 * I T E R A T I O N O V E R U S E S F O R E P I L O G
2063 **********************************************************/
2066 pset_foreach(used, tmp) {
2072 op_t *arg_op = get_irn_link(arg);
2075 spill = add_to_spill_bb(si, bb, arg);
2077 /* new live range for each used value */
2078 ir_snprintf(buf, sizeof(buf), "lr_%N_%N", arg, irn);
2079 prev_lr = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, is_before_frame(bb, irn)?1.0:0.0);
2081 /* the epilog stuff - including post_use, check_post, check_post_remat */
2082 ir_snprintf(buf, sizeof(buf), "post_use_%N_%N", arg, irn);
2083 post_use = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
2085 lpp_set_factor_fast(si->lpp, check_post, post_use, 1.0);
2087 /* arg is live throughout epilog if the next live_range is in a register */
2088 if(pset_find_ptr(live, arg)) {
2089 DBG((si->dbg, LEVEL_3, "\t arg %+F is possibly live in epilog of %+F\n", arg, irn));
2091 /* post_use >= next_lr + remat */
2092 ir_snprintf(buf, sizeof(buf), "post_use_%N_%N-%d", arg, irn, p++);
2093 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2094 lpp_set_factor_fast(si->lpp, cst, post_use, -1.0);
2095 lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, 1.0);
2099 /* if value is not an arg of op and not possibly defined by post remat
2100 * then it may only die and not become live
2102 if(!set_find_keyval(args, arg)) {
2103 /* post_use <= prev_lr */
2104 ir_snprintf(buf, sizeof(buf), "req_post_use_%N_%N", arg, irn);
2105 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2106 lpp_set_factor_fast(si->lpp, cst, post_use, 1.0);
2107 lpp_set_factor_fast(si->lpp, cst, prev_lr, -1.0);
2109 if(!pset_find_ptr(remat_defs, arg) && pset_find_ptr(live, arg)) {
2110 /* next_lr <= prev_lr */
2111 ir_snprintf(buf, sizeof(buf), "next_lr_%N_%N", arg, irn);
2112 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2113 lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, 1.0);
2114 lpp_set_factor_fast(si->lpp, cst, prev_lr, -1.0);
2119 /* forall post remat which use arg add a similar cst */
2120 foreach_post_remat(irn, remat) {
2123 for (n=get_irn_arity(remat)-1; n>=0; --n) {
2124 ir_node *remat_arg = get_irn_n(remat, n);
2125 op_t *remat_op = get_irn_link(remat);
2127 if(remat_arg == arg) {
2128 DBG((si->dbg, LEVEL_3, "\t found remat with arg %+F in epilog of %+F\n", arg, irn));
2130 ir_snprintf(buf, sizeof(buf), "post_use_%N_%N-%d", arg, irn, p++);
2131 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2132 lpp_set_factor_fast(si->lpp, cst, post_use, -1.0);
2133 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
2138 if(opt_memoperands) {
2139 for(n = get_irn_arity(irn)-1; n>=0; --n) {
2140 if(get_irn_n(irn, n) == arg && arch_possible_memory_operand(arch_env, irn, n)) {
2141 ilp_var_t memoperand;
2143 ir_snprintf(buf, sizeof(buf), "memoperand_%N_%d", irn, n);
2144 memoperand = lpp_add_var_default(si->lpp, buf, lpp_binary, opt_cost_memoperand*execution_frequency(si, bb), 0.0);
2145 set_insert_memoperand(si->memoperands, irn, n, memoperand);
2147 ir_snprintf(buf, sizeof(buf), "nolivepost_%N_%d", irn, n);
2148 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 1.0);
2150 lpp_set_factor_fast(si->lpp, cst, memoperand, 1.0);
2151 lpp_set_factor_fast(si->lpp, cst, post_use, 1.0);
2152 // if(arg_op->attr.live_range.ilp != ILP_UNDEF)
2153 // lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, 1.0);
2158 /* new live range begins for each used value */
2159 arg_op->attr.live_range.ilp = prev_lr;
2160 arg_op->attr.live_range.op = irn;
2162 /*if(!pset_find_ptr(live, arg)) {
2163 pset_insert_ptr(live, arg);
2164 add_to_spill_bb(si, bb, arg);
2166 pset_insert_ptr(live, arg);
2170 /* just to be sure */
2171 check_post = ILP_UNDEF;
2180 /* check the register pressure in the prolog */
2181 /* sum_{L\U} lr <= k - |U| */
2182 ir_snprintf(buf, sizeof(buf), "check_pre_%N", irn);
2183 check_pre = lpp_add_cst_uniq(si->lpp, buf, lpp_less, si->n_regs - u);
2185 /* for the prolog remove defined values from the live set */
2186 pset_foreach(defs, tmp) {
2187 pset_remove_ptr(live, tmp);
2190 if(opt_memoperands) {
2191 ir_snprintf(buf, sizeof(buf), "one_memoperand_%N", irn);
2192 one_memoperand = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 1.0);
2195 /***********************************************************
2196 * I T E R A T I O N O V E R A R G S F O R P R O L O G
2197 **********************************************************/
2200 set_foreach(args, keyval) {
2202 const ir_node *arg = keyval->key;
2203 int i = PTR_TO_INT(keyval->val);
2204 op_t *arg_op = get_irn_link(arg);
2205 ilp_cst_t requirements;
2208 spill = set_find_spill(spill_bb->ilp, arg);
2211 ir_snprintf(buf, sizeof(buf), "reload_%N_%N", arg, irn);
2212 op->attr.live_range.args.reloads[i] = lpp_add_var_default(si->lpp, buf, lpp_binary, opt_cost_reload*execution_frequency(si, bb), is_before_frame(bb, irn)?0.0:1.0);
2214 /* reload <= mem_out */
2215 ir_snprintf(buf, sizeof(buf), "req_reload_%N_%N", arg, irn);
2216 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2217 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.args.reloads[i], 1.0);
2218 lpp_set_factor_fast(si->lpp, cst, spill->mem_out, -1.0);
2220 /* requirement: arg must be in register for use */
2221 /* reload + remat + live_range == 1 */
2222 ir_snprintf(buf, sizeof(buf), "req_%N_%N", irn, arg);
2223 requirements = lpp_add_cst_uniq(si->lpp, buf, lpp_equal, 1.0);
2225 lpp_set_factor_fast(si->lpp, requirements, arg_op->attr.live_range.ilp, 1.0);
2226 lpp_set_factor_fast(si->lpp, requirements, op->attr.live_range.args.reloads[i], 1.0);
2227 foreach_pre_remat(si, irn, tmp) {
2228 op_t *remat_op = get_irn_link(tmp);
2229 if(remat_op->attr.remat.remat->value == arg) {
2230 lpp_set_factor_fast(si->lpp, requirements, remat_op->attr.remat.ilp, 1.0);
2234 if(opt_memoperands) {
2236 for(n = get_irn_arity(irn)-1; n>=0; --n) {
2237 if(get_irn_n(irn, n) == arg) {
2241 for(n = get_irn_arity(irn)-1; n>=0; --n) {
2242 if(get_irn_n(irn, n) == arg && arch_possible_memory_operand(arch_env, irn, n)) {
2243 memoperand_t *memoperand;
2244 memoperand = set_find_memoperand(si->memoperands, irn, n);
2246 /* memoperand <= mem_out */
2247 ir_snprintf(buf, sizeof(buf), "req_memoperand_%N_%d", irn, n);
2248 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2249 lpp_set_factor_fast(si->lpp, cst, memoperand->ilp, 1.0);
2250 lpp_set_factor_fast(si->lpp, cst, spill->mem_out, -1.0);
2252 /* the memoperand is only sufficient if it is used once by the op */
2253 if(n_memoperands == 1)
2254 lpp_set_factor_fast(si->lpp, requirements, memoperand->ilp, 1.0);
2256 lpp_set_factor_fast(si->lpp, one_memoperand, memoperand->ilp, 1.0);
2258 /* we have one more free register if we use a memory operand */
2259 lpp_set_factor_fast(si->lpp, check_pre, memoperand->ilp, -1.0);
2265 /* iterate over L\U */
2266 pset_foreach(live, tmp) {
2267 if(!set_find_keyval(args, tmp)) {
2268 /* if a live value is not used by irn */
2269 tmp_op = get_irn_link(tmp);
2270 lpp_set_factor_fast(si->lpp, check_pre, tmp_op->attr.live_range.ilp, 1.0);
2275 /* requirements for remats */
2276 /* start new live ranges for values used by remats */
2277 foreach_pre_remat(si, irn, tmp) {
2278 op_t *remat_op = get_irn_link(tmp);
2281 for (n=get_irn_arity(tmp)-1; n>=0; --n) {
2282 ir_node *remat_arg = get_irn_n(tmp, n);
2283 op_t *arg_op = get_irn_link(remat_arg);
2285 if(!has_reg_class(si, remat_arg)) continue;
2287 /* remat <= live_rang(remat_arg) [ + reload(remat_arg) ] */
2288 ir_snprintf(buf, sizeof(buf), "req_remat_%N_arg_%N", tmp, remat_arg);
2289 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
2291 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
2292 lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, -1.0);
2294 /* if remat arg is also used by current op then we can use reload placed for this argument */
2295 if((keyval = set_find_keyval(args, remat_arg)) != NULL) {
2296 int index = (int)keyval->val;
2298 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.args.reloads[index], -1.0);
2306 /*************************
2307 * D O N E W I T H O P
2308 *************************/
2310 DBG((si->dbg, LEVEL_4, "\t %d values live at %+F\n", pset_count(live), irn));
2312 pset_foreach(live, tmp) {
2313 assert(has_reg_class(si, tmp));
2316 for (n=get_irn_arity(irn)-1; n>=0; --n) {
2317 ir_node *arg = get_irn_n(irn, n);
2319 assert(!find_post_remat(arg, irn) && "there should be no post remat for an argument of an op");
2322 del_pset(remat_defs);
2326 defs = pset_new_ptr_default();
2331 /***************************************
2332 * B E G I N N I N G O F B L O C K
2333 ***************************************/
2336 /* we are now at the beginning of the basic block, there are only \Phis in front of us */
2337 DBG((si->dbg, LEVEL_3, "\t %d values live at beginning of block %+F\n", pset_count(live), bb));
2339 pset_foreach(live, irn) {
2340 assert(is_Phi(irn) || get_nodes_block(irn) != bb);
2343 /* construct mem_outs for all values */
2345 set_foreach(spill_bb->ilp, spill) {
2346 ir_snprintf(buf, sizeof(buf), "mem_out_%N_%N", spill->irn, bb);
2347 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2349 lpp_set_factor_fast(si->lpp, cst, spill->mem_out, 1.0);
2350 lpp_set_factor_fast(si->lpp, cst, spill->spill, -1.0);
2352 if(pset_find_ptr(live, spill->irn)) {
2353 int default_spilled;
2354 DBG((si->dbg, LEVEL_5, "\t %+F live at beginning of block %+F\n", spill->irn, bb));
2356 ir_snprintf(buf, sizeof(buf), "mem_in_%N_%N", spill->irn, bb);
2357 default_spilled = be_is_live_in(si->lv, bb, spill->irn) || is_Phi(spill->irn);
2358 spill->mem_in = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, default_spilled);
2359 lpp_set_factor_fast(si->lpp, cst, spill->mem_in, -1.0);
2361 if(opt_memcopies && is_Phi(spill->irn) && get_nodes_block(spill->irn) == bb) {
2363 op_t *op = get_irn_link(spill->irn);
2365 /* do we have to copy a phi argument? */
2366 op->attr.live_range.args.copies = obstack_alloc(si->obst, sizeof(*op->attr.live_range.args.copies) * get_irn_arity(spill->irn));
2367 memset(op->attr.live_range.args.copies, 0xFF, sizeof(*op->attr.live_range.args.copies) * get_irn_arity(spill->irn));
2369 for(n=get_irn_arity(spill->irn)-1; n>=0; --n) {
2370 const ir_node *arg = get_irn_n(spill->irn, n);
2376 /* argument already done? */
2377 if(op->attr.live_range.args.copies[n] != ILP_UNDEF) continue;
2379 /* get sum of execution frequencies of blocks with the same phi argument */
2380 for(m=n; m>=0; --m) {
2381 const ir_node *arg2 = get_irn_n(spill->irn, m);
2384 freq += execution_frequency(si, get_Block_cfgpred_block(bb, m));
2388 /* copies are not for free */
2389 ir_snprintf(buf, sizeof(buf), "copy_%N_%N", arg, spill->irn);
2390 var = lpp_add_var_default(si->lpp, buf, lpp_binary, opt_cost_spill * freq, 1.0);
2392 for(m=n; m>=0; --m) {
2393 const ir_node *arg2 = get_irn_n(spill->irn, m);
2396 op->attr.live_range.args.copies[m] = var;
2401 /* copy <= mem_in */
2402 ir_snprintf(buf, sizeof(buf), "nocopy_%N_%N", arg, spill->irn);
2403 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2404 lpp_set_factor_fast(si->lpp, cst, var, 1.0);
2405 lpp_set_factor_fast(si->lpp, cst, spill->mem_in, -1.0);
2412 foreach_post_remat(bb, tmp) {
2415 for (n=get_irn_arity(tmp)-1; n>=0; --n) {
2416 ir_node *remat_arg = get_irn_n(tmp, n);
2418 if(!has_reg_class(si, remat_arg)) continue;
2420 /* if value is becoming live through use by remat2 */
2421 if(!pset_find_ptr(live, remat_arg)) {
2422 op_t *remat_arg_op = get_irn_link(remat_arg);
2425 DBG((si->dbg, LEVEL_3, " value %+F becoming live through use by remat2 at bb start %+F\n", remat_arg, tmp));
2427 pset_insert_ptr(live, remat_arg);
2428 spill = add_to_spill_bb(si, bb, remat_arg);
2429 remat_arg_op->attr.live_range.ilp = ILP_UNDEF;
2431 /* we need reg_in and mem_in for this value; they will be referenced later */
2432 ir_snprintf(buf, sizeof(buf), "reg_in_%N_%N", remat_arg, bb);
2433 spill->reg_in = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
2434 ir_snprintf(buf, sizeof(buf), "mem_in_%N_%N", remat_arg, bb);
2435 spill->mem_in = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
2438 /* optimization: all memory stuff should be 0, for we do not want to insert reloads for remats */
2439 ir_snprintf(buf, sizeof(buf), "nomem_%N_%N", remat_arg, bb);
2440 nomem = lpp_add_cst_uniq(si->lpp, buf, lpp_equal, 0.0);
2442 lpp_set_factor_fast(si->lpp, nomem, spill->spill, 1.0);
2443 if(spill_bb->reloads) {
2444 keyval_t *keyval = set_find_keyval(spill_bb->reloads, remat_arg);
2447 ilp_var_t reload = PTR_TO_INT(keyval->val);
2448 lpp_set_factor_fast(si->lpp, nomem, reload, 1.0);
2455 /* L\U is empty at bb start */
2456 /* arg is live throughout epilog if it is reg_in into this block */
2458 /* check the register pressure at the beginning of the block
2461 /* reg_in entspricht post_use */
2463 ir_snprintf(buf, sizeof(buf), "check_start_%N", bb);
2464 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, si->n_regs);
2466 pset_foreach(live, irn) {
2469 spill = set_find_spill(spill_bb->ilp, irn);
2472 ir_snprintf(buf, sizeof(buf), "reg_in_%N_%N", irn, bb);
2473 spill->reg_in = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
2475 lpp_set_factor_fast(si->lpp, cst, spill->reg_in, 1.0);
2477 /* spill + mem_in <= 1 */
2478 ir_snprintf(buf, sizeof(buf), "nospill_%N_%N", irn, bb);
2479 nospill = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 1);
2481 lpp_set_factor_fast(si->lpp, nospill, spill->mem_in, 1.0);
2482 lpp_set_factor_fast(si->lpp, nospill, spill->spill, 1.0);
2484 } /* post_remats are NOT included in register pressure check because
2485 they do not increase regpressure */
2487 /* mem_in/reg_in for live_in values, especially phis and their arguments */
2488 pset_foreach(live, irn) {
2492 spill = set_find_spill(spill_bb->ilp, irn);
2493 assert(spill && spill->irn == irn);
2495 if(is_Phi(irn) && get_nodes_block(irn) == bb) {
2496 for (n=get_Phi_n_preds(irn)-1; n>=0; --n) {
2499 ir_node *phi_arg = get_Phi_pred(irn, n);
2500 ir_node *bb_p = get_Block_cfgpred_block(bb, n);
2501 spill_bb_t *spill_bb_p = get_irn_link(bb_p);
2503 op_t *op = get_irn_link(irn);
2505 /* although the phi is in the right regclass one or more of
2506 * its arguments can be in a different one or at least to
2509 if(has_reg_class(si, phi_arg)) {
2510 /* mem_in < mem_out_arg + copy */
2511 ir_snprintf(buf, sizeof(buf), "mem_in_%N_%N-%d", irn, bb, p);
2512 mem_in = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2514 /* reg_in < reg_out_arg */
2515 ir_snprintf(buf, sizeof(buf), "reg_in_%N_%N-%d", irn, bb, p++);
2516 reg_in = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2518 lpp_set_factor_fast(si->lpp, mem_in, spill->mem_in, 1.0);
2519 lpp_set_factor_fast(si->lpp, reg_in, spill->reg_in, 1.0);
2521 spill_p = set_find_spill(spill_bb_p->ilp, phi_arg);
2524 lpp_set_factor_fast(si->lpp, mem_in, spill_p->mem_out, -1.0);
2526 lpp_set_factor_fast(si->lpp, mem_in, op->attr.live_range.args.copies[n], -1.0);
2528 lpp_set_factor_fast(si->lpp, reg_in, spill_p->reg_out, -1.0);
2532 /* else assure the value arrives on all paths in the same resource */
2534 for (n=get_Block_n_cfgpreds(bb)-1; n>=0; --n) {
2537 ir_node *bb_p = get_Block_cfgpred_block(bb, n);
2538 spill_bb_t *spill_bb_p = get_irn_link(bb_p);
2541 ir_snprintf(buf, sizeof(buf), "mem_in_%N_%N-%d", irn, bb, p);
2542 mem_in = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2543 ir_snprintf(buf, sizeof(buf), "reg_in_%N_%N-%d", irn, bb, p++);
2544 reg_in = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2546 lpp_set_factor_fast(si->lpp, mem_in, spill->mem_in, 1.0);
2547 lpp_set_factor_fast(si->lpp, reg_in, spill->reg_in, 1.0);
2549 spill_p = set_find_spill(spill_bb_p->ilp, irn);
2552 lpp_set_factor_fast(si->lpp, mem_in, spill_p->mem_out, -1.0);
2553 lpp_set_factor_fast(si->lpp, reg_in, spill_p->reg_out, -1.0);
2558 foreach_post_remat(bb, tmp) {
2561 for (n=get_irn_arity(tmp)-1; n>=0; --n) {
2562 ir_node *remat_arg = get_irn_n(tmp, n);
2563 op_t *remat_op = get_irn_link(tmp);
2565 if(!has_reg_class(si, remat_arg)) continue;
2567 spill = set_find_spill(spill_bb->ilp, remat_arg);
2570 /* remat <= reg_in_argument */
2571 ir_snprintf(buf, sizeof(buf), "req_remat2_%N_%N_arg_%N", tmp, bb, remat_arg);
2572 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
2573 lpp_set_factor_fast(si->lpp, cst, spill->reg_in, -1.0);
2574 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
2578 pset_foreach(live, irn) {
2579 const op_t *op = get_irn_link(irn);
2580 const ir_node *remat;
2583 if(op->attr.live_range.ilp == ILP_UNDEF) continue;
2587 foreach_post_remat(bb, remat) {
2590 for (n=get_irn_arity(remat)-1; n>=0; --n) {
2591 const ir_node *arg = get_irn_n(remat, n);
2594 const op_t *remat_op = get_irn_link(remat);
2596 if(cst == ILP_UNDEF) {
2597 /* \sum post_remat <= 1 + #post_remats * next(lr) */
2598 ir_snprintf(buf, sizeof(buf), "remat2_%N_%N_arg_%N", remat, bb, irn);
2599 cst = lpp_add_cst(si->lpp, buf, lpp_less, 1.0);
2601 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
2608 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.ilp, n_remats);
2612 /* first live ranges from reg_ins */
2613 pset_foreach(live, irn) {
2614 op_t *op = get_irn_link(irn);
2616 if(op->attr.live_range.ilp != ILP_UNDEF) {
2618 spill = set_find_spill(spill_bb->ilp, irn);
2619 assert(spill && spill->irn == irn);
2621 ir_snprintf(buf, sizeof(buf), "first_lr_%N_%N", irn, bb);
2622 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2623 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.ilp, 1.0);
2624 lpp_set_factor_fast(si->lpp, cst, spill->reg_in, -1.0);
2626 foreach_post_remat(bb, tmp) {
2627 op_t *remat_op = get_irn_link(tmp);
2629 if(remat_op->attr.remat.remat->value == irn) {
2630 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, -1.0);
2636 /* walk forward now and compute constraints for placing spills */
2637 /* this must only be done for values that are not defined in this block */
2638 /* TODO are these values at start of block? if yes, just check whether this is a diverge edge and skip the loop */
2639 pset_foreach(live, irn) {
2641 * if value is defined in this block we can anways place the spill directly after the def
2642 * -> no constraint necessary
2644 if(!is_Phi(irn) && get_nodes_block(irn) == bb) continue;
2647 spill = set_find_spill(spill_bb->ilp, irn);
2650 ir_snprintf(buf, sizeof(buf), "req_spill_%N_%N", irn, bb);
2651 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2653 lpp_set_factor_fast(si->lpp, cst, spill->spill, 1.0);
2654 if(is_diverge_edge(bb)) lpp_set_factor_fast(si->lpp, cst, spill->reg_in, -1.0);
2657 sched_foreach_op(bb, tmp) {
2658 op_t *op = get_irn_link(tmp);
2660 if(is_Phi(tmp)) continue;
2661 assert(!is_Proj(tmp));
2664 const ir_node *value = op->attr.remat.remat->value;
2667 /* only collect remats up to the first real use of a value */
2668 lpp_set_factor_fast(si->lpp, cst, op->attr.remat.ilp, -1.0);
2673 for (n=get_irn_arity(tmp)-1; n>=0; --n) {
2674 ir_node *arg = get_irn_n(tmp, n);
2677 /* if a value is used stop collecting remats */
2690 typedef struct _irnlist_t {
2691 struct list_head list;
2695 typedef struct _interference_t {
2696 struct list_head blocklist;
2702 cmp_interference(const void *a, const void *b, size_t size)
2704 const interference_t *p = a;
2705 const interference_t *q = b;
2707 return !(p->a == q->a && p->b == q->b);
2710 static interference_t *
2711 set_find_interference(set * set, ir_node * a, ir_node * b)
2713 interference_t query;
2715 query.a = (a>b)?a:b;
2716 query.b = (a>b)?b:a;
2718 return set_find(set, &query, sizeof(query), HASH_PTR(PTR_TO_INT(a) ^ PTR_TO_INT(b)));
2721 static interference_t *
2722 set_insert_interference(spill_ilp_t * si, set * set, ir_node * a, ir_node * b, ir_node * bb)
2724 interference_t query,
2726 irnlist_t *list = obstack_alloc(si->obst, sizeof(*list));
2730 result = set_find_interference(set, a, b);
2733 list_add(&list->list, &result->blocklist);
2737 query.a = (a>b)?a:b;
2738 query.b = (a>b)?b:a;
2740 result = set_insert(set, &query, sizeof(query), HASH_PTR(PTR_TO_INT(a) ^ PTR_TO_INT(b)));
2742 INIT_LIST_HEAD(&result->blocklist);
2743 list_add(&list->list, &result->blocklist);
2749 values_interfere_in_block(const spill_ilp_t * si, const ir_node * bb, const ir_node * a, const ir_node * b)
2751 const ir_edge_t *edge;
2753 if(get_nodes_block(a) != bb && get_nodes_block(b) != bb) {
2754 /* both values are live in, so they interfere */
2758 /* ensure a dominates b */
2759 if(value_dominates(b,a)) {
2765 assert(get_nodes_block(b) == bb && "at least b should be defined here in this block");
2768 /* the following code is stolen from bera.c */
2769 if(be_is_live_end(si->lv, bb, a))
2772 foreach_out_edge(a, edge) {
2773 const ir_node *user = edge->src;
2774 if(get_nodes_block(user) == bb
2777 && !pset_find_ptr(si->inverse_ops, user)
2778 && value_dominates(b, user))
2786 * Walk all irg blocks and collect interfering values inside of phi classes
2789 luke_interferencewalker(ir_node * bb, void * data)
2791 spill_ilp_t *si = (spill_ilp_t*)data;
2794 be_lv_foreach(si->lv, bb, be_lv_state_end | be_lv_state_out | be_lv_state_in, l1) {
2795 ir_node *a = be_lv_get_irn(si->lv, bb, l1);
2796 op_t *a_op = get_irn_link(a);
2799 /* a is only interesting if it is in my register class and if it is inside a phi class */
2800 if (has_reg_class(si, a) && get_phi_class(a)) {
2801 if(a_op->is_remat || pset_find_ptr(si->inverse_ops, a))
2804 for(l2=_be_lv_next_irn(si->lv, bb, 0xff, l1+1); l2>=0; l2=_be_lv_next_irn(si->lv, bb, 0xff, l2+1)) {
2805 ir_node *b = be_lv_get_irn(si->lv, bb, l2);
2806 op_t *b_op = get_irn_link(b);
2809 /* a and b are only interesting if they are in the same phi class */
2810 if(has_reg_class(si, b) && get_phi_class(a) == get_phi_class(b)) {
2811 if(b_op->is_remat || pset_find_ptr(si->inverse_ops, b))
2814 if(values_interfere_in_block(si, bb, a, b)) {
2815 DBG((si->dbg, LEVEL_4, "\tvalues interfere in %+F: %+F, %+F\n", bb, a, b));
2816 set_insert_interference(si, si->interferences, a, b, bb);
2824 static unsigned int copy_path_id = 0;
2827 write_copy_path_cst(spill_ilp_t *si, pset * copies, ilp_var_t any_interfere)
2834 ir_snprintf(buf, sizeof(buf), "copy_path-%d", copy_path_id++);
2835 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0);
2837 lpp_set_factor_fast(si->lpp, cst, any_interfere, 1.0);
2839 pset_foreach(copies, ptr) {
2840 copy = PTR_TO_INT(ptr);
2841 lpp_set_factor_fast(si->lpp, cst, copy, -1.0);
2846 * @parameter copies contains a path of copies which lead us to irn
2847 * @parameter visited contains a set of nodes already visited on this path
2850 find_copy_path(spill_ilp_t * si, const ir_node * irn, const ir_node * target, ilp_var_t any_interfere, pset * copies, pset * visited)
2852 const ir_edge_t *edge;
2853 op_t *op = get_irn_link(irn);
2854 pset *visited_users = pset_new_ptr_default();
2857 if(op->is_remat) return 0;
2859 pset_insert_ptr(visited, irn);
2863 pset *visited_operands = pset_new_ptr(get_irn_arity(irn));
2865 /* visit all operands */
2866 for(n=get_irn_arity(irn)-1; n>=0; --n) {
2867 ir_node *arg = get_irn_n(irn, n);
2868 ilp_var_t copy = op->attr.live_range.args.copies[n];
2870 if(!has_reg_class(si, arg)) continue;
2871 if(pset_find_ptr(visited_operands, arg)) continue;
2872 pset_insert_ptr(visited_operands, arg);
2875 if(++paths > MAX_PATHS && pset_count(copies) != 0) {
2876 del_pset(visited_operands);
2877 del_pset(visited_users);
2878 pset_remove_ptr(visited, irn);
2881 pset_insert(copies, INT_TO_PTR(copy), copy);
2882 write_copy_path_cst(si, copies, any_interfere);
2883 pset_remove(copies, INT_TO_PTR(copy), copy);
2884 } else if(!pset_find_ptr(visited, arg)) {
2885 pset_insert(copies, INT_TO_PTR(copy), copy);
2886 paths += find_copy_path(si, arg, target, any_interfere, copies, visited);
2887 pset_remove(copies, INT_TO_PTR(copy), copy);
2889 if(paths > MAX_PATHS) {
2890 if(pset_count(copies) == 0) {
2894 ir_snprintf(buf, sizeof(buf), "always_copy-%d-%d", any_interfere, copy);
2895 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_equal, 0);
2896 lpp_set_factor_fast(si->lpp, cst, any_interfere, -1.0);
2897 lpp_set_factor_fast(si->lpp, cst, copy, 1.0);
2898 DBG((si->dbg, LEVEL_1, "ALWAYS COPYING %d FOR INTERFERENCE %d\n", copy, any_interfere));
2902 del_pset(visited_operands);
2903 del_pset(visited_users);
2904 pset_remove_ptr(visited, irn);
2907 } else if(pset_count(copies) == 0) {
2913 del_pset(visited_operands);
2916 /* visit all uses which are phis */
2917 foreach_out_edge(irn, edge) {
2918 ir_node *user = edge->src;
2919 int pos = edge->pos;
2920 op_t *op = get_irn_link(user);
2923 if(!is_Phi(user)) continue;
2924 if(!has_reg_class(si, user)) continue;
2925 if(pset_find_ptr(visited_users, user)) continue;
2926 pset_insert_ptr(visited_users, user);
2928 copy = op->attr.live_range.args.copies[pos];
2930 if(user == target) {
2931 if(++paths > MAX_PATHS && pset_count(copies) != 0) {
2932 del_pset(visited_users);
2933 pset_remove_ptr(visited, irn);
2936 pset_insert(copies, INT_TO_PTR(copy), copy);
2937 write_copy_path_cst(si, copies, any_interfere);
2938 pset_remove(copies, INT_TO_PTR(copy), copy);
2939 } else if(!pset_find_ptr(visited, user)) {
2940 pset_insert(copies, INT_TO_PTR(copy), copy);
2941 paths += find_copy_path(si, user, target, any_interfere, copies, visited);
2942 pset_remove(copies, INT_TO_PTR(copy), copy);
2944 if(paths > MAX_PATHS) {
2945 if(pset_count(copies) == 0) {
2949 ir_snprintf(buf, sizeof(buf), "always_copy-%d-%d", any_interfere, copy);
2950 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_equal, 0);
2951 lpp_set_factor_fast(si->lpp, cst, any_interfere, -1.0);
2952 lpp_set_factor_fast(si->lpp, cst, copy, 1.0);
2953 DBG((si->dbg, LEVEL_1, "ALWAYS COPYING %d FOR INTERFERENCE %d\n", copy, any_interfere));
2957 del_pset(visited_users);
2958 pset_remove_ptr(visited, irn);
2961 } else if(pset_count(copies) == 0) {
2967 del_pset(visited_users);
2968 pset_remove_ptr(visited, irn);
2973 gen_copy_constraints(spill_ilp_t * si, const ir_node * a, const ir_node * b, ilp_var_t any_interfere)
2975 pset * copies = pset_new_ptr_default();
2976 pset * visited = pset_new_ptr_default();
2978 find_copy_path(si, a, b, any_interfere, copies, visited);
2986 memcopyhandler(spill_ilp_t * si)
2988 interference_t *interference;
2990 /* teste Speicherwerte auf Interferenz */
2992 /* analyze phi classes */
2993 phi_class_compute(si->chordal_env->irg);
2995 DBG((si->dbg, LEVEL_2, "\t calling interferencewalker\n"));
2996 irg_block_walk_graph(si->chordal_env->irg, luke_interferencewalker, NULL, si);
2998 /* now lets emit the ILP unequations for the crap */
2999 set_foreach(si->interferences, interference) {
3001 ilp_var_t interfere,
3003 ilp_cst_t any_interfere_cst,
3005 const ir_node *a = interference->a;
3006 const ir_node *b = interference->b;
3008 /* any_interf <= \sum interf */
3009 ir_snprintf(buf, sizeof(buf), "interfere_%N_%N", a, b);
3010 any_interfere_cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0);
3011 any_interfere = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
3013 lpp_set_factor_fast(si->lpp, any_interfere_cst, any_interfere, 1.0);
3015 list_for_each_entry(irnlist_t, irnlist, &interference->blocklist, list) {
3016 const ir_node *bb = irnlist->irn;
3017 spill_bb_t *spill_bb = get_irn_link(bb);
3022 spilla = set_find_spill(spill_bb->ilp, a);
3025 spillb = set_find_spill(spill_bb->ilp, b);
3028 /* interfere <-> (mem_in_a or spill_a) and (mem_in_b or spill_b): */
3029 /* 1: mem_in_a + mem_in_b + spill_a + spill_b - interfere <= 1 */
3030 /* 2: - mem_in_a - spill_a + interfere <= 0 */
3031 /* 3: - mem_in_b - spill_b + interfere <= 0 */
3032 ir_snprintf(buf, sizeof(buf), "interfere_%N_%N_%N", bb, a, b);
3033 interfere = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
3035 ir_snprintf(buf, sizeof(buf), "interfere_%N_%N_%N-1", bb, a, b);
3036 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 1);
3038 lpp_set_factor_fast(si->lpp, cst, interfere, -1.0);
3039 if(spilla->mem_in != ILP_UNDEF) lpp_set_factor_fast(si->lpp, cst, spilla->mem_in, 1.0);
3040 lpp_set_factor_fast(si->lpp, cst, spilla->spill, 1.0);
3041 if(spillb->mem_in != ILP_UNDEF) lpp_set_factor_fast(si->lpp, cst, spillb->mem_in, 1.0);
3042 lpp_set_factor_fast(si->lpp, cst, spillb->spill, 1.0);
3044 ir_snprintf(buf, sizeof(buf), "interfere_%N_%N_%N-2", bb, a, b);
3045 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0);
3047 lpp_set_factor_fast(si->lpp, cst, interfere, 1.0);
3048 if(spilla->mem_in != ILP_UNDEF) lpp_set_factor_fast(si->lpp, cst, spilla->mem_in, -1.0);
3049 lpp_set_factor_fast(si->lpp, cst, spilla->spill, -1.0);
3051 ir_snprintf(buf, sizeof(buf), "interfere_%N_%N_%N-3", bb, a, b);
3052 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0);
3054 lpp_set_factor_fast(si->lpp, cst, interfere, 1.0);
3055 if(spillb->mem_in != ILP_UNDEF) lpp_set_factor_fast(si->lpp, cst, spillb->mem_in, -1.0);
3056 lpp_set_factor_fast(si->lpp, cst, spillb->spill, -1.0);
3059 lpp_set_factor_fast(si->lpp, any_interfere_cst, interfere, -1.0);
3061 /* any_interfere >= interf */
3062 ir_snprintf(buf, sizeof(buf), "interfere_%N_%N-%N", a, b, bb);
3063 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0);
3065 lpp_set_factor_fast(si->lpp, cst, interfere, 1.0);
3066 lpp_set_factor_fast(si->lpp, cst, any_interfere, -1.0);
3069 /* now that we know whether the two values interfere in memory we can drop constraints to enforce copies */
3070 gen_copy_constraints(si,a,b,any_interfere);
3078 return fabs(x) < 0.00001;
3081 static int mark_remat_nodes_hook(FILE *F, ir_node *n, ir_node *l)
3083 spill_ilp_t *si = get_irg_link(current_ir_graph);
3085 if(pset_find_ptr(si->all_possible_remats, n)) {
3086 op_t *op = (op_t*)get_irn_link(n);
3087 assert(op && op->is_remat);
3089 if(!op->attr.remat.remat->inverse) {
3090 if(op->attr.remat.pre) {
3091 ir_fprintf(F, "color:red info3:\"remat value: %+F\"", op->attr.remat.remat->value);
3093 ir_fprintf(F, "color:orange info3:\"remat2 value: %+F\"", op->attr.remat.remat->value);
3098 op_t *op = (op_t*)get_irn_link(n);
3099 assert(op && op->is_remat);
3101 if(op->attr.remat.pre) {
3102 ir_fprintf(F, "color:cyan info3:\"remat inverse value: %+F\"", op->attr.remat.remat->value);
3104 ir_fprintf(F, "color:lightcyan info3:\"remat2 inverse value: %+F\"", op->attr.remat.remat->value);
3115 dump_graph_with_remats(ir_graph * irg, const char * suffix)
3117 set_dump_node_vcgattr_hook(mark_remat_nodes_hook);
3118 be_dump(irg, suffix, dump_ir_block_graph_sched);
3119 set_dump_node_vcgattr_hook(NULL);
3123 * Edge hook to dump the schedule edges with annotated register pressure.
3126 sched_pressure_edge_hook(FILE *F, ir_node *irn)
3128 if(sched_is_scheduled(irn) && sched_has_prev(irn)) {
3129 ir_node *prev = sched_prev(irn);
3130 fprintf(F, "edge:{sourcename:\"");
3132 fprintf(F, "\" targetname:\"");
3134 fprintf(F, "\" label:\"%d", (int)get_irn_link(irn));
3135 fprintf(F, "\" color:magenta}\n");
3141 dump_ir_block_graph_sched_pressure(ir_graph *irg, const char *suffix)
3143 DUMP_NODE_EDGE_FUNC old_edge_hook = get_dump_node_edge_hook();
3145 dump_consts_local(0);
3146 set_dump_node_edge_hook(sched_pressure_edge_hook);
3147 dump_ir_block_graph(irg, suffix);
3148 set_dump_node_edge_hook(old_edge_hook);
3152 walker_pressure_annotator(ir_node * bb, void * data)
3154 spill_ilp_t *si = data;
3157 pset *live = pset_new_ptr_default();
3160 be_lv_foreach(si->lv, bb, be_lv_state_end, i) {
3161 irn = be_lv_get_irn(si->lv, bb, i);
3163 if (has_reg_class(si, irn)) {
3164 pset_insert_ptr(live, irn);
3168 set_irn_link(bb, INT_TO_PTR(pset_count(live)));
3170 sched_foreach_reverse(bb, irn) {
3172 set_irn_link(irn, INT_TO_PTR(pset_count(live)));
3176 if(has_reg_class(si, irn)) {
3177 pset_remove_ptr(live, irn);
3178 if(is_Proj(irn)) ++projs;
3181 if(!is_Proj(irn)) projs = 0;
3183 for (n=get_irn_arity(irn)-1; n>=0; --n) {
3184 ir_node *arg = get_irn_n(irn, n);
3186 if(has_reg_class(si, arg)) pset_insert_ptr(live, arg);
3188 set_irn_link(irn, INT_TO_PTR(pset_count(live)+projs));
3195 dump_pressure_graph(spill_ilp_t * si, const char *suffix)
3197 be_dump(si->chordal_env->irg, suffix, dump_ir_block_graph_sched_pressure);
3201 connect_all_remats_with_keep(spill_ilp_t * si)
3209 n_remats = pset_count(si->all_possible_remats);
3211 ins = obstack_alloc(si->obst, n_remats * sizeof(*ins));
3214 pset_foreach(si->all_possible_remats, irn) {
3219 si->keep = be_new_Keep(si->chordal_env->cls, si->chordal_env->irg, get_irg_end_block(si->chordal_env->irg), n_remats, ins);
3221 obstack_free(si->obst, ins);
3226 connect_all_spills_with_keep(spill_ilp_t * si)
3235 n_spills = pset_count(si->spills);
3237 ins = obstack_alloc(si->obst, n_spills * sizeof(*ins));
3240 pset_foreach(si->spills, irn) {
3245 keep = be_new_Keep(si->chordal_env->cls, si->chordal_env->irg, get_irg_end_block(si->chordal_env->irg), n_spills, ins);
3247 obstack_free(si->obst, ins);
3251 /** insert a spill at an arbitrary position */
3252 ir_node *be_spill2(const arch_env_t *arch_env, ir_node *irn, ir_node *insert)
3254 ir_node *bl = is_Block(insert)?insert:get_nodes_block(insert);
3255 ir_graph *irg = get_irn_irg(bl);
3256 ir_node *frame = get_irg_frame(irg);
3260 const arch_register_class_t *cls = arch_get_irn_reg_class(arch_env, irn, -1);
3261 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
3263 spill = be_new_Spill(cls, cls_frame, irg, bl, frame, irn);
3266 * search the right insertion point. a spill of a phi cannot be put
3267 * directly after the phi, if there are some phis behind the one which
3268 * is spilled. Also, a spill of a Proj must be after all Projs of the
3271 * Here's one special case:
3272 * If the spill is in the start block, the spill must be after the frame
3273 * pointer is set up. This is done by setting insert to the end of the block
3274 * which is its default initialization (see above).
3277 if(bl == get_irg_start_block(irg) && sched_get_time_step(frame) >= sched_get_time_step(insert))
3280 for (next = sched_next(insert); is_Phi(next) || is_Proj(next); next = sched_next(insert))
3283 sched_add_after(insert, spill);
3288 delete_remat(spill_ilp_t * si, ir_node * remat) {
3290 ir_node *bad = get_irg_bad(si->chordal_env->irg);
3292 sched_remove(remat);
3294 /* kill links to operands */
3295 for (n=get_irn_arity(remat)-1; n>=-1; --n) {
3296 set_irn_n(remat, n, bad);
3301 clean_remat_info(spill_ilp_t * si)
3305 remat_info_t *remat_info;
3306 ir_node *bad = get_irg_bad(si->chordal_env->irg);
3308 set_foreach(si->remat_info, remat_info) {
3309 if(!remat_info->remats) continue;
3311 pset_foreach(remat_info->remats, remat)
3313 if(remat->proj && get_irn_n_edges(remat->proj) == 0) {
3314 set_irn_n((ir_node*)remat->proj, -1, bad);
3315 set_irn_n((ir_node*)remat->proj, 0, bad);
3318 if(get_irn_n_edges(remat->op) == 0) {
3319 for (n=get_irn_arity(remat->op)-1; n>=-1; --n) {
3320 set_irn_n((ir_node*)remat->op, n, bad);
3325 if(remat_info->remats) del_pset(remat_info->remats);
3326 if(remat_info->remats_by_operand) del_pset(remat_info->remats_by_operand);
3331 delete_unnecessary_remats(spill_ilp_t * si)
3333 if(opt_keep_alive & KEEPALIVE_REMATS) {
3335 ir_node *bad = get_irg_bad(si->chordal_env->irg);
3338 // ir_node *end = get_irg_end(si->chordal_env->irg);
3341 for (n=get_irn_arity(si->keep)-1; n>=0; --n) {
3342 ir_node *keep_arg = get_irn_n(si->keep, n);
3343 op_t *arg_op = get_irn_link(keep_arg);
3346 assert(arg_op->is_remat);
3348 name = si->lpp->vars[arg_op->attr.remat.ilp];
3350 if(is_zero(name->value)) {
3351 DBG((si->dbg, LEVEL_3, "\t deleting remat %+F\n", keep_arg));
3352 /* TODO check whether reload is preferred over remat (could be bug) */
3353 delete_remat(si, keep_arg);
3355 if(!arg_op->attr.remat.remat->inverse) {
3356 if(arg_op->attr.remat.pre) {
3357 DBG((si->dbg, LEVEL_2, "\t**remat kept: %+F\n", keep_arg));
3359 DBG((si->dbg, LEVEL_2, "\t%%%%remat2 kept: %+F\n", keep_arg));
3362 if(arg_op->attr.remat.pre) {
3363 DBG((si->dbg, LEVEL_2, "\t**INVERSE remat kept: %+F\n", keep_arg));
3365 DBG((si->dbg, LEVEL_2, "\t%%%%INVERSE remat2 kept: %+F\n", keep_arg));
3370 set_irn_n(si->keep, n, bad);
3373 for (i = 0, n = get_End_n_keepalives(end); i < n; ++i) {
3374 ir_node *end_arg = get_End_keepalive(end, i);
3376 if(end_arg != si->keep) {
3377 obstack_grow(si->obst, &end_arg, sizeof(end_arg));
3380 keeps = obstack_finish(si->obst);
3381 set_End_keepalives(end, n-1, keeps);
3382 obstack_free(si->obst, keeps);
3385 DBG((si->dbg, LEVEL_2, "\t no remats to delete (none have been inserted)\n"));
3390 pset_foreach(si->all_possible_remats, remat) {
3391 op_t *remat_op = get_irn_link(remat);
3392 lpp_name_t *name = si->lpp->vars[remat_op->attr.remat.ilp];
3394 if(is_zero(name->value)) {
3395 DBG((si->dbg, LEVEL_3, "\t deleting remat %+F\n", remat));
3396 /* TODO check whether reload is preferred over remat (could be bug) */
3397 delete_remat(si, remat);
3399 if(!remat_op->attr.remat.remat->inverse) {
3400 if(remat_op->attr.remat.pre) {
3401 DBG((si->dbg, LEVEL_2, "\t**remat kept: %+F\n", remat));
3403 DBG((si->dbg, LEVEL_2, "\t%%%%remat2 kept: %+F\n", remat));
3406 if(remat_op->attr.remat.pre) {
3407 DBG((si->dbg, LEVEL_2, "\t**INVERSE remat kept: %+F\n", remat));
3409 DBG((si->dbg, LEVEL_2, "\t%%%%INVERSE remat2 kept: %+F\n", remat));
3418 get_spills_for_value(spill_ilp_t * si, const ir_node * value)
3420 pset *spills = pset_new_ptr_default();
3422 const ir_node *next;
3425 defs = set_find_def(si->values, value);
3427 if(defs && defs->spills) {
3428 for(next = defs->spills; next; next = get_irn_link(next)) {
3429 pset_insert_ptr(spills, next);
3437 * @param before The node after which the spill will be placed in the schedule
3440 insert_spill(spill_ilp_t * si, ir_node * irn, const ir_node * value, ir_node * before)
3444 const arch_env_t *arch_env = si->chordal_env->birg->main_env->arch_env;
3446 DBG((si->dbg, LEVEL_3, "\t inserting spill for value %+F after %+F\n", irn, before));
3448 spill = be_spill2(arch_env, irn, before);
3450 defs = set_insert_def(si->values, value);
3453 /* enter into the linked list */
3454 set_irn_link(spill, defs->spills);
3455 defs->spills = spill;
3457 if(opt_keep_alive & KEEPALIVE_SPILLS)
3458 pset_insert_ptr(si->spills, spill);
3464 * @param before The Phi node which has to be spilled
3467 insert_mem_phi(spill_ilp_t * si, ir_node * phi)
3474 NEW_ARR_A(ir_node*, ins, get_irn_arity(phi));
3476 for(n=get_irn_arity(phi)-1; n>=0; --n) {
3477 ins[n] = si->m_unknown;
3480 mem_phi = new_r_Phi(si->chordal_env->irg, get_nodes_block(phi), get_irn_arity(phi), ins, mode_M);
3482 defs = set_insert_def(si->values, phi);
3485 /* enter into the linked list */
3486 set_irn_link(mem_phi, defs->spills);
3487 defs->spills = mem_phi;
3489 #ifdef SCHEDULE_PHIM
3490 sched_add_after(phi, mem_phi);
3493 if(opt_keep_alive & KEEPALIVE_SPILLS)
3494 pset_insert_ptr(si->spills, mem_phi);
3501 * Add remat to list of defs, destroys link field!
3504 insert_remat(spill_ilp_t * si, ir_node * remat)
3507 op_t *remat_op = get_irn_link(remat);
3509 assert(remat_op->is_remat);
3511 defs = set_insert_def(si->values, remat_op->attr.remat.remat->value);
3514 /* enter into the linked list */
3515 set_irn_link(remat, defs->remats);
3516 defs->remats = remat;
3521 * Add reload before operation and add to list of defs
3524 insert_reload(spill_ilp_t * si, const ir_node * value, ir_node * after)
3529 const arch_env_t *arch_env = si->chordal_env->birg->main_env->arch_env;
3531 DBG((si->dbg, LEVEL_3, "\t inserting reload for value %+F before %+F\n", value, after));
3533 defs = set_find_def(si->values, value);
3535 spill = defs->spills;
3536 assert(spill && "no spill placed before reload");
3538 reload = be_reload(arch_env, si->cls, after, get_irn_mode(value), spill);
3540 /* enter into the linked list */
3541 set_irn_link(reload, defs->remats);
3542 defs->remats = reload;
3547 void perform_memory_operand(spill_ilp_t * si, memoperand_t * memoperand)
3551 ir_node *value = get_irn_n(memoperand->irn, memoperand->pos);
3553 const arch_env_t *arch_env = si->chordal_env->birg->main_env->arch_env;
3555 DBG((si->dbg, LEVEL_2, "\t inserting memory operand for value %+F at %+F\n", value, memoperand->irn));
3557 defs = set_find_def(si->values, value);
3559 spill = defs->spills;
3560 assert(spill && "no spill placed before reload");
3562 reload = be_reload(arch_env, si->cls, memoperand->irn, get_irn_mode(value), spill);
3564 arch_perform_memory_operand(arch_env, memoperand->irn, reload, memoperand->pos);
3565 sched_remove(reload);
3568 void insert_memoperands(spill_ilp_t * si)
3570 memoperand_t *memoperand;
3573 set_foreach(si->memoperands, memoperand) {
3574 name = si->lpp->vars[memoperand->ilp];
3575 if(!is_zero(name->value)) {
3576 perform_memory_operand(si, memoperand);
3582 walker_spill_placer(ir_node * bb, void * data) {
3583 spill_ilp_t *si = (spill_ilp_t*)data;
3585 spill_bb_t *spill_bb = get_irn_link(bb);
3586 pset *spills_to_do = pset_new_ptr_default();
3589 set_foreach(spill_bb->ilp, spill) {
3592 if(is_Phi(spill->irn) && get_nodes_block(spill->irn) == bb) {
3593 name = si->lpp->vars[spill->mem_in];
3594 if(!is_zero(name->value)) {
3597 mem_phi = insert_mem_phi(si, spill->irn);
3599 DBG((si->dbg, LEVEL_2, "\t >>spilled Phi %+F -> %+F\n", spill->irn, mem_phi));
3603 name = si->lpp->vars[spill->spill];
3604 if(!is_zero(name->value)) {
3605 /* place spill directly after definition */
3606 if(get_nodes_block(spill->irn) == bb) {
3607 insert_spill(si, spill->irn, spill->irn, spill->irn);
3611 /* place spill at bb start */
3612 if(spill->reg_in > 0) {
3613 name = si->lpp->vars[spill->reg_in];
3614 if(!is_zero(name->value)) {
3615 insert_spill(si, spill->irn, spill->irn, bb);
3619 /* place spill after a remat */
3620 pset_insert_ptr(spills_to_do, spill->irn);
3623 DBG((si->dbg, LEVEL_3, "\t %d spills to do in block %+F\n", pset_count(spills_to_do), bb));
3626 for(irn = sched_block_first_nonphi(bb); !sched_is_end(irn); irn = sched_next(irn)) {
3627 op_t *op = get_irn_link(irn);
3629 if(be_is_Spill(irn)) continue;
3632 /* TODO fix this if we want to support remats with more than two nodes */
3633 if(get_irn_mode(irn) != mode_T && pset_find_ptr(spills_to_do, op->attr.remat.remat->value)) {
3634 pset_remove_ptr(spills_to_do, op->attr.remat.remat->value);
3636 insert_spill(si, irn, op->attr.remat.remat->value, irn);
3639 if(pset_find_ptr(spills_to_do, irn)) {
3640 pset_remove_ptr(spills_to_do, irn);
3642 insert_spill(si, irn, irn, irn);
3648 assert(pset_count(spills_to_do) == 0);
3650 /* afterwards free data in block */
3651 del_pset(spills_to_do);
3655 insert_mem_copy(spill_ilp_t * si, ir_node * bb, ir_node * value)
3657 ir_node *insert_pos = bb;
3659 const arch_env_t *arch_env = si->chordal_env->birg->main_env->arch_env;
3661 /* find last definition of arg value in block */
3666 defs = set_find_def(si->values, value);
3668 if(defs && defs->remats) {
3669 for(next = defs->remats; next; next = get_irn_link(next)) {
3670 if(get_nodes_block(next) == bb && sched_get_time_step(next) > last) {
3671 last = sched_get_time_step(next);
3677 if(get_nodes_block(value) == bb && sched_get_time_step(value) > last) {
3678 last = sched_get_time_step(value);
3682 DBG((si->dbg, LEVEL_2, "\t inserting mem copy for value %+F after %+F\n", value, insert_pos));
3684 spill = be_spill2(arch_env, is_Block(insert_pos)?value:insert_pos, insert_pos);
3690 phim_fixer(spill_ilp_t *si) {
3693 set_foreach(si->values, defs) {
3694 const ir_node *phi = defs->value;
3695 op_t *op = get_irn_link(phi);
3696 ir_node *phi_m = NULL;
3697 ir_node *next = defs->spills;
3700 if(!is_Phi(phi)) continue;
3703 if(is_Phi(next) && get_irn_mode(next) == mode_M) {
3707 next = get_irn_link(next);
3710 if(!phi_m) continue;
3712 for(n=get_irn_arity(phi)-1; n>=0; --n) {
3713 ir_node *value = get_irn_n(phi, n);
3714 defs_t *val_defs = set_find_def(si->values, value);
3716 /* a spill of this value */
3721 ir_node *pred = get_Block_cfgpred_block(get_nodes_block(phi), n);
3722 lpp_name_t *name = si->lpp->vars[op->attr.live_range.args.copies[n]];
3724 if(!is_zero(name->value)) {
3725 spill = insert_mem_copy(si, pred, value);
3727 spill = val_defs->spills;
3730 spill = val_defs->spills;
3733 assert(spill && "no spill placed before PhiM");
3734 set_irn_n(phi_m, n, spill);
3740 walker_reload_placer(ir_node * bb, void * data) {
3741 spill_ilp_t *si = (spill_ilp_t*)data;
3743 spill_bb_t *spill_bb = get_irn_link(bb);
3745 /* reloads at end of block */
3746 if(spill_bb->reloads) {
3749 set_foreach(spill_bb->reloads, keyval) {
3750 ir_node *irn = (ir_node*)keyval->key;
3751 ilp_var_t reload = PTR_TO_INT(keyval->val);
3754 name = si->lpp->vars[reload];
3755 if(!is_zero(name->value)) {
3757 ir_node *insert_pos = bb;
3758 ir_node *prev = sched_block_last_noncf(si, bb);
3759 op_t *prev_op = get_irn_link(prev);
3761 while(be_is_Spill(prev)) {
3762 prev = sched_prev(prev);
3765 prev_op = get_irn_link(prev);
3767 /* insert reload before pre-remats */
3768 while(!sched_is_end(prev) && !be_is_Reload(prev) && !is_Phi(prev)
3769 && prev_op->is_remat && prev_op->attr.remat.pre) {
3773 prev = sched_prev(prev);
3774 } while(be_is_Spill(prev));
3776 prev_op = get_irn_link(prev);
3780 reload = insert_reload(si, irn, insert_pos);
3782 if(opt_keep_alive & KEEPALIVE_RELOADS)
3783 pset_insert_ptr(si->spills, reload);
3788 /* walk and insert more reloads and collect remats */
3789 sched_foreach_reverse(bb, irn) {
3790 op_t *op = get_irn_link(irn);
3792 if(be_is_Reload(irn) || be_is_Spill(irn)) continue;
3793 if(is_Phi(irn)) break;
3796 if(get_irn_mode(irn) != mode_T) {
3797 insert_remat(si, irn);
3802 for (n=get_irn_arity(irn)-1; n>=0; --n) {
3803 ir_node *arg = get_irn_n(irn, n);
3805 if(op->attr.live_range.args.reloads && op->attr.live_range.args.reloads[n] != ILP_UNDEF) {
3808 name = si->lpp->vars[op->attr.live_range.args.reloads[n]];
3809 if(!is_zero(name->value)) {
3811 ir_node *insert_pos = irn;
3812 ir_node *prev = sched_prev(insert_pos);
3815 while(be_is_Spill(prev)) {
3816 prev = sched_prev(prev);
3819 prev_op = get_irn_link(prev);
3821 /* insert reload before pre-remats */
3822 while(!sched_is_end(prev) && !be_is_Reload(prev) && !is_Phi(prev)
3823 && prev_op->is_remat && prev_op->attr.remat.pre) {
3827 prev = sched_prev(prev);
3828 } while(be_is_Spill(prev));
3830 prev_op = get_irn_link(prev);
3834 reload = insert_reload(si, arg, insert_pos);
3836 set_irn_n(irn, n, reload);
3838 if(opt_keep_alive & KEEPALIVE_RELOADS)
3839 pset_insert_ptr(si->spills, reload);
3846 del_set(spill_bb->ilp);
3847 if(spill_bb->reloads) del_set(spill_bb->reloads);
3851 walker_collect_used(ir_node * irn, void * data)
3853 lc_bitset_t *used = data;
3855 lc_bitset_set(used, get_irn_idx(irn));
3858 struct kill_helper {
3864 walker_kill_unused(ir_node * bb, void * data)
3866 struct kill_helper *kh = data;
3867 ir_node *bad = get_irg_bad(get_irn_irg(bb));
3871 for(irn=sched_first(bb); !sched_is_end(irn);) {
3872 ir_node *next = sched_next(irn);
3875 if(!lc_bitset_is_set(kh->used, get_irn_idx(irn))) {
3876 if(be_is_Spill(irn) || be_is_Reload(irn)) {
3877 DBG((kh->si->dbg, LEVEL_1, "\t SUBOPTIMAL! %+F IS UNUSED (cost: %g)\n", irn, get_cost(kh->si, irn)*execution_frequency(kh->si, bb)));
3879 assert(lpp_get_sol_state(kh->si->lpp) != lpp_optimal && "optimal solution is suboptimal?");
3885 set_nodes_block(irn, bad);
3886 for (n=get_irn_arity(irn)-1; n>=0; --n) {
3887 set_irn_n(irn, n, bad);
3895 kill_all_unused_values_in_schedule(spill_ilp_t * si)
3897 struct kill_helper kh;
3899 kh.used = lc_bitset_malloc(get_irg_last_idx(si->chordal_env->irg));
3902 irg_walk_graph(si->chordal_env->irg, walker_collect_used, NULL, kh.used);
3903 irg_block_walk_graph(si->chordal_env->irg, walker_kill_unused, NULL, &kh);
3905 lc_bitset_free(kh.used);
3909 print_irn_pset(pset * p)
3913 pset_foreach(p, irn) {
3914 ir_printf("%+F\n", irn);
3919 dump_phi_class(spill_ilp_t * si, pset * phiclass, const char * file)
3921 FILE *f = fopen(file, "w");
3923 interference_t *interference;
3925 pset_break(phiclass);
3926 set_break(si->interferences);
3928 ir_fprintf(f, "digraph phiclass {\n");
3930 pset_foreach(phiclass, irn) {
3932 ir_fprintf(f, " %F%N [shape=box]\n",irn,irn);
3935 pset_foreach(phiclass, irn) {
3938 if(!is_Phi(irn)) continue;
3940 for(n=get_irn_arity(irn)-1; n>=0; --n) {
3941 ir_node *arg = get_irn_n(irn, n);
3943 ir_fprintf(f, " %F%N -> %F%N\n",irn,irn,arg,arg);
3947 set_foreach(si->interferences, interference) {
3948 const ir_node *a = interference->a;
3949 const ir_node *b = interference->b;
3950 if(get_phi_class(a) == phiclass) {
3951 ir_fprintf(f, " %F%N -> %F%N [color=red,dir=none,style=bold]\n",a,a,b,b);
3960 rewire_uses(spill_ilp_t * si)
3962 dom_front_info_t *dfi = be_compute_dominance_frontiers(si->chordal_env->irg);
3964 pset *ignore = pset_new_ptr(1);
3966 pset_insert_ptr(ignore, get_irg_end(si->chordal_env->irg));
3968 /* then fix uses of spills */
3969 set_foreach(si->values, defs) {
3972 const ir_node *next = defs->remats;
3975 reloads = pset_new_ptr_default();
3978 if(be_is_Reload(next)) {
3979 pset_insert_ptr(reloads, next);
3983 next = get_irn_link(next);
3986 spills = get_spills_for_value(si, defs->value);
3987 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));
3988 if(pset_count(spills) > 1) {
3989 //assert(pset_count(reloads) > 0);
3990 // print_irn_pset(spills);
3991 // print_irn_pset(reloads);
3993 be_ssa_constr_set_ignore(dfi, si->lv, spills, ignore);
4000 /* first fix uses of remats and reloads */
4001 set_foreach(si->values, defs) {
4003 const ir_node *next = defs->remats;
4006 nodes = pset_new_ptr_default();
4007 pset_insert_ptr(nodes, defs->value);
4010 pset_insert_ptr(nodes, next);
4011 next = get_irn_link(next);
4014 if(pset_count(nodes) > 1) {
4015 DBG((si->dbg, LEVEL_4, "\t %d new definitions for value %+F\n", pset_count(nodes)-1, defs->value));
4016 be_ssa_constr_set(dfi, si->lv, nodes);
4023 // remove_unused_defs(si);
4025 be_free_dominance_frontiers(dfi);
4030 writeback_results(spill_ilp_t * si)
4032 /* walk through the graph and collect all spills, reloads and remats for a value */
4034 si->values = new_set(cmp_defs, 4096);
4036 DBG((si->dbg, LEVEL_1, "Applying results\n"));
4037 delete_unnecessary_remats(si);
4038 si->m_unknown = new_r_Unknown(si->chordal_env->irg, mode_M);
4039 irg_block_walk_graph(si->chordal_env->irg, walker_spill_placer, NULL, si);
4040 irg_block_walk_graph(si->chordal_env->irg, walker_reload_placer, NULL, si);
4042 insert_memoperands(si);
4045 /* clean the remat info! there are still back-edges leading there! */
4046 clean_remat_info(si);
4050 connect_all_spills_with_keep(si);
4052 del_set(si->values);
4056 get_n_regs(spill_ilp_t * si)
4058 int arch_n_regs = arch_register_class_n_regs(si->cls);
4062 for(i=0; i<arch_n_regs; i++) {
4063 if(!arch_register_type_is(&si->cls->regs[i], ignore)) {
4068 DBG((si->dbg, LEVEL_1, "\tArchitecture has %d free registers in class %s\n", free, si->cls->name));
4073 walker_reload_mover(ir_node * bb, void * data)
4075 spill_ilp_t *si = data;
4078 sched_foreach(bb, tmp) {
4079 if(be_is_Reload(tmp) && has_reg_class(si, tmp)) {
4080 ir_node *reload = tmp;
4083 /* move reload upwards */
4085 int pressure = (int)get_irn_link(reload);
4086 if(pressure < si->n_regs) {
4087 irn = sched_prev(reload);
4088 DBG((si->dbg, LEVEL_5, "regpressure before %+F: %d\n", reload, pressure));
4089 sched_remove(reload);
4090 pressure = (int)get_irn_link(irn);
4092 while(pressure < si->n_regs) {
4093 if( sched_is_end(irn) ||
4094 (be_is_Reload(irn) && has_reg_class(si, irn)) ||
4095 /* do not move reload before its spill */
4096 (irn == be_get_Reload_mem(reload)) ||
4097 /* do not move before phi */
4100 set_irn_link(irn, INT_TO_PTR(pressure+1));
4101 DBG((si->dbg, LEVEL_5, "new regpressure before %+F: %d\n", irn, pressure+1));
4102 irn = sched_prev(irn);
4104 pressure = (int)get_irn_link(irn);
4107 DBG((si->dbg, LEVEL_3, "putting reload %+F after %+F\n", reload, irn));
4108 sched_put_after(irn, reload);
4115 move_reloads_upward(spill_ilp_t * si)
4117 irg_block_walk_graph(si->chordal_env->irg, walker_reload_mover, NULL, si);
4122 * Walk all irg blocks and check for interfering spills inside of phi classes
4125 luke_meminterferencechecker(ir_node * bb, void * data)
4127 spill_ilp_t *si = (spill_ilp_t*)data;
4130 be_lv_foreach(si->lv, bb, be_lv_state_end | be_lv_state_out | be_lv_state_in, l1) {
4131 ir_node *a = be_lv_get_irn(si->lv, bb, l1);
4133 if(!be_is_Spill(a) && (!is_Phi(a) || get_irn_mode(a) != mode_T)) continue;
4135 /* a is only interesting if it is in my register class and if it is inside a phi class */
4136 if (has_reg_class(si, a) && get_phi_class(a)) {
4137 for(l2=_be_lv_next_irn(si->lv, bb, 0xff, l1+1); l2>=0; l2=_be_lv_next_irn(si->lv, bb, 0xff, l2+1)) {
4138 ir_node *b = be_lv_get_irn(si->lv, bb, l2);
4140 if(!be_is_Spill(b) && (!is_Phi(b) || get_irn_mode(b) != mode_T)) continue;
4142 /* a and b are only interesting if they are in the same phi class */
4143 if(has_reg_class(si, b) && get_phi_class(a) == get_phi_class(b)) {
4144 if(values_interfere_in_block(si, bb, a, b)) {
4145 ir_fprintf(stderr, "$$ Spills interfere in %+F: %+F, %+F \t$$\n", bb, a, b);
4154 verify_phiclasses(spill_ilp_t * si)
4156 /* analyze phi classes */
4157 phi_class_compute(si->chordal_env->irg);
4159 DBG((si->dbg, LEVEL_2, "\t calling memory interference checker\n"));
4160 irg_block_walk_graph(si->chordal_env->irg, luke_meminterferencechecker, NULL, si);
4164 walker_spillslotassigner(ir_node * irn, void * data)
4168 if(!be_is_Spill(irn)) return;
4170 /* set spill context to phi class if it has one ;) */
4173 // Matze: not needed anymore
4174 cls = get_phi_class(irn);
4176 be_set_Spill_context(irn, cls);
4178 be_set_Spill_context(irn, irn);
4184 assign_spillslots(spill_ilp_t * si)
4186 DBG((si->dbg, LEVEL_2, "\t calling spill slot assigner\n"));
4187 irg_walk_graph(si->chordal_env->irg, walker_spillslotassigner, NULL, si);
4191 be_spill_remat(const be_chordal_env_t * chordal_env)
4194 char problem_name[256];
4195 char dump_suffix[256];
4196 char dump_suffix2[256];
4197 struct obstack obst;
4200 ir_snprintf(problem_name, sizeof(problem_name), "%F_%s", chordal_env->irg, chordal_env->cls->name);
4201 ir_snprintf(dump_suffix, sizeof(dump_suffix), "-%s-remats", chordal_env->cls->name);
4202 ir_snprintf(dump_suffix2, sizeof(dump_suffix2), "-%s-pressure", chordal_env->cls->name);
4204 FIRM_DBG_REGISTER(si.dbg, "firm.be.ra.spillremat");
4205 DBG((si.dbg, LEVEL_1, "\n\n\t\t===== Processing %s =====\n\n", problem_name));
4207 if(opt_verify & VERIFY_DOMINANCE)
4208 be_check_dominance(chordal_env->irg);
4210 obstack_init(&obst);
4211 si.chordal_env = chordal_env;
4213 si.cls = chordal_env->cls;
4214 si.lpp = new_lpp(problem_name, lpp_minimize);
4215 si.remat_info = new_set(cmp_remat_info, 4096);
4216 si.interferences = new_set(cmp_interference, 32);
4217 si.memoperands = new_set(cmp_memoperands, 128);
4218 si.all_possible_remats = pset_new_ptr_default();
4219 si.spills = pset_new_ptr_default();
4220 si.inverse_ops = pset_new_ptr_default();
4221 si.lv = chordal_env->lv;
4223 si.n_regs = get_n_regs(&si);
4225 set_irg_link(chordal_env->irg, &si);
4226 compute_doms(chordal_env->irg);
4228 /* compute phi classes */
4229 // phi_class_compute(chordal_env->irg);
4231 be_analyze_regpressure(chordal_env, "-pre");
4234 /* collect remats */
4235 DBG((si.dbg, LEVEL_1, "Collecting remats\n"));
4236 irg_walk_graph(chordal_env->irg, walker_remat_collector, NULL, &si);
4239 /* insert possible remats */
4240 DBG((si.dbg, LEVEL_1, "Inserting possible remats\n"));
4241 irg_block_walk_graph(chordal_env->irg, walker_remat_insertor, NULL, &si);
4242 DBG((si.dbg, LEVEL_2, " -> inserted %d possible remats\n", pset_count(si.all_possible_remats)));
4244 if(opt_keep_alive & KEEPALIVE_REMATS) {
4245 DBG((si.dbg, LEVEL_1, "Connecting remats with keep and dumping\n"));
4246 connect_all_remats_with_keep(&si);
4247 /* dump graph with inserted remats */
4248 dump_graph_with_remats(chordal_env->irg, dump_suffix);
4251 /* insert copies for phi arguments not in my regclass */
4252 irg_walk_graph(chordal_env->irg, walker_regclass_copy_insertor, NULL, &si);
4254 /* recompute liveness */
4255 DBG((si.dbg, LEVEL_1, "Recomputing liveness\n"));
4256 be_liveness_recompute(si.lv);
4260 DBG((si.dbg, LEVEL_1, "\tBuilding ILP\n"));
4261 DBG((si.dbg, LEVEL_2, "\t endwalker\n"));
4262 irg_block_walk_graph(chordal_env->irg, luke_endwalker, NULL, &si);
4264 DBG((si.dbg, LEVEL_2, "\t blockwalker\n"));
4265 irg_block_walk_graph(chordal_env->irg, luke_blockwalker, NULL, &si);
4268 DBG((si.dbg, LEVEL_2, "\t memcopyhandler\n"));
4269 memcopyhandler(&si);
4272 if(opt_dump_flags & DUMP_PROBLEM) {
4274 ir_snprintf(buf, sizeof(buf), "%s-spillremat.ilp", problem_name);
4275 if ((f = fopen(buf, "wt")) != NULL) {
4276 lpp_dump_plain(si.lpp, f);
4281 if(opt_dump_flags & DUMP_MPS) {
4284 ir_snprintf(buf, sizeof(buf), "%s-spillremat.mps", problem_name);
4285 if((f = fopen(buf, "wt")) != NULL) {
4286 mps_write_mps(si.lpp, s_mps_fixed, f);
4290 ir_snprintf(buf, sizeof(buf), "%s-spillremat.mst", problem_name);
4291 if((f = fopen(buf, "wt")) != NULL) {
4292 mps_write_mst(si.lpp, s_mps_fixed, f);
4297 lpp_check_startvals(si.lpp);
4300 DBG((si.dbg, LEVEL_1, "\tSolving %s (%d variables, %d constraints)\n", problem_name, si.lpp->var_next, si.lpp->cst_next));
4301 lpp_set_time_limit(si.lpp, opt_timeout);
4304 lpp_set_log(si.lpp, stdout);
4307 lpp_solve_cplex(si.lpp);
4309 lpp_solve_net(si.lpp, LPP_SERVER, LPP_SOLVER);
4311 assert(lpp_is_sol_valid(si.lpp)
4312 && "solution of ILP must be valid");
4314 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));
4316 if(opt_dump_flags & DUMP_SOLUTION) {
4320 ir_snprintf(buf, sizeof(buf), "%s-spillremat.sol", problem_name);
4321 if ((f = fopen(buf, "wt")) != NULL) {
4323 for (i = 0; i < si.lpp->var_next; ++i) {
4324 lpp_name_t *name = si.lpp->vars[i];
4325 fprintf(f, "%20s %4d %10f\n", name->name, name->nr, name->value);
4331 writeback_results(&si);
4335 kill_all_unused_values_in_schedule(&si);
4337 if(opt_keep_alive & (KEEPALIVE_SPILLS | KEEPALIVE_RELOADS))
4338 be_dump(chordal_env->irg, "-spills-placed", dump_ir_block_graph);
4340 // move reloads upwards
4341 be_liveness_recompute(si.lv);
4342 irg_block_walk_graph(chordal_env->irg, walker_pressure_annotator, NULL, &si);
4343 move_reloads_upward(&si);
4346 verify_phiclasses(&si);
4347 assign_spillslots(&si);
4350 irg_block_walk_graph(chordal_env->irg, walker_pressure_annotator, NULL, &si);
4352 dump_pressure_graph(&si, dump_suffix2);
4354 be_analyze_regpressure(chordal_env, "-post");
4356 if(opt_verify & VERIFY_DOMINANCE)
4357 be_check_dominance(chordal_env->irg);
4359 free_dom(chordal_env->irg);
4360 del_set(si.interferences);
4361 del_pset(si.inverse_ops);
4362 del_pset(si.all_possible_remats);
4363 del_set(si.memoperands);
4364 del_pset(si.spills);
4366 obstack_free(&obst, NULL);
4367 DBG((si.dbg, LEVEL_1, "\tdone.\n"));
4370 #else /* WITH_ILP */
4373 only_that_you_can_compile_without_WITH_ILP_defined(void)
4377 #endif /* WITH_ILP */