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 * @brief Main Backend driver.
23 * @author Sebastian Hack
34 #include <libcore/lc_opts.h>
35 #include <libcore/lc_opts_enum.h>
36 #include <libcore/lc_timing.h>
47 #include "iredges_t.h"
61 #include "besched_t.h"
62 #include "belistsched.h"
64 #include "bespillbelady.h"
66 #include "bechordal_t.h"
68 #include "beifg_impl.h"
69 #include "becopyopt.h"
70 #include "becopystat.h"
71 #include "bessadestr.h"
74 #include "beschedmris.h"
77 #include "beprofile.h"
78 #include "be_dbgout.h"
82 #include "beilpsched.h"
85 /* options visible for anyone */
86 static be_options_t be_options = {
87 DUMP_NONE, /* dump flags */
88 BE_TIME_OFF, /* no timing */
89 0, /* no opt profile */
90 0, /* try to omit frame pointer */
91 0, /* no stabs debugging output */
92 BE_VRFY_WARN, /* verification level: warn */
93 BE_SCHED_LIST, /* scheduler: list scheduler */
94 "i44pc52.info.uni-karlsruhe.de", /* ilp server */
95 "cplex", /* ilp solver */
96 0, /* enable statistic event dumping */
97 "", /* print stat events */
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_BOOL ("omitfp", "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 #ifdef FIRM_STATISTICS
159 LC_OPT_ENT_BOOL ("statev", "dump statistic events", &be_options.statev),
160 LC_OPT_ENT_STR ("filtev", "filter for stat events (regex if support is active", &be_options.printev, sizeof(be_options.printev)),
164 LC_OPT_ENT_STR ("ilp.server", "the ilp server name", be_options.ilp_server, sizeof(be_options.ilp_server)),
165 LC_OPT_ENT_STR ("ilp.solver", "the ilp solver name", be_options.ilp_solver, sizeof(be_options.ilp_solver)),
166 #endif /* WITH_ILP */
170 static be_module_list_entry_t *isa_ifs = NULL;
172 void be_register_isa_if(const char *name, const arch_isa_if_t *isa)
177 be_add_module_to_list(&isa_ifs, name, (void*) isa);
180 void be_opt_register(void)
182 lc_opt_entry_t *be_grp;
183 static int run_once = 0;
192 be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
193 lc_opt_add_table(be_grp, be_main_options);
195 be_add_module_list_opt(be_grp, "isa", "the instruction set architecture",
196 &isa_ifs, (void**) &isa_if);
199 /* Parse one argument. */
200 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 /** The be parameters returned by default, all off. */
210 static const backend_params be_params = {
211 0, /* need dword lowering */
212 0, /* don't support inlien assembler yet */
213 NULL, /* no additional opcodes */
214 NULL, /* will be set later */
215 NULL, /* but yet no creator function */
216 NULL, /* context for create_intrinsic_fkt */
217 NULL, /* no if conversion settings */
220 /* Perform schedule verification if requested. */
221 static void be_sched_vrfy(be_irg_t *birg, int vrfy_opt) {
222 if (vrfy_opt == BE_VRFY_WARN) {
223 be_verify_schedule(birg);
225 else if (vrfy_opt == BE_VRFY_ASSERT) {
226 assert(be_verify_schedule(birg) && "Schedule verification failed.");
230 /* Initialize the Firm backend. Must be run BEFORE init_firm()! */
231 const backend_params *be_init(void)
236 if (isa_if->get_params)
237 return isa_if->get_params();
242 * Initializes the main environment for the backend.
244 * @param env an empty environment
245 * @param file_handle the file handle where the output will be written to
247 static be_main_env_t *be_init_env(be_main_env_t *env, FILE *file_handle)
249 memset(env, 0, sizeof(*env));
250 obstack_init(&env->obst);
251 env->arch_env = obstack_alloc(&env->obst, sizeof(env->arch_env[0]));
252 env->options = &be_options;
254 arch_env_init(env->arch_env, isa_if, file_handle, env);
256 /* Register the irn handler of the architecture */
257 if (arch_isa_get_irn_handler(env->arch_env->isa))
258 arch_env_push_irn_handler(env->arch_env, arch_isa_get_irn_handler(env->arch_env->isa));
261 * Register the node handler of the back end infrastructure.
262 * This irn handler takes care of the platform independent
263 * spill, reload and perm nodes.
265 arch_env_push_irn_handler(env->arch_env, &be_node_irn_handler);
266 env->phi_handler = be_phi_handler_new(env->arch_env);
267 arch_env_push_irn_handler(env->arch_env, env->phi_handler);
269 env->db_handle = be_options.stabs_debug_support ? be_stabs_open(file_handle) : be_nulldbg_open();
273 static void be_done_env(be_main_env_t *env)
275 env->arch_env->isa->impl->done(env->arch_env->isa);
276 be_dbg_close(env->db_handle);
277 be_phi_handler_free(env->phi_handler);
278 obstack_free(&env->obst, NULL);
282 * A wrapper around a firm dumper. Dumps only, if
285 * @param mask a bitmask containing the reason what will be dumped
286 * @param irg the IR graph to dump
287 * @param suffix the suffix for the dumper
288 * @param dumper the dumper to be called
290 static void dump(int mask, ir_graph *irg, const char *suffix,
291 void (*dumper)(ir_graph *, const char *))
293 if(be_options.dump_flags & mask)
294 be_dump(irg, suffix, dumper);
298 * Prepare a backend graph for code generation and initialize its birg
300 static void initialize_birg(be_irg_t *birg, ir_graph *irg, be_main_env_t *env)
302 memset(birg, 0, sizeof(*birg));
304 birg->main_env = env;
306 edges_deactivate_kind(irg, EDGE_KIND_DEP);
307 edges_activate_kind(irg, EDGE_KIND_DEP);
309 dump(DUMP_INITIAL, irg, "-begin", dump_ir_block_graph);
311 be_stat_init_irg(env->arch_env, irg);
312 be_do_stat_nodes(irg, "01 Begin");
314 /* set the current graph (this is important for several firm functions) */
315 current_ir_graph = irg;
317 /* Normalize proj nodes. */
318 normalize_proj_nodes(irg);
320 /* we do this before critical edge split. As this produces less returns,
321 because sometimes (= 164.gzip) multiple returns are slower */
322 normalize_n_returns(irg);
324 /* Remove critical edges */
325 remove_critical_cf_edges(irg);
327 /* Ensure, that the ir_edges are computed. */
330 set_irg_phase_state(irg, phase_backend);
332 dump(DUMP_INITIAL, irg, "-prepared", dump_ir_block_graph);
335 #define BE_TIMER_PUSH(timer) \
336 if (be_options.timing == BE_TIME_ON) { \
337 int res = lc_timer_push(timer); \
338 if (be_options.vrfy_option == BE_VRFY_ASSERT) \
339 assert(res && "Timer already on stack, cannot be pushed twice."); \
340 else if (be_options.vrfy_option == BE_VRFY_WARN && ! res) \
341 fprintf(stderr, "Timer %s already on stack, cannot be pushed twice.\n", \
342 lc_timer_get_name(timer)); \
344 #define BE_TIMER_POP(timer) \
345 if (be_options.timing == BE_TIME_ON) { \
346 lc_timer_t *tmp = lc_timer_pop(); \
347 if (be_options.vrfy_option == BE_VRFY_ASSERT) \
348 assert(tmp == timer && "Attempt to pop wrong timer."); \
349 else if (be_options.vrfy_option == BE_VRFY_WARN && tmp != timer) \
350 fprintf(stderr, "Attempt to pop wrong timer. %s is on stack, trying to pop %s.\n", \
351 lc_timer_get_name(tmp), lc_timer_get_name(timer)); \
355 #define BE_TIMER_ONLY(code) do { if (be_options.timing == BE_TIME_ON) { code; } } while(0)
358 * The Firm backend main loop.
359 * Do architecture specific lowering for all graphs
360 * and call the architecture specific code generator.
362 * @param file_handle the file handle the output will be written to
363 * @param cup_name name of the compilation unit
365 static void be_main_loop(FILE *file_handle, const char *cup_name)
370 unsigned num_nodes_b = 0;
371 unsigned num_nodes_a = 0;
372 unsigned num_nodes_r = 0;
373 char prof_filename[256];
374 static const char suffix[] = ".prof";
377 ir_graph **irg_list, **backend_irg_list;
379 lc_timer_t *t_abi = NULL;
380 lc_timer_t *t_codegen = NULL;
381 lc_timer_t *t_sched = NULL;
382 lc_timer_t *t_constr = NULL;
383 lc_timer_t *t_regalloc = NULL;
384 lc_timer_t *t_finish = NULL;
385 lc_timer_t *t_emit = NULL;
386 lc_timer_t *t_other = NULL;
387 lc_timer_t *t_verify = NULL;
389 if (be_options.timing == BE_TIME_ON) {
390 t_abi = lc_timer_register("beabi", "be abi introduction");
391 t_codegen = lc_timer_register("codegen", "codegeneration");
392 t_sched = lc_timer_register("sched", "scheduling");
393 t_constr = lc_timer_register("constr", "assure constraints");
394 t_regalloc = lc_timer_register("regalloc", "register allocation");
395 t_finish = lc_timer_register("finish", "graph finish");
396 t_emit = lc_timer_register("emiter", "code emiter");
397 t_verify = lc_timer_register("verify", "graph verification");
398 t_other = lc_timer_register("other", "other");
401 be_init_env(&env, file_handle);
403 isa = arch_env_get_isa(env.arch_env);
405 be_dbg_so(env.db_handle, cup_name);
406 be_dbg_types(env.db_handle);
408 /* backend may provide an ordered list of irgs where code should be generated for */
409 irg_list = NEW_ARR_F(ir_graph *, 0);
410 backend_irg_list = arch_isa_get_backend_irg_list(isa, &irg_list);
412 /* we might need 1 birg more for instrumentation constructor */
413 num_birgs = backend_irg_list ? ARR_LEN(backend_irg_list) : get_irp_n_irgs();
414 birgs = alloca(sizeof(birgs[0]) * (num_birgs + 1));
416 /* First: initialize all birgs */
417 for(i = 0; i < num_birgs; ++i) {
418 ir_graph *irg = backend_irg_list ? backend_irg_list[i] : get_irp_irg(i);
419 initialize_birg(&birgs[i], irg, &env);
424 Get the filename for the profiling data.
425 Beware: '\0' is already included in sizeof(suffix)
427 memset(prof_filename, 0, sizeof(prof_filename));
428 strncpy(prof_filename, cup_name, sizeof(prof_filename) - sizeof(suffix));
429 strcat(prof_filename, suffix);
432 Next: Either instruments all irgs with profiling code
433 or try to read in profile data for current translation unit.
435 if (be_options.opt_profile) {
436 ir_graph *prof_init_irg = be_profile_instrument(prof_filename, profile_default);
437 initialize_birg(&birgs[num_birgs], prof_init_irg, &env);
439 set_method_img_section(get_irg_entity(prof_init_irg), section_constructors);
441 be_profile_read(prof_filename);
445 for (i = 0; i < num_birgs; ++i) {
446 be_irg_t *birg = &birgs[i];
447 ir_graph *irg = birg->irg;
448 optimization_state_t state;
449 const arch_code_generator_if_t *cg_if;
451 /* set the current graph (this is important for several firm functions) */
452 current_ir_graph = irg;
454 /* reset the phi handler. */
455 be_phi_handler_reset(env.phi_handler);
457 stat_ev_ctx_push_fobj("bemain_irg", irg);
459 /* stop and reset timers */
461 LC_STOP_AND_RESET_TIMER(t_abi);
462 LC_STOP_AND_RESET_TIMER(t_codegen);
463 LC_STOP_AND_RESET_TIMER(t_sched);
464 LC_STOP_AND_RESET_TIMER(t_constr);
465 LC_STOP_AND_RESET_TIMER(t_regalloc);
466 LC_STOP_AND_RESET_TIMER(t_finish);
467 LC_STOP_AND_RESET_TIMER(t_emit);
468 LC_STOP_AND_RESET_TIMER(t_verify);
469 LC_STOP_AND_RESET_TIMER(t_other);
471 BE_TIMER_PUSH(t_other); /* t_other */
473 /* Verify the initial graph */
474 BE_TIMER_PUSH(t_verify);
475 if (be_options.vrfy_option == BE_VRFY_WARN) {
476 irg_verify(irg, VRFY_ENFORCE_SSA);
477 be_check_dominance(irg);
478 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
479 assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
480 assert(be_check_dominance(irg) && "Dominance verification failed");
482 BE_TIMER_POP(t_verify);
484 BE_TIMER_ONLY(num_nodes_b = get_num_reachable_nodes(irg));
486 /* Get the code generator interface. */
487 cg_if = isa->impl->get_code_generator_if(isa);
489 /* get a code generator for this graph. */
490 birg->cg = cg_if->init(birg);
492 /* some transformations need to be done before abi introduce */
493 arch_code_generator_before_abi(birg->cg);
495 /* implement the ABI conventions. */
496 BE_TIMER_PUSH(t_abi);
497 birg->abi = be_abi_introduce(birg);
500 dump(DUMP_ABI, irg, "-abi", dump_ir_block_graph);
501 be_do_stat_nodes(irg, "02 Abi");
503 if (be_options.vrfy_option == BE_VRFY_WARN) {
504 be_check_dominance(irg);
505 be_verify_out_edges(irg);
506 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
507 assert(be_verify_out_edges(irg));
508 assert(be_check_dominance(irg) && "Dominance verification failed");
512 stat_ev_ctx_push_str("bemain_phase", "prepare");
513 BE_TIMER_PUSH(t_codegen);
514 arch_code_generator_prepare_graph(birg->cg);
515 BE_TIMER_POP(t_codegen);
516 stat_ev_ctx_pop("bemain_phase");
518 /* reset the phi handler. */
519 be_phi_handler_reset(env.phi_handler);
521 be_do_stat_nodes(irg, "03 Prepare");
523 dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph);
524 BE_TIMER_ONLY(num_nodes_r = get_num_reachable_nodes(irg));
526 if (be_options.vrfy_option == BE_VRFY_WARN) {
527 be_check_dominance(irg);
528 be_verify_out_edges(irg);
529 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
530 assert(be_verify_out_edges(irg));
531 assert(be_check_dominance(irg) && "Dominance verification failed");
535 * Create execution frequencies from profile data or estimate some
537 if (be_profile_has_data())
538 birg->exec_freq = be_create_execfreqs_from_profile(irg);
540 birg->exec_freq = compute_execfreq(irg, 10);
543 /* disabled for now, fails for EmptyFor.c and XXEndless.c */
544 /* be_live_chk_compare(birg); */
546 /* let backend prepare scheduling */
547 stat_ev_ctx_push_str("bemain_phase", "before_sched");
548 BE_TIMER_PUSH(t_codegen);
549 arch_code_generator_before_sched(birg->cg);
550 BE_TIMER_POP(t_codegen);
551 stat_ev_ctx_pop("bemain_phase");
553 /* schedule the irg */
554 BE_TIMER_PUSH(t_sched);
555 switch (be_options.scheduler) {
557 fprintf(stderr, "Warning: invalid scheduler (%d) selected, falling back to list scheduler.\n", be_options.scheduler);
559 list_sched(birg, &be_options);
563 be_ilp_sched(birg, &be_options);
565 #endif /* WITH_ILP */
567 BE_TIMER_POP(t_sched);
569 dump(DUMP_SCHED, irg, "-sched", dump_ir_block_graph_sched);
572 BE_TIMER_PUSH(t_verify);
573 be_sched_vrfy(birg, be_options.vrfy_option);
574 BE_TIMER_POP(t_verify);
576 be_do_stat_nodes(irg, "04 Schedule");
578 /* introduce patterns to assure constraints */
579 BE_TIMER_PUSH(t_constr);
580 /* we switch off optimizations here, because they might cause trouble */
581 save_optimization_state(&state);
583 set_opt_normalize(0);
585 /* add Keeps for should_be_different constrained nodes */
586 /* beware: needs schedule due to usage of be_ssa_constr */
587 assure_constraints(birg);
588 BE_TIMER_POP(t_constr);
590 dump(DUMP_SCHED, irg, "-assured", dump_ir_block_graph_sched);
591 be_do_stat_nodes(irg, "05 Constraints");
593 /* stuff needs to be done after scheduling but before register allocation */
594 BE_TIMER_PUSH(t_codegen);
595 arch_code_generator_before_ra(birg->cg);
596 BE_TIMER_POP(t_codegen);
598 /* connect all stack modifying nodes together (see beabi.c) */
599 BE_TIMER_PUSH(t_abi);
600 be_abi_fix_stack_nodes(birg->abi);
603 dump(DUMP_SCHED, irg, "-fix_stack", dump_ir_block_graph_sched);
606 BE_TIMER_PUSH(t_verify);
607 be_sched_vrfy(birg, be_options.vrfy_option);
608 BE_TIMER_POP(t_verify);
610 /* do some statistics */
611 //be_do_stat_reg_pressure(birg);
613 #ifdef FIRM_STATISTICS
614 stat_ev_dbl("costs_before_ra", be_estimate_irg_costs(irg, env.arch_env, birg->exec_freq));
617 /* Do register allocation */
618 BE_TIMER_PUSH(t_regalloc);
619 be_allocate_registers(birg);
620 BE_TIMER_POP(t_regalloc);
622 #ifdef FIRM_STATISTICS
623 stat_ev_dbl("costs_before_ra", be_estimate_irg_costs(irg, env.arch_env, birg->exec_freq));
626 dump(DUMP_RA, irg, "-ra", dump_ir_block_graph_sched);
627 be_do_stat_nodes(irg, "06 Register Allocation");
629 /* let the code generator prepare the graph for emitter */
630 BE_TIMER_PUSH(t_finish);
631 arch_code_generator_after_ra(birg->cg);
632 BE_TIMER_POP(t_finish);
634 /* fix stack offsets */
635 BE_TIMER_PUSH(t_abi);
636 be_abi_fix_stack_nodes(birg->abi);
637 be_remove_dead_nodes_from_schedule(birg);
638 be_abi_fix_stack_bias(birg->abi);
641 dump(DUMP_SCHED, irg, "-fix_stack_after_ra", dump_ir_block_graph_sched);
643 BE_TIMER_PUSH(t_finish);
644 arch_code_generator_finish(birg->cg);
645 BE_TIMER_POP(t_finish);
647 dump(DUMP_FINAL, irg, "-finish", dump_ir_block_graph_sched);
649 /* check schedule and register allocation */
650 BE_TIMER_PUSH(t_verify);
651 if (be_options.vrfy_option == BE_VRFY_WARN) {
652 irg_verify(irg, VRFY_ENFORCE_SSA);
653 be_check_dominance(irg);
654 be_verify_out_edges(irg);
655 be_verify_schedule(birg);
656 be_verify_register_allocation(birg);
657 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
658 assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
659 assert(be_verify_out_edges(irg) && "out edge verification failed");
660 assert(be_check_dominance(irg) && "Dominance verification failed");
661 assert(be_verify_schedule(birg) && "Schedule verification failed");
662 assert(be_verify_register_allocation(birg)
663 && "register allocation verification failed");
666 BE_TIMER_POP(t_verify);
668 /* emit assembler code */
669 BE_TIMER_PUSH(t_emit);
670 arch_code_generator_done(birg->cg);
671 BE_TIMER_POP(t_emit);
673 dump(DUMP_FINAL, irg, "-end", dump_ir_block_graph_sched);
675 BE_TIMER_PUSH(t_abi);
676 be_abi_free(birg->abi);
679 be_do_stat_nodes(irg, "07 Final");
680 restore_optimization_state(&state);
682 BE_TIMER_ONLY(num_nodes_a = get_num_reachable_nodes(irg));
683 BE_TIMER_POP(t_other);
685 #define LC_EMIT(timer) \
686 printf("%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0); \
687 stat_ev_dbl(lc_timer_get_name(timer), lc_timer_elapsed_msec(timer));
689 #define LC_EMIT_RA(timer) \
690 printf("\t%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0); \
691 stat_ev_dbl(lc_timer_get_name(timer), lc_timer_elapsed_msec(timer)); \
694 printf("==>> IRG %s <<==\n", get_entity_name(get_irg_entity(irg)));
695 printf("# nodes at begin: %u\n", num_nodes_b);
696 printf("# nodes before ra: %u\n", num_nodes_r);
697 printf("# nodes at end: %u\n\n", num_nodes_a);
703 if(global_ra_timer != NULL) {
704 LC_EMIT_RA(global_ra_timer->t_prolog);
705 LC_EMIT_RA(global_ra_timer->t_live);
706 LC_EMIT_RA(global_ra_timer->t_spill);
707 LC_EMIT_RA(global_ra_timer->t_spillslots);
708 LC_EMIT_RA(global_ra_timer->t_color);
709 LC_EMIT_RA(global_ra_timer->t_ifg);
710 LC_EMIT_RA(global_ra_timer->t_copymin);
711 LC_EMIT_RA(global_ra_timer->t_ssa);
712 LC_EMIT_RA(global_ra_timer->t_epilog);
713 LC_EMIT_RA(global_ra_timer->t_verify);
714 LC_EMIT_RA(global_ra_timer->t_other);
726 /* switched off due to statistics (statistic module needs all irgs) */
727 #if 0 /* STA needs irgs */
728 #ifdef FIRM_STATISTICS
729 if (! stat_is_active())
730 #endif /* FIRM_STATISTICS */
733 stat_ev_ctx_pop("bemain_irg");
743 /* Main interface to the frontend. */
744 void be_main(FILE *file_handle, const char *cup_name)
746 lc_timer_t *t = NULL;
748 /* The user specified another config file to read. do that now. */
749 if(strlen(config_file) > 0) {
752 if((f = fopen(config_file, "rt")) != NULL) {
753 lc_opt_from_file(config_file, f, NULL);
758 if (be_options.timing == BE_TIME_ON) {
759 t = lc_timer_register("bemain", "measure complete bemain loop");
761 if (lc_timer_enter_high_priority()) {
762 fprintf(stderr, "Warning: Could not enter high priority mode.\n");
765 lc_timer_reset_and_start(t);
768 #ifdef FIRM_STATISTICS
769 if (be_options.statev) {
770 const char *dot = strrchr(cup_name, '.');
771 const char *pos = dot ? dot : cup_name + strlen(cup_name);
772 char *buf = alloca(pos - cup_name + 1);
773 strncpy(buf, cup_name, pos - cup_name);
774 buf[pos - cup_name] = '\0';
776 be_options.statev = 1;
777 stat_ev_begin(buf, be_options.printev);
781 /* never build code for pseudo irgs */
782 set_visit_pseudo_irgs(0);
786 be_main_loop(file_handle, cup_name);
788 if (be_options.timing == BE_TIME_ON) {
790 lc_timer_leave_high_priority();
791 stat_ev_dbl("backend_time", lc_timer_elapsed_msec(t));
792 printf("%-20s: %lu msec\n", "BEMAINLOOP", lc_timer_elapsed_msec(t));
795 #ifdef FIRM_STATISTICS
796 if (be_options.statev)
801 /** The debug info retriever function. */
802 static retrieve_dbg_func retrieve_dbg = NULL;
804 /* Sets a debug info retriever. */
805 void be_set_debug_retrieve(retrieve_dbg_func func) {
809 /* Retrieve the debug info. */
810 const char *be_retrieve_dbg_info(const dbg_info *dbg, unsigned *line) {
812 return retrieve_dbg(dbg, line);
818 unsigned be_put_ignore_regs(const be_irg_t *birg, const arch_register_class_t *cls, bitset_t *bs)
821 bs = bitset_alloca(cls->n_regs);
823 bitset_clear_all(bs);
825 assert(bitset_size(bs) == (unsigned)cls->n_regs);
826 arch_put_non_ignore_regs(birg->main_env->arch_env, cls, bs);
828 be_abi_put_ignore_regs(birg->abi, cls, bs);
830 return bitset_popcnt(bs);