Lines Matching refs:node
9 * "node" (struct klist_node) objects. For struct klist, a spinlock is
12 * reference count that indicates the number of current users of that node
18 * current node on the list.
29 * Only when the count goes to 0 is the node removed from the list.
30 * klist_remove() will try to delete the node from the list and block until
119 * @n: node we're adding.
131 * @n: node we're adding.
142 * klist_add_behind - Init a klist_node and add it after an existing node
143 * @n: node we're adding.
144 * @pos: node to put @n after
158 * klist_add_before - Init a klist_node and add it before an existing node
159 * @n: node we're adding.
160 * @pos: node to put @n after
175 struct klist_node *node;
192 if (waiter->node != n)
225 * klist_del - Decrement the reference count of node and try to remove.
226 * @n: node we're deleting.
235 * klist_remove - Decrement the refcount of node and wait for it to go away.
236 * @n: node we're removing.
242 waiter.node = n;
262 * klist_node_attached - Say whether a node is bound to a list or not.
275 * @n: node to start with.
308 * refcount of the current node. Necessary in case iteration exited before
326 * klist_prev - Ante up prev node in list.
330 * node, if there was one. Grab the prev node, increment its reference
331 * count, drop the lock, and return that prev node.
368 * klist_next - Ante up next node in list.
372 * node, if there was one. Grab the next node, increment its reference
373 * count, drop the lock, and return that next node.