5 Author: Pekka Riikonen <priikone@silcnet.org>
7 Copyright (C) 2002 - 2005 Pekka Riikonen
9 This program is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; version 2 of the License.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
20 /****h* silcutil/SILC List Interface
24 * Implementation of the SilcList interface. This interface provides
32 /****s* silcutil/SilcList/SilcList
36 * typedef struct { ... } SilcList;
40 * This is the SilcList context, and is initialized by calling the
41 * function silc_list_init.
45 void *head; /* Start of the list */
46 void *tail; /* End of the list */
47 void *current; /* Current pointer in list */
48 SilcUInt16 next_offset; /* Offset to 'next' pointer */
49 SilcUInt16 prev_offset; /* Offset to 'prev' pointer */
50 unsigned int prev_set : 1; /* Set if 'prev' exists */
51 unsigned int end_set : 1; /* Set if silc_list_end was called */
52 unsigned int count : 30; /* Number of entries in the list */
55 /****d* silcutil/SilcList/SILC_LIST_END
59 * #define SILC_LIST_END ...
63 * Functions return this when the list is invalid or when traversing
64 * the list there is no more entires in the list.
68 #define SILC_LIST_END NULL
71 /****f* silcutil/SilcList/silc_list_init
75 * #define silc_list_init(list, type, nextfield) ...
79 * This macro initializes the SilcList list. The `list' is the defined
80 * list, second argument is the structure of the entries in the list,
81 * and last argument is the pointer in the structure that is used
82 * as next list members. When using SilcList you must not touch the
83 * structure member pointers manually. If your list has also a prev
84 * pointer should use silc_list_init_prev instead of this call if
85 * you need to be able traverse the list backwards as well.
89 * struct SilcInternalEntryStruct {
91 * struct SilcInternalEntryStruct *next; // The list member pointer
95 * silc_list_init(list, struct SilcInternalEntryStruct, next);
98 #define silc_list_init(list, type, nextfield) \
101 (list).next_offset = silc_offsetof(type, nextfield); \
102 (list).prev_set = 0; \
103 (list).prev_offset = 0; \
104 (list).head = (list).tail = (list).current = NULL; \
107 /****f* silcutil/SilcList/silc_list_init_prev
111 * #define silc_list_init_prev(list, type, nextfield, prevfield) ...
115 * This macro initializes the SilcList list. The `list' is the defined
116 * list, second argument is the structure of the entries in the list,
117 * and last two arguments are the pointers in the structure that is used
118 * as next and prev list members. When using SilcList you must not
119 * touch the structure member pointers manually.
121 * Having both next and prev pointers makes it possible to traverse
122 * list from both ends of the list (from start to end, and from end
127 * struct SilcInternalEntryStruct {
129 * struct SilcInternalEntryStruct *next; // The list member pointer
130 * struct SilcInternalEntryStruct *prev; // The list member pointer
134 * silc_list_init_prev(list, struct SilcInternalEntryStruct, next, prev);
137 #define silc_list_init_prev(list, type, nextfield, prevfield) \
140 (list).next_offset = silc_offsetof(type, nextfield); \
141 (list).prev_offset = silc_offsetof(type, prevfield); \
142 (list).prev_set = 1; \
143 (list).head = (list).tail = (list).current = NULL; \
146 /****f* silcutil/SilcList/silc_list_count
150 * #define silc_list_count(list) ...
154 * Returns the number of entries in the list indicated by `list'.
157 #define silc_list_count(list) (list).count
159 /****f* silcutil/SilcList/silc_list_start
163 * #define silc_list_start(list) ...
167 * Sets the start of the list. This prepares the list for traversing
168 * the entries from the start of the list towards end of the list.
171 #define silc_list_start(list) \
172 ((list).current = (list).head, (list).end_set = 0)
174 /****f* silcutil/SilcList/silc_list_end
178 * #define silc_list_end(list) ...
182 * Sets the end of the list. This prepares the list for traversing
183 * the entries from the end of the list towards start of the list.
187 * You can use this call only if you initialized the list with
188 * silc_list_init_prev.
191 #define silc_list_end(list) \
192 ((list).current = (list).tail, (list).end_set = 1)
194 /* Macros to get position to next and prev list pointers */
195 #define __silc_list_next(list, pos) \
196 ((void **)((unsigned char *)(pos) + (list).next_offset))
197 #define __silc_list_prev(list, pos) \
198 ((void **)((unsigned char *)(pos) + (list).prev_offset))
200 /****f* silcutil/SilcList/silc_list_add
204 * #define silc_list_add(list, entry) ...
208 * Adds new entry indicated by `entry' to the end of the list indicated
212 #define silc_list_add(list, entry) \
215 (list).head = (entry); \
217 *__silc_list_next(list, (list).tail) = (entry); \
218 if ((list).prev_set) \
219 *__silc_list_prev(list, entry) = (list).tail; \
220 (list).tail = (entry); \
221 *__silc_list_next(list, entry) = NULL; \
225 /****f* silcutil/SilcList/silc_list_insert
229 * #define silc_list_insert(list, current, entry) ...
233 * Insert new entry indicated by `entry' after the entry `current'
234 * to the list indicated by `list'. If `current' is NULL, then the
235 * `entry' is added at the head of the list. Use the silc_list_add
236 * to add at the end of the list.
239 #define silc_list_insert(list, current, entry) \
243 *__silc_list_next(list, entry) = (list).head; \
245 *__silc_list_next(list, entry) = NULL; \
246 if ((list).prev_set && (list).head) \
247 *__silc_list_prev(list, (list).head) = entry; \
249 (list).tail = (entry); \
250 (list).head = (entry); \
251 if ((list).prev_set) \
252 *__silc_list_prev(list, entry) = NULL; \
254 *__silc_list_next(list, entry) = *__silc_list_next(list, current); \
255 *__silc_list_next(list, current) = entry; \
256 if ((list).prev_set) { \
257 *__silc_list_prev(list, entry) = current; \
258 if (*__silc_list_next(list, entry)) \
259 *__silc_list_prev(list, *__silc_list_next(list, entry)) = entry; \
261 if ((list).tail == (current)) \
262 (list).tail = (entry); \
267 /****f* silcutil/SilcList/silc_list_del
271 * #define silc_list_del(list, entry) ...
275 * Remove entry indicated by `entry' from the list indicated by `list'.
278 #define silc_list_del(list, entry) \
282 for (p = &(list).head; *p; p = __silc_list_next(list, *p)) { \
283 if (*p == (entry)) { \
284 *p = *__silc_list_next(list, entry); \
285 if (*p && (list).prev_set) \
286 *__silc_list_prev(list, *p) = *__silc_list_prev(list, entry); \
287 if ((list).current == (entry)) \
288 (list).current = *p; \
294 if (entry == (list).tail) \
295 (list).tail = prev; \
298 /****f* silcutil/SilcList/silc_list_get
302 * #define silc_list_get(list) ...
306 * Returns the current entry from the list indicated by `list' and
307 * moves the list pointer forward so that calling this next time will
308 * return the next entry from the list. This can be used to traverse
309 * the list. Returns SILC_LIST_END when the entire list has been
310 * tarversed and no additional entries exist in the list. Later,
311 * silc_list_start (or silc_list_end) must be called again when
312 * re-starting the list tarversing.
316 * // Traverse the list from the beginning to the end
317 * silc_list_start(list);
318 * while ((entry = silc_list_get(list)) != SILC_LIST_END) {
322 * // Traverse the list from the end to the beginning
323 * silc_list_end(list);
324 * while ((entry = silc_list_get(list)) != SILC_LIST_END) {
329 #define silc_list_get(x) __silc_list_get(&(x))
331 void *__silc_list_get(SilcList *list)
333 void *pos = list->current;
335 list->current = (list->end_set ? *__silc_list_prev(*list, pos) :
336 *__silc_list_next(*list, pos));