Lines Matching refs:node
50 struct node: public dag_node {
54 struct node &operator>>(struct node &child) {
60 void add_edge(struct node &child, uintptr_t data) {
65 void add_edge_max_data(struct node &child, uintptr_t data) {
73 struct node *node = static_cast<struct node *>(dag_node);
75 util_dynarray_append(output, int, node->val);
79 init_nodes(struct dag *dag, struct node *nodes, unsigned num_nodes)
89 struct node node[(num_nodes)]; \
90 init_nodes(dag, node, (num_nodes))
153 node[0] >> node[1];
154 node[0] >> node[2];
168 node[0].add_edge(node[1], 0);
169 node[0].add_edge(node[1], 1);
170 node[0].add_edge(node[2], 0);
172 EXPECT_EQ(util_dynarray_num_elements(&node[0].edges, struct dag_edge), 3);
185 node[0].add_edge_max_data(node[1], 0);
186 node[0].add_edge_max_data(node[1], 1);
187 node[0].add_edge_max_data(node[2], 0);
189 EXPECT_EQ(util_dynarray_num_elements(&node[0].edges, struct dag_edge), 2);
191 util_dynarray_foreach (&node[0].edges, struct dag_edge, edge) {
192 if (edge->child == &node[1]) {
195 EXPECT_EQ(edge->child, &node[2]);
217 node[0] >> node[1];
218 node[0] >> node[2];
219 node[0] >> node[3];
220 node[0] >> node[4];
221 node[0] >> node[5];
245 node[0] >> node[1] >> node[6];
246 node[0] >> node[2] >> node[6];
247 node[0] >> node[3] >> node[6];
248 node[0] >> node[4] >> node[6];
249 node[0] >> node[5] >> node[6];
271 node[0] >> node[1] >> node[2] >> node[4];
272 node[1] >> node[4];
273 node[0] >> node[3];
274 node[3] >> node[4];
275 node[3] >> node[5];