• Home
  • Raw
  • Download

Lines Matching refs:node

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