radix_tree_for_each_slot(9)

💖 radix_tree_for_each_slot(9) 💖

okay so bestie, welcome to the radix_tree_for_each_slot(9) page from the Kernel API Manual — and it is literally all about iterating over non-empty slots ✨ no cap. The synopsis is giving four-argument energy, and we’re gonna walk through every single one, periodt 💅

✨ NAME ✨

radix_tree_for_each_slot — iterate over non-empty slots 🌸

🦋 SYNOPSIS 🦋

radix_tree_for_each_slot (slot , root , iter , start );

🎀 ARGUMENTS 🎀

• slot — the void** variable for pointer to slot 🫶
• root — the struct radix_tree_root pointer 🌱
• iter — the struct radix_tree_iter pointer 💫
• start — iteration starting index 🔢

💜 DESCRIPTION 💜

slot points to radix tree slot, and iter->index contains its index. that’s the whole tea, bestie — the pointer and the index are the moment fr fr 💖

🔥 SEE ALSO 🔥

the squad / recs are right here:

• Kernel file ./include/linux/radix-tree.h
• struct radix_tree_iter(9)
• Radix-tree synchronization(9)
• radix_tree_deref_slot(9)
• radix_tree_deref_slot_protected(9)
• radix_tree_deref_retry(9)
• radix_tree_exception(9)
• radix_tree_iter_init(9)
• radix_tree_next_chunk(9)
• radix_tree_iter_lookup(9)
• radix_tree_iter_retry(9)
• radix_tree_iter_resume(9)
• radix_tree_chunk_size(9)
• radix_tree_next_slot(9)
• radix_tree_for_each_tagged(9)

made with 💖 from source <./include/linux> and the October 2026 version of radix_tree_for_each_slot(9) — bye bestie, go off and iterate those non-empty slots 🫶💅