|
Packit |
eace71 |
#ifndef __LIST_H__
|
|
Packit |
eace71 |
#define __LIST_H__
|
|
Packit |
eace71 |
|
|
Packit |
eace71 |
#include <stddef.h>
|
|
Packit |
eace71 |
/* taken from linux kernel */
|
|
Packit |
eace71 |
|
|
Packit |
eace71 |
#undef offsetof
|
|
Packit |
eace71 |
#ifdef __compiler_offsetof
|
|
Packit |
eace71 |
#define offsetof(TYPE,MEMBER) __compiler_offsetof(TYPE,MEMBER)
|
|
Packit |
eace71 |
#else
|
|
Packit |
eace71 |
#define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER)
|
|
Packit |
eace71 |
#endif
|
|
Packit |
eace71 |
|
|
Packit |
eace71 |
#define list_container_of(ptr, type, member) ({ \
|
|
Packit |
eace71 |
const typeof( ((type *)0)->member ) *__mptr = (ptr); \
|
|
Packit |
eace71 |
(type *)( (char *)__mptr - offsetof(type,member) );})
|
|
Packit |
eace71 |
|
|
Packit |
eace71 |
struct list_head {
|
|
Packit |
eace71 |
struct list_head *next, *prev;
|
|
Packit |
eace71 |
};
|
|
Packit |
eace71 |
|
|
Packit |
eace71 |
#define LIST_HEAD_INIT(name) { &(name), &(name) }
|
|
Packit |
eace71 |
|
|
Packit |
eace71 |
#define LIST_HEAD(name) \
|
|
Packit |
eace71 |
struct list_head name = LIST_HEAD_INIT(name)
|
|
Packit |
eace71 |
|
|
Packit |
eace71 |
static inline void INIT_LIST_HEAD(struct list_head *list)
|
|
Packit |
eace71 |
{
|
|
Packit |
eace71 |
list->next = list;
|
|
Packit |
eace71 |
list->prev = list;
|
|
Packit |
eace71 |
}
|
|
Packit |
eace71 |
|
|
Packit |
eace71 |
static inline int list_empty(const struct list_head *head)
|
|
Packit |
eace71 |
{
|
|
Packit |
eace71 |
return head->next == head;
|
|
Packit |
eace71 |
}
|
|
Packit |
eace71 |
|
|
Packit |
eace71 |
#define list_entry(ptr, type, member) \
|
|
Packit |
eace71 |
list_container_of(ptr, type, member)
|
|
Packit |
eace71 |
|
|
Packit |
eace71 |
#define list_first_entry(ptr, type, member) \
|
|
Packit |
eace71 |
list_entry((ptr)->next, type, member)
|
|
Packit |
eace71 |
|
|
Packit |
eace71 |
#define list_first_entry_or_null(ptr, type, member) \
|
|
Packit |
eace71 |
(!list_empty(ptr) ? list_first_entry(ptr, type, member) : NULL)
|
|
Packit |
eace71 |
|
|
Packit |
eace71 |
#define list_for_each(pos, head) \
|
|
Packit |
eace71 |
for (pos = (head)->next; pos != (head); pos = pos->next)
|
|
Packit |
eace71 |
|
|
Packit |
eace71 |
#define list_for_each_entry(pos, head, member) \
|
|
Packit |
eace71 |
for (pos = list_entry((head)->next, typeof(*pos), member); \
|
|
Packit |
eace71 |
&pos->member != (head); \
|
|
Packit |
eace71 |
pos = list_entry(pos->member.next, typeof(*pos), member))
|
|
Packit |
eace71 |
|
|
Packit |
eace71 |
#define list_for_each_entry_safe(pos, n, head, member) \
|
|
Packit |
eace71 |
for (pos = list_entry((head)->next, typeof(*pos), member), \
|
|
Packit |
eace71 |
n = list_entry(pos->member.next, typeof(*pos), member); \
|
|
Packit |
eace71 |
&pos->member != (head); \
|
|
Packit |
eace71 |
pos = n, n = list_entry(n->member.next, typeof(*n), member))
|
|
Packit |
eace71 |
|
|
Packit |
eace71 |
static inline void __list_add(struct list_head *new,
|
|
Packit |
eace71 |
struct list_head *prev,
|
|
Packit |
eace71 |
struct list_head *next)
|
|
Packit |
eace71 |
{
|
|
Packit |
eace71 |
next->prev = new;
|
|
Packit |
eace71 |
new->next = next;
|
|
Packit |
eace71 |
new->prev = prev;
|
|
Packit |
eace71 |
prev->next = new;
|
|
Packit |
eace71 |
}
|
|
Packit |
eace71 |
|
|
Packit |
eace71 |
static inline void list_add(struct list_head *new, struct list_head *head)
|
|
Packit |
eace71 |
{
|
|
Packit |
eace71 |
__list_add(new, head, head->next);
|
|
Packit |
eace71 |
}
|
|
Packit |
eace71 |
|
|
Packit |
eace71 |
static inline void list_add_tail(struct list_head *new, struct list_head *head)
|
|
Packit |
eace71 |
{
|
|
Packit |
eace71 |
__list_add(new, head->prev, head);
|
|
Packit |
eace71 |
}
|
|
Packit |
eace71 |
|
|
Packit |
eace71 |
static inline void __list_del(struct list_head * prev, struct list_head * next)
|
|
Packit |
eace71 |
{
|
|
Packit |
eace71 |
next->prev = prev;
|
|
Packit |
eace71 |
prev->next = next;
|
|
Packit |
eace71 |
}
|
|
Packit |
eace71 |
|
|
Packit |
eace71 |
static inline void list_del(struct list_head *entry)
|
|
Packit |
eace71 |
{
|
|
Packit |
eace71 |
__list_del(entry->prev, entry->next);
|
|
Packit |
eace71 |
entry->next = entry->prev = NULL;
|
|
Packit |
eace71 |
}
|
|
Packit |
eace71 |
|
|
Packit |
eace71 |
static inline void list_del_init(struct list_head *entry)
|
|
Packit |
eace71 |
{
|
|
Packit |
eace71 |
__list_del(entry->prev, entry->next);
|
|
Packit |
eace71 |
INIT_LIST_HEAD(entry);
|
|
Packit |
eace71 |
}
|
|
Packit |
eace71 |
|
|
Packit |
eace71 |
/**
|
|
Packit |
eace71 |
* list_move_tail - delete from one list and add as another's tail
|
|
Packit |
eace71 |
* @list: the entry to move
|
|
Packit |
eace71 |
* @head: the head that will follow our entry
|
|
Packit |
eace71 |
*/
|
|
Packit |
eace71 |
static inline void list_move_tail(struct list_head *list,
|
|
Packit |
eace71 |
struct list_head *head)
|
|
Packit |
eace71 |
{
|
|
Packit |
eace71 |
__list_del(list->prev, list->next);
|
|
Packit |
eace71 |
list_add_tail(list, head);
|
|
Packit |
eace71 |
}
|
|
Packit |
eace71 |
|
|
Packit |
eace71 |
#endif
|