remove the hlist code
This commit is contained in:
Felix Fietkau
parent
dc8c37fa8b
commit
f213e8b432
1 changed files with 0 additions and 147 deletions
147
list.h
147
list.h
|
|
@ -462,151 +462,4 @@ static inline void list_splice_init(struct list_head *list,
|
||||||
&pos->member != (head); \
|
&pos->member != (head); \
|
||||||
pos = n, n = list_entry(n->member.prev, typeof(*n), member))
|
pos = n, n = list_entry(n->member.prev, typeof(*n), member))
|
||||||
|
|
||||||
/*
|
|
||||||
* Double linked lists with a single pointer list head.
|
|
||||||
* Mostly useful for hash tables where the two pointer list head is
|
|
||||||
* too wasteful.
|
|
||||||
* You lose the ability to access the tail in O(1).
|
|
||||||
*/
|
|
||||||
|
|
||||||
struct hlist_head {
|
|
||||||
struct hlist_node *first;
|
|
||||||
};
|
|
||||||
|
|
||||||
struct hlist_node {
|
|
||||||
struct hlist_node *next, **pprev;
|
|
||||||
};
|
|
||||||
|
|
||||||
#define HLIST_HEAD_INIT { .first = NULL }
|
|
||||||
#define HLIST_HEAD(name) struct hlist_head name = { .first = NULL }
|
|
||||||
#define INIT_HLIST_HEAD(ptr) ((ptr)->first = NULL)
|
|
||||||
static inline void INIT_HLIST_NODE(struct hlist_node *h)
|
|
||||||
{
|
|
||||||
h->next = NULL;
|
|
||||||
h->pprev = NULL;
|
|
||||||
}
|
|
||||||
|
|
||||||
static inline int hlist_unhashed(const struct hlist_node *h)
|
|
||||||
{
|
|
||||||
return !h->pprev;
|
|
||||||
}
|
|
||||||
|
|
||||||
static inline int hlist_empty(const struct hlist_head *h)
|
|
||||||
{
|
|
||||||
return !h->first;
|
|
||||||
}
|
|
||||||
|
|
||||||
static inline void __hlist_del(struct hlist_node *n)
|
|
||||||
{
|
|
||||||
struct hlist_node *next = n->next;
|
|
||||||
struct hlist_node **pprev = n->pprev;
|
|
||||||
*pprev = next;
|
|
||||||
if (next)
|
|
||||||
next->pprev = pprev;
|
|
||||||
}
|
|
||||||
|
|
||||||
static inline void hlist_del(struct hlist_node *n)
|
|
||||||
{
|
|
||||||
__hlist_del(n);
|
|
||||||
n->next = NULL;
|
|
||||||
n->pprev = NULL;
|
|
||||||
}
|
|
||||||
|
|
||||||
static inline void hlist_del_init(struct hlist_node *n)
|
|
||||||
{
|
|
||||||
if (!hlist_unhashed(n)) {
|
|
||||||
__hlist_del(n);
|
|
||||||
INIT_HLIST_NODE(n);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
static inline void hlist_add_head(struct hlist_node *n, struct hlist_head *h)
|
|
||||||
{
|
|
||||||
struct hlist_node *first = h->first;
|
|
||||||
n->next = first;
|
|
||||||
if (first)
|
|
||||||
first->pprev = &n->next;
|
|
||||||
h->first = n;
|
|
||||||
n->pprev = &h->first;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
/* next must be != NULL */
|
|
||||||
static inline void hlist_add_before(struct hlist_node *n,
|
|
||||||
struct hlist_node *next)
|
|
||||||
{
|
|
||||||
n->pprev = next->pprev;
|
|
||||||
n->next = next;
|
|
||||||
next->pprev = &n->next;
|
|
||||||
*(n->pprev) = n;
|
|
||||||
}
|
|
||||||
|
|
||||||
static inline void hlist_add_after(struct hlist_node *n,
|
|
||||||
struct hlist_node *next)
|
|
||||||
{
|
|
||||||
next->next = n->next;
|
|
||||||
n->next = next;
|
|
||||||
next->pprev = &n->next;
|
|
||||||
|
|
||||||
if(next->next)
|
|
||||||
next->next->pprev = &next->next;
|
|
||||||
}
|
|
||||||
|
|
||||||
#define hlist_entry(ptr, type, member) container_of(ptr,type,member)
|
|
||||||
|
|
||||||
#define hlist_for_each(pos, head) \
|
|
||||||
for (pos = (head)->first; pos; pos = pos->next)
|
|
||||||
|
|
||||||
#define hlist_for_each_safe(pos, n, head) \
|
|
||||||
for (pos = (head)->first; pos; pos = n)
|
|
||||||
|
|
||||||
/**
|
|
||||||
* hlist_for_each_entry - iterate over list of given type
|
|
||||||
* @tpos: the type * to use as a loop cursor.
|
|
||||||
* @pos: the &struct hlist_node to use as a loop cursor.
|
|
||||||
* @head: the head for your list.
|
|
||||||
* @member: the name of the hlist_node within the struct.
|
|
||||||
*/
|
|
||||||
#define hlist_for_each_entry(tpos, pos, head, member) \
|
|
||||||
for (pos = (head)->first; pos && \
|
|
||||||
({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \
|
|
||||||
pos = pos->next)
|
|
||||||
|
|
||||||
/**
|
|
||||||
* hlist_for_each_entry_continue - iterate over a hlist continuing after current point
|
|
||||||
* @tpos: the type * to use as a loop cursor.
|
|
||||||
* @pos: the &struct hlist_node to use as a loop cursor.
|
|
||||||
* @member: the name of the hlist_node within the struct.
|
|
||||||
*/
|
|
||||||
#define hlist_for_each_entry_continue(tpos, pos, member) \
|
|
||||||
for (pos = (pos)->next; pos && \
|
|
||||||
({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \
|
|
||||||
pos = pos->next)
|
|
||||||
|
|
||||||
/**
|
|
||||||
* hlist_for_each_entry_from - iterate over a hlist continuing from current point
|
|
||||||
* @tpos: the type * to use as a loop cursor.
|
|
||||||
* @pos: the &struct hlist_node to use as a loop cursor.
|
|
||||||
* @member: the name of the hlist_node within the struct.
|
|
||||||
*/
|
|
||||||
#define hlist_for_each_entry_from(tpos, pos, member) \
|
|
||||||
for (; pos && \
|
|
||||||
({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \
|
|
||||||
pos = pos->next)
|
|
||||||
|
|
||||||
/**
|
|
||||||
* hlist_for_each_entry_safe - iterate over list of given type safe against removal of list entry
|
|
||||||
* @tpos: the type * to use as a loop cursor.
|
|
||||||
* @pos: the &struct hlist_node to use as a loop cursor.
|
|
||||||
* @n: another &struct hlist_node to use as temporary storage
|
|
||||||
* @head: the head for your list.
|
|
||||||
* @member: the name of the hlist_node within the struct.
|
|
||||||
*/
|
|
||||||
#define hlist_for_each_entry_safe(tpos, pos, n, head, member) \
|
|
||||||
for (pos = (head)->first; \
|
|
||||||
pos && ({ n = pos->next; 1; }) && \
|
|
||||||
({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \
|
|
||||||
pos = n)
|
|
||||||
|
|
||||||
#endif
|
#endif
|
||||||
|
|
|
||||||
Loading…
Reference in a new issue