nsz Git - libfirm/blob - ir/be/becopyilp.c

   1 /**
   2  * Author:      Daniel Grund
   3  * Date:                28.02.2006
   4  * Copyright:   (c) Universitaet Karlsruhe
   5  * Licence:     This file protected by GPL -  GNU GENERAL PUBLIC LICENSE.
   6  * $Id$
   7  *
   8  * Common stuff used by all ILP fomulations.
   9  *
  10  */
  11
  12 #ifdef HAVE_CONFIG_H
  13 #include "config.h"
  14 #endif
  15
  16 #ifdef WITH_ILP
  17
  18 #include "becopyilp_t.h"
  19 #include "beifg_t.h"
  20
  21 /******************************************************************************
  22     _____ _                        _            _   _
  23    / ____(_)                      | |          | | (_)
  24   | (___  _ _______   _ __ ___  __| |_   _  ___| |_ _  ___  _ __
  25    \___ \| |_  / _ \ | '__/ _ \/ _` | | | |/ __| __| |/ _ \| '_ \
  26    ____) | |/ /  __/ | | |  __/ (_| | |_| | (__| |_| | (_) | | | |
  27   |_____/|_/___\___| |_|  \___|\__,_|\__,_|\___|\__|_|\___/|_| |_|
  28
  29  *****************************************************************************/
  30
  31
  32 size_red_t *new_size_red(copy_opt_t *co) {
  33         size_red_t *res = malloc(sizeof(*res));
  34
  35         res->co = co;
  36         res->all_removed = pset_new_ptr_default();
  37         res->col_suff = NULL;
  38         obstack_init(&res->ob);
  39
  40         return res;
  41 }
  42
  43 /**
  44  * Checks if a node is simplicial in the graph heeding the already removed nodes.
  45  */
  46 static INLINE int sr_is_simplicial(size_red_t *sr, const ir_node *ifn) {
  47         int i, o, size = 0;
  48         ir_node **all, *curr;
  49         be_ifg_t *ifg = sr->co->cenv->ifg;
  50         void *iter = be_ifg_neighbours_iter_alloca(ifg);
  51
  52         all = alloca(be_ifg_degree(ifg, ifn) * sizeof(*all));
  53
  54         /* get all non-removed neighbors */
  55         be_ifg_foreach_neighbour(ifg, iter, ifn, curr)
  56                 if (!sr_is_removed(sr, curr))
  57                         all[size++] = curr;
  58
  59         /* check if these form a clique */
  60         for (i=0; i<size; ++i)
  61                 for (o=i+1; o<size; ++o)
  62                         if (!be_ifg_connected(ifg, all[i], all[o]))
  63                                 return 0;
  64
  65         /* all edges exist so this is a clique */
  66         return 1;
  67 }
  68
  69 void sr_remove(size_red_t *sr) {
  70         ir_node *irn;
  71         int redo = 1;
  72         int n_nodes = 0;
  73         const be_ifg_t *ifg = sr->co->cenv->ifg;
  74         void *iter = be_ifg_neighbours_iter_alloca(ifg);
  75
  76         while (redo) {
  77                 redo = 0;
  78                 be_ifg_foreach_node(ifg, iter, irn) {
  79                         if (!sr_is_removed(sr, irn) && !co_is_optimizable_root(sr->co, irn) && !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));
  82
  83                                         cs->irn = irn;
  84                                         cs->next = sr->col_suff;
  85                                         sr->col_suff = cs;
  86
  87                                         pset_insert_ptr(sr->all_removed, irn);
  88
  89                                         redo = 1;
  90                         }
  91                         }
  92                 }
  93         }
  94 }
  95
  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);
 101
 102         /* color the removed nodes in right order */
 103         for (cs = sr->col_suff; cs; cs = cs->next) {
 104                 int free_col;
 105                 ir_node *other, *irn;
 106
 107                 /* get free color by inspecting all neighbors */
 108                 irn = cs->irn;
 109                 bitset_clear_all(used_cols);
 110
 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));
 114                 }
 115
 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 */
 121         }
 122 }
 123
 124 void free_size_red(size_red_t *sr) {
 125         del_pset(sr->all_removed);
 126         obstack_free(&sr->ob, NULL);
 127         free(sr);
 128 }
 129
 130 /******************************************************************************
 131     _____                      _        _____ _      _____
 132    / ____|                    (_)      |_   _| |    |  __ \
 133   | |  __  ___ _ __   ___ _ __ _  ___    | | | |    | |__) |
 134   | | |_ |/ _ \ '_ \ / _ \ '__| |/ __|   | | | |    |  ___/
 135   | |__| |  __/ | | |  __/ |  | | (__   _| |_| |____| |
 136    \_____|\___|_| |_|\___|_|  |_|\___| |_____|______|_|
 137
 138  *****************************************************************************/
 139
 140 ilp_env_t *new_ilp_env(copy_opt_t *co, ilp_callback build, ilp_callback apply, void *env) {
 141         ilp_env_t *res = malloc(sizeof(*res));
 142         assert(res);
 143
 144         res->co = co;
 145         res->build = build;
 146         res->apply = apply;
 147         res->env = env;
 148         res->sr = new_size_red(co);
 149
 150         return res;
 151 }
 152
 153 lpp_sol_state_t ilp_go(ilp_env_t *ienv) {
 154         sr_remove(ienv->sr);
 155
 156         ienv->build(ienv);
 157
 158 #ifdef LPP_SOLVE_NET
 159         lpp_solve_net(ienv->lp, LPP_HOST, LPP_SOLVER);
 160 #else
 161         lpp_solve_cplex(ienv->lp);
 162 #endif
 163
 164         ienv->apply(ienv);
 165
 166         sr_reinsert(ienv->sr);
 167
 168         return lpp_get_sol_state(ienv->lp);
 169 }
 170
 171 void free_ilp_env(ilp_env_t *ienv) {
 172         free_size_red(ienv->sr);
 173         free_lpp(ienv->lp);
 174         free(ienv);
 175 }
 176
 177 #else /* WITH_ILP */
 178
 179 static void only_that_you_can_compile_without_WITH_ILP_defined(void) {
 180 }
 181
 182 #endif /* WITH_ILP */