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