rte_graph_...c_register(3)

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

✨ NAME ✨

rte_graph_feature_arc_register β€” bestie, this is the struct that registers a whole feature arc, and she's kind of a big deal πŸ’…


πŸ¦‹ SYNOPSIS πŸ¦‹

Heads up, this page lives in the Library Functions Manual section of the DPDK docs, so it's giving "official reference" energy, but we're gonna make it cute. First things first, you gotta include her:

#include <rte_graph_feature_arc.h>

πŸŽ€ Data Fields πŸŽ€

Okay so this struct has exactly these members, no more no less:

  • const char * arc_name
  • uint16_t max_features
  • uint16_t max_indexes
  • struct rte_node_register * start_node
  • rte_node_process_t start_node_feature_process_fn
  • struct rte_graph_feature_register * end_feature

🌸 Detailed Description 🌸

It's the Feature arc registration structure. That's the whole vibe, literally. She's the blueprint you hand over so DPDK knows what your feature arc looks like ✨

Defined at line 307 of file rte_graph_feature_arc.h. Yes bestie, we cite our sources here πŸ‘‘

πŸ’– Field Documentation πŸ’–

πŸ’« const char* arc_name

The name of the feature arc. That's it, that's the field. Name her something iconic πŸ’…

Definition at line 311 of file rte_graph_feature_arc.h.

🌈 uint16_t max_features

The maximum number of features supported in this feature arc.

Here's the tea though: this field can be skipped for feature arc registration via RTE_GRAPH_FEATURE_ARC_REGISTER(). The API internally sets this field for you by calculating the number of RTE_GRAPH_FEATURE_REGISTER() calls for every arc registration done via RTE_GRAPH_FEATURE_ARC_REGISTER(). So like… the API does the counting, you just live your life 🫢

Definition at line 323 of file rte_graph_feature_arc.h.

πŸ¦‹ uint16_t max_indexes

The maximum number of indexes supported in this feature arc. Important bestie, listen: memory is allocated based on this field, so don't just put a random number in there and hope for the best 😭

Definition at line 329 of file rte_graph_feature_arc.h.

⭐ struct rte_node_register* start_node

The start node of this arc. Where the whole journey begins, main character energy fr fr πŸ‘‘

Definition at line 332 of file rte_graph_feature_arc.h.

πŸ”₯ rte_node_process_t start_node_feature_process_fn

A feature arc specific process() function for the Start node. And here's the plot twist: if your application calls rte_graph_feature_arc_init(), then start_node->process() gets replaced by this function. So she's not just a suggestion, she takes over 😳

Definition at line 339 of file rte_graph_feature_arc.h.

πŸ’œ struct rte_graph_feature_register* end_feature

The end feature node registration. Every arc needs a destination, and this is hers, periodt πŸŒ™

Definition at line 342 of file rte_graph_feature_arc.h.

🧚 Author 🧚

Generated automatically by Doxygen for DPDK from the source code. Not a human, not a girlie, just a doc generator doing her little thing πŸ€–πŸ’•


okay that's the whole page bb, no cap, you now know everything rte_graph_feature_arc_register has to offer πŸ₯³ thanks for coming to my TED talk, this was DPDK, Version 25.11.3, page rte_graph_...c_register(3) β€” slay, hydrate, and remember to read your struct docs πŸ’–βœ¨πŸŽ€

πŸ“¦ where this page comes from