修改自linux/include/linux/list.h的链表模块

这是修改自linux/include/linux/list.h的代码,基本没有什么变化,双向链表在使用这个模块的时候操作很简单,
对于需要改写成链表的结构,改写也比较简单

/******************************************************************************
 SELF HEAD FILE
 ******************************************************************************
  File Name     : self_baselist.h
  Version       : Initial Draft
  Author        : zhangbin
  Created       : 2018/9/3
  Last Modified :
  Description   : copy from include/linux/list.h
  Function List :

  History       :
  1.Date        : 2018/9/3
    Author      : zhangbin
    Modification: Created file
  2.Date        : 2018/9/5
    Author      : zhangbin
    Modification: new->__c__new,因为在C++中new为关键子,设置为参数名时,编译不通过
**************************************************************************/
#ifndef __SELF_BASELIST_H__
#define __SELF_BASELIST_H__
#ifdef __cplusplus
extern "C"
{
#endif

#ifndef FALSE
#define  FALSE   (0)
#endif

#ifndef TRUE
#define  TRUE    (1)
#endif

#ifndef NULL
#define  NULL 0
#endif

#undef offsetof
#define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER)

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

/*
 * 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.
 */

#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 __c__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 *__c__new,
				      struct list_head *prev,
				      struct list_head *next)
	{
		next->prev = __c__new;
		__c__new->next = next;
		__c__new->prev = prev;
		prev->next = __c__new;
	}

/**
 * list_add - add a __c__new entry
 * @__c__new: __c__new entry to be added
 * @head: list head to add it after
 *
 * Insert a __c__new entry after the specified head.
 * This is good for implementing stacks.
 */
	static inline void list_add(struct list_head *__c__new,
				    struct list_head *head)
	{
		__list_add(__c__new, head, head->next);
	}

