|
| 1 | +#pragma once |
| 2 | + |
| 3 | +#include <stddef.h> |
| 4 | + |
| 5 | +#define container_of(ptr, type, member) \ |
| 6 | + ((type *) ((void *) ptr - offsetof(type, member))) |
| 7 | + |
| 8 | +#define list_entry(ptr, type, member) container_of(ptr, type, member) |
| 9 | + |
| 10 | +#define list_first_entry(ptr, type, member) \ |
| 11 | + list_entry((ptr)->next, type, member) |
| 12 | + |
| 13 | +#define list_prev_entry(pos, member) \ |
| 14 | + list_entry((pos)->member.prev, typeof(*(pos)), member) |
| 15 | + |
| 16 | +#define list_next_entry(pos, member) \ |
| 17 | + list_entry((pos)->member.next, typeof(*(pos)), member) |
| 18 | + |
| 19 | +#define list_entry_is_head(pos, head, member) (&pos->member == (head)) |
| 20 | + |
| 21 | +#define list_for_each(pos, head) \ |
| 22 | + for ((pos) = (head)->next; (pos) != (head); (pos) = (pos)->next) |
| 23 | + |
| 24 | +#define list_for_each_safe(pos, _next, head) \ |
| 25 | + for (pos = (head)->next, _next = (pos)->next; (pos) != (head); \ |
| 26 | + (pos) = _next, _next = (pos)->next) |
| 27 | + |
| 28 | +#define list_for_each_entry(pos, head, member) \ |
| 29 | + for (pos = list_first_entry(head, __typeof__(*pos), member); \ |
| 30 | + &pos->member != (head); pos = list_next_entry(pos, member)) |
| 31 | + |
| 32 | +#define LIST_HEAD_INIT(name) \ |
| 33 | + { \ |
| 34 | + .prev = (&name), .next = (&name) \ |
| 35 | + } |
| 36 | + |
| 37 | +#define LIST_HEAD(name) struct list_head name = LIST_HEAD_INIT(name) |
| 38 | + |
| 39 | +struct list_head { |
| 40 | + struct list_head *next, *prev; |
| 41 | +}; |
| 42 | + |
| 43 | +static inline void INIT_LIST_HEAD(struct list_head *list) |
| 44 | +{ |
| 45 | + list->prev = list; |
| 46 | + list->next = list; |
| 47 | +} |
| 48 | + |
| 49 | +static inline int list_empty(const struct list_head *head) |
| 50 | +{ |
| 51 | + return head->next == head; |
| 52 | +} |
| 53 | + |
| 54 | +static int list_is_last(const struct list_head *list, |
| 55 | + const struct list_head *head) |
| 56 | +{ |
| 57 | + return list->next == head; |
| 58 | +} |
| 59 | + |
| 60 | +static inline void list_add(struct list_head *new, struct list_head *list) |
| 61 | +{ |
| 62 | + new->prev = list->prev; |
| 63 | + new->next = list; |
| 64 | + list->prev->next = new; |
| 65 | + list->prev = new; |
| 66 | +} |
| 67 | + |
| 68 | +static inline void list_del(struct list_head *list) |
| 69 | +{ |
| 70 | + list->next->prev = list->prev; |
| 71 | + list->prev->next = list->next; |
| 72 | +} |
| 73 | + |
| 74 | +static void list_del_init(struct list_head *entry) |
| 75 | +{ |
| 76 | + list_del(entry); |
| 77 | + INIT_LIST_HEAD(entry); |
| 78 | +} |
| 79 | + |
| 80 | +static inline void list_move(struct list_head *list, struct list_head *new_head) |
| 81 | +{ |
| 82 | + list_del(list); |
| 83 | + list_add(new_head, list); |
| 84 | +} |
0 commit comments