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 #define DUMP_ILP 1
  18 #define DUMP_SOL 2
  19
  20 static int time_limit = 60;
  21 static int solve_net  = 1;
  22 static int dump_flags = 0;
  23
  24 #ifdef WITH_LIBCORE
  25 #include <libcore/lc_opts.h>
  26 #include <libcore/lc_opts_enum.h>
  27 static const lc_opt_enum_mask_items_t dump_items[] = {
  28         { "ilp",   DUMP_ILP },
  29         { "sol",   DUMP_SOL },
  30         { NULL,    0 }
  31 };
  32
  33 static lc_opt_enum_mask_var_t dump_var = {
  34         &dump_flags, dump_items
  35 };
  36
  37 static const lc_opt_table_entry_t options[] = {
  38         LC_OPT_ENT_INT      ("limit", "time limit for solving in seconds (0 for unlimited, default 60)", &time_limit),
  39         LC_OPT_ENT_BOOL     ("net",   "solve over the net (default: yes)", &solve_net),
  40         LC_OPT_ENT_ENUM_MASK("dump",  "dump flags (ilp, sol)",             &dump_var),
  41         { NULL }
  42 };
  43
  44 void be_co_ilp_register_options(lc_opt_entry_t *grp)
  45 {
  46         lc_opt_entry_t *ilp_grp = lc_opt_get_grp(grp, "ilp");
  47         lc_opt_add_table(ilp_grp, options);
  48 }
  49 #endif
  50
  51
  52 #include "becopyilp_t.h"
  53 #include "beifg_t.h"
  54
  55 /******************************************************************************
  56     _____ _                        _            _   _
  57    / ____(_)                      | |          | | (_)
  58   | (___  _ _______   _ __ ___  __| |_   _  ___| |_ _  ___  _ __
  59    \___ \| |_  / _ \ | '__/ _ \/ _` | | | |/ __| __| |/ _ \| '_ \
  60    ____) | |/ /  __/ | | |  __/ (_| | |_| | (__| |_| | (_) | | | |
  61   |_____/|_/___\___| |_|  \___|\__,_|\__,_|\___|\__|_|\___/|_| |_|
  62
  63  *****************************************************************************/
  64
  65
  66 size_red_t *new_size_red(copy_opt_t *co) {
  67         size_red_t *res = xmalloc(sizeof(*res));
  68
  69         res->co = co;
  70         res->all_removed = pset_new_ptr_default();
  71         res->col_suff = NULL;
  72         obstack_init(&res->ob);
  73
  74         return res;
  75 }
  76
  77 /**
  78  * Checks if a node is simplicial in the graph heeding the already removed nodes.
  79  */
  80 static INLINE int sr_is_simplicial(size_red_t *sr, const ir_node *ifn) {
  81         int i, o, size = 0;
  82         ir_node **all, *curr;
  83         be_ifg_t *ifg = sr->co->cenv->ifg;
  84         void *iter = be_ifg_neighbours_iter_alloca(ifg);
  85
  86         all = alloca(be_ifg_degree(ifg, ifn) * sizeof(*all));
  87
  88         /* get all non-removed neighbors */
  89         be_ifg_foreach_neighbour(ifg, iter, ifn, curr)
  90                 if (!sr_is_removed(sr, curr))
  91                         all[size++] = curr;
  92         be_ifg_neighbours_break(ifg, iter);
  93
  94         /* check if these form a clique */
  95         for (i=0; i<size; ++i)
  96                 for (o=i+1; o<size; ++o)
  97                         if (!be_ifg_connected(ifg, all[i], all[o]))
  98                                 return 0;
  99
 100         /* all edges exist so this is a clique */
 101         return 1;
 102 }
 103
 104 void sr_remove(size_red_t *sr) {
 105         ir_node *irn;
 106         int redo = 1;
 107         const be_ifg_t *ifg = sr->co->cenv->ifg;
 108         void *iter = be_ifg_nodes_iter_alloca(ifg);
 109
 110         while (redo) {
 111                 redo = 0;
 112                 be_ifg_foreach_node(ifg, iter, irn) {
 113                         arch_register_req_t req;
 114
 115                         arch_get_register_req(sr->co->aenv, &req, irn, -1);
 116
 117                         if (!arch_register_req_is(&req, limited) && !sr_is_removed(sr, irn) && !co_gs_is_optimizable(sr->co, irn)) {
 118                         if (sr_is_simplicial(sr, irn)) {
 119                                         coloring_suffix_t *cs = obstack_alloc(&sr->ob, sizeof(*cs));
 120
 121                                         cs->irn = irn;
 122                                         cs->next = sr->col_suff;
 123                                         sr->col_suff = cs;
 124
 125                                         pset_insert_ptr(sr->all_removed, irn);
 126
 127                                         redo = 1;
 128                         }
 129                         }
 130                 }
 131                 be_ifg_nodes_break(ifg, iter);
 132         }
 133 }
 134
 135 void sr_reinsert(size_red_t *sr) {
 136         coloring_suffix_t *cs;
 137         be_ifg_t *ifg        = sr->co->cenv->ifg;
 138         bitset_t *used_cols  = bitset_alloca(arch_register_class_n_regs(sr->co->cls));
 139         void *iter           = be_ifg_neighbours_iter_alloca(ifg);
 140
 141         /* color the removed nodes in right order */
 142         for (cs = sr->col_suff; cs; cs = cs->next) {
 143                 int free_col;
 144                 ir_node *other, *irn;
 145
 146                 /* get free color by inspecting all neighbors */
 147                 irn = cs->irn;
 148                 bitset_clear_all(used_cols);
 149
 150                 be_ifg_foreach_neighbour(ifg, iter, irn, other) {
 151                         if (!sr_is_removed(sr, other)) /* only inspect nodes which are in graph right now */
 152                                 bitset_set(used_cols, get_irn_col(sr->co, other));
 153                 }
 154                 be_ifg_neighbours_break(ifg, iter);
 155
 156                 /* now all bits not set are possible colors */
 157                 free_col = bitset_next_clear(used_cols, 0);
 158                 assert(free_col != -1 && "No free color found. This can not be.");
 159                 set_irn_col(sr->co, irn, free_col);
 160                 pset_remove_ptr(sr->all_removed, irn); /* irn is back in graph again */
 161         }
 162 }
 163
 164 void free_size_red(size_red_t *sr) {
 165         del_pset(sr->all_removed);
 166         obstack_free(&sr->ob, NULL);
 167         free(sr);
 168 }
 169
 170 /******************************************************************************
 171     _____                      _        _____ _      _____
 172    / ____|                    (_)      |_   _| |    |  __ \
 173   | |  __  ___ _ __   ___ _ __ _  ___    | | | |    | |__) |
 174   | | |_ |/ _ \ '_ \ / _ \ '__| |/ __|   | | | |    |  ___/
 175   | |__| |  __/ | | |  __/ |  | | (__   _| |_| |____| |
 176    \_____|\___|_| |_|\___|_|  |_|\___| |_____|______|_|
 177
 178  *****************************************************************************/
 179
 180 #include <stdio.h>
 181
 182 ilp_env_t *new_ilp_env(copy_opt_t *co, ilp_callback build, ilp_callback apply, void *env) {
 183         ilp_env_t *res = xmalloc(sizeof(*res));
 184         assert(res);
 185
 186         res->co         = co;
 187         res->build      = build;
 188         res->apply      = apply;
 189         res->env        = env;
 190         res->sr         = new_size_red(co);
 191
 192         return res;
 193 }
 194
 195 lpp_sol_state_t ilp_go(ilp_env_t *ienv) {
 196         be_main_env_t *main_env = ienv->co->cenv->birg->main_env;
 197
 198         sr_remove(ienv->sr);
 199
 200         ienv->build(ienv);
 201         lpp_set_time_limit(ienv->lp, time_limit);
 202
 203         if(solve_net)
 204                 lpp_solve_net(ienv->lp, main_env->options->ilp_server, main_env->options->ilp_solver);
 205         else {
 206 #ifdef LPP_SOLVE_NET
 207                 fprintf(stderr, "can only solve ilp over the net\n");
 208 #else
 209                 lpp_solve_cplex(ienv->lp);
 210 #endif
 211         }
 212
 213         if(dump_flags & DUMP_ILP) {
 214                 FILE *f = be_chordal_open(ienv->co->cenv, "", "-co.ilp");
 215                 lpp_dump_plain(ienv->lp, f);
 216                 fclose(f);
 217         }
 218
 219         ienv->apply(ienv);
 220
 221         sr_reinsert(ienv->sr);
 222
 223         return lpp_get_sol_state(ienv->lp);
 224 }
 225
 226 void free_ilp_env(ilp_env_t *ienv) {
 227         free_size_red(ienv->sr);
 228         free_lpp(ienv->lp);
 229         free(ienv);
 230 }
 231
 232 #else /* WITH_ILP */
 233
 234 static INLINE void only_that_you_can_compile_without_WITH_ILP_defined(void) {
 235 }
 236
 237 #endif /* WITH_ILP */