linux内核链表提取

最新推荐文章于 2023-09-21 19:34:50 发布

jiangzhuzhu

最新推荐文章于 2023-09-21 19:34:50 发布

阅读量361

点赞数

分类专栏： linux 项目积累文章标签： linux内核 list struct each 测试

本文链接：https://blog.csdn.net/jiangzhuzhu/article/details/6565152

版权

linux 同时被 2 个专栏收录

23 篇文章 0 订阅

订阅专栏

项目积累

8 篇文章 0 订阅

订阅专栏

list.h

#ifndef IF_LIST
#define IF_LIST

#define LIST_HEAD_INIT(x) list_head x={&x, &x}
#define LIST_HEAD_INIT_STATIC(x) static LIST_HEAD_INIT(x)

struct __list_head
{
	struct __list_head* prev;
	struct __list_head* next;
};

typedef struct __list_head list_head;

inline int list_empty(list_head* head);
inline void list_add(list_head* head, list_head* t);
inline void list_add_tail(list_head* head, list_head* t);
inline void list_del(list_head* t);
inline list_head* list_first(list_head* t);
inline list_head* list_takefirst(list_head* head);
inline int list_count(list_head* t);
inline void list_init(list_head* head);

#define list_entry(p, t, list) /
	(t*)((char*)p - (char*)(&(((t*)0)->list)))

#define list_for_each(p, x) /
	for(p=(x)->next;p!=(x);p=p->next)


#endif

list.c

#include "list.h"

inline int list_empty(list_head* head)
{
	return head->next == head;
}

inline void list_add(list_head* head, list_head* t)
{
	list_head* tmp = head->next;
	t->prev = head;
	t->next = tmp;
	tmp->prev = t;
	head->next = t;
}

inline void list_add_tail(list_head* head, list_head* t)
{
	t->prev = head->prev;
	t->next = head;
	t->prev->next = t;
	head->prev = t;
}

inline void list_del(list_head* t)
{
	t->prev->next = t->next;
	t->next->prev = t->prev;
}

inline list_head* list_first(list_head* t)
{
	return list_empty(t)?0:t->next;
}

inline list_head* list_takefirst(list_head* head)
{
	list_head* ret = head->next;
	list_del(ret);
	return ret;
}

inline int list_count(list_head* t)
{
	int ret = 0;
	list_head* head = t;
	while(t->next != head)
	{
		t=t->next;
		++ret;
	}
	return ret;
}

inline void list_init(list_head* head)
{
	head->next = head->prev = head;
}

测试代码
main.c

#include <stdlib.h>
#include "list.h"
#include <string.h>
LIST_HEAD_INIT (nics);

typedef struct
{
  list_head list;
  char *name;
  list_head addr_list;
  int addr;
  int mask;
  int flags;
} nic_info;

int main(){
	nic_info* nic = (nic_info*)malloc(sizeof(nic_info));
	nic->name = strdup("eth0");
	nic->addr = 0;
	nic->mask = 0;
	nic->flags = 0;
	list_add(&nics,&(nic->list));

	list_head* p;
	list_for_each(p,&nics)
	{
		nic_info* r = list_entry(p, nic_info, list);
		printf("%s/n",r->name);
		printf("%d/n",r->addr);
		printf("%d/n",r->mask);
		printf("%d/n",r->flags);
	}

	printf("nics's length is %d/n",list_count(&nics));

	list_head* t = (list_head*)list_takefirst(&nics);
	if(!list_empty(&nics))
		printf("nics is empty");
	else{
		nic_info* r = list_entry(t, nic_info, list);
		printf("%s/n",r->name);
        printf("%d/n",r->addr);
		printf("%d/n",r->mask);
		printf("%d/n",r->flags);
	}

	printf("nics's length is %d/n",list_count(&nics));
}