gen_pool_best_fit(9)

📦 version 7.3.1, in nixpkgs unstable

💅 gen_pool_best_fit(9) 💅

Ok so bestie, you know how the manual says this lives under the kernel API manual? Yeah, that's the vibe. Let's get into it. 🎀

✨ NAME ✨

gen_pool_best_fit — find the best fitting region of memory matching the size requirement (no alignment constraint) 🧚

🌸 SYNOPSIS 🌸

unsigned long gen_pool_best_fit (unsigned long *map , unsigned long size
, unsigned long start , unsigned int nr , void *data , struct gen_pool
*pool , unsigned long start_addr );

🦋 ARGUMENTS 🦋

  • map — the address you're basing the search on, literally the launch pad for this whole hunt 🔍
  • size — the bitmap size, in bits
  • start — the bitnumber where the searching begins, like your starting position in a group chat scroll
  • nr — the number of zeroed bits we're looking for (this is the size requirement, the whole reason we're here)
  • data — additional data, but bestie it's unused, so don't stress 💀
  • pool — the pool we're finding the fit region memory from
  • start_addr — not used in this function 🫶 (yes, it's in the signature anyway, don't @ me)

👑 DESCRIPTION 👑

So what it does is iterate over the bitmap to find the smallest free region that we can allocate the memory in. That's the best fit, that's the whole point, no cap. It's giving "picky but make it efficient." ✨

🔥 SEE ALSO 🔥

Kernel file ./lib/genalloc.c — and here's the whole squad, all of them, every single one, because we don't skip anybody in this house 🫶:

💖 that's a wrap bestie 💖 this one's from ./lib, dated October 2026, and the page is gen_pool_best_fit(9) — go forth and allocate responsibly, mwah 💅✨

📦 where this page comes from