169 lines
3.7 KiB
C
169 lines
3.7 KiB
C
|
#ifndef _LIST_H
|
||
|
#define _LIST_H
|
||
|
#include <stdlib.h>
|
||
|
|
||
|
#define LIST_POISON1 NULL
|
||
|
#define LIST_POISON2 NULL
|
||
|
|
||
|
struct list_head {
|
||
|
struct list_head *next, *prev;
|
||
|
};
|
||
|
|
||
|
#define LIST_HEAD_INIT(name) { &(name), &(name) }
|
||
|
|
||
|
#define LIST_HEAD(name) \
|
||
|
struct list_head name = LIST_HEAD_INIT(name)
|
||
|
|
||
|
static inline void INIT_LIST_HEAD(struct list_head *list)
|
||
|
{
|
||
|
list->next = list;
|
||
|
list->prev = list;
|
||
|
}
|
||
|
|
||
|
static inline void __list_add(struct list_head *new,
|
||
|
struct list_head *prev,
|
||
|
struct list_head *next)
|
||
|
{
|
||
|
next->prev = new;
|
||
|
new->next = next;
|
||
|
new->prev = prev;
|
||
|
prev->next = new;
|
||
|
}
|
||
|
|
||
|
static inline void list_add(struct list_head *new, struct list_head *head)
|
||
|
{
|
||
|
__list_add(new, head, head->next);
|
||
|
}
|
||
|
|
||
|
static inline void list_add_tail(struct list_head *new, struct list_head *head)
|
||
|
{
|
||
|
__list_add(new, head->prev, head);
|
||
|
}
|
||
|
|
||
|
static inline void __list_del(struct list_head * prev, struct list_head * next)
|
||
|
{
|
||
|
next->prev = prev;
|
||
|
prev->next = next;
|
||
|
}
|
||
|
|
||
|
static inline void list_del(struct list_head *entry)
|
||
|
{
|
||
|
__list_del(entry->prev, entry->next);
|
||
|
entry->next = LIST_POISON1;
|
||
|
entry->prev = LIST_POISON2;
|
||
|
}
|
||
|
|
||
|
static inline void list_replace(struct list_head *old,
|
||
|
struct list_head *new)
|
||
|
{
|
||
|
new->next = old->next;
|
||
|
new->next->prev = new;
|
||
|
new->prev = old->prev;
|
||
|
new->prev->next = new;
|
||
|
}
|
||
|
|
||
|
static inline void list_replace_init(struct list_head *old,
|
||
|
struct list_head *new)
|
||
|
{
|
||
|
list_replace(old, new);
|
||
|
INIT_LIST_HEAD(old);
|
||
|
}
|
||
|
|
||
|
static inline void list_del_init(struct list_head *entry)
|
||
|
{
|
||
|
__list_del(entry->prev, entry->next);
|
||
|
INIT_LIST_HEAD(entry);
|
||
|
}
|
||
|
|
||
|
static inline void list_move(struct list_head *list, struct list_head *head)
|
||
|
{
|
||
|
__list_del(list->prev, list->next);
|
||
|
list_add(list, head);
|
||
|
}
|
||
|
|
||
|
static inline void list_move_tail(struct list_head *list,
|
||
|
struct list_head *head)
|
||
|
{
|
||
|
__list_del(list->prev, list->next);
|
||
|
list_add_tail(list, head);
|
||
|
}
|
||
|
|
||
|
static inline int list_is_last(const struct list_head *list,
|
||
|
const struct list_head *head)
|
||
|
{
|
||
|
return list->next == head;
|
||
|
}
|
||
|
|
||
|
static inline int list_empty(const struct list_head *head)
|
||
|
{
|
||
|
return head->next == head;
|
||
|
}
|
||
|
|
||
|
static inline 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;
|
||
|
}
|
||
|
|
||
|
static inline void list_splice(const struct list_head *list,
|
||
|
struct list_head *head)
|
||
|
{
|
||
|
if (!list_empty(list))
|
||
|
__list_splice(list, head, head->next);
|
||
|
}
|
||
|
|
||
|
static inline void list_splice_tail(struct list_head *list,
|
||
|
struct list_head *head)
|
||
|
{
|
||
|
if (!list_empty(list))
|
||
|
__list_splice(list, head->prev, head);
|
||
|
}
|
||
|
|
||
|
static inline 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);
|
||
|
}
|
||
|
}
|
||
|
|
||
|
static inline 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);
|
||
|
}
|
||
|
}
|
||
|
|
||
|
#define list_for_each(pos, head) \
|
||
|
for (pos = (head)->next; pos != (head); \
|
||
|
pos = pos->next)
|
||
|
|
||
|
#define __list_for_each(pos, head) \
|
||
|
for (pos = (head)->next; pos != (head); pos = pos->next)
|
||
|
|
||
|
#define list_for_each_prev(pos, head) \
|
||
|
for (pos = (head)->prev; pos != (head); \
|
||
|
pos = pos->prev)
|
||
|
|
||
|
#define list_for_each_entry(pos, head, member) \
|
||
|
for (pos = list_entry((head)->next, typeof(*pos), member); \
|
||
|
&pos->member != (head); \
|
||
|
pos = list_entry(pos->member.next, typeof(*pos), member))
|
||
|
|
||
|
#define list_for_each_entry_from(pos, head, member) \
|
||
|
for (; &pos->member != (head); \
|
||
|
pos = list_entry(pos->member.next, typeof(*pos), member))
|
||
|
|
||
|
#endif
|