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
|
/*
* Copyright (C) Volition, Inc. 1999. All rights reserved.
*
* All source code herein is the property of Volition, Inc. You may not sell
* or otherwise commercially exploit the source or things you created based on the
* source.
*
*/
#ifndef _LINKLIST_H
#define _LINKLIST_H
// Initializes a list of zero elements
#define list_init( head ) \
do { \
(head)->next = (head); \
(head)->prev = (head); \
} while (0)
// Inserts element onto the front of the list
#define list_insert( head, elem ) \
do { \
(elem)->next = (head)->next; \
(head)->next->prev = (elem); \
(head)->next = (elem); \
(elem)->prev = (head); \
} while (0)
// Inserts new_elem before elem
#define list_insert_before(elem, new_elem) \
do { \
(elem)->prev->next = (new_elem); \
(new_elem)->prev = (elem)->prev; \
(elem)->prev = (new_elem); \
(new_elem)->next = (elem); \
} while (0)
// Appends an element on to the tail of the list
#define list_append( head, elem ) \
do { \
(elem)->prev = (head)->prev; \
(elem)->next = (head); \
(head)->prev->next = (elem); \
(head)->prev = (elem); \
} while (0)
// Adds list b onto the end of list a
#define list_merge( a, b ) \
do { \
(a)->prev->next = (b)->next; \
(b)->next->prev = (a)->prev; \
(a)->prev = (b)->prev; \
(b)->prev->next = (a); \
} while (0)
// Removes an element from the list
#define list_remove( head, elem ) \
do { \
(elem)->prev->next = (elem)->next; \
(elem)->next->prev = (elem)->prev; \
(elem)->next = NULL; \
(elem)->prev = NULL; \
} while(0)
// Moves elem to be after head
#define list_move_append(head, elem) \
do { \
(elem)->prev->next = (elem)->next; \
(elem)->next->prev = (elem)->prev; \
(elem)->prev = (head)->prev; \
(elem)->next = (head); \
(head)->prev->next = (elem); \
(head)->prev = (elem); \
} while (0)
#define GET_FIRST(head) ((head)->next)
#define GET_LAST(head) ((head)->prev)
#define GET_NEXT(elem) ((elem)->next)
#define GET_PREV(elem) ((elem)->prev)
#define END_OF_LIST(head) (head)
#define NOT_EMPTY(head) ((head)->next != (head))
#define EMPTY(head) ((head)->next == (head))
#endif
|
