X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbemain.c;h=d27cd2f451b83307a871005d2436fefafb1d8fa1;hb=7af4110a7c1472c49abe6d06092bef0675d13877;hp=b33b277765c65e1768a08c26c7084c89021f31a8;hpb=cd24451220d027f8f2620d01019de23091895374;p=libfirm diff --git a/ir/be/bemain.c b/ir/be/bemain.c index b33b27776..d27cd2f45 100644 --- a/ir/be/bemain.c +++ b/ir/be/bemain.c @@ -1,8 +1,28 @@ +/* + * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved. + * + * This file is part of libFirm. + * + * This file may be distributed and/or modified under the terms of the + * GNU General Public License version 2 as published by the Free Software + * Foundation and appearing in the file LICENSE.GPL included in the + * packaging of this file. + * + * Licensees holding valid libFirm Professional Edition licenses may use + * this file in accordance with the libFirm Commercial License. + * Agreement provided with the Software. + * + * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE + * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR + * PURPOSE. + */ + /** - * Backend driver. - * @author Sebastian Hack - * @date 25.11.2004 - * @cvsid $Id$ + * @file + * @brief Main Backend driver. + * @author Sebastian Hack + * @date 25.11.2004 + * @version $Id$ */ #ifdef HAVE_CONFIG_H #include "config.h" @@ -11,11 +31,9 @@ #include #include -#ifdef WITH_LIBCORE #include #include #include -#endif /* WITH_LIBCORE */ #include "obst.h" #include "bitset.h" @@ -31,12 +49,10 @@ #include "irtools.h" #include "irvrfy.h" #include "irprintf.h" -#include "return.h" #include "firmstat.h" -#include "cfopt.h" #include "execfreq.h" -#include "bearch.h" +#include "bearch_t.h" #include "be_t.h" #include "bemodule.h" #include "beutil.h" @@ -47,7 +63,6 @@ #include "belive_t.h" #include "bespillbelady.h" #include "bera.h" -#include "beraextern.h" #include "bechordal_t.h" #include "beifg.h" #include "beifg_impl.h" @@ -60,8 +75,8 @@ #include "bestat.h" #include "beverify.h" #include "beprofile.h" -#include "beblocksched.h" #include "be_dbgout.h" +#include "beirg_t.h" #ifdef WITH_ILP #include "beilpsched.h" @@ -73,11 +88,12 @@ static be_options_t be_options = { BE_TIME_OFF, /* no timing */ 0, /* no opt profile */ 1, /* try to omit frame pointer */ - 0, /* always stabs debugging output */ + 0, /* no stabs debugging output */ BE_VRFY_WARN, /* verification level: warn */ BE_SCHED_LIST, /* scheduler: list scheduler */ "i44pc52.info.uni-karlsruhe.de", /* ilp server */ - "cplex" /* ilp solver */ + "cplex", /* ilp solver */ + "", /* filename for statistic output */ }; /* config file. */ @@ -86,8 +102,6 @@ static char config_file[256] = { 0 }; /* back end instruction set architecture to use */ static const arch_isa_if_t *isa_if = NULL; -#ifdef WITH_LIBCORE - /* possible dumping options */ static const lc_opt_enum_mask_items_t dump_items[] = { { "none", DUMP_NONE }, @@ -146,11 +160,9 @@ static const lc_opt_table_entry_t be_main_options[] = { 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 } + LC_OPT_LAST }; -#endif /* WITH_LIBCORE */ - static be_module_list_entry_t *isa_ifs = NULL; void be_register_isa_if(const char *name, const arch_isa_if_t *isa) @@ -163,7 +175,6 @@ void be_register_isa_if(const char *name, const arch_isa_if_t *isa) void be_opt_register(void) { -#ifdef WITH_LIBCORE lc_opt_entry_t *be_grp; static int run_once = 0; @@ -179,38 +190,36 @@ void be_opt_register(void) be_add_module_list_opt(be_grp, "isa", "the instruction set architecture", &isa_ifs, (void**) &isa_if); -#endif /* WITH_LIBCORE */ } /* Parse one argument. */ int be_parse_arg(const char *arg) { -#ifdef WITH_LIBCORE lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be"); if (strcmp(arg, "help") == 0 || (arg[0] == '?' && arg[1] == '\0')) { lc_opt_print_help(be_grp, stdout); return -1; } return lc_opt_from_single_arg(be_grp, NULL, arg, NULL); -#else - return 0; -#endif /* WITH_LIBCORE */ } /** The be parameters returned by default, all off. */ -const static backend_params be_params = { - NULL, - NULL, - 0, - NULL, +static const backend_params be_params = { + 0, /* need dword lowering */ + 0, /* don't support inlien assembler yet */ + NULL, /* no additional opcodes */ + NULL, /* will be set later */ + NULL, /* but yet no creator function */ + NULL, /* context for create_intrinsic_fkt */ + NULL, /* no if conversion settings */ }; /* Perform schedule verification if requested. */ -static void be_sched_vrfy(ir_graph *irg, int vrfy_opt) { +static void be_sched_vrfy(be_irg_t *birg, int vrfy_opt) { if (vrfy_opt == BE_VRFY_WARN) { - be_verify_schedule(irg); + be_verify_schedule(birg); } else if (vrfy_opt == BE_VRFY_ASSERT) { - assert(be_verify_schedule(irg) && "Schedule verification failed."); + assert(be_verify_schedule(birg) && "Schedule verification failed."); } } @@ -219,7 +228,6 @@ const backend_params *be_init(void) { be_opt_register(); be_init_modules(); - phi_class_init(); if (isa_if->get_params) return isa_if->get_params(); @@ -238,7 +246,6 @@ static be_main_env_t *be_init_env(be_main_env_t *env, FILE *file_handle) 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, file_handle, env); @@ -295,7 +302,6 @@ static void initialize_birg(be_irg_t *birg, ir_graph *irg, be_main_env_t *env) edges_deactivate_kind(irg, EDGE_KIND_DEP); edges_activate_kind(irg, EDGE_KIND_DEP); - DBG((env->dbg, LEVEL_2, "====> IRG: %F\n", irg)); dump(DUMP_INITIAL, irg, "-begin", dump_ir_block_graph); be_stat_init_irg(env->arch_env, irg); @@ -307,8 +313,9 @@ static void initialize_birg(be_irg_t *birg, ir_graph *irg, be_main_env_t *env) /* Normalize proj nodes. */ normalize_proj_nodes(irg); - /* Make just one return node. */ - normalize_one_return(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); /* Remove critical edges */ remove_critical_cf_edges(irg); @@ -318,9 +325,11 @@ static void initialize_birg(be_irg_t *birg, ir_graph *irg, be_main_env_t *env) /* reset the phi handler. */ be_phi_handler_reset(env->phi_handler); -} -#ifdef WITH_LIBCORE + set_irg_phase_state(irg, phase_backend); + + dump(DUMP_INITIAL, irg, "-prepared", dump_ir_block_graph); +} #define BE_TIMER_PUSH(timer) \ if (be_options.timing == BE_TIME_ON) { \ @@ -344,15 +353,6 @@ static void initialize_birg(be_irg_t *birg, ir_graph *irg, be_main_env_t *env) #define BE_TIMER_ONLY(code) do { if (be_options.timing == BE_TIME_ON) { code; } } while(0) -#else - -#define BE_TIMER_PUSH(timer) -#define BE_TIMER_POP(timer) -#define BE_TIMER_ONLY(code) - -#endif /* WITH_LIBCORE */ - - /** * The Firm backend main loop. * Do architecture specific lowering for all graphs @@ -372,11 +372,9 @@ static void be_main_loop(FILE *file_handle, const char *cup_name) char prof_filename[256]; static const char suffix[] = ".prof"; be_irg_t *birgs; - unsigned num_birgs; - - be_ra_timer_t *ra_timer; + int num_birgs; + ir_graph **irg_list, **backend_irg_list; -#ifdef WITH_LIBCORE lc_timer_t *t_abi = NULL; lc_timer_t *t_codegen = NULL; lc_timer_t *t_sched = NULL; @@ -398,7 +396,6 @@ static void be_main_loop(FILE *file_handle, const char *cup_name) t_verify = lc_timer_register("verify", "graph verification"); t_other = lc_timer_register("other", "other"); } -#endif /* WITH_LIBCORE */ be_init_env(&env, file_handle); @@ -407,16 +404,20 @@ static void be_main_loop(FILE *file_handle, const char *cup_name) be_dbg_so(env.db_handle, cup_name); be_dbg_types(env.db_handle); + /* backend may provide an ordered list of irgs where code should be generated for */ + irg_list = NEW_ARR_F(ir_graph *, 0); + backend_irg_list = arch_isa_get_backend_irg_list(isa, &irg_list); + /* we might need 1 birg more for instrumentation constructor */ - num_birgs = get_irp_n_irgs(); + num_birgs = backend_irg_list ? ARR_LEN(backend_irg_list) : get_irp_n_irgs(); birgs = alloca(sizeof(birgs[0]) * (num_birgs + 1)); /* First: initialize all birgs */ - for(i = 0; i < get_irp_n_irgs(); ++i) { - ir_graph *irg = get_irp_irg(i); - + for(i = 0; i < num_birgs; ++i) { + ir_graph *irg = backend_irg_list ? backend_irg_list[i] : get_irp_irg(i); initialize_birg(&birgs[i], irg, &env); } + DEL_ARR_F(irg_list); /* Get the filename for the profiling data. @@ -435,14 +436,13 @@ static void be_main_loop(FILE *file_handle, const char *cup_name) initialize_birg(&birgs[num_birgs], prof_init_irg, &env); num_birgs++; set_method_img_section(get_irg_entity(prof_init_irg), section_constructors); - } - else { + } else { be_profile_read(prof_filename); } /* For all graphs */ for (i = 0; i < num_birgs; ++i) { - be_irg_t *birg = & birgs[i]; + be_irg_t *birg = &birgs[i]; ir_graph *irg = birg->irg; optimization_state_t state; const arch_code_generator_if_t *cg_if; @@ -485,15 +485,6 @@ static void be_main_loop(FILE *file_handle, const char *cup_name) } BE_TIMER_POP(t_verify); - /** - * Create execution frequencies from profile data or estimate some - */ - if (be_profile_has_data()) { - birg->exec_freq = be_create_execfreqs_from_profile(irg); - } else { - birg->exec_freq = compute_execfreq(irg, 10); - } - BE_TIMER_ONLY(num_nodes_b = get_num_reachable_nodes(irg)); /* Get the code generator interface. */ @@ -516,6 +507,14 @@ static void be_main_loop(FILE *file_handle, const char *cup_name) dump(DUMP_ABI, irg, "-abi", dump_ir_block_graph); be_do_stat_nodes(irg, "02 Abi"); + if (be_options.vrfy_option == BE_VRFY_WARN) { + be_check_dominance(irg); + be_verify_out_edges(irg); + } else if (be_options.vrfy_option == BE_VRFY_ASSERT) { + assert(be_verify_out_edges(irg)); + assert(be_check_dominance(irg) && "Dominance verification failed"); + } + /* generate code */ BE_TIMER_PUSH(t_codegen); arch_code_generator_prepare_graph(birg->cg); @@ -523,19 +522,29 @@ static void be_main_loop(FILE *file_handle, const char *cup_name) be_do_stat_nodes(irg, "03 Prepare"); - /* - 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) */ dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph); BE_TIMER_ONLY(num_nodes_r = get_num_reachable_nodes(irg)); + if (be_options.vrfy_option == BE_VRFY_WARN) { + be_check_dominance(irg); + be_verify_out_edges(irg); + } else if (be_options.vrfy_option == BE_VRFY_ASSERT) { + assert(be_verify_out_edges(irg)); + assert(be_check_dominance(irg) && "Dominance verification failed"); + } + + /** + * Create execution frequencies from profile data or estimate some + */ + if (be_profile_has_data()) + birg->exec_freq = be_create_execfreqs_from_profile(irg); + else + birg->exec_freq = compute_execfreq(irg, 10); + + + /* disabled for now, fails for EmptyFor.c and XXEndless.c */ + /* be_live_chk_compare(birg); */ + /* let backend prepare scheduling */ BE_TIMER_PUSH(t_codegen); arch_code_generator_before_sched(birg->cg); @@ -551,9 +560,7 @@ static void be_main_loop(FILE *file_handle, const char *cup_name) break; #ifdef WITH_ILP case BE_SCHED_ILP: - be_ilp_sched(birg); - //fprintf(stderr, "Warning: ILP scheduler not yet fully implemented, falling back to list scheduler.\n"); - //list_sched(birg, &be_options); + be_ilp_sched(birg, &be_options); break; #endif /* WITH_ILP */ }; @@ -563,7 +570,7 @@ static void be_main_loop(FILE *file_handle, const char *cup_name) /* check schedule */ BE_TIMER_PUSH(t_verify); - be_sched_vrfy(irg, be_options.vrfy_option); + be_sched_vrfy(birg, be_options.vrfy_option); BE_TIMER_POP(t_verify); be_do_stat_nodes(irg, "04 Schedule"); @@ -583,26 +590,26 @@ static void be_main_loop(FILE *file_handle, const char *cup_name) dump(DUMP_SCHED, irg, "-assured", dump_ir_block_graph_sched); be_do_stat_nodes(irg, "05 Constraints"); + /* stuff needs to be done after scheduling but before register allocation */ + BE_TIMER_PUSH(t_codegen); + arch_code_generator_before_ra(birg->cg); + BE_TIMER_POP(t_codegen); + /* connect all stack modifying nodes together (see beabi.c) */ BE_TIMER_PUSH(t_abi); - be_abi_fix_stack_nodes(birg->abi, NULL); + be_abi_fix_stack_nodes(birg->abi); BE_TIMER_POP(t_abi); dump(DUMP_SCHED, irg, "-fix_stack", dump_ir_block_graph_sched); /* check schedule */ BE_TIMER_PUSH(t_verify); - be_sched_vrfy(irg, be_options.vrfy_option); + be_sched_vrfy(birg, be_options.vrfy_option); BE_TIMER_POP(t_verify); /* do some statistics */ be_do_stat_reg_pressure(birg); - /* stuff needs to be done after scheduling but before register allocation */ - BE_TIMER_PUSH(t_codegen); - arch_code_generator_before_ra(birg->cg); - BE_TIMER_POP(t_codegen); - #ifdef FIRM_STATISTICS if(be_stat_ev_is_active()) { be_stat_ev_l("costs_before_ra", @@ -632,11 +639,13 @@ static void be_main_loop(FILE *file_handle, const char *cup_name) /* fix stack offsets */ BE_TIMER_PUSH(t_abi); - be_abi_fix_stack_nodes(birg->abi, NULL); + be_abi_fix_stack_nodes(birg->abi); be_remove_dead_nodes_from_schedule(irg); be_abi_fix_stack_bias(birg->abi); BE_TIMER_POP(t_abi); + dump(DUMP_SCHED, irg, "-fix_stack_after_ra", dump_ir_block_graph_sched); + BE_TIMER_PUSH(t_finish); arch_code_generator_finish(birg->cg); BE_TIMER_POP(t_finish); @@ -646,19 +655,19 @@ static void be_main_loop(FILE *file_handle, const char *cup_name) /* check schedule and register allocation */ BE_TIMER_PUSH(t_verify); if (be_options.vrfy_option == BE_VRFY_WARN) { - //irg_verify(irg, VRFY_ENFORCE_SSA); + irg_verify(irg, VRFY_ENFORCE_SSA); be_check_dominance(irg); be_verify_out_edges(irg); - be_verify_schedule(irg); + be_verify_schedule(birg); be_verify_register_allocation(env.arch_env, irg); - } - else if (be_options.vrfy_option == BE_VRFY_ASSERT) { - //assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed"); - assert(be_verify_out_edges(irg)); + } else if (be_options.vrfy_option == BE_VRFY_ASSERT) { + assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed"); + assert(be_verify_out_edges(irg) && "out edge verification failed"); assert(be_check_dominance(irg) && "Dominance verification failed"); - assert(be_verify_schedule(irg) && "Schedule verification failed"); + assert(be_verify_schedule(birg) && "Schedule verification failed"); assert(be_verify_register_allocation(env.arch_env, irg) && "register allocation verification failed"); + } BE_TIMER_POP(t_verify); @@ -667,7 +676,7 @@ static void be_main_loop(FILE *file_handle, const char *cup_name) arch_code_generator_done(birg->cg); BE_TIMER_POP(t_emit); - dump(DUMP_FINAL, irg, "-end", dump_ir_extblock_graph_sched); + dump(DUMP_FINAL, irg, "-end", dump_ir_block_graph_sched); BE_TIMER_PUSH(t_abi); be_abi_free(birg->abi); @@ -703,17 +712,19 @@ static void be_main_loop(FILE *file_handle, const char *cup_name) LC_EMIT(t_sched); LC_EMIT(t_constr); LC_EMIT(t_regalloc); - LC_EMIT_RA(ra_timer->t_prolog); - LC_EMIT_RA(ra_timer->t_live); - LC_EMIT_RA(ra_timer->t_spill); - LC_EMIT_RA(ra_timer->t_spillslots); - LC_EMIT_RA(ra_timer->t_color); - LC_EMIT_RA(ra_timer->t_ifg); - LC_EMIT_RA(ra_timer->t_copymin); - LC_EMIT_RA(ra_timer->t_ssa); - LC_EMIT_RA(ra_timer->t_epilog); - LC_EMIT_RA(ra_timer->t_verify); - LC_EMIT_RA(ra_timer->t_other); + if(global_ra_timer != NULL) { + LC_EMIT_RA(global_ra_timer->t_prolog); + LC_EMIT_RA(global_ra_timer->t_live); + LC_EMIT_RA(global_ra_timer->t_spill); + LC_EMIT_RA(global_ra_timer->t_spillslots); + LC_EMIT_RA(global_ra_timer->t_color); + LC_EMIT_RA(global_ra_timer->t_ifg); + LC_EMIT_RA(global_ra_timer->t_copymin); + LC_EMIT_RA(global_ra_timer->t_ssa); + LC_EMIT_RA(global_ra_timer->t_epilog); + LC_EMIT_RA(global_ra_timer->t_verify); + LC_EMIT_RA(global_ra_timer->t_other); + } LC_EMIT(t_finish); LC_EMIT(t_emit); LC_EMIT(t_verify); @@ -725,11 +736,12 @@ static void be_main_loop(FILE *file_handle, const char *cup_name) be_free_birg(birg); /* switched off due to statistics (statistic module needs all irgs) */ +#if 0 /* STA needs irgs */ #ifdef FIRM_STATISTICS if (! stat_is_active()) -#endif +#endif /* FIRM_STATISTICS */ free_ir_graph(irg); - +#endif /* if 0 */ if(be_stat_ev_is_active()) { be_stat_ev_pop(); } @@ -745,7 +757,6 @@ static void be_main_loop(FILE *file_handle, const char *cup_name) /* Main interface to the frontend. */ void be_main(FILE *file_handle, const char *cup_name) { -#ifdef WITH_LIBCORE lc_timer_t *t = NULL; /* The user specified another config file to read. do that now. */ @@ -771,7 +782,6 @@ void be_main(FILE *file_handle, const char *cup_name) #ifdef FIRM_STATISTICS be_init_stat_file(be_options.stat_file_name, cup_name); #endif -#endif /* WITH_LIBCORE */ /* never build code for pseudo irgs */ set_visit_pseudo_irgs(0); @@ -780,7 +790,6 @@ void be_main(FILE *file_handle, const char *cup_name) be_main_loop(file_handle, cup_name); -#ifdef WITH_LIBCORE if (be_options.timing == BE_TIME_ON) { lc_timer_stop(t); lc_timer_leave_high_priority(); @@ -794,7 +803,6 @@ void be_main(FILE *file_handle, const char *cup_name) #ifdef FIRM_STATISTICS be_close_stat_file(); #endif -#endif /* WITH_LIBCORE */ } /** The debug info retriever function. */ @@ -814,14 +822,14 @@ const char *be_retrieve_dbg_info(const dbg_info *dbg, unsigned *line) { return NULL; } -int be_put_ignore_regs(const be_irg_t *birg, const arch_register_class_t *cls, bitset_t *bs) +unsigned be_put_ignore_regs(const be_irg_t *birg, const arch_register_class_t *cls, bitset_t *bs) { - if(bs == NULL) + if (bs == NULL) bs = bitset_alloca(cls->n_regs); else bitset_clear_all(bs); - assert(bitset_size(bs) == (unsigned) cls->n_regs); + assert(bitset_size(bs) == (unsigned)cls->n_regs); arch_put_non_ignore_regs(birg->main_env->arch_env, cls, bs); bitset_flip_all(bs); be_abi_put_ignore_regs(birg->abi, cls, bs);