kernel:list LIST_HEAD/LIST_HEAD_INIT/INIT_LIST_HEAD

本文探讨了Linux内核中LIST_HEAD宏的使用,如何通过LIST_HEAD(name)创建一个自引用的链表头,以及其与INIT_LIST_HEAD函数的等价性。宏观的简洁性和优雅性使得在内核代码中管理链表变得更为方便。
#define LIST_HEAD_INIT(name) { &(name), &(name) }


#define LIST_HEAD(name) \
struct list_head name = LIST_HEAD_INIT(name)


static inline void INIT_LIST_HEAD(struct list_head *list)
{
list->next = list;
list->prev = list;

}


When it is expended, 

LIST_HEAD(name)  comes to be

struct list_head name = {&(name), &(name)}

and since 

struct list_head {

struct list_head *next, *prev;

}

combine these two, we can symetrically get the means

(the same as we manually declare a global variable named *name*,

and call INIT_LIST_HEAD)

{

struct list_head name;

name.prev = &name;

name.next = &name;

}

Obviously, the use of macros is simple and elegant.

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值