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