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