2 * This file is part of libFirm.
3 * Copyright (C) 2012 University of Karlsruhe.
8 * @brief Interface for interference graphs.
9 * @author Sebastian Hack
12 #ifndef FIRM_BE_BEIFG_H
13 #define FIRM_BE_BEIFG_H
16 #include "bechordal.h"
17 #include "irnodeset.h"
21 const be_chordal_env_t *env;
24 typedef struct nodes_iter_t {
25 const be_chordal_env_t *env;
32 typedef struct neighbours_iter_t {
33 const be_chordal_env_t *env;
36 ir_nodeset_t neighbours;
37 ir_nodeset_iterator_t iter;
40 typedef struct cliques_iter_t {
42 const be_chordal_env_t *cenv;
46 struct list_head *bor;
50 void be_ifg_free(be_ifg_t *ifg);
51 int be_ifg_connected(const be_ifg_t *ifg, const ir_node *a,
53 ir_node *be_ifg_neighbours_begin(const be_ifg_t *ifg, neighbours_iter_t *iter,
55 ir_node *be_ifg_neighbours_next(neighbours_iter_t *iter);
56 void be_ifg_neighbours_break(neighbours_iter_t *iter);
57 ir_node *be_ifg_nodes_begin(const be_ifg_t *ifg, nodes_iter_t *iter);
58 ir_node *be_ifg_nodes_next(nodes_iter_t *iter);
59 int be_ifg_cliques_begin(const be_ifg_t *ifg, cliques_iter_t *iter,
61 int be_ifg_cliques_next(cliques_iter_t *iter);
62 void be_ifg_cliques_break(cliques_iter_t *iter);
63 int be_ifg_degree(const be_ifg_t *ifg, const ir_node *irn);
65 #define be_ifg_foreach_neighbour(ifg, iter, irn, pos) \
66 for (ir_node *pos = be_ifg_neighbours_begin(ifg, iter, irn); pos; pos = be_ifg_neighbours_next(iter))
68 #define be_ifg_foreach_node(ifg, pos) \
69 for (bool pos##__once = true; pos##__once;) \
70 for (nodes_iter_t pos##__iter; pos##__once; pos##__once = false) \
71 for (ir_node *pos = be_ifg_nodes_begin(ifg, &pos##__iter); pos; pos = be_ifg_nodes_next(&pos##__iter))
73 #define be_ifg_foreach_clique(ifg, iter, buf, count) \
74 for(*(count) = be_ifg_cliques_begin(ifg, iter, buf); \
76 *(count) = be_ifg_cliques_next(iter))
84 void be_ifg_stat(ir_graph *irg, be_ifg_t *ifg, be_ifg_stat_t *stat);
86 be_ifg_t *be_create_ifg(const be_chordal_env_t *env);