1 /** vim: set sw=4 ts=4:
4 * @author Adam M. Szalkowski & Sebastian Hack
6 * ILP based spilling & rematerialization
8 * Copyright (C) 2006 Universitaet Karlsruhe
9 * Released under the GPL
32 #include "phiclass_t.h"
39 #include <lpp/lpp_net.h>
40 #include <lpp/lpp_cplex.h>
41 //#include <lc_pset.h>
42 //#include <libcore/lc_bitset.h>
46 #include "besched_t.h"
52 #include "bespillremat.h"
54 #include "bepressurestat.h"
55 #include "beprofile.h"
57 #include "bechordal_t.h"
60 #include <libcore/lc_opts.h>
61 #include <libcore/lc_opts_enum.h>
62 #endif /* WITH_LIBCORE */
64 #define DUMP_PROBLEM 1
66 #define DUMP_SOLUTION 4
68 #define DUMP_PRESSURE 16
70 #define KEEPALIVE_REMATS 1
71 #define KEEPALIVE_SPILLS 2
72 #define KEEPALIVE_RELOADS 4
74 #define VERIFY_MEMINTERF 1
75 #define VERIFY_DOMINANCE 2
78 #define REMATS_BRIGGS 1
79 #define REMATS_NOINVERSE 2
82 static int opt_dump_flags = 0;
83 static int opt_log = 0;
84 static int opt_keep_alive = 0;
85 static int opt_goodwin = 1;
86 static int opt_memcopies = 1;
87 static int opt_memoperands = 1;
88 static int opt_verify = VERIFY_MEMINTERF;
89 static int opt_remats = REMATS_ALL;
90 static int opt_repair_schedule = 0;
91 static int opt_no_enlarge_liveness = 0;
92 static int opt_timeout = 300;
93 static double opt_cost_reload = 8.0;
94 static double opt_cost_memoperand = 7.0;
95 static double opt_cost_spill = 30.0;
96 static double opt_cost_remat = 1.0;
100 static const lc_opt_enum_mask_items_t dump_items[] = {
101 { "problem", DUMP_PROBLEM },
103 { "solution", DUMP_SOLUTION },
104 { "stats", DUMP_STATS },
105 { "pressure", DUMP_PRESSURE },
109 static lc_opt_enum_mask_var_t dump_var = {
110 &opt_dump_flags, dump_items
113 static const lc_opt_enum_mask_items_t keepalive_items[] = {
114 { "remats", KEEPALIVE_REMATS },
115 { "spills", KEEPALIVE_SPILLS },
116 { "reloads", KEEPALIVE_RELOADS },
120 static lc_opt_enum_mask_var_t keep_alive_var = {
121 &opt_keep_alive, keepalive_items
124 static const lc_opt_enum_mask_items_t remats_items[] = {
125 { "none", REMATS_NONE },
126 { "briggs", REMATS_BRIGGS },
127 { "noinverse", REMATS_NOINVERSE },
128 { "all", REMATS_ALL },
132 static lc_opt_enum_mask_var_t remats_var = {
133 &opt_remats, remats_items
136 static const lc_opt_table_entry_t options[] = {
137 LC_OPT_ENT_ENUM_MASK("keepalive", "keep alive remats, spills or reloads", &keep_alive_var),
139 LC_OPT_ENT_BOOL ("goodwin", "activate goodwin reduction", &opt_goodwin),
140 LC_OPT_ENT_BOOL ("memcopies", "activate memcopy handling", &opt_memcopies),
141 LC_OPT_ENT_BOOL ("memoperands", "activate memoperands", &opt_memoperands),
142 LC_OPT_ENT_ENUM_INT ("remats", "type of remats to insert (none, briggs, noinverse or all)",&remats_var),
143 LC_OPT_ENT_BOOL ("repair_schedule", "repair the schedule by rematting once used nodes",&opt_repair_schedule),
144 LC_OPT_ENT_BOOL ("no_enlage_liveness", "do not enlarge liveness of operands of remats",&opt_no_enlarge_liveness),
146 LC_OPT_ENT_ENUM_MASK("dump", "dump problem, mps, solution, stats or pressure", &dump_var),
147 LC_OPT_ENT_BOOL ("log", "activate the lpp log", &opt_log),
148 LC_OPT_ENT_INT ("timeout", "ILP solver timeout", &opt_timeout),
150 LC_OPT_ENT_DBL ("cost_reload", "cost of a reload", &opt_cost_reload),
151 LC_OPT_ENT_DBL ("cost_memoperand", "cost of a memory operand", &opt_cost_memoperand),
152 LC_OPT_ENT_DBL ("cost_spill", "cost of a spill instruction", &opt_cost_spill),
153 LC_OPT_ENT_DBL ("cost_remat", "cost of a rematerialization", &opt_cost_remat),
157 void be_spill_remat_register_options(lc_opt_entry_t *grp)
159 lc_opt_entry_t *my_grp = lc_opt_get_grp(grp, "remat");
160 lc_opt_add_table(my_grp, options);
165 //#define EXECFREQ_LOOPDEPH /* compute execution frequency from loop depth only */
166 //#define SCHEDULE_PHIM /* insert phim nodes into schedule */
169 //#define SOLVE_LOCAL
170 #define LPP_SERVER "i44pc52"
171 #define LPP_SOLVER "cplex"
174 #define MAX_PATHS INT_MAX
177 typedef struct _spill_ilp_t {
178 const arch_register_class_t *cls;
180 const be_chordal_env_t *chordal_env;
183 struct obstack *obst;
185 pset *all_possible_remats;
188 set *values; /**< for collecting all definitions of values before running ssa-construction */
193 DEBUG_ONLY(firm_dbg_module_t * dbg);
196 typedef int ilp_var_t;
197 typedef int ilp_cst_t;
199 typedef struct _spill_bb_t {
204 typedef struct _remat_t {
205 const ir_node *op; /**< for copy_irn */
206 const ir_node *value; /**< the value which is being recomputed by this remat */
207 const ir_node *proj; /**< not NULL if the above op produces a tuple */
208 int cost; /**< cost of this remat */
209 int inverse; /**< nonzero if this is an inverse remat */
213 * Data to be attached to each IR node. For remats this contains the ilp_var
214 * for this remat and for normal ops this contains the ilp_vars for
215 * reloading each operand
217 typedef struct _op_t {
222 const remat_t *remat; /** the remat this op belongs to */
223 int pre; /** 1, if this is a pressure-increasing remat */
227 ir_node *op; /** the operation this live range belongs to */
236 typedef struct _defs_t {
237 const ir_node *value;
238 ir_node *spills; /**< points to the first spill for this value (linked by link field) */
239 ir_node *remats; /**< points to the first definition for this value (linked by link field) */
242 typedef struct _remat_info_t {
243 const ir_node *irn; /**< the irn to which these remats belong */
244 pset *remats; /**< possible remats for this value */
245 pset *remats_by_operand; /**< remats with this value as operand */
248 typedef struct _keyval_t {
253 typedef struct _spill_t {
262 typedef struct _memoperand_t {
263 ir_node *irn; /**< the irn */
264 unsigned int pos; /**< the position of the argument */
265 ilp_var_t ilp; /**< the ilp var for this memory operand */
269 has_reg_class(const spill_ilp_t * si, const ir_node * irn)
271 return chordal_has_class(si->chordal_env, irn);
276 cmp_remat(const void *a, const void *b)
278 const keyval_t *p = a;
279 const keyval_t *q = b;
280 const remat_t *r = p->val;
281 const remat_t *s = q->val;
285 return !(r == s || r->op == s->op);
289 cmp_remat(const void *a, const void *b)
291 const remat_t *r = a;
292 const remat_t *s = a;
294 return !(r == s || r->op == s->op);
298 cmp_spill(const void *a, const void *b, size_t size)
300 const spill_t *p = a;
301 const spill_t *q = b;
303 // return !(p->irn == q->irn && p->bb == q->bb);
304 return !(p->irn == q->irn);
308 cmp_memoperands(const void *a, const void *b, size_t size)
310 const memoperand_t *p = a;
311 const memoperand_t *q = b;
313 return !(p->irn == q->irn && p->pos == q->pos);
317 set_find_keyval(set * set, const void * key)
322 return set_find(set, &query, sizeof(query), HASH_PTR(key));
326 set_insert_keyval(set * set, void * key, void * val)
332 return set_insert(set, &query, sizeof(query), HASH_PTR(key));
336 set_find_def(set * set, const ir_node * value)
341 return set_find(set, &query, sizeof(query), HASH_PTR(value));
345 set_insert_def(set * set, const ir_node * value)
352 return set_insert(set, &query, sizeof(query), HASH_PTR(value));
355 static memoperand_t *
356 set_insert_memoperand(set * set, ir_node * irn, unsigned int pos, ilp_var_t ilp)
363 return set_insert(set, &query, sizeof(query), HASH_PTR(irn)+pos);
366 static memoperand_t *
367 set_find_memoperand(set * set, const ir_node * irn, unsigned int pos)
371 query.irn = (ir_node*)irn;
373 return set_find(set, &query, sizeof(query), HASH_PTR(irn)+pos);
378 set_find_spill(set * set, const ir_node * value)
382 query.irn = (ir_node*)value;
383 return set_find(set, &query, sizeof(query), HASH_PTR(value));
386 #define pset_foreach(s,i) for((i)=pset_first((s)); (i); (i)=pset_next((s)))
387 #define set_foreach(s,i) for((i)=set_first((s)); (i); (i)=set_next((s)))
388 #define foreach_post_remat(s,i) for((i)=next_post_remat((s)); (i); (i)=next_post_remat((i)))
389 #define foreach_pre_remat(si,s,i) for((i)=next_pre_remat((si),(s)); (i); (i)=next_pre_remat((si),(i)))
390 #define sched_foreach_op(s,i) for((i)=sched_next_op((s));!sched_is_end((i));(i)=sched_next_op((i)))
393 cmp_remat_info(const void *a, const void *b, size_t size)
395 const remat_info_t *p = a;
396 const remat_info_t *q = b;
398 return !(p->irn == q->irn);
402 cmp_defs(const void *a, const void *b, size_t size)
407 return !(p->value == q->value);
411 cmp_keyval(const void *a, const void *b, size_t size)
413 const keyval_t *p = a;
414 const keyval_t *q = b;
416 return !(p->key == q->key);
420 execution_frequency(const spill_ilp_t *si, const ir_node * irn)
423 if(be_profile_has_data())
424 return ((double)be_profile_get_block_execcount(get_block(irn))) + FUDGE;
426 #ifndef EXECFREQ_LOOPDEPH
427 return get_block_execfreq(si->chordal_env->exec_freq, get_block(irn)) + FUDGE;
430 return exp(get_loop_depth(get_irn_loop(irn)) * log(10)) + FUDGE;
432 return exp(get_loop_depth(get_irn_loop(get_nodes_block(irn))) * log(10)) + FUDGE;
437 get_cost(const spill_ilp_t * si, const ir_node * irn)
439 if(be_is_Spill(irn)) {
440 return opt_cost_spill;
441 } else if(be_is_Reload(irn)){
442 return opt_cost_reload;
444 return arch_get_op_estimated_cost(si->chordal_env->birg->main_env->arch_env, irn);
449 * Checks, whether node and its operands have suitable reg classes
452 is_rematerializable(const spill_ilp_t * si, const ir_node * irn)
455 const arch_env_t *arch_env = si->chordal_env->birg->main_env->arch_env;
456 int remat = (arch_irn_get_flags(arch_env, irn) & arch_irn_flags_rematerializable) != 0;
460 ir_fprintf(stderr, " Node %+F is not rematerializable\n", irn);
463 for (n = get_irn_arity(irn)-1; n>=0 && remat; --n) {
464 ir_node *op = get_irn_n(irn, n);
465 remat &= has_reg_class(si, op) || arch_irn_get_flags(arch_env, op) & arch_irn_flags_ignore || (get_irn_op(op) == op_NoMem);
468 // ir_fprintf(stderr, " Argument %d (%+F) of Node %+F has wrong regclass\n", i, op, irn);
475 * Try to create a remat from @p op with destination value @p dest_value
477 static INLINE remat_t *
478 get_remat_from_op(spill_ilp_t * si, const ir_node * dest_value, const ir_node * op)
480 remat_t *remat = NULL;
482 // if(!mode_is_datab(get_irn_mode(dest_value)))
485 if(dest_value == op) {
486 const ir_node *proj = NULL;
488 if(is_Proj(dest_value)) {
489 op = get_Proj_pred(op);
493 if(!is_rematerializable(si, op))
496 remat = obstack_alloc(si->obst, sizeof(*remat));
498 remat->cost = get_cost(si, op);
499 remat->value = dest_value;
503 arch_inverse_t inverse;
506 /* get the index of the operand we want to retrieve by the inverse op */
507 for (n = get_irn_arity(op)-1; n>=0; --n) {
508 ir_node *arg = get_irn_n(op, n);
510 if(arg == dest_value) break;
514 DBG((si->dbg, LEVEL_5, "\t requesting inverse op for argument %d of op %+F\n", n, op));
516 /* else ask the backend to give an inverse op */
517 if(arch_get_inverse(si->chordal_env->birg->main_env->arch_env, op, n, &inverse, si->obst)) {
520 DBG((si->dbg, LEVEL_4, "\t backend gave us an inverse op with %d nodes and cost %d\n", inverse.n, inverse.costs));
522 assert(inverse.n > 0 && "inverse op should have at least one node");
524 for(i=inverse.n-1; i>=0; --i) {
525 pset_insert_ptr(si->inverse_ops, inverse.nodes[i]);
529 remat = obstack_alloc(si->obst, sizeof(*remat));
530 remat->op = inverse.nodes[0];
531 remat->cost = inverse.costs;
532 remat->value = dest_value;
533 remat->proj = (inverse.n==2)?inverse.nodes[1]:NULL;
536 assert(is_Proj(remat->proj));
538 assert(0 && "I can not handle remats with more than 2 nodes");
545 DBG((si->dbg, LEVEL_3, "\t >Found remat %+F for %+F from %+F with %+F\n", remat->op, dest_value, op, remat->proj));
547 DBG((si->dbg, LEVEL_3, "\t >Found remat %+F for %+F from %+F\n", remat->op, dest_value, op));
555 add_remat(const spill_ilp_t * si, const remat_t * remat)
557 remat_info_t *remat_info,
562 assert(remat->value);
564 query.irn = remat->value;
566 query.remats_by_operand = NULL;
567 remat_info = set_insert(si->remat_info, &query, sizeof(query), HASH_PTR(remat->value));
569 if(remat_info->remats == NULL) {
570 remat_info->remats = new_pset(cmp_remat, 4096);
572 pset_insert(remat_info->remats, remat, HASH_PTR(remat->op));
574 /* insert the remat into the remats_be_operand set of each argument of the remat op */
575 for (n = get_irn_arity(remat->op)-1; n>=0; --n) {
576 ir_node *arg = get_irn_n(remat->op, n);
580 query.remats_by_operand = NULL;
581 remat_info = set_insert(si->remat_info, &query, sizeof(query), HASH_PTR(arg));
583 if(remat_info->remats_by_operand == NULL) {
584 remat_info->remats_by_operand = new_pset(cmp_remat, 4096);
586 pset_insert(remat_info->remats_by_operand, remat, HASH_PTR(remat->op));
591 get_irn_n_nonremat_edges(const spill_ilp_t * si, const ir_node * irn)
593 const ir_edge_t *edge = get_irn_out_edge_first(irn);
597 if(!pset_find_ptr(si->inverse_ops, edge->src)) {
600 edge = get_irn_out_edge_next(irn, edge);
607 get_irn_n_nonignore_args(const spill_ilp_t * si, const ir_node * irn)
613 irn = get_Proj_pred(irn);
615 for(n=get_irn_arity(irn)-1; n>=0; --n) {
616 const ir_node *arg = get_irn_n(irn, n);
618 if(has_reg_class(si, arg)) ++ret;
625 get_remats_from_op(spill_ilp_t * si, const ir_node * op)
630 if( has_reg_class(si, op)
631 && (opt_repair_schedule || get_irn_n_nonremat_edges(si, op) > 1)
632 && (opt_remats != REMATS_BRIGGS || get_irn_n_nonignore_args(si, op) == 0)
634 remat = get_remat_from_op(si, op, op);
636 add_remat(si, remat);
640 if(opt_remats == REMATS_ALL) {
641 /* repeat the whole stuff for each remat retrieved by get_remat_from_op(op, arg)
643 for (n = get_irn_arity(op)-1; n>=0; --n) {
644 ir_node *arg = get_irn_n(op, n);
646 if(has_reg_class(si, arg)) {
647 /* try to get an inverse remat */
648 remat = get_remat_from_op(si, arg, op);
650 add_remat(si, remat);
658 value_is_defined_before(const spill_ilp_t * si, const ir_node * pos, const ir_node * val)
661 ir_node *def_block = get_nodes_block(val);
667 /* if pos is at end of a basic block */
669 ret = (pos == def_block || block_dominates(def_block, pos));
670 // ir_fprintf(stderr, "(def(bb)=%d) ", ret);
674 /* else if this is a normal operation */
675 block = get_nodes_block(pos);
676 if(block == def_block) {
677 if(!sched_is_scheduled(val)) return 1;
679 ret = sched_comes_after(val, pos);
680 // ir_fprintf(stderr, "(def(same block)=%d) ",ret);
684 ret = block_dominates(def_block, block);
685 // ir_fprintf(stderr, "(def(other block)=%d) ", ret);
689 static INLINE ir_node *
690 sched_block_last_noncf(const spill_ilp_t * si, const ir_node * bb)
692 return sched_skip((ir_node*)bb, 0, sched_skip_cf_predicator, (void *) si->chordal_env->birg->main_env->arch_env);
696 * Returns first non-Phi node of block @p bb
698 static INLINE ir_node *
699 sched_block_first_nonphi(const ir_node * bb)
701 return sched_skip((ir_node*)bb, 1, sched_skip_phi_predicator, NULL);
705 sched_skip_proj_predicator(const ir_node * irn, void * data)
707 return (is_Proj(irn));
710 static INLINE ir_node *
711 sched_next_nonproj(const ir_node * irn, int forward)
713 return sched_skip((ir_node*)irn, forward, sched_skip_proj_predicator, NULL);
717 * Returns next operation node (non-Proj) after @p irn
718 * or the basic block of this node
720 static INLINE ir_node *
721 sched_next_op(const ir_node * irn)
723 ir_node *next = sched_next(irn);
728 return sched_next_nonproj(next, 1);
732 * Returns previous operation node (non-Proj) before @p irn
733 * or the basic block of this node
735 static INLINE ir_node *
736 sched_prev_op(const ir_node * irn)
738 ir_node *prev = sched_prev(irn);
743 return sched_next_nonproj(prev, 0);
747 sched_put_after(ir_node * insert, ir_node * irn)
749 if(is_Block(insert)) {
750 insert = sched_block_first_nonphi(insert);
752 insert = sched_next_op(insert);
754 sched_add_before(insert, irn);
758 sched_put_before(const spill_ilp_t * si, ir_node * insert, ir_node * irn)
760 if(is_Block(insert)) {
761 insert = sched_block_last_noncf(si, insert);
763 insert = sched_next_nonproj(insert, 0);
764 insert = sched_prev(insert);
766 sched_add_after(insert, irn);
770 * Tells you whether a @p remat can be placed before the irn @p pos
773 can_remat_before(const spill_ilp_t * si, const remat_t * remat, const ir_node * pos, const pset * live)
775 const ir_node *op = remat->op;
781 prev = sched_block_last_noncf(si, pos);
782 prev = sched_next_nonproj(prev, 0);
784 prev = sched_prev_op(pos);
786 /* do not remat if the rematted value is defined immediately before this op */
787 if(prev == remat->op) {
792 /* this should be just fine, the following OP will be using this value, right? */
794 /* only remat AFTER the real definition of a value (?) */
795 if(!value_is_defined_before(si, pos, remat->value)) {
796 // ir_fprintf(stderr, "error(not defined)");
801 for(n=get_irn_arity(op)-1; n>=0 && res; --n) {
802 const ir_node *arg = get_irn_n(op, n);
804 if(opt_no_enlarge_liveness) {
805 if(has_reg_class(si, arg) && live) {
806 res &= pset_find_ptr((pset*)live, arg)?1:0;
808 res &= value_is_defined_before(si, pos, arg);
811 res &= value_is_defined_before(si, pos, arg);
819 * Tells you whether a @p remat can be placed after the irn @p pos
822 can_remat_after(const spill_ilp_t * si, const remat_t * remat, const ir_node * pos, const pset * live)
825 pos = sched_block_first_nonphi(pos);
827 pos = sched_next_op(pos);
830 /* only remat AFTER the real definition of a value (?) */
831 if(!value_is_defined_before(si, pos, remat->value)) {
835 return can_remat_before(si, remat, pos, live);
839 * Collect potetially rematerializable OPs
842 walker_remat_collector(ir_node * irn, void * data)
844 spill_ilp_t *si = data;
846 if(!is_Block(irn) && !is_Phi(irn)) {
847 DBG((si->dbg, LEVEL_4, "\t Processing %+F\n", irn));
848 get_remats_from_op(si, irn);
853 * Inserts a copy of @p irn before @p pos
856 insert_copy_before(const spill_ilp_t * si, const ir_node * irn, ir_node * pos)
861 bb = is_Block(pos)?pos:get_nodes_block(pos);
862 copy = exact_copy(irn);
864 _set_phi_class(copy, NULL);
865 set_nodes_block(copy, bb);
866 sched_put_before(si, pos, copy);
872 * Inserts a copy of @p irn after @p pos
875 insert_copy_after(const spill_ilp_t * si, const ir_node * irn, ir_node * pos)
880 bb = is_Block(pos)?pos:get_nodes_block(pos);
881 copy = exact_copy(irn);
883 _set_phi_class(copy, NULL);
884 set_nodes_block(copy, bb);
885 sched_put_after(pos, copy);
891 insert_remat_after(spill_ilp_t * si, const remat_t * remat, ir_node * pos, const pset * live)
895 if(can_remat_after(si, remat, pos, live)) {
900 DBG((si->dbg, LEVEL_3, "\t >inserting remat2 %+F\n", remat->op));
902 copy = insert_copy_after(si, remat->op, pos);
904 ir_snprintf(buf, sizeof(buf), "remat2_%N_%N", copy, pos);
905 op = obstack_alloc(si->obst, sizeof(*op));
907 op->attr.remat.remat = remat;
908 op->attr.remat.pre = 0;
909 op->attr.remat.ilp = lpp_add_var_default(si->lpp, buf, lpp_binary, remat->cost*execution_frequency(si, pos), 0.0);
911 set_irn_link(copy, op);
912 pset_insert_ptr(si->all_possible_remats, copy);
914 proj_copy = insert_copy_after(si, remat->proj, copy);
915 set_irn_n(proj_copy, 0, copy);
916 set_irn_link(proj_copy, op);
917 pset_insert_ptr(si->all_possible_remats, proj_copy);
929 insert_remat_before(spill_ilp_t * si, const remat_t * remat, ir_node * pos, const pset * live)
933 if(can_remat_before(si, remat, pos, live)) {
938 DBG((si->dbg, LEVEL_3, "\t >inserting remat %+F\n", remat->op));
940 copy = insert_copy_before(si, remat->op, pos);
942 ir_snprintf(buf, sizeof(buf), "remat_%N_%N", copy, pos);
943 op = obstack_alloc(si->obst, sizeof(*op));
945 op->attr.remat.remat = remat;
946 op->attr.remat.pre = 1;
947 op->attr.remat.ilp = lpp_add_var_default(si->lpp, buf, lpp_binary, remat->cost*execution_frequency(si, pos), 0.0);
949 set_irn_link(copy, op);
950 pset_insert_ptr(si->all_possible_remats, copy);
952 proj_copy = insert_copy_after(si, remat->proj, copy);
953 set_irn_n(proj_copy, 0, copy);
954 set_irn_link(proj_copy, op);
955 pset_insert_ptr(si->all_possible_remats, proj_copy);
967 get_block_n_succs(const ir_node *block) {
968 const ir_edge_t *edge;
970 assert(edges_activated(current_ir_graph));
972 edge = get_block_succ_first(block);
976 edge = get_block_succ_next(block, edge);
981 is_start_block(const ir_node * bb)
983 return get_irg_start_block(get_irn_irg(bb)) == bb;
987 is_merge_edge(const ir_node * bb)
989 if(is_start_block(bb))
993 return get_block_n_succs(bb) == 1;
999 is_diverge_edge(const ir_node * bb)
1001 if(is_start_block(bb))
1005 return get_Block_n_cfgpreds(bb) == 1;
1011 get_live_end(spill_ilp_t * si, ir_node * bb, pset * live)
1016 be_lv_foreach(si->lv, bb, be_lv_state_end, i) {
1017 irn = be_lv_get_irn(si->lv, bb, i);
1019 if (has_reg_class(si, irn) && !pset_find_ptr(si->all_possible_remats, irn)) {
1020 pset_insert_ptr(live, irn);
1024 irn = sched_last(bb);
1026 /* all values eaten by control flow operations are also live until the end of the block */
1027 sched_foreach_reverse(bb, irn) {
1030 if(!sched_skip_cf_predicator(irn, si->chordal_env->birg->main_env->arch_env)) break;
1032 for(i=get_irn_arity(irn)-1; i>=0; --i) {
1033 ir_node *arg = get_irn_n(irn,i);
1035 if(has_reg_class(si, arg)) {
1036 pset_insert_ptr(live, arg);
1043 walker_regclass_copy_insertor(ir_node * irn, void * data)
1045 spill_ilp_t *si = data;
1047 if(is_Phi(irn) && has_reg_class(si, irn)) {
1050 for(n=get_irn_arity(irn)-1; n>=0; --n) {
1051 ir_node *phi_arg = get_irn_n(irn, n);
1052 ir_node *bb = get_Block_cfgpred_block(get_nodes_block(irn), n);
1054 if(!has_reg_class(si, phi_arg)) {
1055 ir_node *copy = be_new_Copy(si->cls, si->chordal_env->irg, bb, phi_arg);
1056 ir_node *pos = sched_block_last_noncf(si, bb);
1057 op_t *op = obstack_alloc(si->obst, sizeof(*op));
1059 DBG((si->dbg, LEVEL_2, "\t copy to my regclass for arg %+F of %+F\n", phi_arg, irn));
1060 sched_add_after(pos, copy);
1061 set_irn_n(irn, n, copy);
1064 op->attr.live_range.args.reloads = NULL;
1065 op->attr.live_range.ilp = ILP_UNDEF;
1066 set_irn_link(copy, op);
1073 * Insert (so far unused) remats into the irg to
1074 * recompute the potential liveness of all values
1077 walker_remat_insertor(ir_node * bb, void * data)
1079 spill_ilp_t *si = data;
1086 /* skip start block, no remats to do there */
1087 if(is_start_block(bb)) return;
1089 DBG((si->dbg, LEVEL_3, "\t Entering %+F\n\n", bb));
1091 live = pset_new_ptr_default();
1092 be_lv_foreach(si->lv, bb, be_lv_state_end, i) {
1093 ir_node *value = be_lv_get_irn(si->lv, bb, i);
1095 /* add remats at end of block */
1096 if (has_reg_class(si, value)) {
1097 pset_insert_ptr(live, value);
1101 irn = sched_last(bb);
1102 while(!sched_is_end(irn)) {
1108 next = sched_prev(irn);
1110 /* delete defined value from live set */
1111 if(has_reg_class(si, irn)) {
1112 pset_remove_ptr(live, irn);
1115 if(is_Phi(irn) || is_Proj(irn)) {
1120 args = pset_new_ptr_default();
1121 used = pset_new_ptr_default();
1123 /* collect arguments of op and set args of op already live in epilog */
1124 for (n = get_irn_arity(irn)-1; n>=0; --n) {
1125 ir_node *arg = get_irn_n(irn, n);
1127 pset_insert_ptr(args, arg);
1128 if(has_reg_class(si, arg)) {
1129 pset_insert_ptr(live, arg);
1130 pset_insert_ptr(used, arg);
1134 /* insert all possible remats before irn */
1135 pset_foreach(args, arg) {
1136 remat_info_t *remat_info,
1139 /* continue if the operand has the wrong reg class */
1140 if(!has_reg_class(si, arg))
1144 query.remats = NULL;
1145 query.remats_by_operand = NULL;
1146 remat_info = set_find(si->remat_info, &query, sizeof(query), HASH_PTR(arg));
1152 if(remat_info->remats) {
1153 pset_foreach(remat_info->remats, remat) {
1154 ir_node *remat_irn = NULL;
1156 DBG((si->dbg, LEVEL_4, "\t considering remat %+F for arg %+F\n", remat->op, arg));
1157 remat_irn = insert_remat_before(si, remat, irn, live);
1160 for(n=get_irn_arity(remat_irn)-1; n>=0; --n) {
1161 ir_node *remat_arg = get_irn_n(remat_irn, n);
1163 /* collect args of remats which are not args of op */
1164 if(has_reg_class(si, remat_arg) && !pset_find_ptr(args, remat_arg)) {
1165 pset_insert_ptr(used, remat_arg);
1173 /* do not place post remats after jumps */
1174 if(sched_skip_cf_predicator(irn, si->chordal_env->birg->main_env->arch_env)) {
1180 /* insert all possible remats after irn */
1181 post_remats = pset_new_ptr_default();
1182 pset_foreach(used, arg) {
1183 remat_info_t *remat_info,
1186 /* continue if the operand has the wrong reg class */
1187 if(!has_reg_class(si, arg))
1191 query.remats = NULL;
1192 query.remats_by_operand = NULL;
1193 remat_info = set_find(si->remat_info, &query, sizeof(query), HASH_PTR(arg));
1199 if(remat_info->remats_by_operand) {
1200 pset_foreach(remat_info->remats_by_operand, remat) {
1201 /* do not insert remats producing the same value as one of the operands */
1202 if(!pset_find_ptr(args, remat->value)) {
1203 DBG((si->dbg, LEVEL_4, "\t considering remat %+F with arg %+F\n", remat->op, arg));
1205 /* only remat values that can be used be real ops */
1206 if(pset_find_ptr(live, remat->value)) {
1207 pset_insert_ptr(post_remats, remat);
1213 pset_foreach(post_remats, remat) {
1214 insert_remat_after(si, remat, irn, live);
1216 del_pset(post_remats);
1223 /* add remats at end if successor has multiple predecessors */
1224 if(is_merge_edge(bb)) {
1225 pset *live_out = pset_new_ptr_default();
1228 get_live_end(si, bb, live_out);
1230 /* add remats at end of block */
1231 pset_foreach(live_out, value) {
1232 remat_info_t *remat_info,
1236 query.remats = NULL;
1237 query.remats_by_operand = NULL;
1238 remat_info = set_find(si->remat_info, &query, sizeof(query), HASH_PTR(value));
1240 if(remat_info && remat_info->remats) {
1241 pset_foreach(remat_info->remats, remat) {
1242 DBG((si->dbg, LEVEL_4, "\t considering remat %+F at end of block %+F\n", remat->op, bb));
1244 insert_remat_before(si, remat, bb, live_out);
1251 if(is_diverge_edge(bb)) {
1252 pset *live_in = pset_new_ptr_default();
1255 be_lv_foreach(si->lv, bb, be_lv_state_in, i) {
1256 value = be_lv_get_irn(si->lv, bb, i);
1258 if(has_reg_class(si, value)) {
1259 pset_insert_ptr(live_in, value);
1262 /* add phis to live_in */
1263 sched_foreach(bb, value) {
1264 if(!is_Phi(value)) break;
1266 if(has_reg_class(si, value)) {
1267 pset_insert_ptr(live_in, value);
1271 /* add remat2s at beginning of block */
1272 post_remats = pset_new_ptr_default();
1273 pset_foreach(live_in, value) {
1274 remat_info_t *remat_info,
1278 query.remats = NULL;
1279 query.remats_by_operand = NULL;
1280 remat_info = set_find(si->remat_info, &query, sizeof(query), HASH_PTR(value));
1282 if(remat_info && remat_info->remats_by_operand) {
1283 pset_foreach(remat_info->remats_by_operand, remat) {
1284 DBG((si->dbg, LEVEL_4, "\t considering remat2 %+F at beginning of block %+F\n", remat->op, bb));
1286 /* put the remat here if all its args are available and result is still live */
1287 if(pset_find_ptr(live_in, remat->value)) {
1288 pset_insert_ptr(post_remats, remat);
1293 pset_foreach(post_remats, remat) {
1294 insert_remat_after(si, remat, bb, live_in);
1296 del_pset(post_remats);
1302 can_be_copied(const ir_node * bb, const ir_node * irn)
1304 const ir_edge_t *edge = get_block_succ_first(bb);
1305 const ir_node *next_bb = edge->src;
1306 int pos = edge->pos;
1309 assert(is_merge_edge(bb));
1311 sched_foreach(next_bb, phi) {
1312 const ir_node *phi_arg;
1314 if(!is_Phi(phi)) break;
1316 phi_arg = get_irn_n(phi, pos);
1318 if(phi_arg == irn) {
1326 * Initialize additional node info
1329 luke_initializer(ir_node * bb, void * data)
1331 spill_ilp_t *si = (spill_ilp_t*)data;
1332 spill_bb_t *spill_bb;
1335 spill_bb = obstack_alloc(si->obst, sizeof(*spill_bb));
1336 set_irn_link(bb, spill_bb);
1338 sched_foreach(bb, irn) {
1341 op = obstack_alloc(si->obst, sizeof(*op));
1343 op->attr.live_range.ilp = ILP_UNDEF;
1346 op->attr.live_range.args.copies = obstack_alloc(si->obst, sizeof(*op->attr.live_range.args.copies) * get_irn_arity(irn));
1347 memset(op->attr.live_range.args.copies, 0xFF, sizeof(*op->attr.live_range.args.copies) * get_irn_arity(irn));
1349 } else if(!is_Proj(irn)) {
1350 op->attr.live_range.args.reloads = obstack_alloc(si->obst, sizeof(*op->attr.live_range.args.reloads) * get_irn_arity(irn));
1351 memset(op->attr.live_range.args.reloads, 0xFF, sizeof(*op->attr.live_range.args.reloads) * get_irn_arity(irn));
1353 op->attr.live_range.args.reloads = NULL;
1355 set_irn_link(irn, op);
1361 * Preparation of blocks' ends for Luke Blockwalker(tm)(R)
1364 luke_endwalker(ir_node * bb, void * data)
1366 spill_ilp_t *si = (spill_ilp_t*)data;
1372 spill_bb_t *spill_bb = get_irn_link(bb);
1375 live = pset_new_ptr_default();
1376 use_end = pset_new_ptr_default();
1378 be_lv_foreach(si->lv, bb, be_lv_state_end, i) {
1379 irn = be_lv_get_irn(si->lv, bb, i);
1380 if (has_reg_class(si, irn) && !pset_find_ptr(si->all_possible_remats, irn)) {
1381 pset_insert_ptr(live, irn);
1385 /* collect values used by cond jumps etc. at bb end (use_end) -> always live */
1386 /* their reg_out must always be set */
1387 sched_foreach_reverse(bb, irn) {
1390 if(!sched_skip_cf_predicator(irn, si->chordal_env->birg->main_env->arch_env)) break;
1392 for (n=get_irn_arity(irn)-1; n>=0; --n) {
1393 ir_node *irn_arg = get_irn_n(irn, n);
1395 if(has_reg_class(si, irn_arg)) {
1396 pset_insert_ptr(use_end, irn_arg);
1401 ir_snprintf(buf, sizeof(buf), "check_end_%N", bb);
1402 //cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, si->n_regs);
1403 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, si->n_regs - pset_count(use_end));
1405 spill_bb->ilp = new_set(cmp_spill, pset_count(live)+pset_count(use_end));
1407 /* if this is a merge edge we can reload at the end of this block */
1408 if(is_merge_edge(bb)) {
1409 spill_bb->reloads = new_set(cmp_keyval, pset_count(live)+pset_count(use_end));
1410 } else if(pset_count(use_end)){
1411 spill_bb->reloads = new_set(cmp_keyval, pset_count(use_end));
1413 spill_bb->reloads = NULL;
1416 pset_foreach(live,irn) {
1420 int default_spilled;
1423 /* handle values used by control flow nodes later separately */
1424 if(pset_find_ptr(use_end, irn)) continue;
1427 spill = set_insert(spill_bb->ilp, &query, sizeof(query), HASH_PTR(irn));
1429 spill_cost = is_Unknown(irn)?0.0001:opt_cost_spill*execution_frequency(si, bb);
1431 ir_snprintf(buf, sizeof(buf), "reg_out_%N_%N", irn, bb);
1432 spill->reg_out = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
1433 lpp_set_factor_fast(si->lpp, cst, spill->reg_out, 1.0);
1435 ir_snprintf(buf, sizeof(buf), "mem_out_%N_%N", irn, bb);
1436 spill->mem_out = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
1438 ir_snprintf(buf, sizeof(buf), "spill_%N_%N", irn, bb);
1439 /* by default spill value right after definition */
1440 default_spilled = be_is_live_in(si->lv, bb, irn) || is_Phi(irn);
1441 spill->spill = lpp_add_var_default(si->lpp, buf, lpp_binary, spill_cost, !default_spilled);
1443 if(is_merge_edge(bb)) {
1447 ir_snprintf(buf, sizeof(buf), "reload_%N_%N", bb, irn);
1448 reload = lpp_add_var_default(si->lpp, buf, lpp_binary, opt_cost_reload*execution_frequency(si, bb), can_be_copied(bb, irn));
1449 set_insert_keyval(spill_bb->reloads, irn, INT_TO_PTR(reload));
1451 /* reload <= mem_out */
1452 rel_cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
1453 lpp_set_factor_fast(si->lpp, rel_cst, reload, 1.0);
1454 lpp_set_factor_fast(si->lpp, rel_cst, spill->mem_out, -1.0);
1457 spill->reg_in = ILP_UNDEF;
1458 spill->mem_in = ILP_UNDEF;
1461 pset_foreach(use_end,irn) {
1465 ilp_cst_t end_use_req,
1468 int default_spilled;
1471 spill = set_insert(spill_bb->ilp, &query, sizeof(query), HASH_PTR(irn));
1473 spill_cost = is_Unknown(irn)?0.0001:opt_cost_spill*execution_frequency(si, bb);
1475 ir_snprintf(buf, sizeof(buf), "reg_out_%N_%N", irn, bb);
1476 spill->reg_out = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
1477 /* if irn is used at the end of the block, then it is live anyway */
1478 //lpp_set_factor_fast(si->lpp, cst, spill->reg_out, 1.0);
1480 ir_snprintf(buf, sizeof(buf), "mem_out_%N_%N", irn, bb);
1481 spill->mem_out = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
1483 ir_snprintf(buf, sizeof(buf), "spill_%N_%N", irn, bb);
1484 default_spilled = be_is_live_in(si->lv, bb, irn) || is_Phi(irn);
1485 spill->spill = lpp_add_var_default(si->lpp, buf, lpp_binary, spill_cost, !default_spilled);
1487 /* reload for use be control flow op */
1488 ir_snprintf(buf, sizeof(buf), "reload_%N_%N", bb, irn);
1489 reload = lpp_add_var_default(si->lpp, buf, lpp_binary, opt_cost_reload*execution_frequency(si, bb), 1.0);
1490 set_insert_keyval(spill_bb->reloads, irn, INT_TO_PTR(reload));
1492 /* reload <= mem_out */
1493 rel_cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
1494 lpp_set_factor_fast(si->lpp, rel_cst, reload, 1.0);
1495 lpp_set_factor_fast(si->lpp, rel_cst, spill->mem_out, -1.0);
1497 spill->reg_in = ILP_UNDEF;
1498 spill->mem_in = ILP_UNDEF;
1500 ir_snprintf(buf, sizeof(buf), "req_cf_end_%N_%N", irn, bb);
1501 end_use_req = lpp_add_cst_uniq(si->lpp, buf, lpp_equal, 1);
1502 lpp_set_factor_fast(si->lpp, end_use_req, spill->reg_out, 1.0);
1510 next_post_remat(const ir_node * irn)
1516 next = sched_block_first_nonphi(irn);
1518 next = sched_next_op(irn);
1521 if(sched_is_end(next))
1524 op = get_irn_link(next);
1525 if(op->is_remat && !op->attr.remat.pre) {
1534 next_pre_remat(const spill_ilp_t * si, const ir_node * irn)
1540 ret = sched_block_last_noncf(si, irn);
1541 ret = sched_next(ret);
1542 ret = sched_prev_op(ret);
1544 ret = sched_prev_op(irn);
1547 if(sched_is_end(ret) || is_Phi(ret))
1550 op = (op_t*)get_irn_link(ret);
1551 if(op->is_remat && op->attr.remat.pre) {
1559 * Find a remat of value @p value in the epilog of @p pos
1562 find_post_remat(const ir_node * value, const ir_node * pos)
1564 while((pos = next_post_remat(pos)) != NULL) {
1567 op = get_irn_link(pos);
1568 assert(op->is_remat && !op->attr.remat.pre);
1570 if(op->attr.remat.remat->value == value)
1571 return (ir_node*)pos;
1574 const ir_edge_t *edge;
1575 foreach_out_edge(pos, edge) {
1576 ir_node *proj = get_edge_src_irn(edge);
1577 assert(is_Proj(proj));
1587 add_to_spill_bb(spill_ilp_t * si, ir_node * bb, ir_node * irn)
1589 spill_bb_t *spill_bb = get_irn_link(bb);
1593 int default_spilled;
1596 spill = set_find(spill_bb->ilp, &query, sizeof(query), HASH_PTR(irn));
1598 double spill_cost = is_Unknown(irn)?0.0001:opt_cost_spill*execution_frequency(si, bb);
1600 spill = set_insert(spill_bb->ilp, &query, sizeof(query), HASH_PTR(irn));
1602 spill->reg_out = ILP_UNDEF;
1603 spill->reg_in = ILP_UNDEF;
1604 spill->mem_in = ILP_UNDEF;
1606 ir_snprintf(buf, sizeof(buf), "mem_out_%N_%N", irn, bb);
1607 spill->mem_out = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
1609 ir_snprintf(buf, sizeof(buf), "spill_%N_%N", irn, bb);
1610 default_spilled = be_is_live_in(si->lv, bb, irn) || is_Phi(irn);
1611 spill->spill = lpp_add_var_default(si->lpp, buf, lpp_binary, spill_cost, !default_spilled);
1618 * Inserts ILP-constraints and variables for memory copying before the given position
1621 insert_mem_copy_position(spill_ilp_t * si, pset * live, const ir_node * block)
1623 const ir_node *succ;
1624 const ir_edge_t *edge;
1625 spill_bb_t *spill_bb = get_irn_link(block);
1634 assert(edges_activated(current_ir_graph));
1636 edge = get_block_succ_first(block);
1642 edge = get_block_succ_next(block, edge);
1643 /* next block can only contain phis, if this is a merge edge */
1646 ir_snprintf(buf, sizeof(buf), "copyreg_%N", block);
1647 copyreg = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
1649 ir_snprintf(buf, sizeof(buf), "check_copyreg_%N", block);
1650 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, si->n_regs);
1652 pset_foreach(live, tmp) {
1655 op_t *op = get_irn_link(irn);
1656 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.ilp, 1.0);
1658 spill = set_find_spill(spill_bb->ilp, tmp);
1661 lpp_set_factor_fast(si->lpp, cst, spill->reg_out, 1.0);
1663 lpp_set_factor_fast(si->lpp, cst, copyreg, 1.0);
1665 sched_foreach(succ, phi) {
1666 const ir_node *to_copy;
1668 spill_t *to_copy_spill;
1669 op_t *phi_op = get_irn_link(phi);
1670 ilp_var_t reload = ILP_UNDEF;
1673 if(!is_Phi(phi)) break;
1674 if(!has_reg_class(si, phi)) continue;
1676 to_copy = get_irn_n(phi, pos);
1677 to_copy_op = get_irn_link(to_copy);
1679 to_copy_spill = set_find_spill(spill_bb->ilp, to_copy);
1680 assert(to_copy_spill);
1682 if(spill_bb->reloads) {
1683 keyval_t *keyval = set_find_keyval(spill_bb->reloads, to_copy);
1686 reload = PTR_TO_INT(keyval->val);
1690 ir_snprintf(buf, sizeof(buf), "req_copy_%N_%N_%N", block, phi, to_copy);
1691 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
1693 /* copy - reg_out - reload - remat - live_range <= 0 */
1694 lpp_set_factor_fast(si->lpp, cst, phi_op->attr.live_range.args.copies[pos], 1.0);
1695 lpp_set_factor_fast(si->lpp, cst, to_copy_spill->reg_out, -1.0);
1696 if(reload != ILP_UNDEF) lpp_set_factor_fast(si->lpp, cst, reload, -1.0);
1697 lpp_set_factor_fast(si->lpp, cst, to_copy_op->attr.live_range.ilp, -1.0);
1698 foreach_pre_remat(si, block, tmp) {
1699 op_t *remat_op = get_irn_link(tmp);
1700 if(remat_op->attr.remat.remat->value == to_copy) {
1701 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, -1.0);
1705 ir_snprintf(buf, sizeof(buf), "copyreg_%N_%N_%N", block, phi, to_copy);
1706 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
1708 /* copy - reg_out - copyreg <= 0 */
1709 lpp_set_factor_fast(si->lpp, cst, phi_op->attr.live_range.args.copies[pos], 1.0);
1710 lpp_set_factor_fast(si->lpp, cst, to_copy_spill->reg_out, -1.0);
1711 lpp_set_factor_fast(si->lpp, cst, copyreg, -1.0);
1717 * Walk all irg blocks and emit this ILP
1720 luke_blockwalker(ir_node * bb, void * data)
1722 spill_ilp_t *si = (spill_ilp_t*)data;
1727 spill_bb_t *spill_bb = get_irn_link(bb);
1730 pset *defs = pset_new_ptr_default();
1731 const arch_env_t *arch_env = si->chordal_env->birg->main_env->arch_env;
1733 live = pset_new_ptr_default();
1735 /****************************************
1736 * B A S I C B L O C K E N D
1737 ***************************************/
1740 /* init live values at end of block */
1741 get_live_end(si, bb, live);
1743 pset_foreach(live, irn) {
1745 ilp_var_t reload = ILP_UNDEF;
1747 spill = set_find_spill(spill_bb->ilp, irn);
1750 if(spill_bb->reloads) {
1751 keyval_t *keyval = set_find_keyval(spill_bb->reloads, irn);
1754 reload = PTR_TO_INT(keyval->val);
1758 op = get_irn_link(irn);
1759 assert(!op->is_remat);
1761 ir_snprintf(buf, sizeof(buf), "lr_%N_%N", irn, bb);
1762 op->attr.live_range.ilp = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
1763 op->attr.live_range.op = bb;
1765 ir_snprintf(buf, sizeof(buf), "reg_out_%N_%N", bb, irn);
1766 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
1768 /* reg_out - reload - remat - live_range <= 0 */
1769 lpp_set_factor_fast(si->lpp, cst, spill->reg_out, 1.0);
1770 if(reload != ILP_UNDEF) lpp_set_factor_fast(si->lpp, cst, reload, -1.0);
1771 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.ilp, -1.0);
1772 foreach_pre_remat(si, bb, tmp) {
1773 op_t *remat_op = get_irn_link(tmp);
1774 if(remat_op->attr.remat.remat->value == irn) {
1775 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, -1.0);
1778 ir_snprintf(buf, sizeof(buf), "reg_out2_%N_%N", bb, irn);
1779 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_greater, 0.0);
1781 /* value may only die at bb end if it is used for a mem copy */
1782 /* reg_out + \sum copy - reload - remat - live_range >= 0 */
1783 lpp_set_factor_fast(si->lpp, cst, spill->reg_out, 1.0);
1784 if(reload != ILP_UNDEF) lpp_set_factor_fast(si->lpp, cst, reload, -1.0);
1785 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.ilp, -1.0);
1786 foreach_pre_remat(si, bb, tmp) {
1787 op_t *remat_op = get_irn_link(tmp);
1788 if(remat_op->attr.remat.remat->value == irn) {
1789 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, -1.0);
1792 if(is_merge_edge(bb)) {
1793 const ir_edge_t *edge = get_block_succ_first(bb);
1794 const ir_node *next_bb = edge->src;
1795 int pos = edge->pos;
1798 sched_foreach(next_bb, phi) {
1799 const ir_node *phi_arg;
1801 if(!is_Phi(phi)) break;
1803 phi_arg = get_irn_n(phi, pos);
1805 if(phi_arg == irn) {
1806 op_t *phi_op = get_irn_link(phi);
1807 ilp_var_t copy = phi_op->attr.live_range.args.copies[pos];
1809 lpp_set_factor_fast(si->lpp, cst, copy, 1.0);
1816 insert_mem_copy_position(si, live, bb);
1819 * start new live ranges for values used by remats at end of block
1820 * and assure the remat args are available
1822 foreach_pre_remat(si, bb, tmp) {
1823 op_t *remat_op = get_irn_link(tmp);
1826 for (n=get_irn_arity(tmp)-1; n>=0; --n) {
1827 ir_node *remat_arg = get_irn_n(tmp, n);
1828 op_t *arg_op = get_irn_link(remat_arg);
1831 if(!has_reg_class(si, remat_arg)) continue;
1833 /* if value is becoming live through use by remat */
1834 if(!pset_find_ptr(live, remat_arg)) {
1835 ir_snprintf(buf, sizeof(buf), "lr_%N_end%N", remat_arg, bb);
1836 prev_lr = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
1838 arg_op->attr.live_range.ilp = prev_lr;
1839 arg_op->attr.live_range.op = bb;
1841 DBG((si->dbg, LEVEL_4, " value %+F becoming live through use by remat at end of block %+F\n", remat_arg, tmp));
1843 pset_insert_ptr(live, remat_arg);
1844 add_to_spill_bb(si, bb, remat_arg);
1847 /* remat <= live_rang(remat_arg) [ + reload(remat_arg) ] */
1848 ir_snprintf(buf, sizeof(buf), "req_remat_%N_arg_%N", tmp, remat_arg);
1849 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1851 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
1852 lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, -1.0);
1854 /* use reload placed for this argument */
1855 if(spill_bb->reloads) {
1856 keyval_t *keyval = set_find_keyval(spill_bb->reloads, remat_arg);
1859 ilp_var_t reload = PTR_TO_INT(keyval->val);
1861 lpp_set_factor_fast(si->lpp, cst, reload, -1.0);
1866 DBG((si->dbg, LEVEL_4, "\t %d values live at end of block %+F\n", pset_count(live), bb));
1871 /**************************************
1872 * B A S I C B L O C K B O D Y
1873 **************************************/
1875 sched_foreach_reverse_from(sched_block_last_noncf(si, bb), irn) {
1881 ilp_cst_t check_pre,
1887 ilp_cst_t one_memoperand;
1889 /* iterate only until first phi */
1893 op = get_irn_link(irn);
1895 if(op->is_remat) continue;
1897 DBG((si->dbg, LEVEL_4, "\t at node %+F\n", irn));
1899 /* collect defined values */
1900 if(has_reg_class(si, irn)) {
1901 pset_insert_ptr(defs, irn);
1905 if(is_Proj(irn)) continue;
1908 * init set of irn's arguments
1909 * and all possibly used values around this op
1910 * and values defined by post remats
1912 args = new_set(cmp_keyval, get_irn_arity(irn));
1913 used = pset_new_ptr(pset_count(live) + get_irn_arity(irn));
1914 remat_defs = pset_new_ptr(pset_count(live));
1916 if(!is_start_block(bb) || !be_is_Barrier(irn)) {
1917 for (n=get_irn_arity(irn)-1; n>=0; --n) {
1918 ir_node *irn_arg = get_irn_n(irn, n);
1919 if(has_reg_class(si, irn_arg)) {
1920 set_insert_keyval(args, irn_arg, (void*)n);
1921 pset_insert_ptr(used, irn_arg);
1924 foreach_post_remat(irn, tmp) {
1925 op_t *remat_op = get_irn_link(tmp);
1927 pset_insert_ptr(remat_defs, remat_op->attr.remat.remat->value);
1929 for (n=get_irn_arity(tmp)-1; n>=0; --n) {
1930 ir_node *remat_arg = get_irn_n(tmp, n);
1931 if(has_reg_class(si, remat_arg)) {
1932 pset_insert_ptr(used, remat_arg);
1936 foreach_pre_remat(si, irn, tmp) {
1937 for (n=get_irn_arity(tmp)-1; n>=0; --n) {
1938 ir_node *remat_arg = get_irn_n(tmp, n);
1939 if(has_reg_class(si, remat_arg)) {
1940 pset_insert_ptr(used, remat_arg);
1946 /**********************************
1947 * I N E P I L O G O F irn
1948 **********************************/
1950 /* ensure each dying value is used by only one post remat */
1951 pset_foreach(used, tmp) {
1952 ir_node *value = tmp;
1953 op_t *value_op = get_irn_link(value);
1958 foreach_post_remat(irn, remat) {
1959 op_t *remat_op = get_irn_link(remat);
1961 for(n=get_irn_arity(remat)-1; n>=0; --n) {
1962 ir_node *remat_arg = get_irn_n(remat, n);
1964 /* if value is used by this remat add it to constraint */
1965 if(remat_arg == value) {
1967 /* sum remat2s <= 1 + n_remats*live_range */
1968 ir_snprintf(buf, sizeof(buf), "dying_lr_%N_%N", value, irn);
1969 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 1.0);
1973 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
1979 if(pset_find_ptr(live, value) && cst != ILP_UNDEF) {
1980 lpp_set_factor_fast(si->lpp, cst, value_op->attr.live_range.ilp, -n_remats);
1984 /* ensure at least one value dies at post remat */
1985 foreach_post_remat(irn, tmp) {
1986 op_t *remat_op = get_irn_link(tmp);
1987 pset *remat_args = pset_new_ptr(get_irn_arity(tmp));
1990 for(n=get_irn_arity(tmp)-1; n>=0; --n) {
1991 remat_arg = get_irn_n(tmp, n);
1993 if(has_reg_class(si, remat_arg)) {
1995 /* does arg always die at this op? */
1996 if(!pset_find_ptr(live, remat_arg))
1997 goto skip_one_must_die;
1999 pset_insert_ptr(remat_args, remat_arg);
2003 /* remat + \sum live_range(remat_arg) <= |args| */
2004 ir_snprintf(buf, sizeof(buf), "one_must_die_%+F", tmp);
2005 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, pset_count(remat_args));
2006 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
2008 pset_foreach(remat_args, remat_arg) {
2009 op_t *arg_op = get_irn_link(remat_arg);
2011 lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, 1.0);
2015 del_pset(remat_args);
2018 /* new live ranges for values from L\U defined by post remats */
2019 pset_foreach(live, tmp) {
2020 ir_node *value = tmp;
2021 op_t *value_op = get_irn_link(value);
2023 if(!set_find_keyval(args, value) && !pset_find_ptr(defs, value)) {
2024 ilp_var_t prev_lr = ILP_UNDEF;
2027 if(pset_find_ptr(remat_defs, value)) {
2029 /* next_live_range <= prev_live_range + sum remat2s */
2030 ir_snprintf(buf, sizeof(buf), "next_lr_%N_%N", value, irn);
2031 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2033 ir_snprintf(buf, sizeof(buf), "lr_%N_%N", value, irn);
2034 prev_lr = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
2036 lpp_set_factor_fast(si->lpp, cst, value_op->attr.live_range.ilp, 1.0);
2037 lpp_set_factor_fast(si->lpp, cst, prev_lr, -1.0);
2039 foreach_post_remat(irn, remat) {
2040 op_t *remat_op = get_irn_link(remat);
2042 /* if value is being rematerialized by this remat */
2043 if(value == remat_op->attr.remat.remat->value) {
2044 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, -1.0);
2048 value_op->attr.live_range.ilp = prev_lr;
2049 value_op->attr.live_range.op = irn;
2054 /* requirements for post remats and start live ranges from L/U' for values dying here */
2055 foreach_post_remat(irn, tmp) {
2056 op_t *remat_op = get_irn_link(tmp);
2059 for (n=get_irn_arity(tmp)-1; n>=0; --n) {
2060 ir_node *remat_arg = get_irn_n(tmp, n);
2061 op_t *arg_op = get_irn_link(remat_arg);
2063 if(!has_reg_class(si, remat_arg)) continue;
2065 /* only for values in L\U (TODO and D?), the others are handled with post_use */
2066 if(!pset_find_ptr(used, remat_arg)) {
2067 /* remat <= live_range(remat_arg) */
2068 ir_snprintf(buf, sizeof(buf), "req_remat2_%N_arg_%N", tmp, remat_arg);
2069 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
2071 /* if value is becoming live through use by remat2 */
2072 if(!pset_find_ptr(live, remat_arg)) {
2075 ir_snprintf(buf, sizeof(buf), "lr_%N_%N", remat_arg, irn);
2076 lr = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
2078 arg_op->attr.live_range.ilp = lr;
2079 arg_op->attr.live_range.op = irn;
2081 DBG((si->dbg, LEVEL_3, " value %+F becoming live through use by remat2 %+F\n", remat_arg, tmp));
2083 pset_insert_ptr(live, remat_arg);
2084 add_to_spill_bb(si, bb, remat_arg);
2087 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
2088 lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, -1.0);
2093 d = pset_count(defs);
2094 DBG((si->dbg, LEVEL_4, "\t %+F produces %d values in my register class\n", irn, d));
2096 /* count how many regs irn needs for arguments */
2097 u = set_count(args);
2100 /* check the register pressure in the epilog */
2101 /* sum_{L\U'} lr + sum_{U'} post_use <= k - |D| */
2102 ir_snprintf(buf, sizeof(buf), "check_post_%N", irn);
2103 check_post = lpp_add_cst_uniq(si->lpp, buf, lpp_less, si->n_regs - d);
2105 /* add L\U' to check_post */
2106 pset_foreach(live, tmp) {
2107 if(!pset_find_ptr(used, tmp) && !pset_find_ptr(defs, tmp)) {
2108 /* if a live value is not used by irn */
2109 tmp_op = get_irn_link(tmp);
2110 lpp_set_factor_fast(si->lpp, check_post, tmp_op->attr.live_range.ilp, 1.0);
2114 /***********************************************************
2115 * 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
2116 **********************************************************/
2119 pset_foreach(used, tmp) {
2125 op_t *arg_op = get_irn_link(arg);
2128 spill = add_to_spill_bb(si, bb, arg);
2130 /* new live range for each used value */
2131 ir_snprintf(buf, sizeof(buf), "lr_%N_%N", arg, irn);
2132 prev_lr = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
2134 /* the epilog stuff - including post_use, check_post, check_post_remat */
2135 ir_snprintf(buf, sizeof(buf), "post_use_%N_%N", arg, irn);
2136 post_use = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
2138 lpp_set_factor_fast(si->lpp, check_post, post_use, 1.0);
2140 /* arg is live throughout epilog if the next live_range is in a register */
2141 if(pset_find_ptr(live, arg)) {
2142 DBG((si->dbg, LEVEL_3, "\t arg %+F is possibly live in epilog of %+F\n", arg, irn));
2144 /* post_use >= next_lr + remat */
2145 ir_snprintf(buf, sizeof(buf), "post_use_%N_%N-%d", arg, irn, p++);
2146 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2147 lpp_set_factor_fast(si->lpp, cst, post_use, -1.0);
2148 lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, 1.0);
2151 /* forall post remat which use arg add a similar cst */
2152 foreach_post_remat(irn, remat) {
2155 for (n=get_irn_arity(remat)-1; n>=0; --n) {
2156 ir_node *remat_arg = get_irn_n(remat, n);
2157 op_t *remat_op = get_irn_link(remat);
2159 if(remat_arg == arg) {
2160 DBG((si->dbg, LEVEL_3, "\t found remat with arg %+F in epilog of %+F\n", arg, irn));
2162 /* post_use >= remat */
2163 ir_snprintf(buf, sizeof(buf), "post_use_%N_%N-%d", arg, irn, p++);
2164 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2165 lpp_set_factor_fast(si->lpp, cst, post_use, -1.0);
2166 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
2171 /* if value is not an arg of op and not possibly defined by post remat
2172 * then it may only die and not become live
2174 if(!set_find_keyval(args, arg)) {
2175 /* post_use <= prev_lr */
2176 ir_snprintf(buf, sizeof(buf), "req_post_use_%N_%N", arg, irn);
2177 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2178 lpp_set_factor_fast(si->lpp, cst, post_use, 1.0);
2179 lpp_set_factor_fast(si->lpp, cst, prev_lr, -1.0);
2181 if(!pset_find_ptr(remat_defs, arg) && pset_find_ptr(live, arg)) {
2182 /* next_lr <= prev_lr */
2183 ir_snprintf(buf, sizeof(buf), "next_lr_%N_%N", arg, irn);
2184 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2185 lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, 1.0);
2186 lpp_set_factor_fast(si->lpp, cst, prev_lr, -1.0);
2190 if(opt_memoperands && (!is_start_block(bb) || be_is_Barrier(irn))) {
2191 for(n = get_irn_arity(irn)-1; n>=0; --n) {
2192 if(get_irn_n(irn, n) == arg && arch_possible_memory_operand(arch_env, irn, n)) {
2193 ilp_var_t memoperand;
2195 ir_snprintf(buf, sizeof(buf), "memoperand_%N_%d", irn, n);
2196 memoperand = lpp_add_var_default(si->lpp, buf, lpp_binary, opt_cost_memoperand*execution_frequency(si, bb), 0.0);
2197 set_insert_memoperand(si->memoperands, irn, n, memoperand);
2199 ir_snprintf(buf, sizeof(buf), "nolivepost_%N_%d", irn, n);
2200 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 1.0);
2202 lpp_set_factor_fast(si->lpp, cst, memoperand, 1.0);
2203 lpp_set_factor_fast(si->lpp, cst, post_use, 1.0);
2208 /* new live range begins for each used value */
2209 arg_op->attr.live_range.ilp = prev_lr;
2210 arg_op->attr.live_range.op = irn;
2212 pset_insert_ptr(live, arg);
2215 /* just to be sure */
2216 check_post = ILP_UNDEF;
2218 /* allow original defintions to be removed */
2219 if(opt_repair_schedule) {
2220 pset_foreach(defs, tmp) {
2221 op_t *tmp_op = get_irn_link(tmp);
2223 spill_t *spill = set_find_spill(spill_bb->ilp, tmp);
2226 ir_snprintf(buf, sizeof(buf), "keep_%N", tmp);
2227 keep = lpp_add_var_default(si->lpp, buf, lpp_binary, get_cost(si, irn)*execution_frequency(si, bb), 1.0);
2229 ir_snprintf(buf, sizeof(buf), "killorig-lr_%N", tmp);
2230 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_greater, 0.0);
2231 lpp_set_factor_fast(si->lpp, cst, keep, 1.0);
2232 lpp_set_factor_fast(si->lpp, cst, tmp_op->attr.live_range.ilp, -1.0);
2234 ir_snprintf(buf, sizeof(buf), "killorig-spill_%N", tmp);
2235 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_greater, 0.0);
2236 lpp_set_factor_fast(si->lpp, cst, keep, 1.0);
2237 lpp_set_factor_fast(si->lpp, cst, spill->spill, -1.0);
2246 /* check the register pressure in the prolog */
2247 /* sum_{L\U} lr <= k - |U| */
2248 ir_snprintf(buf, sizeof(buf), "check_pre_%N", irn);
2249 check_pre = lpp_add_cst_uniq(si->lpp, buf, lpp_less, si->n_regs - u);
2251 /* for the prolog remove defined values from the live set */
2252 pset_foreach(defs, tmp) {
2253 pset_remove_ptr(live, tmp);
2256 if(opt_memoperands && (!is_start_block(bb) || be_is_Barrier(irn))) {
2257 ir_snprintf(buf, sizeof(buf), "one_memoperand_%N", irn);
2258 one_memoperand = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 1.0);
2261 /***********************************************************
2262 * 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
2263 **********************************************************/
2266 set_foreach(args, keyval) {
2268 const ir_node *arg = keyval->key;
2269 int i = PTR_TO_INT(keyval->val);
2270 op_t *arg_op = get_irn_link(arg);
2271 ilp_cst_t requirements;
2274 spill = set_find_spill(spill_bb->ilp, arg);
2277 ir_snprintf(buf, sizeof(buf), "reload_%N_%N", arg, irn);
2278 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);
2280 /* reload <= mem_out */
2281 ir_snprintf(buf, sizeof(buf), "req_reload_%N_%N", arg, irn);
2282 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2283 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.args.reloads[i], 1.0);
2284 lpp_set_factor_fast(si->lpp, cst, spill->mem_out, -1.0);
2286 /* requirement: arg must be in register for use */
2287 /* reload + remat + live_range == 1 */
2288 ir_snprintf(buf, sizeof(buf), "req_%N_%N", irn, arg);
2289 requirements = lpp_add_cst_uniq(si->lpp, buf, lpp_equal, 1.0);
2291 lpp_set_factor_fast(si->lpp, requirements, arg_op->attr.live_range.ilp, 1.0);
2292 lpp_set_factor_fast(si->lpp, requirements, op->attr.live_range.args.reloads[i], 1.0);
2293 foreach_pre_remat(si, irn, tmp) {
2294 op_t *remat_op = get_irn_link(tmp);
2295 if(remat_op->attr.remat.remat->value == arg) {
2296 lpp_set_factor_fast(si->lpp, requirements, remat_op->attr.remat.ilp, 1.0);
2300 if(opt_memoperands && (!is_start_block(bb) || be_is_Barrier(irn))) {
2302 for(n = get_irn_arity(irn)-1; n>=0; --n) {
2303 if(get_irn_n(irn, n) == arg) {
2307 for(n = get_irn_arity(irn)-1; n>=0; --n) {
2308 if(get_irn_n(irn, n) == arg && arch_possible_memory_operand(arch_env, irn, n)) {
2309 memoperand_t *memoperand;
2310 memoperand = set_find_memoperand(si->memoperands, irn, n);
2312 /* memoperand <= mem_out */
2313 ir_snprintf(buf, sizeof(buf), "req_memoperand_%N_%d", irn, n);
2314 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2315 lpp_set_factor_fast(si->lpp, cst, memoperand->ilp, 1.0);
2316 lpp_set_factor_fast(si->lpp, cst, spill->mem_out, -1.0);
2318 /* the memoperand is only sufficient if it is used once by the op */
2319 if(n_memoperands == 1)
2320 lpp_set_factor_fast(si->lpp, requirements, memoperand->ilp, 1.0);
2322 lpp_set_factor_fast(si->lpp, one_memoperand, memoperand->ilp, 1.0);
2324 /* we have one more free register if we use a memory operand */
2325 lpp_set_factor_fast(si->lpp, check_pre, memoperand->ilp, -1.0);
2331 /* iterate over L\U */
2332 pset_foreach(live, tmp) {
2333 if(!set_find_keyval(args, tmp)) {
2334 /* if a live value is not used by irn */
2335 tmp_op = get_irn_link(tmp);
2336 lpp_set_factor_fast(si->lpp, check_pre, tmp_op->attr.live_range.ilp, 1.0);
2340 /* requirements for remats */
2341 foreach_pre_remat(si, irn, tmp) {
2342 op_t *remat_op = get_irn_link(tmp);
2345 for (n=get_irn_arity(tmp)-1; n>=0; --n) {
2346 ir_node *remat_arg = get_irn_n(tmp, n);
2347 op_t *arg_op = get_irn_link(remat_arg);
2349 if(!has_reg_class(si, remat_arg)) continue;
2351 /* remat <= live_rang(remat_arg) [ + reload(remat_arg) ] */
2352 ir_snprintf(buf, sizeof(buf), "req_remat_%N_arg_%N", tmp, remat_arg);
2353 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
2355 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
2356 lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, -1.0);
2358 /* if remat arg is also used by current op then we can use reload placed for this argument */
2359 if((keyval = set_find_keyval(args, remat_arg)) != NULL) {
2360 int index = (int)keyval->val;
2362 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.args.reloads[index], -1.0);
2370 /*************************
2371 * D O N E W I T H O P
2372 *************************/
2374 DBG((si->dbg, LEVEL_4, "\t %d values live at %+F\n", pset_count(live), irn));
2376 pset_foreach(live, tmp) {
2377 assert(has_reg_class(si, tmp));
2380 for (n=get_irn_arity(irn)-1; n>=0; --n) {
2381 ir_node *arg = get_irn_n(irn, n);
2383 assert(!find_post_remat(arg, irn) && "there should be no post remat for an argument of an op");
2386 del_pset(remat_defs);
2390 defs = pset_new_ptr_default();
2392 /* skip everything above barrier in start block */
2393 if(is_start_block(bb) && be_is_Barrier(irn)) {
2394 assert(pset_count(live) == 0);
2403 /***************************************
2404 * B E G I N N I N G O F B L O C K
2405 ***************************************/
2408 /* we are now at the beginning of the basic block, there are only \Phis in front of us */
2409 DBG((si->dbg, LEVEL_3, "\t %d values live at beginning of block %+F\n", pset_count(live), bb));
2411 pset_foreach(live, irn) {
2412 assert(is_Phi(irn) || get_nodes_block(irn) != bb);
2415 /* construct mem_outs for all values */
2416 set_foreach(spill_bb->ilp, spill) {
2417 ir_snprintf(buf, sizeof(buf), "mem_out_%N_%N", spill->irn, bb);
2418 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2420 lpp_set_factor_fast(si->lpp, cst, spill->mem_out, 1.0);
2421 lpp_set_factor_fast(si->lpp, cst, spill->spill, -1.0);
2423 if(pset_find_ptr(live, spill->irn)) {
2424 int default_spilled;
2425 DBG((si->dbg, LEVEL_5, "\t %+F live at beginning of block %+F\n", spill->irn, bb));
2427 ir_snprintf(buf, sizeof(buf), "mem_in_%N_%N", spill->irn, bb);
2428 default_spilled = be_is_live_in(si->lv, bb, spill->irn) || is_Phi(spill->irn);
2429 spill->mem_in = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, default_spilled);
2430 lpp_set_factor_fast(si->lpp, cst, spill->mem_in, -1.0);
2432 if(opt_memcopies && is_Phi(spill->irn) && get_nodes_block(spill->irn) == bb) {
2434 op_t *op = get_irn_link(spill->irn);
2436 for(n=get_irn_arity(spill->irn)-1; n>=0; --n) {
2437 const ir_node *arg = get_irn_n(spill->irn, n);
2443 /* argument already done? */
2444 if(op->attr.live_range.args.copies[n] != ILP_UNDEF) continue;
2446 /* get sum of execution frequencies of blocks with the same phi argument */
2447 for(m=n; m>=0; --m) {
2448 const ir_node *arg2 = get_irn_n(spill->irn, m);
2451 freq += execution_frequency(si, get_Block_cfgpred_block(bb, m));
2455 /* copies are not for free */
2456 ir_snprintf(buf, sizeof(buf), "copy_%N_%N", arg, spill->irn);
2457 var = lpp_add_var_default(si->lpp, buf, lpp_binary, opt_cost_spill * freq, 1.0);
2459 for(m=n; m>=0; --m) {
2460 const ir_node *arg2 = get_irn_n(spill->irn, m);
2463 op->attr.live_range.args.copies[m] = var;
2468 /* copy <= mem_in */
2469 ir_snprintf(buf, sizeof(buf), "nocopy_%N_%N", arg, spill->irn);
2470 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2471 lpp_set_factor_fast(si->lpp, cst, var, 1.0);
2472 lpp_set_factor_fast(si->lpp, cst, spill->mem_in, -1.0);
2479 foreach_post_remat(bb, tmp) {
2481 op_t *remat_op = get_irn_link(tmp);
2482 pset *remat_args = pset_new_ptr(get_irn_arity(tmp));
2485 for (n=get_irn_arity(tmp)-1; n>=0; --n) {
2486 remat_arg = get_irn_n(tmp, n);
2488 if(has_reg_class(si, remat_arg)) {
2489 pset_insert_ptr(remat_args, remat_arg);
2493 /* remat + \sum live_range(remat_arg) <= |args| */
2494 ir_snprintf(buf, sizeof(buf), "one_must_die_%N", tmp);
2495 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, pset_count(remat_args));
2496 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
2498 pset_foreach(remat_args, remat_arg) {
2499 if(pset_find_ptr(live, remat_arg)) {
2500 op_t *remat_arg_op = get_irn_link(remat_arg);
2501 lpp_set_factor_fast(si->lpp, cst, remat_arg_op->attr.live_range.ilp, 1.0);
2504 del_pset(remat_args);
2507 foreach_post_remat(bb, tmp) {
2510 for(n=get_irn_arity(tmp)-1; n>=0; --n) {
2511 ir_node *remat_arg = get_irn_n(tmp, n);
2513 /* if value is becoming live through use by remat2 */
2514 if(has_reg_class(si, remat_arg) && !pset_find_ptr(live, remat_arg)) {
2515 op_t *remat_arg_op = get_irn_link(remat_arg);
2518 DBG((si->dbg, LEVEL_3, " value %+F becoming live through use by remat2 at bb start %+F\n", remat_arg, tmp));
2520 pset_insert_ptr(live, remat_arg);
2521 spill = add_to_spill_bb(si, bb, remat_arg);
2522 remat_arg_op->attr.live_range.ilp = ILP_UNDEF;
2524 /* we need reg_in and mem_in for this value; they will be referenced later */
2525 ir_snprintf(buf, sizeof(buf), "reg_in_%N_%N", remat_arg, bb);
2526 spill->reg_in = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
2527 ir_snprintf(buf, sizeof(buf), "mem_in_%N_%N", remat_arg, bb);
2528 spill->mem_in = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
2531 /* optimization: all memory stuff should be 0, for we do not want to insert reloads for remats */
2532 ir_snprintf(buf, sizeof(buf), "nomem_%N_%N", remat_arg, bb);
2533 nomem = lpp_add_cst_uniq(si->lpp, buf, lpp_equal, 0.0);
2534 lpp_set_factor_fast(si->lpp, nomem, spill->spill, 1.0);
2539 /* L\U is empty at bb start */
2540 /* arg is live throughout epilog if it is reg_in into this block */
2542 /* check the register pressure at the beginning of the block
2545 /* reg_in entspricht post_use */
2547 ir_snprintf(buf, sizeof(buf), "check_start_%N", bb);
2548 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, si->n_regs);
2550 pset_foreach(live, irn) {
2553 spill = set_find_spill(spill_bb->ilp, irn);
2556 ir_snprintf(buf, sizeof(buf), "reg_in_%N_%N", irn, bb);
2557 spill->reg_in = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
2559 lpp_set_factor_fast(si->lpp, cst, spill->reg_in, 1.0);
2561 /* spill + mem_in <= 1 */
2562 ir_snprintf(buf, sizeof(buf), "nospill_%N_%N", irn, bb);
2563 nospill = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 1);
2565 lpp_set_factor_fast(si->lpp, nospill, spill->mem_in, 1.0);
2566 lpp_set_factor_fast(si->lpp, nospill, spill->spill, 1.0);
2568 } /* post_remats are NOT included in register pressure check because
2569 they do not increase regpressure */
2571 /* mem_in/reg_in for live_in values, especially phis and their arguments */
2572 pset_foreach(live, irn) {
2576 spill = set_find_spill(spill_bb->ilp, irn);
2577 assert(spill && spill->irn == irn);
2579 if(is_Phi(irn) && get_nodes_block(irn) == bb) {
2580 for (n=get_Phi_n_preds(irn)-1; n>=0; --n) {
2583 ir_node *phi_arg = get_Phi_pred(irn, n);
2584 ir_node *bb_p = get_Block_cfgpred_block(bb, n);
2585 spill_bb_t *spill_bb_p = get_irn_link(bb_p);
2587 op_t *op = get_irn_link(irn);
2589 /* although the phi is in the right regclass one or more of
2590 * its arguments can be in a different one or at least to
2593 if(has_reg_class(si, phi_arg)) {
2594 /* mem_in < mem_out_arg + copy */
2595 ir_snprintf(buf, sizeof(buf), "mem_in_%N_%N-%d", irn, bb, p);
2596 mem_in = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2598 /* reg_in < reg_out_arg */
2599 ir_snprintf(buf, sizeof(buf), "reg_in_%N_%N-%d", irn, bb, p++);
2600 reg_in = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2602 lpp_set_factor_fast(si->lpp, mem_in, spill->mem_in, 1.0);
2603 lpp_set_factor_fast(si->lpp, reg_in, spill->reg_in, 1.0);
2605 spill_p = set_find_spill(spill_bb_p->ilp, phi_arg);
2608 lpp_set_factor_fast(si->lpp, mem_in, spill_p->mem_out, -1.0);
2610 lpp_set_factor_fast(si->lpp, mem_in, op->attr.live_range.args.copies[n], -1.0);
2612 lpp_set_factor_fast(si->lpp, reg_in, spill_p->reg_out, -1.0);
2616 /* else assure the value arrives on all paths in the same resource */
2618 for (n=get_Block_n_cfgpreds(bb)-1; n>=0; --n) {
2621 ir_node *bb_p = get_Block_cfgpred_block(bb, n);
2622 spill_bb_t *spill_bb_p = get_irn_link(bb_p);
2625 ir_snprintf(buf, sizeof(buf), "mem_in_%N_%N-%d", irn, bb, p);
2626 mem_in = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2627 ir_snprintf(buf, sizeof(buf), "reg_in_%N_%N-%d", irn, bb, p++);
2628 reg_in = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2630 lpp_set_factor_fast(si->lpp, mem_in, spill->mem_in, 1.0);
2631 lpp_set_factor_fast(si->lpp, reg_in, spill->reg_in, 1.0);
2633 spill_p = set_find_spill(spill_bb_p->ilp, irn);
2636 lpp_set_factor_fast(si->lpp, mem_in, spill_p->mem_out, -1.0);
2637 lpp_set_factor_fast(si->lpp, reg_in, spill_p->reg_out, -1.0);
2642 foreach_post_remat(bb, tmp) {
2645 for (n=get_irn_arity(tmp)-1; n>=0; --n) {
2646 ir_node *remat_arg = get_irn_n(tmp, n);
2647 op_t *remat_op = get_irn_link(tmp);
2649 if(!has_reg_class(si, remat_arg)) continue;
2651 spill = set_find_spill(spill_bb->ilp, remat_arg);
2654 ir_snprintf(buf, sizeof(buf), "req_remat2_%N_%N_arg_%N", tmp, bb, remat_arg);
2655 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
2656 lpp_set_factor_fast(si->lpp, cst, spill->reg_in, -1.0);
2657 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
2661 pset_foreach(live, irn) {
2662 const op_t *op = get_irn_link(irn);
2663 const ir_node *remat;
2668 foreach_post_remat(bb, remat) {
2671 for (n=get_irn_arity(remat)-1; n>=0; --n) {
2672 const ir_node *arg = get_irn_n(remat, n);
2675 const op_t *remat_op = get_irn_link(remat);
2677 if(cst == ILP_UNDEF) {
2678 /* sum remat2s <= 1 + n_remats*live_range */
2679 ir_snprintf(buf, sizeof(buf), "dying_lr_%N_%N", irn, bb);
2680 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 1.0);
2682 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
2688 if(cst != ILP_UNDEF && op->attr.live_range.ilp != ILP_UNDEF) {
2689 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.ilp, -n_remats);
2693 /* first live ranges from reg_ins */
2694 pset_foreach(live, irn) {
2695 op_t *op = get_irn_link(irn);
2697 if(op->attr.live_range.ilp != ILP_UNDEF) {
2699 spill = set_find_spill(spill_bb->ilp, irn);
2700 assert(spill && spill->irn == irn);
2702 ir_snprintf(buf, sizeof(buf), "first_lr_%N_%N", irn, bb);
2703 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2704 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.ilp, 1.0);
2705 lpp_set_factor_fast(si->lpp, cst, spill->reg_in, -1.0);
2707 foreach_post_remat(bb, tmp) {
2708 op_t *remat_op = get_irn_link(tmp);
2710 if(remat_op->attr.remat.remat->value == irn) {
2711 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, -1.0);
2717 /* walk forward now and compute constraints for placing spills */
2718 /* this must only be done for values that are not defined in this block */
2719 pset_foreach(live, irn) {
2721 * if value is defined in this block we can anways place the spill directly after the def
2722 * -> no constraint necessary
2724 if(!is_Phi(irn) && get_nodes_block(irn) == bb) {
2729 spill = set_find_spill(spill_bb->ilp, irn);
2732 ir_snprintf(buf, sizeof(buf), "req_spill_%N_%N", irn, bb);
2733 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2735 lpp_set_factor_fast(si->lpp, cst, spill->spill, 1.0);
2736 if(is_diverge_edge(bb)) lpp_set_factor_fast(si->lpp, cst, spill->reg_in, -1.0);
2739 sched_foreach_op(bb, tmp) {
2740 op_t *op = get_irn_link(tmp);
2742 if(is_Phi(tmp)) continue;
2743 assert(!is_Proj(tmp));
2746 const ir_node *value = op->attr.remat.remat->value;
2749 /* only collect remats up to the first real use of a value */
2750 lpp_set_factor_fast(si->lpp, cst, op->attr.remat.ilp, -1.0);
2755 for (n=get_irn_arity(tmp)-1; n>=0; --n) {
2756 ir_node *arg = get_irn_n(tmp, n);
2759 /* if a value is used stop collecting remats */
2772 typedef struct _irnlist_t {
2773 struct list_head list;
2777 typedef struct _interference_t {
2778 struct list_head blocklist;
2784 cmp_interference(const void *a, const void *b, size_t size)
2786 const interference_t *p = a;
2787 const interference_t *q = b;
2789 return !(p->a == q->a && p->b == q->b);
2792 static interference_t *
2793 set_find_interference(set * set, ir_node * a, ir_node * b)
2795 interference_t query;
2797 query.a = (a>b)?a:b;
2798 query.b = (a>b)?b:a;
2800 return set_find(set, &query, sizeof(query), HASH_PTR(PTR_TO_INT(a) ^ PTR_TO_INT(b)));
2803 static interference_t *
2804 set_insert_interference(spill_ilp_t * si, set * set, ir_node * a, ir_node * b, ir_node * bb)
2806 interference_t query,
2808 irnlist_t *list = obstack_alloc(si->obst, sizeof(*list));
2812 result = set_find_interference(set, a, b);
2815 list_add(&list->list, &result->blocklist);
2819 query.a = (a>b)?a:b;
2820 query.b = (a>b)?b:a;
2822 result = set_insert(set, &query, sizeof(query), HASH_PTR(PTR_TO_INT(a) ^ PTR_TO_INT(b)));
2824 INIT_LIST_HEAD(&result->blocklist);
2825 list_add(&list->list, &result->blocklist);
2831 values_interfere_in_block(const spill_ilp_t * si, const ir_node * bb, const ir_node * a, const ir_node * b)
2833 const ir_edge_t *edge;
2835 if(get_nodes_block(a) != bb && get_nodes_block(b) != bb) {
2836 /* both values are live in, so they interfere */
2840 /* ensure a dominates b */
2841 if(value_dominates(b,a)) {
2847 assert(get_nodes_block(b) == bb && "at least b should be defined here in this block");
2850 /* the following code is stolen from bera.c */
2851 if(be_is_live_end(si->lv, bb, a))
2854 foreach_out_edge(a, edge) {
2855 const ir_node *user = edge->src;
2856 if(get_nodes_block(user) == bb
2859 && !pset_find_ptr(si->inverse_ops, user)
2860 && value_dominates(b, user))
2868 * Walk all irg blocks and collect interfering values inside of phi classes
2871 luke_interferencewalker(ir_node * bb, void * data)
2873 spill_ilp_t *si = (spill_ilp_t*)data;
2876 be_lv_foreach(si->lv, bb, be_lv_state_end | be_lv_state_out | be_lv_state_in, l1) {
2877 ir_node *a = be_lv_get_irn(si->lv, bb, l1);
2878 op_t *a_op = get_irn_link(a);
2881 /* a is only interesting if it is in my register class and if it is inside a phi class */
2882 if (has_reg_class(si, a) && get_phi_class(a)) {
2883 if(a_op->is_remat || pset_find_ptr(si->inverse_ops, a))
2886 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)) {
2887 ir_node *b = be_lv_get_irn(si->lv, bb, l2);
2888 op_t *b_op = get_irn_link(b);
2891 /* a and b are only interesting if they are in the same phi class */
2892 if(has_reg_class(si, b) && get_phi_class(a) == get_phi_class(b)) {
2893 if(b_op->is_remat || pset_find_ptr(si->inverse_ops, b))
2896 if(values_interfere_in_block(si, bb, a, b)) {
2897 DBG((si->dbg, LEVEL_4, "\tvalues interfere in %+F: %+F, %+F\n", bb, a, b));
2898 set_insert_interference(si, si->interferences, a, b, bb);
2906 static unsigned int copy_path_id = 0;
2909 write_copy_path_cst(spill_ilp_t *si, pset * copies, ilp_var_t any_interfere)
2916 ir_snprintf(buf, sizeof(buf), "copy_path-%d", copy_path_id++);
2917 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0);
2919 lpp_set_factor_fast(si->lpp, cst, any_interfere, 1.0);
2921 pset_foreach(copies, ptr) {
2922 copy = PTR_TO_INT(ptr);
2923 lpp_set_factor_fast(si->lpp, cst, copy, -1.0);
2928 * @parameter copies contains a path of copies which lead us to irn
2929 * @parameter visited contains a set of nodes already visited on this path
2932 find_copy_path(spill_ilp_t * si, const ir_node * irn, const ir_node * target, ilp_var_t any_interfere, pset * copies, pset * visited)
2934 const ir_edge_t *edge;
2935 op_t *op = get_irn_link(irn);
2936 pset *visited_users = pset_new_ptr_default();
2939 if(op->is_remat) return 0;
2941 pset_insert_ptr(visited, irn);
2945 pset *visited_operands = pset_new_ptr(get_irn_arity(irn));
2947 /* visit all operands */
2948 for(n=get_irn_arity(irn)-1; n>=0; --n) {
2949 ir_node *arg = get_irn_n(irn, n);
2950 ilp_var_t copy = op->attr.live_range.args.copies[n];
2952 if(!has_reg_class(si, arg)) continue;
2953 if(pset_find_ptr(visited_operands, arg)) continue;
2954 pset_insert_ptr(visited_operands, arg);
2957 if(++paths > MAX_PATHS && pset_count(copies) != 0) {
2958 del_pset(visited_operands);
2959 del_pset(visited_users);
2960 pset_remove_ptr(visited, irn);
2963 pset_insert(copies, INT_TO_PTR(copy), copy);
2964 write_copy_path_cst(si, copies, any_interfere);
2965 pset_remove(copies, INT_TO_PTR(copy), copy);
2966 } else if(!pset_find_ptr(visited, arg)) {
2967 pset_insert(copies, INT_TO_PTR(copy), copy);
2968 paths += find_copy_path(si, arg, target, any_interfere, copies, visited);
2969 pset_remove(copies, INT_TO_PTR(copy), copy);
2971 if(paths > MAX_PATHS) {
2972 if(pset_count(copies) == 0) {
2976 ir_snprintf(buf, sizeof(buf), "always_copy-%d-%d", any_interfere, copy);
2977 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_equal, 0);
2978 lpp_set_factor_fast(si->lpp, cst, any_interfere, -1.0);
2979 lpp_set_factor_fast(si->lpp, cst, copy, 1.0);
2980 DBG((si->dbg, LEVEL_1, "ALWAYS COPYING %d FOR INTERFERENCE %d\n", copy, any_interfere));
2984 del_pset(visited_operands);
2985 del_pset(visited_users);
2986 pset_remove_ptr(visited, irn);
2989 } else if(pset_count(copies) == 0) {
2995 del_pset(visited_operands);
2998 /* visit all uses which are phis */
2999 foreach_out_edge(irn, edge) {
3000 ir_node *user = edge->src;
3001 int pos = edge->pos;
3002 op_t *op = get_irn_link(user);
3005 if(!is_Phi(user)) continue;
3006 if(!has_reg_class(si, user)) continue;
3007 if(pset_find_ptr(visited_users, user)) continue;
3008 pset_insert_ptr(visited_users, user);
3010 copy = op->attr.live_range.args.copies[pos];
3012 if(user == target) {
3013 if(++paths > MAX_PATHS && pset_count(copies) != 0) {
3014 del_pset(visited_users);
3015 pset_remove_ptr(visited, irn);
3018 pset_insert(copies, INT_TO_PTR(copy), copy);
3019 write_copy_path_cst(si, copies, any_interfere);
3020 pset_remove(copies, INT_TO_PTR(copy), copy);
3021 } else if(!pset_find_ptr(visited, user)) {
3022 pset_insert(copies, INT_TO_PTR(copy), copy);
3023 paths += find_copy_path(si, user, target, any_interfere, copies, visited);
3024 pset_remove(copies, INT_TO_PTR(copy), copy);
3026 if(paths > MAX_PATHS) {
3027 if(pset_count(copies) == 0) {
3031 ir_snprintf(buf, sizeof(buf), "always_copy-%d-%d", any_interfere, copy);
3032 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_equal, 0);
3033 lpp_set_factor_fast(si->lpp, cst, any_interfere, -1.0);
3034 lpp_set_factor_fast(si->lpp, cst, copy, 1.0);
3035 DBG((si->dbg, LEVEL_1, "ALWAYS COPYING %d FOR INTERFERENCE %d\n", copy, any_interfere));
3039 del_pset(visited_users);
3040 pset_remove_ptr(visited, irn);
3043 } else if(pset_count(copies) == 0) {
3049 del_pset(visited_users);
3050 pset_remove_ptr(visited, irn);
3055 gen_copy_constraints(spill_ilp_t * si, const ir_node * a, const ir_node * b, ilp_var_t any_interfere)
3057 pset * copies = pset_new_ptr_default();
3058 pset * visited = pset_new_ptr_default();
3060 find_copy_path(si, a, b, any_interfere, copies, visited);
3068 memcopyhandler(spill_ilp_t * si)
3070 interference_t *interference;
3072 /* teste Speicherwerte auf Interferenz */
3074 /* analyze phi classes */
3075 phi_class_compute(si->chordal_env->irg);
3077 DBG((si->dbg, LEVEL_2, "\t calling interferencewalker\n"));
3078 irg_block_walk_graph(si->chordal_env->irg, luke_interferencewalker, NULL, si);
3080 /* now lets emit the ILP unequations for the crap */
3081 set_foreach(si->interferences, interference) {
3083 ilp_var_t interfere,
3085 ilp_cst_t any_interfere_cst,
3087 const ir_node *a = interference->a;
3088 const ir_node *b = interference->b;
3090 /* any_interf <= \sum interf */
3091 ir_snprintf(buf, sizeof(buf), "interfere_%N_%N", a, b);
3092 any_interfere_cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0);
3093 any_interfere = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
3095 lpp_set_factor_fast(si->lpp, any_interfere_cst, any_interfere, 1.0);
3097 list_for_each_entry(irnlist_t, irnlist, &interference->blocklist, list) {
3098 const ir_node *bb = irnlist->irn;
3099 spill_bb_t *spill_bb = get_irn_link(bb);
3104 spilla = set_find_spill(spill_bb->ilp, a);
3107 spillb = set_find_spill(spill_bb->ilp, b);
3110 /* interfere <-> (mem_in_a or spill_a) and (mem_in_b or spill_b): */
3111 /* 1: mem_in_a + mem_in_b + spill_a + spill_b - interfere <= 1 */
3112 /* 2: - mem_in_a - spill_a + interfere <= 0 */
3113 /* 3: - mem_in_b - spill_b + interfere <= 0 */
3114 ir_snprintf(buf, sizeof(buf), "interfere_%N_%N_%N", bb, a, b);
3115 interfere = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
3117 ir_snprintf(buf, sizeof(buf), "interfere_%N_%N_%N-1", bb, a, b);
3118 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 1);
3120 lpp_set_factor_fast(si->lpp, cst, interfere, -1.0);
3121 if(spilla->mem_in != ILP_UNDEF) lpp_set_factor_fast(si->lpp, cst, spilla->mem_in, 1.0);
3122 lpp_set_factor_fast(si->lpp, cst, spilla->spill, 1.0);
3123 if(spillb->mem_in != ILP_UNDEF) lpp_set_factor_fast(si->lpp, cst, spillb->mem_in, 1.0);
3124 lpp_set_factor_fast(si->lpp, cst, spillb->spill, 1.0);
3126 ir_snprintf(buf, sizeof(buf), "interfere_%N_%N_%N-2", bb, a, b);
3127 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0);
3129 lpp_set_factor_fast(si->lpp, cst, interfere, 1.0);
3130 if(spilla->mem_in != ILP_UNDEF) lpp_set_factor_fast(si->lpp, cst, spilla->mem_in, -1.0);
3131 lpp_set_factor_fast(si->lpp, cst, spilla->spill, -1.0);
3133 ir_snprintf(buf, sizeof(buf), "interfere_%N_%N_%N-3", bb, a, b);
3134 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0);
3136 lpp_set_factor_fast(si->lpp, cst, interfere, 1.0);
3137 if(spillb->mem_in != ILP_UNDEF) lpp_set_factor_fast(si->lpp, cst, spillb->mem_in, -1.0);
3138 lpp_set_factor_fast(si->lpp, cst, spillb->spill, -1.0);
3141 lpp_set_factor_fast(si->lpp, any_interfere_cst, interfere, -1.0);
3143 /* any_interfere >= interf */
3144 ir_snprintf(buf, sizeof(buf), "interfere_%N_%N-%N", a, b, bb);
3145 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0);
3147 lpp_set_factor_fast(si->lpp, cst, interfere, 1.0);
3148 lpp_set_factor_fast(si->lpp, cst, any_interfere, -1.0);
3151 /* now that we know whether the two values interfere in memory we can drop constraints to enforce copies */
3152 gen_copy_constraints(si,a,b,any_interfere);
3160 return fabs(x) < 0.00001;
3163 static int mark_remat_nodes_hook(FILE *F, ir_node *n, ir_node *l)
3165 spill_ilp_t *si = get_irg_link(current_ir_graph);
3167 if(pset_find_ptr(si->all_possible_remats, n)) {
3168 op_t *op = (op_t*)get_irn_link(n);
3169 assert(op && op->is_remat);
3171 if(!op->attr.remat.remat->inverse) {
3172 if(op->attr.remat.pre) {
3173 ir_fprintf(F, "color:red info3:\"remat value: %+F\"", op->attr.remat.remat->value);
3175 ir_fprintf(F, "color:orange info3:\"remat2 value: %+F\"", op->attr.remat.remat->value);
3180 op_t *op = (op_t*)get_irn_link(n);
3181 assert(op && op->is_remat);
3183 if(op->attr.remat.pre) {
3184 ir_fprintf(F, "color:cyan info3:\"remat inverse value: %+F\"", op->attr.remat.remat->value);
3186 ir_fprintf(F, "color:lightcyan info3:\"remat2 inverse value: %+F\"", op->attr.remat.remat->value);
3197 dump_graph_with_remats(ir_graph * irg, const char * suffix)
3199 set_dump_node_vcgattr_hook(mark_remat_nodes_hook);
3200 be_dump(irg, suffix, dump_ir_block_graph_sched);
3201 set_dump_node_vcgattr_hook(NULL);
3205 * Edge hook to dump the schedule edges with annotated register pressure.
3208 sched_pressure_edge_hook(FILE *F, ir_node *irn)
3210 if(sched_is_scheduled(irn) && sched_has_prev(irn)) {
3211 ir_node *prev = sched_prev(irn);
3212 fprintf(F, "edge:{sourcename:\"");
3214 fprintf(F, "\" targetname:\"");
3216 fprintf(F, "\" label:\"%d", (int)get_irn_link(irn));
3217 fprintf(F, "\" color:magenta}\n");
3223 dump_ir_block_graph_sched_pressure(ir_graph *irg, const char *suffix)
3225 DUMP_NODE_EDGE_FUNC old_edge_hook = get_dump_node_edge_hook();
3227 dump_consts_local(0);
3228 set_dump_node_edge_hook(sched_pressure_edge_hook);
3229 dump_ir_block_graph(irg, suffix);
3230 set_dump_node_edge_hook(old_edge_hook);
3234 walker_pressure_annotator(ir_node * bb, void * data)
3236 spill_ilp_t *si = data;
3239 pset *live = pset_new_ptr_default();
3242 be_lv_foreach(si->lv, bb, be_lv_state_end, i) {
3243 irn = be_lv_get_irn(si->lv, bb, i);
3245 if (has_reg_class(si, irn)) {
3246 pset_insert_ptr(live, irn);
3250 set_irn_link(bb, INT_TO_PTR(pset_count(live)));
3252 sched_foreach_reverse(bb, irn) {
3254 set_irn_link(irn, INT_TO_PTR(pset_count(live)));
3258 if(has_reg_class(si, irn)) {
3259 pset_remove_ptr(live, irn);
3260 if(is_Proj(irn)) ++projs;
3263 if(!is_Proj(irn)) projs = 0;
3265 for (n=get_irn_arity(irn)-1; n>=0; --n) {
3266 ir_node *arg = get_irn_n(irn, n);
3268 if(has_reg_class(si, arg)) pset_insert_ptr(live, arg);
3270 set_irn_link(irn, INT_TO_PTR(pset_count(live)+projs));
3277 dump_pressure_graph(spill_ilp_t * si, const char *suffix)
3279 be_dump(si->chordal_env->irg, suffix, dump_ir_block_graph_sched_pressure);
3283 connect_all_remats_with_keep(spill_ilp_t * si)
3291 n_remats = pset_count(si->all_possible_remats);
3293 ins = obstack_alloc(si->obst, n_remats * sizeof(*ins));
3296 pset_foreach(si->all_possible_remats, irn) {
3301 si->keep = be_new_Keep(si->chordal_env->cls, si->chordal_env->irg, get_irg_end_block(si->chordal_env->irg), n_remats, ins);
3303 obstack_free(si->obst, ins);
3308 connect_all_spills_with_keep(spill_ilp_t * si)
3317 n_spills = pset_count(si->spills);
3319 ins = obstack_alloc(si->obst, n_spills * sizeof(*ins));
3322 pset_foreach(si->spills, irn) {
3327 keep = be_new_Keep(si->chordal_env->cls, si->chordal_env->irg, get_irg_end_block(si->chordal_env->irg), n_spills, ins);
3329 obstack_free(si->obst, ins);
3333 /** insert a spill at an arbitrary position */
3334 ir_node *be_spill2(const arch_env_t *arch_env, ir_node *irn, ir_node *insert)
3336 ir_node *bl = is_Block(insert)?insert:get_nodes_block(insert);
3337 ir_graph *irg = get_irn_irg(bl);
3338 ir_node *frame = get_irg_frame(irg);
3342 const arch_register_class_t *cls = arch_get_irn_reg_class(arch_env, irn, -1);
3343 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
3345 spill = be_new_Spill(cls, cls_frame, irg, bl, frame, irn);
3348 * search the right insertion point. a spill of a phi cannot be put
3349 * directly after the phi, if there are some phis behind the one which
3350 * is spilled. Also, a spill of a Proj must be after all Projs of the
3353 * Here's one special case:
3354 * If the spill is in the start block, the spill must be after the frame
3355 * pointer is set up. This is done by setting insert to the end of the block
3356 * which is its default initialization (see above).
3359 if(bl == get_irg_start_block(irg) && sched_get_time_step(frame) >= sched_get_time_step(insert))
3362 for (next = sched_next(insert); is_Phi(next) || is_Proj(next); next = sched_next(insert))
3365 sched_add_after(insert, spill);
3370 delete_remat(spill_ilp_t * si, ir_node * remat) {
3372 ir_node *bad = get_irg_bad(si->chordal_env->irg);
3374 sched_remove(remat);
3376 /* kill links to operands */
3377 for (n=get_irn_arity(remat)-1; n>=-1; --n) {
3378 set_irn_n(remat, n, bad);
3383 clean_remat_info(spill_ilp_t * si)
3387 remat_info_t *remat_info;
3388 ir_node *bad = get_irg_bad(si->chordal_env->irg);
3390 set_foreach(si->remat_info, remat_info) {
3391 if(!remat_info->remats) continue;
3393 pset_foreach(remat_info->remats, remat)
3395 if(remat->proj && get_irn_n_edges(remat->proj) == 0) {
3396 if(sched_is_scheduled(remat->proj)) {
3397 sched_remove((ir_node*)remat->proj);
3399 set_irn_n((ir_node*)remat->proj, -1, bad);
3400 set_irn_n((ir_node*)remat->proj, 0, bad);
3403 if(get_irn_n_edges(remat->op) == 0) {
3404 if(sched_is_scheduled(remat->op)) {
3405 sched_remove((ir_node*)remat->op);
3407 for (n=get_irn_arity(remat->op)-1; n>=-1; --n) {
3408 set_irn_n((ir_node*)remat->op, n, bad);
3413 if(remat_info->remats) del_pset(remat_info->remats);
3414 if(remat_info->remats_by_operand) del_pset(remat_info->remats_by_operand);
3419 delete_unnecessary_remats(spill_ilp_t * si)
3421 if(opt_keep_alive & KEEPALIVE_REMATS) {
3423 ir_node *bad = get_irg_bad(si->chordal_env->irg);
3426 for (n=get_irn_arity(si->keep)-1; n>=0; --n) {
3427 ir_node *keep_arg = get_irn_n(si->keep, n);
3428 op_t *arg_op = get_irn_link(keep_arg);
3431 assert(arg_op->is_remat);
3433 name = si->lpp->vars[arg_op->attr.remat.ilp];
3435 if(is_zero(name->value)) {
3436 DBG((si->dbg, LEVEL_3, "\t deleting remat %+F\n", keep_arg));
3437 /* TODO check whether reload is preferred over remat (could be bug) */
3438 delete_remat(si, keep_arg);
3440 if(!arg_op->attr.remat.remat->inverse) {
3441 if(arg_op->attr.remat.pre) {
3442 DBG((si->dbg, LEVEL_2, "\t**remat kept: %+F\n", keep_arg));
3444 DBG((si->dbg, LEVEL_2, "\t%%%%remat2 kept: %+F\n", keep_arg));
3447 if(arg_op->attr.remat.pre) {
3448 DBG((si->dbg, LEVEL_2, "\t**INVERSE remat kept: %+F\n", keep_arg));
3450 DBG((si->dbg, LEVEL_2, "\t%%%%INVERSE remat2 kept: %+F\n", keep_arg));
3455 set_irn_n(si->keep, n, bad);
3458 DBG((si->dbg, LEVEL_2, "\t no remats to delete (none have been inserted)\n"));
3463 pset_foreach(si->all_possible_remats, remat) {
3464 op_t *remat_op = get_irn_link(remat);
3465 lpp_name_t *name = si->lpp->vars[remat_op->attr.remat.ilp];
3467 if(is_zero(name->value)) {
3468 DBG((si->dbg, LEVEL_3, "\t deleting remat %+F\n", remat));
3469 /* TODO check whether reload is preferred over remat (could be bug) */
3470 delete_remat(si, remat);
3472 if(!remat_op->attr.remat.remat->inverse) {
3473 if(remat_op->attr.remat.pre) {
3474 DBG((si->dbg, LEVEL_2, "\t**remat kept: %+F\n", remat));
3476 DBG((si->dbg, LEVEL_2, "\t%%%%remat2 kept: %+F\n", remat));
3479 if(remat_op->attr.remat.pre) {
3480 DBG((si->dbg, LEVEL_2, "\t**INVERSE remat kept: %+F\n", remat));
3482 DBG((si->dbg, LEVEL_2, "\t%%%%INVERSE remat2 kept: %+F\n", remat));
3491 get_spills_for_value(spill_ilp_t * si, const ir_node * value)
3493 pset *spills = pset_new_ptr_default();
3495 const ir_node *next;
3498 defs = set_find_def(si->values, value);
3500 if(defs && defs->spills) {
3501 for(next = defs->spills; next; next = get_irn_link(next)) {
3502 pset_insert_ptr(spills, next);
3510 * @param before The node after which the spill will be placed in the schedule
3513 insert_spill(spill_ilp_t * si, ir_node * irn, const ir_node * value, ir_node * before)
3517 const arch_env_t *arch_env = si->chordal_env->birg->main_env->arch_env;
3519 DBG((si->dbg, LEVEL_3, "\t inserting spill for value %+F after %+F\n", irn, before));
3521 spill = be_spill2(arch_env, irn, before);
3523 defs = set_insert_def(si->values, value);
3526 /* enter into the linked list */
3527 set_irn_link(spill, defs->spills);
3528 defs->spills = spill;
3530 if(opt_keep_alive & KEEPALIVE_SPILLS)
3531 pset_insert_ptr(si->spills, spill);
3537 * @param before The Phi node which has to be spilled
3540 insert_mem_phi(spill_ilp_t * si, ir_node * phi)
3547 NEW_ARR_A(ir_node*, ins, get_irn_arity(phi));
3549 for(n=get_irn_arity(phi)-1; n>=0; --n) {
3550 ins[n] = si->m_unknown;
3553 mem_phi = new_r_Phi(si->chordal_env->irg, get_nodes_block(phi), get_irn_arity(phi), ins, mode_M);
3555 defs = set_insert_def(si->values, phi);
3558 /* enter into the linked list */
3559 set_irn_link(mem_phi, defs->spills);
3560 defs->spills = mem_phi;
3562 #ifdef SCHEDULE_PHIM
3563 sched_add_after(phi, mem_phi);
3566 if(opt_keep_alive & KEEPALIVE_SPILLS)
3567 pset_insert_ptr(si->spills, mem_phi);
3574 * Add remat to list of defs, destroys link field!
3577 insert_remat(spill_ilp_t * si, ir_node * remat)
3580 op_t *remat_op = get_irn_link(remat);
3582 assert(remat_op->is_remat);
3584 defs = set_insert_def(si->values, remat_op->attr.remat.remat->value);
3587 /* enter into the linked list */
3588 set_irn_link(remat, defs->remats);
3589 defs->remats = remat;
3594 * Add reload before operation and add to list of defs
3597 insert_reload(spill_ilp_t * si, const ir_node * value, ir_node * after)
3602 const arch_env_t *arch_env = si->chordal_env->birg->main_env->arch_env;
3604 DBG((si->dbg, LEVEL_3, "\t inserting reload for value %+F before %+F\n", value, after));
3606 defs = set_find_def(si->values, value);
3608 spill = defs->spills;
3609 assert(spill && "no spill placed before reload");
3611 reload = be_reload(arch_env, si->cls, after, get_irn_mode(value), spill);
3613 /* enter into the linked list */
3614 set_irn_link(reload, defs->remats);
3615 defs->remats = reload;
3620 void perform_memory_operand(spill_ilp_t * si, memoperand_t * memoperand)
3623 ir_node *value = get_irn_n(memoperand->irn, memoperand->pos);
3625 const arch_env_t *arch_env = si->chordal_env->birg->main_env->arch_env;
3627 DBG((si->dbg, LEVEL_2, "\t inserting memory operand for value %+F at %+F\n", value, memoperand->irn));
3629 defs = set_find_def(si->values, value);
3631 spill = defs->spills;
3632 assert(spill && "no spill placed before reload");
3634 arch_perform_memory_operand(arch_env, memoperand->irn, spill, memoperand->pos);
3637 void insert_memoperands(spill_ilp_t * si)
3639 memoperand_t *memoperand;
3642 set_foreach(si->memoperands, memoperand) {
3643 name = si->lpp->vars[memoperand->ilp];
3644 if(!is_zero(name->value)) {
3645 perform_memory_operand(si, memoperand);
3651 walker_spill_placer(ir_node * bb, void * data) {
3652 spill_ilp_t *si = (spill_ilp_t*)data;
3654 spill_bb_t *spill_bb = get_irn_link(bb);
3655 pset *spills_to_do = pset_new_ptr_default();
3658 set_foreach(spill_bb->ilp, spill) {
3661 if(is_Phi(spill->irn) && get_nodes_block(spill->irn) == bb) {
3662 name = si->lpp->vars[spill->mem_in];
3663 if(!is_zero(name->value)) {
3666 mem_phi = insert_mem_phi(si, spill->irn);
3668 DBG((si->dbg, LEVEL_2, "\t >>spilled Phi %+F -> %+F\n", spill->irn, mem_phi));
3672 name = si->lpp->vars[spill->spill];
3673 if(!is_zero(name->value)) {
3674 /* place spill directly after definition */
3675 if(get_nodes_block(spill->irn) == bb) {
3676 insert_spill(si, spill->irn, spill->irn, spill->irn);
3680 /* place spill at bb start */
3681 if(spill->reg_in > 0) {
3682 name = si->lpp->vars[spill->reg_in];
3683 if(!is_zero(name->value)) {
3684 insert_spill(si, spill->irn, spill->irn, bb);
3688 /* place spill after a remat */
3689 pset_insert_ptr(spills_to_do, spill->irn);
3692 DBG((si->dbg, LEVEL_3, "\t %d spills to do in block %+F\n", pset_count(spills_to_do), bb));
3695 for(irn = sched_block_first_nonphi(bb); !sched_is_end(irn); irn = sched_next(irn)) {
3696 op_t *op = get_irn_link(irn);
3698 if(be_is_Spill(irn)) continue;
3701 /* TODO fix this if we want to support remats with more than two nodes */
3702 if(get_irn_mode(irn) != mode_T && pset_find_ptr(spills_to_do, op->attr.remat.remat->value)) {
3703 pset_remove_ptr(spills_to_do, op->attr.remat.remat->value);
3705 insert_spill(si, irn, op->attr.remat.remat->value, irn);
3708 if(pset_find_ptr(spills_to_do, irn)) {
3709 pset_remove_ptr(spills_to_do, irn);
3711 insert_spill(si, irn, irn, irn);
3717 assert(pset_count(spills_to_do) == 0);
3719 /* afterwards free data in block */
3720 del_pset(spills_to_do);
3724 insert_mem_copy(spill_ilp_t * si, ir_node * bb, ir_node * value)
3726 ir_node *insert_pos = bb;
3728 const arch_env_t *arch_env = si->chordal_env->birg->main_env->arch_env;
3730 /* find last definition of arg value in block */
3735 defs = set_find_def(si->values, value);
3737 if(defs && defs->remats) {
3738 for(next = defs->remats; next; next = get_irn_link(next)) {
3739 if(get_nodes_block(next) == bb && sched_get_time_step(next) > last) {
3740 last = sched_get_time_step(next);
3746 if(get_nodes_block(value) == bb && sched_get_time_step(value) > last) {
3747 last = sched_get_time_step(value);
3751 DBG((si->dbg, LEVEL_2, "\t inserting mem copy for value %+F after %+F\n", value, insert_pos));
3753 spill = be_spill2(arch_env, is_Block(insert_pos)?value:insert_pos, insert_pos);
3759 phim_fixer(spill_ilp_t *si) {
3762 set_foreach(si->values, defs) {
3763 const ir_node *phi = defs->value;
3764 op_t *op = get_irn_link(phi);
3765 ir_node *phi_m = NULL;
3766 ir_node *next = defs->spills;
3769 if(!is_Phi(phi)) continue;
3772 if(is_Phi(next) && get_irn_mode(next) == mode_M) {
3776 next = get_irn_link(next);
3779 if(!phi_m) continue;
3781 for(n=get_irn_arity(phi)-1; n>=0; --n) {
3782 ir_node *value = get_irn_n(phi, n);
3783 defs_t *val_defs = set_find_def(si->values, value);
3785 /* a spill of this value */
3790 ir_node *pred = get_Block_cfgpred_block(get_nodes_block(phi), n);
3791 lpp_name_t *name = si->lpp->vars[op->attr.live_range.args.copies[n]];
3793 if(!is_zero(name->value)) {
3794 spill = insert_mem_copy(si, pred, value);
3796 spill = val_defs->spills;
3799 spill = val_defs->spills;
3802 assert(spill && "no spill placed before PhiM");
3803 set_irn_n(phi_m, n, spill);
3809 walker_reload_placer(ir_node * bb, void * data) {
3810 spill_ilp_t *si = (spill_ilp_t*)data;
3812 spill_bb_t *spill_bb = get_irn_link(bb);
3814 /* reloads at end of block */
3815 if(spill_bb->reloads) {
3818 set_foreach(spill_bb->reloads, keyval) {
3819 ir_node *irn = (ir_node*)keyval->key;
3820 ilp_var_t reload = PTR_TO_INT(keyval->val);
3823 name = si->lpp->vars[reload];
3824 if(!is_zero(name->value)) {
3826 ir_node *insert_pos = bb;
3827 ir_node *prev = sched_block_last_noncf(si, bb);
3828 op_t *prev_op = get_irn_link(prev);
3830 while(be_is_Spill(prev)) {
3831 prev = sched_prev(prev);
3834 prev_op = get_irn_link(prev);
3836 /* insert reload before pre-remats */
3837 while(!sched_is_end(prev) && !be_is_Reload(prev) && !is_Phi(prev)
3838 && prev_op->is_remat && prev_op->attr.remat.pre) {
3842 prev = sched_prev(prev);
3843 } while(be_is_Spill(prev));
3845 prev_op = get_irn_link(prev);
3849 reload = insert_reload(si, irn, insert_pos);
3851 if(opt_keep_alive & KEEPALIVE_RELOADS)
3852 pset_insert_ptr(si->spills, reload);
3857 /* walk and insert more reloads and collect remats */
3858 sched_foreach_reverse(bb, irn) {
3859 op_t *op = get_irn_link(irn);
3861 if(be_is_Reload(irn) || be_is_Spill(irn)) continue;
3862 if(is_Phi(irn)) break;
3865 if(get_irn_mode(irn) != mode_T) {
3866 insert_remat(si, irn);
3871 for (n=get_irn_arity(irn)-1; n>=0; --n) {
3872 ir_node *arg = get_irn_n(irn, n);
3874 if(op->attr.live_range.args.reloads && op->attr.live_range.args.reloads[n] != ILP_UNDEF) {
3877 name = si->lpp->vars[op->attr.live_range.args.reloads[n]];
3878 if(!is_zero(name->value)) {
3880 ir_node *insert_pos = irn;
3881 ir_node *prev = sched_prev(insert_pos);
3884 while(be_is_Spill(prev)) {
3885 prev = sched_prev(prev);
3888 prev_op = get_irn_link(prev);
3890 /* insert reload before pre-remats */
3891 while(!sched_is_end(prev) && !be_is_Reload(prev) && !is_Phi(prev)
3892 && prev_op->is_remat && prev_op->attr.remat.pre) {
3896 prev = sched_prev(prev);
3897 } while(be_is_Spill(prev));
3899 prev_op = get_irn_link(prev);
3903 reload = insert_reload(si, arg, insert_pos);
3905 set_irn_n(irn, n, reload);
3907 if(opt_keep_alive & KEEPALIVE_RELOADS)
3908 pset_insert_ptr(si->spills, reload);
3915 del_set(spill_bb->ilp);
3916 if(spill_bb->reloads) del_set(spill_bb->reloads);
3920 walker_collect_used(ir_node * irn, void * data)
3922 bitset_t *used = data;
3924 bitset_set(used, get_irn_idx(irn));
3927 struct kill_helper {
3933 walker_kill_unused(ir_node * bb, void * data)
3935 struct kill_helper *kh = data;
3936 ir_node *bad = get_irg_bad(get_irn_irg(bb));
3940 for(irn=sched_first(bb); !sched_is_end(irn);) {
3941 ir_node *next = sched_next(irn);
3944 if(!bitset_is_set(kh->used, get_irn_idx(irn))) {
3945 if(be_is_Spill(irn) || be_is_Reload(irn)) {
3946 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)));
3948 assert(lpp_get_sol_state(kh->si->lpp) != lpp_optimal && "optimal solution is suboptimal?");
3954 set_nodes_block(irn, bad);
3955 for (n=get_irn_arity(irn)-1; n>=0; --n) {
3956 set_irn_n(irn, n, bad);
3964 kill_all_unused_values_in_schedule(spill_ilp_t * si)
3966 struct kill_helper kh;
3968 kh.used = bitset_malloc(get_irg_last_idx(si->chordal_env->irg));
3971 irg_walk_graph(si->chordal_env->irg, walker_collect_used, NULL, kh.used);
3972 irg_block_walk_graph(si->chordal_env->irg, walker_kill_unused, NULL, &kh);
3974 bitset_free(kh.used);
3978 print_irn_pset(pset * p)
3982 pset_foreach(p, irn) {
3983 ir_printf("%+F\n", irn);
3988 dump_phi_class(spill_ilp_t * si, pset * phiclass, const char * file)
3990 FILE *f = fopen(file, "w");
3992 interference_t *interference;
3994 pset_break(phiclass);
3995 set_break(si->interferences);
3997 ir_fprintf(f, "digraph phiclass {\n");
3999 pset_foreach(phiclass, irn) {
4001 ir_fprintf(f, " %F%N [shape=box]\n",irn,irn);
4004 pset_foreach(phiclass, irn) {
4007 if(!is_Phi(irn)) continue;
4009 for(n=get_irn_arity(irn)-1; n>=0; --n) {
4010 ir_node *arg = get_irn_n(irn, n);
4012 ir_fprintf(f, " %F%N -> %F%N\n",irn,irn,arg,arg);
4016 set_foreach(si->interferences, interference) {
4017 const ir_node *a = interference->a;
4018 const ir_node *b = interference->b;
4019 if(get_phi_class(a) == phiclass) {
4020 ir_fprintf(f, " %F%N -> %F%N [color=red,dir=none,style=bold]\n",a,a,b,b);
4029 rewire_uses(spill_ilp_t * si)
4031 dom_front_info_t *dfi = be_compute_dominance_frontiers(si->chordal_env->irg);
4033 pset *ignore = pset_new_ptr(1);
4035 pset_insert_ptr(ignore, get_irg_end(si->chordal_env->irg));
4037 /* then fix uses of spills */
4038 set_foreach(si->values, defs) {
4041 const ir_node *next = defs->remats;
4044 reloads = pset_new_ptr_default();
4047 if(be_is_Reload(next)) {
4048 pset_insert_ptr(reloads, next);
4052 next = get_irn_link(next);
4055 spills = get_spills_for_value(si, defs->value);
4056 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));
4057 if(pset_count(spills) > 1) {
4058 //assert(pset_count(reloads) > 0);
4059 // print_irn_pset(spills);
4060 // print_irn_pset(reloads);
4062 be_ssa_constr_set_ignore(dfi, si->lv, spills, ignore);
4069 /* first fix uses of remats and reloads */
4070 set_foreach(si->values, defs) {
4072 const ir_node *next = defs->remats;
4076 nodes = pset_new_ptr_default();
4077 if(sched_is_scheduled(defs->value)) {
4078 pset_insert_ptr(nodes, defs->value);
4083 pset_insert_ptr(nodes, next);
4084 next = get_irn_link(next);
4087 DBG((si->dbg, LEVEL_4, "\t %d new definitions for value %+F\n", pset_count(nodes)-orig_kept, defs->value));
4088 be_ssa_constr_set(dfi, si->lv, nodes);
4094 // remove_unused_defs(si);
4096 be_free_dominance_frontiers(dfi);
4101 writeback_results(spill_ilp_t * si)
4103 /* walk through the graph and collect all spills, reloads and remats for a value */
4105 si->values = new_set(cmp_defs, 4096);
4107 DBG((si->dbg, LEVEL_1, "Applying results\n"));
4108 delete_unnecessary_remats(si);
4109 si->m_unknown = new_r_Unknown(si->chordal_env->irg, mode_M);
4110 irg_block_walk_graph(si->chordal_env->irg, walker_spill_placer, NULL, si);
4111 irg_block_walk_graph(si->chordal_env->irg, walker_reload_placer, NULL, si);
4113 insert_memoperands(si);
4116 /* clean the remat info! there are still back-edges leading there! */
4117 clean_remat_info(si);
4121 connect_all_spills_with_keep(si);
4123 del_set(si->values);
4127 get_n_regs(spill_ilp_t * si)
4129 int arch_n_regs = arch_register_class_n_regs(si->cls);
4131 bitset_t *arch_regs = bitset_malloc(arch_n_regs);
4132 bitset_t *abi_regs = bitset_malloc(arch_n_regs);
4134 arch_put_non_ignore_regs(si->chordal_env->birg->main_env->arch_env, si->cls, arch_regs);
4135 be_abi_put_ignore_regs(si->chordal_env->birg->abi, si->cls, abi_regs);
4137 bitset_andnot(arch_regs, abi_regs);
4138 arch_n_regs = bitset_popcnt(arch_regs);
4140 bitset_free(arch_regs);
4141 bitset_free(abi_regs);
4143 DBG((si->dbg, LEVEL_1, "\tArchitecture has %d free registers in class %s\n", arch_n_regs, si->cls->name));
4148 walker_reload_mover(ir_node * bb, void * data)
4150 spill_ilp_t *si = data;
4153 sched_foreach(bb, tmp) {
4154 if(be_is_Reload(tmp) && has_reg_class(si, tmp)) {
4155 ir_node *reload = tmp;
4158 /* move reload upwards */
4160 int pressure = (int)get_irn_link(reload);
4161 if(pressure < si->n_regs) {
4162 irn = sched_prev(reload);
4163 DBG((si->dbg, LEVEL_5, "regpressure before %+F: %d\n", reload, pressure));
4164 sched_remove(reload);
4165 pressure = (int)get_irn_link(irn);
4167 while(pressure < si->n_regs) {
4168 if( sched_is_end(irn) ||
4169 (be_is_Reload(irn) && has_reg_class(si, irn)) ||
4170 /* do not move reload before its spill */
4171 (irn == be_get_Reload_mem(reload)) ||
4172 /* do not move before phi */
4175 set_irn_link(irn, INT_TO_PTR(pressure+1));
4176 DBG((si->dbg, LEVEL_5, "new regpressure before %+F: %d\n", irn, pressure+1));
4177 irn = sched_prev(irn);
4179 pressure = (int)get_irn_link(irn);
4182 DBG((si->dbg, LEVEL_3, "putting reload %+F after %+F\n", reload, irn));
4183 sched_put_after(irn, reload);
4190 move_reloads_upward(spill_ilp_t * si)
4192 irg_block_walk_graph(si->chordal_env->irg, walker_reload_mover, NULL, si);
4197 * Walk all irg blocks and check for interfering spills inside of phi classes
4200 luke_meminterferencechecker(ir_node * bb, void * data)
4202 spill_ilp_t *si = (spill_ilp_t*)data;
4205 be_lv_foreach(si->lv, bb, be_lv_state_end | be_lv_state_out | be_lv_state_in, l1) {
4206 ir_node *a = be_lv_get_irn(si->lv, bb, l1);
4208 if(!be_is_Spill(a) && (!is_Phi(a) || get_irn_mode(a) != mode_T)) continue;
4210 /* a is only interesting if it is in my register class and if it is inside a phi class */
4211 if (has_reg_class(si, a) && get_phi_class(a)) {
4212 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)) {
4213 ir_node *b = be_lv_get_irn(si->lv, bb, l2);
4215 if(!be_is_Spill(b) && (!is_Phi(b) || get_irn_mode(b) != mode_T)) continue;
4217 /* a and b are only interesting if they are in the same phi class */
4218 if(has_reg_class(si, b) && get_phi_class(a) == get_phi_class(b)) {
4219 if(values_interfere_in_block(si, bb, a, b)) {
4220 ir_fprintf(stderr, "$$ Spills interfere in %+F: %+F, %+F \t$$\n", bb, a, b);
4229 verify_phiclasses(spill_ilp_t * si)
4231 /* analyze phi classes */
4232 phi_class_compute(si->chordal_env->irg);
4234 DBG((si->dbg, LEVEL_2, "\t calling memory interference checker\n"));
4235 irg_block_walk_graph(si->chordal_env->irg, luke_meminterferencechecker, NULL, si);
4239 be_spill_remat(const be_chordal_env_t * chordal_env)
4242 char problem_name[256];
4243 char dump_suffix[256];
4244 char dump_suffix2[256];
4245 struct obstack obst;
4248 ir_snprintf(problem_name, sizeof(problem_name), "%F_%s", chordal_env->irg, chordal_env->cls->name);
4249 ir_snprintf(dump_suffix, sizeof(dump_suffix), "-%s-remats", chordal_env->cls->name);
4250 ir_snprintf(dump_suffix2, sizeof(dump_suffix2), "-%s-pressure", chordal_env->cls->name);
4252 FIRM_DBG_REGISTER(si.dbg, "firm.be.ra.spillremat");
4253 DBG((si.dbg, LEVEL_1, "\n\n\t\t===== Processing %s =====\n\n", problem_name));
4255 if(opt_verify & VERIFY_DOMINANCE)
4256 be_check_dominance(chordal_env->irg);
4258 obstack_init(&obst);
4259 si.chordal_env = chordal_env;
4261 si.cls = chordal_env->cls;
4262 si.lpp = new_lpp(problem_name, lpp_minimize);
4263 si.remat_info = new_set(cmp_remat_info, 4096);
4264 si.interferences = new_set(cmp_interference, 32);
4265 si.memoperands = new_set(cmp_memoperands, 128);
4266 si.all_possible_remats = pset_new_ptr_default();
4267 si.spills = pset_new_ptr_default();
4268 si.inverse_ops = pset_new_ptr_default();
4269 si.lv = chordal_env->lv;
4271 si.n_regs = get_n_regs(&si);
4273 set_irg_link(chordal_env->irg, &si);
4274 compute_doms(chordal_env->irg);
4276 /* compute phi classes */
4277 // phi_class_compute(chordal_env->irg);
4279 if(opt_dump_flags & DUMP_STATS)
4280 be_analyze_regpressure(chordal_env, "-pre");
4282 DBG((si.dbg, LEVEL_2, "\t initializing\n"));
4283 irg_block_walk_graph(chordal_env->irg, luke_initializer, NULL, &si);
4286 /* collect remats */
4287 DBG((si.dbg, LEVEL_1, "Collecting remats\n"));
4288 irg_walk_graph(chordal_env->irg, walker_remat_collector, NULL, &si);
4291 /* insert possible remats */
4292 DBG((si.dbg, LEVEL_1, "Inserting possible remats\n"));
4293 irg_block_walk_graph(chordal_env->irg, walker_remat_insertor, NULL, &si);
4294 DBG((si.dbg, LEVEL_2, " -> inserted %d possible remats\n", pset_count(si.all_possible_remats)));
4296 if(opt_keep_alive & KEEPALIVE_REMATS) {
4297 DBG((si.dbg, LEVEL_1, "Connecting remats with keep and dumping\n"));
4298 connect_all_remats_with_keep(&si);
4299 /* dump graph with inserted remats */
4300 dump_graph_with_remats(chordal_env->irg, dump_suffix);
4303 /* insert copies for phi arguments not in my regclass */
4304 irg_walk_graph(chordal_env->irg, walker_regclass_copy_insertor, NULL, &si);
4306 /* recompute liveness */
4307 DBG((si.dbg, LEVEL_1, "Recomputing liveness\n"));
4308 be_liveness_recompute(si.lv);
4311 DBG((si.dbg, LEVEL_1, "\tBuilding ILP\n"));
4312 DBG((si.dbg, LEVEL_2, "\t endwalker\n"));
4313 irg_block_walk_graph(chordal_env->irg, luke_endwalker, NULL, &si);
4315 DBG((si.dbg, LEVEL_2, "\t blockwalker\n"));
4316 irg_block_walk_graph(chordal_env->irg, luke_blockwalker, NULL, &si);
4319 DBG((si.dbg, LEVEL_2, "\t memcopyhandler\n"));
4320 memcopyhandler(&si);
4323 if(opt_dump_flags & DUMP_PROBLEM) {
4325 ir_snprintf(buf, sizeof(buf), "%s-spillremat.ilp", problem_name);
4326 if ((f = fopen(buf, "wt")) != NULL) {
4327 lpp_dump_plain(si.lpp, f);
4332 if(opt_dump_flags & DUMP_MPS) {
4335 ir_snprintf(buf, sizeof(buf), "%s-spillremat.mps", problem_name);
4336 if((f = fopen(buf, "wt")) != NULL) {
4337 mps_write_mps(si.lpp, s_mps_fixed, f);
4341 ir_snprintf(buf, sizeof(buf), "%s-spillremat.mst", problem_name);
4342 if((f = fopen(buf, "wt")) != NULL) {
4343 mps_write_mst(si.lpp, s_mps_fixed, f);
4348 lpp_check_startvals(si.lpp);
4351 DBG((si.dbg, LEVEL_1, "\tSolving %s (%d variables, %d constraints)\n", problem_name, si.lpp->var_next, si.lpp->cst_next));
4352 lpp_set_time_limit(si.lpp, opt_timeout);
4355 lpp_set_log(si.lpp, stdout);
4358 lpp_solve_cplex(si.lpp);
4360 lpp_solve_net(si.lpp, LPP_SERVER, LPP_SOLVER);
4362 assert(lpp_is_sol_valid(si.lpp)
4363 && "solution of ILP must be valid");
4365 DBG((si.dbg, LEVEL_1, "\t%s: iterations: %d, solution time: %g, objective function: %g\n", problem_name, si.lpp->iterations, si.lpp->sol_time, is_zero(si.lpp->objval)?0.0:si.lpp->objval));
4367 if(opt_dump_flags & DUMP_SOLUTION) {
4371 ir_snprintf(buf, sizeof(buf), "%s-spillremat.sol", problem_name);
4372 if ((f = fopen(buf, "wt")) != NULL) {
4374 for (i = 0; i < si.lpp->var_next; ++i) {
4375 lpp_name_t *name = si.lpp->vars[i];
4376 fprintf(f, "%20s %4d %10f\n", name->name, name->nr, name->value);
4382 writeback_results(&si);
4386 kill_all_unused_values_in_schedule(&si);
4388 if(opt_keep_alive & (KEEPALIVE_SPILLS | KEEPALIVE_RELOADS))
4389 be_dump(chordal_env->irg, "-spills-placed", dump_ir_block_graph);
4391 // move reloads upwards
4392 be_liveness_recompute(si.lv);
4393 irg_block_walk_graph(chordal_env->irg, walker_pressure_annotator, NULL, &si);
4394 move_reloads_upward(&si);
4397 verify_phiclasses(&si);
4400 irg_block_walk_graph(chordal_env->irg, walker_pressure_annotator, NULL, &si);
4402 if(opt_dump_flags & DUMP_PRESSURE)
4403 dump_pressure_graph(&si, dump_suffix2);
4405 if(opt_dump_flags & DUMP_STATS)
4406 be_analyze_regpressure(chordal_env, "-post");
4408 if(opt_verify & VERIFY_DOMINANCE)
4409 be_check_dominance(chordal_env->irg);
4411 free_dom(chordal_env->irg);
4412 del_set(si.interferences);
4413 del_pset(si.inverse_ops);
4414 del_pset(si.all_possible_remats);
4415 del_set(si.memoperands);
4416 del_pset(si.spills);
4418 obstack_free(&obst, NULL);
4419 DBG((si.dbg, LEVEL_1, "\tdone.\n"));
4422 #else /* WITH_ILP */
4425 only_that_you_can_compile_without_WITH_ILP_defined(void)
4429 #endif /* WITH_ILP */