Home
last modified time | relevance | path

Searched refs:rte_node_edge_update (Results 1 – 7 of 7) sorted by relevance

/f-stack/dpdk/lib/librte_graph/
H A Dversion.map32 rte_node_edge_update;
H A Drte_graph.h542 rte_edge_t rte_node_edge_update(rte_node_t id, rte_edge_t from,
H A Dnode.c327 rte_node_edge_update(rte_node_t id, rte_edge_t from, const char **next_nodes, in rte_node_edge_update() function
/f-stack/dpdk/lib/librte_node/
H A Dethdev_ctrl.c104 rte_node_edge_update(ip4_rewrite_node->id, RTE_EDGE_ID_INVALID, in rte_node_eth_config()
/f-stack/dpdk/app/test/
H A Dtest_graph_perf.c426 count = rte_node_edge_update( in graph_init()
489 count = rte_node_edge_update(src_nodes[i], 0, in graph_init()
552 count = rte_node_edge_update(node_map[stages - 1][i], 0, in graph_init()
H A Dtest_graph.c576 count = rte_node_edge_update(node_id, 0, in test_update_edges()
586 count = rte_node_edge_update(tm->test_node[i].idx, 0, in test_update_edges()
/f-stack/dpdk/doc/guides/prog_guide/
H A Dgraph_lib.rst108 stores the downstream nodes objects. ``rte_node_edge_update()`` and
157 Use ``rte_node_edge_get()``, ``rte_node_edge_update()``, ``rte_node_edge_shrink()``