X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbessadestr.c;h=8d6d86093eb2918c0c7ee166c1bb3b5f4eedb0de;hb=df2faee01a5832057bb3ca0ba5f67e979c916e19;hp=17d5425dc1afe3509d53379d51554755f22a85c7;hpb=ddb63eee0f083f2b7f171232622ac6eb3180fc2f;p=libfirm diff --git a/ir/be/bessadestr.c b/ir/be/bessadestr.c index 17d5425dc..8d6d86093 100644 --- a/ir/be/bessadestr.c +++ b/ir/be/bessadestr.c @@ -1,14 +1,31 @@ -/** - * Author: Daniel Grund - * Date: 25.05.2005 - * Copyright: (c) Universitaet Karlsruhe - * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE. +/* + * Copyright (C) 1995-2008 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. * - * Performs SSA-Destruction. + * 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. + */ + +/** + * @file + * @brief Performs SSA-Destruction. + * @author Daniel Grund + * @date 25.05.2005 */ -#ifdef HAVE_CONFIG_H #include "config.h" -#endif + +#include "bessadestr.h" #include "debug.h" #include "set.h" @@ -16,6 +33,7 @@ #include "irnode_t.h" #include "ircons_t.h" #include "iredges_t.h" +#include "irgwalk.h" #include "irgmod.h" #include "irdump.h" #include "irprintf.h" @@ -24,128 +42,167 @@ #include "beutil.h" #include "bechordal_t.h" #include "bearch.h" -#include "benode_t.h" -#include "besched_t.h" - -static firm_dbg_module_t *dbg = NULL; -#define DEBUG_LVL SET_LEVEL_3 +#include "belive_t.h" +#include "benode.h" +#include "besched.h" +#include "statev_t.h" +#include "beirg.h" +#include "beintlive_t.h" +#include "bespillutil.h" - -#define get_chordal_arch(ce) ((ce)->session_env->main_env->arch_env) -#define get_reg(irn) arch_get_irn_register(get_chordal_arch(chordal_env), irn, 0) -#define set_reg(irn, reg) arch_set_irn_register(get_chordal_arch(chordal_env), irn, 0, reg) - -#define is_Perm(irn) (arch_irn_classify(arch_env, irn) == arch_irn_class_perm) -#define get_reg_cls(irn) (arch_get_irn_reg_class(arch_env, irn, arch_pos_make_out(0))) -#define is_curr_reg_class(irn) (get_reg_cls(p) == chordal_env->cls) +DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;) static void clear_link(ir_node *irn, void *data) { - set_irn_link(irn, NULL); + (void) data; + set_irn_link(irn, NULL); } /** - * Build a list of phis of a block. + * For each block build a linked list of phis that + * - are in that block + * - have the current register class + * The list is rooted at get_irn_link(BB). */ -static void collect_phis(ir_node *irn, void *data) +static void collect_phis_walker(ir_node *irn, void *data) { - be_chordal_env_t *env = data; - if(is_Phi(irn) && - arch_irn_has_reg_class(env->session_env->main_env->arch_env, - irn, arch_pos_make_out(0), env->cls)) { - - ir_node *bl = get_nodes_block(irn); - set_irn_link(irn, get_irn_link(bl)); - set_irn_link(bl, irn); - } + be_chordal_env_t *env = (be_chordal_env_t*)data; + if (is_Phi(irn) && arch_irn_consider_in_reg_alloc(env->cls, irn)) { + ir_node *bl = get_nodes_block(irn); + set_irn_link(irn, get_irn_link(bl)); + set_irn_link(bl, irn); + } } /** - * Build a ring of phis for each block in the link field. - * @param env The chordal env. + * This struct represents a Proj for a Perm. + * It records the argument in the Perm and the corresponding Proj of the + * Perm. */ -static INLINE void build_phi_rings(be_chordal_env_t *env) +typedef struct { + ir_node *arg; /**< The phi argument to make the Proj for. */ + int pos; /**< The proj number the Proj will get. + This also denotes the position of @p arg + in the in array of the Perm. */ + ir_node *proj; /**< The proj created for @p arg. */ +} perm_proj_t; + +static int cmp_perm_proj(const void *a, const void *b, size_t n) { - irg_walk_graph(env->session_env->irg, clear_link, collect_phis, env); -} + const perm_proj_t *p = (const perm_proj_t*)a; + const perm_proj_t *q = (const perm_proj_t*)b; + (void) n; -static int skip_cf_predicator(const ir_node *irn, void *data) { - be_chordal_env_t *chordal_env = data; - arch_env_t *ae = chordal_env->session_env->main_env->arch_env; - return arch_irn_classify(ae, irn) == arch_irn_class_branch; + return !(p->arg == q->arg); } +/** + * Insert Perms in all predecessors of a block containing a phi + */ static void insert_all_perms_walker(ir_node *bl, void *data) { - be_chordal_env_t *chordal_env = data; - pmap *perm_map = chordal_env->data; - ir_graph *irg = chordal_env->session_env->irg; - const be_node_factory_t *fact = chordal_env->session_env->main_env->node_factory; - - /* Dummy targets for the projs */ - ir_node *dummy = new_rd_Unknown(irg, mode_T); - - assert(is_Block(bl)); - - /* If the link flag is NULL, this block has no phis. */ - if(get_irn_link(bl)) { - int i, n; - - /* Look at all predecessors of the phi block */ - for(i = 0, n = get_irn_arity(bl); i < n; ++i) { - ir_node *pred_bl = get_Block_cfgpred_block(bl, i); - ir_node *phi, *perm, *insert_after; - ir_node **in; - int j, n_projs = 0; - pmap_entry *ent; - pmap *arg_map = pmap_create(); - - assert(!pmap_contains(perm_map, pred_bl) && "Already permed that block"); - - /* - * Note that all phis in the list are in the same register class - * by construction. - */ - for(phi = get_irn_link(bl); phi; phi = get_irn_link(phi)) { - ir_node *arg = get_irn_n(phi, i); - ir_node *proj = pmap_get(arg_map, arg); - - if(!proj) { - proj = new_r_Proj(irg, pred_bl, dummy, get_irn_mode(arg), n_projs++); - pmap_insert(arg_map, arg, proj); - } - - set_irn_n(phi, i, proj); - } - - j = 0; - in = malloc(n_projs * sizeof(in[0])); - pmap_foreach(arg_map, ent) { - in[j++] = ent->key; - /* register allocation is copied form former arguments - * to the projs (new arguments) - */ - DBG((dbg, LEVEL_2, "Copy register assignment %s from %+F to %+F\n", get_reg(ent->key)->name, ent->key, ent->value)); - set_reg(ent->value, get_reg(ent->key)); - } - - perm = new_Perm(fact, chordal_env->cls, irg, pred_bl, n_projs, in); - insert_after = sched_skip(sched_last(pred_bl), 0, skip_cf_predicator, chordal_env); - sched_add_after(insert_after, perm); - exchange(dummy, perm); - - free(in); - pmap_destroy(arg_map); - - /* register in perm map */ - pmap_insert(perm_map, pred_bl, perm); - } - } -} + be_chordal_env_t *const chordal_env = (be_chordal_env_t*)data; + be_lv_t *lv = be_get_irg_liveness(chordal_env->irg); + int i, n; + + assert(is_Block(bl)); + + /* If the link flag is NULL, this block has no phis. */ + if (!get_irn_link(bl)) + return; + + /* Look at all predecessors of the phi block */ + for (i = 0, n = get_irn_arity(bl); i < n; ++i) { + ir_node *phi, *perm, **in; + set *arg_set = new_set(cmp_perm_proj, chordal_env->cls->n_regs); + ir_node *pred_bl = get_Block_cfgpred_block(bl, i); + int n_projs = 0; + + /* + * Note that all phis in the list are in the same + * register class by construction. + */ + for (phi = (ir_node*)get_irn_link(bl); phi != NULL; + phi = (ir_node*)get_irn_link(phi)) { + ir_node *arg = get_irn_n(phi, i); + unsigned hash; + perm_proj_t templ; + + hash = hash_irn(arg); + templ.arg = arg; + perm_proj_t *const pp = set_find(perm_proj_t, arg_set, &templ, sizeof(templ), hash); + + /* + * If a proj_perm_t entry has not been made in the argument set, + * create one. The only restriction is, that the phi argument + * may not be live in at the current block, since this argument + * interferes with the phi and must thus not be member of a + * Perm. A copy will be inserted for this argument later on. + */ + if (!pp && !be_is_live_in(lv, bl, arg)) { + templ.pos = n_projs++; + (void)set_insert(perm_proj_t, arg_set, &templ, sizeof(templ), hash); + } + } -static void insert_all_perms(be_chordal_env_t *chordal_env) { - DBG((dbg, LEVEL_1, "Placing perms...\n")); - irg_block_walk_graph(chordal_env->session_env->irg, insert_all_perms_walker, NULL, chordal_env); + + if (n_projs) { + /* + * Create a new Perm with the arguments just collected + * above in the arg_set and insert it into the schedule. + */ + in = XMALLOCN(ir_node*, n_projs); + foreach_set(arg_set, perm_proj_t, pp) { + in[pp->pos] = pp->arg; + } + + perm = be_new_Perm(chordal_env->cls, pred_bl, n_projs, in); + stat_ev_int("phi_perm", n_projs); + + ir_node *const schedpoint = be_get_end_of_block_insertion_point(pred_bl); + sched_add_before(schedpoint, perm); + + /* + * Make the Projs for the Perm and insert into schedule. + * Register allocation is copied from the former phi + * arguments to the projs (new phi arguments). + */ + foreach_set(arg_set, perm_proj_t, pp) { + ir_node *proj = new_r_Proj(perm, get_irn_mode(pp->arg), pp->pos); + pp->proj = proj; + assert(arch_get_irn_register(pp->arg)); + arch_set_irn_register(proj, arch_get_irn_register(pp->arg)); + DBG((dbg, LEVEL_2, "Copy register assignment %s from %+F to %+F\n", arch_get_irn_register(pp->arg)->name, pp->arg, pp->proj)); + } + + /* + * Set the phi nodes to their new arguments: The Projs of the Perm + */ + for (phi = (ir_node*)get_irn_link(bl); phi != NULL; + phi = (ir_node*)get_irn_link(phi)) { + perm_proj_t templ; + + templ.arg = get_irn_n(phi, i); + perm_proj_t *const pp = set_find(perm_proj_t, arg_set, &templ, sizeof(templ), hash_irn(templ.arg)); + + /* If not found, it was an interfering argument */ + if (pp) { + set_irn_n(phi, i, pp->proj); + be_liveness_introduce(lv, pp->proj); + } + } + + /* update the liveness of the Perm's operands. It might be changed. */ + { + int i; + for (i = 0; i < n_projs; ++i) + be_liveness_update(lv, in[i]); + } + free(in); + } + + del_set(arg_set); + } } #define is_pinned(irn) (get_irn_link(irn)) @@ -153,157 +210,184 @@ static void insert_all_perms(be_chordal_env_t *chordal_env) { #define pin_irn(irn, lock) (set_irn_link(irn, lock)) /** - * Adjusts the register allocation for the phi-operands - * by inserting perm nodes, if necessary. - * @param phi The phi node to adjust operands for + * Adjusts the register allocation for the (new) phi-operands + * and insert duplicates iff necessary. */ -static void adjust_phi_arguments(be_chordal_env_t *chordal_env, ir_node *phi) { - int i, max; - ir_node *arg, *phi_block, *arg_block; - const be_main_session_env_t *session = chordal_env->session_env; - const arch_register_t *phi_reg, *arg_reg; - const arch_register_class_t *cls; - - assert(is_Phi(phi) && "Can only handle phi-destruction :)"); - DBG((dbg, LEVEL_1, " for %+F\n", phi)); - - cls = arch_get_irn_reg_class(get_chordal_arch(chordal_env), phi, arch_pos_make_out(0)); - phi_block = get_nodes_block(phi); - phi_reg = get_reg(phi); - - /* process all arguments of the phi */ - for(i=0, max=get_irn_arity(phi); iname)); - perm = get_Proj_pred(arg); - //TODO reenable this if classify is implemented. assert(is_Perm(perm)); - - DBG((dbg, LEVEL_1, " arg %+F has perm %+F\n", arg, perm)); - /* if registers don't match ...*/ - if (phi_reg != arg_reg) { - DBG((dbg, LEVEL_1, " regs don't match %d %d\n", phi_reg->name, arg_reg->name)); - - /* First check if there is another phi in the same block - * having arg at the same pos in its arg-list and the same color as arg */ - if (!is_pinned(arg)) { - DBG((dbg, LEVEL_1, " arg is not pinned\n")); - ir_node *other_phi = phi; - for(other_phi = get_irn_link(phi_block); other_phi; other_phi = get_irn_link(other_phi)) { - if(other_phi == phi) - continue; - assert(is_Phi(other_phi) && get_nodes_block(phi) == get_nodes_block(other_phi) && "link fields are screwed up"); - if (get_irn_n(other_phi, i) == arg && get_reg(other_phi) == arg_reg) { - DBG((dbg, LEVEL_1, " but other phi (%+F) just pinned it\n", other_phi)); +static void set_regs_or_place_dupls_walker(ir_node *bl, void *data) +{ + be_chordal_env_t *chordal_env = (be_chordal_env_t*)data; + be_lv_t *lv = be_get_irg_liveness(chordal_env->irg); + ir_node *phi; + + /* Consider all phis of this block */ + for (phi = (ir_node*)get_irn_link(bl); phi != NULL; + phi = (ir_node*)get_irn_link(phi)) { + ir_node *phi_block = get_nodes_block(phi); + const arch_register_t *phi_reg = arch_get_irn_register(phi); + int max; + int i; + + assert(is_Phi(phi) && "Can only handle phi-destruction :)"); + + /* process all arguments of the phi */ + for (i = 0, max = get_irn_arity(phi); i < max; ++i) { + ir_node *arg = get_irn_n(phi, i); + const arch_register_t *arg_reg; + ir_node *arg_block; + + arg_block = get_Block_cfgpred_block(phi_block, i); + arg_reg = arch_get_irn_register(arg); + + assert(arg_reg && "Register must be set while placing perms"); + + DBG((dbg, LEVEL_1, " for %+F(%s) -- %+F(%s)\n", phi, phi_reg->name, arg, arg_reg->name)); + + if (phi_reg == arg_reg + || (arg_reg->type & arch_register_type_virtual)) { + /* Phi and arg have the same register, so pin and continue */ + pin_irn(arg, phi_block); + DBG((dbg, LEVEL_1, " arg has same reg: pin %+F(%s)\n", arg, arch_get_irn_register(arg)->name)); + continue; + } + + if (be_values_interfere(lv, phi, arg)) { + /* + Insert a duplicate in arguments block, + make it the new phi arg, + set its register, + insert it into schedule, + pin it + */ + ir_node *dupl = be_new_Copy(arg_block, arg); + + set_irn_n(phi, i, dupl); + arch_set_irn_register(dupl, phi_reg); + ir_node *const schedpoint = be_get_end_of_block_insertion_point(arg_block); + sched_add_before(schedpoint, dupl); + pin_irn(dupl, phi_block); + be_liveness_introduce(lv, dupl); + be_liveness_update(lv, arg); + DBG((dbg, LEVEL_1, " they do interfere: insert %+F(%s)\n", dupl, arch_get_irn_register(dupl)->name)); + continue; /* with next argument */ + } + + DBG((dbg, LEVEL_1, " they do not interfere\n")); + assert(is_Proj(arg)); + /* + First check if there is an other phi + - in the same block + - having arg at the current pos in its arg-list + - having the same color as arg + + If found, then pin the arg (for that phi) + */ + if (! is_pinned(arg)) { + ir_node *other_phi; + + DBG((dbg, LEVEL_1, " searching for phi with same arg having args register\n")); + + for (other_phi = (ir_node*)get_irn_link(phi_block); + other_phi != NULL; + other_phi = (ir_node*)get_irn_link(other_phi)) { + + assert(is_Phi(other_phi) && + get_nodes_block(phi) == get_nodes_block(other_phi) && + "link fields are screwed up"); + + if (get_irn_n(other_phi, i) == arg && arch_get_irn_register(other_phi) == arg_reg) { + DBG((dbg, LEVEL_1, " found %+F(%s)\n", other_phi, arch_get_irn_register(other_phi)->name)); pin_irn(arg, phi_block); + break; } } } - /* If arg is pinned, another phi set the color of arg and pinned it. - * So this phi can't change the color again and a duplicate must be inserted. - * - * If arg interferes with phi, one can never set the same color for both - * Hence, a duplicate must be inserted */ - if (is_pinned(arg) || nodes_interfere(chordal_env, phi, arg)) { - ir_node *dupl, *tmp; - assert(get_pinning_block(arg) == phi_block && "If arg is pinned it must be due to a phi in the same block"); + if (is_pinned(arg)) { + /* + Insert a duplicate of the original value in arguments block, + make it the new phi arg, + set its register, + insert it into schedule, + pin it + */ + ir_node *perm = get_Proj_pred(arg); + ir_node *dupl = be_new_Copy(arg_block, arg); - dupl = new_Copy(session->main_env->node_factory, cls, session->irg, arg_block, arg); set_irn_n(phi, i, dupl); - set_reg(dupl, phi_reg); - DBG((dbg, LEVEL_1, " arg is pinned so insert dupl %+F\n", dupl)); - - /* Add dupl to schedule */ - tmp = sched_next(perm); - while (is_Proj(tmp) && sched_has_next(tmp)) - tmp = sched_next(tmp); - sched_add_after(tmp, dupl); - - /* now the arg is the dupl */ - arg = dupl; + arch_set_irn_register(dupl, phi_reg); + sched_add_after(perm, dupl); + pin_irn(dupl, phi_block); + be_liveness_introduce(lv, dupl); + be_liveness_update(lv, arg); + DBG((dbg, LEVEL_1, " arg is pinned: insert %+F(%s)\n", dupl, arch_get_irn_register(dupl)->name)); } else { - /* Arg is not pinned. So set its color to the color of the phi. - * If the phi color is used by another proj of this perm - * one must NOT swap the colors. Proof: Critical edges removed, - * livein(PhiBl) = liveout(ArgBl), if all phis are processed then - * every color is used exactly once. - */ - DBG((dbg, LEVEL_1, " arg is not pinned so just set register to %s\n", phi_reg->name)); - set_reg(arg, phi_reg); + /* + No other phi has the same color (else arg would have been pinned), + so just set the register and pin + */ + arch_set_irn_register(arg, phi_reg); + pin_irn(arg, phi_block); + DBG((dbg, LEVEL_1, " arg is not pinned: so pin %+F(%s)\n", arg, arch_get_irn_register(arg)->name)); } - } else { - DBG((dbg, LEVEL_1, " regs match %d\n")); } - - /* Now the color of the arg (arg may be a dupl now) and the phi-result are equal. - * Pin it, so everyone knows and it never gets changed again. - * An arg never is a phi, because perms were inserted. So the link field is free */ - DBG((dbg, LEVEL_1, " arg has correct color (now), so pin it\n")); - pin_irn(arg, phi_block); } } -static void set_regs_or_place_dupls_walker(ir_node *bl, void *data) { - be_chordal_env_t *chordal_env = data; - ir_node *phi; +void be_ssa_destruction(be_chordal_env_t *chordal_env) +{ + ir_graph *irg = chordal_env->irg; - for(phi = get_irn_link(bl); phi; phi = get_irn_link(phi)) - adjust_phi_arguments(chordal_env, phi); -} + FIRM_DBG_REGISTER(dbg, "ir.be.ssadestr"); -static void set_regs_or_place_dupls(be_chordal_env_t *chordal_env) -{ - DBG((dbg, LEVEL_1, "Setting regs and placing dupls...\n")); - irg_block_walk_graph(chordal_env->session_env->irg, - set_regs_or_place_dupls_walker, NULL, chordal_env); -} + be_invalidate_live_sets(irg); + /* create a map for fast lookup of perms: block --> perm */ + irg_walk_graph(irg, clear_link, collect_phis_walker, chordal_env); -void be_ssa_destruction(be_chordal_env_t *chordal_env) { - pmap *perm_map = pmap_create(); - ir_graph *irg = chordal_env->session_env->irg; + DBG((dbg, LEVEL_1, "Placing perms...\n")); + irg_block_walk_graph(irg, insert_all_perms_walker, NULL, chordal_env); - dbg = firm_dbg_register("ir.be.ssadestr"); - firm_dbg_set_mask(dbg, DEBUG_LVL); + if (chordal_env->opts->dump_flags & BE_CH_DUMP_SSADESTR) + dump_ir_graph(irg, "ssa_destr_perms_placed"); - /* create a map for fast lookup of perms: block --> perm */ - chordal_env->data = perm_map; + be_assure_live_chk(irg); - build_phi_rings(chordal_env); - insert_all_perms(chordal_env); - dump_ir_block_graph(irg, "-ssa_destr_perms_placed"); + DBG((dbg, LEVEL_1, "Setting regs and placing dupls...\n")); + irg_block_walk_graph(irg, set_regs_or_place_dupls_walker, NULL, chordal_env); - set_regs_or_place_dupls(chordal_env); - dump_ir_block_graph(irg, "-ssa_destr_regs_set"); + /* unfortunately updating doesn't work yet. */ + be_invalidate_live_chk(irg); - pmap_destroy(perm_map); + if (chordal_env->opts->dump_flags & BE_CH_DUMP_SSADESTR) + dump_ir_graph(irg, "ssa_destr_regs_set"); } static void ssa_destruction_check_walker(ir_node *bl, void *data) { - be_chordal_env_t *chordal_env = data; ir_node *phi; int i, max; + (void)data; - for(phi = get_irn_link(bl); phi; phi = get_irn_link(phi)) { + for (phi = (ir_node*)get_irn_link(bl); phi != NULL; + phi = (ir_node*)get_irn_link(phi)) { const arch_register_t *phi_reg, *arg_reg; - phi_reg = get_reg(phi); + phi_reg = arch_get_irn_register(phi); /* iterate over all args of phi */ - for(i=0, max=get_irn_arity(phi); iname, arg_reg->name)); assert(0); } - if(!is_pinned(arg)) { + + if (! is_pinned(arg)) { DBG((dbg, 0, "Warning: Phi argument %+F is not pinned.\n", arg)); assert(0); } @@ -311,6 +395,7 @@ static void ssa_destruction_check_walker(ir_node *bl, void *data) } } -void be_ssa_destruction_check(be_chordal_env_t *chordal_env) { - irg_block_walk_graph(chordal_env->session_env->irg, ssa_destruction_check_walker, NULL, chordal_env); +void be_ssa_destruction_check(be_chordal_env_t *chordal_env) +{ + irg_block_walk_graph(chordal_env->irg, ssa_destruction_check_walker, NULL, NULL); }