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

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