用户空间使用linux内核链表list编程

在用户空间编程使用linux内核链表list，hlist宏定义和操作. 

linux内核中的list_head和hlist_head/hlist_node是将数据结构串起来成为链表的两个重要链表构造工具。利用他们和其对应的宏定义，可以非常容易地将数据构成链表，进行链表的各种操作，和数据查询。 

在内核中，他们使用的十分广泛。这些链表操作宏定义具有通用性，和具体数据结构无关。 

利用他们，编程者就不必要自己具体操作链表的指针，而集中精力关心数据本身。使用这些工具的程序效率是很高的。 

因为他们是内核定义的数据结构，在内核编程使用起来十分简单。 

struct list_head { struct list_head *prev, *next; } 尺寸为2个指针大小。32位系统上为8个字节。 
struct hlist_node 也是包含2个指针占8个字节。 
struct hlist_head 占4个字节. 

用他们将多个相同的数据结构串起来，必须在数据结构中加上他们的定义。一个数据结构也可以用多个相同链表或不同链表同时串起，串到多个不同的串中。 

如果不在内核而在用户空间编程，也可以利用这些链表。（事实上，内核其它的数据结构多数都可以在用户空间使用）。 

要“移植到用户空间”， 必须查找定义链表数据和宏的包含文件，将该文件拷贝出来，做适当改动，去掉内核特定的定义开关。如果该文件中引用的其它内核包含文件的关键数据定义，最好去掉引用，而将定义拷贝过来。 

下面我给出的例子，实现了对链表的添加 查询 删除操作 

struct hlist_head仅仅用了一个指针，占4个字节。 

文件list.h是 include/linux/list.h文件的用户空间改编版本。 
具体的定义的含义，我这里不再叙述，你可以自己查找。有许多内核数据结构分析的地方有解释。 

建议用户用C编程时候，如涉及到链表使用，那么使用list_head! 可以极大节省你的工作量和调式时间。 
linux内核中还有许多定义好通用的东西，都是非常精彩和高效的。许多都可移植到用户程序中使用。 

<pre name="code" class="cpp">#include <stdio.h> 
#include <stdlib.h> 
#include "list.h" 

struct ST { 
    unsigned char ch; 
    int 	this_data; 
    struct list_head  i_list; 
} *st; 


#define LISTSIZE 24 

void main() 
{
	int i; 
	
	struct ST *pst; 
	struct list_head list_head;   

	struct list_head *list_find;
	struct ST *p_find;

	struct list_head *list_remove,*list_remove1;
	struct ST *p_del;


	INIT_LIST_HEAD(&list_head); 
	for(i = 0; i < LISTSIZE; i++) { 
		pst = malloc(sizeof(struct ST)); 
		if(!pst) { 
		    printf("malloc fail.\n"); 
		    break; 
		} 
		pst->ch = 'a' + i; 
		//add list
		list_add_tail(&pst->i_list, &list_head); 
	} 

	if(list_empty(&list_head))
	{
		printf("check list empty !!!\n");
	}
     
	i = 0;  
	list_for_each(list_find, &list_head) { 
		p_find = list_entry(list_find, struct ST, i_list); 
		printf("%p  value %d = %c\n", p_find, i, p_find->ch); 
		i++; 
	}
	printf("total %d \n\n", i); 

	if(list_empty(&list_head))
	{
		printf("check list empty !!!\n");
	}

	i=0;
	list_for_each_safe(list_remove, list_remove1, &list_head)
	{
		list_del(list_remove);
		p_del=list_entry(list_remove, struct ST, i_list);
		free(p_del);
		printf("node %d has removed from the doublelist\n",i++);
	}

	if(list_empty(&list_head))
		{
		printf("the list is empty !!!\n");
	}
}

改编后的放在用户空间的头文件list.h 

<pre name="code" class="cpp">#ifndef _LINUX_LIST_H 
#define _LINUX_LIST_H 
  
#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) ); } ) 
  
static inline void prefetch(const void *x) {;} 
static inline void prefetchw(const void *x) {;} 

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

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) 

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

/* 
 * Insert a new entry between two known consecutive entries. 
 * 
 * This is only for internal list manipulation where we know 
 * the prev/next entries already! 
 */ 
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; 
} 

/** 
 * 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); 
} 

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 void list_del_init(struct list_head *entry) 
{ 
__list_del(entry->prev, entry->next); 
INIT_LIST_HEAD(entry); 
} 

static inline void list_move(struct list_head *list, struct list_head *head) 
{ 
        __list_del(list->prev, list->next); 
        list_add(list, head); 
} 

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

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

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

static inline void __list_splice(struct list_head *list, 
 struct list_head *head) 
{ 
struct list_head *first = list->next; 
struct list_head *last = list->prev; 
struct list_head *at = head->next; 

first->prev = head; 
head->next = first; 

last->next = at; 
at->prev = last; 
} 

/** 
 * list_splice - join two lists 
 * @list: the new list to add. 
 * @head: the place to add it in the first list. 
 */ 
