iterator.c
4.75 KB
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
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
/* GNU Mailutils -- a suite of utilities for electronic mail
Copyright (C) 1999, 2000, 2004, 2005 Free Software Foundation, Inc.
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General
Public License along with this library; if not, write to the
Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301 USA */
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
#include <errno.h>
#include <stdlib.h>
#include <list0.h>
#include <iterator0.h>
#include <mailutils/errno.h>
int
mu_iterator_create (iterator_t *piterator, void *owner)
{
iterator_t iterator;
if (piterator == NULL)
return MU_ERR_OUT_PTR_NULL;
if (owner == NULL)
return EINVAL;
iterator = calloc (sizeof (*iterator), 1);
if (iterator == NULL)
return ENOMEM;
iterator->owner = owner;
*piterator = iterator;
return 0;
}
int
mu_iterator_set_first (iterator_t itr, int (*first) (void *))
{
if (!itr)
return EINVAL;
itr->first = first;
return 0;
}
int
mu_iterator_set_next (iterator_t itr, int (*next) (void *))
{
if (!itr)
return EINVAL;
itr->next = next;
return 0;
}
int
mu_iterator_set_getitem (iterator_t itr, int (*getitem) (void *, void **))
{
if (!itr)
return EINVAL;
itr->getitem = getitem;
return 0;
}
int
mu_iterator_set_finished_p (iterator_t itr, int (*finished_p) (void *))
{
if (!itr)
return EINVAL;
itr->finished_p = finished_p;
return 0;
}
int
mu_iterator_set_curitem_p (iterator_t itr,
int (*curitem_p) (void *, void *))
{
if (!itr)
return EINVAL;
itr->curitem_p = curitem_p;
return 0;
}
int
mu_iterator_set_destroy (iterator_t itr, int (destroy) (iterator_t, void *))
{
if (!itr)
return EINVAL;
itr->destroy = destroy;
return 0;
}
int
mu_iterator_set_dup (iterator_t itr, int (dup) (void **ptr, void *data))
{
if (!itr)
return EINVAL;
itr->dup = dup;
return 0;
}
int
mu_iterator_dup (iterator_t *piterator, iterator_t orig)
{
iterator_t iterator;
int status;
if (piterator == NULL)
return MU_ERR_OUT_PTR_NULL;
if (orig == NULL)
return EINVAL;
status = mu_iterator_create (&iterator, orig->owner);
if (status)
return status;
status = orig->dup(&iterator->owner, orig->owner);
if (status)
{
free (iterator);
return status;
}
iterator->is_advanced = orig->is_advanced;
iterator->first = orig->first;
iterator->next = orig->next;
iterator->getitem = orig->getitem;
iterator->finished_p = orig->finished_p;
iterator->curitem_p = orig->curitem_p;
iterator->dup = orig->dup;
iterator->destroy = orig->destroy;
*piterator = iterator;
return 0;
}
void
mu_iterator_destroy (iterator_t *piterator)
{
if (!piterator || !*piterator)
return;
if ((*piterator)->destroy)
(*piterator)->destroy (*piterator, (*piterator)->owner);
free (*piterator);
*piterator = NULL;
}
int
mu_iterator_first (iterator_t iterator)
{
iterator->is_advanced = 0;
return iterator->first (iterator->owner);
}
int
mu_iterator_next (iterator_t iterator)
{
int status = 0;
if (!iterator->is_advanced)
status = iterator->next (iterator->owner);
iterator->is_advanced = 0;
return status;
}
int
mu_iterator_current (iterator_t iterator, void * const *pitem)
{
return iterator->getitem (iterator->owner, (void**)pitem);
}
int
mu_iterator_is_done (iterator_t iterator)
{
if (iterator == NULL)
return 1;
return iterator->finished_p (iterator->owner);
}
int
iterator_get_owner (iterator_t iterator, void **powner)
{
if (!iterator)
return EINVAL;
if (!powner)
return MU_ERR_OUT_PTR_NULL;
*powner = iterator->owner;
return 0;
}
void
mu_iterator_advance (iterator_t iterator, void *e)
{
for (; iterator; iterator = iterator->next_itr)
{
if (iterator->curitem_p (iterator->owner, e))
{
iterator->next (iterator->owner);
iterator->is_advanced++;
}
}
}
int
mu_iterator_attach (iterator_t *root, iterator_t iterator)
{
iterator->next_itr = *root;
*root = iterator;
return 0;
}
int
mu_iterator_detach (iterator_t *root, iterator_t iterator)
{
iterator_t itr, prev;
for (itr = *root, prev = NULL; itr; prev = itr, itr = itr->next_itr)
if (iterator == itr)
break;
if (itr)
{
if (prev)
prev->next = itr->next;
else
*root = itr->next_itr;
}
return 0;
}