nsz Git - libfirm/blob - ir/be/bespillremat.c

   1 /** vim: set sw=4 ts=4:
   2  * @file   bespillremat.c
   3  * @date   2006-04-06
   4  * @author Adam M. Szalkowski & Sebastian Hack
   5  *
   6  * ILP based spilling & rematerialization
   7  *
   8  * Copyright (C) 2006 Universitaet Karlsruhe
   9  * Released under the GPL
  10  */
  11 #ifdef HAVE_CONFIG_H
  12 #include "config.h"
  13 #endif
  14
  15 #ifdef WITH_ILP
  16
  17 #include <math.h>
  18
  19 #include "hashptr.h"
  20 #include "debug.h"
  21 #include "obst.h"
  22 #include "set.h"
  23 #include "list.h"
  24 #include "pmap.h"
  25
  26 #include "irprintf.h"
  27 #include "irgwalk.h"
  28 #include "irdump_t.h"
  29 #include "irnode_t.h"
  30 #include "ircons_t.h"
  31 #include "irloop_t.h"
  32 #include "phiclass.h"
  33 #include "iredges.h"
  34 #include "execfreq.h"
  35
  36 #include <lpp/lpp.h>
  37 #include <lpp/lpp_net.h>
  38 #include <lpp/lpp_cplex.h>
  39 //#include <lc_pset.h>
  40 #include <libcore/lc_bitset.h>
  41
  42 #include "be_t.h"
  43 #include "belive_t.h"
  44 #include "besched_t.h"
  45 #include "beirgmod.h"
  46 #include "bearch.h"
  47 #include "benode_t.h"
  48 #include "beutil.h"
  49 #include "bespillremat.h"
  50 #include "bespill.h"
  51
  52 #include "bechordal_t.h"
  53
  54 #define BIGM 100000.0
  55
  56 #define DUMP_SOLUTION
  57 #define DUMP_ILP
  58 //#define KEEPALIVE /* keep alive all inserted remats and dump graph with remats */
  59 #define COLLECT_REMATS /* enable rematerialization */
  60 #define COLLECT_INVERSE_REMATS /* enable placement of inverse remats */
  61 #define REMAT_WHILE_LIVE /* only remat values that are live */
  62 //#define NO_ENLARGE_L1V3N355 /* do not remat after the death of some operand */
  63 //#define EXECFREQ_LOOPDEPH /* compute execution frequency from loop depth only */
  64 //#define MAY_DIE_AT_PRE_REMAT /* allow values to die after a pre remat */
  65 #define CHECK_POST_REMAT /* check pressure after post remats (conservative but otherwise we can temporarily exceed the register pressure) */
  66 #define NO_SINGLE_USE_REMATS /* do not repair schedule */
  67 //#define KEEPALIVE_SPILLS
  68 //#define KEEPALIVE_RELOADS
  69 #define GOODWIN_REDUCTION
  70
  71 #define  SOLVE
  72 //#define  SOLVE_LOCAL
  73 #define LPP_SERVER "i44pc52"
  74 #define LPP_SOLVER "cplex"
  75
  76 #define COST_LOAD      10
  77 #define COST_STORE     50
  78 #define COST_REMAT     1
  79
  80 #define ILP_TIMEOUT    120
  81
  82 #define ILP_UNDEF               -1
  83
  84 typedef struct _spill_ilp_t {
  85         const arch_register_class_t  *cls;
  86         int                           n_regs;
  87         const be_chordal_env_t       *chordal_env;
  88         spill_env_t                  *senv;
  89         lpp_t                        *lpp;
  90         struct obstack               *obst;
  91         set                          *remat_info;
  92         pset                         *all_possible_remats;
  93         pset                         *inverse_ops;
  94 #ifdef KEEPALIVE
  95         ir_node                      *keep;
  96 #endif
  97         set                          *values; /**< for collecting all definitions of values before running ssa-construction */
  98         set                          *execfreqs;
  99         pset                         *spills;
 100         ir_node                      *m_unknown;
 101         DEBUG_ONLY(firm_dbg_module_t * dbg);
 102 } spill_ilp_t;
 103
 104 typedef int ilp_var_t;
 105 typedef int ilp_cst_t;
 106
 107 typedef struct _spill_bb_t {
 108         set          *ilp;
 109         pset         *copys_needed;
 110         ilp_var_t    *reloads;
 111 } spill_bb_t;
 112
 113 typedef struct _remat_t {
 114         const ir_node        *op; /**< for copy_irn */
 115         const ir_node        *proj; /**< not NULL if the above op produces a tuple */
 116         const ir_node        *value; /**< the value which is being recomputed by this remat */
 117         int                   cost; /**< cost of this remat */
 118         int                   inverse; /**< nonzero if this is an inverse remat */
 119 } remat_t;
 120
 121 /**
 122  * Data to be attached to each IR node. For remats this contains the ilp_var
 123  * for this remat and for normal ops this contains the ilp_vars for
 124  * reloading each operand
 125  */
 126 typedef struct _op_t {
 127         int             is_remat;
 128         union {
 129                 struct {
 130                         ilp_var_t       ilp;
 131                         remat_t        *remat; /** the remat this op belongs to */
 132                         int             pre; /** 1, if this is a pressure-increasing remat */
 133                 } remat;
 134                 struct {
 135                         ilp_var_t       ilp;
 136                         ir_node        *op; /** the operation this live range belongs to */
 137                         ilp_var_t      *reloads;
 138                 } live_range;
 139         } attr;
 140 } op_t;
 141
 142 typedef struct _defs_t {
 143         ir_node   *value;
 144         ir_node   *spills;  /**< points to the first spill for this value (linked by link field) */
 145         ir_node   *remats;  /**< points to the first definition for this value (linked by link field) */
 146 } defs_t;
 147
 148 typedef struct _remat_info_t {
 149         const ir_node       *irn; /**< the irn to which these remats belong */
 150         pset                *remats; /**< possible remats for this value */
 151         pset                *remats_by_operand; /**< remats with this value as operand */
 152 } remat_info_t;
 153
 154 typedef struct _keyval_t {
 155         const void          *key;
 156         const void          *val;
 157 } keyval_t;
 158
 159 typedef struct _spill_t {
 160         ir_node      *irn;
 161         ilp_var_t     reg_in;
 162         ilp_var_t     mem_in;
 163         ilp_var_t     reg_out;
 164         ilp_var_t     mem_out;
 165         ilp_var_t     spill;
 166 } spill_t;
 167
 168 static INLINE int
 169 has_reg_class(const spill_ilp_t * si, const ir_node * irn)
 170 {
 171         return chordal_has_class(si->chordal_env, irn);
 172 }
 173
 174 #if 0
 175 static int
 176 cmp_remat(const void *a, const void *b)
 177 {
 178         const keyval_t *p = a;
 179         const keyval_t *q = b;
 180         const remat_t  *r = p->val;
 181         const remat_t  *s = q->val;
 182
 183         assert(r && s);
 184
 185         return !(r == s || r->op == s->op);
 186 }
 187 #endif
 188 static int
 189 cmp_remat(const void *a, const void *b)
 190 {
 191         const remat_t  *r = a;
 192         const remat_t  *s = a;
 193
 194         return !(r == s || r->op == s->op);
 195 }
 196
 197 static int
 198 cmp_spill(const void *a, const void *b, size_t size)
 199 {
 200         const spill_t *p = a;
 201         const spill_t *q = b;
 202
 203 //      return !(p->irn == q->irn && p->bb == q->bb);
 204         return !(p->irn == q->irn);
 205 }
 206
 207 static keyval_t *
 208 set_find_keyval(set * set, void * key)
 209 {
 210         keyval_t     query;
 211
 212         query.key = key;
 213         return set_find(set, &query, sizeof(query), HASH_PTR(key));
 214 }
 215
 216 static keyval_t *
 217 set_insert_keyval(set * set, void * key, void * val)
 218 {
 219         keyval_t     query;
 220
 221         query.key = key;
 222         query.val = val;
 223         return set_insert(set, &query, sizeof(query), HASH_PTR(key));
 224 }
 225
 226 static defs_t *
 227 set_find_def(set * set, ir_node * value)
 228 {
 229         defs_t     query;
 230
 231         query.value = value;
 232         return set_find(set, &query, sizeof(query), HASH_PTR(value));
 233 }
 234
 235 static defs_t *
 236 set_insert_def(set * set, ir_node * value)
 237 {
 238         defs_t     query;
 239
 240         query.value = value;
 241         query.spills = NULL;
 242         query.remats = NULL;
 243         return set_insert(set, &query, sizeof(query), HASH_PTR(value));
 244 }
 245
 246 static spill_t *
 247 set_find_spill(set * set, ir_node * value)
 248 {
 249         spill_t     query;
 250
 251         query.irn = value;
 252         return set_find(set, &query, sizeof(query), HASH_PTR(value));
 253 }
 254
 255 #define pset_foreach(s,i) for((i)=pset_first((s)); (i); (i)=pset_next((s)))
 256 #define set_foreach(s,i) for((i)=set_first((s)); (i); (i)=set_next((s)))
 257 #define foreach_post_remat(s,i) for((i)=next_post_remat((s)); (i); (i)=next_post_remat((i)))
 258 #define foreach_pre_remat(si,s,i) for((i)=next_pre_remat((si),(s)); (i); (i)=next_pre_remat((si),(i)))
 259 #define sched_foreach_op(s,i) for((i)=sched_next_op((s));!sched_is_end((i));(i)=sched_next_op((i)))
 260
 261 static int
 262 cmp_remat_info(const void *a, const void *b, size_t size)
 263 {
 264         const remat_info_t *p = a;
 265         const remat_info_t *q = b;
 266
 267         return !(p->irn == q->irn);
 268 }
 269
 270 static int
 271 cmp_defs(const void *a, const void *b, size_t size)
 272 {
 273         const defs_t *p = a;
 274         const defs_t *q = b;
 275
 276         return !(p->value == q->value);
 277 }
 278
 279 static int
 280 cmp_keyval(const void *a, const void *b, size_t size)
 281 {
 282         const keyval_t *p = a;
 283         const keyval_t *q = b;
 284
 285         return !(p->key == q->key);
 286 }
 287
 288 static double
 289 execution_frequency(const spill_ilp_t * si, const ir_node * irn)
 290 {
 291 #define FUDGE 0.001
 292         if(si->execfreqs) {
 293                 if(is_Block(irn)) {
 294                         return get_block_execfreq(si->execfreqs, irn) + FUDGE;
 295                 } else {
 296                         return get_block_execfreq(si->execfreqs, get_nodes_block(irn)) + FUDGE;
 297                 }
 298         } else {
 299                 if(is_Block(irn))
 300                         return exp(get_loop_depth(get_irn_loop(irn)) * log(10)) + FUDGE;
 301                 else
 302                         return exp(get_loop_depth(get_irn_loop(get_nodes_block(irn))) * log(10)) + FUDGE;
 303         }
 304 }
 305
 306 static double
 307 get_cost(const spill_ilp_t * si, const ir_node * irn)
 308 {
 309         if(be_is_Spill(irn)) {
 310                 return COST_STORE;
 311         } else if(be_is_Reload(irn)){
 312                 return COST_LOAD;
 313         } else {
 314                 return arch_get_op_estimated_cost(si->chordal_env->birg->main_env->arch_env, irn);
 315         }
 316
 317 }
 318
 319 /**
 320  * Checks, whether node and its operands have suitable reg classes
 321  */
 322 static INLINE int
 323 is_rematerializable(const spill_ilp_t * si, const ir_node * irn)
 324 {
 325         int             i,
 326                         n;
 327         const arch_env_t *arch_env = si->chordal_env->birg->main_env->arch_env;
 328         int               remat = (arch_irn_get_flags(arch_env, irn) & arch_irn_flags_rematerializable) != 0;
 329
 330 #if 0
 331         if(!remat)
 332                 ir_fprintf(stderr, "  Node %+F is not rematerializable\n", irn);
 333 #endif
 334
 335         for (i = 0, n = get_irn_arity(irn); i < n && remat; ++i) {
 336                 ir_node        *op = get_irn_n(irn, i);
 337                 remat &= has_reg_class(si, op) || arch_irn_get_flags(arch_env, op) & arch_irn_flags_ignore || (get_irn_op(op) == op_NoMem);
 338
 339 //              if(!remat)
 340 //                      ir_fprintf(stderr, "  Argument %d (%+F) of Node %+F has wrong regclass\n", i, op, irn);
 341         }
 342
 343         return remat;
 344 }
 345
 346 /**
 347  * Try to create a remat from @p op with destination value @p dest_value
 348  */
 349 static INLINE remat_t *
 350 get_remat_from_op(spill_ilp_t * si, const ir_node * dest_value, const ir_node * op)
 351 {
 352         remat_t  *remat = NULL;
 353
 354 //      if(!mode_is_datab(get_irn_mode(dest_value)))
 355 //              return NULL;
 356
 357         if(dest_value == op) {
 358                 const ir_node *proj = NULL;
 359
 360                 if(is_Proj(dest_value)) {
 361                         op = get_irn_n(op, 0);
 362                         proj = dest_value;
 363                 }
 364
 365                 if(!is_rematerializable(si, op))
 366                         return NULL;
 367
 368                 remat = obstack_alloc(si->obst, sizeof(*remat));
 369                 remat->op = op;
 370                 remat->cost = get_cost(si, op);
 371                 remat->value = dest_value;
 372                 remat->proj = proj;
 373                 remat->inverse = 0;
 374         } else {
 375                 arch_inverse_t     inverse;
 376                 int                i,
 377                                                    n;
 378
 379                 /* get the index of the operand we want to retrieve by the inverse op */
 380                 for (i = 0, n = get_irn_arity(op); i < n; ++i) {
 381                         ir_node        *arg = get_irn_n(op, i);
 382
 383                         if(arg == dest_value) break;
 384                 }
 385                 if(i == n) return NULL;
 386
 387                 DBG((si->dbg, LEVEL_5, "\t  requesting inverse op for argument %d of op %+F\n", i, op));
 388
 389                 /* else ask the backend to give an inverse op */
 390                 if(arch_get_inverse(si->chordal_env->birg->main_env->arch_env, op, i, &inverse, si->obst)) {
 391                         int   i;
 392
 393                         DBG((si->dbg, LEVEL_4, "\t  backend gave us an inverse op with %d nodes and cost %d\n", inverse.n, inverse.costs));
 394
 395                         assert(inverse.n > 0 && "inverse op should have at least one node");
 396
 397                         for(i=0; i<inverse.n; ++i) {
 398                                 pset_insert_ptr(si->inverse_ops, inverse.nodes[i]);
 399                         }
 400
 401                         if(inverse.n <= 2) {
 402                                 remat = obstack_alloc(si->obst, sizeof(*remat));
 403                                 remat->op = inverse.nodes[0];
 404                                 remat->cost = inverse.costs;
 405                                 remat->value = dest_value;
 406                                 remat->proj = (inverse.n==2)?inverse.nodes[1]:NULL;
 407                                 remat->inverse = 1;
 408
 409                                 assert(is_Proj(remat->proj));
 410                         } else {
 411                                 assert(0 && "I can not handle remats with more than 2 nodes");
 412                         }
 413                 }
 414         }
 415
 416         if(remat) {
 417                 if(remat->proj) {
 418                         DBG((si->dbg, LEVEL_3, "\t >Found remat %+F for %+F from %+F with %+F\n", remat->op, dest_value, op, remat->proj));
 419                 } else {
 420                         DBG((si->dbg, LEVEL_3, "\t >Found remat %+F for %+F from %+F\n", remat->op, dest_value, op));
 421                 }
 422         }
 423         return remat;
 424 }
 425
 426
 427 static INLINE void
 428 add_remat(const spill_ilp_t * si, const remat_t * remat)
 429 {
 430         remat_info_t    *remat_info,
 431                      query;
 432         int              i,
 433                                          n;
 434
 435         assert(remat->op);
 436         assert(remat->value);
 437
 438         query.irn = remat->value;
 439         query.remats = NULL;
 440         query.remats_by_operand = NULL;
 441         remat_info = set_insert(si->remat_info, &query, sizeof(query), HASH_PTR(remat->value));
 442
 443         if(remat_info->remats == NULL) {
 444                 remat_info->remats = new_pset(cmp_remat, 4096);
 445         }
 446         pset_insert(remat_info->remats, remat, HASH_PTR(remat->op));
 447
 448         /* insert the remat into the remats_be_operand set of each argument of the remat op */
 449         for (i = 0, n = get_irn_arity(remat->op); i < n; ++i) {
 450                 ir_node        *arg = get_irn_n(remat->op, i);
 451
 452                 query.irn = arg;
 453                 query.remats = NULL;
 454                 query.remats_by_operand = NULL;
 455                 remat_info = set_insert(si->remat_info, &query, sizeof(query), HASH_PTR(arg));
 456
 457                 if(remat_info->remats_by_operand == NULL) {
 458                         remat_info->remats_by_operand = new_pset(cmp_remat, 4096);
 459                 }
 460                 pset_insert(remat_info->remats_by_operand, remat, HASH_PTR(remat->op));
 461         }
 462 }
 463
 464 static int
 465 get_irn_n_nonremat_edges(const spill_ilp_t * si, const ir_node * irn)
 466 {
 467         const ir_edge_t   *edge = get_irn_out_edge_first(irn);
 468         int                i = 0;
 469
 470         while(edge) {
 471                 if(!pset_find_ptr(si->inverse_ops, edge->src)) {
 472                         ++i;
 473                 }
 474                 edge = get_irn_out_edge_next(irn, edge);
 475         }
 476
 477         return i;
 478 }
 479
 480 static INLINE void
 481 get_remats_from_op(spill_ilp_t * si, const ir_node * op)
 482 {
 483         int       i,
 484                       n;
 485         remat_t *remat;
 486
 487 #ifdef NO_SINGLE_USE_REMATS
 488         if(has_reg_class(si, op) && (get_irn_n_nonremat_edges(si, op) > 1)) {
 489 #else
 490         if(has_reg_class(si, op)) {
 491 #endif
 492                 remat = get_remat_from_op(si, op, op);
 493                 if(remat) {
 494                         add_remat(si, remat);
 495                 }
 496         }
 497
 498 #ifdef COLLECT_INVERSE_REMATS
 499         /* repeat the whole stuff for each remat retrieved by get_remat_from_op(op, arg)
 500            for each arg */
 501         for (i = 0, n = get_irn_arity(op); i < n; ++i) {
 502                 ir_node        *arg = get_irn_n(op, i);
 503
 504                 if(has_reg_class(si, arg)) {
 505                         /* try to get an inverse remat */
 506                         remat = get_remat_from_op(si, arg, op);
 507                         if(remat) {
 508                                 add_remat(si, remat);
 509                         }
 510                 }
 511         }
 512 #endif
 513
 514 }
 515
 516 static INLINE int
 517 value_is_defined_before(const spill_ilp_t * si, const ir_node * pos, const ir_node * val)
 518 {
 519         ir_node *block;
 520         ir_node *def_block = get_nodes_block(val);
 521         int      ret;
 522
 523         if(val == pos)
 524                 return 0;
 525
 526         /* if pos is at end of a basic block */
 527         if(is_Block(pos)) {
 528                 ret = (pos == def_block || block_dominates(def_block, pos));
 529 //              ir_fprintf(stderr, "(def(bb)=%d) ", ret);
 530                 return ret;
 531         }
 532
 533         /* else if this is a normal operation */
 534         block = get_nodes_block(pos);
 535         if(block == def_block) {
 536                 if(!sched_is_scheduled(val)) return 1;
 537
 538                 ret = sched_comes_after(val, pos);
 539 //              ir_fprintf(stderr, "(def(same block)=%d) ",ret);
 540                 return ret;
 541         }
 542
 543         ret = block_dominates(def_block, block);
 544 //      ir_fprintf(stderr, "(def(other block)=%d) ", ret);
 545         return ret;
 546 }
 547
 548 static INLINE ir_node *
 549 sched_block_last_noncf(const spill_ilp_t * si, const ir_node * bb)
 550 {
 551     return sched_skip((ir_node*)bb, 0, sched_skip_cf_predicator, (void *) si->chordal_env->birg->main_env->arch_env);
 552 }
 553
 554 /**
 555  * Returns first non-Phi node of block @p bb
 556  */
 557 static INLINE ir_node *
 558 sched_block_first_nonphi(const ir_node * bb)
 559 {
 560         return sched_skip((ir_node*)bb, 1, sched_skip_phi_predicator, NULL);
 561 }
 562
 563 static int
 564 sched_skip_proj_predicator(const ir_node * irn, void * data)
 565 {
 566         return (is_Proj(irn));
 567 }
 568
 569 static INLINE ir_node *
 570 sched_next_nonproj(const ir_node * irn, int forward)
 571 {
 572         return sched_skip((ir_node*)irn, forward, sched_skip_proj_predicator, NULL);
 573 }
 574
 575 /**
 576  * Returns next operation node (non-Proj) after @p irn
 577  * or the basic block of this node
 578  */
 579 static INLINE ir_node *
 580 sched_next_op(const ir_node * irn)
 581 {
 582         ir_node *next = sched_next(irn);
 583
 584         if(is_Block(next))
 585                 return next;
 586
 587         return sched_next_nonproj(next, 1);
 588 }
 589
 590 /**
 591  * Returns previous operation node (non-Proj) before @p irn
 592  * or the basic block of this node
 593  */
 594 static INLINE ir_node *
 595 sched_prev_op(const ir_node * irn)
 596 {
 597         ir_node *prev = sched_prev(irn);
 598
 599         if(is_Block(prev))
 600                 return prev;
 601
 602         return sched_next_nonproj(prev, 0);
 603 }
 604
 605 static void
 606 sched_put_after(ir_node * insert, ir_node * irn)
 607 {
 608         if(is_Block(insert)) {
 609                 insert = sched_block_first_nonphi(insert);
 610         } else {
 611                 insert = sched_next_op(insert);
 612         }
 613         sched_add_before(insert, irn);
 614 }
 615
 616 static void
 617 sched_put_before(const spill_ilp_t * si, ir_node * insert, ir_node * irn)
 618 {
 619   if(is_Block(insert)) {
 620           insert = sched_block_last_noncf(si, insert);
 621   } else {
 622           insert = sched_next_nonproj(insert, 0);
 623           insert = sched_prev(insert);
 624   }
 625   sched_add_after(insert, irn);
 626 }
 627
 628 /**
 629  * Tells you whether a @p remat can be placed before the irn @p pos
 630  */
 631 static INLINE int
 632 can_remat_before(const spill_ilp_t * si, const remat_t * remat, const ir_node * pos, const pset * live)
 633 {
 634         const ir_node   *op = remat->op;
 635         const ir_node   *prev;
 636         int        i,
 637                            n,
 638                            res = 1;
 639
 640         if(is_Block(pos)) {
 641                 prev = sched_block_last_noncf(si, pos);
 642                 prev = sched_next_nonproj(prev, 0);
 643         } else {
 644                 prev = sched_prev_op(pos);
 645         }
 646         /* do not remat if the rematted value is defined immediately before this op */
 647         if(prev == remat->op) {
 648                 return 0;
 649         }
 650
 651 #if 0
 652         /* this should be just fine, the following OP will be using this value, right? */
 653
 654         /* only remat AFTER the real definition of a value (?) */
 655         if(!value_is_defined_before(si, pos, remat->value)) {
 656 //              ir_fprintf(stderr, "error(not defined)");
 657                 return 0;
 658         }
 659 #endif
 660
 661         for(i=0, n=get_irn_arity(op); i<n && res; ++i) {
 662                 const ir_node   *arg = get_irn_n(op, i);
 663
 664 #ifdef NO_ENLARGE_L1V3N355
 665                 if(has_reg_class(si, arg) && live) {
 666                         res &= pset_find_ptr(live, arg)?1:0;
 667                 } else {
 668                         res &= value_is_defined_before(si, pos, arg);
 669                 }
 670 #else
 671                 res &= value_is_defined_before(si, pos, arg);
 672 #endif
 673         }
 674
 675         return res;
 676 }
 677
 678 /**
 679  * Tells you whether a @p remat can be placed after the irn @p pos
 680  */
 681 static INLINE int
 682 can_remat_after(const spill_ilp_t * si, const remat_t * remat, const ir_node * pos, const pset * live)
 683 {
 684         if(is_Block(pos)) {
 685                 pos = sched_block_first_nonphi(pos);
 686         } else {
 687                 pos = sched_next_op(pos);
 688         }
 689
 690         /* only remat AFTER the real definition of a value (?) */
 691         if(!value_is_defined_before(si, pos, remat->value)) {
 692                 return 0;
 693         }
 694
 695         return can_remat_before(si, remat, pos, live);
 696 }
 697
 698 /**
 699  * Collect potetially rematerializable OPs
 700  */
 701 static void
 702 walker_remat_collector(ir_node * irn, void * data)
 703 {
 704         spill_ilp_t    *si = data;
 705
 706         if(!is_Block(irn) && !is_Phi(irn)) {
 707                 DBG((si->dbg, LEVEL_4, "\t  Processing %+F\n", irn));
 708                 get_remats_from_op(si, irn);
 709         }
 710 }
 711
 712 /**
 713  * Inserts a copy of @p irn before @p pos
 714  */
 715 static ir_node *
 716 insert_copy_before(const spill_ilp_t * si, const ir_node * irn, ir_node * pos)
 717 {
 718         ir_node     *bb;
 719         ir_node     *copy;
 720
 721         bb = is_Block(pos)?pos:get_nodes_block(pos);
 722         copy = exact_copy(irn);
 723         set_nodes_block(copy, bb);
 724         sched_put_before(si, pos, copy);
 725
 726         return copy;
 727 }
 728
 729 /**
 730  * Inserts a copy of @p irn after @p pos
 731  */
 732 static ir_node *
 733 insert_copy_after(const spill_ilp_t * si, const ir_node * irn, ir_node * pos)
 734 {
 735         ir_node     *bb;
 736         ir_node     *copy;
 737
 738         bb = is_Block(pos)?pos:get_nodes_block(pos);
 739         copy = exact_copy(irn);
 740         set_nodes_block(copy, bb);
 741         sched_put_after(pos, copy);
 742
 743         return copy;
 744 }
 745
 746 static void
 747 insert_remat_after(spill_ilp_t * si, const remat_t * remat, const ir_node * pos, const pset * live)
 748 {
 749         char     buf[256];
 750
 751         if(can_remat_after(si, remat, pos, live)) {
 752                 ir_node         *copy,
 753                                                 *proj_copy;
 754                 op_t            *op;
 755
 756                 DBG((si->dbg, LEVEL_3, "\t  >inserting remat %+F\n", remat->op));
 757
 758                 copy = insert_copy_after(si, remat->op, pos);
 759
 760 //              ir_snprintf(buf, sizeof(buf), "remat2_%N_%N", remat->value, pos);
 761                 ir_snprintf(buf, sizeof(buf), "remat2_%N_%N", copy, pos);
 762                 op = obstack_alloc(si->obst, sizeof(*op));
 763                 op->is_remat = 1;
 764                 op->attr.remat.remat = remat;
 765                 op->attr.remat.pre = 0;
 766                 op->attr.remat.ilp = lpp_add_var(si->lpp, buf, lpp_binary, remat->cost*execution_frequency(si, pos));
 767
 768                 set_irn_link(copy, op);
 769                 pset_insert_ptr(si->all_possible_remats, copy);
 770                 if(remat->proj) {
 771                         proj_copy = insert_copy_after(si, remat->proj, copy);
 772                         set_irn_n(proj_copy, 0, copy);
 773                         set_irn_link(proj_copy, op);
 774                         pset_insert_ptr(si->all_possible_remats, proj_copy);
 775                 } else {
 776                         proj_copy = NULL;
 777                 }
 778         }
 779 }
 780
 781 static void
 782 insert_remat_before(spill_ilp_t * si, const remat_t * remat, const ir_node * pos, const pset * live)
 783 {
 784         char     buf[256];
 785
 786         if(can_remat_before(si, remat, pos, live)) {
 787                 ir_node         *copy,
 788                                                 *proj_copy;
 789                 op_t            *op;
 790
 791                 DBG((si->dbg, LEVEL_3, "\t  >inserting remat %+F\n", remat->op));
 792
 793                 copy = insert_copy_before(si, remat->op, pos);
 794
 795 //              ir_snprintf(buf, sizeof(buf), "remat_%N_%N", remat->value, pos);
 796                 ir_snprintf(buf, sizeof(buf), "remat_%N_%N", copy, pos);
 797                 op = obstack_alloc(si->obst, sizeof(*op));
 798                 op->is_remat = 1;
 799                 op->attr.remat.remat = remat;
 800                 op->attr.remat.pre = 1;
 801                 op->attr.remat.ilp = lpp_add_var(si->lpp, buf, lpp_binary, remat->cost*execution_frequency(si, pos));
 802
 803                 set_irn_link(copy, op);
 804                 pset_insert_ptr(si->all_possible_remats, copy);
 805                 if(remat->proj) {
 806                         proj_copy = insert_copy_after(si, remat->proj, copy);
 807                         set_irn_n(proj_copy, 0, copy);
 808                         set_irn_link(proj_copy, op);
 809                         pset_insert_ptr(si->all_possible_remats, proj_copy);
 810                 } else {
 811                         proj_copy = NULL;
 812                 }
 813         }
 814 }
 815
 816 static int
 817 get_block_n_succs(const ir_node *block) {
 818         const ir_edge_t *edge;
 819
 820         assert(edges_activated(current_ir_graph));
 821
 822         edge = get_block_succ_first(block);
 823         if (! edge)
 824                 return 0;
 825
 826         edge = get_block_succ_next(block, edge);
 827         return edge ? 2 : 1;
 828 }
 829
 830 static int
 831 is_merge_edge(const ir_node * bb)
 832 {
 833 #ifdef GOODWIN_REDUCTION
 834         return get_block_n_succs(bb) == 1;
 835 #else
 836         return 1;
 837 #endif
 838 }
 839
 840 static int
 841 is_diverge_edge(const ir_node * bb)
 842 {
 843 #ifdef GOODWIN_REDUCTION
 844         return get_Block_n_cfgpreds(bb) == 1;
 845 #else
 846         return 1;
 847 #endif
 848 }
 849
 850 /**
 851  * Insert (so far unused) remats into the irg to
 852  * recompute the potential liveness of all values
 853  */
 854 static void
 855 walker_remat_insertor(ir_node * bb, void * data)
 856 {
 857         spill_ilp_t    *si = data;
 858         spill_bb_t     *spill_bb;
 859         ir_node        *irn;
 860         int             i,
 861                                         n;
 862         irn_live_t     *li;
 863         pset           *live = pset_new_ptr_default();
 864
 865         DBG((si->dbg, LEVEL_3, "\t Entering %+F\n\n", bb));
 866
 867         live_foreach(bb, li) {
 868                 ir_node        *value = (ir_node *) li->irn;
 869
 870                 /* add remats at end of block */
 871                 if (live_is_end(li) && has_reg_class(si, value)) {
 872                         pset_insert_ptr(live, value);
 873                 }
 874         }
 875
 876         spill_bb = obstack_alloc(si->obst, sizeof(*spill_bb));
 877         set_irn_link(bb, spill_bb);
 878
 879         irn = sched_last(bb);
 880         while(!sched_is_end(irn)) {
 881                 ir_node   *next;
 882                 op_t      *op;
 883                 pset      *args;
 884                 ir_node   *arg;
 885
 886                 next = sched_prev(irn);
 887
 888                 DBG((si->dbg, LEVEL_5, "\t at %+F (next: %+F)\n", irn, next));
 889
 890                 if(is_Phi(irn) || is_Proj(irn)) {
 891                         op_t      *op;
 892
 893                         if(has_reg_class(si, irn)) {
 894                                 pset_remove_ptr(live, irn);
 895                         }
 896
 897                         op = obstack_alloc(si->obst, sizeof(*op));
 898                         op->is_remat = 0;
 899                         op->attr.live_range.reloads = NULL;
 900                         op->attr.live_range.ilp = ILP_UNDEF;
 901                         set_irn_link(irn, op);
 902
 903                         irn = next;
 904                         continue;
 905                 }
 906
 907                 op = obstack_alloc(si->obst, sizeof(*op));
 908                 op->is_remat = 0;
 909                 op->attr.live_range.ilp = ILP_UNDEF;
 910                 op->attr.live_range.reloads = obstack_alloc(si->obst, sizeof(*op->attr.live_range.reloads) * get_irn_arity(irn));
 911                 memset(op->attr.live_range.reloads, 0xFF, sizeof(*op->attr.live_range.reloads) * get_irn_arity(irn));
 912                 set_irn_link(irn, op);
 913
 914                 args = pset_new_ptr_default();
 915
 916                 /* collect arguments of op */
 917                 for (i = 0, n = get_irn_arity(irn); i < n; ++i) {
 918                         ir_node        *arg = get_irn_n(irn, i);
 919
 920                         pset_insert_ptr(args, arg);
 921                 }
 922
 923                 /* set args of op live in epilog */
 924                 pset_foreach(args, arg) {
 925                         if(has_reg_class(si, arg)) {
 926                                 pset_insert_ptr(live, arg);
 927                         }
 928                 }
 929
 930                 /* insert all possible remats after irn */
 931                 pset_foreach(args, arg) {
 932                         remat_info_t   *remat_info,
 933                                                     query;
 934                         remat_t        *remat;
 935
 936                         /* continue if the operand has the wrong reg class
 937                          */
 938                         if(!has_reg_class(si, arg))
 939                                 continue;
 940
 941                         query.irn = arg;
 942                         query.remats = NULL;
 943                         query.remats_by_operand = NULL;
 944                         remat_info = set_find(si->remat_info, &query, sizeof(query), HASH_PTR(arg));
 945
 946                         if(!remat_info) {
 947                                 continue;
 948                         }
 949
 950                         /* do not place post remats after jumps */
 951                         if(sched_skip_cf_predicator(irn, si->chordal_env->birg->main_env->arch_env)) continue;
 952
 953                         if(remat_info->remats_by_operand) {
 954                                 pset_foreach(remat_info->remats_by_operand, remat) {
 955                                         /* do not insert remats producing the same value as one of the operands */
 956                                         if(!pset_find_ptr(args, remat->value)) {
 957                                                 DBG((si->dbg, LEVEL_4, "\t  considering remat %+F with arg %+F\n", remat->op, arg));
 958 #ifdef REMAT_WHILE_LIVE
 959                                                 if(pset_find_ptr(live, remat->value)) {
 960                                                         insert_remat_after(si, remat, irn, live);
 961                                                 }
 962 #else
 963                                                 insert_remat_after(si, remat, irn, live);
 964 #endif
 965                                         }
 966                                 }
 967                         }
 968                 }
 969
 970                 /* delete defined value from live set */
 971                 if(has_reg_class(si, irn)) {
 972                         pset_remove_ptr(live, irn);
 973                 }
 974
 975                 /* insert all possible remats before irn */
 976                 pset_foreach(args, arg) {
 977                         remat_info_t   *remat_info,
 978                                                     query;
 979                         remat_t        *remat;
 980
 981                         /* continue if the operand has the wrong reg class
 982                          */
 983                         if(!has_reg_class(si, arg))
 984                                 continue;
 985
 986                         query.irn = arg;
 987                         query.remats = NULL;
 988                         query.remats_by_operand = NULL;
 989                         remat_info = set_find(si->remat_info, &query, sizeof(query), HASH_PTR(arg));
 990
 991                         if(!remat_info) {
 992                                 continue;
 993                         }
 994
 995                         if(remat_info->remats) {
 996                                 pset_foreach(remat_info->remats, remat) {
 997                                         DBG((si->dbg, LEVEL_4, "\t  considering remat %+F for arg %+F\n", remat->op, arg));
 998 #ifdef REMAT_WHILE_LIVE
 999                                         if(pset_find_ptr(live, remat->value)) {
1000                                                 insert_remat_before(si, remat, irn, live);
1001                                         }
1002 #else
1003                                         insert_remat_before(si, remat, irn, live);
1004 #endif
1005                                 }
1006                         }
1007                 }
1008
1009                 del_pset(args);
1010                 irn = next;
1011         }
1012
1013         live_foreach(bb, li) {
1014                 ir_node        *value = (ir_node *) li->irn;
1015
1016                 /* add remats at end if successor has multiple predecessors */
1017                 if(is_merge_edge(bb)) {
1018                         /* add remats at end of block */
1019                         if (live_is_end(li) && has_reg_class(si, value)) {
1020                                 remat_info_t   *remat_info,
1021                                                            query;
1022                                 remat_t        *remat;
1023
1024                                 query.irn = value;
1025                                 query.remats = NULL;
1026                                 query.remats_by_operand = NULL;
1027                                 remat_info = set_find(si->remat_info, &query, sizeof(query), HASH_PTR(value));
1028
1029                                 if(remat_info && remat_info->remats) {
1030                                         pset_foreach(remat_info->remats, remat) {
1031                                                 DBG((si->dbg, LEVEL_4, "\t  considering remat %+F at end of block %+F\n", remat->op, bb));
1032
1033                                                 insert_remat_before(si, remat, bb, NULL);
1034                                         }
1035                                 }
1036                         }
1037                 }
1038                 if(is_diverge_edge(bb)) {
1039                         /* add remat2s at beginning of block */
1040                         if ((live_is_in(li) || (is_Phi(value) && get_nodes_block(value)==bb)) && has_reg_class(si, value)) {
1041                                 remat_info_t   *remat_info,
1042                                                            query;
1043                                 remat_t        *remat;
1044
1045                                 query.irn = value;
1046                                 query.remats = NULL;
1047                                 query.remats_by_operand = NULL;
1048                                 remat_info = set_find(si->remat_info, &query, sizeof(query), HASH_PTR(value));
1049
1050                                 if(remat_info && remat_info->remats) {
1051                                         pset_foreach(remat_info->remats, remat) {
1052                                                 DBG((si->dbg, LEVEL_4, "\t  considering remat %+F at beginning of block %+F\n", remat->op, bb));
1053
1054                                                 /* put the remat here if all its args are available */
1055                                                 insert_remat_after(si, remat, bb, NULL);
1056
1057                                         }
1058                                 }
1059                         }
1060                 }
1061         }
1062 }
1063
1064 /**
1065  * Preparation of blocks' ends for Luke Blockwalker(tm)(R)
1066  */
1067 static void
1068 luke_endwalker(ir_node * bb, void * data)
1069 {
1070         spill_ilp_t    *si = (spill_ilp_t*)data;
1071         irn_live_t     *li;
1072         pset           *live;
1073         pset           *use_end;
1074         char            buf[256];
1075         ilp_cst_t       cst;
1076         ir_node        *irn;
1077         spill_bb_t     *spill_bb = get_irn_link(bb);
1078
1079
1080         live = pset_new_ptr_default();
1081         use_end = pset_new_ptr_default();
1082
1083         live_foreach(bb, li) {
1084                 irn = (ir_node *) li->irn;
1085                 if (live_is_end(li) && has_reg_class(si, irn) && !pset_find_ptr(si->all_possible_remats, irn)) {
1086                         op_t      *op;
1087
1088                         pset_insert_ptr(live, irn);
1089                         op = get_irn_link(irn);
1090                         assert(!op->is_remat);
1091                 }
1092         }
1093
1094         /* collect values used by cond jumps etc. at bb end (use_end) -> always live */
1095         /* their reg_out is unimportant because it can always be set */
1096         sched_foreach_reverse(bb, irn) {
1097                 int   i,
1098                           n;
1099
1100                 if(!sched_skip_cf_predicator(irn, si->chordal_env->birg->main_env->arch_env)) break;
1101
1102                 for (i = 0, n = get_irn_arity(irn); i < n; ++i) {
1103                         ir_node        *irn_arg = get_irn_n(irn, i);
1104                         if(has_reg_class(si, irn_arg)) {
1105                                 pset_insert_ptr(use_end, irn);
1106                         }
1107                 }
1108         }
1109
1110         ir_snprintf(buf, sizeof(buf), "check_end_%N", bb);
1111         cst = lpp_add_cst(si->lpp, buf, lpp_less, si->n_regs - pset_count(use_end));
1112
1113         spill_bb->ilp = new_set(cmp_spill, 16);
1114
1115         live_foreach(bb, li) {
1116                 irn = (ir_node *) li->irn;
1117                 if (live_is_end(li) && has_reg_class(si, irn) && !pset_find_ptr(si->all_possible_remats, irn)) {
1118                         spill_t     query,
1119                                    *spill;
1120
1121                         query.irn = irn;
1122                         spill = set_insert(spill_bb->ilp, &query, sizeof(query), HASH_PTR(irn));
1123
1124                         ir_snprintf(buf, sizeof(buf), "reg_out_%N_%N", irn, bb);
1125                         spill->reg_out = lpp_add_var(si->lpp, buf, lpp_binary, 0.0);
1126                         /* if irn is used at the end of the block, then it is live anyway */
1127                         if(!pset_find_ptr(use_end, irn))
1128                                 lpp_set_factor_fast(si->lpp, cst, spill->reg_out, 1.0);
1129
1130                         ir_snprintf(buf, sizeof(buf), "mem_out_%N_%N", irn, bb);
1131                         spill->mem_out = lpp_add_var(si->lpp, buf, lpp_binary, 0.0);
1132
1133                         ir_snprintf(buf, sizeof(buf), "spill_%N_%N", irn, bb);
1134                         spill->spill = lpp_add_var(si->lpp, buf, lpp_binary, COST_STORE*execution_frequency(si, bb));
1135
1136                         spill->reg_in = ILP_UNDEF;
1137                         spill->mem_in = ILP_UNDEF;
1138                 }
1139         }
1140
1141         del_pset(live);
1142         del_pset(use_end);
1143 }
1144
1145 static ir_node *
1146 next_post_remat(const ir_node * irn)
1147 {
1148         op_t      *op;
1149
1150         if(is_Block(irn)) {
1151                 irn = sched_block_first_nonphi(irn);
1152         } else {
1153                 irn = sched_next_op(irn);
1154         }
1155
1156         if(sched_is_end(irn))
1157                 return NULL;
1158
1159         op = (op_t*)get_irn_link(irn);
1160         if(op->is_remat && !op->attr.remat.pre) {
1161                 return irn;
1162         }
1163
1164         return NULL;
1165 }
1166
1167
1168 static ir_node *
1169 next_pre_remat(const spill_ilp_t * si, const ir_node * irn)
1170 {
1171         op_t      *op;
1172         ir_node   *ret;
1173
1174         if(is_Block(irn)) {
1175                 ret = sched_block_last_noncf(si, irn);
1176                 ret = sched_next(ret);
1177                 ret = sched_prev_op(ret);
1178         } else {
1179                 ret = sched_prev_op(irn);
1180         }
1181
1182         if(sched_is_end(ret) || is_Phi(ret))
1183                 return NULL;
1184
1185         op = (op_t*)get_irn_link(ret);
1186         if(op->is_remat && op->attr.remat.pre) {
1187                 return ret;
1188         }
1189
1190         return NULL;
1191 }
1192
1193 /**
1194  * Find a remat of value @p value in the epilog of @p pos
1195  */
1196 static ir_node *
1197 find_post_remat(const ir_node * value, const ir_node * pos)
1198 {
1199         while((pos = next_post_remat(pos)) != NULL) {
1200                 op_t   *op;
1201
1202                 op = get_irn_link(pos);
1203                 assert(op->is_remat && !op->attr.remat.pre);
1204
1205                 if(op->attr.remat.remat->value == value)
1206                         return (ir_node*)pos;
1207
1208 #if 0
1209         const ir_edge_t *edge;
1210                 foreach_out_edge(pos, edge) {
1211                         ir_node   *proj = get_edge_src_irn(edge);
1212                         assert(is_Proj(proj));
1213                 }
1214 #endif
1215
1216         }
1217
1218         return NULL;
1219 }
1220
1221 /**
1222  * Find a remat of value @p value in the prolog of @p pos
1223  */
1224 static ir_node *
1225 find_pre_remat(const spill_ilp_t * si, const ir_node * value, const ir_node * pos)
1226 {
1227         while((pos = next_pre_remat(si,pos)) != NULL) {
1228                 op_t   *op;
1229
1230                 op = get_irn_link(pos);
1231                 assert(op->is_remat && op->attr.remat.pre);
1232
1233                 if(op->attr.remat.remat->value == value)
1234                         return (ir_node*)pos;
1235         }
1236
1237         return NULL;
1238 }
1239
1240 static spill_t *
1241 add_to_spill_bb(spill_ilp_t * si, ir_node * bb, ir_node * irn)
1242 {
1243         spill_bb_t  *spill_bb = get_irn_link(bb);
1244         spill_t     *spill,
1245                                  query;
1246         char         buf[256];
1247
1248         query.irn = irn;
1249         spill = set_find(spill_bb->ilp, &query, sizeof(query), HASH_PTR(irn));
1250         if(!spill) {
1251                 spill = set_insert(spill_bb->ilp, &query, sizeof(query), HASH_PTR(irn));
1252
1253                 spill->reg_out = ILP_UNDEF;
1254                 spill->reg_in  = ILP_UNDEF;
1255                 spill->mem_in  = ILP_UNDEF;
1256
1257                 ir_snprintf(buf, sizeof(buf), "mem_out_%N_%N", irn, bb);
1258                 spill->mem_out = lpp_add_var(si->lpp, buf, lpp_binary, 0.0);
1259
1260                 ir_snprintf(buf, sizeof(buf), "spill_%N_%N", irn, bb);
1261                 spill->spill = lpp_add_var(si->lpp, buf, lpp_binary, COST_STORE*execution_frequency(si, bb));
1262         }
1263
1264         return spill;
1265 }
1266
1267 /**
1268  * Walk all irg blocks and emit this ILP
1269  */
1270 static void
1271 luke_blockwalker(ir_node * bb, void * data)
1272 {
1273         spill_ilp_t    *si = (spill_ilp_t*)data;
1274         ir_node        *irn;
1275         irn_live_t     *li;
1276         pset           *live;
1277         char            buf[256];
1278         ilp_cst_t       cst;
1279         spill_bb_t     *spill_bb = get_irn_link(bb);
1280         int             i;
1281         ir_node        *tmp;
1282         spill_t        *spill;
1283
1284
1285         live = pset_new_ptr_default();
1286
1287         /* do something at the end of the block */
1288
1289         /* init live values at end of block */
1290         live_foreach(bb, li) {
1291                 ir_node        *irn = (ir_node *) li->irn;
1292
1293                 if (live_is_end(li) && has_reg_class(si, irn) && !pset_find_ptr(si->all_possible_remats, irn)) {
1294                         pset_insert_ptr(live, irn);
1295                 }
1296         }
1297
1298         if(is_merge_edge(bb)) {
1299                 spill_bb->reloads = obstack_alloc(si->obst, pset_count(live) * sizeof(*spill_bb->reloads));
1300                 memset(spill_bb->reloads, 0xFF, pset_count(live) * sizeof(*spill_bb->reloads));
1301         } else {
1302                 spill_bb->reloads = NULL;
1303         }
1304
1305         i=0;
1306         live_foreach(bb, li) {
1307                 ir_node        *irn = (ir_node *) li->irn;
1308                 op_t           *op;
1309
1310                 if (live_is_end(li) && has_reg_class(si, irn) && !pset_find_ptr(si->all_possible_remats, irn)) {
1311                         spill = set_find_spill(spill_bb->ilp, irn);
1312                         assert(spill);
1313
1314                         if(spill_bb->reloads) {
1315                                 ir_snprintf(buf, sizeof(buf), "reload_%N_%N", bb, irn);
1316                                 spill_bb->reloads[i] = lpp_add_var(si->lpp, buf, lpp_binary, COST_LOAD*execution_frequency(si, bb));
1317
1318                                 /* reload <= mem_out */
1319                                 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1320                                 lpp_set_factor_fast(si->lpp, cst, spill_bb->reloads[i], 1.0);
1321                                 lpp_set_factor_fast(si->lpp, cst, spill->mem_out, -1.0);
1322                         }
1323
1324                         op = get_irn_link(irn);
1325                         assert(!op->is_remat);
1326
1327                         ir_snprintf(buf, sizeof(buf), "lr_%N_%N", irn, bb);
1328                         op->attr.live_range.ilp = lpp_add_var(si->lpp, buf, lpp_binary, 0.0);
1329                         op->attr.live_range.op = bb;
1330
1331                         ir_snprintf(buf, sizeof(buf), "reg_out_%N_%N", bb, irn);
1332                         cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1333
1334                         /* reg_out - reload - remat - live_range <= 0 */
1335                         lpp_set_factor_fast(si->lpp, cst, spill->reg_out, 1.0);
1336                         if(spill_bb->reloads) lpp_set_factor_fast(si->lpp, cst, spill_bb->reloads[i], -1.0);
1337                         lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.ilp, -1.0);
1338                         foreach_pre_remat(si, bb, tmp) {
1339                                 op_t     *remat_op = get_irn_link(tmp);
1340                                 if(remat_op->attr.remat.remat->value == irn) {
1341                                         lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, -1.0);
1342                                 }
1343                         }
1344
1345                         ++i;
1346                 }
1347         }
1348         DBG((si->dbg, LEVEL_4, "\t   %d values live at end of block %+F\n", pset_count(live), bb));
1349
1350         sched_foreach_reverse(bb, irn) {
1351                 op_t       *op;
1352                 op_t       *tmp_op;
1353                 int         n,
1354                                         k,
1355                                         d = 0;
1356                 ilp_cst_t       check_pre,
1357                                         check_post;
1358 #ifdef CHECK_POST_REMAT
1359                 ilp_cst_t       check_post_remat;
1360 #endif
1361                 set        *args = new_set(cmp_keyval, get_irn_arity(irn));
1362                 keyval_t   *keyval;
1363
1364                 if(is_Phi(irn))
1365                         break;
1366
1367                 op = get_irn_link(irn);
1368                 /* skip remats */
1369                 if(op->is_remat) continue;
1370                 DBG((si->dbg, LEVEL_4, "\t  at node %+F\n", irn));
1371
1372                 if(has_reg_class(si, irn)) {
1373                         assert(pset_find_ptr(live, irn));
1374                         pset_remove_ptr(live, irn);
1375                 }
1376
1377                 /* init set of irn's arguments */
1378                 for (i = 0, n = get_irn_arity(irn); i < n; ++i) {
1379                         ir_node        *irn_arg = get_irn_n(irn, i);
1380                         if(has_reg_class(si, irn_arg)) {
1381                                 set_insert_keyval(args, irn_arg, (void*)i);
1382                         }
1383                 }
1384
1385 #ifdef CHECK_POST_REMAT
1386                 /* check the register pressure after the epilog */
1387                 ir_snprintf(buf, sizeof(buf), "check_post_remat_%N", irn);
1388                 check_post_remat = lpp_add_cst(si->lpp, buf, lpp_less, si->n_regs);
1389
1390                 /* iterate over L\U */
1391                 pset_foreach(live, tmp) {
1392                         if(!set_find_keyval(args, tmp)) {
1393                                 /* if a live value is not used by irn */
1394                                 tmp_op = get_irn_link(tmp);
1395 //                              assert(tmp_op->attr.live_range.op != irn);
1396                                 lpp_set_factor_fast(si->lpp, check_post_remat, tmp_op->attr.live_range.ilp, 1.0);
1397                         }
1398                 }
1399                 /* iterate over following remats and remove possibly defined values again from check_post_remat */
1400                 foreach_post_remat(irn, tmp) {
1401                         op_t           *remat_op = get_irn_link(tmp);
1402                         const ir_node  *value = remat_op->attr.remat.remat->value;
1403                         op_t           *val_op = get_irn_link(value);
1404
1405                         assert(remat_op->is_remat && !remat_op->attr.remat.pre);
1406
1407                         /* values that are defined by remat2s are not counted */
1408 #ifdef REMAT_WHILE_LIVE
1409                         assert(val_op->attr.live_range.ilp);
1410                         lpp_set_factor_fast(si->lpp, check_post_remat, val_op->attr.live_range.ilp, 0.0);
1411 #else
1412                         if(val_op->attr.live_range.ilp != ILP_UNDEF) {
1413                                 lpp_set_factor_fast(si->lpp, check_post_remat, val_op->attr.live_range.ilp, 0.0);
1414                         }
1415 #endif /* REMAT_WHILE_LIVE */
1416                 }
1417 #endif /* CHECK_POST_REMAT */
1418
1419
1420                 /* new live ranges for values from L\U defined by remat2s or used by remats */
1421                 pset_foreach(live, tmp) {
1422                         ir_node     *value = tmp;//remat_op->attr.remat.remat->value;
1423                         op_t        *value_op = get_irn_link(value);
1424
1425                         if(!set_find_keyval(args, value)) {
1426                                 ilp_var_t    prev_lr = ILP_UNDEF;
1427                                 ir_node     *remat;
1428                                 cst = ILP_UNDEF;
1429
1430                                 foreach_post_remat(irn, remat) {
1431                                         op_t        *remat_op = get_irn_link(remat);
1432
1433                                         /* if value is being rematerialized by this remat */
1434                                         if(value == remat_op->attr.remat.remat->value) {
1435                                                 if(cst == ILP_UNDEF) {
1436                                                         /* next_live_range <= prev_live_range + sum remat2s */
1437                                                         ir_snprintf(buf, sizeof(buf), "next_lr_%N_%N", value, irn);
1438                                                         cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1439                                                         ir_snprintf(buf, sizeof(buf), "lr_%N_%N", value, irn);
1440                                                         prev_lr = lpp_add_var(si->lpp, buf, lpp_binary, 0.0);
1441                                                         lpp_set_factor_fast(si->lpp, cst, value_op->attr.live_range.ilp, 1.0);
1442                                                         lpp_set_factor_fast(si->lpp, cst, prev_lr, -1.0);
1443                                                 }
1444
1445                                                 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, -1.0);
1446                                         }
1447                                 }
1448
1449 #ifdef MAY_DIE_AT_PRE_REMAT
1450                                 if(cst == ILP_UNDEF) {
1451                                         foreach_pre_remat(si, irn, remat) {
1452                                                 int          i,
1453                                                                          n;
1454
1455                                                 for (i = 0, n = get_irn_arity(remat); i < n; ++i) {
1456                                                         ir_node        *remat_arg = get_irn_n(remat, i);
1457
1458                                                         /* if value is being used by this remat */
1459                                                         if(value == remat_arg) {
1460                                                                 /* next_live_range <= prev_live_range */
1461                                                                 ir_snprintf(buf, sizeof(buf), "lr_%N_%N", value, irn);
1462                                                                 prev_lr = lpp_add_var(si->lpp, buf, lpp_binary, 0.0);
1463
1464                                                                 ir_snprintf(buf, sizeof(buf), "next_lr_%N_%N", value, irn);
1465                                                                 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1466                                                                 lpp_set_factor_fast(si->lpp, cst, value_op->attr.live_range.ilp, 1.0);
1467                                                                 lpp_set_factor_fast(si->lpp, cst, prev_lr, -1.0);
1468                                                                 goto fertig;
1469                                                         }
1470                                                         /* TODO check afterwards whether lr dies after a pre-remat (should not happen) */
1471                                                 }
1472                                         }
1473                                 }
1474 fertig:
1475 #endif
1476
1477                                 if(prev_lr != ILP_UNDEF) {
1478                                         value_op->attr.live_range.ilp = prev_lr;
1479                                         value_op->attr.live_range.op = irn;
1480                                 }
1481                         }
1482                 }
1483
1484                 /* get count of values in my register class defined by irn */
1485                 /* also add defined values to check_post_remat; do this before iterating over args */
1486                 if(get_irn_mode(irn) == mode_T) {
1487                         ir_node  *proj = sched_next(irn);
1488                         op_t     *proj_op = get_irn_link(proj);
1489
1490                         while(is_Proj(proj)) {
1491                                 if(has_reg_class(si, proj)) {
1492                                         ++d;
1493 #ifdef CHECK_POST_REMAT
1494                                         lpp_set_factor_fast(si->lpp, check_post_remat, proj_op->attr.live_range.ilp, 1.0);
1495 #endif
1496                                 }
1497                                 proj = sched_next(proj);
1498                                 proj_op = get_irn_link(proj);
1499                         }
1500                 } else {
1501                         if(has_reg_class(si, irn)) {
1502                                  d = 1;
1503 #ifdef CHECK_POST_REMAT
1504                                  lpp_set_factor_fast(si->lpp, check_post_remat, op->attr.live_range.ilp, 1.0);
1505 #endif
1506                         }
1507                 }
1508                 DBG((si->dbg, LEVEL_4, "\t   %+F produces %d values in my register class\n", irn, d));
1509
1510                 /* count how many regs irn needs for arguments */
1511                 k = set_count(args);
1512
1513                 /* check the register pressure in the prolog */
1514                 /* sum_{L\U} lr <= n - |U| */
1515                 ir_snprintf(buf, sizeof(buf), "check_pre_%N", irn);
1516                 check_pre = lpp_add_cst(si->lpp, buf, lpp_less, si->n_regs - k);
1517
1518                 /* check the register pressure in the epilog */
1519                 ir_snprintf(buf, sizeof(buf), "check_post_%N", irn);
1520                 check_post = lpp_add_cst(si->lpp, buf, lpp_less, si->n_regs - d);
1521
1522                 set_foreach(args, keyval) {
1523                         ilp_var_t       next_lr;
1524                         op_t           *arg_op;
1525                         ilp_var_t       post_use;
1526                         int             p = 0;
1527                         spill_t        *spill;
1528                         ir_node        *arg = keyval->key;
1529
1530                         spill = add_to_spill_bb(si, bb, arg);
1531
1532                         ir_snprintf(buf, sizeof(buf), "lr_%N_%N", arg, irn);
1533                         next_lr = lpp_add_var(si->lpp, buf, lpp_binary, 0.0);
1534
1535                         i = (int)keyval->val;
1536                         assert(i<n);
1537
1538                         ir_snprintf(buf, sizeof(buf), "reload_%N_%N", arg, irn);
1539                         op->attr.live_range.reloads[i] = lpp_add_var(si->lpp, buf, lpp_binary, COST_LOAD*execution_frequency(si, bb));
1540
1541                         /* reload <= mem_out */
1542                         cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1543                         lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.reloads[i], 1.0);
1544                         lpp_set_factor_fast(si->lpp, cst, spill->mem_out, -1.0);
1545
1546                         arg_op = get_irn_link(arg);
1547
1548                         /* requirement: arg must be in register for use */
1549                         /* reload + remat + live_range == 1 */
1550                         ir_snprintf(buf, sizeof(buf), "req_%N_%N", irn, arg);
1551                         cst = lpp_add_cst(si->lpp, buf, lpp_equal, 1.0);
1552
1553                         lpp_set_factor_fast(si->lpp, cst, next_lr, 1.0);
1554                         lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.reloads[i], 1.0);
1555                         foreach_pre_remat(si, irn, tmp) {
1556                                 op_t     *remat_op = get_irn_link(tmp);
1557                                 if(remat_op->attr.remat.remat->value == arg) {
1558                                         lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
1559                                 }
1560                         }
1561
1562                         /* the epilog stuff - including post_use, post, post_remat */
1563                         ir_snprintf(buf, sizeof(buf), "post_use_%N_%N", arg, irn);
1564                         post_use = lpp_add_var(si->lpp, buf, lpp_binary, 0.0);
1565
1566                         lpp_set_factor_fast(si->lpp, check_post, post_use, 1.0);
1567
1568                         /* arg is live throughout epilog if the next live_range is in a register */
1569                         if(pset_find_ptr(live, arg)) {
1570                                 DBG((si->dbg, LEVEL_3, "\t  arg %+F is possibly live in epilog of %+F\n", arg, irn));
1571
1572                                 ir_snprintf(buf, sizeof(buf), "post_use_%N_%N-%d", arg, irn, p++);
1573                                 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1574                                 lpp_set_factor_fast(si->lpp, cst, post_use, -1.0);
1575                                 lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, 1.0);
1576
1577 #ifdef CHECK_POST_REMAT
1578                                 lpp_set_factor_fast(si->lpp, check_post_remat, arg_op->attr.live_range.ilp, 1.0);
1579 #endif
1580                         }
1581
1582                         /*forall remat2 which use arg add a similar cst*/
1583                         foreach_post_remat(irn, tmp) {
1584                                 int         i,
1585                                                         n;
1586
1587                                 for (i = 0, n = get_irn_arity(tmp); i < n; ++i) {
1588                                         ir_node    *remat_arg = get_irn_n(tmp, i);
1589                                         op_t       *remat_op = get_irn_link(tmp);
1590
1591                                         if(remat_arg == arg) {
1592                                                 DBG((si->dbg, LEVEL_3, "\t  found remat with arg %+F in epilog of %+F\n", arg, irn));
1593
1594                                                 ir_snprintf(buf, sizeof(buf), "post_use_%N_%N-%d", arg, irn, p++);
1595                                                 cst = lpp_add_cst(si->lpp, buf, lpp_greater, 0.0);
1596                                                 lpp_set_factor_fast(si->lpp, cst, post_use, 1.0);
1597                                                 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, -1.0);
1598                                         }
1599                                 }
1600                         }
1601
1602                         /* new live range begins for each argument */
1603                         arg_op->attr.live_range.ilp = next_lr;
1604                         arg_op->attr.live_range.op = irn;
1605
1606                         pset_insert_ptr(live, arg);
1607                 }
1608
1609                 /* start new live ranges for values used by remats */
1610                 foreach_pre_remat(si, irn, tmp) {
1611                         int          i,
1612                                                  n;
1613
1614                         for (i = 0, n = get_irn_arity(tmp); i < n; ++i) {
1615                                 ir_node        *remat_arg = get_irn_n(tmp, i);
1616                                 op_t           *arg_op = get_irn_link(remat_arg);
1617                                 ilp_var_t       prev_lr;
1618
1619                                 if(!has_reg_class(si, remat_arg)) continue;
1620
1621                                 /* if value is becoming live through use by remat */
1622                                 if(!pset_find_ptr(live, remat_arg)) {
1623                                         ir_snprintf(buf, sizeof(buf), "lr_%N_%N", remat_arg, irn);
1624                                         prev_lr = lpp_add_var(si->lpp, buf, lpp_binary, 0.0);
1625
1626                                         arg_op->attr.live_range.ilp = prev_lr;
1627                                         arg_op->attr.live_range.op = irn;
1628
1629                                         DBG((si->dbg, LEVEL_4, "  value %+F becoming live through use by remat %+F\n", remat_arg, tmp));
1630
1631                                         /* TODO ist das hier die richtige Stelle???? */
1632                                         pset_insert_ptr(live, remat_arg);
1633                                         add_to_spill_bb(si, bb, remat_arg);
1634                                 }
1635                                 /* TODO check afterwards whether lr dies after a pre-remat (should not happen) */
1636                         }
1637                 }
1638
1639                 /* iterate over L\U */
1640                 pset_foreach(live, tmp) {
1641                         if(!set_find_keyval(args, tmp)) {
1642                                 /* if a live value is not used by irn */
1643                                 tmp_op = get_irn_link(tmp);
1644 //                              assert(tmp_op->attr.live_range.op != irn);
1645                                 lpp_set_factor_fast(si->lpp, check_pre, tmp_op->attr.live_range.ilp, 1.0);
1646                                 lpp_set_factor_fast(si->lpp, check_post, tmp_op->attr.live_range.ilp, 1.0);
1647                         }
1648                 }
1649
1650                 /* requirements for remats */
1651                 foreach_pre_remat(si, irn, tmp) {
1652                         op_t        *remat_op = get_irn_link(tmp);
1653                         int          i,
1654                                                  n;
1655
1656                         for (i = 0, n = get_irn_arity(tmp); i < n; ++i) {
1657                                 ir_node        *remat_arg = get_irn_n(tmp, i);
1658                                 op_t           *arg_op = get_irn_link(remat_arg);
1659
1660                                 if(!has_reg_class(si, remat_arg)) continue;
1661
1662                                 /* remat <= live_rang(remat_arg) [ + reload(remat_arg) ] */
1663                                 ir_snprintf(buf, sizeof(buf), "req_remat_%N_arg_%N", tmp, remat_arg);
1664                                 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1665
1666                                 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
1667                                 lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, -1.0);
1668
1669                                 /* if remat arg is also used by current op then we can use reload placed for this argument */
1670                                 if((keyval = set_find_keyval(args, remat_arg)) != NULL) {
1671                                         int    index = (int)keyval->val;
1672
1673                                         lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.reloads[index], -1.0);
1674                                 }
1675                         }
1676                 }
1677
1678                 /* requirements for remats2
1679                  *
1680                  *  TODO unsure if this does the right thing.
1681                  *  should insert values into set if they do not become live through remat and
1682                  *  op
1683                  */
1684                 foreach_post_remat(irn, tmp) {
1685                         op_t        *remat_op = get_irn_link(tmp);
1686                         int          i,
1687                                                  n;
1688
1689                         for (i = 0, n = get_irn_arity(tmp); i < n; ++i) {
1690                                 ir_node        *remat_arg = get_irn_n(tmp, i);
1691                                 op_t           *arg_op = get_irn_link(remat_arg);
1692
1693                                 if(!has_reg_class(si, remat_arg)) continue;
1694
1695                                 /* only for values in L\U, the others are handled with post_use */
1696                                 if(!set_find_keyval(args, remat_arg)) {
1697                                         /* remat <= live_rang(remat_arg) */
1698                                         ir_snprintf(buf, sizeof(buf), "req_remat2_%N_arg_%N", tmp, remat_arg);
1699                                         cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1700
1701                                         /* if value is becoming live through use by remat2 */
1702                                         if(!pset_find_ptr(live, remat_arg)) {
1703                                                 ilp_var_t     lr;
1704
1705                                                 ir_snprintf(buf, sizeof(buf), "lr_%N_%N", remat_arg, irn);
1706                                                 lr = lpp_add_var(si->lpp, buf, lpp_binary, 0.0);
1707
1708                                                 arg_op->attr.live_range.ilp = lr;
1709                                                 arg_op->attr.live_range.op = irn;
1710
1711                                                 DBG((si->dbg, LEVEL_3, "  value %+F becoming live through use by remat2 %+F\n", remat_arg, tmp));
1712
1713                                                 pset_insert_ptr(live, remat_arg);
1714                                                 add_to_spill_bb(si, bb, remat_arg);
1715                                         }
1716
1717                                         lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
1718                                         lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, -1.0);
1719                                 }
1720                         }
1721                 }
1722
1723 #ifdef CHECK_POST_REMAT
1724                 /* iterate over following remats and add them to check_post_remat */
1725                 foreach_post_remat(irn, tmp) {
1726                         op_t           *remat_op = get_irn_link(tmp);
1727
1728                         assert(remat_op->is_remat && !remat_op->attr.remat.pre);
1729
1730                         lpp_set_factor_fast(si->lpp, check_post_remat, remat_op->attr.remat.ilp, 1.0);
1731                 }
1732 #endif
1733
1734
1735
1736                 DBG((si->dbg, LEVEL_4, "\t   %d values live at %+F\n", pset_count(live), irn));
1737
1738                 pset_foreach(live, tmp) {
1739                         assert(has_reg_class(si, tmp));
1740                 }
1741
1742                 for (i = 0, n = get_irn_arity(irn); i < n; ++i) {
1743                         ir_node        *arg = get_irn_n(irn, i);
1744
1745                         assert(!find_post_remat(arg, irn) && "there should be no post remat for an argument of an op");
1746                 }
1747
1748                 del_set(args);
1749         }
1750
1751
1752
1753         /* do something at the beginning of the block */
1754
1755         /* we are now at the beginning of the basic block, there are only \Phis in front of us */
1756         DBG((si->dbg, LEVEL_3, "\t   %d values live at beginning of block %+F\n", pset_count(live), bb));
1757
1758         pset_foreach(live, irn) {
1759                 assert(is_Phi(irn) || get_nodes_block(irn) != bb);
1760         }
1761
1762         /* construct mem_outs for all values */
1763
1764         set_foreach(spill_bb->ilp, spill) {
1765                 ir_snprintf(buf, sizeof(buf), "mem_out_%N_%N", spill->irn, bb);
1766                 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1767
1768                 lpp_set_factor_fast(si->lpp, cst, spill->mem_out, 1.0);
1769                 lpp_set_factor_fast(si->lpp, cst, spill->spill, -1.0);
1770
1771                 if(pset_find_ptr(live, spill->irn)) {
1772                         DBG((si->dbg, LEVEL_5, "\t     %+F live at beginning of block %+F\n", spill->irn, bb));
1773
1774                         ir_snprintf(buf, sizeof(buf), "mem_in_%N_%N", spill->irn, bb);
1775                         spill->mem_in = lpp_add_var(si->lpp, buf, lpp_binary, 0.0);
1776
1777                         lpp_set_factor_fast(si->lpp, cst, spill->mem_in, -1.0);
1778                 }
1779         }
1780
1781
1782         /* L\U is empty at bb start */
1783         /* arg is live throughout epilog if it is reg_in into this block */
1784
1785         /* check the register pressure at the beginning of the block
1786          * including remats
1787          */
1788         ir_snprintf(buf, sizeof(buf), "check_start_%N", bb);
1789         cst = lpp_add_cst(si->lpp, buf, lpp_less, si->n_regs);
1790
1791         pset_foreach(live, irn) {
1792                         spill = set_find_spill(spill_bb->ilp, irn);
1793                         assert(spill);
1794
1795                         ir_snprintf(buf, sizeof(buf), "reg_in_%N_%N", irn, bb);
1796                         spill->reg_in = lpp_add_var(si->lpp, buf, lpp_binary, 0.0);
1797
1798                         lpp_set_factor_fast(si->lpp, cst, spill->reg_in, 1.0);
1799         }
1800         foreach_post_remat(bb, irn) {
1801                 op_t     *remat_op = get_irn_link(irn);
1802
1803                 DBG((si->dbg, LEVEL_4, "\t  next post remat: %+F\n", irn));
1804                 assert(remat_op->is_remat && !remat_op->attr.remat.pre);
1805
1806                 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
1807         }
1808
1809         /* forall remat2 add requirements */
1810         foreach_post_remat(bb, tmp) {
1811                 int         i,
1812                                         n;
1813
1814                 for (i = 0, n = get_irn_arity(tmp); i < n; ++i) {
1815                         ir_node    *remat_arg = get_irn_n(tmp, i);
1816                         op_t       *remat_op = get_irn_link(tmp);
1817
1818                         if(!has_reg_class(si, remat_arg)) continue;
1819
1820                         spill = set_find_spill(spill_bb->ilp, remat_arg);
1821                         assert(spill);
1822
1823                         /* TODO verify this is placed correctly */
1824                         ir_snprintf(buf, sizeof(buf), "req_remat2_%N_%N_arg_%N", tmp, bb, remat_arg);
1825                         cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1826                         lpp_set_factor_fast(si->lpp, cst, spill->reg_in, -1.0);
1827                         lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
1828                 }
1829         }
1830
1831         /* mem_in/reg_in for live_in values, especially phis and their arguments */
1832         pset_foreach(live, irn) {
1833                 int          p = 0,
1834                                          i,
1835                                          n;
1836
1837                 spill = set_find_spill(spill_bb->ilp, irn);
1838                 assert(spill && spill->irn == irn);
1839
1840                 if(is_Phi(irn) && get_nodes_block(irn) == bb) {
1841                         for (i = 0, n = get_Phi_n_preds(irn); i < n; ++i) {
1842                                 ilp_cst_t       mem_in,
1843                                                                 reg_in;
1844                                 ir_node        *phi_arg = get_Phi_pred(irn, i);
1845                                 ir_node        *bb_p = get_Block_cfgpred_block(bb, i);
1846                                 spill_bb_t     *spill_bb_p = get_irn_link(bb_p);
1847                                 spill_t        *spill_p;
1848
1849                                 /* although the phi is in the right regclass one or more of
1850                                  * its arguments can be in a different one or at least to
1851                                  * ignore
1852                                  */
1853                                 if(has_reg_class(si, phi_arg)) {
1854                                         ir_snprintf(buf, sizeof(buf), "mem_in_%N_%N-%d", irn, bb, p);
1855                                         mem_in = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1856                                         ir_snprintf(buf, sizeof(buf), "reg_in_%N_%N-%d", irn, bb, p++);
1857                                         reg_in = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1858
1859                                         lpp_set_factor_fast(si->lpp, mem_in, spill->mem_in, 1.0);
1860                                         lpp_set_factor_fast(si->lpp, reg_in, spill->reg_in, 1.0);
1861
1862                                         spill_p = set_find_spill(spill_bb_p->ilp, phi_arg);
1863                                         assert(spill_p);
1864
1865                                         lpp_set_factor_fast(si->lpp, mem_in, spill_p->mem_out, -1.0);
1866                                         lpp_set_factor_fast(si->lpp, reg_in, spill_p->reg_out, -1.0);
1867                                 }
1868                         }
1869                 } else {
1870                         /* else assure the value arrives on all paths in the same resource */
1871
1872                         for (i = 0, n = get_Block_n_cfgpreds(bb); i < n; ++i) {
1873                                 ilp_cst_t       mem_in,
1874                                                                 reg_in;
1875                                 ir_node        *bb_p = get_Block_cfgpred_block(bb, i);
1876                                 spill_bb_t     *spill_bb_p = get_irn_link(bb_p);
1877                                 spill_t        *spill_p;
1878
1879                                 ir_snprintf(buf, sizeof(buf), "mem_in_%N_%N-%d", irn, bb, p);
1880                                 mem_in = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1881                                 ir_snprintf(buf, sizeof(buf), "reg_in_%N_%N-%d", irn, bb, p++);
1882                                 reg_in = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1883
1884                                 lpp_set_factor_fast(si->lpp, mem_in, spill->mem_in, 1.0);
1885                                 lpp_set_factor_fast(si->lpp, reg_in, spill->reg_in, 1.0);
1886
1887                                 spill_p = set_find_spill(spill_bb_p->ilp, irn);
1888                                 assert(spill_p);
1889
1890                                 lpp_set_factor_fast(si->lpp, mem_in, spill_p->mem_out, -1.0);
1891                                 lpp_set_factor_fast(si->lpp, reg_in, spill_p->reg_out, -1.0);
1892                         }
1893                 }
1894         }
1895
1896         /* first live ranges from reg_ins */
1897         pset_foreach(live, irn) {
1898                 op_t      *op = get_irn_link(irn);
1899
1900                 spill = set_find_spill(spill_bb->ilp, irn);
1901                 assert(spill && spill->irn == irn);
1902
1903                 ir_snprintf(buf, sizeof(buf), "first_lr_%N_%N", irn, bb);
1904                 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1905                 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.ilp, 1.0);
1906                 lpp_set_factor_fast(si->lpp, cst, spill->reg_in, -1.0);
1907
1908                 foreach_post_remat(bb, tmp) {
1909                         op_t     *remat_op = get_irn_link(tmp);
1910
1911                         if(remat_op->attr.remat.remat->value == irn) {
1912                                 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, -1.0);
1913                         }
1914                 }
1915         }
1916
1917         /* walk forward now and compute constraints for placing spills */
1918         /* this must only be done for values that are not defined in this block */
1919         /* TODO are these values at start of block? if yes, just check whether this is a diverge edge and skip the loop */
1920         pset_foreach(live, irn) {
1921                 spill = set_find_spill(spill_bb->ilp, irn);
1922                 assert(spill);
1923
1924                 ir_snprintf(buf, sizeof(buf), "req_spill_%N_%N", irn, bb);
1925                 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1926
1927                 lpp_set_factor_fast(si->lpp, cst, spill->spill, 1.0);
1928                 if(is_diverge_edge(bb)) lpp_set_factor_fast(si->lpp, cst, spill->reg_in, -1.0);
1929
1930                 sched_foreach_op(bb, tmp) {
1931                         op_t   *op = get_irn_link(tmp);
1932
1933                         if(is_Phi(tmp)) continue;
1934                         assert(!is_Proj(tmp));
1935
1936                         if(op->is_remat) {
1937                                 ir_node   *value = op->attr.remat.remat->value;
1938
1939                                 if(value == irn) {
1940                                         /* only collect remats up to the first use of a value */
1941                                         lpp_set_factor_fast(si->lpp, cst, op->attr.remat.ilp, -1.0);
1942                                 }
1943                         } else {
1944                                 int i,
1945                                         n;
1946
1947                                 for (i = 0, n = get_irn_arity(tmp); i < n; ++i) {
1948                                         ir_node    *arg = get_irn_n(tmp, i);
1949
1950                                         if(arg == irn) {
1951                                                 /* if a value is used stop collecting remats */
1952                                                 cst = ILP_UNDEF;
1953                                         }
1954                                         break;
1955                                 }
1956                         }
1957                         if(cst == ILP_UNDEF) break;
1958                 }
1959         }
1960
1961
1962         /* if a value is used by a mem-phi, then mem_in of this value is 0 (has to be spilled again into a different slot)
1963            mem_in(phi) -> not mem_in(orig_value) TODO: how does this depend on a certain predecessor?
1964          */
1965
1966         /* mem_in of mem-phi has associated costs (but first one is free) */
1967         /* define n_mem_copies as positive integer in each predecessor block,
1968            #mem_in into this block from predecessor block - 1 weighted with SPILL_COST*execfreq(predecessor)
1969            TODO
1970          */
1971
1972
1973         del_pset(live);
1974 }
1975
1976
1977 #if 0
1978          * Speicherkopienminimierung: teste Speicherwerte auf Interferenz
1979          * und weise Spillkontexte zu. Sorge bei Phis dafuer, dass gleiche
1980          * Kontexte zusammenfliessen (Operanden und Ergebnis hat gleichen
1981          * Kontext)
1982 #endif
1983
1984 static INLINE int
1985 is_zero(double x)
1986 {
1987         return fabs(x) < 0.00001;
1988 }
1989
1990 #if 0
1991 static int
1992 is_spilled(const spill_ilp_t * si, const live_range_t * lr)
1993 {
1994         return !is_zero(lpp_get_var_sol(si->lpp, lr->in_mem_var));
1995 }
1996 #endif
1997
1998 static int
1999 is_mem_phi(const ir_node * phi, void *data)
2000 {
2001         spill_ilp_t    *si = data;
2002 //      return is_spilled(si, get_use_head(si, phi)->closest_use);
2003         return 0;
2004 }
2005
2006 #ifdef KEEPALIVE
2007 static int mark_remat_nodes_hook(FILE *F, ir_node *n, ir_node *l)
2008 {
2009         spill_ilp_t *si = get_irg_link(current_ir_graph);
2010
2011         if(pset_find_ptr(si->all_possible_remats, n)) {
2012                 op_t   *op = (op_t*)get_irn_link(n);
2013                 assert(op && op->is_remat);
2014
2015                 if(!op->attr.remat.remat->inverse) {
2016                         if(op->attr.remat.pre) {
2017                                 ir_fprintf(F, "color:red info3:\"remat value: %+F\"", op->attr.remat.remat->value);
2018                         } else {
2019                                 ir_fprintf(F, "color:orange info3:\"remat2 value: %+F\"", op->attr.remat.remat->value);
2020                         }
2021
2022                         return 1;
2023                 } else {
2024                         op_t   *op = (op_t*)get_irn_link(n);
2025                         assert(op && op->is_remat);
2026
2027                         if(op->attr.remat.pre) {
2028                                 ir_fprintf(F, "color:cyan info3:\"remat inverse value: %+F\"", op->attr.remat.remat->value);
2029                         } else {
2030                                 ir_fprintf(F, "color:lightcyan info3:\"remat2 inverse value: %+F\"", op->attr.remat.remat->value);
2031                         }
2032
2033                         return 1;
2034                 }
2035         }
2036
2037         return 0;
2038 }
2039
2040 static void
2041 dump_graph_with_remats(ir_graph * irg, const char * suffix)
2042 {
2043         set_dump_node_vcgattr_hook(mark_remat_nodes_hook);
2044         be_dump(irg, suffix, dump_ir_block_graph_sched);
2045         set_dump_node_vcgattr_hook(NULL);
2046 }
2047 #endif
2048
2049 /**
2050  * Edge hook to dump the schedule edges with annotated register pressure.
2051  */
2052 static int
2053 sched_pressure_edge_hook(FILE *F, ir_node *irn)
2054 {
2055         if(sched_is_scheduled(irn) && sched_has_prev(irn)) {
2056                 ir_node *prev = sched_prev(irn);
2057                 fprintf(F, "edge:{sourcename:\"");
2058                 PRINT_NODEID(irn);
2059                 fprintf(F, "\" targetname:\"");
2060                 PRINT_NODEID(prev);
2061                 fprintf(F, "\" label:\"%d", (int)get_irn_link(irn));
2062                 fprintf(F, "\" color:magenta}\n");
2063         }
2064         return 1;
2065 }
2066
2067 static void
2068 dump_ir_block_graph_sched_pressure(ir_graph *irg, const char *suffix)
2069 {
2070         DUMP_NODE_EDGE_FUNC old = get_dump_node_edge_hook();
2071
2072         dump_consts_local(0);
2073         set_dump_node_edge_hook(sched_pressure_edge_hook);
2074         dump_ir_block_graph(irg, suffix);
2075         set_dump_node_edge_hook(old);
2076 }
2077
2078 static void
2079 walker_pressure_annotator(ir_node * bb, void * data)
2080 {
2081         spill_ilp_t  *si = data;
2082         ir_node      *irn;
2083         irn_live_t   *li;
2084         int           i,
2085                                   n;
2086         pset         *live = pset_new_ptr_default();
2087         int           projs = 0;
2088
2089         live_foreach(bb, li) {
2090                 irn = (ir_node *) li->irn;
2091
2092                 if (live_is_end(li) && has_reg_class(si, irn)) {
2093                         pset_insert_ptr(live, irn);
2094                 }
2095         }
2096
2097         set_irn_link(bb, INT_TO_PTR(pset_count(live)));
2098
2099         sched_foreach_reverse(bb, irn) {
2100                 if(is_Phi(irn)) {
2101                         set_irn_link(irn, INT_TO_PTR(pset_count(live)));
2102                         continue;
2103                 }
2104
2105                 if(has_reg_class(si, irn)) {
2106                         pset_remove_ptr(live, irn);
2107                         if(is_Proj(irn)) ++projs;
2108                 }
2109
2110                 if(!is_Proj(irn)) projs = 0;
2111
2112                 for (i = 0, n = get_irn_arity(irn); i < n; ++i) {
2113                         ir_node    *arg = get_irn_n(irn, i);
2114
2115                         if(has_reg_class(si, arg)) pset_insert_ptr(live, arg);
2116                 }
2117                 set_irn_link(irn, INT_TO_PTR(pset_count(live)+projs));
2118         }
2119
2120         del_pset(live);
2121 }
2122
2123 static void
2124 dump_pressure_graph(spill_ilp_t * si, const char *suffix)
2125 {
2126         be_dump(si->chordal_env->irg, suffix, dump_ir_block_graph_sched_pressure);
2127 }
2128
2129 #ifdef KEEPALIVE
2130 static void
2131 connect_all_remats_with_keep(spill_ilp_t * si)
2132 {
2133         ir_node   *irn;
2134         ir_node  **ins,
2135                          **pos;
2136         int        n_remats;
2137
2138
2139         n_remats = pset_count(si->all_possible_remats);
2140         if(n_remats) {
2141                 ins = obstack_alloc(si->obst, n_remats * sizeof(*ins));
2142
2143                 pos = ins;
2144                 pset_foreach(si->all_possible_remats, irn) {
2145                         *pos = irn;
2146                         ++pos;
2147                 }
2148
2149                 si->keep = be_new_Keep(si->chordal_env->cls, si->chordal_env->irg, get_irg_end_block(si->chordal_env->irg), n_remats, ins);
2150
2151                 obstack_free(si->obst, ins);
2152         }
2153 }
2154 #endif
2155
2156 static void
2157 connect_all_spills_with_keep(spill_ilp_t * si)
2158 {
2159         ir_node   *irn;
2160         ir_node  **ins,
2161                          **pos;
2162         int        n_spills;
2163         ir_node   *keep;
2164
2165
2166         n_spills = pset_count(si->spills);
2167         if(n_spills) {
2168                 ins = obstack_alloc(si->obst, n_spills * sizeof(*ins));
2169
2170                 pos = ins;
2171                 pset_foreach(si->spills, irn) {
2172                         *pos = irn;
2173                         ++pos;
2174                 }
2175
2176                 keep = be_new_Keep(si->chordal_env->cls, si->chordal_env->irg, get_irg_end_block(si->chordal_env->irg), n_spills, ins);
2177
2178                 obstack_free(si->obst, ins);
2179         }
2180 }
2181
2182 /** insert a spill at an arbitrary position */
2183 ir_node *be_spill2(const arch_env_t *arch_env, ir_node *irn, ir_node *insert, ir_node *ctx)
2184 {
2185         ir_node *bl     = is_Block(insert)?insert:get_nodes_block(insert);
2186         ir_graph *irg   = get_irn_irg(bl);
2187         ir_node *frame  = get_irg_frame(irg);
2188         ir_node *spill;
2189         ir_node *next;
2190
2191         const arch_register_class_t *cls       = arch_get_irn_reg_class(arch_env, irn, -1);
2192         const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
2193
2194         spill = be_new_Spill(cls, cls_frame, irg, bl, frame, irn, ctx);
2195
2196         /*
2197          * search the right insertion point. a spill of a phi cannot be put
2198          * directly after the phi, if there are some phis behind the one which
2199          * is spilled. Also, a spill of a Proj must be after all Projs of the
2200          * same tuple node.
2201          *
2202          * Here's one special case:
2203          * If the spill is in the start block, the spill must be after the frame
2204          * pointer is set up. This is done by setting insert to the end of the block
2205          * which is its default initialization (see above).
2206          */
2207
2208         if(bl == get_irg_start_block(irg) && sched_get_time_step(frame) >= sched_get_time_step(insert))
2209                 insert = frame;
2210
2211         for (next = sched_next(insert); is_Phi(next) || is_Proj(next); next = sched_next(insert))
2212                 insert = next;
2213
2214         sched_add_after(insert, spill);
2215         return spill;
2216 }
2217
2218 static void
2219 delete_remat(spill_ilp_t * si, ir_node * remat) {
2220         int       i,
2221                       n;
2222         ir_node  *bad = get_irg_bad(si->chordal_env->irg);
2223
2224         sched_remove(remat);
2225
2226         /* kill links to operands */
2227         for (i = -1, n = get_irn_arity(remat); i < n; ++i) {
2228                 set_irn_n(remat, i, bad);
2229         }
2230 }
2231
2232 static void
2233 clean_remat_info(spill_ilp_t * si)
2234 {
2235         int            i,
2236                                n;
2237         remat_t       *remat;
2238         remat_info_t  *remat_info;
2239         ir_node       *bad = get_irg_bad(si->chordal_env->irg);
2240
2241         set_foreach(si->remat_info, remat_info) {
2242                 if(!remat_info->remats) continue;
2243
2244                 pset_foreach(remat_info->remats, remat)
2245                 {
2246                         if(remat->proj && get_irn_n_edges(remat->proj) == 0) {
2247                                 set_irn_n(remat->proj, -1, bad);
2248                                 set_irn_n(remat->proj, 0, bad);
2249                         }
2250
2251                         if(get_irn_n_edges(remat->op) == 0) {
2252                                 for (i = -1, n = get_irn_arity(remat->op); i < n; ++i) {
2253                                         set_irn_n(remat->op, i, bad);
2254                                 }
2255                         }
2256                 }
2257
2258                 if(remat_info->remats) del_pset(remat_info->remats);
2259                 if(remat_info->remats_by_operand) del_pset(remat_info->remats_by_operand);
2260         }
2261 }
2262
2263 static void
2264 delete_unnecessary_remats(spill_ilp_t * si)
2265 {
2266 #ifdef KEEPALIVE
2267         int       i,
2268                       n;
2269         ir_node  *bad = get_irg_bad(si->chordal_env->irg);
2270
2271         if(si->keep) {
2272                 ir_node   *end = get_irg_end(si->chordal_env->irg);
2273                 ir_node  **keeps;
2274
2275                 for (i = 0, n = get_irn_arity(si->keep); i < n; ++i) {
2276                         ir_node        *keep_arg = get_irn_n(si->keep, i);
2277                         op_t           *arg_op = get_irn_link(keep_arg);
2278                         lpp_name_t     *name;
2279
2280                         assert(arg_op->is_remat);
2281
2282                         name = si->lpp->vars[arg_op->attr.remat.ilp];
2283
2284                         if(is_zero(name->value)) {
2285                                 DBG((si->dbg, LEVEL_3, "\t  deleting remat %+F\n", keep_arg));
2286                                 /* TODO check whether reload is preferred over remat (could be bug) */
2287                                 delete_remat(si, keep_arg);
2288                         } else {
2289                                 if(!arg_op->attr.remat.remat->inverse) {
2290                                         if(arg_op->attr.remat.pre) {
2291                                                 DBG((si->dbg, LEVEL_2, "\t**remat kept: %+F\n", keep_arg));
2292                                         } else {
2293                                                 DBG((si->dbg, LEVEL_2, "\t%%%%remat2 kept: %+F\n", keep_arg));
2294                                         }
2295                                 } else {
2296                                         if(arg_op->attr.remat.pre) {
2297                                                 DBG((si->dbg, LEVEL_2, "\t**INVERSE remat kept: %+F\n", keep_arg));
2298                                         } else {
2299                                                 DBG((si->dbg, LEVEL_2, "\t%%%%INVERSE remat2 kept: %+F\n", keep_arg));
2300                                         }
2301                                 }
2302                         }
2303
2304                         set_irn_n(si->keep, i, bad);
2305                 }
2306 #if 0
2307                 for (i = 0, n = get_End_n_keepalives(end); i < n; ++i) {
2308                         ir_node        *end_arg = get_End_keepalive(end, i);
2309
2310                         if(end_arg != si->keep) {
2311                                 obstack_grow(si->obst, &end_arg, sizeof(end_arg));
2312                         }
2313                 }
2314                 keeps = obstack_finish(si->obst);
2315                 set_End_keepalives(end, n-1, keeps);
2316                 obstack_free(si->obst, keeps);
2317 #endif
2318         } else {
2319                 DBG((si->dbg, LEVEL_2, "\t  no remats to delete (none have been inserted)\n"));
2320         }
2321 #else
2322         ir_node  *remat;
2323
2324         pset_foreach(si->all_possible_remats, remat) {
2325                 op_t           *remat_op = get_irn_link(remat);
2326                 lpp_name_t     *name = si->lpp->vars[remat_op->attr.remat.ilp];
2327
2328                 if(is_zero(name->value)) {
2329                         DBG((si->dbg, LEVEL_3, "\t  deleting remat %+F\n", remat));
2330                         /* TODO check whether reload is preferred over remat (could be bug) */
2331                         delete_remat(si, remat);
2332                 } else {
2333                         if(!remat_op->attr.remat.remat->inverse) {
2334                                 if(remat_op->attr.remat.pre) {
2335                                         DBG((si->dbg, LEVEL_2, "\t**remat kept: %+F\n", remat));
2336                                 } else {
2337                                         DBG((si->dbg, LEVEL_2, "\t%%%%remat2 kept: %+F\n", remat));
2338                                 }
2339                         } else {
2340                                 if(remat_op->attr.remat.pre) {
2341                                         DBG((si->dbg, LEVEL_2, "\t**INVERSE remat kept: %+F\n", remat));
2342                                 } else {
2343                                         DBG((si->dbg, LEVEL_2, "\t%%%%INVERSE remat2 kept: %+F\n", remat));
2344                                 }
2345                         }
2346                 }
2347         }
2348 #endif
2349 }
2350
2351 /**
2352  * @param before   The node after which the spill will be placed in the schedule
2353  */
2354 /* TODO set context properly */
2355 static ir_node *
2356 insert_spill(spill_ilp_t * si, const ir_node * irn, const ir_node * value, const ir_node * before)
2357 {
2358         defs_t   *defs;
2359         ir_node  *spill;
2360         const arch_env_t *arch_env = si->chordal_env->birg->main_env->arch_env;
2361
2362         DBG((si->dbg, LEVEL_3, "\t  inserting spill for value %+F after %+F\n", irn, before));
2363
2364         spill = be_spill2(arch_env, irn, before, irn);
2365
2366         defs = set_insert_def(si->values, value);
2367         assert(defs);
2368
2369         /* enter into the linked list */
2370         set_irn_link(spill, defs->spills);
2371         defs->spills = spill;
2372
2373 #ifdef KEEPALIVE_SPILLS
2374         pset_insert_ptr(si->spills, spill);
2375 #endif
2376
2377         return spill;
2378 }
2379
2380 /**
2381  * @param before   The Phi node which has to be spilled
2382  */
2383 static ir_node *
2384 insert_mem_phi(spill_ilp_t * si, const ir_node * phi)
2385 {
2386         ir_node   *mem_phi;
2387         ir_node  **ins;
2388         defs_t    *defs;
2389         int        i,
2390                            n;
2391
2392         NEW_ARR_A(ir_node*, ins, get_irn_arity(phi));
2393
2394         for(i=0,n=get_irn_arity(phi); i<n; ++i) {
2395                 ins[i] = si->m_unknown;
2396         }
2397
2398         mem_phi =  new_r_Phi(si->chordal_env->irg, get_nodes_block(phi), get_irn_arity(phi), ins, mode_M);
2399
2400         defs = set_insert_def(si->values, phi);
2401         assert(defs);
2402
2403         /* enter into the linked list */
2404         set_irn_link(mem_phi, defs->spills);
2405         defs->spills = mem_phi;
2406
2407         sched_add_after(phi, mem_phi);
2408
2409 #ifdef KEEPALIVE_SPILLS
2410         pset_insert_ptr(si->spills, mem_phi);
2411 #endif
2412
2413         return mem_phi;
2414 }
2415
2416 /**
2417  * Add remat to list of defs, destroys link field!
2418  */
2419 static void
2420 insert_remat(spill_ilp_t * si, ir_node * remat)
2421 {
2422         defs_t   *defs;
2423         op_t     *remat_op = get_irn_link(remat);
2424
2425         assert(remat_op->is_remat);
2426
2427         defs = set_insert_def(si->values, remat_op->attr.remat.remat->value);
2428         assert(defs);
2429
2430         /* enter into the linked list */
2431         set_irn_link(remat, defs->remats);
2432         defs->remats = remat;
2433 }
2434
2435 #if 0
2436 static void
2437 collect_spills(spill_ilp_t * si, ir_node * value, pset * spills, pset * visited)
2438 {
2439         ir_node  *next;
2440         defs_t   *defs;
2441
2442         defs = set_find_def(si->values, value);
2443
2444         if(defs && defs->spills) {
2445                 for(next = defs->spills; next; next = get_irn_link(next)) {
2446                         pset_insert_ptr(spills, next);
2447                 }
2448         } else if (is_Phi(value)) {
2449                 /* recursion */
2450                 if(!pset_find_ptr(visited, value)) {
2451                         int    i,
2452                                    n;
2453
2454                         pset_insert_ptr(visited, value);
2455                         for(i=0, n=get_irn_arity(value); i<n; ++i) {
2456                                 ir_node    *arg = get_irn_n(value, i);
2457
2458                                 collect_spills(si, arg, spills, visited);
2459                         }
2460                 }
2461         } else {
2462 //              assert(0 && "Phi operand not spilled");
2463         }
2464 }
2465 #endif
2466
2467 static pset *
2468 get_spills_for_value(spill_ilp_t * si, ir_node * value)
2469 {
2470         pset     *spills = pset_new_ptr_default();
2471 //      pset     *visited = pset_new_ptr_default();
2472
2473 //      collect_spills(si, value, spills, visited);
2474 //      del_pset(visited);
2475         ir_node  *next;
2476         defs_t   *defs;
2477
2478         defs = set_find_def(si->values, value);
2479
2480         if(defs && defs->spills) {
2481                 for(next = defs->spills; next; next = get_irn_link(next)) {
2482                         pset_insert_ptr(spills, next);
2483                 }
2484         }
2485
2486         return spills;
2487 }
2488
2489 /**
2490  * Add reload before operation and add to list of defs
2491  */
2492 static ir_node *
2493 insert_reload(spill_ilp_t * si, const ir_node * value, const ir_node * after)
2494 {
2495         defs_t   *defs;
2496         ir_node  *reload,
2497                          *spill;
2498         const arch_env_t *arch_env = si->chordal_env->birg->main_env->arch_env;
2499
2500         DBG((si->dbg, LEVEL_3, "\t  inserting reload for value %+F before %+F\n", value, after));
2501
2502         defs = set_find_def(si->values, value);
2503         /* get a spill of this value */
2504 #if 0
2505         if((!defs || !defs->spills) && is_Phi(value)) {
2506                 pset  *spills;
2507
2508                 spills = get_spills_for_value(si, value);
2509
2510                 spill = pset_first(spills);
2511                 del_pset(spills);
2512
2513                 if(!defs) {
2514                         defs = set_insert_def(si->values, value);
2515                 }
2516                 defs->spills = spill;
2517                 set_irn_link(spill, NULL);
2518         } else {
2519                 spill = defs->spills;
2520         }
2521 #endif
2522         spill = defs->spills;
2523         assert(spill && "no spill placed before reload");
2524
2525         reload = be_reload(arch_env, si->cls, after, get_irn_mode(value), spill);
2526
2527         /* enter into the linked list */
2528         set_irn_link(reload, defs->remats);
2529         defs->remats = reload;
2530
2531         return reload;
2532 }
2533
2534 static void
2535 walker_spill_placer(ir_node * bb, void * data) {
2536         spill_ilp_t   *si = (spill_ilp_t*)data;
2537         ir_node       *irn;
2538         spill_bb_t    *spill_bb = get_irn_link(bb);
2539         pset          *spills_to_do = pset_new_ptr_default();
2540         spill_t       *spill;
2541
2542         set_foreach(spill_bb->ilp, spill) {
2543                 lpp_name_t    *name;
2544
2545                 if(is_Phi(spill->irn) && get_nodes_block(spill->irn) == bb) {
2546                         name = si->lpp->vars[spill->mem_in];
2547                         if(!is_zero(name->value)) {
2548                                 ir_node   *mem_phi;
2549
2550                                 mem_phi = insert_mem_phi(si, spill->irn);
2551
2552                                 DBG((si->dbg, LEVEL_2, "\t >>spilled Phi %+F -> %+F\n", spill->irn, mem_phi));
2553                         }
2554                 }
2555
2556                 name = si->lpp->vars[spill->spill];
2557                 if(!is_zero(name->value)) {
2558                         if(spill->reg_in > 0) {
2559                                 name = si->lpp->vars[spill->reg_in];
2560                                 if(!is_zero(name->value)) {
2561                                         insert_spill(si, spill->irn, spill->irn, bb);
2562                                         continue;
2563                                 }
2564                         }
2565                         pset_insert_ptr(spills_to_do, spill->irn);
2566                 }
2567         }
2568         DBG((si->dbg, LEVEL_3, "\t  %d spills to do in block %+F\n", pset_count(spills_to_do), bb));
2569
2570
2571         for(irn = sched_block_first_nonphi(bb); !sched_is_end(irn); irn = sched_next(irn)) {
2572                 op_t     *op = get_irn_link(irn);
2573
2574                 if(be_is_Spill(irn)) continue;
2575
2576                 if(op->is_remat) {
2577                         /* TODO fix this if we want to support remats with more than two nodes */
2578                         if(get_irn_mode(irn) != mode_T && pset_find_ptr(spills_to_do, op->attr.remat.remat->value)) {
2579                                 pset_remove_ptr(spills_to_do, op->attr.remat.remat->value);
2580
2581                                 insert_spill(si, irn, op->attr.remat.remat->value, irn);
2582                         }
2583                 } else {
2584                         if(pset_find_ptr(spills_to_do, irn)) {
2585                                 pset_remove_ptr(spills_to_do, irn);
2586
2587                                 insert_spill(si, irn, irn, irn);
2588                         }
2589                 }
2590
2591         }
2592
2593         assert(pset_count(spills_to_do) == 0);
2594
2595         /* afterwards free data in block */
2596         del_pset(spills_to_do);
2597 }
2598
2599 static void
2600 phim_fixer(spill_ilp_t *si) {
2601         defs_t  *defs;
2602
2603         set_foreach(si->values, defs) {
2604                 const ir_node  *phi = defs->value;
2605                 ir_node  *phi_m = NULL;
2606                 ir_node  *next = defs->spills;
2607                 int       i,
2608                                   n;
2609
2610                 if(!is_Phi(phi)) continue;
2611
2612                 while(next) {
2613                         if(is_Phi(next) && get_irn_mode(next) == mode_M) {
2614                                 phi_m = next;
2615                                 break;
2616                         } else {
2617                                 next = get_irn_link(next);
2618                         }
2619                 }
2620                 if(!phi_m) continue;
2621
2622                 for(i=0,n=get_irn_arity(phi); i<n; ++i) {
2623                         const ir_node  *value = get_irn_n(phi, i);
2624                         defs_t         *val_defs = set_find_def(si->values, value);
2625
2626                         /* get a spill of this value */
2627                         ir_node      *spill = val_defs->spills;
2628
2629                         assert(spill && "no spill placed before PhiM");
2630
2631                         set_irn_n(phi_m, i, spill);
2632                 }
2633         }
2634 }
2635
2636 static void
2637 walker_reload_placer(ir_node * bb, void * data) {
2638         spill_ilp_t   *si = (spill_ilp_t*)data;
2639         ir_node       *irn;
2640         spill_bb_t    *spill_bb = get_irn_link(bb);
2641         int            i;
2642         irn_live_t    *li;
2643
2644         sched_foreach_reverse(bb, irn) {
2645                 op_t     *op = get_irn_link(irn);
2646
2647                 if(be_is_Reload(irn) || be_is_Spill(irn)) continue;
2648                 if(is_Phi(irn)) break;
2649
2650                 if(op->is_remat) {
2651                         if(get_irn_mode(irn) != mode_T) {
2652                                 insert_remat(si, irn);
2653                         }
2654                 } else {
2655                         int    n;
2656
2657                         for (i = 0, n = get_irn_arity(irn); i < n; ++i) {
2658                                 ir_node    *arg = get_irn_n(irn, i);
2659
2660                                 if(op->attr.live_range.reloads && op->attr.live_range.reloads[i] != ILP_UNDEF) {
2661                                         lpp_name_t    *name;
2662
2663                                         name = si->lpp->vars[op->attr.live_range.reloads[i]];
2664                                         if(!is_zero(name->value)) {
2665                                                 ir_node    *reload;
2666                                                 ir_node    *insert_pos = irn;
2667                                                 ir_node    *prev = insert_pos;
2668                                                 op_t       *prev_op;
2669
2670                                                 do {
2671                                                         prev = sched_prev(prev);
2672                                                 } while(be_is_Spill(prev));
2673
2674                                                 prev_op = get_irn_link(prev);
2675
2676                                                 /* insert reload before pre-remats */
2677                                                 while(!sched_is_end(prev) && !be_is_Reload(prev) && !is_Phi(prev)
2678                                                                 && prev_op->is_remat && prev_op->attr.remat.pre) {
2679                                                         insert_pos = prev;
2680
2681                                                         do {
2682                                                                 prev = sched_prev(prev);
2683                                                         } while(be_is_Spill(prev));
2684
2685                                                         prev_op = get_irn_link(prev);
2686
2687                                                 }
2688
2689                                                 reload = insert_reload(si, arg, insert_pos);
2690
2691                                                 set_irn_n(irn, i, reload);
2692
2693 #ifdef KEEPALIVE_RELOADS
2694                                                 pset_insert_ptr(si->spills, reload);
2695 #endif
2696                                         }
2697                                 }
2698                         }
2699                 }
2700         }
2701
2702         /* reloads at end of block */
2703         if(spill_bb->reloads) {
2704                 i=0;
2705                 live_foreach(bb, li) {
2706                         ir_node        *irn = (ir_node *) li->irn;
2707
2708                         if (live_is_end(li) && has_reg_class(si, irn) && !pset_find_ptr(si->all_possible_remats, irn)) {
2709                                 lpp_name_t    *name;
2710
2711                                 name = si->lpp->vars[spill_bb->reloads[i]];
2712                                 if(!is_zero(name->value)) {
2713                                         ir_node    *reload;
2714                                         ir_node    *insert_pos = bb;
2715                                         ir_node    *prev = sched_prev(insert_pos);
2716                                         op_t       *prev_op = get_irn_link(prev);
2717
2718                                         /* insert reload before pre-remats */
2719                                         while(!sched_is_end(prev) && !be_is_Reload(prev) && !be_is_Spill(prev)
2720                                                         && prev_op->is_remat && prev_op->attr.remat.pre) {
2721                                                 insert_pos = prev;
2722
2723                                                 prev = sched_prev(insert_pos);
2724                                                 prev_op = get_irn_link(prev);
2725                                         }
2726
2727                                         reload = insert_reload(si, irn, insert_pos);
2728
2729 #ifdef KEEPALIVE_RELOADS
2730                                         pset_insert_ptr(si->spills, reload);
2731 #endif
2732                                 }
2733                                 ++i;
2734                         }
2735                 }
2736         }
2737
2738         del_set(spill_bb->ilp);
2739 }
2740
2741 static void
2742 walker_collect_used(ir_node * irn, void * data)
2743 {
2744         lc_bitset_t   *used = data;
2745
2746         lc_bitset_set(used, get_irn_idx(irn));
2747 }
2748
2749 struct kill_helper {
2750         lc_bitset_t  *used;
2751         spill_ilp_t  *si;
2752 };
2753
2754 static void
2755 walker_kill_unused(ir_node * bb, void * data)
2756 {
2757         struct kill_helper *kh = data;
2758         const ir_node      *bad = get_irg_bad(get_irn_irg(bb));
2759         ir_node            *irn;
2760
2761
2762         for(irn=sched_first(bb); !sched_is_end(irn);) {
2763                 ir_node     *next = sched_next(irn);
2764                 int          i,
2765                                          n;
2766
2767                 if(!lc_bitset_is_set(kh->used, get_irn_idx(irn))) {
2768                         if(be_is_Spill(irn) || be_is_Reload(irn)) {
2769                                 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)));
2770                                 assert(lpp_get_sol_state(kh->si->lpp) != lpp_optimal && "optimal solution is suboptimal?");
2771                         }
2772
2773                         sched_remove(irn);
2774
2775                         set_nodes_block(irn, bad);
2776                         for (i = 0, n = get_irn_arity(irn); i < n; ++i) {
2777                                 set_irn_n(irn, i, bad);
2778                         }
2779                 }
2780                 irn = next;
2781         }
2782 }
2783
2784 static void
2785 kill_all_unused_values_in_schedule(spill_ilp_t * si)
2786 {
2787         struct kill_helper kh;
2788
2789         kh.used = lc_bitset_malloc(get_irg_last_idx(si->chordal_env->irg));
2790         kh.si = si;
2791
2792         irg_walk_graph(si->chordal_env->irg, walker_collect_used, NULL, kh.used);
2793         irg_block_walk_graph(si->chordal_env->irg, walker_kill_unused, NULL, &kh);
2794
2795         lc_bitset_free(kh.used);
2796 }
2797
2798 static void
2799 print_irn_pset(pset * p)
2800 {
2801         ir_node   *irn;
2802
2803         pset_foreach(p, irn) {
2804                 ir_printf("%+F\n", irn);
2805         }
2806 }
2807
2808 static void
2809 rewire_uses(spill_ilp_t * si)
2810 {
2811         dom_front_info_t     *dfi = be_compute_dominance_frontiers(si->chordal_env->irg);
2812         defs_t               *defs;
2813         pset                 *ignore = pset_new_ptr(1);
2814
2815         pset_insert_ptr(ignore, get_irg_end(si->chordal_env->irg));
2816
2817         /* then fix uses of spills */
2818         set_foreach(si->values, defs) {
2819                 pset     *reloads;
2820                 pset     *spills;
2821                 ir_node  *next = defs->remats;
2822                 int remats = 0;
2823
2824                 reloads = pset_new_ptr_default();
2825
2826                 while(next) {
2827                         if(be_is_Reload(next)) {
2828                                 pset_insert_ptr(reloads, next);
2829                         } else {
2830                                 ++remats;
2831                         }
2832                         next = get_irn_link(next);
2833                 }
2834
2835                 spills = get_spills_for_value(si, defs->value);
2836                 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));
2837                 if(pset_count(spills) > 1) {
2838                         //assert(pset_count(reloads) > 0);
2839                         //                              print_irn_pset(spills);
2840                         //                              print_irn_pset(reloads);
2841
2842                         be_ssa_constr_set_ignore(dfi, spills, ignore);
2843                 }
2844
2845                 del_pset(reloads);
2846                 del_pset(spills);
2847         }
2848
2849         /* first fix uses of remats and reloads */
2850         set_foreach(si->values, defs) {
2851                 pset     *nodes;
2852                 ir_node  *next = defs->remats;
2853
2854                 if(next) {
2855                         nodes = pset_new_ptr_default();
2856                         pset_insert_ptr(nodes, defs->value);
2857
2858                         while(next) {
2859                                 pset_insert_ptr(nodes, next);
2860                                 next = get_irn_link(next);
2861                         }
2862
2863                         if(pset_count(nodes) > 1) {
2864                                 DBG((si->dbg, LEVEL_4, "\t    %d new definitions for value %+F\n", pset_count(nodes)-1, defs->value));
2865                                 be_ssa_constr_set(dfi, nodes);
2866                         }
2867
2868                         del_pset(nodes);
2869                 }
2870         }
2871
2872 //      remove_unused_defs(si);
2873
2874         be_free_dominance_frontiers(dfi);
2875 }
2876
2877 static void
2878 writeback_results(spill_ilp_t * si)
2879 {
2880         /* walk through the graph and collect all spills, reloads and remats for a value */
2881
2882         si->values = new_set(cmp_defs, 4096);
2883
2884         DBG((si->dbg, LEVEL_1, "Applying results\n"));
2885         delete_unnecessary_remats(si);
2886         si->m_unknown = new_r_Unknown(si->chordal_env->irg, mode_M);
2887         irg_block_walk_graph(si->chordal_env->irg, walker_spill_placer, NULL, si);
2888         phim_fixer(si);
2889         irg_block_walk_graph(si->chordal_env->irg, walker_reload_placer, NULL, si);
2890
2891         /* clean the remat info! there are still back-edges leading there! */
2892         clean_remat_info(si);
2893
2894         rewire_uses(si);
2895
2896         connect_all_spills_with_keep(si);
2897
2898         del_set(si->values);
2899 }
2900
2901 static int
2902 get_n_regs(spill_ilp_t * si)
2903 {
2904         int     arch_n_regs = arch_register_class_n_regs(si->cls);
2905         int     free = 0;
2906         int     i;
2907
2908         for(i=0; i<arch_n_regs; i++) {
2909                 if(!arch_register_type_is(&si->cls->regs[i], ignore)) {
2910                         free++;
2911                 }
2912         }
2913
2914         DBG((si->dbg, LEVEL_1, "\tArchitecture has %d free registers in class %s\n", free, si->cls->name));
2915         return free;
2916 }
2917
2918 static void
2919 walker_reload_mover(ir_node * bb, void * data)
2920 {
2921         spill_ilp_t   *si = data;
2922         ir_node           *tmp;
2923
2924         sched_foreach(bb, tmp) {
2925                 if(be_is_Reload(tmp) && has_reg_class(si, tmp)) {
2926                         ir_node       *reload = tmp;
2927                         ir_node       *irn = tmp;
2928
2929                         /* move reload upwards */
2930
2931                         int pressure = (int)get_irn_link(reload);
2932                         if(pressure < si->n_regs) {
2933                                 irn = sched_prev(reload);
2934                                 DBG((si->dbg, LEVEL_5, "regpressure before %+F: %d\n", reload, pressure));
2935                                 sched_remove(reload);
2936                                 pressure = (int)get_irn_link(irn);
2937
2938                                 while(pressure < si->n_regs) {
2939                                         if(sched_is_end(irn) || (be_is_Reload(irn) && has_reg_class(si, irn))) break;
2940
2941                                         set_irn_link(irn, INT_TO_PTR(pressure+1));
2942                                         DBG((si->dbg, LEVEL_5, "new regpressure before %+F: %d\n", irn, pressure+1));
2943                                         irn = sched_prev(irn);
2944
2945                                         pressure = (int)get_irn_link(irn);
2946                                 }
2947
2948                                 DBG((si->dbg, LEVEL_3, "putting reload %+F after %+F\n", reload, irn));
2949                                 sched_put_after(irn, reload);
2950                         }
2951                 }
2952         }
2953 }
2954
2955 static void
2956 move_reloads_upward(spill_ilp_t * si)
2957 {
2958         irg_block_walk_graph(si->chordal_env->irg, walker_reload_mover, NULL, si);
2959 }
2960
2961 void
2962 be_spill_remat(const be_chordal_env_t * chordal_env)
2963 {
2964         char            problem_name[256];
2965         char            dump_suffix[256];
2966         char            dump_suffix2[256];
2967         char            dump_suffix3[256];
2968         struct obstack  obst;
2969         spill_ilp_t     si;
2970
2971         ir_snprintf(problem_name, sizeof(problem_name), "%F_%s", chordal_env->irg, chordal_env->cls->name);
2972         ir_snprintf(dump_suffix, sizeof(dump_suffix), "-%s-remats", chordal_env->cls->name);
2973         ir_snprintf(dump_suffix2, sizeof(dump_suffix2), "-%s-pressure", chordal_env->cls->name);
2974         ir_snprintf(dump_suffix3, sizeof(dump_suffix3), "-%s-reloads_moved", chordal_env->cls->name);
2975
2976         FIRM_DBG_REGISTER(si.dbg, "firm.be.ra.spillremat");
2977         DBG((si.dbg, LEVEL_1, "\n\n\t\t===== Processing %s =====\n\n", problem_name));
2978
2979         obstack_init(&obst);
2980         si.chordal_env = chordal_env;
2981         si.obst = &obst;
2982         si.senv = be_new_spill_env(chordal_env, is_mem_phi, &si);
2983         si.cls = chordal_env->cls;
2984         si.lpp = new_lpp(problem_name, lpp_minimize);
2985         si.remat_info = new_set(cmp_remat_info, 4096);
2986         si.all_possible_remats = pset_new_ptr_default();
2987         si.spills = pset_new_ptr_default();
2988         si.inverse_ops = pset_new_ptr_default();
2989 #ifndef EXECFREQ_LOOPDEPH
2990         si.execfreqs = compute_execfreq(chordal_env->irg);
2991 #else
2992         si.execfreqs = NULL;
2993 #endif
2994 #ifdef KEEPALIVE
2995         si.keep = NULL;
2996 #endif
2997         si.n_regs = get_n_regs(&si);
2998
2999         set_irg_link(chordal_env->irg, &si);
3000         compute_doms(chordal_env->irg);
3001
3002 #ifdef COLLECT_REMATS
3003         /* collect remats */
3004         DBG((si.dbg, LEVEL_1, "Collecting remats\n"));
3005         irg_walk_graph(chordal_env->irg, walker_remat_collector, NULL, &si);
3006 #endif
3007
3008         /* insert possible remats */
3009         DBG((si.dbg, LEVEL_1, "Inserting possible remats\n"));
3010         irg_block_walk_graph(chordal_env->irg, walker_remat_insertor, NULL, &si);
3011         DBG((si.dbg, LEVEL_2, " -> inserted %d possible remats\n", pset_count(si.all_possible_remats)));
3012
3013 #ifdef KEEPALIVE
3014         DBG((si.dbg, LEVEL_1, "Connecting remats with keep and dumping\n"));
3015         connect_all_remats_with_keep(&si);
3016         /* dump graph with inserted remats */
3017         dump_graph_with_remats(chordal_env->irg, dump_suffix);
3018 #endif
3019
3020
3021         /* recompute liveness */
3022         DBG((si.dbg, LEVEL_1, "Recomputing liveness\n"));
3023         be_liveness(chordal_env->irg);
3024
3025         /* build the ILP */
3026
3027         DBG((si.dbg, LEVEL_1, "\tBuilding ILP\n"));
3028         DBG((si.dbg, LEVEL_2, "\t endwalker\n"));
3029         irg_block_walk_graph(chordal_env->irg, luke_endwalker, NULL, &si);
3030
3031         DBG((si.dbg, LEVEL_2, "\t blockwalker\n"));
3032         irg_block_walk_graph(chordal_env->irg, luke_blockwalker, NULL, &si);
3033
3034 #ifdef DUMP_ILP
3035         {
3036                 FILE           *f;
3037                 char            buf[256];
3038
3039                 ir_snprintf(buf, sizeof(buf), "%s-spillremat.ilp", problem_name);
3040                 if ((f = fopen(buf, "wt")) != NULL) {
3041                         lpp_dump_plain(si.lpp, f);
3042                         fclose(f);
3043                 }
3044         }
3045 #endif
3046
3047 #ifdef SOLVE
3048         DBG((si.dbg, LEVEL_1, "\tSolving %F\n", chordal_env->irg));
3049 #ifdef ILP_TIMEOUT
3050         lpp_set_time_limit(si.lpp, ILP_TIMEOUT);
3051 #endif
3052
3053 #ifdef SOLVE_LOCAL
3054         lpp_solve_cplex(si.lpp);
3055 #else
3056         lpp_solve_net(si.lpp, LPP_SERVER, LPP_SOLVER);
3057 #endif
3058         assert(lpp_is_sol_valid(si.lpp)
3059                && "solution of ILP must be valid");
3060
3061         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));
3062
3063 #ifdef DUMP_SOLUTION
3064         {
3065                 FILE           *f;
3066                 char            buf[256];
3067
3068                 ir_snprintf(buf, sizeof(buf), "%s-spillremat.sol", problem_name);
3069                 if ((f = fopen(buf, "wt")) != NULL) {
3070                         int             i;
3071                         for (i = 0; i < si.lpp->var_next; ++i) {
3072                                 lpp_name_t     *name = si.lpp->vars[i];
3073                                 fprintf(f, "%20s %4d %10f\n", name->name, name->nr, name->value);
3074                         }
3075                         fclose(f);
3076                 }
3077         }
3078 #endif
3079
3080         writeback_results(&si);
3081
3082 #endif                          /* SOLVE */
3083
3084         kill_all_unused_values_in_schedule(&si);
3085
3086 #if defined(KEEPALIVE_SPILLS) || defined(KEEPALIVE_RELOADS)
3087         be_dump(chordal_env->irg, "-spills-placed", dump_ir_block_graph);
3088 #endif
3089
3090         be_liveness(chordal_env->irg);
3091         irg_block_walk_graph(chordal_env->irg, walker_pressure_annotator, NULL, &si);
3092
3093         dump_pressure_graph(&si, dump_suffix2);
3094
3095         // TODO fix temporarily exceeded regpressure due to remat2s
3096
3097         // TODO insert copys to fix interferences in memory
3098
3099         // move reloads upwards
3100         move_reloads_upward(&si);
3101         irg_block_walk_graph(chordal_env->irg, walker_pressure_annotator, NULL, &si);
3102         dump_pressure_graph(&si, dump_suffix3);
3103
3104         free_dom(chordal_env->irg);
3105         del_pset(si.inverse_ops);
3106         del_pset(si.all_possible_remats);
3107         del_pset(si.spills);
3108 #ifndef EXECFREQ_LOOPDEPH
3109         free_execfreq(si.execfreqs);
3110 #endif
3111         free_lpp(si.lpp);
3112         obstack_free(&obst, NULL);
3113 //      exit(0);
3114 }
3115
3116 #else                           /* WITH_ILP */
3117
3118 static void
3119 only_that_you_can_compile_without_WITH_ILP_defined(void)
3120 {
3121 }
3122
3123 #endif                          /* WITH_ILP */