Loading fs/btrfs/ctree.c +2 −0 Original line number Original line Diff line number Diff line Loading @@ -2052,6 +2052,7 @@ static int split_leaf(struct btrfs_trans_handle *trans, struct btrfs_root path->nodes[0] = right; path->nodes[0] = right; path->slots[0] = 0; path->slots[0] = 0; path->slots[1] += 1; path->slots[1] += 1; btrfs_mark_buffer_dirty(right); return ret; return ret; } } mid = slot; mid = slot; Loading Loading @@ -2082,6 +2083,7 @@ static int split_leaf(struct btrfs_trans_handle *trans, struct btrfs_root if (wret) if (wret) ret = wret; ret = wret; } } btrfs_mark_buffer_dirty(right); return ret; return ret; } else if (extend && slot == 0) { } else if (extend && slot == 0) { mid = 1; mid = 1; Loading Loading
fs/btrfs/ctree.c +2 −0 Original line number Original line Diff line number Diff line Loading @@ -2052,6 +2052,7 @@ static int split_leaf(struct btrfs_trans_handle *trans, struct btrfs_root path->nodes[0] = right; path->nodes[0] = right; path->slots[0] = 0; path->slots[0] = 0; path->slots[1] += 1; path->slots[1] += 1; btrfs_mark_buffer_dirty(right); return ret; return ret; } } mid = slot; mid = slot; Loading Loading @@ -2082,6 +2083,7 @@ static int split_leaf(struct btrfs_trans_handle *trans, struct btrfs_root if (wret) if (wret) ret = wret; ret = wret; } } btrfs_mark_buffer_dirty(right); return ret; return ret; } else if (extend && slot == 0) { } else if (extend && slot == 0) { mid = 1; mid = 1; Loading