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 * Checks if a node is simplicial in the graph heeding the already removed nodes.
84 static inline bool sr_is_simplicial(ilp_env_t *const ienv, ir_node const *const ifn)
87 ir_node **all = NEW_ARR_F(ir_node*, 0);
88 be_lv_t *const lv = be_get_irg_liveness(ienv->co->irg);
89 neighbours_iter_t iter;
90 be_ifg_foreach_neighbour(ienv->co->cenv->ifg, &iter, ifn, curr) {
91 /* Only consider non-removed neighbours. */
92 if (sr_is_removed(ienv, curr))
95 /* Check whether the current node forms a clique with all previous nodes. */
96 for (size_t i = ARR_LEN(all); i-- != 0;) {
97 if (!be_values_interfere(lv, curr, all[i])) {
103 ARR_APP1(ir_node*, all, curr);
112 * Virtually remove all nodes not related to the problem
113 * (simplicial AND not adjacent to a equal-color-edge)
115 static void sr_remove(ilp_env_t *const ienv)
118 const be_ifg_t *ifg = ienv->co->cenv->ifg;
122 be_ifg_foreach_node(ifg, irn) {
123 const arch_register_req_t *req = arch_get_irn_register_req(irn);
124 if (arch_register_req_is(req, limited) || sr_is_removed(ienv, irn))
126 if (co_gs_is_optimizable(ienv->co, irn))
128 if (!sr_is_simplicial(ienv, irn))
131 ARR_APP1(ir_node*, ienv->col_suff, irn);
132 ir_nodeset_insert(&ienv->all_removed, irn);
140 * Virtually reinsert the nodes removed before and color them
142 static void sr_reinsert(ilp_env_t *const ienv)
144 ir_graph *irg = ienv->co->irg;
145 be_ifg_t *ifg = ienv->co->cenv->ifg;
146 unsigned n_regs = arch_register_class_n_regs(ienv->co->cls);
148 unsigned *const allocatable_cols = rbitset_alloca(n_regs);
149 be_set_allocatable_regs(irg, ienv->co->cls, allocatable_cols);
151 unsigned *const possible_cols = rbitset_alloca(n_regs);
152 neighbours_iter_t iter;
154 /* color the removed nodes in right order */
155 for (size_t i = ARR_LEN(ienv->col_suff); i-- != 0;) {
156 ir_node *const irn = ienv->col_suff[i];
158 rbitset_copy(possible_cols, allocatable_cols, n_regs);
160 /* get free color by inspecting all neighbors */
161 be_ifg_foreach_neighbour(ifg, &iter, irn, other) {
162 const arch_register_req_t *cur_req;
165 /* only inspect nodes which are in graph right now */
166 if (sr_is_removed(ienv, other))
169 cur_req = arch_get_irn_register_req(other);
170 cur_col = get_irn_col(other);
172 /* Invalidate all single size register when it is a large one */
174 rbitset_clear(possible_cols, cur_col);
176 } while ((cur_col % cur_req->width) != 0);
179 /* now all bits not set are possible colors */
180 /* take one that matches the alignment constraint */
182 assert(!rbitset_is_empty(possible_cols, n_regs) && "No free color found. This can not be.");
184 free_col = (unsigned)rbitset_next(possible_cols, free_col, true);
185 if (free_col % arch_get_irn_register_req(irn)->width == 0)
188 assert(free_col < n_regs);
190 set_irn_col(ienv->co->cls, irn, free_col);
191 ir_nodeset_remove(&ienv->all_removed, irn); /* irn is back in graph again */
195 /******************************************************************************
196 _____ _ _____ _ _____
197 / ____| (_) |_ _| | | __ \
198 | | __ ___ _ __ ___ _ __ _ ___ | | | | | |__) |
199 | | |_ |/ _ \ '_ \ / _ \ '__| |/ __| | | | | | ___/
200 | |__| | __/ | | | __/ | | | (__ _| |_| |____| |
201 \_____|\___|_| |_|\___|_| |_|\___| |_____|______|_|
203 *****************************************************************************/
207 ilp_env_t *new_ilp_env(copy_opt_t *co, ilp_callback build, ilp_callback apply, void *env)
209 ilp_env_t *res = XMALLOC(ilp_env_t);
215 res->col_suff = NEW_ARR_F(ir_node*, 0);
216 ir_nodeset_init(&res->all_removed);
221 lpp_sol_state_t ilp_go(ilp_env_t *ienv)
223 ir_graph *irg = ienv->co->irg;
229 if (dump_flags & DUMP_ILP) {
233 ir_snprintf(buf, sizeof(buf), "%F_%s-co.ilp", irg,
234 ienv->co->cenv->cls->name);
235 f = fopen(buf, "wt");
237 panic("Couldn't open '%s' for writing", buf);
239 lpp_dump_plain(ienv->lp, f);
243 lpp_set_time_limit(ienv->lp, time_limit);
245 lpp_set_log(ienv->lp, stdout);
247 lpp_solve(ienv->lp, be_options.ilp_server, be_options.ilp_solver);
249 //stat_ev_dbl("co_ilp_objval", ienv->lp->objval);
250 //stat_ev_dbl("co_ilp_best_bound", ienv->lp->best_bound);
251 stat_ev_int("co_ilp_iter", lpp_get_iter_cnt(ienv->lp));
252 stat_ev_dbl("co_ilp_sol_time", lpp_get_sol_time(ienv->lp));
258 return lpp_get_sol_state(ienv->lp);
261 void free_ilp_env(ilp_env_t *ienv)
263 ir_nodeset_destroy(&ienv->all_removed);
264 DEL_ARR_F(ienv->col_suff);