X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbemain.c;h=15c811870df82ed22d0adf43982a0c8b707a842c;hb=ca1b1615fbe23a4d5cf72e7be5d2ee831615cbc2;hp=d25617fb16cdb74cb33c986f3f20492b83e1e16f;hpb=7065f494f6fa46f79432a2d948cd41f88c00c990;p=libfirm diff --git a/ir/be/bemain.c b/ir/be/bemain.c index d25617fb1..15c811870 100644 --- a/ir/be/bemain.c +++ b/ir/be/bemain.c @@ -9,121 +9,363 @@ #include +#ifdef WITH_LIBCORE +#include +#include +#endif /* WITH_LIBCORE */ + #include "obst.h" #include "bitset.h" #include "irprog.h" +#include "irgopt.h" #include "irgraph.h" +#include "irdump.h" +#include "phiclass.h" +#include "irdom_t.h" +#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 "bera_t.h" #include "benumb_t.h" +#include "beutil.h" +#include "benode_t.h" +#include "beirgmod.h" #include "besched_t.h" #include "belistsched.h" #include "belive_t.h" -#include "beutil.h" -#include "bephicongr_t.h" -#include "bechordal.h" -#include "bechordal.h" -#include "bephiopt.h" -#include "phistat.h" +#include "bespillilp.h" +#include "bespillbelady.h" +#include "bera.h" +#include "beraextern.h" +#include "bechordal_t.h" +#include "beifg.h" +#include "beifg_impl.h" +#include "becopyopt.h" +#include "becopystat.h" +#include "bessadestr.h" +#include "beabi.h" +#include "belower.h" -#define N_PHASES 256 +#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) -typedef struct _be_graph_info_t { - bitset_t *applied_phases; -} be_graph_info_t; +/* options visible for anyone */ +static be_options_t be_options = { + /* ilp server */ + "i44pc52.info.uni-karlsruhe.de", -static size_t be_info_offset = 0; + /* ilp solver */ + "cplex" +}; -#define get_irg_be_info(irg) get_irg_data(irg, be_graph_info_t, be_info_offset) +/* dump flags */ +static unsigned dump_flags = 2 * DUMP_FINAL - 1; -static int phase_ids = 1; -static struct obstack obst; +/* register allocator to use. */ +static const be_ra_t *ra = &be_ra_chordal_allocator; -int phase_register(phase_t *phase) -{ - phase->id = phase_ids; - return phase_ids++; -} +/* back end instruction set architecture to use */ +static const arch_isa_if_t *isa_if = &ia32_isa_if; +#ifdef WITH_LIBCORE -void phase_applied(const ir_graph *irg, const phase_t *phase) -{ - be_graph_info_t *info = get_irg_be_info(irg); +static lc_opt_entry_t *be_grp_root = NULL; - if(!info->applied_phases) - info->applied_phases = bitset_obstack_alloc(&obst, N_PHASES); +/* possible dumping options */ +static const lc_opt_enum_mask_items_t dump_items[] = { + { "none", 0 }, + { "initial", DUMP_INITIAL }, + { "abi", DUMP_ABI }, + { "sched", DUMP_SCHED }, + { "prepared", DUMP_PREPARED }, + { "regalloc", DUMP_RA }, + { "final", DUMP_FINAL }, + { "all", 2 * DUMP_FINAL - 1 }, + { NULL, 0 } +}; - bitset_set(info->applied_phases, phase->id); -} +/* register allocators */ +static const lc_opt_enum_const_ptr_items_t ra_items[] = { + { "chordal", &be_ra_chordal_allocator }, + { "external", &be_ra_external_allocator }, + { NULL, NULL } +}; -int phase_depends_on(const ir_graph *irg, const phase_t *phase, int n, ...) -{ - int errors = 0; - int i; - va_list args; +/* instruction set architectures. */ +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 } +}; + +static lc_opt_enum_mask_var_t dump_var = { + &dump_flags, dump_items +}; + +static lc_opt_enum_const_ptr_var_t ra_var = { + (const void **) &ra, ra_items +}; - if(n > 0) { - const be_graph_info_t *info = get_irg_be_info(irg); - const bitset_t *applied_phases = info->applied_phases; +static lc_opt_enum_const_ptr_var_t isa_var = { + (const void **) &isa_if, isa_items +}; - va_start(args, n); +static const lc_opt_table_entry_t be_main_options[] = { + 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), - for(i = 0; i < n; ++i) { - const phase_t *dep_phase = va_arg(args, const phase_t *); +#ifdef WITH_ILP + LC_OPT_ENT_STR ("ilp.server", "the ilp server name", be_options.ilp_server, sizeof(be_options.ilp_server)), + LC_OPT_ENT_STR ("ilp.solver", "the ilp solver name", be_options.ilp_solver, sizeof(be_options.ilp_solver)), +#endif /* WITH_ILP */ + { NULL } +}; - if(!applied_phases || !bitset_is_set(applied_phases, dep_phase->id)) { - errors++; - fprintf(stderr, "phase dependency unfulfilled: \"%s\" depends on \"%s\"\n", - phase->name, dep_phase->name); - } - } +#endif /* WITH_LIBCORE */ - va_end(args); +void be_opt_register(void) +{ +#ifdef WITH_LIBCORE + int i; + lc_opt_entry_t *be_grp_ra; - assert(errors > 0 && "There were phase dependency errors"); + 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); } - return errors; + /* 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 */ } + void be_init(void) { - obstack_init(&obst); - be_info_offset = register_additional_graph_data(sizeof(be_graph_info_t)); + be_opt_register(); be_sched_init(); be_liveness_init(); be_numbering_init(); - be_ra_init(); - be_ra_chordal_init(); - be_phi_congr_class_init(); + be_copy_opt_init(); + copystat_init(); + phi_class_init(); } -extern void be_ra_chordal(ir_graph *irg); +static be_main_env_t *be_init_env(be_main_env_t *env) +{ + memset(env, 0, sizeof(*env)); + obstack_init(&env->obst); + 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 */ + 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. + */ + 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 *)) +{ + if(dump_flags & mask) + 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. */ + normalize_proj_nodes(irg); -static void be_main_loop(void) + /* Make just one return node. */ + normalize_one_return(irg); + + /* Remove critical edges */ + remove_critical_cf_edges(irg); + + /* Compute the dominance information. */ + free_dom(irg); + compute_doms(irg); + + /* Ensure, that the ir_edges are computed. */ + edges_activate(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); + + isa = arch_env_get_isa(env.arch_env); + + /* For all graphs */ 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; + + birg.irg = irg; + birg.main_env = &env; + + DBG((env.dbg, LEVEL_2, "====> IRG: %F\n", irg)); + dump(DUMP_INITIAL, irg, "-begin", dump_ir_block_graph); + + /* set the current graph (this is important for several firm functions) */ + current_ir_graph = birg.irg; + + /* Get the code generator interface. */ + cg_if = isa->impl->get_code_generator_if(isa); + + /* get a code generator for this graph. */ + birg.cg = cg_if->init(file_handle, &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); - localize_consts(irg); - be_numbering(irg); - list_sched(irg, trivial_selector, NULL); - be_liveness(irg); - be_ra_chordal(irg); - //be_phi_opt(irg); + /* implement the ABI conventions. */ + birg.abi = be_abi_introduce(&birg); + dump(DUMP_ABI, irg, "-abi", dump_ir_block_graph); - //dump_allocated_irg(irg); + /* generate code */ + arch_code_generator_prepare_graph(birg.cg); - be_ra_chordal_done(irg); - be_numbering_done(irg); + /* + * Since the code generator made a lot of new nodes and skipped + * 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); + edges_activate(irg); + + /* Compute loop nesting information (for weighting copies) */ + construct_cf_backedges(irg); + + 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(env.arch_env, irg); + + /* connect all stack modifying nodes together (see beabi.c) */ + be_abi_fix_stack_nodes(birg.abi); + dump(DUMP_SCHED, irg, "-sched", dump_ir_block_graph_sched); + + /* Verify the schedule */ + sched_verify_irg(irg); + + /* Do register allocation */ + arch_code_generator_before_ra(birg.cg); + 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); } -void be_main(int argc, const char *argv[]) +/* Main interface to the frontend. */ +void be_main(FILE *file_handle) { - be_main_loop(); + /* never build code for pseudo irgs */ + set_visit_pseudo_irgs(0); + + 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; }