44 graph_node_add(struct graph *graph, struct node *node)  in graph_node_add()  argument
51 		if (strncmp(node->name, graph_node->node->name,  in graph_node_add()
56 	sz = sizeof(*graph_node) + node->nb_edges * sizeof(struct node *);  in graph_node_add()
61 			    node->name);  in graph_node_add()
64 	graph_node->node = node;  in graph_node_add()
76 node_to_graph_node(struct graph *graph, struct node *node)  in node_to_graph_node()  argument
81 		if (graph_node->node == node)  in node_to_graph_node()
84 	SET_ERR_JMP(ENODEV, fail, "Found isolated node %s", node->name);  in node_to_graph_node()
93 	struct node *adjacency;  in graph_node_edges_add()
98 		for (i = 0; i < graph_node->node->nb_edges; i++) {  in graph_node_edges_add()
99 			next = graph_node->node->next_nodes[i];  in graph_node_edges_add()
117 	struct node *adjacency;  in graph_adjacency_list_update()
122 		for (i = 0; i < graph_node->node->nb_edges; i++) {  in graph_adjacency_list_update()
123 			next = graph_node->node->next_nodes[i];  in graph_adjacency_list_update()
145 	struct node *node;  in expand_pattern_to_node()  local
148 	STAILQ_FOREACH(node, node_head, next) {  in expand_pattern_to_node()
149 		if (fnmatch(pattern, node->name, 0) == 0) {  in expand_pattern_to_node()
150 			if (graph_node_add(graph, node))  in expand_pattern_to_node()
183 		if (graph_node->node->init) {  in graph_node_init()
184 			name = graph_node->node->name;  in graph_node_init()
185 			rc = graph_node->node->init(  in graph_node_init()
205 		if (graph_node->node->fini)  in graph_node_fini()
206 			graph_node->node->fini(  in graph_node_fini()
209 						       graph_node->node->name));  in graph_node_fini()
215 	struct rte_node *node;  in graph_mem_fixup_node_ctx()  local
216 	struct node *node_db;  in graph_mem_fixup_node_ctx()
221 	rte_graph_foreach_node(count, off, graph, node) {  in graph_mem_fixup_node_ctx()
222 		if (node->parent_id == RTE_NODE_ID_INVALID) /* Static node */  in graph_mem_fixup_node_ctx()
223 			name = node->name;  in graph_mem_fixup_node_ctx()
225 			name = node->parent;  in graph_mem_fixup_node_ctx()
230 		node->process = node_db->process;  in graph_mem_fixup_node_ctx()
419 	struct rte_node *node;  in rte_graph_node_get()  local
428 						node) {  in rte_graph_node_get()
429 				if (node->id == nid)  in rte_graph_node_get()
430 					return node;  in rte_graph_node_get()
441 	struct rte_node *node;  in rte_graph_node_get_by_name()  local
449 						node) {  in rte_graph_node_get_by_name()
450 				if (!strncmp(node->name, node_name,  in rte_graph_node_get_by_name()
452 					return node;  in rte_graph_node_get_by_name()
461 __rte_node_stream_alloc(struct rte_graph *graph, struct rte_node *node)  in __rte_node_stream_alloc()  argument
463 	uint16_t size = node->size;  in __rte_node_stream_alloc()
468 	node->objs = rte_realloc_socket(node->objs, size * sizeof(void *),  in __rte_node_stream_alloc()
470 	RTE_VERIFY(node->objs);  in __rte_node_stream_alloc()
471 	node->size = size;  in __rte_node_stream_alloc()
472 	node->realloc_count++;  in __rte_node_stream_alloc()
476 __rte_node_stream_alloc_size(struct rte_graph *graph, struct rte_node *node,  in __rte_node_stream_alloc_size()  argument
479 	uint16_t size = node->size;  in __rte_node_stream_alloc_size()
484 	node->objs = rte_realloc_socket(node->objs, size * sizeof(void *),  in __rte_node_stream_alloc_size()
486 	RTE_VERIFY(node->objs);  in __rte_node_stream_alloc_size()
487 	node->size = size;  in __rte_node_stream_alloc_size()
488 	node->realloc_count++;  in __rte_node_stream_alloc_size()
506 		node_name = graph_node->node->name;  in graph_to_dot()
507 		for (i = 0; i < graph_node->node->nb_edges; i++) {  in graph_to_dot()
509 				     graph_node->adjacency_list[i]->node->name,  in graph_to_dot()
510 				     graph_node->node->flags & RTE_NODE_SOURCE_F  in graph_to_dot()