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"
45 // #include "sta/bearch_sta.h"
52 #include "besched_t.h"
53 #include "belistsched.h"
55 #include "bespillbelady.h"
57 #include "beraextern.h"
58 #include "bechordal_t.h"
60 #include "beifg_impl.h"
61 #include "becopyopt.h"
62 #include "becopystat.h"
63 #include "bessadestr.h"
66 #include "beschedmris.h"
69 #include "beprofile.h"
70 #include "beblocksched.h"
71 #include "be_dbgout.h"
74 #include "beilpsched.h"
77 /* options visible for anyone */
78 static be_options_t be_options = {
79 DUMP_NONE, /* dump flags */
80 BE_TIME_OFF, /* no timing */
81 0, /* no opt profile */
82 1, /* try to omit frame pointer */
83 0, /* always stabs debugging output */
84 BE_VRFY_WARN, /* verification level: warn */
85 BE_SCHED_LIST, /* scheduler: list scheduler */
86 "i44pc52.info.uni-karlsruhe.de", /* ilp server */
87 "cplex" /* ilp solver */
91 static char config_file[256] = { 0 };
93 /* register allocator to use. */
94 static const be_ra_t *ra = &be_ra_chordal_allocator;
96 /* back end instruction set architecture to use */
97 static const arch_isa_if_t *isa_if = &ia32_isa_if;
101 static lc_opt_entry_t *be_grp_root = NULL;
103 /* possible dumping options */
104 static const lc_opt_enum_mask_items_t dump_items[] = {
105 { "none", DUMP_NONE },
106 { "initial", DUMP_INITIAL },
108 { "sched", DUMP_SCHED },
109 { "prepared", DUMP_PREPARED },
110 { "regalloc", DUMP_RA },
111 { "final", DUMP_FINAL },
113 { "all", 2 * DUMP_BE - 1 },
117 /* register allocators */
118 static const lc_opt_enum_const_ptr_items_t ra_items[] = {
119 { "chordal", &be_ra_chordal_allocator },
120 { "external", &be_ra_external_allocator },
124 /* instruction set architectures. */
125 static const lc_opt_enum_const_ptr_items_t isa_items[] = {
126 { "ia32", &ia32_isa_if },
128 { "sta", &sta_isa_if },
129 { "arm", &arm_isa_if },
130 { "ppc32", &ppc32_isa_if },
131 { "mips", &mips_isa_if },
136 /* verify options. */
137 static const lc_opt_enum_int_items_t vrfy_items[] = {
138 { "off", BE_VRFY_OFF },
139 { "warn", BE_VRFY_WARN },
140 { "assert", BE_VRFY_ASSERT },
144 /* scheduling options. */
145 static const lc_opt_enum_int_items_t sched_items[] = {
146 { "list", BE_SCHED_LIST },
148 { "ilp", BE_SCHED_ILP },
149 #endif /* WITH_ILP */
153 static lc_opt_enum_mask_var_t dump_var = {
154 &be_options.dump_flags, dump_items
157 static lc_opt_enum_const_ptr_var_t ra_var = {
158 (const void **) &ra, ra_items
161 static lc_opt_enum_const_ptr_var_t isa_var = {
162 (const void **) &isa_if, isa_items
165 static lc_opt_enum_int_var_t vrfy_var = {
166 &be_options.vrfy_option, vrfy_items
169 static lc_opt_enum_int_var_t sched_var = {
170 &be_options.scheduler, sched_items
173 static const lc_opt_table_entry_t be_main_options[] = {
174 LC_OPT_ENT_STR ("config", "read another config file containing backend options", config_file, sizeof(config_file)),
175 LC_OPT_ENT_ENUM_MASK("dump", "dump irg on several occasions", &dump_var),
176 LC_OPT_ENT_ENUM_PTR ("ra", "register allocator", &ra_var),
177 LC_OPT_ENT_ENUM_PTR ("isa", "the instruction set architecture", &isa_var),
178 LC_OPT_ENT_NEGBOOL ("noomitfp", "do not omit frame pointer", &be_options.omit_fp),
179 LC_OPT_ENT_BOOL ("stabs", "enable stabs debug support", &be_options.stabs_debug_support),
180 LC_OPT_ENT_ENUM_PTR ("vrfy", "verify the backend irg", &vrfy_var),
181 LC_OPT_ENT_BOOL ("time", "get backend timing statistics", &be_options.timing),
182 LC_OPT_ENT_BOOL ("profile", "instrument the code for execution count profiling", &be_options.opt_profile),
183 LC_OPT_ENT_ENUM_PTR ("sched", "select a scheduler", &sched_var),
184 LC_OPT_ENT_STR ("statfile", "append statistics to file statfile", &be_options.stat_file_name, sizeof(be_options.stat_file_name)),
187 LC_OPT_ENT_STR ("ilp.server", "the ilp server name", be_options.ilp_server, sizeof(be_options.ilp_server)),
188 LC_OPT_ENT_STR ("ilp.solver", "the ilp solver name", be_options.ilp_solver, sizeof(be_options.ilp_solver)),
189 #endif /* WITH_ILP */
193 #endif /* WITH_LIBCORE */
195 void be_opt_register(void)
199 lc_opt_entry_t *be_grp_ra;
200 static int run_once = 0;
204 be_grp_root = lc_opt_get_grp(firm_opt_get_root(), "be");
205 be_grp_ra = lc_opt_get_grp(be_grp_root, "ra");
207 lc_opt_add_table(be_grp_root, be_main_options);
209 /* register allocator options */
210 for(i = 0; ra_items[i].name != NULL; ++i) {
211 const be_ra_t *ra = ra_items[i].value;
212 ra->register_options(be_grp_ra);
215 /* register isa options */
216 for(i = 0; isa_items[i].name != NULL; ++i) {
217 const arch_isa_if_t *isa = isa_items[i].value;
218 isa->register_options(be_grp_root);
221 /* list scheduler register options */
222 list_sched_register_options(be_grp_root);
225 /* ilp scheduler register options */
226 ilpsched_register_options(be_grp_root);
227 #endif /* WITH_ILP */
229 be_block_schedule_register_options(be_grp_root);
231 #endif /* WITH_LIBCORE */
234 /* Parse one argument. */
235 int be_parse_arg(const char *arg) {
237 if (strcmp(arg, "help") == 0 || (arg[0] == '?' && arg[1] == '\0')) {
238 lc_opt_print_help(be_grp_root, stdout);
241 return lc_opt_from_single_arg(be_grp_root, NULL, arg, NULL);
244 #endif /* WITH_LIBCORE */
247 /** The be parameters returned by default, all off. */
248 const static backend_params be_params = {
255 /* Perform schedule verification if requested. */
256 static void be_sched_vrfy(ir_graph *irg, int vrfy_opt) {
257 if (vrfy_opt == BE_VRFY_WARN) {
258 be_verify_schedule(irg);
260 else if (vrfy_opt == BE_VRFY_ASSERT) {
261 assert(be_verify_schedule(irg) && "Schedule verification failed.");
265 /* Initialize the Firm backend. Must be run BEFORE init_firm()! */
266 const backend_params *be_init(void)
276 if (isa_if->get_params)
277 return isa_if->get_params();
282 * Initializes the main environment for the backend.
284 * @param env an empty environment
285 * @param file_handle the file handle where the output will be written to
287 static be_main_env_t *be_init_env(be_main_env_t *env, FILE *file_handle)
289 memset(env, 0, sizeof(*env));
290 obstack_init(&env->obst);
291 env->arch_env = obstack_alloc(&env->obst, sizeof(env->arch_env[0]));
292 env->options = &be_options;
293 FIRM_DBG_REGISTER(env->dbg, "be.main");
295 arch_env_init(env->arch_env, isa_if, file_handle, env);
297 /* Register the irn handler of the architecture */
298 if (arch_isa_get_irn_handler(env->arch_env->isa))
299 arch_env_push_irn_handler(env->arch_env, arch_isa_get_irn_handler(env->arch_env->isa));
302 * Register the node handler of the back end infrastructure.
303 * This irn handler takes care of the platform independent
304 * spill, reload and perm nodes.
306 arch_env_push_irn_handler(env->arch_env, &be_node_irn_handler);
307 env->phi_handler = be_phi_handler_new(env->arch_env);
308 arch_env_push_irn_handler(env->arch_env, env->phi_handler);
310 env->db_handle = be_options.stabs_debug_support ? be_stabs_open(file_handle) : be_nulldbg_open();
314 static void be_done_env(be_main_env_t *env)
316 env->arch_env->isa->impl->done(env->arch_env->isa);
317 be_dbg_close(env->db_handle);
318 be_phi_handler_free(env->phi_handler);
319 obstack_free(&env->obst, NULL);
323 * A wrapper around a firm dumper. Dumps only, if
326 * @param mask a bitmask containing the reason what will be dumped
327 * @param irg the IR graph to dump
328 * @param suffix the suffix for the dumper
329 * @param dumper the dumper to be called
331 static void dump(int mask, ir_graph *irg, const char *suffix,
332 void (*dumper)(ir_graph *, const char *))
334 if(be_options.dump_flags & mask)
335 be_dump(irg, suffix, dumper);
339 * Prepare a backend graph for code generation and initialize its birg
341 static void initialize_birg(be_irg_t *birg, ir_graph *irg, be_main_env_t *env)
343 memset(birg, 0, sizeof(*birg));
345 birg->main_env = env;
347 edges_deactivate_kind(irg, EDGE_KIND_DEP);
348 edges_activate_kind(irg, EDGE_KIND_DEP);
350 DBG((env->dbg, LEVEL_2, "====> IRG: %F\n", irg));
351 dump(DUMP_INITIAL, irg, "-begin", dump_ir_block_graph);
353 be_stat_init_irg(env->arch_env, irg);
354 be_do_stat_nodes(irg, "01 Begin");
356 /* set the current graph (this is important for several firm functions) */
357 current_ir_graph = irg;
359 /* Normalize proj nodes. */
360 normalize_proj_nodes(irg);
362 /* Make just one return node. */
363 normalize_one_return(irg);
365 /* Remove critical edges */
366 remove_critical_cf_edges(irg);
368 /* Ensure, that the ir_edges are computed. */
371 /* reset the phi handler. */
372 be_phi_handler_reset(env->phi_handler);
377 #define BE_TIMER_PUSH(timer) \
378 if (be_options.timing == BE_TIME_ON) { \
379 int res = lc_timer_push(timer); \
380 if (be_options.vrfy_option == BE_VRFY_ASSERT) \
381 assert(res && "Timer already on stack, cannot be pushed twice."); \
382 else if (be_options.vrfy_option == BE_VRFY_WARN && ! res) \
383 fprintf(stderr, "Timer %s already on stack, cannot be pushed twice.\n", \
384 lc_timer_get_name(timer)); \
386 #define BE_TIMER_POP(timer) \
387 if (be_options.timing == BE_TIME_ON) { \
388 lc_timer_t *tmp = lc_timer_pop(); \
389 if (be_options.vrfy_option == BE_VRFY_ASSERT) \
390 assert(tmp == timer && "Attempt to pop wrong timer."); \
391 else if (be_options.vrfy_option == BE_VRFY_WARN && tmp != timer) \
392 fprintf(stderr, "Attempt to pop wrong timer. %s is on stack, trying to pop %s.\n", \
393 lc_timer_get_name(tmp), lc_timer_get_name(timer)); \
397 #define BE_TIMER_ONLY(code) do { if (be_options.timing == BE_TIME_ON) { code; } } while(0)
401 #define BE_TIMER_PUSH(timer)
402 #define BE_TIMER_POP(timer)
403 #define BE_TIMER_ONLY(code)
405 #endif /* WITH_LIBCORE */
409 * The Firm backend main loop.
410 * Do architecture specific lowering for all graphs
411 * and call the architecture specific code generator.
413 * @param file_handle the file handle the output will be written to
414 * @param cup_name name of the compilation unit
416 static void be_main_loop(FILE *file_handle, const char *cup_name)
421 unsigned num_nodes_b = 0;
422 unsigned num_nodes_a = 0;
423 unsigned num_nodes_r = 0;
424 char prof_filename[256];
425 static const char suffix[] = ".prof";
429 be_ra_timer_t *ra_timer;
432 lc_timer_t *t_abi = NULL;
433 lc_timer_t *t_codegen = NULL;
434 lc_timer_t *t_sched = NULL;
435 lc_timer_t *t_constr = NULL;
436 lc_timer_t *t_regalloc = NULL;
437 lc_timer_t *t_finish = NULL;
438 lc_timer_t *t_emit = NULL;
439 lc_timer_t *t_other = NULL;
440 lc_timer_t *t_verify = NULL;
442 if (be_options.timing == BE_TIME_ON) {
443 t_abi = lc_timer_register("beabi", "be abi introduction");
444 t_codegen = lc_timer_register("codegen", "codegeneration");
445 t_sched = lc_timer_register("sched", "scheduling");
446 t_constr = lc_timer_register("constr", "assure constraints");
447 t_regalloc = lc_timer_register("regalloc", "register allocation");
448 t_finish = lc_timer_register("finish", "graph finish");
449 t_emit = lc_timer_register("emiter", "code emiter");
450 t_verify = lc_timer_register("verify", "graph verification");
451 t_other = lc_timer_register("other", "other");
453 #endif /* WITH_LIBCORE */
455 be_init_env(&env, file_handle);
457 isa = arch_env_get_isa(env.arch_env);
459 be_dbg_so(env.db_handle, cup_name);
460 be_dbg_types(env.db_handle);
462 /* we might need 1 birg more for instrumentation constructor */
463 num_birgs = get_irp_n_irgs();
464 birgs = alloca(sizeof(birgs[0]) * (num_birgs + 1));
466 /* First: initialize all birgs */
467 for(i = 0; i < get_irp_n_irgs(); ++i) {
468 ir_graph *irg = get_irp_irg(i);
470 initialize_birg(&birgs[i], irg, &env);
474 Get the filename for the profiling data.
475 Beware: '\0' is already included in sizeof(suffix)
477 memset(prof_filename, 0, sizeof(prof_filename));
478 strncpy(prof_filename, cup_name, sizeof(prof_filename) - sizeof(suffix));
479 strcat(prof_filename, suffix);
482 Next: Either instruments all irgs with profiling code
483 or try to read in profile data for current translation unit.
485 if (be_options.opt_profile) {
486 ir_graph *prof_init_irg = be_profile_instrument(prof_filename, profile_default);
487 initialize_birg(&birgs[num_birgs], prof_init_irg, &env);
489 set_method_img_section(get_irg_entity(prof_init_irg), section_constructors);
492 be_profile_read(prof_filename);
496 for (i = 0; i < num_birgs; ++i) {
497 be_irg_t *birg = & birgs[i];
498 ir_graph *irg = birg->irg;
499 optimization_state_t state;
500 const arch_code_generator_if_t *cg_if;
503 /* set the current graph (this is important for several firm functions) */
504 current_ir_graph = irg;
506 if(be_stat_ev_is_active()) {
507 ir_snprintf(irg_name, sizeof(irg_name), "%F", irg);
508 be_stat_tags[STAT_TAG_CLS] = "<all>";
509 be_stat_tags[STAT_TAG_IRG] = irg_name;
510 be_stat_ev_push(be_stat_tags, STAT_TAG_LAST, be_stat_file);
513 /* stop and reset timers */
515 LC_STOP_AND_RESET_TIMER(t_abi);
516 LC_STOP_AND_RESET_TIMER(t_codegen);
517 LC_STOP_AND_RESET_TIMER(t_sched);
518 LC_STOP_AND_RESET_TIMER(t_constr);
519 LC_STOP_AND_RESET_TIMER(t_regalloc);
520 LC_STOP_AND_RESET_TIMER(t_finish);
521 LC_STOP_AND_RESET_TIMER(t_emit);
522 LC_STOP_AND_RESET_TIMER(t_verify);
523 LC_STOP_AND_RESET_TIMER(t_other);
525 BE_TIMER_PUSH(t_other); /* t_other */
527 /* Verify the initial graph */
528 BE_TIMER_PUSH(t_verify);
529 if (be_options.vrfy_option == BE_VRFY_WARN) {
530 irg_verify(irg, VRFY_ENFORCE_SSA);
531 be_check_dominance(irg);
532 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
533 assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
534 assert(be_check_dominance(irg) && "Dominance verification failed");
536 BE_TIMER_POP(t_verify);
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 BE_TIMER_ONLY(num_nodes_b = get_num_reachable_nodes(irg));
549 /* Get the code generator interface. */
550 cg_if = isa->impl->get_code_generator_if(isa);
552 /* get a code generator for this graph. */
553 birg->cg = cg_if->init(birg);
555 /* some transformations need to be done before abi introduce */
556 arch_code_generator_before_abi(birg->cg);
558 /* reset the phi handler. */
559 be_phi_handler_reset(env.phi_handler);
561 /* implement the ABI conventions. */
562 BE_TIMER_PUSH(t_abi);
563 birg->abi = be_abi_introduce(birg);
566 dump(DUMP_ABI, irg, "-abi", dump_ir_block_graph);
567 be_do_stat_nodes(irg, "02 Abi");
570 BE_TIMER_PUSH(t_codegen);
571 arch_code_generator_prepare_graph(birg->cg);
572 BE_TIMER_POP(t_codegen);
574 be_do_stat_nodes(irg, "03 Prepare");
577 Since the code generator made a lot of new nodes and skipped
578 a lot of old ones, we should do dead node elimination here.
579 Note that this requires disabling the edges here.
581 edges_deactivate(irg);
582 //dead_node_elimination(irg);
585 /* Compute loop nesting information (for weighting copies) */
586 construct_cf_backedges(irg);
587 dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph);
588 BE_TIMER_ONLY(num_nodes_r = get_num_reachable_nodes(irg));
590 /* let backend prepare scheduling */
591 BE_TIMER_PUSH(t_codegen);
592 arch_code_generator_before_sched(birg->cg);
593 BE_TIMER_POP(t_codegen);
595 /* schedule the irg */
596 BE_TIMER_PUSH(t_sched);
597 switch (be_options.scheduler) {
599 fprintf(stderr, "Warning: invalid scheduler (%d) selected, falling back to list scheduler.\n", be_options.scheduler);
601 list_sched(birg, &be_options);
606 //fprintf(stderr, "Warning: ILP scheduler not yet fully implemented, falling back to list scheduler.\n");
607 //list_sched(birg, &be_options);
609 #endif /* WITH_ILP */
611 BE_TIMER_POP(t_sched);
613 dump(DUMP_SCHED, irg, "-sched", dump_ir_block_graph_sched);
616 BE_TIMER_PUSH(t_verify);
617 be_sched_vrfy(irg, be_options.vrfy_option);
618 BE_TIMER_POP(t_verify);
620 be_do_stat_nodes(irg, "04 Schedule");
622 /* introduce patterns to assure constraints */
623 BE_TIMER_PUSH(t_constr);
624 /* we switch off optimizations here, because they might cause trouble */
625 save_optimization_state(&state);
627 set_opt_normalize(0);
629 /* add Keeps for should_be_different constrained nodes */
630 /* beware: needs schedule due to usage of be_ssa_constr */
631 assure_constraints(birg);
632 BE_TIMER_POP(t_constr);
634 dump(DUMP_SCHED, irg, "-assured", dump_ir_block_graph_sched);
635 be_do_stat_nodes(irg, "05 Constraints");
637 /* connect all stack modifying nodes together (see beabi.c) */
638 BE_TIMER_PUSH(t_abi);
639 be_abi_fix_stack_nodes(birg->abi, NULL);
642 dump(DUMP_SCHED, irg, "-fix_stack", dump_ir_block_graph_sched);
645 BE_TIMER_PUSH(t_verify);
646 be_sched_vrfy(irg, be_options.vrfy_option);
647 BE_TIMER_POP(t_verify);
649 /* do some statistics */
650 be_do_stat_reg_pressure(birg);
652 /* stuff needs to be done after scheduling but before register allocation */
653 BE_TIMER_PUSH(t_codegen);
654 arch_code_generator_before_ra(birg->cg);
655 BE_TIMER_POP(t_codegen);
657 if(be_stat_ev_is_active()) {
658 be_stat_ev_l("costs_before_ra",
659 (long) be_estimate_irg_costs(irg, env.arch_env, birg->exec_freq));
662 /* Do register allocation */
663 BE_TIMER_PUSH(t_regalloc);
664 ra_timer = ra->allocate(birg);
665 BE_TIMER_POP(t_regalloc);
667 if(be_stat_ev_is_active()) {
668 be_stat_ev_l("costs_after_ra",
669 (long) be_estimate_irg_costs(irg, env.arch_env, birg->exec_freq));
672 dump(DUMP_RA, irg, "-ra", dump_ir_block_graph_sched);
673 be_do_stat_nodes(irg, "06 Register Allocation");
675 /* let the code generator prepare the graph for emitter */
676 BE_TIMER_PUSH(t_finish);
677 arch_code_generator_after_ra(birg->cg);
678 BE_TIMER_POP(t_finish);
680 /* fix stack offsets */
681 BE_TIMER_PUSH(t_abi);
682 be_abi_fix_stack_nodes(birg->abi, NULL);
683 be_remove_dead_nodes_from_schedule(irg);
684 be_abi_fix_stack_bias(birg->abi);
687 BE_TIMER_PUSH(t_finish);
688 arch_code_generator_finish(birg->cg);
689 BE_TIMER_POP(t_finish);
691 dump(DUMP_FINAL, irg, "-finish", dump_ir_block_graph_sched);
693 /* check schedule and register allocation */
694 BE_TIMER_PUSH(t_verify);
695 if (be_options.vrfy_option == BE_VRFY_WARN) {
696 //irg_verify(irg, VRFY_ENFORCE_SSA);
697 be_check_dominance(irg);
698 be_verify_out_edges(irg);
699 be_verify_schedule(irg);
700 be_verify_register_allocation(env.arch_env, irg);
702 else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
703 //assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
704 assert(be_verify_out_edges(irg));
705 assert(be_check_dominance(irg) && "Dominance verification failed");
706 assert(be_verify_schedule(irg) && "Schedule verification failed");
707 assert(be_verify_register_allocation(env.arch_env, irg)
708 && "register allocation verification failed");
710 BE_TIMER_POP(t_verify);
712 /* emit assembler code */
713 BE_TIMER_PUSH(t_emit);
714 arch_code_generator_done(birg->cg);
715 BE_TIMER_POP(t_emit);
717 dump(DUMP_FINAL, irg, "-end", dump_ir_extblock_graph_sched);
719 BE_TIMER_PUSH(t_abi);
720 be_abi_free(birg->abi);
723 be_do_stat_nodes(irg, "07 Final");
724 restore_optimization_state(&state);
726 BE_TIMER_ONLY(num_nodes_a = get_num_reachable_nodes(irg));
727 BE_TIMER_POP(t_other);
729 #define LC_EMIT(timer) \
730 if(!be_stat_ev_is_active()) { \
731 printf("%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0); \
733 be_stat_ev_l(lc_timer_get_name(timer), lc_timer_elapsed_msec(timer)); \
735 #define LC_EMIT_RA(timer) \
736 if(!be_stat_ev_is_active()) { \
737 printf("\t%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0); \
739 be_stat_ev_l(lc_timer_get_name(timer), lc_timer_elapsed_msec(timer)); \
742 if(!be_stat_ev_is_active()) {
743 printf("==>> IRG %s <<==\n", get_entity_name(get_irg_entity(irg)));
744 printf("# nodes at begin: %u\n", num_nodes_b);
745 printf("# nodes before ra: %u\n", num_nodes_r);
746 printf("# nodes at end: %u\n\n", num_nodes_a);
753 LC_EMIT_RA(ra_timer->t_prolog);
754 LC_EMIT_RA(ra_timer->t_live);
755 LC_EMIT_RA(ra_timer->t_spill);
756 LC_EMIT_RA(ra_timer->t_spillslots);
757 LC_EMIT_RA(ra_timer->t_color);
758 LC_EMIT_RA(ra_timer->t_ifg);
759 LC_EMIT_RA(ra_timer->t_copymin);
760 LC_EMIT_RA(ra_timer->t_ssa);
761 LC_EMIT_RA(ra_timer->t_epilog);
762 LC_EMIT_RA(ra_timer->t_verify);
763 LC_EMIT_RA(ra_timer->t_other);
772 free_execfreq(birg->exec_freq);
773 birg->exec_freq = NULL;
775 if(birg->dom_front != NULL) {
776 be_free_dominance_frontiers(birg->dom_front);
777 birg->dom_front = NULL;
779 if(birg->lv != NULL) {
780 be_liveness_free(birg->lv);
784 /* switched off due to statistics (statistic module needs all irgs) */
785 if (! stat_is_active())
788 if(be_stat_ev_is_active()) {
800 /* Main interface to the frontend. */
801 void be_main(FILE *file_handle, const char *cup_name)
804 lc_timer_t *t = NULL;
806 /* The user specified another config file to read. do that now. */
807 if(strlen(config_file) > 0) {
810 if((f = fopen(config_file, "rt")) != NULL) {
811 lc_opt_from_file(config_file, f, NULL);
816 if (be_options.timing == BE_TIME_ON) {
817 t = lc_timer_register("bemain", "measure complete bemain loop");
819 if (lc_timer_enter_high_priority()) {
820 fprintf(stderr, "Warning: Could not enter high priority mode.\n");
823 lc_timer_reset_and_start(t);
826 be_init_stat_file(be_options.stat_file_name, cup_name);
827 #endif /* WITH_LIBCORE */
829 /* never build code for pseudo irgs */
830 set_visit_pseudo_irgs(0);
834 be_main_loop(file_handle, cup_name);
837 if (be_options.timing == BE_TIME_ON) {
839 lc_timer_leave_high_priority();
840 if(be_stat_ev_is_active()) {
841 be_stat_ev_l("backend_time", lc_timer_elapsed_msec(t));
843 printf("%-20s: %lu msec\n", "BEMAINLOOP", lc_timer_elapsed_msec(t));
847 be_close_stat_file();
848 #endif /* WITH_LIBCORE */
851 /** The debug info retriever function. */
852 static retrieve_dbg_func retrieve_dbg = NULL;
854 /* Sets a debug info retriever. */
855 void be_set_debug_retrieve(retrieve_dbg_func func) {
859 /* Retrieve the debug info. */
860 const char *be_retrieve_dbg_info(const dbg_info *dbg, unsigned *line) {
862 return retrieve_dbg(dbg, line);
868 int be_put_ignore_regs(const be_irg_t *birg, const arch_register_class_t *cls, bitset_t *bs)
871 bs = bitset_alloca(cls->n_regs);
873 bitset_clear_all(bs);
875 assert(bitset_size(bs) == (unsigned) cls->n_regs);
876 arch_put_non_ignore_regs(birg->main_env->arch_env, cls, bs);
878 be_abi_put_ignore_regs(birg->abi, cls, bs);
880 return bitset_popcnt(bs);
883 void be_assure_liveness(be_irg_t *birg)
888 birg->lv = be_liveness(birg->irg);
891 void be_invalidate_liveness(be_irg_t *birg)
896 be_liveness_free(birg->lv);
900 void be_assure_dom_front(be_irg_t *birg)
902 if(birg->dom_front != NULL)
905 birg->dom_front = be_compute_dominance_frontiers(birg->irg);
908 void be_invalidate_dom_front(be_irg_t *birg)
910 if(birg->dom_front == NULL)
913 be_free_dominance_frontiers(birg->dom_front);
914 birg->dom_front = NULL;