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