rbtree_posto...h_entry_safe(9)

✨ NAME ✨

Okay so welcome to the Kernel API Manual, bestie 💖 — the page title is rbtree_posto...h_entry_safe(9), and the full-name main character is rbtree_postorder_for_each_entry_safe. It iterates in post-order over an rb_root of a given type, and it allows the backing memory of @pos to be invalidated. That's the assignment, and it ate. 💅✨

🦋 SYNOPSIS 🦋

rbtree_postorder_for_each_entry_safe (pos , n , root , field );

🌸 ARGUMENTS 🌸

• pos — the 'type *' to use as your loop cursor, bestie. It's literally the main character of each step. ⭐
• n — another 'type *', this one for temporary storage. Think of it as the understudy holding space so the show can go on. 🎭
• root — the original has no description here, so I'm not inventing lore, periodt. It's just root, mysterious and iconic. 🙈
• field — the name of the rb_node field within 'type'. Give it the exact field name and slay. 💅

💜 DESCRIPTION 💜

Okay so rbtree_postorder_for_each_entry_safe provides a similar guarantee as list_for_each_entry_safe 😌✨ — it allows the iteration to continue independent of changes to pos by the body of the loop. That's the safe part, and it's highkey giving.

🚨 Important vibe check: note, however, that it cannot handle other modifications that re-order the rbtree it is iterating over. This includes calling rb_erase on pos, as rb_erase may rebalance the tree, causing us to miss some nodes. 💀 So do not do that and expect a clean run, fr fr.

🌈 SEE ALSO 🌈

• Kernel file ./tools/include/linux/rbtree.h
• rb_add_cached(9)
• rb_add(9)
• rb_find_add(9)
• rb_find(9)
• rb_find_first(9)
• rb_next_match(9)
• rb_for_each(9)

iykyk 👑 — that's the whole crew.

Source/version: ./tools/include/linux · date: October 2026 · title: rbtree_posto...h_entry_safe(9). Byeee, bestie — go iterate responsibly 💖🫶✨