| 664 | } |
| 665 | |
| 666 | struct rte_node * |
| 667 | rte_graph_node_get_by_name(const char *graph_name, const char *node_name) |
| 668 | { |
| 669 | struct rte_node *node; |
| 670 | struct graph *graph; |
| 671 | rte_graph_off_t off; |
| 672 | rte_node_t count; |
| 673 | |
| 674 | STAILQ_FOREACH(graph, &graph_list, next) |
| 675 | if (!strncmp(graph->name, graph_name, RTE_GRAPH_NAMESIZE)) { |
| 676 | rte_graph_foreach_node(count, off, graph->graph, |
| 677 | node) { |
| 678 | if (!strncmp(node->name, node_name, |
| 679 | RTE_NODE_NAMESIZE)) |
| 680 | return node; |
| 681 | } |
| 682 | break; |
| 683 | } |
| 684 | |
| 685 | return NULL; |
| 686 | } |
| 687 | |
| 688 | void __rte_noinline |
| 689 | __rte_node_stream_alloc(struct rte_graph *graph, struct rte_node *node) |