提交 252c38f0 编写于 作者: Y Yan 提交者: David Woodhouse

Btrfs: ctree.c cleanups

Fixup a few buffer_head release errors, and fix an off by one in
balance_node_right.
Signed-off-by: NChris Mason <chris.mason@oracle.com>
上级 58176a96
...@@ -266,8 +266,10 @@ int btrfs_realloc_node(struct btrfs_trans_handle *trans, ...@@ -266,8 +266,10 @@ int btrfs_realloc_node(struct btrfs_trans_handle *trans,
err = __btrfs_cow_block(trans, root, cur_bh, parent, i, err = __btrfs_cow_block(trans, root, cur_bh, parent, i,
&tmp_bh, search_start, &tmp_bh, search_start,
min(8, end_slot - i)); min(8, end_slot - i));
if (err) if (err) {
brelse(cur_bh);
break; break;
}
search_start = bh_blocknr(tmp_bh); search_start = bh_blocknr(tmp_bh);
*last_ret = search_start; *last_ret = search_start;
if (parent_level == 1) if (parent_level == 1)
...@@ -881,7 +883,6 @@ int btrfs_search_slot(struct btrfs_trans_handle *trans, struct btrfs_root ...@@ -881,7 +883,6 @@ int btrfs_search_slot(struct btrfs_trans_handle *trans, struct btrfs_root
ins_len, int cow) ins_len, int cow)
{ {
struct buffer_head *b; struct buffer_head *b;
struct buffer_head *cow_buf;
struct btrfs_node *c; struct btrfs_node *c;
u64 blocknr; u64 blocknr;
int slot; int slot;
...@@ -905,12 +906,11 @@ int btrfs_search_slot(struct btrfs_trans_handle *trans, struct btrfs_root ...@@ -905,12 +906,11 @@ int btrfs_search_slot(struct btrfs_trans_handle *trans, struct btrfs_root
wret = btrfs_cow_block(trans, root, b, wret = btrfs_cow_block(trans, root, b,
p->nodes[level + 1], p->nodes[level + 1],
p->slots[level + 1], p->slots[level + 1],
&cow_buf); &b);
if (wret) { if (wret) {
btrfs_block_release(root, cow_buf); btrfs_block_release(root, b);
return wret; return wret;
} }
b = cow_buf;
c = btrfs_buffer_node(b); c = btrfs_buffer_node(b);
} }
BUG_ON(!cow && ins_len); BUG_ON(!cow && ins_len);
...@@ -1075,8 +1075,9 @@ static int balance_node_right(struct btrfs_trans_handle *trans, struct ...@@ -1075,8 +1075,9 @@ static int balance_node_right(struct btrfs_trans_handle *trans, struct
max_push = src_nritems / 2 + 1; max_push = src_nritems / 2 + 1;
/* don't try to empty the node */ /* don't try to empty the node */
if (max_push > src_nritems) if (max_push >= src_nritems)
return 1; return 1;
if (max_push < push_items) if (max_push < push_items)
push_items = max_push; push_items = max_push;
...@@ -1465,6 +1466,7 @@ static int push_leaf_left(struct btrfs_trans_handle *trans, struct btrfs_root ...@@ -1465,6 +1466,7 @@ static int push_leaf_left(struct btrfs_trans_handle *trans, struct btrfs_root
ret = btrfs_cow_block(trans, root, t, path->nodes[1], slot - 1, &t); ret = btrfs_cow_block(trans, root, t, path->nodes[1], slot - 1, &t);
if (ret) { if (ret) {
/* we hit -ENOSPC, but it isn't fatal here */ /* we hit -ENOSPC, but it isn't fatal here */
btrfs_block_release(root, t);
return 1; return 1;
} }
left = btrfs_buffer_leaf(t); left = btrfs_buffer_leaf(t);
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册