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
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
|
/*
* libmowgli: A collection of useful routines for programming.
* queue.c: Double-ended queues, also known as deque.
*
* Copyright (c) 2007 William Pitcock <nenolod -at- sacredspiral.co.uk>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice is present in all copies.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
* IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
#include "mowgli.h"
static mowgli_heap_t *mowgli_queue_heap = NULL;
void
mowgli_queue_bootstrap(void)
{
mowgli_queue_heap = mowgli_heap_create(sizeof(mowgli_queue_t), 256, BH_NOW);
if (mowgli_queue_heap == NULL)
mowgli_log("mowgli_queue_heap was not created, expect problems.");
}
mowgli_queue_t *
mowgli_queue_shift(mowgli_queue_t *head, void *data)
{
mowgli_queue_t *out = mowgli_heap_alloc(mowgli_queue_heap);
return_val_if_fail(head != NULL, NULL);
out->next = head;
out->data = data;
if (head != NULL)
{
out->prev = head->prev;
if (out->prev != NULL)
out->prev->next = out;
head->prev = out;
}
return out;
}
mowgli_queue_t *
mowgli_queue_push(mowgli_queue_t *head, void *data)
{
mowgli_queue_t *out = mowgli_heap_alloc(mowgli_queue_heap);
return_val_if_fail(head != NULL, NULL);
out->prev = head;
out->data = data;
if (head != NULL)
head->next = out;
return out;
}
mowgli_queue_t *
mowgli_queue_remove(mowgli_queue_t *head)
{
mowgli_queue_t *out;
return_val_if_fail(head != NULL, NULL);
if (head->prev != NULL)
head->prev->next = head->next;
if (head->next != NULL)
head->next->prev = head->prev;
out = head->prev != NULL ? head->prev : head->next;
mowgli_heap_free(mowgli_queue_heap, head);
return out;
}
mowgli_queue_t *
mowgli_queue_find(mowgli_queue_t *head, void *data)
{
mowgli_queue_t *n;
return_val_if_fail(head != NULL, NULL);
for (n = head; n != NULL; n = n->next)
if (n->data == data)
return n;
return NULL;
}
mowgli_queue_t *
mowgli_queue_remove_data(mowgli_queue_t *head, void *data)
{
mowgli_queue_t *n = mowgli_queue_find(head, data);
return_val_if_fail(head != NULL, NULL);
if (n != NULL)
return mowgli_queue_remove(n);
return NULL;
}
void
mowgli_queue_destroy(mowgli_queue_t *head)
{
mowgli_queue_t *n, *n2;
return_if_fail(head != NULL);
for (n = head, n2 = n ? n->next : NULL; n != NULL; n = n2, n2 = n ? n->next : NULL)
mowgli_queue_remove(n);
}
mowgli_queue_t *
mowgli_queue_skip(mowgli_queue_t *head, int nodes)
{
mowgli_queue_t *n;
int iter;
return_val_if_fail(head != NULL, NULL);
for (iter = 0, n = head; n != NULL && iter < nodes; n = n->next, iter++);
return n;
}
mowgli_queue_t *
mowgli_queue_rewind(mowgli_queue_t *head, int nodes)
{
mowgli_queue_t *n;
int iter;
return_val_if_fail(head != NULL, NULL);
for (iter = 0, n = head; n != NULL && iter < nodes; n = n->prev, iter++);
return n;
}
mowgli_queue_t *
mowgli_queue_head(mowgli_queue_t *n)
{
mowgli_queue_t *tn;
return_val_if_fail(n != NULL, NULL);
for (tn = n; tn != NULL && tn->prev != NULL; tn = tn->prev);
return tn;
}
mowgli_queue_t *
mowgli_queue_tail(mowgli_queue_t *n)
{
mowgli_queue_t *tn;
return_val_if_fail(n != NULL, NULL);
for (tn = n; tn != NULL && tn->next != NULL; tn = tn->next);
return tn;
}
void *
mowgli_queue_pop_head(mowgli_queue_t **n)
{
mowgli_queue_t *tn;
void *out;
return_val_if_fail(n != NULL, NULL);
return_val_if_fail(*n != NULL, NULL);
tn = *n;
out = tn->data;
*n = tn->next;
mowgli_queue_remove(tn);
return out;
}
void *
mowgli_queue_pop_tail(mowgli_queue_t **n)
{
mowgli_queue_t *tn;
void *out;
return_val_if_fail(n != NULL, NULL);
return_val_if_fail(*n != NULL, NULL);
tn = *n;
out = tn->data;
*n = tn->prev;
mowgli_queue_remove(tn);
return out;
}
int
mowgli_queue_length(mowgli_queue_t *head)
{
int iter;
mowgli_queue_t *n;
return_val_if_fail(head != NULL, -1);
for (n = head, iter = 0; n != NULL; n = n->next, iter++);
return iter;
}
|
