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

   1
   2 /**
   3  * More experiments on coalescing.
   4  * @author Sebastian Hack
   5  * @date   25.07.2006
   6  */
   7
   8 #ifdef HAVE_CONFIG_H
   9 #include "config.h"
  10 #endif
  11
  12 #ifdef WITH_LIBCORE
  13 #include <libcore/lc_opts.h>
  14 #include <libcore/lc_opts_enum.h>
  15 #endif /* WITH_LIBCORE */
  16
  17 #include <stdlib.h>
  18 #include <limits.h>
  19
  20 #include "list.h"
  21 #include "pdeq.h"
  22 #include "bitset.h"
  23
  24 #include "debug.h"
  25 #include "bitfiddle.h"
  26 #include "bitset.h"
  27
  28 #include "irphase_t.h"
  29 #include "irgraph_t.h"
  30 #include "irnode_t.h"
  31 #include "irprintf.h"
  32 #include "irtools.h"
  33
  34 #include "bemodule.h"
  35 #include "beabi.h"
  36 #include "benode_t.h"
  37 #include "becopyopt.h"
  38 #include "becopyopt_t.h"
  39 #include "bechordal_t.h"
  40 #include "bejavacoal.h"
  41
  42 #include <stdlib.h>
  43 #include <stdio.h>
  44
  45 #define DUMP_BEFORE 1
  46 #define DUMP_AFTER  2
  47 #define DUMP_ALL    2 * DUMP_AFTER - 1
  48
  49 static unsigned dump_flags = 0;
  50 static int      dbg_level  = 0;
  51
  52 #ifdef WITH_LIBCORE
  53 static const lc_opt_enum_mask_items_t dump_items[] = {
  54         { "before",  DUMP_BEFORE },
  55         { "after",   DUMP_AFTER  },
  56         { "all",     DUMP_ALL    },
  57         { NULL,      0 }
  58 };
  59
  60 static lc_opt_enum_mask_var_t dump_var = {
  61         &dump_flags, dump_items
  62 };
  63
  64 static const lc_opt_table_entry_t options[] = {
  65         LC_OPT_ENT_ENUM_MASK("dump", "dump ifg cloud",                              &dump_var),
  66         LC_OPT_ENT_INT      ("dbg",  "debug level for the Java coalescer",          &dbg_level),
  67         { NULL }
  68 };
  69
  70 void be_init_copyheur3(void)
  71 {
  72         lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
  73         lc_opt_entry_t *ra_grp = lc_opt_get_grp(be_grp, "ra");
  74         lc_opt_entry_t *chordal_grp = lc_opt_get_grp(ra_grp, "chordal");
  75         lc_opt_entry_t *co3_grp = lc_opt_get_grp(chordal_grp, "co3");
  76
  77         lc_opt_add_table(co3_grp, options);
  78 }
  79
  80 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_copyheur3);
  81 #endif
  82
  83 static void set_admissible_regs(be_java_coal_t *coal, copy_opt_t *co, ir_node *irn, int t_idx, int *col_map)
  84 {
  85         unsigned i;
  86         arch_register_req_t req;
  87         unsigned n_regs = co->cls->n_regs;
  88
  89         // ir_printf("%+F\n", irn);
  90         arch_get_register_req(co->aenv, &req, irn, BE_OUT_POS(0));
  91         if(arch_register_req_is(&req, limited)) {
  92                 bitset_t *adm = bitset_alloca(n_regs);
  93                 req.limited(req.limited_env, adm);
  94                 for(i = 0; i < n_regs; ++i)
  95                         if(!bitset_is_set(adm, i) && col_map[i] >= 0) {
  96                                 // printf("\tforbidding color: %d\n", i);
  97                                 be_java_coal_forbid_color(coal, t_idx, col_map[i]);
  98                         }
  99         }
 100 }
 101
 102 int co_solve_heuristic_java(copy_opt_t *co)
 103 {
 104         be_ifg_t *ifg   = co->cenv->ifg;
 105         void *nodes_it  = be_ifg_nodes_iter_alloca(ifg);
 106         void *neigh_it  = be_ifg_neighbours_iter_alloca(ifg);
 107         bitset_t *nodes = bitset_malloc(get_irg_last_idx(co->irg));
 108         unsigned n_regs = co->cenv->cls->n_regs;
 109
 110         char dbg[256];
 111         unsigned i, j, curr_idx;
 112         int *col_map;
 113         int *inv_col_map;
 114
 115         int *node_map;
 116         int *inv_node_map;
 117
 118         be_java_coal_t *coal;
 119         ir_node *n, *m;
 120
 121         col_map     = alloca(n_regs * sizeof(col_map[0]));
 122         inv_col_map = alloca(n_regs * sizeof(inv_col_map[0]));
 123
 124         memset(inv_col_map, -1, sizeof(inv_col_map[0]) * n_regs);
 125
 126         for(i = 0, j = 0; i < n_regs; ++i) {
 127                 const arch_register_t *reg = &co->cls->regs[i];
 128                 col_map[i] = -1;
 129                 if(!arch_register_type_is(reg, ignore)) {
 130                         col_map[i] = j;
 131                         inv_col_map[j] = i;
 132                         ++j;
 133                 }
 134         }
 135
 136         node_map     = malloc((get_irg_last_idx(co->irg) + 1) * sizeof(node_map[0]));
 137         inv_node_map = malloc((get_irg_last_idx(co->irg) + 1) * sizeof(inv_node_map[0]));
 138
 139         curr_idx = 0;
 140         be_ifg_foreach_node(ifg, nodes_it, n) {
 141                 if(!arch_irn_is(co->aenv, n, ignore)) {
 142                         int idx = get_irn_idx(n);
 143                         bitset_set(nodes, idx);
 144                         node_map[idx] = curr_idx;
 145                         inv_node_map[curr_idx] = idx;
 146                         curr_idx++;
 147                 }
 148         }
 149
 150         if(curr_idx == 0) {
 151                 free(node_map);
 152                 free(inv_node_map);
 153                 bitset_free(nodes);
 154                 return 0;
 155         }
 156
 157         coal = be_java_coal_init("test", curr_idx, j, dbg_level);
 158
 159         /* Check, if all neighbours are indeed connected to the node. */
 160         be_ifg_foreach_node(ifg, nodes_it, n) {
 161                 int n_idx = get_irn_idx(n);
 162                 int t_idx = node_map[n_idx];
 163
 164                 if(bitset_is_set(nodes, n_idx)) {
 165                         affinity_node_t *an = get_affinity_info(co, n);
 166
 167                         ir_snprintf(dbg, sizeof(dbg), "%+F", n);
 168                         be_java_coal_set_debug(coal, t_idx, dbg);
 169                         be_java_coal_set_color(coal, t_idx, col_map[arch_get_irn_register(co->aenv, n)->index]);
 170                         set_admissible_regs(coal, co, n, t_idx, col_map);
 171                         be_ifg_foreach_neighbour(ifg, neigh_it, n, m) {
 172                                 int m_idx = get_irn_idx(m);
 173                                 int s_idx = node_map[m_idx];
 174
 175                                 if(n_idx < m_idx && bitset_is_set(nodes, m_idx)) {
 176                                         be_java_coal_add_int_edge(coal, s_idx, t_idx);
 177                                 }
 178                         }
 179
 180                         if(an != NULL) {
 181                                 neighb_t *neigh;
 182                                 co_gs_foreach_neighb(an, neigh) {
 183                                         int m_idx = get_irn_idx(neigh->irn);
 184                                         int s_idx = node_map[m_idx];
 185
 186                                         if(n_idx < m_idx && bitset_is_set(nodes, m_idx)) {
 187                                                 be_java_coal_add_aff_edge(coal, s_idx, t_idx, neigh->costs);
 188                                         }
 189                                 }
 190                         }
 191                 }
 192         }
 193
 194         if(dump_flags & DUMP_BEFORE) {
 195                 char fn[512];
 196                 ir_snprintf(fn, sizeof(fn), "%F-%s-before.dot", co->cenv->irg, co->cenv->cls->name);
 197                 be_java_coal_dump(coal, fn);
 198         }
 199
 200         be_java_coal_coalesce(coal);
 201
 202         be_ifg_foreach_node(ifg, nodes_it, n) {
 203                 unsigned idx = get_irn_idx(n);
 204                 if(bitset_is_set(nodes, idx)) {
 205                         unsigned t_idx             = node_map[idx];
 206                         unsigned col               = inv_col_map[be_java_coal_get_color(coal, t_idx)];
 207                         const arch_register_t *reg;
 208
 209                         assert(col < n_regs);
 210                         reg     = &co->cls->regs[col];
 211                         arch_set_irn_register(co->aenv, n, reg);
 212                 }
 213         }
 214
 215         if(dump_flags & DUMP_AFTER) {
 216                 char fn[512];
 217                 ir_snprintf(fn, sizeof(fn), "%F-%s-after.dot", co->cenv->irg, co->cenv->cls->name);
 218                 be_java_coal_dump(coal, fn);
 219         }
 220
 221         be_java_coal_destroy(coal);
 222         bitset_free(nodes);
 223         return 0;
 224 }