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"
63 #include "besched_t.h"
64 #include "belistsched.h"
66 #include "bespillbelady.h"
68 #include "bechordal_t.h"
70 #include "beifg_impl.h"
71 #include "becopyopt.h"
72 #include "becopystat.h"
73 #include "bessadestr.h"
76 #include "beschedmris.h"
79 #include "beprofile.h"
80 #include "be_dbgout.h"
84 #include "beilpsched.h"
87 /* options visible for anyone */
88 static be_options_t be_options = {
89 DUMP_NONE, /* dump flags */
90 BE_TIME_OFF, /* no timing */
91 0, /* no opt profile */
92 1, /* try to omit frame pointer */
93 0, /* no stabs debugging output */
94 BE_VRFY_WARN, /* verification level: warn */
95 BE_SCHED_LIST, /* scheduler: list scheduler */
96 "i44pc52.info.uni-karlsruhe.de", /* ilp server */
97 "cplex", /* ilp solver */
98 "", /* filename for statistic output */
102 static char config_file[256] = { 0 };
104 /* back end instruction set architecture to use */
105 static const arch_isa_if_t *isa_if = NULL;
107 /* possible dumping options */
108 static const lc_opt_enum_mask_items_t dump_items[] = {
109 { "none", DUMP_NONE },
110 { "initial", DUMP_INITIAL },
112 { "sched", DUMP_SCHED },
113 { "prepared", DUMP_PREPARED },
114 { "regalloc", DUMP_RA },
115 { "final", DUMP_FINAL },
117 { "all", 2 * DUMP_BE - 1 },
121 /* verify options. */
122 static const lc_opt_enum_int_items_t vrfy_items[] = {
123 { "off", BE_VRFY_OFF },
124 { "warn", BE_VRFY_WARN },
125 { "assert", BE_VRFY_ASSERT },
129 /* scheduling options. */
130 static const lc_opt_enum_int_items_t sched_items[] = {
131 { "list", BE_SCHED_LIST },
133 { "ilp", BE_SCHED_ILP },
134 #endif /* WITH_ILP */
138 static lc_opt_enum_mask_var_t dump_var = {
139 &be_options.dump_flags, dump_items
142 static lc_opt_enum_int_var_t vrfy_var = {
143 &be_options.vrfy_option, vrfy_items
146 static lc_opt_enum_int_var_t sched_var = {
147 &be_options.scheduler, sched_items
150 static const lc_opt_table_entry_t be_main_options[] = {
151 LC_OPT_ENT_STR ("config", "read another config file containing backend options", config_file, sizeof(config_file)),
152 LC_OPT_ENT_ENUM_MASK("dump", "dump irg on several occasions", &dump_var),
153 LC_OPT_ENT_NEGBOOL ("noomitfp", "do not omit frame pointer", &be_options.omit_fp),
154 LC_OPT_ENT_BOOL ("stabs", "enable stabs debug support", &be_options.stabs_debug_support),
155 LC_OPT_ENT_ENUM_PTR ("vrfy", "verify the backend irg", &vrfy_var),
156 LC_OPT_ENT_BOOL ("time", "get backend timing statistics", &be_options.timing),
157 LC_OPT_ENT_BOOL ("profile", "instrument the code for execution count profiling", &be_options.opt_profile),
158 LC_OPT_ENT_ENUM_PTR ("sched", "select a scheduler", &sched_var),
159 LC_OPT_ENT_STR ("statfile", "append statistics to file statfile", &be_options.stat_file_name, sizeof(be_options.stat_file_name)),
162 LC_OPT_ENT_STR ("ilp.server", "the ilp server name", be_options.ilp_server, sizeof(be_options.ilp_server)),
163 LC_OPT_ENT_STR ("ilp.solver", "the ilp solver name", be_options.ilp_solver, sizeof(be_options.ilp_solver)),
164 #endif /* WITH_ILP */
168 static be_module_list_entry_t *isa_ifs = NULL;
170 void be_register_isa_if(const char *name, const arch_isa_if_t *isa)
175 be_add_module_to_list(&isa_ifs, name, (void*) isa);
178 void be_opt_register(void)
180 lc_opt_entry_t *be_grp;
181 static int run_once = 0;
190 be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
191 lc_opt_add_table(be_grp, be_main_options);
193 be_add_module_list_opt(be_grp, "isa", "the instruction set architecture",
194 &isa_ifs, (void**) &isa_if);
197 /* Parse one argument. */
198 int be_parse_arg(const char *arg) {
199 lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
200 if (strcmp(arg, "help") == 0 || (arg[0] == '?' && arg[1] == '\0')) {
201 lc_opt_print_help(be_grp, stdout);
204 return lc_opt_from_single_arg(be_grp, NULL, arg, NULL);
207 /** The be parameters returned by default, all off. */
208 const static backend_params be_params = {
215 /* Perform schedule verification if requested. */
216 static void be_sched_vrfy(be_irg_t *birg, int vrfy_opt) {
217 if (vrfy_opt == BE_VRFY_WARN) {
218 be_verify_schedule(birg);
220 else if (vrfy_opt == BE_VRFY_ASSERT) {
221 assert(be_verify_schedule(birg) && "Schedule verification failed.");
225 /* Initialize the Firm backend. Must be run BEFORE init_firm()! */
226 const backend_params *be_init(void)
231 if (isa_if->get_params)
232 return isa_if->get_params();
237 * Initializes the main environment for the backend.
239 * @param env an empty environment
240 * @param file_handle the file handle where the output will be written to
242 static be_main_env_t *be_init_env(be_main_env_t *env, FILE *file_handle)
244 memset(env, 0, sizeof(*env));
245 obstack_init(&env->obst);
246 env->arch_env = obstack_alloc(&env->obst, sizeof(env->arch_env[0]));
247 env->options = &be_options;
249 arch_env_init(env->arch_env, isa_if, file_handle, env);
251 /* Register the irn handler of the architecture */
252 if (arch_isa_get_irn_handler(env->arch_env->isa))
253 arch_env_push_irn_handler(env->arch_env, arch_isa_get_irn_handler(env->arch_env->isa));
256 * Register the node handler of the back end infrastructure.
257 * This irn handler takes care of the platform independent
258 * spill, reload and perm nodes.
260 arch_env_push_irn_handler(env->arch_env, &be_node_irn_handler);
261 env->phi_handler = be_phi_handler_new(env->arch_env);
262 arch_env_push_irn_handler(env->arch_env, env->phi_handler);
264 env->db_handle = be_options.stabs_debug_support ? be_stabs_open(file_handle) : be_nulldbg_open();
268 static void be_done_env(be_main_env_t *env)
270 env->arch_env->isa->impl->done(env->arch_env->isa);
271 be_dbg_close(env->db_handle);
272 be_phi_handler_free(env->phi_handler);
273 obstack_free(&env->obst, NULL);
277 * A wrapper around a firm dumper. Dumps only, if
280 * @param mask a bitmask containing the reason what will be dumped
281 * @param irg the IR graph to dump
282 * @param suffix the suffix for the dumper
283 * @param dumper the dumper to be called
285 static void dump(int mask, ir_graph *irg, const char *suffix,
286 void (*dumper)(ir_graph *, const char *))
288 if(be_options.dump_flags & mask)
289 be_dump(irg, suffix, dumper);
293 * Prepare a backend graph for code generation and initialize its birg
295 static void initialize_birg(be_irg_t *birg, ir_graph *irg, be_main_env_t *env)
297 memset(birg, 0, sizeof(*birg));
299 birg->main_env = env;
301 edges_deactivate_kind(irg, EDGE_KIND_DEP);
302 edges_activate_kind(irg, EDGE_KIND_DEP);
304 dump(DUMP_INITIAL, irg, "-begin", dump_ir_block_graph);
306 be_stat_init_irg(env->arch_env, irg);
307 be_do_stat_nodes(irg, "01 Begin");
309 /* set the current graph (this is important for several firm functions) */
310 current_ir_graph = irg;
312 /* Normalize proj nodes. */
313 normalize_proj_nodes(irg);
315 /* create multiple return nodes */
316 /* TODO: find out why this does nothing */
317 normalize_n_returns(irg);
319 /* Remove critical edges */
320 remove_critical_cf_edges(irg);
322 /* Ensure, that the ir_edges are computed. */
325 /* reset the phi handler. */
326 be_phi_handler_reset(env->phi_handler);
328 set_irg_phase_state(irg, phase_backend);
331 #define BE_TIMER_PUSH(timer) \
332 if (be_options.timing == BE_TIME_ON) { \
333 int res = lc_timer_push(timer); \
334 if (be_options.vrfy_option == BE_VRFY_ASSERT) \
335 assert(res && "Timer already on stack, cannot be pushed twice."); \
336 else if (be_options.vrfy_option == BE_VRFY_WARN && ! res) \
337 fprintf(stderr, "Timer %s already on stack, cannot be pushed twice.\n", \
338 lc_timer_get_name(timer)); \
340 #define BE_TIMER_POP(timer) \
341 if (be_options.timing == BE_TIME_ON) { \
342 lc_timer_t *tmp = lc_timer_pop(); \
343 if (be_options.vrfy_option == BE_VRFY_ASSERT) \
344 assert(tmp == timer && "Attempt to pop wrong timer."); \
345 else if (be_options.vrfy_option == BE_VRFY_WARN && tmp != timer) \
346 fprintf(stderr, "Attempt to pop wrong timer. %s is on stack, trying to pop %s.\n", \
347 lc_timer_get_name(tmp), lc_timer_get_name(timer)); \
351 #define BE_TIMER_ONLY(code) do { if (be_options.timing == BE_TIME_ON) { code; } } while(0)
354 * The Firm backend main loop.
355 * Do architecture specific lowering for all graphs
356 * and call the architecture specific code generator.
358 * @param file_handle the file handle the output will be written to
359 * @param cup_name name of the compilation unit
361 static void be_main_loop(FILE *file_handle, const char *cup_name)
366 unsigned num_nodes_b = 0;
367 unsigned num_nodes_a = 0;
368 unsigned num_nodes_r = 0;
369 char prof_filename[256];
370 static const char suffix[] = ".prof";
373 ir_graph **irg_list, **backend_irg_list;
375 lc_timer_t *t_abi = NULL;
376 lc_timer_t *t_codegen = NULL;
377 lc_timer_t *t_sched = NULL;
378 lc_timer_t *t_constr = NULL;
379 lc_timer_t *t_regalloc = NULL;
380 lc_timer_t *t_finish = NULL;
381 lc_timer_t *t_emit = NULL;
382 lc_timer_t *t_other = NULL;
383 lc_timer_t *t_verify = NULL;
385 if (be_options.timing == BE_TIME_ON) {
386 t_abi = lc_timer_register("beabi", "be abi introduction");
387 t_codegen = lc_timer_register("codegen", "codegeneration");
388 t_sched = lc_timer_register("sched", "scheduling");
389 t_constr = lc_timer_register("constr", "assure constraints");
390 t_regalloc = lc_timer_register("regalloc", "register allocation");
391 t_finish = lc_timer_register("finish", "graph finish");
392 t_emit = lc_timer_register("emiter", "code emiter");
393 t_verify = lc_timer_register("verify", "graph verification");
394 t_other = lc_timer_register("other", "other");
397 be_init_env(&env, file_handle);
399 isa = arch_env_get_isa(env.arch_env);
401 be_dbg_so(env.db_handle, cup_name);
402 be_dbg_types(env.db_handle);
404 /* backend may provide an ordered list of irgs where code should be generated for */
405 irg_list = NEW_ARR_F(ir_graph *, 0);
406 backend_irg_list = arch_isa_get_backend_irg_list(isa, &irg_list);
408 /* we might need 1 birg more for instrumentation constructor */
409 num_birgs = backend_irg_list ? ARR_LEN(backend_irg_list) : get_irp_n_irgs();
410 birgs = alloca(sizeof(birgs[0]) * (num_birgs + 1));
412 /* First: initialize all birgs */
413 for(i = 0; i < num_birgs; ++i) {
414 ir_graph *irg = backend_irg_list ? backend_irg_list[i] : get_irp_irg(i);
415 initialize_birg(&birgs[i], irg, &env);
420 Get the filename for the profiling data.
421 Beware: '\0' is already included in sizeof(suffix)
423 memset(prof_filename, 0, sizeof(prof_filename));
424 strncpy(prof_filename, cup_name, sizeof(prof_filename) - sizeof(suffix));
425 strcat(prof_filename, suffix);
428 Next: Either instruments all irgs with profiling code
429 or try to read in profile data for current translation unit.
431 if (be_options.opt_profile) {
432 ir_graph *prof_init_irg = be_profile_instrument(prof_filename, profile_default);
433 initialize_birg(&birgs[num_birgs], prof_init_irg, &env);
435 set_method_img_section(get_irg_entity(prof_init_irg), section_constructors);
437 be_profile_read(prof_filename);
441 for (i = 0; i < num_birgs; ++i) {
442 be_irg_t *birg = &birgs[i];
443 ir_graph *irg = birg->irg;
444 optimization_state_t state;
445 const arch_code_generator_if_t *cg_if;
448 /* set the current graph (this is important for several firm functions) */
449 current_ir_graph = irg;
451 #ifdef FIRM_STATISTICS
452 if(be_stat_ev_is_active()) {
453 ir_snprintf(irg_name, sizeof(irg_name), "%F", irg);
454 be_stat_tags[STAT_TAG_CLS] = "<all>";
455 be_stat_tags[STAT_TAG_IRG] = irg_name;
456 be_stat_ev_push(be_stat_tags, STAT_TAG_LAST, be_stat_file);
460 /* stop and reset timers */
462 LC_STOP_AND_RESET_TIMER(t_abi);
463 LC_STOP_AND_RESET_TIMER(t_codegen);
464 LC_STOP_AND_RESET_TIMER(t_sched);
465 LC_STOP_AND_RESET_TIMER(t_constr);
466 LC_STOP_AND_RESET_TIMER(t_regalloc);
467 LC_STOP_AND_RESET_TIMER(t_finish);
468 LC_STOP_AND_RESET_TIMER(t_emit);
469 LC_STOP_AND_RESET_TIMER(t_verify);
470 LC_STOP_AND_RESET_TIMER(t_other);
472 BE_TIMER_PUSH(t_other); /* t_other */
474 /* Verify the initial graph */
475 BE_TIMER_PUSH(t_verify);
476 if (be_options.vrfy_option == BE_VRFY_WARN) {
477 irg_verify(irg, VRFY_ENFORCE_SSA);
478 be_check_dominance(irg);
479 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
480 assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
481 assert(be_check_dominance(irg) && "Dominance verification failed");
483 BE_TIMER_POP(t_verify);
485 BE_TIMER_ONLY(num_nodes_b = get_num_reachable_nodes(irg));
487 /* Get the code generator interface. */
488 cg_if = isa->impl->get_code_generator_if(isa);
490 /* get a code generator for this graph. */
491 birg->cg = cg_if->init(birg);
493 /* some transformations need to be done before abi introduce */
494 arch_code_generator_before_abi(birg->cg);
496 /* reset the phi handler. */
497 be_phi_handler_reset(env.phi_handler);
499 /* implement the ABI conventions. */
500 BE_TIMER_PUSH(t_abi);
501 birg->abi = be_abi_introduce(birg);
504 dump(DUMP_ABI, irg, "-abi", dump_ir_block_graph);
505 be_do_stat_nodes(irg, "02 Abi");
507 if (be_options.vrfy_option == BE_VRFY_WARN) {
508 be_check_dominance(irg);
509 be_verify_out_edges(irg);
510 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
511 assert(be_verify_out_edges(irg));
512 assert(be_check_dominance(irg) && "Dominance verification failed");
516 BE_TIMER_PUSH(t_codegen);
517 arch_code_generator_prepare_graph(birg->cg);
518 BE_TIMER_POP(t_codegen);
520 be_do_stat_nodes(irg, "03 Prepare");
522 dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph);
523 BE_TIMER_ONLY(num_nodes_r = get_num_reachable_nodes(irg));
525 if (be_options.vrfy_option == BE_VRFY_WARN) {
526 be_check_dominance(irg);
527 be_verify_out_edges(irg);
528 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
529 assert(be_verify_out_edges(irg));
530 assert(be_check_dominance(irg) && "Dominance verification failed");
534 * Create execution frequencies from profile data or estimate some
536 if (be_profile_has_data())
537 birg->exec_freq = be_create_execfreqs_from_profile(irg);
539 birg->exec_freq = compute_execfreq(irg, 10);
541 be_live_chk_compare(birg);
543 /* let backend prepare scheduling */
544 BE_TIMER_PUSH(t_codegen);
545 arch_code_generator_before_sched(birg->cg);
546 BE_TIMER_POP(t_codegen);
548 /* schedule the irg */
549 BE_TIMER_PUSH(t_sched);
550 switch (be_options.scheduler) {
552 fprintf(stderr, "Warning: invalid scheduler (%d) selected, falling back to list scheduler.\n", be_options.scheduler);
554 list_sched(birg, &be_options);
558 be_ilp_sched(birg, &be_options);
560 #endif /* WITH_ILP */
562 BE_TIMER_POP(t_sched);
564 dump(DUMP_SCHED, irg, "-sched", dump_ir_block_graph_sched);
567 BE_TIMER_PUSH(t_verify);
568 be_sched_vrfy(birg, be_options.vrfy_option);
569 BE_TIMER_POP(t_verify);
571 be_do_stat_nodes(irg, "04 Schedule");
573 /* introduce patterns to assure constraints */
574 BE_TIMER_PUSH(t_constr);
575 /* we switch off optimizations here, because they might cause trouble */
576 save_optimization_state(&state);
578 set_opt_normalize(0);
580 /* add Keeps for should_be_different constrained nodes */
581 /* beware: needs schedule due to usage of be_ssa_constr */
582 assure_constraints(birg);
583 BE_TIMER_POP(t_constr);
585 dump(DUMP_SCHED, irg, "-assured", dump_ir_block_graph_sched);
586 be_do_stat_nodes(irg, "05 Constraints");
588 /* stuff needs to be done after scheduling but before register allocation */
589 BE_TIMER_PUSH(t_codegen);
590 arch_code_generator_before_ra(birg->cg);
591 BE_TIMER_POP(t_codegen);
593 /* connect all stack modifying nodes together (see beabi.c) */
594 BE_TIMER_PUSH(t_abi);
595 be_abi_fix_stack_nodes(birg->abi);
598 dump(DUMP_SCHED, irg, "-fix_stack", dump_ir_block_graph_sched);
601 BE_TIMER_PUSH(t_verify);
602 be_sched_vrfy(birg, be_options.vrfy_option);
603 BE_TIMER_POP(t_verify);
605 /* do some statistics */
606 be_do_stat_reg_pressure(birg);
608 #ifdef FIRM_STATISTICS
609 if(be_stat_ev_is_active()) {
610 be_stat_ev_l("costs_before_ra",
611 (long) be_estimate_irg_costs(irg, env.arch_env, birg->exec_freq));
615 /* Do register allocation */
616 BE_TIMER_PUSH(t_regalloc);
617 be_allocate_registers(birg);
618 BE_TIMER_POP(t_regalloc);
620 #ifdef FIRM_STATISTICS
621 if(be_stat_ev_is_active()) {
622 be_stat_ev_l("costs_after_ra",
623 (long) be_estimate_irg_costs(irg, env.arch_env, birg->exec_freq));
627 dump(DUMP_RA, irg, "-ra", dump_ir_block_graph_sched);
628 be_do_stat_nodes(irg, "06 Register Allocation");
630 /* let the code generator prepare the graph for emitter */
631 BE_TIMER_PUSH(t_finish);
632 arch_code_generator_after_ra(birg->cg);
633 BE_TIMER_POP(t_finish);
635 /* fix stack offsets */
636 BE_TIMER_PUSH(t_abi);
637 be_abi_fix_stack_nodes(birg->abi);
638 be_remove_dead_nodes_from_schedule(irg);
639 be_abi_fix_stack_bias(birg->abi);
642 dump(DUMP_SCHED, irg, "-fix_stack_after_ra", dump_ir_block_graph_sched);
644 BE_TIMER_PUSH(t_finish);
645 arch_code_generator_finish(birg->cg);
646 BE_TIMER_POP(t_finish);
648 dump(DUMP_FINAL, irg, "-finish", dump_ir_block_graph_sched);
650 /* check schedule and register allocation */
651 BE_TIMER_PUSH(t_verify);
652 if (be_options.vrfy_option == BE_VRFY_WARN) {
653 irg_verify(irg, VRFY_ENFORCE_SSA);
654 be_check_dominance(irg);
655 be_verify_out_edges(irg);
656 be_verify_schedule(birg);
657 be_verify_register_allocation(env.arch_env, irg);
658 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
659 assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
660 assert(be_verify_out_edges(irg) && "out edge verification failed");
661 assert(be_check_dominance(irg) && "Dominance verification failed");
662 assert(be_verify_schedule(birg) && "Schedule verification failed");
663 assert(be_verify_register_allocation(env.arch_env, irg)
664 && "register allocation verification failed");
667 BE_TIMER_POP(t_verify);
669 /* emit assembler code */
670 BE_TIMER_PUSH(t_emit);
671 arch_code_generator_done(birg->cg);
672 BE_TIMER_POP(t_emit);
674 dump(DUMP_FINAL, irg, "-end", dump_ir_block_graph_sched);
676 BE_TIMER_PUSH(t_abi);
677 be_abi_free(birg->abi);
680 be_do_stat_nodes(irg, "07 Final");
681 restore_optimization_state(&state);
683 BE_TIMER_ONLY(num_nodes_a = get_num_reachable_nodes(irg));
684 BE_TIMER_POP(t_other);
686 #define LC_EMIT(timer) \
687 if(!be_stat_ev_is_active()) { \
688 printf("%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0); \
690 be_stat_ev_l(lc_timer_get_name(timer), lc_timer_elapsed_msec(timer)); \
692 #define LC_EMIT_RA(timer) \
693 if(!be_stat_ev_is_active()) { \
694 printf("\t%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0); \
696 be_stat_ev_l(lc_timer_get_name(timer), lc_timer_elapsed_msec(timer)); \
699 if(!be_stat_ev_is_active()) {
700 printf("==>> IRG %s <<==\n", get_entity_name(get_irg_entity(irg)));
701 printf("# nodes at begin: %u\n", num_nodes_b);
702 printf("# nodes before ra: %u\n", num_nodes_r);
703 printf("# nodes at end: %u\n\n", num_nodes_a);
710 if(global_ra_timer != NULL) {
711 LC_EMIT_RA(global_ra_timer->t_prolog);
712 LC_EMIT_RA(global_ra_timer->t_live);
713 LC_EMIT_RA(global_ra_timer->t_spill);
714 LC_EMIT_RA(global_ra_timer->t_spillslots);
715 LC_EMIT_RA(global_ra_timer->t_color);
716 LC_EMIT_RA(global_ra_timer->t_ifg);
717 LC_EMIT_RA(global_ra_timer->t_copymin);
718 LC_EMIT_RA(global_ra_timer->t_ssa);
719 LC_EMIT_RA(global_ra_timer->t_epilog);
720 LC_EMIT_RA(global_ra_timer->t_verify);
721 LC_EMIT_RA(global_ra_timer->t_other);
733 /* switched off due to statistics (statistic module needs all irgs) */
734 #if 0 /* STA needs irgs */
735 #ifdef FIRM_STATISTICS
736 if (! stat_is_active())
737 #endif /* FIRM_STATISTICS */
740 if(be_stat_ev_is_active()) {
752 /* Main interface to the frontend. */
753 void be_main(FILE *file_handle, const char *cup_name)
755 lc_timer_t *t = NULL;
757 /* The user specified another config file to read. do that now. */
758 if(strlen(config_file) > 0) {
761 if((f = fopen(config_file, "rt")) != NULL) {
762 lc_opt_from_file(config_file, f, NULL);
767 if (be_options.timing == BE_TIME_ON) {
768 t = lc_timer_register("bemain", "measure complete bemain loop");
770 if (lc_timer_enter_high_priority()) {
771 fprintf(stderr, "Warning: Could not enter high priority mode.\n");
774 lc_timer_reset_and_start(t);
777 #ifdef FIRM_STATISTICS
778 be_init_stat_file(be_options.stat_file_name, cup_name);
781 /* never build code for pseudo irgs */
782 set_visit_pseudo_irgs(0);
786 be_main_loop(file_handle, cup_name);
788 if (be_options.timing == BE_TIME_ON) {
790 lc_timer_leave_high_priority();
791 if(be_stat_ev_is_active()) {
792 be_stat_ev_l("backend_time", lc_timer_elapsed_msec(t));
794 printf("%-20s: %lu msec\n", "BEMAINLOOP", lc_timer_elapsed_msec(t));
798 #ifdef FIRM_STATISTICS
799 be_close_stat_file();
803 /** The debug info retriever function. */
804 static retrieve_dbg_func retrieve_dbg = NULL;
806 /* Sets a debug info retriever. */
807 void be_set_debug_retrieve(retrieve_dbg_func func) {
811 /* Retrieve the debug info. */
812 const char *be_retrieve_dbg_info(const dbg_info *dbg, unsigned *line) {
814 return retrieve_dbg(dbg, line);
820 unsigned be_put_ignore_regs(const be_irg_t *birg, const arch_register_class_t *cls, bitset_t *bs)
823 bs = bitset_alloca(cls->n_regs);
825 bitset_clear_all(bs);
827 assert(bitset_size(bs) == (unsigned)cls->n_regs);
828 arch_put_non_ignore_regs(birg->main_env->arch_env, cls, bs);
830 be_abi_put_ignore_regs(birg->abi, cls, bs);
832 return bitset_popcnt(bs);