1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
|
#ifndef __LIST_H
#define __LIST_H
#include "types.h" // container_of
/****************************************************************
* hlist - Double linked lists with a single pointer list head
****************************************************************/
struct hlist_node {
struct hlist_node *next, **pprev;
};
struct hlist_head {
struct hlist_node *first;
};
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_add(struct hlist_node *n, struct hlist_node **pprev)
{
struct hlist_node *next = *pprev;
n->pprev = pprev;
n->next = next;
if (next)
next->pprev = &n->next;
*pprev = n;
}
static inline void
hlist_add_head(struct hlist_node *n, struct hlist_head *h)
{
hlist_add(n, &h->first);
}
static inline void
hlist_add_before(struct hlist_node *n, struct hlist_node *next)
{
hlist_add(n, next->pprev);
}
static inline void
hlist_add_after(struct hlist_node *n, struct hlist_node *prev)
{
hlist_add(n, &prev->next);
}
static inline void
hlist_replace(struct hlist_node *old, struct hlist_node *new)
{
new->next = old->next;
if (new->next)
new->next->pprev = &new->next;
new->pprev = old->pprev;
*new->pprev = new;
}
#define hlist_for_each_entry(pos, head, member) \
for (pos = container_of((head)->first, typeof(*pos), member) \
; pos != container_of(NULL, typeof(*pos), member) \
; pos = container_of(pos->member.next, typeof(*pos), member))
#define hlist_for_each_entry_safe(pos, n, head, member) \
for (pos = container_of((head)->first, typeof(*pos), member) \
; pos != container_of(NULL, typeof(*pos), member) \
&& ({ n = pos->member.next; 1; }) \
; pos = container_of(n, typeof(*pos), member))
#define hlist_for_each_entry_pprev(pos, pprev, head, member) \
for (pprev = &(head)->first \
; *pprev && ({ pos=container_of(*pprev, typeof(*pos), member); 1; }) \
; pprev = &(*pprev)->next)
#endif // list.h
|
