1 /* Licensed under BSD-MIT - see LICENSE file for details */
6 #include <ccan/container_of/container_of.h>
7 #include <ccan/check_type/check_type.h>
10 * struct list_node - an entry in a doubly-linked list
11 * @next: next entry (self if empty)
12 * @prev: previous entry (self if empty)
14 * This is used as an entry in a linked list.
18 * // Linked list of all us children.
19 * struct list_node list;
24 struct list_node *next, *prev;
28 * struct list_head - the head of a doubly-linked list
29 * @h: the list_head (containing next and prev pointers)
31 * This is used as the head of a linked list.
35 * struct list_head children;
36 * unsigned int num_children;
45 * list_check - check head of a list for consistency
47 * @abortstr: the location to print on aborting, or NULL.
49 * Because list_nodes have redundant information, consistency checking between
50 * the back and forward links can be done. This is useful as a debugging check.
51 * If @abortstr is non-NULL, that will be printed in a diagnostic if the list
52 * is inconsistent, and the function will abort.
54 * Returns the list head if the list is consistent, NULL if not (it
55 * can never return NULL if @abortstr is set).
57 * See also: list_check_node()
60 * static void dump_parent(struct parent *p)
64 * printf("%s (%u children):\n", p->name, p->num_children);
65 * list_check(&p->children, "bad child list");
66 * list_for_each(&p->children, c, list)
67 * printf(" -> %s\n", c->name);
70 struct list_head *list_check(const struct list_head *h, const char *abortstr);
73 * list_check_node - check node of a list for consistency
75 * @abortstr: the location to print on aborting, or NULL.
77 * Check consistency of the list node is in (it must be in one).
79 * See also: list_check()
82 * static void dump_child(const struct child *c)
84 * list_check_node(&c->list, "bad child list");
85 * printf("%s\n", c->name);
88 struct list_node *list_check_node(const struct list_node *n,
89 const char *abortstr);
91 #ifdef CCAN_LIST_DEBUG
92 #define list_debug(h) list_check((h), __func__)
93 #define list_debug_node(n) list_check_node((n), __func__)
95 #define list_debug(h) (h)
96 #define list_debug_node(n) (n)
100 * LIST_HEAD_INIT - initializer for an empty list_head
101 * @name: the name of the list.
103 * Explicit initializer for an empty list.
106 * LIST_HEAD, list_head_init()
109 * static struct list_head my_list = LIST_HEAD_INIT(my_list);
111 #define LIST_HEAD_INIT(name) { { &name.n, &name.n } }
114 * LIST_HEAD - define and initialize an empty list_head
115 * @name: the name of the list.
117 * The LIST_HEAD macro defines a list_head and initializes it to an empty
118 * list. It can be prepended by "static" to define a static list_head.
121 * LIST_HEAD_INIT, list_head_init()
124 * static LIST_HEAD(my_global_list);
126 #define LIST_HEAD(name) \
127 struct list_head name = LIST_HEAD_INIT(name)
130 * list_head_init - initialize a list_head
131 * @h: the list_head to set to the empty list
135 * struct parent *parent = malloc(sizeof(*parent));
137 * list_head_init(&parent->children);
138 * parent->num_children = 0;
140 static inline void list_head_init(struct list_head *h)
142 h->n.next = h->n.prev = &h->n;
146 * list_add - add an entry at the start of a linked list.
147 * @h: the list_head to add the node to
148 * @n: the list_node to add to the list.
150 * The list_node does not need to be initialized; it will be overwritten.
152 * struct child *child = malloc(sizeof(*child));
154 * child->name = "marvin";
155 * list_add(&parent->children, &child->list);
156 * parent->num_children++;
158 static inline void list_add(struct list_head *h, struct list_node *n)
168 * list_add_tail - add an entry at the end of a linked list.
169 * @h: the list_head to add the node to
170 * @n: the list_node to add to the list.
172 * The list_node does not need to be initialized; it will be overwritten.
174 * list_add_tail(&parent->children, &child->list);
175 * parent->num_children++;
177 static inline void list_add_tail(struct list_head *h, struct list_node *n)
187 * list_empty - is a list empty?
190 * If the list is empty, returns true.
193 * assert(list_empty(&parent->children) == (parent->num_children == 0));
195 static inline bool list_empty(const struct list_head *h)
198 return h->n.next == &h->n;
202 * list_del - delete an entry from an (unknown) linked list.
203 * @n: the list_node to delete from the list.
205 * Note that this leaves @n in an undefined state; it can be added to
206 * another list, but not deleted again.
212 * list_del(&child->list);
213 * parent->num_children--;
215 static inline void list_del(struct list_node *n)
217 (void)list_debug_node(n);
218 n->next->prev = n->prev;
219 n->prev->next = n->next;
220 #ifdef CCAN_LIST_DEBUG
221 /* Catch use-after-del. */
222 n->next = n->prev = NULL;
227 * list_del_from - delete an entry from a known linked list.
228 * @h: the list_head the node is in.
229 * @n: the list_node to delete from the list.
231 * This explicitly indicates which list a node is expected to be in,
232 * which is better documentation and can catch more bugs.
234 * See also: list_del()
237 * list_del_from(&parent->children, &child->list);
238 * parent->num_children--;
240 static inline void list_del_from(struct list_head *h, struct list_node *n)
242 #ifdef CCAN_LIST_DEBUG
244 /* Thorough check: make sure it was in list! */
246 for (i = h->n.next; i != n; i = i->next)
249 #endif /* CCAN_LIST_DEBUG */
251 /* Quick test that catches a surprising number of bugs. */
252 assert(!list_empty(h));
257 * list_entry - convert a list_node back into the structure containing it.
259 * @type: the type of the entry
260 * @member: the list_node member of the type
263 * // First list entry is children.next; convert back to child.
264 * child = list_entry(parent->children.n.next, struct child, list);
267 * list_top(), list_for_each()
269 #define list_entry(n, type, member) container_of(n, type, member)
272 * list_top - get the first entry in a list
274 * @type: the type of the entry
275 * @member: the list_node member of the type
277 * If the list is empty, returns NULL.
280 * struct child *first;
281 * first = list_top(&parent->children, struct child, list);
283 * printf("Empty list!\n");
285 #define list_top(h, type, member) \
286 ((type *)list_top_((h), list_off_(type, member)))
288 static inline const void *list_top_(const struct list_head *h, size_t off)
292 return (const char *)h->n.next - off;
296 * list_pop - remove the first entry in a list
298 * @type: the type of the entry
299 * @member: the list_node member of the type
301 * If the list is empty, returns NULL.
305 * one = list_pop(&parent->children, struct child, list);
307 * printf("Empty list!\n");
309 #define list_pop(h, type, member) \
310 ((type *)list_pop_((h), list_off_(type, member)))
312 static inline const void *list_pop_(const struct list_head *h, size_t off)
320 return (const char *)n - off;
324 * list_tail - get the last entry in a list
326 * @type: the type of the entry
327 * @member: the list_node member of the type
329 * If the list is empty, returns NULL.
332 * struct child *last;
333 * last = list_tail(&parent->children, struct child, list);
335 * printf("Empty list!\n");
337 #define list_tail(h, type, member) \
338 ((type *)list_tail_((h), list_off_(type, member)))
340 static inline const void *list_tail_(const struct list_head *h, size_t off)
344 return (const char *)h->n.prev - off;
348 * list_for_each - iterate through a list.
349 * @h: the list_head (warning: evaluated multiple times!)
350 * @i: the structure containing the list_node
351 * @member: the list_node member of the structure
353 * This is a convenient wrapper to iterate @i over the entire list. It's
354 * a for loop, so you can break and continue as normal.
357 * list_for_each(&parent->children, child, list)
358 * printf("Name: %s\n", child->name);
360 #define list_for_each(h, i, member) \
361 list_for_each_off(h, i, list_off_var_(i, member))
364 * list_for_each_rev - iterate through a list backwards.
366 * @i: the structure containing the list_node
367 * @member: the list_node member of the structure
369 * This is a convenient wrapper to iterate @i over the entire list. It's
370 * a for loop, so you can break and continue as normal.
373 * list_for_each_rev(&parent->children, child, list)
374 * printf("Name: %s\n", child->name);
376 #define list_for_each_rev(h, i, member) \
377 for (i = container_of_var(list_debug(h)->n.prev, i, member); \
378 &i->member != &(h)->n; \
379 i = container_of_var(i->member.prev, i, member))
382 * list_for_each_safe - iterate through a list, maybe during deletion
384 * @i: the structure containing the list_node
385 * @nxt: the structure containing the list_node
386 * @member: the list_node member of the structure
388 * This is a convenient wrapper to iterate @i over the entire list. It's
389 * a for loop, so you can break and continue as normal. The extra variable
390 * @nxt is used to hold the next element, so you can delete @i from the list.
393 * struct child *next;
394 * list_for_each_safe(&parent->children, child, next, list) {
395 * list_del(&child->list);
396 * parent->num_children--;
399 #define list_for_each_safe(h, i, nxt, member) \
400 list_for_each_safe_off(h, i, nxt, list_off_var_(i, member))
403 * list_next - get the next entry in a list
405 * @i: a pointer to an entry in the list.
406 * @member: the list_node member of the structure
408 * If @i was the last entry in the list, returns NULL.
411 * struct child *second;
412 * second = list_next(&parent->children, first, list);
414 * printf("No second child!\n");
416 #define list_next(h, i, member) \
417 ((list_typeof(i))list_entry_or_null(list_debug(h), \
419 list_off_var_((i), member)))
422 * list_prev - get the previous entry in a list
424 * @i: a pointer to an entry in the list.
425 * @member: the list_node member of the structure
427 * If @i was the first entry in the list, returns NULL.
430 * first = list_prev(&parent->children, second, list);
432 * printf("Can't go back to first child?!\n");
434 #define list_prev(h, i, member) \
435 ((list_typeof(i))list_entry_or_null(list_debug(h), \
437 list_off_var_((i), member)))
440 * list_append_list - empty one list onto the end of another.
441 * @to: the list to append into
442 * @from: the list to empty.
444 * This takes the entire contents of @from and moves it to the end of
445 * @to. After this @from will be empty.
448 * struct list_head adopter;
450 * list_append_list(&adopter, &parent->children);
451 * assert(list_empty(&parent->children));
452 * parent->num_children = 0;
454 static inline void list_append_list(struct list_head *to,
455 struct list_head *from)
457 struct list_node *from_tail = list_debug(from)->n.prev;
458 struct list_node *to_tail = list_debug(to)->n.prev;
460 /* Sew in head and entire list. */
461 to->n.prev = from_tail;
462 from_tail->next = &to->n;
463 to_tail->next = &from->n;
464 from->n.prev = to_tail;
466 /* Now remove head. */
468 list_head_init(from);
472 * list_prepend_list - empty one list into the start of another.
473 * @to: the list to prepend into
474 * @from: the list to empty.
476 * This takes the entire contents of @from and moves it to the start
477 * of @to. After this @from will be empty.
480 * list_prepend_list(&adopter, &parent->children);
481 * assert(list_empty(&parent->children));
482 * parent->num_children = 0;
484 static inline void list_prepend_list(struct list_head *to,
485 struct list_head *from)
487 struct list_node *from_tail = list_debug(from)->n.prev;
488 struct list_node *to_head = list_debug(to)->n.next;
490 /* Sew in head and entire list. */
491 to->n.next = &from->n;
492 from->n.prev = &to->n;
493 to_head->prev = from_tail;
494 from_tail->next = to_head;
496 /* Now remove head. */
498 list_head_init(from);
502 * list_for_each_off - iterate through a list of memory regions.
504 * @i: the pointer to a memory region wich contains list node data.
505 * @off: offset(relative to @i) at which list node data resides.
507 * This is a low-level wrapper to iterate @i over the entire list, used to
508 * implement all oher, more high-level, for-each constructs. It's a for loop,
509 * so you can break and continue as normal.
511 * WARNING! Being the low-level macro that it is, this wrapper doesn't know
512 * nor care about the type of @i. The only assumtion made is that @i points
513 * to a chunk of memory that at some @offset, relative to @i, contains a
514 * properly filled `struct node_list' which in turn contains pointers to
515 * memory chunks and it's turtles all the way down. Whith all that in mind
516 * remember that given the wrong pointer/offset couple this macro will
517 * happilly churn all you memory untill SEGFAULT stops it, in other words
520 * It is worth mentioning that one of legitimate use-cases for that wrapper
521 * is operation on opaque types with known offset for `struct list_node'
522 * member(preferably 0), because it allows you not to disclose the type of
526 * list_for_each_off(&parent->children, child,
527 * offsetof(struct child, list))
528 * printf("Name: %s\n", child->name);
530 #define list_for_each_off(h, i, off) \
531 for (i = list_node_to_off_(list_debug(h)->n.next, (off)); \
532 list_node_from_off_((void *)i, (off)) != &(h)->n; \
533 i = list_node_to_off_(list_node_from_off_((void *)i, (off))->next, \
537 * list_for_each_safe_off - iterate through a list of memory regions, maybe
540 * @i: the pointer to a memory region wich contains list node data.
541 * @nxt: the structure containing the list_node
542 * @off: offset(relative to @i) at which list node data resides.
544 * For details see `list_for_each_off' and `list_for_each_safe'
548 * list_for_each_safe_off(&parent->children, child,
549 * next, offsetof(struct child, list))
550 * printf("Name: %s\n", child->name);
552 #define list_for_each_safe_off(h, i, nxt, off) \
553 for (i = list_node_to_off_(list_debug(h)->n.next, (off)), \
554 nxt = list_node_to_off_(list_node_from_off_(i, (off))->next, \
556 list_node_from_off_(i, (off)) != &(h)->n; \
558 nxt = list_node_to_off_(list_node_from_off_(i, (off))->next, \
562 /* Other -off variants. */
563 #define list_entry_off(n, type, off) \
564 ((type *)list_node_from_off_((n), (off)))
566 #define list_head_off(h, type, off) \
567 ((type *)list_head_off((h), (off)))
569 #define list_tail_off(h, type, off) \
570 ((type *)list_tail_((h), (off)))
572 #define list_add_off(h, n, off) \
573 list_add((h), list_node_from_off_((n), (off)))
575 #define list_del_off(n, off) \
576 list_del(list_node_from_off_((n), (off)))
578 #define list_del_from_off(h, n, off) \
579 list_del_from(h, list_node_from_off_((n), (off)))
581 /* Offset helper functions so we only single-evaluate. */
582 static inline void *list_node_to_off_(struct list_node *node, size_t off)
584 return (void *)((char *)node - off);
586 static inline struct list_node *list_node_from_off_(void *ptr, size_t off)
588 return (struct list_node *)((char *)ptr + off);
591 /* Get the offset of the member, but make sure it's a list_node. */
592 #define list_off_(type, member) \
593 (container_off(type, member) + \
594 check_type(((type *)0)->member, struct list_node))
596 #define list_off_var_(var, member) \
597 (container_off_var(var, member) + \
598 check_type(var->member, struct list_node))
601 #define list_typeof(var) typeof(var)
603 #define list_typeof(var) void *
606 /* Returns member, or NULL if at end of list. */
607 static inline void *list_entry_or_null(struct list_head *h,
613 return (char *)n - off;
615 #endif /* CCAN_LIST_H */