内核双向链表demo

#include <stdio.h>
#include <stddef.h>

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 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 int list_empty(const struct list_head *head)
{
        return head->next == head;
}

#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_first_entry(ptr, type, member) \
        list_entry((ptr)->next, type, member)

#define list_next_entry(pos, member) \
	list_entry((pos)->member.next, typeof(*(pos)), member)

#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))
#define list_for_each(pos, head) \
	for (pos = (head)->next; pos != (head); pos = pos->next)

#ifdef CONFIG_ILLEGAL_POINTER_VALUE
# define POISON_POINTER_DELTA _AC(CONFIG_ILLEGAL_POINTER_VALUE, UL)
#else
# define POISON_POINTER_DELTA 0
#endif
#define LIST_POISON1  ((void *) 0x100 + POISON_POINTER_DELTA)
#define LIST_POISON2  ((void *) 0x200 + POISON_POINTER_DELTA)
#define WRITE_ONCE(x, val) \
({							\
	union { typeof(x) __val; char __c[1]; } __u =	\
		{ .__val = (__force typeof(x)) (val) }; \
	__write_once_size(&(x), __u.__c, sizeof(x));	\
	__u.__val;					\
})
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;
}
LIST_HEAD(arm_family);
struct cpu_info{
	char *name;
	struct list_head list;
};
struct cpu_info qcom={
	.name="qcom",
};
struct cpu_info mtk={
	.name="mtk",
};
struct cpu_info sprd={
	.name="sprd",
};


int main(void){
	struct cpu_info *ci;
	struct list_head *lt;
	
//	printf("list_empty=%d\n",list_empty(&arm_family));

	list_add_tail(&qcom.list,&arm_family);
	list_add_tail(&mtk.list,&arm_family);
	list_add_tail(&sprd.list,&arm_family);
	list_for_each(lt,&arm_family){
		ci=container_of(lt,struct cpu_info,list);
		printf("arm family member name=%s\n",ci->name);
	};
	printf("-------------------------\n");	

	list_del(&qcom.list);	
	list_del(&mtk.list);
	list_del(&sprd.list);
	printf("-------------------------\n");

	list_add(&qcom.list,&arm_family);
	list_add(&mtk.list,&arm_family);
	list_add(&sprd.list,&arm_family);
	list_for_each_entry(ci,&arm_family,list){
		printf("arm family member name=%s\n",ci->name);
	};
	return 0;
}

arm family member name=qcom
arm family member name=mtk
arm family member name=sprd
-------------------------
-------------------------
arm family member name=sprd
arm family member name=mtk
arm family member name=qcom