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
|
/*
* linklist.c - linked lists
*
* This file is part of zsh, the Z shell.
*
* Copyright (c) 1992-1997 Paul Falstad
* All rights reserved.
*
* Permission is hereby granted, without written agreement and without
* license or royalty fees, to use, copy, modify, and distribute this
* software and to distribute modified versions of this software for any
* purpose, provided that the above copyright notice and the following
* two paragraphs appear in all copies of this software.
*
* In no event shall Paul Falstad or the Zsh Development Group be liable
* to any party for direct, indirect, special, incidental, or consequential
* damages arising out of the use of this software and its documentation,
* even if Paul Falstad and the Zsh Development Group have been advised of
* the possibility of such damage.
*
* Paul Falstad and the Zsh Development Group specifically disclaim any
* warranties, including, but not limited to, the implied warranties of
* merchantability and fitness for a particular purpose. The software
* provided hereunder is on an "as is" basis, and Paul Falstad and the
* Zsh Development Group have no obligation to provide maintenance,
* support, updates, enhancements, or modifications.
*
*/
#include "zsh.mdh"
#include "linklist.pro"
/* Get an empty linked list header */
/**/
LinkList
newlinklist(void)
{
LinkList list;
list = (LinkList) alloc(sizeof *list);
list->first = NULL;
list->last = (LinkNode) list;
return list;
}
/* Insert a node in a linked list after a given node */
/**/
LinkNode
insertlinknode(LinkList list, LinkNode node, void *dat)
{
LinkNode tmp, new;
tmp = node->next;
node->next = new = (LinkNode) alloc(sizeof *tmp);
new->last = node;
new->dat = dat;
new->next = tmp;
if (tmp)
tmp->last = new;
else
list->last = new;
return new;
}
/* Insert an already-existing node into a linked list after a given node */
/**/
LinkNode
uinsertlinknode(LinkList list, LinkNode node, LinkNode new)
{
LinkNode tmp = node->next;
node->next = new;
new->last = node;
new->next = tmp;
if (tmp)
tmp->last = new;
else
list->last = new;
return new;
}
/* Insert a list in another list */
/**/
void
insertlinklist(LinkList l, LinkNode where, LinkList x)
{
LinkNode nx;
nx = where->next;
if (!l->first)
return;
where->next = l->first;
l->last->next = nx;
l->first->last = where;
if (nx)
nx->last = l->last;
else
x->last = l->last;
}
/* Get top node in a linked list */
/**/
void *
getlinknode(LinkList list)
{
void *dat;
LinkNode node;
if (!(node = list->first))
return NULL;
dat = node->dat;
list->first = node->next;
if (node->next)
node->next->last = (LinkNode) list;
else
list->last = (LinkNode) list;
zfree(node, sizeof(struct linknode));
return dat;
}
/* Get top node in a linked list without freeing */
/**/
void *
ugetnode(LinkList list)
{
void *dat;
LinkNode node;
if (!(node = list->first))
return NULL;
dat = node->dat;
list->first = node->next;
if (node->next)
node->next->last = (LinkNode) list;
else
list->last = (LinkNode) list;
return dat;
}
/* Remove a node from a linked list */
/**/
void *
remnode(LinkList list, LinkNode nd)
{
void *dat;
nd->last->next = nd->next;
if (nd->next)
nd->next->last = nd->last;
else
list->last = nd->last;
dat = nd->dat;
zfree(nd, sizeof(struct linknode));
return dat;
}
/* Remove a node from a linked list without freeing */
/**/
void *
uremnode(LinkList list, LinkNode nd)
{
void *dat;
nd->last->next = nd->next;
if (nd->next)
nd->next->last = nd->last;
else
list->last = nd->last;
dat = nd->dat;
return dat;
}
/* Free a linked list */
/**/
void
freelinklist(LinkList list, FreeFunc freefunc)
{
LinkNode node, next;
for (node = list->first; node; node = next) {
next = node->next;
if (freefunc)
freefunc(node->dat);
zfree(node, sizeof(struct linknode));
}
zfree(list, sizeof(struct linklist));
}
/* Count the number of nodes in a linked list */
/**/
int
countlinknodes(LinkList list)
{
LinkNode nd;
int ct = 0;
for (nd = firstnode(list); nd; incnode(nd), ct++);
return ct;
}
/**/
void
rolllist(LinkList l, LinkNode nd)
{
l->last->next = l->first;
l->first->last = l->last;
l->first = nd;
l->last = nd->last;
nd->last = (LinkNode) l;
l->last->next = 0;
}
|
