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