src/util/list.h

   1 /**************************************************************************
   2  *
   3  * Copyright 2006 VMware, Inc., Bismarck, ND. USA.
   4  * All Rights Reserved.
   5  *
   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:
  13  *
  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.
  21  *
  22  * The above copyright notice and this permission notice (including the
  23  * next paragraph) shall be included in all copies or substantial portions
  24  * of the Software.
  25  *
  26  **************************************************************************/
  27
  28 /**
  29  * \file
  30  * List macros heavily inspired by the Linux kernel
  31  * list handling. No list looping yet.
  32  *
  33  * Is not threadsafe, so common operations need to
  34  * be protected using an external mutex.
  35  */
  36
  37 #ifndef _UTIL_LIST_H_
  38 #define _UTIL_LIST_H_
  39
  40
  41 #include <stdbool.h>
  42 #include <stddef.h>
  43 #include <assert.h>
  44
  45
  46 struct list_head
  47 {
  48     struct list_head *prev;
  49     struct list_head *next;
  50 };
  51
  52 static inline void list_inithead(struct list_head *item)
  53 {
  54     item->prev = item;
  55     item->next = item;
  56 }
  57
  58 static inline void list_add(struct list_head *item, struct list_head *list)
  59 {
  60     item->prev = list;
  61     item->next = list->next;
  62     list->next->prev = item;
  63     list->next = item;
  64 }
  65
  66 static inline void list_addtail(struct list_head *item, struct list_head *list)
  67 {
  68     item->next = list;
  69     item->prev = list->prev;
  70     list->prev->next = item;
  71     list->prev = item;
  72 }
  73
  74 static inline void list_replace(struct list_head *from, struct list_head *to)
  75 {
  76     to->prev = from->prev;
  77     to->next = from->next;
  78     from->next->prev = to;
  79     from->prev->next = to;
  80 }
  81
  82 static inline void list_del(struct list_head *item)
  83 {
  84     item->prev->next = item->next;
  85     item->next->prev = item->prev;
  86     item->prev = item->next = NULL;
  87 }
  88
  89 static inline void list_delinit(struct list_head *item)
  90 {
  91     item->prev->next = item->next;
  92     item->next->prev = item->prev;
  93     item->next = item;
  94     item->prev = item;
  95 }
  96
  97 static inline bool list_empty(struct list_head *list)
  98 {
  99    return list->next == list;
 100 }
 101
 102 static inline unsigned list_length(struct list_head *list)
 103 {
 104    struct list_head *node;
 105    unsigned length = 0;
 106    for (node = list->next; node != list; node = node->next)
 107       length++;
 108    return length;
 109 }
 110
 111 static inline void list_splice(struct list_head *src, struct list_head *dst)
 112 {
 113    if (list_empty(src))
 114       return;
 115
 116    src->next->prev = dst;
 117    src->prev->next = dst->next;
 118    dst->next->prev = src->prev;
 119    dst->next = src->next;
 120 }
 121
 122 static inline void list_splicetail(struct list_head *src, struct list_head *dst)
 123 {
 124    if (list_empty(src))
 125       return;
 126
 127    src->prev->next = dst;
 128    src->next->prev = dst->prev;
 129    dst->prev->next = src->next;
 130    dst->prev = src->prev;
 131 }
 132
 133 static inline void list_validate(struct list_head *list)
 134 {
 135    struct list_head *node;
 136    assert(list->next->prev == list && list->prev->next == list);
 137    for (node = list->next; node != list; node = node->next)
 138       assert(node->next->prev == node && node->prev->next == node);
 139 }
 140
 141 #define LIST_INITHEAD(__item) list_inithead(__item)
 142 #define LIST_ADD(__item, __list) list_add(__item, __list)
 143 #define LIST_ADDTAIL(__item, __list) list_addtail(__item, __list)
 144 #define LIST_REPLACE(__from, __to) list_replace(__from, __to)
 145 #define LIST_DEL(__item) list_del(__item)
 146 #define LIST_DELINIT(__item) list_delinit(__item)
 147
 148 #define LIST_ENTRY(__type, __item, __field)   \
 149     ((__type *)(((char *)(__item)) - offsetof(__type, __field)))
 150
 151 #define LIST_IS_EMPTY(__list)                   \
 152     ((__list)->next == (__list))
 153
 154 /**
 155  * Cast from a pointer to a member of a struct back to the containing struct.
 156  *
 157  * 'sample' MUST be initialized, or else the result is undefined!
 158  */
 159 #ifndef container_of
 160 #define container_of(ptr, sample, member)                               \
 161     (void *)((char *)(ptr)                                              \
 162              - ((char *)&(sample)->member - (char *)(sample)))
 163 #endif
 164
 165 #define list_first_entry(ptr, type, member) \
 166         LIST_ENTRY(type, (ptr)->next, member)
 167
 168 #define list_last_entry(ptr, type, member) \
 169         LIST_ENTRY(type, (ptr)->prev, member)
 170
 171
 172 #define LIST_FOR_EACH_ENTRY(pos, head, member)                          \
 173    for (pos = NULL, pos = container_of((head)->next, pos, member);      \
 174         &pos->member != (head);                                         \
 175         pos = container_of(pos->member.next, pos, member))
 176
 177 #define LIST_FOR_EACH_ENTRY_SAFE(pos, storage, head, member)    \
 178    for (pos = NULL, pos = container_of((head)->next, pos, member),      \
 179         storage = container_of(pos->member.next, pos, member);  \
 180         &pos->member != (head);                                         \
 181         pos = storage, storage = container_of(storage->member.next, storage, member))
 182
 183 #define LIST_FOR_EACH_ENTRY_SAFE_REV(pos, storage, head, member)        \
 184    for (pos = NULL, pos = container_of((head)->prev, pos, member),      \
 185         storage = container_of(pos->member.prev, pos, member);          \
 186         &pos->member != (head);                                         \
 187         pos = storage, storage = container_of(storage->member.prev, storage, member))
 188
 189 #define LIST_FOR_EACH_ENTRY_FROM(pos, start, head, member)              \
 190    for (pos = NULL, pos = container_of((start), pos, member);           \
 191         &pos->member != (head);                                         \
 192         pos = container_of(pos->member.next, pos, member))
 193
 194 #define LIST_FOR_EACH_ENTRY_FROM_REV(pos, start, head, member)          \
 195    for (pos = NULL, pos = container_of((start), pos, member);           \
 196         &pos->member != (head);                                         \
 197         pos = container_of(pos->member.prev, pos, member))
 198
 199 #define list_for_each_entry(type, pos, head, member)                    \
 200    for (type *pos = LIST_ENTRY(type, (head)->next, member);             \
 201         &pos->member != (head);                                         \
 202         pos = LIST_ENTRY(type, pos->member.next, member))
 203
 204 #define list_for_each_entry_safe(type, pos, head, member)               \
 205    for (type *pos = LIST_ENTRY(type, (head)->next, member),             \
 206              *__next = LIST_ENTRY(type, pos->member.next, member);      \
 207         &pos->member != (head);                                         \
 208         pos = __next,                                                   \
 209         __next = LIST_ENTRY(type, __next->member.next, member))
 210
 211 #define list_for_each_entry_rev(type, pos, head, member)                \
 212    for (type *pos = LIST_ENTRY(type, (head)->prev, member);             \
 213         &pos->member != (head);                                         \
 214         pos = LIST_ENTRY(type, pos->member.prev, member))
 215
 216 #define list_for_each_entry_safe_rev(type, pos, head, member)           \
 217    for (type *pos = LIST_ENTRY(type, (head)->prev, member),             \
 218              *__prev = LIST_ENTRY(type, pos->member.prev, member);      \
 219         &pos->member != (head);                                         \
 220         pos = __prev,                                                   \
 221         __prev = LIST_ENTRY(type, __prev->member.prev, member))
 222
 223 #define list_for_each_entry_from(type, pos, start, head, member)        \
 224    for (type *pos = LIST_ENTRY(type, (start), member);                  \
 225         &pos->member != (head);                                         \
 226         pos = LIST_ENTRY(type, pos->member.next, member))
 227
 228 #define list_for_each_entry_from_rev(type, pos, start, head, member)    \
 229    for (type *pos = LIST_ENTRY(type, (start), member);                  \
 230         &pos->member != (head);                                         \
 231         pos = LIST_ENTRY(type, pos->member.prev, member))
 232
 233 #endif /*_UTIL_LIST_H_*/