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 */
17 #include "becopyilp_t.h"
20 /******************************************************************************
23 | (___ _ _______ _ __ ___ __| |_ _ ___| |_ _ ___ _ __
24 \___ \| |_ / _ \ | '__/ _ \/ _` | | | |/ __| __| |/ _ \| '_ \
25 ____) | |/ / __/ | | | __/ (_| | |_| | (__| |_| | (_) | | | |
26 |_____/|_/___\___| |_| \___|\__,_|\__,_|\___|\__|_|\___/|_| |_|
28 *****************************************************************************/
31 size_red_t *new_size_red(copy_opt_t *co) {
32 size_red_t *res = malloc(sizeof(*res));
35 res->all_removed = pset_new_ptr_default();
37 obstack_init(&res->ob);
43 * Checks if a node is simplicial in the graph heeding the already removed nodes.
45 static INLINE int sr_is_simplicial(size_red_t *sr, const ir_node *ifn) {
48 be_ifg_t *ifg = sr->co->cenv->ifg;
49 void *iter = be_ifg_neighbours_iter_alloca(ifg);
51 all = alloca(be_ifg_degree(ifg, ifn) * sizeof(*all));
53 /* get all non-removed neighbors */
54 be_ifg_foreach_neighbour(ifg, iter, ifn, curr)
55 if (!sr_is_removed(sr, curr))
58 /* check if these form a clique */
59 for (i=0; i<size; ++i)
60 for (o=i+1; o<size; ++o)
61 if (!be_ifg_connected(ifg, all[i], all[o]))
64 /* all edges exist so this is a clique */
68 void sr_remove(size_red_t *sr) {
72 const be_ifg_t *ifg = sr->co->cenv->ifg;
73 void *iter = be_ifg_neighbours_iter_alloca(ifg);
76 arch_register_req_t req;
78 be_ifg_foreach_node(ifg, iter, irn) {
79 if (!sr_is_removed(sr, irn) && !co_is_optimizable(sr->co->aenv, irn, &req) && !co_is_optimizable_arg(sr->co, irn)) {
80 if (sr_is_simplicial(sr, irn)) {
81 coloring_suffix_t *cs = obstack_alloc(&sr->ob, sizeof(*cs));
84 cs->next = sr->col_suff;
87 pset_insert_ptr(sr->all_removed, irn);
96 void sr_reinsert(size_red_t *sr) {
97 coloring_suffix_t *cs;
98 be_ifg_t *ifg = sr->co->cenv->ifg;
99 bitset_t *used_cols = bitset_alloca(arch_register_class_n_regs(sr->co->cls));
100 void *iter = be_ifg_neighbours_iter_alloca(ifg);
102 /* color the removed nodes in right order */
103 for (cs = sr->col_suff; cs; cs = cs->next) {
105 ir_node *other, *irn;
107 /* get free color by inspecting all neighbors */
109 bitset_clear_all(used_cols);
111 be_ifg_foreach_neighbour(ifg, iter, irn, other) {
112 if (!sr_is_removed(sr, other)) /* only inspect nodes which are in graph right now */
113 bitset_set(used_cols, get_irn_col(sr->co, other));
116 /* now all bits not set are possible colors */
117 free_col = bitset_next_clear(used_cols, 0);
118 assert(free_col != -1 && "No free color found. This can not be.");
119 set_irn_col(sr->co, irn, free_col);
120 pset_remove_ptr(sr->all_removed, irn); /* irn is back in graph again */
124 void free_size_red(size_red_t *sr) {
125 del_pset(sr->all_removed);
126 obstack_free(&sr->ob, NULL);
130 /******************************************************************************
131 _____ _ _____ _ _____
132 / ____| (_) |_ _| | | __ \
133 | | __ ___ _ __ ___ _ __ _ ___ | | | | | |__) |
134 | | |_ |/ _ \ '_ \ / _ \ '__| |/ __| | | | | | ___/
135 | |__| | __/ | | | __/ | | | (__ _| |_| |____| |
136 \_____|\___|_| |_|\___|_| |_|\___| |_____|______|_|
138 *****************************************************************************/
140 ilp_env_t *new_ilp_env(copy_opt_t *co, firm_dbg_module_t *dbg, ilp_callback build, ilp_callback apply, void *env) {
141 ilp_env_t *res = malloc(sizeof(*res));
149 res->sr = new_size_red(co);
154 lpp_sol_state_t ilp_go(ilp_env_t *ienv, double time_limit) {
159 lpp_set_time_limit(ienv->lp, time_limit);
162 lpp_solve_net(ienv->lp, LPP_HOST, LPP_SOLVER);
164 lpp_solve_cplex(ienv->lp);
169 sr_reinsert(ienv->sr);
171 return lpp_get_sol_state(ienv->lp);
174 void free_ilp_env(ilp_env_t *ienv) {
175 free_size_red(ienv->sr);
182 static void only_that_you_can_compile_without_WITH_ILP_defined(void) {
185 #endif /* WITH_ILP */