通用C 双循环链表（可直接用于项目）

通用C 双向 循环 链表

一.用法详解：

链表节点

struct list_head{    struct list_head *prev;    struct list_head *next;};

自定义一个链表节点，并初始化：

struct list_head list = {0};  INIT_LIST_HEAD(&list);

判断链表是否为空：

list_empty(&list)

添加链表为头结点：

struct list_test_struct *st=(struct list_test_struct*)malloc(sizeof(struct list_test_struct)); st->key = i;memset(&st->remote_addr,i,6);list_add(&st->list, &list); 

这个宏纯是遍历一遍链表，不可以中间删节点

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

这个宏不仅有遍历一遍的功能，而且可以中间删除你想删除的节点：

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

二.代码：

两个文件,文件和源文件

list.h

#ifndef _LINUX_LIST_H#define _LINUX_LIST_H void prefetch(const void *x) {;}  void prefetchw(const void *x) {;} /* * Simple doubly linked list implementation. * * Some of the internal functions ("__xxx") are useful when * manipulating whole lists rather than single entries, as * sometimes we already know the next/prev entries and we can * generate better code by using them directly rather than * using the generic single-entry routines. */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  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  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  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  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. */static  void list_del(struct list_head *entry){__list_del(entry->prev, entry->next);entry->next = (void *) 0;entry->prev = (void *) 0;}/** * list_del_init - deletes entry from list and reinitialize it. * @entry: the element to delete from the list. */static  void list_del_init(struct list_head *entry){__list_del(entry->prev, entry->next);INIT_LIST_HEAD(entry); }/** * list_move - delete from one list and add as another's head * @list: the entry to move * @head: the head that will precede our entry */static  void list_move(struct list_head *list, struct list_head *head){        __list_del(list->prev, list->next);        list_add(list, head);}/** * list_move_tail - delete from one list and add as another's tail * @list: the entry to move * @head: the head that will follow our entry */static  void list_move_tail(struct list_head *list,  struct list_head *head){        __list_del(list->prev, list->next);        list_add_tail(list, head);}/** * list_empty - tests whether a list is empty * @head: the list to test. */static  int list_empty(struct list_head *head){return head->next == head;}static  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  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  void list_splice_init(struct list_head *list,    struct list_head *head){if (!list_empty(list)) {__list_splice(list, head);INIT_LIST_HEAD(list);}}/** * 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) \((type *)((char *)(ptr)-(unsigned long)(&((type *)0)->member)))/** * list_for_each-iterate over a list * @pos:the &struct list_head to use as a loop counter. * @head:the head for your list. */#define list_for_each(pos, head) \for (pos = (head)->next, prefetch(pos->next); pos != (head); \        pos = pos->next, prefetch(pos->next))/** * list_for_each_prev-iterate over a list backwards * @pos:the &struct list_head to use as a loop counter. * @head:the head for your list. */#define list_for_each_prev(pos, head) \for (pos = (head)->prev, prefetch(pos->prev); pos != (head); \        pos = pos->prev, prefetch(pos->prev))        /** * list_for_each_safe-iterate over a list safe against removal of list entry * @pos:the &struct list_head to use as a loop counter. * @n:another &struct list_head to use as temporary storage * @head:the head for your list. */#define list_for_each_safe(pos, n, head) \for (pos = (head)->next, n = pos->next; pos != (head); \pos = n, n = pos->next)/** * list_for_each_entry-iterate over list of given type * @pos:the type * to use as a loop counter. * @head:the head for your list. * @member:the name of the list_struct within the struct. */#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),\     prefetch(pos->member.next))/** * list_for_each_entry_safe - iterate over list of given type safe against removal of list entry * @pos:the type * to use as a loop counter. * @n:another type * to use as temporary storage * @head:the head for your list. * @member:the name of the list_struct within the struct. */#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))/** * list_for_each_entry_continue -       iterate over list of given type *                      continuing after existing point * @pos:        the type * to use as a loop counter. * @head:       the head for your list. * @member:     the name of the list_struct within the struct. */#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),\     prefetch(pos->member.next))//#endif /* __KERNEL__ || _LVM_H_INCLUDE */#endif

