bcache: Btree verify code improvements
Used this fixed code to find and fix the bug fixed by a4d885097b0ac0cd1337f171f2d4b83e946094d4. Signed-off-by: Kent Overstreet <kmo@daterainc.com>
这个提交包含在:
@@ -1060,9 +1060,6 @@ static void __btree_sort(struct btree *b, struct btree_iter *iter,
|
||||
btree_mergesort(b, out, iter, fixup, remove_stale);
|
||||
b->nsets = start;
|
||||
|
||||
if (!fixup && !start && b->written)
|
||||
bch_btree_verify(b, out);
|
||||
|
||||
if (!start && order == b->page_order) {
|
||||
/*
|
||||
* Our temporary buffer is the same size as the btree node's
|
||||
|
在新工单中引用
屏蔽一个用户