simplify be_lv_foreach

[libfirm] / ir / be / beifg.c

diff --git a/ir/be/beifg.c b/ir/be/beifg.c
index fc1cc7d..e59faa6 100644 (file)
--- a/ir/be/beifg.c
+++ b/ir/be/beifg.c
@@ -186,7 +186,7 @@ ir_node *be_ifg_neighbours_begin(const be_ifg_t *ifg, neighbours_iter_t *iter,
                                  const ir_node *irn)
 {
        find_neighbours(ifg, iter, irn);
-       return ir_nodeset_iterator_next(&iter->iter);
+       return get_next_neighbour(iter);
 }
 
 ir_node *be_ifg_neighbours_next(neighbours_iter_t *iter)
@@ -318,55 +318,6 @@ be_ifg_t *be_create_ifg(const be_chordal_env_t *env)
        return ifg;
 }
 
-void be_ifg_dump_dot(be_ifg_t *ifg, ir_graph *irg, FILE *file, const be_ifg_dump_dot_cb_t *cb, void *self)
-{
-       nodes_iter_t nodes_it;
-       neighbours_iter_t neigh_it;
-       bitset_t *nodes = bitset_malloc(get_irg_last_idx(irg));
-
-       ir_node *n, *m;
-
-       fprintf(file, "graph G {\n\tgraph [");
-       if (cb->graph_attr)
-               cb->graph_attr(file, self);
-       fprintf(file, "];\n");
-
-       if (cb->at_begin)
-               cb->at_begin(file, self);
-
-       be_ifg_foreach_node(ifg, &nodes_it, n) {
-               if (cb->is_dump_node && cb->is_dump_node(self, n)) {
-                       int idx = get_irn_idx(n);
-                       bitset_set(nodes, idx);
-                       fprintf(file, "\tnode [");
-                       if (cb->node_attr)
-                               cb->node_attr(file, self, n);
-                       fprintf(file, "]; n%d;\n", idx);
-               }
-       }
-
-       /* Check, if all neighbours are indeed connected to the node. */
-       be_ifg_foreach_node(ifg, &nodes_it, n) {
-               be_ifg_foreach_neighbour(ifg, &neigh_it, n, m) {
-                       int n_idx = get_irn_idx(n);
-                       int m_idx = get_irn_idx(m);
-
-                       if (n_idx < m_idx && bitset_is_set(nodes, n_idx) && bitset_is_set(nodes, m_idx)) {
-                               fprintf(file, "\tn%d -- n%d [", n_idx, m_idx);
-                               if (cb->edge_attr)
-                                       cb->edge_attr(file, self, n, m);
-                               fprintf(file, "];\n");
-                       }
-               }
-       }
-
-       if (cb->at_end)
-               cb->at_end(file, self);
-
-       fprintf(file, "}\n");
-       bitset_free(nodes);
-}
-
 static void int_comp_rec(be_ifg_t *ifg, ir_node *n, bitset_t *seen)
 {
        neighbours_iter_t neigh_it;