2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief ILP based instruction scheduling.
23 * @author Christian Wuerdig
27 * An ILP scheduler based on
28 * "ILP-based Instruction Scheduling for IA-64"
29 * by Daniel Kaestner and Sebastian Winkel
30 * extended with register pressure constraints by Christian Wuerdig
45 #include "irphase_t.h"
58 #include <lpp/lpp_net.h>
61 #include "lc_opts_enum.h"
66 #include "beilpsched.h"
70 #include "bemachine.h"
71 #include "belistsched.h"
73 typedef struct _ilpsched_options_t {
79 typedef struct _unit_type_info_t {
81 const be_execution_unit_type_t *tp;
85 * holding the ILP variables of the different types
87 typedef struct _ilp_var_types_t {
88 int *x; /* x_{nt}^k variables */
89 int *a; /* a_{nt}^k variables */
90 int *y; /* y_{nt}^k variables */
94 * Holds alive variables for a node live-in to a block.
96 typedef struct _ilp_livein_node_t {
98 unsigned max_alive_steps;
102 /* attributes for a node */
103 typedef struct _ilpsched_node_attr_t {
104 unsigned asap; /**< The ASAP scheduling control step */
105 unsigned alap; /**< The ALAP scheduling control step */
106 unsigned latency; /**< Latency of this node (needed for sorting) */
107 unsigned sched_point; /**< the step in which the node is finally scheduled */
108 unsigned visit_idx; /**< Index of the node having visited this node last */
109 unsigned consumer_idx; /**< Index of the node having counted this node as consumer last */
110 unsigned n_consumer; /**< Number of consumers */
111 ir_node **block_consumer; /**< List of consumer being in the same block */
112 waitq *projkeeps; /**< A List of Projs and Keeps belonging to this node */
113 unsigned block_idx : 30; /**< A unique per block index */
114 unsigned alap_changed : 1; /**< the current ALAP has changed, revisit preds */
115 unsigned is_dummy_node : 1; /**< this node is assigned to DUMMY unit */
116 bitset_t *transitive_block_nodes; /**< Set of transitive block nodes (predecessors
117 for ASAP, successors for ALAP */
118 unsigned n_unit_types; /**< number of allowed execution unit types */
119 unit_type_info_t *type_info; /**< list of allowed execution unit types */
120 ilp_var_types_t ilp_vars; /**< the different ILP variables */
121 } ilpsched_node_attr_t;
123 /* attributes for a block */
124 typedef struct _ilpsched_block_attr_t {
125 unsigned block_last_idx; /**< The highest node index in block so far */
126 unsigned n_interesting_nodes; /**< The number of nodes interesting for scheduling */
127 unsigned max_steps; /**< Upper bound for block execution */
128 plist_t *root_nodes; /**< A list of nodes having no user in current block */
129 ir_node *head_ilp_nodes; /**< A linked list of nodes which will contribute to ILP */
130 pset *livein_nodes; /**< A set of nodes which are live-in to this block */
131 } ilpsched_block_attr_t;
133 typedef union _ilpsched_attr_ {
134 ilpsched_node_attr_t node_attr;
135 ilpsched_block_attr_t block_attr;
138 /* A irn for the phase and it's attributes (either node or block) */
141 ilpsched_attr_t attr;
144 /* The ILP scheduling environment */
146 ir_phase ph; /**< The phase */
147 ir_graph *irg; /**< The current irg */
148 heights_t *height; /**< The heights object of the irg */
149 void *irg_env; /**< An environment for the irg scheduling, provided by the backend */
150 void *block_env; /**< An environment for scheduling a block, provided by the backend */
151 const arch_env_t *arch_env;
152 const be_main_env_t *main_env;
153 const be_machine_t *cpu; /**< the current abstract machine */
154 ilpsched_options_t *opts; /**< the ilp options for current irg */
155 const be_irg_t *birg; /**< The birg object */
156 be_options_t *be_opts; /**< backend options */
157 const ilp_sched_selector_t *sel; /**< The ILP sched selector provided by the backend */
158 DEBUG_ONLY(firm_dbg_module_t *dbg);
161 /* convenience macros to handle phase irn data */
162 #define get_ilpsched_irn(ilpsched_env, irn) (phase_get_or_set_irn_data(&(ilpsched_env)->ph, (irn)))
163 #define is_ilpsched_block(node) (is_Block((node)->irn))
164 #define get_ilpsched_block_attr(block) (&(block)->attr.block_attr)
165 #define get_ilpsched_node_attr(node) (&(node)->attr.node_attr)
167 /* check if node is considered for ILP scheduling */
168 #define consider_for_sched(env, irn) \
169 (! (is_Block(irn) || \
170 is_normal_Proj(env, irn) || \
177 /* gives the valid scheduling time step interval for a node */
178 #define VALID_SCHED_INTERVAL(na) ((na)->alap - (na)->asap + 1)
180 /* gives the valid interval where a node can die */
181 #define VALID_KILL_INTERVAL(ba, na) ((ba)->max_steps - (na)->asap + 1)
183 /* gives the corresponding ILP variable for given node, unit and time step */
184 #define ILPVAR_IDX(na, unit, control_step) \
185 ((unit) * VALID_SCHED_INTERVAL((na)) + (control_step) - (na)->asap + 1)
187 /* gives the corresponding dead nodes ILP variable for given node, unit and time step */
188 #define ILPVAR_IDX_DEAD(ba, na, unit, control_step) \
189 ((unit) * VALID_KILL_INTERVAL((ba), (na)) + (control_step) - (na)->asap + 1)
191 /* check if a double value is within an epsilon environment of 0 */
192 #define LPP_VALUE_IS_0(dbl) (fabs((dbl)) <= 1e-10)
194 #define ilp_timer_push(t) ir_timer_push((t))
195 #define ilp_timer_pop() ir_timer_pop()
196 #define ilp_timer_elapsed_usec(t) ir_timer_elapsed_usec((t))
198 /* option variable */
199 static ilpsched_options_t ilp_opts = {
200 1, /* default is with register pressure constraints */
201 300, /* 300 sec per block time limit */
206 static const lc_opt_table_entry_t ilpsched_option_table[] = {
207 LC_OPT_ENT_BOOL("regpress", "Use register pressure constraints", &ilp_opts.regpress),
208 LC_OPT_ENT_INT("time_limit", "ILP time limit per block", &ilp_opts.time_limit),
209 LC_OPT_ENT_STR("lpp_log", "LPP logfile (stderr and stdout are supported)", ilp_opts.log_file, sizeof(ilp_opts.log_file)),
214 We need this global variable as we compare nodes dependent on heights,
215 but we cannot pass any information to the qsort compare function.
217 static heights_t *glob_heights;
220 * Check if irn is a Proj, which has no execution units assigned.
221 * @return 1 if irn is a Proj having no execution units assigned, 0 otherwise
223 static inline int is_normal_Proj(const arch_env_t *env, const ir_node *irn) {
224 return is_Proj(irn) && (arch_env_get_allowed_execution_units(env, irn) == NULL);
228 * Skips normal Projs.
229 * @return predecessor if irn is a normal Proj, otherwise irn.
231 static inline ir_node *skip_normal_Proj(const arch_env_t *env, ir_node *irn) {
232 if (is_normal_Proj(env, irn))
233 return get_Proj_pred(irn);
237 static inline int fixed_latency(const ilp_sched_selector_t *sel, ir_node *irn, void *env) {
238 unsigned lat = be_ilp_sched_latency(sel, irn, env);
239 if (lat == 0 && ! is_Proj(irn) && ! be_is_Keep(irn))
244 static int cmp_live_in_nodes(const void *a, const void *b) {
245 const ilp_livein_node_t *n1 = a;
246 const ilp_livein_node_t *n2 = b;
248 return n1->irn != n2->irn;
252 * Compare scheduling time steps of two be_ilpsched_irn's.
254 static int cmp_ilpsched_irn(const void *a, const void *b) {
255 be_ilpsched_irn_t *n1 = *(be_ilpsched_irn_t **)a;
256 be_ilpsched_irn_t *n2 = *(be_ilpsched_irn_t **)b;
257 ilpsched_node_attr_t *n1_a = get_ilpsched_node_attr(n1);
258 ilpsched_node_attr_t *n2_a = get_ilpsched_node_attr(n2);
260 if (n1_a->sched_point == n2_a->sched_point) {
261 const ir_node *irn_a = n1->irn;
262 const ir_node *irn_b = n2->irn;
264 if (heights_reachable_in_block(glob_heights, irn_a, irn_b))
266 if (heights_reachable_in_block(glob_heights, irn_b, irn_a))
270 Ok, timestep is equal and the nodes are parallel,
271 so check latency and schedule high latency first.
273 return QSORT_CMP(n2_a->latency, n1_a->latency);
276 return QSORT_CMP(n1_a->sched_point, n2_a->sched_point);
280 * In case there is no phase information for irn, initialize it.
282 static void *init_ilpsched_irn(ir_phase *ph, const ir_node *irn, void *old) {
283 be_ilpsched_irn_t *res = old ? old : phase_alloc(ph, sizeof(res[0]));
286 /* if we have already some data: check for reinitialization */
288 if (! is_Block(irn)) {
289 ilpsched_node_attr_t *na = get_ilpsched_node_attr(res);
291 if (! na->transitive_block_nodes) {
292 ir_node *block = get_nodes_block(irn);
293 be_ilpsched_irn_t *block_node = phase_get_or_set_irn_data(ph, block);
294 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
296 /* we are called after the block indices have been build: create bitset */
297 na->transitive_block_nodes = bitset_obstack_alloc(phase_obst(ph), ba->block_last_idx);
300 /* we are called from reinit block data: clear the bitset */
301 bitset_clear_all(na->transitive_block_nodes);
303 na->alap_changed = 1;
311 /* set ilpsched irn attributes (either block or irn) */
313 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(res);
315 ba->n_interesting_nodes = 0;
316 ba->block_last_idx = 0;
317 ba->root_nodes = plist_new();
318 ba->head_ilp_nodes = NULL;
319 ba->livein_nodes = new_pset(cmp_live_in_nodes, 16);
323 ilpsched_node_attr_t *na = get_ilpsched_node_attr(res);
324 memset(na, 0, sizeof(*na));
331 * Assign a per block unique number to each node.
333 static void build_block_idx(ir_node *irn, void *walk_env) {
334 be_ilpsched_env_t *env = walk_env;
335 be_ilpsched_irn_t *node, *block_node;
336 ilpsched_node_attr_t *na;
337 ilpsched_block_attr_t *ba;
339 set_irn_link(irn, NULL);
340 if (! consider_for_sched(env->arch_env, irn))
343 node = get_ilpsched_irn(env, irn);
344 na = get_ilpsched_node_attr(node);
345 block_node = get_ilpsched_irn(env, get_nodes_block(irn));
346 ba = get_ilpsched_block_attr(block_node);
348 na->block_idx = ba->block_last_idx++;
351 /********************************************************
354 * __ _ ___ __ _ _ __ / / __ _| | __ _ _ __
355 * / _` / __|/ _` | '_ \ / / / _` | |/ _` | '_ \
356 * | (_| \__ \ (_| | |_) | / / | (_| | | (_| | |_) |
357 * \__,_|___/\__,_| .__/ /_/ \__,_|_|\__,_| .__/
360 ********************************************************/
363 * Add all nodes having no user in current block to last_nodes list.
365 static void collect_alap_root_nodes(ir_node *irn, void *walk_env) {
367 const ir_edge_t *edge;
368 be_ilpsched_irn_t *block_node, *node;
369 ilpsched_block_attr_t *ba;
370 ilpsched_node_attr_t *na;
372 be_ilpsched_env_t *env = walk_env;
373 int has_block_user = 0;
374 unsigned n_consumer = 0;
375 ir_edge_kind_t ekind[2] = { EDGE_KIND_NORMAL, EDGE_KIND_DEP };
379 if (! consider_for_sched(env->arch_env, irn))
382 block = get_nodes_block(irn);
383 idx = get_irn_idx(irn);
384 consumer = NEW_ARR_F(ir_node *, 0);
386 DBG((env->dbg, LEVEL_3, "%+F (%+F) is interesting, examining ... ", irn, block));
388 /* check data and dependency out edges */
389 for (i = 0; i < 2 && ! has_block_user; ++i) {
390 foreach_out_edge_kind(irn, edge, ekind[i]) {
391 ir_node *user = get_edge_src_irn(edge);
393 if (is_normal_Proj(env->arch_env, user)) {
394 const ir_edge_t *user_edge;
396 if (get_irn_mode(user) == mode_X)
399 /* The ABI ensures, that there will be no ProjT nodes in the graph. */
400 for (j = 0; j < 2; ++j) {
401 foreach_out_edge_kind(user, user_edge, ekind[j]) {
402 ir_node *real_user = get_edge_src_irn(user_edge);
404 if (! is_Phi(real_user) && ! is_Block(real_user)) {
405 be_ilpsched_irn_t *node = get_ilpsched_irn(env, real_user);
406 ilpsched_node_attr_t *ua = get_ilpsched_node_attr(node);
408 /* skip already visited nodes */
409 if (ua->consumer_idx == idx)
412 /* check if node has user in this block and collect the user if it's a data user */
413 if (get_nodes_block(real_user) == block) {
414 if (i == 0 && j == 0)
415 ARR_APP1(ir_node *, consumer, real_user);
419 /* only count data consumer */
423 /* mark user as visited by this node */
424 ua->consumer_idx = idx;
429 else if (is_Block(user)) {
432 else if (! is_Phi(user)) {
433 be_ilpsched_irn_t *node = get_ilpsched_irn(env, user);
434 ilpsched_node_attr_t *ua = get_ilpsched_node_attr(node);
436 /* skip already visited nodes */
437 if (ua->consumer_idx == idx)
440 /* check if node has user in this block and collect the user if it's a data user */
441 if (get_nodes_block(user) == block) {
443 ARR_APP1(ir_node *, consumer, user);
447 /* only count data consumer */
451 /* mark user visited by this node */
452 ua->consumer_idx = idx;
454 else if (get_nodes_block(user) != block) {
460 block_node = get_ilpsched_irn(env, block);
461 ba = get_ilpsched_block_attr(block_node);
463 ba->n_interesting_nodes++;
465 /* current irn has no user inside this block, add to queue */
466 if (! has_block_user) {
467 DB((env->dbg, LEVEL_3, "root node\n"));
468 plist_insert_back(ba->root_nodes, irn);
471 DB((env->dbg, LEVEL_3, "normal node\n"));
474 /* record number of all consumer and the consumer within the same block */
475 node = get_ilpsched_irn(env, irn);
476 na = get_ilpsched_node_attr(node);
477 na->n_consumer = n_consumer;
478 na->block_consumer = NEW_ARR_D(ir_node *, phase_obst(&env->ph), ARR_LEN(consumer));
479 memcpy(na->block_consumer, consumer, ARR_LEN(consumer) * sizeof(na->block_consumer[0]));
484 * Calculate the ASAP scheduling step for current irn.
486 static void calculate_irn_asap(ir_node *irn, void *walk_env) {
487 be_ilpsched_env_t *env = walk_env;
490 be_ilpsched_irn_t *node, *block_node;
491 ilpsched_node_attr_t *na;
492 ilpsched_block_attr_t *ba;
494 /* These nodes are handled separate */
495 if (! consider_for_sched(env->arch_env, irn))
498 DBG((env->dbg, LEVEL_2, "Calculating ASAP of node %+F ... ", irn));
500 block = get_nodes_block(irn);
501 node = get_ilpsched_irn(env, irn);
502 na = get_ilpsched_node_attr(node);
505 for (i = get_irn_ins_or_deps(irn) - 1; i >= 0; --i) {
506 ir_node *pred = skip_normal_Proj(env->arch_env, get_irn_in_or_dep(irn, i));
508 /* check for greatest distance to top */
509 if (! is_Phi(pred) && ! is_NoMem(pred) && get_nodes_block(pred) == block) {
510 be_ilpsched_irn_t *pred_node = get_ilpsched_irn(env, pred);
511 ilpsched_node_attr_t *pna = get_ilpsched_node_attr(pred_node);
514 lat = fixed_latency(env->sel, pred, env->block_env);
516 na->asap = MAX(na->asap, pna->asap + lat);
520 /* add node to ILP node list and update max_steps */
521 block_node = get_ilpsched_irn(env, block);
522 ba = get_ilpsched_block_attr(block_node);
524 set_irn_link(irn, ba->head_ilp_nodes);
525 ba->head_ilp_nodes = irn;
526 ba->max_steps += fixed_latency(env->sel, irn, env->block_env);
528 DB((env->dbg, LEVEL_2, "%u\n", na->asap));
532 * Calculate the ALAP scheduling step of all irns in current block.
533 * Depends on max_steps being calculated.
535 static void calculate_block_alap(ir_node *block, void *walk_env) {
536 be_ilpsched_env_t *env = walk_env;
537 be_ilpsched_irn_t *block_node = get_ilpsched_irn(env, block);
538 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
539 waitq *cur_queue = new_waitq();
542 assert(is_Block(block));
544 DBG((env->dbg, LEVEL_2, "Calculating ALAP for nodes in %+F (%u nodes, %u max steps)\n",
545 block, ba->n_interesting_nodes, ba->max_steps));
547 /* TODO: Might be faster to use out edges and call phase_reinit_single_irn_data */
548 //phase_reinit_block_irn_data(&env->ph, block);
550 /* init start queue */
551 foreach_plist(ba->root_nodes, el) {
552 waitq_put(cur_queue, plist_element_get_value(el));
555 /* repeat until all nodes are processed */
556 while (! waitq_empty(cur_queue)) {
557 waitq *next_queue = new_waitq();
559 /* process all nodes in current step */
560 while (! waitq_empty(cur_queue)) {
561 ir_node *cur_irn = waitq_get(cur_queue);
562 be_ilpsched_irn_t *node = get_ilpsched_irn(env, cur_irn);
563 ilpsched_node_attr_t *na = get_ilpsched_node_attr(node);
566 /* cur_node has no alap set -> it's a root node, set to max alap */
568 na->alap = ba->max_steps;
569 DBG((env->dbg, LEVEL_2, "setting ALAP of node %+F to %u, handling preds:\n",
573 DBG((env->dbg, LEVEL_2, "ALAP of node %+F is %u, handling preds:\n",
577 /* set the alap's of all predecessors */
578 for (i = get_irn_ins_or_deps(cur_irn) - 1; i >= 0; --i) {
579 ir_node *pred = skip_normal_Proj(env->arch_env, get_irn_in_or_dep(cur_irn, i));
581 /* check for greatest distance to bottom */
582 if (! is_Phi(pred) && ! is_NoMem(pred) && get_nodes_block(pred) == block) {
583 be_ilpsched_irn_t *pred_node = get_ilpsched_irn(env, pred);
584 ilpsched_node_attr_t *pna = get_ilpsched_node_attr(pred_node);
587 /* mark the predecessor as visited by current irn */
588 if (pna->visit_idx == get_irn_idx(cur_irn) && ! na->alap_changed)
590 pna->visit_idx = get_irn_idx(cur_irn);
592 lat = fixed_latency(env->sel, pred, env->block_env);
594 /* set ALAP of current pred */
595 if (pna->alap == 0) {
596 /* current ALAP is 0: node has not yet been visited */
597 pna->alap_changed = 1;
598 pna->alap = na->alap - lat;
600 else if (pna->alap > na->alap - lat) {
601 /* we found a longer path to root node: change ALAP */
602 pna->alap = na->alap - lat;
603 pna->alap_changed = 1;
606 /* current ALAP is best found so far: keep it */
607 pna->alap_changed = 0;
610 DBG((env->dbg, LEVEL_2, "\tsetting ALAP of node %+F to %u\n", pred, pna->alap));
612 /* enqueue node for next iteration */
613 if (get_irn_ins_or_deps(pred) > 0)
614 waitq_put(next_queue, pred);
619 /* prepare for next iteration */
620 del_waitq(cur_queue);
621 cur_queue = next_queue;
626 * Free list of root nodes and the set of live-in nodes.
628 static void clear_unwanted_data(ir_node *block, void *walk_env) {
629 be_ilpsched_env_t *env = walk_env;
630 be_ilpsched_irn_t *block_node = get_ilpsched_irn(env, block);
631 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
633 plist_free(ba->root_nodes);
634 ba->root_nodes = NULL;
635 del_pset(ba->livein_nodes);
636 ba->livein_nodes = NULL;
640 * Refine the {ASAP(n), ALAP(n)} interval for the nodes.
641 * Set the ASAP/ALAP times of Projs and Keeps to their ancestor ones.
643 static void refine_asap_alap_times(ir_node *irn, void *walk_env) {
644 be_ilpsched_env_t *env = walk_env;
646 be_ilpsched_irn_t *node, *pred_node;
647 ilpsched_node_attr_t *na, *pna;
649 if (! consider_for_sched(env->arch_env, irn))
652 if (! is_Proj(irn) && ! be_is_Keep(irn))
655 /* go to the ancestor */
657 pred = get_irn_n(irn, 0);
658 pred = skip_Proj(pred);
660 node = get_ilpsched_irn(env, irn);
661 pred_node = get_ilpsched_irn(env, pred);
662 na = get_ilpsched_node_attr(node);
663 pna = get_ilpsched_node_attr(pred_node);
665 na->asap = pna->asap;
666 na->alap = pna->alap;
668 /* record all Projs and Keeps for this node */
669 if (! pna->projkeeps)
670 pna->projkeeps = new_waitq();
671 waitq_put(pna->projkeeps, irn);
673 DBG((env->dbg, LEVEL_2, "fixing ASAP/ALAP of %+F to %u/%u\n", irn, na->asap, na->alap));
676 /*******************************************
679 * ___ ___| |__ ___ __| |_ _| | ___
680 * / __|/ __| '_ \ / _ \/ _` | | | | |/ _ \
681 * \__ \ (__| | | | __/ (_| | |_| | | __/
682 * |___/\___|_| |_|\___|\__,_|\__,_|_|\___|
684 *******************************************/
686 static inline void check_for_keeps(waitq *keeps, const ir_node *block, const ir_node *irn) {
687 const ir_edge_t *edge;
690 foreach_out_edge(irn, edge) {
691 ir_node *user = get_edge_src_irn(edge);
693 if (be_is_Keep(user)) {
694 assert(get_nodes_block(user) == block && "Keep must not be in different block.");
695 waitq_put(keeps, user);
701 * Inserts @p irn before @p before into schedule and notifies backend.
703 static inline void notified_sched_add_before(be_ilpsched_env_t *env,
704 const ir_node *before, const ir_node *irn, unsigned cycle)
706 be_ilp_sched_node_scheduled(env->sel, irn, cycle, env->block_env);
707 sched_add_before((ir_node*) before, (ir_node*) irn);
711 * Adds a node, it's Projs (in case of mode_T nodes) and
712 * it's Keeps to schedule.
714 static void add_to_sched(be_ilpsched_env_t *env, const ir_node *block, const ir_node *irn, unsigned cycle) {
715 const ir_edge_t *edge;
716 waitq *keeps = new_waitq();
718 /* mode_M nodes are not scheduled */
719 if (get_irn_mode(irn) == mode_M)
722 if (! sched_is_scheduled(irn))
723 notified_sched_add_before(env, block, irn, cycle);
726 if (get_irn_mode(irn) == mode_T) {
727 foreach_out_edge(irn, edge) {
728 ir_node *user = get_edge_src_irn(edge);
730 if ((to_appear_in_schedule(user) || get_irn_mode(user) == mode_b) &&
731 get_irn_n_edges(user) > 0)
733 notified_sched_add_before(env, block, user, cycle);
736 check_for_keeps(keeps, block, user);
740 check_for_keeps(keeps, block, irn);
744 while (! waitq_empty(keeps)) {
745 ir_node *keep = waitq_get(keeps);
746 if (! sched_is_scheduled(keep))
747 notified_sched_add_before(env, block, keep, cycle);
754 * Schedule all nodes in the given block, according to the ILP solution.
756 static void apply_solution(be_ilpsched_env_t *env, lpp_t *lpp, ir_node *block) {
757 be_ilpsched_irn_t *block_node = get_ilpsched_irn(env, block);
758 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
759 be_ilpsched_irn_t **sched_nodes;
762 const ir_edge_t *edge;
764 /* init block schedule list */
765 sched_init_block(block);
767 /* collect nodes and their scheduling time step */
768 sched_nodes = NEW_ARR_F(be_ilpsched_irn_t *, 0);
769 if (ba->n_interesting_nodes == 0) {
772 else if (ba->n_interesting_nodes == 1) {
773 be_ilpsched_irn_t *node = get_ilpsched_irn(env, ba->head_ilp_nodes);
775 /* add the single node */
776 ARR_APP1(be_ilpsched_irn_t *, sched_nodes, node);
779 /* check all nodes for their positive solution */
780 foreach_linked_irns(ba->head_ilp_nodes, irn) {
781 be_ilpsched_irn_t *node;
782 ilpsched_node_attr_t *na;
786 node = get_ilpsched_irn(env, irn);
787 na = get_ilpsched_node_attr(node);
791 if (! na->is_dummy_node) {
792 for (tp_idx = na->n_unit_types - 1; ! found && tp_idx >= 0; --tp_idx) {
793 for (t = na->asap - 1; ! found && t <= na->alap - 1; ++t) {
794 double cost = lpp_get_var_sol(lpp, na->ilp_vars.y[cur_var]);
796 if (! LPP_VALUE_IS_0(cost)) {
797 DBG((env->dbg, LEVEL_3, "%+F has additional regpressure costs of %f\n", irn, cost));
805 /* go over all variables of a node until the non-zero one is found */
806 for (tp_idx = na->n_unit_types - 1; ! found && tp_idx >= 0; --tp_idx) {
807 for (t = na->asap - 1; ! found && t <= na->alap - 1; ++t) {
808 double val = lpp_get_var_sol(lpp, na->ilp_vars.x[cur_var++]);
810 /* check, if variable is set to one (it's not zero then :) */
811 if (! LPP_VALUE_IS_0(val)) {
813 ARR_APP1(be_ilpsched_irn_t *, sched_nodes, node);
814 DBG((env->dbg, LEVEL_2, "Schedpoint of %+F is %u at unit type %s\n",
815 irn, t, na->type_info[tp_idx].tp->name));
822 glob_heights = env->height;
823 /* sort nodes ascending by scheduling time step */
824 qsort(sched_nodes, ARR_LEN(sched_nodes), sizeof(sched_nodes[0]), cmp_ilpsched_irn);
827 /* make all Phis ready and remember the single cf op */
829 foreach_out_edge(block, edge) {
830 irn = get_edge_src_irn(edge);
832 switch (get_irn_opcode(irn)) {
834 add_to_sched(env, block, irn, 0);
844 assert(cfop == NULL && "Highlander - there can be only one");
851 /* add all nodes from list */
852 for (i = 0, l = ARR_LEN(sched_nodes); i < l; ++i) {
853 ilpsched_node_attr_t *na = get_ilpsched_node_attr(sched_nodes[i]);
854 if (sched_nodes[i]->irn != cfop)
855 add_to_sched(env, block, sched_nodes[i]->irn, na->sched_point);
858 /* schedule control flow node if not already done */
859 if (cfop && ! sched_is_scheduled(cfop))
860 add_to_sched(env, block, cfop, 0);
862 DEL_ARR_F(sched_nodes);
865 /***************************************************************
866 * _____ _ _____ _____ _ _
867 * |_ _| | | __ \ / ____| | | (_)
868 * | | | | | |__) | | (___ ___ ___| |_ _ ___ _ __
869 * | | | | | ___/ \___ \ / _ \/ __| __| |/ _ \| '_ \
870 * _| |_| |____| | ____) | __/ (__| |_| | (_) | | | |
871 * |_____|______|_| |_____/ \___|\___|\__|_|\___/|_| |_|
873 ***************************************************************/
876 * Check if node can be executed on given unit type.
878 static inline int is_valid_unit_type_for_node(const be_execution_unit_type_t *tp, be_ilpsched_irn_t *node) {
880 ilpsched_node_attr_t *na = get_ilpsched_node_attr(node);
882 for (i = na->n_unit_types - 1; i >= 0; --i) {
883 if (na->type_info[i].tp == tp)
890 /************************************************
893 * __ ____ _ _ __ _ __ _| |__ | | ___ ___
894 * \ \ / / _` | '__| |/ _` | '_ \| |/ _ \/ __|
895 * \ V / (_| | | | | (_| | |_) | | __/\__ \
896 * \_/ \__,_|_| |_|\__,_|_.__/|_|\___||___/
898 ************************************************/
900 static int be_ilpsched_set_type_info(be_ilpsched_env_t *env, ir_node *irn, struct obstack *obst) {
901 const be_execution_unit_t ***execunits = arch_env_get_allowed_execution_units(env->arch_env, irn);
902 unsigned n_unit_types = 0;
903 be_ilpsched_irn_t *node;
904 ilpsched_node_attr_t *na;
905 unsigned unit_idx, tp_idx;
907 /* count number of available unit types for this node */
908 for (n_unit_types = 0; execunits[n_unit_types]; ++n_unit_types)
911 node = get_ilpsched_irn(env, irn);
912 na = get_ilpsched_node_attr(node);
914 if (! na->type_info) {
915 na->n_unit_types = n_unit_types;
916 na->type_info = NEW_ARR_D(unit_type_info_t, obst, n_unit_types);
918 /* fill the type info array */
919 for (tp_idx = 0; tp_idx < n_unit_types; ++tp_idx) {
920 for (unit_idx = 0; execunits[tp_idx][unit_idx]; ++unit_idx) {
921 /* beware: we also count number of available units here */
922 if (be_machine_is_dummy_unit(execunits[tp_idx][unit_idx]))
923 na->is_dummy_node = 1;
926 na->type_info[tp_idx].tp = execunits[tp_idx][0]->tp;
927 na->type_info[tp_idx].n_units = unit_idx;
935 * Returns the largest alap time of a user of @p irn.
936 * The user must be in block @p block.
938 static unsigned be_ilpsched_get_max_alap_user(be_ilpsched_env_t *env, const ir_node *irn, const ir_node *block) {
939 const ir_edge_t *edge;
940 unsigned max_alap = 0;
942 foreach_out_edge(irn, edge) {
943 ir_node *user = get_edge_src_irn(edge);
945 if (get_nodes_block(user) == block) {
946 be_ilpsched_irn_t *node = get_ilpsched_irn(env, user);
947 ilpsched_node_attr_t *na = get_ilpsched_node_attr(node);
949 max_alap = MAX(max_alap, na->alap);
953 assert(max_alap > 0);
958 * Create the following variables:
959 * - x_{nt}^k binary weigthed with: t
960 * node n is scheduled at time step t to unit type k
961 * ==>> These variables represent the schedule
963 * - a_{nt}^k binary weighted with num_nodes
964 * node n is alive at time step t on unit type k
966 * - y_{nt}^k continuous weighted with: num_nodes^2
967 * register pressure over limit for unit type k
968 * ==>> These variables represent the register pressure
971 static void create_variables(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn_t *block_node, struct obstack *var_obst) {
974 unsigned num_block_var, num_nodes;
975 ilp_livein_node_t *livein;
976 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
977 unsigned weigth_y = ba->n_interesting_nodes * ba->n_interesting_nodes;
978 ir_timer_t *t_var = ir_timer_register("beilpsched_var", "create ilp variables");
980 ilp_timer_push(t_var);
981 num_block_var = num_nodes = 0;
982 foreach_linked_irns(ba->head_ilp_nodes, irn) {
983 be_ilpsched_irn_t *node;
984 ilpsched_node_attr_t *na;
985 unsigned n_unit_types, tp_idx, n_var, cur_unit;
986 unsigned cur_var_ad, cur_var_x, cur_var_y, num_ad;
989 node = get_ilpsched_irn(env, irn);
990 na = get_ilpsched_node_attr(node);
991 n_unit_types = be_ilpsched_set_type_info(env, irn, var_obst);
993 /* allocate space for ilp variables */
994 na->ilp_vars.x = NEW_ARR_D(int, var_obst, n_unit_types * VALID_SCHED_INTERVAL(na));
995 memset(na->ilp_vars.x, -1, ARR_LEN(na->ilp_vars.x) * sizeof(na->ilp_vars.x[0]));
997 /* we need these variables only for "real" nodes */
998 if (! na->is_dummy_node) {
999 na->ilp_vars.y = NEW_ARR_D(int, var_obst, n_unit_types * VALID_SCHED_INTERVAL(na));
1000 memset(na->ilp_vars.y, -1, ARR_LEN(na->ilp_vars.y) * sizeof(na->ilp_vars.y[0]));
1002 num_ad = ba->max_steps - na->asap + 1;
1003 na->ilp_vars.a = NEW_ARR_D(int, var_obst, n_unit_types * num_ad);
1004 memset(na->ilp_vars.a, -1, ARR_LEN(na->ilp_vars.a) * sizeof(na->ilp_vars.a[0]));
1007 DBG((env->dbg, LEVEL_3, "\thandling %+F (asap %u, alap %u, unit types %u):\n",
1008 irn, na->asap, na->alap, na->n_unit_types));
1010 cur_var_x = cur_var_ad = cur_var_y = cur_unit = n_var = 0;
1011 /* create variables */
1012 for (tp_idx = 0; tp_idx < n_unit_types; ++tp_idx) {
1015 for (t = na->asap - 1; t <= na->alap - 1; ++t) {
1016 /* x_{nt}^k variables */
1017 snprintf(buf, sizeof(buf), "x_n%u_%s_%u",
1018 get_irn_idx(irn), na->type_info[tp_idx].tp->name, t);
1019 na->ilp_vars.x[cur_var_x++] = lpp_add_var(lpp, buf, lpp_binary, (double)(t + 1));
1020 DBG((env->dbg, LEVEL_4, "\t\tcreated ILP variable %s\n", buf));
1021 /* variable counter */
1025 if (! na->is_dummy_node) {
1026 /* y_{nt}^k variables */
1027 snprintf(buf, sizeof(buf), "y_n%u_%s_%u",
1028 get_irn_idx(irn), na->type_info[tp_idx].tp->name, t);
1029 na->ilp_vars.y[cur_var_y++] = lpp_add_var(lpp, buf, lpp_continous, (double)(weigth_y));
1030 DBG((env->dbg, LEVEL_4, "\t\tcreated ILP variable %s\n", buf));
1032 /* variable counter */
1038 /* a node can die at any step t: asap(n) <= t <= U */
1039 if (! na->is_dummy_node) {
1040 for (t = na->asap - 1; t <= ba->max_steps; ++t) {
1042 /* a_{nt}^k variables */
1043 snprintf(buf, sizeof(buf), "a_n%u_%s_%u",
1044 get_irn_idx(irn), na->type_info[tp_idx].tp->name, t);
1045 na->ilp_vars.a[cur_var_ad++] = lpp_add_var(lpp, buf, lpp_binary, (double)(ba->n_interesting_nodes));
1046 DBG((env->dbg, LEVEL_4, "\t\tcreated ILP variable %s\n", buf));
1048 /* variable counter */
1054 /* collect live-in nodes */
1055 for (i = get_irn_arity(irn) - 1; i >= 0; --i) {
1056 ir_node *pred = get_irn_n(irn, i);
1058 if (get_nodes_block(pred) != block_node->irn && consider_for_sched(env->arch_env, pred)) {
1059 be_ilpsched_set_type_info(env, pred, var_obst);
1060 if (! na->is_dummy_node) {
1061 ilp_livein_node_t *entry = obstack_alloc(var_obst, sizeof(*entry));
1064 pset_insert(ba->livein_nodes, entry, (unsigned)get_irn_idx(pred));
1070 DB((env->dbg, LEVEL_3, "%u variables created\n", n_var));
1074 /* create alive variables a_{nt}^k for live-ins */
1075 foreach_pset(ba->livein_nodes, livein) {
1076 be_ilpsched_irn_t *node;
1077 ilpsched_node_attr_t *na;
1078 unsigned tp_idx, var_idx;
1082 node = get_ilpsched_irn(env, irn);
1083 na = get_ilpsched_node_attr(node);
1085 livein->max_alive_steps = be_ilpsched_get_max_alap_user(env, irn, block_node->irn);
1087 livein->a = NEW_ARR_D(int, var_obst, na->n_unit_types * livein->max_alive_steps);
1090 /* create variables */
1091 for (tp_idx = 0; tp_idx < na->n_unit_types; ++tp_idx) {
1094 for (t = 0; t < livein->max_alive_steps; ++t) {
1095 /* a_{nt}^k variables */
1096 snprintf(buf, sizeof(buf), "al_n%u_%s_%u",
1097 get_irn_idx(irn), na->type_info[tp_idx].tp->name, t);
1098 livein->a[var_idx++] = lpp_add_var(lpp, buf, lpp_binary, (double)(ba->n_interesting_nodes));
1099 DBG((env->dbg, LEVEL_4, "\t\tcreated ILP variable %s\n", buf));
1106 DBG((env->dbg, LEVEL_1, "... %u variables for %u nodes created (%g sec)\n",
1107 num_block_var, num_nodes, ilp_timer_elapsed_usec(t_var) / 1000000.0));
1110 /*******************************************************
1113 * ___ ___ _ __ ___| |_ _ __ __ _ _ _ __ | |_ ___
1114 * / __/ _ \| '_ \/ __| __| '__/ _` | | '_ \| __/ __|
1115 * | (_| (_) | | | \__ \ |_| | | (_| | | | | | |_\__ \
1116 * \___\___/|_| |_|___/\__|_| \__,_|_|_| |_|\__|___/
1118 *******************************************************/
1121 * Collect all operands and nodes @p irn depends on.
1122 * If there is a Proj within the dependencies, all other Projs of the parent node are added as well.
1124 static void sta_collect_in_deps(ir_node *irn, ir_nodeset_t *deps) {
1127 for (i = get_irn_ins_or_deps(irn) - 1; i >= 0; --i) {
1128 ir_node *p = get_irn_in_or_dep(irn, i);
1131 const ir_edge_t *edge;
1133 p = get_Proj_pred(p);
1134 foreach_out_edge(p, edge) {
1135 ir_node *src = get_edge_src_irn(edge);
1136 ir_nodeset_insert(deps, src);
1140 ir_nodeset_insert(deps, p);
1146 * Create following ILP constraints:
1147 * - the assignment constraints:
1148 * assure each node is executed once by exactly one (allowed) execution unit
1149 * - the dead node assignment constraints:
1150 * assure a node can only die at most once
1151 * - the precedence constraints:
1152 * assure that no data dependencies are violated
1154 static void create_assignment_and_precedence_constraints(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn_t *block_node) {
1155 unsigned num_cst_assign, num_cst_prec, num_cst_dead;
1158 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
1159 bitset_t *bs_block_irns = bitset_alloca(ba->block_last_idx);
1160 ir_timer_t *t_cst_assign = ir_timer_register("beilpsched_cst_assign", "create assignment constraints");
1161 ir_timer_t *t_cst_prec = ir_timer_register("beilpsched_cst_prec", "create precedence constraints");
1163 num_cst_assign = num_cst_prec = num_cst_dead = 0;
1164 foreach_linked_irns(ba->head_ilp_nodes, irn) {
1167 be_ilpsched_irn_t *node;
1168 ilpsched_node_attr_t *na;
1171 ir_nodeset_iterator_t iter;
1173 ir_nodeset_init(&deps);
1175 node = get_ilpsched_irn(env, irn);
1176 na = get_ilpsched_node_attr(node);
1179 /* the assignment constraint */
1180 ilp_timer_push(t_cst_assign);
1181 snprintf(buf, sizeof(buf), "assignment_cst_n%u", get_irn_idx(irn));
1182 cst = lpp_add_cst_uniq(lpp, buf, lpp_equal, 1.0);
1183 DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1186 lpp_set_factor_fast_bulk(lpp, cst, na->ilp_vars.x, ARR_LEN(na->ilp_vars.x), 1.0);
1189 /* We have separate constraints for Projs and Keeps */
1190 // ILP becomes infeasible ?!?
1191 // if (is_Proj(irn) || be_is_Keep(irn))
1194 /* the precedence constraints */
1195 ilp_timer_push(t_cst_prec);
1196 bs_block_irns = bitset_clear_all(bs_block_irns);
1198 sta_collect_in_deps(irn, &deps);
1199 foreach_ir_nodeset(&deps, pred, iter) {
1200 unsigned t_low, t_high, t;
1201 be_ilpsched_irn_t *pred_node;
1202 ilpsched_node_attr_t *pna;
1205 pred = skip_normal_Proj(env->arch_env, pred);
1206 if (is_Phi(pred) || block_node->irn != get_nodes_block(pred) || is_NoMem(pred))
1209 pred_node = get_ilpsched_irn(env, pred);
1210 pna = get_ilpsched_node_attr(pred_node);
1212 assert(pna->asap > 0 && pna->alap >= pna->asap && "Invalid scheduling interval.");
1214 if (! bitset_is_set(bs_block_irns, pna->block_idx))
1215 bitset_set(bs_block_irns, pna->block_idx);
1219 /* irn = n, pred = m */
1220 delay = fixed_latency(env->sel, pred, env->block_env);
1221 t_low = MAX(na->asap, pna->asap + delay - 1);
1222 t_high = MIN(na->alap, pna->alap + delay - 1);
1223 for (t = t_low - 1; t <= t_high - 1; ++t) {
1225 int *tmp_var_idx = NEW_ARR_F(int, 0);
1227 snprintf(buf, sizeof(buf), "precedence_n%u_n%u_%u", get_irn_idx(pred), get_irn_idx(irn), t);
1228 cst = lpp_add_cst_uniq(lpp, buf, lpp_less, 1.0);
1229 DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1232 /* lpp_set_factor_fast_bulk needs variables sorted ascending by index */
1233 if (na->ilp_vars.x[0] < pna->ilp_vars.x[0]) {
1234 /* node variables have smaller index than pred variables */
1235 for (tp_idx = na->n_unit_types - 1; tp_idx >= 0; --tp_idx) {
1236 for (tn = na->asap - 1; tn <= t; ++tn) {
1237 unsigned idx = ILPVAR_IDX(na, tp_idx, tn);
1238 ARR_APP1(int, tmp_var_idx, na->ilp_vars.x[idx]);
1242 for (tp_idx = pna->n_unit_types - 1; tp_idx >= 0; --tp_idx) {
1243 for (tm = t - delay + 1; tm < pna->alap; ++tm) {
1244 unsigned idx = ILPVAR_IDX(pna, tp_idx, tm);
1245 ARR_APP1(int, tmp_var_idx, pna->ilp_vars.x[idx]);
1250 /* pred variables have smaller index than node variables */
1251 for (tp_idx = pna->n_unit_types - 1; tp_idx >= 0; --tp_idx) {
1252 for (tm = t - delay + 1; tm < pna->alap; ++tm) {
1253 unsigned idx = ILPVAR_IDX(pna, tp_idx, tm);
1254 ARR_APP1(int, tmp_var_idx, pna->ilp_vars.x[idx]);
1258 for (tp_idx = na->n_unit_types - 1; tp_idx >= 0; --tp_idx) {
1259 for (tn = na->asap - 1; tn <= t; ++tn) {
1260 unsigned idx = ILPVAR_IDX(na, tp_idx, tn);
1261 ARR_APP1(int, tmp_var_idx, na->ilp_vars.x[idx]);
1266 if (ARR_LEN(tmp_var_idx) > 0)
1267 lpp_set_factor_fast_bulk(lpp, cst, tmp_var_idx, ARR_LEN(tmp_var_idx), 1.0);
1269 DEL_ARR_F(tmp_var_idx);
1272 ir_nodeset_destroy(&deps);
1275 DBG((env->dbg, LEVEL_1, "\t%u assignement constraints (%g sec)\n",
1276 num_cst_assign, ilp_timer_elapsed_usec(t_cst_assign) / 1000000.0));
1277 DBG((env->dbg, LEVEL_1, "\t%u precedence constraints (%g sec)\n",
1278 num_cst_prec, ilp_timer_elapsed_usec(t_cst_prec) / 1000000.0));
1282 * Create ILP resource constraints:
1283 * - assure that for each time step not more instructions are scheduled
1284 * to the same unit types as units of this type are available
1286 static void create_ressource_constraints(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn_t *block_node) {
1289 unsigned num_cst_resrc = 0;
1290 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
1291 ir_timer_t *t_cst_rsrc = ir_timer_register("beilpsched_cst_rsrc", "create resource constraints");
1293 ilp_timer_push(t_cst_rsrc);
1294 for (glob_type_idx = env->cpu->n_unit_types - 1; glob_type_idx >= 0; --glob_type_idx) {
1296 be_execution_unit_type_t *cur_tp = &env->cpu->unit_types[glob_type_idx];
1298 /* BEWARE: the DUMMY unit type is not in CPU, so it's skipped automatically */
1300 /* check each time step */
1301 for (t = 0; t < ba->max_steps; ++t) {
1304 int *tmp_var_idx = NEW_ARR_F(int, 0);
1306 snprintf(buf, sizeof(buf), "resource_cst_%s_%u", cur_tp->name, t);
1307 cst = lpp_add_cst_uniq(lpp, buf, lpp_less, (double)cur_tp->n_units);
1308 DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1311 foreach_linked_irns(ba->head_ilp_nodes, irn) {
1312 be_ilpsched_irn_t *node = get_ilpsched_irn(env, irn);
1313 ilpsched_node_attr_t *na = get_ilpsched_node_attr(node);
1316 tp_idx = is_valid_unit_type_for_node(cur_tp, node);
1318 if (tp_idx >= 0 && t >= na->asap - 1 && t <= na->alap - 1) {
1319 int cur_var = ILPVAR_IDX(na, tp_idx, t);
1320 ARR_APP1(int, tmp_var_idx, na->ilp_vars.x[cur_var]);
1324 /* set constraints if we have some */
1325 if (ARR_LEN(tmp_var_idx) > 0)
1326 lpp_set_factor_fast_bulk(lpp, cst, tmp_var_idx, ARR_LEN(tmp_var_idx), 1.0);
1328 DEL_ARR_F(tmp_var_idx);
1332 DBG((env->dbg, LEVEL_1, "\t%u resource constraints (%g sec)\n",
1333 num_cst_resrc, ilp_timer_elapsed_usec(t_cst_rsrc) / 1000000.0));
1337 * Create ILP bundle constraints:
1338 * - assure, at most bundle_size * bundles_per_cycle instructions
1339 * can be started at a certain point.
1341 static void create_bundle_constraints(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn_t *block_node) {
1344 unsigned num_cst_bundle = 0;
1345 unsigned n_instr_max = env->cpu->bundle_size * env->cpu->bundels_per_cycle;
1346 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
1347 ir_timer_t *t_cst_bundle = ir_timer_register("beilpsched_cst_bundle", "create bundle constraints");
1349 ilp_timer_push(t_cst_bundle);
1350 for (t = 0; t < ba->max_steps; ++t) {
1353 int *tmp_var_idx = NEW_ARR_F(int, 0);
1355 snprintf(buf, sizeof(buf), "bundle_cst_%u", t);
1356 cst = lpp_add_cst_uniq(lpp, buf, lpp_less, (double)n_instr_max);
1357 DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1360 foreach_linked_irns(ba->head_ilp_nodes, irn) {
1361 be_ilpsched_irn_t *node;
1362 ilpsched_node_attr_t *na;
1365 /* Projs and Keeps do not contribute to bundle size */
1366 if (is_Proj(irn) || be_is_Keep(irn))
1369 node = get_ilpsched_irn(env, irn);
1370 na = get_ilpsched_node_attr(node);
1372 /* nodes assigned to DUMMY unit do not contribute to bundle size */
1373 if (na->is_dummy_node)
1376 if (t >= na->asap - 1 && t <= na->alap - 1) {
1377 for (tp_idx = na->n_unit_types - 1; tp_idx >= 0; --tp_idx) {
1378 int idx = ILPVAR_IDX(na, tp_idx, t);
1379 ARR_APP1(int, tmp_var_idx, na->ilp_vars.x[idx]);
1384 if (ARR_LEN(tmp_var_idx) > 0)
1385 lpp_set_factor_fast_bulk(lpp, cst, tmp_var_idx, ARR_LEN(tmp_var_idx), 1.0);
1387 DEL_ARR_F(tmp_var_idx);
1390 DBG((env->dbg, LEVEL_1, "\t%u bundle constraints (%g sec)\n",
1391 num_cst_bundle, ilp_timer_elapsed_usec(t_cst_bundle) / 1000000.0));
1395 * Create ILP alive nodes constraints:
1396 * - set variable a_{nt}^k to 1 if nodes n is alive at step t on unit k
1398 static void create_alive_nodes_constraint(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn_t *block_node) {
1401 unsigned num_cst = 0;
1402 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
1403 ir_timer_t *t_cst = ir_timer_register("beilpsched_cst_alive_nodes", "create alive nodes constraints");
1405 ilp_timer_push(t_cst);
1407 foreach_linked_irns(ba->head_ilp_nodes, irn) {
1408 be_ilpsched_irn_t *node = get_ilpsched_irn(env, irn);
1409 ilpsched_node_attr_t *na = get_ilpsched_node_attr(node);
1412 /* we ignore nodes assigned to dummy unit here */
1413 if (na->is_dummy_node)
1416 /* check check all time steps: asap(n) <= t <= U */
1417 for (t = na->asap - 1; t < ba->max_steps; ++t) {
1420 /* for all unit types available for this node */
1421 for (node_tp_idx = na->n_unit_types - 1; node_tp_idx >= 0; --node_tp_idx) {
1422 unsigned tn, tn_max, idx;
1424 int *tmp_var_idx_n = NEW_ARR_F(int, 0);
1425 int *tmp_var_idx_m = NEW_ARR_F(int, 0);
1427 snprintf(buf, sizeof(buf), "alive_node_cst_%u_n%u_%s",
1428 t, get_irn_idx(irn), na->type_info[node_tp_idx].tp->name);
1429 cst = lpp_add_cst_uniq(lpp, buf, lpp_less, 0.0);
1430 DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1433 tn_max = MIN(na->alap - 1, t);
1434 /* check if the node has been scheduled so far */
1435 for (tn = na->asap - 1; tn <= tn_max; ++tn) {
1436 int idx = ILPVAR_IDX(na, node_tp_idx, tn);
1437 ARR_APP1(int, tmp_var_idx_n, na->ilp_vars.x[idx]);
1440 if (ARR_LEN(tmp_var_idx_n) > 0)
1441 lpp_set_factor_fast_bulk(lpp, cst, tmp_var_idx_n, ARR_LEN(tmp_var_idx_n), (double)(na->n_consumer));
1442 DEL_ARR_F(tmp_var_idx_n);
1444 /* subtract the number of consumer scheduled so far */
1445 for (i = ARR_LEN(na->block_consumer) - 1; i >= 0; --i) {
1446 be_ilpsched_irn_t *cons = get_ilpsched_irn(env, na->block_consumer[i]);
1447 ilpsched_node_attr_t *ca = get_ilpsched_node_attr(cons);
1449 unsigned tm, tm_max;
1451 tm_max = MIN(ca->alap - 1, t);
1452 for (tp_idx = ca->n_unit_types - 1; tp_idx >= 0; --tp_idx) {
1453 for (tm = ca->asap - 1; tm <= tm_max; ++tm) {
1454 int idx = ILPVAR_IDX(ca, tp_idx, tm);
1455 ARR_APP1(int, tmp_var_idx_m, ca->ilp_vars.x[idx]);
1460 if (ARR_LEN(tmp_var_idx_m) > 0)
1461 lpp_set_factor_fast_bulk(lpp, cst, tmp_var_idx_m, ARR_LEN(tmp_var_idx_m), -1.0);
1462 DEL_ARR_F(tmp_var_idx_m);
1465 idx = ILPVAR_IDX_DEAD(ba, na, node_tp_idx, t);
1466 lpp_set_factor_fast(lpp, cst, na->ilp_vars.a[idx], 0.0 - (double)(na->n_consumer));
1472 DBG((env->dbg, LEVEL_1, "\t%u alive nodes constraints (%g sec)\n",
1473 num_cst, ilp_timer_elapsed_usec(t_cst) / 1000000.0));
1477 * Create ILP alive nodes constraints for live-in nodes:
1478 * - set variable a_{nt}^k to 1 if nodes n is alive at step t on unit k
1480 static void create_alive_livein_nodes_constraint(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn_t *block_node) {
1482 ilp_livein_node_t *livein;
1483 unsigned num_cst = 0;
1484 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
1485 ir_timer_t *t_cst = ir_timer_register("beilpsched_cst_alive_livein_nodes", "create alive livein nodes constraints");
1487 ilp_timer_push(t_cst);
1489 foreach_pset(ba->livein_nodes, livein) {
1490 ir_node *irn = livein->irn;
1491 be_ilpsched_irn_t *node = get_ilpsched_irn(env, irn);
1492 ilpsched_node_attr_t *na = get_ilpsched_node_attr(node);
1495 /* check check all time steps: 0 <= t < max_alive_steps */
1496 for (t = 0; t < livein->max_alive_steps; ++t) {
1499 /* for all unit types available for this node */
1500 for (node_tp_idx = na->n_unit_types - 1; node_tp_idx >= 0; --node_tp_idx) {
1501 const ir_edge_t *edge;
1503 int cst, num_block_user;
1504 int *tmp_var_idx_m = NEW_ARR_F(int, 0);
1506 /* check the number of consumer scheduled so far */
1508 foreach_out_edge(irn, edge) {
1509 ir_node *user = get_edge_src_irn(edge);
1510 be_ilpsched_irn_t *cons;
1511 ilpsched_node_attr_t *ca;
1513 unsigned tm, tm_max;
1515 /* check only users within current block */
1516 if (get_nodes_block(user) != block_node->irn)
1520 cons = get_ilpsched_irn(env, user);
1521 ca = get_ilpsched_node_attr(cons);
1523 tm_max = MIN(ca->alap - 1, t);
1524 for (tp_idx = ca->n_unit_types - 1; tp_idx >= 0; --tp_idx) {
1525 for (tm = ca->asap - 1; tm <= tm_max; ++tm) {
1526 int idx = ILPVAR_IDX(ca, tp_idx, tm);
1527 ARR_APP1(int, tmp_var_idx_m, ca->ilp_vars.x[idx]);
1532 snprintf(buf, sizeof(buf), "alive_livein_node_cst_%u_n%u_%s",
1533 t, get_irn_idx(irn), na->type_info[node_tp_idx].tp->name);
1534 cst = lpp_add_cst_uniq(lpp, buf, lpp_greater, (double)num_block_user);
1535 DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1538 /* sum(scheduled users) */
1539 if (ARR_LEN(tmp_var_idx_m) > 0)
1540 lpp_set_factor_fast_bulk(lpp, cst, tmp_var_idx_m, ARR_LEN(tmp_var_idx_m), 1.0);
1541 DEL_ARR_F(tmp_var_idx_m);
1543 /* + c * a_{nt}^k */
1544 idx = node_tp_idx * livein->max_alive_steps + t;
1545 lpp_set_factor_fast(lpp, cst, livein->a[idx], (double)(num_block_user));
1550 DBG((env->dbg, LEVEL_1, "\t%u alive livein nodes constraints (%g sec)\n",
1551 num_cst, ilp_timer_elapsed_usec(t_cst) / 1000000.0));
1555 * Create ILP pressure constraints, based on alive nodes:
1556 * - add additional costs to objective function if a node is scheduled
1557 * on a unit although all units of this type are currently occupied
1559 static void create_pressure_alive_constraint(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn_t *block_node) {
1562 unsigned num_cst = 0;
1563 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
1564 ir_timer_t *t_cst = ir_timer_register("beilpsched_cst_pressure", "create pressure constraints");
1566 ilp_timer_push(t_cst);
1567 /* y_{nt}^k is set for each node and timestep and unit type */
1568 foreach_linked_irns(ba->head_ilp_nodes, cur_irn) {
1569 unsigned cur_idx = get_irn_idx(cur_irn);
1570 be_ilpsched_irn_t *cur_node = get_ilpsched_irn(env, cur_irn);
1571 ilpsched_node_attr_t *cur_na = get_ilpsched_node_attr(cur_node);
1574 /* we ignore nodes assigned to DUMMY unit here */
1575 if (cur_na->is_dummy_node)
1579 for (glob_type_idx = env->cpu->n_unit_types - 1; glob_type_idx >= 0; --glob_type_idx) {
1580 be_execution_unit_type_t *cur_tp = &env->cpu->unit_types[glob_type_idx];
1584 /* BEWARE: the DUMMY unit types is not in CPU, so it's skipped automatically */
1586 /* check if node can be executed on this unit type */
1587 cur_tp_idx = is_valid_unit_type_for_node(cur_tp, cur_node);
1591 /* check all time_steps at which the current node can be scheduled */
1592 for (t = cur_na->asap - 1; t <= cur_na->alap - 1; ++t) {
1595 int *tmp_var_idx = NEW_ARR_F(int, 0);
1596 ilp_livein_node_t *livein;
1598 snprintf(buf, sizeof(buf), "pressure_cst_n%u_%u_%s", cur_idx, t, cur_tp->name);
1599 cst = lpp_add_cst_uniq(lpp, buf, lpp_less, (double)(cur_tp->n_units - 1));
1600 DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1603 /* - accumulate all nodes alive at point t on unit type k */
1604 foreach_linked_irns(ba->head_ilp_nodes, irn) {
1605 be_ilpsched_irn_t *node = get_ilpsched_irn(env, irn);
1606 ilpsched_node_attr_t *na = get_ilpsched_node_attr(node);
1609 /* check if node can be alive here */
1610 if (t < na->asap - 1)
1613 tp_idx = is_valid_unit_type_for_node(cur_tp, node);
1615 /* current type is not suitable */
1619 a_idx = ILPVAR_IDX_DEAD(ba, na, tp_idx, t);
1620 ARR_APP1(int, tmp_var_idx, na->ilp_vars.a[a_idx]);
1622 /* do the same for livein nodes */
1623 foreach_pset(ba->livein_nodes, livein) {
1624 ir_node *irn = livein->irn;
1625 be_ilpsched_irn_t *node = get_ilpsched_irn(env, irn);
1628 /* check if node can be alive here */
1629 if (t >= livein->max_alive_steps)
1632 tp_idx = is_valid_unit_type_for_node(cur_tp, node);
1634 /* current type is not suitable */
1638 a_idx = tp_idx * livein->max_alive_steps + t;
1639 ARR_APP1(int, tmp_var_idx, livein->a[a_idx]);
1642 if (ARR_LEN(tmp_var_idx) > 0)
1643 lpp_set_factor_fast_bulk(lpp, cst, tmp_var_idx, ARR_LEN(tmp_var_idx), 1.0);
1644 DEL_ARR_F(tmp_var_idx);
1646 /* - num_nodes * y_{nt}^k */
1647 y_idx = ILPVAR_IDX(cur_na, cur_tp_idx, t);
1648 lpp_set_factor_fast(lpp, cst, cur_na->ilp_vars.y[y_idx], -1.0);
1653 DBG((env->dbg, LEVEL_1, "\t%u pressure constraints (%g sec)\n",
1654 num_cst, ilp_timer_elapsed_usec(t_cst) / 1000000.0));
1658 * Create ILP branch constraints:
1659 * Assure, alle nodes are scheduled prior to cfg op.
1661 static void create_branch_constraint(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn_t *block_node) {
1663 ir_node *cur_irn, *cfop;
1664 unsigned num_cst = 0;
1665 unsigned num_non_branches = 0;
1666 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
1667 ir_timer_t *t_cst = ir_timer_register("beilpsched_cst_branch", "create branch constraints");
1669 ilp_timer_push(t_cst);
1671 /* determine number of non-branch nodes and the one and only branch node */
1672 foreach_linked_irns(ba->head_ilp_nodes, cur_irn) {
1673 switch (get_irn_opcode(cur_irn)) {
1683 if (is_cfop(cur_irn)) {
1684 assert(cfop == NULL && "Highlander - there can be only one to be constrained");
1695 be_ilpsched_irn_t *cf_node = get_ilpsched_irn(env, cfop);
1696 ilpsched_node_attr_t *cf_na = get_ilpsched_node_attr(cf_node);
1699 /* for each time step */
1700 for (t = cf_na->asap - 1; t <= cf_na->alap - 1; ++t) {
1701 int *non_branch_vars, *branch_vars;
1704 snprintf(buf, sizeof(buf), "branch_cst_%u_n%u", t, get_irn_idx(cfop));
1705 cst = lpp_add_cst_uniq(lpp, buf, lpp_greater, 0.0);
1706 DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1709 /* sum(overall non branches: n)x_{nt}^k - sum(overall branches: b)(num_non_branches * x_{bt}^k >= 0) */
1710 non_branch_vars = NEW_ARR_F(int, 0);
1711 branch_vars = NEW_ARR_F(int, 0);
1712 foreach_linked_irns(ba->head_ilp_nodes, cur_irn) {
1713 be_ilpsched_irn_t *node = get_ilpsched_irn(env, cur_irn);
1714 ilpsched_node_attr_t *na = get_ilpsched_node_attr(node);
1717 if (cur_irn == cfop) {
1718 /* for all unit types available for this node */
1719 for (tp_idx = na->n_unit_types - 1; tp_idx >= 0; --tp_idx) {
1720 unsigned idx = ILPVAR_IDX(na, tp_idx, t);
1721 ARR_APP1(int, branch_vars, na->ilp_vars.x[idx]);
1725 /* sum up all possible schedule points for this node upto current timestep */
1726 for (tp_idx = na->n_unit_types - 1; tp_idx >= 0; --tp_idx) {
1728 unsigned tmax = MIN(t, na->alap - 1);
1730 for (tn = na->asap - 1; tn <= tmax; ++tn) {
1731 unsigned idx = ILPVAR_IDX(na, tp_idx, tn);
1732 ARR_APP1(int, non_branch_vars, na->ilp_vars.x[idx]);
1739 if (ARR_LEN(non_branch_vars) > 0)
1740 lpp_set_factor_fast_bulk(lpp, cst, non_branch_vars, ARR_LEN(non_branch_vars), 1.0);
1741 if (ARR_LEN(branch_vars) > 0)
1742 lpp_set_factor_fast_bulk(lpp, cst, branch_vars, ARR_LEN(branch_vars), 0.0 - (double)num_non_branches);
1744 DEL_ARR_F(branch_vars);
1745 DEL_ARR_F(non_branch_vars);
1749 DBG((env->dbg, LEVEL_1, "\t%u branch constraints (%g sec)\n",
1750 num_cst, ilp_timer_elapsed_usec(t_cst) / 1000000.0));
1754 static void create_proj_keep_constraints(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn_t *block_node) {
1757 unsigned num_cst = 0;
1758 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
1759 ir_timer_t *t_cst = ir_timer_register("beilpsched_cst_projkeep", "create proj and keep constraints");
1761 ilp_timer_push(t_cst);
1762 /* check all nodes */
1763 foreach_linked_irns(ba->head_ilp_nodes, irn) {
1764 be_ilpsched_irn_t *node;
1765 ilpsched_node_attr_t *na;
1769 /* only mode_T nodes can have Projs and Keeps assigned */
1770 if (get_irn_mode(irn) != mode_T)
1773 node = get_ilpsched_irn(env, irn);
1774 na = get_ilpsched_node_attr(node);
1776 /* check if has some Projs and Keeps assigned */
1777 if (! na->projkeeps)
1780 /* we can run only once over the queue, so preserve the nodes */
1781 pk = NEW_ARR_F(ir_node *, 0);
1782 while (! waitq_empty(na->projkeeps))
1783 ARR_APP1(ir_node *, pk, waitq_get(na->projkeeps));
1784 del_waitq(na->projkeeps);
1785 na->projkeeps = NULL;
1787 /* for all time steps at which this node can be scheduled */
1788 for (t = na->asap - 1; t <= na->alap - 1; ++t) {
1790 int *tmp_var_idx_n = NEW_ARR_F(int, 0);
1792 /* add the constraint, assure, that a node is always scheduled along with it's Projs and Keeps */
1793 snprintf(buf, sizeof(buf), "projkeep_cst_n%u_%u", get_irn_idx(irn), t);
1794 cst = lpp_add_cst_uniq(lpp, buf, lpp_equal, 0.0);
1795 DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1798 /* sum up scheduling variables for this time step */
1799 for (tp_idx = na->n_unit_types - 1; tp_idx >= 0; --tp_idx) {
1800 int idx = ILPVAR_IDX(na, tp_idx, t);
1801 ARR_APP1(int, tmp_var_idx_n, na->ilp_vars.x[idx]);
1804 if (ARR_LEN(tmp_var_idx_n) > 0)
1805 lpp_set_factor_fast_bulk(lpp, cst, tmp_var_idx_n, ARR_LEN(tmp_var_idx_n), (double)(ARR_LEN(pk)));
1806 DEL_ARR_F(tmp_var_idx_n);
1808 /* subtract all Proj and Keep variables for this step */
1809 for (i = ARR_LEN(pk) - 1; i >= 0; --i) {
1810 be_ilpsched_irn_t *pk_node = get_ilpsched_irn(env, pk[i]);
1811 ilpsched_node_attr_t *pk_na = get_ilpsched_node_attr(pk_node);
1814 for (pk_tp_idx = pk_na->n_unit_types - 1; pk_tp_idx >= 0; --pk_tp_idx) {
1815 int idx = ILPVAR_IDX(pk_na, pk_tp_idx, t);
1816 lpp_set_factor_fast(lpp, cst, pk_na->ilp_vars.x[idx], -1.0);
1822 DBG((env->dbg, LEVEL_1, "\t%u Proj and Keep constraints (%g sec)\n",
1823 num_cst, ilp_timer_elapsed_usec(t_cst) / 1000000.0));
1827 /***************************************************
1829 * |_ _| | | __ \ (_)
1830 * | | | | | |__) | _ __ ___ __ _ _ _ __
1831 * | | | | | ___/ | '_ ` _ \ / _` | | '_ \
1832 * _| |_| |____| | | | | | | | (_| | | | | |
1833 * |_____|______|_| |_| |_| |_|\__,_|_|_| |_|
1835 ***************************************************/
1838 * Create the ilp (add variables, build constraints, solve, build schedule from solution).
1840 static void create_ilp(ir_node *block, void *walk_env) {
1841 be_ilpsched_env_t *env = walk_env;
1842 be_ilpsched_irn_t *block_node = get_ilpsched_irn(env, block);
1843 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
1844 FILE *logfile = NULL;
1847 struct obstack var_obst;
1850 DBG((env->dbg, 255, "\n\n\n=========================================\n"));
1851 DBG((env->dbg, 255, " ILP Scheduling for %+F\n", block));
1852 DBG((env->dbg, 255, "=========================================\n\n"));
1854 DBG((env->dbg, LEVEL_1, "Creating ILP Variables for nodes in %+F (%u interesting nodes, %u max steps)\n",
1855 block, ba->n_interesting_nodes, ba->max_steps));
1857 /* notify backend and get block environment */
1858 env->block_env = be_ilp_sched_init_block_ilp_schedule(env->sel, block);
1860 /* if we have less than two interesting nodes, there is no need to create the ILP */
1861 if (ba->n_interesting_nodes > 1) {
1862 double fact_var = ba->n_interesting_nodes > 25 ? 2.3 : 3;
1863 double fact_cst = ba->n_interesting_nodes > 25 ? 3 : 4.5;
1864 int base_num = ba->n_interesting_nodes * ba->n_interesting_nodes;
1865 int estimated_n_var = (int)((double)base_num * fact_var);
1866 int estimated_n_cst = (int)((double)base_num * fact_cst);
1868 DBG((env->dbg, LEVEL_1, "Creating LPP with estimated numbers: %d vars, %d cst\n",
1869 estimated_n_var, estimated_n_cst));
1870 (void) estimated_n_var;
1872 /* set up the LPP object */
1873 snprintf(name, sizeof(name), "ilp scheduling IRG %s", get_entity_ld_name(get_irg_entity(env->irg)));
1875 lpp = new_lpp_userdef(
1878 estimated_n_cst, /* num vars */
1879 estimated_n_cst + 1, /* num cst */
1880 1.3); /* grow factor */
1881 obstack_init(&var_obst);
1883 /* create ILP variables */
1884 create_variables(env, lpp, block_node, &var_obst);
1886 /* create ILP constraints */
1887 DBG((env->dbg, LEVEL_1, "Creating constraints for nodes in %+F:\n", block));
1888 create_assignment_and_precedence_constraints(env, lpp, block_node);
1889 create_ressource_constraints(env, lpp, block_node);
1890 create_bundle_constraints(env, lpp, block_node);
1891 create_branch_constraint(env, lpp, block_node);
1892 //create_proj_keep_constraints(env, lpp, block_node);
1894 if (env->opts->regpress) {
1895 create_alive_nodes_constraint(env, lpp, block_node);
1896 create_alive_livein_nodes_constraint(env, lpp, block_node);
1897 create_pressure_alive_constraint(env, lpp, block_node);
1900 DBG((env->dbg, LEVEL_1, "ILP to solve: %u variables, %u constraints\n", lpp->var_next, lpp->cst_next));
1902 /* debug stuff, dump lpp when debugging is on */
1904 if (firm_dbg_get_mask(env->dbg) > 1) {
1908 snprintf(buf, sizeof(buf), "lpp_block_%lu.txt", get_irn_node_nr(block));
1909 f = fopen(buf, "w");
1910 lpp_dump_plain(lpp, f);
1912 snprintf(buf, sizeof(buf), "lpp_block_%lu.mps", get_irn_node_nr(block));
1917 /* set solve time limit */
1918 lpp_set_time_limit(lpp, env->opts->time_limit);
1920 /* set logfile if requested */
1921 if (strlen(env->opts->log_file) > 0) {
1922 if (strcasecmp(env->opts->log_file, "stdout") == 0)
1923 lpp_set_log(lpp, stdout);
1924 else if (strcasecmp(env->opts->log_file, "stderr") == 0)
1925 lpp_set_log(lpp, stderr);
1927 logfile = fopen(env->opts->log_file, "w");
1929 fprintf(stderr, "Could not open logfile '%s'! Logging disabled.\n", env->opts->log_file);
1931 lpp_set_log(lpp, logfile);
1936 lpp_solve_net(lpp, env->main_env->options->ilp_server, env->main_env->options->ilp_solver);
1941 /* check for valid solution */
1942 if (! lpp_is_sol_valid(lpp)) {
1947 if (firm_dbg_get_mask(env->dbg) >= 2) {
1948 snprintf(buf, sizeof(buf), "lpp_block_%lu.infeasible.txt", get_irn_node_nr(block));
1949 f = fopen(buf, "w");
1950 lpp_dump_plain(lpp, f);
1952 snprintf(buf, sizeof(buf), "lpp_block_%lu.infeasible.mps", get_irn_node_nr(block));
1954 dump_ir_block_graph(env->irg, "-infeasible");
1958 ir_fprintf(stderr, "ILP found no solution within time (%+F, %+F), falling back to heuristics.\n", block, env->irg);
1962 DBG((env->dbg, LEVEL_1, "\nSolution:\n"));
1963 DBG((env->dbg, LEVEL_1, "\tsend time: %g sec\n", lpp->send_time / 1000000.0));
1964 DBG((env->dbg, LEVEL_1, "\treceive time: %g sec\n", lpp->recv_time / 1000000.0));
1965 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));
1966 DBG((env->dbg, LEVEL_1, "\titerations: %d\n", lpp->iterations));
1967 DBG((env->dbg, LEVEL_1, "\tsolution time: %g\n", lpp->sol_time));
1968 DBG((env->dbg, LEVEL_1, "\tobjective function: %g\n", LPP_VALUE_IS_0(lpp->objval) ? 0.0 : lpp->objval));
1969 DBG((env->dbg, LEVEL_1, "\tbest bound: %g\n", LPP_VALUE_IS_0(lpp->best_bound) ? 0.0 : lpp->best_bound));
1971 DBG((env->dbg, LEVEL_1, "variables used %u bytes\n", obstack_memory_used(&var_obst)));
1974 /* apply solution */
1975 be_stat_ev("nodes", ba->block_last_idx);
1976 be_stat_ev("vars", lpp ? lpp->var_next : 0);
1977 be_stat_ev("csts", lpp ? lpp->cst_next : 0);
1979 be_stat_ev("time", -1);
1980 be_stat_ev_dbl("opt", 0.0);
1981 list_sched_single_block(env->birg, block, env->be_opts);
1985 double opt = lpp->sol_state == lpp_optimal ? 100.0 : 100.0 * lpp->best_bound / lpp->objval;
1986 be_stat_ev_dbl("time", lpp->sol_time);
1987 be_stat_ev_dbl("opt", opt);
1990 be_stat_ev_dbl("time", 0.0);
1991 be_stat_ev_dbl("opt", 100.0);
1993 apply_solution(env, lpp, block);
1999 /* notify backend */
2000 be_ilp_sched_finish_block_ilp_schedule(env->sel, block, env->block_env);
2004 * Perform ILP scheduling on the given irg.
2006 void be_ilp_sched(const be_irg_t *birg, be_options_t *be_opts) {
2007 be_ilpsched_env_t env;
2008 const char *name = "be ilp scheduling";
2009 ir_graph *irg = be_get_birg_irg(birg);
2010 const arch_env_t *arch_env = be_get_birg_arch_env(birg);
2011 const ilp_sched_selector_t *sel = arch_env->impl->get_ilp_sched_selector(arch_env);
2013 FIRM_DBG_REGISTER(env.dbg, "firm.be.sched.ilp");
2015 stat_ev_ctx_push("ilpsched");
2017 // firm_dbg_set_mask(env.dbg, 1);
2019 env.irg_env = be_ilp_sched_init_irg_ilp_schedule(sel, irg);
2022 env.height = heights_new(irg);
2023 env.main_env = birg->main_env;
2024 env.arch_env = arch_env;
2025 env.cpu = arch_env_get_machine(arch_env);
2026 env.opts = &ilp_opts;
2028 env.be_opts = be_opts;
2029 phase_init(&env.ph, name, env.irg, PHASE_DEFAULT_GROWTH, init_ilpsched_irn, NULL);
2031 /* assign a unique per block number to all interesting nodes */
2032 irg_walk_in_or_dep_graph(env.irg, NULL, build_block_idx, &env);
2035 The block indices are completely build after the walk,
2036 now we can allocate the bitsets (size depends on block indices)
2039 phase_reinit_irn_data(&env.ph);
2041 /* Collect all root nodes (having no user in their block) and calculate ASAP. */
2042 irg_walk_in_or_dep_blkwise_graph(env.irg, collect_alap_root_nodes, calculate_irn_asap, &env);
2044 /* Calculate ALAP of all irns */
2045 irg_block_walk_graph(env.irg, NULL, calculate_block_alap, &env);
2047 /* We refine the {ASAP(n), ALAP(n)} interval and fix the time steps for Projs and Keeps */
2048 irg_walk_in_or_dep_blkwise_graph(env.irg, NULL, refine_asap_alap_times, &env);
2050 /* perform ILP scheduling */
2051 irg_block_walk_graph(env.irg, NULL, create_ilp, &env);
2054 if (firm_dbg_get_mask(env.dbg)) {
2056 phase_stat_t *stat_ptr = phase_stat(&env.ph, &stat);
2058 fprintf(stderr, "Phase used: %u bytes\n", stat_ptr->overall_bytes);
2062 /* free data allocated dynamically */
2063 irg_block_walk_graph(env.irg, NULL, clear_unwanted_data, &env);
2065 /* free all allocated object */
2066 phase_free(&env.ph);
2067 heights_free(env.height);
2069 /* notify backend */
2070 be_ilp_sched_finish_irg_ilp_schedule(sel, birg->irg, env.irg_env);
2072 stat_ev_ctx_pop("ilpsched");
2076 * Register ILP scheduler options.
2078 void be_init_ilpsched(void)
2080 lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
2081 lc_opt_entry_t *sched_grp = lc_opt_get_grp(be_grp, "ilpsched");
2083 lc_opt_add_table(sched_grp, ilpsched_option_table);
2086 #else /* WITH_ILP */
2088 static inline void some_picky_compiler_do_not_allow_empty_files(void)
2091 #endif /* WITH_ILP */