beifg: Let be_ifg_foreach_node() declare its iterator internally.

[libfirm] / ir / be / beifg.h

diff --git a/ir/be/beifg.h b/ir/be/beifg.h
index 1e6caf3..4b5032d 100644 (file)
--- a/ir/be/beifg.h
+++ b/ir/be/beifg.h
@@ -1,40 +1,88 @@
+/*
+ * This file is part of libFirm.
+ * Copyright (C) 2012 University of Karlsruhe.
+ */
+
 /**
- * @file   beifg.h
- * @date   18.11.2005
- * @author Sebastian Hack
- *
- * Copyright (C) 2005 Universitaet Karlsruhe
- * Released under the GPL
+ * @file
+ * @brief       Interface for interference graphs.
+ * @author      Sebastian Hack
+ * @date        18.11.2005
  */
+#ifndef FIRM_BE_BEIFG_H
+#define FIRM_BE_BEIFG_H
 
-#ifndef _BEIFG_H
-#define _BEIFG_H
+#include "be_types.h"
+#include "bechordal.h"
+#include "irnodeset.h"
+#include "pset.h"
 
-#include "obst.h"
-#include "bechordal_t.h"
+struct be_ifg_t {
+       const be_chordal_env_t *env;
+};
 
-typedef struct _be_ifg_impl_t  be_ifg_impl_t;
-typedef struct _be_ifg_t                               be_ifg_t;
+typedef struct nodes_iter_t {
+       const be_chordal_env_t *env;
+       struct obstack         obst;
+       int                    n;
+       int                    curr;
+       ir_node                **nodes;
+} nodes_iter_t;
 
-struct _be_ifg_impl_t {
-       void (*free)(void *self);
+typedef struct neighbours_iter_t {
+       const be_chordal_env_t *env;
+       const ir_node        *irn;
+       int                   valid;
+       ir_nodeset_t          neighbours;
+       ir_nodeset_iterator_t iter;
+} neighbours_iter_t;
 
-       int (*connected)(void *self, const ir_node *a, const ir_node *b);
-       int (*neighbours_arr)(void *self, const ir_node *irn, ir_node **arr, size_t n);
-       int (*neighbours_obst)(void *self, const ir_node *irn, struct obstack *obst);
-       int (*degree)(void *self, const ir_node *irn);
-};
+typedef struct cliques_iter_t {
+       struct obstack ob;
+       const be_chordal_env_t *cenv;
+       ir_node **buf;
+       ir_node **blocks;
+       int n_blocks, blk;
+       struct list_head *bor;
+       pset *living;
+} cliques_iter_t;
 
-struct _be_ifg_t {
-       const be_ifg_impl_t *impl;
-};
+void     be_ifg_free(be_ifg_t *ifg);
+int      be_ifg_connected(const be_ifg_t *ifg, const ir_node *a,
+                          const ir_node *b);
+ir_node *be_ifg_neighbours_begin(const be_ifg_t *ifg, neighbours_iter_t *iter,
+                                 const ir_node *irn);
+ir_node *be_ifg_neighbours_next(neighbours_iter_t *iter);
+void     be_ifg_neighbours_break(neighbours_iter_t *iter);
+ir_node *be_ifg_nodes_begin(const be_ifg_t *ifg, nodes_iter_t *iter);
+ir_node *be_ifg_nodes_next(nodes_iter_t *iter);
+int      be_ifg_cliques_begin(const be_ifg_t *ifg, cliques_iter_t *iter,
+                              ir_node **buf);
+int      be_ifg_cliques_next(cliques_iter_t *iter);
+void     be_ifg_cliques_break(cliques_iter_t *iter);
+int      be_ifg_degree(const be_ifg_t *ifg, const ir_node *irn);
+
+#define be_ifg_foreach_neighbour(ifg, iter, irn, pos) \
+       for (ir_node *pos = be_ifg_neighbours_begin(ifg, iter, irn); pos; pos = be_ifg_neighbours_next(iter))
+
+#define be_ifg_foreach_node(ifg, pos) \
+       for (bool pos##__once = true; pos##__once;) \
+               for (nodes_iter_t pos##__iter; pos##__once; pos##__once = false) \
+                       for (ir_node *pos = be_ifg_nodes_begin(ifg, &pos##__iter); pos; pos = be_ifg_nodes_next(&pos##__iter))
+
+#define be_ifg_foreach_clique(ifg, iter, buf, count) \
+       for(*(count) = be_ifg_cliques_begin(ifg, iter, buf); \
+        *(count) != -1 ; \
+        *(count) = be_ifg_cliques_next(iter))
+
+typedef struct {
+       int n_nodes;
+       int n_edges;
+       int n_comps;
+} be_ifg_stat_t;
 
-#define be_ifg_free(self)                                                                              ((self)->impl->free(self))
-#define be_ifg_connected(self,a,b)                                             ((self)->impl->connected(self, a, b))
-#define be_ifg_neighbours_arr(self,irn,arr,n)  ((self)->impl->neighbours_arr(self, irn, arr, n))
-#define be_ifg_neighbours_obst(self,irn,obst)  ((self)->impl->neighbours_arr(self, irn, obst))
-#define be_ifg_degree(self,irn)                                                                ((self)->impl->degree(self, irn))
+void be_ifg_stat(ir_graph *irg, be_ifg_t *ifg, be_ifg_stat_t *stat);
 
-be_ifg_t *be_ifg_std_new(const be_chordal_env_t *env);
+be_ifg_t *be_create_ifg(const be_chordal_env_t *env);
 
-#endif /* _BEIFG_H */
+#endif