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