5.0/list.h
/*
 * Insert a new_entry entry between two known consecutive entries.
 *
 * This is only for internal list manipulation where we know
 * the prev/next entries already!
 */
Insert a new_entry entry between two known consecutive entries.
This is only for internal list manipulation where we know
the prev/next entries already!
Insert a new_entry 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 * new_entry,
    struct list_head * prev,
    struct list_head * next)
{
    next->prev = new_entry;
    new_entry->next = next;
    new_entry->prev = prev;
    prev->next = new_entry;
}
static inline void __list_add ( struct list_head * new_entry , struct list_head * prev , struct list_head * next ) { next -> prev = new_entry ; new_entry -> next = next ; new_entry -> prev = prev ; prev -> next = new_entry ; }
Insert a new_entry entry between two known consecutive entries.
Insert a new_entry entry between two known consecutive entries .