pipapo_estimate_size(9)

πŸ“¦ version 7.3.1, in nixpkgs unstable

okay bestie, welcome to pipapo_estimate_size(9) from the Kernel API Manual β€” the page that estimates the worst-case size of a pipapo set. Buckle up, it's math but make it cute. πŸ§šπŸ’–

🌸 NAME 🌸

pipapo_estimate_size β€” estimate worst-case for set size. No cap, this one is literally about sizing the set before it gets spicy. 🫢

✨ SYNOPSIS ✨

u64 pipapo_estimate_size (const struct nft_set_desc *desc );

πŸŽ€ ARGUMENTS πŸŽ€

  • desc β€” the set description, bestie: the thing holding the element count and field description used here. It's giving "all the deets needed for the estimate". πŸ’…

πŸ¦‹ DESCRIPTION πŸ¦‹

okay so the size for this set type can vary dramatically, because it depends on the number of rules (composing netmasks) that the entries expand to. We compute the worst case here, periodt. πŸ”₯

In general, for a non-ranged entry or a single composing netmask, we need one bit in each of the sixteen NFT_PIPAPO_BUCKETS, for each 4-bit group β€” that's the part where each input bit needs four bits of matching data, iykyk. Plus, we need a bucket in the mapping table for each field. Slay. 🌈

⭐ RETURN ⭐

worst-case set size in bytes, 0 on any overflow. So if it overflows, you get a zero, not a whole dramatic crash era. πŸ’€

πŸ’– SEE ALSO πŸ’–


that's the whole page, bestie. source/version: ./net/netfilter Β· date: October 2026 Β· mwah πŸ’‹πŸŽ€

πŸ“¦ where this page comes from