find_first_and_bit(9)

💅 find_first_and_bit(9) 💅

okay bestie, welcome to the Kernel API Manual page for find_first_and_bit(9) — yes, the manual name is literally right there, folded in like a cute lil intro. This function is lowkey iconic: it’s here to find the first set bit in both memory regions. No cap. ✨

✨ NAME ✨

find_first_and_bit — find the first set bit in both memory regions. It’s giving “search both regions” energy, and honestly? Obsessed. 🦋

🌸 SYNOPSIS 🌸

unsigned long find_first_and_bit (const unsigned long *addr1 , const unsigned long *addr2 , unsigned long size );

🎀 ARGUMENTS 🎀

• addr1 — the first address to base the search on. Like, the first spot you’re checking, bestie. 👑
• addr2 — the second address to base the search on. The other spot in the duo. 💅
• size — the bitmap size in bits. That’s how many bits are in the bitmap, periodt. 🔥

🔥 DESCRIPTION 🔥

It returns the bit number for the next set bit. If no bits are set, it returns size. That’s it — no extra plot twists, no secret side quests. 🌈

okay so if you were hoping for a dramatic ending where it returns something else when nothing is set: nope, it returns size. That’s the rule, and it ate. 💀

🦋 SEE ALSO 🦋

The kernel file is ./tools/include/linux/find.h — that’s where the related lore lives. The whole friend group:

• find_next_bit(9)
• find_next_and_bit(9)
• find_next_zero_bit(9)
• find_first_bit(9)
• find_first_zero_bit(9)

xoxo, your Kernel API Manual bestie 💖 — sourced from ./tools/include/linux, dated October 2026, and this page is find_first_and_bit(9). periodt. 🫶