* Insert a new entry between two known consecutive entries. * * This is only for internal list manipulation where we know * the prev/next entries already! */
| 80 | * the prev/next entries already! |
| 81 | */ |
| 82 | static inline void __list_add(struct list_head *_new, |
| 83 | struct list_head *prev, |
| 84 | struct list_head *next) |
| 85 | { |
| 86 | next->prev = _new; |
| 87 | _new->next = next; |
| 88 | _new->prev = prev; |
| 89 | prev->next = _new; |
| 90 | } |
| 91 | |
| 92 | /** |
| 93 | * list_add_tail - add a new entry |