4 * Copyright: (c) Universitaet Karlsruhe
5 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
8 * ILP formalization using G=(V, E, Q):
9 * - 2 class of variables: coloring vars x_ic and equal color vars y_ij
11 * - Clique-star constraints
14 * \min \sum_{ (i,j) \in Q } w_ij y_ij
16 * \sum_c x_nc = 1 n \in N, c \in C
18 * x_nc = 0 n \in N, c \not\in C(n)
20 * \sum x_nc <= 1 x_nc \in Clique \in AllCliques, c \in C
22 * \sum_{e \in p} y_e >= 1 p \in P path constraints
24 * \sum_{e \in cs} y_e >= |cs| - 1 cs \in CP clique-star constraints
26 * x_nc, y_ij \in N, w_ij \in R^+
31 #endif /* HAVE_CONFIG_H */
37 #include "becopyilp_t.h"
39 #include "besched_t.h"
43 typedef struct _local_env_t {
44 firm_dbg_module_t *dbg;
46 int first_x_var, last_x_var;
50 static void build_coloring_cstr(ilp_env_t *ienv) {
51 be_ifg_t *ifg = ienv->co->cenv->ifg;
52 void *iter = be_ifg_nodes_iter_alloca(ifg);
57 colors = bitset_alloca(arch_register_class_n_regs(ienv->co->cls));
59 be_ifg_foreach_node(ifg, iter, irn)
60 if (!sr_is_removed(ienv->sr, irn)) {
62 arch_register_req_t req;
63 int curr_node_color = get_irn_col(ienv->co, irn);
64 int node_nr = (int)get_irn_node_nr(irn);
65 local_env_t *lenv = ienv->env;
67 pmap_insert(lenv->nr_2_irn, INT_TO_PTR(node_nr), irn);
69 arch_get_register_req(ienv->co->aenv, &req, irn, -1);
71 /* get assignable colors */
72 if (arch_register_req_is(&req, limited))
73 req.limited(req.limited_env, colors);
75 arch_put_non_ignore_regs(ienv->co->aenv, req.cls, colors);
77 /* add the coloring constraint */
78 cst_idx = lpp_add_cst(ienv->lp, NULL, lpp_equal, 1.0);
80 bitset_foreach(colors, col) {
81 int var_idx = lpp_add_var(ienv->lp, name_cdd(buf, 'x', node_nr, col), lpp_binary, 0.0);
82 lpp_set_start_value(ienv->lp, var_idx, (col == curr_node_color) ? 1.0 : 0.0);
83 lpp_set_factor_fast(ienv->lp, cst_idx, var_idx, 1);
85 lenv->last_x_var = var_idx;
86 if (lenv->first_x_var == -1)
87 lenv->first_x_var = var_idx;
90 /* add register constraint constraints */
91 bitset_foreach_clear(colors, col) {
92 int cst_idx = lpp_add_cst(ienv->lp, NULL, lpp_equal, 0.0);
93 int var_idx = lpp_add_var(ienv->lp, name_cdd(buf, 'x', node_nr, col), lpp_binary, 0.0);
94 lpp_set_start_value(ienv->lp, var_idx, 0.0);
95 lpp_set_factor_fast(ienv->lp, cst_idx, var_idx, 1);
97 lenv->last_x_var = var_idx;
102 static void build_interference_cstr(ilp_env_t *ienv) {
103 lpp_t *lpp = ienv->lp;
104 be_ifg_t *ifg = ienv->co->cenv->ifg;
105 int n_colors = arch_register_class_n_regs(ienv->co->cls);
108 void *iter = be_ifg_cliques_iter_alloca(ifg);
109 ir_node **clique = alloca(sizeof(*clique) * n_colors);
114 /* for each maximal clique */
115 be_ifg_foreach_clique(ifg, iter, clique, &size) {
121 for (col=0; col<n_colors; ++col) {
122 int cst_idx = lpp_add_cst(lpp, NULL, lpp_less, 1.0);
124 /* for each member of this clique */
125 for (i=0; i<size; ++i) {
126 ir_node *irn = clique[i];
128 if (!sr_is_removed(ienv->sr, irn)) {
129 int var_idx = lpp_get_var_idx(lpp, name_cdd(buf, 'x', (int)get_irn_node_nr(irn), col));
130 lpp_set_factor_fast(lpp, cst_idx, var_idx, 1);
137 static void build_affinity_cstr(ilp_env_t *ienv) {
139 int n_colors = arch_register_class_n_regs(ienv->co->cls);
141 /* for all optimization units */
142 list_for_each_entry(unit_t, curr, &ienv->co->units, units) {
144 int root_nr, arg_nr, i, col, y_idx, root_idx, arg_idx;
146 int root_col, arg_col;
148 root = curr->nodes[0];
149 root_nr = (int) get_irn_node_nr(root);
150 root_col = get_irn_col(ienv->co, root);
152 for (i = 1; i < curr->node_count; ++i) {
153 arg = curr->nodes[i];
154 arg_nr = (int) get_irn_node_nr(arg);
155 arg_col = get_irn_col(ienv->co, arg);
157 /* add a new affinity variable */
158 y_idx = lpp_add_var(ienv->lp, name_cdd_sorted(buf, 'y', root_nr, arg_nr), lpp_binary, curr->costs[i]);
159 lpp_set_start_value(ienv->lp, y_idx, (root_col==arg_col) ? 0.0 : 1.0);
161 /* add constraints relating the affinity var to the color vars */
162 for (col=0; col<n_colors; ++col) {
163 int cst_idx = lpp_add_cst(ienv->lp, NULL, lpp_less, 0.0);
164 root_idx = lpp_get_var_idx(ienv->lp, name_cdd(buf, 'x', root_nr, col));
165 arg_idx = lpp_get_var_idx(ienv->lp, name_cdd(buf, 'x', arg_nr, col));
167 lpp_set_factor_fast(ienv->lp, cst_idx, root_idx, 1.0);
168 lpp_set_factor_fast(ienv->lp, cst_idx, arg_idx, -1.0);
169 lpp_set_factor_fast(ienv->lp, cst_idx, root_idx, -1.0);
178 static void build_clique_star_cstr(ilp_env_t *ienv) {
185 static void build_path_cstr(ilp_env_t *ienv) {
189 static void ilp2_build(ilp_env_t *ienv) {
190 local_env_t *lenv = ienv->env;
193 ienv->lp = new_lpp(ienv->co->name, lpp_minimize);
194 build_coloring_cstr(ienv);
195 build_interference_cstr(ienv);
196 build_affinity_cstr(ienv);
197 build_clique_star_cstr(ienv);
198 build_path_cstr(ienv);
200 lower_bound = co_get_lower_bound(ienv->co) - co_get_inevit_copy_costs(ienv->co);
201 lpp_set_bound(ienv->lp, lower_bound);
202 lpp_set_time_limit(ienv->lp, lenv->time_limit);
205 static void ilp2_apply(ilp_env_t *ienv) {
206 local_env_t *lenv = ienv->env;
208 lpp_sol_state_t state;
211 count = lenv->last_x_var - lenv->first_x_var + 1;
212 sol = xmalloc(count * sizeof(sol[0]));
213 state = lpp_get_solution(ienv->lp, sol, lenv->first_x_var, lenv->last_x_var);
214 if (state != lpp_optimal) {
215 printf("WARNING %s: Solution state is not 'optimal': %d\n", ienv->co->name, state);
216 assert(state >= lpp_feasible && "The solution should at least be feasible!");
219 for (i=0; i<count; ++i) {
223 if (sol[i] > 1-EPSILON) { /* split variable name into components */
224 lpp_get_var_name(ienv->lp, lenv->first_x_var+i, var_name, sizeof(var_name));
226 if (sscanf(var_name, "x_%d_%d", &nodenr, &color) == 2) {
227 ir_node *irn = pmap_get(lenv->nr_2_irn, INT_TO_PTR(nodenr));
228 assert(irn && "This node number must be present in the map");
230 set_irn_col(ienv->co, irn, color);
232 assert(0 && "This should be a x-var");
237 /* TODO adapt to multiple possible ILPs */
238 copystat_add_ilp_time((int)(1000.0*lpp_get_sol_time(pi->curr_lp))); //now we have ms
239 copystat_add_ilp_vars(lpp_get_var_count(pi->curr_lp));
240 copystat_add_ilp_csts(lpp_get_cst_count(pi->curr_lp));
241 copystat_add_ilp_iter(lpp_get_iter_cnt(pi->curr_lp));
245 int co_solve_ilp2(copy_opt_t *co, double time_limit) {
246 lpp_sol_state_t sol_state;
250 my.time_limit = time_limit;
253 my.nr_2_irn = pmap_create();
254 my.dbg = firm_dbg_register("ir.be.coilp2");
255 firm_dbg_set_mask(my.dbg, DEBUG_LVL);
257 ienv = new_ilp_env(co, ilp2_build, ilp2_apply, &my);
259 sol_state = ilp_go(ienv);
261 pmap_destroy(my.nr_2_irn);
264 return sol_state == lpp_optimal;
269 static void only_that_you_can_compile_without_WITH_ILP_defined(void) {
272 #endif /* WITH_ILP */