static inline void list_splice(struct list_head *list, struct list_head *head) 
{ 
if (!list_empty(list)) 
__list_splice(list, head); 
} 

/** 
 * list_splice_init - join two lists and reinitialise the emptied list. 
 * @list: the new list to add. 
 * @head: the place to add it in the first list. 
 * 
 * The list at @list is reinitialised 
 */ 
static inline void list_splice_init(struct list_head *list, 
    struct list_head *head) 
{ 
if (!list_empty(list)) { 
__list_splice(list, head); 
INIT_LIST_HEAD(list); 
} 
} 

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


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

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

#define list_for_each_prev(pos, head) \
for (pos = (head)->prev; prefetch(pos->prev), pos != (head); \
        	pos = pos->prev) 

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

#define list_for_each_entry(pos, head, member)	\
for (pos = list_entry((head)->next, typeof(*pos), member);	\
     prefetch(pos->member.next), &pos->member != (head); 	\
     pos = list_entry(pos->member.next, typeof(*pos), member)) 

#define list_for_each_entry_reverse(pos, head, member)	\
for (pos = list_entry((head)->prev, typeof(*pos), member);	\
     prefetch(pos->member.prev), &pos->member != (head); 	\
     pos = list_entry(pos->member.prev, typeof(*pos), member)) 

#define list_prepare_entry(pos, head, member) \
((pos) ? : list_entry(head, typeof(*pos), member)) 

#define list_for_each_entry_continue(pos, head, member) 	\
for (pos = list_entry(pos->member.next, typeof(*pos), member);	\
     prefetch(pos->member.next), &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)) 

//HASH LIST 
struct hlist_head { 
struct hlist_node *first; 
}; 

struct hlist_node { 
struct hlist_node *next, **pprev; 
}; 

#define HLIST_HEAD_INIT { .first = NULL } 
#define HLIST_HEAD(name) struct hlist_head name = {  .first = NULL } 
#define INIT_HLIST_HEAD(ptr) ((ptr)->first = NULL) 
#define INIT_HLIST_NODE(ptr) ((ptr)->next = NULL, (ptr)->pprev = NULL) 

static inline int hlist_unhashed(const struct hlist_node *h) 
{ 
return !h->pprev; 
} 

static inline int hlist_empty(const struct hlist_head *h) 
{ 
return !h->first; 
} 

static inline void __hlist_del(struct hlist_node *n) 
{ 
struct hlist_node *next = n->next; 
struct hlist_node **pprev = n->pprev; 
*pprev = next; 
if (next) 
next->pprev = pprev; 
} 

static inline void hlist_del(struct hlist_node *n) 
{ 
__hlist_del(n); 
n->next = LIST_POISON1; 
n->pprev = LIST_POISON2; 
} 

static inline void hlist_del_init(struct hlist_node *n) 
{ 
if (n->pprev)  { 
__hlist_del(n); 
INIT_HLIST_NODE(n); 
} 
} 

static inline void hlist_add_head(struct hlist_node *n, struct hlist_head *h) 
{ 
struct hlist_node *first = h->first; 
n->next = first; 
if (first) 
first->pprev = &n->next; 
h->first = n; 
n->pprev = &h->first; 
} 


/* next must be != NULL */ 
static inline void hlist_add_before(struct hlist_node *n, 
struct hlist_node *next) 
{ 
n->pprev = next->pprev; 
n->next = next; 
next->pprev = &n->next; 
*(n->pprev) = n; 
} 

static inline void hlist_add_after(struct hlist_node *n, 
struct hlist_node *next) 
{ 
next->next = n->next; 
n->next = next; 
next->pprev = &n->next; 

if(next->next) 
next->next->pprev  = &next->next; 
} 

#define hlist_entry(ptr, type, member) container_of(ptr,type,member) 

#define hlist_for_each(pos, head) \
for (pos = (head)->first; pos && ({ prefetch(pos->next); 1; }); \
     pos = pos->next) 

#define hlist_for_each_safe(pos, n, head) \
for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
     pos = n) 

#define hlist_for_each_entry(tpos, pos, head, member)	 \
for (pos = (head)->first;	 \
     pos && ({ prefetch(pos->next); 1;}) &&	 \
({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \
     pos = pos->next) 

#define hlist_for_each_entry_continue(tpos, pos, member)	 \
for (pos = (pos)->next;	 \
     pos && ({ prefetch(pos->next); 1;}) &&	 \
({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \
     pos = pos->next) 

#define hlist_for_each_entry_from(tpos, pos, member)	 \
for (; pos && ({ prefetch(pos->next); 1;}) &&	 \
({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \
     pos = pos->next) 

#define hlist_for_each_entry_safe(tpos, pos, n, head, member) 	 \
for (pos = (head)->first;	 \
     pos && ({ n = pos->next; 1; }) && 	 \
({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \
     pos = n) 

#endif