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