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