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