X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbelower.c;h=45ea686bc1df9e65207d2d6a2b0fbd3be0199c11;hb=17e47394fa72025d14172a2acef2d258a067aa42;hp=1aae93a4256760293bdeb519036b5f6a3aeddc4c;hpb=ef1c86d10bb0a7c3284d81231d8e60473995e5f7;p=libfirm diff --git a/ir/be/belower.c b/ir/be/belower.c index 1aae93a42..45ea686bc 100644 --- a/ir/be/belower.c +++ b/ir/be/belower.c @@ -11,19 +11,33 @@ #include "config.h" #endif +#include + +#include "ircons.h" +#include "debug.h" + #include "bearch.h" #include "belower.h" #include "benode_t.h" #include "bechordal_t.h" -#include "besched.h" +#include "besched_t.h" #include "irgmod.h" -#include "iredges.h" +#include "iredges_t.h" #include "irgwalk.h" +#ifdef _WIN32 +#include +#else +#include +#endif + #undef is_Perm #define is_Perm(arch_env, irn) (arch_irn_classify(arch_env, irn) == arch_irn_class_perm) +#undef is_Call +#define is_Call(arch_env, irn) (arch_irn_classify(arch_env, irn) == arch_irn_class_call) + /* lowering walker environment */ typedef struct _lower_env_t { be_chordal_env_t *chord_env; @@ -49,6 +63,7 @@ typedef enum _perm_type_t { PERM_COPY } perm_type_t; +/* structure to represent cycles or chains in a perm */ typedef struct _perm_cycle_t { const arch_register_t **elems; /**< the registers in the cycle */ int n_elems; /**< number of elements in the cycle */ @@ -66,6 +81,7 @@ static int compare_reg_pair(const void *a, const void *b) { return -1; } +/* returns the number register pairs marked as checked */ static int get_n_checked_pairs(reg_pair_t *pairs, int n) { int i, n_checked = 0; @@ -153,22 +169,36 @@ static perm_cycle_t *get_perm_cycle(perm_cycle_t *cycle, reg_pair_t *pairs, int int head = pairs[start].in_reg->index; int cur_idx = pairs[start].out_reg->index; int cur_pair_idx = start; - int n_pairs_done = get_n_checked_pairs(pairs, n) + 1; + int n_pairs_done = get_n_checked_pairs(pairs, n); int idx; + perm_type_t cycle_tp = PERM_CYCLE; + + /* We could be right in the middle of a chain, so we need to find the start */ + while (head != cur_idx) { + /* goto previous register in cycle or chain */ + cur_pair_idx = get_pairidx_for_regidx(pairs, n, head, 1); + + if (cur_pair_idx < 0) { + cycle_tp = PERM_CHAIN; + break; + } + else { + head = pairs[cur_pair_idx].in_reg->index; + start = cur_pair_idx; + } + } /* assume worst case: all remaining pairs build a cycle or chain */ - cycle->elems = calloc(n - n_pairs_done, sizeof(cycle->elems[0])); + cycle->elems = xcalloc((n - n_pairs_done) * 2, sizeof(cycle->elems[0])); cycle->n_elems = 2; /* initial number of elements is 2 */ cycle->elems[0] = pairs[start].in_reg; cycle->elems[1] = pairs[start].out_reg; - cycle->type = PERM_CHAIN; /* default is CHAIN, only changed when we found a cycle */ - - /* mark the first pair as checked */ - pairs[start].checked = 1; + cycle->type = cycle_tp; + cur_idx = pairs[start].out_reg->index; idx = 2; /* check for cycle or end of a chain */ - while (cur_idx != head && n_pairs_done < n) { + while (cur_idx != head) { /* goto next register in cycle or chain */ cur_pair_idx = get_pairidx_for_regidx(pairs, n, cur_idx, 0); @@ -181,16 +211,24 @@ static perm_cycle_t *get_perm_cycle(perm_cycle_t *cycle, reg_pair_t *pairs, int if (cur_idx != head) { cycle->elems[idx++] = pairs[cur_pair_idx].out_reg; cycle->n_elems++; - - n_pairs_done++; } else { /* we are there where we started -> CYCLE */ cycle->type = PERM_CYCLE; } + } - /* mark the pair as checked */ - pairs[cur_pair_idx].checked = 1; + /* mark all pairs having one in/out register with cycle in common as checked */ + for (idx = 0; idx < cycle->n_elems; idx++) { + cur_pair_idx = get_pairidx_for_regidx(pairs, n, cycle->elems[idx]->index, 0); + + if (cur_pair_idx >= 0) + pairs[cur_pair_idx].checked = 1; + + cur_pair_idx = get_pairidx_for_regidx(pairs, n, cycle->elems[idx]->index, 1); + + if (cur_pair_idx >= 0) + pairs[cur_pair_idx].checked = 1; } return cycle; @@ -199,13 +237,14 @@ static perm_cycle_t *get_perm_cycle(perm_cycle_t *cycle, reg_pair_t *pairs, int /** * Lowers a perm node. Resolves cycles and creates a bunch of * copy and swap operations to permute registers. + * Note: The caller of this function has to make sure, that irn + * is a Perm node. * * @param irn The perm node * @param block The block the perm node belongs to * @param walk_env The environment */ static void lower_perm_node(ir_node *irn, void *walk_env) { - const be_node_factory_t *fact; const arch_register_class_t *reg_class; const arch_env_t *arch_env; firm_dbg_module_t *mod; @@ -213,26 +252,16 @@ static void lower_perm_node(ir_node *irn, void *walk_env) { reg_pair_t *pairs; const ir_edge_t *edge; perm_cycle_t *cycle; - int n, i, pn, do_copy; + int n, i, pn, do_copy, j; ir_node *sched_point, *block, *in[2]; ir_node *arg1, *arg2, *res1, *res2; ir_node *cpyxchg = NULL; - if (is_Block(irn)) - return; - - fact = env->chord_env->main_env->node_factory; - arch_env = env->chord_env->main_env->arch_env; + arch_env = env->chord_env->birg->main_env->arch_env; do_copy = env->do_copy; mod = env->dbg_module; block = get_nodes_block(irn); - /* check if perm - Note: A Proj on a Perm will cause is_Perm() - also to return true */ - if (is_Proj(irn) || ! is_Perm(arch_env, irn)) - return; - /* Get the schedule predecessor node to the perm NOTE: This works with auto-magic. If we insert the @@ -247,7 +276,7 @@ static void lower_perm_node(ir_node *irn, void *walk_env) { assert(n == get_irn_n_edges(irn) && "perm's in and out numbers different"); reg_class = arch_get_irn_register(arch_env, get_irn_n(irn, 0))->reg_class; - pairs = calloc(n, sizeof(pairs[0])); + pairs = alloca(n * sizeof(pairs[0])); /* build the list of register pairs (in, out) */ i = 0; @@ -280,11 +309,10 @@ static void lower_perm_node(ir_node *irn, void *walk_env) { set_Proj_proj(pairs[i].out_node, get_Proj_proj(pairs[i].in_node)); } - /* remove the proj from the schedule */ sched_remove(pairs[i].out_node); - /* exchange the proj with the argument */ + /* reroute the edges from the proj to the argument */ edges_reroute(pairs[i].out_node, pairs[i].in_node, env->chord_env->irg); pairs[i].checked = 1; @@ -302,9 +330,15 @@ static void lower_perm_node(ir_node *irn, void *walk_env) { /* go to the first not-checked pair */ while (pairs[i].checked) i++; - cycle = calloc(1, sizeof(*cycle)); + cycle = xcalloc(1, sizeof(*cycle)); cycle = get_perm_cycle(cycle, pairs, n, i); + DB((mod, LEVEL_1, "%+F: following %s created:\n ", irn, cycle->type == PERM_CHAIN ? "chain" : "cycle")); + for (j = 0; j < cycle->n_elems; j++) { + DB((mod, LEVEL_1, " %s", cycle->elems[j]->name)); + } + DB((mod, LEVEL_1, "\n")); + /* 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 */ @@ -313,7 +347,7 @@ static void lower_perm_node(ir_node *irn, void *walk_env) { continue; } -//todo: - iff PERM_CYCLE && do_copy -> determine free temp reg and insert copy to/from it before/after +//TODO: - iff PERM_CYCLE && do_copy -> determine free temp reg and insert copy to/from it before/after // the copy cascade (this reduces the cycle into a chain) /* build copy/swap nodes from back to front */ @@ -336,15 +370,55 @@ static void lower_perm_node(ir_node *irn, void *walk_env) { in[0] = arg1; in[1] = arg2; + /* At this point we have to handle the following problem: */ + /* */ + /* If we have a cycle with more than two elements, then */ + /* this could correspond to the following Perm node: */ + /* */ + /* +----+ +----+ +----+ */ + /* | r1 | | r2 | | r3 | */ + /* +-+--+ +-+--+ +--+-+ */ + /* | | | */ + /* | | | */ + /* +-+--------+---------+-+ */ + /* | Perm | */ + /* +-+--------+---------+-+ */ + /* | | | */ + /* | | | */ + /* +-+--+ +-+--+ +--+-+ */ + /* |Proj| |Proj| |Proj| */ + /* | r2 | | r3 | | r1 | */ + /* +----+ +----+ +----+ */ + /* */ + /* This node is about to be split up into two 2x Perm's */ + /* for which we need 4 Proj's and the one additional Proj */ + /* of the first Perm has to be one IN of the second. So in */ + /* general we need to create one additional Proj for each */ + /* "middle" Perm and set this to one in node of the successor */ + /* Perm. */ + DBG((mod, LEVEL_1, "%+F creating exchange node (%+F, %s) and (%+F, %s) with\n", irn, arg1, cycle->elems[i]->name, arg2, cycle->elems[i + 1]->name)); DBG((mod, LEVEL_1, "%+F (%+F, %s) and (%+F, %s)\n", irn, res1, cycle->elems[i]->name, res2, cycle->elems[i + 1]->name)); - cpyxchg = new_Perm(fact, reg_class, env->chord_env->irg, block, 2, in); + cpyxchg = be_new_Perm(reg_class, env->chord_env->irg, block, 2, in); + + 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); + + /* set as in for next Perm */ + pairs[pidx].in_node = res2; + } + else { + sched_remove(res2); + } sched_remove(res1); - sched_remove(res2); set_Proj_pred(res2, cpyxchg); set_Proj_proj(res2, 0); @@ -361,7 +435,7 @@ static void lower_perm_node(ir_node *irn, void *walk_env) { DBG((mod, LEVEL_1, "%+F creating copy node (%+F, %s) -> (%+F, %s)\n", irn, arg1, cycle->elems[i]->name, res2, cycle->elems[i + 1]->name)); - cpyxchg = new_Copy(fact, reg_class, env->chord_env->irg, block, arg1); + cpyxchg = be_new_Copy(reg_class, env->chord_env->irg, block, arg1); arch_set_irn_register(arch_env, cpyxchg, cycle->elems[i + 1]); /* remove the proj from the schedule */ @@ -373,11 +447,13 @@ static void lower_perm_node(ir_node *irn, void *walk_env) { /* 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; DBG((mod, LEVEL_1, "replacing %+F with %+F, placed new node after %+F\n", irn, cpyxchg, sched_point)); } -// free(cycle->elems); + free((void *) cycle->elems); free(cycle); } @@ -385,18 +461,91 @@ static void lower_perm_node(ir_node *irn, void *walk_env) { sched_remove(irn); } + + /** - * Walks over all blocks in an irg and performs perm lowering. + * Calls the backend code generator functions to lower Spill and + * Reload nodes into Store and Load. The backend is fully responsible + * for creating the new nodes and setting their input correct. + * Note: The caller of this has to make sure that irn is a Spill + * or Reload! + * + * @param irn The Spill/Reload node + * @param walk_env The walker environment + */ +static void lower_spill_reload(ir_node *irn, void *walk_env) { + lower_env_t *env = walk_env; + arch_code_generator_t *cg = env->chord_env->birg->cg; + const arch_env_t *aenv = env->chord_env->birg->main_env->arch_env; + ir_node *res = NULL; + ir_node *sched_point; + + if (be_is_Spill(irn) && cg->impl->lower_spill) { + res = cg->impl->lower_spill(cg, irn); + } + else if (be_is_Reload(irn) && cg->impl->lower_reload) { + res = cg->impl->lower_reload(cg, irn); + if (res && res != irn) { + /* copy the result register from the reload to the load */ + arch_set_irn_register(aenv, res, arch_get_irn_register(aenv, irn)); + } + } + + if (res && res != irn) { + sched_point = sched_prev(irn); + sched_remove(irn); + exchange(irn, res); + sched_add_after(sched_point, res); + } + else { + DBG((env->dbg_module, LEVEL_1, "node %+F not lowered\n", irn)); + } + + return; +} + + + +/** + * Calls the corresponding lowering function for the node. + * + * @param irn The node to be checked for lowering + * @param walk_env The walker environment + */ +static void lower_nodes_after_ra_walker(ir_node *irn, void *walk_env) { + lower_env_t *env = walk_env; + const arch_env_t *arch_env = env->chord_env->birg->main_env->arch_env; + + if (!is_Block(irn) && !is_Proj(irn)) { + if (is_Perm(arch_env, irn)) { + lower_perm_node(irn, walk_env); + } + else if (be_is_Spill(irn) || be_is_Reload(irn)) { + lower_spill_reload(irn, 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). * * @param chord_env The chordal environment containing the irg * @param do_copy 1 == resolve cycles with a free reg if available */ -void lower_perms(be_chordal_env_t *chord_env, int do_copy) { +void lower_nodes_after_ra(be_chordal_env_t *chord_env, int do_copy) { lower_env_t env; env.chord_env = chord_env; env.do_copy = do_copy; - env.dbg_module = firm_dbg_register("ir.be.lower"); + env.dbg_module = firm_dbg_register("firm.be.lower"); - irg_walk_blkwise_graph(chord_env->irg, NULL, lower_perm_node, &env); + irg_walk_blkwise_graph(chord_env->irg, NULL, lower_nodes_after_ra_walker, &env); } + +#undef is_Perm +#undef is_Call