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