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
|
/*
* LIST.C
*
*/
#include "defs.h"
Prototype void InitList(List *list);
Prototype void *MakeNode(const char *name, int size, int value);
Prototype void *CopyNode(Node *node);
Prototype void AddHead(List *list, Node *node);
Prototype void AddTail(List *list, Node *node);
Prototype void InsertAfter(List *list, Node *lnode, Node *node);
Prototype void InsertBefore(List *list, Node *lnode, Node *node);
Prototype void DelNode(List *list, Node *node);
Prototype void *RemHead(List *list);
Prototype void *RemTail(List *list);
Prototype void *GetHead(List *list);
Prototype void *GetTail(List *list);
Prototype void *GetNext(Node *node);
Prototype void *GetPrev(Node *node);
void
InitList(List *list)
{
memset(list, 0, sizeof(List));
list->li_Node.no_Next = &list->li_Node;
list->li_Node.no_Prev = &list->li_Node;
list->li_Refs = 1;
}
void *
MakeNode(const char *name, int size, int value)
{
Node *node = malloc(size + strlen(name) + 1);
memset(node, 0, size);
node->no_Name = (char *)node + size;
node->no_Value = value;
node->no_Size = size;
if ((node->no_INode = CurINode) != NULL)
node->no_ILine = CurINode->in_Node.no_ILine;
strcpy(node->no_Name, name);
return(node);
}
void *
CopyNode(Node *node)
{
Node *n2 = malloc(node->no_Size);
/*
* copy the node contents. Note that
* the node's name still points to the
* original node's string buffer, so we
* do not have to allocate a new one.
*/
memmove(n2, node, node->no_Size);
return(n2);
}
void
AddHead(List *list, Node *node)
{
Node *next = list->li_Node.no_Next;
node->no_Next = next;
node->no_Prev = &list->li_Node;
list->li_Node.no_Next = node;
next->no_Prev = node;
++list->li_Count;
}
void
AddTail(List *list, Node *node)
{
Node *prev = list->li_Node.no_Prev;
node->no_Next = &list->li_Node;
node->no_Prev = prev;
list->li_Node.no_Prev = node;
prev->no_Next = node;
++list->li_Count;
}
void
InsertAfter(List *list, Node *lnode, Node *node)
{
Node *next = lnode->no_Next;
node->no_Next = next;
node->no_Prev = lnode;
lnode->no_Next = node;
next->no_Prev = node;
++list->li_Count;
}
void
InsertBefore(List *list, Node *lnode, Node *node)
{
Node *prev = lnode->no_Prev;
node->no_Next = lnode;
node->no_Prev = prev;
lnode->no_Prev = node;
prev->no_Next = node;
++list->li_Count;
}
void
DelNode(List *list, Node *node)
{
node->no_Next->no_Prev = node->no_Prev;
node->no_Prev->no_Next = node->no_Next;
--list->li_Count;
}
void *
RemHead(List *list)
{
Node *node;
if ((node = GetHead(list)) != NULL)
DelNode(list, node);
return(node);
}
void *
RemTail(List *list)
{
Node *node;
if ((node = GetTail(list)) != NULL)
DelNode(list, node);
return(node);
}
void *
GetHead(List *list)
{
Node *node = list->li_Node.no_Next;
if (node == &list->li_Node)
node = NULL;
return(node);
}
void *
GetTail(List *list)
{
Node *node = list->li_Node.no_Prev;
if (node == &list->li_Node)
node = NULL;
return(node);
}
void *
GetNext(Node *node)
{
if (node) {
node = node->no_Next;
if (node->no_Name == NULL)
node = NULL;
}
return(node);
}
void *
GetPrev(Node *node)
{
if (node) {
node = node->no_Prev;
if (node->no_Name == NULL)
node = NULL;
}
return(node);
}
|
