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