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