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
43 #include "iredges_t.h"
57 #include "besched_t.h"
58 #include "belistsched.h"
60 #include "bespillbelady.h"
62 #include "bechordal_t.h"
64 #include "beifg_impl.h"
65 #include "becopyopt.h"
66 #include "becopystat.h"
67 #include "bessadestr.h"
70 #include "beschedmris.h"
73 #include "beprofile.h"
74 #include "be_dbgout.h"
78 #include "beilpsched.h"
81 /* options visible for anyone */
82 static be_options_t be_options = {
83 DUMP_NONE, /* dump flags */
84 BE_TIME_OFF, /* no timing */
85 0, /* no opt profile */
86 0, /* try to omit frame pointer */
87 0, /* no stabs debugging output */
88 BE_VRFY_WARN, /* verification level: warn */
89 BE_SCHED_LIST, /* scheduler: list scheduler */
90 "i44pc52.info.uni-karlsruhe.de", /* ilp server */
91 "cplex", /* ilp solver */
92 0, /* enable statistic event dumping */
96 static char config_file[256] = { 0 };
98 /* back end instruction set architecture to use */
99 static const arch_isa_if_t *isa_if = NULL;
102 #include <libcore/lc_opts.h>
103 #include <libcore/lc_opts_enum.h>
104 #include <libcore/lc_timing.h>
106 /* possible dumping options */
107 static const lc_opt_enum_mask_items_t dump_items[] = {
108 { "none", DUMP_NONE },
109 { "initial", DUMP_INITIAL },
111 { "sched", DUMP_SCHED },
112 { "prepared", DUMP_PREPARED },
113 { "regalloc", DUMP_RA },
114 { "final", DUMP_FINAL },
116 { "all", 2 * DUMP_BE - 1 },
120 /* verify options. */
121 static const lc_opt_enum_int_items_t vrfy_items[] = {
122 { "off", BE_VRFY_OFF },
123 { "warn", BE_VRFY_WARN },
124 { "assert", BE_VRFY_ASSERT },
128 /* scheduling options. */
129 static const lc_opt_enum_int_items_t sched_items[] = {
130 { "list", BE_SCHED_LIST },
132 { "ilp", BE_SCHED_ILP },
133 #endif /* WITH_ILP */
137 static lc_opt_enum_mask_var_t dump_var = {
138 &be_options.dump_flags, dump_items
141 static lc_opt_enum_int_var_t vrfy_var = {
142 &be_options.vrfy_option, vrfy_items
145 static lc_opt_enum_int_var_t sched_var = {
146 &be_options.scheduler, sched_items
149 static const lc_opt_table_entry_t be_main_options[] = {
150 LC_OPT_ENT_STR ("config", "read another config file containing backend options", config_file, sizeof(config_file)),
151 LC_OPT_ENT_ENUM_MASK("dump", "dump irg on several occasions", &dump_var),
152 LC_OPT_ENT_BOOL ("omitfp", "omit frame pointer", &be_options.omit_fp),
153 LC_OPT_ENT_BOOL ("stabs", "enable stabs debug support", &be_options.stabs_debug_support),
154 LC_OPT_ENT_ENUM_PTR ("vrfy", "verify the backend irg", &vrfy_var),
155 LC_OPT_ENT_BOOL ("time", "get backend timing statistics", &be_options.timing),
156 LC_OPT_ENT_BOOL ("profile", "instrument the code for execution count profiling", &be_options.opt_profile),
157 LC_OPT_ENT_ENUM_PTR ("sched", "select a scheduler", &sched_var),
158 LC_OPT_ENT_BOOL ("statev", "dump statistic events", &be_options.statev),
161 LC_OPT_ENT_STR ("ilp.server", "the ilp server name", be_options.ilp_server, sizeof(be_options.ilp_server)),
162 LC_OPT_ENT_STR ("ilp.solver", "the ilp solver name", be_options.ilp_solver, sizeof(be_options.ilp_solver)),
163 #endif /* WITH_ILP */
166 #endif /* WITH_LIBCORE */
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;
191 be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
192 lc_opt_add_table(be_grp, be_main_options);
194 be_add_module_list_opt(be_grp, "isa", "the instruction set architecture",
195 &isa_ifs, (void**) &isa_if);
199 /* Parse one argument. */
200 int be_parse_arg(const char *arg) {
202 lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
203 if (strcmp(arg, "help") == 0 || (arg[0] == '?' && arg[1] == '\0')) {
204 lc_opt_print_help(be_grp, stdout);
207 return lc_opt_from_single_arg(be_grp, NULL, arg, NULL);
213 /** The be parameters returned by default, all off. */
214 static const backend_params be_params = {
215 0, /* need dword lowering */
216 0, /* don't support inlien assembler yet */
217 NULL, /* no additional opcodes */
218 NULL, /* will be set later */
219 NULL, /* but yet no creator function */
220 NULL, /* context for create_intrinsic_fkt */
221 NULL, /* no if conversion settings */
224 /* Perform schedule verification if requested. */
225 static void be_sched_vrfy(be_irg_t *birg, int vrfy_opt) {
226 if (vrfy_opt == BE_VRFY_WARN) {
227 be_verify_schedule(birg);
229 else if (vrfy_opt == BE_VRFY_ASSERT) {
230 assert(be_verify_schedule(birg) && "Schedule verification failed.");
234 /* Initialize the Firm backend. Must be run BEFORE init_firm()! */
235 const backend_params *be_init(void)
240 if (isa_if->get_params)
241 return isa_if->get_params();
246 * Initializes the main environment for the backend.
248 * @param env an empty environment
249 * @param file_handle the file handle where the output will be written to
251 static be_main_env_t *be_init_env(be_main_env_t *env, FILE *file_handle)
253 memset(env, 0, sizeof(*env));
254 obstack_init(&env->obst);
255 env->arch_env = obstack_alloc(&env->obst, sizeof(env->arch_env[0]));
256 env->options = &be_options;
258 arch_env_init(env->arch_env, isa_if, file_handle, env);
260 /* Register the irn handler of the architecture */
261 if (arch_isa_get_irn_handler(env->arch_env->isa))
262 arch_env_push_irn_handler(env->arch_env, arch_isa_get_irn_handler(env->arch_env->isa));
265 * Register the node handler of the back end infrastructure.
266 * This irn handler takes care of the platform independent
267 * spill, reload and perm nodes.
269 arch_env_push_irn_handler(env->arch_env, &be_node_irn_handler);
270 env->phi_handler = be_phi_handler_new(env->arch_env);
271 arch_env_push_irn_handler(env->arch_env, env->phi_handler);
273 env->db_handle = be_options.stabs_debug_support ? be_stabs_open(file_handle) : be_nulldbg_open();
277 static void be_done_env(be_main_env_t *env)
279 env->arch_env->isa->impl->done(env->arch_env->isa);
280 be_dbg_close(env->db_handle);
281 be_phi_handler_free(env->phi_handler);
282 obstack_free(&env->obst, NULL);
286 * A wrapper around a firm dumper. Dumps only, if
289 * @param mask a bitmask containing the reason what will be dumped
290 * @param irg the IR graph to dump
291 * @param suffix the suffix for the dumper
292 * @param dumper the dumper to be called
294 static void dump(int mask, ir_graph *irg, const char *suffix,
295 void (*dumper)(ir_graph *, const char *))
297 if(be_options.dump_flags & mask)
298 be_dump(irg, suffix, dumper);
302 * Prepare a backend graph for code generation and initialize its birg
304 static void initialize_birg(be_irg_t *birg, ir_graph *irg, be_main_env_t *env)
306 memset(birg, 0, sizeof(*birg));
308 birg->main_env = env;
310 edges_deactivate_kind(irg, EDGE_KIND_DEP);
311 edges_activate_kind(irg, EDGE_KIND_DEP);
313 dump(DUMP_INITIAL, irg, "-begin", dump_ir_block_graph);
315 be_stat_init_irg(env->arch_env, irg);
316 be_do_stat_nodes(irg, "01 Begin");
318 /* set the current graph (this is important for several firm functions) */
319 current_ir_graph = irg;
321 /* Normalize proj nodes. */
322 normalize_proj_nodes(irg);
324 /* we do this before critical edge split. As this produces less returns,
325 because sometimes (= 164.gzip) multiple returns are slower */
326 normalize_n_returns(irg);
328 /* Remove critical edges */
329 remove_critical_cf_edges(irg);
331 /* Ensure, that the ir_edges are computed. */
334 /* reset the phi handler. */
335 be_phi_handler_reset(env->phi_handler);
337 set_irg_phase_state(irg, phase_backend);
339 dump(DUMP_INITIAL, irg, "-prepared", dump_ir_block_graph);
342 #define BE_TIMER_PUSH(timer) \
343 if (be_options.timing == BE_TIME_ON) { \
344 int res = lc_timer_push(timer); \
345 if (be_options.vrfy_option == BE_VRFY_ASSERT) \
346 assert(res && "Timer already on stack, cannot be pushed twice."); \
347 else if (be_options.vrfy_option == BE_VRFY_WARN && ! res) \
348 fprintf(stderr, "Timer %s already on stack, cannot be pushed twice.\n", \
349 lc_timer_get_name(timer)); \
351 #define BE_TIMER_POP(timer) \
352 if (be_options.timing == BE_TIME_ON) { \
353 lc_timer_t *tmp = lc_timer_pop(); \
354 if (be_options.vrfy_option == BE_VRFY_ASSERT) \
355 assert(tmp == timer && "Attempt to pop wrong timer."); \
356 else if (be_options.vrfy_option == BE_VRFY_WARN && tmp != timer) \
357 fprintf(stderr, "Attempt to pop wrong timer. %s is on stack, trying to pop %s.\n", \
358 lc_timer_get_name(tmp), lc_timer_get_name(timer)); \
362 #define BE_TIMER_ONLY(code) do { if (be_options.timing == BE_TIME_ON) { code; } } while(0)
365 * The Firm backend main loop.
366 * Do architecture specific lowering for all graphs
367 * and call the architecture specific code generator.
369 * @param file_handle the file handle the output will be written to
370 * @param cup_name name of the compilation unit
372 static void be_main_loop(FILE *file_handle, const char *cup_name)
377 unsigned num_nodes_b = 0;
378 unsigned num_nodes_a = 0;
379 unsigned num_nodes_r = 0;
380 char prof_filename[256];
381 static const char suffix[] = ".prof";
384 ir_graph **irg_list, **backend_irg_list;
386 lc_timer_t *t_abi = NULL;
387 lc_timer_t *t_codegen = NULL;
388 lc_timer_t *t_sched = NULL;
389 lc_timer_t *t_constr = NULL;
390 lc_timer_t *t_regalloc = NULL;
391 lc_timer_t *t_finish = NULL;
392 lc_timer_t *t_emit = NULL;
393 lc_timer_t *t_other = NULL;
394 lc_timer_t *t_verify = NULL;
396 if (be_options.timing == BE_TIME_ON) {
397 t_abi = lc_timer_register("beabi", "be abi introduction");
398 t_codegen = lc_timer_register("codegen", "codegeneration");
399 t_sched = lc_timer_register("sched", "scheduling");
400 t_constr = lc_timer_register("constr", "assure constraints");
401 t_regalloc = lc_timer_register("regalloc", "register allocation");
402 t_finish = lc_timer_register("finish", "graph finish");
403 t_emit = lc_timer_register("emiter", "code emiter");
404 t_verify = lc_timer_register("verify", "graph verification");
405 t_other = lc_timer_register("other", "other");
408 be_init_env(&env, file_handle);
410 isa = arch_env_get_isa(env.arch_env);
412 be_dbg_so(env.db_handle, cup_name);
413 be_dbg_types(env.db_handle);
415 /* backend may provide an ordered list of irgs where code should be generated for */
416 irg_list = NEW_ARR_F(ir_graph *, 0);
417 backend_irg_list = arch_isa_get_backend_irg_list(isa, &irg_list);
419 /* we might need 1 birg more for instrumentation constructor */
420 num_birgs = backend_irg_list ? ARR_LEN(backend_irg_list) : get_irp_n_irgs();
421 birgs = alloca(sizeof(birgs[0]) * (num_birgs + 1));
423 /* First: initialize all birgs */
424 for(i = 0; i < num_birgs; ++i) {
425 ir_graph *irg = backend_irg_list ? backend_irg_list[i] : get_irp_irg(i);
426 initialize_birg(&birgs[i], irg, &env);
431 Get the filename for the profiling data.
432 Beware: '\0' is already included in sizeof(suffix)
434 memset(prof_filename, 0, sizeof(prof_filename));
435 strncpy(prof_filename, cup_name, sizeof(prof_filename) - sizeof(suffix));
436 strcat(prof_filename, suffix);
439 Next: Either instruments all irgs with profiling code
440 or try to read in profile data for current translation unit.
442 if (be_options.opt_profile) {
443 ir_graph *prof_init_irg = be_profile_instrument(prof_filename, profile_default);
444 initialize_birg(&birgs[num_birgs], prof_init_irg, &env);
446 set_method_img_section(get_irg_entity(prof_init_irg), section_constructors);
448 be_profile_read(prof_filename);
452 for (i = 0; i < num_birgs; ++i) {
453 be_irg_t *birg = &birgs[i];
454 ir_graph *irg = birg->irg;
455 optimization_state_t state;
456 const arch_code_generator_if_t *cg_if;
458 /* set the current graph (this is important for several firm functions) */
459 current_ir_graph = irg;
461 #ifdef FIRM_STATISTICS
462 stat_ev_ctx_push_fobj("irg", irg);
465 /* stop and reset timers */
467 LC_STOP_AND_RESET_TIMER(t_abi);
468 LC_STOP_AND_RESET_TIMER(t_codegen);
469 LC_STOP_AND_RESET_TIMER(t_sched);
470 LC_STOP_AND_RESET_TIMER(t_constr);
471 LC_STOP_AND_RESET_TIMER(t_regalloc);
472 LC_STOP_AND_RESET_TIMER(t_finish);
473 LC_STOP_AND_RESET_TIMER(t_emit);
474 LC_STOP_AND_RESET_TIMER(t_verify);
475 LC_STOP_AND_RESET_TIMER(t_other);
477 BE_TIMER_PUSH(t_other); /* t_other */
479 /* Verify the initial graph */
480 BE_TIMER_PUSH(t_verify);
481 if (be_options.vrfy_option == BE_VRFY_WARN) {
482 irg_verify(irg, VRFY_ENFORCE_SSA);
483 be_check_dominance(irg);
484 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
485 assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
486 assert(be_check_dominance(irg) && "Dominance verification failed");
488 BE_TIMER_POP(t_verify);
490 BE_TIMER_ONLY(num_nodes_b = get_num_reachable_nodes(irg));
492 /* Get the code generator interface. */
493 cg_if = isa->impl->get_code_generator_if(isa);
495 /* get a code generator for this graph. */
496 birg->cg = cg_if->init(birg);
498 /* some transformations need to be done before abi introduce */
499 arch_code_generator_before_abi(birg->cg);
501 /* reset the phi handler. */
502 be_phi_handler_reset(env.phi_handler);
504 /* implement the ABI conventions. */
505 BE_TIMER_PUSH(t_abi);
506 birg->abi = be_abi_introduce(birg);
509 dump(DUMP_ABI, irg, "-abi", dump_ir_block_graph);
510 be_do_stat_nodes(irg, "02 Abi");
512 if (be_options.vrfy_option == BE_VRFY_WARN) {
513 be_check_dominance(irg);
514 be_verify_out_edges(irg);
515 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
516 assert(be_verify_out_edges(irg));
517 assert(be_check_dominance(irg) && "Dominance verification failed");
521 BE_TIMER_PUSH(t_codegen);
522 arch_code_generator_prepare_graph(birg->cg);
523 BE_TIMER_POP(t_codegen);
525 be_do_stat_nodes(irg, "03 Prepare");
527 dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph);
528 BE_TIMER_ONLY(num_nodes_r = get_num_reachable_nodes(irg));
530 if (be_options.vrfy_option == BE_VRFY_WARN) {
531 be_check_dominance(irg);
532 be_verify_out_edges(irg);
533 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
534 assert(be_verify_out_edges(irg));
535 assert(be_check_dominance(irg) && "Dominance verification failed");
539 * Create execution frequencies from profile data or estimate some
541 if (be_profile_has_data())
542 birg->exec_freq = be_create_execfreqs_from_profile(irg);
544 birg->exec_freq = compute_execfreq(irg, 10);
547 /* disabled for now, fails for EmptyFor.c and XXEndless.c */
548 /* be_live_chk_compare(birg); */
550 /* let backend prepare scheduling */
551 BE_TIMER_PUSH(t_codegen);
552 arch_code_generator_before_sched(birg->cg);
553 BE_TIMER_POP(t_codegen);
555 /* schedule the irg */
556 BE_TIMER_PUSH(t_sched);
557 switch (be_options.scheduler) {
559 fprintf(stderr, "Warning: invalid scheduler (%d) selected, falling back to list scheduler.\n", be_options.scheduler);
561 list_sched(birg, &be_options);
565 be_ilp_sched(birg, &be_options);
567 #endif /* WITH_ILP */
569 BE_TIMER_POP(t_sched);
571 dump(DUMP_SCHED, irg, "-sched", dump_ir_block_graph_sched);
574 BE_TIMER_PUSH(t_verify);
575 be_sched_vrfy(birg, be_options.vrfy_option);
576 BE_TIMER_POP(t_verify);
578 be_do_stat_nodes(irg, "04 Schedule");
580 /* introduce patterns to assure constraints */
581 BE_TIMER_PUSH(t_constr);
582 /* we switch off optimizations here, because they might cause trouble */
583 save_optimization_state(&state);
585 set_opt_normalize(0);
587 /* add Keeps for should_be_different constrained nodes */
588 /* beware: needs schedule due to usage of be_ssa_constr */
589 assure_constraints(birg);
590 BE_TIMER_POP(t_constr);
592 dump(DUMP_SCHED, irg, "-assured", dump_ir_block_graph_sched);
593 be_do_stat_nodes(irg, "05 Constraints");
595 /* stuff needs to be done after scheduling but before register allocation */
596 BE_TIMER_PUSH(t_codegen);
597 arch_code_generator_before_ra(birg->cg);
598 BE_TIMER_POP(t_codegen);
600 /* connect all stack modifying nodes together (see beabi.c) */
601 BE_TIMER_PUSH(t_abi);
602 be_abi_fix_stack_nodes(birg->abi);
605 dump(DUMP_SCHED, irg, "-fix_stack", dump_ir_block_graph_sched);
608 BE_TIMER_PUSH(t_verify);
609 be_sched_vrfy(birg, be_options.vrfy_option);
610 BE_TIMER_POP(t_verify);
612 /* do some statistics */
613 be_do_stat_reg_pressure(birg);
615 #ifdef FIRM_STATISTICS
616 stat_ev_dbl("costs_before_ra", be_estimate_irg_costs(irg, env.arch_env, birg->exec_freq));
619 /* Do register allocation */
620 BE_TIMER_PUSH(t_regalloc);
621 be_allocate_registers(birg);
622 BE_TIMER_POP(t_regalloc);
624 #ifdef FIRM_STATISTICS
625 stat_ev_dbl("costs_before_ra", be_estimate_irg_costs(irg, env.arch_env, birg->exec_freq));
628 dump(DUMP_RA, irg, "-ra", dump_ir_block_graph_sched);
629 be_do_stat_nodes(irg, "06 Register Allocation");
631 /* let the code generator prepare the graph for emitter */
632 BE_TIMER_PUSH(t_finish);
633 arch_code_generator_after_ra(birg->cg);
634 BE_TIMER_POP(t_finish);
636 /* fix stack offsets */
637 BE_TIMER_PUSH(t_abi);
638 be_abi_fix_stack_nodes(birg->abi);
639 be_remove_dead_nodes_from_schedule(birg);
640 be_abi_fix_stack_bias(birg->abi);
643 dump(DUMP_SCHED, irg, "-fix_stack_after_ra", dump_ir_block_graph_sched);
645 BE_TIMER_PUSH(t_finish);
646 arch_code_generator_finish(birg->cg);
647 BE_TIMER_POP(t_finish);
649 dump(DUMP_FINAL, irg, "-finish", dump_ir_block_graph_sched);
651 /* check schedule and register allocation */
652 BE_TIMER_PUSH(t_verify);
653 if (be_options.vrfy_option == BE_VRFY_WARN) {
654 irg_verify(irg, VRFY_ENFORCE_SSA);
655 be_check_dominance(irg);
656 be_verify_out_edges(irg);
657 be_verify_schedule(birg);
658 be_verify_register_allocation(env.arch_env, irg);
659 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
660 assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
661 assert(be_verify_out_edges(irg) && "out edge verification failed");
662 assert(be_check_dominance(irg) && "Dominance verification failed");
663 assert(be_verify_schedule(birg) && "Schedule verification failed");
664 assert(be_verify_register_allocation(env.arch_env, irg)
665 && "register allocation verification failed");
668 BE_TIMER_POP(t_verify);
670 /* emit assembler code */
671 BE_TIMER_PUSH(t_emit);
672 arch_code_generator_done(birg->cg);
673 BE_TIMER_POP(t_emit);
675 dump(DUMP_FINAL, irg, "-end", dump_ir_block_graph_sched);
677 BE_TIMER_PUSH(t_abi);
678 be_abi_free(birg->abi);
681 be_do_stat_nodes(irg, "07 Final");
682 restore_optimization_state(&state);
684 BE_TIMER_ONLY(num_nodes_a = get_num_reachable_nodes(irg));
685 BE_TIMER_POP(t_other);
687 #define LC_EMIT(timer) \
688 printf("%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0); \
689 stat_ev_dbl(lc_timer_get_name(timer), lc_timer_elapsed_msec(timer));
691 #define LC_EMIT_RA(timer) \
692 printf("\t%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0); \
693 stat_ev_dbl(lc_timer_get_name(timer), lc_timer_elapsed_msec(timer)); \
696 printf("==>> IRG %s <<==\n", get_entity_name(get_irg_entity(irg)));
697 printf("# nodes at begin: %u\n", num_nodes_b);
698 printf("# nodes before ra: %u\n", num_nodes_r);
699 printf("# nodes at end: %u\n\n", num_nodes_a);
705 if(global_ra_timer != NULL) {
706 LC_EMIT_RA(global_ra_timer->t_prolog);
707 LC_EMIT_RA(global_ra_timer->t_live);
708 LC_EMIT_RA(global_ra_timer->t_spill);
709 LC_EMIT_RA(global_ra_timer->t_spillslots);
710 LC_EMIT_RA(global_ra_timer->t_color);
711 LC_EMIT_RA(global_ra_timer->t_ifg);
712 LC_EMIT_RA(global_ra_timer->t_copymin);
713 LC_EMIT_RA(global_ra_timer->t_ssa);
714 LC_EMIT_RA(global_ra_timer->t_epilog);
715 LC_EMIT_RA(global_ra_timer->t_verify);
716 LC_EMIT_RA(global_ra_timer->t_other);
728 /* switched off due to statistics (statistic module needs all irgs) */
729 #if 0 /* STA needs irgs */
730 #ifdef FIRM_STATISTICS
731 if (! stat_is_active())
732 #endif /* FIRM_STATISTICS */
745 /* Main interface to the frontend. */
746 void be_main(FILE *file_handle, const char *cup_name)
748 lc_timer_t *t = NULL;
750 /* The user specified another config file to read. do that now. */
751 if(strlen(config_file) > 0) {
754 if((f = fopen(config_file, "rt")) != NULL) {
755 lc_opt_from_file(config_file, f, NULL);
760 if (be_options.timing == BE_TIME_ON) {
761 t = lc_timer_register("bemain", "measure complete bemain loop");
763 if (lc_timer_enter_high_priority()) {
764 fprintf(stderr, "Warning: Could not enter high priority mode.\n");
767 lc_timer_reset_and_start(t);
770 if (be_options.statev) {
771 const char *dot = strrchr(cup_name, '.');
772 const char *pos = dot ? dot : cup_name + strlen(cup_name);
773 char *buf = alloca(pos - cup_name + 1);
774 strncpy(buf, cup_name, pos - cup_name);
779 /* never build code for pseudo irgs */
780 set_visit_pseudo_irgs(0);
784 be_main_loop(file_handle, cup_name);
786 if (be_options.timing == BE_TIME_ON) {
788 lc_timer_leave_high_priority();
789 stat_ev_dbl("backend_time", lc_timer_elapsed_msec(t));
790 printf("%-20s: %lu msec\n", "BEMAINLOOP", lc_timer_elapsed_msec(t));
793 if (be_options.statev)
797 /** The debug info retriever function. */
798 static retrieve_dbg_func retrieve_dbg = NULL;
800 /* Sets a debug info retriever. */
801 void be_set_debug_retrieve(retrieve_dbg_func func) {
805 /* Retrieve the debug info. */
806 const char *be_retrieve_dbg_info(const dbg_info *dbg, unsigned *line) {
808 return retrieve_dbg(dbg, line);
814 unsigned be_put_ignore_regs(const be_irg_t *birg, const arch_register_class_t *cls, bitset_t *bs)
817 bs = bitset_alloca(cls->n_regs);
819 bitset_clear_all(bs);
821 assert(bitset_size(bs) == (unsigned)cls->n_regs);
822 arch_put_non_ignore_regs(birg->main_env->arch_env, cls, bs);
824 be_abi_put_ignore_regs(birg->abi, cls, bs);
826 return bitset_popcnt(bs);