__longest_prefix_match(9)

🎀 NAME 🎀

Hiii bestie, welcome to the Kernel API Manual — today's main character is __longest_prefix_match(9), and she is literally here to determine the longest prefix. No cap. 💅

✨ SYNOPSIS ✨

size_t __longest_prefix_match (const struct lpm_trie *trie , const
       struct lpm_trie_node *node , const struct bpf_lpm_trie_key_u8 *key );

🦋 ARGUMENTS 🦋

• trie — the trie to get internal sizes from. That's the whole assignment, bestie: internal sizes, extracted. 💖
• node — the node to operate on. This is the node having its little main-character moment. ✨
• key — the key to compare to node. Yep, that's the comparison key, periodt. 🔑

🌸 DESCRIPTION 🌸

Okay so the vibe is: determine the longest prefix of node that matches the bits in key. That's it, that's the plot. The function is out here doing prefix-match detective work, and honestly? Iconic. 🔥

👑 SEE ALSO 👑

• Kernel file ./kernel/bpf/lpm_trie.c — go read the source, iykyk. 🫶

Byeee bestie 🫶 this page comes from ./kernel/bpf, dated October 2026 — source/version and date, delivered with a little sparkle. Mwah 💋🎀