Home
last modified time | relevance | path

Searched refs:node_list (Results 1 – 7 of 7) sorted by relevance

/dpdk/lib/graph/
H A Dnode.c16 static struct node_head node_list = STAILQ_HEAD_INITIALIZER(node_list); variable
25 return &node_list; in node_list_head_get()
33 STAILQ_FOREACH(node, &node_list, next) in node_from_name()
46 STAILQ_FOREACH(node, &node_list, next) { in node_has_duplicate_entry()
187 STAILQ_FOREACH(node, &node_list, next) in rte_node_clone()
200 STAILQ_FOREACH(node, &node_list, next) in rte_node_from_name()
213 STAILQ_FOREACH(node, &node_list, next) in rte_node_id_to_name()
227 STAILQ_FOREACH(node, &node_list, next) in rte_node_edge_count()
298 STAILQ_FOREACH(node, &node_list, next) { in rte_node_edge_shrink()
326 STAILQ_FOREACH(n, &node_list, next) { in rte_node_edge_update()
[all …]
H A Dgraph_ops.c38 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_node_has_loop_edge()
51 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_src_nodes_count()
69 STAILQ_FOREACH(graph_node, &graph->node_list, next) { in graph_node_has_edge_to_src_node()
91 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_nodes_count()
102 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_mark_nodes_as_not_visited()
149 STAILQ_FOREACH(graph_node, &graph->node_list, next) { in graph_has_isolated_node()
160 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_has_isolated_node()
H A Dgraph.c50 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()
97 STAILQ_FOREACH(graph_node, &graph->node_list, next) { in graph_node_edges_add()
121 STAILQ_FOREACH(graph_node, &graph->node_list, next) { in graph_adjacency_list_update()
168 while (!STAILQ_EMPTY(&graph->node_list)) { in graph_cleanup()
169 graph_node = STAILQ_FIRST(&graph->node_list); in graph_cleanup()
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()
[all …]
H A Dgraph_populate.c35 STAILQ_FOREACH(graph_node, &graph->node_list, next) { in graph_fp_mem_calc_size()
73 STAILQ_FOREACH(graph_node, &_graph->node_list, next) { in graph_nodes_populate()
163 STAILQ_FOREACH(graph_node, &_graph->node_list, next) { in graph_src_nodes_populate()
H A Dgraph_private.h103 STAILQ_HEAD(gnode_list, graph_node) node_list;
H A Dgraph_debug.c24 STAILQ_FOREACH(graph_node, &g->node_list, next) in graph_dump()
H A Dgraph_stats.c301 STAILQ_FOREACH(graph_node, &graph->node_list, next) { in rte_graph_cluster_stats_create()