1 /* $Id: list.h,v 1.6 2006/10/31 06:25:28 gmm Exp $ */ 2 /*- 3 * SPDX-License-Identifier: BSD-2-Clause 4 * 5 * Copyright (C) 2005-2011 HighPoint Technologies, Inc. 6 * All rights reserved. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 1. Redistributions of source code must retain the above copyright 12 * notice, this list of conditions and the following disclaimer. 13 * 2. Redistributions in binary form must reproduce the above copyright 14 * notice, this list of conditions and the following disclaimer in the 15 * documentation and/or other materials provided with the distribution. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27 * SUCH DAMAGE. 28 */ 29 #include <dev/hptnr/hptnr_config.h> 30 #ifndef _HPT_LIST_H_ 31 #define _HPT_LIST_H_ 32 33 #ifndef _LINUX_LIST_H 34 35 #ifndef HPT_INLINE 36 #define HPT_INLINE __inline 37 #endif 38 39 struct list_head { 40 struct list_head *next, *prev; 41 }; 42 43 #define INIT_LIST_HEAD(ptr) do { (ptr)->next = (ptr); (ptr)->prev = (ptr); } while (0) 44 45 static HPT_INLINE void __list_add(struct list_head * _new, struct list_head * prev, struct list_head * next) 46 { 47 next->prev = _new; 48 _new->next = next; 49 _new->prev = prev; 50 prev->next = _new; 51 } 52 53 static HPT_INLINE void list_add(struct list_head *_new, struct list_head *head) 54 { 55 __list_add(_new, head, head->next); 56 } 57 58 static HPT_INLINE void list_add_tail(struct list_head *_new, struct list_head *head) 59 { 60 __list_add(_new, head->prev, head); 61 } 62 63 static HPT_INLINE void __list_del(struct list_head * prev, struct list_head * next) 64 { 65 next->prev = prev; 66 prev->next = next; 67 } 68 69 static HPT_INLINE void list_del(struct list_head *entry) 70 { 71 __list_del(entry->prev, entry->next); 72 } 73 74 static HPT_INLINE void list_del_init(struct list_head *entry) 75 { 76 __list_del(entry->prev, entry->next); 77 INIT_LIST_HEAD(entry); 78 } 79 80 static HPT_INLINE int list_empty(struct list_head *head) 81 { 82 HPT_ASSERT(!(head->next==head && head->prev!=head)); 83 return head->next == head; 84 } 85 86 static HPT_INLINE void __list_splice(struct list_head *list, 87 struct list_head *head) 88 { 89 struct list_head *first = list->next; 90 struct list_head *last = list->prev; 91 struct list_head *at = head->next; 92 93 first->prev = head; 94 head->next = first; 95 96 last->next = at; 97 at->prev = last; 98 } 99 100 static HPT_INLINE void list_splice(struct list_head *list, struct list_head *head) 101 { 102 if (!list_empty(list)) 103 __list_splice(list, head); 104 } 105 106 static HPT_INLINE void list_splice_init(struct list_head *list, struct list_head *head) 107 { 108 if (!list_empty(list)) { 109 __list_splice(list, head); 110 INIT_LIST_HEAD(list); 111 } 112 } 113 114 #define list_entry(ptr, type, member) \ 115 ((type *)((char *)(ptr)-(HPT_UPTR)(&((type *)0)->member))) 116 117 #define list_for_each(pos, head) \ 118 for (pos = (head)->next; pos != (head); pos = pos->next) 119 120 #define list_for_each_safe(pos, n, head) \ 121 for (pos = (head)->next, n = pos->next; pos != (head); \ 122 pos = n, n = pos->next) 123 124 #define get_first_item(attached, type, member) \ 125 ((type *)((char *)((attached)->next)-(HPT_UPTR)(&((type *)0)->member))) 126 127 #endif 128 129 #endif 130