core: queue: implement moving queue entries
this works exactly the same as moving btree nodes.
This commit is contained in:
21
core/queue.c
21
core/queue.c
@@ -102,6 +102,27 @@ struct b_queue_entry *b_queue_pop_back(struct b_queue *q)
|
||||
return x;
|
||||
}
|
||||
|
||||
void b_queue_move(b_queue *q, b_queue_entry *dest, b_queue_entry *src)
|
||||
{
|
||||
if (src->qe_next) {
|
||||
src->qe_next->qe_prev = dest;
|
||||
}
|
||||
|
||||
if (src->qe_prev) {
|
||||
src->qe_prev->qe_next = dest;
|
||||
}
|
||||
|
||||
if (q->q_first == src) {
|
||||
q->q_first = dest;
|
||||
}
|
||||
|
||||
if (q->q_last == src) {
|
||||
q->q_last = dest;
|
||||
}
|
||||
|
||||
memmove(dest, src, sizeof *src);
|
||||
}
|
||||
|
||||
void b_queue_delete(struct b_queue *q, struct b_queue_entry *entry)
|
||||
{
|
||||
if (!entry) {
|
||||
|
||||
Reference in New Issue
Block a user