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  *
   7  * Common stuff used by all ILP fomulations.
   8  *
   9  */
  10
  11 #include "becopyilp_t.h"
  12 #include "beifg_t.h"
  13
  14 /******************************************************************************
  15     _____ _                        _            _   _
  16    / ____(_)                      | |          | | (_)
  17   | (___  _ _______   _ __ ___  __| |_   _  ___| |_ _  ___  _ __
  18    \___ \| |_  / _ \ | '__/ _ \/ _` | | | |/ __| __| |/ _ \| '_ \
  19    ____) | |/ /  __/ | | |  __/ (_| | |_| | (__| |_| | (_) | | | |
  20   |_____/|_/___\___| |_|  \___|\__,_|\__,_|\___|\__|_|\___/|_| |_|
  21
  22  *****************************************************************************/
  23
  24
  25 size_red_t *new_size_red(copy_opt_t *co) {
  26         size_red_t *res = malloc(sizeof(*res));
  27
  28         res->co = co;
  29         res->all_removed = pset_new_ptr_default();
  30         res->col_suff = NULL;
  31         obstack_init(&res->ob);
  32
  33         return res;
  34 }
  35
  36 /**
  37  * Checks if a node is simplicial in the graph heeding the already removed nodes.
  38  */
  39 static INLINE int sr_is_simplicial(size_red_t *sr, const ir_node *ifn) {
  40         int i, o, size = 0;
  41         ir_node **all, *curr;
  42         be_ifg_t *ifg = sr->co->cenv->ifg;
  43         void *iter = be_ifg_neighbours_iter_alloca(ifg);
  44
  45         all = alloca(be_ifg_degree(ifg, ifn) * sizeof(*all));
  46
  47         /* get all non-removed neighbors */
  48         be_ifg_foreach_neighbour(ifg, iter, ifn, curr)
  49                 if (!sr_is_removed(sr, curr))
  50                         all[size++] = curr;
  51
  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]))
  56                                 return 0;
  57
  58         /* all edges exist so this is a clique */
  59         return 1;
  60 }
  61
  62 void sr_remove(size_red_t *sr) {
  63         ir_node *irn;
  64         int redo = 1;
  65         int n_nodes = 0;
  66         const be_ifg_t *ifg = sr->co->cenv->ifg;
  67         void *iter = be_ifg_neighbours_iter_alloca(ifg);
  68
  69         while (redo) {
  70                 arch_register_req_t req;
  71                 redo = 0;
  72                 be_ifg_foreach_node(ifg, iter, irn) {
  73                         if (!sr_is_removed(sr, irn) && !co_is_optimizable(sr->co->aenv, irn, &req) && !co_is_optimizable_arg(sr->co, irn)) {
  74                         if (sr_is_simplicial(sr, irn)) {
  75                                         coloring_suffix_t *cs = obstack_alloc(&sr->ob, sizeof(*cs));
  76
  77                                         cs->irn = irn;
  78                                         cs->next = sr->col_suff;
  79                                         sr->col_suff = cs;
  80
  81                                         pset_insert_ptr(sr->all_removed, irn);
  82
  83                                         redo = 1;
  84                         }
  85                         }
  86                 }
  87         }
  88 }
  89
  90 void sr_reinsert(size_red_t *sr) {
  91         coloring_suffix_t *cs;
  92         be_ifg_t *ifg        = sr->co->cenv->ifg;
  93         bitset_t *used_cols  = bitset_alloca(arch_register_class_n_regs(sr->co->cls));
  94         void *iter           = be_ifg_neighbours_iter_alloca(ifg);
  95
  96         /* color the removed nodes in right order */
  97         for (cs = sr->col_suff; cs; cs = cs->next) {
  98                 int free_col;
  99                 ir_node *other, *irn;
 100
 101                 /* get free color by inspecting all neighbors */
 102                 irn = cs->irn;
 103                 bitset_clear_all(used_cols);
 104
 105                 be_ifg_foreach_neighbour(ifg, iter, irn, other) {
 106                         if (!sr_is_removed(sr, other)) /* only inspect nodes which are in graph right now */
 107                                 bitset_set(used_cols, get_irn_col(sr->co, other));
 108                 }
 109
 110                 /* now all bits not set are possible colors */
 111                 free_col = bitset_next_clear(used_cols, 0);
 112                 assert(free_col != -1 && "No free color found. This can not be.");
 113                 set_irn_col(sr->co, irn, free_col);
 114                 pset_remove_ptr(sr->all_removed, irn); /* irn is back in graph again */
 115         }
 116 }
 117
 118 void free_size_red(size_red_t *sr) {
 119         del_pset(sr->all_removed);
 120         obstack_free(&sr->ob, NULL);
 121         free(sr);
 122 }
 123
 124 /******************************************************************************
 125     _____                      _        _____ _      _____
 126    / ____|                    (_)      |_   _| |    |  __ \
 127   | |  __  ___ _ __   ___ _ __ _  ___    | | | |    | |__) |
 128   | | |_ |/ _ \ '_ \ / _ \ '__| |/ __|   | | | |    |  ___/
 129   | |__| |  __/ | | |  __/ |  | | (__   _| |_| |____| |
 130    \_____|\___|_| |_|\___|_|  |_|\___| |_____|______|_|
 131
 132  *****************************************************************************/
 133
 134 ilp_env_t *new_ilp_env(copy_opt_t *co, ilp_callback build, ilp_callback apply, void *env) {
 135         ilp_env_t *res = malloc(sizeof(*res));
 136         assert(res);
 137
 138         res->co = co;
 139         res->build = build;
 140         res->apply = apply;
 141         res->env = env;
 142         res->sr = new_size_red(co);
 143
 144         return res;
 145 }
 146
 147 lpp_sol_state_t ilp_go(ilp_env_t *ienv) {
 148         sr_remove(ienv->sr);
 149
 150         ienv->build(ienv);
 151
 152 #ifdef LPP_SOLVE_NET
 153         lpp_solve_net(ienv->lp, LPP_HOST, LPP_SOLVER);
 154 #else
 155         lpp_solve_cplex(ienv->lp);
 156 #endif
 157
 158         ienv->apply(ienv);
 159
 160         sr_reinsert(ienv->sr);
 161
 162         return lpp_get_sol_state(ienv->lp);
 163 }
 164
 165 void free_ilp_env(ilp_env_t *ienv) {
 166         free_size_red(ienv->sr);
 167         free_lpp(ienv->lp);
 168         free(ienv);
 169 }