00001 #ifndef _LINUX_LIST_H
00002 #define _LINUX_LIST_H
00003
00004 #undef offsetof
00005 #define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER)
00006
00015 #define container_of(ptr, type, member) ({ \
00016 const typeof( ((type *)0)->member ) *_mptr = (ptr); \
00017 (type *)( (char *)_mptr - offsetof(type,member) );})
00018
00019
00020
00021
00022
00023
00024
00025
00026
00027
00028
00029 struct list_head {
00030 struct list_head *next, *prev;
00031 };
00032
00033 #define LIST_HEAD_INIT(name) { &(name), &(name) }
00034
00035 #define LIST_HEAD(name) \
00036 struct list_head name = LIST_HEAD_INIT(name)
00037
00038 #define INIT_LIST_HEAD(ptr) do { \
00039 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
00040 } while (0)
00041
00042
00043
00044
00045
00046
00047
00048 static inline void _list_add(struct list_head *new,
00049 struct list_head *prev,
00050 struct list_head *next)
00051 {
00052 next->prev = new;
00053 new->next = next;
00054 new->prev = prev;
00055 prev->next = new;
00056 }
00057
00066 static inline void list_add(struct list_head *new, struct list_head *head)
00067 {
00068 _list_add(new, head, head->next);
00069 }
00070
00079 static inline void list_add_tail(struct list_head *new, struct list_head *head)
00080 {
00081 _list_add(new, head->prev, head);
00082 }
00083
00084
00085
00086
00087
00088
00089
00090
00091 static inline void list_del_internal(struct list_head * prev, struct list_head * next)
00092 {
00093 next->prev = prev;
00094 prev->next = next;
00095 }
00096
00103 static inline void list_del(struct list_head *entry)
00104 {
00105 list_del_internal(entry->prev, entry->next);
00106 INIT_LIST_HEAD(entry);
00107 }
00108
00114 static inline void list_move(struct list_head *list, struct list_head *head)
00115 {
00116 list_del_internal(list->prev, list->next);
00117 list_add(list, head);
00118 }
00119
00125 static inline void list_move_tail(struct list_head *list,
00126 struct list_head *head)
00127 {
00128 list_del_internal(list->prev, list->next);
00129 list_add_tail(list, head);
00130 }
00131
00136 static inline int list_empty(const struct list_head *head)
00137 {
00138 return head->next == head;
00139 }
00140
00146 static inline void list_splice(struct list_head *list, struct list_head *head)
00147 {
00148 if (!list_empty(list)) {
00149 struct list_head *first = list->next;
00150 struct list_head *last = list->prev;
00151 struct list_head *at = head->next;
00152
00153 first->prev = head;
00154 head->next = first;
00155
00156 last->next = at;
00157 at->prev = last;
00158
00159 INIT_LIST_HEAD(list);
00160 }
00161 }
00162
00169 #define list_entry(ptr, type, member) \
00170 container_of(ptr, type, member)
00171
00182 #define list_for_each(pos, head) \
00183 for (pos = (head)->next; pos != (head); pos = pos->next)
00184
00190 #define list_for_each_prev(pos, head) \
00191 for (pos = (head)->prev; pos != (head); \
00192 pos = pos->prev)
00193
00200 #define list_for_each_safe(pos, n, head) \
00201 for (pos = (head)->next, n = pos->next; pos != (head); \
00202 pos = n, n = pos->next)
00203
00210 #define list_for_each_entry(pos, head, member) \
00211 for (pos = list_entry((head)->next, typeof(*pos), member); \
00212 &pos->member != (head); \
00213 pos = list_entry(pos->member.next, typeof(*pos), member))
00214
00221 #define list_for_each_entry_reverse(pos, head, member) \
00222 for (pos = list_entry((head)->prev, typeof(*pos), member); \
00223 &pos->member != (head); \
00224 pos = list_entry(pos->member.prev, typeof(*pos), member))
00225
00233 #define list_for_each_entry_continue(pos, head, member) \
00234 for (pos = list_entry(pos->member.next, typeof(*pos), member); \
00235 &pos->member != (head); \
00236 pos = list_entry(pos->member.next, typeof(*pos), member)) \
00237
00238
00245 #define list_for_each_entry_safe(pos, n, head, member) \
00246 for (pos = list_entry((head)->next, typeof(*pos), member), \
00247 n = list_entry(pos->member.next, typeof(*pos), member); \
00248 &pos->member != (head); \
00249 pos = n, n = list_entry(n->member.next, typeof(*n), member))
00250
00251
00252
00253
00254
00255
00256
00257
00258 struct hlist_head {
00259 struct hlist_node *first;
00260 };
00261
00262 struct hlist_node {
00263 struct hlist_node *next, **pprev;
00264 };
00265
00266 #define HLIST_HEAD_INIT { .first = NULL }
00267 #define HLIST_HEAD(name) struct hlist_head name = { .first = NULL }
00268 #define INIT_HLIST_HEAD(ptr) ((ptr)->first = NULL)
00269 #define INIT_HLIST_NODE(ptr) ((ptr)->next = NULL, (ptr)->pprev = NULL)
00270
00271 static __inline__ int hlist_unhashed(const struct hlist_node *h)
00272 {
00273 return !h->pprev;
00274 }
00275
00276 static __inline__ int hlist_empty(const struct hlist_head *h)
00277 {
00278 return !h->first;
00279 }
00280
00281 static __inline__ void hlist_del(struct hlist_node *n)
00282 {
00283 struct hlist_node *next = n->next;
00284 struct hlist_node **pprev = n->pprev;
00285 *pprev = next;
00286 if (next)
00287 next->pprev = pprev;
00288 INIT_HLIST_NODE(n);
00289 }
00290
00291 static __inline__ void hlist_add_head(struct hlist_node *n, struct hlist_head *h)
00292 {
00293 struct hlist_node *first = h->first;
00294 n->next = first;
00295 if (first)
00296 first->pprev = &n->next;
00297 h->first = n;
00298 n->pprev = &h->first;
00299 }
00300
00301
00302 static __inline__ void hlist_add_before(struct hlist_node *n, struct hlist_node *next)
00303 {
00304 n->pprev = next->pprev;
00305 n->next = next;
00306 next->pprev = &n->next;
00307 *(n->pprev) = n;
00308 }
00309
00310 static __inline__ void hlist_add_after(struct hlist_node *n,
00311 struct hlist_node *next)
00312 {
00313 next->next = n->next;
00314 *(next->pprev) = n;
00315 n->next = next;
00316 }
00317
00318 #define hlist_entry(ptr, type, member) container_of(ptr,type,member)
00319
00320 #define hlist_for_each(pos, head) \
00321 for (pos = (head)->first; pos; \
00322 pos = pos->next)
00323
00324 #define hlist_for_each_safe(pos, n, head) \
00325 for (pos = (head)->first; n = pos ? pos->next : 0, pos; \
00326 pos = n)
00327
00334 #define hlist_for_each_entry(pos, head, member) \
00335 for (pos = hlist_entry((head)->first, typeof(*pos), member); \
00336 &pos->member != NULL; \
00337 pos = hlist_entry(pos->member.next, typeof(*pos), member))
00338
00345 #define hlist_for_each_entry_continue(tpos, pos, member) \
00346 for (pos = (pos)->next; \
00347 pos && \
00348 ({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \
00349 pos = pos->next)
00350
00357 #define hlist_for_each_entry_from(tpos, pos, member) \
00358 for (; pos && \
00359 ({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \
00360 pos = pos->next)
00361
00370 #define hlist_for_each_entry_safe(tpos, pos, n, head, member) \
00371 for (pos = (head)->first; \
00372 pos && ({ n = pos->next; 1; }) && \
00373 ({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \
00374 pos = n)
00375
00376 #endif