rte_graph_...e_register(3)
π NAME π
rte_graph_feature_register β bestie, this is the feature registration struct, and she's iconic
β¨ SYNOPSIS β¨
#include <rte_graph_feature_arc.h>
πΈ Public Member Functions
STAILQ_ENTRY (rte_graph_feature_register) next_feature
π Data Fields
const char * arc_nameconst char * feature_namerte_node_t feature_node_idrte_node_process_t feature_process_fnstruct rte_node_register * feature_nodeconst char * runs_afterconst char * runs_beforerte_graph_feature_override_index_cb_t override_index_cbrte_graph_feature_change_notifier_cb_t notifier_cb
π¦ DETAILED DESCRIPTION π¦
Okay so this is the Feature registration structure that you hand over to RTE_GRAPH_FEATURE_REGISTER(). That's the whole vibe. She's the little form you fill out so your feature gets properly introduced to the arc. π
Definition at line 237 of file rte_graph_feature_arc.h.
π MEMBER FUNCTION DOCUMENTATION π
STAILQ_ENTRY (rte_graph_feature_register)
Pointer to next registered feature in the same arc. It's giving linked list, it's giving "who's next bestie" π
π FIELD DOCUMENTATION π
const char* arc_nameβ Name of the arc which is registered either viaRTE_GRAPH_FEATURE_ARC_REGISTER()or viarte_graph_feature_arc_create()
Definition at line 247 of file rte_graph_feature_arc.h.
const char* feature_nameβ Name of the feature. Short, sweet, self-explanatory. π
Definition at line 250 of file rte_graph_feature_arc.h.
rte_node_t feature_node_idβ Node id offeature_node.
Setting this field can be skipped if you're registering the feature via RTE_GRAPH_FEATURE_REGISTER() β she'll handle it, no cap.
Definition at line 258 of file rte_graph_feature_arc.h.
rte_node_process_t feature_process_fnβ Feature nodeprocess()function calling feature fast path APIs.
Heads up: if the application calls rte_graph_feature_arc_init(), then the node->process() you provided in RTE_NODE_REGISTER() gets overwritten by this function. Not a drill, that's literally the behavior. π
Definition at line 267 of file rte_graph_feature_arc.h.
struct rte_node_register* feature_nodeβ Pointer to Feature node registration.
Used when features are registered via RTE_GRAPH_FEATURE_REGISTER().
Definition at line 275 of file rte_graph_feature_arc.h.
const char* runs_afterβ Feature ordering constraintsruns_after: Name of the feature after which "this feature" should run. Ma'am, you're up after them. π
Definition at line 280 of file rte_graph_feature_arc.h.
const char* runs_beforeβ Feature ordering constraintsruns_before: Name of the feature which must run after "this feature". So likeβ¦ you go first, periodt. π
Definition at line 285 of file rte_graph_feature_arc.h.
rte_graph_feature_override_index_cb_t override_index_cbβ Allow each feature registration to overridearc->max_indexes.
If set, struct rte_graph_feature_arc_register::max_indexes is calculated as follows (before calling rte_graph_feature_arc_create()):
FOR_EACH_FEATURE_REGISTER(arc, feat) {
rte_graph_feature_arc_register::max_indexes =
max(feat->override_index_cb(),
rte_graph_feature_arc_register::max_indexes) }
Definition at line 298 of file rte_graph_feature_arc.h.
rte_graph_feature_change_notifier_cb_t notifier_cbβ Callback for notifying any change in feature enable/disable state. She will let you know the moment something flips. π
Definition at line 303 of file rte_graph_feature_arc.h.
π AUTHOR π
Generated automatically by Doxygen for DPDK from the source code. Yeah, she wrote herself, main character energy fr fr. π«Ά
Okay bestie, that's a wrap! This page came to you from the DPDK crew, Version 25.11.3, and it lives under the manual as rte_graph_...e_register(3) β a member of the Library Functions Manual family. Now go register that feature, slay, and stay hydrated. πβ¨π§
π¦ 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