18 	struct graph_node *graph_node;  in graph_fp_mem_calc_size()  local
37 	STAILQ_FOREACH(graph_node, &graph->node_list, next) {  in graph_fp_mem_calc_size()
41 		sz += sizeof(struct rte_node *) * graph_node->node->nb_edges;  in graph_fp_mem_calc_size()
70 	struct graph_node *graph_node;  in graph_nodes_populate()  local
75 	STAILQ_FOREACH(graph_node, &_graph->node_list, next) {  in graph_nodes_populate()
80 		node->process = graph_node->node->process;  in graph_nodes_populate()
81 		memcpy(node->name, graph_node->node->name, RTE_GRAPH_NAMESIZE);  in graph_nodes_populate()
82 		pid = graph_node->node->parent_id;  in graph_nodes_populate()
87 		node->id = graph_node->node->id;  in graph_nodes_populate()
89 		nb_edges = graph_node->node->nb_edges;  in graph_nodes_populate()
94 			node->nodes[count] = (struct rte_node *)&graph_node  in graph_nodes_populate()
160 	struct graph_node *graph_node;  in graph_src_nodes_populate()  local
165 	STAILQ_FOREACH(graph_node, &_graph->node_list, next) {  in graph_src_nodes_populate()
166 		if (graph_node->node->flags & RTE_NODE_SOURCE_F) {  in graph_src_nodes_populate()
167 			name = graph_node->node->name;  in graph_src_nodes_populate()