linux内核数据结构-链式存储（2）

linklist.h文件

#ifndef _MYLINKLIST_H_
#define _MYLINKLIST_H_


typedef void LinkList;
/*
typedef struct _tag_LinkListNode LinkListNode;
struct _tag_LinkListNode
{
LinkListNode* next;
};
*/


typedef struct _tag_LinkListNode
{
struct _tag_LinkListNode* next;
}LinkListNode;


LinkList* LinkList_Create();


void LinkList_Destroy(LinkList* list);


void LinkList_Clear(LinkList* list);


int LinkList_Length(LinkList* list);


int LinkList_Insert(LinkList* list, LinkListNode* node, int pos);


LinkListNode* LinkList_Get(LinkList* list, int pos);


LinkListNode* LinkList_Delete(LinkList* list, int pos);


#endif

linklist.c文件

#include "stdio.h"
#include "stdlib.h"
#include "string.h"
#include "linklist.h"


typedef struct _tag_linklist 
{
LinkListNode header;
int length;
}Tlinklist;






LinkList* LinkList_Create()
{
Tlinklist *ret = NULL;
ret = (Tlinklist *)malloc(sizeof(Tlinklist));
if (ret == NULL)
{
return NULL;
}
memset(ret, 0, sizeof(Tlinklist));
ret->header.next = NULL;
ret->length = 0;
return ret;
}


void LinkList_Destroy(LinkList* list)
{
if (list == NULL)
{
return;
}
free(list);
return;
}


void LinkList_Clear(LinkList* list)
{
Tlinklist *Tlist = (Tlinklist *)list;
if (list == NULL)
{
return;
}
Tlist->length = 0;
Tlist->header.next = NULL;
return;
}


int LinkList_Length(LinkList* list)
{
Tlinklist *Tlist = (Tlinklist *)list;
if (list == NULL)
{
return -1;
}
return Tlist->length;
}


int LinkList_Insert(LinkList* list, LinkListNode* node, int pos)
{
LinkListNode *curent = NULL;
int i = 0;
Tlinklist *Tlist = (Tlinklist *)list;
if (list == NULL || node == NULL)
{
return -1;
}
if (pos<0 || pos>Tlist->length)
{
return -2;
}
curent = &Tlist->header;
for (i=0; i<pos; i++)
{
curent = curent->next;
}
node->next = curent->next;
curent->next = node;
Tlist->length ++;
return 0;
}


LinkListNode* LinkList_Get(LinkList* list, int pos)
{
LinkListNode *curent = NULL;
LinkListNode *ret = NULL;
int i = 0;
Tlinklist *Tlist = (Tlinklist *)list;
if (list == NULL)
{
return -1;
}
if (pos<0 || pos>Tlist->length)
{
return -2;
}
curent = &Tlist->header;
for (i=0; i<pos; i++)
{
curent = curent->next;
}
ret = curent->next;
return ret;
}


LinkListNode* LinkList_Delete(LinkList* list, int pos)
{
LinkListNode *curent = NULL;
LinkListNode *ret = NULL;
int i = 0;
Tlinklist *Tlist = (Tlinklist *)list;
if (list == NULL)
{
return -1;
}
if (pos<0 || pos>Tlist->length)
{
return -2;
}
curent = &Tlist->header;
for (i=0; i<pos; i++)
{
curent = curent->next;
}
ret = curent->next;
curent->next = ret->next;
Tlist->length--;
return ret;
}

链表测试.c

#include "stdio.h"
#include "stdlib.h"
#include "string.h"
#include "linklist.h"




typedef struct _Teacher 
{
LinkListNode node;
int name[128];
int age;
}Teacher;




void main()
{
int i = 0;
LinkList *list = NULL;
Teacher t1,t2, t3;
t1.age = 31;
t2.age = 32;
t3.age = 33;
list = LinkList_Create();


LinkList_Insert(list, (LinkListNode *)&t1, LinkList_Length(list));
LinkList_Insert(list, (LinkListNode *)&t2, LinkList_Length(list));
LinkList_Insert(list, (LinkListNode *)&t3, LinkList_Length(list));


for (i=0; i<LinkList_Length(list); i++)
{
Teacher *temp = (Teacher *)LinkList_Get(list, i);
if (temp != NULL)
{
printf("temp:%d", temp->age);
}
}


while (LinkList_Length(list) > 0)
{
LinkList_Delete(list, 0);
}


LinkList_Destroy(list);
/*
LinkList* LinkList_Create();


void LinkList_Destroy(LinkList* list);


void LinkList_Clear(LinkList* list);


int LinkList_Length(LinkList* list);


int LinkList_Insert(LinkList* list, LinkListNode* node, int pos);


LinkListNode* LinkList_Get(LinkList* list, int pos);


LinkListNode* LinkList_Delete(LinkList* list, int pos);
*/
system("pause");
}