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