3 * @author Sebastian Hack
15 #include <libcore/lc_opts.h>
16 #include <libcore/lc_opts_enum.h>
17 #include <libcore/lc_timing.h>
18 #endif /* WITH_LIBCORE */
29 #include "iredges_t.h"
45 #include "besched_t.h"
46 #include "belistsched.h"
48 #include "bespillbelady.h"
50 #include "beraextern.h"
51 #include "bechordal_t.h"
53 #include "beifg_impl.h"
54 #include "becopyopt.h"
55 #include "becopystat.h"
56 #include "bessadestr.h"
59 #include "beschedmris.h"
62 #include "beprofile.h"
63 #include "be_dbgout.h"
66 #include "beilpsched.h"
69 /* options visible for anyone */
70 static be_options_t be_options = {
71 DUMP_NONE, /* dump flags */
72 BE_TIME_OFF, /* no timing */
73 0, /* no opt profile */
74 1, /* try to omit frame pointer */
75 0, /* always stabs debugging output */
76 BE_VRFY_WARN, /* verification level: warn */
77 BE_SCHED_LIST, /* scheduler: list scheduler */
78 "i44pc52.info.uni-karlsruhe.de", /* ilp server */
79 "cplex" /* ilp solver */
83 static char config_file[256] = { 0 };
85 /* back end instruction set architecture to use */
86 static const arch_isa_if_t *isa_if = NULL;
90 /* possible dumping options */
91 static const lc_opt_enum_mask_items_t dump_items[] = {
92 { "none", DUMP_NONE },
93 { "initial", DUMP_INITIAL },
95 { "sched", DUMP_SCHED },
96 { "prepared", DUMP_PREPARED },
97 { "regalloc", DUMP_RA },
98 { "final", DUMP_FINAL },
100 { "all", 2 * DUMP_BE - 1 },
104 /* verify options. */
105 static const lc_opt_enum_int_items_t vrfy_items[] = {
106 { "off", BE_VRFY_OFF },
107 { "warn", BE_VRFY_WARN },
108 { "assert", BE_VRFY_ASSERT },
112 /* scheduling options. */
113 static const lc_opt_enum_int_items_t sched_items[] = {
114 { "list", BE_SCHED_LIST },
116 { "ilp", BE_SCHED_ILP },
117 #endif /* WITH_ILP */
121 static lc_opt_enum_mask_var_t dump_var = {
122 &be_options.dump_flags, dump_items
125 static lc_opt_enum_int_var_t vrfy_var = {
126 &be_options.vrfy_option, vrfy_items
129 static lc_opt_enum_int_var_t sched_var = {
130 &be_options.scheduler, sched_items
133 static const lc_opt_table_entry_t be_main_options[] = {
134 LC_OPT_ENT_STR ("config", "read another config file containing backend options", config_file, sizeof(config_file)),
135 LC_OPT_ENT_ENUM_MASK("dump", "dump irg on several occasions", &dump_var),
136 LC_OPT_ENT_NEGBOOL ("noomitfp", "do not omit frame pointer", &be_options.omit_fp),
137 LC_OPT_ENT_BOOL ("stabs", "enable stabs debug support", &be_options.stabs_debug_support),
138 LC_OPT_ENT_ENUM_PTR ("vrfy", "verify the backend irg", &vrfy_var),
139 LC_OPT_ENT_BOOL ("time", "get backend timing statistics", &be_options.timing),
140 LC_OPT_ENT_BOOL ("profile", "instrument the code for execution count profiling", &be_options.opt_profile),
141 LC_OPT_ENT_ENUM_PTR ("sched", "select a scheduler", &sched_var),
142 LC_OPT_ENT_STR ("statfile", "append statistics to file statfile", &be_options.stat_file_name, sizeof(be_options.stat_file_name)),
145 LC_OPT_ENT_STR ("ilp.server", "the ilp server name", be_options.ilp_server, sizeof(be_options.ilp_server)),
146 LC_OPT_ENT_STR ("ilp.solver", "the ilp solver name", be_options.ilp_solver, sizeof(be_options.ilp_solver)),
147 #endif /* WITH_ILP */
151 #endif /* WITH_LIBCORE */
153 static be_module_list_entry_t *isa_ifs = NULL;
155 void be_register_isa_if(const char *name, const arch_isa_if_t *isa)
160 be_add_module_to_list(&isa_ifs, name, (void*) isa);
163 void be_opt_register(void)
166 lc_opt_entry_t *be_grp;
167 static int run_once = 0;
176 be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
177 lc_opt_add_table(be_grp, be_main_options);
179 be_add_module_list_opt(be_grp, "isa", "the instruction set architecture",
180 &isa_ifs, (void**) &isa_if);
181 #endif /* WITH_LIBCORE */
184 /* Parse one argument. */
185 int be_parse_arg(const char *arg) {
187 lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
188 if (strcmp(arg, "help") == 0 || (arg[0] == '?' && arg[1] == '\0')) {
189 lc_opt_print_help(be_grp, stdout);
192 return lc_opt_from_single_arg(be_grp, NULL, arg, NULL);
195 #endif /* WITH_LIBCORE */
198 /** The be parameters returned by default, all off. */
199 const static backend_params be_params = {
206 /* Perform schedule verification if requested. */
207 static void be_sched_vrfy(ir_graph *irg, int vrfy_opt) {
208 if (vrfy_opt == BE_VRFY_WARN) {
209 be_verify_schedule(irg);
211 else if (vrfy_opt == BE_VRFY_ASSERT) {
212 assert(be_verify_schedule(irg) && "Schedule verification failed.");
216 /* Initialize the Firm backend. Must be run BEFORE init_firm()! */
217 const backend_params *be_init(void)
222 if (isa_if->get_params)
223 return isa_if->get_params();
228 * Initializes the main environment for the backend.
230 * @param env an empty environment
231 * @param file_handle the file handle where the output will be written to
233 static be_main_env_t *be_init_env(be_main_env_t *env, FILE *file_handle)
235 memset(env, 0, sizeof(*env));
236 obstack_init(&env->obst);
237 env->arch_env = obstack_alloc(&env->obst, sizeof(env->arch_env[0]));
238 env->options = &be_options;
239 FIRM_DBG_REGISTER(env->dbg, "be.main");
241 arch_env_init(env->arch_env, isa_if, file_handle, env);
243 /* Register the irn handler of the architecture */
244 if (arch_isa_get_irn_handler(env->arch_env->isa))
245 arch_env_push_irn_handler(env->arch_env, arch_isa_get_irn_handler(env->arch_env->isa));
248 * Register the node handler of the back end infrastructure.
249 * This irn handler takes care of the platform independent
250 * spill, reload and perm nodes.
252 arch_env_push_irn_handler(env->arch_env, &be_node_irn_handler);
253 env->phi_handler = be_phi_handler_new(env->arch_env);
254 arch_env_push_irn_handler(env->arch_env, env->phi_handler);
256 env->db_handle = be_options.stabs_debug_support ? be_stabs_open(file_handle) : be_nulldbg_open();
260 static void be_done_env(be_main_env_t *env)
262 env->arch_env->isa->impl->done(env->arch_env->isa);
263 be_dbg_close(env->db_handle);
264 be_phi_handler_free(env->phi_handler);
265 obstack_free(&env->obst, NULL);
269 * A wrapper around a firm dumper. Dumps only, if
272 * @param mask a bitmask containing the reason what will be dumped
273 * @param irg the IR graph to dump
274 * @param suffix the suffix for the dumper
275 * @param dumper the dumper to be called
277 static void dump(int mask, ir_graph *irg, const char *suffix,
278 void (*dumper)(ir_graph *, const char *))
280 if(be_options.dump_flags & mask)
281 be_dump(irg, suffix, dumper);
285 * Prepare a backend graph for code generation and initialize its birg
287 static void initialize_birg(be_irg_t *birg, ir_graph *irg, be_main_env_t *env)
289 memset(birg, 0, sizeof(*birg));
291 birg->main_env = env;
293 edges_deactivate_kind(irg, EDGE_KIND_DEP);
294 edges_activate_kind(irg, EDGE_KIND_DEP);
296 DBG((env->dbg, LEVEL_2, "====> IRG: %F\n", irg));
297 dump(DUMP_INITIAL, irg, "-begin", dump_ir_block_graph);
299 be_stat_init_irg(env->arch_env, irg);
300 be_do_stat_nodes(irg, "01 Begin");
302 /* set the current graph (this is important for several firm functions) */
303 current_ir_graph = irg;
305 /* Normalize proj nodes. */
306 normalize_proj_nodes(irg);
308 /* Make just one return node. */
309 normalize_one_return(irg);
311 /* Remove critical edges */
312 remove_critical_cf_edges(irg);
314 /* Ensure, that the ir_edges are computed. */
317 /* reset the phi handler. */
318 be_phi_handler_reset(env->phi_handler);
320 set_irg_phase_state(irg, phase_backend);
325 #define BE_TIMER_PUSH(timer) \
326 if (be_options.timing == BE_TIME_ON) { \
327 int res = lc_timer_push(timer); \
328 if (be_options.vrfy_option == BE_VRFY_ASSERT) \
329 assert(res && "Timer already on stack, cannot be pushed twice."); \
330 else if (be_options.vrfy_option == BE_VRFY_WARN && ! res) \
331 fprintf(stderr, "Timer %s already on stack, cannot be pushed twice.\n", \
332 lc_timer_get_name(timer)); \
334 #define BE_TIMER_POP(timer) \
335 if (be_options.timing == BE_TIME_ON) { \
336 lc_timer_t *tmp = lc_timer_pop(); \
337 if (be_options.vrfy_option == BE_VRFY_ASSERT) \
338 assert(tmp == timer && "Attempt to pop wrong timer."); \
339 else if (be_options.vrfy_option == BE_VRFY_WARN && tmp != timer) \
340 fprintf(stderr, "Attempt to pop wrong timer. %s is on stack, trying to pop %s.\n", \
341 lc_timer_get_name(tmp), lc_timer_get_name(timer)); \
345 #define BE_TIMER_ONLY(code) do { if (be_options.timing == BE_TIME_ON) { code; } } while(0)
349 #define BE_TIMER_PUSH(timer)
350 #define BE_TIMER_POP(timer)
351 #define BE_TIMER_ONLY(code)
353 #endif /* WITH_LIBCORE */
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 be_ra_timer_t *ra_timer;
381 lc_timer_t *t_abi = NULL;
382 lc_timer_t *t_codegen = NULL;
383 lc_timer_t *t_sched = NULL;
384 lc_timer_t *t_constr = NULL;
385 lc_timer_t *t_regalloc = NULL;
386 lc_timer_t *t_finish = NULL;
387 lc_timer_t *t_emit = NULL;
388 lc_timer_t *t_other = NULL;
389 lc_timer_t *t_verify = NULL;
391 if (be_options.timing == BE_TIME_ON) {
392 t_abi = lc_timer_register("beabi", "be abi introduction");
393 t_codegen = lc_timer_register("codegen", "codegeneration");
394 t_sched = lc_timer_register("sched", "scheduling");
395 t_constr = lc_timer_register("constr", "assure constraints");
396 t_regalloc = lc_timer_register("regalloc", "register allocation");
397 t_finish = lc_timer_register("finish", "graph finish");
398 t_emit = lc_timer_register("emiter", "code emiter");
399 t_verify = lc_timer_register("verify", "graph verification");
400 t_other = lc_timer_register("other", "other");
402 #endif /* WITH_LIBCORE */
404 be_init_env(&env, file_handle);
406 isa = arch_env_get_isa(env.arch_env);
408 be_dbg_so(env.db_handle, cup_name);
409 be_dbg_types(env.db_handle);
411 /* backend may provide an ordered list of irgs where code should be generated for */
412 irg_list = NEW_ARR_F(ir_graph *, 0);
413 backend_irg_list = arch_isa_get_backend_irg_list(isa, irg_list);
415 /* we might need 1 birg more for instrumentation constructor */
416 num_birgs = backend_irg_list ? ARR_LEN(backend_irg_list) : get_irp_n_irgs();
417 birgs = alloca(sizeof(birgs[0]) * (num_birgs + 1));
419 /* First: initialize all birgs */
420 for(i = 0; i < num_birgs; ++i) {
421 ir_graph *irg = backend_irg_list ? backend_irg_list[i] : get_irp_irg(i);
423 initialize_birg(&birgs[i], irg, &env);
428 Get the filename for the profiling data.
429 Beware: '\0' is already included in sizeof(suffix)
431 memset(prof_filename, 0, sizeof(prof_filename));
432 strncpy(prof_filename, cup_name, sizeof(prof_filename) - sizeof(suffix));
433 strcat(prof_filename, suffix);
436 Next: Either instruments all irgs with profiling code
437 or try to read in profile data for current translation unit.
439 if (be_options.opt_profile) {
440 ir_graph *prof_init_irg = be_profile_instrument(prof_filename, profile_default);
441 initialize_birg(&birgs[num_birgs], prof_init_irg, &env);
443 set_method_img_section(get_irg_entity(prof_init_irg), section_constructors);
446 be_profile_read(prof_filename);
450 for (i = 0; i < num_birgs; ++i) {
451 be_irg_t *birg = &birgs[i];
452 ir_graph *irg = birg->irg;
453 optimization_state_t state;
454 const arch_code_generator_if_t *cg_if;
457 /* set the current graph (this is important for several firm functions) */
458 current_ir_graph = irg;
460 #ifdef FIRM_STATISTICS
461 if(be_stat_ev_is_active()) {
462 ir_snprintf(irg_name, sizeof(irg_name), "%F", irg);
463 be_stat_tags[STAT_TAG_CLS] = "<all>";
464 be_stat_tags[STAT_TAG_IRG] = irg_name;
465 be_stat_ev_push(be_stat_tags, STAT_TAG_LAST, be_stat_file);
469 /* stop and reset timers */
471 LC_STOP_AND_RESET_TIMER(t_abi);
472 LC_STOP_AND_RESET_TIMER(t_codegen);
473 LC_STOP_AND_RESET_TIMER(t_sched);
474 LC_STOP_AND_RESET_TIMER(t_constr);
475 LC_STOP_AND_RESET_TIMER(t_regalloc);
476 LC_STOP_AND_RESET_TIMER(t_finish);
477 LC_STOP_AND_RESET_TIMER(t_emit);
478 LC_STOP_AND_RESET_TIMER(t_verify);
479 LC_STOP_AND_RESET_TIMER(t_other);
481 BE_TIMER_PUSH(t_other); /* t_other */
483 /* Verify the initial graph */
484 BE_TIMER_PUSH(t_verify);
485 if (be_options.vrfy_option == BE_VRFY_WARN) {
486 irg_verify(irg, VRFY_ENFORCE_SSA);
487 be_check_dominance(irg);
488 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
489 assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
490 assert(be_check_dominance(irg) && "Dominance verification failed");
492 BE_TIMER_POP(t_verify);
494 BE_TIMER_ONLY(num_nodes_b = get_num_reachable_nodes(irg));
496 /* Get the code generator interface. */
497 cg_if = isa->impl->get_code_generator_if(isa);
499 /* get a code generator for this graph. */
500 birg->cg = cg_if->init(birg);
502 /* some transformations need to be done before abi introduce */
503 arch_code_generator_before_abi(birg->cg);
505 /* reset the phi handler. */
506 be_phi_handler_reset(env.phi_handler);
508 /* implement the ABI conventions. */
509 BE_TIMER_PUSH(t_abi);
510 birg->abi = be_abi_introduce(birg);
513 dump(DUMP_ABI, irg, "-abi", dump_ir_block_graph);
514 be_do_stat_nodes(irg, "02 Abi");
516 if (be_options.vrfy_option == BE_VRFY_WARN) {
517 be_check_dominance(irg);
518 be_verify_out_edges(irg);
520 else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
521 assert(be_verify_out_edges(irg));
522 assert(be_check_dominance(irg) && "Dominance verification failed");
526 BE_TIMER_PUSH(t_codegen);
527 arch_code_generator_prepare_graph(birg->cg);
528 BE_TIMER_POP(t_codegen);
530 be_do_stat_nodes(irg, "03 Prepare");
532 /* Compute loop nesting information (for weighting copies) */
533 dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph);
534 BE_TIMER_ONLY(num_nodes_r = get_num_reachable_nodes(irg));
536 if (be_options.vrfy_option == BE_VRFY_WARN) {
537 be_check_dominance(irg);
538 be_verify_out_edges(irg);
540 else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
541 assert(be_verify_out_edges(irg));
542 assert(be_check_dominance(irg) && "Dominance verification failed");
546 * Create execution frequencies from profile data or estimate some
548 if (be_profile_has_data()) {
549 birg->exec_freq = be_create_execfreqs_from_profile(irg);
551 birg->exec_freq = compute_execfreq(irg, 10);
554 /* let backend prepare scheduling */
555 BE_TIMER_PUSH(t_codegen);
556 arch_code_generator_before_sched(birg->cg);
557 BE_TIMER_POP(t_codegen);
559 /* schedule the irg */
560 BE_TIMER_PUSH(t_sched);
561 switch (be_options.scheduler) {
563 fprintf(stderr, "Warning: invalid scheduler (%d) selected, falling back to list scheduler.\n", be_options.scheduler);
565 list_sched(birg, &be_options);
570 //fprintf(stderr, "Warning: ILP scheduler not yet fully implemented, falling back to list scheduler.\n");
571 //list_sched(birg, &be_options);
573 #endif /* WITH_ILP */
575 BE_TIMER_POP(t_sched);
577 dump(DUMP_SCHED, irg, "-sched", dump_ir_block_graph_sched);
580 BE_TIMER_PUSH(t_verify);
581 be_sched_vrfy(irg, be_options.vrfy_option);
582 BE_TIMER_POP(t_verify);
584 be_do_stat_nodes(irg, "04 Schedule");
586 /* introduce patterns to assure constraints */
587 BE_TIMER_PUSH(t_constr);
588 /* we switch off optimizations here, because they might cause trouble */
589 save_optimization_state(&state);
591 set_opt_normalize(0);
593 /* add Keeps for should_be_different constrained nodes */
594 /* beware: needs schedule due to usage of be_ssa_constr */
595 assure_constraints(birg);
596 BE_TIMER_POP(t_constr);
598 dump(DUMP_SCHED, irg, "-assured", dump_ir_block_graph_sched);
599 be_do_stat_nodes(irg, "05 Constraints");
601 /* connect all stack modifying nodes together (see beabi.c) */
602 BE_TIMER_PUSH(t_abi);
603 be_abi_fix_stack_nodes(birg->abi, NULL);
606 dump(DUMP_SCHED, irg, "-fix_stack", dump_ir_block_graph_sched);
609 BE_TIMER_PUSH(t_verify);
610 be_sched_vrfy(irg, be_options.vrfy_option);
611 BE_TIMER_POP(t_verify);
613 /* do some statistics */
614 be_do_stat_reg_pressure(birg);
616 /* stuff needs to be done after scheduling but before register allocation */
617 BE_TIMER_PUSH(t_codegen);
618 arch_code_generator_before_ra(birg->cg);
619 BE_TIMER_POP(t_codegen);
621 #ifdef FIRM_STATISTICS
622 if(be_stat_ev_is_active()) {
623 be_stat_ev_l("costs_before_ra",
624 (long) be_estimate_irg_costs(irg, env.arch_env, birg->exec_freq));
628 /* Do register allocation */
629 BE_TIMER_PUSH(t_regalloc);
630 be_allocate_registers(birg);
631 BE_TIMER_POP(t_regalloc);
633 #ifdef FIRM_STATISTICS
634 if(be_stat_ev_is_active()) {
635 be_stat_ev_l("costs_after_ra",
636 (long) be_estimate_irg_costs(irg, env.arch_env, birg->exec_freq));
640 dump(DUMP_RA, irg, "-ra", dump_ir_block_graph_sched);
641 be_do_stat_nodes(irg, "06 Register Allocation");
643 /* let the code generator prepare the graph for emitter */
644 BE_TIMER_PUSH(t_finish);
645 arch_code_generator_after_ra(birg->cg);
646 BE_TIMER_POP(t_finish);
648 /* fix stack offsets */
649 BE_TIMER_PUSH(t_abi);
650 be_abi_fix_stack_nodes(birg->abi, NULL);
651 be_remove_dead_nodes_from_schedule(irg);
652 be_abi_fix_stack_bias(birg->abi);
655 dump(DUMP_SCHED, irg, "-fix_stack_after_ra", dump_ir_block_graph_sched);
657 BE_TIMER_PUSH(t_finish);
658 arch_code_generator_finish(birg->cg);
659 BE_TIMER_POP(t_finish);
661 dump(DUMP_FINAL, irg, "-finish", dump_ir_block_graph_sched);
663 /* check schedule and register allocation */
664 BE_TIMER_PUSH(t_verify);
665 if (be_options.vrfy_option == BE_VRFY_WARN) {
666 //irg_verify(irg, VRFY_ENFORCE_SSA);
667 be_check_dominance(irg);
668 be_verify_out_edges(irg);
669 be_verify_schedule(irg);
670 be_verify_register_allocation(env.arch_env, irg);
672 else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
673 //assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
674 assert(be_verify_out_edges(irg));
675 assert(be_check_dominance(irg) && "Dominance verification failed");
676 assert(be_verify_schedule(irg) && "Schedule verification failed");
677 assert(be_verify_register_allocation(env.arch_env, irg)
678 && "register allocation verification failed");
680 BE_TIMER_POP(t_verify);
682 /* emit assembler code */
683 BE_TIMER_PUSH(t_emit);
684 arch_code_generator_done(birg->cg);
685 BE_TIMER_POP(t_emit);
687 dump(DUMP_FINAL, irg, "-end", dump_ir_block_graph_sched);
689 BE_TIMER_PUSH(t_abi);
690 be_abi_free(birg->abi);
693 be_do_stat_nodes(irg, "07 Final");
694 restore_optimization_state(&state);
696 BE_TIMER_ONLY(num_nodes_a = get_num_reachable_nodes(irg));
697 BE_TIMER_POP(t_other);
699 #define LC_EMIT(timer) \
700 if(!be_stat_ev_is_active()) { \
701 printf("%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0); \
703 be_stat_ev_l(lc_timer_get_name(timer), lc_timer_elapsed_msec(timer)); \
705 #define LC_EMIT_RA(timer) \
706 if(!be_stat_ev_is_active()) { \
707 printf("\t%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0); \
709 be_stat_ev_l(lc_timer_get_name(timer), lc_timer_elapsed_msec(timer)); \
712 if(!be_stat_ev_is_active()) {
713 printf("==>> IRG %s <<==\n", get_entity_name(get_irg_entity(irg)));
714 printf("# nodes at begin: %u\n", num_nodes_b);
715 printf("# nodes before ra: %u\n", num_nodes_r);
716 printf("# nodes at end: %u\n\n", num_nodes_a);
723 LC_EMIT_RA(ra_timer->t_prolog);
724 LC_EMIT_RA(ra_timer->t_live);
725 LC_EMIT_RA(ra_timer->t_spill);
726 LC_EMIT_RA(ra_timer->t_spillslots);
727 LC_EMIT_RA(ra_timer->t_color);
728 LC_EMIT_RA(ra_timer->t_ifg);
729 LC_EMIT_RA(ra_timer->t_copymin);
730 LC_EMIT_RA(ra_timer->t_ssa);
731 LC_EMIT_RA(ra_timer->t_epilog);
732 LC_EMIT_RA(ra_timer->t_verify);
733 LC_EMIT_RA(ra_timer->t_other);
744 /* switched off due to statistics (statistic module needs all irgs) */
745 #ifdef FIRM_STATISTICS
746 if (! stat_is_active())
750 if(be_stat_ev_is_active()) {
762 /* Main interface to the frontend. */
763 void be_main(FILE *file_handle, const char *cup_name)
766 lc_timer_t *t = NULL;
768 /* The user specified another config file to read. do that now. */
769 if(strlen(config_file) > 0) {
772 if((f = fopen(config_file, "rt")) != NULL) {
773 lc_opt_from_file(config_file, f, NULL);
778 if (be_options.timing == BE_TIME_ON) {
779 t = lc_timer_register("bemain", "measure complete bemain loop");
781 if (lc_timer_enter_high_priority()) {
782 fprintf(stderr, "Warning: Could not enter high priority mode.\n");
785 lc_timer_reset_and_start(t);
788 #ifdef FIRM_STATISTICS
789 be_init_stat_file(be_options.stat_file_name, cup_name);
791 #endif /* WITH_LIBCORE */
793 /* never build code for pseudo irgs */
794 set_visit_pseudo_irgs(0);
798 be_main_loop(file_handle, cup_name);
801 if (be_options.timing == BE_TIME_ON) {
803 lc_timer_leave_high_priority();
804 if(be_stat_ev_is_active()) {
805 be_stat_ev_l("backend_time", lc_timer_elapsed_msec(t));
807 printf("%-20s: %lu msec\n", "BEMAINLOOP", lc_timer_elapsed_msec(t));
811 #ifdef FIRM_STATISTICS
812 be_close_stat_file();
814 #endif /* WITH_LIBCORE */
817 /** The debug info retriever function. */
818 static retrieve_dbg_func retrieve_dbg = NULL;
820 /* Sets a debug info retriever. */
821 void be_set_debug_retrieve(retrieve_dbg_func func) {
825 /* Retrieve the debug info. */
826 const char *be_retrieve_dbg_info(const dbg_info *dbg, unsigned *line) {
828 return retrieve_dbg(dbg, line);
834 int be_put_ignore_regs(const be_irg_t *birg, const arch_register_class_t *cls, bitset_t *bs)
837 bs = bitset_alloca(cls->n_regs);
839 bitset_clear_all(bs);
841 assert(bitset_size(bs) == (unsigned) cls->n_regs);
842 arch_put_non_ignore_regs(birg->main_env->arch_env, cls, bs);
844 be_abi_put_ignore_regs(birg->abi, cls, bs);
846 return bitset_popcnt(bs);