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