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
36 #include "irbackedge_t.h"
40 #include <lpp/lpp_net.h>
41 #include <lpp/lpp_cplex.h>
45 #include "besched_t.h"
51 #include "bespillremat.h"
53 #include "bepressurestat.h"
54 #include "beprofile.h"
55 #include "bespilloptions.h"
57 #include "bechordal_t.h"
59 #include <libcore/lc_opts.h>
60 #include <libcore/lc_opts_enum.h>
62 #define DUMP_PROBLEM 1
64 #define DUMP_SOLUTION 4
66 #define DUMP_PRESSURE 16
68 #define KEEPALIVE_REMATS 1
69 #define KEEPALIVE_SPILLS 2
70 #define KEEPALIVE_RELOADS 4
72 #define VERIFY_MEMINTERF 1
73 #define VERIFY_DOMINANCE 2
76 #define REMATS_BRIGGS 1
77 #define REMATS_NOINVERSE 2
80 static int opt_dump_flags = 0;
81 static int opt_log = 0;
82 static int opt_keep_alive = 0;
83 static int opt_goodwin = 1;
84 static int opt_memcopies = 1;
85 static int opt_memoperands = 1;
86 static int opt_verify = VERIFY_MEMINTERF;
87 static int opt_remats = REMATS_ALL;
88 static int opt_repair_schedule = 0;
89 static int opt_no_enlarge_liveness = 0;
90 static int opt_remat_while_live = 1;
91 static int opt_timeout = 300;
92 static double opt_cost_reload = 8.0;
93 static double opt_cost_memoperand = 7.0;
94 static double opt_cost_spill = 15.0;
95 static double opt_cost_remat = 1.0;
98 static const lc_opt_enum_mask_items_t dump_items[] = {
99 { "problem", DUMP_PROBLEM },
101 { "solution", DUMP_SOLUTION },
102 { "stats", DUMP_STATS },
103 { "pressure", DUMP_PRESSURE },
107 static lc_opt_enum_mask_var_t dump_var = {
108 &opt_dump_flags, dump_items
111 static const lc_opt_enum_mask_items_t keepalive_items[] = {
112 { "remats", KEEPALIVE_REMATS },
113 { "spills", KEEPALIVE_SPILLS },
114 { "reloads", KEEPALIVE_RELOADS },
118 static lc_opt_enum_mask_var_t keep_alive_var = {
119 &opt_keep_alive, keepalive_items
122 static const lc_opt_enum_mask_items_t remats_items[] = {
123 { "none", REMATS_NONE },
124 { "briggs", REMATS_BRIGGS },
125 { "noinverse", REMATS_NOINVERSE },
126 { "all", REMATS_ALL },
130 static lc_opt_enum_mask_var_t remats_var = {
131 &opt_remats, remats_items
134 static const lc_opt_table_entry_t options[] = {
135 LC_OPT_ENT_ENUM_MASK("keepalive", "keep alive inserted nodes", &keep_alive_var),
137 LC_OPT_ENT_BOOL ("goodwin", "activate goodwin reduction", &opt_goodwin),
138 LC_OPT_ENT_BOOL ("memcopies", "activate memcopy handling", &opt_memcopies),
139 LC_OPT_ENT_BOOL ("memoperands", "activate memoperands", &opt_memoperands),
140 LC_OPT_ENT_ENUM_INT ("remats", "type of remats to insert", &remats_var),
141 LC_OPT_ENT_BOOL ("repair_schedule", "repair the schedule by rematting once used nodes",&opt_repair_schedule),
142 LC_OPT_ENT_BOOL ("no_enlage_liveness", "do not enlarge liveness of operands of remats",&opt_no_enlarge_liveness),
143 LC_OPT_ENT_BOOL ("remat_while_live", "only remat where rematted value was live", &opt_remat_while_live),
145 LC_OPT_ENT_ENUM_MASK("dump", "dump problem, solution or statistical data", &dump_var),
146 LC_OPT_ENT_BOOL ("log", "activate the lpp log", &opt_log),
147 LC_OPT_ENT_INT ("timeout", "ILP solver timeout", &opt_timeout),
149 LC_OPT_ENT_DBL ("cost_reload", "cost of a reload", &opt_cost_reload),
150 LC_OPT_ENT_DBL ("cost_memoperand", "cost of a memory operand", &opt_cost_memoperand),
151 LC_OPT_ENT_DBL ("cost_spill", "cost of a spill instruction", &opt_cost_spill),
152 LC_OPT_ENT_DBL ("cost_remat", "cost of a rematerialization", &opt_cost_remat),
156 //#define EXECFREQ_LOOPDEPH /* compute execution frequency from loop depth only */
157 //#define SCHEDULE_PHIM /* insert phim nodes into schedule */
160 //#define SOLVE_LOCAL
161 #define LPP_SERVER "i44pc52"
162 #define LPP_SOLVER "cplex"
165 #define MAX_PATHS INT_MAX
168 typedef struct _spill_ilp_t {
169 const arch_register_class_t *cls;
174 struct obstack *obst;
176 pset *all_possible_remats;
179 set *values; /**< for collecting all definitions of values before running ssa-construction */
185 #ifndef SCHEDULE_PHIM
188 DEBUG_ONLY(firm_dbg_module_t * dbg);
191 typedef int ilp_var_t;
192 typedef int ilp_cst_t;
194 typedef struct _spill_bb_t {
199 typedef struct _remat_t {
200 const ir_node *op; /**< for copy_irn */
201 const ir_node *value; /**< the value which is being recomputed by this remat */
202 const ir_node *proj; /**< not NULL if the above op produces a tuple */
203 int cost; /**< cost of this remat */
204 int inverse; /**< nonzero if this is an inverse remat */
208 * Data to be attached to each IR node. For remats this contains the ilp_var
209 * for this remat and for normal ops this contains the ilp_vars for
210 * reloading each operand
212 typedef struct _op_t {
217 const remat_t *remat; /** the remat this op belongs to */
218 int pre; /** 1, if this is a pressure-increasing remat */
222 ir_node *op; /** the operation this live range belongs to */
231 typedef struct _defs_t {
232 const ir_node *value;
233 ir_node *spills; /**< points to the first spill for this value (linked by link field) */
234 ir_node *remats; /**< points to the first definition for this value (linked by link field) */
237 typedef struct _remat_info_t {
238 const ir_node *irn; /**< the irn to which these remats belong */
239 pset *remats; /**< possible remats for this value */
240 pset *remats_by_operand; /**< remats with this value as operand */
243 typedef struct _keyval_t {
248 typedef struct _spill_t {
257 typedef struct _memoperand_t {
258 ir_node *irn; /**< the irn */
259 unsigned int pos; /**< the position of the argument */
260 ilp_var_t ilp; /**< the ilp var for this memory operand */
264 has_reg_class(const spill_ilp_t * si, const ir_node * irn)
266 return arch_irn_consider_in_reg_alloc(si->birg->main_env->arch_env,
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 if(be_profile_has_data())
420 return ((double)be_profile_get_block_execcount(get_block(irn))) + FUDGE;
422 #ifndef EXECFREQ_LOOPDEPH
423 return get_block_execfreq(si->birg->exec_freq, get_block(irn)) + FUDGE;
426 return exp(get_loop_depth(get_irn_loop(irn)) * log(10)) + FUDGE;
428 return exp(get_loop_depth(get_irn_loop(get_nodes_block(irn))) * log(10)) + FUDGE;
433 get_cost(const spill_ilp_t * si, const ir_node * irn)
435 if(be_is_Spill(irn)) {
436 return opt_cost_spill;
437 } else if(be_is_Reload(irn)){
438 return opt_cost_reload;
440 return arch_get_op_estimated_cost(si->birg->main_env->arch_env, irn);
445 * Checks, whether node and its operands have suitable reg classes
448 is_rematerializable(const spill_ilp_t * si, const ir_node * irn)
451 const arch_env_t *arch_env = si->birg->main_env->arch_env;
452 int remat = (arch_irn_get_flags(arch_env, irn) & arch_irn_flags_rematerializable) != 0;
456 ir_fprintf(stderr, " Node %+F is not rematerializable\n", irn);
459 for (n = get_irn_arity(irn)-1; n>=0 && remat; --n) {
460 ir_node *op = get_irn_n(irn, n);
461 remat &= has_reg_class(si, op) || arch_irn_get_flags(arch_env, op) & arch_irn_flags_ignore || (get_irn_op(op) == op_NoMem);
464 // ir_fprintf(stderr, " Argument %d (%+F) of Node %+F has wrong regclass\n", i, op, irn);
471 * Try to create a remat from @p op with destination value @p dest_value
473 static INLINE remat_t *
474 get_remat_from_op(spill_ilp_t * si, const ir_node * dest_value, const ir_node * op)
476 remat_t *remat = NULL;
478 // if(!mode_is_datab(get_irn_mode(dest_value)))
481 if(dest_value == op) {
482 const ir_node *proj = NULL;
484 if(is_Proj(dest_value)) {
485 op = get_Proj_pred(op);
489 if(!is_rematerializable(si, op))
492 remat = obstack_alloc(si->obst, sizeof(*remat));
494 remat->cost = (int)get_cost(si, op);
495 remat->value = dest_value;
499 arch_inverse_t inverse;
502 /* get the index of the operand we want to retrieve by the inverse op */
503 for (n = get_irn_arity(op)-1; n>=0; --n) {
504 ir_node *arg = get_irn_n(op, n);
506 if(arg == dest_value) break;
510 DBG((si->dbg, LEVEL_5, "\t requesting inverse op for argument %d of op %+F\n", n, op));
512 /* else ask the backend to give an inverse op */
513 if(arch_get_inverse(si->birg->main_env->arch_env, op, n, &inverse, si->obst)) {
516 DBG((si->dbg, LEVEL_4, "\t backend gave us an inverse op with %d nodes and cost %d\n", inverse.n, inverse.costs));
518 assert(inverse.n > 0 && "inverse op should have at least one node");
520 for(i=inverse.n-1; i>=0; --i) {
521 pset_insert_ptr(si->inverse_ops, inverse.nodes[i]);
525 remat = obstack_alloc(si->obst, sizeof(*remat));
526 remat->op = inverse.nodes[0];
527 remat->cost = inverse.costs;
528 remat->value = dest_value;
529 remat->proj = (inverse.n==2)?inverse.nodes[1]:NULL;
532 // Matze: commented this out, this doesn't seem to be true if
533 // the inverse is a simple operation with only 1 result...
534 //assert(is_Proj(remat->proj));
536 assert(0 && "I can not handle remats with more than 2 nodes");
543 DBG((si->dbg, LEVEL_3, "\t >Found remat %+F for %+F from %+F with %+F\n", remat->op, dest_value, op, remat->proj));
545 DBG((si->dbg, LEVEL_3, "\t >Found remat %+F for %+F from %+F\n", remat->op, dest_value, op));
553 add_remat(const spill_ilp_t * si, const remat_t * remat)
555 remat_info_t *remat_info,
560 assert(remat->value);
562 query.irn = remat->value;
564 query.remats_by_operand = NULL;
565 remat_info = set_insert(si->remat_info, &query, sizeof(query), HASH_PTR(remat->value));
567 if(remat_info->remats == NULL) {
568 remat_info->remats = new_pset(cmp_remat, 4096);
570 pset_insert(remat_info->remats, remat, HASH_PTR(remat->op));
572 /* insert the remat into the remats_be_operand set of each argument of the remat op */
573 for (n = get_irn_arity(remat->op)-1; n>=0; --n) {
574 ir_node *arg = get_irn_n(remat->op, n);
578 query.remats_by_operand = NULL;
579 remat_info = set_insert(si->remat_info, &query, sizeof(query), HASH_PTR(arg));
581 if(remat_info->remats_by_operand == NULL) {
582 remat_info->remats_by_operand = new_pset(cmp_remat, 4096);
584 pset_insert(remat_info->remats_by_operand, remat, HASH_PTR(remat->op));
589 get_irn_n_nonremat_edges(const spill_ilp_t * si, const ir_node * irn)
591 const ir_edge_t *edge = get_irn_out_edge_first(irn);
595 if(!pset_find_ptr(si->inverse_ops, edge->src)) {
598 edge = get_irn_out_edge_next(irn, edge);
605 get_irn_n_nonignore_args(const spill_ilp_t * si, const ir_node * irn)
611 irn = get_Proj_pred(irn);
613 for(n=get_irn_arity(irn)-1; n>=0; --n) {
614 const ir_node *arg = get_irn_n(irn, n);
616 if(has_reg_class(si, arg)) ++ret;
623 get_remats_from_op(spill_ilp_t * si, const ir_node * op)
628 if( has_reg_class(si, op)
629 && (opt_repair_schedule || get_irn_n_nonremat_edges(si, op) > 1)
630 && (opt_remats != REMATS_BRIGGS || get_irn_n_nonignore_args(si, op) == 0)
632 remat = get_remat_from_op(si, op, op);
634 add_remat(si, remat);
638 if(opt_remats == REMATS_ALL) {
639 /* repeat the whole stuff for each remat retrieved by get_remat_from_op(op, arg)
641 for (n = get_irn_arity(op)-1; n>=0; --n) {
642 ir_node *arg = get_irn_n(op, n);
644 if(has_reg_class(si, arg)) {
645 /* try to get an inverse remat */
646 remat = get_remat_from_op(si, arg, op);
648 add_remat(si, remat);
656 value_is_defined_before(const spill_ilp_t * si, const ir_node * pos, const ir_node * val)
659 ir_node *def_block = get_nodes_block(val);
665 /* if pos is at end of a basic block */
667 ret = (pos == def_block || block_dominates(def_block, pos));
668 // ir_fprintf(stderr, "(def(bb)=%d) ", ret);
672 /* else if this is a normal operation */
673 block = get_nodes_block(pos);
674 if(block == def_block) {
675 if(!sched_is_scheduled(val)) return 1;
677 ret = sched_comes_after(val, pos);
678 // ir_fprintf(stderr, "(def(same block)=%d) ",ret);
682 ret = block_dominates(def_block, block);
683 // ir_fprintf(stderr, "(def(other block)=%d) ", ret);
687 static INLINE ir_node *
688 sched_block_last_noncf(const spill_ilp_t * si, const ir_node * bb)
690 return sched_skip((ir_node*)bb, 0, sched_skip_cf_predicator, (void *) si->birg->main_env->arch_env);
694 * Returns first non-Phi node of block @p bb
696 static INLINE ir_node *
697 sched_block_first_nonphi(const ir_node * bb)
699 return sched_skip((ir_node*)bb, 1, sched_skip_phi_predicator, NULL);
703 sched_skip_proj_predicator(const ir_node * irn, void * data)
705 return (is_Proj(irn));
708 static INLINE ir_node *
709 sched_next_nonproj(const ir_node * irn, int forward)
711 return sched_skip((ir_node*)irn, forward, sched_skip_proj_predicator, NULL);
715 * Returns next operation node (non-Proj) after @p irn
716 * or the basic block of this node
718 static INLINE ir_node *
719 sched_next_op(const ir_node * irn)
721 ir_node *next = sched_next(irn);
726 return sched_next_nonproj(next, 1);
730 * Returns previous operation node (non-Proj) before @p irn
731 * or the basic block of this node
733 static INLINE ir_node *
734 sched_prev_op(const ir_node * irn)
736 ir_node *prev = sched_prev(irn);
741 return sched_next_nonproj(prev, 0);
745 sched_put_after(ir_node * insert, ir_node * irn)
747 if(is_Block(insert)) {
748 insert = sched_block_first_nonphi(insert);
750 insert = sched_next_op(insert);
753 sched_add_before(insert, irn);
757 sched_put_before(const spill_ilp_t * si, ir_node * insert, ir_node * irn)
759 if(is_Block(insert)) {
760 insert = sched_block_last_noncf(si, insert);
762 insert = sched_next_nonproj(insert, 0);
763 insert = sched_prev(insert);
766 sched_add_after(insert, irn);
770 next_post_remat(const ir_node * irn)
776 next = sched_block_first_nonphi(irn);
778 next = sched_next_op(irn);
781 if(sched_is_end(next))
784 op = get_irn_link(next);
785 if(op->is_remat && !op->attr.remat.pre) {
794 next_pre_remat(const spill_ilp_t * si, const ir_node * irn)
800 ret = sched_block_last_noncf(si, irn);
801 ret = sched_next(ret);
802 ret = sched_prev_op(ret);
804 ret = sched_prev_op(irn);
807 if(sched_is_end(ret) || is_Phi(ret))
810 op = (op_t*)get_irn_link(ret);
811 if(op->is_remat && op->attr.remat.pre) {
819 * Tells you whether a @p remat can be placed before the irn @p pos
822 can_remat_before(const spill_ilp_t * si, const remat_t * remat, const ir_node * pos, const pset * live)
824 const ir_node *op = remat->op;
830 prev = sched_block_last_noncf(si, pos);
831 prev = sched_next_nonproj(prev, 0);
833 prev = sched_prev_op(pos);
835 /* do not remat if the rematted value is defined immediately before this op */
836 if(prev == remat->op) {
841 /* this should be just fine, the following OP will be using this value, right? */
843 /* only remat AFTER the real definition of a value (?) */
844 if(!value_is_defined_before(si, pos, remat->value)) {
845 // ir_fprintf(stderr, "error(not defined)");
850 for(n=get_irn_arity(op)-1; n>=0 && res; --n) {
851 const ir_node *arg = get_irn_n(op, n);
853 if(opt_no_enlarge_liveness) {
854 if(has_reg_class(si, arg) && live) {
855 res &= pset_find_ptr((pset*)live, arg)?1:0;
857 res &= value_is_defined_before(si, pos, arg);
860 res &= value_is_defined_before(si, pos, arg);
868 * Tells you whether a @p remat can be placed after the irn @p pos
871 can_remat_after(const spill_ilp_t * si, const remat_t * remat, const ir_node * pos, const pset * live)
874 pos = sched_block_first_nonphi(pos);
876 pos = sched_next_op(pos);
879 /* only remat AFTER the real definition of a value (?) */
880 if(!value_is_defined_before(si, pos, remat->value)) {
884 return can_remat_before(si, remat, pos, live);
888 * Collect potetially rematerializable OPs
891 walker_remat_collector(ir_node * irn, void * data)
893 spill_ilp_t *si = data;
895 if(!is_Block(irn) && !is_Phi(irn)) {
896 DBG((si->dbg, LEVEL_4, "\t Processing %+F\n", irn));
897 get_remats_from_op(si, irn);
902 * Inserts a copy of @p irn before @p pos
905 insert_copy_before(const spill_ilp_t * si, const ir_node * irn, ir_node * pos)
910 bb = is_Block(pos)?pos:get_nodes_block(pos);
911 copy = exact_copy(irn);
913 set_phi_class(si->pc, copy, NULL);
914 set_nodes_block(copy, bb);
915 sched_put_before(si, pos, copy);
921 * Inserts a copy of @p irn after @p pos
924 insert_copy_after(const spill_ilp_t * si, const ir_node * irn, ir_node * pos)
929 bb = is_Block(pos)?pos:get_nodes_block(pos);
930 copy = exact_copy(irn);
932 set_phi_class(si->pc, copy, NULL);
933 set_nodes_block(copy, bb);
934 sched_put_after(pos, copy);
940 insert_remat_after(spill_ilp_t * si, const remat_t * remat, ir_node * pos, const pset * live)
944 if(can_remat_after(si, remat, pos, live)) {
949 DBG((si->dbg, LEVEL_3, "\t >inserting remat2 %+F\n", remat->op));
951 copy = insert_copy_after(si, remat->op, pos);
953 ir_snprintf(buf, sizeof(buf), "remat2_%N_%N", copy, pos);
954 op = obstack_alloc(si->obst, sizeof(*op));
956 op->attr.remat.remat = remat;
957 op->attr.remat.pre = 0;
958 op->attr.remat.ilp = lpp_add_var_default(si->lpp, buf, lpp_binary, remat->cost*execution_frequency(si, pos), 0.0);
960 set_irn_link(copy, op);
961 pset_insert_ptr(si->all_possible_remats, copy);
963 proj_copy = insert_copy_after(si, remat->proj, copy);
964 set_irn_n(proj_copy, 0, copy);
965 set_irn_link(proj_copy, op);
966 pset_insert_ptr(si->all_possible_remats, proj_copy);
978 insert_remat_before(spill_ilp_t * si, const remat_t * remat, ir_node * pos, const pset * live)
982 if(can_remat_before(si, remat, pos, live)) {
987 DBG((si->dbg, LEVEL_3, "\t >inserting remat %+F\n", remat->op));
989 copy = insert_copy_before(si, remat->op, pos);
991 ir_snprintf(buf, sizeof(buf), "remat_%N_%N", copy, pos);
992 op = obstack_alloc(si->obst, sizeof(*op));
994 op->attr.remat.remat = remat;
995 op->attr.remat.pre = 1;
996 op->attr.remat.ilp = lpp_add_var_default(si->lpp, buf, lpp_binary, remat->cost*execution_frequency(si, pos), 0.0);
998 set_irn_link(copy, op);
999 pset_insert_ptr(si->all_possible_remats, copy);
1001 proj_copy = insert_copy_after(si, remat->proj, copy);
1002 set_irn_n(proj_copy, 0, copy);
1003 set_irn_link(proj_copy, op);
1004 pset_insert_ptr(si->all_possible_remats, proj_copy);
1016 get_block_n_succs(const ir_node *block) {
1017 const ir_edge_t *edge;
1019 assert(edges_activated(current_ir_graph));
1021 edge = get_block_succ_first(block);
1025 edge = get_block_succ_next(block, edge);
1026 return edge ? 2 : 1;
1030 is_start_block(const ir_node * bb)
1032 return get_irg_start_block(get_irn_irg(bb)) == bb;
1036 is_merge_edge(const ir_node * bb)
1038 if(is_start_block(bb))
1042 return get_block_n_succs(bb) == 1;
1048 is_diverge_edge(const ir_node * bb)
1050 if(is_start_block(bb))
1054 return get_Block_n_cfgpreds(bb) == 1;
1060 get_live_end(spill_ilp_t * si, ir_node * bb, pset * live)
1065 be_lv_foreach(si->lv, bb, be_lv_state_end, i) {
1066 irn = be_lv_get_irn(si->lv, bb, i);
1068 if (has_reg_class(si, irn) && !pset_find_ptr(si->all_possible_remats, irn)) {
1069 pset_insert_ptr(live, irn);
1073 irn = sched_last(bb);
1075 /* all values eaten by control flow operations are also live until the end of the block */
1076 sched_foreach_reverse(bb, irn) {
1079 if(!sched_skip_cf_predicator(irn, si->birg->main_env->arch_env)) break;
1081 for(i=get_irn_arity(irn)-1; i>=0; --i) {
1082 ir_node *arg = get_irn_n(irn,i);
1084 if(has_reg_class(si, arg)) {
1085 pset_insert_ptr(live, arg);
1090 * find values that are used by remats at end of block
1091 * and insert them into live set
1093 foreach_pre_remat(si, bb, irn) {
1096 for (n=get_irn_arity(irn)-1; n>=0; --n) {
1097 ir_node *remat_arg = get_irn_n(irn, n);
1099 if(!has_reg_class(si, remat_arg)) continue;
1101 /* if value is becoming live through use by remat */
1102 if(!pset_find_ptr(live, remat_arg)) {
1103 DBG((si->dbg, LEVEL_4, " value %+F becoming live through use by remat at end of block %+F\n", remat_arg, irn));
1105 pset_insert_ptr(live, remat_arg);
1112 walker_regclass_copy_insertor(ir_node * irn, void * data)
1114 spill_ilp_t *si = data;
1116 if(is_Phi(irn) && has_reg_class(si, irn)) {
1119 for(n=get_irn_arity(irn)-1; n>=0; --n) {
1120 ir_node *phi_arg = get_irn_n(irn, n);
1121 ir_node *bb = get_Block_cfgpred_block(get_nodes_block(irn), n);
1123 if(!has_reg_class(si, phi_arg)) {
1124 ir_node *copy = be_new_Copy(si->cls, si->birg->irg, bb, phi_arg);
1125 ir_node *pos = sched_block_last_noncf(si, bb);
1126 op_t *op = obstack_alloc(si->obst, sizeof(*op));
1128 DBG((si->dbg, LEVEL_2, "\t copy to my regclass for arg %+F of %+F\n", phi_arg, irn));
1129 sched_add_after(pos, copy);
1130 set_irn_n(irn, n, copy);
1133 op->attr.live_range.args.reloads = NULL;
1134 op->attr.live_range.ilp = ILP_UNDEF;
1135 set_irn_link(copy, op);
1142 * Insert (so far unused) remats into the irg to
1143 * recompute the potential liveness of all values
1146 walker_remat_insertor(ir_node * bb, void * data)
1148 spill_ilp_t *si = data;
1155 /* skip start block, no remats to do there */
1156 if(is_start_block(bb)) return;
1158 DBG((si->dbg, LEVEL_3, "\t Entering %+F\n\n", bb));
1160 live = pset_new_ptr_default();
1161 be_lv_foreach(si->lv, bb, be_lv_state_end, i) {
1162 ir_node *value = be_lv_get_irn(si->lv, bb, i);
1164 /* add remats at end of block */
1165 if (has_reg_class(si, value)) {
1166 pset_insert_ptr(live, value);
1170 irn = sched_last(bb);
1171 while(!sched_is_end(irn)) {
1177 next = sched_prev(irn);
1179 /* delete defined value from live set */
1180 if(has_reg_class(si, irn)) {
1181 pset_remove_ptr(live, irn);
1184 if(is_Phi(irn) || is_Proj(irn)) {
1189 args = pset_new_ptr_default();
1190 used = pset_new_ptr_default();
1192 /* collect arguments of op and set args of op already live in epilog */
1193 for (n = get_irn_arity(irn)-1; n>=0; --n) {
1194 ir_node *arg = get_irn_n(irn, n);
1196 pset_insert_ptr(args, arg);
1197 if(has_reg_class(si, arg)) {
1198 pset_insert_ptr(live, arg);
1199 pset_insert_ptr(used, arg);
1203 /* insert all possible remats before irn */
1204 pset_foreach(args, arg) {
1205 remat_info_t *remat_info,
1208 /* continue if the operand has the wrong reg class */
1209 if(!has_reg_class(si, arg))
1213 query.remats = NULL;
1214 query.remats_by_operand = NULL;
1215 remat_info = set_find(si->remat_info, &query, sizeof(query), HASH_PTR(arg));
1221 if(remat_info->remats) {
1222 pset_foreach(remat_info->remats, remat) {
1223 ir_node *remat_irn = NULL;
1225 DBG((si->dbg, LEVEL_4, "\t considering remat %+F for arg %+F\n", remat->op, arg));
1226 remat_irn = insert_remat_before(si, remat, irn, live);
1229 for(n=get_irn_arity(remat_irn)-1; n>=0; --n) {
1230 ir_node *remat_arg = get_irn_n(remat_irn, n);
1232 /* collect args of remats which are not args of op */
1233 if(has_reg_class(si, remat_arg) && !pset_find_ptr(args, remat_arg)) {
1234 pset_insert_ptr(used, remat_arg);
1242 /* do not place post remats after jumps */
1243 if(sched_skip_cf_predicator(irn, si->birg->main_env->arch_env)) {
1249 /* insert all possible remats after irn */
1250 post_remats = pset_new_ptr_default();
1251 pset_foreach(used, arg) {
1252 remat_info_t *remat_info,
1255 /* continue if the operand has the wrong reg class */
1256 if(!has_reg_class(si, arg))
1260 query.remats = NULL;
1261 query.remats_by_operand = NULL;
1262 remat_info = set_find(si->remat_info, &query, sizeof(query), HASH_PTR(arg));
1268 if(remat_info->remats_by_operand) {
1269 pset_foreach(remat_info->remats_by_operand, remat) {
1270 /* do not insert remats producing the same value as one of the operands */
1271 if(!pset_find_ptr(args, remat->value)) {
1272 DBG((si->dbg, LEVEL_4, "\t considering remat %+F with arg %+F\n", remat->op, arg));
1274 /* only remat values that can be used by real ops */
1275 if(!opt_remat_while_live || pset_find_ptr(live, remat->value)) {
1276 pset_insert_ptr(post_remats, remat);
1282 pset_foreach(post_remats, remat) {
1283 insert_remat_after(si, remat, irn, live);
1285 del_pset(post_remats);
1292 /* add remats at end if successor has multiple predecessors */
1293 if(is_merge_edge(bb)) {
1294 pset *live_out = pset_new_ptr_default();
1297 get_live_end(si, bb, live_out);
1299 /* add remats at end of block */
1300 pset_foreach(live_out, value) {
1301 remat_info_t *remat_info,
1305 query.remats = NULL;
1306 query.remats_by_operand = NULL;
1307 remat_info = set_find(si->remat_info, &query, sizeof(query), HASH_PTR(value));
1309 if(remat_info && remat_info->remats) {
1310 pset_foreach(remat_info->remats, remat) {
1311 DBG((si->dbg, LEVEL_4, "\t considering remat %+F at end of block %+F\n", remat->op, bb));
1313 insert_remat_before(si, remat, bb, live_out);
1320 if(is_diverge_edge(bb)) {
1321 pset *live_in = pset_new_ptr_default();
1324 be_lv_foreach(si->lv, bb, be_lv_state_in, i) {
1325 value = be_lv_get_irn(si->lv, bb, i);
1327 if(has_reg_class(si, value)) {
1328 pset_insert_ptr(live_in, value);
1331 /* add phis to live_in */
1332 sched_foreach(bb, value) {
1333 if(!is_Phi(value)) break;
1335 if(has_reg_class(si, value)) {
1336 pset_insert_ptr(live_in, value);
1340 /* add remat2s at beginning of block */
1341 post_remats = pset_new_ptr_default();
1342 pset_foreach(live_in, value) {
1343 remat_info_t *remat_info,
1347 query.remats = NULL;
1348 query.remats_by_operand = NULL;
1349 remat_info = set_find(si->remat_info, &query, sizeof(query), HASH_PTR(value));
1351 if(remat_info && remat_info->remats_by_operand) {
1352 pset_foreach(remat_info->remats_by_operand, remat) {
1353 DBG((si->dbg, LEVEL_4, "\t considering remat2 %+F at beginning of block %+F\n", remat->op, bb));
1355 /* put the remat here if all its args are available and result is still live */
1356 if(!opt_remat_while_live || pset_find_ptr(live_in, remat->value)) {
1357 pset_insert_ptr(post_remats, remat);
1362 pset_foreach(post_remats, remat) {
1363 insert_remat_after(si, remat, bb, live_in);
1365 del_pset(post_remats);
1371 can_be_copied(const ir_node * bb, const ir_node * irn)
1373 const ir_edge_t *edge = get_block_succ_first(bb);
1374 const ir_node *next_bb = edge->src;
1375 int pos = edge->pos;
1378 assert(is_merge_edge(bb));
1380 sched_foreach(next_bb, phi) {
1381 const ir_node *phi_arg;
1383 if(!is_Phi(phi)) break;
1385 phi_arg = get_irn_n(phi, pos);
1387 if(phi_arg == irn) {
1395 * Initialize additional node info
1398 luke_initializer(ir_node * bb, void * data)
1400 spill_ilp_t *si = (spill_ilp_t*)data;
1401 spill_bb_t *spill_bb;
1404 spill_bb = obstack_alloc(si->obst, sizeof(*spill_bb));
1405 set_irn_link(bb, spill_bb);
1407 sched_foreach(bb, irn) {
1410 op = obstack_alloc(si->obst, sizeof(*op));
1412 op->attr.live_range.ilp = ILP_UNDEF;
1415 op->attr.live_range.args.copies = obstack_alloc(si->obst, sizeof(*op->attr.live_range.args.copies) * get_irn_arity(irn));
1416 memset(op->attr.live_range.args.copies, 0xFF, sizeof(*op->attr.live_range.args.copies) * get_irn_arity(irn));
1418 } else if(!is_Proj(irn)) {
1419 op->attr.live_range.args.reloads = obstack_alloc(si->obst, sizeof(*op->attr.live_range.args.reloads) * get_irn_arity(irn));
1420 memset(op->attr.live_range.args.reloads, 0xFF, sizeof(*op->attr.live_range.args.reloads) * get_irn_arity(irn));
1422 op->attr.live_range.args.reloads = NULL;
1424 set_irn_link(irn, op);
1430 * Preparation of blocks' ends for Luke Blockwalker(tm)(R)
1433 luke_endwalker(ir_node * bb, void * data)
1435 spill_ilp_t *si = (spill_ilp_t*)data;
1441 spill_bb_t *spill_bb = get_irn_link(bb);
1444 live = pset_new_ptr_default();
1445 use_end = pset_new_ptr_default();
1447 be_lv_foreach(si->lv, bb, be_lv_state_end, i) {
1448 irn = be_lv_get_irn(si->lv, bb, i);
1449 if (has_reg_class(si, irn) && !pset_find_ptr(si->all_possible_remats, irn)) {
1450 pset_insert_ptr(live, irn);
1454 * find values that are used by remats at end of block
1455 * and insert them into live set
1457 foreach_pre_remat(si, bb, irn) {
1460 for (n=get_irn_arity(irn)-1; n>=0; --n) {
1461 ir_node *remat_arg = get_irn_n(irn, n);
1463 if(has_reg_class(si, remat_arg)) {
1464 pset_insert_ptr(live, remat_arg);
1469 /* collect values used by cond jumps etc. at bb end (use_end) -> always live */
1470 /* their reg_out must always be set */
1471 sched_foreach_reverse(bb, irn) {
1474 if(!sched_skip_cf_predicator(irn, si->birg->main_env->arch_env)) break;
1476 for (n=get_irn_arity(irn)-1; n>=0; --n) {
1477 ir_node *irn_arg = get_irn_n(irn, n);
1479 if(has_reg_class(si, irn_arg)) {
1480 pset_insert_ptr(use_end, irn_arg);
1485 ir_snprintf(buf, sizeof(buf), "check_end_%N", bb);
1486 //cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, si->n_regs);
1487 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, si->n_regs - pset_count(use_end));
1489 spill_bb->ilp = new_set(cmp_spill, pset_count(live)+pset_count(use_end));
1491 /* if this is a merge edge we can reload at the end of this block */
1492 if(is_merge_edge(bb)) {
1493 spill_bb->reloads = new_set(cmp_keyval, pset_count(live)+pset_count(use_end));
1494 } else if(pset_count(use_end)){
1495 spill_bb->reloads = new_set(cmp_keyval, pset_count(use_end));
1497 spill_bb->reloads = NULL;
1500 pset_foreach(live,irn) {
1504 int default_spilled;
1507 /* handle values used by control flow nodes later separately */
1508 if(pset_find_ptr(use_end, irn)) continue;
1511 spill = set_insert(spill_bb->ilp, &query, sizeof(query), HASH_PTR(irn));
1513 spill_cost = is_Unknown(irn)?0.0001:opt_cost_spill*execution_frequency(si, bb);
1515 ir_snprintf(buf, sizeof(buf), "reg_out_%N_%N", irn, bb);
1516 spill->reg_out = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
1517 lpp_set_factor_fast(si->lpp, cst, spill->reg_out, 1.0);
1519 ir_snprintf(buf, sizeof(buf), "mem_out_%N_%N", irn, bb);
1520 spill->mem_out = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
1522 ir_snprintf(buf, sizeof(buf), "spill_%N_%N", irn, bb);
1523 /* by default spill value right after definition */
1524 default_spilled = be_is_live_in(si->lv, bb, irn) || is_Phi(irn);
1525 spill->spill = lpp_add_var_default(si->lpp, buf, lpp_binary, spill_cost, !default_spilled);
1527 if(is_merge_edge(bb)) {
1531 ir_snprintf(buf, sizeof(buf), "reload_%N_%N", bb, irn);
1532 reload = lpp_add_var_default(si->lpp, buf, lpp_binary, opt_cost_reload*execution_frequency(si, bb), can_be_copied(bb, irn));
1533 set_insert_keyval(spill_bb->reloads, irn, INT_TO_PTR(reload));
1535 /* reload <= mem_out */
1536 rel_cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
1537 lpp_set_factor_fast(si->lpp, rel_cst, reload, 1.0);
1538 lpp_set_factor_fast(si->lpp, rel_cst, spill->mem_out, -1.0);
1541 spill->reg_in = ILP_UNDEF;
1542 spill->mem_in = ILP_UNDEF;
1545 pset_foreach(use_end,irn) {
1549 ilp_cst_t end_use_req,
1552 int default_spilled;
1555 spill = set_insert(spill_bb->ilp, &query, sizeof(query), HASH_PTR(irn));
1557 spill_cost = is_Unknown(irn)?0.0001:opt_cost_spill*execution_frequency(si, bb);
1559 ir_snprintf(buf, sizeof(buf), "reg_out_%N_%N", irn, bb);
1560 spill->reg_out = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
1562 ir_snprintf(buf, sizeof(buf), "mem_out_%N_%N", irn, bb);
1563 spill->mem_out = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
1565 ir_snprintf(buf, sizeof(buf), "spill_%N_%N", irn, bb);
1566 default_spilled = be_is_live_in(si->lv, bb, irn) || is_Phi(irn);
1567 spill->spill = lpp_add_var_default(si->lpp, buf, lpp_binary, spill_cost, !default_spilled);
1569 /* reload for use be control flow op */
1570 ir_snprintf(buf, sizeof(buf), "reload_%N_%N", bb, irn);
1571 reload = lpp_add_var_default(si->lpp, buf, lpp_binary, opt_cost_reload*execution_frequency(si, bb), 1.0);
1572 set_insert_keyval(spill_bb->reloads, irn, INT_TO_PTR(reload));
1574 /* reload <= mem_out */
1575 rel_cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
1576 lpp_set_factor_fast(si->lpp, rel_cst, reload, 1.0);
1577 lpp_set_factor_fast(si->lpp, rel_cst, spill->mem_out, -1.0);
1579 spill->reg_in = ILP_UNDEF;
1580 spill->mem_in = ILP_UNDEF;
1582 ir_snprintf(buf, sizeof(buf), "req_cf_end_%N_%N", irn, bb);
1583 end_use_req = lpp_add_cst_uniq(si->lpp, buf, lpp_equal, 1);
1584 lpp_set_factor_fast(si->lpp, end_use_req, spill->reg_out, 1.0);
1592 * Find a remat of value @p value in the epilog of @p pos
1595 find_post_remat(const ir_node * value, const ir_node * pos)
1597 while((pos = next_post_remat(pos)) != NULL) {
1600 op = get_irn_link(pos);
1601 assert(op->is_remat && !op->attr.remat.pre);
1603 if(op->attr.remat.remat->value == value)
1604 return (ir_node*)pos;
1607 const ir_edge_t *edge;
1608 foreach_out_edge(pos, edge) {
1609 ir_node *proj = get_edge_src_irn(edge);
1610 assert(is_Proj(proj));
1620 add_to_spill_bb(spill_ilp_t * si, ir_node * bb, ir_node * irn)
1622 spill_bb_t *spill_bb = get_irn_link(bb);
1626 int default_spilled;
1629 spill = set_find(spill_bb->ilp, &query, sizeof(query), HASH_PTR(irn));
1631 double spill_cost = is_Unknown(irn)?0.0001:opt_cost_spill*execution_frequency(si, bb);
1633 spill = set_insert(spill_bb->ilp, &query, sizeof(query), HASH_PTR(irn));
1635 spill->reg_out = ILP_UNDEF;
1636 spill->reg_in = ILP_UNDEF;
1637 spill->mem_in = ILP_UNDEF;
1639 ir_snprintf(buf, sizeof(buf), "mem_out_%N_%N", irn, bb);
1640 spill->mem_out = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
1642 ir_snprintf(buf, sizeof(buf), "spill_%N_%N", irn, bb);
1643 default_spilled = be_is_live_in(si->lv, bb, irn) || is_Phi(irn);
1644 spill->spill = lpp_add_var_default(si->lpp, buf, lpp_binary, spill_cost, !default_spilled);
1651 * Inserts ILP-constraints and variables for memory copying before the given position
1654 insert_mem_copy_position(spill_ilp_t * si, pset * live, const ir_node * block)
1656 const ir_node *succ;
1657 const ir_edge_t *edge;
1658 spill_bb_t *spill_bb = get_irn_link(block);
1667 assert(edges_activated(current_ir_graph));
1669 edge = get_block_succ_first(block);
1675 edge = get_block_succ_next(block, edge);
1676 /* next block can only contain phis, if this is a merge edge */
1679 ir_snprintf(buf, sizeof(buf), "copyreg_%N", block);
1680 copyreg = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
1682 ir_snprintf(buf, sizeof(buf), "check_copyreg_%N", block);
1683 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, si->n_regs);
1685 pset_foreach(live, tmp) {
1688 op_t *op = get_irn_link(irn);
1689 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.ilp, 1.0);
1691 spill = set_find_spill(spill_bb->ilp, tmp);
1694 lpp_set_factor_fast(si->lpp, cst, spill->reg_out, 1.0);
1696 lpp_set_factor_fast(si->lpp, cst, copyreg, 1.0);
1698 sched_foreach(succ, phi) {
1699 const ir_node *to_copy;
1701 spill_t *to_copy_spill;
1702 op_t *phi_op = get_irn_link(phi);
1703 ilp_var_t reload = ILP_UNDEF;
1706 if(!is_Phi(phi)) break;
1707 if(!has_reg_class(si, phi)) continue;
1709 to_copy = get_irn_n(phi, pos);
1710 to_copy_op = get_irn_link(to_copy);
1712 to_copy_spill = set_find_spill(spill_bb->ilp, to_copy);
1713 assert(to_copy_spill);
1715 if(spill_bb->reloads) {
1716 keyval_t *keyval = set_find_keyval(spill_bb->reloads, to_copy);
1719 reload = PTR_TO_INT(keyval->val);
1723 ir_snprintf(buf, sizeof(buf), "req_copy_%N_%N_%N", block, phi, to_copy);
1724 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
1726 /* copy - reg_out - reload - remat - live_range <= 0 */
1727 lpp_set_factor_fast(si->lpp, cst, phi_op->attr.live_range.args.copies[pos], 1.0);
1728 lpp_set_factor_fast(si->lpp, cst, to_copy_spill->reg_out, -1.0);
1729 if(reload != ILP_UNDEF) lpp_set_factor_fast(si->lpp, cst, reload, -1.0);
1730 lpp_set_factor_fast(si->lpp, cst, to_copy_op->attr.live_range.ilp, -1.0);
1731 foreach_pre_remat(si, block, tmp) {
1732 op_t *remat_op = get_irn_link(tmp);
1733 if(remat_op->attr.remat.remat->value == to_copy) {
1734 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, -1.0);
1738 ir_snprintf(buf, sizeof(buf), "copyreg_%N_%N_%N", block, phi, to_copy);
1739 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
1741 /* copy - reg_out - copyreg <= 0 */
1742 lpp_set_factor_fast(si->lpp, cst, phi_op->attr.live_range.args.copies[pos], 1.0);
1743 lpp_set_factor_fast(si->lpp, cst, to_copy_spill->reg_out, -1.0);
1744 lpp_set_factor_fast(si->lpp, cst, copyreg, -1.0);
1750 * Walk all irg blocks and emit this ILP
1753 luke_blockwalker(ir_node * bb, void * data)
1755 spill_ilp_t *si = (spill_ilp_t*)data;
1760 spill_bb_t *spill_bb = get_irn_link(bb);
1763 pset *defs = pset_new_ptr_default();
1764 const arch_env_t *arch_env = si->birg->main_env->arch_env;
1766 live = pset_new_ptr_default();
1768 /****************************************
1769 * B A S I C B L O C K E N D
1770 ***************************************/
1773 /* init live values at end of block */
1774 get_live_end(si, bb, live);
1776 pset_foreach(live, irn) {
1778 ilp_var_t reload = ILP_UNDEF;
1780 spill = set_find_spill(spill_bb->ilp, irn);
1783 if(spill_bb->reloads) {
1784 keyval_t *keyval = set_find_keyval(spill_bb->reloads, irn);
1787 reload = PTR_TO_INT(keyval->val);
1791 op = get_irn_link(irn);
1792 assert(!op->is_remat);
1794 ir_snprintf(buf, sizeof(buf), "lr_%N_%N", irn, bb);
1795 op->attr.live_range.ilp = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
1796 op->attr.live_range.op = bb;
1798 ir_snprintf(buf, sizeof(buf), "reg_out_%N_%N", bb, irn);
1799 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
1801 /* reg_out - reload - remat - live_range <= 0 */
1802 lpp_set_factor_fast(si->lpp, cst, spill->reg_out, 1.0);
1803 if(reload != ILP_UNDEF) lpp_set_factor_fast(si->lpp, cst, reload, -1.0);
1804 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.ilp, -1.0);
1805 foreach_pre_remat(si, bb, tmp) {
1806 op_t *remat_op = get_irn_link(tmp);
1807 if(remat_op->attr.remat.remat->value == irn) {
1808 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, -1.0);
1811 ir_snprintf(buf, sizeof(buf), "reg_out2_%N_%N", bb, irn);
1812 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_greater, 0.0);
1814 /* value may only die at bb end if it is used for a mem copy */
1815 /* reg_out + \sum copy - reload - remat - live_range >= 0 */
1816 lpp_set_factor_fast(si->lpp, cst, spill->reg_out, 1.0);
1817 if(reload != ILP_UNDEF) lpp_set_factor_fast(si->lpp, cst, reload, -1.0);
1818 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.ilp, -1.0);
1819 foreach_pre_remat(si, bb, tmp) {
1820 op_t *remat_op = get_irn_link(tmp);
1821 if(remat_op->attr.remat.remat->value == irn) {
1822 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, -1.0);
1825 if(is_merge_edge(bb)) {
1826 const ir_edge_t *edge = get_block_succ_first(bb);
1827 const ir_node *next_bb = edge->src;
1828 int pos = edge->pos;
1831 sched_foreach(next_bb, phi) {
1832 const ir_node *phi_arg;
1834 if(!is_Phi(phi)) break;
1836 phi_arg = get_irn_n(phi, pos);
1838 if(phi_arg == irn) {
1839 op_t *phi_op = get_irn_link(phi);
1840 ilp_var_t copy = phi_op->attr.live_range.args.copies[pos];
1842 lpp_set_factor_fast(si->lpp, cst, copy, 1.0);
1849 insert_mem_copy_position(si, live, bb);
1852 * assure the remat args are available
1854 foreach_pre_remat(si, bb, tmp) {
1855 op_t *remat_op = get_irn_link(tmp);
1858 for (n=get_irn_arity(tmp)-1; n>=0; --n) {
1859 ir_node *remat_arg = get_irn_n(tmp, n);
1860 op_t *arg_op = get_irn_link(remat_arg);
1862 if(!has_reg_class(si, remat_arg)) continue;
1864 spill = set_find_spill(spill_bb->ilp, remat_arg);
1867 /* arguments of remats have to be live until the very end of the block
1868 * remat = reg_out(remat_arg) and (reload(remat_arg) or live_range(remat_arg)),
1869 * no remats, they could be in wrong order
1872 ir_snprintf(buf, sizeof(buf), "req_remat_%N_arg_%N", tmp, remat_arg);
1873 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1875 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 3.0);
1876 lpp_set_factor_fast(si->lpp, cst, spill->reg_out, -2.0);
1877 lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, -1.0);
1879 /* use reload placed for this argument */
1880 if(spill_bb->reloads) {
1881 keyval_t *keyval = set_find_keyval(spill_bb->reloads, remat_arg);
1884 ilp_var_t reload = PTR_TO_INT(keyval->val);
1886 lpp_set_factor_fast(si->lpp, cst, reload, -1.0);
1891 DBG((si->dbg, LEVEL_4, "\t %d values live at end of block %+F\n", pset_count(live), bb));
1896 /**************************************
1897 * B A S I C B L O C K B O D Y
1898 **************************************/
1900 sched_foreach_reverse_from(sched_block_last_noncf(si, bb), irn) {
1906 ilp_cst_t check_pre,
1912 ilp_cst_t one_memoperand;
1914 /* iterate only until first phi */
1918 op = get_irn_link(irn);
1920 if(op->is_remat) continue;
1922 DBG((si->dbg, LEVEL_4, "\t at node %+F\n", irn));
1924 /* collect defined values */
1925 if(has_reg_class(si, irn)) {
1926 pset_insert_ptr(defs, irn);
1930 if(is_Proj(irn)) continue;
1933 * init set of irn's arguments
1934 * and all possibly used values around this op
1935 * and values defined by post remats
1937 args = new_set(cmp_keyval, get_irn_arity(irn));
1938 used = pset_new_ptr(pset_count(live) + get_irn_arity(irn));
1939 remat_defs = pset_new_ptr(pset_count(live));
1941 if(!is_start_block(bb) || !be_is_Barrier(irn)) {
1942 for (n=get_irn_arity(irn)-1; n>=0; --n) {
1943 ir_node *irn_arg = get_irn_n(irn, n);
1944 if(has_reg_class(si, irn_arg)) {
1945 set_insert_keyval(args, irn_arg, (void*)n);
1946 pset_insert_ptr(used, irn_arg);
1949 foreach_post_remat(irn, tmp) {
1950 op_t *remat_op = get_irn_link(tmp);
1952 pset_insert_ptr(remat_defs, remat_op->attr.remat.remat->value);
1954 for (n=get_irn_arity(tmp)-1; n>=0; --n) {
1955 ir_node *remat_arg = get_irn_n(tmp, n);
1956 if(has_reg_class(si, remat_arg)) {
1957 pset_insert_ptr(used, remat_arg);
1961 foreach_pre_remat(si, irn, tmp) {
1962 for (n=get_irn_arity(tmp)-1; n>=0; --n) {
1963 ir_node *remat_arg = get_irn_n(tmp, n);
1964 if(has_reg_class(si, remat_arg)) {
1965 pset_insert_ptr(used, remat_arg);
1971 /**********************************
1972 * I N E P I L O G O F irn
1973 **********************************/
1975 /* ensure each dying value is used by only one post remat */
1976 pset_foreach(used, tmp) {
1977 ir_node *value = tmp;
1978 op_t *value_op = get_irn_link(value);
1983 foreach_post_remat(irn, remat) {
1984 op_t *remat_op = get_irn_link(remat);
1986 for(n=get_irn_arity(remat)-1; n>=0; --n) {
1987 ir_node *remat_arg = get_irn_n(remat, n);
1989 /* if value is used by this remat add it to constraint */
1990 if(remat_arg == value) {
1992 /* sum remat2s <= 1 + n_remats*live_range */
1993 ir_snprintf(buf, sizeof(buf), "dying_lr_%N_%N", value, irn);
1994 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 1.0);
1998 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
2004 if(pset_find_ptr(live, value) && cst != ILP_UNDEF) {
2005 lpp_set_factor_fast(si->lpp, cst, value_op->attr.live_range.ilp, -n_remats);
2009 /* ensure at least one value dies at post remat */
2010 foreach_post_remat(irn, tmp) {
2011 op_t *remat_op = get_irn_link(tmp);
2012 pset *remat_args = pset_new_ptr(get_irn_arity(tmp));
2015 for(n=get_irn_arity(tmp)-1; n>=0; --n) {
2016 remat_arg = get_irn_n(tmp, n);
2018 if(has_reg_class(si, remat_arg)) {
2020 /* does arg always die at this op? */
2021 if(!pset_find_ptr(live, remat_arg))
2022 goto skip_one_must_die;
2024 pset_insert_ptr(remat_args, remat_arg);
2028 /* remat + \sum live_range(remat_arg) <= |args| */
2029 ir_snprintf(buf, sizeof(buf), "one_must_die_%+F", tmp);
2030 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, pset_count(remat_args));
2031 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
2033 pset_foreach(remat_args, remat_arg) {
2034 op_t *arg_op = get_irn_link(remat_arg);
2036 lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, 1.0);
2040 del_pset(remat_args);
2043 /* new live ranges for values from L\U defined by post remats */
2044 pset_foreach(live, tmp) {
2045 ir_node *value = tmp;
2046 op_t *value_op = get_irn_link(value);
2048 if(!set_find_keyval(args, value) && !pset_find_ptr(defs, value)) {
2049 ilp_var_t prev_lr = ILP_UNDEF;
2052 if(pset_find_ptr(remat_defs, value)) {
2054 /* next_live_range <= prev_live_range + sum remat2s */
2055 ir_snprintf(buf, sizeof(buf), "next_lr_%N_%N", value, irn);
2056 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2058 ir_snprintf(buf, sizeof(buf), "lr_%N_%N", value, irn);
2059 prev_lr = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
2061 lpp_set_factor_fast(si->lpp, cst, value_op->attr.live_range.ilp, 1.0);
2062 lpp_set_factor_fast(si->lpp, cst, prev_lr, -1.0);
2064 foreach_post_remat(irn, remat) {
2065 op_t *remat_op = get_irn_link(remat);
2067 /* if value is being rematerialized by this remat */
2068 if(value == remat_op->attr.remat.remat->value) {
2069 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, -1.0);
2073 value_op->attr.live_range.ilp = prev_lr;
2074 value_op->attr.live_range.op = irn;
2079 /* requirements for post remats and start live ranges from L/U' for values dying here */
2080 foreach_post_remat(irn, tmp) {
2081 op_t *remat_op = get_irn_link(tmp);
2084 for (n=get_irn_arity(tmp)-1; n>=0; --n) {
2085 ir_node *remat_arg = get_irn_n(tmp, n);
2086 op_t *arg_op = get_irn_link(remat_arg);
2088 if(!has_reg_class(si, remat_arg)) continue;
2090 /* only for values in L\U (TODO and D?), the others are handled with post_use */
2091 if(!pset_find_ptr(used, remat_arg)) {
2092 /* remat <= live_range(remat_arg) */
2093 ir_snprintf(buf, sizeof(buf), "req_remat2_%N_arg_%N", tmp, remat_arg);
2094 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
2096 /* if value is becoming live through use by remat2 */
2097 if(!pset_find_ptr(live, remat_arg)) {
2100 ir_snprintf(buf, sizeof(buf), "lr_%N_%N", remat_arg, irn);
2101 lr = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
2103 arg_op->attr.live_range.ilp = lr;
2104 arg_op->attr.live_range.op = irn;
2106 DBG((si->dbg, LEVEL_3, " value %+F becoming live through use by remat2 %+F\n", remat_arg, tmp));
2108 pset_insert_ptr(live, remat_arg);
2109 add_to_spill_bb(si, bb, remat_arg);
2112 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
2113 lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, -1.0);
2118 d = pset_count(defs);
2119 DBG((si->dbg, LEVEL_4, "\t %+F produces %d values in my register class\n", irn, d));
2121 /* count how many regs irn needs for arguments */
2122 u = set_count(args);
2125 /* check the register pressure in the epilog */
2126 /* sum_{L\U'} lr + sum_{U'} post_use <= k - |D| */
2127 ir_snprintf(buf, sizeof(buf), "check_post_%N", irn);
2128 check_post = lpp_add_cst_uniq(si->lpp, buf, lpp_less, si->n_regs - d);
2130 /* add L\U' to check_post */
2131 pset_foreach(live, tmp) {
2132 if(!pset_find_ptr(used, tmp) && !pset_find_ptr(defs, tmp)) {
2133 /* if a live value is not used by irn */
2134 tmp_op = get_irn_link(tmp);
2135 lpp_set_factor_fast(si->lpp, check_post, tmp_op->attr.live_range.ilp, 1.0);
2139 /***********************************************************
2140 * 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
2141 **********************************************************/
2144 pset_foreach(used, tmp) {
2150 op_t *arg_op = get_irn_link(arg);
2153 spill = add_to_spill_bb(si, bb, arg);
2155 /* new live range for each used value */
2156 ir_snprintf(buf, sizeof(buf), "lr_%N_%N", arg, irn);
2157 prev_lr = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
2159 /* the epilog stuff - including post_use, check_post, check_post_remat */
2160 ir_snprintf(buf, sizeof(buf), "post_use_%N_%N", arg, irn);
2161 post_use = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
2163 lpp_set_factor_fast(si->lpp, check_post, post_use, 1.0);
2165 /* arg is live throughout epilog if the next live_range is in a register */
2166 if(pset_find_ptr(live, arg)) {
2167 DBG((si->dbg, LEVEL_3, "\t arg %+F is possibly live in epilog of %+F\n", arg, irn));
2169 /* post_use >= next_lr + remat */
2170 ir_snprintf(buf, sizeof(buf), "post_use_%N_%N-%d", arg, irn, p++);
2171 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2172 lpp_set_factor_fast(si->lpp, cst, post_use, -1.0);
2173 lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, 1.0);
2176 /* forall post remat which use arg add a similar cst */
2177 foreach_post_remat(irn, remat) {
2180 for (n=get_irn_arity(remat)-1; n>=0; --n) {
2181 ir_node *remat_arg = get_irn_n(remat, n);
2182 op_t *remat_op = get_irn_link(remat);
2184 if(remat_arg == arg) {
2185 DBG((si->dbg, LEVEL_3, "\t found remat with arg %+F in epilog of %+F\n", arg, irn));
2187 /* post_use >= remat */
2188 ir_snprintf(buf, sizeof(buf), "post_use_%N_%N-%d", arg, irn, p++);
2189 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2190 lpp_set_factor_fast(si->lpp, cst, post_use, -1.0);
2191 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
2196 /* if value is not an arg of op and not possibly defined by post remat
2197 * then it may only die and not become live
2199 if(!set_find_keyval(args, arg)) {
2200 /* post_use <= prev_lr */
2201 ir_snprintf(buf, sizeof(buf), "req_post_use_%N_%N", arg, irn);
2202 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2203 lpp_set_factor_fast(si->lpp, cst, post_use, 1.0);
2204 lpp_set_factor_fast(si->lpp, cst, prev_lr, -1.0);
2206 if(!pset_find_ptr(remat_defs, arg) && pset_find_ptr(live, arg)) {
2207 /* next_lr <= prev_lr */
2208 ir_snprintf(buf, sizeof(buf), "next_lr_%N_%N", arg, irn);
2209 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2210 lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, 1.0);
2211 lpp_set_factor_fast(si->lpp, cst, prev_lr, -1.0);
2215 if(opt_memoperands && (!is_start_block(bb) || be_is_Barrier(irn))) {
2216 for(n = get_irn_arity(irn)-1; n>=0; --n) {
2217 if(get_irn_n(irn, n) == arg && arch_possible_memory_operand(arch_env, irn, n)) {
2218 ilp_var_t memoperand;
2220 ir_snprintf(buf, sizeof(buf), "memoperand_%N_%d", irn, n);
2221 memoperand = lpp_add_var_default(si->lpp, buf, lpp_binary, opt_cost_memoperand*execution_frequency(si, bb), 0.0);
2222 set_insert_memoperand(si->memoperands, irn, n, memoperand);
2224 ir_snprintf(buf, sizeof(buf), "nolivepost_%N_%d", irn, n);
2225 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 1.0);
2227 lpp_set_factor_fast(si->lpp, cst, memoperand, 1.0);
2228 lpp_set_factor_fast(si->lpp, cst, post_use, 1.0);
2233 /* new live range begins for each used value */
2234 arg_op->attr.live_range.ilp = prev_lr;
2235 arg_op->attr.live_range.op = irn;
2237 pset_insert_ptr(live, arg);
2240 /* just to be sure */
2241 check_post = ILP_UNDEF;
2243 /* allow original defintions to be removed */
2244 if(opt_repair_schedule) {
2245 pset_foreach(defs, tmp) {
2246 op_t *tmp_op = get_irn_link(tmp);
2247 spill_t *spill = set_find_spill(spill_bb->ilp, tmp);
2252 ir_snprintf(buf, sizeof(buf), "delete_%N", tmp);
2253 delete = lpp_add_var_default(si->lpp, buf, lpp_binary, -1.0*get_cost(si, irn)*execution_frequency(si, bb), 0.0);
2255 /* op may not be killed if its first live_range is 1 */
2256 ir_snprintf(buf, sizeof(buf), "killorig-lr_%N", tmp);
2257 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 1.0);
2258 lpp_set_factor_fast(si->lpp, cst, delete, 1.0);
2259 lpp_set_factor_fast(si->lpp, cst, tmp_op->attr.live_range.ilp, 1.0);
2261 /* op may not be killed if it is spilled after the definition */
2262 ir_snprintf(buf, sizeof(buf), "killorig-spill_%N", tmp);
2263 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 1.0);
2264 lpp_set_factor_fast(si->lpp, cst, delete, 1.0);
2265 lpp_set_factor_fast(si->lpp, cst, spill->spill, 1.0);
2270 ir_snprintf(buf, sizeof(buf), "keep_%N", tmp);
2271 keep = lpp_add_var_default(si->lpp, buf, lpp_binary, get_cost(si, irn)*execution_frequency(si, bb), 1.0);
2273 /* op may not be killed if its first live_range is 1 */
2274 ir_snprintf(buf, sizeof(buf), "killorig-lr_%N", tmp);
2275 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_greater, 0.0);
2276 lpp_set_factor_fast(si->lpp, cst, keep, 1.0);
2277 lpp_set_factor_fast(si->lpp, cst, tmp_op->attr.live_range.ilp, -1.0);
2279 /* op may not be killed if it is spilled after the definition */
2280 ir_snprintf(buf, sizeof(buf), "killorig-spill_%N", tmp);
2281 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_greater, 0.0);
2282 lpp_set_factor_fast(si->lpp, cst, keep, 1.0);
2283 lpp_set_factor_fast(si->lpp, cst, spill->spill, -1.0);
2288 pset_foreach(defs, tmp) {
2289 op_t *tmp_op = get_irn_link(tmp);
2290 spill_t *spill = set_find_spill(spill_bb->ilp, tmp);
2293 /* live_range or spill should be 1
2294 TODO: lr should be live until first use */
2295 ir_snprintf(buf, sizeof(buf), "nokillorig_%N", tmp);
2296 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_greater, 1.0);
2297 lpp_set_factor_fast(si->lpp, cst, tmp_op->attr.live_range.ilp, 1.0);
2298 lpp_set_factor_fast(si->lpp, cst, spill->spill, 1.0);
2308 /* check the register pressure in the prolog */
2309 /* sum_{L\U} lr <= k - |U| */
2310 ir_snprintf(buf, sizeof(buf), "check_pre_%N", irn);
2311 check_pre = lpp_add_cst_uniq(si->lpp, buf, lpp_less, si->n_regs - u);
2313 /* for the prolog remove defined values from the live set */
2314 pset_foreach(defs, tmp) {
2315 pset_remove_ptr(live, tmp);
2318 if(opt_memoperands && (!is_start_block(bb) || be_is_Barrier(irn))) {
2319 ir_snprintf(buf, sizeof(buf), "one_memoperand_%N", irn);
2320 one_memoperand = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 1.0);
2323 /***********************************************************
2324 * 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
2325 **********************************************************/
2328 set_foreach(args, keyval) {
2330 const ir_node *arg = keyval->key;
2331 int i = PTR_TO_INT(keyval->val);
2332 op_t *arg_op = get_irn_link(arg);
2333 ilp_cst_t requirements;
2336 spill = set_find_spill(spill_bb->ilp, arg);
2339 ir_snprintf(buf, sizeof(buf), "reload_%N_%N", arg, irn);
2340 op->attr.live_range.args.reloads[i] = lpp_add_var_default(si->lpp, buf, lpp_binary, opt_cost_reload*execution_frequency(si, bb), 1.0);
2342 /* reload <= mem_out */
2343 ir_snprintf(buf, sizeof(buf), "req_reload_%N_%N", arg, irn);
2344 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2345 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.args.reloads[i], 1.0);
2346 lpp_set_factor_fast(si->lpp, cst, spill->mem_out, -1.0);
2348 /* requirement: arg must be in register for use */
2349 /* reload + remat + live_range == 1 */
2350 ir_snprintf(buf, sizeof(buf), "req_%N_%N", irn, arg);
2351 requirements = lpp_add_cst_uniq(si->lpp, buf, lpp_equal, 1.0);
2353 lpp_set_factor_fast(si->lpp, requirements, arg_op->attr.live_range.ilp, 1.0);
2354 lpp_set_factor_fast(si->lpp, requirements, op->attr.live_range.args.reloads[i], 1.0);
2355 foreach_pre_remat(si, irn, tmp) {
2356 op_t *remat_op = get_irn_link(tmp);
2357 if(remat_op->attr.remat.remat->value == arg) {
2358 lpp_set_factor_fast(si->lpp, requirements, remat_op->attr.remat.ilp, 1.0);
2362 if(opt_memoperands && (!is_start_block(bb) || be_is_Barrier(irn))) {
2364 for(n = get_irn_arity(irn)-1; n>=0; --n) {
2365 if(get_irn_n(irn, n) == arg) {
2369 for(n = get_irn_arity(irn)-1; n>=0; --n) {
2370 if(get_irn_n(irn, n) == arg && arch_possible_memory_operand(arch_env, irn, n)) {
2371 memoperand_t *memoperand;
2372 memoperand = set_find_memoperand(si->memoperands, irn, n);
2374 /* memoperand <= mem_out */
2375 ir_snprintf(buf, sizeof(buf), "req_memoperand_%N_%d", irn, n);
2376 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2377 lpp_set_factor_fast(si->lpp, cst, memoperand->ilp, 1.0);
2378 lpp_set_factor_fast(si->lpp, cst, spill->mem_out, -1.0);
2380 /* the memoperand is only sufficient if it is used once by the op */
2381 if(n_memoperands == 1)
2382 lpp_set_factor_fast(si->lpp, requirements, memoperand->ilp, 1.0);
2384 lpp_set_factor_fast(si->lpp, one_memoperand, memoperand->ilp, 1.0);
2386 /* we have one more free register if we use a memory operand */
2387 lpp_set_factor_fast(si->lpp, check_pre, memoperand->ilp, -1.0);
2393 /* iterate over L\U */
2394 pset_foreach(live, tmp) {
2395 if(!set_find_keyval(args, tmp)) {
2396 /* if a live value is not used by irn */
2397 tmp_op = get_irn_link(tmp);
2398 lpp_set_factor_fast(si->lpp, check_pre, tmp_op->attr.live_range.ilp, 1.0);
2402 /* requirements for remats */
2403 foreach_pre_remat(si, irn, tmp) {
2404 op_t *remat_op = get_irn_link(tmp);
2407 for (n=get_irn_arity(tmp)-1; n>=0; --n) {
2408 ir_node *remat_arg = get_irn_n(tmp, n);
2409 op_t *arg_op = get_irn_link(remat_arg);
2411 if(!has_reg_class(si, remat_arg)) continue;
2413 /* remat <= live_rang(remat_arg) [ + reload(remat_arg) ] */
2414 ir_snprintf(buf, sizeof(buf), "req_remat_%N_arg_%N", tmp, remat_arg);
2415 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
2417 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
2418 lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, -1.0);
2420 /* if remat arg is also used by current op then we can use reload placed for this argument */
2421 if((keyval = set_find_keyval(args, remat_arg)) != NULL) {
2422 int index = (int)keyval->val;
2424 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.args.reloads[index], -1.0);
2432 /*************************
2433 * D O N E W I T H O P
2434 *************************/
2436 DBG((si->dbg, LEVEL_4, "\t %d values live at %+F\n", pset_count(live), irn));
2438 pset_foreach(live, tmp) {
2439 assert(has_reg_class(si, tmp));
2442 for (n=get_irn_arity(irn)-1; n>=0; --n) {
2443 ir_node *arg = get_irn_n(irn, n);
2445 assert(!find_post_remat(arg, irn) && "there should be no post remat for an argument of an op");
2448 del_pset(remat_defs);
2452 defs = pset_new_ptr_default();
2454 /* skip everything above barrier in start block */
2455 if(is_start_block(bb) && be_is_Barrier(irn)) {
2456 assert(pset_count(live) == 0);
2465 /***************************************
2466 * B E G I N N I N G O F B L O C K
2467 ***************************************/
2470 /* we are now at the beginning of the basic block, there are only \Phis in front of us */
2471 DBG((si->dbg, LEVEL_3, "\t %d values live at beginning of block %+F\n", pset_count(live), bb));
2473 pset_foreach(live, irn) {
2474 assert(is_Phi(irn) || get_nodes_block(irn) != bb);
2477 /* construct mem_outs for all values */
2478 set_foreach(spill_bb->ilp, spill) {
2479 ir_snprintf(buf, sizeof(buf), "mem_out_%N_%N", spill->irn, bb);
2480 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2482 lpp_set_factor_fast(si->lpp, cst, spill->mem_out, 1.0);
2483 lpp_set_factor_fast(si->lpp, cst, spill->spill, -1.0);
2485 if(pset_find_ptr(live, spill->irn)) {
2486 int default_spilled;
2487 DBG((si->dbg, LEVEL_5, "\t %+F live at beginning of block %+F\n", spill->irn, bb));
2489 ir_snprintf(buf, sizeof(buf), "mem_in_%N_%N", spill->irn, bb);
2490 default_spilled = be_is_live_in(si->lv, bb, spill->irn) || is_Phi(spill->irn);
2491 spill->mem_in = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, default_spilled);
2492 lpp_set_factor_fast(si->lpp, cst, spill->mem_in, -1.0);
2494 if(opt_memcopies && is_Phi(spill->irn) && get_nodes_block(spill->irn) == bb) {
2496 op_t *op = get_irn_link(spill->irn);
2498 for(n=get_irn_arity(spill->irn)-1; n>=0; --n) {
2499 const ir_node *arg = get_irn_n(spill->irn, n);
2505 /* argument already done? */
2506 if(op->attr.live_range.args.copies[n] != ILP_UNDEF) continue;
2508 /* get sum of execution frequencies of blocks with the same phi argument */
2509 for(m=n; m>=0; --m) {
2510 const ir_node *arg2 = get_irn_n(spill->irn, m);
2513 freq += execution_frequency(si, get_Block_cfgpred_block(bb, m));
2517 /* copies are not for free */
2518 ir_snprintf(buf, sizeof(buf), "copy_%N_%N", arg, spill->irn);
2519 var = lpp_add_var_default(si->lpp, buf, lpp_binary, opt_cost_spill * freq, 1.0);
2521 for(m=n; m>=0; --m) {
2522 const ir_node *arg2 = get_irn_n(spill->irn, m);
2525 op->attr.live_range.args.copies[m] = var;
2530 /* copy <= mem_in */
2531 ir_snprintf(buf, sizeof(buf), "nocopy_%N_%N", arg, spill->irn);
2532 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2533 lpp_set_factor_fast(si->lpp, cst, var, 1.0);
2534 lpp_set_factor_fast(si->lpp, cst, spill->mem_in, -1.0);
2541 foreach_post_remat(bb, tmp) {
2543 op_t *remat_op = get_irn_link(tmp);
2544 pset *remat_args = pset_new_ptr(get_irn_arity(tmp));
2547 for (n=get_irn_arity(tmp)-1; n>=0; --n) {
2548 remat_arg = get_irn_n(tmp, n);
2550 if(has_reg_class(si, remat_arg)) {
2551 pset_insert_ptr(remat_args, remat_arg);
2555 /* remat + \sum live_range(remat_arg) <= |args| */
2556 ir_snprintf(buf, sizeof(buf), "one_must_die_%N", tmp);
2557 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, pset_count(remat_args));
2558 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
2560 pset_foreach(remat_args, remat_arg) {
2561 if(pset_find_ptr(live, remat_arg)) {
2562 op_t *remat_arg_op = get_irn_link(remat_arg);
2563 lpp_set_factor_fast(si->lpp, cst, remat_arg_op->attr.live_range.ilp, 1.0);
2566 del_pset(remat_args);
2569 foreach_post_remat(bb, tmp) {
2572 for(n=get_irn_arity(tmp)-1; n>=0; --n) {
2573 ir_node *remat_arg = get_irn_n(tmp, n);
2575 /* if value is becoming live through use by remat2 */
2576 if(has_reg_class(si, remat_arg) && !pset_find_ptr(live, remat_arg)) {
2577 op_t *remat_arg_op = get_irn_link(remat_arg);
2580 DBG((si->dbg, LEVEL_3, " value %+F becoming live through use by remat2 at bb start %+F\n", remat_arg, tmp));
2582 pset_insert_ptr(live, remat_arg);
2583 spill = add_to_spill_bb(si, bb, remat_arg);
2584 remat_arg_op->attr.live_range.ilp = ILP_UNDEF;
2586 /* we need reg_in and mem_in for this value; they will be referenced later */
2587 ir_snprintf(buf, sizeof(buf), "reg_in_%N_%N", remat_arg, bb);
2588 spill->reg_in = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
2589 ir_snprintf(buf, sizeof(buf), "mem_in_%N_%N", remat_arg, bb);
2590 spill->mem_in = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
2593 /* optimization: all memory stuff should be 0, for we do not want to insert reloads for remats */
2594 ir_snprintf(buf, sizeof(buf), "nomem_%N_%N", remat_arg, bb);
2595 nomem = lpp_add_cst_uniq(si->lpp, buf, lpp_equal, 0.0);
2596 lpp_set_factor_fast(si->lpp, nomem, spill->spill, 1.0);
2601 /* L\U is empty at bb start */
2602 /* arg is live throughout epilog if it is reg_in into this block */
2604 /* check the register pressure at the beginning of the block
2607 /* reg_in entspricht post_use */
2609 ir_snprintf(buf, sizeof(buf), "check_start_%N", bb);
2610 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, si->n_regs);
2612 pset_foreach(live, irn) {
2615 spill = set_find_spill(spill_bb->ilp, irn);
2618 ir_snprintf(buf, sizeof(buf), "reg_in_%N_%N", irn, bb);
2619 spill->reg_in = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
2621 lpp_set_factor_fast(si->lpp, cst, spill->reg_in, 1.0);
2623 /* spill + mem_in <= 1 */
2624 ir_snprintf(buf, sizeof(buf), "nospill_%N_%N", irn, bb);
2625 nospill = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 1);
2627 lpp_set_factor_fast(si->lpp, nospill, spill->mem_in, 1.0);
2628 lpp_set_factor_fast(si->lpp, nospill, spill->spill, 1.0);
2630 } /* post_remats are NOT included in register pressure check because
2631 they do not increase regpressure */
2633 /* mem_in/reg_in for live_in values, especially phis and their arguments */
2634 pset_foreach(live, irn) {
2638 spill = set_find_spill(spill_bb->ilp, irn);
2639 assert(spill && spill->irn == irn);
2641 if(is_Phi(irn) && get_nodes_block(irn) == bb) {
2642 for (n=get_Phi_n_preds(irn)-1; n>=0; --n) {
2645 ir_node *phi_arg = get_Phi_pred(irn, n);
2646 ir_node *bb_p = get_Block_cfgpred_block(bb, n);
2647 spill_bb_t *spill_bb_p = get_irn_link(bb_p);
2649 op_t *op = get_irn_link(irn);
2651 /* although the phi is in the right regclass one or more of
2652 * its arguments can be in a different one or at least to
2655 if(has_reg_class(si, phi_arg)) {
2656 /* mem_in < mem_out_arg + copy */
2657 ir_snprintf(buf, sizeof(buf), "mem_in_%N_%N-%d", irn, bb, p);
2658 mem_in = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2660 /* reg_in < reg_out_arg */
2661 ir_snprintf(buf, sizeof(buf), "reg_in_%N_%N-%d", irn, bb, p++);
2662 reg_in = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2664 lpp_set_factor_fast(si->lpp, mem_in, spill->mem_in, 1.0);
2665 lpp_set_factor_fast(si->lpp, reg_in, spill->reg_in, 1.0);
2667 spill_p = set_find_spill(spill_bb_p->ilp, phi_arg);
2670 lpp_set_factor_fast(si->lpp, mem_in, spill_p->mem_out, -1.0);
2672 lpp_set_factor_fast(si->lpp, mem_in, op->attr.live_range.args.copies[n], -1.0);
2674 lpp_set_factor_fast(si->lpp, reg_in, spill_p->reg_out, -1.0);
2678 /* else assure the value arrives on all paths in the same resource */
2680 for (n=get_Block_n_cfgpreds(bb)-1; n>=0; --n) {
2683 ir_node *bb_p = get_Block_cfgpred_block(bb, n);
2684 spill_bb_t *spill_bb_p = get_irn_link(bb_p);
2687 ir_snprintf(buf, sizeof(buf), "mem_in_%N_%N-%d", irn, bb, p);
2688 mem_in = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2689 ir_snprintf(buf, sizeof(buf), "reg_in_%N_%N-%d", irn, bb, p++);
2690 reg_in = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2692 lpp_set_factor_fast(si->lpp, mem_in, spill->mem_in, 1.0);
2693 lpp_set_factor_fast(si->lpp, reg_in, spill->reg_in, 1.0);
2695 spill_p = set_find_spill(spill_bb_p->ilp, irn);
2698 lpp_set_factor_fast(si->lpp, mem_in, spill_p->mem_out, -1.0);
2699 lpp_set_factor_fast(si->lpp, reg_in, spill_p->reg_out, -1.0);
2704 foreach_post_remat(bb, tmp) {
2707 for (n=get_irn_arity(tmp)-1; n>=0; --n) {
2708 ir_node *remat_arg = get_irn_n(tmp, n);
2709 op_t *remat_op = get_irn_link(tmp);
2711 if(!has_reg_class(si, remat_arg)) continue;
2713 spill = set_find_spill(spill_bb->ilp, remat_arg);
2716 ir_snprintf(buf, sizeof(buf), "req_remat2_%N_%N_arg_%N", tmp, bb, remat_arg);
2717 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
2718 lpp_set_factor_fast(si->lpp, cst, spill->reg_in, -1.0);
2719 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
2723 pset_foreach(live, irn) {
2724 const op_t *op = get_irn_link(irn);
2725 const ir_node *remat;
2730 foreach_post_remat(bb, remat) {
2733 for (n=get_irn_arity(remat)-1; n>=0; --n) {
2734 const ir_node *arg = get_irn_n(remat, n);
2737 const op_t *remat_op = get_irn_link(remat);
2739 if(cst == ILP_UNDEF) {
2740 /* sum remat2s <= 1 + n_remats*live_range */
2741 ir_snprintf(buf, sizeof(buf), "dying_lr_%N_%N", irn, bb);
2742 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 1.0);
2744 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
2750 if(cst != ILP_UNDEF && op->attr.live_range.ilp != ILP_UNDEF) {
2751 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.ilp, -n_remats);
2755 /* first live ranges from reg_ins */
2756 pset_foreach(live, irn) {
2757 op_t *op = get_irn_link(irn);
2759 if(op->attr.live_range.ilp != ILP_UNDEF) {
2761 spill = set_find_spill(spill_bb->ilp, irn);
2762 assert(spill && spill->irn == irn);
2764 ir_snprintf(buf, sizeof(buf), "first_lr_%N_%N", irn, bb);
2765 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2766 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.ilp, 1.0);
2767 lpp_set_factor_fast(si->lpp, cst, spill->reg_in, -1.0);
2769 foreach_post_remat(bb, tmp) {
2770 op_t *remat_op = get_irn_link(tmp);
2772 if(remat_op->attr.remat.remat->value == irn) {
2773 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, -1.0);
2779 /* walk forward now and compute constraints for placing spills */
2780 /* this must only be done for values that are not defined in this block */
2781 pset_foreach(live, irn) {
2783 * if value is defined in this block we can anways place the spill directly after the def
2784 * -> no constraint necessary
2786 if(!is_Phi(irn) && get_nodes_block(irn) == bb) {
2791 spill = set_find_spill(spill_bb->ilp, irn);
2794 ir_snprintf(buf, sizeof(buf), "req_spill_%N_%N", irn, bb);
2795 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2797 lpp_set_factor_fast(si->lpp, cst, spill->spill, 1.0);
2798 if(is_diverge_edge(bb)) lpp_set_factor_fast(si->lpp, cst, spill->reg_in, -1.0);
2801 sched_foreach_op(bb, tmp) {
2802 op_t *op = get_irn_link(tmp);
2804 if(is_Phi(tmp)) continue;
2805 assert(!is_Proj(tmp));
2808 const ir_node *value = op->attr.remat.remat->value;
2811 /* only collect remats up to the first real use of a value */
2812 lpp_set_factor_fast(si->lpp, cst, op->attr.remat.ilp, -1.0);
2817 for (n=get_irn_arity(tmp)-1; n>=0; --n) {
2818 ir_node *arg = get_irn_n(tmp, n);
2821 /* if a value is used stop collecting remats */
2834 typedef struct _irnlist_t {
2835 struct list_head list;
2839 typedef struct _interference_t {
2840 struct list_head blocklist;
2846 cmp_interference(const void *a, const void *b, size_t size)
2848 const interference_t *p = a;
2849 const interference_t *q = b;
2851 return !(p->a == q->a && p->b == q->b);
2854 static interference_t *
2855 set_find_interference(set * set, ir_node * a, ir_node * b)
2857 interference_t query;
2859 query.a = (a>b)?a:b;
2860 query.b = (a>b)?b:a;
2862 return set_find(set, &query, sizeof(query), HASH_PTR(PTR_TO_INT(a) ^ PTR_TO_INT(b)));
2865 static interference_t *
2866 set_insert_interference(spill_ilp_t * si, set * set, ir_node * a, ir_node * b, ir_node * bb)
2868 interference_t query,
2870 irnlist_t *list = obstack_alloc(si->obst, sizeof(*list));
2874 result = set_find_interference(set, a, b);
2877 list_add(&list->list, &result->blocklist);
2881 query.a = (a>b)?a:b;
2882 query.b = (a>b)?b:a;
2884 result = set_insert(set, &query, sizeof(query), HASH_PTR(PTR_TO_INT(a) ^ PTR_TO_INT(b)));
2886 INIT_LIST_HEAD(&result->blocklist);
2887 list_add(&list->list, &result->blocklist);
2893 values_interfere_in_block(const spill_ilp_t * si, const ir_node * bb, const ir_node * a, const ir_node * b)
2895 const ir_edge_t *edge;
2897 if(get_nodes_block(a) != bb && get_nodes_block(b) != bb) {
2898 /* both values are live in, so they interfere */
2902 /* ensure a dominates b */
2903 if(value_dominates(b,a)) {
2909 assert(get_nodes_block(b) == bb && "at least b should be defined here in this block");
2912 /* the following code is stolen from bera.c */
2913 if(be_is_live_end(si->lv, bb, a))
2916 foreach_out_edge(a, edge) {
2917 const ir_node *user = edge->src;
2918 if(get_nodes_block(user) == bb
2921 && !pset_find_ptr(si->inverse_ops, user)
2922 && value_dominates(b, user))
2930 * Walk all irg blocks and collect interfering values inside of phi classes
2933 luke_interferencewalker(ir_node * bb, void * data)
2935 spill_ilp_t *si = (spill_ilp_t*)data;
2938 be_lv_foreach(si->lv, bb, be_lv_state_end | be_lv_state_out | be_lv_state_in, l1) {
2939 ir_node *a = be_lv_get_irn(si->lv, bb, l1);
2940 op_t *a_op = get_irn_link(a);
2943 /* a is only interesting if it is in my register class and if it is inside a phi class */
2944 if (has_reg_class(si, a) && get_phi_class(si->pc, a)) {
2945 if (a_op->is_remat || pset_find_ptr(si->inverse_ops, a))
2948 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)) {
2949 ir_node *b = be_lv_get_irn(si->lv, bb, l2);
2950 op_t *b_op = get_irn_link(b);
2952 /* a and b are only interesting if they are in the same phi class */
2953 if (has_reg_class(si, b) && get_phi_class(si->pc, a) == get_phi_class(si->pc, b)) {
2954 if (b_op->is_remat || pset_find_ptr(si->inverse_ops, b))
2957 if (values_interfere_in_block(si, bb, a, b)) {
2958 DBG((si->dbg, LEVEL_4, "\tvalues interfere in %+F: %+F, %+F\n", bb, a, b));
2959 set_insert_interference(si, si->interferences, a, b, bb);
2967 static unsigned int copy_path_id = 0;
2970 write_copy_path_cst(spill_ilp_t *si, pset * copies, ilp_var_t any_interfere)
2977 ir_snprintf(buf, sizeof(buf), "copy_path-%d", copy_path_id++);
2978 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0);
2980 lpp_set_factor_fast(si->lpp, cst, any_interfere, 1.0);
2982 pset_foreach(copies, ptr) {
2983 copy = PTR_TO_INT(ptr);
2984 lpp_set_factor_fast(si->lpp, cst, copy, -1.0);
2989 * @parameter copies contains a path of copies which lead us to irn
2990 * @parameter visited contains a set of nodes already visited on this path
2993 find_copy_path(spill_ilp_t * si, const ir_node * irn, const ir_node * target, ilp_var_t any_interfere, pset * copies, pset * visited)
2995 const ir_edge_t *edge;
2996 op_t *op = get_irn_link(irn);
2997 pset *visited_users = pset_new_ptr_default();
3000 if(op->is_remat) return 0;
3002 pset_insert_ptr(visited, irn);
3006 pset *visited_operands = pset_new_ptr(get_irn_arity(irn));
3008 /* visit all operands */
3009 for(n=get_irn_arity(irn)-1; n>=0; --n) {
3010 ir_node *arg = get_irn_n(irn, n);
3011 ilp_var_t copy = op->attr.live_range.args.copies[n];
3013 if(!has_reg_class(si, arg)) continue;
3014 if(pset_find_ptr(visited_operands, arg)) continue;
3015 pset_insert_ptr(visited_operands, arg);
3018 if(++paths > MAX_PATHS && pset_count(copies) != 0) {
3019 del_pset(visited_operands);
3020 del_pset(visited_users);
3021 pset_remove_ptr(visited, irn);
3024 pset_insert(copies, INT_TO_PTR(copy), copy);
3025 write_copy_path_cst(si, copies, any_interfere);
3026 pset_remove(copies, INT_TO_PTR(copy), copy);
3027 } else if(!pset_find_ptr(visited, arg)) {
3028 pset_insert(copies, INT_TO_PTR(copy), copy);
3029 paths += find_copy_path(si, arg, target, any_interfere, copies, visited);
3030 pset_remove(copies, INT_TO_PTR(copy), copy);
3032 if(paths > MAX_PATHS) {
3033 if(pset_count(copies) == 0) {
3037 ir_snprintf(buf, sizeof(buf), "always_copy-%d-%d", any_interfere, copy);
3038 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_equal, 0);
3039 lpp_set_factor_fast(si->lpp, cst, any_interfere, -1.0);
3040 lpp_set_factor_fast(si->lpp, cst, copy, 1.0);
3041 DBG((si->dbg, LEVEL_1, "ALWAYS COPYING %d FOR INTERFERENCE %d\n", copy, any_interfere));
3045 del_pset(visited_operands);
3046 del_pset(visited_users);
3047 pset_remove_ptr(visited, irn);
3050 } else if(pset_count(copies) == 0) {
3056 del_pset(visited_operands);
3059 /* visit all uses which are phis */
3060 foreach_out_edge(irn, edge) {
3061 ir_node *user = edge->src;
3062 int pos = edge->pos;
3063 op_t *op = get_irn_link(user);
3066 if(!is_Phi(user)) continue;
3067 if(!has_reg_class(si, user)) continue;
3068 if(pset_find_ptr(visited_users, user)) continue;
3069 pset_insert_ptr(visited_users, user);
3071 copy = op->attr.live_range.args.copies[pos];
3073 if(user == target) {
3074 if(++paths > MAX_PATHS && pset_count(copies) != 0) {
3075 del_pset(visited_users);
3076 pset_remove_ptr(visited, irn);
3079 pset_insert(copies, INT_TO_PTR(copy), copy);
3080 write_copy_path_cst(si, copies, any_interfere);
3081 pset_remove(copies, INT_TO_PTR(copy), copy);
3082 } else if(!pset_find_ptr(visited, user)) {
3083 pset_insert(copies, INT_TO_PTR(copy), copy);
3084 paths += find_copy_path(si, user, target, any_interfere, copies, visited);
3085 pset_remove(copies, INT_TO_PTR(copy), copy);
3087 if(paths > MAX_PATHS) {
3088 if(pset_count(copies) == 0) {
3092 ir_snprintf(buf, sizeof(buf), "always_copy-%d-%d", any_interfere, copy);
3093 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_equal, 0);
3094 lpp_set_factor_fast(si->lpp, cst, any_interfere, -1.0);
3095 lpp_set_factor_fast(si->lpp, cst, copy, 1.0);
3096 DBG((si->dbg, LEVEL_1, "ALWAYS COPYING %d FOR INTERFERENCE %d\n", copy, any_interfere));
3100 del_pset(visited_users);
3101 pset_remove_ptr(visited, irn);
3104 } else if(pset_count(copies) == 0) {
3110 del_pset(visited_users);
3111 pset_remove_ptr(visited, irn);
3116 gen_copy_constraints(spill_ilp_t * si, const ir_node * a, const ir_node * b, ilp_var_t any_interfere)
3118 pset * copies = pset_new_ptr_default();
3119 pset * visited = pset_new_ptr_default();
3121 find_copy_path(si, a, b, any_interfere, copies, visited);
3129 memcopyhandler(spill_ilp_t * si)
3131 interference_t *interference;
3133 /* teste Speicherwerte auf Interferenz */
3135 DBG((si->dbg, LEVEL_2, "\t calling interferencewalker\n"));
3136 irg_block_walk_graph(si->birg->irg, luke_interferencewalker, NULL, si);
3138 /* now lets emit the ILP unequations for the crap */
3139 set_foreach(si->interferences, interference) {
3141 ilp_var_t interfere, any_interfere;
3142 ilp_cst_t any_interfere_cst, cst;
3143 const ir_node *a = interference->a;
3144 const ir_node *b = interference->b;
3146 /* any_interf <= \sum interf */
3147 ir_snprintf(buf, sizeof(buf), "interfere_%N_%N", a, b);
3148 any_interfere_cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0);
3149 any_interfere = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
3151 lpp_set_factor_fast(si->lpp, any_interfere_cst, any_interfere, 1.0);
3153 list_for_each_entry(irnlist_t, irnlist, &interference->blocklist, list) {
3154 const ir_node *bb = irnlist->irn;
3155 spill_bb_t *spill_bb = get_irn_link(bb);
3160 spilla = set_find_spill(spill_bb->ilp, a);
3163 spillb = set_find_spill(spill_bb->ilp, b);
3166 /* interfere <-> (mem_in_a or spill_a) and (mem_in_b or spill_b): */
3167 /* 1: mem_in_a + mem_in_b + spill_a + spill_b - interfere <= 1 */
3168 /* 2: - mem_in_a - spill_a + interfere <= 0 */
3169 /* 3: - mem_in_b - spill_b + interfere <= 0 */
3170 ir_snprintf(buf, sizeof(buf), "interfere_%N_%N_%N", bb, a, b);
3171 interfere = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
3173 ir_snprintf(buf, sizeof(buf), "interfere_%N_%N_%N-1", bb, a, b);
3174 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 1);
3176 lpp_set_factor_fast(si->lpp, cst, interfere, -1.0);
3177 if(spilla->mem_in != ILP_UNDEF) lpp_set_factor_fast(si->lpp, cst, spilla->mem_in, 1.0);
3178 lpp_set_factor_fast(si->lpp, cst, spilla->spill, 1.0);
3179 if(spillb->mem_in != ILP_UNDEF) lpp_set_factor_fast(si->lpp, cst, spillb->mem_in, 1.0);
3180 lpp_set_factor_fast(si->lpp, cst, spillb->spill, 1.0);
3182 ir_snprintf(buf, sizeof(buf), "interfere_%N_%N_%N-2", bb, a, b);
3183 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0);
3185 lpp_set_factor_fast(si->lpp, cst, interfere, 1.0);
3186 if(spilla->mem_in != ILP_UNDEF) lpp_set_factor_fast(si->lpp, cst, spilla->mem_in, -1.0);
3187 lpp_set_factor_fast(si->lpp, cst, spilla->spill, -1.0);
3189 ir_snprintf(buf, sizeof(buf), "interfere_%N_%N_%N-3", bb, a, b);
3190 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0);
3192 lpp_set_factor_fast(si->lpp, cst, interfere, 1.0);
3193 if(spillb->mem_in != ILP_UNDEF) lpp_set_factor_fast(si->lpp, cst, spillb->mem_in, -1.0);
3194 lpp_set_factor_fast(si->lpp, cst, spillb->spill, -1.0);
3197 lpp_set_factor_fast(si->lpp, any_interfere_cst, interfere, -1.0);
3199 /* any_interfere >= interf */
3200 ir_snprintf(buf, sizeof(buf), "interfere_%N_%N-%N", a, b, bb);
3201 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0);
3203 lpp_set_factor_fast(si->lpp, cst, interfere, 1.0);
3204 lpp_set_factor_fast(si->lpp, cst, any_interfere, -1.0);
3207 /* now that we know whether the two values interfere in memory we can drop constraints to enforce copies */
3208 gen_copy_constraints(si,a,b,any_interfere);
3216 return fabs(x) < 0.00001;
3219 static int mark_remat_nodes_hook(FILE *F, ir_node *n, ir_node *l)
3221 spill_ilp_t *si = get_irg_link(current_ir_graph);
3223 if(pset_find_ptr(si->all_possible_remats, n)) {
3224 op_t *op = (op_t*)get_irn_link(n);
3225 assert(op && op->is_remat);
3227 if(!op->attr.remat.remat->inverse) {
3228 if(op->attr.remat.pre) {
3229 ir_fprintf(F, "color:red info3:\"remat value: %+F\"", op->attr.remat.remat->value);
3231 ir_fprintf(F, "color:orange info3:\"remat2 value: %+F\"", op->attr.remat.remat->value);
3236 op_t *op = (op_t*)get_irn_link(n);
3237 assert(op && op->is_remat);
3239 if(op->attr.remat.pre) {
3240 ir_fprintf(F, "color:cyan info3:\"remat inverse value: %+F\"", op->attr.remat.remat->value);
3242 ir_fprintf(F, "color:lightcyan info3:\"remat2 inverse value: %+F\"", op->attr.remat.remat->value);
3253 dump_graph_with_remats(ir_graph * irg, const char * suffix)
3255 set_dump_node_vcgattr_hook(mark_remat_nodes_hook);
3256 be_dump(irg, suffix, dump_ir_block_graph_sched);
3257 set_dump_node_vcgattr_hook(NULL);
3261 * Edge hook to dump the schedule edges with annotated register pressure.
3264 sched_pressure_edge_hook(FILE *F, ir_node *irn)
3266 if(sched_is_scheduled(irn) && sched_has_prev(irn)) {
3267 ir_node *prev = sched_prev(irn);
3268 fprintf(F, "edge:{sourcename:\"");
3270 fprintf(F, "\" targetname:\"");
3272 fprintf(F, "\" label:\"%d", (int)get_irn_link(irn));
3273 fprintf(F, "\" color:magenta}\n");
3279 dump_ir_block_graph_sched_pressure(ir_graph *irg, const char *suffix)
3281 DUMP_NODE_EDGE_FUNC old_edge_hook = get_dump_node_edge_hook();
3283 dump_consts_local(0);
3284 set_dump_node_edge_hook(sched_pressure_edge_hook);
3285 dump_ir_block_graph(irg, suffix);
3286 set_dump_node_edge_hook(old_edge_hook);
3290 walker_pressure_annotator(ir_node * bb, void * data)
3292 spill_ilp_t *si = data;
3295 pset *live = pset_new_ptr_default();
3298 be_lv_foreach(si->lv, bb, be_lv_state_end, i) {
3299 irn = be_lv_get_irn(si->lv, bb, i);
3301 if (has_reg_class(si, irn)) {
3302 pset_insert_ptr(live, irn);
3306 set_irn_link(bb, INT_TO_PTR(pset_count(live)));
3308 sched_foreach_reverse(bb, irn) {
3310 set_irn_link(irn, INT_TO_PTR(pset_count(live)));
3314 if(has_reg_class(si, irn)) {
3315 pset_remove_ptr(live, irn);
3316 if(is_Proj(irn)) ++projs;
3319 if(!is_Proj(irn)) projs = 0;
3321 for (n=get_irn_arity(irn)-1; n>=0; --n) {
3322 ir_node *arg = get_irn_n(irn, n);
3324 if(has_reg_class(si, arg)) pset_insert_ptr(live, arg);
3326 set_irn_link(irn, INT_TO_PTR(pset_count(live)+projs));
3333 dump_pressure_graph(spill_ilp_t * si, const char *suffix)
3335 be_dump(si->birg->irg, suffix, dump_ir_block_graph_sched_pressure);
3339 connect_all_remats_with_keep(spill_ilp_t * si)
3347 n_remats = pset_count(si->all_possible_remats);
3349 ins = obstack_alloc(si->obst, n_remats * sizeof(*ins));
3352 pset_foreach(si->all_possible_remats, irn) {
3357 si->keep = be_new_Keep(si->cls, si->birg->irg, get_irg_end_block(si->birg->irg), n_remats, ins);
3359 obstack_free(si->obst, ins);
3364 connect_all_spills_with_keep(spill_ilp_t * si)
3373 n_spills = pset_count(si->spills);
3375 ins = obstack_alloc(si->obst, n_spills * sizeof(*ins));
3378 pset_foreach(si->spills, irn) {
3383 keep = be_new_Keep(si->cls, si->birg->irg, get_irg_end_block(si->birg->irg), n_spills, ins);
3385 obstack_free(si->obst, ins);
3389 /** insert a spill at an arbitrary position */
3390 ir_node *be_spill2(const arch_env_t *arch_env, ir_node *irn, ir_node *insert)
3392 ir_node *bl = is_Block(insert) ? insert : get_nodes_block(insert);
3393 ir_graph *irg = get_irn_irg(bl);
3394 ir_node *frame = get_irg_frame(irg);
3397 const arch_register_class_t *cls = arch_get_irn_reg_class(arch_env, irn, -1);
3398 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
3400 spill = be_new_Spill(cls, cls_frame, irg, bl, frame, irn);
3403 * search the right insertion point. a spill of a phi cannot be put
3404 * directly after the phi, if there are some phis behind the one which
3405 * is spilled. Also, a spill of a Proj must be after all Projs of the
3408 * Here's one special case:
3409 * If the spill is in the start block, the spill must be after the frame
3410 * pointer is set up. This is done by setting insert to the end of the block
3411 * which is its default initialization (see above).
3414 if (bl == get_irg_start_block(irg) && sched_get_time_step(frame) >= sched_get_time_step(insert))
3417 for (next = sched_next(insert); is_Phi(next) || is_Proj(next); next = sched_next(insert))
3420 sched_add_after(insert, spill);
3425 delete_remat(spill_ilp_t * si, ir_node * remat) {
3427 ir_node *bad = get_irg_bad(si->birg->irg);
3429 sched_remove(remat);
3431 /* kill links to operands */
3432 for (n=get_irn_arity(remat)-1; n>=-1; --n) {
3433 set_irn_n(remat, n, bad);
3438 clean_remat_info(spill_ilp_t * si)
3442 remat_info_t *remat_info;
3443 ir_node *bad = get_irg_bad(si->birg->irg);
3445 set_foreach(si->remat_info, remat_info) {
3446 if(!remat_info->remats) continue;
3448 pset_foreach(remat_info->remats, remat)
3450 if(remat->proj && get_irn_n_edges(remat->proj) == 0) {
3451 if(sched_is_scheduled(remat->proj)) {
3452 sched_remove((ir_node*)remat->proj);
3454 set_irn_n((ir_node*)remat->proj, -1, bad);
3455 set_irn_n((ir_node*)remat->proj, 0, bad);
3458 if(get_irn_n_edges(remat->op) == 0) {
3459 if(sched_is_scheduled(remat->op)) {
3460 sched_remove((ir_node*)remat->op);
3462 for (n=get_irn_arity(remat->op)-1; n>=-1; --n) {
3463 set_irn_n((ir_node*)remat->op, n, bad);
3468 if(remat_info->remats) del_pset(remat_info->remats);
3469 if(remat_info->remats_by_operand) del_pset(remat_info->remats_by_operand);
3474 delete_unnecessary_remats(spill_ilp_t * si)
3476 if(opt_keep_alive & KEEPALIVE_REMATS) {
3478 ir_node *bad = get_irg_bad(si->birg->irg);
3481 for (n=get_irn_arity(si->keep)-1; n>=0; --n) {
3482 ir_node *keep_arg = get_irn_n(si->keep, n);
3483 op_t *arg_op = get_irn_link(keep_arg);
3486 assert(arg_op->is_remat);
3488 name = si->lpp->vars[arg_op->attr.remat.ilp];
3490 if(is_zero(name->value)) {
3491 DBG((si->dbg, LEVEL_3, "\t deleting remat %+F\n", keep_arg));
3492 /* TODO check whether reload is preferred over remat (could be bug) */
3493 delete_remat(si, keep_arg);
3495 if(!arg_op->attr.remat.remat->inverse) {
3496 if(arg_op->attr.remat.pre) {
3497 DBG((si->dbg, LEVEL_2, "\t**remat kept: %+F\n", keep_arg));
3499 DBG((si->dbg, LEVEL_2, "\t%%%%remat2 kept: %+F\n", keep_arg));
3502 if(arg_op->attr.remat.pre) {
3503 DBG((si->dbg, LEVEL_2, "\t**INVERSE remat kept: %+F\n", keep_arg));
3505 DBG((si->dbg, LEVEL_2, "\t%%%%INVERSE remat2 kept: %+F\n", keep_arg));
3510 set_irn_n(si->keep, n, bad);
3513 DBG((si->dbg, LEVEL_2, "\t no remats to delete (none have been inserted)\n"));
3518 pset_foreach(si->all_possible_remats, remat) {
3519 op_t *remat_op = get_irn_link(remat);
3520 lpp_name_t *name = si->lpp->vars[remat_op->attr.remat.ilp];
3522 if(is_zero(name->value)) {
3523 DBG((si->dbg, LEVEL_3, "\t deleting remat %+F\n", remat));
3524 /* TODO check whether reload is preferred over remat (could be bug) */
3525 delete_remat(si, remat);
3527 if(!remat_op->attr.remat.remat->inverse) {
3528 if(remat_op->attr.remat.pre) {
3529 DBG((si->dbg, LEVEL_2, "\t**remat kept: %+F\n", remat));
3531 DBG((si->dbg, LEVEL_2, "\t%%%%remat2 kept: %+F\n", remat));
3534 if(remat_op->attr.remat.pre) {
3535 DBG((si->dbg, LEVEL_2, "\t**INVERSE remat kept: %+F\n", remat));
3537 DBG((si->dbg, LEVEL_2, "\t%%%%INVERSE remat2 kept: %+F\n", remat));
3546 get_spills_for_value(spill_ilp_t * si, const ir_node * value)
3548 pset *spills = pset_new_ptr_default();
3550 const ir_node *next;
3553 defs = set_find_def(si->values, value);
3555 if(defs && defs->spills) {
3556 for(next = defs->spills; next; next = get_irn_link(next)) {
3557 pset_insert_ptr(spills, next);
3565 new_r_PhiM_nokeep(ir_graph * irg, ir_node *block, int arity, ir_node **in)
3569 assert( get_irn_arity(block) == arity );
3571 res = new_ir_node(NULL, irg, block, op_Phi, mode_M, arity, in);
3572 res->attr.phi_backedge = new_backedge_arr(irg->obst, arity);
3578 * @param before The node after which the spill will be placed in the schedule
3581 insert_spill(spill_ilp_t * si, ir_node * irn, const ir_node * value, ir_node * before)
3585 const arch_env_t *arch_env = si->birg->main_env->arch_env;
3587 DBG((si->dbg, LEVEL_3, "\t inserting spill for value %+F after %+F\n", irn, before));
3589 spill = be_spill2(arch_env, irn, before);
3591 defs = set_insert_def(si->values, value);
3594 /* enter into the linked list */
3595 set_irn_link(spill, defs->spills);
3596 defs->spills = spill;
3598 if(opt_keep_alive & KEEPALIVE_SPILLS)
3599 pset_insert_ptr(si->spills, spill);
3605 * @param before The Phi node which has to be spilled
3608 insert_mem_phi(spill_ilp_t * si, ir_node * phi)
3615 NEW_ARR_A(ir_node*, ins, get_irn_arity(phi));
3617 for(n=get_irn_arity(phi)-1; n>=0; --n) {
3618 ins[n] = si->m_unknown;
3621 mem_phi = new_r_PhiM_nokeep(si->birg->irg, get_nodes_block(phi), get_irn_arity(phi), ins);
3623 defs = set_insert_def(si->values, phi);
3626 /* enter into the linked list */
3627 set_irn_link(mem_phi, defs->spills);
3628 defs->spills = mem_phi;
3630 #ifdef SCHEDULE_PHIM
3631 sched_add_after(phi, mem_phi);
3633 pset_insert_ptr(si->phims, mem_phi);
3636 if(opt_keep_alive & KEEPALIVE_SPILLS)
3637 pset_insert_ptr(si->spills, mem_phi);
3644 * Add remat to list of defs, destroys link field!
3647 insert_remat(spill_ilp_t * si, ir_node * remat)
3650 op_t *remat_op = get_irn_link(remat);
3652 assert(remat_op->is_remat);
3654 defs = set_insert_def(si->values, remat_op->attr.remat.remat->value);
3657 /* enter into the linked list */
3658 set_irn_link(remat, defs->remats);
3659 defs->remats = remat;
3664 * Add reload before operation and add to list of defs
3667 insert_reload(spill_ilp_t * si, const ir_node * value, ir_node * after)
3672 const arch_env_t *arch_env = si->birg->main_env->arch_env;
3674 DBG((si->dbg, LEVEL_3, "\t inserting reload for value %+F before %+F\n", value, after));
3676 defs = set_find_def(si->values, value);
3678 spill = defs->spills;
3679 assert(spill && "no spill placed before reload");
3681 reload = be_reload(arch_env, si->cls, after, get_irn_mode(value), spill);
3683 /* enter into the linked list */
3684 set_irn_link(reload, defs->remats);
3685 defs->remats = reload;
3690 void perform_memory_operand(spill_ilp_t * si, memoperand_t * memoperand)
3693 ir_node *value = get_irn_n(memoperand->irn, memoperand->pos);
3695 const arch_env_t *arch_env = si->birg->main_env->arch_env;
3697 DBG((si->dbg, LEVEL_2, "\t inserting memory operand for value %+F at %+F\n", value, memoperand->irn));
3699 defs = set_find_def(si->values, value);
3701 spill = defs->spills;
3702 assert(spill && "no spill placed before reload");
3704 arch_perform_memory_operand(arch_env, memoperand->irn, spill, memoperand->pos);
3707 void insert_memoperands(spill_ilp_t * si)
3709 memoperand_t *memoperand;
3712 set_foreach(si->memoperands, memoperand) {
3713 name = si->lpp->vars[memoperand->ilp];
3714 if(!is_zero(name->value)) {
3715 perform_memory_operand(si, memoperand);
3721 walker_spill_placer(ir_node * bb, void * data) {
3722 spill_ilp_t *si = (spill_ilp_t*)data;
3724 spill_bb_t *spill_bb = get_irn_link(bb);
3725 pset *spills_to_do = pset_new_ptr_default();
3728 set_foreach(spill_bb->ilp, spill) {
3731 if(is_Phi(spill->irn) && get_nodes_block(spill->irn) == bb) {
3732 name = si->lpp->vars[spill->mem_in];
3733 if(!is_zero(name->value)) {
3736 mem_phi = insert_mem_phi(si, spill->irn);
3738 DBG((si->dbg, LEVEL_2, "\t >>spilled Phi %+F -> %+F\n", spill->irn, mem_phi));
3742 name = si->lpp->vars[spill->spill];
3743 if(!is_zero(name->value)) {
3744 /* place spill directly after definition */
3745 if(get_nodes_block(spill->irn) == bb) {
3746 insert_spill(si, spill->irn, spill->irn, spill->irn);
3750 /* place spill at bb start */
3751 if(spill->reg_in > 0) {
3752 name = si->lpp->vars[spill->reg_in];
3753 if(!is_zero(name->value)) {
3754 insert_spill(si, spill->irn, spill->irn, bb);
3758 /* place spill after a remat */
3759 pset_insert_ptr(spills_to_do, spill->irn);
3762 DBG((si->dbg, LEVEL_3, "\t %d spills to do in block %+F\n", pset_count(spills_to_do), bb));
3765 for(irn = sched_block_first_nonphi(bb); !sched_is_end(irn); irn = sched_next(irn)) {
3766 op_t *op = get_irn_link(irn);
3768 if(be_is_Spill(irn)) continue;
3771 /* TODO fix this if we want to support remats with more than two nodes */
3772 if(get_irn_mode(irn) != mode_T && pset_find_ptr(spills_to_do, op->attr.remat.remat->value)) {
3773 pset_remove_ptr(spills_to_do, op->attr.remat.remat->value);
3775 insert_spill(si, irn, op->attr.remat.remat->value, irn);
3778 if(pset_find_ptr(spills_to_do, irn)) {
3779 pset_remove_ptr(spills_to_do, irn);
3781 insert_spill(si, irn, irn, irn);
3787 assert(pset_count(spills_to_do) == 0);
3789 /* afterwards free data in block */
3790 del_pset(spills_to_do);
3794 insert_mem_copy(spill_ilp_t * si, ir_node * bb, ir_node * value)
3796 ir_node *insert_pos = bb;
3798 const arch_env_t *arch_env = si->birg->main_env->arch_env;
3800 /* find last definition of arg value in block */
3805 defs = set_find_def(si->values, value);
3807 if(defs && defs->remats) {
3808 for(next = defs->remats; next; next = get_irn_link(next)) {
3809 if(get_nodes_block(next) == bb && sched_get_time_step(next) > last) {
3810 last = sched_get_time_step(next);
3816 if(get_nodes_block(value) == bb && sched_get_time_step(value) > last) {
3817 last = sched_get_time_step(value);
3821 DBG((si->dbg, LEVEL_2, "\t inserting mem copy for value %+F after %+F\n", value, insert_pos));
3823 spill = be_spill2(arch_env, is_Block(insert_pos)?value:insert_pos, insert_pos);
3829 phim_fixer(spill_ilp_t *si) {
3832 set_foreach(si->values, defs) {
3833 const ir_node *phi = defs->value;
3834 op_t *op = get_irn_link(phi);
3835 ir_node *phi_m = NULL;
3836 ir_node *next = defs->spills;
3839 if(!is_Phi(phi)) continue;
3842 if(is_Phi(next) && get_irn_mode(next) == mode_M) {
3846 next = get_irn_link(next);
3849 if(!phi_m) continue;
3851 for(n=get_irn_arity(phi)-1; n>=0; --n) {
3852 ir_node *value = get_irn_n(phi, n);
3853 defs_t *val_defs = set_find_def(si->values, value);
3855 /* a spill of this value */
3860 ir_node *pred = get_Block_cfgpred_block(get_nodes_block(phi), n);
3861 lpp_name_t *name = si->lpp->vars[op->attr.live_range.args.copies[n]];
3863 if(!is_zero(name->value)) {
3864 spill = insert_mem_copy(si, pred, value);
3866 spill = val_defs->spills;
3869 spill = val_defs->spills;
3872 assert(spill && "no spill placed before PhiM");
3873 set_irn_n(phi_m, n, spill);
3879 walker_reload_placer(ir_node * bb, void * data) {
3880 spill_ilp_t *si = (spill_ilp_t*)data;
3882 spill_bb_t *spill_bb = get_irn_link(bb);
3884 /* reloads at end of block */
3885 if(spill_bb->reloads) {
3888 set_foreach(spill_bb->reloads, keyval) {
3889 ir_node *irn = (ir_node*)keyval->key;
3890 ilp_var_t reload = PTR_TO_INT(keyval->val);
3893 name = si->lpp->vars[reload];
3894 if(!is_zero(name->value)) {
3896 ir_node *insert_pos = bb;
3897 ir_node *prev = sched_block_last_noncf(si, bb);
3898 op_t *prev_op = get_irn_link(prev);
3900 while(be_is_Spill(prev)) {
3901 prev = sched_prev(prev);
3904 prev_op = get_irn_link(prev);
3906 /* insert reload before pre-remats */
3907 while(!sched_is_end(prev) && !be_is_Reload(prev) && !is_Phi(prev)
3908 && prev_op->is_remat && prev_op->attr.remat.pre) {
3912 prev = sched_prev(prev);
3913 } while(be_is_Spill(prev));
3915 prev_op = get_irn_link(prev);
3919 reload = insert_reload(si, irn, insert_pos);
3921 if(opt_keep_alive & KEEPALIVE_RELOADS)
3922 pset_insert_ptr(si->spills, reload);
3927 /* walk and insert more reloads and collect remats */
3928 sched_foreach_reverse(bb, irn) {
3929 op_t *op = get_irn_link(irn);
3931 if(be_is_Reload(irn) || be_is_Spill(irn)) continue;
3932 if(is_Phi(irn)) break;
3935 if(get_irn_mode(irn) != mode_T) {
3936 insert_remat(si, irn);
3941 for (n=get_irn_arity(irn)-1; n>=0; --n) {
3942 ir_node *arg = get_irn_n(irn, n);
3944 if(op->attr.live_range.args.reloads && op->attr.live_range.args.reloads[n] != ILP_UNDEF) {
3947 name = si->lpp->vars[op->attr.live_range.args.reloads[n]];
3948 if(!is_zero(name->value)) {
3950 ir_node *insert_pos = irn;
3951 ir_node *prev = sched_prev(insert_pos);
3954 while(be_is_Spill(prev)) {
3955 prev = sched_prev(prev);
3958 prev_op = get_irn_link(prev);
3960 /* insert reload before pre-remats */
3961 while(!sched_is_end(prev) && !be_is_Reload(prev) && !is_Phi(prev)
3962 && prev_op->is_remat && prev_op->attr.remat.pre) {
3966 prev = sched_prev(prev);
3967 } while(be_is_Spill(prev));
3969 prev_op = get_irn_link(prev);
3973 reload = insert_reload(si, arg, insert_pos);
3975 assert(reload && "no reload returned");
3976 set_irn_n(irn, n, reload);
3978 if(opt_keep_alive & KEEPALIVE_RELOADS)
3979 pset_insert_ptr(si->spills, reload);
3986 del_set(spill_bb->ilp);
3987 if(spill_bb->reloads) del_set(spill_bb->reloads);
3991 walker_collect_used(ir_node * irn, void * data)
3993 bitset_t *used = data;
3995 bitset_set(used, get_irn_idx(irn));
3998 struct kill_helper {
4004 walker_kill_unused(ir_node * bb, void * data)
4006 struct kill_helper *kh = data;
4007 ir_node *bad = get_irg_bad(get_irn_irg(bb));
4011 for(irn=sched_first(bb); !sched_is_end(irn);) {
4012 ir_node *next = sched_next(irn);
4015 if(!bitset_is_set(kh->used, get_irn_idx(irn))) {
4016 if(be_is_Spill(irn) || be_is_Reload(irn)) {
4017 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)));
4019 assert(lpp_get_sol_state(kh->si->lpp) != lpp_optimal && "optimal solution is suboptimal?");
4025 set_nodes_block(irn, bad);
4026 for (n=get_irn_arity(irn)-1; n>=0; --n) {
4027 set_irn_n(irn, n, bad);
4034 #ifndef SCHEDULE_PHIM
4036 kill_unused_phims(spill_ilp_t * si, struct kill_helper * kh)
4039 ir_node *bad = get_irg_bad(si->birg->irg);
4042 pset_foreach(si->phims, phi) {
4043 if(!bitset_is_set(kh->used, get_irn_idx(phi))) {
4045 set_nodes_block(phi, bad);
4046 for (n=get_irn_arity(phi)-1; n>=0; --n) {
4047 set_irn_n(phi, n, bad);
4055 kill_all_unused_values_in_schedule(spill_ilp_t * si)
4057 struct kill_helper kh;
4059 kh.used = bitset_malloc(get_irg_last_idx(si->birg->irg));
4062 irg_walk_graph(si->birg->irg, walker_collect_used, NULL, kh.used);
4063 #ifndef SCHEDULE_PHIM
4064 kill_unused_phims(si, &kh);
4066 irg_block_walk_graph(si->birg->irg, walker_kill_unused, NULL, &kh);
4068 bitset_free(kh.used);
4072 print_irn_pset(pset * p)
4076 pset_foreach(p, irn) {
4077 ir_printf("%+F\n", irn);
4082 dump_phi_class(spill_ilp_t *si, ir_node **phiclass, const char * file)
4084 FILE *f = fopen(file, "w");
4086 interference_t *interference;
4089 set_break(si->interferences);
4091 ir_fprintf(f, "digraph phiclass {\n");
4093 for (i = ARR_LEN(phiclass) - 1; i >= 0; --i) {
4096 ir_fprintf(f, " %F%N [shape=box]\n", irn, irn);
4099 for (i = ARR_LEN(phiclass) - 1; i >= 0; --i) {
4106 for (n = get_irn_arity(irn) - 1; n >= 0; --n) {
4107 ir_node *arg = get_irn_n(irn, n);
4109 ir_fprintf(f, " %F%N -> %F%N\n", irn, irn, arg, arg);
4113 set_foreach(si->interferences, interference) {
4114 const ir_node *a = interference->a;
4115 const ir_node *b = interference->b;
4116 if (get_phi_class(si->pc, (ir_node *)a) == phiclass) {
4117 ir_fprintf(f, " %F%N -> %F%N [color=red,dir=none,style=bold]\n", a, a, b, b);
4126 rewire_uses(spill_ilp_t * si)
4129 pset *ignore = pset_new_ptr(1);
4130 be_dom_front_info_t *dom_front = si->birg->dom_front;
4132 pset_insert_ptr(ignore, get_irg_end(si->birg->irg));
4134 /* then fix uses of spills */
4135 set_foreach(si->values, defs) {
4138 const ir_node *next = defs->remats;
4141 reloads = pset_new_ptr_default();
4144 if(be_is_Reload(next)) {
4145 pset_insert_ptr(reloads, next);
4149 next = get_irn_link(next);
4152 spills = get_spills_for_value(si, defs->value);
4153 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));
4154 if(pset_count(spills) > 1) {
4155 //assert(pset_count(reloads) > 0);
4156 // print_irn_pset(spills);
4157 // print_irn_pset(reloads);
4159 be_ssa_constr_set_ignore(dom_front, si->lv, spills, ignore);
4166 /* first fix uses of remats and reloads */
4167 set_foreach(si->values, defs) {
4169 const ir_node *next = defs->remats;
4173 nodes = pset_new_ptr_default();
4174 if(sched_is_scheduled(defs->value)) {
4175 pset_insert_ptr(nodes, defs->value);
4180 pset_insert_ptr(nodes, next);
4181 next = get_irn_link(next);
4184 DBG((si->dbg, LEVEL_4, "\t %d new definitions for value %+F\n", pset_count(nodes)-orig_kept, defs->value));
4185 be_ssa_constr_set(dom_front, si->lv, nodes);
4191 // remove_unused_defs(si);
4196 writeback_results(spill_ilp_t * si)
4198 /* walk through the graph and collect all spills, reloads and remats for a value */
4200 si->values = new_set(cmp_defs, 4096);
4202 DBG((si->dbg, LEVEL_1, "Applying results\n"));
4203 delete_unnecessary_remats(si);
4204 si->m_unknown = new_r_Unknown(si->birg->irg, mode_M);
4205 irg_block_walk_graph(si->birg->irg, walker_spill_placer, NULL, si);
4206 irg_block_walk_graph(si->birg->irg, walker_reload_placer, NULL, si);
4208 insert_memoperands(si);
4211 /* clean the remat info! there are still back-edges leading there! */
4212 clean_remat_info(si);
4216 connect_all_spills_with_keep(si);
4218 del_set(si->values);
4222 get_n_regs(spill_ilp_t * si)
4224 int arch_n_regs = arch_register_class_n_regs(si->cls);
4226 bitset_t *arch_regs = bitset_malloc(arch_n_regs);
4227 bitset_t *abi_regs = bitset_malloc(arch_n_regs);
4229 arch_put_non_ignore_regs(si->birg->main_env->arch_env, si->cls, arch_regs);
4230 be_abi_put_ignore_regs(si->birg->abi, si->cls, abi_regs);
4232 bitset_andnot(arch_regs, abi_regs);
4233 arch_n_regs = bitset_popcnt(arch_regs);
4235 bitset_free(arch_regs);
4236 bitset_free(abi_regs);
4238 DBG((si->dbg, LEVEL_1, "\tArchitecture has %d free registers in class %s\n", arch_n_regs, si->cls->name));
4243 walker_reload_mover(ir_node * bb, void * data)
4245 spill_ilp_t *si = data;
4248 sched_foreach(bb, tmp) {
4249 if(be_is_Reload(tmp) && has_reg_class(si, tmp)) {
4250 ir_node *reload = tmp;
4253 /* move reload upwards */
4255 int pressure = (int)get_irn_link(reload);
4256 if(pressure < si->n_regs) {
4257 irn = sched_prev(reload);
4258 DBG((si->dbg, LEVEL_5, "regpressure before %+F: %d\n", reload, pressure));
4259 sched_remove(reload);
4260 pressure = (int)get_irn_link(irn);
4262 while(pressure < si->n_regs) {
4263 if( sched_is_end(irn) ||
4264 (be_is_Reload(irn) && has_reg_class(si, irn)) ||
4265 /* do not move reload before its spill */
4266 (irn == be_get_Reload_mem(reload)) ||
4267 /* do not move before phi */
4270 set_irn_link(irn, INT_TO_PTR(pressure+1));
4271 DBG((si->dbg, LEVEL_5, "new regpressure before %+F: %d\n", irn, pressure+1));
4272 irn = sched_prev(irn);
4274 pressure = (int)get_irn_link(irn);
4277 DBG((si->dbg, LEVEL_3, "putting reload %+F after %+F\n", reload, irn));
4278 sched_put_after(irn, reload);
4285 move_reloads_upward(spill_ilp_t * si)
4287 irg_block_walk_graph(si->birg->irg, walker_reload_mover, NULL, si);
4292 * Walk all irg blocks and check for interfering spills inside of phi classes
4295 luke_meminterferencechecker(ir_node * bb, void * data)
4297 spill_ilp_t *si = (spill_ilp_t*)data;
4300 be_lv_foreach(si->lv, bb, be_lv_state_end | be_lv_state_out | be_lv_state_in, l1) {
4301 ir_node *a = be_lv_get_irn(si->lv, bb, l1);
4303 if (! be_is_Spill(a) && (!is_Phi(a) || get_irn_mode(a) != mode_T))
4306 /* a is only interesting if it is in my register class and if it is inside a phi class */
4307 if (has_reg_class(si, a) && get_phi_class(si->pc, a)) {
4308 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)) {
4309 ir_node *b = be_lv_get_irn(si->lv, bb, l2);
4311 if (! be_is_Spill(b) && (! is_Phi(b) || get_irn_mode(b) != mode_T))
4314 /* a and b are only interesting if they are in the same phi class */
4315 if (has_reg_class(si, b) && get_phi_class(si->pc, a) == get_phi_class(si->pc, b)) {
4316 if (values_interfere_in_block(si, bb, a, b)) {
4317 ir_fprintf(stderr, "$$ Spills interfere in %+F: %+F, %+F \t$$\n", bb, a, b);
4326 verify_phiclasses(spill_ilp_t * si)
4328 /* analyze phi classes */
4329 phi_class_free(si->pc);
4330 si->pc = phi_class_new_from_irg(si->birg->irg, 0);
4332 DBG((si->dbg, LEVEL_2, "\t calling memory interference checker\n"));
4333 irg_block_walk_graph(si->birg->irg, luke_meminterferencechecker, NULL, si);
4337 be_spill_remat(be_irg_t *birg, const arch_register_class_t *cls)
4340 char problem_name[256];
4341 char dump_suffix[256];
4342 char dump_suffix2[256];
4343 struct obstack obst;
4345 ir_graph *irg = be_get_birg_irg(birg);
4347 ir_snprintf(problem_name, sizeof(problem_name), "%F_%s", irg, cls->name);
4348 ir_snprintf(dump_suffix, sizeof(dump_suffix), "-%s-remats", cls->name);
4349 ir_snprintf(dump_suffix2, sizeof(dump_suffix2), "-%s-pressure", cls->name);
4351 FIRM_DBG_REGISTER(si.dbg, "firm.be.ra.spillremat");
4352 DBG((si.dbg, LEVEL_1, "\n\n\t\t===== Processing %s =====\n\n", problem_name));
4354 if(opt_verify & VERIFY_DOMINANCE)
4355 be_check_dominance(irg);
4357 be_assure_dom_front(birg);
4358 be_assure_liveness(birg);
4360 obstack_init(&obst);
4364 si.lpp = new_lpp(problem_name, lpp_minimize);
4365 si.remat_info = new_set(cmp_remat_info, 4096);
4366 si.interferences = new_set(cmp_interference, 32);
4367 si.memoperands = new_set(cmp_memoperands, 128);
4368 si.all_possible_remats = pset_new_ptr_default();
4369 si.spills = pset_new_ptr_default();
4370 si.inverse_ops = pset_new_ptr_default();
4373 si.n_regs = get_n_regs(&si);
4375 set_irg_link(irg, &si);
4378 /* compute phi classes */
4379 // phi_class_compute(irg);
4381 if(opt_dump_flags & DUMP_STATS)
4382 be_analyze_regpressure(birg, cls, "-pre");
4384 DBG((si.dbg, LEVEL_2, "\t initializing\n"));
4385 irg_block_walk_graph(irg, luke_initializer, NULL, &si);
4388 /* collect remats */
4389 DBG((si.dbg, LEVEL_1, "Collecting remats\n"));
4390 irg_walk_graph(irg, walker_remat_collector, NULL, &si);
4393 /* insert possible remats */
4394 DBG((si.dbg, LEVEL_1, "Inserting possible remats\n"));
4395 irg_block_walk_graph(irg, walker_remat_insertor, NULL, &si);
4396 DBG((si.dbg, LEVEL_2, " -> inserted %d possible remats\n", pset_count(si.all_possible_remats)));
4398 if(opt_keep_alive & KEEPALIVE_REMATS) {
4399 DBG((si.dbg, LEVEL_1, "Connecting remats with keep and dumping\n"));
4400 connect_all_remats_with_keep(&si);
4401 /* dump graph with inserted remats */
4402 dump_graph_with_remats(irg, dump_suffix);
4405 /* insert copies for phi arguments not in my regclass */
4406 irg_walk_graph(irg, walker_regclass_copy_insertor, NULL, &si);
4408 /* recompute liveness */
4409 DBG((si.dbg, LEVEL_1, "Recomputing liveness\n"));
4410 be_liveness_recompute(si.lv);
4413 DBG((si.dbg, LEVEL_1, "\tBuilding ILP\n"));
4414 DBG((si.dbg, LEVEL_2, "\t endwalker\n"));
4415 irg_block_walk_graph(irg, luke_endwalker, NULL, &si);
4417 DBG((si.dbg, LEVEL_2, "\t blockwalker\n"));
4418 irg_block_walk_graph(irg, luke_blockwalker, NULL, &si);
4420 si.pc = phi_class_new_from_irg(birg->irg, 0);
4421 if (opt_memcopies) {
4422 DBG((si.dbg, LEVEL_2, "\t memcopyhandler\n"));
4423 memcopyhandler(&si);
4426 if (opt_dump_flags & DUMP_PROBLEM) {
4428 ir_snprintf(buf, sizeof(buf), "%s-spillremat.ilp", problem_name);
4429 if ((f = fopen(buf, "wt")) != NULL) {
4430 lpp_dump_plain(si.lpp, f);
4435 if (opt_dump_flags & DUMP_MPS) {
4438 ir_snprintf(buf, sizeof(buf), "%s-spillremat.mps", problem_name);
4439 if ((f = fopen(buf, "wt")) != NULL) {
4440 mps_write_mps(si.lpp, s_mps_fixed, f);
4444 ir_snprintf(buf, sizeof(buf), "%s-spillremat.mst", problem_name);
4445 if ((f = fopen(buf, "wt")) != NULL) {
4446 mps_write_mst(si.lpp, s_mps_fixed, f);
4451 lpp_check_startvals(si.lpp);
4454 DBG((si.dbg, LEVEL_1, "\tSolving %s (%d variables, %d constraints)\n", problem_name, si.lpp->var_next, si.lpp->cst_next));
4455 lpp_set_time_limit(si.lpp, opt_timeout);
4458 lpp_set_log(si.lpp, stdout);
4461 lpp_solve_cplex(si.lpp);
4463 lpp_solve_net(si.lpp, LPP_SERVER, LPP_SOLVER);
4465 assert(lpp_is_sol_valid(si.lpp)
4466 && "solution of ILP must be valid");
4468 DBG((si.dbg, LEVEL_1, "\t%s: iterations: %d, solution time: %g, objective function: %g, best bound: %g\n", problem_name, si.lpp->iterations, si.lpp->sol_time, is_zero(si.lpp->objval)?0.0:si.lpp->objval, is_zero(si.lpp->best_bound)?0.0:si.lpp->best_bound));
4470 if(opt_dump_flags & DUMP_SOLUTION) {
4474 ir_snprintf(buf, sizeof(buf), "%s-spillremat.sol", problem_name);
4475 if ((f = fopen(buf, "wt")) != NULL) {
4477 for (i = 0; i < si.lpp->var_next; ++i) {
4478 lpp_name_t *name = si.lpp->vars[i];
4479 fprintf(f, "%20s %4d %10f\n", name->name, name->nr, name->value);
4485 #ifndef SCHEDULE_PHIM
4486 si.phims = pset_new_ptr_default();
4488 writeback_results(&si);
4493 kill_all_unused_values_in_schedule(&si);
4495 #if !defined(SCHEDULE_PHIM) && defined(SOLVE)
4499 if(opt_keep_alive & (KEEPALIVE_SPILLS | KEEPALIVE_RELOADS))
4500 be_dump(irg, "-spills-placed", dump_ir_block_graph);
4502 // move reloads upwards
4503 be_liveness_recompute(si.lv);
4504 irg_block_walk_graph(irg, walker_pressure_annotator, NULL, &si);
4505 move_reloads_upward(&si);
4508 verify_phiclasses(&si);
4511 irg_block_walk_graph(irg, walker_pressure_annotator, NULL, &si);
4513 if(opt_dump_flags & DUMP_PRESSURE)
4514 dump_pressure_graph(&si, dump_suffix2);
4516 if(opt_dump_flags & DUMP_STATS)
4517 be_analyze_regpressure(birg, cls, "-post");
4519 if(opt_verify & VERIFY_DOMINANCE)
4520 be_check_dominance(irg);
4523 del_set(si.interferences);
4524 del_pset(si.inverse_ops);
4525 del_pset(si.all_possible_remats);
4526 del_set(si.memoperands);
4527 del_pset(si.spills);
4529 phi_class_free(si.pc);
4530 obstack_free(&obst, NULL);
4531 DBG((si.dbg, LEVEL_1, "\tdone.\n"));
4534 void be_init_spillremat(void)
4536 static be_spiller_t remat_spiller = {
4539 lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
4540 lc_opt_entry_t *ra_grp = lc_opt_get_grp(be_grp, "ra");
4541 lc_opt_entry_t *chordal_grp = lc_opt_get_grp(ra_grp, "chordal");
4542 lc_opt_entry_t *remat_grp = lc_opt_get_grp(chordal_grp, "remat");
4544 be_register_spiller("remat", &remat_spiller);
4545 lc_opt_add_table(remat_grp, options);
4548 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_spillremat);
4550 #else /* WITH_ILP */
4553 only_that_you_can_compile_without_WITH_ILP_defined(void)
4557 #endif /* WITH_ILP */