X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbemain.c;h=48a95ed0f76c906510bae81ffb5e180d4eb03d3a;hb=5fdf36990149cafa4483342df0d6a88ac46a71cc;hp=4dde352a126b8f160553a5cc42ea5adc84db8076;hpb=bb4b701ebadcf132a2a6637f41db3c845d51de78;p=libfirm diff --git a/ir/be/bemain.c b/ir/be/bemain.c index 4dde352a1..48a95ed0f 100644 --- a/ir/be/bemain.c +++ b/ir/be/bemain.c @@ -1,5 +1,5 @@ /* - * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved. + * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved. * * This file is part of libFirm. * @@ -22,7 +22,6 @@ * @brief Main Backend driver. * @author Sebastian Hack * @date 25.11.2004 - * @version $Id$ */ #include "config.h" @@ -34,7 +33,7 @@ #include "obst.h" #include "bitset.h" - +#include "statev.h" #include "irprog.h" #include "irgopt.h" #include "irgraph.h" @@ -43,15 +42,18 @@ #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 "execfreq_t.h" #include "irprofile.h" +#include "irpass_t.h" +#include "ircons.h" #include "bearch.h" #include "be_t.h" +#include "begnuas.h" #include "bemodule.h" #include "beutil.h" #include "benode.h" @@ -62,45 +64,35 @@ #include "bera.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" -#include "beschedmris.h" #include "bestat.h" #include "beverify.h" -#include "be_dbgout.h" #include "beirg.h" +#include "bestack.h" +#include "beemitter.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 = { +be_options_t be_options = { DUMP_NONE, /* dump flags */ BE_TIME_OFF, /* no timing */ - 0, /* no opt profile */ + false, /* profile_generate */ + false, /* profile_use */ 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 */ - "linux", /* target OS name */ - "i44pc52.info.uni-karlsruhe.de", /* ilp server */ - "cplex", /* ilp solver */ + BE_VERIFY_WARN, /* verification level: warn */ + "", /* ilp server */ + "", /* ilp solver */ 0, /* enable statistic event dumping */ "", /* print stat events */ + 1, /* verbose assembler output */ }; -/* config file. */ -static char config_file[256] = { 0 }; - /* back end instruction set architecture to use */ static const arch_isa_if_t *isa_if = NULL; @@ -119,62 +111,58 @@ 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_INT ("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 ("profilegenerate", "instrument the code for execution count profiling", &be_options.opt_profile_generate), + LC_OPT_ENT_BOOL ("profileuse", "use existing profile data", &be_options.opt_profile_use), LC_OPT_ENT_BOOL ("statev", "dump statistic events", &be_options.statev), - LC_OPT_ENT_STR ("filtev", "filter for stat events (regex if support is active", &be_options.filtev, sizeof(be_options.filtev)), -#endif + LC_OPT_ENT_STR ("filtev", "filter for stat events (regex if support is active", be_options.filtev), + LC_OPT_ENT_BOOL ("verboseasm", "enable verbose assembler output", &be_options.verbose_asm), -#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 */ + LC_OPT_ENT_STR("ilp.server", "the ilp server name", be_options.ilp_server), + LC_OPT_ENT_STR("ilp.solver", "the ilp solver name", be_options.ilp_solver), LC_OPT_LAST }; -static be_module_list_entry_t *isa_ifs = NULL; +static be_module_list_entry_t *isa_ifs = NULL; +static bool isa_initialized = false; +asm_constraint_flags_t asm_constraint_flags[256]; -unsigned short asm_constraint_flags[256]; +static void initialize_isa(void) +{ + if (isa_initialized) + return; + isa_if->init(); + isa_initialized = true; +} + +static void finish_isa(void) +{ + if (isa_initialized) { + isa_if->finish(); + isa_initialized = false; + } +} void be_init_default_asm_constraint_flags(void) { @@ -239,15 +227,17 @@ void be_init_default_asm_constraint_flags(void) asm_constraint_flags_t be_parse_asm_constraints(const char *constraint) { - asm_constraint_flags_t flags = 0; + asm_constraint_flags_t flags = ASM_CONSTRAINT_FLAG_NONE; const char *c; asm_constraint_flags_t tflags; + initialize_isa(); + for (c = constraint; *c != '\0'; ++c) { switch (*c) { case '#': /* 'comment' stuff */ - while(*c != 0 && *c != ',') + while (*c != 0 && *c != ',') ++c; break; case '*': @@ -271,11 +261,11 @@ asm_constraint_flags_t be_parse_asm_constraints(const char *constraint) } 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; } @@ -292,6 +282,8 @@ asm_constraint_flags_t be_parse_asm_constraints(const char *constraint) int be_is_valid_clobber(const char *clobber) { + initialize_isa(); + /* memory is a valid clobber. (the frontend has to detect this case too, * because it has to add memory edges to the asm) */ if (strcmp(clobber, "memory") == 0) @@ -311,7 +303,7 @@ void be_register_isa_if(const char *name, const arch_isa_if_t *isa) be_add_module_to_list(&isa_ifs, name, (void*) isa); } -void be_opt_register(void) +static void be_opt_register(void) { lc_opt_entry_t *be_grp; static int run_once = 0; @@ -330,7 +322,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); @@ -339,27 +332,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."); } } @@ -373,15 +352,45 @@ void firm_be_init(void) /* Finalize the Firm backend. */ void firm_be_finish(void) { + finish_isa(); be_quit_modules(); } /* 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; + initialize_isa(); + return isa_if->get_params(); +} + +int be_is_big_endian(void) +{ + return be_get_backend_param()->byte_order_big_endian; +} + +unsigned be_get_machine_size(void) +{ + return be_get_backend_param()->machine_size; +} + +ir_mode *be_get_mode_float_arithmetic(void) +{ + return be_get_backend_param()->mode_float_arithmetic; +} + +ir_type *be_get_type_long_long(void) +{ + return be_get_backend_param()->type_long_long; +} + +ir_type *be_get_type_unsigned_long_long(void) +{ + return be_get_backend_param()->type_unsigned_long_long; +} + +ir_type *be_get_type_long_double(void) +{ + return be_get_backend_param()->type_long_double; } /** @@ -390,23 +399,20 @@ const backend_params *be_get_backend_param(void) * @param env an empty environment * @param file_handle the file handle where the output will be written to */ -static be_main_env_t *be_init_env(be_main_env_t *env, FILE *file_handle) +static be_main_env_t *be_init_env(be_main_env_t *const env, char const *const compilation_unit_name) { memset(env, 0, sizeof(*env)); - env->options = &be_options; env->ent_trampoline_map = pmap_create(); env->pic_trampolines_type = new_type_class(NEW_ID("$PIC_TRAMPOLINE_TYPE")); env->ent_pic_symbol_map = pmap_create(); env->pic_symbols_type = new_type_struct(NEW_ID("$PIC_SYMBOLS_TYPE")); + env->cup_name = compilation_unit_name; + env->arch_env = isa_if->begin_codegeneration(); - remove_irp_type(env->pic_trampolines_type); - remove_irp_type(env->pic_symbols_type); set_class_final(env->pic_trampolines_type, 1); memset(asm_constraint_flags, 0, sizeof(asm_constraint_flags)); - env->arch_env = arch_env_init(isa_if, file_handle, env); - be_dbg_open(); return env; } @@ -415,9 +421,6 @@ static be_main_env_t *be_init_env(be_main_env_t *env, FILE *file_handle) */ static void be_done_env(be_main_env_t *env) { - arch_env_done(env->arch_env); - be_dbg_close(); - pmap_destroy(env->ent_trampoline_map); pmap_destroy(env->ent_pic_symbol_map); free_type(env->pic_trampolines_type); @@ -433,36 +436,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); + birg->lv = be_liveness_new(irg); - edges_deactivate_kind(irg, EDGE_KIND_DEP); - edges_activate_kind(irg, EDGE_KIND_DEP); - - dump(DUMP_INITIAL, irg, "-begin", dump_ir_block_graph); + edges_deactivate(irg); + edges_activate(irg); /* 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); @@ -470,17 +472,18 @@ static void initialize_birg(be_irg_t *birg, ir_graph *irg, be_main_env_t *env) /* Remove critical edges */ remove_critical_cf_edges_ex(irg, /*ignore_exception_edges=*/0); + /* For code generation all unreachable code and Bad nodes should be gone */ + remove_unreachable_code(irg); + remove_bads(irg); + /* Ensure, that the ir_edges are computed. */ - edges_assure(irg); + assure_edges(irg); - 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; static const char *get_timer_name(be_timer_id_t id) @@ -499,7 +502,6 @@ static const char *get_timer_name(be_timer_id_t id) 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"; @@ -514,6 +516,21 @@ static const char *get_timer_name(be_timer_id_t id) } ir_timer_t *be_timers[T_LAST+1]; +void be_lower_for_target(void) +{ + size_t i; + + initialize_isa(); + + isa_if->lower_for_target(); + /* set the phase to low */ + for (i = get_irp_n_irgs(); i > 0;) { + ir_graph *irg = get_irp_irg(--i); + assert(!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_TARGET_LOWERED)); + add_irg_constraints(irg, IR_GRAPH_CONSTRAINT_TARGET_LOWERED); + } +} + /** * The Firm backend main loop. * Do architecture specific lowering for all graphs @@ -526,86 +543,105 @@ static void be_main_loop(FILE *file_handle, const char *cup_name) { static const char suffix[] = ".prof"; - int i, num_birgs, stat_active = 0; + size_t i; + size_t num_irgs; + size_t num_birgs; be_main_env_t env; char prof_filename[256]; be_irg_t *birgs; - ir_graph **irg_list, **backend_irg_list; arch_env_t *arch_env; be_timing = (be_options.timing == BE_TIME_ON); + /* perform target lowering if it didn't happen yet */ + if (get_irp_n_irgs() > 0 && !irg_is_constrained(get_irp_irg(0), IR_GRAPH_CONSTRAINT_TARGET_LOWERED)) + be_lower_for_target(); + if (be_timing) { for (i = 0; i < T_LAST+1; ++i) { be_timers[i] = ir_timer_new(); } } - be_init_env(&env, file_handle); - env.cup_name = cup_name; + be_init_env(&env, cup_name); - be_dbg_so(cup_name); - be_dbg_types(); + be_emit_init(file_handle); + be_gas_begin_compilation_unit(&env); arch_env = env.arch_env; - /* 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_env_get_backend_irg_list(arch_env, &irg_list); - /* we might need 1 birg more for instrumentation constructor */ - num_birgs = backend_irg_list ? ARR_LEN(backend_irg_list) : get_irp_n_irgs(); - birgs = ALLOCAN(be_irg_t, num_birgs + 1); + num_irgs = get_irp_n_irgs(); + birgs = ALLOCAN(be_irg_t, num_irgs + 1); be_info_init(); /* First: initialize all birgs */ - 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); + num_birgs = 0; + for (i = 0; i < num_irgs; ++i) { + ir_graph *irg = get_irp_irg(i); + ir_entity *entity = get_irg_entity(irg); + if (get_entity_linkage(entity) & IR_LINKAGE_NO_CODEGEN) + continue; + initialize_birg(&birgs[num_birgs++], irg, &env); } arch_env_handle_intrinsics(arch_env); - DEL_ARR_F(irg_list); /* Get the filename for the profiling data. Beware: '\0' is already included in sizeof(suffix) */ - memset(prof_filename, 0, sizeof(prof_filename)); - strncpy(prof_filename, cup_name, sizeof(prof_filename) - sizeof(suffix)); - strcat(prof_filename, suffix); + sprintf(prof_filename, "%.*s%s", + (int)(sizeof(prof_filename) - sizeof(suffix)), cup_name, suffix); + + bool have_profile = false; + if (be_options.opt_profile_use) { + bool res = ir_profile_read(prof_filename); + if (!res) { + fprintf(stderr, "Warning: Couldn't read profile data '%s'\n", + prof_filename); + } else { + ir_create_execfreqs_from_profile(); + ir_profile_free(); + have_profile = true; + } + } - /* - Next: Either instruments all irgs with profiling code - or try to read in profile data for current translation unit. - */ - if (be_options.opt_profile) { - ir_graph *prof_init_irg = ir_profile_instrument(prof_filename, profile_default); + if (num_birgs > 0 && be_options.opt_profile_generate) { + ir_graph *const prof_init_irg = ir_profile_instrument(prof_filename); + assert(prof_init_irg->be_data == NULL); initialize_birg(&birgs[num_birgs], prof_init_irg, &env); num_birgs++; - } else { - ir_profile_read(prof_filename); + num_irgs++; + assert(num_irgs == get_irp_n_irgs()); } -#ifdef FIRM_STATISTICS - stat_active = stat_is_active(); -#endif /* FIRM_STATISTICS */ + for (be_timer_id_t t = T_FIRST; t < T_LAST+1; ++t) { + ir_timer_init_parent(be_timers[t]); + } + if (!have_profile) { + be_timer_push(T_EXECFREQ); + for (i = 0; i < num_irgs; ++i) { + ir_graph *irg = get_irp_irg(i); + ir_estimate_execfreq(irg); + } + be_timer_pop(T_EXECFREQ); + } /* For all graphs */ - for (i = 0; i < num_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; + for (i = 0; i < num_irgs; ++i) { + ir_graph *const irg = get_irp_irg(i); + ir_entity *const entity = get_irg_entity(irg); + if (get_entity_linkage(entity) & IR_LINKAGE_NO_CODEGEN) + continue; /* set the current graph (this is important for several firm functions) */ current_ir_graph = irg; - stat_ev_if { - stat_ev_ctx_push_fobj("bemain_irg", irg); - be_stat_ev("bemain_insns_start", be_count_insns(irg)); - be_stat_ev("bemain_blocks_start", be_count_blocks(irg)); + if (stat_ev_enabled) { + stat_ev_ctx_push_fmt("bemain_irg", "%+F", irg); + stat_ev_ull("bemain_insns_start", be_count_insns(irg)); + stat_ev_ull("bemain_blocks_start", be_count_blocks(irg)); } /* stop and reset timers */ @@ -613,198 +649,134 @@ static void be_main_loop(FILE *file_handle, const char *cup_name) /* Verify the initial graph */ be_timer_push(T_VERIFY); - if (be_options.vrfy_option == BE_VRFY_WARN) { - irg_verify(irg, VRFY_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"); - assert(be_check_dominance(irg) && "Dominance verification failed"); + if (be_options.verify_option == BE_VERIFY_WARN) { + irg_verify(irg, VERIFY_ENFORCE_SSA); + } else if (be_options.verify_option == BE_VERIFY_ASSERT) { + assert(irg_verify(irg, VERIFY_ENFORCE_SSA) && "irg verification failed"); } be_timer_pop(T_VERIFY); - /* Get the code generator interface. */ - cg_if = arch_env_get_code_generator_if(arch_env); - /* get a code generator for this graph. */ - birg->cg = cg_if->init(birg); + if (arch_env->impl->init_graph) + 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); - - dump(DUMP_ABI, irg, "-abi", dump_ir_block_graph); + if (!arch_env->custom_abi) { + be_timer_push(T_ABI); + be_abi_introduce(irg); + be_timer_pop(T_ABI); + dump(DUMP_ABI, irg, "abi"); + } - /* do local optimizations */ + /* We can't have Bad-blocks or critical edges in the backend. + * Before removing Bads, we remove unreachable code. */ optimize_graph_df(irg); - - /* 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); + remove_bads(irg); - /* TODO: 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) - */ + /* 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, "-pre_transform", dump_ir_block_graph_sched); + dump(DUMP_PREPARED, irg, "before-code-selection"); - 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 */ + /* perform codeselection */ be_timer_push(T_CODEGEN); - arch_code_generator_prepare_graph(birg->cg); + 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) { - 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"); - } - - be_timer_push(T_EXECFREQ); - /** - * Create execution frequencies from profile data or estimate some - */ - if (ir_profile_has_data()) - birg->exec_freq = ir_create_execfreqs_from_profile(irg); - else { - /* TODO: edges are corrupt for EDGE_KIND_BLOCK after the local - * optimize graph phase merges blocks in the x86 backend */ - edges_deactivate(irg); - birg->exec_freq = compute_execfreq(irg, 10); - } - be_timer_pop(T_EXECFREQ); - + dump(DUMP_PREPARED, irg, "code-selection"); /* 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_schedule_graph(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_sched_verify(irg, be_options.verify_option); be_timer_pop(T_VERIFY); /* introduce patterns to assure constraints */ be_timer_push(T_CONSTR); /* we switch off optimizations here, because they might cause trouble */ + optimization_state_t state; 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); + 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); + 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_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_sched_verify(irg, be_options.verify_option); be_timer_pop(T_VERIFY); - stat_ev_if { - stat_ev_dbl("bemain_costs_before_ra", - be_estimate_irg_costs(irg, birg->exec_freq)); - be_stat_ev("bemain_insns_before_ra", be_count_insns(irg)); - be_stat_ev("bemain_blocks_before_ra", be_count_blocks(irg)); + if (stat_ev_enabled) { + stat_ev_dbl("bemain_costs_before_ra", be_estimate_irg_costs(irg)); + stat_ev_ull("bemain_insns_before_ra", be_count_insns(irg)); + stat_ev_ull("bemain_blocks_before_ra", be_count_blocks(irg)); } /* 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 + stat_ev_dbl("bemain_costs_before_ra", be_estimate_irg_costs(irg)); - 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); + if (arch_env->impl->finish_graph != NULL) + arch_env->impl->finish_graph(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); - - dump(DUMP_SCHED, irg, "-fix_stack_after_ra", dump_ir_block_graph_sched); + dump(DUMP_FINAL, irg, "finish"); - be_timer_push(T_FINISH); - arch_code_generator_finish(birg->cg); - be_timer_pop(T_FINISH); - - dump(DUMP_FINAL, irg, "-finish", dump_ir_block_graph_sched); - - stat_ev_if { - be_stat_ev("bemain_insns_finish", be_count_insns(irg)); - be_stat_ev("bemain_blocks_finish", be_count_blocks(irg)); + if (stat_ev_enabled) { + stat_ev_ull("bemain_insns_finish", be_count_insns(irg)); + stat_ev_ull("bemain_blocks_finish", be_count_blocks(irg)); } /* 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_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"); - assert(be_check_dominance(irg) && "Dominance verification failed"); - assert(be_verify_schedule(birg) && "Schedule verification failed"); - assert(be_verify_register_allocation(birg) + if (be_options.verify_option == BE_VERIFY_WARN) { + irg_verify(irg, VERIFY_ENFORCE_SSA); + 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_verify_schedule(irg) && "Schedule verification failed"); + assert(be_verify_register_allocation(irg) && "register allocation verification failed"); } @@ -812,23 +784,20 @@ static void be_main_loop(FILE *file_handle, const char *cup_name) /* emit assembler code */ be_timer_push(T_EMIT); - arch_code_generator_done(birg->cg); + 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); - - be_timer_push(T_ABI); - be_abi_free(birg->abi); - be_timer_pop(T_ABI); + dump(DUMP_FINAL, irg, "end"); restore_optimization_state(&state); be_timer_pop(T_OTHER); if (be_timing) { - int t; + be_timer_id_t t; if (stat_ev_enabled) { - for (t = 0; t < T_LAST+1; ++t) { + for (t = T_FIRST; t < T_LAST+1; ++t) { char buf[128]; snprintf(buf, sizeof(buf), "bemain_time_%s", get_timer_name(t)); @@ -837,21 +806,25 @@ static void be_main_loop(FILE *file_handle, const char *cup_name) } else { printf("==>> IRG %s <<==\n", get_entity_name(get_irg_entity(irg))); - for (t = 0; t < T_LAST+1; ++t) { + for (t = T_FIRST; 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); + printf("%-20s: %10.3f msec\n", get_timer_name(t), val); } } - for (t = 0; t < T_LAST+1; ++t) { - ir_timer_stop(be_timers[t]); + for (t = T_FIRST; t < T_LAST+1; ++t) { ir_timer_reset(be_timers[t]); } } - be_free_birg(birg); + be_free_birg(irg); stat_ev_ctx_pop("bemain_irg"); } - ir_profile_free(); + + be_gas_end_compilation_unit(&env); + be_emit_exit(); + + arch_env_end_codegeneration(arch_env); + be_done_env(&env); be_info_free(); @@ -862,18 +835,6 @@ void be_main(FILE *file_handle, const char *cup_name) { ir_timer_t *t = NULL; - /* The user specified another config file to read. do that now. */ - if (config_file[0] != '\0') { - FILE *f = fopen(config_file, "rt"); - - if (f != NULL) { - lc_opt_from_file(config_file, f, NULL); - fclose(f); - } else { - fprintf(stderr, "Warning: Cannot open config file '%s'\n", config_file); - } - } - if (be_options.timing == BE_TIME_ON) { t = ir_timer_new(); @@ -884,7 +845,6 @@ void be_main(FILE *file_handle, const char *cup_name) ir_timer_reset_and_start(t); } -#ifdef FIRM_STATISTICS if (be_options.statev) { const char *dot = strrchr(cup_name, '.'); const char *pos = dot ? dot : cup_name + strlen(cup_name); @@ -896,43 +856,38 @@ void be_main(FILE *file_handle, const char *cup_name) stat_ev_begin(buf, be_options.filtev); stat_ev_ctx_push_str("bemain_compilation_unit", 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) { ir_timer_stop(t); ir_timer_leave_high_priority(); - stat_ev_if { + if (stat_ev_enabled) { stat_ev_dbl("bemain_backend_time", ir_timer_elapsed_msec(t)); } else { double val = ir_timer_elapsed_usec(t) / 1000.0; - printf("%-20s: %8.3lf msec\n", "BEMAINLOOP", val); + printf("%-20s: %10.3f msec\n", "BEMAINLOOP", val); } } -#ifdef FIRM_STATISTICS if (be_options.statev) { stat_ev_ctx_pop("bemain_compilation_unit"); stat_ev_end(); } -#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) { - if (bs == NULL) - bs = bitset_alloca(cls->n_regs); - else - bitset_clear_all(bs); - - 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_lower_for_target(); + (void) context; + (void) irp; + return 0; +} - return bitset_popcnt(bs); +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); }