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

   1 /*
   2  * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
   3  *
   4  * This file is part of libFirm.
   5  *
   6  * This file may be distributed and/or modified under the terms of the
   7  * GNU General Public License version 2 as published by the Free Software
   8  * Foundation and appearing in the file LICENSE.GPL included in the
   9  * packaging of this file.
  10  *
  11  * Licensees holding valid libFirm Professional Edition licenses may use
  12  * this file in accordance with the libFirm Commercial License.
  13  * Agreement provided with the Software.
  14  *
  15  * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
  16  * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
  17  * PURPOSE.
  18  */
  19
  20 /**
  21  * @file
  22  * @brief       PBQP based register allocation.
  23  * @author      Thomas Bersch
  24  * @date        27.11.2009
  25  * @version     $Id: bechordal.c 26750 2009-11-27 09:37:43Z bersch $
  26  */
  27
  28 /*      miscellaneous includes */
  29 #include "config.h"
  30
  31 #ifdef FIRM_KAPS
  32
  33 #include "debug.h"
  34 #include "error.h"
  35
  36 #include "irdom.h"
  37 #include "iredges_t.h"
  38 #include "irprintf.h"
  39 #include "irgwalk.h"
  40 #include "time.h"
  41
  42 /* libfirm/ir/be includes */
  43 #include "bearch.h"
  44 #include "beirg.h"
  45 #include "besched.h"
  46 #include "bemodule.h"
  47 #include "bechordal_common.h"
  48 #include "bechordal.h"
  49 #include "bechordal_t.h"
  50 #include "beinsn_t.h"
  51 #include "benode.h"
  52 #include "belive.h"
  53 #include "belive_t.h"
  54 #include "beutil.h"
  55 #include "plist.h"
  56 #include "pqueue.h"
  57 #include "becopyopt.h"
  58
  59 /* pbqp includes */
  60 #include "kaps.h"
  61 #include "matrix.h"
  62 #include "vector.h"
  63 #include "vector_t.h"
  64 #include "heuristical_co.h"
  65 #include "pbqp_t.h"
  66 #include "html_dumper.h"
  67 #include "pbqp_node_t.h"
  68 #include "pbqp_node.h"
  69
  70 #define TIMER 0
  71
  72
  73 static bool use_exec_freq = true;
  74
  75 typedef struct _be_pbqp_alloc_env_t {
  76         pbqp                                            *pbqp_inst;                     /**< PBQP instance for register allocation */
  77         be_irg_t                        *birg;                  /**< Back-end IRG session. */
  78         ir_graph                        *irg;                   /**< The graph under examination. */
  79         const arch_register_class_t *cls;                               /**< Current processed register class */
  80         be_lv_t                     *lv;
  81         bitset_t                    *ignored_regs;
  82         pbqp_matrix                                     *ife_matrix_template;
  83         pbqp_matrix                                     *aff_matrix_template;
  84         plist_t                                         *rpeo;
  85         unsigned                                        *restr_nodes;
  86         unsigned                                        *ife_edge_num;
  87         be_chordal_env_t                        *env;
  88 } be_pbqp_alloc_env_t;
  89
  90
  91 #define is_Reg_Phi(irn)                                                                                 (is_Phi(irn) && mode_is_data(get_irn_mode(irn)))
  92 #define get_Perm_src(irn)                                                                               (get_irn_n(get_Proj_pred(irn), get_Proj_proj(irn)))
  93 #define is_Perm_Proj(irn)                                                                               (is_Proj(irn) && be_is_Perm(get_Proj_pred(irn)))
  94 #define insert_edge(pbqp, src_node, trg_node, template_matrix)  (add_edge_costs(pbqp, get_irn_idx(src_node), get_irn_idx(trg_node), pbqp_matrix_copy(pbqp, template_matrix)))
  95 #define get_free_regs(restr_nodes, cls, irn)                                    (arch_register_class_n_regs(cls) - restr_nodes[get_irn_idx(irn)])
  96
  97 static inline int is_2addr_code(const arch_register_req_t *req)
  98 {
  99         return (req->type & arch_register_req_type_should_be_same) != 0;
 100 }
 101
 102 static const lc_opt_table_entry_t options[] = {
 103         LC_OPT_ENT_BOOL      ("exec_freq", "use exec_freq",  &use_exec_freq),
 104         LC_OPT_LAST
 105 };
 106
 107 #if KAPS_DUMP
 108 static FILE *my_open(const be_chordal_env_t *env, const char *prefix, const char *suffix)
 109 {
 110         FILE *result;
 111         char buf[1024];
 112         size_t i, n;
 113         char *tu_name;
 114
 115         n = strlen(env->birg->main_env->cup_name);
 116         tu_name = XMALLOCN(char, n + 1);
 117         strcpy(tu_name, env->birg->main_env->cup_name);
 118         for (i = 0; i < n; ++i)
 119                 if (tu_name[i] == '.')
 120                         tu_name[i] = '_';
 121
 122         ir_snprintf(buf, sizeof(buf), "%s%s_%F_%s%s", prefix, tu_name, env->irg, env->cls->name, suffix);
 123         xfree(tu_name);
 124         result = fopen(buf, "wt");
 125         if (result == NULL) {
 126                 panic("Couldn't open '%s' for writing.", buf);
 127         }
 128
 129         return result;
 130 }
 131 #endif
 132
 133
 134 static void create_pbqp_node(be_pbqp_alloc_env_t *pbqp_alloc_env, ir_node *irn)
 135 {
 136         const arch_register_class_t *cls = pbqp_alloc_env->cls;
 137         pbqp     *pbqp_inst              = pbqp_alloc_env->pbqp_inst;
 138         bitset_t *ignored_regs           = pbqp_alloc_env->ignored_regs;
 139         unsigned  colors_n               = arch_register_class_n_regs(cls);
 140         unsigned  cntConstrains          = 0;
 141
 142         /* create costs vector depending on register constrains */
 143         struct vector *costs_vector = vector_alloc(pbqp_inst, colors_n);
 144
 145         /* set costs depending on register constrains */
 146         unsigned idx;
 147         for (idx = 0; idx < colors_n; idx++) {
 148                 if (bitset_is_set(ignored_regs, idx) || !arch_reg_out_is_allocatable(irn, arch_register_for_index(cls, idx))) {
 149                         vector_set(costs_vector, idx, INF_COSTS);
 150                         cntConstrains++;
 151                 }
 152         }
 153
 154         /* add vector to pbqp node */
 155         add_node_costs(pbqp_inst, get_irn_idx(irn), costs_vector);
 156         pbqp_alloc_env->restr_nodes[get_irn_idx(irn)] = cntConstrains;
 157 }
 158
 159 static void insert_ife_edge(be_pbqp_alloc_env_t *pbqp_alloc_env, ir_node *src_node, ir_node *trg_node)
 160 {
 161         pbqp                                            *pbqp                = pbqp_alloc_env->pbqp_inst;
 162         const arch_register_class_t *cls                 = pbqp_alloc_env->cls;
 163         pbqp_matrix                             *ife_matrix_template = pbqp_alloc_env->ife_matrix_template;
 164         unsigned                                        *restr_nodes         = pbqp_alloc_env->restr_nodes;
 165
 166         if (get_edge(pbqp, get_irn_idx(src_node), get_irn_idx(trg_node)) == NULL) {
 167
 168                 /* increase ife edge counter */
 169                 pbqp_alloc_env->ife_edge_num[get_irn_idx(src_node)]++;
 170                 pbqp_alloc_env->ife_edge_num[get_irn_idx(trg_node)]++;
 171
 172                 /* do useful optimization to speed up pbqp solving (we can do this because we know our matrix) */
 173                 if (get_free_regs(restr_nodes, cls, src_node) == 1 && get_free_regs(restr_nodes, cls, trg_node) == 1) {
 174                         unsigned src_idx = vector_get_min_index(get_node(pbqp, get_irn_idx(src_node))->costs);
 175                         unsigned trg_idx = vector_get_min_index(get_node(pbqp, get_irn_idx(trg_node))->costs);
 176                         assert(src_idx != trg_idx && "Interfering nodes could not have the same register!");
 177                         return;
 178                 }
 179                 if (get_free_regs(restr_nodes, cls, src_node) == 1 || get_free_regs(restr_nodes, cls, trg_node) == 1) {
 180                         if (get_free_regs(restr_nodes, cls, src_node) == 1) {
 181                                 unsigned idx = vector_get_min_index(get_node(pbqp, get_irn_idx(src_node))->costs);
 182                                 vector_set(get_node(pbqp, get_irn_idx(trg_node))->costs, idx, INF_COSTS);
 183                         }
 184                         else {
 185                                 unsigned idx = vector_get_min_index(get_node(pbqp, get_irn_idx(trg_node))->costs);
 186                                 vector_set(get_node(pbqp, get_irn_idx(src_node))->costs, idx, INF_COSTS);
 187                         }
 188                         return;
 189                 }
 190
 191                 /* insert interference edge */
 192                 insert_edge(pbqp, src_node, trg_node, ife_matrix_template);
 193         }
 194 }
 195
 196 static void inser_afe_edge(be_pbqp_alloc_env_t *pbqp_alloc_env, ir_node *src_node, ir_node *trg_node, int pos)
 197 {
 198         pbqp                                            *pbqp             = pbqp_alloc_env->pbqp_inst;
 199         const arch_register_class_t *cls              = pbqp_alloc_env->cls;
 200         unsigned                                        *restr_nodes      = pbqp_alloc_env->restr_nodes;
 201         pbqp_matrix                                     *afe_matrix       = pbqp_matrix_alloc(pbqp, arch_register_class_n_regs(cls), arch_register_class_n_regs(cls));
 202         unsigned                                         colors_n                 = arch_register_class_n_regs(cls);
 203
 204         if (get_edge(pbqp, get_irn_idx(src_node), get_irn_idx(trg_node)) == NULL) {
 205                 if (use_exec_freq) {
 206                         /* get exec_freq for copy_block */
 207                         ir_node *root_bl = get_nodes_block(src_node);
 208                         ir_node *copy_bl = is_Phi(src_node) ? get_Block_cfgpred_block(root_bl, pos) : root_bl;
 209                         unsigned long res = get_block_execfreq_ulong(pbqp_alloc_env->birg->exec_freq, copy_bl);
 210
 211                         /* create afe-matrix */
 212                         unsigned row, col;
 213                         for (row = 0; row < colors_n; row++) {
 214                                 for (col = 0; col < colors_n; col++) {
 215                                         if (row != col)
 216                                                 pbqp_matrix_set(afe_matrix, row, col, (num)res);
 217                                 }
 218                         }
 219                 }
 220                 else {
 221                         afe_matrix = pbqp_alloc_env->aff_matrix_template;
 222                 }
 223
 224                 /* do useful optimization to speed up pbqp solving */
 225                 if (get_free_regs(restr_nodes, cls, src_node) == 1 && get_free_regs(restr_nodes, cls, trg_node) == 1) {
 226                         return;
 227                 }
 228                 if (get_free_regs(restr_nodes, cls, src_node) == 1 || get_free_regs(restr_nodes, cls, trg_node) == 1) {
 229                         if (get_free_regs(restr_nodes, cls, src_node) == 1) {
 230                                 unsigned regIdx = vector_get_min_index(get_node(pbqp, get_irn_idx(src_node))->costs);
 231                                 vector_add_matrix_col(get_node(pbqp, get_irn_idx(trg_node))->costs, afe_matrix, regIdx);
 232                         }
 233                         else {
 234                                 unsigned regIdx = vector_get_min_index(get_node(pbqp, get_irn_idx(trg_node))->costs);
 235                                 vector_add_matrix_col(get_node(pbqp, get_irn_idx(src_node))->costs, afe_matrix, regIdx);
 236                         }
 237                         return;
 238                 }
 239
 240                 /* insert interference edge */
 241                 insert_edge(pbqp, src_node, trg_node, afe_matrix);
 242         }
 243 }
 244
 245 static void create_affinity_edges(ir_node *irn, void *env)
 246 {
 247         be_pbqp_alloc_env_t         *pbqp_alloc_env   = env;
 248         const arch_register_class_t *cls              = pbqp_alloc_env->cls;
 249         const arch_register_req_t   *req              = arch_get_register_req_out(irn);
 250         unsigned pos, max;
 251
 252         if (is_Reg_Phi(irn)) { /* Phis */
 253                 for (pos=0, max=get_irn_arity(irn); pos<max; ++pos) {
 254                         ir_node *arg = get_irn_n(irn, pos);
 255
 256                         if (!arch_irn_consider_in_reg_alloc(cls, arg))
 257                                 continue;
 258
 259                         /* no edges to itself */
 260                         if (irn == arg) {
 261                                 continue;
 262                         }
 263
 264                         inser_afe_edge(pbqp_alloc_env, irn, arg, pos);
 265                 }
 266         }
 267         else if (is_Perm_Proj(irn)) { /* Perms */
 268                 ir_node *arg = get_Perm_src(irn);
 269                 if (!arch_irn_consider_in_reg_alloc(cls, arg))
 270                         return;
 271
 272                 inser_afe_edge(pbqp_alloc_env, irn, arg, -1);
 273         }
 274         else { /* 2-address code */
 275                 if (is_2addr_code(req)) {
 276                         const unsigned other = req->other_same;
 277                         int i;
 278
 279                         for (i = 0; 1U << i <= other; ++i) {
 280                                 if (other & (1U << i)) {
 281                                         ir_node *other = get_irn_n(skip_Proj(irn), i);
 282                                         if (!arch_irn_consider_in_reg_alloc(cls, other))
 283                                                 continue;
 284
 285                                         /* no edges to itself */
 286                                         if (irn == other) {
 287                                                 continue;
 288                                         }
 289
 290                                         inser_afe_edge(pbqp_alloc_env, irn, other, i);
 291                                 }
 292                         }
 293                 }
 294         }
 295 }
 296
 297 static void create_pbqp_coloring_instance(ir_node *block, void *data)
 298 {
 299         be_pbqp_alloc_env_t         *pbqp_alloc_env     = data;
 300         be_lv_t                     *lv                 = pbqp_alloc_env->lv;
 301         const arch_register_class_t *cls                = pbqp_alloc_env->cls;
 302         plist_t                                         *rpeo                           = pbqp_alloc_env->rpeo;
 303         pbqp                                            *pbqp_inst                      = pbqp_alloc_env->pbqp_inst;
 304         unsigned                                        *restr_nodes            = pbqp_alloc_env->restr_nodes;
 305         pqueue_t                                        *queue                  = new_pqueue();
 306         pqueue_t                                        *restr_nodes_queue      = new_pqueue();
 307         plist_t                                         *temp_list              = plist_new();
 308         ir_node                     *irn;
 309         ir_nodeset_t                 live_nodes;
 310
 311         /* first, determine the pressure */
 312         /* (this is only for compatibility with copymin optimization, it's not needed for pbqp coloring) */
 313         create_borders(block, pbqp_alloc_env->env);
 314
 315         /* calculate living nodes for the first step */
 316         ir_nodeset_init(&live_nodes);
 317         be_liveness_end_of_block(lv, cls, block, &live_nodes);
 318
 319         /* create pbqp nodes, interference edges and reverse perfect elimination order */
 320         sched_foreach_reverse(block, irn) {
 321                 ir_node *live;
 322                 ir_nodeset_iterator_t iter;
 323
 324                 if (get_irn_mode(irn) == mode_T) {
 325                         const ir_edge_t *edge;
 326                         foreach_out_edge(irn, edge) {
 327                                 ir_node *proj = get_edge_src_irn(edge);
 328                                 if (!arch_irn_consider_in_reg_alloc(cls, proj))
 329                                         continue;
 330
 331                                 /* create pbqp source node if it dosn't exist */
 332                                 if (get_node(pbqp_inst, get_irn_idx(proj)) == NULL) {
 333                                         create_pbqp_node(pbqp_alloc_env, proj);
 334                                 }
 335
 336                                 /* create nodes and interference edges */
 337                                 foreach_ir_nodeset(&live_nodes, live, iter) {
 338                                         /* create pbqp source node if it dosn't exist */
 339                                         if (get_node(pbqp_inst, get_irn_idx(live)) == NULL) {
 340                                                 create_pbqp_node(pbqp_alloc_env, live);
 341                                         }
 342
 343                                         /* no edges to itself */
 344                                         if (proj == live) {
 345                                                 continue;
 346                                         }
 347
 348                                         insert_ife_edge(pbqp_alloc_env, proj, live);
 349                                 }
 350                         }
 351                 }
 352                 else {
 353                         if (arch_irn_consider_in_reg_alloc(cls, irn)) {
 354                                 /* create pbqp source node if it dosn't exist */
 355                                 if (get_node(pbqp_inst, get_irn_idx(irn)) == NULL) {
 356                                         create_pbqp_node(pbqp_alloc_env, irn);
 357                                 }
 358
 359                                 /* create nodes and interference edges */
 360                                 foreach_ir_nodeset(&live_nodes, live, iter) {
 361                                         /* create pbqp source node if it dosn't exist */
 362                                         if (get_node(pbqp_inst, get_irn_idx(live)) == NULL) {
 363                                                 create_pbqp_node(pbqp_alloc_env, live);
 364                                         }
 365
 366                                         /* no edges to itself */
 367                                         if (irn == live) {
 368                                                 continue;
 369                                         }
 370
 371                                         /* insert interference edge */
 372                                         insert_ife_edge(pbqp_alloc_env, irn, live);
 373                                 }
 374                         }
 375                 }
 376
 377                 /* get living nodes for next step */
 378                 if (!is_Phi(irn)) {
 379                         be_liveness_transfer(cls, irn, &live_nodes);
 380                 }
 381
 382                 /* order nodes for perfect elimination order */
 383                 if (get_irn_mode(irn) == mode_T) {
 384                         plist_element_t *first = plist_first(temp_list);
 385                         const ir_edge_t *edge;
 386
 387                         foreach_out_edge(irn, edge) {
 388                                 ir_node *proj = get_edge_src_irn(edge);
 389                                 if (!arch_irn_consider_in_reg_alloc(cls, proj))
 390                                         continue;
 391
 392                                 // insert proj node into priority queue (descending by the number of interference edges)
 393                                 if (get_free_regs(restr_nodes, cls, proj) <= 4/*bitset_is_set(restr_nodes, get_irn_idx(proj))*/) {
 394                                         pqueue_put(restr_nodes_queue, proj, pbqp_alloc_env->ife_edge_num[get_irn_idx(proj)]);
 395                                 }
 396                                 else {
 397                                         pqueue_put(queue,proj, pbqp_alloc_env->ife_edge_num[get_irn_idx(proj)]);
 398                                 }
 399                         }
 400
 401                         /* first insert all restricted nodes */
 402                         while (!pqueue_empty(restr_nodes_queue)) {
 403                                 if (first == NULL) {
 404                                         plist_insert_back(temp_list, get_node(pbqp_inst, get_irn_idx(pqueue_pop_front(restr_nodes_queue))));
 405                                         first = plist_first(temp_list);
 406                                 } else {
 407                                         plist_insert_before(temp_list, first, get_node(pbqp_inst, get_irn_idx(pqueue_pop_front(restr_nodes_queue))));
 408                                 }
 409                         }
 410
 411                         /* insert proj nodes descending by their number of interference edges */
 412                         while (!pqueue_empty(queue)) {
 413                                 if (first == NULL) {
 414                                         plist_insert_back(temp_list, get_node(pbqp_inst, get_irn_idx(pqueue_pop_front(queue))));
 415                                         first = plist_first(temp_list);
 416                                 } else {
 417                                         plist_insert_before(temp_list, first, get_node(pbqp_inst, get_irn_idx(pqueue_pop_front(queue))));
 418                                 }
 419                         }
 420                 }
 421                 else {
 422                         if (arch_irn_consider_in_reg_alloc(cls, irn)) {
 423                                 plist_insert_front(temp_list, get_node(pbqp_inst, get_irn_idx(irn)));
 424                         }
 425                 }
 426         }
 427
 428         /* insert nodes into reverse perfect elimination order */
 429         plist_element_t *el;
 430         foreach_plist(temp_list, el) {
 431                 plist_insert_back(rpeo, el->data);
 432         }
 433
 434         /* free reserved memory */
 435         ir_nodeset_destroy(&live_nodes);
 436         plist_free(temp_list);
 437         del_pqueue(queue);
 438         del_pqueue(restr_nodes_queue);
 439 }
 440
 441 static void insert_perms(ir_node *block, void *data)
 442 {
 443         /*
 444          * Start silent in the start block.
 445          * The silence remains until the first barrier is seen.
 446          * Each other block is begun loud.
 447          */
 448         be_chordal_env_t *env    = data;
 449         ir_node          *irn;
 450         int               silent = block == get_irg_start_block(get_irn_irg(block));
 451
 452         /*
 453          * If the block is the start block search the barrier and
 454          * start handling constraints from there.
 455          */
 456         for (irn = sched_first(block); !sched_is_end(irn);) {
 457                 int silent_old = silent;        /* store old silent value */
 458                 if (be_is_Barrier(irn))
 459                         silent = !silent;               /* toggle silent flag */
 460
 461                 be_insn_t *insn         = chordal_scan_insn(env, irn);
 462                 irn                                     = insn->next_insn;
 463
 464                 if (silent_old)
 465                         continue;
 466
 467                 if (!insn->has_constraints)
 468                         continue;
 469
 470                 pre_process_constraints(env, &insn);
 471         }
 472 }
 473
 474 static void be_pbqp_coloring(be_chordal_env_t *env)
 475 {
 476         ir_graph                      *irg  = env->irg;
 477         be_irg_t                      *birg = env->birg;
 478         const arch_register_class_t   *cls  = env->cls;
 479         unsigned colors_n                                   = arch_register_class_n_regs(cls);
 480         be_pbqp_alloc_env_t pbqp_alloc_env;
 481         unsigned idx, row, col;
 482         be_lv_t *lv;
 483
 484 #if TIMER
 485         ir_timer_t *t_ra_pbqp_alloc_create     = ir_timer_new();
 486         ir_timer_t *t_ra_pbqp_alloc_solve      = ir_timer_new();
 487         ir_timer_t *t_ra_pbqp_alloc_create_aff = ir_timer_new();
 488
 489         printf("#### ----- === Allocating registers of %s (%s) ===\n", cls->name, get_entity_name(get_irg_entity(irg)));
 490 #endif
 491         lv = be_assure_liveness(birg);
 492         be_liveness_assure_sets(lv);
 493         be_liveness_assure_chk(lv);
 494
 495         /* insert perms */
 496         assure_doms(irg);
 497         dom_tree_walk_irg(irg, insert_perms, NULL, env);
 498
 499         /* dump graph after inserting perms */
 500         if (env->opts->dump_flags & BE_CH_DUMP_CONSTR) {
 501                 char buf[256];
 502                 snprintf(buf, sizeof(buf), "-%s-constr", cls->name);
 503                 be_dump(irg, buf, dump_ir_block_graph_sched);
 504         }
 505
 506
 507         /* initialize pbqp allocation data structure */
 508         pbqp_alloc_env.pbqp_inst    = alloc_pbqp(get_irg_last_idx(irg));                /* initialize pbqp instance */
 509         pbqp_alloc_env.birg         = birg;
 510         pbqp_alloc_env.cls          = cls;
 511         pbqp_alloc_env.irg          = irg;
 512         pbqp_alloc_env.lv           = lv;
 513         pbqp_alloc_env.ignored_regs = bitset_malloc(colors_n);
 514         pbqp_alloc_env.rpeo                     = plist_new();
 515         pbqp_alloc_env.restr_nodes  = XMALLOCNZ(unsigned, get_irg_last_idx(irg));
 516         pbqp_alloc_env.ife_edge_num = XMALLOCNZ(unsigned, get_irg_last_idx(irg));
 517         pbqp_alloc_env.env                      = env;
 518         be_put_ignore_regs(birg, cls, pbqp_alloc_env.ignored_regs);                             /* get ignored registers */
 519
 520
 521         /* create costs matrix template for interference edges */
 522         struct pbqp_matrix *ife_matrix = pbqp_matrix_alloc(pbqp_alloc_env.pbqp_inst, colors_n, colors_n);
 523         /* set costs */
 524         for (row = 0, col=0; row < colors_n; row++, col++)
 525                 pbqp_matrix_set(ife_matrix, row, col, INF_COSTS);
 526
 527         pbqp_alloc_env.ife_matrix_template = ife_matrix;
 528
 529
 530         if (!use_exec_freq) {
 531                 /* create costs matrix template for affinity edges */
 532                 struct pbqp_matrix *afe_matrix = pbqp_matrix_alloc(pbqp_alloc_env.pbqp_inst, colors_n, colors_n);
 533                 /* set costs */
 534                 for (row = 0; row < colors_n; row++) {
 535                         for (col = 0; col < colors_n; col++) {
 536                                 if (row != col)
 537                                         pbqp_matrix_set(afe_matrix, row, col, 2);
 538                         }
 539                 }
 540                 pbqp_alloc_env.aff_matrix_template = afe_matrix;
 541         }
 542
 543
 544         /* create pbqp instance */
 545 #if TIMER
 546         ir_timer_reset_and_start(t_ra_pbqp_alloc_create);
 547 #endif
 548         assure_doms(irg);
 549         dom_tree_walk_irg(irg, create_pbqp_coloring_instance , NULL, &pbqp_alloc_env);
 550 #if TIMER
 551         ir_timer_stop(t_ra_pbqp_alloc_create);
 552 #endif
 553
 554
 555         /* set up affinity edges */
 556 #if TIMER
 557         ir_timer_reset_and_start(t_ra_pbqp_alloc_create_aff);
 558 #endif
 559         plist_element_t *el;
 560         foreach_plist(pbqp_alloc_env.rpeo, el) {
 561                 pbqp_node *node                    = el->data;
 562                 idx                                    = node->index;
 563                 ir_node *irn               = get_idx_irn(irg, idx);
 564                 create_affinity_edges(irn, &pbqp_alloc_env);
 565         }
 566 #if TIMER
 567         ir_timer_stop(t_ra_pbqp_alloc_create_aff);
 568 #endif
 569
 570
 571 #if KAPS_DUMP
 572         // dump graph before solving pbqp
 573         FILE *file_before = my_open(env, "", "-pbqp_coloring.html");
 574         set_dumpfile(pbqp_alloc_env.pbqp_inst, file_before);
 575 #endif
 576
 577
 578         /* solve pbqp instance */
 579 #if TIMER
 580         ir_timer_reset_and_start(t_ra_pbqp_alloc_solve);
 581 #endif
 582         solve_pbqp_heuristical_co(pbqp_alloc_env.pbqp_inst,pbqp_alloc_env.rpeo);
 583 #if TIMER
 584         ir_timer_stop(t_ra_pbqp_alloc_solve);
 585 #endif
 586         num solution = get_solution(pbqp_alloc_env.pbqp_inst);
 587         assert(solution != INF_COSTS && "No PBQP solution found");
 588
 589
 590         /* assign colors */
 591         plist_element_t *element;
 592         foreach_plist(pbqp_alloc_env.rpeo, element) {
 593                 pbqp_node *node                    = element->data;
 594                 idx                                    = node->index;
 595                 ir_node *irn               = get_idx_irn(irg, idx);
 596                 num color                  = get_node_solution(pbqp_alloc_env.pbqp_inst, idx);
 597                 const arch_register_t *reg = arch_register_for_index(cls, color);
 598
 599                 arch_set_irn_register(irn, reg);
 600         }
 601
 602
 603 #if TIMER
 604         printf("%-20s: %8.3lf msec\n", "pbqp alloc create",
 605                (double)ir_timer_elapsed_usec(t_ra_pbqp_alloc_create) / 1000.0);
 606         printf("%-20s: %8.3lf msec\n", "pbqp alloc solve",
 607                (double)ir_timer_elapsed_usec(t_ra_pbqp_alloc_solve) / 1000.0);
 608         printf("%-20s: %8.3lf msec\n", "pbqp alloc create aff",
 609                (double)ir_timer_elapsed_usec(t_ra_pbqp_alloc_create_aff) / 1000.0);
 610 #endif
 611
 612
 613         /* free reserved memory */
 614 #if KAPS_DUMP
 615         fclose(file_before);
 616 #endif
 617         bitset_free(pbqp_alloc_env.ignored_regs);
 618         free_pbqp(pbqp_alloc_env.pbqp_inst);
 619         plist_free(pbqp_alloc_env.rpeo);
 620         xfree(pbqp_alloc_env.restr_nodes);
 621         xfree(pbqp_alloc_env.ife_edge_num);
 622 }
 623
 624
 625 /**
 626  * Initializes this module.
 627  */
 628 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_pbqp_coloring);
 629 void be_init_pbqp_coloring(void)
 630 {
 631         lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
 632         lc_opt_entry_t *ra_grp = lc_opt_get_grp(be_grp, "ra");
 633         lc_opt_entry_t *chordal_grp = lc_opt_get_grp(ra_grp, "chordal");
 634         lc_opt_entry_t *coloring_grp = lc_opt_get_grp(chordal_grp, "coloring");
 635         lc_opt_entry_t *pbqp_grp = lc_opt_get_grp(coloring_grp, "pbqp");
 636
 637         static be_ra_chordal_coloring_t coloring = {
 638                 be_pbqp_coloring
 639         };
 640
 641         lc_opt_add_table(pbqp_grp, options);
 642         be_register_chordal_coloring("pbqp", &coloring);
 643 }
 644
 645 #endif