llist_for_each_entry(9)

💖 NAME 💖

llist_for_each_entry — iterate over some deleted entries of a lock-less list of a given type. Welcome to the Kernel API Manual, bestie ✨

🌸 SYNOPSIS 🌸

llist_for_each_entry (pos , node , member );

🎀 ARGUMENTS 🎀

• pos — the type * to use as your loop cursor. Iconic little cursor behavior 💅
• node — the fist entry of deleted list entries. (Yes, the page says fist, not first — keeping it exactly as written, no cap 💀)
• member — the name of the llist_node with the struct. That's the one, bestie.

🦋 DESCRIPTION 🦋

Okay so real talk: in general, some entries of the lock-less list can be traversed safely only after being removed from the list. That's why you start with an entry instead of the list head. Periodt.

If you're using this on entries deleted from the lock-less list directly, the traverse order is from the newest to the oldest added entry. If you want to go from the oldest to the newest, you must reverse the order by yourself before traversing. No auto-magic reversal, bestie — you're the main character of that part 😭💪

🌈 SEE ALSO 🌈

Kernel file ./include/linux/llist.h, plus all these little legends:

• init_llist_head(9)
• init_llist_node(9)
• llist_on_list(9)
• llist_entry(9)
• member_address_is_nonnull(9)
• llist_for_each(9)
• llist_for_each_safe(9)
• llist_for_each_entry_safe(9)
• llist_empty(9)
• llist_add_batch(9)
• llist_add(9)
• llist_del_all(9)
• llist_del_first_init(9)

That's the whole vibe: source/version ./include/linux, dated October 2026, from the Kernel API Manual — llist_for_each_entry(9) signing off with sparkles and a tiny bow 🎀✨💜