X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbemain.c;h=51dcb5c2d47e0b526ffe25c56e4114ad9dc70b6c;hb=fe53f12c8141367dff4137991ad8ce73741761cb;hp=d3014668501bc7b9a4d98e3566b24393797a0ca7;hpb=1112a8c8a8826e8c8b265aec7e7519a8a98fe7c3;p=libfirm diff --git a/ir/be/bemain.c b/ir/be/bemain.c index d30146685..51dcb5c2d 100644 --- a/ir/be/bemain.c +++ b/ir/be/bemain.c @@ -26,10 +26,14 @@ #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" @@ -52,15 +56,15 @@ #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", @@ -104,6 +108,9 @@ static const lc_opt_enum_const_ptr_items_t ra_items[] = { static const lc_opt_enum_const_ptr_items_t isa_items[] = { { "firm", &firm_isa }, { "ia32", &ia32_isa_if }, + { "arm", &arm_isa_if }, + { "ppc", &ppc32_isa_if }, + { "mips", &mips_isa_if }, { NULL, NULL } }; @@ -138,23 +145,39 @@ void be_opt_register(void) #ifdef WITH_LIBCORE int i; lc_opt_entry_t *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 */ +} - 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); +static int be_opt_error_handler(const char *prefix, const lc_opt_err_info_t *err) +{ - /* 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); - } +/* Parse one argument. */ +int be_parse_arg(const char *arg) { +#ifdef WITH_LIBCORE + return lc_opt_from_single_arg(be_grp_root, NULL, arg, be_opt_error_handler); #endif /* WITH_LIBCORE */ } @@ -175,9 +198,10 @@ static be_main_env_t *be_init_env(be_main_env_t *env) { 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])); + env->options = &be_options; + FIRM_DBG_REGISTER(env->dbg, "be.main"); + arch_env_init(env->arch_env, isa_if); /* Register the irn handler of the architecture */ @@ -190,6 +214,8 @@ static be_main_env_t *be_init_env(be_main_env_t *env) * 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; } @@ -197,11 +223,12 @@ static be_main_env_t *be_init_env(be_main_env_t *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) be_dump(irg, suffix, dumper); @@ -218,7 +245,7 @@ static void prepare_graph(be_irg_t *birg) 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); @@ -232,6 +259,9 @@ static void prepare_graph(be_irg_t *birg) /* check, if the dominance property is fulfilled. */ be_check_dominance(irg); + + /* reset the phi handler. */ + be_phi_handler_reset(birg->main_env->phi_handler); } /** @@ -289,7 +319,7 @@ static void be_main_loop(FILE *file_handle) * 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) */ @@ -299,7 +329,6 @@ static void be_main_loop(FILE *file_handle) /* add Keeps for should_be_different constrained nodes */ assure_constraints(&birg); - dump(DUMP_PREPARED, irg, "-assured", dump_ir_block_graph); /* Schedule the graphs. */ @@ -324,11 +353,14 @@ static void be_main_loop(FILE *file_handle) 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 */ @@ -337,3 +369,19 @@ void be_main(FILE *file_handle) 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; +}