PROCESS(3)

📦 version 26.03, in nixos 26.05, nixpkgs unstable

💅 NAME 💅

rte_node::__rte_cache_aligned — bestie, this is a struct page from the Library Functions Manual, and it is literally just the fast path area, cache line 2. That's the whole vibe. 🎀

✨ SYNOPSIS ✨

okay so first things first, you gotta pull in the header or none of this exists:

#include <rte_graph_worker_common.h>

🌸 Data Fields 🌸

here's the whole squad, in order, no skips:

union {
};
uint16_t size
uint16_t idx
rte_graph_off_t off
uint64_t total_cycles
uint64_t total_calls
uint64_t total_objs
struct rte_node * nodes []

🦋 Detailed Description 🦋

Fast path area cache line 2. That's it. That's the description. She's iconic and she's brief. ✨

Fr fr, this is defined at line 124 of the file rte_graph_worker_common.h — write that down, there will be a quiz. 📝

👑 Field Documentation 👑

🫶 union { ... }

Node Context. Yeah she's an anonymous union with the members not shown on this page. Mysterious. Main character energy. 💅

🍓 uint16_t size

Total number of objects available. The full headcount, bestie. 👯

Defined at line 133 of rte_graph_worker_common.h.

⭐ uint16_t idx

Number of objects used. Out of that total — how many are actually in the pool rn.

Defined at line 134 of rte_graph_worker_common.h.

🌈 rte_graph_off_t off

Offset of node in the graph reel. Where she sits in the lineup, iykyk. 🎬

Defined at line 135 of rte_graph_worker_common.h.

🔥 uint64_t total_cycles

Cycles spent in this node. The clock she's been burning. Ngl this counter is the receipts. 🧾

Defined at line 136 of rte_graph_worker_common.h.

💜 uint64_t total_calls

Calls done to this node. How many times somebody rang her up. 📞

Defined at line 137 of rte_graph_worker_common.h.

🧚 uint64_t total_objs

Objects processed by this node. The body count of things she actually handled. Ate. 💀

Defined at line 138 of rte_graph_worker_common.h.

🎀 void** objs

Array of object pointers. Just a whole rack of pointers to the objects. Classic.

Defined at line 140 of rte_graph_worker_common.h.

🦋 rte_node_process_t process

Process function. The function that does the actual processing. She's the one doing the work while the rest of us watch. 🙈

Defined at line 144 of rte_graph_worker_common.h.

💖 struct rte_node* nodes[]

Next nodes. The girls that come after her in the graph. An array of struct rte_node * — literally the queue of who's next. 👑

Defined at line 147 of rte_graph_worker_common.h.

🌟 Author 🌟

Generated automatically by Doxygen for DPDK from the source code. So no, a human did not hand-obsess over this one — the robot did it. Respect the automation tho. 🤖✨

mwah 💋 this page came to you courtesy of DPDK, Version 26.03.0 — that's the source and the version from the footer, and yeah the date slot was kinda empty on this one, we're not gonna pretend otherwise. go read the header file, bestie, it's all there 🫶

📦 where this page comes from