231 	struct rhash_head *head, *next, *entry;  in rhashtable_rehash_one()  local
243 		next = rht_dereference_bucket(entry->next, old_tbl, old_hash);  in rhashtable_rehash_one()
245 		if (rht_is_a_nulls(next))  in rhashtable_rehash_one()
248 		pprev = &entry->next;  in rhashtable_rehash_one()
260 	RCU_INIT_POINTER(entry->next, head);  in rhashtable_rehash_one()
265 		rcu_assign_pointer(*pprev, next);  in rhashtable_rehash_one()
268 		rht_assign_locked(bkt, next);  in rhashtable_rehash_one()
510 			pprev = &head->next;  in rhashtable_lookup_one()
520 		RCU_INIT_POINTER(list->next, plist);  in rhashtable_lookup_one()
521 		head = rht_dereference_bucket(head->next, tbl, hash);  in rhashtable_lookup_one()
522 		RCU_INIT_POINTER(list->rhead.next, head);  in rhashtable_lookup_one()
567 	RCU_INIT_POINTER(obj->next, head);  in rhashtable_insert_one()
572 		RCU_INIT_POINTER(list->next, NULL);  in rhashtable_insert_one()
761 			     list = rcu_dereference(list->next)) {  in rhashtable_walk_start_check()
807 						goto next;  in __rhashtable_walk_find_next()
809 					list = rcu_dereference(list->next);  in __rhashtable_walk_find_next()
819 next:  in __rhashtable_walk_find_next()
867 		if (!rhlist || !(list = rcu_dereference(list->next))) {  in rhashtable_walk_next()
868 			p = rcu_dereference(p->next);  in rhashtable_walk_next()
1110 		list = rht_dereference(list->next, ht);  in rhashtable_free_one()
1144 			struct rhash_head *pos, *next;  in rhashtable_free_and_destroy()  local
1148 			     next = !rht_is_a_nulls(pos) ?  in rhashtable_free_and_destroy()
1149 					rht_dereference(pos->next, ht) : NULL;  in rhashtable_free_and_destroy()
1151 			     pos = next,  in rhashtable_free_and_destroy()
1152 			     next = !rht_is_a_nulls(pos) ?  in rhashtable_free_and_destroy()
1153 					rht_dereference(pos->next, ht) : NULL)  in rhashtable_free_and_destroy()