summaryrefslogtreecommitdiff
path: root/mailbox2/list.c
blob: e9d3b0ece438be94d85b7906248865ad8f5ccdb8 (plain)
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
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
/* GNU mailutils - a suite of utilities for electronic mail
   Copyright (C) 1999, 2000, 2001 Free Software Foundation, Inc.

   This program is free software; you can redistribute it and/or modify
   it under the terms of the GNU General Library Public License as published by
   the Free Software Foundation; either version 2, or (at your option)
   any later version.

   This program 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 Library General Public License for more details.

   You should have received a copy of the GNU Library General Public License
   along with this program; if not, write to the Free Software
   Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.  */

#ifdef HAVE_CONFIG_H
# include <config.h>
#endif

#include <errno.h>
#include <stdlib.h>

#include <mailutils/error.h>
#include <mailutils/sys/list.h>

/* Simple double (circular)link list.  We rollup our own because we
   need to be thread-safe.  */

int
list_create (list_t *plist)
{
  list_t list;
  int status;
  if (plist == NULL)
    return EINVAL;
  list = calloc (sizeof (*list), 1);
  if (list == NULL)
    return ENOMEM;
  status = monitor_create (&(list->lock));
  if (status != 0)
    {
      free (list);
      return status;
    }
  list->head.next = &(list->head);
  list->head.prev = &(list->head);
  list->count = 0;
  *plist = list;
  return 0;
}

int
list_destroy (list_t list)
{
  if (list)
    {
      struct list_data *current;
      struct list_data *previous;
      monitor_lock (list->lock);
      for (current = list->head.next; current != &(list->head);)
	{
	  previous = current;
	  current = current->next;
	  free (previous);
	}
      monitor_unlock (list->lock);
      monitor_destroy (list->lock);
      free (list);
    }
  return 0;
}

int
list_append (list_t list, void *item)
{
  struct list_data *ldata;
  struct list_data *last;
  if (list == NULL)
    return EINVAL;
  last = list->head.prev;
  ldata = calloc (sizeof (*ldata), 1);
  if (ldata == NULL)
    return ENOMEM;
  ldata->item = item;
  monitor_lock (list->lock);
  ldata->next = &(list->head);
  ldata->prev = list->head.prev;
  last->next = ldata;
  list->head.prev = ldata;
  list->count++;
  monitor_unlock (list->lock);
  return 0;
}

int
list_prepend (list_t list, void *item)
{
  struct list_data *ldata;
  struct list_data *first;
  if (list == NULL)
    return EINVAL;
  first = list->head.next;
  ldata = calloc (sizeof (*ldata), 1);
  if (ldata == NULL)
    return ENOMEM;
  ldata->item = item;
  monitor_lock (list->lock);
  ldata->prev = &(list->head);
  ldata->next = list->head.next;
  first->prev = ldata;
  list->head.next = ldata;
  list->count++;
  monitor_unlock (list->lock);
  return 0;
}

int
list_is_empty (list_t list)
{
  size_t n = 0;
  list_count (list, &n);
  return (n == 0);
}

int
list_count (list_t list, size_t *pcount)
{
  if (list == NULL || pcount == NULL)
    return EINVAL;
  *pcount = list->count;
  return 0;
}

int
list_remove (list_t list, void *item)
{
  struct list_data *current, *previous;
  int status = ENOENT;
  if (list == NULL)
    return EINVAL;
  monitor_lock (list->lock);
  for (previous = &(list->head), current = list->head.next;
       current != &(list->head); previous = current, current = current->next)
    {
      if ((int)current->item == (int)item)
	{
	  previous->next = current->next;
	  current->next->prev = previous;
	  free (current);
	  list->count--;
	  status = 0;
	  break;
	}
    }
  monitor_unlock (list->lock);
  return ENOENT;
}

int
list_get (list_t list, size_t index, void **pitem)
{
  struct list_data *current;
  size_t count;
  int status = ENOENT;
  if (list == NULL || pitem == NULL)
    return EINVAL;
  monitor_lock (list->lock);
  for (current = list->head.next, count = 0; current != &(list->head);
       current = current->next, count++)
    {
      if (count == index)
        {
          *pitem = current->item;
	  status = 0;
	  break;
        }
    }
  monitor_unlock (list->lock);
  return status;
}

