Lines Matching defs:prev
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.
337 struct klist_node *prev;
343 prev = to_klist_node(last->n_node.prev);
347 prev = to_klist_node(i->i_klist->k_list.prev);
350 while (prev != to_klist_node(&i->i_klist->k_list)) {
351 if (likely(!knode_dead(prev))) {
352 kref_get(&prev->n_ref);
353 i->i_cur = prev;
356 prev = to_klist_node(prev->n_node.prev);