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

   1 /**
   2  * Scheduling algorithms.
   3  * An ILP scheduler based on
   4  * "ILP-based Instruction Scheduling for IA-64"
   5  * by Daniel Kaestner and Sebastian Winkel
   6  *
   7  * @date   22.10.2005
   8  * @author Christian Wuerdig
   9  * @cvs-id $Id$
  10  */
  11 #ifdef HAVE_CONFIG_H
  12 #include "config.h"
  13 #endif
  14
  15 #ifdef WITH_ILP
  16
  17 #include <math.h>
  18
  19 #ifndef _WIN32
  20 #include <strings.h>
  21 #endif /* _WIN32 */
  22
  23 #include "irnode_t.h"
  24 #include "irgwalk.h"
  25 #include "irbitset.h"
  26 #include "irphase_t.h"
  27 #include "height.h"
  28 #include "iredges.h"
  29 #include "pdeq.h"
  30 #include "debug.h"
  31 #include "irtools.h"
  32 #include "irdump.h"
  33 #include "plist.h"
  34
  35 #include <lpp/lpp.h>
  36 #include <lpp/lpp_net.h>
  37
  38 #ifdef WITH_LIBCORE
  39 #include <libcore/lc_opts.h>
  40 #include <libcore/lc_opts_enum.h>
  41 #include <libcore/lc_timing.h>
  42 #endif /* WITH_LIBCORE */
  43
  44 #include "be.h"
  45 #include "benode_t.h"
  46 #include "besched_t.h"
  47 #include "beilpsched.h"
  48 #include "beutil.h"
  49
  50 typedef struct _ilpsched_options_t {
  51         unsigned regpress;
  52         unsigned limit_dead;
  53         unsigned time_limit;
  54         char     log_file[1024];
  55 } ilpsched_options_t;
  56
  57 typedef struct _unit_type_info_t {
  58         int                            n_units;
  59         const be_execution_unit_type_t *tp;
  60 } unit_type_info_t;
  61
  62 /**
  63  * holding the ILP variables of the different types
  64  */
  65 typedef struct _ilp_var_types_t {
  66         int *x;   /* x_{nt}^k variables */
  67         int *a;   /* a_{nt}^k variables */
  68         int *d;   /* d_{nt}^k variables */
  69         int *y;   /* y_{nt}^k variables */
  70 } ilp_var_types_t;
  71
  72 /* attributes for a node */
  73 typedef struct _ilpsched_node_attr_t {
  74         unsigned asap;                     /**< The ASAP scheduling control step */
  75         unsigned alap;                     /**< The ALAP scheduling control step */
  76         unsigned latency;                  /**< Latency of this node (needed for sorting) */
  77         unsigned sched_point;              /**< the step in which the node is finally scheduled */
  78         unsigned visit_idx;                /**< Index of the node having visited this node last */
  79         unsigned consumer_idx;             /**< Index of the node having counted this node as consumer last */
  80         unsigned n_consumer;               /**< Number of consumers */
  81         ir_node  **block_consumer;         /**< List of consumer being in the same block */
  82         waitq    *projkeeps;               /**< A List of Projs and Keeps belonging to this node */
  83         unsigned block_idx     : 30;       /**< A unique per block index */
  84         unsigned alap_changed  : 1;        /**< the current ALAP has changed, revisit preds */
  85         unsigned is_dummy_node : 1;        /**< this node is assigned to DUMMY unit */
  86         bitset_t *transitive_block_nodes;  /**< Set of transitive block nodes (predecessors
  87                                                                                         for ASAP, successors for ALAP */
  88         unsigned n_unit_types;             /**< number of allowed execution unit types */
  89         unit_type_info_t *type_info;       /**< list of allowed execution unit types */
  90         ilp_var_types_t  ilp_vars;         /**< the different ILP variables */
  91 } ilpsched_node_attr_t;
  92
  93 /* attributes for a block */
  94 typedef struct _ilpsched_block_attr_t {
  95         unsigned block_last_idx;        /**< The highest node index in block so far */
  96         unsigned n_interesting_nodes;   /**< The number of nodes interesting for scheduling */
  97         unsigned max_steps;             /**< Upper bound for block execution */
  98         plist_t  *root_nodes;           /**< A list of nodes having no user in current block */
  99         ir_node  *head_ilp_nodes;       /**< A linked list of nodes which will contribute to ILP */
 100 } ilpsched_block_attr_t;
 101
 102 typedef union _ilpsched_attr_ {
 103         ilpsched_node_attr_t  node_attr;
 104         ilpsched_block_attr_t block_attr;
 105 } ilpsched_attr_t;
 106
 107 /* A irn for the phase and it's attributes (either node or block) */
 108 typedef struct {
 109         ir_node         *irn;
 110         ilpsched_attr_t attr;
 111 } be_ilpsched_irn_t;
 112
 113 /* The ILP scheduling environment */
 114 typedef struct {
 115         phase_t              ph;            /**< The phase */
 116         ir_graph             *irg;          /**< The current irg */
 117         heights_t            *height;       /**< The heights object of the irg */
 118         void                 *irg_env;      /**< An environment for the irg scheduling, provided by the backend */
 119         void                 *block_env;    /**< An environment for scheduling a block, provided by the backend */
 120         const arch_env_t     *arch_env;
 121         const arch_isa_t     *isa;          /**< The ISA */
 122         const be_main_env_t  *main_env;
 123         const be_machine_t   *cpu;          /**< the current abstract machine */
 124         ilpsched_options_t   *opts;         /**< the ilp options for current irg */
 125         const ilp_sched_selector_t *sel;    /**< The ILP sched selector provided by the backend */
 126         DEBUG_ONLY(firm_dbg_module_t *dbg);
 127 } be_ilpsched_env_t;
 128
 129 /* convenience macros to handle phase irn data */
 130 #define get_ilpsched_irn(ilpsched_env, irn) (phase_get_or_set_irn_data(&(ilpsched_env)->ph, (irn)))
 131 #define is_ilpsched_block(node)             (is_Block((node)->irn))
 132 #define get_ilpsched_block_attr(block)      (&(block)->attr.block_attr)
 133 #define get_ilpsched_node_attr(node)        (&(node)->attr.node_attr)
 134
 135 /* check if node is considered for ILP scheduling */
 136 #define consider_for_sched(isa, irn) \
 137         (! (is_Block(irn)            ||  \
 138                 is_normal_Proj(isa, irn) ||  \
 139                 is_Phi(irn)              ||  \
 140                 is_NoMem(irn)            ||  \
 141                 is_Unknown(irn)          ||  \
 142                 is_End(irn)                  \
 143                 ))
 144
 145 /* gives the valid scheduling time step interval for a node */
 146 #define VALID_SCHED_INTERVAL(na) ((na)->alap - (na)->asap + 1)
 147
 148 /* gives the valid interval where a node can die */
 149 #define VALID_KILL_INTERVAL(ba, na) ((ba)->max_steps - (na)->asap + 1)
 150
 151 /* gives the corresponding ILP variable for given node, unit and time step */
 152 #define ILPVAR_IDX(na, unit, control_step) \
 153         ((unit) * VALID_SCHED_INTERVAL((na)) + (control_step) - (na)->asap + 1)
 154
 155 /* gives the corresponding dead nodes ILP variable for given node, unit and time step */
 156 #define ILPVAR_IDX_DEAD(ba, na, unit, control_step) \
 157         ((unit) * VALID_KILL_INTERVAL((ba), (na)) + (control_step) - (na)->asap + 1)
 158
 159 /* check if a double value is within an epsilon environment of 0 */
 160 #define LPP_VALUE_IS_0(dbl) (fabs((dbl)) <= 1e-10)
 161
 162 #ifdef WITH_LIBCORE
 163         #define ilp_timer_push(t)         lc_timer_push((t))
 164         #define ilp_timer_pop()           lc_timer_pop()
 165         #define ilp_timer_elapsed_usec(t) lc_timer_elapsed_usec((t))
 166 #else /* WITH_LIBCORE */
 167         #define ilp_timer_push(t)
 168         #define ilp_timer_pop()
 169         #define ilp_timer_elapsed_usec(t) 0.0
 170 #endif /* WITH_LIBCORE */
 171
 172 /* option variable */
 173 static ilpsched_options_t ilp_opts = {
 174         1,     /* default is with register pressure constraints */
 175         120,   /* if we have more than 70 nodes: use alive nodes constraint */
 176         300,   /* 300 sec per block time limit */
 177         ""     /* no log file */
 178 };
 179
 180 #ifdef WITH_LIBCORE
 181 /* ILP options */
 182 static const lc_opt_table_entry_t ilpsched_option_table[] = {
 183         LC_OPT_ENT_BOOL("regpress",  "Use register pressure constraints", &ilp_opts.regpress),
 184         LC_OPT_ENT_INT("limit_dead", "Upto how many nodes the dead node constraint should be used", &ilp_opts.limit_dead),
 185         LC_OPT_ENT_INT("time_limit", "ILP time limit per block", &ilp_opts.time_limit),
 186         LC_OPT_ENT_STR("lpp_log",    "LPP logfile (stderr and stdout are supported)", ilp_opts.log_file, sizeof(ilp_opts.log_file)),
 187         { NULL }
 188 };
 189 #endif /* WITH_LIBCORE */
 190
 191 /*
 192         We need this global variable as we compare nodes dependent on heights,
 193         but we cannot pass any information to the qsort compare function.
 194 */
 195 static heights_t *glob_heights;
 196
 197 /**
 198  * Check if irn is a Proj, which has no execution units assigned.
 199  * @return 1 if irn is a Proj having no execution units assigned, 0 otherwise
 200  */
 201 static INLINE int is_normal_Proj(const arch_isa_t *isa, const ir_node *irn) {
 202         return is_Proj(irn) && (arch_isa_get_allowed_execution_units(isa, irn) == NULL);
 203 }
 204
 205 /**
 206  * Skips normal Projs.
 207  * @return predecessor if irn is a normal Proj, otherwise irn.
 208  */
 209 static INLINE ir_node *skip_normal_Proj(const arch_isa_t *isa, ir_node *irn) {
 210         if (is_normal_Proj(isa, irn))
 211                 return get_Proj_pred(irn);
 212         return irn;
 213 }
 214
 215 static INLINE int fixed_latency(const ilp_sched_selector_t *sel, ir_node *irn, void *env) {
 216         unsigned lat = be_ilp_sched_latency(sel, irn, env);
 217         if (lat == 0 && ! is_Proj(irn) && ! be_is_Keep(irn))
 218                 lat = 1;
 219         return lat;
 220 }
 221
 222
 223 /**
 224  * Compare scheduling time steps of two be_ilpsched_irn's.
 225  */
 226 static int cmp_ilpsched_irn(const void *a, const void *b) {
 227         be_ilpsched_irn_t    *n1   = *(be_ilpsched_irn_t **)a;
 228         be_ilpsched_irn_t    *n2   = *(be_ilpsched_irn_t **)b;
 229         ilpsched_node_attr_t *n1_a = get_ilpsched_node_attr(n1);
 230         ilpsched_node_attr_t *n2_a = get_ilpsched_node_attr(n2);
 231
 232         if (n1_a->sched_point == n2_a->sched_point) {
 233                 ir_node *irn_a = n1->irn;
 234                 ir_node *irn_b = n2->irn;
 235
 236                 if (heights_reachable_in_block(glob_heights, irn_a, irn_b))
 237                         return 1;
 238                 if (heights_reachable_in_block(glob_heights, irn_b, irn_a))
 239                         return -1;
 240
 241                 /*
 242                         Ok, timestep is equal and the nodes are parallel,
 243                         so check latency and schedule high latency first.
 244                 */
 245                 return QSORT_CMP(n2_a->latency, n1_a->latency);
 246         }
 247         else
 248                 return QSORT_CMP(n1_a->sched_point, n2_a->sched_point);
 249 }
 250
 251 /**
 252  * In case there is no phase information for irn, initialize it.
 253  */
 254 static void *init_ilpsched_irn(phase_t *ph, ir_node *irn, void *old) {
 255         be_ilpsched_irn_t *res = old ? old : phase_alloc(ph, sizeof(res[0]));
 256
 257         if (res == old) {
 258                 /* if we have already some data: check for reinitialization */
 259
 260                 if (! is_Block(irn)) {
 261                         ilpsched_node_attr_t *na = get_ilpsched_node_attr(res);
 262
 263                         if (! na->transitive_block_nodes) {
 264                                 ir_node               *block      = get_nodes_block(irn);
 265                                 be_ilpsched_irn_t     *block_node = phase_get_or_set_irn_data(ph, block);
 266                                 ilpsched_block_attr_t *ba         = get_ilpsched_block_attr(block_node);
 267
 268                                 /* we are called after the block indices have been build: create bitset */
 269                                 na->transitive_block_nodes = bitset_obstack_alloc(phase_obst(ph), ba->block_last_idx);
 270                         }
 271                         else {
 272                                 /* we are called from reinit block data: clear the bitset */
 273                                 bitset_clear_all(na->transitive_block_nodes);
 274                                 na->visit_idx    = 0;
 275                                 na->alap_changed = 1;
 276                         }
 277                 }
 278                 return old;
 279         }
 280
 281         res->irn = irn;
 282
 283         /* set ilpsched irn attributes (either block or irn) */
 284         if (is_Block(irn)) {
 285                 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(res);
 286
 287                 ba->n_interesting_nodes = 0;
 288                 ba->block_last_idx      = 0;
 289                 ba->root_nodes          = plist_new();
 290                 ba->head_ilp_nodes      = NULL;
 291                 ba->max_steps           = 0;
 292         }
 293         else {
 294                 ilpsched_node_attr_t *na = get_ilpsched_node_attr(res);
 295                 memset(na, 0, sizeof(*na));
 296         }
 297
 298         return res;
 299 }
 300
 301 /**
 302  * Assign a per block unique number to each node.
 303  */
 304 static void build_block_idx(ir_node *irn, void *walk_env) {
 305         be_ilpsched_env_t     *env = walk_env;
 306         be_ilpsched_irn_t     *node, *block_node;
 307         ilpsched_node_attr_t  *na;
 308         ilpsched_block_attr_t *ba;
 309
 310         if (! consider_for_sched(env->arch_env->isa, irn))
 311                 return;
 312
 313         node       = get_ilpsched_irn(env, irn);
 314         na         = get_ilpsched_node_attr(node);
 315         block_node = get_ilpsched_irn(env, get_nodes_block(irn));
 316         ba         = get_ilpsched_block_attr(block_node);
 317
 318         na->block_idx = ba->block_last_idx++;
 319 }
 320
 321 /********************************************************
 322  *                              __        _
 323  *                             / /       | |
 324  *   __ _ ___  __ _ _ __      / /    __ _| | __ _ _ __
 325  *  / _` / __|/ _` | '_ \    / /    / _` | |/ _` | '_ \
 326  * | (_| \__ \ (_| | |_) |  / /    | (_| | | (_| | |_) |
 327  *  \__,_|___/\__,_| .__/  /_/      \__,_|_|\__,_| .__/
 328  *                 | |                           | |
 329  *                 |_|                           |_|
 330  ********************************************************/
 331
 332 /**
 333  * Add all nodes having no user in current block to last_nodes list.
 334  */
 335 static void collect_alap_root_nodes(ir_node *irn, void *walk_env) {
 336         ir_node               *block;
 337         const ir_edge_t       *edge;
 338         be_ilpsched_irn_t     *block_node, *node;
 339         ilpsched_block_attr_t *ba;
 340         ilpsched_node_attr_t  *na;
 341         int                   i, j;
 342         be_ilpsched_env_t     *env           = walk_env;
 343         int                   has_block_user = 0;
 344         unsigned              n_consumer     = 0;
 345         ir_edge_kind_t        ekind[2]       = { EDGE_KIND_NORMAL, EDGE_KIND_DEP };
 346         ir_node               **consumer;
 347         int                   idx;
 348
 349         if (! consider_for_sched(env->arch_env->isa, irn))
 350                 return;
 351
 352         block    = get_nodes_block(irn);
 353     idx      = get_irn_idx(irn);
 354         consumer = NEW_ARR_F(ir_node *, 0);
 355
 356         DBG((env->dbg, LEVEL_3, "%+F (%+F) is interesting, examining ... ", irn, block));
 357
 358         /* check data and dependency out edges */
 359         for (i = 0; i < 2 && ! has_block_user; ++i) {
 360                 foreach_out_edge_kind(irn, edge, ekind[i]) {
 361                         ir_node *user = get_edge_src_irn(edge);
 362
 363                         if (is_normal_Proj(env->arch_env->isa, user)) {
 364                                 const ir_edge_t *user_edge;
 365
 366                                 if (get_irn_mode(user) == mode_X)
 367                                         continue;
 368
 369                                 /* The ABI ensures, that there will be no ProjT nodes in the graph. */
 370                                 for (j = 0; j < 2; ++j) {
 371                                         foreach_out_edge_kind(user, user_edge, ekind[j]) {
 372                                                 ir_node *real_user = get_edge_src_irn(user_edge);
 373
 374                                                 if (! is_Phi(real_user) && ! is_Block(real_user)) {
 375                                                         be_ilpsched_irn_t    *node = get_ilpsched_irn(env, real_user);
 376                                                         ilpsched_node_attr_t *ua   = get_ilpsched_node_attr(node);
 377
 378                                                         /* skip already visited nodes */
 379                                                         if (ua->consumer_idx == idx)
 380                                                                 continue;
 381
 382                                                         /* check if node has user in this block and collect the user if it's a data user */
 383                                                         if (get_nodes_block(real_user) == block) {
 384                                                                 if (i == 0 && j == 0)
 385                                                                         ARR_APP1(ir_node *, consumer, real_user);
 386                                                                 has_block_user = 1;
 387                                                         }
 388
 389                                                         /* only count data consumer */
 390                                                         if (i == 0)
 391                                                                 n_consumer++;
 392
 393                                                         /* mark user as visited by this node */
 394                                                         ua->consumer_idx = idx;
 395                                                 }
 396                                         }
 397                                 }
 398                         }
 399                         else if (is_Block(user)) {
 400                                 continue;
 401                         }
 402                         else if (! is_Phi(user)) {
 403                                 be_ilpsched_irn_t    *node = get_ilpsched_irn(env, user);
 404                                 ilpsched_node_attr_t *ua   = get_ilpsched_node_attr(node);
 405
 406                                 /* skip already visited nodes */
 407                                 if (ua->consumer_idx == idx)
 408                                         continue;
 409
 410                                 /* check if node has user in this block and collect the user if it's a data user */
 411                                 if (get_nodes_block(user) == block) {
 412                                         if (i == 0)
 413                                                 ARR_APP1(ir_node *, consumer, user);
 414                                         has_block_user = 1;
 415                                 }
 416
 417                                 /* only count data consumer */
 418                                 if (i == 0)
 419                                         n_consumer++;
 420
 421                                 /* mark user visited by this node */
 422                                 ua->consumer_idx = idx;
 423                         }
 424                 }
 425         }
 426
 427         block_node = get_ilpsched_irn(env, block);
 428         ba         = get_ilpsched_block_attr(block_node);
 429
 430         ba->n_interesting_nodes++;
 431
 432         /* current irn has no user inside this block, add to queue */
 433         if (! has_block_user) {
 434                 DB((env->dbg, LEVEL_3, "root node\n"));
 435                 plist_insert_back(ba->root_nodes, irn);
 436         }
 437         else {
 438                 DB((env->dbg, LEVEL_3, "normal node\n"));
 439         }
 440
 441         /* record number of all consumer and the consumer within the same block */
 442         node = get_ilpsched_irn(env, irn);
 443         na   = get_ilpsched_node_attr(node);
 444         na->n_consumer     = n_consumer;
 445         na->block_consumer = NEW_ARR_D(ir_node *, phase_obst(&env->ph), ARR_LEN(consumer));
 446         memcpy(na->block_consumer, consumer, ARR_LEN(consumer) * sizeof(na->block_consumer[0]));
 447         DEL_ARR_F(consumer);
 448 }
 449
 450 /**
 451  * Calculate the ASAP scheduling step for current irn.
 452  */
 453 static void calculate_irn_asap(ir_node *irn, void *walk_env) {
 454         be_ilpsched_env_t     *env = walk_env;
 455         int                   i;
 456         ir_node               *block;
 457         be_ilpsched_irn_t     *node, *block_node;
 458         ilpsched_node_attr_t  *na;
 459         ilpsched_block_attr_t *ba;
 460
 461         /* These nodes are handled separate */
 462         if (! consider_for_sched(env->arch_env->isa, irn))
 463                 return;
 464
 465         DBG((env->dbg, LEVEL_2, "Calculating ASAP of node %+F ... ", irn));
 466
 467         block    = get_nodes_block(irn);
 468         node     = get_ilpsched_irn(env, irn);
 469         na       = get_ilpsched_node_attr(node);
 470         na->asap = 1;
 471
 472         for (i = get_irn_ins_or_deps(irn) - 1; i >= 0; --i) {
 473                 ir_node *pred = skip_normal_Proj(env->arch_env->isa, get_irn_in_or_dep(irn, i));
 474
 475                 /* check for greatest distance to top */
 476                 if (! is_Phi(pred) && ! is_NoMem(pred) && get_nodes_block(pred) == block) {
 477                         be_ilpsched_irn_t    *pred_node = get_ilpsched_irn(env, pred);
 478                         ilpsched_node_attr_t *pna       = get_ilpsched_node_attr(pred_node);
 479                         unsigned             lat;
 480
 481                         lat         = fixed_latency(env->sel, pred, env->block_env);
 482                         na->latency = lat;
 483                         na->asap    = MAX(na->asap, pna->asap + lat);
 484                 }
 485         }
 486
 487         /* add node to ILP node list and update max_steps */
 488         block_node = get_ilpsched_irn(env, block);
 489         ba         = get_ilpsched_block_attr(block_node);
 490
 491         set_irn_link(irn, ba->head_ilp_nodes);
 492         ba->head_ilp_nodes = irn;
 493         ba->max_steps     += fixed_latency(env->sel, irn, env->block_env);
 494
 495         DB((env->dbg, LEVEL_2, "%u\n", na->asap));
 496 }
 497
 498 /**
 499  * Calculate the ALAP scheduling step of all irns in current block.
 500  * Depends on max_steps being calculated.
 501  */
 502 static void calculate_block_alap(ir_node *block, void *walk_env) {
 503         be_ilpsched_env_t     *env        = walk_env;
 504         be_ilpsched_irn_t     *block_node = get_ilpsched_irn(env, block);
 505         ilpsched_block_attr_t *ba         = get_ilpsched_block_attr(block_node);
 506         waitq                 *cur_queue  = new_waitq();
 507         plist_element_t       *el;
 508
 509         assert(is_Block(block));
 510
 511         DBG((env->dbg, LEVEL_2, "Calculating ALAP for nodes in %+F (%u nodes, %u max steps)\n",
 512                 block, ba->n_interesting_nodes, ba->max_steps));
 513
 514         /* TODO: Might be faster to use out edges and call phase_reinit_single_irn_data */
 515         //phase_reinit_block_irn_data(&env->ph, block);
 516
 517         /* init start queue */
 518         foreach_plist(ba->root_nodes, el) {
 519                 waitq_put(cur_queue, plist_element_get_value(el));
 520         }
 521
 522         /* repeat until all nodes are processed */
 523         while (! waitq_empty(cur_queue)) {
 524                 waitq *next_queue = new_waitq();
 525
 526                 /* process all nodes in current step */
 527                 while (! waitq_empty(cur_queue)) {
 528                         ir_node              *cur_irn = waitq_get(cur_queue);
 529                         be_ilpsched_irn_t    *node    = get_ilpsched_irn(env, cur_irn);
 530                         ilpsched_node_attr_t *na      = get_ilpsched_node_attr(node);
 531                         int                  i;
 532
 533                         /* cur_node has no alap set -> it's a root node, set to max alap */
 534                         if (na->alap == 0) {
 535                                 na->alap = ba->max_steps;
 536                                 DBG((env->dbg, LEVEL_2, "setting ALAP of node %+F to %u, handling preds:\n",
 537                                         cur_irn, na->alap));
 538                         }
 539                         else {
 540                                 DBG((env->dbg, LEVEL_2, "ALAP of node %+F is %u, handling preds:\n",
 541                                         cur_irn, na->alap));
 542                         }
 543
 544                         /* set the alap's of all predecessors */
 545                         for (i = get_irn_ins_or_deps(cur_irn) - 1; i >= 0; --i) {
 546                                 ir_node *pred = skip_normal_Proj(env->arch_env->isa, get_irn_in_or_dep(cur_irn, i));
 547
 548                                 /* check for greatest distance to bottom */
 549                                 if (! is_Phi(pred) && ! is_NoMem(pred) && get_nodes_block(pred) == block) {
 550                                         be_ilpsched_irn_t    *pred_node = get_ilpsched_irn(env, pred);
 551                                         ilpsched_node_attr_t *pna       = get_ilpsched_node_attr(pred_node);
 552                                         unsigned             lat;
 553
 554                                         /* mark the predecessor as visited by current irn */
 555                                         if (pna->visit_idx == get_irn_idx(cur_irn) && ! na->alap_changed)
 556                                                 continue;
 557                                         pna->visit_idx = get_irn_idx(cur_irn);
 558
 559                                         lat = fixed_latency(env->sel, pred, env->block_env);
 560
 561                                         /* set ALAP of current pred */
 562                                         if (pna->alap == 0) {
 563                                                 /* current ALAP is 0: node has not yet been visited */
 564                                                 pna->alap_changed = 1;
 565                                                 pna->alap         = na->alap - lat;
 566                                         }
 567                                         else if (pna->alap > na->alap - lat) {
 568                                                 /* we found a longer path to root node: change ALAP */
 569                                                 pna->alap         = na->alap - lat;
 570                                                 pna->alap_changed = 1;
 571                                         }
 572                                         else {
 573                                                 /* current ALAP is best found so far: keep it */
 574                                                 pna->alap_changed = 0;
 575                                         }
 576
 577                                         DBG((env->dbg, LEVEL_2, "\tsetting ALAP of node %+F to %u\n", pred, pna->alap));
 578
 579                                         /* enqueue node for next iteration */
 580                                         if (get_irn_ins_or_deps(pred) > 0)
 581                                                 waitq_put(next_queue, pred);
 582                                 }
 583                         }
 584                 }
 585
 586                 /* prepare for next iteration */
 587                 del_waitq(cur_queue);
 588                 cur_queue = next_queue;
 589         }
 590 }
 591
 592 /**
 593  * We can free the list of root nodes here.
 594  */
 595 static void clear_unwanted_data(ir_node *block, void *walk_env) {
 596         be_ilpsched_env_t     *env        = walk_env;
 597         be_ilpsched_irn_t     *block_node = get_ilpsched_irn(env, block);
 598         ilpsched_block_attr_t *ba         = get_ilpsched_block_attr(block_node);
 599
 600         plist_free(ba->root_nodes);
 601         ba->root_nodes = NULL;
 602 }
 603
 604 /**
 605  * Refine the {ASAP(n), ALAP(n)} interval for the nodes.
 606  * Set the ASAP/ALAP times of Projs and Keeps to their ancestor ones.
 607  */
 608 static void refine_asap_alap_times(ir_node *irn, void *walk_env) {
 609         be_ilpsched_env_t    *env  = walk_env;
 610         ir_node              *pred = irn;
 611         be_ilpsched_irn_t    *node, *pred_node;
 612         ilpsched_node_attr_t *na, *pna;
 613
 614         if (! consider_for_sched(env->arch_env->isa, irn))
 615                 return;
 616
 617         if (! is_Proj(irn) && ! be_is_Keep(irn))
 618                 return;
 619
 620         /* go to the ancestor */
 621         if (be_is_Keep(irn))
 622                 pred = get_irn_n(irn, 0);
 623         pred = skip_Proj(pred);
 624
 625         node      = get_ilpsched_irn(env, irn);
 626         pred_node = get_ilpsched_irn(env, pred);
 627         na        = get_ilpsched_node_attr(node);
 628         pna       = get_ilpsched_node_attr(pred_node);
 629
 630         na->asap = pna->asap;
 631         na->alap = pna->alap;
 632
 633         /* record all Projs and Keeps for this node */
 634         if (! pna->projkeeps)
 635                 pna->projkeeps = new_waitq();
 636         waitq_put(pna->projkeeps, irn);
 637
 638         DBG((env->dbg, LEVEL_2, "fixing ASAP/ALAP of %+F to %u/%u\n", irn, na->asap, na->alap));
 639 }
 640
 641 /*******************************************
 642  *           _              _       _
 643  *          | |            | |     | |
 644  *  ___  ___| |__   ___  __| |_   _| | ___
 645  * / __|/ __| '_ \ / _ \/ _` | | | | |/ _ \
 646  * \__ \ (__| | | |  __/ (_| | |_| | |  __/
 647  * |___/\___|_| |_|\___|\__,_|\__,_|_|\___|
 648  *
 649  *******************************************/
 650
 651 static INLINE void check_for_keeps(waitq *keeps, ir_node *block, ir_node *irn) {
 652         const ir_edge_t *edge;
 653
 654         foreach_out_edge(irn, edge) {
 655                 ir_node *user = get_edge_src_irn(edge);
 656
 657                 if (be_is_Keep(user)) {
 658                         assert(get_nodes_block(user) == block && "Keep must not be in different block.");
 659                         waitq_put(keeps, user);
 660                 }
 661         }
 662 }
 663
 664 /**
 665  * Inserts @p irn before @p before into schedule and notifies backend.
 666  */
 667 static INLINE void notified_sched_add_before(be_ilpsched_env_t *env,
 668         ir_node *before, ir_node *irn, unsigned cycle)
 669 {
 670         be_ilp_sched_node_scheduled(env->sel, irn, cycle, env->block_env);
 671         sched_add_before(before, irn);
 672 }
 673
 674 /**
 675  * Adds a node, it's Projs (in case of mode_T nodes) and
 676  * it's Keeps to schedule.
 677  */
 678 static void add_to_sched(be_ilpsched_env_t *env, ir_node *block, ir_node *irn, unsigned cycle) {
 679         const ir_edge_t *edge;
 680         waitq           *keeps = new_waitq();
 681
 682         /* mode_M nodes are not scheduled */
 683         if (get_irn_mode(irn) == mode_M)
 684                 return;
 685
 686         if (! sched_is_scheduled(irn))
 687                 notified_sched_add_before(env, block, irn, cycle);
 688
 689         /* add Projs */
 690         if (get_irn_mode(irn) == mode_T) {
 691                 foreach_out_edge(irn, edge) {
 692                         ir_node *user = get_edge_src_irn(edge);
 693
 694                         if ((to_appear_in_schedule(user) || get_irn_mode(user) == mode_b) &&
 695                                 get_irn_n_edges(user) > 0)
 696                         {
 697                                 notified_sched_add_before(env, block, user, cycle);
 698                         }
 699
 700                         check_for_keeps(keeps, block, user);
 701                 }
 702         }
 703         else {
 704                 check_for_keeps(keeps, block, irn);
 705         }
 706
 707         /* add Keeps */
 708         while (! waitq_empty(keeps)) {
 709                 ir_node *keep = waitq_get(keeps);
 710                 if (! sched_is_scheduled(keep))
 711                         notified_sched_add_before(env, block, keep, cycle);
 712         }
 713
 714         del_waitq(keeps);
 715 }
 716
 717 /**
 718  * Schedule all nodes in the given block, according to the ILP solution.
 719  */
 720 static void apply_solution(be_ilpsched_env_t *env, lpp_t *lpp, ir_node *block) {
 721         be_ilpsched_irn_t     *block_node = get_ilpsched_irn(env, block);
 722         ilpsched_block_attr_t *ba         = get_ilpsched_block_attr(block_node);
 723         sched_info_t          *info       = get_irn_sched_info(block);
 724         be_ilpsched_irn_t     **sched_nodes;
 725         unsigned              i, l;
 726         ir_node               *cfop, *irn;
 727         const ir_edge_t       *edge;
 728
 729         /* init block schedule list */
 730         INIT_LIST_HEAD(&info->list);
 731         info->scheduled = 1;
 732
 733         /* collect nodes and their scheduling time step */
 734         sched_nodes = NEW_ARR_F(be_ilpsched_irn_t *, 0);
 735         if (ba->n_interesting_nodes == 0) {
 736                 /* ignore */
 737         }
 738         else if (ba->n_interesting_nodes == 1) {
 739                 be_ilpsched_irn_t *node = get_ilpsched_irn(env, ba->head_ilp_nodes);
 740
 741                 /* add the single node */
 742                 ARR_APP1(be_ilpsched_irn_t *, sched_nodes, node);
 743         }
 744         else {
 745                 /* check all nodes for their positive solution */
 746                 foreach_linked_irns(ba->head_ilp_nodes, irn) {
 747                         be_ilpsched_irn_t    *node;
 748                         ilpsched_node_attr_t *na;
 749                         int                  tp_idx, found;
 750                         unsigned             cur_var, t;
 751
 752                         node    = get_ilpsched_irn(env, irn);
 753                         na      = get_ilpsched_node_attr(node);
 754                         cur_var = 0;
 755                         found   = 0;
 756
 757                         /* go over all variables of a node until the non-zero one is found */
 758                         for (tp_idx = na->n_unit_types - 1; ! found && tp_idx >= 0; --tp_idx) {
 759                                 for (t = na->asap - 1; ! found && t <= na->alap - 1; ++t) {
 760                                         double val = lpp_get_var_sol(lpp, na->ilp_vars.x[cur_var++]);
 761
 762                                         /* check, if variable is set to one (it's not zero then :) */
 763                                         if (! LPP_VALUE_IS_0(val)) {
 764                                                 na->sched_point = t;
 765                                                 ARR_APP1(be_ilpsched_irn_t *, sched_nodes, node);
 766                                                 DBG((env->dbg, LEVEL_2, "Schedpoint of %+F is %u at unit type %s\n",
 767                                                         irn, t, na->type_info[tp_idx].tp->name));
 768                                                 found = 1;
 769                                         }
 770                                 }
 771                         }
 772                 }
 773
 774                 glob_heights = env->height;
 775                 /* sort nodes ascending by scheduling time step */
 776                 qsort(sched_nodes, ARR_LEN(sched_nodes), sizeof(sched_nodes[0]), cmp_ilpsched_irn);
 777         }
 778
 779         /* make all Phis ready and remember the single cf op */
 780         cfop = NULL;
 781         foreach_out_edge(block, edge) {
 782                 irn = get_edge_src_irn(edge);
 783
 784                 switch (get_irn_opcode(irn)) {
 785                         case iro_Phi:
 786                                 add_to_sched(env, block, irn, 0);
 787                                 break;
 788                         case iro_Start:
 789                         case iro_End:
 790                         case iro_Proj:
 791                         case iro_Bad:
 792                         case iro_Unknown:
 793                                 break;
 794                         default:
 795                                 if (is_cfop(irn)) {
 796                                         assert(cfop == NULL && "Highlander - there can be only one");
 797                                         cfop = irn;
 798                                 }
 799                         break;
 800                 }
 801         }
 802
 803         /* add all nodes from list */
 804         for (i = 0, l = ARR_LEN(sched_nodes); i < l; ++i) {
 805                 ilpsched_node_attr_t *na = get_ilpsched_node_attr(sched_nodes[i]);
 806                 if (sched_nodes[i]->irn != cfop)
 807                         add_to_sched(env, block, sched_nodes[i]->irn, na->sched_point);
 808         }
 809
 810         /* schedule control flow node if not already done */
 811         if (cfop && ! sched_is_scheduled(cfop))
 812                 add_to_sched(env, block, cfop, 0);
 813
 814         DEL_ARR_F(sched_nodes);
 815 }
 816
 817 /***************************************************************
 818  *   _____ _      _____     _____           _   _
 819  *  |_   _| |    |  __ \   / ____|         | | (_)
 820  *    | | | |    | |__) | | (___   ___  ___| |_ _  ___  _ __
 821  *    | | | |    |  ___/   \___ \ / _ \/ __| __| |/ _ \| '_ \
 822  *   _| |_| |____| |       ____) |  __/ (__| |_| | (_) | | | |
 823  *  |_____|______|_|      |_____/ \___|\___|\__|_|\___/|_| |_|
 824  *
 825  ***************************************************************/
 826
 827 /**
 828  * Check if node can be executed on given unit type.
 829  */
 830 static INLINE int is_valid_unit_type_for_node(const be_execution_unit_type_t *tp, be_ilpsched_irn_t *node) {
 831         int                  i;
 832         ilpsched_node_attr_t *na = get_ilpsched_node_attr(node);
 833
 834         for (i = na->n_unit_types - 1; i >= 0; --i) {
 835                 if (na->type_info[i].tp == tp)
 836                         return i;
 837         }
 838
 839         return -1;
 840 }
 841
 842 /************************************************
 843  *                   _       _     _
 844  *                  (_)     | |   | |
 845  *  __   ____ _ _ __ _  __ _| |__ | | ___  ___
 846  *  \ \ / / _` | '__| |/ _` | '_ \| |/ _ \/ __|
 847  *   \ V / (_| | |  | | (_| | |_) | |  __/\__ \
 848  *    \_/ \__,_|_|  |_|\__,_|_.__/|_|\___||___/
 849  *
 850  ************************************************/
 851
 852 /**
 853  * Create the following variables:
 854  * - x_{nt}^k    binary     weigthed with: t
 855  *      node n is scheduled at time step t to unit type k
 856  * ==>> These variables represent the schedule
 857  *
 858  * - d_{nt}^k    binary     weighted with: t
 859  *      node n dies at time step t on unit type k
 860  * - a_{nt}^k    binary     weighted with num_nodes
 861  *      node n is alive at time step t on unit type k
 862  *
 863  * - y_{nt}^k    binary     weighted with: num_nodes^2
 864  *      node n is scheduled at time step t to unit type k
 865  *      although all units of this type are occupied
 866  * ==>> These variables represent the register pressure
 867  *
 868  */
 869 static void create_variables(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn_t *block_node, struct obstack *var_obst) {
 870         char                  buf[1024];
 871         ir_node               *irn;
 872         unsigned              num_block_var, num_nodes;
 873         ilpsched_block_attr_t *ba      = get_ilpsched_block_attr(block_node);
 874         unsigned              weigth_y = ba->n_interesting_nodes * ba->n_interesting_nodes;
 875 #ifdef WITH_LIBCORE
 876         lc_timer_t            *t_var   = lc_timer_register("beilpsched_var", "create ilp variables");
 877 #endif /* WITH_LIBCORE */
 878
 879         ilp_timer_push(t_var);
 880         num_block_var = num_nodes = 0;
 881         foreach_linked_irns(ba->head_ilp_nodes, irn) {
 882                 const be_execution_unit_t ***execunits = arch_isa_get_allowed_execution_units(env->arch_env->isa, irn);
 883                 be_ilpsched_irn_t         *node;
 884                 ilpsched_node_attr_t      *na;
 885                 unsigned                  n_unit_types, tp_idx, unit_idx, n_var, cur_unit;
 886                 unsigned                  cur_var_ad, cur_var_x, cur_var_y, num_ad;
 887
 888                 /* count number of available unit types for this node */
 889                 for (n_unit_types = 0; execunits[n_unit_types]; ++n_unit_types)
 890                         /* just count */ ;
 891
 892                 node = get_ilpsched_irn(env, irn);
 893                 na   = get_ilpsched_node_attr(node);
 894
 895                 na->n_unit_types = n_unit_types;
 896                 na->type_info    = NEW_ARR_D(unit_type_info_t, var_obst, n_unit_types);
 897
 898                 /* fill the type info array */
 899                 for (tp_idx = 0; tp_idx < n_unit_types; ++tp_idx) {
 900                         for (unit_idx = 0; execunits[tp_idx][unit_idx]; ++unit_idx) {
 901                                 /* beware: we also count number of available units here */
 902                                 if (be_machine_is_dummy_unit(execunits[tp_idx][unit_idx]))
 903                                         na->is_dummy_node = 1;
 904                         }
 905
 906                         na->type_info[tp_idx].tp      = execunits[tp_idx][0]->tp;
 907                         na->type_info[tp_idx].n_units = unit_idx;
 908                 }
 909
 910                 /* allocate space for ilp variables */
 911                 na->ilp_vars.x = NEW_ARR_D(int, var_obst, n_unit_types * VALID_SCHED_INTERVAL(na));
 912                 memset(na->ilp_vars.x, -1, ARR_LEN(na->ilp_vars.x) * sizeof(na->ilp_vars.x[0]));
 913
 914                 /* we need these variables only for "real" nodes */
 915                 if (! na->is_dummy_node) {
 916                         na->ilp_vars.y = NEW_ARR_D(int, var_obst, n_unit_types * VALID_SCHED_INTERVAL(na));
 917                         memset(na->ilp_vars.y, -1, ARR_LEN(na->ilp_vars.y) * sizeof(na->ilp_vars.y[0]));
 918
 919                         num_ad = ba->max_steps - na->asap + 1;
 920
 921                         if (ba->n_interesting_nodes > env->opts->limit_dead) {
 922                                 na->ilp_vars.a = NEW_ARR_D(int, var_obst, n_unit_types * num_ad);
 923                                 memset(na->ilp_vars.a, -1, ARR_LEN(na->ilp_vars.a) * sizeof(na->ilp_vars.a[0]));
 924                         }
 925                         else {
 926                                 na->ilp_vars.d = NEW_ARR_D(int, var_obst, n_unit_types * num_ad);
 927                                 memset(na->ilp_vars.d, -1, ARR_LEN(na->ilp_vars.d) * sizeof(na->ilp_vars.d[0]));
 928                         }
 929                 }
 930
 931                 DBG((env->dbg, LEVEL_3, "\thandling %+F (asap %u, alap %u, unit types %u):\n",
 932                         irn, na->asap, na->alap, na->n_unit_types));
 933
 934                 cur_var_x = cur_var_ad = cur_var_y = cur_unit = n_var = 0;
 935                 /* create variables */
 936                 for (tp_idx = 0; tp_idx < n_unit_types; ++tp_idx) {
 937                         unsigned t;
 938
 939                         for (t = na->asap - 1; t <= na->alap - 1; ++t) {
 940                                 /* x_{nt}^k variables */
 941                                 snprintf(buf, sizeof(buf), "x_n%u_%s_%u",
 942                                         get_irn_idx(irn), na->type_info[tp_idx].tp->name, t);
 943                                 na->ilp_vars.x[cur_var_x++] = lpp_add_var(lpp, buf, lpp_binary, (double)(t + 1));
 944                                 DBG((env->dbg, LEVEL_4, "\t\tcreated ILP variable %s\n", buf));
 945                                 /* variable counter */
 946                                 n_var++;
 947                                 num_block_var++;
 948
 949                                 if (! na->is_dummy_node) {
 950                                         /* y_{nt}^k variables */
 951                                         snprintf(buf, sizeof(buf), "y_n%u_%s_%u",
 952                                                 get_irn_idx(irn), na->type_info[tp_idx].tp->name, t);
 953                                         na->ilp_vars.y[cur_var_y++] = lpp_add_var(lpp, buf, lpp_binary, (double)(weigth_y));
 954                                         DBG((env->dbg, LEVEL_4, "\t\tcreated ILP variable %s\n", buf));
 955
 956                                         /* variable counter */
 957                                         n_var++;
 958                                         num_block_var++;
 959                                 }
 960                         }
 961
 962                         /* a node can die at any step t: asap(n) <= t <= U */
 963                         if (! na->is_dummy_node) {
 964                                 for (t = na->asap - 1; t <= ba->max_steps; ++t) {
 965
 966                                         if (ba->n_interesting_nodes > env->opts->limit_dead) {
 967                                                 /* a_{nt}^k variables */
 968                                                 snprintf(buf, sizeof(buf), "a_n%u_%s_%u",
 969                                                         get_irn_idx(irn), na->type_info[tp_idx].tp->name, t);
 970                                                 na->ilp_vars.a[cur_var_ad++] = lpp_add_var(lpp, buf, lpp_binary, (double)(ba->n_interesting_nodes));
 971                                         }
 972                                         else {
 973                                                 /* d_{nt}^k variables */
 974                                                 snprintf(buf, sizeof(buf), "d_n%u_%s_%u",
 975                                                         get_irn_idx(irn), na->type_info[tp_idx].tp->name, t);
 976                                                 na->ilp_vars.d[cur_var_ad++] = lpp_add_var(lpp, buf, lpp_binary, (double)(t + 1));
 977                                         }
 978                                         DBG((env->dbg, LEVEL_4, "\t\tcreated ILP variable %s\n", buf));
 979
 980                                         /* variable counter */
 981                                         n_var++;
 982                                         num_block_var++;
 983                                 }
 984                         }
 985                 }
 986
 987                 DB((env->dbg, LEVEL_3, "%u variables created\n", n_var));
 988                 num_nodes++;
 989         }
 990         ilp_timer_pop();
 991         DBG((env->dbg, LEVEL_1, "... %u variables for %u nodes created (%g sec)\n",
 992                 num_block_var, num_nodes, ilp_timer_elapsed_usec(t_var) / 1000000.0));
 993 }
 994
 995 /*******************************************************
 996  *                      _             _       _
 997  *                     | |           (_)     | |
 998  *   ___ ___  _ __  ___| |_ _ __ __ _ _ _ __ | |_ ___
 999  *  / __/ _ \| '_ \/ __| __| '__/ _` | | '_ \| __/ __|
1000  * | (_| (_) | | | \__ \ |_| | | (_| | | | | | |_\__ \
1001  *  \___\___/|_| |_|___/\__|_|  \__,_|_|_| |_|\__|___/
1002  *
1003  *******************************************************/
1004
1005 /**
1006  * Create following ILP constraints:
1007  * - the assignment constraints:
1008  *     assure each node is executed once by exactly one (allowed) execution unit
1009  * - the dead node assignment constraints:
1010  *     assure a node can only die at most once
1011  * - the precedence constraints:
1012  *     assure that no data dependencies are violated
1013  */
1014 static void create_assignment_and_precedence_constraints(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn_t *block_node) {
1015         unsigned              num_cst_assign, num_cst_prec, num_cst_dead;
1016         char                  buf[1024];
1017         ir_node               *irn;
1018         ilpsched_block_attr_t *ba            = get_ilpsched_block_attr(block_node);
1019         bitset_t              *bs_block_irns = bitset_alloca(ba->block_last_idx);
1020 #ifdef WITH_LIBCORE
1021         lc_timer_t            *t_cst_assign  = lc_timer_register("beilpsched_cst_assign",      "create assignment constraints");
1022         lc_timer_t            *t_cst_dead    = lc_timer_register("beilpsched_cst_assign_dead", "create dead node assignment constraints");
1023         lc_timer_t            *t_cst_prec    = lc_timer_register("beilpsched_cst_prec",        "create precedence constraints");
1024 #endif /* WITH_LIBCORE */
1025
1026         num_cst_assign = num_cst_prec = num_cst_dead = 0;
1027         foreach_linked_irns(ba->head_ilp_nodes, irn) {
1028                 int                  cst, tp_idx, i;
1029                 unsigned             cur_var;
1030                 be_ilpsched_irn_t    *node;
1031                 ilpsched_node_attr_t *na;
1032
1033                 node    = get_ilpsched_irn(env, irn);
1034                 na      = get_ilpsched_node_attr(node);
1035                 cur_var = 0;
1036
1037                 /* the assignment constraint */
1038                 ilp_timer_push(t_cst_assign);
1039                 snprintf(buf, sizeof(buf), "assignment_cst_n%u", get_irn_idx(irn));
1040                 cst = lpp_add_cst_uniq(lpp, buf, lpp_equal, 1.0);
1041                 DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1042                 num_cst_assign++;
1043
1044                 lpp_set_factor_fast_bulk(lpp, cst, na->ilp_vars.x, ARR_LEN(na->ilp_vars.x), 1.0);
1045                 ilp_timer_pop();
1046
1047                 /* the dead node assignment constraint */
1048                 if (! na->is_dummy_node && ba->n_interesting_nodes <= env->opts->limit_dead) {
1049                         ilp_timer_push(t_cst_dead);
1050                         snprintf(buf, sizeof(buf), "dead_node_assign_cst_n%u", get_irn_idx(irn));
1051                         cst = lpp_add_cst_uniq(lpp, buf, lpp_less, 1.0);
1052                         DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1053
1054                         lpp_set_factor_fast_bulk(lpp, cst, na->ilp_vars.d, ARR_LEN(na->ilp_vars.d), 1.0);
1055                         ilp_timer_pop();
1056                 }
1057
1058                 /* We have separate constraints for Projs and Keeps */
1059                 // ILP becomes infeasible ?!?
1060 //              if (is_Proj(irn) || be_is_Keep(irn))
1061 //                      continue;
1062
1063                 /* the precedence constraints */
1064                 ilp_timer_push(t_cst_prec);
1065                 bs_block_irns = bitset_clear_all(bs_block_irns);
1066                 for (i = get_irn_ins_or_deps(irn) - 1; i >= 0; --i) {
1067                         ir_node              *pred = skip_normal_Proj(env->arch_env->isa, get_irn_in_or_dep(irn, i));
1068                         unsigned             t_low, t_high, t;
1069                         be_ilpsched_irn_t    *pred_node;
1070                         ilpsched_node_attr_t *pna;
1071                         unsigned             delay;
1072
1073                         if (is_Phi(pred) || block_node->irn != get_nodes_block(pred) || is_NoMem(pred))
1074                                 continue;
1075
1076                         pred_node = get_ilpsched_irn(env, pred);
1077                         pna       = get_ilpsched_node_attr(pred_node);
1078
1079                         assert(pna->asap > 0 && pna->alap >= pna->asap && "Invalid scheduling interval.");
1080
1081                         if (! bitset_is_set(bs_block_irns, pna->block_idx))
1082                                 bitset_set(bs_block_irns, pna->block_idx);
1083                         else
1084                                 continue;
1085
1086                         /* irn = n, pred = m */
1087                         delay  = fixed_latency(env->sel, pred, env->block_env);
1088                         t_low  = MAX(na->asap, pna->asap + delay - 1);
1089                         t_high = MIN(na->alap, pna->alap + delay - 1);
1090                         for (t = t_low - 1; t <= t_high - 1; ++t) {
1091                                 unsigned tn, tm;
1092                                 int      *tmp_var_idx = NEW_ARR_F(int, 0);
1093
1094                                 snprintf(buf, sizeof(buf), "precedence_n%u_n%u_%u", get_irn_idx(pred), get_irn_idx(irn), t);
1095                                 cst = lpp_add_cst_uniq(lpp, buf, lpp_less, 1.0);
1096                                 DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1097                                 num_cst_prec++;
1098
1099                                 /* lpp_set_factor_fast_bulk needs variables sorted ascending by index */
1100                                 if (na->ilp_vars.x[0] < pna->ilp_vars.x[0]) {
1101                                         /* node variables have smaller index than pred variables */
1102                                         for (tp_idx = na->n_unit_types - 1; tp_idx >= 0; --tp_idx) {
1103                                                 for (tn = na->asap - 1; tn <= t; ++tn) {
1104                                                         unsigned idx = ILPVAR_IDX(na, tp_idx, tn);
1105                                                         ARR_APP1(int, tmp_var_idx, na->ilp_vars.x[idx]);
1106                                                 }
1107                                         }
1108
1109                                         for (tp_idx = pna->n_unit_types - 1; tp_idx >= 0; --tp_idx) {
1110                                                 for (tm = t - delay + 1; tm < pna->alap; ++tm) {
1111                                                         unsigned idx = ILPVAR_IDX(pna, tp_idx, tm);
1112                                                         ARR_APP1(int, tmp_var_idx, pna->ilp_vars.x[idx]);
1113                                                 }
1114                                         }
1115                                 }
1116                                 else {
1117                                         /* pred variables have smaller index than node variables */
1118                                         for (tp_idx = pna->n_unit_types - 1; tp_idx >= 0; --tp_idx) {
1119                                                 for (tm = t - delay + 1; tm < pna->alap; ++tm) {
1120                                                         unsigned idx = ILPVAR_IDX(pna, tp_idx, tm);
1121                                                         ARR_APP1(int, tmp_var_idx, pna->ilp_vars.x[idx]);
1122                                                 }
1123                                         }
1124
1125                                         for (tp_idx = na->n_unit_types - 1; tp_idx >= 0; --tp_idx) {
1126                                                 for (tn = na->asap - 1; tn <= t; ++tn) {
1127                                                         unsigned idx = ILPVAR_IDX(na, tp_idx, tn);
1128                                                         ARR_APP1(int, tmp_var_idx, na->ilp_vars.x[idx]);
1129                                                 }
1130                                         }
1131                                 }
1132
1133                                 if (ARR_LEN(tmp_var_idx) > 0)
1134                                         lpp_set_factor_fast_bulk(lpp, cst, tmp_var_idx, ARR_LEN(tmp_var_idx), 1.0);
1135
1136                                 DEL_ARR_F(tmp_var_idx);
1137                         }
1138                 }
1139                 ilp_timer_pop();
1140         }
1141         DBG((env->dbg, LEVEL_1, "\t%u assignement constraints (%g sec)\n",
1142                 num_cst_assign, ilp_timer_elapsed_usec(t_cst_assign) / 1000000.0));
1143         DBG((env->dbg, LEVEL_1, "\t%u precedence constraints (%g sec)\n",
1144                 num_cst_prec, ilp_timer_elapsed_usec(t_cst_prec) / 1000000.0));
1145 }
1146
1147 /**
1148  * Create ILP resource constraints:
1149  * - assure that for each time step not more instructions are scheduled
1150  *   to the same unit types as units of this type are available
1151  */
1152 static void create_ressource_constraints(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn_t *block_node) {
1153         int                   glob_type_idx;
1154         char                  buf[1024];
1155         unsigned              num_cst_resrc = 0;
1156         ilpsched_block_attr_t *ba           = get_ilpsched_block_attr(block_node);
1157 #ifdef WITH_LIBCORE
1158         lc_timer_t            *t_cst_rsrc   = lc_timer_register("beilpsched_cst_rsrc",   "create resource constraints");
1159 #endif /* WITH_LIBCORE */
1160
1161         ilp_timer_push(t_cst_rsrc);
1162         for (glob_type_idx = env->cpu->n_unit_types - 1; glob_type_idx >= 0; --glob_type_idx) {
1163                 unsigned                 t;
1164                 be_execution_unit_type_t *cur_tp = &env->cpu->unit_types[glob_type_idx];
1165
1166                 /* BEWARE: the DUMMY unit type is not in CPU, so it's skipped automatically */
1167
1168                 /* check each time step */
1169                 for (t = 0; t < ba->max_steps; ++t) {
1170                         ir_node *irn;
1171                         int     cst;
1172                         int     *tmp_var_idx = NEW_ARR_F(int, 0);
1173
1174                         snprintf(buf, sizeof(buf), "resource_cst_%s_%u", cur_tp->name, t);
1175                         cst = lpp_add_cst_uniq(lpp, buf, lpp_less, (double)cur_tp->n_units);
1176                         DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1177                         num_cst_resrc++;
1178
1179                         foreach_linked_irns(ba->head_ilp_nodes, irn) {
1180                                 be_ilpsched_irn_t    *node = get_ilpsched_irn(env, irn);
1181                                 ilpsched_node_attr_t *na   = get_ilpsched_node_attr(node);
1182                                 int                  tp_idx;
1183
1184                                 tp_idx = is_valid_unit_type_for_node(cur_tp, node);
1185
1186                                 if (tp_idx >= 0 && t >= na->asap - 1 && t <= na->alap - 1) {
1187                                         int cur_var = ILPVAR_IDX(na, tp_idx, t);
1188                                         ARR_APP1(int, tmp_var_idx, na->ilp_vars.x[cur_var]);
1189                                 }
1190                         }
1191
1192                         /* set constraints if we have some */
1193                         if (ARR_LEN(tmp_var_idx) > 0)
1194                                 lpp_set_factor_fast_bulk(lpp, cst, tmp_var_idx, ARR_LEN(tmp_var_idx), 1.0);
1195
1196                         DEL_ARR_F(tmp_var_idx);
1197                 }
1198         }
1199         ilp_timer_pop();
1200         DBG((env->dbg, LEVEL_1, "\t%u resource constraints (%g sec)\n",
1201                 num_cst_resrc, ilp_timer_elapsed_usec(t_cst_rsrc) / 1000000.0));
1202 }
1203
1204 /**
1205  * Create ILP bundle constraints:
1206  * - assure, at most bundle_size * bundles_per_cycle instructions
1207  *   can be started at a certain point.
1208  */
1209 static void create_bundle_constraints(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn_t *block_node) {
1210         char                  buf[1024];
1211         unsigned              t;
1212         unsigned              num_cst_bundle = 0;
1213         unsigned              n_instr_max    = env->cpu->bundle_size * env->cpu->bundels_per_cycle;
1214         ilpsched_block_attr_t *ba            = get_ilpsched_block_attr(block_node);
1215 #ifdef WITH_LIBCORE
1216         lc_timer_t            *t_cst_bundle  = lc_timer_register("beilpsched_cst_bundle", "create bundle constraints");
1217 #endif /* WITH_LIBCORE */
1218
1219         ilp_timer_push(t_cst_bundle);
1220         for (t = 0; t < ba->max_steps; ++t) {
1221                 ir_node *irn;
1222                 int     cst;
1223                 int     *tmp_var_idx = NEW_ARR_F(int, 0);
1224
1225                 snprintf(buf, sizeof(buf), "bundle_cst_%u", t);
1226                 cst = lpp_add_cst_uniq(lpp, buf, lpp_less, (double)n_instr_max);
1227                 DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1228                 num_cst_bundle++;
1229
1230                 foreach_linked_irns(ba->head_ilp_nodes, irn) {
1231                         be_ilpsched_irn_t    *node;
1232                         ilpsched_node_attr_t *na;
1233                         int                  tp_idx;
1234
1235                         /* Projs and Keeps do not contribute to bundle size */
1236                         if (is_Proj(irn) || be_is_Keep(irn))
1237                                 continue;
1238
1239                         node = get_ilpsched_irn(env, irn);
1240                         na   = get_ilpsched_node_attr(node);
1241
1242                         /* nodes assigned to DUMMY unit do not contribute to bundle size */
1243                         if (na->is_dummy_node)
1244                                 continue;
1245
1246                         if (t >= na->asap - 1 && t <= na->alap - 1) {
1247                                 for (tp_idx = na->n_unit_types - 1; tp_idx >= 0; --tp_idx) {
1248                                         int idx = ILPVAR_IDX(na, tp_idx, t);
1249                                         ARR_APP1(int, tmp_var_idx, na->ilp_vars.x[idx]);
1250                                 }
1251                         }
1252                 }
1253
1254                 if (ARR_LEN(tmp_var_idx) > 0)
1255                         lpp_set_factor_fast_bulk(lpp, cst, tmp_var_idx, ARR_LEN(tmp_var_idx), 1.0);
1256
1257                 DEL_ARR_F(tmp_var_idx);
1258         }
1259         ilp_timer_pop();
1260         DBG((env->dbg, LEVEL_1, "\t%u bundle constraints (%g sec)\n",
1261                 num_cst_bundle, ilp_timer_elapsed_usec(t_cst_bundle) / 1000000.0));
1262 }
1263
1264 /**
1265  * Create ILP dying nodes constraints:
1266  * - set variable d_{nt}^k to 1 if nodes n dies at step t on unit k
1267  */
1268 static void create_dying_nodes_constraint(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn_t *block_node) {
1269         char                  buf[1024];
1270         unsigned              t;
1271         unsigned              num_cst = 0;
1272         ilpsched_block_attr_t *ba     = get_ilpsched_block_attr(block_node);
1273 #ifdef WITH_LIBCORE
1274         lc_timer_t            *t_cst  = lc_timer_register("beilpsched_cst_dying_nodes", "create dying nodes constraints");
1275 #endif /* WITH_LIBCORE */
1276
1277         ilp_timer_push(t_cst);
1278         /* check all time_steps */
1279         for (t = 0; t < ba->max_steps; ++t) {
1280                 ir_node *irn;
1281
1282                 /* for all nodes */
1283                 foreach_linked_irns(ba->head_ilp_nodes, irn) {
1284                         be_ilpsched_irn_t    *node = get_ilpsched_irn(env, irn);
1285                         ilpsched_node_attr_t *na   = get_ilpsched_node_attr(node);
1286
1287                         /* if node has no consumer within current block, it cannot die here */
1288                         /* we also ignore nodes assigned to dummy unit */
1289                         if (ARR_LEN(na->block_consumer) < 1 || na->is_dummy_node)
1290                                 continue;
1291
1292                         /* node can only die here if t at least asap(n) */
1293                         if (t >= na->asap - 1) {
1294                                 int node_tp_idx;
1295
1296                                 /* for all unit types */
1297                                 for (node_tp_idx = na->n_unit_types - 1; node_tp_idx >= 0; --node_tp_idx) {
1298                                         int tp_idx, i, cst;
1299                                         int *tmp_var_idx = NEW_ARR_F(int, 0);
1300
1301                                         snprintf(buf, sizeof(buf), "dying_node_cst_%u_n%u", t, get_irn_idx(irn));
1302                                         cst = lpp_add_cst_uniq(lpp, buf, lpp_less, (double)(na->n_consumer - 1));
1303                                         DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1304                                         num_cst++;
1305
1306                                         /* number of consumer scheduled till t */
1307                                         for (i = ARR_LEN(na->block_consumer) - 1; i >= 0; --i) {
1308                                                 be_ilpsched_irn_t    *cons = get_ilpsched_irn(env, na->block_consumer[i]);
1309                                                 ilpsched_node_attr_t *ca   = get_ilpsched_node_attr(cons);
1310
1311                                                 for (tp_idx = ca->n_unit_types - 1; tp_idx >= 0; --tp_idx) {
1312                                                         unsigned tm;
1313
1314                                                         for (tm = ca->asap - 1; tm <= t && tm <= ca->alap - 1; ++tm) {
1315                                                                 int idx = ILPVAR_IDX(ca, tp_idx, tm);
1316                                                                 ARR_APP1(int, tmp_var_idx, ca->ilp_vars.x[idx]);
1317                                                         }
1318                                                 }
1319                                         }
1320
1321                                         /* could be that no consumer can be scheduled at this point */
1322                                         if (ARR_LEN(tmp_var_idx)) {
1323                                                 int      idx;
1324                                                 unsigned tn;
1325
1326                                                 /* subtract possible prior kill points */
1327                                                 for (tn = na->asap - 1; tn < t; ++tn) {
1328                                                         idx = ILPVAR_IDX_DEAD(ba, na, node_tp_idx, tn);
1329                                                         lpp_set_factor_fast(lpp, cst, na->ilp_vars.d[idx], -1.0);
1330                                                 }
1331
1332                                                 idx = ILPVAR_IDX_DEAD(ba, na, node_tp_idx, t);
1333                                                 lpp_set_factor_fast(lpp, cst, na->ilp_vars.d[idx], 0.0 - (double)(na->n_consumer));
1334                                                 lpp_set_factor_fast_bulk(lpp, cst, tmp_var_idx, ARR_LEN(tmp_var_idx), 1.0);
1335                                         }
1336
1337                                         DEL_ARR_F(tmp_var_idx);
1338                                 }
1339                         }
1340
1341                 }
1342         }
1343         ilp_timer_pop();
1344         DBG((env->dbg, LEVEL_1, "\t%u dying nodes constraints (%g sec)\n",
1345                 num_cst, ilp_timer_elapsed_usec(t_cst) / 1000000.0));
1346 }
1347
1348 /**
1349 * Create ILP alive nodes constraints:
1350 * - set variable a_{nt}^k to 1 if nodes n is alive at step t on unit k
1351 */
1352 static void create_alive_nodes_constraint(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn_t *block_node) {
1353         char                  buf[1024];
1354         ir_node               *irn;
1355         unsigned              num_cst = 0;
1356         ilpsched_block_attr_t *ba     = get_ilpsched_block_attr(block_node);
1357 #ifdef WITH_LIBCORE
1358         lc_timer_t            *t_cst  = lc_timer_register("beilpsched_cst_alive_nodes", "create alive nodes constraints");
1359 #endif /* WITH_LIBCORE */
1360
1361         ilp_timer_push(t_cst);
1362         /* for each node */
1363         foreach_linked_irns(ba->head_ilp_nodes, irn) {
1364                 be_ilpsched_irn_t    *node = get_ilpsched_irn(env, irn);
1365                 ilpsched_node_attr_t *na   = get_ilpsched_node_attr(node);
1366                 unsigned             t;
1367
1368                 /* we ignore nodes assigned to dummy unit here */
1369                 if (na->is_dummy_node)
1370                         continue;
1371
1372                 /* check check all time steps: asap(n) <= t <= U */
1373                 for (t = na->asap - 1; t < ba->max_steps; ++t) {
1374                         int node_tp_idx;
1375
1376                         /* for all unit types available for this node */
1377                         for (node_tp_idx = na->n_unit_types - 1; node_tp_idx >= 0; --node_tp_idx) {
1378                                 unsigned tn, tn_max, idx;
1379                                 int      cst, i;
1380                                 int      *tmp_var_idx_n = NEW_ARR_F(int, 0);
1381                                 int      *tmp_var_idx_m = NEW_ARR_F(int, 0);
1382
1383                                 snprintf(buf, sizeof(buf), "alive_node_cst_%u_n%u_%s",
1384                                         t, get_irn_idx(irn), na->type_info[node_tp_idx].tp->name);
1385                                 cst = lpp_add_cst_uniq(lpp, buf, lpp_less, 0.0);
1386                                 DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1387                                 num_cst++;
1388
1389                                 tn_max = MIN(na->alap - 1, t);
1390                                 /* check if the node has been scheduled so far */
1391                                 for (tn = na->asap - 1; tn <= tn_max; ++tn) {
1392                                         int idx = ILPVAR_IDX(na, node_tp_idx, tn);
1393                                         ARR_APP1(int, tmp_var_idx_n, na->ilp_vars.x[idx]);
1394                                 }
1395
1396                                 if (ARR_LEN(tmp_var_idx_n) > 0)
1397                                         lpp_set_factor_fast_bulk(lpp, cst, tmp_var_idx_n, ARR_LEN(tmp_var_idx_n), (double)(na->n_consumer));
1398                                 DEL_ARR_F(tmp_var_idx_n);
1399
1400                                 /* subtract the number of consumer scheduled so far */
1401                                 for (i = ARR_LEN(na->block_consumer) - 1; i >= 0; --i) {
1402                                         be_ilpsched_irn_t    *cons = get_ilpsched_irn(env, na->block_consumer[i]);
1403                                         ilpsched_node_attr_t *ca   = get_ilpsched_node_attr(cons);
1404                                         int                  tp_idx;
1405                                         unsigned             tm, tm_max;
1406
1407                                         tm_max = MIN(ca->alap - 1, t);
1408                                         for (tp_idx = ca->n_unit_types - 1; tp_idx >= 0; --tp_idx) {
1409                                                 for (tm = ca->asap - 1; tm <= tm_max; ++tm) {
1410                                                         int idx = ILPVAR_IDX(ca, tp_idx, tm);
1411                                                         ARR_APP1(int, tmp_var_idx_m, ca->ilp_vars.x[idx]);
1412                                                 }
1413                                         }
1414                                 }
1415
1416                                 if (ARR_LEN(tmp_var_idx_m) > 0)
1417                                         lpp_set_factor_fast_bulk(lpp, cst, tmp_var_idx_m, ARR_LEN(tmp_var_idx_m), -1.0);
1418                                 DEL_ARR_F(tmp_var_idx_m);
1419
1420                                 /* -c * a_{nt}^k */
1421                                 idx = ILPVAR_IDX_DEAD(ba, na, node_tp_idx, t);
1422                                 lpp_set_factor_fast(lpp, cst, na->ilp_vars.a[idx], 0.0 - (double)(na->n_consumer));
1423
1424                         }
1425                 }
1426         }
1427         ilp_timer_pop();
1428         DBG((env->dbg, LEVEL_1, "\t%u alive nodes constraints (%g sec)\n",
1429                 num_cst, ilp_timer_elapsed_usec(t_cst) / 1000000.0));
1430 }
1431
1432 /**
1433  * Create ILP pressure constraints, based on dead nodes:
1434  * - add additional costs to objective function if a node is scheduled
1435  *   on a unit although all units of this type are currently occupied
1436  */
1437 static void create_pressure_dead_constraint(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn_t *block_node) {
1438         char                  buf[1024];
1439         ir_node               *cur_irn;
1440         unsigned              num_cst = 0;
1441         ilpsched_block_attr_t *ba     = get_ilpsched_block_attr(block_node);
1442 #ifdef WITH_LIBCORE
1443         lc_timer_t            *t_cst  = lc_timer_register("beilpsched_cst_pressure", "create pressure constraints");
1444 #endif /* WITH_LIBCORE */
1445
1446         ilp_timer_push(t_cst);
1447         /* y_{nt}^k is set for each node and timestep and unit type */
1448         foreach_linked_irns(ba->head_ilp_nodes, cur_irn) {
1449                 unsigned             cur_idx   = get_irn_idx(cur_irn);
1450                 be_ilpsched_irn_t    *cur_node = get_ilpsched_irn(env, cur_irn);
1451                 ilpsched_node_attr_t *cur_na   = get_ilpsched_node_attr(cur_node);
1452                 int                  glob_type_idx;
1453
1454                 /* we ignore nodes assigned to DUMMY unit here */
1455                 if (cur_na->is_dummy_node)
1456                         continue;
1457
1458                 /* for all types */
1459                 for (glob_type_idx = env->cpu->n_unit_types - 1; glob_type_idx >= 0; --glob_type_idx) {
1460                         be_execution_unit_type_t *cur_tp   = &env->cpu->unit_types[glob_type_idx];
1461                         int                      cur_tp_idx;
1462                         unsigned                 t;
1463
1464                         /* BEWARE: the DUMMY unit types is not in CPU, so it's skipped automatically */
1465
1466                         /* check if node can be executed on this unit type */
1467                         cur_tp_idx = is_valid_unit_type_for_node(cur_tp, cur_node);
1468                         if (cur_tp_idx < 0)
1469                                 continue;
1470
1471                         /* check all time_steps */
1472                         for (t = cur_na->asap - 1; t <= cur_na->alap - 1; ++t) {
1473                                 int     cst, y_idx;
1474                                 ir_node *irn;
1475                                 int     *tmp_idx_1  = NEW_ARR_F(int, 0);
1476                                 int     *tmp_idx_m1 = NEW_ARR_F(int, 0);
1477
1478                                 snprintf(buf, sizeof(buf), "pressure_cst_n%u_%u_%s", cur_idx, t, cur_tp->name);
1479                                 cst = lpp_add_cst_uniq(lpp, buf, lpp_less, (double)(cur_tp->n_units - 1));
1480                                 DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1481                                 num_cst++;
1482
1483                                 /*
1484                                         - accumulate all nodes scheduled on unit type k till t
1485                                         - subtract all nodes died on unit type k till t
1486                                 */
1487                                 foreach_linked_irns(ba->head_ilp_nodes, irn) {
1488                                         be_ilpsched_irn_t    *node = get_ilpsched_irn(env, irn);
1489                                         ilpsched_node_attr_t *na   = get_ilpsched_node_attr(node);
1490                                         unsigned             tn, tmax;
1491                                         int                  tp_idx;
1492
1493                                         tmax   = MIN(t, na->alap - 1);
1494                                         tp_idx = is_valid_unit_type_for_node(cur_tp, node);
1495
1496                                         /* current unit type is not suitable for current node */
1497                                         if (tp_idx < 0)
1498                                                 continue;
1499
1500                                         for (tn = na->asap - 1; tn <= tmax; ++tn) {
1501                                                 int idx;
1502
1503                                                 /* node scheduled */
1504                                                 idx = ILPVAR_IDX(na, tp_idx, tn);
1505                                                 ARR_APP1(int, tmp_idx_1, na->ilp_vars.x[idx]);
1506
1507                                                 /* node dead */
1508                                                 idx = ILPVAR_IDX_DEAD(ba, na, tp_idx, tn);
1509                                                 ARR_APP1(int, tmp_idx_m1, na->ilp_vars.d[idx]);
1510                                         }
1511                                 }
1512
1513                                 if (ARR_LEN(tmp_idx_1) > 0)
1514                                         lpp_set_factor_fast_bulk(lpp, cst, tmp_idx_1, ARR_LEN(tmp_idx_1), 1.0);
1515
1516                                 if (ARR_LEN(tmp_idx_m1) > 0)
1517                                         lpp_set_factor_fast_bulk(lpp, cst, tmp_idx_m1, ARR_LEN(tmp_idx_m1), -1.0);
1518
1519                                 /* BEWARE: t is unsigned, so (double)(-t) won't work */
1520                                 y_idx = ILPVAR_IDX(cur_na, cur_tp_idx, t);
1521                                 lpp_set_factor_fast(lpp, cst, cur_na->ilp_vars.y[y_idx], 0.0 - (double)(t));
1522
1523                                 DEL_ARR_F(tmp_idx_1);
1524                                 DEL_ARR_F(tmp_idx_m1);
1525                         }
1526                 }
1527         }
1528         ilp_timer_pop();
1529         DBG((env->dbg, LEVEL_1, "\t%u pressure constraints (%g sec)\n",
1530                 num_cst, ilp_timer_elapsed_usec(t_cst) / 1000000.0));
1531 }
1532
1533 /**
1534  * Create ILP pressure constraints, based on alive nodes:
1535  * - add additional costs to objective function if a node is scheduled
1536  *   on a unit although all units of this type are currently occupied
1537  */
1538 static void create_pressure_alive_constraint(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn_t *block_node) {
1539         char                  buf[1024];
1540         ir_node               *cur_irn;
1541         unsigned              num_cst = 0;
1542         ilpsched_block_attr_t *ba     = get_ilpsched_block_attr(block_node);
1543 #ifdef WITH_LIBCORE
1544         lc_timer_t            *t_cst  = lc_timer_register("beilpsched_cst_pressure", "create pressure constraints");
1545 #endif /* WITH_LIBCORE */
1546
1547         ilp_timer_push(t_cst);
1548         /* y_{nt}^k is set for each node and timestep and unit type */
1549         foreach_linked_irns(ba->head_ilp_nodes, cur_irn) {
1550                 unsigned             cur_idx   = get_irn_idx(cur_irn);
1551                 be_ilpsched_irn_t    *cur_node = get_ilpsched_irn(env, cur_irn);
1552                 ilpsched_node_attr_t *cur_na   = get_ilpsched_node_attr(cur_node);
1553                 int                  glob_type_idx;
1554
1555                 /* we ignore nodes assigned to DUMMY unit here */
1556                 if (cur_na->is_dummy_node)
1557                         continue;
1558
1559                 /* for all types */
1560                 for (glob_type_idx = env->cpu->n_unit_types - 1; glob_type_idx >= 0; --glob_type_idx) {
1561                         be_execution_unit_type_t *cur_tp   = &env->cpu->unit_types[glob_type_idx];
1562                         int                      cur_tp_idx;
1563                         unsigned                 t;
1564
1565                         /* BEWARE: the DUMMY unit types is not in CPU, so it's skipped automatically */
1566
1567                         /* check if node can be executed on this unit type */
1568                         cur_tp_idx = is_valid_unit_type_for_node(cur_tp, cur_node);
1569                         if (cur_tp_idx < 0)
1570                                 continue;
1571
1572                         /* check all time_steps at which the current node can be scheduled */
1573                         for (t = cur_na->asap - 1; t <= cur_na->alap - 1; ++t) {
1574                                 int     cst, y_idx;
1575                                 ir_node *irn;
1576                                 int     *tmp_var_idx = NEW_ARR_F(int, 0);
1577
1578                                 snprintf(buf, sizeof(buf), "pressure_cst_n%u_%u_%s", cur_idx, t, cur_tp->name);
1579                                 cst = lpp_add_cst_uniq(lpp, buf, lpp_less, (double)(cur_tp->n_units - 1));
1580                                 DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1581                                 num_cst++;
1582
1583                                 /* - accumulate all nodes alive at point t on unit type k */
1584                                 foreach_linked_irns(ba->head_ilp_nodes, irn) {
1585                                         be_ilpsched_irn_t    *node = get_ilpsched_irn(env, irn);
1586                                         ilpsched_node_attr_t *na   = get_ilpsched_node_attr(node);
1587                                         int                  a_idx, tp_idx;
1588
1589                                         /* check if node can be alive here */
1590                                         if (t < na->asap - 1)
1591                                                 continue;
1592
1593                                         tp_idx = is_valid_unit_type_for_node(cur_tp, node);
1594
1595                                         /* current type is not suitable */
1596                                         if (tp_idx < 0)
1597                                                 continue;
1598
1599                                         a_idx = ILPVAR_IDX_DEAD(ba, na, tp_idx, t);
1600                                         ARR_APP1(int, tmp_var_idx, na->ilp_vars.a[a_idx]);
1601                                 }
1602
1603                                 if (ARR_LEN(tmp_var_idx) > 0)
1604                                         lpp_set_factor_fast_bulk(lpp, cst, tmp_var_idx, ARR_LEN(tmp_var_idx), 1.0);
1605                                 DEL_ARR_F(tmp_var_idx);
1606
1607                                 /* - num_nodes * y_{nt}^k */
1608                                 y_idx = ILPVAR_IDX(cur_na, cur_tp_idx, t);
1609                                 lpp_set_factor_fast(lpp, cst, cur_na->ilp_vars.y[y_idx], 0.0 - (double)(ba->n_interesting_nodes));
1610                         }
1611                 }
1612         }
1613         ilp_timer_pop();
1614         DBG((env->dbg, LEVEL_1, "\t%u pressure constraints (%g sec)\n",
1615                 num_cst, ilp_timer_elapsed_usec(t_cst) / 1000000.0));
1616 }
1617
1618 #if 0
1619 static void create_proj_keep_constraints(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn_t *block_node) {
1620         char                  buf[1024];
1621         ir_node               *irn;
1622         unsigned              num_cst = 0;
1623         ilpsched_block_attr_t *ba     = get_ilpsched_block_attr(block_node);
1624 #ifdef WITH_LIBCORE
1625         lc_timer_t            *t_cst  = lc_timer_register("beilpsched_cst_projkeep", "create proj and keep constraints");
1626 #endif /* WITH_LIBCORE */
1627
1628         ilp_timer_push(t_cst);
1629         /* check all nodes */
1630         foreach_linked_irns(ba->head_ilp_nodes, irn) {
1631                 be_ilpsched_irn_t    *node;
1632                 ilpsched_node_attr_t *na;
1633                 unsigned             t;
1634                 ir_node              **pk;
1635
1636                 /* only mode_T nodes can have Projs and Keeps assigned */
1637                 if (get_irn_mode(irn) != mode_T)
1638                         continue;
1639
1640                 node = get_ilpsched_irn(env, irn);
1641                 na   = get_ilpsched_node_attr(node);
1642
1643                 /* check if has some Projs and Keeps assigned */
1644                 if (! na->projkeeps)
1645                         continue;
1646
1647                 /* we can run only once over the queue, so preserve the nodes */
1648                 pk = NEW_ARR_F(ir_node *, 0);
1649                 while (! waitq_empty(na->projkeeps))
1650                         ARR_APP1(ir_node *, pk, waitq_get(na->projkeeps));
1651                 del_waitq(na->projkeeps);
1652                 na->projkeeps = NULL;
1653
1654                 /* for all time steps at which this node can be scheduled */
1655                 for (t = na->asap - 1; t <= na->alap - 1; ++t) {
1656                         int cst, tp_idx, i;
1657                         int *tmp_var_idx_n = NEW_ARR_F(int, 0);
1658
1659                         /* add the constraint, assure, that a node is always scheduled along with it's Projs and Keeps */
1660                         snprintf(buf, sizeof(buf), "projkeep_cst_n%u_%u", get_irn_idx(irn), t);
1661                         cst = lpp_add_cst_uniq(lpp, buf, lpp_equal, 0.0);
1662                         DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1663                         num_cst++;
1664
1665                         /* sum up scheduling variables for this time step */
1666                         for (tp_idx = na->n_unit_types - 1; tp_idx >= 0; --tp_idx) {
1667                                 int idx = ILPVAR_IDX(na, tp_idx, t);
1668                                 ARR_APP1(int, tmp_var_idx_n, na->ilp_vars.x[idx]);
1669                         }
1670
1671                         if (ARR_LEN(tmp_var_idx_n) > 0)
1672                                 lpp_set_factor_fast_bulk(lpp, cst, tmp_var_idx_n, ARR_LEN(tmp_var_idx_n), (double)(ARR_LEN(pk)));
1673                         DEL_ARR_F(tmp_var_idx_n);
1674
1675                         /* subtract all Proj and Keep variables for this step */
1676                         for (i = ARR_LEN(pk) - 1; i >= 0; --i) {
1677                                 be_ilpsched_irn_t    *pk_node = get_ilpsched_irn(env, pk[i]);
1678                                 ilpsched_node_attr_t *pk_na   = get_ilpsched_node_attr(pk_node);
1679                                 int                  pk_tp_idx;
1680
1681                                 for (pk_tp_idx = pk_na->n_unit_types - 1; pk_tp_idx >= 0; --pk_tp_idx) {
1682                                         int idx = ILPVAR_IDX(pk_na, pk_tp_idx, t);
1683                                         lpp_set_factor_fast(lpp, cst, pk_na->ilp_vars.x[idx], -1.0);
1684                                 }
1685                         }
1686                 }
1687         }
1688         ilp_timer_pop();
1689         DBG((env->dbg, LEVEL_1, "\t%u Proj and Keep constraints (%g sec)\n",
1690                 num_cst, ilp_timer_elapsed_usec(t_cst) / 1000000.0));
1691 }
1692 #endif
1693
1694 /***************************************************
1695  *  _____ _      _____                    _
1696  * |_   _| |    |  __ \                  (_)
1697  *   | | | |    | |__) |  _ __ ___   __ _ _ _ __
1698  *   | | | |    |  ___/  | '_ ` _ \ / _` | | '_ \
1699  *  _| |_| |____| |      | | | | | | (_| | | | | |
1700  * |_____|______|_|      |_| |_| |_|\__,_|_|_| |_|
1701  *
1702  ***************************************************/
1703
1704 /**
1705  * Create the ilp (add variables, build constraints, solve, build schedule from solution).
1706  */
1707 static void create_ilp(ir_node *block, void *walk_env) {
1708         be_ilpsched_env_t     *env           = walk_env;
1709         be_ilpsched_irn_t     *block_node    = get_ilpsched_irn(env, block);
1710         ilpsched_block_attr_t *ba            = get_ilpsched_block_attr(block_node);
1711         FILE                  *logfile       = NULL;
1712         lpp_t                 *lpp           = NULL;
1713         struct obstack        var_obst;
1714         char                  name[1024];
1715
1716         DBG((env->dbg, 255, "\n\n\n=========================================\n"));
1717         DBG((env->dbg, 255, "  ILP Scheduling for %+F\n", block));
1718         DBG((env->dbg, 255, "=========================================\n\n"));
1719
1720         DBG((env->dbg, LEVEL_1, "Creating ILP Variables for nodes in %+F (%u interesting nodes, %u max steps)\n",
1721                 block, ba->n_interesting_nodes, ba->max_steps));
1722
1723         /* notify backend and get block environment */
1724         env->block_env = be_ilp_sched_init_block_ilp_schedule(env->sel, block);
1725
1726         /* if we have less than two interesting nodes, there is no need to create the ILP */
1727         if (ba->n_interesting_nodes > 1) {
1728                 double fact_var        = ba->n_interesting_nodes > 25 ? 2.3 : 3;
1729                 double fact_cst        = ba->n_interesting_nodes > 25 ? 3   : 4.5;
1730                 int    base_num        = ba->n_interesting_nodes * ba->n_interesting_nodes;
1731                 int    estimated_n_var = (int)((double)base_num * fact_var);
1732                 int    estimated_n_cst = (int)((double)base_num * fact_cst);
1733
1734                 DBG((env->dbg, LEVEL_1, "Creating LPP with estimated numbers: %d vars, %d cst\n",
1735                         estimated_n_var, estimated_n_cst));
1736
1737                 /* set up the LPP object */
1738                 snprintf(name, sizeof(name), "ilp scheduling IRG %s", get_entity_ld_name(get_irg_entity(env->irg)));
1739
1740                 lpp = new_lpp_userdef(
1741                         (const char *)name,
1742                         lpp_minimize,
1743                         estimated_n_cst,     /* num vars */
1744                         estimated_n_cst + 1, /* num cst */
1745                         1.3);                /* grow factor */
1746                 obstack_init(&var_obst);
1747
1748                 /* create ILP variables */
1749                 create_variables(env, lpp, block_node, &var_obst);
1750
1751                 /* create ILP constraints */
1752                 DBG((env->dbg, LEVEL_1, "Creating constraints for nodes in %+F:\n", block));
1753                 create_assignment_and_precedence_constraints(env, lpp, block_node);
1754                 create_ressource_constraints(env, lpp, block_node);
1755                 create_bundle_constraints(env, lpp, block_node);
1756                 //create_proj_keep_constraints(env, lpp, block_node);
1757
1758                 if (env->opts->regpress) {
1759                         if (ba->n_interesting_nodes > env->opts->limit_dead) {
1760                                 create_alive_nodes_constraint(env, lpp, block_node);
1761                                 create_pressure_alive_constraint(env, lpp, block_node);
1762                         } else {
1763                                 create_dying_nodes_constraint(env, lpp, block_node);
1764                                 create_pressure_dead_constraint(env, lpp, block_node);
1765                         }
1766                 }
1767
1768                 DBG((env->dbg, LEVEL_1, "ILP to solve: %u variables, %u constraints\n", lpp->var_next, lpp->cst_next));
1769
1770                 /* debug stuff, dump lpp when debugging is on  */
1771                 DEBUG_ONLY(
1772                         if (firm_dbg_get_mask(env->dbg) > 1) {
1773                                 char buf[1024];
1774                                 FILE *f;
1775
1776                                 snprintf(buf, sizeof(buf), "lpp_block_%lu.txt", get_irn_node_nr(block));
1777                                 f = fopen(buf, "w");
1778                                 lpp_dump_plain(lpp, f);
1779                                 fclose(f);
1780                                 snprintf(buf, sizeof(buf), "lpp_block_%lu.mps", get_irn_node_nr(block));
1781                                 lpp_dump(lpp, buf);
1782                         }
1783                 );
1784
1785                 /* set solve time limit */
1786                 lpp_set_time_limit(lpp, env->opts->time_limit);
1787
1788                 /* set logfile if requested */
1789                 if (strlen(env->opts->log_file) > 0) {
1790                         if (strcasecmp(env->opts->log_file, "stdout") == 0)
1791                                 lpp_set_log(lpp, stdout);
1792                         else if (strcasecmp(env->opts->log_file, "stderr") == 0)
1793                                 lpp_set_log(lpp, stderr);
1794                         else {
1795                                 logfile = fopen(env->opts->log_file, "w");
1796                                 if (! logfile)
1797                                         fprintf(stderr, "Could not open logfile '%s'! Logging disabled.\n", env->opts->log_file);
1798                                 else
1799                                         lpp_set_log(lpp, logfile);
1800                         }
1801                 }
1802
1803                 /* solve the ILP */
1804                 lpp_solve_net(lpp, env->main_env->options->ilp_server, env->main_env->options->ilp_solver);
1805
1806                 if (logfile)
1807                         fclose(logfile);
1808
1809                 /* check for valid solution */
1810                 if (! lpp_is_sol_valid(lpp)) {
1811                         char buf[1024];
1812                         FILE *f;
1813
1814                         snprintf(buf, sizeof(buf), "lpp_block_%lu.assert.txt", get_irn_node_nr(block));
1815                         f = fopen(buf, "w");
1816                         lpp_dump_plain(lpp, f);
1817                         fclose(f);
1818                         snprintf(buf, sizeof(buf), "lpp_block_%lu.assert.mps", get_irn_node_nr(block));
1819                         lpp_dump(lpp, buf);
1820                         dump_ir_block_graph(env->irg, "-assert");
1821
1822                         assert(0 && "ILP solution is not feasible!");
1823                 }
1824
1825                 DBG((env->dbg, LEVEL_1, "\nSolution:\n"));
1826                 DBG((env->dbg, LEVEL_1, "\tsend time: %g sec\n", lpp->send_time / 1000000.0));
1827                 DBG((env->dbg, LEVEL_1, "\treceive time: %g sec\n", lpp->recv_time / 1000000.0));
1828                 DBG((env->dbg, LEVEL_1, "\tmatrix: %u elements, density %.2f%%, size %.2fMB\n", lpp->n_elems, lpp->density, (double)lpp->matrix_mem / 1024.0 / 1024.0));
1829                 DBG((env->dbg, LEVEL_1, "\titerations: %d\n", lpp->iterations));
1830                 DBG((env->dbg, LEVEL_1, "\tsolution time: %g\n", lpp->sol_time));
1831                 DBG((env->dbg, LEVEL_1, "\tobjective function: %g\n", LPP_VALUE_IS_0(lpp->objval) ? 0.0 : lpp->objval));
1832                 DBG((env->dbg, LEVEL_1, "\tbest bound: %g\n", LPP_VALUE_IS_0(lpp->best_bound) ? 0.0 : lpp->best_bound));
1833
1834                 DBG((env->dbg, LEVEL_1, "variables used %u bytes\n", obstack_memory_used(&var_obst)));
1835         }
1836
1837         /* apply solution */
1838         apply_solution(env, lpp, block);
1839
1840         if (lpp)
1841                 free_lpp(lpp);
1842
1843         /* notify backend */
1844         be_ilp_sched_finish_block_ilp_schedule(env->sel, block, env->block_env);
1845 }
1846
1847 /**
1848  * Perform ILP scheduling on the given irg.
1849  */
1850 void be_ilp_sched(const be_irg_t *birg) {
1851         be_ilpsched_env_t          env;
1852         const char                 *name = "be ilp scheduling";
1853         arch_isa_t                 *isa  = birg->main_env->arch_env->isa;
1854         const ilp_sched_selector_t *sel  = isa->impl->get_ilp_sched_selector(isa);
1855
1856         FIRM_DBG_REGISTER(env.dbg, "firm.be.sched.ilp");
1857
1858 //      firm_dbg_set_mask(env.dbg, 1);
1859
1860         env.irg_env    = be_ilp_sched_init_irg_ilp_schedule(sel, birg->irg);
1861         env.sel        = sel;
1862         env.irg        = birg->irg;
1863         env.height     = heights_new(birg->irg);
1864         env.main_env   = birg->main_env;
1865         env.arch_env   = birg->main_env->arch_env;
1866         env.cpu        = arch_isa_get_machine(birg->main_env->arch_env->isa);
1867         env.opts       = &ilp_opts;
1868         phase_init(&env.ph, name, env.irg, PHASE_DEFAULT_GROWTH, init_ilpsched_irn);
1869
1870         /* assign a unique per block number to all interesting nodes */
1871         irg_walk_in_or_dep_graph(env.irg, NULL, build_block_idx, &env);
1872
1873         /*
1874                 The block indices are completely build after the walk,
1875                 now we can allocate the bitsets (size depends on block indices)
1876                 for all nodes.
1877         */
1878         phase_reinit_irn_data(&env.ph);
1879
1880         /* Collect all root nodes (having no user in their block) and calculate ASAP. */
1881         irg_walk_in_or_dep_blkwise_graph(env.irg, collect_alap_root_nodes, calculate_irn_asap, &env);
1882
1883         /* Calculate ALAP of all irns */
1884         irg_block_walk_graph(env.irg, NULL, calculate_block_alap, &env);
1885
1886         /* We refine the {ASAP(n), ALAP(n)} interval and fix the time steps for Projs and Keeps */
1887         irg_walk_in_or_dep_blkwise_graph(env.irg, NULL, refine_asap_alap_times, &env);
1888
1889         /* perform ILP scheduling */
1890         irg_block_walk_graph(env.irg, clear_unwanted_data, create_ilp, &env);
1891
1892         DEBUG_ONLY(
1893                 if (firm_dbg_get_mask(env.dbg)) {
1894                         phase_stat_t stat;
1895                         phase_stat_t *stat_ptr = phase_stat(&env.ph, &stat);
1896
1897                         fprintf(stderr, "Phase used: %u bytes\n", stat_ptr->overall_bytes);
1898                 }
1899         );
1900
1901         /* free all allocated object */
1902         phase_free(&env.ph);
1903         heights_free(env.height);
1904
1905         /* notify backend */
1906         be_ilp_sched_finish_irg_ilp_schedule(sel, birg->irg, env.irg_env);
1907 }
1908
1909 #ifdef WITH_LIBCORE
1910 /**
1911  * Register ILP scheduler options.
1912  */
1913 void be_init_ilpsched(void)
1914 {
1915         lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
1916         lc_opt_entry_t *sched_grp = lc_opt_get_grp(be_grp, "ilpsched");
1917
1918         lc_opt_add_table(sched_grp, ilpsched_option_table);
1919 }
1920 #endif /* WITH_LIBCORE */
1921
1922 #else /* WITH_ILP */
1923
1924 static INLINE void some_picky_compiler_do_not_allow_empty_files(void)
1925 {}
1926
1927 #endif /* WITH_ILP */