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