list_add_tail_rcu(9)

📦 version 7.3.1, in nixpkgs unstable

💅 list_add_tail_rcu(9) — Kernel API Manual 💅

okay bestie, this is the Kernel API Manual page for list_add_tail_rcu(9), and it’s honestly giving “quietly essential list girlie” energy. no cap, she’s useful. 🎀

🎀 NAME 🎀

list_add_tail_rcu — add a new entry to rcu-protected list ✨

🌸 SYNOPSIS 🌸

void list_add_tail_rcu (struct list_head *new , struct list_head *head
);

🫶 ARGUMENTS 🫶

  • new — the new entry to be added, aka the fresh little node sliding into the list 💖
  • head — the list head to add it before, literally the spot it gets inserted ahead of 💅

🌈 DESCRIPTION 🌈

Insert a new entry before the specified head. This is useful for implementing queues — yes, queue behavior, we love to see it 🔥.

The caller must take whatever precautions are necessary (such as holding appropriate locks) to avoid racing with another list-mutation primitive, such as list_add_tail_rcu or list_del_rcu, running on this same list. Like, do not skip the safety prep, bestie 😭. However, it is perfectly legal to run concurrently with the _rcu list-traversal primitives, such as list_for_each_entry_rcu. That part is slay and allowed 💜.

⚠️ tiny but important vibe check: the caller still has to take whatever precautions are necessary — such as holding appropriate locks — so another list-mutation primitive like list_add_tail_rcu or list_del_rcu doesn’t race with this same list.

🦋 SEE ALSO 🦋

Kernel file ./include/linux/rculist.h — and here’s the whole friend group, no one left out 🫶:

signed off with 💖 from ./include/linux, dated October 2026, for list_add_tail_rcu(9) — periodt, go add that tail entry responsibly 🫶✨

📦 where this page comes from