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