2 * Sherlock Library -- Circular Linked Lists
4 * (c) 2003 Martin Mares <mj@ucw.cz>
6 * This software may be freely distributed and used according to the terms
7 * of the GNU Lesser General Public License.
10 #ifndef _SHERLOCK_CLISTS_H
11 #define _SHERLOCK_CLISTS_H
13 typedef struct cnode {
14 struct cnode *next, *prev;
17 typedef struct clist {
21 static inline void *clist_head(clist *l)
23 return (l->head.next != &l->head) ? l->head.next : NULL;
26 static inline void *clist_tail(clist *l)
28 return (l->head.prev != &l->head) ? l->head.prev : NULL;
31 static inline void *clist_next(clist *l, cnode *n)
33 return (n->next != &l->head) ? (void *) n->next : NULL;
36 static inline void *clist_prev(clist *l, cnode *n)
38 return (n->prev != &l->head) ? (void *) n->prev : NULL;
41 static inline int clist_empty(clist *l)
43 return (l->head.next == &l->head);
46 #define CLIST_WALK(n,list) for(n=(void*)(list).head.next; (cnode*)(n) != &(list).head; n=(void*)((cnode*)(n))->next)
47 #define CLIST_WALK_DELSAFE(n,list,tmp) for(n=(void*)(list).head.next; tmp=(void*)((cnode*)(n))->next, (cnode*)(n) != &(list).head; n=(void*)tmp)
49 static inline void clist_insert_after(cnode *what, cnode *after)
51 cnode *before = after->next;
58 static inline void clist_insert_before(cnode *what, cnode *before)
60 cnode *after = before->prev;
67 static inline void clist_add_tail(clist *l, cnode *n)
69 clist_insert_before(n, &l->head);
72 static inline void clist_add_head(clist *l, cnode *n)
74 clist_insert_after(n, &l->head);
77 static inline void clist_remove(cnode *n)
79 cnode *before = n->prev;
80 cnode *after = n->next;
85 static inline void clist_init(clist *l)
87 cnode *head = &l->head;
88 head->next = head->prev = head;