4 * Copyright: (c) Universitaet Karlsruhe
5 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
7 * Common stuff used by all ILP fomulations.
13 #endif /* HAVE_CONFIG_H */
20 static int time_limit = 60;
21 static int solve_net = 1;
22 static int solve_log = 0;
23 static int dump_flags = 0;
26 #include <libcore/lc_opts.h>
27 #include <libcore/lc_opts_enum.h>
28 static const lc_opt_enum_mask_items_t dump_items[] = {
34 static lc_opt_enum_mask_var_t dump_var = {
35 &dump_flags, dump_items
38 static const lc_opt_table_entry_t options[] = {
39 LC_OPT_ENT_INT ("limit", "time limit for solving in seconds (0 for unlimited, default 60)", &time_limit),
40 LC_OPT_ENT_BOOL ("net", "solve over the net (default: yes)", &solve_net),
41 LC_OPT_ENT_BOOL ("log", "show ilp solving log", &solve_log),
42 LC_OPT_ENT_ENUM_MASK("dump", "dump flags (ilp, sol)", &dump_var),
46 void be_co_ilp_register_options(lc_opt_entry_t *grp)
48 lc_opt_entry_t *ilp_grp = lc_opt_get_grp(grp, "ilp");
49 lc_opt_add_table(ilp_grp, options);
54 #include "becopyilp_t.h"
57 /******************************************************************************
60 | (___ _ _______ _ __ ___ __| |_ _ ___| |_ _ ___ _ __
61 \___ \| |_ / _ \ | '__/ _ \/ _` | | | |/ __| __| |/ _ \| '_ \
62 ____) | |/ / __/ | | | __/ (_| | |_| | (__| |_| | (_) | | | |
63 |_____/|_/___\___| |_| \___|\__,_|\__,_|\___|\__|_|\___/|_| |_|
65 *****************************************************************************/
68 size_red_t *new_size_red(copy_opt_t *co) {
69 size_red_t *res = xmalloc(sizeof(*res));
72 res->all_removed = pset_new_ptr_default();
74 obstack_init(&res->ob);
80 * Checks if a node is simplicial in the graph heeding the already removed nodes.
82 static INLINE int sr_is_simplicial(size_red_t *sr, const ir_node *ifn) {
85 be_ifg_t *ifg = sr->co->cenv->ifg;
86 void *iter = be_ifg_neighbours_iter_alloca(ifg);
88 all = alloca(be_ifg_degree(ifg, ifn) * sizeof(*all));
90 /* get all non-removed neighbors */
91 be_ifg_foreach_neighbour(ifg, iter, ifn, curr)
92 if (!sr_is_removed(sr, curr))
94 be_ifg_neighbours_break(ifg, iter);
96 /* check if these form a clique */
97 for (i=0; i<size; ++i)
98 for (o=i+1; o<size; ++o)
99 if (!be_ifg_connected(ifg, all[i], all[o]))
102 /* all edges exist so this is a clique */
106 void sr_remove(size_red_t *sr) {
109 const be_ifg_t *ifg = sr->co->cenv->ifg;
110 void *iter = be_ifg_nodes_iter_alloca(ifg);
114 be_ifg_foreach_node(ifg, iter, irn) {
115 arch_register_req_t req;
117 arch_get_register_req(sr->co->aenv, &req, irn, -1);
119 if (!arch_register_req_is(&req, limited) && !sr_is_removed(sr, irn) && !co_gs_is_optimizable(sr->co, irn)) {
120 if (sr_is_simplicial(sr, irn)) {
121 coloring_suffix_t *cs = obstack_alloc(&sr->ob, sizeof(*cs));
124 cs->next = sr->col_suff;
127 pset_insert_ptr(sr->all_removed, irn);
133 be_ifg_nodes_break(ifg, iter);
137 void sr_reinsert(size_red_t *sr) {
138 coloring_suffix_t *cs;
139 be_ifg_t *ifg = sr->co->cenv->ifg;
140 bitset_t *used_cols = bitset_alloca(arch_register_class_n_regs(sr->co->cls));
141 void *iter = be_ifg_neighbours_iter_alloca(ifg);
143 /* color the removed nodes in right order */
144 for (cs = sr->col_suff; cs; cs = cs->next) {
146 ir_node *other, *irn;
148 /* get free color by inspecting all neighbors */
150 bitset_clear_all(used_cols);
152 be_ifg_foreach_neighbour(ifg, iter, irn, other) {
153 if (!sr_is_removed(sr, other)) /* only inspect nodes which are in graph right now */
154 bitset_set(used_cols, get_irn_col(sr->co, other));
156 be_ifg_neighbours_break(ifg, iter);
158 /* now all bits not set are possible colors */
159 free_col = bitset_next_clear(used_cols, 0);
160 assert(free_col != -1 && "No free color found. This can not be.");
161 set_irn_col(sr->co, irn, free_col);
162 pset_remove_ptr(sr->all_removed, irn); /* irn is back in graph again */
166 void free_size_red(size_red_t *sr) {
167 del_pset(sr->all_removed);
168 obstack_free(&sr->ob, NULL);
172 /******************************************************************************
173 _____ _ _____ _ _____
174 / ____| (_) |_ _| | | __ \
175 | | __ ___ _ __ ___ _ __ _ ___ | | | | | |__) |
176 | | |_ |/ _ \ '_ \ / _ \ '__| |/ __| | | | | | ___/
177 | |__| | __/ | | | __/ | | | (__ _| |_| |____| |
178 \_____|\___|_| |_|\___|_| |_|\___| |_____|______|_|
180 *****************************************************************************/
184 ilp_env_t *new_ilp_env(copy_opt_t *co, ilp_callback build, ilp_callback apply, void *env) {
185 ilp_env_t *res = xmalloc(sizeof(*res));
192 res->sr = new_size_red(co);
197 lpp_sol_state_t ilp_go(ilp_env_t *ienv) {
198 be_main_env_t *main_env = ienv->co->cenv->birg->main_env;
203 lpp_set_time_limit(ienv->lp, time_limit);
206 lpp_set_log(ienv->lp, stdout);
209 lpp_solve_net(ienv->lp, main_env->options->ilp_server, main_env->options->ilp_solver);
212 fprintf(stderr, "can only solve ilp over the net\n");
214 lpp_solve_cplex(ienv->lp);
218 if(dump_flags & DUMP_ILP) {
219 FILE *f = be_chordal_open(ienv->co->cenv, "", "-co.ilp");
220 lpp_dump_plain(ienv->lp, f);
226 sr_reinsert(ienv->sr);
228 return lpp_get_sol_state(ienv->lp);
231 void free_ilp_env(ilp_env_t *ienv) {
232 free_size_red(ienv->sr);
239 static INLINE void only_that_you_can_compile_without_WITH_ILP_defined(void) {
242 #endif /* WITH_ILP */