be_lv_info_node_t *res = NULL;
stat_ev_tim_push();
- irn_live = (be_lv_info_t*)ir_nodehashmap_get(&li->map, bl);
+ irn_live = ir_nodehashmap_get(be_lv_info_t, &li->map, bl);
if (irn_live != NULL) {
unsigned idx = get_irn_idx(irn);
static be_lv_info_node_t *be_lv_get_or_set(be_lv_t *li, ir_node *bl,
ir_node *irn)
{
- be_lv_info_t *irn_live = (be_lv_info_t*)ir_nodehashmap_get(&li->map, bl);
+ be_lv_info_t *irn_live = ir_nodehashmap_get(be_lv_info_t, &li->map, bl);
if (irn_live == NULL) {
irn_live = OALLOCNZ(&li->obst, be_lv_info_t, LV_STD_SIZE);
irn_live[0].head.n_size = LV_STD_SIZE-1;
static int be_lv_remove(be_lv_t *li, const ir_node *bl,
const ir_node *irn)
{
- be_lv_info_t *irn_live = (be_lv_info_t*)ir_nodehashmap_get(&li->map, bl);
+ be_lv_info_t *irn_live = ir_nodehashmap_get(be_lv_info_t, &li->map, bl);
if (irn_live != NULL) {
unsigned n = irn_live[0].head.n_members;
return 0;
}
-static void register_node(be_lv_t *lv, const ir_node *irn)
-{
- unsigned idx = get_irn_idx(irn);
- if (idx >= bitset_size(lv->nodes)) {
- bitset_t *nw = bitset_malloc(2 * idx);
- bitset_copy_into(nw, lv->nodes);
- bitset_free(lv->nodes);
- lv->nodes = nw;
- }
-
- bitset_set(lv->nodes, idx);
-}
-
/**
* Mark a node as live-in in a block.
*/
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));
n->flags |= be_lv_state_in;
- register_node(lv, irn);
}
/**
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));
n->flags |= be_lv_state_out | be_lv_state_end;
- register_node(lv, irn);
}
/**
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));
n->flags |= be_lv_state_end;
- register_node(lv, irn);
}
static struct {
*/
static void liveness_for_node(ir_node *irn)
{
- const ir_edge_t *edge;
ir_node *def_block;
bitset_clear_all(re.visited);
ir_node **nodes;
int i;
int n;
- unsigned last_idx;
if (lv->sets_valid)
return;
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 {
- bitset_clear_all(lv->nodes);
- }
ir_nodehashmap_init(&lv->map);
obstack_init(&lv->obst);
lv->irg = irg;
lv->hook_info.context = lv;
lv->hook_info.hook._hook_node_info = be_dump_liveness_block;
- lv->nodes = bitset_malloc(2 * get_irg_last_idx(lv->irg));
return lv;
}
be_liveness_invalidate_sets(lv);
be_liveness_invalidate_chk(lv);
- bitset_free(lv->nodes);
xfree(lv);
}
void be_liveness_remove(be_lv_t *lv, const ir_node *irn)
{
if (lv->sets_valid) {
- unsigned idx = get_irn_idx(irn);
lv_remove_walker_t w;
/*
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);
}
}
assert(!is_Phi(node) && "liveness_transfer produces invalid results for phi nodes");
if (get_irn_mode(node) == mode_T) {
- const ir_edge_t *edge;
-
foreach_out_edge(node, edge) {
ir_node *proj = get_edge_src_irn(edge);
const arch_register_class_t *cls,
const ir_node *block, ir_nodeset_t *live)
{
- int i;
-
- 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);
+ assert(lv->sets_valid && "live sets must be computed");
+ be_lv_foreach(lv, block, be_lv_state_end, node) {
if (!arch_irn_consider_in_reg_alloc(cls, node))
continue;
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, cls, bl, live);
sched_foreach_reverse(bl, irn) {