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"
27 static int time_limit = 60;
28 static int solve_net = 1;
29 static int solve_log = 0;
30 static int dump_flags = 0;
33 #include <libcore/lc_opts.h>
34 #include <libcore/lc_opts_enum.h>
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);
65 #endif /* WITH_LIBCORE */
68 #include "becopyilp_t.h"
71 /******************************************************************************
74 | (___ _ _______ _ __ ___ __| |_ _ ___| |_ _ ___ _ __
75 \___ \| |_ / _ \ | '__/ _ \/ _` | | | |/ __| __| |/ _ \| '_ \
76 ____) | |/ / __/ | | | __/ (_| | |_| | (__| |_| | (_) | | | |
77 |_____/|_/___\___| |_| \___|\__,_|\__,_|\___|\__|_|\___/|_| |_|
79 *****************************************************************************/
82 size_red_t *new_size_red(copy_opt_t *co) {
83 size_red_t *res = xmalloc(sizeof(*res));
86 res->all_removed = pset_new_ptr_default();
88 obstack_init(&res->ob);
94 * Checks if a node is simplicial in the graph heeding the already removed nodes.
96 static INLINE int sr_is_simplicial(size_red_t *sr, const ir_node *ifn) {
99 be_ifg_t *ifg = sr->co->cenv->ifg;
100 void *iter = be_ifg_neighbours_iter_alloca(ifg);
102 all = alloca(be_ifg_degree(ifg, ifn) * sizeof(*all));
104 /* get all non-removed neighbors */
105 be_ifg_foreach_neighbour(ifg, iter, ifn, curr)
106 if (!sr_is_removed(sr, curr))
108 be_ifg_neighbours_break(ifg, iter);
110 /* check if these form a clique */
111 for (i=0; i<size; ++i)
112 for (o=i+1; o<size; ++o)
113 if (!be_ifg_connected(ifg, all[i], all[o]))
116 /* all edges exist so this is a clique */
120 void sr_remove(size_red_t *sr) {
123 const be_ifg_t *ifg = sr->co->cenv->ifg;
124 void *iter = be_ifg_nodes_iter_alloca(ifg);
128 be_ifg_foreach_node(ifg, iter, irn) {
129 arch_register_req_t req;
131 arch_get_register_req(sr->co->aenv, &req, irn, -1);
133 if (!arch_register_req_is(&req, limited) && !sr_is_removed(sr, irn) && !co_gs_is_optimizable(sr->co, irn)) {
134 if (sr_is_simplicial(sr, irn)) {
135 coloring_suffix_t *cs = obstack_alloc(&sr->ob, sizeof(*cs));
138 cs->next = sr->col_suff;
141 pset_insert_ptr(sr->all_removed, irn);
147 be_ifg_nodes_break(ifg, iter);
151 void sr_reinsert(size_red_t *sr) {
152 coloring_suffix_t *cs;
153 be_ifg_t *ifg = sr->co->cenv->ifg;
154 bitset_t *used_cols = bitset_alloca(arch_register_class_n_regs(sr->co->cls));
155 void *iter = be_ifg_neighbours_iter_alloca(ifg);
157 /* color the removed nodes in right order */
158 for (cs = sr->col_suff; cs; cs = cs->next) {
160 ir_node *other, *irn;
162 /* get free color by inspecting all neighbors */
164 bitset_clear_all(used_cols);
166 be_ifg_foreach_neighbour(ifg, iter, irn, other) {
167 if (!sr_is_removed(sr, other)) /* only inspect nodes which are in graph right now */
168 bitset_set(used_cols, get_irn_col(sr->co, other));
170 be_ifg_neighbours_break(ifg, iter);
172 /* now all bits not set are possible colors */
173 free_col = bitset_next_clear(used_cols, 0);
174 assert(free_col != -1 && "No free color found. This can not be.");
175 set_irn_col(sr->co, irn, free_col);
176 pset_remove_ptr(sr->all_removed, irn); /* irn is back in graph again */
180 void free_size_red(size_red_t *sr) {
181 del_pset(sr->all_removed);
182 obstack_free(&sr->ob, NULL);
186 /******************************************************************************
187 _____ _ _____ _ _____
188 / ____| (_) |_ _| | | __ \
189 | | __ ___ _ __ ___ _ __ _ ___ | | | | | |__) |
190 | | |_ |/ _ \ '_ \ / _ \ '__| |/ __| | | | | | ___/
191 | |__| | __/ | | | __/ | | | (__ _| |_| |____| |
192 \_____|\___|_| |_|\___|_| |_|\___| |_____|______|_|
194 *****************************************************************************/
198 ilp_env_t *new_ilp_env(copy_opt_t *co, ilp_callback build, ilp_callback apply, void *env) {
199 ilp_env_t *res = xmalloc(sizeof(*res));
206 res->sr = new_size_red(co);
211 lpp_sol_state_t ilp_go(ilp_env_t *ienv) {
212 be_main_env_t *main_env = ienv->co->cenv->birg->main_env;
217 lpp_set_time_limit(ienv->lp, time_limit);
220 lpp_set_log(ienv->lp, stdout);
223 lpp_solve_net(ienv->lp, main_env->options->ilp_server, main_env->options->ilp_solver);
226 fprintf(stderr, "can only solve ilp over the net\n");
228 lpp_solve_cplex(ienv->lp);
232 be_stat_ev_dbl("co_ilp_objval", ienv->lp->objval);
233 be_stat_ev_dbl("co_ilp_best_bound", ienv->lp->best_bound);
234 be_stat_ev ("co_ilp_iter", ienv->lp->iterations);
235 be_stat_ev_dbl("co_ilp_sol_time", ienv->lp->sol_time);
237 if(dump_flags & DUMP_ILP) {
241 ir_snprintf(buf, sizeof(buf), "%F_%s-co.ilp", ienv->co->cenv->irg,
242 ienv->co->cenv->cls->name);
243 f = fopen(buf, "wt");
245 panic("Couldn't open '%s' for writing", buf);
247 lpp_dump_plain(ienv->lp, f);
253 sr_reinsert(ienv->sr);
255 return lpp_get_sol_state(ienv->lp);
258 void free_ilp_env(ilp_env_t *ienv) {
259 free_size_red(ienv->sr);
266 static INLINE void only_that_you_can_compile_without_WITH_ILP_defined(void) {
269 #endif /* WITH_ILP */