klist_prev(9)

💅 NAME 💅

klist_prev(9) — fresh from the Kernel API Manual — is the function that's here to Ante up prev node in list. That's the whole name-drop, bestie. ✨

✨ SYNOPSIS ✨

struct klist_node * klist_prev (struct klist_iter *i );

🎀 ARGUMENTS 🎀

• i — the iterator structure. She's the main character you pass in, okay? 💅

🦋 DESCRIPTION 🦋

Okay so here's the literal sequence, no cap:

1. First, grab the list lock. 🔒
2. Decrement the reference count of the previous node, if there was one.
3. Grab the prev node, increment its reference count, drop the lock, and return that prev node. 🫶

That's the whole flow — lock first, handle that previous node's refcount if it exists, then scoop up the prev node, bump its refcount, release the lock, and hand it back. Iconic. 🌸

🌈 SEE ALSO 🌈

Kernel file: ./lib/klist.c

• klist_init(9)
• klist_add_head(9)
• klist_add_tail(9)
• klist_add_behind(9)
• klist_add_before(9)
• klist_del(9)
• klist_remove(9)
• klist_node_attached(9)
• klist_iter_init_node(9)
• klist_iter_init(9)
• klist_iter_exit(9)
• klist_next(9)

And that's the page, bestie: source/version is ./lib, dated October 2026, and the star of the show is klist_prev(9). Bye~ 💖🎀🦋