3 * @author Sebastian Hack
14 #include <libcore/lc_opts.h>
15 #include <libcore/lc_opts_enum.h>
16 #include <libcore/lc_timing.h>
17 #endif /* WITH_LIBCORE */
28 #include "iredges_t.h"
34 #include "firm/bearch_firm.h"
35 #include "ia32/bearch_ia32.h"
36 #include "arm/bearch_arm.h"
37 #include "ppc32/bearch_ppc32.h"
38 #include "mips/bearch_mips.h"
45 #include "besched_t.h"
46 #include "belistsched.h"
48 #include "bespillilp.h"
49 #include "bespillbelady.h"
51 #include "beraextern.h"
52 #include "bechordal_t.h"
54 #include "beifg_impl.h"
55 #include "becopyopt.h"
56 #include "becopystat.h"
57 #include "bessadestr.h"
60 #include "beschedmris.h"
64 /* options visible for anyone */
65 static be_options_t be_options = {
66 DUMP_NONE, /* dump options */
67 BE_TIME_OFF, /* no timing */
68 "i44pc52.info.uni-karlsruhe.de", /* ilp server */
69 "cplex" /* ilp solver */
73 static unsigned dump_flags = 0;
76 static unsigned vrfy_option = BE_VRFY_WARN;
78 /* register allocator to use. */
79 static const be_ra_t *ra = &be_ra_chordal_allocator;
81 /* back end instruction set architecture to use */
82 static const arch_isa_if_t *isa_if = &ia32_isa_if;
85 static int be_enable_mris = 0;
89 static lc_opt_entry_t *be_grp_root = NULL;
91 /* possible dumping options */
92 static const lc_opt_enum_mask_items_t dump_items[] = {
93 { "none", DUMP_NONE },
94 { "initial", DUMP_INITIAL },
96 { "sched", DUMP_SCHED },
97 { "prepared", DUMP_PREPARED },
98 { "regalloc", DUMP_RA },
99 { "final", DUMP_FINAL },
101 { "all", 2 * DUMP_BE - 1 },
105 /* register allocators */
106 static const lc_opt_enum_const_ptr_items_t ra_items[] = {
107 { "chordal", &be_ra_chordal_allocator },
108 { "external", &be_ra_external_allocator },
112 /* instruction set architectures. */
113 static const lc_opt_enum_const_ptr_items_t isa_items[] = {
114 { "ia32", &ia32_isa_if },
116 { "arm", &arm_isa_if },
117 { "ppc32", &ppc32_isa_if },
118 { "mips", &mips_isa_if },
123 /* verify options. */
124 static const lc_opt_enum_int_items_t vrfy_items[] = {
125 { "off", BE_VRFY_OFF },
126 { "warn", BE_VRFY_WARN },
127 { "assert", BE_VRFY_ASSERT },
131 static lc_opt_enum_mask_var_t dump_var = {
132 &dump_flags, dump_items
135 static lc_opt_enum_const_ptr_var_t ra_var = {
136 (const void **) &ra, ra_items
139 static lc_opt_enum_const_ptr_var_t isa_var = {
140 (const void **) &isa_if, isa_items
143 static lc_opt_enum_int_var_t vrfy_var = {
144 &vrfy_option, vrfy_items
147 static const lc_opt_table_entry_t be_main_options[] = {
148 LC_OPT_ENT_ENUM_MASK("dump", "dump irg on several occasions", &dump_var),
149 LC_OPT_ENT_ENUM_PTR ("ra", "register allocator", &ra_var),
150 LC_OPT_ENT_ENUM_PTR ("isa", "the instruction set architecture", &isa_var),
151 LC_OPT_ENT_NEGBOOL ("noomitfp", "do not omit frame pointer", &be_omit_fp),
152 LC_OPT_ENT_BOOL ("mris", "enable mris schedule preparation", &be_enable_mris),
153 LC_OPT_ENT_ENUM_PTR ("vrfy", "verify the backend irg (off, warn, assert)", &vrfy_var),
154 LC_OPT_ENT_BOOL ("time", "get backend timing statistics", &be_options.timing),
157 LC_OPT_ENT_STR ("ilp.server", "the ilp server name", be_options.ilp_server, sizeof(be_options.ilp_server)),
158 LC_OPT_ENT_STR ("ilp.solver", "the ilp solver name", be_options.ilp_solver, sizeof(be_options.ilp_solver)),
159 #endif /* WITH_ILP */
163 #endif /* WITH_LIBCORE */
165 void be_opt_register(void)
169 lc_opt_entry_t *be_grp_ra;
170 static int run_once = 0;
174 be_grp_root = lc_opt_get_grp(firm_opt_get_root(), "be");
175 be_grp_ra = lc_opt_get_grp(be_grp_root, "ra");
177 lc_opt_add_table(be_grp_root, be_main_options);
179 /* register allocator options */
180 for(i = 0; ra_items[i].name != NULL; ++i) {
181 const be_ra_t *ra = ra_items[i].value;
182 ra->register_options(be_grp_ra);
185 /* register isa options */
186 for(i = 0; isa_items[i].name != NULL; ++i) {
187 const arch_isa_if_t *isa = isa_items[i].value;
188 isa->register_options(be_grp_root);
191 #endif /* WITH_LIBCORE */
194 /* Parse one argument. */
195 int be_parse_arg(const char *arg) {
197 if (strcmp(arg, "help") == 0 || (arg[0] == '?' && arg[1] == '\0')) {
198 lc_opt_print_help(be_grp_root, stdout);
201 return lc_opt_from_single_arg(be_grp_root, NULL, arg, NULL);
204 #endif /* WITH_LIBCORE */
207 /** The be parameters returned by default, all off. */
208 const static backend_params be_params = {
215 /* Perform schedule verification if requested. */
216 static void be_sched_vrfy(ir_graph *irg, int vrfy_opt) {
217 if (vrfy_opt == BE_VRFY_WARN) {
218 be_verify_schedule(irg);
220 else if (vrfy_opt == BE_VRFY_ASSERT) {
221 assert(be_verify_schedule(irg) && "Schedule verification failed.");
225 /* Initialize the Firm backend. Must be run BEFORE init_firm()! */
226 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 env->options->dump_flags = dump_flags;
255 FIRM_DBG_REGISTER(env->dbg, "be.main");
257 arch_env_init(env->arch_env, isa_if, file_handle);
259 /* Register the irn handler of the architecture */
260 if (arch_isa_get_irn_handler(env->arch_env->isa))
261 arch_env_push_irn_handler(env->arch_env, arch_isa_get_irn_handler(env->arch_env->isa));
264 * Register the node handler of the back end infrastructure.
265 * This irn handler takes care of the platform independent
266 * spill, reload and perm nodes.
268 arch_env_push_irn_handler(env->arch_env, &be_node_irn_handler);
269 env->phi_handler = be_phi_handler_new(env->arch_env);
270 arch_env_push_irn_handler(env->arch_env, env->phi_handler);
275 static void be_done_env(be_main_env_t *env)
277 env->arch_env->isa->impl->done(env->arch_env->isa);
278 be_phi_handler_free(env->phi_handler);
279 obstack_free(&env->obst, NULL);
283 * A wrapper around a firm dumper. Dumps only, if
286 * @param mask a bitmask containing the reason what will be dumped
287 * @param irg the IR graph to dump
288 * @param suffix the suffix for the dumper
289 * @param dumper the dumper to be called
291 static void dump(int mask, ir_graph *irg, const char *suffix,
292 void (*dumper)(ir_graph *, const char *))
294 if(dump_flags & mask)
295 be_dump(irg, suffix, dumper);
299 * Prepare a backend graph for code generation.
301 static void prepare_graph(be_irg_t *birg)
303 ir_graph *irg = birg->irg;
305 /* Normalize proj nodes. */
306 normalize_proj_nodes(irg);
308 /* Make just one return node. */
309 normalize_one_return(irg);
311 /* Remove critical edges */
312 remove_critical_cf_edges(irg);
314 /* Compute the dominance information. */
318 /* Ensure, that the ir_edges are computed. */
321 /* check, if the dominance property is fulfilled. */
322 be_check_dominance(irg);
324 /* reset the phi handler. */
325 be_phi_handler_reset(birg->main_env->phi_handler);
329 * The Firm backend main loop.
330 * Do architecture specific lowering for all graphs
331 * and call the architecture specific code generator.
333 * @param file_handle the file handle the output will be written to
335 static void be_main_loop(FILE *file_handle)
340 unsigned num_nodes_b = 0;
341 unsigned num_nodes_a = 0;
342 unsigned num_nodes_r = 0;
343 unsigned ra_prolog = 0;
344 unsigned ra_epilog = 0;
345 unsigned ra_live = 0;
346 unsigned ra_spill = 0;
347 unsigned ra_color = 0;
349 unsigned ra_copymin = 0;
351 lc_timer_t *t_prolog, *t_abi, *t_codegen, *t_sched, *t_constr, *t_regalloc, *t_finish, *t_emit;
352 be_ra_timer_t *ra_timer;
354 if (be_options.timing == BE_TIME_ON) {
355 t_prolog = lc_timer_register("prolog", "prolog");
356 t_abi = lc_timer_register("beabi", "be abi introduction");
357 t_codegen = lc_timer_register("codegen", "codegeneration");
358 t_sched = lc_timer_register("sched", "scheduling");
359 t_constr = lc_timer_register("constr", "assure constraints");
360 t_regalloc = lc_timer_register("regalloc", "register allocation");
361 t_finish = lc_timer_register("finish", "graph finish");
362 t_emit = lc_timer_register("emiter", "code emiter");
365 be_init_env(&env, file_handle);
367 isa = arch_env_get_isa(env.arch_env);
369 /* for debugging, anchors helps */
370 // dump_all_anchors(1);
372 #define BE_TIME_START(timer) if (be_options.timing == BE_TIME_ON) lc_timer_start(timer);
373 #define BE_TIME_STOP(timer) if (be_options.timing == BE_TIME_ON) lc_timer_stop(timer);
374 #define BE_TIME_ONLY(code) if (be_options.timing == BE_TIME_ON) { code; }
377 for (i = 0, n = get_irp_n_irgs(); i < n; ++i) {
378 ir_graph *irg = get_irp_irg(i);
379 const arch_code_generator_if_t *cg_if;
381 optimization_state_t state;
383 /* do now create a body for graphs that are forced to have no one */
384 if (get_irg_inline_property(irg) == irg_inline_forced_no_body)
387 /* stop and reset timers */
388 if (be_options.timing == BE_TIME_ON) {
389 LC_STOP_AND_RESET_TIMER(t_prolog);
390 LC_STOP_AND_RESET_TIMER(t_abi);
391 LC_STOP_AND_RESET_TIMER(t_codegen);
392 LC_STOP_AND_RESET_TIMER(t_sched);
393 LC_STOP_AND_RESET_TIMER(t_constr);
394 LC_STOP_AND_RESET_TIMER(t_regalloc);
395 LC_STOP_AND_RESET_TIMER(t_finish);
396 LC_STOP_AND_RESET_TIMER(t_emit);
399 BE_TIME_ONLY(num_nodes_b = get_num_reachable_nodes(irg));
402 birg.main_env = &env;
404 BE_TIME_START(t_prolog);
406 DBG((env.dbg, LEVEL_2, "====> IRG: %F\n", irg));
407 dump(DUMP_INITIAL, irg, "-begin", dump_ir_block_graph);
409 be_stat_init_irg(env.arch_env, irg);
410 be_do_stat_nodes(irg, "01 Begin");
412 /* set the current graph (this is important for several firm functions) */
413 current_ir_graph = birg.irg;
415 /* Get the code generator interface. */
416 cg_if = isa->impl->get_code_generator_if(isa);
418 /* get a code generator for this graph. */
419 birg.cg = cg_if->init(&birg);
421 /* create the code generator and generate code. */
422 prepare_graph(&birg);
424 /* some transformations need to be done before abi introduce */
425 arch_code_generator_before_abi(birg.cg);
427 BE_TIME_STOP(t_prolog);
428 BE_TIME_START(t_abi);
430 /* implement the ABI conventions. */
431 birg.abi = be_abi_introduce(&birg);
432 dump(DUMP_ABI, irg, "-abi", dump_ir_block_graph);
434 be_do_stat_nodes(irg, "02 Abi");
437 BE_TIME_START(t_codegen);
440 arch_code_generator_prepare_graph(birg.cg);
442 be_do_stat_nodes(irg, "03 Prepare");
445 * Since the code generator made a lot of new nodes and skipped
446 * a lot of old ones, we should do dead node elimination here.
447 * Note that this requires disabling the edges here.
449 edges_deactivate(irg);
450 //dead_node_elimination(irg);
453 /* Compute loop nesting information (for weighting copies) */
454 construct_cf_backedges(irg);
456 dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph);
458 BE_TIME_STOP(t_codegen);
459 BE_TIME_ONLY(num_nodes_r = get_num_reachable_nodes(irg));
460 BE_TIME_START(t_sched);
462 /* Schedule the graphs. */
463 arch_code_generator_before_sched(birg.cg);
464 list_sched(&birg, be_enable_mris);
465 dump(DUMP_SCHED, irg, "-sched", dump_ir_block_graph_sched);
468 be_sched_vrfy(birg.irg, vrfy_option);
470 be_do_stat_nodes(irg, "04 Schedule");
472 BE_TIME_STOP(t_sched);
473 BE_TIME_START(t_constr);
475 /* we switch off optimizations here, because they might cause trouble */
476 save_optimization_state(&state);
478 set_opt_normalize(0);
480 /* add Keeps for should_be_different constrained nodes */
481 /* beware: needs schedule due to usage of be_ssa_constr */
482 assure_constraints(&birg);
483 dump(DUMP_SCHED, irg, "-assured", dump_ir_block_graph_sched);
485 be_do_stat_nodes(irg, "05 Constraints");
487 /* connect all stack modifying nodes together (see beabi.c) */
488 be_abi_fix_stack_nodes(birg.abi);
489 dump(DUMP_SCHED, irg, "-fix_stack", dump_ir_block_graph_sched);
492 be_sched_vrfy(birg.irg, vrfy_option);
494 /* do some statistics */
495 be_do_stat_reg_pressure(&birg);
497 /* stuff needs to bo done after scheduling but before register allocation */
498 arch_code_generator_before_ra(birg.cg);
500 BE_TIME_STOP(t_constr);
501 BE_TIME_START(t_regalloc);
503 /* Do register allocation */
504 ra_timer = ra->allocate(&birg);
505 dump(DUMP_RA, irg, "-ra", dump_ir_block_graph_sched);
507 if (be_options.timing == BE_TIME_ON && ra_timer) {
508 ra_prolog = lc_timer_elapsed_msec(ra_timer->t_prolog);
509 ra_epilog = lc_timer_elapsed_msec(ra_timer->t_epilog);
510 ra_live = lc_timer_elapsed_msec(ra_timer->t_live);
511 ra_spill = lc_timer_elapsed_msec(ra_timer->t_spill);
512 ra_color = lc_timer_elapsed_msec(ra_timer->t_color);
513 ra_copymin = lc_timer_elapsed_msec(ra_timer->t_copymin);
514 ra_ssa = lc_timer_elapsed_msec(ra_timer->t_ssa);
515 ra_ifg = lc_timer_elapsed_msec(ra_timer->t_ifg);
518 be_do_stat_nodes(irg, "06 Register Allocation");
520 BE_TIME_STOP(t_regalloc);
521 BE_TIME_START(t_finish);
523 arch_code_generator_after_ra(birg.cg);
524 be_abi_fix_stack_bias(birg.abi);
527 be_sched_vrfy(birg.irg, vrfy_option);
529 BE_TIME_STOP(t_finish);
530 BE_TIME_START(t_emit);
532 arch_code_generator_done(birg.cg);
533 dump(DUMP_FINAL, irg, "-end", dump_ir_extblock_graph_sched);
534 be_abi_free(birg.abi);
536 be_do_stat_nodes(irg, "07 Final");
538 BE_TIME_STOP(t_emit);
540 restore_optimization_state(&state);
542 BE_TIME_ONLY(num_nodes_a = get_num_reachable_nodes(irg));
544 /* switched off due to statistics (statistic module needs all irgs) */
545 // free_ir_graph(irg);
546 #define LC_EMIT(timer) printf("%10s: %u msec\n", lc_timer_get_name(timer), lc_timer_elapsed_msec(timer))
547 #define EMIT_RA_TIME(n, t) printf("%20s: %u msec\n", n, t)
548 if (be_options.timing == BE_TIME_ON) {
549 printf("==>> IRG %s <<==\n", get_entity_name(get_irg_entity(irg)));
550 printf("# nodes at begin: %u\n", num_nodes_b);
551 printf("# nodes before ra: %u\n", num_nodes_r);
552 printf("# nodes at end: %u\n\n", num_nodes_a);
559 EMIT_RA_TIME("prolog", ra_prolog);
560 EMIT_RA_TIME("liveness", ra_live);
561 EMIT_RA_TIME("spilling", ra_spill);
562 EMIT_RA_TIME("coloring", ra_color);
563 EMIT_RA_TIME("ifg build", ra_ifg);
564 EMIT_RA_TIME("copymin", ra_copymin);
565 EMIT_RA_TIME("ssa destr", ra_ssa);
566 EMIT_RA_TIME("epilog", ra_epilog);
579 /* Main interface to the frontend. */
580 void be_main(FILE *file_handle)
585 if (be_options.timing == BE_TIME_ON) {
586 t = lc_timer_register("bemain", "measure complete bemain loop");
588 if (lc_timer_enter_high_priority()) {
589 fprintf(stderr, "Warning: Could not enter high priority mode.\n");
592 lc_timer_reset_and_start(t);
594 #endif /* WITH_LIBCORE */
596 /* never build code for pseudo irgs */
597 set_visit_pseudo_irgs(0);
600 be_main_loop(file_handle);
603 if (be_options.timing == BE_TIME_ON) {
605 lc_timer_leave_high_priority();
606 printf("BEMAINLOOP: %lu msec\n", lc_timer_elapsed_msec(t));
608 #endif /* WITH_LIBCORE */
611 /** The debug info retriever function. */
612 static retrieve_dbg_func retrieve_dbg = NULL;
614 /* Sets a debug info retriever. */
615 void be_set_debug_retrieve(retrieve_dbg_func func) {
619 /* Retrieve the debug info. */
620 const char *be_retrieve_dbg_info(const dbg_info *dbg, unsigned *line) {
622 return retrieve_dbg(dbg, line);