llist_for_each(9)

📦 version 7.3.1, in nixpkgs unstable

💅 llist_for_each(9) — kernel API manual, but make it make sense

okay so this is llist_for_each, a kernel API manual page (section 9, the "kernel API" manual), and bestie we are going to get through this together. It's short, it's sweet, and it's giving "tiny function, big personality." 🎀

✨ NAME ✨

llist_for_each — iterate over some deleted entries of a lock-less list 🦋

✨ SYNOPSIS ✨

llist_for_each (pos , node );

that's it. that's the whole call. no cap. 💅

✨ ARGUMENTS ✨

  • pos — the struct llist_node to use as a loop cursor 👑 (this is your little guy that walks the list)
  • node — the first entry of deleted list entries 🌸 (this is where you start walking from)

✨ DESCRIPTION ✨

okay so here's the vibe check: in general, some entries of the lock-less list can be traversed safely only after being deleted from the list, so you start with an entry instead of the list head. like, the list head is not invited to this party, we're starting from the entry itself, 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. yes, newest first. it's giving reverse chronological, it's giving "most recent ex first in the group chat." 😭

so if you want to traverse from the oldest to the newest, you must reverse the order by yourself before traversing. nobody's gonna do it for you, bestie — you gotta reverse that order yourself, fr fr. 🔥

✨ SEE ALSO ✨

Kernel file ./include/linux/llist.h 🌈 and the whole llist friend group, all linked up:

like, the entire llist cast showed up. main character energy from every single one of them. 💖

and that's the page, bestie 🫶 — brought to you from ./include/linux, dated October 2026, in the Kernel API Manual. go traverse something (safely, after deletion, newest to oldest, or reverse it yourself, you got this) ✨💜

📦 where this page comes from