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 * @author Sebastian Hack
33 #include <libcore/lc_opts.h>
34 #include <libcore/lc_opts_enum.h>
35 #include <libcore/lc_timing.h>
46 #include "iredges_t.h"
62 #include "besched_t.h"
63 #include "belistsched.h"
65 #include "bespillbelady.h"
67 #include "beraextern.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"
83 #include "beilpsched.h"
86 /* options visible for anyone */
87 static be_options_t be_options = {
88 DUMP_NONE, /* dump flags */
89 BE_TIME_OFF, /* no timing */
90 0, /* no opt profile */
91 1, /* try to omit frame pointer */
92 0, /* no stabs debugging output */
93 BE_VRFY_WARN, /* verification level: warn */
94 BE_SCHED_LIST, /* scheduler: list scheduler */
95 "i44pc52.info.uni-karlsruhe.de", /* ilp server */
96 "cplex", /* ilp solver */
97 "", /* filename for statistic output */
101 static char config_file[256] = { 0 };
103 /* back end instruction set architecture to use */
104 static const arch_isa_if_t *isa_if = NULL;
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_NEGBOOL ("noomitfp", "do not 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_STR ("statfile", "append statistics to file statfile", &be_options.stat_file_name, sizeof(be_options.stat_file_name)),
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 */
167 static be_module_list_entry_t *isa_ifs = NULL;
169 void be_register_isa_if(const char *name, const arch_isa_if_t *isa)
174 be_add_module_to_list(&isa_ifs, name, (void*) isa);
177 void be_opt_register(void)
179 lc_opt_entry_t *be_grp;
180 static int run_once = 0;
189 be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
190 lc_opt_add_table(be_grp, be_main_options);
192 be_add_module_list_opt(be_grp, "isa", "the instruction set architecture",
193 &isa_ifs, (void**) &isa_if);
196 /* Parse one argument. */
197 int be_parse_arg(const char *arg) {
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);
203 return lc_opt_from_single_arg(be_grp, NULL, arg, NULL);
206 /** The be parameters returned by default, all off. */
207 const static backend_params be_params = {
214 /* Perform schedule verification if requested. */
215 static void be_sched_vrfy(be_irg_t *birg, int vrfy_opt) {
216 if (vrfy_opt == BE_VRFY_WARN) {
217 be_verify_schedule(birg);
219 else if (vrfy_opt == BE_VRFY_ASSERT) {
220 assert(be_verify_schedule(birg) && "Schedule verification failed.");
224 /* Initialize the Firm backend. Must be run BEFORE init_firm()! */
225 const backend_params *be_init(void)
230 if (isa_if->get_params)
231 return isa_if->get_params();
236 * Initializes the main environment for the backend.
238 * @param env an empty environment
239 * @param file_handle the file handle where the output will be written to
241 static be_main_env_t *be_init_env(be_main_env_t *env, FILE *file_handle)
243 memset(env, 0, sizeof(*env));
244 obstack_init(&env->obst);
245 env->arch_env = obstack_alloc(&env->obst, sizeof(env->arch_env[0]));
246 env->options = &be_options;
248 arch_env_init(env->arch_env, isa_if, file_handle, env);
250 /* Register the irn handler of the architecture */
251 if (arch_isa_get_irn_handler(env->arch_env->isa))
252 arch_env_push_irn_handler(env->arch_env, arch_isa_get_irn_handler(env->arch_env->isa));
255 * Register the node handler of the back end infrastructure.
256 * This irn handler takes care of the platform independent
257 * spill, reload and perm nodes.
259 arch_env_push_irn_handler(env->arch_env, &be_node_irn_handler);
260 env->phi_handler = be_phi_handler_new(env->arch_env);
261 arch_env_push_irn_handler(env->arch_env, env->phi_handler);
263 env->db_handle = be_options.stabs_debug_support ? be_stabs_open(file_handle) : be_nulldbg_open();
267 static void be_done_env(be_main_env_t *env)
269 env->arch_env->isa->impl->done(env->arch_env->isa);
270 be_dbg_close(env->db_handle);
271 be_phi_handler_free(env->phi_handler);
272 obstack_free(&env->obst, NULL);
276 * A wrapper around a firm dumper. Dumps only, if
279 * @param mask a bitmask containing the reason what will be dumped
280 * @param irg the IR graph to dump
281 * @param suffix the suffix for the dumper
282 * @param dumper the dumper to be called
284 static void dump(int mask, ir_graph *irg, const char *suffix,
285 void (*dumper)(ir_graph *, const char *))
287 if(be_options.dump_flags & mask)
288 be_dump(irg, suffix, dumper);
292 * Prepare a backend graph for code generation and initialize its birg
294 static void initialize_birg(be_irg_t *birg, ir_graph *irg, be_main_env_t *env)
296 memset(birg, 0, sizeof(*birg));
298 birg->main_env = env;
300 edges_deactivate_kind(irg, EDGE_KIND_DEP);
301 edges_activate_kind(irg, EDGE_KIND_DEP);
303 dump(DUMP_INITIAL, irg, "-begin", dump_ir_block_graph);
305 be_stat_init_irg(env->arch_env, irg);
306 be_do_stat_nodes(irg, "01 Begin");
308 /* set the current graph (this is important for several firm functions) */
309 current_ir_graph = irg;
311 /* Normalize proj nodes. */
312 normalize_proj_nodes(irg);
314 /* Make just one return node. */
315 normalize_one_return(irg);
317 /* Remove critical edges */
318 remove_critical_cf_edges(irg);
320 /* Ensure, that the ir_edges are computed. */
323 /* reset the phi handler. */
324 be_phi_handler_reset(env->phi_handler);
326 set_irg_phase_state(irg, phase_backend);
329 #define BE_TIMER_PUSH(timer) \
330 if (be_options.timing == BE_TIME_ON) { \
331 int res = lc_timer_push(timer); \
332 if (be_options.vrfy_option == BE_VRFY_ASSERT) \
333 assert(res && "Timer already on stack, cannot be pushed twice."); \
334 else if (be_options.vrfy_option == BE_VRFY_WARN && ! res) \
335 fprintf(stderr, "Timer %s already on stack, cannot be pushed twice.\n", \
336 lc_timer_get_name(timer)); \
338 #define BE_TIMER_POP(timer) \
339 if (be_options.timing == BE_TIME_ON) { \
340 lc_timer_t *tmp = lc_timer_pop(); \
341 if (be_options.vrfy_option == BE_VRFY_ASSERT) \
342 assert(tmp == timer && "Attempt to pop wrong timer."); \
343 else if (be_options.vrfy_option == BE_VRFY_WARN && tmp != timer) \
344 fprintf(stderr, "Attempt to pop wrong timer. %s is on stack, trying to pop %s.\n", \
345 lc_timer_get_name(tmp), lc_timer_get_name(timer)); \
349 #define BE_TIMER_ONLY(code) do { if (be_options.timing == BE_TIME_ON) { code; } } while(0)
352 * The Firm backend main loop.
353 * Do architecture specific lowering for all graphs
354 * and call the architecture specific code generator.
356 * @param file_handle the file handle the output will be written to
357 * @param cup_name name of the compilation unit
359 static void be_main_loop(FILE *file_handle, const char *cup_name)
364 unsigned num_nodes_b = 0;
365 unsigned num_nodes_a = 0;
366 unsigned num_nodes_r = 0;
367 char prof_filename[256];
368 static const char suffix[] = ".prof";
371 ir_graph **irg_list, **backend_irg_list;
373 lc_timer_t *t_abi = NULL;
374 lc_timer_t *t_codegen = NULL;
375 lc_timer_t *t_sched = NULL;
376 lc_timer_t *t_constr = NULL;
377 lc_timer_t *t_regalloc = NULL;
378 lc_timer_t *t_finish = NULL;
379 lc_timer_t *t_emit = NULL;
380 lc_timer_t *t_other = NULL;
381 lc_timer_t *t_verify = NULL;
383 if (be_options.timing == BE_TIME_ON) {
384 t_abi = lc_timer_register("beabi", "be abi introduction");
385 t_codegen = lc_timer_register("codegen", "codegeneration");
386 t_sched = lc_timer_register("sched", "scheduling");
387 t_constr = lc_timer_register("constr", "assure constraints");
388 t_regalloc = lc_timer_register("regalloc", "register allocation");
389 t_finish = lc_timer_register("finish", "graph finish");
390 t_emit = lc_timer_register("emiter", "code emiter");
391 t_verify = lc_timer_register("verify", "graph verification");
392 t_other = lc_timer_register("other", "other");
395 be_init_env(&env, file_handle);
397 isa = arch_env_get_isa(env.arch_env);
399 be_dbg_so(env.db_handle, cup_name);
400 be_dbg_types(env.db_handle);
402 /* backend may provide an ordered list of irgs where code should be generated for */
403 irg_list = NEW_ARR_F(ir_graph *, 0);
404 backend_irg_list = arch_isa_get_backend_irg_list(isa, &irg_list);
406 /* we might need 1 birg more for instrumentation constructor */
407 num_birgs = backend_irg_list ? ARR_LEN(backend_irg_list) : get_irp_n_irgs();
408 birgs = alloca(sizeof(birgs[0]) * (num_birgs + 1));
410 /* First: initialize all birgs */
411 for(i = 0; i < num_birgs; ++i) {
412 ir_graph *irg = backend_irg_list ? backend_irg_list[i] : get_irp_irg(i);
413 initialize_birg(&birgs[i], irg, &env);
418 Get the filename for the profiling data.
419 Beware: '\0' is already included in sizeof(suffix)
421 memset(prof_filename, 0, sizeof(prof_filename));
422 strncpy(prof_filename, cup_name, sizeof(prof_filename) - sizeof(suffix));
423 strcat(prof_filename, suffix);
426 Next: Either instruments all irgs with profiling code
427 or try to read in profile data for current translation unit.
429 if (be_options.opt_profile) {
430 ir_graph *prof_init_irg = be_profile_instrument(prof_filename, profile_default);
431 initialize_birg(&birgs[num_birgs], prof_init_irg, &env);
433 set_method_img_section(get_irg_entity(prof_init_irg), section_constructors);
435 be_profile_read(prof_filename);
439 for (i = 0; i < num_birgs; ++i) {
440 be_irg_t *birg = &birgs[i];
441 ir_graph *irg = birg->irg;
442 optimization_state_t state;
443 const arch_code_generator_if_t *cg_if;
446 /* set the current graph (this is important for several firm functions) */
447 current_ir_graph = irg;
449 #ifdef FIRM_STATISTICS
450 if(be_stat_ev_is_active()) {
451 ir_snprintf(irg_name, sizeof(irg_name), "%F", irg);
452 be_stat_tags[STAT_TAG_CLS] = "<all>";
453 be_stat_tags[STAT_TAG_IRG] = irg_name;
454 be_stat_ev_push(be_stat_tags, STAT_TAG_LAST, be_stat_file);
458 /* stop and reset timers */
460 LC_STOP_AND_RESET_TIMER(t_abi);
461 LC_STOP_AND_RESET_TIMER(t_codegen);
462 LC_STOP_AND_RESET_TIMER(t_sched);
463 LC_STOP_AND_RESET_TIMER(t_constr);
464 LC_STOP_AND_RESET_TIMER(t_regalloc);
465 LC_STOP_AND_RESET_TIMER(t_finish);
466 LC_STOP_AND_RESET_TIMER(t_emit);
467 LC_STOP_AND_RESET_TIMER(t_verify);
468 LC_STOP_AND_RESET_TIMER(t_other);
470 BE_TIMER_PUSH(t_other); /* t_other */
472 /* Verify the initial graph */
473 BE_TIMER_PUSH(t_verify);
474 if (be_options.vrfy_option == BE_VRFY_WARN) {
475 irg_verify(irg, VRFY_ENFORCE_SSA);
476 be_check_dominance(irg);
477 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
478 assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
479 assert(be_check_dominance(irg) && "Dominance verification failed");
481 BE_TIMER_POP(t_verify);
483 BE_TIMER_ONLY(num_nodes_b = get_num_reachable_nodes(irg));
485 /* Get the code generator interface. */
486 cg_if = isa->impl->get_code_generator_if(isa);
488 /* get a code generator for this graph. */
489 birg->cg = cg_if->init(birg);
491 /* some transformations need to be done before abi introduce */
492 arch_code_generator_before_abi(birg->cg);
494 /* reset the phi handler. */
495 be_phi_handler_reset(env.phi_handler);
497 /* implement the ABI conventions. */
498 BE_TIMER_PUSH(t_abi);
499 birg->abi = be_abi_introduce(birg);
502 dump(DUMP_ABI, irg, "-abi", dump_ir_block_graph);
503 be_do_stat_nodes(irg, "02 Abi");
505 if (be_options.vrfy_option == BE_VRFY_WARN) {
506 be_check_dominance(irg);
507 be_verify_out_edges(irg);
508 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
509 assert(be_verify_out_edges(irg));
510 assert(be_check_dominance(irg) && "Dominance verification failed");
514 BE_TIMER_PUSH(t_codegen);
515 arch_code_generator_prepare_graph(birg->cg);
516 BE_TIMER_POP(t_codegen);
518 be_do_stat_nodes(irg, "03 Prepare");
520 dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph);
521 BE_TIMER_ONLY(num_nodes_r = get_num_reachable_nodes(irg));
523 if (be_options.vrfy_option == BE_VRFY_WARN) {
524 be_check_dominance(irg);
525 be_verify_out_edges(irg);
526 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
527 assert(be_verify_out_edges(irg));
528 assert(be_check_dominance(irg) && "Dominance verification failed");
532 * Create execution frequencies from profile data or estimate some
534 if (be_profile_has_data()) {
535 birg->exec_freq = be_create_execfreqs_from_profile(irg);
537 birg->exec_freq = compute_execfreq(irg, 10);
540 /* let backend prepare scheduling */
541 BE_TIMER_PUSH(t_codegen);
542 arch_code_generator_before_sched(birg->cg);
543 BE_TIMER_POP(t_codegen);
545 /* schedule the irg */
546 BE_TIMER_PUSH(t_sched);
547 switch (be_options.scheduler) {
549 fprintf(stderr, "Warning: invalid scheduler (%d) selected, falling back to list scheduler.\n", be_options.scheduler);
551 list_sched(birg, &be_options);
555 be_ilp_sched(birg, &be_options);
557 #endif /* WITH_ILP */
559 BE_TIMER_POP(t_sched);
561 dump(DUMP_SCHED, irg, "-sched", dump_ir_block_graph_sched);
564 BE_TIMER_PUSH(t_verify);
565 be_sched_vrfy(birg, be_options.vrfy_option);
566 BE_TIMER_POP(t_verify);
568 be_do_stat_nodes(irg, "04 Schedule");
570 /* introduce patterns to assure constraints */
571 BE_TIMER_PUSH(t_constr);
572 /* we switch off optimizations here, because they might cause trouble */
573 save_optimization_state(&state);
575 set_opt_normalize(0);
577 /* add Keeps for should_be_different constrained nodes */
578 /* beware: needs schedule due to usage of be_ssa_constr */
579 assure_constraints(birg);
580 BE_TIMER_POP(t_constr);
582 dump(DUMP_SCHED, irg, "-assured", dump_ir_block_graph_sched);
583 be_do_stat_nodes(irg, "05 Constraints");
585 /* stuff needs to be done after scheduling but before register allocation */
586 BE_TIMER_PUSH(t_codegen);
587 arch_code_generator_before_ra(birg->cg);
588 BE_TIMER_POP(t_codegen);
590 /* connect all stack modifying nodes together (see beabi.c) */
591 BE_TIMER_PUSH(t_abi);
592 be_abi_fix_stack_nodes(birg->abi);
595 dump(DUMP_SCHED, irg, "-fix_stack", dump_ir_block_graph_sched);
598 BE_TIMER_PUSH(t_verify);
599 be_sched_vrfy(birg, be_options.vrfy_option);
600 BE_TIMER_POP(t_verify);
602 /* do some statistics */
603 be_do_stat_reg_pressure(birg);
605 #ifdef FIRM_STATISTICS
606 if(be_stat_ev_is_active()) {
607 be_stat_ev_l("costs_before_ra",
608 (long) be_estimate_irg_costs(irg, env.arch_env, birg->exec_freq));
612 /* Do register allocation */
613 BE_TIMER_PUSH(t_regalloc);
614 be_allocate_registers(birg);
615 BE_TIMER_POP(t_regalloc);
617 #ifdef FIRM_STATISTICS
618 if(be_stat_ev_is_active()) {
619 be_stat_ev_l("costs_after_ra",
620 (long) be_estimate_irg_costs(irg, env.arch_env, birg->exec_freq));
624 dump(DUMP_RA, irg, "-ra", dump_ir_block_graph_sched);
625 be_do_stat_nodes(irg, "06 Register Allocation");
627 /* let the code generator prepare the graph for emitter */
628 BE_TIMER_PUSH(t_finish);
629 arch_code_generator_after_ra(birg->cg);
630 BE_TIMER_POP(t_finish);
632 /* fix stack offsets */
633 BE_TIMER_PUSH(t_abi);
634 be_abi_fix_stack_nodes(birg->abi);
635 be_remove_dead_nodes_from_schedule(irg);
636 be_abi_fix_stack_bias(birg->abi);
639 dump(DUMP_SCHED, irg, "-fix_stack_after_ra", dump_ir_block_graph_sched);
641 BE_TIMER_PUSH(t_finish);
642 arch_code_generator_finish(birg->cg);
643 BE_TIMER_POP(t_finish);
645 dump(DUMP_FINAL, irg, "-finish", dump_ir_block_graph_sched);
647 /* check schedule and register allocation */
648 BE_TIMER_PUSH(t_verify);
649 if (be_options.vrfy_option == BE_VRFY_WARN) {
650 irg_verify(irg, VRFY_ENFORCE_SSA);
651 be_check_dominance(irg);
652 be_verify_out_edges(irg);
653 be_verify_schedule(birg);
654 be_verify_register_allocation(env.arch_env, irg);
655 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
656 assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
657 assert(be_verify_out_edges(irg) && "out edge verification failed");
658 assert(be_check_dominance(irg) && "Dominance verification failed");
659 assert(be_verify_schedule(birg) && "Schedule verification failed");
660 assert(be_verify_register_allocation(env.arch_env, irg)
661 && "register allocation verification failed");
664 BE_TIMER_POP(t_verify);
666 /* emit assembler code */
667 BE_TIMER_PUSH(t_emit);
668 arch_code_generator_done(birg->cg);
669 BE_TIMER_POP(t_emit);
671 dump(DUMP_FINAL, irg, "-end", dump_ir_block_graph_sched);
673 BE_TIMER_PUSH(t_abi);
674 be_abi_free(birg->abi);
677 be_do_stat_nodes(irg, "07 Final");
678 restore_optimization_state(&state);
680 BE_TIMER_ONLY(num_nodes_a = get_num_reachable_nodes(irg));
681 BE_TIMER_POP(t_other);
683 #define LC_EMIT(timer) \
684 if(!be_stat_ev_is_active()) { \
685 printf("%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0); \
687 be_stat_ev_l(lc_timer_get_name(timer), lc_timer_elapsed_msec(timer)); \
689 #define LC_EMIT_RA(timer) \
690 if(!be_stat_ev_is_active()) { \
691 printf("\t%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0); \
693 be_stat_ev_l(lc_timer_get_name(timer), lc_timer_elapsed_msec(timer)); \
696 if(!be_stat_ev_is_active()) {
697 printf("==>> IRG %s <<==\n", get_entity_name(get_irg_entity(irg)));
698 printf("# nodes at begin: %u\n", num_nodes_b);
699 printf("# nodes before ra: %u\n", num_nodes_r);
700 printf("# nodes at end: %u\n\n", num_nodes_a);
707 if(global_ra_timer != NULL) {
708 LC_EMIT_RA(global_ra_timer->t_prolog);
709 LC_EMIT_RA(global_ra_timer->t_live);
710 LC_EMIT_RA(global_ra_timer->t_spill);
711 LC_EMIT_RA(global_ra_timer->t_spillslots);
712 LC_EMIT_RA(global_ra_timer->t_color);
713 LC_EMIT_RA(global_ra_timer->t_ifg);
714 LC_EMIT_RA(global_ra_timer->t_copymin);
715 LC_EMIT_RA(global_ra_timer->t_ssa);
716 LC_EMIT_RA(global_ra_timer->t_epilog);
717 LC_EMIT_RA(global_ra_timer->t_verify);
718 LC_EMIT_RA(global_ra_timer->t_other);
730 /* switched off due to statistics (statistic module needs all irgs) */
731 #if 0 /* STA needs irgs */
732 #ifdef FIRM_STATISTICS
733 if (! stat_is_active())
734 #endif /* FIRM_STATISTICS */
737 if(be_stat_ev_is_active()) {
749 /* Main interface to the frontend. */
750 void be_main(FILE *file_handle, const char *cup_name)
752 lc_timer_t *t = NULL;
754 /* The user specified another config file to read. do that now. */
755 if(strlen(config_file) > 0) {
758 if((f = fopen(config_file, "rt")) != NULL) {
759 lc_opt_from_file(config_file, f, NULL);
764 if (be_options.timing == BE_TIME_ON) {
765 t = lc_timer_register("bemain", "measure complete bemain loop");
767 if (lc_timer_enter_high_priority()) {
768 fprintf(stderr, "Warning: Could not enter high priority mode.\n");
771 lc_timer_reset_and_start(t);
774 #ifdef FIRM_STATISTICS
775 be_init_stat_file(be_options.stat_file_name, cup_name);
778 /* never build code for pseudo irgs */
779 set_visit_pseudo_irgs(0);
783 be_main_loop(file_handle, cup_name);
785 if (be_options.timing == BE_TIME_ON) {
787 lc_timer_leave_high_priority();
788 if(be_stat_ev_is_active()) {
789 be_stat_ev_l("backend_time", lc_timer_elapsed_msec(t));
791 printf("%-20s: %lu msec\n", "BEMAINLOOP", lc_timer_elapsed_msec(t));
795 #ifdef FIRM_STATISTICS
796 be_close_stat_file();
800 /** The debug info retriever function. */
801 static retrieve_dbg_func retrieve_dbg = NULL;
803 /* Sets a debug info retriever. */
804 void be_set_debug_retrieve(retrieve_dbg_func func) {
808 /* Retrieve the debug info. */
809 const char *be_retrieve_dbg_info(const dbg_info *dbg, unsigned *line) {
811 return retrieve_dbg(dbg, line);
817 int be_put_ignore_regs(const be_irg_t *birg, const arch_register_class_t *cls, bitset_t *bs)
820 bs = bitset_alloca(cls->n_regs);
822 bitset_clear_all(bs);
824 assert(bitset_size(bs) == (unsigned) cls->n_regs);
825 arch_put_non_ignore_regs(birg->main_env->arch_env, cls, bs);
827 be_abi_put_ignore_regs(birg->abi, cls, bs);
829 return bitset_popcnt(bs);