folioq_nr_slots(9)

πŸ“¦ version 7.3.1, in nixpkgs unstable

✨ folioq_nr_slots(9) β€” the kernel API manual, bestie edition ✨

okay so real talk, this one is a lil function from the kernel API manual (folioq_nr_slots) and it's lowkey iconic for how much it refuses to be pinned down. let's get into it πŸ’…


🌸 NAME 🌸

folioq_nr_slots β€” it asks a folio queue segment "how many folios can you hold, bestie?" and honestly the answer might be different every time 😭


πŸ¦‹ SYNOPSIS πŸ¦‹

unsigned int folioq_nr_slots (const struct folio_queue *folioq );

that's it, that's the whole vibe check β€” it takes one arg and hands you back an unsigned int ✨


πŸŽ€ ARGUMENTS πŸŽ€

  • folioq β€” the segment we're querying. like, the specific one. the main character of this call 🫢

πŸ’– DESCRIPTION πŸ’–

so what it does: it queries the number of folios that a particular folio queue segment might hold. capacity check, basically πŸ“

[!] NOTE: this must not be assumed to be the same for every segment! not me warning you about this specifically 😭 like fr fr, do not hardcode one answer and assume every segment is matching. it's giving "each one is unique, respect it" energy. πŸ’€

🌈 SEE ALSO 🌈

kernel file ./include/linux/folio_queue.h and literally the whole folio queue friend group:

go read all of them, iykyk πŸ‘‘ the whole squad ate πŸ”₯


anyway that's the page, mwah πŸ’‹ it lives in ./include/linux and this version is dated October 2026 β€” go off, bestie, and remember: every segment is a different size, no cap πŸ§šπŸ’œ

πŸ“¦ where this page comes from