Lines Matching defs:graph_node

97 	struct graph_node *graph_node;
101 	STAILQ_FOREACH(graph_node, &graph->node_list, next)
102 		if (strncmp(node->name, graph_node->node->name,
107 	sz = sizeof(*graph_node) + node->nb_edges * sizeof(struct node *);
108 	graph_node = calloc(1, sz);
110 	if (graph_node == NULL)
115 	graph_node->node = node;
118 	STAILQ_INSERT_TAIL(&graph->node_list, graph_node, next);
122 	free(graph_node);
126 static struct graph_node *
129 	struct graph_node *graph_node;
131 	STAILQ_FOREACH(graph_node, &graph->node_list, next)
132 		if (graph_node->node == node)
133 			return graph_node;
143 	struct graph_node *graph_node;
148 	STAILQ_FOREACH(graph_node, &graph->node_list, next) {
149 		for (i = 0; i < graph_node->node->nb_edges; i++) {
150 			next = graph_node->node->next_nodes[i];
167 	struct graph_node *graph_node, *tmp;
172 	STAILQ_FOREACH(graph_node, &graph->node_list, next) {
173 		for (i = 0; i < graph_node->node->nb_edges; i++) {
174 			next = graph_node->node->next_nodes[i];
182 			graph_node->adjacency_list[i] = tmp;
217 	struct graph_node *graph_node;
220 		graph_node = STAILQ_FIRST(&graph->node_list);
222 		free(graph_node);
229 	struct graph_node *graph_node;
233 	STAILQ_FOREACH(graph_node, &graph->node_list, next) {
234 		if (graph_node->node->init) {
235 			name = graph_node->node->name;
236 			rc = graph_node->node->init(
253 	struct graph_node *graph_node;
255 	STAILQ_FOREACH(graph_node, &graph->node_list, next)
256 		if (graph_node->node->fini)
257 			graph_node->node->fini(
260 						       graph_node->node->name));
309 	struct graph_node *graph_node;
311 	STAILQ_FOREACH(graph_node, &graph->node_list, next)
312 		if ((graph_node->node->flags & RTE_NODE_SOURCE_F) &&
313 		    (graph_node->node->lcore_id == RTE_MAX_LCORE ||
314 		     graph->lcore_id == graph_node->node->lcore_id))
526 	struct graph_node *graph_node;
551 	STAILQ_FOREACH(graph_node, &parent_graph->node_list, next) {
552 		if (graph_node_add(graph, graph_node->node))
722 	struct graph_node *graph_node;
735 	STAILQ_FOREACH(graph_node, &graph->node_list, next) {
737 		node_name = graph_node->node->name;
742 		if (graph_node->node->flags & RTE_NODE_SOURCE_F) {
747 		} else if (graph_node->node->nb_edges == 0) {
755 		for (i = 0; i < graph_node->node->nb_edges; i++) {
757 			if (graph_node->adjacency_list[i]->node->nb_edges == 0)
760 				     graph_node->adjacency_list[i]->node->name,