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