sys_list.h

凌阳32位单片机开发的小游戏

/*************************************************************************
 *  Filename:   list.c
 *  Author:     yfwan  (eMail: [e-mail])   
 *  Tel:        [phone]
 *  Date:       2004-11-12
 *  Description:Simple doubly linked list implementation.
 *               
 *  Reference:  Linux kernel source code
 *
 *  Version history:
 *------------------------------------------------------------------------
 *	Version   YYYY-MM-DD-INDEX   Modified By         Description
 *  1.2.0     2004-11-12         yfwan               First release
 *	
 ************************************************************************/
#ifndef _AT_LIST_HEADER
#define _AT_LIST_HEADER

/*
 * Simple doubly linked list implementation.
 *
 * Some of the internal functions ("__xxx") are useful when
 * manipulating whole lists rather than single entries, as
 * sometimes we already know the next/prev entries and we can
 * generate better code by using them directly rather than
 * using the generic single-entry routines.
 */

#define container_of(ptr, type, member) \
	((type *)((char *)(ptr)-(unsigned long)(&((type *)0)->member)))

typedef struct ListHead 
{
	struct ListHead *next, *prev;
} LISTHEAD;

#define LIST_HEAD_INIT(name) { &(name), &(name) }

#define LIST_HEAD(name) \
	LISTHEAD name = LIST_HEAD_INIT(name)

#define INIT_LIST_HEAD(ptr) do { \
	(ptr)->next = (ptr); (ptr)->prev = (ptr); \
} while (0)

#define INLINE  
/*
#define INLINE __inline
*/

/*
 * Insert a new entry between two known consecutive entries. 
 *
 * This is only for internal list manipulation where we know
 * the prev/next entries already!
 */
INLINE void __list_add(LISTHEAD * pnew, LISTHEAD * prev, LISTHEAD * next) ;

/**
 * list_add - add a new entry
 * @new: new entry to be added
 * @head: list head to add it after
 *
 * Insert a new entry after the specified head.
 * This is good for implementing stacks.
 */
INLINE void list_add(LISTHEAD *pnew, LISTHEAD *head);

/**
 * list_add_tail - add a new entry
 * @new: new entry to be added
 * @head: list head to add it before
 *
 * Insert a new entry before the specified head.
 * This is useful for implementing queues.
 */
INLINE void list_add_tail(LISTHEAD *pnew, LISTHEAD *head);

/*
 * Delete a list entry by making the prev/next entries
 * point to each other.
 *
 * This is only for internal list manipulation where we know
 * the prev/next entries already!
 */
INLINE void __list_del(LISTHEAD * prev, LISTHEAD * next);

/**
 * list_del - deletes entry from list.
 * @entry: the element to delete from the list.
 * Note: list_empty on entry does not return true after this, the entry is in an undefined state.
 */
INLINE void list_del(LISTHEAD *entry);

/**
 * list_del_init - deletes entry from list and reinitialize it.
 * @entry: the element to delete from the list.
 */
INLINE void list_del_init(LISTHEAD *entry);

/**
 * list_empty - tests whether a list is empty
 * @head: the list to test.
 */
INLINE int list_empty(LISTHEAD *head);

/**
 * list_splice - join two lists
 * @list: the new list to add.
 * @head: the place to add it in the first list.
 */
INLINE void list_splice(LISTHEAD *list, LISTHEAD *head);

/**
 * list_entry - get the struct for this entry
 * @ptr:	the &LISTHEAD pointer.
 * @type:	the type of the struct this is embedded in.
 * @member:	the name of the list_struct within the struct.
 */
#define list_entry(ptr, type, member) \
	container_of(ptr, type, member)



/**
 * list_for_each	-	iterate over a list
 * @pos:	the &LISTHEAD to use as a loop counter.
 * @head:	the head for your list.
 */
#define list_for_each(pos, head) \
	for (pos = (head)->next; pos != (head); pos = pos->next)

/**
 * list_for_each_safe	-	iterate over a list safe against removal of list entry
 * @pos:	the &LISTHEAD to use as a loop counter.
 * @n:		another &LISTHEAD to use as temporary storage
 * @head:	the head for your list.
 */
#define list_for_each_safe(pos, n, head) \
	for (pos = (head)->next, n = pos->next; pos != (head); \
		pos = n, n = pos->next)


/**
 * list_for_each_prev	-	iterate over a list backwards
 * @pos:	the &struct list_head to use as a loop counter.
 * @head:	the head for your list.
 */
#define list_for_each_prev(pos, head) \
	for (pos = (head)->prev; pos != (head); pos = pos->prev)

/**
 * list_for_each_prev_safe	-	iterate over a list backwards
 *                   safe against removal of list entry
 * @pos:	the &struct list_head to use as a loop counter.
 * @n:		another &LISTHEAD to use as temporary storage
 * @head:	the head for your list.
 */
#define list_for_each_prev_safe(pos, n, head) \
	for (pos = (head)->prev, n = pos->prev; pos != (head); \
		pos = n, n = pos->prev)



#endif