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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
|
/* vim: set ts=4 sw=4 ai:
* sq.c -- simple queue implementation derived from NetBSD's queue.h
*/
#include <stdlib.h>
#include "sq.h"
struct sqh *sq_new(void)
{
struct sqh *hd;
hd = malloc(sizeof(*hd));
if (hd != NULL)
sq_init(hd);
return hd;
}
struct sqe *sq_elem_new(void *data)
{
struct sqe *e;
e = malloc(sizeof(*e));
if (e != NULL)
e->data = data;
return e;
}
void sq_insert_head(struct sqh *hd, struct sqe *e)
{
if ((e->next = hd->first) == NULL)
hd->last = &e->next;
hd->first = e;
}
void sq_insert_tail(struct sqh *hd, struct sqe *e)
{
e->next = NULL;
*hd->last = e;
hd->last = &e->next;
}
void sq_insert_after(struct sqh *hd, struct sqe *e, struct sqe *n)
{
if ((n->next = e->next) == NULL)
hd->last = &n->next;
e->next = n;
}
void sq_remove_head(struct sqh *hd)
{
if ((hd->first = hd->first->next) == NULL)
hd->last = &hd->first;
}
void sq_remove_after(struct sqh *hd, struct sqe *e)
{
if ((e->next = e->next->next) == NULL)
hd->last = &e->next;
}
void sq_remove(struct sqh *hd, struct sqe *e)
{
if (hd->first == e) {
if ((hd->first = hd->first->next) == NULL)
hd->last = &hd->first;
}
else {
struct sqe *cur = hd->first;
while (cur->next != e)
cur = cur->next;
if ((cur->next = cur->next->next) == NULL)
hd->last = &cur->next;
}
}
void sq_concat(struct sqh *hd1, struct sqh *hd2)
{
if (!(hd2->first == NULL)) {
*hd1->last = hd2->first;
hd1->last = hd2->last;
hd2->first = NULL;
hd2->last = &hd2->first;
}
}
void sq_cleanup(struct sqh *hd, void (*func)(void *))
{
struct sqe *e, *t;
sq_foreach_safe(e, hd, t) {
sq_remove(hd, e);
if (func)
func(e->data);
free(e);
}
}
struct sqe *sq_find_from_data(struct sqh *hd, const void *data, int (*cmp)(const void *, const void *))
{
struct sqe *e;
if (hd && !sq_empty(hd))
sq_foreach(e, hd)
if (e->data && cmp(e->data, data) == 0)
return e;
return NULL;
}
|
