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