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