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