Lines Matching refs:bcache
59 * bcache per device node. cache is allocated on device first open and freed
64 struct bcache {
90 static void bcache_invalidate(struct bcache *bc, daddr_t blkno);
91 static void bcache_insert(struct bcache *bc, daddr_t blkno);
92 static void bcache_free_instance(struct bcache *bc);
106 * add number of devices to bcache. we have to divide cache space
123 struct bcache *bc = malloc(sizeof (struct bcache));
135 * the bcache block count must be power of 2 for hash function
172 struct bcache *bc = cache;
190 struct bcache *bc = dd->dv_cache;
214 struct bcache *bc = dd->dv_cache;
257 * We have space at least for nblk - i before bcache wraps.
269 * bcache end - this would complicate the cache management.
273 * 3. The bcache is sized by 512B blocks, however, the underlying device
286 * Our choice of 16 read ahead blocks will always fit inside the bcache.
300 /* invalidate bcache */
308 * disk end, as bcache has no information about disk size.
311 * in either case we should return the data in bcache and only
359 struct bcache *bc = dd->dv_cache;
423 * Free allocated bcache instance
426 bcache_free_instance(struct bcache *bc)
439 bcache_insert(struct bcache *bc, daddr_t blkno)
454 bcache_invalidate(struct bcache *bc, daddr_t blkno)