2 * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
21 * Author: Daniel Grund
23 * Copyright: (c) Universitaet Karlsruhe
24 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
27 * ILP formalization using G=(V, E, Q):
28 * - 2 class of variables: coloring vars x_ic and equal color vars y_ij
30 * - Clique-star constraints
33 * \min \sum_{ (i,j) \in Q } w_ij y_ij
35 * \sum_c x_nc = 1 n \in N, c \in C
37 * x_nc = 0 n \in N, c \not\in C(n)
39 * \sum x_nc <= 1 x_nc \in Clique \in AllCliques, c \in C
41 * \sum_{e \in p} y_e >= 1 p \in P path constraints
43 * \sum_{e \in cs} y_e >= |cs| - 1 cs \in CP clique-star constraints
45 * x_nc, y_ij \in N, w_ij \in R^+
50 #endif /* HAVE_CONFIG_H */
55 #include "raw_bitset.h"
60 #include "becopyilp_t.h"
62 #include "besched_t.h"
63 #include "benodesets.h"
67 typedef struct _local_env_t {
69 int first_x_var, last_x_var;
71 DEBUG_ONLY(firm_dbg_module_t *dbg;)
74 static void build_coloring_cstr(ilp_env_t *ienv) {
75 be_ifg_t *ifg = ienv->co->cenv->ifg;
76 void *iter = be_ifg_nodes_iter_alloca(ifg);
81 colors = bitset_alloca(arch_register_class_n_regs(ienv->co->cls));
83 be_ifg_foreach_node(ifg, iter, irn)
84 if (!sr_is_removed(ienv->sr, irn)) {
86 const arch_register_req_t *req;
87 int curr_node_color = get_irn_col(ienv->co, irn);
88 int node_nr = (int)get_irn_node_nr(irn);
89 local_env_t *lenv = ienv->env;
91 pmap_insert(lenv->nr_2_irn, INT_TO_PTR(node_nr), irn);
93 req = arch_get_register_req(ienv->co->aenv, irn, -1);
95 /* get assignable colors */
96 if (arch_register_req_is(req, limited)) {
97 rbitset_copy_to_bitset(req->limited, colors);
99 arch_register_class_put(req->cls, colors);
100 // bitset_andnot(colors, ienv->co->cenv->ignore_colors);
103 /* add the coloring constraint */
104 cst_idx = lpp_add_cst(ienv->lp, NULL, lpp_equal, 1.0);
106 bitset_foreach(colors, col) {
107 int var_idx = lpp_add_var(ienv->lp, name_cdd(buf, 'x', node_nr, col), lpp_binary, 0.0);
108 lpp_set_start_value(ienv->lp, var_idx, (col == curr_node_color) ? 1.0 : 0.0);
109 lpp_set_factor_fast(ienv->lp, cst_idx, var_idx, 1);
111 lenv->last_x_var = var_idx;
112 if (lenv->first_x_var == -1)
113 lenv->first_x_var = var_idx;
116 /* add register constraint constraints */
117 bitset_foreach_clear(colors, col) {
118 int cst_idx = lpp_add_cst(ienv->lp, NULL, lpp_equal, 0.0);
119 int var_idx = lpp_add_var(ienv->lp, name_cdd(buf, 'x', node_nr, col), lpp_binary, 0.0);
120 lpp_set_start_value(ienv->lp, var_idx, 0.0);
121 lpp_set_factor_fast(ienv->lp, cst_idx, var_idx, 1);
123 lenv->last_x_var = var_idx;
128 static void build_interference_cstr(ilp_env_t *ienv) {
129 lpp_t *lpp = ienv->lp;
130 be_ifg_t *ifg = ienv->co->cenv->ifg;
131 int n_colors = arch_register_class_n_regs(ienv->co->cls);
134 void *iter = be_ifg_cliques_iter_alloca(ifg);
135 ir_node **clique = alloca(sizeof(*clique) * n_colors);
140 /* for each maximal clique */
141 be_ifg_foreach_clique(ifg, iter, clique, &size) {
144 for (i=0; i<size; ++i)
145 if (!sr_is_removed(ienv->sr, clique[i]))
152 for (col=0; col<n_colors; ++col) {
153 int cst_idx = lpp_add_cst(lpp, NULL, lpp_less, 1.0);
155 /* for each member of this clique */
156 for (i=0; i<size; ++i) {
157 ir_node *irn = clique[i];
159 if (!sr_is_removed(ienv->sr, irn)) {
160 int var_idx = lpp_get_var_idx(lpp, name_cdd(buf, 'x', (int)get_irn_node_nr(irn), col));
161 lpp_set_factor_fast(lpp, cst_idx, var_idx, 1);
170 * TODO: Remove the dependency of the opt-units data structure
171 * by walking over all affinity edges. Graph structure
172 * does not provide this walker, yet.
174 static void build_affinity_cstr(ilp_env_t *ienv) {
176 int n_colors = arch_register_class_n_regs(ienv->co->cls);
178 /* for all optimization units */
179 list_for_each_entry(unit_t, curr, &ienv->co->units, units) {
181 int root_nr, arg_nr, i, col, y_idx, root_idx, arg_idx;
183 int root_col, arg_col;
185 root = curr->nodes[0];
186 root_nr = (int) get_irn_node_nr(root);
187 root_col = get_irn_col(ienv->co, root);
189 for (i = 1; i < curr->node_count; ++i) {
190 arg = curr->nodes[i];
191 arg_nr = (int) get_irn_node_nr(arg);
192 arg_col = get_irn_col(ienv->co, arg);
194 /* add a new affinity variable */
195 y_idx = lpp_add_var(ienv->lp, name_cdd_sorted(buf, 'y', root_nr, arg_nr), lpp_binary, curr->costs[i]);
196 lpp_set_start_value(ienv->lp, y_idx, (root_col==arg_col) ? 0.0 : 1.0);
198 /* add constraints relating the affinity var to the color vars */
199 for (col=0; col<n_colors; ++col) {
200 int cst_idx = lpp_add_cst(ienv->lp, NULL, lpp_less, 0.0);
201 root_idx = lpp_get_var_idx(ienv->lp, name_cdd(buf, 'x', root_nr, col));
202 arg_idx = lpp_get_var_idx(ienv->lp, name_cdd(buf, 'x', arg_nr, col));
204 lpp_set_factor_fast(ienv->lp, cst_idx, root_idx, 1.0);
205 lpp_set_factor_fast(ienv->lp, cst_idx, arg_idx, -1.0);
206 lpp_set_factor_fast(ienv->lp, cst_idx, y_idx, -1.0);
213 * Helping stuff for build_clique_star_cstr
215 typedef struct _edge_t {
219 static int compare_edge_t(const void *k1, const void *k2, size_t size) {
220 const edge_t *e1 = k1;
221 const edge_t *e2 = k2;
223 return ! (e1->n1 == e2->n1 && e1->n2 == e2->n2);
226 #define HASH_EDGE(e) (nodeset_hash((e)->n1) ^ nodeset_hash((e)->n2))
228 static INLINE edge_t *add_edge(set *edges, ir_node *n1, ir_node *n2, int *counter) {
231 if (PTR_TO_INT(n1) < PTR_TO_INT(n2)) {
239 return set_insert(edges, &new_edge, sizeof(new_edge), HASH_EDGE(&new_edge));
242 static INLINE edge_t *find_edge(set *edges, ir_node *n1, ir_node *n2) {
245 if (PTR_TO_INT(n1) < PTR_TO_INT(n2)) {
252 return set_find(edges, &new_edge, sizeof(new_edge), HASH_EDGE(&new_edge));
255 static INLINE void remove_edge(set *edges, ir_node *n1, ir_node *n2, int *counter) {
258 if (PTR_TO_INT(n1) < PTR_TO_INT(n2)) {
265 e = set_find(edges, &new_edge, sizeof(new_edge), HASH_EDGE(&new_edge));
273 #define pset_foreach(pset, irn) for(irn=pset_first(pset); irn; irn=pset_next(pset))
276 * Search for an interference clique and an external node
277 * with affinity edges to all nodes of the clique.
278 * At most 1 node of the clique can be colored equally with the external node.
280 static void build_clique_star_cstr(ilp_env_t *ienv) {
281 affinity_node_t *aff;
283 /* for each node with affinity edges */
284 co_gs_foreach_aff_node(ienv->co, aff) {
287 ir_node *center = aff->irn;
290 int i, o, n_nodes, n_edges;
293 edges = new_set(compare_edge_t, 8);
295 /* get all affinity neighbours */
297 co_gs_foreach_neighb(aff, nbr) {
298 obstack_ptr_grow(&ob, nbr->irn);
301 nodes = obstack_finish(&ob);
303 /* get all interference edges between these */
305 for (i=0; i<n_nodes; ++i)
307 if (be_ifg_connected(ienv->co->cenv->ifg, nodes[i], nodes[o]))
308 add_edge(edges, nodes[i], nodes[o], &n_edges);
310 /* cover all these interference edges with maximal cliques */
313 pset *clique = pset_new_ptr(8);
316 /* get 2 starting nodes to form a clique */
317 for (e=set_first(edges); !e->n1; e=set_next(edges))
320 /* we could be stepped out of the loop before the set iterated to the end */
323 pset_insert_ptr(clique, e->n1);
324 pset_insert_ptr(clique, e->n2);
325 remove_edge(edges, e->n1, e->n2, &n_edges);
327 /* while the clique is growing */
331 /* search for a candidate to extend the clique */
332 for (i=0; i<n_nodes; ++i) {
333 ir_node *member, *cand = nodes[i];
336 /* if its already in the clique try the next */
337 if (pset_find_ptr(clique, cand))
340 /* are there all necessary interferences? */
342 pset_foreach(clique, member) {
343 if (!find_edge(edges, cand, member)) {
350 /* now we know if we have a clique extender */
352 /* first remove all covered edges */
353 pset_foreach(clique, member)
354 remove_edge(edges, cand, member, &n_edges);
356 /* insert into clique */
357 pset_insert_ptr(clique, cand);
364 /* now the clique is maximal. Finally add the constraint */
367 int var_idx, cst_idx, center_nr, member_nr;
370 cst_idx = lpp_add_cst(ienv->lp, NULL, lpp_greater, pset_count(clique)-1);
371 center_nr = get_irn_node_nr(center);
373 pset_foreach(clique, member) {
374 member_nr = get_irn_node_nr(member);
375 var_idx = lpp_get_var_idx(ienv->lp, name_cdd_sorted(buf, 'y', center_nr, member_nr));
376 lpp_set_factor_fast(ienv->lp, cst_idx, var_idx, 1.0);
384 obstack_free(&ob, NULL);
389 static void extend_path(ilp_env_t *ienv, pdeq *path, ir_node *irn) {
390 be_ifg_t *ifg = ienv->co->cenv->ifg;
393 affinity_node_t *aff;
396 /* do not walk backwards or in circles */
397 if (pdeq_contains(path, irn))
400 /* insert the new irn */
401 pdeq_putr(path, irn);
405 /* check for forbidden interferences */
406 len = pdeq_len(path);
407 curr_path = alloca(len * sizeof(*curr_path));
408 pdeq_copyl(path, (const void **)curr_path);
410 for (i=1; i<len; ++i)
411 if (be_ifg_connected(ifg, irn, curr_path[i]))
416 /* check for terminating interference */
417 if (be_ifg_connected(ifg, irn, curr_path[0])) {
419 /* One node is not a path. */
420 /* And a path of length 2 is covered by a clique star constraint. */
422 /* finally build the constraint */
423 int cst_idx = lpp_add_cst(ienv->lp, NULL, lpp_greater, 1.0);
424 for (i=1; i<len; ++i) {
426 int nr_1 = get_irn_node_nr(curr_path[i-1]);
427 int nr_2 = get_irn_node_nr(curr_path[i]);
428 int var_idx = lpp_get_var_idx(ienv->lp, name_cdd_sorted(buf, 'y', nr_1, nr_2));
429 lpp_set_factor_fast(ienv->lp, cst_idx, var_idx, 1.0);
433 /* this path cannot be extended anymore */
439 /* recursively extend the path */
440 aff = get_affinity_info(ienv->co, irn);
441 co_gs_foreach_neighb(aff, nbr)
442 extend_path(ienv, path, nbr->irn);
452 * Search a path of affinity edges, whose ends are connected
453 * by an interference edge and there are no other interference
455 * Then at least one of these affinity edges must break.
457 static void build_path_cstr(ilp_env_t *ienv) {
458 affinity_node_t *aff_info;
460 /* for each node with affinity edges */
461 co_gs_foreach_aff_node(ienv->co, aff_info) {
462 pdeq *path = new_pdeq();
464 extend_path(ienv, path, aff_info->irn);
470 static void ilp2_build(ilp_env_t *ienv) {
471 local_env_t *lenv = ienv->env;
474 ienv->lp = new_lpp(ienv->co->name, lpp_minimize);
475 build_coloring_cstr(ienv);
476 build_interference_cstr(ienv);
477 build_affinity_cstr(ienv);
478 build_clique_star_cstr(ienv);
479 build_path_cstr(ienv);
481 lower_bound = co_get_lower_bound(ienv->co) - co_get_inevit_copy_costs(ienv->co);
482 lpp_set_bound(ienv->lp, lower_bound);
483 lpp_set_time_limit(ienv->lp, lenv->time_limit);
486 static void ilp2_apply(ilp_env_t *ienv) {
487 local_env_t *lenv = ienv->env;
489 lpp_sol_state_t state;
492 /* first check if there was sth. to optimize */
493 if (lenv->first_x_var >= 0) {
495 count = lenv->last_x_var - lenv->first_x_var + 1;
496 sol = xmalloc(count * sizeof(sol[0]));
497 state = lpp_get_solution(ienv->lp, sol, lenv->first_x_var, lenv->last_x_var);
498 if (state != lpp_optimal) {
499 printf("WARNING %s: Solution state is not 'optimal': %d\n", ienv->co->name, state);
500 assert(state >= lpp_feasible && "The solution should at least be feasible!");
503 for (i=0; i<count; ++i) {
507 if (sol[i] > 1-EPSILON) { /* split variable name into components */
508 lpp_get_var_name(ienv->lp, lenv->first_x_var+i, var_name, sizeof(var_name));
510 if (sscanf(var_name, "x_%d_%d", &nodenr, &color) == 2) {
511 ir_node *irn = pmap_get(lenv->nr_2_irn, INT_TO_PTR(nodenr));
512 assert(irn && "This node number must be present in the map");
514 set_irn_col(ienv->co, irn, color);
516 assert(0 && "This should be a x-var");
522 /* TODO adapt to multiple possible ILPs */
523 copystat_add_ilp_time((int)(1000.0*lpp_get_sol_time(pi->curr_lp))); //now we have ms
524 copystat_add_ilp_vars(lpp_get_var_count(pi->curr_lp));
525 copystat_add_ilp_csts(lpp_get_cst_count(pi->curr_lp));
526 copystat_add_ilp_iter(lpp_get_iter_cnt(pi->curr_lp));
530 int co_solve_ilp2(copy_opt_t *co) {
531 lpp_sol_state_t sol_state;
535 ASSERT_OU_AVAIL(co); //See build_clique_st
541 my.nr_2_irn = pmap_create();
542 FIRM_DBG_REGISTER(my.dbg, "firm.be.coilp2");
544 ienv = new_ilp_env(co, ilp2_build, ilp2_apply, &my);
546 sol_state = ilp_go(ienv);
548 pmap_destroy(my.nr_2_irn);
551 return sol_state == lpp_optimal;
556 static INLINE void only_that_you_can_compile_without_WITH_ILP_defined(void) {
559 #endif /* WITH_ILP */