#ifndef __LIST_H__

#define __LIST_H__

#include <stddef.h>

/* taken from linux kernel */

#undef offsetof

#ifdef __compiler_offsetof

#define offsetof(TYPE,MEMBER) __compiler_offsetof(TYPE,MEMBER)

#else

#define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER)

#endif

#define list_container_of(ptr, type, member) ({		\

        const typeof( ((type *)0)->member ) *__mptr = (ptr);	\

        (type *)( (char *)__mptr - offsetof(type,member) );})

struct list_head {

	struct list_head *next, *prev;

};

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

#define LIST_HEAD(name) \

	struct list_head name = LIST_HEAD_INIT(name)

static inline void INIT_LIST_HEAD(struct list_head *list)

{

	list->next = list;

	list->prev = list;

}

static inline int list_empty(const struct list_head *head)

{

	return head->next == head;

}

#define list_entry(ptr, type, member) \

	list_container_of(ptr, type, member)

#define list_first_entry(ptr, type, member) \

	list_entry((ptr)->next, type, member)

#define list_first_entry_or_null(ptr, type, member) \

	(!list_empty(ptr) ? list_first_entry(ptr, type, member) : NULL)

#define list_for_each(pos, head) \

	for (pos = (head)->next; pos != (head); pos = pos->next)

#define list_for_each_entry(pos, head, member)				\

	for (pos = list_entry((head)->next, typeof(*pos), member);	\

	     &pos->member != (head);				 	\

	     pos = list_entry(pos->member.next, typeof(*pos), member))

#define list_for_each_entry_safe(pos, n, head, member)			\

	for (pos = list_entry((head)->next, typeof(*pos), member),	\

		n = list_entry(pos->member.next, typeof(*pos), member);	\

	     &pos->member != (head); 					\

	     pos = n, n = list_entry(n->member.next, typeof(*n), member))

static 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 inline void list_add(struct list_head *new, struct list_head *head)

{

	__list_add(new, head, head->next);

}

static inline void list_add_tail(struct list_head *new, struct list_head *head)

{

	__list_add(new, head->prev, head);

}

static inline void __list_del(struct list_head * prev, struct list_head * next)

{

	next->prev = prev;

	prev->next = next;

}

static inline void list_del(struct list_head *entry)

{

	__list_del(entry->prev, entry->next);

	entry->next = entry->prev = NULL;

}

static inline void list_del_init(struct list_head *entry)

{

	__list_del(entry->prev, entry->next);

	INIT_LIST_HEAD(entry);

}

/**

 * list_move_tail - delete from one list and add as another's tail

 * @list: the entry to move

 * @head: the head that will follow our entry

 */

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);

}

#endif