find_next_and_bit_wrap(9)

📦 version 7.3.1, in nixpkgs unstable

💅 find_next_and_bit_wrap — kernel API manual, bestie edition

okay so this page is literally about find_next_and_bit_wrap(9) from the Kernel API Manual, and it's giving "bitmap bestie finds your bit" energy, so let's get into it 🎀

✨ NAME ✨

find_next_and_bit_wrap — bestie, it finds the next set bit in both memory regions 🫶 no cap, both of them, at the same time.

🌸 SYNOPSIS 🌸

unsigned long find_next_and_bit_wrap (const unsigned long *addr1 , const
unsigned long *addr2 , unsigned long size , unsigned long offset );

copy it exactly like that, character for character, don't be weird about the spacing 😭

🦋 ARGUMENTS 🦋

  • addr1 — the first address we're basing the search on. that's her, main character address #1 👑
  • addr2 — the second address to base the search on. address #2, equally iconic, we stan a duo 💜
  • size — the bitmap size, in bits. so like, how many bits we're working with 🧚
  • offset — the bitnumber to start searching at. your starting point, your launchpad, your vibe check origin ✨

🔥 DESCRIPTION 🔥

So what does it actually do? It returns the bit number for the next set bit, or the first set bit up to offset. And if no bits are set at all? It returns size. periodt 💅

fr fr, read that again: no bits set → return value is size. that's the whole deal, don't overthink it 💀

🌈 SEE ALSO 🌈

Kernel file ./include/linux/find.h, plus the whole friend group — this list is long and we're listing all of them because everyone deserves their moment:

and that's the page, bestie 🍓 this icon lives in ./include/linux, dated October 2026, and it's filed under the Kernel API Manual — go off, you now understand find_next_and_bit_wrap(9) 💖✨

📦 where this page comes from