vdo_priority_table_dequeue(9)

okay bestie, this is vdo_priority_table_dequeue(9) from the Kernel API Manual 🫶✨

🌸 NAME 🌸

vdo_priority_table_dequeue — find the highest-priority entry in the table, remove it from the table, and return it. no cap, that's the whole vibe 💅

✨ SYNOPSIS ✨

struct list_head * vdo_priority_table_dequeue (struct priority_table
       *table );

🎀 ARGUMENTS 🎀

• table — the priority table from which to remove an entry. that's the table we're pulling from, bestie 🫶

🦋 DESCRIPTION 🦋

okay so if there are multiple entries with the same priority, the one that has been in the table with that priority the longest will be returned. oldest-with-that-priority wins, periodt 💖

💜 RETURN 💜

the dequeued entry, or NULL if the table is currently empty. literally that simple 🦋

👑 SEE ALSO 👑

Kernel file: ./drivers/md/dm-vdo/priority-table.c — go peek, bestie 👀

• vdo_make_priority_table(9)
• vdo_free_priority_table(9)
• vdo_reset_priority_table(9)
• vdo_priority_table_enqueue(9)
• vdo_priority_table_remove(9)
• vdo_is_priority_table_empty(9)

bye bestie 💅 — this page comes from ./drivers/md/dm-vdo, dated October 2026, and it's the vdo_priority_table_dequeue(9) manual page. mwah 🎀✨