list_swap(9)

📦 version 7.3.1, in nixpkgs unstable

💜 okay so, list_swap(9) — Kernel API Manual, bestie

hi hi hi 🫶 welcome to the little corner of the kernel docs where two list nodes literally trade lives. this one is from the Kernel API Manual, and it's short, it's sweet, and it ate. let's get into it ✨

🌸 NAME

list_swap — replace entry1 with entry2 and re-add entry1 at entry2's position 💅

that's it. that's the whole vibe. two entries, one swap, no cap.

✨ SYNOPSIS

void list_swap (struct list_head *entry1 , struct list_head *entry2 );

she takes two struct list_head * and returns void, because the drama is entirely in-place, as it should be 👑

🎀 ARGUMENTS

  • entry1 — the location to place entry2 🦋 (so entry1 is the spot that's gonna be holding entry2 by the end)
  • entry2 — the location to place entry1 🌈 (yep, they're swapping, that's the whole bit)

like... it's giving mutual relocation. both of them move. neither of them knows where they're going until they get there. iconic behavior fr fr 💀

🔥 SEE ALSO

bestie there is a whole friend group here, and i mean a whole one. this is the Kernel file ./include/linux/list.h and everyone in it:

that's the roster. that's the whole group chat. the hlist girlies showed up too ofc, they always do 💅

ngl if you're grooving on list_swap, go read the rest of them — the list API is genuinely one of the most satisfying little families in the kernel and i will not be taking questions about that 🌸

okay bye bestie, go swap something 🦋

mwah 💖 this little page lives in ./include/linux and it's dated October 2026 — see you in the next one, periodt 🎀

📦 where this page comes from