130 	for (i = 0; i < (1 << nht->hash_shift); i++) {  in neigh_forced_gc()
203 	for (i = 0; i < (1 << nht->hash_shift); i++) {  in neigh_flush_dev()
338 	ret->hash_shift = shift;  in neigh_hash_alloc()
349 	size_t size = (1 << nht->hash_shift) * sizeof(struct neighbour *);  in neigh_hash_free_rcu()
373 	for (i = 0; i < (1 << old_nht->hash_shift); i++) {  in neigh_hash_grow()
383 			hash >>= (32 - new_nht->hash_shift);  in neigh_hash_grow()
432 	hash_val = tbl->hash(pkey, NULL, nht->hash_rnd) >> (32 - nht->hash_shift);  in neigh_lookup_nodev()
496 	if (atomic_read(&tbl->entries) > (1 << nht->hash_shift))  in __neigh_create()
497 		nht = neigh_hash_grow(tbl, nht->hash_shift + 1);  in __neigh_create()
499 	hash_val = tbl->hash(pkey, dev, nht->hash_rnd) >> (32 - nht->hash_shift);  in __neigh_create()
769 	for (i = 0 ; i < (1 << nht->hash_shift); i++) {  in neigh_periodic_work()
1829 		ndc.ndtc_hash_mask = ((1 << nht->hash_shift) - 1);  in neightbl_fill_info()
2289 	for (h = s_h; h < (1 << nht->hash_shift); h++) {  in neigh_dump_table()
2411 	for (chain = 0; chain < (1 << nht->hash_shift); chain++) {  in neigh_for_each()
2433 	for (chain = 0; chain < (1 << nht->hash_shift); chain++) {  in __neigh_for_each_release()
2504 	for (bucket = 0; bucket < (1 << nht->hash_shift); bucket++) {  in neigh_get_first()
2571 		if (++state->bucket >= (1 << nht->hash_shift))  in neigh_get_next()