mirror of
https://github.com/torvalds/linux.git
synced 2024-11-10 14:11:52 +00:00
920e69bc3d
This adds a new method of doing btree updates - a straight write buffer, implemented as a flat fixed size array. This is only useful when we don't need to read from the btree in order to do the update, and when reading is infrequent - perfect for the LRU btree. This will make LRU btree updates fast enough that we'll be able to use it for persistently indexing buckets by fragmentation, which will be a massive boost to copygc performance. Changes: - A new btree_insert_type enum, for btree_insert_entries. Specifies btree, btree key cache, or btree write buffer. - bch2_trans_update_buffered(): updates via the btree write buffer don't need a btree path, so we need a new update path. - Transaction commit path changes: The update to the btree write buffer both mutates global, and can fail if there isn't currently room. Therefore we do all write buffer updates in the transaction all at once, and also if it fails we have to revert filesystem usage counter changes. If there isn't room we flush the write buffer in the transaction commit error path and retry. - A new persistent option, for specifying the number of entries in the write buffer. Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>
15 lines
531 B
C
15 lines
531 B
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
#ifndef _BCACHEFS_BTREE_WRITE_BUFFER_H
|
|
#define _BCACHEFS_BTREE_WRITE_BUFFER_H
|
|
|
|
int __bch2_btree_write_buffer_flush(struct btree_trans *, unsigned, bool);
|
|
int bch2_btree_write_buffer_flush_sync(struct btree_trans *);
|
|
int bch2_btree_write_buffer_flush(struct btree_trans *);
|
|
|
|
int bch2_btree_insert_keys_write_buffer(struct btree_trans *);
|
|
|
|
void bch2_fs_btree_write_buffer_exit(struct bch_fs *);
|
|
int bch2_fs_btree_write_buffer_init(struct bch_fs *);
|
|
|
|
#endif /* _BCACHEFS_BTREE_WRITE_BUFFER_H */
|