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_t.h"
  33 #include "iredges.h"
  34 #include "execfreq.h"
  35 #include "irvrfy.h"
  36
  37 #include <lpp/lpp.h>
  38 #include <lpp/mps.h>
  39 #include <lpp/lpp_net.h>
  40 #include <lpp/lpp_cplex.h>
  41 //#include <lc_pset.h>
  42 #include <libcore/lc_bitset.h>
  43
  44 #include "be_t.h"
  45 #include "belive_t.h"
  46 #include "besched_t.h"
  47 #include "beirgmod.h"
  48 #include "bearch.h"
  49 #include "benode_t.h"
  50 #include "beutil.h"
  51 #include "bespillremat.h"
  52 #include "bespill.h"
  53 #include "bepressurestat.h"
  54
  55 #include "bechordal_t.h"
  56
  57 #ifdef WITH_LIBCORE
  58 #include <libcore/lc_opts.h>
  59 #include <libcore/lc_opts_enum.h>
  60 #endif /* WITH_LIBCORE */
  61
  62 #define DUMP_PROBLEM       1
  63 #define DUMP_MPS           2
  64 #define DUMP_SOLUTION      4
  65
  66 #define KEEPALIVE_REMATS   1
  67 #define KEEPALIVE_SPILLS   2
  68 #define KEEPALIVE_RELOADS  4
  69
  70 #define VERIFY_MEMINTERF   1
  71 #define VERIFY_DOMINANCE   2
  72
  73 #define REMATS_NONE        0
  74 #define REMATS_BRIGGS      1
  75 #define REMATS_NOINVERSE   2
  76 #define REMATS_ALL         3
  77
  78 static int opt_dump_flags   = 0;
  79 static int opt_log = 0;
  80 static int opt_keep_alive   = 0;
  81 static int opt_goodwin = 1;
  82 static int opt_memcopies = 1;
  83 static int opt_memoperands = 1;
  84 static int opt_verify = VERIFY_MEMINTERF;
  85 static int opt_remats = REMATS_ALL;
  86 static int opt_repair_schedule = 0;
  87 static int opt_no_enlarge_liveness = 0;
  88 static int opt_remat_while_live = 1;
  89 static int opt_timeout = 300;
  90 static double opt_cost_reload = 8.0;
  91 static double opt_cost_memoperand =  7.0;
  92 static double opt_cost_spill =  50.0;
  93 static double opt_cost_remat =  1.0;
  94
  95
  96 #ifdef WITH_LIBCORE
  97 static const lc_opt_enum_mask_items_t dump_items[] = {
  98         { "problem",  DUMP_PROBLEM  },
  99         { "mps",      DUMP_MPS      },
 100         { "solution", DUMP_SOLUTION },
 101         { NULL,       0 }
 102 };
 103
 104 static lc_opt_enum_mask_var_t dump_var = {
 105         &opt_dump_flags, dump_items
 106 };
 107
 108 static const lc_opt_enum_mask_items_t keepalive_items[] = {
 109         { "remats",  KEEPALIVE_REMATS  },
 110         { "spills",  KEEPALIVE_SPILLS  },
 111         { "reloads", KEEPALIVE_RELOADS },
 112         { NULL,      0 }
 113 };
 114
 115 static lc_opt_enum_mask_var_t keep_alive_var = {
 116         &opt_keep_alive, keepalive_items
 117 };
 118
 119 static const lc_opt_enum_mask_items_t remats_items[] = {
 120         { "none",      REMATS_NONE      },
 121         { "briggs",    REMATS_BRIGGS    },
 122         { "noinverse", REMATS_NOINVERSE },
 123         { "all",       REMATS_ALL       },
 124         { NULL,        0 }
 125 };
 126
 127 static lc_opt_enum_mask_var_t remats_var = {
 128         &opt_remats, remats_items
 129 };
 130
 131 static const lc_opt_table_entry_t options[] = {
 132         LC_OPT_ENT_ENUM_MASK("keepalive", "keep alive remats, spills or reloads",                   &keep_alive_var),
 133
 134         LC_OPT_ENT_BOOL     ("goodwin",  "activate goodwin reduction",                              &opt_goodwin),
 135         LC_OPT_ENT_BOOL     ("memcopies",  "activate memcopy handling",                             &opt_memcopies),
 136         LC_OPT_ENT_BOOL     ("memoperands",  "activate memoperands",                                &opt_memoperands),
 137         LC_OPT_ENT_ENUM_INT ("remats",  "type of remats to insert (none, briggs, noinverse or all)",&remats_var),
 138         LC_OPT_ENT_BOOL     ("repair_schedule",  "repair the schedule by rematting once used nodes",&opt_repair_schedule),
 139         LC_OPT_ENT_BOOL     ("no_enlage_liveness",  "do not enlarge liveness of operands of remats",&opt_no_enlarge_liveness),
 140         LC_OPT_ENT_BOOL     ("remat_while_live",  "remat only values that can be used by real ops", &opt_remat_while_live),
 141
 142         LC_OPT_ENT_ENUM_MASK("dump", "dump ifg before, after or after each cloud",                  &dump_var),
 143         LC_OPT_ENT_BOOL     ("log",  "activate the lpp log",                                        &opt_log),
 144         LC_OPT_ENT_INT      ("timeout",  "ILP solver timeout",                                      &opt_timeout),
 145
 146         LC_OPT_ENT_DBL      ("cost_reload",  "cost of a reload",                                    &opt_cost_reload),
 147         LC_OPT_ENT_DBL      ("cost_memoperand",  "cost of a memory operand",                        &opt_cost_memoperand),
 148         LC_OPT_ENT_DBL      ("cost_spill",  "cost of a spill instruction",                          &opt_cost_spill),
 149         LC_OPT_ENT_DBL      ("cost_remat",  "cost of a rematerialization",                          &opt_cost_remat),
 150         { NULL }
 151 };
 152
 153 void be_spill_remat_register_options(lc_opt_entry_t *grp)
 154 {
 155         lc_opt_entry_t *my_grp = lc_opt_get_grp(grp, "remat");
 156         lc_opt_add_table(my_grp, options);
 157 }
 158 #endif
 159
 160
 161 //#define EXECFREQ_LOOPDEPH   /* compute execution frequency from loop depth only */
 162 //#define SCHEDULE_PHIM   /* insert phim nodes into schedule */
 163
 164 #define  SOLVE
 165 //#define  SOLVE_LOCAL
 166 #define LPP_SERVER "i44pc52"
 167 #define LPP_SOLVER "cplex"
 168
 169
 170 #define MAX_PATHS      INT_MAX
 171 #define ILP_UNDEF               -1
 172
 173 typedef struct _spill_ilp_t {
 174         const arch_register_class_t  *cls;
 175         int                           n_regs;
 176         const be_chordal_env_t       *chordal_env;
 177         be_lv_t                      *lv;
 178         lpp_t                        *lpp;
 179         struct obstack               *obst;
 180         set                          *remat_info;
 181         pset                         *all_possible_remats;
 182         pset                         *inverse_ops;
 183         ir_node                      *keep;
 184         set                          *values; /**< for collecting all definitions of values before running ssa-construction */
 185         pset                         *spills;
 186         set                          *interferences;
 187         ir_node                      *m_unknown;
 188         set                          *memoperands;
 189         DEBUG_ONLY(firm_dbg_module_t * dbg);
 190 } spill_ilp_t;
 191
 192 typedef int ilp_var_t;
 193 typedef int ilp_cst_t;
 194
 195 typedef struct _spill_bb_t {
 196         set      *ilp;
 197         set      *reloads;
 198 } spill_bb_t;
 199
 200 typedef struct _remat_t {
 201         const ir_node        *op;      /**< for copy_irn */
 202         const ir_node        *value;   /**< the value which is being recomputed by this remat */
 203         const ir_node        *proj;    /**< not NULL if the above op produces a tuple */
 204         int                   cost;    /**< cost of this remat */
 205         int                   inverse; /**< nonzero if this is an inverse remat */
 206 } remat_t;
 207
 208 /**
 209  * Data to be attached to each IR node. For remats this contains the ilp_var
 210  * for this remat and for normal ops this contains the ilp_vars for
 211  * reloading each operand
 212  */
 213 typedef struct _op_t {
 214         int             is_remat;
 215         union {
 216                 struct {
 217                         ilp_var_t       ilp;
 218                         const remat_t  *remat; /** the remat this op belongs to */
 219                         int             pre; /** 1, if this is a pressure-increasing remat */
 220                 } remat;
 221                 struct {
 222                         ilp_var_t       ilp;
 223                         ir_node        *op; /** the operation this live range belongs to */
 224                         union {
 225                                 ilp_var_t      *reloads;
 226                                 ilp_var_t      *copies;
 227                         } args;
 228                 } live_range;
 229         } attr;
 230 } op_t;
 231
 232 typedef struct _defs_t {
 233         const ir_node   *value;
 234         ir_node         *spills;  /**< points to the first spill for this value (linked by link field) */
 235         ir_node         *remats;  /**< points to the first definition for this value (linked by link field) */
 236 } defs_t;
 237
 238 typedef struct _remat_info_t {
 239         const ir_node       *irn; /**< the irn to which these remats belong */
 240         pset                *remats; /**< possible remats for this value */
 241         pset                *remats_by_operand; /**< remats with this value as operand */
 242 } remat_info_t;
 243
 244 typedef struct _keyval_t {
 245         const void          *key;
 246         const void          *val;
 247 } keyval_t;
 248
 249 typedef struct _spill_t {
 250         ir_node            *irn;
 251         ilp_var_t           reg_in;
 252         ilp_var_t           mem_in;
 253         ilp_var_t           reg_out;
 254         ilp_var_t           mem_out;
 255         ilp_var_t           spill;
 256 } spill_t;
 257
 258 typedef struct _memoperand_t {
 259         ir_node             *irn; /**< the irn */
 260         unsigned int         pos; /**< the position of the argument */
 261         ilp_var_t            ilp; /**< the ilp var for this memory operand */
 262 } memoperand_t;
 263
 264 static INLINE int
 265 has_reg_class(const spill_ilp_t * si, const ir_node * irn)
 266 {
 267         return chordal_has_class(si->chordal_env, irn);
 268 }
 269
 270 #if 0
 271 static int
 272 cmp_remat(const void *a, const void *b)
 273 {
 274         const keyval_t *p = a;
 275         const keyval_t *q = b;
 276         const remat_t  *r = p->val;
 277         const remat_t  *s = q->val;
 278
 279         assert(r && s);
 280
 281         return !(r == s || r->op == s->op);
 282 }
 283 #endif
 284 static int
 285 cmp_remat(const void *a, const void *b)
 286 {
 287         const remat_t  *r = a;
 288         const remat_t  *s = a;
 289
 290         return !(r == s || r->op == s->op);
 291 }
 292
 293 static int
 294 cmp_spill(const void *a, const void *b, size_t size)
 295 {
 296         const spill_t *p = a;
 297         const spill_t *q = b;
 298
 299 //      return !(p->irn == q->irn && p->bb == q->bb);
 300         return !(p->irn == q->irn);
 301 }
 302
 303 static int
 304 cmp_memoperands(const void *a, const void *b, size_t size)
 305 {
 306         const memoperand_t *p = a;
 307         const memoperand_t *q = b;
 308
 309         return !(p->irn == q->irn && p->pos == q->pos);
 310 }
 311
 312 static keyval_t *
 313 set_find_keyval(set * set, const void * key)
 314 {
 315         keyval_t     query;
 316
 317         query.key = key;
 318         return set_find(set, &query, sizeof(query), HASH_PTR(key));
 319 }
 320
 321 static keyval_t *
 322 set_insert_keyval(set * set, void * key, void * val)
 323 {
 324         keyval_t     query;
 325
 326         query.key = key;
 327         query.val = val;
 328         return set_insert(set, &query, sizeof(query), HASH_PTR(key));
 329 }
 330
 331 static defs_t *
 332 set_find_def(set * set, const ir_node * value)
 333 {
 334         defs_t     query;
 335
 336         query.value = value;
 337         return set_find(set, &query, sizeof(query), HASH_PTR(value));
 338 }
 339
 340 static defs_t *
 341 set_insert_def(set * set, const ir_node * value)
 342 {
 343         defs_t     query;
 344
 345         query.value = value;
 346         query.spills = NULL;
 347         query.remats = NULL;
 348         return set_insert(set, &query, sizeof(query), HASH_PTR(value));
 349 }
 350
 351 static memoperand_t *
 352 set_insert_memoperand(set * set, ir_node * irn, unsigned int pos, ilp_var_t ilp)
 353 {
 354         memoperand_t     query;
 355
 356         query.irn = irn;
 357         query.pos = pos;
 358         query.ilp = ilp;
 359         return set_insert(set, &query, sizeof(query), HASH_PTR(irn)+pos);
 360 }
 361
 362 static memoperand_t *
 363 set_find_memoperand(set * set, const ir_node * irn, unsigned int pos)
 364 {
 365         memoperand_t     query;
 366
 367         query.irn = (ir_node*)irn;
 368         query.pos = pos;
 369         return set_find(set, &query, sizeof(query), HASH_PTR(irn)+pos);
 370 }
 371
 372
 373 static spill_t *
 374 set_find_spill(set * set, const ir_node * value)
 375 {
 376         spill_t     query;
 377
 378         query.irn = (ir_node*)value;
 379         return set_find(set, &query, sizeof(query), HASH_PTR(value));
 380 }
 381
 382 #define pset_foreach(s,i) for((i)=pset_first((s)); (i); (i)=pset_next((s)))
 383 #define set_foreach(s,i) for((i)=set_first((s)); (i); (i)=set_next((s)))
 384 #define foreach_post_remat(s,i) for((i)=next_post_remat((s)); (i); (i)=next_post_remat((i)))
 385 #define foreach_pre_remat(si,s,i) for((i)=next_pre_remat((si),(s)); (i); (i)=next_pre_remat((si),(i)))
 386 #define sched_foreach_op(s,i) for((i)=sched_next_op((s));!sched_is_end((i));(i)=sched_next_op((i)))
 387
 388 static int
 389 cmp_remat_info(const void *a, const void *b, size_t size)
 390 {
 391         const remat_info_t *p = a;
 392         const remat_info_t *q = b;
 393
 394         return !(p->irn == q->irn);
 395 }
 396
 397 static int
 398 cmp_defs(const void *a, const void *b, size_t size)
 399 {
 400         const defs_t *p = a;
 401         const defs_t *q = b;
 402
 403         return !(p->value == q->value);
 404 }
 405
 406 static int
 407 cmp_keyval(const void *a, const void *b, size_t size)
 408 {
 409         const keyval_t *p = a;
 410         const keyval_t *q = b;
 411
 412         return !(p->key == q->key);
 413 }
 414
 415 static double
 416 execution_frequency(const spill_ilp_t *si, const ir_node * irn)
 417 {
 418 #define FUDGE 0.001
 419 #ifndef EXECFREQ_LOOPDEPH
 420         return get_block_execfreq(si->chordal_env->exec_freq, get_block(irn)) + FUDGE;
 421 #else
 422         if(is_Block(irn))
 423                 return exp(get_loop_depth(get_irn_loop(irn)) * log(10)) + FUDGE;
 424         else
 425                 return exp(get_loop_depth(get_irn_loop(get_nodes_block(irn))) * log(10)) + FUDGE;
 426 #endif
 427 }
 428
 429 static double
 430 get_cost(const spill_ilp_t * si, const ir_node * irn)
 431 {
 432         if(be_is_Spill(irn)) {
 433                 return opt_cost_spill;
 434         } else if(be_is_Reload(irn)){
 435                 return opt_cost_reload;
 436         } else {
 437                 return arch_get_op_estimated_cost(si->chordal_env->birg->main_env->arch_env, irn);
 438         }
 439 }
 440
 441 /**
 442  * Checks, whether node and its operands have suitable reg classes
 443  */
 444 static INLINE int
 445 is_rematerializable(const spill_ilp_t * si, const ir_node * irn)
 446 {
 447         int               n;
 448         const arch_env_t *arch_env = si->chordal_env->birg->main_env->arch_env;
 449         int               remat = (arch_irn_get_flags(arch_env, irn) & arch_irn_flags_rematerializable) != 0;
 450
 451 #if 0
 452         if(!remat)
 453                 ir_fprintf(stderr, "  Node %+F is not rematerializable\n", irn);
 454 #endif
 455
 456         for (n = get_irn_arity(irn)-1; n>=0 && remat; --n) {
 457                 ir_node        *op = get_irn_n(irn, n);
 458                 remat &= has_reg_class(si, op) || arch_irn_get_flags(arch_env, op) & arch_irn_flags_ignore || (get_irn_op(op) == op_NoMem);
 459
 460 //              if(!remat)
 461 //                      ir_fprintf(stderr, "  Argument %d (%+F) of Node %+F has wrong regclass\n", i, op, irn);
 462         }
 463
 464         return remat;
 465 }
 466
 467 /**
 468  * Try to create a remat from @p op with destination value @p dest_value
 469  */
 470 static INLINE remat_t *
 471 get_remat_from_op(spill_ilp_t * si, const ir_node * dest_value, const ir_node * op)
 472 {
 473         remat_t  *remat = NULL;
 474
 475 //      if(!mode_is_datab(get_irn_mode(dest_value)))
 476 //              return NULL;
 477
 478         if(dest_value == op) {
 479                 const ir_node *proj = NULL;
 480
 481                 if(is_Proj(dest_value)) {
 482                         op = get_irn_n(op, 0);
 483                         proj = dest_value;
 484                 }
 485
 486                 if(!is_rematerializable(si, op))
 487                         return NULL;
 488
 489                 remat = obstack_alloc(si->obst, sizeof(*remat));
 490                 remat->op = op;
 491                 remat->cost = get_cost(si, op);
 492                 remat->value = dest_value;
 493                 remat->proj = proj;
 494                 remat->inverse = 0;
 495         } else {
 496                 arch_inverse_t     inverse;
 497                 int                n;
 498
 499                 /* get the index of the operand we want to retrieve by the inverse op */
 500                 for (n = get_irn_arity(op)-1; n>=0; --n) {
 501                         ir_node        *arg = get_irn_n(op, n);
 502
 503                         if(arg == dest_value) break;
 504                 }
 505                 if(n<0) return NULL;
 506
 507                 DBG((si->dbg, LEVEL_5, "\t  requesting inverse op for argument %d of op %+F\n", n, op));
 508
 509                 /* else ask the backend to give an inverse op */
 510                 if(arch_get_inverse(si->chordal_env->birg->main_env->arch_env, op, n, &inverse, si->obst)) {
 511                         int   i;
 512
 513                         DBG((si->dbg, LEVEL_4, "\t  backend gave us an inverse op with %d nodes and cost %d\n", inverse.n, inverse.costs));
 514
 515                         assert(inverse.n > 0 && "inverse op should have at least one node");
 516
 517                         for(i=inverse.n-1; i>=0; --i) {
 518                                 pset_insert_ptr(si->inverse_ops, inverse.nodes[i]);
 519                         }
 520
 521                         if(inverse.n <= 2) {
 522                                 remat = obstack_alloc(si->obst, sizeof(*remat));
 523                                 remat->op = inverse.nodes[0];
 524                                 remat->cost = inverse.costs;
 525                                 remat->value = dest_value;
 526                                 remat->proj = (inverse.n==2)?inverse.nodes[1]:NULL;
 527                                 remat->inverse = 1;
 528
 529                                 assert(is_Proj(remat->proj));
 530                         } else {
 531                                 assert(0 && "I can not handle remats with more than 2 nodes");
 532                         }
 533                 }
 534         }
 535
 536         if(remat) {
 537                 if(remat->proj) {
 538                         DBG((si->dbg, LEVEL_3, "\t >Found remat %+F for %+F from %+F with %+F\n", remat->op, dest_value, op, remat->proj));
 539                 } else {
 540                         DBG((si->dbg, LEVEL_3, "\t >Found remat %+F for %+F from %+F\n", remat->op, dest_value, op));
 541                 }
 542         }
 543         return remat;
 544 }
 545
 546
 547 static INLINE void
 548 add_remat(const spill_ilp_t * si, const remat_t * remat)
 549 {
 550         remat_info_t    *remat_info,
 551                      query;
 552         int              n;
 553
 554         assert(remat->op);
 555         assert(remat->value);
 556
 557         query.irn = remat->value;
 558         query.remats = NULL;
 559         query.remats_by_operand = NULL;
 560         remat_info = set_insert(si->remat_info, &query, sizeof(query), HASH_PTR(remat->value));
 561
 562         if(remat_info->remats == NULL) {
 563                 remat_info->remats = new_pset(cmp_remat, 4096);
 564         }
 565         pset_insert(remat_info->remats, remat, HASH_PTR(remat->op));
 566
 567         /* insert the remat into the remats_be_operand set of each argument of the remat op */
 568         for (n = get_irn_arity(remat->op)-1; n>=0; --n) {
 569                 ir_node        *arg = get_irn_n(remat->op, n);
 570
 571                 query.irn = arg;
 572                 query.remats = NULL;
 573                 query.remats_by_operand = NULL;
 574                 remat_info = set_insert(si->remat_info, &query, sizeof(query), HASH_PTR(arg));
 575
 576                 if(remat_info->remats_by_operand == NULL) {
 577                         remat_info->remats_by_operand = new_pset(cmp_remat, 4096);
 578                 }
 579                 pset_insert(remat_info->remats_by_operand, remat, HASH_PTR(remat->op));
 580         }
 581 }
 582
 583 static int
 584 get_irn_n_nonremat_edges(const spill_ilp_t * si, const ir_node * irn)
 585 {
 586         const ir_edge_t   *edge = get_irn_out_edge_first(irn);
 587         int                i = 0;
 588
 589         while(edge) {
 590                 if(!pset_find_ptr(si->inverse_ops, edge->src)) {
 591                         ++i;
 592                 }
 593                 edge = get_irn_out_edge_next(irn, edge);
 594         }
 595
 596         return i;
 597 }
 598
 599 static int
 600 get_irn_n_nonignore_args(const spill_ilp_t * si, const ir_node * irn)
 601 {
 602         int n;
 603         unsigned int ret = 0;
 604
 605         for(n=get_irn_arity(irn)-1; n>=0; --n) {
 606                 const ir_node  *arg = get_irn_n(irn, n);
 607
 608                 if(has_reg_class(si, arg)) ++ret;
 609         }
 610
 611         return ret;
 612 }
 613
 614 static INLINE void
 615 get_remats_from_op(spill_ilp_t * si, const ir_node * op)
 616 {
 617         int      n;
 618         remat_t *remat;
 619
 620         if( has_reg_class(si, op)
 621         && (opt_repair_schedule || get_irn_n_nonremat_edges(si, op) > 1)
 622         && (opt_remats !=  REMATS_BRIGGS || get_irn_n_nonignore_args(si, op) == 0)
 623         ) {
 624                 remat = get_remat_from_op(si, op, op);
 625                 if(remat) {
 626                         add_remat(si, remat);
 627                 }
 628         }
 629
 630         if(opt_remats == REMATS_ALL) {
 631                 /* repeat the whole stuff for each remat retrieved by get_remat_from_op(op, arg)
 632                    for each arg */
 633                 for (n = get_irn_arity(op)-1; n>=0; --n) {
 634                         ir_node        *arg = get_irn_n(op, n);
 635
 636                         if(has_reg_class(si, arg)) {
 637                                 /* try to get an inverse remat */
 638                                 remat = get_remat_from_op(si, arg, op);
 639                                 if(remat) {
 640                                         add_remat(si, remat);
 641                                 }
 642                         }
 643                 }
 644         }
 645 }
 646
 647 static INLINE int
 648 value_is_defined_before(const spill_ilp_t * si, const ir_node * pos, const ir_node * val)
 649 {
 650         ir_node *block;
 651         ir_node *def_block = get_nodes_block(val);
 652         int      ret;
 653
 654         if(val == pos)
 655                 return 0;
 656
 657         /* if pos is at end of a basic block */
 658         if(is_Block(pos)) {
 659                 ret = (pos == def_block || block_dominates(def_block, pos));
 660 //              ir_fprintf(stderr, "(def(bb)=%d) ", ret);
 661                 return ret;
 662         }
 663
 664         /* else if this is a normal operation */
 665         block = get_nodes_block(pos);
 666         if(block == def_block) {
 667                 if(!sched_is_scheduled(val)) return 1;
 668
 669                 ret = sched_comes_after(val, pos);
 670 //              ir_fprintf(stderr, "(def(same block)=%d) ",ret);
 671                 return ret;
 672         }
 673
 674         ret = block_dominates(def_block, block);
 675 //      ir_fprintf(stderr, "(def(other block)=%d) ", ret);
 676         return ret;
 677 }
 678
 679 static INLINE ir_node *
 680 sched_block_last_noncf(const spill_ilp_t * si, const ir_node * bb)
 681 {
 682     return sched_skip((ir_node*)bb, 0, sched_skip_cf_predicator, (void *) si->chordal_env->birg->main_env->arch_env);
 683 }
 684
 685 /**
 686  * Returns first non-Phi node of block @p bb
 687  */
 688 static INLINE ir_node *
 689 sched_block_first_nonphi(const ir_node * bb)
 690 {
 691         return sched_skip((ir_node*)bb, 1, sched_skip_phi_predicator, NULL);
 692 }
 693
 694 static int
 695 sched_skip_proj_predicator(const ir_node * irn, void * data)
 696 {
 697         return (is_Proj(irn));
 698 }
 699
 700 static INLINE ir_node *
 701 sched_next_nonproj(const ir_node * irn, int forward)
 702 {
 703         return sched_skip((ir_node*)irn, forward, sched_skip_proj_predicator, NULL);
 704 }
 705
 706 /**
 707  * Returns next operation node (non-Proj) after @p irn
 708  * or the basic block of this node
 709  */
 710 static INLINE ir_node *
 711 sched_next_op(const ir_node * irn)
 712 {
 713         ir_node *next = sched_next(irn);
 714
 715         if(is_Block(next))
 716                 return next;
 717
 718         return sched_next_nonproj(next, 1);
 719 }
 720
 721 /**
 722  * Returns previous operation node (non-Proj) before @p irn
 723  * or the basic block of this node
 724  */
 725 static INLINE ir_node *
 726 sched_prev_op(const ir_node * irn)
 727 {
 728         ir_node *prev = sched_prev(irn);
 729
 730         if(is_Block(prev))
 731                 return prev;
 732
 733         return sched_next_nonproj(prev, 0);
 734 }
 735
 736 static void
 737 sched_put_after(ir_node * insert, ir_node * irn)
 738 {
 739         if(is_Block(insert)) {
 740                 insert = sched_block_first_nonphi(insert);
 741         } else {
 742                 insert = sched_next_op(insert);
 743         }
 744         sched_add_before(insert, irn);
 745 }
 746
 747 static void
 748 sched_put_before(const spill_ilp_t * si, ir_node * insert, ir_node * irn)
 749 {
 750   if(is_Block(insert)) {
 751           insert = sched_block_last_noncf(si, insert);
 752   } else {
 753           insert = sched_next_nonproj(insert, 0);
 754           insert = sched_prev(insert);
 755   }
 756   sched_add_after(insert, irn);
 757 }
 758
 759 /**
 760  * Tells you whether a @p remat can be placed before the irn @p pos
 761  */
 762 static INLINE int
 763 can_remat_before(const spill_ilp_t * si, const remat_t * remat, const ir_node * pos, const pset * live)
 764 {
 765         const ir_node   *op = remat->op;
 766         const ir_node   *prev;
 767         int        n,
 768                            res = 1;
 769
 770         if(is_Block(pos)) {
 771                 prev = sched_block_last_noncf(si, pos);
 772                 prev = sched_next_nonproj(prev, 0);
 773         } else {
 774                 prev = sched_prev_op(pos);
 775         }
 776         /* do not remat if the rematted value is defined immediately before this op */
 777         if(prev == remat->op) {
 778                 return 0;
 779         }
 780
 781 #if 0
 782         /* this should be just fine, the following OP will be using this value, right? */
 783
 784         /* only remat AFTER the real definition of a value (?) */
 785         if(!value_is_defined_before(si, pos, remat->value)) {
 786 //              ir_fprintf(stderr, "error(not defined)");
 787                 return 0;
 788         }
 789 #endif
 790
 791         for(n=get_irn_arity(op)-1; n>=0 && res; --n) {
 792                 const ir_node   *arg = get_irn_n(op, n);
 793
 794                 if(opt_no_enlarge_liveness) {
 795                         if(has_reg_class(si, arg) && live) {
 796                                 res &= pset_find_ptr((pset*)live, arg)?1:0;
 797                         } else {
 798                                 res &= value_is_defined_before(si, pos, arg);
 799                         }
 800                 } else {
 801                         res &= value_is_defined_before(si, pos, arg);
 802                 }
 803         }
 804
 805         return res;
 806 }
 807
 808 /**
 809  * Tells you whether a @p remat can be placed after the irn @p pos
 810  */
 811 static INLINE int
 812 can_remat_after(const spill_ilp_t * si, const remat_t * remat, const ir_node * pos, const pset * live)
 813 {
 814         if(is_Block(pos)) {
 815                 pos = sched_block_first_nonphi(pos);
 816         } else {
 817                 pos = sched_next_op(pos);
 818         }
 819
 820         /* only remat AFTER the real definition of a value (?) */
 821         if(!value_is_defined_before(si, pos, remat->value)) {
 822                 return 0;
 823         }
 824
 825         return can_remat_before(si, remat, pos, live);
 826 }
 827
 828 /**
 829  * Collect potetially rematerializable OPs
 830  */
 831 static void
 832 walker_remat_collector(ir_node * irn, void * data)
 833 {
 834         spill_ilp_t    *si = data;
 835
 836         if(!is_Block(irn) && !is_Phi(irn)) {
 837                 DBG((si->dbg, LEVEL_4, "\t  Processing %+F\n", irn));
 838                 get_remats_from_op(si, irn);
 839         }
 840 }
 841
 842 /**
 843  * Inserts a copy of @p irn before @p pos
 844  */
 845 static ir_node *
 846 insert_copy_before(const spill_ilp_t * si, const ir_node * irn, ir_node * pos)
 847 {
 848         ir_node     *bb;
 849         ir_node     *copy;
 850
 851         bb = is_Block(pos)?pos:get_nodes_block(pos);
 852         copy = exact_copy(irn);
 853
 854         _set_phi_class(copy, NULL);
 855         set_nodes_block(copy, bb);
 856         sched_put_before(si, pos, copy);
 857
 858         return copy;
 859 }
 860
 861 /**
 862  * Inserts a copy of @p irn after @p pos
 863  */
 864 static ir_node *
 865 insert_copy_after(const spill_ilp_t * si, const ir_node * irn, ir_node * pos)
 866 {
 867         ir_node     *bb;
 868         ir_node     *copy;
 869
 870         bb = is_Block(pos)?pos:get_nodes_block(pos);
 871         copy = exact_copy(irn);
 872
 873         _set_phi_class(copy, NULL);
 874         set_nodes_block(copy, bb);
 875         sched_put_after(pos, copy);
 876
 877         return copy;
 878 }
 879
 880 static ir_node *
 881 insert_remat_after(spill_ilp_t * si, const remat_t * remat, ir_node * pos, const pset * live)
 882 {
 883         char     buf[256];
 884
 885         if(can_remat_after(si, remat, pos, live)) {
 886                 ir_node         *copy,
 887                                                 *proj_copy;
 888                 op_t            *op;
 889
 890                 DBG((si->dbg, LEVEL_3, "\t  >inserting remat %+F\n", remat->op));
 891
 892                 copy = insert_copy_after(si, remat->op, pos);
 893
 894                 ir_snprintf(buf, sizeof(buf), "remat2_%N_%N", copy, pos);
 895                 op = obstack_alloc(si->obst, sizeof(*op));
 896                 op->is_remat = 1;
 897                 op->attr.remat.remat = remat;
 898                 op->attr.remat.pre = 0;
 899                 op->attr.remat.ilp = lpp_add_var_default(si->lpp, buf, lpp_binary, remat->cost*execution_frequency(si, pos), 0.0);
 900
 901                 set_irn_link(copy, op);
 902                 pset_insert_ptr(si->all_possible_remats, copy);
 903                 if(remat->proj) {
 904                         proj_copy = insert_copy_after(si, remat->proj, copy);
 905                         set_irn_n(proj_copy, 0, copy);
 906                         set_irn_link(proj_copy, op);
 907                         pset_insert_ptr(si->all_possible_remats, proj_copy);
 908                 } else {
 909                         proj_copy = NULL;
 910                 }
 911
 912                 return copy;
 913         }
 914
 915         return NULL;
 916 }
 917
 918 static ir_node *
 919 insert_remat_before(spill_ilp_t * si, const remat_t * remat, ir_node * pos, const pset * live)
 920 {
 921         char     buf[256];
 922
 923         if(can_remat_before(si, remat, pos, live)) {
 924                 ir_node         *copy,
 925                                                 *proj_copy;
 926                 op_t            *op;
 927
 928                 DBG((si->dbg, LEVEL_3, "\t  >inserting remat %+F\n", remat->op));
 929
 930                 copy = insert_copy_before(si, remat->op, pos);
 931
 932                 ir_snprintf(buf, sizeof(buf), "remat_%N_%N", copy, pos);
 933                 op = obstack_alloc(si->obst, sizeof(*op));
 934                 op->is_remat = 1;
 935                 op->attr.remat.remat = remat;
 936                 op->attr.remat.pre = 1;
 937                 op->attr.remat.ilp = lpp_add_var_default(si->lpp, buf, lpp_binary, remat->cost*execution_frequency(si, pos), 0.0);
 938
 939                 set_irn_link(copy, op);
 940                 pset_insert_ptr(si->all_possible_remats, copy);
 941                 if(remat->proj) {
 942                         proj_copy = insert_copy_after(si, remat->proj, copy);
 943                         set_irn_n(proj_copy, 0, copy);
 944                         set_irn_link(proj_copy, op);
 945                         pset_insert_ptr(si->all_possible_remats, proj_copy);
 946                 } else {
 947                         proj_copy = NULL;
 948                 }
 949
 950                 return copy;
 951         }
 952
 953         return NULL;
 954 }
 955
 956 static int
 957 get_block_n_succs(const ir_node *block) {
 958         const ir_edge_t *edge;
 959
 960         assert(edges_activated(current_ir_graph));
 961
 962         edge = get_block_succ_first(block);
 963         if (! edge)
 964                 return 0;
 965
 966         edge = get_block_succ_next(block, edge);
 967         return edge ? 2 : 1;
 968 }
 969
 970 static int
 971 is_merge_edge(const ir_node * bb)
 972 {
 973         if(opt_goodwin)
 974                 return get_block_n_succs(bb) == 1;
 975         else
 976                 return 1;
 977 }
 978
 979 static int
 980 is_diverge_edge(const ir_node * bb)
 981 {
 982         if(opt_goodwin)
 983                 return get_Block_n_cfgpreds(bb) == 1;
 984         else
 985                 return 1;
 986 }
 987
 988 static void
 989 walker_regclass_copy_insertor(ir_node * irn, void * data)
 990 {
 991         spill_ilp_t    *si = data;
 992
 993         if(is_Phi(irn) && has_reg_class(si, irn)) {
 994                 int n;
 995
 996                 for(n=get_irn_arity(irn)-1; n>=0; --n) {
 997                         ir_node  *phi_arg = get_irn_n(irn, n);
 998                         ir_node  *bb = get_Block_cfgpred_block(get_nodes_block(irn), n);
 999
1000                         if(!has_reg_class(si, phi_arg)) {
1001                                 ir_node   *copy = be_new_Copy(si->cls, si->chordal_env->irg, bb, phi_arg);
1002                                 ir_node   *pos = sched_block_last_noncf(si, bb);
1003                                 op_t      *op = obstack_alloc(si->obst, sizeof(*op));
1004
1005                                 DBG((si->dbg, LEVEL_2, "\t copy to my regclass for arg %+F of %+F\n", phi_arg, irn));
1006                                 sched_add_after(pos, copy);
1007                                 set_irn_n(irn, n, copy);
1008
1009                                 op->is_remat = 0;
1010                                 op->attr.live_range.args.reloads = NULL;
1011                                 op->attr.live_range.ilp = ILP_UNDEF;
1012                                 set_irn_link(copy, op);
1013                         }
1014                 }
1015         }
1016 }
1017
1018
1019 /**
1020  * Insert (so far unused) remats into the irg to
1021  * recompute the potential liveness of all values
1022  */
1023 static void
1024 walker_remat_insertor(ir_node * bb, void * data)
1025 {
1026         spill_ilp_t    *si = data;
1027         spill_bb_t     *spill_bb;
1028         ir_node        *irn;
1029         int             n, i;
1030         pset           *live = pset_new_ptr_default();
1031
1032         DBG((si->dbg, LEVEL_3, "\t Entering %+F\n\n", bb));
1033
1034         be_lv_foreach(si->lv, bb, be_lv_state_end, i) {
1035                 ir_node        *value = be_lv_get_irn(si->lv, bb, i);
1036
1037                 /* add remats at end of block */
1038                 if (has_reg_class(si, value)) {
1039                         pset_insert_ptr(live, value);
1040                 }
1041         }
1042
1043         spill_bb = obstack_alloc(si->obst, sizeof(*spill_bb));
1044         set_irn_link(bb, spill_bb);
1045
1046         irn = sched_last(bb);
1047         while(!sched_is_end(irn)) {
1048                 ir_node   *next;
1049                 op_t      *op;
1050                 pset      *args;
1051                 ir_node   *arg;
1052                 pset      *remat_args;
1053
1054                 next = sched_prev(irn);
1055
1056                 DBG((si->dbg, LEVEL_5, "\t at %+F (next: %+F)\n", irn, next));
1057
1058                 if(is_Phi(irn) || is_Proj(irn)) {
1059                         op_t      *op;
1060
1061                         if(has_reg_class(si, irn)) {
1062                                 pset_remove_ptr(live, irn);
1063                         }
1064
1065                         op = obstack_alloc(si->obst, sizeof(*op));
1066                         op->is_remat = 0;
1067                         op->attr.live_range.args.reloads = NULL;
1068                         op->attr.live_range.ilp = ILP_UNDEF;
1069                         set_irn_link(irn, op);
1070
1071                         irn = next;
1072                         continue;
1073                 }
1074
1075                 op = obstack_alloc(si->obst, sizeof(*op));
1076                 op->is_remat = 0;
1077                 op->attr.live_range.ilp = ILP_UNDEF;
1078                 op->attr.live_range.args.reloads = obstack_alloc(si->obst, sizeof(*op->attr.live_range.args.reloads) * get_irn_arity(irn));
1079                 memset(op->attr.live_range.args.reloads, 0xFF, sizeof(*op->attr.live_range.args.reloads) * get_irn_arity(irn));
1080                 set_irn_link(irn, op);
1081
1082                 args = pset_new_ptr_default();
1083
1084                 /* collect arguments of op */
1085                 for (n = get_irn_arity(irn)-1; n>=0; --n) {
1086                         ir_node        *arg = get_irn_n(irn, n);
1087
1088                         pset_insert_ptr(args, arg);
1089                 }
1090
1091                 /* set args of op already live in epilog */
1092                 pset_foreach(args, arg) {
1093                         if(has_reg_class(si, arg)) {
1094                                 pset_insert_ptr(live, arg);
1095                         }
1096                 }
1097                 /* delete defined value from live set */
1098                 if(has_reg_class(si, irn)) {
1099                         pset_remove_ptr(live, irn);
1100                 }
1101
1102
1103                 remat_args = pset_new_ptr_default();
1104
1105                 /* insert all possible remats before irn */
1106                 pset_foreach(args, arg) {
1107                         remat_info_t   *remat_info,
1108                                                     query;
1109                         remat_t        *remat;
1110
1111                         /* continue if the operand has the wrong reg class
1112                          */
1113                         if(!has_reg_class(si, arg))
1114                                 continue;
1115
1116                         query.irn = arg;
1117                         query.remats = NULL;
1118                         query.remats_by_operand = NULL;
1119                         remat_info = set_find(si->remat_info, &query, sizeof(query), HASH_PTR(arg));
1120
1121                         if(!remat_info) {
1122                                 continue;
1123                         }
1124
1125                         if(remat_info->remats) {
1126                                 pset_foreach(remat_info->remats, remat) {
1127                                         ir_node  *remat_irn = NULL;
1128
1129                                         DBG((si->dbg, LEVEL_4, "\t  considering remat %+F for arg %+F\n", remat->op, arg));
1130                                         if(opt_remat_while_live) {
1131                                                 if(pset_find_ptr(live, remat->value)) {
1132                                                         remat_irn = insert_remat_before(si, remat, irn, live);
1133                                                 }
1134                                         } else {
1135                                                 remat_irn = insert_remat_before(si, remat, irn, live);
1136                                         }
1137                                         if(remat_irn) {
1138                                                 for(n=get_irn_arity(remat_irn)-1; n>=0; --n) {
1139                                                         ir_node  *remat_arg = get_irn_n(remat_irn, n);
1140
1141                                                         if(!has_reg_class(si, remat_arg)) continue;
1142
1143                                                         pset_insert_ptr(remat_args, remat_arg);
1144                                                 }
1145                                         }
1146                                 }
1147                         }
1148                 }
1149
1150                 /* now we add remat args to op's args because they could also die at this op */
1151                 pset_foreach(args,arg) {
1152                         if(pset_find_ptr(remat_args, arg)) {
1153                                 pset_remove_ptr(remat_args, arg);
1154                         }
1155                 }
1156                 pset_foreach(remat_args,arg) {
1157                         pset_insert_ptr(args, arg);
1158                 }
1159
1160                 /* insert all possible remats after irn */
1161                 pset_foreach(args, arg) {
1162                         remat_info_t   *remat_info,
1163                                                     query;
1164                         remat_t        *remat;
1165
1166                         /* continue if the operand has the wrong reg class */
1167                         if(!has_reg_class(si, arg))
1168                                 continue;
1169
1170                         query.irn = arg;
1171                         query.remats = NULL;
1172                         query.remats_by_operand = NULL;
1173                         remat_info = set_find(si->remat_info, &query, sizeof(query), HASH_PTR(arg));
1174
1175                         if(!remat_info) {
1176                                 continue;
1177                         }
1178
1179                         /* do not place post remats after jumps */
1180                         if(sched_skip_cf_predicator(irn, si->chordal_env->birg->main_env->arch_env)) continue;
1181
1182                         if(remat_info->remats_by_operand) {
1183                                 pset_foreach(remat_info->remats_by_operand, remat) {
1184                                         /* do not insert remats producing the same value as one of the operands */
1185                                         if(!pset_find_ptr(args, remat->value)) {
1186                                                 DBG((si->dbg, LEVEL_4, "\t  considering remat %+F with arg %+F\n", remat->op, arg));
1187                                                 if(opt_remat_while_live) {
1188                                                         if(pset_find_ptr(live, remat->value)) {
1189                                                                 insert_remat_after(si, remat, irn, live);
1190                                                         }
1191                                                 } else {
1192                                                         insert_remat_after(si, remat, irn, live);
1193                                                 }
1194                                         }
1195                                 }
1196                         }
1197                 }
1198
1199                 del_pset(remat_args);
1200                 del_pset(args);
1201                 irn = next;
1202         }
1203
1204         be_lv_foreach(si->lv, bb, be_lv_state_end | be_lv_state_in, i) {
1205                 ir_node        *value = be_lv_get_irn(si->lv, bb, i);
1206
1207                 /* add remats at end if successor has multiple predecessors */
1208                 if(is_merge_edge(bb)) {
1209                         /* add remats at end of block */
1210                         if (be_is_live_end(si->lv, bb, value) && has_reg_class(si, value)) {
1211                                 remat_info_t   *remat_info,
1212                                                            query;
1213                                 remat_t        *remat;
1214
1215                                 query.irn = value;
1216                                 query.remats = NULL;
1217                                 query.remats_by_operand = NULL;
1218                                 remat_info = set_find(si->remat_info, &query, sizeof(query), HASH_PTR(value));
1219
1220                                 if(remat_info && remat_info->remats) {
1221                                         pset_foreach(remat_info->remats, remat) {
1222                                                 DBG((si->dbg, LEVEL_4, "\t  considering remat %+F at end of block %+F\n", remat->op, bb));
1223
1224                                                 insert_remat_before(si, remat, bb, NULL);
1225                                         }
1226                                 }
1227                         }
1228                 }
1229                 if(is_diverge_edge(bb)) {
1230                         /* add remat2s at beginning of block */
1231                         if ((be_is_live_in(si->lv, bb, value) || (is_Phi(value) && get_nodes_block(value)==bb)) && has_reg_class(si, value)) {
1232                                 remat_info_t   *remat_info,
1233                                                            query;
1234                                 remat_t        *remat;
1235
1236                                 query.irn = value;
1237                                 query.remats = NULL;
1238                                 query.remats_by_operand = NULL;
1239                                 remat_info = set_find(si->remat_info, &query, sizeof(query), HASH_PTR(value));
1240
1241                                 if(remat_info && remat_info->remats) {
1242                                         pset_foreach(remat_info->remats, remat) {
1243                                                 DBG((si->dbg, LEVEL_4, "\t  considering remat %+F at beginning of block %+F\n", remat->op, bb));
1244
1245                                                 /* put the remat here if all its args are available */
1246                                                 insert_remat_after(si, remat, bb, NULL);
1247
1248                                         }
1249                                 }
1250                         }
1251                 }
1252         }
1253 }
1254
1255 /**
1256  * Preparation of blocks' ends for Luke Blockwalker(tm)(R)
1257  */
1258 static void
1259 luke_endwalker(ir_node * bb, void * data)
1260 {
1261         spill_ilp_t    *si = (spill_ilp_t*)data;
1262         pset           *live;
1263         pset           *use_end;
1264         char            buf[256];
1265         ilp_cst_t       cst;
1266         ir_node        *irn;
1267         spill_bb_t     *spill_bb = get_irn_link(bb);
1268         int             i;
1269
1270
1271         live = pset_new_ptr_default();
1272         use_end = pset_new_ptr_default();
1273
1274         be_lv_foreach(si->lv, bb, be_lv_state_end, i) {
1275                 irn = be_lv_get_irn(si->lv, bb, i);
1276                 if (has_reg_class(si, irn) && !pset_find_ptr(si->all_possible_remats, irn)) {
1277                         op_t      *op;
1278
1279                         pset_insert_ptr(live, irn);
1280                         op = get_irn_link(irn);
1281                         assert(!op->is_remat);
1282                 }
1283         }
1284
1285         /* collect values used by cond jumps etc. at bb end (use_end) -> always live */
1286         /* their reg_out must always be set */
1287         sched_foreach_reverse(bb, irn) {
1288                 int   n;
1289
1290                 if(!sched_skip_cf_predicator(irn, si->chordal_env->birg->main_env->arch_env)) break;
1291
1292                 for (n=get_irn_arity(irn)-1; n>=0; --n) {
1293                         ir_node        *irn_arg = get_irn_n(irn, n);
1294
1295                         if(has_reg_class(si, irn_arg)) {
1296                                 pset_insert_ptr(use_end, irn_arg);
1297                         }
1298                 }
1299         }
1300
1301         ir_snprintf(buf, sizeof(buf), "check_end_%N", bb);
1302         //cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, si->n_regs);
1303         cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, si->n_regs - pset_count(use_end));
1304
1305         spill_bb->ilp = new_set(cmp_spill, pset_count(live)+pset_count(use_end));
1306
1307         /* if this is a merge edge we can reload at the end of this block */
1308         if(is_merge_edge(bb)) {
1309                 spill_bb->reloads = new_set(cmp_keyval, pset_count(live)+pset_count(use_end));
1310         } else if(pset_count(use_end)){
1311                 spill_bb->reloads = new_set(cmp_keyval, pset_count(use_end));
1312         } else {
1313                 spill_bb->reloads = NULL;
1314         }
1315
1316         pset_foreach(live,irn) {
1317                 spill_t     query,
1318                                         *spill;
1319                 double      spill_cost;
1320                 int         default_spilled;
1321
1322
1323                 /* handle values used by control flow nodes later separately */
1324                 if(pset_find_ptr(use_end, irn)) continue;
1325
1326                 query.irn = irn;
1327                 spill = set_insert(spill_bb->ilp, &query, sizeof(query), HASH_PTR(irn));
1328
1329                 spill_cost = is_Unknown(irn)?0.0001:opt_cost_spill*execution_frequency(si, bb);
1330
1331                 ir_snprintf(buf, sizeof(buf), "reg_out_%N_%N", irn, bb);
1332                 spill->reg_out = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
1333                 lpp_set_factor_fast(si->lpp, cst, spill->reg_out, 1.0);
1334
1335                 ir_snprintf(buf, sizeof(buf), "mem_out_%N_%N", irn, bb);
1336                 spill->mem_out = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
1337
1338                 ir_snprintf(buf, sizeof(buf), "spill_%N_%N", irn, bb);
1339                 /* by default spill value right after definition */
1340                 default_spilled = be_is_live_in(si->lv, bb, irn) || is_Phi(irn);
1341                 spill->spill    = lpp_add_var_default(si->lpp, buf, lpp_binary, spill_cost, !default_spilled);
1342
1343                 if(is_merge_edge(bb)) {
1344                         ilp_var_t   reload;
1345                         ilp_cst_t   rel_cst;
1346
1347                         ir_snprintf(buf, sizeof(buf), "reload_%N_%N", bb, irn);
1348                         reload = lpp_add_var_default(si->lpp, buf, lpp_binary, opt_cost_reload*execution_frequency(si, bb), 1.0);
1349                         set_insert_keyval(spill_bb->reloads, irn, INT_TO_PTR(reload));
1350
1351                         /* reload <= mem_out */
1352                         rel_cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
1353                         lpp_set_factor_fast(si->lpp, rel_cst, reload, 1.0);
1354                         lpp_set_factor_fast(si->lpp, rel_cst, spill->mem_out, -1.0);
1355                 }
1356
1357                 spill->reg_in = ILP_UNDEF;
1358                 spill->mem_in = ILP_UNDEF;
1359         }
1360
1361         pset_foreach(use_end,irn) {
1362                 spill_t     query,
1363                                         *spill;
1364                 double      spill_cost;
1365                 ilp_cst_t   end_use_req,
1366                                         rel_cst;
1367                 ilp_var_t   reload;
1368                 int         default_spilled;
1369
1370                 query.irn = irn;
1371                 spill = set_insert(spill_bb->ilp, &query, sizeof(query), HASH_PTR(irn));
1372
1373                 spill_cost = is_Unknown(irn)?0.0001:opt_cost_spill*execution_frequency(si, bb);
1374
1375                 ir_snprintf(buf, sizeof(buf), "reg_out_%N_%N", irn, bb);
1376                 spill->reg_out = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
1377                 /* if irn is used at the end of the block, then it is live anyway */
1378                 //lpp_set_factor_fast(si->lpp, cst, spill->reg_out, 1.0);
1379
1380                 ir_snprintf(buf, sizeof(buf), "mem_out_%N_%N", irn, bb);
1381                 spill->mem_out = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
1382
1383                 ir_snprintf(buf, sizeof(buf), "spill_%N_%N", irn, bb);
1384                 default_spilled = be_is_live_in(si->lv, bb, irn) || is_Phi(irn);
1385                 spill->spill    = lpp_add_var_default(si->lpp, buf, lpp_binary, spill_cost, !default_spilled);
1386
1387                 /* reload for use be control flow op */
1388                 ir_snprintf(buf, sizeof(buf), "reload_%N_%N", bb, irn);
1389                 reload = lpp_add_var_default(si->lpp, buf, lpp_binary, opt_cost_reload*execution_frequency(si, bb), 1.0);
1390                 set_insert_keyval(spill_bb->reloads, irn, INT_TO_PTR(reload));
1391
1392                 /* reload <= mem_out */
1393                 rel_cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
1394                 lpp_set_factor_fast(si->lpp, rel_cst, reload, 1.0);
1395                 lpp_set_factor_fast(si->lpp, rel_cst, spill->mem_out, -1.0);
1396
1397                 spill->reg_in = ILP_UNDEF;
1398                 spill->mem_in = ILP_UNDEF;
1399
1400                 ir_snprintf(buf, sizeof(buf), "req_cf_end_%N_%N", irn, bb);
1401                 end_use_req = lpp_add_cst_uniq(si->lpp, buf, lpp_equal, 1);
1402                 lpp_set_factor_fast(si->lpp, end_use_req, spill->reg_out, 1.0);
1403         }
1404
1405         del_pset(live);
1406         del_pset(use_end);
1407 }
1408
1409 static ir_node *
1410 next_post_remat(const ir_node * irn)
1411 {
1412         op_t      *op;
1413     ir_node   *next;
1414
1415         if(is_Block(irn)) {
1416                 next = sched_block_first_nonphi(irn);
1417         } else {
1418                 next = sched_next_op(irn);
1419         }
1420
1421         if(sched_is_end(next))
1422                 return NULL;
1423
1424         op = get_irn_link(next);
1425         if(op->is_remat && !op->attr.remat.pre) {
1426                 return next;
1427         }
1428
1429         return NULL;
1430 }
1431
1432
1433 static ir_node *
1434 next_pre_remat(const spill_ilp_t * si, const ir_node * irn)
1435 {
1436         op_t      *op;
1437         ir_node   *ret;
1438
1439         if(is_Block(irn)) {
1440                 ret = sched_block_last_noncf(si, irn);
1441                 ret = sched_next(ret);
1442                 ret = sched_prev_op(ret);
1443         } else {
1444                 ret = sched_prev_op(irn);
1445         }
1446
1447         if(sched_is_end(ret) || is_Phi(ret))
1448                 return NULL;
1449
1450         op = (op_t*)get_irn_link(ret);
1451         if(op->is_remat && op->attr.remat.pre) {
1452                 return ret;
1453         }
1454
1455         return NULL;
1456 }
1457
1458 /**
1459  * Find a remat of value @p value in the epilog of @p pos
1460  */
1461 static ir_node *
1462 find_post_remat(const ir_node * value, const ir_node * pos)
1463 {
1464         while((pos = next_post_remat(pos)) != NULL) {
1465                 op_t   *op;
1466
1467                 op = get_irn_link(pos);
1468                 assert(op->is_remat && !op->attr.remat.pre);
1469
1470                 if(op->attr.remat.remat->value == value)
1471                         return (ir_node*)pos;
1472
1473 #if 0
1474         const ir_edge_t *edge;
1475                 foreach_out_edge(pos, edge) {
1476                         ir_node   *proj = get_edge_src_irn(edge);
1477                         assert(is_Proj(proj));
1478                 }
1479 #endif
1480
1481         }
1482
1483         return NULL;
1484 }
1485
1486 static spill_t *
1487 add_to_spill_bb(spill_ilp_t * si, ir_node * bb, ir_node * irn)
1488 {
1489         spill_bb_t  *spill_bb = get_irn_link(bb);
1490         spill_t     *spill,
1491                                  query;
1492         char         buf[256];
1493         int          default_spilled;
1494
1495         query.irn = irn;
1496         spill = set_find(spill_bb->ilp, &query, sizeof(query), HASH_PTR(irn));
1497         if(!spill) {
1498                 double   spill_cost = is_Unknown(irn)?0.0001:opt_cost_spill*execution_frequency(si, bb);
1499
1500                 spill = set_insert(spill_bb->ilp, &query, sizeof(query), HASH_PTR(irn));
1501
1502                 spill->reg_out = ILP_UNDEF;
1503                 spill->reg_in  = ILP_UNDEF;
1504                 spill->mem_in  = ILP_UNDEF;
1505
1506                 ir_snprintf(buf, sizeof(buf), "mem_out_%N_%N", irn, bb);
1507                 spill->mem_out = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
1508
1509                 ir_snprintf(buf, sizeof(buf), "spill_%N_%N", irn, bb);
1510                 default_spilled = be_is_live_in(si->lv, bb, irn) || is_Phi(irn);
1511                 spill->spill    = lpp_add_var_default(si->lpp, buf, lpp_binary, spill_cost, !default_spilled);
1512         }
1513
1514         return spill;
1515 }
1516
1517 static void
1518 get_live_end(spill_ilp_t * si, ir_node * bb, pset * live)
1519 {
1520         ir_node        *irn;
1521         int i;
1522
1523         be_lv_foreach(si->lv, bb, be_lv_state_end, i) {
1524                 irn = be_lv_get_irn(si->lv, bb, i);
1525
1526                 if (has_reg_class(si, irn) && !pset_find_ptr(si->all_possible_remats, irn)) {
1527                         pset_insert_ptr(live, irn);
1528                 }
1529         }
1530
1531         irn = sched_last(bb);
1532
1533         /* all values eaten by control flow operations are also live until the end of the block */
1534         sched_foreach_reverse(bb, irn) {
1535                 int  i;
1536
1537                 if(!sched_skip_cf_predicator(irn, si->chordal_env->birg->main_env->arch_env)) break;
1538
1539                 for(i=get_irn_arity(irn)-1; i>=0; --i) {
1540                         ir_node *arg = get_irn_n(irn,i);
1541
1542                         if(has_reg_class(si, arg)) {
1543                                 pset_insert_ptr(live, arg);
1544                         }
1545                 }
1546         }
1547 }
1548
1549 /**
1550  *  Inserts ILP-constraints and variables for memory copying before the given position
1551  */
1552 static void
1553 insert_mem_copy_position(spill_ilp_t * si, pset * live, const ir_node * block)
1554 {
1555         const ir_node    *succ;
1556         const ir_edge_t  *edge;
1557         spill_bb_t       *spill_bb = get_irn_link(block);
1558         ir_node          *phi;
1559         int               pos;
1560         ilp_cst_t         cst;
1561         ilp_var_t         copyreg;
1562         char              buf[256];
1563         ir_node          *tmp;
1564
1565
1566         assert(edges_activated(current_ir_graph));
1567
1568         edge = get_block_succ_first(block);
1569         if(!edge) return;
1570
1571         succ = edge->src;
1572         pos = edge->pos;
1573
1574         edge = get_block_succ_next(block, edge);
1575         /* next block can only contain phis, if this is a merge edge */
1576         if(edge) return;
1577
1578         ir_snprintf(buf, sizeof(buf), "copyreg_%N", block);
1579         copyreg = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
1580
1581         ir_snprintf(buf, sizeof(buf), "check_copyreg_%N", block);
1582         cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, si->n_regs);
1583
1584         pset_foreach(live, tmp) {
1585                 spill_t  *spill;
1586 #if 0
1587                 op_t  *op = get_irn_link(irn);
1588                 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.ilp, 1.0);
1589 #endif
1590                 spill = set_find_spill(spill_bb->ilp, tmp);
1591                 assert(spill);
1592
1593                 lpp_set_factor_fast(si->lpp, cst, spill->reg_out, 1.0);
1594         }
1595         lpp_set_factor_fast(si->lpp, cst, copyreg, 1.0);
1596
1597         sched_foreach(succ, phi) {
1598                 const ir_node  *to_copy;
1599                 op_t           *to_copy_op;
1600                 spill_t        *to_copy_spill;
1601                 op_t           *phi_op = get_irn_link(phi);
1602                 ilp_var_t       reload = ILP_UNDEF;
1603
1604
1605                 if(!is_Phi(phi)) break;
1606                 if(!has_reg_class(si, phi)) continue;
1607
1608                 to_copy = get_irn_n(phi, pos);
1609
1610                 to_copy_op = get_irn_link(to_copy);
1611
1612                 to_copy_spill = set_find_spill(spill_bb->ilp, to_copy);
1613                 assert(to_copy_spill);
1614
1615                 if(spill_bb->reloads) {
1616                         keyval_t *keyval = set_find_keyval(spill_bb->reloads, to_copy);
1617
1618                         if(keyval) {
1619                                 reload = PTR_TO_INT(keyval->val);
1620                         }
1621                 }
1622
1623                 ir_snprintf(buf, sizeof(buf), "req_copy_%N_%N_%N", block, phi, to_copy);
1624                 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
1625
1626                 /* copy - reg_out - reload - remat - live_range <= 0 */
1627                 lpp_set_factor_fast(si->lpp, cst, phi_op->attr.live_range.args.copies[pos], 1.0);
1628                 lpp_set_factor_fast(si->lpp, cst, to_copy_spill->reg_out, -1.0);
1629                 if(reload != ILP_UNDEF) lpp_set_factor_fast(si->lpp, cst, reload, -1.0);
1630                 lpp_set_factor_fast(si->lpp, cst, to_copy_op->attr.live_range.ilp, -1.0);
1631                 foreach_pre_remat(si, block, tmp) {
1632                         op_t     *remat_op = get_irn_link(tmp);
1633                         if(remat_op->attr.remat.remat->value == to_copy) {
1634                                 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, -1.0);
1635                         }
1636                 }
1637
1638                 ir_snprintf(buf, sizeof(buf), "copyreg_%N_%N_%N", block, phi, to_copy);
1639                 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
1640
1641                 /* copy - reg_out - copyreg <= 0 */
1642                 lpp_set_factor_fast(si->lpp, cst, phi_op->attr.live_range.args.copies[pos], 1.0);
1643                 lpp_set_factor_fast(si->lpp, cst, to_copy_spill->reg_out, -1.0);
1644                 lpp_set_factor_fast(si->lpp, cst, copyreg, -1.0);
1645         }
1646 }
1647
1648
1649 /**
1650  * Walk all irg blocks and emit this ILP
1651  */
1652 static void
1653 luke_blockwalker(ir_node * bb, void * data)
1654 {
1655         spill_ilp_t    *si = (spill_ilp_t*)data;
1656         ir_node        *irn;
1657         pset           *live;
1658         char            buf[256];
1659         ilp_cst_t       cst;
1660         spill_bb_t     *spill_bb = get_irn_link(bb);
1661         ir_node        *tmp;
1662         spill_t        *spill;
1663         pset           *defs = pset_new_ptr_default();
1664         const arch_env_t *arch_env = si->chordal_env->birg->main_env->arch_env;
1665
1666
1667         live = pset_new_ptr_default();
1668
1669         /****************************************
1670          *      B A S I C  B L O C K  E N D
1671          ***************************************/
1672
1673
1674         /* init live values at end of block */
1675         get_live_end(si, bb, live);
1676
1677         pset_foreach(live, irn) {
1678                 op_t           *op;
1679                 ilp_var_t       reload = ILP_UNDEF;
1680
1681                 spill = set_find_spill(spill_bb->ilp, irn);
1682                 assert(spill);
1683
1684                 if(spill_bb->reloads) {
1685                         keyval_t *keyval = set_find_keyval(spill_bb->reloads, irn);
1686
1687                         if(keyval) {
1688                                 reload = PTR_TO_INT(keyval->val);
1689                         }
1690                 }
1691
1692                 op = get_irn_link(irn);
1693                 assert(!op->is_remat);
1694
1695                 ir_snprintf(buf, sizeof(buf), "lr_%N_%N", irn, bb);
1696                 op->attr.live_range.ilp = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
1697                 op->attr.live_range.op = bb;
1698
1699                 ir_snprintf(buf, sizeof(buf), "reg_out_%N_%N", bb, irn);
1700                 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
1701
1702                 /* reg_out - reload - remat - live_range <= 0 */
1703                 lpp_set_factor_fast(si->lpp, cst, spill->reg_out, 1.0);
1704                 if(reload != ILP_UNDEF) lpp_set_factor_fast(si->lpp, cst, reload, -1.0);
1705                 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.ilp, -1.0);
1706                 foreach_pre_remat(si, bb, tmp) {
1707                         op_t     *remat_op = get_irn_link(tmp);
1708                         if(remat_op->attr.remat.remat->value == irn) {
1709                                 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, -1.0);
1710                         }
1711                 }
1712                 /* maybe we should also assure that reg_out >= live_range etc. */
1713         }
1714
1715         if(opt_memcopies)
1716                 insert_mem_copy_position(si, live, bb);
1717
1718         /*
1719          * start new live ranges for values used by remats at end of block
1720          * and assure the remat args are available
1721          */
1722         foreach_pre_remat(si, bb, tmp) {
1723                 op_t     *remat_op = get_irn_link(tmp);
1724                 int       n;
1725
1726                 for (n=get_irn_arity(tmp)-1; n>=0; --n) {
1727                         ir_node        *remat_arg = get_irn_n(tmp, n);
1728                         op_t           *arg_op = get_irn_link(remat_arg);
1729                         ilp_var_t       prev_lr;
1730
1731                         if(!has_reg_class(si, remat_arg)) continue;
1732
1733                         /* if value is becoming live through use by remat */
1734                         if(!pset_find_ptr(live, remat_arg)) {
1735                                 ir_snprintf(buf, sizeof(buf), "lr_%N_end%N", remat_arg, bb);
1736                                 prev_lr = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
1737
1738                                 arg_op->attr.live_range.ilp = prev_lr;
1739                                 arg_op->attr.live_range.op = bb;
1740
1741                                 DBG((si->dbg, LEVEL_4, "  value %+F becoming live through use by remat at end of block %+F\n", remat_arg, tmp));
1742
1743                                 pset_insert_ptr(live, remat_arg);
1744                                 add_to_spill_bb(si, bb, remat_arg);
1745                         }
1746
1747                         /* remat <= live_rang(remat_arg) [ + reload(remat_arg) ] */
1748                         ir_snprintf(buf, sizeof(buf), "req_remat_%N_arg_%N", tmp, remat_arg);
1749                         cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1750
1751                         lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
1752                         lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, -1.0);
1753
1754                         /* use reload placed for this argument */
1755                         if(spill_bb->reloads) {
1756                                 keyval_t *keyval = set_find_keyval(spill_bb->reloads, remat_arg);
1757
1758                                 if(keyval) {
1759                                         ilp_var_t       reload = PTR_TO_INT(keyval->val);
1760
1761                                         lpp_set_factor_fast(si->lpp, cst, reload, -1.0);
1762                                 }
1763                         }
1764                 }
1765         }
1766         DBG((si->dbg, LEVEL_4, "\t   %d values live at end of block %+F\n", pset_count(live), bb));
1767
1768
1769
1770
1771         /**************************************
1772          *    B A S I C  B L O C K  B O D Y
1773          **************************************/
1774
1775         sched_foreach_reverse_from(sched_block_last_noncf(si, bb), irn) {
1776                 op_t       *op;
1777                 op_t       *tmp_op;
1778                 int         n,
1779                                         u = 0,
1780                                         d = 0;
1781                 ilp_cst_t       check_pre,
1782                                         check_post;
1783                 set        *args;
1784                 pset       *used;
1785                 pset       *remat_defs;
1786                 keyval_t   *keyval;
1787                 ilp_cst_t   one_memoperand;
1788
1789                 /* iterate only until first phi */
1790                 if(is_Phi(irn))
1791                         break;
1792
1793                 op = get_irn_link(irn);
1794                 /* skip remats */
1795                 if(op->is_remat) continue;
1796                 DBG((si->dbg, LEVEL_4, "\t  at node %+F\n", irn));
1797
1798                 /* collect defined values */
1799                 if(has_reg_class(si, irn)) {
1800                         pset_insert_ptr(defs, irn);
1801                 }
1802
1803                 /* skip projs */
1804                 if(is_Proj(irn)) continue;
1805
1806                 /*
1807                  * init set of irn's arguments
1808                  * and all possibly used values around this op
1809                  * and values defined by post remats
1810                  */
1811                 args =       new_set(cmp_keyval, get_irn_arity(irn));
1812                 used =       pset_new_ptr(pset_count(live) + get_irn_arity(irn));
1813                 remat_defs = pset_new_ptr(pset_count(live));
1814
1815                 for (n=get_irn_arity(irn)-1; n>=0; --n) {
1816                         ir_node        *irn_arg = get_irn_n(irn, n);
1817                         if(has_reg_class(si, irn_arg)) {
1818                                 set_insert_keyval(args, irn_arg, (void*)n);
1819                                 pset_insert_ptr(used, irn_arg);
1820                         }
1821                 }
1822                 foreach_post_remat(irn, tmp) {
1823                         op_t    *remat_op = get_irn_link(tmp);
1824
1825                         pset_insert_ptr(remat_defs, remat_op->attr.remat.remat->value);
1826
1827                         for (n=get_irn_arity(tmp)-1; n>=0; --n) {
1828                                 ir_node        *remat_arg = get_irn_n(tmp, n);
1829                                 if(has_reg_class(si, remat_arg)) {
1830                                         pset_insert_ptr(used, remat_arg);
1831                                 }
1832                         }
1833                 }
1834                 foreach_pre_remat(si, irn, tmp) {
1835                         for (n=get_irn_arity(tmp)-1; n>=0; --n) {
1836                                 ir_node        *remat_arg = get_irn_n(tmp, n);
1837                                 if(has_reg_class(si, remat_arg)) {
1838                                         pset_insert_ptr(used, remat_arg);
1839                                 }
1840                         }
1841                 }
1842
1843                 /**********************************
1844                  *   I N  E P I L O G  O F  irn
1845                  **********************************/
1846
1847                 /* ensure each dying value is used by only one post remat */
1848                 pset_foreach(used, tmp) {
1849                         ir_node     *value = tmp;
1850                         op_t        *value_op = get_irn_link(value);
1851                         ir_node     *remat;
1852                         int          n_remats = 0;
1853
1854                         cst = ILP_UNDEF;
1855                         foreach_post_remat(irn, remat) {
1856                                 op_t  *remat_op = get_irn_link(remat);
1857
1858                                 for(n=get_irn_arity(remat)-1; n>=0; --n) {
1859                                         ir_node   *remat_arg = get_irn_n(remat, n);
1860
1861                                         /* if value is used by this remat add it to constraint */
1862                                         if(remat_arg == value) {
1863                                                 if(n_remats == 0) {
1864                                                         /* sum remat2s <= 1 + n_remats*live_range */
1865                                                         ir_snprintf(buf, sizeof(buf), "dying_lr_%N_%N", value, irn);
1866                                                         cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 1.0);
1867                                                 }
1868
1869                                                 n_remats++;
1870                                                 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
1871                                                 break;
1872                                         }
1873                                 }
1874                         }
1875
1876             // value_op->attr.live_range.ilp != ILP_UNDEF
1877                         if(pset_find_ptr(live, value) && cst != ILP_UNDEF) {
1878                                 lpp_set_factor_fast(si->lpp, cst, value_op->attr.live_range.ilp, -n_remats);
1879                         }
1880                 }
1881
1882         /* ensure at least one value dies at post remat */
1883         foreach_post_remat(irn, tmp) {
1884             op_t     *remat_op = get_irn_link(tmp);
1885             pset     *remat_args = pset_new_ptr(get_irn_arity(tmp));
1886             ir_node  *remat_arg;
1887
1888             for(n=get_irn_arity(tmp)-1; n>=0; --n) {
1889                 remat_arg = get_irn_n(tmp, n);
1890
1891                 if(has_reg_class(si, remat_arg)) {
1892
1893                     /* does arg always die at this op? */
1894                     if(!pset_find_ptr(live, remat_arg))
1895                         goto skip_one_must_die;
1896
1897                     pset_insert_ptr(remat_args, remat_arg);
1898                 }
1899             }
1900
1901             /* remat + \sum live_range(remat_arg) <= |args| */
1902             ir_snprintf(buf, sizeof(buf), "one_must_die_%+F", tmp);
1903             cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, pset_count(remat_args));
1904             lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
1905
1906             pset_foreach(remat_args, remat_arg) {
1907                 op_t  *arg_op = get_irn_link(remat_arg);
1908
1909                 lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, 1.0);
1910             }
1911
1912 skip_one_must_die:
1913             del_pset(remat_args);
1914         }
1915
1916                 /* new live ranges for values from L\U defined by post remats */
1917                 pset_foreach(live, tmp) {
1918                         ir_node     *value = tmp;
1919                         op_t        *value_op = get_irn_link(value);
1920
1921                         if(!set_find_keyval(args, value) && !pset_find_ptr(defs, value)) {
1922                                 ilp_var_t    prev_lr = ILP_UNDEF;
1923                                 ir_node     *remat;
1924
1925                                 if(pset_find_ptr(remat_defs, value)) {
1926
1927                                         /* next_live_range <= prev_live_range + sum remat2s */
1928                                         ir_snprintf(buf, sizeof(buf), "next_lr_%N_%N", value, irn);
1929                                         cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
1930
1931                                         ir_snprintf(buf, sizeof(buf), "lr_%N_%N", value, irn);
1932                                         prev_lr = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
1933
1934                                         lpp_set_factor_fast(si->lpp, cst, value_op->attr.live_range.ilp, 1.0);
1935                                         lpp_set_factor_fast(si->lpp, cst, prev_lr, -1.0);
1936
1937                                         foreach_post_remat(irn, remat) {
1938                                                 op_t        *remat_op = get_irn_link(remat);
1939
1940                                                 /* if value is being rematerialized by this remat */
1941                                                 if(value == remat_op->attr.remat.remat->value) {
1942                                                         lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, -1.0);
1943                                                 }
1944                                         }
1945
1946                                         value_op->attr.live_range.ilp = prev_lr;
1947                                         value_op->attr.live_range.op = irn;
1948                                 }
1949                         }
1950                 }
1951
1952                 /* requirements for post remats and start live ranges from L/U' for values dying here */
1953                 foreach_post_remat(irn, tmp) {
1954                         op_t        *remat_op = get_irn_link(tmp);
1955                         int          n;
1956
1957                         for (n=get_irn_arity(tmp)-1; n>=0; --n) {
1958                                 ir_node        *remat_arg = get_irn_n(tmp, n);
1959                                 op_t           *arg_op = get_irn_link(remat_arg);
1960
1961                                 if(!has_reg_class(si, remat_arg)) continue;
1962
1963                                 /* only for values in L\U (TODO and D?), the others are handled with post_use */
1964                                 if(!pset_find_ptr(used, remat_arg)) {
1965                                         /* remat <= live_range(remat_arg) */
1966                                         ir_snprintf(buf, sizeof(buf), "req_remat2_%N_arg_%N", tmp, remat_arg);
1967                                         cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
1968
1969                                         /* if value is becoming live through use by remat2 */
1970                                         if(!pset_find_ptr(live, remat_arg)) {
1971                                                 ilp_var_t     lr;
1972
1973                                                 ir_snprintf(buf, sizeof(buf), "lr_%N_%N", remat_arg, irn);
1974                                                 lr = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
1975
1976                                                 arg_op->attr.live_range.ilp = lr;
1977                                                 arg_op->attr.live_range.op = irn;
1978
1979                                                 DBG((si->dbg, LEVEL_3, "  value %+F becoming live through use by remat2 %+F\n", remat_arg, tmp));
1980
1981                                                 pset_insert_ptr(live, remat_arg);
1982                                                 add_to_spill_bb(si, bb, remat_arg);
1983                                         }
1984
1985                                         lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
1986                                         lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, -1.0);
1987                                 }
1988                         }
1989                 }
1990
1991                 d = pset_count(defs);
1992                 DBG((si->dbg, LEVEL_4, "\t   %+F produces %d values in my register class\n", irn, d));
1993
1994                 /* count how many regs irn needs for arguments */
1995                 u = set_count(args);
1996
1997
1998                 /* check the register pressure in the epilog */
1999                 /* sum_{L\U'} lr + sum_{U'} post_use <= k - |D| */
2000                 ir_snprintf(buf, sizeof(buf), "check_post_%N", irn);
2001                 check_post = lpp_add_cst_uniq(si->lpp, buf, lpp_less, si->n_regs - d);
2002
2003                 /* add L\U' to check_post */
2004                 pset_foreach(live, tmp) {
2005                         if(!pset_find_ptr(used, tmp) && !pset_find_ptr(defs, tmp)) {
2006                                 /* if a live value is not used by irn */
2007                                 tmp_op = get_irn_link(tmp);
2008                                 lpp_set_factor_fast(si->lpp, check_post, tmp_op->attr.live_range.ilp, 1.0);
2009                         }
2010                 }
2011
2012                 /***********************************************************
2013                  *  I T E R A T I O N  O V E R  U S E S  F O R  E P I L O G
2014                  **********************************************************/
2015
2016
2017                 pset_foreach(used, tmp) {
2018                         ilp_var_t       prev_lr;
2019                         ilp_var_t       post_use;
2020                         int             p = 0;
2021                         spill_t        *spill;
2022                         ir_node        *arg = tmp;
2023                         op_t           *arg_op = get_irn_link(arg);
2024                         ir_node        *remat;
2025
2026                         spill = add_to_spill_bb(si, bb, arg);
2027
2028                         /* new live range for each used value */
2029                         ir_snprintf(buf, sizeof(buf), "lr_%N_%N", arg, irn);
2030                         prev_lr = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
2031
2032                         /* the epilog stuff - including post_use, check_post, check_post_remat */
2033                         ir_snprintf(buf, sizeof(buf), "post_use_%N_%N", arg, irn);
2034                         post_use = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
2035
2036                         lpp_set_factor_fast(si->lpp, check_post, post_use, 1.0);
2037
2038                         /* arg is live throughout epilog if the next live_range is in a register */
2039                         if(pset_find_ptr(live, arg)) {
2040                                 DBG((si->dbg, LEVEL_3, "\t  arg %+F is possibly live in epilog of %+F\n", arg, irn));
2041
2042                                 /* post_use >= next_lr + remat */
2043                                 ir_snprintf(buf, sizeof(buf), "post_use_%N_%N-%d", arg, irn, p++);
2044                                 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2045                                 lpp_set_factor_fast(si->lpp, cst, post_use, -1.0);
2046                                 lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, 1.0);
2047
2048                         }
2049
2050                         /* if value is not an arg of op and not possibly defined by post remat
2051                          * then it may only die and not become live
2052                          */
2053                         if(!set_find_keyval(args, arg)) {
2054                                 /* post_use <= prev_lr */
2055                                 ir_snprintf(buf, sizeof(buf), "req_post_use_%N_%N", arg, irn);
2056                                 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2057                                 lpp_set_factor_fast(si->lpp, cst, post_use, 1.0);
2058                                 lpp_set_factor_fast(si->lpp, cst, prev_lr, -1.0);
2059
2060                                 if(!pset_find_ptr(remat_defs, arg) && pset_find_ptr(live, arg)) {
2061                                         /* next_lr <= prev_lr */
2062                                         ir_snprintf(buf, sizeof(buf), "next_lr_%N_%N", arg, irn);
2063                                         cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2064                                         lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, 1.0);
2065                                         lpp_set_factor_fast(si->lpp, cst, prev_lr, -1.0);
2066                                 }
2067                         }
2068
2069
2070                         /* forall post remat which use arg add a similar cst */
2071                         foreach_post_remat(irn, remat) {
2072                                 int      n;
2073
2074                                 for (n=get_irn_arity(remat)-1; n>=0; --n) {
2075                                         ir_node    *remat_arg = get_irn_n(remat, n);
2076                                         op_t       *remat_op = get_irn_link(remat);
2077
2078                                         if(remat_arg == arg) {
2079                                                 DBG((si->dbg, LEVEL_3, "\t  found remat with arg %+F in epilog of %+F\n", arg, irn));
2080
2081                                                 ir_snprintf(buf, sizeof(buf), "post_use_%N_%N-%d", arg, irn, p++);
2082                                                 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2083                                                 lpp_set_factor_fast(si->lpp, cst, post_use, -1.0);
2084                                                 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
2085                                         }
2086                                 }
2087                         }
2088
2089                         if(opt_memoperands) {
2090                                 for(n = get_irn_arity(irn)-1; n>=0; --n) {
2091                                         if(get_irn_n(irn, n) == arg && arch_possible_memory_operand(arch_env, irn, n)) {
2092                                                 ilp_var_t       memoperand;
2093
2094                                                 ir_snprintf(buf, sizeof(buf), "memoperand_%N_%d", irn, n);
2095                                                 memoperand = lpp_add_var_default(si->lpp, buf, lpp_binary, opt_cost_memoperand*execution_frequency(si, bb), 0.0);
2096                                                 set_insert_memoperand(si->memoperands, irn, n, memoperand);
2097
2098                                                 ir_snprintf(buf, sizeof(buf), "nolivepost_%N_%d", irn, n);
2099                                                 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 1.0);
2100
2101                                                 lpp_set_factor_fast(si->lpp, cst, memoperand, 1.0);
2102                                                 lpp_set_factor_fast(si->lpp, cst, post_use, 1.0);
2103 //                                              if(arg_op->attr.live_range.ilp != ILP_UNDEF)
2104 //                                                      lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, 1.0);
2105                                         }
2106                                 }
2107                         }
2108
2109                         /* new live range begins for each used value */
2110                         arg_op->attr.live_range.ilp = prev_lr;
2111                         arg_op->attr.live_range.op = irn;
2112
2113                         /*if(!pset_find_ptr(live, arg)) {
2114                                 pset_insert_ptr(live, arg);
2115                                 add_to_spill_bb(si, bb, arg);
2116                         }*/
2117                         pset_insert_ptr(live, arg);
2118
2119                 }
2120
2121                 /* just to be sure */
2122                 check_post = ILP_UNDEF;
2123
2124
2125
2126
2127                 /******************
2128                  *   P R O L O G
2129                  ******************/
2130
2131                 /* check the register pressure in the prolog */
2132                 /* sum_{L\U} lr <= k - |U| */
2133                 ir_snprintf(buf, sizeof(buf), "check_pre_%N", irn);
2134                 check_pre = lpp_add_cst_uniq(si->lpp, buf, lpp_less, si->n_regs - u);
2135
2136                 /* for the prolog remove defined values from the live set */
2137                 pset_foreach(defs, tmp) {
2138                         pset_remove_ptr(live, tmp);
2139                 }
2140
2141                 if(opt_memoperands) {
2142                         ir_snprintf(buf, sizeof(buf), "one_memoperand_%N", irn);
2143                         one_memoperand = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 1.0);
2144                 }
2145
2146                 /***********************************************************
2147                  *  I T E R A T I O N  O V E R  A R G S  F O R  P R O L O G
2148                  **********************************************************/
2149
2150
2151                 set_foreach(args, keyval) {
2152                         spill_t          *spill;
2153                         const ir_node    *arg = keyval->key;
2154                         int               i = PTR_TO_INT(keyval->val);
2155                         op_t             *arg_op = get_irn_link(arg);
2156                         ilp_cst_t         requirements;
2157                         int               n_memoperands;
2158
2159                         spill = set_find_spill(spill_bb->ilp, arg);
2160                         assert(spill);
2161
2162                         ir_snprintf(buf, sizeof(buf), "reload_%N_%N", arg, irn);
2163                         op->attr.live_range.args.reloads[i] = lpp_add_var_default(si->lpp, buf, lpp_binary, opt_cost_reload*execution_frequency(si, bb), 1.0);
2164
2165                         /* reload <= mem_out */
2166                         ir_snprintf(buf, sizeof(buf), "req_reload_%N_%N", arg, irn);
2167                         cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2168                         lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.args.reloads[i], 1.0);
2169                         lpp_set_factor_fast(si->lpp, cst, spill->mem_out, -1.0);
2170
2171                         /* requirement: arg must be in register for use */
2172                         /* reload + remat + live_range == 1 */
2173                         ir_snprintf(buf, sizeof(buf), "req_%N_%N", irn, arg);
2174                         requirements = lpp_add_cst_uniq(si->lpp, buf, lpp_equal, 1.0);
2175
2176                         lpp_set_factor_fast(si->lpp, requirements, arg_op->attr.live_range.ilp, 1.0);
2177                         lpp_set_factor_fast(si->lpp, requirements, op->attr.live_range.args.reloads[i], 1.0);
2178                         foreach_pre_remat(si, irn, tmp) {
2179                                 op_t     *remat_op = get_irn_link(tmp);
2180                                 if(remat_op->attr.remat.remat->value == arg) {
2181                                         lpp_set_factor_fast(si->lpp, requirements, remat_op->attr.remat.ilp, 1.0);
2182                                 }
2183                         }
2184
2185                         if(opt_memoperands) {
2186                                 n_memoperands = 0;
2187                                 for(n = get_irn_arity(irn)-1; n>=0; --n) {
2188                                         if(get_irn_n(irn, n) == arg) {
2189                                                 n_memoperands++;
2190                                         }
2191                                 }
2192                                 for(n = get_irn_arity(irn)-1; n>=0; --n) {
2193                                         if(get_irn_n(irn, n) == arg && arch_possible_memory_operand(arch_env, irn, n)) {
2194                                                 memoperand_t  *memoperand;
2195                                                 memoperand = set_find_memoperand(si->memoperands, irn, n);
2196
2197                                                 /* memoperand <= mem_out */
2198                                                 ir_snprintf(buf, sizeof(buf), "req_memoperand_%N_%d", irn, n);
2199                                                 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2200                                                 lpp_set_factor_fast(si->lpp, cst, memoperand->ilp, 1.0);
2201                                                 lpp_set_factor_fast(si->lpp, cst, spill->mem_out, -1.0);
2202
2203                                                 /* the memoperand is only sufficient if it is used once by the op */
2204                                                 if(n_memoperands == 1)
2205                                                         lpp_set_factor_fast(si->lpp, requirements, memoperand->ilp, 1.0);
2206
2207                                                 lpp_set_factor_fast(si->lpp, one_memoperand, memoperand->ilp, 1.0);
2208
2209                                                 /* we have one more free register if we use a memory operand */
2210                                                 lpp_set_factor_fast(si->lpp, check_pre, memoperand->ilp, -1.0);
2211                                         }
2212                                 }
2213                         }
2214                 }
2215
2216                 /* iterate over L\U */
2217                 pset_foreach(live, tmp) {
2218                         if(!set_find_keyval(args, tmp)) {
2219                                 /* if a live value is not used by irn */
2220                                 tmp_op = get_irn_link(tmp);
2221                                 lpp_set_factor_fast(si->lpp, check_pre, tmp_op->attr.live_range.ilp, 1.0);
2222                         }
2223                 }
2224
2225
2226                 /* requirements for remats */
2227                 /* start new live ranges for values used by remats */
2228                 foreach_pre_remat(si, irn, tmp) {
2229                         op_t        *remat_op = get_irn_link(tmp);
2230                         int          n;
2231
2232                         for (n=get_irn_arity(tmp)-1; n>=0; --n) {
2233                                 ir_node        *remat_arg = get_irn_n(tmp, n);
2234                                 op_t           *arg_op = get_irn_link(remat_arg);
2235
2236                                 if(!has_reg_class(si, remat_arg)) continue;
2237
2238                                 /* remat <= live_rang(remat_arg) [ + reload(remat_arg) ] */
2239                                 ir_snprintf(buf, sizeof(buf), "req_remat_%N_arg_%N", tmp, remat_arg);
2240                                 cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
2241
2242                                 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
2243                                 lpp_set_factor_fast(si->lpp, cst, arg_op->attr.live_range.ilp, -1.0);
2244
2245                                 /* if remat arg is also used by current op then we can use reload placed for this argument */
2246                                 if((keyval = set_find_keyval(args, remat_arg)) != NULL) {
2247                                         int    index = (int)keyval->val;
2248
2249                                         lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.args.reloads[index], -1.0);
2250                                 }
2251                         }
2252                 }
2253
2254
2255
2256
2257                 /*************************
2258                  *  D O N E  W I T H  O P
2259                  *************************/
2260
2261                 DBG((si->dbg, LEVEL_4, "\t   %d values live at %+F\n", pset_count(live), irn));
2262
2263                 pset_foreach(live, tmp) {
2264                         assert(has_reg_class(si, tmp));
2265                 }
2266
2267                 for (n=get_irn_arity(irn)-1; n>=0; --n) {
2268                         ir_node        *arg = get_irn_n(irn, n);
2269
2270                         assert(!find_post_remat(arg, irn) && "there should be no post remat for an argument of an op");
2271                 }
2272
2273                 del_pset(remat_defs);
2274                 del_pset(used);
2275                 del_set(args);
2276                 del_pset(defs);
2277                 defs = pset_new_ptr_default();
2278         }
2279
2280
2281
2282         /***************************************
2283          *   B E G I N N I N G  O F  B L O C K
2284          ***************************************/
2285
2286
2287         /* we are now at the beginning of the basic block, there are only \Phis in front of us */
2288         DBG((si->dbg, LEVEL_3, "\t   %d values live at beginning of block %+F\n", pset_count(live), bb));
2289
2290         pset_foreach(live, irn) {
2291                 assert(is_Phi(irn) || get_nodes_block(irn) != bb);
2292         }
2293
2294         /* construct mem_outs for all values */
2295
2296         set_foreach(spill_bb->ilp, spill) {
2297                 ir_snprintf(buf, sizeof(buf), "mem_out_%N_%N", spill->irn, bb);
2298                 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2299
2300                 lpp_set_factor_fast(si->lpp, cst, spill->mem_out, 1.0);
2301                 lpp_set_factor_fast(si->lpp, cst, spill->spill, -1.0);
2302
2303                 if(pset_find_ptr(live, spill->irn)) {
2304                         int default_spilled;
2305                         DBG((si->dbg, LEVEL_5, "\t     %+F live at beginning of block %+F\n", spill->irn, bb));
2306
2307                         ir_snprintf(buf, sizeof(buf), "mem_in_%N_%N", spill->irn, bb);
2308                         default_spilled = be_is_live_in(si->lv, bb, spill->irn) || is_Phi(spill->irn);
2309                         spill->mem_in   = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, default_spilled);
2310                         lpp_set_factor_fast(si->lpp, cst, spill->mem_in, -1.0);
2311
2312                         if(opt_memcopies && is_Phi(spill->irn) && get_nodes_block(spill->irn) == bb) {
2313                                 int   n;
2314                                 op_t *op = get_irn_link(spill->irn);
2315
2316                                 /* do we have to copy a phi argument? */
2317                                 op->attr.live_range.args.copies = obstack_alloc(si->obst, sizeof(*op->attr.live_range.args.copies) * get_irn_arity(spill->irn));
2318                                 memset(op->attr.live_range.args.copies, 0xFF, sizeof(*op->attr.live_range.args.copies) * get_irn_arity(spill->irn));
2319
2320                                 for(n=get_irn_arity(spill->irn)-1; n>=0; --n) {
2321                                         const ir_node  *arg = get_irn_n(spill->irn, n);
2322                                         double          freq=0.0;
2323                                         int             m;
2324                                         ilp_var_t       var;
2325
2326
2327                                         /* argument already done? */
2328                                         if(op->attr.live_range.args.copies[n] != ILP_UNDEF) continue;
2329
2330                                         /* get sum of execution frequencies of blocks with the same phi argument */
2331                                         for(m=n; m>=0; --m) {
2332                                                 const ir_node  *arg2 = get_irn_n(spill->irn, m);
2333
2334                                                 if(arg==arg2) {
2335                                                         freq += execution_frequency(si, get_Block_cfgpred_block(bb, m));
2336                                                 }
2337                                         }
2338
2339                                         /* copies are not for free */
2340                                         ir_snprintf(buf, sizeof(buf), "copy_%N_%N", arg, spill->irn);
2341                                         var = lpp_add_var_default(si->lpp, buf, lpp_binary, opt_cost_spill * freq, 1.0);
2342
2343                                         for(m=n; m>=0; --m) {
2344                                                 const ir_node  *arg2 = get_irn_n(spill->irn, m);
2345
2346                                                 if(arg==arg2) {
2347                                                         op->attr.live_range.args.copies[m] = var;
2348                                                 }
2349                                         }
2350
2351 #if 0
2352                                         /* copy <= mem_in */
2353                                         ir_snprintf(buf, sizeof(buf), "nocopy_%N_%N", arg, spill->irn);
2354                                         cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2355                                         lpp_set_factor_fast(si->lpp, cst, var, 1.0);
2356                                         lpp_set_factor_fast(si->lpp, cst, spill->mem_in, -1.0);
2357 #endif
2358                                 }
2359                         }
2360                 }
2361         }
2362
2363
2364         /* L\U is empty at bb start */
2365         /* arg is live throughout epilog if it is reg_in into this block */
2366
2367         /* check the register pressure at the beginning of the block
2368          * including remats
2369          */
2370         ir_snprintf(buf, sizeof(buf), "check_start_%N", bb);
2371         cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, si->n_regs);
2372
2373         pset_foreach(live, irn) {
2374         ilp_cst_t  nospill;
2375
2376                 spill = set_find_spill(spill_bb->ilp, irn);
2377                 assert(spill);
2378
2379                 ir_snprintf(buf, sizeof(buf), "reg_in_%N_%N", irn, bb);
2380                 spill->reg_in = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 0.0);
2381
2382                 lpp_set_factor_fast(si->lpp, cst, spill->reg_in, 1.0);
2383
2384                 /* spill + mem_in <= 1 */
2385                 ir_snprintf(buf, sizeof(buf), "nospill_%N_%N", irn, bb);
2386                 nospill = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 1);
2387
2388                 lpp_set_factor_fast(si->lpp, nospill, spill->mem_in, 1.0);
2389                 lpp_set_factor_fast(si->lpp, nospill, spill->spill, 1.0);
2390
2391         }
2392         foreach_post_remat(bb, irn) {
2393                 op_t     *remat_op = get_irn_link(irn);
2394
2395                 DBG((si->dbg, LEVEL_4, "\t  next post remat: %+F\n", irn));
2396                 assert(remat_op->is_remat && !remat_op->attr.remat.pre);
2397
2398                 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
2399         }
2400
2401         /* forall post remats add requirements */
2402         foreach_post_remat(bb, tmp) {
2403                 int         n;
2404
2405                 for (n=get_irn_arity(tmp)-1; n>=0; --n) {
2406                         ir_node    *remat_arg = get_irn_n(tmp, n);
2407                         op_t       *remat_op = get_irn_link(tmp);
2408
2409                         if(!has_reg_class(si, remat_arg)) continue;
2410
2411                         spill = set_find_spill(spill_bb->ilp, remat_arg);
2412                         assert(spill);
2413
2414                         /* remat <= reg_in_argument */
2415                         ir_snprintf(buf, sizeof(buf), "req_remat2_%N_%N_arg_%N", tmp, bb, remat_arg);
2416                         cst = lpp_add_cst(si->lpp, buf, lpp_less, 0.0);
2417                         lpp_set_factor_fast(si->lpp, cst, spill->reg_in, -1.0);
2418                         lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, 1.0);
2419                 }
2420         }
2421
2422         /* mem_in/reg_in for live_in values, especially phis and their arguments */
2423         pset_foreach(live, irn) {
2424                 int          p = 0,
2425                                          n;
2426
2427                 spill = set_find_spill(spill_bb->ilp, irn);
2428                 assert(spill && spill->irn == irn);
2429
2430                 if(is_Phi(irn) && get_nodes_block(irn) == bb) {
2431                         for (n=get_Phi_n_preds(irn)-1; n>=0; --n) {
2432                                 ilp_cst_t       mem_in,
2433                                                                 reg_in;
2434                                 ir_node        *phi_arg = get_Phi_pred(irn, n);
2435                                 ir_node        *bb_p = get_Block_cfgpred_block(bb, n);
2436                                 spill_bb_t     *spill_bb_p = get_irn_link(bb_p);
2437                                 spill_t        *spill_p;
2438                                 op_t           *op = get_irn_link(irn);
2439
2440                                 /* although the phi is in the right regclass one or more of
2441                                  * its arguments can be in a different one or at least to
2442                                  * ignore
2443                                  */
2444                                 if(has_reg_class(si, phi_arg)) {
2445                                         /* mem_in < mem_out_arg + copy */
2446                                         ir_snprintf(buf, sizeof(buf), "mem_in_%N_%N-%d", irn, bb, p);
2447                                         mem_in = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2448
2449                                         /* reg_in < reg_out_arg */
2450                                         ir_snprintf(buf, sizeof(buf), "reg_in_%N_%N-%d", irn, bb, p++);
2451                                         reg_in = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2452
2453                                         lpp_set_factor_fast(si->lpp, mem_in, spill->mem_in, 1.0);
2454                                         lpp_set_factor_fast(si->lpp, reg_in, spill->reg_in, 1.0);
2455
2456                                         spill_p = set_find_spill(spill_bb_p->ilp, phi_arg);
2457                                         assert(spill_p);
2458
2459                                         lpp_set_factor_fast(si->lpp, mem_in, spill_p->mem_out, -1.0);
2460                                         if(opt_memcopies)
2461                                                 lpp_set_factor_fast(si->lpp, mem_in, op->attr.live_range.args.copies[n], -1.0);
2462
2463                                         lpp_set_factor_fast(si->lpp, reg_in, spill_p->reg_out, -1.0);
2464                                 }
2465                         }
2466                 } else {
2467                         /* else assure the value arrives on all paths in the same resource */
2468
2469                         for (n=get_Block_n_cfgpreds(bb)-1; n>=0; --n) {
2470                                 ilp_cst_t       mem_in,
2471                                                                 reg_in;
2472                                 ir_node        *bb_p = get_Block_cfgpred_block(bb, n);
2473                                 spill_bb_t     *spill_bb_p = get_irn_link(bb_p);
2474                                 spill_t        *spill_p;
2475
2476                                 ir_snprintf(buf, sizeof(buf), "mem_in_%N_%N-%d", irn, bb, p);
2477                                 mem_in = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2478                                 ir_snprintf(buf, sizeof(buf), "reg_in_%N_%N-%d", irn, bb, p++);
2479                                 reg_in = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2480
2481                                 lpp_set_factor_fast(si->lpp, mem_in, spill->mem_in, 1.0);
2482                                 lpp_set_factor_fast(si->lpp, reg_in, spill->reg_in, 1.0);
2483
2484                                 spill_p = set_find_spill(spill_bb_p->ilp, irn);
2485                                 assert(spill_p);
2486
2487                                 lpp_set_factor_fast(si->lpp, mem_in, spill_p->mem_out, -1.0);
2488                                 lpp_set_factor_fast(si->lpp, reg_in, spill_p->reg_out, -1.0);
2489                         }
2490                 }
2491         }
2492
2493         /* first live ranges from reg_ins */
2494         pset_foreach(live, irn) {
2495                 op_t      *op = get_irn_link(irn);
2496
2497                 spill = set_find_spill(spill_bb->ilp, irn);
2498                 assert(spill && spill->irn == irn);
2499
2500                 ir_snprintf(buf, sizeof(buf), "first_lr_%N_%N", irn, bb);
2501                 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2502                 lpp_set_factor_fast(si->lpp, cst, op->attr.live_range.ilp, 1.0);
2503                 lpp_set_factor_fast(si->lpp, cst, spill->reg_in, -1.0);
2504
2505                 foreach_post_remat(bb, tmp) {
2506                         op_t     *remat_op = get_irn_link(tmp);
2507
2508                         if(remat_op->attr.remat.remat->value == irn) {
2509                                 lpp_set_factor_fast(si->lpp, cst, remat_op->attr.remat.ilp, -1.0);
2510                         }
2511                 }
2512         }
2513
2514         /* walk forward now and compute constraints for placing spills */
2515         /* this must only be done for values that are not defined in this block */
2516         /* TODO are these values at start of block? if yes, just check whether this is a diverge edge and skip the loop */
2517         pset_foreach(live, irn) {
2518                 /*
2519                  * if value is defined in this block we can anways place the spill directly after the def
2520                  *    -> no constraint necessary
2521                  */
2522                 if(!is_Phi(irn) && get_nodes_block(irn) == bb) continue;
2523
2524
2525                 spill = set_find_spill(spill_bb->ilp, irn);
2526                 assert(spill);
2527
2528                 ir_snprintf(buf, sizeof(buf), "req_spill_%N_%N", irn, bb);
2529                 cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0.0);
2530
2531                 lpp_set_factor_fast(si->lpp, cst, spill->spill, 1.0);
2532                 if(is_diverge_edge(bb)) lpp_set_factor_fast(si->lpp, cst, spill->reg_in, -1.0);
2533
2534                 if(!is_Phi(irn)) {
2535                         sched_foreach_op(bb, tmp) {
2536                                 op_t   *op = get_irn_link(tmp);
2537
2538                                 if(is_Phi(tmp)) continue;
2539                                 assert(!is_Proj(tmp));
2540
2541                                 if(op->is_remat) {
2542                                         const ir_node   *value = op->attr.remat.remat->value;
2543
2544                                         if(value == irn) {
2545                                                 /* only collect remats up to the first real use of a value */
2546                                                 lpp_set_factor_fast(si->lpp, cst, op->attr.remat.ilp, -1.0);
2547                                         }
2548                                 } else {
2549                                         int   n;
2550
2551                                         for (n=get_irn_arity(tmp)-1; n>=0; --n) {
2552                                                 ir_node    *arg = get_irn_n(tmp, n);
2553
2554                                                 if(arg == irn) {
2555                                                         /* if a value is used stop collecting remats */
2556                             goto next_live;
2557                                                 }
2558                                         }
2559                                 }
2560                         }
2561                 }
2562 next_live: ;
2563         }
2564
2565         del_pset(live);
2566 }
2567
2568 typedef struct _irnlist_t {
2569         struct list_head   list;
2570         ir_node           *irn;
2571 } irnlist_t;
2572
2573 typedef struct _interference_t {
2574         struct list_head    blocklist;
2575         ir_node            *a;
2576         ir_node            *b;
2577 } interference_t;
2578
2579 static int
2580 cmp_interference(const void *a, const void *b, size_t size)
2581 {
2582         const interference_t *p = a;
2583         const interference_t *q = b;
2584
2585         return !(p->a == q->a && p->b == q->b);
2586 }
2587
2588 static interference_t *
2589 set_find_interference(set * set, ir_node * a, ir_node * b)
2590 {
2591         interference_t     query;
2592
2593         query.a = (a>b)?a:b;
2594         query.b = (a>b)?b:a;
2595
2596         return set_find(set, &query, sizeof(query), HASH_PTR(PTR_TO_INT(a) ^ PTR_TO_INT(b)));
2597 }
2598
2599 static interference_t *
2600 set_insert_interference(spill_ilp_t * si, set * set, ir_node * a, ir_node * b, ir_node * bb)
2601 {
2602         interference_t     query,
2603                                           *result;
2604         irnlist_t         *list = obstack_alloc(si->obst, sizeof(*list));
2605
2606         list->irn = bb;
2607
2608         result = set_find_interference(set, a, b);
2609         if(result) {
2610
2611                 list_add(&list->list, &result->blocklist);
2612                 return result;
2613         }
2614
2615         query.a = (a>b)?a:b;
2616         query.b = (a>b)?b:a;
2617
2618         result = set_insert(set, &query, sizeof(query), HASH_PTR(PTR_TO_INT(a) ^ PTR_TO_INT(b)));
2619
2620         INIT_LIST_HEAD(&result->blocklist);
2621         list_add(&list->list, &result->blocklist);
2622
2623         return result;
2624 }
2625
2626 static int
2627 values_interfere_in_block(const spill_ilp_t * si, const ir_node * bb, const ir_node * a, const ir_node * b)
2628 {
2629         const ir_edge_t *edge;
2630
2631         if(get_nodes_block(a) != bb && get_nodes_block(b) != bb) {
2632                 /* both values are live in, so they interfere */
2633                 return 1;
2634         }
2635
2636         /* ensure a dominates b */
2637         if(value_dominates(b,a)) {
2638                 const ir_node * t;
2639                 t = b;
2640                 b = a;
2641                 a = t;
2642         }
2643         assert(get_nodes_block(b) == bb && "at least b should be defined here in this block");
2644
2645
2646         /* the following code is stolen from bera.c */
2647         if(be_is_live_end(si->lv, bb, a))
2648                 return 1;
2649
2650         foreach_out_edge(a, edge) {
2651                 const ir_node *user = edge->src;
2652                 if(get_nodes_block(user) == bb
2653                                 && !is_Phi(user)
2654                                 && b != user
2655                                 && !pset_find_ptr(si->inverse_ops, user)
2656                                 && value_dominates(b, user))
2657                         return 1;
2658         }
2659
2660         return 0;
2661 }
2662
2663 /**
2664  * Walk all irg blocks and collect interfering values inside of phi classes
2665  */
2666 static void
2667 luke_interferencewalker(ir_node * bb, void * data)
2668 {
2669         spill_ilp_t    *si = (spill_ilp_t*)data;
2670         int             l1, l2;
2671
2672         be_lv_foreach(si->lv, bb, be_lv_state_end | be_lv_state_out | be_lv_state_in, l1) {
2673                 ir_node        *a = be_lv_get_irn(si->lv, bb, l1);
2674                 op_t           *a_op = get_irn_link(a);
2675
2676
2677                 /* a is only interesting if it is in my register class and if it is inside a phi class */
2678                 if (has_reg_class(si, a) && get_phi_class(a)) {
2679                         if(a_op->is_remat || pset_find_ptr(si->inverse_ops, a))
2680                                 continue;
2681
2682                         for(l2=_be_lv_next_irn(si->lv, bb, 0xff, l1+1); l2>=0; l2=_be_lv_next_irn(si->lv, bb, 0xff, l2+1)) {
2683                                 ir_node        *b = be_lv_get_irn(si->lv, bb, l2);
2684                                 op_t           *b_op = get_irn_link(b);
2685
2686
2687                                 /* a and b are only interesting if they are in the same phi class */
2688                                 if(has_reg_class(si, b) && get_phi_class(a) == get_phi_class(b)) {
2689                                         if(b_op->is_remat || pset_find_ptr(si->inverse_ops, b))
2690                                                 continue;
2691
2692                                         if(values_interfere_in_block(si, bb, a, b)) {
2693                                                 DBG((si->dbg, LEVEL_4, "\tvalues interfere in %+F: %+F, %+F\n", bb, a, b));
2694                                                 set_insert_interference(si, si->interferences, a, b, bb);
2695                                         }
2696                                 }
2697                         }
2698                 }
2699         }
2700 }
2701
2702 static unsigned int copy_path_id = 0;
2703
2704 static void
2705 write_copy_path_cst(spill_ilp_t *si, pset * copies, ilp_var_t any_interfere)
2706 {
2707         ilp_cst_t  cst;
2708         ilp_var_t  copy;
2709         char       buf[256];
2710         void      *ptr;
2711
2712         ir_snprintf(buf, sizeof(buf), "copy_path-%d", copy_path_id++);
2713         cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0);
2714
2715         lpp_set_factor_fast(si->lpp, cst, any_interfere, 1.0);
2716
2717         pset_foreach(copies, ptr) {
2718                 copy = PTR_TO_INT(ptr);
2719                 lpp_set_factor_fast(si->lpp, cst, copy, -1.0);
2720         }
2721 }
2722
2723 /**
2724  * @parameter copies   contains a path of copies which lead us to irn
2725  * @parameter visited  contains a set of nodes already visited on this path
2726  */
2727 static int
2728 find_copy_path(spill_ilp_t * si, const ir_node * irn, const ir_node * target, ilp_var_t any_interfere, pset * copies, pset * visited)
2729 {
2730         const ir_edge_t *edge;
2731         op_t            *op = get_irn_link(irn);
2732     pset            *visited_users = pset_new_ptr_default();
2733         int              paths = 0;
2734
2735         if(op->is_remat) return 0;
2736
2737         pset_insert_ptr(visited, irn);
2738
2739         if(is_Phi(irn)) {
2740                 int    n;
2741         pset  *visited_operands = pset_new_ptr(get_irn_arity(irn));
2742
2743                 /* visit all operands */
2744                 for(n=get_irn_arity(irn)-1; n>=0; --n) {
2745                         ir_node  *arg = get_irn_n(irn, n);
2746                         ilp_var_t  copy = op->attr.live_range.args.copies[n];
2747
2748                         if(!has_reg_class(si, arg)) continue;
2749             if(pset_find_ptr(visited_operands, arg)) continue;
2750             pset_insert_ptr(visited_operands, arg);
2751
2752                         if(arg == target) {
2753                                 if(++paths > MAX_PATHS && pset_count(copies) != 0) {
2754                                         del_pset(visited_operands);
2755                                         del_pset(visited_users);
2756                                         pset_remove_ptr(visited, irn);
2757                                         return paths;
2758                                 }
2759                                 pset_insert(copies, INT_TO_PTR(copy), copy);
2760                                 write_copy_path_cst(si, copies, any_interfere);
2761                                 pset_remove(copies, INT_TO_PTR(copy), copy);
2762                         } else if(!pset_find_ptr(visited, arg)) {
2763                                 pset_insert(copies, INT_TO_PTR(copy), copy);
2764                                 paths += find_copy_path(si, arg, target, any_interfere, copies, visited);
2765                                 pset_remove(copies, INT_TO_PTR(copy), copy);
2766
2767                 if(paths > MAX_PATHS) {
2768                     if(pset_count(copies) == 0) {
2769                         ilp_cst_t  cst;
2770                         char       buf[256];
2771
2772                         ir_snprintf(buf, sizeof(buf), "always_copy-%d-%d", any_interfere, copy);
2773                         cst = lpp_add_cst_uniq(si->lpp, buf, lpp_equal, 0);
2774                         lpp_set_factor_fast(si->lpp, cst, any_interfere, -1.0);
2775                         lpp_set_factor_fast(si->lpp, cst, copy, 1.0);
2776                         DBG((si->dbg, LEVEL_1, "ALWAYS COPYING %d FOR INTERFERENCE %d\n", copy, any_interfere));
2777
2778                         paths = 0;
2779                     } else {
2780                         del_pset(visited_operands);
2781                         del_pset(visited_users);
2782                         pset_remove_ptr(visited, irn);
2783                         return paths;
2784                     }
2785                 } else if(pset_count(copies) == 0) {
2786                                         paths = 0;
2787                                 }
2788                         }
2789                 }
2790
2791         del_pset(visited_operands);
2792         }
2793
2794         /* visit all uses which are phis */
2795         foreach_out_edge(irn, edge) {
2796                 ir_node  *user = edge->src;
2797                 int       pos  = edge->pos;
2798                 op_t     *op = get_irn_link(user);
2799                 ilp_var_t copy;
2800
2801                 if(!is_Phi(user)) continue;
2802                 if(!has_reg_class(si, user)) continue;
2803         if(pset_find_ptr(visited_users, user)) continue;
2804         pset_insert_ptr(visited_users, user);
2805
2806                 copy = op->attr.live_range.args.copies[pos];
2807
2808                 if(user == target) {
2809                         if(++paths > MAX_PATHS && pset_count(copies) != 0) {
2810                                 del_pset(visited_users);
2811                                 pset_remove_ptr(visited, irn);
2812                                 return paths;
2813                         }
2814                         pset_insert(copies, INT_TO_PTR(copy), copy);
2815                         write_copy_path_cst(si, copies, any_interfere);
2816                         pset_remove(copies, INT_TO_PTR(copy), copy);
2817                 } else if(!pset_find_ptr(visited, user)) {
2818                         pset_insert(copies, INT_TO_PTR(copy), copy);
2819                         paths += find_copy_path(si, user, target, any_interfere, copies, visited);
2820                         pset_remove(copies, INT_TO_PTR(copy), copy);
2821
2822             if(paths > MAX_PATHS) {
2823                 if(pset_count(copies) == 0) {
2824                     ilp_cst_t  cst;
2825                     char       buf[256];
2826
2827                     ir_snprintf(buf, sizeof(buf), "always_copy-%d-%d", any_interfere, copy);
2828                     cst = lpp_add_cst_uniq(si->lpp, buf, lpp_equal, 0);
2829                     lpp_set_factor_fast(si->lpp, cst, any_interfere, -1.0);
2830                     lpp_set_factor_fast(si->lpp, cst, copy, 1.0);
2831                     DBG((si->dbg, LEVEL_1, "ALWAYS COPYING %d FOR INTERFERENCE %d\n", copy, any_interfere));
2832
2833                     paths = 0;
2834                 } else {
2835                     del_pset(visited_users);
2836                     pset_remove_ptr(visited, irn);
2837                     return paths;
2838                 }
2839             } else if(pset_count(copies) == 0) {
2840                                 paths = 0;
2841                         }
2842                 }
2843         }
2844
2845     del_pset(visited_users);
2846         pset_remove_ptr(visited, irn);
2847         return paths;
2848 }
2849
2850 static void
2851 gen_copy_constraints(spill_ilp_t * si, const ir_node * a, const ir_node * b, ilp_var_t any_interfere)
2852 {
2853         pset * copies = pset_new_ptr_default();
2854         pset * visited = pset_new_ptr_default();
2855
2856         find_copy_path(si, a, b, any_interfere, copies, visited);
2857
2858         del_pset(visited);
2859         del_pset(copies);
2860 }
2861
2862
2863 static void
2864 memcopyhandler(spill_ilp_t * si)
2865 {
2866         interference_t   *interference;
2867         char              buf[256];
2868         /* teste Speicherwerte auf Interferenz */
2869
2870         /* analyze phi classes */
2871         phi_class_compute(si->chordal_env->irg);
2872
2873         DBG((si->dbg, LEVEL_2, "\t calling interferencewalker\n"));
2874         irg_block_walk_graph(si->chordal_env->irg, luke_interferencewalker, NULL, si);
2875
2876         /* now lets emit the ILP unequations for the crap */
2877         set_foreach(si->interferences, interference) {
2878                 irnlist_t      *irnlist;
2879                 ilp_var_t       interfere,
2880                                                 any_interfere;
2881                 ilp_cst_t       any_interfere_cst,
2882                                                 cst;
2883                 const ir_node  *a  = interference->a;
2884                 const ir_node  *b  = interference->b;
2885
2886                 /* any_interf <= \sum interf */
2887                 ir_snprintf(buf, sizeof(buf), "interfere_%N_%N", a, b);
2888                 any_interfere_cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0);
2889                 any_interfere = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
2890
2891                 lpp_set_factor_fast(si->lpp, any_interfere_cst, any_interfere, 1.0);
2892
2893                 list_for_each_entry(irnlist_t, irnlist, &interference->blocklist, list) {
2894                         const ir_node  *bb = irnlist->irn;
2895                         spill_bb_t     *spill_bb = get_irn_link(bb);
2896                         spill_t        *spilla,
2897                                                    *spillb;
2898                         char           buf[256];
2899
2900                         spilla = set_find_spill(spill_bb->ilp, a);
2901                         assert(spilla);
2902
2903                         spillb = set_find_spill(spill_bb->ilp, b);
2904                         assert(spillb);
2905
2906                         /* interfere <-> (mem_in_a or spill_a) and (mem_in_b or spill_b): */
2907                         /* 1:   mem_in_a + mem_in_b + spill_a + spill_b - interfere <= 1 */
2908                         /* 2: - mem_in_a - spill_a + interfere <= 0 */
2909                         /* 3: - mem_in_b - spill_b + interfere <= 0 */
2910                         ir_snprintf(buf, sizeof(buf), "interfere_%N_%N_%N", bb, a, b);
2911                         interfere = lpp_add_var_default(si->lpp, buf, lpp_binary, 0.0, 1.0);
2912
2913                         ir_snprintf(buf, sizeof(buf), "interfere_%N_%N_%N-1", bb, a, b);
2914                         cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 1);
2915
2916                         lpp_set_factor_fast(si->lpp, cst, interfere, -1.0);
2917                         if(spilla->mem_in != ILP_UNDEF) lpp_set_factor_fast(si->lpp, cst, spilla->mem_in, 1.0);
2918                         lpp_set_factor_fast(si->lpp, cst, spilla->spill, 1.0);
2919                         if(spillb->mem_in != ILP_UNDEF) lpp_set_factor_fast(si->lpp, cst, spillb->mem_in, 1.0);
2920                         lpp_set_factor_fast(si->lpp, cst, spillb->spill, 1.0);
2921
2922                         ir_snprintf(buf, sizeof(buf), "interfere_%N_%N_%N-2", bb, a, b);
2923                         cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0);
2924
2925                         lpp_set_factor_fast(si->lpp, cst, interfere, 1.0);
2926                         if(spilla->mem_in != ILP_UNDEF) lpp_set_factor_fast(si->lpp, cst, spilla->mem_in, -1.0);
2927                         lpp_set_factor_fast(si->lpp, cst, spilla->spill, -1.0);
2928
2929                         ir_snprintf(buf, sizeof(buf), "interfere_%N_%N_%N-3", bb, a, b);
2930                         cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0);
2931
2932                         lpp_set_factor_fast(si->lpp, cst, interfere, 1.0);
2933                         if(spillb->mem_in != ILP_UNDEF) lpp_set_factor_fast(si->lpp, cst, spillb->mem_in, -1.0);
2934                         lpp_set_factor_fast(si->lpp, cst, spillb->spill, -1.0);
2935
2936
2937                         lpp_set_factor_fast(si->lpp, any_interfere_cst, interfere, -1.0);
2938
2939                         /* any_interfere >= interf */
2940                         ir_snprintf(buf, sizeof(buf), "interfere_%N_%N-%N", a, b, bb);
2941                         cst = lpp_add_cst_uniq(si->lpp, buf, lpp_less, 0);
2942
2943                         lpp_set_factor_fast(si->lpp, cst, interfere, 1.0);
2944                         lpp_set_factor_fast(si->lpp, cst, any_interfere, -1.0);
2945                 }
2946
2947                 /* now that we know whether the two values interfere in memory we can drop constraints to enforce copies */
2948                 gen_copy_constraints(si,a,b,any_interfere);
2949         }
2950 }
2951
2952
2953 static INLINE int
2954 is_zero(double x)
2955 {
2956         return fabs(x) < 0.00001;
2957 }
2958
2959 static int mark_remat_nodes_hook(FILE *F, ir_node *n, ir_node *l)
2960 {
2961         spill_ilp_t *si = get_irg_link(current_ir_graph);
2962
2963         if(pset_find_ptr(si->all_possible_remats, n)) {
2964                 op_t   *op = (op_t*)get_irn_link(n);
2965                 assert(op && op->is_remat);
2966
2967                 if(!op->attr.remat.remat->inverse) {
2968                         if(op->attr.remat.pre) {
2969                                 ir_fprintf(F, "color:red info3:\"remat value: %+F\"", op->attr.remat.remat->value);
2970                         } else {
2971                                 ir_fprintf(F, "color:orange info3:\"remat2 value: %+F\"", op->attr.remat.remat->value);
2972                         }
2973
2974                         return 1;
2975                 } else {
2976                         op_t   *op = (op_t*)get_irn_link(n);
2977                         assert(op && op->is_remat);
2978
2979                         if(op->attr.remat.pre) {
2980                                 ir_fprintf(F, "color:cyan info3:\"remat inverse value: %+F\"", op->attr.remat.remat->value);
2981                         } else {
2982                                 ir_fprintf(F, "color:lightcyan info3:\"remat2 inverse value: %+F\"", op->attr.remat.remat->value);
2983                         }
2984
2985                         return 1;
2986                 }
2987         }
2988
2989         return 0;
2990 }
2991
2992 static void
2993 dump_graph_with_remats(ir_graph * irg, const char * suffix)
2994 {
2995         set_dump_node_vcgattr_hook(mark_remat_nodes_hook);
2996         be_dump(irg, suffix, dump_ir_block_graph_sched);
2997         set_dump_node_vcgattr_hook(NULL);
2998 }
2999
3000 /**
3001  * Edge hook to dump the schedule edges with annotated register pressure.
3002  */
3003 static int
3004 sched_pressure_edge_hook(FILE *F, ir_node *irn)
3005 {
3006         if(sched_is_scheduled(irn) && sched_has_prev(irn)) {
3007                 ir_node *prev = sched_prev(irn);
3008                 fprintf(F, "edge:{sourcename:\"");
3009                 PRINT_NODEID(irn);
3010                 fprintf(F, "\" targetname:\"");
3011                 PRINT_NODEID(prev);
3012                 fprintf(F, "\" label:\"%d", (int)get_irn_link(irn));
3013                 fprintf(F, "\" color:magenta}\n");
3014         }
3015         return 1;
3016 }
3017
3018 static void
3019 dump_ir_block_graph_sched_pressure(ir_graph *irg, const char *suffix)
3020 {
3021         DUMP_NODE_EDGE_FUNC old_edge_hook = get_dump_node_edge_hook();
3022
3023         dump_consts_local(0);
3024         set_dump_node_edge_hook(sched_pressure_edge_hook);
3025         dump_ir_block_graph(irg, suffix);
3026         set_dump_node_edge_hook(old_edge_hook);
3027 }
3028
3029 static void
3030 walker_pressure_annotator(ir_node * bb, void * data)
3031 {
3032         spill_ilp_t  *si = data;
3033         ir_node      *irn;
3034         int           n, i;
3035         pset         *live = pset_new_ptr_default();
3036         int           projs = 0;
3037
3038         be_lv_foreach(si->lv, bb, be_lv_state_end, i) {
3039                 irn = be_lv_get_irn(si->lv, bb, i);
3040
3041                 if (has_reg_class(si, irn)) {
3042                         pset_insert_ptr(live, irn);
3043                 }
3044         }
3045
3046         set_irn_link(bb, INT_TO_PTR(pset_count(live)));
3047
3048         sched_foreach_reverse(bb, irn) {
3049                 if(is_Phi(irn)) {
3050                         set_irn_link(irn, INT_TO_PTR(pset_count(live)));
3051                         continue;
3052                 }
3053
3054                 if(has_reg_class(si, irn)) {
3055                         pset_remove_ptr(live, irn);
3056                         if(is_Proj(irn)) ++projs;
3057                 }
3058
3059                 if(!is_Proj(irn)) projs = 0;
3060
3061                 for (n=get_irn_arity(irn)-1; n>=0; --n) {
3062                         ir_node    *arg = get_irn_n(irn, n);
3063
3064                         if(has_reg_class(si, arg)) pset_insert_ptr(live, arg);
3065                 }
3066                 set_irn_link(irn, INT_TO_PTR(pset_count(live)+projs));
3067         }
3068
3069         del_pset(live);
3070 }
3071
3072 static void
3073 dump_pressure_graph(spill_ilp_t * si, const char *suffix)
3074 {
3075         be_dump(si->chordal_env->irg, suffix, dump_ir_block_graph_sched_pressure);
3076 }
3077
3078 static void
3079 connect_all_remats_with_keep(spill_ilp_t * si)
3080 {
3081         ir_node   *irn;
3082         ir_node  **ins,
3083                          **pos;
3084         int        n_remats;
3085
3086
3087         n_remats = pset_count(si->all_possible_remats);
3088         if(n_remats) {
3089                 ins = obstack_alloc(si->obst, n_remats * sizeof(*ins));
3090
3091                 pos = ins;
3092                 pset_foreach(si->all_possible_remats, irn) {
3093                         *pos = irn;
3094                         ++pos;
3095                 }
3096
3097                 si->keep = be_new_Keep(si->chordal_env->cls, si->chordal_env->irg, get_irg_end_block(si->chordal_env->irg), n_remats, ins);
3098
3099                 obstack_free(si->obst, ins);
3100         }
3101 }
3102
3103 static void
3104 connect_all_spills_with_keep(spill_ilp_t * si)
3105 {
3106         ir_node   *irn;
3107         ir_node  **ins,
3108                          **pos;
3109         int        n_spills;
3110         ir_node   *keep;
3111
3112
3113         n_spills = pset_count(si->spills);
3114         if(n_spills) {
3115                 ins = obstack_alloc(si->obst, n_spills * sizeof(*ins));
3116
3117                 pos = ins;
3118                 pset_foreach(si->spills, irn) {
3119                         *pos = irn;
3120                         ++pos;
3121                 }
3122
3123                 keep = be_new_Keep(si->chordal_env->cls, si->chordal_env->irg, get_irg_end_block(si->chordal_env->irg), n_spills, ins);
3124
3125                 obstack_free(si->obst, ins);
3126         }
3127 }
3128
3129 /** insert a spill at an arbitrary position */
3130 ir_node *be_spill2(const arch_env_t *arch_env, ir_node *irn, ir_node *insert)
3131 {
3132         ir_node *bl     = is_Block(insert)?insert:get_nodes_block(insert);
3133         ir_graph *irg   = get_irn_irg(bl);
3134         ir_node *frame  = get_irg_frame(irg);
3135         ir_node *spill;
3136         ir_node *next;
3137
3138         const arch_register_class_t *cls       = arch_get_irn_reg_class(arch_env, irn, -1);
3139         const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
3140
3141         spill = be_new_Spill(cls, cls_frame, irg, bl, frame, irn);
3142
3143         /*
3144          * search the right insertion point. a spill of a phi cannot be put
3145          * directly after the phi, if there are some phis behind the one which
3146          * is spilled. Also, a spill of a Proj must be after all Projs of the
3147          * same tuple node.
3148          *
3149          * Here's one special case:
3150          * If the spill is in the start block, the spill must be after the frame
3151          * pointer is set up. This is done by setting insert to the end of the block
3152          * which is its default initialization (see above).
3153          */
3154
3155         if(bl == get_irg_start_block(irg) && sched_get_time_step(frame) >= sched_get_time_step(insert))
3156                 insert = frame;
3157
3158         for (next = sched_next(insert); is_Phi(next) || is_Proj(next); next = sched_next(insert))
3159                 insert = next;
3160
3161         sched_add_after(insert, spill);
3162         return spill;
3163 }
3164
3165 static void
3166 delete_remat(spill_ilp_t * si, ir_node * remat) {
3167         int       n;
3168         ir_node  *bad = get_irg_bad(si->chordal_env->irg);
3169
3170         sched_remove(remat);
3171
3172         /* kill links to operands */
3173         for (n=get_irn_arity(remat)-1; n>=-1; --n) {
3174                 set_irn_n(remat, n, bad);
3175         }
3176 }
3177
3178 static void
3179 clean_remat_info(spill_ilp_t * si)
3180 {
3181         int            n;
3182         remat_t       *remat;
3183         remat_info_t  *remat_info;
3184         ir_node       *bad = get_irg_bad(si->chordal_env->irg);
3185
3186         set_foreach(si->remat_info, remat_info) {
3187                 if(!remat_info->remats) continue;
3188
3189                 pset_foreach(remat_info->remats, remat)
3190                 {
3191                         if(remat->proj && get_irn_n_edges(remat->proj) == 0) {
3192                                 set_irn_n((ir_node*)remat->proj, -1, bad);
3193                                 set_irn_n((ir_node*)remat->proj, 0, bad);
3194                         }
3195
3196                         if(get_irn_n_edges(remat->op) == 0) {
3197                                 for (n=get_irn_arity(remat->op)-1; n>=-1; --n) {
3198                                         set_irn_n((ir_node*)remat->op, n, bad);
3199                                 }
3200                         }
3201                 }
3202
3203                 if(remat_info->remats) del_pset(remat_info->remats);
3204                 if(remat_info->remats_by_operand) del_pset(remat_info->remats_by_operand);
3205         }
3206 }
3207
3208 static void
3209 delete_unnecessary_remats(spill_ilp_t * si)
3210 {
3211         if(opt_keep_alive & KEEPALIVE_REMATS) {
3212                 int       n;
3213                 ir_node  *bad = get_irg_bad(si->chordal_env->irg);
3214
3215                 if(si->keep) {
3216 //                      ir_node   *end = get_irg_end(si->chordal_env->irg);
3217 //                      ir_node  **keeps;
3218
3219                         for (n=get_irn_arity(si->keep)-1; n>=0; --n) {
3220                                 ir_node        *keep_arg = get_irn_n(si->keep, n);
3221                                 op_t           *arg_op = get_irn_link(keep_arg);
3222                                 lpp_name_t     *name;
3223
3224                                 assert(arg_op->is_remat);
3225
3226                                 name = si->lpp->vars[arg_op->attr.remat.ilp];
3227
3228                                 if(is_zero(name->value)) {
3229                                         DBG((si->dbg, LEVEL_3, "\t  deleting remat %+F\n", keep_arg));
3230                                         /* TODO check whether reload is preferred over remat (could be bug) */
3231                                         delete_remat(si, keep_arg);
3232                                 } else {
3233                                         if(!arg_op->attr.remat.remat->inverse) {
3234                                                 if(arg_op->attr.remat.pre) {
3235                                                         DBG((si->dbg, LEVEL_2, "\t**remat kept: %+F\n", keep_arg));
3236                                                 } else {
3237                                                         DBG((si->dbg, LEVEL_2, "\t%%%%remat2 kept: %+F\n", keep_arg));
3238                                                 }
3239                                         } else {
3240                                                 if(arg_op->attr.remat.pre) {
3241                                                         DBG((si->dbg, LEVEL_2, "\t**INVERSE remat kept: %+F\n", keep_arg));
3242                                                 } else {
3243                                                         DBG((si->dbg, LEVEL_2, "\t%%%%INVERSE remat2 kept: %+F\n", keep_arg));
3244                                                 }
3245                                         }
3246                                 }
3247
3248                                 set_irn_n(si->keep, n, bad);
3249                         }
3250 #if 0
3251                         for (i = 0, n = get_End_n_keepalives(end); i < n; ++i) {
3252                                 ir_node        *end_arg = get_End_keepalive(end, i);
3253
3254                                 if(end_arg != si->keep) {
3255                                         obstack_grow(si->obst, &end_arg, sizeof(end_arg));
3256                                 }
3257                         }
3258                         keeps = obstack_finish(si->obst);
3259                         set_End_keepalives(end, n-1, keeps);
3260                         obstack_free(si->obst, keeps);
3261 #endif
3262                 } else {
3263                         DBG((si->dbg, LEVEL_2, "\t  no remats to delete (none have been inserted)\n"));
3264                 }
3265         } else {
3266                 ir_node  *remat;
3267
3268                 pset_foreach(si->all_possible_remats, remat) {
3269                         op_t           *remat_op = get_irn_link(remat);
3270                         lpp_name_t     *name = si->lpp->vars[remat_op->attr.remat.ilp];
3271
3272                         if(is_zero(name->value)) {
3273                                 DBG((si->dbg, LEVEL_3, "\t  deleting remat %+F\n", remat));
3274                                 /* TODO check whether reload is preferred over remat (could be bug) */
3275                                 delete_remat(si, remat);
3276                         } else {
3277                                 if(!remat_op->attr.remat.remat->inverse) {
3278                                         if(remat_op->attr.remat.pre) {
3279                                                 DBG((si->dbg, LEVEL_2, "\t**remat kept: %+F\n", remat));
3280                                         } else {
3281                                                 DBG((si->dbg, LEVEL_2, "\t%%%%remat2 kept: %+F\n", remat));
3282                                         }
3283                                 } else {
3284                                         if(remat_op->attr.remat.pre) {
3285                                                 DBG((si->dbg, LEVEL_2, "\t**INVERSE remat kept: %+F\n", remat));
3286                                         } else {
3287                                                 DBG((si->dbg, LEVEL_2, "\t%%%%INVERSE remat2 kept: %+F\n", remat));
3288                                         }
3289                                 }
3290                         }
3291                 }
3292         }
3293 }
3294
3295 static pset *
3296 get_spills_for_value(spill_ilp_t * si, const ir_node * value)
3297 {
3298         pset     *spills = pset_new_ptr_default();
3299
3300         const ir_node  *next;
3301         defs_t         *defs;
3302
3303         defs = set_find_def(si->values, value);
3304
3305         if(defs && defs->spills) {
3306                 for(next = defs->spills; next; next = get_irn_link(next)) {
3307                         pset_insert_ptr(spills, next);
3308                 }
3309         }
3310
3311         return spills;
3312 }
3313
3314 /**
3315  * @param before   The node after which the spill will be placed in the schedule
3316  */
3317 static ir_node *
3318 insert_spill(spill_ilp_t * si, ir_node * irn, const ir_node * value, ir_node * before)
3319 {
3320         defs_t   *defs;
3321         ir_node  *spill;
3322         const arch_env_t *arch_env = si->chordal_env->birg->main_env->arch_env;
3323
3324         DBG((si->dbg, LEVEL_3, "\t  inserting spill for value %+F after %+F\n", irn, before));
3325
3326         spill = be_spill2(arch_env, irn, before);
3327
3328         defs = set_insert_def(si->values, value);
3329         assert(defs);
3330
3331         /* enter into the linked list */
3332         set_irn_link(spill, defs->spills);
3333         defs->spills = spill;
3334
3335         if(opt_keep_alive & KEEPALIVE_SPILLS)
3336                 pset_insert_ptr(si->spills, spill);
3337
3338         return spill;
3339 }
3340
3341 /**
3342  * @param before   The Phi node which has to be spilled
3343  */
3344 static ir_node *
3345 insert_mem_phi(spill_ilp_t * si, ir_node * phi)
3346 {
3347         ir_node   *mem_phi;
3348         ir_node  **ins;
3349         defs_t    *defs;
3350         int        n;
3351
3352         NEW_ARR_A(ir_node*, ins, get_irn_arity(phi));
3353
3354         for(n=get_irn_arity(phi)-1; n>=0; --n) {
3355                 ins[n] = si->m_unknown;
3356         }
3357
3358         mem_phi =  new_r_Phi(si->chordal_env->irg, get_nodes_block(phi), get_irn_arity(phi), ins, mode_M);
3359
3360         defs = set_insert_def(si->values, phi);
3361         assert(defs);
3362
3363         /* enter into the linked list */
3364         set_irn_link(mem_phi, defs->spills);
3365         defs->spills = mem_phi;
3366
3367 #ifdef SCHEDULE_PHIM
3368         sched_add_after(phi, mem_phi);
3369 #endif
3370
3371         if(opt_keep_alive & KEEPALIVE_SPILLS)
3372                 pset_insert_ptr(si->spills, mem_phi);
3373
3374
3375         return mem_phi;
3376 }
3377
3378 /**
3379  * Add remat to list of defs, destroys link field!
3380  */
3381 static void
3382 insert_remat(spill_ilp_t * si, ir_node * remat)
3383 {
3384         defs_t   *defs;
3385         op_t     *remat_op = get_irn_link(remat);
3386
3387         assert(remat_op->is_remat);
3388
3389         defs = set_insert_def(si->values, remat_op->attr.remat.remat->value);
3390         assert(defs);
3391
3392         /* enter into the linked list */
3393         set_irn_link(remat, defs->remats);
3394         defs->remats = remat;
3395 }
3396
3397
3398 /**
3399  * Add reload before operation and add to list of defs
3400  */
3401 static ir_node *
3402 insert_reload(spill_ilp_t * si, const ir_node * value, ir_node * after)
3403 {
3404         defs_t   *defs;
3405         ir_node  *reload,
3406                          *spill;
3407         const arch_env_t *arch_env = si->chordal_env->birg->main_env->arch_env;
3408
3409         DBG((si->dbg, LEVEL_3, "\t  inserting reload for value %+F before %+F\n", value, after));
3410
3411         defs = set_find_def(si->values, value);
3412
3413         spill = defs->spills;
3414         assert(spill && "no spill placed before reload");
3415
3416         reload = be_reload(arch_env, si->cls, after, get_irn_mode(value), spill);
3417
3418         /* enter into the linked list */
3419         set_irn_link(reload, defs->remats);
3420         defs->remats = reload;
3421
3422         return reload;
3423 }
3424
3425 void perform_memory_operand(spill_ilp_t * si, memoperand_t * memoperand)
3426 {
3427         defs_t           *defs;
3428         ir_node          *reload;
3429         ir_node          *value = get_irn_n(memoperand->irn, memoperand->pos);
3430         ir_node          *spill;
3431         const arch_env_t *arch_env = si->chordal_env->birg->main_env->arch_env;
3432
3433         DBG((si->dbg, LEVEL_2, "\t  inserting memory operand for value %+F at %+F\n", value, memoperand->irn));
3434
3435         defs = set_find_def(si->values, value);
3436
3437         spill = defs->spills;
3438         assert(spill && "no spill placed before reload");
3439
3440         reload = be_reload(arch_env, si->cls, memoperand->irn, get_irn_mode(value), spill);
3441
3442         arch_perform_memory_operand(arch_env, memoperand->irn, reload, memoperand->pos);
3443         sched_remove(reload);
3444 }
3445
3446 void insert_memoperands(spill_ilp_t * si)
3447 {
3448         memoperand_t   *memoperand;
3449         lpp_name_t     *name;
3450
3451         set_foreach(si->memoperands, memoperand) {
3452                 name = si->lpp->vars[memoperand->ilp];
3453                 if(!is_zero(name->value)) {
3454                         perform_memory_operand(si, memoperand);
3455                 }
3456         }
3457 }
3458
3459 static void
3460 walker_spill_placer(ir_node * bb, void * data) {
3461         spill_ilp_t   *si = (spill_ilp_t*)data;
3462         ir_node       *irn;
3463         spill_bb_t    *spill_bb = get_irn_link(bb);
3464         pset          *spills_to_do = pset_new_ptr_default();
3465         spill_t       *spill;
3466
3467         set_foreach(spill_bb->ilp, spill) {
3468                 lpp_name_t    *name;
3469
3470                 if(is_Phi(spill->irn) && get_nodes_block(spill->irn) == bb) {
3471                         name = si->lpp->vars[spill->mem_in];
3472                         if(!is_zero(name->value)) {
3473                                 ir_node   *mem_phi;
3474
3475                                 mem_phi = insert_mem_phi(si, spill->irn);
3476
3477                                 DBG((si->dbg, LEVEL_2, "\t >>spilled Phi %+F -> %+F\n", spill->irn, mem_phi));
3478                         }
3479                 }
3480
3481                 name = si->lpp->vars[spill->spill];
3482                 if(!is_zero(name->value)) {
3483                         /* place spill directly after definition */
3484                         if(get_nodes_block(spill->irn) == bb) {
3485                                 insert_spill(si, spill->irn, spill->irn, spill->irn);
3486                                 continue;
3487                         }
3488
3489                         /* place spill at bb start */
3490                         if(spill->reg_in > 0) {
3491                                 name = si->lpp->vars[spill->reg_in];
3492                                 if(!is_zero(name->value)) {
3493                                         insert_spill(si, spill->irn, spill->irn, bb);
3494                                         continue;
3495                                 }
3496                         }
3497                         /* place spill after a remat */
3498                         pset_insert_ptr(spills_to_do, spill->irn);
3499                 }
3500         }
3501         DBG((si->dbg, LEVEL_3, "\t  %d spills to do in block %+F\n", pset_count(spills_to_do), bb));
3502
3503
3504         for(irn = sched_block_first_nonphi(bb); !sched_is_end(irn); irn = sched_next(irn)) {
3505                 op_t     *op = get_irn_link(irn);
3506
3507                 if(be_is_Spill(irn)) continue;
3508
3509                 if(op->is_remat) {
3510                         /* TODO fix this if we want to support remats with more than two nodes */
3511                         if(get_irn_mode(irn) != mode_T && pset_find_ptr(spills_to_do, op->attr.remat.remat->value)) {
3512                                 pset_remove_ptr(spills_to_do, op->attr.remat.remat->value);
3513
3514                                 insert_spill(si, irn, op->attr.remat.remat->value, irn);
3515                         }
3516                 } else {
3517                         if(pset_find_ptr(spills_to_do, irn)) {
3518                                 pset_remove_ptr(spills_to_do, irn);
3519
3520                                 insert_spill(si, irn, irn, irn);
3521                         }
3522                 }
3523
3524         }
3525
3526         assert(pset_count(spills_to_do) == 0);
3527
3528         /* afterwards free data in block */
3529         del_pset(spills_to_do);
3530 }
3531
3532 static ir_node *
3533 insert_mem_copy(spill_ilp_t * si, ir_node * bb, ir_node * value)
3534 {
3535         ir_node          *insert_pos = bb;
3536         ir_node          *spill;
3537         const arch_env_t *arch_env = si->chordal_env->birg->main_env->arch_env;
3538
3539         /* find last definition of arg value in block */
3540         ir_node  *next;
3541         defs_t   *defs;
3542         int       last = 0;
3543
3544         defs = set_find_def(si->values, value);
3545
3546         if(defs && defs->remats) {
3547                 for(next = defs->remats; next; next = get_irn_link(next)) {
3548                         if(get_nodes_block(next) == bb && sched_get_time_step(next) > last) {
3549                                 last = sched_get_time_step(next);
3550                                 insert_pos = next;
3551                         }
3552                 }
3553         }
3554
3555         if(get_nodes_block(value) == bb && sched_get_time_step(value) > last) {
3556                 last = sched_get_time_step(value);
3557                 insert_pos = value;
3558         }
3559
3560         DBG((si->dbg, LEVEL_2, "\t  inserting mem copy for value %+F after %+F\n", value, insert_pos));
3561
3562         spill = be_spill2(arch_env, is_Block(insert_pos)?value:insert_pos, insert_pos);
3563
3564         return spill;
3565 }
3566
3567 static void
3568 phim_fixer(spill_ilp_t *si) {
3569         defs_t  *defs;
3570
3571         set_foreach(si->values, defs) {
3572                 const ir_node  *phi = defs->value;
3573                 op_t           *op = get_irn_link(phi);
3574                 ir_node        *phi_m = NULL;
3575                 ir_node        *next = defs->spills;
3576                 int             n;
3577
3578                 if(!is_Phi(phi)) continue;
3579
3580                 while(next) {
3581                         if(is_Phi(next) && get_irn_mode(next) == mode_M) {
3582                                 phi_m = next;
3583                                 break;
3584                         } else {
3585                                 next = get_irn_link(next);
3586                         }
3587                 }
3588                 if(!phi_m) continue;
3589
3590                 for(n=get_irn_arity(phi)-1; n>=0; --n) {
3591                         ir_node        *value = get_irn_n(phi, n);
3592                         defs_t         *val_defs = set_find_def(si->values, value);
3593
3594                         /* a spill of this value */
3595                         ir_node      *spill;
3596
3597
3598                         if(opt_memcopies) {
3599                                 ir_node    *pred = get_Block_cfgpred_block(get_nodes_block(phi), n);
3600                                 lpp_name_t *name = si->lpp->vars[op->attr.live_range.args.copies[n]];
3601
3602                                 if(!is_zero(name->value)) {
3603                                         spill = insert_mem_copy(si, pred, value);
3604                                 } else {
3605                                         spill = val_defs->spills;
3606                                 }
3607                         } else {
3608                                 spill = val_defs->spills;
3609                         }
3610
3611                         assert(spill && "no spill placed before PhiM");
3612                         set_irn_n(phi_m, n, spill);
3613                 }
3614         }
3615 }
3616
3617 static void
3618 walker_reload_placer(ir_node * bb, void * data) {
3619         spill_ilp_t   *si = (spill_ilp_t*)data;
3620         ir_node       *irn;
3621         spill_bb_t    *spill_bb = get_irn_link(bb);
3622
3623         /* reloads at end of block */
3624         if(spill_bb->reloads) {
3625                 keyval_t    *keyval;
3626
3627                 set_foreach(spill_bb->reloads, keyval) {
3628                         ir_node        *irn = (ir_node*)keyval->key;
3629                         ilp_var_t       reload = PTR_TO_INT(keyval->val);
3630                         lpp_name_t     *name;
3631
3632                         name = si->lpp->vars[reload];
3633                         if(!is_zero(name->value)) {
3634                                 ir_node    *reload;
3635                                 ir_node    *insert_pos = bb;
3636                                 ir_node    *prev = sched_block_last_noncf(si, bb);
3637                                 op_t       *prev_op = get_irn_link(prev);
3638
3639                                 while(be_is_Spill(prev)) {
3640                                         prev = sched_prev(prev);
3641                                 }
3642
3643                                 prev_op = get_irn_link(prev);
3644
3645                                 /* insert reload before pre-remats */
3646                                 while(!sched_is_end(prev) && !be_is_Reload(prev) && !is_Phi(prev)
3647                                                 && prev_op->is_remat && prev_op->attr.remat.pre) {
3648                                         insert_pos = prev;
3649
3650                                         do {
3651                                                 prev = sched_prev(prev);
3652                                         } while(be_is_Spill(prev));
3653
3654                                         prev_op = get_irn_link(prev);
3655
3656                                 }
3657
3658                                 reload = insert_reload(si, irn, insert_pos);
3659
3660                                 if(opt_keep_alive & KEEPALIVE_RELOADS)
3661                                         pset_insert_ptr(si->spills, reload);
3662                         }
3663                 }
3664         }
3665
3666         /* walk and insert more reloads and collect remats */
3667         sched_foreach_reverse(bb, irn) {
3668                 op_t     *op = get_irn_link(irn);
3669
3670                 if(be_is_Reload(irn) || be_is_Spill(irn)) continue;
3671                 if(is_Phi(irn)) break;
3672
3673                 if(op->is_remat) {
3674                         if(get_irn_mode(irn) != mode_T) {
3675                                 insert_remat(si, irn);
3676                         }
3677                 } else {
3678                         int    n;
3679
3680                         for (n=get_irn_arity(irn)-1; n>=0; --n) {
3681                                 ir_node    *arg = get_irn_n(irn, n);
3682
3683                                 if(op->attr.live_range.args.reloads && op->attr.live_range.args.reloads[n] != ILP_UNDEF) {
3684                                         lpp_name_t    *name;
3685
3686                                         name = si->lpp->vars[op->attr.live_range.args.reloads[n]];
3687                                         if(!is_zero(name->value)) {
3688                                                 ir_node    *reload;
3689                                                 ir_node    *insert_pos = irn;
3690                                                 ir_node    *prev = sched_prev(insert_pos);
3691                                                 op_t       *prev_op;
3692
3693                                                 while(be_is_Spill(prev)) {
3694                                                         prev = sched_prev(prev);
3695                                                 }
3696
3697                                                 prev_op = get_irn_link(prev);
3698
3699                                                 /* insert reload before pre-remats */
3700                                                 while(!sched_is_end(prev) && !be_is_Reload(prev) && !is_Phi(prev)
3701                                                                 && prev_op->is_remat && prev_op->attr.remat.pre) {
3702                                                         insert_pos = prev;
3703
3704                                                         do {
3705                                                                 prev = sched_prev(prev);
3706                                                         } while(be_is_Spill(prev));
3707
3708                                                         prev_op = get_irn_link(prev);
3709
3710                                                 }
3711
3712                                                 reload = insert_reload(si, arg, insert_pos);
3713
3714                                                 set_irn_n(irn, n, reload);
3715
3716                                                 if(opt_keep_alive & KEEPALIVE_RELOADS)
3717                                                         pset_insert_ptr(si->spills, reload);
3718                                         }
3719                                 }
3720                         }
3721                 }
3722         }
3723
3724         del_set(spill_bb->ilp);
3725         if(spill_bb->reloads) del_set(spill_bb->reloads);
3726 }
3727
3728 static void
3729 walker_collect_used(ir_node * irn, void * data)
3730 {
3731         lc_bitset_t   *used = data;
3732
3733         lc_bitset_set(used, get_irn_idx(irn));
3734 }
3735
3736 struct kill_helper {
3737         lc_bitset_t  *used;
3738         spill_ilp_t  *si;
3739 };
3740
3741 static void
3742 walker_kill_unused(ir_node * bb, void * data)
3743 {
3744         struct kill_helper *kh = data;
3745         ir_node            *bad = get_irg_bad(get_irn_irg(bb));
3746         ir_node            *irn;
3747
3748
3749         for(irn=sched_first(bb); !sched_is_end(irn);) {
3750                 ir_node     *next = sched_next(irn);
3751                 int          n;
3752
3753                 if(!lc_bitset_is_set(kh->used, get_irn_idx(irn))) {
3754                         if(be_is_Spill(irn) || be_is_Reload(irn)) {
3755                                 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)));
3756 #if 0
3757                                 assert(lpp_get_sol_state(kh->si->lpp) != lpp_optimal && "optimal solution is suboptimal?");
3758 #endif
3759                         }
3760
3761                         sched_remove(irn);
3762
3763                         set_nodes_block(irn, bad);
3764                         for (n=get_irn_arity(irn)-1; n>=0; --n) {
3765                                 set_irn_n(irn, n, bad);
3766                         }
3767                 }
3768                 irn = next;
3769         }
3770 }
3771
3772 static void
3773 kill_all_unused_values_in_schedule(spill_ilp_t * si)
3774 {
3775         struct kill_helper kh;
3776
3777         kh.used = lc_bitset_malloc(get_irg_last_idx(si->chordal_env->irg));
3778         kh.si = si;
3779
3780         irg_walk_graph(si->chordal_env->irg, walker_collect_used, NULL, kh.used);
3781         irg_block_walk_graph(si->chordal_env->irg, walker_kill_unused, NULL, &kh);
3782
3783         lc_bitset_free(kh.used);
3784 }
3785
3786 void
3787 print_irn_pset(pset * p)
3788 {
3789         ir_node   *irn;
3790
3791         pset_foreach(p, irn) {
3792                 ir_printf("%+F\n", irn);
3793         }
3794 }
3795
3796 void
3797 dump_phi_class(spill_ilp_t * si, pset * phiclass, const char * file)
3798 {
3799     FILE           *f = fopen(file, "w");
3800     ir_node        *irn;
3801     interference_t *interference;
3802
3803     pset_break(phiclass);
3804     set_break(si->interferences);
3805
3806     ir_fprintf(f, "digraph phiclass {\n");
3807
3808     pset_foreach(phiclass, irn) {
3809         if(is_Phi(irn))
3810             ir_fprintf(f, "  %F%N [shape=box]\n",irn,irn);
3811     }
3812
3813     pset_foreach(phiclass, irn) {
3814         int n;
3815
3816         if(!is_Phi(irn)) continue;
3817
3818         for(n=get_irn_arity(irn)-1; n>=0; --n) {
3819             ir_node  *arg = get_irn_n(irn, n);
3820
3821             ir_fprintf(f, "  %F%N -> %F%N\n",irn,irn,arg,arg);
3822         }
3823     }
3824
3825     set_foreach(si->interferences, interference) {
3826         const ir_node  *a  = interference->a;
3827         const ir_node  *b  = interference->b;
3828         if(get_phi_class(a) == phiclass) {
3829             ir_fprintf(f, "  %F%N -> %F%N [color=red,dir=none,style=bold]\n",a,a,b,b);
3830         }
3831     }
3832
3833     ir_fprintf(f, "}");
3834     fclose(f);
3835 }
3836
3837 static void
3838 rewire_uses(spill_ilp_t * si)
3839 {
3840         dom_front_info_t     *dfi = be_compute_dominance_frontiers(si->chordal_env->irg);
3841         defs_t               *defs;
3842         pset                 *ignore = pset_new_ptr(1);
3843
3844         pset_insert_ptr(ignore, get_irg_end(si->chordal_env->irg));
3845
3846         /* then fix uses of spills */
3847         set_foreach(si->values, defs) {
3848                 pset           *reloads;
3849                 pset           *spills;
3850                 const ir_node  *next = defs->remats;
3851                 int remats = 0;
3852
3853                 reloads = pset_new_ptr_default();
3854
3855                 while(next) {
3856                         if(be_is_Reload(next)) {
3857                                 pset_insert_ptr(reloads, next);
3858                         } else {
3859                                 ++remats;
3860                         }
3861                         next = get_irn_link(next);
3862                 }
3863
3864                 spills = get_spills_for_value(si, defs->value);
3865                 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));
3866                 if(pset_count(spills) > 1) {
3867                         //assert(pset_count(reloads) > 0);
3868                         //                              print_irn_pset(spills);
3869                         //                              print_irn_pset(reloads);
3870
3871                         be_ssa_constr_set_ignore(dfi, si->lv, spills, ignore);
3872                 }
3873
3874                 del_pset(reloads);
3875                 del_pset(spills);
3876         }
3877
3878         /* first fix uses of remats and reloads */
3879         set_foreach(si->values, defs) {
3880                 pset           *nodes;
3881                 const ir_node  *next = defs->remats;
3882
3883                 if(next) {
3884                         nodes = pset_new_ptr_default();
3885                         pset_insert_ptr(nodes, defs->value);
3886
3887                         while(next) {
3888                                 pset_insert_ptr(nodes, next);
3889                                 next = get_irn_link(next);
3890                         }
3891
3892                         if(pset_count(nodes) > 1) {
3893                                 DBG((si->dbg, LEVEL_4, "\t    %d new definitions for value %+F\n", pset_count(nodes)-1, defs->value));
3894                                 be_ssa_constr_set(dfi, si->lv, nodes);
3895                         }
3896
3897                         del_pset(nodes);
3898                 }
3899         }
3900
3901 //      remove_unused_defs(si);
3902
3903         be_free_dominance_frontiers(dfi);
3904 }
3905
3906
3907 static void
3908 writeback_results(spill_ilp_t * si)
3909 {
3910         /* walk through the graph and collect all spills, reloads and remats for a value */
3911
3912         si->values = new_set(cmp_defs, 4096);
3913
3914         DBG((si->dbg, LEVEL_1, "Applying results\n"));
3915         delete_unnecessary_remats(si);
3916         si->m_unknown = new_r_Unknown(si->chordal_env->irg, mode_M);
3917         irg_block_walk_graph(si->chordal_env->irg, walker_spill_placer, NULL, si);
3918         irg_block_walk_graph(si->chordal_env->irg, walker_reload_placer, NULL, si);
3919         if(opt_memoperands)
3920                 insert_memoperands(si);
3921         phim_fixer(si);
3922
3923         /* clean the remat info! there are still back-edges leading there! */
3924         clean_remat_info(si);
3925
3926         rewire_uses(si);
3927
3928         connect_all_spills_with_keep(si);
3929
3930         del_set(si->values);
3931 }
3932
3933 static int
3934 get_n_regs(spill_ilp_t * si)
3935 {
3936         int     arch_n_regs = arch_register_class_n_regs(si->cls);
3937         int     free = 0;
3938         int     i;
3939
3940         for(i=0; i<arch_n_regs; i++) {
3941                 if(!arch_register_type_is(&si->cls->regs[i], ignore)) {
3942                         free++;
3943                 }
3944         }
3945
3946         DBG((si->dbg, LEVEL_1, "\tArchitecture has %d free registers in class %s\n", free, si->cls->name));
3947         return free;
3948 }
3949
3950 static void
3951 walker_reload_mover(ir_node * bb, void * data)
3952 {
3953         spill_ilp_t   *si = data;
3954         ir_node           *tmp;
3955
3956         sched_foreach(bb, tmp) {
3957                 if(be_is_Reload(tmp) && has_reg_class(si, tmp)) {
3958                         ir_node       *reload = tmp;
3959                         ir_node       *irn = tmp;
3960
3961                         /* move reload upwards */
3962
3963                         int pressure = (int)get_irn_link(reload);
3964                         if(pressure < si->n_regs) {
3965                                 irn = sched_prev(reload);
3966                                 DBG((si->dbg, LEVEL_5, "regpressure before %+F: %d\n", reload, pressure));
3967                                 sched_remove(reload);
3968                                 pressure = (int)get_irn_link(irn);
3969
3970                                 while(pressure < si->n_regs) {
3971                                         if( sched_is_end(irn) ||
3972                                            (be_is_Reload(irn) && has_reg_class(si, irn)) ||
3973                                            /* do not move reload before its spill */
3974                                            (irn == be_get_Reload_mem(reload)) ||
3975                                            /* do not move before phi */
3976                                            is_Phi(irn)) break;
3977
3978                                         set_irn_link(irn, INT_TO_PTR(pressure+1));
3979                                         DBG((si->dbg, LEVEL_5, "new regpressure before %+F: %d\n", irn, pressure+1));
3980                                         irn = sched_prev(irn);
3981
3982                                         pressure = (int)get_irn_link(irn);
3983                                 }
3984
3985                                 DBG((si->dbg, LEVEL_3, "putting reload %+F after %+F\n", reload, irn));
3986                                 sched_put_after(irn, reload);
3987                         }
3988                 }
3989         }
3990 }
3991
3992 static void
3993 move_reloads_upward(spill_ilp_t * si)
3994 {
3995         irg_block_walk_graph(si->chordal_env->irg, walker_reload_mover, NULL, si);
3996 }
3997
3998
3999 /**
4000  * Walk all irg blocks and check for interfering spills inside of phi classes
4001  */
4002 static void
4003 luke_meminterferencechecker(ir_node * bb, void * data)
4004 {
4005         spill_ilp_t    *si = (spill_ilp_t*)data;
4006         int             l1, l2;
4007
4008         be_lv_foreach(si->lv, bb, be_lv_state_end | be_lv_state_out | be_lv_state_in, l1) {
4009                 ir_node        *a = be_lv_get_irn(si->lv, bb, l1);
4010
4011                 if(!be_is_Spill(a) && (!is_Phi(a) || get_irn_mode(a) != mode_T)) continue;
4012
4013                 /* a is only interesting if it is in my register class and if it is inside a phi class */
4014                 if (has_reg_class(si, a) && get_phi_class(a)) {
4015                         for(l2=_be_lv_next_irn(si->lv, bb, 0xff, l1+1); l2>=0; l2=_be_lv_next_irn(si->lv, bb, 0xff, l2+1)) {
4016                                 ir_node        *b = be_lv_get_irn(si->lv, bb, l2);
4017
4018                                 if(!be_is_Spill(b) && (!is_Phi(b) || get_irn_mode(b) != mode_T)) continue;
4019
4020                                 /* a and b are only interesting if they are in the same phi class */
4021                                 if(has_reg_class(si, b) && get_phi_class(a) == get_phi_class(b)) {
4022                                         if(values_interfere_in_block(si, bb, a, b)) {
4023                                                 ir_fprintf(stderr, "$$ Spills interfere in %+F: %+F, %+F \t$$\n", bb, a, b);
4024                                         }
4025                                 }
4026                         }
4027                 }
4028         }
4029 }
4030
4031 static void
4032 verify_phiclasses(spill_ilp_t * si)
4033 {
4034         /* analyze phi classes */
4035         phi_class_compute(si->chordal_env->irg);
4036
4037         DBG((si->dbg, LEVEL_2, "\t calling memory interference checker\n"));
4038         irg_block_walk_graph(si->chordal_env->irg, luke_meminterferencechecker, NULL, si);
4039 }
4040
4041 static void
4042 walker_spillslotassigner(ir_node * irn, void * data)
4043 {
4044         void                   *cls;
4045
4046         if(!be_is_Spill(irn)) return;
4047
4048         /* set spill context to phi class if it has one ;) */
4049         (void) cls;
4050 #if 0
4051         // Matze: not needed anymore
4052         cls = get_phi_class(irn);
4053         if(cls)
4054                 be_set_Spill_context(irn, cls);
4055         else
4056                 be_set_Spill_context(irn, irn);
4057 #endif
4058 }
4059
4060
4061 static void
4062 assign_spillslots(spill_ilp_t * si)
4063 {
4064         DBG((si->dbg, LEVEL_2, "\t calling spill slot assigner\n"));
4065         irg_walk_graph(si->chordal_env->irg, walker_spillslotassigner, NULL, si);
4066 }
4067
4068 void
4069 be_spill_remat(const be_chordal_env_t * chordal_env)
4070 {
4071         char            buf[256];
4072         char            problem_name[256];
4073         char            dump_suffix[256];
4074         char            dump_suffix2[256];
4075         struct obstack  obst;
4076         spill_ilp_t     si;
4077
4078         ir_snprintf(problem_name, sizeof(problem_name), "%F_%s", chordal_env->irg, chordal_env->cls->name);
4079         ir_snprintf(dump_suffix, sizeof(dump_suffix), "-%s-remats", chordal_env->cls->name);
4080         ir_snprintf(dump_suffix2, sizeof(dump_suffix2), "-%s-pressure", chordal_env->cls->name);
4081
4082         FIRM_DBG_REGISTER(si.dbg, "firm.be.ra.spillremat");
4083         DBG((si.dbg, LEVEL_1, "\n\n\t\t===== Processing %s =====\n\n", problem_name));
4084
4085         if(opt_verify & VERIFY_DOMINANCE)
4086                 be_check_dominance(chordal_env->irg);
4087
4088         obstack_init(&obst);
4089         si.chordal_env = chordal_env;
4090         si.obst = &obst;
4091         si.cls = chordal_env->cls;
4092         si.lpp = new_lpp(problem_name, lpp_minimize);
4093         si.remat_info = new_set(cmp_remat_info, 4096);
4094         si.interferences = new_set(cmp_interference, 32);
4095         si.memoperands = new_set(cmp_memoperands, 128);
4096         si.all_possible_remats = pset_new_ptr_default();
4097         si.spills = pset_new_ptr_default();
4098         si.inverse_ops = pset_new_ptr_default();
4099         si.lv = chordal_env->lv;
4100         si.keep = NULL;
4101         si.n_regs = get_n_regs(&si);
4102
4103         set_irg_link(chordal_env->irg, &si);
4104         compute_doms(chordal_env->irg);
4105
4106         /* compute phi classes */
4107 //      phi_class_compute(chordal_env->irg);
4108
4109         be_analyze_regpressure(chordal_env, "-pre");
4110
4111         if(opt_remats) {
4112                 /* collect remats */
4113                 DBG((si.dbg, LEVEL_1, "Collecting remats\n"));
4114                 irg_walk_graph(chordal_env->irg, walker_remat_collector, NULL, &si);
4115         }
4116
4117         /* insert possible remats */
4118         DBG((si.dbg, LEVEL_1, "Inserting possible remats\n"));
4119         irg_block_walk_graph(chordal_env->irg, walker_remat_insertor, NULL, &si);
4120         DBG((si.dbg, LEVEL_2, " -> inserted %d possible remats\n", pset_count(si.all_possible_remats)));
4121
4122         if(opt_keep_alive & KEEPALIVE_REMATS) {
4123                 DBG((si.dbg, LEVEL_1, "Connecting remats with keep and dumping\n"));
4124                 connect_all_remats_with_keep(&si);
4125                 /* dump graph with inserted remats */
4126                 dump_graph_with_remats(chordal_env->irg, dump_suffix);
4127         }
4128
4129         /* insert copies for phi arguments not in my regclass */
4130         irg_walk_graph(chordal_env->irg, walker_regclass_copy_insertor, NULL, &si);
4131
4132         /* recompute liveness */
4133         DBG((si.dbg, LEVEL_1, "Recomputing liveness\n"));
4134         be_liveness_recompute(si.lv);
4135
4136         /* build the ILP */
4137
4138         DBG((si.dbg, LEVEL_1, "\tBuilding ILP\n"));
4139         DBG((si.dbg, LEVEL_2, "\t endwalker\n"));
4140         irg_block_walk_graph(chordal_env->irg, luke_endwalker, NULL, &si);
4141
4142         DBG((si.dbg, LEVEL_2, "\t blockwalker\n"));
4143         irg_block_walk_graph(chordal_env->irg, luke_blockwalker, NULL, &si);
4144
4145         if(opt_memcopies) {
4146                 DBG((si.dbg, LEVEL_2, "\t memcopyhandler\n"));
4147                 memcopyhandler(&si);
4148         }
4149
4150         if(opt_dump_flags & DUMP_PROBLEM) {
4151                 FILE           *f;
4152                 ir_snprintf(buf, sizeof(buf), "%s-spillremat.ilp", problem_name);
4153                 if ((f = fopen(buf, "wt")) != NULL) {
4154                         lpp_dump_plain(si.lpp, f);
4155                         fclose(f);
4156                 }
4157         }
4158
4159         if(opt_dump_flags & DUMP_MPS) {
4160                 FILE *f;
4161
4162                 ir_snprintf(buf, sizeof(buf), "%s-spillremat.mps", problem_name);
4163                 if((f = fopen(buf, "wt")) != NULL) {
4164                         mps_write_mps(si.lpp, s_mps_fixed, f);
4165                         fclose(f);
4166                 }
4167
4168                 ir_snprintf(buf, sizeof(buf), "%s-spillremat.mst", problem_name);
4169                 if((f = fopen(buf, "wt")) != NULL) {
4170                         mps_write_mst(si.lpp, s_mps_fixed, f);
4171                         fclose(f);
4172                 }
4173         }
4174
4175         lpp_check_startvals(si.lpp);
4176
4177 #ifdef SOLVE
4178         DBG((si.dbg, LEVEL_1, "\tSolving %s (%d variables, %d constraints)\n", problem_name, si.lpp->var_next, si.lpp->cst_next));
4179         lpp_set_time_limit(si.lpp, opt_timeout);
4180
4181         if(opt_log)
4182                 lpp_set_log(si.lpp, stdout);
4183
4184 #ifdef SOLVE_LOCAL
4185         lpp_solve_cplex(si.lpp);
4186 #else
4187         lpp_solve_net(si.lpp, LPP_SERVER, LPP_SOLVER);
4188 #endif
4189         assert(lpp_is_sol_valid(si.lpp)
4190                && "solution of ILP must be valid");
4191
4192         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));
4193
4194         if(opt_dump_flags & DUMP_SOLUTION) {
4195                 FILE           *f;
4196                 char            buf[256];
4197
4198                 ir_snprintf(buf, sizeof(buf), "%s-spillremat.sol", problem_name);
4199                 if ((f = fopen(buf, "wt")) != NULL) {
4200                         int             i;
4201                         for (i = 0; i < si.lpp->var_next; ++i) {
4202                                 lpp_name_t     *name = si.lpp->vars[i];
4203                                 fprintf(f, "%20s %4d %10f\n", name->name, name->nr, name->value);
4204                         }
4205                         fclose(f);
4206                 }
4207         }
4208
4209         writeback_results(&si);
4210
4211 #endif                          /* SOLVE */
4212
4213         kill_all_unused_values_in_schedule(&si);
4214
4215         if(opt_keep_alive & (KEEPALIVE_SPILLS | KEEPALIVE_RELOADS))
4216                 be_dump(chordal_env->irg, "-spills-placed", dump_ir_block_graph);
4217
4218         // move reloads upwards
4219         be_liveness_recompute(si.lv);
4220         irg_block_walk_graph(chordal_env->irg, walker_pressure_annotator, NULL, &si);
4221         move_reloads_upward(&si);
4222
4223         if(opt_memcopies) {
4224                 verify_phiclasses(&si);
4225                 assign_spillslots(&si);
4226         }
4227
4228         irg_block_walk_graph(chordal_env->irg, walker_pressure_annotator, NULL, &si);
4229
4230         dump_pressure_graph(&si, dump_suffix2);
4231
4232         be_analyze_regpressure(chordal_env, "-post");
4233
4234         if(opt_verify & VERIFY_DOMINANCE)
4235                 be_check_dominance(chordal_env->irg);
4236
4237         free_dom(chordal_env->irg);
4238         del_set(si.interferences);
4239         del_pset(si.inverse_ops);
4240         del_pset(si.all_possible_remats);
4241         del_set(si.memoperands);
4242         del_pset(si.spills);
4243         free_lpp(si.lpp);
4244         obstack_free(&obst, NULL);
4245         DBG((si.dbg, LEVEL_1, "\tdone.\n"));
4246 }
4247
4248 #else                           /* WITH_ILP */
4249
4250 static void
4251 only_that_you_can_compile_without_WITH_ILP_defined(void)
4252 {
4253 }
4254
4255 #endif                          /* WITH_ILP */