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 #ifdef HAVE_CONFIG_H
  12 #include "config.h"
  13 #endif /* HAVE_CONFIG_H */
  14
  15 #ifdef WITH_ILP
  16
  17 #include "becopyilp_t.h"
  18 #include "beifg_t.h"
  19
  20 /******************************************************************************
  21     _____ _                        _            _   _
  22    / ____(_)                      | |          | | (_)
  23   | (___  _ _______   _ __ ___  __| |_   _  ___| |_ _  ___  _ __
  24    \___ \| |_  / _ \ | '__/ _ \/ _` | | | |/ __| __| |/ _ \| '_ \
  25    ____) | |/ /  __/ | | |  __/ (_| | |_| | (__| |_| | (_) | | | |
  26   |_____/|_/___\___| |_|  \___|\__,_|\__,_|\___|\__|_|\___/|_| |_|
  27
  28  *****************************************************************************/
  29
  30
  31 size_red_t *new_size_red(copy_opt_t *co) {
  32         size_red_t *res = xmalloc(sizeof(*res));
  33
  34         res->co = co;
  35         res->all_removed = pset_new_ptr_default();
  36         res->col_suff = NULL;
  37         obstack_init(&res->ob);
  38
  39         return res;
  40 }
  41
  42 /**
  43  * Checks if a node is simplicial in the graph heeding the already removed nodes.
  44  */
  45 static INLINE int sr_is_simplicial(size_red_t *sr, const ir_node *ifn) {
  46         int i, o, size = 0;
  47         ir_node **all, *curr;
  48         be_ifg_t *ifg = sr->co->cenv->ifg;
  49         void *iter = be_ifg_neighbours_iter_alloca(ifg);
  50
  51         all = alloca(be_ifg_degree(ifg, ifn) * sizeof(*all));
  52
  53         /* get all non-removed neighbors */
  54         be_ifg_foreach_neighbour(ifg, iter, ifn, curr)
  55                 if (!sr_is_removed(sr, curr))
  56                         all[size++] = curr;
  57         be_ifg_neighbours_break(ifg, iter);
  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_nodes_iter_alloca(ifg);
  75
  76         while (redo) {
  77                 redo = 0;
  78                 be_ifg_foreach_node(ifg, iter, irn) {
  79                         arch_register_req_t req;
  80
  81                         arch_get_register_req(sr->co->aenv, &req, irn, -1);
  82
  83                         if (!arch_register_req_is(&req, limited) && !sr_is_removed(sr, irn) && !co_gs_is_optimizable(sr->co, irn)) {
  84                         if (sr_is_simplicial(sr, irn)) {
  85                                         coloring_suffix_t *cs = obstack_alloc(&sr->ob, sizeof(*cs));
  86
  87                                         cs->irn = irn;
  88                                         cs->next = sr->col_suff;
  89                                         sr->col_suff = cs;
  90
  91                                         pset_insert_ptr(sr->all_removed, irn);
  92
  93                                         redo = 1;
  94                         }
  95                         }
  96                 }
  97                 be_ifg_nodes_break(ifg, iter);
  98         }
  99 }
 100
 101 void sr_reinsert(size_red_t *sr) {
 102         coloring_suffix_t *cs;
 103         be_ifg_t *ifg        = sr->co->cenv->ifg;
 104         bitset_t *used_cols  = bitset_alloca(arch_register_class_n_regs(sr->co->cls));
 105         void *iter           = be_ifg_neighbours_iter_alloca(ifg);
 106
 107         /* color the removed nodes in right order */
 108         for (cs = sr->col_suff; cs; cs = cs->next) {
 109                 int free_col;
 110                 ir_node *other, *irn;
 111
 112                 /* get free color by inspecting all neighbors */
 113                 irn = cs->irn;
 114                 bitset_clear_all(used_cols);
 115
 116                 be_ifg_foreach_neighbour(ifg, iter, irn, other) {
 117                         if (!sr_is_removed(sr, other)) /* only inspect nodes which are in graph right now */
 118                                 bitset_set(used_cols, get_irn_col(sr->co, other));
 119                 }
 120                 be_ifg_neighbours_break(ifg, iter);
 121
 122                 /* now all bits not set are possible colors */
 123                 free_col = bitset_next_clear(used_cols, 0);
 124                 assert(free_col != -1 && "No free color found. This can not be.");
 125                 set_irn_col(sr->co, irn, free_col);
 126                 pset_remove_ptr(sr->all_removed, irn); /* irn is back in graph again */
 127         }
 128 }
 129
 130 void free_size_red(size_red_t *sr) {
 131         del_pset(sr->all_removed);
 132         obstack_free(&sr->ob, NULL);
 133         free(sr);
 134 }
 135
 136 /******************************************************************************
 137     _____                      _        _____ _      _____
 138    / ____|                    (_)      |_   _| |    |  __ \
 139   | |  __  ___ _ __   ___ _ __ _  ___    | | | |    | |__) |
 140   | | |_ |/ _ \ '_ \ / _ \ '__| |/ __|   | | | |    |  ___/
 141   | |__| |  __/ | | |  __/ |  | | (__   _| |_| |____| |
 142    \_____|\___|_| |_|\___|_|  |_|\___| |_____|______|_|
 143
 144  *****************************************************************************/
 145
 146 #include <stdio.h>
 147
 148 ilp_env_t *new_ilp_env(copy_opt_t *co, ilp_callback build, ilp_callback apply, void *env) {
 149         ilp_env_t *res = xmalloc(sizeof(*res));
 150         assert(res);
 151
 152         res->co = co;
 153         res->build = build;
 154         res->apply = apply;
 155         res->env = env;
 156         res->sr = new_size_red(co);
 157
 158         return res;
 159 }
 160
 161 lpp_sol_state_t ilp_go(ilp_env_t *ienv) {
 162         FILE *f;
 163         char buf[256];
 164         be_main_env_t *main_env = ienv->co->cenv->birg->main_env;
 165
 166         sr_remove(ienv->sr);
 167
 168         ienv->build(ienv);
 169
 170 #ifdef LPP_SOLVE_NET
 171         lpp_solve_net(ienv->lp, main_env->options->ilp_server, main_env->options->ilp_solver);
 172 #else
 173         lpp_solve_cplex(ienv->lp);
 174 #endif
 175
 176         snprintf(buf, sizeof(buf), "%s.ilp", ienv->co->name);
 177         f = fopen(buf, "wt");
 178         lpp_dump_plain(ienv->lp, f);
 179         fclose(f);
 180
 181         ienv->apply(ienv);
 182
 183         sr_reinsert(ienv->sr);
 184
 185         return lpp_get_sol_state(ienv->lp);
 186 }
 187
 188 void free_ilp_env(ilp_env_t *ienv) {
 189         free_size_red(ienv->sr);
 190         free_lpp(ienv->lp);
 191         free(ienv);
 192 }
 193
 194 #else /* WITH_ILP */
 195
 196 static void only_that_you_can_compile_without_WITH_ILP_defined(void) {
 197 }
 198
 199 #endif /* WITH_ILP */