radix_tree_next_chunk(9)

✨ radix_tree_next_chunk(9) ✨

Okay so welcome to the Kernel API Manual, bestie — this page is all about radix_tree_next_chunk, and it’s here to help you find the next chunk of slots for iteration. No cap. 🫶

💖 NAME 💖

radix_tree_next_chunk — find next chunk of slots for iteration. That’s the whole assignment, and it ate. 💅

✨ SYNOPSIS ✨

       void __rcu ** radix_tree_next_chunk (const struct radix_tree_root *root
       , struct radix_tree_iter *iter , unsigned flags );

🎀 ARGUMENTS 🎀

• root — the radix tree root. Yep, the root of the radix tree, bestie. 🌳
• iter — the iterator state. It’s literally the iterator state, so keep it close. 🦋
• flags — the RADIX_TREE_ITER_* flags and the tag index. Both. Together. Iconic. 💅

🌸 RETURN 🌸

Returns a pointer to the chunk’s first slot — or NULL if iteration is over. So if you get NULL, the iteration said “bye” and meant it. 😭✨

🦋 SEE ALSO 🦋

Kernel file ./lib/radix-tree.c — yes, that’s the file, and here are all the cross-reference besties:

• radix_tree_find_next_bit(9)
• 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_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)

Bye bestie — this page is from the ./lib source, dated October 2026, and it’s radix_tree_next_chunk(9) signing off with Kernel API Manual energy. 💌✨