2 * Scheduling algorithms.
3 * An ILP scheduler based on
4 * "ILP-based Instruction Scheduling for IA-64"
5 * by Daniel Kaestner and Sebastian Winkel
8 * @author Christian Wuerdig
26 #include "irphase_t.h"
36 #include <lpp/lpp_net.h>
39 #include <libcore/lc_opts.h>
40 #include <libcore/lc_opts_enum.h>
41 #include <libcore/lc_timing.h>
42 #endif /* WITH_LIBCORE */
46 #include "besched_t.h"
47 #include "beilpsched.h"
49 typedef struct _ilpsched_options_t {
55 typedef struct _unit_type_info_t {
57 const be_execution_unit_type_t *tp;
61 * holding the ILP variables of the different types
63 typedef struct _ilp_var_types_t {
64 int *x; /* x_{nt}^k variables */
65 int *a; /* a_{nt}^k variables */
66 int *d; /* d_{nt}^k variables */
67 int *y; /* y_{nt}^k variables */
70 /* attributes for a node */
71 typedef struct _ilpsched_node_attr_t {
72 unsigned asap; /**< The ASAP scheduling control step */
73 unsigned alap; /**< The ALAP scheduling control step */
74 unsigned latency; /**< Latency of this node (needed for sorting) */
75 unsigned sched_point; /**< the step in which the node is finally scheduled */
76 unsigned visit_idx; /**< Index of the node having visited this node last */
77 unsigned consumer_idx; /**< Index of the node having counted this node as consumer last */
78 unsigned n_consumer; /**< Number of consumers */
79 ir_node **block_consumer; /**< List of consumer being in the same block */
80 waitq *projkeeps; /**< A List of Projs and Keeps belonging to this node */
81 unsigned block_idx : 30; /**< A unique per block index */
82 unsigned alap_changed : 1; /**< the current ALAP has changed, revisit preds */
83 unsigned is_dummy_node : 1; /**< this node is assigned to DUMMY unit */
84 bitset_t *transitive_block_nodes; /**< Set of transitive block nodes (predecessors
85 for ASAP, successors for ALAP */
86 unsigned n_unit_types; /**< number of allowed execution unit types */
87 unit_type_info_t *type_info; /**< list of allowed execution unit types */
88 ilp_var_types_t ilp_vars; /**< the different ILP variables */
89 } ilpsched_node_attr_t;
91 /* attributes for a block */
92 typedef struct _ilpsched_block_attr_t {
93 unsigned block_last_idx; /**< The highest node index in block so far */
94 unsigned n_interesting_nodes; /**< The number of nodes interesting for scheduling */
95 unsigned max_steps; /**< Upper bound for block execution */
96 plist_t *root_nodes; /**< A list of nodes having no user in current block */
97 ir_node *head_ilp_nodes; /**< A linked list of nodes which will contribute to ILP */
98 } ilpsched_block_attr_t;
100 typedef union _ilpsched_attr_ {
101 ilpsched_node_attr_t node_attr;
102 ilpsched_block_attr_t block_attr;
105 /* A irn for the phase and it's attributes (either node or block) */
108 ilpsched_attr_t attr;
111 /* The ILP scheduling environment */
113 phase_t ph; /**< The phase */
114 ir_graph *irg; /**< The current irg */
115 heights_t *height; /**< The heights object of the irg */
116 void *irg_env; /**< An environment for the irg scheduling, provided by the backend */
117 void *block_env; /**< An environment for scheduling a block, provided by the backend */
118 const arch_env_t *arch_env;
119 const arch_isa_t *isa; /**< The ISA */
120 const be_main_env_t *main_env;
121 const be_machine_t *cpu; /**< the current abstract machine */
122 ilpsched_options_t *opts; /**< the ilp options for current irg */
123 const ilp_sched_selector_t *sel; /**< The ILP sched selector provided by the backend */
124 DEBUG_ONLY(firm_dbg_module_t *dbg);
127 /* convenience macros to handle phase irn data */
128 #define get_ilpsched_irn(ilpsched_env, irn) (phase_get_or_set_irn_data(&(ilpsched_env)->ph, (irn)))
129 #define is_ilpsched_block(node) (is_Block((node)->irn))
130 #define get_ilpsched_block_attr(block) (&(block)->attr.block_attr)
131 #define get_ilpsched_node_attr(node) (&(node)->attr.node_attr)
133 /* iterate over a list of ir_nodes linked by link field */
134 #define foreach_linked_irns(head, iter) for ((iter) = (head); (iter); (iter) = get_irn_link((iter)))
136 /* check if node is considered for ILP scheduling */
137 #define consider_for_sched(isa, irn) \
138 (! (is_Block(irn) || \
139 is_normal_Proj(isa, irn) || \
146 /* gives the valid scheduling time step interval for a node */
147 #define VALID_SCHED_INTERVAL(na) ((na)->alap - (na)->asap + 1)
149 /* gives the valid interval where a node can die */
150 #define VALID_KILL_INTERVAL(ba, na) ((ba)->max_steps - (na)->asap + 1)
152 /* gives the corresponding ILP variable for given node, unit and time step */
153 #define ILPVAR_IDX(na, unit, control_step) \
154 ((unit) * VALID_SCHED_INTERVAL((na)) + (control_step) - (na)->asap + 1)
156 /* gives the corresponding dead nodes ILP variable for given node, unit and time step */
157 #define ILPVAR_IDX_DEAD(ba, na, unit, control_step) \
158 ((unit) * VALID_KILL_INTERVAL((ba), (na)) + (control_step) - (na)->asap + 1)
160 /* check if a double value is within an epsilon environment of 0 */
161 #define LPP_VALUE_IS_0(dbl) (fabs((dbl)) <= 1e-10)
164 #define ilp_timer_push(t) lc_timer_push((t))
165 #define ilp_timer_pop() lc_timer_pop()
166 #define ilp_timer_elapsed_usec(t) lc_timer_elapsed_usec((t))
167 #else /* WITH_LIBCORE */
168 #define ilp_timer_push(t)
169 #define ilp_timer_pop()
170 #define ilp_timer_elapsed_usec(t) 0.0
171 #endif /* WITH_LIBCORE */
173 /* option variable */
174 static ilpsched_options_t ilp_opts = {
175 70, /* if we have more than 70 nodes: use alive nodes constraint */
176 120, /* 300 sec per block time limit */
182 static const lc_opt_table_entry_t ilpsched_option_table[] = {
183 LC_OPT_ENT_INT("limit_dead", "Upto how many nodes the dead node constraint should be used", &ilp_opts.limit_dead),
184 LC_OPT_ENT_INT("time_limit", "ILP time limit per block", &ilp_opts.time_limit),
185 LC_OPT_ENT_STR("lpp_log", "LPP logfile (stderr and stdout are supported)", ilp_opts.log_file, sizeof(ilp_opts.log_file)),
188 #endif /* WITH_LIBCORE */
191 We need this global variable as we compare nodes dependent on heights,
192 but we cannot pass any information to the qsort compare function.
194 static heights_t *glob_heights;
197 * Check if irn is a Proj, which has no execution units assigned.
198 * @return 1 if irn is a Proj having no execution units assigned, 0 otherwise
200 static INLINE int is_normal_Proj(const arch_isa_t *isa, const ir_node *irn) {
201 return is_Proj(irn) && (arch_isa_get_allowed_execution_units(isa, irn) == NULL);
205 * Skips normal Projs.
206 * @return predecessor if irn is a normal Proj, otherwise irn.
208 static INLINE ir_node *skip_normal_Proj(const arch_isa_t *isa, ir_node *irn) {
209 if (is_normal_Proj(isa, irn))
210 return get_Proj_pred(irn);
214 static INLINE int fixed_latency(const ilp_sched_selector_t *sel, ir_node *irn, void *env) {
215 unsigned lat = be_ilp_sched_latency(sel, irn, env);
216 if (lat == 0 && ! is_Proj(irn) && ! be_is_Keep(irn))
223 * Compare scheduling time steps of two be_ilpsched_irn's.
225 static int cmp_ilpsched_irn(const void *a, const void *b) {
226 be_ilpsched_irn_t *n1 = *(be_ilpsched_irn_t **)a;
227 be_ilpsched_irn_t *n2 = *(be_ilpsched_irn_t **)b;
228 ilpsched_node_attr_t *n1_a = get_ilpsched_node_attr(n1);
229 ilpsched_node_attr_t *n2_a = get_ilpsched_node_attr(n2);
231 if (n1_a->sched_point == n2_a->sched_point) {
232 ir_node *irn_a = n1->irn;
233 ir_node *irn_b = n2->irn;
235 if (heights_reachable_in_block(glob_heights, irn_a, irn_b))
237 if (heights_reachable_in_block(glob_heights, irn_b, irn_a))
241 Ok, timestep is equal and the nodes are parallel,
242 so check latency and schedule high latency first.
244 return QSORT_CMP(n2_a->latency, n1_a->latency);
247 return QSORT_CMP(n1_a->sched_point, n2_a->sched_point);
251 * In case there is no phase information for irn, initialize it.
253 static void *init_ilpsched_irn(phase_t *ph, ir_node *irn, void *old) {
254 be_ilpsched_irn_t *res = old ? old : phase_alloc(ph, sizeof(res[0]));
257 /* if we have already some data: check for reinitialization */
259 if (! is_Block(irn)) {
260 ilpsched_node_attr_t *na = get_ilpsched_node_attr(res);
262 if (! na->transitive_block_nodes) {
263 ir_node *block = get_nodes_block(irn);
264 be_ilpsched_irn_t *block_node = phase_get_or_set_irn_data(ph, block);
265 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
267 /* we are called after the block indices have been build: create bitset */
268 na->transitive_block_nodes = bitset_obstack_alloc(phase_obst(ph), ba->block_last_idx);
271 /* we are called from reinit block data: clear the bitset */
272 bitset_clear_all(na->transitive_block_nodes);
274 na->alap_changed = 1;
282 /* set ilpsched irn attributes (either block or irn) */
284 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(res);
286 ba->n_interesting_nodes = 0;
287 ba->block_last_idx = 0;
288 ba->root_nodes = plist_new();
289 ba->head_ilp_nodes = NULL;
293 ilpsched_node_attr_t *na = get_ilpsched_node_attr(res);
294 memset(na, 0, sizeof(*na));
301 * Assign a per block unique number to each node.
303 static void build_block_idx(ir_node *irn, void *walk_env) {
304 be_ilpsched_env_t *env = walk_env;
305 be_ilpsched_irn_t *node, *block_node;
306 ilpsched_node_attr_t *na;
307 ilpsched_block_attr_t *ba;
309 if (! consider_for_sched(env->arch_env->isa, irn))
312 node = get_ilpsched_irn(env, irn);
313 na = get_ilpsched_node_attr(node);
314 block_node = get_ilpsched_irn(env, get_nodes_block(irn));
315 ba = get_ilpsched_block_attr(block_node);
317 na->block_idx = ba->block_last_idx++;
320 /********************************************************
323 * __ _ ___ __ _ _ __ / / __ _| | __ _ _ __
324 * / _` / __|/ _` | '_ \ / / / _` | |/ _` | '_ \
325 * | (_| \__ \ (_| | |_) | / / | (_| | | (_| | |_) |
326 * \__,_|___/\__,_| .__/ /_/ \__,_|_|\__,_| .__/
329 ********************************************************/
332 * Add all nodes having no user in current block to last_nodes list.
334 static void collect_alap_root_nodes(ir_node *irn, void *walk_env) {
336 const ir_edge_t *edge;
337 be_ilpsched_irn_t *block_node, *node;
338 ilpsched_block_attr_t *ba;
339 ilpsched_node_attr_t *na;
341 be_ilpsched_env_t *env = walk_env;
342 int has_block_user = 0;
343 unsigned n_consumer = 0;
344 ir_edge_kind_t ekind[2] = { EDGE_KIND_NORMAL, EDGE_KIND_DEP };
348 if (! consider_for_sched(env->arch_env->isa, irn))
351 block = get_nodes_block(irn);
352 idx = get_irn_idx(irn);
353 consumer = NEW_ARR_F(ir_node *, 0);
355 DBG((env->dbg, LEVEL_3, "%+F (%+F) is interesting, examining ... ", irn, block));
357 /* check data and dependency out edges */
358 for (i = 0; i < 2 && ! has_block_user; ++i) {
359 foreach_out_edge_kind(irn, edge, ekind[i]) {
360 ir_node *user = get_edge_src_irn(edge);
362 if (is_normal_Proj(env->arch_env->isa, user)) {
363 const ir_edge_t *user_edge;
365 if (get_irn_mode(user) == mode_X)
368 /* The ABI ensures, that there will be no ProjT nodes in the graph. */
369 for (j = 0; j < 2; ++j) {
370 foreach_out_edge_kind(user, user_edge, ekind[j]) {
371 ir_node *real_user = get_edge_src_irn(user_edge);
373 if (! is_Phi(real_user) && ! is_Block(real_user)) {
374 be_ilpsched_irn_t *node = get_ilpsched_irn(env, real_user);
375 ilpsched_node_attr_t *ua = get_ilpsched_node_attr(node);
377 /* skip already visited nodes */
378 if (ua->consumer_idx == idx)
381 /* check if node has user in this block and collect the user if it's a data user */
382 if (get_nodes_block(real_user) == block) {
383 if (i == 0 && j == 0)
384 ARR_APP1(ir_node *, consumer, real_user);
388 /* only count data consumer */
392 /* mark user as visited by this node */
393 ua->consumer_idx = idx;
398 else if (is_Block(user)) {
401 else if (! is_Phi(user)) {
402 be_ilpsched_irn_t *node = get_ilpsched_irn(env, user);
403 ilpsched_node_attr_t *ua = get_ilpsched_node_attr(node);
405 /* skip already visited nodes */
406 if (ua->consumer_idx == idx)
409 /* check if node has user in this block and collect the user if it's a data user */
410 if (get_nodes_block(user) == block) {
412 ARR_APP1(ir_node *, consumer, user);
416 /* only count data consumer */
420 /* mark user visited by this node */
421 ua->consumer_idx = idx;
426 block_node = get_ilpsched_irn(env, block);
427 ba = get_ilpsched_block_attr(block_node);
429 ba->n_interesting_nodes++;
431 /* current irn has no user inside this block, add to queue */
432 if (! has_block_user) {
433 DB((env->dbg, LEVEL_3, "root node\n"));
434 plist_insert_back(ba->root_nodes, irn);
437 DB((env->dbg, LEVEL_3, "normal node\n"));
440 /* record number of all consumer and the consumer within the same block */
441 node = get_ilpsched_irn(env, irn);
442 na = get_ilpsched_node_attr(node);
443 na->n_consumer = n_consumer;
444 na->block_consumer = NEW_ARR_D(ir_node *, phase_obst(&env->ph), ARR_LEN(consumer));
445 memcpy(na->block_consumer, consumer, ARR_LEN(consumer) * sizeof(na->block_consumer[0]));
450 * Calculate the ASAP scheduling step for current irn.
452 static void calculate_irn_asap(ir_node *irn, void *walk_env) {
453 be_ilpsched_env_t *env = walk_env;
456 be_ilpsched_irn_t *node, *block_node;
457 ilpsched_node_attr_t *na;
458 ilpsched_block_attr_t *ba;
460 /* These nodes are handled separate */
461 if (! consider_for_sched(env->arch_env->isa, irn))
464 DBG((env->dbg, LEVEL_2, "Calculating ASAP of node %+F ... ", irn));
466 block = get_nodes_block(irn);
467 node = get_ilpsched_irn(env, irn);
468 na = get_ilpsched_node_attr(node);
471 for (i = get_irn_ins_or_deps(irn) - 1; i >= 0; --i) {
472 ir_node *pred = skip_normal_Proj(env->arch_env->isa, get_irn_in_or_dep(irn, i));
474 /* check for greatest distance to top */
475 if (! is_Phi(pred) && ! is_NoMem(pred) && get_nodes_block(pred) == block) {
476 be_ilpsched_irn_t *pred_node = get_ilpsched_irn(env, pred);
477 ilpsched_node_attr_t *pna = get_ilpsched_node_attr(pred_node);
480 lat = fixed_latency(env->sel, pred, env->block_env);
482 na->asap = MAX(na->asap, pna->asap + lat);
486 /* add node to ILP node list and update max_steps */
487 block_node = get_ilpsched_irn(env, block);
488 ba = get_ilpsched_block_attr(block_node);
490 set_irn_link(irn, ba->head_ilp_nodes);
491 ba->head_ilp_nodes = irn;
492 ba->max_steps += fixed_latency(env->sel, irn, env->block_env);
494 DB((env->dbg, LEVEL_2, "%u\n", na->asap));
498 * Calculate the ALAP scheduling step of all irns in current block.
499 * Depends on max_steps being calculated.
501 static void calculate_block_alap(ir_node *block, void *walk_env) {
502 be_ilpsched_env_t *env = walk_env;
503 be_ilpsched_irn_t *block_node = get_ilpsched_irn(env, block);
504 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
505 waitq *cur_queue = new_waitq();
508 assert(is_Block(block));
510 DBG((env->dbg, LEVEL_2, "Calculating ALAP for nodes in %+F (%u nodes, %u max steps)\n",
511 block, ba->n_interesting_nodes, ba->max_steps));
513 /* TODO: Might be faster to use out edges and call phase_reinit_single_irn_data */
514 //phase_reinit_block_irn_data(&env->ph, block);
516 /* init start queue */
517 foreach_plist(ba->root_nodes, el) {
518 waitq_put(cur_queue, plist_element_get_value(el));
521 /* repeat until all nodes are processed */
522 while (! waitq_empty(cur_queue)) {
523 waitq *next_queue = new_waitq();
525 /* process all nodes in current step */
526 while (! waitq_empty(cur_queue)) {
527 ir_node *cur_irn = waitq_get(cur_queue);
528 be_ilpsched_irn_t *node = get_ilpsched_irn(env, cur_irn);
529 ilpsched_node_attr_t *na = get_ilpsched_node_attr(node);
532 /* cur_node has no alap set -> it's a root node, set to max alap */
534 na->alap = ba->max_steps;
535 DBG((env->dbg, LEVEL_2, "setting ALAP of node %+F to %u, handling preds:\n",
539 DBG((env->dbg, LEVEL_2, "ALAP of node %+F is %u, handling preds:\n",
543 /* set the alap's of all predecessors */
544 for (i = get_irn_ins_or_deps(cur_irn) - 1; i >= 0; --i) {
545 ir_node *pred = skip_normal_Proj(env->arch_env->isa, get_irn_in_or_dep(cur_irn, i));
547 /* check for greatest distance to bottom */
548 if (! is_Phi(pred) && ! is_NoMem(pred) && get_nodes_block(pred) == block) {
549 be_ilpsched_irn_t *pred_node = get_ilpsched_irn(env, pred);
550 ilpsched_node_attr_t *pna = get_ilpsched_node_attr(pred_node);
553 /* mark the predecessor as visited by current irn */
554 if (pna->visit_idx == get_irn_idx(cur_irn) && ! na->alap_changed)
556 pna->visit_idx = get_irn_idx(cur_irn);
558 lat = fixed_latency(env->sel, pred, env->block_env);
560 /* set ALAP of current pred */
561 if (pna->alap == 0) {
562 /* current ALAP is 0: node has not yet been visited */
563 pna->alap_changed = 1;
564 pna->alap = na->alap - lat;
566 else if (pna->alap > na->alap - lat) {
567 /* we found a longer path to root node: change ALAP */
568 pna->alap = na->alap - lat;
569 pna->alap_changed = 1;
572 /* current ALAP is best found so far: keep it */
573 pna->alap_changed = 0;
576 DBG((env->dbg, LEVEL_2, "\tsetting ALAP of node %+F to %u\n", pred, pna->alap));
578 /* enqueue node for next iteration */
579 if (get_irn_ins_or_deps(pred) > 0)
580 waitq_put(next_queue, pred);
585 /* prepare for next iteration */
586 del_waitq(cur_queue);
587 cur_queue = next_queue;
592 * We can free the list of root nodes here.
594 static void clear_unwanted_data(ir_node *block, void *walk_env) {
595 be_ilpsched_env_t *env = walk_env;
596 be_ilpsched_irn_t *block_node = get_ilpsched_irn(env, block);
597 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
599 ir_fprintf(stderr, "visiting %+F\n", block);
600 plist_free(ba->root_nodes);
601 ba->root_nodes = NULL;
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.
608 static void refine_asap_alap_times(ir_node *irn, void *walk_env) {
609 be_ilpsched_env_t *env = walk_env;
611 be_ilpsched_irn_t *node, *pred_node;
612 ilpsched_node_attr_t *na, *pna;
614 if (! consider_for_sched(env->arch_env->isa, irn))
617 if (! is_Proj(irn) && ! be_is_Keep(irn))
620 /* go to the ancestor */
622 pred = get_irn_n(irn, 0);
623 pred = skip_Proj(pred);
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);
630 na->asap = pna->asap;
631 na->alap = pna->alap;
633 /* record all Projs and Keeps for this node */
634 if (! pna->projkeeps)
635 pna->projkeeps = new_waitq();
636 waitq_put(pna->projkeeps, irn);
638 DBG((env->dbg, LEVEL_2, "fixing ASAP/ALAP of %+F to %u/%u\n", irn, na->asap, na->alap));
641 /*******************************************
644 * ___ ___| |__ ___ __| |_ _| | ___
645 * / __|/ __| '_ \ / _ \/ _` | | | | |/ _ \
646 * \__ \ (__| | | | __/ (_| | |_| | | __/
647 * |___/\___|_| |_|\___|\__,_|\__,_|_|\___|
649 *******************************************/
651 static INLINE void check_for_keeps(waitq *keeps, ir_node *block, ir_node *irn) {
652 const ir_edge_t *edge;
654 foreach_out_edge(irn, edge) {
655 ir_node *user = get_edge_src_irn(edge);
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);
665 * Inserts @p irn before @p before into schedule and notifies backend.
667 static INLINE void notified_sched_add_before(be_ilpsched_env_t *env,
668 ir_node *before, ir_node *irn, unsigned cycle)
670 be_ilp_sched_node_scheduled(env->sel, irn, cycle, env->block_env);
671 sched_add_before(before, irn);
675 * Adds a node, it's Projs (in case of mode_T nodes) and
676 * it's Keeps to schedule.
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();
682 /* mode_M nodes are not scheduled */
683 if (get_irn_mode(irn) == mode_M)
686 if (! sched_is_scheduled(irn))
687 notified_sched_add_before(env, block, irn, cycle);
690 if (get_irn_mode(irn) == mode_T) {
691 foreach_out_edge(irn, edge) {
692 ir_node *user = get_edge_src_irn(edge);
694 if (to_appear_in_schedule(user) || get_irn_mode(user) == mode_b)
695 notified_sched_add_before(env, block, user, cycle);
697 check_for_keeps(keeps, block, user);
701 check_for_keeps(keeps, block, irn);
705 while (! waitq_empty(keeps)) {
706 ir_node *keep = waitq_get(keeps);
707 if (! sched_is_scheduled(keep))
708 notified_sched_add_before(env, block, keep, cycle);
715 * Schedule all nodes in the given block, according to the ILP solution.
717 static void apply_solution(be_ilpsched_env_t *env, lpp_t *lpp, ir_node *block) {
718 be_ilpsched_irn_t *block_node = get_ilpsched_irn(env, block);
719 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
720 sched_info_t *info = get_irn_sched_info(block);
721 be_ilpsched_irn_t **sched_nodes;
724 const ir_edge_t *edge;
726 /* init block schedule list */
727 INIT_LIST_HEAD(&info->list);
730 /* collect nodes and their scheduling time step */
731 sched_nodes = NEW_ARR_F(be_ilpsched_irn_t *, 0);
732 if (ba->n_interesting_nodes == 0) {
735 else if (ba->n_interesting_nodes == 1) {
736 be_ilpsched_irn_t *node = get_ilpsched_irn(env, ba->head_ilp_nodes);
738 /* add the single node */
739 ARR_APP1(be_ilpsched_irn_t *, sched_nodes, node);
742 /* check all nodes for their positive solution */
743 foreach_linked_irns(ba->head_ilp_nodes, irn) {
744 be_ilpsched_irn_t *node;
745 ilpsched_node_attr_t *na;
749 node = get_ilpsched_irn(env, irn);
750 na = get_ilpsched_node_attr(node);
754 /* go over all variables of a node until the non-zero one is found */
755 for (tp_idx = na->n_unit_types - 1; ! found && tp_idx >= 0; --tp_idx) {
756 for (t = na->asap - 1; ! found && t <= na->alap - 1; ++t) {
757 double val = lpp_get_var_sol(lpp, na->ilp_vars.x[cur_var++]);
759 /* check, if variable is set to one (it's not zero then :) */
760 if (! LPP_VALUE_IS_0(val)) {
762 ARR_APP1(be_ilpsched_irn_t *, sched_nodes, node);
763 DBG((env->dbg, LEVEL_1, "Schedpoint of %+F is %u at unit type %s\n",
764 irn, t, na->type_info[tp_idx].tp->name));
771 glob_heights = env->height;
772 /* sort nodes ascending by scheduling time step */
773 qsort(sched_nodes, ARR_LEN(sched_nodes), sizeof(sched_nodes[0]), cmp_ilpsched_irn);
776 /* make all Phis ready and remember the single cf op */
778 foreach_out_edge(block, edge) {
779 irn = get_edge_src_irn(edge);
781 switch (get_irn_opcode(irn)) {
783 add_to_sched(env, block, irn, 0);
792 assert(cfop == NULL && "Highlander - there can be only one");
799 /* add all nodes from list */
800 for (i = 0, l = ARR_LEN(sched_nodes); i < l; ++i) {
801 ilpsched_node_attr_t *na = get_ilpsched_node_attr(sched_nodes[i]);
802 add_to_sched(env, block, sched_nodes[i]->irn, na->sched_point);
805 /* schedule control flow node if not already done */
806 if (cfop && ! sched_is_scheduled(cfop))
807 add_to_sched(env, block, cfop, 0);
809 DEL_ARR_F(sched_nodes);
812 /***************************************************************
813 * _____ _ _____ _____ _ _
814 * |_ _| | | __ \ / ____| | | (_)
815 * | | | | | |__) | | (___ ___ ___| |_ _ ___ _ __
816 * | | | | | ___/ \___ \ / _ \/ __| __| |/ _ \| '_ \
817 * _| |_| |____| | ____) | __/ (__| |_| | (_) | | | |
818 * |_____|______|_| |_____/ \___|\___|\__|_|\___/|_| |_|
820 ***************************************************************/
823 * Check if node can be executed on given unit type.
825 static INLINE int is_valid_unit_type_for_node(const be_execution_unit_type_t *tp, be_ilpsched_irn_t *node) {
827 ilpsched_node_attr_t *na = get_ilpsched_node_attr(node);
829 for (i = na->n_unit_types - 1; i >= 0; --i) {
830 if (na->type_info[i].tp == tp)
837 /************************************************
840 * __ ____ _ _ __ _ __ _| |__ | | ___ ___
841 * \ \ / / _` | '__| |/ _` | '_ \| |/ _ \/ __|
842 * \ V / (_| | | | | (_| | |_) | | __/\__ \
843 * \_/ \__,_|_| |_|\__,_|_.__/|_|\___||___/
845 ************************************************/
848 * Create the following variables:
849 * - x_{nt}^k binary weigthed with: t
850 * node n is scheduled at time step t to unit type k
851 * ==>> These variables represent the schedule
853 * - d_{nt}^k binary weighted with: t
854 * node n dies at time step t on unit type k
855 * - a_{nt}^k binary weighted with num_nodes
856 * node n is alive at time step t on unit type k
858 * - y_{nt}^k binary weighted with: num_nodes^2
859 * node n is scheduled at time step t to unit type k
860 * although all units of this type are occupied
861 * ==>> These variables represent the register pressure
864 static void create_variables(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn_t *block_node, struct obstack *var_obst) {
867 unsigned num_block_var, num_nodes;
868 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
869 unsigned weigth_y = ba->n_interesting_nodes * ba->n_interesting_nodes;
871 lc_timer_t *t_var = lc_timer_register("beilpsched_var", "create ilp variables");
872 #endif /* WITH_LIBCORE */
874 ilp_timer_push(t_var);
875 num_block_var = num_nodes = 0;
876 foreach_linked_irns(ba->head_ilp_nodes, irn) {
877 const be_execution_unit_t ***execunits = arch_isa_get_allowed_execution_units(env->arch_env->isa, irn);
878 be_ilpsched_irn_t *node;
879 ilpsched_node_attr_t *na;
880 unsigned n_unit_types, tp_idx, unit_idx, n_var, cur_unit;
881 unsigned cur_var_ad, cur_var_x, cur_var_y, num_ad;
883 /* count number of available unit types for this node */
884 for (n_unit_types = 0; execunits[n_unit_types]; ++n_unit_types)
887 node = get_ilpsched_irn(env, irn);
888 na = get_ilpsched_node_attr(node);
890 na->n_unit_types = n_unit_types;
891 na->type_info = NEW_ARR_D(unit_type_info_t, var_obst, n_unit_types);
893 /* fill the type info array */
894 for (tp_idx = 0; tp_idx < n_unit_types; ++tp_idx) {
895 for (unit_idx = 0; execunits[tp_idx][unit_idx]; ++unit_idx) {
896 /* beware: we also count number of available units here */
897 if (be_machine_is_dummy_unit(execunits[tp_idx][unit_idx]))
898 na->is_dummy_node = 1;
901 na->type_info[tp_idx].tp = execunits[tp_idx][0]->tp;
902 na->type_info[tp_idx].n_units = unit_idx;
905 /* allocate space for ilp variables */
906 na->ilp_vars.x = NEW_ARR_D(int, var_obst, n_unit_types * VALID_SCHED_INTERVAL(na));
907 memset(na->ilp_vars.x, -1, ARR_LEN(na->ilp_vars.x) * sizeof(na->ilp_vars.x[0]));
909 /* we need these variables only for "real" nodes */
910 if (! na->is_dummy_node) {
911 na->ilp_vars.y = NEW_ARR_D(int, var_obst, n_unit_types * VALID_SCHED_INTERVAL(na));
912 memset(na->ilp_vars.y, -1, ARR_LEN(na->ilp_vars.y) * sizeof(na->ilp_vars.y[0]));
914 num_ad = ba->max_steps - na->asap + 1;
916 if (ba->n_interesting_nodes > env->opts->limit_dead) {
917 na->ilp_vars.a = NEW_ARR_D(int, var_obst, n_unit_types * num_ad);
918 memset(na->ilp_vars.a, -1, ARR_LEN(na->ilp_vars.a) * sizeof(na->ilp_vars.a[0]));
921 na->ilp_vars.d = NEW_ARR_D(int, var_obst, n_unit_types * num_ad);
922 memset(na->ilp_vars.d, -1, ARR_LEN(na->ilp_vars.d) * sizeof(na->ilp_vars.d[0]));
926 DBG((env->dbg, LEVEL_3, "\thandling %+F (asap %u, alap %u, unit types %u):\n",
927 irn, na->asap, na->alap, na->n_unit_types));
929 cur_var_x = cur_var_ad = cur_var_y = cur_unit = n_var = 0;
930 /* create variables */
931 for (tp_idx = 0; tp_idx < n_unit_types; ++tp_idx) {
934 for (t = na->asap - 1; t <= na->alap - 1; ++t) {
935 /* x_{nt}^k variables */
936 snprintf(buf, sizeof(buf), "x_n%u_%s_%u",
937 get_irn_idx(irn), na->type_info[tp_idx].tp->name, t);
938 na->ilp_vars.x[cur_var_x++] = lpp_add_var(lpp, buf, lpp_binary, (double)(t + 1));
939 DBG((env->dbg, LEVEL_4, "\t\tcreated ILP variable %s\n", buf));
940 /* variable counter */
944 if (! na->is_dummy_node) {
945 /* y_{nt}^k variables */
946 snprintf(buf, sizeof(buf), "y_n%u_%s_%u",
947 get_irn_idx(irn), na->type_info[tp_idx].tp->name, t);
948 na->ilp_vars.y[cur_var_y++] = lpp_add_var(lpp, buf, lpp_binary, (double)(weigth_y));
949 DBG((env->dbg, LEVEL_4, "\t\tcreated ILP variable %s\n", buf));
951 /* variable counter */
957 /* a node can die at any step t: asap(n) <= t <= U */
958 if (! na->is_dummy_node) {
959 for (t = na->asap - 1; t <= ba->max_steps; ++t) {
961 if (ba->n_interesting_nodes > env->opts->limit_dead) {
962 /* a_{nt}^k variables */
963 snprintf(buf, sizeof(buf), "a_n%u_%s_%u",
964 get_irn_idx(irn), na->type_info[tp_idx].tp->name, t);
965 na->ilp_vars.a[cur_var_ad++] = lpp_add_var(lpp, buf, lpp_binary, (double)(ba->n_interesting_nodes));
968 /* d_{nt}^k variables */
969 snprintf(buf, sizeof(buf), "d_n%u_%s_%u",
970 get_irn_idx(irn), na->type_info[tp_idx].tp->name, t);
971 na->ilp_vars.d[cur_var_ad++] = lpp_add_var(lpp, buf, lpp_binary, (double)(t + 1));
973 DBG((env->dbg, LEVEL_4, "\t\tcreated ILP variable %s\n", buf));
975 /* variable counter */
982 DB((env->dbg, LEVEL_3, "%u variables created\n", n_var));
986 DBG((env->dbg, LEVEL_1, "... %u variables for %u nodes created (%g sec)\n",
987 num_block_var, num_nodes, ilp_timer_elapsed_usec(t_var) / 1000000.0));
990 /*******************************************************
993 * ___ ___ _ __ ___| |_ _ __ __ _ _ _ __ | |_ ___
994 * / __/ _ \| '_ \/ __| __| '__/ _` | | '_ \| __/ __|
995 * | (_| (_) | | | \__ \ |_| | | (_| | | | | | |_\__ \
996 * \___\___/|_| |_|___/\__|_| \__,_|_|_| |_|\__|___/
998 *******************************************************/
1001 * Create following ILP constraints:
1002 * - the assignment constraints:
1003 * assure each node is executed once by exactly one (allowed) execution unit
1004 * - the dead node assignment constraints:
1005 * assure a node can only die at most once
1006 * - the precedence constraints:
1007 * assure that no data dependencies are violated
1009 static void create_assignment_and_precedence_constraints(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn_t *block_node) {
1010 unsigned num_cst_assign, num_cst_prec, num_cst_dead;
1013 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
1014 bitset_t *bs_block_irns = bitset_alloca(ba->block_last_idx);
1016 lc_timer_t *t_cst_assign = lc_timer_register("beilpsched_cst_assign", "create assignment constraints");
1017 lc_timer_t *t_cst_dead = lc_timer_register("beilpsched_cst_assign_dead", "create dead node assignment constraints");
1018 lc_timer_t *t_cst_prec = lc_timer_register("beilpsched_cst_prec", "create precedence constraints");
1019 #endif /* WITH_LIBCORE */
1021 num_cst_assign = num_cst_prec = num_cst_dead = 0;
1022 foreach_linked_irns(ba->head_ilp_nodes, irn) {
1025 be_ilpsched_irn_t *node;
1026 ilpsched_node_attr_t *na;
1028 node = get_ilpsched_irn(env, irn);
1029 na = get_ilpsched_node_attr(node);
1032 /* the assignment constraint */
1033 ilp_timer_push(t_cst_assign);
1034 snprintf(buf, sizeof(buf), "assignment_cst_n%u", get_irn_idx(irn));
1035 cst = lpp_add_cst_uniq(lpp, buf, lpp_equal, 1.0);
1036 DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1039 lpp_set_factor_fast_bulk(lpp, cst, na->ilp_vars.x, ARR_LEN(na->ilp_vars.x), 1.0);
1042 /* the dead node assignment constraint */
1043 if (! na->is_dummy_node && ba->n_interesting_nodes <= env->opts->limit_dead) {
1044 ilp_timer_push(t_cst_dead);
1045 snprintf(buf, sizeof(buf), "dead_node_assign_cst_n%u", get_irn_idx(irn));
1046 cst = lpp_add_cst_uniq(lpp, buf, lpp_less, 1.0);
1047 DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1049 lpp_set_factor_fast_bulk(lpp, cst, na->ilp_vars.d, ARR_LEN(na->ilp_vars.d), 1.0);
1053 /* We have separate constraints for Projs and Keeps */
1054 // ILP becomes infeasible ?!?
1055 // if (is_Proj(irn) || be_is_Keep(irn))
1058 /* the precedence constraints */
1059 ilp_timer_push(t_cst_prec);
1060 bs_block_irns = bitset_clear_all(bs_block_irns);
1061 for (i = get_irn_ins_or_deps(irn) - 1; i >= 0; --i) {
1062 ir_node *pred = skip_normal_Proj(env->arch_env->isa, get_irn_in_or_dep(irn, i));
1063 unsigned t_low, t_high, t;
1064 be_ilpsched_irn_t *pred_node;
1065 ilpsched_node_attr_t *pna;
1068 if (is_Phi(pred) || block_node->irn != get_nodes_block(pred) || is_NoMem(pred))
1071 pred_node = get_ilpsched_irn(env, pred);
1072 pna = get_ilpsched_node_attr(pred_node);
1074 assert(pna->asap > 0 && pna->alap >= pna->asap && "Invalid scheduling interval.");
1076 if (! bitset_is_set(bs_block_irns, pna->block_idx))
1077 bitset_set(bs_block_irns, pna->block_idx);
1081 /* irn = n, pred = m */
1082 delay = fixed_latency(env->sel, pred, env->block_env);
1083 t_low = MAX(na->asap, pna->asap + delay - 1);
1084 t_high = MIN(na->alap, pna->alap + delay - 1);
1085 for (t = t_low - 1; t <= t_high - 1; ++t) {
1087 int *tmp_var_idx = NEW_ARR_F(int, 0);
1089 snprintf(buf, sizeof(buf), "precedence_n%u_n%u_%u", get_irn_idx(pred), get_irn_idx(irn), t);
1090 cst = lpp_add_cst_uniq(lpp, buf, lpp_less, 1.0);
1091 DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1094 /* lpp_set_factor_fast_bulk needs variables sorted ascending by index */
1095 if (na->ilp_vars.x[0] < pna->ilp_vars.x[0]) {
1096 /* node variables have smaller index than pred variables */
1097 for (tp_idx = na->n_unit_types - 1; tp_idx >= 0; --tp_idx) {
1098 for (tn = na->asap - 1; tn <= t; ++tn) {
1099 unsigned idx = ILPVAR_IDX(na, tp_idx, tn);
1100 ARR_APP1(int, tmp_var_idx, na->ilp_vars.x[idx]);
1104 for (tp_idx = pna->n_unit_types - 1; tp_idx >= 0; --tp_idx) {
1105 for (tm = t - delay + 1; tm < pna->alap; ++tm) {
1106 unsigned idx = ILPVAR_IDX(pna, tp_idx, tm);
1107 ARR_APP1(int, tmp_var_idx, pna->ilp_vars.x[idx]);
1112 /* pred variables have smaller index than node variables */
1113 for (tp_idx = pna->n_unit_types - 1; tp_idx >= 0; --tp_idx) {
1114 for (tm = t - delay + 1; tm < pna->alap; ++tm) {
1115 unsigned idx = ILPVAR_IDX(pna, tp_idx, tm);
1116 ARR_APP1(int, tmp_var_idx, pna->ilp_vars.x[idx]);
1120 for (tp_idx = na->n_unit_types - 1; tp_idx >= 0; --tp_idx) {
1121 for (tn = na->asap - 1; tn <= t; ++tn) {
1122 unsigned idx = ILPVAR_IDX(na, tp_idx, tn);
1123 ARR_APP1(int, tmp_var_idx, na->ilp_vars.x[idx]);
1128 if (ARR_LEN(tmp_var_idx) > 0)
1129 lpp_set_factor_fast_bulk(lpp, cst, tmp_var_idx, ARR_LEN(tmp_var_idx), 1.0);
1131 DEL_ARR_F(tmp_var_idx);
1136 DBG((env->dbg, LEVEL_1, "\t%u assignement constraints (%g sec)\n",
1137 num_cst_assign, ilp_timer_elapsed_usec(t_cst_assign) / 1000000.0));
1138 DBG((env->dbg, LEVEL_1, "\t%u precedence constraints (%g sec)\n",
1139 num_cst_prec, ilp_timer_elapsed_usec(t_cst_prec) / 1000000.0));
1143 * Create ILP resource constraints:
1144 * - assure that for each time step not more instructions are scheduled
1145 * to the same unit types as units of this type are available
1147 static void create_ressource_constraints(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn_t *block_node) {
1150 unsigned num_cst_resrc = 0;
1151 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
1153 lc_timer_t *t_cst_rsrc = lc_timer_register("beilpsched_cst_rsrc", "create resource constraints");
1154 #endif /* WITH_LIBCORE */
1156 ilp_timer_push(t_cst_rsrc);
1157 for (glob_type_idx = env->cpu->n_unit_types - 1; glob_type_idx >= 0; --glob_type_idx) {
1159 be_execution_unit_type_t *cur_tp = &env->cpu->unit_types[glob_type_idx];
1161 /* BEWARE: the DUMMY unit type is not in CPU, so it's skipped automatically */
1163 /* check each time step */
1164 for (t = 0; t < ba->max_steps; ++t) {
1167 int *tmp_var_idx = NEW_ARR_F(int, 0);
1169 snprintf(buf, sizeof(buf), "resource_cst_%s_%u", cur_tp->name, t);
1170 cst = lpp_add_cst_uniq(lpp, buf, lpp_less, (double)cur_tp->n_units);
1171 DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1174 foreach_linked_irns(ba->head_ilp_nodes, irn) {
1175 be_ilpsched_irn_t *node = get_ilpsched_irn(env, irn);
1176 ilpsched_node_attr_t *na = get_ilpsched_node_attr(node);
1179 tp_idx = is_valid_unit_type_for_node(cur_tp, node);
1181 if (tp_idx >= 0 && t >= na->asap - 1 && t <= na->alap - 1) {
1182 int cur_var = ILPVAR_IDX(na, tp_idx, t);
1183 ARR_APP1(int, tmp_var_idx, na->ilp_vars.x[cur_var]);
1187 /* set constraints if we have some */
1188 if (ARR_LEN(tmp_var_idx) > 0)
1189 lpp_set_factor_fast_bulk(lpp, cst, tmp_var_idx, ARR_LEN(tmp_var_idx), 1.0);
1191 DEL_ARR_F(tmp_var_idx);
1195 DBG((env->dbg, LEVEL_1, "\t%u resource constraints (%g sec)\n",
1196 num_cst_resrc, ilp_timer_elapsed_usec(t_cst_rsrc) / 1000000.0));
1200 * Create ILP bundle constraints:
1201 * - assure, at most bundle_size * bundles_per_cycle instructions
1202 * can be started at a certain point.
1204 static void create_bundle_constraints(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn_t *block_node) {
1207 unsigned num_cst_bundle = 0;
1208 unsigned n_instr_max = env->cpu->bundle_size * env->cpu->bundels_per_cycle;
1209 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
1211 lc_timer_t *t_cst_bundle = lc_timer_register("beilpsched_cst_bundle", "create bundle constraints");
1212 #endif /* WITH_LIBCORE */
1214 ilp_timer_push(t_cst_bundle);
1215 for (t = 0; t < ba->max_steps; ++t) {
1218 int *tmp_var_idx = NEW_ARR_F(int, 0);
1220 snprintf(buf, sizeof(buf), "bundle_cst_%u", t);
1221 cst = lpp_add_cst_uniq(lpp, buf, lpp_less, (double)n_instr_max);
1222 DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1225 foreach_linked_irns(ba->head_ilp_nodes, irn) {
1226 be_ilpsched_irn_t *node;
1227 ilpsched_node_attr_t *na;
1230 /* Projs and Keeps do not contribute to bundle size */
1231 if (is_Proj(irn) || be_is_Keep(irn))
1234 node = get_ilpsched_irn(env, irn);
1235 na = get_ilpsched_node_attr(node);
1237 /* nodes assigned to DUMMY unit do not contribute to bundle size */
1238 if (na->is_dummy_node)
1241 if (t >= na->asap - 1 && t <= na->alap - 1) {
1242 for (tp_idx = na->n_unit_types - 1; tp_idx >= 0; --tp_idx) {
1243 int idx = ILPVAR_IDX(na, tp_idx, t);
1244 ARR_APP1(int, tmp_var_idx, na->ilp_vars.x[idx]);
1249 if (ARR_LEN(tmp_var_idx) > 0)
1250 lpp_set_factor_fast_bulk(lpp, cst, tmp_var_idx, ARR_LEN(tmp_var_idx), 1.0);
1252 DEL_ARR_F(tmp_var_idx);
1255 DBG((env->dbg, LEVEL_1, "\t%u bundle constraints (%g sec)\n",
1256 num_cst_bundle, ilp_timer_elapsed_usec(t_cst_bundle) / 1000000.0));
1260 * Create ILP dying nodes constraints:
1261 * - set variable d_{nt}^k to 1 if nodes n dies at step t on unit k
1263 static void create_dying_nodes_constraint(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn_t *block_node) {
1266 unsigned num_cst = 0;
1267 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
1269 lc_timer_t *t_cst = lc_timer_register("beilpsched_cst_dying_nodes", "create dying nodes constraints");
1270 #endif /* WITH_LIBCORE */
1272 ilp_timer_push(t_cst);
1273 /* check all time_steps */
1274 for (t = 0; t < ba->max_steps; ++t) {
1278 foreach_linked_irns(ba->head_ilp_nodes, irn) {
1279 be_ilpsched_irn_t *node = get_ilpsched_irn(env, irn);
1280 ilpsched_node_attr_t *na = get_ilpsched_node_attr(node);
1282 /* if node has no consumer within current block, it cannot die here */
1283 /* we also ignore nodes assigned to dummy unit */
1284 if (ARR_LEN(na->block_consumer) < 1 || na->is_dummy_node)
1287 /* node can only die here if t at least asap(n) */
1288 if (t >= na->asap - 1) {
1291 /* for all unit types */
1292 for (node_tp_idx = na->n_unit_types - 1; node_tp_idx >= 0; --node_tp_idx) {
1294 int *tmp_var_idx = NEW_ARR_F(int, 0);
1296 snprintf(buf, sizeof(buf), "dying_node_cst_%u_n%u", t, get_irn_idx(irn));
1297 cst = lpp_add_cst_uniq(lpp, buf, lpp_less, (double)(na->n_consumer - 1));
1298 DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1301 /* number of consumer scheduled till t */
1302 for (i = ARR_LEN(na->block_consumer) - 1; i >= 0; --i) {
1303 be_ilpsched_irn_t *cons = get_ilpsched_irn(env, na->block_consumer[i]);
1304 ilpsched_node_attr_t *ca = get_ilpsched_node_attr(cons);
1306 for (tp_idx = ca->n_unit_types - 1; tp_idx >= 0; --tp_idx) {
1309 for (tm = ca->asap - 1; tm <= t && tm <= ca->alap - 1; ++tm) {
1310 int idx = ILPVAR_IDX(ca, tp_idx, tm);
1311 ARR_APP1(int, tmp_var_idx, ca->ilp_vars.x[idx]);
1316 /* could be that no consumer can be scheduled at this point */
1317 if (ARR_LEN(tmp_var_idx)) {
1321 /* subtract possible prior kill points */
1322 for (tn = na->asap - 1; tn < t; ++tn) {
1323 idx = ILPVAR_IDX_DEAD(ba, na, node_tp_idx, tn);
1324 lpp_set_factor_fast(lpp, cst, na->ilp_vars.d[idx], -1.0);
1327 idx = ILPVAR_IDX_DEAD(ba, na, node_tp_idx, t);
1328 lpp_set_factor_fast(lpp, cst, na->ilp_vars.d[idx], 0.0 - (double)(na->n_consumer));
1329 lpp_set_factor_fast_bulk(lpp, cst, tmp_var_idx, ARR_LEN(tmp_var_idx), 1.0);
1332 DEL_ARR_F(tmp_var_idx);
1339 DBG((env->dbg, LEVEL_1, "\t%u dying nodes constraints (%g sec)\n",
1340 num_cst, ilp_timer_elapsed_usec(t_cst) / 1000000.0));
1344 * Create ILP alive nodes constraints:
1345 * - set variable a_{nt}^k to 1 if nodes n is alive at step t on unit k
1347 static void create_alive_nodes_constraint(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn_t *block_node) {
1350 unsigned num_cst = 0;
1351 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
1353 lc_timer_t *t_cst = lc_timer_register("beilpsched_cst_alive_nodes", "create alive nodes constraints");
1354 #endif /* WITH_LIBCORE */
1356 ilp_timer_push(t_cst);
1358 foreach_linked_irns(ba->head_ilp_nodes, irn) {
1359 be_ilpsched_irn_t *node = get_ilpsched_irn(env, irn);
1360 ilpsched_node_attr_t *na = get_ilpsched_node_attr(node);
1363 /* we ignore nodes assigned to dummy unit here */
1364 if (na->is_dummy_node)
1367 /* check check all time steps: asap(n) <= t <= U */
1368 for (t = na->asap - 1; t < ba->max_steps; ++t) {
1371 /* for all unit types available for this node */
1372 for (node_tp_idx = na->n_unit_types - 1; node_tp_idx >= 0; --node_tp_idx) {
1373 unsigned tn, tn_max, idx;
1375 int *tmp_var_idx_n = NEW_ARR_F(int, 0);
1376 int *tmp_var_idx_m = NEW_ARR_F(int, 0);
1378 snprintf(buf, sizeof(buf), "alive_node_cst_%u_n%u_%s",
1379 t, get_irn_idx(irn), na->type_info[node_tp_idx].tp->name);
1380 cst = lpp_add_cst_uniq(lpp, buf, lpp_less, 0.0);
1381 DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1384 tn_max = MIN(na->alap - 1, t);
1385 /* check if the node has been scheduled so far */
1386 for (tn = na->asap - 1; tn <= tn_max; ++tn) {
1387 int idx = ILPVAR_IDX(na, node_tp_idx, tn);
1388 ARR_APP1(int, tmp_var_idx_n, na->ilp_vars.x[idx]);
1391 if (ARR_LEN(tmp_var_idx_n) > 0)
1392 lpp_set_factor_fast_bulk(lpp, cst, tmp_var_idx_n, ARR_LEN(tmp_var_idx_n), (double)(na->n_consumer));
1393 DEL_ARR_F(tmp_var_idx_n);
1395 /* subtract the number of consumer scheduled so far */
1396 for (i = ARR_LEN(na->block_consumer) - 1; i >= 0; --i) {
1397 be_ilpsched_irn_t *cons = get_ilpsched_irn(env, na->block_consumer[i]);
1398 ilpsched_node_attr_t *ca = get_ilpsched_node_attr(cons);
1400 unsigned tm, tm_max;
1402 tm_max = MIN(ca->alap - 1, t);
1403 for (tp_idx = ca->n_unit_types - 1; tp_idx >= 0; --tp_idx) {
1404 for (tm = ca->asap - 1; tm <= tm_max; ++tm) {
1405 int idx = ILPVAR_IDX(ca, tp_idx, tm);
1406 ARR_APP1(int, tmp_var_idx_m, ca->ilp_vars.x[idx]);
1411 if (ARR_LEN(tmp_var_idx_m) > 0)
1412 lpp_set_factor_fast_bulk(lpp, cst, tmp_var_idx_m, ARR_LEN(tmp_var_idx_m), -1.0);
1413 DEL_ARR_F(tmp_var_idx_m);
1416 idx = ILPVAR_IDX_DEAD(ba, na, node_tp_idx, t);
1417 lpp_set_factor_fast(lpp, cst, na->ilp_vars.a[idx], 0.0 - (double)(na->n_consumer));
1423 DBG((env->dbg, LEVEL_1, "\t%u alive nodes constraints (%g sec)\n",
1424 num_cst, ilp_timer_elapsed_usec(t_cst) / 1000000.0));
1428 * Create ILP pressure constraints, based on dead nodes:
1429 * - add additional costs to objective function if a node is scheduled
1430 * on a unit although all units of this type are currently occupied
1432 static void create_pressure_dead_constraint(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn_t *block_node) {
1435 unsigned num_cst = 0;
1436 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
1438 lc_timer_t *t_cst = lc_timer_register("beilpsched_cst_pressure", "create pressure constraints");
1439 #endif /* WITH_LIBCORE */
1441 ilp_timer_push(t_cst);
1442 /* y_{nt}^k is set for each node and timestep and unit type */
1443 foreach_linked_irns(ba->head_ilp_nodes, cur_irn) {
1444 unsigned cur_idx = get_irn_idx(cur_irn);
1445 be_ilpsched_irn_t *cur_node = get_ilpsched_irn(env, cur_irn);
1446 ilpsched_node_attr_t *cur_na = get_ilpsched_node_attr(cur_node);
1449 /* we ignore nodes assigned to DUMMY unit here */
1450 if (cur_na->is_dummy_node)
1454 for (glob_type_idx = env->cpu->n_unit_types - 1; glob_type_idx >= 0; --glob_type_idx) {
1455 be_execution_unit_type_t *cur_tp = &env->cpu->unit_types[glob_type_idx];
1459 /* BEWARE: the DUMMY unit types is not in CPU, so it's skipped automatically */
1461 /* check if node can be executed on this unit type */
1462 cur_tp_idx = is_valid_unit_type_for_node(cur_tp, cur_node);
1466 /* check all time_steps */
1467 for (t = cur_na->asap - 1; t <= cur_na->alap - 1; ++t) {
1470 int *tmp_idx_1 = NEW_ARR_F(int, 0);
1471 int *tmp_idx_m1 = NEW_ARR_F(int, 0);
1473 snprintf(buf, sizeof(buf), "pressure_cst_n%u_%u_%s", cur_idx, t, cur_tp->name);
1474 cst = lpp_add_cst_uniq(lpp, buf, lpp_less, (double)(cur_tp->n_units - 1));
1475 DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1479 - accumulate all nodes scheduled on unit type k till t
1480 - subtract all nodes died on unit type k till t
1482 foreach_linked_irns(ba->head_ilp_nodes, irn) {
1483 be_ilpsched_irn_t *node = get_ilpsched_irn(env, irn);
1484 ilpsched_node_attr_t *na = get_ilpsched_node_attr(node);
1488 tmax = MIN(t, na->alap - 1);
1489 tp_idx = is_valid_unit_type_for_node(cur_tp, node);
1491 /* current unit type is not suitable for current node */
1495 for (tn = na->asap - 1; tn <= tmax; ++tn) {
1498 /* node scheduled */
1499 idx = ILPVAR_IDX(na, tp_idx, tn);
1500 ARR_APP1(int, tmp_idx_1, na->ilp_vars.x[idx]);
1503 idx = ILPVAR_IDX_DEAD(ba, na, tp_idx, tn);
1504 ARR_APP1(int, tmp_idx_m1, na->ilp_vars.d[idx]);
1508 if (ARR_LEN(tmp_idx_1) > 0)
1509 lpp_set_factor_fast_bulk(lpp, cst, tmp_idx_1, ARR_LEN(tmp_idx_1), 1.0);
1511 if (ARR_LEN(tmp_idx_m1) > 0)
1512 lpp_set_factor_fast_bulk(lpp, cst, tmp_idx_m1, ARR_LEN(tmp_idx_m1), -1.0);
1514 /* BEWARE: t is unsigned, so (double)(-t) won't work */
1515 y_idx = ILPVAR_IDX(cur_na, cur_tp_idx, t);
1516 lpp_set_factor_fast(lpp, cst, cur_na->ilp_vars.y[y_idx], 0.0 - (double)(t));
1518 DEL_ARR_F(tmp_idx_1);
1519 DEL_ARR_F(tmp_idx_m1);
1524 DBG((env->dbg, LEVEL_1, "\t%u pressure constraints (%g sec)\n",
1525 num_cst, ilp_timer_elapsed_usec(t_cst) / 1000000.0));
1529 * Create ILP pressure constraints, based on alive nodes:
1530 * - add additional costs to objective function if a node is scheduled
1531 * on a unit although all units of this type are currently occupied
1533 static void create_pressure_alive_constraint(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn_t *block_node) {
1536 unsigned num_cst = 0;
1537 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
1539 lc_timer_t *t_cst = lc_timer_register("beilpsched_cst_pressure", "create pressure constraints");
1540 #endif /* WITH_LIBCORE */
1542 ilp_timer_push(t_cst);
1543 /* y_{nt}^k is set for each node and timestep and unit type */
1544 foreach_linked_irns(ba->head_ilp_nodes, cur_irn) {
1545 unsigned cur_idx = get_irn_idx(cur_irn);
1546 be_ilpsched_irn_t *cur_node = get_ilpsched_irn(env, cur_irn);
1547 ilpsched_node_attr_t *cur_na = get_ilpsched_node_attr(cur_node);
1550 /* we ignore nodes assigned to DUMMY unit here */
1551 if (cur_na->is_dummy_node)
1555 for (glob_type_idx = env->cpu->n_unit_types - 1; glob_type_idx >= 0; --glob_type_idx) {
1556 be_execution_unit_type_t *cur_tp = &env->cpu->unit_types[glob_type_idx];
1560 /* BEWARE: the DUMMY unit types is not in CPU, so it's skipped automatically */
1562 /* check if node can be executed on this unit type */
1563 cur_tp_idx = is_valid_unit_type_for_node(cur_tp, cur_node);
1567 /* check all time_steps at which the current node can be scheduled */
1568 for (t = cur_na->asap - 1; t <= cur_na->alap - 1; ++t) {
1571 int *tmp_var_idx = NEW_ARR_F(int, 0);
1573 snprintf(buf, sizeof(buf), "pressure_cst_n%u_%u_%s", cur_idx, t, cur_tp->name);
1574 cst = lpp_add_cst_uniq(lpp, buf, lpp_less, (double)(cur_tp->n_units - 1));
1575 DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1578 /* - accumulate all nodes alive at point t on unit type k */
1579 foreach_linked_irns(ba->head_ilp_nodes, irn) {
1580 be_ilpsched_irn_t *node = get_ilpsched_irn(env, irn);
1581 ilpsched_node_attr_t *na = get_ilpsched_node_attr(node);
1584 /* check if node can be alive here */
1585 if (t < na->asap - 1)
1588 tp_idx = is_valid_unit_type_for_node(cur_tp, node);
1590 /* current type is not suitable */
1594 a_idx = ILPVAR_IDX_DEAD(ba, na, tp_idx, t);
1595 ARR_APP1(int, tmp_var_idx, na->ilp_vars.a[a_idx]);
1598 if (ARR_LEN(tmp_var_idx) > 0)
1599 lpp_set_factor_fast_bulk(lpp, cst, tmp_var_idx, ARR_LEN(tmp_var_idx), 1.0);
1600 DEL_ARR_F(tmp_var_idx);
1602 /* - num_nodes * y_{nt}^k */
1603 y_idx = ILPVAR_IDX(cur_na, cur_tp_idx, t);
1604 lpp_set_factor_fast(lpp, cst, cur_na->ilp_vars.y[y_idx], 0.0 - (double)(ba->n_interesting_nodes));
1609 DBG((env->dbg, LEVEL_1, "\t%u pressure constraints (%g sec)\n",
1610 num_cst, ilp_timer_elapsed_usec(t_cst) / 1000000.0));
1614 static void create_proj_keep_constraints(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn_t *block_node) {
1617 unsigned num_cst = 0;
1618 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
1620 lc_timer_t *t_cst = lc_timer_register("beilpsched_cst_projkeep", "create proj and keep constraints");
1621 #endif /* WITH_LIBCORE */
1623 ilp_timer_push(t_cst);
1624 /* check all nodes */
1625 foreach_linked_irns(ba->head_ilp_nodes, irn) {
1626 be_ilpsched_irn_t *node;
1627 ilpsched_node_attr_t *na;
1631 /* only mode_T nodes can have Projs and Keeps assigned */
1632 if (get_irn_mode(irn) != mode_T)
1635 node = get_ilpsched_irn(env, irn);
1636 na = get_ilpsched_node_attr(node);
1638 /* check if has some Projs and Keeps assigned */
1639 if (! na->projkeeps)
1642 /* we can run only once over the queue, so preserve the nodes */
1643 pk = NEW_ARR_F(ir_node *, 0);
1644 while (! waitq_empty(na->projkeeps))
1645 ARR_APP1(ir_node *, pk, waitq_get(na->projkeeps));
1646 del_waitq(na->projkeeps);
1647 na->projkeeps = NULL;
1649 /* for all time steps at which this node can be scheduled */
1650 for (t = na->asap - 1; t <= na->alap - 1; ++t) {
1652 int *tmp_var_idx_n = NEW_ARR_F(int, 0);
1654 /* add the constraint, assure, that a node is always scheduled along with it's Projs and Keeps */
1655 snprintf(buf, sizeof(buf), "projkeep_cst_n%u_%u", get_irn_idx(irn), t);
1656 cst = lpp_add_cst_uniq(lpp, buf, lpp_equal, 0.0);
1657 DBG((env->dbg, LEVEL_2, "added constraint %s\n", buf));
1660 /* sum up scheduling variables for this time step */
1661 for (tp_idx = na->n_unit_types - 1; tp_idx >= 0; --tp_idx) {
1662 int idx = ILPVAR_IDX(na, tp_idx, t);
1663 ARR_APP1(int, tmp_var_idx_n, na->ilp_vars.x[idx]);
1666 if (ARR_LEN(tmp_var_idx_n) > 0)
1667 lpp_set_factor_fast_bulk(lpp, cst, tmp_var_idx_n, ARR_LEN(tmp_var_idx_n), (double)(ARR_LEN(pk)));
1668 DEL_ARR_F(tmp_var_idx_n);
1670 /* subtract all Proj and Keep variables for this step */
1671 for (i = ARR_LEN(pk) - 1; i >= 0; --i) {
1672 be_ilpsched_irn_t *pk_node = get_ilpsched_irn(env, pk[i]);
1673 ilpsched_node_attr_t *pk_na = get_ilpsched_node_attr(pk_node);
1676 for (pk_tp_idx = pk_na->n_unit_types - 1; pk_tp_idx >= 0; --pk_tp_idx) {
1677 int idx = ILPVAR_IDX(pk_na, pk_tp_idx, t);
1678 lpp_set_factor_fast(lpp, cst, pk_na->ilp_vars.x[idx], -1.0);
1684 DBG((env->dbg, LEVEL_1, "\t%u Proj and Keep constraints (%g sec)\n",
1685 num_cst, ilp_timer_elapsed_usec(t_cst) / 1000000.0));
1689 /***************************************************
1691 * |_ _| | | __ \ (_)
1692 * | | | | | |__) | _ __ ___ __ _ _ _ __
1693 * | | | | | ___/ | '_ ` _ \ / _` | | '_ \
1694 * _| |_| |____| | | | | | | | (_| | | | | |
1695 * |_____|______|_| |_| |_| |_|\__,_|_|_| |_|
1697 ***************************************************/
1700 * Create the ilp (add variables, build constraints, solve, build schedule from solution).
1702 static void create_ilp(ir_node *block, void *walk_env) {
1703 be_ilpsched_env_t *env = walk_env;
1704 be_ilpsched_irn_t *block_node = get_ilpsched_irn(env, block);
1705 ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
1706 FILE *logfile = NULL;
1708 struct obstack var_obst;
1711 DBG((env->dbg, 255, "\n\n\n=========================================\n"));
1712 DBG((env->dbg, 255, " ILP Scheduling for %+F\n", block));
1713 DBG((env->dbg, 255, "=========================================\n\n"));
1715 DBG((env->dbg, LEVEL_1, "Creating ILP Variables for nodes in %+F (%u interesting nodes, %u max steps)\n",
1716 block, ba->n_interesting_nodes, ba->max_steps));
1718 /* notify backend and get block environment */
1719 env->block_env = be_ilp_sched_init_block_ilp_schedule(env->sel, block);
1721 /* if we have less than two interesting nodes, there is no need to create the ILP */
1722 if (ba->n_interesting_nodes > 1) {
1723 double fact_var = ba->n_interesting_nodes > 25 ? 1.1 : 1.2;
1724 double fact_cst = ba->n_interesting_nodes > 25 ? 0.7 : 1.5;
1725 int base_num = ba->n_interesting_nodes * ba->n_interesting_nodes;
1726 int estimated_n_var = (int)((double)base_num * fact_var);
1727 int estimated_n_cst = (int)((double)base_num * fact_cst);
1729 DBG((env->dbg, LEVEL_1, "Creating LPP with estimed numbers: %d vars, %d cst\n",
1730 estimated_n_var, estimated_n_cst));
1732 /* set up the LPP object */
1733 snprintf(name, sizeof(name), "ilp scheduling IRG %s", get_entity_ld_name(get_irg_entity(env->irg)));
1735 lpp = new_lpp_userdef(
1738 estimated_n_cst + 1, /* num vars */
1739 estimated_n_cst + 20, /* num cst */
1740 1.2); /* grow factor */
1741 obstack_init(&var_obst);
1743 /* create ILP variables */
1744 create_variables(env, lpp, block_node, &var_obst);
1746 /* create ILP constraints */
1747 DBG((env->dbg, LEVEL_1, "Creating constraints for nodes in %+F:\n", block));
1748 create_assignment_and_precedence_constraints(env, lpp, block_node);
1749 create_ressource_constraints(env, lpp, block_node);
1750 create_bundle_constraints(env, lpp, block_node);
1751 //create_proj_keep_constraints(env, lpp, block_node);
1752 if (ba->n_interesting_nodes > env->opts->limit_dead) {
1753 create_alive_nodes_constraint(env, lpp, block_node);
1754 create_pressure_alive_constraint(env, lpp, block_node);
1756 create_dying_nodes_constraint(env, lpp, block_node);
1757 create_pressure_dead_constraint(env, lpp, block_node);
1760 DBG((env->dbg, LEVEL_1, "ILP to solve: %u variables, %u constraints\n", lpp->var_next, lpp->cst_next));
1762 /* debug stuff, dump lpp when debugging is on */
1764 if (firm_dbg_get_mask(env->dbg) > 0) {
1768 snprintf(buf, sizeof(buf), "lpp_block_%lu.txt", get_irn_node_nr(block));
1769 f = fopen(buf, "w");
1770 lpp_dump_plain(lpp, f);
1772 snprintf(buf, sizeof(buf), "lpp_block_%lu.mps", get_irn_node_nr(block));
1777 /* set solve time limit */
1778 lpp_set_time_limit(lpp, env->opts->time_limit);
1780 /* set logfile if requested */
1781 if (strlen(env->opts->log_file) > 0) {
1782 if (strcasecmp(env->opts->log_file, "stdout") == 0)
1783 lpp_set_log(lpp, stdout);
1784 else if (strcasecmp(env->opts->log_file, "stderr") == 0)
1785 lpp_set_log(lpp, stderr);
1787 logfile = fopen(env->opts->log_file, "w");
1789 fprintf(stderr, "Could not open logfile '%s'! Logging disabled.\n", env->opts->log_file);
1791 lpp_set_log(lpp, logfile);
1796 lpp_solve_net(lpp, env->main_env->options->ilp_server, env->main_env->options->ilp_solver);
1801 /* check for valid solution */
1802 if (! lpp_is_sol_valid(lpp)) {
1806 snprintf(buf, sizeof(buf), "lpp_block_%lu.assert.txt", get_irn_node_nr(block));
1807 f = fopen(buf, "w");
1808 lpp_dump_plain(lpp, f);
1810 snprintf(buf, sizeof(buf), "lpp_block_%lu.assert.mps", get_irn_node_nr(block));
1812 dump_ir_block_graph(env->irg, "-assert");
1814 assert(0 && "ILP solution is not feasible!");
1817 DBG((env->dbg, LEVEL_1, "\nSolution:\n"));
1818 DBG((env->dbg, LEVEL_1, "\tsend time: %g sec\n", lpp->send_time / 1000000.0));
1819 DBG((env->dbg, LEVEL_1, "\treceive time: %g sec\n", lpp->recv_time / 1000000.0));
1820 DBG((env->dbg, LEVEL_1, "\titerations: %d\n", lpp->iterations));
1821 DBG((env->dbg, LEVEL_1, "\tsolution time: %g\n", lpp->sol_time));
1822 DBG((env->dbg, LEVEL_1, "\tobjective function: %g\n", LPP_VALUE_IS_0(lpp->objval) ? 0.0 : lpp->objval));
1823 DBG((env->dbg, LEVEL_1, "\tbest bound: %g\n", LPP_VALUE_IS_0(lpp->best_bound) ? 0.0 : lpp->best_bound));
1825 DBG((env->dbg, LEVEL_1, "variables used %u bytes\n", obstack_memory_used(&var_obst)));
1828 /* apply solution */
1829 apply_solution(env, lpp, block);
1834 /* notify backend */
1835 be_ilp_sched_finish_block_ilp_schedule(env->sel, block, env->block_env);
1839 * Perform ILP scheduling on the given irg.
1841 void be_ilp_sched(const be_irg_t *birg) {
1842 be_ilpsched_env_t env;
1843 const char *name = "be ilp scheduling";
1844 arch_isa_t *isa = birg->main_env->arch_env->isa;
1845 const ilp_sched_selector_t *sel = isa->impl->get_ilp_sched_selector(isa);
1847 FIRM_DBG_REGISTER(env.dbg, "firm.be.sched.ilp");
1849 //firm_dbg_set_mask(env.dbg, 31);
1851 env.irg_env = be_ilp_sched_init_irg_ilp_schedule(sel, birg->irg);
1853 env.irg = birg->irg;
1854 env.height = heights_new(birg->irg);
1855 env.main_env = birg->main_env;
1856 env.arch_env = birg->main_env->arch_env;
1857 env.cpu = arch_isa_get_machine(birg->main_env->arch_env->isa);
1858 env.opts = &ilp_opts;
1859 phase_init(&env.ph, name, env.irg, PHASE_DEFAULT_GROWTH, init_ilpsched_irn);
1861 /* assign a unique per block number to all interesting nodes */
1862 irg_walk_in_or_dep_graph(env.irg, NULL, build_block_idx, &env);
1865 The block indices are completely build after the walk,
1866 now we can allocate the bitsets (size depends on block indices)
1869 phase_reinit_irn_data(&env.ph);
1871 /* Collect all root nodes (having no user in their block) and calculate ASAP. */
1872 irg_walk_in_or_dep_blkwise_graph(env.irg, collect_alap_root_nodes, calculate_irn_asap, &env);
1874 /* Calculate ALAP of all irns */
1875 irg_block_walk_graph(env.irg, NULL, calculate_block_alap, &env);
1877 /* We refine the {ASAP(n), ALAP(n)} interval and fix the time steps for Projs and Keeps */
1878 irg_walk_in_or_dep_blkwise_graph(env.irg, NULL, refine_asap_alap_times, &env);
1880 /* perform ILP scheduling */
1881 irg_block_walk_graph(env.irg, clear_unwanted_data, create_ilp, &env);
1884 if (firm_dbg_get_mask(env.dbg)) {
1886 phase_stat_t *stat_ptr = phase_stat(&env.ph, &stat);
1888 fprintf(stderr, "Phase used: %u bytes\n", stat_ptr->overall_bytes);
1892 /* free all allocated object */
1893 phase_free(&env.ph);
1894 heights_free(env.height);
1896 /* notify backend */
1897 be_ilp_sched_finish_irg_ilp_schedule(sel, birg->irg, env.irg_env);
1902 * Register ILP scheduler options.
1904 void be_init_ilpsched(void)
1906 lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
1907 lc_opt_entry_t *sched_grp = lc_opt_get_grp(be_grp, "ilpsched");
1909 lc_opt_add_table(sched_grp, ilpsched_option_table);
1911 #endif /* WITH_LIBCORE */
1913 #else /* WITH_ILP */
1915 static INLINE void some_picky_compiler_do_not_allow_empty_files(void)
1918 #endif /* WITH_ILP */