Lines Matching refs:cache_index
399 static inline unsigned int cache_index(sector_t block, unsigned int num_locks) in cache_index() function
407 read_lock_bh(&bc->trees[cache_index(block, bc->num_locks)].u.spinlock); in cache_read_lock()
409 down_read(&bc->trees[cache_index(block, bc->num_locks)].u.lock); in cache_read_lock()
415 read_unlock_bh(&bc->trees[cache_index(block, bc->num_locks)].u.spinlock); in cache_read_unlock()
417 up_read(&bc->trees[cache_index(block, bc->num_locks)].u.lock); in cache_read_unlock()
423 write_lock_bh(&bc->trees[cache_index(block, bc->num_locks)].u.spinlock); in cache_write_lock()
425 down_write(&bc->trees[cache_index(block, bc->num_locks)].u.lock); in cache_write_lock()
431 write_unlock_bh(&bc->trees[cache_index(block, bc->num_locks)].u.spinlock); in cache_write_unlock()
433 up_write(&bc->trees[cache_index(block, bc->num_locks)].u.lock); in cache_write_unlock()
502 unsigned int index = cache_index(b, lh->no_previous); /* no_previous is num_locks */ in lh_next()
610 b = __cache_get(&bc->trees[cache_index(block, bc->num_locks)].root, block); in cache_get()
684 rb_erase(&b->node, &bc->trees[cache_index(b->block, bc->num_locks)].root); in __cache_evict()
850 r = __cache_insert(&bc->trees[cache_index(b->block, bc->num_locks)].root, b); in cache_insert()
876 rb_erase(&b->node, &bc->trees[cache_index(b->block, bc->num_locks)].root); in cache_remove()