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 = xmalloc(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                 redo = 0;
  71                 be_ifg_foreach_node(ifg, iter, irn) {
  72                         arch_register_req_t req;
  73
  74                         arch_get_register_req(sr->co->aenv, &req, irn, -1);
  75
  76                         if (!arch_register_req_is(&req, limited) && !sr_is_removed(sr, irn) && !co_gs_is_optimizable(sr->co, irn)) {
  77                         if (sr_is_simplicial(sr, irn)) {
  78                                         coloring_suffix_t *cs = obstack_alloc(&sr->ob, sizeof(*cs));
  79
  80                                         cs->irn = irn;
  81                                         cs->next = sr->col_suff;
  82                                         sr->col_suff = cs;
  83
  84                                         pset_insert_ptr(sr->all_removed, irn);
  85
  86                                         redo = 1;
  87                         }
  88                         }
  89                 }
  90         }
  91 }
  92
  93 void sr_reinsert(size_red_t *sr) {
  94         coloring_suffix_t *cs;
  95         be_ifg_t *ifg        = sr->co->cenv->ifg;
  96         bitset_t *used_cols  = bitset_alloca(arch_register_class_n_regs(sr->co->cls));
  97         void *iter           = be_ifg_neighbours_iter_alloca(ifg);
  98
  99         /* color the removed nodes in right order */
 100         for (cs = sr->col_suff; cs; cs = cs->next) {
 101                 int free_col;
 102                 ir_node *other, *irn;
 103
 104                 /* get free color by inspecting all neighbors */
 105                 irn = cs->irn;
 106                 bitset_clear_all(used_cols);
 107
 108                 be_ifg_foreach_neighbour(ifg, iter, irn, other) {
 109                         if (!sr_is_removed(sr, other)) /* only inspect nodes which are in graph right now */
 110                                 bitset_set(used_cols, get_irn_col(sr->co, other));
 111                 }
 112
 113                 /* now all bits not set are possible colors */
 114                 free_col = bitset_next_clear(used_cols, 0);
 115                 assert(free_col != -1 && "No free color found. This can not be.");
 116                 set_irn_col(sr->co, irn, free_col);
 117                 pset_remove_ptr(sr->all_removed, irn); /* irn is back in graph again */
 118         }
 119 }
 120
 121 void free_size_red(size_red_t *sr) {
 122         del_pset(sr->all_removed);
 123         obstack_free(&sr->ob, NULL);
 124         free(sr);
 125 }
 126
 127 /******************************************************************************
 128     _____                      _        _____ _      _____
 129    / ____|                    (_)      |_   _| |    |  __ \
 130   | |  __  ___ _ __   ___ _ __ _  ___    | | | |    | |__) |
 131   | | |_ |/ _ \ '_ \ / _ \ '__| |/ __|   | | | |    |  ___/
 132   | |__| |  __/ | | |  __/ |  | | (__   _| |_| |____| |
 133    \_____|\___|_| |_|\___|_|  |_|\___| |_____|______|_|
 134
 135  *****************************************************************************/
 136
 137 #include <stdio.h>
 138
 139 ilp_env_t *new_ilp_env(copy_opt_t *co, ilp_callback build, ilp_callback apply, void *env) {
 140         ilp_env_t *res = xmalloc(sizeof(*res));
 141         assert(res);
 142
 143         res->co = co;
 144         res->build = build;
 145         res->apply = apply;
 146         res->env = env;
 147         res->sr = new_size_red(co);
 148
 149         return res;
 150 }
 151
 152 lpp_sol_state_t ilp_go(ilp_env_t *ienv) {
 153         FILE *f;
 154         char buf[256];
 155         be_main_env_t *main_env = ienv->co->cenv->birg->main_env;
 156
 157         sr_remove(ienv->sr);
 158
 159         ienv->build(ienv);
 160
 161 #ifdef LPP_SOLVE_NET
 162         lpp_solve_net(ienv->lp, main_env->options->ilp_server, main_env->options->ilp_solver);
 163 #else
 164         lpp_solve_cplex(ienv->lp);
 165 #endif
 166
 167         snprintf(buf, sizeof(buf), "%s.ilp", ienv->co->name);
 168         f = fopen(buf, "wt");
 169         lpp_dump_plain(ienv->lp, f);
 170         fclose(f);
 171
 172         ienv->apply(ienv);
 173
 174         sr_reinsert(ienv->sr);
 175
 176         return lpp_get_sol_state(ienv->lp);
 177 }
 178
 179 void free_ilp_env(ilp_env_t *ienv) {
 180         free_size_red(ienv->sr);
 181         free_lpp(ienv->lp);
 182         free(ienv);
 183 }