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
|
#include <stdlib.h>
#include <stdio.h>
#include "list.h"
#ifdef DEBUG
#define PDEBUG(Args...) \
do { fprintf(stderr, "mcwm: "); fprintf(stderr, ##Args); } while(0)
#define D(x) x
#else
#define PDEBUG(Args...)
#define D(x)
#endif
void movetohead(struct item **mainlist, struct item *item)
{
if (NULL == item || NULL == mainlist || NULL == *mainlist)
{
return;
}
if (*mainlist == item)
{
/* Already at head. Do nothing. */
return;
}
/* Braid together the list where we are now. */
if (NULL != item->prev)
{
item->prev->next = item->next;
}
if (NULL != item->next)
{
item->next->prev = item->prev;
}
/* Now at head. */
item->prev = NULL;
item->next = *mainlist;
/* Remember the new head. */
*mainlist = item;
}
/*
*/
struct item *additem(struct item **mainlist)
{
struct item *item;
if (NULL == (item = (struct item *) malloc(sizeof (struct item))))
{
return NULL;
}
if (NULL == *mainlist)
{
/* First in the list. */
item->prev = NULL;
item->next = NULL;
}
else
{
/* Add to beginning of list. */
item->next = *mainlist;
item->next->prev = item;
item->prev = NULL;
}
*mainlist = item;
return item;
}
void delitem(struct item **mainlist, struct item *item)
{
struct item *ml = *mainlist;
if (NULL == mainlist || NULL == *mainlist || NULL == item)
{
return;
}
if (item == *mainlist)
{
/* First entry was removed. Remember the next one instead. */
*mainlist = ml->next;
}
else
{
item->prev->next = item->next;
if (NULL != item->next)
{
/* This is not the last item in the list. */
item->next->prev = item->prev;
}
}
free(item);
}
void listitems(struct item *mainlist)
{
struct item *item;
int i;
for (item = mainlist, i = 1; item != NULL; item = item->next, i ++)
{
printf("item #%d (stored at %p).\n", i, (void *)item);
}
}
#if 0
void listall(struct item *mainlist)
{
struct item *item;
int i;
for (item = mainlist, i = 1; item != NULL; item = item->next, i ++)
{
printf("%d at %p: %s.\n", i, (void *)item, (char *)item->data);
}
}
int main(void)
{
struct item *mainlist = NULL;
struct item *item1;
struct item *item2;
struct item *item3;
struct item *item4;
char *foo1 = "1";
char *foo2 = "2";
char *foo3 = "3";
char *foo4 = "4";
item1 = additem(&mainlist);
if (NULL == item1)
{
printf("Couldn't allocate.\n");
exit(1);
}
item1->data = foo1;
printf("Current elements:\n");
listall(mainlist);
item2 = additem(&mainlist);
if (NULL == item2)
{
printf("Couldn't allocate.\n");
exit(1);
}
item2->data = foo2;
printf("Current elements:\n");
listall(mainlist);
item3 = additem(&mainlist);
if (NULL == item3)
{
printf("Couldn't allocate.\n");
exit(1);
}
item3->data = foo3;
printf("Current elements:\n");
listall(mainlist);
item4 = additem(&mainlist);
if (NULL == item4)
{
printf("Couldn't allocate.\n");
exit(1);
}
item4->data = foo4;
printf("Current elements:\n");
listall(mainlist);
movetohead(&mainlist, item2);
printf("Current elements:\n");
listall(mainlist);
printf("----------------------------------------------------------------------\n");
printf("Deleting item stored at %p\n", item3);
delitem(&mainlist, item3);
printf("Current elements:\n");
listall(mainlist);
puts("");
delitem(&mainlist, item2);
printf("Current elements:\n");
listall(mainlist);
puts("");
delitem(&mainlist, item1);
printf("Current elements:\n");
listall(mainlist);
puts("");
exit(0);
}
#endif
|
