2 * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
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.
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.
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
22 * @brief Main Backend driver.
23 * @author Sebastian Hack
34 #include <libcore/lc_opts.h>
35 #include <libcore/lc_opts_enum.h>
36 #include <libcore/lc_timing.h>
47 #include "iredges_t.h"
61 #include "besched_t.h"
62 #include "belistsched.h"
64 #include "bespillbelady.h"
66 #include "bechordal_t.h"
68 #include "beifg_impl.h"
69 #include "becopyopt.h"
70 #include "becopystat.h"
71 #include "bessadestr.h"
74 #include "beschedmris.h"
77 #include "beprofile.h"
78 #include "be_dbgout.h"
82 #include "beilpsched.h"
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 "", /* filename for statistic output */
100 static char config_file[256] = { 0 };
102 /* back end instruction set architecture to use */
103 static const arch_isa_if_t *isa_if = NULL;
105 /* possible dumping options */
106 static const lc_opt_enum_mask_items_t dump_items[] = {
107 { "none", DUMP_NONE },
108 { "initial", DUMP_INITIAL },
110 { "sched", DUMP_SCHED },
111 { "prepared", DUMP_PREPARED },
112 { "regalloc", DUMP_RA },
113 { "final", DUMP_FINAL },
115 { "all", 2 * DUMP_BE - 1 },
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 },
127 /* scheduling options. */
128 static const lc_opt_enum_int_items_t sched_items[] = {
129 { "list", BE_SCHED_LIST },
131 { "ilp", BE_SCHED_ILP },
132 #endif /* WITH_ILP */
136 static lc_opt_enum_mask_var_t dump_var = {
137 &be_options.dump_flags, dump_items
140 static lc_opt_enum_int_var_t vrfy_var = {
141 &be_options.vrfy_option, vrfy_items
144 static lc_opt_enum_int_var_t sched_var = {
145 &be_options.scheduler, sched_items
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_STR ("statfile", "append statistics to file statfile", &be_options.stat_file_name, sizeof(be_options.stat_file_name)),
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 */
166 static be_module_list_entry_t *isa_ifs = NULL;
168 void be_register_isa_if(const char *name, const arch_isa_if_t *isa)
173 be_add_module_to_list(&isa_ifs, name, (void*) isa);
176 void be_opt_register(void)
178 lc_opt_entry_t *be_grp;
179 static int run_once = 0;
188 be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
189 lc_opt_add_table(be_grp, be_main_options);
191 be_add_module_list_opt(be_grp, "isa", "the instruction set architecture",
192 &isa_ifs, (void**) &isa_if);
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);
202 return lc_opt_from_single_arg(be_grp, NULL, arg, NULL);
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 */
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);
221 else if (vrfy_opt == BE_VRFY_ASSERT) {
222 assert(be_verify_schedule(birg) && "Schedule verification failed.");
226 /* Initialize the Firm backend. Must be run BEFORE init_firm()! */
227 const backend_params *be_init(void)
232 if (isa_if->get_params)
233 return isa_if->get_params();
238 * Initializes the main environment for the backend.
240 * @param env an empty environment
241 * @param file_handle the file handle where the output will be written to
243 static be_main_env_t *be_init_env(be_main_env_t *env, FILE *file_handle)
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;
250 arch_env_init(env->arch_env, isa_if, file_handle, env);
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));
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.
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);
265 env->db_handle = be_options.stabs_debug_support ? be_stabs_open(file_handle) : be_nulldbg_open();
269 static void be_done_env(be_main_env_t *env)
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);
278 * A wrapper around a firm dumper. Dumps only, if
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
286 static void dump(int mask, ir_graph *irg, const char *suffix,
287 void (*dumper)(ir_graph *, const char *))
289 if(be_options.dump_flags & mask)
290 be_dump(irg, suffix, dumper);
294 * Prepare a backend graph for code generation and initialize its birg
296 static void initialize_birg(be_irg_t *birg, ir_graph *irg, be_main_env_t *env)
298 memset(birg, 0, sizeof(*birg));
300 birg->main_env = env;
302 edges_deactivate_kind(irg, EDGE_KIND_DEP);
303 edges_activate_kind(irg, EDGE_KIND_DEP);
305 dump(DUMP_INITIAL, irg, "-begin", dump_ir_block_graph);
307 be_stat_init_irg(env->arch_env, irg);
308 be_do_stat_nodes(irg, "01 Begin");
310 /* set the current graph (this is important for several firm functions) */
311 current_ir_graph = irg;
313 /* Normalize proj nodes. */
314 normalize_proj_nodes(irg);
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);
320 /* Remove critical edges */
321 remove_critical_cf_edges(irg);
323 /* Ensure, that the ir_edges are computed. */
326 /* reset the phi handler. */
327 be_phi_handler_reset(env->phi_handler);
329 set_irg_phase_state(irg, phase_backend);
331 dump(DUMP_INITIAL, irg, "-prepared", dump_ir_block_graph);
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)); \
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)); \
354 #define BE_TIMER_ONLY(code) do { if (be_options.timing == BE_TIME_ON) { code; } } while(0)
357 * The Firm backend main loop.
358 * Do architecture specific lowering for all graphs
359 * and call the architecture specific code generator.
361 * @param file_handle the file handle the output will be written to
362 * @param cup_name name of the compilation unit
364 static void be_main_loop(FILE *file_handle, const char *cup_name)
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";
376 ir_graph **irg_list, **backend_irg_list;
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;
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");
400 be_init_env(&env, file_handle);
402 isa = arch_env_get_isa(env.arch_env);
404 be_dbg_so(env.db_handle, cup_name);
405 be_dbg_types(env.db_handle);
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);
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));
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);
423 Get the filename for the profiling data.
424 Beware: '\0' is already included in sizeof(suffix)
426 memset(prof_filename, 0, sizeof(prof_filename));
427 strncpy(prof_filename, cup_name, sizeof(prof_filename) - sizeof(suffix));
428 strcat(prof_filename, suffix);
431 Next: Either instruments all irgs with profiling code
432 or try to read in profile data for current translation unit.
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);
438 set_method_img_section(get_irg_entity(prof_init_irg), section_constructors);
440 be_profile_read(prof_filename);
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;
451 /* set the current graph (this is important for several firm functions) */
452 current_ir_graph = irg;
454 #ifdef FIRM_STATISTICS
455 if(be_stat_ev_is_active()) {
456 ir_snprintf(irg_name, sizeof(irg_name), "%F", irg);
457 be_stat_tags[STAT_TAG_CLS] = "<all>";
458 be_stat_tags[STAT_TAG_IRG] = irg_name;
459 be_stat_ev_push(be_stat_tags, STAT_TAG_LAST, be_stat_file);
463 /* stop and reset timers */
465 LC_STOP_AND_RESET_TIMER(t_abi);
466 LC_STOP_AND_RESET_TIMER(t_codegen);
467 LC_STOP_AND_RESET_TIMER(t_sched);
468 LC_STOP_AND_RESET_TIMER(t_constr);
469 LC_STOP_AND_RESET_TIMER(t_regalloc);
470 LC_STOP_AND_RESET_TIMER(t_finish);
471 LC_STOP_AND_RESET_TIMER(t_emit);
472 LC_STOP_AND_RESET_TIMER(t_verify);
473 LC_STOP_AND_RESET_TIMER(t_other);
475 BE_TIMER_PUSH(t_other); /* t_other */
477 /* Verify the initial graph */
478 BE_TIMER_PUSH(t_verify);
479 if (be_options.vrfy_option == BE_VRFY_WARN) {
480 irg_verify(irg, VRFY_ENFORCE_SSA);
481 be_check_dominance(irg);
482 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
483 assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
484 assert(be_check_dominance(irg) && "Dominance verification failed");
486 BE_TIMER_POP(t_verify);
488 BE_TIMER_ONLY(num_nodes_b = get_num_reachable_nodes(irg));
490 /* Get the code generator interface. */
491 cg_if = isa->impl->get_code_generator_if(isa);
493 /* get a code generator for this graph. */
494 birg->cg = cg_if->init(birg);
496 /* some transformations need to be done before abi introduce */
497 arch_code_generator_before_abi(birg->cg);
499 /* reset the phi handler. */
500 be_phi_handler_reset(env.phi_handler);
502 /* implement the ABI conventions. */
503 BE_TIMER_PUSH(t_abi);
504 birg->abi = be_abi_introduce(birg);
507 dump(DUMP_ABI, irg, "-abi", dump_ir_block_graph);
508 be_do_stat_nodes(irg, "02 Abi");
510 if (be_options.vrfy_option == BE_VRFY_WARN) {
511 be_check_dominance(irg);
512 be_verify_out_edges(irg);
513 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
514 assert(be_verify_out_edges(irg));
515 assert(be_check_dominance(irg) && "Dominance verification failed");
519 BE_TIMER_PUSH(t_codegen);
520 arch_code_generator_prepare_graph(birg->cg);
521 BE_TIMER_POP(t_codegen);
523 be_do_stat_nodes(irg, "03 Prepare");
525 dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph);
526 BE_TIMER_ONLY(num_nodes_r = get_num_reachable_nodes(irg));
528 if (be_options.vrfy_option == BE_VRFY_WARN) {
529 be_check_dominance(irg);
530 be_verify_out_edges(irg);
531 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
532 assert(be_verify_out_edges(irg));
533 assert(be_check_dominance(irg) && "Dominance verification failed");
537 * Create execution frequencies from profile data or estimate some
539 if (be_profile_has_data())
540 birg->exec_freq = be_create_execfreqs_from_profile(irg);
542 birg->exec_freq = compute_execfreq(irg, 10);
545 /* disabled for now, fails for EmptyFor.c and XXEndless.c */
546 /* be_live_chk_compare(birg); */
548 /* let backend prepare scheduling */
549 BE_TIMER_PUSH(t_codegen);
550 arch_code_generator_before_sched(birg->cg);
551 BE_TIMER_POP(t_codegen);
553 /* schedule the irg */
554 BE_TIMER_PUSH(t_sched);
555 switch (be_options.scheduler) {
557 fprintf(stderr, "Warning: invalid scheduler (%d) selected, falling back to list scheduler.\n", be_options.scheduler);
559 list_sched(birg, &be_options);
563 be_ilp_sched(birg, &be_options);
565 #endif /* WITH_ILP */
567 BE_TIMER_POP(t_sched);
569 dump(DUMP_SCHED, irg, "-sched", dump_ir_block_graph_sched);
572 BE_TIMER_PUSH(t_verify);
573 be_sched_vrfy(birg, be_options.vrfy_option);
574 BE_TIMER_POP(t_verify);
576 be_do_stat_nodes(irg, "04 Schedule");
578 /* introduce patterns to assure constraints */
579 BE_TIMER_PUSH(t_constr);
580 /* we switch off optimizations here, because they might cause trouble */
581 save_optimization_state(&state);
583 set_opt_normalize(0);
585 /* add Keeps for should_be_different constrained nodes */
586 /* beware: needs schedule due to usage of be_ssa_constr */
587 assure_constraints(birg);
588 BE_TIMER_POP(t_constr);
590 dump(DUMP_SCHED, irg, "-assured", dump_ir_block_graph_sched);
591 be_do_stat_nodes(irg, "05 Constraints");
593 /* stuff needs to be done after scheduling but before register allocation */
594 BE_TIMER_PUSH(t_codegen);
595 arch_code_generator_before_ra(birg->cg);
596 BE_TIMER_POP(t_codegen);
598 /* connect all stack modifying nodes together (see beabi.c) */
599 BE_TIMER_PUSH(t_abi);
600 be_abi_fix_stack_nodes(birg->abi);
603 dump(DUMP_SCHED, irg, "-fix_stack", dump_ir_block_graph_sched);
606 BE_TIMER_PUSH(t_verify);
607 be_sched_vrfy(birg, be_options.vrfy_option);
608 BE_TIMER_POP(t_verify);
610 /* do some statistics */
611 be_do_stat_reg_pressure(birg);
613 #ifdef FIRM_STATISTICS
614 if(be_stat_ev_is_active()) {
615 be_stat_ev_l("costs_before_ra",
616 (long) be_estimate_irg_costs(irg, env.arch_env, birg->exec_freq));
620 /* Do register allocation */
621 BE_TIMER_PUSH(t_regalloc);
622 be_allocate_registers(birg);
623 BE_TIMER_POP(t_regalloc);
625 #ifdef FIRM_STATISTICS
626 if(be_stat_ev_is_active()) {
627 be_stat_ev_l("costs_after_ra",
628 (long) be_estimate_irg_costs(irg, env.arch_env, birg->exec_freq));
632 dump(DUMP_RA, irg, "-ra", dump_ir_block_graph_sched);
633 be_do_stat_nodes(irg, "06 Register Allocation");
635 /* let the code generator prepare the graph for emitter */
636 BE_TIMER_PUSH(t_finish);
637 arch_code_generator_after_ra(birg->cg);
638 BE_TIMER_POP(t_finish);
640 /* fix stack offsets */
641 BE_TIMER_PUSH(t_abi);
642 be_abi_fix_stack_nodes(birg->abi);
643 be_remove_dead_nodes_from_schedule(irg);
644 be_abi_fix_stack_bias(birg->abi);
647 dump(DUMP_SCHED, irg, "-fix_stack_after_ra", dump_ir_block_graph_sched);
649 BE_TIMER_PUSH(t_finish);
650 arch_code_generator_finish(birg->cg);
651 BE_TIMER_POP(t_finish);
653 dump(DUMP_FINAL, irg, "-finish", dump_ir_block_graph_sched);
655 /* check schedule and register allocation */
656 BE_TIMER_PUSH(t_verify);
657 if (be_options.vrfy_option == BE_VRFY_WARN) {
658 irg_verify(irg, VRFY_ENFORCE_SSA);
659 be_check_dominance(irg);
660 be_verify_out_edges(irg);
661 be_verify_schedule(birg);
662 be_verify_register_allocation(env.arch_env, irg);
663 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
664 assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
665 assert(be_verify_out_edges(irg) && "out edge verification failed");
666 assert(be_check_dominance(irg) && "Dominance verification failed");
667 assert(be_verify_schedule(birg) && "Schedule verification failed");
668 assert(be_verify_register_allocation(env.arch_env, irg)
669 && "register allocation verification failed");
672 BE_TIMER_POP(t_verify);
674 /* emit assembler code */
675 BE_TIMER_PUSH(t_emit);
676 arch_code_generator_done(birg->cg);
677 BE_TIMER_POP(t_emit);
679 dump(DUMP_FINAL, irg, "-end", dump_ir_block_graph_sched);
681 BE_TIMER_PUSH(t_abi);
682 be_abi_free(birg->abi);
685 be_do_stat_nodes(irg, "07 Final");
686 restore_optimization_state(&state);
688 BE_TIMER_ONLY(num_nodes_a = get_num_reachable_nodes(irg));
689 BE_TIMER_POP(t_other);
691 #define LC_EMIT(timer) \
692 if(!be_stat_ev_is_active()) { \
693 printf("%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0); \
695 be_stat_ev_l(lc_timer_get_name(timer), lc_timer_elapsed_msec(timer)); \
697 #define LC_EMIT_RA(timer) \
698 if(!be_stat_ev_is_active()) { \
699 printf("\t%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0); \
701 be_stat_ev_l(lc_timer_get_name(timer), lc_timer_elapsed_msec(timer)); \
704 if(!be_stat_ev_is_active()) {
705 printf("==>> IRG %s <<==\n", get_entity_name(get_irg_entity(irg)));
706 printf("# nodes at begin: %u\n", num_nodes_b);
707 printf("# nodes before ra: %u\n", num_nodes_r);
708 printf("# nodes at end: %u\n\n", num_nodes_a);
715 if(global_ra_timer != NULL) {
716 LC_EMIT_RA(global_ra_timer->t_prolog);
717 LC_EMIT_RA(global_ra_timer->t_live);
718 LC_EMIT_RA(global_ra_timer->t_spill);
719 LC_EMIT_RA(global_ra_timer->t_spillslots);
720 LC_EMIT_RA(global_ra_timer->t_color);
721 LC_EMIT_RA(global_ra_timer->t_ifg);
722 LC_EMIT_RA(global_ra_timer->t_copymin);
723 LC_EMIT_RA(global_ra_timer->t_ssa);
724 LC_EMIT_RA(global_ra_timer->t_epilog);
725 LC_EMIT_RA(global_ra_timer->t_verify);
726 LC_EMIT_RA(global_ra_timer->t_other);
738 /* switched off due to statistics (statistic module needs all irgs) */
739 #if 0 /* STA needs irgs */
740 #ifdef FIRM_STATISTICS
741 if (! stat_is_active())
742 #endif /* FIRM_STATISTICS */
745 if(be_stat_ev_is_active()) {
757 /* Main interface to the frontend. */
758 void be_main(FILE *file_handle, const char *cup_name)
760 lc_timer_t *t = NULL;
762 /* The user specified another config file to read. do that now. */
763 if(strlen(config_file) > 0) {
766 if((f = fopen(config_file, "rt")) != NULL) {
767 lc_opt_from_file(config_file, f, NULL);
772 if (be_options.timing == BE_TIME_ON) {
773 t = lc_timer_register("bemain", "measure complete bemain loop");
775 if (lc_timer_enter_high_priority()) {
776 fprintf(stderr, "Warning: Could not enter high priority mode.\n");
779 lc_timer_reset_and_start(t);
782 #ifdef FIRM_STATISTICS
783 be_init_stat_file(be_options.stat_file_name, cup_name);
786 /* never build code for pseudo irgs */
787 set_visit_pseudo_irgs(0);
791 be_main_loop(file_handle, cup_name);
793 if (be_options.timing == BE_TIME_ON) {
795 lc_timer_leave_high_priority();
796 if(be_stat_ev_is_active()) {
797 be_stat_ev_l("backend_time", lc_timer_elapsed_msec(t));
799 printf("%-20s: %lu msec\n", "BEMAINLOOP", lc_timer_elapsed_msec(t));
803 #ifdef FIRM_STATISTICS
804 be_close_stat_file();
808 /** The debug info retriever function. */
809 static retrieve_dbg_func retrieve_dbg = NULL;
811 /* Sets a debug info retriever. */
812 void be_set_debug_retrieve(retrieve_dbg_func func) {
816 /* Retrieve the debug info. */
817 const char *be_retrieve_dbg_info(const dbg_info *dbg, unsigned *line) {
819 return retrieve_dbg(dbg, line);
825 unsigned be_put_ignore_regs(const be_irg_t *birg, const arch_register_class_t *cls, bitset_t *bs)
828 bs = bitset_alloca(cls->n_regs);
830 bitset_clear_all(bs);
832 assert(bitset_size(bs) == (unsigned)cls->n_regs);
833 arch_put_non_ignore_regs(birg->main_env->arch_env, cls, bs);
835 be_abi_put_ignore_regs(birg->abi, cls, bs);
837 return bitset_popcnt(bs);