#include "iredges_t.h"
#include "irloop_t.h"
#include "irtools.h"
-#include "irvrfy.h"
+#include "irverify.h"
#include "irprintf.h"
#include "iroptimize.h"
#include "firmstat.h"
0, /* try to omit leaf frame pointer */
0, /* create PIC code */
0, /* create gprof compatible profiling code */
- BE_VRFY_WARN, /* verification level: warn */
+ BE_VERIFY_WARN, /* verification level: warn */
BE_SCHED_LIST, /* scheduler: list scheduler */
"linux", /* target OS name */
"i44pc52.info.uni-karlsruhe.de", /* ilp server */
};
/* verify options. */
-static const lc_opt_enum_int_items_t vrfy_items[] = {
- { "off", BE_VRFY_OFF },
- { "warn", BE_VRFY_WARN },
- { "assert", BE_VRFY_ASSERT },
+static const lc_opt_enum_int_items_t verify_items[] = {
+ { "off", BE_VERIFY_OFF },
+ { "warn", BE_VERIFY_WARN },
+ { "assert", BE_VERIFY_ASSERT },
{ NULL, 0 }
};
&be_options.dump_flags, dump_items
};
-static lc_opt_enum_int_var_t vrfy_var = {
- &be_options.vrfy_option, vrfy_items
+static lc_opt_enum_int_var_t verify_var = {
+ &be_options.verify_option, verify_items
};
static lc_opt_enum_int_var_t sched_var = {
LC_OPT_ENT_BOOL ("omitleaffp", "omit frame pointer in leaf routines", &be_options.omit_leaf_fp),
LC_OPT_ENT_BOOL ("pic", "create PIC code", &be_options.pic),
LC_OPT_ENT_BOOL ("gprof", "create gprof profiling code", &be_options.gprof),
- LC_OPT_ENT_ENUM_PTR ("verify", "verify the backend irg", &vrfy_var),
+ LC_OPT_ENT_ENUM_PTR ("verify", "verify the backend irg", &verify_var),
LC_OPT_ENT_BOOL ("time", "get backend timing statistics", &be_options.timing),
LC_OPT_ENT_BOOL ("profile", "instrument the code for execution count profiling", &be_options.opt_profile),
LC_OPT_ENT_ENUM_PTR ("sched", "select a scheduler", &sched_var),
};
/* Perform schedule verification if requested. */
-static void be_sched_vrfy(ir_graph *irg, int vrfy_opt)
+static void be_sched_verify(ir_graph *irg, int verify_opt)
{
- if (vrfy_opt == BE_VRFY_WARN) {
+ if (verify_opt == BE_VERIFY_WARN) {
be_verify_schedule(irg);
- } else if (vrfy_opt == BE_VRFY_ASSERT) {
+ } else if (verify_opt == BE_VERIFY_ASSERT) {
assert(be_verify_schedule(irg) && "Schedule verification failed.");
}
}
*/
static void initialize_birg(be_irg_t *birg, ir_graph *irg, be_main_env_t *env)
{
+ /* don't duplicate locals in backend when dumping... */
+ ir_remove_dump_flags(ir_dump_flag_consts_local);
+
dump(DUMP_INITIAL, irg, "begin");
irg->be_data = birg;
/* Verify the initial graph */
be_timer_push(T_VERIFY);
- if (be_options.vrfy_option == BE_VRFY_WARN) {
- irg_verify(irg, VRFY_ENFORCE_SSA);
+ if (be_options.verify_option == BE_VERIFY_WARN) {
+ irg_verify(irg, VERIFY_ENFORCE_SSA);
be_check_dominance(irg);
- } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
- assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
+ } else if (be_options.verify_option == BE_VERIFY_ASSERT) {
+ assert(irg_verify(irg, VERIFY_ENFORCE_SSA) && "irg verification failed");
assert(be_check_dominance(irg) && "Dominance verification failed");
}
be_timer_pop(T_VERIFY);
cg_if = arch_env_get_code_generator_if(arch_env);
/* get a code generator for this graph. */
- birg->cg = cg_if->init(birg);
+ birg->cg = cg_if->init(irg);
/* some transformations need to be done before abi introduce */
+ assert(birg->cg->impl->before_abi == NULL || !arch_env->custom_abi);
arch_code_generator_before_abi(birg->cg);
/* implement the ABI conventions. */
be_timer_push(T_ABI);
- birg->abi = be_abi_introduce(birg);
+ be_abi_introduce(irg);
be_timer_pop(T_ABI);
- dump(DUMP_ABI, irg, "abi");
-
- /* do local optimizations */
- optimize_graph_df(irg);
+ if (!arch_env->custom_abi) {
+ dump(DUMP_ABI, irg, "abi");
+ /* do local optimizations */
+ optimize_graph_df(irg);
+ }
/* we have to do cfopt+remove_critical_edges as we can't have Bad-blocks
* or critical edges in the backend */
optimize_cf(irg);
remove_critical_cf_edges(irg);
- /* TODO: we often have dead code reachable through out-edges here. So for
- * now we rebuild edges (as we need correct user count for code selection)
- */
+ /* We often have dead code reachable through out-edges here. So for
+ * now we rebuild edges (as we need correct user count for code
+ * selection) */
edges_deactivate(irg);
edges_activate(irg);
- dump(DUMP_PREPARED, irg, "pre_transform");
+ dump(DUMP_PREPARED, irg, "before-code-selection");
- if (be_options.vrfy_option == BE_VRFY_WARN) {
+ if (be_options.verify_option == BE_VERIFY_WARN) {
be_check_dominance(irg);
- } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
+ } else if (be_options.verify_option == BE_VERIFY_ASSERT) {
assert(be_check_dominance(irg) && "Dominance verification failed");
}
- /* generate code */
+ /* perform codeselection */
be_timer_push(T_CODEGEN);
arch_code_generator_prepare_graph(birg->cg);
be_timer_pop(T_CODEGEN);
- dump(DUMP_PREPARED, irg, "prepared");
-
- if (be_options.vrfy_option == BE_VRFY_WARN) {
+ if (be_options.verify_option == BE_VERIFY_WARN) {
be_check_dominance(irg);
- } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
+ } else if (be_options.verify_option == BE_VERIFY_ASSERT) {
assert(be_check_dominance(irg) && "Dominance verification failed");
}
/* disabled for now, fails for EmptyFor.c and XXEndless.c */
- /* be_live_chk_compare(birg); */
+ /* be_live_chk_compare(irg); */
/* schedule the irg */
be_timer_push(T_SCHED);
default:
fprintf(stderr, "Warning: invalid scheduler (%d) selected, falling back to list scheduler.\n", be_options.scheduler);
case BE_SCHED_LIST:
- list_sched(birg, &be_options);
+ list_sched(irg);
break;
#ifdef WITH_ILP
case BE_SCHED_ILP:
- be_ilp_sched(birg, &be_options);
+ be_ilp_sched(irg);
break;
#endif /* WITH_ILP */
};
/* check schedule */
be_timer_push(T_VERIFY);
- be_sched_vrfy(irg, be_options.vrfy_option);
+ be_sched_verify(irg, be_options.verify_option);
be_timer_pop(T_VERIFY);
/* introduce patterns to assure constraints */
/* connect all stack modifying nodes together (see beabi.c) */
be_timer_push(T_ABI);
- be_abi_fix_stack_nodes(birg->abi);
+ be_abi_fix_stack_nodes(irg);
be_timer_pop(T_ABI);
dump(DUMP_SCHED, irg, "fix_stack");
/* check schedule */
be_timer_push(T_VERIFY);
- be_sched_vrfy(irg, be_options.vrfy_option);
+ be_sched_verify(irg, be_options.verify_option);
be_timer_pop(T_VERIFY);
stat_ev_if {
/* fix stack offsets */
be_timer_push(T_ABI);
- be_abi_fix_stack_nodes(birg->abi);
+ be_abi_fix_stack_nodes(irg);
be_remove_dead_nodes_from_schedule(irg);
- be_abi_fix_stack_bias(birg->abi);
+ be_abi_fix_stack_bias(irg);
be_timer_pop(T_ABI);
dump(DUMP_SCHED, irg, "fix_stack_after_ra");
/* check schedule and register allocation */
be_timer_push(T_VERIFY);
- if (be_options.vrfy_option == BE_VRFY_WARN) {
- irg_verify(irg, VRFY_ENFORCE_SSA);
+ if (be_options.verify_option == BE_VERIFY_WARN) {
+ irg_verify(irg, VERIFY_ENFORCE_SSA);
be_check_dominance(irg);
be_verify_schedule(irg);
be_verify_register_allocation(irg);
- } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
- assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
+ } else if (be_options.verify_option == BE_VERIFY_ASSERT) {
+ assert(irg_verify(irg, VERIFY_ENFORCE_SSA) && "irg verification failed");
assert(be_check_dominance(irg) && "Dominance verification failed");
assert(be_verify_schedule(irg) && "Schedule verification failed");
assert(be_verify_register_allocation(irg)
dump(DUMP_FINAL, irg, "end");
be_timer_push(T_ABI);
- be_abi_free(birg->abi);
+ be_abi_free(irg);
be_timer_pop(T_ABI);
restore_optimization_state(&state);
}
#endif
- /* never build code for pseudo irgs */
- set_visit_pseudo_irgs(0);
-
be_main_loop(file_handle, cup_name);
if (be_options.timing == BE_TIME_ON) {
assert(bitset_size(bs) == cls->n_regs);
arch_put_non_ignore_regs(cls, bs);
bitset_flip_all(bs);
- be_abi_put_ignore_regs(be_birg_from_irg(irg)->abi, cls, bs);
+ be_abi_put_ignore_regs(be_get_irg_abi(irg), cls, bs);
return bitset_popcount(bs);
}
projects / libfirm / blobdiff