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

   1 /**
   2  * @file   bechordal_main.c
   3  * @date   29.11.2005
   4  * @author Sebastian Hack
   5  * @cvs-id $Id$
   6  *
   7  * Copyright (C) 2005-2006 Universitaet Karlsruhe
   8  * Released under the GPL
   9  *
  10  * Driver for the chordal register allocator.
  11  */
  12 #ifdef HAVE_CONFIG_H
  13 #include "config.h"
  14 #endif
  15
  16 #include <time.h>
  17
  18 #include "obst.h"
  19 #include "pset.h"
  20 #include "list.h"
  21 #include "bitset.h"
  22 #include "iterator.h"
  23 #include "firm_config.h"
  24
  25 #ifdef WITH_LIBCORE
  26 #include <libcore/lc_opts.h>
  27 #include <libcore/lc_opts_enum.h>
  28 #include <libcore/lc_timing.h>
  29 #endif /* WITH_LIBCORE */
  30
  31 #include "ircons_t.h"
  32 #include "irmode_t.h"
  33 #include "irgraph_t.h"
  34 #include "irprintf_t.h"
  35 #include "irgwalk.h"
  36 #include "ircons.h"
  37 #include "irdump.h"
  38 #include "irdom.h"
  39 #include "ircons.h"
  40 #include "irbitset.h"
  41 #include "irnode.h"
  42 #include "ircons.h"
  43 #include "debug.h"
  44 #include "xmalloc.h"
  45 #include "execfreq.h"
  46
  47 #include "bechordal_t.h"
  48 #include "beabi.h"
  49 #include "bejavacoal.h"
  50 #include "beutil.h"
  51 #include "besched.h"
  52 #include "besched_t.h"
  53 #include "belive_t.h"
  54 #include "bearch.h"
  55 #include "beifg_t.h"
  56 #include "beifg_impl.h"
  57 #include "benode_t.h"
  58 #include "bestatevent.h"
  59 #include "bestat.h"
  60 #include "bemodule.h"
  61
  62 #include "bespillbelady.h"
  63 #include "bespillmorgan.h"
  64 #include "bespillslots.h"
  65 #include "bespilloptions.h"
  66 #include "belower.h"
  67
  68 #ifdef WITH_ILP
  69 #include "bespillremat.h"
  70 #endif /* WITH_ILP */
  71
  72 #include "bejavacoal.h"
  73 #include "becopystat.h"
  74 #include "becopyopt.h"
  75 #include "bessadestr.h"
  76 #include "beverify.h"
  77 #include "benode_t.h"
  78
  79 static be_ra_chordal_opts_t options = {
  80         BE_CH_DUMP_NONE,
  81         BE_CH_LOWER_PERM_SWAP,
  82         BE_CH_VRFY_WARN,
  83 };
  84
  85 /** Enable extreme live range splitting. */
  86 static int be_elr_split = 0;
  87
  88 typedef struct _post_spill_env_t {
  89         be_chordal_env_t            cenv;
  90         be_irg_t                    *birg;
  91         const arch_register_class_t *cls;
  92         double                      pre_spill_cost;
  93 } post_spill_env_t;
  94
  95 static be_ra_timer_t ra_timer = {
  96         NULL,
  97         NULL,
  98         NULL,
  99         NULL,
 100         NULL,
 101         NULL,
 102         NULL,
 103         NULL,
 104         NULL,
 105         NULL,
 106         NULL,
 107 };
 108
 109 static const lc_opt_enum_int_items_t lower_perm_items[] = {
 110         { "copy", BE_CH_LOWER_PERM_COPY },
 111         { "swap", BE_CH_LOWER_PERM_SWAP },
 112         { NULL, 0 }
 113 };
 114
 115 static const lc_opt_enum_int_items_t lower_perm_stat_items[] = {
 116         { NULL, 0 }
 117 };
 118
 119 static const lc_opt_enum_int_items_t dump_items[] = {
 120         { "none",       BE_CH_DUMP_NONE       },
 121         { "spill",      BE_CH_DUMP_SPILL      },
 122         { "live",       BE_CH_DUMP_LIVE       },
 123         { "color",      BE_CH_DUMP_COLOR      },
 124         { "copymin",    BE_CH_DUMP_COPYMIN    },
 125         { "ssadestr",   BE_CH_DUMP_SSADESTR   },
 126         { "tree",       BE_CH_DUMP_TREE_INTV  },
 127         { "constr",     BE_CH_DUMP_CONSTR     },
 128         { "lower",      BE_CH_DUMP_LOWER      },
 129         { "spillslots", BE_CH_DUMP_SPILLSLOTS },
 130         { "appel",      BE_CH_DUMP_APPEL      },
 131         { "all",        BE_CH_DUMP_ALL        },
 132         { NULL, 0 }
 133 };
 134
 135 static const lc_opt_enum_int_items_t be_ch_vrfy_items[] = {
 136         { "off",    BE_CH_VRFY_OFF    },
 137         { "warn",   BE_CH_VRFY_WARN   },
 138         { "assert", BE_CH_VRFY_ASSERT },
 139         { NULL, 0 }
 140 };
 141
 142 static lc_opt_enum_int_var_t lower_perm_var = {
 143         &options.lower_perm_opt, lower_perm_items
 144 };
 145
 146 static lc_opt_enum_int_var_t dump_var = {
 147         &options.dump_flags, dump_items
 148 };
 149
 150 static lc_opt_enum_int_var_t be_ch_vrfy_var = {
 151         &options.vrfy_option, be_ch_vrfy_items
 152 };
 153
 154 static const lc_opt_table_entry_t be_chordal_options[] = {
 155         LC_OPT_ENT_ENUM_PTR ("perm",          "perm lowering options", &lower_perm_var),
 156         LC_OPT_ENT_ENUM_MASK("dump",          "select dump phases", &dump_var),
 157         LC_OPT_ENT_ENUM_PTR ("vrfy",          "verify options", &be_ch_vrfy_var),
 158         LC_OPT_ENT_BOOL     ("elrsplit",      "enable extreme live range splitting", &be_elr_split),
 159         { NULL }
 160 };
 161
 162 static void dump(unsigned mask, ir_graph *irg,
 163                                  const arch_register_class_t *cls,
 164                                  const char *suffix,
 165                                  void (*dump_func)(ir_graph *, const char *))
 166 {
 167         if((options.dump_flags & mask) == mask) {
 168                 if (cls) {
 169                         char buf[256];
 170                         snprintf(buf, sizeof(buf), "-%s%s", cls->name, suffix);
 171                         be_dump(irg, buf, dump_func);
 172                 }
 173                 else
 174                         be_dump(irg, suffix, dump_func);
 175         }
 176 }
 177
 178 /**
 179  * Checks for every reload if it's user can perform the load on itself.
 180  */
 181 static void memory_operand_walker(ir_node *irn, void *env) {
 182         be_chordal_env_t *cenv = env;
 183         const arch_env_t *aenv = cenv->birg->main_env->arch_env;
 184         const ir_edge_t  *edge, *ne;
 185         ir_node          *block;
 186         ir_node          *spill;
 187
 188         if (! be_is_Reload(irn))
 189                 return;
 190
 191         /* only use memory operands, if the reload is only used by 1 node */
 192         if(get_irn_n_edges(irn) > 1)
 193                 return;
 194
 195         spill = be_get_Reload_mem(irn);
 196         block = get_nodes_block(irn);
 197
 198         foreach_out_edge_safe(irn, edge, ne) {
 199                 ir_node *src = get_edge_src_irn(edge);
 200                 int     pos  = get_edge_src_pos(edge);
 201
 202                 assert(src && "outedges broken!");
 203
 204                 if (get_nodes_block(src) == block && arch_possible_memory_operand(aenv, src, pos)) {
 205                         DBG((cenv->dbg, LEVEL_3, "performing memory operand %+F at %+F\n", irn, src));
 206                         arch_perform_memory_operand(aenv, src, spill, pos);
 207                 }
 208         }
 209
 210         /* kill the Reload */
 211         if (get_irn_n_edges(irn) == 0) {
 212                 sched_remove(irn);
 213                 set_irn_n(irn, be_pos_Reload_mem, new_Bad());
 214         }
 215 }
 216
 217 /**
 218  * Starts a walk for memory operands if supported by the backend.
 219  */
 220 static INLINE void check_for_memory_operands(be_chordal_env_t *chordal_env) {
 221         irg_walk_graph(chordal_env->irg, NULL, memory_operand_walker, chordal_env);
 222 }
 223
 224 /**
 225  * Sorry for doing stats again...
 226  */
 227 typedef struct _node_stat_t {
 228         unsigned int n_phis;      /**< Phis of the current register class. */
 229         unsigned int n_mem_phis;  /**< Memory Phis (Phis with spill operands). */
 230         unsigned int n_copies;    /**< Copies */
 231         unsigned int n_perms;     /**< Perms */
 232         unsigned int n_spills;    /**< Spill nodes */
 233         unsigned int n_reloads;   /**< Reloads */
 234 } node_stat_t;
 235
 236 struct node_stat_walker {
 237         node_stat_t      *stat;
 238         const arch_env_t *arch_env;
 239         bitset_t         *mem_phis;
 240         const arch_register_class_t *cls;
 241 };
 242
 243 static void node_stat_walker(ir_node *irn, void *data)
 244 {
 245         struct node_stat_walker *env  = data;
 246         const arch_env_t        *aenv = env->arch_env;
 247
 248         if (arch_irn_consider_in_reg_alloc(aenv, env->cls, irn)) {
 249
 250                 /* if the node is a normal phi */
 251                 if(is_Phi(irn))
 252                         env->stat->n_phis++;
 253
 254                 else if(arch_irn_classify(aenv, irn) & arch_irn_class_spill)
 255                         ++env->stat->n_spills;
 256
 257                 else if(arch_irn_classify(aenv, irn) & arch_irn_class_reload)
 258                         ++env->stat->n_reloads;
 259
 260                 else if(arch_irn_classify(aenv, irn) & arch_irn_class_copy)
 261                         ++env->stat->n_copies;
 262
 263                 else if(arch_irn_classify(aenv, irn) & arch_irn_class_perm)
 264                         ++env->stat->n_perms;
 265         }
 266
 267         /* a mem phi is a PhiM with a mem phi operand or a Spill operand */
 268         else if(is_Phi(irn) && get_irn_mode(irn) == mode_M) {
 269                 int i;
 270
 271                 for(i = get_irn_arity(irn) - 1; i >= 0; --i) {
 272                         ir_node *op = get_irn_n(irn, i);
 273
 274                         if((is_Phi(op) && bitset_contains_irn(env->mem_phis, op)) || (arch_irn_classify(aenv, op) & arch_irn_class_spill)) {
 275                                 bitset_add_irn(env->mem_phis, irn);
 276                                 env->stat->n_mem_phis++;
 277                                 break;
 278                         }
 279                 }
 280         }
 281 }
 282
 283 static void node_stats(be_irg_t *birg, const arch_register_class_t *cls, node_stat_t *stat)
 284 {
 285         struct node_stat_walker env;
 286
 287         memset(stat, 0, sizeof(stat[0]));
 288         env.arch_env = birg->main_env->arch_env;
 289         env.mem_phis = bitset_irg_malloc(birg->irg);
 290         env.stat     = stat;
 291         env.cls      = cls;
 292         irg_walk_graph(birg->irg, NULL, node_stat_walker, &env);
 293         bitset_free(env.mem_phis);
 294 }
 295
 296 static void insn_count_walker(ir_node *irn, void *data)
 297 {
 298         int *cnt = data;
 299
 300         switch(get_irn_opcode(irn)) {
 301         case iro_Proj:
 302         case iro_Phi:
 303         case iro_Start:
 304         case iro_End:
 305                 break;
 306         default:
 307                 (*cnt)++;
 308         }
 309 }
 310
 311 static unsigned int count_insns(ir_graph *irg)
 312 {
 313         int cnt = 0;
 314         irg_walk_graph(irg, insn_count_walker, NULL, &cnt);
 315         return cnt;
 316 }
 317
 318 #ifdef WITH_LIBCORE
 319 /**
 320  * Initialize all timers.
 321  */
 322 static void be_init_timer(be_options_t *main_opts)
 323 {
 324         if (main_opts->timing == BE_TIME_ON) {
 325                 ra_timer.t_prolog     = lc_timer_register("ra_prolog",     "regalloc prolog");
 326                 ra_timer.t_epilog     = lc_timer_register("ra_epilog",     "regalloc epilog");
 327                 ra_timer.t_live       = lc_timer_register("ra_liveness",   "be liveness");
 328                 ra_timer.t_spill      = lc_timer_register("ra_spill",      "spiller");
 329                 ra_timer.t_spillslots = lc_timer_register("ra_spillslots", "spillslots");
 330                 ra_timer.t_color      = lc_timer_register("ra_color",      "graph coloring");
 331                 ra_timer.t_ifg        = lc_timer_register("ra_ifg",        "interference graph");
 332                 ra_timer.t_copymin    = lc_timer_register("ra_copymin",    "copy minimization");
 333                 ra_timer.t_ssa        = lc_timer_register("ra_ssadestr",   "ssa destruction");
 334                 ra_timer.t_verify     = lc_timer_register("ra_verify",     "graph verification");
 335                 ra_timer.t_other      = lc_timer_register("ra_other",      "other time");
 336
 337                 LC_STOP_AND_RESET_TIMER(ra_timer.t_prolog);
 338                 LC_STOP_AND_RESET_TIMER(ra_timer.t_epilog);
 339                 LC_STOP_AND_RESET_TIMER(ra_timer.t_live);
 340                 LC_STOP_AND_RESET_TIMER(ra_timer.t_spill);
 341                 LC_STOP_AND_RESET_TIMER(ra_timer.t_spillslots);
 342                 LC_STOP_AND_RESET_TIMER(ra_timer.t_color);
 343                 LC_STOP_AND_RESET_TIMER(ra_timer.t_ifg);
 344                 LC_STOP_AND_RESET_TIMER(ra_timer.t_copymin);
 345                 LC_STOP_AND_RESET_TIMER(ra_timer.t_ssa);
 346                 LC_STOP_AND_RESET_TIMER(ra_timer.t_verify);
 347                 LC_STOP_AND_RESET_TIMER(ra_timer.t_other);
 348         }
 349 }
 350
 351 #define BE_TIMER_INIT(main_opts)        be_init_timer(main_opts)
 352
 353 #define BE_TIMER_PUSH(timer)                                                            \
 354         if (main_opts->timing == BE_TIME_ON) {                                              \
 355                 if (! lc_timer_push(timer)) {                                                   \
 356                         if (options.vrfy_option == BE_CH_VRFY_ASSERT)                               \
 357                                 assert(!"Timer already on stack, cannot be pushed twice.");             \
 358                         else if (options.vrfy_option == BE_CH_VRFY_WARN)                            \
 359                                 fprintf(stderr, "Timer %s already on stack, cannot be pushed twice.\n", \
 360                                         lc_timer_get_name(timer));                                          \
 361                 }                                                                               \
 362         }
 363 #define BE_TIMER_POP(timer)                                                                    \
 364         if (main_opts->timing == BE_TIME_ON) {                                                     \
 365                 lc_timer_t *tmp = lc_timer_pop();                                                      \
 366                 if (options.vrfy_option == BE_CH_VRFY_ASSERT)                                          \
 367                         assert(tmp == timer && "Attempt to pop wrong timer.");                             \
 368                 else if (options.vrfy_option == BE_CH_VRFY_WARN && tmp != timer)                       \
 369                         fprintf(stderr, "Attempt to pop wrong timer. %s is on stack, trying to pop %s.\n", \
 370                                 lc_timer_get_name(tmp), lc_timer_get_name(timer));                             \
 371                 timer = tmp;                                                                           \
 372         }
 373 #else
 374
 375 #define BE_TIMER_INIT(main_opts)
 376 #define BE_TIMER_PUSH(timer)
 377 #define BE_TIMER_POP(timer)
 378
 379 #endif /* WITH_LIBCORE */
 380
 381 /**
 382  * Perform things which need to be done per register class before spilling.
 383  */
 384 static void pre_spill(const arch_isa_t *isa, int cls_idx, post_spill_env_t *pse) {
 385         be_chordal_env_t *chordal_env = &pse->cenv;
 386         be_irg_t         *birg        = pse->birg;
 387         node_stat_t      node_stat;
 388
 389         pse->cls                   = arch_isa_get_reg_class(isa, cls_idx);
 390         chordal_env->cls           = pse->cls;
 391         chordal_env->border_heads  = pmap_create();
 392         chordal_env->ignore_colors = bitset_malloc(chordal_env->cls->n_regs);
 393
 394 #ifdef FIRM_STATISTICS
 395         if (be_stat_ev_is_active()) {
 396                 be_stat_tags[STAT_TAG_CLS] = pse->cls->name;
 397                 be_stat_ev_push(be_stat_tags, STAT_TAG_LAST, be_stat_file);
 398
 399                 /* perform some node statistics. */
 400                 node_stats(birg, pse->cls, &node_stat);
 401                 be_stat_ev("phis_before_spill", node_stat.n_phis);
 402         }
 403 #endif /* FIRM_STATISTICS */
 404
 405         /* put all ignore registers into the ignore register set. */
 406         be_put_ignore_regs(birg, pse->cls, chordal_env->ignore_colors);
 407
 408         be_pre_spill_prepare_constr(chordal_env);
 409         dump(BE_CH_DUMP_CONSTR, birg->irg, pse->cls, "-constr-pre", dump_ir_block_graph_sched);
 410
 411 #ifdef FIRM_STATISTICS
 412         if (be_stat_ev_is_active()) {
 413                 pse->pre_spill_cost = be_estimate_irg_costs(birg->irg,
 414                         birg->main_env->arch_env, birg->exec_freq);
 415         }
 416 #endif /* FIRM_STATISTICS */
 417 }
 418
 419 /**
 420  * Perform things which need to be done per register class after spilling.
 421  */
 422 static void post_spill(post_spill_env_t *pse) {
 423         be_chordal_env_t    *chordal_env = &pse->cenv;
 424         be_irg_t            *birg        = pse->birg;
 425         ir_graph            *irg         = birg->irg;
 426         const be_main_env_t *main_env    = birg->main_env;
 427         be_options_t        *main_opts   = main_env->options;
 428         static int          splitted     = 0;
 429         node_stat_t         node_stat;
 430
 431 #ifdef FIRM_STATISTICS
 432         if (be_stat_ev_is_active()) {
 433                 double spillcosts = be_estimate_irg_costs(irg, main_env->arch_env, birg->exec_freq) - pse->pre_spill_cost;
 434
 435                 be_stat_ev_l("spillcosts", (long) spillcosts);
 436
 437                 node_stats(birg, pse->cls, &node_stat);
 438                 be_stat_ev("phis_after_spill", node_stat.n_phis);
 439                 be_stat_ev("mem_phis", node_stat.n_mem_phis);
 440                 be_stat_ev("reloads", node_stat.n_reloads);
 441                 be_stat_ev("spills", node_stat.n_spills);
 442         }
 443 #endif /* FIRM_STATISTICS */
 444
 445         check_for_memory_operands(chordal_env);
 446
 447         be_abi_fix_stack_nodes(birg->abi, birg->lv);
 448
 449         BE_TIMER_PUSH(ra_timer.t_verify);
 450
 451         /* verify schedule and register pressure */
 452         if (chordal_env->opts->vrfy_option == BE_CH_VRFY_WARN) {
 453                 be_verify_schedule(irg);
 454                 be_verify_register_pressure(birg, pse->cls, irg);
 455         }
 456         else if (chordal_env->opts->vrfy_option == BE_CH_VRFY_ASSERT) {
 457                 assert(be_verify_schedule(irg) && "Schedule verification failed");
 458                 assert(be_verify_register_pressure(birg, pse->cls, irg)
 459                         && "Register pressure verification failed");
 460         }
 461         BE_TIMER_POP(ra_timer.t_verify);
 462
 463         if (be_elr_split && ! splitted) {
 464                 extreme_liverange_splitting(chordal_env);
 465                 splitted = 1;
 466         }
 467
 468         /* Color the graph. */
 469         BE_TIMER_PUSH(ra_timer.t_color);
 470         be_ra_chordal_color(chordal_env);
 471         BE_TIMER_POP(ra_timer.t_color);
 472
 473         dump(BE_CH_DUMP_CONSTR, irg, pse->cls, "-color", dump_ir_block_graph_sched);
 474
 475         /* Create the ifg with the selected flavor */
 476         BE_TIMER_PUSH(ra_timer.t_ifg);
 477         chordal_env->ifg = be_create_ifg(chordal_env);
 478         BE_TIMER_POP(ra_timer.t_ifg);
 479
 480 #ifdef FIRM_STATISTICS
 481         if (be_stat_ev_is_active()) {
 482                 be_ifg_stat_t stat;
 483
 484                 be_ifg_stat(birg, chordal_env->ifg, &stat);
 485                 be_stat_ev("ifg_nodes", stat.n_nodes);
 486                 be_stat_ev("ifg_edges", stat.n_edges);
 487                 be_stat_ev("ifg_comps", stat.n_comps);
 488
 489                 node_stats(birg, pse->cls, &node_stat);
 490                 be_stat_ev("perms_before_coal", node_stat.n_perms);
 491                 be_stat_ev("copies_before_coal", node_stat.n_copies);
 492         }
 493 #endif /* FIRM_STATISTICS */
 494
 495         /* copy minimization */
 496         BE_TIMER_PUSH(ra_timer.t_copymin);
 497         co_driver(chordal_env);
 498         BE_TIMER_POP(ra_timer.t_copymin);
 499
 500         dump(BE_CH_DUMP_COPYMIN, irg, pse->cls, "-copymin", dump_ir_block_graph_sched);
 501
 502         BE_TIMER_PUSH(ra_timer.t_ssa);
 503
 504         /* ssa destruction */
 505         be_ssa_destruction(chordal_env);
 506
 507         BE_TIMER_POP(ra_timer.t_ssa);
 508
 509         dump(BE_CH_DUMP_SSADESTR, irg, pse->cls, "-ssadestr", dump_ir_block_graph_sched);
 510
 511         BE_TIMER_PUSH(ra_timer.t_verify);
 512         if (chordal_env->opts->vrfy_option != BE_CH_VRFY_OFF) {
 513                 be_ssa_destruction_check(chordal_env);
 514         }
 515         BE_TIMER_POP(ra_timer.t_verify);
 516
 517         /* free some data structures */
 518         be_ifg_free(chordal_env->ifg);
 519         pmap_destroy(chordal_env->border_heads);
 520         bitset_free(chordal_env->ignore_colors);
 521
 522 #ifdef FIRM_STATISTICS
 523         if (be_stat_ev_is_active()) {
 524                 node_stats(birg, pse->cls, &node_stat);
 525                 be_stat_ev("perms_after_coal", node_stat.n_perms);
 526                 be_stat_ev("copies_after_coal", node_stat.n_copies);
 527                 be_stat_ev_pop();
 528         }
 529 #endif /* FIRM_STATISTICS */
 530 }
 531
 532 /**
 533  * Performs chordal register allocation for each register class on given irg.
 534  *
 535  * @param birg  Backend irg object
 536  * @return Structure containing timer for the single phases or NULL if no timing requested.
 537  */
 538 static void be_ra_chordal_main(be_irg_t *birg)
 539 {
 540         const be_main_env_t *main_env  = birg->main_env;
 541         const arch_isa_t    *isa       = arch_env_get_isa(main_env->arch_env);
 542         ir_graph            *irg       = birg->irg;
 543         be_options_t        *main_opts = main_env->options;
 544         int                 j, m;
 545         be_chordal_env_t    chordal_env;
 546
 547         BE_TIMER_INIT(main_opts);
 548         BE_TIMER_PUSH(ra_timer.t_other);
 549         BE_TIMER_PUSH(ra_timer.t_prolog);
 550
 551         be_assure_dom_front(birg);
 552         be_assure_liveness(birg);
 553
 554         chordal_env.opts      = &options;
 555         chordal_env.irg       = irg;
 556         chordal_env.birg      = birg;
 557         FIRM_DBG_REGISTER(chordal_env.dbg, "firm.be.chordal");
 558
 559         obstack_init(&chordal_env.obst);
 560
 561         BE_TIMER_POP(ra_timer.t_prolog);
 562
 563         be_stat_ev("insns_before", count_insns(irg));
 564
 565         if (! arch_code_generator_has_spiller(birg->cg)) {
 566                 /* use one of the generic spiller */
 567
 568                 /* Perform the following for each register class. */
 569                 for (j = 0, m = arch_isa_get_n_reg_class(isa); j < m; ++j) {
 570                         post_spill_env_t pse;
 571
 572                         memcpy(&pse.cenv, &chordal_env, sizeof(chordal_env));
 573                         pse.birg = birg;
 574                         pre_spill(isa, j, &pse);
 575
 576                         BE_TIMER_PUSH(ra_timer.t_spill);
 577                         be_do_spill(&pse.cenv);
 578                         BE_TIMER_POP(ra_timer.t_spill);
 579
 580                         dump(BE_CH_DUMP_SPILL, irg, pse.cls, "-spill", dump_ir_block_graph_sched);
 581
 582                         post_spill(&pse);
 583                 }
 584         }
 585         else {
 586                 post_spill_env_t *pse;
 587
 588                 /* the backend has it's own spiller */
 589                 m = arch_isa_get_n_reg_class(isa);
 590
 591                 pse = alloca(m * sizeof(pse[0]));
 592
 593                 for (j = 0; j < m; ++j) {
 594                         memcpy(&pse[j].cenv, &chordal_env, sizeof(chordal_env));
 595                         pse[j].birg = birg;
 596                         pre_spill(isa, j, &pse[j]);
 597                 }
 598
 599                 BE_TIMER_PUSH(ra_timer.t_spill);
 600                 arch_code_generator_spill(birg->cg, birg);
 601                 BE_TIMER_POP(ra_timer.t_spill);
 602                 dump(BE_CH_DUMP_SPILL, irg, NULL, "-spill", dump_ir_block_graph_sched);
 603
 604                 for (j = 0; j < m; ++j) {
 605                         post_spill(&pse[j]);
 606                 }
 607         }
 608
 609         BE_TIMER_PUSH(ra_timer.t_spillslots);
 610
 611         be_coalesce_spillslots(&chordal_env);
 612         dump(BE_CH_DUMP_SPILLSLOTS, irg, NULL, "-spillslots", dump_ir_block_graph_sched);
 613
 614         BE_TIMER_POP(ra_timer.t_spillslots);
 615
 616         BE_TIMER_PUSH(ra_timer.t_verify);
 617         /* verify spillslots */
 618         if (options.vrfy_option == BE_CH_VRFY_WARN) {
 619                 be_verify_spillslots(main_env->arch_env, irg);
 620         }
 621         else if (options.vrfy_option == BE_CH_VRFY_ASSERT) {
 622                 assert(be_verify_spillslots(main_env->arch_env, irg) && "Spillslot verification failed");
 623         }
 624         BE_TIMER_POP(ra_timer.t_verify);
 625
 626         BE_TIMER_PUSH(ra_timer.t_epilog);
 627         dump(BE_CH_DUMP_LOWER, irg, NULL, "-spilloff", dump_ir_block_graph_sched);
 628
 629         lower_nodes_after_ra(birg, options.lower_perm_opt & BE_CH_LOWER_PERM_COPY ? 1 : 0);
 630         dump(BE_CH_DUMP_LOWER, irg, NULL, "-belower-after-ra", dump_ir_block_graph_sched);
 631
 632         obstack_free(&chordal_env.obst, NULL);
 633         BE_TIMER_POP(ra_timer.t_epilog);
 634
 635         BE_TIMER_POP(ra_timer.t_other);
 636
 637         be_stat_ev("insns_after", count_insns(irg));
 638
 639         return;
 640 }
 641
 642 static be_ra_t be_ra_chordal_allocator = {
 643         be_ra_chordal_main,
 644 };
 645
 646 void be_init_chordal(void)
 647 {
 648         lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
 649         lc_opt_entry_t *ra_grp = lc_opt_get_grp(be_grp, "ra");
 650         lc_opt_entry_t *chordal_grp = lc_opt_get_grp(ra_grp, "chordal");
 651
 652         lc_opt_add_table(chordal_grp, be_chordal_options);
 653
 654         be_register_allocator("chordal", &be_ra_chordal_allocator);
 655 }
 656
 657 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_chordal);