rte_graph_...e_register(3)

πŸ“¦
version 25.11.3 Β· 4 versions
, in ubuntu resolute, ubuntu stonking

πŸ’– 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_name
  • const char * feature_name
  • rte_node_t feature_node_id
  • rte_node_process_t feature_process_fn
  • struct rte_node_register * feature_node
  • const char * runs_after
  • const char * runs_before
  • rte_graph_feature_override_index_cb_t override_index_cb
  • rte_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 via RTE_GRAPH_FEATURE_ARC_REGISTER() or via rte_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 of feature_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 node process() 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 constraints runs_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 constraints runs_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 override arc->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