linux.git/fs/bcachefs/bbpos.h, branch v6.7 Linux kernel source tree bcachefs: move: convert to bbpos 2023-10-31T16:18:37+00:00 Kent Overstreet kent.overstreet@linux.dev 2023-10-23T19:36:45+00:00 d5eade93452bd1a892e2155e9bb723f04992bdac Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev> 
Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>
bcachefs: bch2_btree_id_str() 2023-10-31T16:18:37+00:00 Kent Overstreet kent.overstreet@linux.dev 2023-10-20T02:49:08+00:00 88dfe193bd2abd08926c1a0d48b770bb68ac8ccb Since we can run with unknown btree IDs, we can't directly index btree IDs into fixed size arrays. Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev> 
Since we can run with unknown btree IDs, we can't directly index btree
IDs into fixed size arrays.

Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>
bcachefs: Run bch2_check_backpointers_to_extents() in multiple passes if necessary 2023-10-22T21:09:51+00:00 Kent Overstreet kent.overstreet@linux.dev 2022-10-10T02:18:06+00:00 23792a712d29ee8adc6f5c165e61e8624838169d When the extents + reflink btrees don't fit into memory this fsck pass becomes _much_ slower, since we're doing random lookups. This patch changes this pass to check how much of the relevant btrees will fit into memory, and run in multiple passes if needed. Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev> 
When the extents + reflink btrees don't fit into memory this fsck pass
becomes _much_ slower, since we're doing random lookups.

This patch changes this pass to check how much of the relevant btrees
will fit into memory, and run in multiple passes if needed.

Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>