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