- 22 Oct, 2023 40 commits
-
-
Kent Overstreet authored
It's used in the write path when the bset isn't in the btree node buffer. Signed-off-by:
Kent Overstreet <kent.overstreet@gmail.com> Signed-off-by:
Kent Overstreet <kent.overstreet@linux.dev>
-
Kent Overstreet authored
Signed-off-by:
-
Kent Overstreet authored
Signed-off-by:
-
Kent Overstreet authored
Recently the extent update path started emmiting 0 size whiteouts on extent overwrite, as part of transitioning to moving extent handling out of the core btree code. Unfortunately, this broke the old code path that handles overlapping extents when reading in btree nodes - it relies on sorting incomming extents by start position, but the 0 size whiteouts broke that ordering. Skipping over them before the main algorithm sees them fixes this. Signed-off-by:
-
Kent Overstreet authored
Signed-off-by:
-
Kent Overstreet authored
Signed-off-by:
-
Kent Overstreet authored
This will help for debugging hangs during unmount Signed-off-by:
-
Kent Overstreet authored
Signed-off-by:
-
Kent Overstreet authored
Signed-off-by:
-
Kent Overstreet authored
BCH_FEATURE_btree_ptr_v2 wasn't getting set on new filesystems, oops Signed-off-by:
-
Kent Overstreet authored
Signed-off-by:
-
Kent Overstreet authored
Nice performance optimization Signed-off-by:
-
Kent Overstreet authored
b->level and b->btree_id weren't set when the code was checking btree_node_is_extents() Signed-off-by: -
Kent Overstreet authored
Signed-off-by:
-
Kent Overstreet authored
All iterators should be released now with bch2_trans_iter_put(), so TRANS_RESET_ITERS shouldn't be needed anymore, and TRANS_RESET_MEM is always used. Also convert more code to __bch2_trans_do(). Signed-off-by:
-
Kent Overstreet authored
Prep work for journalling updates to interior nodes - enforcing ordering will greatly simplify those changes. Signed-off-by:
-
Kent Overstreet authored
Add a new btree ptr type which contains the sequence number (random 64 bit cookie, actually) for that btree node - this lets us verify that when we read in a btree node it really is the btree node we wanted. Signed-off-by:
-
Kent Overstreet authored
This is partly prep work for introducing bch_btree_ptr_v2, but it'll also be a bit of a performance boost by moving the full key out of the hot part of struct btree. Signed-off-by:
-
Kent Overstreet authored
NULL is used to mean "reach end of traversal" - we were only initializing the leaf node in the iterator to the right sentinal value. Signed-off-by:
-
Kent Overstreet authored
Signed-off-by:
-
Kent Overstreet authored
bch2_ptr_swab was never updated when the code for generic keys with pointers was added - it assumed the entire val was only used for pointers. Signed-off-by:
-
Kent Overstreet authored
Prep work for changing the core btree update path to handle extents like regular keys; we need to reduce the scope of what BTREE_ITER_IS_EXTENTS means Signed-off-by:
-
Kent Overstreet authored
This one takes an additional argument for whether we're searching for >= or > the search key. Signed-off-by:
-
Kent Overstreet authored
Introduce a new iterator that iterates over keys in the btree with keys from the journal overlaid on top. This factors out what the erasure coding init code was doing manually. Signed-off-by:
-
Kent Overstreet authored
This wasn't originally required, but this is the model we're moving towards. Signed-off-by:
-
Kent Overstreet authored
The insert path had an optimization to short circuit lookup table/iterator fixups when overwriting an existing key with the same size value - but it was incorrect when other key fields (size/version) were changing. This is important for the upcoming rework to have extent updates use the same insert path as regular keys. Signed-off-by:
-
Kent Overstreet authored
Regression from "bcachefs: Track incompressible data" Signed-off-by:
-
Kent Overstreet authored
This should fix a transaction iterator overflow bug during fsck. Signed-off-by:
-
Kent Overstreet authored
This fixes the background_compression option: wihout some way of marking data as incompressible, rebalance will keep rewriting incompressible data over and over. Signed-off-by:
-
Kent Overstreet authored
Before, the logic for if we should move an extent was duplicated somewhat, in both rebalance_add_key() and rebalance_pred(); this centralizes that in __rebalance_pred() This is prep work for a patch that enables marking data as incompressible. Signed-off-by:
-
Kent Overstreet authored
Signed-off-by:
-
Kent Overstreet authored
Signed-off-by:
-
Kent Overstreet authored
This fixes a nasty memory corruption with other threads that are still reading the btree node being compacted. Signed-off-by:
-
Kent Overstreet authored
Signed-off-by:
-
Kent Overstreet authored
This fixes a bug with very small btree nodes where splitting would end up with one of the new nodes empty. Signed-off-by:
-
Kent Overstreet authored
Signed-off-by:
-
Kent Overstreet authored
The main thing going on is to separate out the different cases deletion, overwriting, and inserting a new key. Signed-off-by:
-
Kent Overstreet authored
- Rework some of the helper comparison functions for consistency - Currently trying to refactor all the logic that's different for extents in the btree iterator code. The main difference is that for non extents we search for a key greater than or equal to the search key, while for extents we search for a key strictly greater than the search key (iter->pos). So that logic is now handled by btree_iter_search_key(), which computes the real search key based on iter->pos and whether or not we're searching for a key >= or > iter->pos. Signed-off-by:
-
Kent Overstreet authored
Signed-off-by:
-
Kent Overstreet authored
Signed-off-by:
-
