list_head

原创于 2014-05-23 22:08:45 发布 · 490 阅读

0 ·

CC 4.0 BY-SA版权

C/C++ 专栏收录该内容

3 篇文章

订阅专栏

本文介绍了一种名为list_head的数据结构，并详细解释了如何使用C语言中的宏定义来遍历包含这种结构体元素的链表。通过具体的宏定义示例，包括list_entry和list_for_each_entry，读者可以了解到如何在实际编程中有效地操作链表。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

struct list_head {
	struct list_head *prev, *next;
};

/* Get an entry from the list 
 * 	ptr - the address of this list_head element in "type" 
 * 	type - the data type that contains "member"
 * 	member - the list_head element in "type" 
 */
#define list_entry(ptr, type, member) \
	((type *)((char *)(ptr) - (unsigned long)(&((type *)0L)->member)))

/* Get each entry from a list
 *	pos - A structure pointer has a "member" element
 *	head - list head
 *	member - the list_head element in "pos"
 */
#define list_for_each_entry(pos, head, member)				\
	for (pos = list_entry((head)->next, typeof(*pos), member);	\
	     &pos->member != (head);					\
	     pos = list_entry(pos->member.next, typeof(*pos), member))