* Insert a new entry between two known consecutive entries. * * This is only for internal list manipulation where we know * the prev/next entries already! */
| 49 | * the prev/next entries already! |
| 50 | */ |
| 51 | static inline void __list_add(struct list_head *new_entry, |
| 52 | struct list_head *prev, |
| 53 | struct list_head *next) |
| 54 | { |
| 55 | next->prev = new_entry; |
| 56 | new_entry->next = next; |
| 57 | new_entry->prev = prev; |
| 58 | prev->next = new_entry; |
| 59 | } |
| 60 | |
| 61 | /** |
| 62 | * list_add - add a new entry |
no outgoing calls
no test coverage detected