39 	unsigned prev:28;  member
137 	return to_entry(es, e->prev);  in l_prev()
150 	e->prev = INDEXER_NULL;  in l_add_head()
153 		head->prev = l->head = to_index(es, e);  in l_add_head()
166 	e->prev = l->tail;  in l_add_tail()
180 	struct entry *prev = l_prev(es, old);  in l_add_before()  local
182 	if (!prev)  in l_add_before()
186 		e->prev = old->prev;  in l_add_before()
188 		prev->next = old->prev = to_index(es, e);  in l_add_before()
197 	struct entry *prev = l_prev(es, e);  in l_del()  local
200 	if (prev)  in l_del()
201 		prev->next = e->next;  in l_del()
206 		next->prev = e->prev;  in l_del()
208 		l->tail = e->prev;  in l_del()
609 				struct entry **prev)  in __h_lookup()  argument
613 	*prev = NULL;  in __h_lookup()
618 		*prev = e;  in __h_lookup()
625 		       struct entry *e, struct entry *prev)  in __h_unlink()  argument
627 	if (prev)  in __h_unlink()
628 		prev->hash_next = e->hash_next;  in __h_unlink()
638 	struct entry *e, *prev;  in h_lookup()  local
641 	e = __h_lookup(ht, h, oblock, &prev);  in h_lookup()
642 	if (e && prev) {  in h_lookup()
647 		__h_unlink(ht, h, e, prev);  in h_lookup()
657 	struct entry *prev;  in h_remove()  local
663 	e = __h_lookup(ht, h, e->oblock, &prev);  in h_remove()
665 		__h_unlink(ht, h, e, prev);  in h_remove()
700 	e->prev = INDEXER_NULL;  in init_entry()