list.h
No OneTemporary
Actions

Size

1 KB

Referenced Files

None

Subscribers

None

list.h
View Options

	/* List ops from include/linux/list.h */

	#define LIST_POISON1 ((void *) 0x00100100)
	#define LIST_POISON2 ((void *) 0x00200200)

	struct list_head { struct list_head next, prev; };

	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 = LIST_POISON1;
	entry->prev = LIST_POISON2;
	}

	static inline int list_empty(const struct list_head *head)
	{
	return head->next == head;
	}

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

	#define LIST_HEAD(name) \
	struct list_head name = LIST_HEAD_INIT(name)

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

	#define container_of(ptr, type, member) ({ \
	const typeof( ((type )0)->member ) __mptr = (ptr); \
	(type )( (char )__mptr - offsetof(type,member) );})

	#define list_entry(ptr, type, member) \
	container_of(ptr, type, member)

	#define list_for_each(pos, head) \
	for (pos = (head)->next; pos != (head); pos = pos->next)