5 #include <ccan/container_of/container_of.h>
6 #include <ccan/ptrint/ptrint.h>
8 #include <ccan/aga/aga.h>
10 #include "simple-graph.h"
12 static ptrint_t *traversal1_first_edge(const struct aga_graph *g,
13 const struct aga_node *n)
15 struct traversal1_graph *t1g = container_of(g, struct traversal1_graph,
17 int ni = n - t1g->sg.nodes;
39 static ptrint_t *traversal1_next_edge(const struct aga_graph *g,
40 const struct aga_node *n,
43 struct traversal1_graph *t1g = container_of(g, struct traversal1_graph,
45 int ni = n - t1g->sg.nodes;
46 int index = ptr2int(e);
48 assert((ni < 4) || (ni > 6));
57 static int traversal1_edge_info(const struct aga_graph *g,
58 const struct aga_node *n,
59 ptrint_t *e, struct aga_edge_info *ei)
61 struct traversal1_graph *t1g = container_of(g, struct traversal1_graph,
63 int ni = n - t1g->sg.nodes;
64 int index = ptr2int(e);
66 assert((index == 1) || (index == 2));
71 ei->to = &t1g->sg.nodes[2];
73 ei->to = &t1g->sg.nodes[3];
78 ei->to = &t1g->sg.nodes[4];
80 ei->to = &t1g->sg.nodes[5];
84 ei->to = &t1g->sg.nodes[5];
86 ei->to = &t1g->sg.nodes[6];
91 ei->to = &t1g->sg.nodes[5];
93 ei->to = &t1g->sg.nodes[4];
98 ei->to = &t1g->sg.nodes[6];
100 ei->to = &t1g->sg.nodes[5];
105 ei->to = &t1g->sg.nodes[8];
107 ei->to = &t1g->sg.nodes[7];
116 void traversal1_graph_init(struct traversal1_graph *t1g)
118 simple_graph_init(&t1g->sg, traversal1_first_edge,
119 traversal1_next_edge,
120 traversal1_edge_info);