* @date 21.04.2007
* @author Sebastian Hack
* @version $Id$
- * @summary
+ * @brief
*
* Liveness checks as developed by Benoit Boissinot, Fabrice Rastello and myself.
*
*
* The precomputation remains valid as long as the CFG is not altered.
*/
-#ifdef HAVE_CONFIG_H
#include <config.h>
-#endif
#include <stdio.h>
#include "statev.h"
typedef struct _bl_info_t {
- ir_node *block; /**< The block. */
+ const ir_node *block; /**< The block. */
int be_tgt_calc : 1;
int id : 31; /**< a tight number for the block.
struct _lv_chk_t {
ir_phase ph;
- dfs_t *dfs;
- DEBUG_ONLY(firm_dbg_module_t *dbg;)
+ const dfs_t *dfs;
int n_blocks;
bitset_t *back_edge_src;
bitset_t *back_edge_tgt;
bl_info_t **map;
+ DEBUG_ONLY(firm_dbg_module_t *dbg;)
};
-static void *init_block_data(ir_phase *ph, ir_node *irn, void *old)
+static void *init_block_data(ir_phase *ph, const ir_node *irn, void *old)
{
lv_chk_t *lv = container_of(ph, lv_chk_t, ph);
bl_info_t *bi = phase_alloc(ph, sizeof(bi[0]));
* @param irn A node.
* @return 1 if the node shall be considered in liveness, 0 if not.
*/
-static INLINE int is_liveness_node(const ir_node *irn)
+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:
return 0;
default:;
}
int i, n;
for (i = 0, n = dfs_get_n_nodes(lv->dfs); i < n; ++i) {
- ir_node *bl = dfs_get_post_num_node(lv->dfs, i);
+ const ir_node *bl = dfs_get_post_num_node(lv->dfs, i);
bl_info_t *bi = get_block_info(lv, bl);
const ir_edge_t *edge;
}
-static void compute_back_edge_chain(lv_chk_t *lv, ir_node *bl)
+static void compute_back_edge_chain(lv_chk_t *lv, const ir_node *bl)
{
bitset_t *tmp = bitset_alloca(lv->n_blocks);
bl_info_t *bi = get_block_info(lv, bl);
}
-static INLINE void compute_back_edge_chains(lv_chk_t *lv)
+static inline void compute_back_edge_chains(lv_chk_t *lv)
{
bitset_pos_t elm;
int i, n;
}
for (i = 0, n = dfs_get_n_nodes(lv->dfs); i < n; ++i) {
- ir_node *bl = dfs_get_post_num_node(lv->dfs, i);
- bl_info_t *bi = get_block_info(lv, bl);
+ const ir_node *bl = dfs_get_post_num_node(lv->dfs, i);
+ bl_info_t *bi = get_block_info(lv, bl);
const ir_edge_t *edge;
}
}
}
+
+ for (i = 0, n = dfs_get_n_nodes(lv->dfs); i < n; ++i) {
+ const ir_node *bl = dfs_get_post_num_node(lv->dfs, i);
+ bl_info_t *bi = get_block_info(lv, bl);
+ bitset_set(bi->be_tgt_reach, bi->id);
+ }
}
-lv_chk_t *lv_chk_new(ir_graph *irg)
+lv_chk_t *lv_chk_new(ir_graph *irg, const dfs_t *dfs)
{
- lv_chk_t *res = xmalloc(sizeof(res[0]));
+ lv_chk_t *res = XMALLOC(lv_chk_t);
struct obstack *obst;
int i;
+ edges_deactivate(irg);
+ edges_activate(irg);
+ compute_doms(irg);
+
+ stat_ev_tim_push();
phase_init(&res->ph, "liveness check", irg, PHASE_DEFAULT_GROWTH, init_block_data, NULL);
obst = phase_obst(&res->ph);
FIRM_DBG_REGISTER(res->dbg, "ir.ana.lvchk");
- res->dfs = dfs_new(&absgraph_irg_cfg_succ, irg);
+ res->dfs = dfs;
res->n_blocks = dfs_get_n_nodes(res->dfs);
res->back_edge_src = bitset_obstack_alloc(obst, res->n_blocks);
res->back_edge_tgt = bitset_obstack_alloc(obst, res->n_blocks);
- res->map = obstack_alloc(obst, res->n_blocks * sizeof(res->map[0]));
+ res->map = OALLOCNZ(obst, bl_info_t*, res->n_blocks);
-#if 1
+#if 0
{
char name[256];
FILE *f;
/* fill the map which maps pre_num to block infos */
for (i = res->n_blocks - 1; i >= 0; --i) {
- ir_node *irn = dfs_get_pre_num_node(res->dfs, i);
- bl_info_t *bi = phase_get_or_set_irn_data(&res->ph, irn);
+ ir_node *irn = (ir_node *) dfs_get_pre_num_node(res->dfs, i);
+ bl_info_t *bi = phase_get_or_set_irn_data(&res->ph, irn);
+ assert(bi->id < res->n_blocks);
+ assert(res->map[bi->id] == NULL);
res->map[bi->id] = bi;
}
/* compute back edge chains */
compute_back_edge_chains(res);
-
-DEBUG_ONLY({
- DBG((res->dbg, LEVEL_1, "liveness chk in %+F\n", irg));
- for (i = res->n_blocks - 1; i >= 0; --i) {
- ir_node *irn = dfs_get_pre_num_node(res->dfs, i);
- bl_info_t *bi = get_block_info(res, irn);
- DBG((res->dbg, LEVEL_1, "lv_chk for %d -> %+F\n", i, irn));
- DBG((res->dbg, LEVEL_1, "\tred reach: %B\n", bi->red_reachable));
- DBG((res->dbg, LEVEL_1, "\ttgt reach: %B\n", bi->be_tgt_reach));
- }
- })
+#ifndef NDEBUG
+ DBG((res->dbg, LEVEL_1, "liveness chk in %+F\n", irg));
+ for (i = res->n_blocks - 1; i >= 0; --i) {
+ const ir_node *irn = dfs_get_pre_num_node(res->dfs, i);
+ bl_info_t *bi = get_block_info(res, irn);
+ DBG((res->dbg, LEVEL_1, "lv_chk for %d -> %+F\n", i, irn));
+ DBG((res->dbg, LEVEL_1, "\tred reach: %B\n", bi->red_reachable));
+ DBG((res->dbg, LEVEL_1, "\ttgt reach: %B\n", bi->be_tgt_reach));
+ }
+#endif
DBG((res->dbg, LEVEL_1, "back edge src: %B\n", res->back_edge_src));
DBG((res->dbg, LEVEL_1, "back edge tgt: %B\n", res->back_edge_tgt));
+ stat_ev_tim_pop("lv_chk_cons_time");
return res;
}
void lv_chk_free(lv_chk_t *lv)
{
- obstack_free(phase_obst(&lv->ph), NULL);
- dfs_free(lv->dfs);
+ phase_free(&lv->ph);
xfree(lv);
}
*/
unsigned lv_chk_bl_in_mask(const lv_chk_t *lv, const ir_node *bl, const ir_node *var)
{
- stat_ev_cnt_decl(uses);
- stat_ev_cnt_decl(iter);
-
ir_node *def_bl;
const ir_edge_t *edge;
+ stat_ev_cnt_decl(uses);
+
int res = 0;
assert(is_Block(bl) && "can only check for liveness in a block");
unsigned lv_chk_bl_end_mask(const lv_chk_t *lv, const ir_node *bl, const ir_node *var)
{
- stat_ev_cnt_decl(uses);
- stat_ev_cnt_decl(iter);
-
ir_node *def_bl;
const ir_edge_t *edge;
+ stat_ev_cnt_decl(uses);
+
int res = 0;
assert(is_Block(bl) && "can only check for liveness in a block");
def_bl = get_nodes_block(var);
if (!block_dominates(def_bl, bl)) {
goto end;
- }
-
- else {
+ } else {
bitset_t *uses = bitset_alloca(lv->n_blocks);
bitset_t *tmp = bitset_alloca(lv->n_blocks);
int min_dom = get_Block_dom_tree_pre_num(def_bl) + 1;
*/
unsigned lv_chk_bl_xxx(const lv_chk_t *lv, const ir_node *bl, const ir_node *var)
{
- stat_ev_cnt_decl(uses);
- stat_ev_cnt_decl(iter);
-
int res = 0;
ir_node *def_bl;
+ stat_ev_cnt_decl(uses);
+ stat_ev_cnt_decl(iter);
assert(is_Block(bl) && "can only check for liveness in a block");
if (!is_liveness_node(var))
return 0;
- stat_ev_ctx_push_fobj("node", var);
- stat_ev("lv_chk");
+ stat_ev_ctx_push_fmt("lv_chk", "%u", get_irn_idx(var));
+ stat_ev_tim_push();
/* If there is no dominance relation, go out, too */
def_bl = get_nodes_block(var);
* We try to gather as much information as possible during looking
* at the uses.
*
- * Note that we know for shure that bl != def_bl. That is sometimes
+ * Note that we know for sure that bl != def_bl. That is sometimes
* silently exploited below.
*/
else {
- bitset_t *tmp = bitset_alloca(lv->n_blocks);
- bitset_t *uses = bitset_alloca(lv->n_blocks);
bl_info_t *def = get_block_info(lv, def_bl);
bl_info_t *bli = get_block_info(lv, bl);
+ bitset_t *uses = bitset_alloca(lv->n_blocks);
+ bitset_t *Tq;
- int i, min_dom, max_dom;
+ unsigned i, min_dom, max_dom;
const ir_edge_t *edge;
/* if the block has no DFS info, it cannot be reached.
if (!bli)
goto end;
+ (void) def;
DBG((lv->dbg, LEVEL_2, "lv check %+F (def in %+F #%d) in different block %+F #%d\n",
var, def_bl, def->id, bl, bli->id));
res |= mask;
bi = get_block_info(lv, use_bl);
- bitset_set(uses, bi->id);
+ if (bi)
+ bitset_set(uses, bi->id);
}
/* get the dominance range which really matters. all uses outside
/* prepare a set with all reachable back edge targets.
* this will determine our "looking points" from where
- * we will search/find the calculated uses.
- *
- * Since there might be no reachable back edge targets
- * we add the current block also since reachability of
- * uses are then checked from there. */
- bitset_copy(tmp, bli->be_tgt_reach);
- bitset_set (tmp, bli->id);
+ * we will search/find the calculated uses. */
+ Tq = bli->be_tgt_reach;
/* now, visit all viewing points in the temporary bitset lying
* in the dominance range of the variable. Note that for reducible
* flow-graphs the first iteration is sufficient and the loop
* will be left. */
- DBG((lv->dbg, LEVEL_2, "\tbe tgt reach: %B, dom span: [%d, %d]\n", tmp, min_dom, max_dom));
- for (i = bitset_next_set(tmp, min_dom); i >= 0 && i <= max_dom; i = bitset_next_set(tmp, i + 1)) {
+ DBG((lv->dbg, LEVEL_2, "\tbe tgt reach: %B, dom span: [%d, %d]\n", Tq, min_dom, max_dom));
+ i = bitset_next_set(Tq, min_dom);
+ while (i <= max_dom) {
bl_info_t *ti = lv->map[i];
int use_in_current_block = bitset_is_set(uses, ti->id);
+ stat_ev_cnt_inc(iter);
+
/*
- * This is somehat tricky. Since this routine handles both, live in
+ * This is somewhat tricky. Since this routine handles both, live in
* and end/out we have to handle all the border cases correctly.
* Each node is in its own red_reachable set (see calculation
* function above). That means, that in the case where bl == t, the
- * intersection check of uses and rechability below will always
+ * intersection check of uses and reachability below will always
* find an intersection, namely t.
*
* However, if a block contains a use and the variable is dead
goto end;
}
- bitset_andnot(tmp, ti->red_reachable);
-
/*
* if we deleted a use do to the commentary above, we have to
* re-add it since it might be visible from further view points
*/
if (use_in_current_block)
bitset_set(uses, ti->id);
+
+ i = bitset_next_set(Tq, get_Block_dom_max_subtree_pre_num(ti->block) + 1);
}
}
end:
+ stat_ev_tim_pop("lv_chk_query_time");
stat_ev_cnt_done(uses, "lv_chk_uses");
stat_ev_cnt_done(iter, "lv_chk_iter");
- stat_ev_ctx_pop();
+ stat_ev_ctx_pop("lv_chk");
return res;
}
projects / libfirm / blobdiff