folioq_folio_order(9)

πŸ“¦ version 7.3.1, in nixpkgs unstable

πŸ’– NAME πŸ’–

okay so bestie, this is folioq_folio_order(9) from the Kernel API Manual, and it's giving exactly one iconic job: get the order of a folio from a folio queue segment. That's the whole vibe. πŸ’…

✨ SYNOPSIS ✨

unsigned int folioq_folio_order (const struct folio_queue *folioq ,
unsigned int slot );

πŸŽ€ ARGUMENTS πŸŽ€

  • folioq β€” the segment to access. It's the folio queue segment you're working with, bestie.
  • slot β€” the folio slot to access. The exact slot, no cap.

πŸ¦‹ DESCRIPTION πŸ¦‹

so like, this function retrieves the order of the folio in the specified slot from a folio queue segment. Easy. But β€” and this is the important part β€” no bounds check is made. None. Zero. So don't expect it to validate your slot for you. 😭

Also: if the slot hasn't been added into yet, the order returned will be 0. That's the rule. ⭐

⚠️ no bounds check happens here, so keep your vibes valid and don't assume the function is checking anything for you. πŸ’€

🌈 SEE ALSO 🌈

Kernel file: ./include/linux/folio_queue.h

go read the whole friend group too, they're all linked here:


xoxo bestie πŸ’– source/version: ./include/linux Β· date: October 2026 Β· page: folioq_folio_order(9) 🫢

πŸ“¦ where this page comes from