plist_requeue(9)

💅 plist_requeue(9) — Kernel API Manual, but make it bestie-coded 💅

Okay so this little icon is from the Kernel API Manual, and we’re about to get into it. 🫶

---

🎀 NAME 🎀

plist_requeue — requeue @node at end of same-prio entries. ✨

---

✨ SYNOPSIS ✨

Here’s the signature, literally verbatim, no edits bestie:

void plist_requeue (struct plist_node *node , struct plist_head *head );

---

🫶 ARGUMENTS 🫶

• node — a struct plist_node pointer, aka the entry to be moved. 🦋
• head — a struct plist_head pointer, aka the list head. 🌸

---

🌈 DESCRIPTION 🌈

This is essentially an optimized plist_del followed by plist_add. Periodt. 💅

It moves an entry already in the plist to after any other same-priority entries. That’s the whole vibe. 🎀

---

🦋 SEE ALSO 🦋

• Kernel file ./lib/plist.c
• plist_add(9), plist_del(9)

---

Signed off from ./lib in October 2026 — this is plist_requeue(9), and it ate, no cap. 💖✨