]>
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 | ||
eb60ceac CM |
19 | #include "ctree.h" |
20 | #include "disk-io.h" | |
7f5c1516 | 21 | #include "transaction.h" |
5f39d397 | 22 | #include "print-tree.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); | |
5f39d397 CM |
29 | static int push_node_left(struct btrfs_trans_handle *trans, |
30 | struct btrfs_root *root, struct extent_buffer *dst, | |
31 | struct extent_buffer *src); | |
32 | static int balance_node_right(struct btrfs_trans_handle *trans, | |
33 | struct btrfs_root *root, | |
34 | struct extent_buffer *dst_buf, | |
35 | struct extent_buffer *src_buf); | |
e089f05c CM |
36 | static int del_ptr(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
37 | struct btrfs_path *path, int level, int slot); | |
d97e63b6 | 38 | |
df24a2b9 | 39 | inline void btrfs_init_path(struct btrfs_path *p) |
2c90e5d6 | 40 | { |
df24a2b9 | 41 | memset(p, 0, sizeof(*p)); |
2c90e5d6 CM |
42 | } |
43 | ||
df24a2b9 | 44 | struct btrfs_path *btrfs_alloc_path(void) |
2c90e5d6 | 45 | { |
df24a2b9 CM |
46 | struct btrfs_path *path; |
47 | path = kmem_cache_alloc(btrfs_path_cachep, GFP_NOFS); | |
2cc58cf2 | 48 | if (path) { |
df24a2b9 | 49 | btrfs_init_path(path); |
2cc58cf2 CM |
50 | path->reada = 1; |
51 | } | |
df24a2b9 | 52 | return path; |
2c90e5d6 CM |
53 | } |
54 | ||
df24a2b9 | 55 | void btrfs_free_path(struct btrfs_path *p) |
be0e5c09 | 56 | { |
df24a2b9 CM |
57 | btrfs_release_path(NULL, p); |
58 | kmem_cache_free(btrfs_path_cachep, p); | |
be0e5c09 CM |
59 | } |
60 | ||
234b63a0 | 61 | void btrfs_release_path(struct btrfs_root *root, struct btrfs_path *p) |
eb60ceac CM |
62 | { |
63 | int i; | |
234b63a0 | 64 | for (i = 0; i < BTRFS_MAX_LEVEL; i++) { |
eb60ceac CM |
65 | if (!p->nodes[i]) |
66 | break; | |
5f39d397 | 67 | free_extent_buffer(p->nodes[i]); |
eb60ceac | 68 | } |
aa5d6bed | 69 | memset(p, 0, sizeof(*p)); |
eb60ceac CM |
70 | } |
71 | ||
5f39d397 CM |
72 | static int __btrfs_cow_block(struct btrfs_trans_handle *trans, |
73 | struct btrfs_root *root, | |
74 | struct extent_buffer *buf, | |
75 | struct extent_buffer *parent, int parent_slot, | |
76 | struct extent_buffer **cow_ret, | |
77 | u64 search_start, u64 empty_size) | |
02217ed2 | 78 | { |
5f39d397 | 79 | struct extent_buffer *cow; |
6702ed49 CM |
80 | int ret = 0; |
81 | int different_trans = 0; | |
02217ed2 | 82 | |
6702ed49 | 83 | WARN_ON(root->ref_cows && trans->transid != root->last_trans); |
5f39d397 | 84 | |
db94535d CM |
85 | cow = btrfs_alloc_free_block(trans, root, buf->len, |
86 | search_start, empty_size); | |
54aa1f4d CM |
87 | if (IS_ERR(cow)) |
88 | return PTR_ERR(cow); | |
6702ed49 | 89 | |
5f39d397 | 90 | copy_extent_buffer(cow, buf, 0, 0, cow->len); |
db94535d | 91 | btrfs_set_header_bytenr(cow, cow->start); |
5f39d397 CM |
92 | btrfs_set_header_generation(cow, trans->transid); |
93 | btrfs_set_header_owner(cow, root->root_key.objectid); | |
6702ed49 | 94 | |
5f39d397 CM |
95 | WARN_ON(btrfs_header_generation(buf) > trans->transid); |
96 | if (btrfs_header_generation(buf) != trans->transid) { | |
6702ed49 CM |
97 | different_trans = 1; |
98 | ret = btrfs_inc_ref(trans, root, buf); | |
99 | if (ret) | |
100 | return ret; | |
101 | } else { | |
6702ed49 CM |
102 | clean_tree_block(trans, root, buf); |
103 | } | |
104 | ||
02217ed2 CM |
105 | if (buf == root->node) { |
106 | root->node = cow; | |
5f39d397 | 107 | extent_buffer_get(cow); |
2c90e5d6 | 108 | if (buf != root->commit_root) { |
db94535d CM |
109 | btrfs_free_extent(trans, root, buf->start, |
110 | buf->len, 1); | |
2c90e5d6 | 111 | } |
5f39d397 | 112 | free_extent_buffer(buf); |
02217ed2 | 113 | } else { |
5f39d397 | 114 | btrfs_set_node_blockptr(parent, parent_slot, |
db94535d | 115 | cow->start); |
d6025579 | 116 | btrfs_mark_buffer_dirty(parent); |
5f39d397 | 117 | WARN_ON(btrfs_header_generation(parent) != trans->transid); |
db94535d | 118 | btrfs_free_extent(trans, root, buf->start, buf->len, 1); |
02217ed2 | 119 | } |
5f39d397 | 120 | free_extent_buffer(buf); |
ccd467d6 | 121 | btrfs_mark_buffer_dirty(cow); |
2c90e5d6 | 122 | *cow_ret = cow; |
02217ed2 CM |
123 | return 0; |
124 | } | |
125 | ||
5f39d397 CM |
126 | int btrfs_cow_block(struct btrfs_trans_handle *trans, |
127 | struct btrfs_root *root, struct extent_buffer *buf, | |
128 | struct extent_buffer *parent, int parent_slot, | |
129 | struct extent_buffer **cow_ret) | |
6702ed49 CM |
130 | { |
131 | u64 search_start; | |
f510cfec | 132 | int ret; |
6702ed49 CM |
133 | if (trans->transaction != root->fs_info->running_transaction) { |
134 | printk(KERN_CRIT "trans %Lu running %Lu\n", trans->transid, | |
135 | root->fs_info->running_transaction->transid); | |
136 | WARN_ON(1); | |
137 | } | |
138 | if (trans->transid != root->fs_info->generation) { | |
139 | printk(KERN_CRIT "trans %Lu running %Lu\n", trans->transid, | |
140 | root->fs_info->generation); | |
141 | WARN_ON(1); | |
142 | } | |
5f39d397 | 143 | if (btrfs_header_generation(buf) == trans->transid) { |
6702ed49 CM |
144 | *cow_ret = buf; |
145 | return 0; | |
146 | } | |
147 | ||
db94535d | 148 | search_start = buf->start & ~((u64)BTRFS_BLOCK_GROUP_SIZE - 1); |
f510cfec | 149 | ret = __btrfs_cow_block(trans, root, buf, parent, |
6702ed49 | 150 | parent_slot, cow_ret, search_start, 0); |
f510cfec | 151 | return ret; |
6702ed49 CM |
152 | } |
153 | ||
6b80053d | 154 | static int close_blocks(u64 blocknr, u64 other, u32 blocksize) |
6702ed49 | 155 | { |
6b80053d | 156 | if (blocknr < other && other - (blocknr + blocksize) < 32768) |
6702ed49 | 157 | return 1; |
6b80053d | 158 | if (blocknr > other && blocknr - (other + blocksize) < 32768) |
6702ed49 CM |
159 | return 1; |
160 | return 0; | |
161 | } | |
162 | ||
6b80053d | 163 | static int should_defrag_leaf(struct extent_buffer *leaf) |
2cc58cf2 | 164 | { |
6b80053d | 165 | struct btrfs_key key; |
2cc58cf2 CM |
166 | u32 nritems; |
167 | ||
6b80053d | 168 | if (btrfs_buffer_defrag(leaf)) |
2cc58cf2 CM |
169 | return 1; |
170 | ||
6b80053d | 171 | nritems = btrfs_header_nritems(leaf); |
2cc58cf2 CM |
172 | if (nritems == 0) |
173 | return 0; | |
174 | ||
6b80053d CM |
175 | btrfs_item_key_to_cpu(leaf, &key, 0); |
176 | if (key.type == BTRFS_DIR_ITEM_KEY) | |
2cc58cf2 CM |
177 | return 1; |
178 | ||
6b80053d CM |
179 | |
180 | btrfs_item_key_to_cpu(leaf, &key, nritems - 1); | |
181 | if (key.type == BTRFS_DIR_ITEM_KEY) | |
2cc58cf2 CM |
182 | return 1; |
183 | if (nritems > 4) { | |
6b80053d CM |
184 | btrfs_item_key_to_cpu(leaf, &key, nritems / 2); |
185 | if (key.type == BTRFS_DIR_ITEM_KEY) | |
2cc58cf2 CM |
186 | return 1; |
187 | } | |
188 | return 0; | |
189 | } | |
190 | ||
6702ed49 | 191 | int btrfs_realloc_node(struct btrfs_trans_handle *trans, |
5f39d397 | 192 | struct btrfs_root *root, struct extent_buffer *parent, |
e9d0b13b | 193 | int cache_only, u64 *last_ret) |
6702ed49 | 194 | { |
6b80053d CM |
195 | struct extent_buffer *cur; |
196 | struct extent_buffer *tmp; | |
6702ed49 | 197 | u64 blocknr; |
e9d0b13b CM |
198 | u64 search_start = *last_ret; |
199 | u64 last_block = 0; | |
6702ed49 CM |
200 | u64 other; |
201 | u32 parent_nritems; | |
202 | int start_slot; | |
203 | int end_slot; | |
204 | int i; | |
205 | int err = 0; | |
f2183bde | 206 | int parent_level; |
6b80053d CM |
207 | int uptodate; |
208 | u32 blocksize; | |
6702ed49 CM |
209 | |
210 | if (trans->transaction != root->fs_info->running_transaction) { | |
211 | printk(KERN_CRIT "trans %Lu running %Lu\n", trans->transid, | |
212 | root->fs_info->running_transaction->transid); | |
213 | WARN_ON(1); | |
214 | } | |
215 | if (trans->transid != root->fs_info->generation) { | |
216 | printk(KERN_CRIT "trans %Lu running %Lu\n", trans->transid, | |
217 | root->fs_info->generation); | |
218 | WARN_ON(1); | |
219 | } | |
0f1ebbd1 | 220 | parent_level = btrfs_header_level(parent); |
86479a04 | 221 | |
6b80053d | 222 | parent_nritems = btrfs_header_nritems(parent); |
6b80053d | 223 | blocksize = btrfs_level_size(root, parent_level - 1); |
6702ed49 CM |
224 | |
225 | start_slot = 0; | |
226 | end_slot = parent_nritems; | |
227 | ||
228 | if (parent_nritems == 1) | |
229 | return 0; | |
230 | ||
231 | for (i = start_slot; i < end_slot; i++) { | |
232 | int close = 1; | |
6b80053d | 233 | blocknr = btrfs_node_blockptr(parent, i); |
e9d0b13b CM |
234 | if (last_block == 0) |
235 | last_block = blocknr; | |
6702ed49 | 236 | if (i > 0) { |
6b80053d CM |
237 | other = btrfs_node_blockptr(parent, i - 1); |
238 | close = close_blocks(blocknr, other, blocksize); | |
6702ed49 CM |
239 | } |
240 | if (close && i < end_slot - 1) { | |
6b80053d CM |
241 | other = btrfs_node_blockptr(parent, i + 1); |
242 | close = close_blocks(blocknr, other, blocksize); | |
6702ed49 | 243 | } |
e9d0b13b CM |
244 | if (close) { |
245 | last_block = blocknr; | |
6702ed49 | 246 | continue; |
e9d0b13b | 247 | } |
6702ed49 | 248 | |
6b80053d CM |
249 | cur = btrfs_find_tree_block(root, blocknr, blocksize); |
250 | if (cur) | |
251 | uptodate = btrfs_buffer_uptodate(cur); | |
252 | else | |
253 | uptodate = 0; | |
254 | if (!cur || !uptodate || | |
255 | (parent_level != 1 && !btrfs_buffer_defrag(cur)) || | |
256 | (parent_level == 1 && !should_defrag_leaf(cur))) { | |
6702ed49 | 257 | if (cache_only) { |
6b80053d | 258 | free_extent_buffer(cur); |
6702ed49 CM |
259 | continue; |
260 | } | |
6b80053d CM |
261 | if (!cur) { |
262 | cur = read_tree_block(root, blocknr, | |
263 | blocksize); | |
264 | } else if (!uptodate) { | |
265 | btrfs_read_buffer(cur); | |
f2183bde | 266 | } |
6702ed49 | 267 | } |
e9d0b13b | 268 | if (search_start == 0) |
6b80053d | 269 | search_start = last_block; |
e9d0b13b | 270 | |
6b80053d CM |
271 | err = __btrfs_cow_block(trans, root, cur, parent, i, |
272 | &tmp, search_start, | |
273 | min(16 * blocksize, | |
274 | (end_slot - i) * blocksize)); | |
252c38f0 | 275 | if (err) { |
6b80053d | 276 | free_extent_buffer(cur); |
6702ed49 | 277 | break; |
252c38f0 | 278 | } |
6b80053d | 279 | search_start = tmp->start; |
f2183bde CM |
280 | *last_ret = search_start; |
281 | if (parent_level == 1) | |
6b80053d | 282 | btrfs_clear_buffer_defrag(tmp); |
6b80053d | 283 | free_extent_buffer(tmp); |
6702ed49 CM |
284 | } |
285 | return err; | |
286 | } | |
287 | ||
74123bd7 CM |
288 | /* |
289 | * The leaf data grows from end-to-front in the node. | |
290 | * this returns the address of the start of the last item, | |
291 | * which is the stop of the leaf data stack | |
292 | */ | |
123abc88 | 293 | static inline unsigned int leaf_data_end(struct btrfs_root *root, |
5f39d397 | 294 | struct extent_buffer *leaf) |
be0e5c09 | 295 | { |
5f39d397 | 296 | u32 nr = btrfs_header_nritems(leaf); |
be0e5c09 | 297 | if (nr == 0) |
123abc88 | 298 | return BTRFS_LEAF_DATA_SIZE(root); |
5f39d397 | 299 | return btrfs_item_offset_nr(leaf, nr - 1); |
be0e5c09 CM |
300 | } |
301 | ||
74123bd7 CM |
302 | /* |
303 | * compare two keys in a memcmp fashion | |
304 | */ | |
9aca1d51 | 305 | static int comp_keys(struct btrfs_disk_key *disk, struct btrfs_key *k2) |
be0e5c09 | 306 | { |
e2fa7227 CM |
307 | struct btrfs_key k1; |
308 | ||
309 | btrfs_disk_key_to_cpu(&k1, disk); | |
310 | ||
311 | if (k1.objectid > k2->objectid) | |
be0e5c09 | 312 | return 1; |
e2fa7227 | 313 | if (k1.objectid < k2->objectid) |
be0e5c09 | 314 | return -1; |
5f39d397 | 315 | if (k1.type > k2->type) |
f254e52c | 316 | return 1; |
5f39d397 | 317 | if (k1.type < k2->type) |
f254e52c | 318 | return -1; |
70b2befd CM |
319 | if (k1.offset > k2->offset) |
320 | return 1; | |
321 | if (k1.offset < k2->offset) | |
322 | return -1; | |
be0e5c09 CM |
323 | return 0; |
324 | } | |
74123bd7 | 325 | |
123abc88 CM |
326 | static int check_node(struct btrfs_root *root, struct btrfs_path *path, |
327 | int level) | |
aa5d6bed | 328 | { |
5f39d397 CM |
329 | struct extent_buffer *parent = NULL; |
330 | struct extent_buffer *node = path->nodes[level]; | |
331 | struct btrfs_disk_key parent_key; | |
332 | struct btrfs_disk_key node_key; | |
aa5d6bed | 333 | int parent_slot; |
8d7be552 CM |
334 | int slot; |
335 | struct btrfs_key cpukey; | |
5f39d397 | 336 | u32 nritems = btrfs_header_nritems(node); |
aa5d6bed CM |
337 | |
338 | if (path->nodes[level + 1]) | |
5f39d397 | 339 | parent = path->nodes[level + 1]; |
a1f39630 | 340 | |
8d7be552 | 341 | slot = path->slots[level]; |
7518a238 CM |
342 | BUG_ON(nritems == 0); |
343 | if (parent) { | |
a1f39630 | 344 | parent_slot = path->slots[level + 1]; |
5f39d397 CM |
345 | btrfs_node_key(parent, &parent_key, parent_slot); |
346 | btrfs_node_key(node, &node_key, 0); | |
347 | BUG_ON(memcmp(&parent_key, &node_key, | |
e2fa7227 | 348 | sizeof(struct btrfs_disk_key))); |
1d4f8a0c | 349 | BUG_ON(btrfs_node_blockptr(parent, parent_slot) != |
db94535d | 350 | btrfs_header_bytenr(node)); |
aa5d6bed | 351 | } |
123abc88 | 352 | BUG_ON(nritems > BTRFS_NODEPTRS_PER_BLOCK(root)); |
8d7be552 | 353 | if (slot != 0) { |
5f39d397 CM |
354 | btrfs_node_key_to_cpu(node, &cpukey, slot - 1); |
355 | btrfs_node_key(node, &node_key, slot); | |
356 | BUG_ON(comp_keys(&node_key, &cpukey) <= 0); | |
8d7be552 CM |
357 | } |
358 | if (slot < nritems - 1) { | |
5f39d397 CM |
359 | btrfs_node_key_to_cpu(node, &cpukey, slot + 1); |
360 | btrfs_node_key(node, &node_key, slot); | |
361 | BUG_ON(comp_keys(&node_key, &cpukey) >= 0); | |
aa5d6bed CM |
362 | } |
363 | return 0; | |
364 | } | |
365 | ||
123abc88 CM |
366 | static int check_leaf(struct btrfs_root *root, struct btrfs_path *path, |
367 | int level) | |
aa5d6bed | 368 | { |
5f39d397 CM |
369 | struct extent_buffer *leaf = path->nodes[level]; |
370 | struct extent_buffer *parent = NULL; | |
aa5d6bed | 371 | int parent_slot; |
8d7be552 | 372 | struct btrfs_key cpukey; |
5f39d397 CM |
373 | struct btrfs_disk_key parent_key; |
374 | struct btrfs_disk_key leaf_key; | |
375 | int slot = path->slots[0]; | |
8d7be552 | 376 | |
5f39d397 | 377 | u32 nritems = btrfs_header_nritems(leaf); |
aa5d6bed CM |
378 | |
379 | if (path->nodes[level + 1]) | |
5f39d397 | 380 | parent = path->nodes[level + 1]; |
7518a238 CM |
381 | |
382 | if (nritems == 0) | |
383 | return 0; | |
384 | ||
385 | if (parent) { | |
a1f39630 | 386 | parent_slot = path->slots[level + 1]; |
5f39d397 CM |
387 | btrfs_node_key(parent, &parent_key, parent_slot); |
388 | btrfs_item_key(leaf, &leaf_key, 0); | |
6702ed49 | 389 | |
5f39d397 | 390 | BUG_ON(memcmp(&parent_key, &leaf_key, |
e2fa7227 | 391 | sizeof(struct btrfs_disk_key))); |
1d4f8a0c | 392 | BUG_ON(btrfs_node_blockptr(parent, parent_slot) != |
db94535d | 393 | btrfs_header_bytenr(leaf)); |
5f39d397 CM |
394 | } |
395 | #if 0 | |
396 | for (i = 0; nritems > 1 && i < nritems - 2; i++) { | |
397 | btrfs_item_key_to_cpu(leaf, &cpukey, i + 1); | |
398 | btrfs_item_key(leaf, &leaf_key, i); | |
399 | if (comp_keys(&leaf_key, &cpukey) >= 0) { | |
400 | btrfs_print_leaf(root, leaf); | |
401 | printk("slot %d offset bad key\n", i); | |
402 | BUG_ON(1); | |
403 | } | |
404 | if (btrfs_item_offset_nr(leaf, i) != | |
405 | btrfs_item_end_nr(leaf, i + 1)) { | |
406 | btrfs_print_leaf(root, leaf); | |
407 | printk("slot %d offset bad\n", i); | |
408 | BUG_ON(1); | |
409 | } | |
410 | if (i == 0) { | |
411 | if (btrfs_item_offset_nr(leaf, i) + | |
412 | btrfs_item_size_nr(leaf, i) != | |
413 | BTRFS_LEAF_DATA_SIZE(root)) { | |
414 | btrfs_print_leaf(root, leaf); | |
415 | printk("slot %d first offset bad\n", i); | |
416 | BUG_ON(1); | |
417 | } | |
418 | } | |
aa5d6bed | 419 | } |
5f39d397 CM |
420 | if (nritems > 0) { |
421 | if (btrfs_item_size_nr(leaf, nritems - 1) > 4096) { | |
422 | btrfs_print_leaf(root, leaf); | |
423 | printk("slot %d bad size \n", nritems - 1); | |
424 | BUG_ON(1); | |
425 | } | |
426 | } | |
427 | #endif | |
428 | if (slot != 0 && slot < nritems - 1) { | |
429 | btrfs_item_key(leaf, &leaf_key, slot); | |
430 | btrfs_item_key_to_cpu(leaf, &cpukey, slot - 1); | |
431 | if (comp_keys(&leaf_key, &cpukey) <= 0) { | |
432 | btrfs_print_leaf(root, leaf); | |
433 | printk("slot %d offset bad key\n", slot); | |
434 | BUG_ON(1); | |
435 | } | |
436 | if (btrfs_item_offset_nr(leaf, slot - 1) != | |
437 | btrfs_item_end_nr(leaf, slot)) { | |
438 | btrfs_print_leaf(root, leaf); | |
439 | printk("slot %d offset bad\n", slot); | |
440 | BUG_ON(1); | |
441 | } | |
8d7be552 CM |
442 | } |
443 | if (slot < nritems - 1) { | |
5f39d397 CM |
444 | btrfs_item_key(leaf, &leaf_key, slot); |
445 | btrfs_item_key_to_cpu(leaf, &cpukey, slot + 1); | |
446 | BUG_ON(comp_keys(&leaf_key, &cpukey) >= 0); | |
447 | if (btrfs_item_offset_nr(leaf, slot) != | |
448 | btrfs_item_end_nr(leaf, slot + 1)) { | |
449 | btrfs_print_leaf(root, leaf); | |
450 | printk("slot %d offset bad\n", slot); | |
451 | BUG_ON(1); | |
452 | } | |
aa5d6bed | 453 | } |
5f39d397 CM |
454 | BUG_ON(btrfs_item_offset_nr(leaf, 0) + |
455 | btrfs_item_size_nr(leaf, 0) != BTRFS_LEAF_DATA_SIZE(root)); | |
aa5d6bed CM |
456 | return 0; |
457 | } | |
458 | ||
123abc88 CM |
459 | static int check_block(struct btrfs_root *root, struct btrfs_path *path, |
460 | int level) | |
aa5d6bed | 461 | { |
810191ff | 462 | return 0; |
db94535d | 463 | #if 0 |
5f39d397 | 464 | struct extent_buffer *buf = path->nodes[level]; |
5f39d397 | 465 | |
479965d6 CM |
466 | if (memcmp_extent_buffer(buf, root->fs_info->fsid, |
467 | (unsigned long)btrfs_header_fsid(buf), | |
468 | BTRFS_FSID_SIZE)) { | |
5f39d397 | 469 | printk("warning bad block %Lu\n", buf->start); |
db94535d | 470 | return 1; |
5f39d397 | 471 | } |
db94535d | 472 | #endif |
aa5d6bed | 473 | if (level == 0) |
123abc88 CM |
474 | return check_leaf(root, path, level); |
475 | return check_node(root, path, level); | |
aa5d6bed CM |
476 | } |
477 | ||
74123bd7 | 478 | /* |
5f39d397 CM |
479 | * search for key in the extent_buffer. The items start at offset p, |
480 | * and they are item_size apart. There are 'max' items in p. | |
481 | * | |
74123bd7 CM |
482 | * the slot in the array is returned via slot, and it points to |
483 | * the place where you would insert key if it is not found in | |
484 | * the array. | |
485 | * | |
486 | * slot may point to max if the key is bigger than all of the keys | |
487 | */ | |
5f39d397 CM |
488 | static int generic_bin_search(struct extent_buffer *eb, unsigned long p, |
489 | int item_size, struct btrfs_key *key, | |
490 | int max, int *slot) | |
be0e5c09 CM |
491 | { |
492 | int low = 0; | |
493 | int high = max; | |
494 | int mid; | |
495 | int ret; | |
479965d6 | 496 | struct btrfs_disk_key *tmp = NULL; |
5f39d397 CM |
497 | struct btrfs_disk_key unaligned; |
498 | unsigned long offset; | |
499 | char *map_token = NULL; | |
500 | char *kaddr = NULL; | |
501 | unsigned long map_start = 0; | |
502 | unsigned long map_len = 0; | |
479965d6 | 503 | int err; |
be0e5c09 CM |
504 | |
505 | while(low < high) { | |
506 | mid = (low + high) / 2; | |
5f39d397 CM |
507 | offset = p + mid * item_size; |
508 | ||
509 | if (!map_token || offset < map_start || | |
510 | (offset + sizeof(struct btrfs_disk_key)) > | |
511 | map_start + map_len) { | |
479965d6 | 512 | if (map_token) { |
5f39d397 | 513 | unmap_extent_buffer(eb, map_token, KM_USER0); |
479965d6 CM |
514 | map_token = NULL; |
515 | } | |
516 | err = map_extent_buffer(eb, offset, | |
517 | sizeof(struct btrfs_disk_key), | |
518 | &map_token, &kaddr, | |
519 | &map_start, &map_len, KM_USER0); | |
520 | ||
521 | if (!err) { | |
522 | tmp = (struct btrfs_disk_key *)(kaddr + offset - | |
523 | map_start); | |
524 | } else { | |
525 | read_extent_buffer(eb, &unaligned, | |
526 | offset, sizeof(unaligned)); | |
527 | tmp = &unaligned; | |
528 | } | |
5f39d397 | 529 | |
5f39d397 CM |
530 | } else { |
531 | tmp = (struct btrfs_disk_key *)(kaddr + offset - | |
532 | map_start); | |
533 | } | |
be0e5c09 CM |
534 | ret = comp_keys(tmp, key); |
535 | ||
536 | if (ret < 0) | |
537 | low = mid + 1; | |
538 | else if (ret > 0) | |
539 | high = mid; | |
540 | else { | |
541 | *slot = mid; | |
479965d6 CM |
542 | if (map_token) |
543 | unmap_extent_buffer(eb, map_token, KM_USER0); | |
be0e5c09 CM |
544 | return 0; |
545 | } | |
546 | } | |
547 | *slot = low; | |
5f39d397 CM |
548 | if (map_token) |
549 | unmap_extent_buffer(eb, map_token, KM_USER0); | |
be0e5c09 CM |
550 | return 1; |
551 | } | |
552 | ||
97571fd0 CM |
553 | /* |
554 | * simple bin_search frontend that does the right thing for | |
555 | * leaves vs nodes | |
556 | */ | |
5f39d397 CM |
557 | static int bin_search(struct extent_buffer *eb, struct btrfs_key *key, |
558 | int level, int *slot) | |
be0e5c09 | 559 | { |
5f39d397 CM |
560 | if (level == 0) { |
561 | return generic_bin_search(eb, | |
562 | offsetof(struct btrfs_leaf, items), | |
0783fcfc | 563 | sizeof(struct btrfs_item), |
5f39d397 | 564 | key, btrfs_header_nritems(eb), |
7518a238 | 565 | slot); |
be0e5c09 | 566 | } else { |
5f39d397 CM |
567 | return generic_bin_search(eb, |
568 | offsetof(struct btrfs_node, ptrs), | |
123abc88 | 569 | sizeof(struct btrfs_key_ptr), |
5f39d397 | 570 | key, btrfs_header_nritems(eb), |
7518a238 | 571 | slot); |
be0e5c09 CM |
572 | } |
573 | return -1; | |
574 | } | |
575 | ||
5f39d397 CM |
576 | static struct extent_buffer *read_node_slot(struct btrfs_root *root, |
577 | struct extent_buffer *parent, int slot) | |
bb803951 | 578 | { |
bb803951 CM |
579 | if (slot < 0) |
580 | return NULL; | |
5f39d397 | 581 | if (slot >= btrfs_header_nritems(parent)) |
bb803951 | 582 | return NULL; |
db94535d CM |
583 | return read_tree_block(root, btrfs_node_blockptr(parent, slot), |
584 | btrfs_level_size(root, btrfs_header_level(parent) - 1)); | |
bb803951 CM |
585 | } |
586 | ||
e089f05c CM |
587 | static int balance_level(struct btrfs_trans_handle *trans, struct btrfs_root |
588 | *root, struct btrfs_path *path, int level) | |
bb803951 | 589 | { |
5f39d397 CM |
590 | struct extent_buffer *right = NULL; |
591 | struct extent_buffer *mid; | |
592 | struct extent_buffer *left = NULL; | |
593 | struct extent_buffer *parent = NULL; | |
bb803951 CM |
594 | int ret = 0; |
595 | int wret; | |
596 | int pslot; | |
bb803951 | 597 | int orig_slot = path->slots[level]; |
54aa1f4d | 598 | int err_on_enospc = 0; |
79f95c82 | 599 | u64 orig_ptr; |
bb803951 CM |
600 | |
601 | if (level == 0) | |
602 | return 0; | |
603 | ||
5f39d397 | 604 | mid = path->nodes[level]; |
1d4f8a0c | 605 | orig_ptr = btrfs_node_blockptr(mid, orig_slot); |
79f95c82 | 606 | |
234b63a0 | 607 | if (level < BTRFS_MAX_LEVEL - 1) |
5f39d397 | 608 | parent = path->nodes[level + 1]; |
bb803951 CM |
609 | pslot = path->slots[level + 1]; |
610 | ||
40689478 CM |
611 | /* |
612 | * deal with the case where there is only one pointer in the root | |
613 | * by promoting the node below to a root | |
614 | */ | |
5f39d397 CM |
615 | if (!parent) { |
616 | struct extent_buffer *child; | |
bb803951 | 617 | |
5f39d397 | 618 | if (btrfs_header_nritems(mid) != 1) |
bb803951 CM |
619 | return 0; |
620 | ||
621 | /* promote the child to a root */ | |
5f39d397 | 622 | child = read_node_slot(root, mid, 0); |
bb803951 CM |
623 | BUG_ON(!child); |
624 | root->node = child; | |
625 | path->nodes[level] = NULL; | |
5f39d397 CM |
626 | clean_tree_block(trans, root, mid); |
627 | wait_on_tree_block_writeback(root, mid); | |
bb803951 | 628 | /* once for the path */ |
5f39d397 | 629 | free_extent_buffer(mid); |
db94535d | 630 | ret = btrfs_free_extent(trans, root, mid->start, mid->len, 1); |
bb803951 | 631 | /* once for the root ptr */ |
5f39d397 | 632 | free_extent_buffer(mid); |
db94535d | 633 | return ret; |
bb803951 | 634 | } |
5f39d397 | 635 | if (btrfs_header_nritems(mid) > |
123abc88 | 636 | BTRFS_NODEPTRS_PER_BLOCK(root) / 4) |
bb803951 CM |
637 | return 0; |
638 | ||
5f39d397 | 639 | if (btrfs_header_nritems(mid) < 2) |
54aa1f4d CM |
640 | err_on_enospc = 1; |
641 | ||
5f39d397 CM |
642 | left = read_node_slot(root, parent, pslot - 1); |
643 | if (left) { | |
644 | wret = btrfs_cow_block(trans, root, left, | |
645 | parent, pslot - 1, &left); | |
54aa1f4d CM |
646 | if (wret) { |
647 | ret = wret; | |
648 | goto enospc; | |
649 | } | |
2cc58cf2 | 650 | } |
5f39d397 CM |
651 | right = read_node_slot(root, parent, pslot + 1); |
652 | if (right) { | |
653 | wret = btrfs_cow_block(trans, root, right, | |
654 | parent, pslot + 1, &right); | |
2cc58cf2 CM |
655 | if (wret) { |
656 | ret = wret; | |
657 | goto enospc; | |
658 | } | |
659 | } | |
660 | ||
661 | /* first, try to make some room in the middle buffer */ | |
5f39d397 CM |
662 | if (left) { |
663 | orig_slot += btrfs_header_nritems(left); | |
664 | wret = push_node_left(trans, root, left, mid); | |
79f95c82 CM |
665 | if (wret < 0) |
666 | ret = wret; | |
5f39d397 | 667 | if (btrfs_header_nritems(mid) < 2) |
54aa1f4d | 668 | err_on_enospc = 1; |
bb803951 | 669 | } |
79f95c82 CM |
670 | |
671 | /* | |
672 | * then try to empty the right most buffer into the middle | |
673 | */ | |
5f39d397 CM |
674 | if (right) { |
675 | wret = push_node_left(trans, root, mid, right); | |
54aa1f4d | 676 | if (wret < 0 && wret != -ENOSPC) |
79f95c82 | 677 | ret = wret; |
5f39d397 | 678 | if (btrfs_header_nritems(right) == 0) { |
db94535d CM |
679 | u64 bytenr = right->start; |
680 | u32 blocksize = right->len; | |
681 | ||
5f39d397 CM |
682 | clean_tree_block(trans, root, right); |
683 | wait_on_tree_block_writeback(root, right); | |
684 | free_extent_buffer(right); | |
bb803951 | 685 | right = NULL; |
e089f05c CM |
686 | wret = del_ptr(trans, root, path, level + 1, pslot + |
687 | 1); | |
bb803951 CM |
688 | if (wret) |
689 | ret = wret; | |
db94535d CM |
690 | wret = btrfs_free_extent(trans, root, bytenr, |
691 | blocksize, 1); | |
bb803951 CM |
692 | if (wret) |
693 | ret = wret; | |
694 | } else { | |
5f39d397 CM |
695 | struct btrfs_disk_key right_key; |
696 | btrfs_node_key(right, &right_key, 0); | |
697 | btrfs_set_node_key(parent, &right_key, pslot + 1); | |
698 | btrfs_mark_buffer_dirty(parent); | |
bb803951 CM |
699 | } |
700 | } | |
5f39d397 | 701 | if (btrfs_header_nritems(mid) == 1) { |
79f95c82 CM |
702 | /* |
703 | * we're not allowed to leave a node with one item in the | |
704 | * tree during a delete. A deletion from lower in the tree | |
705 | * could try to delete the only pointer in this node. | |
706 | * So, pull some keys from the left. | |
707 | * There has to be a left pointer at this point because | |
708 | * otherwise we would have pulled some pointers from the | |
709 | * right | |
710 | */ | |
5f39d397 CM |
711 | BUG_ON(!left); |
712 | wret = balance_node_right(trans, root, mid, left); | |
54aa1f4d | 713 | if (wret < 0) { |
79f95c82 | 714 | ret = wret; |
54aa1f4d CM |
715 | goto enospc; |
716 | } | |
79f95c82 CM |
717 | BUG_ON(wret == 1); |
718 | } | |
5f39d397 | 719 | if (btrfs_header_nritems(mid) == 0) { |
79f95c82 | 720 | /* we've managed to empty the middle node, drop it */ |
db94535d CM |
721 | u64 bytenr = mid->start; |
722 | u32 blocksize = mid->len; | |
5f39d397 CM |
723 | clean_tree_block(trans, root, mid); |
724 | wait_on_tree_block_writeback(root, mid); | |
725 | free_extent_buffer(mid); | |
bb803951 | 726 | mid = NULL; |
e089f05c | 727 | wret = del_ptr(trans, root, path, level + 1, pslot); |
bb803951 CM |
728 | if (wret) |
729 | ret = wret; | |
db94535d | 730 | wret = btrfs_free_extent(trans, root, bytenr, blocksize, 1); |
bb803951 CM |
731 | if (wret) |
732 | ret = wret; | |
79f95c82 CM |
733 | } else { |
734 | /* update the parent key to reflect our changes */ | |
5f39d397 CM |
735 | struct btrfs_disk_key mid_key; |
736 | btrfs_node_key(mid, &mid_key, 0); | |
737 | btrfs_set_node_key(parent, &mid_key, pslot); | |
738 | btrfs_mark_buffer_dirty(parent); | |
79f95c82 | 739 | } |
bb803951 | 740 | |
79f95c82 | 741 | /* update the path */ |
5f39d397 CM |
742 | if (left) { |
743 | if (btrfs_header_nritems(left) > orig_slot) { | |
744 | extent_buffer_get(left); | |
745 | path->nodes[level] = left; | |
bb803951 CM |
746 | path->slots[level + 1] -= 1; |
747 | path->slots[level] = orig_slot; | |
5f39d397 CM |
748 | if (mid) |
749 | free_extent_buffer(mid); | |
bb803951 | 750 | } else { |
5f39d397 | 751 | orig_slot -= btrfs_header_nritems(left); |
bb803951 CM |
752 | path->slots[level] = orig_slot; |
753 | } | |
754 | } | |
79f95c82 | 755 | /* double check we haven't messed things up */ |
123abc88 | 756 | check_block(root, path, level); |
e20d96d6 | 757 | if (orig_ptr != |
5f39d397 | 758 | btrfs_node_blockptr(path->nodes[level], path->slots[level])) |
79f95c82 | 759 | BUG(); |
54aa1f4d | 760 | enospc: |
5f39d397 CM |
761 | if (right) |
762 | free_extent_buffer(right); | |
763 | if (left) | |
764 | free_extent_buffer(left); | |
bb803951 CM |
765 | return ret; |
766 | } | |
767 | ||
e66f709b CM |
768 | /* returns zero if the push worked, non-zero otherwise */ |
769 | static int push_nodes_for_insert(struct btrfs_trans_handle *trans, | |
770 | struct btrfs_root *root, | |
771 | struct btrfs_path *path, int level) | |
772 | { | |
5f39d397 CM |
773 | struct extent_buffer *right = NULL; |
774 | struct extent_buffer *mid; | |
775 | struct extent_buffer *left = NULL; | |
776 | struct extent_buffer *parent = NULL; | |
e66f709b CM |
777 | int ret = 0; |
778 | int wret; | |
779 | int pslot; | |
780 | int orig_slot = path->slots[level]; | |
781 | u64 orig_ptr; | |
782 | ||
783 | if (level == 0) | |
784 | return 1; | |
785 | ||
5f39d397 | 786 | mid = path->nodes[level]; |
e66f709b CM |
787 | orig_ptr = btrfs_node_blockptr(mid, orig_slot); |
788 | ||
789 | if (level < BTRFS_MAX_LEVEL - 1) | |
5f39d397 | 790 | parent = path->nodes[level + 1]; |
e66f709b CM |
791 | pslot = path->slots[level + 1]; |
792 | ||
5f39d397 | 793 | if (!parent) |
e66f709b | 794 | return 1; |
e66f709b | 795 | |
5f39d397 | 796 | left = read_node_slot(root, parent, pslot - 1); |
e66f709b CM |
797 | |
798 | /* first, try to make some room in the middle buffer */ | |
5f39d397 | 799 | if (left) { |
e66f709b | 800 | u32 left_nr; |
5f39d397 | 801 | left_nr = btrfs_header_nritems(left); |
33ade1f8 CM |
802 | if (left_nr >= BTRFS_NODEPTRS_PER_BLOCK(root) - 1) { |
803 | wret = 1; | |
804 | } else { | |
5f39d397 CM |
805 | ret = btrfs_cow_block(trans, root, left, parent, |
806 | pslot - 1, &left); | |
54aa1f4d CM |
807 | if (ret) |
808 | wret = 1; | |
809 | else { | |
54aa1f4d | 810 | wret = push_node_left(trans, root, |
5f39d397 | 811 | left, mid); |
54aa1f4d | 812 | } |
33ade1f8 | 813 | } |
e66f709b CM |
814 | if (wret < 0) |
815 | ret = wret; | |
816 | if (wret == 0) { | |
5f39d397 | 817 | struct btrfs_disk_key disk_key; |
e66f709b | 818 | orig_slot += left_nr; |
5f39d397 CM |
819 | btrfs_node_key(mid, &disk_key, 0); |
820 | btrfs_set_node_key(parent, &disk_key, pslot); | |
821 | btrfs_mark_buffer_dirty(parent); | |
822 | if (btrfs_header_nritems(left) > orig_slot) { | |
823 | path->nodes[level] = left; | |
e66f709b CM |
824 | path->slots[level + 1] -= 1; |
825 | path->slots[level] = orig_slot; | |
5f39d397 | 826 | free_extent_buffer(mid); |
e66f709b CM |
827 | } else { |
828 | orig_slot -= | |
5f39d397 | 829 | btrfs_header_nritems(left); |
e66f709b | 830 | path->slots[level] = orig_slot; |
5f39d397 | 831 | free_extent_buffer(left); |
e66f709b | 832 | } |
e66f709b CM |
833 | return 0; |
834 | } | |
5f39d397 | 835 | free_extent_buffer(left); |
e66f709b | 836 | } |
5f39d397 | 837 | right= read_node_slot(root, parent, pslot + 1); |
e66f709b CM |
838 | |
839 | /* | |
840 | * then try to empty the right most buffer into the middle | |
841 | */ | |
5f39d397 | 842 | if (right) { |
33ade1f8 | 843 | u32 right_nr; |
5f39d397 | 844 | right_nr = btrfs_header_nritems(right); |
33ade1f8 CM |
845 | if (right_nr >= BTRFS_NODEPTRS_PER_BLOCK(root) - 1) { |
846 | wret = 1; | |
847 | } else { | |
5f39d397 CM |
848 | ret = btrfs_cow_block(trans, root, right, |
849 | parent, pslot + 1, | |
850 | &right); | |
54aa1f4d CM |
851 | if (ret) |
852 | wret = 1; | |
853 | else { | |
54aa1f4d | 854 | wret = balance_node_right(trans, root, |
5f39d397 | 855 | right, mid); |
54aa1f4d | 856 | } |
33ade1f8 | 857 | } |
e66f709b CM |
858 | if (wret < 0) |
859 | ret = wret; | |
860 | if (wret == 0) { | |
5f39d397 CM |
861 | struct btrfs_disk_key disk_key; |
862 | ||
863 | btrfs_node_key(right, &disk_key, 0); | |
864 | btrfs_set_node_key(parent, &disk_key, pslot + 1); | |
865 | btrfs_mark_buffer_dirty(parent); | |
866 | ||
867 | if (btrfs_header_nritems(mid) <= orig_slot) { | |
868 | path->nodes[level] = right; | |
e66f709b CM |
869 | path->slots[level + 1] += 1; |
870 | path->slots[level] = orig_slot - | |
5f39d397 CM |
871 | btrfs_header_nritems(mid); |
872 | free_extent_buffer(mid); | |
e66f709b | 873 | } else { |
5f39d397 | 874 | free_extent_buffer(right); |
e66f709b | 875 | } |
e66f709b CM |
876 | return 0; |
877 | } | |
5f39d397 | 878 | free_extent_buffer(right); |
e66f709b | 879 | } |
e66f709b CM |
880 | return 1; |
881 | } | |
882 | ||
3c69faec CM |
883 | /* |
884 | * readahead one full node of leaves | |
885 | */ | |
886 | static void reada_for_search(struct btrfs_root *root, struct btrfs_path *path, | |
6702ed49 | 887 | int level, int slot) |
3c69faec | 888 | { |
5f39d397 | 889 | struct extent_buffer *node; |
3c69faec | 890 | u32 nritems; |
3c69faec | 891 | u64 search; |
6b80053d CM |
892 | u64 lowest_read; |
893 | u64 highest_read; | |
894 | u64 nread = 0; | |
3c69faec | 895 | int direction = path->reada; |
5f39d397 | 896 | struct extent_buffer *eb; |
6b80053d CM |
897 | u32 nr; |
898 | u32 blocksize; | |
899 | u32 nscan = 0; | |
db94535d | 900 | |
6702ed49 CM |
901 | if (level == 0) |
902 | return; | |
903 | ||
904 | if (!path->nodes[level]) | |
3c69faec CM |
905 | return; |
906 | ||
5f39d397 | 907 | node = path->nodes[level]; |
3c69faec | 908 | search = btrfs_node_blockptr(node, slot); |
6b80053d CM |
909 | blocksize = btrfs_level_size(root, level - 1); |
910 | eb = btrfs_find_tree_block(root, search, blocksize); | |
5f39d397 CM |
911 | if (eb) { |
912 | free_extent_buffer(eb); | |
3c69faec CM |
913 | return; |
914 | } | |
915 | ||
6b80053d CM |
916 | highest_read = search; |
917 | lowest_read = search; | |
918 | ||
5f39d397 | 919 | nritems = btrfs_header_nritems(node); |
6b80053d | 920 | nr = slot; |
3c69faec | 921 | while(1) { |
6b80053d CM |
922 | if (direction < 0) { |
923 | if (nr == 0) | |
924 | break; | |
925 | nr--; | |
926 | } else if (direction > 0) { | |
927 | nr++; | |
928 | if (nr >= nritems) | |
929 | break; | |
3c69faec | 930 | } |
6b80053d CM |
931 | search = btrfs_node_blockptr(node, nr); |
932 | if ((search >= lowest_read && search <= highest_read) || | |
933 | (search < lowest_read && lowest_read - search <= 32768) || | |
934 | (search > highest_read && search - highest_read <= 32768)) { | |
935 | readahead_tree_block(root, search, blocksize); | |
936 | nread += blocksize; | |
937 | } | |
938 | nscan++; | |
939 | if (path->reada < 2 && (nread > (256 * 1024) || nscan > 32)) | |
940 | break; | |
941 | if(nread > (1024 * 1024) || nscan > 128) | |
942 | break; | |
943 | ||
944 | if (search < lowest_read) | |
945 | lowest_read = search; | |
946 | if (search > highest_read) | |
947 | highest_read = search; | |
3c69faec CM |
948 | } |
949 | } | |
74123bd7 CM |
950 | /* |
951 | * look for key in the tree. path is filled in with nodes along the way | |
952 | * if key is found, we return zero and you can find the item in the leaf | |
953 | * level of the path (level 0) | |
954 | * | |
955 | * If the key isn't found, the path points to the slot where it should | |
aa5d6bed CM |
956 | * be inserted, and 1 is returned. If there are other errors during the |
957 | * search a negative error number is returned. | |
97571fd0 CM |
958 | * |
959 | * if ins_len > 0, nodes and leaves will be split as we walk down the | |
960 | * tree. if ins_len < 0, nodes will be merged as we walk down the tree (if | |
961 | * possible) | |
74123bd7 | 962 | */ |
e089f05c CM |
963 | int btrfs_search_slot(struct btrfs_trans_handle *trans, struct btrfs_root |
964 | *root, struct btrfs_key *key, struct btrfs_path *p, int | |
965 | ins_len, int cow) | |
be0e5c09 | 966 | { |
5f39d397 | 967 | struct extent_buffer *b; |
db94535d | 968 | u64 bytenr; |
be0e5c09 CM |
969 | int slot; |
970 | int ret; | |
971 | int level; | |
3c69faec | 972 | int should_reada = p->reada; |
9f3a7427 CM |
973 | u8 lowest_level = 0; |
974 | ||
6702ed49 CM |
975 | lowest_level = p->lowest_level; |
976 | WARN_ON(lowest_level && ins_len); | |
22b0ebda CM |
977 | WARN_ON(p->nodes[0] != NULL); |
978 | WARN_ON(!mutex_is_locked(&root->fs_info->fs_mutex)); | |
bb803951 CM |
979 | again: |
980 | b = root->node; | |
5f39d397 | 981 | extent_buffer_get(b); |
eb60ceac | 982 | while (b) { |
5f39d397 | 983 | level = btrfs_header_level(b); |
02217ed2 CM |
984 | if (cow) { |
985 | int wret; | |
e20d96d6 CM |
986 | wret = btrfs_cow_block(trans, root, b, |
987 | p->nodes[level + 1], | |
988 | p->slots[level + 1], | |
252c38f0 | 989 | &b); |
54aa1f4d | 990 | if (wret) { |
5f39d397 | 991 | free_extent_buffer(b); |
54aa1f4d CM |
992 | return wret; |
993 | } | |
02217ed2 CM |
994 | } |
995 | BUG_ON(!cow && ins_len); | |
5f39d397 | 996 | if (level != btrfs_header_level(b)) |
2c90e5d6 | 997 | WARN_ON(1); |
5f39d397 | 998 | level = btrfs_header_level(b); |
eb60ceac | 999 | p->nodes[level] = b; |
123abc88 | 1000 | ret = check_block(root, p, level); |
aa5d6bed CM |
1001 | if (ret) |
1002 | return -1; | |
5f39d397 CM |
1003 | ret = bin_search(b, key, level, &slot); |
1004 | if (level != 0) { | |
be0e5c09 CM |
1005 | if (ret && slot > 0) |
1006 | slot -= 1; | |
1007 | p->slots[level] = slot; | |
5f39d397 | 1008 | if (ins_len > 0 && btrfs_header_nritems(b) >= |
d4dbff95 | 1009 | BTRFS_NODEPTRS_PER_BLOCK(root) - 1) { |
e089f05c | 1010 | int sret = split_node(trans, root, p, level); |
5c680ed6 CM |
1011 | BUG_ON(sret > 0); |
1012 | if (sret) | |
1013 | return sret; | |
1014 | b = p->nodes[level]; | |
5c680ed6 | 1015 | slot = p->slots[level]; |
bb803951 | 1016 | } else if (ins_len < 0) { |
e089f05c CM |
1017 | int sret = balance_level(trans, root, p, |
1018 | level); | |
bb803951 CM |
1019 | if (sret) |
1020 | return sret; | |
1021 | b = p->nodes[level]; | |
f510cfec CM |
1022 | if (!b) { |
1023 | btrfs_release_path(NULL, p); | |
bb803951 | 1024 | goto again; |
f510cfec | 1025 | } |
bb803951 | 1026 | slot = p->slots[level]; |
5f39d397 | 1027 | BUG_ON(btrfs_header_nritems(b) == 1); |
5c680ed6 | 1028 | } |
9f3a7427 CM |
1029 | /* this is only true while dropping a snapshot */ |
1030 | if (level == lowest_level) | |
1031 | break; | |
db94535d | 1032 | bytenr = btrfs_node_blockptr(b, slot); |
6702ed49 CM |
1033 | if (should_reada) |
1034 | reada_for_search(root, p, level, slot); | |
db94535d CM |
1035 | b = read_tree_block(root, bytenr, |
1036 | btrfs_level_size(root, level - 1)); | |
be0e5c09 CM |
1037 | } else { |
1038 | p->slots[level] = slot; | |
5f39d397 | 1039 | if (ins_len > 0 && btrfs_leaf_free_space(root, b) < |
0783fcfc | 1040 | sizeof(struct btrfs_item) + ins_len) { |
d4dbff95 CM |
1041 | int sret = split_leaf(trans, root, key, |
1042 | p, ins_len); | |
5c680ed6 CM |
1043 | BUG_ON(sret > 0); |
1044 | if (sret) | |
1045 | return sret; | |
1046 | } | |
be0e5c09 CM |
1047 | return ret; |
1048 | } | |
1049 | } | |
aa5d6bed | 1050 | return 1; |
be0e5c09 CM |
1051 | } |
1052 | ||
74123bd7 CM |
1053 | /* |
1054 | * adjust the pointers going up the tree, starting at level | |
1055 | * making sure the right key of each node is points to 'key'. | |
1056 | * This is used after shifting pointers to the left, so it stops | |
1057 | * fixing up pointers when a given leaf/node is not in slot 0 of the | |
1058 | * higher levels | |
aa5d6bed CM |
1059 | * |
1060 | * If this fails to write a tree block, it returns -1, but continues | |
1061 | * fixing up the blocks in ram so the tree is consistent. | |
74123bd7 | 1062 | */ |
5f39d397 CM |
1063 | static int fixup_low_keys(struct btrfs_trans_handle *trans, |
1064 | struct btrfs_root *root, struct btrfs_path *path, | |
1065 | struct btrfs_disk_key *key, int level) | |
be0e5c09 CM |
1066 | { |
1067 | int i; | |
aa5d6bed | 1068 | int ret = 0; |
5f39d397 CM |
1069 | struct extent_buffer *t; |
1070 | ||
234b63a0 | 1071 | for (i = level; i < BTRFS_MAX_LEVEL; i++) { |
be0e5c09 | 1072 | int tslot = path->slots[i]; |
eb60ceac | 1073 | if (!path->nodes[i]) |
be0e5c09 | 1074 | break; |
5f39d397 CM |
1075 | t = path->nodes[i]; |
1076 | btrfs_set_node_key(t, key, tslot); | |
d6025579 | 1077 | btrfs_mark_buffer_dirty(path->nodes[i]); |
be0e5c09 CM |
1078 | if (tslot != 0) |
1079 | break; | |
1080 | } | |
aa5d6bed | 1081 | return ret; |
be0e5c09 CM |
1082 | } |
1083 | ||
74123bd7 CM |
1084 | /* |
1085 | * try to push data from one node into the next node left in the | |
79f95c82 | 1086 | * tree. |
aa5d6bed CM |
1087 | * |
1088 | * returns 0 if some ptrs were pushed left, < 0 if there was some horrible | |
1089 | * error, and > 0 if there was no room in the left hand block. | |
74123bd7 | 1090 | */ |
e089f05c | 1091 | static int push_node_left(struct btrfs_trans_handle *trans, struct btrfs_root |
5f39d397 CM |
1092 | *root, struct extent_buffer *dst, |
1093 | struct extent_buffer *src) | |
be0e5c09 | 1094 | { |
be0e5c09 | 1095 | int push_items = 0; |
bb803951 CM |
1096 | int src_nritems; |
1097 | int dst_nritems; | |
aa5d6bed | 1098 | int ret = 0; |
be0e5c09 | 1099 | |
5f39d397 CM |
1100 | src_nritems = btrfs_header_nritems(src); |
1101 | dst_nritems = btrfs_header_nritems(dst); | |
123abc88 | 1102 | push_items = BTRFS_NODEPTRS_PER_BLOCK(root) - dst_nritems; |
54aa1f4d | 1103 | |
eb60ceac | 1104 | if (push_items <= 0) { |
be0e5c09 | 1105 | return 1; |
eb60ceac | 1106 | } |
be0e5c09 | 1107 | |
bb803951 | 1108 | if (src_nritems < push_items) |
79f95c82 CM |
1109 | push_items = src_nritems; |
1110 | ||
5f39d397 CM |
1111 | copy_extent_buffer(dst, src, |
1112 | btrfs_node_key_ptr_offset(dst_nritems), | |
1113 | btrfs_node_key_ptr_offset(0), | |
1114 | push_items * sizeof(struct btrfs_key_ptr)); | |
1115 | ||
bb803951 | 1116 | if (push_items < src_nritems) { |
5f39d397 CM |
1117 | memmove_extent_buffer(src, btrfs_node_key_ptr_offset(0), |
1118 | btrfs_node_key_ptr_offset(push_items), | |
1119 | (src_nritems - push_items) * | |
1120 | sizeof(struct btrfs_key_ptr)); | |
1121 | } | |
1122 | btrfs_set_header_nritems(src, src_nritems - push_items); | |
1123 | btrfs_set_header_nritems(dst, dst_nritems + push_items); | |
1124 | btrfs_mark_buffer_dirty(src); | |
1125 | btrfs_mark_buffer_dirty(dst); | |
79f95c82 CM |
1126 | return ret; |
1127 | } | |
1128 | ||
1129 | /* | |
1130 | * try to push data from one node into the next node right in the | |
1131 | * tree. | |
1132 | * | |
1133 | * returns 0 if some ptrs were pushed, < 0 if there was some horrible | |
1134 | * error, and > 0 if there was no room in the right hand block. | |
1135 | * | |
1136 | * this will only push up to 1/2 the contents of the left node over | |
1137 | */ | |
5f39d397 CM |
1138 | static int balance_node_right(struct btrfs_trans_handle *trans, |
1139 | struct btrfs_root *root, | |
1140 | struct extent_buffer *dst, | |
1141 | struct extent_buffer *src) | |
79f95c82 | 1142 | { |
79f95c82 CM |
1143 | int push_items = 0; |
1144 | int max_push; | |
1145 | int src_nritems; | |
1146 | int dst_nritems; | |
1147 | int ret = 0; | |
79f95c82 | 1148 | |
5f39d397 CM |
1149 | src_nritems = btrfs_header_nritems(src); |
1150 | dst_nritems = btrfs_header_nritems(dst); | |
123abc88 | 1151 | push_items = BTRFS_NODEPTRS_PER_BLOCK(root) - dst_nritems; |
5f39d397 | 1152 | if (push_items <= 0) |
79f95c82 | 1153 | return 1; |
79f95c82 CM |
1154 | |
1155 | max_push = src_nritems / 2 + 1; | |
1156 | /* don't try to empty the node */ | |
252c38f0 | 1157 | if (max_push >= src_nritems) |
79f95c82 | 1158 | return 1; |
252c38f0 | 1159 | |
79f95c82 CM |
1160 | if (max_push < push_items) |
1161 | push_items = max_push; | |
1162 | ||
5f39d397 CM |
1163 | memmove_extent_buffer(dst, btrfs_node_key_ptr_offset(push_items), |
1164 | btrfs_node_key_ptr_offset(0), | |
1165 | (dst_nritems) * | |
1166 | sizeof(struct btrfs_key_ptr)); | |
d6025579 | 1167 | |
5f39d397 CM |
1168 | copy_extent_buffer(dst, src, |
1169 | btrfs_node_key_ptr_offset(0), | |
1170 | btrfs_node_key_ptr_offset(src_nritems - push_items), | |
1171 | push_items * sizeof(struct btrfs_key_ptr)); | |
79f95c82 | 1172 | |
5f39d397 CM |
1173 | btrfs_set_header_nritems(src, src_nritems - push_items); |
1174 | btrfs_set_header_nritems(dst, dst_nritems + push_items); | |
79f95c82 | 1175 | |
5f39d397 CM |
1176 | btrfs_mark_buffer_dirty(src); |
1177 | btrfs_mark_buffer_dirty(dst); | |
aa5d6bed | 1178 | return ret; |
be0e5c09 CM |
1179 | } |
1180 | ||
97571fd0 CM |
1181 | /* |
1182 | * helper function to insert a new root level in the tree. | |
1183 | * A new node is allocated, and a single item is inserted to | |
1184 | * point to the existing root | |
aa5d6bed CM |
1185 | * |
1186 | * returns zero on success or < 0 on failure. | |
97571fd0 | 1187 | */ |
5f39d397 CM |
1188 | static int insert_new_root(struct btrfs_trans_handle *trans, |
1189 | struct btrfs_root *root, | |
1190 | struct btrfs_path *path, int level) | |
5c680ed6 | 1191 | { |
5f39d397 CM |
1192 | struct extent_buffer *lower; |
1193 | struct extent_buffer *c; | |
1194 | struct btrfs_disk_key lower_key; | |
5c680ed6 CM |
1195 | |
1196 | BUG_ON(path->nodes[level]); | |
1197 | BUG_ON(path->nodes[level-1] != root->node); | |
1198 | ||
db94535d CM |
1199 | c = btrfs_alloc_free_block(trans, root, root->nodesize, |
1200 | root->node->start, 0); | |
5f39d397 CM |
1201 | if (IS_ERR(c)) |
1202 | return PTR_ERR(c); | |
1203 | memset_extent_buffer(c, 0, 0, root->nodesize); | |
1204 | btrfs_set_header_nritems(c, 1); | |
1205 | btrfs_set_header_level(c, level); | |
db94535d | 1206 | btrfs_set_header_bytenr(c, c->start); |
5f39d397 CM |
1207 | btrfs_set_header_generation(c, trans->transid); |
1208 | btrfs_set_header_owner(c, root->root_key.objectid); | |
1209 | lower = path->nodes[level-1]; | |
1210 | ||
1211 | write_extent_buffer(c, root->fs_info->fsid, | |
1212 | (unsigned long)btrfs_header_fsid(c), | |
1213 | BTRFS_FSID_SIZE); | |
1214 | if (level == 1) | |
1215 | btrfs_item_key(lower, &lower_key, 0); | |
5c680ed6 | 1216 | else |
5f39d397 CM |
1217 | btrfs_node_key(lower, &lower_key, 0); |
1218 | btrfs_set_node_key(c, &lower_key, 0); | |
db94535d | 1219 | btrfs_set_node_blockptr(c, 0, lower->start); |
d5719762 | 1220 | |
5f39d397 | 1221 | btrfs_mark_buffer_dirty(c); |
d5719762 | 1222 | |
5c680ed6 | 1223 | /* the super has an extra ref to root->node */ |
5f39d397 CM |
1224 | free_extent_buffer(root->node); |
1225 | root->node = c; | |
1226 | extent_buffer_get(c); | |
1227 | path->nodes[level] = c; | |
5c680ed6 CM |
1228 | path->slots[level] = 0; |
1229 | return 0; | |
1230 | } | |
1231 | ||
74123bd7 CM |
1232 | /* |
1233 | * worker function to insert a single pointer in a node. | |
1234 | * the node should have enough room for the pointer already | |
97571fd0 | 1235 | * |
74123bd7 CM |
1236 | * slot and level indicate where you want the key to go, and |
1237 | * blocknr is the block the key points to. | |
aa5d6bed CM |
1238 | * |
1239 | * returns zero on success and < 0 on any error | |
74123bd7 | 1240 | */ |
e089f05c CM |
1241 | static int insert_ptr(struct btrfs_trans_handle *trans, struct btrfs_root |
1242 | *root, struct btrfs_path *path, struct btrfs_disk_key | |
db94535d | 1243 | *key, u64 bytenr, int slot, int level) |
74123bd7 | 1244 | { |
5f39d397 | 1245 | struct extent_buffer *lower; |
74123bd7 | 1246 | int nritems; |
5c680ed6 CM |
1247 | |
1248 | BUG_ON(!path->nodes[level]); | |
5f39d397 CM |
1249 | lower = path->nodes[level]; |
1250 | nritems = btrfs_header_nritems(lower); | |
74123bd7 CM |
1251 | if (slot > nritems) |
1252 | BUG(); | |
123abc88 | 1253 | if (nritems == BTRFS_NODEPTRS_PER_BLOCK(root)) |
74123bd7 CM |
1254 | BUG(); |
1255 | if (slot != nritems) { | |
5f39d397 CM |
1256 | memmove_extent_buffer(lower, |
1257 | btrfs_node_key_ptr_offset(slot + 1), | |
1258 | btrfs_node_key_ptr_offset(slot), | |
d6025579 | 1259 | (nritems - slot) * sizeof(struct btrfs_key_ptr)); |
74123bd7 | 1260 | } |
5f39d397 | 1261 | btrfs_set_node_key(lower, key, slot); |
db94535d | 1262 | btrfs_set_node_blockptr(lower, slot, bytenr); |
5f39d397 CM |
1263 | btrfs_set_header_nritems(lower, nritems + 1); |
1264 | btrfs_mark_buffer_dirty(lower); | |
74123bd7 CM |
1265 | return 0; |
1266 | } | |
1267 | ||
97571fd0 CM |
1268 | /* |
1269 | * split the node at the specified level in path in two. | |
1270 | * The path is corrected to point to the appropriate node after the split | |
1271 | * | |
1272 | * Before splitting this tries to make some room in the node by pushing | |
1273 | * left and right, if either one works, it returns right away. | |
aa5d6bed CM |
1274 | * |
1275 | * returns 0 on success and < 0 on failure | |
97571fd0 | 1276 | */ |
e089f05c CM |
1277 | static int split_node(struct btrfs_trans_handle *trans, struct btrfs_root |
1278 | *root, struct btrfs_path *path, int level) | |
be0e5c09 | 1279 | { |
5f39d397 CM |
1280 | struct extent_buffer *c; |
1281 | struct extent_buffer *split; | |
1282 | struct btrfs_disk_key disk_key; | |
be0e5c09 | 1283 | int mid; |
5c680ed6 | 1284 | int ret; |
aa5d6bed | 1285 | int wret; |
7518a238 | 1286 | u32 c_nritems; |
eb60ceac | 1287 | |
5f39d397 CM |
1288 | c = path->nodes[level]; |
1289 | if (c == root->node) { | |
5c680ed6 | 1290 | /* trying to split the root, lets make a new one */ |
e089f05c | 1291 | ret = insert_new_root(trans, root, path, level + 1); |
5c680ed6 CM |
1292 | if (ret) |
1293 | return ret; | |
e66f709b CM |
1294 | } else { |
1295 | ret = push_nodes_for_insert(trans, root, path, level); | |
5f39d397 CM |
1296 | c = path->nodes[level]; |
1297 | if (!ret && btrfs_header_nritems(c) < | |
e66f709b CM |
1298 | BTRFS_NODEPTRS_PER_BLOCK(root) - 1) |
1299 | return 0; | |
54aa1f4d CM |
1300 | if (ret < 0) |
1301 | return ret; | |
be0e5c09 | 1302 | } |
e66f709b | 1303 | |
5f39d397 | 1304 | c_nritems = btrfs_header_nritems(c); |
db94535d CM |
1305 | split = btrfs_alloc_free_block(trans, root, root->nodesize, |
1306 | c->start, 0); | |
5f39d397 CM |
1307 | if (IS_ERR(split)) |
1308 | return PTR_ERR(split); | |
1309 | ||
1310 | btrfs_set_header_flags(split, btrfs_header_flags(c)); | |
1311 | btrfs_set_header_level(split, btrfs_header_level(c)); | |
db94535d | 1312 | btrfs_set_header_bytenr(split, split->start); |
5f39d397 CM |
1313 | btrfs_set_header_generation(split, trans->transid); |
1314 | btrfs_set_header_owner(split, root->root_key.objectid); | |
1315 | write_extent_buffer(split, root->fs_info->fsid, | |
1316 | (unsigned long)btrfs_header_fsid(split), | |
1317 | BTRFS_FSID_SIZE); | |
54aa1f4d | 1318 | |
7518a238 | 1319 | mid = (c_nritems + 1) / 2; |
5f39d397 CM |
1320 | |
1321 | copy_extent_buffer(split, c, | |
1322 | btrfs_node_key_ptr_offset(0), | |
1323 | btrfs_node_key_ptr_offset(mid), | |
1324 | (c_nritems - mid) * sizeof(struct btrfs_key_ptr)); | |
1325 | btrfs_set_header_nritems(split, c_nritems - mid); | |
1326 | btrfs_set_header_nritems(c, mid); | |
aa5d6bed CM |
1327 | ret = 0; |
1328 | ||
5f39d397 CM |
1329 | btrfs_mark_buffer_dirty(c); |
1330 | btrfs_mark_buffer_dirty(split); | |
1331 | ||
1332 | btrfs_node_key(split, &disk_key, 0); | |
db94535d | 1333 | wret = insert_ptr(trans, root, path, &disk_key, split->start, |
5f39d397 | 1334 | path->slots[level + 1] + 1, |
123abc88 | 1335 | level + 1); |
aa5d6bed CM |
1336 | if (wret) |
1337 | ret = wret; | |
1338 | ||
5de08d7d | 1339 | if (path->slots[level] >= mid) { |
5c680ed6 | 1340 | path->slots[level] -= mid; |
5f39d397 CM |
1341 | free_extent_buffer(c); |
1342 | path->nodes[level] = split; | |
5c680ed6 CM |
1343 | path->slots[level + 1] += 1; |
1344 | } else { | |
5f39d397 | 1345 | free_extent_buffer(split); |
be0e5c09 | 1346 | } |
aa5d6bed | 1347 | return ret; |
be0e5c09 CM |
1348 | } |
1349 | ||
74123bd7 CM |
1350 | /* |
1351 | * how many bytes are required to store the items in a leaf. start | |
1352 | * and nr indicate which items in the leaf to check. This totals up the | |
1353 | * space used both by the item structs and the item data | |
1354 | */ | |
5f39d397 | 1355 | static int leaf_space_used(struct extent_buffer *l, int start, int nr) |
be0e5c09 CM |
1356 | { |
1357 | int data_len; | |
5f39d397 | 1358 | int nritems = btrfs_header_nritems(l); |
d4dbff95 | 1359 | int end = min(nritems, start + nr) - 1; |
be0e5c09 CM |
1360 | |
1361 | if (!nr) | |
1362 | return 0; | |
5f39d397 CM |
1363 | data_len = btrfs_item_end_nr(l, start); |
1364 | data_len = data_len - btrfs_item_offset_nr(l, end); | |
0783fcfc | 1365 | data_len += sizeof(struct btrfs_item) * nr; |
d4dbff95 | 1366 | WARN_ON(data_len < 0); |
be0e5c09 CM |
1367 | return data_len; |
1368 | } | |
1369 | ||
d4dbff95 CM |
1370 | /* |
1371 | * The space between the end of the leaf items and | |
1372 | * the start of the leaf data. IOW, how much room | |
1373 | * the leaf has left for both items and data | |
1374 | */ | |
5f39d397 | 1375 | int btrfs_leaf_free_space(struct btrfs_root *root, struct extent_buffer *leaf) |
d4dbff95 | 1376 | { |
5f39d397 CM |
1377 | int nritems = btrfs_header_nritems(leaf); |
1378 | int ret; | |
1379 | ret = BTRFS_LEAF_DATA_SIZE(root) - leaf_space_used(leaf, 0, nritems); | |
1380 | if (ret < 0) { | |
1381 | printk("leaf free space ret %d, leaf data size %lu, used %d nritems %d\n", | |
1382 | ret, BTRFS_LEAF_DATA_SIZE(root), | |
1383 | leaf_space_used(leaf, 0, nritems), nritems); | |
1384 | } | |
1385 | return ret; | |
d4dbff95 CM |
1386 | } |
1387 | ||
00ec4c51 CM |
1388 | /* |
1389 | * push some data in the path leaf to the right, trying to free up at | |
1390 | * least data_size bytes. returns zero if the push worked, nonzero otherwise | |
aa5d6bed CM |
1391 | * |
1392 | * returns 1 if the push failed because the other node didn't have enough | |
1393 | * room, 0 if everything worked out and < 0 if there were major errors. | |
00ec4c51 | 1394 | */ |
e089f05c CM |
1395 | static int push_leaf_right(struct btrfs_trans_handle *trans, struct btrfs_root |
1396 | *root, struct btrfs_path *path, int data_size) | |
00ec4c51 | 1397 | { |
5f39d397 CM |
1398 | struct extent_buffer *left = path->nodes[0]; |
1399 | struct extent_buffer *right; | |
1400 | struct extent_buffer *upper; | |
1401 | struct btrfs_disk_key disk_key; | |
00ec4c51 CM |
1402 | int slot; |
1403 | int i; | |
1404 | int free_space; | |
1405 | int push_space = 0; | |
1406 | int push_items = 0; | |
0783fcfc | 1407 | struct btrfs_item *item; |
7518a238 CM |
1408 | u32 left_nritems; |
1409 | u32 right_nritems; | |
5f39d397 | 1410 | u32 data_end; |
db94535d | 1411 | u32 this_item_size; |
54aa1f4d | 1412 | int ret; |
00ec4c51 CM |
1413 | |
1414 | slot = path->slots[1]; | |
1415 | if (!path->nodes[1]) { | |
1416 | return 1; | |
1417 | } | |
1418 | upper = path->nodes[1]; | |
5f39d397 | 1419 | if (slot >= btrfs_header_nritems(upper) - 1) |
00ec4c51 | 1420 | return 1; |
5f39d397 | 1421 | |
db94535d CM |
1422 | right = read_tree_block(root, btrfs_node_blockptr(upper, slot + 1), |
1423 | root->leafsize); | |
123abc88 | 1424 | free_space = btrfs_leaf_free_space(root, right); |
0783fcfc | 1425 | if (free_space < data_size + sizeof(struct btrfs_item)) { |
5f39d397 | 1426 | free_extent_buffer(right); |
00ec4c51 CM |
1427 | return 1; |
1428 | } | |
5f39d397 | 1429 | |
02217ed2 | 1430 | /* cow and double check */ |
5f39d397 CM |
1431 | ret = btrfs_cow_block(trans, root, right, upper, |
1432 | slot + 1, &right); | |
54aa1f4d | 1433 | if (ret) { |
5f39d397 | 1434 | free_extent_buffer(right); |
54aa1f4d CM |
1435 | return 1; |
1436 | } | |
123abc88 | 1437 | free_space = btrfs_leaf_free_space(root, right); |
0783fcfc | 1438 | if (free_space < data_size + sizeof(struct btrfs_item)) { |
5f39d397 | 1439 | free_extent_buffer(right); |
02217ed2 CM |
1440 | return 1; |
1441 | } | |
1442 | ||
5f39d397 | 1443 | left_nritems = btrfs_header_nritems(left); |
a429e513 | 1444 | if (left_nritems == 0) { |
5f39d397 | 1445 | free_extent_buffer(right); |
a429e513 CM |
1446 | return 1; |
1447 | } | |
5f39d397 | 1448 | |
a429e513 | 1449 | for (i = left_nritems - 1; i >= 1; i--) { |
5f39d397 | 1450 | item = btrfs_item_nr(left, i); |
db94535d | 1451 | |
00ec4c51 CM |
1452 | if (path->slots[0] == i) |
1453 | push_space += data_size + sizeof(*item); | |
db94535d CM |
1454 | |
1455 | if (!left->map_token) { | |
1456 | map_extent_buffer(left, (unsigned long)item, | |
1457 | sizeof(struct btrfs_item), | |
1458 | &left->map_token, &left->kaddr, | |
1459 | &left->map_start, &left->map_len, | |
1460 | KM_USER1); | |
1461 | } | |
1462 | ||
1463 | this_item_size = btrfs_item_size(left, item); | |
1464 | if (this_item_size + sizeof(*item) + push_space > free_space) | |
00ec4c51 CM |
1465 | break; |
1466 | push_items++; | |
db94535d CM |
1467 | push_space += this_item_size + sizeof(*item); |
1468 | } | |
1469 | if (left->map_token) { | |
1470 | unmap_extent_buffer(left, left->map_token, KM_USER1); | |
1471 | left->map_token = NULL; | |
00ec4c51 | 1472 | } |
5f39d397 | 1473 | |
00ec4c51 | 1474 | if (push_items == 0) { |
5f39d397 | 1475 | free_extent_buffer(right); |
00ec4c51 CM |
1476 | return 1; |
1477 | } | |
5f39d397 | 1478 | |
a429e513 CM |
1479 | if (push_items == left_nritems) |
1480 | WARN_ON(1); | |
5f39d397 | 1481 | |
00ec4c51 | 1482 | /* push left to right */ |
5f39d397 CM |
1483 | right_nritems = btrfs_header_nritems(right); |
1484 | push_space = btrfs_item_end_nr(left, left_nritems - push_items); | |
123abc88 | 1485 | push_space -= leaf_data_end(root, left); |
5f39d397 | 1486 | |
00ec4c51 | 1487 | /* make room in the right data area */ |
5f39d397 CM |
1488 | data_end = leaf_data_end(root, right); |
1489 | memmove_extent_buffer(right, | |
1490 | btrfs_leaf_data(right) + data_end - push_space, | |
1491 | btrfs_leaf_data(right) + data_end, | |
1492 | BTRFS_LEAF_DATA_SIZE(root) - data_end); | |
1493 | ||
00ec4c51 | 1494 | /* copy from the left data area */ |
5f39d397 | 1495 | copy_extent_buffer(right, left, btrfs_leaf_data(right) + |
d6025579 CM |
1496 | BTRFS_LEAF_DATA_SIZE(root) - push_space, |
1497 | btrfs_leaf_data(left) + leaf_data_end(root, left), | |
1498 | push_space); | |
5f39d397 CM |
1499 | |
1500 | memmove_extent_buffer(right, btrfs_item_nr_offset(push_items), | |
1501 | btrfs_item_nr_offset(0), | |
1502 | right_nritems * sizeof(struct btrfs_item)); | |
1503 | ||
00ec4c51 | 1504 | /* copy the items from left to right */ |
5f39d397 CM |
1505 | copy_extent_buffer(right, left, btrfs_item_nr_offset(0), |
1506 | btrfs_item_nr_offset(left_nritems - push_items), | |
1507 | push_items * sizeof(struct btrfs_item)); | |
00ec4c51 CM |
1508 | |
1509 | /* update the item pointers */ | |
7518a238 | 1510 | right_nritems += push_items; |
5f39d397 | 1511 | btrfs_set_header_nritems(right, right_nritems); |
123abc88 | 1512 | push_space = BTRFS_LEAF_DATA_SIZE(root); |
db94535d | 1513 | |
7518a238 | 1514 | for (i = 0; i < right_nritems; i++) { |
5f39d397 | 1515 | item = btrfs_item_nr(right, i); |
db94535d CM |
1516 | if (!right->map_token) { |
1517 | map_extent_buffer(right, (unsigned long)item, | |
1518 | sizeof(struct btrfs_item), | |
1519 | &right->map_token, &right->kaddr, | |
1520 | &right->map_start, &right->map_len, | |
1521 | KM_USER1); | |
1522 | } | |
1523 | push_space -= btrfs_item_size(right, item); | |
1524 | btrfs_set_item_offset(right, item, push_space); | |
1525 | } | |
1526 | ||
1527 | if (right->map_token) { | |
1528 | unmap_extent_buffer(right, right->map_token, KM_USER1); | |
1529 | right->map_token = NULL; | |
00ec4c51 | 1530 | } |
7518a238 | 1531 | left_nritems -= push_items; |
5f39d397 | 1532 | btrfs_set_header_nritems(left, left_nritems); |
00ec4c51 | 1533 | |
5f39d397 CM |
1534 | btrfs_mark_buffer_dirty(left); |
1535 | btrfs_mark_buffer_dirty(right); | |
a429e513 | 1536 | |
5f39d397 CM |
1537 | btrfs_item_key(right, &disk_key, 0); |
1538 | btrfs_set_node_key(upper, &disk_key, slot + 1); | |
d6025579 | 1539 | btrfs_mark_buffer_dirty(upper); |
02217ed2 | 1540 | |
00ec4c51 | 1541 | /* then fixup the leaf pointer in the path */ |
7518a238 CM |
1542 | if (path->slots[0] >= left_nritems) { |
1543 | path->slots[0] -= left_nritems; | |
5f39d397 CM |
1544 | free_extent_buffer(path->nodes[0]); |
1545 | path->nodes[0] = right; | |
00ec4c51 CM |
1546 | path->slots[1] += 1; |
1547 | } else { | |
5f39d397 | 1548 | free_extent_buffer(right); |
00ec4c51 CM |
1549 | } |
1550 | return 0; | |
1551 | } | |
74123bd7 CM |
1552 | /* |
1553 | * push some data in the path leaf to the left, trying to free up at | |
1554 | * least data_size bytes. returns zero if the push worked, nonzero otherwise | |
1555 | */ | |
e089f05c CM |
1556 | static int push_leaf_left(struct btrfs_trans_handle *trans, struct btrfs_root |
1557 | *root, struct btrfs_path *path, int data_size) | |
be0e5c09 | 1558 | { |
5f39d397 CM |
1559 | struct btrfs_disk_key disk_key; |
1560 | struct extent_buffer *right = path->nodes[0]; | |
1561 | struct extent_buffer *left; | |
be0e5c09 CM |
1562 | int slot; |
1563 | int i; | |
1564 | int free_space; | |
1565 | int push_space = 0; | |
1566 | int push_items = 0; | |
0783fcfc | 1567 | struct btrfs_item *item; |
7518a238 | 1568 | u32 old_left_nritems; |
5f39d397 | 1569 | u32 right_nritems; |
aa5d6bed CM |
1570 | int ret = 0; |
1571 | int wret; | |
db94535d CM |
1572 | u32 this_item_size; |
1573 | u32 old_left_item_size; | |
be0e5c09 CM |
1574 | |
1575 | slot = path->slots[1]; | |
5f39d397 | 1576 | if (slot == 0) |
be0e5c09 | 1577 | return 1; |
5f39d397 | 1578 | if (!path->nodes[1]) |
be0e5c09 | 1579 | return 1; |
5f39d397 CM |
1580 | |
1581 | left = read_tree_block(root, btrfs_node_blockptr(path->nodes[1], | |
db94535d | 1582 | slot - 1), root->leafsize); |
123abc88 | 1583 | free_space = btrfs_leaf_free_space(root, left); |
0783fcfc | 1584 | if (free_space < data_size + sizeof(struct btrfs_item)) { |
5f39d397 | 1585 | free_extent_buffer(left); |
be0e5c09 CM |
1586 | return 1; |
1587 | } | |
02217ed2 CM |
1588 | |
1589 | /* cow and double check */ | |
5f39d397 CM |
1590 | ret = btrfs_cow_block(trans, root, left, |
1591 | path->nodes[1], slot - 1, &left); | |
54aa1f4d CM |
1592 | if (ret) { |
1593 | /* we hit -ENOSPC, but it isn't fatal here */ | |
5f39d397 | 1594 | free_extent_buffer(left); |
54aa1f4d CM |
1595 | return 1; |
1596 | } | |
123abc88 | 1597 | free_space = btrfs_leaf_free_space(root, left); |
0783fcfc | 1598 | if (free_space < data_size + sizeof(struct btrfs_item)) { |
5f39d397 | 1599 | free_extent_buffer(left); |
02217ed2 CM |
1600 | return 1; |
1601 | } | |
1602 | ||
5f39d397 CM |
1603 | right_nritems = btrfs_header_nritems(right); |
1604 | if (right_nritems == 0) { | |
1605 | free_extent_buffer(left); | |
a429e513 CM |
1606 | return 1; |
1607 | } | |
1608 | ||
5f39d397 CM |
1609 | for (i = 0; i < right_nritems - 1; i++) { |
1610 | item = btrfs_item_nr(right, i); | |
db94535d CM |
1611 | if (!right->map_token) { |
1612 | map_extent_buffer(right, (unsigned long)item, | |
1613 | sizeof(struct btrfs_item), | |
1614 | &right->map_token, &right->kaddr, | |
1615 | &right->map_start, &right->map_len, | |
1616 | KM_USER1); | |
1617 | } | |
1618 | ||
be0e5c09 CM |
1619 | if (path->slots[0] == i) |
1620 | push_space += data_size + sizeof(*item); | |
db94535d CM |
1621 | |
1622 | this_item_size = btrfs_item_size(right, item); | |
1623 | if (this_item_size + sizeof(*item) + push_space > free_space) | |
be0e5c09 | 1624 | break; |
db94535d | 1625 | |
be0e5c09 | 1626 | push_items++; |
db94535d CM |
1627 | push_space += this_item_size + sizeof(*item); |
1628 | } | |
1629 | ||
1630 | if (right->map_token) { | |
1631 | unmap_extent_buffer(right, right->map_token, KM_USER1); | |
1632 | right->map_token = NULL; | |
be0e5c09 | 1633 | } |
db94535d | 1634 | |
be0e5c09 | 1635 | if (push_items == 0) { |
5f39d397 | 1636 | free_extent_buffer(left); |
be0e5c09 CM |
1637 | return 1; |
1638 | } | |
5f39d397 | 1639 | if (push_items == btrfs_header_nritems(right)) |
a429e513 | 1640 | WARN_ON(1); |
5f39d397 | 1641 | |
be0e5c09 | 1642 | /* push data from right to left */ |
5f39d397 CM |
1643 | copy_extent_buffer(left, right, |
1644 | btrfs_item_nr_offset(btrfs_header_nritems(left)), | |
1645 | btrfs_item_nr_offset(0), | |
1646 | push_items * sizeof(struct btrfs_item)); | |
1647 | ||
123abc88 | 1648 | push_space = BTRFS_LEAF_DATA_SIZE(root) - |
5f39d397 CM |
1649 | btrfs_item_offset_nr(right, push_items -1); |
1650 | ||
1651 | copy_extent_buffer(left, right, btrfs_leaf_data(left) + | |
d6025579 CM |
1652 | leaf_data_end(root, left) - push_space, |
1653 | btrfs_leaf_data(right) + | |
5f39d397 | 1654 | btrfs_item_offset_nr(right, push_items - 1), |
d6025579 | 1655 | push_space); |
5f39d397 | 1656 | old_left_nritems = btrfs_header_nritems(left); |
eb60ceac CM |
1657 | BUG_ON(old_left_nritems < 0); |
1658 | ||
db94535d | 1659 | old_left_item_size = btrfs_item_offset_nr(left, old_left_nritems - 1); |
0783fcfc | 1660 | for (i = old_left_nritems; i < old_left_nritems + push_items; i++) { |
5f39d397 | 1661 | u32 ioff; |
db94535d | 1662 | |
5f39d397 | 1663 | item = btrfs_item_nr(left, i); |
db94535d CM |
1664 | if (!left->map_token) { |
1665 | map_extent_buffer(left, (unsigned long)item, | |
1666 | sizeof(struct btrfs_item), | |
1667 | &left->map_token, &left->kaddr, | |
1668 | &left->map_start, &left->map_len, | |
1669 | KM_USER1); | |
1670 | } | |
1671 | ||
5f39d397 CM |
1672 | ioff = btrfs_item_offset(left, item); |
1673 | btrfs_set_item_offset(left, item, | |
db94535d | 1674 | ioff - (BTRFS_LEAF_DATA_SIZE(root) - old_left_item_size)); |
be0e5c09 | 1675 | } |
5f39d397 | 1676 | btrfs_set_header_nritems(left, old_left_nritems + push_items); |
db94535d CM |
1677 | if (left->map_token) { |
1678 | unmap_extent_buffer(left, left->map_token, KM_USER1); | |
1679 | left->map_token = NULL; | |
1680 | } | |
be0e5c09 CM |
1681 | |
1682 | /* fixup right node */ | |
5f39d397 CM |
1683 | push_space = btrfs_item_offset_nr(right, push_items - 1) - |
1684 | leaf_data_end(root, right); | |
1685 | memmove_extent_buffer(right, btrfs_leaf_data(right) + | |
1686 | BTRFS_LEAF_DATA_SIZE(root) - push_space, | |
1687 | btrfs_leaf_data(right) + | |
1688 | leaf_data_end(root, right), push_space); | |
1689 | ||
1690 | memmove_extent_buffer(right, btrfs_item_nr_offset(0), | |
1691 | btrfs_item_nr_offset(push_items), | |
1692 | (btrfs_header_nritems(right) - push_items) * | |
1693 | sizeof(struct btrfs_item)); | |
1694 | ||
1695 | right_nritems = btrfs_header_nritems(right) - push_items; | |
1696 | btrfs_set_header_nritems(right, right_nritems); | |
123abc88 | 1697 | push_space = BTRFS_LEAF_DATA_SIZE(root); |
eb60ceac | 1698 | |
5f39d397 CM |
1699 | for (i = 0; i < right_nritems; i++) { |
1700 | item = btrfs_item_nr(right, i); | |
db94535d CM |
1701 | |
1702 | if (!right->map_token) { | |
1703 | map_extent_buffer(right, (unsigned long)item, | |
1704 | sizeof(struct btrfs_item), | |
1705 | &right->map_token, &right->kaddr, | |
1706 | &right->map_start, &right->map_len, | |
1707 | KM_USER1); | |
1708 | } | |
1709 | ||
1710 | push_space = push_space - btrfs_item_size(right, item); | |
1711 | btrfs_set_item_offset(right, item, push_space); | |
1712 | } | |
1713 | if (right->map_token) { | |
1714 | unmap_extent_buffer(right, right->map_token, KM_USER1); | |
1715 | right->map_token = NULL; | |
be0e5c09 | 1716 | } |
eb60ceac | 1717 | |
5f39d397 CM |
1718 | btrfs_mark_buffer_dirty(left); |
1719 | btrfs_mark_buffer_dirty(right); | |
098f59c2 | 1720 | |
5f39d397 CM |
1721 | btrfs_item_key(right, &disk_key, 0); |
1722 | wret = fixup_low_keys(trans, root, path, &disk_key, 1); | |
aa5d6bed CM |
1723 | if (wret) |
1724 | ret = wret; | |
be0e5c09 CM |
1725 | |
1726 | /* then fixup the leaf pointer in the path */ | |
1727 | if (path->slots[0] < push_items) { | |
1728 | path->slots[0] += old_left_nritems; | |
5f39d397 CM |
1729 | free_extent_buffer(path->nodes[0]); |
1730 | path->nodes[0] = left; | |
be0e5c09 CM |
1731 | path->slots[1] -= 1; |
1732 | } else { | |
5f39d397 | 1733 | free_extent_buffer(left); |
be0e5c09 CM |
1734 | path->slots[0] -= push_items; |
1735 | } | |
eb60ceac | 1736 | BUG_ON(path->slots[0] < 0); |
aa5d6bed | 1737 | return ret; |
be0e5c09 CM |
1738 | } |
1739 | ||
74123bd7 CM |
1740 | /* |
1741 | * split the path's leaf in two, making sure there is at least data_size | |
1742 | * available for the resulting leaf level of the path. | |
aa5d6bed CM |
1743 | * |
1744 | * returns 0 if all went well and < 0 on failure. | |
74123bd7 | 1745 | */ |
e089f05c | 1746 | static int split_leaf(struct btrfs_trans_handle *trans, struct btrfs_root |
d4dbff95 CM |
1747 | *root, struct btrfs_key *ins_key, |
1748 | struct btrfs_path *path, int data_size) | |
be0e5c09 | 1749 | { |
5f39d397 | 1750 | struct extent_buffer *l; |
7518a238 | 1751 | u32 nritems; |
eb60ceac CM |
1752 | int mid; |
1753 | int slot; | |
5f39d397 | 1754 | struct extent_buffer *right; |
0783fcfc | 1755 | int space_needed = data_size + sizeof(struct btrfs_item); |
be0e5c09 CM |
1756 | int data_copy_size; |
1757 | int rt_data_off; | |
1758 | int i; | |
d4dbff95 | 1759 | int ret = 0; |
aa5d6bed | 1760 | int wret; |
d4dbff95 CM |
1761 | int double_split = 0; |
1762 | struct btrfs_disk_key disk_key; | |
aa5d6bed | 1763 | |
40689478 | 1764 | /* first try to make some room by pushing left and right */ |
e089f05c | 1765 | wret = push_leaf_left(trans, root, path, data_size); |
3326d1b0 | 1766 | if (wret < 0) { |
eaee50e8 | 1767 | return wret; |
3326d1b0 | 1768 | } |
eaee50e8 | 1769 | if (wret) { |
e089f05c | 1770 | wret = push_leaf_right(trans, root, path, data_size); |
eaee50e8 CM |
1771 | if (wret < 0) |
1772 | return wret; | |
1773 | } | |
5f39d397 | 1774 | l = path->nodes[0]; |
aa5d6bed CM |
1775 | |
1776 | /* did the pushes work? */ | |
123abc88 | 1777 | if (btrfs_leaf_free_space(root, l) >= |
3326d1b0 | 1778 | sizeof(struct btrfs_item) + data_size) { |
aa5d6bed | 1779 | return 0; |
3326d1b0 | 1780 | } |
aa5d6bed | 1781 | |
5c680ed6 | 1782 | if (!path->nodes[1]) { |
e089f05c | 1783 | ret = insert_new_root(trans, root, path, 1); |
5c680ed6 CM |
1784 | if (ret) |
1785 | return ret; | |
1786 | } | |
eb60ceac | 1787 | slot = path->slots[0]; |
5f39d397 | 1788 | nritems = btrfs_header_nritems(l); |
eb60ceac | 1789 | mid = (nritems + 1)/ 2; |
54aa1f4d | 1790 | |
db94535d CM |
1791 | right = btrfs_alloc_free_block(trans, root, root->leafsize, |
1792 | l->start, 0); | |
5f39d397 CM |
1793 | if (IS_ERR(right)) |
1794 | return PTR_ERR(right); | |
1795 | ||
1796 | memset_extent_buffer(right, 0, 0, sizeof(struct btrfs_header)); | |
db94535d | 1797 | btrfs_set_header_bytenr(right, right->start); |
5f39d397 CM |
1798 | btrfs_set_header_generation(right, trans->transid); |
1799 | btrfs_set_header_owner(right, root->root_key.objectid); | |
1800 | btrfs_set_header_level(right, 0); | |
1801 | write_extent_buffer(right, root->fs_info->fsid, | |
1802 | (unsigned long)btrfs_header_fsid(right), | |
1803 | BTRFS_FSID_SIZE); | |
1804 | ||
d4dbff95 CM |
1805 | if (mid <= slot) { |
1806 | if (nritems == 1 || | |
1807 | leaf_space_used(l, mid, nritems - mid) + space_needed > | |
1808 | BTRFS_LEAF_DATA_SIZE(root)) { | |
1809 | if (slot >= nritems) { | |
1810 | btrfs_cpu_key_to_disk(&disk_key, ins_key); | |
5f39d397 | 1811 | btrfs_set_header_nritems(right, 0); |
d4dbff95 | 1812 | wret = insert_ptr(trans, root, path, |
db94535d | 1813 | &disk_key, right->start, |
d4dbff95 CM |
1814 | path->slots[1] + 1, 1); |
1815 | if (wret) | |
1816 | ret = wret; | |
5f39d397 CM |
1817 | free_extent_buffer(path->nodes[0]); |
1818 | path->nodes[0] = right; | |
d4dbff95 CM |
1819 | path->slots[0] = 0; |
1820 | path->slots[1] += 1; | |
1821 | return ret; | |
1822 | } | |
1823 | mid = slot; | |
3326d1b0 CM |
1824 | if (mid != nritems && |
1825 | leaf_space_used(l, mid, nritems - mid) + | |
1826 | space_needed > BTRFS_LEAF_DATA_SIZE(root)) { | |
1827 | double_split = 1; | |
1828 | } | |
d4dbff95 CM |
1829 | } |
1830 | } else { | |
1831 | if (leaf_space_used(l, 0, mid + 1) + space_needed > | |
1832 | BTRFS_LEAF_DATA_SIZE(root)) { | |
1833 | if (slot == 0) { | |
1834 | btrfs_cpu_key_to_disk(&disk_key, ins_key); | |
5f39d397 | 1835 | btrfs_set_header_nritems(right, 0); |
d4dbff95 CM |
1836 | wret = insert_ptr(trans, root, path, |
1837 | &disk_key, | |
db94535d | 1838 | right->start, |
098f59c2 | 1839 | path->slots[1], 1); |
d4dbff95 CM |
1840 | if (wret) |
1841 | ret = wret; | |
5f39d397 CM |
1842 | free_extent_buffer(path->nodes[0]); |
1843 | path->nodes[0] = right; | |
d4dbff95 | 1844 | path->slots[0] = 0; |
a429e513 CM |
1845 | if (path->slots[1] == 0) { |
1846 | wret = fixup_low_keys(trans, root, | |
1847 | path, &disk_key, 1); | |
1848 | if (wret) | |
1849 | ret = wret; | |
1850 | } | |
d4dbff95 CM |
1851 | return ret; |
1852 | } | |
1853 | mid = slot; | |
1854 | double_split = 1; | |
1855 | } | |
1856 | } | |
5f39d397 CM |
1857 | nritems = nritems - mid; |
1858 | btrfs_set_header_nritems(right, nritems); | |
1859 | data_copy_size = btrfs_item_end_nr(l, mid) - leaf_data_end(root, l); | |
1860 | ||
1861 | copy_extent_buffer(right, l, btrfs_item_nr_offset(0), | |
1862 | btrfs_item_nr_offset(mid), | |
1863 | nritems * sizeof(struct btrfs_item)); | |
1864 | ||
1865 | copy_extent_buffer(right, l, | |
d6025579 CM |
1866 | btrfs_leaf_data(right) + BTRFS_LEAF_DATA_SIZE(root) - |
1867 | data_copy_size, btrfs_leaf_data(l) + | |
1868 | leaf_data_end(root, l), data_copy_size); | |
5f39d397 | 1869 | |
123abc88 | 1870 | rt_data_off = BTRFS_LEAF_DATA_SIZE(root) - |
5f39d397 | 1871 | btrfs_item_end_nr(l, mid); |
74123bd7 | 1872 | |
5f39d397 CM |
1873 | for (i = 0; i < nritems; i++) { |
1874 | struct btrfs_item *item = btrfs_item_nr(right, i); | |
db94535d CM |
1875 | u32 ioff; |
1876 | ||
1877 | if (!right->map_token) { | |
1878 | map_extent_buffer(right, (unsigned long)item, | |
1879 | sizeof(struct btrfs_item), | |
1880 | &right->map_token, &right->kaddr, | |
1881 | &right->map_start, &right->map_len, | |
1882 | KM_USER1); | |
1883 | } | |
1884 | ||
1885 | ioff = btrfs_item_offset(right, item); | |
5f39d397 | 1886 | btrfs_set_item_offset(right, item, ioff + rt_data_off); |
0783fcfc | 1887 | } |
74123bd7 | 1888 | |
db94535d CM |
1889 | if (right->map_token) { |
1890 | unmap_extent_buffer(right, right->map_token, KM_USER1); | |
1891 | right->map_token = NULL; | |
1892 | } | |
1893 | ||
5f39d397 | 1894 | btrfs_set_header_nritems(l, mid); |
aa5d6bed | 1895 | ret = 0; |
5f39d397 | 1896 | btrfs_item_key(right, &disk_key, 0); |
db94535d CM |
1897 | wret = insert_ptr(trans, root, path, &disk_key, right->start, |
1898 | path->slots[1] + 1, 1); | |
aa5d6bed CM |
1899 | if (wret) |
1900 | ret = wret; | |
5f39d397 CM |
1901 | |
1902 | btrfs_mark_buffer_dirty(right); | |
1903 | btrfs_mark_buffer_dirty(l); | |
eb60ceac | 1904 | BUG_ON(path->slots[0] != slot); |
5f39d397 | 1905 | |
be0e5c09 | 1906 | if (mid <= slot) { |
5f39d397 CM |
1907 | free_extent_buffer(path->nodes[0]); |
1908 | path->nodes[0] = right; | |
be0e5c09 CM |
1909 | path->slots[0] -= mid; |
1910 | path->slots[1] += 1; | |
eb60ceac | 1911 | } else |
5f39d397 CM |
1912 | free_extent_buffer(right); |
1913 | ||
eb60ceac | 1914 | BUG_ON(path->slots[0] < 0); |
d4dbff95 | 1915 | |
3326d1b0 | 1916 | if (!double_split) { |
d4dbff95 | 1917 | return ret; |
3326d1b0 | 1918 | } |
5f39d397 | 1919 | |
db94535d CM |
1920 | right = btrfs_alloc_free_block(trans, root, root->leafsize, |
1921 | l->start, 0); | |
5f39d397 CM |
1922 | if (IS_ERR(right)) |
1923 | return PTR_ERR(right); | |
1924 | ||
1925 | memset_extent_buffer(right, 0, 0, sizeof(struct btrfs_header)); | |
db94535d | 1926 | btrfs_set_header_bytenr(right, right->start); |
5f39d397 CM |
1927 | btrfs_set_header_generation(right, trans->transid); |
1928 | btrfs_set_header_owner(right, root->root_key.objectid); | |
1929 | btrfs_set_header_level(right, 0); | |
1930 | write_extent_buffer(right, root->fs_info->fsid, | |
1931 | (unsigned long)btrfs_header_fsid(right), | |
1932 | BTRFS_FSID_SIZE); | |
1933 | ||
d4dbff95 | 1934 | btrfs_cpu_key_to_disk(&disk_key, ins_key); |
5f39d397 | 1935 | btrfs_set_header_nritems(right, 0); |
d4dbff95 | 1936 | wret = insert_ptr(trans, root, path, |
db94535d | 1937 | &disk_key, right->start, |
d4dbff95 CM |
1938 | path->slots[1], 1); |
1939 | if (wret) | |
1940 | ret = wret; | |
a429e513 CM |
1941 | if (path->slots[1] == 0) { |
1942 | wret = fixup_low_keys(trans, root, path, &disk_key, 1); | |
1943 | if (wret) | |
1944 | ret = wret; | |
1945 | } | |
5f39d397 CM |
1946 | free_extent_buffer(path->nodes[0]); |
1947 | path->nodes[0] = right; | |
d4dbff95 | 1948 | path->slots[0] = 0; |
be0e5c09 CM |
1949 | return ret; |
1950 | } | |
1951 | ||
b18c6685 CM |
1952 | int btrfs_truncate_item(struct btrfs_trans_handle *trans, |
1953 | struct btrfs_root *root, | |
1954 | struct btrfs_path *path, | |
1955 | u32 new_size) | |
1956 | { | |
1957 | int ret = 0; | |
1958 | int slot; | |
1959 | int slot_orig; | |
5f39d397 CM |
1960 | struct extent_buffer *leaf; |
1961 | struct btrfs_item *item; | |
b18c6685 CM |
1962 | u32 nritems; |
1963 | unsigned int data_end; | |
1964 | unsigned int old_data_start; | |
1965 | unsigned int old_size; | |
1966 | unsigned int size_diff; | |
1967 | int i; | |
1968 | ||
1969 | slot_orig = path->slots[0]; | |
5f39d397 | 1970 | leaf = path->nodes[0]; |
b18c6685 | 1971 | |
5f39d397 | 1972 | nritems = btrfs_header_nritems(leaf); |
b18c6685 CM |
1973 | data_end = leaf_data_end(root, leaf); |
1974 | ||
1975 | slot = path->slots[0]; | |
5f39d397 CM |
1976 | old_data_start = btrfs_item_offset_nr(leaf, slot); |
1977 | old_size = btrfs_item_size_nr(leaf, slot); | |
b18c6685 CM |
1978 | BUG_ON(old_size <= new_size); |
1979 | size_diff = old_size - new_size; | |
1980 | ||
1981 | BUG_ON(slot < 0); | |
1982 | BUG_ON(slot >= nritems); | |
1983 | ||
1984 | /* | |
1985 | * item0..itemN ... dataN.offset..dataN.size .. data0.size | |
1986 | */ | |
1987 | /* first correct the data pointers */ | |
1988 | for (i = slot; i < nritems; i++) { | |
5f39d397 CM |
1989 | u32 ioff; |
1990 | item = btrfs_item_nr(leaf, i); | |
db94535d CM |
1991 | |
1992 | if (!leaf->map_token) { | |
1993 | map_extent_buffer(leaf, (unsigned long)item, | |
1994 | sizeof(struct btrfs_item), | |
1995 | &leaf->map_token, &leaf->kaddr, | |
1996 | &leaf->map_start, &leaf->map_len, | |
1997 | KM_USER1); | |
1998 | } | |
1999 | ||
5f39d397 CM |
2000 | ioff = btrfs_item_offset(leaf, item); |
2001 | btrfs_set_item_offset(leaf, item, ioff + size_diff); | |
b18c6685 | 2002 | } |
db94535d CM |
2003 | |
2004 | if (leaf->map_token) { | |
2005 | unmap_extent_buffer(leaf, leaf->map_token, KM_USER1); | |
2006 | leaf->map_token = NULL; | |
2007 | } | |
2008 | ||
b18c6685 | 2009 | /* shift the data */ |
5f39d397 | 2010 | memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) + |
b18c6685 CM |
2011 | data_end + size_diff, btrfs_leaf_data(leaf) + |
2012 | data_end, old_data_start + new_size - data_end); | |
5f39d397 CM |
2013 | |
2014 | item = btrfs_item_nr(leaf, slot); | |
2015 | btrfs_set_item_size(leaf, item, new_size); | |
2016 | btrfs_mark_buffer_dirty(leaf); | |
b18c6685 CM |
2017 | |
2018 | ret = 0; | |
5f39d397 CM |
2019 | if (btrfs_leaf_free_space(root, leaf) < 0) { |
2020 | btrfs_print_leaf(root, leaf); | |
b18c6685 | 2021 | BUG(); |
5f39d397 | 2022 | } |
b18c6685 CM |
2023 | return ret; |
2024 | } | |
2025 | ||
5f39d397 CM |
2026 | int btrfs_extend_item(struct btrfs_trans_handle *trans, |
2027 | struct btrfs_root *root, struct btrfs_path *path, | |
2028 | u32 data_size) | |
6567e837 CM |
2029 | { |
2030 | int ret = 0; | |
2031 | int slot; | |
2032 | int slot_orig; | |
5f39d397 CM |
2033 | struct extent_buffer *leaf; |
2034 | struct btrfs_item *item; | |
6567e837 CM |
2035 | u32 nritems; |
2036 | unsigned int data_end; | |
2037 | unsigned int old_data; | |
2038 | unsigned int old_size; | |
2039 | int i; | |
2040 | ||
2041 | slot_orig = path->slots[0]; | |
5f39d397 | 2042 | leaf = path->nodes[0]; |
6567e837 | 2043 | |
5f39d397 | 2044 | nritems = btrfs_header_nritems(leaf); |
6567e837 CM |
2045 | data_end = leaf_data_end(root, leaf); |
2046 | ||
5f39d397 CM |
2047 | if (btrfs_leaf_free_space(root, leaf) < data_size) { |
2048 | btrfs_print_leaf(root, leaf); | |
6567e837 | 2049 | BUG(); |
5f39d397 | 2050 | } |
6567e837 | 2051 | slot = path->slots[0]; |
5f39d397 | 2052 | old_data = btrfs_item_end_nr(leaf, slot); |
6567e837 CM |
2053 | |
2054 | BUG_ON(slot < 0); | |
3326d1b0 CM |
2055 | if (slot >= nritems) { |
2056 | btrfs_print_leaf(root, leaf); | |
2057 | printk("slot %d too large, nritems %d\n", slot, nritems); | |
2058 | BUG_ON(1); | |
2059 | } | |
6567e837 CM |
2060 | |
2061 | /* | |
2062 | * item0..itemN ... dataN.offset..dataN.size .. data0.size | |
2063 | */ | |
2064 | /* first correct the data pointers */ | |
2065 | for (i = slot; i < nritems; i++) { | |
5f39d397 CM |
2066 | u32 ioff; |
2067 | item = btrfs_item_nr(leaf, i); | |
db94535d CM |
2068 | |
2069 | if (!leaf->map_token) { | |
2070 | map_extent_buffer(leaf, (unsigned long)item, | |
2071 | sizeof(struct btrfs_item), | |
2072 | &leaf->map_token, &leaf->kaddr, | |
2073 | &leaf->map_start, &leaf->map_len, | |
2074 | KM_USER1); | |
2075 | } | |
5f39d397 CM |
2076 | ioff = btrfs_item_offset(leaf, item); |
2077 | btrfs_set_item_offset(leaf, item, ioff - data_size); | |
6567e837 | 2078 | } |
5f39d397 | 2079 | |
db94535d CM |
2080 | if (leaf->map_token) { |
2081 | unmap_extent_buffer(leaf, leaf->map_token, KM_USER1); | |
2082 | leaf->map_token = NULL; | |
2083 | } | |
2084 | ||
6567e837 | 2085 | /* shift the data */ |
5f39d397 | 2086 | memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) + |
6567e837 CM |
2087 | data_end - data_size, btrfs_leaf_data(leaf) + |
2088 | data_end, old_data - data_end); | |
5f39d397 | 2089 | |
6567e837 | 2090 | data_end = old_data; |
5f39d397 CM |
2091 | old_size = btrfs_item_size_nr(leaf, slot); |
2092 | item = btrfs_item_nr(leaf, slot); | |
2093 | btrfs_set_item_size(leaf, item, old_size + data_size); | |
2094 | btrfs_mark_buffer_dirty(leaf); | |
6567e837 CM |
2095 | |
2096 | ret = 0; | |
5f39d397 CM |
2097 | if (btrfs_leaf_free_space(root, leaf) < 0) { |
2098 | btrfs_print_leaf(root, leaf); | |
6567e837 | 2099 | BUG(); |
5f39d397 | 2100 | } |
6567e837 CM |
2101 | return ret; |
2102 | } | |
2103 | ||
74123bd7 CM |
2104 | /* |
2105 | * Given a key and some data, insert an item into the tree. | |
2106 | * This does all the path init required, making room in the tree if needed. | |
2107 | */ | |
5f39d397 CM |
2108 | int btrfs_insert_empty_item(struct btrfs_trans_handle *trans, |
2109 | struct btrfs_root *root, | |
2110 | struct btrfs_path *path, | |
2111 | struct btrfs_key *cpu_key, u32 data_size) | |
be0e5c09 | 2112 | { |
5f39d397 CM |
2113 | struct extent_buffer *leaf; |
2114 | struct btrfs_item *item; | |
aa5d6bed | 2115 | int ret = 0; |
be0e5c09 | 2116 | int slot; |
eb60ceac | 2117 | int slot_orig; |
7518a238 | 2118 | u32 nritems; |
be0e5c09 | 2119 | unsigned int data_end; |
e2fa7227 CM |
2120 | struct btrfs_disk_key disk_key; |
2121 | ||
2122 | btrfs_cpu_key_to_disk(&disk_key, cpu_key); | |
be0e5c09 | 2123 | |
74123bd7 | 2124 | /* create a root if there isn't one */ |
5c680ed6 | 2125 | if (!root->node) |
cfaa7295 | 2126 | BUG(); |
5f39d397 | 2127 | |
e089f05c | 2128 | ret = btrfs_search_slot(trans, root, cpu_key, path, data_size, 1); |
eb60ceac | 2129 | if (ret == 0) { |
f0930a37 | 2130 | return -EEXIST; |
aa5d6bed | 2131 | } |
ed2ff2cb CM |
2132 | if (ret < 0) |
2133 | goto out; | |
be0e5c09 | 2134 | |
62e2749e | 2135 | slot_orig = path->slots[0]; |
5f39d397 | 2136 | leaf = path->nodes[0]; |
74123bd7 | 2137 | |
5f39d397 | 2138 | nritems = btrfs_header_nritems(leaf); |
123abc88 | 2139 | data_end = leaf_data_end(root, leaf); |
eb60ceac | 2140 | |
123abc88 | 2141 | if (btrfs_leaf_free_space(root, leaf) < |
d4dbff95 | 2142 | sizeof(struct btrfs_item) + data_size) { |
3326d1b0 CM |
2143 | btrfs_print_leaf(root, leaf); |
2144 | printk("not enough freespace need %u have %d\n", | |
2145 | data_size, btrfs_leaf_free_space(root, leaf)); | |
be0e5c09 | 2146 | BUG(); |
d4dbff95 | 2147 | } |
5f39d397 | 2148 | |
62e2749e | 2149 | slot = path->slots[0]; |
eb60ceac | 2150 | BUG_ON(slot < 0); |
5f39d397 | 2151 | |
be0e5c09 CM |
2152 | if (slot != nritems) { |
2153 | int i; | |
5f39d397 | 2154 | unsigned int old_data = btrfs_item_end_nr(leaf, slot); |
be0e5c09 | 2155 | |
5f39d397 CM |
2156 | if (old_data < data_end) { |
2157 | btrfs_print_leaf(root, leaf); | |
2158 | printk("slot %d old_data %d data_end %d\n", | |
2159 | slot, old_data, data_end); | |
2160 | BUG_ON(1); | |
2161 | } | |
be0e5c09 CM |
2162 | /* |
2163 | * item0..itemN ... dataN.offset..dataN.size .. data0.size | |
2164 | */ | |
2165 | /* first correct the data pointers */ | |
db94535d | 2166 | WARN_ON(leaf->map_token); |
0783fcfc | 2167 | for (i = slot; i < nritems; i++) { |
5f39d397 | 2168 | u32 ioff; |
db94535d | 2169 | |
5f39d397 | 2170 | item = btrfs_item_nr(leaf, i); |
db94535d CM |
2171 | if (!leaf->map_token) { |
2172 | map_extent_buffer(leaf, (unsigned long)item, | |
2173 | sizeof(struct btrfs_item), | |
2174 | &leaf->map_token, &leaf->kaddr, | |
2175 | &leaf->map_start, &leaf->map_len, | |
2176 | KM_USER1); | |
2177 | } | |
2178 | ||
5f39d397 CM |
2179 | ioff = btrfs_item_offset(leaf, item); |
2180 | btrfs_set_item_offset(leaf, item, ioff - data_size); | |
0783fcfc | 2181 | } |
db94535d CM |
2182 | if (leaf->map_token) { |
2183 | unmap_extent_buffer(leaf, leaf->map_token, KM_USER1); | |
2184 | leaf->map_token = NULL; | |
2185 | } | |
be0e5c09 CM |
2186 | |
2187 | /* shift the items */ | |
5f39d397 CM |
2188 | memmove_extent_buffer(leaf, btrfs_item_nr_offset(slot + 1), |
2189 | btrfs_item_nr_offset(slot), | |
d6025579 | 2190 | (nritems - slot) * sizeof(struct btrfs_item)); |
be0e5c09 CM |
2191 | |
2192 | /* shift the data */ | |
5f39d397 | 2193 | memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) + |
d6025579 CM |
2194 | data_end - data_size, btrfs_leaf_data(leaf) + |
2195 | data_end, old_data - data_end); | |
be0e5c09 CM |
2196 | data_end = old_data; |
2197 | } | |
5f39d397 | 2198 | |
62e2749e | 2199 | /* setup the item for the new data */ |
5f39d397 CM |
2200 | btrfs_set_item_key(leaf, &disk_key, slot); |
2201 | item = btrfs_item_nr(leaf, slot); | |
2202 | btrfs_set_item_offset(leaf, item, data_end - data_size); | |
2203 | btrfs_set_item_size(leaf, item, data_size); | |
2204 | btrfs_set_header_nritems(leaf, nritems + 1); | |
2205 | btrfs_mark_buffer_dirty(leaf); | |
aa5d6bed CM |
2206 | |
2207 | ret = 0; | |
8e19f2cd | 2208 | if (slot == 0) |
e089f05c | 2209 | ret = fixup_low_keys(trans, root, path, &disk_key, 1); |
aa5d6bed | 2210 | |
5f39d397 CM |
2211 | if (btrfs_leaf_free_space(root, leaf) < 0) { |
2212 | btrfs_print_leaf(root, leaf); | |
be0e5c09 | 2213 | BUG(); |
5f39d397 | 2214 | } |
ed2ff2cb | 2215 | out: |
62e2749e CM |
2216 | return ret; |
2217 | } | |
2218 | ||
2219 | /* | |
2220 | * Given a key and some data, insert an item into the tree. | |
2221 | * This does all the path init required, making room in the tree if needed. | |
2222 | */ | |
e089f05c CM |
2223 | int btrfs_insert_item(struct btrfs_trans_handle *trans, struct btrfs_root |
2224 | *root, struct btrfs_key *cpu_key, void *data, u32 | |
2225 | data_size) | |
62e2749e CM |
2226 | { |
2227 | int ret = 0; | |
2c90e5d6 | 2228 | struct btrfs_path *path; |
5f39d397 CM |
2229 | struct extent_buffer *leaf; |
2230 | unsigned long ptr; | |
62e2749e | 2231 | |
2c90e5d6 CM |
2232 | path = btrfs_alloc_path(); |
2233 | BUG_ON(!path); | |
2c90e5d6 | 2234 | ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size); |
62e2749e | 2235 | if (!ret) { |
5f39d397 CM |
2236 | leaf = path->nodes[0]; |
2237 | ptr = btrfs_item_ptr_offset(leaf, path->slots[0]); | |
2238 | write_extent_buffer(leaf, data, ptr, data_size); | |
2239 | btrfs_mark_buffer_dirty(leaf); | |
62e2749e | 2240 | } |
2c90e5d6 | 2241 | btrfs_free_path(path); |
aa5d6bed | 2242 | return ret; |
be0e5c09 CM |
2243 | } |
2244 | ||
74123bd7 | 2245 | /* |
5de08d7d | 2246 | * delete the pointer from a given node. |
74123bd7 CM |
2247 | * |
2248 | * If the delete empties a node, the node is removed from the tree, | |
2249 | * continuing all the way the root if required. The root is converted into | |
2250 | * a leaf if all the nodes are emptied. | |
2251 | */ | |
e089f05c CM |
2252 | static int del_ptr(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
2253 | struct btrfs_path *path, int level, int slot) | |
be0e5c09 | 2254 | { |
5f39d397 | 2255 | struct extent_buffer *parent = path->nodes[level]; |
7518a238 | 2256 | u32 nritems; |
aa5d6bed | 2257 | int ret = 0; |
bb803951 | 2258 | int wret; |
be0e5c09 | 2259 | |
5f39d397 | 2260 | nritems = btrfs_header_nritems(parent); |
bb803951 | 2261 | if (slot != nritems -1) { |
5f39d397 CM |
2262 | memmove_extent_buffer(parent, |
2263 | btrfs_node_key_ptr_offset(slot), | |
2264 | btrfs_node_key_ptr_offset(slot + 1), | |
d6025579 CM |
2265 | sizeof(struct btrfs_key_ptr) * |
2266 | (nritems - slot - 1)); | |
bb803951 | 2267 | } |
7518a238 | 2268 | nritems--; |
5f39d397 | 2269 | btrfs_set_header_nritems(parent, nritems); |
7518a238 | 2270 | if (nritems == 0 && parent == root->node) { |
5f39d397 | 2271 | BUG_ON(btrfs_header_level(root->node) != 1); |
bb803951 | 2272 | /* just turn the root into a leaf and break */ |
5f39d397 | 2273 | btrfs_set_header_level(root->node, 0); |
bb803951 | 2274 | } else if (slot == 0) { |
5f39d397 CM |
2275 | struct btrfs_disk_key disk_key; |
2276 | ||
2277 | btrfs_node_key(parent, &disk_key, 0); | |
2278 | wret = fixup_low_keys(trans, root, path, &disk_key, level + 1); | |
0f70abe2 CM |
2279 | if (wret) |
2280 | ret = wret; | |
be0e5c09 | 2281 | } |
d6025579 | 2282 | btrfs_mark_buffer_dirty(parent); |
aa5d6bed | 2283 | return ret; |
be0e5c09 CM |
2284 | } |
2285 | ||
74123bd7 CM |
2286 | /* |
2287 | * delete the item at the leaf level in path. If that empties | |
2288 | * the leaf, remove it from the tree | |
2289 | */ | |
e089f05c CM |
2290 | int btrfs_del_item(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
2291 | struct btrfs_path *path) | |
be0e5c09 | 2292 | { |
be0e5c09 | 2293 | int slot; |
5f39d397 CM |
2294 | struct extent_buffer *leaf; |
2295 | struct btrfs_item *item; | |
be0e5c09 CM |
2296 | int doff; |
2297 | int dsize; | |
aa5d6bed CM |
2298 | int ret = 0; |
2299 | int wret; | |
7518a238 | 2300 | u32 nritems; |
be0e5c09 | 2301 | |
5f39d397 | 2302 | leaf = path->nodes[0]; |
4920c9ac | 2303 | slot = path->slots[0]; |
5f39d397 CM |
2304 | doff = btrfs_item_offset_nr(leaf, slot); |
2305 | dsize = btrfs_item_size_nr(leaf, slot); | |
2306 | nritems = btrfs_header_nritems(leaf); | |
be0e5c09 | 2307 | |
7518a238 | 2308 | if (slot != nritems - 1) { |
be0e5c09 | 2309 | int i; |
123abc88 | 2310 | int data_end = leaf_data_end(root, leaf); |
5f39d397 CM |
2311 | |
2312 | memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) + | |
d6025579 CM |
2313 | data_end + dsize, |
2314 | btrfs_leaf_data(leaf) + data_end, | |
2315 | doff - data_end); | |
5f39d397 | 2316 | |
0783fcfc | 2317 | for (i = slot + 1; i < nritems; i++) { |
5f39d397 | 2318 | u32 ioff; |
db94535d | 2319 | |
5f39d397 | 2320 | item = btrfs_item_nr(leaf, i); |
db94535d CM |
2321 | if (!leaf->map_token) { |
2322 | map_extent_buffer(leaf, (unsigned long)item, | |
2323 | sizeof(struct btrfs_item), | |
2324 | &leaf->map_token, &leaf->kaddr, | |
2325 | &leaf->map_start, &leaf->map_len, | |
2326 | KM_USER1); | |
2327 | } | |
5f39d397 CM |
2328 | ioff = btrfs_item_offset(leaf, item); |
2329 | btrfs_set_item_offset(leaf, item, ioff + dsize); | |
0783fcfc | 2330 | } |
db94535d CM |
2331 | |
2332 | if (leaf->map_token) { | |
2333 | unmap_extent_buffer(leaf, leaf->map_token, KM_USER1); | |
2334 | leaf->map_token = NULL; | |
2335 | } | |
2336 | ||
5f39d397 CM |
2337 | memmove_extent_buffer(leaf, btrfs_item_nr_offset(slot), |
2338 | btrfs_item_nr_offset(slot + 1), | |
d6025579 CM |
2339 | sizeof(struct btrfs_item) * |
2340 | (nritems - slot - 1)); | |
be0e5c09 | 2341 | } |
5f39d397 | 2342 | btrfs_set_header_nritems(leaf, nritems - 1); |
7518a238 | 2343 | nritems--; |
5f39d397 | 2344 | |
74123bd7 | 2345 | /* delete the leaf if we've emptied it */ |
7518a238 | 2346 | if (nritems == 0) { |
5f39d397 CM |
2347 | if (leaf == root->node) { |
2348 | btrfs_set_header_level(leaf, 0); | |
9a8dd150 | 2349 | } else { |
5f39d397 CM |
2350 | clean_tree_block(trans, root, leaf); |
2351 | wait_on_tree_block_writeback(root, leaf); | |
e089f05c | 2352 | wret = del_ptr(trans, root, path, 1, path->slots[1]); |
aa5d6bed CM |
2353 | if (wret) |
2354 | ret = wret; | |
e089f05c | 2355 | wret = btrfs_free_extent(trans, root, |
db94535d | 2356 | leaf->start, leaf->len, 1); |
0f70abe2 CM |
2357 | if (wret) |
2358 | ret = wret; | |
9a8dd150 | 2359 | } |
be0e5c09 | 2360 | } else { |
7518a238 | 2361 | int used = leaf_space_used(leaf, 0, nritems); |
aa5d6bed | 2362 | if (slot == 0) { |
5f39d397 CM |
2363 | struct btrfs_disk_key disk_key; |
2364 | ||
2365 | btrfs_item_key(leaf, &disk_key, 0); | |
e089f05c | 2366 | wret = fixup_low_keys(trans, root, path, |
5f39d397 | 2367 | &disk_key, 1); |
aa5d6bed CM |
2368 | if (wret) |
2369 | ret = wret; | |
2370 | } | |
aa5d6bed | 2371 | |
74123bd7 | 2372 | /* delete the leaf if it is mostly empty */ |
123abc88 | 2373 | if (used < BTRFS_LEAF_DATA_SIZE(root) / 3) { |
be0e5c09 CM |
2374 | /* push_leaf_left fixes the path. |
2375 | * make sure the path still points to our leaf | |
2376 | * for possible call to del_ptr below | |
2377 | */ | |
4920c9ac | 2378 | slot = path->slots[1]; |
5f39d397 CM |
2379 | extent_buffer_get(leaf); |
2380 | ||
e089f05c | 2381 | wret = push_leaf_left(trans, root, path, 1); |
54aa1f4d | 2382 | if (wret < 0 && wret != -ENOSPC) |
aa5d6bed | 2383 | ret = wret; |
5f39d397 CM |
2384 | |
2385 | if (path->nodes[0] == leaf && | |
2386 | btrfs_header_nritems(leaf)) { | |
e089f05c | 2387 | wret = push_leaf_right(trans, root, path, 1); |
54aa1f4d | 2388 | if (wret < 0 && wret != -ENOSPC) |
aa5d6bed CM |
2389 | ret = wret; |
2390 | } | |
5f39d397 CM |
2391 | |
2392 | if (btrfs_header_nritems(leaf) == 0) { | |
db94535d CM |
2393 | u64 bytenr = leaf->start; |
2394 | u32 blocksize = leaf->len; | |
5f39d397 CM |
2395 | |
2396 | clean_tree_block(trans, root, leaf); | |
2397 | wait_on_tree_block_writeback(root, leaf); | |
2398 | ||
e089f05c | 2399 | wret = del_ptr(trans, root, path, 1, slot); |
aa5d6bed CM |
2400 | if (wret) |
2401 | ret = wret; | |
5f39d397 CM |
2402 | |
2403 | free_extent_buffer(leaf); | |
db94535d CM |
2404 | wret = btrfs_free_extent(trans, root, bytenr, |
2405 | blocksize, 1); | |
0f70abe2 CM |
2406 | if (wret) |
2407 | ret = wret; | |
5de08d7d | 2408 | } else { |
5f39d397 CM |
2409 | btrfs_mark_buffer_dirty(leaf); |
2410 | free_extent_buffer(leaf); | |
be0e5c09 | 2411 | } |
d5719762 | 2412 | } else { |
5f39d397 | 2413 | btrfs_mark_buffer_dirty(leaf); |
be0e5c09 CM |
2414 | } |
2415 | } | |
aa5d6bed | 2416 | return ret; |
be0e5c09 CM |
2417 | } |
2418 | ||
97571fd0 CM |
2419 | /* |
2420 | * walk up the tree as far as required to find the next leaf. | |
0f70abe2 CM |
2421 | * returns 0 if it found something or 1 if there are no greater leaves. |
2422 | * returns < 0 on io errors. | |
97571fd0 | 2423 | */ |
234b63a0 | 2424 | int btrfs_next_leaf(struct btrfs_root *root, struct btrfs_path *path) |
d97e63b6 CM |
2425 | { |
2426 | int slot; | |
2427 | int level = 1; | |
db94535d | 2428 | u64 bytenr; |
5f39d397 CM |
2429 | struct extent_buffer *c; |
2430 | struct extent_buffer *next = NULL; | |
d97e63b6 | 2431 | |
234b63a0 | 2432 | while(level < BTRFS_MAX_LEVEL) { |
d97e63b6 | 2433 | if (!path->nodes[level]) |
0f70abe2 | 2434 | return 1; |
5f39d397 | 2435 | |
d97e63b6 CM |
2436 | slot = path->slots[level] + 1; |
2437 | c = path->nodes[level]; | |
5f39d397 | 2438 | if (slot >= btrfs_header_nritems(c)) { |
d97e63b6 CM |
2439 | level++; |
2440 | continue; | |
2441 | } | |
5f39d397 | 2442 | |
db94535d | 2443 | bytenr = btrfs_node_blockptr(c, slot); |
cfaa7295 | 2444 | if (next) |
5f39d397 CM |
2445 | free_extent_buffer(next); |
2446 | ||
6702ed49 CM |
2447 | if (path->reada) |
2448 | reada_for_search(root, path, level, slot); | |
5f39d397 | 2449 | |
db94535d CM |
2450 | next = read_tree_block(root, bytenr, |
2451 | btrfs_level_size(root, level -1)); | |
d97e63b6 CM |
2452 | break; |
2453 | } | |
2454 | path->slots[level] = slot; | |
2455 | while(1) { | |
2456 | level--; | |
2457 | c = path->nodes[level]; | |
5f39d397 | 2458 | free_extent_buffer(c); |
d97e63b6 CM |
2459 | path->nodes[level] = next; |
2460 | path->slots[level] = 0; | |
2461 | if (!level) | |
2462 | break; | |
6702ed49 | 2463 | if (path->reada) |
32020611 | 2464 | reada_for_search(root, path, level, 0); |
db94535d CM |
2465 | next = read_tree_block(root, btrfs_node_blockptr(next, 0), |
2466 | btrfs_level_size(root, level - 1)); | |
d97e63b6 CM |
2467 | } |
2468 | return 0; | |
2469 | } |