drm_mm_for_each_node_safe(9)

✨ drm_mm_for_each_node_safe ✨

okay bestie, so this is a page from the Kernel API Manual (yes, the kernel has its own manual, she's iconic) and it's all about drm_mm_for_each_node_safe — the iterator that walks over all allocated nodes 💅

---

🌸 NAME 🌸

drm_mm_for_each_node_safe — an iterator to walk over all allocated nodes 🦋

---

🎀 SYNOPSIS 🎀

drm_mm_for_each_node_safe (entry , next , mm );

---

💖 ARGUMENTS 💖

• entry — a struct drm_mm_node that gets assigned to on every iteration step. this is literally your main character, the node you're looking at rn 👑
• next — a struct drm_mm_node where the next step gets stored. it's holding the next look for you, no cap 🫶
• mm — the drm_mm allocator you're walking through. the whole vibe check happens in here ✨

---

🔥 DESCRIPTION 🔥

so the way that this works: this iterator walks over all the nodes in the range allocator. that's it, that's the function 💀

it's implemented with list_for_each_safe, which means it is safe against removal of elements — so you can delete stuff mid-walk and it won't fall apart on you. slay. 💅

ngl, that "safe" in the name is doing real work here — that's the whole reason next exists as its own argument. 🧚

---

🌈 SEE ALSO 🌈

Kernel file ./include/drm/drm_mm.h, plus the whole friend group:

• enum drm_mm_insert_mode(9)
• struct drm_mm_node(9)
• struct drm_mm(9)
• struct drm_mm_scan(9)
• drm_mm_node_allocated(9)
• drm_mm_initialized(9)
• drm_mm_hole_follows(9)
• drm_mm_hole_node_start(9)
• drm_mm_hole_node_end(9)
• drm_mm_nodes(9)
• drm_mm_for_each_node(9)
• drm_mm_for_each_hole(9)
• drm_mm_insert_node_generic(9)
• drm_mm_insert_node(9)
• drm_mm_clean(9)
• drm_mm_for_each_node_in_range(9)
• drm_mm_scan_init(9)

---

⭐ ok that's the page!! this one shipped from ./include/drm in October 2026 — so go forth and iterate safely, bestie, you've got this 💜🎀🦋