实现了一个简单方便使用的双链表结构。是修改linux 2.6 kernel 中 list.h 得来的。
- /**
- * macro.h - common macro define.
- *
- * Author:jta , 2008.6
- *
- */
- #ifndef _MACRO_H_
- #define _MACRO_H_
- /*
- * common primary data type operator.
- */
- #define ARRAY_SIZE(x) (sizeof(x) / sizeof((x)[0]))
- #define ALIGN(x,a) (((x)+(a)-1)&~((a)-1))
- #define FIELD_SIZEOF(t, f) (sizeof(((t*)0)->f))
- #define roundup(x, y) ((((x) + ((y) - 1)) / (y)) * (y))
- #ifndef offsetof
- /**
- * return a offset of member in struct.
- */
- #define offsetof(TYPE,MEMBER) ( (int)(&((TYPE*)0)->MEMBER) )
- #endif
- /**
- * container_of - cast a member of a structure out to the containing structure
- * @ptr: the pointer to the member.
- * @type: the type of the container struct this is embedded in.
- * @member: the name of the member within the struct.
- *
- */
- #define container_of(ptr, type, member) ( /
- (type *)( (char *)ptr - offsetof(type,member) ) )
- #define bzero( p , len) memset( p, 0, len )
- #endif /*_MACRO_H_*/
这里只用到了offsetof 和 container_of 两个宏。
#define offsetof(TYPE,MEMBER) ( (int)(&((TYPE*)0)->MEMBER) )
宏offsetof计算结构体成员在其结构体中的地址偏移量。
#define container_of(ptr, type, member) ( /
(type *)( (char *)ptr - offsetof(type,member) ) )
宏 container_of由结构体中某个成员地址计算结构体的起始地址。
例如有以下结构体:
- struct my_data
- {
- int this;
- char other;
- ...
- struct list_head list;
- }data;
&data 等于 container_of(&(data.other), struct my_data, other) ;
- #ifndef _LIST_H_
- #define _LIST_H_
- #include "macrodef.h"
- /*
- * Simple doubly linked list implementation.
- *
- * from linux kernel 2.6, modified by jta 2008.6
- *
- * 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.
- */
- struct list_head {
- struct list_head *next, *prev;
- };
- #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;
- }
- /*
- * 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 inline void __list_add(struct list_head *pnew,
- struct list_head *prev,
- struct list_head *next)
- {
- next->prev = pnew;
- pnew->next = next;
- pnew->prev = prev;
- prev->next = pnew;
- }
- /**
- * list_add - add a new entry
- * @head: list head to add it after
- * @new: new entry to be added
- *
- * Insert a new entry after the specified head.
- * This is good for implementing stacks.
- */
- static inline void list_add(struct list_head *pnew, struct list_head *head)
- {
- __list_add(pnew, 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 *pnew, struct list_head *head)
- {
- __list_add(pnew, 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 = NULL;
- entry->prev = NULL;
- }
- /**
- * 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_replace - replace old entry by new one
- * @old : the element to be replaced
- * @new : the new element to insert
- *
- * If @old was empty, it will be overwritten.
- */
- static inline void list_replace(struct list_head *old,
- struct list_head *pnew)
- {
- pnew->next = old->next;
- pnew->next->prev = pnew;
- pnew->prev = old->prev;
- pnew->prev->next = pnew;
- }
- static inline void list_replace_init(struct list_head *old,
- struct list_head *pnew)
- {
- list_replace(old, pnew);
- INIT_LIST_HEAD(old);
- }
- /**
- * 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_is_last - tests whether @list is the last entry in list @head
- * @list: the entry to test
- * @head: the head of the list
- */
- static inline int list_is_last(const struct list_head *list,
- const struct list_head *head)
- {
- return list->next == head;
- }
- /**
- * list_empty - tests whether a list is empty
- * @head: the list to test.
- */
- static inline int list_empty(const struct list_head *head)
- {
- return head->next == head;
- }
- /**
- * list_empty_careful - tests whether a list is empty and not being modified
- * @head: the list to test
- *
- * Description:
- * tests whether a list is empty _and_ checks that no other CPU might be
- * in the process of modifying either member (next or prev)
- *
- * NOTE: using list_empty_careful() without synchronization
- * can only be safe if the only activity that can happen
- * to the list entry is list_del_init(). Eg. it cannot be used
- * if another CPU could re-list_add() it.
- */
- static inline int list_empty_careful(const struct list_head *head)
- {
- struct list_head *next = head->next;
- return (next == head) && (next == head->prev);
- }
- 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) /
- 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; 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; 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_prev_safe - iterate over a list backwards 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_prev_safe(pos, n, head) /
- for (pos = (head)->prev, n = pos->prev; /
- pos != (head); pos = n, n = pos->prev)
- /**
- * 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, type, head, member) /
- for ( pos = list_entry((head)->next, type, member); /
- &pos->member != (head); /
- pos = list_entry((pos->member).next, type, 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, type, head, member) /
- for (pos = list_entry((head)->prev, type, member); /
- &pos->member != (head); /
- pos = list_entry(pos->member.prev, type, 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, type, head, member) /
- ((pos) ? : list_entry(head, type, 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, type, head, member) /
- for (pos = list_entry(pos->member.next, type, member); /
- &pos->member != (head); /
- pos = list_entry(pos->member.next, type, member))
- /**
- * list_for_each_entry_continue_reverse - iterate backwards from the given 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.
- *
- * Start to iterate over list of given type backwards, continuing after
- * the current position.
- */
- #define list_for_each_entry_continue_reverse(pos, type, head, member) /
- for (pos = list_entry(pos->member.prev, type, member); /
- &pos->member != (head); /
- pos = list_entry(pos->member.prev, type, 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, type, head, member) /
- for (; &pos->member != (head); /
- pos = list_entry(pos->member.next, type, 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, type, head, member) /
- for (pos = list_entry((head)->next, type, member), /
- n = list_entry(pos->member.next, type, member); /
- &pos->member != (head); /
- pos = n, n = list_entry(n->member.next, type, 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, type, head, member) /
- for (pos = list_entry(pos->member.next, type, member), /
- n = list_entry(pos->member.next, type, member); /
- &pos->member != (head); /
- pos = n, n = list_entry(n->member.next, type, 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, type, head, member) /
- for (n = list_entry(pos->member.next, type, member); /
- &pos->member != (head); /
- pos = n, n = list_entry(n->member.next, type, 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, type, head, member) /
- for (pos = list_entry((head)->prev, type, member), /
- n = list_entry(pos->member.prev, type, member); /
- &pos->member != (head); /
- pos = n, n = list_entry(n->member.prev, type, member))
- #endif /* _LIST_H_ */