Commit | Line | Data |
---|---|---|
c1d7c514 | 1 | // SPDX-License-Identifier: GPL-2.0 |
5d4f98a2 YZ |
2 | /* |
3 | * Copyright (C) 2009 Oracle. All rights reserved. | |
5d4f98a2 YZ |
4 | */ |
5 | ||
6 | #include <linux/sched.h> | |
7 | #include <linux/pagemap.h> | |
8 | #include <linux/writeback.h> | |
9 | #include <linux/blkdev.h> | |
10 | #include <linux/rbtree.h> | |
5a0e3ad6 | 11 | #include <linux/slab.h> |
5d4f98a2 YZ |
12 | #include "ctree.h" |
13 | #include "disk-io.h" | |
14 | #include "transaction.h" | |
15 | #include "volumes.h" | |
16 | #include "locking.h" | |
17 | #include "btrfs_inode.h" | |
18 | #include "async-thread.h" | |
0af3d00b | 19 | #include "free-space-cache.h" |
581bb050 | 20 | #include "inode-map.h" |
62b99540 | 21 | #include "qgroup.h" |
cdccee99 | 22 | #include "print-tree.h" |
5d4f98a2 YZ |
23 | |
24 | /* | |
25 | * backref_node, mapping_node and tree_block start with this | |
26 | */ | |
27 | struct tree_entry { | |
28 | struct rb_node rb_node; | |
29 | u64 bytenr; | |
30 | }; | |
31 | ||
32 | /* | |
33 | * present a tree block in the backref cache | |
34 | */ | |
35 | struct backref_node { | |
36 | struct rb_node rb_node; | |
37 | u64 bytenr; | |
3fd0a558 YZ |
38 | |
39 | u64 new_bytenr; | |
40 | /* objectid of tree block owner, can be not uptodate */ | |
5d4f98a2 | 41 | u64 owner; |
3fd0a558 YZ |
42 | /* link to pending, changed or detached list */ |
43 | struct list_head list; | |
5d4f98a2 YZ |
44 | /* list of upper level blocks reference this block */ |
45 | struct list_head upper; | |
46 | /* list of child blocks in the cache */ | |
47 | struct list_head lower; | |
48 | /* NULL if this node is not tree root */ | |
49 | struct btrfs_root *root; | |
50 | /* extent buffer got by COW the block */ | |
51 | struct extent_buffer *eb; | |
52 | /* level of tree block */ | |
53 | unsigned int level:8; | |
3fd0a558 YZ |
54 | /* is the block in non-reference counted tree */ |
55 | unsigned int cowonly:1; | |
56 | /* 1 if no child node in the cache */ | |
5d4f98a2 YZ |
57 | unsigned int lowest:1; |
58 | /* is the extent buffer locked */ | |
59 | unsigned int locked:1; | |
60 | /* has the block been processed */ | |
61 | unsigned int processed:1; | |
62 | /* have backrefs of this block been checked */ | |
63 | unsigned int checked:1; | |
3fd0a558 YZ |
64 | /* |
65 | * 1 if corresponding block has been cowed but some upper | |
66 | * level block pointers may not point to the new location | |
67 | */ | |
68 | unsigned int pending:1; | |
69 | /* | |
70 | * 1 if the backref node isn't connected to any other | |
71 | * backref node. | |
72 | */ | |
73 | unsigned int detached:1; | |
5d4f98a2 YZ |
74 | }; |
75 | ||
76 | /* | |
77 | * present a block pointer in the backref cache | |
78 | */ | |
79 | struct backref_edge { | |
80 | struct list_head list[2]; | |
81 | struct backref_node *node[2]; | |
5d4f98a2 YZ |
82 | }; |
83 | ||
84 | #define LOWER 0 | |
85 | #define UPPER 1 | |
0647bf56 | 86 | #define RELOCATION_RESERVED_NODES 256 |
5d4f98a2 YZ |
87 | |
88 | struct backref_cache { | |
89 | /* red black tree of all backref nodes in the cache */ | |
90 | struct rb_root rb_root; | |
3fd0a558 YZ |
91 | /* for passing backref nodes to btrfs_reloc_cow_block */ |
92 | struct backref_node *path[BTRFS_MAX_LEVEL]; | |
93 | /* | |
94 | * list of blocks that have been cowed but some block | |
95 | * pointers in upper level blocks may not reflect the | |
96 | * new location | |
97 | */ | |
5d4f98a2 | 98 | struct list_head pending[BTRFS_MAX_LEVEL]; |
3fd0a558 YZ |
99 | /* list of backref nodes with no child node */ |
100 | struct list_head leaves; | |
101 | /* list of blocks that have been cowed in current transaction */ | |
102 | struct list_head changed; | |
103 | /* list of detached backref node. */ | |
104 | struct list_head detached; | |
105 | ||
106 | u64 last_trans; | |
107 | ||
108 | int nr_nodes; | |
109 | int nr_edges; | |
5d4f98a2 YZ |
110 | }; |
111 | ||
112 | /* | |
113 | * map address of tree root to tree | |
114 | */ | |
115 | struct mapping_node { | |
116 | struct rb_node rb_node; | |
117 | u64 bytenr; | |
118 | void *data; | |
119 | }; | |
120 | ||
121 | struct mapping_tree { | |
122 | struct rb_root rb_root; | |
123 | spinlock_t lock; | |
124 | }; | |
125 | ||
126 | /* | |
127 | * present a tree block to process | |
128 | */ | |
129 | struct tree_block { | |
130 | struct rb_node rb_node; | |
131 | u64 bytenr; | |
132 | struct btrfs_key key; | |
133 | unsigned int level:8; | |
134 | unsigned int key_ready:1; | |
135 | }; | |
136 | ||
0257bb82 YZ |
137 | #define MAX_EXTENTS 128 |
138 | ||
139 | struct file_extent_cluster { | |
140 | u64 start; | |
141 | u64 end; | |
142 | u64 boundary[MAX_EXTENTS]; | |
143 | unsigned int nr; | |
144 | }; | |
145 | ||
5d4f98a2 YZ |
146 | struct reloc_control { |
147 | /* block group to relocate */ | |
148 | struct btrfs_block_group_cache *block_group; | |
149 | /* extent tree */ | |
150 | struct btrfs_root *extent_root; | |
151 | /* inode for moving data */ | |
152 | struct inode *data_inode; | |
3fd0a558 YZ |
153 | |
154 | struct btrfs_block_rsv *block_rsv; | |
155 | ||
156 | struct backref_cache backref_cache; | |
157 | ||
158 | struct file_extent_cluster cluster; | |
5d4f98a2 YZ |
159 | /* tree blocks have been processed */ |
160 | struct extent_io_tree processed_blocks; | |
161 | /* map start of tree root to corresponding reloc tree */ | |
162 | struct mapping_tree reloc_root_tree; | |
163 | /* list of reloc trees */ | |
164 | struct list_head reloc_roots; | |
3fd0a558 YZ |
165 | /* size of metadata reservation for merging reloc trees */ |
166 | u64 merging_rsv_size; | |
167 | /* size of relocated tree nodes */ | |
168 | u64 nodes_relocated; | |
0647bf56 WS |
169 | /* reserved size for block group relocation*/ |
170 | u64 reserved_bytes; | |
3fd0a558 | 171 | |
5d4f98a2 YZ |
172 | u64 search_start; |
173 | u64 extents_found; | |
3fd0a558 | 174 | |
3fd0a558 YZ |
175 | unsigned int stage:8; |
176 | unsigned int create_reloc_tree:1; | |
177 | unsigned int merge_reloc_tree:1; | |
5d4f98a2 | 178 | unsigned int found_file_extent:1; |
5d4f98a2 YZ |
179 | }; |
180 | ||
181 | /* stages of data relocation */ | |
182 | #define MOVE_DATA_EXTENTS 0 | |
183 | #define UPDATE_DATA_PTRS 1 | |
184 | ||
3fd0a558 YZ |
185 | static void remove_backref_node(struct backref_cache *cache, |
186 | struct backref_node *node); | |
187 | static void __mark_block_processed(struct reloc_control *rc, | |
188 | struct backref_node *node); | |
5d4f98a2 YZ |
189 | |
190 | static void mapping_tree_init(struct mapping_tree *tree) | |
191 | { | |
6bef4d31 | 192 | tree->rb_root = RB_ROOT; |
5d4f98a2 YZ |
193 | spin_lock_init(&tree->lock); |
194 | } | |
195 | ||
196 | static void backref_cache_init(struct backref_cache *cache) | |
197 | { | |
198 | int i; | |
6bef4d31 | 199 | cache->rb_root = RB_ROOT; |
5d4f98a2 YZ |
200 | for (i = 0; i < BTRFS_MAX_LEVEL; i++) |
201 | INIT_LIST_HEAD(&cache->pending[i]); | |
3fd0a558 YZ |
202 | INIT_LIST_HEAD(&cache->changed); |
203 | INIT_LIST_HEAD(&cache->detached); | |
204 | INIT_LIST_HEAD(&cache->leaves); | |
205 | } | |
206 | ||
207 | static void backref_cache_cleanup(struct backref_cache *cache) | |
208 | { | |
209 | struct backref_node *node; | |
210 | int i; | |
211 | ||
212 | while (!list_empty(&cache->detached)) { | |
213 | node = list_entry(cache->detached.next, | |
214 | struct backref_node, list); | |
215 | remove_backref_node(cache, node); | |
216 | } | |
217 | ||
218 | while (!list_empty(&cache->leaves)) { | |
219 | node = list_entry(cache->leaves.next, | |
220 | struct backref_node, lower); | |
221 | remove_backref_node(cache, node); | |
222 | } | |
223 | ||
224 | cache->last_trans = 0; | |
225 | ||
226 | for (i = 0; i < BTRFS_MAX_LEVEL; i++) | |
f4907095 LB |
227 | ASSERT(list_empty(&cache->pending[i])); |
228 | ASSERT(list_empty(&cache->changed)); | |
229 | ASSERT(list_empty(&cache->detached)); | |
230 | ASSERT(RB_EMPTY_ROOT(&cache->rb_root)); | |
231 | ASSERT(!cache->nr_nodes); | |
232 | ASSERT(!cache->nr_edges); | |
3fd0a558 YZ |
233 | } |
234 | ||
235 | static struct backref_node *alloc_backref_node(struct backref_cache *cache) | |
236 | { | |
237 | struct backref_node *node; | |
238 | ||
239 | node = kzalloc(sizeof(*node), GFP_NOFS); | |
240 | if (node) { | |
241 | INIT_LIST_HEAD(&node->list); | |
242 | INIT_LIST_HEAD(&node->upper); | |
243 | INIT_LIST_HEAD(&node->lower); | |
244 | RB_CLEAR_NODE(&node->rb_node); | |
245 | cache->nr_nodes++; | |
246 | } | |
247 | return node; | |
248 | } | |
249 | ||
250 | static void free_backref_node(struct backref_cache *cache, | |
251 | struct backref_node *node) | |
252 | { | |
253 | if (node) { | |
254 | cache->nr_nodes--; | |
255 | kfree(node); | |
256 | } | |
257 | } | |
258 | ||
259 | static struct backref_edge *alloc_backref_edge(struct backref_cache *cache) | |
260 | { | |
261 | struct backref_edge *edge; | |
262 | ||
263 | edge = kzalloc(sizeof(*edge), GFP_NOFS); | |
264 | if (edge) | |
265 | cache->nr_edges++; | |
266 | return edge; | |
5d4f98a2 YZ |
267 | } |
268 | ||
3fd0a558 YZ |
269 | static void free_backref_edge(struct backref_cache *cache, |
270 | struct backref_edge *edge) | |
5d4f98a2 | 271 | { |
3fd0a558 YZ |
272 | if (edge) { |
273 | cache->nr_edges--; | |
274 | kfree(edge); | |
275 | } | |
5d4f98a2 YZ |
276 | } |
277 | ||
278 | static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr, | |
279 | struct rb_node *node) | |
280 | { | |
281 | struct rb_node **p = &root->rb_node; | |
282 | struct rb_node *parent = NULL; | |
283 | struct tree_entry *entry; | |
284 | ||
285 | while (*p) { | |
286 | parent = *p; | |
287 | entry = rb_entry(parent, struct tree_entry, rb_node); | |
288 | ||
289 | if (bytenr < entry->bytenr) | |
290 | p = &(*p)->rb_left; | |
291 | else if (bytenr > entry->bytenr) | |
292 | p = &(*p)->rb_right; | |
293 | else | |
294 | return parent; | |
295 | } | |
296 | ||
297 | rb_link_node(node, parent, p); | |
298 | rb_insert_color(node, root); | |
299 | return NULL; | |
300 | } | |
301 | ||
302 | static struct rb_node *tree_search(struct rb_root *root, u64 bytenr) | |
303 | { | |
304 | struct rb_node *n = root->rb_node; | |
305 | struct tree_entry *entry; | |
306 | ||
307 | while (n) { | |
308 | entry = rb_entry(n, struct tree_entry, rb_node); | |
309 | ||
310 | if (bytenr < entry->bytenr) | |
311 | n = n->rb_left; | |
312 | else if (bytenr > entry->bytenr) | |
313 | n = n->rb_right; | |
314 | else | |
315 | return n; | |
316 | } | |
317 | return NULL; | |
318 | } | |
319 | ||
48a3b636 | 320 | static void backref_tree_panic(struct rb_node *rb_node, int errno, u64 bytenr) |
43c04fb1 JM |
321 | { |
322 | ||
323 | struct btrfs_fs_info *fs_info = NULL; | |
324 | struct backref_node *bnode = rb_entry(rb_node, struct backref_node, | |
325 | rb_node); | |
326 | if (bnode->root) | |
327 | fs_info = bnode->root->fs_info; | |
5d163e0e JM |
328 | btrfs_panic(fs_info, errno, |
329 | "Inconsistency in backref cache found at offset %llu", | |
330 | bytenr); | |
43c04fb1 JM |
331 | } |
332 | ||
5d4f98a2 YZ |
333 | /* |
334 | * walk up backref nodes until reach node presents tree root | |
335 | */ | |
336 | static struct backref_node *walk_up_backref(struct backref_node *node, | |
337 | struct backref_edge *edges[], | |
338 | int *index) | |
339 | { | |
340 | struct backref_edge *edge; | |
341 | int idx = *index; | |
342 | ||
343 | while (!list_empty(&node->upper)) { | |
344 | edge = list_entry(node->upper.next, | |
345 | struct backref_edge, list[LOWER]); | |
346 | edges[idx++] = edge; | |
347 | node = edge->node[UPPER]; | |
348 | } | |
3fd0a558 | 349 | BUG_ON(node->detached); |
5d4f98a2 YZ |
350 | *index = idx; |
351 | return node; | |
352 | } | |
353 | ||
354 | /* | |
355 | * walk down backref nodes to find start of next reference path | |
356 | */ | |
357 | static struct backref_node *walk_down_backref(struct backref_edge *edges[], | |
358 | int *index) | |
359 | { | |
360 | struct backref_edge *edge; | |
361 | struct backref_node *lower; | |
362 | int idx = *index; | |
363 | ||
364 | while (idx > 0) { | |
365 | edge = edges[idx - 1]; | |
366 | lower = edge->node[LOWER]; | |
367 | if (list_is_last(&edge->list[LOWER], &lower->upper)) { | |
368 | idx--; | |
369 | continue; | |
370 | } | |
371 | edge = list_entry(edge->list[LOWER].next, | |
372 | struct backref_edge, list[LOWER]); | |
373 | edges[idx - 1] = edge; | |
374 | *index = idx; | |
375 | return edge->node[UPPER]; | |
376 | } | |
377 | *index = 0; | |
378 | return NULL; | |
379 | } | |
380 | ||
3fd0a558 YZ |
381 | static void unlock_node_buffer(struct backref_node *node) |
382 | { | |
383 | if (node->locked) { | |
384 | btrfs_tree_unlock(node->eb); | |
385 | node->locked = 0; | |
386 | } | |
387 | } | |
388 | ||
5d4f98a2 YZ |
389 | static void drop_node_buffer(struct backref_node *node) |
390 | { | |
391 | if (node->eb) { | |
3fd0a558 | 392 | unlock_node_buffer(node); |
5d4f98a2 YZ |
393 | free_extent_buffer(node->eb); |
394 | node->eb = NULL; | |
395 | } | |
396 | } | |
397 | ||
398 | static void drop_backref_node(struct backref_cache *tree, | |
399 | struct backref_node *node) | |
400 | { | |
5d4f98a2 YZ |
401 | BUG_ON(!list_empty(&node->upper)); |
402 | ||
403 | drop_node_buffer(node); | |
3fd0a558 | 404 | list_del(&node->list); |
5d4f98a2 | 405 | list_del(&node->lower); |
3fd0a558 YZ |
406 | if (!RB_EMPTY_NODE(&node->rb_node)) |
407 | rb_erase(&node->rb_node, &tree->rb_root); | |
408 | free_backref_node(tree, node); | |
5d4f98a2 YZ |
409 | } |
410 | ||
411 | /* | |
412 | * remove a backref node from the backref cache | |
413 | */ | |
414 | static void remove_backref_node(struct backref_cache *cache, | |
415 | struct backref_node *node) | |
416 | { | |
417 | struct backref_node *upper; | |
418 | struct backref_edge *edge; | |
419 | ||
420 | if (!node) | |
421 | return; | |
422 | ||
3fd0a558 | 423 | BUG_ON(!node->lowest && !node->detached); |
5d4f98a2 YZ |
424 | while (!list_empty(&node->upper)) { |
425 | edge = list_entry(node->upper.next, struct backref_edge, | |
426 | list[LOWER]); | |
427 | upper = edge->node[UPPER]; | |
428 | list_del(&edge->list[LOWER]); | |
429 | list_del(&edge->list[UPPER]); | |
3fd0a558 YZ |
430 | free_backref_edge(cache, edge); |
431 | ||
432 | if (RB_EMPTY_NODE(&upper->rb_node)) { | |
433 | BUG_ON(!list_empty(&node->upper)); | |
434 | drop_backref_node(cache, node); | |
435 | node = upper; | |
436 | node->lowest = 1; | |
437 | continue; | |
438 | } | |
5d4f98a2 | 439 | /* |
3fd0a558 | 440 | * add the node to leaf node list if no other |
5d4f98a2 YZ |
441 | * child block cached. |
442 | */ | |
443 | if (list_empty(&upper->lower)) { | |
3fd0a558 | 444 | list_add_tail(&upper->lower, &cache->leaves); |
5d4f98a2 YZ |
445 | upper->lowest = 1; |
446 | } | |
447 | } | |
3fd0a558 | 448 | |
5d4f98a2 YZ |
449 | drop_backref_node(cache, node); |
450 | } | |
451 | ||
3fd0a558 YZ |
452 | static void update_backref_node(struct backref_cache *cache, |
453 | struct backref_node *node, u64 bytenr) | |
454 | { | |
455 | struct rb_node *rb_node; | |
456 | rb_erase(&node->rb_node, &cache->rb_root); | |
457 | node->bytenr = bytenr; | |
458 | rb_node = tree_insert(&cache->rb_root, node->bytenr, &node->rb_node); | |
43c04fb1 JM |
459 | if (rb_node) |
460 | backref_tree_panic(rb_node, -EEXIST, bytenr); | |
3fd0a558 YZ |
461 | } |
462 | ||
463 | /* | |
464 | * update backref cache after a transaction commit | |
465 | */ | |
466 | static int update_backref_cache(struct btrfs_trans_handle *trans, | |
467 | struct backref_cache *cache) | |
468 | { | |
469 | struct backref_node *node; | |
470 | int level = 0; | |
471 | ||
472 | if (cache->last_trans == 0) { | |
473 | cache->last_trans = trans->transid; | |
474 | return 0; | |
475 | } | |
476 | ||
477 | if (cache->last_trans == trans->transid) | |
478 | return 0; | |
479 | ||
480 | /* | |
481 | * detached nodes are used to avoid unnecessary backref | |
482 | * lookup. transaction commit changes the extent tree. | |
483 | * so the detached nodes are no longer useful. | |
484 | */ | |
485 | while (!list_empty(&cache->detached)) { | |
486 | node = list_entry(cache->detached.next, | |
487 | struct backref_node, list); | |
488 | remove_backref_node(cache, node); | |
489 | } | |
490 | ||
491 | while (!list_empty(&cache->changed)) { | |
492 | node = list_entry(cache->changed.next, | |
493 | struct backref_node, list); | |
494 | list_del_init(&node->list); | |
495 | BUG_ON(node->pending); | |
496 | update_backref_node(cache, node, node->new_bytenr); | |
497 | } | |
498 | ||
499 | /* | |
500 | * some nodes can be left in the pending list if there were | |
501 | * errors during processing the pending nodes. | |
502 | */ | |
503 | for (level = 0; level < BTRFS_MAX_LEVEL; level++) { | |
504 | list_for_each_entry(node, &cache->pending[level], list) { | |
505 | BUG_ON(!node->pending); | |
506 | if (node->bytenr == node->new_bytenr) | |
507 | continue; | |
508 | update_backref_node(cache, node, node->new_bytenr); | |
509 | } | |
510 | } | |
511 | ||
512 | cache->last_trans = 0; | |
513 | return 1; | |
514 | } | |
515 | ||
f2a97a9d | 516 | |
3fd0a558 YZ |
517 | static int should_ignore_root(struct btrfs_root *root) |
518 | { | |
519 | struct btrfs_root *reloc_root; | |
520 | ||
27cdeb70 | 521 | if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) |
3fd0a558 YZ |
522 | return 0; |
523 | ||
524 | reloc_root = root->reloc_root; | |
525 | if (!reloc_root) | |
526 | return 0; | |
527 | ||
528 | if (btrfs_root_last_snapshot(&reloc_root->root_item) == | |
529 | root->fs_info->running_transaction->transid - 1) | |
530 | return 0; | |
531 | /* | |
532 | * if there is reloc tree and it was created in previous | |
533 | * transaction backref lookup can find the reloc tree, | |
534 | * so backref node for the fs tree root is useless for | |
535 | * relocation. | |
536 | */ | |
537 | return 1; | |
538 | } | |
5d4f98a2 YZ |
539 | /* |
540 | * find reloc tree by address of tree root | |
541 | */ | |
542 | static struct btrfs_root *find_reloc_root(struct reloc_control *rc, | |
543 | u64 bytenr) | |
544 | { | |
545 | struct rb_node *rb_node; | |
546 | struct mapping_node *node; | |
547 | struct btrfs_root *root = NULL; | |
548 | ||
549 | spin_lock(&rc->reloc_root_tree.lock); | |
550 | rb_node = tree_search(&rc->reloc_root_tree.rb_root, bytenr); | |
551 | if (rb_node) { | |
552 | node = rb_entry(rb_node, struct mapping_node, rb_node); | |
553 | root = (struct btrfs_root *)node->data; | |
554 | } | |
555 | spin_unlock(&rc->reloc_root_tree.lock); | |
556 | return root; | |
557 | } | |
558 | ||
559 | static int is_cowonly_root(u64 root_objectid) | |
560 | { | |
561 | if (root_objectid == BTRFS_ROOT_TREE_OBJECTID || | |
562 | root_objectid == BTRFS_EXTENT_TREE_OBJECTID || | |
563 | root_objectid == BTRFS_CHUNK_TREE_OBJECTID || | |
564 | root_objectid == BTRFS_DEV_TREE_OBJECTID || | |
565 | root_objectid == BTRFS_TREE_LOG_OBJECTID || | |
66463748 WS |
566 | root_objectid == BTRFS_CSUM_TREE_OBJECTID || |
567 | root_objectid == BTRFS_UUID_TREE_OBJECTID || | |
3e4c5efb DS |
568 | root_objectid == BTRFS_QUOTA_TREE_OBJECTID || |
569 | root_objectid == BTRFS_FREE_SPACE_TREE_OBJECTID) | |
5d4f98a2 YZ |
570 | return 1; |
571 | return 0; | |
572 | } | |
573 | ||
574 | static struct btrfs_root *read_fs_root(struct btrfs_fs_info *fs_info, | |
575 | u64 root_objectid) | |
576 | { | |
577 | struct btrfs_key key; | |
578 | ||
579 | key.objectid = root_objectid; | |
580 | key.type = BTRFS_ROOT_ITEM_KEY; | |
581 | if (is_cowonly_root(root_objectid)) | |
582 | key.offset = 0; | |
583 | else | |
584 | key.offset = (u64)-1; | |
585 | ||
c00869f1 | 586 | return btrfs_get_fs_root(fs_info, &key, false); |
5d4f98a2 YZ |
587 | } |
588 | ||
5d4f98a2 YZ |
589 | static noinline_for_stack |
590 | int find_inline_backref(struct extent_buffer *leaf, int slot, | |
591 | unsigned long *ptr, unsigned long *end) | |
592 | { | |
3173a18f | 593 | struct btrfs_key key; |
5d4f98a2 YZ |
594 | struct btrfs_extent_item *ei; |
595 | struct btrfs_tree_block_info *bi; | |
596 | u32 item_size; | |
597 | ||
3173a18f JB |
598 | btrfs_item_key_to_cpu(leaf, &key, slot); |
599 | ||
5d4f98a2 | 600 | item_size = btrfs_item_size_nr(leaf, slot); |
ba3c2b19 NB |
601 | if (item_size < sizeof(*ei)) { |
602 | btrfs_print_v0_err(leaf->fs_info); | |
603 | btrfs_handle_fs_error(leaf->fs_info, -EINVAL, NULL); | |
604 | return 1; | |
605 | } | |
5d4f98a2 YZ |
606 | ei = btrfs_item_ptr(leaf, slot, struct btrfs_extent_item); |
607 | WARN_ON(!(btrfs_extent_flags(leaf, ei) & | |
608 | BTRFS_EXTENT_FLAG_TREE_BLOCK)); | |
609 | ||
3173a18f JB |
610 | if (key.type == BTRFS_EXTENT_ITEM_KEY && |
611 | item_size <= sizeof(*ei) + sizeof(*bi)) { | |
5d4f98a2 YZ |
612 | WARN_ON(item_size < sizeof(*ei) + sizeof(*bi)); |
613 | return 1; | |
614 | } | |
d062d13c JB |
615 | if (key.type == BTRFS_METADATA_ITEM_KEY && |
616 | item_size <= sizeof(*ei)) { | |
617 | WARN_ON(item_size < sizeof(*ei)); | |
618 | return 1; | |
619 | } | |
5d4f98a2 | 620 | |
3173a18f JB |
621 | if (key.type == BTRFS_EXTENT_ITEM_KEY) { |
622 | bi = (struct btrfs_tree_block_info *)(ei + 1); | |
623 | *ptr = (unsigned long)(bi + 1); | |
624 | } else { | |
625 | *ptr = (unsigned long)(ei + 1); | |
626 | } | |
5d4f98a2 YZ |
627 | *end = (unsigned long)ei + item_size; |
628 | return 0; | |
629 | } | |
630 | ||
631 | /* | |
632 | * build backref tree for a given tree block. root of the backref tree | |
633 | * corresponds the tree block, leaves of the backref tree correspond | |
634 | * roots of b-trees that reference the tree block. | |
635 | * | |
636 | * the basic idea of this function is check backrefs of a given block | |
01327610 NS |
637 | * to find upper level blocks that reference the block, and then check |
638 | * backrefs of these upper level blocks recursively. the recursion stop | |
5d4f98a2 YZ |
639 | * when tree root is reached or backrefs for the block is cached. |
640 | * | |
641 | * NOTE: if we find backrefs for a block are cached, we know backrefs | |
642 | * for all upper level blocks that directly/indirectly reference the | |
643 | * block are also cached. | |
644 | */ | |
3fd0a558 YZ |
645 | static noinline_for_stack |
646 | struct backref_node *build_backref_tree(struct reloc_control *rc, | |
647 | struct btrfs_key *node_key, | |
648 | int level, u64 bytenr) | |
5d4f98a2 | 649 | { |
3fd0a558 | 650 | struct backref_cache *cache = &rc->backref_cache; |
fa6ac715 QW |
651 | struct btrfs_path *path1; /* For searching extent root */ |
652 | struct btrfs_path *path2; /* For searching parent of TREE_BLOCK_REF */ | |
5d4f98a2 YZ |
653 | struct extent_buffer *eb; |
654 | struct btrfs_root *root; | |
655 | struct backref_node *cur; | |
656 | struct backref_node *upper; | |
657 | struct backref_node *lower; | |
658 | struct backref_node *node = NULL; | |
659 | struct backref_node *exist = NULL; | |
660 | struct backref_edge *edge; | |
661 | struct rb_node *rb_node; | |
662 | struct btrfs_key key; | |
663 | unsigned long end; | |
664 | unsigned long ptr; | |
fa6ac715 | 665 | LIST_HEAD(list); /* Pending edge list, upper node needs to be checked */ |
3fd0a558 YZ |
666 | LIST_HEAD(useless); |
667 | int cowonly; | |
5d4f98a2 YZ |
668 | int ret; |
669 | int err = 0; | |
b6c60c80 | 670 | bool need_check = true; |
5d4f98a2 YZ |
671 | |
672 | path1 = btrfs_alloc_path(); | |
673 | path2 = btrfs_alloc_path(); | |
674 | if (!path1 || !path2) { | |
675 | err = -ENOMEM; | |
676 | goto out; | |
677 | } | |
e4058b54 DS |
678 | path1->reada = READA_FORWARD; |
679 | path2->reada = READA_FORWARD; | |
5d4f98a2 | 680 | |
3fd0a558 | 681 | node = alloc_backref_node(cache); |
5d4f98a2 YZ |
682 | if (!node) { |
683 | err = -ENOMEM; | |
684 | goto out; | |
685 | } | |
686 | ||
5d4f98a2 | 687 | node->bytenr = bytenr; |
5d4f98a2 YZ |
688 | node->level = level; |
689 | node->lowest = 1; | |
690 | cur = node; | |
691 | again: | |
692 | end = 0; | |
693 | ptr = 0; | |
694 | key.objectid = cur->bytenr; | |
3173a18f | 695 | key.type = BTRFS_METADATA_ITEM_KEY; |
5d4f98a2 YZ |
696 | key.offset = (u64)-1; |
697 | ||
698 | path1->search_commit_root = 1; | |
699 | path1->skip_locking = 1; | |
700 | ret = btrfs_search_slot(NULL, rc->extent_root, &key, path1, | |
701 | 0, 0); | |
702 | if (ret < 0) { | |
703 | err = ret; | |
704 | goto out; | |
705 | } | |
75bfb9af JB |
706 | ASSERT(ret); |
707 | ASSERT(path1->slots[0]); | |
5d4f98a2 YZ |
708 | |
709 | path1->slots[0]--; | |
710 | ||
711 | WARN_ON(cur->checked); | |
712 | if (!list_empty(&cur->upper)) { | |
713 | /* | |
70f23fd6 | 714 | * the backref was added previously when processing |
5d4f98a2 YZ |
715 | * backref of type BTRFS_TREE_BLOCK_REF_KEY |
716 | */ | |
75bfb9af | 717 | ASSERT(list_is_singular(&cur->upper)); |
5d4f98a2 YZ |
718 | edge = list_entry(cur->upper.next, struct backref_edge, |
719 | list[LOWER]); | |
75bfb9af | 720 | ASSERT(list_empty(&edge->list[UPPER])); |
5d4f98a2 YZ |
721 | exist = edge->node[UPPER]; |
722 | /* | |
723 | * add the upper level block to pending list if we need | |
724 | * check its backrefs | |
725 | */ | |
726 | if (!exist->checked) | |
727 | list_add_tail(&edge->list[UPPER], &list); | |
728 | } else { | |
729 | exist = NULL; | |
730 | } | |
731 | ||
732 | while (1) { | |
733 | cond_resched(); | |
734 | eb = path1->nodes[0]; | |
735 | ||
736 | if (ptr >= end) { | |
737 | if (path1->slots[0] >= btrfs_header_nritems(eb)) { | |
738 | ret = btrfs_next_leaf(rc->extent_root, path1); | |
739 | if (ret < 0) { | |
740 | err = ret; | |
741 | goto out; | |
742 | } | |
743 | if (ret > 0) | |
744 | break; | |
745 | eb = path1->nodes[0]; | |
746 | } | |
747 | ||
748 | btrfs_item_key_to_cpu(eb, &key, path1->slots[0]); | |
749 | if (key.objectid != cur->bytenr) { | |
750 | WARN_ON(exist); | |
751 | break; | |
752 | } | |
753 | ||
3173a18f JB |
754 | if (key.type == BTRFS_EXTENT_ITEM_KEY || |
755 | key.type == BTRFS_METADATA_ITEM_KEY) { | |
5d4f98a2 YZ |
756 | ret = find_inline_backref(eb, path1->slots[0], |
757 | &ptr, &end); | |
758 | if (ret) | |
759 | goto next; | |
760 | } | |
761 | } | |
762 | ||
763 | if (ptr < end) { | |
764 | /* update key for inline back ref */ | |
765 | struct btrfs_extent_inline_ref *iref; | |
3de28d57 | 766 | int type; |
5d4f98a2 | 767 | iref = (struct btrfs_extent_inline_ref *)ptr; |
3de28d57 LB |
768 | type = btrfs_get_extent_inline_ref_type(eb, iref, |
769 | BTRFS_REF_TYPE_BLOCK); | |
770 | if (type == BTRFS_REF_TYPE_INVALID) { | |
af431dcb | 771 | err = -EUCLEAN; |
3de28d57 LB |
772 | goto out; |
773 | } | |
774 | key.type = type; | |
5d4f98a2 | 775 | key.offset = btrfs_extent_inline_ref_offset(eb, iref); |
3de28d57 | 776 | |
5d4f98a2 YZ |
777 | WARN_ON(key.type != BTRFS_TREE_BLOCK_REF_KEY && |
778 | key.type != BTRFS_SHARED_BLOCK_REF_KEY); | |
779 | } | |
780 | ||
fa6ac715 QW |
781 | /* |
782 | * Parent node found and matches current inline ref, no need to | |
783 | * rebuild this node for this inline ref. | |
784 | */ | |
5d4f98a2 YZ |
785 | if (exist && |
786 | ((key.type == BTRFS_TREE_BLOCK_REF_KEY && | |
787 | exist->owner == key.offset) || | |
788 | (key.type == BTRFS_SHARED_BLOCK_REF_KEY && | |
789 | exist->bytenr == key.offset))) { | |
790 | exist = NULL; | |
791 | goto next; | |
792 | } | |
793 | ||
fa6ac715 | 794 | /* SHARED_BLOCK_REF means key.offset is the parent bytenr */ |
5d4f98a2 | 795 | if (key.type == BTRFS_SHARED_BLOCK_REF_KEY) { |
5d4f98a2 YZ |
796 | if (key.objectid == key.offset) { |
797 | /* | |
fa6ac715 QW |
798 | * Only root blocks of reloc trees use backref |
799 | * pointing to itself. | |
5d4f98a2 YZ |
800 | */ |
801 | root = find_reloc_root(rc, cur->bytenr); | |
75bfb9af | 802 | ASSERT(root); |
5d4f98a2 YZ |
803 | cur->root = root; |
804 | break; | |
805 | } | |
806 | ||
3fd0a558 | 807 | edge = alloc_backref_edge(cache); |
5d4f98a2 YZ |
808 | if (!edge) { |
809 | err = -ENOMEM; | |
810 | goto out; | |
811 | } | |
812 | rb_node = tree_search(&cache->rb_root, key.offset); | |
813 | if (!rb_node) { | |
3fd0a558 | 814 | upper = alloc_backref_node(cache); |
5d4f98a2 | 815 | if (!upper) { |
3fd0a558 | 816 | free_backref_edge(cache, edge); |
5d4f98a2 YZ |
817 | err = -ENOMEM; |
818 | goto out; | |
819 | } | |
5d4f98a2 | 820 | upper->bytenr = key.offset; |
5d4f98a2 YZ |
821 | upper->level = cur->level + 1; |
822 | /* | |
823 | * backrefs for the upper level block isn't | |
824 | * cached, add the block to pending list | |
825 | */ | |
826 | list_add_tail(&edge->list[UPPER], &list); | |
827 | } else { | |
828 | upper = rb_entry(rb_node, struct backref_node, | |
829 | rb_node); | |
75bfb9af | 830 | ASSERT(upper->checked); |
5d4f98a2 YZ |
831 | INIT_LIST_HEAD(&edge->list[UPPER]); |
832 | } | |
3fd0a558 | 833 | list_add_tail(&edge->list[LOWER], &cur->upper); |
5d4f98a2 | 834 | edge->node[LOWER] = cur; |
3fd0a558 | 835 | edge->node[UPPER] = upper; |
5d4f98a2 YZ |
836 | |
837 | goto next; | |
6d8ff4e4 | 838 | } else if (unlikely(key.type == BTRFS_EXTENT_REF_V0_KEY)) { |
ba3c2b19 NB |
839 | err = -EINVAL; |
840 | btrfs_print_v0_err(rc->extent_root->fs_info); | |
841 | btrfs_handle_fs_error(rc->extent_root->fs_info, err, | |
842 | NULL); | |
843 | goto out; | |
5d4f98a2 YZ |
844 | } else if (key.type != BTRFS_TREE_BLOCK_REF_KEY) { |
845 | goto next; | |
846 | } | |
847 | ||
fa6ac715 QW |
848 | /* |
849 | * key.type == BTRFS_TREE_BLOCK_REF_KEY, inline ref offset | |
850 | * means the root objectid. We need to search the tree to get | |
851 | * its parent bytenr. | |
852 | */ | |
5d4f98a2 YZ |
853 | root = read_fs_root(rc->extent_root->fs_info, key.offset); |
854 | if (IS_ERR(root)) { | |
855 | err = PTR_ERR(root); | |
856 | goto out; | |
857 | } | |
858 | ||
27cdeb70 | 859 | if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) |
3fd0a558 YZ |
860 | cur->cowonly = 1; |
861 | ||
5d4f98a2 YZ |
862 | if (btrfs_root_level(&root->root_item) == cur->level) { |
863 | /* tree root */ | |
75bfb9af | 864 | ASSERT(btrfs_root_bytenr(&root->root_item) == |
5d4f98a2 | 865 | cur->bytenr); |
3fd0a558 YZ |
866 | if (should_ignore_root(root)) |
867 | list_add(&cur->list, &useless); | |
868 | else | |
869 | cur->root = root; | |
5d4f98a2 YZ |
870 | break; |
871 | } | |
872 | ||
873 | level = cur->level + 1; | |
874 | ||
fa6ac715 | 875 | /* Search the tree to find parent blocks referring the block. */ |
5d4f98a2 YZ |
876 | path2->search_commit_root = 1; |
877 | path2->skip_locking = 1; | |
878 | path2->lowest_level = level; | |
879 | ret = btrfs_search_slot(NULL, root, node_key, path2, 0, 0); | |
880 | path2->lowest_level = 0; | |
881 | if (ret < 0) { | |
882 | err = ret; | |
883 | goto out; | |
884 | } | |
33c66f43 YZ |
885 | if (ret > 0 && path2->slots[level] > 0) |
886 | path2->slots[level]--; | |
5d4f98a2 YZ |
887 | |
888 | eb = path2->nodes[level]; | |
3561b9db LB |
889 | if (btrfs_node_blockptr(eb, path2->slots[level]) != |
890 | cur->bytenr) { | |
891 | btrfs_err(root->fs_info, | |
892 | "couldn't find block (%llu) (level %d) in tree (%llu) with key (%llu %u %llu)", | |
4fd786e6 MT |
893 | cur->bytenr, level - 1, |
894 | root->root_key.objectid, | |
3561b9db LB |
895 | node_key->objectid, node_key->type, |
896 | node_key->offset); | |
897 | err = -ENOENT; | |
898 | goto out; | |
899 | } | |
5d4f98a2 | 900 | lower = cur; |
b6c60c80 | 901 | need_check = true; |
fa6ac715 QW |
902 | |
903 | /* Add all nodes and edges in the path */ | |
5d4f98a2 YZ |
904 | for (; level < BTRFS_MAX_LEVEL; level++) { |
905 | if (!path2->nodes[level]) { | |
75bfb9af | 906 | ASSERT(btrfs_root_bytenr(&root->root_item) == |
5d4f98a2 | 907 | lower->bytenr); |
3fd0a558 YZ |
908 | if (should_ignore_root(root)) |
909 | list_add(&lower->list, &useless); | |
910 | else | |
911 | lower->root = root; | |
5d4f98a2 YZ |
912 | break; |
913 | } | |
914 | ||
3fd0a558 | 915 | edge = alloc_backref_edge(cache); |
5d4f98a2 YZ |
916 | if (!edge) { |
917 | err = -ENOMEM; | |
918 | goto out; | |
919 | } | |
920 | ||
921 | eb = path2->nodes[level]; | |
922 | rb_node = tree_search(&cache->rb_root, eb->start); | |
923 | if (!rb_node) { | |
3fd0a558 | 924 | upper = alloc_backref_node(cache); |
5d4f98a2 | 925 | if (!upper) { |
3fd0a558 | 926 | free_backref_edge(cache, edge); |
5d4f98a2 YZ |
927 | err = -ENOMEM; |
928 | goto out; | |
929 | } | |
5d4f98a2 YZ |
930 | upper->bytenr = eb->start; |
931 | upper->owner = btrfs_header_owner(eb); | |
932 | upper->level = lower->level + 1; | |
27cdeb70 MX |
933 | if (!test_bit(BTRFS_ROOT_REF_COWS, |
934 | &root->state)) | |
3fd0a558 | 935 | upper->cowonly = 1; |
5d4f98a2 YZ |
936 | |
937 | /* | |
938 | * if we know the block isn't shared | |
939 | * we can void checking its backrefs. | |
940 | */ | |
941 | if (btrfs_block_can_be_shared(root, eb)) | |
942 | upper->checked = 0; | |
943 | else | |
944 | upper->checked = 1; | |
945 | ||
946 | /* | |
947 | * add the block to pending list if we | |
b6c60c80 JB |
948 | * need check its backrefs, we only do this once |
949 | * while walking up a tree as we will catch | |
950 | * anything else later on. | |
5d4f98a2 | 951 | */ |
b6c60c80 JB |
952 | if (!upper->checked && need_check) { |
953 | need_check = false; | |
5d4f98a2 YZ |
954 | list_add_tail(&edge->list[UPPER], |
955 | &list); | |
bbe90514 JB |
956 | } else { |
957 | if (upper->checked) | |
958 | need_check = true; | |
5d4f98a2 | 959 | INIT_LIST_HEAD(&edge->list[UPPER]); |
bbe90514 | 960 | } |
5d4f98a2 YZ |
961 | } else { |
962 | upper = rb_entry(rb_node, struct backref_node, | |
963 | rb_node); | |
75bfb9af | 964 | ASSERT(upper->checked); |
5d4f98a2 | 965 | INIT_LIST_HEAD(&edge->list[UPPER]); |
3fd0a558 YZ |
966 | if (!upper->owner) |
967 | upper->owner = btrfs_header_owner(eb); | |
5d4f98a2 YZ |
968 | } |
969 | list_add_tail(&edge->list[LOWER], &lower->upper); | |
5d4f98a2 | 970 | edge->node[LOWER] = lower; |
3fd0a558 | 971 | edge->node[UPPER] = upper; |
5d4f98a2 YZ |
972 | |
973 | if (rb_node) | |
974 | break; | |
975 | lower = upper; | |
976 | upper = NULL; | |
977 | } | |
b3b4aa74 | 978 | btrfs_release_path(path2); |
5d4f98a2 YZ |
979 | next: |
980 | if (ptr < end) { | |
981 | ptr += btrfs_extent_inline_ref_size(key.type); | |
982 | if (ptr >= end) { | |
983 | WARN_ON(ptr > end); | |
984 | ptr = 0; | |
985 | end = 0; | |
986 | } | |
987 | } | |
988 | if (ptr >= end) | |
989 | path1->slots[0]++; | |
990 | } | |
b3b4aa74 | 991 | btrfs_release_path(path1); |
5d4f98a2 YZ |
992 | |
993 | cur->checked = 1; | |
994 | WARN_ON(exist); | |
995 | ||
996 | /* the pending list isn't empty, take the first block to process */ | |
997 | if (!list_empty(&list)) { | |
998 | edge = list_entry(list.next, struct backref_edge, list[UPPER]); | |
999 | list_del_init(&edge->list[UPPER]); | |
1000 | cur = edge->node[UPPER]; | |
1001 | goto again; | |
1002 | } | |
1003 | ||
1004 | /* | |
1005 | * everything goes well, connect backref nodes and insert backref nodes | |
1006 | * into the cache. | |
1007 | */ | |
75bfb9af | 1008 | ASSERT(node->checked); |
3fd0a558 YZ |
1009 | cowonly = node->cowonly; |
1010 | if (!cowonly) { | |
1011 | rb_node = tree_insert(&cache->rb_root, node->bytenr, | |
1012 | &node->rb_node); | |
43c04fb1 JM |
1013 | if (rb_node) |
1014 | backref_tree_panic(rb_node, -EEXIST, node->bytenr); | |
3fd0a558 YZ |
1015 | list_add_tail(&node->lower, &cache->leaves); |
1016 | } | |
5d4f98a2 YZ |
1017 | |
1018 | list_for_each_entry(edge, &node->upper, list[LOWER]) | |
1019 | list_add_tail(&edge->list[UPPER], &list); | |
1020 | ||
1021 | while (!list_empty(&list)) { | |
1022 | edge = list_entry(list.next, struct backref_edge, list[UPPER]); | |
1023 | list_del_init(&edge->list[UPPER]); | |
1024 | upper = edge->node[UPPER]; | |
3fd0a558 YZ |
1025 | if (upper->detached) { |
1026 | list_del(&edge->list[LOWER]); | |
1027 | lower = edge->node[LOWER]; | |
1028 | free_backref_edge(cache, edge); | |
1029 | if (list_empty(&lower->upper)) | |
1030 | list_add(&lower->list, &useless); | |
1031 | continue; | |
1032 | } | |
5d4f98a2 YZ |
1033 | |
1034 | if (!RB_EMPTY_NODE(&upper->rb_node)) { | |
1035 | if (upper->lowest) { | |
1036 | list_del_init(&upper->lower); | |
1037 | upper->lowest = 0; | |
1038 | } | |
1039 | ||
1040 | list_add_tail(&edge->list[UPPER], &upper->lower); | |
1041 | continue; | |
1042 | } | |
1043 | ||
75bfb9af JB |
1044 | if (!upper->checked) { |
1045 | /* | |
1046 | * Still want to blow up for developers since this is a | |
1047 | * logic bug. | |
1048 | */ | |
1049 | ASSERT(0); | |
1050 | err = -EINVAL; | |
1051 | goto out; | |
1052 | } | |
1053 | if (cowonly != upper->cowonly) { | |
1054 | ASSERT(0); | |
1055 | err = -EINVAL; | |
1056 | goto out; | |
1057 | } | |
1058 | ||
3fd0a558 YZ |
1059 | if (!cowonly) { |
1060 | rb_node = tree_insert(&cache->rb_root, upper->bytenr, | |
1061 | &upper->rb_node); | |
43c04fb1 JM |
1062 | if (rb_node) |
1063 | backref_tree_panic(rb_node, -EEXIST, | |
1064 | upper->bytenr); | |
3fd0a558 | 1065 | } |
5d4f98a2 YZ |
1066 | |
1067 | list_add_tail(&edge->list[UPPER], &upper->lower); | |
1068 | ||
1069 | list_for_each_entry(edge, &upper->upper, list[LOWER]) | |
1070 | list_add_tail(&edge->list[UPPER], &list); | |
1071 | } | |
3fd0a558 YZ |
1072 | /* |
1073 | * process useless backref nodes. backref nodes for tree leaves | |
1074 | * are deleted from the cache. backref nodes for upper level | |
1075 | * tree blocks are left in the cache to avoid unnecessary backref | |
1076 | * lookup. | |
1077 | */ | |
1078 | while (!list_empty(&useless)) { | |
1079 | upper = list_entry(useless.next, struct backref_node, list); | |
1080 | list_del_init(&upper->list); | |
75bfb9af | 1081 | ASSERT(list_empty(&upper->upper)); |
3fd0a558 YZ |
1082 | if (upper == node) |
1083 | node = NULL; | |
1084 | if (upper->lowest) { | |
1085 | list_del_init(&upper->lower); | |
1086 | upper->lowest = 0; | |
1087 | } | |
1088 | while (!list_empty(&upper->lower)) { | |
1089 | edge = list_entry(upper->lower.next, | |
1090 | struct backref_edge, list[UPPER]); | |
1091 | list_del(&edge->list[UPPER]); | |
1092 | list_del(&edge->list[LOWER]); | |
1093 | lower = edge->node[LOWER]; | |
1094 | free_backref_edge(cache, edge); | |
1095 | ||
1096 | if (list_empty(&lower->upper)) | |
1097 | list_add(&lower->list, &useless); | |
1098 | } | |
1099 | __mark_block_processed(rc, upper); | |
1100 | if (upper->level > 0) { | |
1101 | list_add(&upper->list, &cache->detached); | |
1102 | upper->detached = 1; | |
1103 | } else { | |
1104 | rb_erase(&upper->rb_node, &cache->rb_root); | |
1105 | free_backref_node(cache, upper); | |
1106 | } | |
1107 | } | |
5d4f98a2 YZ |
1108 | out: |
1109 | btrfs_free_path(path1); | |
1110 | btrfs_free_path(path2); | |
1111 | if (err) { | |
3fd0a558 YZ |
1112 | while (!list_empty(&useless)) { |
1113 | lower = list_entry(useless.next, | |
75bfb9af JB |
1114 | struct backref_node, list); |
1115 | list_del_init(&lower->list); | |
3fd0a558 | 1116 | } |
75bfb9af JB |
1117 | while (!list_empty(&list)) { |
1118 | edge = list_first_entry(&list, struct backref_edge, | |
1119 | list[UPPER]); | |
1120 | list_del(&edge->list[UPPER]); | |
3fd0a558 | 1121 | list_del(&edge->list[LOWER]); |
75bfb9af | 1122 | lower = edge->node[LOWER]; |
5d4f98a2 | 1123 | upper = edge->node[UPPER]; |
3fd0a558 | 1124 | free_backref_edge(cache, edge); |
75bfb9af JB |
1125 | |
1126 | /* | |
1127 | * Lower is no longer linked to any upper backref nodes | |
1128 | * and isn't in the cache, we can free it ourselves. | |
1129 | */ | |
1130 | if (list_empty(&lower->upper) && | |
1131 | RB_EMPTY_NODE(&lower->rb_node)) | |
1132 | list_add(&lower->list, &useless); | |
1133 | ||
1134 | if (!RB_EMPTY_NODE(&upper->rb_node)) | |
1135 | continue; | |
1136 | ||
01327610 | 1137 | /* Add this guy's upper edges to the list to process */ |
75bfb9af JB |
1138 | list_for_each_entry(edge, &upper->upper, list[LOWER]) |
1139 | list_add_tail(&edge->list[UPPER], &list); | |
1140 | if (list_empty(&upper->upper)) | |
1141 | list_add(&upper->list, &useless); | |
1142 | } | |
1143 | ||
1144 | while (!list_empty(&useless)) { | |
1145 | lower = list_entry(useless.next, | |
1146 | struct backref_node, list); | |
1147 | list_del_init(&lower->list); | |
0fd8c3da LB |
1148 | if (lower == node) |
1149 | node = NULL; | |
75bfb9af | 1150 | free_backref_node(cache, lower); |
5d4f98a2 | 1151 | } |
0fd8c3da LB |
1152 | |
1153 | free_backref_node(cache, node); | |
5d4f98a2 YZ |
1154 | return ERR_PTR(err); |
1155 | } | |
75bfb9af | 1156 | ASSERT(!node || !node->detached); |
5d4f98a2 YZ |
1157 | return node; |
1158 | } | |
1159 | ||
3fd0a558 YZ |
1160 | /* |
1161 | * helper to add backref node for the newly created snapshot. | |
1162 | * the backref node is created by cloning backref node that | |
1163 | * corresponds to root of source tree | |
1164 | */ | |
1165 | static int clone_backref_node(struct btrfs_trans_handle *trans, | |
1166 | struct reloc_control *rc, | |
1167 | struct btrfs_root *src, | |
1168 | struct btrfs_root *dest) | |
1169 | { | |
1170 | struct btrfs_root *reloc_root = src->reloc_root; | |
1171 | struct backref_cache *cache = &rc->backref_cache; | |
1172 | struct backref_node *node = NULL; | |
1173 | struct backref_node *new_node; | |
1174 | struct backref_edge *edge; | |
1175 | struct backref_edge *new_edge; | |
1176 | struct rb_node *rb_node; | |
1177 | ||
1178 | if (cache->last_trans > 0) | |
1179 | update_backref_cache(trans, cache); | |
1180 | ||
1181 | rb_node = tree_search(&cache->rb_root, src->commit_root->start); | |
1182 | if (rb_node) { | |
1183 | node = rb_entry(rb_node, struct backref_node, rb_node); | |
1184 | if (node->detached) | |
1185 | node = NULL; | |
1186 | else | |
1187 | BUG_ON(node->new_bytenr != reloc_root->node->start); | |
1188 | } | |
1189 | ||
1190 | if (!node) { | |
1191 | rb_node = tree_search(&cache->rb_root, | |
1192 | reloc_root->commit_root->start); | |
1193 | if (rb_node) { | |
1194 | node = rb_entry(rb_node, struct backref_node, | |
1195 | rb_node); | |
1196 | BUG_ON(node->detached); | |
1197 | } | |
1198 | } | |
1199 | ||
1200 | if (!node) | |
1201 | return 0; | |
1202 | ||
1203 | new_node = alloc_backref_node(cache); | |
1204 | if (!new_node) | |
1205 | return -ENOMEM; | |
1206 | ||
1207 | new_node->bytenr = dest->node->start; | |
1208 | new_node->level = node->level; | |
1209 | new_node->lowest = node->lowest; | |
6848ad64 | 1210 | new_node->checked = 1; |
3fd0a558 YZ |
1211 | new_node->root = dest; |
1212 | ||
1213 | if (!node->lowest) { | |
1214 | list_for_each_entry(edge, &node->lower, list[UPPER]) { | |
1215 | new_edge = alloc_backref_edge(cache); | |
1216 | if (!new_edge) | |
1217 | goto fail; | |
1218 | ||
1219 | new_edge->node[UPPER] = new_node; | |
1220 | new_edge->node[LOWER] = edge->node[LOWER]; | |
1221 | list_add_tail(&new_edge->list[UPPER], | |
1222 | &new_node->lower); | |
1223 | } | |
76b9e23d MX |
1224 | } else { |
1225 | list_add_tail(&new_node->lower, &cache->leaves); | |
3fd0a558 YZ |
1226 | } |
1227 | ||
1228 | rb_node = tree_insert(&cache->rb_root, new_node->bytenr, | |
1229 | &new_node->rb_node); | |
43c04fb1 JM |
1230 | if (rb_node) |
1231 | backref_tree_panic(rb_node, -EEXIST, new_node->bytenr); | |
3fd0a558 YZ |
1232 | |
1233 | if (!new_node->lowest) { | |
1234 | list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { | |
1235 | list_add_tail(&new_edge->list[LOWER], | |
1236 | &new_edge->node[LOWER]->upper); | |
1237 | } | |
1238 | } | |
1239 | return 0; | |
1240 | fail: | |
1241 | while (!list_empty(&new_node->lower)) { | |
1242 | new_edge = list_entry(new_node->lower.next, | |
1243 | struct backref_edge, list[UPPER]); | |
1244 | list_del(&new_edge->list[UPPER]); | |
1245 | free_backref_edge(cache, new_edge); | |
1246 | } | |
1247 | free_backref_node(cache, new_node); | |
1248 | return -ENOMEM; | |
1249 | } | |
1250 | ||
5d4f98a2 YZ |
1251 | /* |
1252 | * helper to add 'address of tree root -> reloc tree' mapping | |
1253 | */ | |
ffd7b339 | 1254 | static int __must_check __add_reloc_root(struct btrfs_root *root) |
5d4f98a2 | 1255 | { |
0b246afa | 1256 | struct btrfs_fs_info *fs_info = root->fs_info; |
5d4f98a2 YZ |
1257 | struct rb_node *rb_node; |
1258 | struct mapping_node *node; | |
0b246afa | 1259 | struct reloc_control *rc = fs_info->reloc_ctl; |
5d4f98a2 YZ |
1260 | |
1261 | node = kmalloc(sizeof(*node), GFP_NOFS); | |
ffd7b339 JM |
1262 | if (!node) |
1263 | return -ENOMEM; | |
5d4f98a2 YZ |
1264 | |
1265 | node->bytenr = root->node->start; | |
1266 | node->data = root; | |
1267 | ||
1268 | spin_lock(&rc->reloc_root_tree.lock); | |
1269 | rb_node = tree_insert(&rc->reloc_root_tree.rb_root, | |
1270 | node->bytenr, &node->rb_node); | |
1271 | spin_unlock(&rc->reloc_root_tree.lock); | |
ffd7b339 | 1272 | if (rb_node) { |
0b246afa | 1273 | btrfs_panic(fs_info, -EEXIST, |
5d163e0e JM |
1274 | "Duplicate root found for start=%llu while inserting into relocation tree", |
1275 | node->bytenr); | |
ffd7b339 | 1276 | } |
5d4f98a2 YZ |
1277 | |
1278 | list_add_tail(&root->root_list, &rc->reloc_roots); | |
1279 | return 0; | |
1280 | } | |
1281 | ||
1282 | /* | |
c974c464 | 1283 | * helper to delete the 'address of tree root -> reloc tree' |
5d4f98a2 YZ |
1284 | * mapping |
1285 | */ | |
c974c464 | 1286 | static void __del_reloc_root(struct btrfs_root *root) |
5d4f98a2 | 1287 | { |
0b246afa | 1288 | struct btrfs_fs_info *fs_info = root->fs_info; |
5d4f98a2 YZ |
1289 | struct rb_node *rb_node; |
1290 | struct mapping_node *node = NULL; | |
0b246afa | 1291 | struct reloc_control *rc = fs_info->reloc_ctl; |
5d4f98a2 | 1292 | |
65c6e82b | 1293 | if (rc && root->node) { |
389305b2 QW |
1294 | spin_lock(&rc->reloc_root_tree.lock); |
1295 | rb_node = tree_search(&rc->reloc_root_tree.rb_root, | |
1296 | root->node->start); | |
1297 | if (rb_node) { | |
1298 | node = rb_entry(rb_node, struct mapping_node, rb_node); | |
1299 | rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); | |
1300 | } | |
1301 | spin_unlock(&rc->reloc_root_tree.lock); | |
1302 | if (!node) | |
1303 | return; | |
1304 | BUG_ON((struct btrfs_root *)node->data != root); | |
5d4f98a2 | 1305 | } |
5d4f98a2 | 1306 | |
0b246afa | 1307 | spin_lock(&fs_info->trans_lock); |
c974c464 | 1308 | list_del_init(&root->root_list); |
0b246afa | 1309 | spin_unlock(&fs_info->trans_lock); |
c974c464 WS |
1310 | kfree(node); |
1311 | } | |
1312 | ||
1313 | /* | |
1314 | * helper to update the 'address of tree root -> reloc tree' | |
1315 | * mapping | |
1316 | */ | |
1317 | static int __update_reloc_root(struct btrfs_root *root, u64 new_bytenr) | |
1318 | { | |
0b246afa | 1319 | struct btrfs_fs_info *fs_info = root->fs_info; |
c974c464 WS |
1320 | struct rb_node *rb_node; |
1321 | struct mapping_node *node = NULL; | |
0b246afa | 1322 | struct reloc_control *rc = fs_info->reloc_ctl; |
c974c464 WS |
1323 | |
1324 | spin_lock(&rc->reloc_root_tree.lock); | |
1325 | rb_node = tree_search(&rc->reloc_root_tree.rb_root, | |
1326 | root->node->start); | |
1327 | if (rb_node) { | |
1328 | node = rb_entry(rb_node, struct mapping_node, rb_node); | |
1329 | rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); | |
5d4f98a2 | 1330 | } |
c974c464 WS |
1331 | spin_unlock(&rc->reloc_root_tree.lock); |
1332 | ||
1333 | if (!node) | |
1334 | return 0; | |
1335 | BUG_ON((struct btrfs_root *)node->data != root); | |
1336 | ||
1337 | spin_lock(&rc->reloc_root_tree.lock); | |
1338 | node->bytenr = new_bytenr; | |
1339 | rb_node = tree_insert(&rc->reloc_root_tree.rb_root, | |
1340 | node->bytenr, &node->rb_node); | |
1341 | spin_unlock(&rc->reloc_root_tree.lock); | |
1342 | if (rb_node) | |
1343 | backref_tree_panic(rb_node, -EEXIST, node->bytenr); | |
5d4f98a2 YZ |
1344 | return 0; |
1345 | } | |
1346 | ||
3fd0a558 YZ |
1347 | static struct btrfs_root *create_reloc_root(struct btrfs_trans_handle *trans, |
1348 | struct btrfs_root *root, u64 objectid) | |
5d4f98a2 | 1349 | { |
0b246afa | 1350 | struct btrfs_fs_info *fs_info = root->fs_info; |
5d4f98a2 YZ |
1351 | struct btrfs_root *reloc_root; |
1352 | struct extent_buffer *eb; | |
1353 | struct btrfs_root_item *root_item; | |
1354 | struct btrfs_key root_key; | |
1355 | int ret; | |
1356 | ||
5d4f98a2 YZ |
1357 | root_item = kmalloc(sizeof(*root_item), GFP_NOFS); |
1358 | BUG_ON(!root_item); | |
1359 | ||
1360 | root_key.objectid = BTRFS_TREE_RELOC_OBJECTID; | |
1361 | root_key.type = BTRFS_ROOT_ITEM_KEY; | |
3fd0a558 | 1362 | root_key.offset = objectid; |
5d4f98a2 | 1363 | |
3fd0a558 | 1364 | if (root->root_key.objectid == objectid) { |
054570a1 FM |
1365 | u64 commit_root_gen; |
1366 | ||
3fd0a558 YZ |
1367 | /* called by btrfs_init_reloc_root */ |
1368 | ret = btrfs_copy_root(trans, root, root->commit_root, &eb, | |
1369 | BTRFS_TREE_RELOC_OBJECTID); | |
1370 | BUG_ON(ret); | |
054570a1 FM |
1371 | /* |
1372 | * Set the last_snapshot field to the generation of the commit | |
1373 | * root - like this ctree.c:btrfs_block_can_be_shared() behaves | |
1374 | * correctly (returns true) when the relocation root is created | |
1375 | * either inside the critical section of a transaction commit | |
1376 | * (through transaction.c:qgroup_account_snapshot()) and when | |
1377 | * it's created before the transaction commit is started. | |
1378 | */ | |
1379 | commit_root_gen = btrfs_header_generation(root->commit_root); | |
1380 | btrfs_set_root_last_snapshot(&root->root_item, commit_root_gen); | |
3fd0a558 YZ |
1381 | } else { |
1382 | /* | |
1383 | * called by btrfs_reloc_post_snapshot_hook. | |
1384 | * the source tree is a reloc tree, all tree blocks | |
1385 | * modified after it was created have RELOC flag | |
1386 | * set in their headers. so it's OK to not update | |
1387 | * the 'last_snapshot'. | |
1388 | */ | |
1389 | ret = btrfs_copy_root(trans, root, root->node, &eb, | |
1390 | BTRFS_TREE_RELOC_OBJECTID); | |
1391 | BUG_ON(ret); | |
1392 | } | |
5d4f98a2 | 1393 | |
5d4f98a2 | 1394 | memcpy(root_item, &root->root_item, sizeof(*root_item)); |
5d4f98a2 YZ |
1395 | btrfs_set_root_bytenr(root_item, eb->start); |
1396 | btrfs_set_root_level(root_item, btrfs_header_level(eb)); | |
1397 | btrfs_set_root_generation(root_item, trans->transid); | |
3fd0a558 YZ |
1398 | |
1399 | if (root->root_key.objectid == objectid) { | |
1400 | btrfs_set_root_refs(root_item, 0); | |
1401 | memset(&root_item->drop_progress, 0, | |
1402 | sizeof(struct btrfs_disk_key)); | |
1403 | root_item->drop_level = 0; | |
1404 | } | |
5d4f98a2 YZ |
1405 | |
1406 | btrfs_tree_unlock(eb); | |
1407 | free_extent_buffer(eb); | |
1408 | ||
0b246afa | 1409 | ret = btrfs_insert_root(trans, fs_info->tree_root, |
5d4f98a2 YZ |
1410 | &root_key, root_item); |
1411 | BUG_ON(ret); | |
1412 | kfree(root_item); | |
1413 | ||
0b246afa | 1414 | reloc_root = btrfs_read_fs_root(fs_info->tree_root, &root_key); |
5d4f98a2 YZ |
1415 | BUG_ON(IS_ERR(reloc_root)); |
1416 | reloc_root->last_trans = trans->transid; | |
3fd0a558 YZ |
1417 | return reloc_root; |
1418 | } | |
1419 | ||
1420 | /* | |
1421 | * create reloc tree for a given fs tree. reloc tree is just a | |
1422 | * snapshot of the fs tree with special root objectid. | |
1423 | */ | |
1424 | int btrfs_init_reloc_root(struct btrfs_trans_handle *trans, | |
1425 | struct btrfs_root *root) | |
1426 | { | |
0b246afa | 1427 | struct btrfs_fs_info *fs_info = root->fs_info; |
3fd0a558 | 1428 | struct btrfs_root *reloc_root; |
0b246afa | 1429 | struct reloc_control *rc = fs_info->reloc_ctl; |
20dd2cbf | 1430 | struct btrfs_block_rsv *rsv; |
3fd0a558 | 1431 | int clear_rsv = 0; |
ffd7b339 | 1432 | int ret; |
3fd0a558 YZ |
1433 | |
1434 | if (root->reloc_root) { | |
1435 | reloc_root = root->reloc_root; | |
1436 | reloc_root->last_trans = trans->transid; | |
1437 | return 0; | |
1438 | } | |
1439 | ||
1440 | if (!rc || !rc->create_reloc_tree || | |
1441 | root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) | |
1442 | return 0; | |
1443 | ||
20dd2cbf MX |
1444 | if (!trans->reloc_reserved) { |
1445 | rsv = trans->block_rsv; | |
3fd0a558 YZ |
1446 | trans->block_rsv = rc->block_rsv; |
1447 | clear_rsv = 1; | |
1448 | } | |
1449 | reloc_root = create_reloc_root(trans, root, root->root_key.objectid); | |
1450 | if (clear_rsv) | |
20dd2cbf | 1451 | trans->block_rsv = rsv; |
5d4f98a2 | 1452 | |
ffd7b339 JM |
1453 | ret = __add_reloc_root(reloc_root); |
1454 | BUG_ON(ret < 0); | |
5d4f98a2 YZ |
1455 | root->reloc_root = reloc_root; |
1456 | return 0; | |
1457 | } | |
1458 | ||
1459 | /* | |
1460 | * update root item of reloc tree | |
1461 | */ | |
1462 | int btrfs_update_reloc_root(struct btrfs_trans_handle *trans, | |
1463 | struct btrfs_root *root) | |
1464 | { | |
0b246afa | 1465 | struct btrfs_fs_info *fs_info = root->fs_info; |
5d4f98a2 YZ |
1466 | struct btrfs_root *reloc_root; |
1467 | struct btrfs_root_item *root_item; | |
5d4f98a2 YZ |
1468 | int ret; |
1469 | ||
1470 | if (!root->reloc_root) | |
7585717f | 1471 | goto out; |
5d4f98a2 YZ |
1472 | |
1473 | reloc_root = root->reloc_root; | |
1474 | root_item = &reloc_root->root_item; | |
1475 | ||
0b246afa | 1476 | if (fs_info->reloc_ctl->merge_reloc_tree && |
3fd0a558 | 1477 | btrfs_root_refs(root_item) == 0) { |
5d4f98a2 | 1478 | root->reloc_root = NULL; |
c974c464 | 1479 | __del_reloc_root(reloc_root); |
5d4f98a2 YZ |
1480 | } |
1481 | ||
5d4f98a2 YZ |
1482 | if (reloc_root->commit_root != reloc_root->node) { |
1483 | btrfs_set_root_node(root_item, reloc_root->node); | |
1484 | free_extent_buffer(reloc_root->commit_root); | |
1485 | reloc_root->commit_root = btrfs_root_node(reloc_root); | |
1486 | } | |
1487 | ||
0b246afa | 1488 | ret = btrfs_update_root(trans, fs_info->tree_root, |
5d4f98a2 YZ |
1489 | &reloc_root->root_key, root_item); |
1490 | BUG_ON(ret); | |
7585717f CM |
1491 | |
1492 | out: | |
5d4f98a2 YZ |
1493 | return 0; |
1494 | } | |
1495 | ||
1496 | /* | |
1497 | * helper to find first cached inode with inode number >= objectid | |
1498 | * in a subvolume | |
1499 | */ | |
1500 | static struct inode *find_next_inode(struct btrfs_root *root, u64 objectid) | |
1501 | { | |
1502 | struct rb_node *node; | |
1503 | struct rb_node *prev; | |
1504 | struct btrfs_inode *entry; | |
1505 | struct inode *inode; | |
1506 | ||
1507 | spin_lock(&root->inode_lock); | |
1508 | again: | |
1509 | node = root->inode_tree.rb_node; | |
1510 | prev = NULL; | |
1511 | while (node) { | |
1512 | prev = node; | |
1513 | entry = rb_entry(node, struct btrfs_inode, rb_node); | |
1514 | ||
4a0cc7ca | 1515 | if (objectid < btrfs_ino(entry)) |
5d4f98a2 | 1516 | node = node->rb_left; |
4a0cc7ca | 1517 | else if (objectid > btrfs_ino(entry)) |
5d4f98a2 YZ |
1518 | node = node->rb_right; |
1519 | else | |
1520 | break; | |
1521 | } | |
1522 | if (!node) { | |
1523 | while (prev) { | |
1524 | entry = rb_entry(prev, struct btrfs_inode, rb_node); | |
4a0cc7ca | 1525 | if (objectid <= btrfs_ino(entry)) { |
5d4f98a2 YZ |
1526 | node = prev; |
1527 | break; | |
1528 | } | |
1529 | prev = rb_next(prev); | |
1530 | } | |
1531 | } | |
1532 | while (node) { | |
1533 | entry = rb_entry(node, struct btrfs_inode, rb_node); | |
1534 | inode = igrab(&entry->vfs_inode); | |
1535 | if (inode) { | |
1536 | spin_unlock(&root->inode_lock); | |
1537 | return inode; | |
1538 | } | |
1539 | ||
4a0cc7ca | 1540 | objectid = btrfs_ino(entry) + 1; |
5d4f98a2 YZ |
1541 | if (cond_resched_lock(&root->inode_lock)) |
1542 | goto again; | |
1543 | ||
1544 | node = rb_next(node); | |
1545 | } | |
1546 | spin_unlock(&root->inode_lock); | |
1547 | return NULL; | |
1548 | } | |
1549 | ||
1550 | static int in_block_group(u64 bytenr, | |
1551 | struct btrfs_block_group_cache *block_group) | |
1552 | { | |
1553 | if (bytenr >= block_group->key.objectid && | |
1554 | bytenr < block_group->key.objectid + block_group->key.offset) | |
1555 | return 1; | |
1556 | return 0; | |
1557 | } | |
1558 | ||
1559 | /* | |
1560 | * get new location of data | |
1561 | */ | |
1562 | static int get_new_location(struct inode *reloc_inode, u64 *new_bytenr, | |
1563 | u64 bytenr, u64 num_bytes) | |
1564 | { | |
1565 | struct btrfs_root *root = BTRFS_I(reloc_inode)->root; | |
1566 | struct btrfs_path *path; | |
1567 | struct btrfs_file_extent_item *fi; | |
1568 | struct extent_buffer *leaf; | |
1569 | int ret; | |
1570 | ||
1571 | path = btrfs_alloc_path(); | |
1572 | if (!path) | |
1573 | return -ENOMEM; | |
1574 | ||
1575 | bytenr -= BTRFS_I(reloc_inode)->index_cnt; | |
f85b7379 DS |
1576 | ret = btrfs_lookup_file_extent(NULL, root, path, |
1577 | btrfs_ino(BTRFS_I(reloc_inode)), bytenr, 0); | |
5d4f98a2 YZ |
1578 | if (ret < 0) |
1579 | goto out; | |
1580 | if (ret > 0) { | |
1581 | ret = -ENOENT; | |
1582 | goto out; | |
1583 | } | |
1584 | ||
1585 | leaf = path->nodes[0]; | |
1586 | fi = btrfs_item_ptr(leaf, path->slots[0], | |
1587 | struct btrfs_file_extent_item); | |
1588 | ||
1589 | BUG_ON(btrfs_file_extent_offset(leaf, fi) || | |
1590 | btrfs_file_extent_compression(leaf, fi) || | |
1591 | btrfs_file_extent_encryption(leaf, fi) || | |
1592 | btrfs_file_extent_other_encoding(leaf, fi)); | |
1593 | ||
1594 | if (num_bytes != btrfs_file_extent_disk_num_bytes(leaf, fi)) { | |
83d4cfd4 | 1595 | ret = -EINVAL; |
5d4f98a2 YZ |
1596 | goto out; |
1597 | } | |
1598 | ||
3fd0a558 | 1599 | *new_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); |
5d4f98a2 YZ |
1600 | ret = 0; |
1601 | out: | |
1602 | btrfs_free_path(path); | |
1603 | return ret; | |
1604 | } | |
1605 | ||
1606 | /* | |
1607 | * update file extent items in the tree leaf to point to | |
1608 | * the new locations. | |
1609 | */ | |
3fd0a558 YZ |
1610 | static noinline_for_stack |
1611 | int replace_file_extents(struct btrfs_trans_handle *trans, | |
1612 | struct reloc_control *rc, | |
1613 | struct btrfs_root *root, | |
1614 | struct extent_buffer *leaf) | |
5d4f98a2 | 1615 | { |
0b246afa | 1616 | struct btrfs_fs_info *fs_info = root->fs_info; |
5d4f98a2 YZ |
1617 | struct btrfs_key key; |
1618 | struct btrfs_file_extent_item *fi; | |
1619 | struct inode *inode = NULL; | |
5d4f98a2 YZ |
1620 | u64 parent; |
1621 | u64 bytenr; | |
3fd0a558 | 1622 | u64 new_bytenr = 0; |
5d4f98a2 YZ |
1623 | u64 num_bytes; |
1624 | u64 end; | |
1625 | u32 nritems; | |
1626 | u32 i; | |
83d4cfd4 | 1627 | int ret = 0; |
5d4f98a2 YZ |
1628 | int first = 1; |
1629 | int dirty = 0; | |
1630 | ||
1631 | if (rc->stage != UPDATE_DATA_PTRS) | |
1632 | return 0; | |
1633 | ||
1634 | /* reloc trees always use full backref */ | |
1635 | if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) | |
1636 | parent = leaf->start; | |
1637 | else | |
1638 | parent = 0; | |
1639 | ||
1640 | nritems = btrfs_header_nritems(leaf); | |
1641 | for (i = 0; i < nritems; i++) { | |
1642 | cond_resched(); | |
1643 | btrfs_item_key_to_cpu(leaf, &key, i); | |
1644 | if (key.type != BTRFS_EXTENT_DATA_KEY) | |
1645 | continue; | |
1646 | fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); | |
1647 | if (btrfs_file_extent_type(leaf, fi) == | |
1648 | BTRFS_FILE_EXTENT_INLINE) | |
1649 | continue; | |
1650 | bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); | |
1651 | num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); | |
1652 | if (bytenr == 0) | |
1653 | continue; | |
1654 | if (!in_block_group(bytenr, rc->block_group)) | |
1655 | continue; | |
1656 | ||
1657 | /* | |
1658 | * if we are modifying block in fs tree, wait for readpage | |
1659 | * to complete and drop the extent cache | |
1660 | */ | |
1661 | if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { | |
5d4f98a2 YZ |
1662 | if (first) { |
1663 | inode = find_next_inode(root, key.objectid); | |
5d4f98a2 | 1664 | first = 0; |
4a0cc7ca | 1665 | } else if (inode && btrfs_ino(BTRFS_I(inode)) < key.objectid) { |
3fd0a558 | 1666 | btrfs_add_delayed_iput(inode); |
5d4f98a2 | 1667 | inode = find_next_inode(root, key.objectid); |
5d4f98a2 | 1668 | } |
4a0cc7ca | 1669 | if (inode && btrfs_ino(BTRFS_I(inode)) == key.objectid) { |
5d4f98a2 YZ |
1670 | end = key.offset + |
1671 | btrfs_file_extent_num_bytes(leaf, fi); | |
1672 | WARN_ON(!IS_ALIGNED(key.offset, | |
0b246afa JM |
1673 | fs_info->sectorsize)); |
1674 | WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); | |
5d4f98a2 YZ |
1675 | end--; |
1676 | ret = try_lock_extent(&BTRFS_I(inode)->io_tree, | |
d0082371 | 1677 | key.offset, end); |
5d4f98a2 YZ |
1678 | if (!ret) |
1679 | continue; | |
1680 | ||
dcdbc059 NB |
1681 | btrfs_drop_extent_cache(BTRFS_I(inode), |
1682 | key.offset, end, 1); | |
5d4f98a2 | 1683 | unlock_extent(&BTRFS_I(inode)->io_tree, |
d0082371 | 1684 | key.offset, end); |
5d4f98a2 YZ |
1685 | } |
1686 | } | |
1687 | ||
1688 | ret = get_new_location(rc->data_inode, &new_bytenr, | |
1689 | bytenr, num_bytes); | |
83d4cfd4 JB |
1690 | if (ret) { |
1691 | /* | |
1692 | * Don't have to abort since we've not changed anything | |
1693 | * in the file extent yet. | |
1694 | */ | |
1695 | break; | |
3fd0a558 | 1696 | } |
5d4f98a2 YZ |
1697 | |
1698 | btrfs_set_file_extent_disk_bytenr(leaf, fi, new_bytenr); | |
1699 | dirty = 1; | |
1700 | ||
1701 | key.offset -= btrfs_file_extent_offset(leaf, fi); | |
84f7d8e6 | 1702 | ret = btrfs_inc_extent_ref(trans, root, new_bytenr, |
5d4f98a2 YZ |
1703 | num_bytes, parent, |
1704 | btrfs_header_owner(leaf), | |
b06c4bf5 | 1705 | key.objectid, key.offset); |
83d4cfd4 | 1706 | if (ret) { |
66642832 | 1707 | btrfs_abort_transaction(trans, ret); |
83d4cfd4 JB |
1708 | break; |
1709 | } | |
5d4f98a2 | 1710 | |
84f7d8e6 | 1711 | ret = btrfs_free_extent(trans, root, bytenr, num_bytes, |
5d4f98a2 | 1712 | parent, btrfs_header_owner(leaf), |
b06c4bf5 | 1713 | key.objectid, key.offset); |
83d4cfd4 | 1714 | if (ret) { |
66642832 | 1715 | btrfs_abort_transaction(trans, ret); |
83d4cfd4 JB |
1716 | break; |
1717 | } | |
5d4f98a2 YZ |
1718 | } |
1719 | if (dirty) | |
1720 | btrfs_mark_buffer_dirty(leaf); | |
3fd0a558 YZ |
1721 | if (inode) |
1722 | btrfs_add_delayed_iput(inode); | |
83d4cfd4 | 1723 | return ret; |
5d4f98a2 YZ |
1724 | } |
1725 | ||
1726 | static noinline_for_stack | |
1727 | int memcmp_node_keys(struct extent_buffer *eb, int slot, | |
1728 | struct btrfs_path *path, int level) | |
1729 | { | |
1730 | struct btrfs_disk_key key1; | |
1731 | struct btrfs_disk_key key2; | |
1732 | btrfs_node_key(eb, &key1, slot); | |
1733 | btrfs_node_key(path->nodes[level], &key2, path->slots[level]); | |
1734 | return memcmp(&key1, &key2, sizeof(key1)); | |
1735 | } | |
1736 | ||
1737 | /* | |
1738 | * try to replace tree blocks in fs tree with the new blocks | |
1739 | * in reloc tree. tree blocks haven't been modified since the | |
1740 | * reloc tree was create can be replaced. | |
1741 | * | |
1742 | * if a block was replaced, level of the block + 1 is returned. | |
1743 | * if no block got replaced, 0 is returned. if there are other | |
1744 | * errors, a negative error number is returned. | |
1745 | */ | |
3fd0a558 | 1746 | static noinline_for_stack |
3d0174f7 | 1747 | int replace_path(struct btrfs_trans_handle *trans, struct reloc_control *rc, |
3fd0a558 YZ |
1748 | struct btrfs_root *dest, struct btrfs_root *src, |
1749 | struct btrfs_path *path, struct btrfs_key *next_key, | |
1750 | int lowest_level, int max_level) | |
5d4f98a2 | 1751 | { |
0b246afa | 1752 | struct btrfs_fs_info *fs_info = dest->fs_info; |
5d4f98a2 YZ |
1753 | struct extent_buffer *eb; |
1754 | struct extent_buffer *parent; | |
1755 | struct btrfs_key key; | |
1756 | u64 old_bytenr; | |
1757 | u64 new_bytenr; | |
1758 | u64 old_ptr_gen; | |
1759 | u64 new_ptr_gen; | |
1760 | u64 last_snapshot; | |
1761 | u32 blocksize; | |
3fd0a558 | 1762 | int cow = 0; |
5d4f98a2 YZ |
1763 | int level; |
1764 | int ret; | |
1765 | int slot; | |
1766 | ||
1767 | BUG_ON(src->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); | |
1768 | BUG_ON(dest->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID); | |
5d4f98a2 YZ |
1769 | |
1770 | last_snapshot = btrfs_root_last_snapshot(&src->root_item); | |
3fd0a558 | 1771 | again: |
5d4f98a2 YZ |
1772 | slot = path->slots[lowest_level]; |
1773 | btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); | |
1774 | ||
1775 | eb = btrfs_lock_root_node(dest); | |
1776 | btrfs_set_lock_blocking(eb); | |
1777 | level = btrfs_header_level(eb); | |
1778 | ||
1779 | if (level < lowest_level) { | |
1780 | btrfs_tree_unlock(eb); | |
1781 | free_extent_buffer(eb); | |
1782 | return 0; | |
1783 | } | |
1784 | ||
3fd0a558 YZ |
1785 | if (cow) { |
1786 | ret = btrfs_cow_block(trans, dest, eb, NULL, 0, &eb); | |
1787 | BUG_ON(ret); | |
1788 | } | |
5d4f98a2 YZ |
1789 | btrfs_set_lock_blocking(eb); |
1790 | ||
1791 | if (next_key) { | |
1792 | next_key->objectid = (u64)-1; | |
1793 | next_key->type = (u8)-1; | |
1794 | next_key->offset = (u64)-1; | |
1795 | } | |
1796 | ||
1797 | parent = eb; | |
1798 | while (1) { | |
581c1760 QW |
1799 | struct btrfs_key first_key; |
1800 | ||
5d4f98a2 YZ |
1801 | level = btrfs_header_level(parent); |
1802 | BUG_ON(level < lowest_level); | |
1803 | ||
1804 | ret = btrfs_bin_search(parent, &key, level, &slot); | |
1805 | if (ret && slot > 0) | |
1806 | slot--; | |
1807 | ||
1808 | if (next_key && slot + 1 < btrfs_header_nritems(parent)) | |
1809 | btrfs_node_key_to_cpu(parent, next_key, slot + 1); | |
1810 | ||
1811 | old_bytenr = btrfs_node_blockptr(parent, slot); | |
0b246afa | 1812 | blocksize = fs_info->nodesize; |
5d4f98a2 | 1813 | old_ptr_gen = btrfs_node_ptr_generation(parent, slot); |
17515f1b | 1814 | btrfs_node_key_to_cpu(parent, &first_key, slot); |
5d4f98a2 YZ |
1815 | |
1816 | if (level <= max_level) { | |
1817 | eb = path->nodes[level]; | |
1818 | new_bytenr = btrfs_node_blockptr(eb, | |
1819 | path->slots[level]); | |
1820 | new_ptr_gen = btrfs_node_ptr_generation(eb, | |
1821 | path->slots[level]); | |
1822 | } else { | |
1823 | new_bytenr = 0; | |
1824 | new_ptr_gen = 0; | |
1825 | } | |
1826 | ||
fae7f21c | 1827 | if (WARN_ON(new_bytenr > 0 && new_bytenr == old_bytenr)) { |
5d4f98a2 YZ |
1828 | ret = level; |
1829 | break; | |
1830 | } | |
1831 | ||
1832 | if (new_bytenr == 0 || old_ptr_gen > last_snapshot || | |
1833 | memcmp_node_keys(parent, slot, path, level)) { | |
3fd0a558 | 1834 | if (level <= lowest_level) { |
5d4f98a2 YZ |
1835 | ret = 0; |
1836 | break; | |
1837 | } | |
1838 | ||
581c1760 QW |
1839 | eb = read_tree_block(fs_info, old_bytenr, old_ptr_gen, |
1840 | level - 1, &first_key); | |
64c043de LB |
1841 | if (IS_ERR(eb)) { |
1842 | ret = PTR_ERR(eb); | |
264813ac | 1843 | break; |
64c043de LB |
1844 | } else if (!extent_buffer_uptodate(eb)) { |
1845 | ret = -EIO; | |
416bc658 | 1846 | free_extent_buffer(eb); |
379cde74 | 1847 | break; |
416bc658 | 1848 | } |
5d4f98a2 | 1849 | btrfs_tree_lock(eb); |
3fd0a558 YZ |
1850 | if (cow) { |
1851 | ret = btrfs_cow_block(trans, dest, eb, parent, | |
1852 | slot, &eb); | |
1853 | BUG_ON(ret); | |
5d4f98a2 | 1854 | } |
3fd0a558 | 1855 | btrfs_set_lock_blocking(eb); |
5d4f98a2 YZ |
1856 | |
1857 | btrfs_tree_unlock(parent); | |
1858 | free_extent_buffer(parent); | |
1859 | ||
1860 | parent = eb; | |
1861 | continue; | |
1862 | } | |
1863 | ||
3fd0a558 YZ |
1864 | if (!cow) { |
1865 | btrfs_tree_unlock(parent); | |
1866 | free_extent_buffer(parent); | |
1867 | cow = 1; | |
1868 | goto again; | |
1869 | } | |
1870 | ||
5d4f98a2 YZ |
1871 | btrfs_node_key_to_cpu(path->nodes[level], &key, |
1872 | path->slots[level]); | |
b3b4aa74 | 1873 | btrfs_release_path(path); |
5d4f98a2 YZ |
1874 | |
1875 | path->lowest_level = level; | |
1876 | ret = btrfs_search_slot(trans, src, &key, path, 0, 1); | |
1877 | path->lowest_level = 0; | |
1878 | BUG_ON(ret); | |
1879 | ||
824d8dff QW |
1880 | /* |
1881 | * Info qgroup to trace both subtrees. | |
1882 | * | |
1883 | * We must trace both trees. | |
1884 | * 1) Tree reloc subtree | |
1885 | * If not traced, we will leak data numbers | |
1886 | * 2) Fs subtree | |
1887 | * If not traced, we will double count old data | |
1888 | * and tree block numbers, if current trans doesn't free | |
1889 | * data reloc tree inode. | |
1890 | */ | |
3d0174f7 QW |
1891 | ret = btrfs_qgroup_trace_subtree_swap(trans, rc->block_group, |
1892 | parent, slot, path->nodes[level], | |
1893 | path->slots[level], last_snapshot); | |
824d8dff QW |
1894 | if (ret < 0) |
1895 | break; | |
1896 | ||
5d4f98a2 YZ |
1897 | /* |
1898 | * swap blocks in fs tree and reloc tree. | |
1899 | */ | |
1900 | btrfs_set_node_blockptr(parent, slot, new_bytenr); | |
1901 | btrfs_set_node_ptr_generation(parent, slot, new_ptr_gen); | |
1902 | btrfs_mark_buffer_dirty(parent); | |
1903 | ||
1904 | btrfs_set_node_blockptr(path->nodes[level], | |
1905 | path->slots[level], old_bytenr); | |
1906 | btrfs_set_node_ptr_generation(path->nodes[level], | |
1907 | path->slots[level], old_ptr_gen); | |
1908 | btrfs_mark_buffer_dirty(path->nodes[level]); | |
1909 | ||
84f7d8e6 | 1910 | ret = btrfs_inc_extent_ref(trans, src, old_bytenr, |
2ff7e61e | 1911 | blocksize, path->nodes[level]->start, |
b06c4bf5 | 1912 | src->root_key.objectid, level - 1, 0); |
5d4f98a2 | 1913 | BUG_ON(ret); |
84f7d8e6 | 1914 | ret = btrfs_inc_extent_ref(trans, dest, new_bytenr, |
2ff7e61e JM |
1915 | blocksize, 0, dest->root_key.objectid, |
1916 | level - 1, 0); | |
5d4f98a2 YZ |
1917 | BUG_ON(ret); |
1918 | ||
84f7d8e6 | 1919 | ret = btrfs_free_extent(trans, src, new_bytenr, blocksize, |
5d4f98a2 | 1920 | path->nodes[level]->start, |
b06c4bf5 | 1921 | src->root_key.objectid, level - 1, 0); |
5d4f98a2 YZ |
1922 | BUG_ON(ret); |
1923 | ||
84f7d8e6 | 1924 | ret = btrfs_free_extent(trans, dest, old_bytenr, blocksize, |
5d4f98a2 | 1925 | 0, dest->root_key.objectid, level - 1, |
b06c4bf5 | 1926 | 0); |
5d4f98a2 YZ |
1927 | BUG_ON(ret); |
1928 | ||
1929 | btrfs_unlock_up_safe(path, 0); | |
1930 | ||
1931 | ret = level; | |
1932 | break; | |
1933 | } | |
1934 | btrfs_tree_unlock(parent); | |
1935 | free_extent_buffer(parent); | |
1936 | return ret; | |
1937 | } | |
1938 | ||
1939 | /* | |
1940 | * helper to find next relocated block in reloc tree | |
1941 | */ | |
1942 | static noinline_for_stack | |
1943 | int walk_up_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, | |
1944 | int *level) | |
1945 | { | |
1946 | struct extent_buffer *eb; | |
1947 | int i; | |
1948 | u64 last_snapshot; | |
1949 | u32 nritems; | |
1950 | ||
1951 | last_snapshot = btrfs_root_last_snapshot(&root->root_item); | |
1952 | ||
1953 | for (i = 0; i < *level; i++) { | |
1954 | free_extent_buffer(path->nodes[i]); | |
1955 | path->nodes[i] = NULL; | |
1956 | } | |
1957 | ||
1958 | for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { | |
1959 | eb = path->nodes[i]; | |
1960 | nritems = btrfs_header_nritems(eb); | |
1961 | while (path->slots[i] + 1 < nritems) { | |
1962 | path->slots[i]++; | |
1963 | if (btrfs_node_ptr_generation(eb, path->slots[i]) <= | |
1964 | last_snapshot) | |
1965 | continue; | |
1966 | ||
1967 | *level = i; | |
1968 | return 0; | |
1969 | } | |
1970 | free_extent_buffer(path->nodes[i]); | |
1971 | path->nodes[i] = NULL; | |
1972 | } | |
1973 | return 1; | |
1974 | } | |
1975 | ||
1976 | /* | |
1977 | * walk down reloc tree to find relocated block of lowest level | |
1978 | */ | |
1979 | static noinline_for_stack | |
1980 | int walk_down_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, | |
1981 | int *level) | |
1982 | { | |
2ff7e61e | 1983 | struct btrfs_fs_info *fs_info = root->fs_info; |
5d4f98a2 YZ |
1984 | struct extent_buffer *eb = NULL; |
1985 | int i; | |
1986 | u64 bytenr; | |
1987 | u64 ptr_gen = 0; | |
1988 | u64 last_snapshot; | |
5d4f98a2 YZ |
1989 | u32 nritems; |
1990 | ||
1991 | last_snapshot = btrfs_root_last_snapshot(&root->root_item); | |
1992 | ||
1993 | for (i = *level; i > 0; i--) { | |
581c1760 QW |
1994 | struct btrfs_key first_key; |
1995 | ||
5d4f98a2 YZ |
1996 | eb = path->nodes[i]; |
1997 | nritems = btrfs_header_nritems(eb); | |
1998 | while (path->slots[i] < nritems) { | |
1999 | ptr_gen = btrfs_node_ptr_generation(eb, path->slots[i]); | |
2000 | if (ptr_gen > last_snapshot) | |
2001 | break; | |
2002 | path->slots[i]++; | |
2003 | } | |
2004 | if (path->slots[i] >= nritems) { | |
2005 | if (i == *level) | |
2006 | break; | |
2007 | *level = i + 1; | |
2008 | return 0; | |
2009 | } | |
2010 | if (i == 1) { | |
2011 | *level = i; | |
2012 | return 0; | |
2013 | } | |
2014 | ||
2015 | bytenr = btrfs_node_blockptr(eb, path->slots[i]); | |
581c1760 QW |
2016 | btrfs_node_key_to_cpu(eb, &first_key, path->slots[i]); |
2017 | eb = read_tree_block(fs_info, bytenr, ptr_gen, i - 1, | |
2018 | &first_key); | |
64c043de LB |
2019 | if (IS_ERR(eb)) { |
2020 | return PTR_ERR(eb); | |
2021 | } else if (!extent_buffer_uptodate(eb)) { | |
416bc658 JB |
2022 | free_extent_buffer(eb); |
2023 | return -EIO; | |
2024 | } | |
5d4f98a2 YZ |
2025 | BUG_ON(btrfs_header_level(eb) != i - 1); |
2026 | path->nodes[i - 1] = eb; | |
2027 | path->slots[i - 1] = 0; | |
2028 | } | |
2029 | return 1; | |
2030 | } | |
2031 | ||
2032 | /* | |
2033 | * invalidate extent cache for file extents whose key in range of | |
2034 | * [min_key, max_key) | |
2035 | */ | |
2036 | static int invalidate_extent_cache(struct btrfs_root *root, | |
2037 | struct btrfs_key *min_key, | |
2038 | struct btrfs_key *max_key) | |
2039 | { | |
0b246afa | 2040 | struct btrfs_fs_info *fs_info = root->fs_info; |
5d4f98a2 YZ |
2041 | struct inode *inode = NULL; |
2042 | u64 objectid; | |
2043 | u64 start, end; | |
33345d01 | 2044 | u64 ino; |
5d4f98a2 YZ |
2045 | |
2046 | objectid = min_key->objectid; | |
2047 | while (1) { | |
2048 | cond_resched(); | |
2049 | iput(inode); | |
2050 | ||
2051 | if (objectid > max_key->objectid) | |
2052 | break; | |
2053 | ||
2054 | inode = find_next_inode(root, objectid); | |
2055 | if (!inode) | |
2056 | break; | |
4a0cc7ca | 2057 | ino = btrfs_ino(BTRFS_I(inode)); |
5d4f98a2 | 2058 | |
33345d01 | 2059 | if (ino > max_key->objectid) { |
5d4f98a2 YZ |
2060 | iput(inode); |
2061 | break; | |
2062 | } | |
2063 | ||
33345d01 | 2064 | objectid = ino + 1; |
5d4f98a2 YZ |
2065 | if (!S_ISREG(inode->i_mode)) |
2066 | continue; | |
2067 | ||
33345d01 | 2068 | if (unlikely(min_key->objectid == ino)) { |
5d4f98a2 YZ |
2069 | if (min_key->type > BTRFS_EXTENT_DATA_KEY) |
2070 | continue; | |
2071 | if (min_key->type < BTRFS_EXTENT_DATA_KEY) | |
2072 | start = 0; | |
2073 | else { | |
2074 | start = min_key->offset; | |
0b246afa | 2075 | WARN_ON(!IS_ALIGNED(start, fs_info->sectorsize)); |
5d4f98a2 YZ |
2076 | } |
2077 | } else { | |
2078 | start = 0; | |
2079 | } | |
2080 | ||
33345d01 | 2081 | if (unlikely(max_key->objectid == ino)) { |
5d4f98a2 YZ |
2082 | if (max_key->type < BTRFS_EXTENT_DATA_KEY) |
2083 | continue; | |
2084 | if (max_key->type > BTRFS_EXTENT_DATA_KEY) { | |
2085 | end = (u64)-1; | |
2086 | } else { | |
2087 | if (max_key->offset == 0) | |
2088 | continue; | |
2089 | end = max_key->offset; | |
0b246afa | 2090 | WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); |
5d4f98a2 YZ |
2091 | end--; |
2092 | } | |
2093 | } else { | |
2094 | end = (u64)-1; | |
2095 | } | |
2096 | ||
2097 | /* the lock_extent waits for readpage to complete */ | |
d0082371 | 2098 | lock_extent(&BTRFS_I(inode)->io_tree, start, end); |
dcdbc059 | 2099 | btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 1); |
d0082371 | 2100 | unlock_extent(&BTRFS_I(inode)->io_tree, start, end); |
5d4f98a2 YZ |
2101 | } |
2102 | return 0; | |
2103 | } | |
2104 | ||
2105 | static int find_next_key(struct btrfs_path *path, int level, | |
2106 | struct btrfs_key *key) | |
2107 | ||
2108 | { | |
2109 | while (level < BTRFS_MAX_LEVEL) { | |
2110 | if (!path->nodes[level]) | |
2111 | break; | |
2112 | if (path->slots[level] + 1 < | |
2113 | btrfs_header_nritems(path->nodes[level])) { | |
2114 | btrfs_node_key_to_cpu(path->nodes[level], key, | |
2115 | path->slots[level] + 1); | |
2116 | return 0; | |
2117 | } | |
2118 | level++; | |
2119 | } | |
2120 | return 1; | |
2121 | } | |
2122 | ||
2123 | /* | |
2124 | * merge the relocated tree blocks in reloc tree with corresponding | |
2125 | * fs tree. | |
2126 | */ | |
2127 | static noinline_for_stack int merge_reloc_root(struct reloc_control *rc, | |
2128 | struct btrfs_root *root) | |
2129 | { | |
0b246afa | 2130 | struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; |
5d4f98a2 YZ |
2131 | struct btrfs_key key; |
2132 | struct btrfs_key next_key; | |
9e6a0c52 | 2133 | struct btrfs_trans_handle *trans = NULL; |
5d4f98a2 YZ |
2134 | struct btrfs_root *reloc_root; |
2135 | struct btrfs_root_item *root_item; | |
2136 | struct btrfs_path *path; | |
3fd0a558 | 2137 | struct extent_buffer *leaf; |
5d4f98a2 YZ |
2138 | int level; |
2139 | int max_level; | |
2140 | int replaced = 0; | |
2141 | int ret; | |
2142 | int err = 0; | |
3fd0a558 | 2143 | u32 min_reserved; |
5d4f98a2 YZ |
2144 | |
2145 | path = btrfs_alloc_path(); | |
2146 | if (!path) | |
2147 | return -ENOMEM; | |
e4058b54 | 2148 | path->reada = READA_FORWARD; |
5d4f98a2 YZ |
2149 | |
2150 | reloc_root = root->reloc_root; | |
2151 | root_item = &reloc_root->root_item; | |
2152 | ||
2153 | if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { | |
2154 | level = btrfs_root_level(root_item); | |
2155 | extent_buffer_get(reloc_root->node); | |
2156 | path->nodes[level] = reloc_root->node; | |
2157 | path->slots[level] = 0; | |
2158 | } else { | |
2159 | btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); | |
2160 | ||
2161 | level = root_item->drop_level; | |
2162 | BUG_ON(level == 0); | |
2163 | path->lowest_level = level; | |
2164 | ret = btrfs_search_slot(NULL, reloc_root, &key, path, 0, 0); | |
33c66f43 | 2165 | path->lowest_level = 0; |
5d4f98a2 YZ |
2166 | if (ret < 0) { |
2167 | btrfs_free_path(path); | |
2168 | return ret; | |
2169 | } | |
2170 | ||
2171 | btrfs_node_key_to_cpu(path->nodes[level], &next_key, | |
2172 | path->slots[level]); | |
2173 | WARN_ON(memcmp(&key, &next_key, sizeof(key))); | |
2174 | ||
2175 | btrfs_unlock_up_safe(path, 0); | |
2176 | } | |
2177 | ||
0b246afa | 2178 | min_reserved = fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; |
3fd0a558 | 2179 | memset(&next_key, 0, sizeof(next_key)); |
5d4f98a2 | 2180 | |
3fd0a558 | 2181 | while (1) { |
08e007d2 MX |
2182 | ret = btrfs_block_rsv_refill(root, rc->block_rsv, min_reserved, |
2183 | BTRFS_RESERVE_FLUSH_ALL); | |
3fd0a558 | 2184 | if (ret) { |
9e6a0c52 JB |
2185 | err = ret; |
2186 | goto out; | |
5d4f98a2 | 2187 | } |
9e6a0c52 JB |
2188 | trans = btrfs_start_transaction(root, 0); |
2189 | if (IS_ERR(trans)) { | |
2190 | err = PTR_ERR(trans); | |
2191 | trans = NULL; | |
2192 | goto out; | |
2193 | } | |
2194 | trans->block_rsv = rc->block_rsv; | |
5d4f98a2 | 2195 | |
5d4f98a2 | 2196 | replaced = 0; |
5d4f98a2 YZ |
2197 | max_level = level; |
2198 | ||
2199 | ret = walk_down_reloc_tree(reloc_root, path, &level); | |
2200 | if (ret < 0) { | |
2201 | err = ret; | |
2202 | goto out; | |
2203 | } | |
2204 | if (ret > 0) | |
2205 | break; | |
2206 | ||
2207 | if (!find_next_key(path, level, &key) && | |
2208 | btrfs_comp_cpu_keys(&next_key, &key) >= 0) { | |
2209 | ret = 0; | |
5d4f98a2 | 2210 | } else { |
3d0174f7 | 2211 | ret = replace_path(trans, rc, root, reloc_root, path, |
3fd0a558 | 2212 | &next_key, level, max_level); |
5d4f98a2 YZ |
2213 | } |
2214 | if (ret < 0) { | |
2215 | err = ret; | |
2216 | goto out; | |
2217 | } | |
2218 | ||
2219 | if (ret > 0) { | |
2220 | level = ret; | |
2221 | btrfs_node_key_to_cpu(path->nodes[level], &key, | |
2222 | path->slots[level]); | |
2223 | replaced = 1; | |
5d4f98a2 YZ |
2224 | } |
2225 | ||
2226 | ret = walk_up_reloc_tree(reloc_root, path, &level); | |
2227 | if (ret > 0) | |
2228 | break; | |
2229 | ||
2230 | BUG_ON(level == 0); | |
2231 | /* | |
2232 | * save the merging progress in the drop_progress. | |
2233 | * this is OK since root refs == 1 in this case. | |
2234 | */ | |
2235 | btrfs_node_key(path->nodes[level], &root_item->drop_progress, | |
2236 | path->slots[level]); | |
2237 | root_item->drop_level = level; | |
2238 | ||
3a45bb20 | 2239 | btrfs_end_transaction_throttle(trans); |
9e6a0c52 | 2240 | trans = NULL; |
5d4f98a2 | 2241 | |
2ff7e61e | 2242 | btrfs_btree_balance_dirty(fs_info); |
5d4f98a2 YZ |
2243 | |
2244 | if (replaced && rc->stage == UPDATE_DATA_PTRS) | |
2245 | invalidate_extent_cache(root, &key, &next_key); | |
2246 | } | |
2247 | ||
2248 | /* | |
2249 | * handle the case only one block in the fs tree need to be | |
2250 | * relocated and the block is tree root. | |
2251 | */ | |
2252 | leaf = btrfs_lock_root_node(root); | |
2253 | ret = btrfs_cow_block(trans, root, leaf, NULL, 0, &leaf); | |
2254 | btrfs_tree_unlock(leaf); | |
2255 | free_extent_buffer(leaf); | |
2256 | if (ret < 0) | |
2257 | err = ret; | |
2258 | out: | |
2259 | btrfs_free_path(path); | |
2260 | ||
2261 | if (err == 0) { | |
2262 | memset(&root_item->drop_progress, 0, | |
2263 | sizeof(root_item->drop_progress)); | |
2264 | root_item->drop_level = 0; | |
2265 | btrfs_set_root_refs(root_item, 0); | |
3fd0a558 | 2266 | btrfs_update_reloc_root(trans, root); |
5d4f98a2 YZ |
2267 | } |
2268 | ||
9e6a0c52 | 2269 | if (trans) |
3a45bb20 | 2270 | btrfs_end_transaction_throttle(trans); |
5d4f98a2 | 2271 | |
2ff7e61e | 2272 | btrfs_btree_balance_dirty(fs_info); |
5d4f98a2 | 2273 | |
5d4f98a2 YZ |
2274 | if (replaced && rc->stage == UPDATE_DATA_PTRS) |
2275 | invalidate_extent_cache(root, &key, &next_key); | |
2276 | ||
2277 | return err; | |
2278 | } | |
2279 | ||
3fd0a558 YZ |
2280 | static noinline_for_stack |
2281 | int prepare_to_merge(struct reloc_control *rc, int err) | |
5d4f98a2 | 2282 | { |
3fd0a558 | 2283 | struct btrfs_root *root = rc->extent_root; |
0b246afa | 2284 | struct btrfs_fs_info *fs_info = root->fs_info; |
5d4f98a2 | 2285 | struct btrfs_root *reloc_root; |
3fd0a558 YZ |
2286 | struct btrfs_trans_handle *trans; |
2287 | LIST_HEAD(reloc_roots); | |
2288 | u64 num_bytes = 0; | |
2289 | int ret; | |
3fd0a558 | 2290 | |
0b246afa JM |
2291 | mutex_lock(&fs_info->reloc_mutex); |
2292 | rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; | |
3fd0a558 | 2293 | rc->merging_rsv_size += rc->nodes_relocated * 2; |
0b246afa | 2294 | mutex_unlock(&fs_info->reloc_mutex); |
7585717f | 2295 | |
3fd0a558 YZ |
2296 | again: |
2297 | if (!err) { | |
2298 | num_bytes = rc->merging_rsv_size; | |
08e007d2 MX |
2299 | ret = btrfs_block_rsv_add(root, rc->block_rsv, num_bytes, |
2300 | BTRFS_RESERVE_FLUSH_ALL); | |
3fd0a558 YZ |
2301 | if (ret) |
2302 | err = ret; | |
2303 | } | |
2304 | ||
7a7eaa40 | 2305 | trans = btrfs_join_transaction(rc->extent_root); |
3612b495 TI |
2306 | if (IS_ERR(trans)) { |
2307 | if (!err) | |
2ff7e61e JM |
2308 | btrfs_block_rsv_release(fs_info, rc->block_rsv, |
2309 | num_bytes); | |
3612b495 TI |
2310 | return PTR_ERR(trans); |
2311 | } | |
3fd0a558 YZ |
2312 | |
2313 | if (!err) { | |
2314 | if (num_bytes != rc->merging_rsv_size) { | |
3a45bb20 | 2315 | btrfs_end_transaction(trans); |
2ff7e61e JM |
2316 | btrfs_block_rsv_release(fs_info, rc->block_rsv, |
2317 | num_bytes); | |
3fd0a558 YZ |
2318 | goto again; |
2319 | } | |
2320 | } | |
5d4f98a2 | 2321 | |
3fd0a558 YZ |
2322 | rc->merge_reloc_tree = 1; |
2323 | ||
2324 | while (!list_empty(&rc->reloc_roots)) { | |
2325 | reloc_root = list_entry(rc->reloc_roots.next, | |
2326 | struct btrfs_root, root_list); | |
2327 | list_del_init(&reloc_root->root_list); | |
5d4f98a2 | 2328 | |
0b246afa | 2329 | root = read_fs_root(fs_info, reloc_root->root_key.offset); |
5d4f98a2 YZ |
2330 | BUG_ON(IS_ERR(root)); |
2331 | BUG_ON(root->reloc_root != reloc_root); | |
2332 | ||
3fd0a558 YZ |
2333 | /* |
2334 | * set reference count to 1, so btrfs_recover_relocation | |
2335 | * knows it should resumes merging | |
2336 | */ | |
2337 | if (!err) | |
2338 | btrfs_set_root_refs(&reloc_root->root_item, 1); | |
5d4f98a2 | 2339 | btrfs_update_reloc_root(trans, root); |
5d4f98a2 | 2340 | |
3fd0a558 YZ |
2341 | list_add(&reloc_root->root_list, &reloc_roots); |
2342 | } | |
5d4f98a2 | 2343 | |
3fd0a558 | 2344 | list_splice(&reloc_roots, &rc->reloc_roots); |
5d4f98a2 | 2345 | |
3fd0a558 | 2346 | if (!err) |
3a45bb20 | 2347 | btrfs_commit_transaction(trans); |
3fd0a558 | 2348 | else |
3a45bb20 | 2349 | btrfs_end_transaction(trans); |
3fd0a558 | 2350 | return err; |
5d4f98a2 YZ |
2351 | } |
2352 | ||
aca1bba6 LB |
2353 | static noinline_for_stack |
2354 | void free_reloc_roots(struct list_head *list) | |
2355 | { | |
2356 | struct btrfs_root *reloc_root; | |
2357 | ||
2358 | while (!list_empty(list)) { | |
2359 | reloc_root = list_entry(list->next, struct btrfs_root, | |
2360 | root_list); | |
bb166d72 | 2361 | __del_reloc_root(reloc_root); |
6bdf131f JB |
2362 | free_extent_buffer(reloc_root->node); |
2363 | free_extent_buffer(reloc_root->commit_root); | |
2364 | reloc_root->node = NULL; | |
2365 | reloc_root->commit_root = NULL; | |
aca1bba6 LB |
2366 | } |
2367 | } | |
2368 | ||
3fd0a558 | 2369 | static noinline_for_stack |
94404e82 | 2370 | void merge_reloc_roots(struct reloc_control *rc) |
5d4f98a2 | 2371 | { |
0b246afa | 2372 | struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; |
5d4f98a2 | 2373 | struct btrfs_root *root; |
3fd0a558 YZ |
2374 | struct btrfs_root *reloc_root; |
2375 | LIST_HEAD(reloc_roots); | |
2376 | int found = 0; | |
aca1bba6 | 2377 | int ret = 0; |
3fd0a558 YZ |
2378 | again: |
2379 | root = rc->extent_root; | |
7585717f CM |
2380 | |
2381 | /* | |
2382 | * this serializes us with btrfs_record_root_in_transaction, | |
2383 | * we have to make sure nobody is in the middle of | |
2384 | * adding their roots to the list while we are | |
2385 | * doing this splice | |
2386 | */ | |
0b246afa | 2387 | mutex_lock(&fs_info->reloc_mutex); |
3fd0a558 | 2388 | list_splice_init(&rc->reloc_roots, &reloc_roots); |
0b246afa | 2389 | mutex_unlock(&fs_info->reloc_mutex); |
5d4f98a2 | 2390 | |
3fd0a558 YZ |
2391 | while (!list_empty(&reloc_roots)) { |
2392 | found = 1; | |
2393 | reloc_root = list_entry(reloc_roots.next, | |
2394 | struct btrfs_root, root_list); | |
5d4f98a2 | 2395 | |
3fd0a558 | 2396 | if (btrfs_root_refs(&reloc_root->root_item) > 0) { |
0b246afa | 2397 | root = read_fs_root(fs_info, |
3fd0a558 YZ |
2398 | reloc_root->root_key.offset); |
2399 | BUG_ON(IS_ERR(root)); | |
2400 | BUG_ON(root->reloc_root != reloc_root); | |
5d4f98a2 | 2401 | |
3fd0a558 | 2402 | ret = merge_reloc_root(rc, root); |
b37b39cd | 2403 | if (ret) { |
25e293c2 WS |
2404 | if (list_empty(&reloc_root->root_list)) |
2405 | list_add_tail(&reloc_root->root_list, | |
2406 | &reloc_roots); | |
aca1bba6 | 2407 | goto out; |
b37b39cd | 2408 | } |
3fd0a558 YZ |
2409 | } else { |
2410 | list_del_init(&reloc_root->root_list); | |
2411 | } | |
5bc7247a | 2412 | |
2c536799 | 2413 | ret = btrfs_drop_snapshot(reloc_root, rc->block_rsv, 0, 1); |
aca1bba6 LB |
2414 | if (ret < 0) { |
2415 | if (list_empty(&reloc_root->root_list)) | |
2416 | list_add_tail(&reloc_root->root_list, | |
2417 | &reloc_roots); | |
2418 | goto out; | |
2419 | } | |
5d4f98a2 YZ |
2420 | } |
2421 | ||
3fd0a558 YZ |
2422 | if (found) { |
2423 | found = 0; | |
2424 | goto again; | |
2425 | } | |
aca1bba6 LB |
2426 | out: |
2427 | if (ret) { | |
0b246afa | 2428 | btrfs_handle_fs_error(fs_info, ret, NULL); |
aca1bba6 LB |
2429 | if (!list_empty(&reloc_roots)) |
2430 | free_reloc_roots(&reloc_roots); | |
467bb1d2 WS |
2431 | |
2432 | /* new reloc root may be added */ | |
0b246afa | 2433 | mutex_lock(&fs_info->reloc_mutex); |
467bb1d2 | 2434 | list_splice_init(&rc->reloc_roots, &reloc_roots); |
0b246afa | 2435 | mutex_unlock(&fs_info->reloc_mutex); |
467bb1d2 WS |
2436 | if (!list_empty(&reloc_roots)) |
2437 | free_reloc_roots(&reloc_roots); | |
aca1bba6 LB |
2438 | } |
2439 | ||
5d4f98a2 | 2440 | BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root)); |
5d4f98a2 YZ |
2441 | } |
2442 | ||
2443 | static void free_block_list(struct rb_root *blocks) | |
2444 | { | |
2445 | struct tree_block *block; | |
2446 | struct rb_node *rb_node; | |
2447 | while ((rb_node = rb_first(blocks))) { | |
2448 | block = rb_entry(rb_node, struct tree_block, rb_node); | |
2449 | rb_erase(rb_node, blocks); | |
2450 | kfree(block); | |
2451 | } | |
2452 | } | |
2453 | ||
2454 | static int record_reloc_root_in_trans(struct btrfs_trans_handle *trans, | |
2455 | struct btrfs_root *reloc_root) | |
2456 | { | |
0b246afa | 2457 | struct btrfs_fs_info *fs_info = reloc_root->fs_info; |
5d4f98a2 YZ |
2458 | struct btrfs_root *root; |
2459 | ||
2460 | if (reloc_root->last_trans == trans->transid) | |
2461 | return 0; | |
2462 | ||
0b246afa | 2463 | root = read_fs_root(fs_info, reloc_root->root_key.offset); |
5d4f98a2 YZ |
2464 | BUG_ON(IS_ERR(root)); |
2465 | BUG_ON(root->reloc_root != reloc_root); | |
2466 | ||
2467 | return btrfs_record_root_in_trans(trans, root); | |
2468 | } | |
2469 | ||
3fd0a558 YZ |
2470 | static noinline_for_stack |
2471 | struct btrfs_root *select_reloc_root(struct btrfs_trans_handle *trans, | |
2472 | struct reloc_control *rc, | |
2473 | struct backref_node *node, | |
dc4103f9 | 2474 | struct backref_edge *edges[]) |
5d4f98a2 YZ |
2475 | { |
2476 | struct backref_node *next; | |
2477 | struct btrfs_root *root; | |
3fd0a558 YZ |
2478 | int index = 0; |
2479 | ||
5d4f98a2 YZ |
2480 | next = node; |
2481 | while (1) { | |
2482 | cond_resched(); | |
2483 | next = walk_up_backref(next, edges, &index); | |
2484 | root = next->root; | |
3fd0a558 | 2485 | BUG_ON(!root); |
27cdeb70 | 2486 | BUG_ON(!test_bit(BTRFS_ROOT_REF_COWS, &root->state)); |
5d4f98a2 YZ |
2487 | |
2488 | if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { | |
2489 | record_reloc_root_in_trans(trans, root); | |
2490 | break; | |
2491 | } | |
2492 | ||
3fd0a558 YZ |
2493 | btrfs_record_root_in_trans(trans, root); |
2494 | root = root->reloc_root; | |
2495 | ||
2496 | if (next->new_bytenr != root->node->start) { | |
2497 | BUG_ON(next->new_bytenr); | |
2498 | BUG_ON(!list_empty(&next->list)); | |
2499 | next->new_bytenr = root->node->start; | |
2500 | next->root = root; | |
2501 | list_add_tail(&next->list, | |
2502 | &rc->backref_cache.changed); | |
2503 | __mark_block_processed(rc, next); | |
5d4f98a2 YZ |
2504 | break; |
2505 | } | |
2506 | ||
3fd0a558 | 2507 | WARN_ON(1); |
5d4f98a2 YZ |
2508 | root = NULL; |
2509 | next = walk_down_backref(edges, &index); | |
2510 | if (!next || next->level <= node->level) | |
2511 | break; | |
2512 | } | |
3fd0a558 YZ |
2513 | if (!root) |
2514 | return NULL; | |
5d4f98a2 | 2515 | |
3fd0a558 YZ |
2516 | next = node; |
2517 | /* setup backref node path for btrfs_reloc_cow_block */ | |
2518 | while (1) { | |
2519 | rc->backref_cache.path[next->level] = next; | |
2520 | if (--index < 0) | |
2521 | break; | |
2522 | next = edges[index]->node[UPPER]; | |
5d4f98a2 | 2523 | } |
5d4f98a2 YZ |
2524 | return root; |
2525 | } | |
2526 | ||
3fd0a558 YZ |
2527 | /* |
2528 | * select a tree root for relocation. return NULL if the block | |
2529 | * is reference counted. we should use do_relocation() in this | |
2530 | * case. return a tree root pointer if the block isn't reference | |
2531 | * counted. return -ENOENT if the block is root of reloc tree. | |
2532 | */ | |
5d4f98a2 | 2533 | static noinline_for_stack |
147d256e | 2534 | struct btrfs_root *select_one_root(struct backref_node *node) |
5d4f98a2 | 2535 | { |
3fd0a558 YZ |
2536 | struct backref_node *next; |
2537 | struct btrfs_root *root; | |
2538 | struct btrfs_root *fs_root = NULL; | |
5d4f98a2 | 2539 | struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; |
3fd0a558 YZ |
2540 | int index = 0; |
2541 | ||
2542 | next = node; | |
2543 | while (1) { | |
2544 | cond_resched(); | |
2545 | next = walk_up_backref(next, edges, &index); | |
2546 | root = next->root; | |
2547 | BUG_ON(!root); | |
2548 | ||
25985edc | 2549 | /* no other choice for non-references counted tree */ |
27cdeb70 | 2550 | if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) |
3fd0a558 YZ |
2551 | return root; |
2552 | ||
2553 | if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) | |
2554 | fs_root = root; | |
2555 | ||
2556 | if (next != node) | |
2557 | return NULL; | |
2558 | ||
2559 | next = walk_down_backref(edges, &index); | |
2560 | if (!next || next->level <= node->level) | |
2561 | break; | |
2562 | } | |
2563 | ||
2564 | if (!fs_root) | |
2565 | return ERR_PTR(-ENOENT); | |
2566 | return fs_root; | |
5d4f98a2 YZ |
2567 | } |
2568 | ||
2569 | static noinline_for_stack | |
3fd0a558 YZ |
2570 | u64 calcu_metadata_size(struct reloc_control *rc, |
2571 | struct backref_node *node, int reserve) | |
5d4f98a2 | 2572 | { |
0b246afa | 2573 | struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; |
3fd0a558 YZ |
2574 | struct backref_node *next = node; |
2575 | struct backref_edge *edge; | |
2576 | struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; | |
2577 | u64 num_bytes = 0; | |
2578 | int index = 0; | |
2579 | ||
2580 | BUG_ON(reserve && node->processed); | |
2581 | ||
2582 | while (next) { | |
2583 | cond_resched(); | |
2584 | while (1) { | |
2585 | if (next->processed && (reserve || next != node)) | |
2586 | break; | |
2587 | ||
0b246afa | 2588 | num_bytes += fs_info->nodesize; |
3fd0a558 YZ |
2589 | |
2590 | if (list_empty(&next->upper)) | |
2591 | break; | |
2592 | ||
2593 | edge = list_entry(next->upper.next, | |
2594 | struct backref_edge, list[LOWER]); | |
2595 | edges[index++] = edge; | |
2596 | next = edge->node[UPPER]; | |
2597 | } | |
2598 | next = walk_down_backref(edges, &index); | |
2599 | } | |
2600 | return num_bytes; | |
5d4f98a2 YZ |
2601 | } |
2602 | ||
3fd0a558 YZ |
2603 | static int reserve_metadata_space(struct btrfs_trans_handle *trans, |
2604 | struct reloc_control *rc, | |
2605 | struct backref_node *node) | |
5d4f98a2 | 2606 | { |
3fd0a558 | 2607 | struct btrfs_root *root = rc->extent_root; |
da17066c | 2608 | struct btrfs_fs_info *fs_info = root->fs_info; |
3fd0a558 YZ |
2609 | u64 num_bytes; |
2610 | int ret; | |
0647bf56 | 2611 | u64 tmp; |
3fd0a558 YZ |
2612 | |
2613 | num_bytes = calcu_metadata_size(rc, node, 1) * 2; | |
5d4f98a2 | 2614 | |
3fd0a558 | 2615 | trans->block_rsv = rc->block_rsv; |
0647bf56 | 2616 | rc->reserved_bytes += num_bytes; |
8ca17f0f JB |
2617 | |
2618 | /* | |
2619 | * We are under a transaction here so we can only do limited flushing. | |
2620 | * If we get an enospc just kick back -EAGAIN so we know to drop the | |
2621 | * transaction and try to refill when we can flush all the things. | |
2622 | */ | |
0647bf56 | 2623 | ret = btrfs_block_rsv_refill(root, rc->block_rsv, num_bytes, |
8ca17f0f | 2624 | BTRFS_RESERVE_FLUSH_LIMIT); |
3fd0a558 | 2625 | if (ret) { |
da17066c | 2626 | tmp = fs_info->nodesize * RELOCATION_RESERVED_NODES; |
8ca17f0f JB |
2627 | while (tmp <= rc->reserved_bytes) |
2628 | tmp <<= 1; | |
2629 | /* | |
2630 | * only one thread can access block_rsv at this point, | |
2631 | * so we don't need hold lock to protect block_rsv. | |
2632 | * we expand more reservation size here to allow enough | |
52042d8e | 2633 | * space for relocation and we will return earlier in |
8ca17f0f JB |
2634 | * enospc case. |
2635 | */ | |
da17066c JM |
2636 | rc->block_rsv->size = tmp + fs_info->nodesize * |
2637 | RELOCATION_RESERVED_NODES; | |
8ca17f0f | 2638 | return -EAGAIN; |
5d4f98a2 | 2639 | } |
3fd0a558 | 2640 | |
3fd0a558 YZ |
2641 | return 0; |
2642 | } | |
2643 | ||
5d4f98a2 YZ |
2644 | /* |
2645 | * relocate a block tree, and then update pointers in upper level | |
2646 | * blocks that reference the block to point to the new location. | |
2647 | * | |
2648 | * if called by link_to_upper, the block has already been relocated. | |
2649 | * in that case this function just updates pointers. | |
2650 | */ | |
2651 | static int do_relocation(struct btrfs_trans_handle *trans, | |
3fd0a558 | 2652 | struct reloc_control *rc, |
5d4f98a2 YZ |
2653 | struct backref_node *node, |
2654 | struct btrfs_key *key, | |
2655 | struct btrfs_path *path, int lowest) | |
2656 | { | |
2ff7e61e | 2657 | struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; |
5d4f98a2 YZ |
2658 | struct backref_node *upper; |
2659 | struct backref_edge *edge; | |
2660 | struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; | |
2661 | struct btrfs_root *root; | |
2662 | struct extent_buffer *eb; | |
2663 | u32 blocksize; | |
2664 | u64 bytenr; | |
2665 | u64 generation; | |
5d4f98a2 YZ |
2666 | int slot; |
2667 | int ret; | |
2668 | int err = 0; | |
2669 | ||
2670 | BUG_ON(lowest && node->eb); | |
2671 | ||
2672 | path->lowest_level = node->level + 1; | |
3fd0a558 | 2673 | rc->backref_cache.path[node->level] = node; |
5d4f98a2 | 2674 | list_for_each_entry(edge, &node->upper, list[LOWER]) { |
581c1760 QW |
2675 | struct btrfs_key first_key; |
2676 | ||
5d4f98a2 | 2677 | cond_resched(); |
5d4f98a2 YZ |
2678 | |
2679 | upper = edge->node[UPPER]; | |
dc4103f9 | 2680 | root = select_reloc_root(trans, rc, upper, edges); |
3fd0a558 YZ |
2681 | BUG_ON(!root); |
2682 | ||
2683 | if (upper->eb && !upper->locked) { | |
2684 | if (!lowest) { | |
2685 | ret = btrfs_bin_search(upper->eb, key, | |
2686 | upper->level, &slot); | |
2687 | BUG_ON(ret); | |
2688 | bytenr = btrfs_node_blockptr(upper->eb, slot); | |
2689 | if (node->eb->start == bytenr) | |
2690 | goto next; | |
2691 | } | |
5d4f98a2 | 2692 | drop_node_buffer(upper); |
3fd0a558 | 2693 | } |
5d4f98a2 YZ |
2694 | |
2695 | if (!upper->eb) { | |
2696 | ret = btrfs_search_slot(trans, root, key, path, 0, 1); | |
3561b9db LB |
2697 | if (ret) { |
2698 | if (ret < 0) | |
2699 | err = ret; | |
2700 | else | |
2701 | err = -ENOENT; | |
2702 | ||
2703 | btrfs_release_path(path); | |
5d4f98a2 YZ |
2704 | break; |
2705 | } | |
5d4f98a2 | 2706 | |
3fd0a558 YZ |
2707 | if (!upper->eb) { |
2708 | upper->eb = path->nodes[upper->level]; | |
2709 | path->nodes[upper->level] = NULL; | |
2710 | } else { | |
2711 | BUG_ON(upper->eb != path->nodes[upper->level]); | |
2712 | } | |
5d4f98a2 | 2713 | |
3fd0a558 YZ |
2714 | upper->locked = 1; |
2715 | path->locks[upper->level] = 0; | |
5d4f98a2 | 2716 | |
3fd0a558 | 2717 | slot = path->slots[upper->level]; |
b3b4aa74 | 2718 | btrfs_release_path(path); |
5d4f98a2 YZ |
2719 | } else { |
2720 | ret = btrfs_bin_search(upper->eb, key, upper->level, | |
2721 | &slot); | |
2722 | BUG_ON(ret); | |
2723 | } | |
2724 | ||
2725 | bytenr = btrfs_node_blockptr(upper->eb, slot); | |
3fd0a558 | 2726 | if (lowest) { |
4547f4d8 LB |
2727 | if (bytenr != node->bytenr) { |
2728 | btrfs_err(root->fs_info, | |
2729 | "lowest leaf/node mismatch: bytenr %llu node->bytenr %llu slot %d upper %llu", | |
2730 | bytenr, node->bytenr, slot, | |
2731 | upper->eb->start); | |
2732 | err = -EIO; | |
2733 | goto next; | |
2734 | } | |
5d4f98a2 | 2735 | } else { |
3fd0a558 YZ |
2736 | if (node->eb->start == bytenr) |
2737 | goto next; | |
5d4f98a2 YZ |
2738 | } |
2739 | ||
da17066c | 2740 | blocksize = root->fs_info->nodesize; |
5d4f98a2 | 2741 | generation = btrfs_node_ptr_generation(upper->eb, slot); |
581c1760 QW |
2742 | btrfs_node_key_to_cpu(upper->eb, &first_key, slot); |
2743 | eb = read_tree_block(fs_info, bytenr, generation, | |
2744 | upper->level - 1, &first_key); | |
64c043de LB |
2745 | if (IS_ERR(eb)) { |
2746 | err = PTR_ERR(eb); | |
2747 | goto next; | |
2748 | } else if (!extent_buffer_uptodate(eb)) { | |
416bc658 | 2749 | free_extent_buffer(eb); |
97d9a8a4 TI |
2750 | err = -EIO; |
2751 | goto next; | |
2752 | } | |
5d4f98a2 YZ |
2753 | btrfs_tree_lock(eb); |
2754 | btrfs_set_lock_blocking(eb); | |
2755 | ||
2756 | if (!node->eb) { | |
2757 | ret = btrfs_cow_block(trans, root, eb, upper->eb, | |
2758 | slot, &eb); | |
3fd0a558 YZ |
2759 | btrfs_tree_unlock(eb); |
2760 | free_extent_buffer(eb); | |
5d4f98a2 YZ |
2761 | if (ret < 0) { |
2762 | err = ret; | |
3fd0a558 | 2763 | goto next; |
5d4f98a2 | 2764 | } |
3fd0a558 | 2765 | BUG_ON(node->eb != eb); |
5d4f98a2 YZ |
2766 | } else { |
2767 | btrfs_set_node_blockptr(upper->eb, slot, | |
2768 | node->eb->start); | |
2769 | btrfs_set_node_ptr_generation(upper->eb, slot, | |
2770 | trans->transid); | |
2771 | btrfs_mark_buffer_dirty(upper->eb); | |
2772 | ||
84f7d8e6 | 2773 | ret = btrfs_inc_extent_ref(trans, root, |
5d4f98a2 YZ |
2774 | node->eb->start, blocksize, |
2775 | upper->eb->start, | |
2776 | btrfs_header_owner(upper->eb), | |
b06c4bf5 | 2777 | node->level, 0); |
5d4f98a2 YZ |
2778 | BUG_ON(ret); |
2779 | ||
2780 | ret = btrfs_drop_subtree(trans, root, eb, upper->eb); | |
2781 | BUG_ON(ret); | |
5d4f98a2 | 2782 | } |
3fd0a558 YZ |
2783 | next: |
2784 | if (!upper->pending) | |
2785 | drop_node_buffer(upper); | |
2786 | else | |
2787 | unlock_node_buffer(upper); | |
2788 | if (err) | |
2789 | break; | |
5d4f98a2 | 2790 | } |
3fd0a558 YZ |
2791 | |
2792 | if (!err && node->pending) { | |
2793 | drop_node_buffer(node); | |
2794 | list_move_tail(&node->list, &rc->backref_cache.changed); | |
2795 | node->pending = 0; | |
2796 | } | |
2797 | ||
5d4f98a2 | 2798 | path->lowest_level = 0; |
3fd0a558 | 2799 | BUG_ON(err == -ENOSPC); |
5d4f98a2 YZ |
2800 | return err; |
2801 | } | |
2802 | ||
2803 | static int link_to_upper(struct btrfs_trans_handle *trans, | |
3fd0a558 | 2804 | struct reloc_control *rc, |
5d4f98a2 YZ |
2805 | struct backref_node *node, |
2806 | struct btrfs_path *path) | |
2807 | { | |
2808 | struct btrfs_key key; | |
5d4f98a2 YZ |
2809 | |
2810 | btrfs_node_key_to_cpu(node->eb, &key, 0); | |
3fd0a558 | 2811 | return do_relocation(trans, rc, node, &key, path, 0); |
5d4f98a2 YZ |
2812 | } |
2813 | ||
2814 | static int finish_pending_nodes(struct btrfs_trans_handle *trans, | |
3fd0a558 YZ |
2815 | struct reloc_control *rc, |
2816 | struct btrfs_path *path, int err) | |
5d4f98a2 | 2817 | { |
3fd0a558 YZ |
2818 | LIST_HEAD(list); |
2819 | struct backref_cache *cache = &rc->backref_cache; | |
5d4f98a2 YZ |
2820 | struct backref_node *node; |
2821 | int level; | |
2822 | int ret; | |
5d4f98a2 YZ |
2823 | |
2824 | for (level = 0; level < BTRFS_MAX_LEVEL; level++) { | |
2825 | while (!list_empty(&cache->pending[level])) { | |
2826 | node = list_entry(cache->pending[level].next, | |
3fd0a558 YZ |
2827 | struct backref_node, list); |
2828 | list_move_tail(&node->list, &list); | |
2829 | BUG_ON(!node->pending); | |
5d4f98a2 | 2830 | |
3fd0a558 YZ |
2831 | if (!err) { |
2832 | ret = link_to_upper(trans, rc, node, path); | |
2833 | if (ret < 0) | |
2834 | err = ret; | |
2835 | } | |
5d4f98a2 | 2836 | } |
3fd0a558 | 2837 | list_splice_init(&list, &cache->pending[level]); |
5d4f98a2 | 2838 | } |
5d4f98a2 YZ |
2839 | return err; |
2840 | } | |
2841 | ||
2842 | static void mark_block_processed(struct reloc_control *rc, | |
3fd0a558 YZ |
2843 | u64 bytenr, u32 blocksize) |
2844 | { | |
2845 | set_extent_bits(&rc->processed_blocks, bytenr, bytenr + blocksize - 1, | |
ceeb0ae7 | 2846 | EXTENT_DIRTY); |
3fd0a558 YZ |
2847 | } |
2848 | ||
2849 | static void __mark_block_processed(struct reloc_control *rc, | |
2850 | struct backref_node *node) | |
5d4f98a2 YZ |
2851 | { |
2852 | u32 blocksize; | |
2853 | if (node->level == 0 || | |
2854 | in_block_group(node->bytenr, rc->block_group)) { | |
da17066c | 2855 | blocksize = rc->extent_root->fs_info->nodesize; |
3fd0a558 | 2856 | mark_block_processed(rc, node->bytenr, blocksize); |
5d4f98a2 YZ |
2857 | } |
2858 | node->processed = 1; | |
2859 | } | |
2860 | ||
2861 | /* | |
2862 | * mark a block and all blocks directly/indirectly reference the block | |
2863 | * as processed. | |
2864 | */ | |
2865 | static void update_processed_blocks(struct reloc_control *rc, | |
2866 | struct backref_node *node) | |
2867 | { | |
2868 | struct backref_node *next = node; | |
2869 | struct backref_edge *edge; | |
2870 | struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; | |
2871 | int index = 0; | |
2872 | ||
2873 | while (next) { | |
2874 | cond_resched(); | |
2875 | while (1) { | |
2876 | if (next->processed) | |
2877 | break; | |
2878 | ||
3fd0a558 | 2879 | __mark_block_processed(rc, next); |
5d4f98a2 YZ |
2880 | |
2881 | if (list_empty(&next->upper)) | |
2882 | break; | |
2883 | ||
2884 | edge = list_entry(next->upper.next, | |
2885 | struct backref_edge, list[LOWER]); | |
2886 | edges[index++] = edge; | |
2887 | next = edge->node[UPPER]; | |
2888 | } | |
2889 | next = walk_down_backref(edges, &index); | |
2890 | } | |
2891 | } | |
2892 | ||
7476dfda | 2893 | static int tree_block_processed(u64 bytenr, struct reloc_control *rc) |
3fd0a558 | 2894 | { |
da17066c | 2895 | u32 blocksize = rc->extent_root->fs_info->nodesize; |
7476dfda | 2896 | |
3fd0a558 YZ |
2897 | if (test_range_bit(&rc->processed_blocks, bytenr, |
2898 | bytenr + blocksize - 1, EXTENT_DIRTY, 1, NULL)) | |
2899 | return 1; | |
2900 | return 0; | |
5d4f98a2 YZ |
2901 | } |
2902 | ||
2ff7e61e | 2903 | static int get_tree_block_key(struct btrfs_fs_info *fs_info, |
5d4f98a2 YZ |
2904 | struct tree_block *block) |
2905 | { | |
2906 | struct extent_buffer *eb; | |
2907 | ||
2908 | BUG_ON(block->key_ready); | |
581c1760 QW |
2909 | eb = read_tree_block(fs_info, block->bytenr, block->key.offset, |
2910 | block->level, NULL); | |
64c043de LB |
2911 | if (IS_ERR(eb)) { |
2912 | return PTR_ERR(eb); | |
2913 | } else if (!extent_buffer_uptodate(eb)) { | |
416bc658 JB |
2914 | free_extent_buffer(eb); |
2915 | return -EIO; | |
2916 | } | |
5d4f98a2 YZ |
2917 | if (block->level == 0) |
2918 | btrfs_item_key_to_cpu(eb, &block->key, 0); | |
2919 | else | |
2920 | btrfs_node_key_to_cpu(eb, &block->key, 0); | |
2921 | free_extent_buffer(eb); | |
2922 | block->key_ready = 1; | |
2923 | return 0; | |
2924 | } | |
2925 | ||
5d4f98a2 YZ |
2926 | /* |
2927 | * helper function to relocate a tree block | |
2928 | */ | |
2929 | static int relocate_tree_block(struct btrfs_trans_handle *trans, | |
2930 | struct reloc_control *rc, | |
2931 | struct backref_node *node, | |
2932 | struct btrfs_key *key, | |
2933 | struct btrfs_path *path) | |
2934 | { | |
2935 | struct btrfs_root *root; | |
3fd0a558 YZ |
2936 | int ret = 0; |
2937 | ||
2938 | if (!node) | |
2939 | return 0; | |
5d4f98a2 | 2940 | |
3fd0a558 | 2941 | BUG_ON(node->processed); |
147d256e | 2942 | root = select_one_root(node); |
3fd0a558 | 2943 | if (root == ERR_PTR(-ENOENT)) { |
5d4f98a2 | 2944 | update_processed_blocks(rc, node); |
3fd0a558 | 2945 | goto out; |
5d4f98a2 YZ |
2946 | } |
2947 | ||
27cdeb70 | 2948 | if (!root || test_bit(BTRFS_ROOT_REF_COWS, &root->state)) { |
3fd0a558 YZ |
2949 | ret = reserve_metadata_space(trans, rc, node); |
2950 | if (ret) | |
5d4f98a2 | 2951 | goto out; |
5d4f98a2 YZ |
2952 | } |
2953 | ||
3fd0a558 | 2954 | if (root) { |
27cdeb70 | 2955 | if (test_bit(BTRFS_ROOT_REF_COWS, &root->state)) { |
3fd0a558 YZ |
2956 | BUG_ON(node->new_bytenr); |
2957 | BUG_ON(!list_empty(&node->list)); | |
2958 | btrfs_record_root_in_trans(trans, root); | |
2959 | root = root->reloc_root; | |
2960 | node->new_bytenr = root->node->start; | |
2961 | node->root = root; | |
2962 | list_add_tail(&node->list, &rc->backref_cache.changed); | |
2963 | } else { | |
2964 | path->lowest_level = node->level; | |
2965 | ret = btrfs_search_slot(trans, root, key, path, 0, 1); | |
b3b4aa74 | 2966 | btrfs_release_path(path); |
3fd0a558 YZ |
2967 | if (ret > 0) |
2968 | ret = 0; | |
2969 | } | |
2970 | if (!ret) | |
2971 | update_processed_blocks(rc, node); | |
2972 | } else { | |
2973 | ret = do_relocation(trans, rc, node, key, path, 1); | |
2974 | } | |
5d4f98a2 | 2975 | out: |
0647bf56 | 2976 | if (ret || node->level == 0 || node->cowonly) |
3fd0a558 | 2977 | remove_backref_node(&rc->backref_cache, node); |
5d4f98a2 YZ |
2978 | return ret; |
2979 | } | |
2980 | ||
2981 | /* | |
2982 | * relocate a list of blocks | |
2983 | */ | |
2984 | static noinline_for_stack | |
2985 | int relocate_tree_blocks(struct btrfs_trans_handle *trans, | |
2986 | struct reloc_control *rc, struct rb_root *blocks) | |
2987 | { | |
2ff7e61e | 2988 | struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; |
5d4f98a2 YZ |
2989 | struct backref_node *node; |
2990 | struct btrfs_path *path; | |
2991 | struct tree_block *block; | |
98ff7b94 | 2992 | struct tree_block *next; |
5d4f98a2 YZ |
2993 | int ret; |
2994 | int err = 0; | |
2995 | ||
2996 | path = btrfs_alloc_path(); | |
e1a12670 LB |
2997 | if (!path) { |
2998 | err = -ENOMEM; | |
34c2b290 | 2999 | goto out_free_blocks; |
e1a12670 | 3000 | } |
5d4f98a2 | 3001 | |
98ff7b94 QW |
3002 | /* Kick in readahead for tree blocks with missing keys */ |
3003 | rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { | |
5d4f98a2 | 3004 | if (!block->key_ready) |
2ff7e61e | 3005 | readahead_tree_block(fs_info, block->bytenr); |
5d4f98a2 YZ |
3006 | } |
3007 | ||
98ff7b94 QW |
3008 | /* Get first keys */ |
3009 | rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { | |
34c2b290 | 3010 | if (!block->key_ready) { |
2ff7e61e | 3011 | err = get_tree_block_key(fs_info, block); |
34c2b290 DS |
3012 | if (err) |
3013 | goto out_free_path; | |
3014 | } | |
5d4f98a2 YZ |
3015 | } |
3016 | ||
98ff7b94 QW |
3017 | /* Do tree relocation */ |
3018 | rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { | |
3fd0a558 | 3019 | node = build_backref_tree(rc, &block->key, |
5d4f98a2 YZ |
3020 | block->level, block->bytenr); |
3021 | if (IS_ERR(node)) { | |
3022 | err = PTR_ERR(node); | |
3023 | goto out; | |
3024 | } | |
3025 | ||
3026 | ret = relocate_tree_block(trans, rc, node, &block->key, | |
3027 | path); | |
3028 | if (ret < 0) { | |
98ff7b94 | 3029 | if (ret != -EAGAIN || &block->rb_node == rb_first(blocks)) |
3fd0a558 | 3030 | err = ret; |
5d4f98a2 YZ |
3031 | goto out; |
3032 | } | |
5d4f98a2 | 3033 | } |
5d4f98a2 | 3034 | out: |
3fd0a558 | 3035 | err = finish_pending_nodes(trans, rc, path, err); |
5d4f98a2 | 3036 | |
34c2b290 | 3037 | out_free_path: |
5d4f98a2 | 3038 | btrfs_free_path(path); |
34c2b290 | 3039 | out_free_blocks: |
e1a12670 | 3040 | free_block_list(blocks); |
5d4f98a2 YZ |
3041 | return err; |
3042 | } | |
3043 | ||
efa56464 YZ |
3044 | static noinline_for_stack |
3045 | int prealloc_file_extent_cluster(struct inode *inode, | |
3046 | struct file_extent_cluster *cluster) | |
3047 | { | |
3048 | u64 alloc_hint = 0; | |
3049 | u64 start; | |
3050 | u64 end; | |
3051 | u64 offset = BTRFS_I(inode)->index_cnt; | |
3052 | u64 num_bytes; | |
3053 | int nr = 0; | |
3054 | int ret = 0; | |
dcb40c19 WX |
3055 | u64 prealloc_start = cluster->start - offset; |
3056 | u64 prealloc_end = cluster->end - offset; | |
18513091 | 3057 | u64 cur_offset; |
364ecf36 | 3058 | struct extent_changeset *data_reserved = NULL; |
efa56464 YZ |
3059 | |
3060 | BUG_ON(cluster->start != cluster->boundary[0]); | |
5955102c | 3061 | inode_lock(inode); |
efa56464 | 3062 | |
364ecf36 | 3063 | ret = btrfs_check_data_free_space(inode, &data_reserved, prealloc_start, |
dcb40c19 | 3064 | prealloc_end + 1 - prealloc_start); |
efa56464 YZ |
3065 | if (ret) |
3066 | goto out; | |
3067 | ||
18513091 | 3068 | cur_offset = prealloc_start; |
efa56464 YZ |
3069 | while (nr < cluster->nr) { |
3070 | start = cluster->boundary[nr] - offset; | |
3071 | if (nr + 1 < cluster->nr) | |
3072 | end = cluster->boundary[nr + 1] - 1 - offset; | |
3073 | else | |
3074 | end = cluster->end - offset; | |
3075 | ||
d0082371 | 3076 | lock_extent(&BTRFS_I(inode)->io_tree, start, end); |
efa56464 | 3077 | num_bytes = end + 1 - start; |
18513091 | 3078 | if (cur_offset < start) |
bc42bda2 QW |
3079 | btrfs_free_reserved_data_space(inode, data_reserved, |
3080 | cur_offset, start - cur_offset); | |
efa56464 YZ |
3081 | ret = btrfs_prealloc_file_range(inode, 0, start, |
3082 | num_bytes, num_bytes, | |
3083 | end + 1, &alloc_hint); | |
18513091 | 3084 | cur_offset = end + 1; |
d0082371 | 3085 | unlock_extent(&BTRFS_I(inode)->io_tree, start, end); |
efa56464 YZ |
3086 | if (ret) |
3087 | break; | |
3088 | nr++; | |
3089 | } | |
18513091 | 3090 | if (cur_offset < prealloc_end) |
bc42bda2 QW |
3091 | btrfs_free_reserved_data_space(inode, data_reserved, |
3092 | cur_offset, prealloc_end + 1 - cur_offset); | |
efa56464 | 3093 | out: |
5955102c | 3094 | inode_unlock(inode); |
364ecf36 | 3095 | extent_changeset_free(data_reserved); |
efa56464 YZ |
3096 | return ret; |
3097 | } | |
3098 | ||
5d4f98a2 | 3099 | static noinline_for_stack |
0257bb82 YZ |
3100 | int setup_extent_mapping(struct inode *inode, u64 start, u64 end, |
3101 | u64 block_start) | |
3102 | { | |
0b246afa | 3103 | struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); |
0257bb82 YZ |
3104 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; |
3105 | struct extent_map *em; | |
3106 | int ret = 0; | |
3107 | ||
172ddd60 | 3108 | em = alloc_extent_map(); |
0257bb82 YZ |
3109 | if (!em) |
3110 | return -ENOMEM; | |
3111 | ||
3112 | em->start = start; | |
3113 | em->len = end + 1 - start; | |
3114 | em->block_len = em->len; | |
3115 | em->block_start = block_start; | |
0b246afa | 3116 | em->bdev = fs_info->fs_devices->latest_bdev; |
0257bb82 YZ |
3117 | set_bit(EXTENT_FLAG_PINNED, &em->flags); |
3118 | ||
d0082371 | 3119 | lock_extent(&BTRFS_I(inode)->io_tree, start, end); |
0257bb82 YZ |
3120 | while (1) { |
3121 | write_lock(&em_tree->lock); | |
09a2a8f9 | 3122 | ret = add_extent_mapping(em_tree, em, 0); |
0257bb82 YZ |
3123 | write_unlock(&em_tree->lock); |
3124 | if (ret != -EEXIST) { | |
3125 | free_extent_map(em); | |
3126 | break; | |
3127 | } | |
dcdbc059 | 3128 | btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 0); |
0257bb82 | 3129 | } |
d0082371 | 3130 | unlock_extent(&BTRFS_I(inode)->io_tree, start, end); |
0257bb82 YZ |
3131 | return ret; |
3132 | } | |
3133 | ||
3134 | static int relocate_file_extent_cluster(struct inode *inode, | |
3135 | struct file_extent_cluster *cluster) | |
5d4f98a2 | 3136 | { |
2ff7e61e | 3137 | struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); |
5d4f98a2 YZ |
3138 | u64 page_start; |
3139 | u64 page_end; | |
0257bb82 YZ |
3140 | u64 offset = BTRFS_I(inode)->index_cnt; |
3141 | unsigned long index; | |
5d4f98a2 | 3142 | unsigned long last_index; |
5d4f98a2 YZ |
3143 | struct page *page; |
3144 | struct file_ra_state *ra; | |
3b16a4e3 | 3145 | gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping); |
0257bb82 | 3146 | int nr = 0; |
5d4f98a2 YZ |
3147 | int ret = 0; |
3148 | ||
0257bb82 YZ |
3149 | if (!cluster->nr) |
3150 | return 0; | |
3151 | ||
5d4f98a2 YZ |
3152 | ra = kzalloc(sizeof(*ra), GFP_NOFS); |
3153 | if (!ra) | |
3154 | return -ENOMEM; | |
3155 | ||
efa56464 YZ |
3156 | ret = prealloc_file_extent_cluster(inode, cluster); |
3157 | if (ret) | |
3158 | goto out; | |
0257bb82 | 3159 | |
efa56464 | 3160 | file_ra_state_init(ra, inode->i_mapping); |
5d4f98a2 | 3161 | |
0257bb82 YZ |
3162 | ret = setup_extent_mapping(inode, cluster->start - offset, |
3163 | cluster->end - offset, cluster->start); | |
5d4f98a2 | 3164 | if (ret) |
efa56464 | 3165 | goto out; |
5d4f98a2 | 3166 | |
09cbfeaf KS |
3167 | index = (cluster->start - offset) >> PAGE_SHIFT; |
3168 | last_index = (cluster->end - offset) >> PAGE_SHIFT; | |
0257bb82 | 3169 | while (index <= last_index) { |
9f3db423 NB |
3170 | ret = btrfs_delalloc_reserve_metadata(BTRFS_I(inode), |
3171 | PAGE_SIZE); | |
efa56464 YZ |
3172 | if (ret) |
3173 | goto out; | |
3174 | ||
0257bb82 | 3175 | page = find_lock_page(inode->i_mapping, index); |
5d4f98a2 | 3176 | if (!page) { |
0257bb82 YZ |
3177 | page_cache_sync_readahead(inode->i_mapping, |
3178 | ra, NULL, index, | |
3179 | last_index + 1 - index); | |
a94733d0 | 3180 | page = find_or_create_page(inode->i_mapping, index, |
3b16a4e3 | 3181 | mask); |
0257bb82 | 3182 | if (!page) { |
691fa059 | 3183 | btrfs_delalloc_release_metadata(BTRFS_I(inode), |
43b18595 | 3184 | PAGE_SIZE, true); |
0257bb82 | 3185 | ret = -ENOMEM; |
efa56464 | 3186 | goto out; |
0257bb82 | 3187 | } |
5d4f98a2 | 3188 | } |
0257bb82 YZ |
3189 | |
3190 | if (PageReadahead(page)) { | |
3191 | page_cache_async_readahead(inode->i_mapping, | |
3192 | ra, NULL, page, index, | |
3193 | last_index + 1 - index); | |
3194 | } | |
3195 | ||
5d4f98a2 YZ |
3196 | if (!PageUptodate(page)) { |
3197 | btrfs_readpage(NULL, page); | |
3198 | lock_page(page); | |
3199 | if (!PageUptodate(page)) { | |
3200 | unlock_page(page); | |
09cbfeaf | 3201 | put_page(page); |
691fa059 | 3202 | btrfs_delalloc_release_metadata(BTRFS_I(inode), |
43b18595 | 3203 | PAGE_SIZE, true); |
8b62f87b | 3204 | btrfs_delalloc_release_extents(BTRFS_I(inode), |
43b18595 | 3205 | PAGE_SIZE, true); |
5d4f98a2 | 3206 | ret = -EIO; |
efa56464 | 3207 | goto out; |
5d4f98a2 YZ |
3208 | } |
3209 | } | |
5d4f98a2 | 3210 | |
4eee4fa4 | 3211 | page_start = page_offset(page); |
09cbfeaf | 3212 | page_end = page_start + PAGE_SIZE - 1; |
0257bb82 | 3213 | |
d0082371 | 3214 | lock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end); |
0257bb82 | 3215 | |
5d4f98a2 YZ |
3216 | set_page_extent_mapped(page); |
3217 | ||
0257bb82 YZ |
3218 | if (nr < cluster->nr && |
3219 | page_start + offset == cluster->boundary[nr]) { | |
3220 | set_extent_bits(&BTRFS_I(inode)->io_tree, | |
3221 | page_start, page_end, | |
ceeb0ae7 | 3222 | EXTENT_BOUNDARY); |
0257bb82 YZ |
3223 | nr++; |
3224 | } | |
5d4f98a2 | 3225 | |
765f3ceb NB |
3226 | ret = btrfs_set_extent_delalloc(inode, page_start, page_end, 0, |
3227 | NULL, 0); | |
3228 | if (ret) { | |
3229 | unlock_page(page); | |
3230 | put_page(page); | |
3231 | btrfs_delalloc_release_metadata(BTRFS_I(inode), | |
43b18595 | 3232 | PAGE_SIZE, true); |
765f3ceb | 3233 | btrfs_delalloc_release_extents(BTRFS_I(inode), |
43b18595 | 3234 | PAGE_SIZE, true); |
765f3ceb NB |
3235 | |
3236 | clear_extent_bits(&BTRFS_I(inode)->io_tree, | |
3237 | page_start, page_end, | |
3238 | EXTENT_LOCKED | EXTENT_BOUNDARY); | |
3239 | goto out; | |
3240 | ||
3241 | } | |
5d4f98a2 | 3242 | set_page_dirty(page); |
5d4f98a2 | 3243 | |
0257bb82 | 3244 | unlock_extent(&BTRFS_I(inode)->io_tree, |
d0082371 | 3245 | page_start, page_end); |
5d4f98a2 | 3246 | unlock_page(page); |
09cbfeaf | 3247 | put_page(page); |
0257bb82 YZ |
3248 | |
3249 | index++; | |
43b18595 QW |
3250 | btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE, |
3251 | false); | |
efa56464 | 3252 | balance_dirty_pages_ratelimited(inode->i_mapping); |
2ff7e61e | 3253 | btrfs_throttle(fs_info); |
5d4f98a2 | 3254 | } |
0257bb82 | 3255 | WARN_ON(nr != cluster->nr); |
efa56464 | 3256 | out: |
5d4f98a2 | 3257 | kfree(ra); |
5d4f98a2 YZ |
3258 | return ret; |
3259 | } | |
3260 | ||
3261 | static noinline_for_stack | |
0257bb82 YZ |
3262 | int relocate_data_extent(struct inode *inode, struct btrfs_key *extent_key, |
3263 | struct file_extent_cluster *cluster) | |
5d4f98a2 | 3264 | { |
0257bb82 | 3265 | int ret; |
5d4f98a2 | 3266 | |
0257bb82 YZ |
3267 | if (cluster->nr > 0 && extent_key->objectid != cluster->end + 1) { |
3268 | ret = relocate_file_extent_cluster(inode, cluster); | |
3269 | if (ret) | |
3270 | return ret; | |
3271 | cluster->nr = 0; | |
5d4f98a2 | 3272 | } |
5d4f98a2 | 3273 | |
0257bb82 YZ |
3274 | if (!cluster->nr) |
3275 | cluster->start = extent_key->objectid; | |
3276 | else | |
3277 | BUG_ON(cluster->nr >= MAX_EXTENTS); | |
3278 | cluster->end = extent_key->objectid + extent_key->offset - 1; | |
3279 | cluster->boundary[cluster->nr] = extent_key->objectid; | |
3280 | cluster->nr++; | |
3281 | ||
3282 | if (cluster->nr >= MAX_EXTENTS) { | |
3283 | ret = relocate_file_extent_cluster(inode, cluster); | |
3284 | if (ret) | |
3285 | return ret; | |
3286 | cluster->nr = 0; | |
3287 | } | |
3288 | return 0; | |
5d4f98a2 YZ |
3289 | } |
3290 | ||
5d4f98a2 YZ |
3291 | /* |
3292 | * helper to add a tree block to the list. | |
3293 | * the major work is getting the generation and level of the block | |
3294 | */ | |
3295 | static int add_tree_block(struct reloc_control *rc, | |
3296 | struct btrfs_key *extent_key, | |
3297 | struct btrfs_path *path, | |
3298 | struct rb_root *blocks) | |
3299 | { | |
3300 | struct extent_buffer *eb; | |
3301 | struct btrfs_extent_item *ei; | |
3302 | struct btrfs_tree_block_info *bi; | |
3303 | struct tree_block *block; | |
3304 | struct rb_node *rb_node; | |
3305 | u32 item_size; | |
3306 | int level = -1; | |
7fdf4b60 | 3307 | u64 generation; |
5d4f98a2 YZ |
3308 | |
3309 | eb = path->nodes[0]; | |
3310 | item_size = btrfs_item_size_nr(eb, path->slots[0]); | |
3311 | ||
3173a18f JB |
3312 | if (extent_key->type == BTRFS_METADATA_ITEM_KEY || |
3313 | item_size >= sizeof(*ei) + sizeof(*bi)) { | |
5d4f98a2 YZ |
3314 | ei = btrfs_item_ptr(eb, path->slots[0], |
3315 | struct btrfs_extent_item); | |
3173a18f JB |
3316 | if (extent_key->type == BTRFS_EXTENT_ITEM_KEY) { |
3317 | bi = (struct btrfs_tree_block_info *)(ei + 1); | |
3318 | level = btrfs_tree_block_level(eb, bi); | |
3319 | } else { | |
3320 | level = (int)extent_key->offset; | |
3321 | } | |
5d4f98a2 | 3322 | generation = btrfs_extent_generation(eb, ei); |
6d8ff4e4 | 3323 | } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) { |
ba3c2b19 NB |
3324 | btrfs_print_v0_err(eb->fs_info); |
3325 | btrfs_handle_fs_error(eb->fs_info, -EINVAL, NULL); | |
3326 | return -EINVAL; | |
5d4f98a2 | 3327 | } else { |
5d4f98a2 | 3328 | BUG(); |
5d4f98a2 YZ |
3329 | } |
3330 | ||
b3b4aa74 | 3331 | btrfs_release_path(path); |
5d4f98a2 YZ |
3332 | |
3333 | BUG_ON(level == -1); | |
3334 | ||
3335 | block = kmalloc(sizeof(*block), GFP_NOFS); | |
3336 | if (!block) | |
3337 | return -ENOMEM; | |
3338 | ||
3339 | block->bytenr = extent_key->objectid; | |
da17066c | 3340 | block->key.objectid = rc->extent_root->fs_info->nodesize; |
5d4f98a2 YZ |
3341 | block->key.offset = generation; |
3342 | block->level = level; | |
3343 | block->key_ready = 0; | |
3344 | ||
3345 | rb_node = tree_insert(blocks, block->bytenr, &block->rb_node); | |
43c04fb1 JM |
3346 | if (rb_node) |
3347 | backref_tree_panic(rb_node, -EEXIST, block->bytenr); | |
5d4f98a2 YZ |
3348 | |
3349 | return 0; | |
3350 | } | |
3351 | ||
3352 | /* | |
3353 | * helper to add tree blocks for backref of type BTRFS_SHARED_DATA_REF_KEY | |
3354 | */ | |
3355 | static int __add_tree_block(struct reloc_control *rc, | |
3356 | u64 bytenr, u32 blocksize, | |
3357 | struct rb_root *blocks) | |
3358 | { | |
0b246afa | 3359 | struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; |
5d4f98a2 YZ |
3360 | struct btrfs_path *path; |
3361 | struct btrfs_key key; | |
3362 | int ret; | |
0b246afa | 3363 | bool skinny = btrfs_fs_incompat(fs_info, SKINNY_METADATA); |
5d4f98a2 | 3364 | |
7476dfda | 3365 | if (tree_block_processed(bytenr, rc)) |
5d4f98a2 YZ |
3366 | return 0; |
3367 | ||
3368 | if (tree_search(blocks, bytenr)) | |
3369 | return 0; | |
3370 | ||
3371 | path = btrfs_alloc_path(); | |
3372 | if (!path) | |
3373 | return -ENOMEM; | |
aee68ee5 | 3374 | again: |
5d4f98a2 | 3375 | key.objectid = bytenr; |
aee68ee5 JB |
3376 | if (skinny) { |
3377 | key.type = BTRFS_METADATA_ITEM_KEY; | |
3378 | key.offset = (u64)-1; | |
3379 | } else { | |
3380 | key.type = BTRFS_EXTENT_ITEM_KEY; | |
3381 | key.offset = blocksize; | |
3382 | } | |
5d4f98a2 YZ |
3383 | |
3384 | path->search_commit_root = 1; | |
3385 | path->skip_locking = 1; | |
3386 | ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 0, 0); | |
3387 | if (ret < 0) | |
3388 | goto out; | |
5d4f98a2 | 3389 | |
aee68ee5 JB |
3390 | if (ret > 0 && skinny) { |
3391 | if (path->slots[0]) { | |
3392 | path->slots[0]--; | |
3393 | btrfs_item_key_to_cpu(path->nodes[0], &key, | |
3394 | path->slots[0]); | |
3395 | if (key.objectid == bytenr && | |
3396 | (key.type == BTRFS_METADATA_ITEM_KEY || | |
3397 | (key.type == BTRFS_EXTENT_ITEM_KEY && | |
3398 | key.offset == blocksize))) | |
3399 | ret = 0; | |
3400 | } | |
3401 | ||
3402 | if (ret) { | |
3403 | skinny = false; | |
3404 | btrfs_release_path(path); | |
3405 | goto again; | |
3406 | } | |
3173a18f | 3407 | } |
cdccee99 LB |
3408 | if (ret) { |
3409 | ASSERT(ret == 1); | |
3410 | btrfs_print_leaf(path->nodes[0]); | |
3411 | btrfs_err(fs_info, | |
3412 | "tree block extent item (%llu) is not found in extent tree", | |
3413 | bytenr); | |
3414 | WARN_ON(1); | |
3415 | ret = -EINVAL; | |
3416 | goto out; | |
3417 | } | |
3173a18f | 3418 | |
5d4f98a2 YZ |
3419 | ret = add_tree_block(rc, &key, path, blocks); |
3420 | out: | |
3421 | btrfs_free_path(path); | |
3422 | return ret; | |
3423 | } | |
3424 | ||
3425 | /* | |
3426 | * helper to check if the block use full backrefs for pointers in it | |
3427 | */ | |
3428 | static int block_use_full_backref(struct reloc_control *rc, | |
3429 | struct extent_buffer *eb) | |
3430 | { | |
5d4f98a2 YZ |
3431 | u64 flags; |
3432 | int ret; | |
3433 | ||
3434 | if (btrfs_header_flag(eb, BTRFS_HEADER_FLAG_RELOC) || | |
3435 | btrfs_header_backref_rev(eb) < BTRFS_MIXED_BACKREF_REV) | |
3436 | return 1; | |
3437 | ||
2ff7e61e | 3438 | ret = btrfs_lookup_extent_info(NULL, rc->extent_root->fs_info, |
3173a18f JB |
3439 | eb->start, btrfs_header_level(eb), 1, |
3440 | NULL, &flags); | |
5d4f98a2 YZ |
3441 | BUG_ON(ret); |
3442 | ||
5d4f98a2 YZ |
3443 | if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF) |
3444 | ret = 1; | |
3445 | else | |
3446 | ret = 0; | |
5d4f98a2 YZ |
3447 | return ret; |
3448 | } | |
3449 | ||
0af3d00b | 3450 | static int delete_block_group_cache(struct btrfs_fs_info *fs_info, |
1bbc621e CM |
3451 | struct btrfs_block_group_cache *block_group, |
3452 | struct inode *inode, | |
3453 | u64 ino) | |
0af3d00b JB |
3454 | { |
3455 | struct btrfs_key key; | |
0af3d00b JB |
3456 | struct btrfs_root *root = fs_info->tree_root; |
3457 | struct btrfs_trans_handle *trans; | |
0af3d00b JB |
3458 | int ret = 0; |
3459 | ||
3460 | if (inode) | |
3461 | goto truncate; | |
3462 | ||
3463 | key.objectid = ino; | |
3464 | key.type = BTRFS_INODE_ITEM_KEY; | |
3465 | key.offset = 0; | |
3466 | ||
3467 | inode = btrfs_iget(fs_info->sb, &key, root, NULL); | |
2e19f1f9 | 3468 | if (IS_ERR(inode)) |
0af3d00b | 3469 | return -ENOENT; |
0af3d00b JB |
3470 | |
3471 | truncate: | |
2ff7e61e | 3472 | ret = btrfs_check_trunc_cache_free_space(fs_info, |
7b61cd92 MX |
3473 | &fs_info->global_block_rsv); |
3474 | if (ret) | |
3475 | goto out; | |
3476 | ||
7a7eaa40 | 3477 | trans = btrfs_join_transaction(root); |
0af3d00b | 3478 | if (IS_ERR(trans)) { |
3612b495 | 3479 | ret = PTR_ERR(trans); |
0af3d00b JB |
3480 | goto out; |
3481 | } | |
3482 | ||
77ab86bf | 3483 | ret = btrfs_truncate_free_space_cache(trans, block_group, inode); |
0af3d00b | 3484 | |
3a45bb20 | 3485 | btrfs_end_transaction(trans); |
2ff7e61e | 3486 | btrfs_btree_balance_dirty(fs_info); |
0af3d00b JB |
3487 | out: |
3488 | iput(inode); | |
3489 | return ret; | |
3490 | } | |
3491 | ||
5d4f98a2 YZ |
3492 | /* |
3493 | * helper to add tree blocks for backref of type BTRFS_EXTENT_DATA_REF_KEY | |
3494 | * this function scans fs tree to find blocks reference the data extent | |
3495 | */ | |
3496 | static int find_data_references(struct reloc_control *rc, | |
3497 | struct btrfs_key *extent_key, | |
3498 | struct extent_buffer *leaf, | |
3499 | struct btrfs_extent_data_ref *ref, | |
3500 | struct rb_root *blocks) | |
3501 | { | |
0b246afa | 3502 | struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; |
5d4f98a2 YZ |
3503 | struct btrfs_path *path; |
3504 | struct tree_block *block; | |
3505 | struct btrfs_root *root; | |
3506 | struct btrfs_file_extent_item *fi; | |
3507 | struct rb_node *rb_node; | |
3508 | struct btrfs_key key; | |
3509 | u64 ref_root; | |
3510 | u64 ref_objectid; | |
3511 | u64 ref_offset; | |
3512 | u32 ref_count; | |
3513 | u32 nritems; | |
3514 | int err = 0; | |
3515 | int added = 0; | |
3516 | int counted; | |
3517 | int ret; | |
3518 | ||
5d4f98a2 YZ |
3519 | ref_root = btrfs_extent_data_ref_root(leaf, ref); |
3520 | ref_objectid = btrfs_extent_data_ref_objectid(leaf, ref); | |
3521 | ref_offset = btrfs_extent_data_ref_offset(leaf, ref); | |
3522 | ref_count = btrfs_extent_data_ref_count(leaf, ref); | |
3523 | ||
0af3d00b JB |
3524 | /* |
3525 | * This is an extent belonging to the free space cache, lets just delete | |
3526 | * it and redo the search. | |
3527 | */ | |
3528 | if (ref_root == BTRFS_ROOT_TREE_OBJECTID) { | |
0b246afa | 3529 | ret = delete_block_group_cache(fs_info, rc->block_group, |
0af3d00b JB |
3530 | NULL, ref_objectid); |
3531 | if (ret != -ENOENT) | |
3532 | return ret; | |
3533 | ret = 0; | |
3534 | } | |
3535 | ||
3536 | path = btrfs_alloc_path(); | |
3537 | if (!path) | |
3538 | return -ENOMEM; | |
e4058b54 | 3539 | path->reada = READA_FORWARD; |
0af3d00b | 3540 | |
0b246afa | 3541 | root = read_fs_root(fs_info, ref_root); |
5d4f98a2 YZ |
3542 | if (IS_ERR(root)) { |
3543 | err = PTR_ERR(root); | |
3544 | goto out; | |
3545 | } | |
3546 | ||
3547 | key.objectid = ref_objectid; | |
5d4f98a2 | 3548 | key.type = BTRFS_EXTENT_DATA_KEY; |
84850e8d YZ |
3549 | if (ref_offset > ((u64)-1 << 32)) |
3550 | key.offset = 0; | |
3551 | else | |
3552 | key.offset = ref_offset; | |
5d4f98a2 YZ |
3553 | |
3554 | path->search_commit_root = 1; | |
3555 | path->skip_locking = 1; | |
3556 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
3557 | if (ret < 0) { | |
3558 | err = ret; | |
3559 | goto out; | |
3560 | } | |
3561 | ||
3562 | leaf = path->nodes[0]; | |
3563 | nritems = btrfs_header_nritems(leaf); | |
3564 | /* | |
3565 | * the references in tree blocks that use full backrefs | |
3566 | * are not counted in | |
3567 | */ | |
3568 | if (block_use_full_backref(rc, leaf)) | |
3569 | counted = 0; | |
3570 | else | |
3571 | counted = 1; | |
3572 | rb_node = tree_search(blocks, leaf->start); | |
3573 | if (rb_node) { | |
3574 | if (counted) | |
3575 | added = 1; | |
3576 | else | |
3577 | path->slots[0] = nritems; | |
3578 | } | |
3579 | ||
3580 | while (ref_count > 0) { | |
3581 | while (path->slots[0] >= nritems) { | |
3582 | ret = btrfs_next_leaf(root, path); | |
3583 | if (ret < 0) { | |
3584 | err = ret; | |
3585 | goto out; | |
3586 | } | |
fae7f21c | 3587 | if (WARN_ON(ret > 0)) |
5d4f98a2 | 3588 | goto out; |
5d4f98a2 YZ |
3589 | |
3590 | leaf = path->nodes[0]; | |
3591 | nritems = btrfs_header_nritems(leaf); | |
3592 | added = 0; | |
3593 | ||
3594 | if (block_use_full_backref(rc, leaf)) | |
3595 | counted = 0; | |
3596 | else | |
3597 | counted = 1; | |
3598 | rb_node = tree_search(blocks, leaf->start); | |
3599 | if (rb_node) { | |
3600 | if (counted) | |
3601 | added = 1; | |
3602 | else | |
3603 | path->slots[0] = nritems; | |
3604 | } | |
3605 | } | |
3606 | ||
3607 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
fae7f21c DG |
3608 | if (WARN_ON(key.objectid != ref_objectid || |
3609 | key.type != BTRFS_EXTENT_DATA_KEY)) | |
5d4f98a2 | 3610 | break; |
5d4f98a2 YZ |
3611 | |
3612 | fi = btrfs_item_ptr(leaf, path->slots[0], | |
3613 | struct btrfs_file_extent_item); | |
3614 | ||
3615 | if (btrfs_file_extent_type(leaf, fi) == | |
3616 | BTRFS_FILE_EXTENT_INLINE) | |
3617 | goto next; | |
3618 | ||
3619 | if (btrfs_file_extent_disk_bytenr(leaf, fi) != | |
3620 | extent_key->objectid) | |
3621 | goto next; | |
3622 | ||
3623 | key.offset -= btrfs_file_extent_offset(leaf, fi); | |
3624 | if (key.offset != ref_offset) | |
3625 | goto next; | |
3626 | ||
3627 | if (counted) | |
3628 | ref_count--; | |
3629 | if (added) | |
3630 | goto next; | |
3631 | ||
7476dfda | 3632 | if (!tree_block_processed(leaf->start, rc)) { |
5d4f98a2 YZ |
3633 | block = kmalloc(sizeof(*block), GFP_NOFS); |
3634 | if (!block) { | |
3635 | err = -ENOMEM; | |
3636 | break; | |
3637 | } | |
3638 | block->bytenr = leaf->start; | |
3639 | btrfs_item_key_to_cpu(leaf, &block->key, 0); | |
3640 | block->level = 0; | |
3641 | block->key_ready = 1; | |
3642 | rb_node = tree_insert(blocks, block->bytenr, | |
3643 | &block->rb_node); | |
43c04fb1 JM |
3644 | if (rb_node) |
3645 | backref_tree_panic(rb_node, -EEXIST, | |
3646 | block->bytenr); | |
5d4f98a2 YZ |
3647 | } |
3648 | if (counted) | |
3649 | added = 1; | |
3650 | else | |
3651 | path->slots[0] = nritems; | |
3652 | next: | |
3653 | path->slots[0]++; | |
3654 | ||
3655 | } | |
3656 | out: | |
3657 | btrfs_free_path(path); | |
3658 | return err; | |
3659 | } | |
3660 | ||
3661 | /* | |
2c016dc2 | 3662 | * helper to find all tree blocks that reference a given data extent |
5d4f98a2 YZ |
3663 | */ |
3664 | static noinline_for_stack | |
3665 | int add_data_references(struct reloc_control *rc, | |
3666 | struct btrfs_key *extent_key, | |
3667 | struct btrfs_path *path, | |
3668 | struct rb_root *blocks) | |
3669 | { | |
3670 | struct btrfs_key key; | |
3671 | struct extent_buffer *eb; | |
3672 | struct btrfs_extent_data_ref *dref; | |
3673 | struct btrfs_extent_inline_ref *iref; | |
3674 | unsigned long ptr; | |
3675 | unsigned long end; | |
da17066c | 3676 | u32 blocksize = rc->extent_root->fs_info->nodesize; |
647f63bd | 3677 | int ret = 0; |
5d4f98a2 YZ |
3678 | int err = 0; |
3679 | ||
5d4f98a2 YZ |
3680 | eb = path->nodes[0]; |
3681 | ptr = btrfs_item_ptr_offset(eb, path->slots[0]); | |
3682 | end = ptr + btrfs_item_size_nr(eb, path->slots[0]); | |
a79865c6 | 3683 | ptr += sizeof(struct btrfs_extent_item); |
5d4f98a2 YZ |
3684 | |
3685 | while (ptr < end) { | |
3686 | iref = (struct btrfs_extent_inline_ref *)ptr; | |
3de28d57 LB |
3687 | key.type = btrfs_get_extent_inline_ref_type(eb, iref, |
3688 | BTRFS_REF_TYPE_DATA); | |
5d4f98a2 YZ |
3689 | if (key.type == BTRFS_SHARED_DATA_REF_KEY) { |
3690 | key.offset = btrfs_extent_inline_ref_offset(eb, iref); | |
3691 | ret = __add_tree_block(rc, key.offset, blocksize, | |
3692 | blocks); | |
3693 | } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { | |
3694 | dref = (struct btrfs_extent_data_ref *)(&iref->offset); | |
3695 | ret = find_data_references(rc, extent_key, | |
3696 | eb, dref, blocks); | |
3697 | } else { | |
af431dcb | 3698 | ret = -EUCLEAN; |
b14c55a1 LB |
3699 | btrfs_err(rc->extent_root->fs_info, |
3700 | "extent %llu slot %d has an invalid inline ref type", | |
3701 | eb->start, path->slots[0]); | |
5d4f98a2 | 3702 | } |
647f63bd FDBM |
3703 | if (ret) { |
3704 | err = ret; | |
3705 | goto out; | |
3706 | } | |
5d4f98a2 YZ |
3707 | ptr += btrfs_extent_inline_ref_size(key.type); |
3708 | } | |
3709 | WARN_ON(ptr > end); | |
3710 | ||
3711 | while (1) { | |
3712 | cond_resched(); | |
3713 | eb = path->nodes[0]; | |
3714 | if (path->slots[0] >= btrfs_header_nritems(eb)) { | |
3715 | ret = btrfs_next_leaf(rc->extent_root, path); | |
3716 | if (ret < 0) { | |
3717 | err = ret; | |
3718 | break; | |
3719 | } | |
3720 | if (ret > 0) | |
3721 | break; | |
3722 | eb = path->nodes[0]; | |
3723 | } | |
3724 | ||
3725 | btrfs_item_key_to_cpu(eb, &key, path->slots[0]); | |
3726 | if (key.objectid != extent_key->objectid) | |
3727 | break; | |
3728 | ||
5d4f98a2 | 3729 | if (key.type == BTRFS_SHARED_DATA_REF_KEY) { |
5d4f98a2 YZ |
3730 | ret = __add_tree_block(rc, key.offset, blocksize, |
3731 | blocks); | |
3732 | } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { | |
3733 | dref = btrfs_item_ptr(eb, path->slots[0], | |
3734 | struct btrfs_extent_data_ref); | |
3735 | ret = find_data_references(rc, extent_key, | |
3736 | eb, dref, blocks); | |
6d8ff4e4 | 3737 | } else if (unlikely(key.type == BTRFS_EXTENT_REF_V0_KEY)) { |
ba3c2b19 NB |
3738 | btrfs_print_v0_err(eb->fs_info); |
3739 | btrfs_handle_fs_error(eb->fs_info, -EINVAL, NULL); | |
3740 | ret = -EINVAL; | |
5d4f98a2 YZ |
3741 | } else { |
3742 | ret = 0; | |
3743 | } | |
3744 | if (ret) { | |
3745 | err = ret; | |
3746 | break; | |
3747 | } | |
3748 | path->slots[0]++; | |
3749 | } | |
647f63bd | 3750 | out: |
b3b4aa74 | 3751 | btrfs_release_path(path); |
5d4f98a2 YZ |
3752 | if (err) |
3753 | free_block_list(blocks); | |
3754 | return err; | |
3755 | } | |
3756 | ||
3757 | /* | |
2c016dc2 | 3758 | * helper to find next unprocessed extent |
5d4f98a2 YZ |
3759 | */ |
3760 | static noinline_for_stack | |
147d256e | 3761 | int find_next_extent(struct reloc_control *rc, struct btrfs_path *path, |
3fd0a558 | 3762 | struct btrfs_key *extent_key) |
5d4f98a2 | 3763 | { |
0b246afa | 3764 | struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; |
5d4f98a2 YZ |
3765 | struct btrfs_key key; |
3766 | struct extent_buffer *leaf; | |
3767 | u64 start, end, last; | |
3768 | int ret; | |
3769 | ||
3770 | last = rc->block_group->key.objectid + rc->block_group->key.offset; | |
3771 | while (1) { | |
3772 | cond_resched(); | |
3773 | if (rc->search_start >= last) { | |
3774 | ret = 1; | |
3775 | break; | |
3776 | } | |
3777 | ||
3778 | key.objectid = rc->search_start; | |
3779 | key.type = BTRFS_EXTENT_ITEM_KEY; | |
3780 | key.offset = 0; | |
3781 | ||
3782 | path->search_commit_root = 1; | |
3783 | path->skip_locking = 1; | |
3784 | ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, | |
3785 | 0, 0); | |
3786 | if (ret < 0) | |
3787 | break; | |
3788 | next: | |
3789 | leaf = path->nodes[0]; | |
3790 | if (path->slots[0] >= btrfs_header_nritems(leaf)) { | |
3791 | ret = btrfs_next_leaf(rc->extent_root, path); | |
3792 | if (ret != 0) | |
3793 | break; | |
3794 | leaf = path->nodes[0]; | |
3795 | } | |
3796 | ||
3797 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
3798 | if (key.objectid >= last) { | |
3799 | ret = 1; | |
3800 | break; | |
3801 | } | |
3802 | ||
3173a18f JB |
3803 | if (key.type != BTRFS_EXTENT_ITEM_KEY && |
3804 | key.type != BTRFS_METADATA_ITEM_KEY) { | |
3805 | path->slots[0]++; | |
3806 | goto next; | |
3807 | } | |
3808 | ||
3809 | if (key.type == BTRFS_EXTENT_ITEM_KEY && | |
5d4f98a2 YZ |
3810 | key.objectid + key.offset <= rc->search_start) { |
3811 | path->slots[0]++; | |
3812 | goto next; | |
3813 | } | |
3814 | ||
3173a18f | 3815 | if (key.type == BTRFS_METADATA_ITEM_KEY && |
0b246afa | 3816 | key.objectid + fs_info->nodesize <= |
3173a18f JB |
3817 | rc->search_start) { |
3818 | path->slots[0]++; | |
3819 | goto next; | |
3820 | } | |
3821 | ||
5d4f98a2 YZ |
3822 | ret = find_first_extent_bit(&rc->processed_blocks, |
3823 | key.objectid, &start, &end, | |
e6138876 | 3824 | EXTENT_DIRTY, NULL); |
5d4f98a2 YZ |
3825 | |
3826 | if (ret == 0 && start <= key.objectid) { | |
b3b4aa74 | 3827 | btrfs_release_path(path); |
5d4f98a2 YZ |
3828 | rc->search_start = end + 1; |
3829 | } else { | |
3173a18f JB |
3830 | if (key.type == BTRFS_EXTENT_ITEM_KEY) |
3831 | rc->search_start = key.objectid + key.offset; | |
3832 | else | |
3833 | rc->search_start = key.objectid + | |
0b246afa | 3834 | fs_info->nodesize; |
3fd0a558 | 3835 | memcpy(extent_key, &key, sizeof(key)); |
5d4f98a2 YZ |
3836 | return 0; |
3837 | } | |
3838 | } | |
b3b4aa74 | 3839 | btrfs_release_path(path); |
5d4f98a2 YZ |
3840 | return ret; |
3841 | } | |
3842 | ||
3843 | static void set_reloc_control(struct reloc_control *rc) | |
3844 | { | |
3845 | struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; | |
7585717f CM |
3846 | |
3847 | mutex_lock(&fs_info->reloc_mutex); | |
5d4f98a2 | 3848 | fs_info->reloc_ctl = rc; |
7585717f | 3849 | mutex_unlock(&fs_info->reloc_mutex); |
5d4f98a2 YZ |
3850 | } |
3851 | ||
3852 | static void unset_reloc_control(struct reloc_control *rc) | |
3853 | { | |
3854 | struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; | |
7585717f CM |
3855 | |
3856 | mutex_lock(&fs_info->reloc_mutex); | |
5d4f98a2 | 3857 | fs_info->reloc_ctl = NULL; |
7585717f | 3858 | mutex_unlock(&fs_info->reloc_mutex); |
5d4f98a2 YZ |
3859 | } |
3860 | ||
3861 | static int check_extent_flags(u64 flags) | |
3862 | { | |
3863 | if ((flags & BTRFS_EXTENT_FLAG_DATA) && | |
3864 | (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) | |
3865 | return 1; | |
3866 | if (!(flags & BTRFS_EXTENT_FLAG_DATA) && | |
3867 | !(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) | |
3868 | return 1; | |
3869 | if ((flags & BTRFS_EXTENT_FLAG_DATA) && | |
3870 | (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) | |
3871 | return 1; | |
3872 | return 0; | |
3873 | } | |
3874 | ||
3fd0a558 YZ |
3875 | static noinline_for_stack |
3876 | int prepare_to_relocate(struct reloc_control *rc) | |
3877 | { | |
3878 | struct btrfs_trans_handle *trans; | |
ac2fabac | 3879 | int ret; |
3fd0a558 | 3880 | |
2ff7e61e | 3881 | rc->block_rsv = btrfs_alloc_block_rsv(rc->extent_root->fs_info, |
66d8f3dd | 3882 | BTRFS_BLOCK_RSV_TEMP); |
3fd0a558 YZ |
3883 | if (!rc->block_rsv) |
3884 | return -ENOMEM; | |
3885 | ||
3fd0a558 YZ |
3886 | memset(&rc->cluster, 0, sizeof(rc->cluster)); |
3887 | rc->search_start = rc->block_group->key.objectid; | |
3888 | rc->extents_found = 0; | |
3889 | rc->nodes_relocated = 0; | |
3890 | rc->merging_rsv_size = 0; | |
0647bf56 | 3891 | rc->reserved_bytes = 0; |
da17066c | 3892 | rc->block_rsv->size = rc->extent_root->fs_info->nodesize * |
0647bf56 | 3893 | RELOCATION_RESERVED_NODES; |
ac2fabac JB |
3894 | ret = btrfs_block_rsv_refill(rc->extent_root, |
3895 | rc->block_rsv, rc->block_rsv->size, | |
3896 | BTRFS_RESERVE_FLUSH_ALL); | |
3897 | if (ret) | |
3898 | return ret; | |
3fd0a558 YZ |
3899 | |
3900 | rc->create_reloc_tree = 1; | |
3901 | set_reloc_control(rc); | |
3902 | ||
7a7eaa40 | 3903 | trans = btrfs_join_transaction(rc->extent_root); |
28818947 LB |
3904 | if (IS_ERR(trans)) { |
3905 | unset_reloc_control(rc); | |
3906 | /* | |
3907 | * extent tree is not a ref_cow tree and has no reloc_root to | |
3908 | * cleanup. And callers are responsible to free the above | |
3909 | * block rsv. | |
3910 | */ | |
3911 | return PTR_ERR(trans); | |
3912 | } | |
3a45bb20 | 3913 | btrfs_commit_transaction(trans); |
3fd0a558 YZ |
3914 | return 0; |
3915 | } | |
76dda93c | 3916 | |
5d4f98a2 YZ |
3917 | static noinline_for_stack int relocate_block_group(struct reloc_control *rc) |
3918 | { | |
2ff7e61e | 3919 | struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; |
5d4f98a2 YZ |
3920 | struct rb_root blocks = RB_ROOT; |
3921 | struct btrfs_key key; | |
3922 | struct btrfs_trans_handle *trans = NULL; | |
3923 | struct btrfs_path *path; | |
3924 | struct btrfs_extent_item *ei; | |
5d4f98a2 YZ |
3925 | u64 flags; |
3926 | u32 item_size; | |
3927 | int ret; | |
3928 | int err = 0; | |
c87f08ca | 3929 | int progress = 0; |
5d4f98a2 YZ |
3930 | |
3931 | path = btrfs_alloc_path(); | |
3fd0a558 | 3932 | if (!path) |
5d4f98a2 | 3933 | return -ENOMEM; |
e4058b54 | 3934 | path->reada = READA_FORWARD; |
5d4f98a2 | 3935 | |
3fd0a558 YZ |
3936 | ret = prepare_to_relocate(rc); |
3937 | if (ret) { | |
3938 | err = ret; | |
3939 | goto out_free; | |
3940 | } | |
5d4f98a2 YZ |
3941 | |
3942 | while (1) { | |
0647bf56 WS |
3943 | rc->reserved_bytes = 0; |
3944 | ret = btrfs_block_rsv_refill(rc->extent_root, | |
3945 | rc->block_rsv, rc->block_rsv->size, | |
3946 | BTRFS_RESERVE_FLUSH_ALL); | |
3947 | if (ret) { | |
3948 | err = ret; | |
3949 | break; | |
3950 | } | |
c87f08ca | 3951 | progress++; |
a22285a6 | 3952 | trans = btrfs_start_transaction(rc->extent_root, 0); |
0f788c58 LB |
3953 | if (IS_ERR(trans)) { |
3954 | err = PTR_ERR(trans); | |
3955 | trans = NULL; | |
3956 | break; | |
3957 | } | |
c87f08ca | 3958 | restart: |
3fd0a558 | 3959 | if (update_backref_cache(trans, &rc->backref_cache)) { |
3a45bb20 | 3960 | btrfs_end_transaction(trans); |
42a657f5 | 3961 | trans = NULL; |
3fd0a558 YZ |
3962 | continue; |
3963 | } | |
3964 | ||
147d256e | 3965 | ret = find_next_extent(rc, path, &key); |
5d4f98a2 YZ |
3966 | if (ret < 0) |
3967 | err = ret; | |
3968 | if (ret != 0) | |
3969 | break; | |
3970 | ||
3971 | rc->extents_found++; | |
3972 | ||
3973 | ei = btrfs_item_ptr(path->nodes[0], path->slots[0], | |
3974 | struct btrfs_extent_item); | |
3fd0a558 | 3975 | item_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]); |
5d4f98a2 YZ |
3976 | if (item_size >= sizeof(*ei)) { |
3977 | flags = btrfs_extent_flags(path->nodes[0], ei); | |
3978 | ret = check_extent_flags(flags); | |
3979 | BUG_ON(ret); | |
6d8ff4e4 | 3980 | } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) { |
ba3c2b19 NB |
3981 | err = -EINVAL; |
3982 | btrfs_print_v0_err(trans->fs_info); | |
3983 | btrfs_abort_transaction(trans, err); | |
3984 | break; | |
5d4f98a2 | 3985 | } else { |
5d4f98a2 | 3986 | BUG(); |
5d4f98a2 YZ |
3987 | } |
3988 | ||
3989 | if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { | |
3990 | ret = add_tree_block(rc, &key, path, &blocks); | |
3991 | } else if (rc->stage == UPDATE_DATA_PTRS && | |
3fd0a558 | 3992 | (flags & BTRFS_EXTENT_FLAG_DATA)) { |
5d4f98a2 YZ |
3993 | ret = add_data_references(rc, &key, path, &blocks); |
3994 | } else { | |
b3b4aa74 | 3995 | btrfs_release_path(path); |
5d4f98a2 YZ |
3996 | ret = 0; |
3997 | } | |
3998 | if (ret < 0) { | |
3fd0a558 | 3999 | err = ret; |
5d4f98a2 YZ |
4000 | break; |
4001 | } | |
4002 | ||
4003 | if (!RB_EMPTY_ROOT(&blocks)) { | |
4004 | ret = relocate_tree_blocks(trans, rc, &blocks); | |
4005 | if (ret < 0) { | |
1708cc57 WS |
4006 | /* |
4007 | * if we fail to relocate tree blocks, force to update | |
4008 | * backref cache when committing transaction. | |
4009 | */ | |
4010 | rc->backref_cache.last_trans = trans->transid - 1; | |
4011 | ||
3fd0a558 YZ |
4012 | if (ret != -EAGAIN) { |
4013 | err = ret; | |
4014 | break; | |
4015 | } | |
4016 | rc->extents_found--; | |
4017 | rc->search_start = key.objectid; | |
4018 | } | |
4019 | } | |
4020 | ||
3a45bb20 | 4021 | btrfs_end_transaction_throttle(trans); |
2ff7e61e | 4022 | btrfs_btree_balance_dirty(fs_info); |
5d4f98a2 | 4023 | trans = NULL; |
5d4f98a2 YZ |
4024 | |
4025 | if (rc->stage == MOVE_DATA_EXTENTS && | |
4026 | (flags & BTRFS_EXTENT_FLAG_DATA)) { | |
4027 | rc->found_file_extent = 1; | |
0257bb82 | 4028 | ret = relocate_data_extent(rc->data_inode, |
3fd0a558 | 4029 | &key, &rc->cluster); |
5d4f98a2 YZ |
4030 | if (ret < 0) { |
4031 | err = ret; | |
4032 | break; | |
4033 | } | |
4034 | } | |
4035 | } | |
c87f08ca | 4036 | if (trans && progress && err == -ENOSPC) { |
43a7e99d | 4037 | ret = btrfs_force_chunk_alloc(trans, rc->block_group->flags); |
9689457b | 4038 | if (ret == 1) { |
c87f08ca CM |
4039 | err = 0; |
4040 | progress = 0; | |
4041 | goto restart; | |
4042 | } | |
4043 | } | |
3fd0a558 | 4044 | |
b3b4aa74 | 4045 | btrfs_release_path(path); |
91166212 | 4046 | clear_extent_bits(&rc->processed_blocks, 0, (u64)-1, EXTENT_DIRTY); |
5d4f98a2 YZ |
4047 | |
4048 | if (trans) { | |
3a45bb20 | 4049 | btrfs_end_transaction_throttle(trans); |
2ff7e61e | 4050 | btrfs_btree_balance_dirty(fs_info); |
5d4f98a2 YZ |
4051 | } |
4052 | ||
0257bb82 | 4053 | if (!err) { |
3fd0a558 YZ |
4054 | ret = relocate_file_extent_cluster(rc->data_inode, |
4055 | &rc->cluster); | |
0257bb82 YZ |
4056 | if (ret < 0) |
4057 | err = ret; | |
4058 | } | |
4059 | ||
3fd0a558 YZ |
4060 | rc->create_reloc_tree = 0; |
4061 | set_reloc_control(rc); | |
0257bb82 | 4062 | |
3fd0a558 | 4063 | backref_cache_cleanup(&rc->backref_cache); |
2ff7e61e | 4064 | btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1); |
5d4f98a2 | 4065 | |
3fd0a558 | 4066 | err = prepare_to_merge(rc, err); |
5d4f98a2 YZ |
4067 | |
4068 | merge_reloc_roots(rc); | |
4069 | ||
3fd0a558 | 4070 | rc->merge_reloc_tree = 0; |
5d4f98a2 | 4071 | unset_reloc_control(rc); |
2ff7e61e | 4072 | btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1); |
5d4f98a2 YZ |
4073 | |
4074 | /* get rid of pinned extents */ | |
7a7eaa40 | 4075 | trans = btrfs_join_transaction(rc->extent_root); |
62b99540 | 4076 | if (IS_ERR(trans)) { |
3612b495 | 4077 | err = PTR_ERR(trans); |
62b99540 QW |
4078 | goto out_free; |
4079 | } | |
3a45bb20 | 4080 | btrfs_commit_transaction(trans); |
3fd0a558 | 4081 | out_free: |
2ff7e61e | 4082 | btrfs_free_block_rsv(fs_info, rc->block_rsv); |
3fd0a558 | 4083 | btrfs_free_path(path); |
5d4f98a2 YZ |
4084 | return err; |
4085 | } | |
4086 | ||
4087 | static int __insert_orphan_inode(struct btrfs_trans_handle *trans, | |
0257bb82 | 4088 | struct btrfs_root *root, u64 objectid) |
5d4f98a2 YZ |
4089 | { |
4090 | struct btrfs_path *path; | |
4091 | struct btrfs_inode_item *item; | |
4092 | struct extent_buffer *leaf; | |
4093 | int ret; | |
4094 | ||
4095 | path = btrfs_alloc_path(); | |
4096 | if (!path) | |
4097 | return -ENOMEM; | |
4098 | ||
4099 | ret = btrfs_insert_empty_inode(trans, root, path, objectid); | |
4100 | if (ret) | |
4101 | goto out; | |
4102 | ||
4103 | leaf = path->nodes[0]; | |
4104 | item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_inode_item); | |
b159fa28 | 4105 | memzero_extent_buffer(leaf, (unsigned long)item, sizeof(*item)); |
5d4f98a2 | 4106 | btrfs_set_inode_generation(leaf, item, 1); |
0257bb82 | 4107 | btrfs_set_inode_size(leaf, item, 0); |
5d4f98a2 | 4108 | btrfs_set_inode_mode(leaf, item, S_IFREG | 0600); |
3fd0a558 YZ |
4109 | btrfs_set_inode_flags(leaf, item, BTRFS_INODE_NOCOMPRESS | |
4110 | BTRFS_INODE_PREALLOC); | |
5d4f98a2 | 4111 | btrfs_mark_buffer_dirty(leaf); |
5d4f98a2 YZ |
4112 | out: |
4113 | btrfs_free_path(path); | |
4114 | return ret; | |
4115 | } | |
4116 | ||
4117 | /* | |
4118 | * helper to create inode for data relocation. | |
4119 | * the inode is in data relocation tree and its link count is 0 | |
4120 | */ | |
3fd0a558 YZ |
4121 | static noinline_for_stack |
4122 | struct inode *create_reloc_inode(struct btrfs_fs_info *fs_info, | |
4123 | struct btrfs_block_group_cache *group) | |
5d4f98a2 YZ |
4124 | { |
4125 | struct inode *inode = NULL; | |
4126 | struct btrfs_trans_handle *trans; | |
4127 | struct btrfs_root *root; | |
4128 | struct btrfs_key key; | |
4624900d | 4129 | u64 objectid; |
5d4f98a2 YZ |
4130 | int err = 0; |
4131 | ||
4132 | root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); | |
4133 | if (IS_ERR(root)) | |
4134 | return ERR_CAST(root); | |
4135 | ||
a22285a6 | 4136 | trans = btrfs_start_transaction(root, 6); |
3fd0a558 YZ |
4137 | if (IS_ERR(trans)) |
4138 | return ERR_CAST(trans); | |
5d4f98a2 | 4139 | |
581bb050 | 4140 | err = btrfs_find_free_objectid(root, &objectid); |
5d4f98a2 YZ |
4141 | if (err) |
4142 | goto out; | |
4143 | ||
0257bb82 | 4144 | err = __insert_orphan_inode(trans, root, objectid); |
5d4f98a2 YZ |
4145 | BUG_ON(err); |
4146 | ||
4147 | key.objectid = objectid; | |
4148 | key.type = BTRFS_INODE_ITEM_KEY; | |
4149 | key.offset = 0; | |
0b246afa | 4150 | inode = btrfs_iget(fs_info->sb, &key, root, NULL); |
2e19f1f9 | 4151 | BUG_ON(IS_ERR(inode)); |
5d4f98a2 YZ |
4152 | BTRFS_I(inode)->index_cnt = group->key.objectid; |
4153 | ||
73f2e545 | 4154 | err = btrfs_orphan_add(trans, BTRFS_I(inode)); |
5d4f98a2 | 4155 | out: |
3a45bb20 | 4156 | btrfs_end_transaction(trans); |
2ff7e61e | 4157 | btrfs_btree_balance_dirty(fs_info); |
5d4f98a2 YZ |
4158 | if (err) { |
4159 | if (inode) | |
4160 | iput(inode); | |
4161 | inode = ERR_PTR(err); | |
4162 | } | |
4163 | return inode; | |
4164 | } | |
4165 | ||
9113493e | 4166 | static struct reloc_control *alloc_reloc_control(void) |
3fd0a558 YZ |
4167 | { |
4168 | struct reloc_control *rc; | |
4169 | ||
4170 | rc = kzalloc(sizeof(*rc), GFP_NOFS); | |
4171 | if (!rc) | |
4172 | return NULL; | |
4173 | ||
4174 | INIT_LIST_HEAD(&rc->reloc_roots); | |
4175 | backref_cache_init(&rc->backref_cache); | |
4176 | mapping_tree_init(&rc->reloc_root_tree); | |
c6100a4b | 4177 | extent_io_tree_init(&rc->processed_blocks, NULL); |
3fd0a558 YZ |
4178 | return rc; |
4179 | } | |
4180 | ||
ebce0e01 AB |
4181 | /* |
4182 | * Print the block group being relocated | |
4183 | */ | |
4184 | static void describe_relocation(struct btrfs_fs_info *fs_info, | |
4185 | struct btrfs_block_group_cache *block_group) | |
4186 | { | |
f89e09cf | 4187 | char buf[128] = {'\0'}; |
ebce0e01 | 4188 | |
f89e09cf | 4189 | btrfs_describe_block_groups(block_group->flags, buf, sizeof(buf)); |
ebce0e01 AB |
4190 | |
4191 | btrfs_info(fs_info, | |
4192 | "relocating block group %llu flags %s", | |
f89e09cf | 4193 | block_group->key.objectid, buf); |
ebce0e01 AB |
4194 | } |
4195 | ||
5d4f98a2 YZ |
4196 | /* |
4197 | * function to relocate all extents in a block group. | |
4198 | */ | |
6bccf3ab | 4199 | int btrfs_relocate_block_group(struct btrfs_fs_info *fs_info, u64 group_start) |
5d4f98a2 | 4200 | { |
eede2bf3 | 4201 | struct btrfs_block_group_cache *bg; |
6bccf3ab | 4202 | struct btrfs_root *extent_root = fs_info->extent_root; |
5d4f98a2 | 4203 | struct reloc_control *rc; |
0af3d00b JB |
4204 | struct inode *inode; |
4205 | struct btrfs_path *path; | |
5d4f98a2 | 4206 | int ret; |
f0486c68 | 4207 | int rw = 0; |
5d4f98a2 YZ |
4208 | int err = 0; |
4209 | ||
eede2bf3 OS |
4210 | bg = btrfs_lookup_block_group(fs_info, group_start); |
4211 | if (!bg) | |
4212 | return -ENOENT; | |
4213 | ||
4214 | if (btrfs_pinned_by_swapfile(fs_info, bg)) { | |
4215 | btrfs_put_block_group(bg); | |
4216 | return -ETXTBSY; | |
4217 | } | |
4218 | ||
9113493e | 4219 | rc = alloc_reloc_control(); |
eede2bf3 OS |
4220 | if (!rc) { |
4221 | btrfs_put_block_group(bg); | |
5d4f98a2 | 4222 | return -ENOMEM; |
eede2bf3 | 4223 | } |
5d4f98a2 | 4224 | |
f0486c68 | 4225 | rc->extent_root = extent_root; |
eede2bf3 | 4226 | rc->block_group = bg; |
5d4f98a2 | 4227 | |
c83488af | 4228 | ret = btrfs_inc_block_group_ro(rc->block_group); |
868f401a Z |
4229 | if (ret) { |
4230 | err = ret; | |
4231 | goto out; | |
f0486c68 | 4232 | } |
868f401a | 4233 | rw = 1; |
f0486c68 | 4234 | |
0af3d00b JB |
4235 | path = btrfs_alloc_path(); |
4236 | if (!path) { | |
4237 | err = -ENOMEM; | |
4238 | goto out; | |
4239 | } | |
4240 | ||
77ab86bf | 4241 | inode = lookup_free_space_inode(fs_info, rc->block_group, path); |
0af3d00b JB |
4242 | btrfs_free_path(path); |
4243 | ||
4244 | if (!IS_ERR(inode)) | |
1bbc621e | 4245 | ret = delete_block_group_cache(fs_info, rc->block_group, inode, 0); |
0af3d00b JB |
4246 | else |
4247 | ret = PTR_ERR(inode); | |
4248 | ||
4249 | if (ret && ret != -ENOENT) { | |
4250 | err = ret; | |
4251 | goto out; | |
4252 | } | |
4253 | ||
5d4f98a2 YZ |
4254 | rc->data_inode = create_reloc_inode(fs_info, rc->block_group); |
4255 | if (IS_ERR(rc->data_inode)) { | |
4256 | err = PTR_ERR(rc->data_inode); | |
4257 | rc->data_inode = NULL; | |
4258 | goto out; | |
4259 | } | |
4260 | ||
0b246afa | 4261 | describe_relocation(fs_info, rc->block_group); |
5d4f98a2 | 4262 | |
9cfa3e34 | 4263 | btrfs_wait_block_group_reservations(rc->block_group); |
f78c436c | 4264 | btrfs_wait_nocow_writers(rc->block_group); |
6374e57a | 4265 | btrfs_wait_ordered_roots(fs_info, U64_MAX, |
578def7c FM |
4266 | rc->block_group->key.objectid, |
4267 | rc->block_group->key.offset); | |
5d4f98a2 YZ |
4268 | |
4269 | while (1) { | |
76dda93c | 4270 | mutex_lock(&fs_info->cleaner_mutex); |
5d4f98a2 | 4271 | ret = relocate_block_group(rc); |
76dda93c | 4272 | mutex_unlock(&fs_info->cleaner_mutex); |
5d4f98a2 YZ |
4273 | if (ret < 0) { |
4274 | err = ret; | |
3fd0a558 | 4275 | goto out; |
5d4f98a2 YZ |
4276 | } |
4277 | ||
4278 | if (rc->extents_found == 0) | |
4279 | break; | |
4280 | ||
0b246afa | 4281 | btrfs_info(fs_info, "found %llu extents", rc->extents_found); |
5d4f98a2 YZ |
4282 | |
4283 | if (rc->stage == MOVE_DATA_EXTENTS && rc->found_file_extent) { | |
0ef8b726 JB |
4284 | ret = btrfs_wait_ordered_range(rc->data_inode, 0, |
4285 | (u64)-1); | |
4286 | if (ret) { | |
4287 | err = ret; | |
4288 | goto out; | |
4289 | } | |
5d4f98a2 YZ |
4290 | invalidate_mapping_pages(rc->data_inode->i_mapping, |
4291 | 0, -1); | |
4292 | rc->stage = UPDATE_DATA_PTRS; | |
5d4f98a2 YZ |
4293 | } |
4294 | } | |
4295 | ||
5d4f98a2 YZ |
4296 | WARN_ON(rc->block_group->pinned > 0); |
4297 | WARN_ON(rc->block_group->reserved > 0); | |
4298 | WARN_ON(btrfs_block_group_used(&rc->block_group->item) > 0); | |
4299 | out: | |
f0486c68 | 4300 | if (err && rw) |
2ff7e61e | 4301 | btrfs_dec_block_group_ro(rc->block_group); |
5d4f98a2 | 4302 | iput(rc->data_inode); |
5d4f98a2 YZ |
4303 | btrfs_put_block_group(rc->block_group); |
4304 | kfree(rc); | |
4305 | return err; | |
4306 | } | |
4307 | ||
76dda93c YZ |
4308 | static noinline_for_stack int mark_garbage_root(struct btrfs_root *root) |
4309 | { | |
0b246afa | 4310 | struct btrfs_fs_info *fs_info = root->fs_info; |
76dda93c | 4311 | struct btrfs_trans_handle *trans; |
79787eaa | 4312 | int ret, err; |
76dda93c | 4313 | |
0b246afa | 4314 | trans = btrfs_start_transaction(fs_info->tree_root, 0); |
79787eaa JM |
4315 | if (IS_ERR(trans)) |
4316 | return PTR_ERR(trans); | |
76dda93c YZ |
4317 | |
4318 | memset(&root->root_item.drop_progress, 0, | |
4319 | sizeof(root->root_item.drop_progress)); | |
4320 | root->root_item.drop_level = 0; | |
4321 | btrfs_set_root_refs(&root->root_item, 0); | |
0b246afa | 4322 | ret = btrfs_update_root(trans, fs_info->tree_root, |
76dda93c | 4323 | &root->root_key, &root->root_item); |
76dda93c | 4324 | |
3a45bb20 | 4325 | err = btrfs_end_transaction(trans); |
79787eaa JM |
4326 | if (err) |
4327 | return err; | |
4328 | return ret; | |
76dda93c YZ |
4329 | } |
4330 | ||
5d4f98a2 YZ |
4331 | /* |
4332 | * recover relocation interrupted by system crash. | |
4333 | * | |
4334 | * this function resumes merging reloc trees with corresponding fs trees. | |
4335 | * this is important for keeping the sharing of tree blocks | |
4336 | */ | |
4337 | int btrfs_recover_relocation(struct btrfs_root *root) | |
4338 | { | |
0b246afa | 4339 | struct btrfs_fs_info *fs_info = root->fs_info; |
5d4f98a2 YZ |
4340 | LIST_HEAD(reloc_roots); |
4341 | struct btrfs_key key; | |
4342 | struct btrfs_root *fs_root; | |
4343 | struct btrfs_root *reloc_root; | |
4344 | struct btrfs_path *path; | |
4345 | struct extent_buffer *leaf; | |
4346 | struct reloc_control *rc = NULL; | |
4347 | struct btrfs_trans_handle *trans; | |
4348 | int ret; | |
4349 | int err = 0; | |
4350 | ||
4351 | path = btrfs_alloc_path(); | |
4352 | if (!path) | |
4353 | return -ENOMEM; | |
e4058b54 | 4354 | path->reada = READA_BACK; |
5d4f98a2 YZ |
4355 | |
4356 | key.objectid = BTRFS_TREE_RELOC_OBJECTID; | |
4357 | key.type = BTRFS_ROOT_ITEM_KEY; | |
4358 | key.offset = (u64)-1; | |
4359 | ||
4360 | while (1) { | |
0b246afa | 4361 | ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, |
5d4f98a2 YZ |
4362 | path, 0, 0); |
4363 | if (ret < 0) { | |
4364 | err = ret; | |
4365 | goto out; | |
4366 | } | |
4367 | if (ret > 0) { | |
4368 | if (path->slots[0] == 0) | |
4369 | break; | |
4370 | path->slots[0]--; | |
4371 | } | |
4372 | leaf = path->nodes[0]; | |
4373 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
b3b4aa74 | 4374 | btrfs_release_path(path); |
5d4f98a2 YZ |
4375 | |
4376 | if (key.objectid != BTRFS_TREE_RELOC_OBJECTID || | |
4377 | key.type != BTRFS_ROOT_ITEM_KEY) | |
4378 | break; | |
4379 | ||
cb517eab | 4380 | reloc_root = btrfs_read_fs_root(root, &key); |
5d4f98a2 YZ |
4381 | if (IS_ERR(reloc_root)) { |
4382 | err = PTR_ERR(reloc_root); | |
4383 | goto out; | |
4384 | } | |
4385 | ||
4386 | list_add(&reloc_root->root_list, &reloc_roots); | |
4387 | ||
4388 | if (btrfs_root_refs(&reloc_root->root_item) > 0) { | |
0b246afa | 4389 | fs_root = read_fs_root(fs_info, |
5d4f98a2 YZ |
4390 | reloc_root->root_key.offset); |
4391 | if (IS_ERR(fs_root)) { | |
76dda93c YZ |
4392 | ret = PTR_ERR(fs_root); |
4393 | if (ret != -ENOENT) { | |
4394 | err = ret; | |
4395 | goto out; | |
4396 | } | |
79787eaa JM |
4397 | ret = mark_garbage_root(reloc_root); |
4398 | if (ret < 0) { | |
4399 | err = ret; | |
4400 | goto out; | |
4401 | } | |
5d4f98a2 YZ |
4402 | } |
4403 | } | |
4404 | ||
4405 | if (key.offset == 0) | |
4406 | break; | |
4407 | ||
4408 | key.offset--; | |
4409 | } | |
b3b4aa74 | 4410 | btrfs_release_path(path); |
5d4f98a2 YZ |
4411 | |
4412 | if (list_empty(&reloc_roots)) | |
4413 | goto out; | |
4414 | ||
9113493e | 4415 | rc = alloc_reloc_control(); |
5d4f98a2 YZ |
4416 | if (!rc) { |
4417 | err = -ENOMEM; | |
4418 | goto out; | |
4419 | } | |
4420 | ||
0b246afa | 4421 | rc->extent_root = fs_info->extent_root; |
5d4f98a2 YZ |
4422 | |
4423 | set_reloc_control(rc); | |
4424 | ||
7a7eaa40 | 4425 | trans = btrfs_join_transaction(rc->extent_root); |
3612b495 TI |
4426 | if (IS_ERR(trans)) { |
4427 | unset_reloc_control(rc); | |
4428 | err = PTR_ERR(trans); | |
4429 | goto out_free; | |
4430 | } | |
3fd0a558 YZ |
4431 | |
4432 | rc->merge_reloc_tree = 1; | |
4433 | ||
5d4f98a2 YZ |
4434 | while (!list_empty(&reloc_roots)) { |
4435 | reloc_root = list_entry(reloc_roots.next, | |
4436 | struct btrfs_root, root_list); | |
4437 | list_del(&reloc_root->root_list); | |
4438 | ||
4439 | if (btrfs_root_refs(&reloc_root->root_item) == 0) { | |
4440 | list_add_tail(&reloc_root->root_list, | |
4441 | &rc->reloc_roots); | |
4442 | continue; | |
4443 | } | |
4444 | ||
0b246afa | 4445 | fs_root = read_fs_root(fs_info, reloc_root->root_key.offset); |
79787eaa JM |
4446 | if (IS_ERR(fs_root)) { |
4447 | err = PTR_ERR(fs_root); | |
4448 | goto out_free; | |
4449 | } | |
5d4f98a2 | 4450 | |
ffd7b339 | 4451 | err = __add_reloc_root(reloc_root); |
79787eaa | 4452 | BUG_ON(err < 0); /* -ENOMEM or logic error */ |
5d4f98a2 YZ |
4453 | fs_root->reloc_root = reloc_root; |
4454 | } | |
4455 | ||
3a45bb20 | 4456 | err = btrfs_commit_transaction(trans); |
79787eaa JM |
4457 | if (err) |
4458 | goto out_free; | |
5d4f98a2 YZ |
4459 | |
4460 | merge_reloc_roots(rc); | |
4461 | ||
4462 | unset_reloc_control(rc); | |
4463 | ||
7a7eaa40 | 4464 | trans = btrfs_join_transaction(rc->extent_root); |
62b99540 | 4465 | if (IS_ERR(trans)) { |
3612b495 | 4466 | err = PTR_ERR(trans); |
62b99540 QW |
4467 | goto out_free; |
4468 | } | |
3a45bb20 | 4469 | err = btrfs_commit_transaction(trans); |
3612b495 | 4470 | out_free: |
3fd0a558 | 4471 | kfree(rc); |
3612b495 | 4472 | out: |
aca1bba6 LB |
4473 | if (!list_empty(&reloc_roots)) |
4474 | free_reloc_roots(&reloc_roots); | |
4475 | ||
5d4f98a2 YZ |
4476 | btrfs_free_path(path); |
4477 | ||
4478 | if (err == 0) { | |
4479 | /* cleanup orphan inode in data relocation tree */ | |
0b246afa | 4480 | fs_root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); |
5d4f98a2 YZ |
4481 | if (IS_ERR(fs_root)) |
4482 | err = PTR_ERR(fs_root); | |
d7ce5843 | 4483 | else |
66b4ffd1 | 4484 | err = btrfs_orphan_cleanup(fs_root); |
5d4f98a2 YZ |
4485 | } |
4486 | return err; | |
4487 | } | |
4488 | ||
4489 | /* | |
4490 | * helper to add ordered checksum for data relocation. | |
4491 | * | |
4492 | * cloning checksum properly handles the nodatasum extents. | |
4493 | * it also saves CPU time to re-calculate the checksum. | |
4494 | */ | |
4495 | int btrfs_reloc_clone_csums(struct inode *inode, u64 file_pos, u64 len) | |
4496 | { | |
0b246afa | 4497 | struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); |
5d4f98a2 | 4498 | struct btrfs_ordered_sum *sums; |
5d4f98a2 | 4499 | struct btrfs_ordered_extent *ordered; |
5d4f98a2 YZ |
4500 | int ret; |
4501 | u64 disk_bytenr; | |
4577b014 | 4502 | u64 new_bytenr; |
5d4f98a2 YZ |
4503 | LIST_HEAD(list); |
4504 | ||
4505 | ordered = btrfs_lookup_ordered_extent(inode, file_pos); | |
4506 | BUG_ON(ordered->file_offset != file_pos || ordered->len != len); | |
4507 | ||
4508 | disk_bytenr = file_pos + BTRFS_I(inode)->index_cnt; | |
0b246afa | 4509 | ret = btrfs_lookup_csums_range(fs_info->csum_root, disk_bytenr, |
a2de733c | 4510 | disk_bytenr + len - 1, &list, 0); |
79787eaa JM |
4511 | if (ret) |
4512 | goto out; | |
5d4f98a2 YZ |
4513 | |
4514 | while (!list_empty(&list)) { | |
4515 | sums = list_entry(list.next, struct btrfs_ordered_sum, list); | |
4516 | list_del_init(&sums->list); | |
4517 | ||
4577b014 JB |
4518 | /* |
4519 | * We need to offset the new_bytenr based on where the csum is. | |
4520 | * We need to do this because we will read in entire prealloc | |
4521 | * extents but we may have written to say the middle of the | |
4522 | * prealloc extent, so we need to make sure the csum goes with | |
4523 | * the right disk offset. | |
4524 | * | |
4525 | * We can do this because the data reloc inode refers strictly | |
4526 | * to the on disk bytes, so we don't have to worry about | |
4527 | * disk_len vs real len like with real inodes since it's all | |
4528 | * disk length. | |
4529 | */ | |
4530 | new_bytenr = ordered->start + (sums->bytenr - disk_bytenr); | |
4531 | sums->bytenr = new_bytenr; | |
5d4f98a2 YZ |
4532 | |
4533 | btrfs_add_ordered_sum(inode, ordered, sums); | |
4534 | } | |
79787eaa | 4535 | out: |
5d4f98a2 | 4536 | btrfs_put_ordered_extent(ordered); |
411fc6bc | 4537 | return ret; |
5d4f98a2 | 4538 | } |
3fd0a558 | 4539 | |
83d4cfd4 JB |
4540 | int btrfs_reloc_cow_block(struct btrfs_trans_handle *trans, |
4541 | struct btrfs_root *root, struct extent_buffer *buf, | |
4542 | struct extent_buffer *cow) | |
3fd0a558 | 4543 | { |
0b246afa | 4544 | struct btrfs_fs_info *fs_info = root->fs_info; |
3fd0a558 YZ |
4545 | struct reloc_control *rc; |
4546 | struct backref_node *node; | |
4547 | int first_cow = 0; | |
4548 | int level; | |
83d4cfd4 | 4549 | int ret = 0; |
3fd0a558 | 4550 | |
0b246afa | 4551 | rc = fs_info->reloc_ctl; |
3fd0a558 | 4552 | if (!rc) |
83d4cfd4 | 4553 | return 0; |
3fd0a558 YZ |
4554 | |
4555 | BUG_ON(rc->stage == UPDATE_DATA_PTRS && | |
4556 | root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID); | |
4557 | ||
c974c464 WS |
4558 | if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { |
4559 | if (buf == root->node) | |
4560 | __update_reloc_root(root, cow->start); | |
4561 | } | |
4562 | ||
3fd0a558 YZ |
4563 | level = btrfs_header_level(buf); |
4564 | if (btrfs_header_generation(buf) <= | |
4565 | btrfs_root_last_snapshot(&root->root_item)) | |
4566 | first_cow = 1; | |
4567 | ||
4568 | if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID && | |
4569 | rc->create_reloc_tree) { | |
4570 | WARN_ON(!first_cow && level == 0); | |
4571 | ||
4572 | node = rc->backref_cache.path[level]; | |
4573 | BUG_ON(node->bytenr != buf->start && | |
4574 | node->new_bytenr != buf->start); | |
4575 | ||
4576 | drop_node_buffer(node); | |
4577 | extent_buffer_get(cow); | |
4578 | node->eb = cow; | |
4579 | node->new_bytenr = cow->start; | |
4580 | ||
4581 | if (!node->pending) { | |
4582 | list_move_tail(&node->list, | |
4583 | &rc->backref_cache.pending[level]); | |
4584 | node->pending = 1; | |
4585 | } | |
4586 | ||
4587 | if (first_cow) | |
4588 | __mark_block_processed(rc, node); | |
4589 | ||
4590 | if (first_cow && level > 0) | |
4591 | rc->nodes_relocated += buf->len; | |
4592 | } | |
4593 | ||
83d4cfd4 | 4594 | if (level == 0 && first_cow && rc->stage == UPDATE_DATA_PTRS) |
3fd0a558 | 4595 | ret = replace_file_extents(trans, rc, root, cow); |
83d4cfd4 | 4596 | return ret; |
3fd0a558 YZ |
4597 | } |
4598 | ||
4599 | /* | |
4600 | * called before creating snapshot. it calculates metadata reservation | |
01327610 | 4601 | * required for relocating tree blocks in the snapshot |
3fd0a558 | 4602 | */ |
147d256e | 4603 | void btrfs_reloc_pre_snapshot(struct btrfs_pending_snapshot *pending, |
3fd0a558 YZ |
4604 | u64 *bytes_to_reserve) |
4605 | { | |
4606 | struct btrfs_root *root; | |
4607 | struct reloc_control *rc; | |
4608 | ||
4609 | root = pending->root; | |
4610 | if (!root->reloc_root) | |
4611 | return; | |
4612 | ||
4613 | rc = root->fs_info->reloc_ctl; | |
4614 | if (!rc->merge_reloc_tree) | |
4615 | return; | |
4616 | ||
4617 | root = root->reloc_root; | |
4618 | BUG_ON(btrfs_root_refs(&root->root_item) == 0); | |
4619 | /* | |
4620 | * relocation is in the stage of merging trees. the space | |
4621 | * used by merging a reloc tree is twice the size of | |
4622 | * relocated tree nodes in the worst case. half for cowing | |
4623 | * the reloc tree, half for cowing the fs tree. the space | |
4624 | * used by cowing the reloc tree will be freed after the | |
4625 | * tree is dropped. if we create snapshot, cowing the fs | |
4626 | * tree may use more space than it frees. so we need | |
4627 | * reserve extra space. | |
4628 | */ | |
4629 | *bytes_to_reserve += rc->nodes_relocated; | |
4630 | } | |
4631 | ||
4632 | /* | |
4633 | * called after snapshot is created. migrate block reservation | |
4634 | * and create reloc root for the newly created snapshot | |
4635 | */ | |
49b25e05 | 4636 | int btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans, |
3fd0a558 YZ |
4637 | struct btrfs_pending_snapshot *pending) |
4638 | { | |
4639 | struct btrfs_root *root = pending->root; | |
4640 | struct btrfs_root *reloc_root; | |
4641 | struct btrfs_root *new_root; | |
4642 | struct reloc_control *rc; | |
4643 | int ret; | |
4644 | ||
4645 | if (!root->reloc_root) | |
49b25e05 | 4646 | return 0; |
3fd0a558 YZ |
4647 | |
4648 | rc = root->fs_info->reloc_ctl; | |
4649 | rc->merging_rsv_size += rc->nodes_relocated; | |
4650 | ||
4651 | if (rc->merge_reloc_tree) { | |
4652 | ret = btrfs_block_rsv_migrate(&pending->block_rsv, | |
4653 | rc->block_rsv, | |
3a584174 | 4654 | rc->nodes_relocated, true); |
49b25e05 JM |
4655 | if (ret) |
4656 | return ret; | |
3fd0a558 YZ |
4657 | } |
4658 | ||
4659 | new_root = pending->snap; | |
4660 | reloc_root = create_reloc_root(trans, root->reloc_root, | |
4661 | new_root->root_key.objectid); | |
49b25e05 JM |
4662 | if (IS_ERR(reloc_root)) |
4663 | return PTR_ERR(reloc_root); | |
3fd0a558 | 4664 | |
ffd7b339 JM |
4665 | ret = __add_reloc_root(reloc_root); |
4666 | BUG_ON(ret < 0); | |
3fd0a558 YZ |
4667 | new_root->reloc_root = reloc_root; |
4668 | ||
49b25e05 | 4669 | if (rc->create_reloc_tree) |
3fd0a558 | 4670 | ret = clone_backref_node(trans, rc, root, reloc_root); |
49b25e05 | 4671 | return ret; |
3fd0a558 | 4672 | } |