nsz Git - libfirm/blob - ir/be/bemain.c

   1 /*
   2  * Copyright (C) 1995-2011 University of Karlsruhe.  All right reserved.
   3  *
   4  * This file is part of libFirm.
   5  *
   6  * This file may be distributed and/or modified under the terms of the
   7  * GNU General Public License version 2 as published by the Free Software
   8  * Foundation and appearing in the file LICENSE.GPL included in the
   9  * packaging of this file.
  10  *
  11  * Licensees holding valid libFirm Professional Edition licenses may use
  12  * this file in accordance with the libFirm Commercial License.
  13  * Agreement provided with the Software.
  14  *
  15  * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
  16  * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
  17  * PURPOSE.
  18  */
  19
  20 /**
  21  * @file
  22  * @brief       Main Backend driver.
  23  * @author      Sebastian Hack
  24  * @date        25.11.2004
  25  */
  26 #include "config.h"
  27
  28 #include <stdarg.h>
  29 #include <stdio.h>
  30
  31 #include "lc_opts.h"
  32 #include "lc_opts_enum.h"
  33
  34 #include "obst.h"
  35 #include "bitset.h"
  36
  37 #include "irprog.h"
  38 #include "irgopt.h"
  39 #include "irgraph.h"
  40 #include "irdump.h"
  41 #include "irdom_t.h"
  42 #include "iredges_t.h"
  43 #include "irloop_t.h"
  44 #include "irtools.h"
  45 #include "irverify.h"
  46 #include "irprintf.h"
  47 #include "iroptimize.h"
  48 #include "firmstat.h"
  49 #include "execfreq.h"
  50 #include "irprofile.h"
  51 #include "irpass_t.h"
  52
  53 #include "bearch.h"
  54 #include "be_t.h"
  55 #include "bemodule.h"
  56 #include "beutil.h"
  57 #include "benode.h"
  58 #include "beirgmod.h"
  59 #include "besched.h"
  60 #include "belistsched.h"
  61 #include "belive_t.h"
  62 #include "bera.h"
  63 #include "bechordal_t.h"
  64 #include "beifg.h"
  65 #include "becopyopt.h"
  66 #include "becopystat.h"
  67 #include "bessadestr.h"
  68 #include "beabi.h"
  69 #include "belower.h"
  70 #include "bestat.h"
  71 #include "beverify.h"
  72 #include "be_dbgout.h"
  73 #include "beirg.h"
  74 #include "bestack.h"
  75 #include "beemitter.h"
  76
  77 #define NEW_ID(s) new_id_from_chars(s, sizeof(s) - 1)
  78
  79 /* options visible for anyone */
  80 static be_options_t be_options = {
  81         DUMP_NONE,                         /* dump flags */
  82         BE_TIME_OFF,                       /* no timing */
  83         false,                             /* profile_generate */
  84         false,                             /* profile_use */
  85         0,                                 /* try to omit frame pointer */
  86         0,                                 /* create PIC code */
  87         BE_VERIFY_WARN,                    /* verification level: warn */
  88         "",                                /* ilp server */
  89         "",                                /* ilp solver */
  90         0,                                 /* enable statistic event dumping */
  91         "",                                /* print stat events */
  92 };
  93
  94 /* back end instruction set architecture to use */
  95 static const arch_isa_if_t *isa_if = NULL;
  96
  97 /* possible dumping options */
  98 static const lc_opt_enum_mask_items_t dump_items[] = {
  99         { "none",       DUMP_NONE },
 100         { "initial",    DUMP_INITIAL },
 101         { "abi",        DUMP_ABI    },
 102         { "sched",      DUMP_SCHED  },
 103         { "prepared",   DUMP_PREPARED },
 104         { "regalloc",   DUMP_RA },
 105         { "final",      DUMP_FINAL },
 106         { "be",         DUMP_BE },
 107         { "all",        2 * DUMP_BE - 1 },
 108         { NULL,         0 }
 109 };
 110
 111 /* verify options. */
 112 static const lc_opt_enum_int_items_t verify_items[] = {
 113         { "off",    BE_VERIFY_OFF    },
 114         { "warn",   BE_VERIFY_WARN   },
 115         { "assert", BE_VERIFY_ASSERT },
 116         { NULL,     0 }
 117 };
 118
 119 static lc_opt_enum_mask_var_t dump_var = {
 120         &be_options.dump_flags, dump_items
 121 };
 122
 123 static lc_opt_enum_int_var_t verify_var = {
 124         &be_options.verify_option, verify_items
 125 };
 126
 127 static const lc_opt_table_entry_t be_main_options[] = {
 128         LC_OPT_ENT_ENUM_MASK("dump",       "dump irg on several occasions",                       &dump_var),
 129         LC_OPT_ENT_BOOL     ("omitfp",     "omit frame pointer",                                  &be_options.omit_fp),
 130         LC_OPT_ENT_BOOL     ("pic",        "create PIC code",                                     &be_options.pic),
 131         LC_OPT_ENT_ENUM_INT ("verify",     "verify the backend irg",                              &verify_var),
 132         LC_OPT_ENT_BOOL     ("time",       "get backend timing statistics",                       &be_options.timing),
 133         LC_OPT_ENT_BOOL     ("profilegenerate", "instrument the code for execution count profiling",   &be_options.opt_profile_generate),
 134         LC_OPT_ENT_BOOL     ("profileuse",      "use existing profile data",                           &be_options.opt_profile_use),
 135         LC_OPT_ENT_BOOL     ("statev",     "dump statistic events",                               &be_options.statev),
 136         LC_OPT_ENT_STR      ("filtev",     "filter for stat events (regex if support is active",   be_options.filtev),
 137
 138         LC_OPT_ENT_STR("ilp.server", "the ilp server name", be_options.ilp_server),
 139         LC_OPT_ENT_STR("ilp.solver", "the ilp solver name", be_options.ilp_solver),
 140         LC_OPT_LAST
 141 };
 142
 143 static be_module_list_entry_t *isa_ifs         = NULL;
 144 static bool                    isa_initialized = false;
 145
 146 asm_constraint_flags_t asm_constraint_flags[256];
 147
 148 static void initialize_isa(void)
 149 {
 150         if (isa_initialized)
 151                 return;
 152         isa_if->init();
 153 }
 154
 155 void be_init_default_asm_constraint_flags(void)
 156 {
 157         asm_constraint_flags['?'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
 158         asm_constraint_flags['!'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
 159         asm_constraint_flags['&'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT
 160                 | ASM_CONSTRAINT_FLAG_MODIFIER_EARLYCLOBBER;
 161         asm_constraint_flags['%'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT
 162                 | ASM_CONSTRAINT_FLAG_MODIFIER_COMMUTATIVE;
 163         asm_constraint_flags['!'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
 164
 165         asm_constraint_flags['='] = ASM_CONSTRAINT_FLAG_MODIFIER_WRITE
 166                 | ASM_CONSTRAINT_FLAG_MODIFIER_NO_READ;
 167         asm_constraint_flags['+'] = ASM_CONSTRAINT_FLAG_MODIFIER_READ
 168                 | ASM_CONSTRAINT_FLAG_MODIFIER_WRITE;
 169
 170         asm_constraint_flags['i'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
 171         asm_constraint_flags['s'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
 172         asm_constraint_flags['E'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
 173         asm_constraint_flags['F'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
 174         asm_constraint_flags['G'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
 175         asm_constraint_flags['H'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
 176         asm_constraint_flags['I'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
 177         asm_constraint_flags['J'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
 178         asm_constraint_flags['K'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
 179         asm_constraint_flags['L'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
 180         asm_constraint_flags['M'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
 181         asm_constraint_flags['N'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
 182         asm_constraint_flags['O'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
 183         asm_constraint_flags['P'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
 184
 185         asm_constraint_flags['m'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
 186         asm_constraint_flags['o'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
 187         asm_constraint_flags['V'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
 188         asm_constraint_flags['<'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
 189         asm_constraint_flags['>'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
 190
 191         asm_constraint_flags['p'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
 192         asm_constraint_flags['0'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
 193         asm_constraint_flags['1'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
 194         asm_constraint_flags['2'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
 195         asm_constraint_flags['3'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
 196         asm_constraint_flags['4'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
 197         asm_constraint_flags['5'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
 198         asm_constraint_flags['6'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
 199         asm_constraint_flags['7'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
 200         asm_constraint_flags['8'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
 201         asm_constraint_flags['9'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
 202
 203         asm_constraint_flags['X'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER
 204                 | ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP
 205                 | ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
 206
 207         /* these should have been catched by the parsing code already */
 208         asm_constraint_flags['#']  = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
 209         asm_constraint_flags['*']  = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
 210         asm_constraint_flags[' ']  = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
 211         asm_constraint_flags['\t'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
 212         asm_constraint_flags['\n'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
 213         asm_constraint_flags['\r'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
 214 }
 215
 216 asm_constraint_flags_t be_parse_asm_constraints(const char *constraint)
 217 {
 218         asm_constraint_flags_t  flags = ASM_CONSTRAINT_FLAG_NONE;
 219         const char             *c;
 220         asm_constraint_flags_t  tflags;
 221
 222         initialize_isa();
 223
 224         for (c = constraint; *c != '\0'; ++c) {
 225                 switch (*c) {
 226                 case '#':
 227                         /* 'comment' stuff */
 228                         while (*c != 0 && *c != ',')
 229                                 ++c;
 230                         break;
 231                 case '*':
 232                         /* 'comment' character */
 233                         ++c;
 234                         break;
 235                 case ' ':
 236                 case '\t':
 237                 case '\n':
 238                 case '\r':
 239                         break;
 240                 default:
 241                         tflags = asm_constraint_flags[(int) *c];
 242                         if (tflags != 0) {
 243                                 flags |= tflags;
 244                         } else {
 245                                 flags |= isa_if->parse_asm_constraint(&c);
 246                         }
 247                         break;
 248                 }
 249         }
 250
 251         if ((
 252                 flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE &&
 253                 flags & ASM_CONSTRAINT_FLAG_MODIFIER_NO_WRITE
 254             ) || (
 255                 flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ &&
 256                 flags & ASM_CONSTRAINT_FLAG_MODIFIER_NO_READ
 257             )) {
 258                 flags |= ASM_CONSTRAINT_FLAG_INVALID;
 259         }
 260         if (!(flags & (ASM_CONSTRAINT_FLAG_MODIFIER_READ     |
 261                        ASM_CONSTRAINT_FLAG_MODIFIER_WRITE    |
 262                        ASM_CONSTRAINT_FLAG_MODIFIER_NO_WRITE |
 263                        ASM_CONSTRAINT_FLAG_MODIFIER_NO_READ)
 264             )) {
 265                 flags |= ASM_CONSTRAINT_FLAG_MODIFIER_READ;
 266         }
 267
 268         return flags;
 269 }
 270
 271 int be_is_valid_clobber(const char *clobber)
 272 {
 273         initialize_isa();
 274
 275         /* memory is a valid clobber. (the frontend has to detect this case too,
 276          * because it has to add memory edges to the asm) */
 277         if (strcmp(clobber, "memory") == 0)
 278                 return 1;
 279         /* cc (condition code) is always valid */
 280         if (strcmp(clobber, "cc") == 0)
 281                 return 1;
 282
 283         return isa_if->is_valid_clobber(clobber);
 284 }
 285
 286 void be_register_isa_if(const char *name, const arch_isa_if_t *isa)
 287 {
 288         if (isa_if == NULL)
 289                 isa_if = isa;
 290
 291         be_add_module_to_list(&isa_ifs, name, (void*) isa);
 292 }
 293
 294 static void be_opt_register(void)
 295 {
 296         lc_opt_entry_t *be_grp;
 297         static int run_once = 0;
 298
 299         if (run_once)
 300                 return;
 301         run_once = 1;
 302
 303         be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
 304         lc_opt_add_table(be_grp, be_main_options);
 305
 306         be_add_module_list_opt(be_grp, "isa", "the instruction set architecture",
 307                                &isa_ifs, (void**) &isa_if);
 308
 309         be_init_modules();
 310 }
 311
 312 /* Parse one argument. */
 313 int be_parse_arg(const char *arg)
 314 {
 315         lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
 316         if (strcmp(arg, "help") == 0 || (arg[0] == '?' && arg[1] == '\0')) {
 317                 lc_opt_print_help_for_entry(be_grp, '-', stdout);
 318                 return -1;
 319         }
 320         return lc_opt_from_single_arg(be_grp, NULL, arg, NULL);
 321 }
 322
 323 /* Perform schedule verification if requested. */
 324 static void be_sched_verify(ir_graph *irg, int verify_opt)
 325 {
 326         if (verify_opt == BE_VERIFY_WARN) {
 327                 be_verify_schedule(irg);
 328         } else if (verify_opt == BE_VERIFY_ASSERT) {
 329                 assert(be_verify_schedule(irg) && "Schedule verification failed.");
 330         }
 331 }
 332
 333 /* Initialize the Firm backend. Must be run first in init_firm()! */
 334 void firm_be_init(void)
 335 {
 336         be_opt_register();
 337         be_init_modules();
 338 }
 339
 340 /* Finalize the Firm backend. */
 341 void firm_be_finish(void)
 342 {
 343         be_quit_modules();
 344 }
 345
 346 /* Returns the backend parameter */
 347 const backend_params *be_get_backend_param(void)
 348 {
 349         initialize_isa();
 350         return isa_if->get_params();
 351 }
 352
 353 /**
 354  * Initializes the main environment for the backend.
 355  *
 356  * @param env          an empty environment
 357  * @param file_handle  the file handle where the output will be written to
 358  */
 359 static be_main_env_t *be_init_env(be_main_env_t *env, FILE *file_handle,
 360                                   const char *compilation_unit_name)
 361 {
 362         memset(env, 0, sizeof(*env));
 363         env->options              = &be_options;
 364         env->file_handle          = file_handle;
 365         env->ent_trampoline_map   = pmap_create();
 366         env->pic_trampolines_type = new_type_class(NEW_ID("$PIC_TRAMPOLINE_TYPE"));
 367         env->ent_pic_symbol_map   = pmap_create();
 368         env->pic_symbols_type     = new_type_struct(NEW_ID("$PIC_SYMBOLS_TYPE"));
 369         env->cup_name             = compilation_unit_name;
 370
 371         remove_irp_type(env->pic_trampolines_type);
 372         remove_irp_type(env->pic_symbols_type);
 373         set_class_final(env->pic_trampolines_type, 1);
 374
 375         memset(asm_constraint_flags, 0, sizeof(asm_constraint_flags));
 376         env->arch_env = arch_env_begin_codegeneration(isa_if, env);
 377
 378         return env;
 379 }
 380
 381 /**
 382  * Called when the be_main_env_t can be destroyed.
 383  */
 384 static void be_done_env(be_main_env_t *env)
 385 {
 386         pmap_destroy(env->ent_trampoline_map);
 387         pmap_destroy(env->ent_pic_symbol_map);
 388         free_type(env->pic_trampolines_type);
 389         free_type(env->pic_symbols_type);
 390 }
 391
 392 /**
 393  * A wrapper around a firm dumper. Dumps only, if
 394  * flags are enabled.
 395  *
 396  * @param mask    a bitmask containing the reason what will be dumped
 397  * @param irg     the IR graph to dump
 398  * @param suffix  the suffix for the dumper
 399  * @param dumper  the dumper to be called
 400  */
 401 static void dump(int mask, ir_graph *irg, const char *suffix)
 402 {
 403         if (be_options.dump_flags & mask)
 404                 dump_ir_graph(irg, suffix);
 405 }
 406
 407 /**
 408  * Prepare a backend graph for code generation and initialize its irg
 409  */
 410 static void initialize_birg(be_irg_t *birg, ir_graph *irg, be_main_env_t *env)
 411 {
 412         /* don't duplicate locals in backend when dumping... */
 413         ir_remove_dump_flags(ir_dump_flag_consts_local);
 414
 415         dump(DUMP_INITIAL, irg, "begin");
 416
 417         irg->be_data = birg;
 418
 419         memset(birg, 0, sizeof(*birg));
 420         birg->irg = irg;
 421         birg->main_env = env;
 422         obstack_init(&birg->obst);
 423
 424         edges_deactivate_kind(irg, EDGE_KIND_DEP);
 425         edges_activate_kind(irg, EDGE_KIND_DEP);
 426
 427         /* set the current graph (this is important for several firm functions) */
 428         current_ir_graph = irg;
 429
 430         /* we do this before critical edge split. As this produces less returns,
 431            because sometimes (= 164.gzip) multiple returns are slower */
 432         normalize_n_returns(irg);
 433
 434         /* Remove critical edges */
 435         remove_critical_cf_edges_ex(irg, /*ignore_exception_edges=*/0);
 436
 437         /* For code generation all unreachable code and Bad nodes should be gone */
 438         remove_unreachable_code(irg);
 439         remove_bads(irg);
 440
 441         /* Ensure, that the ir_edges are computed. */
 442         edges_assure(irg);
 443
 444         set_irg_phase_state(irg, phase_backend);
 445         be_info_init_irg(irg);
 446
 447         dump(DUMP_INITIAL, irg, "prepared");
 448 }
 449
 450 int be_timing;
 451
 452 static const char *get_timer_name(be_timer_id_t id)
 453 {
 454         switch (id) {
 455         case T_ABI:            return "abi";
 456         case T_CODEGEN:        return "codegen";
 457         case T_RA_PREPARATION: return "ra_preparation";
 458         case T_SCHED:          return "sched";
 459         case T_CONSTR:         return "constr";
 460         case T_FINISH:         return "finish";
 461         case T_EMIT:           return "emit";
 462         case T_VERIFY:         return "verify";
 463         case T_OTHER:          return "other";
 464         case T_HEIGHTS:        return "heights";
 465         case T_LIVE:           return "live";
 466         case T_EXECFREQ:       return "execfreq";
 467         case T_SSA_CONSTR:     return "ssa_constr";
 468         case T_RA_PROLOG:      return "ra_prolog";
 469         case T_RA_EPILOG:      return "ra_epilog";
 470         case T_RA_CONSTR:      return "ra_constr";
 471         case T_RA_SPILL:       return "ra_spill";
 472         case T_RA_SPILL_APPLY: return "ra_spill_apply";
 473         case T_RA_COLOR:       return "ra_color";
 474         case T_RA_IFG:         return "ra_ifg";
 475         case T_RA_COPYMIN:     return "ra_copymin";
 476         case T_RA_SSA:         return "ra_ssa";
 477         case T_RA_OTHER:       return "ra_other";
 478         }
 479         return "unknown";
 480 }
 481 ir_timer_t *be_timers[T_LAST+1];
 482
 483 void be_lower_for_target(void)
 484 {
 485         size_t i;
 486
 487         initialize_isa();
 488
 489         /* shouldn't lower program twice */
 490         assert(get_irp_phase_state() != phase_low);
 491
 492         isa_if->lower_for_target();
 493         /* set the phase to low */
 494         for (i = get_irp_n_irgs(); i > 0;) {
 495                 ir_graph *irg = get_irp_irg(--i);
 496                 set_irg_phase_state(irg, phase_low);
 497         }
 498         set_irp_phase_state(phase_low);
 499 }
 500
 501 /**
 502  * The Firm backend main loop.
 503  * Do architecture specific lowering for all graphs
 504  * and call the architecture specific code generator.
 505  *
 506  * @param file_handle   the file handle the output will be written to
 507  * @param cup_name      name of the compilation unit
 508  */
 509 static void be_main_loop(FILE *file_handle, const char *cup_name)
 510 {
 511         static const char suffix[] = ".prof";
 512
 513         size_t        i, num_birgs;
 514         be_main_env_t env;
 515         char          prof_filename[256];
 516         be_irg_t      *birgs;
 517         arch_env_t    *arch_env;
 518
 519         be_timing = (be_options.timing == BE_TIME_ON);
 520
 521         /* perform target lowering if it didn't happen yet */
 522         if (get_irp_phase_state() != phase_low)
 523                 be_lower_for_target();
 524
 525         if (be_timing) {
 526                 for (i = 0; i < T_LAST+1; ++i) {
 527                         be_timers[i] = ir_timer_new();
 528                 }
 529         }
 530
 531         be_init_env(&env, file_handle, cup_name);
 532
 533         arch_env = env.arch_env;
 534
 535         /* we might need 1 birg more for instrumentation constructor */
 536         num_birgs = get_irp_n_irgs();
 537         birgs     = ALLOCAN(be_irg_t, num_birgs + 1);
 538
 539         be_info_init();
 540
 541         /* First: initialize all birgs */
 542         for (i = 0; i < num_birgs; ++i) {
 543                 ir_graph *irg = get_irp_irg(i);
 544                 initialize_birg(&birgs[i], irg, &env);
 545         }
 546         arch_env_handle_intrinsics(arch_env);
 547
 548         /*
 549                 Get the filename for the profiling data.
 550                 Beware: '\0' is already included in sizeof(suffix)
 551         */
 552         sprintf(prof_filename, "%.*s%s",
 553                 (int)(sizeof(prof_filename) - sizeof(suffix)), cup_name, suffix);
 554
 555         if (be_options.opt_profile_use) {
 556                 bool res = ir_profile_read(prof_filename);
 557                 if (!res) {
 558                         fprintf(stderr, "Warning: Couldn't read profile data '%s'\n",
 559                                 prof_filename);
 560                 }
 561         }
 562         if (be_options.opt_profile_generate) {
 563                 ir_graph *prof_init_irg
 564                         = ir_profile_instrument(prof_filename);
 565                 initialize_birg(&birgs[num_birgs], prof_init_irg, &env);
 566                 num_birgs++;
 567         }
 568
 569         /* For all graphs */
 570         for (i = 0; i < num_birgs; ++i) {
 571                 be_irg_t *birg = &birgs[i];
 572                 ir_graph *irg  = birg->irg;
 573                 optimization_state_t state;
 574
 575                 /* set the current graph (this is important for several firm functions) */
 576                 current_ir_graph = irg;
 577
 578                 if (stat_ev_enabled) {
 579                         stat_ev_ctx_push_fobj("bemain_irg", irg);
 580                         be_stat_ev("bemain_insns_start", be_count_insns(irg));
 581                         be_stat_ev("bemain_blocks_start", be_count_blocks(irg));
 582                 }
 583
 584                 /* stop and reset timers */
 585                 be_timer_push(T_OTHER);
 586
 587                 /* Verify the initial graph */
 588                 be_timer_push(T_VERIFY);
 589                 if (be_options.verify_option == BE_VERIFY_WARN) {
 590                         irg_verify(irg, VERIFY_ENFORCE_SSA);
 591                         be_check_dominance(irg);
 592                 } else if (be_options.verify_option == BE_VERIFY_ASSERT) {
 593                         assert(irg_verify(irg, VERIFY_ENFORCE_SSA) && "irg verification failed");
 594                         assert(be_check_dominance(irg) && "Dominance verification failed");
 595                 }
 596                 be_timer_pop(T_VERIFY);
 597
 598                 /* get a code generator for this graph. */
 599                 arch_env->impl->init_graph(irg);
 600
 601                 /* some transformations need to be done before abi introduce */
 602                 if (arch_env->impl->before_abi != NULL)
 603                         arch_env->impl->before_abi(irg);
 604
 605                 /* implement the ABI conventions. */
 606                 if (!arch_env->custom_abi) {
 607                         be_timer_push(T_ABI);
 608                         be_abi_introduce(irg);
 609                         be_timer_pop(T_ABI);
 610                         dump(DUMP_ABI, irg, "abi");
 611                 }
 612
 613                 /* We can't have Bad-blocks or critical edges in the backend.
 614                  * Before removing Bads, we remove unreachable code. */
 615                 optimize_graph_df(irg);
 616                 remove_critical_cf_edges(irg);
 617                 remove_bads(irg);
 618
 619                 /* We often have dead code reachable through out-edges here. So for
 620                  * now we rebuild edges (as we need correct user count for code
 621                  * selection) */
 622                 edges_deactivate(irg);
 623                 edges_activate(irg);
 624
 625                 dump(DUMP_PREPARED, irg, "before-code-selection");
 626
 627                 if (be_options.verify_option == BE_VERIFY_WARN) {
 628                         be_check_dominance(irg);
 629                 } else if (be_options.verify_option == BE_VERIFY_ASSERT) {
 630                         assert(be_check_dominance(irg) && "Dominance verification failed");
 631                 }
 632
 633                 /* perform codeselection */
 634                 be_timer_push(T_CODEGEN);
 635                 if (arch_env->impl->prepare_graph != NULL)
 636                         arch_env->impl->prepare_graph(irg);
 637                 be_timer_pop(T_CODEGEN);
 638
 639                 if (be_options.verify_option == BE_VERIFY_WARN) {
 640                         be_check_dominance(irg);
 641                 } else if (be_options.verify_option == BE_VERIFY_ASSERT) {
 642                         assert(be_check_dominance(irg) && "Dominance verification failed");
 643                 }
 644
 645                 dump(DUMP_PREPARED, irg, "code-selection");
 646
 647                 be_timer_push(T_EXECFREQ);
 648                 /**
 649                  * Create execution frequencies from profile data or estimate some
 650                  */
 651                 if (ir_profile_has_data())
 652                         birg->exec_freq = ir_create_execfreqs_from_profile(irg);
 653                 else {
 654                         /* TODO: edges are corrupt for EDGE_KIND_BLOCK after the local
 655                          * optimize graph phase merges blocks in the x86 backend */
 656                         edges_deactivate(irg);
 657                         birg->exec_freq = compute_execfreq(irg, 10);
 658                 }
 659                 be_timer_pop(T_EXECFREQ);
 660
 661
 662                 /* disabled for now, fails for EmptyFor.c and XXEndless.c */
 663                 /* be_live_chk_compare(irg); */
 664
 665                 /* schedule the irg */
 666                 be_timer_push(T_SCHED);
 667                 be_schedule_graph(irg);
 668                 be_timer_pop(T_SCHED);
 669
 670                 dump(DUMP_SCHED, irg, "sched");
 671
 672                 /* check schedule */
 673                 be_timer_push(T_VERIFY);
 674                 be_sched_verify(irg, be_options.verify_option);
 675                 be_timer_pop(T_VERIFY);
 676
 677                 /* introduce patterns to assure constraints */
 678                 be_timer_push(T_CONSTR);
 679                 /* we switch off optimizations here, because they might cause trouble */
 680                 save_optimization_state(&state);
 681                 set_optimize(0);
 682                 set_opt_cse(0);
 683
 684                 /* add Keeps for should_be_different constrained nodes  */
 685                 /* beware: needs schedule due to usage of be_ssa_constr */
 686                 assure_constraints(irg);
 687                 be_timer_pop(T_CONSTR);
 688
 689                 dump(DUMP_SCHED, irg, "assured");
 690
 691                 /* stuff needs to be done after scheduling but before register allocation */
 692                 be_timer_push(T_RA_PREPARATION);
 693                 if (arch_env->impl->before_ra != NULL)
 694                         arch_env->impl->before_ra(irg);
 695                 be_timer_pop(T_RA_PREPARATION);
 696
 697                 /* connect all stack modifying nodes together (see beabi.c) */
 698                 be_timer_push(T_ABI);
 699                 be_abi_fix_stack_nodes(irg);
 700                 be_timer_pop(T_ABI);
 701
 702                 dump(DUMP_SCHED, irg, "fix_stack");
 703
 704                 /* check schedule */
 705                 be_timer_push(T_VERIFY);
 706                 be_sched_verify(irg, be_options.verify_option);
 707                 be_timer_pop(T_VERIFY);
 708
 709                 if (stat_ev_enabled) {
 710                         stat_ev_dbl("bemain_costs_before_ra",
 711                                         be_estimate_irg_costs(irg, birg->exec_freq));
 712                         be_stat_ev("bemain_insns_before_ra", be_count_insns(irg));
 713                         be_stat_ev("bemain_blocks_before_ra", be_count_blocks(irg));
 714                 }
 715
 716                 /* Do register allocation */
 717                 be_allocate_registers(irg);
 718
 719                 stat_ev_dbl("bemain_costs_before_ra", be_estimate_irg_costs(irg, birg->exec_freq));
 720
 721                 dump(DUMP_RA, irg, "ra");
 722
 723                 be_timer_push(T_FINISH);
 724                 if (arch_env->impl->finish != NULL)
 725                         arch_env->impl->finish(irg);
 726                 be_timer_pop(T_FINISH);
 727
 728                 dump(DUMP_FINAL, irg, "finish");
 729
 730                 if (stat_ev_enabled) {
 731                         be_stat_ev("bemain_insns_finish", be_count_insns(irg));
 732                         be_stat_ev("bemain_blocks_finish", be_count_blocks(irg));
 733                 }
 734
 735                 /* check schedule and register allocation */
 736                 be_timer_push(T_VERIFY);
 737                 if (be_options.verify_option == BE_VERIFY_WARN) {
 738                         irg_verify(irg, VERIFY_ENFORCE_SSA);
 739                         be_check_dominance(irg);
 740                         be_verify_schedule(irg);
 741                         be_verify_register_allocation(irg);
 742                 } else if (be_options.verify_option == BE_VERIFY_ASSERT) {
 743                         assert(irg_verify(irg, VERIFY_ENFORCE_SSA) && "irg verification failed");
 744                         assert(be_check_dominance(irg) && "Dominance verification failed");
 745                         assert(be_verify_schedule(irg) && "Schedule verification failed");
 746                         assert(be_verify_register_allocation(irg)
 747                                && "register allocation verification failed");
 748
 749                 }
 750                 be_timer_pop(T_VERIFY);
 751
 752                 /* emit assembler code */
 753                 be_timer_push(T_EMIT);
 754                 if (arch_env->impl->emit != NULL)
 755                         arch_env->impl->emit(irg);
 756                 be_timer_pop(T_EMIT);
 757
 758                 dump(DUMP_FINAL, irg, "end");
 759
 760                 if (!arch_env->custom_abi) {
 761                         be_timer_push(T_ABI);
 762                         be_abi_free(irg);
 763                         be_timer_pop(T_ABI);
 764                 }
 765
 766                 restore_optimization_state(&state);
 767
 768                 be_timer_pop(T_OTHER);
 769
 770                 if (be_timing) {
 771                         be_timer_id_t t;
 772                         if (stat_ev_enabled) {
 773                                 for (t = T_FIRST; t < T_LAST+1; ++t) {
 774                                         char buf[128];
 775                                         snprintf(buf, sizeof(buf), "bemain_time_%s",
 776                                                  get_timer_name(t));
 777                                         stat_ev_dbl(buf, ir_timer_elapsed_usec(be_timers[i]));
 778                                 }
 779                         } else {
 780                                 printf("==>> IRG %s <<==\n",
 781                                        get_entity_name(get_irg_entity(irg)));
 782                                 for (t = T_FIRST; t < T_LAST+1; ++t) {
 783                                         double val = ir_timer_elapsed_usec(be_timers[t]) / 1000.0;
 784                                         printf("%-20s: %8.3lf msec\n", get_timer_name(t), val);
 785                                 }
 786                         }
 787                         for (t = T_FIRST; t < T_LAST+1; ++t) {
 788                                 ir_timer_stop(be_timers[t]);
 789                                 ir_timer_reset(be_timers[t]);
 790                         }
 791                 }
 792
 793                 be_free_birg(irg);
 794                 stat_ev_ctx_pop("bemain_irg");
 795         }
 796
 797         arch_env_end_codegeneration(arch_env);
 798
 799         ir_profile_free();
 800         be_done_env(&env);
 801
 802         be_info_free();
 803 }
 804
 805 /* Main interface to the frontend. */
 806 void be_main(FILE *file_handle, const char *cup_name)
 807 {
 808         ir_timer_t *t = NULL;
 809
 810         if (be_options.timing == BE_TIME_ON) {
 811                 t = ir_timer_new();
 812
 813                 if (ir_timer_enter_high_priority()) {
 814                         fprintf(stderr, "Warning: Could not enter high priority mode.\n");
 815                 }
 816
 817                 ir_timer_reset_and_start(t);
 818         }
 819
 820         if (be_options.statev) {
 821                 const char *dot = strrchr(cup_name, '.');
 822                 const char *pos = dot ? dot : cup_name + strlen(cup_name);
 823                 char       *buf = ALLOCAN(char, pos - cup_name + 1);
 824                 strncpy(buf, cup_name, pos - cup_name);
 825                 buf[pos - cup_name] = '\0';
 826
 827                 be_options.statev = 1;
 828                 stat_ev_begin(buf, be_options.filtev);
 829                 stat_ev_ctx_push_str("bemain_compilation_unit", cup_name);
 830         }
 831
 832         be_main_loop(file_handle, cup_name);
 833
 834         if (be_options.timing == BE_TIME_ON) {
 835                 ir_timer_stop(t);
 836                 ir_timer_leave_high_priority();
 837                 if (stat_ev_enabled) {
 838                         stat_ev_dbl("bemain_backend_time", ir_timer_elapsed_msec(t));
 839                 } else {
 840                         double val = ir_timer_elapsed_usec(t) / 1000.0;
 841                         printf("%-20s: %8.3lf msec\n", "BEMAINLOOP", val);
 842                 }
 843         }
 844
 845         if (be_options.statev) {
 846                 stat_ev_ctx_pop("bemain_compilation_unit");
 847                 stat_ev_end();
 848         }
 849 }
 850
 851 static int do_lower_for_target(ir_prog *irp, void *context)
 852 {
 853         be_lower_for_target();
 854         (void) context;
 855         (void) irp;
 856         return 0;
 857 }
 858
 859 ir_prog_pass_t *lower_for_target_pass(const char *name)
 860 {
 861         ir_prog_pass_t *pass = XMALLOCZ(ir_prog_pass_t);
 862         return def_prog_pass_constructor(pass,
 863                                          name ? name : "lower_for_target",
 864                                          do_lower_for_target);
 865 }