+
+}
+
+static int int_component_stat(ir_graph *irg, be_ifg_t *ifg)
+{
+ int n_comp = 0;
+ nodes_iter_t nodes_it;
+ bitset_t *seen = bitset_malloc(get_irg_last_idx(irg));
+
+ ir_node *n;
+
+ be_ifg_foreach_node(ifg, &nodes_it, n) {
+ if (bitset_is_set(seen, get_irn_idx(n)))
+ continue;
+
+ arch_register_req_t const *const req = arch_get_irn_register_req(n);
+ if (arch_register_req_is(req, ignore))
+ continue;
+
+ ++n_comp;
+ bitset_set(seen, get_irn_idx(n));
+ int_comp_rec(ifg, n, seen);
+ }
+
+ free(seen);
+ return n_comp;
+}
+
+void be_ifg_stat(ir_graph *irg, be_ifg_t *ifg, be_ifg_stat_t *stat)
+{
+ nodes_iter_t nodes_it;
+ neighbours_iter_t neigh_it;
+ bitset_t *nodes = bitset_malloc(get_irg_last_idx(irg));
+ ir_node *n, *m;
+
+ memset(stat, 0, sizeof(stat[0]));
+
+ be_ifg_foreach_node(ifg, &nodes_it, n) {
+ stat->n_nodes += 1;
+ be_ifg_foreach_neighbour(ifg, &neigh_it, n, m) {
+ bitset_set(nodes, get_irn_idx(n));
+ stat->n_edges += !bitset_is_set(nodes, get_irn_idx(m));
+ }
+ }
+
+ stat->n_comps = int_component_stat(irg, ifg);
+ bitset_free(nodes);