4 * Copyright: (c) Universitaet Karlsruhe
5 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
7 * Minimizing copies with an exact algorithm using mixed integer programming (MIP).
8 * Problem statement as a 'quadratic 0-1 program with linear constraints' with
9 * n binary variables. Constraints are knapsack (enforce color for each node) and
10 * cliques of ifg (interference constraints).
11 * Transformation into a 'mixed integer program' with n binary variables and
12 * additional 2n real variables. Constraints are the above the transformed
13 * objective function and 'complementary conditions' for two var classes.
14 * @author Daniel Grund
17 * MPS means NOT the old-style, fixed-column format. Some white spaces are
18 * important. In general spaces are separators, MARKER-lines are used in COLUMN
19 * section to define binaries. BETTER use last 2 fields in COLUMNS section.
20 * See MPS docu for details
22 * Unfortunately no good solver is available locally (or even for linking)
23 * We use CPLEX 9.0 which runs on a machine residing at the Rechenzentrum.
36 #include <sys/types.h>
40 #include "becopyopt.h"
41 #include "becopystat.h"
43 #undef DUMP_MATRICES /**< dumps all matrices completely. only recommended for small problems */
44 #undef DUMP_Q2ILP /**< see function pi_dump_q2ilp */
45 #define DUMP_DILP /**< see function pi_dump_dilp */
46 #define DUMP_MST /**< see function pi_dump_start_sol */
47 #define DO_SOLVE /**< solve the MPS output with CPLEX */
48 #undef DELETE_FILES /**< deletes all dumped files after use. Files on server are always deleted. */
50 /* CPLEX-account related stuff */
51 #define SSH_USER_HOST "kb61@sp-smp.rz.uni-karlsruhe.de"
52 #define SSH_PASSWD_FILE "/ben/daniel/.smppw"
53 #define EXPECT_FILENAME "runme" /* name of the expect-script */
55 #define DEBUG_LVL SET_LEVEL_1
56 static firm_dbg_module_t *dbg = NULL;
58 #define SLOTS_NUM2POS 256
59 #define SLOTS_LIVING 32
61 /* get_weight represents the _gain_ if node n and m have the same color. */
62 #define get_weight(n,m) 1
65 * A type storing names of the x variables in the form x[NUMBER]_[COLOR]
67 typedef struct _x_name_t {
72 * For each node taking part in the opt-problem its position in the
73 * x-variable-vector is stored in a set. This set maps the node-nr (given by
74 * benumb) to the position in the vector.
76 typedef struct _num2pos_t {
80 typedef struct _simpl_t {
81 struct list_head chain;
86 * A type storing the unmodified '0-1 quadratic program' of the form
92 * This problem is called the original problem
94 typedef struct _problem_instance_t {
95 const copy_opt_t *co; /** the original copy_opt problem */
96 int x_dim, A_dim, B_dim, E_dim, c_dim; /**< number of: x variables (equals Q_dim), rows in A, rows in B */
97 sp_matrix_t *Q, *A, *B, *E, *c; /**< the (sparse) matrices of this problem */
98 x_name_t *x; /**< stores the names of the x variables. all possible colors for a node are ordered and occupy consecutive entries. lives in obstack ob. */
99 set *num2pos; /**< maps node numbers to positions in x. */
101 /* problem size reduction removing simple nodes */
102 struct list_head simplicials; /**< holds all simpl_t's in right order to color*/
103 pset *removed; /**< holds all removed simplicial irns */
105 /* needed for linearization */
106 int bigM, maxQij, minQij;
108 /* overhead needed to build this */
112 } problem_instance_t;
114 #define is_removed(irn) pset_find_ptr(pi->removed, irn)
116 /* Nodes have consecutive numbers so this hash shoud be fine */
117 #define HASH_NUM(num) num
119 static int set_cmp_num2pos(const void *x, const void *y, size_t size) {
120 return ((num2pos_t *)x)->num != ((num2pos_t *)y)->num;
124 * Sets the first position of node with number num to pos.
125 * See x_name_t *x in _problem_instance_t.
127 static INLINE void pi_set_first_pos(problem_instance_t *pi, int num, int pos) {
131 set_insert(pi->num2pos, &find, sizeof(find), HASH_NUM(num));
135 * Get position by number. (First possible color)
136 * returns -1 if not found.
138 static INLINE int pi_get_first_pos(problem_instance_t *pi, int num) {
139 num2pos_t find, *found;
141 found = set_find(pi->num2pos, &find, sizeof(find), HASH_NUM(num));
143 assert(pi->x[found->pos].n == num && (found->pos == 0 || pi->x[found->pos-1].n != num) && "pi->num2pos is broken!");
150 * Get position by number and color.
151 * returns -1 if not found.
153 static INLINE int pi_get_pos(problem_instance_t *pi, int num, int col) {
154 num2pos_t find, *found;
158 found = set_find(pi->num2pos, &find, sizeof(find), HASH_NUM(num));
162 while (pos < pi->x_dim && pi->x[pos].n == num && pi->x[pos].c < col)
165 if (pi->x[pos].n == num && pi->x[pos].c == col)
172 * Collects all irns in currently processed register class
174 static void pi_collect_x_names(ir_node *block, void *env) {
175 problem_instance_t *pi = env;
176 struct list_head *head = &get_ra_block_info(block)->border_head;
178 bitset_t *pos_regs = bitset_alloca(pi->co->cls->n_regs);
180 list_for_each_entry_reverse(border_t, curr, head, list)
181 if (curr->is_def && curr->is_real && !is_removed(curr->irn)) {
183 pi->A_dim++; /* one knapsack constraint for each node */
185 xx.n = get_irn_graph_nr(curr->irn);
186 pi_set_first_pos(pi, xx.n, pi->x_dim);
188 // iterate over all possible colors in order
189 bitset_clear_all(pos_regs);
190 arch_get_allocatable_regs(pi->co->env, curr->irn, arch_pos_make_out(0), pi->co->cls, pos_regs);
191 bitset_foreach(pos_regs, xx.c) {
192 DBG((dbg, LEVEL_2, "Adding %n %d\n", curr->irn, xx.c));
193 obstack_grow(&pi->ob, &xx, sizeof(xx));
194 pi->x_dim++; /* one x variable for each node and color */
200 * Checks if all nodes in living are live_out in block block.
202 static INLINE int all_live_in(ir_node *block, pset *living) {
204 for (n = pset_first(living); n; n = pset_next(living))
205 if (!is_live_in(block, n)) {
213 * Finds cliques in the interference graph, considering only nodes
214 * for which the color pi->curr_color is possible. Finds only 'maximal-cliques',
215 * viz cliques which are not conatained in another one.
216 * This is used for the matrix B.
218 static void pi_clique_finder(ir_node *block, void *env) {
219 problem_instance_t *pi = env;
220 enum phase_t {growing, shrinking} phase = growing;
221 struct list_head *head = &get_ra_block_info(block)->border_head;
223 pset *living = pset_new_ptr(SLOTS_LIVING);
225 list_for_each_entry_reverse(border_t, b, head, list) {
226 const ir_node *irn = b->irn;
231 DBG((dbg, LEVEL_2, "Def %n\n", irn));
232 pset_insert_ptr(living, irn);
234 } else { /* is_use */
235 DBG((dbg, LEVEL_2, "Use %n\n", irn));
237 /* before shrinking the set, store the current 'maximum' clique;
238 * do NOT if clique is a single node
239 * do NOT if all values are live_in (in this case they were contained in a live-out clique elsewhere) */
240 if (phase == growing && pset_count(living) >= 2 && !all_live_in(block, living)) {
242 for (n = pset_first(living); n; n = pset_next(living)) {
243 int pos = pi_get_pos(pi, get_irn_graph_nr(n), pi->curr_color);
244 matrix_set(pi->B, pi->curr_row, pos, 1);
245 DBG((dbg, LEVEL_2, "B[%d, %d] := %d\n", pi->curr_row, pos, 1));
249 pset_remove_ptr(living, irn);
257 static INLINE int pi_is_simplicial(problem_instance_t *pi, const if_node_t *ifn) {
259 if_node_t **all, *curr;
260 all = alloca(ifn_get_degree(ifn) * sizeof(*all));
262 /* get all non-removed neighbors */
263 foreach_neighb(ifn, curr)
264 if (!is_removed(curr))
267 /* check if these form a clique */
268 for (i=0; i<size; ++i)
269 for (o=i+1; o<size; ++o)
270 if (!ifg_has_edge(pi->co->irg, all[i], all[o]))
273 /* all edges exist so this is a clique */
277 static void pi_find_simplicials(problem_instance_t *pi) {
282 if_nodes = be_ra_get_ifg_nodes(pi->co->irg);
285 for (ifn = set_first(if_nodes); ifn; ifn = set_next(if_nodes)) {
286 ir_node *irn = get_irn_for_graph_nr(pi->co->irg, ifn->nnr);
287 if (!is_removed(irn) && !is_optimizable(irn) && !is_optimizable_arg(irn) && pi_is_simplicial(pi, ifn)) {
288 simpl_t *s = xmalloc(sizeof(*s));
290 list_add(&s->chain, &pi->simplicials);
291 pset_insert_ptr(pi->removed, irn);
293 DBG((dbg, LEVEL_1, " Removed %n\n", irn));
300 * Generate the initial problem matrices and vectors.
302 static problem_instance_t *new_pi(const copy_opt_t *co) {
303 DBG((dbg, LEVEL_1, "Generating new instance...\n"));
304 problem_instance_t *pi = xcalloc(1, sizeof(*pi));
306 pi->num2pos = new_set(set_cmp_num2pos, SLOTS_NUM2POS);
308 pi->removed = pset_new_ptr_default();
309 INIT_LIST_HEAD(&pi->simplicials);
311 /* problem size reduction */
312 pi_find_simplicials(pi);
313 //TODO dump_ifg_wo_removed
316 * one entry per node and possible color */
317 obstack_init(&pi->ob);
318 dom_tree_walk_irg(co->irg, pi_collect_x_names, NULL, pi);
319 pi->x = obstack_finish(&pi->ob);
322 * weights for the 'same-color-optimization' target */
325 pi->Q = new_matrix(pi->x_dim, pi->x_dim);
326 pi->E = new_matrix(pi->x_dim, pi->x_dim);
327 pi->c = new_matrix(1, pi->x_dim);
329 list_for_each_entry(unit_t, curr, &co->units, units) {
330 const ir_node *root, *arg;
332 unsigned save_rootpos, rootpos, argpos;
335 root = curr->nodes[0];
336 rootnr = get_irn_graph_nr(root);
337 save_rootpos = pi_get_first_pos(pi, rootnr);
338 for (i = 1; i < curr->node_count; ++i) {
340 rootpos = save_rootpos;
341 arg = curr->nodes[i];
342 argnr = get_irn_graph_nr(arg);
343 argpos = pi_get_first_pos(pi, argnr);
344 weight = -get_weight(root, arg);
346 DBG((dbg, LEVEL_2, "Q[%n, %n] := %d\n", root, arg, weight));
347 /* for all colors root and arg have in common, set the weight for
348 * this pair in the objective function matrix Q */
349 while (rootpos < pi->x_dim && argpos < pi->x_dim &&
350 pi->x[rootpos].n == rootnr && pi->x[argpos].n == argnr) {
351 if (pi->x[rootpos].c < pi->x[argpos].c)
353 else if (pi->x[rootpos].c > pi->x[argpos].c)
357 matrix_set(pi->E, pi->E_dim, rootpos, +1);
358 matrix_set(pi->E, pi->E_dim, argpos, -1);
359 matrix_set(pi->E, pi->E_dim, pi->x_dim + pi->c_dim, 1);
361 matrix_set(pi->E, pi->E_dim, rootpos, -1);
362 matrix_set(pi->E, pi->E_dim, argpos, +1);
363 matrix_set(pi->E, pi->E_dim, pi->x_dim + pi->c_dim, 1);
367 matrix_set(pi->Q, rootpos, argpos, weight + matrix_get(pi->Q, rootpos, argpos));
370 if (weight < pi->minQij) {
371 DBG((dbg, LEVEL_2, "minQij = %d\n", weight));
374 if (weight > pi->maxQij) {
375 DBG((dbg, LEVEL_2, "maxQij = %d\n", weight));
382 matrix_set(pi->c, 1, pi->c_dim++, -weight);
388 * knapsack constraint for each node */
390 int row = 0, col = 0;
391 pi->A = new_matrix(pi->A_dim, pi->x_dim);
392 while (col < pi->x_dim) {
393 int curr_n = pi->x[col].n;
394 while (col < pi->x_dim && pi->x[col].n == curr_n) {
395 DBG((dbg, LEVEL_2, "A[%d, %d] := %d\n", row, col, 1));
396 matrix_set(pi->A, row, col++, 1);
400 assert(row == pi->A_dim);
404 * interference constraints using exactly those cliques not contained in others. */
406 int color, expected_clipques = pi->A_dim/4 * pi->co->cls->n_regs;
407 pi->B = new_matrix(expected_clipques, pi->x_dim);
408 for (color = 0; color < pi->co->cls->n_regs; ++color) {
409 pi->curr_color = color;
410 dom_tree_walk_irg(pi->co->irg, pi_clique_finder, NULL, pi);
412 pi->B_dim = matrix_get_rowcount(pi->B);
419 * clean the problem instance
421 static void free_pi(problem_instance_t *pi) {
422 DBG((dbg, LEVEL_1, "Free instance...\n"));
428 del_set(pi->num2pos);
429 del_pset(pi->removed);
430 obstack_free(&pi->ob, NULL);
436 * Dump the raw matrices of the problem to a file for debugging.
438 static void pi_dump_matrices(problem_instance_t *pi) {
440 FILE *out = ffopen(pi->co->name, "matrix", "wt");
442 DBG((dbg, LEVEL_1, "Dumping raw...\n"));
443 fprintf(out, "\n\nx-names =\n");
444 for (i=0; i<pi->x_dim; ++i)
445 fprintf(out, "%5d %2d\n", pi->x[i].n, pi->x[i].c);
447 fprintf(out, "\n\n-Q =\n");
448 matrix_dump(pi->Q, out, -1);
450 fprintf(out, "\n\nA =\n");
451 matrix_dump(pi->A, out, 1);
453 fprintf(out, "\n\nB =\n");
454 matrix_dump(pi->B, out, 1);
456 fprintf(out, "\n\nE =\n");
457 matrix_dump(pi->E, out, 1);
459 fprintf(out, "\n\nc =\n");
460 matrix_dump(pi->c, out, 1);
468 * Dumps an mps file representing the problem using a linearization of the
469 * quadratic programming problem.
471 static void pi_dump_q2ilp(problem_instance_t *pi) {
473 const matrix_elem_t *e;
476 DBG((dbg, LEVEL_1, "Dumping q2ilp...\n"));
478 max_abs_Qij = pi->maxQij;
479 if (-pi->minQij > max_abs_Qij)
480 max_abs_Qij = -pi->minQij;
481 pi->bigM = pi->A_dim * max_abs_Qij;
482 DBG((dbg, LEVEL_2, "BigM = %d\n", pi->bigM));
484 matrix_optimize(pi->Q);
485 good_row = bitset_alloca(pi->x_dim);
486 for (i=0; i<pi->x_dim; ++i)
487 if (matrix_row_first(pi->Q, i))
488 bitset_set(good_row, i);
490 out = ffopen(pi->co->name, "q2ilp", "wt");
491 fprintf(out, "NAME %s\n", pi->co->name);
493 fprintf(out, "ROWS\n");
494 fprintf(out, " N obj\n");
495 for (i=0; i<pi->x_dim; ++i)
496 if (bitset_is_set(good_row, i))
497 fprintf(out, " E cQ%d\n", i);
498 for (i=0; i<pi->A_dim; ++i)
499 fprintf(out, " E cA%d\n", i);
500 for (i=0; i<pi->B_dim; ++i)
501 fprintf(out, " L cB%d\n", i);
502 for (i=0; i<pi->x_dim; ++i)
503 if (bitset_is_set(good_row, i))
504 fprintf(out, " L cy%d\n", i);
506 fprintf(out, "COLUMNS\n");
507 /* the x vars come first */
508 /* mark them as binaries */
509 fprintf(out, " MARKI0\t'MARKER'\t'INTORG'\n");
510 for (i=0; i<pi->x_dim; ++i) {
511 /* participation in objective */
512 if (bitset_is_set(good_row, i))
513 fprintf(out, " x%d_%d\tobj\t%d\n", pi->x[i].n, pi->x[i].c, -pi->bigM);
515 matrix_foreach_in_col(pi->Q, i, e)
516 fprintf(out, " x%d_%d\tcQ%d\t%d\n", pi->x[i].n, pi->x[i].c, e->row, e->val);
518 matrix_foreach_in_col(pi->A, i, e)
519 fprintf(out, " x%d_%d\tcA%d\t%d\n", pi->x[i].n, pi->x[i].c, e->row, e->val);
521 matrix_foreach_in_col(pi->B, i, e)
522 fprintf(out, " x%d_%d\tcB%d\t%d\n", pi->x[i].n, pi->x[i].c, e->row, e->val);
524 if (bitset_is_set(good_row, i))
525 fprintf(out, " x%d_%d\tcy%d\t%d\n", pi->x[i].n, pi->x[i].c, i, 2*pi->bigM);
528 fprintf(out, " MARKI1\t'MARKER'\t'INTEND'\n"); /* end of marking */
530 /* next the s vars */
531 for (i=0; i<pi->x_dim; ++i)
532 if (bitset_is_set(good_row, i)) {
533 /* participation in objective */
534 fprintf(out, " s%d_%d\tobj\t%d\n", pi->x[i].n, pi->x[i].c, 1);
536 fprintf(out, " s%d_%d\tcQ%d\t%d\n", pi->x[i].n, pi->x[i].c, i, -1);
539 /* next the y vars */
540 for (i=0; i<pi->x_dim; ++i)
541 if (bitset_is_set(good_row, i)) {
543 fprintf(out, " y%d_%d\tcQ%d\t%d\n", pi->x[i].n, pi->x[i].c, i, -1);
545 fprintf(out, " y%d_%d\tcy%d\t%d\n", pi->x[i].n, pi->x[i].c, i, 1);
548 fprintf(out, "RHS\n");
549 for (i=0; i<pi->x_dim; ++i)
550 if (bitset_is_set(good_row, i))
551 fprintf(out, " rhs\tcQ%d\t%d\n", i, -pi->bigM);
552 for (i=0; i<pi->A_dim; ++i)
553 fprintf(out, " rhs\tcA%d\t%d\n", i, 1);
554 for (i=0; i<pi->B_dim; ++i)
555 fprintf(out, " rhs\tcB%d\t%d\n", i, 1);
556 for (i=0; i<pi->x_dim; ++i)
557 if (bitset_is_set(good_row, i))
558 fprintf(out, " rhs\tcy%d\t%d\n", i, 2*pi->bigM);
560 fprintf(out, "ENDATA\n");
567 * Dumps an mps file representing the problem using directly a formalization as ILP.
569 static void pi_dump_dilp(problem_instance_t *pi) {
571 const matrix_elem_t *e;
573 DBG((dbg, LEVEL_1, "Dumping dilp...\n"));
575 out = ffopen(pi->co->name, "dilp", "wt");
576 fprintf(out, "NAME %s\n", pi->co->name);
577 fprintf(out, "OBJSENSE\n MAX\n");
579 fprintf(out, "ROWS\n");
580 fprintf(out, " N obj\n");
581 for (i=0; i<pi->A_dim; ++i)
582 fprintf(out, " E cA%d\n", i);
583 for (i=0; i<pi->B_dim; ++i)
584 fprintf(out, " L cB%d\n", i);
585 for (i=0; i<pi->E_dim; ++i)
586 fprintf(out, " L cE%d\n", i);
588 fprintf(out, "COLUMNS\n");
589 /* the x vars come first */
590 /* mark them as binaries */
591 fprintf(out, " MARKI0\t'MARKER'\t'INTORG'\n");
592 for (i=0; i<pi->x_dim; ++i) {
594 matrix_foreach_in_col(pi->A, i, e)
595 fprintf(out, " x%d_%d\tcA%d\t%d\n", pi->x[i].n, pi->x[i].c, e->row, e->val);
597 matrix_foreach_in_col(pi->B, i, e)
598 fprintf(out, " x%d_%d\tcB%d\t%d\n", pi->x[i].n, pi->x[i].c, e->row, e->val);
600 matrix_foreach_in_col(pi->E, i, e)
601 fprintf(out, " x%d_%d\tcE%d\t%d\n", pi->x[i].n, pi->x[i].c, e->row, e->val);
603 fprintf(out, " MARKI1\t'MARKER'\t'INTEND'\n"); /* end of marking */
605 /* next the y vars */
606 for (i=0; i<pi->c_dim; ++i) {
608 fprintf(out, " y%d\tobj\t%d\n", i, matrix_get(pi->c, 1, i));
610 matrix_foreach_in_col(pi->E, pi->x_dim+i, e)
611 fprintf(out, " y%d\tcE%d\t%d\n", i, e->row, e->val);
614 fprintf(out, "RHS\n");
615 for (i=0; i<pi->A_dim; ++i)
616 fprintf(out, " rhs\tcA%d\t%d\n", i, 1);
617 for (i=0; i<pi->B_dim; ++i)
618 fprintf(out, " rhs\tcB%d\t%d\n", i, 1);
619 for (i=0; i<pi->E_dim; ++i)
620 fprintf(out, " rhs\tcE%d\t%d\n", i, 1);
622 fprintf(out, "ENDATA\n");
629 * Dumps the known solution to a file to make use of it
630 * as a starting solution respectively as a bound
632 static void pi_dump_start_sol(problem_instance_t *pi) {
634 FILE *out = ffopen(pi->co->name, "mst", "wt");
635 fprintf(out, "NAME\n");
636 for (i=0; i<pi->x_dim; ++i) {
640 if (get_irn_col(pi->co, get_irn_for_graph_nr(pi->co->irg, n)) == c)
644 fprintf(out, " x%d_%d\t%d\n", n, c, val);
646 fprintf(out, "ENDATA\n");
653 * Invoke an external solver
655 static void pi_solve_ilp(problem_instance_t *pi) {
659 DBG((dbg, LEVEL_1, "Solving with CPLEX@RZ...\n"));
660 /* write command file for CPLEX */
661 out = ffopen(pi->co->name, "cmd", "wt");
662 fprintf(out, "set logfile %s.sol\n", pi->co->name);
663 fprintf(out, "set mip strategy mipstart 1\n");
664 fprintf(out, "set mip emphasis 3\n"); /* moving best bound */
665 fprintf(out, "set mip strategy variableselect 3\n"); /* strong branching */
666 // fprintf(out, "set mip strategy branch 1\n"); /* branch up first */
668 fprintf(out, "read %s.q2ilp mps\n", pi->co->name);
671 fprintf(out, "read %s.dilp mps\n", pi->co->name);
673 fprintf(out, "read %s.mst\n", pi->co->name);
674 fprintf(out, "optimize\n");
675 fprintf(out, "display solution variables 1-%d\n", pi->x_dim);
676 fprintf(out, "quit\n");
679 /* write expect-file for copying problem to RZ */
680 pwfile = fopen(SSH_PASSWD_FILE, "rt");
681 fgets(passwd, sizeof(passwd), pwfile);
684 out = ffopen(EXPECT_FILENAME, "exp", "wt");
685 fprintf(out, "#! /usr/bin/expect\n");
686 fprintf(out, "spawn scp %s.dilp %s.q2ilp %s.mst %s.cmd %s:\n", pi->co->name, pi->co->name, pi->co->name, pi->co->name, SSH_USER_HOST); /* copy problem files */
687 fprintf(out, "expect \"word:\"\nsend \"%s\\n\"\ninteract\n", passwd);
689 fprintf(out, "spawn ssh %s \"./cplex90 < %s.cmd\"\n", SSH_USER_HOST, pi->co->name); /* solve */
690 fprintf(out, "expect \"word:\"\nsend \"%s\\n\"\ninteract\n", passwd);
692 fprintf(out, "spawn scp %s:%s.sol .\n", SSH_USER_HOST, pi->co->name); /*copy back solution */
693 fprintf(out, "expect \"word:\"\nsend \"%s\\n\"\ninteract\n", passwd);
695 fprintf(out, "spawn ssh %s ./dell\n", SSH_USER_HOST); /* clean files on server */
696 fprintf(out, "expect \"word:\"\nsend \"%s\\n\"\ninteract\n", passwd);
700 /* call the expect script */
701 chmod(EXPECT_FILENAME ".exp", 0700);
702 system(EXPECT_FILENAME ".exp");
705 static void pi_set_simplicials(problem_instance_t *pi) {
706 simpl_t *simpl, *tmp;
707 bitset_t *used_cols = bitset_alloca(arch_register_class_n_regs(pi->co->cls));
709 /* color the simplicial nodes in right order */
710 list_for_each_entry_safe(simpl_t, simpl, tmp, &pi->simplicials, chain) {
712 ir_node *other_irn, *irn;
713 if_node_t *other, *ifn;
715 /* get free color by inspecting all neighbors */
717 irn = get_irn_for_graph_nr(pi->co->irg, ifn->nnr);
718 bitset_clear_all(used_cols);
719 foreach_neighb(ifn, other) {
720 other_irn = get_irn_for_graph_nr(pi->co->irg, other->nnr);
721 if (!is_removed(other_irn)) /* only inspect nodes which are in graph right now */
722 bitset_set(used_cols, get_irn_col(pi->co, other_irn));
725 /* now all bits not set are possible colors */
726 free_col = bitset_next_clear(used_cols, 0);
727 assert(free_col != -1 && "No free color found. This can not be.");
728 set_irn_col(pi->co, irn, free_col);
729 pset_remove_ptr(pi->removed, irn); /* irn is back in graph again */
735 * Sets the colors of irns according to the values of variables found in the
736 * output file of the solver.
738 static void pi_apply_solution(problem_instance_t *pi) {
741 if (!(in = ffopen(pi->co->name, "sol", "rt")))
743 DBG((dbg, LEVEL_1, "Applying solution...\n"));
746 int num = -1, col = -1, val = -1;
748 fgets(buf, sizeof(buf), in);
749 DBG((dbg, LEVEL_3, "Line: %s", buf));
751 if (strcmp(buf, "No integer feasible solution exists.") == 0)
752 assert(0 && "CPLEX says: No integer feasible solution exists!");
754 if (strcmp(buf, "TODO Out of memory") == 0) {}
761 if (sscanf(buf, "Solution time = %f sec. Iterations = %d", &sol_time, &iter) == 2) {
762 DBG((dbg, LEVEL_2, " Time: %f Iter: %d\n", sol_time, iter));
763 curr_vals[I_ILP_TIME] += 10 * sol_time;
764 curr_vals[I_ILP_ITER] += iter;
770 if (sscanf(buf, "x%d_%d %d", &num, &col, &val) == 3 && val == 1) {
771 DBG((dbg, LEVEL_2, " x%d_%d = %d\n", num, col, val));
772 set_irn_col(pi->co, get_irn_for_graph_nr(pi->co->irg, num), col);
776 pi_set_simplicials(pi);
778 #endif /* DO_SOLVE */
781 static void pi_delete_files(problem_instance_t *pi) {
783 int end = snprintf(buf, sizeof(buf), "%s", pi->co->name);
784 DBG((dbg, LEVEL_1, "Deleting files...\n"));
786 snprintf(buf+end, sizeof(buf)-end, ".matrix");
790 snprintf(buf+end, sizeof(buf)-end, ".q2ilp");
794 snprintf(buf+end, sizeof(buf)-end, ".dilp");
798 snprintf(buf+end, sizeof(buf)-end, ".cmd");
800 snprintf(buf+end, sizeof(buf)-end, ".mst");
802 snprintf(buf+end, sizeof(buf)-end, ".sol");
804 remove(EXPECT_FILENAME ".exp");
809 void co_ilp_opt(copy_opt_t *co) {
810 problem_instance_t *pi;
812 dbg = firm_dbg_register("ir.be.copyoptilp");
813 firm_dbg_set_mask(dbg, DEBUG_LVL);
814 if (!strcmp(co->name, DEBUG_IRG))
815 firm_dbg_set_mask(dbg, -1);
818 DBG((dbg, 0, "\t\t\t %5d %5d %5d\n", pi->x_dim, pi->A_dim, pi->B_dim));
822 pi_dump_matrices(pi);
834 pi_dump_start_sol(pi);
838 pi_apply_solution(pi);