提取Linux内核链表为吾所用

————Author:qinfan，Date:2014.10.29

由于项目中总是会用到链表，而每次用到链表的类型又不尽相同，每次都去写一个一般链表，如此这般，何来的效率？如是，不如奉行鲁迅先生的拿来主义，借用linux内核的万能链表用于所有项目中，这是多么爽的一件事啊！

下面分为两个文件源码文件，一个是从kernel里面提取出来的头文件(list.h)，稍作修改。一个是怎么用这个链表的测试文件(test.c)，废话不多说，上菜！

#ifndef _LINUX_LIST_H__ #define _LINUX_LIST_H__ #define NULL (void*)0x0 #define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER) /** * container_of - cast a member of a structure out to the containing structure * @ptr: the pointer to the member. * @type: the type of the container struct this is embedded in. * @member: the name of the member within the struct. * */ #define container_of(ptr, type, member) ({ \ const typeof( ((type *)0)->member ) *__mptr = (ptr); \ (type *)( (char *)__mptr - offsetof(type,member) );}) /****************************************** struct student { int num; int date; int height; int weight; struct list_head list; }; struct student *tmp_student; struct list_head *pos; tmp_student = list_entry(pos,struct student,list); 0x00000000->|----|struct num |----|struct date |----|struct height |----|struct weight 0x0000000F->|----|struct list const typeof( ((struct student *)0)->list ) *__mptr = (pos):0x0000000F ((size_t) &((struct student *)0)->list):0x0000000F-0x00000000=F (struct student *)( (char *)__mptr - offsetof(struct student,list) ):0x0000000F-F=0x00000000 *******************************************/ struct list_head { struct list_head *next, *prev; }; 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! */ 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); } /* * 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; } static inline void list_del(struct list_head *entry) { __list_del(entry->prev, entry->next); entry->next = NULL; entry->prev = NULL; } /** * list_empty - tests whether a list is empty * @head: the list to test. */ static inline int list_empty(const struct list_head *head) { return head->next == head; } /** * list_entry - get the struct for this entry * @ptr: the &struct list_head pointer. * @type: the type of the struct this is embedded in. * @member: the name of the list_struct within the struct. */ #define list_entry(ptr, type, member) \ container_of(ptr, type, member) /** * list_for_each - iterate over a list * @pos: the &struct list_head to use as a loop cursor. * @head: the head for your list. *NULL!=pos:add by qinfan */ #define list_for_each(pos, head) \ for (pos = (head)->next; pos != (head)&&NULL!=pos; pos = pos->next) #endif

#include "list.h" #include <stdio h=""> #include <stdlib h=""> #include <string h=""> #define SIZENUM 10 struct student { int num; char name[32]; struct list_head list; }; struct student *pstudent; struct student *student_get; struct list_head student_list; struct list_head *pos; int mylist_init() { int i = 0; INIT_LIST_HEAD(&student_list); pstudent = malloc(sizeof(struct student)*SIZENUM); memset(pstudent,0,sizeof(struct student)*SIZENUM); for(i=0;i<sizenum i="" pstudent="" i="" num="i;" sprintf="" pstudent="" i="" name="" student="" d="" i="" list_add="" pstudent="" i="" list="" student_list="" list_add_tail="" pstudent="" i="" list="" student_list="" list_for_each="" pos="" student_list="" student_get="list_entry(pos,struct" student="" list="" printf="" line:="" d="" student="" d="" name:="" s="" n="" __line__="" student_get-="">num,student_get->name); if(5 == student_get->num)break; } return 0; } void mylist_exit() { int i = 0; /* for(i=0;i<SIZENUM;i++) list_del(&(pstudent[i].list)); */ /*采用这种方法释放链表会段错误 list_for_each(pos,&student_list) list_del(&(pstudent[i++].list)); */ /*kernel释放链表方法*/ while(!list_empty(&student_list)) { list_del(&(pstudent[i++].list)); } free(pstudent); } int main(int argc, char *argv[]) { mylist_init(); mylist_exit(); return 0; }

由于暂时只用到了链表的插入，删除，查找功能，用到内核链表的功能函数只有这几个，其他的函数没有都剔除掉了。其中，在list.h文件中，有一个列子是用来说明内核中怎么计算出当前链表位置所指的结构体的首地址的，这只是我的个人愚见。在list_for_each(pos, head)函数中，由于在遍历链表时，我处理不当造成段错误，添加了一个判断条件(NULL!=pos)，这样就避免了当指针为空的时候，遍历出错的问题。继续学习中……