src/queue.c


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84

#include <assert.h>
#include <stdlib.h>

#include "queue.h"

struct queue_entry {
    struct queue_entry *next;
    void *data;
};

struct pa_queue {
    struct queue_entry *front, *back;
    unsigned length;
};

struct pa_queue* pa_queue_new(void) {
    struct pa_queue *q = malloc(sizeof(struct pa_queue));
    assert(q);
    q->front = q->back = NULL;
    q->length = 0;
    return q;
}

void pa_queue_free(struct pa_queue* q, void (*destroy)(void *p, void *userdata), void *userdata) {
    struct queue_entry *e;
    assert(q);

    e = q->front;
    while (e) {
        struct queue_entry *n = e->next;

        if (destroy)
            destroy(e->data, userdata);

        free(e);
        e = n;
    }

    free(q);
}

void pa_queue_push(struct pa_queue *q, void *p) {
    struct queue_entry *e;

    e = malloc(sizeof(struct queue_entry));

    e->data = p;
    e->next = NULL;

    if (q->back)
        q->back->next = e;
    else {
        assert(!q->front);
        q->front = e;
    }

    q->back = e;
    q->length++;
}

void* pa_queue_pop(struct pa_queue *q) {
    void *p;
    struct queue_entry *e;
    assert(q);

    if (!(e = q->front))
        return NULL;

    q->front = e->next;
    if (q->back == e)
        q->back = NULL;

    p = e->data;
    free(e);

    q->length--;
    
    return p;
}

int pa_queue_is_empty(struct pa_queue *q) {
    assert(q);
    return q->length == 0;
}