drm_mm_for_each_node(9)

💖 NAME 💖

Okay so welcome to drm_mm_for_each_node(9), fresh from the Kernel API Manual — and yes bestie, we are literally talking about an iterator to walk over all allocated nodes ✨

🦋 SYNOPSIS 🦋

drm_mm_for_each_node (entry , mm );

🎀 ARGUMENTS 🎀

• entry — a struct drm_mm_node to assign to in each iteration step. Every loop pass, this is the node bestie you're currently on 💅
• mm — the drm_mm allocator to walk. We're strolling through the whole allocator, no cap 🚶‍♀️✨

🌸 DESCRIPTION 🌸

This iterator walks over all nodes in the range allocator. That's the whole vibe: all the nodes, one by one, main character energy 👑

It's implemented with list_for_each, so not save against removal of elements — yep, that's the exact wording on the page, and the warning is real: removal of elements is a problem here 😭💀

🫶 SEE ALSO 🫶

Kernel file: ./include/drm/drm_mm.h

• 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_safe(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)

Mwah 💋 this page comes from ./include/drm and is dated October 2026 — it's drm_mm_for_each_node(9) from the Kernel API Manual, and that's the sign-off, bestie 🫶💅