Lines Matching refs:next
23 * next element in the list. It returns NULL if there are no more items.
26 * the next klist_node. It then drops the lock and returns.
327 * klist_next - Ante up next node in list.
331 * node, if there was one. Grab the next node, increment its reference
332 * count, drop the lock, and return that next node.
338 struct klist_node *next;
343 next = to_klist_node(last->n_node.next);
347 next = to_klist_node(i->i_klist->k_list.next);
350 while (next != to_klist_node(&i->i_klist->k_list)) {
351 if (likely(!knode_dead(next))) {
352 kref_get(&next->n_ref);
353 i->i_cur = next;
356 next = to_klist_node(next->n_node.next);