123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154 |
- /*
- * Copyright (c) HighPoint Technologies, Inc.
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- *
- * $FreeBSD: src/sys/dev/hptrr/list.h,v 1.2.2.1.4.1 2010/06/14 02:09:06 kensmith Exp $
- */
- /*
- * $Id: list.h,v 1.6 2006/10/31 06:25:28 gmm Exp $
- * Copyright (C) 2004-2005 HighPoint Technologies, Inc. All rights reserved.
- */
- #ifndef _HPT_LIST_H_
- #define _HPT_LIST_H_
- #ifndef _LINUX_LIST_H
- #ifndef _LINUX_TYPES_H
- #ifndef HPT_INLINE
- #define HPT_INLINE __inline
- #endif
- typedef unsigned long HPT_UPTR;
- struct list_head {
- struct list_head *next, *prev;
- };
- #define LIST_HEAD_INIT(name) { &(name), &(name) }
- #define INIT_LIST_HEAD(ptr) do { (ptr)->next = (ptr); (ptr)->prev = (ptr); } while (0)
- static HPT_INLINE void __list_add(struct list_head * _new, struct list_head * prev, struct list_head * next)
- {
- next->prev = _new;
- _new->next = next;
- _new->prev = prev;
- prev->next = _new;
- }
- static HPT_INLINE void list_add(struct list_head *_new, struct list_head *head)
- {
- __list_add(_new, head, head->next);
- }
- static HPT_INLINE void list_add_tail(struct list_head *_new, struct list_head *head)
- {
- __list_add(_new, head->prev, head);
- }
- static HPT_INLINE void __list_del(struct list_head * prev, struct list_head * next)
- {
- next->prev = prev;
- prev->next = next;
- }
- static HPT_INLINE void list_del(struct list_head *entry)
- {
- __list_del(entry->prev, entry->next);
- }
- static HPT_INLINE void list_del_init(struct list_head *entry)
- {
- __list_del(entry->prev, entry->next);
- INIT_LIST_HEAD(entry);
- }
- 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 HPT_INLINE int list_empty(struct list_head *head)
- {
- return head->next == head;
- }
- static HPT_INLINE void __list_splice(struct list_head *list,
- struct list_head *head)
- {
- struct list_head *first = list->next;
- struct list_head *last = list->prev;
- struct list_head *at = head->next;
- first->prev = head;
- head->next = first;
- last->next = at;
- at->prev = last;
- }
- static HPT_INLINE void list_splice(struct list_head *list, struct list_head *head)
- {
- if (!list_empty(list))
- __list_splice(list, head);
- }
- static HPT_INLINE void list_splice_init(struct list_head *list, struct list_head *head)
- {
- if (!list_empty(list)) {
- __list_splice(list, head);
- INIT_LIST_HEAD(list);
- }
- }
- /*#define list_entry(ptr, type, member) \
- ((type *)((char *)(ptr)-(HPT_UPTR)(&((type *)0)->member))) */
- #define list_entry(ptr, type, member) \
- ((type *)((unsigned long)(ptr)-((unsigned long)(&((type *)1)->member) - 1)))
- #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 get_first_item(attached, type, member) \
- ((type *)((char *)((attached)->next)-(HPT_UPTR)(&((type *)0)->member)))
- #endif
- #endif
- #endif
|