+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);
+}
+
+static const char *lv_flags_to_str(unsigned flags)
+{
+ static const char *states[] = {
+ "---",
+ "i--",
+ "-e-",
+ "ie-",
+ "--o",
+ "i-o",
+ "-eo",
+ "ieo"
+ };
+
+ return states[flags & 7];
+}
+
+static void lv_dump_block(void *context, FILE *f, const ir_node *bl)
+{
+ if(is_Block(bl)) {
+ be_lv_t *lv = context;
+ struct _be_lv_info_t *info = phase_get_irn_data(&lv->ph, bl);
+
+ fprintf(f, "liveness:\n");
+ if(info) {
+ unsigned n = info[0].u.head.n_members;
+ unsigned i;
+
+ for(i = 0; i < n; ++i) {
+ struct _be_lv_info_node_t *n = &info[i+1].u.node;
+ ir_fprintf(f, "%s %+F\n", lv_flags_to_str(n->flags), get_idx_irn(lv->irg, n->idx));
+ }
+ }
+ }
+}
+
+static void *lv_phase_data_init(phase_t *phase, ir_node *irn, void *old)
+{
+ struct _be_lv_info_t *info = phase_alloc(phase, LV_STD_SIZE * sizeof(info[0]));
+ memset(info, 0, LV_STD_SIZE * sizeof(info[0]));
+ info[0].u.head.n_size = LV_STD_SIZE - 1;
+ return info;
+}
+
+static void compute_liveness(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, liveness_for_node, NULL, &w);
+ bitset_free(w.data);
+}
+
+/* Compute the inter block liveness for a graph. */
+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));
+ 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;
+}
+
+void be_liveness_recompute(be_lv_t *lv)
+{
+ unsigned 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);
+
+ phase_free(&lv->ph);
+ phase_init(&lv->ph, "liveness", lv->irg, PHASE_DEFAULT_GROWTH, lv_phase_data_init);
+ 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);
+ free(lv);
+}
+
+void be_liveness_remove(be_lv_t *lv, ir_node *irn)
+{
+ 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);
+}
+
+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);
+}
+
+void be_liveness_update(be_lv_t *lv, ir_node *irn)
+{
+ be_liveness_remove(lv, 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;
+ be_lv_t *lv = w->lv;
+ be_lv_t *fresh = w->data;
+
+ struct _be_lv_info_t *curr = phase_get_irn_data(&lv->ph, bl);
+ struct _be_lv_info_t *fr = phase_get_irn_data(&fresh->ph, bl);
+
+ if(!fr && curr && curr[0].u.head.n_members > 0) {
+ unsigned i;
+
+ ir_fprintf(stderr, "%+F liveness should be empty but current liveness contains:\n", bl);
+ for(i = 0; i < curr[0].u.head.n_members; ++i) {
+ ir_fprintf(stderr, "\t%+F\n", get_idx_irn(lv->irg, curr[1 + i].u.node.idx));
+ }
+ }
+
+ else if(curr) {
+ unsigned n_curr = curr[0].u.head.n_members;
+ unsigned n_fresh = fr[0].u.head.n_members;
+
+ unsigned i;
+
+ if(n_curr != n_fresh) {
+ ir_fprintf(stderr, "%+F: liveness set sizes differ. curr %d, correct %d\n", bl, n_curr, n_fresh);
+
+ ir_fprintf(stderr, "current:\n");
+ for(i = 0; i < n_curr; ++i) {
+ struct _be_lv_info_node_t *n = &curr[1 + i].u.node;
+ ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, get_idx_irn(lv->irg, n->idx), lv_flags_to_str(n->flags));
+ }
+
+ ir_fprintf(stderr, "correct:\n");
+ for(i = 0; i < n_fresh; ++i) {
+ struct _be_lv_info_node_t *n = &fr[1 + i].u.node;
+ ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, get_idx_irn(lv->irg, n->idx), lv_flags_to_str(n->flags));
+ }
+ }
+ }
+}
+
+void be_liveness_check(be_lv_t *lv)
+{
+ struct _lv_walker_t w;
+ be_lv_t *fresh = be_liveness(lv->irg);
+
+ w.lv = lv;
+ w.data = fresh;
+ irg_block_walk_graph(lv->irg, lv_check_walker, NULL, &w);
+ be_liveness_free(fresh);
+}
+
+
+static void lv_dump_block_walker(ir_node *irn, void *data)
+{
+ struct _lv_walker_t *w = data;
+ if(is_Block(irn))
+ lv_dump_block(w->lv, w->data, irn);
+}
+
+
+/* Dump the liveness information for a graph. */
+void be_liveness_dump(const be_lv_t *lv, FILE *f)
+{
+ struct _lv_walker_t w;
+
+ w.lv = (be_lv_t *) lv;
+ w.data = f;
+ irg_block_walk_graph(lv->irg, lv_dump_block_walker, NULL, &w);