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