2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Common stuff used by all ILP formulations.
23 * @author Daniel Grund
29 #endif /* HAVE_CONFIG_H */
34 #include "bestatevent.h"
40 #include "lc_opts_enum.h"
47 static int time_limit = 60;
48 static int solve_net = 1;
49 static int solve_log = 0;
50 static unsigned dump_flags = 0;
52 static const lc_opt_enum_mask_items_t dump_items[] = {
58 static lc_opt_enum_mask_var_t dump_var = {
59 &dump_flags, dump_items
62 static const lc_opt_table_entry_t options[] = {
63 LC_OPT_ENT_INT ("limit", "time limit for solving in seconds (0 for unlimited)", &time_limit),
64 LC_OPT_ENT_BOOL ("net", "solve over the net", &solve_net),
65 LC_OPT_ENT_BOOL ("log", "show ilp solving log", &solve_log),
66 LC_OPT_ENT_ENUM_MASK("dump", "dump flags", &dump_var),
70 void be_init_copyilp(void)
72 lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
73 lc_opt_entry_t *ra_grp = lc_opt_get_grp(be_grp, "ra");
74 lc_opt_entry_t *chordal_grp = lc_opt_get_grp(ra_grp, "chordal");
75 lc_opt_entry_t *co_grp = lc_opt_get_grp(chordal_grp, "co");
76 lc_opt_entry_t *ilp_grp = lc_opt_get_grp(co_grp, "ilp");
78 lc_opt_add_table(ilp_grp, options);
81 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_copyilp);
83 #include "becopyilp_t.h"
86 /******************************************************************************
89 | (___ _ _______ _ __ ___ __| |_ _ ___| |_ _ ___ _ __
90 \___ \| |_ / _ \ | '__/ _ \/ _` | | | |/ __| __| |/ _ \| '_ \
91 ____) | |/ / __/ | | | __/ (_| | |_| | (__| |_| | (_) | | | |
92 |_____/|_/___\___| |_| \___|\__,_|\__,_|\___|\__|_|\___/|_| |_|
94 *****************************************************************************/
97 size_red_t *new_size_red(copy_opt_t *co) {
98 size_red_t *res = xmalloc(sizeof(*res));
101 res->all_removed = pset_new_ptr_default();
102 res->col_suff = NULL;
103 obstack_init(&res->ob);
109 * Checks if a node is simplicial in the graph heeding the already removed nodes.
111 static INLINE int sr_is_simplicial(size_red_t *sr, const ir_node *ifn) {
113 ir_node **all, *curr;
114 be_ifg_t *ifg = sr->co->cenv->ifg;
115 void *iter = be_ifg_neighbours_iter_alloca(ifg);
117 all = alloca(be_ifg_degree(ifg, ifn) * sizeof(*all));
119 /* get all non-removed neighbors */
120 be_ifg_foreach_neighbour(ifg, iter, ifn, curr)
121 if (!sr_is_removed(sr, curr))
124 /* check if these form a clique */
125 for (i=0; i<size; ++i)
126 for (o=i+1; o<size; ++o)
127 if (!be_ifg_connected(ifg, all[i], all[o]))
130 /* all edges exist so this is a clique */
134 void sr_remove(size_red_t *sr) {
137 const be_ifg_t *ifg = sr->co->cenv->ifg;
138 void *iter = be_ifg_nodes_iter_alloca(ifg);
142 be_ifg_foreach_node(ifg, iter, irn) {
143 const arch_register_req_t *req;
145 req = arch_get_register_req(sr->co->aenv, irn, -1);
147 if (!arch_register_req_is(req, limited) && !sr_is_removed(sr, irn) && !co_gs_is_optimizable(sr->co, irn)) {
148 if (sr_is_simplicial(sr, irn)) {
149 coloring_suffix_t *cs = obstack_alloc(&sr->ob, sizeof(*cs));
152 cs->next = sr->col_suff;
155 pset_insert_ptr(sr->all_removed, irn);
164 void sr_reinsert(size_red_t *sr) {
165 coloring_suffix_t *cs;
166 be_ifg_t *ifg = sr->co->cenv->ifg;
167 bitset_t *used_cols = bitset_alloca(arch_register_class_n_regs(sr->co->cls));
168 void *iter = be_ifg_neighbours_iter_alloca(ifg);
170 /* color the removed nodes in right order */
171 for (cs = sr->col_suff; cs; cs = cs->next) {
173 ir_node *other, *irn;
175 /* get free color by inspecting all neighbors */
177 bitset_clear_all(used_cols);
179 be_ifg_foreach_neighbour(ifg, iter, irn, other) {
180 if (!sr_is_removed(sr, other)) /* only inspect nodes which are in graph right now */
181 bitset_set(used_cols, get_irn_col(sr->co, other));
184 /* now all bits not set are possible colors */
185 free_col = bitset_next_clear(used_cols, 0);
186 assert(free_col != -1 && "No free color found. This can not be.");
187 set_irn_col(sr->co, irn, free_col);
188 pset_remove_ptr(sr->all_removed, irn); /* irn is back in graph again */
192 void free_size_red(size_red_t *sr) {
193 del_pset(sr->all_removed);
194 obstack_free(&sr->ob, NULL);
198 /******************************************************************************
199 _____ _ _____ _ _____
200 / ____| (_) |_ _| | | __ \
201 | | __ ___ _ __ ___ _ __ _ ___ | | | | | |__) |
202 | | |_ |/ _ \ '_ \ / _ \ '__| |/ __| | | | | | ___/
203 | |__| | __/ | | | __/ | | | (__ _| |_| |____| |
204 \_____|\___|_| |_|\___|_| |_|\___| |_____|______|_|
206 *****************************************************************************/
210 ilp_env_t *new_ilp_env(copy_opt_t *co, ilp_callback build, ilp_callback apply, void *env) {
211 ilp_env_t *res = xmalloc(sizeof(*res));
218 res->sr = new_size_red(co);
223 lpp_sol_state_t ilp_go(ilp_env_t *ienv) {
224 be_main_env_t *main_env = ienv->co->cenv->birg->main_env;
229 lpp_set_time_limit(ienv->lp, time_limit);
232 lpp_set_log(ienv->lp, stdout);
235 lpp_solve_net(ienv->lp, main_env->options->ilp_server, main_env->options->ilp_solver);
238 fprintf(stderr, "can only solve ilp over the net\n");
240 lpp_solve_cplex(ienv->lp);
244 be_stat_ev_dbl("co_ilp_objval", ienv->lp->objval);
245 be_stat_ev_dbl("co_ilp_best_bound", ienv->lp->best_bound);
246 be_stat_ev ("co_ilp_iter", ienv->lp->iterations);
247 be_stat_ev_dbl("co_ilp_sol_time", ienv->lp->sol_time);
249 if(dump_flags & DUMP_ILP) {
253 ir_snprintf(buf, sizeof(buf), "%F_%s-co.ilp", ienv->co->cenv->irg,
254 ienv->co->cenv->cls->name);
255 f = fopen(buf, "wt");
257 panic("Couldn't open '%s' for writing", buf);
259 lpp_dump_plain(ienv->lp, f);
265 sr_reinsert(ienv->sr);
267 return lpp_get_sol_state(ienv->lp);
270 void free_ilp_env(ilp_env_t *ienv) {
271 free_size_red(ienv->sr);
278 static INLINE void only_that_you_can_compile_without_WITH_ILP_defined(void) {
281 #endif /* WITH_ILP */