rte_node_eth_api.h(3)
β¨ rte_node_eth_api.h β the girlies' guide to ethdev nodes β¨
okay so bestie, this is a page from the DPDK Library Functions Manual, and it's literally all about rte_node_eth_api.h. it's a header file, it's giving very experimental, and it's here to help you set up your ethdev nodes. let's get into it π
πΈ SYNOPSIS πΈ
first things first, the includes, no cap:
#include <rte_compat.h>
#include <rte_common.h>
#include <rte_graph.h>
#include <rte_mempool.h>
π Data Structures π
just the one, and she's iconic:
struct rte_node_ethdev_config
π¦ Functions π¦
two of them, and they're both doing the most:
int rte_node_eth_config (struct rte_node_ethdev_config *cfg, uint16_t
cnt, uint16_t nb_graphs)
__rte_experimental int rte_node_ethdev_rx_next_update (rte_node_t id,
const char *edge_name)
π Detailed Description π
Warning β οΈ EXPERIMENTAL: literally all the functions in this file may be changed or removed without prior notice. not a drill, bestie. she's living on the edge and she's fine with it π«Ά
so what's the actual tea? this API lets you set up ethdev_rx and ethdev_tx nodes, plus all their queue associations. it's the whole shebang. the glow-up from "raw packets" to "nodes in a graph" happens right here β¨
Definition in file rte_node_eth_api.h.
π Function Documentation π
β int rte_node_eth_config (struct rte_node_ethdev_config * cfg, uint16_t cnt, uint16_t nb_graphs)
she initializes ethdev nodes. main character energy fr fr.
Parameters π
cfgβ an array of ethdev config that identifies which port'sethdev_rxandethdev_txnodes need to be created, plus the queue association. it's basically the blueprint, iykyk.cntβ size of thecfgarray. how many blueprints we're working with πnb_graphsβ number of graphs that will be used.
Returns π
0on successful initialization, negative otherwise. (yes queen, zero is the win condition.)
π __rte_experimental int rte_node_ethdev_rx_next_update (rte_node_t id, const char * edge_name)
she updates the ethdev rx next node β like changing who she's linking up with next.
Parameters πΈ
idβ node id whose edge is to be updated. tell me which node, bestie.edge_nameβ name of the next node. the one she's walking towards πΆβοΈ
Returns π
EINVAL: either of the input parameters are invalid β aka somebody gave her the wrong info πENOMEM: if memory allocation failed β she's broke, no memory, sending thoughts and prayers π0on successful initialization.
π§ Author π§
generated automatically by Doxygen for DPDK from the source code. no human wrote this, the robots ate and left no crumbs π€β¨
and that's the whole page, periodt. π
DPDK β Version 25.11.3 β rte_node_eth_api.h(3). mwah, catch you on the next manpage, bestie π«Άπ
π¦ where this page comes from
- ubuntu resolute: dpdk-doc 25.11.3-0ubuntu0.26.04.1 Β· BSD-3-Clause
- ubuntu stonking: dpdk-doc 25.11.3-1 Β· BSD-3-Clause
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms