Home
last modified time | relevance | path

Searched refs:prio_buckets (Results 1 – 5 of 5) sorted by relevance

/Linux-v4.19/drivers/md/bcache/
Dsuper.c535 atomic_long_add(ca->sb.bucket_size * prio_buckets(ca), in bch_prio_write()
541 for (i = prio_buckets(ca) - 1; i >= 0; --i) { in bch_prio_write()
554 p->next_bucket = ca->prio_buckets[i + 1]; in bch_prio_write()
565 ca->prio_buckets[i] = bucket; in bch_prio_write()
580 for (i = 0; i < prio_buckets(ca); i++) { in bch_prio_write()
585 ca->prio_last_buckets[i] = ca->prio_buckets[i]; in bch_prio_write()
600 ca->prio_buckets[bucket_nr] = bucket; in prio_read()
2028 kfree(ca->prio_buckets); in bch_cache_release()
2071 !init_fifo_exact(&ca->free[RESERVE_PRIO], prio_buckets(ca), GFP_KERNEL) || in cache_alloc()
2078 !(ca->prio_buckets = kzalloc(array3_size(sizeof(uint64_t), in cache_alloc()
[all …]
Dbcache.h424 uint64_t *prio_buckets; member
745 #define prio_buckets(c) \ macro
Dalloc.c427 for (iter = 0; iter < prio_buckets(ca) * 2; iter++) in bch_bucket_alloc()
428 BUG_ON(ca->prio_buckets[iter] == (uint64_t) r); in bch_bucket_alloc()
Dbtree.c1759 for (i = ca->prio_buckets; in bch_btree_gc_finish()
1760 i < ca->prio_buckets + prio_buckets(ca) * 2; i++) in bch_btree_gc_finish()
Djournal.c642 w->data->prio_bucket[ca->sb.nr_this_dev] = ca->prio_buckets[0]; in journal_write_unlocked()