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

   1 /*
   2  * This file is part of libFirm.
   3  * Copyright (C) 2012 University of Karlsruhe.
   4  */
   5
   6 /**
   7  * @file
   8  * @brief       Common stuff used by all ILP formulations.
   9  * @author      Daniel Grund
  10  * @date        28.02.2006
  11  */
  12 #include "config.h"
  13
  14 #include <stdbool.h>
  15
  16 #include "be_t.h"
  17 #include "irtools.h"
  18 #include "irprintf.h"
  19
  20 #include "statev_t.h"
  21 #include "bemodule.h"
  22 #include "error.h"
  23
  24 #include "lpp.h"
  25
  26 #include "lc_opts.h"
  27 #include "lc_opts_enum.h"
  28
  29 #define DUMP_ILP 1
  30 #define DUMP_SOL 2
  31
  32 static int time_limit = 60;
  33 static int solve_log  = 0;
  34 static unsigned dump_flags = 0;
  35
  36 static const lc_opt_enum_mask_items_t dump_items[] = {
  37         { "ilp",   DUMP_ILP },
  38         { "sol",   DUMP_SOL },
  39         { NULL,    0 }
  40 };
  41
  42 static lc_opt_enum_mask_var_t dump_var = {
  43         &dump_flags, dump_items
  44 };
  45
  46 static const lc_opt_table_entry_t options[] = {
  47         LC_OPT_ENT_INT      ("limit", "time limit for solving in seconds (0 for unlimited)", &time_limit),
  48         LC_OPT_ENT_BOOL     ("log",   "show ilp solving log",              &solve_log),
  49         LC_OPT_ENT_ENUM_MASK("dump",  "dump flags",             &dump_var),
  50         LC_OPT_LAST
  51 };
  52
  53 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_copyilp)
  54 void be_init_copyilp(void)
  55 {
  56         lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
  57         lc_opt_entry_t *ra_grp = lc_opt_get_grp(be_grp, "ra");
  58         lc_opt_entry_t *chordal_grp = lc_opt_get_grp(ra_grp, "chordal");
  59         lc_opt_entry_t *co_grp = lc_opt_get_grp(chordal_grp, "co");
  60         lc_opt_entry_t *ilp_grp = lc_opt_get_grp(co_grp, "ilp");
  61
  62         lc_opt_add_table(ilp_grp, options);
  63 }
  64
  65 #include "becopyilp_t.h"
  66 #include "beifg.h"
  67
  68 /******************************************************************************
  69     _____ _                        _            _   _
  70    / ____(_)                      | |          | | (_)
  71   | (___  _ _______   _ __ ___  __| |_   _  ___| |_ _  ___  _ __
  72    \___ \| |_  / _ \ | '__/ _ \/ _` | | | |/ __| __| |/ _ \| '_ \
  73    ____) | |/ /  __/ | | |  __/ (_| | |_| | (__| |_| | (_) | | | |
  74   |_____/|_/___\___| |_|  \___|\__,_|\__,_|\___|\__|_|\___/|_| |_|
  75
  76  *****************************************************************************/
  77
  78
  79 size_red_t *new_size_red(copy_opt_t *co)
  80 {
  81         size_red_t *res = XMALLOC(size_red_t);
  82
  83         res->co = co;
  84         res->all_removed = pset_new_ptr_default();
  85         res->col_suff = NULL;
  86         obstack_init(&res->ob);
  87
  88         return res;
  89 }
  90
  91 /**
  92  * Checks if a node is simplicial in the graph heeding the already removed nodes.
  93  */
  94 static inline bool sr_is_simplicial(size_red_t *sr, const ir_node *ifn)
  95 {
  96         be_ifg_t *ifg  = sr->co->cenv->ifg;
  97         neighbours_iter_t iter;
  98         ir_node **all  = ALLOCAN(ir_node*, be_ifg_degree(ifg, ifn));
  99         int       size = 0;
 100         int       i;
 101         int       o;
 102
 103         /* get all non-removed neighbors */
 104         be_ifg_foreach_neighbour(ifg, &iter, ifn, curr)
 105                 if (!sr_is_removed(sr, curr))
 106                         all[size++] = curr;
 107
 108         /* check if these form a clique */
 109         for (i=0; i<size; ++i)
 110                 for (o=i+1; o<size; ++o)
 111                         if (!be_ifg_connected(ifg, all[i], all[o]))
 112                                 return false;
 113
 114         /* all edges exist so this is a clique */
 115         return true;
 116 }
 117
 118 void sr_remove(size_red_t *sr)
 119 {
 120         bool redo = true;
 121         const be_ifg_t *ifg = sr->co->cenv->ifg;
 122         nodes_iter_t iter;
 123
 124         while (redo) {
 125                 redo = false;
 126                 be_ifg_foreach_node(ifg, &iter, irn) {
 127                         const arch_register_req_t *req = arch_get_irn_register_req(irn);
 128                         coloring_suffix_t *cs;
 129
 130                         if (arch_register_req_is(req, limited) || sr_is_removed(sr, irn))
 131                                 continue;
 132                         if (co_gs_is_optimizable(sr->co, irn))
 133                                 continue;
 134                         if (!sr_is_simplicial(sr, irn))
 135                                 continue;
 136
 137                         cs = OALLOC(&sr->ob, coloring_suffix_t);
 138                         cs->irn = irn;
 139                         cs->next = sr->col_suff;
 140                         sr->col_suff = cs;
 141
 142                         pset_insert_ptr(sr->all_removed, irn);
 143
 144                         redo = true;
 145                 }
 146         }
 147 }
 148
 149 void sr_reinsert(size_red_t *sr)
 150 {
 151         coloring_suffix_t *cs;
 152         ir_graph *irg        = sr->co->irg;
 153         be_ifg_t *ifg        = sr->co->cenv->ifg;
 154         unsigned  n_regs     = arch_register_class_n_regs(sr->co->cls);
 155
 156         unsigned *const allocatable_cols = rbitset_alloca(n_regs);
 157         be_set_allocatable_regs(irg, sr->co->cls, allocatable_cols);
 158
 159         unsigned *const possible_cols = rbitset_alloca(n_regs);
 160         neighbours_iter_t iter;
 161
 162         /* color the removed nodes in right order */
 163         for (cs = sr->col_suff; cs; cs = cs->next) {
 164                 unsigned free_col;
 165                 ir_node *irn = cs->irn;
 166
 167                 rbitset_copy(possible_cols, allocatable_cols, n_regs);
 168
 169                 /* get free color by inspecting all neighbors */
 170                 be_ifg_foreach_neighbour(ifg, &iter, irn, other) {
 171                         const arch_register_req_t *cur_req;
 172                         unsigned cur_col;
 173
 174                         /* only inspect nodes which are in graph right now */
 175                         if (sr_is_removed(sr, other))
 176                                 continue;
 177
 178                         cur_req = arch_get_irn_register_req(other);
 179                         cur_col = get_irn_col(other);
 180
 181                         /* Invalidate all single size register when it is a large one */
 182                         do  {
 183                                 rbitset_clear(possible_cols, cur_col);
 184                                 ++cur_col;
 185                         } while ((cur_col % cur_req->width) != 0);
 186                 }
 187
 188                 /* now all bits not set are possible colors */
 189                 /* take one that matches the alignment constraint */
 190                 free_col = 0;
 191                 assert(!rbitset_is_empty(possible_cols, n_regs) && "No free color found. This can not be.");
 192                 while (true) {
 193                         free_col = (unsigned)rbitset_next(possible_cols, free_col, true);
 194                         if (free_col % arch_get_irn_register_req(irn)->width == 0)
 195                                 break;
 196                         ++free_col;
 197                         assert(free_col < n_regs);
 198                 }
 199                 set_irn_col(sr->co->cls, irn, free_col);
 200                 pset_remove_ptr(sr->all_removed, irn); /* irn is back in graph again */
 201         }
 202 }
 203
 204 void free_size_red(size_red_t *sr)
 205 {
 206         del_pset(sr->all_removed);
 207         obstack_free(&sr->ob, NULL);
 208         free(sr);
 209 }
 210
 211 /******************************************************************************
 212     _____                      _        _____ _      _____
 213    / ____|                    (_)      |_   _| |    |  __ \
 214   | |  __  ___ _ __   ___ _ __ _  ___    | | | |    | |__) |
 215   | | |_ |/ _ \ '_ \ / _ \ '__| |/ __|   | | | |    |  ___/
 216   | |__| |  __/ | | |  __/ |  | | (__   _| |_| |____| |
 217    \_____|\___|_| |_|\___|_|  |_|\___| |_____|______|_|
 218
 219  *****************************************************************************/
 220
 221 #include <stdio.h>
 222
 223 ilp_env_t *new_ilp_env(copy_opt_t *co, ilp_callback build, ilp_callback apply, void *env)
 224 {
 225         ilp_env_t *res = XMALLOC(ilp_env_t);
 226
 227         res->co         = co;
 228         res->build      = build;
 229         res->apply      = apply;
 230         res->env        = env;
 231         res->sr         = new_size_red(co);
 232
 233         return res;
 234 }
 235
 236 lpp_sol_state_t ilp_go(ilp_env_t *ienv)
 237 {
 238         ir_graph *irg = ienv->co->irg;
 239
 240         sr_remove(ienv->sr);
 241
 242         ienv->build(ienv);
 243
 244         if (dump_flags & DUMP_ILP) {
 245                 char buf[128];
 246                 FILE *f;
 247
 248                 ir_snprintf(buf, sizeof(buf), "%F_%s-co.ilp", irg,
 249                             ienv->co->cenv->cls->name);
 250                 f = fopen(buf, "wt");
 251                 if (f == NULL) {
 252                         panic("Couldn't open '%s' for writing", buf);
 253                 }
 254                 lpp_dump_plain(ienv->lp, f);
 255                 fclose(f);
 256         }
 257
 258         lpp_set_time_limit(ienv->lp, time_limit);
 259         if (solve_log)
 260                 lpp_set_log(ienv->lp, stdout);
 261
 262         lpp_solve(ienv->lp, be_options.ilp_server, be_options.ilp_solver);
 263
 264         //stat_ev_dbl("co_ilp_objval",     ienv->lp->objval);
 265         //stat_ev_dbl("co_ilp_best_bound", ienv->lp->best_bound);
 266         stat_ev_int("co_ilp_iter",       lpp_get_iter_cnt(ienv->lp));
 267         stat_ev_dbl("co_ilp_sol_time",   lpp_get_sol_time(ienv->lp));
 268
 269         ienv->apply(ienv);
 270
 271         sr_reinsert(ienv->sr);
 272
 273         return lpp_get_sol_state(ienv->lp);
 274 }
 275
 276 void free_ilp_env(ilp_env_t *ienv)
 277 {
 278         free_size_red(ienv->sr);
 279         lpp_free(ienv->lp);
 280         free(ienv);
 281 }