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