#include "iredges_t.h"
#include "irloop_t.h"
#include "irtools.h"
+#include "return.h"
#include "bearch.h"
#include "firm/bearch_firm.h"
#include "ia32/bearch_ia32.h"
+#include "arm/bearch_arm.h"
+#include "ppc32/bearch_ppc32.h"
+#include "mips/bearch_mips.h"
#include "be_t.h"
#include "benumb_t.h"
#include "becopystat.h"
#include "bessadestr.h"
#include "beabi.h"
+#include "belower.h"
-
-#define DUMP_INITIAL (1 << 0)
-#define DUMP_ABI (1 << 1)
-#define DUMP_SCHED (1 << 2)
-#define DUMP_PREPARED (1 << 3)
-#define DUMP_RA (1 << 4)
-#define DUMP_FINAL (1 << 5)
+#define DUMP_INITIAL (1 << 0)
+#define DUMP_ABI (1 << 1)
+#define DUMP_SCHED (1 << 2)
+#define DUMP_PREPARED (1 << 3)
+#define DUMP_RA (1 << 4)
+#define DUMP_FINAL (1 << 5)
/* options visible for anyone */
-be_options_t be_options = {
+static be_options_t be_options = {
/* ilp server */
"i44pc52.info.uni-karlsruhe.de",
static const lc_opt_enum_const_ptr_items_t isa_items[] = {
{ "firm", &firm_isa },
{ "ia32", &ia32_isa_if },
+ { "arm", &arm_isa_if },
+ { "ppc32", &ppc32_isa_if },
+ { "mips", &mips_isa_if },
{ NULL, NULL }
};
LC_OPT_ENT_ENUM_MASK("dump", "dump irg on several occasions", &dump_var),
LC_OPT_ENT_ENUM_PTR("ra", "register allocator", &ra_var),
LC_OPT_ENT_ENUM_PTR("isa", "the instruction set architecture", &isa_var),
+ LC_OPT_ENT_BOOL("omitfp", "omit frame pointer", &be_omit_fp),
#ifdef WITH_ILP
LC_OPT_ENT_STR ("ilp.server", "the ilp server name", be_options.ilp_server, sizeof(be_options.ilp_server)),
#ifdef WITH_LIBCORE
int i;
lc_opt_entry_t *be_grp_ra;
-
- be_grp_root = lc_opt_get_grp(firm_opt_get_root(), "be");
- be_grp_ra = lc_opt_get_grp(be_grp_root, "ra");
-
- lc_opt_add_table(be_grp_root, be_main_options);
-
- /* register allocator options */
- for(i = 0; ra_items[i].name != NULL; ++i) {
- const be_ra_t *ra = ra_items[i].value;
- ra->register_options(be_grp_ra);
+ static int run_once = 0;
+
+ if (! run_once) {
+ run_once = 1;
+ be_grp_root = lc_opt_get_grp(firm_opt_get_root(), "be");
+ be_grp_ra = lc_opt_get_grp(be_grp_root, "ra");
+
+ lc_opt_add_table(be_grp_root, be_main_options);
+
+ /* register allocator options */
+ for(i = 0; ra_items[i].name != NULL; ++i) {
+ const be_ra_t *ra = ra_items[i].value;
+ ra->register_options(be_grp_ra);
+ }
+
+ /* register isa options */
+ for(i = 0; isa_items[i].name != NULL; ++i) {
+ const arch_isa_if_t *isa = isa_items[i].value;
+ isa->register_options(be_grp_root);
+ }
}
+#endif /* WITH_LIBCORE */
+}
- /* register isa options */
- for(i = 0; isa_items[i].name != NULL; ++i) {
- const arch_isa_if_t *isa = isa_items[i].value;
- isa->register_options(be_grp_root);
- }
+/* Parse one argument. */
+int be_parse_arg(const char *arg) {
+#ifdef WITH_LIBCORE
+ return lc_opt_from_single_arg(be_grp_root, NULL, arg, NULL);
#endif /* WITH_LIBCORE */
}
phi_class_init();
}
-static be_main_env_t *be_init_env(be_main_env_t *env)
+static be_main_env_t *be_init_env(be_main_env_t *env, FILE *file_handle)
{
memset(env, 0, sizeof(*env));
obstack_init(&env->obst);
- env->dbg = firm_dbg_register("be.main");
-
env->arch_env = obstack_alloc(&env->obst, sizeof(env->arch_env[0]));
- arch_env_init(env->arch_env, isa_if);
+ env->options = &be_options;
+ FIRM_DBG_REGISTER(env->dbg, "be.main");
+
+ arch_env_init(env->arch_env, isa_if, file_handle);
/* Register the irn handler of the architecture */
if (arch_isa_get_irn_handler(env->arch_env->isa))
arch_env_push_irn_handler(env->arch_env, arch_isa_get_irn_handler(env->arch_env->isa));
- /*
- * Register the node handler of the back end infrastructure.
- * This irn handler takes care of the platform independent
- * spill, reload and perm nodes.
- */
+ /*
+ * Register the node handler of the back end infrastructure.
+ * This irn handler takes care of the platform independent
+ * spill, reload and perm nodes.
+ */
arch_env_push_irn_handler(env->arch_env, &be_node_irn_handler);
+ env->phi_handler = be_phi_handler_new(env->arch_env);
+ arch_env_push_irn_handler(env->arch_env, env->phi_handler);
return env;
}
static void be_done_env(be_main_env_t *env)
{
env->arch_env->isa->impl->done(env->arch_env->isa);
+ be_phi_handler_free(env->phi_handler);
obstack_free(&env->obst, NULL);
}
static void dump(int mask, ir_graph *irg, const char *suffix,
- void (*dumper)(ir_graph *, const char *))
+ void (*dumper)(ir_graph *, const char *))
{
if(dump_flags & mask)
- dumper(irg, suffix);
+ be_dump(irg, suffix, dumper);
}
+/**
+ * Prepare a backend graph for code generation.
+ */
static void prepare_graph(be_irg_t *birg)
{
ir_graph *irg = birg->irg;
normalize_proj_nodes(irg);
/* Make just one return node. */
- // normalize_one_return(irg);
+ normalize_one_return(irg);
/* Remove critical edges */
remove_critical_cf_edges(irg);
/* check, if the dominance property is fulfilled. */
be_check_dominance(irg);
+ /* reset the phi handler. */
+ be_phi_handler_reset(birg->main_env->phi_handler);
}
+/**
+ * The Firm backend main loop.
+ * Do architecture specific lowering for all graphs
+ * and call the architecture specific code generator.
+ */
static void be_main_loop(FILE *file_handle)
{
int i, n;
arch_isa_t *isa;
be_main_env_t env;
- be_init_env(&env);
+ be_init_env(&env, file_handle);
isa = arch_env_get_isa(env.arch_env);
/* For all graphs */
- for(i = 0, n = get_irp_n_irgs(); i < n; ++i) {
+ for (i = 0, n = get_irp_n_irgs(); i < n; ++i) {
ir_graph *irg = get_irp_irg(i);
const arch_code_generator_if_t *cg_if;
be_irg_t birg;
cg_if = isa->impl->get_code_generator_if(isa);
/* get a code generator for this graph. */
- birg.cg = cg_if->init(file_handle, &birg);
+ birg.cg = cg_if->init(&birg);
/* create the code generator and generate code. */
prepare_graph(&birg);
+ /* some transformations need to be done before abi introduce */
+ arch_code_generator_before_abi(birg.cg);
+
/* implement the ABI conventions. */
birg.abi = be_abi_introduce(&birg);
dump(DUMP_ABI, irg, "-abi", dump_ir_block_graph);
/*
* Since the code generator made a lot of new nodes and skipped
- * a lot of old ones, we should do dead node elim here.
+ * a lot of old ones, we should do dead node elimination here.
* Note that this requires disabling the edges here.
*/
edges_deactivate(irg);
- dead_node_elimination(irg);
+ //dead_node_elimination(irg);
edges_activate(irg);
/* Compute loop nesting information (for weighting copies) */
dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph);
+ /* add Keeps for should_be_different constrained nodes */
+ assure_constraints(&birg);
+ dump(DUMP_PREPARED, irg, "-assured", dump_ir_block_graph);
+
/* Schedule the graphs. */
arch_code_generator_before_sched(birg.cg);
- list_sched(isa, irg);
+ list_sched(env.arch_env, irg);
/* connect all stack modifying nodes together (see beabi.c) */
be_abi_fix_stack_nodes(birg.abi);
ra->allocate(&birg);
dump(DUMP_RA, irg, "-ra", dump_ir_block_graph_sched);
+ arch_code_generator_after_ra(birg.cg);
be_abi_fix_stack_bias(birg.abi);
arch_code_generator_done(birg.cg);
dump(DUMP_FINAL, irg, "-end", dump_ir_block_graph_sched);
be_abi_free(birg.abi);
+
+// free_ir_graph(irg);
}
be_done_env(&env);
}
+/* Main interface to the frontend. */
void be_main(FILE *file_handle)
{
/* never build code for pseudo irgs */
be_node_init();
be_main_loop(file_handle);
}
+
+/** The debug info retriever function. */
+static retrieve_dbg_func retrieve_dbg = NULL;
+
+/* Sets a debug info retriever. */
+void be_set_debug_retrieve(retrieve_dbg_func func) {
+ retrieve_dbg = func;
+}
+
+/* Retrieve the debug info. */
+const char *be_retrieve_dbg_info(const dbg_info *dbg, unsigned *line) {
+ if (retrieve_dbg)
+ return retrieve_dbg(dbg, line);
+ *line = 0;
+ return NULL;
+}
projects / libfirm / blobdiff