#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"
#include "execfreq.h"
#include "irprofile.h"
+#include "irpass_t.h"
#include "bearch.h"
#include "be_t.h"
#include "beverify.h"
#include "be_dbgout.h"
#include "beirg.h"
+#include "bestack.h"
#define NEW_ID(s) new_id_from_chars(s, sizeof(s) - 1)
-#ifdef WITH_ILP
-#include "beilpsched.h"
-#endif /* WITH_ILP */
-
/* options visible for anyone */
static be_options_t be_options = {
DUMP_NONE, /* dump flags */
BE_TIME_OFF, /* no timing */
0, /* no opt profile */
0, /* try to omit frame pointer */
- 0, /* try to omit leaf frame pointer */
0, /* create PIC code */
0, /* create gprof compatible profiling code */
- BE_VRFY_WARN, /* verification level: warn */
- BE_SCHED_LIST, /* scheduler: list scheduler */
+ BE_VERIFY_WARN, /* verification level: warn */
"linux", /* target OS name */
"i44pc52.info.uni-karlsruhe.de", /* ilp server */
"cplex", /* ilp solver */
};
/* 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 }
};
-/* scheduling options. */
-static const lc_opt_enum_int_items_t sched_items[] = {
- { "list", BE_SCHED_LIST },
-#ifdef WITH_ILP
- { "ilp", BE_SCHED_ILP },
-#endif /* WITH_ILP */
- { NULL, 0 }
-};
-
static lc_opt_enum_mask_var_t dump_var = {
&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 sched_var = {
- &be_options.scheduler, sched_items
+static lc_opt_enum_int_var_t verify_var = {
+ &be_options.verify_option, verify_items
};
static const lc_opt_table_entry_t be_main_options[] = {
LC_OPT_ENT_STR ("config", "read another config file containing backend options", config_file, sizeof(config_file)),
LC_OPT_ENT_ENUM_MASK("dump", "dump irg on several occasions", &dump_var),
LC_OPT_ENT_BOOL ("omitfp", "omit frame pointer", &be_options.omit_fp),
- 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),
LC_OPT_ENT_STR ("os", "specify target operating system", &be_options.target_os, sizeof(be_options.target_os)),
#ifdef FIRM_STATISTICS
LC_OPT_ENT_BOOL ("statev", "dump statistic events", &be_options.statev),
}
if ((
- flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE &&
- flags & ASM_CONSTRAINT_FLAG_MODIFIER_NO_WRITE
+ flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE &&
+ flags & ASM_CONSTRAINT_FLAG_MODIFIER_NO_WRITE
) || (
- flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ &&
- flags & ASM_CONSTRAINT_FLAG_MODIFIER_NO_READ
+ flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ &&
+ flags & ASM_CONSTRAINT_FLAG_MODIFIER_NO_READ
)) {
flags |= ASM_CONSTRAINT_FLAG_INVALID;
}
return lc_opt_from_single_arg(be_grp, NULL, arg, NULL);
}
-/** The be parameters returned by default, all off. */
-static const backend_params be_params = {
- 0, /* need dword lowering */
- 0, /* don't support inline assembler yet */
- NULL, /* will be set later */
- NULL, /* but yet no creator function */
- NULL, /* context for create_intrinsic_fkt */
- NULL, /* no if conversion settings */
- NULL, /* no float arithmetic mode */
- 0, /* no trampoline support: size 0 */
- 0, /* no trampoline support: align 0 */
- NULL, /* no trampoline support: no trampoline builder */
- 4 /* alignment of stack parameter */
-};
-
/* Perform schedule verification if requested. */
-static void be_sched_vrfy(be_irg_t *birg, int vrfy_opt)
+static void be_sched_verify(ir_graph *irg, int verify_opt)
{
- if (vrfy_opt == BE_VRFY_WARN) {
- be_verify_schedule(birg);
- } else if (vrfy_opt == BE_VRFY_ASSERT) {
- assert(be_verify_schedule(birg) && "Schedule verification failed.");
+ if (verify_opt == BE_VERIFY_WARN) {
+ be_verify_schedule(irg);
+ } else if (verify_opt == BE_VERIFY_ASSERT) {
+ assert(be_verify_schedule(irg) && "Schedule verification failed.");
}
}
/* Returns the backend parameter */
const backend_params *be_get_backend_param(void)
{
- if (isa_if->get_params)
- return isa_if->get_params();
- return &be_params;
+ return isa_if->get_params();
}
/**
}
/**
- * Prepare a backend graph for code generation and initialize its birg
+ * Prepare a backend graph for code generation and initialize its irg
*/
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;
/* set the current graph (this is important for several firm functions) */
current_ir_graph = irg;
- /* Normalize proj nodes. */
- normalize_proj_nodes(irg);
-
/* we do this before critical edge split. As this produces less returns,
because sometimes (= 164.gzip) multiple returns are slower */
normalize_n_returns(irg);
dump(DUMP_INITIAL, irg, "prepared");
}
-#define BE_TIMER_ONLY(code) do { if (be_timing) { code; } } while (0)
-
int be_timing;
static const char *get_timer_name(be_timer_id_t id)
be_irg_t *birg = &birgs[i];
ir_graph *irg = birg->irg;
optimization_state_t state;
- const arch_code_generator_if_t *cg_if;
/* set the current graph (this is important for several firm functions) */
current_ir_graph = irg;
/* 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);
- /* Get the code generator interface. */
- cg_if = arch_env_get_code_generator_if(arch_env);
-
/* get a code generator for this graph. */
- birg->cg = cg_if->init(birg);
+ arch_env->impl->init_graph(irg);
/* some transformations need to be done before abi introduce */
- arch_code_generator_before_abi(birg->cg);
+ if (arch_env->impl->before_abi != NULL)
+ arch_env->impl->before_abi(irg);
/* 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");
+ }
/* 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);
+ if (arch_env->impl->prepare_graph != NULL)
+ arch_env->impl->prepare_graph(irg);
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);
- switch (be_options.scheduler) {
- 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);
- break;
-#ifdef WITH_ILP
- case BE_SCHED_ILP:
- be_ilp_sched(birg, &be_options);
- break;
-#endif /* WITH_ILP */
- };
+ list_sched(irg);
be_timer_pop(T_SCHED);
dump(DUMP_SCHED, irg, "sched");
/* check schedule */
be_timer_push(T_VERIFY);
- be_sched_vrfy(birg, be_options.vrfy_option);
+ be_sched_verify(irg, be_options.verify_option);
be_timer_pop(T_VERIFY);
/* introduce patterns to assure constraints */
/* we switch off optimizations here, because they might cause trouble */
save_optimization_state(&state);
set_optimize(0);
- set_opt_normalize(0);
set_opt_cse(0);
/* add Keeps for should_be_different constrained nodes */
/* beware: needs schedule due to usage of be_ssa_constr */
- assure_constraints(birg);
+ assure_constraints(irg);
be_timer_pop(T_CONSTR);
dump(DUMP_SCHED, irg, "assured");
/* stuff needs to be done after scheduling but before register allocation */
be_timer_push(T_RA_PREPARATION);
- arch_code_generator_before_ra(birg->cg);
+ if (arch_env->impl->before_ra != NULL)
+ arch_env->impl->before_ra(irg);
be_timer_pop(T_RA_PREPARATION);
/* 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(birg, be_options.vrfy_option);
+ be_sched_verify(irg, be_options.verify_option);
be_timer_pop(T_VERIFY);
stat_ev_if {
}
/* Do register allocation */
- be_allocate_registers(birg);
+ be_allocate_registers(irg);
#ifdef FIRM_STATISTICS
stat_ev_dbl("bemain_costs_before_ra", be_estimate_irg_costs(irg, birg->exec_freq));
/* let the code generator prepare the graph for emitter */
be_timer_push(T_FINISH);
- arch_code_generator_after_ra(birg->cg);
+ if (arch_env->impl->after_ra != NULL)
+ arch_env->impl->after_ra(irg);
be_timer_pop(T_FINISH);
/* fix stack offsets */
be_timer_push(T_ABI);
- be_abi_fix_stack_nodes(birg->abi);
- be_remove_dead_nodes_from_schedule(birg);
- be_abi_fix_stack_bias(birg->abi);
+ be_abi_fix_stack_nodes(irg);
+ be_remove_dead_nodes_from_schedule(irg);
+ be_abi_fix_stack_bias(irg);
be_timer_pop(T_ABI);
dump(DUMP_SCHED, irg, "fix_stack_after_ra");
be_timer_push(T_FINISH);
- arch_code_generator_finish(birg->cg);
+ if (arch_env->impl->finish != NULL)
+ arch_env->impl->finish(irg);
be_timer_pop(T_FINISH);
dump(DUMP_FINAL, irg, "finish");
/* 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(birg);
- be_verify_register_allocation(birg);
- } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
- assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
+ be_verify_schedule(irg);
+ be_verify_register_allocation(irg);
+ } 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(birg) && "Schedule verification failed");
- assert(be_verify_register_allocation(birg)
+ assert(be_verify_schedule(irg) && "Schedule verification failed");
+ assert(be_verify_register_allocation(irg)
&& "register allocation verification failed");
}
/* emit assembler code */
be_timer_push(T_EMIT);
- arch_code_generator_done(birg->cg);
+ if (arch_env->impl->emit != NULL)
+ arch_env->impl->emit(irg);
be_timer_pop(T_EMIT);
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) {
#endif
}
-unsigned be_put_ignore_regs(const be_irg_t *birg, const arch_register_class_t *cls, bitset_t *bs)
+static int do_lower_for_target(ir_prog *irp, void *context)
+{
+ const backend_params *be_params = be_get_backend_param();
+ be_params->lower_for_target();
+ (void) context;
+ (void) irp;
+ return 0;
+}
+
+ir_prog_pass_t *lower_for_target_pass(const char *name)
+{
+ ir_prog_pass_t *pass = XMALLOCZ(ir_prog_pass_t);
+ return def_prog_pass_constructor(pass,
+ name ? name : "lower_for_target",
+ do_lower_for_target);
+}
+
+unsigned be_put_ignore_regs(const ir_graph *irg,
+ const arch_register_class_t *cls, bitset_t *bs)
{
if (bs == NULL)
bs = bitset_alloca(cls->n_regs);
assert(bitset_size(bs) == cls->n_regs);
arch_put_non_ignore_regs(cls, bs);
bitset_flip_all(bs);
- be_abi_put_ignore_regs(birg->abi, cls, bs);
+ be_abi_put_ignore_regs(be_get_irg_abi(irg), cls, bs);
return bitset_popcount(bs);
}
projects / libfirm / blobdiff