内核链表

一、链表节点类型

typedef int (*CMP_t)(void *, void *);

typedef struct konde
{
    struct konde *ppre;
    struct konde *pnext;
}KNode_t;

typedef struct klink
{
    KNode_t *phead;
    int clen;
    pthread_mutex_t mutex;
}KLink_t;

二、内核链表的基本操作

1.创建

KLink_t *create_klink()
{
    KLink_t *pklink = (KLink_t *)malloc(sizeof(KLink_t));
    if(NULL == pklink)
    {
        perror("fail malloc");
        return NULL;
    }
    pklink->phead = NULL;
    pklink->clen = 0;
    pthread_mutex_init(&(pklink->mutex), NULL);

    return pklink;
}

2.头插

int push_klink_head(KLink_t *pklink, void *p)
{
    KNode_t *pnode = (KNode_t *)p;
    pnode->pnext = NULL;
    pnode->ppre = NULL;

    pnode->pnext = pklink->phead;
    if(pklink->phead != NULL)
    {
        pklink->phead->ppre = pnode;
    }

    pklink->phead = pnode;
    pklink->clen++;

    return 0;
}

3.判空

int is_empty_klink(KLink_t *pklink)
{
	return NULL == pklink->phead;
}

4.遍历

int push_klink_head(KLink_t *pklink, void *p)
{
    KNode_t *pnode = (KNode_t *)p;
    pnode->pnext = NULL;
    pnode->ppre = NULL;

    pnode->pnext = pklink->phead;
    if(pklink->phead != NULL)
    {
        pklink->phead->ppre = pnode;
    }

    pklink->phead = pnode;
    pklink->clen++;

    return 0;
}

5.尾插

int push_klink_tail(KLink_t *pklink, void *p)
{
    
    KNode_t *pnode = (KNode_t *)p;
    pnode->pnext = NULL;
    pnode->ppre = NULL;

    KNode_t *q = pklink->phead;
    if(!q)
    {
        push_klink_head(pklink, p);
    }
    else
    {
        while(q->pnext != NULL)
        {
            q = q->pnext;
        }
        q->pnext = pnode;
        pnode->ppre = q;
    }
    pklink->clen++;

    return 0;
}

6.头删

int pop_klink_head(KLink_t *pklink)
{
	if (is_empty_klink(pklink))
		return 0;

	KNode_t *pdel = pklink->phead;
	pklink->phead = pdel->pnext;
	if (pklink->phead != NULL)
	{
		pklink->phead->ppre = NULL;
	}
	free(pdel);
	pklink->clen--;

	return 1;
}

7..查找

KNode_t *find_klink(KLink_t *pklink, void *t, CMP_t pfun)
{
	KNode_t *pnode = pklink->phead;
	while (pnode != NULL)
	{
		if (pfun(t, pnode))
		{
			return pnode;
		}
		pnode = pnode->pnext;
	}

	return NULL;
}

8..销毁

void destroy_klink(KLink_t *pklink)
{
	while (!is_empty_klink(pklink))
	{
		pop_klink_head(pklink);
	}
	free(pklink);
}

练习：

flight.h

struct passager
{
    KNode_t node;
    char name[64];
    int flt_num;
    int sit_num;
    char card;
};

struct flight
{
    KNode_t node;
    int flt_num;
    char src[64];
    char dst[32];
};

extern struct passager *create_passager(char *name, int flt_num, int sit_num, char card);
extern struct flight *create_flight(int flt_num, char *src, char *dst);
extern void printf_passager(void *pnode);
extern void printf_flight(void *pnode);
extern int compare_by_card(void *t, void *pnode);
#endif

flight.c

​
struct passager *create_passager(char *name, int flt_num, int sit_num, char card)
{
    struct passager *p = (struct passager *)malloc(sizeof(struct passager));
    if(NULL == p)
    {
        perror("fail malloc");
        return NULL;
    }
    strcpy(p->name, name);
    p->flt_num = flt_num;
    p->sit_num = sit_num;
    p->card = card;

    return p;
}

void printf_passager(void *pnode)
{
    struct passager *p = (struct passager *)pnode;
    printf("%s %d %d %c\n", p->name, p->flt_num, p->sit_num, p->card);
}

struct flight *create_flight(int flt_num, char *src, char *dst)
{
    struct flight *p = (struct flight *)malloc(sizeof(struct flight));
    if(NULL == p)
    {
        perror("fail malloc");
        return NULL;
    }
    p->flt_num = flt_num;
    strcpy(p->src, src);
    strcpy(p->dst, dst);

    return p;
}

void printf_flight(void *pnode)
{
    struct flight *q = (struct flight *)pnode;
    printf("%d %s %s\n", q->flt_num, q->src, q->dst);
}

int compare_by_card(void *t, void *pnode)
{
	struct passager *p = (struct passager *)pnode;
	if (p->card == *((char *)t))
	{
		return 1;
	}
	return 0;
}

​