X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeirgmod.c;h=bf6506c110ac6e0a4329d9b31b3bc5ffa3fa46b4;hb=0f758eda285960164141e7e2d81f00f898f2ae7e;hp=c9eb4d5e10dfe06f176289d896e8b54d6be655ee;hpb=4d5c3365a58cba59993045a9e08e686d8ae079a7;p=libfirm diff --git a/ir/be/beirgmod.c b/ir/be/beirgmod.c index c9eb4d5e1..bf6506c11 100644 --- a/ir/be/beirgmod.c +++ b/ir/be/beirgmod.c @@ -1,5 +1,5 @@ /* - * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved. + * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved. * * This file is part of libFirm. * @@ -19,21 +19,16 @@ /** * @file - * @brief + * @brief Backend IRG modification routines. + * @author Sebastian Hack, Daniel Grund, Matthias Braun, Christian Wuerdig + * @date 04.05.2005 + * * This file contains the following IRG modifications for be routines: * - insertion of Perm nodes * - empty block elimination * - a simple dead node elimination (set inputs of unreachable nodes to BAD) - * - * @author Sebastian Hack, Daniel Grund, Matthias Braun, Christian Wuerdig - * @date 04.05.2005 - * @version $Id$ - * Copyright: (c) Universitaet Karlsruhe - * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE. */ -#ifdef HAVE_CONFIG_H #include "config.h" -#endif #include @@ -55,23 +50,34 @@ #include "iredges_t.h" #include "irgraph_t.h" #include "irgopt.h" -#include "irprintf_t.h" +#include "irgmod.h" +#include "irprintf.h" #include "irgwalk.h" #include "be_t.h" #include "bechordal_t.h" -#include "bearch_t.h" -#include "besched_t.h" +#include "bearch.h" +#include "besched.h" #include "belive_t.h" -#include "benode_t.h" +#include "benode.h" #include "beutil.h" #include "beinsn_t.h" #include "bessaconstr.h" - +#include "beirg.h" #include "beirgmod.h" +#include "bemodule.h" DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;) +static int cmp_node_nr(const void *a, const void *b) +{ + ir_node **p1 = (ir_node**)a; + ir_node **p2 = (ir_node**)b; + long n1 = get_irn_node_nr(*p1); + long n2 = get_irn_node_nr(*p2); + return (n1>n2) - (n1main_env->arch_env; - be_lv_t *lv = birg->lv; - ir_node *bl = is_Block(pos) ? pos : get_nodes_block(pos); - ir_graph *irg = get_irn_irg(bl); - pset *live = pset_new_ptr_default(); + be_lv_t *lv = be_get_irg_liveness(irg); + ir_nodeset_t live; - ir_node *curr, *irn, *perm, **nodes; - int i, n; + ir_node *perm, **nodes; + size_t i, n; - DBG((dbg, LEVEL_1, "Insert Perm after: %+F\n", pos)); + DBG((dbg, LEVEL_1, "Insert Perm before: %+F\n", pos)); - be_liveness_nodes_live_at(lv, arch_env, cls, pos, live); + ir_nodeset_init(&live); + be_liveness_nodes_live_before(lv, cls, pos, &live); - n = pset_count(live); - - if(n == 0) { - del_pset(live); + n = ir_nodeset_size(&live); + if (n == 0) { + ir_nodeset_destroy(&live); return NULL; } - nodes = xmalloc(n * sizeof(nodes[0])); + nodes = XMALLOCN(ir_node*, n); DBG((dbg, LEVEL_1, "live:\n")); - for(irn = pset_first(live), i = 0; irn; irn = pset_next(live), i++) { + i = 0; + foreach_ir_nodeset(&live, irn, iter) { DBG((dbg, LEVEL_1, "\t%+F\n", irn)); nodes[i] = irn; + i++; } - del_pset(live); + ir_nodeset_destroy(&live); + /* make the input order deterministic */ + qsort(nodes, n, sizeof(nodes[0]), cmp_node_nr); - perm = be_new_Perm(cls, irg, bl, n, nodes); - sched_add_after(pos, perm); + ir_node *const bl = get_nodes_block(pos); + perm = be_new_Perm(cls, bl, n, nodes); + sched_add_before(pos, perm); free(nodes); - curr = perm; for (i = 0; i < n; ++i) { ir_node *perm_op = get_irn_n(perm, i); - const arch_register_t *reg = arch_get_irn_register(arch_env, perm_op); be_ssa_construction_env_t senv; ir_mode *mode = get_irn_mode(perm_op); - ir_node *proj = new_r_Proj(irg, bl, perm, mode, i); - arch_set_irn_register(arch_env, proj, reg); - - sched_add_after(curr, proj); - curr = proj; + ir_node *proj = new_r_Proj(perm, mode, i); - be_ssa_construction_init(&senv, birg); + be_ssa_construction_init(&senv, irg); be_ssa_construction_add_copy(&senv, perm_op); be_ssa_construction_add_copy(&senv, proj); be_ssa_construction_fix_users(&senv, perm_op); @@ -144,64 +145,204 @@ ir_node *insert_Perm_after(be_irg_t *birg, return perm; } +static int blocks_removed; + /** * Post-block-walker: Find blocks containing only one jump and * remove them. */ -static void remove_empty_block(ir_node *block, void *data) { - const ir_edge_t *edge, *next; - ir_node *node; - int *changed = data; - ir_node *jump = NULL; - - assert(is_Block(block)); +static void remove_empty_block(ir_node *block) +{ + int i; + int arity; + ir_node *pred; + ir_node *succ_block; + ir_node *jump = NULL; + ir_graph *irg = get_irn_irg(block); + ir_entity *entity; + + if (irn_visited_else_mark(block)) + return; if (get_Block_n_cfgpreds(block) != 1) - return; + goto check_preds; sched_foreach(block, node) { - if (! is_Jmp(node)) - return; + if (! is_Jmp(node) + && !(arch_get_irn_flags(node) & arch_irn_flags_simple_jump)) + goto check_preds; if (jump != NULL) { /* we should never have 2 jumps in a block */ - panic("We should never have 2 jumps in a block"); + panic("found 2 jumps in a block"); } jump = node; } if (jump == NULL) - return; + goto check_preds; + + entity = get_Block_entity(block); + pred = get_Block_cfgpred(block, 0); + succ_block = NULL; + foreach_out_edge_safe(jump, edge) { + int pos = get_edge_src_pos(edge); + + assert(succ_block == NULL); + succ_block = get_edge_src_irn(edge); + if (get_Block_entity(succ_block) != NULL && entity != NULL) { + /* + * Currently we can add only one label for a block. + * Therefore we cannot combine them if both block already have one. + */ + goto check_preds; + } - node = get_Block_cfgpred(block, 0); - foreach_out_edge_safe(jump, edge, next) { - ir_node *block = get_edge_src_irn(edge); - int pos = get_edge_src_pos(edge); + set_irn_n(succ_block, pos, pred); + } + + if (entity != NULL) { + /* move the label to the successor block */ + set_Block_entity(succ_block, entity); + } - set_irn_n(block, pos, node); + /* there can be some non-scheduled Pin nodes left in the block, move them + * to the succ block (Pin) or pred block (Sync) */ + foreach_out_edge_safe(block, edge) { + ir_node *const node = get_edge_src_irn(edge); + + if (node == jump) + continue; + /* we simply kill Pins, because there are some strange interactions + * between jump threading, which produce PhiMs with Pins, we simply + * kill the pins here, everything is scheduled anyway */ + if (is_Pin(node)) { + exchange(node, get_Pin_op(node)); + continue; + } + if (is_Sync(node)) { + set_nodes_block(node, get_nodes_block(pred)); + continue; + } + if (is_End(node)) { /* End-keep, reroute it to the successor */ + int pos = get_edge_src_pos(edge); + set_irn_n(node, pos, succ_block); + continue; + } + panic("Unexpected node %+F in block %+F with empty schedule", node, block); } - set_Block_cfgpred(block, 0, new_Bad()); - be_kill_node(jump); - *changed = 1; + set_Block_cfgpred(block, 0, new_r_Bad(irg, mode_X)); + kill_node(jump); + blocks_removed = 1; + + /* check predecessor */ + remove_empty_block(get_nodes_block(pred)); + return; + +check_preds: + arity = get_Block_n_cfgpreds(block); + for (i = 0; i < arity; ++i) { + ir_node *pred = get_Block_cfgpred_block(block, i); + remove_empty_block(pred); + } } /* removes basic blocks that just contain a jump instruction */ -int be_remove_empty_blocks(ir_graph *irg) { - int changed = 0; +int be_remove_empty_blocks(ir_graph *irg) +{ + ir_node *end; + int i, arity; + + blocks_removed = 0; + + ir_reserve_resources(irg, IR_RESOURCE_IRN_VISITED); + inc_irg_visited(irg); + remove_empty_block(get_irg_end_block(irg)); + end = get_irg_end(irg); + arity = get_irn_arity(end); + for (i = 0; i < arity; ++i) { + ir_node *pred = get_irn_n(end, i); + if (!is_Block(pred)) + continue; + remove_empty_block(pred); + } + ir_free_resources(irg, IR_RESOURCE_IRN_VISITED); - irg_block_walk_graph(irg, remove_empty_block, NULL, &changed); - if (changed) { + if (blocks_removed) { /* invalidate analysis info */ - set_irg_doms_inconsistent(irg); - set_irg_extblk_inconsistent(irg); - set_irg_outs_inconsistent(irg); + clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_DOMINANCE); } - return changed; + return blocks_removed; } +//--------------------------------------------------------------------------- + +typedef struct remove_dead_nodes_env_t_ { + bitset_t *reachable; + ir_graph *irg; + be_lv_t *lv; +} remove_dead_nodes_env_t; + +/** + * Post-walker: remember all visited nodes in a bitset. + */ +static void mark_dead_nodes_walker(ir_node *node, void *data) +{ + remove_dead_nodes_env_t *env = (remove_dead_nodes_env_t*) data; + bitset_set(env->reachable, get_irn_idx(node)); +} + +/** + * Post-block-walker: + * Walk through the schedule of every block and remove all dead nodes from it. + */ +static void remove_dead_nodes_walker(ir_node *block, void *data) +{ + remove_dead_nodes_env_t *env = (remove_dead_nodes_env_t*) data; + ir_node *node, *next; + + for (node = sched_first(block); ! sched_is_end(node); node = next) { + /* get next node now, as after calling sched_remove it will be invalid */ + next = sched_next(node); + + if (bitset_is_set(env->reachable, get_irn_idx(node))) + continue; + + if (env->lv != NULL) + be_liveness_remove(env->lv, node); + sched_remove(node); + + /* kill projs */ + if (get_irn_mode(node) == mode_T) { + foreach_out_edge_safe(node, edge) { + ir_node *proj = get_edge_src_irn(edge); + if (!is_Proj(proj)) + continue; + if (env->lv != NULL) + be_liveness_remove(env->lv, proj); + kill_node(proj); + } + } + kill_node(node); + } +} + +void be_remove_dead_nodes_from_schedule(ir_graph *irg) +{ + remove_dead_nodes_env_t env; + env.reachable = bitset_alloca(get_irg_last_idx(irg)); + env.lv = be_get_irg_liveness(irg); + env.irg = irg; + + // mark all reachable nodes + irg_walk_graph(irg, mark_dead_nodes_walker, NULL, &env); + + // walk schedule and remove non-marked nodes + irg_block_walk_graph(irg, remove_dead_nodes_walker, NULL, &env); +} + +BE_REGISTER_MODULE_CONSTRUCTOR(be_init_irgmod) void be_init_irgmod(void) { FIRM_DBG_REGISTER(dbg, "firm.be.irgmod"); } - -BE_REGISTER_MODULE_CONSTRUCTOR(be_init_irgmod);