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