X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbelive.c;h=8f0724df325c4c71640dfbb27e3940a92d099373;hb=e59e094b609ef8ce89319205d4e9c01d131b5cf7;hp=c9eda11a52c14437523751cf07681b4ce2911ad5;hpb=e32ef434711ff7cd3376d52917c8a33931c836c9;p=libfirm diff --git a/ir/be/belive.c b/ir/be/belive.c index c9eda11a5..8f0724df3 100644 --- a/ir/be/belive.c +++ b/ir/be/belive.c @@ -1,7 +1,28 @@ +/* + * Copyright (C) 1995-2007 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. + * + * 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. + */ + /** - * Interblock liveness analysis. - * @author Sebastian Hack - * @date 6.12.2004 + * @file + * @brief Interblock liveness analysis. + * @author Sebastian Hack + * @date 06.12.2004 + * @version $Id$ */ #ifdef HAVE_CONFIG_H #include "config.h" @@ -13,14 +34,19 @@ #include "irprintf_t.h" #include "irbitset.h" #include "irdump_t.h" +#include "irnodeset.h" #include "beutil.h" #include "belive_t.h" +#include "beirg_t.h" #include "besched_t.h" +#include "bemodule.h" -#define DBG_MODULE "firm.be.liveness" +DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;) -#define LV_STD_SIZE 128 +/* see comment in compute_liveness() */ +#define LV_COMPUTE_SORTED +#define LV_STD_SIZE 64 #define LV_USE_BINARY_SEARCH #undef LV_INTESIVE_CHECKS @@ -174,13 +200,19 @@ static struct _be_lv_info_node_t *be_lv_get_or_set(struct _be_lv_t *li, ir_node unsigned n_size = irn_live[0].u.head.n_size; unsigned i; - if(n_members == n_size - 1) { - unsigned new_size = 2 * n_size * sizeof(irn_live[0]); - struct _be_lv_info_t *nw = phase_alloc(&li->ph, new_size); - memcpy(nw, irn_live, new_size); - nw[0].u.head.n_size = new_size; + if(n_members + 1 >= n_size) { + /* double the array size. Remember that the first entry is + * metadata about the array and not a real array element */ + unsigned old_size_bytes = (n_size + 1) * sizeof(irn_live[0]); + unsigned new_size = (2 * n_size) + 1; + size_t new_size_bytes = new_size * sizeof(irn_live[0]); + struct _be_lv_info_t *nw = phase_alloc(&li->ph, new_size_bytes); + memcpy(nw, irn_live, old_size_bytes); + memset(((char*) nw) + old_size_bytes, 0, + new_size_bytes - old_size_bytes); + nw[0].u.head.n_size = new_size - 1; irn_live = nw; - phase_set_irn_data(&li->ph, irn, nw); + phase_set_irn_data(&li->ph, bl, nw); } payload = &irn_live[1]; @@ -238,7 +270,7 @@ static int be_lv_remove(struct _be_lv_t *li, ir_node *bl, ir_node *irn) payload[n - 1].u.node.flags = 0; --irn_live[0].u.head.n_members; - DBG((li->dbg, LEVEL_3, "\tdeleting %+F from %+F at pos %d\n", irn, bl, pos)); + DBG((dbg, LEVEL_3, "\tdeleting %+F from %+F at pos %d\n", irn, bl, pos)); return 1; } } @@ -265,7 +297,7 @@ static void register_node(be_lv_t *lv, const ir_node *irn) static INLINE void mark_live_in(be_lv_t *lv, ir_node *block, ir_node *irn) { struct _be_lv_info_node_t *n = be_lv_get_or_set(lv, block, irn); - DBG((lv->dbg, LEVEL_2, "marking %+F live in at %+F\n", irn, block)); + DBG((dbg, LEVEL_2, "marking %+F live in at %+F\n", irn, block)); n->flags |= be_lv_state_in; register_node(lv, irn); } @@ -276,7 +308,7 @@ static INLINE void mark_live_in(be_lv_t *lv, ir_node *block, ir_node *irn) static INLINE void mark_live_out(be_lv_t *lv, ir_node *block, ir_node *irn) { struct _be_lv_info_node_t *n = be_lv_get_or_set(lv, block, irn); - DBG((lv->dbg, LEVEL_2, "marking %+F live out at %+F\n", irn, block)); + DBG((dbg, LEVEL_2, "marking %+F live out at %+F\n", irn, block)); n->flags |= be_lv_state_out | be_lv_state_end; register_node(lv, irn); } @@ -287,7 +319,7 @@ static INLINE void mark_live_out(be_lv_t *lv, ir_node *block, ir_node *irn) static INLINE void mark_live_end(be_lv_t *lv, ir_node *block, ir_node *irn) { struct _be_lv_info_node_t *n = be_lv_get_or_set(lv, block, irn); - DBG((lv->dbg, LEVEL_2, "marking %+F live end at %+F\n", irn, block)); + DBG((dbg, LEVEL_2, "marking %+F live end at %+F\n", irn, block)); n->flags |= be_lv_state_end; register_node(lv, irn); } @@ -439,21 +471,92 @@ static void lv_dump_block(void *context, FILE *f, const ir_node *bl) } } -static void *lv_phase_data_init(phase_t *phase, ir_node *irn, void *old) +static void *lv_phase_data_init(ir_phase *phase, ir_node *irn, void *old) { struct _be_lv_info_t *info = phase_alloc(phase, LV_STD_SIZE * sizeof(info[0])); + (void) irn; + (void) old; + memset(info, 0, LV_STD_SIZE * sizeof(info[0])); info[0].u.head.n_size = LV_STD_SIZE - 1; return info; } +static void collect_nodes(ir_node *irn, void *data) +{ + struct obstack *obst = data; + if (is_liveness_node(irn)) + obstack_ptr_grow(obst, irn); +} + +static int node_idx_cmp(const void *a, const void *b) +{ + const ir_node *p = *(ir_node **) a; + const ir_node *q = *(ir_node **) b; + int ia = get_irn_idx(p); + int ib = get_irn_idx(q); + return ia - ib; +} + static void compute_liveness(be_lv_t *lv) { + struct obstack obst; struct _lv_walker_t w; + ir_node **nodes; + int i, n; + + obstack_init(&obst); + irg_walk_graph(lv->irg, collect_nodes, NULL, &obst); + n = obstack_object_size(&obst) / sizeof(nodes[0]); + nodes = obstack_finish(&obst); + + /* + * inserting the variables sorted by their ID is probably + * more efficient since the binary sorted set insertion + * will not need to move arounf the data. + * However, if sorting the variables a priori pays off + * needs to be checked, hence the define. + */ +#ifdef LV_COMPUTE_SORTED + qsort(nodes, n, sizeof(nodes[0]), node_idx_cmp); +#endif + w.lv = lv; - w.data = bitset_malloc(get_irg_last_idx(lv->irg)); - irg_walk_graph(lv->irg, liveness_for_node, NULL, &w); - bitset_free(w.data); + w.data = bitset_obstack_alloc(&obst, get_irg_last_idx(lv->irg)); + + for (i = 0; i < n; ++i) + liveness_for_node(nodes[i], &w); + + obstack_free(&obst, NULL); + register_hook(hook_node_info, &lv->hook_info); +} + +void be_liveness_assure_sets(be_lv_t *lv) +{ + if (!lv->nodes) { + lv->nodes = bitset_malloc(2 * get_irg_last_idx(lv->irg)); + phase_init(&lv->ph, "liveness", lv->irg, PHASE_DEFAULT_GROWTH, lv_phase_data_init, NULL); + compute_liveness(lv); + } +} + +void be_liveness_assure_chk(be_lv_t *lv) +{ +#ifndef USE_LIVE_CHK + be_liveness_assure_sets(lv); +#else + (void) lv; +#endif +} + +void be_liveness_invalidate(be_lv_t *lv) +{ + if (lv && lv->nodes) { + unregister_hook(hook_node_info, &lv->hook_info); + phase_free(&lv->ph); + bitset_free(lv->nodes); + lv->nodes = NULL; + } } /* Compute the inter block liveness for a graph. */ @@ -462,14 +565,12 @@ be_lv_t *be_liveness(ir_graph *irg) be_lv_t *lv = xmalloc(sizeof(lv[0])); memset(lv, 0, sizeof(lv[0])); - FIRM_DBG_REGISTER(lv->dbg, DBG_MODULE); lv->irg = irg; - lv->nodes = bitset_malloc(2 * get_irg_last_idx(irg)); +#ifdef USE_LIVE_CHK + lv->lvc = lv_chk_new(irg); +#endif lv->hook_info.context = lv; lv->hook_info.hook._hook_node_info = lv_dump_block; - register_hook(hook_node_info, &lv->hook_info); - phase_init(&lv->ph, "liveness", irg, PHASE_DEFAULT_GROWTH, lv_phase_data_init); - compute_liveness(lv); return lv; } @@ -486,43 +587,45 @@ void be_liveness_recompute(be_lv_t *lv) bitset_clear_all(lv->nodes); phase_free(&lv->ph); - phase_init(&lv->ph, "liveness", lv->irg, PHASE_DEFAULT_GROWTH, lv_phase_data_init); + phase_init(&lv->ph, "liveness", lv->irg, PHASE_DEFAULT_GROWTH, lv_phase_data_init, NULL); compute_liveness(lv); } void be_liveness_free(be_lv_t *lv) { - unregister_hook(hook_node_info, &lv->hook_info); - phase_free(&lv->ph); - bitset_free(lv->nodes); + be_liveness_invalidate(lv); free(lv); } void be_liveness_remove(be_lv_t *lv, ir_node *irn) { - unsigned idx = get_irn_idx(irn); - struct _lv_walker_t w; + if (lv->nodes) { + unsigned idx = get_irn_idx(irn); + struct _lv_walker_t w; - /* - * Removes a single irn from the liveness information. - * Since an irn can only be live at blocks dominated by the block of its - * definition, we only have to process that dominance subtree. - */ - w.lv = lv; - w.data = irn; - dom_tree_walk(get_nodes_block(irn), lv_remove_irn_walker, NULL, &w); - if(idx <= bitset_size(lv->nodes)) - bitset_clear(lv->nodes, idx); + /* + * Removes a single irn from the liveness information. + * Since an irn can only be live at blocks dominated by the block of its + * definition, we only have to process that dominance subtree. + */ + w.lv = lv; + w.data = irn; + dom_tree_walk(get_nodes_block(irn), lv_remove_irn_walker, NULL, &w); + if(idx < bitset_size(lv->nodes)) + bitset_clear(lv->nodes, idx); + } } void be_liveness_introduce(be_lv_t *lv, ir_node *irn) { - struct _lv_walker_t w; - w.lv = lv; - w.data = bitset_malloc(get_irg_last_idx(lv->irg)); - liveness_for_node(irn, &w); - bitset_free(w.data); + if (lv->nodes) { + struct _lv_walker_t w; + w.lv = lv; + w.data = bitset_malloc(get_irg_last_idx(lv->irg)); + liveness_for_node(irn, &w); + bitset_free(w.data); + } } void be_liveness_update(be_lv_t *lv, ir_node *irn) @@ -531,23 +634,6 @@ void be_liveness_update(be_lv_t *lv, ir_node *irn) be_liveness_introduce(lv, irn); } -static void lv_add_missing_walker(ir_node *irn, void *data) -{ - struct _lv_walker_t *w = data; - if(!is_Block(irn) && !bitset_contains_irn(w->lv->nodes, irn)) { - liveness_for_node(irn, w); - } -} - -void be_liveness_add_missing(be_lv_t *lv) -{ - struct _lv_walker_t w; - w.lv = lv; - w.data = bitset_malloc(get_irg_last_idx(lv->irg)); - irg_walk_graph(lv->irg, lv_add_missing_walker, NULL, &w); - bitset_free(w.data); -} - static void lv_check_walker(ir_node *bl, void *data) { struct _lv_walker_t *w = data; @@ -673,49 +759,66 @@ int be_check_dominance(ir_graph *irg) return !problem_found; } -pset *be_liveness_transfer(const arch_env_t *arch_env, const arch_register_class_t *cls, ir_node *irn, pset *live) +void be_liveness_transfer(const arch_env_t *arch_env, + const arch_register_class_t *cls, + ir_node *node, ir_nodeset_t *nodeset) { - int i, n; - FIRM_DBG_REGISTER(firm_dbg_module_t *dbg, DBG_MODULE); + int i, arity; - DEBUG_ONLY( - const ir_node *x; - DBG((dbg, LEVEL_1, "%+F\n", irn)); - for(x = pset_first(live); x; x = pset_next(live)) - DBG((dbg, LEVEL_1, "\tlive: %+F\n", x)); - ) + /* You should better break out of your loop when hitting the first phi + * function. */ + assert(!is_Phi(node) && "liveness_transfer produces invalid results for phi nodes"); - /* You should better break out of your loop when hitting the first phi function. */ - assert(!is_Phi(irn) && "liveness_transfer produces invalid results for phi nodes"); +#ifndef SCHEDULE_PROJS + if (get_irn_mode(node) == mode_T) { + const ir_edge_t *edge; - if(arch_irn_consider_in_reg_alloc(arch_env, cls, irn)) { - ir_node *del = pset_remove_ptr(live, irn); - assert(irn == del); - } + foreach_out_edge(node, edge) { + ir_node *proj = get_edge_src_irn(edge); - for(i = 0, n = get_irn_arity(irn); i < n; ++i) { - ir_node *op = get_irn_n(irn, i); + if (arch_irn_consider_in_reg_alloc(arch_env, cls, proj)) { + ir_nodeset_remove(nodeset, proj); + } + } + } +#endif - if(arch_irn_consider_in_reg_alloc(arch_env, cls, op)) - pset_insert_ptr(live, op); + if (arch_irn_consider_in_reg_alloc(arch_env, cls, node)) { + ir_nodeset_remove(nodeset, node); } - return live; + arity = get_irn_arity(node); + for (i = 0; i < arity; ++i) { + ir_node *op = get_irn_n(node, i); + + if (arch_irn_consider_in_reg_alloc(arch_env, cls, op)) + ir_nodeset_insert(nodeset, op); + } } -pset *be_liveness_end_of_block(const be_lv_t *lv, const arch_env_t *arch_env, const arch_register_class_t *cls, const ir_node *bl, pset *live) + + +void be_liveness_end_of_block(const be_lv_t *lv, const arch_env_t *arch_env, + const arch_register_class_t *cls, + const ir_node *block, ir_nodeset_t *live) { int i; - be_lv_foreach(lv, bl, be_lv_state_end, i) { - ir_node *irn = be_lv_get_irn(lv, bl, i); - if(arch_irn_consider_in_reg_alloc(arch_env, cls, irn)) - pset_insert_ptr(live, irn); - } - return live; + assert(lv->nodes && "live sets must be computed"); + be_lv_foreach(lv, block, be_lv_state_end, i) { + ir_node *node = be_lv_get_irn(lv, block, i); + if(!arch_irn_consider_in_reg_alloc(arch_env, cls, node)) + continue; + + ir_nodeset_insert(live, node); + } } -pset *be_liveness_nodes_live_at(const be_lv_t *lv, const arch_env_t *arch_env, const arch_register_class_t *cls, const ir_node *pos, pset *live) + + +void be_liveness_nodes_live_at(const be_lv_t *lv, const arch_env_t *arch_env, + const arch_register_class_t *cls, + const ir_node *pos, ir_nodeset_t *live) { const ir_node *bl = is_Block(pos) ? pos : get_nodes_block(pos); ir_node *irn; @@ -727,25 +830,87 @@ pset *be_liveness_nodes_live_at(const be_lv_t *lv, const arch_env_t *arch_env, c * exit immediately, so that this node is still live */ if(irn == pos) - return live; + return; be_liveness_transfer(arch_env, cls, irn, live); } - - return live; } -pset *be_liveness_nodes_live_at_input(const be_lv_t *lv, const arch_env_t *arch_env, const arch_register_class_t *cls, const ir_node *pos, pset *live) +void be_liveness_nodes_live_at_input(const be_lv_t *lv, + const arch_env_t *arch_env, + const arch_register_class_t *cls, + const ir_node *pos, ir_nodeset_t *live) { const ir_node *bl = is_Block(pos) ? pos : get_nodes_block(pos); ir_node *irn; + assert(lv->nodes && "live sets must be computed"); be_liveness_end_of_block(lv, arch_env, cls, bl, live); sched_foreach_reverse(bl, irn) { be_liveness_transfer(arch_env, cls, irn, live); if(irn == pos) - return live; + return; } +} - return live; +static void collect_node(ir_node *irn, void *data) +{ + struct obstack *obst = data; + obstack_ptr_grow(obst, irn); } + +void be_live_chk_compare(be_lv_t *lv, lv_chk_t *lvc) +{ + ir_graph *irg = lv->irg; + + struct obstack obst; + ir_node **nodes; + ir_node **blocks; + int i, j; + + obstack_init(&obst); + + irg_block_walk_graph(irg, collect_node, NULL, &obst); + obstack_ptr_grow(&obst, NULL); + blocks = obstack_finish(&obst); + + irg_walk_graph(irg, collect_node, NULL, &obst); + obstack_ptr_grow(&obst, NULL); + nodes = obstack_finish(&obst); + + for (i = 0; blocks[i]; ++i) { + ir_node *bl = blocks[i]; + + for (j = 0; nodes[j]; ++j) { + ir_node *irn = nodes[j]; + if (!is_Block(irn)) { + int lvr_in = be_is_live_in (lv, bl, irn); + int lvr_out = be_is_live_out(lv, bl, irn); + int lvr_end = be_is_live_end(lv, bl, irn); + + int lvc_in = lv_chk_bl_in (lvc, bl, irn); + int lvc_out = lv_chk_bl_out(lvc, bl, irn); + int lvc_end = lv_chk_bl_end(lvc, bl, irn); + + if (lvr_in - lvc_in != 0) + ir_fprintf(stderr, "live in info for %+F at %+F differs: nml: %d, chk: %d\n", irn, bl, lvr_in, lvc_in); + + if (lvr_end - lvc_end != 0) + ir_fprintf(stderr, "live end info for %+F at %+F differs: nml: %d, chk: %d\n", irn, bl, lvr_end, lvc_end); + + if (lvr_out - lvc_out != 0) + ir_fprintf(stderr, "live out info for %+F at %+F differs: nml: %d, chk: %d\n", irn, bl, lvr_out, lvc_out); + } + } + } + + + obstack_free(&obst, NULL); +} + +void be_init_live(void) +{ + FIRM_DBG_REGISTER(dbg, "firm.be.liveness"); +} + +BE_REGISTER_MODULE_CONSTRUCTOR(be_init_live);