Linux内核没有单向链表,拒绝造轮子！如何移植并使用Linux内核的通用链表（附完整代码实现）...

//计算member在type中的位置

#define offsetof(type, member) (size_t)(&((type*)0)->member)

//根据member的地址获取type的起始地址

#define container_of(ptr, type, member) ({ \

const typeof(((type *)0)->member)*__mptr = (ptr); \

(type *)((char *)__mptr - offsetof(type, member)); })

/**

* list_entry - get the struct for this entry

* @ptr:the &struct list_head pointer.

* @type:the type of the struct this is embedded in.

* @member:the name of the list_struct within the struct.

*/

#define list_entry(ptr, type, member) \

container_of(ptr, type, member)

/**

* list_first_entry - get the first element from a list

* @ptr:the list head to take the element from.

* @type:the type of the struct this is embedded in.

* @member:the name of the list_struct within the struct.

*

* Note, that list is expected to be not empty.

*/

#define list_first_entry(ptr, type, member) \

list_entry((ptr)->next, type, member)

/**

* list_for_each-iterate over a list

* @pos:the &struct list_head to use as a loop cursor.

* @head:the head for your list.

*/

#define list_for_each(pos, head) \

for (pos = (head)->next; prefetch(pos->next), pos != (head); \

pos = pos->next)

/**

* __list_for_each-iterate over a list

* @pos:the &struct list_head to use as a loop cursor.

* @head:the head for your list.

*

* This variant differs from list_for_each() in that it's the

* simplest possible list iteration code, no prefetching is done.

* Use this for code that knows the list to be very short (empty

* or 1 entry) most of the time.

*/

#define __list_for_each(pos, head) \

for (pos = (head)->next; pos != (head); pos = pos->next)

/**

* list_for_each_prev-iterate over a list backwards

* @pos:the &struct list_head to use as a loop cursor.

* @head:the head for your list.

*/

#define list_for_each_prev(pos, head) \

for (pos = (head)->prev; prefetch(pos->prev), pos != (head); \

pos = pos->prev)

/**

* list_for_each_safe - iterate over a list safe against removal of list entry

* @pos:the &struct list_head to use as a loop cursor.

* @n:another &struct list_head to use as temporary storage

* @head:the head for your list.

*/

#define list_for_each_safe(pos, n, head) \

for (pos = (head)->next, n = pos->next; pos != (head); \

pos = n, n = pos->next)

/**

* list_for_each_entry-iterate over list of given type

* @pos:the type * to use as a loop cursor.

* @head:the head for your list.

* @member:the name of the list_struct within the struct.

*/

#define list_for_each_entry(pos, head, member)\

for (pos = list_entry((head)->next, typeof(*pos), member);\

prefetch(pos->member.next), &pos->member != (head); \

pos = list_entry(pos->member.next, typeof(*pos), member))

/**

* list_for_each_entry_reverse - iterate backwards over list of given type.

* @pos:the type * to use as a loop cursor.

* @head:the head for your list.

* @member:the name of the list_struct within the struct.

*/

#define list_for_each_entry_reverse(pos, head, member)\

for (pos = list_entry((head)->prev, typeof(*pos), member);\

prefetch(pos->member.prev), &pos->member != (head); \

pos = list_entry(pos->member.prev, typeof(*pos), member))

/**

* list_prepare_entry - prepare a pos entry for use in list_for_each_entry_continue()

* @pos:the type * to use as a start point

* @head:the head of the list

* @member:the name of the list_struct within the struct.

*

* Prepares a pos entry for use as a start point in list_for_each_entry_continue().

*/

#define list_prepare_entry(pos, head, member) \

((pos) ? : list_entry(head, typeof(*pos), member))

/**

* list_for_each_entry_continue - continue iteration over list of given type

* @pos:the type * to use as a loop cursor.

* @head:the head for your list.

* @member:the name of the list_struct within the struct.

*

* Continue to iterate over list of given type, continuing after

* the current position.

*/

#define list_for_each_entry_continue(pos, head, member) \

for (pos = list_entry(pos->member.next, typeof(*pos), member);\

prefetch(pos->member.next), &pos->member != (head);\

pos = list_entry(pos->member.next, typeof(*pos), member))

/**

* list_for_each_entry_from - iterate over list of given type from the current point

* @pos:the type * to use as a loop cursor.

* @head:the head for your list.

* @member:the name of the list_struct within the struct.

*

* Iterate over list of given type, continuing from current position.

*/

#define list_for_each_entry_from(pos, head, member) \

for (; prefetch(pos->member.next), &pos->member != (head);\

pos = list_entry(pos->member.next, typeof(*pos), member))

/**

* list_for_each_entry_safe - iterate over list of given type safe against removal of list entry

* @pos:the type * to use as a loop cursor.

* @n:another type * to use as temporary storage

* @head:the head for your list.

* @member:the name of the list_struct within the struct.

*/

#define list_for_each_entry_safe(pos, n, head, member)\

for (pos = list_entry((head)->next, typeof(*pos), member),\

n = list_entry(pos->member.next, typeof(*pos), member);\

&pos->member != (head); \

pos = n, n = list_entry(n->member.next, typeof(*n), member))

/**

* list_for_each_entry_safe_continue

* @pos:the type * to use as a loop cursor.

* @n:another type * to use as temporary storage

* @head:the head for your list.

* @member:the name of the list_struct within the struct.

*

* Iterate over list of given type, continuing after current point,

* safe against removal of list entry.

*/

#define list_for_each_entry_safe_continue(pos, n, head, member) \

for (pos = list_entry(pos->member.next, typeof(*pos), member), \

n = list_entry(pos->member.next, typeof(*pos), member);\

&pos->member != (head);\

pos = n, n = list_entry(n->member.next, typeof(*n), member))

/**

* list_for_each_entry_safe_from

* @pos:the type * to use as a loop cursor.

* @n:another type * to use as temporary storage

* @head:the head for your list.

* @member:the name of the list_struct within the struct.

*

* Iterate over list of given type from current point, safe against

* removal of list entry.

*/

#define list_for_each_entry_safe_from(pos, n, head, member) \

for (n = list_entry(pos->member.next, typeof(*pos), member);\

&pos->member != (head);\

pos = n, n = list_entry(n->member.next, typeof(*n), member))

/**

* list_for_each_entry_safe_reverse

* @pos:the type * to use as a loop cursor.

* @n:another type * to use as temporary storage

* @head:the head for your list.

* @member:the name of the list_struct within the struct.

*

* Iterate backwards over list of given type, safe against removal

* of list entry.

*/

#define list_for_each_entry_safe_reverse(pos, n, head, member)\

for (pos = list_entry((head)->prev, typeof(*pos), member),\

n = list_entry(pos->member.prev, typeof(*pos), member);\

&pos->member != (head); \

pos = n, n = list_entry(n->member.prev, typeof(*n), member))