| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | bcachefs: move: convert to bbpos | Kent Overstreet | 2023-10-31 | 1 | -13/+1 |
| | | | | | Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev> | ||||
| * | bcachefs: bch2_btree_id_str() | Kent Overstreet | 2023-10-31 | 1 | -1/+2 |
| | | | | | | | | 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 ↵ | Kent Overstreet | 2023-10-22 | 1 | -0/+48 |
| necessary 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> | |||||
 |
index : linux.git | |
| Linux kernel mainline tree | Linus Torvalds |
| summaryrefslogtreecommitdiffstats |