Home
last modified time | relevance | path

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

/linux-6.6.21/drivers/md/bcache/
Dsuper.c629 if (prio_buckets(ca) > avail) in bch_prio_write()
639 atomic_long_add(ca->sb.bucket_size * prio_buckets(ca), in bch_prio_write()
642 for (i = prio_buckets(ca) - 1; i >= 0; --i) { in bch_prio_write()
655 p->next_bucket = ca->prio_buckets[i + 1]; in bch_prio_write()
666 ca->prio_buckets[i] = bucket; in bch_prio_write()
681 for (i = 0; i < prio_buckets(ca); i++) { in bch_prio_write()
686 ca->prio_last_buckets[i] = ca->prio_buckets[i]; in bch_prio_write()
703 ca->prio_buckets[bucket_nr] = bucket; in prio_read()
2209 kfree(ca->prio_buckets); in bch_cache_release()
2264 if (!init_fifo_exact(&ca->free[RESERVE_PRIO], prio_buckets(ca), in cache_alloc()
[all …]
Dalloc.c435 for (iter = 0; iter < prio_buckets(ca) * 2; iter++) in bch_bucket_alloc()
436 BUG_ON(ca->prio_buckets[iter] == (uint64_t) r); in bch_bucket_alloc()
Dbcache.h438 uint64_t *prio_buckets; member
792 #define prio_buckets(ca) \ macro
Dbtree.c1799 for (k = ca->prio_buckets; in bch_btree_gc_finish()
1800 k < ca->prio_buckets + prio_buckets(ca) * 2; k++) in bch_btree_gc_finish()
Djournal.c782 w->data->prio_bucket[ca->sb.nr_this_dev] = ca->prio_buckets[0]; in journal_write_unlocked()