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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
|
/*
*
* Copyright (c) 2018 Huawei Technologies Co.,Ltd.
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at:
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "list.h"
/**
* function-name : list_empty
* description : tests whether a list is empty
* parameter @head : the list to test.
*/
inline int
list_empty (const struct list_head *head_of_list)
{
return head_of_list->next == head_of_list;
}
inline void
list_del (struct list_head *entry)
{
if (entry->prev == NULL || entry->next == NULL)
{
return;
}
entry->next->prev = entry->prev;
entry->prev->next = entry->next;
entry->next = NULL;
entry->prev = NULL;
}
/*get the first element of the list, need to check if list empty or not before calling this.*/
inline struct list_head *
list_get_first (struct list_head *head)
{
return head->next;
}
inline void
list_add (struct list_head *newp, struct list_head *head)
{
head->next->prev = newp;
newp->next = head->next;
newp->prev = head;
head->next = newp;
}
inline void
list_link (struct list_head *newhead, struct list_head *head)
{
struct list_head *tmp;
newhead->prev->next = head;
head->prev->next = newhead;
tmp = newhead->prev;
newhead->prev = head->prev;
head->prev = tmp;
}
inline void
list_add_tail (struct list_head *newp, struct list_head *head)
{
list_add (newp, head->prev);
}
inline void
hlist_del_init (struct hlist_node *n)
{
struct hlist_node *next_node = n->next;
struct hlist_node **pprev = n->pprev;
if (pprev == NULL && next_node == NULL)
{
return;
}
if (pprev)
{
*pprev = next_node;
}
if (next_node)
{
next_node->pprev = pprev;
}
n->next = NULL;
n->pprev = NULL;
}
/**
* next must be != NULL
* add n node before next node
*
* @n: new node
* @next: node in the hlist
*/
inline void
hlist_add_before (struct hlist_node *node, struct hlist_node *next)
{
node->pprev = next->pprev;
node->next = next;
next->pprev = &node->next;
*(node->pprev) = node;
}
/**
* next must be != NULL
* add n node after next node
* actual behavior is add after n
* @n: node in the hlist
* @next: new node
*/
inline void
hlist_add_after (struct hlist_node *node, struct hlist_node *next)
{
next->next = node->next;
node->next = next;
next->pprev = &node->next;
if (next->next)
{
next->next->pprev = &next->next;
}
}
/* add after the head */
inline void
hlist_add_head (struct hlist_node *node, struct hlist_head *h)
{
struct hlist_node *first = h->first;
node->next = first;
if (first)
{
first->pprev = &node->next;
}
h->first = node;
node->pprev = &h->first;
}
inline int
hlist_unhashed (const struct hlist_node *node)
{
return !node->pprev;
}
inline int
hlist_empty (const struct hlist_head *node)
{
return !node->first;
}
|
