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