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 "be_dbgout.h"
70 /* options visible for anyone */
71 static be_options_t be_options = {
72 DUMP_NONE, /* dump flags */
73 BE_TIME_OFF, /* no timing */
74 BE_SCHED_SELECT_HEUR, /* mueller heuristic selector */
75 0, /* no opt profile */
77 1, /* try to omit frame pointer */
78 1, /* always stabs debugging output */
79 BE_VRFY_WARN, /* verification level: warn */
80 "i44pc52.info.uni-karlsruhe.de", /* ilp server */
81 "cplex" /* ilp solver */
85 static char config_file[256] = { 0 };
87 /* register allocator to use. */
88 static const be_ra_t *ra = &be_ra_chordal_allocator;
90 /* back end instruction set architecture to use */
91 static const arch_isa_if_t *isa_if = &ia32_isa_if;
95 static lc_opt_entry_t *be_grp_root = NULL;
97 /* possible dumping options */
98 static const lc_opt_enum_mask_items_t dump_items[] = {
99 { "none", DUMP_NONE },
100 { "initial", DUMP_INITIAL },
102 { "sched", DUMP_SCHED },
103 { "prepared", DUMP_PREPARED },
104 { "regalloc", DUMP_RA },
105 { "final", DUMP_FINAL },
107 { "all", 2 * DUMP_BE - 1 },
111 /* register allocators */
112 static const lc_opt_enum_const_ptr_items_t ra_items[] = {
113 { "chordal", &be_ra_chordal_allocator },
114 { "external", &be_ra_external_allocator },
118 /* instruction set architectures. */
119 static const lc_opt_enum_const_ptr_items_t isa_items[] = {
120 { "ia32", &ia32_isa_if },
122 { "arm", &arm_isa_if },
123 { "ppc32", &ppc32_isa_if },
124 { "mips", &mips_isa_if },
129 /* verify options. */
130 static const lc_opt_enum_int_items_t vrfy_items[] = {
131 { "off", BE_VRFY_OFF },
132 { "warn", BE_VRFY_WARN },
133 { "assert", BE_VRFY_ASSERT },
137 /* schedule selector options. */
138 static const lc_opt_enum_int_items_t sched_select_items[] = {
139 { "trivial", BE_SCHED_SELECT_TRIVIAL },
140 { "random", BE_SCHED_SELECT_RANDOM },
141 { "regpress", BE_SCHED_SELECT_REGPRESS },
142 { "muchnik", BE_SCHED_SELECT_MUCHNIK },
143 { "heur", BE_SCHED_SELECT_HEUR },
144 { "hmuchnik", BE_SCHED_SELECT_HMUCHNIK },
148 static lc_opt_enum_mask_var_t dump_var = {
149 &be_options.dump_flags, dump_items
152 static lc_opt_enum_const_ptr_var_t ra_var = {
153 (const void **) &ra, ra_items
156 static lc_opt_enum_const_ptr_var_t isa_var = {
157 (const void **) &isa_if, isa_items
160 static lc_opt_enum_int_var_t vrfy_var = {
161 &be_options.vrfy_option, vrfy_items
164 static lc_opt_enum_int_var_t sched_select_var = {
165 &be_options.sched_select, sched_select_items
168 static const lc_opt_table_entry_t be_main_options[] = {
169 LC_OPT_ENT_STR ("config", "read another config file containing backend options", config_file, sizeof(config_file)),
170 LC_OPT_ENT_ENUM_MASK("dump", "dump irg on several occasions", &dump_var),
171 LC_OPT_ENT_ENUM_PTR ("ra", "register allocator", &ra_var),
172 LC_OPT_ENT_ENUM_PTR ("isa", "the instruction set architecture", &isa_var),
173 LC_OPT_ENT_NEGBOOL ("noomitfp", "do not omit frame pointer", &be_options.omit_fp),
174 LC_OPT_ENT_BOOL ("stabs", "enable stabs debug support", &be_options.stabs_debug_support),
175 LC_OPT_ENT_ENUM_PTR ("vrfy", "verify the backend irg (off, warn, assert)", &vrfy_var),
176 LC_OPT_ENT_BOOL ("time", "get backend timing statistics", &be_options.timing),
177 LC_OPT_ENT_BOOL ("profile", "instrument the code for execution count profiling", &be_options.opt_profile),
178 LC_OPT_ENT_BOOL ("sched.mris", "enable mris schedule preparation", &be_options.mris),
179 LC_OPT_ENT_ENUM_PTR ("sched.select", "schedule node selector (trivial, regpress, muchnik, heur, hmuchnik)", &sched_select_var),
182 LC_OPT_ENT_STR ("ilp.server", "the ilp server name", be_options.ilp_server, sizeof(be_options.ilp_server)),
183 LC_OPT_ENT_STR ("ilp.solver", "the ilp solver name", be_options.ilp_solver, sizeof(be_options.ilp_solver)),
184 #endif /* WITH_ILP */
188 #endif /* WITH_LIBCORE */
190 void be_opt_register(void)
194 lc_opt_entry_t *be_grp_ra;
195 static int run_once = 0;
199 be_grp_root = lc_opt_get_grp(firm_opt_get_root(), "be");
200 be_grp_ra = lc_opt_get_grp(be_grp_root, "ra");
202 lc_opt_add_table(be_grp_root, be_main_options);
204 /* register allocator options */
205 for(i = 0; ra_items[i].name != NULL; ++i) {
206 const be_ra_t *ra = ra_items[i].value;
207 ra->register_options(be_grp_ra);
210 /* register isa options */
211 for(i = 0; isa_items[i].name != NULL; ++i) {
212 const arch_isa_if_t *isa = isa_items[i].value;
213 isa->register_options(be_grp_root);
216 #endif /* WITH_LIBCORE */
219 /* Parse one argument. */
220 int be_parse_arg(const char *arg) {
222 if (strcmp(arg, "help") == 0 || (arg[0] == '?' && arg[1] == '\0')) {
223 lc_opt_print_help(be_grp_root, stdout);
226 return lc_opt_from_single_arg(be_grp_root, NULL, arg, NULL);
229 #endif /* WITH_LIBCORE */
232 /** The be parameters returned by default, all off. */
233 const static backend_params be_params = {
240 /* Perform schedule verification if requested. */
241 static void be_sched_vrfy(ir_graph *irg, int vrfy_opt) {
242 if (vrfy_opt == BE_VRFY_WARN) {
243 be_verify_schedule(irg);
245 else if (vrfy_opt == BE_VRFY_ASSERT) {
246 assert(be_verify_schedule(irg) && "Schedule verification failed.");
250 /* Initialize the Firm backend. Must be run BEFORE init_firm()! */
251 const backend_params *be_init(void)
261 if (isa_if->get_params)
262 return isa_if->get_params();
267 * Initializes the main environment for the backend.
269 * @param env an empty environment
270 * @param file_handle the file handle where the output will be written to
272 static be_main_env_t *be_init_env(be_main_env_t *env, FILE *file_handle)
274 memset(env, 0, sizeof(*env));
275 obstack_init(&env->obst);
276 env->arch_env = obstack_alloc(&env->obst, sizeof(env->arch_env[0]));
277 env->options = &be_options;
278 FIRM_DBG_REGISTER(env->dbg, "be.main");
280 arch_env_init(env->arch_env, isa_if, file_handle, env);
282 /* Register the irn handler of the architecture */
283 if (arch_isa_get_irn_handler(env->arch_env->isa))
284 arch_env_push_irn_handler(env->arch_env, arch_isa_get_irn_handler(env->arch_env->isa));
287 * Register the node handler of the back end infrastructure.
288 * This irn handler takes care of the platform independent
289 * spill, reload and perm nodes.
291 arch_env_push_irn_handler(env->arch_env, &be_node_irn_handler);
292 env->phi_handler = be_phi_handler_new(env->arch_env);
293 arch_env_push_irn_handler(env->arch_env, env->phi_handler);
295 env->db_handle = be_options.stabs_debug_support ? be_stabs_open(file_handle) : be_nulldbg_open();
299 static void be_done_env(be_main_env_t *env)
301 env->arch_env->isa->impl->done(env->arch_env->isa);
302 be_dbg_close(env->db_handle);
303 be_phi_handler_free(env->phi_handler);
304 obstack_free(&env->obst, NULL);
308 * A wrapper around a firm dumper. Dumps only, if
311 * @param mask a bitmask containing the reason what will be dumped
312 * @param irg the IR graph to dump
313 * @param suffix the suffix for the dumper
314 * @param dumper the dumper to be called
316 static void dump(int mask, ir_graph *irg, const char *suffix,
317 void (*dumper)(ir_graph *, const char *))
319 if(be_options.dump_flags & mask)
320 be_dump(irg, suffix, dumper);
324 * Prepare a backend graph for code generation and initialize its birg
326 static void initialize_birg(be_irg_t *birg, ir_graph *irg, be_main_env_t *env)
328 memset(birg, 0, sizeof(*birg));
330 birg->main_env = env;
332 edges_deactivate_kind(irg, EDGE_KIND_DEP);
333 edges_activate_kind(irg, EDGE_KIND_DEP);
335 DBG((env->dbg, LEVEL_2, "====> IRG: %F\n", irg));
336 dump(DUMP_INITIAL, irg, "-begin", dump_ir_block_graph);
338 be_stat_init_irg(env->arch_env, irg);
339 be_do_stat_nodes(irg, "01 Begin");
341 /* set the current graph (this is important for several firm functions) */
342 current_ir_graph = irg;
344 /* Normalize proj nodes. */
345 normalize_proj_nodes(irg);
347 /* Make just one return node. */
348 normalize_one_return(irg);
350 /* Remove critical edges */
351 remove_critical_cf_edges(irg);
353 /* Compute the dominance information. */
357 /* Ensure, that the ir_edges are computed. */
360 /* check, if the dominance property is fulfilled. */
361 be_check_dominance(irg);
363 /* reset the phi handler. */
364 be_phi_handler_reset(env->phi_handler);
369 #define BE_TIMER_PUSH(timer) \
370 if (be_options.timing == BE_TIME_ON) { \
371 int res = lc_timer_push(timer); \
372 if (be_options.vrfy_option == BE_VRFY_ASSERT) \
373 assert(res && "Timer already on stack, cannot be pushed twice."); \
374 else if (be_options.vrfy_option == BE_VRFY_WARN && ! res) \
375 fprintf(stderr, "Timer %s already on stack, cannot be pushed twice.\n", \
376 lc_timer_get_name(timer)); \
378 #define BE_TIMER_POP(timer) \
379 if (be_options.timing == BE_TIME_ON) { \
380 lc_timer_t *tmp = lc_timer_pop(); \
381 if (be_options.vrfy_option == BE_VRFY_ASSERT) \
382 assert(tmp == timer && "Attempt to pop wrong timer."); \
383 else if (be_options.vrfy_option == BE_VRFY_WARN && tmp != timer) \
384 fprintf(stderr, "Attempt to pop wrong timer. %s is on stack, trying to pop %s.\n", \
385 lc_timer_get_name(tmp), lc_timer_get_name(timer)); \
389 #define BE_TIMER_ONLY(code) do { if (be_options.timing == BE_TIME_ON) { code; } } while(0)
393 #define BE_TIMER_PUSH(timer)
394 #define BE_TIMER_POP(timer)
395 #define BE_TIMER_ONLY(code)
397 #endif /* WITH_LIBCORE */
401 * The Firm backend main loop.
402 * Do architecture specific lowering for all graphs
403 * and call the architecture specific code generator.
405 * @param file_handle the file handle the output will be written to
406 * @param cup_name name of the compilation unit
408 static void be_main_loop(FILE *file_handle, const char *cup_name)
413 unsigned num_nodes_b = 0;
414 unsigned num_nodes_a = 0;
415 unsigned num_nodes_r = 0;
416 char prof_filename[256];
417 static const char suffix[] = ".prof";
421 be_ra_timer_t *ra_timer;
424 lc_timer_t *t_abi = NULL;
425 lc_timer_t *t_codegen = NULL;
426 lc_timer_t *t_sched = NULL;
427 lc_timer_t *t_constr = NULL;
428 lc_timer_t *t_regalloc = NULL;
429 lc_timer_t *t_finish = NULL;
430 lc_timer_t *t_emit = NULL;
431 lc_timer_t *t_other = NULL;
432 lc_timer_t *t_verify = NULL;
434 if (be_options.timing == BE_TIME_ON) {
435 t_abi = lc_timer_register("beabi", "be abi introduction");
436 t_codegen = lc_timer_register("codegen", "codegeneration");
437 t_sched = lc_timer_register("sched", "scheduling");
438 t_constr = lc_timer_register("constr", "assure constraints");
439 t_regalloc = lc_timer_register("regalloc", "register allocation");
440 t_finish = lc_timer_register("finish", "graph finish");
441 t_emit = lc_timer_register("emiter", "code emiter");
442 t_verify = lc_timer_register("verify", "graph verification");
443 t_other = lc_timer_register("other", "other");
445 #endif /* WITH_LIBCORE */
447 be_init_env(&env, file_handle);
449 isa = arch_env_get_isa(env.arch_env);
451 be_dbg_so(env.db_handle, cup_name);
452 be_dbg_types(env.db_handle);
454 /* we might need 1 birg more for instrumentation constructor */
455 num_birgs = get_irp_n_irgs();
456 birgs = alloca(sizeof(birgs[0]) * (num_birgs + 1));
458 /* First: initialize all birgs */
459 for(i = 0; i < get_irp_n_irgs(); ++i) {
460 ir_graph *irg = get_irp_irg(i);
462 initialize_birg(&birgs[i], irg, &env);
466 Get the filename for the profiling data.
467 Beware: '\0' is already included in sizeof(suffix)
469 memset(prof_filename, 0, sizeof(prof_filename));
470 strncpy(prof_filename, cup_name, sizeof(prof_filename) - sizeof(suffix));
471 strcat(prof_filename, suffix);
474 Next: Either instruments all irgs with profiling code
475 or try to read in profile data for current translation unit.
477 if (be_options.opt_profile) {
478 ir_graph *prof_init_irg = be_profile_instrument(prof_filename, profile_default);
479 initialize_birg(&birgs[num_birgs], prof_init_irg, &env);
481 set_method_img_section(get_irg_entity(prof_init_irg), section_constructors);
484 be_profile_read(prof_filename);
488 for (i = 0; i < num_birgs; ++i) {
489 be_irg_t *birg = & birgs[i];
490 ir_graph *irg = birg->irg;
491 optimization_state_t state;
492 const arch_code_generator_if_t *cg_if;
494 /* stop and reset timers */
496 LC_STOP_AND_RESET_TIMER(t_abi);
497 LC_STOP_AND_RESET_TIMER(t_codegen);
498 LC_STOP_AND_RESET_TIMER(t_sched);
499 LC_STOP_AND_RESET_TIMER(t_constr);
500 LC_STOP_AND_RESET_TIMER(t_regalloc);
501 LC_STOP_AND_RESET_TIMER(t_finish);
502 LC_STOP_AND_RESET_TIMER(t_emit);
503 LC_STOP_AND_RESET_TIMER(t_verify);
504 LC_STOP_AND_RESET_TIMER(t_other);
506 BE_TIMER_PUSH(t_other); /* t_other */
509 * Create execution frequencies from profile data or estimate some
511 if(be_profile_has_data()) {
512 birg->execfreqs = be_create_execfreqs_from_profile(irg);
514 birg->execfreqs = compute_execfreq(irg, 10);
517 BE_TIMER_ONLY(num_nodes_b = get_num_reachable_nodes(irg));
519 /* Get the code generator interface. */
520 cg_if = isa->impl->get_code_generator_if(isa);
522 /* get a code generator for this graph. */
523 birg->cg = cg_if->init(birg);
525 /* some transformations need to be done before abi introduce */
526 arch_code_generator_before_abi(birg->cg);
528 /* set the current graph (this is important for several firm functions) */
529 current_ir_graph = irg;
531 /* reset the phi handler. */
532 be_phi_handler_reset(env.phi_handler);
534 /* implement the ABI conventions. */
535 BE_TIMER_PUSH(t_abi);
536 birg->abi = be_abi_introduce(birg);
539 dump(DUMP_ABI, irg, "-abi", dump_ir_block_graph);
540 be_do_stat_nodes(irg, "02 Abi");
543 BE_TIMER_PUSH(t_codegen);
544 arch_code_generator_prepare_graph(birg->cg);
545 BE_TIMER_POP(t_codegen);
547 be_do_stat_nodes(irg, "03 Prepare");
550 Since the code generator made a lot of new nodes and skipped
551 a lot of old ones, we should do dead node elimination here.
552 Note that this requires disabling the edges here.
554 edges_deactivate(irg);
555 //dead_node_elimination(irg);
558 /* Compute loop nesting information (for weighting copies) */
559 construct_cf_backedges(irg);
560 dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph);
561 BE_TIMER_ONLY(num_nodes_r = get_num_reachable_nodes(irg));
563 /* let backend prepare scheduling */
564 BE_TIMER_PUSH(t_codegen);
565 arch_code_generator_before_sched(birg->cg);
566 BE_TIMER_POP(t_codegen);
568 /* schedule the irg */
569 BE_TIMER_PUSH(t_sched);
570 list_sched(birg, &be_options);
571 BE_TIMER_POP(t_sched);
573 dump(DUMP_SCHED, irg, "-sched", dump_ir_block_graph_sched);
576 BE_TIMER_PUSH(t_verify);
577 be_sched_vrfy(irg, be_options.vrfy_option);
578 BE_TIMER_POP(t_verify);
580 be_do_stat_nodes(irg, "04 Schedule");
582 /* introduce patterns to assure constraints */
583 BE_TIMER_PUSH(t_constr);
584 /* we switch off optimizations here, because they might cause trouble */
585 save_optimization_state(&state);
587 set_opt_normalize(0);
589 /* add Keeps for should_be_different constrained nodes */
590 /* beware: needs schedule due to usage of be_ssa_constr */
591 assure_constraints(birg);
592 BE_TIMER_POP(t_constr);
594 dump(DUMP_SCHED, irg, "-assured", dump_ir_block_graph_sched);
595 be_do_stat_nodes(irg, "05 Constraints");
597 /* connect all stack modifying nodes together (see beabi.c) */
598 BE_TIMER_PUSH(t_abi);
599 be_abi_fix_stack_nodes(birg->abi, NULL);
602 dump(DUMP_SCHED, irg, "-fix_stack", dump_ir_block_graph_sched);
605 BE_TIMER_PUSH(t_verify);
606 be_sched_vrfy(irg, be_options.vrfy_option);
607 BE_TIMER_POP(t_verify);
609 /* do some statistics */
610 be_do_stat_reg_pressure(birg);
612 /* stuff needs to be done after scheduling but before register allocation */
613 BE_TIMER_PUSH(t_codegen);
614 arch_code_generator_before_ra(birg->cg);
615 BE_TIMER_POP(t_codegen);
617 /* Do register allocation */
618 BE_TIMER_PUSH(t_regalloc);
619 ra_timer = ra->allocate(birg);
620 BE_TIMER_POP(t_regalloc);
622 dump(DUMP_RA, irg, "-ra", dump_ir_block_graph_sched);
623 be_do_stat_nodes(irg, "06 Register Allocation");
625 /* let the code generator prepare the graph for emitter */
626 BE_TIMER_PUSH(t_finish);
627 arch_code_generator_after_ra(birg->cg);
628 BE_TIMER_POP(t_finish);
630 /* fix stack offsets */
631 BE_TIMER_PUSH(t_abi);
632 be_abi_fix_stack_nodes(birg->abi, NULL);
633 be_remove_dead_nodes_from_schedule(irg);
634 be_abi_fix_stack_bias(birg->abi);
637 BE_TIMER_PUSH(t_finish);
638 arch_code_generator_finish(birg->cg);
639 BE_TIMER_POP(t_finish);
641 dump(DUMP_FINAL, irg, "-finish", dump_ir_block_graph_sched);
643 /* check schedule and register allocation */
644 BE_TIMER_PUSH(t_verify);
645 if (be_options.vrfy_option == BE_VRFY_WARN) {
646 //irg_verify(irg, VRFY_ENFORCE_SSA);
647 be_check_dominance(irg);
648 be_verify_out_edges(irg);
649 be_verify_schedule(irg);
650 be_verify_register_allocation(env.arch_env, irg);
652 else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
653 //assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
654 assert(be_verify_out_edges(irg));
655 assert(be_check_dominance(irg) && "Dominance verification failed");
656 assert(be_verify_schedule(irg) && "Schedule verification failed");
657 assert(be_verify_register_allocation(env.arch_env, irg)
658 && "register allocation verification failed");
660 BE_TIMER_POP(t_verify);
662 /* emit assembler code */
663 BE_TIMER_PUSH(t_emit);
664 arch_code_generator_done(birg->cg);
665 BE_TIMER_POP(t_emit);
667 dump(DUMP_FINAL, irg, "-end", dump_ir_extblock_graph_sched);
669 BE_TIMER_PUSH(t_abi);
670 be_abi_free(birg->abi);
673 be_do_stat_nodes(irg, "07 Final");
674 restore_optimization_state(&state);
676 BE_TIMER_ONLY(num_nodes_a = get_num_reachable_nodes(irg));
677 BE_TIMER_POP(t_other);
679 #define LC_EMIT(timer) printf("%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0)
680 #define LC_EMIT_RA(timer) printf("\t%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0)
682 printf("==>> IRG %s <<==\n", get_entity_name(get_irg_entity(irg)));
683 printf("# nodes at begin: %u\n", num_nodes_b);
684 printf("# nodes before ra: %u\n", num_nodes_r);
685 printf("# nodes at end: %u\n\n", num_nodes_a);
691 LC_EMIT_RA(ra_timer->t_prolog);
692 LC_EMIT_RA(ra_timer->t_live);
693 LC_EMIT_RA(ra_timer->t_spill);
694 LC_EMIT_RA(ra_timer->t_spillslots);
695 LC_EMIT_RA(ra_timer->t_color);
696 LC_EMIT_RA(ra_timer->t_ifg);
697 LC_EMIT_RA(ra_timer->t_copymin);
698 LC_EMIT_RA(ra_timer->t_ssa);
699 LC_EMIT_RA(ra_timer->t_epilog);
700 LC_EMIT_RA(ra_timer->t_verify);
701 LC_EMIT_RA(ra_timer->t_other);
710 free_execfreq(birg->execfreqs);
712 /* switched off due to statistics (statistic module needs all irgs) */
713 if (! stat_is_active())
724 /* Main interface to the frontend. */
725 void be_main(FILE *file_handle, const char *cup_name)
728 lc_timer_t *t = NULL;
729 #endif /* WITH_LIBCORE */
732 /* The user specified another config file to read. do that now. */
733 if(strlen(config_file) > 0) {
736 if((f = fopen(config_file, "rt")) != NULL) {
737 lc_opt_from_file(config_file, f, NULL);
742 if (be_options.timing == BE_TIME_ON) {
743 t = lc_timer_register("bemain", "measure complete bemain loop");
745 if (lc_timer_enter_high_priority()) {
746 fprintf(stderr, "Warning: Could not enter high priority mode.\n");
749 lc_timer_reset_and_start(t);
751 #endif /* WITH_LIBCORE */
753 /* never build code for pseudo irgs */
754 set_visit_pseudo_irgs(0);
757 be_main_loop(file_handle, cup_name);
760 if (be_options.timing == BE_TIME_ON) {
762 lc_timer_leave_high_priority();
763 printf("%-20s: %lu msec\n", "BEMAINLOOP", lc_timer_elapsed_msec(t));
765 #endif /* WITH_LIBCORE */
768 /** The debug info retriever function. */
769 static retrieve_dbg_func retrieve_dbg = NULL;
771 /* Sets a debug info retriever. */
772 void be_set_debug_retrieve(retrieve_dbg_func func) {
776 /* Retrieve the debug info. */
777 const char *be_retrieve_dbg_info(const dbg_info *dbg, unsigned *line) {
779 return retrieve_dbg(dbg, line);
784 int be_put_ignore_regs(const be_irg_t *birg, const arch_register_class_t *cls, bitset_t *bs)
787 bs = bitset_alloca(cls->n_regs);
789 bitset_clear_all(bs);
791 assert(bitset_size(bs) == (unsigned) cls->n_regs);
792 arch_put_non_ignore_regs(birg->main_env->arch_env, cls, bs);
794 be_abi_put_ignore_regs(birg->abi, cls, bs);
795 return bitset_popcnt(bs);