rte_table_lpm_ipv6_key(3)

💖 NAME 💖

okay so bestie, this is the manual page for rte_table_lpm_ipv6_key — and yes, the header’s manual-name vibe is Library Functions Manual. That’s the whole NAME situation, no cap. 💅

✨ SYNOPSIS ✨

#include <rte_table_lpm_ipv6.h>

🧸 Data Fields 🧸

• struct rte_ipv6_addr ip
• uint8_t depth

🌸 Detailed Description 🌸

An LPM table rule — i.e. a route — specified as an IP prefix. The way that the lookup operation works: its key is the destination IP address, read from the input packet meta-data. But the entry add and entry delete operations work with LPM rules, and each rule covers a multitude of lookup keys (destination IP addresses) that share the same data (next hop). It’s giving “one rule, many lookups, same next-hop energy.” ✨

Definition at line 77 of file rte_table_lpm_ipv6.h.

🧚 Field Documentation 🧚

struct rte_ipv6_addr ip 🌈

IP address.

Definition at line 79 of file rte_table_lpm_ipv6.h.

uint8_t depth 🦋

IP address depth. The most significant "depth" bits of the IP address specify the network part of the IP address, while the rest of the bits specify the host part of the address and are ignored for the purpose of route specification.

Definition at line 85 of file rte_table_lpm_ipv6.h.

🫶 Author 🫶

Generated automatically by Doxygen for DPDK from the source code. 💜

Cute sign-off time, bestie: this footer energy is DPDK, Version 26.03.0, and the manual name rte_table_lpm_ipv6_key(3). The footer doesn’t print a separate date, so I’m not making one up — consider that the date-slot vibe check. 🎀