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