Files
mango/ds/queue.c

135 lines
2.0 KiB
C
Raw Normal View History

#include <socks/queue.h>
#include <assert.h>
#include <stdio.h>
size_t queue_length(queue_t *q)
{
size_t i = 0;
queue_entry_t *x = q->q_first;
while (x) {
i++;
x = x->qe_next;
}
return i;
}
void queue_insert_before(queue_t *q, queue_entry_t *entry, queue_entry_t *before)
{
queue_entry_t *x = before->qe_prev;
if (x) {
x->qe_next = entry;
} else {
q->q_first = entry;
}
entry->qe_prev = x;
before->qe_prev = entry;
entry->qe_next = before;
}
void queue_insert_after(queue_t *q, queue_entry_t *entry, queue_entry_t *after)
{
queue_entry_t *x = after->qe_next;
if (x) {
x->qe_prev = entry;
} else {
q->q_last = entry;
}
entry->qe_prev = x;
after->qe_next = entry;
entry->qe_prev = after;
}
void queue_push_front(queue_t *q, queue_entry_t *entry)
{
if (q->q_first) {
q->q_first->qe_prev = entry;
}
entry->qe_next = q->q_first;
entry->qe_prev = NULL;
q->q_first = entry;
if (!q->q_last) {
q->q_last = entry;
}
}
void queue_push_back(queue_t *q, queue_entry_t *entry)
{
if (q->q_last) {
q->q_last->qe_next = entry;
}
entry->qe_prev = q->q_last;
entry->qe_next = NULL;
q->q_last = entry;
if (!q->q_first) {
q->q_first = entry;
}
}
queue_entry_t *queue_pop_front(queue_t *q)
{
queue_entry_t *x = q->q_first;
if (x) {
queue_delete(q, x);
}
return x;
}
queue_entry_t *queue_pop_back(queue_t *q)
{
queue_entry_t *x = q->q_last;
if (x) {
queue_delete(q, x);
}
return x;
}
void queue_delete(queue_t *q, queue_entry_t *entry)
{
if (!entry) {
return;
}
if (entry == q->q_first) {
q->q_first = q->q_first->qe_next;
}
if (entry == q->q_last) {
q->q_last = q->q_last->qe_prev;
}
if (entry->qe_next) {
entry->qe_next->qe_prev = entry->qe_prev;
}
if (entry->qe_prev) {
entry->qe_prev->qe_next = entry->qe_next;
}
entry->qe_next = entry->qe_prev = NULL;
}
void queue_delete_all(queue_t *q)
{
queue_entry_t *x = q->q_first;
while (x) {
queue_entry_t *next = x->qe_next;
x->qe_next = x->qe_prev = NULL;
x = next;
}
q->q_first = q->q_last = NULL;
}