X-Git-Url: http://mj.ucw.cz/gitweb/?a=blobdiff_plain;ds=sidebyside;f=lib%2Fclists.h;h=4f1848d8d2fc903a9327cab05df40c444df6a171;hb=231e128f91f6cc7f23f5d2392dffaa7857f1dcfa;hp=aed8028a53f9603e851a8cf8b074f80963de6fbb;hpb=608c1899dbff7471a870491295d38809e2d650ac;p=libucw.git diff --git a/lib/clists.h b/lib/clists.h index aed8028a..4f1848d8 100644 --- a/lib/clists.h +++ b/lib/clists.h @@ -1,14 +1,14 @@ /* - * Sherlock Library -- Circular Linked Lists + * UCW Library -- Circular Linked Lists * - * (c) 2003 Martin Mares + * (c) 2003--2005 Martin Mares * * This software may be freely distributed and used according to the terms * of the GNU Lesser General Public License. */ -#ifndef _SHERLOCK_CLISTS_H -#define _SHERLOCK_CLISTS_H +#ifndef _UCW_CLISTS_H +#define _UCW_CLISTS_H typedef struct cnode { struct cnode *next, *prev; @@ -45,6 +45,10 @@ static inline int clist_empty(clist *l) #define CLIST_WALK(n,list) for(n=(void*)(list).head.next; (cnode*)(n) != &(list).head; n=(void*)((cnode*)(n))->next) #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) +#define CLIST_FOR_EACH(type,n,list) for(type n=(void*)(list).head.next; (cnode*)(n) != &(list).head; n=(void*)((cnode*)(n))->next) +#define CLIST_FOR_EACH_DELSAFE(type,n,list,tmp) for(type n=(void*)(list).head.next; tmp=(void*)((cnode*)(n))->next, (cnode*)(n) != &(list).head; n=(void*)tmp) + +#define CLIST_FOR_EACH_BACKWARDS(type,n,list) for(type n=(void*)(list).head.prev; (cnode*)(n) != &(list).head; n=(void*)((cnode*)(n))->prev) static inline void clist_insert_after(cnode *what, cnode *after) { @@ -88,4 +92,17 @@ static inline void clist_init(clist *l) head->next = head->prev = head; } +static inline void clist_insert_list_after(clist *what, cnode *after) +{ + if (!clist_empty(what)) + { + cnode *w = &what->head; + w->prev->next = after->next; + after->next->prev = w->prev; + w->next->prev = after; + after->next = w->next; + clist_init(what); + } +} + #endif