X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeifg_t.h;h=640f9504a0460e1b34d43c0a69ff46e3886fe0ef;hb=0cf1285126c03f408d0e6567547ce98864fd6e30;hp=209bc9051bd310600f7b5f6d88f8c6d968bb8bfb;hpb=0b4a2ee44d0acf366025f06f466e3f6040de604b;p=libfirm

diff --git a/ir/be/beifg_t.h b/ir/be/beifg_t.h
index 209bc9051..640f9504a 100644
--- a/ir/be/beifg_t.h
+++ b/ir/be/beifg_t.h
@@ -1,46 +1,86 @@
+/*
+ * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
+ *
+ * This file is part of libFirm.
+ *
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
+ *
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
+ */
+
 /**
- * Common use interference graph.
+ * @file
+ * @brief       Common use interference graph.
+ * @author      Sebastian Hack
+ * @date        27.06.2005
+ * @version     $Id$
+ *
  * Originally written by Sebastian Hack. Refactored into a seperate
  * source file and header by Kimon Hoffmann.
- * @author Sebastian Hack
- * @date 27.06.2005
  */
-#ifndef _BEIFG_T_H_
-#define _BEIFG_T_H_
-
-#include "pset.h"
-#include "set.h"
+#ifndef FIRM_BE_BEIFG_T_H
+#define FIRM_BE_BEIFG_T_H
 
 #include "beifg.h"
 
-/**
- * Structure that represents a single interference graph.
- */
-struct _be_if_graph_t {
-	/**
-	 * Set of nodes in this graph as be_if_node_t structs.
-	 */
-	set* nodes;
-	/**
-	 * Set of edges in this graph as be_if_edge_t structs.
-	 */
-	set* edges;
-};
+struct _be_ifg_impl_t {
+	size_t nodes_iter_size;
+	size_t neighbours_iter_size;
+	size_t cliques_iter_size;
 
-/**
- * Node type contained in i0nterference graphs.
- */
-struct _be_if_node_t {
-	int nodeNumber;
-	pset* neighbourNodes;
+	void (*free)(void *self);
+	int (*connected)(const void *self, const ir_node *a, const ir_node *b);
+
+	ir_node *(*neighbours_begin)(const void *self, void *iter, const ir_node *irn);
+	ir_node *(*neighbours_next)(const void *self, void *iter);
+	void (*neighbours_break)(const void *self, void *iter);
+
+	ir_node *(*nodes_begin)(const void *self, void *iter);
+	ir_node *(*nodes_next)(const void *self, void *iter);
+	void (*nodes_break)(const void *self, void *iter);
+
+	int (*cliques_begin)(const void *self, void *iter, ir_node **buf);
+	int (*cliques_next)(const void *self, void *iter);
+	void (*cliques_break)(const void *self, void *iter);
+
+	int (*degree)(const void *self, const ir_node *irn);
 };
 
-/**
- * Edge type contained in interference graphs.
- */
-struct _be_if_edge_t {
-	int sourceNode;
-	int targetNode;
+struct _be_ifg_t {
+	const be_ifg_impl_t    *impl;
+	const be_chordal_env_t *env;
 };
 
-#endif /*_BEIFG_T_H_*/
+#ifdef _BE_IFG_USE_MACROS
+
+#define be_ifg_nodes_iter_size(self)              ((self)->impl->nodes_iter_size)
+#define be_ifg_neighbours_iter_size(self)         ((self)->impl->neighbours_iter_size)
+#define be_ifg_cliques_iter_size(self)            ((self)->impl->cliques_iter_size)
+
+#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_begin(self, iter, irn)  ((self)->impl->neighbours_begin(self, iter, irn))
+#define be_ifg_neighbours_next(self, iter)        ((self)->impl->neighbours_next(self, iter))
+#define be_ifg_neighbours_break(self, iter)       ((self)->impl->neighbours_break(self, iter))
+#define be_ifg_nodes_begin(self, iter)            ((self)->impl->nodes_begin(self, iter))
+#define be_ifg_nodes_next(self, iter)             ((self)->impl->nodes_next(self, iter))
+#define be_ifg_nodes_break(self, iter)            ((self)->impl->nodes_break(self, iter))
+#define be_ifg_cliques_begin(self, iter, buf)     ((self)->impl->cliques_begin(self, iter, buf))
+#define be_ifg_cliques_next(self, iter)           ((self)->impl->cliques_next(self, iter))
+#define be_ifg_cliques_break(self, iter)          ((self)->impl->cliques_break(self, iter))
+#define be_ifg_degree(self,irn)                   ((self)->impl->degree(self, irn))
+
+#endif /* _BE_IFG_USE_MACROS */
+
+void be_ifg_check(const be_ifg_t *ifg);
+
+#endif /* FIRM_BE_BEIFG_T_H */