26 #ifndef LSRA_GRAPH_HPP_
27 #define LSRA_GRAPH_HPP_ 1
36 # define GRAPH_DEBUG_VERBOSE
39 #ifdef GRAPH_DEBUG_CHECK
40 # define _GRAPH_CHECK_BOUNDS(i,l,h) assert( ((i) >= (l)) && ((i) < (h)));
41 # define _GRAPH_ASSERT(a) assert((a));
43 # define _GRAPH_CHECK_BOUNDS(i,l,h)
44 # define _GRAPH_ASSERT(a)
91 #endif // LSRA_GRAPH_HPP_
int graph_get_next(graphiterator *i)
struct graph_element ** predecessor
bool graph_has_multiple_predecessors(graphdata *gd, int b_index)
struct graph_element * next
void graph_add_edge(graphdata *gd, int from, int to)
int graph_get_first_predecessor(graphdata *gd, int b_index, graphiterator *i)
struct graph_element ** successor
void graph_DFS(lsradata *ls, graphdata *gd)
int graph_get_num_successor(graphdata *gd, int b_index)
void transform_BB(jitdata *jd, graphdata *gd)
void graph_make_cfg(jitdata *jd, graphdata *gd)
graph_element * graphiterator
int graph_get_num_predecessor(graphdata *gd, int b_index)
bool graph_has_multiple_successors(graphdata *gd, int b_index)
graphdata * graph_init(int basicblockcount)
int graph_get_first_successor(graphdata *gd, int b_index, graphiterator *i)