list.h学习心得与总结

在哪些地方可以用到:

底层基础模块开发会用到。

 

1，使用宏非常方便。
使用LIST_HEAD_INIT，LIST_HEAD来定义链表指针。

INIT_LIST_HEAD，方便了初始化。

使用 list_entry获得整体结构体的指针

使用list_for_each来遍历整个链表

使用list_for_each_prev来逆向遍历链表

使用list_for_each_entry 来遍历整个链表的结构体

使用list_for_each_safe来防止删除时导致的异常

2，接口定义：

list_add在某个元素前面添加内容

list_add_tail在某个元素尾部添加内容

list_del删除某个元素

list_del_init把这个元素从原来链表中删除，并重新初始化他

list_move把一个元素从一个链表移到另外一个链表的头部

list_move_tail把一个元素从一个链表移到另外一个链表的尾部

list_splice合并两个链表

list_splice_init合并两个链表，并重新初始化

 

/****************************************************************************** * list.h: * * Copyright 2009 - 2100 HANGZHOU PEGVISION Technology Co.,Ltd. * * DESCRIPTION: * * modification history * -------------------- * 01a, 2009.11.23, Create * -------------------- ******************************************************************************/ #ifndef _LINUX_LIST_H #define _LINUX_LIST_H ///@todo 不支持cache预取 /n[Yomi, 3/9/2004] #define __PREFETCH__(x) 1 #define __INLINE__ inline //#if defined(__KERNEL__) || defined(_LVM_H_INCLUDE) //#include <linux/prefetch.h> /* * Simple doubly linked list implementation. * * Some of the internal functions ("__xxx") are useful when * manipulating whole lists rather than single entries, as * sometimes we already know the next/prev entries and we can * generate better code by using them directly rather than * using the generic single-entry routines. */ typedef struct list_head { struct list_head *next, *prev; } list_t; #define LIST_HEAD_INIT(name) { &(name), &(name) } #define LIST_HEAD(name) / struct list_head name = LIST_HEAD_INIT(name) #define INIT_LIST_HEAD(ptr) do { / (ptr)->next = (ptr); (ptr)->prev = (ptr); / } while (0) /* * Insert a new entry between two known consecutive entries. * * This is only for internal list manipulation where we know * the prev/next entries already! */ static void __INLINE__ __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) { next->prev = new; new->next = next; new->prev = prev; prev->next = new; } /** * list_add - add a new entry * @new: new entry to be added * @head: list head to add it after * * Insert a new entry after the specified head. * This is good for implementing stacks. */ static __INLINE__ void list_add(struct list_head *new, struct list_head *head) { __list_add(new, head, head->next); } /** * list_add_tail - add a new entry * @new: new entry to be added * @head: list head to add it before * * Insert a new entry before the specified head. * This is useful for implementing queues. */ static __INLINE__ void list_add_tail(struct list_head *new, struct list_head *head) { __list_add(new, head->prev, head); } /* * Delete a list entry by making the prev/next entries * point to each other. * * This is only for internal list manipulation where we know * the prev/next entries already! */ static __INLINE__ void __list_del(struct list_head *prev, struct list_head *next) { next->prev = prev; prev->next = next; } /** * list_del - deletes entry from list. * @entry: the element to delete from the list. * Note: list_empty on entry does not return true after this, the entry is in an undefined state. */ static __INLINE__ void list_del(struct list_head *entry) { __list_del(entry->prev, entry->next); entry->next = (void *) 0; entry->prev = (void *) 0; } /** * list_del_init - deletes entry from list and reinitialize it. * @entry: the element to delete from the list. */ static __INLINE__ void list_del_init(struct list_head *entry) { __list_del(entry->prev, entry->next); INIT_LIST_HEAD(entry); } /** * list_move - delete from one list and add as another's head * @list: the entry to move * @head: the head that will precede our entry */ static __INLINE__ void list_move(struct list_head *list, struct list_head *head) { __list_del(list->prev, list->next); list_add(list, head); } /** * list_move_tail - delete from one list and add as another's tail * @list: the entry to move * @head: the head that will follow our entry */ static __INLINE__ void list_move_tail(struct list_head *list, struct list_head *head) { __list_del(list->prev, list->next); list_add_tail(list, head); } /** * list_empty - tests whether a list is empty * @head: the list to test. */ static __INLINE__ int list_empty(struct list_head *head) { return head->next == head; } static __INLINE__ void __list_splice(struct list_head *list, struct list_head *head) { struct list_head *first = list->next; struct list_head *last = list->prev; struct list_head *at = head->next; first->prev = head; head->next = first; last->next = at; at->prev = last; } /** * list_splice - join two lists * @list: the new list to add. * @head: the place to add it in the first list. */ static __INLINE__ void list_splice(struct list_head *list, struct list_head *head) { if (!list_empty(list)) __list_splice(list, head); } /** * list_splice_init - join two lists and reinitialise the emptied list. * @list: the new list to add. * @head: the place to add it in the first list. * * The list at @list is reinitialised */ static __INLINE__ void list_splice_init(struct list_head *list, struct list_head *head) { if (!list_empty(list)) { __list_splice(list, head); INIT_LIST_HEAD(list); } } /** * 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) / ((type *)((char *)(ptr)-(unsigned long)(&((type *)0)->member))) /** * list_for_each - iterate over a list * @pos: the &struct list_head to use as a loop counter. * @head: the head for your list. */ #define list_for_each(pos, head) / for (pos = (head)->next, __PREFETCH__(pos->next); pos != (head); / pos = pos->next, __PREFETCH__(pos->next)) /** * __list_for_each - iterate over a list * @pos: the &struct list_head to use as a loop counter. * @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 counter. * @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, __PREFETCH__(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 counter. * @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 counter. * @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), / __PREFETCH__(pos->member.next)) //#endif /* __KERNEL__ || _LVM_H_INCLUDE */ #endif