list.c

/**********************************DESCRIPTOR:double circular linked listAUTHOR: zhongjunDATA:20160111TIME:13:57***********************************/#include "stdio.h"#include <stdlib.h>#include <string.h>#include "list.h"typedef unsigned char anw_btaddr[6];//自定义的数据结构struct list_test_struct{struct list_headlist;int key;anw_btaddr remote_addr;};int find(anw_btaddr * dest_addr,anw_btaddr *addr){if((*dest_addr)[0] == (*addr)[0]&& (*dest_addr)[1] == (*addr)[1]&& (*dest_addr)[2] == (*addr)[2]&& (*dest_addr)[3] == (*addr)[3]&& (*dest_addr)[4] == (*addr)[4]&& (*dest_addr)[5] == (*addr)[5]){printf("Find it\n");return 1;}else{printf("not Find it\n");return 0;}}void main(){struct list_head list = {0};  //定义链表（头） struct list_head *pos = NULL; struct list_head *n = NULL; int i=0;anw_btaddr addr = {5,5,5,5,5,5};printf("定义链表\n"); printf("初始化链表！\r\n"); INIT_LIST_HEAD(&list);  //初始化链表（头尾相接，形成空链表循环） //判断链表是否为空 printf("判断链表是否为空：");  if(list_empty(&list)){ printf("空\r\n"); }else{ printf("非空\r\n"); } //批量添加节点 printf("批量添加节点：\r\n");  for(i=0;i<10;i++){ struct list_test_struct *st=(struct list_test_struct*)malloc(sizeof(struct list_test_struct)); st->key = i;memset(&st->remote_addr,i,6);list_add(&st->list, &list); } //显示列表所有节点 printf("显示列表所有节点：\r\n");   list_for_each(pos,&list){ struct list_test_struct *st=list_entry(pos,struct list_test_struct,list); printf( "\t node:key(%d)\r\n",st->key); } //释放所有节点 为addr 资源 printf("释放所有借点为addr资源！\r\n"); list_for_each_safe(pos,n,&list){ struct list_test_struct *st=list_entry(pos,struct list_test_struct,list); if(find(&(st->remote_addr),&addr)){list_del(pos);  //删除节点，删除节点必须在删除节点内存之前 free(st);   //释放节点内存 }} //显示列表所有节点 printf("显示列表所有节点：\r\n");   list_for_each(pos,&list){ struct list_test_struct *st=list_entry(pos,struct list_test_struct,list); printf( "\t node:key(%d)\r\n",st->key); } //释放所有节点资源 printf("释放所有节点资源！\r\n"); list_for_each_safe(pos,n,&list){ struct list_test_struct *st=list_entry(pos,struct list_test_struct,list); list_del(pos);  //删除节点，删除节点必须在删除节点内存之前 free(st);   //释放节点内存 } //显示列表所有节点 printf("显示列表所有节点：\r\n");   list_for_each(pos,&list){ struct list_test_struct *st=list_entry(pos,struct list_test_struct,list); printf( "\t node:key(%d)\r\n",st->key); } }

运行结果：

定义链表初始化链表！判断链表是否为空：空批量添加节点：显示列表所有节点：         node:key(9)         node:key(8)         node:key(7)         node:key(6)         node:key(5)         node:key(4)         node:key(3)         node:key(2)         node:key(1)         node:key(0)释放所有借点为addr资源！not Find itnot Find itnot Find itnot Find itFind itnot Find itnot Find itnot Find itnot Find itnot Find it显示列表所有节点：         node:key(9)         node:key(8)         node:key(7)         node:key(6)         node:key(4)         node:key(3)         node:key(2)         node:key(1)         node:key(0)释放所有节点资源！显示列表所有节点：Press any key to continue