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