内核中链表的实用方法以及简单的demo代码,C代码库,德仔网

代码语言

代码分类

【C】内核中链表的实用方法以及简单的demo

作者:bingo125 / 发布于2013/5/6/ 637

内核中链表的实用方法以及简单的demo


	#include <stdio.h>
	#include <assert.h>
	#include <stdlib.h>
	struct list
	{
	struct list* pri;
	struct list* next;

	};
	int list_init(list* head)
	{
	assert(head != NULL);
	head->next = NULL;
	head->pri = head;
	return 0;
	}
	int list_add_tail(list* head, list* pos)
	{
	assert(head != NULL||pos != NULL);
	struct list * tail = head;
	while (tail->next != NULL)
	{
	 tail = tail->next;
	}
	pos->next = NULL;
	pos->pri = tail;
	tail->next = pos;
	return 0;
	}
	//如容许对head 节点进行del操作
	int list_del(list* head, list* pos)
	{
	// 判断pos 不为头节点
	assert(head != NULL||pos != NULL||pos != head);
	if (pos != head)
	{
	 pos->pri->next = pos->next;
	 if(pos->next != NULL){
	 pos->next->pri = pos->pri;
	 }
	 //当删除最后一个元素的时候，只需要将前一个节点的最后next置为null且这一步已经做了，于是需要任何操作
	}
	else // 当前链表有多个链
	{
	 head = head->next;
	 head->pri = head;
	}
	return 0;
	}
	int list_destory(list*head)
	{
	head->next = NULL;
	head->pri = NULL;
	return 0;
	}
	typedef void* (*entery)(list * pos);
	void * list_entery(list * pos, entery fnEntery)
	{
	assert(pos == NULL || fnEntery == NULL);
	return fnEntery(pos);
	}
	#define offsetof(s,m) (size_t)&(((s *)0)->m)
	#define container_of(ptr, type, member) ({const typeof( ((type *)0)->member ) *__mptr = (ptr);\
	 (type *)( (char *)__mptr - offsetof(type,member) );})

	typedef struct strcut
	{
	int num;
	struct list list;
	} demo, *pDemo;

	int main(int argc, char **argv)
	{
	struct list head;
	int score,num;
	list_init(&head);
	printf("please set the number of student \n");
	scanf("%d", &num);
	for (int i = 0; i < num; i++)
	{
	 pDemo newDemo = (pDemo) malloc((sizeof(demo)));
	 if (newDemo == NULL)
	 {
	 printf("no enough mem\n");
	 goto FREEALL;
	 }
	 printf("set score for them %d \n",i);
	 scanf("%d",&score );
	 newDemo->num = score;
	 list_add_tail(&head,&newDemo->list);
	}
	// after all ,we show it
	for(list * pos = head.next;pos!=NULL;pos = pos->next )
	{

	 pDemo tmp = container_of(pos,demo,list);
	 printf("%d \n",tmp->num);
	}

	FREEALL :
	struct list *pos;
	for(pos = head.next;pos!=NULL;pos = pos->next )
	{
	 pDemo tmp = container_of(pos,demo,list);
	 list_del(&head, pos);
	 free(tmp);
	}
	list_destory(&head);
	return 0;
	}

评论列表

本站所提供的代码，版权归原作者所有，若有侵犯作者版权，请与我们联系，我们将立即删除或修改。谢谢!
本站所有代码发布及提供者。

试试其它关键字

同语言下

可能有用的

bingo125贡献的其它代码(2)