| 135 | } |
| 136 | |
| 137 | static int |
| 138 | graph_node_nexts_populate(struct graph *_graph) |
| 139 | { |
| 140 | rte_node_t count, val; |
| 141 | rte_graph_off_t off; |
| 142 | struct rte_node *node; |
| 143 | const struct rte_graph *graph = _graph->graph; |
| 144 | const char *name; |
| 145 | |
| 146 | rte_graph_foreach_node(count, off, graph, node) { |
| 147 | for (val = 0; val < node->nb_edges; val++) { |
| 148 | name = (const char *)node->nodes[val]; |
| 149 | node->nodes[val] = graph_node_name_to_ptr(graph, name); |
| 150 | if (node->nodes[val] == NULL) |
| 151 | SET_ERR_JMP(EINVAL, fail, "%s not found", name); |
| 152 | } |
| 153 | } |
| 154 | |
| 155 | return 0; |
| 156 | fail: |
| 157 | return -rte_errno; |
| 158 | } |
| 159 | |
| 160 | static int |
| 161 | graph_src_nodes_populate(struct graph *_graph) |
no test coverage detected