4 * Copyright: (c) Universitaet Karlsruhe
5 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
7 * Common stuff used by all ILP fomulations.
12 #endif /* HAVE_CONFIG_H */
17 #include "bestatevent.h"
22 #include <libcore/lc_opts.h>
23 #include <libcore/lc_opts_enum.h>
30 static int time_limit = 60;
31 static int solve_net = 1;
32 static int solve_log = 0;
33 static unsigned dump_flags = 0;
35 static const lc_opt_enum_mask_items_t dump_items[] = {
41 static lc_opt_enum_mask_var_t dump_var = {
42 &dump_flags, dump_items
45 static const lc_opt_table_entry_t options[] = {
46 LC_OPT_ENT_INT ("limit", "time limit for solving in seconds (0 for unlimited)", &time_limit),
47 LC_OPT_ENT_BOOL ("net", "solve over the net", &solve_net),
48 LC_OPT_ENT_BOOL ("log", "show ilp solving log", &solve_log),
49 LC_OPT_ENT_ENUM_MASK("dump", "dump flags", &dump_var),
53 void be_init_copyilp(void)
55 lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
56 lc_opt_entry_t *ra_grp = lc_opt_get_grp(be_grp, "ra");
57 lc_opt_entry_t *chordal_grp = lc_opt_get_grp(ra_grp, "chordal");
58 lc_opt_entry_t *co_grp = lc_opt_get_grp(chordal_grp, "co");
59 lc_opt_entry_t *ilp_grp = lc_opt_get_grp(co_grp, "ilp");
61 lc_opt_add_table(ilp_grp, options);
64 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_copyilp);
66 #include "becopyilp_t.h"
69 /******************************************************************************
72 | (___ _ _______ _ __ ___ __| |_ _ ___| |_ _ ___ _ __
73 \___ \| |_ / _ \ | '__/ _ \/ _` | | | |/ __| __| |/ _ \| '_ \
74 ____) | |/ / __/ | | | __/ (_| | |_| | (__| |_| | (_) | | | |
75 |_____/|_/___\___| |_| \___|\__,_|\__,_|\___|\__|_|\___/|_| |_|
77 *****************************************************************************/
80 size_red_t *new_size_red(copy_opt_t *co) {
81 size_red_t *res = xmalloc(sizeof(*res));
84 res->all_removed = pset_new_ptr_default();
86 obstack_init(&res->ob);
92 * Checks if a node is simplicial in the graph heeding the already removed nodes.
94 static INLINE int sr_is_simplicial(size_red_t *sr, const ir_node *ifn) {
97 be_ifg_t *ifg = sr->co->cenv->ifg;
98 void *iter = be_ifg_neighbours_iter_alloca(ifg);
100 all = alloca(be_ifg_degree(ifg, ifn) * sizeof(*all));
102 /* get all non-removed neighbors */
103 be_ifg_foreach_neighbour(ifg, iter, ifn, curr)
104 if (!sr_is_removed(sr, curr))
106 be_ifg_neighbours_break(ifg, iter);
108 /* check if these form a clique */
109 for (i=0; i<size; ++i)
110 for (o=i+1; o<size; ++o)
111 if (!be_ifg_connected(ifg, all[i], all[o]))
114 /* all edges exist so this is a clique */
118 void sr_remove(size_red_t *sr) {
121 const be_ifg_t *ifg = sr->co->cenv->ifg;
122 void *iter = be_ifg_nodes_iter_alloca(ifg);
126 be_ifg_foreach_node(ifg, iter, irn) {
127 const arch_register_req_t *req;
129 req = arch_get_register_req(sr->co->aenv, irn, -1);
131 if (!arch_register_req_is(req, limited) && !sr_is_removed(sr, irn) && !co_gs_is_optimizable(sr->co, irn)) {
132 if (sr_is_simplicial(sr, irn)) {
133 coloring_suffix_t *cs = obstack_alloc(&sr->ob, sizeof(*cs));
136 cs->next = sr->col_suff;
139 pset_insert_ptr(sr->all_removed, irn);
145 be_ifg_nodes_break(ifg, iter);
149 void sr_reinsert(size_red_t *sr) {
150 coloring_suffix_t *cs;
151 be_ifg_t *ifg = sr->co->cenv->ifg;
152 bitset_t *used_cols = bitset_alloca(arch_register_class_n_regs(sr->co->cls));
153 void *iter = be_ifg_neighbours_iter_alloca(ifg);
155 /* color the removed nodes in right order */
156 for (cs = sr->col_suff; cs; cs = cs->next) {
158 ir_node *other, *irn;
160 /* get free color by inspecting all neighbors */
162 bitset_clear_all(used_cols);
164 be_ifg_foreach_neighbour(ifg, iter, irn, other) {
165 if (!sr_is_removed(sr, other)) /* only inspect nodes which are in graph right now */
166 bitset_set(used_cols, get_irn_col(sr->co, other));
168 be_ifg_neighbours_break(ifg, iter);
170 /* now all bits not set are possible colors */
171 free_col = bitset_next_clear(used_cols, 0);
172 assert(free_col != -1 && "No free color found. This can not be.");
173 set_irn_col(sr->co, irn, free_col);
174 pset_remove_ptr(sr->all_removed, irn); /* irn is back in graph again */
178 void free_size_red(size_red_t *sr) {
179 del_pset(sr->all_removed);
180 obstack_free(&sr->ob, NULL);
184 /******************************************************************************
185 _____ _ _____ _ _____
186 / ____| (_) |_ _| | | __ \
187 | | __ ___ _ __ ___ _ __ _ ___ | | | | | |__) |
188 | | |_ |/ _ \ '_ \ / _ \ '__| |/ __| | | | | | ___/
189 | |__| | __/ | | | __/ | | | (__ _| |_| |____| |
190 \_____|\___|_| |_|\___|_| |_|\___| |_____|______|_|
192 *****************************************************************************/
196 ilp_env_t *new_ilp_env(copy_opt_t *co, ilp_callback build, ilp_callback apply, void *env) {
197 ilp_env_t *res = xmalloc(sizeof(*res));
204 res->sr = new_size_red(co);
209 lpp_sol_state_t ilp_go(ilp_env_t *ienv) {
210 be_main_env_t *main_env = ienv->co->cenv->birg->main_env;
215 lpp_set_time_limit(ienv->lp, time_limit);
218 lpp_set_log(ienv->lp, stdout);
221 lpp_solve_net(ienv->lp, main_env->options->ilp_server, main_env->options->ilp_solver);
224 fprintf(stderr, "can only solve ilp over the net\n");
226 lpp_solve_cplex(ienv->lp);
230 be_stat_ev_dbl("co_ilp_objval", ienv->lp->objval);
231 be_stat_ev_dbl("co_ilp_best_bound", ienv->lp->best_bound);
232 be_stat_ev ("co_ilp_iter", ienv->lp->iterations);
233 be_stat_ev_dbl("co_ilp_sol_time", ienv->lp->sol_time);
235 if(dump_flags & DUMP_ILP) {
239 ir_snprintf(buf, sizeof(buf), "%F_%s-co.ilp", ienv->co->cenv->irg,
240 ienv->co->cenv->cls->name);
241 f = fopen(buf, "wt");
243 panic("Couldn't open '%s' for writing", buf);
245 lpp_dump_plain(ienv->lp, f);
251 sr_reinsert(ienv->sr);
253 return lpp_get_sol_state(ienv->lp);
256 void free_ilp_env(ilp_env_t *ienv) {
257 free_size_red(ienv->sr);
264 static INLINE void only_that_you_can_compile_without_WITH_ILP_defined(void) {
267 #endif /* WITH_ILP */