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
|
/*
Generic queueing utilities.
Copyright (C) 2002-2005 Robert Lipe, robertlipe@usa.net
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111 USA
*/
typedef struct queue {
struct queue *next;
struct queue *prev;
} queue;
void enqueue(queue *new_el, queue *old);
queue * dequeue(queue *element);
void sortqueue (queue *qh, int (*cmp)(const queue *, const queue *));
#define QUEUE_INIT(head) (head)->next = ((head)->prev = head)
#define QUEUE_FIRST(head) ((head)->next)
#define QUEUE_NEXT(element) ((element)->next)
#define QUEUE_LAST(head) ((head)->prev)
#define QUEUE_EMPTY(head) ((head)->next == (head))
#define QUEUE_MOVE(newhead,oldhead) \
if ( (oldhead)->next == (oldhead) ) {\
(newhead)->next = (newhead)->prev = (newhead); \
} \
else { \
(newhead)->next = (oldhead)->next; \
(newhead)->prev = (oldhead)->prev; \
(newhead)->next->prev = (newhead); \
(newhead)->prev->next = (newhead); \
} \
(oldhead)->next = (oldhead)->prev = (oldhead)
#define ENQUEUE_TAIL(listhead, element) \
enqueue(element, (listhead)->prev)
#define ENQUEUE_HEAD(listhead, element) \
enqueue(element, listhead)
#define QUEUE_FOR_EACH(listhead, element, tmp) \
for ((element) = QUEUE_FIRST(listhead); \
(tmp) = QUEUE_NEXT(element), \
(element) != (listhead); \
(element) = (tmp))
|
