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

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