4 * Copyright (C) 2002 Alexandre Julliard
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2.1 of the License, or (at your option) any later version.
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
21 #ifndef __WINE_SERVER_LIST_H
22 #define __WINE_SERVER_LIST_H
30 /* add element at the head of the list */
31 inline static void list_add_head( struct list
*list
, struct list
*elem
)
33 elem
->next
= list
->next
;
35 list
->next
->prev
= elem
;
39 /* add element at the tail of the list */
40 inline static void list_add_tail( struct list
*list
, struct list
*elem
)
43 elem
->prev
= list
->prev
;
44 list
->prev
->next
= elem
;
48 /* remove an element from its list */
49 inline static void list_remove( struct list
*elem
)
51 elem
->next
->prev
= elem
->prev
;
52 elem
->prev
->next
= elem
->next
;
55 /* initialize a list */
56 inline static void list_init( struct list
*list
)
58 list
->next
= list
->prev
= list
;
61 /* iterate through the list */
62 #define LIST_FOR_EACH(cursor,list) \
63 for ((cursor) = (list)->next; (cursor) != (list); (cursor) = (cursor)->next)
65 /* macros for statically initialized lists */
66 #define LIST_INIT(list) { &(list), &(list) }
68 /* get pointer to object containing list element */
69 #define LIST_ENTRY(elem, type, field) \
70 ((type *)((char *)(elem) - (unsigned int)(&((type *)0)->field)))
72 #endif /* __WINE_SERVER_LIST_H */