linux list for list_head

  做内核驱动开发经常会使用linux内核最经典的双向链表 list_head， 以及它的拓展接口(或者宏定义)： list_add , list_add_tail, list_del , list_entry ,list_for_each , list_for_each_entry ...... 
 

#include <stdio.h>
#include <stdlib.h>


struct list_head {
	struct list_head *next, *prev;
};
#define POISON_POINTER_DELTA  0xdead000000000000
#define LIST_POISON1  ((void *) 0x100 + POISON_POINTER_DELTA)
#define LIST_POISON2  ((void *) 0x200 + POISON_POINTER_DELTA)

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

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

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

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

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

static inline void INIT_LIST_HEAD(struct list_head *list)
{
	list->next = list;
	list->prev = list;
}

/*
 * Insert a new entry between two known consecutive entries.
 *
 * This is only for internal list manipulation where we know
 * the prev/next entries already!
 */
#ifndef CONFIG_DEBUG_LIST
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;
}
#else
extern void __list_add(struct list_head *new,
			      struct list_head *prev,
			      struct list_head *next);
#endif

/**
 * 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.
 */
static inline void list_add(struct list_head *new, struct list_head *head)
{
	__list_add(new, head, head->next);
}


/**
 * 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.
 */
static inline void list_add_tail(struct list_head *new, struct list_head *head)
{
	__list_add(new, head->prev, 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!
 */
static inline void __list_del(struct list_head * prev, struct list_head * next)
{
	next->prev = prev;
	prev->next = 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.
 */
#ifndef CONFIG_DEBUG_LIST
static inline void __list_del_entry(struct list_head *entry)
{
	__list_del(entry->prev, entry->next);
}

static inline void list_del(struct list_head *entry)
{
	__list_del(entry->prev, entry->next);
	entry->next = LIST_POISON1;
	entry->prev = LIST_POISON2;
}
#else
extern void __list_del_entry(struct list_head *entry);
extern void list_del(struct list_head *entry);
#endif


static inline int list_empty(const struct list_head *head)
{
	return head->next == head;
}
#define list_for_each(pos, head) \
	for (pos = (head)->next; pos != (head); pos = pos->next)


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

#define list_first_entry(ptr, type, member) 	list_entry((ptr)->next, type, member)
/**
 * list_next_entry - get the next element in list
 * @pos:	the type * to cursor
 * @member:	the name of the list_head within the struct.
 */
#define list_next_entry(pos, member) \
	list_entry((pos)->member.next, typeof(*(pos)), member)
/**
 * list_for_each_entry	-	iterate over list of given type
 * @pos:	the type * to use as a loop cursor.
 * @head:	the head for your list.
 * @member:	the name of the list_head within the struct.
 */
#define list_for_each_entry(pos, head, member)				\
	for (pos = list_first_entry(head, typeof(*pos), member);	\
	     &pos->member != (head);					\
	     pos = list_next_entry(pos, member))

struct test{
	int val;
	struct list_head entry;
};

int main()
{
   /*  Write C code in this online editor and run it. */
   //printf("Hello, World! \n");
	struct list_head *itr;
	//struct list_head head;
	LIST_HEAD(head);
	INIT_LIST_HEAD(&head);
	
	struct test t1,t2,t3;
	t1.val =1;
	t2.val =11;
	t3.val =12;
	//t2.val =11;
	
	list_add_tail(&t1.entry,&head);
	list_add_tail(&t2.entry,&head);
	list_add_tail(&t3.entry,&head);
	
	list_for_each(itr,&head)
	{
		struct test *ptest = list_entry(itr,struct test,entry);
        printf("display1 : ptest val is %d \n",ptest->val);
	}
	list_del(&t2.entry);//del t2 from list
	
	struct test t4;
	t4.val=5;
	list_add_tail(&t4.entry,&head);//add new 
	
	struct test *pitr;
	list_for_each_entry(pitr,&head,entry)
	{
		 printf("display2: ptest val is %d \n",pitr->val);
	}
   return 0;
}

 

输出

display1 : ptest val is 1 
display1 : ptest val is 11 
display1 : ptest val is 12 
display2: ptest val is 1 
display2: ptest val is 12 
display2: ptest val is 5 

参考：Linux内核中经典链表 list_head 常见使用方法解析_风亦路的博客-CSDN博客_linux list_head