39 		sz += sizeof(struct rte_node *) * graph_node->node->nb_edges;  in graph_fp_mem_calc_size()
74 		struct rte_node *node = RTE_PTR_ADD(graph, off);  in graph_nodes_populate()  local
75 		memset(node, 0, sizeof(*node));  in graph_nodes_populate()
76 		node->fence = RTE_GRAPH_FENCE;  in graph_nodes_populate()
77 		node->off = off;  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()
83 			memcpy(node->parent, parent, RTE_GRAPH_NAMESIZE);  in graph_nodes_populate()
85 		node->id = graph_node->node->id;  in graph_nodes_populate()
86 		node->parent_id = pid;  in graph_nodes_populate()
87 		nb_edges = graph_node->node->nb_edges;  in graph_nodes_populate()
88 		node->nb_edges = nb_edges;  in graph_nodes_populate()
92 			node->nodes[count] = (struct rte_node *)&graph_node  in graph_nodes_populate()
94 						     ->node->name[0];  in graph_nodes_populate()
98 		node->next = off;  in graph_nodes_populate()
99 		__rte_node_stream_alloc(graph, node);  in graph_nodes_populate()
108 	struct rte_node *node;  in graph_node_id_to_ptr()  local
110 	rte_graph_foreach_node(count, off, graph, node)  in graph_node_id_to_ptr()
111 		if (unlikely(node->id == id))  in graph_node_id_to_ptr()
112 			return node;  in graph_node_id_to_ptr()
122 	struct rte_node *node;  in graph_node_name_to_ptr()  local
124 	rte_graph_foreach_node(count, off, graph, node)  in graph_node_name_to_ptr()
125 		if (strncmp(name, node->name, RTE_NODE_NAMESIZE) == 0)  in graph_node_name_to_ptr()
126 			return node;  in graph_node_name_to_ptr()
136 	struct rte_node *node;  in graph_node_nexts_populate()  local
140 	rte_graph_foreach_node(count, off, graph, node) {  in graph_node_nexts_populate()
141 		for (val = 0; val < node->nb_edges; val++) {  in graph_node_nexts_populate()
142 			name = (const char *)node->nodes[val];  in graph_node_nexts_populate()
143 			node->nodes[val] = graph_node_name_to_ptr(graph, name);  in graph_node_nexts_populate()
144 			if (node->nodes[val] == NULL)  in graph_node_nexts_populate()
159 	struct rte_node *node;  in graph_src_nodes_populate()  local
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()
166 			node = graph_node_name_to_ptr(graph, name);  in graph_src_nodes_populate()
167 			if (node == NULL)  in graph_src_nodes_populate()
170 			__rte_node_stream_alloc(graph, node);  in graph_src_nodes_populate()
171 			graph->cir_start[head--] = node->off;  in graph_src_nodes_populate()
218 	struct rte_node *node;  in graph_nodes_mem_destroy()  local
223 	rte_graph_foreach_node(count, off, graph, node)  in graph_nodes_mem_destroy()
224 		rte_free(node->objs);  in graph_nodes_mem_destroy()