radix_tree_iter_retry(9)

💅 radix_tree_iter_retry(9) — the Kernel API Manual, bestie edition

okay so real talk, this is a page from the Kernel API Manual and it's genuinely not as scary as it looks. it's giving "tiny function, huge aura" ✨ let's get into it.

---

🌸 NAME 🌸

radix_tree_iter_retry — retry this chunk of the iteration. that's it. that's the whole job. she retries. she's an icon. 👑

---

✨ SYNOPSIS ✨

void __rcu ** radix_tree_iter_retry (struct radix_tree_iter *iter );

look at her. one argument. no drama. 💅

---

🎀 ARGUMENTS 🎀

• iter — the iterator state. this is the little vibe-check package that carries where you are in the tree, and you're handing it over so it can get its retry on. 🫶

---

💖 DESCRIPTION 💖

okay so picture this: you're iterating over a tree that's protected only by the RCU lock — no heavy locks, just vibes and RCU. 🌈 and because of that, a race against deletion or creation can happen, and you might end up seeing a slot for which radix_tree_deref_retry returns true. 😭

and if that happens? bestie, you call this function and you continue the iteration. that's the whole move. no cap. 🔥

lowkey important: this is the "the tree changed under me, don't panic, just retry this chunk" button. don't skip it, or your iteration is gonna be a mess. 💀

---

🦋 SEE ALSO 🦋

the whole squad, fr fr — no gatekeeping 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_resume(9)
• radix_tree_chunk_size(9)
• radix_tree_next_slot(9)
• radix_tree_for_each_slot(9)
• radix_tree_for_each_tagged(9)

like literally go read all of them, they all ate. 🍓

---

and that's the page!! 🧚 mwah 💜 this one lives over in ./include/linux, and the version notes say October 2026 — so yeah, mark your calendars bestie, see u then. ⭐🎀