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