Blame view
lib/klist.c
8.58 KB
9a19fea43
|
1 |
/* |
c3bb7fada
|
2 |
* klist.c - Routines for manipulating klists. |
9a19fea43
|
3 |
* |
c3bb7fada
|
4 |
* Copyright (C) 2005 Patrick Mochel |
9a19fea43
|
5 |
* |
c3bb7fada
|
6 |
* This file is released under the GPL v2. |
9a19fea43
|
7 |
* |
c3bb7fada
|
8 9 10 11 12 13 14 |
* This klist interface provides a couple of structures that wrap around * struct list_head to provide explicit list "head" (struct klist) and list * "node" (struct klist_node) objects. For struct klist, a spinlock is * included that protects access to the actual list itself. struct * klist_node provides a pointer to the klist that owns it and a kref * reference count that indicates the number of current users of that node * in the list. |
9a19fea43
|
15 |
* |
c3bb7fada
|
16 17 18 19 |
* The entire point is to provide an interface for iterating over a list * that is safe and allows for modification of the list during the * iteration (e.g. insertion and removal), including modification of the * current node on the list. |
9a19fea43
|
20 |
* |
c3bb7fada
|
21 22 23 24 25 26 |
* It works using a 3rd object type - struct klist_iter - that is declared * and initialized before an iteration. klist_next() is used to acquire the * next element in the list. It returns NULL if there are no more items. * Internally, that routine takes the klist's lock, decrements the * reference count of the previous klist_node and increments the count of * the next klist_node. It then drops the lock and returns. |
9a19fea43
|
27 |
* |
c3bb7fada
|
28 29 30 31 32 33 34 |
* There are primitives for adding and removing nodes to/from a klist. * When deleting, klist_del() will simply decrement the reference count. * Only when the count goes to 0 is the node removed from the list. * klist_remove() will try to delete the node from the list and block until * it is actually removed. This is useful for objects (like devices) that * have been removed from the system and must be freed (but must wait until * all accessors have finished). |
9a19fea43
|
35 36 37 38 |
*/ #include <linux/klist.h> #include <linux/module.h> |
a1ed5b0cf
|
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 |
/* * Use the lowest bit of n_klist to mark deleted nodes and exclude * dead ones from iteration. */ #define KNODE_DEAD 1LU #define KNODE_KLIST_MASK ~KNODE_DEAD static struct klist *knode_klist(struct klist_node *knode) { return (struct klist *) ((unsigned long)knode->n_klist & KNODE_KLIST_MASK); } static bool knode_dead(struct klist_node *knode) { return (unsigned long)knode->n_klist & KNODE_DEAD; } static void knode_set_klist(struct klist_node *knode, struct klist *klist) { knode->n_klist = klist; /* no knode deserves to start its life dead */ WARN_ON(knode_dead(knode)); } static void knode_kill(struct klist_node *knode) { /* and no knode should die twice ever either, see we're very humane */ WARN_ON(knode_dead(knode)); *(unsigned long *)&knode->n_klist |= KNODE_DEAD; } |
9a19fea43
|
70 71 |
/** |
c3bb7fada
|
72 73 74 75 |
* klist_init - Initialize a klist structure. * @k: The klist we're initializing. * @get: The get function for the embedding object (NULL if none) * @put: The put function for the embedding object (NULL if none) |
34bb61f9d
|
76 77 78 79 80 81 |
* * Initialises the klist structure. If the klist_node structures are * going to be embedded in refcounted objects (necessary for safe * deletion) then the get/put arguments are used to initialise * functions that take and release references on the embedding * objects. |
9a19fea43
|
82 |
*/ |
c3bb7fada
|
83 |
void klist_init(struct klist *k, void (*get)(struct klist_node *), |
34bb61f9d
|
84 |
void (*put)(struct klist_node *)) |
9a19fea43
|
85 86 87 |
{ INIT_LIST_HEAD(&k->k_list); spin_lock_init(&k->k_lock); |
34bb61f9d
|
88 89 |
k->get = get; k->put = put; |
9a19fea43
|
90 |
} |
9a19fea43
|
91 |
EXPORT_SYMBOL_GPL(klist_init); |
c3bb7fada
|
92 |
static void add_head(struct klist *k, struct klist_node *n) |
9a19fea43
|
93 94 95 96 97 |
{ spin_lock(&k->k_lock); list_add(&n->n_node, &k->k_list); spin_unlock(&k->k_lock); } |
c3bb7fada
|
98 |
static void add_tail(struct klist *k, struct klist_node *n) |
9a19fea43
|
99 100 101 102 103 |
{ spin_lock(&k->k_lock); list_add_tail(&n->n_node, &k->k_list); spin_unlock(&k->k_lock); } |
c3bb7fada
|
104 |
static void klist_node_init(struct klist *k, struct klist_node *n) |
9a19fea43
|
105 106 107 108 |
{ INIT_LIST_HEAD(&n->n_node); init_completion(&n->n_removed); kref_init(&n->n_ref); |
a1ed5b0cf
|
109 |
knode_set_klist(n, k); |
34bb61f9d
|
110 111 |
if (k->get) k->get(n); |
9a19fea43
|
112 |
} |
9a19fea43
|
113 |
/** |
c3bb7fada
|
114 115 116 |
* klist_add_head - Initialize a klist_node and add it to front. * @n: node we're adding. * @k: klist it's going on. |
9a19fea43
|
117 |
*/ |
c3bb7fada
|
118 |
void klist_add_head(struct klist_node *n, struct klist *k) |
9a19fea43
|
119 120 121 122 |
{ klist_node_init(k, n); add_head(k, n); } |
9a19fea43
|
123 |
EXPORT_SYMBOL_GPL(klist_add_head); |
9a19fea43
|
124 |
/** |
c3bb7fada
|
125 126 127 |
* klist_add_tail - Initialize a klist_node and add it to back. * @n: node we're adding. * @k: klist it's going on. |
9a19fea43
|
128 |
*/ |
c3bb7fada
|
129 |
void klist_add_tail(struct klist_node *n, struct klist *k) |
9a19fea43
|
130 131 132 133 |
{ klist_node_init(k, n); add_tail(k, n); } |
9a19fea43
|
134 |
EXPORT_SYMBOL_GPL(klist_add_tail); |
93dd40013
|
135 136 137 138 139 140 141 |
/** * klist_add_after - Init a klist_node and add it after an existing node * @n: node we're adding. * @pos: node to put @n after */ void klist_add_after(struct klist_node *n, struct klist_node *pos) { |
a1ed5b0cf
|
142 |
struct klist *k = knode_klist(pos); |
93dd40013
|
143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 |
klist_node_init(k, n); spin_lock(&k->k_lock); list_add(&n->n_node, &pos->n_node); spin_unlock(&k->k_lock); } EXPORT_SYMBOL_GPL(klist_add_after); /** * klist_add_before - Init a klist_node and add it before an existing node * @n: node we're adding. * @pos: node to put @n after */ void klist_add_before(struct klist_node *n, struct klist_node *pos) { |
a1ed5b0cf
|
158 |
struct klist *k = knode_klist(pos); |
93dd40013
|
159 160 161 162 163 164 165 |
klist_node_init(k, n); spin_lock(&k->k_lock); list_add_tail(&n->n_node, &pos->n_node); spin_unlock(&k->k_lock); } EXPORT_SYMBOL_GPL(klist_add_before); |
c3bb7fada
|
166 |
static void klist_release(struct kref *kref) |
9a19fea43
|
167 |
{ |
c3bb7fada
|
168 |
struct klist_node *n = container_of(kref, struct klist_node, n_ref); |
7e9f4b2d3
|
169 |
|
a1ed5b0cf
|
170 |
WARN_ON(!knode_dead(n)); |
9a19fea43
|
171 172 |
list_del(&n->n_node); complete(&n->n_removed); |
a1ed5b0cf
|
173 |
knode_set_klist(n, NULL); |
9a19fea43
|
174 |
} |
c3bb7fada
|
175 |
static int klist_dec_and_del(struct klist_node *n) |
9a19fea43
|
176 177 178 |
{ return kref_put(&n->n_ref, klist_release); } |
a1ed5b0cf
|
179 |
static void klist_put(struct klist_node *n, bool kill) |
9a19fea43
|
180 |
{ |
a1ed5b0cf
|
181 |
struct klist *k = knode_klist(n); |
7e9f4b2d3
|
182 |
void (*put)(struct klist_node *) = k->put; |
9a19fea43
|
183 184 |
spin_lock(&k->k_lock); |
a1ed5b0cf
|
185 186 |
if (kill) knode_kill(n); |
7e9f4b2d3
|
187 188 |
if (!klist_dec_and_del(n)) put = NULL; |
9a19fea43
|
189 |
spin_unlock(&k->k_lock); |
7e9f4b2d3
|
190 191 |
if (put) put(n); |
9a19fea43
|
192 |
} |
a1ed5b0cf
|
193 194 195 196 197 198 199 200 201 |
/** * klist_del - Decrement the reference count of node and try to remove. * @n: node we're deleting. */ void klist_del(struct klist_node *n) { klist_put(n, true); } |
9a19fea43
|
202 |
EXPORT_SYMBOL_GPL(klist_del); |
9a19fea43
|
203 |
/** |
c3bb7fada
|
204 205 |
* klist_remove - Decrement the refcount of node and wait for it to go away. * @n: node we're removing. |
9a19fea43
|
206 |
*/ |
c3bb7fada
|
207 |
void klist_remove(struct klist_node *n) |
9a19fea43
|
208 |
{ |
7e9f4b2d3
|
209 |
klist_del(n); |
9a19fea43
|
210 211 |
wait_for_completion(&n->n_removed); } |
9a19fea43
|
212 |
EXPORT_SYMBOL_GPL(klist_remove); |
9a19fea43
|
213 |
/** |
c3bb7fada
|
214 215 |
* klist_node_attached - Say whether a node is bound to a list or not. * @n: Node that we're testing. |
8b0c250be
|
216 |
*/ |
c3bb7fada
|
217 |
int klist_node_attached(struct klist_node *n) |
8b0c250be
|
218 219 220 |
{ return (n->n_klist != NULL); } |
8b0c250be
|
221 |
EXPORT_SYMBOL_GPL(klist_node_attached); |
8b0c250be
|
222 |
/** |
c3bb7fada
|
223 224 225 226 |
* klist_iter_init_node - Initialize a klist_iter structure. * @k: klist we're iterating. * @i: klist_iter we're filling. * @n: node to start with. |
9a19fea43
|
227 |
* |
c3bb7fada
|
228 229 |
* Similar to klist_iter_init(), but starts the action off with @n, * instead of with the list head. |
9a19fea43
|
230 |
*/ |
c3bb7fada
|
231 232 |
void klist_iter_init_node(struct klist *k, struct klist_iter *i, struct klist_node *n) |
9a19fea43
|
233 234 |
{ i->i_klist = k; |
9a19fea43
|
235 |
i->i_cur = n; |
e22dafbcd
|
236 237 |
if (n) kref_get(&n->n_ref); |
9a19fea43
|
238 |
} |
9a19fea43
|
239 |
EXPORT_SYMBOL_GPL(klist_iter_init_node); |
9a19fea43
|
240 |
/** |
c3bb7fada
|
241 242 243 |
* klist_iter_init - Iniitalize a klist_iter structure. * @k: klist we're iterating. * @i: klist_iter structure we're filling. |
9a19fea43
|
244 |
* |
c3bb7fada
|
245 |
* Similar to klist_iter_init_node(), but start with the list head. |
9a19fea43
|
246 |
*/ |
c3bb7fada
|
247 |
void klist_iter_init(struct klist *k, struct klist_iter *i) |
9a19fea43
|
248 249 250 |
{ klist_iter_init_node(k, i, NULL); } |
9a19fea43
|
251 |
EXPORT_SYMBOL_GPL(klist_iter_init); |
9a19fea43
|
252 |
/** |
c3bb7fada
|
253 254 |
* klist_iter_exit - Finish a list iteration. * @i: Iterator structure. |
9a19fea43
|
255 |
* |
c3bb7fada
|
256 257 258 |
* Must be called when done iterating over list, as it decrements the * refcount of the current node. Necessary in case iteration exited before * the end of the list was reached, and always good form. |
9a19fea43
|
259 |
*/ |
c3bb7fada
|
260 |
void klist_iter_exit(struct klist_iter *i) |
9a19fea43
|
261 262 |
{ if (i->i_cur) { |
a1ed5b0cf
|
263 |
klist_put(i->i_cur, false); |
9a19fea43
|
264 265 266 |
i->i_cur = NULL; } } |
9a19fea43
|
267 |
EXPORT_SYMBOL_GPL(klist_iter_exit); |
c3bb7fada
|
268 |
static struct klist_node *to_klist_node(struct list_head *n) |
9a19fea43
|
269 270 271 |
{ return container_of(n, struct klist_node, n_node); } |
9a19fea43
|
272 |
/** |
c3bb7fada
|
273 274 |
* klist_next - Ante up next node in list. * @i: Iterator structure. |
9a19fea43
|
275 |
* |
c3bb7fada
|
276 277 278 |
* First grab list lock. Decrement the reference count of the previous * node, if there was one. Grab the next node, increment its reference * count, drop the lock, and return that next node. |
9a19fea43
|
279 |
*/ |
c3bb7fada
|
280 |
struct klist_node *klist_next(struct klist_iter *i) |
9a19fea43
|
281 |
{ |
7e9f4b2d3
|
282 |
void (*put)(struct klist_node *) = i->i_klist->put; |
a1ed5b0cf
|
283 284 |
struct klist_node *last = i->i_cur; struct klist_node *next; |
9a19fea43
|
285 286 |
spin_lock(&i->i_klist->k_lock); |
a1ed5b0cf
|
287 288 289 290 |
if (last) { next = to_klist_node(last->n_node.next); if (!klist_dec_and_del(last)) |
7e9f4b2d3
|
291 |
put = NULL; |
9a19fea43
|
292 |
} else |
a1ed5b0cf
|
293 |
next = to_klist_node(i->i_klist->k_list.next); |
9a19fea43
|
294 |
|
a1ed5b0cf
|
295 296 297 298 299 300 301 302 |
i->i_cur = NULL; while (next != to_klist_node(&i->i_klist->k_list)) { if (likely(!knode_dead(next))) { kref_get(&next->n_ref); i->i_cur = next; break; } next = to_klist_node(next->n_node.next); |
9a19fea43
|
303 |
} |
a1ed5b0cf
|
304 |
|
9a19fea43
|
305 |
spin_unlock(&i->i_klist->k_lock); |
a1ed5b0cf
|
306 307 308 309 |
if (put && last) put(last); return i->i_cur; |
9a19fea43
|
310 |
} |
9a19fea43
|
311 |
EXPORT_SYMBOL_GPL(klist_next); |