Commit | Line | Data |
---|---|---|
a542ad1b JS |
1 | /* |
2 | * Copyright (C) 2011 STRATO. 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 | ||
425d17a2 | 19 | #include <linux/vmalloc.h> |
a542ad1b JS |
20 | #include "ctree.h" |
21 | #include "disk-io.h" | |
22 | #include "backref.h" | |
8da6d581 JS |
23 | #include "ulist.h" |
24 | #include "transaction.h" | |
25 | #include "delayed-ref.h" | |
b916a59a | 26 | #include "locking.h" |
a542ad1b | 27 | |
976b1908 JS |
28 | struct extent_inode_elem { |
29 | u64 inum; | |
30 | u64 offset; | |
31 | struct extent_inode_elem *next; | |
32 | }; | |
33 | ||
34 | static int check_extent_in_eb(struct btrfs_key *key, struct extent_buffer *eb, | |
35 | struct btrfs_file_extent_item *fi, | |
36 | u64 extent_item_pos, | |
37 | struct extent_inode_elem **eie) | |
38 | { | |
8ca15e05 | 39 | u64 offset = 0; |
976b1908 JS |
40 | struct extent_inode_elem *e; |
41 | ||
8ca15e05 JB |
42 | if (!btrfs_file_extent_compression(eb, fi) && |
43 | !btrfs_file_extent_encryption(eb, fi) && | |
44 | !btrfs_file_extent_other_encoding(eb, fi)) { | |
45 | u64 data_offset; | |
46 | u64 data_len; | |
976b1908 | 47 | |
8ca15e05 JB |
48 | data_offset = btrfs_file_extent_offset(eb, fi); |
49 | data_len = btrfs_file_extent_num_bytes(eb, fi); | |
50 | ||
51 | if (extent_item_pos < data_offset || | |
52 | extent_item_pos >= data_offset + data_len) | |
53 | return 1; | |
54 | offset = extent_item_pos - data_offset; | |
55 | } | |
976b1908 JS |
56 | |
57 | e = kmalloc(sizeof(*e), GFP_NOFS); | |
58 | if (!e) | |
59 | return -ENOMEM; | |
60 | ||
61 | e->next = *eie; | |
62 | e->inum = key->objectid; | |
8ca15e05 | 63 | e->offset = key->offset + offset; |
976b1908 JS |
64 | *eie = e; |
65 | ||
66 | return 0; | |
67 | } | |
68 | ||
69 | static int find_extent_in_eb(struct extent_buffer *eb, u64 wanted_disk_byte, | |
70 | u64 extent_item_pos, | |
71 | struct extent_inode_elem **eie) | |
72 | { | |
73 | u64 disk_byte; | |
74 | struct btrfs_key key; | |
75 | struct btrfs_file_extent_item *fi; | |
76 | int slot; | |
77 | int nritems; | |
78 | int extent_type; | |
79 | int ret; | |
80 | ||
81 | /* | |
82 | * from the shared data ref, we only have the leaf but we need | |
83 | * the key. thus, we must look into all items and see that we | |
84 | * find one (some) with a reference to our extent item. | |
85 | */ | |
86 | nritems = btrfs_header_nritems(eb); | |
87 | for (slot = 0; slot < nritems; ++slot) { | |
88 | btrfs_item_key_to_cpu(eb, &key, slot); | |
89 | if (key.type != BTRFS_EXTENT_DATA_KEY) | |
90 | continue; | |
91 | fi = btrfs_item_ptr(eb, slot, struct btrfs_file_extent_item); | |
92 | extent_type = btrfs_file_extent_type(eb, fi); | |
93 | if (extent_type == BTRFS_FILE_EXTENT_INLINE) | |
94 | continue; | |
95 | /* don't skip BTRFS_FILE_EXTENT_PREALLOC, we can handle that */ | |
96 | disk_byte = btrfs_file_extent_disk_bytenr(eb, fi); | |
97 | if (disk_byte != wanted_disk_byte) | |
98 | continue; | |
99 | ||
100 | ret = check_extent_in_eb(&key, eb, fi, extent_item_pos, eie); | |
101 | if (ret < 0) | |
102 | return ret; | |
103 | } | |
104 | ||
105 | return 0; | |
106 | } | |
107 | ||
8da6d581 JS |
108 | /* |
109 | * this structure records all encountered refs on the way up to the root | |
110 | */ | |
111 | struct __prelim_ref { | |
112 | struct list_head list; | |
113 | u64 root_id; | |
d5c88b73 | 114 | struct btrfs_key key_for_search; |
8da6d581 JS |
115 | int level; |
116 | int count; | |
3301958b | 117 | struct extent_inode_elem *inode_list; |
8da6d581 JS |
118 | u64 parent; |
119 | u64 wanted_disk_byte; | |
120 | }; | |
121 | ||
b9e9a6cb WS |
122 | static struct kmem_cache *btrfs_prelim_ref_cache; |
123 | ||
124 | int __init btrfs_prelim_ref_init(void) | |
125 | { | |
126 | btrfs_prelim_ref_cache = kmem_cache_create("btrfs_prelim_ref", | |
127 | sizeof(struct __prelim_ref), | |
128 | 0, | |
129 | SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, | |
130 | NULL); | |
131 | if (!btrfs_prelim_ref_cache) | |
132 | return -ENOMEM; | |
133 | return 0; | |
134 | } | |
135 | ||
136 | void btrfs_prelim_ref_exit(void) | |
137 | { | |
138 | if (btrfs_prelim_ref_cache) | |
139 | kmem_cache_destroy(btrfs_prelim_ref_cache); | |
140 | } | |
141 | ||
d5c88b73 JS |
142 | /* |
143 | * the rules for all callers of this function are: | |
144 | * - obtaining the parent is the goal | |
145 | * - if you add a key, you must know that it is a correct key | |
146 | * - if you cannot add the parent or a correct key, then we will look into the | |
147 | * block later to set a correct key | |
148 | * | |
149 | * delayed refs | |
150 | * ============ | |
151 | * backref type | shared | indirect | shared | indirect | |
152 | * information | tree | tree | data | data | |
153 | * --------------------+--------+----------+--------+---------- | |
154 | * parent logical | y | - | - | - | |
155 | * key to resolve | - | y | y | y | |
156 | * tree block logical | - | - | - | - | |
157 | * root for resolving | y | y | y | y | |
158 | * | |
159 | * - column 1: we've the parent -> done | |
160 | * - column 2, 3, 4: we use the key to find the parent | |
161 | * | |
162 | * on disk refs (inline or keyed) | |
163 | * ============================== | |
164 | * backref type | shared | indirect | shared | indirect | |
165 | * information | tree | tree | data | data | |
166 | * --------------------+--------+----------+--------+---------- | |
167 | * parent logical | y | - | y | - | |
168 | * key to resolve | - | - | - | y | |
169 | * tree block logical | y | y | y | y | |
170 | * root for resolving | - | y | y | y | |
171 | * | |
172 | * - column 1, 3: we've the parent -> done | |
173 | * - column 2: we take the first key from the block to find the parent | |
174 | * (see __add_missing_keys) | |
175 | * - column 4: we use the key to find the parent | |
176 | * | |
177 | * additional information that's available but not required to find the parent | |
178 | * block might help in merging entries to gain some speed. | |
179 | */ | |
180 | ||
8da6d581 | 181 | static int __add_prelim_ref(struct list_head *head, u64 root_id, |
d5c88b73 | 182 | struct btrfs_key *key, int level, |
742916b8 WS |
183 | u64 parent, u64 wanted_disk_byte, int count, |
184 | gfp_t gfp_mask) | |
8da6d581 JS |
185 | { |
186 | struct __prelim_ref *ref; | |
187 | ||
48ec4736 LB |
188 | if (root_id == BTRFS_DATA_RELOC_TREE_OBJECTID) |
189 | return 0; | |
190 | ||
b9e9a6cb | 191 | ref = kmem_cache_alloc(btrfs_prelim_ref_cache, gfp_mask); |
8da6d581 JS |
192 | if (!ref) |
193 | return -ENOMEM; | |
194 | ||
195 | ref->root_id = root_id; | |
196 | if (key) | |
d5c88b73 | 197 | ref->key_for_search = *key; |
8da6d581 | 198 | else |
d5c88b73 | 199 | memset(&ref->key_for_search, 0, sizeof(ref->key_for_search)); |
8da6d581 | 200 | |
3301958b | 201 | ref->inode_list = NULL; |
8da6d581 JS |
202 | ref->level = level; |
203 | ref->count = count; | |
204 | ref->parent = parent; | |
205 | ref->wanted_disk_byte = wanted_disk_byte; | |
206 | list_add_tail(&ref->list, head); | |
207 | ||
208 | return 0; | |
209 | } | |
210 | ||
211 | static int add_all_parents(struct btrfs_root *root, struct btrfs_path *path, | |
976b1908 | 212 | struct ulist *parents, int level, |
69bca40d | 213 | struct btrfs_key *key_for_search, u64 time_seq, |
3d7806ec | 214 | u64 wanted_disk_byte, |
976b1908 | 215 | const u64 *extent_item_pos) |
8da6d581 | 216 | { |
69bca40d AB |
217 | int ret = 0; |
218 | int slot; | |
219 | struct extent_buffer *eb; | |
220 | struct btrfs_key key; | |
8da6d581 | 221 | struct btrfs_file_extent_item *fi; |
ed8c4913 | 222 | struct extent_inode_elem *eie = NULL, *old = NULL; |
8da6d581 JS |
223 | u64 disk_byte; |
224 | ||
69bca40d AB |
225 | if (level != 0) { |
226 | eb = path->nodes[level]; | |
227 | ret = ulist_add(parents, eb->start, 0, GFP_NOFS); | |
3301958b JS |
228 | if (ret < 0) |
229 | return ret; | |
8da6d581 | 230 | return 0; |
69bca40d | 231 | } |
8da6d581 JS |
232 | |
233 | /* | |
69bca40d AB |
234 | * We normally enter this function with the path already pointing to |
235 | * the first item to check. But sometimes, we may enter it with | |
236 | * slot==nritems. In that case, go to the next leaf before we continue. | |
8da6d581 | 237 | */ |
69bca40d | 238 | if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) |
3d7806ec | 239 | ret = btrfs_next_old_leaf(root, path, time_seq); |
8da6d581 | 240 | |
69bca40d | 241 | while (!ret) { |
8da6d581 | 242 | eb = path->nodes[0]; |
69bca40d AB |
243 | slot = path->slots[0]; |
244 | ||
245 | btrfs_item_key_to_cpu(eb, &key, slot); | |
246 | ||
247 | if (key.objectid != key_for_search->objectid || | |
248 | key.type != BTRFS_EXTENT_DATA_KEY) | |
249 | break; | |
250 | ||
251 | fi = btrfs_item_ptr(eb, slot, struct btrfs_file_extent_item); | |
252 | disk_byte = btrfs_file_extent_disk_bytenr(eb, fi); | |
253 | ||
254 | if (disk_byte == wanted_disk_byte) { | |
255 | eie = NULL; | |
ed8c4913 | 256 | old = NULL; |
69bca40d AB |
257 | if (extent_item_pos) { |
258 | ret = check_extent_in_eb(&key, eb, fi, | |
259 | *extent_item_pos, | |
260 | &eie); | |
261 | if (ret < 0) | |
262 | break; | |
263 | } | |
ed8c4913 JB |
264 | if (ret > 0) |
265 | goto next; | |
266 | ret = ulist_add_merge(parents, eb->start, | |
267 | (uintptr_t)eie, | |
268 | (u64 *)&old, GFP_NOFS); | |
269 | if (ret < 0) | |
270 | break; | |
271 | if (!ret && extent_item_pos) { | |
272 | while (old->next) | |
273 | old = old->next; | |
274 | old->next = eie; | |
69bca40d | 275 | } |
8da6d581 | 276 | } |
ed8c4913 | 277 | next: |
69bca40d | 278 | ret = btrfs_next_old_item(root, path, time_seq); |
8da6d581 JS |
279 | } |
280 | ||
69bca40d AB |
281 | if (ret > 0) |
282 | ret = 0; | |
283 | return ret; | |
8da6d581 JS |
284 | } |
285 | ||
286 | /* | |
287 | * resolve an indirect backref in the form (root_id, key, level) | |
288 | * to a logical address | |
289 | */ | |
290 | static int __resolve_indirect_ref(struct btrfs_fs_info *fs_info, | |
da61d31a JB |
291 | struct btrfs_path *path, u64 time_seq, |
292 | struct __prelim_ref *ref, | |
293 | struct ulist *parents, | |
294 | const u64 *extent_item_pos) | |
8da6d581 | 295 | { |
8da6d581 JS |
296 | struct btrfs_root *root; |
297 | struct btrfs_key root_key; | |
8da6d581 JS |
298 | struct extent_buffer *eb; |
299 | int ret = 0; | |
300 | int root_level; | |
301 | int level = ref->level; | |
302 | ||
8da6d581 JS |
303 | root_key.objectid = ref->root_id; |
304 | root_key.type = BTRFS_ROOT_ITEM_KEY; | |
305 | root_key.offset = (u64)-1; | |
306 | root = btrfs_read_fs_root_no_name(fs_info, &root_key); | |
307 | if (IS_ERR(root)) { | |
308 | ret = PTR_ERR(root); | |
309 | goto out; | |
310 | } | |
311 | ||
5b6602e7 | 312 | root_level = btrfs_old_root_level(root, time_seq); |
8da6d581 JS |
313 | |
314 | if (root_level + 1 == level) | |
315 | goto out; | |
316 | ||
317 | path->lowest_level = level; | |
8445f61c | 318 | ret = btrfs_search_old_slot(root, &ref->key_for_search, path, time_seq); |
8da6d581 JS |
319 | pr_debug("search slot in root %llu (level %d, ref count %d) returned " |
320 | "%d for key (%llu %u %llu)\n", | |
c1c9ff7c GU |
321 | ref->root_id, level, ref->count, ret, |
322 | ref->key_for_search.objectid, ref->key_for_search.type, | |
323 | ref->key_for_search.offset); | |
8da6d581 JS |
324 | if (ret < 0) |
325 | goto out; | |
326 | ||
327 | eb = path->nodes[level]; | |
9345457f JS |
328 | while (!eb) { |
329 | if (!level) { | |
330 | WARN_ON(1); | |
331 | ret = 1; | |
332 | goto out; | |
333 | } | |
334 | level--; | |
335 | eb = path->nodes[level]; | |
8da6d581 JS |
336 | } |
337 | ||
69bca40d AB |
338 | ret = add_all_parents(root, path, parents, level, &ref->key_for_search, |
339 | time_seq, ref->wanted_disk_byte, | |
340 | extent_item_pos); | |
8da6d581 | 341 | out: |
da61d31a JB |
342 | path->lowest_level = 0; |
343 | btrfs_release_path(path); | |
8da6d581 JS |
344 | return ret; |
345 | } | |
346 | ||
347 | /* | |
348 | * resolve all indirect backrefs from the list | |
349 | */ | |
350 | static int __resolve_indirect_refs(struct btrfs_fs_info *fs_info, | |
da61d31a | 351 | struct btrfs_path *path, u64 time_seq, |
976b1908 JS |
352 | struct list_head *head, |
353 | const u64 *extent_item_pos) | |
8da6d581 JS |
354 | { |
355 | int err; | |
356 | int ret = 0; | |
357 | struct __prelim_ref *ref; | |
358 | struct __prelim_ref *ref_safe; | |
359 | struct __prelim_ref *new_ref; | |
360 | struct ulist *parents; | |
361 | struct ulist_node *node; | |
cd1b413c | 362 | struct ulist_iterator uiter; |
8da6d581 JS |
363 | |
364 | parents = ulist_alloc(GFP_NOFS); | |
365 | if (!parents) | |
366 | return -ENOMEM; | |
367 | ||
368 | /* | |
369 | * _safe allows us to insert directly after the current item without | |
370 | * iterating over the newly inserted items. | |
371 | * we're also allowed to re-assign ref during iteration. | |
372 | */ | |
373 | list_for_each_entry_safe(ref, ref_safe, head, list) { | |
374 | if (ref->parent) /* already direct */ | |
375 | continue; | |
376 | if (ref->count == 0) | |
377 | continue; | |
da61d31a JB |
378 | err = __resolve_indirect_ref(fs_info, path, time_seq, ref, |
379 | parents, extent_item_pos); | |
e36902d4 WS |
380 | if (err == -ENOMEM) |
381 | goto out; | |
ca60ebfa | 382 | if (err) |
8da6d581 | 383 | continue; |
8da6d581 JS |
384 | |
385 | /* we put the first parent into the ref at hand */ | |
cd1b413c JS |
386 | ULIST_ITER_INIT(&uiter); |
387 | node = ulist_next(parents, &uiter); | |
8da6d581 | 388 | ref->parent = node ? node->val : 0; |
995e01b7 | 389 | ref->inode_list = node ? |
35a3621b | 390 | (struct extent_inode_elem *)(uintptr_t)node->aux : NULL; |
8da6d581 JS |
391 | |
392 | /* additional parents require new refs being added here */ | |
cd1b413c | 393 | while ((node = ulist_next(parents, &uiter))) { |
b9e9a6cb WS |
394 | new_ref = kmem_cache_alloc(btrfs_prelim_ref_cache, |
395 | GFP_NOFS); | |
8da6d581 JS |
396 | if (!new_ref) { |
397 | ret = -ENOMEM; | |
e36902d4 | 398 | goto out; |
8da6d581 JS |
399 | } |
400 | memcpy(new_ref, ref, sizeof(*ref)); | |
401 | new_ref->parent = node->val; | |
995e01b7 JS |
402 | new_ref->inode_list = (struct extent_inode_elem *) |
403 | (uintptr_t)node->aux; | |
8da6d581 JS |
404 | list_add(&new_ref->list, &ref->list); |
405 | } | |
406 | ulist_reinit(parents); | |
407 | } | |
e36902d4 | 408 | out: |
8da6d581 JS |
409 | ulist_free(parents); |
410 | return ret; | |
411 | } | |
412 | ||
d5c88b73 JS |
413 | static inline int ref_for_same_block(struct __prelim_ref *ref1, |
414 | struct __prelim_ref *ref2) | |
415 | { | |
416 | if (ref1->level != ref2->level) | |
417 | return 0; | |
418 | if (ref1->root_id != ref2->root_id) | |
419 | return 0; | |
420 | if (ref1->key_for_search.type != ref2->key_for_search.type) | |
421 | return 0; | |
422 | if (ref1->key_for_search.objectid != ref2->key_for_search.objectid) | |
423 | return 0; | |
424 | if (ref1->key_for_search.offset != ref2->key_for_search.offset) | |
425 | return 0; | |
426 | if (ref1->parent != ref2->parent) | |
427 | return 0; | |
428 | ||
429 | return 1; | |
430 | } | |
431 | ||
432 | /* | |
433 | * read tree blocks and add keys where required. | |
434 | */ | |
435 | static int __add_missing_keys(struct btrfs_fs_info *fs_info, | |
436 | struct list_head *head) | |
437 | { | |
438 | struct list_head *pos; | |
439 | struct extent_buffer *eb; | |
440 | ||
441 | list_for_each(pos, head) { | |
442 | struct __prelim_ref *ref; | |
443 | ref = list_entry(pos, struct __prelim_ref, list); | |
444 | ||
445 | if (ref->parent) | |
446 | continue; | |
447 | if (ref->key_for_search.type) | |
448 | continue; | |
449 | BUG_ON(!ref->wanted_disk_byte); | |
450 | eb = read_tree_block(fs_info->tree_root, ref->wanted_disk_byte, | |
451 | fs_info->tree_root->leafsize, 0); | |
416bc658 JB |
452 | if (!eb || !extent_buffer_uptodate(eb)) { |
453 | free_extent_buffer(eb); | |
454 | return -EIO; | |
455 | } | |
d5c88b73 JS |
456 | btrfs_tree_read_lock(eb); |
457 | if (btrfs_header_level(eb) == 0) | |
458 | btrfs_item_key_to_cpu(eb, &ref->key_for_search, 0); | |
459 | else | |
460 | btrfs_node_key_to_cpu(eb, &ref->key_for_search, 0); | |
461 | btrfs_tree_read_unlock(eb); | |
462 | free_extent_buffer(eb); | |
463 | } | |
464 | return 0; | |
465 | } | |
466 | ||
8da6d581 JS |
467 | /* |
468 | * merge two lists of backrefs and adjust counts accordingly | |
469 | * | |
470 | * mode = 1: merge identical keys, if key is set | |
d5c88b73 JS |
471 | * FIXME: if we add more keys in __add_prelim_ref, we can merge more here. |
472 | * additionally, we could even add a key range for the blocks we | |
473 | * looked into to merge even more (-> replace unresolved refs by those | |
474 | * having a parent). | |
8da6d581 JS |
475 | * mode = 2: merge identical parents |
476 | */ | |
692206b1 | 477 | static void __merge_refs(struct list_head *head, int mode) |
8da6d581 JS |
478 | { |
479 | struct list_head *pos1; | |
480 | ||
481 | list_for_each(pos1, head) { | |
482 | struct list_head *n2; | |
483 | struct list_head *pos2; | |
484 | struct __prelim_ref *ref1; | |
485 | ||
486 | ref1 = list_entry(pos1, struct __prelim_ref, list); | |
487 | ||
8da6d581 JS |
488 | for (pos2 = pos1->next, n2 = pos2->next; pos2 != head; |
489 | pos2 = n2, n2 = pos2->next) { | |
490 | struct __prelim_ref *ref2; | |
d5c88b73 | 491 | struct __prelim_ref *xchg; |
3ef5969c | 492 | struct extent_inode_elem *eie; |
8da6d581 JS |
493 | |
494 | ref2 = list_entry(pos2, struct __prelim_ref, list); | |
495 | ||
496 | if (mode == 1) { | |
d5c88b73 | 497 | if (!ref_for_same_block(ref1, ref2)) |
8da6d581 | 498 | continue; |
d5c88b73 JS |
499 | if (!ref1->parent && ref2->parent) { |
500 | xchg = ref1; | |
501 | ref1 = ref2; | |
502 | ref2 = xchg; | |
503 | } | |
8da6d581 JS |
504 | } else { |
505 | if (ref1->parent != ref2->parent) | |
506 | continue; | |
8da6d581 | 507 | } |
3ef5969c AB |
508 | |
509 | eie = ref1->inode_list; | |
510 | while (eie && eie->next) | |
511 | eie = eie->next; | |
512 | if (eie) | |
513 | eie->next = ref2->inode_list; | |
514 | else | |
515 | ref1->inode_list = ref2->inode_list; | |
516 | ref1->count += ref2->count; | |
517 | ||
8da6d581 | 518 | list_del(&ref2->list); |
b9e9a6cb | 519 | kmem_cache_free(btrfs_prelim_ref_cache, ref2); |
8da6d581 JS |
520 | } |
521 | ||
522 | } | |
8da6d581 JS |
523 | } |
524 | ||
525 | /* | |
526 | * add all currently queued delayed refs from this head whose seq nr is | |
527 | * smaller or equal that seq to the list | |
528 | */ | |
529 | static int __add_delayed_refs(struct btrfs_delayed_ref_head *head, u64 seq, | |
8da6d581 JS |
530 | struct list_head *prefs) |
531 | { | |
532 | struct btrfs_delayed_extent_op *extent_op = head->extent_op; | |
533 | struct rb_node *n = &head->node.rb_node; | |
d5c88b73 JS |
534 | struct btrfs_key key; |
535 | struct btrfs_key op_key = {0}; | |
8da6d581 | 536 | int sgn; |
b1375d64 | 537 | int ret = 0; |
8da6d581 JS |
538 | |
539 | if (extent_op && extent_op->update_key) | |
d5c88b73 | 540 | btrfs_disk_key_to_cpu(&op_key, &extent_op->key); |
8da6d581 JS |
541 | |
542 | while ((n = rb_prev(n))) { | |
543 | struct btrfs_delayed_ref_node *node; | |
544 | node = rb_entry(n, struct btrfs_delayed_ref_node, | |
545 | rb_node); | |
546 | if (node->bytenr != head->node.bytenr) | |
547 | break; | |
548 | WARN_ON(node->is_head); | |
549 | ||
550 | if (node->seq > seq) | |
551 | continue; | |
552 | ||
553 | switch (node->action) { | |
554 | case BTRFS_ADD_DELAYED_EXTENT: | |
555 | case BTRFS_UPDATE_DELAYED_HEAD: | |
556 | WARN_ON(1); | |
557 | continue; | |
558 | case BTRFS_ADD_DELAYED_REF: | |
559 | sgn = 1; | |
560 | break; | |
561 | case BTRFS_DROP_DELAYED_REF: | |
562 | sgn = -1; | |
563 | break; | |
564 | default: | |
565 | BUG_ON(1); | |
566 | } | |
567 | switch (node->type) { | |
568 | case BTRFS_TREE_BLOCK_REF_KEY: { | |
569 | struct btrfs_delayed_tree_ref *ref; | |
570 | ||
571 | ref = btrfs_delayed_node_to_tree_ref(node); | |
d5c88b73 | 572 | ret = __add_prelim_ref(prefs, ref->root, &op_key, |
8da6d581 | 573 | ref->level + 1, 0, node->bytenr, |
742916b8 | 574 | node->ref_mod * sgn, GFP_ATOMIC); |
8da6d581 JS |
575 | break; |
576 | } | |
577 | case BTRFS_SHARED_BLOCK_REF_KEY: { | |
578 | struct btrfs_delayed_tree_ref *ref; | |
579 | ||
580 | ref = btrfs_delayed_node_to_tree_ref(node); | |
d5c88b73 | 581 | ret = __add_prelim_ref(prefs, ref->root, NULL, |
8da6d581 JS |
582 | ref->level + 1, ref->parent, |
583 | node->bytenr, | |
742916b8 | 584 | node->ref_mod * sgn, GFP_ATOMIC); |
8da6d581 JS |
585 | break; |
586 | } | |
587 | case BTRFS_EXTENT_DATA_REF_KEY: { | |
588 | struct btrfs_delayed_data_ref *ref; | |
8da6d581 JS |
589 | ref = btrfs_delayed_node_to_data_ref(node); |
590 | ||
591 | key.objectid = ref->objectid; | |
592 | key.type = BTRFS_EXTENT_DATA_KEY; | |
593 | key.offset = ref->offset; | |
594 | ret = __add_prelim_ref(prefs, ref->root, &key, 0, 0, | |
595 | node->bytenr, | |
742916b8 | 596 | node->ref_mod * sgn, GFP_ATOMIC); |
8da6d581 JS |
597 | break; |
598 | } | |
599 | case BTRFS_SHARED_DATA_REF_KEY: { | |
600 | struct btrfs_delayed_data_ref *ref; | |
8da6d581 JS |
601 | |
602 | ref = btrfs_delayed_node_to_data_ref(node); | |
603 | ||
604 | key.objectid = ref->objectid; | |
605 | key.type = BTRFS_EXTENT_DATA_KEY; | |
606 | key.offset = ref->offset; | |
607 | ret = __add_prelim_ref(prefs, ref->root, &key, 0, | |
608 | ref->parent, node->bytenr, | |
742916b8 | 609 | node->ref_mod * sgn, GFP_ATOMIC); |
8da6d581 JS |
610 | break; |
611 | } | |
612 | default: | |
613 | WARN_ON(1); | |
614 | } | |
1149ab6b WS |
615 | if (ret) |
616 | return ret; | |
8da6d581 JS |
617 | } |
618 | ||
619 | return 0; | |
620 | } | |
621 | ||
622 | /* | |
623 | * add all inline backrefs for bytenr to the list | |
624 | */ | |
625 | static int __add_inline_refs(struct btrfs_fs_info *fs_info, | |
626 | struct btrfs_path *path, u64 bytenr, | |
d5c88b73 | 627 | int *info_level, struct list_head *prefs) |
8da6d581 | 628 | { |
b1375d64 | 629 | int ret = 0; |
8da6d581 JS |
630 | int slot; |
631 | struct extent_buffer *leaf; | |
632 | struct btrfs_key key; | |
261c84b6 | 633 | struct btrfs_key found_key; |
8da6d581 JS |
634 | unsigned long ptr; |
635 | unsigned long end; | |
636 | struct btrfs_extent_item *ei; | |
637 | u64 flags; | |
638 | u64 item_size; | |
639 | ||
640 | /* | |
641 | * enumerate all inline refs | |
642 | */ | |
643 | leaf = path->nodes[0]; | |
dadcaf78 | 644 | slot = path->slots[0]; |
8da6d581 JS |
645 | |
646 | item_size = btrfs_item_size_nr(leaf, slot); | |
647 | BUG_ON(item_size < sizeof(*ei)); | |
648 | ||
649 | ei = btrfs_item_ptr(leaf, slot, struct btrfs_extent_item); | |
650 | flags = btrfs_extent_flags(leaf, ei); | |
261c84b6 | 651 | btrfs_item_key_to_cpu(leaf, &found_key, slot); |
8da6d581 JS |
652 | |
653 | ptr = (unsigned long)(ei + 1); | |
654 | end = (unsigned long)ei + item_size; | |
655 | ||
261c84b6 JB |
656 | if (found_key.type == BTRFS_EXTENT_ITEM_KEY && |
657 | flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { | |
8da6d581 | 658 | struct btrfs_tree_block_info *info; |
8da6d581 JS |
659 | |
660 | info = (struct btrfs_tree_block_info *)ptr; | |
661 | *info_level = btrfs_tree_block_level(leaf, info); | |
8da6d581 JS |
662 | ptr += sizeof(struct btrfs_tree_block_info); |
663 | BUG_ON(ptr > end); | |
261c84b6 JB |
664 | } else if (found_key.type == BTRFS_METADATA_ITEM_KEY) { |
665 | *info_level = found_key.offset; | |
8da6d581 JS |
666 | } else { |
667 | BUG_ON(!(flags & BTRFS_EXTENT_FLAG_DATA)); | |
668 | } | |
669 | ||
670 | while (ptr < end) { | |
671 | struct btrfs_extent_inline_ref *iref; | |
672 | u64 offset; | |
673 | int type; | |
674 | ||
675 | iref = (struct btrfs_extent_inline_ref *)ptr; | |
676 | type = btrfs_extent_inline_ref_type(leaf, iref); | |
677 | offset = btrfs_extent_inline_ref_offset(leaf, iref); | |
678 | ||
679 | switch (type) { | |
680 | case BTRFS_SHARED_BLOCK_REF_KEY: | |
d5c88b73 | 681 | ret = __add_prelim_ref(prefs, 0, NULL, |
8da6d581 | 682 | *info_level + 1, offset, |
742916b8 | 683 | bytenr, 1, GFP_NOFS); |
8da6d581 JS |
684 | break; |
685 | case BTRFS_SHARED_DATA_REF_KEY: { | |
686 | struct btrfs_shared_data_ref *sdref; | |
687 | int count; | |
688 | ||
689 | sdref = (struct btrfs_shared_data_ref *)(iref + 1); | |
690 | count = btrfs_shared_data_ref_count(leaf, sdref); | |
691 | ret = __add_prelim_ref(prefs, 0, NULL, 0, offset, | |
742916b8 | 692 | bytenr, count, GFP_NOFS); |
8da6d581 JS |
693 | break; |
694 | } | |
695 | case BTRFS_TREE_BLOCK_REF_KEY: | |
d5c88b73 JS |
696 | ret = __add_prelim_ref(prefs, offset, NULL, |
697 | *info_level + 1, 0, | |
742916b8 | 698 | bytenr, 1, GFP_NOFS); |
8da6d581 JS |
699 | break; |
700 | case BTRFS_EXTENT_DATA_REF_KEY: { | |
701 | struct btrfs_extent_data_ref *dref; | |
702 | int count; | |
703 | u64 root; | |
704 | ||
705 | dref = (struct btrfs_extent_data_ref *)(&iref->offset); | |
706 | count = btrfs_extent_data_ref_count(leaf, dref); | |
707 | key.objectid = btrfs_extent_data_ref_objectid(leaf, | |
708 | dref); | |
709 | key.type = BTRFS_EXTENT_DATA_KEY; | |
710 | key.offset = btrfs_extent_data_ref_offset(leaf, dref); | |
711 | root = btrfs_extent_data_ref_root(leaf, dref); | |
d5c88b73 | 712 | ret = __add_prelim_ref(prefs, root, &key, 0, 0, |
742916b8 | 713 | bytenr, count, GFP_NOFS); |
8da6d581 JS |
714 | break; |
715 | } | |
716 | default: | |
717 | WARN_ON(1); | |
718 | } | |
1149ab6b WS |
719 | if (ret) |
720 | return ret; | |
8da6d581 JS |
721 | ptr += btrfs_extent_inline_ref_size(type); |
722 | } | |
723 | ||
724 | return 0; | |
725 | } | |
726 | ||
727 | /* | |
728 | * add all non-inline backrefs for bytenr to the list | |
729 | */ | |
730 | static int __add_keyed_refs(struct btrfs_fs_info *fs_info, | |
731 | struct btrfs_path *path, u64 bytenr, | |
d5c88b73 | 732 | int info_level, struct list_head *prefs) |
8da6d581 JS |
733 | { |
734 | struct btrfs_root *extent_root = fs_info->extent_root; | |
735 | int ret; | |
736 | int slot; | |
737 | struct extent_buffer *leaf; | |
738 | struct btrfs_key key; | |
739 | ||
740 | while (1) { | |
741 | ret = btrfs_next_item(extent_root, path); | |
742 | if (ret < 0) | |
743 | break; | |
744 | if (ret) { | |
745 | ret = 0; | |
746 | break; | |
747 | } | |
748 | ||
749 | slot = path->slots[0]; | |
750 | leaf = path->nodes[0]; | |
751 | btrfs_item_key_to_cpu(leaf, &key, slot); | |
752 | ||
753 | if (key.objectid != bytenr) | |
754 | break; | |
755 | if (key.type < BTRFS_TREE_BLOCK_REF_KEY) | |
756 | continue; | |
757 | if (key.type > BTRFS_SHARED_DATA_REF_KEY) | |
758 | break; | |
759 | ||
760 | switch (key.type) { | |
761 | case BTRFS_SHARED_BLOCK_REF_KEY: | |
d5c88b73 | 762 | ret = __add_prelim_ref(prefs, 0, NULL, |
8da6d581 | 763 | info_level + 1, key.offset, |
742916b8 | 764 | bytenr, 1, GFP_NOFS); |
8da6d581 JS |
765 | break; |
766 | case BTRFS_SHARED_DATA_REF_KEY: { | |
767 | struct btrfs_shared_data_ref *sdref; | |
768 | int count; | |
769 | ||
770 | sdref = btrfs_item_ptr(leaf, slot, | |
771 | struct btrfs_shared_data_ref); | |
772 | count = btrfs_shared_data_ref_count(leaf, sdref); | |
773 | ret = __add_prelim_ref(prefs, 0, NULL, 0, key.offset, | |
742916b8 | 774 | bytenr, count, GFP_NOFS); |
8da6d581 JS |
775 | break; |
776 | } | |
777 | case BTRFS_TREE_BLOCK_REF_KEY: | |
d5c88b73 JS |
778 | ret = __add_prelim_ref(prefs, key.offset, NULL, |
779 | info_level + 1, 0, | |
742916b8 | 780 | bytenr, 1, GFP_NOFS); |
8da6d581 JS |
781 | break; |
782 | case BTRFS_EXTENT_DATA_REF_KEY: { | |
783 | struct btrfs_extent_data_ref *dref; | |
784 | int count; | |
785 | u64 root; | |
786 | ||
787 | dref = btrfs_item_ptr(leaf, slot, | |
788 | struct btrfs_extent_data_ref); | |
789 | count = btrfs_extent_data_ref_count(leaf, dref); | |
790 | key.objectid = btrfs_extent_data_ref_objectid(leaf, | |
791 | dref); | |
792 | key.type = BTRFS_EXTENT_DATA_KEY; | |
793 | key.offset = btrfs_extent_data_ref_offset(leaf, dref); | |
794 | root = btrfs_extent_data_ref_root(leaf, dref); | |
795 | ret = __add_prelim_ref(prefs, root, &key, 0, 0, | |
742916b8 | 796 | bytenr, count, GFP_NOFS); |
8da6d581 JS |
797 | break; |
798 | } | |
799 | default: | |
800 | WARN_ON(1); | |
801 | } | |
1149ab6b WS |
802 | if (ret) |
803 | return ret; | |
804 | ||
8da6d581 JS |
805 | } |
806 | ||
807 | return ret; | |
808 | } | |
809 | ||
810 | /* | |
811 | * this adds all existing backrefs (inline backrefs, backrefs and delayed | |
812 | * refs) for the given bytenr to the refs list, merges duplicates and resolves | |
813 | * indirect refs to their parent bytenr. | |
814 | * When roots are found, they're added to the roots list | |
815 | * | |
816 | * FIXME some caching might speed things up | |
817 | */ | |
818 | static int find_parent_nodes(struct btrfs_trans_handle *trans, | |
819 | struct btrfs_fs_info *fs_info, u64 bytenr, | |
097b8a7c JS |
820 | u64 time_seq, struct ulist *refs, |
821 | struct ulist *roots, const u64 *extent_item_pos) | |
8da6d581 JS |
822 | { |
823 | struct btrfs_key key; | |
824 | struct btrfs_path *path; | |
8da6d581 | 825 | struct btrfs_delayed_ref_root *delayed_refs = NULL; |
d3b01064 | 826 | struct btrfs_delayed_ref_head *head; |
8da6d581 JS |
827 | int info_level = 0; |
828 | int ret; | |
829 | struct list_head prefs_delayed; | |
830 | struct list_head prefs; | |
831 | struct __prelim_ref *ref; | |
832 | ||
833 | INIT_LIST_HEAD(&prefs); | |
834 | INIT_LIST_HEAD(&prefs_delayed); | |
835 | ||
836 | key.objectid = bytenr; | |
8da6d581 | 837 | key.offset = (u64)-1; |
261c84b6 JB |
838 | if (btrfs_fs_incompat(fs_info, SKINNY_METADATA)) |
839 | key.type = BTRFS_METADATA_ITEM_KEY; | |
840 | else | |
841 | key.type = BTRFS_EXTENT_ITEM_KEY; | |
8da6d581 JS |
842 | |
843 | path = btrfs_alloc_path(); | |
844 | if (!path) | |
845 | return -ENOMEM; | |
da61d31a JB |
846 | if (!trans) |
847 | path->search_commit_root = 1; | |
8da6d581 JS |
848 | |
849 | /* | |
850 | * grab both a lock on the path and a lock on the delayed ref head. | |
851 | * We need both to get a consistent picture of how the refs look | |
852 | * at a specified point in time | |
853 | */ | |
854 | again: | |
d3b01064 LZ |
855 | head = NULL; |
856 | ||
8da6d581 JS |
857 | ret = btrfs_search_slot(trans, fs_info->extent_root, &key, path, 0, 0); |
858 | if (ret < 0) | |
859 | goto out; | |
860 | BUG_ON(ret == 0); | |
861 | ||
da61d31a | 862 | if (trans) { |
7a3ae2f8 JS |
863 | /* |
864 | * look if there are updates for this ref queued and lock the | |
865 | * head | |
866 | */ | |
867 | delayed_refs = &trans->transaction->delayed_refs; | |
868 | spin_lock(&delayed_refs->lock); | |
869 | head = btrfs_find_delayed_ref_head(trans, bytenr); | |
870 | if (head) { | |
871 | if (!mutex_trylock(&head->mutex)) { | |
872 | atomic_inc(&head->node.refs); | |
873 | spin_unlock(&delayed_refs->lock); | |
874 | ||
875 | btrfs_release_path(path); | |
876 | ||
877 | /* | |
878 | * Mutex was contended, block until it's | |
879 | * released and try again | |
880 | */ | |
881 | mutex_lock(&head->mutex); | |
882 | mutex_unlock(&head->mutex); | |
883 | btrfs_put_delayed_ref(&head->node); | |
884 | goto again; | |
885 | } | |
097b8a7c | 886 | ret = __add_delayed_refs(head, time_seq, |
8445f61c | 887 | &prefs_delayed); |
155725c9 | 888 | mutex_unlock(&head->mutex); |
7a3ae2f8 JS |
889 | if (ret) { |
890 | spin_unlock(&delayed_refs->lock); | |
891 | goto out; | |
892 | } | |
d3b01064 | 893 | } |
7a3ae2f8 | 894 | spin_unlock(&delayed_refs->lock); |
8da6d581 | 895 | } |
8da6d581 JS |
896 | |
897 | if (path->slots[0]) { | |
898 | struct extent_buffer *leaf; | |
899 | int slot; | |
900 | ||
dadcaf78 | 901 | path->slots[0]--; |
8da6d581 | 902 | leaf = path->nodes[0]; |
dadcaf78 | 903 | slot = path->slots[0]; |
8da6d581 JS |
904 | btrfs_item_key_to_cpu(leaf, &key, slot); |
905 | if (key.objectid == bytenr && | |
261c84b6 JB |
906 | (key.type == BTRFS_EXTENT_ITEM_KEY || |
907 | key.type == BTRFS_METADATA_ITEM_KEY)) { | |
8da6d581 | 908 | ret = __add_inline_refs(fs_info, path, bytenr, |
d5c88b73 | 909 | &info_level, &prefs); |
8da6d581 JS |
910 | if (ret) |
911 | goto out; | |
d5c88b73 | 912 | ret = __add_keyed_refs(fs_info, path, bytenr, |
8da6d581 JS |
913 | info_level, &prefs); |
914 | if (ret) | |
915 | goto out; | |
916 | } | |
917 | } | |
918 | btrfs_release_path(path); | |
919 | ||
8da6d581 JS |
920 | list_splice_init(&prefs_delayed, &prefs); |
921 | ||
d5c88b73 JS |
922 | ret = __add_missing_keys(fs_info, &prefs); |
923 | if (ret) | |
924 | goto out; | |
925 | ||
692206b1 | 926 | __merge_refs(&prefs, 1); |
8da6d581 | 927 | |
da61d31a JB |
928 | ret = __resolve_indirect_refs(fs_info, path, time_seq, &prefs, |
929 | extent_item_pos); | |
8da6d581 JS |
930 | if (ret) |
931 | goto out; | |
932 | ||
692206b1 | 933 | __merge_refs(&prefs, 2); |
8da6d581 JS |
934 | |
935 | while (!list_empty(&prefs)) { | |
936 | ref = list_first_entry(&prefs, struct __prelim_ref, list); | |
6c1500f2 | 937 | WARN_ON(ref->count < 0); |
8da6d581 JS |
938 | if (ref->count && ref->root_id && ref->parent == 0) { |
939 | /* no parent == root of tree */ | |
940 | ret = ulist_add(roots, ref->root_id, 0, GFP_NOFS); | |
f1723939 WS |
941 | if (ret < 0) |
942 | goto out; | |
8da6d581 JS |
943 | } |
944 | if (ref->count && ref->parent) { | |
976b1908 | 945 | struct extent_inode_elem *eie = NULL; |
3301958b | 946 | if (extent_item_pos && !ref->inode_list) { |
976b1908 JS |
947 | u32 bsz; |
948 | struct extent_buffer *eb; | |
949 | bsz = btrfs_level_size(fs_info->extent_root, | |
950 | info_level); | |
951 | eb = read_tree_block(fs_info->extent_root, | |
952 | ref->parent, bsz, 0); | |
416bc658 JB |
953 | if (!eb || !extent_buffer_uptodate(eb)) { |
954 | free_extent_buffer(eb); | |
c16c2e2e WS |
955 | ret = -EIO; |
956 | goto out; | |
416bc658 | 957 | } |
976b1908 JS |
958 | ret = find_extent_in_eb(eb, bytenr, |
959 | *extent_item_pos, &eie); | |
960 | free_extent_buffer(eb); | |
f5929cd8 FDBM |
961 | if (ret < 0) |
962 | goto out; | |
963 | ref->inode_list = eie; | |
976b1908 | 964 | } |
3301958b | 965 | ret = ulist_add_merge(refs, ref->parent, |
995e01b7 | 966 | (uintptr_t)ref->inode_list, |
34d73f54 | 967 | (u64 *)&eie, GFP_NOFS); |
f1723939 WS |
968 | if (ret < 0) |
969 | goto out; | |
3301958b JS |
970 | if (!ret && extent_item_pos) { |
971 | /* | |
972 | * we've recorded that parent, so we must extend | |
973 | * its inode list here | |
974 | */ | |
975 | BUG_ON(!eie); | |
976 | while (eie->next) | |
977 | eie = eie->next; | |
978 | eie->next = ref->inode_list; | |
979 | } | |
8da6d581 | 980 | } |
a4fdb61e | 981 | list_del(&ref->list); |
b9e9a6cb | 982 | kmem_cache_free(btrfs_prelim_ref_cache, ref); |
8da6d581 JS |
983 | } |
984 | ||
985 | out: | |
8da6d581 JS |
986 | btrfs_free_path(path); |
987 | while (!list_empty(&prefs)) { | |
988 | ref = list_first_entry(&prefs, struct __prelim_ref, list); | |
989 | list_del(&ref->list); | |
b9e9a6cb | 990 | kmem_cache_free(btrfs_prelim_ref_cache, ref); |
8da6d581 JS |
991 | } |
992 | while (!list_empty(&prefs_delayed)) { | |
993 | ref = list_first_entry(&prefs_delayed, struct __prelim_ref, | |
994 | list); | |
995 | list_del(&ref->list); | |
b9e9a6cb | 996 | kmem_cache_free(btrfs_prelim_ref_cache, ref); |
8da6d581 JS |
997 | } |
998 | ||
999 | return ret; | |
1000 | } | |
1001 | ||
976b1908 JS |
1002 | static void free_leaf_list(struct ulist *blocks) |
1003 | { | |
1004 | struct ulist_node *node = NULL; | |
1005 | struct extent_inode_elem *eie; | |
1006 | struct extent_inode_elem *eie_next; | |
1007 | struct ulist_iterator uiter; | |
1008 | ||
1009 | ULIST_ITER_INIT(&uiter); | |
1010 | while ((node = ulist_next(blocks, &uiter))) { | |
1011 | if (!node->aux) | |
1012 | continue; | |
995e01b7 | 1013 | eie = (struct extent_inode_elem *)(uintptr_t)node->aux; |
976b1908 JS |
1014 | for (; eie; eie = eie_next) { |
1015 | eie_next = eie->next; | |
1016 | kfree(eie); | |
1017 | } | |
1018 | node->aux = 0; | |
1019 | } | |
1020 | ||
1021 | ulist_free(blocks); | |
1022 | } | |
1023 | ||
8da6d581 JS |
1024 | /* |
1025 | * Finds all leafs with a reference to the specified combination of bytenr and | |
1026 | * offset. key_list_head will point to a list of corresponding keys (caller must | |
1027 | * free each list element). The leafs will be stored in the leafs ulist, which | |
1028 | * must be freed with ulist_free. | |
1029 | * | |
1030 | * returns 0 on success, <0 on error | |
1031 | */ | |
1032 | static int btrfs_find_all_leafs(struct btrfs_trans_handle *trans, | |
1033 | struct btrfs_fs_info *fs_info, u64 bytenr, | |
097b8a7c | 1034 | u64 time_seq, struct ulist **leafs, |
976b1908 | 1035 | const u64 *extent_item_pos) |
8da6d581 JS |
1036 | { |
1037 | struct ulist *tmp; | |
1038 | int ret; | |
1039 | ||
1040 | tmp = ulist_alloc(GFP_NOFS); | |
1041 | if (!tmp) | |
1042 | return -ENOMEM; | |
1043 | *leafs = ulist_alloc(GFP_NOFS); | |
1044 | if (!*leafs) { | |
1045 | ulist_free(tmp); | |
1046 | return -ENOMEM; | |
1047 | } | |
1048 | ||
097b8a7c | 1049 | ret = find_parent_nodes(trans, fs_info, bytenr, |
8445f61c | 1050 | time_seq, *leafs, tmp, extent_item_pos); |
8da6d581 JS |
1051 | ulist_free(tmp); |
1052 | ||
1053 | if (ret < 0 && ret != -ENOENT) { | |
976b1908 | 1054 | free_leaf_list(*leafs); |
8da6d581 JS |
1055 | return ret; |
1056 | } | |
1057 | ||
1058 | return 0; | |
1059 | } | |
1060 | ||
1061 | /* | |
1062 | * walk all backrefs for a given extent to find all roots that reference this | |
1063 | * extent. Walking a backref means finding all extents that reference this | |
1064 | * extent and in turn walk the backrefs of those, too. Naturally this is a | |
1065 | * recursive process, but here it is implemented in an iterative fashion: We | |
1066 | * find all referencing extents for the extent in question and put them on a | |
1067 | * list. In turn, we find all referencing extents for those, further appending | |
1068 | * to the list. The way we iterate the list allows adding more elements after | |
1069 | * the current while iterating. The process stops when we reach the end of the | |
1070 | * list. Found roots are added to the roots list. | |
1071 | * | |
1072 | * returns 0 on success, < 0 on error. | |
1073 | */ | |
1074 | int btrfs_find_all_roots(struct btrfs_trans_handle *trans, | |
1075 | struct btrfs_fs_info *fs_info, u64 bytenr, | |
097b8a7c | 1076 | u64 time_seq, struct ulist **roots) |
8da6d581 JS |
1077 | { |
1078 | struct ulist *tmp; | |
1079 | struct ulist_node *node = NULL; | |
cd1b413c | 1080 | struct ulist_iterator uiter; |
8da6d581 JS |
1081 | int ret; |
1082 | ||
1083 | tmp = ulist_alloc(GFP_NOFS); | |
1084 | if (!tmp) | |
1085 | return -ENOMEM; | |
1086 | *roots = ulist_alloc(GFP_NOFS); | |
1087 | if (!*roots) { | |
1088 | ulist_free(tmp); | |
1089 | return -ENOMEM; | |
1090 | } | |
1091 | ||
cd1b413c | 1092 | ULIST_ITER_INIT(&uiter); |
8da6d581 | 1093 | while (1) { |
097b8a7c | 1094 | ret = find_parent_nodes(trans, fs_info, bytenr, |
8445f61c | 1095 | time_seq, tmp, *roots, NULL); |
8da6d581 JS |
1096 | if (ret < 0 && ret != -ENOENT) { |
1097 | ulist_free(tmp); | |
1098 | ulist_free(*roots); | |
1099 | return ret; | |
1100 | } | |
cd1b413c | 1101 | node = ulist_next(tmp, &uiter); |
8da6d581 JS |
1102 | if (!node) |
1103 | break; | |
1104 | bytenr = node->val; | |
1105 | } | |
1106 | ||
1107 | ulist_free(tmp); | |
1108 | return 0; | |
1109 | } | |
1110 | ||
1111 | ||
a542ad1b JS |
1112 | static int __inode_info(u64 inum, u64 ioff, u8 key_type, |
1113 | struct btrfs_root *fs_root, struct btrfs_path *path, | |
1114 | struct btrfs_key *found_key) | |
1115 | { | |
1116 | int ret; | |
1117 | struct btrfs_key key; | |
1118 | struct extent_buffer *eb; | |
1119 | ||
1120 | key.type = key_type; | |
1121 | key.objectid = inum; | |
1122 | key.offset = ioff; | |
1123 | ||
1124 | ret = btrfs_search_slot(NULL, fs_root, &key, path, 0, 0); | |
1125 | if (ret < 0) | |
1126 | return ret; | |
1127 | ||
1128 | eb = path->nodes[0]; | |
1129 | if (ret && path->slots[0] >= btrfs_header_nritems(eb)) { | |
1130 | ret = btrfs_next_leaf(fs_root, path); | |
1131 | if (ret) | |
1132 | return ret; | |
1133 | eb = path->nodes[0]; | |
1134 | } | |
1135 | ||
1136 | btrfs_item_key_to_cpu(eb, found_key, path->slots[0]); | |
1137 | if (found_key->type != key.type || found_key->objectid != key.objectid) | |
1138 | return 1; | |
1139 | ||
1140 | return 0; | |
1141 | } | |
1142 | ||
1143 | /* | |
1144 | * this makes the path point to (inum INODE_ITEM ioff) | |
1145 | */ | |
1146 | int inode_item_info(u64 inum, u64 ioff, struct btrfs_root *fs_root, | |
1147 | struct btrfs_path *path) | |
1148 | { | |
1149 | struct btrfs_key key; | |
1150 | return __inode_info(inum, ioff, BTRFS_INODE_ITEM_KEY, fs_root, path, | |
1151 | &key); | |
1152 | } | |
1153 | ||
1154 | static int inode_ref_info(u64 inum, u64 ioff, struct btrfs_root *fs_root, | |
1155 | struct btrfs_path *path, | |
1156 | struct btrfs_key *found_key) | |
1157 | { | |
1158 | return __inode_info(inum, ioff, BTRFS_INODE_REF_KEY, fs_root, path, | |
1159 | found_key); | |
1160 | } | |
1161 | ||
f186373f MF |
1162 | int btrfs_find_one_extref(struct btrfs_root *root, u64 inode_objectid, |
1163 | u64 start_off, struct btrfs_path *path, | |
1164 | struct btrfs_inode_extref **ret_extref, | |
1165 | u64 *found_off) | |
1166 | { | |
1167 | int ret, slot; | |
1168 | struct btrfs_key key; | |
1169 | struct btrfs_key found_key; | |
1170 | struct btrfs_inode_extref *extref; | |
1171 | struct extent_buffer *leaf; | |
1172 | unsigned long ptr; | |
1173 | ||
1174 | key.objectid = inode_objectid; | |
1175 | btrfs_set_key_type(&key, BTRFS_INODE_EXTREF_KEY); | |
1176 | key.offset = start_off; | |
1177 | ||
1178 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
1179 | if (ret < 0) | |
1180 | return ret; | |
1181 | ||
1182 | while (1) { | |
1183 | leaf = path->nodes[0]; | |
1184 | slot = path->slots[0]; | |
1185 | if (slot >= btrfs_header_nritems(leaf)) { | |
1186 | /* | |
1187 | * If the item at offset is not found, | |
1188 | * btrfs_search_slot will point us to the slot | |
1189 | * where it should be inserted. In our case | |
1190 | * that will be the slot directly before the | |
1191 | * next INODE_REF_KEY_V2 item. In the case | |
1192 | * that we're pointing to the last slot in a | |
1193 | * leaf, we must move one leaf over. | |
1194 | */ | |
1195 | ret = btrfs_next_leaf(root, path); | |
1196 | if (ret) { | |
1197 | if (ret >= 1) | |
1198 | ret = -ENOENT; | |
1199 | break; | |
1200 | } | |
1201 | continue; | |
1202 | } | |
1203 | ||
1204 | btrfs_item_key_to_cpu(leaf, &found_key, slot); | |
1205 | ||
1206 | /* | |
1207 | * Check that we're still looking at an extended ref key for | |
1208 | * this particular objectid. If we have different | |
1209 | * objectid or type then there are no more to be found | |
1210 | * in the tree and we can exit. | |
1211 | */ | |
1212 | ret = -ENOENT; | |
1213 | if (found_key.objectid != inode_objectid) | |
1214 | break; | |
1215 | if (btrfs_key_type(&found_key) != BTRFS_INODE_EXTREF_KEY) | |
1216 | break; | |
1217 | ||
1218 | ret = 0; | |
1219 | ptr = btrfs_item_ptr_offset(leaf, path->slots[0]); | |
1220 | extref = (struct btrfs_inode_extref *)ptr; | |
1221 | *ret_extref = extref; | |
1222 | if (found_off) | |
1223 | *found_off = found_key.offset; | |
1224 | break; | |
1225 | } | |
1226 | ||
1227 | return ret; | |
1228 | } | |
1229 | ||
48a3b636 ES |
1230 | /* |
1231 | * this iterates to turn a name (from iref/extref) into a full filesystem path. | |
1232 | * Elements of the path are separated by '/' and the path is guaranteed to be | |
1233 | * 0-terminated. the path is only given within the current file system. | |
1234 | * Therefore, it never starts with a '/'. the caller is responsible to provide | |
1235 | * "size" bytes in "dest". the dest buffer will be filled backwards. finally, | |
1236 | * the start point of the resulting string is returned. this pointer is within | |
1237 | * dest, normally. | |
1238 | * in case the path buffer would overflow, the pointer is decremented further | |
1239 | * as if output was written to the buffer, though no more output is actually | |
1240 | * generated. that way, the caller can determine how much space would be | |
1241 | * required for the path to fit into the buffer. in that case, the returned | |
1242 | * value will be smaller than dest. callers must check this! | |
1243 | */ | |
96b5bd77 JS |
1244 | char *btrfs_ref_to_path(struct btrfs_root *fs_root, struct btrfs_path *path, |
1245 | u32 name_len, unsigned long name_off, | |
1246 | struct extent_buffer *eb_in, u64 parent, | |
1247 | char *dest, u32 size) | |
a542ad1b | 1248 | { |
a542ad1b JS |
1249 | int slot; |
1250 | u64 next_inum; | |
1251 | int ret; | |
661bec6b | 1252 | s64 bytes_left = ((s64)size) - 1; |
a542ad1b JS |
1253 | struct extent_buffer *eb = eb_in; |
1254 | struct btrfs_key found_key; | |
b916a59a | 1255 | int leave_spinning = path->leave_spinning; |
d24bec3a | 1256 | struct btrfs_inode_ref *iref; |
a542ad1b JS |
1257 | |
1258 | if (bytes_left >= 0) | |
1259 | dest[bytes_left] = '\0'; | |
1260 | ||
b916a59a | 1261 | path->leave_spinning = 1; |
a542ad1b | 1262 | while (1) { |
d24bec3a | 1263 | bytes_left -= name_len; |
a542ad1b JS |
1264 | if (bytes_left >= 0) |
1265 | read_extent_buffer(eb, dest + bytes_left, | |
d24bec3a | 1266 | name_off, name_len); |
b916a59a JS |
1267 | if (eb != eb_in) { |
1268 | btrfs_tree_read_unlock_blocking(eb); | |
a542ad1b | 1269 | free_extent_buffer(eb); |
b916a59a | 1270 | } |
a542ad1b | 1271 | ret = inode_ref_info(parent, 0, fs_root, path, &found_key); |
8f24b496 JS |
1272 | if (ret > 0) |
1273 | ret = -ENOENT; | |
a542ad1b JS |
1274 | if (ret) |
1275 | break; | |
d24bec3a | 1276 | |
a542ad1b JS |
1277 | next_inum = found_key.offset; |
1278 | ||
1279 | /* regular exit ahead */ | |
1280 | if (parent == next_inum) | |
1281 | break; | |
1282 | ||
1283 | slot = path->slots[0]; | |
1284 | eb = path->nodes[0]; | |
1285 | /* make sure we can use eb after releasing the path */ | |
b916a59a | 1286 | if (eb != eb_in) { |
a542ad1b | 1287 | atomic_inc(&eb->refs); |
b916a59a JS |
1288 | btrfs_tree_read_lock(eb); |
1289 | btrfs_set_lock_blocking_rw(eb, BTRFS_READ_LOCK); | |
1290 | } | |
a542ad1b | 1291 | btrfs_release_path(path); |
a542ad1b | 1292 | iref = btrfs_item_ptr(eb, slot, struct btrfs_inode_ref); |
d24bec3a MF |
1293 | |
1294 | name_len = btrfs_inode_ref_name_len(eb, iref); | |
1295 | name_off = (unsigned long)(iref + 1); | |
1296 | ||
a542ad1b JS |
1297 | parent = next_inum; |
1298 | --bytes_left; | |
1299 | if (bytes_left >= 0) | |
1300 | dest[bytes_left] = '/'; | |
1301 | } | |
1302 | ||
1303 | btrfs_release_path(path); | |
b916a59a | 1304 | path->leave_spinning = leave_spinning; |
a542ad1b JS |
1305 | |
1306 | if (ret) | |
1307 | return ERR_PTR(ret); | |
1308 | ||
1309 | return dest + bytes_left; | |
1310 | } | |
1311 | ||
1312 | /* | |
1313 | * this makes the path point to (logical EXTENT_ITEM *) | |
1314 | * returns BTRFS_EXTENT_FLAG_DATA for data, BTRFS_EXTENT_FLAG_TREE_BLOCK for | |
1315 | * tree blocks and <0 on error. | |
1316 | */ | |
1317 | int extent_from_logical(struct btrfs_fs_info *fs_info, u64 logical, | |
69917e43 LB |
1318 | struct btrfs_path *path, struct btrfs_key *found_key, |
1319 | u64 *flags_ret) | |
a542ad1b JS |
1320 | { |
1321 | int ret; | |
1322 | u64 flags; | |
261c84b6 | 1323 | u64 size = 0; |
a542ad1b JS |
1324 | u32 item_size; |
1325 | struct extent_buffer *eb; | |
1326 | struct btrfs_extent_item *ei; | |
1327 | struct btrfs_key key; | |
1328 | ||
261c84b6 JB |
1329 | if (btrfs_fs_incompat(fs_info, SKINNY_METADATA)) |
1330 | key.type = BTRFS_METADATA_ITEM_KEY; | |
1331 | else | |
1332 | key.type = BTRFS_EXTENT_ITEM_KEY; | |
a542ad1b JS |
1333 | key.objectid = logical; |
1334 | key.offset = (u64)-1; | |
1335 | ||
1336 | ret = btrfs_search_slot(NULL, fs_info->extent_root, &key, path, 0, 0); | |
1337 | if (ret < 0) | |
1338 | return ret; | |
1339 | ret = btrfs_previous_item(fs_info->extent_root, path, | |
1340 | 0, BTRFS_EXTENT_ITEM_KEY); | |
1341 | if (ret < 0) | |
1342 | return ret; | |
1343 | ||
1344 | btrfs_item_key_to_cpu(path->nodes[0], found_key, path->slots[0]); | |
261c84b6 JB |
1345 | if (found_key->type == BTRFS_METADATA_ITEM_KEY) |
1346 | size = fs_info->extent_root->leafsize; | |
1347 | else if (found_key->type == BTRFS_EXTENT_ITEM_KEY) | |
1348 | size = found_key->offset; | |
1349 | ||
1350 | if ((found_key->type != BTRFS_EXTENT_ITEM_KEY && | |
1351 | found_key->type != BTRFS_METADATA_ITEM_KEY) || | |
a542ad1b | 1352 | found_key->objectid > logical || |
261c84b6 | 1353 | found_key->objectid + size <= logical) { |
c1c9ff7c | 1354 | pr_debug("logical %llu is not within any extent\n", logical); |
a542ad1b | 1355 | return -ENOENT; |
4692cf58 | 1356 | } |
a542ad1b JS |
1357 | |
1358 | eb = path->nodes[0]; | |
1359 | item_size = btrfs_item_size_nr(eb, path->slots[0]); | |
1360 | BUG_ON(item_size < sizeof(*ei)); | |
1361 | ||
1362 | ei = btrfs_item_ptr(eb, path->slots[0], struct btrfs_extent_item); | |
1363 | flags = btrfs_extent_flags(eb, ei); | |
1364 | ||
4692cf58 JS |
1365 | pr_debug("logical %llu is at position %llu within the extent (%llu " |
1366 | "EXTENT_ITEM %llu) flags %#llx size %u\n", | |
c1c9ff7c GU |
1367 | logical, logical - found_key->objectid, found_key->objectid, |
1368 | found_key->offset, flags, item_size); | |
69917e43 LB |
1369 | |
1370 | WARN_ON(!flags_ret); | |
1371 | if (flags_ret) { | |
1372 | if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) | |
1373 | *flags_ret = BTRFS_EXTENT_FLAG_TREE_BLOCK; | |
1374 | else if (flags & BTRFS_EXTENT_FLAG_DATA) | |
1375 | *flags_ret = BTRFS_EXTENT_FLAG_DATA; | |
1376 | else | |
1377 | BUG_ON(1); | |
1378 | return 0; | |
1379 | } | |
a542ad1b JS |
1380 | |
1381 | return -EIO; | |
1382 | } | |
1383 | ||
1384 | /* | |
1385 | * helper function to iterate extent inline refs. ptr must point to a 0 value | |
1386 | * for the first call and may be modified. it is used to track state. | |
1387 | * if more refs exist, 0 is returned and the next call to | |
1388 | * __get_extent_inline_ref must pass the modified ptr parameter to get the | |
1389 | * next ref. after the last ref was processed, 1 is returned. | |
1390 | * returns <0 on error | |
1391 | */ | |
1392 | static int __get_extent_inline_ref(unsigned long *ptr, struct extent_buffer *eb, | |
1393 | struct btrfs_extent_item *ei, u32 item_size, | |
1394 | struct btrfs_extent_inline_ref **out_eiref, | |
1395 | int *out_type) | |
1396 | { | |
1397 | unsigned long end; | |
1398 | u64 flags; | |
1399 | struct btrfs_tree_block_info *info; | |
1400 | ||
1401 | if (!*ptr) { | |
1402 | /* first call */ | |
1403 | flags = btrfs_extent_flags(eb, ei); | |
1404 | if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { | |
1405 | info = (struct btrfs_tree_block_info *)(ei + 1); | |
1406 | *out_eiref = | |
1407 | (struct btrfs_extent_inline_ref *)(info + 1); | |
1408 | } else { | |
1409 | *out_eiref = (struct btrfs_extent_inline_ref *)(ei + 1); | |
1410 | } | |
1411 | *ptr = (unsigned long)*out_eiref; | |
1412 | if ((void *)*ptr >= (void *)ei + item_size) | |
1413 | return -ENOENT; | |
1414 | } | |
1415 | ||
1416 | end = (unsigned long)ei + item_size; | |
1417 | *out_eiref = (struct btrfs_extent_inline_ref *)*ptr; | |
1418 | *out_type = btrfs_extent_inline_ref_type(eb, *out_eiref); | |
1419 | ||
1420 | *ptr += btrfs_extent_inline_ref_size(*out_type); | |
1421 | WARN_ON(*ptr > end); | |
1422 | if (*ptr == end) | |
1423 | return 1; /* last */ | |
1424 | ||
1425 | return 0; | |
1426 | } | |
1427 | ||
1428 | /* | |
1429 | * reads the tree block backref for an extent. tree level and root are returned | |
1430 | * through out_level and out_root. ptr must point to a 0 value for the first | |
1431 | * call and may be modified (see __get_extent_inline_ref comment). | |
1432 | * returns 0 if data was provided, 1 if there was no more data to provide or | |
1433 | * <0 on error. | |
1434 | */ | |
1435 | int tree_backref_for_extent(unsigned long *ptr, struct extent_buffer *eb, | |
1436 | struct btrfs_extent_item *ei, u32 item_size, | |
1437 | u64 *out_root, u8 *out_level) | |
1438 | { | |
1439 | int ret; | |
1440 | int type; | |
1441 | struct btrfs_tree_block_info *info; | |
1442 | struct btrfs_extent_inline_ref *eiref; | |
1443 | ||
1444 | if (*ptr == (unsigned long)-1) | |
1445 | return 1; | |
1446 | ||
1447 | while (1) { | |
1448 | ret = __get_extent_inline_ref(ptr, eb, ei, item_size, | |
1449 | &eiref, &type); | |
1450 | if (ret < 0) | |
1451 | return ret; | |
1452 | ||
1453 | if (type == BTRFS_TREE_BLOCK_REF_KEY || | |
1454 | type == BTRFS_SHARED_BLOCK_REF_KEY) | |
1455 | break; | |
1456 | ||
1457 | if (ret == 1) | |
1458 | return 1; | |
1459 | } | |
1460 | ||
1461 | /* we can treat both ref types equally here */ | |
1462 | info = (struct btrfs_tree_block_info *)(ei + 1); | |
1463 | *out_root = btrfs_extent_inline_ref_offset(eb, eiref); | |
1464 | *out_level = btrfs_tree_block_level(eb, info); | |
1465 | ||
1466 | if (ret == 1) | |
1467 | *ptr = (unsigned long)-1; | |
1468 | ||
1469 | return 0; | |
1470 | } | |
1471 | ||
976b1908 JS |
1472 | static int iterate_leaf_refs(struct extent_inode_elem *inode_list, |
1473 | u64 root, u64 extent_item_objectid, | |
4692cf58 | 1474 | iterate_extent_inodes_t *iterate, void *ctx) |
a542ad1b | 1475 | { |
976b1908 | 1476 | struct extent_inode_elem *eie; |
4692cf58 | 1477 | int ret = 0; |
4692cf58 | 1478 | |
976b1908 | 1479 | for (eie = inode_list; eie; eie = eie->next) { |
4692cf58 | 1480 | pr_debug("ref for %llu resolved, key (%llu EXTEND_DATA %llu), " |
976b1908 JS |
1481 | "root %llu\n", extent_item_objectid, |
1482 | eie->inum, eie->offset, root); | |
1483 | ret = iterate(eie->inum, eie->offset, root, ctx); | |
4692cf58 | 1484 | if (ret) { |
976b1908 JS |
1485 | pr_debug("stopping iteration for %llu due to ret=%d\n", |
1486 | extent_item_objectid, ret); | |
4692cf58 JS |
1487 | break; |
1488 | } | |
a542ad1b JS |
1489 | } |
1490 | ||
a542ad1b JS |
1491 | return ret; |
1492 | } | |
1493 | ||
1494 | /* | |
1495 | * calls iterate() for every inode that references the extent identified by | |
4692cf58 | 1496 | * the given parameters. |
a542ad1b JS |
1497 | * when the iterator function returns a non-zero value, iteration stops. |
1498 | */ | |
1499 | int iterate_extent_inodes(struct btrfs_fs_info *fs_info, | |
4692cf58 | 1500 | u64 extent_item_objectid, u64 extent_item_pos, |
7a3ae2f8 | 1501 | int search_commit_root, |
a542ad1b JS |
1502 | iterate_extent_inodes_t *iterate, void *ctx) |
1503 | { | |
a542ad1b | 1504 | int ret; |
da61d31a | 1505 | struct btrfs_trans_handle *trans = NULL; |
7a3ae2f8 JS |
1506 | struct ulist *refs = NULL; |
1507 | struct ulist *roots = NULL; | |
4692cf58 JS |
1508 | struct ulist_node *ref_node = NULL; |
1509 | struct ulist_node *root_node = NULL; | |
8445f61c | 1510 | struct seq_list tree_mod_seq_elem = {}; |
cd1b413c JS |
1511 | struct ulist_iterator ref_uiter; |
1512 | struct ulist_iterator root_uiter; | |
a542ad1b | 1513 | |
4692cf58 JS |
1514 | pr_debug("resolving all inodes for extent %llu\n", |
1515 | extent_item_objectid); | |
a542ad1b | 1516 | |
da61d31a | 1517 | if (!search_commit_root) { |
7a3ae2f8 JS |
1518 | trans = btrfs_join_transaction(fs_info->extent_root); |
1519 | if (IS_ERR(trans)) | |
1520 | return PTR_ERR(trans); | |
8445f61c | 1521 | btrfs_get_tree_mod_seq(fs_info, &tree_mod_seq_elem); |
7a3ae2f8 | 1522 | } |
a542ad1b | 1523 | |
4692cf58 | 1524 | ret = btrfs_find_all_leafs(trans, fs_info, extent_item_objectid, |
097b8a7c | 1525 | tree_mod_seq_elem.seq, &refs, |
8445f61c | 1526 | &extent_item_pos); |
4692cf58 JS |
1527 | if (ret) |
1528 | goto out; | |
a542ad1b | 1529 | |
cd1b413c JS |
1530 | ULIST_ITER_INIT(&ref_uiter); |
1531 | while (!ret && (ref_node = ulist_next(refs, &ref_uiter))) { | |
976b1908 | 1532 | ret = btrfs_find_all_roots(trans, fs_info, ref_node->val, |
097b8a7c | 1533 | tree_mod_seq_elem.seq, &roots); |
4692cf58 JS |
1534 | if (ret) |
1535 | break; | |
cd1b413c JS |
1536 | ULIST_ITER_INIT(&root_uiter); |
1537 | while (!ret && (root_node = ulist_next(roots, &root_uiter))) { | |
976b1908 | 1538 | pr_debug("root %llu references leaf %llu, data list " |
34d73f54 | 1539 | "%#llx\n", root_node->val, ref_node->val, |
c1c9ff7c | 1540 | ref_node->aux); |
995e01b7 JS |
1541 | ret = iterate_leaf_refs((struct extent_inode_elem *) |
1542 | (uintptr_t)ref_node->aux, | |
1543 | root_node->val, | |
1544 | extent_item_objectid, | |
1545 | iterate, ctx); | |
4692cf58 | 1546 | } |
976b1908 | 1547 | ulist_free(roots); |
a542ad1b JS |
1548 | } |
1549 | ||
976b1908 | 1550 | free_leaf_list(refs); |
4692cf58 | 1551 | out: |
7a3ae2f8 | 1552 | if (!search_commit_root) { |
8445f61c | 1553 | btrfs_put_tree_mod_seq(fs_info, &tree_mod_seq_elem); |
7a3ae2f8 JS |
1554 | btrfs_end_transaction(trans, fs_info->extent_root); |
1555 | } | |
1556 | ||
a542ad1b JS |
1557 | return ret; |
1558 | } | |
1559 | ||
1560 | int iterate_inodes_from_logical(u64 logical, struct btrfs_fs_info *fs_info, | |
1561 | struct btrfs_path *path, | |
1562 | iterate_extent_inodes_t *iterate, void *ctx) | |
1563 | { | |
1564 | int ret; | |
4692cf58 | 1565 | u64 extent_item_pos; |
69917e43 | 1566 | u64 flags = 0; |
a542ad1b | 1567 | struct btrfs_key found_key; |
7a3ae2f8 | 1568 | int search_commit_root = path->search_commit_root; |
a542ad1b | 1569 | |
69917e43 | 1570 | ret = extent_from_logical(fs_info, logical, path, &found_key, &flags); |
4692cf58 | 1571 | btrfs_release_path(path); |
a542ad1b JS |
1572 | if (ret < 0) |
1573 | return ret; | |
69917e43 | 1574 | if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) |
3627bf45 | 1575 | return -EINVAL; |
a542ad1b | 1576 | |
4692cf58 | 1577 | extent_item_pos = logical - found_key.objectid; |
7a3ae2f8 JS |
1578 | ret = iterate_extent_inodes(fs_info, found_key.objectid, |
1579 | extent_item_pos, search_commit_root, | |
1580 | iterate, ctx); | |
a542ad1b JS |
1581 | |
1582 | return ret; | |
1583 | } | |
1584 | ||
d24bec3a MF |
1585 | typedef int (iterate_irefs_t)(u64 parent, u32 name_len, unsigned long name_off, |
1586 | struct extent_buffer *eb, void *ctx); | |
1587 | ||
1588 | static int iterate_inode_refs(u64 inum, struct btrfs_root *fs_root, | |
1589 | struct btrfs_path *path, | |
1590 | iterate_irefs_t *iterate, void *ctx) | |
a542ad1b | 1591 | { |
aefc1eb1 | 1592 | int ret = 0; |
a542ad1b JS |
1593 | int slot; |
1594 | u32 cur; | |
1595 | u32 len; | |
1596 | u32 name_len; | |
1597 | u64 parent = 0; | |
1598 | int found = 0; | |
1599 | struct extent_buffer *eb; | |
1600 | struct btrfs_item *item; | |
1601 | struct btrfs_inode_ref *iref; | |
1602 | struct btrfs_key found_key; | |
1603 | ||
aefc1eb1 | 1604 | while (!ret) { |
b916a59a | 1605 | path->leave_spinning = 1; |
a542ad1b | 1606 | ret = inode_ref_info(inum, parent ? parent+1 : 0, fs_root, path, |
d24bec3a | 1607 | &found_key); |
a542ad1b JS |
1608 | if (ret < 0) |
1609 | break; | |
1610 | if (ret) { | |
1611 | ret = found ? 0 : -ENOENT; | |
1612 | break; | |
1613 | } | |
1614 | ++found; | |
1615 | ||
1616 | parent = found_key.offset; | |
1617 | slot = path->slots[0]; | |
1618 | eb = path->nodes[0]; | |
1619 | /* make sure we can use eb after releasing the path */ | |
1620 | atomic_inc(&eb->refs); | |
b916a59a JS |
1621 | btrfs_tree_read_lock(eb); |
1622 | btrfs_set_lock_blocking_rw(eb, BTRFS_READ_LOCK); | |
a542ad1b JS |
1623 | btrfs_release_path(path); |
1624 | ||
dd3cc16b | 1625 | item = btrfs_item_nr(slot); |
a542ad1b JS |
1626 | iref = btrfs_item_ptr(eb, slot, struct btrfs_inode_ref); |
1627 | ||
1628 | for (cur = 0; cur < btrfs_item_size(eb, item); cur += len) { | |
1629 | name_len = btrfs_inode_ref_name_len(eb, iref); | |
1630 | /* path must be released before calling iterate()! */ | |
4692cf58 | 1631 | pr_debug("following ref at offset %u for inode %llu in " |
c1c9ff7c GU |
1632 | "tree %llu\n", cur, found_key.objectid, |
1633 | fs_root->objectid); | |
d24bec3a MF |
1634 | ret = iterate(parent, name_len, |
1635 | (unsigned long)(iref + 1), eb, ctx); | |
aefc1eb1 | 1636 | if (ret) |
a542ad1b | 1637 | break; |
a542ad1b JS |
1638 | len = sizeof(*iref) + name_len; |
1639 | iref = (struct btrfs_inode_ref *)((char *)iref + len); | |
1640 | } | |
b916a59a | 1641 | btrfs_tree_read_unlock_blocking(eb); |
a542ad1b JS |
1642 | free_extent_buffer(eb); |
1643 | } | |
1644 | ||
1645 | btrfs_release_path(path); | |
1646 | ||
1647 | return ret; | |
1648 | } | |
1649 | ||
d24bec3a MF |
1650 | static int iterate_inode_extrefs(u64 inum, struct btrfs_root *fs_root, |
1651 | struct btrfs_path *path, | |
1652 | iterate_irefs_t *iterate, void *ctx) | |
1653 | { | |
1654 | int ret; | |
1655 | int slot; | |
1656 | u64 offset = 0; | |
1657 | u64 parent; | |
1658 | int found = 0; | |
1659 | struct extent_buffer *eb; | |
1660 | struct btrfs_inode_extref *extref; | |
1661 | struct extent_buffer *leaf; | |
1662 | u32 item_size; | |
1663 | u32 cur_offset; | |
1664 | unsigned long ptr; | |
1665 | ||
1666 | while (1) { | |
1667 | ret = btrfs_find_one_extref(fs_root, inum, offset, path, &extref, | |
1668 | &offset); | |
1669 | if (ret < 0) | |
1670 | break; | |
1671 | if (ret) { | |
1672 | ret = found ? 0 : -ENOENT; | |
1673 | break; | |
1674 | } | |
1675 | ++found; | |
1676 | ||
1677 | slot = path->slots[0]; | |
1678 | eb = path->nodes[0]; | |
1679 | /* make sure we can use eb after releasing the path */ | |
1680 | atomic_inc(&eb->refs); | |
1681 | ||
1682 | btrfs_tree_read_lock(eb); | |
1683 | btrfs_set_lock_blocking_rw(eb, BTRFS_READ_LOCK); | |
1684 | btrfs_release_path(path); | |
1685 | ||
1686 | leaf = path->nodes[0]; | |
1687 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
1688 | ptr = btrfs_item_ptr_offset(leaf, path->slots[0]); | |
1689 | cur_offset = 0; | |
1690 | ||
1691 | while (cur_offset < item_size) { | |
1692 | u32 name_len; | |
1693 | ||
1694 | extref = (struct btrfs_inode_extref *)(ptr + cur_offset); | |
1695 | parent = btrfs_inode_extref_parent(eb, extref); | |
1696 | name_len = btrfs_inode_extref_name_len(eb, extref); | |
1697 | ret = iterate(parent, name_len, | |
1698 | (unsigned long)&extref->name, eb, ctx); | |
1699 | if (ret) | |
1700 | break; | |
1701 | ||
1702 | cur_offset += btrfs_inode_extref_name_len(leaf, extref); | |
1703 | cur_offset += sizeof(*extref); | |
1704 | } | |
1705 | btrfs_tree_read_unlock_blocking(eb); | |
1706 | free_extent_buffer(eb); | |
1707 | ||
1708 | offset++; | |
1709 | } | |
1710 | ||
1711 | btrfs_release_path(path); | |
1712 | ||
1713 | return ret; | |
1714 | } | |
1715 | ||
1716 | static int iterate_irefs(u64 inum, struct btrfs_root *fs_root, | |
1717 | struct btrfs_path *path, iterate_irefs_t *iterate, | |
1718 | void *ctx) | |
1719 | { | |
1720 | int ret; | |
1721 | int found_refs = 0; | |
1722 | ||
1723 | ret = iterate_inode_refs(inum, fs_root, path, iterate, ctx); | |
1724 | if (!ret) | |
1725 | ++found_refs; | |
1726 | else if (ret != -ENOENT) | |
1727 | return ret; | |
1728 | ||
1729 | ret = iterate_inode_extrefs(inum, fs_root, path, iterate, ctx); | |
1730 | if (ret == -ENOENT && found_refs) | |
1731 | return 0; | |
1732 | ||
1733 | return ret; | |
1734 | } | |
1735 | ||
a542ad1b JS |
1736 | /* |
1737 | * returns 0 if the path could be dumped (probably truncated) | |
1738 | * returns <0 in case of an error | |
1739 | */ | |
d24bec3a MF |
1740 | static int inode_to_path(u64 inum, u32 name_len, unsigned long name_off, |
1741 | struct extent_buffer *eb, void *ctx) | |
a542ad1b JS |
1742 | { |
1743 | struct inode_fs_paths *ipath = ctx; | |
1744 | char *fspath; | |
1745 | char *fspath_min; | |
1746 | int i = ipath->fspath->elem_cnt; | |
1747 | const int s_ptr = sizeof(char *); | |
1748 | u32 bytes_left; | |
1749 | ||
1750 | bytes_left = ipath->fspath->bytes_left > s_ptr ? | |
1751 | ipath->fspath->bytes_left - s_ptr : 0; | |
1752 | ||
740c3d22 | 1753 | fspath_min = (char *)ipath->fspath->val + (i + 1) * s_ptr; |
96b5bd77 JS |
1754 | fspath = btrfs_ref_to_path(ipath->fs_root, ipath->btrfs_path, name_len, |
1755 | name_off, eb, inum, fspath_min, bytes_left); | |
a542ad1b JS |
1756 | if (IS_ERR(fspath)) |
1757 | return PTR_ERR(fspath); | |
1758 | ||
1759 | if (fspath > fspath_min) { | |
745c4d8e | 1760 | ipath->fspath->val[i] = (u64)(unsigned long)fspath; |
a542ad1b JS |
1761 | ++ipath->fspath->elem_cnt; |
1762 | ipath->fspath->bytes_left = fspath - fspath_min; | |
1763 | } else { | |
1764 | ++ipath->fspath->elem_missed; | |
1765 | ipath->fspath->bytes_missing += fspath_min - fspath; | |
1766 | ipath->fspath->bytes_left = 0; | |
1767 | } | |
1768 | ||
1769 | return 0; | |
1770 | } | |
1771 | ||
1772 | /* | |
1773 | * this dumps all file system paths to the inode into the ipath struct, provided | |
1774 | * is has been created large enough. each path is zero-terminated and accessed | |
740c3d22 | 1775 | * from ipath->fspath->val[i]. |
a542ad1b | 1776 | * when it returns, there are ipath->fspath->elem_cnt number of paths available |
740c3d22 | 1777 | * in ipath->fspath->val[]. when the allocated space wasn't sufficient, the |
a542ad1b JS |
1778 | * number of missed paths in recored in ipath->fspath->elem_missed, otherwise, |
1779 | * it's zero. ipath->fspath->bytes_missing holds the number of bytes that would | |
1780 | * have been needed to return all paths. | |
1781 | */ | |
1782 | int paths_from_inode(u64 inum, struct inode_fs_paths *ipath) | |
1783 | { | |
1784 | return iterate_irefs(inum, ipath->fs_root, ipath->btrfs_path, | |
d24bec3a | 1785 | inode_to_path, ipath); |
a542ad1b JS |
1786 | } |
1787 | ||
a542ad1b JS |
1788 | struct btrfs_data_container *init_data_container(u32 total_bytes) |
1789 | { | |
1790 | struct btrfs_data_container *data; | |
1791 | size_t alloc_bytes; | |
1792 | ||
1793 | alloc_bytes = max_t(size_t, total_bytes, sizeof(*data)); | |
425d17a2 | 1794 | data = vmalloc(alloc_bytes); |
a542ad1b JS |
1795 | if (!data) |
1796 | return ERR_PTR(-ENOMEM); | |
1797 | ||
1798 | if (total_bytes >= sizeof(*data)) { | |
1799 | data->bytes_left = total_bytes - sizeof(*data); | |
1800 | data->bytes_missing = 0; | |
1801 | } else { | |
1802 | data->bytes_missing = sizeof(*data) - total_bytes; | |
1803 | data->bytes_left = 0; | |
1804 | } | |
1805 | ||
1806 | data->elem_cnt = 0; | |
1807 | data->elem_missed = 0; | |
1808 | ||
1809 | return data; | |
1810 | } | |
1811 | ||
1812 | /* | |
1813 | * allocates space to return multiple file system paths for an inode. | |
1814 | * total_bytes to allocate are passed, note that space usable for actual path | |
1815 | * information will be total_bytes - sizeof(struct inode_fs_paths). | |
1816 | * the returned pointer must be freed with free_ipath() in the end. | |
1817 | */ | |
1818 | struct inode_fs_paths *init_ipath(s32 total_bytes, struct btrfs_root *fs_root, | |
1819 | struct btrfs_path *path) | |
1820 | { | |
1821 | struct inode_fs_paths *ifp; | |
1822 | struct btrfs_data_container *fspath; | |
1823 | ||
1824 | fspath = init_data_container(total_bytes); | |
1825 | if (IS_ERR(fspath)) | |
1826 | return (void *)fspath; | |
1827 | ||
1828 | ifp = kmalloc(sizeof(*ifp), GFP_NOFS); | |
1829 | if (!ifp) { | |
1830 | kfree(fspath); | |
1831 | return ERR_PTR(-ENOMEM); | |
1832 | } | |
1833 | ||
1834 | ifp->btrfs_path = path; | |
1835 | ifp->fspath = fspath; | |
1836 | ifp->fs_root = fs_root; | |
1837 | ||
1838 | return ifp; | |
1839 | } | |
1840 | ||
1841 | void free_ipath(struct inode_fs_paths *ipath) | |
1842 | { | |
4735fb28 JJ |
1843 | if (!ipath) |
1844 | return; | |
425d17a2 | 1845 | vfree(ipath->fspath); |
a542ad1b JS |
1846 | kfree(ipath); |
1847 | } |