Commit | Line | Data |
---|---|---|
6cbd5570 | 1 | /* |
d352ac68 | 2 | * Copyright (C) 2007,2008 Oracle. All rights reserved. |
6cbd5570 CM |
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> |
5a0e3ad6 | 20 | #include <linux/slab.h> |
bd989ba3 | 21 | #include <linux/rbtree.h> |
eb60ceac CM |
22 | #include "ctree.h" |
23 | #include "disk-io.h" | |
7f5c1516 | 24 | #include "transaction.h" |
5f39d397 | 25 | #include "print-tree.h" |
925baedd | 26 | #include "locking.h" |
9a8dd150 | 27 | |
e089f05c CM |
28 | static int split_node(struct btrfs_trans_handle *trans, struct btrfs_root |
29 | *root, struct btrfs_path *path, int level); | |
30 | static int split_leaf(struct btrfs_trans_handle *trans, struct btrfs_root | |
d4dbff95 | 31 | *root, struct btrfs_key *ins_key, |
cc0c5538 | 32 | struct btrfs_path *path, int data_size, int extend); |
5f39d397 CM |
33 | static int push_node_left(struct btrfs_trans_handle *trans, |
34 | struct btrfs_root *root, struct extent_buffer *dst, | |
971a1f66 | 35 | struct extent_buffer *src, int empty); |
5f39d397 CM |
36 | static int balance_node_right(struct btrfs_trans_handle *trans, |
37 | struct btrfs_root *root, | |
38 | struct extent_buffer *dst_buf, | |
39 | struct extent_buffer *src_buf); | |
afe5fea7 TI |
40 | static void del_ptr(struct btrfs_root *root, struct btrfs_path *path, |
41 | int level, int slot); | |
f230475e JS |
42 | static void tree_mod_log_free_eb(struct btrfs_fs_info *fs_info, |
43 | struct extent_buffer *eb); | |
48a3b636 | 44 | static int btrfs_prev_leaf(struct btrfs_root *root, struct btrfs_path *path); |
d97e63b6 | 45 | |
df24a2b9 | 46 | struct btrfs_path *btrfs_alloc_path(void) |
2c90e5d6 | 47 | { |
df24a2b9 | 48 | struct btrfs_path *path; |
e00f7308 | 49 | path = kmem_cache_zalloc(btrfs_path_cachep, GFP_NOFS); |
df24a2b9 | 50 | return path; |
2c90e5d6 CM |
51 | } |
52 | ||
b4ce94de CM |
53 | /* |
54 | * set all locked nodes in the path to blocking locks. This should | |
55 | * be done before scheduling | |
56 | */ | |
57 | noinline void btrfs_set_path_blocking(struct btrfs_path *p) | |
58 | { | |
59 | int i; | |
60 | for (i = 0; i < BTRFS_MAX_LEVEL; i++) { | |
bd681513 CM |
61 | if (!p->nodes[i] || !p->locks[i]) |
62 | continue; | |
63 | btrfs_set_lock_blocking_rw(p->nodes[i], p->locks[i]); | |
64 | if (p->locks[i] == BTRFS_READ_LOCK) | |
65 | p->locks[i] = BTRFS_READ_LOCK_BLOCKING; | |
66 | else if (p->locks[i] == BTRFS_WRITE_LOCK) | |
67 | p->locks[i] = BTRFS_WRITE_LOCK_BLOCKING; | |
b4ce94de CM |
68 | } |
69 | } | |
70 | ||
71 | /* | |
72 | * reset all the locked nodes in the patch to spinning locks. | |
4008c04a CM |
73 | * |
74 | * held is used to keep lockdep happy, when lockdep is enabled | |
75 | * we set held to a blocking lock before we go around and | |
76 | * retake all the spinlocks in the path. You can safely use NULL | |
77 | * for held | |
b4ce94de | 78 | */ |
4008c04a | 79 | noinline void btrfs_clear_path_blocking(struct btrfs_path *p, |
bd681513 | 80 | struct extent_buffer *held, int held_rw) |
b4ce94de CM |
81 | { |
82 | int i; | |
4008c04a CM |
83 | |
84 | #ifdef CONFIG_DEBUG_LOCK_ALLOC | |
85 | /* lockdep really cares that we take all of these spinlocks | |
86 | * in the right order. If any of the locks in the path are not | |
87 | * currently blocking, it is going to complain. So, make really | |
88 | * really sure by forcing the path to blocking before we clear | |
89 | * the path blocking. | |
90 | */ | |
bd681513 CM |
91 | if (held) { |
92 | btrfs_set_lock_blocking_rw(held, held_rw); | |
93 | if (held_rw == BTRFS_WRITE_LOCK) | |
94 | held_rw = BTRFS_WRITE_LOCK_BLOCKING; | |
95 | else if (held_rw == BTRFS_READ_LOCK) | |
96 | held_rw = BTRFS_READ_LOCK_BLOCKING; | |
97 | } | |
4008c04a CM |
98 | btrfs_set_path_blocking(p); |
99 | #endif | |
100 | ||
101 | for (i = BTRFS_MAX_LEVEL - 1; i >= 0; i--) { | |
bd681513 CM |
102 | if (p->nodes[i] && p->locks[i]) { |
103 | btrfs_clear_lock_blocking_rw(p->nodes[i], p->locks[i]); | |
104 | if (p->locks[i] == BTRFS_WRITE_LOCK_BLOCKING) | |
105 | p->locks[i] = BTRFS_WRITE_LOCK; | |
106 | else if (p->locks[i] == BTRFS_READ_LOCK_BLOCKING) | |
107 | p->locks[i] = BTRFS_READ_LOCK; | |
108 | } | |
b4ce94de | 109 | } |
4008c04a CM |
110 | |
111 | #ifdef CONFIG_DEBUG_LOCK_ALLOC | |
112 | if (held) | |
bd681513 | 113 | btrfs_clear_lock_blocking_rw(held, held_rw); |
4008c04a | 114 | #endif |
b4ce94de CM |
115 | } |
116 | ||
d352ac68 | 117 | /* this also releases the path */ |
df24a2b9 | 118 | void btrfs_free_path(struct btrfs_path *p) |
be0e5c09 | 119 | { |
ff175d57 JJ |
120 | if (!p) |
121 | return; | |
b3b4aa74 | 122 | btrfs_release_path(p); |
df24a2b9 | 123 | kmem_cache_free(btrfs_path_cachep, p); |
be0e5c09 CM |
124 | } |
125 | ||
d352ac68 CM |
126 | /* |
127 | * path release drops references on the extent buffers in the path | |
128 | * and it drops any locks held by this path | |
129 | * | |
130 | * It is safe to call this on paths that no locks or extent buffers held. | |
131 | */ | |
b3b4aa74 | 132 | noinline void btrfs_release_path(struct btrfs_path *p) |
eb60ceac CM |
133 | { |
134 | int i; | |
a2135011 | 135 | |
234b63a0 | 136 | for (i = 0; i < BTRFS_MAX_LEVEL; i++) { |
3f157a2f | 137 | p->slots[i] = 0; |
eb60ceac | 138 | if (!p->nodes[i]) |
925baedd CM |
139 | continue; |
140 | if (p->locks[i]) { | |
bd681513 | 141 | btrfs_tree_unlock_rw(p->nodes[i], p->locks[i]); |
925baedd CM |
142 | p->locks[i] = 0; |
143 | } | |
5f39d397 | 144 | free_extent_buffer(p->nodes[i]); |
3f157a2f | 145 | p->nodes[i] = NULL; |
eb60ceac CM |
146 | } |
147 | } | |
148 | ||
d352ac68 CM |
149 | /* |
150 | * safely gets a reference on the root node of a tree. A lock | |
151 | * is not taken, so a concurrent writer may put a different node | |
152 | * at the root of the tree. See btrfs_lock_root_node for the | |
153 | * looping required. | |
154 | * | |
155 | * The extent buffer returned by this has a reference taken, so | |
156 | * it won't disappear. It may stop being the root of the tree | |
157 | * at any time because there are no locks held. | |
158 | */ | |
925baedd CM |
159 | struct extent_buffer *btrfs_root_node(struct btrfs_root *root) |
160 | { | |
161 | struct extent_buffer *eb; | |
240f62c8 | 162 | |
3083ee2e JB |
163 | while (1) { |
164 | rcu_read_lock(); | |
165 | eb = rcu_dereference(root->node); | |
166 | ||
167 | /* | |
168 | * RCU really hurts here, we could free up the root node because | |
169 | * it was cow'ed but we may not get the new root node yet so do | |
170 | * the inc_not_zero dance and if it doesn't work then | |
171 | * synchronize_rcu and try again. | |
172 | */ | |
173 | if (atomic_inc_not_zero(&eb->refs)) { | |
174 | rcu_read_unlock(); | |
175 | break; | |
176 | } | |
177 | rcu_read_unlock(); | |
178 | synchronize_rcu(); | |
179 | } | |
925baedd CM |
180 | return eb; |
181 | } | |
182 | ||
d352ac68 CM |
183 | /* loop around taking references on and locking the root node of the |
184 | * tree until you end up with a lock on the root. A locked buffer | |
185 | * is returned, with a reference held. | |
186 | */ | |
925baedd CM |
187 | struct extent_buffer *btrfs_lock_root_node(struct btrfs_root *root) |
188 | { | |
189 | struct extent_buffer *eb; | |
190 | ||
d397712b | 191 | while (1) { |
925baedd CM |
192 | eb = btrfs_root_node(root); |
193 | btrfs_tree_lock(eb); | |
240f62c8 | 194 | if (eb == root->node) |
925baedd | 195 | break; |
925baedd CM |
196 | btrfs_tree_unlock(eb); |
197 | free_extent_buffer(eb); | |
198 | } | |
199 | return eb; | |
200 | } | |
201 | ||
bd681513 CM |
202 | /* loop around taking references on and locking the root node of the |
203 | * tree until you end up with a lock on the root. A locked buffer | |
204 | * is returned, with a reference held. | |
205 | */ | |
48a3b636 | 206 | static struct extent_buffer *btrfs_read_lock_root_node(struct btrfs_root *root) |
bd681513 CM |
207 | { |
208 | struct extent_buffer *eb; | |
209 | ||
210 | while (1) { | |
211 | eb = btrfs_root_node(root); | |
212 | btrfs_tree_read_lock(eb); | |
213 | if (eb == root->node) | |
214 | break; | |
215 | btrfs_tree_read_unlock(eb); | |
216 | free_extent_buffer(eb); | |
217 | } | |
218 | return eb; | |
219 | } | |
220 | ||
d352ac68 CM |
221 | /* cowonly root (everything not a reference counted cow subvolume), just get |
222 | * put onto a simple dirty list. transaction.c walks this to make sure they | |
223 | * get properly updated on disk. | |
224 | */ | |
0b86a832 CM |
225 | static void add_root_to_dirty_list(struct btrfs_root *root) |
226 | { | |
e5846fc6 | 227 | spin_lock(&root->fs_info->trans_lock); |
0b86a832 CM |
228 | if (root->track_dirty && list_empty(&root->dirty_list)) { |
229 | list_add(&root->dirty_list, | |
230 | &root->fs_info->dirty_cowonly_roots); | |
231 | } | |
e5846fc6 | 232 | spin_unlock(&root->fs_info->trans_lock); |
0b86a832 CM |
233 | } |
234 | ||
d352ac68 CM |
235 | /* |
236 | * used by snapshot creation to make a copy of a root for a tree with | |
237 | * a given objectid. The buffer with the new root node is returned in | |
238 | * cow_ret, and this func returns zero on success or a negative error code. | |
239 | */ | |
be20aa9d CM |
240 | int btrfs_copy_root(struct btrfs_trans_handle *trans, |
241 | struct btrfs_root *root, | |
242 | struct extent_buffer *buf, | |
243 | struct extent_buffer **cow_ret, u64 new_root_objectid) | |
244 | { | |
245 | struct extent_buffer *cow; | |
be20aa9d CM |
246 | int ret = 0; |
247 | int level; | |
5d4f98a2 | 248 | struct btrfs_disk_key disk_key; |
be20aa9d CM |
249 | |
250 | WARN_ON(root->ref_cows && trans->transid != | |
251 | root->fs_info->running_transaction->transid); | |
252 | WARN_ON(root->ref_cows && trans->transid != root->last_trans); | |
253 | ||
254 | level = btrfs_header_level(buf); | |
5d4f98a2 YZ |
255 | if (level == 0) |
256 | btrfs_item_key(buf, &disk_key, 0); | |
257 | else | |
258 | btrfs_node_key(buf, &disk_key, 0); | |
31840ae1 | 259 | |
5d4f98a2 YZ |
260 | cow = btrfs_alloc_free_block(trans, root, buf->len, 0, |
261 | new_root_objectid, &disk_key, level, | |
5581a51a | 262 | buf->start, 0); |
5d4f98a2 | 263 | if (IS_ERR(cow)) |
be20aa9d CM |
264 | return PTR_ERR(cow); |
265 | ||
266 | copy_extent_buffer(cow, buf, 0, 0, cow->len); | |
267 | btrfs_set_header_bytenr(cow, cow->start); | |
268 | btrfs_set_header_generation(cow, trans->transid); | |
5d4f98a2 YZ |
269 | btrfs_set_header_backref_rev(cow, BTRFS_MIXED_BACKREF_REV); |
270 | btrfs_clear_header_flag(cow, BTRFS_HEADER_FLAG_WRITTEN | | |
271 | BTRFS_HEADER_FLAG_RELOC); | |
272 | if (new_root_objectid == BTRFS_TREE_RELOC_OBJECTID) | |
273 | btrfs_set_header_flag(cow, BTRFS_HEADER_FLAG_RELOC); | |
274 | else | |
275 | btrfs_set_header_owner(cow, new_root_objectid); | |
be20aa9d | 276 | |
2b82032c YZ |
277 | write_extent_buffer(cow, root->fs_info->fsid, |
278 | (unsigned long)btrfs_header_fsid(cow), | |
279 | BTRFS_FSID_SIZE); | |
280 | ||
be20aa9d | 281 | WARN_ON(btrfs_header_generation(buf) > trans->transid); |
5d4f98a2 | 282 | if (new_root_objectid == BTRFS_TREE_RELOC_OBJECTID) |
66d7e7f0 | 283 | ret = btrfs_inc_ref(trans, root, cow, 1, 1); |
5d4f98a2 | 284 | else |
66d7e7f0 | 285 | ret = btrfs_inc_ref(trans, root, cow, 0, 1); |
4aec2b52 | 286 | |
be20aa9d CM |
287 | if (ret) |
288 | return ret; | |
289 | ||
290 | btrfs_mark_buffer_dirty(cow); | |
291 | *cow_ret = cow; | |
292 | return 0; | |
293 | } | |
294 | ||
bd989ba3 JS |
295 | enum mod_log_op { |
296 | MOD_LOG_KEY_REPLACE, | |
297 | MOD_LOG_KEY_ADD, | |
298 | MOD_LOG_KEY_REMOVE, | |
299 | MOD_LOG_KEY_REMOVE_WHILE_FREEING, | |
300 | MOD_LOG_KEY_REMOVE_WHILE_MOVING, | |
301 | MOD_LOG_MOVE_KEYS, | |
302 | MOD_LOG_ROOT_REPLACE, | |
303 | }; | |
304 | ||
305 | struct tree_mod_move { | |
306 | int dst_slot; | |
307 | int nr_items; | |
308 | }; | |
309 | ||
310 | struct tree_mod_root { | |
311 | u64 logical; | |
312 | u8 level; | |
313 | }; | |
314 | ||
315 | struct tree_mod_elem { | |
316 | struct rb_node node; | |
317 | u64 index; /* shifted logical */ | |
097b8a7c | 318 | u64 seq; |
bd989ba3 JS |
319 | enum mod_log_op op; |
320 | ||
321 | /* this is used for MOD_LOG_KEY_* and MOD_LOG_MOVE_KEYS operations */ | |
322 | int slot; | |
323 | ||
324 | /* this is used for MOD_LOG_KEY* and MOD_LOG_ROOT_REPLACE */ | |
325 | u64 generation; | |
326 | ||
327 | /* those are used for op == MOD_LOG_KEY_{REPLACE,REMOVE} */ | |
328 | struct btrfs_disk_key key; | |
329 | u64 blockptr; | |
330 | ||
331 | /* this is used for op == MOD_LOG_MOVE_KEYS */ | |
332 | struct tree_mod_move move; | |
333 | ||
334 | /* this is used for op == MOD_LOG_ROOT_REPLACE */ | |
335 | struct tree_mod_root old_root; | |
336 | }; | |
337 | ||
097b8a7c | 338 | static inline void tree_mod_log_read_lock(struct btrfs_fs_info *fs_info) |
bd989ba3 | 339 | { |
097b8a7c | 340 | read_lock(&fs_info->tree_mod_log_lock); |
bd989ba3 JS |
341 | } |
342 | ||
097b8a7c JS |
343 | static inline void tree_mod_log_read_unlock(struct btrfs_fs_info *fs_info) |
344 | { | |
345 | read_unlock(&fs_info->tree_mod_log_lock); | |
346 | } | |
347 | ||
348 | static inline void tree_mod_log_write_lock(struct btrfs_fs_info *fs_info) | |
349 | { | |
350 | write_lock(&fs_info->tree_mod_log_lock); | |
351 | } | |
352 | ||
353 | static inline void tree_mod_log_write_unlock(struct btrfs_fs_info *fs_info) | |
354 | { | |
355 | write_unlock(&fs_info->tree_mod_log_lock); | |
356 | } | |
357 | ||
fc36ed7e JS |
358 | /* |
359 | * Increment the upper half of tree_mod_seq, set lower half zero. | |
360 | * | |
361 | * Must be called with fs_info->tree_mod_seq_lock held. | |
362 | */ | |
363 | static inline u64 btrfs_inc_tree_mod_seq_major(struct btrfs_fs_info *fs_info) | |
364 | { | |
365 | u64 seq = atomic64_read(&fs_info->tree_mod_seq); | |
366 | seq &= 0xffffffff00000000ull; | |
367 | seq += 1ull << 32; | |
368 | atomic64_set(&fs_info->tree_mod_seq, seq); | |
369 | return seq; | |
370 | } | |
371 | ||
372 | /* | |
373 | * Increment the lower half of tree_mod_seq. | |
374 | * | |
375 | * Must be called with fs_info->tree_mod_seq_lock held. The way major numbers | |
376 | * are generated should not technically require a spin lock here. (Rationale: | |
377 | * incrementing the minor while incrementing the major seq number is between its | |
378 | * atomic64_read and atomic64_set calls doesn't duplicate sequence numbers, it | |
379 | * just returns a unique sequence number as usual.) We have decided to leave | |
380 | * that requirement in here and rethink it once we notice it really imposes a | |
381 | * problem on some workload. | |
382 | */ | |
383 | static inline u64 btrfs_inc_tree_mod_seq_minor(struct btrfs_fs_info *fs_info) | |
384 | { | |
385 | return atomic64_inc_return(&fs_info->tree_mod_seq); | |
386 | } | |
387 | ||
388 | /* | |
389 | * return the last minor in the previous major tree_mod_seq number | |
390 | */ | |
391 | u64 btrfs_tree_mod_seq_prev(u64 seq) | |
392 | { | |
393 | return (seq & 0xffffffff00000000ull) - 1ull; | |
394 | } | |
395 | ||
097b8a7c JS |
396 | /* |
397 | * This adds a new blocker to the tree mod log's blocker list if the @elem | |
398 | * passed does not already have a sequence number set. So when a caller expects | |
399 | * to record tree modifications, it should ensure to set elem->seq to zero | |
400 | * before calling btrfs_get_tree_mod_seq. | |
401 | * Returns a fresh, unused tree log modification sequence number, even if no new | |
402 | * blocker was added. | |
403 | */ | |
404 | u64 btrfs_get_tree_mod_seq(struct btrfs_fs_info *fs_info, | |
405 | struct seq_list *elem) | |
bd989ba3 | 406 | { |
097b8a7c JS |
407 | u64 seq; |
408 | ||
409 | tree_mod_log_write_lock(fs_info); | |
bd989ba3 | 410 | spin_lock(&fs_info->tree_mod_seq_lock); |
097b8a7c | 411 | if (!elem->seq) { |
fc36ed7e | 412 | elem->seq = btrfs_inc_tree_mod_seq_major(fs_info); |
097b8a7c JS |
413 | list_add_tail(&elem->list, &fs_info->tree_mod_seq_list); |
414 | } | |
fc36ed7e | 415 | seq = btrfs_inc_tree_mod_seq_minor(fs_info); |
bd989ba3 | 416 | spin_unlock(&fs_info->tree_mod_seq_lock); |
097b8a7c JS |
417 | tree_mod_log_write_unlock(fs_info); |
418 | ||
419 | return seq; | |
bd989ba3 JS |
420 | } |
421 | ||
422 | void btrfs_put_tree_mod_seq(struct btrfs_fs_info *fs_info, | |
423 | struct seq_list *elem) | |
424 | { | |
425 | struct rb_root *tm_root; | |
426 | struct rb_node *node; | |
427 | struct rb_node *next; | |
428 | struct seq_list *cur_elem; | |
429 | struct tree_mod_elem *tm; | |
430 | u64 min_seq = (u64)-1; | |
431 | u64 seq_putting = elem->seq; | |
432 | ||
433 | if (!seq_putting) | |
434 | return; | |
435 | ||
bd989ba3 JS |
436 | spin_lock(&fs_info->tree_mod_seq_lock); |
437 | list_del(&elem->list); | |
097b8a7c | 438 | elem->seq = 0; |
bd989ba3 JS |
439 | |
440 | list_for_each_entry(cur_elem, &fs_info->tree_mod_seq_list, list) { | |
097b8a7c | 441 | if (cur_elem->seq < min_seq) { |
bd989ba3 JS |
442 | if (seq_putting > cur_elem->seq) { |
443 | /* | |
444 | * blocker with lower sequence number exists, we | |
445 | * cannot remove anything from the log | |
446 | */ | |
097b8a7c JS |
447 | spin_unlock(&fs_info->tree_mod_seq_lock); |
448 | return; | |
bd989ba3 JS |
449 | } |
450 | min_seq = cur_elem->seq; | |
451 | } | |
452 | } | |
097b8a7c JS |
453 | spin_unlock(&fs_info->tree_mod_seq_lock); |
454 | ||
bd989ba3 JS |
455 | /* |
456 | * anything that's lower than the lowest existing (read: blocked) | |
457 | * sequence number can be removed from the tree. | |
458 | */ | |
097b8a7c | 459 | tree_mod_log_write_lock(fs_info); |
bd989ba3 JS |
460 | tm_root = &fs_info->tree_mod_log; |
461 | for (node = rb_first(tm_root); node; node = next) { | |
462 | next = rb_next(node); | |
463 | tm = container_of(node, struct tree_mod_elem, node); | |
097b8a7c | 464 | if (tm->seq > min_seq) |
bd989ba3 JS |
465 | continue; |
466 | rb_erase(node, tm_root); | |
bd989ba3 JS |
467 | kfree(tm); |
468 | } | |
097b8a7c | 469 | tree_mod_log_write_unlock(fs_info); |
bd989ba3 JS |
470 | } |
471 | ||
472 | /* | |
473 | * key order of the log: | |
474 | * index -> sequence | |
475 | * | |
476 | * the index is the shifted logical of the *new* root node for root replace | |
477 | * operations, or the shifted logical of the affected block for all other | |
478 | * operations. | |
479 | */ | |
480 | static noinline int | |
481 | __tree_mod_log_insert(struct btrfs_fs_info *fs_info, struct tree_mod_elem *tm) | |
482 | { | |
483 | struct rb_root *tm_root; | |
484 | struct rb_node **new; | |
485 | struct rb_node *parent = NULL; | |
486 | struct tree_mod_elem *cur; | |
bd989ba3 | 487 | |
097b8a7c | 488 | BUG_ON(!tm || !tm->seq); |
bd989ba3 | 489 | |
bd989ba3 JS |
490 | tm_root = &fs_info->tree_mod_log; |
491 | new = &tm_root->rb_node; | |
492 | while (*new) { | |
493 | cur = container_of(*new, struct tree_mod_elem, node); | |
494 | parent = *new; | |
495 | if (cur->index < tm->index) | |
496 | new = &((*new)->rb_left); | |
497 | else if (cur->index > tm->index) | |
498 | new = &((*new)->rb_right); | |
097b8a7c | 499 | else if (cur->seq < tm->seq) |
bd989ba3 | 500 | new = &((*new)->rb_left); |
097b8a7c | 501 | else if (cur->seq > tm->seq) |
bd989ba3 JS |
502 | new = &((*new)->rb_right); |
503 | else { | |
504 | kfree(tm); | |
097b8a7c | 505 | return -EEXIST; |
bd989ba3 JS |
506 | } |
507 | } | |
508 | ||
509 | rb_link_node(&tm->node, parent, new); | |
510 | rb_insert_color(&tm->node, tm_root); | |
097b8a7c | 511 | return 0; |
bd989ba3 JS |
512 | } |
513 | ||
097b8a7c JS |
514 | /* |
515 | * Determines if logging can be omitted. Returns 1 if it can. Otherwise, it | |
516 | * returns zero with the tree_mod_log_lock acquired. The caller must hold | |
517 | * this until all tree mod log insertions are recorded in the rb tree and then | |
518 | * call tree_mod_log_write_unlock() to release. | |
519 | */ | |
e9b7fd4d JS |
520 | static inline int tree_mod_dont_log(struct btrfs_fs_info *fs_info, |
521 | struct extent_buffer *eb) { | |
522 | smp_mb(); | |
523 | if (list_empty(&(fs_info)->tree_mod_seq_list)) | |
524 | return 1; | |
097b8a7c JS |
525 | if (eb && btrfs_header_level(eb) == 0) |
526 | return 1; | |
527 | ||
528 | tree_mod_log_write_lock(fs_info); | |
529 | if (list_empty(&fs_info->tree_mod_seq_list)) { | |
530 | /* | |
531 | * someone emptied the list while we were waiting for the lock. | |
532 | * we must not add to the list when no blocker exists. | |
533 | */ | |
534 | tree_mod_log_write_unlock(fs_info); | |
e9b7fd4d | 535 | return 1; |
097b8a7c JS |
536 | } |
537 | ||
e9b7fd4d JS |
538 | return 0; |
539 | } | |
540 | ||
3310c36e | 541 | /* |
097b8a7c | 542 | * This allocates memory and gets a tree modification sequence number. |
3310c36e | 543 | * |
097b8a7c JS |
544 | * Returns <0 on error. |
545 | * Returns >0 (the added sequence number) on success. | |
3310c36e | 546 | */ |
926dd8a6 JS |
547 | static inline int tree_mod_alloc(struct btrfs_fs_info *fs_info, gfp_t flags, |
548 | struct tree_mod_elem **tm_ret) | |
bd989ba3 JS |
549 | { |
550 | struct tree_mod_elem *tm; | |
bd989ba3 | 551 | |
097b8a7c JS |
552 | /* |
553 | * once we switch from spin locks to something different, we should | |
554 | * honor the flags parameter here. | |
555 | */ | |
556 | tm = *tm_ret = kzalloc(sizeof(*tm), GFP_ATOMIC); | |
bd989ba3 JS |
557 | if (!tm) |
558 | return -ENOMEM; | |
559 | ||
fc36ed7e JS |
560 | spin_lock(&fs_info->tree_mod_seq_lock); |
561 | tm->seq = btrfs_inc_tree_mod_seq_minor(fs_info); | |
562 | spin_unlock(&fs_info->tree_mod_seq_lock); | |
563 | ||
097b8a7c | 564 | return tm->seq; |
bd989ba3 JS |
565 | } |
566 | ||
097b8a7c JS |
567 | static inline int |
568 | __tree_mod_log_insert_key(struct btrfs_fs_info *fs_info, | |
569 | struct extent_buffer *eb, int slot, | |
570 | enum mod_log_op op, gfp_t flags) | |
bd989ba3 | 571 | { |
bd989ba3 | 572 | int ret; |
097b8a7c | 573 | struct tree_mod_elem *tm; |
bd989ba3 JS |
574 | |
575 | ret = tree_mod_alloc(fs_info, flags, &tm); | |
097b8a7c | 576 | if (ret < 0) |
bd989ba3 JS |
577 | return ret; |
578 | ||
579 | tm->index = eb->start >> PAGE_CACHE_SHIFT; | |
580 | if (op != MOD_LOG_KEY_ADD) { | |
581 | btrfs_node_key(eb, &tm->key, slot); | |
582 | tm->blockptr = btrfs_node_blockptr(eb, slot); | |
583 | } | |
584 | tm->op = op; | |
585 | tm->slot = slot; | |
586 | tm->generation = btrfs_node_ptr_generation(eb, slot); | |
587 | ||
097b8a7c JS |
588 | return __tree_mod_log_insert(fs_info, tm); |
589 | } | |
590 | ||
591 | static noinline int | |
592 | tree_mod_log_insert_key_mask(struct btrfs_fs_info *fs_info, | |
593 | struct extent_buffer *eb, int slot, | |
594 | enum mod_log_op op, gfp_t flags) | |
595 | { | |
596 | int ret; | |
597 | ||
598 | if (tree_mod_dont_log(fs_info, eb)) | |
599 | return 0; | |
600 | ||
601 | ret = __tree_mod_log_insert_key(fs_info, eb, slot, op, flags); | |
602 | ||
603 | tree_mod_log_write_unlock(fs_info); | |
3310c36e | 604 | return ret; |
bd989ba3 JS |
605 | } |
606 | ||
607 | static noinline int | |
608 | tree_mod_log_insert_key(struct btrfs_fs_info *fs_info, struct extent_buffer *eb, | |
609 | int slot, enum mod_log_op op) | |
610 | { | |
611 | return tree_mod_log_insert_key_mask(fs_info, eb, slot, op, GFP_NOFS); | |
612 | } | |
613 | ||
097b8a7c JS |
614 | static noinline int |
615 | tree_mod_log_insert_key_locked(struct btrfs_fs_info *fs_info, | |
616 | struct extent_buffer *eb, int slot, | |
617 | enum mod_log_op op) | |
618 | { | |
619 | return __tree_mod_log_insert_key(fs_info, eb, slot, op, GFP_NOFS); | |
620 | } | |
621 | ||
bd989ba3 JS |
622 | static noinline int |
623 | tree_mod_log_insert_move(struct btrfs_fs_info *fs_info, | |
624 | struct extent_buffer *eb, int dst_slot, int src_slot, | |
625 | int nr_items, gfp_t flags) | |
626 | { | |
627 | struct tree_mod_elem *tm; | |
628 | int ret; | |
629 | int i; | |
630 | ||
f395694c JS |
631 | if (tree_mod_dont_log(fs_info, eb)) |
632 | return 0; | |
bd989ba3 | 633 | |
01763a2e JS |
634 | /* |
635 | * When we override something during the move, we log these removals. | |
636 | * This can only happen when we move towards the beginning of the | |
637 | * buffer, i.e. dst_slot < src_slot. | |
638 | */ | |
bd989ba3 | 639 | for (i = 0; i + dst_slot < src_slot && i < nr_items; i++) { |
097b8a7c | 640 | ret = tree_mod_log_insert_key_locked(fs_info, eb, i + dst_slot, |
bd989ba3 JS |
641 | MOD_LOG_KEY_REMOVE_WHILE_MOVING); |
642 | BUG_ON(ret < 0); | |
643 | } | |
644 | ||
f395694c | 645 | ret = tree_mod_alloc(fs_info, flags, &tm); |
097b8a7c JS |
646 | if (ret < 0) |
647 | goto out; | |
f395694c | 648 | |
bd989ba3 JS |
649 | tm->index = eb->start >> PAGE_CACHE_SHIFT; |
650 | tm->slot = src_slot; | |
651 | tm->move.dst_slot = dst_slot; | |
652 | tm->move.nr_items = nr_items; | |
653 | tm->op = MOD_LOG_MOVE_KEYS; | |
654 | ||
3310c36e | 655 | ret = __tree_mod_log_insert(fs_info, tm); |
097b8a7c JS |
656 | out: |
657 | tree_mod_log_write_unlock(fs_info); | |
3310c36e | 658 | return ret; |
bd989ba3 JS |
659 | } |
660 | ||
097b8a7c JS |
661 | static inline void |
662 | __tree_mod_log_free_eb(struct btrfs_fs_info *fs_info, struct extent_buffer *eb) | |
663 | { | |
664 | int i; | |
665 | u32 nritems; | |
666 | int ret; | |
667 | ||
b12a3b1e CM |
668 | if (btrfs_header_level(eb) == 0) |
669 | return; | |
670 | ||
097b8a7c JS |
671 | nritems = btrfs_header_nritems(eb); |
672 | for (i = nritems - 1; i >= 0; i--) { | |
673 | ret = tree_mod_log_insert_key_locked(fs_info, eb, i, | |
674 | MOD_LOG_KEY_REMOVE_WHILE_FREEING); | |
675 | BUG_ON(ret < 0); | |
676 | } | |
677 | } | |
678 | ||
bd989ba3 JS |
679 | static noinline int |
680 | tree_mod_log_insert_root(struct btrfs_fs_info *fs_info, | |
681 | struct extent_buffer *old_root, | |
90f8d62e JS |
682 | struct extent_buffer *new_root, gfp_t flags, |
683 | int log_removal) | |
bd989ba3 JS |
684 | { |
685 | struct tree_mod_elem *tm; | |
686 | int ret; | |
687 | ||
097b8a7c JS |
688 | if (tree_mod_dont_log(fs_info, NULL)) |
689 | return 0; | |
690 | ||
90f8d62e JS |
691 | if (log_removal) |
692 | __tree_mod_log_free_eb(fs_info, old_root); | |
d9abbf1c | 693 | |
bd989ba3 | 694 | ret = tree_mod_alloc(fs_info, flags, &tm); |
097b8a7c JS |
695 | if (ret < 0) |
696 | goto out; | |
bd989ba3 JS |
697 | |
698 | tm->index = new_root->start >> PAGE_CACHE_SHIFT; | |
699 | tm->old_root.logical = old_root->start; | |
700 | tm->old_root.level = btrfs_header_level(old_root); | |
701 | tm->generation = btrfs_header_generation(old_root); | |
702 | tm->op = MOD_LOG_ROOT_REPLACE; | |
703 | ||
3310c36e | 704 | ret = __tree_mod_log_insert(fs_info, tm); |
097b8a7c JS |
705 | out: |
706 | tree_mod_log_write_unlock(fs_info); | |
3310c36e | 707 | return ret; |
bd989ba3 JS |
708 | } |
709 | ||
710 | static struct tree_mod_elem * | |
711 | __tree_mod_log_search(struct btrfs_fs_info *fs_info, u64 start, u64 min_seq, | |
712 | int smallest) | |
713 | { | |
714 | struct rb_root *tm_root; | |
715 | struct rb_node *node; | |
716 | struct tree_mod_elem *cur = NULL; | |
717 | struct tree_mod_elem *found = NULL; | |
718 | u64 index = start >> PAGE_CACHE_SHIFT; | |
719 | ||
097b8a7c | 720 | tree_mod_log_read_lock(fs_info); |
bd989ba3 JS |
721 | tm_root = &fs_info->tree_mod_log; |
722 | node = tm_root->rb_node; | |
723 | while (node) { | |
724 | cur = container_of(node, struct tree_mod_elem, node); | |
725 | if (cur->index < index) { | |
726 | node = node->rb_left; | |
727 | } else if (cur->index > index) { | |
728 | node = node->rb_right; | |
097b8a7c | 729 | } else if (cur->seq < min_seq) { |
bd989ba3 JS |
730 | node = node->rb_left; |
731 | } else if (!smallest) { | |
732 | /* we want the node with the highest seq */ | |
733 | if (found) | |
097b8a7c | 734 | BUG_ON(found->seq > cur->seq); |
bd989ba3 JS |
735 | found = cur; |
736 | node = node->rb_left; | |
097b8a7c | 737 | } else if (cur->seq > min_seq) { |
bd989ba3 JS |
738 | /* we want the node with the smallest seq */ |
739 | if (found) | |
097b8a7c | 740 | BUG_ON(found->seq < cur->seq); |
bd989ba3 JS |
741 | found = cur; |
742 | node = node->rb_right; | |
743 | } else { | |
744 | found = cur; | |
745 | break; | |
746 | } | |
747 | } | |
097b8a7c | 748 | tree_mod_log_read_unlock(fs_info); |
bd989ba3 JS |
749 | |
750 | return found; | |
751 | } | |
752 | ||
753 | /* | |
754 | * this returns the element from the log with the smallest time sequence | |
755 | * value that's in the log (the oldest log item). any element with a time | |
756 | * sequence lower than min_seq will be ignored. | |
757 | */ | |
758 | static struct tree_mod_elem * | |
759 | tree_mod_log_search_oldest(struct btrfs_fs_info *fs_info, u64 start, | |
760 | u64 min_seq) | |
761 | { | |
762 | return __tree_mod_log_search(fs_info, start, min_seq, 1); | |
763 | } | |
764 | ||
765 | /* | |
766 | * this returns the element from the log with the largest time sequence | |
767 | * value that's in the log (the most recent log item). any element with | |
768 | * a time sequence lower than min_seq will be ignored. | |
769 | */ | |
770 | static struct tree_mod_elem * | |
771 | tree_mod_log_search(struct btrfs_fs_info *fs_info, u64 start, u64 min_seq) | |
772 | { | |
773 | return __tree_mod_log_search(fs_info, start, min_seq, 0); | |
774 | } | |
775 | ||
097b8a7c | 776 | static noinline void |
bd989ba3 JS |
777 | tree_mod_log_eb_copy(struct btrfs_fs_info *fs_info, struct extent_buffer *dst, |
778 | struct extent_buffer *src, unsigned long dst_offset, | |
90f8d62e | 779 | unsigned long src_offset, int nr_items) |
bd989ba3 JS |
780 | { |
781 | int ret; | |
782 | int i; | |
783 | ||
e9b7fd4d | 784 | if (tree_mod_dont_log(fs_info, NULL)) |
bd989ba3 JS |
785 | return; |
786 | ||
097b8a7c JS |
787 | if (btrfs_header_level(dst) == 0 && btrfs_header_level(src) == 0) { |
788 | tree_mod_log_write_unlock(fs_info); | |
bd989ba3 | 789 | return; |
097b8a7c | 790 | } |
bd989ba3 | 791 | |
bd989ba3 | 792 | for (i = 0; i < nr_items; i++) { |
90f8d62e JS |
793 | ret = tree_mod_log_insert_key_locked(fs_info, src, |
794 | i + src_offset, | |
795 | MOD_LOG_KEY_REMOVE); | |
796 | BUG_ON(ret < 0); | |
097b8a7c JS |
797 | ret = tree_mod_log_insert_key_locked(fs_info, dst, |
798 | i + dst_offset, | |
799 | MOD_LOG_KEY_ADD); | |
bd989ba3 JS |
800 | BUG_ON(ret < 0); |
801 | } | |
097b8a7c JS |
802 | |
803 | tree_mod_log_write_unlock(fs_info); | |
bd989ba3 JS |
804 | } |
805 | ||
806 | static inline void | |
807 | tree_mod_log_eb_move(struct btrfs_fs_info *fs_info, struct extent_buffer *dst, | |
808 | int dst_offset, int src_offset, int nr_items) | |
809 | { | |
810 | int ret; | |
811 | ret = tree_mod_log_insert_move(fs_info, dst, dst_offset, src_offset, | |
812 | nr_items, GFP_NOFS); | |
813 | BUG_ON(ret < 0); | |
814 | } | |
815 | ||
097b8a7c | 816 | static noinline void |
bd989ba3 | 817 | tree_mod_log_set_node_key(struct btrfs_fs_info *fs_info, |
32adf090 | 818 | struct extent_buffer *eb, int slot, int atomic) |
bd989ba3 JS |
819 | { |
820 | int ret; | |
821 | ||
822 | ret = tree_mod_log_insert_key_mask(fs_info, eb, slot, | |
823 | MOD_LOG_KEY_REPLACE, | |
824 | atomic ? GFP_ATOMIC : GFP_NOFS); | |
825 | BUG_ON(ret < 0); | |
826 | } | |
827 | ||
097b8a7c JS |
828 | static noinline void |
829 | tree_mod_log_free_eb(struct btrfs_fs_info *fs_info, struct extent_buffer *eb) | |
bd989ba3 | 830 | { |
e9b7fd4d | 831 | if (tree_mod_dont_log(fs_info, eb)) |
bd989ba3 JS |
832 | return; |
833 | ||
097b8a7c JS |
834 | __tree_mod_log_free_eb(fs_info, eb); |
835 | ||
836 | tree_mod_log_write_unlock(fs_info); | |
bd989ba3 JS |
837 | } |
838 | ||
097b8a7c | 839 | static noinline void |
bd989ba3 | 840 | tree_mod_log_set_root_pointer(struct btrfs_root *root, |
90f8d62e JS |
841 | struct extent_buffer *new_root_node, |
842 | int log_removal) | |
bd989ba3 JS |
843 | { |
844 | int ret; | |
bd989ba3 | 845 | ret = tree_mod_log_insert_root(root->fs_info, root->node, |
90f8d62e | 846 | new_root_node, GFP_NOFS, log_removal); |
bd989ba3 JS |
847 | BUG_ON(ret < 0); |
848 | } | |
849 | ||
5d4f98a2 YZ |
850 | /* |
851 | * check if the tree block can be shared by multiple trees | |
852 | */ | |
853 | int btrfs_block_can_be_shared(struct btrfs_root *root, | |
854 | struct extent_buffer *buf) | |
855 | { | |
856 | /* | |
857 | * Tree blocks not in refernece counted trees and tree roots | |
858 | * are never shared. If a block was allocated after the last | |
859 | * snapshot and the block was not allocated by tree relocation, | |
860 | * we know the block is not shared. | |
861 | */ | |
862 | if (root->ref_cows && | |
863 | buf != root->node && buf != root->commit_root && | |
864 | (btrfs_header_generation(buf) <= | |
865 | btrfs_root_last_snapshot(&root->root_item) || | |
866 | btrfs_header_flag(buf, BTRFS_HEADER_FLAG_RELOC))) | |
867 | return 1; | |
868 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
869 | if (root->ref_cows && | |
870 | btrfs_header_backref_rev(buf) < BTRFS_MIXED_BACKREF_REV) | |
871 | return 1; | |
872 | #endif | |
873 | return 0; | |
874 | } | |
875 | ||
876 | static noinline int update_ref_for_cow(struct btrfs_trans_handle *trans, | |
877 | struct btrfs_root *root, | |
878 | struct extent_buffer *buf, | |
f0486c68 YZ |
879 | struct extent_buffer *cow, |
880 | int *last_ref) | |
5d4f98a2 YZ |
881 | { |
882 | u64 refs; | |
883 | u64 owner; | |
884 | u64 flags; | |
885 | u64 new_flags = 0; | |
886 | int ret; | |
887 | ||
888 | /* | |
889 | * Backrefs update rules: | |
890 | * | |
891 | * Always use full backrefs for extent pointers in tree block | |
892 | * allocated by tree relocation. | |
893 | * | |
894 | * If a shared tree block is no longer referenced by its owner | |
895 | * tree (btrfs_header_owner(buf) == root->root_key.objectid), | |
896 | * use full backrefs for extent pointers in tree block. | |
897 | * | |
898 | * If a tree block is been relocating | |
899 | * (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID), | |
900 | * use full backrefs for extent pointers in tree block. | |
901 | * The reason for this is some operations (such as drop tree) | |
902 | * are only allowed for blocks use full backrefs. | |
903 | */ | |
904 | ||
905 | if (btrfs_block_can_be_shared(root, buf)) { | |
906 | ret = btrfs_lookup_extent_info(trans, root, buf->start, | |
3173a18f JB |
907 | btrfs_header_level(buf), 1, |
908 | &refs, &flags); | |
be1a5564 MF |
909 | if (ret) |
910 | return ret; | |
e5df9573 MF |
911 | if (refs == 0) { |
912 | ret = -EROFS; | |
913 | btrfs_std_error(root->fs_info, ret); | |
914 | return ret; | |
915 | } | |
5d4f98a2 YZ |
916 | } else { |
917 | refs = 1; | |
918 | if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID || | |
919 | btrfs_header_backref_rev(buf) < BTRFS_MIXED_BACKREF_REV) | |
920 | flags = BTRFS_BLOCK_FLAG_FULL_BACKREF; | |
921 | else | |
922 | flags = 0; | |
923 | } | |
924 | ||
925 | owner = btrfs_header_owner(buf); | |
926 | BUG_ON(owner == BTRFS_TREE_RELOC_OBJECTID && | |
927 | !(flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)); | |
928 | ||
929 | if (refs > 1) { | |
930 | if ((owner == root->root_key.objectid || | |
931 | root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) && | |
932 | !(flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) { | |
66d7e7f0 | 933 | ret = btrfs_inc_ref(trans, root, buf, 1, 1); |
79787eaa | 934 | BUG_ON(ret); /* -ENOMEM */ |
5d4f98a2 YZ |
935 | |
936 | if (root->root_key.objectid == | |
937 | BTRFS_TREE_RELOC_OBJECTID) { | |
66d7e7f0 | 938 | ret = btrfs_dec_ref(trans, root, buf, 0, 1); |
79787eaa | 939 | BUG_ON(ret); /* -ENOMEM */ |
66d7e7f0 | 940 | ret = btrfs_inc_ref(trans, root, cow, 1, 1); |
79787eaa | 941 | BUG_ON(ret); /* -ENOMEM */ |
5d4f98a2 YZ |
942 | } |
943 | new_flags |= BTRFS_BLOCK_FLAG_FULL_BACKREF; | |
944 | } else { | |
945 | ||
946 | if (root->root_key.objectid == | |
947 | BTRFS_TREE_RELOC_OBJECTID) | |
66d7e7f0 | 948 | ret = btrfs_inc_ref(trans, root, cow, 1, 1); |
5d4f98a2 | 949 | else |
66d7e7f0 | 950 | ret = btrfs_inc_ref(trans, root, cow, 0, 1); |
79787eaa | 951 | BUG_ON(ret); /* -ENOMEM */ |
5d4f98a2 YZ |
952 | } |
953 | if (new_flags != 0) { | |
954 | ret = btrfs_set_disk_extent_flags(trans, root, | |
955 | buf->start, | |
956 | buf->len, | |
957 | new_flags, 0); | |
be1a5564 MF |
958 | if (ret) |
959 | return ret; | |
5d4f98a2 YZ |
960 | } |
961 | } else { | |
962 | if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF) { | |
963 | if (root->root_key.objectid == | |
964 | BTRFS_TREE_RELOC_OBJECTID) | |
66d7e7f0 | 965 | ret = btrfs_inc_ref(trans, root, cow, 1, 1); |
5d4f98a2 | 966 | else |
66d7e7f0 | 967 | ret = btrfs_inc_ref(trans, root, cow, 0, 1); |
79787eaa | 968 | BUG_ON(ret); /* -ENOMEM */ |
66d7e7f0 | 969 | ret = btrfs_dec_ref(trans, root, buf, 1, 1); |
79787eaa | 970 | BUG_ON(ret); /* -ENOMEM */ |
5d4f98a2 YZ |
971 | } |
972 | clean_tree_block(trans, root, buf); | |
f0486c68 | 973 | *last_ref = 1; |
5d4f98a2 YZ |
974 | } |
975 | return 0; | |
976 | } | |
977 | ||
d352ac68 | 978 | /* |
d397712b CM |
979 | * does the dirty work in cow of a single block. The parent block (if |
980 | * supplied) is updated to point to the new cow copy. The new buffer is marked | |
981 | * dirty and returned locked. If you modify the block it needs to be marked | |
982 | * dirty again. | |
d352ac68 CM |
983 | * |
984 | * search_start -- an allocation hint for the new block | |
985 | * | |
d397712b CM |
986 | * empty_size -- a hint that you plan on doing more cow. This is the size in |
987 | * bytes the allocator should try to find free next to the block it returns. | |
988 | * This is just a hint and may be ignored by the allocator. | |
d352ac68 | 989 | */ |
d397712b | 990 | static noinline int __btrfs_cow_block(struct btrfs_trans_handle *trans, |
5f39d397 CM |
991 | struct btrfs_root *root, |
992 | struct extent_buffer *buf, | |
993 | struct extent_buffer *parent, int parent_slot, | |
994 | struct extent_buffer **cow_ret, | |
9fa8cfe7 | 995 | u64 search_start, u64 empty_size) |
02217ed2 | 996 | { |
5d4f98a2 | 997 | struct btrfs_disk_key disk_key; |
5f39d397 | 998 | struct extent_buffer *cow; |
be1a5564 | 999 | int level, ret; |
f0486c68 | 1000 | int last_ref = 0; |
925baedd | 1001 | int unlock_orig = 0; |
5d4f98a2 | 1002 | u64 parent_start; |
7bb86316 | 1003 | |
925baedd CM |
1004 | if (*cow_ret == buf) |
1005 | unlock_orig = 1; | |
1006 | ||
b9447ef8 | 1007 | btrfs_assert_tree_locked(buf); |
925baedd | 1008 | |
7bb86316 CM |
1009 | WARN_ON(root->ref_cows && trans->transid != |
1010 | root->fs_info->running_transaction->transid); | |
6702ed49 | 1011 | WARN_ON(root->ref_cows && trans->transid != root->last_trans); |
5f39d397 | 1012 | |
7bb86316 | 1013 | level = btrfs_header_level(buf); |
31840ae1 | 1014 | |
5d4f98a2 YZ |
1015 | if (level == 0) |
1016 | btrfs_item_key(buf, &disk_key, 0); | |
1017 | else | |
1018 | btrfs_node_key(buf, &disk_key, 0); | |
1019 | ||
1020 | if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { | |
1021 | if (parent) | |
1022 | parent_start = parent->start; | |
1023 | else | |
1024 | parent_start = 0; | |
1025 | } else | |
1026 | parent_start = 0; | |
1027 | ||
1028 | cow = btrfs_alloc_free_block(trans, root, buf->len, parent_start, | |
1029 | root->root_key.objectid, &disk_key, | |
5581a51a | 1030 | level, search_start, empty_size); |
54aa1f4d CM |
1031 | if (IS_ERR(cow)) |
1032 | return PTR_ERR(cow); | |
6702ed49 | 1033 | |
b4ce94de CM |
1034 | /* cow is set to blocking by btrfs_init_new_buffer */ |
1035 | ||
5f39d397 | 1036 | copy_extent_buffer(cow, buf, 0, 0, cow->len); |
db94535d | 1037 | btrfs_set_header_bytenr(cow, cow->start); |
5f39d397 | 1038 | btrfs_set_header_generation(cow, trans->transid); |
5d4f98a2 YZ |
1039 | btrfs_set_header_backref_rev(cow, BTRFS_MIXED_BACKREF_REV); |
1040 | btrfs_clear_header_flag(cow, BTRFS_HEADER_FLAG_WRITTEN | | |
1041 | BTRFS_HEADER_FLAG_RELOC); | |
1042 | if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) | |
1043 | btrfs_set_header_flag(cow, BTRFS_HEADER_FLAG_RELOC); | |
1044 | else | |
1045 | btrfs_set_header_owner(cow, root->root_key.objectid); | |
6702ed49 | 1046 | |
2b82032c YZ |
1047 | write_extent_buffer(cow, root->fs_info->fsid, |
1048 | (unsigned long)btrfs_header_fsid(cow), | |
1049 | BTRFS_FSID_SIZE); | |
1050 | ||
be1a5564 | 1051 | ret = update_ref_for_cow(trans, root, buf, cow, &last_ref); |
b68dc2a9 | 1052 | if (ret) { |
79787eaa | 1053 | btrfs_abort_transaction(trans, root, ret); |
b68dc2a9 MF |
1054 | return ret; |
1055 | } | |
1a40e23b | 1056 | |
3fd0a558 YZ |
1057 | if (root->ref_cows) |
1058 | btrfs_reloc_cow_block(trans, root, buf, cow); | |
1059 | ||
02217ed2 | 1060 | if (buf == root->node) { |
925baedd | 1061 | WARN_ON(parent && parent != buf); |
5d4f98a2 YZ |
1062 | if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID || |
1063 | btrfs_header_backref_rev(buf) < BTRFS_MIXED_BACKREF_REV) | |
1064 | parent_start = buf->start; | |
1065 | else | |
1066 | parent_start = 0; | |
925baedd | 1067 | |
5f39d397 | 1068 | extent_buffer_get(cow); |
90f8d62e | 1069 | tree_mod_log_set_root_pointer(root, cow, 1); |
240f62c8 | 1070 | rcu_assign_pointer(root->node, cow); |
925baedd | 1071 | |
f0486c68 | 1072 | btrfs_free_tree_block(trans, root, buf, parent_start, |
5581a51a | 1073 | last_ref); |
5f39d397 | 1074 | free_extent_buffer(buf); |
0b86a832 | 1075 | add_root_to_dirty_list(root); |
02217ed2 | 1076 | } else { |
5d4f98a2 YZ |
1077 | if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) |
1078 | parent_start = parent->start; | |
1079 | else | |
1080 | parent_start = 0; | |
1081 | ||
1082 | WARN_ON(trans->transid != btrfs_header_generation(parent)); | |
f230475e JS |
1083 | tree_mod_log_insert_key(root->fs_info, parent, parent_slot, |
1084 | MOD_LOG_KEY_REPLACE); | |
5f39d397 | 1085 | btrfs_set_node_blockptr(parent, parent_slot, |
db94535d | 1086 | cow->start); |
74493f7a CM |
1087 | btrfs_set_node_ptr_generation(parent, parent_slot, |
1088 | trans->transid); | |
d6025579 | 1089 | btrfs_mark_buffer_dirty(parent); |
d9abbf1c | 1090 | tree_mod_log_free_eb(root->fs_info, buf); |
f0486c68 | 1091 | btrfs_free_tree_block(trans, root, buf, parent_start, |
5581a51a | 1092 | last_ref); |
02217ed2 | 1093 | } |
925baedd CM |
1094 | if (unlock_orig) |
1095 | btrfs_tree_unlock(buf); | |
3083ee2e | 1096 | free_extent_buffer_stale(buf); |
ccd467d6 | 1097 | btrfs_mark_buffer_dirty(cow); |
2c90e5d6 | 1098 | *cow_ret = cow; |
02217ed2 CM |
1099 | return 0; |
1100 | } | |
1101 | ||
5d9e75c4 JS |
1102 | /* |
1103 | * returns the logical address of the oldest predecessor of the given root. | |
1104 | * entries older than time_seq are ignored. | |
1105 | */ | |
1106 | static struct tree_mod_elem * | |
1107 | __tree_mod_log_oldest_root(struct btrfs_fs_info *fs_info, | |
30b0463a | 1108 | struct extent_buffer *eb_root, u64 time_seq) |
5d9e75c4 JS |
1109 | { |
1110 | struct tree_mod_elem *tm; | |
1111 | struct tree_mod_elem *found = NULL; | |
30b0463a | 1112 | u64 root_logical = eb_root->start; |
5d9e75c4 JS |
1113 | int looped = 0; |
1114 | ||
1115 | if (!time_seq) | |
1116 | return 0; | |
1117 | ||
1118 | /* | |
1119 | * the very last operation that's logged for a root is the replacement | |
1120 | * operation (if it is replaced at all). this has the index of the *new* | |
1121 | * root, making it the very first operation that's logged for this root. | |
1122 | */ | |
1123 | while (1) { | |
1124 | tm = tree_mod_log_search_oldest(fs_info, root_logical, | |
1125 | time_seq); | |
1126 | if (!looped && !tm) | |
1127 | return 0; | |
1128 | /* | |
28da9fb4 JS |
1129 | * if there are no tree operation for the oldest root, we simply |
1130 | * return it. this should only happen if that (old) root is at | |
1131 | * level 0. | |
5d9e75c4 | 1132 | */ |
28da9fb4 JS |
1133 | if (!tm) |
1134 | break; | |
5d9e75c4 | 1135 | |
28da9fb4 JS |
1136 | /* |
1137 | * if there's an operation that's not a root replacement, we | |
1138 | * found the oldest version of our root. normally, we'll find a | |
1139 | * MOD_LOG_KEY_REMOVE_WHILE_FREEING operation here. | |
1140 | */ | |
5d9e75c4 JS |
1141 | if (tm->op != MOD_LOG_ROOT_REPLACE) |
1142 | break; | |
1143 | ||
1144 | found = tm; | |
1145 | root_logical = tm->old_root.logical; | |
5d9e75c4 JS |
1146 | looped = 1; |
1147 | } | |
1148 | ||
a95236d9 JS |
1149 | /* if there's no old root to return, return what we found instead */ |
1150 | if (!found) | |
1151 | found = tm; | |
1152 | ||
5d9e75c4 JS |
1153 | return found; |
1154 | } | |
1155 | ||
1156 | /* | |
1157 | * tm is a pointer to the first operation to rewind within eb. then, all | |
1158 | * previous operations will be rewinded (until we reach something older than | |
1159 | * time_seq). | |
1160 | */ | |
1161 | static void | |
1162 | __tree_mod_log_rewind(struct extent_buffer *eb, u64 time_seq, | |
1163 | struct tree_mod_elem *first_tm) | |
1164 | { | |
1165 | u32 n; | |
1166 | struct rb_node *next; | |
1167 | struct tree_mod_elem *tm = first_tm; | |
1168 | unsigned long o_dst; | |
1169 | unsigned long o_src; | |
1170 | unsigned long p_size = sizeof(struct btrfs_key_ptr); | |
1171 | ||
1172 | n = btrfs_header_nritems(eb); | |
097b8a7c | 1173 | while (tm && tm->seq >= time_seq) { |
5d9e75c4 JS |
1174 | /* |
1175 | * all the operations are recorded with the operator used for | |
1176 | * the modification. as we're going backwards, we do the | |
1177 | * opposite of each operation here. | |
1178 | */ | |
1179 | switch (tm->op) { | |
1180 | case MOD_LOG_KEY_REMOVE_WHILE_FREEING: | |
1181 | BUG_ON(tm->slot < n); | |
1c697d4a | 1182 | /* Fallthrough */ |
95c80bb1 | 1183 | case MOD_LOG_KEY_REMOVE_WHILE_MOVING: |
4c3e6969 | 1184 | case MOD_LOG_KEY_REMOVE: |
5d9e75c4 JS |
1185 | btrfs_set_node_key(eb, &tm->key, tm->slot); |
1186 | btrfs_set_node_blockptr(eb, tm->slot, tm->blockptr); | |
1187 | btrfs_set_node_ptr_generation(eb, tm->slot, | |
1188 | tm->generation); | |
4c3e6969 | 1189 | n++; |
5d9e75c4 JS |
1190 | break; |
1191 | case MOD_LOG_KEY_REPLACE: | |
1192 | BUG_ON(tm->slot >= n); | |
1193 | btrfs_set_node_key(eb, &tm->key, tm->slot); | |
1194 | btrfs_set_node_blockptr(eb, tm->slot, tm->blockptr); | |
1195 | btrfs_set_node_ptr_generation(eb, tm->slot, | |
1196 | tm->generation); | |
1197 | break; | |
1198 | case MOD_LOG_KEY_ADD: | |
19956c7e | 1199 | /* if a move operation is needed it's in the log */ |
5d9e75c4 JS |
1200 | n--; |
1201 | break; | |
1202 | case MOD_LOG_MOVE_KEYS: | |
c3193108 JS |
1203 | o_dst = btrfs_node_key_ptr_offset(tm->slot); |
1204 | o_src = btrfs_node_key_ptr_offset(tm->move.dst_slot); | |
1205 | memmove_extent_buffer(eb, o_dst, o_src, | |
5d9e75c4 JS |
1206 | tm->move.nr_items * p_size); |
1207 | break; | |
1208 | case MOD_LOG_ROOT_REPLACE: | |
1209 | /* | |
1210 | * this operation is special. for roots, this must be | |
1211 | * handled explicitly before rewinding. | |
1212 | * for non-roots, this operation may exist if the node | |
1213 | * was a root: root A -> child B; then A gets empty and | |
1214 | * B is promoted to the new root. in the mod log, we'll | |
1215 | * have a root-replace operation for B, a tree block | |
1216 | * that is no root. we simply ignore that operation. | |
1217 | */ | |
1218 | break; | |
1219 | } | |
1220 | next = rb_next(&tm->node); | |
1221 | if (!next) | |
1222 | break; | |
1223 | tm = container_of(next, struct tree_mod_elem, node); | |
1224 | if (tm->index != first_tm->index) | |
1225 | break; | |
1226 | } | |
1227 | btrfs_set_header_nritems(eb, n); | |
1228 | } | |
1229 | ||
47fb091f JS |
1230 | /* |
1231 | * Called with eb read locked. If the buffer cannot be rewinded, the same buffer | |
1232 | * is returned. If rewind operations happen, a fresh buffer is returned. The | |
1233 | * returned buffer is always read-locked. If the returned buffer is not the | |
1234 | * input buffer, the lock on the input buffer is released and the input buffer | |
1235 | * is freed (its refcount is decremented). | |
1236 | */ | |
5d9e75c4 JS |
1237 | static struct extent_buffer * |
1238 | tree_mod_log_rewind(struct btrfs_fs_info *fs_info, struct extent_buffer *eb, | |
1239 | u64 time_seq) | |
1240 | { | |
1241 | struct extent_buffer *eb_rewin; | |
1242 | struct tree_mod_elem *tm; | |
1243 | ||
1244 | if (!time_seq) | |
1245 | return eb; | |
1246 | ||
1247 | if (btrfs_header_level(eb) == 0) | |
1248 | return eb; | |
1249 | ||
1250 | tm = tree_mod_log_search(fs_info, eb->start, time_seq); | |
1251 | if (!tm) | |
1252 | return eb; | |
1253 | ||
1254 | if (tm->op == MOD_LOG_KEY_REMOVE_WHILE_FREEING) { | |
1255 | BUG_ON(tm->slot != 0); | |
1256 | eb_rewin = alloc_dummy_extent_buffer(eb->start, | |
1257 | fs_info->tree_root->nodesize); | |
1258 | BUG_ON(!eb_rewin); | |
1259 | btrfs_set_header_bytenr(eb_rewin, eb->start); | |
1260 | btrfs_set_header_backref_rev(eb_rewin, | |
1261 | btrfs_header_backref_rev(eb)); | |
1262 | btrfs_set_header_owner(eb_rewin, btrfs_header_owner(eb)); | |
c3193108 | 1263 | btrfs_set_header_level(eb_rewin, btrfs_header_level(eb)); |
5d9e75c4 JS |
1264 | } else { |
1265 | eb_rewin = btrfs_clone_extent_buffer(eb); | |
1266 | BUG_ON(!eb_rewin); | |
1267 | } | |
1268 | ||
1269 | extent_buffer_get(eb_rewin); | |
47fb091f | 1270 | btrfs_tree_read_unlock(eb); |
5d9e75c4 JS |
1271 | free_extent_buffer(eb); |
1272 | ||
47fb091f JS |
1273 | extent_buffer_get(eb_rewin); |
1274 | btrfs_tree_read_lock(eb_rewin); | |
5d9e75c4 | 1275 | __tree_mod_log_rewind(eb_rewin, time_seq, tm); |
57911b8b | 1276 | WARN_ON(btrfs_header_nritems(eb_rewin) > |
2a745b14 | 1277 | BTRFS_NODEPTRS_PER_BLOCK(fs_info->tree_root)); |
5d9e75c4 JS |
1278 | |
1279 | return eb_rewin; | |
1280 | } | |
1281 | ||
8ba97a15 JS |
1282 | /* |
1283 | * get_old_root() rewinds the state of @root's root node to the given @time_seq | |
1284 | * value. If there are no changes, the current root->root_node is returned. If | |
1285 | * anything changed in between, there's a fresh buffer allocated on which the | |
1286 | * rewind operations are done. In any case, the returned buffer is read locked. | |
1287 | * Returns NULL on error (with no locks held). | |
1288 | */ | |
5d9e75c4 JS |
1289 | static inline struct extent_buffer * |
1290 | get_old_root(struct btrfs_root *root, u64 time_seq) | |
1291 | { | |
1292 | struct tree_mod_elem *tm; | |
30b0463a JS |
1293 | struct extent_buffer *eb = NULL; |
1294 | struct extent_buffer *eb_root; | |
7bfdcf7f | 1295 | struct extent_buffer *old; |
a95236d9 | 1296 | struct tree_mod_root *old_root = NULL; |
4325edd0 | 1297 | u64 old_generation = 0; |
a95236d9 | 1298 | u64 logical; |
834328a8 | 1299 | u32 blocksize; |
5d9e75c4 | 1300 | |
30b0463a JS |
1301 | eb_root = btrfs_read_lock_root_node(root); |
1302 | tm = __tree_mod_log_oldest_root(root->fs_info, eb_root, time_seq); | |
5d9e75c4 | 1303 | if (!tm) |
30b0463a | 1304 | return eb_root; |
5d9e75c4 | 1305 | |
a95236d9 JS |
1306 | if (tm->op == MOD_LOG_ROOT_REPLACE) { |
1307 | old_root = &tm->old_root; | |
1308 | old_generation = tm->generation; | |
1309 | logical = old_root->logical; | |
1310 | } else { | |
30b0463a | 1311 | logical = eb_root->start; |
a95236d9 | 1312 | } |
5d9e75c4 | 1313 | |
a95236d9 | 1314 | tm = tree_mod_log_search(root->fs_info, logical, time_seq); |
834328a8 | 1315 | if (old_root && tm && tm->op != MOD_LOG_KEY_REMOVE_WHILE_FREEING) { |
30b0463a JS |
1316 | btrfs_tree_read_unlock(eb_root); |
1317 | free_extent_buffer(eb_root); | |
834328a8 | 1318 | blocksize = btrfs_level_size(root, old_root->level); |
7bfdcf7f | 1319 | old = read_tree_block(root, logical, blocksize, 0); |
416bc658 JB |
1320 | if (!old || !extent_buffer_uptodate(old)) { |
1321 | free_extent_buffer(old); | |
834328a8 JS |
1322 | pr_warn("btrfs: failed to read tree block %llu from get_old_root\n", |
1323 | logical); | |
1324 | WARN_ON(1); | |
1325 | } else { | |
7bfdcf7f LB |
1326 | eb = btrfs_clone_extent_buffer(old); |
1327 | free_extent_buffer(old); | |
834328a8 JS |
1328 | } |
1329 | } else if (old_root) { | |
30b0463a JS |
1330 | btrfs_tree_read_unlock(eb_root); |
1331 | free_extent_buffer(eb_root); | |
28da9fb4 | 1332 | eb = alloc_dummy_extent_buffer(logical, root->nodesize); |
834328a8 | 1333 | } else { |
30b0463a JS |
1334 | eb = btrfs_clone_extent_buffer(eb_root); |
1335 | btrfs_tree_read_unlock(eb_root); | |
1336 | free_extent_buffer(eb_root); | |
834328a8 JS |
1337 | } |
1338 | ||
8ba97a15 JS |
1339 | if (!eb) |
1340 | return NULL; | |
d6381084 | 1341 | extent_buffer_get(eb); |
8ba97a15 | 1342 | btrfs_tree_read_lock(eb); |
a95236d9 | 1343 | if (old_root) { |
5d9e75c4 JS |
1344 | btrfs_set_header_bytenr(eb, eb->start); |
1345 | btrfs_set_header_backref_rev(eb, BTRFS_MIXED_BACKREF_REV); | |
30b0463a | 1346 | btrfs_set_header_owner(eb, btrfs_header_owner(eb_root)); |
a95236d9 JS |
1347 | btrfs_set_header_level(eb, old_root->level); |
1348 | btrfs_set_header_generation(eb, old_generation); | |
5d9e75c4 | 1349 | } |
28da9fb4 JS |
1350 | if (tm) |
1351 | __tree_mod_log_rewind(eb, time_seq, tm); | |
1352 | else | |
1353 | WARN_ON(btrfs_header_level(eb) != 0); | |
57911b8b | 1354 | WARN_ON(btrfs_header_nritems(eb) > BTRFS_NODEPTRS_PER_BLOCK(root)); |
5d9e75c4 JS |
1355 | |
1356 | return eb; | |
1357 | } | |
1358 | ||
5b6602e7 JS |
1359 | int btrfs_old_root_level(struct btrfs_root *root, u64 time_seq) |
1360 | { | |
1361 | struct tree_mod_elem *tm; | |
1362 | int level; | |
30b0463a | 1363 | struct extent_buffer *eb_root = btrfs_root_node(root); |
5b6602e7 | 1364 | |
30b0463a | 1365 | tm = __tree_mod_log_oldest_root(root->fs_info, eb_root, time_seq); |
5b6602e7 JS |
1366 | if (tm && tm->op == MOD_LOG_ROOT_REPLACE) { |
1367 | level = tm->old_root.level; | |
1368 | } else { | |
30b0463a | 1369 | level = btrfs_header_level(eb_root); |
5b6602e7 | 1370 | } |
30b0463a | 1371 | free_extent_buffer(eb_root); |
5b6602e7 JS |
1372 | |
1373 | return level; | |
1374 | } | |
1375 | ||
5d4f98a2 YZ |
1376 | static inline int should_cow_block(struct btrfs_trans_handle *trans, |
1377 | struct btrfs_root *root, | |
1378 | struct extent_buffer *buf) | |
1379 | { | |
f1ebcc74 LB |
1380 | /* ensure we can see the force_cow */ |
1381 | smp_rmb(); | |
1382 | ||
1383 | /* | |
1384 | * We do not need to cow a block if | |
1385 | * 1) this block is not created or changed in this transaction; | |
1386 | * 2) this block does not belong to TREE_RELOC tree; | |
1387 | * 3) the root is not forced COW. | |
1388 | * | |
1389 | * What is forced COW: | |
1390 | * when we create snapshot during commiting the transaction, | |
1391 | * after we've finished coping src root, we must COW the shared | |
1392 | * block to ensure the metadata consistency. | |
1393 | */ | |
5d4f98a2 YZ |
1394 | if (btrfs_header_generation(buf) == trans->transid && |
1395 | !btrfs_header_flag(buf, BTRFS_HEADER_FLAG_WRITTEN) && | |
1396 | !(root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID && | |
f1ebcc74 LB |
1397 | btrfs_header_flag(buf, BTRFS_HEADER_FLAG_RELOC)) && |
1398 | !root->force_cow) | |
5d4f98a2 YZ |
1399 | return 0; |
1400 | return 1; | |
1401 | } | |
1402 | ||
d352ac68 CM |
1403 | /* |
1404 | * cows a single block, see __btrfs_cow_block for the real work. | |
1405 | * This version of it has extra checks so that a block isn't cow'd more than | |
1406 | * once per transaction, as long as it hasn't been written yet | |
1407 | */ | |
d397712b | 1408 | noinline int btrfs_cow_block(struct btrfs_trans_handle *trans, |
5f39d397 CM |
1409 | struct btrfs_root *root, struct extent_buffer *buf, |
1410 | struct extent_buffer *parent, int parent_slot, | |
9fa8cfe7 | 1411 | struct extent_buffer **cow_ret) |
6702ed49 CM |
1412 | { |
1413 | u64 search_start; | |
f510cfec | 1414 | int ret; |
dc17ff8f | 1415 | |
31b1a2bd JL |
1416 | if (trans->transaction != root->fs_info->running_transaction) |
1417 | WARN(1, KERN_CRIT "trans %llu running %llu\n", | |
d397712b CM |
1418 | (unsigned long long)trans->transid, |
1419 | (unsigned long long) | |
6702ed49 | 1420 | root->fs_info->running_transaction->transid); |
31b1a2bd JL |
1421 | |
1422 | if (trans->transid != root->fs_info->generation) | |
1423 | WARN(1, KERN_CRIT "trans %llu running %llu\n", | |
d397712b CM |
1424 | (unsigned long long)trans->transid, |
1425 | (unsigned long long)root->fs_info->generation); | |
dc17ff8f | 1426 | |
5d4f98a2 | 1427 | if (!should_cow_block(trans, root, buf)) { |
6702ed49 CM |
1428 | *cow_ret = buf; |
1429 | return 0; | |
1430 | } | |
c487685d | 1431 | |
0b86a832 | 1432 | search_start = buf->start & ~((u64)(1024 * 1024 * 1024) - 1); |
b4ce94de CM |
1433 | |
1434 | if (parent) | |
1435 | btrfs_set_lock_blocking(parent); | |
1436 | btrfs_set_lock_blocking(buf); | |
1437 | ||
f510cfec | 1438 | ret = __btrfs_cow_block(trans, root, buf, parent, |
9fa8cfe7 | 1439 | parent_slot, cow_ret, search_start, 0); |
1abe9b8a | 1440 | |
1441 | trace_btrfs_cow_block(root, buf, *cow_ret); | |
1442 | ||
f510cfec | 1443 | return ret; |
6702ed49 CM |
1444 | } |
1445 | ||
d352ac68 CM |
1446 | /* |
1447 | * helper function for defrag to decide if two blocks pointed to by a | |
1448 | * node are actually close by | |
1449 | */ | |
6b80053d | 1450 | static int close_blocks(u64 blocknr, u64 other, u32 blocksize) |
6702ed49 | 1451 | { |
6b80053d | 1452 | if (blocknr < other && other - (blocknr + blocksize) < 32768) |
6702ed49 | 1453 | return 1; |
6b80053d | 1454 | if (blocknr > other && blocknr - (other + blocksize) < 32768) |
6702ed49 CM |
1455 | return 1; |
1456 | return 0; | |
1457 | } | |
1458 | ||
081e9573 CM |
1459 | /* |
1460 | * compare two keys in a memcmp fashion | |
1461 | */ | |
1462 | static int comp_keys(struct btrfs_disk_key *disk, struct btrfs_key *k2) | |
1463 | { | |
1464 | struct btrfs_key k1; | |
1465 | ||
1466 | btrfs_disk_key_to_cpu(&k1, disk); | |
1467 | ||
20736aba | 1468 | return btrfs_comp_cpu_keys(&k1, k2); |
081e9573 CM |
1469 | } |
1470 | ||
f3465ca4 JB |
1471 | /* |
1472 | * same as comp_keys only with two btrfs_key's | |
1473 | */ | |
5d4f98a2 | 1474 | int btrfs_comp_cpu_keys(struct btrfs_key *k1, struct btrfs_key *k2) |
f3465ca4 JB |
1475 | { |
1476 | if (k1->objectid > k2->objectid) | |
1477 | return 1; | |
1478 | if (k1->objectid < k2->objectid) | |
1479 | return -1; | |
1480 | if (k1->type > k2->type) | |
1481 | return 1; | |
1482 | if (k1->type < k2->type) | |
1483 | return -1; | |
1484 | if (k1->offset > k2->offset) | |
1485 | return 1; | |
1486 | if (k1->offset < k2->offset) | |
1487 | return -1; | |
1488 | return 0; | |
1489 | } | |
081e9573 | 1490 | |
d352ac68 CM |
1491 | /* |
1492 | * this is used by the defrag code to go through all the | |
1493 | * leaves pointed to by a node and reallocate them so that | |
1494 | * disk order is close to key order | |
1495 | */ | |
6702ed49 | 1496 | int btrfs_realloc_node(struct btrfs_trans_handle *trans, |
5f39d397 | 1497 | struct btrfs_root *root, struct extent_buffer *parent, |
de78b51a | 1498 | int start_slot, u64 *last_ret, |
a6b6e75e | 1499 | struct btrfs_key *progress) |
6702ed49 | 1500 | { |
6b80053d | 1501 | struct extent_buffer *cur; |
6702ed49 | 1502 | u64 blocknr; |
ca7a79ad | 1503 | u64 gen; |
e9d0b13b CM |
1504 | u64 search_start = *last_ret; |
1505 | u64 last_block = 0; | |
6702ed49 CM |
1506 | u64 other; |
1507 | u32 parent_nritems; | |
6702ed49 CM |
1508 | int end_slot; |
1509 | int i; | |
1510 | int err = 0; | |
f2183bde | 1511 | int parent_level; |
6b80053d CM |
1512 | int uptodate; |
1513 | u32 blocksize; | |
081e9573 CM |
1514 | int progress_passed = 0; |
1515 | struct btrfs_disk_key disk_key; | |
6702ed49 | 1516 | |
5708b959 | 1517 | parent_level = btrfs_header_level(parent); |
5708b959 | 1518 | |
6c1500f2 JL |
1519 | WARN_ON(trans->transaction != root->fs_info->running_transaction); |
1520 | WARN_ON(trans->transid != root->fs_info->generation); | |
86479a04 | 1521 | |
6b80053d | 1522 | parent_nritems = btrfs_header_nritems(parent); |
6b80053d | 1523 | blocksize = btrfs_level_size(root, parent_level - 1); |
6702ed49 CM |
1524 | end_slot = parent_nritems; |
1525 | ||
1526 | if (parent_nritems == 1) | |
1527 | return 0; | |
1528 | ||
b4ce94de CM |
1529 | btrfs_set_lock_blocking(parent); |
1530 | ||
6702ed49 CM |
1531 | for (i = start_slot; i < end_slot; i++) { |
1532 | int close = 1; | |
a6b6e75e | 1533 | |
081e9573 CM |
1534 | btrfs_node_key(parent, &disk_key, i); |
1535 | if (!progress_passed && comp_keys(&disk_key, progress) < 0) | |
1536 | continue; | |
1537 | ||
1538 | progress_passed = 1; | |
6b80053d | 1539 | blocknr = btrfs_node_blockptr(parent, i); |
ca7a79ad | 1540 | gen = btrfs_node_ptr_generation(parent, i); |
e9d0b13b CM |
1541 | if (last_block == 0) |
1542 | last_block = blocknr; | |
5708b959 | 1543 | |
6702ed49 | 1544 | if (i > 0) { |
6b80053d CM |
1545 | other = btrfs_node_blockptr(parent, i - 1); |
1546 | close = close_blocks(blocknr, other, blocksize); | |
6702ed49 | 1547 | } |
0ef3e66b | 1548 | if (!close && i < end_slot - 2) { |
6b80053d CM |
1549 | other = btrfs_node_blockptr(parent, i + 1); |
1550 | close = close_blocks(blocknr, other, blocksize); | |
6702ed49 | 1551 | } |
e9d0b13b CM |
1552 | if (close) { |
1553 | last_block = blocknr; | |
6702ed49 | 1554 | continue; |
e9d0b13b | 1555 | } |
6702ed49 | 1556 | |
6b80053d CM |
1557 | cur = btrfs_find_tree_block(root, blocknr, blocksize); |
1558 | if (cur) | |
b9fab919 | 1559 | uptodate = btrfs_buffer_uptodate(cur, gen, 0); |
6b80053d CM |
1560 | else |
1561 | uptodate = 0; | |
5708b959 | 1562 | if (!cur || !uptodate) { |
6b80053d CM |
1563 | if (!cur) { |
1564 | cur = read_tree_block(root, blocknr, | |
ca7a79ad | 1565 | blocksize, gen); |
416bc658 JB |
1566 | if (!cur || !extent_buffer_uptodate(cur)) { |
1567 | free_extent_buffer(cur); | |
97d9a8a4 | 1568 | return -EIO; |
416bc658 | 1569 | } |
6b80053d | 1570 | } else if (!uptodate) { |
018642a1 TI |
1571 | err = btrfs_read_buffer(cur, gen); |
1572 | if (err) { | |
1573 | free_extent_buffer(cur); | |
1574 | return err; | |
1575 | } | |
f2183bde | 1576 | } |
6702ed49 | 1577 | } |
e9d0b13b | 1578 | if (search_start == 0) |
6b80053d | 1579 | search_start = last_block; |
e9d0b13b | 1580 | |
e7a84565 | 1581 | btrfs_tree_lock(cur); |
b4ce94de | 1582 | btrfs_set_lock_blocking(cur); |
6b80053d | 1583 | err = __btrfs_cow_block(trans, root, cur, parent, i, |
e7a84565 | 1584 | &cur, search_start, |
6b80053d | 1585 | min(16 * blocksize, |
9fa8cfe7 | 1586 | (end_slot - i) * blocksize)); |
252c38f0 | 1587 | if (err) { |
e7a84565 | 1588 | btrfs_tree_unlock(cur); |
6b80053d | 1589 | free_extent_buffer(cur); |
6702ed49 | 1590 | break; |
252c38f0 | 1591 | } |
e7a84565 CM |
1592 | search_start = cur->start; |
1593 | last_block = cur->start; | |
f2183bde | 1594 | *last_ret = search_start; |
e7a84565 CM |
1595 | btrfs_tree_unlock(cur); |
1596 | free_extent_buffer(cur); | |
6702ed49 CM |
1597 | } |
1598 | return err; | |
1599 | } | |
1600 | ||
74123bd7 CM |
1601 | /* |
1602 | * The leaf data grows from end-to-front in the node. | |
1603 | * this returns the address of the start of the last item, | |
1604 | * which is the stop of the leaf data stack | |
1605 | */ | |
123abc88 | 1606 | static inline unsigned int leaf_data_end(struct btrfs_root *root, |
5f39d397 | 1607 | struct extent_buffer *leaf) |
be0e5c09 | 1608 | { |
5f39d397 | 1609 | u32 nr = btrfs_header_nritems(leaf); |
be0e5c09 | 1610 | if (nr == 0) |
123abc88 | 1611 | return BTRFS_LEAF_DATA_SIZE(root); |
5f39d397 | 1612 | return btrfs_item_offset_nr(leaf, nr - 1); |
be0e5c09 CM |
1613 | } |
1614 | ||
aa5d6bed | 1615 | |
74123bd7 | 1616 | /* |
5f39d397 CM |
1617 | * search for key in the extent_buffer. The items start at offset p, |
1618 | * and they are item_size apart. There are 'max' items in p. | |
1619 | * | |
74123bd7 CM |
1620 | * the slot in the array is returned via slot, and it points to |
1621 | * the place where you would insert key if it is not found in | |
1622 | * the array. | |
1623 | * | |
1624 | * slot may point to max if the key is bigger than all of the keys | |
1625 | */ | |
e02119d5 CM |
1626 | static noinline int generic_bin_search(struct extent_buffer *eb, |
1627 | unsigned long p, | |
1628 | int item_size, struct btrfs_key *key, | |
1629 | int max, int *slot) | |
be0e5c09 CM |
1630 | { |
1631 | int low = 0; | |
1632 | int high = max; | |
1633 | int mid; | |
1634 | int ret; | |
479965d6 | 1635 | struct btrfs_disk_key *tmp = NULL; |
5f39d397 CM |
1636 | struct btrfs_disk_key unaligned; |
1637 | unsigned long offset; | |
5f39d397 CM |
1638 | char *kaddr = NULL; |
1639 | unsigned long map_start = 0; | |
1640 | unsigned long map_len = 0; | |
479965d6 | 1641 | int err; |
be0e5c09 | 1642 | |
d397712b | 1643 | while (low < high) { |
be0e5c09 | 1644 | mid = (low + high) / 2; |
5f39d397 CM |
1645 | offset = p + mid * item_size; |
1646 | ||
a6591715 | 1647 | if (!kaddr || offset < map_start || |
5f39d397 CM |
1648 | (offset + sizeof(struct btrfs_disk_key)) > |
1649 | map_start + map_len) { | |
934d375b CM |
1650 | |
1651 | err = map_private_extent_buffer(eb, offset, | |
479965d6 | 1652 | sizeof(struct btrfs_disk_key), |
a6591715 | 1653 | &kaddr, &map_start, &map_len); |
479965d6 CM |
1654 | |
1655 | if (!err) { | |
1656 | tmp = (struct btrfs_disk_key *)(kaddr + offset - | |
1657 | map_start); | |
1658 | } else { | |
1659 | read_extent_buffer(eb, &unaligned, | |
1660 | offset, sizeof(unaligned)); | |
1661 | tmp = &unaligned; | |
1662 | } | |
5f39d397 | 1663 | |
5f39d397 CM |
1664 | } else { |
1665 | tmp = (struct btrfs_disk_key *)(kaddr + offset - | |
1666 | map_start); | |
1667 | } | |
be0e5c09 CM |
1668 | ret = comp_keys(tmp, key); |
1669 | ||
1670 | if (ret < 0) | |
1671 | low = mid + 1; | |
1672 | else if (ret > 0) | |
1673 | high = mid; | |
1674 | else { | |
1675 | *slot = mid; | |
1676 | return 0; | |
1677 | } | |
1678 | } | |
1679 | *slot = low; | |
1680 | return 1; | |
1681 | } | |
1682 | ||
97571fd0 CM |
1683 | /* |
1684 | * simple bin_search frontend that does the right thing for | |
1685 | * leaves vs nodes | |
1686 | */ | |
5f39d397 CM |
1687 | static int bin_search(struct extent_buffer *eb, struct btrfs_key *key, |
1688 | int level, int *slot) | |
be0e5c09 | 1689 | { |
f775738f | 1690 | if (level == 0) |
5f39d397 CM |
1691 | return generic_bin_search(eb, |
1692 | offsetof(struct btrfs_leaf, items), | |
0783fcfc | 1693 | sizeof(struct btrfs_item), |
5f39d397 | 1694 | key, btrfs_header_nritems(eb), |
7518a238 | 1695 | slot); |
f775738f | 1696 | else |
5f39d397 CM |
1697 | return generic_bin_search(eb, |
1698 | offsetof(struct btrfs_node, ptrs), | |
123abc88 | 1699 | sizeof(struct btrfs_key_ptr), |
5f39d397 | 1700 | key, btrfs_header_nritems(eb), |
7518a238 | 1701 | slot); |
be0e5c09 CM |
1702 | } |
1703 | ||
5d4f98a2 YZ |
1704 | int btrfs_bin_search(struct extent_buffer *eb, struct btrfs_key *key, |
1705 | int level, int *slot) | |
1706 | { | |
1707 | return bin_search(eb, key, level, slot); | |
1708 | } | |
1709 | ||
f0486c68 YZ |
1710 | static void root_add_used(struct btrfs_root *root, u32 size) |
1711 | { | |
1712 | spin_lock(&root->accounting_lock); | |
1713 | btrfs_set_root_used(&root->root_item, | |
1714 | btrfs_root_used(&root->root_item) + size); | |
1715 | spin_unlock(&root->accounting_lock); | |
1716 | } | |
1717 | ||
1718 | static void root_sub_used(struct btrfs_root *root, u32 size) | |
1719 | { | |
1720 | spin_lock(&root->accounting_lock); | |
1721 | btrfs_set_root_used(&root->root_item, | |
1722 | btrfs_root_used(&root->root_item) - size); | |
1723 | spin_unlock(&root->accounting_lock); | |
1724 | } | |
1725 | ||
d352ac68 CM |
1726 | /* given a node and slot number, this reads the blocks it points to. The |
1727 | * extent buffer is returned with a reference taken (but unlocked). | |
1728 | * NULL is returned on error. | |
1729 | */ | |
e02119d5 | 1730 | static noinline struct extent_buffer *read_node_slot(struct btrfs_root *root, |
5f39d397 | 1731 | struct extent_buffer *parent, int slot) |
bb803951 | 1732 | { |
ca7a79ad | 1733 | int level = btrfs_header_level(parent); |
416bc658 JB |
1734 | struct extent_buffer *eb; |
1735 | ||
bb803951 CM |
1736 | if (slot < 0) |
1737 | return NULL; | |
5f39d397 | 1738 | if (slot >= btrfs_header_nritems(parent)) |
bb803951 | 1739 | return NULL; |
ca7a79ad CM |
1740 | |
1741 | BUG_ON(level == 0); | |
1742 | ||
416bc658 JB |
1743 | eb = read_tree_block(root, btrfs_node_blockptr(parent, slot), |
1744 | btrfs_level_size(root, level - 1), | |
1745 | btrfs_node_ptr_generation(parent, slot)); | |
1746 | if (eb && !extent_buffer_uptodate(eb)) { | |
1747 | free_extent_buffer(eb); | |
1748 | eb = NULL; | |
1749 | } | |
1750 | ||
1751 | return eb; | |
bb803951 CM |
1752 | } |
1753 | ||
d352ac68 CM |
1754 | /* |
1755 | * node level balancing, used to make sure nodes are in proper order for | |
1756 | * item deletion. We balance from the top down, so we have to make sure | |
1757 | * that a deletion won't leave an node completely empty later on. | |
1758 | */ | |
e02119d5 | 1759 | static noinline int balance_level(struct btrfs_trans_handle *trans, |
98ed5174 CM |
1760 | struct btrfs_root *root, |
1761 | struct btrfs_path *path, int level) | |
bb803951 | 1762 | { |
5f39d397 CM |
1763 | struct extent_buffer *right = NULL; |
1764 | struct extent_buffer *mid; | |
1765 | struct extent_buffer *left = NULL; | |
1766 | struct extent_buffer *parent = NULL; | |
bb803951 CM |
1767 | int ret = 0; |
1768 | int wret; | |
1769 | int pslot; | |
bb803951 | 1770 | int orig_slot = path->slots[level]; |
79f95c82 | 1771 | u64 orig_ptr; |
bb803951 CM |
1772 | |
1773 | if (level == 0) | |
1774 | return 0; | |
1775 | ||
5f39d397 | 1776 | mid = path->nodes[level]; |
b4ce94de | 1777 | |
bd681513 CM |
1778 | WARN_ON(path->locks[level] != BTRFS_WRITE_LOCK && |
1779 | path->locks[level] != BTRFS_WRITE_LOCK_BLOCKING); | |
7bb86316 CM |
1780 | WARN_ON(btrfs_header_generation(mid) != trans->transid); |
1781 | ||
1d4f8a0c | 1782 | orig_ptr = btrfs_node_blockptr(mid, orig_slot); |
79f95c82 | 1783 | |
a05a9bb1 | 1784 | if (level < BTRFS_MAX_LEVEL - 1) { |
5f39d397 | 1785 | parent = path->nodes[level + 1]; |
a05a9bb1 LZ |
1786 | pslot = path->slots[level + 1]; |
1787 | } | |
bb803951 | 1788 | |
40689478 CM |
1789 | /* |
1790 | * deal with the case where there is only one pointer in the root | |
1791 | * by promoting the node below to a root | |
1792 | */ | |
5f39d397 CM |
1793 | if (!parent) { |
1794 | struct extent_buffer *child; | |
bb803951 | 1795 | |
5f39d397 | 1796 | if (btrfs_header_nritems(mid) != 1) |
bb803951 CM |
1797 | return 0; |
1798 | ||
1799 | /* promote the child to a root */ | |
5f39d397 | 1800 | child = read_node_slot(root, mid, 0); |
305a26af MF |
1801 | if (!child) { |
1802 | ret = -EROFS; | |
1803 | btrfs_std_error(root->fs_info, ret); | |
1804 | goto enospc; | |
1805 | } | |
1806 | ||
925baedd | 1807 | btrfs_tree_lock(child); |
b4ce94de | 1808 | btrfs_set_lock_blocking(child); |
9fa8cfe7 | 1809 | ret = btrfs_cow_block(trans, root, child, mid, 0, &child); |
f0486c68 YZ |
1810 | if (ret) { |
1811 | btrfs_tree_unlock(child); | |
1812 | free_extent_buffer(child); | |
1813 | goto enospc; | |
1814 | } | |
2f375ab9 | 1815 | |
90f8d62e | 1816 | tree_mod_log_set_root_pointer(root, child, 1); |
240f62c8 | 1817 | rcu_assign_pointer(root->node, child); |
925baedd | 1818 | |
0b86a832 | 1819 | add_root_to_dirty_list(root); |
925baedd | 1820 | btrfs_tree_unlock(child); |
b4ce94de | 1821 | |
925baedd | 1822 | path->locks[level] = 0; |
bb803951 | 1823 | path->nodes[level] = NULL; |
5f39d397 | 1824 | clean_tree_block(trans, root, mid); |
925baedd | 1825 | btrfs_tree_unlock(mid); |
bb803951 | 1826 | /* once for the path */ |
5f39d397 | 1827 | free_extent_buffer(mid); |
f0486c68 YZ |
1828 | |
1829 | root_sub_used(root, mid->len); | |
5581a51a | 1830 | btrfs_free_tree_block(trans, root, mid, 0, 1); |
bb803951 | 1831 | /* once for the root ptr */ |
3083ee2e | 1832 | free_extent_buffer_stale(mid); |
f0486c68 | 1833 | return 0; |
bb803951 | 1834 | } |
5f39d397 | 1835 | if (btrfs_header_nritems(mid) > |
123abc88 | 1836 | BTRFS_NODEPTRS_PER_BLOCK(root) / 4) |
bb803951 CM |
1837 | return 0; |
1838 | ||
5f39d397 CM |
1839 | left = read_node_slot(root, parent, pslot - 1); |
1840 | if (left) { | |
925baedd | 1841 | btrfs_tree_lock(left); |
b4ce94de | 1842 | btrfs_set_lock_blocking(left); |
5f39d397 | 1843 | wret = btrfs_cow_block(trans, root, left, |
9fa8cfe7 | 1844 | parent, pslot - 1, &left); |
54aa1f4d CM |
1845 | if (wret) { |
1846 | ret = wret; | |
1847 | goto enospc; | |
1848 | } | |
2cc58cf2 | 1849 | } |
5f39d397 CM |
1850 | right = read_node_slot(root, parent, pslot + 1); |
1851 | if (right) { | |
925baedd | 1852 | btrfs_tree_lock(right); |
b4ce94de | 1853 | btrfs_set_lock_blocking(right); |
5f39d397 | 1854 | wret = btrfs_cow_block(trans, root, right, |
9fa8cfe7 | 1855 | parent, pslot + 1, &right); |
2cc58cf2 CM |
1856 | if (wret) { |
1857 | ret = wret; | |
1858 | goto enospc; | |
1859 | } | |
1860 | } | |
1861 | ||
1862 | /* first, try to make some room in the middle buffer */ | |
5f39d397 CM |
1863 | if (left) { |
1864 | orig_slot += btrfs_header_nritems(left); | |
bce4eae9 | 1865 | wret = push_node_left(trans, root, left, mid, 1); |
79f95c82 CM |
1866 | if (wret < 0) |
1867 | ret = wret; | |
bb803951 | 1868 | } |
79f95c82 CM |
1869 | |
1870 | /* | |
1871 | * then try to empty the right most buffer into the middle | |
1872 | */ | |
5f39d397 | 1873 | if (right) { |
971a1f66 | 1874 | wret = push_node_left(trans, root, mid, right, 1); |
54aa1f4d | 1875 | if (wret < 0 && wret != -ENOSPC) |
79f95c82 | 1876 | ret = wret; |
5f39d397 | 1877 | if (btrfs_header_nritems(right) == 0) { |
5f39d397 | 1878 | clean_tree_block(trans, root, right); |
925baedd | 1879 | btrfs_tree_unlock(right); |
afe5fea7 | 1880 | del_ptr(root, path, level + 1, pslot + 1); |
f0486c68 | 1881 | root_sub_used(root, right->len); |
5581a51a | 1882 | btrfs_free_tree_block(trans, root, right, 0, 1); |
3083ee2e | 1883 | free_extent_buffer_stale(right); |
f0486c68 | 1884 | right = NULL; |
bb803951 | 1885 | } else { |
5f39d397 CM |
1886 | struct btrfs_disk_key right_key; |
1887 | btrfs_node_key(right, &right_key, 0); | |
f230475e | 1888 | tree_mod_log_set_node_key(root->fs_info, parent, |
32adf090 | 1889 | pslot + 1, 0); |
5f39d397 CM |
1890 | btrfs_set_node_key(parent, &right_key, pslot + 1); |
1891 | btrfs_mark_buffer_dirty(parent); | |
bb803951 CM |
1892 | } |
1893 | } | |
5f39d397 | 1894 | if (btrfs_header_nritems(mid) == 1) { |
79f95c82 CM |
1895 | /* |
1896 | * we're not allowed to leave a node with one item in the | |
1897 | * tree during a delete. A deletion from lower in the tree | |
1898 | * could try to delete the only pointer in this node. | |
1899 | * So, pull some keys from the left. | |
1900 | * There has to be a left pointer at this point because | |
1901 | * otherwise we would have pulled some pointers from the | |
1902 | * right | |
1903 | */ | |
305a26af MF |
1904 | if (!left) { |
1905 | ret = -EROFS; | |
1906 | btrfs_std_error(root->fs_info, ret); | |
1907 | goto enospc; | |
1908 | } | |
5f39d397 | 1909 | wret = balance_node_right(trans, root, mid, left); |
54aa1f4d | 1910 | if (wret < 0) { |
79f95c82 | 1911 | ret = wret; |
54aa1f4d CM |
1912 | goto enospc; |
1913 | } | |
bce4eae9 CM |
1914 | if (wret == 1) { |
1915 | wret = push_node_left(trans, root, left, mid, 1); | |
1916 | if (wret < 0) | |
1917 | ret = wret; | |
1918 | } | |
79f95c82 CM |
1919 | BUG_ON(wret == 1); |
1920 | } | |
5f39d397 | 1921 | if (btrfs_header_nritems(mid) == 0) { |
5f39d397 | 1922 | clean_tree_block(trans, root, mid); |
925baedd | 1923 | btrfs_tree_unlock(mid); |
afe5fea7 | 1924 | del_ptr(root, path, level + 1, pslot); |
f0486c68 | 1925 | root_sub_used(root, mid->len); |
5581a51a | 1926 | btrfs_free_tree_block(trans, root, mid, 0, 1); |
3083ee2e | 1927 | free_extent_buffer_stale(mid); |
f0486c68 | 1928 | mid = NULL; |
79f95c82 CM |
1929 | } else { |
1930 | /* update the parent key to reflect our changes */ | |
5f39d397 CM |
1931 | struct btrfs_disk_key mid_key; |
1932 | btrfs_node_key(mid, &mid_key, 0); | |
32adf090 | 1933 | tree_mod_log_set_node_key(root->fs_info, parent, |
f230475e | 1934 | pslot, 0); |
5f39d397 CM |
1935 | btrfs_set_node_key(parent, &mid_key, pslot); |
1936 | btrfs_mark_buffer_dirty(parent); | |
79f95c82 | 1937 | } |
bb803951 | 1938 | |
79f95c82 | 1939 | /* update the path */ |
5f39d397 CM |
1940 | if (left) { |
1941 | if (btrfs_header_nritems(left) > orig_slot) { | |
1942 | extent_buffer_get(left); | |
925baedd | 1943 | /* left was locked after cow */ |
5f39d397 | 1944 | path->nodes[level] = left; |
bb803951 CM |
1945 | path->slots[level + 1] -= 1; |
1946 | path->slots[level] = orig_slot; | |
925baedd CM |
1947 | if (mid) { |
1948 | btrfs_tree_unlock(mid); | |
5f39d397 | 1949 | free_extent_buffer(mid); |
925baedd | 1950 | } |
bb803951 | 1951 | } else { |
5f39d397 | 1952 | orig_slot -= btrfs_header_nritems(left); |
bb803951 CM |
1953 | path->slots[level] = orig_slot; |
1954 | } | |
1955 | } | |
79f95c82 | 1956 | /* double check we haven't messed things up */ |
e20d96d6 | 1957 | if (orig_ptr != |
5f39d397 | 1958 | btrfs_node_blockptr(path->nodes[level], path->slots[level])) |
79f95c82 | 1959 | BUG(); |
54aa1f4d | 1960 | enospc: |
925baedd CM |
1961 | if (right) { |
1962 | btrfs_tree_unlock(right); | |
5f39d397 | 1963 | free_extent_buffer(right); |
925baedd CM |
1964 | } |
1965 | if (left) { | |
1966 | if (path->nodes[level] != left) | |
1967 | btrfs_tree_unlock(left); | |
5f39d397 | 1968 | free_extent_buffer(left); |
925baedd | 1969 | } |
bb803951 CM |
1970 | return ret; |
1971 | } | |
1972 | ||
d352ac68 CM |
1973 | /* Node balancing for insertion. Here we only split or push nodes around |
1974 | * when they are completely full. This is also done top down, so we | |
1975 | * have to be pessimistic. | |
1976 | */ | |
d397712b | 1977 | static noinline int push_nodes_for_insert(struct btrfs_trans_handle *trans, |
98ed5174 CM |
1978 | struct btrfs_root *root, |
1979 | struct btrfs_path *path, int level) | |
e66f709b | 1980 | { |
5f39d397 CM |
1981 | struct extent_buffer *right = NULL; |
1982 | struct extent_buffer *mid; | |
1983 | struct extent_buffer *left = NULL; | |
1984 | struct extent_buffer *parent = NULL; | |
e66f709b CM |
1985 | int ret = 0; |
1986 | int wret; | |
1987 | int pslot; | |
1988 | int orig_slot = path->slots[level]; | |
e66f709b CM |
1989 | |
1990 | if (level == 0) | |
1991 | return 1; | |
1992 | ||
5f39d397 | 1993 | mid = path->nodes[level]; |
7bb86316 | 1994 | WARN_ON(btrfs_header_generation(mid) != trans->transid); |
e66f709b | 1995 | |
a05a9bb1 | 1996 | if (level < BTRFS_MAX_LEVEL - 1) { |
5f39d397 | 1997 | parent = path->nodes[level + 1]; |
a05a9bb1 LZ |
1998 | pslot = path->slots[level + 1]; |
1999 | } | |
e66f709b | 2000 | |
5f39d397 | 2001 | if (!parent) |
e66f709b | 2002 | return 1; |
e66f709b | 2003 | |
5f39d397 | 2004 | left = read_node_slot(root, parent, pslot - 1); |
e66f709b CM |
2005 | |
2006 | /* first, try to make some room in the middle buffer */ | |
5f39d397 | 2007 | if (left) { |
e66f709b | 2008 | u32 left_nr; |
925baedd CM |
2009 | |
2010 | btrfs_tree_lock(left); | |
b4ce94de CM |
2011 | btrfs_set_lock_blocking(left); |
2012 | ||
5f39d397 | 2013 | left_nr = btrfs_header_nritems(left); |
33ade1f8 CM |
2014 | if (left_nr >= BTRFS_NODEPTRS_PER_BLOCK(root) - 1) { |
2015 | wret = 1; | |
2016 | } else { | |
5f39d397 | 2017 | ret = btrfs_cow_block(trans, root, left, parent, |
9fa8cfe7 | 2018 | pslot - 1, &left); |
54aa1f4d CM |
2019 | if (ret) |
2020 | wret = 1; | |
2021 | else { | |
54aa1f4d | 2022 | wret = push_node_left(trans, root, |
971a1f66 | 2023 | left, mid, 0); |
54aa1f4d | 2024 | } |
33ade1f8 | 2025 | } |
e66f709b CM |
2026 | if (wret < 0) |
2027 | ret = wret; | |
2028 | if (wret == 0) { | |
5f39d397 | 2029 | struct btrfs_disk_key disk_key; |
e66f709b | 2030 | orig_slot += left_nr; |
5f39d397 | 2031 | btrfs_node_key(mid, &disk_key, 0); |
f230475e | 2032 | tree_mod_log_set_node_key(root->fs_info, parent, |
32adf090 | 2033 | pslot, 0); |
5f39d397 CM |
2034 | btrfs_set_node_key(parent, &disk_key, pslot); |
2035 | btrfs_mark_buffer_dirty(parent); | |
2036 | if (btrfs_header_nritems(left) > orig_slot) { | |
2037 | path->nodes[level] = left; | |
e66f709b CM |
2038 | path->slots[level + 1] -= 1; |
2039 | path->slots[level] = orig_slot; | |
925baedd | 2040 | btrfs_tree_unlock(mid); |
5f39d397 | 2041 | free_extent_buffer(mid); |
e66f709b CM |
2042 | } else { |
2043 | orig_slot -= | |
5f39d397 | 2044 | btrfs_header_nritems(left); |
e66f709b | 2045 | path->slots[level] = orig_slot; |
925baedd | 2046 | btrfs_tree_unlock(left); |
5f39d397 | 2047 | free_extent_buffer(left); |
e66f709b | 2048 | } |
e66f709b CM |
2049 | return 0; |
2050 | } | |
925baedd | 2051 | btrfs_tree_unlock(left); |
5f39d397 | 2052 | free_extent_buffer(left); |
e66f709b | 2053 | } |
925baedd | 2054 | right = read_node_slot(root, parent, pslot + 1); |
e66f709b CM |
2055 | |
2056 | /* | |
2057 | * then try to empty the right most buffer into the middle | |
2058 | */ | |
5f39d397 | 2059 | if (right) { |
33ade1f8 | 2060 | u32 right_nr; |
b4ce94de | 2061 | |
925baedd | 2062 | btrfs_tree_lock(right); |
b4ce94de CM |
2063 | btrfs_set_lock_blocking(right); |
2064 | ||
5f39d397 | 2065 | right_nr = btrfs_header_nritems(right); |
33ade1f8 CM |
2066 | if (right_nr >= BTRFS_NODEPTRS_PER_BLOCK(root) - 1) { |
2067 | wret = 1; | |
2068 | } else { | |
5f39d397 CM |
2069 | ret = btrfs_cow_block(trans, root, right, |
2070 | parent, pslot + 1, | |
9fa8cfe7 | 2071 | &right); |
54aa1f4d CM |
2072 | if (ret) |
2073 | wret = 1; | |
2074 | else { | |
54aa1f4d | 2075 | wret = balance_node_right(trans, root, |
5f39d397 | 2076 | right, mid); |
54aa1f4d | 2077 | } |
33ade1f8 | 2078 | } |
e66f709b CM |
2079 | if (wret < 0) |
2080 | ret = wret; | |
2081 | if (wret == 0) { | |
5f39d397 CM |
2082 | struct btrfs_disk_key disk_key; |
2083 | ||
2084 | btrfs_node_key(right, &disk_key, 0); | |
f230475e | 2085 | tree_mod_log_set_node_key(root->fs_info, parent, |
32adf090 | 2086 | pslot + 1, 0); |
5f39d397 CM |
2087 | btrfs_set_node_key(parent, &disk_key, pslot + 1); |
2088 | btrfs_mark_buffer_dirty(parent); | |
2089 | ||
2090 | if (btrfs_header_nritems(mid) <= orig_slot) { | |
2091 | path->nodes[level] = right; | |
e66f709b CM |
2092 | path->slots[level + 1] += 1; |
2093 | path->slots[level] = orig_slot - | |
5f39d397 | 2094 | btrfs_header_nritems(mid); |
925baedd | 2095 | btrfs_tree_unlock(mid); |
5f39d397 | 2096 | free_extent_buffer(mid); |
e66f709b | 2097 | } else { |
925baedd | 2098 | btrfs_tree_unlock(right); |
5f39d397 | 2099 | free_extent_buffer(right); |
e66f709b | 2100 | } |
e66f709b CM |
2101 | return 0; |
2102 | } | |
925baedd | 2103 | btrfs_tree_unlock(right); |
5f39d397 | 2104 | free_extent_buffer(right); |
e66f709b | 2105 | } |
e66f709b CM |
2106 | return 1; |
2107 | } | |
2108 | ||
3c69faec | 2109 | /* |
d352ac68 CM |
2110 | * readahead one full node of leaves, finding things that are close |
2111 | * to the block in 'slot', and triggering ra on them. | |
3c69faec | 2112 | */ |
c8c42864 CM |
2113 | static void reada_for_search(struct btrfs_root *root, |
2114 | struct btrfs_path *path, | |
2115 | int level, int slot, u64 objectid) | |
3c69faec | 2116 | { |
5f39d397 | 2117 | struct extent_buffer *node; |
01f46658 | 2118 | struct btrfs_disk_key disk_key; |
3c69faec | 2119 | u32 nritems; |
3c69faec | 2120 | u64 search; |
a7175319 | 2121 | u64 target; |
6b80053d | 2122 | u64 nread = 0; |
cb25c2ea | 2123 | u64 gen; |
3c69faec | 2124 | int direction = path->reada; |
5f39d397 | 2125 | struct extent_buffer *eb; |
6b80053d CM |
2126 | u32 nr; |
2127 | u32 blocksize; | |
2128 | u32 nscan = 0; | |
db94535d | 2129 | |
a6b6e75e | 2130 | if (level != 1) |
6702ed49 CM |
2131 | return; |
2132 | ||
2133 | if (!path->nodes[level]) | |
3c69faec CM |
2134 | return; |
2135 | ||
5f39d397 | 2136 | node = path->nodes[level]; |
925baedd | 2137 | |
3c69faec | 2138 | search = btrfs_node_blockptr(node, slot); |
6b80053d CM |
2139 | blocksize = btrfs_level_size(root, level - 1); |
2140 | eb = btrfs_find_tree_block(root, search, blocksize); | |
5f39d397 CM |
2141 | if (eb) { |
2142 | free_extent_buffer(eb); | |
3c69faec CM |
2143 | return; |
2144 | } | |
2145 | ||
a7175319 | 2146 | target = search; |
6b80053d | 2147 | |
5f39d397 | 2148 | nritems = btrfs_header_nritems(node); |
6b80053d | 2149 | nr = slot; |
25b8b936 | 2150 | |
d397712b | 2151 | while (1) { |
6b80053d CM |
2152 | if (direction < 0) { |
2153 | if (nr == 0) | |
2154 | break; | |
2155 | nr--; | |
2156 | } else if (direction > 0) { | |
2157 | nr++; | |
2158 | if (nr >= nritems) | |
2159 | break; | |
3c69faec | 2160 | } |
01f46658 CM |
2161 | if (path->reada < 0 && objectid) { |
2162 | btrfs_node_key(node, &disk_key, nr); | |
2163 | if (btrfs_disk_key_objectid(&disk_key) != objectid) | |
2164 | break; | |
2165 | } | |
6b80053d | 2166 | search = btrfs_node_blockptr(node, nr); |
a7175319 CM |
2167 | if ((search <= target && target - search <= 65536) || |
2168 | (search > target && search - target <= 65536)) { | |
cb25c2ea | 2169 | gen = btrfs_node_ptr_generation(node, nr); |
cb25c2ea | 2170 | readahead_tree_block(root, search, blocksize, gen); |
6b80053d CM |
2171 | nread += blocksize; |
2172 | } | |
2173 | nscan++; | |
a7175319 | 2174 | if ((nread > 65536 || nscan > 32)) |
6b80053d | 2175 | break; |
3c69faec CM |
2176 | } |
2177 | } | |
925baedd | 2178 | |
b4ce94de CM |
2179 | /* |
2180 | * returns -EAGAIN if it had to drop the path, or zero if everything was in | |
2181 | * cache | |
2182 | */ | |
2183 | static noinline int reada_for_balance(struct btrfs_root *root, | |
2184 | struct btrfs_path *path, int level) | |
2185 | { | |
2186 | int slot; | |
2187 | int nritems; | |
2188 | struct extent_buffer *parent; | |
2189 | struct extent_buffer *eb; | |
2190 | u64 gen; | |
2191 | u64 block1 = 0; | |
2192 | u64 block2 = 0; | |
2193 | int ret = 0; | |
2194 | int blocksize; | |
2195 | ||
8c594ea8 | 2196 | parent = path->nodes[level + 1]; |
b4ce94de CM |
2197 | if (!parent) |
2198 | return 0; | |
2199 | ||
2200 | nritems = btrfs_header_nritems(parent); | |
8c594ea8 | 2201 | slot = path->slots[level + 1]; |
b4ce94de CM |
2202 | blocksize = btrfs_level_size(root, level); |
2203 | ||
2204 | if (slot > 0) { | |
2205 | block1 = btrfs_node_blockptr(parent, slot - 1); | |
2206 | gen = btrfs_node_ptr_generation(parent, slot - 1); | |
2207 | eb = btrfs_find_tree_block(root, block1, blocksize); | |
b9fab919 CM |
2208 | /* |
2209 | * if we get -eagain from btrfs_buffer_uptodate, we | |
2210 | * don't want to return eagain here. That will loop | |
2211 | * forever | |
2212 | */ | |
2213 | if (eb && btrfs_buffer_uptodate(eb, gen, 1) != 0) | |
b4ce94de CM |
2214 | block1 = 0; |
2215 | free_extent_buffer(eb); | |
2216 | } | |
8c594ea8 | 2217 | if (slot + 1 < nritems) { |
b4ce94de CM |
2218 | block2 = btrfs_node_blockptr(parent, slot + 1); |
2219 | gen = btrfs_node_ptr_generation(parent, slot + 1); | |
2220 | eb = btrfs_find_tree_block(root, block2, blocksize); | |
b9fab919 | 2221 | if (eb && btrfs_buffer_uptodate(eb, gen, 1) != 0) |
b4ce94de CM |
2222 | block2 = 0; |
2223 | free_extent_buffer(eb); | |
2224 | } | |
2225 | if (block1 || block2) { | |
2226 | ret = -EAGAIN; | |
8c594ea8 CM |
2227 | |
2228 | /* release the whole path */ | |
b3b4aa74 | 2229 | btrfs_release_path(path); |
8c594ea8 CM |
2230 | |
2231 | /* read the blocks */ | |
b4ce94de CM |
2232 | if (block1) |
2233 | readahead_tree_block(root, block1, blocksize, 0); | |
2234 | if (block2) | |
2235 | readahead_tree_block(root, block2, blocksize, 0); | |
2236 | ||
2237 | if (block1) { | |
2238 | eb = read_tree_block(root, block1, blocksize, 0); | |
2239 | free_extent_buffer(eb); | |
2240 | } | |
8c594ea8 | 2241 | if (block2) { |
b4ce94de CM |
2242 | eb = read_tree_block(root, block2, blocksize, 0); |
2243 | free_extent_buffer(eb); | |
2244 | } | |
2245 | } | |
2246 | return ret; | |
2247 | } | |
2248 | ||
2249 | ||
d352ac68 | 2250 | /* |
d397712b CM |
2251 | * when we walk down the tree, it is usually safe to unlock the higher layers |
2252 | * in the tree. The exceptions are when our path goes through slot 0, because | |
2253 | * operations on the tree might require changing key pointers higher up in the | |
2254 | * tree. | |
d352ac68 | 2255 | * |
d397712b CM |
2256 | * callers might also have set path->keep_locks, which tells this code to keep |
2257 | * the lock if the path points to the last slot in the block. This is part of | |
2258 | * walking through the tree, and selecting the next slot in the higher block. | |
d352ac68 | 2259 | * |
d397712b CM |
2260 | * lowest_unlock sets the lowest level in the tree we're allowed to unlock. so |
2261 | * if lowest_unlock is 1, level 0 won't be unlocked | |
d352ac68 | 2262 | */ |
e02119d5 | 2263 | static noinline void unlock_up(struct btrfs_path *path, int level, |
f7c79f30 CM |
2264 | int lowest_unlock, int min_write_lock_level, |
2265 | int *write_lock_level) | |
925baedd CM |
2266 | { |
2267 | int i; | |
2268 | int skip_level = level; | |
051e1b9f | 2269 | int no_skips = 0; |
925baedd CM |
2270 | struct extent_buffer *t; |
2271 | ||
2272 | for (i = level; i < BTRFS_MAX_LEVEL; i++) { | |
2273 | if (!path->nodes[i]) | |
2274 | break; | |
2275 | if (!path->locks[i]) | |
2276 | break; | |
051e1b9f | 2277 | if (!no_skips && path->slots[i] == 0) { |
925baedd CM |
2278 | skip_level = i + 1; |
2279 | continue; | |
2280 | } | |
051e1b9f | 2281 | if (!no_skips && path->keep_locks) { |
925baedd CM |
2282 | u32 nritems; |
2283 | t = path->nodes[i]; | |
2284 | nritems = btrfs_header_nritems(t); | |
051e1b9f | 2285 | if (nritems < 1 || path->slots[i] >= nritems - 1) { |
925baedd CM |
2286 | skip_level = i + 1; |
2287 | continue; | |
2288 | } | |
2289 | } | |
051e1b9f CM |
2290 | if (skip_level < i && i >= lowest_unlock) |
2291 | no_skips = 1; | |
2292 | ||
925baedd CM |
2293 | t = path->nodes[i]; |
2294 | if (i >= lowest_unlock && i > skip_level && path->locks[i]) { | |
bd681513 | 2295 | btrfs_tree_unlock_rw(t, path->locks[i]); |
925baedd | 2296 | path->locks[i] = 0; |
f7c79f30 CM |
2297 | if (write_lock_level && |
2298 | i > min_write_lock_level && | |
2299 | i <= *write_lock_level) { | |
2300 | *write_lock_level = i - 1; | |
2301 | } | |
925baedd CM |
2302 | } |
2303 | } | |
2304 | } | |
2305 | ||
b4ce94de CM |
2306 | /* |
2307 | * This releases any locks held in the path starting at level and | |
2308 | * going all the way up to the root. | |
2309 | * | |
2310 | * btrfs_search_slot will keep the lock held on higher nodes in a few | |
2311 | * corner cases, such as COW of the block at slot zero in the node. This | |
2312 | * ignores those rules, and it should only be called when there are no | |
2313 | * more updates to be done higher up in the tree. | |
2314 | */ | |
2315 | noinline void btrfs_unlock_up_safe(struct btrfs_path *path, int level) | |
2316 | { | |
2317 | int i; | |
2318 | ||
09a2a8f9 | 2319 | if (path->keep_locks) |
b4ce94de CM |
2320 | return; |
2321 | ||
2322 | for (i = level; i < BTRFS_MAX_LEVEL; i++) { | |
2323 | if (!path->nodes[i]) | |
12f4dacc | 2324 | continue; |
b4ce94de | 2325 | if (!path->locks[i]) |
12f4dacc | 2326 | continue; |
bd681513 | 2327 | btrfs_tree_unlock_rw(path->nodes[i], path->locks[i]); |
b4ce94de CM |
2328 | path->locks[i] = 0; |
2329 | } | |
2330 | } | |
2331 | ||
c8c42864 CM |
2332 | /* |
2333 | * helper function for btrfs_search_slot. The goal is to find a block | |
2334 | * in cache without setting the path to blocking. If we find the block | |
2335 | * we return zero and the path is unchanged. | |
2336 | * | |
2337 | * If we can't find the block, we set the path blocking and do some | |
2338 | * reada. -EAGAIN is returned and the search must be repeated. | |
2339 | */ | |
2340 | static int | |
2341 | read_block_for_search(struct btrfs_trans_handle *trans, | |
2342 | struct btrfs_root *root, struct btrfs_path *p, | |
2343 | struct extent_buffer **eb_ret, int level, int slot, | |
5d9e75c4 | 2344 | struct btrfs_key *key, u64 time_seq) |
c8c42864 CM |
2345 | { |
2346 | u64 blocknr; | |
2347 | u64 gen; | |
2348 | u32 blocksize; | |
2349 | struct extent_buffer *b = *eb_ret; | |
2350 | struct extent_buffer *tmp; | |
76a05b35 | 2351 | int ret; |
c8c42864 CM |
2352 | |
2353 | blocknr = btrfs_node_blockptr(b, slot); | |
2354 | gen = btrfs_node_ptr_generation(b, slot); | |
2355 | blocksize = btrfs_level_size(root, level - 1); | |
2356 | ||
2357 | tmp = btrfs_find_tree_block(root, blocknr, blocksize); | |
cb44921a | 2358 | if (tmp) { |
b9fab919 CM |
2359 | /* first we do an atomic uptodate check */ |
2360 | if (btrfs_buffer_uptodate(tmp, 0, 1) > 0) { | |
2361 | if (btrfs_buffer_uptodate(tmp, gen, 1) > 0) { | |
cb44921a CM |
2362 | /* |
2363 | * we found an up to date block without | |
2364 | * sleeping, return | |
2365 | * right away | |
2366 | */ | |
2367 | *eb_ret = tmp; | |
2368 | return 0; | |
2369 | } | |
2370 | /* the pages were up to date, but we failed | |
2371 | * the generation number check. Do a full | |
2372 | * read for the generation number that is correct. | |
2373 | * We must do this without dropping locks so | |
2374 | * we can trust our generation number | |
2375 | */ | |
2376 | free_extent_buffer(tmp); | |
bd681513 CM |
2377 | btrfs_set_path_blocking(p); |
2378 | ||
b9fab919 | 2379 | /* now we're allowed to do a blocking uptodate check */ |
cb44921a | 2380 | tmp = read_tree_block(root, blocknr, blocksize, gen); |
b9fab919 | 2381 | if (tmp && btrfs_buffer_uptodate(tmp, gen, 0) > 0) { |
cb44921a CM |
2382 | *eb_ret = tmp; |
2383 | return 0; | |
2384 | } | |
2385 | free_extent_buffer(tmp); | |
b3b4aa74 | 2386 | btrfs_release_path(p); |
cb44921a CM |
2387 | return -EIO; |
2388 | } | |
c8c42864 CM |
2389 | } |
2390 | ||
2391 | /* | |
2392 | * reduce lock contention at high levels | |
2393 | * of the btree by dropping locks before | |
76a05b35 CM |
2394 | * we read. Don't release the lock on the current |
2395 | * level because we need to walk this node to figure | |
2396 | * out which blocks to read. | |
c8c42864 | 2397 | */ |
8c594ea8 CM |
2398 | btrfs_unlock_up_safe(p, level + 1); |
2399 | btrfs_set_path_blocking(p); | |
2400 | ||
cb44921a | 2401 | free_extent_buffer(tmp); |
c8c42864 CM |
2402 | if (p->reada) |
2403 | reada_for_search(root, p, level, slot, key->objectid); | |
2404 | ||
b3b4aa74 | 2405 | btrfs_release_path(p); |
76a05b35 CM |
2406 | |
2407 | ret = -EAGAIN; | |
5bdd3536 | 2408 | tmp = read_tree_block(root, blocknr, blocksize, 0); |
76a05b35 CM |
2409 | if (tmp) { |
2410 | /* | |
2411 | * If the read above didn't mark this buffer up to date, | |
2412 | * it will never end up being up to date. Set ret to EIO now | |
2413 | * and give up so that our caller doesn't loop forever | |
2414 | * on our EAGAINs. | |
2415 | */ | |
b9fab919 | 2416 | if (!btrfs_buffer_uptodate(tmp, 0, 0)) |
76a05b35 | 2417 | ret = -EIO; |
c8c42864 | 2418 | free_extent_buffer(tmp); |
76a05b35 CM |
2419 | } |
2420 | return ret; | |
c8c42864 CM |
2421 | } |
2422 | ||
2423 | /* | |
2424 | * helper function for btrfs_search_slot. This does all of the checks | |
2425 | * for node-level blocks and does any balancing required based on | |
2426 | * the ins_len. | |
2427 | * | |
2428 | * If no extra work was required, zero is returned. If we had to | |
2429 | * drop the path, -EAGAIN is returned and btrfs_search_slot must | |
2430 | * start over | |
2431 | */ | |
2432 | static int | |
2433 | setup_nodes_for_search(struct btrfs_trans_handle *trans, | |
2434 | struct btrfs_root *root, struct btrfs_path *p, | |
bd681513 CM |
2435 | struct extent_buffer *b, int level, int ins_len, |
2436 | int *write_lock_level) | |
c8c42864 CM |
2437 | { |
2438 | int ret; | |
2439 | if ((p->search_for_split || ins_len > 0) && btrfs_header_nritems(b) >= | |
2440 | BTRFS_NODEPTRS_PER_BLOCK(root) - 3) { | |
2441 | int sret; | |
2442 | ||
bd681513 CM |
2443 | if (*write_lock_level < level + 1) { |
2444 | *write_lock_level = level + 1; | |
2445 | btrfs_release_path(p); | |
2446 | goto again; | |
2447 | } | |
2448 | ||
c8c42864 CM |
2449 | sret = reada_for_balance(root, p, level); |
2450 | if (sret) | |
2451 | goto again; | |
2452 | ||
2453 | btrfs_set_path_blocking(p); | |
2454 | sret = split_node(trans, root, p, level); | |
bd681513 | 2455 | btrfs_clear_path_blocking(p, NULL, 0); |
c8c42864 CM |
2456 | |
2457 | BUG_ON(sret > 0); | |
2458 | if (sret) { | |
2459 | ret = sret; | |
2460 | goto done; | |
2461 | } | |
2462 | b = p->nodes[level]; | |
2463 | } else if (ins_len < 0 && btrfs_header_nritems(b) < | |
cfbb9308 | 2464 | BTRFS_NODEPTRS_PER_BLOCK(root) / 2) { |
c8c42864 CM |
2465 | int sret; |
2466 | ||
bd681513 CM |
2467 | if (*write_lock_level < level + 1) { |
2468 | *write_lock_level = level + 1; | |
2469 | btrfs_release_path(p); | |
2470 | goto again; | |
2471 | } | |
2472 | ||
c8c42864 CM |
2473 | sret = reada_for_balance(root, p, level); |
2474 | if (sret) | |
2475 | goto again; | |
2476 | ||
2477 | btrfs_set_path_blocking(p); | |
2478 | sret = balance_level(trans, root, p, level); | |
bd681513 | 2479 | btrfs_clear_path_blocking(p, NULL, 0); |
c8c42864 CM |
2480 | |
2481 | if (sret) { | |
2482 | ret = sret; | |
2483 | goto done; | |
2484 | } | |
2485 | b = p->nodes[level]; | |
2486 | if (!b) { | |
b3b4aa74 | 2487 | btrfs_release_path(p); |
c8c42864 CM |
2488 | goto again; |
2489 | } | |
2490 | BUG_ON(btrfs_header_nritems(b) == 1); | |
2491 | } | |
2492 | return 0; | |
2493 | ||
2494 | again: | |
2495 | ret = -EAGAIN; | |
2496 | done: | |
2497 | return ret; | |
2498 | } | |
2499 | ||
74123bd7 CM |
2500 | /* |
2501 | * look for key in the tree. path is filled in with nodes along the way | |
2502 | * if key is found, we return zero and you can find the item in the leaf | |
2503 | * level of the path (level 0) | |
2504 | * | |
2505 | * If the key isn't found, the path points to the slot where it should | |
aa5d6bed CM |
2506 | * be inserted, and 1 is returned. If there are other errors during the |
2507 | * search a negative error number is returned. | |
97571fd0 CM |
2508 | * |
2509 | * if ins_len > 0, nodes and leaves will be split as we walk down the | |
2510 | * tree. if ins_len < 0, nodes will be merged as we walk down the tree (if | |
2511 | * possible) | |
74123bd7 | 2512 | */ |
e089f05c CM |
2513 | int btrfs_search_slot(struct btrfs_trans_handle *trans, struct btrfs_root |
2514 | *root, struct btrfs_key *key, struct btrfs_path *p, int | |
2515 | ins_len, int cow) | |
be0e5c09 | 2516 | { |
5f39d397 | 2517 | struct extent_buffer *b; |
be0e5c09 CM |
2518 | int slot; |
2519 | int ret; | |
33c66f43 | 2520 | int err; |
be0e5c09 | 2521 | int level; |
925baedd | 2522 | int lowest_unlock = 1; |
bd681513 CM |
2523 | int root_lock; |
2524 | /* everything at write_lock_level or lower must be write locked */ | |
2525 | int write_lock_level = 0; | |
9f3a7427 | 2526 | u8 lowest_level = 0; |
f7c79f30 | 2527 | int min_write_lock_level; |
9f3a7427 | 2528 | |
6702ed49 | 2529 | lowest_level = p->lowest_level; |
323ac95b | 2530 | WARN_ON(lowest_level && ins_len > 0); |
22b0ebda | 2531 | WARN_ON(p->nodes[0] != NULL); |
25179201 | 2532 | |
bd681513 | 2533 | if (ins_len < 0) { |
925baedd | 2534 | lowest_unlock = 2; |
65b51a00 | 2535 | |
bd681513 CM |
2536 | /* when we are removing items, we might have to go up to level |
2537 | * two as we update tree pointers Make sure we keep write | |
2538 | * for those levels as well | |
2539 | */ | |
2540 | write_lock_level = 2; | |
2541 | } else if (ins_len > 0) { | |
2542 | /* | |
2543 | * for inserting items, make sure we have a write lock on | |
2544 | * level 1 so we can update keys | |
2545 | */ | |
2546 | write_lock_level = 1; | |
2547 | } | |
2548 | ||
2549 | if (!cow) | |
2550 | write_lock_level = -1; | |
2551 | ||
09a2a8f9 | 2552 | if (cow && (p->keep_locks || p->lowest_level)) |
bd681513 CM |
2553 | write_lock_level = BTRFS_MAX_LEVEL; |
2554 | ||
f7c79f30 CM |
2555 | min_write_lock_level = write_lock_level; |
2556 | ||
bb803951 | 2557 | again: |
bd681513 CM |
2558 | /* |
2559 | * we try very hard to do read locks on the root | |
2560 | */ | |
2561 | root_lock = BTRFS_READ_LOCK; | |
2562 | level = 0; | |
5d4f98a2 | 2563 | if (p->search_commit_root) { |
bd681513 CM |
2564 | /* |
2565 | * the commit roots are read only | |
2566 | * so we always do read locks | |
2567 | */ | |
5d4f98a2 YZ |
2568 | b = root->commit_root; |
2569 | extent_buffer_get(b); | |
bd681513 | 2570 | level = btrfs_header_level(b); |
5d4f98a2 | 2571 | if (!p->skip_locking) |
bd681513 | 2572 | btrfs_tree_read_lock(b); |
5d4f98a2 | 2573 | } else { |
bd681513 | 2574 | if (p->skip_locking) { |
5d4f98a2 | 2575 | b = btrfs_root_node(root); |
bd681513 CM |
2576 | level = btrfs_header_level(b); |
2577 | } else { | |
2578 | /* we don't know the level of the root node | |
2579 | * until we actually have it read locked | |
2580 | */ | |
2581 | b = btrfs_read_lock_root_node(root); | |
2582 | level = btrfs_header_level(b); | |
2583 | if (level <= write_lock_level) { | |
2584 | /* whoops, must trade for write lock */ | |
2585 | btrfs_tree_read_unlock(b); | |
2586 | free_extent_buffer(b); | |
2587 | b = btrfs_lock_root_node(root); | |
2588 | root_lock = BTRFS_WRITE_LOCK; | |
2589 | ||
2590 | /* the level might have changed, check again */ | |
2591 | level = btrfs_header_level(b); | |
2592 | } | |
2593 | } | |
5d4f98a2 | 2594 | } |
bd681513 CM |
2595 | p->nodes[level] = b; |
2596 | if (!p->skip_locking) | |
2597 | p->locks[level] = root_lock; | |
925baedd | 2598 | |
eb60ceac | 2599 | while (b) { |
5f39d397 | 2600 | level = btrfs_header_level(b); |
65b51a00 CM |
2601 | |
2602 | /* | |
2603 | * setup the path here so we can release it under lock | |
2604 | * contention with the cow code | |
2605 | */ | |
02217ed2 | 2606 | if (cow) { |
c8c42864 CM |
2607 | /* |
2608 | * if we don't really need to cow this block | |
2609 | * then we don't want to set the path blocking, | |
2610 | * so we test it here | |
2611 | */ | |
5d4f98a2 | 2612 | if (!should_cow_block(trans, root, b)) |
65b51a00 | 2613 | goto cow_done; |
5d4f98a2 | 2614 | |
b4ce94de CM |
2615 | btrfs_set_path_blocking(p); |
2616 | ||
bd681513 CM |
2617 | /* |
2618 | * must have write locks on this node and the | |
2619 | * parent | |
2620 | */ | |
5124e00e JB |
2621 | if (level > write_lock_level || |
2622 | (level + 1 > write_lock_level && | |
2623 | level + 1 < BTRFS_MAX_LEVEL && | |
2624 | p->nodes[level + 1])) { | |
bd681513 CM |
2625 | write_lock_level = level + 1; |
2626 | btrfs_release_path(p); | |
2627 | goto again; | |
2628 | } | |
2629 | ||
33c66f43 YZ |
2630 | err = btrfs_cow_block(trans, root, b, |
2631 | p->nodes[level + 1], | |
2632 | p->slots[level + 1], &b); | |
2633 | if (err) { | |
33c66f43 | 2634 | ret = err; |
65b51a00 | 2635 | goto done; |
54aa1f4d | 2636 | } |
02217ed2 | 2637 | } |
65b51a00 | 2638 | cow_done: |
02217ed2 | 2639 | BUG_ON(!cow && ins_len); |
65b51a00 | 2640 | |
eb60ceac | 2641 | p->nodes[level] = b; |
bd681513 | 2642 | btrfs_clear_path_blocking(p, NULL, 0); |
b4ce94de CM |
2643 | |
2644 | /* | |
2645 | * we have a lock on b and as long as we aren't changing | |
2646 | * the tree, there is no way to for the items in b to change. | |
2647 | * It is safe to drop the lock on our parent before we | |
2648 | * go through the expensive btree search on b. | |
2649 | * | |
2650 | * If cow is true, then we might be changing slot zero, | |
2651 | * which may require changing the parent. So, we can't | |
2652 | * drop the lock until after we know which slot we're | |
2653 | * operating on. | |
2654 | */ | |
2655 | if (!cow) | |
2656 | btrfs_unlock_up_safe(p, level + 1); | |
2657 | ||
5f39d397 | 2658 | ret = bin_search(b, key, level, &slot); |
b4ce94de | 2659 | |
5f39d397 | 2660 | if (level != 0) { |
33c66f43 YZ |
2661 | int dec = 0; |
2662 | if (ret && slot > 0) { | |
2663 | dec = 1; | |
be0e5c09 | 2664 | slot -= 1; |
33c66f43 | 2665 | } |
be0e5c09 | 2666 | p->slots[level] = slot; |
33c66f43 | 2667 | err = setup_nodes_for_search(trans, root, p, b, level, |
bd681513 | 2668 | ins_len, &write_lock_level); |
33c66f43 | 2669 | if (err == -EAGAIN) |
c8c42864 | 2670 | goto again; |
33c66f43 YZ |
2671 | if (err) { |
2672 | ret = err; | |
c8c42864 | 2673 | goto done; |
33c66f43 | 2674 | } |
c8c42864 CM |
2675 | b = p->nodes[level]; |
2676 | slot = p->slots[level]; | |
b4ce94de | 2677 | |
bd681513 CM |
2678 | /* |
2679 | * slot 0 is special, if we change the key | |
2680 | * we have to update the parent pointer | |
2681 | * which means we must have a write lock | |
2682 | * on the parent | |
2683 | */ | |
2684 | if (slot == 0 && cow && | |
2685 | write_lock_level < level + 1) { | |
2686 | write_lock_level = level + 1; | |
2687 | btrfs_release_path(p); | |
2688 | goto again; | |
2689 | } | |
2690 | ||
f7c79f30 CM |
2691 | unlock_up(p, level, lowest_unlock, |
2692 | min_write_lock_level, &write_lock_level); | |
f9efa9c7 | 2693 | |
925baedd | 2694 | if (level == lowest_level) { |
33c66f43 YZ |
2695 | if (dec) |
2696 | p->slots[level]++; | |
5b21f2ed | 2697 | goto done; |
925baedd | 2698 | } |
ca7a79ad | 2699 | |
33c66f43 | 2700 | err = read_block_for_search(trans, root, p, |
5d9e75c4 | 2701 | &b, level, slot, key, 0); |
33c66f43 | 2702 | if (err == -EAGAIN) |
c8c42864 | 2703 | goto again; |
33c66f43 YZ |
2704 | if (err) { |
2705 | ret = err; | |
76a05b35 | 2706 | goto done; |
33c66f43 | 2707 | } |
76a05b35 | 2708 | |
b4ce94de | 2709 | if (!p->skip_locking) { |
bd681513 CM |
2710 | level = btrfs_header_level(b); |
2711 | if (level <= write_lock_level) { | |
2712 | err = btrfs_try_tree_write_lock(b); | |
2713 | if (!err) { | |
2714 | btrfs_set_path_blocking(p); | |
2715 | btrfs_tree_lock(b); | |
2716 | btrfs_clear_path_blocking(p, b, | |
2717 | BTRFS_WRITE_LOCK); | |
2718 | } | |
2719 | p->locks[level] = BTRFS_WRITE_LOCK; | |
2720 | } else { | |
2721 | err = btrfs_try_tree_read_lock(b); | |
2722 | if (!err) { | |
2723 | btrfs_set_path_blocking(p); | |
2724 | btrfs_tree_read_lock(b); | |
2725 | btrfs_clear_path_blocking(p, b, | |
2726 | BTRFS_READ_LOCK); | |
2727 | } | |
2728 | p->locks[level] = BTRFS_READ_LOCK; | |
b4ce94de | 2729 | } |
bd681513 | 2730 | p->nodes[level] = b; |
b4ce94de | 2731 | } |
be0e5c09 CM |
2732 | } else { |
2733 | p->slots[level] = slot; | |
87b29b20 YZ |
2734 | if (ins_len > 0 && |
2735 | btrfs_leaf_free_space(root, b) < ins_len) { | |
bd681513 CM |
2736 | if (write_lock_level < 1) { |
2737 | write_lock_level = 1; | |
2738 | btrfs_release_path(p); | |
2739 | goto again; | |
2740 | } | |
2741 | ||
b4ce94de | 2742 | btrfs_set_path_blocking(p); |
33c66f43 YZ |
2743 | err = split_leaf(trans, root, key, |
2744 | p, ins_len, ret == 0); | |
bd681513 | 2745 | btrfs_clear_path_blocking(p, NULL, 0); |
b4ce94de | 2746 | |
33c66f43 YZ |
2747 | BUG_ON(err > 0); |
2748 | if (err) { | |
2749 | ret = err; | |
65b51a00 CM |
2750 | goto done; |
2751 | } | |
5c680ed6 | 2752 | } |
459931ec | 2753 | if (!p->search_for_split) |
f7c79f30 CM |
2754 | unlock_up(p, level, lowest_unlock, |
2755 | min_write_lock_level, &write_lock_level); | |
65b51a00 | 2756 | goto done; |
be0e5c09 CM |
2757 | } |
2758 | } | |
65b51a00 CM |
2759 | ret = 1; |
2760 | done: | |
b4ce94de CM |
2761 | /* |
2762 | * we don't really know what they plan on doing with the path | |
2763 | * from here on, so for now just mark it as blocking | |
2764 | */ | |
b9473439 CM |
2765 | if (!p->leave_spinning) |
2766 | btrfs_set_path_blocking(p); | |
76a05b35 | 2767 | if (ret < 0) |
b3b4aa74 | 2768 | btrfs_release_path(p); |
65b51a00 | 2769 | return ret; |
be0e5c09 CM |
2770 | } |
2771 | ||
5d9e75c4 JS |
2772 | /* |
2773 | * Like btrfs_search_slot, this looks for a key in the given tree. It uses the | |
2774 | * current state of the tree together with the operations recorded in the tree | |
2775 | * modification log to search for the key in a previous version of this tree, as | |
2776 | * denoted by the time_seq parameter. | |
2777 | * | |
2778 | * Naturally, there is no support for insert, delete or cow operations. | |
2779 | * | |
2780 | * The resulting path and return value will be set up as if we called | |
2781 | * btrfs_search_slot at that point in time with ins_len and cow both set to 0. | |
2782 | */ | |
2783 | int btrfs_search_old_slot(struct btrfs_root *root, struct btrfs_key *key, | |
2784 | struct btrfs_path *p, u64 time_seq) | |
2785 | { | |
2786 | struct extent_buffer *b; | |
2787 | int slot; | |
2788 | int ret; | |
2789 | int err; | |
2790 | int level; | |
2791 | int lowest_unlock = 1; | |
2792 | u8 lowest_level = 0; | |
2793 | ||
2794 | lowest_level = p->lowest_level; | |
2795 | WARN_ON(p->nodes[0] != NULL); | |
2796 | ||
2797 | if (p->search_commit_root) { | |
2798 | BUG_ON(time_seq); | |
2799 | return btrfs_search_slot(NULL, root, key, p, 0, 0); | |
2800 | } | |
2801 | ||
2802 | again: | |
5d9e75c4 | 2803 | b = get_old_root(root, time_seq); |
5d9e75c4 | 2804 | level = btrfs_header_level(b); |
5d9e75c4 JS |
2805 | p->locks[level] = BTRFS_READ_LOCK; |
2806 | ||
2807 | while (b) { | |
2808 | level = btrfs_header_level(b); | |
2809 | p->nodes[level] = b; | |
2810 | btrfs_clear_path_blocking(p, NULL, 0); | |
2811 | ||
2812 | /* | |
2813 | * we have a lock on b and as long as we aren't changing | |
2814 | * the tree, there is no way to for the items in b to change. | |
2815 | * It is safe to drop the lock on our parent before we | |
2816 | * go through the expensive btree search on b. | |
2817 | */ | |
2818 | btrfs_unlock_up_safe(p, level + 1); | |
2819 | ||
2820 | ret = bin_search(b, key, level, &slot); | |
2821 | ||
2822 | if (level != 0) { | |
2823 | int dec = 0; | |
2824 | if (ret && slot > 0) { | |
2825 | dec = 1; | |
2826 | slot -= 1; | |
2827 | } | |
2828 | p->slots[level] = slot; | |
2829 | unlock_up(p, level, lowest_unlock, 0, NULL); | |
2830 | ||
2831 | if (level == lowest_level) { | |
2832 | if (dec) | |
2833 | p->slots[level]++; | |
2834 | goto done; | |
2835 | } | |
2836 | ||
2837 | err = read_block_for_search(NULL, root, p, &b, level, | |
2838 | slot, key, time_seq); | |
2839 | if (err == -EAGAIN) | |
2840 | goto again; | |
2841 | if (err) { | |
2842 | ret = err; | |
2843 | goto done; | |
2844 | } | |
2845 | ||
2846 | level = btrfs_header_level(b); | |
2847 | err = btrfs_try_tree_read_lock(b); | |
2848 | if (!err) { | |
2849 | btrfs_set_path_blocking(p); | |
2850 | btrfs_tree_read_lock(b); | |
2851 | btrfs_clear_path_blocking(p, b, | |
2852 | BTRFS_READ_LOCK); | |
2853 | } | |
47fb091f | 2854 | b = tree_mod_log_rewind(root->fs_info, b, time_seq); |
5d9e75c4 JS |
2855 | p->locks[level] = BTRFS_READ_LOCK; |
2856 | p->nodes[level] = b; | |
5d9e75c4 JS |
2857 | } else { |
2858 | p->slots[level] = slot; | |
2859 | unlock_up(p, level, lowest_unlock, 0, NULL); | |
2860 | goto done; | |
2861 | } | |
2862 | } | |
2863 | ret = 1; | |
2864 | done: | |
2865 | if (!p->leave_spinning) | |
2866 | btrfs_set_path_blocking(p); | |
2867 | if (ret < 0) | |
2868 | btrfs_release_path(p); | |
2869 | ||
2870 | return ret; | |
2871 | } | |
2872 | ||
2f38b3e1 AJ |
2873 | /* |
2874 | * helper to use instead of search slot if no exact match is needed but | |
2875 | * instead the next or previous item should be returned. | |
2876 | * When find_higher is true, the next higher item is returned, the next lower | |
2877 | * otherwise. | |
2878 | * When return_any and find_higher are both true, and no higher item is found, | |
2879 | * return the next lower instead. | |
2880 | * When return_any is true and find_higher is false, and no lower item is found, | |
2881 | * return the next higher instead. | |
2882 | * It returns 0 if any item is found, 1 if none is found (tree empty), and | |
2883 | * < 0 on error | |
2884 | */ | |
2885 | int btrfs_search_slot_for_read(struct btrfs_root *root, | |
2886 | struct btrfs_key *key, struct btrfs_path *p, | |
2887 | int find_higher, int return_any) | |
2888 | { | |
2889 | int ret; | |
2890 | struct extent_buffer *leaf; | |
2891 | ||
2892 | again: | |
2893 | ret = btrfs_search_slot(NULL, root, key, p, 0, 0); | |
2894 | if (ret <= 0) | |
2895 | return ret; | |
2896 | /* | |
2897 | * a return value of 1 means the path is at the position where the | |
2898 | * item should be inserted. Normally this is the next bigger item, | |
2899 | * but in case the previous item is the last in a leaf, path points | |
2900 | * to the first free slot in the previous leaf, i.e. at an invalid | |
2901 | * item. | |
2902 | */ | |
2903 | leaf = p->nodes[0]; | |
2904 | ||
2905 | if (find_higher) { | |
2906 | if (p->slots[0] >= btrfs_header_nritems(leaf)) { | |
2907 | ret = btrfs_next_leaf(root, p); | |
2908 | if (ret <= 0) | |
2909 | return ret; | |
2910 | if (!return_any) | |
2911 | return 1; | |
2912 | /* | |
2913 | * no higher item found, return the next | |
2914 | * lower instead | |
2915 | */ | |
2916 | return_any = 0; | |
2917 | find_higher = 0; | |
2918 | btrfs_release_path(p); | |
2919 | goto again; | |
2920 | } | |
2921 | } else { | |
e6793769 AJ |
2922 | if (p->slots[0] == 0) { |
2923 | ret = btrfs_prev_leaf(root, p); | |
2924 | if (ret < 0) | |
2925 | return ret; | |
2926 | if (!ret) { | |
2927 | p->slots[0] = btrfs_header_nritems(leaf) - 1; | |
2928 | return 0; | |
2f38b3e1 | 2929 | } |
e6793769 AJ |
2930 | if (!return_any) |
2931 | return 1; | |
2932 | /* | |
2933 | * no lower item found, return the next | |
2934 | * higher instead | |
2935 | */ | |
2936 | return_any = 0; | |
2937 | find_higher = 1; | |
2938 | btrfs_release_path(p); | |
2939 | goto again; | |
2940 | } else { | |
2f38b3e1 AJ |
2941 | --p->slots[0]; |
2942 | } | |
2943 | } | |
2944 | return 0; | |
2945 | } | |
2946 | ||
74123bd7 CM |
2947 | /* |
2948 | * adjust the pointers going up the tree, starting at level | |
2949 | * making sure the right key of each node is points to 'key'. | |
2950 | * This is used after shifting pointers to the left, so it stops | |
2951 | * fixing up pointers when a given leaf/node is not in slot 0 of the | |
2952 | * higher levels | |
aa5d6bed | 2953 | * |
74123bd7 | 2954 | */ |
d6a0a126 | 2955 | static void fixup_low_keys(struct btrfs_root *root, struct btrfs_path *path, |
143bede5 | 2956 | struct btrfs_disk_key *key, int level) |
be0e5c09 CM |
2957 | { |
2958 | int i; | |
5f39d397 CM |
2959 | struct extent_buffer *t; |
2960 | ||
234b63a0 | 2961 | for (i = level; i < BTRFS_MAX_LEVEL; i++) { |
be0e5c09 | 2962 | int tslot = path->slots[i]; |
eb60ceac | 2963 | if (!path->nodes[i]) |
be0e5c09 | 2964 | break; |
5f39d397 | 2965 | t = path->nodes[i]; |
32adf090 | 2966 | tree_mod_log_set_node_key(root->fs_info, t, tslot, 1); |
5f39d397 | 2967 | btrfs_set_node_key(t, key, tslot); |
d6025579 | 2968 | btrfs_mark_buffer_dirty(path->nodes[i]); |
be0e5c09 CM |
2969 | if (tslot != 0) |
2970 | break; | |
2971 | } | |
2972 | } | |
2973 | ||
31840ae1 ZY |
2974 | /* |
2975 | * update item key. | |
2976 | * | |
2977 | * This function isn't completely safe. It's the caller's responsibility | |
2978 | * that the new key won't break the order | |
2979 | */ | |
afe5fea7 | 2980 | void btrfs_set_item_key_safe(struct btrfs_root *root, struct btrfs_path *path, |
143bede5 | 2981 | struct btrfs_key *new_key) |
31840ae1 ZY |
2982 | { |
2983 | struct btrfs_disk_key disk_key; | |
2984 | struct extent_buffer *eb; | |
2985 | int slot; | |
2986 | ||
2987 | eb = path->nodes[0]; | |
2988 | slot = path->slots[0]; | |
2989 | if (slot > 0) { | |
2990 | btrfs_item_key(eb, &disk_key, slot - 1); | |
143bede5 | 2991 | BUG_ON(comp_keys(&disk_key, new_key) >= 0); |
31840ae1 ZY |
2992 | } |
2993 | if (slot < btrfs_header_nritems(eb) - 1) { | |
2994 | btrfs_item_key(eb, &disk_key, slot + 1); | |
143bede5 | 2995 | BUG_ON(comp_keys(&disk_key, new_key) <= 0); |
31840ae1 ZY |
2996 | } |
2997 | ||
2998 | btrfs_cpu_key_to_disk(&disk_key, new_key); | |
2999 | btrfs_set_item_key(eb, &disk_key, slot); | |
3000 | btrfs_mark_buffer_dirty(eb); | |
3001 | if (slot == 0) | |
d6a0a126 | 3002 | fixup_low_keys(root, path, &disk_key, 1); |
31840ae1 ZY |
3003 | } |
3004 | ||
74123bd7 CM |
3005 | /* |
3006 | * try to push data from one node into the next node left in the | |
79f95c82 | 3007 | * tree. |
aa5d6bed CM |
3008 | * |
3009 | * returns 0 if some ptrs were pushed left, < 0 if there was some horrible | |
3010 | * error, and > 0 if there was no room in the left hand block. | |
74123bd7 | 3011 | */ |
98ed5174 CM |
3012 | static int push_node_left(struct btrfs_trans_handle *trans, |
3013 | struct btrfs_root *root, struct extent_buffer *dst, | |
971a1f66 | 3014 | struct extent_buffer *src, int empty) |
be0e5c09 | 3015 | { |
be0e5c09 | 3016 | int push_items = 0; |
bb803951 CM |
3017 | int src_nritems; |
3018 | int dst_nritems; | |
aa5d6bed | 3019 | int ret = 0; |
be0e5c09 | 3020 | |
5f39d397 CM |
3021 | src_nritems = btrfs_header_nritems(src); |
3022 | dst_nritems = btrfs_header_nritems(dst); | |
123abc88 | 3023 | push_items = BTRFS_NODEPTRS_PER_BLOCK(root) - dst_nritems; |
7bb86316 CM |
3024 | WARN_ON(btrfs_header_generation(src) != trans->transid); |
3025 | WARN_ON(btrfs_header_generation(dst) != trans->transid); | |
54aa1f4d | 3026 | |
bce4eae9 | 3027 | if (!empty && src_nritems <= 8) |
971a1f66 CM |
3028 | return 1; |
3029 | ||
d397712b | 3030 | if (push_items <= 0) |
be0e5c09 CM |
3031 | return 1; |
3032 | ||
bce4eae9 | 3033 | if (empty) { |
971a1f66 | 3034 | push_items = min(src_nritems, push_items); |
bce4eae9 CM |
3035 | if (push_items < src_nritems) { |
3036 | /* leave at least 8 pointers in the node if | |
3037 | * we aren't going to empty it | |
3038 | */ | |
3039 | if (src_nritems - push_items < 8) { | |
3040 | if (push_items <= 8) | |
3041 | return 1; | |
3042 | push_items -= 8; | |
3043 | } | |
3044 | } | |
3045 | } else | |
3046 | push_items = min(src_nritems - 8, push_items); | |
79f95c82 | 3047 | |
f230475e | 3048 | tree_mod_log_eb_copy(root->fs_info, dst, src, dst_nritems, 0, |
90f8d62e | 3049 | push_items); |
5f39d397 CM |
3050 | copy_extent_buffer(dst, src, |
3051 | btrfs_node_key_ptr_offset(dst_nritems), | |
3052 | btrfs_node_key_ptr_offset(0), | |
d397712b | 3053 | push_items * sizeof(struct btrfs_key_ptr)); |
5f39d397 | 3054 | |
bb803951 | 3055 | if (push_items < src_nritems) { |
57911b8b JS |
3056 | /* |
3057 | * don't call tree_mod_log_eb_move here, key removal was already | |
3058 | * fully logged by tree_mod_log_eb_copy above. | |
3059 | */ | |
5f39d397 CM |
3060 | memmove_extent_buffer(src, btrfs_node_key_ptr_offset(0), |
3061 | btrfs_node_key_ptr_offset(push_items), | |
3062 | (src_nritems - push_items) * | |
3063 | sizeof(struct btrfs_key_ptr)); | |
3064 | } | |
3065 | btrfs_set_header_nritems(src, src_nritems - push_items); | |
3066 | btrfs_set_header_nritems(dst, dst_nritems + push_items); | |
3067 | btrfs_mark_buffer_dirty(src); | |
3068 | btrfs_mark_buffer_dirty(dst); | |
31840ae1 | 3069 | |
79f95c82 CM |
3070 | return ret; |
3071 | } | |
3072 | ||
3073 | /* | |
3074 | * try to push data from one node into the next node right in the | |
3075 | * tree. | |
3076 | * | |
3077 | * returns 0 if some ptrs were pushed, < 0 if there was some horrible | |
3078 | * error, and > 0 if there was no room in the right hand block. | |
3079 | * | |
3080 | * this will only push up to 1/2 the contents of the left node over | |
3081 | */ | |
5f39d397 CM |
3082 | static int balance_node_right(struct btrfs_trans_handle *trans, |
3083 | struct btrfs_root *root, | |
3084 | struct extent_buffer *dst, | |
3085 | struct extent_buffer *src) | |
79f95c82 | 3086 | { |
79f95c82 CM |
3087 | int push_items = 0; |
3088 | int max_push; | |
3089 | int src_nritems; | |
3090 | int dst_nritems; | |
3091 | int ret = 0; | |
79f95c82 | 3092 | |
7bb86316 CM |
3093 | WARN_ON(btrfs_header_generation(src) != trans->transid); |
3094 | WARN_ON(btrfs_header_generation(dst) != trans->transid); | |
3095 | ||
5f39d397 CM |
3096 | src_nritems = btrfs_header_nritems(src); |
3097 | dst_nritems = btrfs_header_nritems(dst); | |
123abc88 | 3098 | push_items = BTRFS_NODEPTRS_PER_BLOCK(root) - dst_nritems; |
d397712b | 3099 | if (push_items <= 0) |
79f95c82 | 3100 | return 1; |
bce4eae9 | 3101 | |
d397712b | 3102 | if (src_nritems < 4) |
bce4eae9 | 3103 | return 1; |
79f95c82 CM |
3104 | |
3105 | max_push = src_nritems / 2 + 1; | |
3106 | /* don't try to empty the node */ | |
d397712b | 3107 | if (max_push >= src_nritems) |
79f95c82 | 3108 | return 1; |
252c38f0 | 3109 | |
79f95c82 CM |
3110 | if (max_push < push_items) |
3111 | push_items = max_push; | |
3112 | ||
f230475e | 3113 | tree_mod_log_eb_move(root->fs_info, dst, push_items, 0, dst_nritems); |
5f39d397 CM |
3114 | memmove_extent_buffer(dst, btrfs_node_key_ptr_offset(push_items), |
3115 | btrfs_node_key_ptr_offset(0), | |
3116 | (dst_nritems) * | |
3117 | sizeof(struct btrfs_key_ptr)); | |
d6025579 | 3118 | |
f230475e | 3119 | tree_mod_log_eb_copy(root->fs_info, dst, src, 0, |
90f8d62e | 3120 | src_nritems - push_items, push_items); |
5f39d397 CM |
3121 | copy_extent_buffer(dst, src, |
3122 | btrfs_node_key_ptr_offset(0), | |
3123 | btrfs_node_key_ptr_offset(src_nritems - push_items), | |
d397712b | 3124 | push_items * sizeof(struct btrfs_key_ptr)); |
79f95c82 | 3125 | |
5f39d397 CM |
3126 | btrfs_set_header_nritems(src, src_nritems - push_items); |
3127 | btrfs_set_header_nritems(dst, dst_nritems + push_items); | |
79f95c82 | 3128 | |
5f39d397 CM |
3129 | btrfs_mark_buffer_dirty(src); |
3130 | btrfs_mark_buffer_dirty(dst); | |
31840ae1 | 3131 | |
aa5d6bed | 3132 | return ret; |
be0e5c09 CM |
3133 | } |
3134 | ||
97571fd0 CM |
3135 | /* |
3136 | * helper function to insert a new root level in the tree. | |
3137 | * A new node is allocated, and a single item is inserted to | |
3138 | * point to the existing root | |
aa5d6bed CM |
3139 | * |
3140 | * returns zero on success or < 0 on failure. | |
97571fd0 | 3141 | */ |
d397712b | 3142 | static noinline int insert_new_root(struct btrfs_trans_handle *trans, |
5f39d397 | 3143 | struct btrfs_root *root, |
90f8d62e | 3144 | struct btrfs_path *path, int level, int log_removal) |
5c680ed6 | 3145 | { |
7bb86316 | 3146 | u64 lower_gen; |
5f39d397 CM |
3147 | struct extent_buffer *lower; |
3148 | struct extent_buffer *c; | |
925baedd | 3149 | struct extent_buffer *old; |
5f39d397 | 3150 | struct btrfs_disk_key lower_key; |
5c680ed6 CM |
3151 | |
3152 | BUG_ON(path->nodes[level]); | |
3153 | BUG_ON(path->nodes[level-1] != root->node); | |
3154 | ||
7bb86316 CM |
3155 | lower = path->nodes[level-1]; |
3156 | if (level == 1) | |
3157 | btrfs_item_key(lower, &lower_key, 0); | |
3158 | else | |
3159 | btrfs_node_key(lower, &lower_key, 0); | |
3160 | ||
31840ae1 | 3161 | c = btrfs_alloc_free_block(trans, root, root->nodesize, 0, |
5d4f98a2 | 3162 | root->root_key.objectid, &lower_key, |
5581a51a | 3163 | level, root->node->start, 0); |
5f39d397 CM |
3164 | if (IS_ERR(c)) |
3165 | return PTR_ERR(c); | |
925baedd | 3166 | |
f0486c68 YZ |
3167 | root_add_used(root, root->nodesize); |
3168 | ||
5d4f98a2 | 3169 | memset_extent_buffer(c, 0, 0, sizeof(struct btrfs_header)); |
5f39d397 CM |
3170 | btrfs_set_header_nritems(c, 1); |
3171 | btrfs_set_header_level(c, level); | |
db94535d | 3172 | btrfs_set_header_bytenr(c, c->start); |
5f39d397 | 3173 | btrfs_set_header_generation(c, trans->transid); |
5d4f98a2 | 3174 | btrfs_set_header_backref_rev(c, BTRFS_MIXED_BACKREF_REV); |
5f39d397 | 3175 | btrfs_set_header_owner(c, root->root_key.objectid); |
5f39d397 CM |
3176 | |
3177 | write_extent_buffer(c, root->fs_info->fsid, | |
3178 | (unsigned long)btrfs_header_fsid(c), | |
3179 | BTRFS_FSID_SIZE); | |
e17cade2 CM |
3180 | |
3181 | write_extent_buffer(c, root->fs_info->chunk_tree_uuid, | |
3182 | (unsigned long)btrfs_header_chunk_tree_uuid(c), | |
3183 | BTRFS_UUID_SIZE); | |
3184 | ||
5f39d397 | 3185 | btrfs_set_node_key(c, &lower_key, 0); |
db94535d | 3186 | btrfs_set_node_blockptr(c, 0, lower->start); |
7bb86316 | 3187 | lower_gen = btrfs_header_generation(lower); |
31840ae1 | 3188 | WARN_ON(lower_gen != trans->transid); |
7bb86316 CM |
3189 | |
3190 | btrfs_set_node_ptr_generation(c, 0, lower_gen); | |
d5719762 | 3191 | |
5f39d397 | 3192 | btrfs_mark_buffer_dirty(c); |
d5719762 | 3193 | |
925baedd | 3194 | old = root->node; |
90f8d62e | 3195 | tree_mod_log_set_root_pointer(root, c, log_removal); |
240f62c8 | 3196 | rcu_assign_pointer(root->node, c); |
925baedd CM |
3197 | |
3198 | /* the super has an extra ref to root->node */ | |
3199 | free_extent_buffer(old); | |
3200 | ||
0b86a832 | 3201 | add_root_to_dirty_list(root); |
5f39d397 CM |
3202 | extent_buffer_get(c); |
3203 | path->nodes[level] = c; | |
bd681513 | 3204 | path->locks[level] = BTRFS_WRITE_LOCK; |
5c680ed6 CM |
3205 | path->slots[level] = 0; |
3206 | return 0; | |
3207 | } | |
3208 | ||
74123bd7 CM |
3209 | /* |
3210 | * worker function to insert a single pointer in a node. | |
3211 | * the node should have enough room for the pointer already | |
97571fd0 | 3212 | * |
74123bd7 CM |
3213 | * slot and level indicate where you want the key to go, and |
3214 | * blocknr is the block the key points to. | |
3215 | */ | |
143bede5 JM |
3216 | static void insert_ptr(struct btrfs_trans_handle *trans, |
3217 | struct btrfs_root *root, struct btrfs_path *path, | |
3218 | struct btrfs_disk_key *key, u64 bytenr, | |
c3e06965 | 3219 | int slot, int level) |
74123bd7 | 3220 | { |
5f39d397 | 3221 | struct extent_buffer *lower; |
74123bd7 | 3222 | int nritems; |
f3ea38da | 3223 | int ret; |
5c680ed6 CM |
3224 | |
3225 | BUG_ON(!path->nodes[level]); | |
f0486c68 | 3226 | btrfs_assert_tree_locked(path->nodes[level]); |
5f39d397 CM |
3227 | lower = path->nodes[level]; |
3228 | nritems = btrfs_header_nritems(lower); | |
c293498b | 3229 | BUG_ON(slot > nritems); |
143bede5 | 3230 | BUG_ON(nritems == BTRFS_NODEPTRS_PER_BLOCK(root)); |
74123bd7 | 3231 | if (slot != nritems) { |
c3e06965 | 3232 | if (level) |
f3ea38da JS |
3233 | tree_mod_log_eb_move(root->fs_info, lower, slot + 1, |
3234 | slot, nritems - slot); | |
5f39d397 CM |
3235 | memmove_extent_buffer(lower, |
3236 | btrfs_node_key_ptr_offset(slot + 1), | |
3237 | btrfs_node_key_ptr_offset(slot), | |
d6025579 | 3238 | (nritems - slot) * sizeof(struct btrfs_key_ptr)); |
74123bd7 | 3239 | } |
c3e06965 | 3240 | if (level) { |
f3ea38da JS |
3241 | ret = tree_mod_log_insert_key(root->fs_info, lower, slot, |
3242 | MOD_LOG_KEY_ADD); | |
3243 | BUG_ON(ret < 0); | |
3244 | } | |
5f39d397 | 3245 | btrfs_set_node_key(lower, key, slot); |
db94535d | 3246 | btrfs_set_node_blockptr(lower, slot, bytenr); |
74493f7a CM |
3247 | WARN_ON(trans->transid == 0); |
3248 | btrfs_set_node_ptr_generation(lower, slot, trans->transid); | |
5f39d397 CM |
3249 | btrfs_set_header_nritems(lower, nritems + 1); |
3250 | btrfs_mark_buffer_dirty(lower); | |
74123bd7 CM |
3251 | } |
3252 | ||
97571fd0 CM |
3253 | /* |
3254 | * split the node at the specified level in path in two. | |
3255 | * The path is corrected to point to the appropriate node after the split | |
3256 | * | |
3257 | * Before splitting this tries to make some room in the node by pushing | |
3258 | * left and right, if either one works, it returns right away. | |
aa5d6bed CM |
3259 | * |
3260 | * returns 0 on success and < 0 on failure | |
97571fd0 | 3261 | */ |
e02119d5 CM |
3262 | static noinline int split_node(struct btrfs_trans_handle *trans, |
3263 | struct btrfs_root *root, | |
3264 | struct btrfs_path *path, int level) | |
be0e5c09 | 3265 | { |
5f39d397 CM |
3266 | struct extent_buffer *c; |
3267 | struct extent_buffer *split; | |
3268 | struct btrfs_disk_key disk_key; | |
be0e5c09 | 3269 | int mid; |
5c680ed6 | 3270 | int ret; |
7518a238 | 3271 | u32 c_nritems; |
eb60ceac | 3272 | |
5f39d397 | 3273 | c = path->nodes[level]; |
7bb86316 | 3274 | WARN_ON(btrfs_header_generation(c) != trans->transid); |
5f39d397 | 3275 | if (c == root->node) { |
d9abbf1c | 3276 | /* |
90f8d62e JS |
3277 | * trying to split the root, lets make a new one |
3278 | * | |
3279 | * tree mod log: We pass 0 as log_removal parameter to | |
3280 | * insert_new_root, because that root buffer will be kept as a | |
3281 | * normal node. We are going to log removal of half of the | |
3282 | * elements below with tree_mod_log_eb_copy. We're holding a | |
3283 | * tree lock on the buffer, which is why we cannot race with | |
3284 | * other tree_mod_log users. | |
d9abbf1c | 3285 | */ |
90f8d62e | 3286 | ret = insert_new_root(trans, root, path, level + 1, 0); |
5c680ed6 CM |
3287 | if (ret) |
3288 | return ret; | |
b3612421 | 3289 | } else { |
e66f709b | 3290 | ret = push_nodes_for_insert(trans, root, path, level); |
5f39d397 CM |
3291 | c = path->nodes[level]; |
3292 | if (!ret && btrfs_header_nritems(c) < | |
c448acf0 | 3293 | BTRFS_NODEPTRS_PER_BLOCK(root) - 3) |
e66f709b | 3294 | return 0; |
54aa1f4d CM |
3295 | if (ret < 0) |
3296 | return ret; | |
be0e5c09 | 3297 | } |
e66f709b | 3298 | |
5f39d397 | 3299 | c_nritems = btrfs_header_nritems(c); |
5d4f98a2 YZ |
3300 | mid = (c_nritems + 1) / 2; |
3301 | btrfs_node_key(c, &disk_key, mid); | |
7bb86316 | 3302 | |
5d4f98a2 | 3303 | split = btrfs_alloc_free_block(trans, root, root->nodesize, 0, |
31840ae1 | 3304 | root->root_key.objectid, |
5581a51a | 3305 | &disk_key, level, c->start, 0); |
5f39d397 CM |
3306 | if (IS_ERR(split)) |
3307 | return PTR_ERR(split); | |
3308 | ||
f0486c68 YZ |
3309 | root_add_used(root, root->nodesize); |
3310 | ||
5d4f98a2 | 3311 | memset_extent_buffer(split, 0, 0, sizeof(struct btrfs_header)); |
5f39d397 | 3312 | btrfs_set_header_level(split, btrfs_header_level(c)); |
db94535d | 3313 | btrfs_set_header_bytenr(split, split->start); |
5f39d397 | 3314 | btrfs_set_header_generation(split, trans->transid); |
5d4f98a2 | 3315 | btrfs_set_header_backref_rev(split, BTRFS_MIXED_BACKREF_REV); |
5f39d397 CM |
3316 | btrfs_set_header_owner(split, root->root_key.objectid); |
3317 | write_extent_buffer(split, root->fs_info->fsid, | |
3318 | (unsigned long)btrfs_header_fsid(split), | |
3319 | BTRFS_FSID_SIZE); | |
e17cade2 CM |
3320 | write_extent_buffer(split, root->fs_info->chunk_tree_uuid, |
3321 | (unsigned long)btrfs_header_chunk_tree_uuid(split), | |
3322 | BTRFS_UUID_SIZE); | |
54aa1f4d | 3323 | |
90f8d62e | 3324 | tree_mod_log_eb_copy(root->fs_info, split, c, 0, mid, c_nritems - mid); |
5f39d397 CM |
3325 | copy_extent_buffer(split, c, |
3326 | btrfs_node_key_ptr_offset(0), | |
3327 | btrfs_node_key_ptr_offset(mid), | |
3328 | (c_nritems - mid) * sizeof(struct btrfs_key_ptr)); | |
3329 | btrfs_set_header_nritems(split, c_nritems - mid); | |
3330 | btrfs_set_header_nritems(c, mid); | |
aa5d6bed CM |
3331 | ret = 0; |
3332 | ||
5f39d397 CM |
3333 | btrfs_mark_buffer_dirty(c); |
3334 | btrfs_mark_buffer_dirty(split); | |
3335 | ||
143bede5 | 3336 | insert_ptr(trans, root, path, &disk_key, split->start, |
c3e06965 | 3337 | path->slots[level + 1] + 1, level + 1); |
aa5d6bed | 3338 | |
5de08d7d | 3339 | if (path->slots[level] >= mid) { |
5c680ed6 | 3340 | path->slots[level] -= mid; |
925baedd | 3341 | btrfs_tree_unlock(c); |
5f39d397 CM |
3342 | free_extent_buffer(c); |
3343 | path->nodes[level] = split; | |
5c680ed6 CM |
3344 | path->slots[level + 1] += 1; |
3345 | } else { | |
925baedd | 3346 | btrfs_tree_unlock(split); |
5f39d397 | 3347 | free_extent_buffer(split); |
be0e5c09 | 3348 | } |
aa5d6bed | 3349 | return ret; |
be0e5c09 CM |
3350 | } |
3351 | ||
74123bd7 CM |
3352 | /* |
3353 | * how many bytes are required to store the items in a leaf. start | |
3354 | * and nr indicate which items in the leaf to check. This totals up the | |
3355 | * space used both by the item structs and the item data | |
3356 | */ | |
5f39d397 | 3357 | static int leaf_space_used(struct extent_buffer *l, int start, int nr) |
be0e5c09 | 3358 | { |
41be1f3b JB |
3359 | struct btrfs_item *start_item; |
3360 | struct btrfs_item *end_item; | |
3361 | struct btrfs_map_token token; | |
be0e5c09 | 3362 | int data_len; |
5f39d397 | 3363 | int nritems = btrfs_header_nritems(l); |
d4dbff95 | 3364 | int end = min(nritems, start + nr) - 1; |
be0e5c09 CM |
3365 | |
3366 | if (!nr) | |
3367 | return 0; | |
41be1f3b JB |
3368 | btrfs_init_map_token(&token); |
3369 | start_item = btrfs_item_nr(l, start); | |
3370 | end_item = btrfs_item_nr(l, end); | |
3371 | data_len = btrfs_token_item_offset(l, start_item, &token) + | |
3372 | btrfs_token_item_size(l, start_item, &token); | |
3373 | data_len = data_len - btrfs_token_item_offset(l, end_item, &token); | |
0783fcfc | 3374 | data_len += sizeof(struct btrfs_item) * nr; |
d4dbff95 | 3375 | WARN_ON(data_len < 0); |
be0e5c09 CM |
3376 | return data_len; |
3377 | } | |
3378 | ||
d4dbff95 CM |
3379 | /* |
3380 | * The space between the end of the leaf items and | |
3381 | * the start of the leaf data. IOW, how much room | |
3382 | * the leaf has left for both items and data | |
3383 | */ | |
d397712b | 3384 | noinline int btrfs_leaf_free_space(struct btrfs_root *root, |
e02119d5 | 3385 | struct extent_buffer *leaf) |
d4dbff95 | 3386 | { |
5f39d397 CM |
3387 | int nritems = btrfs_header_nritems(leaf); |
3388 | int ret; | |
3389 | ret = BTRFS_LEAF_DATA_SIZE(root) - leaf_space_used(leaf, 0, nritems); | |
3390 | if (ret < 0) { | |
d397712b CM |
3391 | printk(KERN_CRIT "leaf free space ret %d, leaf data size %lu, " |
3392 | "used %d nritems %d\n", | |
ae2f5411 | 3393 | ret, (unsigned long) BTRFS_LEAF_DATA_SIZE(root), |
5f39d397 CM |
3394 | leaf_space_used(leaf, 0, nritems), nritems); |
3395 | } | |
3396 | return ret; | |
d4dbff95 CM |
3397 | } |
3398 | ||
99d8f83c CM |
3399 | /* |
3400 | * min slot controls the lowest index we're willing to push to the | |
3401 | * right. We'll push up to and including min_slot, but no lower | |
3402 | */ | |
44871b1b CM |
3403 | static noinline int __push_leaf_right(struct btrfs_trans_handle *trans, |
3404 | struct btrfs_root *root, | |
3405 | struct btrfs_path *path, | |
3406 | int data_size, int empty, | |
3407 | struct extent_buffer *right, | |
99d8f83c CM |
3408 | int free_space, u32 left_nritems, |
3409 | u32 min_slot) | |
00ec4c51 | 3410 | { |
5f39d397 | 3411 | struct extent_buffer *left = path->nodes[0]; |
44871b1b | 3412 | struct extent_buffer *upper = path->nodes[1]; |
cfed81a0 | 3413 | struct btrfs_map_token token; |
5f39d397 | 3414 | struct btrfs_disk_key disk_key; |
00ec4c51 | 3415 | int slot; |
34a38218 | 3416 | u32 i; |
00ec4c51 CM |
3417 | int push_space = 0; |
3418 | int push_items = 0; | |
0783fcfc | 3419 | struct btrfs_item *item; |
34a38218 | 3420 | u32 nr; |
7518a238 | 3421 | u32 right_nritems; |
5f39d397 | 3422 | u32 data_end; |
db94535d | 3423 | u32 this_item_size; |
00ec4c51 | 3424 | |
cfed81a0 CM |
3425 | btrfs_init_map_token(&token); |
3426 | ||
34a38218 CM |
3427 | if (empty) |
3428 | nr = 0; | |
3429 | else | |
99d8f83c | 3430 | nr = max_t(u32, 1, min_slot); |
34a38218 | 3431 | |
31840ae1 | 3432 | if (path->slots[0] >= left_nritems) |
87b29b20 | 3433 | push_space += data_size; |
31840ae1 | 3434 | |
44871b1b | 3435 | slot = path->slots[1]; |
34a38218 CM |
3436 | i = left_nritems - 1; |
3437 | while (i >= nr) { | |
5f39d397 | 3438 | item = btrfs_item_nr(left, i); |
db94535d | 3439 | |
31840ae1 ZY |
3440 | if (!empty && push_items > 0) { |
3441 | if (path->slots[0] > i) | |
3442 | break; | |
3443 | if (path->slots[0] == i) { | |
3444 | int space = btrfs_leaf_free_space(root, left); | |
3445 | if (space + push_space * 2 > free_space) | |
3446 | break; | |
3447 | } | |
3448 | } | |
3449 | ||
00ec4c51 | 3450 | if (path->slots[0] == i) |
87b29b20 | 3451 | push_space += data_size; |
db94535d | 3452 | |
db94535d CM |
3453 | this_item_size = btrfs_item_size(left, item); |
3454 | if (this_item_size + sizeof(*item) + push_space > free_space) | |
00ec4c51 | 3455 | break; |
31840ae1 | 3456 | |
00ec4c51 | 3457 | push_items++; |
db94535d | 3458 | push_space += this_item_size + sizeof(*item); |
34a38218 CM |
3459 | if (i == 0) |
3460 | break; | |
3461 | i--; | |
db94535d | 3462 | } |
5f39d397 | 3463 | |
925baedd CM |
3464 | if (push_items == 0) |
3465 | goto out_unlock; | |
5f39d397 | 3466 | |
6c1500f2 | 3467 | WARN_ON(!empty && push_items == left_nritems); |
5f39d397 | 3468 | |
00ec4c51 | 3469 | /* push left to right */ |
5f39d397 | 3470 | right_nritems = btrfs_header_nritems(right); |
34a38218 | 3471 | |
5f39d397 | 3472 | push_space = btrfs_item_end_nr(left, left_nritems - push_items); |
123abc88 | 3473 | push_space -= leaf_data_end(root, left); |
5f39d397 | 3474 | |
00ec4c51 | 3475 | /* make room in the right data area */ |
5f39d397 CM |
3476 | data_end = leaf_data_end(root, right); |
3477 | memmove_extent_buffer(right, | |
3478 | btrfs_leaf_data(right) + data_end - push_space, | |
3479 | btrfs_leaf_data(right) + data_end, | |
3480 | BTRFS_LEAF_DATA_SIZE(root) - data_end); | |
3481 | ||
00ec4c51 | 3482 | /* copy from the left data area */ |
5f39d397 | 3483 | copy_extent_buffer(right, left, btrfs_leaf_data(right) + |
d6025579 CM |
3484 | BTRFS_LEAF_DATA_SIZE(root) - push_space, |
3485 | btrfs_leaf_data(left) + leaf_data_end(root, left), | |
3486 | push_space); | |
5f39d397 CM |
3487 | |
3488 | memmove_extent_buffer(right, btrfs_item_nr_offset(push_items), | |
3489 | btrfs_item_nr_offset(0), | |
3490 | right_nritems * sizeof(struct btrfs_item)); | |
3491 | ||
00ec4c51 | 3492 | /* copy the items from left to right */ |
5f39d397 CM |
3493 | copy_extent_buffer(right, left, btrfs_item_nr_offset(0), |
3494 | btrfs_item_nr_offset(left_nritems - push_items), | |
3495 | push_items * sizeof(struct btrfs_item)); | |
00ec4c51 CM |
3496 | |
3497 | /* update the item pointers */ | |
7518a238 | 3498 | right_nritems += push_items; |
5f39d397 | 3499 | btrfs_set_header_nritems(right, right_nritems); |
123abc88 | 3500 | push_space = BTRFS_LEAF_DATA_SIZE(root); |
7518a238 | 3501 | for (i = 0; i < right_nritems; i++) { |
5f39d397 | 3502 | item = btrfs_item_nr(right, i); |
cfed81a0 CM |
3503 | push_space -= btrfs_token_item_size(right, item, &token); |
3504 | btrfs_set_token_item_offset(right, item, push_space, &token); | |
db94535d CM |
3505 | } |
3506 | ||
7518a238 | 3507 | left_nritems -= push_items; |
5f39d397 | 3508 | btrfs_set_header_nritems(left, left_nritems); |
00ec4c51 | 3509 | |
34a38218 CM |
3510 | if (left_nritems) |
3511 | btrfs_mark_buffer_dirty(left); | |
f0486c68 YZ |
3512 | else |
3513 | clean_tree_block(trans, root, left); | |
3514 | ||
5f39d397 | 3515 | btrfs_mark_buffer_dirty(right); |
a429e513 | 3516 | |
5f39d397 CM |
3517 | btrfs_item_key(right, &disk_key, 0); |
3518 | btrfs_set_node_key(upper, &disk_key, slot + 1); | |
d6025579 | 3519 | btrfs_mark_buffer_dirty(upper); |
02217ed2 | 3520 | |
00ec4c51 | 3521 | /* then fixup the leaf pointer in the path */ |
7518a238 CM |
3522 | if (path->slots[0] >= left_nritems) { |
3523 | path->slots[0] -= left_nritems; | |
925baedd CM |
3524 | if (btrfs_header_nritems(path->nodes[0]) == 0) |
3525 | clean_tree_block(trans, root, path->nodes[0]); | |
3526 | btrfs_tree_unlock(path->nodes[0]); | |
5f39d397 CM |
3527 | free_extent_buffer(path->nodes[0]); |
3528 | path->nodes[0] = right; | |
00ec4c51 CM |
3529 | path->slots[1] += 1; |
3530 | } else { | |
925baedd | 3531 | btrfs_tree_unlock(right); |
5f39d397 | 3532 | free_extent_buffer(right); |
00ec4c51 CM |
3533 | } |
3534 | return 0; | |
925baedd CM |
3535 | |
3536 | out_unlock: | |
3537 | btrfs_tree_unlock(right); | |
3538 | free_extent_buffer(right); | |
3539 | return 1; | |
00ec4c51 | 3540 | } |
925baedd | 3541 | |
44871b1b CM |
3542 | /* |
3543 | * push some data in the path leaf to the right, trying to free up at | |
3544 | * least data_size bytes. returns zero if the push worked, nonzero otherwise | |
3545 | * | |
3546 | * returns 1 if the push failed because the other node didn't have enough | |
3547 | * room, 0 if everything worked out and < 0 if there were major errors. | |
99d8f83c CM |
3548 | * |
3549 | * this will push starting from min_slot to the end of the leaf. It won't | |
3550 | * push any slot lower than min_slot | |
44871b1b CM |
3551 | */ |
3552 | static int push_leaf_right(struct btrfs_trans_handle *trans, struct btrfs_root | |
99d8f83c CM |
3553 | *root, struct btrfs_path *path, |
3554 | int min_data_size, int data_size, | |
3555 | int empty, u32 min_slot) | |
44871b1b CM |
3556 | { |
3557 | struct extent_buffer *left = path->nodes[0]; | |
3558 | struct extent_buffer *right; | |
3559 | struct extent_buffer *upper; | |
3560 | int slot; | |
3561 | int free_space; | |
3562 | u32 left_nritems; | |
3563 | int ret; | |
3564 | ||
3565 | if (!path->nodes[1]) | |
3566 | return 1; | |
3567 | ||
3568 | slot = path->slots[1]; | |
3569 | upper = path->nodes[1]; | |
3570 | if (slot >= btrfs_header_nritems(upper) - 1) | |
3571 | return 1; | |
3572 | ||
3573 | btrfs_assert_tree_locked(path->nodes[1]); | |
3574 | ||
3575 | right = read_node_slot(root, upper, slot + 1); | |
91ca338d TI |
3576 | if (right == NULL) |
3577 | return 1; | |
3578 | ||
44871b1b CM |
3579 | btrfs_tree_lock(right); |
3580 | btrfs_set_lock_blocking(right); | |
3581 | ||
3582 | free_space = btrfs_leaf_free_space(root, right); | |
3583 | if (free_space < data_size) | |
3584 | goto out_unlock; | |
3585 | ||
3586 | /* cow and double check */ | |
3587 | ret = btrfs_cow_block(trans, root, right, upper, | |
3588 | slot + 1, &right); | |
3589 | if (ret) | |
3590 | goto out_unlock; | |
3591 | ||
3592 | free_space = btrfs_leaf_free_space(root, right); | |
3593 | if (free_space < data_size) | |
3594 | goto out_unlock; | |
3595 | ||
3596 | left_nritems = btrfs_header_nritems(left); | |
3597 | if (left_nritems == 0) | |
3598 | goto out_unlock; | |
3599 | ||
99d8f83c CM |
3600 | return __push_leaf_right(trans, root, path, min_data_size, empty, |
3601 | right, free_space, left_nritems, min_slot); | |
44871b1b CM |
3602 | out_unlock: |
3603 | btrfs_tree_unlock(right); | |
3604 | free_extent_buffer(right); | |
3605 | return 1; | |
3606 | } | |
3607 | ||
74123bd7 CM |
3608 | /* |
3609 | * push some data in the path leaf to the left, trying to free up at | |
3610 | * least data_size bytes. returns zero if the push worked, nonzero otherwise | |
99d8f83c CM |
3611 | * |
3612 | * max_slot can put a limit on how far into the leaf we'll push items. The | |
3613 | * item at 'max_slot' won't be touched. Use (u32)-1 to make us do all the | |
3614 | * items | |
74123bd7 | 3615 | */ |
44871b1b CM |
3616 | static noinline int __push_leaf_left(struct btrfs_trans_handle *trans, |
3617 | struct btrfs_root *root, | |
3618 | struct btrfs_path *path, int data_size, | |
3619 | int empty, struct extent_buffer *left, | |
99d8f83c CM |
3620 | int free_space, u32 right_nritems, |
3621 | u32 max_slot) | |
be0e5c09 | 3622 | { |
5f39d397 CM |
3623 | struct btrfs_disk_key disk_key; |
3624 | struct extent_buffer *right = path->nodes[0]; | |
be0e5c09 | 3625 | int i; |
be0e5c09 CM |
3626 | int push_space = 0; |
3627 | int push_items = 0; | |
0783fcfc | 3628 | struct btrfs_item *item; |
7518a238 | 3629 | u32 old_left_nritems; |
34a38218 | 3630 | u32 nr; |
aa5d6bed | 3631 | int ret = 0; |
db94535d CM |
3632 | u32 this_item_size; |
3633 | u32 old_left_item_size; | |
cfed81a0 CM |
3634 | struct btrfs_map_token token; |
3635 | ||
3636 | btrfs_init_map_token(&token); | |
be0e5c09 | 3637 | |
34a38218 | 3638 | if (empty) |
99d8f83c | 3639 | nr = min(right_nritems, max_slot); |
34a38218 | 3640 | else |
99d8f83c | 3641 | nr = min(right_nritems - 1, max_slot); |
34a38218 CM |
3642 | |
3643 | for (i = 0; i < nr; i++) { | |
5f39d397 | 3644 | item = btrfs_item_nr(right, i); |
db94535d | 3645 | |
31840ae1 ZY |
3646 | if (!empty && push_items > 0) { |
3647 | if (path->slots[0] < i) | |
3648 | break; | |
3649 | if (path->slots[0] == i) { | |
3650 | int space = btrfs_leaf_free_space(root, right); | |
3651 | if (space + push_space * 2 > free_space) | |
3652 | break; | |
3653 | } | |
3654 | } | |
3655 | ||
be0e5c09 | 3656 | if (path->slots[0] == i) |
87b29b20 | 3657 | push_space += data_size; |
db94535d CM |
3658 | |
3659 | this_item_size = btrfs_item_size(right, item); | |
3660 | if (this_item_size + sizeof(*item) + push_space > free_space) | |
be0e5c09 | 3661 | break; |
db94535d | 3662 | |
be0e5c09 | 3663 | push_items++; |
db94535d CM |
3664 | push_space += this_item_size + sizeof(*item); |
3665 | } | |
3666 | ||
be0e5c09 | 3667 | if (push_items == 0) { |
925baedd CM |
3668 | ret = 1; |
3669 | goto out; | |
be0e5c09 | 3670 | } |
34a38218 | 3671 | if (!empty && push_items == btrfs_header_nritems(right)) |
a429e513 | 3672 | WARN_ON(1); |
5f39d397 | 3673 | |
be0e5c09 | 3674 | /* push data from right to left */ |
5f39d397 CM |
3675 | copy_extent_buffer(left, right, |
3676 | btrfs_item_nr_offset(btrfs_header_nritems(left)), | |
3677 | btrfs_item_nr_offset(0), | |
3678 | push_items * sizeof(struct btrfs_item)); | |
3679 | ||
123abc88 | 3680 | push_space = BTRFS_LEAF_DATA_SIZE(root) - |
d397712b | 3681 | btrfs_item_offset_nr(right, push_items - 1); |
5f39d397 CM |
3682 | |
3683 | copy_extent_buffer(left, right, btrfs_leaf_data(left) + | |
d6025579 CM |
3684 | leaf_data_end(root, left) - push_space, |
3685 | btrfs_leaf_data(right) + | |
5f39d397 | 3686 | btrfs_item_offset_nr(right, push_items - 1), |
d6025579 | 3687 | push_space); |
5f39d397 | 3688 | old_left_nritems = btrfs_header_nritems(left); |
87b29b20 | 3689 | BUG_ON(old_left_nritems <= 0); |
eb60ceac | 3690 | |
db94535d | 3691 | old_left_item_size = btrfs_item_offset_nr(left, old_left_nritems - 1); |
0783fcfc | 3692 | for (i = old_left_nritems; i < old_left_nritems + push_items; i++) { |
5f39d397 | 3693 | u32 ioff; |
db94535d | 3694 | |
5f39d397 | 3695 | item = btrfs_item_nr(left, i); |
db94535d | 3696 | |
cfed81a0 CM |
3697 | ioff = btrfs_token_item_offset(left, item, &token); |
3698 | btrfs_set_token_item_offset(left, item, | |
3699 | ioff - (BTRFS_LEAF_DATA_SIZE(root) - old_left_item_size), | |
3700 | &token); | |
be0e5c09 | 3701 | } |
5f39d397 | 3702 | btrfs_set_header_nritems(left, old_left_nritems + push_items); |
be0e5c09 CM |
3703 | |
3704 | /* fixup right node */ | |
31b1a2bd JL |
3705 | if (push_items > right_nritems) |
3706 | WARN(1, KERN_CRIT "push items %d nr %u\n", push_items, | |
d397712b | 3707 | right_nritems); |
34a38218 CM |
3708 | |
3709 | if (push_items < right_nritems) { | |
3710 | push_space = btrfs_item_offset_nr(right, push_items - 1) - | |
3711 | leaf_data_end(root, right); | |
3712 | memmove_extent_buffer(right, btrfs_leaf_data(right) + | |
3713 | BTRFS_LEAF_DATA_SIZE(root) - push_space, | |
3714 | btrfs_leaf_data(right) + | |
3715 | leaf_data_end(root, right), push_space); | |
3716 | ||
3717 | memmove_extent_buffer(right, btrfs_item_nr_offset(0), | |
5f39d397 CM |
3718 | btrfs_item_nr_offset(push_items), |
3719 | (btrfs_header_nritems(right) - push_items) * | |
3720 | sizeof(struct btrfs_item)); | |
34a38218 | 3721 | } |
eef1c494 Y |
3722 | right_nritems -= push_items; |
3723 | btrfs_set_header_nritems(right, right_nritems); | |
123abc88 | 3724 | push_space = BTRFS_LEAF_DATA_SIZE(root); |
5f39d397 CM |
3725 | for (i = 0; i < right_nritems; i++) { |
3726 | item = btrfs_item_nr(right, i); | |
db94535d | 3727 | |
cfed81a0 CM |
3728 | push_space = push_space - btrfs_token_item_size(right, |
3729 | item, &token); | |
3730 | btrfs_set_token_item_offset(right, item, push_space, &token); | |
db94535d | 3731 | } |
eb60ceac | 3732 | |
5f39d397 | 3733 | btrfs_mark_buffer_dirty(left); |
34a38218 CM |
3734 | if (right_nritems) |
3735 | btrfs_mark_buffer_dirty(right); | |
f0486c68 YZ |
3736 | else |
3737 | clean_tree_block(trans, root, right); | |
098f59c2 | 3738 | |
5f39d397 | 3739 | btrfs_item_key(right, &disk_key, 0); |
d6a0a126 | 3740 | fixup_low_keys(root, path, &disk_key, 1); |
be0e5c09 CM |
3741 | |
3742 | /* then fixup the leaf pointer in the path */ | |
3743 | if (path->slots[0] < push_items) { | |
3744 | path->slots[0] += old_left_nritems; | |
925baedd | 3745 | btrfs_tree_unlock(path->nodes[0]); |
5f39d397 CM |
3746 | free_extent_buffer(path->nodes[0]); |
3747 | path->nodes[0] = left; | |
be0e5c09 CM |
3748 | path->slots[1] -= 1; |
3749 | } else { | |
925baedd | 3750 | btrfs_tree_unlock(left); |
5f39d397 | 3751 | free_extent_buffer(left); |
be0e5c09 CM |
3752 | path->slots[0] -= push_items; |
3753 | } | |
eb60ceac | 3754 | BUG_ON(path->slots[0] < 0); |
aa5d6bed | 3755 | return ret; |
925baedd CM |
3756 | out: |
3757 | btrfs_tree_unlock(left); | |
3758 | free_extent_buffer(left); | |
3759 | return ret; | |
be0e5c09 CM |
3760 | } |
3761 | ||
44871b1b CM |
3762 | /* |
3763 | * push some data in the path leaf to the left, trying to free up at | |
3764 | * least data_size bytes. returns zero if the push worked, nonzero otherwise | |
99d8f83c CM |
3765 | * |
3766 | * max_slot can put a limit on how far into the leaf we'll push items. The | |
3767 | * item at 'max_slot' won't be touched. Use (u32)-1 to make us push all the | |
3768 | * items | |
44871b1b CM |
3769 | */ |
3770 | static int push_leaf_left(struct btrfs_trans_handle *trans, struct btrfs_root | |
99d8f83c CM |
3771 | *root, struct btrfs_path *path, int min_data_size, |
3772 | int data_size, int empty, u32 max_slot) | |
44871b1b CM |
3773 | { |
3774 | struct extent_buffer *right = path->nodes[0]; | |
3775 | struct extent_buffer *left; | |
3776 | int slot; | |
3777 | int free_space; | |
3778 | u32 right_nritems; | |
3779 | int ret = 0; | |
3780 | ||
3781 | slot = path->slots[1]; | |
3782 | if (slot == 0) | |
3783 | return 1; | |
3784 | if (!path->nodes[1]) | |
3785 | return 1; | |
3786 | ||
3787 | right_nritems = btrfs_header_nritems(right); | |
3788 | if (right_nritems == 0) | |
3789 | return 1; | |
3790 | ||
3791 | btrfs_assert_tree_locked(path->nodes[1]); | |
3792 | ||
3793 | left = read_node_slot(root, path->nodes[1], slot - 1); | |
91ca338d TI |
3794 | if (left == NULL) |
3795 | return 1; | |
3796 | ||
44871b1b CM |
3797 | btrfs_tree_lock(left); |
3798 | btrfs_set_lock_blocking(left); | |
3799 | ||
3800 | free_space = btrfs_leaf_free_space(root, left); | |
3801 | if (free_space < data_size) { | |
3802 | ret = 1; | |
3803 | goto out; | |
3804 | } | |
3805 | ||
3806 | /* cow and double check */ | |
3807 | ret = btrfs_cow_block(trans, root, left, | |
3808 | path->nodes[1], slot - 1, &left); | |
3809 | if (ret) { | |
3810 | /* we hit -ENOSPC, but it isn't fatal here */ | |
79787eaa JM |
3811 | if (ret == -ENOSPC) |
3812 | ret = 1; | |
44871b1b CM |
3813 | goto out; |
3814 | } | |
3815 | ||
3816 | free_space = btrfs_leaf_free_space(root, left); | |
3817 | if (free_space < data_size) { | |
3818 | ret = 1; | |
3819 | goto out; | |
3820 | } | |
3821 | ||
99d8f83c CM |
3822 | return __push_leaf_left(trans, root, path, min_data_size, |
3823 | empty, left, free_space, right_nritems, | |
3824 | max_slot); | |
44871b1b CM |
3825 | out: |
3826 | btrfs_tree_unlock(left); | |
3827 | free_extent_buffer(left); | |
3828 | return ret; | |
3829 | } | |
3830 | ||
3831 | /* | |
3832 | * split the path's leaf in two, making sure there is at least data_size | |
3833 | * available for the resulting leaf level of the path. | |
44871b1b | 3834 | */ |
143bede5 JM |
3835 | static noinline void copy_for_split(struct btrfs_trans_handle *trans, |
3836 | struct btrfs_root *root, | |
3837 | struct btrfs_path *path, | |
3838 | struct extent_buffer *l, | |
3839 | struct extent_buffer *right, | |
3840 | int slot, int mid, int nritems) | |
44871b1b CM |
3841 | { |
3842 | int data_copy_size; | |
3843 | int rt_data_off; | |
3844 | int i; | |
44871b1b | 3845 | struct btrfs_disk_key disk_key; |
cfed81a0 CM |
3846 | struct btrfs_map_token token; |
3847 | ||
3848 | btrfs_init_map_token(&token); | |
44871b1b CM |
3849 | |
3850 | nritems = nritems - mid; | |
3851 | btrfs_set_header_nritems(right, nritems); | |
3852 | data_copy_size = btrfs_item_end_nr(l, mid) - leaf_data_end(root, l); | |
3853 | ||
3854 | copy_extent_buffer(right, l, btrfs_item_nr_offset(0), | |
3855 | btrfs_item_nr_offset(mid), | |
3856 | nritems * sizeof(struct btrfs_item)); | |
3857 | ||
3858 | copy_extent_buffer(right, l, | |
3859 | btrfs_leaf_data(right) + BTRFS_LEAF_DATA_SIZE(root) - | |
3860 | data_copy_size, btrfs_leaf_data(l) + | |
3861 | leaf_data_end(root, l), data_copy_size); | |
3862 | ||
3863 | rt_data_off = BTRFS_LEAF_DATA_SIZE(root) - | |
3864 | btrfs_item_end_nr(l, mid); | |
3865 | ||
3866 | for (i = 0; i < nritems; i++) { | |
3867 | struct btrfs_item *item = btrfs_item_nr(right, i); | |
3868 | u32 ioff; | |
3869 | ||
cfed81a0 CM |
3870 | ioff = btrfs_token_item_offset(right, item, &token); |
3871 | btrfs_set_token_item_offset(right, item, | |
3872 | ioff + rt_data_off, &token); | |
44871b1b CM |
3873 | } |
3874 | ||
44871b1b | 3875 | btrfs_set_header_nritems(l, mid); |
44871b1b | 3876 | btrfs_item_key(right, &disk_key, 0); |
143bede5 | 3877 | insert_ptr(trans, root, path, &disk_key, right->start, |
c3e06965 | 3878 | path->slots[1] + 1, 1); |
44871b1b CM |
3879 | |
3880 | btrfs_mark_buffer_dirty(right); | |
3881 | btrfs_mark_buffer_dirty(l); | |
3882 | BUG_ON(path->slots[0] != slot); | |
3883 | ||
44871b1b CM |
3884 | if (mid <= slot) { |
3885 | btrfs_tree_unlock(path->nodes[0]); | |
3886 | free_extent_buffer(path->nodes[0]); | |
3887 | path->nodes[0] = right; | |
3888 | path->slots[0] -= mid; | |
3889 | path->slots[1] += 1; | |
3890 | } else { | |
3891 | btrfs_tree_unlock(right); | |
3892 | free_extent_buffer(right); | |
3893 | } | |
3894 | ||
3895 | BUG_ON(path->slots[0] < 0); | |
44871b1b CM |
3896 | } |
3897 | ||
99d8f83c CM |
3898 | /* |
3899 | * double splits happen when we need to insert a big item in the middle | |
3900 | * of a leaf. A double split can leave us with 3 mostly empty leaves: | |
3901 | * leaf: [ slots 0 - N] [ our target ] [ N + 1 - total in leaf ] | |
3902 | * A B C | |
3903 | * | |
3904 | * We avoid this by trying to push the items on either side of our target | |
3905 | * into the adjacent leaves. If all goes well we can avoid the double split | |
3906 | * completely. | |
3907 | */ | |
3908 | static noinline int push_for_double_split(struct btrfs_trans_handle *trans, | |
3909 | struct btrfs_root *root, | |
3910 | struct btrfs_path *path, | |
3911 | int data_size) | |
3912 | { | |
3913 | int ret; | |
3914 | int progress = 0; | |
3915 | int slot; | |
3916 | u32 nritems; | |
3917 | ||
3918 | slot = path->slots[0]; | |
3919 | ||
3920 | /* | |
3921 | * try to push all the items after our slot into the | |
3922 | * right leaf | |
3923 | */ | |
3924 | ret = push_leaf_right(trans, root, path, 1, data_size, 0, slot); | |
3925 | if (ret < 0) | |
3926 | return ret; | |
3927 | ||
3928 | if (ret == 0) | |
3929 | progress++; | |
3930 | ||
3931 | nritems = btrfs_header_nritems(path->nodes[0]); | |
3932 | /* | |
3933 | * our goal is to get our slot at the start or end of a leaf. If | |
3934 | * we've done so we're done | |
3935 | */ | |
3936 | if (path->slots[0] == 0 || path->slots[0] == nritems) | |
3937 | return 0; | |
3938 | ||
3939 | if (btrfs_leaf_free_space(root, path->nodes[0]) >= data_size) | |
3940 | return 0; | |
3941 | ||
3942 | /* try to push all the items before our slot into the next leaf */ | |
3943 | slot = path->slots[0]; | |
3944 | ret = push_leaf_left(trans, root, path, 1, data_size, 0, slot); | |
3945 | if (ret < 0) | |
3946 | return ret; | |
3947 | ||
3948 | if (ret == 0) | |
3949 | progress++; | |
3950 | ||
3951 | if (progress) | |
3952 | return 0; | |
3953 | return 1; | |
3954 | } | |
3955 | ||
74123bd7 CM |
3956 | /* |
3957 | * split the path's leaf in two, making sure there is at least data_size | |
3958 | * available for the resulting leaf level of the path. | |
aa5d6bed CM |
3959 | * |
3960 | * returns 0 if all went well and < 0 on failure. | |
74123bd7 | 3961 | */ |
e02119d5 CM |
3962 | static noinline int split_leaf(struct btrfs_trans_handle *trans, |
3963 | struct btrfs_root *root, | |
3964 | struct btrfs_key *ins_key, | |
3965 | struct btrfs_path *path, int data_size, | |
3966 | int extend) | |
be0e5c09 | 3967 | { |
5d4f98a2 | 3968 | struct btrfs_disk_key disk_key; |
5f39d397 | 3969 | struct extent_buffer *l; |
7518a238 | 3970 | u32 nritems; |
eb60ceac CM |
3971 | int mid; |
3972 | int slot; | |
5f39d397 | 3973 | struct extent_buffer *right; |
d4dbff95 | 3974 | int ret = 0; |
aa5d6bed | 3975 | int wret; |
5d4f98a2 | 3976 | int split; |
cc0c5538 | 3977 | int num_doubles = 0; |
99d8f83c | 3978 | int tried_avoid_double = 0; |
aa5d6bed | 3979 | |
a5719521 YZ |
3980 | l = path->nodes[0]; |
3981 | slot = path->slots[0]; | |
3982 | if (extend && data_size + btrfs_item_size_nr(l, slot) + | |
3983 | sizeof(struct btrfs_item) > BTRFS_LEAF_DATA_SIZE(root)) | |
3984 | return -EOVERFLOW; | |
3985 | ||
40689478 | 3986 | /* first try to make some room by pushing left and right */ |
99d8f83c CM |
3987 | if (data_size) { |
3988 | wret = push_leaf_right(trans, root, path, data_size, | |
3989 | data_size, 0, 0); | |
d397712b | 3990 | if (wret < 0) |
eaee50e8 | 3991 | return wret; |
3685f791 | 3992 | if (wret) { |
99d8f83c CM |
3993 | wret = push_leaf_left(trans, root, path, data_size, |
3994 | data_size, 0, (u32)-1); | |
3685f791 CM |
3995 | if (wret < 0) |
3996 | return wret; | |
3997 | } | |
3998 | l = path->nodes[0]; | |
aa5d6bed | 3999 | |
3685f791 | 4000 | /* did the pushes work? */ |
87b29b20 | 4001 | if (btrfs_leaf_free_space(root, l) >= data_size) |
3685f791 | 4002 | return 0; |
3326d1b0 | 4003 | } |
aa5d6bed | 4004 | |
5c680ed6 | 4005 | if (!path->nodes[1]) { |
90f8d62e | 4006 | ret = insert_new_root(trans, root, path, 1, 1); |
5c680ed6 CM |
4007 | if (ret) |
4008 | return ret; | |
4009 | } | |
cc0c5538 | 4010 | again: |
5d4f98a2 | 4011 | split = 1; |
cc0c5538 | 4012 | l = path->nodes[0]; |
eb60ceac | 4013 | slot = path->slots[0]; |
5f39d397 | 4014 | nritems = btrfs_header_nritems(l); |
d397712b | 4015 | mid = (nritems + 1) / 2; |
54aa1f4d | 4016 | |
5d4f98a2 YZ |
4017 | if (mid <= slot) { |
4018 | if (nritems == 1 || | |
4019 | leaf_space_used(l, mid, nritems - mid) + data_size > | |
4020 | BTRFS_LEAF_DATA_SIZE(root)) { | |
4021 | if (slot >= nritems) { | |
4022 | split = 0; | |
4023 | } else { | |
4024 | mid = slot; | |
4025 | if (mid != nritems && | |
4026 | leaf_space_used(l, mid, nritems - mid) + | |
4027 | data_size > BTRFS_LEAF_DATA_SIZE(root)) { | |
99d8f83c CM |
4028 | if (data_size && !tried_avoid_double) |
4029 | goto push_for_double; | |
5d4f98a2 YZ |
4030 | split = 2; |
4031 | } | |
4032 | } | |
4033 | } | |
4034 | } else { | |
4035 | if (leaf_space_used(l, 0, mid) + data_size > | |
4036 | BTRFS_LEAF_DATA_SIZE(root)) { | |
4037 | if (!extend && data_size && slot == 0) { | |
4038 | split = 0; | |
4039 | } else if ((extend || !data_size) && slot == 0) { | |
4040 | mid = 1; | |
4041 | } else { | |
4042 | mid = slot; | |
4043 | if (mid != nritems && | |
4044 | leaf_space_used(l, mid, nritems - mid) + | |
4045 | data_size > BTRFS_LEAF_DATA_SIZE(root)) { | |
99d8f83c CM |
4046 | if (data_size && !tried_avoid_double) |
4047 | goto push_for_double; | |
5d4f98a2 YZ |
4048 | split = 2 ; |
4049 | } | |
4050 | } | |
4051 | } | |
4052 | } | |
4053 | ||
4054 | if (split == 0) | |
4055 | btrfs_cpu_key_to_disk(&disk_key, ins_key); | |
4056 | else | |
4057 | btrfs_item_key(l, &disk_key, mid); | |
4058 | ||
4059 | right = btrfs_alloc_free_block(trans, root, root->leafsize, 0, | |
31840ae1 | 4060 | root->root_key.objectid, |
5581a51a | 4061 | &disk_key, 0, l->start, 0); |
f0486c68 | 4062 | if (IS_ERR(right)) |
5f39d397 | 4063 | return PTR_ERR(right); |
f0486c68 YZ |
4064 | |
4065 | root_add_used(root, root->leafsize); | |
5f39d397 CM |
4066 | |
4067 | memset_extent_buffer(right, 0, 0, sizeof(struct btrfs_header)); | |
db94535d | 4068 | btrfs_set_header_bytenr(right, right->start); |
5f39d397 | 4069 | btrfs_set_header_generation(right, trans->transid); |
5d4f98a2 | 4070 | btrfs_set_header_backref_rev(right, BTRFS_MIXED_BACKREF_REV); |
5f39d397 CM |
4071 | btrfs_set_header_owner(right, root->root_key.objectid); |
4072 | btrfs_set_header_level(right, 0); | |
4073 | write_extent_buffer(right, root->fs_info->fsid, | |
4074 | (unsigned long)btrfs_header_fsid(right), | |
4075 | BTRFS_FSID_SIZE); | |
e17cade2 CM |
4076 | |
4077 | write_extent_buffer(right, root->fs_info->chunk_tree_uuid, | |
4078 | (unsigned long)btrfs_header_chunk_tree_uuid(right), | |
4079 | BTRFS_UUID_SIZE); | |
44871b1b | 4080 | |
5d4f98a2 YZ |
4081 | if (split == 0) { |
4082 | if (mid <= slot) { | |
4083 | btrfs_set_header_nritems(right, 0); | |
143bede5 | 4084 | insert_ptr(trans, root, path, &disk_key, right->start, |
c3e06965 | 4085 | path->slots[1] + 1, 1); |
5d4f98a2 YZ |
4086 | btrfs_tree_unlock(path->nodes[0]); |
4087 | free_extent_buffer(path->nodes[0]); | |
4088 | path->nodes[0] = right; | |
4089 | path->slots[0] = 0; | |
4090 | path->slots[1] += 1; | |
4091 | } else { | |
4092 | btrfs_set_header_nritems(right, 0); | |
143bede5 | 4093 | insert_ptr(trans, root, path, &disk_key, right->start, |
c3e06965 | 4094 | path->slots[1], 1); |
5d4f98a2 YZ |
4095 | btrfs_tree_unlock(path->nodes[0]); |
4096 | free_extent_buffer(path->nodes[0]); | |
4097 | path->nodes[0] = right; | |
4098 | path->slots[0] = 0; | |
143bede5 | 4099 | if (path->slots[1] == 0) |
d6a0a126 | 4100 | fixup_low_keys(root, path, &disk_key, 1); |
d4dbff95 | 4101 | } |
5d4f98a2 YZ |
4102 | btrfs_mark_buffer_dirty(right); |
4103 | return ret; | |
d4dbff95 | 4104 | } |
74123bd7 | 4105 | |
143bede5 | 4106 | copy_for_split(trans, root, path, l, right, slot, mid, nritems); |
31840ae1 | 4107 | |
5d4f98a2 | 4108 | if (split == 2) { |
cc0c5538 CM |
4109 | BUG_ON(num_doubles != 0); |
4110 | num_doubles++; | |
4111 | goto again; | |
a429e513 | 4112 | } |
44871b1b | 4113 | |
143bede5 | 4114 | return 0; |
99d8f83c CM |
4115 | |
4116 | push_for_double: | |
4117 | push_for_double_split(trans, root, path, data_size); | |
4118 | tried_avoid_double = 1; | |
4119 | if (btrfs_leaf_free_space(root, path->nodes[0]) >= data_size) | |
4120 | return 0; | |
4121 | goto again; | |
be0e5c09 CM |
4122 | } |
4123 | ||
ad48fd75 YZ |
4124 | static noinline int setup_leaf_for_split(struct btrfs_trans_handle *trans, |
4125 | struct btrfs_root *root, | |
4126 | struct btrfs_path *path, int ins_len) | |
459931ec | 4127 | { |
ad48fd75 | 4128 | struct btrfs_key key; |
459931ec | 4129 | struct extent_buffer *leaf; |
ad48fd75 YZ |
4130 | struct btrfs_file_extent_item *fi; |
4131 | u64 extent_len = 0; | |
4132 | u32 item_size; | |
4133 | int ret; | |
459931ec CM |
4134 | |
4135 | leaf = path->nodes[0]; | |
ad48fd75 YZ |
4136 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); |
4137 | ||
4138 | BUG_ON(key.type != BTRFS_EXTENT_DATA_KEY && | |
4139 | key.type != BTRFS_EXTENT_CSUM_KEY); | |
4140 | ||
4141 | if (btrfs_leaf_free_space(root, leaf) >= ins_len) | |
4142 | return 0; | |
459931ec CM |
4143 | |
4144 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
ad48fd75 YZ |
4145 | if (key.type == BTRFS_EXTENT_DATA_KEY) { |
4146 | fi = btrfs_item_ptr(leaf, path->slots[0], | |
4147 | struct btrfs_file_extent_item); | |
4148 | extent_len = btrfs_file_extent_num_bytes(leaf, fi); | |
4149 | } | |
b3b4aa74 | 4150 | btrfs_release_path(path); |
459931ec | 4151 | |
459931ec | 4152 | path->keep_locks = 1; |
ad48fd75 YZ |
4153 | path->search_for_split = 1; |
4154 | ret = btrfs_search_slot(trans, root, &key, path, 0, 1); | |
459931ec | 4155 | path->search_for_split = 0; |
ad48fd75 YZ |
4156 | if (ret < 0) |
4157 | goto err; | |
459931ec | 4158 | |
ad48fd75 YZ |
4159 | ret = -EAGAIN; |
4160 | leaf = path->nodes[0]; | |
459931ec | 4161 | /* if our item isn't there or got smaller, return now */ |
ad48fd75 YZ |
4162 | if (ret > 0 || item_size != btrfs_item_size_nr(leaf, path->slots[0])) |
4163 | goto err; | |
4164 | ||
109f6aef CM |
4165 | /* the leaf has changed, it now has room. return now */ |
4166 | if (btrfs_leaf_free_space(root, path->nodes[0]) >= ins_len) | |
4167 | goto err; | |
4168 | ||
ad48fd75 YZ |
4169 | if (key.type == BTRFS_EXTENT_DATA_KEY) { |
4170 | fi = btrfs_item_ptr(leaf, path->slots[0], | |
4171 | struct btrfs_file_extent_item); | |
4172 | if (extent_len != btrfs_file_extent_num_bytes(leaf, fi)) | |
4173 | goto err; | |
459931ec CM |
4174 | } |
4175 | ||
b9473439 | 4176 | btrfs_set_path_blocking(path); |
ad48fd75 | 4177 | ret = split_leaf(trans, root, &key, path, ins_len, 1); |
f0486c68 YZ |
4178 | if (ret) |
4179 | goto err; | |
459931ec | 4180 | |
ad48fd75 | 4181 | path->keep_locks = 0; |
b9473439 | 4182 | btrfs_unlock_up_safe(path, 1); |
ad48fd75 YZ |
4183 | return 0; |
4184 | err: | |
4185 | path->keep_locks = 0; | |
4186 | return ret; | |
4187 | } | |
4188 | ||
4189 | static noinline int split_item(struct btrfs_trans_handle *trans, | |
4190 | struct btrfs_root *root, | |
4191 | struct btrfs_path *path, | |
4192 | struct btrfs_key *new_key, | |
4193 | unsigned long split_offset) | |
4194 | { | |
4195 | struct extent_buffer *leaf; | |
4196 | struct btrfs_item *item; | |
4197 | struct btrfs_item *new_item; | |
4198 | int slot; | |
4199 | char *buf; | |
4200 | u32 nritems; | |
4201 | u32 item_size; | |
4202 | u32 orig_offset; | |
4203 | struct btrfs_disk_key disk_key; | |
4204 | ||
b9473439 CM |
4205 | leaf = path->nodes[0]; |
4206 | BUG_ON(btrfs_leaf_free_space(root, leaf) < sizeof(struct btrfs_item)); | |
4207 | ||
b4ce94de CM |
4208 | btrfs_set_path_blocking(path); |
4209 | ||
459931ec CM |
4210 | item = btrfs_item_nr(leaf, path->slots[0]); |
4211 | orig_offset = btrfs_item_offset(leaf, item); | |
4212 | item_size = btrfs_item_size(leaf, item); | |
4213 | ||
459931ec | 4214 | buf = kmalloc(item_size, GFP_NOFS); |
ad48fd75 YZ |
4215 | if (!buf) |
4216 | return -ENOMEM; | |
4217 | ||
459931ec CM |
4218 | read_extent_buffer(leaf, buf, btrfs_item_ptr_offset(leaf, |
4219 | path->slots[0]), item_size); | |
459931ec | 4220 | |
ad48fd75 | 4221 | slot = path->slots[0] + 1; |
459931ec | 4222 | nritems = btrfs_header_nritems(leaf); |
459931ec CM |
4223 | if (slot != nritems) { |
4224 | /* shift the items */ | |
4225 | memmove_extent_buffer(leaf, btrfs_item_nr_offset(slot + 1), | |
ad48fd75 YZ |
4226 | btrfs_item_nr_offset(slot), |
4227 | (nritems - slot) * sizeof(struct btrfs_item)); | |
459931ec CM |
4228 | } |
4229 | ||
4230 | btrfs_cpu_key_to_disk(&disk_key, new_key); | |
4231 | btrfs_set_item_key(leaf, &disk_key, slot); | |
4232 | ||
4233 | new_item = btrfs_item_nr(leaf, slot); | |
4234 | ||
4235 | btrfs_set_item_offset(leaf, new_item, orig_offset); | |
4236 | btrfs_set_item_size(leaf, new_item, item_size - split_offset); | |
4237 | ||
4238 | btrfs_set_item_offset(leaf, item, | |
4239 | orig_offset + item_size - split_offset); | |
4240 | btrfs_set_item_size(leaf, item, split_offset); | |
4241 | ||
4242 | btrfs_set_header_nritems(leaf, nritems + 1); | |
4243 | ||
4244 | /* write the data for the start of the original item */ | |
4245 | write_extent_buffer(leaf, buf, | |
4246 | btrfs_item_ptr_offset(leaf, path->slots[0]), | |
4247 | split_offset); | |
4248 | ||
4249 | /* write the data for the new item */ | |
4250 | write_extent_buffer(leaf, buf + split_offset, | |
4251 | btrfs_item_ptr_offset(leaf, slot), | |
4252 | item_size - split_offset); | |
4253 | btrfs_mark_buffer_dirty(leaf); | |
4254 | ||
ad48fd75 | 4255 | BUG_ON(btrfs_leaf_free_space(root, leaf) < 0); |
459931ec | 4256 | kfree(buf); |
ad48fd75 YZ |
4257 | return 0; |
4258 | } | |
4259 | ||
4260 | /* | |
4261 | * This function splits a single item into two items, | |
4262 | * giving 'new_key' to the new item and splitting the | |
4263 | * old one at split_offset (from the start of the item). | |
4264 | * | |
4265 | * The path may be released by this operation. After | |
4266 | * the split, the path is pointing to the old item. The | |
4267 | * new item is going to be in the same node as the old one. | |
4268 | * | |
4269 | * Note, the item being split must be smaller enough to live alone on | |
4270 | * a tree block with room for one extra struct btrfs_item | |
4271 | * | |
4272 | * This allows us to split the item in place, keeping a lock on the | |
4273 | * leaf the entire time. | |
4274 | */ | |
4275 | int btrfs_split_item(struct btrfs_trans_handle *trans, | |
4276 | struct btrfs_root *root, | |
4277 | struct btrfs_path *path, | |
4278 | struct btrfs_key *new_key, | |
4279 | unsigned long split_offset) | |
4280 | { | |
4281 | int ret; | |
4282 | ret = setup_leaf_for_split(trans, root, path, | |
4283 | sizeof(struct btrfs_item)); | |
4284 | if (ret) | |
4285 | return ret; | |
4286 | ||
4287 | ret = split_item(trans, root, path, new_key, split_offset); | |
459931ec CM |
4288 | return ret; |
4289 | } | |
4290 | ||
ad48fd75 YZ |
4291 | /* |
4292 | * This function duplicate a item, giving 'new_key' to the new item. | |
4293 | * It guarantees both items live in the same tree leaf and the new item | |
4294 | * is contiguous with the original item. | |
4295 | * | |
4296 | * This allows us to split file extent in place, keeping a lock on the | |
4297 | * leaf the entire time. | |
4298 | */ | |
4299 | int btrfs_duplicate_item(struct btrfs_trans_handle *trans, | |
4300 | struct btrfs_root *root, | |
4301 | struct btrfs_path *path, | |
4302 | struct btrfs_key *new_key) | |
4303 | { | |
4304 | struct extent_buffer *leaf; | |
4305 | int ret; | |
4306 | u32 item_size; | |
4307 | ||
4308 | leaf = path->nodes[0]; | |
4309 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
4310 | ret = setup_leaf_for_split(trans, root, path, | |
4311 | item_size + sizeof(struct btrfs_item)); | |
4312 | if (ret) | |
4313 | return ret; | |
4314 | ||
4315 | path->slots[0]++; | |
afe5fea7 | 4316 | setup_items_for_insert(root, path, new_key, &item_size, |
143bede5 JM |
4317 | item_size, item_size + |
4318 | sizeof(struct btrfs_item), 1); | |
ad48fd75 YZ |
4319 | leaf = path->nodes[0]; |
4320 | memcpy_extent_buffer(leaf, | |
4321 | btrfs_item_ptr_offset(leaf, path->slots[0]), | |
4322 | btrfs_item_ptr_offset(leaf, path->slots[0] - 1), | |
4323 | item_size); | |
4324 | return 0; | |
4325 | } | |
4326 | ||
d352ac68 CM |
4327 | /* |
4328 | * make the item pointed to by the path smaller. new_size indicates | |
4329 | * how small to make it, and from_end tells us if we just chop bytes | |
4330 | * off the end of the item or if we shift the item to chop bytes off | |
4331 | * the front. | |
4332 | */ | |
afe5fea7 | 4333 | void btrfs_truncate_item(struct btrfs_root *root, struct btrfs_path *path, |
143bede5 | 4334 | u32 new_size, int from_end) |
b18c6685 | 4335 | { |
b18c6685 | 4336 | int slot; |
5f39d397 CM |
4337 | struct extent_buffer *leaf; |
4338 | struct btrfs_item *item; | |
b18c6685 CM |
4339 | u32 nritems; |
4340 | unsigned int data_end; | |
4341 | unsigned int old_data_start; | |
4342 | unsigned int old_size; | |
4343 | unsigned int size_diff; | |
4344 | int i; | |
cfed81a0 CM |
4345 | struct btrfs_map_token token; |
4346 | ||
4347 | btrfs_init_map_token(&token); | |
b18c6685 | 4348 | |
5f39d397 | 4349 | leaf = path->nodes[0]; |
179e29e4 CM |
4350 | slot = path->slots[0]; |
4351 | ||
4352 | old_size = btrfs_item_size_nr(leaf, slot); | |
4353 | if (old_size == new_size) | |
143bede5 | 4354 | return; |
b18c6685 | 4355 | |
5f39d397 | 4356 | nritems = btrfs_header_nritems(leaf); |
b18c6685 CM |
4357 | data_end = leaf_data_end(root, leaf); |
4358 | ||
5f39d397 | 4359 | old_data_start = btrfs_item_offset_nr(leaf, slot); |
179e29e4 | 4360 | |
b18c6685 CM |
4361 | size_diff = old_size - new_size; |
4362 | ||
4363 | BUG_ON(slot < 0); | |
4364 | BUG_ON(slot >= nritems); | |
4365 | ||
4366 | /* | |
4367 | * item0..itemN ... dataN.offset..dataN.size .. data0.size | |
4368 | */ | |
4369 | /* first correct the data pointers */ | |
4370 | for (i = slot; i < nritems; i++) { | |
5f39d397 CM |
4371 | u32 ioff; |
4372 | item = btrfs_item_nr(leaf, i); | |
db94535d | 4373 | |
cfed81a0 CM |
4374 | ioff = btrfs_token_item_offset(leaf, item, &token); |
4375 | btrfs_set_token_item_offset(leaf, item, | |
4376 | ioff + size_diff, &token); | |
b18c6685 | 4377 | } |
db94535d | 4378 | |
b18c6685 | 4379 | /* shift the data */ |
179e29e4 CM |
4380 | if (from_end) { |
4381 | memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) + | |
4382 | data_end + size_diff, btrfs_leaf_data(leaf) + | |
4383 | data_end, old_data_start + new_size - data_end); | |
4384 | } else { | |
4385 | struct btrfs_disk_key disk_key; | |
4386 | u64 offset; | |
4387 | ||
4388 | btrfs_item_key(leaf, &disk_key, slot); | |
4389 | ||
4390 | if (btrfs_disk_key_type(&disk_key) == BTRFS_EXTENT_DATA_KEY) { | |
4391 | unsigned long ptr; | |
4392 | struct btrfs_file_extent_item *fi; | |
4393 | ||
4394 | fi = btrfs_item_ptr(leaf, slot, | |
4395 | struct btrfs_file_extent_item); | |
4396 | fi = (struct btrfs_file_extent_item *)( | |
4397 | (unsigned long)fi - size_diff); | |
4398 | ||
4399 | if (btrfs_file_extent_type(leaf, fi) == | |
4400 | BTRFS_FILE_EXTENT_INLINE) { | |
4401 | ptr = btrfs_item_ptr_offset(leaf, slot); | |
4402 | memmove_extent_buffer(leaf, ptr, | |
d397712b CM |
4403 | (unsigned long)fi, |
4404 | offsetof(struct btrfs_file_extent_item, | |
179e29e4 CM |
4405 | disk_bytenr)); |
4406 | } | |
4407 | } | |
4408 | ||
4409 | memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) + | |
4410 | data_end + size_diff, btrfs_leaf_data(leaf) + | |
4411 | data_end, old_data_start - data_end); | |
4412 | ||
4413 | offset = btrfs_disk_key_offset(&disk_key); | |
4414 | btrfs_set_disk_key_offset(&disk_key, offset + size_diff); | |
4415 | btrfs_set_item_key(leaf, &disk_key, slot); | |
4416 | if (slot == 0) | |
d6a0a126 | 4417 | fixup_low_keys(root, path, &disk_key, 1); |
179e29e4 | 4418 | } |
5f39d397 CM |
4419 | |
4420 | item = btrfs_item_nr(leaf, slot); | |
4421 | btrfs_set_item_size(leaf, item, new_size); | |
4422 | btrfs_mark_buffer_dirty(leaf); | |
b18c6685 | 4423 | |
5f39d397 CM |
4424 | if (btrfs_leaf_free_space(root, leaf) < 0) { |
4425 | btrfs_print_leaf(root, leaf); | |
b18c6685 | 4426 | BUG(); |
5f39d397 | 4427 | } |
b18c6685 CM |
4428 | } |
4429 | ||
d352ac68 CM |
4430 | /* |
4431 | * make the item pointed to by the path bigger, data_size is the new size. | |
4432 | */ | |
4b90c680 | 4433 | void btrfs_extend_item(struct btrfs_root *root, struct btrfs_path *path, |
143bede5 | 4434 | u32 data_size) |
6567e837 | 4435 | { |
6567e837 | 4436 | int slot; |
5f39d397 CM |
4437 | struct extent_buffer *leaf; |
4438 | struct btrfs_item *item; | |
6567e837 CM |
4439 | u32 nritems; |
4440 | unsigned int data_end; | |
4441 | unsigned int old_data; | |
4442 | unsigned int old_size; | |
4443 | int i; | |
cfed81a0 CM |
4444 | struct btrfs_map_token token; |
4445 | ||
4446 | btrfs_init_map_token(&token); | |
6567e837 | 4447 | |
5f39d397 | 4448 | leaf = path->nodes[0]; |
6567e837 | 4449 | |
5f39d397 | 4450 | nritems = btrfs_header_nritems(leaf); |
6567e837 CM |
4451 | data_end = leaf_data_end(root, leaf); |
4452 | ||
5f39d397 CM |
4453 | if (btrfs_leaf_free_space(root, leaf) < data_size) { |
4454 | btrfs_print_leaf(root, leaf); | |
6567e837 | 4455 | BUG(); |
5f39d397 | 4456 | } |
6567e837 | 4457 | slot = path->slots[0]; |
5f39d397 | 4458 | old_data = btrfs_item_end_nr(leaf, slot); |
6567e837 CM |
4459 | |
4460 | BUG_ON(slot < 0); | |
3326d1b0 CM |
4461 | if (slot >= nritems) { |
4462 | btrfs_print_leaf(root, leaf); | |
d397712b CM |
4463 | printk(KERN_CRIT "slot %d too large, nritems %d\n", |
4464 | slot, nritems); | |
3326d1b0 CM |
4465 | BUG_ON(1); |
4466 | } | |
6567e837 CM |
4467 | |
4468 | /* | |
4469 | * item0..itemN ... dataN.offset..dataN.size .. data0.size | |
4470 | */ | |
4471 | /* first correct the data pointers */ | |
4472 | for (i = slot; i < nritems; i++) { | |
5f39d397 CM |
4473 | u32 ioff; |
4474 | item = btrfs_item_nr(leaf, i); | |
db94535d | 4475 | |
cfed81a0 CM |
4476 | ioff = btrfs_token_item_offset(leaf, item, &token); |
4477 | btrfs_set_token_item_offset(leaf, item, | |
4478 | ioff - data_size, &token); | |
6567e837 | 4479 | } |
5f39d397 | 4480 | |
6567e837 | 4481 | /* shift the data */ |
5f39d397 | 4482 | memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) + |
6567e837 CM |
4483 | data_end - data_size, btrfs_leaf_data(leaf) + |
4484 | data_end, old_data - data_end); | |
5f39d397 | 4485 | |
6567e837 | 4486 | data_end = old_data; |
5f39d397 CM |
4487 | old_size = btrfs_item_size_nr(leaf, slot); |
4488 | item = btrfs_item_nr(leaf, slot); | |
4489 | btrfs_set_item_size(leaf, item, old_size + data_size); | |
4490 | btrfs_mark_buffer_dirty(leaf); | |
6567e837 | 4491 | |
5f39d397 CM |
4492 | if (btrfs_leaf_free_space(root, leaf) < 0) { |
4493 | btrfs_print_leaf(root, leaf); | |
6567e837 | 4494 | BUG(); |
5f39d397 | 4495 | } |
6567e837 CM |
4496 | } |
4497 | ||
74123bd7 | 4498 | /* |
44871b1b CM |
4499 | * this is a helper for btrfs_insert_empty_items, the main goal here is |
4500 | * to save stack depth by doing the bulk of the work in a function | |
4501 | * that doesn't call btrfs_search_slot | |
74123bd7 | 4502 | */ |
afe5fea7 | 4503 | void setup_items_for_insert(struct btrfs_root *root, struct btrfs_path *path, |
143bede5 JM |
4504 | struct btrfs_key *cpu_key, u32 *data_size, |
4505 | u32 total_data, u32 total_size, int nr) | |
be0e5c09 | 4506 | { |
5f39d397 | 4507 | struct btrfs_item *item; |
9c58309d | 4508 | int i; |
7518a238 | 4509 | u32 nritems; |
be0e5c09 | 4510 | unsigned int data_end; |
e2fa7227 | 4511 | struct btrfs_disk_key disk_key; |
44871b1b CM |
4512 | struct extent_buffer *leaf; |
4513 | int slot; | |
cfed81a0 CM |
4514 | struct btrfs_map_token token; |
4515 | ||
4516 | btrfs_init_map_token(&token); | |
e2fa7227 | 4517 | |
5f39d397 | 4518 | leaf = path->nodes[0]; |
44871b1b | 4519 | slot = path->slots[0]; |
74123bd7 | 4520 | |
5f39d397 | 4521 | nritems = btrfs_header_nritems(leaf); |
123abc88 | 4522 | data_end = leaf_data_end(root, leaf); |
eb60ceac | 4523 | |
f25956cc | 4524 | if (btrfs_leaf_free_space(root, leaf) < total_size) { |
3326d1b0 | 4525 | btrfs_print_leaf(root, leaf); |
d397712b | 4526 | printk(KERN_CRIT "not enough freespace need %u have %d\n", |
9c58309d | 4527 | total_size, btrfs_leaf_free_space(root, leaf)); |
be0e5c09 | 4528 | BUG(); |
d4dbff95 | 4529 | } |
5f39d397 | 4530 | |
be0e5c09 | 4531 | if (slot != nritems) { |
5f39d397 | 4532 | unsigned int old_data = btrfs_item_end_nr(leaf, slot); |
be0e5c09 | 4533 | |
5f39d397 CM |
4534 | if (old_data < data_end) { |
4535 | btrfs_print_leaf(root, leaf); | |
d397712b | 4536 | printk(KERN_CRIT "slot %d old_data %d data_end %d\n", |
5f39d397 CM |
4537 | slot, old_data, data_end); |
4538 | BUG_ON(1); | |
4539 | } | |
be0e5c09 CM |
4540 | /* |
4541 | * item0..itemN ... dataN.offset..dataN.size .. data0.size | |
4542 | */ | |
4543 | /* first correct the data pointers */ | |
0783fcfc | 4544 | for (i = slot; i < nritems; i++) { |
5f39d397 | 4545 | u32 ioff; |
db94535d | 4546 | |
5f39d397 | 4547 | item = btrfs_item_nr(leaf, i); |
cfed81a0 CM |
4548 | ioff = btrfs_token_item_offset(leaf, item, &token); |
4549 | btrfs_set_token_item_offset(leaf, item, | |
4550 | ioff - total_data, &token); | |
0783fcfc | 4551 | } |
be0e5c09 | 4552 | /* shift the items */ |
9c58309d | 4553 | memmove_extent_buffer(leaf, btrfs_item_nr_offset(slot + nr), |
5f39d397 | 4554 | btrfs_item_nr_offset(slot), |
d6025579 | 4555 | (nritems - slot) * sizeof(struct btrfs_item)); |
be0e5c09 CM |
4556 | |
4557 | /* shift the data */ | |
5f39d397 | 4558 | memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) + |
9c58309d | 4559 | data_end - total_data, btrfs_leaf_data(leaf) + |
d6025579 | 4560 | data_end, old_data - data_end); |
be0e5c09 CM |
4561 | data_end = old_data; |
4562 | } | |
5f39d397 | 4563 | |
62e2749e | 4564 | /* setup the item for the new data */ |
9c58309d CM |
4565 | for (i = 0; i < nr; i++) { |
4566 | btrfs_cpu_key_to_disk(&disk_key, cpu_key + i); | |
4567 | btrfs_set_item_key(leaf, &disk_key, slot + i); | |
4568 | item = btrfs_item_nr(leaf, slot + i); | |
cfed81a0 CM |
4569 | btrfs_set_token_item_offset(leaf, item, |
4570 | data_end - data_size[i], &token); | |
9c58309d | 4571 | data_end -= data_size[i]; |
cfed81a0 | 4572 | btrfs_set_token_item_size(leaf, item, data_size[i], &token); |
9c58309d | 4573 | } |
44871b1b | 4574 | |
9c58309d | 4575 | btrfs_set_header_nritems(leaf, nritems + nr); |
aa5d6bed | 4576 | |
5a01a2e3 CM |
4577 | if (slot == 0) { |
4578 | btrfs_cpu_key_to_disk(&disk_key, cpu_key); | |
d6a0a126 | 4579 | fixup_low_keys(root, path, &disk_key, 1); |
5a01a2e3 | 4580 | } |
b9473439 CM |
4581 | btrfs_unlock_up_safe(path, 1); |
4582 | btrfs_mark_buffer_dirty(leaf); | |
aa5d6bed | 4583 | |
5f39d397 CM |
4584 | if (btrfs_leaf_free_space(root, leaf) < 0) { |
4585 | btrfs_print_leaf(root, leaf); | |
be0e5c09 | 4586 | BUG(); |
5f39d397 | 4587 | } |
44871b1b CM |
4588 | } |
4589 | ||
4590 | /* | |
4591 | * Given a key and some data, insert items into the tree. | |
4592 | * This does all the path init required, making room in the tree if needed. | |
4593 | */ | |
4594 | int btrfs_insert_empty_items(struct btrfs_trans_handle *trans, | |
4595 | struct btrfs_root *root, | |
4596 | struct btrfs_path *path, | |
4597 | struct btrfs_key *cpu_key, u32 *data_size, | |
4598 | int nr) | |
4599 | { | |
44871b1b CM |
4600 | int ret = 0; |
4601 | int slot; | |
4602 | int i; | |
4603 | u32 total_size = 0; | |
4604 | u32 total_data = 0; | |
4605 | ||
4606 | for (i = 0; i < nr; i++) | |
4607 | total_data += data_size[i]; | |
4608 | ||
4609 | total_size = total_data + (nr * sizeof(struct btrfs_item)); | |
4610 | ret = btrfs_search_slot(trans, root, cpu_key, path, total_size, 1); | |
4611 | if (ret == 0) | |
4612 | return -EEXIST; | |
4613 | if (ret < 0) | |
143bede5 | 4614 | return ret; |
44871b1b | 4615 | |
44871b1b CM |
4616 | slot = path->slots[0]; |
4617 | BUG_ON(slot < 0); | |
4618 | ||
afe5fea7 | 4619 | setup_items_for_insert(root, path, cpu_key, data_size, |
44871b1b | 4620 | total_data, total_size, nr); |
143bede5 | 4621 | return 0; |
62e2749e CM |
4622 | } |
4623 | ||
4624 | /* | |
4625 | * Given a key and some data, insert an item into the tree. | |
4626 | * This does all the path init required, making room in the tree if needed. | |
4627 | */ | |
e089f05c CM |
4628 | int btrfs_insert_item(struct btrfs_trans_handle *trans, struct btrfs_root |
4629 | *root, struct btrfs_key *cpu_key, void *data, u32 | |
4630 | data_size) | |
62e2749e CM |
4631 | { |
4632 | int ret = 0; | |
2c90e5d6 | 4633 | struct btrfs_path *path; |
5f39d397 CM |
4634 | struct extent_buffer *leaf; |
4635 | unsigned long ptr; | |
62e2749e | 4636 | |
2c90e5d6 | 4637 | path = btrfs_alloc_path(); |
db5b493a TI |
4638 | if (!path) |
4639 | return -ENOMEM; | |
2c90e5d6 | 4640 | ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size); |
62e2749e | 4641 | if (!ret) { |
5f39d397 CM |
4642 | leaf = path->nodes[0]; |
4643 | ptr = btrfs_item_ptr_offset(leaf, path->slots[0]); | |
4644 | write_extent_buffer(leaf, data, ptr, data_size); | |
4645 | btrfs_mark_buffer_dirty(leaf); | |
62e2749e | 4646 | } |
2c90e5d6 | 4647 | btrfs_free_path(path); |
aa5d6bed | 4648 | return ret; |
be0e5c09 CM |
4649 | } |
4650 | ||
74123bd7 | 4651 | /* |
5de08d7d | 4652 | * delete the pointer from a given node. |
74123bd7 | 4653 | * |
d352ac68 CM |
4654 | * the tree should have been previously balanced so the deletion does not |
4655 | * empty a node. | |
74123bd7 | 4656 | */ |
afe5fea7 TI |
4657 | static void del_ptr(struct btrfs_root *root, struct btrfs_path *path, |
4658 | int level, int slot) | |
be0e5c09 | 4659 | { |
5f39d397 | 4660 | struct extent_buffer *parent = path->nodes[level]; |
7518a238 | 4661 | u32 nritems; |
f3ea38da | 4662 | int ret; |
be0e5c09 | 4663 | |
5f39d397 | 4664 | nritems = btrfs_header_nritems(parent); |
d397712b | 4665 | if (slot != nritems - 1) { |
0e411ece | 4666 | if (level) |
f3ea38da JS |
4667 | tree_mod_log_eb_move(root->fs_info, parent, slot, |
4668 | slot + 1, nritems - slot - 1); | |
5f39d397 CM |
4669 | memmove_extent_buffer(parent, |
4670 | btrfs_node_key_ptr_offset(slot), | |
4671 | btrfs_node_key_ptr_offset(slot + 1), | |
d6025579 CM |
4672 | sizeof(struct btrfs_key_ptr) * |
4673 | (nritems - slot - 1)); | |
57ba86c0 CM |
4674 | } else if (level) { |
4675 | ret = tree_mod_log_insert_key(root->fs_info, parent, slot, | |
4676 | MOD_LOG_KEY_REMOVE); | |
4677 | BUG_ON(ret < 0); | |
bb803951 | 4678 | } |
f3ea38da | 4679 | |
7518a238 | 4680 | nritems--; |
5f39d397 | 4681 | btrfs_set_header_nritems(parent, nritems); |
7518a238 | 4682 | if (nritems == 0 && parent == root->node) { |
5f39d397 | 4683 | BUG_ON(btrfs_header_level(root->node) != 1); |
bb803951 | 4684 | /* just turn the root into a leaf and break */ |
5f39d397 | 4685 | btrfs_set_header_level(root->node, 0); |
bb803951 | 4686 | } else if (slot == 0) { |
5f39d397 CM |
4687 | struct btrfs_disk_key disk_key; |
4688 | ||
4689 | btrfs_node_key(parent, &disk_key, 0); | |
d6a0a126 | 4690 | fixup_low_keys(root, path, &disk_key, level + 1); |
be0e5c09 | 4691 | } |
d6025579 | 4692 | btrfs_mark_buffer_dirty(parent); |
be0e5c09 CM |
4693 | } |
4694 | ||
323ac95b CM |
4695 | /* |
4696 | * a helper function to delete the leaf pointed to by path->slots[1] and | |
5d4f98a2 | 4697 | * path->nodes[1]. |
323ac95b CM |
4698 | * |
4699 | * This deletes the pointer in path->nodes[1] and frees the leaf | |
4700 | * block extent. zero is returned if it all worked out, < 0 otherwise. | |
4701 | * | |
4702 | * The path must have already been setup for deleting the leaf, including | |
4703 | * all the proper balancing. path->nodes[1] must be locked. | |
4704 | */ | |
143bede5 JM |
4705 | static noinline void btrfs_del_leaf(struct btrfs_trans_handle *trans, |
4706 | struct btrfs_root *root, | |
4707 | struct btrfs_path *path, | |
4708 | struct extent_buffer *leaf) | |
323ac95b | 4709 | { |
5d4f98a2 | 4710 | WARN_ON(btrfs_header_generation(leaf) != trans->transid); |
afe5fea7 | 4711 | del_ptr(root, path, 1, path->slots[1]); |
323ac95b | 4712 | |
4d081c41 CM |
4713 | /* |
4714 | * btrfs_free_extent is expensive, we want to make sure we | |
4715 | * aren't holding any locks when we call it | |
4716 | */ | |
4717 | btrfs_unlock_up_safe(path, 0); | |
4718 | ||
f0486c68 YZ |
4719 | root_sub_used(root, leaf->len); |
4720 | ||
3083ee2e | 4721 | extent_buffer_get(leaf); |
5581a51a | 4722 | btrfs_free_tree_block(trans, root, leaf, 0, 1); |
3083ee2e | 4723 | free_extent_buffer_stale(leaf); |
323ac95b | 4724 | } |
74123bd7 CM |
4725 | /* |
4726 | * delete the item at the leaf level in path. If that empties | |
4727 | * the leaf, remove it from the tree | |
4728 | */ | |
85e21bac CM |
4729 | int btrfs_del_items(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
4730 | struct btrfs_path *path, int slot, int nr) | |
be0e5c09 | 4731 | { |
5f39d397 CM |
4732 | struct extent_buffer *leaf; |
4733 | struct btrfs_item *item; | |
85e21bac CM |
4734 | int last_off; |
4735 | int dsize = 0; | |
aa5d6bed CM |
4736 | int ret = 0; |
4737 | int wret; | |
85e21bac | 4738 | int i; |
7518a238 | 4739 | u32 nritems; |
cfed81a0 CM |
4740 | struct btrfs_map_token token; |
4741 | ||
4742 | btrfs_init_map_token(&token); | |
be0e5c09 | 4743 | |
5f39d397 | 4744 | leaf = path->nodes[0]; |
85e21bac CM |
4745 | last_off = btrfs_item_offset_nr(leaf, slot + nr - 1); |
4746 | ||
4747 | for (i = 0; i < nr; i++) | |
4748 | dsize += btrfs_item_size_nr(leaf, slot + i); | |
4749 | ||
5f39d397 | 4750 | nritems = btrfs_header_nritems(leaf); |
be0e5c09 | 4751 | |
85e21bac | 4752 | if (slot + nr != nritems) { |
123abc88 | 4753 | int data_end = leaf_data_end(root, leaf); |
5f39d397 CM |
4754 | |
4755 | memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) + | |
d6025579 CM |
4756 | data_end + dsize, |
4757 | btrfs_leaf_data(leaf) + data_end, | |
85e21bac | 4758 | last_off - data_end); |
5f39d397 | 4759 | |
85e21bac | 4760 | for (i = slot + nr; i < nritems; i++) { |
5f39d397 | 4761 | u32 ioff; |
db94535d | 4762 | |
5f39d397 | 4763 | item = btrfs_item_nr(leaf, i); |
cfed81a0 CM |
4764 | ioff = btrfs_token_item_offset(leaf, item, &token); |
4765 | btrfs_set_token_item_offset(leaf, item, | |
4766 | ioff + dsize, &token); | |
0783fcfc | 4767 | } |
db94535d | 4768 | |
5f39d397 | 4769 | memmove_extent_buffer(leaf, btrfs_item_nr_offset(slot), |
85e21bac | 4770 | btrfs_item_nr_offset(slot + nr), |
d6025579 | 4771 | sizeof(struct btrfs_item) * |
85e21bac | 4772 | (nritems - slot - nr)); |
be0e5c09 | 4773 | } |
85e21bac CM |
4774 | btrfs_set_header_nritems(leaf, nritems - nr); |
4775 | nritems -= nr; | |
5f39d397 | 4776 | |
74123bd7 | 4777 | /* delete the leaf if we've emptied it */ |
7518a238 | 4778 | if (nritems == 0) { |
5f39d397 CM |
4779 | if (leaf == root->node) { |
4780 | btrfs_set_header_level(leaf, 0); | |
9a8dd150 | 4781 | } else { |
f0486c68 YZ |
4782 | btrfs_set_path_blocking(path); |
4783 | clean_tree_block(trans, root, leaf); | |
143bede5 | 4784 | btrfs_del_leaf(trans, root, path, leaf); |
9a8dd150 | 4785 | } |
be0e5c09 | 4786 | } else { |
7518a238 | 4787 | int used = leaf_space_used(leaf, 0, nritems); |
aa5d6bed | 4788 | if (slot == 0) { |
5f39d397 CM |
4789 | struct btrfs_disk_key disk_key; |
4790 | ||
4791 | btrfs_item_key(leaf, &disk_key, 0); | |
d6a0a126 | 4792 | fixup_low_keys(root, path, &disk_key, 1); |
aa5d6bed | 4793 | } |
aa5d6bed | 4794 | |
74123bd7 | 4795 | /* delete the leaf if it is mostly empty */ |
d717aa1d | 4796 | if (used < BTRFS_LEAF_DATA_SIZE(root) / 3) { |
be0e5c09 CM |
4797 | /* push_leaf_left fixes the path. |
4798 | * make sure the path still points to our leaf | |
4799 | * for possible call to del_ptr below | |
4800 | */ | |
4920c9ac | 4801 | slot = path->slots[1]; |
5f39d397 CM |
4802 | extent_buffer_get(leaf); |
4803 | ||
b9473439 | 4804 | btrfs_set_path_blocking(path); |
99d8f83c CM |
4805 | wret = push_leaf_left(trans, root, path, 1, 1, |
4806 | 1, (u32)-1); | |
54aa1f4d | 4807 | if (wret < 0 && wret != -ENOSPC) |
aa5d6bed | 4808 | ret = wret; |
5f39d397 CM |
4809 | |
4810 | if (path->nodes[0] == leaf && | |
4811 | btrfs_header_nritems(leaf)) { | |
99d8f83c CM |
4812 | wret = push_leaf_right(trans, root, path, 1, |
4813 | 1, 1, 0); | |
54aa1f4d | 4814 | if (wret < 0 && wret != -ENOSPC) |
aa5d6bed CM |
4815 | ret = wret; |
4816 | } | |
5f39d397 CM |
4817 | |
4818 | if (btrfs_header_nritems(leaf) == 0) { | |
323ac95b | 4819 | path->slots[1] = slot; |
143bede5 | 4820 | btrfs_del_leaf(trans, root, path, leaf); |
5f39d397 | 4821 | free_extent_buffer(leaf); |
143bede5 | 4822 | ret = 0; |
5de08d7d | 4823 | } else { |
925baedd CM |
4824 | /* if we're still in the path, make sure |
4825 | * we're dirty. Otherwise, one of the | |
4826 | * push_leaf functions must have already | |
4827 | * dirtied this buffer | |
4828 | */ | |
4829 | if (path->nodes[0] == leaf) | |
4830 | btrfs_mark_buffer_dirty(leaf); | |
5f39d397 | 4831 | free_extent_buffer(leaf); |
be0e5c09 | 4832 | } |
d5719762 | 4833 | } else { |
5f39d397 | 4834 | btrfs_mark_buffer_dirty(leaf); |
be0e5c09 CM |
4835 | } |
4836 | } | |
aa5d6bed | 4837 | return ret; |
be0e5c09 CM |
4838 | } |
4839 | ||
7bb86316 | 4840 | /* |
925baedd | 4841 | * search the tree again to find a leaf with lesser keys |
7bb86316 CM |
4842 | * returns 0 if it found something or 1 if there are no lesser leaves. |
4843 | * returns < 0 on io errors. | |
d352ac68 CM |
4844 | * |
4845 | * This may release the path, and so you may lose any locks held at the | |
4846 | * time you call it. | |
7bb86316 CM |
4847 | */ |
4848 | int btrfs_prev_leaf(struct btrfs_root *root, struct btrfs_path *path) | |
4849 | { | |
925baedd CM |
4850 | struct btrfs_key key; |
4851 | struct btrfs_disk_key found_key; | |
4852 | int ret; | |
7bb86316 | 4853 | |
925baedd | 4854 | btrfs_item_key_to_cpu(path->nodes[0], &key, 0); |
7bb86316 | 4855 | |
925baedd CM |
4856 | if (key.offset > 0) |
4857 | key.offset--; | |
4858 | else if (key.type > 0) | |
4859 | key.type--; | |
4860 | else if (key.objectid > 0) | |
4861 | key.objectid--; | |
4862 | else | |
4863 | return 1; | |
7bb86316 | 4864 | |
b3b4aa74 | 4865 | btrfs_release_path(path); |
925baedd CM |
4866 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
4867 | if (ret < 0) | |
4868 | return ret; | |
4869 | btrfs_item_key(path->nodes[0], &found_key, 0); | |
4870 | ret = comp_keys(&found_key, &key); | |
4871 | if (ret < 0) | |
4872 | return 0; | |
4873 | return 1; | |
7bb86316 CM |
4874 | } |
4875 | ||
3f157a2f CM |
4876 | /* |
4877 | * A helper function to walk down the tree starting at min_key, and looking | |
de78b51a ES |
4878 | * for nodes or leaves that are have a minimum transaction id. |
4879 | * This is used by the btree defrag code, and tree logging | |
3f157a2f CM |
4880 | * |
4881 | * This does not cow, but it does stuff the starting key it finds back | |
4882 | * into min_key, so you can call btrfs_search_slot with cow=1 on the | |
4883 | * key and get a writable path. | |
4884 | * | |
4885 | * This does lock as it descends, and path->keep_locks should be set | |
4886 | * to 1 by the caller. | |
4887 | * | |
4888 | * This honors path->lowest_level to prevent descent past a given level | |
4889 | * of the tree. | |
4890 | * | |
d352ac68 CM |
4891 | * min_trans indicates the oldest transaction that you are interested |
4892 | * in walking through. Any nodes or leaves older than min_trans are | |
4893 | * skipped over (without reading them). | |
4894 | * | |
3f157a2f CM |
4895 | * returns zero if something useful was found, < 0 on error and 1 if there |
4896 | * was nothing in the tree that matched the search criteria. | |
4897 | */ | |
4898 | int btrfs_search_forward(struct btrfs_root *root, struct btrfs_key *min_key, | |
e02119d5 | 4899 | struct btrfs_key *max_key, |
de78b51a | 4900 | struct btrfs_path *path, |
3f157a2f CM |
4901 | u64 min_trans) |
4902 | { | |
4903 | struct extent_buffer *cur; | |
4904 | struct btrfs_key found_key; | |
4905 | int slot; | |
9652480b | 4906 | int sret; |
3f157a2f CM |
4907 | u32 nritems; |
4908 | int level; | |
4909 | int ret = 1; | |
4910 | ||
934d375b | 4911 | WARN_ON(!path->keep_locks); |
3f157a2f | 4912 | again: |
bd681513 | 4913 | cur = btrfs_read_lock_root_node(root); |
3f157a2f | 4914 | level = btrfs_header_level(cur); |
e02119d5 | 4915 | WARN_ON(path->nodes[level]); |
3f157a2f | 4916 | path->nodes[level] = cur; |
bd681513 | 4917 | path->locks[level] = BTRFS_READ_LOCK; |
3f157a2f CM |
4918 | |
4919 | if (btrfs_header_generation(cur) < min_trans) { | |
4920 | ret = 1; | |
4921 | goto out; | |
4922 | } | |
d397712b | 4923 | while (1) { |
3f157a2f CM |
4924 | nritems = btrfs_header_nritems(cur); |
4925 | level = btrfs_header_level(cur); | |
9652480b | 4926 | sret = bin_search(cur, min_key, level, &slot); |
3f157a2f | 4927 | |
323ac95b CM |
4928 | /* at the lowest level, we're done, setup the path and exit */ |
4929 | if (level == path->lowest_level) { | |
e02119d5 CM |
4930 | if (slot >= nritems) |
4931 | goto find_next_key; | |
3f157a2f CM |
4932 | ret = 0; |
4933 | path->slots[level] = slot; | |
4934 | btrfs_item_key_to_cpu(cur, &found_key, slot); | |
4935 | goto out; | |
4936 | } | |
9652480b Y |
4937 | if (sret && slot > 0) |
4938 | slot--; | |
3f157a2f | 4939 | /* |
de78b51a ES |
4940 | * check this node pointer against the min_trans parameters. |
4941 | * If it is too old, old, skip to the next one. | |
3f157a2f | 4942 | */ |
d397712b | 4943 | while (slot < nritems) { |
3f157a2f CM |
4944 | u64 blockptr; |
4945 | u64 gen; | |
e02119d5 | 4946 | |
3f157a2f CM |
4947 | blockptr = btrfs_node_blockptr(cur, slot); |
4948 | gen = btrfs_node_ptr_generation(cur, slot); | |
4949 | if (gen < min_trans) { | |
4950 | slot++; | |
4951 | continue; | |
4952 | } | |
de78b51a | 4953 | break; |
3f157a2f | 4954 | } |
e02119d5 | 4955 | find_next_key: |
3f157a2f CM |
4956 | /* |
4957 | * we didn't find a candidate key in this node, walk forward | |
4958 | * and find another one | |
4959 | */ | |
4960 | if (slot >= nritems) { | |
e02119d5 | 4961 | path->slots[level] = slot; |
b4ce94de | 4962 | btrfs_set_path_blocking(path); |
e02119d5 | 4963 | sret = btrfs_find_next_key(root, path, min_key, level, |
de78b51a | 4964 | min_trans); |
e02119d5 | 4965 | if (sret == 0) { |
b3b4aa74 | 4966 | btrfs_release_path(path); |
3f157a2f CM |
4967 | goto again; |
4968 | } else { | |
4969 | goto out; | |
4970 | } | |
4971 | } | |
4972 | /* save our key for returning back */ | |
4973 | btrfs_node_key_to_cpu(cur, &found_key, slot); | |
4974 | path->slots[level] = slot; | |
4975 | if (level == path->lowest_level) { | |
4976 | ret = 0; | |
f7c79f30 | 4977 | unlock_up(path, level, 1, 0, NULL); |
3f157a2f CM |
4978 | goto out; |
4979 | } | |
b4ce94de | 4980 | btrfs_set_path_blocking(path); |
3f157a2f | 4981 | cur = read_node_slot(root, cur, slot); |
79787eaa | 4982 | BUG_ON(!cur); /* -ENOMEM */ |
3f157a2f | 4983 | |
bd681513 | 4984 | btrfs_tree_read_lock(cur); |
b4ce94de | 4985 | |
bd681513 | 4986 | path->locks[level - 1] = BTRFS_READ_LOCK; |
3f157a2f | 4987 | path->nodes[level - 1] = cur; |
f7c79f30 | 4988 | unlock_up(path, level, 1, 0, NULL); |
bd681513 | 4989 | btrfs_clear_path_blocking(path, NULL, 0); |
3f157a2f CM |
4990 | } |
4991 | out: | |
4992 | if (ret == 0) | |
4993 | memcpy(min_key, &found_key, sizeof(found_key)); | |
b4ce94de | 4994 | btrfs_set_path_blocking(path); |
3f157a2f CM |
4995 | return ret; |
4996 | } | |
4997 | ||
7069830a AB |
4998 | static void tree_move_down(struct btrfs_root *root, |
4999 | struct btrfs_path *path, | |
5000 | int *level, int root_level) | |
5001 | { | |
74dd17fb | 5002 | BUG_ON(*level == 0); |
7069830a AB |
5003 | path->nodes[*level - 1] = read_node_slot(root, path->nodes[*level], |
5004 | path->slots[*level]); | |
5005 | path->slots[*level - 1] = 0; | |
5006 | (*level)--; | |
5007 | } | |
5008 | ||
5009 | static int tree_move_next_or_upnext(struct btrfs_root *root, | |
5010 | struct btrfs_path *path, | |
5011 | int *level, int root_level) | |
5012 | { | |
5013 | int ret = 0; | |
5014 | int nritems; | |
5015 | nritems = btrfs_header_nritems(path->nodes[*level]); | |
5016 | ||
5017 | path->slots[*level]++; | |
5018 | ||
74dd17fb | 5019 | while (path->slots[*level] >= nritems) { |
7069830a AB |
5020 | if (*level == root_level) |
5021 | return -1; | |
5022 | ||
5023 | /* move upnext */ | |
5024 | path->slots[*level] = 0; | |
5025 | free_extent_buffer(path->nodes[*level]); | |
5026 | path->nodes[*level] = NULL; | |
5027 | (*level)++; | |
5028 | path->slots[*level]++; | |
5029 | ||
5030 | nritems = btrfs_header_nritems(path->nodes[*level]); | |
5031 | ret = 1; | |
5032 | } | |
5033 | return ret; | |
5034 | } | |
5035 | ||
5036 | /* | |
5037 | * Returns 1 if it had to move up and next. 0 is returned if it moved only next | |
5038 | * or down. | |
5039 | */ | |
5040 | static int tree_advance(struct btrfs_root *root, | |
5041 | struct btrfs_path *path, | |
5042 | int *level, int root_level, | |
5043 | int allow_down, | |
5044 | struct btrfs_key *key) | |
5045 | { | |
5046 | int ret; | |
5047 | ||
5048 | if (*level == 0 || !allow_down) { | |
5049 | ret = tree_move_next_or_upnext(root, path, level, root_level); | |
5050 | } else { | |
5051 | tree_move_down(root, path, level, root_level); | |
5052 | ret = 0; | |
5053 | } | |
5054 | if (ret >= 0) { | |
5055 | if (*level == 0) | |
5056 | btrfs_item_key_to_cpu(path->nodes[*level], key, | |
5057 | path->slots[*level]); | |
5058 | else | |
5059 | btrfs_node_key_to_cpu(path->nodes[*level], key, | |
5060 | path->slots[*level]); | |
5061 | } | |
5062 | return ret; | |
5063 | } | |
5064 | ||
5065 | static int tree_compare_item(struct btrfs_root *left_root, | |
5066 | struct btrfs_path *left_path, | |
5067 | struct btrfs_path *right_path, | |
5068 | char *tmp_buf) | |
5069 | { | |
5070 | int cmp; | |
5071 | int len1, len2; | |
5072 | unsigned long off1, off2; | |
5073 | ||
5074 | len1 = btrfs_item_size_nr(left_path->nodes[0], left_path->slots[0]); | |
5075 | len2 = btrfs_item_size_nr(right_path->nodes[0], right_path->slots[0]); | |
5076 | if (len1 != len2) | |
5077 | return 1; | |
5078 | ||
5079 | off1 = btrfs_item_ptr_offset(left_path->nodes[0], left_path->slots[0]); | |
5080 | off2 = btrfs_item_ptr_offset(right_path->nodes[0], | |
5081 | right_path->slots[0]); | |
5082 | ||
5083 | read_extent_buffer(left_path->nodes[0], tmp_buf, off1, len1); | |
5084 | ||
5085 | cmp = memcmp_extent_buffer(right_path->nodes[0], tmp_buf, off2, len1); | |
5086 | if (cmp) | |
5087 | return 1; | |
5088 | return 0; | |
5089 | } | |
5090 | ||
5091 | #define ADVANCE 1 | |
5092 | #define ADVANCE_ONLY_NEXT -1 | |
5093 | ||
5094 | /* | |
5095 | * This function compares two trees and calls the provided callback for | |
5096 | * every changed/new/deleted item it finds. | |
5097 | * If shared tree blocks are encountered, whole subtrees are skipped, making | |
5098 | * the compare pretty fast on snapshotted subvolumes. | |
5099 | * | |
5100 | * This currently works on commit roots only. As commit roots are read only, | |
5101 | * we don't do any locking. The commit roots are protected with transactions. | |
5102 | * Transactions are ended and rejoined when a commit is tried in between. | |
5103 | * | |
5104 | * This function checks for modifications done to the trees while comparing. | |
5105 | * If it detects a change, it aborts immediately. | |
5106 | */ | |
5107 | int btrfs_compare_trees(struct btrfs_root *left_root, | |
5108 | struct btrfs_root *right_root, | |
5109 | btrfs_changed_cb_t changed_cb, void *ctx) | |
5110 | { | |
5111 | int ret; | |
5112 | int cmp; | |
5113 | struct btrfs_trans_handle *trans = NULL; | |
5114 | struct btrfs_path *left_path = NULL; | |
5115 | struct btrfs_path *right_path = NULL; | |
5116 | struct btrfs_key left_key; | |
5117 | struct btrfs_key right_key; | |
5118 | char *tmp_buf = NULL; | |
5119 | int left_root_level; | |
5120 | int right_root_level; | |
5121 | int left_level; | |
5122 | int right_level; | |
5123 | int left_end_reached; | |
5124 | int right_end_reached; | |
5125 | int advance_left; | |
5126 | int advance_right; | |
5127 | u64 left_blockptr; | |
5128 | u64 right_blockptr; | |
5129 | u64 left_start_ctransid; | |
5130 | u64 right_start_ctransid; | |
5131 | u64 ctransid; | |
5132 | ||
5133 | left_path = btrfs_alloc_path(); | |
5134 | if (!left_path) { | |
5135 | ret = -ENOMEM; | |
5136 | goto out; | |
5137 | } | |
5138 | right_path = btrfs_alloc_path(); | |
5139 | if (!right_path) { | |
5140 | ret = -ENOMEM; | |
5141 | goto out; | |
5142 | } | |
5143 | ||
5144 | tmp_buf = kmalloc(left_root->leafsize, GFP_NOFS); | |
5145 | if (!tmp_buf) { | |
5146 | ret = -ENOMEM; | |
5147 | goto out; | |
5148 | } | |
5149 | ||
5150 | left_path->search_commit_root = 1; | |
5151 | left_path->skip_locking = 1; | |
5152 | right_path->search_commit_root = 1; | |
5153 | right_path->skip_locking = 1; | |
5154 | ||
5f3ab90a | 5155 | spin_lock(&left_root->root_item_lock); |
7069830a | 5156 | left_start_ctransid = btrfs_root_ctransid(&left_root->root_item); |
5f3ab90a | 5157 | spin_unlock(&left_root->root_item_lock); |
7069830a | 5158 | |
5f3ab90a | 5159 | spin_lock(&right_root->root_item_lock); |
7069830a | 5160 | right_start_ctransid = btrfs_root_ctransid(&right_root->root_item); |
5f3ab90a | 5161 | spin_unlock(&right_root->root_item_lock); |
7069830a AB |
5162 | |
5163 | trans = btrfs_join_transaction(left_root); | |
5164 | if (IS_ERR(trans)) { | |
5165 | ret = PTR_ERR(trans); | |
5166 | trans = NULL; | |
5167 | goto out; | |
5168 | } | |
5169 | ||
5170 | /* | |
5171 | * Strategy: Go to the first items of both trees. Then do | |
5172 | * | |
5173 | * If both trees are at level 0 | |
5174 | * Compare keys of current items | |
5175 | * If left < right treat left item as new, advance left tree | |
5176 | * and repeat | |
5177 | * If left > right treat right item as deleted, advance right tree | |
5178 | * and repeat | |
5179 | * If left == right do deep compare of items, treat as changed if | |
5180 | * needed, advance both trees and repeat | |
5181 | * If both trees are at the same level but not at level 0 | |
5182 | * Compare keys of current nodes/leafs | |
5183 | * If left < right advance left tree and repeat | |
5184 | * If left > right advance right tree and repeat | |
5185 | * If left == right compare blockptrs of the next nodes/leafs | |
5186 | * If they match advance both trees but stay at the same level | |
5187 | * and repeat | |
5188 | * If they don't match advance both trees while allowing to go | |
5189 | * deeper and repeat | |
5190 | * If tree levels are different | |
5191 | * Advance the tree that needs it and repeat | |
5192 | * | |
5193 | * Advancing a tree means: | |
5194 | * If we are at level 0, try to go to the next slot. If that's not | |
5195 | * possible, go one level up and repeat. Stop when we found a level | |
5196 | * where we could go to the next slot. We may at this point be on a | |
5197 | * node or a leaf. | |
5198 | * | |
5199 | * If we are not at level 0 and not on shared tree blocks, go one | |
5200 | * level deeper. | |
5201 | * | |
5202 | * If we are not at level 0 and on shared tree blocks, go one slot to | |
5203 | * the right if possible or go up and right. | |
5204 | */ | |
5205 | ||
5206 | left_level = btrfs_header_level(left_root->commit_root); | |
5207 | left_root_level = left_level; | |
5208 | left_path->nodes[left_level] = left_root->commit_root; | |
5209 | extent_buffer_get(left_path->nodes[left_level]); | |
5210 | ||
5211 | right_level = btrfs_header_level(right_root->commit_root); | |
5212 | right_root_level = right_level; | |
5213 | right_path->nodes[right_level] = right_root->commit_root; | |
5214 | extent_buffer_get(right_path->nodes[right_level]); | |
5215 | ||
5216 | if (left_level == 0) | |
5217 | btrfs_item_key_to_cpu(left_path->nodes[left_level], | |
5218 | &left_key, left_path->slots[left_level]); | |
5219 | else | |
5220 | btrfs_node_key_to_cpu(left_path->nodes[left_level], | |
5221 | &left_key, left_path->slots[left_level]); | |
5222 | if (right_level == 0) | |
5223 | btrfs_item_key_to_cpu(right_path->nodes[right_level], | |
5224 | &right_key, right_path->slots[right_level]); | |
5225 | else | |
5226 | btrfs_node_key_to_cpu(right_path->nodes[right_level], | |
5227 | &right_key, right_path->slots[right_level]); | |
5228 | ||
5229 | left_end_reached = right_end_reached = 0; | |
5230 | advance_left = advance_right = 0; | |
5231 | ||
5232 | while (1) { | |
5233 | /* | |
5234 | * We need to make sure the transaction does not get committed | |
5235 | * while we do anything on commit roots. This means, we need to | |
5236 | * join and leave transactions for every item that we process. | |
5237 | */ | |
5238 | if (trans && btrfs_should_end_transaction(trans, left_root)) { | |
5239 | btrfs_release_path(left_path); | |
5240 | btrfs_release_path(right_path); | |
5241 | ||
5242 | ret = btrfs_end_transaction(trans, left_root); | |
5243 | trans = NULL; | |
5244 | if (ret < 0) | |
5245 | goto out; | |
5246 | } | |
5247 | /* now rejoin the transaction */ | |
5248 | if (!trans) { | |
5249 | trans = btrfs_join_transaction(left_root); | |
5250 | if (IS_ERR(trans)) { | |
5251 | ret = PTR_ERR(trans); | |
5252 | trans = NULL; | |
5253 | goto out; | |
5254 | } | |
5255 | ||
5f3ab90a | 5256 | spin_lock(&left_root->root_item_lock); |
7069830a | 5257 | ctransid = btrfs_root_ctransid(&left_root->root_item); |
5f3ab90a | 5258 | spin_unlock(&left_root->root_item_lock); |
7069830a AB |
5259 | if (ctransid != left_start_ctransid) |
5260 | left_start_ctransid = 0; | |
5261 | ||
5f3ab90a | 5262 | spin_lock(&right_root->root_item_lock); |
7069830a | 5263 | ctransid = btrfs_root_ctransid(&right_root->root_item); |
5f3ab90a | 5264 | spin_unlock(&right_root->root_item_lock); |
7069830a AB |
5265 | if (ctransid != right_start_ctransid) |
5266 | right_start_ctransid = 0; | |
5267 | ||
5268 | if (!left_start_ctransid || !right_start_ctransid) { | |
5269 | WARN(1, KERN_WARNING | |
5270 | "btrfs: btrfs_compare_tree detected " | |
5271 | "a change in one of the trees while " | |
5272 | "iterating. This is probably a " | |
5273 | "bug.\n"); | |
5274 | ret = -EIO; | |
5275 | goto out; | |
5276 | } | |
5277 | ||
5278 | /* | |
5279 | * the commit root may have changed, so start again | |
5280 | * where we stopped | |
5281 | */ | |
5282 | left_path->lowest_level = left_level; | |
5283 | right_path->lowest_level = right_level; | |
5284 | ret = btrfs_search_slot(NULL, left_root, | |
5285 | &left_key, left_path, 0, 0); | |
5286 | if (ret < 0) | |
5287 | goto out; | |
5288 | ret = btrfs_search_slot(NULL, right_root, | |
5289 | &right_key, right_path, 0, 0); | |
5290 | if (ret < 0) | |
5291 | goto out; | |
5292 | } | |
5293 | ||
5294 | if (advance_left && !left_end_reached) { | |
5295 | ret = tree_advance(left_root, left_path, &left_level, | |
5296 | left_root_level, | |
5297 | advance_left != ADVANCE_ONLY_NEXT, | |
5298 | &left_key); | |
5299 | if (ret < 0) | |
5300 | left_end_reached = ADVANCE; | |
5301 | advance_left = 0; | |
5302 | } | |
5303 | if (advance_right && !right_end_reached) { | |
5304 | ret = tree_advance(right_root, right_path, &right_level, | |
5305 | right_root_level, | |
5306 | advance_right != ADVANCE_ONLY_NEXT, | |
5307 | &right_key); | |
5308 | if (ret < 0) | |
5309 | right_end_reached = ADVANCE; | |
5310 | advance_right = 0; | |
5311 | } | |
5312 | ||
5313 | if (left_end_reached && right_end_reached) { | |
5314 | ret = 0; | |
5315 | goto out; | |
5316 | } else if (left_end_reached) { | |
5317 | if (right_level == 0) { | |
5318 | ret = changed_cb(left_root, right_root, | |
5319 | left_path, right_path, | |
5320 | &right_key, | |
5321 | BTRFS_COMPARE_TREE_DELETED, | |
5322 | ctx); | |
5323 | if (ret < 0) | |
5324 | goto out; | |
5325 | } | |
5326 | advance_right = ADVANCE; | |
5327 | continue; | |
5328 | } else if (right_end_reached) { | |
5329 | if (left_level == 0) { | |
5330 | ret = changed_cb(left_root, right_root, | |
5331 | left_path, right_path, | |
5332 | &left_key, | |
5333 | BTRFS_COMPARE_TREE_NEW, | |
5334 | ctx); | |
5335 | if (ret < 0) | |
5336 | goto out; | |
5337 | } | |
5338 | advance_left = ADVANCE; | |
5339 | continue; | |
5340 | } | |
5341 | ||
5342 | if (left_level == 0 && right_level == 0) { | |
5343 | cmp = btrfs_comp_cpu_keys(&left_key, &right_key); | |
5344 | if (cmp < 0) { | |
5345 | ret = changed_cb(left_root, right_root, | |
5346 | left_path, right_path, | |
5347 | &left_key, | |
5348 | BTRFS_COMPARE_TREE_NEW, | |
5349 | ctx); | |
5350 | if (ret < 0) | |
5351 | goto out; | |
5352 | advance_left = ADVANCE; | |
5353 | } else if (cmp > 0) { | |
5354 | ret = changed_cb(left_root, right_root, | |
5355 | left_path, right_path, | |
5356 | &right_key, | |
5357 | BTRFS_COMPARE_TREE_DELETED, | |
5358 | ctx); | |
5359 | if (ret < 0) | |
5360 | goto out; | |
5361 | advance_right = ADVANCE; | |
5362 | } else { | |
74dd17fb | 5363 | WARN_ON(!extent_buffer_uptodate(left_path->nodes[0])); |
7069830a AB |
5364 | ret = tree_compare_item(left_root, left_path, |
5365 | right_path, tmp_buf); | |
5366 | if (ret) { | |
74dd17fb | 5367 | WARN_ON(!extent_buffer_uptodate(left_path->nodes[0])); |
7069830a AB |
5368 | ret = changed_cb(left_root, right_root, |
5369 | left_path, right_path, | |
5370 | &left_key, | |
5371 | BTRFS_COMPARE_TREE_CHANGED, | |
5372 | ctx); | |
5373 | if (ret < 0) | |
5374 | goto out; | |
5375 | } | |
5376 | advance_left = ADVANCE; | |
5377 | advance_right = ADVANCE; | |
5378 | } | |
5379 | } else if (left_level == right_level) { | |
5380 | cmp = btrfs_comp_cpu_keys(&left_key, &right_key); | |
5381 | if (cmp < 0) { | |
5382 | advance_left = ADVANCE; | |
5383 | } else if (cmp > 0) { | |
5384 | advance_right = ADVANCE; | |
5385 | } else { | |
5386 | left_blockptr = btrfs_node_blockptr( | |
5387 | left_path->nodes[left_level], | |
5388 | left_path->slots[left_level]); | |
5389 | right_blockptr = btrfs_node_blockptr( | |
5390 | right_path->nodes[right_level], | |
5391 | right_path->slots[right_level]); | |
5392 | if (left_blockptr == right_blockptr) { | |
5393 | /* | |
5394 | * As we're on a shared block, don't | |
5395 | * allow to go deeper. | |
5396 | */ | |
5397 | advance_left = ADVANCE_ONLY_NEXT; | |
5398 | advance_right = ADVANCE_ONLY_NEXT; | |
5399 | } else { | |
5400 | advance_left = ADVANCE; | |
5401 | advance_right = ADVANCE; | |
5402 | } | |
5403 | } | |
5404 | } else if (left_level < right_level) { | |
5405 | advance_right = ADVANCE; | |
5406 | } else { | |
5407 | advance_left = ADVANCE; | |
5408 | } | |
5409 | } | |
5410 | ||
5411 | out: | |
5412 | btrfs_free_path(left_path); | |
5413 | btrfs_free_path(right_path); | |
5414 | kfree(tmp_buf); | |
5415 | ||
5416 | if (trans) { | |
5417 | if (!ret) | |
5418 | ret = btrfs_end_transaction(trans, left_root); | |
5419 | else | |
5420 | btrfs_end_transaction(trans, left_root); | |
5421 | } | |
5422 | ||
5423 | return ret; | |
5424 | } | |
5425 | ||
3f157a2f CM |
5426 | /* |
5427 | * this is similar to btrfs_next_leaf, but does not try to preserve | |
5428 | * and fixup the path. It looks for and returns the next key in the | |
de78b51a | 5429 | * tree based on the current path and the min_trans parameters. |
3f157a2f CM |
5430 | * |
5431 | * 0 is returned if another key is found, < 0 if there are any errors | |
5432 | * and 1 is returned if there are no higher keys in the tree | |
5433 | * | |
5434 | * path->keep_locks should be set to 1 on the search made before | |
5435 | * calling this function. | |
5436 | */ | |
e7a84565 | 5437 | int btrfs_find_next_key(struct btrfs_root *root, struct btrfs_path *path, |
de78b51a | 5438 | struct btrfs_key *key, int level, u64 min_trans) |
e7a84565 | 5439 | { |
e7a84565 CM |
5440 | int slot; |
5441 | struct extent_buffer *c; | |
5442 | ||
934d375b | 5443 | WARN_ON(!path->keep_locks); |
d397712b | 5444 | while (level < BTRFS_MAX_LEVEL) { |
e7a84565 CM |
5445 | if (!path->nodes[level]) |
5446 | return 1; | |
5447 | ||
5448 | slot = path->slots[level] + 1; | |
5449 | c = path->nodes[level]; | |
3f157a2f | 5450 | next: |
e7a84565 | 5451 | if (slot >= btrfs_header_nritems(c)) { |
33c66f43 YZ |
5452 | int ret; |
5453 | int orig_lowest; | |
5454 | struct btrfs_key cur_key; | |
5455 | if (level + 1 >= BTRFS_MAX_LEVEL || | |
5456 | !path->nodes[level + 1]) | |
e7a84565 | 5457 | return 1; |
33c66f43 YZ |
5458 | |
5459 | if (path->locks[level + 1]) { | |
5460 | level++; | |
5461 | continue; | |
5462 | } | |
5463 | ||
5464 | slot = btrfs_header_nritems(c) - 1; | |
5465 | if (level == 0) | |
5466 | btrfs_item_key_to_cpu(c, &cur_key, slot); | |
5467 | else | |
5468 | btrfs_node_key_to_cpu(c, &cur_key, slot); | |
5469 | ||
5470 | orig_lowest = path->lowest_level; | |
b3b4aa74 | 5471 | btrfs_release_path(path); |
33c66f43 YZ |
5472 | path->lowest_level = level; |
5473 | ret = btrfs_search_slot(NULL, root, &cur_key, path, | |
5474 | 0, 0); | |
5475 | path->lowest_level = orig_lowest; | |
5476 | if (ret < 0) | |
5477 | return ret; | |
5478 | ||
5479 | c = path->nodes[level]; | |
5480 | slot = path->slots[level]; | |
5481 | if (ret == 0) | |
5482 | slot++; | |
5483 | goto next; | |
e7a84565 | 5484 | } |
33c66f43 | 5485 | |
e7a84565 CM |
5486 | if (level == 0) |
5487 | btrfs_item_key_to_cpu(c, key, slot); | |
3f157a2f | 5488 | else { |
3f157a2f CM |
5489 | u64 gen = btrfs_node_ptr_generation(c, slot); |
5490 | ||
3f157a2f CM |
5491 | if (gen < min_trans) { |
5492 | slot++; | |
5493 | goto next; | |
5494 | } | |
e7a84565 | 5495 | btrfs_node_key_to_cpu(c, key, slot); |
3f157a2f | 5496 | } |
e7a84565 CM |
5497 | return 0; |
5498 | } | |
5499 | return 1; | |
5500 | } | |
5501 | ||
97571fd0 | 5502 | /* |
925baedd | 5503 | * search the tree again to find a leaf with greater keys |
0f70abe2 CM |
5504 | * returns 0 if it found something or 1 if there are no greater leaves. |
5505 | * returns < 0 on io errors. | |
97571fd0 | 5506 | */ |
234b63a0 | 5507 | int btrfs_next_leaf(struct btrfs_root *root, struct btrfs_path *path) |
3d7806ec JS |
5508 | { |
5509 | return btrfs_next_old_leaf(root, path, 0); | |
5510 | } | |
5511 | ||
5512 | int btrfs_next_old_leaf(struct btrfs_root *root, struct btrfs_path *path, | |
5513 | u64 time_seq) | |
d97e63b6 CM |
5514 | { |
5515 | int slot; | |
8e73f275 | 5516 | int level; |
5f39d397 | 5517 | struct extent_buffer *c; |
8e73f275 | 5518 | struct extent_buffer *next; |
925baedd CM |
5519 | struct btrfs_key key; |
5520 | u32 nritems; | |
5521 | int ret; | |
8e73f275 | 5522 | int old_spinning = path->leave_spinning; |
bd681513 | 5523 | int next_rw_lock = 0; |
925baedd CM |
5524 | |
5525 | nritems = btrfs_header_nritems(path->nodes[0]); | |
d397712b | 5526 | if (nritems == 0) |
925baedd | 5527 | return 1; |
925baedd | 5528 | |
8e73f275 CM |
5529 | btrfs_item_key_to_cpu(path->nodes[0], &key, nritems - 1); |
5530 | again: | |
5531 | level = 1; | |
5532 | next = NULL; | |
bd681513 | 5533 | next_rw_lock = 0; |
b3b4aa74 | 5534 | btrfs_release_path(path); |
8e73f275 | 5535 | |
a2135011 | 5536 | path->keep_locks = 1; |
31533fb2 | 5537 | path->leave_spinning = 1; |
8e73f275 | 5538 | |
3d7806ec JS |
5539 | if (time_seq) |
5540 | ret = btrfs_search_old_slot(root, &key, path, time_seq); | |
5541 | else | |
5542 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
925baedd CM |
5543 | path->keep_locks = 0; |
5544 | ||
5545 | if (ret < 0) | |
5546 | return ret; | |
5547 | ||
a2135011 | 5548 | nritems = btrfs_header_nritems(path->nodes[0]); |
168fd7d2 CM |
5549 | /* |
5550 | * by releasing the path above we dropped all our locks. A balance | |
5551 | * could have added more items next to the key that used to be | |
5552 | * at the very end of the block. So, check again here and | |
5553 | * advance the path if there are now more items available. | |
5554 | */ | |
a2135011 | 5555 | if (nritems > 0 && path->slots[0] < nritems - 1) { |
e457afec YZ |
5556 | if (ret == 0) |
5557 | path->slots[0]++; | |
8e73f275 | 5558 | ret = 0; |
925baedd CM |
5559 | goto done; |
5560 | } | |
d97e63b6 | 5561 | |
d397712b | 5562 | while (level < BTRFS_MAX_LEVEL) { |
8e73f275 CM |
5563 | if (!path->nodes[level]) { |
5564 | ret = 1; | |
5565 | goto done; | |
5566 | } | |
5f39d397 | 5567 | |
d97e63b6 CM |
5568 | slot = path->slots[level] + 1; |
5569 | c = path->nodes[level]; | |
5f39d397 | 5570 | if (slot >= btrfs_header_nritems(c)) { |
d97e63b6 | 5571 | level++; |
8e73f275 CM |
5572 | if (level == BTRFS_MAX_LEVEL) { |
5573 | ret = 1; | |
5574 | goto done; | |
5575 | } | |
d97e63b6 CM |
5576 | continue; |
5577 | } | |
5f39d397 | 5578 | |
925baedd | 5579 | if (next) { |
bd681513 | 5580 | btrfs_tree_unlock_rw(next, next_rw_lock); |
5f39d397 | 5581 | free_extent_buffer(next); |
925baedd | 5582 | } |
5f39d397 | 5583 | |
8e73f275 | 5584 | next = c; |
bd681513 | 5585 | next_rw_lock = path->locks[level]; |
8e73f275 | 5586 | ret = read_block_for_search(NULL, root, path, &next, level, |
5d9e75c4 | 5587 | slot, &key, 0); |
8e73f275 CM |
5588 | if (ret == -EAGAIN) |
5589 | goto again; | |
5f39d397 | 5590 | |
76a05b35 | 5591 | if (ret < 0) { |
b3b4aa74 | 5592 | btrfs_release_path(path); |
76a05b35 CM |
5593 | goto done; |
5594 | } | |
5595 | ||
5cd57b2c | 5596 | if (!path->skip_locking) { |
bd681513 | 5597 | ret = btrfs_try_tree_read_lock(next); |
d42244a0 JS |
5598 | if (!ret && time_seq) { |
5599 | /* | |
5600 | * If we don't get the lock, we may be racing | |
5601 | * with push_leaf_left, holding that lock while | |
5602 | * itself waiting for the leaf we've currently | |
5603 | * locked. To solve this situation, we give up | |
5604 | * on our lock and cycle. | |
5605 | */ | |
cf538830 | 5606 | free_extent_buffer(next); |
d42244a0 JS |
5607 | btrfs_release_path(path); |
5608 | cond_resched(); | |
5609 | goto again; | |
5610 | } | |
8e73f275 CM |
5611 | if (!ret) { |
5612 | btrfs_set_path_blocking(path); | |
bd681513 | 5613 | btrfs_tree_read_lock(next); |
31533fb2 | 5614 | btrfs_clear_path_blocking(path, next, |
bd681513 | 5615 | BTRFS_READ_LOCK); |
8e73f275 | 5616 | } |
31533fb2 | 5617 | next_rw_lock = BTRFS_READ_LOCK; |
5cd57b2c | 5618 | } |
d97e63b6 CM |
5619 | break; |
5620 | } | |
5621 | path->slots[level] = slot; | |
d397712b | 5622 | while (1) { |
d97e63b6 CM |
5623 | level--; |
5624 | c = path->nodes[level]; | |
925baedd | 5625 | if (path->locks[level]) |
bd681513 | 5626 | btrfs_tree_unlock_rw(c, path->locks[level]); |
8e73f275 | 5627 | |
5f39d397 | 5628 | free_extent_buffer(c); |
d97e63b6 CM |
5629 | path->nodes[level] = next; |
5630 | path->slots[level] = 0; | |
a74a4b97 | 5631 | if (!path->skip_locking) |
bd681513 | 5632 | path->locks[level] = next_rw_lock; |
d97e63b6 CM |
5633 | if (!level) |
5634 | break; | |
b4ce94de | 5635 | |
8e73f275 | 5636 | ret = read_block_for_search(NULL, root, path, &next, level, |
5d9e75c4 | 5637 | 0, &key, 0); |
8e73f275 CM |
5638 | if (ret == -EAGAIN) |
5639 | goto again; | |
5640 | ||
76a05b35 | 5641 | if (ret < 0) { |
b3b4aa74 | 5642 | btrfs_release_path(path); |
76a05b35 CM |
5643 | goto done; |
5644 | } | |
5645 | ||
5cd57b2c | 5646 | if (!path->skip_locking) { |
bd681513 | 5647 | ret = btrfs_try_tree_read_lock(next); |
8e73f275 CM |
5648 | if (!ret) { |
5649 | btrfs_set_path_blocking(path); | |
bd681513 | 5650 | btrfs_tree_read_lock(next); |
31533fb2 | 5651 | btrfs_clear_path_blocking(path, next, |
bd681513 CM |
5652 | BTRFS_READ_LOCK); |
5653 | } | |
31533fb2 | 5654 | next_rw_lock = BTRFS_READ_LOCK; |
5cd57b2c | 5655 | } |
d97e63b6 | 5656 | } |
8e73f275 | 5657 | ret = 0; |
925baedd | 5658 | done: |
f7c79f30 | 5659 | unlock_up(path, 0, 1, 0, NULL); |
8e73f275 CM |
5660 | path->leave_spinning = old_spinning; |
5661 | if (!old_spinning) | |
5662 | btrfs_set_path_blocking(path); | |
5663 | ||
5664 | return ret; | |
d97e63b6 | 5665 | } |
0b86a832 | 5666 | |
3f157a2f CM |
5667 | /* |
5668 | * this uses btrfs_prev_leaf to walk backwards in the tree, and keeps | |
5669 | * searching until it gets past min_objectid or finds an item of 'type' | |
5670 | * | |
5671 | * returns 0 if something is found, 1 if nothing was found and < 0 on error | |
5672 | */ | |
0b86a832 CM |
5673 | int btrfs_previous_item(struct btrfs_root *root, |
5674 | struct btrfs_path *path, u64 min_objectid, | |
5675 | int type) | |
5676 | { | |
5677 | struct btrfs_key found_key; | |
5678 | struct extent_buffer *leaf; | |
e02119d5 | 5679 | u32 nritems; |
0b86a832 CM |
5680 | int ret; |
5681 | ||
d397712b | 5682 | while (1) { |
0b86a832 | 5683 | if (path->slots[0] == 0) { |
b4ce94de | 5684 | btrfs_set_path_blocking(path); |
0b86a832 CM |
5685 | ret = btrfs_prev_leaf(root, path); |
5686 | if (ret != 0) | |
5687 | return ret; | |
5688 | } else { | |
5689 | path->slots[0]--; | |
5690 | } | |
5691 | leaf = path->nodes[0]; | |
e02119d5 CM |
5692 | nritems = btrfs_header_nritems(leaf); |
5693 | if (nritems == 0) | |
5694 | return 1; | |
5695 | if (path->slots[0] == nritems) | |
5696 | path->slots[0]--; | |
5697 | ||
0b86a832 | 5698 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); |
e02119d5 CM |
5699 | if (found_key.objectid < min_objectid) |
5700 | break; | |
0a4eefbb YZ |
5701 | if (found_key.type == type) |
5702 | return 0; | |
e02119d5 CM |
5703 | if (found_key.objectid == min_objectid && |
5704 | found_key.type < type) | |
5705 | break; | |
0b86a832 CM |
5706 | } |
5707 | return 1; | |
5708 | } |