Commit | Line | Data |
---|---|---|
6cbd5570 CM |
1 | /* |
2 | * Copyright (C) 2007 Oracle. All rights reserved. | |
3 | * | |
4 | * This program is free software; you can redistribute it and/or | |
5 | * modify it under the terms of the GNU General Public | |
6 | * License v2 as published by the Free Software Foundation. | |
7 | * | |
8 | * This program is distributed in the hope that it will be useful, | |
9 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
10 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
11 | * General Public License for more details. | |
12 | * | |
13 | * You should have received a copy of the GNU General Public | |
14 | * License along with this program; if not, write to the | |
15 | * Free Software Foundation, Inc., 59 Temple Place - Suite 330, | |
16 | * Boston, MA 021110-1307, USA. | |
17 | */ | |
18 | ||
2e635a27 | 19 | #include <linux/module.h> |
eb60ceac CM |
20 | #include "ctree.h" |
21 | #include "disk-io.h" | |
7f5c1516 | 22 | #include "transaction.h" |
9a8dd150 | 23 | |
e089f05c CM |
24 | static int split_node(struct btrfs_trans_handle *trans, struct btrfs_root |
25 | *root, struct btrfs_path *path, int level); | |
26 | static int split_leaf(struct btrfs_trans_handle *trans, struct btrfs_root | |
d4dbff95 CM |
27 | *root, struct btrfs_key *ins_key, |
28 | struct btrfs_path *path, int data_size); | |
e089f05c | 29 | static int push_node_left(struct btrfs_trans_handle *trans, struct btrfs_root |
e20d96d6 | 30 | *root, struct buffer_head *dst, struct buffer_head |
e089f05c CM |
31 | *src); |
32 | static int balance_node_right(struct btrfs_trans_handle *trans, struct | |
e20d96d6 CM |
33 | btrfs_root *root, struct buffer_head *dst_buf, |
34 | struct buffer_head *src_buf); | |
e089f05c CM |
35 | static int del_ptr(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
36 | struct btrfs_path *path, int level, int slot); | |
d97e63b6 | 37 | |
df24a2b9 | 38 | inline void btrfs_init_path(struct btrfs_path *p) |
2c90e5d6 | 39 | { |
df24a2b9 | 40 | memset(p, 0, sizeof(*p)); |
2c90e5d6 CM |
41 | } |
42 | ||
df24a2b9 | 43 | struct btrfs_path *btrfs_alloc_path(void) |
2c90e5d6 | 44 | { |
df24a2b9 CM |
45 | struct btrfs_path *path; |
46 | path = kmem_cache_alloc(btrfs_path_cachep, GFP_NOFS); | |
47 | if (path) | |
48 | btrfs_init_path(path); | |
49 | return path; | |
2c90e5d6 CM |
50 | } |
51 | ||
df24a2b9 | 52 | void btrfs_free_path(struct btrfs_path *p) |
be0e5c09 | 53 | { |
df24a2b9 CM |
54 | btrfs_release_path(NULL, p); |
55 | kmem_cache_free(btrfs_path_cachep, p); | |
be0e5c09 CM |
56 | } |
57 | ||
234b63a0 | 58 | void btrfs_release_path(struct btrfs_root *root, struct btrfs_path *p) |
eb60ceac CM |
59 | { |
60 | int i; | |
234b63a0 | 61 | for (i = 0; i < BTRFS_MAX_LEVEL; i++) { |
eb60ceac CM |
62 | if (!p->nodes[i]) |
63 | break; | |
234b63a0 | 64 | btrfs_block_release(root, p->nodes[i]); |
eb60ceac | 65 | } |
aa5d6bed | 66 | memset(p, 0, sizeof(*p)); |
eb60ceac CM |
67 | } |
68 | ||
e089f05c | 69 | static int btrfs_cow_block(struct btrfs_trans_handle *trans, struct btrfs_root |
e20d96d6 CM |
70 | *root, struct buffer_head *buf, struct buffer_head |
71 | *parent, int parent_slot, struct buffer_head | |
e089f05c | 72 | **cow_ret) |
02217ed2 | 73 | { |
e20d96d6 CM |
74 | struct buffer_head *cow; |
75 | struct btrfs_node *cow_node; | |
54aa1f4d | 76 | int ret; |
02217ed2 | 77 | |
7f5c1516 CM |
78 | if (btrfs_header_generation(btrfs_buffer_header(buf)) == |
79 | trans->transid) { | |
02217ed2 CM |
80 | *cow_ret = buf; |
81 | return 0; | |
82 | } | |
31f3c99b | 83 | cow = btrfs_alloc_free_block(trans, root, buf->b_blocknr); |
54aa1f4d CM |
84 | if (IS_ERR(cow)) |
85 | return PTR_ERR(cow); | |
e20d96d6 | 86 | cow_node = btrfs_buffer_node(cow); |
2c90e5d6 CM |
87 | if (buf->b_size != root->blocksize || cow->b_size != root->blocksize) |
88 | WARN_ON(1); | |
e20d96d6 | 89 | memcpy(cow_node, btrfs_buffer_node(buf), root->blocksize); |
7eccb903 | 90 | btrfs_set_header_blocknr(&cow_node->header, bh_blocknr(cow)); |
7f5c1516 | 91 | btrfs_set_header_generation(&cow_node->header, trans->transid); |
4d775673 | 92 | btrfs_set_header_owner(&cow_node->header, root->root_key.objectid); |
54aa1f4d CM |
93 | ret = btrfs_inc_ref(trans, root, buf); |
94 | if (ret) | |
95 | return ret; | |
02217ed2 CM |
96 | if (buf == root->node) { |
97 | root->node = cow; | |
e20d96d6 | 98 | get_bh(cow); |
2c90e5d6 | 99 | if (buf != root->commit_root) { |
7eccb903 | 100 | btrfs_free_extent(trans, root, bh_blocknr(buf), 1, 1); |
2c90e5d6 | 101 | } |
234b63a0 | 102 | btrfs_block_release(root, buf); |
02217ed2 | 103 | } else { |
e20d96d6 | 104 | btrfs_set_node_blockptr(btrfs_buffer_node(parent), parent_slot, |
7eccb903 | 105 | bh_blocknr(cow)); |
d6025579 | 106 | btrfs_mark_buffer_dirty(parent); |
7eccb903 | 107 | btrfs_free_extent(trans, root, bh_blocknr(buf), 1, 1); |
02217ed2 | 108 | } |
234b63a0 | 109 | btrfs_block_release(root, buf); |
df24a2b9 | 110 | mark_buffer_dirty(cow); |
2c90e5d6 | 111 | *cow_ret = cow; |
02217ed2 CM |
112 | return 0; |
113 | } | |
114 | ||
74123bd7 CM |
115 | /* |
116 | * The leaf data grows from end-to-front in the node. | |
117 | * this returns the address of the start of the last item, | |
118 | * which is the stop of the leaf data stack | |
119 | */ | |
123abc88 CM |
120 | static inline unsigned int leaf_data_end(struct btrfs_root *root, |
121 | struct btrfs_leaf *leaf) | |
be0e5c09 | 122 | { |
7518a238 | 123 | u32 nr = btrfs_header_nritems(&leaf->header); |
be0e5c09 | 124 | if (nr == 0) |
123abc88 | 125 | return BTRFS_LEAF_DATA_SIZE(root); |
0783fcfc | 126 | return btrfs_item_offset(leaf->items + nr - 1); |
be0e5c09 CM |
127 | } |
128 | ||
74123bd7 CM |
129 | /* |
130 | * compare two keys in a memcmp fashion | |
131 | */ | |
9aca1d51 | 132 | static int comp_keys(struct btrfs_disk_key *disk, struct btrfs_key *k2) |
be0e5c09 | 133 | { |
e2fa7227 CM |
134 | struct btrfs_key k1; |
135 | ||
136 | btrfs_disk_key_to_cpu(&k1, disk); | |
137 | ||
138 | if (k1.objectid > k2->objectid) | |
be0e5c09 | 139 | return 1; |
e2fa7227 | 140 | if (k1.objectid < k2->objectid) |
be0e5c09 | 141 | return -1; |
f254e52c CM |
142 | if (k1.flags > k2->flags) |
143 | return 1; | |
144 | if (k1.flags < k2->flags) | |
145 | return -1; | |
70b2befd CM |
146 | if (k1.offset > k2->offset) |
147 | return 1; | |
148 | if (k1.offset < k2->offset) | |
149 | return -1; | |
be0e5c09 CM |
150 | return 0; |
151 | } | |
74123bd7 | 152 | |
123abc88 CM |
153 | static int check_node(struct btrfs_root *root, struct btrfs_path *path, |
154 | int level) | |
aa5d6bed | 155 | { |
234b63a0 | 156 | struct btrfs_node *parent = NULL; |
e20d96d6 | 157 | struct btrfs_node *node = btrfs_buffer_node(path->nodes[level]); |
aa5d6bed | 158 | int parent_slot; |
8d7be552 CM |
159 | int slot; |
160 | struct btrfs_key cpukey; | |
7518a238 | 161 | u32 nritems = btrfs_header_nritems(&node->header); |
aa5d6bed CM |
162 | |
163 | if (path->nodes[level + 1]) | |
e20d96d6 | 164 | parent = btrfs_buffer_node(path->nodes[level + 1]); |
aa5d6bed | 165 | parent_slot = path->slots[level + 1]; |
8d7be552 | 166 | slot = path->slots[level]; |
7518a238 CM |
167 | BUG_ON(nritems == 0); |
168 | if (parent) { | |
e2fa7227 | 169 | struct btrfs_disk_key *parent_key; |
123abc88 CM |
170 | parent_key = &parent->ptrs[parent_slot].key; |
171 | BUG_ON(memcmp(parent_key, &node->ptrs[0].key, | |
e2fa7227 | 172 | sizeof(struct btrfs_disk_key))); |
1d4f8a0c | 173 | BUG_ON(btrfs_node_blockptr(parent, parent_slot) != |
7518a238 | 174 | btrfs_header_blocknr(&node->header)); |
aa5d6bed | 175 | } |
123abc88 | 176 | BUG_ON(nritems > BTRFS_NODEPTRS_PER_BLOCK(root)); |
8d7be552 CM |
177 | if (slot != 0) { |
178 | btrfs_disk_key_to_cpu(&cpukey, &node->ptrs[slot - 1].key); | |
179 | BUG_ON(comp_keys(&node->ptrs[slot].key, &cpukey) <= 0); | |
180 | } | |
181 | if (slot < nritems - 1) { | |
182 | btrfs_disk_key_to_cpu(&cpukey, &node->ptrs[slot + 1].key); | |
183 | BUG_ON(comp_keys(&node->ptrs[slot].key, &cpukey) >= 0); | |
aa5d6bed CM |
184 | } |
185 | return 0; | |
186 | } | |
187 | ||
123abc88 CM |
188 | static int check_leaf(struct btrfs_root *root, struct btrfs_path *path, |
189 | int level) | |
aa5d6bed | 190 | { |
e20d96d6 | 191 | struct btrfs_leaf *leaf = btrfs_buffer_leaf(path->nodes[level]); |
234b63a0 | 192 | struct btrfs_node *parent = NULL; |
aa5d6bed | 193 | int parent_slot; |
8d7be552 CM |
194 | int slot = path->slots[0]; |
195 | struct btrfs_key cpukey; | |
196 | ||
7518a238 | 197 | u32 nritems = btrfs_header_nritems(&leaf->header); |
aa5d6bed CM |
198 | |
199 | if (path->nodes[level + 1]) | |
e20d96d6 | 200 | parent = btrfs_buffer_node(path->nodes[level + 1]); |
aa5d6bed | 201 | parent_slot = path->slots[level + 1]; |
123abc88 | 202 | BUG_ON(btrfs_leaf_free_space(root, leaf) < 0); |
7518a238 CM |
203 | |
204 | if (nritems == 0) | |
205 | return 0; | |
206 | ||
207 | if (parent) { | |
e2fa7227 | 208 | struct btrfs_disk_key *parent_key; |
123abc88 | 209 | parent_key = &parent->ptrs[parent_slot].key; |
aa5d6bed | 210 | BUG_ON(memcmp(parent_key, &leaf->items[0].key, |
e2fa7227 | 211 | sizeof(struct btrfs_disk_key))); |
1d4f8a0c | 212 | BUG_ON(btrfs_node_blockptr(parent, parent_slot) != |
7518a238 | 213 | btrfs_header_blocknr(&leaf->header)); |
aa5d6bed | 214 | } |
8d7be552 CM |
215 | if (slot != 0) { |
216 | btrfs_disk_key_to_cpu(&cpukey, &leaf->items[slot - 1].key); | |
217 | BUG_ON(comp_keys(&leaf->items[slot].key, &cpukey) <= 0); | |
218 | BUG_ON(btrfs_item_offset(leaf->items + slot - 1) != | |
219 | btrfs_item_end(leaf->items + slot)); | |
220 | } | |
221 | if (slot < nritems - 1) { | |
222 | btrfs_disk_key_to_cpu(&cpukey, &leaf->items[slot + 1].key); | |
223 | BUG_ON(comp_keys(&leaf->items[slot].key, &cpukey) >= 0); | |
224 | BUG_ON(btrfs_item_offset(leaf->items + slot) != | |
225 | btrfs_item_end(leaf->items + slot + 1)); | |
aa5d6bed | 226 | } |
8d7be552 CM |
227 | BUG_ON(btrfs_item_offset(leaf->items) + |
228 | btrfs_item_size(leaf->items) != BTRFS_LEAF_DATA_SIZE(root)); | |
aa5d6bed CM |
229 | return 0; |
230 | } | |
231 | ||
123abc88 CM |
232 | static int check_block(struct btrfs_root *root, struct btrfs_path *path, |
233 | int level) | |
aa5d6bed | 234 | { |
3eb0314d CM |
235 | struct btrfs_node *node = btrfs_buffer_node(path->nodes[level]); |
236 | if (memcmp(node->header.fsid, root->fs_info->disk_super->fsid, | |
237 | sizeof(node->header.fsid))) | |
238 | BUG(); | |
aa5d6bed | 239 | if (level == 0) |
123abc88 CM |
240 | return check_leaf(root, path, level); |
241 | return check_node(root, path, level); | |
aa5d6bed CM |
242 | } |
243 | ||
74123bd7 CM |
244 | /* |
245 | * search for key in the array p. items p are item_size apart | |
246 | * and there are 'max' items in p | |
247 | * the slot in the array is returned via slot, and it points to | |
248 | * the place where you would insert key if it is not found in | |
249 | * the array. | |
250 | * | |
251 | * slot may point to max if the key is bigger than all of the keys | |
252 | */ | |
9aca1d51 | 253 | static int generic_bin_search(char *p, int item_size, struct btrfs_key *key, |
be0e5c09 CM |
254 | int max, int *slot) |
255 | { | |
256 | int low = 0; | |
257 | int high = max; | |
258 | int mid; | |
259 | int ret; | |
e2fa7227 | 260 | struct btrfs_disk_key *tmp; |
be0e5c09 CM |
261 | |
262 | while(low < high) { | |
263 | mid = (low + high) / 2; | |
e2fa7227 | 264 | tmp = (struct btrfs_disk_key *)(p + mid * item_size); |
be0e5c09 CM |
265 | ret = comp_keys(tmp, key); |
266 | ||
267 | if (ret < 0) | |
268 | low = mid + 1; | |
269 | else if (ret > 0) | |
270 | high = mid; | |
271 | else { | |
272 | *slot = mid; | |
273 | return 0; | |
274 | } | |
275 | } | |
276 | *slot = low; | |
277 | return 1; | |
278 | } | |
279 | ||
97571fd0 CM |
280 | /* |
281 | * simple bin_search frontend that does the right thing for | |
282 | * leaves vs nodes | |
283 | */ | |
9aca1d51 | 284 | static int bin_search(struct btrfs_node *c, struct btrfs_key *key, int *slot) |
be0e5c09 | 285 | { |
7518a238 | 286 | if (btrfs_is_leaf(c)) { |
234b63a0 | 287 | struct btrfs_leaf *l = (struct btrfs_leaf *)c; |
0783fcfc CM |
288 | return generic_bin_search((void *)l->items, |
289 | sizeof(struct btrfs_item), | |
7518a238 CM |
290 | key, btrfs_header_nritems(&c->header), |
291 | slot); | |
be0e5c09 | 292 | } else { |
123abc88 CM |
293 | return generic_bin_search((void *)c->ptrs, |
294 | sizeof(struct btrfs_key_ptr), | |
7518a238 CM |
295 | key, btrfs_header_nritems(&c->header), |
296 | slot); | |
be0e5c09 CM |
297 | } |
298 | return -1; | |
299 | } | |
300 | ||
e20d96d6 CM |
301 | static struct buffer_head *read_node_slot(struct btrfs_root *root, |
302 | struct buffer_head *parent_buf, | |
bb803951 CM |
303 | int slot) |
304 | { | |
e20d96d6 | 305 | struct btrfs_node *node = btrfs_buffer_node(parent_buf); |
bb803951 CM |
306 | if (slot < 0) |
307 | return NULL; | |
7518a238 | 308 | if (slot >= btrfs_header_nritems(&node->header)) |
bb803951 | 309 | return NULL; |
1d4f8a0c | 310 | return read_tree_block(root, btrfs_node_blockptr(node, slot)); |
bb803951 CM |
311 | } |
312 | ||
e089f05c CM |
313 | static int balance_level(struct btrfs_trans_handle *trans, struct btrfs_root |
314 | *root, struct btrfs_path *path, int level) | |
bb803951 | 315 | { |
e20d96d6 CM |
316 | struct buffer_head *right_buf; |
317 | struct buffer_head *mid_buf; | |
318 | struct buffer_head *left_buf; | |
319 | struct buffer_head *parent_buf = NULL; | |
234b63a0 CM |
320 | struct btrfs_node *right = NULL; |
321 | struct btrfs_node *mid; | |
322 | struct btrfs_node *left = NULL; | |
323 | struct btrfs_node *parent = NULL; | |
bb803951 CM |
324 | int ret = 0; |
325 | int wret; | |
326 | int pslot; | |
bb803951 | 327 | int orig_slot = path->slots[level]; |
54aa1f4d | 328 | int err_on_enospc = 0; |
79f95c82 | 329 | u64 orig_ptr; |
bb803951 CM |
330 | |
331 | if (level == 0) | |
332 | return 0; | |
333 | ||
334 | mid_buf = path->nodes[level]; | |
e20d96d6 | 335 | mid = btrfs_buffer_node(mid_buf); |
1d4f8a0c | 336 | orig_ptr = btrfs_node_blockptr(mid, orig_slot); |
79f95c82 | 337 | |
234b63a0 | 338 | if (level < BTRFS_MAX_LEVEL - 1) |
bb803951 CM |
339 | parent_buf = path->nodes[level + 1]; |
340 | pslot = path->slots[level + 1]; | |
341 | ||
40689478 CM |
342 | /* |
343 | * deal with the case where there is only one pointer in the root | |
344 | * by promoting the node below to a root | |
345 | */ | |
bb803951 | 346 | if (!parent_buf) { |
e20d96d6 | 347 | struct buffer_head *child; |
7eccb903 | 348 | u64 blocknr = bh_blocknr(mid_buf); |
bb803951 | 349 | |
7518a238 | 350 | if (btrfs_header_nritems(&mid->header) != 1) |
bb803951 CM |
351 | return 0; |
352 | ||
353 | /* promote the child to a root */ | |
354 | child = read_node_slot(root, mid_buf, 0); | |
355 | BUG_ON(!child); | |
356 | root->node = child; | |
357 | path->nodes[level] = NULL; | |
d6025579 CM |
358 | clean_tree_block(trans, root, mid_buf); |
359 | wait_on_buffer(mid_buf); | |
bb803951 | 360 | /* once for the path */ |
234b63a0 | 361 | btrfs_block_release(root, mid_buf); |
bb803951 | 362 | /* once for the root ptr */ |
234b63a0 | 363 | btrfs_block_release(root, mid_buf); |
e089f05c | 364 | return btrfs_free_extent(trans, root, blocknr, 1, 1); |
bb803951 | 365 | } |
e20d96d6 | 366 | parent = btrfs_buffer_node(parent_buf); |
bb803951 | 367 | |
123abc88 CM |
368 | if (btrfs_header_nritems(&mid->header) > |
369 | BTRFS_NODEPTRS_PER_BLOCK(root) / 4) | |
bb803951 CM |
370 | return 0; |
371 | ||
54aa1f4d CM |
372 | if (btrfs_header_nritems(&mid->header) < 2) |
373 | err_on_enospc = 1; | |
374 | ||
bb803951 CM |
375 | left_buf = read_node_slot(root, parent_buf, pslot - 1); |
376 | right_buf = read_node_slot(root, parent_buf, pslot + 1); | |
79f95c82 CM |
377 | |
378 | /* first, try to make some room in the middle buffer */ | |
bb803951 | 379 | if (left_buf) { |
54aa1f4d CM |
380 | wret = btrfs_cow_block(trans, root, left_buf, |
381 | parent_buf, pslot - 1, &left_buf); | |
382 | if (wret) { | |
383 | ret = wret; | |
384 | goto enospc; | |
385 | } | |
e20d96d6 | 386 | left = btrfs_buffer_node(left_buf); |
7518a238 | 387 | orig_slot += btrfs_header_nritems(&left->header); |
e089f05c | 388 | wret = push_node_left(trans, root, left_buf, mid_buf); |
79f95c82 CM |
389 | if (wret < 0) |
390 | ret = wret; | |
54aa1f4d CM |
391 | if (btrfs_header_nritems(&mid->header) < 2) |
392 | err_on_enospc = 1; | |
bb803951 | 393 | } |
79f95c82 CM |
394 | |
395 | /* | |
396 | * then try to empty the right most buffer into the middle | |
397 | */ | |
bb803951 | 398 | if (right_buf) { |
54aa1f4d CM |
399 | wret = btrfs_cow_block(trans, root, right_buf, |
400 | parent_buf, pslot + 1, &right_buf); | |
401 | if (wret) { | |
402 | ret = wret; | |
403 | goto enospc; | |
404 | } | |
405 | ||
e20d96d6 | 406 | right = btrfs_buffer_node(right_buf); |
e089f05c | 407 | wret = push_node_left(trans, root, mid_buf, right_buf); |
54aa1f4d | 408 | if (wret < 0 && wret != -ENOSPC) |
79f95c82 | 409 | ret = wret; |
7518a238 | 410 | if (btrfs_header_nritems(&right->header) == 0) { |
7eccb903 | 411 | u64 blocknr = bh_blocknr(right_buf); |
e089f05c | 412 | clean_tree_block(trans, root, right_buf); |
d6025579 CM |
413 | wait_on_buffer(right_buf); |
414 | btrfs_block_release(root, right_buf); | |
bb803951 CM |
415 | right_buf = NULL; |
416 | right = NULL; | |
e089f05c CM |
417 | wret = del_ptr(trans, root, path, level + 1, pslot + |
418 | 1); | |
bb803951 CM |
419 | if (wret) |
420 | ret = wret; | |
e089f05c | 421 | wret = btrfs_free_extent(trans, root, blocknr, 1, 1); |
bb803951 CM |
422 | if (wret) |
423 | ret = wret; | |
424 | } else { | |
d6025579 CM |
425 | btrfs_memcpy(root, parent, |
426 | &parent->ptrs[pslot + 1].key, | |
427 | &right->ptrs[0].key, | |
428 | sizeof(struct btrfs_disk_key)); | |
429 | btrfs_mark_buffer_dirty(parent_buf); | |
bb803951 CM |
430 | } |
431 | } | |
7518a238 | 432 | if (btrfs_header_nritems(&mid->header) == 1) { |
79f95c82 CM |
433 | /* |
434 | * we're not allowed to leave a node with one item in the | |
435 | * tree during a delete. A deletion from lower in the tree | |
436 | * could try to delete the only pointer in this node. | |
437 | * So, pull some keys from the left. | |
438 | * There has to be a left pointer at this point because | |
439 | * otherwise we would have pulled some pointers from the | |
440 | * right | |
441 | */ | |
442 | BUG_ON(!left_buf); | |
e089f05c | 443 | wret = balance_node_right(trans, root, mid_buf, left_buf); |
54aa1f4d | 444 | if (wret < 0) { |
79f95c82 | 445 | ret = wret; |
54aa1f4d CM |
446 | goto enospc; |
447 | } | |
79f95c82 CM |
448 | BUG_ON(wret == 1); |
449 | } | |
7518a238 | 450 | if (btrfs_header_nritems(&mid->header) == 0) { |
79f95c82 | 451 | /* we've managed to empty the middle node, drop it */ |
7eccb903 | 452 | u64 blocknr = bh_blocknr(mid_buf); |
e089f05c | 453 | clean_tree_block(trans, root, mid_buf); |
d6025579 CM |
454 | wait_on_buffer(mid_buf); |
455 | btrfs_block_release(root, mid_buf); | |
bb803951 CM |
456 | mid_buf = NULL; |
457 | mid = NULL; | |
e089f05c | 458 | wret = del_ptr(trans, root, path, level + 1, pslot); |
bb803951 CM |
459 | if (wret) |
460 | ret = wret; | |
e089f05c | 461 | wret = btrfs_free_extent(trans, root, blocknr, 1, 1); |
bb803951 CM |
462 | if (wret) |
463 | ret = wret; | |
79f95c82 CM |
464 | } else { |
465 | /* update the parent key to reflect our changes */ | |
d6025579 CM |
466 | btrfs_memcpy(root, parent, |
467 | &parent->ptrs[pslot].key, &mid->ptrs[0].key, | |
468 | sizeof(struct btrfs_disk_key)); | |
469 | btrfs_mark_buffer_dirty(parent_buf); | |
79f95c82 | 470 | } |
bb803951 | 471 | |
79f95c82 | 472 | /* update the path */ |
bb803951 | 473 | if (left_buf) { |
7518a238 | 474 | if (btrfs_header_nritems(&left->header) > orig_slot) { |
e20d96d6 | 475 | get_bh(left_buf); |
bb803951 CM |
476 | path->nodes[level] = left_buf; |
477 | path->slots[level + 1] -= 1; | |
478 | path->slots[level] = orig_slot; | |
479 | if (mid_buf) | |
234b63a0 | 480 | btrfs_block_release(root, mid_buf); |
bb803951 | 481 | } else { |
7518a238 | 482 | orig_slot -= btrfs_header_nritems(&left->header); |
bb803951 CM |
483 | path->slots[level] = orig_slot; |
484 | } | |
485 | } | |
79f95c82 | 486 | /* double check we haven't messed things up */ |
123abc88 | 487 | check_block(root, path, level); |
e20d96d6 CM |
488 | if (orig_ptr != |
489 | btrfs_node_blockptr(btrfs_buffer_node(path->nodes[level]), | |
490 | path->slots[level])) | |
79f95c82 | 491 | BUG(); |
54aa1f4d | 492 | enospc: |
bb803951 | 493 | if (right_buf) |
234b63a0 | 494 | btrfs_block_release(root, right_buf); |
bb803951 | 495 | if (left_buf) |
234b63a0 | 496 | btrfs_block_release(root, left_buf); |
bb803951 CM |
497 | return ret; |
498 | } | |
499 | ||
e66f709b CM |
500 | /* returns zero if the push worked, non-zero otherwise */ |
501 | static int push_nodes_for_insert(struct btrfs_trans_handle *trans, | |
502 | struct btrfs_root *root, | |
503 | struct btrfs_path *path, int level) | |
504 | { | |
505 | struct buffer_head *right_buf; | |
506 | struct buffer_head *mid_buf; | |
507 | struct buffer_head *left_buf; | |
508 | struct buffer_head *parent_buf = NULL; | |
509 | struct btrfs_node *right = NULL; | |
510 | struct btrfs_node *mid; | |
511 | struct btrfs_node *left = NULL; | |
512 | struct btrfs_node *parent = NULL; | |
513 | int ret = 0; | |
514 | int wret; | |
515 | int pslot; | |
516 | int orig_slot = path->slots[level]; | |
517 | u64 orig_ptr; | |
518 | ||
519 | if (level == 0) | |
520 | return 1; | |
521 | ||
522 | mid_buf = path->nodes[level]; | |
523 | mid = btrfs_buffer_node(mid_buf); | |
524 | orig_ptr = btrfs_node_blockptr(mid, orig_slot); | |
525 | ||
526 | if (level < BTRFS_MAX_LEVEL - 1) | |
527 | parent_buf = path->nodes[level + 1]; | |
528 | pslot = path->slots[level + 1]; | |
529 | ||
530 | if (!parent_buf) | |
531 | return 1; | |
532 | parent = btrfs_buffer_node(parent_buf); | |
533 | ||
534 | left_buf = read_node_slot(root, parent_buf, pslot - 1); | |
535 | ||
536 | /* first, try to make some room in the middle buffer */ | |
537 | if (left_buf) { | |
538 | u32 left_nr; | |
e66f709b CM |
539 | left = btrfs_buffer_node(left_buf); |
540 | left_nr = btrfs_header_nritems(&left->header); | |
33ade1f8 CM |
541 | if (left_nr >= BTRFS_NODEPTRS_PER_BLOCK(root) - 1) { |
542 | wret = 1; | |
543 | } else { | |
54aa1f4d CM |
544 | ret = btrfs_cow_block(trans, root, left_buf, parent_buf, |
545 | pslot - 1, &left_buf); | |
546 | if (ret) | |
547 | wret = 1; | |
548 | else { | |
549 | left = btrfs_buffer_node(left_buf); | |
550 | wret = push_node_left(trans, root, | |
551 | left_buf, mid_buf); | |
552 | } | |
33ade1f8 | 553 | } |
e66f709b CM |
554 | if (wret < 0) |
555 | ret = wret; | |
556 | if (wret == 0) { | |
557 | orig_slot += left_nr; | |
558 | btrfs_memcpy(root, parent, | |
559 | &parent->ptrs[pslot].key, | |
560 | &mid->ptrs[0].key, | |
561 | sizeof(struct btrfs_disk_key)); | |
562 | btrfs_mark_buffer_dirty(parent_buf); | |
563 | if (btrfs_header_nritems(&left->header) > orig_slot) { | |
564 | path->nodes[level] = left_buf; | |
565 | path->slots[level + 1] -= 1; | |
566 | path->slots[level] = orig_slot; | |
567 | btrfs_block_release(root, mid_buf); | |
568 | } else { | |
569 | orig_slot -= | |
570 | btrfs_header_nritems(&left->header); | |
571 | path->slots[level] = orig_slot; | |
572 | btrfs_block_release(root, left_buf); | |
573 | } | |
574 | check_node(root, path, level); | |
575 | return 0; | |
576 | } | |
577 | btrfs_block_release(root, left_buf); | |
578 | } | |
579 | right_buf = read_node_slot(root, parent_buf, pslot + 1); | |
580 | ||
581 | /* | |
582 | * then try to empty the right most buffer into the middle | |
583 | */ | |
584 | if (right_buf) { | |
33ade1f8 | 585 | u32 right_nr; |
e66f709b | 586 | right = btrfs_buffer_node(right_buf); |
33ade1f8 CM |
587 | right_nr = btrfs_header_nritems(&right->header); |
588 | if (right_nr >= BTRFS_NODEPTRS_PER_BLOCK(root) - 1) { | |
589 | wret = 1; | |
590 | } else { | |
54aa1f4d CM |
591 | ret = btrfs_cow_block(trans, root, right_buf, |
592 | parent_buf, pslot + 1, | |
593 | &right_buf); | |
594 | if (ret) | |
595 | wret = 1; | |
596 | else { | |
597 | right = btrfs_buffer_node(right_buf); | |
598 | wret = balance_node_right(trans, root, | |
599 | right_buf, mid_buf); | |
600 | } | |
33ade1f8 | 601 | } |
e66f709b CM |
602 | if (wret < 0) |
603 | ret = wret; | |
604 | if (wret == 0) { | |
605 | btrfs_memcpy(root, parent, | |
606 | &parent->ptrs[pslot + 1].key, | |
607 | &right->ptrs[0].key, | |
608 | sizeof(struct btrfs_disk_key)); | |
609 | btrfs_mark_buffer_dirty(parent_buf); | |
610 | if (btrfs_header_nritems(&mid->header) <= orig_slot) { | |
611 | path->nodes[level] = right_buf; | |
612 | path->slots[level + 1] += 1; | |
613 | path->slots[level] = orig_slot - | |
614 | btrfs_header_nritems(&mid->header); | |
615 | btrfs_block_release(root, mid_buf); | |
616 | } else { | |
617 | btrfs_block_release(root, right_buf); | |
618 | } | |
619 | check_node(root, path, level); | |
620 | return 0; | |
621 | } | |
622 | btrfs_block_release(root, right_buf); | |
623 | } | |
624 | check_node(root, path, level); | |
625 | return 1; | |
626 | } | |
627 | ||
74123bd7 CM |
628 | /* |
629 | * look for key in the tree. path is filled in with nodes along the way | |
630 | * if key is found, we return zero and you can find the item in the leaf | |
631 | * level of the path (level 0) | |
632 | * | |
633 | * If the key isn't found, the path points to the slot where it should | |
aa5d6bed CM |
634 | * be inserted, and 1 is returned. If there are other errors during the |
635 | * search a negative error number is returned. | |
97571fd0 CM |
636 | * |
637 | * if ins_len > 0, nodes and leaves will be split as we walk down the | |
638 | * tree. if ins_len < 0, nodes will be merged as we walk down the tree (if | |
639 | * possible) | |
74123bd7 | 640 | */ |
e089f05c CM |
641 | int btrfs_search_slot(struct btrfs_trans_handle *trans, struct btrfs_root |
642 | *root, struct btrfs_key *key, struct btrfs_path *p, int | |
643 | ins_len, int cow) | |
be0e5c09 | 644 | { |
e20d96d6 CM |
645 | struct buffer_head *b; |
646 | struct buffer_head *cow_buf; | |
234b63a0 | 647 | struct btrfs_node *c; |
be0e5c09 CM |
648 | int slot; |
649 | int ret; | |
650 | int level; | |
5c680ed6 | 651 | |
22b0ebda CM |
652 | WARN_ON(p->nodes[0] != NULL); |
653 | WARN_ON(!mutex_is_locked(&root->fs_info->fs_mutex)); | |
bb803951 CM |
654 | again: |
655 | b = root->node; | |
e20d96d6 | 656 | get_bh(b); |
eb60ceac | 657 | while (b) { |
e20d96d6 CM |
658 | c = btrfs_buffer_node(b); |
659 | level = btrfs_header_level(&c->header); | |
02217ed2 CM |
660 | if (cow) { |
661 | int wret; | |
e20d96d6 CM |
662 | wret = btrfs_cow_block(trans, root, b, |
663 | p->nodes[level + 1], | |
664 | p->slots[level + 1], | |
e089f05c | 665 | &cow_buf); |
54aa1f4d CM |
666 | if (wret) { |
667 | btrfs_block_release(root, cow_buf); | |
668 | return wret; | |
669 | } | |
02217ed2 | 670 | b = cow_buf; |
2c90e5d6 | 671 | c = btrfs_buffer_node(b); |
02217ed2 CM |
672 | } |
673 | BUG_ON(!cow && ins_len); | |
2c90e5d6 CM |
674 | if (level != btrfs_header_level(&c->header)) |
675 | WARN_ON(1); | |
676 | level = btrfs_header_level(&c->header); | |
eb60ceac | 677 | p->nodes[level] = b; |
123abc88 | 678 | ret = check_block(root, p, level); |
aa5d6bed CM |
679 | if (ret) |
680 | return -1; | |
be0e5c09 | 681 | ret = bin_search(c, key, &slot); |
7518a238 | 682 | if (!btrfs_is_leaf(c)) { |
be0e5c09 CM |
683 | if (ret && slot > 0) |
684 | slot -= 1; | |
685 | p->slots[level] = slot; | |
d4dbff95 CM |
686 | if (ins_len > 0 && btrfs_header_nritems(&c->header) >= |
687 | BTRFS_NODEPTRS_PER_BLOCK(root) - 1) { | |
e089f05c | 688 | int sret = split_node(trans, root, p, level); |
5c680ed6 CM |
689 | BUG_ON(sret > 0); |
690 | if (sret) | |
691 | return sret; | |
692 | b = p->nodes[level]; | |
e20d96d6 | 693 | c = btrfs_buffer_node(b); |
5c680ed6 | 694 | slot = p->slots[level]; |
bb803951 | 695 | } else if (ins_len < 0) { |
e089f05c CM |
696 | int sret = balance_level(trans, root, p, |
697 | level); | |
bb803951 CM |
698 | if (sret) |
699 | return sret; | |
700 | b = p->nodes[level]; | |
701 | if (!b) | |
702 | goto again; | |
e20d96d6 | 703 | c = btrfs_buffer_node(b); |
bb803951 | 704 | slot = p->slots[level]; |
7518a238 | 705 | BUG_ON(btrfs_header_nritems(&c->header) == 1); |
5c680ed6 | 706 | } |
1d4f8a0c | 707 | b = read_tree_block(root, btrfs_node_blockptr(c, slot)); |
be0e5c09 | 708 | } else { |
234b63a0 | 709 | struct btrfs_leaf *l = (struct btrfs_leaf *)c; |
be0e5c09 | 710 | p->slots[level] = slot; |
123abc88 | 711 | if (ins_len > 0 && btrfs_leaf_free_space(root, l) < |
0783fcfc | 712 | sizeof(struct btrfs_item) + ins_len) { |
d4dbff95 CM |
713 | int sret = split_leaf(trans, root, key, |
714 | p, ins_len); | |
5c680ed6 CM |
715 | BUG_ON(sret > 0); |
716 | if (sret) | |
717 | return sret; | |
718 | } | |
be0e5c09 CM |
719 | return ret; |
720 | } | |
721 | } | |
aa5d6bed | 722 | return 1; |
be0e5c09 CM |
723 | } |
724 | ||
74123bd7 CM |
725 | /* |
726 | * adjust the pointers going up the tree, starting at level | |
727 | * making sure the right key of each node is points to 'key'. | |
728 | * This is used after shifting pointers to the left, so it stops | |
729 | * fixing up pointers when a given leaf/node is not in slot 0 of the | |
730 | * higher levels | |
aa5d6bed CM |
731 | * |
732 | * If this fails to write a tree block, it returns -1, but continues | |
733 | * fixing up the blocks in ram so the tree is consistent. | |
74123bd7 | 734 | */ |
e089f05c CM |
735 | static int fixup_low_keys(struct btrfs_trans_handle *trans, struct btrfs_root |
736 | *root, struct btrfs_path *path, struct btrfs_disk_key | |
737 | *key, int level) | |
be0e5c09 CM |
738 | { |
739 | int i; | |
aa5d6bed | 740 | int ret = 0; |
234b63a0 CM |
741 | for (i = level; i < BTRFS_MAX_LEVEL; i++) { |
742 | struct btrfs_node *t; | |
be0e5c09 | 743 | int tslot = path->slots[i]; |
eb60ceac | 744 | if (!path->nodes[i]) |
be0e5c09 | 745 | break; |
e20d96d6 | 746 | t = btrfs_buffer_node(path->nodes[i]); |
d6025579 CM |
747 | btrfs_memcpy(root, t, &t->ptrs[tslot].key, key, sizeof(*key)); |
748 | btrfs_mark_buffer_dirty(path->nodes[i]); | |
be0e5c09 CM |
749 | if (tslot != 0) |
750 | break; | |
751 | } | |
aa5d6bed | 752 | return ret; |
be0e5c09 CM |
753 | } |
754 | ||
74123bd7 CM |
755 | /* |
756 | * try to push data from one node into the next node left in the | |
79f95c82 | 757 | * tree. |
aa5d6bed CM |
758 | * |
759 | * returns 0 if some ptrs were pushed left, < 0 if there was some horrible | |
760 | * error, and > 0 if there was no room in the left hand block. | |
74123bd7 | 761 | */ |
e089f05c | 762 | static int push_node_left(struct btrfs_trans_handle *trans, struct btrfs_root |
e20d96d6 CM |
763 | *root, struct buffer_head *dst_buf, struct |
764 | buffer_head *src_buf) | |
be0e5c09 | 765 | { |
e20d96d6 CM |
766 | struct btrfs_node *src = btrfs_buffer_node(src_buf); |
767 | struct btrfs_node *dst = btrfs_buffer_node(dst_buf); | |
be0e5c09 | 768 | int push_items = 0; |
bb803951 CM |
769 | int src_nritems; |
770 | int dst_nritems; | |
aa5d6bed | 771 | int ret = 0; |
be0e5c09 | 772 | |
7518a238 CM |
773 | src_nritems = btrfs_header_nritems(&src->header); |
774 | dst_nritems = btrfs_header_nritems(&dst->header); | |
123abc88 | 775 | push_items = BTRFS_NODEPTRS_PER_BLOCK(root) - dst_nritems; |
54aa1f4d | 776 | |
eb60ceac | 777 | if (push_items <= 0) { |
be0e5c09 | 778 | return 1; |
eb60ceac | 779 | } |
be0e5c09 | 780 | |
bb803951 | 781 | if (src_nritems < push_items) |
79f95c82 CM |
782 | push_items = src_nritems; |
783 | ||
d6025579 CM |
784 | btrfs_memcpy(root, dst, dst->ptrs + dst_nritems, src->ptrs, |
785 | push_items * sizeof(struct btrfs_key_ptr)); | |
bb803951 | 786 | if (push_items < src_nritems) { |
d6025579 | 787 | btrfs_memmove(root, src, src->ptrs, src->ptrs + push_items, |
e2fa7227 | 788 | (src_nritems - push_items) * |
123abc88 | 789 | sizeof(struct btrfs_key_ptr)); |
bb803951 | 790 | } |
7518a238 CM |
791 | btrfs_set_header_nritems(&src->header, src_nritems - push_items); |
792 | btrfs_set_header_nritems(&dst->header, dst_nritems + push_items); | |
d6025579 CM |
793 | btrfs_mark_buffer_dirty(src_buf); |
794 | btrfs_mark_buffer_dirty(dst_buf); | |
79f95c82 CM |
795 | return ret; |
796 | } | |
797 | ||
798 | /* | |
799 | * try to push data from one node into the next node right in the | |
800 | * tree. | |
801 | * | |
802 | * returns 0 if some ptrs were pushed, < 0 if there was some horrible | |
803 | * error, and > 0 if there was no room in the right hand block. | |
804 | * | |
805 | * this will only push up to 1/2 the contents of the left node over | |
806 | */ | |
e089f05c | 807 | static int balance_node_right(struct btrfs_trans_handle *trans, struct |
e20d96d6 CM |
808 | btrfs_root *root, struct buffer_head *dst_buf, |
809 | struct buffer_head *src_buf) | |
79f95c82 | 810 | { |
e20d96d6 CM |
811 | struct btrfs_node *src = btrfs_buffer_node(src_buf); |
812 | struct btrfs_node *dst = btrfs_buffer_node(dst_buf); | |
79f95c82 CM |
813 | int push_items = 0; |
814 | int max_push; | |
815 | int src_nritems; | |
816 | int dst_nritems; | |
817 | int ret = 0; | |
79f95c82 | 818 | |
7518a238 CM |
819 | src_nritems = btrfs_header_nritems(&src->header); |
820 | dst_nritems = btrfs_header_nritems(&dst->header); | |
123abc88 | 821 | push_items = BTRFS_NODEPTRS_PER_BLOCK(root) - dst_nritems; |
79f95c82 CM |
822 | if (push_items <= 0) { |
823 | return 1; | |
824 | } | |
825 | ||
826 | max_push = src_nritems / 2 + 1; | |
827 | /* don't try to empty the node */ | |
828 | if (max_push > src_nritems) | |
829 | return 1; | |
830 | if (max_push < push_items) | |
831 | push_items = max_push; | |
832 | ||
d6025579 CM |
833 | btrfs_memmove(root, dst, dst->ptrs + push_items, dst->ptrs, |
834 | dst_nritems * sizeof(struct btrfs_key_ptr)); | |
835 | ||
836 | btrfs_memcpy(root, dst, dst->ptrs, | |
837 | src->ptrs + src_nritems - push_items, | |
838 | push_items * sizeof(struct btrfs_key_ptr)); | |
79f95c82 | 839 | |
7518a238 CM |
840 | btrfs_set_header_nritems(&src->header, src_nritems - push_items); |
841 | btrfs_set_header_nritems(&dst->header, dst_nritems + push_items); | |
79f95c82 | 842 | |
d6025579 CM |
843 | btrfs_mark_buffer_dirty(src_buf); |
844 | btrfs_mark_buffer_dirty(dst_buf); | |
aa5d6bed | 845 | return ret; |
be0e5c09 CM |
846 | } |
847 | ||
97571fd0 CM |
848 | /* |
849 | * helper function to insert a new root level in the tree. | |
850 | * A new node is allocated, and a single item is inserted to | |
851 | * point to the existing root | |
aa5d6bed CM |
852 | * |
853 | * returns zero on success or < 0 on failure. | |
97571fd0 | 854 | */ |
e089f05c CM |
855 | static int insert_new_root(struct btrfs_trans_handle *trans, struct btrfs_root |
856 | *root, struct btrfs_path *path, int level) | |
5c680ed6 | 857 | { |
e20d96d6 | 858 | struct buffer_head *t; |
234b63a0 CM |
859 | struct btrfs_node *lower; |
860 | struct btrfs_node *c; | |
e2fa7227 | 861 | struct btrfs_disk_key *lower_key; |
5c680ed6 CM |
862 | |
863 | BUG_ON(path->nodes[level]); | |
864 | BUG_ON(path->nodes[level-1] != root->node); | |
865 | ||
31f3c99b | 866 | t = btrfs_alloc_free_block(trans, root, root->node->b_blocknr); |
54aa1f4d CM |
867 | if (IS_ERR(t)) |
868 | return PTR_ERR(t); | |
e20d96d6 | 869 | c = btrfs_buffer_node(t); |
123abc88 | 870 | memset(c, 0, root->blocksize); |
7518a238 CM |
871 | btrfs_set_header_nritems(&c->header, 1); |
872 | btrfs_set_header_level(&c->header, level); | |
7eccb903 | 873 | btrfs_set_header_blocknr(&c->header, bh_blocknr(t)); |
7f5c1516 | 874 | btrfs_set_header_generation(&c->header, trans->transid); |
4d775673 | 875 | btrfs_set_header_owner(&c->header, root->root_key.objectid); |
e20d96d6 | 876 | lower = btrfs_buffer_node(path->nodes[level-1]); |
3eb0314d CM |
877 | memcpy(c->header.fsid, root->fs_info->disk_super->fsid, |
878 | sizeof(c->header.fsid)); | |
7518a238 | 879 | if (btrfs_is_leaf(lower)) |
234b63a0 | 880 | lower_key = &((struct btrfs_leaf *)lower)->items[0].key; |
5c680ed6 | 881 | else |
123abc88 | 882 | lower_key = &lower->ptrs[0].key; |
d6025579 CM |
883 | btrfs_memcpy(root, c, &c->ptrs[0].key, lower_key, |
884 | sizeof(struct btrfs_disk_key)); | |
7eccb903 | 885 | btrfs_set_node_blockptr(c, 0, bh_blocknr(path->nodes[level - 1])); |
d5719762 | 886 | |
d6025579 | 887 | btrfs_mark_buffer_dirty(t); |
d5719762 | 888 | |
5c680ed6 | 889 | /* the super has an extra ref to root->node */ |
234b63a0 | 890 | btrfs_block_release(root, root->node); |
5c680ed6 | 891 | root->node = t; |
e20d96d6 | 892 | get_bh(t); |
5c680ed6 CM |
893 | path->nodes[level] = t; |
894 | path->slots[level] = 0; | |
895 | return 0; | |
896 | } | |
897 | ||
74123bd7 CM |
898 | /* |
899 | * worker function to insert a single pointer in a node. | |
900 | * the node should have enough room for the pointer already | |
97571fd0 | 901 | * |
74123bd7 CM |
902 | * slot and level indicate where you want the key to go, and |
903 | * blocknr is the block the key points to. | |
aa5d6bed CM |
904 | * |
905 | * returns zero on success and < 0 on any error | |
74123bd7 | 906 | */ |
e089f05c CM |
907 | static int insert_ptr(struct btrfs_trans_handle *trans, struct btrfs_root |
908 | *root, struct btrfs_path *path, struct btrfs_disk_key | |
909 | *key, u64 blocknr, int slot, int level) | |
74123bd7 | 910 | { |
234b63a0 | 911 | struct btrfs_node *lower; |
74123bd7 | 912 | int nritems; |
5c680ed6 CM |
913 | |
914 | BUG_ON(!path->nodes[level]); | |
e20d96d6 | 915 | lower = btrfs_buffer_node(path->nodes[level]); |
7518a238 | 916 | nritems = btrfs_header_nritems(&lower->header); |
74123bd7 CM |
917 | if (slot > nritems) |
918 | BUG(); | |
123abc88 | 919 | if (nritems == BTRFS_NODEPTRS_PER_BLOCK(root)) |
74123bd7 CM |
920 | BUG(); |
921 | if (slot != nritems) { | |
d6025579 CM |
922 | btrfs_memmove(root, lower, lower->ptrs + slot + 1, |
923 | lower->ptrs + slot, | |
924 | (nritems - slot) * sizeof(struct btrfs_key_ptr)); | |
74123bd7 | 925 | } |
d6025579 CM |
926 | btrfs_memcpy(root, lower, &lower->ptrs[slot].key, |
927 | key, sizeof(struct btrfs_disk_key)); | |
1d4f8a0c | 928 | btrfs_set_node_blockptr(lower, slot, blocknr); |
7518a238 | 929 | btrfs_set_header_nritems(&lower->header, nritems + 1); |
d6025579 | 930 | btrfs_mark_buffer_dirty(path->nodes[level]); |
098f59c2 | 931 | check_node(root, path, level); |
74123bd7 CM |
932 | return 0; |
933 | } | |
934 | ||
97571fd0 CM |
935 | /* |
936 | * split the node at the specified level in path in two. | |
937 | * The path is corrected to point to the appropriate node after the split | |
938 | * | |
939 | * Before splitting this tries to make some room in the node by pushing | |
940 | * left and right, if either one works, it returns right away. | |
aa5d6bed CM |
941 | * |
942 | * returns 0 on success and < 0 on failure | |
97571fd0 | 943 | */ |
e089f05c CM |
944 | static int split_node(struct btrfs_trans_handle *trans, struct btrfs_root |
945 | *root, struct btrfs_path *path, int level) | |
be0e5c09 | 946 | { |
e20d96d6 | 947 | struct buffer_head *t; |
234b63a0 | 948 | struct btrfs_node *c; |
e20d96d6 | 949 | struct buffer_head *split_buffer; |
234b63a0 | 950 | struct btrfs_node *split; |
be0e5c09 | 951 | int mid; |
5c680ed6 | 952 | int ret; |
aa5d6bed | 953 | int wret; |
7518a238 | 954 | u32 c_nritems; |
eb60ceac | 955 | |
5c680ed6 | 956 | t = path->nodes[level]; |
e20d96d6 | 957 | c = btrfs_buffer_node(t); |
5c680ed6 CM |
958 | if (t == root->node) { |
959 | /* trying to split the root, lets make a new one */ | |
e089f05c | 960 | ret = insert_new_root(trans, root, path, level + 1); |
5c680ed6 CM |
961 | if (ret) |
962 | return ret; | |
e66f709b CM |
963 | } else { |
964 | ret = push_nodes_for_insert(trans, root, path, level); | |
965 | t = path->nodes[level]; | |
966 | c = btrfs_buffer_node(t); | |
967 | if (!ret && | |
968 | btrfs_header_nritems(&c->header) < | |
969 | BTRFS_NODEPTRS_PER_BLOCK(root) - 1) | |
970 | return 0; | |
54aa1f4d CM |
971 | if (ret < 0) |
972 | return ret; | |
be0e5c09 | 973 | } |
e66f709b | 974 | |
7518a238 | 975 | c_nritems = btrfs_header_nritems(&c->header); |
31f3c99b | 976 | split_buffer = btrfs_alloc_free_block(trans, root, t->b_blocknr); |
54aa1f4d CM |
977 | if (IS_ERR(split_buffer)) |
978 | return PTR_ERR(split_buffer); | |
979 | ||
e20d96d6 | 980 | split = btrfs_buffer_node(split_buffer); |
7518a238 | 981 | btrfs_set_header_flags(&split->header, btrfs_header_flags(&c->header)); |
9a6f11ed | 982 | btrfs_set_header_level(&split->header, btrfs_header_level(&c->header)); |
7eccb903 | 983 | btrfs_set_header_blocknr(&split->header, bh_blocknr(split_buffer)); |
7f5c1516 | 984 | btrfs_set_header_generation(&split->header, trans->transid); |
4d775673 | 985 | btrfs_set_header_owner(&split->header, root->root_key.objectid); |
3eb0314d CM |
986 | memcpy(split->header.fsid, root->fs_info->disk_super->fsid, |
987 | sizeof(split->header.fsid)); | |
7518a238 | 988 | mid = (c_nritems + 1) / 2; |
d6025579 CM |
989 | btrfs_memcpy(root, split, split->ptrs, c->ptrs + mid, |
990 | (c_nritems - mid) * sizeof(struct btrfs_key_ptr)); | |
7518a238 CM |
991 | btrfs_set_header_nritems(&split->header, c_nritems - mid); |
992 | btrfs_set_header_nritems(&c->header, mid); | |
aa5d6bed CM |
993 | ret = 0; |
994 | ||
d6025579 CM |
995 | btrfs_mark_buffer_dirty(t); |
996 | btrfs_mark_buffer_dirty(split_buffer); | |
e089f05c | 997 | wret = insert_ptr(trans, root, path, &split->ptrs[0].key, |
7eccb903 | 998 | bh_blocknr(split_buffer), path->slots[level + 1] + 1, |
123abc88 | 999 | level + 1); |
aa5d6bed CM |
1000 | if (wret) |
1001 | ret = wret; | |
1002 | ||
5de08d7d | 1003 | if (path->slots[level] >= mid) { |
5c680ed6 | 1004 | path->slots[level] -= mid; |
234b63a0 | 1005 | btrfs_block_release(root, t); |
5c680ed6 CM |
1006 | path->nodes[level] = split_buffer; |
1007 | path->slots[level + 1] += 1; | |
1008 | } else { | |
234b63a0 | 1009 | btrfs_block_release(root, split_buffer); |
be0e5c09 | 1010 | } |
aa5d6bed | 1011 | return ret; |
be0e5c09 CM |
1012 | } |
1013 | ||
74123bd7 CM |
1014 | /* |
1015 | * how many bytes are required to store the items in a leaf. start | |
1016 | * and nr indicate which items in the leaf to check. This totals up the | |
1017 | * space used both by the item structs and the item data | |
1018 | */ | |
234b63a0 | 1019 | static int leaf_space_used(struct btrfs_leaf *l, int start, int nr) |
be0e5c09 CM |
1020 | { |
1021 | int data_len; | |
d4dbff95 CM |
1022 | int nritems = btrfs_header_nritems(&l->header); |
1023 | int end = min(nritems, start + nr) - 1; | |
be0e5c09 CM |
1024 | |
1025 | if (!nr) | |
1026 | return 0; | |
0783fcfc CM |
1027 | data_len = btrfs_item_end(l->items + start); |
1028 | data_len = data_len - btrfs_item_offset(l->items + end); | |
1029 | data_len += sizeof(struct btrfs_item) * nr; | |
d4dbff95 | 1030 | WARN_ON(data_len < 0); |
be0e5c09 CM |
1031 | return data_len; |
1032 | } | |
1033 | ||
d4dbff95 CM |
1034 | /* |
1035 | * The space between the end of the leaf items and | |
1036 | * the start of the leaf data. IOW, how much room | |
1037 | * the leaf has left for both items and data | |
1038 | */ | |
1039 | int btrfs_leaf_free_space(struct btrfs_root *root, struct btrfs_leaf *leaf) | |
1040 | { | |
1041 | int nritems = btrfs_header_nritems(&leaf->header); | |
1042 | return BTRFS_LEAF_DATA_SIZE(root) - leaf_space_used(leaf, 0, nritems); | |
1043 | } | |
1044 | ||
00ec4c51 CM |
1045 | /* |
1046 | * push some data in the path leaf to the right, trying to free up at | |
1047 | * least data_size bytes. returns zero if the push worked, nonzero otherwise | |
aa5d6bed CM |
1048 | * |
1049 | * returns 1 if the push failed because the other node didn't have enough | |
1050 | * room, 0 if everything worked out and < 0 if there were major errors. | |
00ec4c51 | 1051 | */ |
e089f05c CM |
1052 | static int push_leaf_right(struct btrfs_trans_handle *trans, struct btrfs_root |
1053 | *root, struct btrfs_path *path, int data_size) | |
00ec4c51 | 1054 | { |
e20d96d6 CM |
1055 | struct buffer_head *left_buf = path->nodes[0]; |
1056 | struct btrfs_leaf *left = btrfs_buffer_leaf(left_buf); | |
234b63a0 | 1057 | struct btrfs_leaf *right; |
e20d96d6 CM |
1058 | struct buffer_head *right_buf; |
1059 | struct buffer_head *upper; | |
1060 | struct btrfs_node *upper_node; | |
00ec4c51 CM |
1061 | int slot; |
1062 | int i; | |
1063 | int free_space; | |
1064 | int push_space = 0; | |
1065 | int push_items = 0; | |
0783fcfc | 1066 | struct btrfs_item *item; |
7518a238 CM |
1067 | u32 left_nritems; |
1068 | u32 right_nritems; | |
54aa1f4d | 1069 | int ret; |
00ec4c51 CM |
1070 | |
1071 | slot = path->slots[1]; | |
1072 | if (!path->nodes[1]) { | |
1073 | return 1; | |
1074 | } | |
1075 | upper = path->nodes[1]; | |
e20d96d6 CM |
1076 | upper_node = btrfs_buffer_node(upper); |
1077 | if (slot >= btrfs_header_nritems(&upper_node->header) - 1) { | |
00ec4c51 CM |
1078 | return 1; |
1079 | } | |
e20d96d6 CM |
1080 | right_buf = read_tree_block(root, |
1081 | btrfs_node_blockptr(btrfs_buffer_node(upper), slot + 1)); | |
1082 | right = btrfs_buffer_leaf(right_buf); | |
123abc88 | 1083 | free_space = btrfs_leaf_free_space(root, right); |
0783fcfc | 1084 | if (free_space < data_size + sizeof(struct btrfs_item)) { |
234b63a0 | 1085 | btrfs_block_release(root, right_buf); |
00ec4c51 CM |
1086 | return 1; |
1087 | } | |
02217ed2 | 1088 | /* cow and double check */ |
54aa1f4d CM |
1089 | ret = btrfs_cow_block(trans, root, right_buf, upper, |
1090 | slot + 1, &right_buf); | |
1091 | if (ret) { | |
1092 | btrfs_block_release(root, right_buf); | |
1093 | return 1; | |
1094 | } | |
e20d96d6 | 1095 | right = btrfs_buffer_leaf(right_buf); |
123abc88 | 1096 | free_space = btrfs_leaf_free_space(root, right); |
0783fcfc | 1097 | if (free_space < data_size + sizeof(struct btrfs_item)) { |
234b63a0 | 1098 | btrfs_block_release(root, right_buf); |
02217ed2 CM |
1099 | return 1; |
1100 | } | |
1101 | ||
7518a238 | 1102 | left_nritems = btrfs_header_nritems(&left->header); |
a429e513 CM |
1103 | if (left_nritems == 0) { |
1104 | btrfs_block_release(root, right_buf); | |
1105 | return 1; | |
1106 | } | |
1107 | for (i = left_nritems - 1; i >= 1; i--) { | |
00ec4c51 CM |
1108 | item = left->items + i; |
1109 | if (path->slots[0] == i) | |
1110 | push_space += data_size + sizeof(*item); | |
0783fcfc CM |
1111 | if (btrfs_item_size(item) + sizeof(*item) + push_space > |
1112 | free_space) | |
00ec4c51 CM |
1113 | break; |
1114 | push_items++; | |
0783fcfc | 1115 | push_space += btrfs_item_size(item) + sizeof(*item); |
00ec4c51 CM |
1116 | } |
1117 | if (push_items == 0) { | |
234b63a0 | 1118 | btrfs_block_release(root, right_buf); |
00ec4c51 CM |
1119 | return 1; |
1120 | } | |
a429e513 CM |
1121 | if (push_items == left_nritems) |
1122 | WARN_ON(1); | |
7518a238 | 1123 | right_nritems = btrfs_header_nritems(&right->header); |
00ec4c51 | 1124 | /* push left to right */ |
0783fcfc | 1125 | push_space = btrfs_item_end(left->items + left_nritems - push_items); |
123abc88 | 1126 | push_space -= leaf_data_end(root, left); |
00ec4c51 | 1127 | /* make room in the right data area */ |
d6025579 CM |
1128 | btrfs_memmove(root, right, btrfs_leaf_data(right) + |
1129 | leaf_data_end(root, right) - push_space, | |
1130 | btrfs_leaf_data(right) + | |
1131 | leaf_data_end(root, right), BTRFS_LEAF_DATA_SIZE(root) - | |
1132 | leaf_data_end(root, right)); | |
00ec4c51 | 1133 | /* copy from the left data area */ |
d6025579 CM |
1134 | btrfs_memcpy(root, right, btrfs_leaf_data(right) + |
1135 | BTRFS_LEAF_DATA_SIZE(root) - push_space, | |
1136 | btrfs_leaf_data(left) + leaf_data_end(root, left), | |
1137 | push_space); | |
1138 | btrfs_memmove(root, right, right->items + push_items, right->items, | |
0783fcfc | 1139 | right_nritems * sizeof(struct btrfs_item)); |
00ec4c51 | 1140 | /* copy the items from left to right */ |
d6025579 CM |
1141 | btrfs_memcpy(root, right, right->items, left->items + |
1142 | left_nritems - push_items, | |
1143 | push_items * sizeof(struct btrfs_item)); | |
00ec4c51 CM |
1144 | |
1145 | /* update the item pointers */ | |
7518a238 CM |
1146 | right_nritems += push_items; |
1147 | btrfs_set_header_nritems(&right->header, right_nritems); | |
123abc88 | 1148 | push_space = BTRFS_LEAF_DATA_SIZE(root); |
7518a238 | 1149 | for (i = 0; i < right_nritems; i++) { |
0783fcfc CM |
1150 | btrfs_set_item_offset(right->items + i, push_space - |
1151 | btrfs_item_size(right->items + i)); | |
1152 | push_space = btrfs_item_offset(right->items + i); | |
00ec4c51 | 1153 | } |
7518a238 CM |
1154 | left_nritems -= push_items; |
1155 | btrfs_set_header_nritems(&left->header, left_nritems); | |
00ec4c51 | 1156 | |
d6025579 CM |
1157 | btrfs_mark_buffer_dirty(left_buf); |
1158 | btrfs_mark_buffer_dirty(right_buf); | |
a429e513 | 1159 | |
d6025579 | 1160 | btrfs_memcpy(root, upper_node, &upper_node->ptrs[slot + 1].key, |
e2fa7227 | 1161 | &right->items[0].key, sizeof(struct btrfs_disk_key)); |
d6025579 | 1162 | btrfs_mark_buffer_dirty(upper); |
02217ed2 | 1163 | |
00ec4c51 | 1164 | /* then fixup the leaf pointer in the path */ |
7518a238 CM |
1165 | if (path->slots[0] >= left_nritems) { |
1166 | path->slots[0] -= left_nritems; | |
234b63a0 | 1167 | btrfs_block_release(root, path->nodes[0]); |
00ec4c51 CM |
1168 | path->nodes[0] = right_buf; |
1169 | path->slots[1] += 1; | |
1170 | } else { | |
234b63a0 | 1171 | btrfs_block_release(root, right_buf); |
00ec4c51 | 1172 | } |
098f59c2 CM |
1173 | if (path->nodes[1]) |
1174 | check_node(root, path, 1); | |
00ec4c51 CM |
1175 | return 0; |
1176 | } | |
74123bd7 CM |
1177 | /* |
1178 | * push some data in the path leaf to the left, trying to free up at | |
1179 | * least data_size bytes. returns zero if the push worked, nonzero otherwise | |
1180 | */ | |
e089f05c CM |
1181 | static int push_leaf_left(struct btrfs_trans_handle *trans, struct btrfs_root |
1182 | *root, struct btrfs_path *path, int data_size) | |
be0e5c09 | 1183 | { |
e20d96d6 CM |
1184 | struct buffer_head *right_buf = path->nodes[0]; |
1185 | struct btrfs_leaf *right = btrfs_buffer_leaf(right_buf); | |
1186 | struct buffer_head *t; | |
234b63a0 | 1187 | struct btrfs_leaf *left; |
be0e5c09 CM |
1188 | int slot; |
1189 | int i; | |
1190 | int free_space; | |
1191 | int push_space = 0; | |
1192 | int push_items = 0; | |
0783fcfc | 1193 | struct btrfs_item *item; |
7518a238 | 1194 | u32 old_left_nritems; |
aa5d6bed CM |
1195 | int ret = 0; |
1196 | int wret; | |
be0e5c09 CM |
1197 | |
1198 | slot = path->slots[1]; | |
1199 | if (slot == 0) { | |
1200 | return 1; | |
1201 | } | |
1202 | if (!path->nodes[1]) { | |
1203 | return 1; | |
1204 | } | |
e20d96d6 CM |
1205 | t = read_tree_block(root, |
1206 | btrfs_node_blockptr(btrfs_buffer_node(path->nodes[1]), slot - 1)); | |
1207 | left = btrfs_buffer_leaf(t); | |
123abc88 | 1208 | free_space = btrfs_leaf_free_space(root, left); |
0783fcfc | 1209 | if (free_space < data_size + sizeof(struct btrfs_item)) { |
234b63a0 | 1210 | btrfs_block_release(root, t); |
be0e5c09 CM |
1211 | return 1; |
1212 | } | |
02217ed2 CM |
1213 | |
1214 | /* cow and double check */ | |
54aa1f4d CM |
1215 | ret = btrfs_cow_block(trans, root, t, path->nodes[1], slot - 1, &t); |
1216 | if (ret) { | |
1217 | /* we hit -ENOSPC, but it isn't fatal here */ | |
1218 | return 1; | |
1219 | } | |
e20d96d6 | 1220 | left = btrfs_buffer_leaf(t); |
123abc88 | 1221 | free_space = btrfs_leaf_free_space(root, left); |
0783fcfc | 1222 | if (free_space < data_size + sizeof(struct btrfs_item)) { |
234b63a0 | 1223 | btrfs_block_release(root, t); |
02217ed2 CM |
1224 | return 1; |
1225 | } | |
1226 | ||
a429e513 CM |
1227 | if (btrfs_header_nritems(&right->header) == 0) { |
1228 | btrfs_block_release(root, t); | |
1229 | return 1; | |
1230 | } | |
1231 | ||
1232 | for (i = 0; i < btrfs_header_nritems(&right->header) - 1; i++) { | |
be0e5c09 CM |
1233 | item = right->items + i; |
1234 | if (path->slots[0] == i) | |
1235 | push_space += data_size + sizeof(*item); | |
0783fcfc CM |
1236 | if (btrfs_item_size(item) + sizeof(*item) + push_space > |
1237 | free_space) | |
be0e5c09 CM |
1238 | break; |
1239 | push_items++; | |
0783fcfc | 1240 | push_space += btrfs_item_size(item) + sizeof(*item); |
be0e5c09 CM |
1241 | } |
1242 | if (push_items == 0) { | |
234b63a0 | 1243 | btrfs_block_release(root, t); |
be0e5c09 CM |
1244 | return 1; |
1245 | } | |
a429e513 CM |
1246 | if (push_items == btrfs_header_nritems(&right->header)) |
1247 | WARN_ON(1); | |
be0e5c09 | 1248 | /* push data from right to left */ |
d6025579 CM |
1249 | btrfs_memcpy(root, left, left->items + |
1250 | btrfs_header_nritems(&left->header), | |
1251 | right->items, push_items * sizeof(struct btrfs_item)); | |
123abc88 | 1252 | push_space = BTRFS_LEAF_DATA_SIZE(root) - |
0783fcfc | 1253 | btrfs_item_offset(right->items + push_items -1); |
d6025579 CM |
1254 | btrfs_memcpy(root, left, btrfs_leaf_data(left) + |
1255 | leaf_data_end(root, left) - push_space, | |
1256 | btrfs_leaf_data(right) + | |
1257 | btrfs_item_offset(right->items + push_items - 1), | |
1258 | push_space); | |
7518a238 | 1259 | old_left_nritems = btrfs_header_nritems(&left->header); |
eb60ceac CM |
1260 | BUG_ON(old_left_nritems < 0); |
1261 | ||
0783fcfc | 1262 | for (i = old_left_nritems; i < old_left_nritems + push_items; i++) { |
123abc88 CM |
1263 | u32 ioff = btrfs_item_offset(left->items + i); |
1264 | btrfs_set_item_offset(left->items + i, ioff - | |
1265 | (BTRFS_LEAF_DATA_SIZE(root) - | |
0783fcfc CM |
1266 | btrfs_item_offset(left->items + |
1267 | old_left_nritems - 1))); | |
be0e5c09 | 1268 | } |
7518a238 | 1269 | btrfs_set_header_nritems(&left->header, old_left_nritems + push_items); |
be0e5c09 CM |
1270 | |
1271 | /* fixup right node */ | |
0783fcfc | 1272 | push_space = btrfs_item_offset(right->items + push_items - 1) - |
123abc88 | 1273 | leaf_data_end(root, right); |
d6025579 CM |
1274 | btrfs_memmove(root, right, btrfs_leaf_data(right) + |
1275 | BTRFS_LEAF_DATA_SIZE(root) - push_space, | |
1276 | btrfs_leaf_data(right) + | |
1277 | leaf_data_end(root, right), push_space); | |
1278 | btrfs_memmove(root, right, right->items, right->items + push_items, | |
7518a238 | 1279 | (btrfs_header_nritems(&right->header) - push_items) * |
0783fcfc | 1280 | sizeof(struct btrfs_item)); |
7518a238 CM |
1281 | btrfs_set_header_nritems(&right->header, |
1282 | btrfs_header_nritems(&right->header) - | |
1283 | push_items); | |
123abc88 | 1284 | push_space = BTRFS_LEAF_DATA_SIZE(root); |
eb60ceac | 1285 | |
7518a238 | 1286 | for (i = 0; i < btrfs_header_nritems(&right->header); i++) { |
0783fcfc CM |
1287 | btrfs_set_item_offset(right->items + i, push_space - |
1288 | btrfs_item_size(right->items + i)); | |
1289 | push_space = btrfs_item_offset(right->items + i); | |
be0e5c09 | 1290 | } |
eb60ceac | 1291 | |
d6025579 CM |
1292 | btrfs_mark_buffer_dirty(t); |
1293 | btrfs_mark_buffer_dirty(right_buf); | |
098f59c2 | 1294 | |
e089f05c | 1295 | wret = fixup_low_keys(trans, root, path, &right->items[0].key, 1); |
aa5d6bed CM |
1296 | if (wret) |
1297 | ret = wret; | |
be0e5c09 CM |
1298 | |
1299 | /* then fixup the leaf pointer in the path */ | |
1300 | if (path->slots[0] < push_items) { | |
1301 | path->slots[0] += old_left_nritems; | |
234b63a0 | 1302 | btrfs_block_release(root, path->nodes[0]); |
eb60ceac | 1303 | path->nodes[0] = t; |
be0e5c09 CM |
1304 | path->slots[1] -= 1; |
1305 | } else { | |
234b63a0 | 1306 | btrfs_block_release(root, t); |
be0e5c09 CM |
1307 | path->slots[0] -= push_items; |
1308 | } | |
eb60ceac | 1309 | BUG_ON(path->slots[0] < 0); |
098f59c2 CM |
1310 | if (path->nodes[1]) |
1311 | check_node(root, path, 1); | |
aa5d6bed | 1312 | return ret; |
be0e5c09 CM |
1313 | } |
1314 | ||
74123bd7 CM |
1315 | /* |
1316 | * split the path's leaf in two, making sure there is at least data_size | |
1317 | * available for the resulting leaf level of the path. | |
aa5d6bed CM |
1318 | * |
1319 | * returns 0 if all went well and < 0 on failure. | |
74123bd7 | 1320 | */ |
e089f05c | 1321 | static int split_leaf(struct btrfs_trans_handle *trans, struct btrfs_root |
d4dbff95 CM |
1322 | *root, struct btrfs_key *ins_key, |
1323 | struct btrfs_path *path, int data_size) | |
be0e5c09 | 1324 | { |
e20d96d6 | 1325 | struct buffer_head *l_buf; |
234b63a0 | 1326 | struct btrfs_leaf *l; |
7518a238 | 1327 | u32 nritems; |
eb60ceac CM |
1328 | int mid; |
1329 | int slot; | |
234b63a0 | 1330 | struct btrfs_leaf *right; |
e20d96d6 | 1331 | struct buffer_head *right_buffer; |
0783fcfc | 1332 | int space_needed = data_size + sizeof(struct btrfs_item); |
be0e5c09 CM |
1333 | int data_copy_size; |
1334 | int rt_data_off; | |
1335 | int i; | |
d4dbff95 | 1336 | int ret = 0; |
aa5d6bed | 1337 | int wret; |
d4dbff95 CM |
1338 | int double_split = 0; |
1339 | struct btrfs_disk_key disk_key; | |
aa5d6bed | 1340 | |
40689478 | 1341 | /* first try to make some room by pushing left and right */ |
e089f05c | 1342 | wret = push_leaf_left(trans, root, path, data_size); |
eaee50e8 CM |
1343 | if (wret < 0) |
1344 | return wret; | |
1345 | if (wret) { | |
e089f05c | 1346 | wret = push_leaf_right(trans, root, path, data_size); |
eaee50e8 CM |
1347 | if (wret < 0) |
1348 | return wret; | |
1349 | } | |
aa5d6bed | 1350 | l_buf = path->nodes[0]; |
e20d96d6 | 1351 | l = btrfs_buffer_leaf(l_buf); |
aa5d6bed CM |
1352 | |
1353 | /* did the pushes work? */ | |
123abc88 CM |
1354 | if (btrfs_leaf_free_space(root, l) >= |
1355 | sizeof(struct btrfs_item) + data_size) | |
aa5d6bed CM |
1356 | return 0; |
1357 | ||
5c680ed6 | 1358 | if (!path->nodes[1]) { |
e089f05c | 1359 | ret = insert_new_root(trans, root, path, 1); |
5c680ed6 CM |
1360 | if (ret) |
1361 | return ret; | |
1362 | } | |
eb60ceac | 1363 | slot = path->slots[0]; |
7518a238 | 1364 | nritems = btrfs_header_nritems(&l->header); |
eb60ceac | 1365 | mid = (nritems + 1)/ 2; |
54aa1f4d | 1366 | |
31f3c99b | 1367 | right_buffer = btrfs_alloc_free_block(trans, root, l_buf->b_blocknr); |
54aa1f4d CM |
1368 | if (IS_ERR(right_buffer)) |
1369 | return PTR_ERR(right_buffer); | |
1370 | ||
e20d96d6 | 1371 | right = btrfs_buffer_leaf(right_buffer); |
123abc88 | 1372 | memset(&right->header, 0, sizeof(right->header)); |
7eccb903 | 1373 | btrfs_set_header_blocknr(&right->header, bh_blocknr(right_buffer)); |
7f5c1516 | 1374 | btrfs_set_header_generation(&right->header, trans->transid); |
4d775673 | 1375 | btrfs_set_header_owner(&right->header, root->root_key.objectid); |
7518a238 | 1376 | btrfs_set_header_level(&right->header, 0); |
3eb0314d CM |
1377 | memcpy(right->header.fsid, root->fs_info->disk_super->fsid, |
1378 | sizeof(right->header.fsid)); | |
d4dbff95 CM |
1379 | if (mid <= slot) { |
1380 | if (nritems == 1 || | |
1381 | leaf_space_used(l, mid, nritems - mid) + space_needed > | |
1382 | BTRFS_LEAF_DATA_SIZE(root)) { | |
1383 | if (slot >= nritems) { | |
1384 | btrfs_cpu_key_to_disk(&disk_key, ins_key); | |
1385 | btrfs_set_header_nritems(&right->header, 0); | |
1386 | wret = insert_ptr(trans, root, path, | |
1387 | &disk_key, | |
7eccb903 | 1388 | bh_blocknr(right_buffer), |
d4dbff95 CM |
1389 | path->slots[1] + 1, 1); |
1390 | if (wret) | |
1391 | ret = wret; | |
1392 | btrfs_block_release(root, path->nodes[0]); | |
1393 | path->nodes[0] = right_buffer; | |
1394 | path->slots[0] = 0; | |
1395 | path->slots[1] += 1; | |
1396 | return ret; | |
1397 | } | |
1398 | mid = slot; | |
1399 | double_split = 1; | |
1400 | } | |
1401 | } else { | |
1402 | if (leaf_space_used(l, 0, mid + 1) + space_needed > | |
1403 | BTRFS_LEAF_DATA_SIZE(root)) { | |
1404 | if (slot == 0) { | |
1405 | btrfs_cpu_key_to_disk(&disk_key, ins_key); | |
1406 | btrfs_set_header_nritems(&right->header, 0); | |
1407 | wret = insert_ptr(trans, root, path, | |
1408 | &disk_key, | |
7eccb903 | 1409 | bh_blocknr(right_buffer), |
098f59c2 | 1410 | path->slots[1], 1); |
d4dbff95 CM |
1411 | if (wret) |
1412 | ret = wret; | |
1413 | btrfs_block_release(root, path->nodes[0]); | |
1414 | path->nodes[0] = right_buffer; | |
1415 | path->slots[0] = 0; | |
a429e513 CM |
1416 | if (path->slots[1] == 0) { |
1417 | wret = fixup_low_keys(trans, root, | |
1418 | path, &disk_key, 1); | |
1419 | if (wret) | |
1420 | ret = wret; | |
1421 | } | |
d4dbff95 CM |
1422 | return ret; |
1423 | } | |
1424 | mid = slot; | |
1425 | double_split = 1; | |
1426 | } | |
1427 | } | |
1428 | btrfs_set_header_nritems(&right->header, nritems - mid); | |
123abc88 CM |
1429 | data_copy_size = btrfs_item_end(l->items + mid) - |
1430 | leaf_data_end(root, l); | |
d6025579 CM |
1431 | btrfs_memcpy(root, right, right->items, l->items + mid, |
1432 | (nritems - mid) * sizeof(struct btrfs_item)); | |
1433 | btrfs_memcpy(root, right, | |
1434 | btrfs_leaf_data(right) + BTRFS_LEAF_DATA_SIZE(root) - | |
1435 | data_copy_size, btrfs_leaf_data(l) + | |
1436 | leaf_data_end(root, l), data_copy_size); | |
123abc88 CM |
1437 | rt_data_off = BTRFS_LEAF_DATA_SIZE(root) - |
1438 | btrfs_item_end(l->items + mid); | |
74123bd7 | 1439 | |
0783fcfc | 1440 | for (i = 0; i < btrfs_header_nritems(&right->header); i++) { |
123abc88 | 1441 | u32 ioff = btrfs_item_offset(right->items + i); |
0783fcfc CM |
1442 | btrfs_set_item_offset(right->items + i, ioff + rt_data_off); |
1443 | } | |
74123bd7 | 1444 | |
7518a238 | 1445 | btrfs_set_header_nritems(&l->header, mid); |
aa5d6bed | 1446 | ret = 0; |
e089f05c | 1447 | wret = insert_ptr(trans, root, path, &right->items[0].key, |
7eccb903 | 1448 | bh_blocknr(right_buffer), path->slots[1] + 1, 1); |
aa5d6bed CM |
1449 | if (wret) |
1450 | ret = wret; | |
d6025579 CM |
1451 | btrfs_mark_buffer_dirty(right_buffer); |
1452 | btrfs_mark_buffer_dirty(l_buf); | |
eb60ceac | 1453 | BUG_ON(path->slots[0] != slot); |
be0e5c09 | 1454 | if (mid <= slot) { |
234b63a0 | 1455 | btrfs_block_release(root, path->nodes[0]); |
eb60ceac | 1456 | path->nodes[0] = right_buffer; |
be0e5c09 CM |
1457 | path->slots[0] -= mid; |
1458 | path->slots[1] += 1; | |
eb60ceac | 1459 | } else |
234b63a0 | 1460 | btrfs_block_release(root, right_buffer); |
eb60ceac | 1461 | BUG_ON(path->slots[0] < 0); |
098f59c2 | 1462 | check_node(root, path, 1); |
d4dbff95 CM |
1463 | |
1464 | if (!double_split) | |
1465 | return ret; | |
31f3c99b | 1466 | right_buffer = btrfs_alloc_free_block(trans, root, l_buf->b_blocknr); |
54aa1f4d CM |
1467 | if (IS_ERR(right_buffer)) |
1468 | return PTR_ERR(right_buffer); | |
1469 | ||
d4dbff95 CM |
1470 | right = btrfs_buffer_leaf(right_buffer); |
1471 | memset(&right->header, 0, sizeof(right->header)); | |
7eccb903 | 1472 | btrfs_set_header_blocknr(&right->header, bh_blocknr(right_buffer)); |
d4dbff95 | 1473 | btrfs_set_header_generation(&right->header, trans->transid); |
4d775673 | 1474 | btrfs_set_header_owner(&right->header, root->root_key.objectid); |
d4dbff95 | 1475 | btrfs_set_header_level(&right->header, 0); |
3eb0314d CM |
1476 | memcpy(right->header.fsid, root->fs_info->disk_super->fsid, |
1477 | sizeof(right->header.fsid)); | |
d4dbff95 CM |
1478 | btrfs_cpu_key_to_disk(&disk_key, ins_key); |
1479 | btrfs_set_header_nritems(&right->header, 0); | |
1480 | wret = insert_ptr(trans, root, path, | |
1481 | &disk_key, | |
7eccb903 | 1482 | bh_blocknr(right_buffer), |
d4dbff95 CM |
1483 | path->slots[1], 1); |
1484 | if (wret) | |
1485 | ret = wret; | |
a429e513 CM |
1486 | if (path->slots[1] == 0) { |
1487 | wret = fixup_low_keys(trans, root, path, &disk_key, 1); | |
1488 | if (wret) | |
1489 | ret = wret; | |
1490 | } | |
d4dbff95 CM |
1491 | btrfs_block_release(root, path->nodes[0]); |
1492 | path->nodes[0] = right_buffer; | |
1493 | path->slots[0] = 0; | |
1494 | check_node(root, path, 1); | |
1495 | check_leaf(root, path, 0); | |
be0e5c09 CM |
1496 | return ret; |
1497 | } | |
1498 | ||
b18c6685 CM |
1499 | int btrfs_truncate_item(struct btrfs_trans_handle *trans, |
1500 | struct btrfs_root *root, | |
1501 | struct btrfs_path *path, | |
1502 | u32 new_size) | |
1503 | { | |
1504 | int ret = 0; | |
1505 | int slot; | |
1506 | int slot_orig; | |
1507 | struct btrfs_leaf *leaf; | |
1508 | struct buffer_head *leaf_buf; | |
1509 | u32 nritems; | |
1510 | unsigned int data_end; | |
1511 | unsigned int old_data_start; | |
1512 | unsigned int old_size; | |
1513 | unsigned int size_diff; | |
1514 | int i; | |
1515 | ||
1516 | slot_orig = path->slots[0]; | |
1517 | leaf_buf = path->nodes[0]; | |
1518 | leaf = btrfs_buffer_leaf(leaf_buf); | |
1519 | ||
1520 | nritems = btrfs_header_nritems(&leaf->header); | |
1521 | data_end = leaf_data_end(root, leaf); | |
1522 | ||
1523 | slot = path->slots[0]; | |
1524 | old_data_start = btrfs_item_offset(leaf->items + slot); | |
1525 | old_size = btrfs_item_size(leaf->items + slot); | |
1526 | BUG_ON(old_size <= new_size); | |
1527 | size_diff = old_size - new_size; | |
1528 | ||
1529 | BUG_ON(slot < 0); | |
1530 | BUG_ON(slot >= nritems); | |
1531 | ||
1532 | /* | |
1533 | * item0..itemN ... dataN.offset..dataN.size .. data0.size | |
1534 | */ | |
1535 | /* first correct the data pointers */ | |
1536 | for (i = slot; i < nritems; i++) { | |
1537 | u32 ioff = btrfs_item_offset(leaf->items + i); | |
1538 | btrfs_set_item_offset(leaf->items + i, | |
1539 | ioff + size_diff); | |
1540 | } | |
1541 | /* shift the data */ | |
b18c6685 CM |
1542 | btrfs_memmove(root, leaf, btrfs_leaf_data(leaf) + |
1543 | data_end + size_diff, btrfs_leaf_data(leaf) + | |
1544 | data_end, old_data_start + new_size - data_end); | |
1545 | btrfs_set_item_size(leaf->items + slot, new_size); | |
1546 | btrfs_mark_buffer_dirty(leaf_buf); | |
1547 | ||
1548 | ret = 0; | |
1549 | if (btrfs_leaf_free_space(root, leaf) < 0) | |
1550 | BUG(); | |
1551 | check_leaf(root, path, 0); | |
1552 | return ret; | |
1553 | } | |
1554 | ||
6567e837 CM |
1555 | int btrfs_extend_item(struct btrfs_trans_handle *trans, struct btrfs_root |
1556 | *root, struct btrfs_path *path, u32 data_size) | |
1557 | { | |
1558 | int ret = 0; | |
1559 | int slot; | |
1560 | int slot_orig; | |
1561 | struct btrfs_leaf *leaf; | |
1562 | struct buffer_head *leaf_buf; | |
1563 | u32 nritems; | |
1564 | unsigned int data_end; | |
1565 | unsigned int old_data; | |
1566 | unsigned int old_size; | |
1567 | int i; | |
1568 | ||
1569 | slot_orig = path->slots[0]; | |
1570 | leaf_buf = path->nodes[0]; | |
1571 | leaf = btrfs_buffer_leaf(leaf_buf); | |
1572 | ||
1573 | nritems = btrfs_header_nritems(&leaf->header); | |
1574 | data_end = leaf_data_end(root, leaf); | |
1575 | ||
1576 | if (btrfs_leaf_free_space(root, leaf) < data_size) | |
1577 | BUG(); | |
1578 | slot = path->slots[0]; | |
1579 | old_data = btrfs_item_end(leaf->items + slot); | |
1580 | ||
1581 | BUG_ON(slot < 0); | |
1582 | BUG_ON(slot >= nritems); | |
1583 | ||
1584 | /* | |
1585 | * item0..itemN ... dataN.offset..dataN.size .. data0.size | |
1586 | */ | |
1587 | /* first correct the data pointers */ | |
1588 | for (i = slot; i < nritems; i++) { | |
1589 | u32 ioff = btrfs_item_offset(leaf->items + i); | |
1590 | btrfs_set_item_offset(leaf->items + i, | |
1591 | ioff - data_size); | |
1592 | } | |
1593 | /* shift the data */ | |
1594 | btrfs_memmove(root, leaf, btrfs_leaf_data(leaf) + | |
1595 | data_end - data_size, btrfs_leaf_data(leaf) + | |
1596 | data_end, old_data - data_end); | |
1597 | data_end = old_data; | |
1598 | old_size = btrfs_item_size(leaf->items + slot); | |
1599 | btrfs_set_item_size(leaf->items + slot, old_size + data_size); | |
1600 | btrfs_mark_buffer_dirty(leaf_buf); | |
1601 | ||
1602 | ret = 0; | |
1603 | if (btrfs_leaf_free_space(root, leaf) < 0) | |
1604 | BUG(); | |
1605 | check_leaf(root, path, 0); | |
1606 | return ret; | |
1607 | } | |
1608 | ||
74123bd7 CM |
1609 | /* |
1610 | * Given a key and some data, insert an item into the tree. | |
1611 | * This does all the path init required, making room in the tree if needed. | |
1612 | */ | |
e089f05c CM |
1613 | int btrfs_insert_empty_item(struct btrfs_trans_handle *trans, struct btrfs_root |
1614 | *root, struct btrfs_path *path, struct btrfs_key | |
1615 | *cpu_key, u32 data_size) | |
be0e5c09 | 1616 | { |
aa5d6bed | 1617 | int ret = 0; |
be0e5c09 | 1618 | int slot; |
eb60ceac | 1619 | int slot_orig; |
234b63a0 | 1620 | struct btrfs_leaf *leaf; |
e20d96d6 | 1621 | struct buffer_head *leaf_buf; |
7518a238 | 1622 | u32 nritems; |
be0e5c09 | 1623 | unsigned int data_end; |
e2fa7227 CM |
1624 | struct btrfs_disk_key disk_key; |
1625 | ||
1626 | btrfs_cpu_key_to_disk(&disk_key, cpu_key); | |
be0e5c09 | 1627 | |
74123bd7 | 1628 | /* create a root if there isn't one */ |
5c680ed6 | 1629 | if (!root->node) |
cfaa7295 | 1630 | BUG(); |
e089f05c | 1631 | ret = btrfs_search_slot(trans, root, cpu_key, path, data_size, 1); |
eb60ceac | 1632 | if (ret == 0) { |
f0930a37 | 1633 | return -EEXIST; |
aa5d6bed | 1634 | } |
ed2ff2cb CM |
1635 | if (ret < 0) |
1636 | goto out; | |
be0e5c09 | 1637 | |
62e2749e CM |
1638 | slot_orig = path->slots[0]; |
1639 | leaf_buf = path->nodes[0]; | |
e20d96d6 | 1640 | leaf = btrfs_buffer_leaf(leaf_buf); |
74123bd7 | 1641 | |
7518a238 | 1642 | nritems = btrfs_header_nritems(&leaf->header); |
123abc88 | 1643 | data_end = leaf_data_end(root, leaf); |
eb60ceac | 1644 | |
123abc88 | 1645 | if (btrfs_leaf_free_space(root, leaf) < |
d4dbff95 | 1646 | sizeof(struct btrfs_item) + data_size) { |
be0e5c09 | 1647 | BUG(); |
d4dbff95 | 1648 | } |
62e2749e | 1649 | slot = path->slots[0]; |
eb60ceac | 1650 | BUG_ON(slot < 0); |
be0e5c09 CM |
1651 | if (slot != nritems) { |
1652 | int i; | |
0783fcfc | 1653 | unsigned int old_data = btrfs_item_end(leaf->items + slot); |
be0e5c09 CM |
1654 | |
1655 | /* | |
1656 | * item0..itemN ... dataN.offset..dataN.size .. data0.size | |
1657 | */ | |
1658 | /* first correct the data pointers */ | |
0783fcfc | 1659 | for (i = slot; i < nritems; i++) { |
123abc88 | 1660 | u32 ioff = btrfs_item_offset(leaf->items + i); |
0783fcfc CM |
1661 | btrfs_set_item_offset(leaf->items + i, |
1662 | ioff - data_size); | |
1663 | } | |
be0e5c09 CM |
1664 | |
1665 | /* shift the items */ | |
d6025579 CM |
1666 | btrfs_memmove(root, leaf, leaf->items + slot + 1, |
1667 | leaf->items + slot, | |
1668 | (nritems - slot) * sizeof(struct btrfs_item)); | |
be0e5c09 CM |
1669 | |
1670 | /* shift the data */ | |
d6025579 CM |
1671 | btrfs_memmove(root, leaf, btrfs_leaf_data(leaf) + |
1672 | data_end - data_size, btrfs_leaf_data(leaf) + | |
1673 | data_end, old_data - data_end); | |
be0e5c09 CM |
1674 | data_end = old_data; |
1675 | } | |
62e2749e | 1676 | /* setup the item for the new data */ |
d6025579 CM |
1677 | btrfs_memcpy(root, leaf, &leaf->items[slot].key, &disk_key, |
1678 | sizeof(struct btrfs_disk_key)); | |
0783fcfc CM |
1679 | btrfs_set_item_offset(leaf->items + slot, data_end - data_size); |
1680 | btrfs_set_item_size(leaf->items + slot, data_size); | |
7518a238 | 1681 | btrfs_set_header_nritems(&leaf->header, nritems + 1); |
d6025579 | 1682 | btrfs_mark_buffer_dirty(leaf_buf); |
aa5d6bed CM |
1683 | |
1684 | ret = 0; | |
8e19f2cd | 1685 | if (slot == 0) |
e089f05c | 1686 | ret = fixup_low_keys(trans, root, path, &disk_key, 1); |
aa5d6bed | 1687 | |
123abc88 | 1688 | if (btrfs_leaf_free_space(root, leaf) < 0) |
be0e5c09 | 1689 | BUG(); |
62e2749e | 1690 | check_leaf(root, path, 0); |
ed2ff2cb | 1691 | out: |
62e2749e CM |
1692 | return ret; |
1693 | } | |
1694 | ||
1695 | /* | |
1696 | * Given a key and some data, insert an item into the tree. | |
1697 | * This does all the path init required, making room in the tree if needed. | |
1698 | */ | |
e089f05c CM |
1699 | int btrfs_insert_item(struct btrfs_trans_handle *trans, struct btrfs_root |
1700 | *root, struct btrfs_key *cpu_key, void *data, u32 | |
1701 | data_size) | |
62e2749e CM |
1702 | { |
1703 | int ret = 0; | |
2c90e5d6 | 1704 | struct btrfs_path *path; |
62e2749e CM |
1705 | u8 *ptr; |
1706 | ||
2c90e5d6 CM |
1707 | path = btrfs_alloc_path(); |
1708 | BUG_ON(!path); | |
2c90e5d6 | 1709 | ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size); |
62e2749e | 1710 | if (!ret) { |
2c90e5d6 CM |
1711 | ptr = btrfs_item_ptr(btrfs_buffer_leaf(path->nodes[0]), |
1712 | path->slots[0], u8); | |
1713 | btrfs_memcpy(root, path->nodes[0]->b_data, | |
d6025579 | 1714 | ptr, data, data_size); |
2c90e5d6 | 1715 | btrfs_mark_buffer_dirty(path->nodes[0]); |
62e2749e | 1716 | } |
2c90e5d6 | 1717 | btrfs_free_path(path); |
aa5d6bed | 1718 | return ret; |
be0e5c09 CM |
1719 | } |
1720 | ||
74123bd7 | 1721 | /* |
5de08d7d | 1722 | * delete the pointer from a given node. |
74123bd7 CM |
1723 | * |
1724 | * If the delete empties a node, the node is removed from the tree, | |
1725 | * continuing all the way the root if required. The root is converted into | |
1726 | * a leaf if all the nodes are emptied. | |
1727 | */ | |
e089f05c CM |
1728 | static int del_ptr(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
1729 | struct btrfs_path *path, int level, int slot) | |
be0e5c09 | 1730 | { |
234b63a0 | 1731 | struct btrfs_node *node; |
e20d96d6 | 1732 | struct buffer_head *parent = path->nodes[level]; |
7518a238 | 1733 | u32 nritems; |
aa5d6bed | 1734 | int ret = 0; |
bb803951 | 1735 | int wret; |
be0e5c09 | 1736 | |
e20d96d6 | 1737 | node = btrfs_buffer_node(parent); |
7518a238 | 1738 | nritems = btrfs_header_nritems(&node->header); |
bb803951 | 1739 | if (slot != nritems -1) { |
d6025579 CM |
1740 | btrfs_memmove(root, node, node->ptrs + slot, |
1741 | node->ptrs + slot + 1, | |
1742 | sizeof(struct btrfs_key_ptr) * | |
1743 | (nritems - slot - 1)); | |
bb803951 | 1744 | } |
7518a238 CM |
1745 | nritems--; |
1746 | btrfs_set_header_nritems(&node->header, nritems); | |
1747 | if (nritems == 0 && parent == root->node) { | |
e20d96d6 CM |
1748 | struct btrfs_header *header = btrfs_buffer_header(root->node); |
1749 | BUG_ON(btrfs_header_level(header) != 1); | |
bb803951 | 1750 | /* just turn the root into a leaf and break */ |
e20d96d6 | 1751 | btrfs_set_header_level(header, 0); |
bb803951 | 1752 | } else if (slot == 0) { |
e089f05c | 1753 | wret = fixup_low_keys(trans, root, path, &node->ptrs[0].key, |
123abc88 | 1754 | level + 1); |
0f70abe2 CM |
1755 | if (wret) |
1756 | ret = wret; | |
be0e5c09 | 1757 | } |
d6025579 | 1758 | btrfs_mark_buffer_dirty(parent); |
aa5d6bed | 1759 | return ret; |
be0e5c09 CM |
1760 | } |
1761 | ||
74123bd7 CM |
1762 | /* |
1763 | * delete the item at the leaf level in path. If that empties | |
1764 | * the leaf, remove it from the tree | |
1765 | */ | |
e089f05c CM |
1766 | int btrfs_del_item(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
1767 | struct btrfs_path *path) | |
be0e5c09 | 1768 | { |
be0e5c09 | 1769 | int slot; |
234b63a0 | 1770 | struct btrfs_leaf *leaf; |
e20d96d6 | 1771 | struct buffer_head *leaf_buf; |
be0e5c09 CM |
1772 | int doff; |
1773 | int dsize; | |
aa5d6bed CM |
1774 | int ret = 0; |
1775 | int wret; | |
7518a238 | 1776 | u32 nritems; |
be0e5c09 | 1777 | |
eb60ceac | 1778 | leaf_buf = path->nodes[0]; |
e20d96d6 | 1779 | leaf = btrfs_buffer_leaf(leaf_buf); |
4920c9ac | 1780 | slot = path->slots[0]; |
0783fcfc CM |
1781 | doff = btrfs_item_offset(leaf->items + slot); |
1782 | dsize = btrfs_item_size(leaf->items + slot); | |
7518a238 | 1783 | nritems = btrfs_header_nritems(&leaf->header); |
be0e5c09 | 1784 | |
7518a238 | 1785 | if (slot != nritems - 1) { |
be0e5c09 | 1786 | int i; |
123abc88 | 1787 | int data_end = leaf_data_end(root, leaf); |
d6025579 CM |
1788 | btrfs_memmove(root, leaf, btrfs_leaf_data(leaf) + |
1789 | data_end + dsize, | |
1790 | btrfs_leaf_data(leaf) + data_end, | |
1791 | doff - data_end); | |
0783fcfc | 1792 | for (i = slot + 1; i < nritems; i++) { |
123abc88 | 1793 | u32 ioff = btrfs_item_offset(leaf->items + i); |
0783fcfc CM |
1794 | btrfs_set_item_offset(leaf->items + i, ioff + dsize); |
1795 | } | |
d6025579 CM |
1796 | btrfs_memmove(root, leaf, leaf->items + slot, |
1797 | leaf->items + slot + 1, | |
1798 | sizeof(struct btrfs_item) * | |
1799 | (nritems - slot - 1)); | |
be0e5c09 | 1800 | } |
7518a238 CM |
1801 | btrfs_set_header_nritems(&leaf->header, nritems - 1); |
1802 | nritems--; | |
74123bd7 | 1803 | /* delete the leaf if we've emptied it */ |
7518a238 | 1804 | if (nritems == 0) { |
eb60ceac | 1805 | if (leaf_buf == root->node) { |
7518a238 | 1806 | btrfs_set_header_level(&leaf->header, 0); |
9a8dd150 | 1807 | } else { |
e089f05c | 1808 | clean_tree_block(trans, root, leaf_buf); |
d6025579 | 1809 | wait_on_buffer(leaf_buf); |
e089f05c | 1810 | wret = del_ptr(trans, root, path, 1, path->slots[1]); |
aa5d6bed CM |
1811 | if (wret) |
1812 | ret = wret; | |
e089f05c | 1813 | wret = btrfs_free_extent(trans, root, |
7eccb903 | 1814 | bh_blocknr(leaf_buf), 1, 1); |
0f70abe2 CM |
1815 | if (wret) |
1816 | ret = wret; | |
9a8dd150 | 1817 | } |
be0e5c09 | 1818 | } else { |
7518a238 | 1819 | int used = leaf_space_used(leaf, 0, nritems); |
aa5d6bed | 1820 | if (slot == 0) { |
e089f05c CM |
1821 | wret = fixup_low_keys(trans, root, path, |
1822 | &leaf->items[0].key, 1); | |
aa5d6bed CM |
1823 | if (wret) |
1824 | ret = wret; | |
1825 | } | |
aa5d6bed | 1826 | |
74123bd7 | 1827 | /* delete the leaf if it is mostly empty */ |
123abc88 | 1828 | if (used < BTRFS_LEAF_DATA_SIZE(root) / 3) { |
be0e5c09 CM |
1829 | /* push_leaf_left fixes the path. |
1830 | * make sure the path still points to our leaf | |
1831 | * for possible call to del_ptr below | |
1832 | */ | |
4920c9ac | 1833 | slot = path->slots[1]; |
e20d96d6 | 1834 | get_bh(leaf_buf); |
e089f05c | 1835 | wret = push_leaf_left(trans, root, path, 1); |
54aa1f4d | 1836 | if (wret < 0 && wret != -ENOSPC) |
aa5d6bed | 1837 | ret = wret; |
f0930a37 | 1838 | if (path->nodes[0] == leaf_buf && |
7518a238 | 1839 | btrfs_header_nritems(&leaf->header)) { |
e089f05c | 1840 | wret = push_leaf_right(trans, root, path, 1); |
54aa1f4d | 1841 | if (wret < 0 && wret != -ENOSPC) |
aa5d6bed CM |
1842 | ret = wret; |
1843 | } | |
7518a238 | 1844 | if (btrfs_header_nritems(&leaf->header) == 0) { |
7eccb903 | 1845 | u64 blocknr = bh_blocknr(leaf_buf); |
e089f05c | 1846 | clean_tree_block(trans, root, leaf_buf); |
d6025579 | 1847 | wait_on_buffer(leaf_buf); |
e089f05c | 1848 | wret = del_ptr(trans, root, path, 1, slot); |
aa5d6bed CM |
1849 | if (wret) |
1850 | ret = wret; | |
234b63a0 | 1851 | btrfs_block_release(root, leaf_buf); |
e089f05c CM |
1852 | wret = btrfs_free_extent(trans, root, blocknr, |
1853 | 1, 1); | |
0f70abe2 CM |
1854 | if (wret) |
1855 | ret = wret; | |
5de08d7d | 1856 | } else { |
d6025579 | 1857 | btrfs_mark_buffer_dirty(leaf_buf); |
234b63a0 | 1858 | btrfs_block_release(root, leaf_buf); |
be0e5c09 | 1859 | } |
d5719762 | 1860 | } else { |
d6025579 | 1861 | btrfs_mark_buffer_dirty(leaf_buf); |
be0e5c09 CM |
1862 | } |
1863 | } | |
aa5d6bed | 1864 | return ret; |
be0e5c09 CM |
1865 | } |
1866 | ||
97571fd0 CM |
1867 | /* |
1868 | * walk up the tree as far as required to find the next leaf. | |
0f70abe2 CM |
1869 | * returns 0 if it found something or 1 if there are no greater leaves. |
1870 | * returns < 0 on io errors. | |
97571fd0 | 1871 | */ |
234b63a0 | 1872 | int btrfs_next_leaf(struct btrfs_root *root, struct btrfs_path *path) |
d97e63b6 CM |
1873 | { |
1874 | int slot; | |
1875 | int level = 1; | |
1876 | u64 blocknr; | |
e20d96d6 CM |
1877 | struct buffer_head *c; |
1878 | struct btrfs_node *c_node; | |
1879 | struct buffer_head *next = NULL; | |
d97e63b6 | 1880 | |
234b63a0 | 1881 | while(level < BTRFS_MAX_LEVEL) { |
d97e63b6 | 1882 | if (!path->nodes[level]) |
0f70abe2 | 1883 | return 1; |
d97e63b6 CM |
1884 | slot = path->slots[level] + 1; |
1885 | c = path->nodes[level]; | |
e20d96d6 CM |
1886 | c_node = btrfs_buffer_node(c); |
1887 | if (slot >= btrfs_header_nritems(&c_node->header)) { | |
d97e63b6 CM |
1888 | level++; |
1889 | continue; | |
1890 | } | |
e20d96d6 | 1891 | blocknr = btrfs_node_blockptr(c_node, slot); |
cfaa7295 | 1892 | if (next) |
234b63a0 | 1893 | btrfs_block_release(root, next); |
d97e63b6 CM |
1894 | next = read_tree_block(root, blocknr); |
1895 | break; | |
1896 | } | |
1897 | path->slots[level] = slot; | |
1898 | while(1) { | |
1899 | level--; | |
1900 | c = path->nodes[level]; | |
234b63a0 | 1901 | btrfs_block_release(root, c); |
d97e63b6 CM |
1902 | path->nodes[level] = next; |
1903 | path->slots[level] = 0; | |
1904 | if (!level) | |
1905 | break; | |
1d4f8a0c | 1906 | next = read_tree_block(root, |
e20d96d6 | 1907 | btrfs_node_blockptr(btrfs_buffer_node(next), 0)); |
d97e63b6 CM |
1908 | } |
1909 | return 0; | |
1910 | } |