rte_table_..._lb_params(3)

πŸ’– NAME πŸ’–

rte_table_action_lb_params β€” bestie, this is the load-balancing action params struct, and it's literally the one that decides where your packets go. Periodt.


✨ SYNOPSIS ✨

#include <rte_table_action.h>

πŸŽ€ Data Fields

  • uint32_t out [RTE_TABLE_ACTION_LB_TABLE_SIZE]

🌸 Detailed Description 🌸

Load balance action parameters (per table rule).

Okay so this is per table rule β€” meaning every rule gets its own lil copy of this vibe. πŸ¦‹

Definition at line 171 of file rte_table_action.h.

πŸ‘‘ Field Documentation πŸ‘‘

🌈 uint32_t out[RTE_TABLE_ACTION_LB_TABLE_SIZE]

Table defining the output values and their weights. Like, this array is the weighting system, no cap. πŸ’…

The weights are set in 1/RTE_TABLE_ACTION_LB_TABLE_SIZE increments β€” so that's your smallest possible unit of "how much does this one count".

To assign a weight of N/RTE_TABLE_ACTION_LB_TABLE_SIZE to a given output value (where 0 <= N <= RTE_TABLE_ACTION_LB_TABLE_SIZE), the same output value needs to show up exactly N times in this table. Yep β€” duplicates are the whole point. You're not deduping, you're stacking. πŸ“

So if you want something to get a big slice of the traffic pie, you write it in a bunch. If you want it to get almost nothing, you write it in almost never. Zero times = zero weight, iconic.

Definition at line 178 of file rte_table_action.h.

🫢 Author 🫢

Generated automatically by Doxygen for DPDK from the source code.

(Not a human author, bestie β€” it's a robot doing its little robot thing. πŸ€–βœ¨)


That's the whole page, fr fr. This bad boy came from DPDK, Version 25.11.3 πŸ’œ β€” go forth and load-balance responsibly, you absolute main character. πŸŽ€

πŸ“¦ where this page comes from