2ca88e5ad9
This introduces a new kind of btree iterator, cached iterators, which point to keys cached in a hash table. The cache also acts as a write cache - in the update path, we journal the update but defer updating the btree until the cached entry is flushed by journal reclaim. Cache coherency is for now up to the users to handle, which isn't ideal but should be good enough for now. These new iterators will be used for updating inodes and alloc info (the alloc and stripes btrees). Signed-off-by: Kent Overstreet <kent.overstreet@gmail.com> Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>
61 lines
902 B
Makefile
61 lines
902 B
Makefile
|
|
obj-$(CONFIG_BCACHEFS_FS) += bcachefs.o
|
|
|
|
bcachefs-y := \
|
|
acl.o \
|
|
alloc_background.o \
|
|
alloc_foreground.o \
|
|
bkey.o \
|
|
bkey_methods.o \
|
|
bkey_sort.o \
|
|
bset.o \
|
|
btree_cache.o \
|
|
btree_gc.o \
|
|
btree_io.o \
|
|
btree_iter.o \
|
|
btree_key_cache.o \
|
|
btree_update_interior.o \
|
|
btree_update_leaf.o \
|
|
buckets.o \
|
|
chardev.o \
|
|
checksum.o \
|
|
clock.o \
|
|
compress.o \
|
|
debug.o \
|
|
dirent.o \
|
|
disk_groups.o \
|
|
ec.o \
|
|
error.o \
|
|
extents.o \
|
|
extent_update.o \
|
|
fs.o \
|
|
fs-common.o \
|
|
fs-ioctl.o \
|
|
fs-io.o \
|
|
fsck.o \
|
|
inode.o \
|
|
io.o \
|
|
journal.o \
|
|
journal_io.o \
|
|
journal_reclaim.o \
|
|
journal_seq_blacklist.o \
|
|
keylist.o \
|
|
migrate.o \
|
|
move.o \
|
|
movinggc.o \
|
|
opts.o \
|
|
quota.o \
|
|
rebalance.o \
|
|
recovery.o \
|
|
reflink.o \
|
|
replicas.o \
|
|
siphash.o \
|
|
six.o \
|
|
super.o \
|
|
super-io.o \
|
|
sysfs.o \
|
|
tests.o \
|
|
trace.o \
|
|
util.o \
|
|
xattr.o
|