File: [local] / prex-old / include / sys / list.h (download)
Revision 1.1.1.1 (vendor branch), Tue Jun 3 09:38:44 2008 UTC (16 years, 2 months ago) by nbrk
Branch: MAIN, KOHSUKE
CVS Tags: PREX_0_8_BASE, PREX_0_7_BASE, HEAD Changes since 1.1: +0 -0 lines
Yeah, this is an initial import of Prex, portable real-time microkernel
operating system. I wanna hack it for non-profit but fun, so let it in.
|
/*
* Copyright (c) 2005-2007, Kohsuke Ohtani
* 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.
* 3. Neither the name of the author nor the names of any co-contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* 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.
*/
#ifndef _SYS_LIST_H
#define _SYS_LIST_H
#include <sys/cdefs.h>
struct list {
struct list *next;
struct list *prev;
};
typedef struct list *list_t;
#define list_init(head) ((head)->next = (head)->prev = (head))
#define list_next(node) ((node)->next)
#define list_prev(node) ((node)->prev)
#define list_empty(head) ((head)->next == (head))
#define list_first(head) ((head)->next)
#define list_last(head) ((head)->prev)
#define list_end(head, node) ((node) == (head))
/*
* Get the struct for this entry
*/
#define list_entry(p, type, member) \
((type *)((char *)(p) - (unsigned long)(&((type *)0)->member)))
#define LIST_INIT(head) { &(head), &(head) }
/*
* Insert new node after specified node
*/
static __inline void
list_insert(list_t prev, list_t node)
{
prev->next->prev = node;
node->next = prev->next;
node->prev = prev;
prev->next = node;
}
/*
* Remove specified node from list
*/
static __inline void
list_remove(list_t node)
{
node->prev->next = node->next;
node->next->prev = node->prev;
}
#endif /* !_SYS_LIST_H */