linux.git/fs/bcachefs/btree_node_scan.c, branch v6.9 Linux kernel source tree bcachefs: btree node scan now fills in sectors_written 2024-04-29T01:34:29+00:00 Kent Overstreet kent.overstreet@linux.dev 2024-04-25T07:55:48+00:00 f7c3dc2646584cddae6fedc517cd58d97483e5cc Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev> 
Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>
bcachefs: node scan: ignore multiple nodes with same seq if interior 2024-04-16T23:14:00+00:00 Kent Overstreet kent.overstreet@linux.dev 2024-04-16T02:54:10+00:00 fabb4d49854281027454b0fa305d33f6c9ec4b47 Interior nodes are not really needed, when we have to scan - but if this pops up for leaf nodes we'll need a real heuristic. Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev> 
Interior nodes are not really needed, when we have to scan - but if this
pops up for leaf nodes we'll need a real heuristic.

Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>
bcachefs: bch_member.btree_allocated_bitmap 2024-04-15T00:02:11+00:00 Kent Overstreet kent.overstreet@linux.dev 2024-04-12T22:45:47+00:00 27c15ed297cb71c2e7a839439b5a097081a32605 This adds a small (64 bit) per-device bitmap that tracks ranges that have btree nodes, for accelerating btree node scan if it is ever needed. - New helpers, bch2_dev_btree_bitmap_marked() and bch2_dev_bitmap_mark(), for checking and updating the bitmap - Interior btree update path updates the bitmaps when required - The check_allocations pass has a new fsck_err check, btree_bitmap_not_marked - New on disk format version, mi_btree_mitmap, which indicates the new bitmap is present - Upgrade table lists the required recovery pass and expected fsck error - Btree node scan uses the bitmap to skip ranges if we're on the new version Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev> 
This adds a small (64 bit) per-device bitmap that tracks ranges that
have btree nodes, for accelerating btree node scan if it is ever needed.

- New helpers, bch2_dev_btree_bitmap_marked() and
  bch2_dev_bitmap_mark(), for checking and updating the bitmap

- Interior btree update path updates the bitmaps when required

- The check_allocations pass has a new fsck_err check,
  btree_bitmap_not_marked

- New on disk format version, mi_btree_mitmap, which indicates the new
  bitmap is present

- Upgrade table lists the required recovery pass and expected fsck error

- Btree node scan uses the bitmap to skip ranges if we're on the new
  version

Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>
bcachefs: btree node scan: handle encrypted nodes 2024-04-14T02:48:16+00:00 Kent Overstreet kent.overstreet@linux.dev 2024-04-12T03:38:07+00:00 87cb0239c87f608fd48fb50f9f53f129dcfd73f4 Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev> 
Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>
bcachefs: btree_node_scan: Respect member.data_allowed 2024-04-09T22:54:46+00:00 Kent Overstreet kent.overstreet@linux.dev 2024-04-09T22:50:27+00:00 9b31152fd74eeb10a20345909e542fef6f1d98e2 If a device wasn't used for btree nodes, no need to scan for them. Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev> 
If a device wasn't used for btree nodes, no need to scan for them.

Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>
bcachefs: Don't scan for btree nodes when we can reconstruct 2024-04-09T04:53:14+00:00 Kent Overstreet kent.overstreet@linux.dev 2024-04-09T04:49:39+00:00 5ab4beb759c05c74fb385ac5ca0ade5d3db67975 Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev> 
Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>
bcachefs: Repair pass for scanning for btree nodes 2024-04-03T18:44:18+00:00 Kent Overstreet kent.overstreet@linux.dev 2024-03-12T03:11:46+00:00 4409b8081d1624af814a9cda781ad9cdda3973cb If a btree root or interior btree node goes bad, we're going to lose a lot of data, unless we can recover the nodes that it pointed to by scanning. Fortunately btree node headers are fully self describing, and additionally the magic number is xored with the filesytem UUID, so we can do so safely. This implements the scanning - next patch will rework topology repair to make use of the found nodes. Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev> 
If a btree root or interior btree node goes bad, we're going to lose a
lot of data, unless we can recover the nodes that it pointed to by
scanning.

Fortunately btree node headers are fully self describing, and
additionally the magic number is xored with the filesytem UUID, so we
can do so safely.

This implements the scanning - next patch will rework topology repair to
make use of the found nodes.

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