+ }
+
+ it->bor = NULL;
+ assert(0 == pset_count(it->living) && "Something has survived! (At the end of the block it->living must be empty)");
+ }
+
+ if (it->n_blocks != -1)
+ free_clique_iter(it);
+
+ return -1;
+}
+
+int be_ifg_cliques_begin(const be_ifg_t *ifg, cliques_iter_t *it,
+ ir_node **buf)
+{
+ ir_node *start_bl = get_irg_start_block(ifg->env->irg);
+
+ obstack_init(&it->ob);
+ dom_tree_walk(start_bl, get_blocks_dom_order, NULL, it);
+
+ it->cenv = ifg->env;
+ it->buf = buf;
+ it->n_blocks = obstack_object_size(&it->ob) / sizeof(void *);
+ it->blocks = (ir_node**)obstack_finish(&it->ob);
+ it->blk = 0;
+ it->bor = NULL;
+ it->living = pset_new_ptr(2 * arch_register_class_n_regs(it->cenv->cls));
+
+ return get_next_clique(it);
+}
+
+int be_ifg_cliques_next(cliques_iter_t *iter)
+{
+ return get_next_clique(iter);
+}
+
+void be_ifg_cliques_break(cliques_iter_t *iter)
+{
+ free_clique_iter(iter);
+}
+
+int be_ifg_degree(const be_ifg_t *ifg, const ir_node *irn)
+{
+ neighbours_iter_t it;
+ int degree;
+ find_neighbours(ifg, &it, irn);
+ degree = ir_nodeset_size(&it.neighbours);
+ neighbours_break(&it, 1);
+ return degree;
+}
+
+be_ifg_t *be_create_ifg(const be_chordal_env_t *env)
+{
+ be_ifg_t *ifg = XMALLOC(be_ifg_t);
+ ifg->env = env;
+
+ return ifg;
+}
+
+static void int_comp_rec(be_ifg_t *ifg, ir_node *n, bitset_t *seen)
+{
+ neighbours_iter_t neigh_it;
+ ir_node *m;
+
+ be_ifg_foreach_neighbour(ifg, &neigh_it, n, m) {
+ if (bitset_is_set(seen, get_irn_idx(m)))
+ continue;
+
+ if (arch_get_irn_register_req(m)->type & arch_register_req_type_ignore)
+ continue;
+
+ bitset_set(seen, get_irn_idx(m));
+ int_comp_rec(ifg, m, seen);