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

   1 /**
   2  * Backend driver.
   3  * @author Sebastian Hack
   4  * @date   25.11.2004
   5  * @cvsid  $Id$
   6  */
   7 #ifdef HAVE_CONFIG_H
   8 #include "config.h"
   9 #endif
  10
  11 #include <stdarg.h>
  12
  13 #ifdef WITH_LIBCORE
  14 #include <libcore/lc_opts.h>
  15 #include <libcore/lc_opts_enum.h>
  16 #include <libcore/lc_timing.h>
  17 #endif /* WITH_LIBCORE */
  18
  19 #include "obst.h"
  20 #include "bitset.h"
  21
  22 #include "irprog.h"
  23 #include "irgopt.h"
  24 #include "irgraph.h"
  25 #include "irdump.h"
  26 #include "phiclass.h"
  27 #include "irdom_t.h"
  28 #include "iredges_t.h"
  29 #include "irloop_t.h"
  30 #include "irtools.h"
  31 #include "irvrfy.h"
  32 #include "return.h"
  33 #include "firmstat.h"
  34
  35 #include "bearch.h"
  36 #include "firm/bearch_firm.h"
  37 #include "ia32/bearch_ia32.h"
  38 #include "arm/bearch_arm.h"
  39 #include "ppc32/bearch_ppc32.h"
  40 #include "mips/bearch_mips.h"
  41
  42 #include "be_t.h"
  43 #include "benumb_t.h"
  44 #include "beutil.h"
  45 #include "benode_t.h"
  46 #include "beirgmod.h"
  47 #include "besched_t.h"
  48 #include "belistsched.h"
  49 #include "belive_t.h"
  50 #include "bespillbelady.h"
  51 #include "bera.h"
  52 #include "beraextern.h"
  53 #include "bechordal_t.h"
  54 #include "beifg.h"
  55 #include "beifg_impl.h"
  56 #include "becopyopt.h"
  57 #include "becopystat.h"
  58 #include "bessadestr.h"
  59 #include "beabi.h"
  60 #include "belower.h"
  61 #include "beschedmris.h"
  62 #include "bestat.h"
  63 #include "beverify.h"
  64 #include "beprofile.h"
  65
  66 /* options visible for anyone */
  67 static be_options_t be_options = {
  68         DUMP_NONE,                         /* dump flags */
  69         BE_TIME_OFF,                       /* no timing */
  70         BE_SCHED_SELECT_HEUR,              /* mueller heuristic selector */
  71         0,                                 /* no opt profile */
  72         0,                                 /* disable mris */
  73         1,                                 /* try to omit frame pointer */
  74         BE_VRFY_WARN,                      /* verification level: warn */
  75         "i44pc52.info.uni-karlsruhe.de",   /* ilp server */
  76         "cplex"                            /* ilp solver */
  77 };
  78
  79 /* config file. */
  80 static char config_file[256] = { 0 };
  81
  82 /* register allocator to use. */
  83 static const be_ra_t *ra = &be_ra_chordal_allocator;
  84
  85 /* back end instruction set architecture to use */
  86 static const arch_isa_if_t *isa_if = &ia32_isa_if;
  87
  88 #ifdef WITH_LIBCORE
  89
  90 static lc_opt_entry_t *be_grp_root = NULL;
  91
  92 /* possible dumping options */
  93 static const lc_opt_enum_mask_items_t dump_items[] = {
  94         { "none",       DUMP_NONE },
  95         { "initial",    DUMP_INITIAL },
  96         { "abi",        DUMP_ABI    },
  97         { "sched",      DUMP_SCHED  },
  98         { "prepared",   DUMP_PREPARED },
  99         { "regalloc",   DUMP_RA },
 100         { "final",      DUMP_FINAL },
 101         { "be",         DUMP_BE },
 102         { "all",        2 * DUMP_BE - 1 },
 103         { NULL,         0 }
 104 };
 105
 106 /* register allocators */
 107 static const lc_opt_enum_const_ptr_items_t ra_items[] = {
 108         { "chordal",  &be_ra_chordal_allocator },
 109         { "external", &be_ra_external_allocator },
 110         { NULL,      NULL }
 111 };
 112
 113 /* instruction set architectures. */
 114 static const lc_opt_enum_const_ptr_items_t isa_items[] = {
 115         { "ia32",    &ia32_isa_if },
 116 #if 0
 117         { "arm",     &arm_isa_if },
 118         { "ppc32",   &ppc32_isa_if },
 119         { "mips",    &mips_isa_if },
 120 #endif
 121         { NULL,      NULL }
 122 };
 123
 124 /* verify options. */
 125 static const lc_opt_enum_int_items_t vrfy_items[] = {
 126         { "off",    BE_VRFY_OFF    },
 127         { "warn",   BE_VRFY_WARN   },
 128         { "assert", BE_VRFY_ASSERT },
 129         { NULL,     0 }
 130 };
 131
 132 /* schedule selector options. */
 133 static const lc_opt_enum_int_items_t sched_select_items[] = {
 134         { "trivial",  BE_SCHED_SELECT_TRIVIAL  },
 135         { "regpress", BE_SCHED_SELECT_REGPRESS },
 136         { "muchnik",  BE_SCHED_SELECT_MUCHNIK  },
 137         { "heur",     BE_SCHED_SELECT_HEUR     },
 138         { "hmuchnik", BE_SCHED_SELECT_HMUCHNIK },
 139         { NULL,     0 }
 140 };
 141
 142 static lc_opt_enum_mask_var_t dump_var = {
 143         &be_options.dump_flags, dump_items
 144 };
 145
 146 static lc_opt_enum_const_ptr_var_t ra_var = {
 147         (const void **) &ra, ra_items
 148 };
 149
 150 static lc_opt_enum_const_ptr_var_t isa_var = {
 151         (const void **) &isa_if, isa_items
 152 };
 153
 154 static lc_opt_enum_int_var_t vrfy_var = {
 155         &be_options.vrfy_option, vrfy_items
 156 };
 157
 158 static lc_opt_enum_int_var_t sched_select_var = {
 159         &be_options.sched_select, sched_select_items
 160 };
 161
 162 static const lc_opt_table_entry_t be_main_options[] = {
 163         LC_OPT_ENT_STR      ("config",       "read another config file containing backend options",                 config_file, sizeof(config_file)),
 164         LC_OPT_ENT_ENUM_MASK("dump",         "dump irg on several occasions",                                       &dump_var),
 165         LC_OPT_ENT_ENUM_PTR ("ra",           "register allocator",                                                  &ra_var),
 166         LC_OPT_ENT_ENUM_PTR ("isa",          "the instruction set architecture",                                    &isa_var),
 167         LC_OPT_ENT_NEGBOOL  ("noomitfp",     "do not omit frame pointer",                                           &be_options.omit_fp),
 168         LC_OPT_ENT_ENUM_PTR ("vrfy",         "verify the backend irg (off, warn, assert)",                          &vrfy_var),
 169         LC_OPT_ENT_BOOL     ("time",         "get backend timing statistics",                                       &be_options.timing),
 170         LC_OPT_ENT_BOOL     ("profile",      "instrument the code for execution count profiling",                   &be_options.opt_profile),
 171         LC_OPT_ENT_BOOL     ("sched.mris",   "enable mris schedule preparation",                                    &be_options.mris),
 172         LC_OPT_ENT_ENUM_PTR ("sched.select", "schedule node selector (trivial, regpress, muchnik, heur, hmuchnik)", &sched_select_var),
 173
 174 #ifdef WITH_ILP
 175         LC_OPT_ENT_STR ("ilp.server", "the ilp server name", be_options.ilp_server, sizeof(be_options.ilp_server)),
 176         LC_OPT_ENT_STR ("ilp.solver", "the ilp solver name", be_options.ilp_solver, sizeof(be_options.ilp_solver)),
 177 #endif /* WITH_ILP */
 178         { NULL }
 179 };
 180
 181 #endif /* WITH_LIBCORE */
 182
 183 void be_opt_register(void)
 184 {
 185 #ifdef WITH_LIBCORE
 186         int i;
 187         lc_opt_entry_t *be_grp_ra;
 188         static int run_once = 0;
 189
 190         if (! run_once) {
 191                 run_once    = 1;
 192                 be_grp_root = lc_opt_get_grp(firm_opt_get_root(), "be");
 193                 be_grp_ra   = lc_opt_get_grp(be_grp_root, "ra");
 194
 195                 lc_opt_add_table(be_grp_root, be_main_options);
 196
 197                 /* register allocator options */
 198                 for(i = 0; ra_items[i].name != NULL; ++i) {
 199                         const be_ra_t *ra = ra_items[i].value;
 200                         ra->register_options(be_grp_ra);
 201                 }
 202
 203                 /* register isa options */
 204                 for(i = 0; isa_items[i].name != NULL; ++i) {
 205                         const arch_isa_if_t *isa = isa_items[i].value;
 206                         isa->register_options(be_grp_root);
 207                 }
 208         }
 209 #endif /* WITH_LIBCORE */
 210 }
 211
 212 /* Parse one argument. */
 213 int be_parse_arg(const char *arg) {
 214 #ifdef WITH_LIBCORE
 215         if (strcmp(arg, "help") == 0 || (arg[0] == '?' && arg[1] == '\0')) {
 216                 lc_opt_print_help(be_grp_root, stdout);
 217                 return -1;
 218         }
 219         return lc_opt_from_single_arg(be_grp_root, NULL, arg, NULL);
 220 #else
 221         return 0;
 222 #endif /* WITH_LIBCORE */
 223 }
 224
 225 /** The be parameters returned by default, all off. */
 226 const static backend_params be_params = {
 227         NULL,
 228         NULL,
 229         0,
 230         NULL,
 231 };
 232
 233 /* Perform schedule verification if requested. */
 234 static void be_sched_vrfy(ir_graph *irg, int vrfy_opt) {
 235         if (vrfy_opt == BE_VRFY_WARN) {
 236                 be_verify_schedule(irg);
 237         }
 238         else if (vrfy_opt == BE_VRFY_ASSERT) {
 239                 assert(be_verify_schedule(irg) && "Schedule verification failed.");
 240         }
 241 }
 242
 243 /* Initialize the Firm backend. Must be run BEFORE init_firm()! */
 244 const backend_params *be_init(void)
 245 {
 246         be_opt_register();
 247
 248         be_sched_init();
 249         be_numbering_init();
 250         be_copy_opt_init();
 251         copystat_init();
 252         phi_class_init();
 253
 254         if (isa_if->get_params)
 255                 return isa_if->get_params();
 256         return &be_params;
 257 }
 258
 259 /**
 260  * Initializes the main environment for the backend.
 261  *
 262  * @param env          an empty environment
 263  * @param file_handle  the file handle where the output will be written to
 264  */
 265 static be_main_env_t *be_init_env(be_main_env_t *env, FILE *file_handle)
 266 {
 267         memset(env, 0, sizeof(*env));
 268         obstack_init(&env->obst);
 269         env->arch_env = obstack_alloc(&env->obst, sizeof(env->arch_env[0]));
 270         env->options  = &be_options;
 271         FIRM_DBG_REGISTER(env->dbg, "be.main");
 272
 273         arch_env_init(env->arch_env, isa_if, file_handle, env);
 274
 275         /* Register the irn handler of the architecture */
 276         if (arch_isa_get_irn_handler(env->arch_env->isa))
 277                 arch_env_push_irn_handler(env->arch_env, arch_isa_get_irn_handler(env->arch_env->isa));
 278
 279         /*
 280          * Register the node handler of the back end infrastructure.
 281          * This irn handler takes care of the platform independent
 282          * spill, reload and perm nodes.
 283          */
 284         arch_env_push_irn_handler(env->arch_env, &be_node_irn_handler);
 285         env->phi_handler = be_phi_handler_new(env->arch_env);
 286         arch_env_push_irn_handler(env->arch_env, env->phi_handler);
 287
 288         return env;
 289 }
 290
 291 static void be_done_env(be_main_env_t *env)
 292 {
 293         env->arch_env->isa->impl->done(env->arch_env->isa);
 294         be_phi_handler_free(env->phi_handler);
 295         obstack_free(&env->obst, NULL);
 296 }
 297
 298 /**
 299  * A wrapper around a firm dumper. Dumps only, if
 300  * flags are enabled.
 301  *
 302  * @param mask    a bitmask containing the reason what will be dumped
 303  * @param irg     the IR graph to dump
 304  * @param suffix  the suffix for the dumper
 305  * @param dumper  the dumper to be called
 306  */
 307 static void dump(int mask, ir_graph *irg, const char *suffix,
 308                  void (*dumper)(ir_graph *, const char *))
 309 {
 310         if(be_options.dump_flags & mask)
 311                 be_dump(irg, suffix, dumper);
 312 }
 313
 314 /**
 315  * Prepare a backend graph for code generation.
 316  */
 317 static void prepare_graph(be_irg_t *birg)
 318 {
 319         ir_graph *irg = birg->irg;
 320
 321         /* Normalize proj nodes. */
 322         normalize_proj_nodes(irg);
 323
 324         /* Make just one return node. */
 325         normalize_one_return(irg);
 326
 327         /* Remove critical edges */
 328         remove_critical_cf_edges(irg);
 329
 330         /* Compute the dominance information. */
 331         free_dom(irg);
 332         compute_doms(irg);
 333
 334         /* Ensure, that the ir_edges are computed. */
 335         edges_assure(irg);
 336
 337         /* check, if the dominance property is fulfilled. */
 338         be_check_dominance(irg);
 339
 340         /* reset the phi handler. */
 341         be_phi_handler_reset(birg->main_env->phi_handler);
 342 }
 343
 344 #ifdef WITH_LIBCORE
 345
 346 #define BE_TIMER_PUSH(timer)                                                        \
 347         if (be_options.timing == BE_TIME_ON) {                                          \
 348                 int res = lc_timer_push(timer);                                             \
 349                 if (be_options.vrfy_option == BE_VRFY_ASSERT)                               \
 350                         assert(res && "Timer already on stack, cannot be pushed twice.");       \
 351                 else if (be_options.vrfy_option == BE_VRFY_WARN && ! res)                   \
 352                         fprintf(stderr, "Timer %s already on stack, cannot be pushed twice.\n", \
 353                                 lc_timer_get_name(timer));                                          \
 354         }
 355 #define BE_TIMER_POP(timer)                                                                    \
 356         if (be_options.timing == BE_TIME_ON) {                                                     \
 357                 lc_timer_t *tmp = lc_timer_pop();                                                      \
 358                 if (be_options.vrfy_option == BE_VRFY_ASSERT)                                          \
 359                         assert(tmp == timer && "Attempt to pop wrong timer.");                             \
 360                 else if (be_options.vrfy_option == BE_VRFY_WARN && tmp != timer)                       \
 361                         fprintf(stderr, "Attempt to pop wrong timer. %s is on stack, trying to pop %s.\n", \
 362                                 lc_timer_get_name(tmp), lc_timer_get_name(timer));                             \
 363                 timer = tmp;                                                                           \
 364         }
 365
 366 #define BE_TIMER_ONLY(code)   do { if (be_options.timing == BE_TIME_ON) { code; } } while(0)
 367
 368 #else
 369
 370 #define BE_TIMER_PUSH(timer)
 371 #define BE_TIMER_POP(timer)
 372 #define BE_TIMER_ONLY(code)
 373
 374 #endif /* WITH_LIBCORE */
 375
 376
 377 /**
 378  * The Firm backend main loop.
 379  * Do architecture specific lowering for all graphs
 380  * and call the architecture specific code generator.
 381  *
 382  * @param file_handle   the file handle the output will be written to
 383  */
 384 static void be_main_loop(FILE *file_handle)
 385 {
 386         int i, n;
 387         arch_isa_t *isa;
 388         be_main_env_t env;
 389         unsigned num_nodes_b = 0;
 390         unsigned num_nodes_a = 0;
 391         unsigned num_nodes_r = 0;
 392
 393 #ifdef WITH_LIBCORE
 394         lc_timer_t *t_prolog = NULL;
 395         lc_timer_t *t_abi = NULL;
 396         lc_timer_t *t_codegen = NULL;
 397         lc_timer_t *t_sched = NULL;
 398         lc_timer_t *t_constr = NULL;
 399         lc_timer_t *t_regalloc = NULL;
 400         lc_timer_t *t_finish = NULL;
 401         lc_timer_t *t_emit = NULL;
 402         lc_timer_t *t_other = NULL;
 403         lc_timer_t *t_verify = NULL;
 404         be_ra_timer_t *ra_timer;
 405
 406         if (be_options.timing == BE_TIME_ON) {
 407                 t_prolog   = lc_timer_register("prolog",   "prolog");
 408                 t_abi      = lc_timer_register("beabi",    "be abi introduction");
 409                 t_codegen  = lc_timer_register("codegen",  "codegeneration");
 410                 t_sched    = lc_timer_register("sched",    "scheduling");
 411                 t_constr   = lc_timer_register("constr",   "assure constraints");
 412                 t_regalloc = lc_timer_register("regalloc", "register allocation");
 413                 t_finish   = lc_timer_register("finish",   "graph finish");
 414                 t_emit     = lc_timer_register("emiter",   "code emiter");
 415                 t_verify   = lc_timer_register("verify",   "graph verification");
 416                 t_other    = lc_timer_register("other",    "other");
 417         }
 418 #endif /* WITH_LIBCORE */
 419
 420         be_init_env(&env, file_handle);
 421
 422         isa = arch_env_get_isa(env.arch_env);
 423
 424         /* for debugging, anchors helps */
 425         // dump_all_anchors(1);
 426
 427         if(be_options.opt_profile) {
 428                 ir_graph *prof_init_irg = be_profile_instrument();
 429                 pset_insert_ptr(env.arch_env->constructor_entities, get_irg_entity(prof_init_irg));
 430         }
 431         be_profile_read("test.c.prof"); //FIXME
 432
 433         /* For all graphs */
 434         for (i = 0, n = get_irp_n_irgs(); i < n; ++i) {
 435                 ir_graph *irg = get_irp_irg(i);
 436                 const arch_code_generator_if_t *cg_if;
 437                 be_irg_t birg;
 438                 optimization_state_t state;
 439
 440                 /* stop and reset timers */
 441                 BE_TIMER_ONLY(
 442                         LC_STOP_AND_RESET_TIMER(t_prolog);
 443                         LC_STOP_AND_RESET_TIMER(t_abi);
 444                         LC_STOP_AND_RESET_TIMER(t_codegen);
 445                         LC_STOP_AND_RESET_TIMER(t_sched);
 446                         LC_STOP_AND_RESET_TIMER(t_constr);
 447                         LC_STOP_AND_RESET_TIMER(t_regalloc);
 448                         LC_STOP_AND_RESET_TIMER(t_finish);
 449                         LC_STOP_AND_RESET_TIMER(t_emit);
 450                         LC_STOP_AND_RESET_TIMER(t_verify);
 451                         LC_STOP_AND_RESET_TIMER(t_other);
 452                 );
 453                 BE_TIMER_PUSH(t_other);   /* t_other */
 454
 455                 BE_TIMER_ONLY(num_nodes_b = get_num_reachable_nodes(irg));
 456
 457                 birg.irg      = irg;
 458                 birg.main_env = &env;
 459
 460                 edges_deactivate_kind(irg, EDGE_KIND_DEP);
 461                 edges_activate_kind(irg, EDGE_KIND_DEP);
 462
 463                 DBG((env.dbg, LEVEL_2, "====> IRG: %F\n", irg));
 464                 dump(DUMP_INITIAL, irg, "-begin", dump_ir_block_graph);
 465
 466                 BE_TIMER_PUSH(t_prolog);
 467
 468                 be_stat_init_irg(env.arch_env, irg);
 469                 be_do_stat_nodes(irg, "01 Begin");
 470
 471                 /* set the current graph (this is important for several firm functions) */
 472                 current_ir_graph = birg.irg;
 473
 474                 /* Get the code generator interface. */
 475                 cg_if = isa->impl->get_code_generator_if(isa);
 476
 477                 /* get a code generator for this graph. */
 478                 birg.cg = cg_if->init(&birg);
 479
 480                 /* create the code generator and generate code. */
 481                 prepare_graph(&birg);
 482
 483                 BE_TIMER_POP(t_prolog);
 484
 485                 /* some transformations need to be done before abi introduce */
 486                 BE_TIMER_PUSH(t_codegen);
 487                 arch_code_generator_before_abi(birg.cg);
 488                 BE_TIMER_POP(t_codegen);
 489
 490                 /* implement the ABI conventions. */
 491                 BE_TIMER_PUSH(t_abi);
 492                 birg.abi = be_abi_introduce(&birg);
 493                 BE_TIMER_POP(t_abi);
 494
 495                 dump(DUMP_ABI, irg, "-abi", dump_ir_block_graph);
 496                 be_do_stat_nodes(irg, "02 Abi");
 497
 498                 /* generate code */
 499                 BE_TIMER_PUSH(t_codegen);
 500                 arch_code_generator_prepare_graph(birg.cg);
 501                 BE_TIMER_POP(t_codegen);
 502
 503                 be_do_stat_nodes(irg, "03 Prepare");
 504
 505                 /*
 506                  * Since the code generator made a lot of new nodes and skipped
 507                  * a lot of old ones, we should do dead node elimination here.
 508                  * Note that this requires disabling the edges here.
 509                  */
 510                 edges_deactivate(irg);
 511                 //dead_node_elimination(irg);
 512                 edges_activate(irg);
 513
 514                 /* Compute loop nesting information (for weighting copies) */
 515                 construct_cf_backedges(irg);
 516                 dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph);
 517                 BE_TIMER_ONLY(num_nodes_r = get_num_reachable_nodes(irg));
 518
 519                 /* let backend prepare scheduling */
 520                 BE_TIMER_PUSH(t_codegen);
 521                 arch_code_generator_before_sched(birg.cg);
 522                 BE_TIMER_POP(t_codegen);
 523
 524                 /* schedule the irg */
 525                 BE_TIMER_PUSH(t_sched);
 526                 list_sched(&birg, &be_options);
 527                 BE_TIMER_POP(t_sched);
 528
 529                 dump(DUMP_SCHED, irg, "-sched", dump_ir_block_graph_sched);
 530
 531                 /* check schedule */
 532                 BE_TIMER_PUSH(t_verify);
 533                 be_sched_vrfy(birg.irg, be_options.vrfy_option);
 534                 BE_TIMER_POP(t_verify);
 535
 536                 be_do_stat_nodes(irg, "04 Schedule");
 537
 538                 /* introduce patterns to assure constraints */
 539                 BE_TIMER_PUSH(t_constr);
 540                 /* we switch off optimizations here, because they might cause trouble */
 541                 save_optimization_state(&state);
 542                 set_optimize(0);
 543                 set_opt_normalize(0);
 544
 545                 /* add Keeps for should_be_different constrained nodes  */
 546                 /* beware: needs schedule due to usage of be_ssa_constr */
 547                 assure_constraints(&birg);
 548                 BE_TIMER_POP(t_constr);
 549
 550                 dump(DUMP_SCHED, irg, "-assured", dump_ir_block_graph_sched);
 551                 be_do_stat_nodes(irg, "05 Constraints");
 552
 553                 /* connect all stack modifying nodes together (see beabi.c) */
 554                 BE_TIMER_PUSH(t_abi);
 555                 be_abi_fix_stack_nodes(birg.abi, NULL);
 556                 BE_TIMER_POP(t_abi);
 557
 558                 dump(DUMP_SCHED, irg, "-fix_stack", dump_ir_block_graph_sched);
 559
 560                 /* check schedule */
 561                 BE_TIMER_PUSH(t_verify);
 562                 be_sched_vrfy(birg.irg, be_options.vrfy_option);
 563                 BE_TIMER_POP(t_verify);
 564
 565                 /* do some statistics */
 566                 be_do_stat_reg_pressure(&birg);
 567
 568                 /* stuff needs to be done after scheduling but before register allocation */
 569                 BE_TIMER_PUSH(t_codegen);
 570                 arch_code_generator_before_ra(birg.cg);
 571                 BE_TIMER_POP(t_codegen);
 572
 573                 /* Do register allocation */
 574                 BE_TIMER_PUSH(t_regalloc);
 575                 ra_timer = ra->allocate(&birg);
 576                 BE_TIMER_POP(t_regalloc);
 577
 578                 dump(DUMP_RA, irg, "-ra", dump_ir_block_graph_sched);
 579                 be_do_stat_nodes(irg, "06 Register Allocation");
 580
 581                 /* let the codegenerator prepare the graph for emitter */
 582                 BE_TIMER_PUSH(t_finish);
 583                 arch_code_generator_after_ra(birg.cg);
 584                 BE_TIMER_POP(t_finish);
 585
 586                 /* fix stack offsets */
 587                 BE_TIMER_PUSH(t_abi);
 588                 be_abi_fix_stack_nodes(birg.abi, NULL);
 589                 be_remove_dead_nodes_from_schedule(birg.irg);
 590                 be_abi_fix_stack_bias(birg.abi);
 591                 BE_TIMER_POP(t_abi);
 592
 593                 BE_TIMER_PUSH(t_finish);
 594                 arch_code_generator_finish(birg.cg);
 595                 BE_TIMER_POP(t_finish);
 596
 597                 dump(DUMP_FINAL, irg, "-finish", dump_ir_block_graph_sched);
 598
 599                 /* check schedule and register allocation */
 600                 BE_TIMER_PUSH(t_verify);
 601                 if (be_options.vrfy_option == BE_VRFY_WARN) {
 602                         //irg_verify(birg.irg, VRFY_ENFORCE_SSA);
 603                         be_check_dominance(birg.irg);
 604                         be_verify_out_edges(birg.irg);
 605                         be_verify_schedule(birg.irg);
 606                         be_verify_register_allocation(env.arch_env, birg.irg);
 607                 }
 608                 else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
 609                         //assert(irg_verify(birg.irg, VRFY_ENFORCE_SSA) && "irg verification failed");
 610                         assert(be_verify_out_edges(birg.irg));
 611                         assert(be_check_dominance(birg.irg) && "Dominance verification failed");
 612                         assert(be_verify_schedule(birg.irg) && "Schedule verification failed");
 613                         assert(be_verify_register_allocation(env.arch_env, birg.irg)
 614                                && "register allocation verification failed");
 615                 }
 616                 BE_TIMER_POP(t_verify);
 617
 618                 /* emit assembler code */
 619                 BE_TIMER_PUSH(t_emit);
 620                 arch_code_generator_done(birg.cg);
 621                 BE_TIMER_POP(t_emit);
 622
 623                 dump(DUMP_FINAL, irg, "-end", dump_ir_extblock_graph_sched);
 624
 625                 BE_TIMER_PUSH(t_abi);
 626                 be_abi_free(birg.abi);
 627                 BE_TIMER_POP(t_abi);
 628
 629                 be_do_stat_nodes(irg, "07 Final");
 630                 restore_optimization_state(&state);
 631
 632                 BE_TIMER_ONLY(num_nodes_a = get_num_reachable_nodes(irg));
 633                 BE_TIMER_POP(t_other);
 634
 635 #define LC_EMIT(timer)    printf("%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0)
 636 #define LC_EMIT_RA(timer) printf("\t%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0)
 637                 BE_TIMER_ONLY(
 638                         printf("==>> IRG %s <<==\n", get_entity_name(get_irg_entity(irg)));
 639                         printf("# nodes at begin:  %u\n", num_nodes_b);
 640                         printf("# nodes before ra: %u\n", num_nodes_r);
 641                         printf("# nodes at end:    %u\n\n", num_nodes_a);
 642                         LC_EMIT(t_prolog);
 643                         LC_EMIT(t_abi);
 644                         LC_EMIT(t_codegen);
 645                         LC_EMIT(t_sched);
 646                         LC_EMIT(t_constr);
 647                         LC_EMIT(t_regalloc);
 648                         LC_EMIT_RA(ra_timer->t_prolog);
 649                         LC_EMIT_RA(ra_timer->t_live);
 650                         LC_EMIT_RA(ra_timer->t_spill);
 651                         LC_EMIT_RA(ra_timer->t_spillslots);
 652                         LC_EMIT_RA(ra_timer->t_color);
 653                         LC_EMIT_RA(ra_timer->t_ifg);
 654                         LC_EMIT_RA(ra_timer->t_copymin);
 655                         LC_EMIT_RA(ra_timer->t_ssa);
 656                         LC_EMIT_RA(ra_timer->t_epilog);
 657                         LC_EMIT_RA(ra_timer->t_verify);
 658                         LC_EMIT_RA(ra_timer->t_other);
 659                         LC_EMIT(t_finish);
 660                         LC_EMIT(t_emit);
 661                         LC_EMIT(t_verify);
 662                         LC_EMIT(t_other);
 663                 );
 664 #undef LC_EMIT_RA
 665 #undef LC_EMIT
 666
 667         /* switched off due to statistics (statistic module needs all irgs) */
 668                 if (! stat_is_active())
 669                         free_ir_graph(irg);
 670
 671         }
 672         be_profile_free();
 673         be_done_env(&env);
 674
 675 #undef BE_TIMER_POP
 676 #undef BE_TIMER_PUSH
 677 #undef BE_TIMER_ONLY
 678 }
 679
 680 /* Main interface to the frontend. */
 681 void be_main(FILE *file_handle)
 682 {
 683 #ifdef WITH_LIBCORE
 684         lc_timer_t *t = NULL;
 685 #endif /* WITH_LIBCORE */
 686
 687 #ifdef WITH_LIBCORE
 688         /* The user specified another config file to read. do that now. */
 689         if(strlen(config_file) > 0) {
 690                 FILE *f;
 691
 692                 if((f = fopen(config_file, "rt")) != NULL) {
 693                         lc_opt_from_file(config_file, f, NULL);
 694                         fclose(f);
 695                 }
 696         }
 697
 698         if (be_options.timing == BE_TIME_ON) {
 699                 t = lc_timer_register("bemain", "measure complete bemain loop");
 700
 701                 if (lc_timer_enter_high_priority()) {
 702                         fprintf(stderr, "Warning: Could not enter high priority mode.\n");
 703                 }
 704
 705                 lc_timer_reset_and_start(t);
 706         }
 707 #endif /* WITH_LIBCORE */
 708
 709         /* never build code for pseudo irgs */
 710         set_visit_pseudo_irgs(0);
 711
 712         be_node_init();
 713         be_main_loop(file_handle);
 714
 715 #ifdef WITH_LIBCORE
 716         if (be_options.timing == BE_TIME_ON) {
 717                 lc_timer_stop(t);
 718                 lc_timer_leave_high_priority();
 719                 printf("%-20s: %lu msec\n", "BEMAINLOOP", lc_timer_elapsed_msec(t));
 720         }
 721 #endif /* WITH_LIBCORE */
 722 }
 723
 724 /** The debug info retriever function. */
 725 static retrieve_dbg_func retrieve_dbg = NULL;
 726
 727 /* Sets a debug info retriever. */
 728 void be_set_debug_retrieve(retrieve_dbg_func func) {
 729         retrieve_dbg = func;
 730 }
 731
 732 /* Retrieve the debug info. */
 733 const char *be_retrieve_dbg_info(const dbg_info *dbg, unsigned *line) {
 734         if (retrieve_dbg)
 735                 return retrieve_dbg(dbg, line);
 736         *line = 0;
 737         return NULL;
 738 }
 739
 740 int be_put_ignore_regs(const be_irg_t *birg, const arch_register_class_t *cls, bitset_t *bs)
 741 {
 742         if(bs == NULL)
 743                 bs = bitset_alloca(cls->n_regs);
 744         else
 745                 bitset_clear_all(bs);
 746
 747         assert(bitset_size(bs) == (unsigned) cls->n_regs);
 748         arch_put_non_ignore_regs(birg->main_env->arch_env, cls, bs);
 749         bitset_flip_all(bs);
 750         be_abi_put_ignore_regs(birg->abi, cls, bs);
 751         return bitset_popcnt(bs);
 752
 753 }