2 * This file is part of libFirm.
3 * Copyright (C) 2012 University of Karlsruhe.
8 * @brief Common stuff used by all ILP formulations.
17 #include "beintlive_t.h"
29 #include "lc_opts_enum.h"
34 static int time_limit = 60;
35 static int solve_log = 0;
36 static unsigned dump_flags = 0;
38 static const lc_opt_enum_mask_items_t dump_items[] = {
44 static lc_opt_enum_mask_var_t dump_var = {
45 &dump_flags, dump_items
48 static const lc_opt_table_entry_t options[] = {
49 LC_OPT_ENT_INT ("limit", "time limit for solving in seconds (0 for unlimited)", &time_limit),
50 LC_OPT_ENT_BOOL ("log", "show ilp solving log", &solve_log),
51 LC_OPT_ENT_ENUM_MASK("dump", "dump flags", &dump_var),
55 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_copyilp)
56 void be_init_copyilp(void)
58 lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
59 lc_opt_entry_t *ra_grp = lc_opt_get_grp(be_grp, "ra");
60 lc_opt_entry_t *chordal_grp = lc_opt_get_grp(ra_grp, "chordal");
61 lc_opt_entry_t *co_grp = lc_opt_get_grp(chordal_grp, "co");
62 lc_opt_entry_t *ilp_grp = lc_opt_get_grp(co_grp, "ilp");
64 lc_opt_add_table(ilp_grp, options);
67 #include "becopyilp_t.h"
70 /******************************************************************************
73 | (___ _ _______ _ __ ___ __| |_ _ ___| |_ _ ___ _ __
74 \___ \| |_ / _ \ | '__/ _ \/ _` | | | |/ __| __| |/ _ \| '_ \
75 ____) | |/ / __/ | | | __/ (_| | |_| | (__| |_| | (_) | | | |
76 |_____/|_/___\___| |_| \___|\__,_|\__,_|\___|\__|_|\___/|_| |_|
78 *****************************************************************************/
82 * Just prepare. Do nothing yet.
84 static size_red_t *new_size_red(copy_opt_t *co)
86 size_red_t *res = XMALLOC(size_red_t);
89 res->all_removed = pset_new_ptr_default();
91 obstack_init(&res->ob);
97 * Checks if a node is simplicial in the graph heeding the already removed nodes.
99 static inline bool sr_is_simplicial(size_red_t *sr, const ir_node *ifn)
102 ir_node **all = NEW_ARR_F(ir_node*, 0);
103 be_lv_t *const lv = be_get_irg_liveness(sr->co->irg);
104 neighbours_iter_t iter;
105 be_ifg_foreach_neighbour(sr->co->cenv->ifg, &iter, ifn, curr) {
106 /* Only consider non-removed neighbours. */
107 if (sr_is_removed(sr, curr))
110 /* Check whether the current node forms a clique with all previous nodes. */
111 for (size_t i = ARR_LEN(all); i-- != 0;) {
112 if (!be_values_interfere(lv, curr, all[i])) {
118 ARR_APP1(ir_node*, all, curr);
127 * Virtually remove all nodes not related to the problem
128 * (simplicial AND not adjacent to a equal-color-edge)
130 static void sr_remove(size_red_t *const sr)
133 const be_ifg_t *ifg = sr->co->cenv->ifg;
137 be_ifg_foreach_node(ifg, irn) {
138 const arch_register_req_t *req = arch_get_irn_register_req(irn);
139 coloring_suffix_t *cs;
141 if (arch_register_req_is(req, limited) || sr_is_removed(sr, irn))
143 if (co_gs_is_optimizable(sr->co, irn))
145 if (!sr_is_simplicial(sr, irn))
148 cs = OALLOC(&sr->ob, coloring_suffix_t);
150 cs->next = sr->col_suff;
153 pset_insert_ptr(sr->all_removed, irn);
161 * Virtually reinsert the nodes removed before and color them
163 static void sr_reinsert(size_red_t *const sr)
165 coloring_suffix_t *cs;
166 ir_graph *irg = sr->co->irg;
167 be_ifg_t *ifg = sr->co->cenv->ifg;
168 unsigned n_regs = arch_register_class_n_regs(sr->co->cls);
170 unsigned *const allocatable_cols = rbitset_alloca(n_regs);
171 be_set_allocatable_regs(irg, sr->co->cls, allocatable_cols);
173 unsigned *const possible_cols = rbitset_alloca(n_regs);
174 neighbours_iter_t iter;
176 /* color the removed nodes in right order */
177 for (cs = sr->col_suff; cs; cs = cs->next) {
179 ir_node *irn = cs->irn;
181 rbitset_copy(possible_cols, allocatable_cols, n_regs);
183 /* get free color by inspecting all neighbors */
184 be_ifg_foreach_neighbour(ifg, &iter, irn, other) {
185 const arch_register_req_t *cur_req;
188 /* only inspect nodes which are in graph right now */
189 if (sr_is_removed(sr, other))
192 cur_req = arch_get_irn_register_req(other);
193 cur_col = get_irn_col(other);
195 /* Invalidate all single size register when it is a large one */
197 rbitset_clear(possible_cols, cur_col);
199 } while ((cur_col % cur_req->width) != 0);
202 /* now all bits not set are possible colors */
203 /* take one that matches the alignment constraint */
205 assert(!rbitset_is_empty(possible_cols, n_regs) && "No free color found. This can not be.");
207 free_col = (unsigned)rbitset_next(possible_cols, free_col, true);
208 if (free_col % arch_get_irn_register_req(irn)->width == 0)
211 assert(free_col < n_regs);
213 set_irn_col(sr->co->cls, irn, free_col);
214 pset_remove_ptr(sr->all_removed, irn); /* irn is back in graph again */
221 static void free_size_red(size_red_t *const sr)
223 del_pset(sr->all_removed);
224 obstack_free(&sr->ob, NULL);
228 /******************************************************************************
229 _____ _ _____ _ _____
230 / ____| (_) |_ _| | | __ \
231 | | __ ___ _ __ ___ _ __ _ ___ | | | | | |__) |
232 | | |_ |/ _ \ '_ \ / _ \ '__| |/ __| | | | | | ___/
233 | |__| | __/ | | | __/ | | | (__ _| |_| |____| |
234 \_____|\___|_| |_|\___|_| |_|\___| |_____|______|_|
236 *****************************************************************************/
240 ilp_env_t *new_ilp_env(copy_opt_t *co, ilp_callback build, ilp_callback apply, void *env)
242 ilp_env_t *res = XMALLOC(ilp_env_t);
248 res->sr = new_size_red(co);
253 lpp_sol_state_t ilp_go(ilp_env_t *ienv)
255 ir_graph *irg = ienv->co->irg;
261 if (dump_flags & DUMP_ILP) {
265 ir_snprintf(buf, sizeof(buf), "%F_%s-co.ilp", irg,
266 ienv->co->cenv->cls->name);
267 f = fopen(buf, "wt");
269 panic("Couldn't open '%s' for writing", buf);
271 lpp_dump_plain(ienv->lp, f);
275 lpp_set_time_limit(ienv->lp, time_limit);
277 lpp_set_log(ienv->lp, stdout);
279 lpp_solve(ienv->lp, be_options.ilp_server, be_options.ilp_solver);
281 //stat_ev_dbl("co_ilp_objval", ienv->lp->objval);
282 //stat_ev_dbl("co_ilp_best_bound", ienv->lp->best_bound);
283 stat_ev_int("co_ilp_iter", lpp_get_iter_cnt(ienv->lp));
284 stat_ev_dbl("co_ilp_sol_time", lpp_get_sol_time(ienv->lp));
288 sr_reinsert(ienv->sr);
290 return lpp_get_sol_state(ienv->lp);
293 void free_ilp_env(ilp_env_t *ienv)
295 free_size_red(ienv->sr);