-/**
- * @file beifg.h
- * @date 18.11.2005
- * @author Sebastian Hack
- *
- * Copyright (C) 2005 Universitaet Karlsruhe
- * Released under the GPL
+/*
+ * This file is part of libFirm.
+ * Copyright (C) 2012 University of Karlsruhe.
*/
-#ifndef _BEIFG_H
-#define _BEIFG_H
+/**
+ * @file
+ * @brief Interface for interference graphs.
+ * @author Sebastian Hack
+ * @date 18.11.2005
+ */
+#ifndef FIRM_BE_BEIFG_H
+#define FIRM_BE_BEIFG_H
-#include "becopyopt.h"
+#include "be_types.h"
+#include "bechordal.h"
+#include "irnodeset.h"
+#include "pset.h"
-#ifdef WITH_LIBCORE
-#include <libcore/lc_opts.h>
-#include <libcore/lc_opts_enum.h>
-#include <libcore/lc_timing.h>
-#endif /* WITH_LIBCORE */
+struct be_ifg_t {
+ const be_chordal_env_t *env;
+};
-#include "firm_types.h"
+typedef struct nodes_iter_t {
+ const be_chordal_env_t *env;
+ struct obstack obst;
+ int n;
+ int curr;
+ ir_node **nodes;
+} nodes_iter_t;
-typedef struct _be_ifg_impl_t be_ifg_impl_t;
-typedef struct _be_ifg_t be_ifg_t;
+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;
-#define be_ifg_nodes_iter_alloca(self) (alloca(be_ifg_nodes_iter_size(self)))
-#define be_ifg_neighbours_iter_alloca(self) (alloca(be_ifg_neighbours_iter_size(self)))
-#define be_ifg_cliques_iter_alloca(self) (alloca(be_ifg_cliques_iter_size(self)))
+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;
-size_t (be_ifg_nodes_iter_size)(const void *self);
-size_t (be_ifg_neighbours_iter_size)(const void *self);
-size_t (be_ifg_cliques_iter_size)(const void *self);
-void (be_ifg_free)(void *self);
-int (be_ifg_connected)(const void *self, const ir_node *a, const ir_node *b);
-ir_node *(be_ifg_neighbours_begin)(const void *self, void *iter, const ir_node *irn);
-ir_node *(be_ifg_neighbours_next)(const void *self, void *iter);
-void (be_ifg_neighbours_break)(const void *self, void *iter);
-ir_node *(be_ifg_nodes_begin)(const void *self, void *iter);
-ir_node *(be_ifg_nodes_next)(const void *self, void *iter);
-void (be_ifg_nodes_break)(const void *self, void *iter);
-int (be_ifg_cliques_begin)(const void *self, void *iter, ir_node **buf);
-int (be_ifg_cliques_next)(const void *self, void *iter);
-void (be_ifg_cliques_break)(const void *self, void *iter);
-int (be_ifg_degree)(const void *self, const ir_node *irn);
+void be_ifg_free(be_ifg_t *ifg);
+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);
+nodes_iter_t be_ifg_nodes_begin(be_ifg_t const *ifg);
+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(self, iter, irn, pos) \
- for(pos = be_ifg_neighbours_begin(self, iter, irn); (pos); pos = be_ifg_neighbours_next(self, iter))
+#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(self, iter, pos) \
- for(pos = be_ifg_nodes_begin(self, iter); (pos); pos = be_ifg_nodes_next(self, iter))
+#define be_ifg_foreach_node(ifg, pos) \
+ for (bool pos##__once = true; pos##__once;) \
+ for (nodes_iter_t pos##__iter = be_ifg_nodes_begin(ifg); pos##__once; pos##__once = false) \
+ for (ir_node *pos; (pos = be_ifg_nodes_next(&pos##__iter));)
-#define be_ifg_foreach_clique(self, iter, buf, count) \
- for(*(count) = be_ifg_cliques_begin(self, iter, buf); \
+#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(self, iter))
-
-/*
- ____ _
- | _ \ _ _ _ __ ___ _ __ (_)_ __ __ _
- | | | | | | | '_ ` _ \| '_ \| | '_ \ / _` |
- | |_| | |_| | | | | | | |_) | | | | | (_| |
- |____/ \__,_|_| |_| |_| .__/|_|_| |_|\__, |
- |_| |___/
-*/
+ *(count) = be_ifg_cliques_next(iter))
-typedef struct _be_ifg_dump_dot_cb_t {
- int (*is_dump_node)(void *self, ir_node *irn);
- void (*graph_attr)(FILE *f, void *self);
- void (*node_attr)(FILE *f, void *self, ir_node *irn);
- void (*edge_attr)(FILE *f, void *self, ir_node *from, ir_node *to);
- void (*at_begin)(FILE *file, void *self);
- void (*at_end)(FILE *file, void *self);
-} be_ifg_dump_dot_cb_t;
+typedef struct {
+ int n_nodes;
+ int n_edges;
+ int n_comps;
+} be_ifg_stat_t;
-void be_ifg_dump_dot(be_ifg_t *ifg, ir_graph *irg, FILE *file, const be_ifg_dump_dot_cb_t *cb, void *self);
-void be_ifg_check_sorted(const be_ifg_t *ifg);
-void be_ifg_check_sorted_to_file(const be_ifg_t *ifg, FILE *f);
-void be_ifg_check_performance(be_chordal_env_t *chordal_env);
+void be_ifg_stat(ir_graph *irg, be_ifg_t *ifg, be_ifg_stat_t *stat);
+be_ifg_t *be_create_ifg(const be_chordal_env_t *env);
-#endif /* _BEIFG_H */
+#endif