mirror of
git://git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git
synced 2025-08-05 16:54:27 +00:00
6756e385a5
Add a persistent LRU for stripes, ordered by "number of empty blocks", i.e. order in which we wish to reuse them. This will replace the in-memory stripes heap, so we can kill off reading stripes into memory at startup. Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>
27 lines
555 B
C
27 lines
555 B
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
#ifndef _BCACHEFS_LRU_FORMAT_H
|
|
#define _BCACHEFS_LRU_FORMAT_H
|
|
|
|
struct bch_lru {
|
|
struct bch_val v;
|
|
__le64 idx;
|
|
} __packed __aligned(8);
|
|
|
|
#define BCH_LRU_TYPES() \
|
|
x(read) \
|
|
x(fragmentation) \
|
|
x(stripes)
|
|
|
|
enum bch_lru_type {
|
|
#define x(n) BCH_LRU_##n,
|
|
BCH_LRU_TYPES()
|
|
#undef x
|
|
};
|
|
|
|
#define BCH_LRU_BUCKET_FRAGMENTATION ((1U << 16) - 1)
|
|
#define BCH_LRU_STRIPE_FRAGMENTATION ((1U << 16) - 2)
|
|
|
|
#define LRU_TIME_BITS 48
|
|
#define LRU_TIME_MAX ((1ULL << LRU_TIME_BITS) - 1)
|
|
|
|
#endif /* _BCACHEFS_LRU_FORMAT_H */
|