3 * Copyright 2006 Tungsten Graphics, Inc., Bismarck, ND. USA.
6 * Permission is hereby granted, free of charge, to any person obtaining a
7 * copy of this software and associated documentation files (the
8 * "Software"), to deal in the Software without restriction, including
9 * without limitation the rights to use, copy, modify, merge, publish,
10 * distribute, sub license, and/or sell copies of the Software, and to
11 * permit persons to whom the Software is furnished to do so, subject to
12 * the following conditions:
14 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
15 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
16 * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
17 * THE COPYRIGHT HOLDERS, AUTHORS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM,
18 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
19 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
20 * USE OR OTHER DEALINGS IN THE SOFTWARE.
22 * The above copyright notice and this permission notice (including the
23 * next paragraph) shall be included in all copies or substantial portions
30 * List macros heavily inspired by the Linux kernel
31 * list handling. No list looping yet.
33 * Is not threadsafe, so common operations need to
34 * be protected using an external mutex.
36 #ifndef _U_DOUBLE_LIST_H_
37 #define _U_DOUBLE_LIST_H_
41 static void list_inithead(struct list_head *item)
47 static inline void list_add(struct list_head *item, struct list_head *list)
50 item->next = list->next;
51 list->next->prev = item;
55 static inline void list_addtail(struct list_head *item, struct list_head *list)
58 item->prev = list->prev;
59 list->prev->next = item;
63 static inline void list_replace(struct list_head *from, struct list_head *to)
65 to->prev = from->prev;
66 to->next = from->next;
67 from->next->prev = to;
68 from->prev->next = to;
71 static inline void list_del(struct list_head *item)
73 item->prev->next = item->next;
74 item->next->prev = item->prev;
77 static inline void list_delinit(struct list_head *item)
79 item->prev->next = item->next;
80 item->next->prev = item->prev;
85 #define LIST_INITHEAD(__item) list_inithead(__item)
86 #define LIST_ADD(__item, __list) list_add(__item, __list)
87 #define LIST_ADDTAIL(__item, __list) list_addtail(__item, __list)
88 #define LIST_REPLACE(__from, __to) list_replace(__from, __to)
89 #define LIST_DEL(__item) list_del(__item)
90 #define LIST_DELINIT(__item) list_delinit(__item)
92 #define LIST_ENTRY(__type, __item, __field) \
93 ((__type *)(((char *)(__item)) - offsetof(__type, __field)))
95 #define LIST_IS_EMPTY(__list) \
96 ((__list)->next == (__list))
99 #define container_of(ptr, sample, member) \
100 (void *)((char *)(ptr) \
101 - ((char *)&(sample)->member - (char *)(sample)))
104 #define LIST_FOR_EACH_ENTRY(pos, head, member) \
105 for (pos = container_of((head)->next, pos, member); \
106 &pos->member != (head); \
107 pos = container_of(pos->member.next, pos, member))
109 #define LIST_FOR_EACH_ENTRY_SAFE(pos, storage, head, member) \
110 for (pos = container_of((head)->next, pos, member), \
111 storage = container_of(pos->member.next, pos, member); \
112 &pos->member != (head); \
113 pos = storage, storage = container_of(storage->member.next, storage, member))
115 #define LIST_FOR_EACH_ENTRY_SAFE_REV(pos, storage, head, member) \
116 for (pos = container_of((head)->prev, pos, member), \
117 storage = container_of(pos->member.prev, pos, member); \
118 &pos->member != (head); \
119 pos = storage, storage = container_of(storage->member.prev, storage, member))
121 #define LIST_FOR_EACH_ENTRY_FROM(pos, start, head, member) \
122 for (pos = container_of((start), pos, member); \
123 &pos->member != (head); \
124 pos = container_of(pos->member.next, pos, member))
126 #define LIST_FOR_EACH_ENTRY_FROM_REV(pos, start, head, member) \
127 for (pos = container_of((start), pos, member); \
128 &pos->member != (head); \
129 pos = container_of(pos->member.prev, pos, member))
131 #endif /*_U_DOUBLE_LIST_H_*/