static int  l_add_ref              __P ((iterator_t));
static int  l_release              __P ((iterator_t));
static int  l_destroy              __P ((iterator_t));
static int  l_first                __P ((iterator_t));
static int  l_next                 __P ((iterator_t));
static int  l_current              __P ((iterator_t, void *));
static int  l_is_done              __P ((iterator_t));

static struct _iterator_vtable l_i_vtable =
{
  /* Base.  */
  l_add_ref,
  l_release,
  l_destroy,

  l_first,
  l_next,
  l_current,
  l_is_done
};

int
list_get_iterator (list_t list, iterator_t *piterator)
{
  struct l_iterator *l_iterator;

  if (list == NULL || piterator == NULL)
    return MU_ERROR_INVALID_PARAMETER;

  l_iterator = malloc (sizeof *l_iterator);
  if (l_iterator == NULL)
    return MU_ERROR_NO_MEMORY;

  l_iterator->base.vtable = &l_i_vtable;
  l_iterator->ref = 1;
  l_iterator->list = list;
  l_iterator->current = NULL;
  monitor_create (&(l_iterator->lock));
  *piterator = &l_iterator->base;
  return 0;
}

static int
l_add_ref (iterator_t iterator)
{
  int status = 0;
  struct l_iterator *l_iterator = (struct l_iterator *)iterator;
  if (l_iterator)
    {
      monitor_lock (l_iterator->lock);
      status = ++l_iterator->ref;
      monitor_unlock (l_iterator->lock);
    }
  return status;
}

static int
l_release (iterator_t iterator)
{
  int status = 0;
  struct l_iterator *l_iterator = (struct l_iterator *)iterator;
  if (l_iterator)
    {
      monitor_lock (l_iterator->lock);
      status = --l_iterator->ref;
      if (status <= 0)
        {
          monitor_unlock (l_iterator->lock);
          l_destroy (iterator);
          return 0;
        }
      monitor_unlock (l_iterator->lock);
    }
  return status;
}

static int
l_destroy (iterator_t iterator)
{
  struct l_iterator *l_iterator = (struct l_iterator *)iterator;
  monitor_destroy (l_iterator->lock);
  free (l_iterator);
  return 0;
}

static int
l_first (iterator_t iterator)
{
  struct l_iterator *l_iterator = (struct l_iterator *)iterator;
  list_t list = l_iterator->list;
  if (list)
    {
      monitor_lock (list->lock);
      l_iterator->current = l_iterator->list->head.next;
      monitor_unlock (list->lock);
    }
  return 0;
}

static int
l_next (iterator_t iterator)
{
  struct l_iterator *l_iterator = (struct l_iterator *)iterator;
  list_t list = l_iterator->list;
  if (list)
    {
      if (l_iterator->current)
	{
	  monitor_lock (list->lock);
	  l_iterator->current = l_iterator->current->next;
	  monitor_unlock (list->lock);
	}
      else
	l_first (iterator);
    }
  return 0;
}

static int
l_is_done (iterator_t iterator)
{
  struct l_iterator *l_iterator = (struct l_iterator *)iterator;
  int done = 0;
  list_t list = l_iterator->list;
  if (list)
    {
      monitor_lock (list->lock);
      done = (l_iterator->current == &(list->head));
      monitor_unlock (list->lock);
    }
  return done;
}

static int
l_current (iterator_t iterator, void *item)
{
  struct l_iterator *l_iterator = (struct l_iterator *)iterator;
  list_t list = l_iterator->list;
  if (list)
    {
      monitor_lock (list->lock);
      if (l_iterator->current)
	*((void **)item) = l_iterator->current->item;
      else
	*((void **)item) = NULL;
      monitor_unlock (list->lock);
    }
  return 0;
}

Return to:

Send suggestions and report system problems to the System administrator.