/**
 * list_add_tail - add a __c__new entry
 * @__c__new: __c__new entry to be added
 * @head: list head to add it before
 *
 * Insert a __c__new entry before the specified head.
 * This is useful for implementing queues.
 */
	static inline void list_add_tail(struct list_head *__c__new,
					 struct list_head *head)
	{
		__list_add(__c__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_entry(struct list_head *entry)
	{
		__list_del(entry->prev, entry->next);
	}

	static inline void list_del(struct list_head *entry)
	{
		__list_del(entry->prev, entry->next);
		entry->next = NULL;	//LIST_POISON1;
		entry->prev = NULL;	//LIST_POISON2;
	}

/**
 * list_replace - replace old entry by __c__new one
 * @old : the element to be replaced
 * @__c__new : the __c__new element to insert
 *
 * If @old was empty, it will be overwritten.
 */
	static inline void list_replace(struct list_head *old,
					struct list_head *__c__new)
	{
		__c__new->next = old->next;
		__c__new->next->prev = __c__new;
		__c__new->prev = old->prev;
		__c__new->prev->next = __c__new;
	}

	static inline void list_replace_init(struct list_head *old,
					     struct list_head *__c__new)
	{
		list_replace(old, __c__new);
		INIT_LIST_HEAD(old);
	}

/**
 * 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(entry);
		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_entry(list);
		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_entry(list);
		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);
	}

/**
 * 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) ({			\
	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_rotate_left - rotate the list to the left
 * @head: the head of the list
 */
	static inline void list_rotate_left(struct list_head *head)
	{
		struct list_head *first;

		if (!list_empty(head))
		{
			first = head->next;
			list_move_tail(first, head);
		}
	}

/**
 * list_is_singular - tests whether a list has just one entry.
 * @head: the list to test.
 */
	static inline int list_is_singular(const struct list_head *head)
	{
		return !list_empty(head) && (head->next == head->prev);
	}

	static inline void __list_cut_position(struct list_head *list,
					       struct list_head *head,
					       struct list_head *entry)
	{
		struct list_head *new_first = entry->next;
		list->next = head->next;
		list->next->prev = list;
		list->prev = entry;
		entry->next = list;
		head->next = new_first;
		new_first->prev = head;
	}

/**
 * list_cut_position - cut a list into two
 * @list: a __c__new list to add all removed entries
 * @head: a list with entries
 * @entry: an entry within head, could be the head itself
 *	and if so we won't cut the list
 *
 * This helper moves the initial part of @head, up to and
 * including @entry, from @head to @list. You should
 * pass on @entry an element you know is on @head. @list
 * should be an empty list or a list you do not care about
 * losing its data.
 *
 */
	static inline void list_cut_position(struct list_head *list,
					     struct list_head *head,
					     struct list_head *entry)
	{
		if (list_empty(head))
			return;
		if (list_is_singular(head) &&
		    (head->next != entry && head != entry))
			return;
		if (entry == head)
			INIT_LIST_HEAD(list);
		else
			__list_cut_position(list, head, entry);
	}

	static inline void __list_splice(const struct list_head *list,
					 struct list_head *prev,
					 struct list_head *next)
	{
		struct list_head *first = list->next;
		struct list_head *last = list->prev;

		first->prev = prev;
		prev->next = first;

		last->next = next;
		next->prev = last;
	}

/**
 * list_splice - join two lists, this is designed for stacks
 * @list: the __c__new list to add.
 * @head: the place to add it in the first list.
 */
	static inline void list_splice(const struct list_head *list,
				       struct list_head *head)
	{
		if (!list_empty(list))
			__list_splice(list, head, head->next);
	}

/**
 * list_splice_tail - join two lists, each list being a queue
 * @list: the __c__new list to add.
 * @head: the place to add it in the first list.
 */
	static inline void list_splice_tail(struct list_head *list,
					    struct list_head *head)
	{
		if (!list_empty(list))
			__list_splice(list, head->prev, head);
	}

/**
 * list_splice_init - join two lists and reinitialise the emptied list.
 * @list: the __c__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, head->next);
			INIT_LIST_HEAD(list);
		}
	}

/**
 * list_splice_tail_init - join two lists and reinitialise the emptied list
 * @list: the __c__new list to add.
 * @head: the place to add it in the first list.
 *
 * Each of the lists is a queue.
 * The list at @list is reinitialised
 */
	static inline void list_splice_tail_init(struct list_head *list,
						 struct list_head *head)
	{
		if (!list_empty(list))
		{
			__list_splice(list, head->prev, 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_last_entry - get the last 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_last_entry(ptr, type, member) \
	list_entry((ptr)->prev, type, member)

/**
 * list_first_entry_or_null - 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 if the list is empty, it returns NULL.
 */
#define list_first_entry_or_null(ptr, type, member) \
	(!list_empty(ptr) ? list_first_entry(ptr, type, member) : NULL)

/**
 * list_next_entry - get the next element in list
 * @pos:	the type * to cursor
 * @member:	the name of the list_struct within the struct.
 */
#define list_next_entry(pos, member) \
	list_entry((pos)->member.next, typeof(*(pos)), member)

/**
 * list_prev_entry - get the prev element in list
 * @pos:	the type * to cursor
 * @member:	the name of the list_struct within the struct.
 */
#define list_prev_entry(pos, member) \
	list_entry((pos)->member.prev, typeof(*(pos)), 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, head, member)				\
	for (pos = list_first_entry(head, typeof(*pos), member);	\
	     &pos->member != (head);					\
	     pos = list_next_entry(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_last_entry(head, typeof(*pos), member);		\
	     &pos->member != (head); 					\
	     pos = list_prev_entry(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_next_entry(pos, member);			\
	     &pos->member != (head);					\
	     pos = list_next_entry(pos, 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, head, member)		\
	for (pos = list_prev_entry(pos, member);			\
	     &pos->member != (head);					\
	     pos = list_prev_entry(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 (; &pos->member != (head);					\
	     pos = list_next_entry(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_first_entry(head, typeof(*pos), member),	\
		n = list_next_entry(pos, member);			\
	     &pos->member != (head); 					\
	     pos = n, n = list_next_entry(n, member))

/**
 * list_for_each_entry_safe_continue - continue list iteration safe against removal
 * @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_next_entry(pos, member), 				\
		n = list_next_entry(pos, member);				\
	     &pos->member != (head);						\
	     pos = n, n = list_next_entry(n, member))

/**
 * list_for_each_entry_safe_from - iterate over list from current point safe against removal
 * @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_next_entry(pos, member);					\
	     &pos->member != (head);						\
	     pos = n, n = list_next_entry(n, member))

/**
 * list_for_each_entry_safe_reverse - iterate backwards over list safe against removal
 * @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_last_entry(head, typeof(*pos), member),		\
		n = list_prev_entry(pos, member);			\
	     &pos->member != (head); 					\
	     pos = n, n = list_prev_entry(n, member))

#ifdef __cplusplus
}
#endif

#endif				//__SELF_BASELIST_H__

链表数据结构

	typedef struct echo_queue_t
	{
		/*
		   OBJ_ECHO_DATA data_obj;
		 */
		char		data[ECHO_PACKET_LEN];
		uint32_t  	len;
		uint32_t	id;
		uint32_t  	have_after;	//0-n剩余包数量
		/*
		   
		*/
		uint32_t	thread_id;	//线程id
		uint32_t	type;		//可能是协议类型
		void 		*param;		//伴随包的特殊参数,回调参数
		/*list */
		struct list_head list;
	} OBJ_ECHO_QUEUE;

	typedef struct echo_list_header_t
	{
		int lenth;
		pthread_mutexattr_t pthread_mutexattr;
		pthread_mutex_t pthread_mutex;
		OBJ_ECHO_QUEUE *queue;
	} OBJ_ECHO_LIST_HEADER;

push/pop

void echo_queue_push(OBJ_ECHO_LIST_HEADER * list_header,
			 OBJ_ECHO_QUEUE * data)
{
	if(list_header==NULL||data==NULL)
		return ;
	
	if(list_header->lenth>=1024)
	{
		pr_echo_queue_debug(LOG_WARNING,"queue is too long to full!!!\n");
		return ;
	}
	OBJ_ECHO_QUEUE *data__ =
	    (OBJ_ECHO_QUEUE *) malloc(sizeof(OBJ_ECHO_QUEUE));
	memcpy(data__, data, sizeof(OBJ_ECHO_QUEUE));
	//lock
	pthread_mutex_lock(&list_header->pthread_mutex);
	list_add(&data__->list, &list_header->queue->list);
	list_header->lenth++;
	pthread_mutex_unlock(&list_header->pthread_mutex);	
	//unlock
}

int echo_queue_pop(OBJ_ECHO_LIST_HEADER * list_header,
		       OBJ_ECHO_QUEUE * data)
{
	//判断是不是空
	OBJ_ECHO_QUEUE *data__ = NULL;
	//从后面首节点的前一个节点取
	//lock
	
	if (list_header==NULL||list_empty_careful(&list_header->queue->list))
		return -1;
	pthread_mutex_lock(&list_header->pthread_mutex);
	data__ =
	    list_last_entry(&list_header->queue->list, OBJ_ECHO_QUEUE,
			    list);

	list_del(&data__->list);
	list_header->lenth--;
	pthread_mutex_unlock(&list_header->pthread_mutex);
	memcpy(data, data__, sizeof(OBJ_ECHO_QUEUE));
	free(data__);
	return 0;
}