X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbelower.c;h=89a6a0d7e9fdee0eb4cd9d3715ebe384515863e3;hb=0bb48fb75186cf78daef09c5fbcc204a18d73561;hp=8064401f54b7b7381f6f878be906d65b58f18190;hpb=0fe38ba39822b52828d5ff1a312215c0e59b87f0;p=libfirm diff --git a/ir/be/belower.c b/ir/be/belower.c index 8064401f5..89a6a0d7e 100644 --- a/ir/be/belower.c +++ b/ir/be/belower.c @@ -15,34 +15,47 @@ #include "ircons.h" #include "debug.h" +#include "irhooks.h" #include "bearch.h" #include "belower.h" #include "benode_t.h" #include "bechordal_t.h" #include "besched_t.h" +#include "bestat.h" #include "irgmod.h" #include "iredges_t.h" #include "irgwalk.h" -#ifdef _WIN32 -#include -#else -#include +#ifdef HAVE_MALLOC_H + #include +#endif +#ifdef HAVE_ALLOCA_H + #include #endif #undef is_Perm -#define is_Perm(arch_env, irn) (arch_irn_classify(arch_env, irn) == arch_irn_class_perm) +#define is_Perm(arch_env, irn) (arch_irn_class_is(arch_env, irn, perm)) + +/* associates op with it's copy and CopyKeep */ +typedef struct { + ir_node *op; /* an irn which must be different */ + pset *copies; /* all non-spillable copies of this irn */ +} op_copy_assoc_t; -#undef is_Call -#define is_Call(arch_env, irn) (arch_irn_classify(arch_env, irn) == arch_irn_class_call) +/* environment for constraints */ +typedef struct { + be_irg_t *birg; + pset *op_set; + struct obstack obst; +} constraint_env_t; /* lowering walker environment */ typedef struct _lower_env_t { be_chordal_env_t *chord_env; - int do_copy; - firm_dbg_module_t *dbg_module; + unsigned do_copy:1; + DEBUG_ONLY(firm_dbg_module_t *dbg_module;) } lower_env_t; /* holds a perm register pair */ @@ -70,6 +83,14 @@ typedef struct _perm_cycle_t { perm_type_t type; /**< type (CHAIN or CYCLE) */ } perm_cycle_t; +/* Compare the two operands */ +static int cmp_op_copy_assoc(const void *a, const void *b) { + const op_copy_assoc_t *op1 = a; + const op_copy_assoc_t *op2 = b; + + return op1->op != op2->op; +} + /* Compare the in registers of two register pairs */ static int compare_reg_pair(const void *a, const void *b) { const reg_pair_t *pair_a = a; @@ -247,19 +268,21 @@ static perm_cycle_t *get_perm_cycle(perm_cycle_t *cycle, reg_pair_t *pairs, int static void lower_perm_node(ir_node *irn, void *walk_env) { const arch_register_class_t *reg_class; const arch_env_t *arch_env; - firm_dbg_module_t *mod; - lower_env_t *env = walk_env; + lower_env_t *env = walk_env; + int real_size = 0; + int keep_perm = 0; + int n, i, pn, do_copy, j, n_ops; reg_pair_t *pairs; const ir_edge_t *edge; perm_cycle_t *cycle; - int n, i, pn, do_copy, j; ir_node *sched_point, *block, *in[2]; ir_node *arg1, *arg2, *res1, *res2; ir_node *cpyxchg = NULL; + DEBUG_ONLY(firm_dbg_module_t *mod;) arch_env = env->chord_env->birg->main_env->arch_env; do_copy = env->do_copy; - mod = env->dbg_module; + DEBUG_ONLY(mod = env->dbg_module;) block = get_nodes_block(irn); /* @@ -324,9 +347,13 @@ static void lower_perm_node(ir_node *irn, void *walk_env) { do_copy = 0; } + real_size = n - get_n_checked_pairs(pairs, n); + + be_do_stat_perm(reg_class->name, reg_class->n_regs, irn, block, n, real_size); + /* check for cycles and chains */ while (get_n_checked_pairs(pairs, n) < n) { - i = 0; + i = n_ops = 0; /* go to the first not-checked pair */ while (pairs[i].checked) i++; @@ -339,11 +366,14 @@ static void lower_perm_node(ir_node *irn, void *walk_env) { } DB((mod, LEVEL_1, "\n")); - /* We don't need to do anything if we have a Perm with two + /* + We don't need to do anything if we have a Perm with two elements which represents a cycle, because those nodes - already represent exchange nodes */ + already represent exchange nodes + */ if (n == 2 && cycle->type == PERM_CYCLE) { free(cycle); + keep_perm = 1; continue; } @@ -357,7 +387,6 @@ static void lower_perm_node(ir_node *irn, void *walk_env) { res1 = get_node_for_register(pairs, n, cycle->elems[i], 1); res2 = get_node_for_register(pairs, n, cycle->elems[i + 1], 1); - /* If we have a cycle and don't copy: we need to create exchange nodes NOTE: An exchange node is a perm node with 2 INs and 2 OUTs @@ -403,22 +432,23 @@ static void lower_perm_node(ir_node *irn, void *walk_env) { irn, res1, cycle->elems[i]->name, res2, cycle->elems[i + 1]->name)); cpyxchg = be_new_Perm(reg_class, env->chord_env->irg, block, 2, in); + n_ops++; if (i > 0) { /* cycle is not done yet */ int pidx = get_pairidx_for_regidx(pairs, n, cycle->elems[i]->index, 0); /* create intermediate proj */ - res2 = new_r_Proj(get_irn_irg(irn), block, cpyxchg, get_irn_mode(res1), 0); + res1 = new_r_Proj(get_irn_irg(irn), block, cpyxchg, get_irn_mode(res1), 0); /* set as in for next Perm */ - pairs[pidx].in_node = res2; + pairs[pidx].in_node = res1; } else { - sched_remove(res2); + sched_remove(res1); } - sched_remove(res1); + sched_remove(res2); set_Proj_pred(res2, cpyxchg); set_Proj_proj(res2, 0); @@ -430,6 +460,14 @@ static void lower_perm_node(ir_node *irn, void *walk_env) { arch_set_irn_register(arch_env, res2, cycle->elems[i + 1]); arch_set_irn_register(arch_env, res1, cycle->elems[i]); + + /* insert the copy/exchange node in schedule after the magic schedule node (see above) */ + sched_add_after(sched_point, cpyxchg); + + DBG((mod, LEVEL_1, "replacing %+F with %+F, placed new node after %+F\n", irn, cpyxchg, sched_point)); + + /* set the new scheduling point */ + sched_point = res1; } else { DBG((mod, LEVEL_1, "%+F creating copy node (%+F, %s) -> (%+F, %s)\n", @@ -437,28 +475,233 @@ static void lower_perm_node(ir_node *irn, void *walk_env) { cpyxchg = be_new_Copy(reg_class, env->chord_env->irg, block, arg1); arch_set_irn_register(arch_env, cpyxchg, cycle->elems[i + 1]); + n_ops++; /* remove the proj from the schedule */ sched_remove(res2); /* exchange copy node and proj */ exchange(res2, cpyxchg); - } - /* insert the copy/exchange node in schedule after the magic schedule node (see above) */ - sched_add_after(sched_point, cpyxchg); - /* set the new scheduling point */ - sched_point = cpyxchg; + /* insert the copy/exchange node in schedule after the magic schedule node (see above) */ + sched_add_after(sched_point, cpyxchg); - DBG((mod, LEVEL_1, "replacing %+F with %+F, placed new node after %+F\n", irn, cpyxchg, sched_point)); + /* set the new scheduling point */ + sched_point = cpyxchg; + } } + be_do_stat_permcycle(reg_class->name, irn, block, cycle->type == PERM_CHAIN, cycle->n_elems, n_ops); + free((void *) cycle->elems); free(cycle); } /* remove the perm from schedule */ - sched_remove(irn); + if (! keep_perm) + sched_remove(irn); +} + + + +static int get_n_out_edges(const ir_node *irn) { + const ir_edge_t *edge; + int cnt = 0; + + foreach_out_edge(irn, edge) { + cnt++; + } + + return cnt; +} + +static ir_node *belower_skip_proj(ir_node *irn) { + while(is_Proj(irn)) + irn = get_Proj_pred(irn); + return irn; +} + +static void gen_assure_different_pattern(ir_node *irn, ir_node *other_different, constraint_env_t *env) { + be_irg_t *birg = env->birg; + pset *op_set = env->op_set; + const arch_env_t *arch_env = birg->main_env->arch_env; + ir_node *block = get_nodes_block(irn); + const arch_register_class_t *cls = arch_get_irn_reg_class(arch_env, other_different, -1); + ir_node *in[2], *keep, *cpy; + op_copy_assoc_t key, *entry; + FIRM_DBG_REGISTER(firm_dbg_module_t *mod, "firm.be.lower"); + + if (arch_irn_is(arch_env, other_different, ignore) || ! mode_is_datab(get_irn_mode(other_different))) { + DBG((mod, LEVEL_1, "ignore constraint for %+F because other_irn is ignore or not a datab node\n", irn)); + return; + } + + /* Make a not spillable copy of the different node */ + /* this is needed because the different irn could be */ + /* in block far far away */ + /* The copy is optimized later if not needed */ + + cpy = be_new_Copy(cls, birg->irg, block, other_different); + be_node_set_flags(cpy, BE_OUT_POS(0), arch_irn_flags_dont_spill); + + in[0] = irn; + in[1] = cpy; + + /* Add the Keep resp. CopyKeep and reroute the users */ + /* of the other_different irn in case of CopyKeep. */ + if (get_n_out_edges(other_different) == 0) { + keep = be_new_Keep(cls, birg->irg, block, 2, in); + } + else { + keep = be_new_CopyKeep_single(cls, birg->irg, block, cpy, irn, get_irn_mode(other_different)); + be_node_set_reg_class(keep, 1, cls); + } + + /* let the copy point to the other_different irn */ + set_irn_n(cpy, 0, other_different); + + /* insert copy and keep into schedule */ + assert(sched_is_scheduled(irn) && "need schedule to assure constraints"); + sched_add_before(belower_skip_proj(irn), cpy); + sched_add_after(irn, keep); + + /* insert the other different and it's copies into the set */ + key.op = other_different; + key.copies = NULL; + entry = pset_find(op_set, &key, HASH_PTR(other_different)); + + if (! entry) { + entry = obstack_alloc(&env->obst, sizeof(*entry)); + entry->copies = pset_new_ptr_default(); + entry->op = other_different; + } + + /* insert copy */ + pset_insert_ptr(entry->copies, cpy); + + /* insert keep in case of CopyKeep */ + if (be_is_CopyKeep(keep)) + pset_insert_ptr(entry->copies, keep); + + pset_insert(op_set, entry, HASH_PTR(other_different)); + + DBG((mod, LEVEL_1, "created %+F for %+F to assure should_be_different\n", keep, irn)); +} + +/** + * Checks if node has a should_be_different constraint in output + * and adds a Keep then to assure the constraint. + */ +static void assure_different_constraints(ir_node *irn, constraint_env_t *env) { + const arch_register_req_t *req; + arch_register_req_t req_temp; + + req = arch_get_register_req(env->birg->main_env->arch_env, &req_temp, irn, -1); + + if (req) { + if (arch_register_req_is(req, should_be_different)) { + gen_assure_different_pattern(irn, req->other_different, env); + } + else if (arch_register_req_is(req, should_be_different_from_all)) { + int i, n = get_irn_arity(belower_skip_proj(irn)); + for (i = 0; i < n; i++) { + gen_assure_different_pattern(irn, get_irn_n(belower_skip_proj(irn), i), env); + } + } + } +} + + + +/** + * Calls the functions to assure register constraints. + * + * @param irn The node to be checked for lowering + * @param walk_env The walker environment + */ +static void assure_constraints_walker(ir_node *irn, void *walk_env) { + if (is_Block(irn)) + return; + + if (mode_is_datab(get_irn_mode(irn))) + assure_different_constraints(irn, walk_env); + + return; +} + + + +/** + * Walks over all nodes to assure register constraints. + * + * @param birg The birg structure containing the irg + */ +void assure_constraints(be_irg_t *birg) { + constraint_env_t cenv; + op_copy_assoc_t *entry; + dom_front_info_t *dom; + ir_node **nodes; + FIRM_DBG_REGISTER(firm_dbg_module_t *mod, "firm.be.lower"); + + cenv.birg = birg; + cenv.op_set = new_pset(cmp_op_copy_assoc, 16); + obstack_init(&cenv.obst); + + irg_walk_blkwise_graph(birg->irg, NULL, assure_constraints_walker, &cenv); + + /* introduce copies needs dominance information */ + dom = be_compute_dominance_frontiers(birg->irg); + + /* for all */ + foreach_pset(cenv.op_set, entry) { + int n; + ir_node *cp; + + n = pset_count(entry->copies); + nodes = alloca((n + 1) * sizeof(nodes[0])); + + /* put the node in an array */ + n = 0; + nodes[n++] = entry->op; + DBG((mod, LEVEL_1, "introduce copies for %+F ", entry->op)); + + /* collect all copies */ + foreach_pset(entry->copies, cp) { + nodes[n++] = cp; + DB((mod, LEVEL_1, ", %+F ", cp)); + } + + DB((mod, LEVEL_1, "\n")); + + /* introduce the copies for the operand and it's copies */ + be_ssa_constr(dom, NULL, n, nodes); + + + /* Could be that not all CopyKeeps are really needed, */ + /* so we transform unnecessary ones into Keeps. */ + foreach_pset(entry->copies, cp) { + if (be_is_CopyKeep(cp) && get_irn_n_edges(cp) < 1) { + ir_node *keep; + int n = get_irn_arity(cp); + + keep = be_new_Keep(arch_get_irn_reg_class(birg->main_env->arch_env, cp, -1), + birg->irg, get_nodes_block(cp), n, (ir_node **)&get_irn_in(cp)[1]); + sched_add_before(cp, keep); + sched_remove(cp); + + /* Set all ins (including the block) of the CopyKeep BAD to keep the verifier happy. */ + while (--n >= -1) + set_irn_n(cp, n, get_irg_bad(birg->irg)); + } + } + + del_pset(entry->copies); + } + + be_free_dominance_frontiers(dom); + + del_pset(cenv.op_set); + obstack_free(&cenv.obst, NULL); } @@ -482,11 +725,9 @@ static void lower_nodes_after_ra_walker(ir_node *irn, void *walk_env) { return; } - - /** * Walks over all blocks in an irg and performs lowering need to be - * done after register allocation (e.g. perm and spill/reload lowering). + * done after register allocation (e.g. perm lowering). * * @param chord_env The chordal environment containing the irg * @param do_copy 1 == resolve cycles with a free reg if available @@ -496,10 +737,9 @@ void lower_nodes_after_ra(be_chordal_env_t *chord_env, int do_copy) { env.chord_env = chord_env; env.do_copy = do_copy; - env.dbg_module = firm_dbg_register("firm.be.lower"); + FIRM_DBG_REGISTER(env.dbg_module, "firm.be.lower"); irg_walk_blkwise_graph(chord_env->irg, NULL, lower_nodes_after_ra_walker, &env); } #undef is_Perm -#undef is_Call