| /* |
| * Copyright (c) 2006 Silicon Graphics, Inc. |
| * All Rights Reserved. |
| * |
| * This program is free software; you can redistribute it and/or |
| * modify it under the terms of the GNU General Public License as |
| * published by the Free Software Foundation. |
| * |
| * This program is distributed in the hope that it would be useful, |
| * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| * GNU General Public License for more details. |
| * |
| * You should have received a copy of the GNU General Public License |
| * along with this program; if not, write the Free Software Foundation, |
| * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA |
| */ |
| #ifndef __LIST_H__ |
| #define __LIST_H__ |
| |
| /* |
| * This undef is here because BSD 4.4 added some LIST_ macros into system |
| * header file sys/queue.h. This header is included in many other system |
| * headers and thus causes "macro redefined" warnings. |
| * |
| * As OS X is kind of a derivate of BSD, this affects OS X too. |
| * |
| * To use our own LIST_ macros (copied from kernel code), we have to |
| * at first undefine the conflicting system macros. |
| * |
| */ |
| #undef LIST_HEAD |
| #undef LIST_HEAD_INIT |
| |
| /* |
| * Simple, generic doubly-linked list implementation. |
| */ |
| |
| struct list_head { |
| struct list_head *next; |
| struct list_head *prev; |
| }; |
| |
| #define LIST_HEAD_INIT(name) { &(name), &(name) } |
| |
| #define LIST_HEAD(name) \ |
| struct list_head name = LIST_HEAD_INIT(name) |
| |
| #define INIT_LIST_HEAD(list) list_head_init(list) |
| static inline void list_head_init(struct list_head *list) |
| { |
| list->next = list->prev = list; |
| } |
| |
| static inline void list_head_destroy(struct list_head *list) |
| { |
| list->next = list->prev = NULL; |
| } |
| |
| static inline void __list_add(struct list_head *add, |
| struct list_head *prev, struct list_head *next) |
| { |
| next->prev = add; |
| add->next = next; |
| add->prev = prev; |
| prev->next = add; |
| } |
| |
| static inline void list_add(struct list_head *add, struct list_head *head) |
| { |
| __list_add(add, head, head->next); |
| } |
| |
| static inline void list_add_tail(struct list_head *add, struct list_head *head) |
| { |
| __list_add(add, head->prev, head); |
| } |
| |
| static inline void __list_del(struct list_head *prev, struct list_head *next) |
| { |
| next->prev = prev; |
| prev->next = next; |
| } |
| |
| static inline void list_del_init(struct list_head *entry) |
| { |
| __list_del(entry->prev, entry->next); |
| list_head_init(entry); |
| } |
| |
| static inline void list_del(struct list_head *entry) |
| { |
| __list_del(entry->prev, entry->next); |
| } |
| |
| static inline void list_move(struct list_head *list, struct list_head *head) |
| { |
| __list_del(list->prev, list->next); |
| list_add(list, head); |
| } |
| |
| static inline void list_move_tail(struct list_head *list, struct list_head *head) |
| { |
| __list_del(list->prev, list->next); |
| list_add_tail(list, head); |
| } |
| |
| static inline int list_empty(const struct list_head *head) |
| { |
| return head->next == head; |
| } |
| |
| static inline void __list_splice(struct list_head *list, |
| struct list_head *prev, |
| struct list_head *next) |
| { |
| struct list_head *first = list->next; |
| struct list_head *last = list->prev; |
| |
| first->prev = prev; |
| prev->next = first; |
| |
| last->next = next; |
| next->prev = last; |
| } |
| |
| static inline void list_splice(struct list_head *list, struct list_head *head) |
| { |
| if (!list_empty(list)) |
| __list_splice(list, head, head->next); |
| } |
| |
| static inline void list_splice_init(struct list_head *list, |
| struct list_head *head) |
| { |
| if (!list_empty(list)) { |
| __list_splice(list, head, head->next); |
| list_head_init(list); |
| } |
| } |
| |
| #define list_entry(ptr, type, member) ({ \ |
| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ |
| (type *)( (char *)__mptr - offsetof(type,member) );}) |
| |
| #define list_for_each(pos, head) \ |
| for (pos = (head)->next; pos != (head); pos = pos->next) |
| |
| #define list_for_each_safe(pos, n, head) \ |
| for (pos = (head)->next, n = pos->next; pos != (head); \ |
| pos = n, n = pos->next) |
| |
| #define list_for_each_entry(pos, head, member) \ |
| for (pos = list_entry((head)->next, typeof(*pos), member); \ |
| &pos->member != (head); \ |
| pos = list_entry(pos->member.next, typeof(*pos), member)) |
| |
| #define list_for_each_entry_safe(pos, n, head, member) \ |
| for (pos = list_entry((head)->next, typeof(*pos), member), \ |
| n = list_entry(pos->member.next, typeof(*pos), member); \ |
| &pos->member != (head); \ |
| pos = n, n = list_entry(n->member.next, typeof(*n), member)) |
| |
| #define list_first_entry(ptr, type, member) \ |
| list_entry((ptr)->next, type, member) |
| |
| #define container_of(ptr, type, member) ({ \ |
| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ |
| (type *)( (char *)__mptr - offsetof(type,member) );}) |
| |
| void list_sort(void *priv, struct list_head *head, |
| int (*cmp)(void *priv, struct list_head *a, |
| struct list_head *b)); |
| |
| #define ARRAY_SIZE(arr) (sizeof(arr) / sizeof((arr)[0])) |
| |
| /** |
| * list_splice_tail_init - join two lists and reinitialise the emptied list |
| * @list: the new list to add. |
| * @head: the place to add it in the first list. |
| * |
| * Each of the lists is a queue. |
| * The list at @list is reinitialised |
| */ |
| static inline void list_splice_tail_init(struct list_head *list, |
| struct list_head *head) |
| { |
| if (!list_empty(list)) { |
| __list_splice(list, head->prev, head); |
| INIT_LIST_HEAD(list); |
| } |
| } |
| |
| /** |
| * list_last_entry - get the last element from a list |
| * @ptr: the list head to take the element from. |
| * @type: the type of the struct this is embedded in. |
| * @member: the name of the list_head within the struct. |
| * |
| * Note, that list is expected to be not empty. |
| */ |
| #define list_last_entry(ptr, type, member) \ |
| list_entry((ptr)->prev, type, member) |
| |
| /** |
| * list_prev_entry - get the prev element in list |
| * @pos: the type * to cursor |
| * @member: the name of the list_head within the struct. |
| */ |
| #define list_prev_entry(pos, member) \ |
| list_entry((pos)->member.prev, typeof(*(pos)), member) |
| |
| /** |
| * list_for_each_entry_reverse - iterate backwards over list of given type. |
| * @pos: the type * to use as a loop cursor. |
| * @head: the head for your list. |
| * @member: the name of the list_head within the struct. |
| */ |
| #define list_for_each_entry_reverse(pos, head, member) \ |
| for (pos = list_last_entry(head, typeof(*pos), member); \ |
| &pos->member != (head); \ |
| pos = list_prev_entry(pos, member)) |
| |
| #endif /* __LIST_H__ */ |