396 	 * We spread entries across multiple trees to reduce contention
401 	struct buffer_tree trees[];  member
414 		read_lock_bh(&bc->trees[cache_index(block, bc->num_locks)].u.spinlock);  in cache_read_lock()
416 		down_read(&bc->trees[cache_index(block, bc->num_locks)].u.lock);  in cache_read_lock()
422 		read_unlock_bh(&bc->trees[cache_index(block, bc->num_locks)].u.spinlock);  in cache_read_unlock()
424 		up_read(&bc->trees[cache_index(block, bc->num_locks)].u.lock);  in cache_read_unlock()
430 		write_lock_bh(&bc->trees[cache_index(block, bc->num_locks)].u.spinlock);  in cache_write_lock()
432 		down_write(&bc->trees[cache_index(block, bc->num_locks)].u.lock);  in cache_write_lock()
438 		write_unlock_bh(&bc->trees[cache_index(block, bc->num_locks)].u.spinlock);  in cache_write_unlock()
440 		up_write(&bc->trees[cache_index(block, bc->num_locks)].u.lock);  in cache_write_unlock()
466 			write_lock_bh(&lh->cache->trees[index].u.spinlock);  in __lh_lock()
468 			down_write(&lh->cache->trees[index].u.lock);  in __lh_lock()
471 			read_lock_bh(&lh->cache->trees[index].u.spinlock);  in __lh_lock()
473 			down_read(&lh->cache->trees[index].u.lock);  in __lh_lock()
481 			write_unlock_bh(&lh->cache->trees[index].u.spinlock);  in __lh_unlock()
483 			up_write(&lh->cache->trees[index].u.lock);  in __lh_unlock()
486 			read_unlock_bh(&lh->cache->trees[index].u.spinlock);  in __lh_unlock()
488 			up_read(&lh->cache->trees[index].u.lock);  in __lh_unlock()
544 			rwlock_init(&bc->trees[i].u.spinlock);  in cache_init()
546 			init_rwsem(&bc->trees[i].u.lock);  in cache_init()
547 		bc->trees[i].root = RB_ROOT;  in cache_init()
559 		WARN_ON_ONCE(!RB_EMPTY_ROOT(&bc->trees[i].root));  in cache_destroy()
617 	b = __cache_get(&bc->trees[cache_index(block, bc->num_locks)].root, block);  in cache_get()
691 	rb_erase(&b->node, &bc->trees[cache_index(b->block, bc->num_locks)].root);  in __cache_evict()
857 	r = __cache_insert(&bc->trees[cache_index(b->block, bc->num_locks)].root, b);  in cache_insert()
883 		rb_erase(&b->node, &bc->trees[cache_index(b->block, bc->num_locks)].root);  in cache_remove()
954 		down_write(&bc->trees[i].u.lock);  in cache_remove_range()
955 		__remove_range(bc, &bc->trees[i].root, begin, end, pred, release);  in cache_remove_range()
956 		up_write(&bc->trees[i].u.lock);  in cache_remove_range()