| /f-stack/dpdk/lib/librte_graph/ |
| H A D | node.c | 17 static struct node_head node_list = STAILQ_HEAD_INITIALIZER(node_list); variable
26 return &node_list; in node_list_head_get()
34 STAILQ_FOREACH(node, &node_list, next) in node_from_name()
47 STAILQ_FOREACH(node, &node_list, next) { in node_has_duplicate_entry()
196 STAILQ_FOREACH(node, &node_list, next) in rte_node_clone()
209 STAILQ_FOREACH(node, &node_list, next) in rte_node_from_name()
222 STAILQ_FOREACH(node, &node_list, next) in rte_node_id_to_name()
236 STAILQ_FOREACH(node, &node_list, next) in rte_node_edge_count()
309 STAILQ_FOREACH(node, &node_list, next) { in rte_node_edge_shrink()
337 STAILQ_FOREACH(n, &node_list, next) { in rte_node_edge_update()
[all …]
|
| H A D | graph_ops.c | 39 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_node_has_loop_edge()
52 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_src_nodes_count()
70 STAILQ_FOREACH(graph_node, &graph->node_list, next) { in graph_node_has_edge_to_src_node()
92 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_nodes_count()
103 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_mark_nodes_as_not_visited()
150 STAILQ_FOREACH(graph_node, &graph->node_list, next) { in graph_has_isolated_node()
161 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_has_isolated_node()
|
| H A D | graph.c | 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()
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 D | graph_populate.c | 37 STAILQ_FOREACH(graph_node, &graph->node_list, next) { in graph_fp_mem_calc_size()
75 STAILQ_FOREACH(graph_node, &_graph->node_list, next) { in graph_nodes_populate()
165 STAILQ_FOREACH(graph_node, &_graph->node_list, next) { in graph_src_nodes_populate()
|
| H A D | graph_private.h | 103 STAILQ_HEAD(gnode_list, graph_node) node_list;
|
| H A D | graph_debug.c | 26 STAILQ_FOREACH(graph_node, &g->node_list, next) in graph_dump()
|
| H A D | graph_stats.c | 299 STAILQ_FOREACH(graph_node, &graph->node_list, next) { in rte_graph_cluster_stats_create()
|
| /f-stack/dpdk/drivers/net/octeontx2/ |
| H A D | otx2_tm.c | 79 TAILQ_FOREACH(child_node, &dev->node_list, node) { in find_prio_anchor()
697 TAILQ_FOREACH(tm_node, &dev->node_list, node) { in nix_tm_txsch_reg_config()
716 TAILQ_FOREACH(tm_node, &dev->node_list, node) { in nix_tm_node_search()
730 TAILQ_FOREACH(tm_node, &dev->node_list, node) { in check_rr()
752 TAILQ_FOREACH(tm_node, &dev->node_list, node) { in nix_tm_update_parent_info()
1091 TAILQ_FOREACH(sibling, &dev->node_list, node) { in otx2_nix_sq_flush_pre()
1158 TAILQ_FOREACH(sibling, &dev->node_list, node) { in otx2_nix_sq_flush_post()
1263 next_node = TAILQ_FIRST(&dev->node_list); in nix_tm_free_resources()
1307 TAILQ_REMOVE(&dev->node_list, tm_node, node); in nix_tm_free_resources()
2420 TAILQ_REMOVE(&dev->node_list, tm_node, node); in otx2_nix_tm_node_delete()
[all …]
|
| H A D | otx2_ethdev.h | 317 struct otx2_nix_tm_node_list node_list; member
|
| H A D | otx2_ethdev_debug.c | 725 TAILQ_FOREACH(tm_node, &dev->node_list, node) { in otx2_nix_tm_dump()
|