使用内核链表实现的一个有头的循环链表，并使用其编写一个冒泡排序

include.h文件里都为常用的库：

#include <stdio.h>#include <stdlib.h>#include <string.h>#include <stdbool.h>#include <ctype.h>

macro.h中为常用的宏：

#pragma once#define offsetof(type,member)\((int)(&((type*)0)->member))#define container_of(ptr,type,member)\((type*)((char*)ptr-offsetof(type,member)))

hlist.h中为内核链表的定义：

#pragma once#include "macro.h"struct list_head{struct list_head *prev,*next;};#define INIT_LIST_HEAD(head)\struct list_head head={&head,&head}static inline void LIST_HEAD_INIT(struct list_head *node){node->prev=node;node->next=node;}/*   if list is empty ,return 1 */static inline int _is_list_empty(struct list_head *head){return ((head->next==head)&&(head->prev==head));}static inline void _add_list_head(struct list_head *new,struct list_head *prev,struct list_head *next){prev->next=new;new->prev=prev;next->prev=new;new->next=next;}static inline void add_list_from_head(struct list_head *new,struct list_head *head){_add_list_head(new,head,head->next);}static inline void add_list_from_tail(struct list_head *new,struct list_head *head){_add_list_head(new,head->prev,head);}static inline void _delete_list(struct list_head *prev,struct list_head *next){prev->next=next;next->prev=prev;}static inline void delete_list_head(struct list_head *node){_delete_list(node->prev,node->next);LIST_HEAD_INIT(node);}#define for_each(cur,head)\for(cur=(head)->next;cur!=head;cur=(cur)->next)#define for_each_safe(cur,tmp,head)\for(cur=(head)->next,tmp=(cur)->next;\cur!=(head);\cur=tmp,tmp=(tmp)->next)

list.h中为有头的循环链表的接口：

#pragma once#include "hlist.h"#include "include.h"struct list_node{struct list_head list;char data[];};struct list_info{struct list_head *head;void (*add)(struct list_info *info,const void *data_entry,size_t size);void (*add_tail)(struct list_info *info,const void *data_entry,size_t size);void (*del)(struct list_node *node);int (*is_empty)(struct list_info *info);struct list_node *(*search)(struct list_info *info,const void *data_entry,size_t size);};void init_list(struct list_info *info);void destroy_list(struct list_info *info);

list.c为有头循环链表的实现：

#include "list.h"static struct list_node *search_list(struct list_info *info,const void *data_entry,size_t size){struct list_head *cur,*tmp;struct list_node *p;for_each_safe(cur,tmp,info->head){p=container_of(cur,struct list_node,list);if(!memcmp(p->data,data_entry,size))break;}return p;}/*   if list is empty , return 1 */static int is_empty(struct list_info *info){return _is_list_empty(info->head);}static void add_list_node_head(struct list_info *info,const void *data_entry,size_t size){struct list_node *node=(struct list_node *)malloc(sizeof(struct list_node)+size);LIST_HEAD_INIT(&node->list);memcpy(node->data,data_entry,size);add_list_from_head(&node->list,info->head);}static void add_list_node_tail(struct list_info *info,const void *data_entry,size_t size){struct list_node *node=(struct list_node *)malloc(sizeof(struct list_node)+size);LIST_HEAD_INIT(&node->list);memcpy(node->data,data_entry,size);add_list_from_tail(&node->list,info->head);}/* delete the node according to the content  */static void del_list_node(struct list_node *node){delete_list_head(&node->list);free(node);}void init_list(struct list_info *info){info->head=(struct list_head *)malloc(sizeof(struct list_head));LIST_HEAD_INIT(info->head);info->add=add_list_node_head;info->add_tail=add_list_node_tail;info->del=del_list_node;info->is_empty=is_empty;info->search=search_list;}void destroy_list(struct list_info *info){struct list_node *p;while(!info->is_empty(info)){p=container_of(info->head->next,struct list_node,list);info->del(p);}free(info->head);}

test.c中为使用循环链表实现的一个冒泡排序：

#include "include.h"#include "list.h"#define LIST_LEN 10int cmp(const void *p1 , const void *p2, unsigned long size){return (*((int*)p1) - *((int*)p2));}void pop_sort(struct list_info *info, unsigned long size,int(*cmp)(const void * , const void *, unsigned long)){struct list_head *cur,*tmp;struct list_node *n;struct list_node *p ;char *d = (char *)malloc(size); unsigned long flag = 0;p = container_of(info->head->next, struct list_node, list);for_each_safe(cur, tmp, info->head){p = container_of(cur, struct list_node, list);for(; cur!=info->head ; cur=cur->next){n = container_of(cur , struct list_node , list);if( cmp(p->data, n->data, size)< 0 ){p = n;flag = 1;}}if(flag){memcpy(d, p->data, size);memcpy(p->data, container_of(tmp->prev, struct list_node ,list)->data, size);memcpy(container_of(tmp->prev, struct list_node ,list)->data, d, size);flag = 0;}}}int main(){struct list_info info;struct list_head *cur;struct list_node *n;init_list(&info);int arr[LIST_LEN]={2,44,7,45,77,56,234,9,8,0};int i ;for(i = 0 ; i<LIST_LEN ; ++i){info.add(&info, &arr[i], sizeof(int));}for_each(cur ,info.head){n = container_of(cur , struct list_node , list);printf("%d ", *((int*)n->data));}pop_sort(&info, sizeof(int), cmp);printf("\n");for_each(cur ,info.head){n = container_of(cur , struct list_node , list);printf("%d ", *((int*)n->data));}destroy_list(&info);return 0;}