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 DO_SOLVE /**< solve the MPS output with CPLEX */
47 #undef DELETE_FILES /**< deletes all dumped files after use */
49 /* CPLEX-account related stuff */
50 #define SSH_USER_HOST "kb61@sp-smp.rz.uni-karlsruhe.de"
51 #define SSH_PASSWD_FILE "/ben/daniel/.smppw"
52 #define EXPECT_FILENAME "runme" /* name of the expect-script */
54 #define DEBUG_LVL SET_LEVEL_1
55 static firm_dbg_module_t *dbg = NULL;
57 #define SLOTS_NUM2POS 256
58 #define SLOTS_LIVING 32
60 /* get_weight represents the _gain_ if node n and m have the same color. */
61 #define get_weight(n,m) 1
64 * A type storing names of the x variables in the form x[NUMBER]_[COLOR]
66 typedef struct _x_name_t {
71 * For each node taking part in the opt-problem its position in the
72 * x-variable-vector is stored in a set. This set maps the node-nr (given by
73 * benumb) to the position in the vector.
75 typedef struct _num2pos_t {
79 typedef struct _simpl_t {
80 struct list_head chain;
85 * A type storing the unmodified '0-1 quadratic program' of the form
91 * This problem is called the original problem
93 typedef struct _problem_instance_t {
94 const copy_opt_t *co; /** the original copy_opt problem */
95 int x_dim, A_dim, B_dim, E_dim, c_dim; /**< number of: x variables (equals Q_dim), rows in A, rows in B */
96 sp_matrix_t *Q, *A, *B, *E, *c; /**< the (sparse) matrices of this problem */
97 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. */
98 set *num2pos; /**< maps node numbers to positions in x. */
100 /* problem size reduction removing simple nodes */
101 struct list_head simplicials; /**< holds all simpl_t's in right order to color*/
102 pset *removed; /**< holds all removed simplicial irns */
104 /* needed for linearization */
105 int bigM, maxQij, minQij;
107 /* overhead needed to build this */
111 } problem_instance_t;
113 #define is_removed(irn) pset_find_ptr(pi->removed, irn)
115 /* Nodes have consecutive numbers so this hash shoud be fine */
116 #define HASH_NUM(num) num
118 static int set_cmp_num2pos(const void *x, const void *y, size_t size) {
119 return ((num2pos_t *)x)->num != ((num2pos_t *)y)->num;
123 * Sets the first position of node with number num to pos.
124 * See x_name_t *x in _problem_instance_t.
126 static INLINE void pi_set_first_pos(problem_instance_t *pi, int num, int pos) {
130 set_insert(pi->num2pos, &find, sizeof(find), HASH_NUM(num));
134 * Get position by number. (First possible color)
135 * returns -1 if not found.
137 static INLINE int pi_get_first_pos(problem_instance_t *pi, int num) {
138 num2pos_t find, *found;
140 found = set_find(pi->num2pos, &find, sizeof(find), HASH_NUM(num));
142 assert(pi->x[found->pos].n == num && (found->pos == 0 || pi->x[found->pos-1].n != num) && "pi->num2pos is broken!");
149 * Get position by number and color.
150 * returns -1 if not found.
152 static INLINE int pi_get_pos(problem_instance_t *pi, int num, int col) {
153 num2pos_t find, *found;
157 found = set_find(pi->num2pos, &find, sizeof(find), HASH_NUM(num));
161 while (pos < pi->x_dim && pi->x[pos].n == num && pi->x[pos].c < col)
164 if (pi->x[pos].n == num && pi->x[pos].c == col)
171 * Collects all irns in currently processed register class
173 static void pi_collect_x_names(ir_node *block, void *env) {
174 problem_instance_t *pi = env;
175 struct list_head *head = &get_ra_block_info(block)->border_head;
177 bitset_t *pos_regs = bitset_alloca(pi->co->cls->n_regs);
179 list_for_each_entry_reverse(border_t, curr, head, list)
180 if (curr->is_def && curr->is_real && !is_removed(curr->irn)) {
182 pi->A_dim++; /* one knapsack constraint for each node */
184 xx.n = get_irn_graph_nr(curr->irn);
185 pi_set_first_pos(pi, xx.n, pi->x_dim);
187 // iterate over all possible colors in order
188 bitset_clear_all(pos_regs);
189 arch_get_allocatable_regs(pi->co->env, curr->irn, arch_pos_make_out(0), pi->co->cls, pos_regs);
190 bitset_foreach(pos_regs, xx.c) {
191 DBG((dbg, LEVEL_2, "Adding %n %d\n", curr->irn, xx.c));
192 obstack_grow(&pi->ob, &xx, sizeof(xx));
193 pi->x_dim++; /* one x variable for each node and color */
199 * Checks if all nodes in living are live_out in block block.
201 static INLINE int all_live_in(ir_node *block, pset *living) {
203 for (n = pset_first(living); n; n = pset_next(living))
204 if (!is_live_in(block, n)) {
212 * Finds cliques in the interference graph, considering only nodes
213 * for which the color pi->curr_color is possible. Finds only 'maximal-cliques',
214 * viz cliques which are not conatained in another one.
215 * This is used for the matrix B.
217 static void pi_clique_finder(ir_node *block, void *env) {
218 problem_instance_t *pi = env;
219 enum phase_t {growing, shrinking} phase = growing;
220 struct list_head *head = &get_ra_block_info(block)->border_head;
222 pset *living = pset_new_ptr(SLOTS_LIVING);
224 list_for_each_entry_reverse(border_t, b, head, list) {
225 const ir_node *irn = b->irn;
230 DBG((dbg, LEVEL_2, "Def %n\n", irn));
231 pset_insert_ptr(living, irn);
233 } else { /* is_use */
234 DBG((dbg, LEVEL_2, "Use %n\n", irn));
236 /* before shrinking the set, store the current 'maximum' clique;
237 * do NOT if clique is a single node
238 * do NOT if all values are live_in (in this case they were contained in a live-out clique elsewhere) */
239 if (phase == growing && pset_count(living) >= 2 && !all_live_in(block, living)) {
241 for (n = pset_first(living); n; n = pset_next(living)) {
242 int pos = pi_get_pos(pi, get_irn_graph_nr(n), pi->curr_color);
243 matrix_set(pi->B, pi->curr_row, pos, 1);
244 DBG((dbg, LEVEL_2, "B[%d, %d] := %d\n", pi->curr_row, pos, 1));
248 pset_remove_ptr(living, irn);
256 static INLINE int pi_is_simplicial(problem_instance_t *pi, const if_node_t *ifn) {
258 if_node_t **all, *curr;
259 all = alloca(ifn_get_degree(ifn) * sizeof(*all));
261 /* get all non-removed neighbors */
262 foreach_neighb(ifn, curr)
263 if (!is_removed(curr))
266 /* check if these form a clique */
267 for (i=0; i<size; ++i)
268 for (o=i+1; o<size; ++o)
269 if (!ifg_has_edge(pi->co->irg, all[i], all[o]))
272 /* all edges exist so this is a clique */
276 static void pi_find_simplicials(problem_instance_t *pi) {
281 if_nodes = be_ra_get_ifg_nodes(pi->co->irg);
284 for (ifn = set_first(if_nodes); ifn; ifn = set_next(if_nodes)) {
285 ir_node *irn = get_irn_for_graph_nr(pi->co->irg, ifn->nnr);
286 if (!is_removed(irn) && !is_optimizable(irn) && !is_optimizable_arg(irn) && pi_is_simplicial(pi, ifn)) {
287 simpl_t *s = xmalloc(sizeof(*s));
289 list_add(&s->chain, &pi->simplicials);
290 pset_insert_ptr(pi->removed, irn);
292 DBG((dbg, LEVEL_1, " Removed %n\n", irn));
299 * Generate the initial problem matrices and vectors.
301 static problem_instance_t *new_pi(const copy_opt_t *co) {
302 DBG((dbg, LEVEL_1, "Generating new instance...\n"));
303 problem_instance_t *pi = xcalloc(1, sizeof(*pi));
305 pi->num2pos = new_set(set_cmp_num2pos, SLOTS_NUM2POS);
307 pi->removed = pset_new_ptr_default();
308 INIT_LIST_HEAD(&pi->simplicials);
310 /* problem size reduction */
311 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);
462 * Dumps an mps file representing the problem using a linearization of the
463 * quadratic programming problem.
465 static void pi_dump_q2ilp(problem_instance_t *pi) {
467 const matrix_elem_t *e;
470 DBG((dbg, LEVEL_1, "Dumping q2ilp...\n"));
472 max_abs_Qij = pi->maxQij;
473 if (-pi->minQij > max_abs_Qij)
474 max_abs_Qij = -pi->minQij;
475 pi->bigM = pi->A_dim * max_abs_Qij;
476 DBG((dbg, LEVEL_2, "BigM = %d\n", pi->bigM));
478 matrix_optimize(pi->Q);
479 good_row = bitset_alloca(pi->x_dim);
480 for (i=0; i<pi->x_dim; ++i)
481 if (matrix_row_first(pi->Q, i))
482 bitset_set(good_row, i);
484 out = ffopen(pi->co->name, "q2ilp", "wt");
485 fprintf(out, "NAME %s\n", pi->co->name);
487 fprintf(out, "ROWS\n");
488 fprintf(out, " N obj\n");
489 for (i=0; i<pi->x_dim; ++i)
490 if (bitset_is_set(good_row, i))
491 fprintf(out, " E cQ%d\n", i);
492 for (i=0; i<pi->A_dim; ++i)
493 fprintf(out, " E cA%d\n", i);
494 for (i=0; i<pi->B_dim; ++i)
495 fprintf(out, " L cB%d\n", i);
496 for (i=0; i<pi->x_dim; ++i)
497 if (bitset_is_set(good_row, i))
498 fprintf(out, " L cy%d\n", i);
500 fprintf(out, "COLUMNS\n");
501 /* the x vars come first */
502 /* mark them as binaries */
503 fprintf(out, " MARKI0\t'MARKER'\t'INTORG'\n");
504 for (i=0; i<pi->x_dim; ++i) {
505 /* participation in objective */
506 if (bitset_is_set(good_row, i))
507 fprintf(out, " x%d_%d\tobj\t%d\n", pi->x[i].n, pi->x[i].c, -pi->bigM);
509 matrix_foreach_in_col(pi->Q, i, e)
510 fprintf(out, " x%d_%d\tcQ%d\t%d\n", pi->x[i].n, pi->x[i].c, e->row, e->val);
512 matrix_foreach_in_col(pi->A, i, e)
513 fprintf(out, " x%d_%d\tcA%d\t%d\n", pi->x[i].n, pi->x[i].c, e->row, e->val);
515 matrix_foreach_in_col(pi->B, i, e)
516 fprintf(out, " x%d_%d\tcB%d\t%d\n", pi->x[i].n, pi->x[i].c, e->row, e->val);
518 if (bitset_is_set(good_row, i))
519 fprintf(out, " x%d_%d\tcy%d\t%d\n", pi->x[i].n, pi->x[i].c, i, 2*pi->bigM);
522 fprintf(out, " MARKI1\t'MARKER'\t'INTEND'\n"); /* end of marking */
524 /* next the s vars */
525 for (i=0; i<pi->x_dim; ++i)
526 if (bitset_is_set(good_row, i)) {
527 /* participation in objective */
528 fprintf(out, " s%d_%d\tobj\t%d\n", pi->x[i].n, pi->x[i].c, 1);
530 fprintf(out, " s%d_%d\tcQ%d\t%d\n", pi->x[i].n, pi->x[i].c, i, -1);
533 /* next the y vars */
534 for (i=0; i<pi->x_dim; ++i)
535 if (bitset_is_set(good_row, i)) {
537 fprintf(out, " y%d_%d\tcQ%d\t%d\n", pi->x[i].n, pi->x[i].c, i, -1);
539 fprintf(out, " y%d_%d\tcy%d\t%d\n", pi->x[i].n, pi->x[i].c, i, 1);
542 fprintf(out, "RHS\n");
543 for (i=0; i<pi->x_dim; ++i)
544 if (bitset_is_set(good_row, i))
545 fprintf(out, " rhs\tcQ%d\t%d\n", i, -pi->bigM);
546 for (i=0; i<pi->A_dim; ++i)
547 fprintf(out, " rhs\tcA%d\t%d\n", i, 1);
548 for (i=0; i<pi->B_dim; ++i)
549 fprintf(out, " rhs\tcB%d\t%d\n", i, 1);
550 for (i=0; i<pi->x_dim; ++i)
551 if (bitset_is_set(good_row, i))
552 fprintf(out, " rhs\tcy%d\t%d\n", i, 2*pi->bigM);
554 fprintf(out, "ENDATA\n");
561 * Dumps an mps file representing the problem using directly a formalization as ILP.
563 static void pi_dump_dilp(problem_instance_t *pi) {
565 const matrix_elem_t *e;
567 DBG((dbg, LEVEL_1, "Dumping dilp...\n"));
569 out = ffopen(pi->co->name, "dilp", "wt");
570 fprintf(out, "NAME %s\n", pi->co->name);
571 fprintf(out, "OBJSENSE\n MAX\n");
573 fprintf(out, "ROWS\n");
574 fprintf(out, " N obj\n");
575 for (i=0; i<pi->A_dim; ++i)
576 fprintf(out, " E cA%d\n", i);
577 for (i=0; i<pi->B_dim; ++i)
578 fprintf(out, " L cB%d\n", i);
579 for (i=0; i<pi->E_dim; ++i)
580 fprintf(out, " L cE%d\n", i);
582 fprintf(out, "COLUMNS\n");
583 /* the x vars come first */
584 /* mark them as binaries */
585 fprintf(out, " MARKI0\t'MARKER'\t'INTORG'\n");
586 for (i=0; i<pi->x_dim; ++i) {
588 matrix_foreach_in_col(pi->A, i, e)
589 fprintf(out, " x%d_%d\tcA%d\t%d\n", pi->x[i].n, pi->x[i].c, e->row, e->val);
591 matrix_foreach_in_col(pi->B, i, e)
592 fprintf(out, " x%d_%d\tcB%d\t%d\n", pi->x[i].n, pi->x[i].c, e->row, e->val);
594 matrix_foreach_in_col(pi->E, i, e)
595 fprintf(out, " x%d_%d\tcE%d\t%d\n", pi->x[i].n, pi->x[i].c, e->row, e->val);
597 fprintf(out, " MARKI1\t'MARKER'\t'INTEND'\n"); /* end of marking */
599 /* next the y vars */
600 for (i=0; i<pi->c_dim; ++i) {
602 fprintf(out, " y%d\tobj\t%d\n", i, matrix_get(pi->c, 1, i));
604 matrix_foreach_in_col(pi->E, pi->x_dim+i, e)
605 fprintf(out, " y%d\tcE%d\t%d\n", i, e->row, e->val);
608 fprintf(out, "RHS\n");
609 for (i=0; i<pi->A_dim; ++i)
610 fprintf(out, " rhs\tcA%d\t%d\n", i, 1);
611 for (i=0; i<pi->B_dim; ++i)
612 fprintf(out, " rhs\tcB%d\t%d\n", i, 1);
613 for (i=0; i<pi->E_dim; ++i)
614 fprintf(out, " rhs\tcE%d\t%d\n", i, 1);
616 fprintf(out, "ENDATA\n");
623 * Dumps the known solution to a file to make use of it
624 * as a starting solution respectively as a bound
626 static void pi_dump_start_sol(problem_instance_t *pi) {
628 FILE *out = ffopen(pi->co->name, "mst", "wt");
629 fprintf(out, "NAME\n");
630 for (i=0; i<pi->x_dim; ++i) {
634 if (get_irn_col(pi->co, get_irn_for_graph_nr(pi->co->irg, n)) == c)
638 fprintf(out, " x%d_%d\t%d\n", n, c, val);
640 fprintf(out, "ENDATA\n");
645 * Invoke an external solver
647 static void pi_solve_ilp(problem_instance_t *pi) {
651 DBG((dbg, LEVEL_1, "Solving with CPLEX@RZ...\n"));
652 /* write command file for CPLEX */
653 out = ffopen(pi->co->name, "cmd", "wt");
654 fprintf(out, "set logfile %s.sol\n", pi->co->name);
656 fprintf(out, "read %s.q2ilp mps\n", pi->co->name);
659 fprintf(out, "read %s.dilp mps\n", pi->co->name);
661 fprintf(out, "read %s.mst\n", pi->co->name);
662 fprintf(out, "set mip strategy mipstart 1\n");
663 //fprintf(out, "set mip emphasis 3\n");
664 fprintf(out, "optimize\n");
665 fprintf(out, "display solution variables 1-%d\n", pi->x_dim);
666 fprintf(out, "quit\n");
669 /* write expect-file for copying problem to RZ */
670 pwfile = fopen(SSH_PASSWD_FILE, "rt");
671 fgets(passwd, sizeof(passwd), pwfile);
674 out = ffopen(EXPECT_FILENAME, "exp", "wt");
675 fprintf(out, "#! /usr/bin/expect\n");
676 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 */
677 fprintf(out, "expect \"word:\"\nsend \"%s\\n\"\ninteract\n", passwd);
679 fprintf(out, "spawn ssh %s \"./cplex90 < %s.cmd\"\n", SSH_USER_HOST, pi->co->name); /* solve */
680 fprintf(out, "expect \"word:\"\nsend \"%s\\n\"\ninteract\n", passwd);
682 fprintf(out, "spawn scp %s:%s.sol .\n", SSH_USER_HOST, pi->co->name); /*copy back solution */
683 fprintf(out, "expect \"word:\"\nsend \"%s\\n\"\ninteract\n", passwd);
685 fprintf(out, "spawn ssh %s ./dell\n", SSH_USER_HOST); /* clean files on server */
686 fprintf(out, "expect \"word:\"\nsend \"%s\\n\"\ninteract\n", passwd);
690 /* call the expect script */
691 chmod(EXPECT_FILENAME ".exp", 0700);
692 system(EXPECT_FILENAME ".exp");
695 static void pi_set_simplicials(problem_instance_t *pi) {
696 simpl_t *simpl, *tmp;
697 bitset_t *used_cols = bitset_alloca(arch_register_class_n_regs(pi->co->cls));
699 /* color the simplicial nodes in right order */
700 list_for_each_entry_safe(simpl_t, simpl, tmp, &pi->simplicials, chain) {
702 ir_node *other_irn, *irn;
703 if_node_t *other, *ifn;
705 /* get free color by inspecting all neighbors */
707 irn = get_irn_for_graph_nr(pi->co->irg, ifn->nnr);
708 bitset_clear_all(used_cols);
709 foreach_neighb(ifn, other) {
710 other_irn = get_irn_for_graph_nr(pi->co->irg, other->nnr);
711 if (!is_removed(other_irn)) /* only inspect nodes which are in graph right now */
712 bitset_set(used_cols, get_irn_col(pi->co, other_irn));
715 /* now all bits not set are possible colors */
716 free_col = bitset_next_clear(used_cols, 0);
717 assert(free_col != -1 && "No free color found. This can not be.");
718 set_irn_col(pi->co, irn, free_col);
719 pset_remove_ptr(pi->removed, irn); /* irn is back in graph again */
725 * Sets the colors of irns according to the values of variables found in the
726 * output file of the solver.
728 static void pi_apply_solution(problem_instance_t *pi) {
731 if (!(in = ffopen(pi->co->name, "sol", "rt")))
733 DBG((dbg, LEVEL_1, "Applying solution...\n"));
736 int num = -1, col = -1, val = -1;
738 fgets(buf, sizeof(buf), in);
739 DBG((dbg, LEVEL_3, "Line: %s", buf));
741 if (strcmp(buf, "No integer feasible solution exists.") == 0)
742 assert(0 && "CPLEX says: No integer feasible solution exists!");
744 if (strcmp(buf, "TODO Out of memory") == 0) {}
751 if (sscanf(buf, "Solution time = %f sec. Iterations = %d", &sol_time, &iter) == 2) {
752 DBG((dbg, LEVEL_2, " Time: %f Iter: %d\n", sol_time, iter));
753 curr_vals[I_ILP_TIME] += 10 * sol_time;
754 curr_vals[I_ILP_ITER] += iter;
760 if (sscanf(buf, "x%d_%d %d", &num, &col, &val) == 3 && val == 1) {
761 DBG((dbg, LEVEL_2, " x%d_%d = %d\n", num, col, val));
762 set_irn_col(pi->co, get_irn_for_graph_nr(pi->co->irg, num), col);
766 pi_set_simplicials(pi);
768 #endif /* DO_SOLVE */
771 static void pi_delete_files(problem_instance_t *pi) {
773 int end = snprintf(buf, sizeof(buf), "%s", pi->co->name);
774 DBG((dbg, LEVEL_1, "Deleting files...\n"));
776 snprintf(buf+end, sizeof(buf)-end, ".matrix");
780 snprintf(buf+end, sizeof(buf)-end, ".q2ilp");
784 snprintf(buf+end, sizeof(buf)-end, ".dilp");
788 snprintf(buf+end, sizeof(buf)-end, ".cmd");
790 snprintf(buf+end, sizeof(buf)-end, ".mst");
792 snprintf(buf+end, sizeof(buf)-end, ".sol");
794 remove(EXPECT_FILENAME ".exp");
799 void co_ilp_opt(copy_opt_t *co) {
800 problem_instance_t *pi;
802 dbg = firm_dbg_register("ir.be.copyoptilp");
803 firm_dbg_set_mask(dbg, DEBUG_LVL);
804 if (!strcmp(co->name, DEBUG_IRG))
805 firm_dbg_set_mask(dbg, -1);
808 DBG((dbg, 0, "\t\t\t %5d %5d %5d\n", pi->x_dim, pi->A_dim, pi->B_dim));
812 pi_dump_matrices(pi);
824 pi_dump_start_sol(pi);
826 pi_apply_solution(pi);