4 * Copyright: (c) Universitaet Karlsruhe
5 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
7 * Common stuff used by all ILP fomulations.
11 #include "becopyilp_t.h"
14 /******************************************************************************
17 | (___ _ _______ _ __ ___ __| |_ _ ___| |_ _ ___ _ __
18 \___ \| |_ / _ \ | '__/ _ \/ _` | | | |/ __| __| |/ _ \| '_ \
19 ____) | |/ / __/ | | | __/ (_| | |_| | (__| |_| | (_) | | | |
20 |_____/|_/___\___| |_| \___|\__,_|\__,_|\___|\__|_|\___/|_| |_|
22 *****************************************************************************/
25 size_red_t *new_size_red(copy_opt_t *co) {
26 size_red_t *res = malloc(sizeof(*res));
29 res->all_removed = pset_new_ptr_default();
31 obstack_init(&res->ob);
37 * Checks if a node is simplicial in the graph heeding the already removed nodes.
39 static INLINE int sr_is_simplicial(size_red_t *sr, const ir_node *ifn) {
42 be_ifg_t *ifg = sr->co->cenv->ifg;
43 void *iter = be_ifg_neighbours_iter_alloca(ifg);
45 all = alloca(be_ifg_degree(ifg, ifn) * sizeof(*all));
47 /* get all non-removed neighbors */
48 be_ifg_foreach_neighbour(ifg, iter, ifn, curr)
49 if (!sr_is_removed(sr, curr))
52 /* check if these form a clique */
53 for (i=0; i<size; ++i)
54 for (o=i+1; o<size; ++o)
55 if (!be_ifg_connected(ifg, all[i], all[o]))
58 /* all edges exist so this is a clique */
62 void sr_remove(size_red_t *sr) {
66 const be_ifg_t *ifg = sr->co->cenv->ifg;
67 void *iter = be_ifg_neighbours_iter_alloca(ifg);
71 be_ifg_foreach_node(ifg, iter, irn) {
72 if (!sr_is_removed(sr, irn) && !co_is_optimizable_root(sr->co, irn) && !co_is_optimizable_arg(sr->co, irn)) {
73 if (sr_is_simplicial(sr, irn)) {
74 coloring_suffix_t *cs = obstack_alloc(&sr->ob, sizeof(*cs));
77 cs->next = sr->col_suff;
80 pset_insert_ptr(sr->all_removed, irn);
89 void sr_reinsert(size_red_t *sr) {
90 coloring_suffix_t *cs;
91 be_ifg_t *ifg = sr->co->cenv->ifg;
92 bitset_t *used_cols = bitset_alloca(arch_register_class_n_regs(sr->co->cls));
93 void *iter = be_ifg_neighbours_iter_alloca(ifg);
95 /* color the removed nodes in right order */
96 for (cs = sr->col_suff; cs; cs = cs->next) {
100 /* get free color by inspecting all neighbors */
102 bitset_clear_all(used_cols);
104 be_ifg_foreach_neighbour(ifg, iter, irn, other) {
105 if (!sr_is_removed(sr, other)) /* only inspect nodes which are in graph right now */
106 bitset_set(used_cols, get_irn_col(sr->co, other));
109 /* now all bits not set are possible colors */
110 free_col = bitset_next_clear(used_cols, 0);
111 assert(free_col != -1 && "No free color found. This can not be.");
112 set_irn_col(sr->co, irn, free_col);
113 pset_remove_ptr(sr->all_removed, irn); /* irn is back in graph again */
117 void free_size_red(size_red_t *sr) {
118 del_pset(sr->all_removed);
119 obstack_free(&sr->ob, NULL);
123 /******************************************************************************
124 _____ _ _____ _ _____
125 / ____| (_) |_ _| | | __ \
126 | | __ ___ _ __ ___ _ __ _ ___ | | | | | |__) |
127 | | |_ |/ _ \ '_ \ / _ \ '__| |/ __| | | | | | ___/
128 | |__| | __/ | | | __/ | | | (__ _| |_| |____| |
129 \_____|\___|_| |_|\___|_| |_|\___| |_____|______|_|
131 *****************************************************************************/
133 ilp_env_t *new_ilp_env(copy_opt_t *co, ilp_callback build, ilp_callback apply, void *env) {
134 ilp_env_t *res = malloc(sizeof(*res));
141 res->sr = new_size_red(co);
146 lpp_sol_state_t ilp_go(ilp_env_t *ienv) {
152 lpp_solve_net(ienv->lp, LPP_HOST, LPP_SOLVER);
154 lpp_solve_cplex(ienv->lp);
159 sr_reinsert(ienv->sr);
161 return lpp_get_sol_state(ienv->lp);
164 void free_ilp_env(ilp_env_t *ienv) {
165 free_size_red(ienv->sr);