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

   1 /*
   2  * Copyright (C) 1995-2007 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 #ifdef HAVE_CONFIG_H
  28 #include "config.h"
  29 #endif
  30
  31 #include <stdarg.h>
  32 #include <stdio.h>
  33
  34 #include <libcore/lc_opts.h>
  35 #include <libcore/lc_opts_enum.h>
  36 #include <libcore/lc_timing.h>
  37
  38 #include "obst.h"
  39 #include "bitset.h"
  40
  41 #include "irprog.h"
  42 #include "irgopt.h"
  43 #include "irgraph.h"
  44 #include "irdump.h"
  45 #include "phiclass.h"
  46 #include "irdom_t.h"
  47 #include "iredges_t.h"
  48 #include "irloop_t.h"
  49 #include "irtools.h"
  50 #include "irvrfy.h"
  51 #include "irprintf.h"
  52 #include "return.h"
  53 #include "firmstat.h"
  54 #include "cfopt.h"
  55 #include "execfreq.h"
  56
  57 #include "bearch_t.h"
  58 #include "be_t.h"
  59 #include "bemodule.h"
  60 #include "beutil.h"
  61 #include "benode_t.h"
  62 #include "beirgmod.h"
  63 #include "besched_t.h"
  64 #include "belistsched.h"
  65 #include "belive_t.h"
  66 #include "bespillbelady.h"
  67 #include "bera.h"
  68 #include "bechordal_t.h"
  69 #include "beifg.h"
  70 #include "beifg_impl.h"
  71 #include "becopyopt.h"
  72 #include "becopystat.h"
  73 #include "bessadestr.h"
  74 #include "beabi.h"
  75 #include "belower.h"
  76 #include "beschedmris.h"
  77 #include "bestat.h"
  78 #include "beverify.h"
  79 #include "beprofile.h"
  80 #include "be_dbgout.h"
  81 #include "beirg_t.h"
  82
  83 #ifdef WITH_ILP
  84 #include "beilpsched.h"
  85 #endif /* WITH_ILP */
  86
  87 /* options visible for anyone */
  88 static be_options_t be_options = {
  89         DUMP_NONE,                         /* dump flags */
  90         BE_TIME_OFF,                       /* no timing */
  91         0,                                 /* no opt profile */
  92         1,                                 /* try to omit frame pointer */
  93         0,                                 /* no stabs debugging output */
  94         BE_VRFY_WARN,                      /* verification level: warn */
  95         BE_SCHED_LIST,                     /* scheduler: list scheduler */
  96         "i44pc52.info.uni-karlsruhe.de",   /* ilp server */
  97         "cplex",                           /* ilp solver */
  98         "",                                /* filename for statistic output */
  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 vrfy_items[] = {
 123         { "off",    BE_VRFY_OFF    },
 124         { "warn",   BE_VRFY_WARN   },
 125         { "assert", BE_VRFY_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 vrfy_var = {
 143         &be_options.vrfy_option, vrfy_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_NEGBOOL  ("noomitfp", "do not omit frame pointer",                           &be_options.omit_fp),
 154         LC_OPT_ENT_BOOL     ("stabs",    "enable stabs debug support",                          &be_options.stabs_debug_support),
 155         LC_OPT_ENT_ENUM_PTR ("vrfy",     "verify the backend irg",                              &vrfy_var),
 156         LC_OPT_ENT_BOOL     ("time",     "get backend timing statistics",                       &be_options.timing),
 157         LC_OPT_ENT_BOOL     ("profile",  "instrument the code for execution count profiling",   &be_options.opt_profile),
 158         LC_OPT_ENT_ENUM_PTR ("sched",    "select a scheduler",                                  &sched_var),
 159         LC_OPT_ENT_STR      ("statfile", "append statistics to file statfile", &be_options.stat_file_name, sizeof(be_options.stat_file_name)),
 160
 161 #ifdef WITH_ILP
 162         LC_OPT_ENT_STR ("ilp.server", "the ilp server name", be_options.ilp_server, sizeof(be_options.ilp_server)),
 163         LC_OPT_ENT_STR ("ilp.solver", "the ilp solver name", be_options.ilp_solver, sizeof(be_options.ilp_solver)),
 164 #endif /* WITH_ILP */
 165         { NULL }
 166 };
 167
 168 static be_module_list_entry_t *isa_ifs = NULL;
 169
 170 void be_register_isa_if(const char *name, const arch_isa_if_t *isa)
 171 {
 172         if(isa_if == NULL)
 173                 isa_if = isa;
 174
 175         be_add_module_to_list(&isa_ifs, name, (void*) isa);
 176 }
 177
 178 void be_opt_register(void)
 179 {
 180         lc_opt_entry_t *be_grp;
 181         static int run_once = 0;
 182
 183         if (run_once) {
 184                 return;
 185         }
 186         run_once     = 1;
 187
 188         be_init_modules();
 189
 190         be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
 191         lc_opt_add_table(be_grp, be_main_options);
 192
 193         be_add_module_list_opt(be_grp, "isa", "the instruction set architecture",
 194                                &isa_ifs, (void**) &isa_if);
 195 }
 196
 197 /* Parse one argument. */
 198 int be_parse_arg(const char *arg) {
 199         lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
 200         if (strcmp(arg, "help") == 0 || (arg[0] == '?' && arg[1] == '\0')) {
 201                 lc_opt_print_help(be_grp, stdout);
 202                 return -1;
 203         }
 204         return lc_opt_from_single_arg(be_grp, NULL, arg, NULL);
 205 }
 206
 207 /** The be parameters returned by default, all off. */
 208 const static backend_params be_params = {
 209         NULL,
 210         NULL,
 211         0,
 212         NULL,
 213 };
 214
 215 /* Perform schedule verification if requested. */
 216 static void be_sched_vrfy(be_irg_t *birg, int vrfy_opt) {
 217         if (vrfy_opt == BE_VRFY_WARN) {
 218                 be_verify_schedule(birg);
 219         }
 220         else if (vrfy_opt == BE_VRFY_ASSERT) {
 221                 assert(be_verify_schedule(birg) && "Schedule verification failed.");
 222         }
 223 }
 224
 225 /* Initialize the Firm backend. Must be run BEFORE init_firm()! */
 226 const backend_params *be_init(void)
 227 {
 228         be_opt_register();
 229         be_init_modules();
 230
 231         if (isa_if->get_params)
 232                 return isa_if->get_params();
 233         return &be_params;
 234 }
 235
 236 /**
 237  * Initializes the main environment for the backend.
 238  *
 239  * @param env          an empty environment
 240  * @param file_handle  the file handle where the output will be written to
 241  */
 242 static be_main_env_t *be_init_env(be_main_env_t *env, FILE *file_handle)
 243 {
 244         memset(env, 0, sizeof(*env));
 245         obstack_init(&env->obst);
 246         env->arch_env = obstack_alloc(&env->obst, sizeof(env->arch_env[0]));
 247         env->options  = &be_options;
 248
 249         arch_env_init(env->arch_env, isa_if, file_handle, env);
 250
 251         /* Register the irn handler of the architecture */
 252         if (arch_isa_get_irn_handler(env->arch_env->isa))
 253                 arch_env_push_irn_handler(env->arch_env, arch_isa_get_irn_handler(env->arch_env->isa));
 254
 255         /*
 256          * Register the node handler of the back end infrastructure.
 257          * This irn handler takes care of the platform independent
 258          * spill, reload and perm nodes.
 259          */
 260         arch_env_push_irn_handler(env->arch_env, &be_node_irn_handler);
 261         env->phi_handler = be_phi_handler_new(env->arch_env);
 262         arch_env_push_irn_handler(env->arch_env, env->phi_handler);
 263
 264         env->db_handle = be_options.stabs_debug_support ? be_stabs_open(file_handle) : be_nulldbg_open();
 265         return env;
 266 }
 267
 268 static void be_done_env(be_main_env_t *env)
 269 {
 270         env->arch_env->isa->impl->done(env->arch_env->isa);
 271         be_dbg_close(env->db_handle);
 272         be_phi_handler_free(env->phi_handler);
 273         obstack_free(&env->obst, NULL);
 274 }
 275
 276 /**
 277  * A wrapper around a firm dumper. Dumps only, if
 278  * flags are enabled.
 279  *
 280  * @param mask    a bitmask containing the reason what will be dumped
 281  * @param irg     the IR graph to dump
 282  * @param suffix  the suffix for the dumper
 283  * @param dumper  the dumper to be called
 284  */
 285 static void dump(int mask, ir_graph *irg, const char *suffix,
 286                  void (*dumper)(ir_graph *, const char *))
 287 {
 288         if(be_options.dump_flags & mask)
 289                 be_dump(irg, suffix, dumper);
 290 }
 291
 292 /**
 293  * Prepare a backend graph for code generation and initialize its birg
 294  */
 295 static void initialize_birg(be_irg_t *birg, ir_graph *irg, be_main_env_t *env)
 296 {
 297         memset(birg, 0, sizeof(*birg));
 298         birg->irg = irg;
 299         birg->main_env = env;
 300
 301         edges_deactivate_kind(irg, EDGE_KIND_DEP);
 302         edges_activate_kind(irg, EDGE_KIND_DEP);
 303
 304         dump(DUMP_INITIAL, irg, "-begin", dump_ir_block_graph);
 305
 306         be_stat_init_irg(env->arch_env, irg);
 307         be_do_stat_nodes(irg, "01 Begin");
 308
 309         /* set the current graph (this is important for several firm functions) */
 310         current_ir_graph = irg;
 311
 312         /* Normalize proj nodes. */
 313         normalize_proj_nodes(irg);
 314
 315         /* create multiple return nodes */
 316         /* TODO: find out why this does nothing */
 317         normalize_n_returns(irg);
 318
 319         /* Remove critical edges */
 320         remove_critical_cf_edges(irg);
 321
 322         /* Ensure, that the ir_edges are computed. */
 323         edges_assure(irg);
 324
 325         /* reset the phi handler. */
 326         be_phi_handler_reset(env->phi_handler);
 327
 328         set_irg_phase_state(irg, phase_backend);
 329 }
 330
 331 #define BE_TIMER_PUSH(timer)                                                        \
 332         if (be_options.timing == BE_TIME_ON) {                                          \
 333                 int res = lc_timer_push(timer);                                             \
 334                 if (be_options.vrfy_option == BE_VRFY_ASSERT)                               \
 335                         assert(res && "Timer already on stack, cannot be pushed twice.");       \
 336                 else if (be_options.vrfy_option == BE_VRFY_WARN && ! res)                   \
 337                         fprintf(stderr, "Timer %s already on stack, cannot be pushed twice.\n", \
 338                                 lc_timer_get_name(timer));                                          \
 339         }
 340 #define BE_TIMER_POP(timer)                                                                    \
 341         if (be_options.timing == BE_TIME_ON) {                                                     \
 342                 lc_timer_t *tmp = lc_timer_pop();                                                      \
 343                 if (be_options.vrfy_option == BE_VRFY_ASSERT)                                          \
 344                         assert(tmp == timer && "Attempt to pop wrong timer.");                             \
 345                 else if (be_options.vrfy_option == BE_VRFY_WARN && tmp != timer)                       \
 346                         fprintf(stderr, "Attempt to pop wrong timer. %s is on stack, trying to pop %s.\n", \
 347                                 lc_timer_get_name(tmp), lc_timer_get_name(timer));                             \
 348                 timer = tmp;                                                                           \
 349         }
 350
 351 #define BE_TIMER_ONLY(code)   do { if (be_options.timing == BE_TIME_ON) { code; } } while(0)
 352
 353 /**
 354  * The Firm backend main loop.
 355  * Do architecture specific lowering for all graphs
 356  * and call the architecture specific code generator.
 357  *
 358  * @param file_handle   the file handle the output will be written to
 359  * @param cup_name      name of the compilation unit
 360  */
 361 static void be_main_loop(FILE *file_handle, const char *cup_name)
 362 {
 363         int i;
 364         arch_isa_t *isa;
 365         be_main_env_t env;
 366         unsigned num_nodes_b = 0;
 367         unsigned num_nodes_a = 0;
 368         unsigned num_nodes_r = 0;
 369         char prof_filename[256];
 370         static const char suffix[] = ".prof";
 371         be_irg_t *birgs;
 372         int num_birgs;
 373         ir_graph **irg_list, **backend_irg_list;
 374
 375         lc_timer_t *t_abi      = NULL;
 376         lc_timer_t *t_codegen  = NULL;
 377         lc_timer_t *t_sched    = NULL;
 378         lc_timer_t *t_constr   = NULL;
 379         lc_timer_t *t_regalloc = NULL;
 380         lc_timer_t *t_finish   = NULL;
 381         lc_timer_t *t_emit     = NULL;
 382         lc_timer_t *t_other    = NULL;
 383         lc_timer_t *t_verify   = NULL;
 384
 385         if (be_options.timing == BE_TIME_ON) {
 386                 t_abi      = lc_timer_register("beabi",    "be abi introduction");
 387                 t_codegen  = lc_timer_register("codegen",  "codegeneration");
 388                 t_sched    = lc_timer_register("sched",    "scheduling");
 389                 t_constr   = lc_timer_register("constr",   "assure constraints");
 390                 t_regalloc = lc_timer_register("regalloc", "register allocation");
 391                 t_finish   = lc_timer_register("finish",   "graph finish");
 392                 t_emit     = lc_timer_register("emiter",   "code emiter");
 393                 t_verify   = lc_timer_register("verify",   "graph verification");
 394                 t_other    = lc_timer_register("other",    "other");
 395         }
 396
 397         be_init_env(&env, file_handle);
 398
 399         isa = arch_env_get_isa(env.arch_env);
 400
 401         be_dbg_so(env.db_handle, cup_name);
 402         be_dbg_types(env.db_handle);
 403
 404         /* backend may provide an ordered list of irgs where code should be generated for */
 405         irg_list         = NEW_ARR_F(ir_graph *, 0);
 406         backend_irg_list = arch_isa_get_backend_irg_list(isa, &irg_list);
 407
 408         /* we might need 1 birg more for instrumentation constructor */
 409         num_birgs = backend_irg_list ? ARR_LEN(backend_irg_list) : get_irp_n_irgs();
 410         birgs     = alloca(sizeof(birgs[0]) * (num_birgs + 1));
 411
 412         /* First: initialize all birgs */
 413         for(i = 0; i < num_birgs; ++i) {
 414                 ir_graph *irg = backend_irg_list ? backend_irg_list[i] : get_irp_irg(i);
 415                 initialize_birg(&birgs[i], irg, &env);
 416         }
 417         DEL_ARR_F(irg_list);
 418
 419         /*
 420                 Get the filename for the profiling data.
 421                 Beware: '\0' is already included in sizeof(suffix)
 422         */
 423         memset(prof_filename, 0, sizeof(prof_filename));
 424         strncpy(prof_filename, cup_name, sizeof(prof_filename) - sizeof(suffix));
 425         strcat(prof_filename, suffix);
 426
 427         /*
 428                 Next: Either instruments all irgs with profiling code
 429                 or try to read in profile data for current translation unit.
 430         */
 431         if (be_options.opt_profile) {
 432                 ir_graph *prof_init_irg = be_profile_instrument(prof_filename, profile_default);
 433                 initialize_birg(&birgs[num_birgs], prof_init_irg, &env);
 434                 num_birgs++;
 435                 set_method_img_section(get_irg_entity(prof_init_irg), section_constructors);
 436         } else {
 437                 be_profile_read(prof_filename);
 438         }
 439
 440         /* For all graphs */
 441         for (i = 0; i < num_birgs; ++i) {
 442                 be_irg_t *birg = &birgs[i];
 443                 ir_graph *irg  = birg->irg;
 444                 optimization_state_t state;
 445                 const arch_code_generator_if_t *cg_if;
 446                 char irg_name[128];
 447
 448                 /* set the current graph (this is important for several firm functions) */
 449                 current_ir_graph = irg;
 450
 451 #ifdef FIRM_STATISTICS
 452                 if(be_stat_ev_is_active()) {
 453                         ir_snprintf(irg_name, sizeof(irg_name), "%F", irg);
 454                         be_stat_tags[STAT_TAG_CLS] = "<all>";
 455                         be_stat_tags[STAT_TAG_IRG] = irg_name;
 456                         be_stat_ev_push(be_stat_tags, STAT_TAG_LAST, be_stat_file);
 457                 }
 458 #endif
 459
 460                 /* stop and reset timers */
 461                 BE_TIMER_ONLY(
 462                         LC_STOP_AND_RESET_TIMER(t_abi);
 463                         LC_STOP_AND_RESET_TIMER(t_codegen);
 464                         LC_STOP_AND_RESET_TIMER(t_sched);
 465                         LC_STOP_AND_RESET_TIMER(t_constr);
 466                         LC_STOP_AND_RESET_TIMER(t_regalloc);
 467                         LC_STOP_AND_RESET_TIMER(t_finish);
 468                         LC_STOP_AND_RESET_TIMER(t_emit);
 469                         LC_STOP_AND_RESET_TIMER(t_verify);
 470                         LC_STOP_AND_RESET_TIMER(t_other);
 471                 );
 472                 BE_TIMER_PUSH(t_other);   /* t_other */
 473
 474                 /* Verify the initial graph */
 475                 BE_TIMER_PUSH(t_verify);
 476                 if (be_options.vrfy_option == BE_VRFY_WARN) {
 477                         irg_verify(irg, VRFY_ENFORCE_SSA);
 478                         be_check_dominance(irg);
 479                 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
 480                         assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
 481                         assert(be_check_dominance(irg) && "Dominance verification failed");
 482                 }
 483                 BE_TIMER_POP(t_verify);
 484
 485                 BE_TIMER_ONLY(num_nodes_b = get_num_reachable_nodes(irg));
 486
 487                 /* Get the code generator interface. */
 488                 cg_if = isa->impl->get_code_generator_if(isa);
 489
 490                 /* get a code generator for this graph. */
 491                 birg->cg = cg_if->init(birg);
 492
 493                 /* some transformations need to be done before abi introduce */
 494                 arch_code_generator_before_abi(birg->cg);
 495
 496                 /* reset the phi handler. */
 497                 be_phi_handler_reset(env.phi_handler);
 498
 499                 /* implement the ABI conventions. */
 500                 BE_TIMER_PUSH(t_abi);
 501                 birg->abi = be_abi_introduce(birg);
 502                 BE_TIMER_POP(t_abi);
 503
 504                 dump(DUMP_ABI, irg, "-abi", dump_ir_block_graph);
 505                 be_do_stat_nodes(irg, "02 Abi");
 506
 507                 if (be_options.vrfy_option == BE_VRFY_WARN) {
 508                         be_check_dominance(irg);
 509                         be_verify_out_edges(irg);
 510                 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
 511                         assert(be_verify_out_edges(irg));
 512                         assert(be_check_dominance(irg) && "Dominance verification failed");
 513                 }
 514
 515                 /* generate code */
 516                 BE_TIMER_PUSH(t_codegen);
 517                 arch_code_generator_prepare_graph(birg->cg);
 518                 BE_TIMER_POP(t_codegen);
 519
 520                 be_do_stat_nodes(irg, "03 Prepare");
 521
 522                 dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph);
 523                 BE_TIMER_ONLY(num_nodes_r = get_num_reachable_nodes(irg));
 524
 525                 if (be_options.vrfy_option == BE_VRFY_WARN) {
 526                         be_check_dominance(irg);
 527                         be_verify_out_edges(irg);
 528                 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
 529                         assert(be_verify_out_edges(irg));
 530                         assert(be_check_dominance(irg) && "Dominance verification failed");
 531                 }
 532
 533                 /**
 534                  * Create execution frequencies from profile data or estimate some
 535                  */
 536                 if (be_profile_has_data())
 537                         birg->exec_freq = be_create_execfreqs_from_profile(irg);
 538                 else
 539                         birg->exec_freq = compute_execfreq(irg, 10);
 540
 541
 542                 /* disabled for now, fails for EmptyFor.c and XXEndless.c */
 543                 /* be_live_chk_compare(birg); */
 544
 545                 /* let backend prepare scheduling */
 546                 BE_TIMER_PUSH(t_codegen);
 547                 arch_code_generator_before_sched(birg->cg);
 548                 BE_TIMER_POP(t_codegen);
 549
 550                 /* schedule the irg */
 551                 BE_TIMER_PUSH(t_sched);
 552                 switch (be_options.scheduler) {
 553                         default:
 554                                 fprintf(stderr, "Warning: invalid scheduler (%d) selected, falling back to list scheduler.\n", be_options.scheduler);
 555                         case BE_SCHED_LIST:
 556                                 list_sched(birg, &be_options);
 557                                 break;
 558 #ifdef WITH_ILP
 559                         case BE_SCHED_ILP:
 560                                 be_ilp_sched(birg, &be_options);
 561                                 break;
 562 #endif /* WITH_ILP */
 563                 };
 564                 BE_TIMER_POP(t_sched);
 565
 566                 dump(DUMP_SCHED, irg, "-sched", dump_ir_block_graph_sched);
 567
 568                 /* check schedule */
 569                 BE_TIMER_PUSH(t_verify);
 570                 be_sched_vrfy(birg, be_options.vrfy_option);
 571                 BE_TIMER_POP(t_verify);
 572
 573                 be_do_stat_nodes(irg, "04 Schedule");
 574
 575                 /* introduce patterns to assure constraints */
 576                 BE_TIMER_PUSH(t_constr);
 577                 /* we switch off optimizations here, because they might cause trouble */
 578                 save_optimization_state(&state);
 579                 set_optimize(0);
 580                 set_opt_normalize(0);
 581
 582                 /* add Keeps for should_be_different constrained nodes  */
 583                 /* beware: needs schedule due to usage of be_ssa_constr */
 584                 assure_constraints(birg);
 585                 BE_TIMER_POP(t_constr);
 586
 587                 dump(DUMP_SCHED, irg, "-assured", dump_ir_block_graph_sched);
 588                 be_do_stat_nodes(irg, "05 Constraints");
 589
 590                 /* stuff needs to be done after scheduling but before register allocation */
 591                 BE_TIMER_PUSH(t_codegen);
 592                 arch_code_generator_before_ra(birg->cg);
 593                 BE_TIMER_POP(t_codegen);
 594
 595                 /* connect all stack modifying nodes together (see beabi.c) */
 596                 BE_TIMER_PUSH(t_abi);
 597                 be_abi_fix_stack_nodes(birg->abi);
 598                 BE_TIMER_POP(t_abi);
 599
 600                 dump(DUMP_SCHED, irg, "-fix_stack", dump_ir_block_graph_sched);
 601
 602                 /* check schedule */
 603                 BE_TIMER_PUSH(t_verify);
 604                 be_sched_vrfy(birg, be_options.vrfy_option);
 605                 BE_TIMER_POP(t_verify);
 606
 607                 /* do some statistics */
 608                 be_do_stat_reg_pressure(birg);
 609
 610 #ifdef FIRM_STATISTICS
 611                 if(be_stat_ev_is_active()) {
 612                         be_stat_ev_l("costs_before_ra",
 613                                         (long) be_estimate_irg_costs(irg, env.arch_env, birg->exec_freq));
 614                 }
 615 #endif
 616
 617                 /* Do register allocation */
 618                 BE_TIMER_PUSH(t_regalloc);
 619                 be_allocate_registers(birg);
 620                 BE_TIMER_POP(t_regalloc);
 621
 622 #ifdef FIRM_STATISTICS
 623                 if(be_stat_ev_is_active()) {
 624                         be_stat_ev_l("costs_after_ra",
 625                                         (long) be_estimate_irg_costs(irg, env.arch_env, birg->exec_freq));
 626                 }
 627 #endif
 628
 629                 dump(DUMP_RA, irg, "-ra", dump_ir_block_graph_sched);
 630                 be_do_stat_nodes(irg, "06 Register Allocation");
 631
 632                 /* let the code generator prepare the graph for emitter */
 633                 BE_TIMER_PUSH(t_finish);
 634                 arch_code_generator_after_ra(birg->cg);
 635                 BE_TIMER_POP(t_finish);
 636
 637                 /* fix stack offsets */
 638                 BE_TIMER_PUSH(t_abi);
 639                 be_abi_fix_stack_nodes(birg->abi);
 640                 be_remove_dead_nodes_from_schedule(irg);
 641                 be_abi_fix_stack_bias(birg->abi);
 642                 BE_TIMER_POP(t_abi);
 643
 644                 dump(DUMP_SCHED, irg, "-fix_stack_after_ra", dump_ir_block_graph_sched);
 645
 646                 BE_TIMER_PUSH(t_finish);
 647                 arch_code_generator_finish(birg->cg);
 648                 BE_TIMER_POP(t_finish);
 649
 650                 dump(DUMP_FINAL, irg, "-finish", dump_ir_block_graph_sched);
 651
 652                 /* check schedule and register allocation */
 653                 BE_TIMER_PUSH(t_verify);
 654                 if (be_options.vrfy_option == BE_VRFY_WARN) {
 655                         irg_verify(irg, VRFY_ENFORCE_SSA);
 656                         be_check_dominance(irg);
 657                         be_verify_out_edges(irg);
 658                         be_verify_schedule(birg);
 659                         be_verify_register_allocation(env.arch_env, irg);
 660                 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
 661                         assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
 662                         assert(be_verify_out_edges(irg) && "out edge verification failed");
 663                         assert(be_check_dominance(irg) && "Dominance verification failed");
 664                         assert(be_verify_schedule(birg) && "Schedule verification failed");
 665                         assert(be_verify_register_allocation(env.arch_env, irg)
 666                                && "register allocation verification failed");
 667
 668                 }
 669                 BE_TIMER_POP(t_verify);
 670
 671                 /* emit assembler code */
 672                 BE_TIMER_PUSH(t_emit);
 673                 arch_code_generator_done(birg->cg);
 674                 BE_TIMER_POP(t_emit);
 675
 676                 dump(DUMP_FINAL, irg, "-end", dump_ir_block_graph_sched);
 677
 678                 BE_TIMER_PUSH(t_abi);
 679                 be_abi_free(birg->abi);
 680                 BE_TIMER_POP(t_abi);
 681
 682                 be_do_stat_nodes(irg, "07 Final");
 683                 restore_optimization_state(&state);
 684
 685                 BE_TIMER_ONLY(num_nodes_a = get_num_reachable_nodes(irg));
 686                 BE_TIMER_POP(t_other);
 687
 688 #define LC_EMIT(timer)  \
 689         if(!be_stat_ev_is_active()) { \
 690                 printf("%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0); \
 691         } else { \
 692                 be_stat_ev_l(lc_timer_get_name(timer), lc_timer_elapsed_msec(timer)); \
 693         }
 694 #define LC_EMIT_RA(timer) \
 695         if(!be_stat_ev_is_active()) { \
 696                 printf("\t%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0); \
 697         } else { \
 698                 be_stat_ev_l(lc_timer_get_name(timer), lc_timer_elapsed_msec(timer)); \
 699         }
 700                 BE_TIMER_ONLY(
 701                         if(!be_stat_ev_is_active()) {
 702                                 printf("==>> IRG %s <<==\n", get_entity_name(get_irg_entity(irg)));
 703                                 printf("# nodes at begin:  %u\n", num_nodes_b);
 704                                 printf("# nodes before ra: %u\n", num_nodes_r);
 705                                 printf("# nodes at end:    %u\n\n", num_nodes_a);
 706                         }
 707                         LC_EMIT(t_abi);
 708                         LC_EMIT(t_codegen);
 709                         LC_EMIT(t_sched);
 710                         LC_EMIT(t_constr);
 711                         LC_EMIT(t_regalloc);
 712                         if(global_ra_timer != NULL) {
 713                                 LC_EMIT_RA(global_ra_timer->t_prolog);
 714                                 LC_EMIT_RA(global_ra_timer->t_live);
 715                                 LC_EMIT_RA(global_ra_timer->t_spill);
 716                                 LC_EMIT_RA(global_ra_timer->t_spillslots);
 717                                 LC_EMIT_RA(global_ra_timer->t_color);
 718                                 LC_EMIT_RA(global_ra_timer->t_ifg);
 719                                 LC_EMIT_RA(global_ra_timer->t_copymin);
 720                                 LC_EMIT_RA(global_ra_timer->t_ssa);
 721                                 LC_EMIT_RA(global_ra_timer->t_epilog);
 722                                 LC_EMIT_RA(global_ra_timer->t_verify);
 723                                 LC_EMIT_RA(global_ra_timer->t_other);
 724                         }
 725                         LC_EMIT(t_finish);
 726                         LC_EMIT(t_emit);
 727                         LC_EMIT(t_verify);
 728                         LC_EMIT(t_other);
 729                 );
 730 #undef LC_EMIT_RA
 731 #undef LC_EMIT
 732
 733                 be_free_birg(birg);
 734
 735         /* switched off due to statistics (statistic module needs all irgs) */
 736 #if 0   /* STA needs irgs */
 737 #ifdef FIRM_STATISTICS
 738                 if (! stat_is_active())
 739 #endif /* FIRM_STATISTICS */
 740                         free_ir_graph(irg);
 741 #endif /* if 0 */
 742                 if(be_stat_ev_is_active()) {
 743                         be_stat_ev_pop();
 744                 }
 745         }
 746         be_profile_free();
 747         be_done_env(&env);
 748
 749 #undef BE_TIMER_POP
 750 #undef BE_TIMER_PUSH
 751 #undef BE_TIMER_ONLY
 752 }
 753
 754 /* Main interface to the frontend. */
 755 void be_main(FILE *file_handle, const char *cup_name)
 756 {
 757         lc_timer_t *t = NULL;
 758
 759         /* The user specified another config file to read. do that now. */
 760         if(strlen(config_file) > 0) {
 761                 FILE *f;
 762
 763                 if((f = fopen(config_file, "rt")) != NULL) {
 764                         lc_opt_from_file(config_file, f, NULL);
 765                         fclose(f);
 766                 }
 767         }
 768
 769         if (be_options.timing == BE_TIME_ON) {
 770                 t = lc_timer_register("bemain", "measure complete bemain loop");
 771
 772                 if (lc_timer_enter_high_priority()) {
 773                         fprintf(stderr, "Warning: Could not enter high priority mode.\n");
 774                 }
 775
 776                 lc_timer_reset_and_start(t);
 777         }
 778
 779 #ifdef FIRM_STATISTICS
 780         be_init_stat_file(be_options.stat_file_name, cup_name);
 781 #endif
 782
 783         /* never build code for pseudo irgs */
 784         set_visit_pseudo_irgs(0);
 785
 786         be_node_init();
 787
 788         be_main_loop(file_handle, cup_name);
 789
 790         if (be_options.timing == BE_TIME_ON) {
 791                 lc_timer_stop(t);
 792                 lc_timer_leave_high_priority();
 793                 if(be_stat_ev_is_active()) {
 794                         be_stat_ev_l("backend_time", lc_timer_elapsed_msec(t));
 795                 } else {
 796                         printf("%-20s: %lu msec\n", "BEMAINLOOP", lc_timer_elapsed_msec(t));
 797                 }
 798         }
 799
 800 #ifdef FIRM_STATISTICS
 801         be_close_stat_file();
 802 #endif
 803 }
 804
 805 /** The debug info retriever function. */
 806 static retrieve_dbg_func retrieve_dbg = NULL;
 807
 808 /* Sets a debug info retriever. */
 809 void be_set_debug_retrieve(retrieve_dbg_func func) {
 810         retrieve_dbg = func;
 811 }
 812
 813 /* Retrieve the debug info. */
 814 const char *be_retrieve_dbg_info(const dbg_info *dbg, unsigned *line) {
 815         if (retrieve_dbg)
 816                 return retrieve_dbg(dbg, line);
 817
 818         *line = 0;
 819         return NULL;
 820 }
 821
 822 unsigned be_put_ignore_regs(const be_irg_t *birg, const arch_register_class_t *cls, bitset_t *bs)
 823 {
 824         if (bs == NULL)
 825                 bs = bitset_alloca(cls->n_regs);
 826         else
 827                 bitset_clear_all(bs);
 828
 829         assert(bitset_size(bs) == (unsigned)cls->n_regs);
 830         arch_put_non_ignore_regs(birg->main_env->arch_env, cls, bs);
 831         bitset_flip_all(bs);
 832         be_abi_put_ignore_regs(birg->abi, cls, bs);
 833
 834         return bitset_popcnt(bs);
 835 }