2 * Copyright (c) 2011 HighPoint Technologies, Inc.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 #include <dev/hpt27xx/hpt27xx_config.h>
37 #define HPT_INLINE __inline
41 struct list_head *next, *prev;
44 #define INIT_LIST_HEAD(ptr) do { (ptr)->next = (ptr); (ptr)->prev = (ptr); } while (0)
46 static HPT_INLINE void __list_add(struct list_head * _new, struct list_head * prev, struct list_head * next)
54 static HPT_INLINE void list_add(struct list_head *_new, struct list_head *head)
56 __list_add(_new, head, head->next);
59 static HPT_INLINE void list_add_tail(struct list_head *_new, struct list_head *head)
61 __list_add(_new, head->prev, head);
64 static HPT_INLINE void __list_del(struct list_head * prev, struct list_head * next)
70 static HPT_INLINE void list_del(struct list_head *entry)
72 __list_del(entry->prev, entry->next);
75 static HPT_INLINE void list_del_init(struct list_head *entry)
77 __list_del(entry->prev, entry->next);
78 INIT_LIST_HEAD(entry);
81 static HPT_INLINE int list_empty(struct list_head *head)
83 HPT_ASSERT(!(head->next==head && head->prev!=head));
84 return head->next == head;
87 static HPT_INLINE void __list_splice(struct list_head *list,
88 struct list_head *head)
90 struct list_head *first = list->next;
91 struct list_head *last = list->prev;
92 struct list_head *at = head->next;
101 static HPT_INLINE void list_splice(struct list_head *list, struct list_head *head)
103 if (!list_empty(list))
104 __list_splice(list, head);
107 static HPT_INLINE void list_splice_init(struct list_head *list, struct list_head *head)
109 if (!list_empty(list)) {
110 __list_splice(list, head);
111 INIT_LIST_HEAD(list);
115 #define list_entry(ptr, type, member) \
116 ((type *)((char *)(ptr)-(HPT_UPTR)(&((type *)0)->member)))
118 #define list_for_each(pos, head) \
119 for (pos = (head)->next; pos != (head); pos = pos->next)
121 #define list_for_each_safe(pos, n, head) \
122 for (pos = (head)->next, n = pos->next; pos != (head); \
123 pos = n, n = pos->next)
125 #define get_first_item(attached, type, member) \
126 ((type *)((char *)((attached)->next)-(HPT_UPTR)(&((type *)0)->member)))