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"
40 #include "firm/bearch_firm.h"
41 #include "ia32/bearch_ia32.h"
42 #include "arm/bearch_arm.h"
43 #include "ppc32/bearch_ppc32.h"
44 #include "mips/bearch_mips.h"
51 #include "besched_t.h"
52 #include "belistsched.h"
54 #include "bespillbelady.h"
56 #include "beraextern.h"
57 #include "bechordal_t.h"
59 #include "beifg_impl.h"
60 #include "becopyopt.h"
61 #include "becopystat.h"
62 #include "bessadestr.h"
65 #include "beschedmris.h"
68 #include "beprofile.h"
69 #include "beblocksched.h"
70 #include "be_dbgout.h"
73 #include "beilpsched.h"
76 /* options visible for anyone */
77 static be_options_t be_options = {
78 DUMP_NONE, /* dump flags */
79 BE_TIME_OFF, /* no timing */
80 0, /* no opt profile */
81 1, /* try to omit frame pointer */
82 0, /* always stabs debugging output */
83 BE_VRFY_WARN, /* verification level: warn */
84 BE_SCHED_LIST, /* scheduler: list scheduler */
85 "i44pc52.info.uni-karlsruhe.de", /* ilp server */
86 "cplex" /* ilp solver */
90 static char config_file[256] = { 0 };
92 /* register allocator to use. */
93 //static const be_ra_t *ra = &be_ra_chordal_allocator;
95 /* back end instruction set architecture to use */
96 static const arch_isa_if_t *isa_if = &ia32_isa_if;
100 /* possible dumping options */
101 static const lc_opt_enum_mask_items_t dump_items[] = {
102 { "none", DUMP_NONE },
103 { "initial", DUMP_INITIAL },
105 { "sched", DUMP_SCHED },
106 { "prepared", DUMP_PREPARED },
107 { "regalloc", DUMP_RA },
108 { "final", DUMP_FINAL },
110 { "all", 2 * DUMP_BE - 1 },
114 /* instruction set architectures. */
115 static const lc_opt_enum_const_ptr_items_t isa_items[] = {
116 { "ia32", &ia32_isa_if },
118 { "sta", &sta_isa_if },
119 { "arm", &arm_isa_if },
120 { "ppc32", &ppc32_isa_if },
121 { "mips", &mips_isa_if },
126 /* verify options. */
127 static const lc_opt_enum_int_items_t vrfy_items[] = {
128 { "off", BE_VRFY_OFF },
129 { "warn", BE_VRFY_WARN },
130 { "assert", BE_VRFY_ASSERT },
134 /* scheduling options. */
135 static const lc_opt_enum_int_items_t sched_items[] = {
136 { "list", BE_SCHED_LIST },
138 { "ilp", BE_SCHED_ILP },
139 #endif /* WITH_ILP */
143 static lc_opt_enum_mask_var_t dump_var = {
144 &be_options.dump_flags, dump_items
147 static lc_opt_enum_const_ptr_var_t isa_var = {
148 (const void **) &isa_if, isa_items
151 static lc_opt_enum_int_var_t vrfy_var = {
152 &be_options.vrfy_option, vrfy_items
155 static lc_opt_enum_int_var_t sched_var = {
156 &be_options.scheduler, sched_items
159 static const lc_opt_table_entry_t be_main_options[] = {
160 LC_OPT_ENT_STR ("config", "read another config file containing backend options", config_file, sizeof(config_file)),
161 LC_OPT_ENT_ENUM_MASK("dump", "dump irg on several occasions", &dump_var),
162 LC_OPT_ENT_ENUM_PTR ("isa", "the instruction set architecture", &isa_var),
163 LC_OPT_ENT_NEGBOOL ("noomitfp", "do not omit frame pointer", &be_options.omit_fp),
164 LC_OPT_ENT_BOOL ("stabs", "enable stabs debug support", &be_options.stabs_debug_support),
165 LC_OPT_ENT_ENUM_PTR ("vrfy", "verify the backend irg", &vrfy_var),
166 LC_OPT_ENT_BOOL ("time", "get backend timing statistics", &be_options.timing),
167 LC_OPT_ENT_BOOL ("profile", "instrument the code for execution count profiling", &be_options.opt_profile),
168 LC_OPT_ENT_ENUM_PTR ("sched", "select a scheduler", &sched_var),
169 LC_OPT_ENT_STR ("statfile", "append statistics to file statfile", &be_options.stat_file_name, sizeof(be_options.stat_file_name)),
172 LC_OPT_ENT_STR ("ilp.server", "the ilp server name", be_options.ilp_server, sizeof(be_options.ilp_server)),
173 LC_OPT_ENT_STR ("ilp.solver", "the ilp solver name", be_options.ilp_solver, sizeof(be_options.ilp_solver)),
174 #endif /* WITH_ILP */
178 #endif /* WITH_LIBCORE */
180 void be_opt_register(void)
183 lc_opt_entry_t *be_grp;
184 static int run_once = 0;
193 be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
194 lc_opt_add_table(be_grp, be_main_options);
195 #endif /* WITH_LIBCORE */
198 /* Parse one argument. */
199 int be_parse_arg(const char *arg) {
201 lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
202 if (strcmp(arg, "help") == 0 || (arg[0] == '?' && arg[1] == '\0')) {
203 lc_opt_print_help(be_grp, stdout);
206 return lc_opt_from_single_arg(be_grp, NULL, arg, NULL);
209 #endif /* WITH_LIBCORE */
212 /** The be parameters returned by default, all off. */
213 const static backend_params be_params = {
220 /* Perform schedule verification if requested. */
221 static void be_sched_vrfy(ir_graph *irg, int vrfy_opt) {
222 if (vrfy_opt == BE_VRFY_WARN) {
223 be_verify_schedule(irg);
225 else if (vrfy_opt == BE_VRFY_ASSERT) {
226 assert(be_verify_schedule(irg) && "Schedule verification failed.");
230 /* Initialize the Firm backend. Must be run BEFORE init_firm()! */
231 const backend_params *be_init(void)
237 if (isa_if->get_params)
238 return isa_if->get_params();
243 * Initializes the main environment for the backend.
245 * @param env an empty environment
246 * @param file_handle the file handle where the output will be written to
248 static be_main_env_t *be_init_env(be_main_env_t *env, FILE *file_handle)
250 memset(env, 0, sizeof(*env));
251 obstack_init(&env->obst);
252 env->arch_env = obstack_alloc(&env->obst, sizeof(env->arch_env[0]));
253 env->options = &be_options;
254 FIRM_DBG_REGISTER(env->dbg, "be.main");
256 arch_env_init(env->arch_env, isa_if, file_handle, env);
258 /* Register the irn handler of the architecture */
259 if (arch_isa_get_irn_handler(env->arch_env->isa))
260 arch_env_push_irn_handler(env->arch_env, arch_isa_get_irn_handler(env->arch_env->isa));
263 * Register the node handler of the back end infrastructure.
264 * This irn handler takes care of the platform independent
265 * spill, reload and perm nodes.
267 arch_env_push_irn_handler(env->arch_env, &be_node_irn_handler);
268 env->phi_handler = be_phi_handler_new(env->arch_env);
269 arch_env_push_irn_handler(env->arch_env, env->phi_handler);
271 env->db_handle = be_options.stabs_debug_support ? be_stabs_open(file_handle) : be_nulldbg_open();
275 static void be_done_env(be_main_env_t *env)
277 env->arch_env->isa->impl->done(env->arch_env->isa);
278 be_dbg_close(env->db_handle);
279 be_phi_handler_free(env->phi_handler);
280 obstack_free(&env->obst, NULL);
284 * A wrapper around a firm dumper. Dumps only, if
287 * @param mask a bitmask containing the reason what will be dumped
288 * @param irg the IR graph to dump
289 * @param suffix the suffix for the dumper
290 * @param dumper the dumper to be called
292 static void dump(int mask, ir_graph *irg, const char *suffix,
293 void (*dumper)(ir_graph *, const char *))
295 if(be_options.dump_flags & mask)
296 be_dump(irg, suffix, dumper);
300 * Prepare a backend graph for code generation and initialize its birg
302 static void initialize_birg(be_irg_t *birg, ir_graph *irg, be_main_env_t *env)
304 memset(birg, 0, sizeof(*birg));
306 birg->main_env = env;
308 edges_deactivate_kind(irg, EDGE_KIND_DEP);
309 edges_activate_kind(irg, EDGE_KIND_DEP);
311 DBG((env->dbg, LEVEL_2, "====> IRG: %F\n", irg));
312 dump(DUMP_INITIAL, irg, "-begin", dump_ir_block_graph);
314 be_stat_init_irg(env->arch_env, irg);
315 be_do_stat_nodes(irg, "01 Begin");
317 /* set the current graph (this is important for several firm functions) */
318 current_ir_graph = irg;
320 /* Normalize proj nodes. */
321 normalize_proj_nodes(irg);
323 /* Make just one return node. */
324 normalize_one_return(irg);
326 /* Remove critical edges */
327 remove_critical_cf_edges(irg);
329 /* Ensure, that the ir_edges are computed. */
332 /* reset the phi handler. */
333 be_phi_handler_reset(env->phi_handler);
338 #define BE_TIMER_PUSH(timer) \
339 if (be_options.timing == BE_TIME_ON) { \
340 int res = lc_timer_push(timer); \
341 if (be_options.vrfy_option == BE_VRFY_ASSERT) \
342 assert(res && "Timer already on stack, cannot be pushed twice."); \
343 else if (be_options.vrfy_option == BE_VRFY_WARN && ! res) \
344 fprintf(stderr, "Timer %s already on stack, cannot be pushed twice.\n", \
345 lc_timer_get_name(timer)); \
347 #define BE_TIMER_POP(timer) \
348 if (be_options.timing == BE_TIME_ON) { \
349 lc_timer_t *tmp = lc_timer_pop(); \
350 if (be_options.vrfy_option == BE_VRFY_ASSERT) \
351 assert(tmp == timer && "Attempt to pop wrong timer."); \
352 else if (be_options.vrfy_option == BE_VRFY_WARN && tmp != timer) \
353 fprintf(stderr, "Attempt to pop wrong timer. %s is on stack, trying to pop %s.\n", \
354 lc_timer_get_name(tmp), lc_timer_get_name(timer)); \
358 #define BE_TIMER_ONLY(code) do { if (be_options.timing == BE_TIME_ON) { code; } } while(0)
362 #define BE_TIMER_PUSH(timer)
363 #define BE_TIMER_POP(timer)
364 #define BE_TIMER_ONLY(code)
366 #endif /* WITH_LIBCORE */
370 * The Firm backend main loop.
371 * Do architecture specific lowering for all graphs
372 * and call the architecture specific code generator.
374 * @param file_handle the file handle the output will be written to
375 * @param cup_name name of the compilation unit
377 static void be_main_loop(FILE *file_handle, const char *cup_name)
382 unsigned num_nodes_b = 0;
383 unsigned num_nodes_a = 0;
384 unsigned num_nodes_r = 0;
385 char prof_filename[256];
386 static const char suffix[] = ".prof";
390 be_ra_timer_t *ra_timer;
393 lc_timer_t *t_abi = NULL;
394 lc_timer_t *t_codegen = NULL;
395 lc_timer_t *t_sched = NULL;
396 lc_timer_t *t_constr = NULL;
397 lc_timer_t *t_regalloc = NULL;
398 lc_timer_t *t_finish = NULL;
399 lc_timer_t *t_emit = NULL;
400 lc_timer_t *t_other = NULL;
401 lc_timer_t *t_verify = NULL;
403 if (be_options.timing == BE_TIME_ON) {
404 t_abi = lc_timer_register("beabi", "be abi introduction");
405 t_codegen = lc_timer_register("codegen", "codegeneration");
406 t_sched = lc_timer_register("sched", "scheduling");
407 t_constr = lc_timer_register("constr", "assure constraints");
408 t_regalloc = lc_timer_register("regalloc", "register allocation");
409 t_finish = lc_timer_register("finish", "graph finish");
410 t_emit = lc_timer_register("emiter", "code emiter");
411 t_verify = lc_timer_register("verify", "graph verification");
412 t_other = lc_timer_register("other", "other");
414 #endif /* WITH_LIBCORE */
416 be_init_env(&env, file_handle);
418 isa = arch_env_get_isa(env.arch_env);
420 be_dbg_so(env.db_handle, cup_name);
421 be_dbg_types(env.db_handle);
423 /* we might need 1 birg more for instrumentation constructor */
424 num_birgs = get_irp_n_irgs();
425 birgs = alloca(sizeof(birgs[0]) * (num_birgs + 1));
427 /* First: initialize all birgs */
428 for(i = 0; i < get_irp_n_irgs(); ++i) {
429 ir_graph *irg = get_irp_irg(i);
431 initialize_birg(&birgs[i], irg, &env);
435 Get the filename for the profiling data.
436 Beware: '\0' is already included in sizeof(suffix)
438 memset(prof_filename, 0, sizeof(prof_filename));
439 strncpy(prof_filename, cup_name, sizeof(prof_filename) - sizeof(suffix));
440 strcat(prof_filename, suffix);
443 Next: Either instruments all irgs with profiling code
444 or try to read in profile data for current translation unit.
446 if (be_options.opt_profile) {
447 ir_graph *prof_init_irg = be_profile_instrument(prof_filename, profile_default);
448 initialize_birg(&birgs[num_birgs], prof_init_irg, &env);
450 set_method_img_section(get_irg_entity(prof_init_irg), section_constructors);
453 be_profile_read(prof_filename);
457 for (i = 0; i < num_birgs; ++i) {
458 be_irg_t *birg = & birgs[i];
459 ir_graph *irg = birg->irg;
460 optimization_state_t state;
461 const arch_code_generator_if_t *cg_if;
464 /* set the current graph (this is important for several firm functions) */
465 current_ir_graph = irg;
467 #ifdef FIRM_STATISTICS
468 if(be_stat_ev_is_active()) {
469 ir_snprintf(irg_name, sizeof(irg_name), "%F", irg);
470 be_stat_tags[STAT_TAG_CLS] = "<all>";
471 be_stat_tags[STAT_TAG_IRG] = irg_name;
472 be_stat_ev_push(be_stat_tags, STAT_TAG_LAST, be_stat_file);
476 /* stop and reset timers */
478 LC_STOP_AND_RESET_TIMER(t_abi);
479 LC_STOP_AND_RESET_TIMER(t_codegen);
480 LC_STOP_AND_RESET_TIMER(t_sched);
481 LC_STOP_AND_RESET_TIMER(t_constr);
482 LC_STOP_AND_RESET_TIMER(t_regalloc);
483 LC_STOP_AND_RESET_TIMER(t_finish);
484 LC_STOP_AND_RESET_TIMER(t_emit);
485 LC_STOP_AND_RESET_TIMER(t_verify);
486 LC_STOP_AND_RESET_TIMER(t_other);
488 BE_TIMER_PUSH(t_other); /* t_other */
490 /* Verify the initial graph */
491 BE_TIMER_PUSH(t_verify);
492 if (be_options.vrfy_option == BE_VRFY_WARN) {
493 irg_verify(irg, VRFY_ENFORCE_SSA);
494 be_check_dominance(irg);
495 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
496 assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
497 assert(be_check_dominance(irg) && "Dominance verification failed");
499 BE_TIMER_POP(t_verify);
502 * Create execution frequencies from profile data or estimate some
504 if (be_profile_has_data()) {
505 birg->exec_freq = be_create_execfreqs_from_profile(irg);
507 birg->exec_freq = compute_execfreq(irg, 10);
510 BE_TIMER_ONLY(num_nodes_b = get_num_reachable_nodes(irg));
512 /* Get the code generator interface. */
513 cg_if = isa->impl->get_code_generator_if(isa);
515 /* get a code generator for this graph. */
516 birg->cg = cg_if->init(birg);
518 /* some transformations need to be done before abi introduce */
519 arch_code_generator_before_abi(birg->cg);
521 /* reset the phi handler. */
522 be_phi_handler_reset(env.phi_handler);
524 /* implement the ABI conventions. */
525 BE_TIMER_PUSH(t_abi);
526 birg->abi = be_abi_introduce(birg);
529 dump(DUMP_ABI, irg, "-abi", dump_ir_block_graph);
530 be_do_stat_nodes(irg, "02 Abi");
533 BE_TIMER_PUSH(t_codegen);
534 arch_code_generator_prepare_graph(birg->cg);
535 BE_TIMER_POP(t_codegen);
537 be_do_stat_nodes(irg, "03 Prepare");
540 Since the code generator made a lot of new nodes and skipped
541 a lot of old ones, we should do dead node elimination here.
542 Note that this requires disabling the edges here.
544 edges_deactivate(irg);
545 //dead_node_elimination(irg);
548 /* Compute loop nesting information (for weighting copies) */
549 dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph);
550 BE_TIMER_ONLY(num_nodes_r = get_num_reachable_nodes(irg));
552 /* let backend prepare scheduling */
553 BE_TIMER_PUSH(t_codegen);
554 arch_code_generator_before_sched(birg->cg);
555 BE_TIMER_POP(t_codegen);
557 /* schedule the irg */
558 BE_TIMER_PUSH(t_sched);
559 switch (be_options.scheduler) {
561 fprintf(stderr, "Warning: invalid scheduler (%d) selected, falling back to list scheduler.\n", be_options.scheduler);
563 list_sched(birg, &be_options);
568 //fprintf(stderr, "Warning: ILP scheduler not yet fully implemented, falling back to list scheduler.\n");
569 //list_sched(birg, &be_options);
571 #endif /* WITH_ILP */
573 BE_TIMER_POP(t_sched);
575 dump(DUMP_SCHED, irg, "-sched", dump_ir_block_graph_sched);
578 BE_TIMER_PUSH(t_verify);
579 be_sched_vrfy(irg, be_options.vrfy_option);
580 BE_TIMER_POP(t_verify);
582 be_do_stat_nodes(irg, "04 Schedule");
584 /* introduce patterns to assure constraints */
585 BE_TIMER_PUSH(t_constr);
586 /* we switch off optimizations here, because they might cause trouble */
587 save_optimization_state(&state);
589 set_opt_normalize(0);
591 /* add Keeps for should_be_different constrained nodes */
592 /* beware: needs schedule due to usage of be_ssa_constr */
593 assure_constraints(birg);
594 BE_TIMER_POP(t_constr);
596 dump(DUMP_SCHED, irg, "-assured", dump_ir_block_graph_sched);
597 be_do_stat_nodes(irg, "05 Constraints");
599 /* connect all stack modifying nodes together (see beabi.c) */
600 BE_TIMER_PUSH(t_abi);
601 be_abi_fix_stack_nodes(birg->abi, NULL);
604 dump(DUMP_SCHED, irg, "-fix_stack", dump_ir_block_graph_sched);
607 BE_TIMER_PUSH(t_verify);
608 be_sched_vrfy(irg, be_options.vrfy_option);
609 BE_TIMER_POP(t_verify);
611 /* do some statistics */
612 be_do_stat_reg_pressure(birg);
614 /* stuff needs to be done after scheduling but before register allocation */
615 BE_TIMER_PUSH(t_codegen);
616 arch_code_generator_before_ra(birg->cg);
617 BE_TIMER_POP(t_codegen);
619 #ifdef FIRM_STATISTICS
620 if(be_stat_ev_is_active()) {
621 be_stat_ev_l("costs_before_ra",
622 (long) be_estimate_irg_costs(irg, env.arch_env, birg->exec_freq));
626 /* Do register allocation */
627 BE_TIMER_PUSH(t_regalloc);
628 //ra_timer = ra->allocate(birg);
629 BE_TIMER_POP(t_regalloc);
631 #ifdef FIRM_STATISTICS
632 if(be_stat_ev_is_active()) {
633 be_stat_ev_l("costs_after_ra",
634 (long) be_estimate_irg_costs(irg, env.arch_env, birg->exec_freq));
638 dump(DUMP_RA, irg, "-ra", dump_ir_block_graph_sched);
639 be_do_stat_nodes(irg, "06 Register Allocation");
641 /* let the code generator prepare the graph for emitter */
642 BE_TIMER_PUSH(t_finish);
643 arch_code_generator_after_ra(birg->cg);
644 BE_TIMER_POP(t_finish);
646 /* fix stack offsets */
647 BE_TIMER_PUSH(t_abi);
648 be_abi_fix_stack_nodes(birg->abi, NULL);
649 be_remove_dead_nodes_from_schedule(irg);
650 be_abi_fix_stack_bias(birg->abi);
653 BE_TIMER_PUSH(t_finish);
654 arch_code_generator_finish(birg->cg);
655 BE_TIMER_POP(t_finish);
657 dump(DUMP_FINAL, irg, "-finish", dump_ir_block_graph_sched);
659 /* check schedule and register allocation */
660 BE_TIMER_PUSH(t_verify);
661 if (be_options.vrfy_option == BE_VRFY_WARN) {
662 //irg_verify(irg, VRFY_ENFORCE_SSA);
663 be_check_dominance(irg);
664 be_verify_out_edges(irg);
665 be_verify_schedule(irg);
666 be_verify_register_allocation(env.arch_env, irg);
668 else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
669 //assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
670 assert(be_verify_out_edges(irg));
671 assert(be_check_dominance(irg) && "Dominance verification failed");
672 assert(be_verify_schedule(irg) && "Schedule verification failed");
673 assert(be_verify_register_allocation(env.arch_env, irg)
674 && "register allocation verification failed");
676 BE_TIMER_POP(t_verify);
678 /* emit assembler code */
679 BE_TIMER_PUSH(t_emit);
680 arch_code_generator_done(birg->cg);
681 BE_TIMER_POP(t_emit);
683 dump(DUMP_FINAL, irg, "-end", dump_ir_extblock_graph_sched);
685 BE_TIMER_PUSH(t_abi);
686 be_abi_free(birg->abi);
689 be_do_stat_nodes(irg, "07 Final");
690 restore_optimization_state(&state);
692 BE_TIMER_ONLY(num_nodes_a = get_num_reachable_nodes(irg));
693 BE_TIMER_POP(t_other);
695 #define LC_EMIT(timer) \
696 if(!be_stat_ev_is_active()) { \
697 printf("%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0); \
699 be_stat_ev_l(lc_timer_get_name(timer), lc_timer_elapsed_msec(timer)); \
701 #define LC_EMIT_RA(timer) \
702 if(!be_stat_ev_is_active()) { \
703 printf("\t%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0); \
705 be_stat_ev_l(lc_timer_get_name(timer), lc_timer_elapsed_msec(timer)); \
708 if(!be_stat_ev_is_active()) {
709 printf("==>> IRG %s <<==\n", get_entity_name(get_irg_entity(irg)));
710 printf("# nodes at begin: %u\n", num_nodes_b);
711 printf("# nodes before ra: %u\n", num_nodes_r);
712 printf("# nodes at end: %u\n\n", num_nodes_a);
719 LC_EMIT_RA(ra_timer->t_prolog);
720 LC_EMIT_RA(ra_timer->t_live);
721 LC_EMIT_RA(ra_timer->t_spill);
722 LC_EMIT_RA(ra_timer->t_spillslots);
723 LC_EMIT_RA(ra_timer->t_color);
724 LC_EMIT_RA(ra_timer->t_ifg);
725 LC_EMIT_RA(ra_timer->t_copymin);
726 LC_EMIT_RA(ra_timer->t_ssa);
727 LC_EMIT_RA(ra_timer->t_epilog);
728 LC_EMIT_RA(ra_timer->t_verify);
729 LC_EMIT_RA(ra_timer->t_other);
740 /* switched off due to statistics (statistic module needs all irgs) */
741 #ifdef FIRM_STATISTICS
742 if (! stat_is_active())
746 if(be_stat_ev_is_active()) {
758 /* Main interface to the frontend. */
759 void be_main(FILE *file_handle, const char *cup_name)
762 lc_timer_t *t = NULL;
764 /* The user specified another config file to read. do that now. */
765 if(strlen(config_file) > 0) {
768 if((f = fopen(config_file, "rt")) != NULL) {
769 lc_opt_from_file(config_file, f, NULL);
774 if (be_options.timing == BE_TIME_ON) {
775 t = lc_timer_register("bemain", "measure complete bemain loop");
777 if (lc_timer_enter_high_priority()) {
778 fprintf(stderr, "Warning: Could not enter high priority mode.\n");
781 lc_timer_reset_and_start(t);
784 #ifdef FIRM_STATISTICS
785 be_init_stat_file(be_options.stat_file_name, cup_name);
787 #endif /* WITH_LIBCORE */
789 /* never build code for pseudo irgs */
790 set_visit_pseudo_irgs(0);
794 be_main_loop(file_handle, cup_name);
797 if (be_options.timing == BE_TIME_ON) {
799 lc_timer_leave_high_priority();
800 if(be_stat_ev_is_active()) {
801 be_stat_ev_l("backend_time", lc_timer_elapsed_msec(t));
803 printf("%-20s: %lu msec\n", "BEMAINLOOP", lc_timer_elapsed_msec(t));
807 #ifdef FIRM_STATISTICS
808 be_close_stat_file();
810 #endif /* WITH_LIBCORE */
813 /** The debug info retriever function. */
814 static retrieve_dbg_func retrieve_dbg = NULL;
816 /* Sets a debug info retriever. */
817 void be_set_debug_retrieve(retrieve_dbg_func func) {
821 /* Retrieve the debug info. */
822 const char *be_retrieve_dbg_info(const dbg_info *dbg, unsigned *line) {
824 return retrieve_dbg(dbg, line);
830 int be_put_ignore_regs(const be_irg_t *birg, const arch_register_class_t *cls, bitset_t *bs)
833 bs = bitset_alloca(cls->n_regs);
835 bitset_clear_all(bs);
837 assert(bitset_size(bs) == (unsigned) cls->n_regs);
838 arch_put_non_ignore_regs(birg->main_env->arch_env, cls, bs);
840 be_abi_put_ignore_regs(birg->abi, cls, bs);
842 return bitset_popcnt(bs);