Lines Matching refs:next

50 	STAILQ_FOREACH(graph_node, &graph->node_list, next)  in graph_node_add()
67 STAILQ_INSERT_TAIL(&graph->node_list, graph_node, next); in graph_node_add()
80 STAILQ_FOREACH(graph_node, &graph->node_list, next) in node_to_graph_node()
94 const char *next; in graph_node_edges_add() local
97 STAILQ_FOREACH(graph_node, &graph->node_list, next) { in graph_node_edges_add()
99 next = graph_node->node->next_nodes[i]; in graph_node_edges_add()
100 adjacency = node_from_name(next); in graph_node_edges_add()
103 "Node %s not registered", next); in graph_node_edges_add()
118 const char *next; in graph_adjacency_list_update() local
121 STAILQ_FOREACH(graph_node, &graph->node_list, next) { in graph_adjacency_list_update()
123 next = graph_node->node->next_nodes[i]; in graph_adjacency_list_update()
124 adjacency = node_from_name(next); in graph_adjacency_list_update()
127 "Node %s not registered", next); in graph_adjacency_list_update()
148 STAILQ_FOREACH(node, node_head, next) { in expand_pattern_to_node()
170 STAILQ_REMOVE_HEAD(&graph->node_list, next); in graph_cleanup()
182 STAILQ_FOREACH(graph_node, &graph->node_list, next) { in graph_node_init()
204 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_node_fini()
278 STAILQ_FOREACH(graph, &graph_list, next) in rte_graph_create()
341 STAILQ_INSERT_TAIL(&graph_list, graph, next); in rte_graph_create()
367 tmp = STAILQ_NEXT(graph, next); in rte_graph_destroy()
378 STAILQ_REMOVE(&graph_list, graph, graph, next); in rte_graph_destroy()
395 STAILQ_FOREACH(graph, &graph_list, next) in rte_graph_from_name()
408 STAILQ_FOREACH(graph, &graph_list, next) in rte_graph_id_to_name()
425 STAILQ_FOREACH(graph, &graph_list, next) in rte_graph_node_get()
446 STAILQ_FOREACH(graph, &graph_list, next) in rte_graph_node_get_by_name()
505 STAILQ_FOREACH(graph_node, &graph->node_list, next) { in graph_to_dot()
533 STAILQ_FOREACH(graph, &graph_list, next) { in rte_graph_export()
551 STAILQ_FOREACH(graph, &graph_list, next) { in graph_scan_dump()