X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbelive.c;h=c223029e0369f2bc77b8d35c13b60d346bf824e6;hb=81d44459b367b64abbb26feeb7c2f31738f542c0;hp=ca12745d05abacd9b9c3de707fafca455aef02df;hpb=5057c4b3b6c48dc75dee684cd172ce4cfed00da7;p=libfirm diff --git a/ir/be/belive.c b/ir/be/belive.c index ca12745d0..c223029e0 100644 --- a/ir/be/belive.c +++ b/ir/be/belive.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. * @@ -24,9 +24,10 @@ * @date 06.12.2004 * @version $Id$ */ -#ifdef HAVE_CONFIG_H #include "config.h" -#endif + +/* statev is expensive here, only enable when needed */ +#define DISABLE_STATEV #include "impl.h" #include "iredges_t.h" @@ -36,6 +37,10 @@ #include "irdump_t.h" #include "irnodeset.h" +#include "dfs_t.h" +#include "absgraph.h" +#include "statev.h" + #include "beutil.h" #include "belive_t.h" #include "beirg_t.h" @@ -44,23 +49,32 @@ DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;) -/* see comment in compute_liveness() */ -#define LV_COMPUTE_SORTED #define LV_STD_SIZE 64 + +/* if defined, use binary search for already live nodes, else linear */ #define LV_USE_BINARY_SEARCH #undef LV_INTESIVE_CHECKS -static INLINE int is_liveness_node(const ir_node *irn) +void be_live_chk_compare(be_lv_t *lv, lv_chk_t *lvc); + +/** + * Filter out some nodes for which we never need liveness. + * + * @param irn the node t check + * @return 0 if no liveness info is needed, 1 else + */ +static inline int is_liveness_node(const ir_node *irn) { - switch(get_irn_opcode(irn)) { + switch (get_irn_opcode(irn)) { case iro_Block: case iro_Bad: case iro_End: + case iro_Anchor: + case iro_NoMem: return 0; - default:; + default: + return 1; } - - return 1; } int (be_lv_next_irn)(const struct _be_lv_t *lv, const ir_node *bl, unsigned flags, int i) @@ -90,7 +104,7 @@ int (be_is_live_end)(const be_lv_t *lv, const ir_node *block, const ir_node *irn #ifdef LV_USE_BINARY_SEARCH -static INLINE unsigned _be_liveness_bsearch(struct _be_lv_info_t *arr, unsigned idx) +static inline unsigned _be_liveness_bsearch(struct _be_lv_info_t *arr, unsigned idx) { struct _be_lv_info_t *payload = arr + 1; @@ -102,15 +116,6 @@ static INLINE unsigned _be_liveness_bsearch(struct _be_lv_info_t *arr, unsigned if(n == 0) return 0; -#if 0 - if(idx < payload[0].u.node.idx) - return 0; - - if(idx > payload[n - 1].u.node.idx) - return n - 1; -#endif - - /* start a binary search for the requested node. */ while(lo < hi) { int md = lo + ((hi - lo) >> 1); unsigned md_idx = payload[md].u.node.idx; @@ -147,7 +152,7 @@ static INLINE unsigned _be_liveness_bsearch(struct _be_lv_info_t *arr, unsigned /** * This function searches linearly for the node in the array. */ -static INLINE unsigned _be_liveness_bsearch(struct _be_lv_info_t *arr, unsigned idx) { +static inline unsigned _be_liveness_bsearch(struct _be_lv_info_t *arr, unsigned idx) { unsigned n = arr[0].u.head.n_members; unsigned i; @@ -162,8 +167,11 @@ static INLINE unsigned _be_liveness_bsearch(struct _be_lv_info_t *arr, unsigned struct _be_lv_info_node_t *be_lv_get(const struct _be_lv_t *li, const ir_node *bl, const ir_node *irn) { - struct _be_lv_info_t *irn_live = phase_get_irn_data(&li->ph, bl); + struct _be_lv_info_t *irn_live; + struct _be_lv_info_node_t *res = NULL; + stat_ev_tim_push(); + irn_live = phase_get_irn_data(&li->ph, bl); if(irn_live) { unsigned idx = get_irn_idx(irn); @@ -171,14 +179,15 @@ struct _be_lv_info_node_t *be_lv_get(const struct _be_lv_t *li, const ir_node *b int pos = _be_liveness_bsearch(irn_live, idx); /* Get the record in question. 1 must be added, since the first record contains information about the array and must be skipped. */ - struct _be_lv_info_node_t *res = &irn_live[pos + 1].u.node; + struct _be_lv_info_node_t *rec = &irn_live[pos + 1].u.node; /* Check, if the irn is in deed in the array. */ - if(res->idx == idx) - return res; + if(rec->idx == idx) + res = rec; } + stat_ev_tim_pop("be_lv_get"); - return NULL; + return res; } static struct _be_lv_info_node_t *be_lv_get_or_set(struct _be_lv_t *li, ir_node *bl, ir_node *irn) @@ -248,7 +257,8 @@ static struct _be_lv_info_node_t *be_lv_get_or_set(struct _be_lv_t *li, ir_node * Removes a node from the list of live variables of a block. * @return 1 if the node was live at that block, 0 if not. */ -static int be_lv_remove(struct _be_lv_t *li, ir_node *bl, ir_node *irn) +static int be_lv_remove(struct _be_lv_t *li, const ir_node *bl, + const ir_node *irn) { struct _be_lv_info_t *irn_live = phase_get_irn_data(&li->ph, bl); @@ -294,7 +304,7 @@ static void register_node(be_lv_t *lv, const ir_node *irn) /** * Mark a node as live-in in a block. */ -static INLINE void mark_live_in(be_lv_t *lv, ir_node *block, 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((dbg, LEVEL_2, "marking %+F live in at %+F\n", irn, block)); @@ -305,7 +315,7 @@ static INLINE void mark_live_in(be_lv_t *lv, ir_node *block, ir_node *irn) /** * Mark a node as live-out in a block. */ -static INLINE void mark_live_out(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((dbg, LEVEL_2, "marking %+F live out at %+F\n", irn, block)); @@ -316,7 +326,7 @@ static INLINE void mark_live_out(be_lv_t *lv, ir_node *block, ir_node *irn) /** * Mark a node as live-end in a block. */ -static INLINE void mark_live_end(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((dbg, LEVEL_2, "marking %+F live end at %+F\n", irn, block)); @@ -324,78 +334,90 @@ static INLINE void mark_live_end(be_lv_t *lv, ir_node *block, ir_node *irn) register_node(lv, irn); } +static struct { + be_lv_t *lv; /**< The liveness object. */ + ir_node *def; /**< The node (value). */ + ir_node *def_block; /**< The block of def. */ + bitset_t *visited; /**< A set were all visited blocks are recorded. */ +} re; + /** * Mark a node (value) live out at a certain block. Do this also * transitively, i.e. if the block is not the block of the value's * definition, all predecessors are also marked live. - * @param def The node (value). * @param block The block to mark the value live out of. - * @param visited A set were all visited blocks are recorded. * @param is_true_out Is the node real out there or only live at the end * of the block. */ -static void live_end_at_block(be_lv_t *lv, ir_node *def, ir_node *block, bitset_t *visited, int is_true_out) +static void live_end_at_block(ir_node *block, int is_true_out) { + be_lv_t *lv = re.lv; + ir_node *def = re.def; + bitset_t *visited; + mark_live_end(lv, block, def); - if(is_true_out) + if (is_true_out) mark_live_out(lv, block, def); - if(!bitset_contains_irn(visited, block)) { + visited = re.visited; + if (!bitset_contains_irn(visited, block)) { bitset_add_irn(visited, block); /* - * If this block is not the definition block, we have to go up - * further. - */ - if(get_nodes_block(def) != block) { - int i, n; + * If this block is not the definition block, we have to go up + * further. + */ + if (re.def_block != block) { + int i; mark_live_in(lv, block, def); - for(i = 0, n = get_Block_n_cfgpreds(block); i < n; ++i) - live_end_at_block(lv, def, get_Block_cfgpred_block(block, i), visited, 1); + for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) + live_end_at_block(get_Block_cfgpred_block(block, i), 1); } - } } -struct _lv_walker_t { +typedef struct _lv_walker_t { be_lv_t *lv; void *data; -}; +} lv_walker_t; + +typedef struct lv_remove_walker_t { + be_lv_t *lv; + const ir_node *irn; +} lv_remove_walker_t; + /** * Liveness analysis for a value. - * This functions is meant to be called by a firm walker, to compute the - * set of all blocks a value is live in. - * @param irn The node (value). - * @param env Ignored. + * Compute the set of all blocks a value is live in. + * @param irn The node (value). */ -static void liveness_for_node(ir_node *irn, void *data) +static void liveness_for_node(ir_node *irn) { - struct _lv_walker_t *walker = data; - be_lv_t *lv = walker->lv; - bitset_t *visited = walker->data; const ir_edge_t *edge; ir_node *def_block; - /* Don't compute liveness information for non-data nodes. */ - if(!is_liveness_node(irn)) - return; - - bitset_clear_all(visited); + bitset_clear_all(re.visited); def_block = get_nodes_block(irn); + re.def = irn; + re.def_block = def_block; + /* Go over all uses of the value */ foreach_out_edge(irn, edge) { ir_node *use = edge->src; ir_node *use_block; + DBG((dbg, LEVEL_4, "%+F: use at %+F, pos %d in %+F\n", irn, use, edge->pos, get_block(use))); + assert(get_irn_n(use, edge->pos) == irn); + /* * If the usage is no data node, skip this use, since it does not * affect the liveness of the node. */ - if(!is_liveness_node(use)) + if (!is_liveness_node(use)) continue; /* Get the block where the usage is in. */ @@ -406,23 +428,23 @@ static void liveness_for_node(ir_node *irn, void *data) * through which the value reaches the phi function and mark the * value as live out of that block. */ - if(is_Phi(use)) { + if (is_Phi(use)) { ir_node *pred_block = get_Block_cfgpred_block(use_block, edge->pos); - live_end_at_block(lv, irn, pred_block, visited, 0); + live_end_at_block(pred_block, 0); } /* * Else, the value is live in at this block. Mark it and call live * out on the predecessors. */ - else if(def_block != use_block) { - int i, n; + else if (def_block != use_block) { + int i; - mark_live_in(lv, use_block, irn); + mark_live_in(re.lv, use_block, irn); - for(i = 0, n = get_Block_n_cfgpreds(use_block); i < n; ++i) { + for (i = get_Block_n_cfgpreds(use_block) - 1; i >= 0; --i) { ir_node *pred_block = get_Block_cfgpred_block(use_block, i); - live_end_at_block(lv, irn, pred_block, visited, 1); + live_end_at_block(pred_block, 1); } } } @@ -430,10 +452,8 @@ static void liveness_for_node(ir_node *irn, void *data) static void lv_remove_irn_walker(ir_node *bl, void *data) { - struct _lv_walker_t *w = data; - be_lv_t *lv = w->lv; - ir_node *irn = w->data; - be_lv_remove(lv, bl, irn); + lv_remove_walker_t *w = data; + be_lv_remove(w->lv, bl, w->irn); } static const char *lv_flags_to_str(unsigned flags) @@ -471,7 +491,7 @@ static void lv_dump_block(void *context, FILE *f, const ir_node *bl) } } -static void *lv_phase_data_init(ir_phase *phase, ir_node *irn, void *old) +static void *lv_phase_data_init(ir_phase *phase, const ir_node *irn, void *old) { struct _be_lv_info_t *info = phase_alloc(phase, LV_STD_SIZE * sizeof(info[0])); (void) irn; @@ -482,68 +502,68 @@ static void *lv_phase_data_init(ir_phase *phase, ir_node *irn, void *old) return info; } -static void collect_nodes(ir_node *irn, void *data) +/** + * Walker, collect all nodes for which we want calculate liveness info + * on an obstack. + */ +static void collect_liveness_nodes(ir_node *irn, void *data) { - struct obstack *obst = data; + ir_node **nodes = 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; + nodes[get_irn_idx(irn)] = irn; } 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); + stat_ev_tim_push(); + n = get_irg_last_idx(lv->irg); + nodes = NEW_ARR_F(ir_node *, n); + memset(nodes, 0, sizeof(nodes[0]) * n); /* * 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. + * will not need to move around the data. */ -#ifdef LV_COMPUTE_SORTED - qsort(nodes, n, sizeof(nodes[0]), node_idx_cmp); -#endif + irg_walk_graph(lv->irg, NULL, collect_liveness_nodes, nodes); - w.lv = lv; - w.data = bitset_obstack_alloc(&obst, get_irg_last_idx(lv->irg)); + re.lv = lv; + re.visited = bitset_malloc(n); - for (i = 0; i < n; ++i) - liveness_for_node(nodes[i], &w); + for (i = 0; i < n; ++i) { + if (nodes[i] != NULL) + liveness_for_node(nodes[i]); + } - obstack_free(&obst, NULL); + DEL_ARR_F(nodes); + free(re.visited); register_hook(hook_node_info, &lv->hook_info); + stat_ev_tim_pop("be_lv_sets_cons"); } void be_liveness_assure_sets(be_lv_t *lv) { if (!lv->nodes) { + BE_TIMER_PUSH(t_live); + 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); + /* be_live_chk_compare(lv, lv->lvc); */ + + BE_TIMER_POP(t_live); } } void be_liveness_assure_chk(be_lv_t *lv) { #ifndef USE_LIVE_CHK + BE_TIMER_PUSH(t_verify); be_liveness_assure_sets(lv); + BE_TIMER_POP(t_verify); #else (void) lv; #endif @@ -562,12 +582,12 @@ void be_liveness_invalidate(be_lv_t *lv) /* Compute the inter block liveness for a graph. */ be_lv_t *be_liveness(ir_graph *irg) { - be_lv_t *lv = xmalloc(sizeof(lv[0])); + be_lv_t *lv = XMALLOCZ(be_lv_t); - memset(lv, 0, sizeof(lv[0])); - lv->irg = irg; + lv->irg = irg; #ifdef USE_LIVE_CHK - lv->lvc = lv_chk_new(irg); + lv->dfs = dfs_new(&absgraph_irg_cfg_succ, irg); + lv->lvc = lv_chk_new(lv->irg, lv->dfs); #endif lv->hook_info.context = lv; lv->hook_info.hook._hook_node_info = lv_dump_block; @@ -577,40 +597,47 @@ be_lv_t *be_liveness(ir_graph *irg) void be_liveness_recompute(be_lv_t *lv) { - unsigned last_idx = get_irg_last_idx(lv->irg); + unsigned last_idx; + + BE_TIMER_PUSH(t_live); + last_idx = get_irg_last_idx(lv->irg); if(last_idx >= bitset_size(lv->nodes)) { bitset_free(lv->nodes); lv->nodes = bitset_malloc(last_idx * 2); - } - - else + } else bitset_clear_all(lv->nodes); phase_free(&lv->ph); phase_init(&lv->ph, "liveness", lv->irg, PHASE_DEFAULT_GROWTH, lv_phase_data_init, NULL); compute_liveness(lv); + + BE_TIMER_POP(t_live); } void be_liveness_free(be_lv_t *lv) { be_liveness_invalidate(lv); - free(lv); +#ifdef USE_LIVE_CHK + lv_chk_free(lv->lvc); + dfs_free(lv->dfs); +#endif + xfree(lv); } -void be_liveness_remove(be_lv_t *lv, ir_node *irn) +void be_liveness_remove(be_lv_t *lv, const ir_node *irn) { if (lv->nodes) { unsigned idx = get_irn_idx(irn); - struct _lv_walker_t w; + lv_remove_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; + w.lv = lv; + w.irn = 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); @@ -619,12 +646,12 @@ void be_liveness_remove(be_lv_t *lv, ir_node *irn) void be_liveness_introduce(be_lv_t *lv, ir_node *irn) { - 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); + /* Don't compute liveness information for non-data nodes. */ + if (lv->nodes && is_liveness_node(irn)) { + re.lv = lv; + re.visited = bitset_malloc(get_irg_last_idx(lv->irg)); + liveness_for_node(irn); + bitset_free(re.visited); } } @@ -636,7 +663,7 @@ void be_liveness_update(be_lv_t *lv, ir_node *irn) static void lv_check_walker(ir_node *bl, void *data) { - struct _lv_walker_t *w = data; + lv_walker_t *w = data; be_lv_t *lv = w->lv; be_lv_t *fresh = w->data; @@ -678,7 +705,7 @@ static void lv_check_walker(ir_node *bl, void *data) void be_liveness_check(be_lv_t *lv) { - struct _lv_walker_t w; + lv_walker_t w; be_lv_t *fresh = be_liveness(lv->irg); w.lv = lv; @@ -690,7 +717,7 @@ void be_liveness_check(be_lv_t *lv) static void lv_dump_block_walker(ir_node *irn, void *data) { - struct _lv_walker_t *w = data; + lv_walker_t *w = data; if(is_Block(irn)) lv_dump_block(w->lv, w->data, irn); } @@ -699,7 +726,7 @@ static void lv_dump_block_walker(ir_node *irn, void *data) /* Dump the liveness information for a graph. */ void be_liveness_dump(const be_lv_t *lv, FILE *f) { - struct _lv_walker_t w; + lv_walker_t w; w.lv = (be_lv_t *) lv; w.data = f; @@ -759,8 +786,7 @@ int be_check_dominance(ir_graph *irg) return !problem_found; } -void be_liveness_transfer(const arch_env_t *arch_env, - const arch_register_class_t *cls, +void be_liveness_transfer(const arch_register_class_t *cls, ir_node *node, ir_nodeset_t *nodeset) { int i, arity; @@ -775,13 +801,11 @@ void be_liveness_transfer(const arch_env_t *arch_env, foreach_out_edge(node, edge) { ir_node *proj = get_edge_src_irn(edge); - if (arch_irn_consider_in_reg_alloc(arch_env, cls, proj)) { + if (arch_irn_consider_in_reg_alloc(cls, proj)) { ir_nodeset_remove(nodeset, proj); } } - } - - if (arch_irn_consider_in_reg_alloc(arch_env, cls, node)) { + } else if (arch_irn_consider_in_reg_alloc(cls, node)) { ir_nodeset_remove(nodeset, node); } @@ -789,14 +813,14 @@ void be_liveness_transfer(const arch_env_t *arch_env, 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)) + if (arch_irn_consider_in_reg_alloc(cls, op)) ir_nodeset_insert(nodeset, op); } } -void be_liveness_end_of_block(const be_lv_t *lv, const arch_env_t *arch_env, +void be_liveness_end_of_block(const be_lv_t *lv, const arch_register_class_t *cls, const ir_node *block, ir_nodeset_t *live) { @@ -805,7 +829,7 @@ void be_liveness_end_of_block(const be_lv_t *lv, const arch_env_t *arch_env, 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)) + if (!arch_irn_consider_in_reg_alloc(cls, node)) continue; ir_nodeset_insert(live, node); @@ -814,14 +838,14 @@ void be_liveness_end_of_block(const be_lv_t *lv, const arch_env_t *arch_env, -void be_liveness_nodes_live_at(const be_lv_t *lv, const arch_env_t *arch_env, +void be_liveness_nodes_live_at(const be_lv_t *lv, 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; - be_liveness_end_of_block(lv, arch_env, cls, bl, live); + be_liveness_end_of_block(lv, cls, bl, live); sched_foreach_reverse(bl, irn) { /* * If we encounter the node we want to insert the Perm after, @@ -830,24 +854,7 @@ void be_liveness_nodes_live_at(const be_lv_t *lv, const arch_env_t *arch_env, if(irn == pos) return; - be_liveness_transfer(arch_env, cls, irn, 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; + be_liveness_transfer(cls, irn, live); } } @@ -876,11 +883,12 @@ void be_live_chk_compare(be_lv_t *lv, lv_chk_t *lvc) obstack_ptr_grow(&obst, NULL); nodes = obstack_finish(&obst); - for (i = 0; blocks[i]; ++i) { - ir_node *bl = blocks[i]; + stat_ev_ctx_push("be_lv_chk_compare"); + for (j = 0; nodes[j]; ++j) { + ir_node *irn = nodes[j]; + 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); @@ -901,7 +909,7 @@ void be_live_chk_compare(be_lv_t *lv, lv_chk_t *lvc) } } } - + stat_ev_ctx_pop("be_lv_chk_compare"); obstack_free(&obst, NULL); }