Home
last modified time | relevance | path

Searched refs:graph_node (Results 1 – 6 of 6) sorted by relevance

/dpdk/lib/graph/
H A Dgraph_ops.c36 struct graph_node *graph_node; in graph_node_has_loop_edge() local
48 struct graph_node *graph_node; in graph_src_nodes_count() local
65 struct graph_node *graph_node; in graph_node_has_edge_to_src_node() local
88 struct graph_node *graph_node; in graph_nodes_count() local
100 struct graph_node *graph_node; in graph_mark_nodes_as_not_visited() local
103 graph_node->visited = false; in graph_mark_nodes_as_not_visited()
145 struct graph_node *graph_node; in graph_has_isolated_node() local
154 graph_node->node->name); in graph_has_isolated_node()
155 if (graph_bfs(graph, graph_node)) in graph_has_isolated_node()
161 if (graph_node->visited == false) in graph_has_isolated_node()
[all …]
H A Dgraph.c46 struct graph_node *graph_node; in graph_node_add() local
71 free(graph_node); in graph_node_add()
78 struct graph_node *graph_node; in node_to_graph_node() local
82 return graph_node; in node_to_graph_node()
92 struct graph_node *graph_node; in graph_node_edges_add() local
116 struct graph_node *graph_node, *tmp; in graph_adjacency_list_update() local
166 struct graph_node *graph_node; in graph_cleanup() local
171 free(graph_node); in graph_cleanup()
178 struct graph_node *graph_node; in graph_node_init() local
202 struct graph_node *graph_node; in graph_node_fini() local
[all …]
H A Dgraph_populate.c16 struct graph_node *graph_node; in graph_fp_mem_calc_size() local
35 STAILQ_FOREACH(graph_node, &graph->node_list, next) { in graph_fp_mem_calc_size()
68 struct graph_node *graph_node; in graph_nodes_populate() local
78 node->process = graph_node->node->process; in graph_nodes_populate()
80 pid = graph_node->node->parent_id; in graph_nodes_populate()
85 node->id = graph_node->node->id; in graph_nodes_populate()
87 nb_edges = graph_node->node->nb_edges; in graph_nodes_populate()
92 node->nodes[count] = (struct rte_node *)&graph_node in graph_nodes_populate()
158 struct graph_node *graph_node; in graph_src_nodes_populate() local
164 if (graph_node->node->flags & RTE_NODE_SOURCE_F) { in graph_src_nodes_populate()
[all …]
H A Dgraph_private.h66 struct graph_node { struct
67 STAILQ_ENTRY(graph_node) next; /**< Next graph node in the list. */
70 struct graph_node *adjacency_list[]; /**< Adjacency list of the node. */ argument
103 STAILQ_HEAD(gnode_list, graph_node) node_list;
177 int graph_bfs(struct graph *graph, struct graph_node *start);
H A Dgraph_stats.c137 struct rte_graph *graph, struct graph_node *graph_node) in stats_mem_populate() argument
140 rte_node_t id = graph_node->node->id; in stats_mem_populate()
156 graph_node->node->name, graph->name); in stats_mem_populate()
173 memcpy(cluster->stat.name, graph_node->node->name, RTE_NODE_NAMESIZE); in stats_mem_populate()
174 cluster->stat.id = graph_node->node->id; in stats_mem_populate()
179 graph_node->node->name, graph->name); in stats_mem_populate()
267 struct graph_node *graph_node; in rte_graph_cluster_stats_create() local
301 STAILQ_FOREACH(graph_node, &graph->node_list, next) { in rte_graph_cluster_stats_create()
303 if (stats_mem_populate(&stats, graph_fp, graph_node)) in rte_graph_cluster_stats_create()
H A Dgraph_debug.c11 struct graph_node *graph_node; in graph_dump() local
24 STAILQ_FOREACH(graph_node, &g->node_list, next) in graph_dump()
25 fprintf(f, " node[%d] <%s>\n", i++, graph_node->node->name); in graph_dump()