Home
last modified time | relevance | path

Searched refs:next_nodes (Results 1 – 15 of 15) sorted by relevance

/dpdk/lib/graph/
H A Dnode.c97 if (rte_strscpy(node->next_nodes[i], reg->next_nodes[i], in __rte_node_register()
168 reg->next_nodes[i] = node->next_nodes[i]; in node_clone()
236 const char **next_nodes, rte_edge_t nb_edges) in edge_update() argument
271 if (rte_strscpy(node->next_nodes[i], next_nodes[count], in edge_update()
316 rte_node_edge_update(rte_node_t id, rte_edge_t from, const char **next_nodes, in rte_node_edge_update() argument
328 rc = edge_update(n, prev, from, next_nodes, nb_edges); in rte_node_edge_update()
340 node_copy_edges(struct node *node, char *next_nodes[]) in node_copy_edges() argument
345 next_nodes[i] = node->next_nodes[i]; in node_copy_edges()
351 rte_node_edge_get(rte_node_t id, char *next_nodes[]) in rte_node_edge_get() argument
361 if (next_nodes == NULL) in rte_node_edge_get()
[all …]
H A Drte_graph.h437 const char *next_nodes[]; /**< Names of next nodes. */ member
543 const char **next_nodes, uint16_t nb_edges);
573 rte_node_t rte_node_edge_get(rte_node_t id, char *next_nodes[]);
H A Dgraph_private.h58 char next_nodes[][RTE_NODE_NAMESIZE]; /**< Names of next nodes. */ member
H A Dgraph_debug.c41 fprintf(f, " edge[%d] <%s>\n", i, n->next_nodes[i]); in node_dump()
H A Dgraph_ops.c21 if (strncmp(node->name, node->next_nodes[i], in node_has_loop_edge()
H A Dgraph.c99 next = graph_node->node->next_nodes[i]; in graph_node_edges_add()
123 next = graph_node->node->next_nodes[i]; in graph_adjacency_list_update()
/dpdk/app/test/
H A Dtest_graph.c88 const char *next_nodes[MAX_NODES]; member
107 .next_nodes = {"test_node00-"
118 .next_nodes = {"test_node00-"
127 .next_nodes = {"test_node00-"
136 .next_nodes = {"test_node00"},
157 .next_nodes = {"test_node00", "test_node00-test_node11"},
529 tm->test_node[i].node.next_nodes[j]) != 0) { in test_lookup_functions()
531 tm->test_node[i].node.next_nodes[j], in test_lookup_functions()
595 tm->test_node[0].node.next_nodes, in test_update_edges()
605 tm->test_node[i].node.next_nodes, in test_update_edges()
H A Dtest_graph_perf.c47 uint8_t next_nodes[MAX_EDGES_PER_NODE]; member
299 node_data->next_nodes[edges] = node_map[stage + 1][i]; in graph_node_count_edges()
484 node_data->next_nodes[edges] = node_map[0][j]; in graph_init()
548 node_data->next_nodes[edges] = snk_nodes[j]; in graph_init()
/dpdk/lib/node/
H A Dethdev_ctrl.c28 const char *next_nodes = name; in rte_node_eth_config() local
103 &next_nodes, 1); in rte_node_eth_config()
H A Dethdev_tx.c74 .next_nodes = {
H A Dpkt_cls.c215 .next_nodes = {
H A Dip4_lookup.c229 .next_nodes = {
H A Dethdev_rx.c217 .next_nodes = {
H A Dip4_rewrite.c335 .next_nodes = {
/dpdk/doc/guides/prog_guide/
H A Dgraph_lib.rst107 The number of downstream nodes connected to this node. The ``next_nodes[]``
150 Provide the ``next_nodes[]`` at the node registration time. See ``struct rte_node_register::nb_edg…
152 ``next_nodes[]`` of the node.
157 to update the ``next_nodes[]`` links for the node runtime but before graph create.
263 The first kind of nodes are those that have a fixed ``next_nodes[]`` for the