1e0ed7404719a9ddd2ba427a80db5365c8bad18c0JP Abgrall#if !defined(_BLKID_LIST_H) && !defined(LIST_HEAD_INIT) 2e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o#define _BLKID_LIST_H 3e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o 4e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o#ifdef __cplusplus 5e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'oextern "C" { 6e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o#endif 7e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o 8ed78c021c3b111d8ab9a51aef5d5156e3004083fTheodore Ts'o#ifdef __GNUC__ 9ed78c021c3b111d8ab9a51aef5d5156e3004083fTheodore Ts'o#define _INLINE_ static __inline__ 10ed78c021c3b111d8ab9a51aef5d5156e3004083fTheodore Ts'o#else /* For Watcom C */ 11ed78c021c3b111d8ab9a51aef5d5156e3004083fTheodore Ts'o#define _INLINE_ static inline 12ed78c021c3b111d8ab9a51aef5d5156e3004083fTheodore Ts'o#endif 13ed78c021c3b111d8ab9a51aef5d5156e3004083fTheodore Ts'o 14e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o/* 15e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * Simple doubly linked list implementation. 16e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * 17e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * Some of the internal functions ("__xxx") are useful when 18e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * manipulating whole lists rather than single entries, as 19e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * sometimes we already know the next/prev entries and we can 20e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * generate better code by using them directly rather than 21e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * using the generic single-entry routines. 22e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o */ 23e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o 24e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'ostruct list_head { 25e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o struct list_head *next, *prev; 26e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o}; 27e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o 28e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o#define LIST_HEAD_INIT(name) { &(name), &(name) } 29e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o 30e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o#define INIT_LIST_HEAD(ptr) do { \ 31e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o (ptr)->next = (ptr); (ptr)->prev = (ptr); \ 32e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o} while (0) 33e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o 34e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o/* 35e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * Insert a new entry between two known consecutive entries. 36e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * 37e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * This is only for internal list manipulation where we know 38e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * the prev/next entries already! 39e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o */ 40ed78c021c3b111d8ab9a51aef5d5156e3004083fTheodore Ts'o_INLINE_ void __list_add(struct list_head * add, 41e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o struct list_head * prev, 42e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o struct list_head * next) 43e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o{ 44e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o next->prev = add; 45e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o add->next = next; 46e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o add->prev = prev; 47e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o prev->next = add; 48e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o} 49e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o 50e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o/** 51e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * list_add - add a new entry 52e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * @add: new entry to be added 53e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * @head: list head to add it after 54e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * 55e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * Insert a new entry after the specified head. 56e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * This is good for implementing stacks. 57e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o */ 58ed78c021c3b111d8ab9a51aef5d5156e3004083fTheodore Ts'o_INLINE_ void list_add(struct list_head *add, struct list_head *head) 59e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o{ 60e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o __list_add(add, head, head->next); 61e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o} 62e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o 63e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o/** 64e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * list_add_tail - add a new entry 65e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * @add: new entry to be added 66e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * @head: list head to add it before 67e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * 68e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * Insert a new entry before the specified head. 69e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * This is useful for implementing queues. 70e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o */ 71ed78c021c3b111d8ab9a51aef5d5156e3004083fTheodore Ts'o_INLINE_ void list_add_tail(struct list_head *add, struct list_head *head) 72e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o{ 73e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o __list_add(add, head->prev, head); 74e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o} 75e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o 76e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o/* 77e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * Delete a list entry by making the prev/next entries 78e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * point to each other. 79e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * 80e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * This is only for internal list manipulation where we know 81e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * the prev/next entries already! 82e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o */ 83ed78c021c3b111d8ab9a51aef5d5156e3004083fTheodore Ts'o_INLINE_ void __list_del(struct list_head * prev, 84e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o struct list_head * next) 85e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o{ 86e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o next->prev = prev; 87e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o prev->next = next; 88e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o} 89e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o 90e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o/** 91e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * list_del - deletes entry from list. 92e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * @entry: the element to delete from the list. 93e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * 94e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * list_empty() on @entry does not return true after this, @entry is 95e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * in an undefined state. 96e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o */ 97ed78c021c3b111d8ab9a51aef5d5156e3004083fTheodore Ts'o_INLINE_ void list_del(struct list_head *entry) 98e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o{ 99e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o __list_del(entry->prev, entry->next); 100e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o} 101e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o 102e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o/** 103e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * list_del_init - deletes entry from list and reinitialize it. 104e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * @entry: the element to delete from the list. 105e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o */ 106ed78c021c3b111d8ab9a51aef5d5156e3004083fTheodore Ts'o_INLINE_ void list_del_init(struct list_head *entry) 107e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o{ 108e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o __list_del(entry->prev, entry->next); 109e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o INIT_LIST_HEAD(entry); 110e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o} 111e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o 112e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o/** 113e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * list_empty - tests whether a list is empty 114e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * @head: the list to test. 115e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o */ 116ed78c021c3b111d8ab9a51aef5d5156e3004083fTheodore Ts'o_INLINE_ int list_empty(struct list_head *head) 117e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o{ 118e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o return head->next == head; 119e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o} 120e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o 121e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o/** 122e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * list_splice - join two lists 123e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * @list: the new list to add. 124e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * @head: the place to add it in the first list. 125e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o */ 126ed78c021c3b111d8ab9a51aef5d5156e3004083fTheodore Ts'o_INLINE_ void list_splice(struct list_head *list, struct list_head *head) 127e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o{ 128e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o struct list_head *first = list->next; 129e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o 130e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o if (first != list) { 131e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o struct list_head *last = list->prev; 132e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o struct list_head *at = head->next; 133e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o 134e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o first->prev = head; 135e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o head->next = first; 136e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o 137e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o last->next = at; 138e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o at->prev = last; 139e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o } 140e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o} 141e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o 142e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o/** 143e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * list_entry - get the struct for this entry 144e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * @ptr: the &struct list_head pointer. 145e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * @type: the type of the struct this is embedded in. 146e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * @member: the name of the list_struct within the struct. 147e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o */ 148e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o#define list_entry(ptr, type, member) \ 149e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o ((type *)((char *)(ptr)-(unsigned long)(&((type *)0)->member))) 150e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o 151e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o/** 152e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * list_for_each - iterate over elements in a list 153e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * @pos: the &struct list_head to use as a loop counter. 154e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * @head: the head for your list. 155e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o */ 156e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o#define list_for_each(pos, head) \ 157e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o for (pos = (head)->next; pos != (head); pos = pos->next) 158e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o 159e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o/** 160e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * list_for_each_safe - iterate over elements in a list, but don't dereference 161e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * pos after the body is done (in case it is freed) 162e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * @pos: the &struct list_head to use as a loop counter. 163e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * @pnext: the &struct list_head to use as a pointer to the next item. 164e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o * @head: the head for your list (not included in iteration). 165e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o */ 166e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o#define list_for_each_safe(pos, pnext, head) \ 167e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o for (pos = (head)->next, pnext = pos->next; pos != (head); \ 168e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o pos = pnext, pnext = pos->next) 169e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o 170ed78c021c3b111d8ab9a51aef5d5156e3004083fTheodore Ts'o#undef _INLINE_ 171ed78c021c3b111d8ab9a51aef5d5156e3004083fTheodore Ts'o 172e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o#ifdef __cplusplus 173e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o} 174e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o#endif 175e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o 176e12f2ae74c2eb8997bf13adf8fdd7e7313971eaeTheodore Ts'o#endif /* _BLKID_LIST_H */ 177