118 		struct dentry *d = hlist_entry(*p, struct dentry, d_sib);  in scan_positives()
119 		p = &d->d_sib.next;  in scan_positives()
133 			if (!hlist_unhashed(&cursor->d_sib))  in scan_positives()
134 				__hlist_del(&cursor->d_sib);  in scan_positives()
135 			hlist_add_behind(&cursor->d_sib, &d->d_sib);  in scan_positives()
136 			p = &cursor->d_sib.next;  in scan_positives()
171 		hlist_del_init(&cursor->d_sib);  in dcache_dir_lseek()
173 			hlist_add_behind(&cursor->d_sib, &to->d_sib);  in dcache_dir_lseek()
204 		p = &cursor->d_sib.next;  in dcache_readdir()
212 		p = &next->d_sib.next;  in dcache_readdir()
215 	hlist_del_init(&cursor->d_sib);  in dcache_readdir()
217 		hlist_add_before(&cursor->d_sib, &next->d_sib);  in dcache_readdir()
462 	hlist_for_each_entry_from(dentry, d_sib) {  in find_positive_dentry()
583 	hlist_for_each_entry_from(d, d_sib) {  in find_next_child()
773 	hlist_for_each_entry(child, &dentry->d_children, d_sib) {  in simple_empty()