16 	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()
39 		sz += sizeof(struct rte_node *) * graph_node->node->nb_edges;  in graph_fp_mem_calc_size()
68 	struct graph_node *graph_node;  in graph_nodes_populate()  local
73 	STAILQ_FOREACH(graph_node, &_graph->node_list, next) {  in graph_nodes_populate()
78 		node->process = graph_node->node->process;  in graph_nodes_populate()
79 		memcpy(node->name, graph_node->node->name, RTE_GRAPH_NAMESIZE);  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
163 	STAILQ_FOREACH(graph_node, &_graph->node_list, next) {  in graph_src_nodes_populate()
164 		if (graph_node->node->flags & RTE_NODE_SOURCE_F) {  in graph_src_nodes_populate()
165 			name = graph_node->node->name;  in graph_src_nodes_populate()