list_private...safe_reverse(9)

πŸ“¦ version 7.3.1, in nixpkgs unstable

🌸 NAME 🌸

okay so bestie, this is list_private_for_each_entry_safe_reverse from the Kernel API Manual β€” and it does exactly what the name says: iterate backwards over list safe against removal. It's the backwards-walking, removal-safe list girlie πŸ’…βœ¨


✨ SYNOPSIS ✨

list_private_for_each_entry_safe_reverse (pos , n , head , member );

yes, that spacing is canon β€” copy it exactly, no cap 🫢


πŸŽ€ ARGUMENTS πŸŽ€

  • pos β€” the type * to use as a loop cursor. this is your main-character pointer, always out here pointing at the current entry πŸ‘‘
  • n β€” another type * to use as temporary storage. literally just extra typed pointer storage, your little backup buddy πŸ“
  • head β€” the head for your list. the starting point, the queen of the linked list 🌈
  • member β€” the name of the list_head within the struct. iykyk, it's the field name that hooks your struct into the list πŸ”₯

πŸ’– DESCRIPTION πŸ’–

Iterate backwards over list of given type, safe against removal of list entry. it's giving backwards traversal with a safety net β€” the walk doesn't get wrecked just because a list entry gets removed πŸ˜­πŸ’€


πŸ¦‹ SEE ALSO πŸ¦‹

Kernel file ./include/linux/list_private.h, plus the Private List Primitives(9) crew β€” all of these icons, fr fr:


and that's the whole vibe πŸ’œ shoutout to ./include/linux, dated October 2026, filed under list_private...safe_reverse(9) β€” bye bestie, go walk that list backwards safely πŸ§šπŸ’–

πŸ“¦ where this page comes from