nsz Git - libfirm/blob - ir/be/bechordal_main.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       Driver for the chordal register allocator.
  23  * @author      Sebastian Hack
  24  * @date        29.11.2005
  25  * @version     $Id$
  26  */
  27 #include "config.h"
  28
  29 #include <stdlib.h>
  30 #include <time.h>
  31
  32 #include "obst.h"
  33 #include "pset.h"
  34 #include "list.h"
  35 #include "bitset.h"
  36 #include "iterator.h"
  37
  38 #include "lc_opts.h"
  39 #include "lc_opts_enum.h"
  40
  41 #include "ircons_t.h"
  42 #include "irmode_t.h"
  43 #include "irgraph_t.h"
  44 #include "irprintf_t.h"
  45 #include "irgwalk.h"
  46 #include "ircons.h"
  47 #include "irdump.h"
  48 #include "irdom.h"
  49 #include "ircons.h"
  50 #include "irbitset.h"
  51 #include "irnode.h"
  52 #include "ircons.h"
  53 #include "debug.h"
  54 #include "execfreq.h"
  55 #include "iredges_t.h"
  56 #include "error.h"
  57
  58 #include "bechordal_t.h"
  59 #include "beabi.h"
  60 #include "beutil.h"
  61 #include "besched.h"
  62 #include "besched.h"
  63 #include "belive_t.h"
  64 #include "bearch.h"
  65 #include "beifg.h"
  66 #include "benode.h"
  67 #include "bestatevent.h"
  68 #include "bestat.h"
  69 #include "bemodule.h"
  70 #include "be_t.h"
  71 #include "bera.h"
  72 #include "beirg.h"
  73 #include "bedump_minir.h"
  74
  75 #include "bespillslots.h"
  76 #include "bespill.h"
  77 #include "belower.h"
  78
  79 #include "becopystat.h"
  80 #include "becopyopt.h"
  81 #include "bessadestr.h"
  82 #include "beverify.h"
  83 #include "benode.h"
  84
  85 #include "bepbqpcoloring.h"
  86
  87 static be_ra_chordal_opts_t options = {
  88         BE_CH_DUMP_NONE,
  89         BE_CH_LOWER_PERM_SWAP,
  90         BE_CH_VRFY_WARN,
  91         "",
  92         ""
  93 };
  94
  95 typedef struct _post_spill_env_t {
  96         be_chordal_env_t            cenv;
  97         ir_graph                    *irg;
  98         const arch_register_class_t *cls;
  99         double                      pre_spill_cost;
 100 } post_spill_env_t;
 101
 102 static const lc_opt_enum_int_items_t lower_perm_items[] = {
 103         { "copy", BE_CH_LOWER_PERM_COPY },
 104         { "swap", BE_CH_LOWER_PERM_SWAP },
 105         { NULL, 0 }
 106 };
 107
 108 static const lc_opt_enum_int_items_t lower_perm_stat_items[] = {
 109         { NULL, 0 }
 110 };
 111
 112 static const lc_opt_enum_int_items_t dump_items[] = {
 113         { "none",       BE_CH_DUMP_NONE       },
 114         { "spill",      BE_CH_DUMP_SPILL      },
 115         { "live",       BE_CH_DUMP_LIVE       },
 116         { "color",      BE_CH_DUMP_COLOR      },
 117         { "copymin",    BE_CH_DUMP_COPYMIN    },
 118         { "ssadestr",   BE_CH_DUMP_SSADESTR   },
 119         { "tree",       BE_CH_DUMP_TREE_INTV  },
 120         { "constr",     BE_CH_DUMP_CONSTR     },
 121         { "lower",      BE_CH_DUMP_LOWER      },
 122         { "spillslots", BE_CH_DUMP_SPILLSLOTS },
 123         { "appel",      BE_CH_DUMP_APPEL      },
 124         { "all",        BE_CH_DUMP_ALL        },
 125         { NULL, 0 }
 126 };
 127
 128 static const lc_opt_enum_int_items_t be_ch_vrfy_items[] = {
 129         { "off",    BE_CH_VRFY_OFF    },
 130         { "warn",   BE_CH_VRFY_WARN   },
 131         { "assert", BE_CH_VRFY_ASSERT },
 132         { NULL, 0 }
 133 };
 134
 135 static lc_opt_enum_int_var_t lower_perm_var = {
 136         &options.lower_perm_opt, lower_perm_items
 137 };
 138
 139 static lc_opt_enum_int_var_t dump_var = {
 140         &options.dump_flags, dump_items
 141 };
 142
 143 static lc_opt_enum_int_var_t be_ch_vrfy_var = {
 144         &options.vrfy_option, be_ch_vrfy_items
 145 };
 146
 147 static char minir_file[256] = "";
 148
 149 static const lc_opt_table_entry_t be_chordal_options[] = {
 150         LC_OPT_ENT_ENUM_PTR ("perm",          "perm lowering options", &lower_perm_var),
 151         LC_OPT_ENT_ENUM_MASK("dump",          "select dump phases", &dump_var),
 152         LC_OPT_ENT_ENUM_PTR ("verify",        "verify options", &be_ch_vrfy_var),
 153         LC_OPT_ENT_STR      ("minirout",      "dump MinIR to file", minir_file, sizeof(minir_file)),
 154         LC_OPT_LAST
 155 };
 156
 157 static be_module_list_entry_t *colorings = NULL;
 158 static const be_ra_chordal_coloring_t *selected_coloring = NULL;
 159
 160 void be_register_chordal_coloring(const char *name, be_ra_chordal_coloring_t *coloring)
 161 {
 162         if (selected_coloring == NULL)
 163                 selected_coloring = coloring;
 164
 165         be_add_module_to_list(&colorings, name, coloring);
 166 }
 167
 168 static void be_ra_chordal_coloring(be_chordal_env_t *env)
 169 {
 170         assert(selected_coloring != NULL);
 171         if (selected_coloring != NULL) {
 172                 selected_coloring->allocate(env);
 173         }
 174 }
 175
 176 static void dump(unsigned mask, ir_graph *irg,
 177                                  const arch_register_class_t *cls,
 178                                  const char *suffix)
 179 {
 180         if ((options.dump_flags & mask) == mask) {
 181                 if (cls) {
 182                         char buf[256];
 183                         snprintf(buf, sizeof(buf), "%s-%s", cls->name, suffix);
 184                         dump_ir_graph(irg, buf);
 185                 } else {
 186                         dump_ir_graph(irg, suffix);
 187                 }
 188         }
 189 }
 190
 191 /**
 192  * Checks for every reload if its user can perform the load on itself.
 193  */
 194 static void memory_operand_walker(ir_node *irn, void *env)
 195 {
 196         const ir_edge_t  *edge, *ne;
 197         ir_node          *block;
 198         ir_node          *spill;
 199
 200         (void)env;
 201
 202         if (! be_is_Reload(irn))
 203                 return;
 204
 205         /* only use memory operands, if the reload is only used by 1 node */
 206         if (get_irn_n_edges(irn) > 1)
 207                 return;
 208
 209         spill = be_get_Reload_mem(irn);
 210         block = get_nodes_block(irn);
 211
 212         foreach_out_edge_safe(irn, edge, ne) {
 213                 ir_node *src = get_edge_src_irn(edge);
 214                 int     pos  = get_edge_src_pos(edge);
 215
 216                 assert(src && "outedges broken!");
 217
 218                 if (get_nodes_block(src) == block && arch_possible_memory_operand(src, pos)) {
 219                         arch_perform_memory_operand(src, spill, pos);
 220                 }
 221         }
 222
 223         /* kill the Reload */
 224         if (get_irn_n_edges(irn) == 0) {
 225                 sched_remove(irn);
 226                 set_irn_n(irn, be_pos_Reload_mem, new_Bad());
 227                 set_irn_n(irn, be_pos_Reload_frame, new_Bad());
 228         }
 229 }
 230
 231 /**
 232  * Starts a walk for memory operands if supported by the backend.
 233  */
 234 void check_for_memory_operands(ir_graph *irg)
 235 {
 236         irg_walk_graph(irg, NULL, memory_operand_walker, NULL);
 237 }
 238
 239
 240 static be_node_stats_t last_node_stats;
 241
 242 /**
 243  * Perform things which need to be done per register class before spilling.
 244  */
 245 static void pre_spill(post_spill_env_t *pse, const arch_register_class_t *cls)
 246 {
 247         be_chordal_env_t *chordal_env = &pse->cenv;
 248         ir_graph         *irg         = pse->irg;
 249         ir_exec_freq     *exec_freq   = be_get_irg_exec_freq(irg);
 250
 251         pse->cls                   = cls;
 252         chordal_env->cls           = cls;
 253         chordal_env->border_heads  = pmap_create();
 254         chordal_env->ignore_colors = bitset_malloc(chordal_env->cls->n_regs);
 255
 256         be_assure_liveness(irg);
 257         be_liveness_assure_chk(be_get_irg_liveness(irg));
 258
 259         stat_ev_do(pse->pre_spill_cost = be_estimate_irg_costs(irg, exec_freq));
 260
 261         /* put all ignore registers into the ignore register set. */
 262         be_put_ignore_regs(irg, pse->cls, chordal_env->ignore_colors);
 263
 264         be_timer_push(T_RA_CONSTR);
 265         be_pre_spill_prepare_constr(irg, chordal_env->cls);
 266         be_timer_pop(T_RA_CONSTR);
 267
 268         dump(BE_CH_DUMP_CONSTR, irg, pse->cls, "constr-pre");
 269 }
 270
 271 /**
 272  * Perform things which need to be done per register class after spilling.
 273  */
 274 static void post_spill(post_spill_env_t *pse, int iteration)
 275 {
 276         be_chordal_env_t    *chordal_env = &pse->cenv;
 277         ir_graph            *irg         = pse->irg;
 278         ir_exec_freq        *exec_freq   = be_get_irg_exec_freq(irg);
 279         int                  colors_n    = arch_register_class_n_regs(chordal_env->cls);
 280         int             allocatable_regs
 281                 = colors_n - be_put_ignore_regs(irg, chordal_env->cls, NULL);
 282
 283         /* some special classes contain only ignore regs, no work to be done */
 284         if (allocatable_regs > 0) {
 285                 stat_ev_dbl("bechordal_spillcosts", be_estimate_irg_costs(irg, exec_freq) - pse->pre_spill_cost);
 286
 287                 /*
 288                         If we have a backend provided spiller, post spill is
 289                         called in a loop after spilling for each register class.
 290                         But we only need to fix stack nodes once in this case.
 291                 */
 292                 be_timer_push(T_RA_SPILL_APPLY);
 293                 check_for_memory_operands(irg);
 294                 if (iteration == 0) {
 295                         be_abi_fix_stack_nodes(be_get_irg_abi(irg));
 296                 }
 297                 be_timer_pop(T_RA_SPILL_APPLY);
 298
 299
 300                 /* verify schedule and register pressure */
 301                 be_timer_push(T_VERIFY);
 302                 if (chordal_env->opts->vrfy_option == BE_CH_VRFY_WARN) {
 303                         be_verify_schedule(irg);
 304                         be_verify_register_pressure(irg, pse->cls);
 305                 } else if (chordal_env->opts->vrfy_option == BE_CH_VRFY_ASSERT) {
 306                         assert(be_verify_schedule(irg) && "Schedule verification failed");
 307                         assert(be_verify_register_pressure(irg, pse->cls)
 308                                 && "Register pressure verification failed");
 309                 }
 310                 be_timer_pop(T_VERIFY);
 311
 312                 /* Color the graph. */
 313                 be_timer_push(T_RA_COLOR);
 314                 be_ra_chordal_coloring(chordal_env);
 315                 be_timer_pop(T_RA_COLOR);
 316
 317                 dump(BE_CH_DUMP_CONSTR, irg, pse->cls, "color");
 318
 319                 /* Create the ifg with the selected flavor */
 320                 be_timer_push(T_RA_IFG);
 321                 chordal_env->ifg = be_create_ifg(chordal_env);
 322                 be_timer_pop(T_RA_IFG);
 323
 324                 stat_ev_if {
 325                         be_ifg_stat_t   stat;
 326                         be_node_stats_t node_stats;
 327
 328                         be_ifg_stat(irg, chordal_env->ifg, &stat);
 329                         stat_ev_dbl("bechordal_ifg_nodes", stat.n_nodes);
 330                         stat_ev_dbl("bechordal_ifg_edges", stat.n_edges);
 331                         stat_ev_dbl("bechordal_ifg_comps", stat.n_comps);
 332
 333                         be_collect_node_stats(&node_stats, irg);
 334                         be_subtract_node_stats(&node_stats, &last_node_stats);
 335
 336                         stat_ev_dbl("bechordal_perms_before_coal",
 337                                         node_stats[BE_STAT_PERMS]);
 338                         stat_ev_dbl("bechordal_copies_before_coal",
 339                                         node_stats[BE_STAT_COPIES]);
 340                 }
 341
 342                 be_timer_push(T_RA_COPYMIN);
 343                 if (minir_file[0] != '\0') {
 344                         FILE *out;
 345
 346                         if (strcmp(minir_file, "-") == 0) {
 347                                 out = stdout;
 348                         } else {
 349                                 out = fopen(minir_file, "w");
 350                                 if (out == NULL) {
 351                                         panic("Cound't open minir output '%s'", minir_file);
 352                                 }
 353                         }
 354
 355                         be_export_minir(out, irg);
 356                         if (out != stdout)
 357                                 fclose(out);
 358                 }
 359                 co_driver(chordal_env);
 360                 be_timer_pop(T_RA_COPYMIN);
 361
 362                 dump(BE_CH_DUMP_COPYMIN, irg, pse->cls, "copymin");
 363
 364                 /* ssa destruction */
 365                 be_timer_push(T_RA_SSA);
 366                 be_ssa_destruction(chordal_env);
 367                 be_timer_pop(T_RA_SSA);
 368
 369                 dump(BE_CH_DUMP_SSADESTR, irg, pse->cls, "ssadestr");
 370
 371                 if (chordal_env->opts->vrfy_option != BE_CH_VRFY_OFF) {
 372                         be_timer_push(T_VERIFY);
 373                         be_ssa_destruction_check(chordal_env);
 374                         be_timer_pop(T_VERIFY);
 375                 }
 376
 377                 /* the ifg exists only if there are allocatable regs */
 378                 be_ifg_free(chordal_env->ifg);
 379         }
 380
 381         /* free some always allocated data structures */
 382         pmap_destroy(chordal_env->border_heads);
 383         bitset_free(chordal_env->ignore_colors);
 384 }
 385
 386 /**
 387  * Performs chordal register allocation for each register class on given irg.
 388  *
 389  * @param irg    the graph
 390  * @return Structure containing timer for the single phases or NULL if no
 391  *         timing requested.
 392  */
 393 static void be_ra_chordal_main(ir_graph *irg)
 394 {
 395         const arch_env_t *arch_env = be_get_irg_arch_env(irg);
 396         int               j;
 397         int               m;
 398         be_chordal_env_t  chordal_env;
 399         struct obstack    obst;
 400
 401         be_timer_push(T_RA_OTHER);
 402
 403         be_timer_push(T_RA_PROLOG);
 404
 405         be_assure_liveness(irg);
 406
 407         chordal_env.obst          = &obst;
 408         chordal_env.opts          = &options;
 409         chordal_env.irg           = irg;
 410         chordal_env.border_heads  = NULL;
 411         chordal_env.ifg           = NULL;
 412         chordal_env.ignore_colors = NULL;
 413
 414         obstack_init(&obst);
 415
 416         be_timer_pop(T_RA_PROLOG);
 417
 418         stat_ev_if {
 419                 be_collect_node_stats(&last_node_stats, irg);
 420         }
 421
 422         if (! arch_code_generator_has_spiller(be_get_irg_cg(irg))) {
 423                 /* use one of the generic spiller */
 424
 425                 /* Perform the following for each register class. */
 426                 for (j = 0, m = arch_env_get_n_reg_class(arch_env); j < m; ++j) {
 427                         post_spill_env_t pse;
 428                         const arch_register_class_t *cls
 429                                 = arch_env_get_reg_class(arch_env, j);
 430
 431                         if (arch_register_class_flags(cls) & arch_register_class_flag_manual_ra)
 432                                 continue;
 433
 434
 435                         stat_ev_ctx_push_str("bechordal_cls", cls->name);
 436
 437                         stat_ev_if {
 438                                 be_do_stat_reg_pressure(irg, cls);
 439                         }
 440
 441                         memcpy(&pse.cenv, &chordal_env, sizeof(chordal_env));
 442                         pse.irg = irg;
 443                         pre_spill(&pse, cls);
 444
 445                         be_timer_push(T_RA_SPILL);
 446                         be_do_spill(irg, cls);
 447                         be_timer_pop(T_RA_SPILL);
 448
 449                         dump(BE_CH_DUMP_SPILL, irg, pse.cls, "spill");
 450
 451                         post_spill(&pse, 0);
 452
 453                         stat_ev_if {
 454                                 be_node_stats_t node_stats;
 455
 456                                 be_collect_node_stats(&node_stats, irg);
 457                                 be_subtract_node_stats(&node_stats, &last_node_stats);
 458                                 be_emit_node_stats(&node_stats, "bechordal_");
 459
 460                                 be_copy_node_stats(&last_node_stats, &node_stats);
 461                                 stat_ev_ctx_pop("bechordal_cls");
 462                         }
 463                 }
 464         } else {
 465                 post_spill_env_t *pse;
 466
 467                 /* the backend has its own spiller */
 468                 m = arch_env_get_n_reg_class(arch_env);
 469
 470                 pse = ALLOCAN(post_spill_env_t, m);
 471
 472                 for (j = 0; j < m; ++j) {
 473                         memcpy(&pse[j].cenv, &chordal_env, sizeof(chordal_env));
 474                         pse[j].irg = irg;
 475                         pre_spill(&pse[j], pse[j].cls);
 476                 }
 477
 478                 be_timer_push(T_RA_SPILL);
 479                 arch_code_generator_spill(be_get_irg_cg(irg), be_birg_from_irg(irg));
 480                 be_timer_pop(T_RA_SPILL);
 481                 dump(BE_CH_DUMP_SPILL, irg, NULL, "spill");
 482
 483                 for (j = 0; j < m; ++j) {
 484                         post_spill(&pse[j], j);
 485                 }
 486         }
 487
 488         be_timer_push(T_VERIFY);
 489         if (chordal_env.opts->vrfy_option == BE_CH_VRFY_WARN) {
 490                 be_verify_register_allocation(irg);
 491         } else if (chordal_env.opts->vrfy_option == BE_CH_VRFY_ASSERT) {
 492                 assert(be_verify_register_allocation(irg)
 493                                 && "Register allocation invalid");
 494         }
 495         be_timer_pop(T_VERIFY);
 496
 497         be_timer_push(T_RA_EPILOG);
 498         lower_nodes_after_ra(irg,
 499                              options.lower_perm_opt&BE_CH_LOWER_PERM_COPY ? 1 : 0);
 500         dump(BE_CH_DUMP_LOWER, irg, NULL, "belower-after-ra");
 501
 502         obstack_free(&obst, NULL);
 503         be_liveness_invalidate(be_get_irg_liveness(irg));
 504         be_timer_pop(T_RA_EPILOG);
 505
 506         be_timer_pop(T_RA_OTHER);
 507 }
 508
 509 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_chordal_main);
 510 void be_init_chordal_main(void)
 511 {
 512         static be_ra_t be_ra_chordal_allocator = {
 513                 be_ra_chordal_main,
 514         };
 515
 516         lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
 517         lc_opt_entry_t *ra_grp = lc_opt_get_grp(be_grp, "ra");
 518         lc_opt_entry_t *chordal_grp = lc_opt_get_grp(ra_grp, "chordal");
 519
 520         be_register_allocator("chordal", &be_ra_chordal_allocator);
 521
 522         lc_opt_add_table(chordal_grp, be_chordal_options);
 523         be_add_module_list_opt(chordal_grp, "coloring", "select coloring methode", &colorings, (void**) &selected_coloring);
 524 }