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