/*
- * 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.
*
case iro_Bad:
case iro_End:
case iro_Anchor:
+ case iro_NoMem:
return 0;
default:;
}
* 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);
void *data;
};
+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
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)
}
}
-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;
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
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);
}
free(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);