radix_tree_find_next_bit(9)

🌸 radix_tree_find_next_bit(9) — Kernel API Manual, but make it cute 🌸

okay so bestie, this is the Kernel API Manual page for radix_tree_find_next_bit(9). It’s giving tiny utility function with main character energy, and honestly? Obsessed. 💅

✨ NAME ✨

radix_tree_find_next_bit — find the next set bit in a memory region. Periodt. 💖

🎀 SYNOPSIS 🎀

unsigned long radix_tree_find_next_bit (struct radix_tree_node *node ,
       unsigned int tag , unsigned long offset );

🦋 ARGUMENTS 🦋

• node — where to begin the search. (struct radix_tree_node *node)
• tag — the tag index. (unsigned int tag)
• offset — the bitnumber to start searching at. (unsigned long offset)

💜 DESCRIPTION 💜

Okay so here’s the vibe: this is the unrollable variant of find_next_bit for constant size arrays. Slay. ✨

bestie, important: tail bits starting from size to roundup(size, BITS_PER_LONG) must be zero. That’s a hard requirement, not a suggestion. no cap. 🚨

It returns the next bit offset, or size if nothing found. That’s it. Iconic. 🌟

🔥 SEE ALSO 🔥

The manual points at Kernel file ./lib/radix-tree.c, plus all these besties:

• radix_tree_shrink(9)
• __radix_tree_create(9)
• radix_tree_insert(9)
• __radix_tree_lookup(9)
• radix_tree_lookup_slot(9)
• radix_tree_lookup(9)
• __radix_tree_replace(9)
• radix_tree_replace_slot(9)
• radix_tree_iter_replace(9)
• radix_tree_tag_set(9)
• radix_tree_tag_clear(9)
• radix_tree_iter_tag_clear(9)
• radix_tree_tag_get(9)
• radix_tree_next_chunk(9)
• radix_tree_gang_lookup(9)
• radix_tree_gang_lookup_tag(9)
• radix_tree_gang_lookup_tag_slot(9)
• radix_tree_iter_delete(9)
• radix_tree_delete_item(9)
• radix_tree_delete(9)
• radix_tree_tagged(9)
• idr_preload(9)
• idr_destroy(9)

mwah 💋 — sign-off time: this page’s source/version is ./lib, the date is October 2026, and the manual is radix_tree_find_next_bit(9). byeee 🫶