X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbemain.c;h=409fa37ff825123c757ab24a8c0032964fc3b632;hb=4eccff9cdc2a5e114606e8b83745f1339c83c932;hp=7d5d04cd4e9bb4d0cec63b382b084823f2bf4099;hpb=d2c1b0191844c3c23731158a153838d570dcd65a;p=libfirm diff --git a/ir/be/bemain.c b/ir/be/bemain.c index 7d5d04cd4..409fa37ff 100644 --- a/ir/be/bemain.c +++ b/ir/be/bemain.c @@ -39,23 +39,23 @@ #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 "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 "bemodule.h" #include "beutil.h" -#include "benode_t.h" +#include "benode.h" #include "beirgmod.h" #include "besched.h" #include "belistsched.h" @@ -63,7 +63,6 @@ #include "bera.h" #include "bechordal_t.h" #include "beifg.h" -#include "beifg_impl.h" #include "becopyopt.h" #include "becopystat.h" #include "bessadestr.h" @@ -74,24 +73,19 @@ #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 */ @@ -120,45 +114,30 @@ static const lc_opt_enum_mask_items_t dump_items[] = { }; /* 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), @@ -248,7 +227,7 @@ asm_constraint_flags_t be_parse_asm_constraints(const char *constraint) switch (*c) { case '#': /* 'comment' stuff */ - while(*c != 0 && *c != ',') + while (*c != 0 && *c != ',') ++c; break; case '*': @@ -265,18 +244,18 @@ asm_constraint_flags_t be_parse_asm_constraints(const char *constraint) if (tflags != 0) { flags |= tflags; } else { - flags |= isa_if->parse_asm_constraint(isa_if, &c); + flags |= isa_if->parse_asm_constraint(&c); } break; } } 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; } @@ -301,7 +280,7 @@ int be_is_valid_clobber(const char *clobber) if (strcmp(clobber, "cc") == 0) return 1; - return isa_if->is_valid_clobber(isa_if, clobber); + return isa_if->is_valid_clobber(clobber); } void be_register_isa_if(const char *name, const arch_isa_if_t *isa) @@ -331,7 +310,8 @@ void be_opt_register(void) } /* Parse one argument. */ -int be_parse_arg(const char *arg) { +int be_parse_arg(const char *arg) +{ 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_for_entry(be_grp, '-', stdout); @@ -340,27 +320,13 @@ int be_parse_arg(const char *arg) { 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) { - 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."); +static void be_sched_verify(ir_graph *irg, int verify_opt) +{ + 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."); } } @@ -380,9 +346,7 @@ void firm_be_finish(void) /* 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(); } /** @@ -407,8 +371,6 @@ static be_main_env_t *be_init_env(be_main_env_t *env, FILE *file_handle) memset(asm_constraint_flags, 0, sizeof(asm_constraint_flags)); env->arch_env = arch_env_init(isa_if, file_handle, env); - be_phi_handler_new(); - be_dbg_open(); return env; } @@ -420,7 +382,6 @@ static void be_done_env(be_main_env_t *env) { arch_env_done(env->arch_env); be_dbg_close(); - be_phi_handler_free(); pmap_destroy(env->ent_trampoline_map); pmap_destroy(env->ent_pic_symbol_map); @@ -437,33 +398,35 @@ static void be_done_env(be_main_env_t *env) * @param suffix the suffix for the dumper * @param dumper the dumper to be called */ -static void dump(int mask, ir_graph *irg, const char *suffix, - void (*dumper)(ir_graph *, const char *)) +static void dump(int mask, ir_graph *irg, const char *suffix) { - if(be_options.dump_flags & mask) - be_dump(irg, suffix, dumper); + if (be_options.dump_flags & mask) + dump_ir_graph(irg, suffix); } /** - * 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; + memset(birg, 0, sizeof(*birg)); birg->irg = irg; birg->main_env = env; + obstack_init(&birg->obst); edges_deactivate_kind(irg, EDGE_KIND_DEP); edges_activate_kind(irg, EDGE_KIND_DEP); - dump(DUMP_INITIAL, irg, "-begin", dump_ir_block_graph); - /* 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); @@ -477,35 +440,41 @@ static void initialize_birg(be_irg_t *birg, ir_graph *irg, be_main_env_t *env) set_irg_phase_state(irg, phase_backend); be_info_init_irg(irg); - dump(DUMP_INITIAL, irg, "-prepared", dump_ir_block_graph); + dump(DUMP_INITIAL, irg, "prepared"); } -#define BE_TIMER_ONLY(code) do { if (be_timing) { code; } } while(0) - int be_timing; -ir_timer_t *t_abi; -ir_timer_t *t_codegen; -ir_timer_t *t_ra_preparation; -ir_timer_t *t_sched; -ir_timer_t *t_constr; -ir_timer_t *t_finish; -ir_timer_t *t_emit; -ir_timer_t *t_other; -ir_timer_t *t_verify; -ir_timer_t *t_heights; -ir_timer_t *t_live; -ir_timer_t *t_execfreq; -ir_timer_t *t_ssa_constr; -ir_timer_t *t_ra_constr; -ir_timer_t *t_ra_prolog; -ir_timer_t *t_ra_epilog; -ir_timer_t *t_ra_spill; -ir_timer_t *t_ra_spill_apply; -ir_timer_t *t_ra_color; -ir_timer_t *t_ra_ifg; -ir_timer_t *t_ra_copymin; -ir_timer_t *t_ra_ssa; -ir_timer_t *t_ra_other; + +static const char *get_timer_name(be_timer_id_t id) +{ + switch (id) { + case T_ABI: return "abi"; + case T_CODEGEN: return "codegen"; + case T_RA_PREPARATION: return "ra_preparation"; + case T_SCHED: return "sched"; + case T_CONSTR: return "constr"; + case T_FINISH: return "finish"; + case T_EMIT: return "emit"; + case T_VERIFY: return "verify"; + case T_OTHER: return "other"; + case T_HEIGHTS: return "heights"; + case T_LIVE: return "live"; + case T_EXECFREQ: return "execfreq"; + case T_SSA_CONSTR: return "ssa_constr"; + case T_RA_PROLOG: return "ra_prolog"; + case T_RA_EPILOG: return "ra_epilog"; + case T_RA_CONSTR: return "ra_constr"; + case T_RA_SPILL: return "ra_spill"; + case T_RA_SPILL_APPLY: return "ra_spill_apply"; + case T_RA_COLOR: return "ra_color"; + case T_RA_IFG: return "ra_ifg"; + case T_RA_COPYMIN: return "ra_copymin"; + case T_RA_SSA: return "ra_ssa"; + case T_RA_OTHER: return "ra_other"; + } + return "unknown"; +} +ir_timer_t *be_timers[T_LAST+1]; /** * The Firm backend main loop. @@ -529,30 +498,9 @@ static void be_main_loop(FILE *file_handle, const char *cup_name) be_timing = (be_options.timing == BE_TIME_ON); if (be_timing) { - t_abi = ir_timer_register("bemain_time_beabi", "be abi introduction"); - t_codegen = ir_timer_register("bemain_time_codegen", "codegeneration"); - t_ra_preparation = ir_timer_register("bemain_time_ra_preparation", "ra preparation"); - t_sched = ir_timer_register("bemain_time_sched", "scheduling"); - t_constr = ir_timer_register("bemain_time_constr", "assure constraints"); - t_finish = ir_timer_register("bemain_time_finish", "graph finish"); - t_emit = ir_timer_register("bemain_time_emiter", "code emiter"); - t_verify = ir_timer_register("bemain_time_verify", "graph verification"); - t_other = ir_timer_register("bemain_time_other", "other"); - t_heights = ir_timer_register("bemain_time_heights", "heights"); - t_live = ir_timer_register("bemain_time_liveness", "be liveness"); - t_execfreq = ir_timer_register("bemain_time_execfreq", "execfreq"); - t_ssa_constr = ir_timer_register("bemain_time_ssa_constr", "ssa reconstruction"); - t_ra_prolog = ir_timer_register("bemain_time_ra_prolog", "regalloc prolog"); - t_ra_epilog = ir_timer_register("bemain_time_ra_epilog", "regalloc epilog"); - t_ra_constr = ir_timer_register("bemain_time_ra_constr", "regalloc constraints"); - t_ra_spill = ir_timer_register("bemain_time_ra_spill", "spiller"); - t_ra_spill_apply - = ir_timer_register("bemain_time_ra_spill_apply", "apply spills"); - t_ra_color = ir_timer_register("bemain_time_ra_color", "graph coloring"); - t_ra_ifg = ir_timer_register("bemain_time_ra_ifg", "interference graph"); - t_ra_copymin = ir_timer_register("bemain_time_ra_copymin", "copy minimization"); - t_ra_ssa = ir_timer_register("bemain_time_ra_ssadestr", "ssa destruction"); - t_ra_other = ir_timer_register("bemain_time_ra_other", "regalloc other"); + for (i = 0; i < T_LAST+1; ++i) { + be_timers[i] = ir_timer_new(); + } } be_init_env(&env, file_handle); @@ -575,7 +523,7 @@ static void be_main_loop(FILE *file_handle, const char *cup_name) be_info_init(); /* First: initialize all birgs */ - for(i = 0; i < num_birgs; ++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); } @@ -611,14 +559,10 @@ static void be_main_loop(FILE *file_handle, const char *cup_name) 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; - /* reset the phi handler. */ - be_phi_handler_reset(); - stat_ev_if { stat_ev_ctx_push_fobj("bemain_irg", irg); be_stat_ev("bemain_insns_start", be_count_insns(irg)); @@ -626,62 +570,67 @@ static void be_main_loop(FILE *file_handle, const char *cup_name) } /* stop and reset timers */ - BE_TIMER_PUSH(t_other); /* t_other */ + be_timer_push(T_OTHER); /* Verify the initial graph */ - BE_TIMER_PUSH(t_verify); - if (be_options.vrfy_option == BE_VRFY_WARN) { - irg_verify(irg, VRFY_ENFORCE_SSA); + be_timer_push(T_VERIFY); + 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); + be_timer_pop(T_VERIFY); /* 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_TIMER_POP(t_abi); + be_timer_push(T_ABI); + be_abi_introduce(irg); + be_timer_pop(T_ABI); + + if (!arch_env->custom_abi) { + dump(DUMP_ABI, irg, "abi"); + } - dump(DUMP_ABI, irg, "-abi", dump_ir_block_graph); + /* 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); - if (be_options.vrfy_option == BE_VRFY_WARN) { + /* 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, "before-code-selection"); + + if (be_options.verify_option == BE_VERIFY_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)); + } else if (be_options.verify_option == BE_VERIFY_ASSERT) { assert(be_check_dominance(irg) && "Dominance verification failed"); } - /* generate code */ - BE_TIMER_PUSH(t_codegen); - arch_code_generator_prepare_graph(birg->cg); - BE_TIMER_POP(t_codegen); - - /* reset the phi handler. */ - be_phi_handler_reset(); + /* perform codeselection */ + be_timer_push(T_CODEGEN); + if (arch_env->impl->prepare_graph != NULL) + arch_env->impl->prepare_graph(irg); + be_timer_pop(T_CODEGEN); - dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph); - - if (be_options.vrfy_option == BE_VRFY_WARN) { + if (be_options.verify_option == BE_VERIFY_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)); + } else if (be_options.verify_option == BE_VERIFY_ASSERT) { assert(be_check_dominance(irg) && "Dominance verification failed"); } - BE_TIMER_PUSH(t_execfreq); + be_timer_push(T_EXECFREQ); /** * Create execution frequencies from profile data or estimate some */ @@ -693,66 +642,55 @@ static void be_main_loop(FILE *file_handle, const char *cup_name) edges_deactivate(irg); birg->exec_freq = compute_execfreq(irg, 10); } - BE_TIMER_POP(t_execfreq); + be_timer_pop(T_EXECFREQ); /* 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 */ - }; - BE_TIMER_POP(t_sched); + be_timer_push(T_SCHED); + list_sched(irg); + be_timer_pop(T_SCHED); - dump(DUMP_SCHED, irg, "-sched", dump_ir_block_graph_sched); + dump(DUMP_SCHED, irg, "sched"); /* check schedule */ - BE_TIMER_PUSH(t_verify); - be_sched_vrfy(birg, be_options.vrfy_option); - BE_TIMER_POP(t_verify); + be_timer_push(T_VERIFY); + be_sched_verify(irg, be_options.verify_option); + be_timer_pop(T_VERIFY); /* introduce patterns to assure constraints */ - BE_TIMER_PUSH(t_constr); + be_timer_push(T_CONSTR); /* 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); - BE_TIMER_POP(t_constr); + assure_constraints(irg); + be_timer_pop(T_CONSTR); - dump(DUMP_SCHED, irg, "-assured", dump_ir_block_graph_sched); + 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); - BE_TIMER_POP(t_ra_preparation); + be_timer_push(T_RA_PREPARATION); + 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_TIMER_POP(t_abi); + be_timer_push(T_ABI); + be_abi_fix_stack_nodes(irg); + be_timer_pop(T_ABI); - dump(DUMP_SCHED, irg, "-fix_stack", dump_ir_block_graph_sched); + dump(DUMP_SCHED, irg, "fix_stack"); /* check schedule */ - BE_TIMER_PUSH(t_verify); - be_sched_vrfy(birg, be_options.vrfy_option); - BE_TIMER_POP(t_verify); + be_timer_push(T_VERIFY); + be_sched_verify(irg, be_options.verify_option); + be_timer_pop(T_VERIFY); stat_ev_if { stat_ev_dbl("bemain_costs_before_ra", @@ -762,33 +700,35 @@ static void be_main_loop(FILE *file_handle, const char *cup_name) } /* 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)); #endif - dump(DUMP_RA, irg, "-ra", dump_ir_block_graph_sched); + dump(DUMP_RA, irg, "ra"); /* let the code generator prepare the graph for emitter */ - BE_TIMER_PUSH(t_finish); - arch_code_generator_after_ra(birg->cg); - BE_TIMER_POP(t_finish); + be_timer_push(T_FINISH); + 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_TIMER_POP(t_abi); + be_timer_push(T_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", dump_ir_block_graph_sched); + dump(DUMP_SCHED, irg, "fix_stack_after_ra"); - BE_TIMER_PUSH(t_finish); - arch_code_generator_finish(birg->cg); - BE_TIMER_POP(t_finish); + be_timer_push(T_FINISH); + if (arch_env->impl->finish != NULL) + arch_env->impl->finish(irg); + be_timer_pop(T_FINISH); - dump(DUMP_FINAL, irg, "-finish", dump_ir_block_graph_sched); + dump(DUMP_FINAL, irg, "finish"); stat_ev_if { be_stat_ev("bemain_insns_finish", be_count_insns(irg)); @@ -796,87 +736,62 @@ 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); + be_timer_push(T_VERIFY); + if (be_options.verify_option == BE_VERIFY_WARN) { + irg_verify(irg, VERIFY_ENFORCE_SSA); be_check_dominance(irg); - be_verify_out_edges(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"); - assert(be_verify_out_edges(irg) && "out edge 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"); } - BE_TIMER_POP(t_verify); + be_timer_pop(T_VERIFY); /* emit assembler code */ - BE_TIMER_PUSH(t_emit); - arch_code_generator_done(birg->cg); - BE_TIMER_POP(t_emit); + be_timer_push(T_EMIT); + if (arch_env->impl->emit != NULL) + arch_env->impl->emit(irg); + be_timer_pop(T_EMIT); - dump(DUMP_FINAL, irg, "-end", dump_ir_block_graph_sched); + dump(DUMP_FINAL, irg, "end"); - BE_TIMER_PUSH(t_abi); - be_abi_free(birg->abi); - BE_TIMER_POP(t_abi); + be_timer_push(T_ABI); + be_abi_free(irg); + be_timer_pop(T_ABI); restore_optimization_state(&state); - BE_TIMER_POP(t_other); - -#define STOP_AND_RESET_TIMER(timer) do { ir_timer_stop(timer); ir_timer_reset(timer); } while(0) - -#define LC_EMIT(timer) \ - stat_ev_if { \ - stat_ev_dbl(ir_timer_get_name(timer), ir_timer_elapsed_msec(timer)); \ - } else { \ - printf("%-20s: %8.3lf msec\n", ir_timer_get_description(timer), (double)ir_timer_elapsed_usec(timer) / 1000.0); \ - } \ - STOP_AND_RESET_TIMER(timer); - - BE_TIMER_ONLY( - stat_ev_if { + be_timer_pop(T_OTHER); + + if (be_timing) { + int t; + if (stat_ev_enabled) { + for (t = 0; t < T_LAST+1; ++t) { + char buf[128]; + snprintf(buf, sizeof(buf), "bemain_time_%s", + get_timer_name(t)); + stat_ev_dbl(buf, ir_timer_elapsed_usec(be_timers[i])); + } } else { - printf("==>> IRG %s <<==\n", get_entity_name(get_irg_entity(irg))); + printf("==>> IRG %s <<==\n", + get_entity_name(get_irg_entity(irg))); + for (t = 0; t < T_LAST+1; ++t) { + double val = ir_timer_elapsed_usec(be_timers[t]) / 1000.0; + printf("%-20s: %8.3lf msec\n", get_timer_name(t), val); + } } - LC_EMIT(t_abi); - LC_EMIT(t_codegen); - LC_EMIT(t_ra_preparation); - LC_EMIT(t_sched); - LC_EMIT(t_live); - LC_EMIT(t_heights); - LC_EMIT(t_ssa_constr); - LC_EMIT(t_constr); - LC_EMIT(t_execfreq); - LC_EMIT(t_ra_prolog); - LC_EMIT(t_ra_spill); - LC_EMIT(t_ra_spill_apply); - LC_EMIT(t_ra_constr); - LC_EMIT(t_ra_color); - LC_EMIT(t_ra_ifg); - LC_EMIT(t_ra_copymin); - LC_EMIT(t_ra_ssa); - LC_EMIT(t_ra_epilog); - LC_EMIT(t_ra_other); - LC_EMIT(t_finish); - LC_EMIT(t_emit); - LC_EMIT(t_verify); - LC_EMIT(t_other); - ); -#undef LC_EMIT - - be_free_birg(birg); - - /* switched off due to statistics (statistic module needs all irgs) */ -#ifdef FIRM_STATISTICS - if (! stat_active) -#endif /* FIRM_STATISTICS */ - remove_irp_irg(irg); + for (t = 0; t < T_LAST+1; ++t) { + ir_timer_stop(be_timers[t]); + ir_timer_reset(be_timers[t]); + } + } + + be_free_birg(irg); stat_ev_ctx_pop("bemain_irg"); } ir_profile_free(); @@ -903,7 +818,7 @@ void be_main(FILE *file_handle, const char *cup_name) } if (be_options.timing == BE_TIME_ON) { - t = ir_timer_register("bemain", "measure complete bemain loop"); + t = ir_timer_new(); if (ir_timer_enter_high_priority()) { fprintf(stderr, "Warning: Could not enter high priority mode.\n"); @@ -926,9 +841,6 @@ void be_main(FILE *file_handle, const char *cup_name) } #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) { @@ -937,7 +849,8 @@ void be_main(FILE *file_handle, const char *cup_name) stat_ev_if { stat_ev_dbl("bemain_backend_time", ir_timer_elapsed_msec(t)); } else { - printf("%-20s: %lu msec\n", "BEMAINLOOP", ir_timer_elapsed_msec(t)); + double val = ir_timer_elapsed_usec(t) / 1000.0; + printf("%-20s: %8.3lf msec\n", "BEMAINLOOP", val); } } @@ -949,7 +862,25 @@ void be_main(FILE *file_handle, const char *cup_name) #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); @@ -959,7 +890,7 @@ unsigned be_put_ignore_regs(const be_irg_t *birg, const arch_register_class_t *c 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_popcnt(bs); + return bitset_popcount(bs); }