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