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"
39 #include "firm/bearch_firm.h"
40 #include "ia32/bearch_ia32.h"
41 #include "arm/bearch_arm.h"
42 #include "ppc32/bearch_ppc32.h"
43 #include "mips/bearch_mips.h"
50 #include "besched_t.h"
51 #include "belistsched.h"
53 #include "bespillbelady.h"
55 #include "beraextern.h"
56 #include "bechordal_t.h"
58 #include "beifg_impl.h"
59 #include "becopyopt.h"
60 #include "becopystat.h"
61 #include "bessadestr.h"
64 #include "beschedmris.h"
67 #include "beprofile.h"
68 #include "beblocksched.h"
69 #include "be_dbgout.h"
72 #include "beilpsched.h"
75 /* options visible for anyone */
76 static be_options_t be_options = {
77 DUMP_NONE, /* dump flags */
78 BE_TIME_OFF, /* no timing */
79 0, /* no opt profile */
80 1, /* try to omit frame pointer */
81 0, /* always stabs debugging output */
82 BE_VRFY_WARN, /* verification level: warn */
83 BE_SCHED_LIST, /* scheduler: list scheduler */
84 "i44pc52.info.uni-karlsruhe.de", /* ilp server */
85 "cplex" /* ilp solver */
89 static char config_file[256] = { 0 };
91 /* register allocator to use. */
92 static const be_ra_t *ra = &be_ra_chordal_allocator;
94 /* back end instruction set architecture to use */
95 static const arch_isa_if_t *isa_if = &ia32_isa_if;
99 static lc_opt_entry_t *be_grp_root = NULL;
101 /* possible dumping options */
102 static const lc_opt_enum_mask_items_t dump_items[] = {
103 { "none", DUMP_NONE },
104 { "initial", DUMP_INITIAL },
106 { "sched", DUMP_SCHED },
107 { "prepared", DUMP_PREPARED },
108 { "regalloc", DUMP_RA },
109 { "final", DUMP_FINAL },
111 { "all", 2 * DUMP_BE - 1 },
115 /* register allocators */
116 static const lc_opt_enum_const_ptr_items_t ra_items[] = {
117 { "chordal", &be_ra_chordal_allocator },
118 { "external", &be_ra_external_allocator },
122 /* instruction set architectures. */
123 static const lc_opt_enum_const_ptr_items_t isa_items[] = {
124 { "ia32", &ia32_isa_if },
126 { "arm", &arm_isa_if },
127 { "ppc32", &ppc32_isa_if },
128 { "mips", &mips_isa_if },
133 /* verify options. */
134 static const lc_opt_enum_int_items_t vrfy_items[] = {
135 { "off", BE_VRFY_OFF },
136 { "warn", BE_VRFY_WARN },
137 { "assert", BE_VRFY_ASSERT },
141 /* scheduling options. */
142 static const lc_opt_enum_int_items_t sched_items[] = {
143 { "list", BE_SCHED_LIST },
145 { "ilp", BE_SCHED_ILP },
146 #endif /* WITH_ILP */
150 static lc_opt_enum_mask_var_t dump_var = {
151 &be_options.dump_flags, dump_items
154 static lc_opt_enum_const_ptr_var_t ra_var = {
155 (const void **) &ra, ra_items
158 static lc_opt_enum_const_ptr_var_t isa_var = {
159 (const void **) &isa_if, isa_items
162 static lc_opt_enum_int_var_t vrfy_var = {
163 &be_options.vrfy_option, vrfy_items
166 static lc_opt_enum_int_var_t sched_var = {
167 &be_options.scheduler, sched_items
170 static const lc_opt_table_entry_t be_main_options[] = {
171 LC_OPT_ENT_STR ("config", "read another config file containing backend options", config_file, sizeof(config_file)),
172 LC_OPT_ENT_ENUM_MASK("dump", "dump irg on several occasions", &dump_var),
173 LC_OPT_ENT_ENUM_PTR ("ra", "register allocator", &ra_var),
174 LC_OPT_ENT_ENUM_PTR ("isa", "the instruction set architecture", &isa_var),
175 LC_OPT_ENT_NEGBOOL ("noomitfp", "do not omit frame pointer", &be_options.omit_fp),
176 LC_OPT_ENT_BOOL ("stabs", "enable stabs debug support", &be_options.stabs_debug_support),
177 LC_OPT_ENT_ENUM_PTR ("vrfy", "verify the backend irg", &vrfy_var),
178 LC_OPT_ENT_BOOL ("time", "get backend timing statistics", &be_options.timing),
179 LC_OPT_ENT_BOOL ("profile", "instrument the code for execution count profiling", &be_options.opt_profile),
180 LC_OPT_ENT_ENUM_PTR ("sched", "select a scheduler", &sched_var),
181 LC_OPT_ENT_STR ("statfile", "append statistics to file statfile", &be_options.stat_file_name, sizeof(be_options.stat_file_name)),
184 LC_OPT_ENT_STR ("ilp.server", "the ilp server name", be_options.ilp_server, sizeof(be_options.ilp_server)),
185 LC_OPT_ENT_STR ("ilp.solver", "the ilp solver name", be_options.ilp_solver, sizeof(be_options.ilp_solver)),
186 #endif /* WITH_ILP */
190 #endif /* WITH_LIBCORE */
192 void be_opt_register(void)
196 lc_opt_entry_t *be_grp_ra;
197 static int run_once = 0;
201 be_grp_root = lc_opt_get_grp(firm_opt_get_root(), "be");
202 be_grp_ra = lc_opt_get_grp(be_grp_root, "ra");
204 lc_opt_add_table(be_grp_root, be_main_options);
206 /* register allocator options */
207 for(i = 0; ra_items[i].name != NULL; ++i) {
208 const be_ra_t *ra = ra_items[i].value;
209 ra->register_options(be_grp_ra);
212 /* register isa options */
213 for(i = 0; isa_items[i].name != NULL; ++i) {
214 const arch_isa_if_t *isa = isa_items[i].value;
215 isa->register_options(be_grp_root);
218 /* scheduler register options */
219 list_sched_register_options(be_grp_root);
221 be_block_schedule_register_options(be_grp_root);
223 #endif /* WITH_LIBCORE */
226 /* Parse one argument. */
227 int be_parse_arg(const char *arg) {
229 if (strcmp(arg, "help") == 0 || (arg[0] == '?' && arg[1] == '\0')) {
230 lc_opt_print_help(be_grp_root, stdout);
233 return lc_opt_from_single_arg(be_grp_root, NULL, arg, NULL);
236 #endif /* WITH_LIBCORE */
239 /** The be parameters returned by default, all off. */
240 const static backend_params be_params = {
247 /* Perform schedule verification if requested. */
248 static void be_sched_vrfy(ir_graph *irg, int vrfy_opt) {
249 if (vrfy_opt == BE_VRFY_WARN) {
250 be_verify_schedule(irg);
252 else if (vrfy_opt == BE_VRFY_ASSERT) {
253 assert(be_verify_schedule(irg) && "Schedule verification failed.");
257 /* Initialize the Firm backend. Must be run BEFORE init_firm()! */
258 const backend_params *be_init(void)
268 if (isa_if->get_params)
269 return isa_if->get_params();
274 * Initializes the main environment for the backend.
276 * @param env an empty environment
277 * @param file_handle the file handle where the output will be written to
279 static be_main_env_t *be_init_env(be_main_env_t *env, FILE *file_handle)
281 memset(env, 0, sizeof(*env));
282 obstack_init(&env->obst);
283 env->arch_env = obstack_alloc(&env->obst, sizeof(env->arch_env[0]));
284 env->options = &be_options;
285 FIRM_DBG_REGISTER(env->dbg, "be.main");
287 arch_env_init(env->arch_env, isa_if, file_handle, env);
289 /* Register the irn handler of the architecture */
290 if (arch_isa_get_irn_handler(env->arch_env->isa))
291 arch_env_push_irn_handler(env->arch_env, arch_isa_get_irn_handler(env->arch_env->isa));
294 * Register the node handler of the back end infrastructure.
295 * This irn handler takes care of the platform independent
296 * spill, reload and perm nodes.
298 arch_env_push_irn_handler(env->arch_env, &be_node_irn_handler);
299 env->phi_handler = be_phi_handler_new(env->arch_env);
300 arch_env_push_irn_handler(env->arch_env, env->phi_handler);
302 env->db_handle = be_options.stabs_debug_support ? be_stabs_open(file_handle) : be_nulldbg_open();
306 static void be_done_env(be_main_env_t *env)
308 env->arch_env->isa->impl->done(env->arch_env->isa);
309 be_dbg_close(env->db_handle);
310 be_phi_handler_free(env->phi_handler);
311 obstack_free(&env->obst, NULL);
315 * A wrapper around a firm dumper. Dumps only, if
318 * @param mask a bitmask containing the reason what will be dumped
319 * @param irg the IR graph to dump
320 * @param suffix the suffix for the dumper
321 * @param dumper the dumper to be called
323 static void dump(int mask, ir_graph *irg, const char *suffix,
324 void (*dumper)(ir_graph *, const char *))
326 if(be_options.dump_flags & mask)
327 be_dump(irg, suffix, dumper);
331 * Prepare a backend graph for code generation and initialize its birg
333 static void initialize_birg(be_irg_t *birg, ir_graph *irg, be_main_env_t *env)
335 memset(birg, 0, sizeof(*birg));
337 birg->main_env = env;
339 edges_deactivate_kind(irg, EDGE_KIND_DEP);
340 edges_activate_kind(irg, EDGE_KIND_DEP);
342 DBG((env->dbg, LEVEL_2, "====> IRG: %F\n", irg));
343 dump(DUMP_INITIAL, irg, "-begin", dump_ir_block_graph);
345 be_stat_init_irg(env->arch_env, irg);
346 be_do_stat_nodes(irg, "01 Begin");
348 /* set the current graph (this is important for several firm functions) */
349 current_ir_graph = irg;
351 /* Normalize proj nodes. */
352 normalize_proj_nodes(irg);
354 /* Make just one return node. */
355 normalize_one_return(irg);
357 /* Remove critical edges */
358 remove_critical_cf_edges(irg);
360 /* Compute the dominance information. */
364 /* Ensure, that the ir_edges are computed. */
367 /* check, if the dominance property is fulfilled. */
368 be_check_dominance(irg);
370 /* reset the phi handler. */
371 be_phi_handler_reset(env->phi_handler);
376 #define BE_TIMER_PUSH(timer) \
377 if (be_options.timing == BE_TIME_ON) { \
378 int res = lc_timer_push(timer); \
379 if (be_options.vrfy_option == BE_VRFY_ASSERT) \
380 assert(res && "Timer already on stack, cannot be pushed twice."); \
381 else if (be_options.vrfy_option == BE_VRFY_WARN && ! res) \
382 fprintf(stderr, "Timer %s already on stack, cannot be pushed twice.\n", \
383 lc_timer_get_name(timer)); \
385 #define BE_TIMER_POP(timer) \
386 if (be_options.timing == BE_TIME_ON) { \
387 lc_timer_t *tmp = lc_timer_pop(); \
388 if (be_options.vrfy_option == BE_VRFY_ASSERT) \
389 assert(tmp == timer && "Attempt to pop wrong timer."); \
390 else if (be_options.vrfy_option == BE_VRFY_WARN && tmp != timer) \
391 fprintf(stderr, "Attempt to pop wrong timer. %s is on stack, trying to pop %s.\n", \
392 lc_timer_get_name(tmp), lc_timer_get_name(timer)); \
396 #define BE_TIMER_ONLY(code) do { if (be_options.timing == BE_TIME_ON) { code; } } while(0)
400 #define BE_TIMER_PUSH(timer)
401 #define BE_TIMER_POP(timer)
402 #define BE_TIMER_ONLY(code)
404 #endif /* WITH_LIBCORE */
408 * The Firm backend main loop.
409 * Do architecture specific lowering for all graphs
410 * and call the architecture specific code generator.
412 * @param file_handle the file handle the output will be written to
413 * @param cup_name name of the compilation unit
415 static void be_main_loop(FILE *file_handle, const char *cup_name)
420 unsigned num_nodes_b = 0;
421 unsigned num_nodes_a = 0;
422 unsigned num_nodes_r = 0;
423 char prof_filename[256];
424 static const char suffix[] = ".prof";
428 be_ra_timer_t *ra_timer;
431 lc_timer_t *t_abi = NULL;
432 lc_timer_t *t_codegen = NULL;
433 lc_timer_t *t_sched = NULL;
434 lc_timer_t *t_constr = NULL;
435 lc_timer_t *t_regalloc = NULL;
436 lc_timer_t *t_finish = NULL;
437 lc_timer_t *t_emit = NULL;
438 lc_timer_t *t_other = NULL;
439 lc_timer_t *t_verify = NULL;
441 if (be_options.timing == BE_TIME_ON) {
442 t_abi = lc_timer_register("beabi", "be abi introduction");
443 t_codegen = lc_timer_register("codegen", "codegeneration");
444 t_sched = lc_timer_register("sched", "scheduling");
445 t_constr = lc_timer_register("constr", "assure constraints");
446 t_regalloc = lc_timer_register("regalloc", "register allocation");
447 t_finish = lc_timer_register("finish", "graph finish");
448 t_emit = lc_timer_register("emiter", "code emiter");
449 t_verify = lc_timer_register("verify", "graph verification");
450 t_other = lc_timer_register("other", "other");
452 #endif /* WITH_LIBCORE */
454 be_init_env(&env, file_handle);
456 isa = arch_env_get_isa(env.arch_env);
458 be_dbg_so(env.db_handle, cup_name);
459 be_dbg_types(env.db_handle);
461 /* we might need 1 birg more for instrumentation constructor */
462 num_birgs = get_irp_n_irgs();
463 birgs = alloca(sizeof(birgs[0]) * (num_birgs + 1));
465 /* First: initialize all birgs */
466 for(i = 0; i < get_irp_n_irgs(); ++i) {
467 ir_graph *irg = get_irp_irg(i);
469 initialize_birg(&birgs[i], irg, &env);
473 Get the filename for the profiling data.
474 Beware: '\0' is already included in sizeof(suffix)
476 memset(prof_filename, 0, sizeof(prof_filename));
477 strncpy(prof_filename, cup_name, sizeof(prof_filename) - sizeof(suffix));
478 strcat(prof_filename, suffix);
481 Next: Either instruments all irgs with profiling code
482 or try to read in profile data for current translation unit.
484 if (be_options.opt_profile) {
485 ir_graph *prof_init_irg = be_profile_instrument(prof_filename, profile_default);
486 initialize_birg(&birgs[num_birgs], prof_init_irg, &env);
488 set_method_img_section(get_irg_entity(prof_init_irg), section_constructors);
491 be_profile_read(prof_filename);
495 for (i = 0; i < num_birgs; ++i) {
496 be_irg_t *birg = & birgs[i];
497 ir_graph *irg = birg->irg;
498 optimization_state_t state;
499 const arch_code_generator_if_t *cg_if;
501 /* set the current graph (this is important for several firm functions) */
502 current_ir_graph = irg;
504 be_init_stat_file(be_options.stat_file_name, irg);
506 /* stop and reset timers */
508 LC_STOP_AND_RESET_TIMER(t_abi);
509 LC_STOP_AND_RESET_TIMER(t_codegen);
510 LC_STOP_AND_RESET_TIMER(t_sched);
511 LC_STOP_AND_RESET_TIMER(t_constr);
512 LC_STOP_AND_RESET_TIMER(t_regalloc);
513 LC_STOP_AND_RESET_TIMER(t_finish);
514 LC_STOP_AND_RESET_TIMER(t_emit);
515 LC_STOP_AND_RESET_TIMER(t_verify);
516 LC_STOP_AND_RESET_TIMER(t_other);
518 BE_TIMER_PUSH(t_other); /* t_other */
521 * Create execution frequencies from profile data or estimate some
523 if (be_profile_has_data()) {
524 birg->execfreqs = be_create_execfreqs_from_profile(irg);
526 birg->execfreqs = compute_execfreq(irg, 10);
529 BE_TIMER_ONLY(num_nodes_b = get_num_reachable_nodes(irg));
531 /* Get the code generator interface. */
532 cg_if = isa->impl->get_code_generator_if(isa);
534 /* get a code generator for this graph. */
535 birg->cg = cg_if->init(birg);
537 /* some transformations need to be done before abi introduce */
538 arch_code_generator_before_abi(birg->cg);
540 /* reset the phi handler. */
541 be_phi_handler_reset(env.phi_handler);
543 /* implement the ABI conventions. */
544 BE_TIMER_PUSH(t_abi);
545 birg->abi = be_abi_introduce(birg);
548 dump(DUMP_ABI, irg, "-abi", dump_ir_block_graph);
549 be_do_stat_nodes(irg, "02 Abi");
552 BE_TIMER_PUSH(t_codegen);
553 arch_code_generator_prepare_graph(birg->cg);
554 BE_TIMER_POP(t_codegen);
556 be_do_stat_nodes(irg, "03 Prepare");
559 Since the code generator made a lot of new nodes and skipped
560 a lot of old ones, we should do dead node elimination here.
561 Note that this requires disabling the edges here.
563 edges_deactivate(irg);
564 //dead_node_elimination(irg);
567 /* Compute loop nesting information (for weighting copies) */
568 construct_cf_backedges(irg);
569 dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph);
570 BE_TIMER_ONLY(num_nodes_r = get_num_reachable_nodes(irg));
572 /* let backend prepare scheduling */
573 BE_TIMER_PUSH(t_codegen);
574 arch_code_generator_before_sched(birg->cg);
575 BE_TIMER_POP(t_codegen);
577 /* schedule the irg */
578 BE_TIMER_PUSH(t_sched);
579 switch (be_options.scheduler) {
581 fprintf(stderr, "Warning: invalid scheduler (%d) selected, falling back to list scheduler.\n", be_options.scheduler);
583 list_sched(birg, &be_options);
588 fprintf(stderr, "Warning: ILP scheduler not yet fully implemented, falling back to list scheduler.\n");
589 list_sched(birg, &be_options);
591 #endif /* WITH_ILP */
593 BE_TIMER_POP(t_sched);
595 dump(DUMP_SCHED, irg, "-sched", dump_ir_block_graph_sched);
598 BE_TIMER_PUSH(t_verify);
599 be_sched_vrfy(irg, be_options.vrfy_option);
600 BE_TIMER_POP(t_verify);
602 be_do_stat_nodes(irg, "04 Schedule");
604 /* introduce patterns to assure constraints */
605 BE_TIMER_PUSH(t_constr);
606 /* we switch off optimizations here, because they might cause trouble */
607 save_optimization_state(&state);
609 set_opt_normalize(0);
611 /* add Keeps for should_be_different constrained nodes */
612 /* beware: needs schedule due to usage of be_ssa_constr */
613 assure_constraints(birg);
614 BE_TIMER_POP(t_constr);
616 dump(DUMP_SCHED, irg, "-assured", dump_ir_block_graph_sched);
617 be_do_stat_nodes(irg, "05 Constraints");
619 /* connect all stack modifying nodes together (see beabi.c) */
620 BE_TIMER_PUSH(t_abi);
621 be_abi_fix_stack_nodes(birg->abi, NULL);
624 dump(DUMP_SCHED, irg, "-fix_stack", dump_ir_block_graph_sched);
627 BE_TIMER_PUSH(t_verify);
628 be_sched_vrfy(irg, be_options.vrfy_option);
629 BE_TIMER_POP(t_verify);
631 /* do some statistics */
632 be_do_stat_reg_pressure(birg);
634 /* stuff needs to be done after scheduling but before register allocation */
635 BE_TIMER_PUSH(t_codegen);
636 arch_code_generator_before_ra(birg->cg);
637 BE_TIMER_POP(t_codegen);
639 /* Do register allocation */
640 BE_TIMER_PUSH(t_regalloc);
641 ra_timer = ra->allocate(birg);
642 BE_TIMER_POP(t_regalloc);
644 dump(DUMP_RA, irg, "-ra", dump_ir_block_graph_sched);
645 be_do_stat_nodes(irg, "06 Register Allocation");
647 /* let the code generator prepare the graph for emitter */
648 BE_TIMER_PUSH(t_finish);
649 arch_code_generator_after_ra(birg->cg);
650 BE_TIMER_POP(t_finish);
652 /* fix stack offsets */
653 BE_TIMER_PUSH(t_abi);
654 be_abi_fix_stack_nodes(birg->abi, NULL);
655 be_remove_dead_nodes_from_schedule(irg);
656 be_abi_fix_stack_bias(birg->abi);
659 BE_TIMER_PUSH(t_finish);
660 arch_code_generator_finish(birg->cg);
661 BE_TIMER_POP(t_finish);
663 dump(DUMP_FINAL, irg, "-finish", dump_ir_block_graph_sched);
665 /* check schedule and register allocation */
666 BE_TIMER_PUSH(t_verify);
667 if (be_options.vrfy_option == BE_VRFY_WARN) {
668 //irg_verify(irg, VRFY_ENFORCE_SSA);
669 be_check_dominance(irg);
670 be_verify_out_edges(irg);
671 be_verify_schedule(irg);
672 be_verify_register_allocation(env.arch_env, irg);
674 else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
675 //assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
676 assert(be_verify_out_edges(irg));
677 assert(be_check_dominance(irg) && "Dominance verification failed");
678 assert(be_verify_schedule(irg) && "Schedule verification failed");
679 assert(be_verify_register_allocation(env.arch_env, irg)
680 && "register allocation verification failed");
682 BE_TIMER_POP(t_verify);
684 /* emit assembler code */
685 BE_TIMER_PUSH(t_emit);
686 arch_code_generator_done(birg->cg);
687 BE_TIMER_POP(t_emit);
689 dump(DUMP_FINAL, irg, "-end", dump_ir_extblock_graph_sched);
691 BE_TIMER_PUSH(t_abi);
692 be_abi_free(birg->abi);
695 be_do_stat_nodes(irg, "07 Final");
696 restore_optimization_state(&state);
698 BE_TIMER_ONLY(num_nodes_a = get_num_reachable_nodes(irg));
699 BE_TIMER_POP(t_other);
701 #define LC_EMIT(timer) \
702 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 printf("\t%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0); \
707 be_stat_ev_l(lc_timer_get_name(timer), lc_timer_elapsed_msec(timer));
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);
718 LC_EMIT_RA(ra_timer->t_prolog);
719 LC_EMIT_RA(ra_timer->t_live);
720 LC_EMIT_RA(ra_timer->t_spill);
721 LC_EMIT_RA(ra_timer->t_spillslots);
722 LC_EMIT_RA(ra_timer->t_color);
723 LC_EMIT_RA(ra_timer->t_ifg);
724 LC_EMIT_RA(ra_timer->t_copymin);
725 LC_EMIT_RA(ra_timer->t_ssa);
726 LC_EMIT_RA(ra_timer->t_epilog);
727 LC_EMIT_RA(ra_timer->t_verify);
728 LC_EMIT_RA(ra_timer->t_other);
737 free_execfreq(birg->execfreqs);
739 /* switched off due to statistics (statistic module needs all irgs) */
740 if (! stat_is_active())
743 be_close_stat_file();
753 /* Main interface to the frontend. */
754 void be_main(FILE *file_handle, const char *cup_name)
757 lc_timer_t *t = NULL;
759 /* The user specified another config file to read. do that now. */
760 if(strlen(config_file) > 0) {
763 if((f = fopen(config_file, "rt")) != NULL) {
764 lc_opt_from_file(config_file, f, NULL);
769 if (be_options.timing == BE_TIME_ON) {
770 t = lc_timer_register("bemain", "measure complete bemain loop");
772 if (lc_timer_enter_high_priority()) {
773 fprintf(stderr, "Warning: Could not enter high priority mode.\n");
776 lc_timer_reset_and_start(t);
778 #endif /* WITH_LIBCORE */
780 /* never build code for pseudo irgs */
781 set_visit_pseudo_irgs(0);
784 be_main_loop(file_handle, cup_name);
787 if (be_options.timing == BE_TIME_ON) {
789 lc_timer_leave_high_priority();
790 printf("%-20s: %lu msec\n", "BEMAINLOOP", lc_timer_elapsed_msec(t));
792 #endif /* WITH_LIBCORE */
795 /** The debug info retriever function. */
796 static retrieve_dbg_func retrieve_dbg = NULL;
798 /* Sets a debug info retriever. */
799 void be_set_debug_retrieve(retrieve_dbg_func func) {
803 /* Retrieve the debug info. */
804 const char *be_retrieve_dbg_info(const dbg_info *dbg, unsigned *line) {
806 return retrieve_dbg(dbg, line);
812 int be_put_ignore_regs(const be_irg_t *birg, const arch_register_class_t *cls, bitset_t *bs)
815 bs = bitset_alloca(cls->n_regs);
817 bitset_clear_all(bs);
819 assert(bitset_size(bs) == (unsigned) cls->n_regs);
820 arch_put_non_ignore_regs(birg->main_env->arch_env, cls, bs);
822 be_abi_put_ignore_regs(birg->abi, cls, bs);
824 return bitset_popcnt(bs);