linux-arkmicro/buildroot-external/package/demo-v4l2-1668/include/ark_list.h

#ifndef __ARK_LIST_H__
#define __ARK_LIST_H__

#ifdef __cplusplus
extern "C" {
#endif

//#define LIST_MOVE_REPLACE_CUT_SPLICE   

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

/** 
   * 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 -offsetof0(type,member))


#define LIST_POISON1    NULL
#define LIST_POISON2    NULL


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

/** 
   * 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_HEAD(name) = { &(name), &(name) }
 * init the struct list_head, next = prev = &name
 */
#define LIST_HEAD_INIT(name) { &(name), &(name) }

#define LIST_HEAD(name) \
    struct list_head name = LIST_HEAD_INIT(name)

/**
 * INIT_LIST_HEAD is a fun for init list 
 * LIST_HEAD_INIT is macro for init list
 */
static void INIT_LIST_HEAD(struct list_head *list)
{
    list->next = list;
    list->prev = list;
}

/** 
 * 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; pos != (head); pos = pos->next)

/** 
 * 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_r    -    iterate over a list reversely 
 * @pos:    the &struct list_head to use as a loop counter. 
 * @head:    the head for your list. 
 */
#define list_for_each_r(pos, head) \
        for (pos = (head)->prev; pos != (head); pos = pos->prev)
        
        
/* 
 * 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 __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
 * @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 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 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!
 * The caller must free the memerry.
 */
static 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 void list_del(struct list_head *entry)
{
        __list_del(entry->prev, entry->next);
        entry->next = LIST_POISON1;
        entry->prev = LIST_POISON2;
}

/**
 * list_del_init - deletes entry from list and reinitialize it.
 * @entry: the element to delete from the list.
 */
static  void list_del_init(struct list_head *entry)
{
        __list_del(entry->prev, entry->next);
        INIT_LIST_HEAD(entry);
}


/**
 * 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 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 int list_empty_careful(const struct list_head *head)
{
        struct list_head *next = head->next;
        return (next == head) && (next == head->prev);
}

/**
 * list_is_singular - tests whether a list has just one entry.
 * @head: the list to test.
 */

static  int list_is_singular(const struct list_head *head)
{
        return !list_empty(head) && (head->next == head->prev);
}


/**************************************************************************************
 *
 *                                                 LIST_MOVE_REPLACE_CUT_SPLICE
 *
 ***************************************************************************************
 */
#ifdef LIST_MOVE_REPLACE_CUT_SPLICE

/**
 * 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 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 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 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 void list_move_tail(struct list_head *list,
                  struct list_head *head)
{
        __list_del(list->prev, list->next);
        list_add_tail(list, head);
}

static  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 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 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);
}


/**
 * add list between prev and next
 */
static 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 new list to add. 
 * @head: the place to add it in the first list. 
 */
static 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 new list to add. 
 * @head: the place to add it in the first list. 
 */
static 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 new list to add. * @head: the place to add it in the first list. 
* 
* The list at @list is reinitialised 
*/
static 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 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 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);
        }
}

#endif

#ifdef __cplusplus
}
#endif


#endif// __ARK_LIST_H__