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

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