Commit | Line | Data |
---|---|---|
6cbd5570 CM |
1 | /* |
2 | * Copyright (C) 2007 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 | */ | |
ec6b910f | 18 | #include <linux/sched.h> |
edbd8d4e | 19 | #include <linux/pagemap.h> |
ec44a35c | 20 | #include <linux/writeback.h> |
21af804c | 21 | #include <linux/blkdev.h> |
b7a9f29f | 22 | #include <linux/sort.h> |
4184ea7f | 23 | #include <linux/rcupdate.h> |
817d52f8 | 24 | #include <linux/kthread.h> |
5a0e3ad6 | 25 | #include <linux/slab.h> |
dff51cd1 | 26 | #include <linux/ratelimit.h> |
b150a4f1 | 27 | #include <linux/percpu_counter.h> |
74493f7a | 28 | #include "hash.h" |
995946dd | 29 | #include "tree-log.h" |
fec577fb CM |
30 | #include "disk-io.h" |
31 | #include "print-tree.h" | |
0b86a832 | 32 | #include "volumes.h" |
53b381b3 | 33 | #include "raid56.h" |
925baedd | 34 | #include "locking.h" |
fa9c0d79 | 35 | #include "free-space-cache.h" |
3fed40cc | 36 | #include "math.h" |
6ab0a202 | 37 | #include "sysfs.h" |
fcebe456 | 38 | #include "qgroup.h" |
fec577fb | 39 | |
709c0486 AJ |
40 | #undef SCRAMBLE_DELAYED_REFS |
41 | ||
9e622d6b MX |
42 | /* |
43 | * control flags for do_chunk_alloc's force field | |
0e4f8f88 CM |
44 | * CHUNK_ALLOC_NO_FORCE means to only allocate a chunk |
45 | * if we really need one. | |
46 | * | |
0e4f8f88 CM |
47 | * CHUNK_ALLOC_LIMITED means to only try and allocate one |
48 | * if we have very few chunks already allocated. This is | |
49 | * used as part of the clustering code to help make sure | |
50 | * we have a good pool of storage to cluster in, without | |
51 | * filling the FS with empty chunks | |
52 | * | |
9e622d6b MX |
53 | * CHUNK_ALLOC_FORCE means it must try to allocate one |
54 | * | |
0e4f8f88 CM |
55 | */ |
56 | enum { | |
57 | CHUNK_ALLOC_NO_FORCE = 0, | |
9e622d6b MX |
58 | CHUNK_ALLOC_LIMITED = 1, |
59 | CHUNK_ALLOC_FORCE = 2, | |
0e4f8f88 CM |
60 | }; |
61 | ||
fb25e914 JB |
62 | /* |
63 | * Control how reservations are dealt with. | |
64 | * | |
65 | * RESERVE_FREE - freeing a reservation. | |
66 | * RESERVE_ALLOC - allocating space and we need to update bytes_may_use for | |
67 | * ENOSPC accounting | |
68 | * RESERVE_ALLOC_NO_ACCOUNT - allocating space and we should not update | |
69 | * bytes_may_use as the ENOSPC accounting is done elsewhere | |
70 | */ | |
71 | enum { | |
72 | RESERVE_FREE = 0, | |
73 | RESERVE_ALLOC = 1, | |
74 | RESERVE_ALLOC_NO_ACCOUNT = 2, | |
75 | }; | |
76 | ||
ce93ec54 JB |
77 | static int update_block_group(struct btrfs_trans_handle *trans, |
78 | struct btrfs_root *root, u64 bytenr, | |
79 | u64 num_bytes, int alloc); | |
5d4f98a2 YZ |
80 | static int __btrfs_free_extent(struct btrfs_trans_handle *trans, |
81 | struct btrfs_root *root, | |
82 | u64 bytenr, u64 num_bytes, u64 parent, | |
83 | u64 root_objectid, u64 owner_objectid, | |
84 | u64 owner_offset, int refs_to_drop, | |
fcebe456 JB |
85 | struct btrfs_delayed_extent_op *extra_op, |
86 | int no_quota); | |
5d4f98a2 YZ |
87 | static void __run_delayed_extent_op(struct btrfs_delayed_extent_op *extent_op, |
88 | struct extent_buffer *leaf, | |
89 | struct btrfs_extent_item *ei); | |
90 | static int alloc_reserved_file_extent(struct btrfs_trans_handle *trans, | |
91 | struct btrfs_root *root, | |
92 | u64 parent, u64 root_objectid, | |
93 | u64 flags, u64 owner, u64 offset, | |
94 | struct btrfs_key *ins, int ref_mod); | |
95 | static int alloc_reserved_tree_block(struct btrfs_trans_handle *trans, | |
96 | struct btrfs_root *root, | |
97 | u64 parent, u64 root_objectid, | |
98 | u64 flags, struct btrfs_disk_key *key, | |
fcebe456 JB |
99 | int level, struct btrfs_key *ins, |
100 | int no_quota); | |
6a63209f | 101 | static int do_chunk_alloc(struct btrfs_trans_handle *trans, |
698d0082 JB |
102 | struct btrfs_root *extent_root, u64 flags, |
103 | int force); | |
11833d66 YZ |
104 | static int find_next_key(struct btrfs_path *path, int level, |
105 | struct btrfs_key *key); | |
9ed74f2d JB |
106 | static void dump_space_info(struct btrfs_space_info *info, u64 bytes, |
107 | int dump_block_groups); | |
fb25e914 | 108 | static int btrfs_update_reserved_bytes(struct btrfs_block_group_cache *cache, |
e570fd27 MX |
109 | u64 num_bytes, int reserve, |
110 | int delalloc); | |
5d80366e JB |
111 | static int block_rsv_use_bytes(struct btrfs_block_rsv *block_rsv, |
112 | u64 num_bytes); | |
48a3b636 ES |
113 | int btrfs_pin_extent(struct btrfs_root *root, |
114 | u64 bytenr, u64 num_bytes, int reserved); | |
6a63209f | 115 | |
817d52f8 JB |
116 | static noinline int |
117 | block_group_cache_done(struct btrfs_block_group_cache *cache) | |
118 | { | |
119 | smp_mb(); | |
36cce922 JB |
120 | return cache->cached == BTRFS_CACHE_FINISHED || |
121 | cache->cached == BTRFS_CACHE_ERROR; | |
817d52f8 JB |
122 | } |
123 | ||
0f9dd46c JB |
124 | static int block_group_bits(struct btrfs_block_group_cache *cache, u64 bits) |
125 | { | |
126 | return (cache->flags & bits) == bits; | |
127 | } | |
128 | ||
62a45b60 | 129 | static void btrfs_get_block_group(struct btrfs_block_group_cache *cache) |
11dfe35a JB |
130 | { |
131 | atomic_inc(&cache->count); | |
132 | } | |
133 | ||
134 | void btrfs_put_block_group(struct btrfs_block_group_cache *cache) | |
135 | { | |
f0486c68 YZ |
136 | if (atomic_dec_and_test(&cache->count)) { |
137 | WARN_ON(cache->pinned > 0); | |
138 | WARN_ON(cache->reserved > 0); | |
34d52cb6 | 139 | kfree(cache->free_space_ctl); |
11dfe35a | 140 | kfree(cache); |
f0486c68 | 141 | } |
11dfe35a JB |
142 | } |
143 | ||
0f9dd46c JB |
144 | /* |
145 | * this adds the block group to the fs_info rb tree for the block group | |
146 | * cache | |
147 | */ | |
b2950863 | 148 | static int btrfs_add_block_group_cache(struct btrfs_fs_info *info, |
0f9dd46c JB |
149 | struct btrfs_block_group_cache *block_group) |
150 | { | |
151 | struct rb_node **p; | |
152 | struct rb_node *parent = NULL; | |
153 | struct btrfs_block_group_cache *cache; | |
154 | ||
155 | spin_lock(&info->block_group_cache_lock); | |
156 | p = &info->block_group_cache_tree.rb_node; | |
157 | ||
158 | while (*p) { | |
159 | parent = *p; | |
160 | cache = rb_entry(parent, struct btrfs_block_group_cache, | |
161 | cache_node); | |
162 | if (block_group->key.objectid < cache->key.objectid) { | |
163 | p = &(*p)->rb_left; | |
164 | } else if (block_group->key.objectid > cache->key.objectid) { | |
165 | p = &(*p)->rb_right; | |
166 | } else { | |
167 | spin_unlock(&info->block_group_cache_lock); | |
168 | return -EEXIST; | |
169 | } | |
170 | } | |
171 | ||
172 | rb_link_node(&block_group->cache_node, parent, p); | |
173 | rb_insert_color(&block_group->cache_node, | |
174 | &info->block_group_cache_tree); | |
a1897fdd LB |
175 | |
176 | if (info->first_logical_byte > block_group->key.objectid) | |
177 | info->first_logical_byte = block_group->key.objectid; | |
178 | ||
0f9dd46c JB |
179 | spin_unlock(&info->block_group_cache_lock); |
180 | ||
181 | return 0; | |
182 | } | |
183 | ||
184 | /* | |
185 | * This will return the block group at or after bytenr if contains is 0, else | |
186 | * it will return the block group that contains the bytenr | |
187 | */ | |
188 | static struct btrfs_block_group_cache * | |
189 | block_group_cache_tree_search(struct btrfs_fs_info *info, u64 bytenr, | |
190 | int contains) | |
191 | { | |
192 | struct btrfs_block_group_cache *cache, *ret = NULL; | |
193 | struct rb_node *n; | |
194 | u64 end, start; | |
195 | ||
196 | spin_lock(&info->block_group_cache_lock); | |
197 | n = info->block_group_cache_tree.rb_node; | |
198 | ||
199 | while (n) { | |
200 | cache = rb_entry(n, struct btrfs_block_group_cache, | |
201 | cache_node); | |
202 | end = cache->key.objectid + cache->key.offset - 1; | |
203 | start = cache->key.objectid; | |
204 | ||
205 | if (bytenr < start) { | |
206 | if (!contains && (!ret || start < ret->key.objectid)) | |
207 | ret = cache; | |
208 | n = n->rb_left; | |
209 | } else if (bytenr > start) { | |
210 | if (contains && bytenr <= end) { | |
211 | ret = cache; | |
212 | break; | |
213 | } | |
214 | n = n->rb_right; | |
215 | } else { | |
216 | ret = cache; | |
217 | break; | |
218 | } | |
219 | } | |
a1897fdd | 220 | if (ret) { |
11dfe35a | 221 | btrfs_get_block_group(ret); |
a1897fdd LB |
222 | if (bytenr == 0 && info->first_logical_byte > ret->key.objectid) |
223 | info->first_logical_byte = ret->key.objectid; | |
224 | } | |
0f9dd46c JB |
225 | spin_unlock(&info->block_group_cache_lock); |
226 | ||
227 | return ret; | |
228 | } | |
229 | ||
11833d66 YZ |
230 | static int add_excluded_extent(struct btrfs_root *root, |
231 | u64 start, u64 num_bytes) | |
817d52f8 | 232 | { |
11833d66 YZ |
233 | u64 end = start + num_bytes - 1; |
234 | set_extent_bits(&root->fs_info->freed_extents[0], | |
235 | start, end, EXTENT_UPTODATE, GFP_NOFS); | |
236 | set_extent_bits(&root->fs_info->freed_extents[1], | |
237 | start, end, EXTENT_UPTODATE, GFP_NOFS); | |
238 | return 0; | |
239 | } | |
817d52f8 | 240 | |
11833d66 YZ |
241 | static void free_excluded_extents(struct btrfs_root *root, |
242 | struct btrfs_block_group_cache *cache) | |
243 | { | |
244 | u64 start, end; | |
817d52f8 | 245 | |
11833d66 YZ |
246 | start = cache->key.objectid; |
247 | end = start + cache->key.offset - 1; | |
248 | ||
249 | clear_extent_bits(&root->fs_info->freed_extents[0], | |
250 | start, end, EXTENT_UPTODATE, GFP_NOFS); | |
251 | clear_extent_bits(&root->fs_info->freed_extents[1], | |
252 | start, end, EXTENT_UPTODATE, GFP_NOFS); | |
817d52f8 JB |
253 | } |
254 | ||
11833d66 YZ |
255 | static int exclude_super_stripes(struct btrfs_root *root, |
256 | struct btrfs_block_group_cache *cache) | |
817d52f8 | 257 | { |
817d52f8 JB |
258 | u64 bytenr; |
259 | u64 *logical; | |
260 | int stripe_len; | |
261 | int i, nr, ret; | |
262 | ||
06b2331f YZ |
263 | if (cache->key.objectid < BTRFS_SUPER_INFO_OFFSET) { |
264 | stripe_len = BTRFS_SUPER_INFO_OFFSET - cache->key.objectid; | |
265 | cache->bytes_super += stripe_len; | |
266 | ret = add_excluded_extent(root, cache->key.objectid, | |
267 | stripe_len); | |
835d974f JB |
268 | if (ret) |
269 | return ret; | |
06b2331f YZ |
270 | } |
271 | ||
817d52f8 JB |
272 | for (i = 0; i < BTRFS_SUPER_MIRROR_MAX; i++) { |
273 | bytenr = btrfs_sb_offset(i); | |
274 | ret = btrfs_rmap_block(&root->fs_info->mapping_tree, | |
275 | cache->key.objectid, bytenr, | |
276 | 0, &logical, &nr, &stripe_len); | |
835d974f JB |
277 | if (ret) |
278 | return ret; | |
11833d66 | 279 | |
817d52f8 | 280 | while (nr--) { |
51bf5f0b JB |
281 | u64 start, len; |
282 | ||
283 | if (logical[nr] > cache->key.objectid + | |
284 | cache->key.offset) | |
285 | continue; | |
286 | ||
287 | if (logical[nr] + stripe_len <= cache->key.objectid) | |
288 | continue; | |
289 | ||
290 | start = logical[nr]; | |
291 | if (start < cache->key.objectid) { | |
292 | start = cache->key.objectid; | |
293 | len = (logical[nr] + stripe_len) - start; | |
294 | } else { | |
295 | len = min_t(u64, stripe_len, | |
296 | cache->key.objectid + | |
297 | cache->key.offset - start); | |
298 | } | |
299 | ||
300 | cache->bytes_super += len; | |
301 | ret = add_excluded_extent(root, start, len); | |
835d974f JB |
302 | if (ret) { |
303 | kfree(logical); | |
304 | return ret; | |
305 | } | |
817d52f8 | 306 | } |
11833d66 | 307 | |
817d52f8 JB |
308 | kfree(logical); |
309 | } | |
817d52f8 JB |
310 | return 0; |
311 | } | |
312 | ||
11833d66 YZ |
313 | static struct btrfs_caching_control * |
314 | get_caching_control(struct btrfs_block_group_cache *cache) | |
315 | { | |
316 | struct btrfs_caching_control *ctl; | |
317 | ||
318 | spin_lock(&cache->lock); | |
dde5abee JB |
319 | if (!cache->caching_ctl) { |
320 | spin_unlock(&cache->lock); | |
11833d66 YZ |
321 | return NULL; |
322 | } | |
323 | ||
324 | ctl = cache->caching_ctl; | |
325 | atomic_inc(&ctl->count); | |
326 | spin_unlock(&cache->lock); | |
327 | return ctl; | |
328 | } | |
329 | ||
330 | static void put_caching_control(struct btrfs_caching_control *ctl) | |
331 | { | |
332 | if (atomic_dec_and_test(&ctl->count)) | |
333 | kfree(ctl); | |
334 | } | |
335 | ||
0f9dd46c JB |
336 | /* |
337 | * this is only called by cache_block_group, since we could have freed extents | |
338 | * we need to check the pinned_extents for any extents that can't be used yet | |
339 | * since their free space will be released as soon as the transaction commits. | |
340 | */ | |
817d52f8 | 341 | static u64 add_new_free_space(struct btrfs_block_group_cache *block_group, |
0f9dd46c JB |
342 | struct btrfs_fs_info *info, u64 start, u64 end) |
343 | { | |
817d52f8 | 344 | u64 extent_start, extent_end, size, total_added = 0; |
0f9dd46c JB |
345 | int ret; |
346 | ||
347 | while (start < end) { | |
11833d66 | 348 | ret = find_first_extent_bit(info->pinned_extents, start, |
0f9dd46c | 349 | &extent_start, &extent_end, |
e6138876 JB |
350 | EXTENT_DIRTY | EXTENT_UPTODATE, |
351 | NULL); | |
0f9dd46c JB |
352 | if (ret) |
353 | break; | |
354 | ||
06b2331f | 355 | if (extent_start <= start) { |
0f9dd46c JB |
356 | start = extent_end + 1; |
357 | } else if (extent_start > start && extent_start < end) { | |
358 | size = extent_start - start; | |
817d52f8 | 359 | total_added += size; |
ea6a478e JB |
360 | ret = btrfs_add_free_space(block_group, start, |
361 | size); | |
79787eaa | 362 | BUG_ON(ret); /* -ENOMEM or logic error */ |
0f9dd46c JB |
363 | start = extent_end + 1; |
364 | } else { | |
365 | break; | |
366 | } | |
367 | } | |
368 | ||
369 | if (start < end) { | |
370 | size = end - start; | |
817d52f8 | 371 | total_added += size; |
ea6a478e | 372 | ret = btrfs_add_free_space(block_group, start, size); |
79787eaa | 373 | BUG_ON(ret); /* -ENOMEM or logic error */ |
0f9dd46c JB |
374 | } |
375 | ||
817d52f8 | 376 | return total_added; |
0f9dd46c JB |
377 | } |
378 | ||
d458b054 | 379 | static noinline void caching_thread(struct btrfs_work *work) |
e37c9e69 | 380 | { |
bab39bf9 JB |
381 | struct btrfs_block_group_cache *block_group; |
382 | struct btrfs_fs_info *fs_info; | |
383 | struct btrfs_caching_control *caching_ctl; | |
384 | struct btrfs_root *extent_root; | |
e37c9e69 | 385 | struct btrfs_path *path; |
5f39d397 | 386 | struct extent_buffer *leaf; |
11833d66 | 387 | struct btrfs_key key; |
817d52f8 | 388 | u64 total_found = 0; |
11833d66 YZ |
389 | u64 last = 0; |
390 | u32 nritems; | |
36cce922 | 391 | int ret = -ENOMEM; |
f510cfec | 392 | |
bab39bf9 JB |
393 | caching_ctl = container_of(work, struct btrfs_caching_control, work); |
394 | block_group = caching_ctl->block_group; | |
395 | fs_info = block_group->fs_info; | |
396 | extent_root = fs_info->extent_root; | |
397 | ||
e37c9e69 CM |
398 | path = btrfs_alloc_path(); |
399 | if (!path) | |
bab39bf9 | 400 | goto out; |
7d7d6068 | 401 | |
817d52f8 | 402 | last = max_t(u64, block_group->key.objectid, BTRFS_SUPER_INFO_OFFSET); |
11833d66 | 403 | |
5cd57b2c | 404 | /* |
817d52f8 JB |
405 | * We don't want to deadlock with somebody trying to allocate a new |
406 | * extent for the extent root while also trying to search the extent | |
407 | * root to add free space. So we skip locking and search the commit | |
408 | * root, since its read-only | |
5cd57b2c CM |
409 | */ |
410 | path->skip_locking = 1; | |
817d52f8 | 411 | path->search_commit_root = 1; |
026fd317 | 412 | path->reada = 1; |
817d52f8 | 413 | |
e4404d6e | 414 | key.objectid = last; |
e37c9e69 | 415 | key.offset = 0; |
11833d66 | 416 | key.type = BTRFS_EXTENT_ITEM_KEY; |
013f1b12 | 417 | again: |
11833d66 | 418 | mutex_lock(&caching_ctl->mutex); |
013f1b12 | 419 | /* need to make sure the commit_root doesn't disappear */ |
9e351cc8 | 420 | down_read(&fs_info->commit_root_sem); |
013f1b12 | 421 | |
52ee28d2 | 422 | next: |
11833d66 | 423 | ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0); |
e37c9e69 | 424 | if (ret < 0) |
ef8bbdfe | 425 | goto err; |
a512bbf8 | 426 | |
11833d66 YZ |
427 | leaf = path->nodes[0]; |
428 | nritems = btrfs_header_nritems(leaf); | |
429 | ||
d397712b | 430 | while (1) { |
7841cb28 | 431 | if (btrfs_fs_closing(fs_info) > 1) { |
f25784b3 | 432 | last = (u64)-1; |
817d52f8 | 433 | break; |
f25784b3 | 434 | } |
817d52f8 | 435 | |
11833d66 YZ |
436 | if (path->slots[0] < nritems) { |
437 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
438 | } else { | |
439 | ret = find_next_key(path, 0, &key); | |
440 | if (ret) | |
e37c9e69 | 441 | break; |
817d52f8 | 442 | |
c9ea7b24 | 443 | if (need_resched() || |
9e351cc8 | 444 | rwsem_is_contended(&fs_info->commit_root_sem)) { |
589d8ade | 445 | caching_ctl->progress = last; |
ff5714cc | 446 | btrfs_release_path(path); |
9e351cc8 | 447 | up_read(&fs_info->commit_root_sem); |
589d8ade | 448 | mutex_unlock(&caching_ctl->mutex); |
11833d66 | 449 | cond_resched(); |
589d8ade JB |
450 | goto again; |
451 | } | |
0a3896d0 JB |
452 | |
453 | ret = btrfs_next_leaf(extent_root, path); | |
454 | if (ret < 0) | |
455 | goto err; | |
456 | if (ret) | |
457 | break; | |
589d8ade JB |
458 | leaf = path->nodes[0]; |
459 | nritems = btrfs_header_nritems(leaf); | |
460 | continue; | |
11833d66 | 461 | } |
817d52f8 | 462 | |
52ee28d2 LB |
463 | if (key.objectid < last) { |
464 | key.objectid = last; | |
465 | key.offset = 0; | |
466 | key.type = BTRFS_EXTENT_ITEM_KEY; | |
467 | ||
468 | caching_ctl->progress = last; | |
469 | btrfs_release_path(path); | |
470 | goto next; | |
471 | } | |
472 | ||
11833d66 YZ |
473 | if (key.objectid < block_group->key.objectid) { |
474 | path->slots[0]++; | |
817d52f8 | 475 | continue; |
e37c9e69 | 476 | } |
0f9dd46c | 477 | |
e37c9e69 | 478 | if (key.objectid >= block_group->key.objectid + |
0f9dd46c | 479 | block_group->key.offset) |
e37c9e69 | 480 | break; |
7d7d6068 | 481 | |
3173a18f JB |
482 | if (key.type == BTRFS_EXTENT_ITEM_KEY || |
483 | key.type == BTRFS_METADATA_ITEM_KEY) { | |
817d52f8 JB |
484 | total_found += add_new_free_space(block_group, |
485 | fs_info, last, | |
486 | key.objectid); | |
3173a18f JB |
487 | if (key.type == BTRFS_METADATA_ITEM_KEY) |
488 | last = key.objectid + | |
707e8a07 | 489 | fs_info->tree_root->nodesize; |
3173a18f JB |
490 | else |
491 | last = key.objectid + key.offset; | |
817d52f8 | 492 | |
11833d66 YZ |
493 | if (total_found > (1024 * 1024 * 2)) { |
494 | total_found = 0; | |
495 | wake_up(&caching_ctl->wait); | |
496 | } | |
817d52f8 | 497 | } |
e37c9e69 CM |
498 | path->slots[0]++; |
499 | } | |
817d52f8 | 500 | ret = 0; |
e37c9e69 | 501 | |
817d52f8 JB |
502 | total_found += add_new_free_space(block_group, fs_info, last, |
503 | block_group->key.objectid + | |
504 | block_group->key.offset); | |
11833d66 | 505 | caching_ctl->progress = (u64)-1; |
817d52f8 JB |
506 | |
507 | spin_lock(&block_group->lock); | |
11833d66 | 508 | block_group->caching_ctl = NULL; |
817d52f8 JB |
509 | block_group->cached = BTRFS_CACHE_FINISHED; |
510 | spin_unlock(&block_group->lock); | |
0f9dd46c | 511 | |
54aa1f4d | 512 | err: |
e37c9e69 | 513 | btrfs_free_path(path); |
9e351cc8 | 514 | up_read(&fs_info->commit_root_sem); |
817d52f8 | 515 | |
11833d66 YZ |
516 | free_excluded_extents(extent_root, block_group); |
517 | ||
518 | mutex_unlock(&caching_ctl->mutex); | |
bab39bf9 | 519 | out: |
36cce922 JB |
520 | if (ret) { |
521 | spin_lock(&block_group->lock); | |
522 | block_group->caching_ctl = NULL; | |
523 | block_group->cached = BTRFS_CACHE_ERROR; | |
524 | spin_unlock(&block_group->lock); | |
525 | } | |
11833d66 YZ |
526 | wake_up(&caching_ctl->wait); |
527 | ||
528 | put_caching_control(caching_ctl); | |
11dfe35a | 529 | btrfs_put_block_group(block_group); |
817d52f8 JB |
530 | } |
531 | ||
9d66e233 | 532 | static int cache_block_group(struct btrfs_block_group_cache *cache, |
9d66e233 | 533 | int load_cache_only) |
817d52f8 | 534 | { |
291c7d2f | 535 | DEFINE_WAIT(wait); |
11833d66 YZ |
536 | struct btrfs_fs_info *fs_info = cache->fs_info; |
537 | struct btrfs_caching_control *caching_ctl; | |
817d52f8 JB |
538 | int ret = 0; |
539 | ||
291c7d2f | 540 | caching_ctl = kzalloc(sizeof(*caching_ctl), GFP_NOFS); |
79787eaa JM |
541 | if (!caching_ctl) |
542 | return -ENOMEM; | |
291c7d2f JB |
543 | |
544 | INIT_LIST_HEAD(&caching_ctl->list); | |
545 | mutex_init(&caching_ctl->mutex); | |
546 | init_waitqueue_head(&caching_ctl->wait); | |
547 | caching_ctl->block_group = cache; | |
548 | caching_ctl->progress = cache->key.objectid; | |
549 | atomic_set(&caching_ctl->count, 1); | |
9e0af237 LB |
550 | btrfs_init_work(&caching_ctl->work, btrfs_cache_helper, |
551 | caching_thread, NULL, NULL); | |
291c7d2f JB |
552 | |
553 | spin_lock(&cache->lock); | |
554 | /* | |
555 | * This should be a rare occasion, but this could happen I think in the | |
556 | * case where one thread starts to load the space cache info, and then | |
557 | * some other thread starts a transaction commit which tries to do an | |
558 | * allocation while the other thread is still loading the space cache | |
559 | * info. The previous loop should have kept us from choosing this block | |
560 | * group, but if we've moved to the state where we will wait on caching | |
561 | * block groups we need to first check if we're doing a fast load here, | |
562 | * so we can wait for it to finish, otherwise we could end up allocating | |
563 | * from a block group who's cache gets evicted for one reason or | |
564 | * another. | |
565 | */ | |
566 | while (cache->cached == BTRFS_CACHE_FAST) { | |
567 | struct btrfs_caching_control *ctl; | |
568 | ||
569 | ctl = cache->caching_ctl; | |
570 | atomic_inc(&ctl->count); | |
571 | prepare_to_wait(&ctl->wait, &wait, TASK_UNINTERRUPTIBLE); | |
572 | spin_unlock(&cache->lock); | |
573 | ||
574 | schedule(); | |
575 | ||
576 | finish_wait(&ctl->wait, &wait); | |
577 | put_caching_control(ctl); | |
578 | spin_lock(&cache->lock); | |
579 | } | |
580 | ||
581 | if (cache->cached != BTRFS_CACHE_NO) { | |
582 | spin_unlock(&cache->lock); | |
583 | kfree(caching_ctl); | |
11833d66 | 584 | return 0; |
291c7d2f JB |
585 | } |
586 | WARN_ON(cache->caching_ctl); | |
587 | cache->caching_ctl = caching_ctl; | |
588 | cache->cached = BTRFS_CACHE_FAST; | |
589 | spin_unlock(&cache->lock); | |
11833d66 | 590 | |
d53ba474 | 591 | if (fs_info->mount_opt & BTRFS_MOUNT_SPACE_CACHE) { |
cb83b7b8 | 592 | mutex_lock(&caching_ctl->mutex); |
9d66e233 JB |
593 | ret = load_free_space_cache(fs_info, cache); |
594 | ||
595 | spin_lock(&cache->lock); | |
596 | if (ret == 1) { | |
291c7d2f | 597 | cache->caching_ctl = NULL; |
9d66e233 JB |
598 | cache->cached = BTRFS_CACHE_FINISHED; |
599 | cache->last_byte_to_unpin = (u64)-1; | |
cb83b7b8 | 600 | caching_ctl->progress = (u64)-1; |
9d66e233 | 601 | } else { |
291c7d2f JB |
602 | if (load_cache_only) { |
603 | cache->caching_ctl = NULL; | |
604 | cache->cached = BTRFS_CACHE_NO; | |
605 | } else { | |
606 | cache->cached = BTRFS_CACHE_STARTED; | |
4f69cb98 | 607 | cache->has_caching_ctl = 1; |
291c7d2f | 608 | } |
9d66e233 JB |
609 | } |
610 | spin_unlock(&cache->lock); | |
cb83b7b8 JB |
611 | mutex_unlock(&caching_ctl->mutex); |
612 | ||
291c7d2f | 613 | wake_up(&caching_ctl->wait); |
3c14874a | 614 | if (ret == 1) { |
291c7d2f | 615 | put_caching_control(caching_ctl); |
3c14874a | 616 | free_excluded_extents(fs_info->extent_root, cache); |
9d66e233 | 617 | return 0; |
3c14874a | 618 | } |
291c7d2f JB |
619 | } else { |
620 | /* | |
621 | * We are not going to do the fast caching, set cached to the | |
622 | * appropriate value and wakeup any waiters. | |
623 | */ | |
624 | spin_lock(&cache->lock); | |
625 | if (load_cache_only) { | |
626 | cache->caching_ctl = NULL; | |
627 | cache->cached = BTRFS_CACHE_NO; | |
628 | } else { | |
629 | cache->cached = BTRFS_CACHE_STARTED; | |
4f69cb98 | 630 | cache->has_caching_ctl = 1; |
291c7d2f JB |
631 | } |
632 | spin_unlock(&cache->lock); | |
633 | wake_up(&caching_ctl->wait); | |
9d66e233 JB |
634 | } |
635 | ||
291c7d2f JB |
636 | if (load_cache_only) { |
637 | put_caching_control(caching_ctl); | |
11833d66 | 638 | return 0; |
817d52f8 | 639 | } |
817d52f8 | 640 | |
9e351cc8 | 641 | down_write(&fs_info->commit_root_sem); |
291c7d2f | 642 | atomic_inc(&caching_ctl->count); |
11833d66 | 643 | list_add_tail(&caching_ctl->list, &fs_info->caching_block_groups); |
9e351cc8 | 644 | up_write(&fs_info->commit_root_sem); |
11833d66 | 645 | |
11dfe35a | 646 | btrfs_get_block_group(cache); |
11833d66 | 647 | |
e66f0bb1 | 648 | btrfs_queue_work(fs_info->caching_workers, &caching_ctl->work); |
817d52f8 | 649 | |
ef8bbdfe | 650 | return ret; |
e37c9e69 CM |
651 | } |
652 | ||
0f9dd46c JB |
653 | /* |
654 | * return the block group that starts at or after bytenr | |
655 | */ | |
d397712b CM |
656 | static struct btrfs_block_group_cache * |
657 | btrfs_lookup_first_block_group(struct btrfs_fs_info *info, u64 bytenr) | |
0ef3e66b | 658 | { |
0f9dd46c | 659 | struct btrfs_block_group_cache *cache; |
0ef3e66b | 660 | |
0f9dd46c | 661 | cache = block_group_cache_tree_search(info, bytenr, 0); |
0ef3e66b | 662 | |
0f9dd46c | 663 | return cache; |
0ef3e66b CM |
664 | } |
665 | ||
0f9dd46c | 666 | /* |
9f55684c | 667 | * return the block group that contains the given bytenr |
0f9dd46c | 668 | */ |
d397712b CM |
669 | struct btrfs_block_group_cache *btrfs_lookup_block_group( |
670 | struct btrfs_fs_info *info, | |
671 | u64 bytenr) | |
be744175 | 672 | { |
0f9dd46c | 673 | struct btrfs_block_group_cache *cache; |
be744175 | 674 | |
0f9dd46c | 675 | cache = block_group_cache_tree_search(info, bytenr, 1); |
96b5179d | 676 | |
0f9dd46c | 677 | return cache; |
be744175 | 678 | } |
0b86a832 | 679 | |
0f9dd46c JB |
680 | static struct btrfs_space_info *__find_space_info(struct btrfs_fs_info *info, |
681 | u64 flags) | |
6324fbf3 | 682 | { |
0f9dd46c | 683 | struct list_head *head = &info->space_info; |
0f9dd46c | 684 | struct btrfs_space_info *found; |
4184ea7f | 685 | |
52ba6929 | 686 | flags &= BTRFS_BLOCK_GROUP_TYPE_MASK; |
b742bb82 | 687 | |
4184ea7f CM |
688 | rcu_read_lock(); |
689 | list_for_each_entry_rcu(found, head, list) { | |
67377734 | 690 | if (found->flags & flags) { |
4184ea7f | 691 | rcu_read_unlock(); |
0f9dd46c | 692 | return found; |
4184ea7f | 693 | } |
0f9dd46c | 694 | } |
4184ea7f | 695 | rcu_read_unlock(); |
0f9dd46c | 696 | return NULL; |
6324fbf3 CM |
697 | } |
698 | ||
4184ea7f CM |
699 | /* |
700 | * after adding space to the filesystem, we need to clear the full flags | |
701 | * on all the space infos. | |
702 | */ | |
703 | void btrfs_clear_space_info_full(struct btrfs_fs_info *info) | |
704 | { | |
705 | struct list_head *head = &info->space_info; | |
706 | struct btrfs_space_info *found; | |
707 | ||
708 | rcu_read_lock(); | |
709 | list_for_each_entry_rcu(found, head, list) | |
710 | found->full = 0; | |
711 | rcu_read_unlock(); | |
712 | } | |
713 | ||
1a4ed8fd FM |
714 | /* simple helper to search for an existing data extent at a given offset */ |
715 | int btrfs_lookup_data_extent(struct btrfs_root *root, u64 start, u64 len) | |
e02119d5 CM |
716 | { |
717 | int ret; | |
718 | struct btrfs_key key; | |
31840ae1 | 719 | struct btrfs_path *path; |
e02119d5 | 720 | |
31840ae1 | 721 | path = btrfs_alloc_path(); |
d8926bb3 MF |
722 | if (!path) |
723 | return -ENOMEM; | |
724 | ||
e02119d5 CM |
725 | key.objectid = start; |
726 | key.offset = len; | |
3173a18f | 727 | key.type = BTRFS_EXTENT_ITEM_KEY; |
e02119d5 CM |
728 | ret = btrfs_search_slot(NULL, root->fs_info->extent_root, &key, path, |
729 | 0, 0); | |
31840ae1 | 730 | btrfs_free_path(path); |
7bb86316 CM |
731 | return ret; |
732 | } | |
733 | ||
a22285a6 | 734 | /* |
3173a18f | 735 | * helper function to lookup reference count and flags of a tree block. |
a22285a6 YZ |
736 | * |
737 | * the head node for delayed ref is used to store the sum of all the | |
738 | * reference count modifications queued up in the rbtree. the head | |
739 | * node may also store the extent flags to set. This way you can check | |
740 | * to see what the reference count and extent flags would be if all of | |
741 | * the delayed refs are not processed. | |
742 | */ | |
743 | int btrfs_lookup_extent_info(struct btrfs_trans_handle *trans, | |
744 | struct btrfs_root *root, u64 bytenr, | |
3173a18f | 745 | u64 offset, int metadata, u64 *refs, u64 *flags) |
a22285a6 YZ |
746 | { |
747 | struct btrfs_delayed_ref_head *head; | |
748 | struct btrfs_delayed_ref_root *delayed_refs; | |
749 | struct btrfs_path *path; | |
750 | struct btrfs_extent_item *ei; | |
751 | struct extent_buffer *leaf; | |
752 | struct btrfs_key key; | |
753 | u32 item_size; | |
754 | u64 num_refs; | |
755 | u64 extent_flags; | |
756 | int ret; | |
757 | ||
3173a18f JB |
758 | /* |
759 | * If we don't have skinny metadata, don't bother doing anything | |
760 | * different | |
761 | */ | |
762 | if (metadata && !btrfs_fs_incompat(root->fs_info, SKINNY_METADATA)) { | |
707e8a07 | 763 | offset = root->nodesize; |
3173a18f JB |
764 | metadata = 0; |
765 | } | |
766 | ||
a22285a6 YZ |
767 | path = btrfs_alloc_path(); |
768 | if (!path) | |
769 | return -ENOMEM; | |
770 | ||
a22285a6 YZ |
771 | if (!trans) { |
772 | path->skip_locking = 1; | |
773 | path->search_commit_root = 1; | |
774 | } | |
639eefc8 FDBM |
775 | |
776 | search_again: | |
777 | key.objectid = bytenr; | |
778 | key.offset = offset; | |
779 | if (metadata) | |
780 | key.type = BTRFS_METADATA_ITEM_KEY; | |
781 | else | |
782 | key.type = BTRFS_EXTENT_ITEM_KEY; | |
783 | ||
a22285a6 YZ |
784 | ret = btrfs_search_slot(trans, root->fs_info->extent_root, |
785 | &key, path, 0, 0); | |
786 | if (ret < 0) | |
787 | goto out_free; | |
788 | ||
3173a18f | 789 | if (ret > 0 && metadata && key.type == BTRFS_METADATA_ITEM_KEY) { |
74be9510 FDBM |
790 | if (path->slots[0]) { |
791 | path->slots[0]--; | |
792 | btrfs_item_key_to_cpu(path->nodes[0], &key, | |
793 | path->slots[0]); | |
794 | if (key.objectid == bytenr && | |
795 | key.type == BTRFS_EXTENT_ITEM_KEY && | |
707e8a07 | 796 | key.offset == root->nodesize) |
74be9510 FDBM |
797 | ret = 0; |
798 | } | |
3173a18f JB |
799 | } |
800 | ||
a22285a6 YZ |
801 | if (ret == 0) { |
802 | leaf = path->nodes[0]; | |
803 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
804 | if (item_size >= sizeof(*ei)) { | |
805 | ei = btrfs_item_ptr(leaf, path->slots[0], | |
806 | struct btrfs_extent_item); | |
807 | num_refs = btrfs_extent_refs(leaf, ei); | |
808 | extent_flags = btrfs_extent_flags(leaf, ei); | |
809 | } else { | |
810 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
811 | struct btrfs_extent_item_v0 *ei0; | |
812 | BUG_ON(item_size != sizeof(*ei0)); | |
813 | ei0 = btrfs_item_ptr(leaf, path->slots[0], | |
814 | struct btrfs_extent_item_v0); | |
815 | num_refs = btrfs_extent_refs_v0(leaf, ei0); | |
816 | /* FIXME: this isn't correct for data */ | |
817 | extent_flags = BTRFS_BLOCK_FLAG_FULL_BACKREF; | |
818 | #else | |
819 | BUG(); | |
820 | #endif | |
821 | } | |
822 | BUG_ON(num_refs == 0); | |
823 | } else { | |
824 | num_refs = 0; | |
825 | extent_flags = 0; | |
826 | ret = 0; | |
827 | } | |
828 | ||
829 | if (!trans) | |
830 | goto out; | |
831 | ||
832 | delayed_refs = &trans->transaction->delayed_refs; | |
833 | spin_lock(&delayed_refs->lock); | |
834 | head = btrfs_find_delayed_ref_head(trans, bytenr); | |
835 | if (head) { | |
836 | if (!mutex_trylock(&head->mutex)) { | |
837 | atomic_inc(&head->node.refs); | |
838 | spin_unlock(&delayed_refs->lock); | |
839 | ||
b3b4aa74 | 840 | btrfs_release_path(path); |
a22285a6 | 841 | |
8cc33e5c DS |
842 | /* |
843 | * Mutex was contended, block until it's released and try | |
844 | * again | |
845 | */ | |
a22285a6 YZ |
846 | mutex_lock(&head->mutex); |
847 | mutex_unlock(&head->mutex); | |
848 | btrfs_put_delayed_ref(&head->node); | |
639eefc8 | 849 | goto search_again; |
a22285a6 | 850 | } |
d7df2c79 | 851 | spin_lock(&head->lock); |
a22285a6 YZ |
852 | if (head->extent_op && head->extent_op->update_flags) |
853 | extent_flags |= head->extent_op->flags_to_set; | |
854 | else | |
855 | BUG_ON(num_refs == 0); | |
856 | ||
857 | num_refs += head->node.ref_mod; | |
d7df2c79 | 858 | spin_unlock(&head->lock); |
a22285a6 YZ |
859 | mutex_unlock(&head->mutex); |
860 | } | |
861 | spin_unlock(&delayed_refs->lock); | |
862 | out: | |
863 | WARN_ON(num_refs == 0); | |
864 | if (refs) | |
865 | *refs = num_refs; | |
866 | if (flags) | |
867 | *flags = extent_flags; | |
868 | out_free: | |
869 | btrfs_free_path(path); | |
870 | return ret; | |
871 | } | |
872 | ||
d8d5f3e1 CM |
873 | /* |
874 | * Back reference rules. Back refs have three main goals: | |
875 | * | |
876 | * 1) differentiate between all holders of references to an extent so that | |
877 | * when a reference is dropped we can make sure it was a valid reference | |
878 | * before freeing the extent. | |
879 | * | |
880 | * 2) Provide enough information to quickly find the holders of an extent | |
881 | * if we notice a given block is corrupted or bad. | |
882 | * | |
883 | * 3) Make it easy to migrate blocks for FS shrinking or storage pool | |
884 | * maintenance. This is actually the same as #2, but with a slightly | |
885 | * different use case. | |
886 | * | |
5d4f98a2 YZ |
887 | * There are two kinds of back refs. The implicit back refs is optimized |
888 | * for pointers in non-shared tree blocks. For a given pointer in a block, | |
889 | * back refs of this kind provide information about the block's owner tree | |
890 | * and the pointer's key. These information allow us to find the block by | |
891 | * b-tree searching. The full back refs is for pointers in tree blocks not | |
892 | * referenced by their owner trees. The location of tree block is recorded | |
893 | * in the back refs. Actually the full back refs is generic, and can be | |
894 | * used in all cases the implicit back refs is used. The major shortcoming | |
895 | * of the full back refs is its overhead. Every time a tree block gets | |
896 | * COWed, we have to update back refs entry for all pointers in it. | |
897 | * | |
898 | * For a newly allocated tree block, we use implicit back refs for | |
899 | * pointers in it. This means most tree related operations only involve | |
900 | * implicit back refs. For a tree block created in old transaction, the | |
901 | * only way to drop a reference to it is COW it. So we can detect the | |
902 | * event that tree block loses its owner tree's reference and do the | |
903 | * back refs conversion. | |
904 | * | |
905 | * When a tree block is COW'd through a tree, there are four cases: | |
906 | * | |
907 | * The reference count of the block is one and the tree is the block's | |
908 | * owner tree. Nothing to do in this case. | |
909 | * | |
910 | * The reference count of the block is one and the tree is not the | |
911 | * block's owner tree. In this case, full back refs is used for pointers | |
912 | * in the block. Remove these full back refs, add implicit back refs for | |
913 | * every pointers in the new block. | |
914 | * | |
915 | * The reference count of the block is greater than one and the tree is | |
916 | * the block's owner tree. In this case, implicit back refs is used for | |
917 | * pointers in the block. Add full back refs for every pointers in the | |
918 | * block, increase lower level extents' reference counts. The original | |
919 | * implicit back refs are entailed to the new block. | |
920 | * | |
921 | * The reference count of the block is greater than one and the tree is | |
922 | * not the block's owner tree. Add implicit back refs for every pointer in | |
923 | * the new block, increase lower level extents' reference count. | |
924 | * | |
925 | * Back Reference Key composing: | |
926 | * | |
927 | * The key objectid corresponds to the first byte in the extent, | |
928 | * The key type is used to differentiate between types of back refs. | |
929 | * There are different meanings of the key offset for different types | |
930 | * of back refs. | |
931 | * | |
d8d5f3e1 CM |
932 | * File extents can be referenced by: |
933 | * | |
934 | * - multiple snapshots, subvolumes, or different generations in one subvol | |
31840ae1 | 935 | * - different files inside a single subvolume |
d8d5f3e1 CM |
936 | * - different offsets inside a file (bookend extents in file.c) |
937 | * | |
5d4f98a2 | 938 | * The extent ref structure for the implicit back refs has fields for: |
d8d5f3e1 CM |
939 | * |
940 | * - Objectid of the subvolume root | |
d8d5f3e1 | 941 | * - objectid of the file holding the reference |
5d4f98a2 YZ |
942 | * - original offset in the file |
943 | * - how many bookend extents | |
d8d5f3e1 | 944 | * |
5d4f98a2 YZ |
945 | * The key offset for the implicit back refs is hash of the first |
946 | * three fields. | |
d8d5f3e1 | 947 | * |
5d4f98a2 | 948 | * The extent ref structure for the full back refs has field for: |
d8d5f3e1 | 949 | * |
5d4f98a2 | 950 | * - number of pointers in the tree leaf |
d8d5f3e1 | 951 | * |
5d4f98a2 YZ |
952 | * The key offset for the implicit back refs is the first byte of |
953 | * the tree leaf | |
d8d5f3e1 | 954 | * |
5d4f98a2 YZ |
955 | * When a file extent is allocated, The implicit back refs is used. |
956 | * the fields are filled in: | |
d8d5f3e1 | 957 | * |
5d4f98a2 | 958 | * (root_key.objectid, inode objectid, offset in file, 1) |
d8d5f3e1 | 959 | * |
5d4f98a2 YZ |
960 | * When a file extent is removed file truncation, we find the |
961 | * corresponding implicit back refs and check the following fields: | |
d8d5f3e1 | 962 | * |
5d4f98a2 | 963 | * (btrfs_header_owner(leaf), inode objectid, offset in file) |
d8d5f3e1 | 964 | * |
5d4f98a2 | 965 | * Btree extents can be referenced by: |
d8d5f3e1 | 966 | * |
5d4f98a2 | 967 | * - Different subvolumes |
d8d5f3e1 | 968 | * |
5d4f98a2 YZ |
969 | * Both the implicit back refs and the full back refs for tree blocks |
970 | * only consist of key. The key offset for the implicit back refs is | |
971 | * objectid of block's owner tree. The key offset for the full back refs | |
972 | * is the first byte of parent block. | |
d8d5f3e1 | 973 | * |
5d4f98a2 YZ |
974 | * When implicit back refs is used, information about the lowest key and |
975 | * level of the tree block are required. These information are stored in | |
976 | * tree block info structure. | |
d8d5f3e1 | 977 | */ |
31840ae1 | 978 | |
5d4f98a2 YZ |
979 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 |
980 | static int convert_extent_item_v0(struct btrfs_trans_handle *trans, | |
981 | struct btrfs_root *root, | |
982 | struct btrfs_path *path, | |
983 | u64 owner, u32 extra_size) | |
7bb86316 | 984 | { |
5d4f98a2 YZ |
985 | struct btrfs_extent_item *item; |
986 | struct btrfs_extent_item_v0 *ei0; | |
987 | struct btrfs_extent_ref_v0 *ref0; | |
988 | struct btrfs_tree_block_info *bi; | |
989 | struct extent_buffer *leaf; | |
7bb86316 | 990 | struct btrfs_key key; |
5d4f98a2 YZ |
991 | struct btrfs_key found_key; |
992 | u32 new_size = sizeof(*item); | |
993 | u64 refs; | |
994 | int ret; | |
995 | ||
996 | leaf = path->nodes[0]; | |
997 | BUG_ON(btrfs_item_size_nr(leaf, path->slots[0]) != sizeof(*ei0)); | |
998 | ||
999 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
1000 | ei0 = btrfs_item_ptr(leaf, path->slots[0], | |
1001 | struct btrfs_extent_item_v0); | |
1002 | refs = btrfs_extent_refs_v0(leaf, ei0); | |
1003 | ||
1004 | if (owner == (u64)-1) { | |
1005 | while (1) { | |
1006 | if (path->slots[0] >= btrfs_header_nritems(leaf)) { | |
1007 | ret = btrfs_next_leaf(root, path); | |
1008 | if (ret < 0) | |
1009 | return ret; | |
79787eaa | 1010 | BUG_ON(ret > 0); /* Corruption */ |
5d4f98a2 YZ |
1011 | leaf = path->nodes[0]; |
1012 | } | |
1013 | btrfs_item_key_to_cpu(leaf, &found_key, | |
1014 | path->slots[0]); | |
1015 | BUG_ON(key.objectid != found_key.objectid); | |
1016 | if (found_key.type != BTRFS_EXTENT_REF_V0_KEY) { | |
1017 | path->slots[0]++; | |
1018 | continue; | |
1019 | } | |
1020 | ref0 = btrfs_item_ptr(leaf, path->slots[0], | |
1021 | struct btrfs_extent_ref_v0); | |
1022 | owner = btrfs_ref_objectid_v0(leaf, ref0); | |
1023 | break; | |
1024 | } | |
1025 | } | |
b3b4aa74 | 1026 | btrfs_release_path(path); |
5d4f98a2 YZ |
1027 | |
1028 | if (owner < BTRFS_FIRST_FREE_OBJECTID) | |
1029 | new_size += sizeof(*bi); | |
1030 | ||
1031 | new_size -= sizeof(*ei0); | |
1032 | ret = btrfs_search_slot(trans, root, &key, path, | |
1033 | new_size + extra_size, 1); | |
1034 | if (ret < 0) | |
1035 | return ret; | |
79787eaa | 1036 | BUG_ON(ret); /* Corruption */ |
5d4f98a2 | 1037 | |
4b90c680 | 1038 | btrfs_extend_item(root, path, new_size); |
5d4f98a2 YZ |
1039 | |
1040 | leaf = path->nodes[0]; | |
1041 | item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); | |
1042 | btrfs_set_extent_refs(leaf, item, refs); | |
1043 | /* FIXME: get real generation */ | |
1044 | btrfs_set_extent_generation(leaf, item, 0); | |
1045 | if (owner < BTRFS_FIRST_FREE_OBJECTID) { | |
1046 | btrfs_set_extent_flags(leaf, item, | |
1047 | BTRFS_EXTENT_FLAG_TREE_BLOCK | | |
1048 | BTRFS_BLOCK_FLAG_FULL_BACKREF); | |
1049 | bi = (struct btrfs_tree_block_info *)(item + 1); | |
1050 | /* FIXME: get first key of the block */ | |
1051 | memset_extent_buffer(leaf, 0, (unsigned long)bi, sizeof(*bi)); | |
1052 | btrfs_set_tree_block_level(leaf, bi, (int)owner); | |
1053 | } else { | |
1054 | btrfs_set_extent_flags(leaf, item, BTRFS_EXTENT_FLAG_DATA); | |
1055 | } | |
1056 | btrfs_mark_buffer_dirty(leaf); | |
1057 | return 0; | |
1058 | } | |
1059 | #endif | |
1060 | ||
1061 | static u64 hash_extent_data_ref(u64 root_objectid, u64 owner, u64 offset) | |
1062 | { | |
1063 | u32 high_crc = ~(u32)0; | |
1064 | u32 low_crc = ~(u32)0; | |
1065 | __le64 lenum; | |
1066 | ||
1067 | lenum = cpu_to_le64(root_objectid); | |
14a958e6 | 1068 | high_crc = btrfs_crc32c(high_crc, &lenum, sizeof(lenum)); |
5d4f98a2 | 1069 | lenum = cpu_to_le64(owner); |
14a958e6 | 1070 | low_crc = btrfs_crc32c(low_crc, &lenum, sizeof(lenum)); |
5d4f98a2 | 1071 | lenum = cpu_to_le64(offset); |
14a958e6 | 1072 | low_crc = btrfs_crc32c(low_crc, &lenum, sizeof(lenum)); |
5d4f98a2 YZ |
1073 | |
1074 | return ((u64)high_crc << 31) ^ (u64)low_crc; | |
1075 | } | |
1076 | ||
1077 | static u64 hash_extent_data_ref_item(struct extent_buffer *leaf, | |
1078 | struct btrfs_extent_data_ref *ref) | |
1079 | { | |
1080 | return hash_extent_data_ref(btrfs_extent_data_ref_root(leaf, ref), | |
1081 | btrfs_extent_data_ref_objectid(leaf, ref), | |
1082 | btrfs_extent_data_ref_offset(leaf, ref)); | |
1083 | } | |
1084 | ||
1085 | static int match_extent_data_ref(struct extent_buffer *leaf, | |
1086 | struct btrfs_extent_data_ref *ref, | |
1087 | u64 root_objectid, u64 owner, u64 offset) | |
1088 | { | |
1089 | if (btrfs_extent_data_ref_root(leaf, ref) != root_objectid || | |
1090 | btrfs_extent_data_ref_objectid(leaf, ref) != owner || | |
1091 | btrfs_extent_data_ref_offset(leaf, ref) != offset) | |
1092 | return 0; | |
1093 | return 1; | |
1094 | } | |
1095 | ||
1096 | static noinline int lookup_extent_data_ref(struct btrfs_trans_handle *trans, | |
1097 | struct btrfs_root *root, | |
1098 | struct btrfs_path *path, | |
1099 | u64 bytenr, u64 parent, | |
1100 | u64 root_objectid, | |
1101 | u64 owner, u64 offset) | |
1102 | { | |
1103 | struct btrfs_key key; | |
1104 | struct btrfs_extent_data_ref *ref; | |
31840ae1 | 1105 | struct extent_buffer *leaf; |
5d4f98a2 | 1106 | u32 nritems; |
74493f7a | 1107 | int ret; |
5d4f98a2 YZ |
1108 | int recow; |
1109 | int err = -ENOENT; | |
74493f7a | 1110 | |
31840ae1 | 1111 | key.objectid = bytenr; |
5d4f98a2 YZ |
1112 | if (parent) { |
1113 | key.type = BTRFS_SHARED_DATA_REF_KEY; | |
1114 | key.offset = parent; | |
1115 | } else { | |
1116 | key.type = BTRFS_EXTENT_DATA_REF_KEY; | |
1117 | key.offset = hash_extent_data_ref(root_objectid, | |
1118 | owner, offset); | |
1119 | } | |
1120 | again: | |
1121 | recow = 0; | |
1122 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); | |
1123 | if (ret < 0) { | |
1124 | err = ret; | |
1125 | goto fail; | |
1126 | } | |
31840ae1 | 1127 | |
5d4f98a2 YZ |
1128 | if (parent) { |
1129 | if (!ret) | |
1130 | return 0; | |
1131 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
1132 | key.type = BTRFS_EXTENT_REF_V0_KEY; | |
b3b4aa74 | 1133 | btrfs_release_path(path); |
5d4f98a2 YZ |
1134 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); |
1135 | if (ret < 0) { | |
1136 | err = ret; | |
1137 | goto fail; | |
1138 | } | |
1139 | if (!ret) | |
1140 | return 0; | |
1141 | #endif | |
1142 | goto fail; | |
31840ae1 ZY |
1143 | } |
1144 | ||
1145 | leaf = path->nodes[0]; | |
5d4f98a2 YZ |
1146 | nritems = btrfs_header_nritems(leaf); |
1147 | while (1) { | |
1148 | if (path->slots[0] >= nritems) { | |
1149 | ret = btrfs_next_leaf(root, path); | |
1150 | if (ret < 0) | |
1151 | err = ret; | |
1152 | if (ret) | |
1153 | goto fail; | |
1154 | ||
1155 | leaf = path->nodes[0]; | |
1156 | nritems = btrfs_header_nritems(leaf); | |
1157 | recow = 1; | |
1158 | } | |
1159 | ||
1160 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
1161 | if (key.objectid != bytenr || | |
1162 | key.type != BTRFS_EXTENT_DATA_REF_KEY) | |
1163 | goto fail; | |
1164 | ||
1165 | ref = btrfs_item_ptr(leaf, path->slots[0], | |
1166 | struct btrfs_extent_data_ref); | |
1167 | ||
1168 | if (match_extent_data_ref(leaf, ref, root_objectid, | |
1169 | owner, offset)) { | |
1170 | if (recow) { | |
b3b4aa74 | 1171 | btrfs_release_path(path); |
5d4f98a2 YZ |
1172 | goto again; |
1173 | } | |
1174 | err = 0; | |
1175 | break; | |
1176 | } | |
1177 | path->slots[0]++; | |
31840ae1 | 1178 | } |
5d4f98a2 YZ |
1179 | fail: |
1180 | return err; | |
31840ae1 ZY |
1181 | } |
1182 | ||
5d4f98a2 YZ |
1183 | static noinline int insert_extent_data_ref(struct btrfs_trans_handle *trans, |
1184 | struct btrfs_root *root, | |
1185 | struct btrfs_path *path, | |
1186 | u64 bytenr, u64 parent, | |
1187 | u64 root_objectid, u64 owner, | |
1188 | u64 offset, int refs_to_add) | |
31840ae1 ZY |
1189 | { |
1190 | struct btrfs_key key; | |
1191 | struct extent_buffer *leaf; | |
5d4f98a2 | 1192 | u32 size; |
31840ae1 ZY |
1193 | u32 num_refs; |
1194 | int ret; | |
74493f7a | 1195 | |
74493f7a | 1196 | key.objectid = bytenr; |
5d4f98a2 YZ |
1197 | if (parent) { |
1198 | key.type = BTRFS_SHARED_DATA_REF_KEY; | |
1199 | key.offset = parent; | |
1200 | size = sizeof(struct btrfs_shared_data_ref); | |
1201 | } else { | |
1202 | key.type = BTRFS_EXTENT_DATA_REF_KEY; | |
1203 | key.offset = hash_extent_data_ref(root_objectid, | |
1204 | owner, offset); | |
1205 | size = sizeof(struct btrfs_extent_data_ref); | |
1206 | } | |
74493f7a | 1207 | |
5d4f98a2 YZ |
1208 | ret = btrfs_insert_empty_item(trans, root, path, &key, size); |
1209 | if (ret && ret != -EEXIST) | |
1210 | goto fail; | |
1211 | ||
1212 | leaf = path->nodes[0]; | |
1213 | if (parent) { | |
1214 | struct btrfs_shared_data_ref *ref; | |
31840ae1 | 1215 | ref = btrfs_item_ptr(leaf, path->slots[0], |
5d4f98a2 YZ |
1216 | struct btrfs_shared_data_ref); |
1217 | if (ret == 0) { | |
1218 | btrfs_set_shared_data_ref_count(leaf, ref, refs_to_add); | |
1219 | } else { | |
1220 | num_refs = btrfs_shared_data_ref_count(leaf, ref); | |
1221 | num_refs += refs_to_add; | |
1222 | btrfs_set_shared_data_ref_count(leaf, ref, num_refs); | |
31840ae1 | 1223 | } |
5d4f98a2 YZ |
1224 | } else { |
1225 | struct btrfs_extent_data_ref *ref; | |
1226 | while (ret == -EEXIST) { | |
1227 | ref = btrfs_item_ptr(leaf, path->slots[0], | |
1228 | struct btrfs_extent_data_ref); | |
1229 | if (match_extent_data_ref(leaf, ref, root_objectid, | |
1230 | owner, offset)) | |
1231 | break; | |
b3b4aa74 | 1232 | btrfs_release_path(path); |
5d4f98a2 YZ |
1233 | key.offset++; |
1234 | ret = btrfs_insert_empty_item(trans, root, path, &key, | |
1235 | size); | |
1236 | if (ret && ret != -EEXIST) | |
1237 | goto fail; | |
31840ae1 | 1238 | |
5d4f98a2 YZ |
1239 | leaf = path->nodes[0]; |
1240 | } | |
1241 | ref = btrfs_item_ptr(leaf, path->slots[0], | |
1242 | struct btrfs_extent_data_ref); | |
1243 | if (ret == 0) { | |
1244 | btrfs_set_extent_data_ref_root(leaf, ref, | |
1245 | root_objectid); | |
1246 | btrfs_set_extent_data_ref_objectid(leaf, ref, owner); | |
1247 | btrfs_set_extent_data_ref_offset(leaf, ref, offset); | |
1248 | btrfs_set_extent_data_ref_count(leaf, ref, refs_to_add); | |
1249 | } else { | |
1250 | num_refs = btrfs_extent_data_ref_count(leaf, ref); | |
1251 | num_refs += refs_to_add; | |
1252 | btrfs_set_extent_data_ref_count(leaf, ref, num_refs); | |
31840ae1 | 1253 | } |
31840ae1 | 1254 | } |
5d4f98a2 YZ |
1255 | btrfs_mark_buffer_dirty(leaf); |
1256 | ret = 0; | |
1257 | fail: | |
b3b4aa74 | 1258 | btrfs_release_path(path); |
7bb86316 | 1259 | return ret; |
74493f7a CM |
1260 | } |
1261 | ||
5d4f98a2 YZ |
1262 | static noinline int remove_extent_data_ref(struct btrfs_trans_handle *trans, |
1263 | struct btrfs_root *root, | |
1264 | struct btrfs_path *path, | |
fcebe456 | 1265 | int refs_to_drop, int *last_ref) |
31840ae1 | 1266 | { |
5d4f98a2 YZ |
1267 | struct btrfs_key key; |
1268 | struct btrfs_extent_data_ref *ref1 = NULL; | |
1269 | struct btrfs_shared_data_ref *ref2 = NULL; | |
31840ae1 | 1270 | struct extent_buffer *leaf; |
5d4f98a2 | 1271 | u32 num_refs = 0; |
31840ae1 ZY |
1272 | int ret = 0; |
1273 | ||
1274 | leaf = path->nodes[0]; | |
5d4f98a2 YZ |
1275 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); |
1276 | ||
1277 | if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { | |
1278 | ref1 = btrfs_item_ptr(leaf, path->slots[0], | |
1279 | struct btrfs_extent_data_ref); | |
1280 | num_refs = btrfs_extent_data_ref_count(leaf, ref1); | |
1281 | } else if (key.type == BTRFS_SHARED_DATA_REF_KEY) { | |
1282 | ref2 = btrfs_item_ptr(leaf, path->slots[0], | |
1283 | struct btrfs_shared_data_ref); | |
1284 | num_refs = btrfs_shared_data_ref_count(leaf, ref2); | |
1285 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
1286 | } else if (key.type == BTRFS_EXTENT_REF_V0_KEY) { | |
1287 | struct btrfs_extent_ref_v0 *ref0; | |
1288 | ref0 = btrfs_item_ptr(leaf, path->slots[0], | |
1289 | struct btrfs_extent_ref_v0); | |
1290 | num_refs = btrfs_ref_count_v0(leaf, ref0); | |
1291 | #endif | |
1292 | } else { | |
1293 | BUG(); | |
1294 | } | |
1295 | ||
56bec294 CM |
1296 | BUG_ON(num_refs < refs_to_drop); |
1297 | num_refs -= refs_to_drop; | |
5d4f98a2 | 1298 | |
31840ae1 ZY |
1299 | if (num_refs == 0) { |
1300 | ret = btrfs_del_item(trans, root, path); | |
fcebe456 | 1301 | *last_ref = 1; |
31840ae1 | 1302 | } else { |
5d4f98a2 YZ |
1303 | if (key.type == BTRFS_EXTENT_DATA_REF_KEY) |
1304 | btrfs_set_extent_data_ref_count(leaf, ref1, num_refs); | |
1305 | else if (key.type == BTRFS_SHARED_DATA_REF_KEY) | |
1306 | btrfs_set_shared_data_ref_count(leaf, ref2, num_refs); | |
1307 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
1308 | else { | |
1309 | struct btrfs_extent_ref_v0 *ref0; | |
1310 | ref0 = btrfs_item_ptr(leaf, path->slots[0], | |
1311 | struct btrfs_extent_ref_v0); | |
1312 | btrfs_set_ref_count_v0(leaf, ref0, num_refs); | |
1313 | } | |
1314 | #endif | |
31840ae1 ZY |
1315 | btrfs_mark_buffer_dirty(leaf); |
1316 | } | |
31840ae1 ZY |
1317 | return ret; |
1318 | } | |
1319 | ||
5d4f98a2 YZ |
1320 | static noinline u32 extent_data_ref_count(struct btrfs_root *root, |
1321 | struct btrfs_path *path, | |
1322 | struct btrfs_extent_inline_ref *iref) | |
15916de8 | 1323 | { |
5d4f98a2 YZ |
1324 | struct btrfs_key key; |
1325 | struct extent_buffer *leaf; | |
1326 | struct btrfs_extent_data_ref *ref1; | |
1327 | struct btrfs_shared_data_ref *ref2; | |
1328 | u32 num_refs = 0; | |
1329 | ||
1330 | leaf = path->nodes[0]; | |
1331 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
1332 | if (iref) { | |
1333 | if (btrfs_extent_inline_ref_type(leaf, iref) == | |
1334 | BTRFS_EXTENT_DATA_REF_KEY) { | |
1335 | ref1 = (struct btrfs_extent_data_ref *)(&iref->offset); | |
1336 | num_refs = btrfs_extent_data_ref_count(leaf, ref1); | |
1337 | } else { | |
1338 | ref2 = (struct btrfs_shared_data_ref *)(iref + 1); | |
1339 | num_refs = btrfs_shared_data_ref_count(leaf, ref2); | |
1340 | } | |
1341 | } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { | |
1342 | ref1 = btrfs_item_ptr(leaf, path->slots[0], | |
1343 | struct btrfs_extent_data_ref); | |
1344 | num_refs = btrfs_extent_data_ref_count(leaf, ref1); | |
1345 | } else if (key.type == BTRFS_SHARED_DATA_REF_KEY) { | |
1346 | ref2 = btrfs_item_ptr(leaf, path->slots[0], | |
1347 | struct btrfs_shared_data_ref); | |
1348 | num_refs = btrfs_shared_data_ref_count(leaf, ref2); | |
1349 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
1350 | } else if (key.type == BTRFS_EXTENT_REF_V0_KEY) { | |
1351 | struct btrfs_extent_ref_v0 *ref0; | |
1352 | ref0 = btrfs_item_ptr(leaf, path->slots[0], | |
1353 | struct btrfs_extent_ref_v0); | |
1354 | num_refs = btrfs_ref_count_v0(leaf, ref0); | |
4b4e25f2 | 1355 | #endif |
5d4f98a2 YZ |
1356 | } else { |
1357 | WARN_ON(1); | |
1358 | } | |
1359 | return num_refs; | |
1360 | } | |
15916de8 | 1361 | |
5d4f98a2 YZ |
1362 | static noinline int lookup_tree_block_ref(struct btrfs_trans_handle *trans, |
1363 | struct btrfs_root *root, | |
1364 | struct btrfs_path *path, | |
1365 | u64 bytenr, u64 parent, | |
1366 | u64 root_objectid) | |
1f3c79a2 | 1367 | { |
5d4f98a2 | 1368 | struct btrfs_key key; |
1f3c79a2 | 1369 | int ret; |
1f3c79a2 | 1370 | |
5d4f98a2 YZ |
1371 | key.objectid = bytenr; |
1372 | if (parent) { | |
1373 | key.type = BTRFS_SHARED_BLOCK_REF_KEY; | |
1374 | key.offset = parent; | |
1375 | } else { | |
1376 | key.type = BTRFS_TREE_BLOCK_REF_KEY; | |
1377 | key.offset = root_objectid; | |
1f3c79a2 LH |
1378 | } |
1379 | ||
5d4f98a2 YZ |
1380 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); |
1381 | if (ret > 0) | |
1382 | ret = -ENOENT; | |
1383 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
1384 | if (ret == -ENOENT && parent) { | |
b3b4aa74 | 1385 | btrfs_release_path(path); |
5d4f98a2 YZ |
1386 | key.type = BTRFS_EXTENT_REF_V0_KEY; |
1387 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); | |
1388 | if (ret > 0) | |
1389 | ret = -ENOENT; | |
1390 | } | |
1f3c79a2 | 1391 | #endif |
5d4f98a2 | 1392 | return ret; |
1f3c79a2 LH |
1393 | } |
1394 | ||
5d4f98a2 YZ |
1395 | static noinline int insert_tree_block_ref(struct btrfs_trans_handle *trans, |
1396 | struct btrfs_root *root, | |
1397 | struct btrfs_path *path, | |
1398 | u64 bytenr, u64 parent, | |
1399 | u64 root_objectid) | |
31840ae1 | 1400 | { |
5d4f98a2 | 1401 | struct btrfs_key key; |
31840ae1 | 1402 | int ret; |
31840ae1 | 1403 | |
5d4f98a2 YZ |
1404 | key.objectid = bytenr; |
1405 | if (parent) { | |
1406 | key.type = BTRFS_SHARED_BLOCK_REF_KEY; | |
1407 | key.offset = parent; | |
1408 | } else { | |
1409 | key.type = BTRFS_TREE_BLOCK_REF_KEY; | |
1410 | key.offset = root_objectid; | |
1411 | } | |
1412 | ||
1413 | ret = btrfs_insert_empty_item(trans, root, path, &key, 0); | |
b3b4aa74 | 1414 | btrfs_release_path(path); |
31840ae1 ZY |
1415 | return ret; |
1416 | } | |
1417 | ||
5d4f98a2 | 1418 | static inline int extent_ref_type(u64 parent, u64 owner) |
31840ae1 | 1419 | { |
5d4f98a2 YZ |
1420 | int type; |
1421 | if (owner < BTRFS_FIRST_FREE_OBJECTID) { | |
1422 | if (parent > 0) | |
1423 | type = BTRFS_SHARED_BLOCK_REF_KEY; | |
1424 | else | |
1425 | type = BTRFS_TREE_BLOCK_REF_KEY; | |
1426 | } else { | |
1427 | if (parent > 0) | |
1428 | type = BTRFS_SHARED_DATA_REF_KEY; | |
1429 | else | |
1430 | type = BTRFS_EXTENT_DATA_REF_KEY; | |
1431 | } | |
1432 | return type; | |
31840ae1 | 1433 | } |
56bec294 | 1434 | |
2c47e605 YZ |
1435 | static int find_next_key(struct btrfs_path *path, int level, |
1436 | struct btrfs_key *key) | |
56bec294 | 1437 | |
02217ed2 | 1438 | { |
2c47e605 | 1439 | for (; level < BTRFS_MAX_LEVEL; level++) { |
5d4f98a2 YZ |
1440 | if (!path->nodes[level]) |
1441 | break; | |
5d4f98a2 YZ |
1442 | if (path->slots[level] + 1 >= |
1443 | btrfs_header_nritems(path->nodes[level])) | |
1444 | continue; | |
1445 | if (level == 0) | |
1446 | btrfs_item_key_to_cpu(path->nodes[level], key, | |
1447 | path->slots[level] + 1); | |
1448 | else | |
1449 | btrfs_node_key_to_cpu(path->nodes[level], key, | |
1450 | path->slots[level] + 1); | |
1451 | return 0; | |
1452 | } | |
1453 | return 1; | |
1454 | } | |
037e6390 | 1455 | |
5d4f98a2 YZ |
1456 | /* |
1457 | * look for inline back ref. if back ref is found, *ref_ret is set | |
1458 | * to the address of inline back ref, and 0 is returned. | |
1459 | * | |
1460 | * if back ref isn't found, *ref_ret is set to the address where it | |
1461 | * should be inserted, and -ENOENT is returned. | |
1462 | * | |
1463 | * if insert is true and there are too many inline back refs, the path | |
1464 | * points to the extent item, and -EAGAIN is returned. | |
1465 | * | |
1466 | * NOTE: inline back refs are ordered in the same way that back ref | |
1467 | * items in the tree are ordered. | |
1468 | */ | |
1469 | static noinline_for_stack | |
1470 | int lookup_inline_extent_backref(struct btrfs_trans_handle *trans, | |
1471 | struct btrfs_root *root, | |
1472 | struct btrfs_path *path, | |
1473 | struct btrfs_extent_inline_ref **ref_ret, | |
1474 | u64 bytenr, u64 num_bytes, | |
1475 | u64 parent, u64 root_objectid, | |
1476 | u64 owner, u64 offset, int insert) | |
1477 | { | |
1478 | struct btrfs_key key; | |
1479 | struct extent_buffer *leaf; | |
1480 | struct btrfs_extent_item *ei; | |
1481 | struct btrfs_extent_inline_ref *iref; | |
1482 | u64 flags; | |
1483 | u64 item_size; | |
1484 | unsigned long ptr; | |
1485 | unsigned long end; | |
1486 | int extra_size; | |
1487 | int type; | |
1488 | int want; | |
1489 | int ret; | |
1490 | int err = 0; | |
3173a18f JB |
1491 | bool skinny_metadata = btrfs_fs_incompat(root->fs_info, |
1492 | SKINNY_METADATA); | |
26b8003f | 1493 | |
db94535d | 1494 | key.objectid = bytenr; |
31840ae1 | 1495 | key.type = BTRFS_EXTENT_ITEM_KEY; |
56bec294 | 1496 | key.offset = num_bytes; |
31840ae1 | 1497 | |
5d4f98a2 YZ |
1498 | want = extent_ref_type(parent, owner); |
1499 | if (insert) { | |
1500 | extra_size = btrfs_extent_inline_ref_size(want); | |
85d4198e | 1501 | path->keep_locks = 1; |
5d4f98a2 YZ |
1502 | } else |
1503 | extra_size = -1; | |
3173a18f JB |
1504 | |
1505 | /* | |
1506 | * Owner is our parent level, so we can just add one to get the level | |
1507 | * for the block we are interested in. | |
1508 | */ | |
1509 | if (skinny_metadata && owner < BTRFS_FIRST_FREE_OBJECTID) { | |
1510 | key.type = BTRFS_METADATA_ITEM_KEY; | |
1511 | key.offset = owner; | |
1512 | } | |
1513 | ||
1514 | again: | |
5d4f98a2 | 1515 | ret = btrfs_search_slot(trans, root, &key, path, extra_size, 1); |
b9473439 | 1516 | if (ret < 0) { |
5d4f98a2 YZ |
1517 | err = ret; |
1518 | goto out; | |
1519 | } | |
3173a18f JB |
1520 | |
1521 | /* | |
1522 | * We may be a newly converted file system which still has the old fat | |
1523 | * extent entries for metadata, so try and see if we have one of those. | |
1524 | */ | |
1525 | if (ret > 0 && skinny_metadata) { | |
1526 | skinny_metadata = false; | |
1527 | if (path->slots[0]) { | |
1528 | path->slots[0]--; | |
1529 | btrfs_item_key_to_cpu(path->nodes[0], &key, | |
1530 | path->slots[0]); | |
1531 | if (key.objectid == bytenr && | |
1532 | key.type == BTRFS_EXTENT_ITEM_KEY && | |
1533 | key.offset == num_bytes) | |
1534 | ret = 0; | |
1535 | } | |
1536 | if (ret) { | |
9ce49a0b | 1537 | key.objectid = bytenr; |
3173a18f JB |
1538 | key.type = BTRFS_EXTENT_ITEM_KEY; |
1539 | key.offset = num_bytes; | |
1540 | btrfs_release_path(path); | |
1541 | goto again; | |
1542 | } | |
1543 | } | |
1544 | ||
79787eaa JM |
1545 | if (ret && !insert) { |
1546 | err = -ENOENT; | |
1547 | goto out; | |
fae7f21c | 1548 | } else if (WARN_ON(ret)) { |
492104c8 | 1549 | err = -EIO; |
492104c8 | 1550 | goto out; |
79787eaa | 1551 | } |
5d4f98a2 YZ |
1552 | |
1553 | leaf = path->nodes[0]; | |
1554 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
1555 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
1556 | if (item_size < sizeof(*ei)) { | |
1557 | if (!insert) { | |
1558 | err = -ENOENT; | |
1559 | goto out; | |
1560 | } | |
1561 | ret = convert_extent_item_v0(trans, root, path, owner, | |
1562 | extra_size); | |
1563 | if (ret < 0) { | |
1564 | err = ret; | |
1565 | goto out; | |
1566 | } | |
1567 | leaf = path->nodes[0]; | |
1568 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
1569 | } | |
1570 | #endif | |
1571 | BUG_ON(item_size < sizeof(*ei)); | |
1572 | ||
5d4f98a2 YZ |
1573 | ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); |
1574 | flags = btrfs_extent_flags(leaf, ei); | |
1575 | ||
1576 | ptr = (unsigned long)(ei + 1); | |
1577 | end = (unsigned long)ei + item_size; | |
1578 | ||
3173a18f | 1579 | if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK && !skinny_metadata) { |
5d4f98a2 YZ |
1580 | ptr += sizeof(struct btrfs_tree_block_info); |
1581 | BUG_ON(ptr > end); | |
5d4f98a2 YZ |
1582 | } |
1583 | ||
1584 | err = -ENOENT; | |
1585 | while (1) { | |
1586 | if (ptr >= end) { | |
1587 | WARN_ON(ptr > end); | |
1588 | break; | |
1589 | } | |
1590 | iref = (struct btrfs_extent_inline_ref *)ptr; | |
1591 | type = btrfs_extent_inline_ref_type(leaf, iref); | |
1592 | if (want < type) | |
1593 | break; | |
1594 | if (want > type) { | |
1595 | ptr += btrfs_extent_inline_ref_size(type); | |
1596 | continue; | |
1597 | } | |
1598 | ||
1599 | if (type == BTRFS_EXTENT_DATA_REF_KEY) { | |
1600 | struct btrfs_extent_data_ref *dref; | |
1601 | dref = (struct btrfs_extent_data_ref *)(&iref->offset); | |
1602 | if (match_extent_data_ref(leaf, dref, root_objectid, | |
1603 | owner, offset)) { | |
1604 | err = 0; | |
1605 | break; | |
1606 | } | |
1607 | if (hash_extent_data_ref_item(leaf, dref) < | |
1608 | hash_extent_data_ref(root_objectid, owner, offset)) | |
1609 | break; | |
1610 | } else { | |
1611 | u64 ref_offset; | |
1612 | ref_offset = btrfs_extent_inline_ref_offset(leaf, iref); | |
1613 | if (parent > 0) { | |
1614 | if (parent == ref_offset) { | |
1615 | err = 0; | |
1616 | break; | |
1617 | } | |
1618 | if (ref_offset < parent) | |
1619 | break; | |
1620 | } else { | |
1621 | if (root_objectid == ref_offset) { | |
1622 | err = 0; | |
1623 | break; | |
1624 | } | |
1625 | if (ref_offset < root_objectid) | |
1626 | break; | |
1627 | } | |
1628 | } | |
1629 | ptr += btrfs_extent_inline_ref_size(type); | |
1630 | } | |
1631 | if (err == -ENOENT && insert) { | |
1632 | if (item_size + extra_size >= | |
1633 | BTRFS_MAX_EXTENT_ITEM_SIZE(root)) { | |
1634 | err = -EAGAIN; | |
1635 | goto out; | |
1636 | } | |
1637 | /* | |
1638 | * To add new inline back ref, we have to make sure | |
1639 | * there is no corresponding back ref item. | |
1640 | * For simplicity, we just do not add new inline back | |
1641 | * ref if there is any kind of item for this block | |
1642 | */ | |
2c47e605 YZ |
1643 | if (find_next_key(path, 0, &key) == 0 && |
1644 | key.objectid == bytenr && | |
85d4198e | 1645 | key.type < BTRFS_BLOCK_GROUP_ITEM_KEY) { |
5d4f98a2 YZ |
1646 | err = -EAGAIN; |
1647 | goto out; | |
1648 | } | |
1649 | } | |
1650 | *ref_ret = (struct btrfs_extent_inline_ref *)ptr; | |
1651 | out: | |
85d4198e | 1652 | if (insert) { |
5d4f98a2 YZ |
1653 | path->keep_locks = 0; |
1654 | btrfs_unlock_up_safe(path, 1); | |
1655 | } | |
1656 | return err; | |
1657 | } | |
1658 | ||
1659 | /* | |
1660 | * helper to add new inline back ref | |
1661 | */ | |
1662 | static noinline_for_stack | |
fd279fae | 1663 | void setup_inline_extent_backref(struct btrfs_root *root, |
143bede5 JM |
1664 | struct btrfs_path *path, |
1665 | struct btrfs_extent_inline_ref *iref, | |
1666 | u64 parent, u64 root_objectid, | |
1667 | u64 owner, u64 offset, int refs_to_add, | |
1668 | struct btrfs_delayed_extent_op *extent_op) | |
5d4f98a2 YZ |
1669 | { |
1670 | struct extent_buffer *leaf; | |
1671 | struct btrfs_extent_item *ei; | |
1672 | unsigned long ptr; | |
1673 | unsigned long end; | |
1674 | unsigned long item_offset; | |
1675 | u64 refs; | |
1676 | int size; | |
1677 | int type; | |
5d4f98a2 YZ |
1678 | |
1679 | leaf = path->nodes[0]; | |
1680 | ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); | |
1681 | item_offset = (unsigned long)iref - (unsigned long)ei; | |
1682 | ||
1683 | type = extent_ref_type(parent, owner); | |
1684 | size = btrfs_extent_inline_ref_size(type); | |
1685 | ||
4b90c680 | 1686 | btrfs_extend_item(root, path, size); |
5d4f98a2 YZ |
1687 | |
1688 | ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); | |
1689 | refs = btrfs_extent_refs(leaf, ei); | |
1690 | refs += refs_to_add; | |
1691 | btrfs_set_extent_refs(leaf, ei, refs); | |
1692 | if (extent_op) | |
1693 | __run_delayed_extent_op(extent_op, leaf, ei); | |
1694 | ||
1695 | ptr = (unsigned long)ei + item_offset; | |
1696 | end = (unsigned long)ei + btrfs_item_size_nr(leaf, path->slots[0]); | |
1697 | if (ptr < end - size) | |
1698 | memmove_extent_buffer(leaf, ptr + size, ptr, | |
1699 | end - size - ptr); | |
1700 | ||
1701 | iref = (struct btrfs_extent_inline_ref *)ptr; | |
1702 | btrfs_set_extent_inline_ref_type(leaf, iref, type); | |
1703 | if (type == BTRFS_EXTENT_DATA_REF_KEY) { | |
1704 | struct btrfs_extent_data_ref *dref; | |
1705 | dref = (struct btrfs_extent_data_ref *)(&iref->offset); | |
1706 | btrfs_set_extent_data_ref_root(leaf, dref, root_objectid); | |
1707 | btrfs_set_extent_data_ref_objectid(leaf, dref, owner); | |
1708 | btrfs_set_extent_data_ref_offset(leaf, dref, offset); | |
1709 | btrfs_set_extent_data_ref_count(leaf, dref, refs_to_add); | |
1710 | } else if (type == BTRFS_SHARED_DATA_REF_KEY) { | |
1711 | struct btrfs_shared_data_ref *sref; | |
1712 | sref = (struct btrfs_shared_data_ref *)(iref + 1); | |
1713 | btrfs_set_shared_data_ref_count(leaf, sref, refs_to_add); | |
1714 | btrfs_set_extent_inline_ref_offset(leaf, iref, parent); | |
1715 | } else if (type == BTRFS_SHARED_BLOCK_REF_KEY) { | |
1716 | btrfs_set_extent_inline_ref_offset(leaf, iref, parent); | |
1717 | } else { | |
1718 | btrfs_set_extent_inline_ref_offset(leaf, iref, root_objectid); | |
1719 | } | |
1720 | btrfs_mark_buffer_dirty(leaf); | |
5d4f98a2 YZ |
1721 | } |
1722 | ||
1723 | static int lookup_extent_backref(struct btrfs_trans_handle *trans, | |
1724 | struct btrfs_root *root, | |
1725 | struct btrfs_path *path, | |
1726 | struct btrfs_extent_inline_ref **ref_ret, | |
1727 | u64 bytenr, u64 num_bytes, u64 parent, | |
1728 | u64 root_objectid, u64 owner, u64 offset) | |
1729 | { | |
1730 | int ret; | |
1731 | ||
1732 | ret = lookup_inline_extent_backref(trans, root, path, ref_ret, | |
1733 | bytenr, num_bytes, parent, | |
1734 | root_objectid, owner, offset, 0); | |
1735 | if (ret != -ENOENT) | |
54aa1f4d | 1736 | return ret; |
5d4f98a2 | 1737 | |
b3b4aa74 | 1738 | btrfs_release_path(path); |
5d4f98a2 YZ |
1739 | *ref_ret = NULL; |
1740 | ||
1741 | if (owner < BTRFS_FIRST_FREE_OBJECTID) { | |
1742 | ret = lookup_tree_block_ref(trans, root, path, bytenr, parent, | |
1743 | root_objectid); | |
1744 | } else { | |
1745 | ret = lookup_extent_data_ref(trans, root, path, bytenr, parent, | |
1746 | root_objectid, owner, offset); | |
b9473439 | 1747 | } |
5d4f98a2 YZ |
1748 | return ret; |
1749 | } | |
31840ae1 | 1750 | |
5d4f98a2 YZ |
1751 | /* |
1752 | * helper to update/remove inline back ref | |
1753 | */ | |
1754 | static noinline_for_stack | |
afe5fea7 | 1755 | void update_inline_extent_backref(struct btrfs_root *root, |
143bede5 JM |
1756 | struct btrfs_path *path, |
1757 | struct btrfs_extent_inline_ref *iref, | |
1758 | int refs_to_mod, | |
fcebe456 JB |
1759 | struct btrfs_delayed_extent_op *extent_op, |
1760 | int *last_ref) | |
5d4f98a2 YZ |
1761 | { |
1762 | struct extent_buffer *leaf; | |
1763 | struct btrfs_extent_item *ei; | |
1764 | struct btrfs_extent_data_ref *dref = NULL; | |
1765 | struct btrfs_shared_data_ref *sref = NULL; | |
1766 | unsigned long ptr; | |
1767 | unsigned long end; | |
1768 | u32 item_size; | |
1769 | int size; | |
1770 | int type; | |
5d4f98a2 YZ |
1771 | u64 refs; |
1772 | ||
1773 | leaf = path->nodes[0]; | |
1774 | ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); | |
1775 | refs = btrfs_extent_refs(leaf, ei); | |
1776 | WARN_ON(refs_to_mod < 0 && refs + refs_to_mod <= 0); | |
1777 | refs += refs_to_mod; | |
1778 | btrfs_set_extent_refs(leaf, ei, refs); | |
1779 | if (extent_op) | |
1780 | __run_delayed_extent_op(extent_op, leaf, ei); | |
1781 | ||
1782 | type = btrfs_extent_inline_ref_type(leaf, iref); | |
1783 | ||
1784 | if (type == BTRFS_EXTENT_DATA_REF_KEY) { | |
1785 | dref = (struct btrfs_extent_data_ref *)(&iref->offset); | |
1786 | refs = btrfs_extent_data_ref_count(leaf, dref); | |
1787 | } else if (type == BTRFS_SHARED_DATA_REF_KEY) { | |
1788 | sref = (struct btrfs_shared_data_ref *)(iref + 1); | |
1789 | refs = btrfs_shared_data_ref_count(leaf, sref); | |
1790 | } else { | |
1791 | refs = 1; | |
1792 | BUG_ON(refs_to_mod != -1); | |
56bec294 | 1793 | } |
31840ae1 | 1794 | |
5d4f98a2 YZ |
1795 | BUG_ON(refs_to_mod < 0 && refs < -refs_to_mod); |
1796 | refs += refs_to_mod; | |
1797 | ||
1798 | if (refs > 0) { | |
1799 | if (type == BTRFS_EXTENT_DATA_REF_KEY) | |
1800 | btrfs_set_extent_data_ref_count(leaf, dref, refs); | |
1801 | else | |
1802 | btrfs_set_shared_data_ref_count(leaf, sref, refs); | |
1803 | } else { | |
fcebe456 | 1804 | *last_ref = 1; |
5d4f98a2 YZ |
1805 | size = btrfs_extent_inline_ref_size(type); |
1806 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
1807 | ptr = (unsigned long)iref; | |
1808 | end = (unsigned long)ei + item_size; | |
1809 | if (ptr + size < end) | |
1810 | memmove_extent_buffer(leaf, ptr, ptr + size, | |
1811 | end - ptr - size); | |
1812 | item_size -= size; | |
afe5fea7 | 1813 | btrfs_truncate_item(root, path, item_size, 1); |
5d4f98a2 YZ |
1814 | } |
1815 | btrfs_mark_buffer_dirty(leaf); | |
5d4f98a2 YZ |
1816 | } |
1817 | ||
1818 | static noinline_for_stack | |
1819 | int insert_inline_extent_backref(struct btrfs_trans_handle *trans, | |
1820 | struct btrfs_root *root, | |
1821 | struct btrfs_path *path, | |
1822 | u64 bytenr, u64 num_bytes, u64 parent, | |
1823 | u64 root_objectid, u64 owner, | |
1824 | u64 offset, int refs_to_add, | |
1825 | struct btrfs_delayed_extent_op *extent_op) | |
1826 | { | |
1827 | struct btrfs_extent_inline_ref *iref; | |
1828 | int ret; | |
1829 | ||
1830 | ret = lookup_inline_extent_backref(trans, root, path, &iref, | |
1831 | bytenr, num_bytes, parent, | |
1832 | root_objectid, owner, offset, 1); | |
1833 | if (ret == 0) { | |
1834 | BUG_ON(owner < BTRFS_FIRST_FREE_OBJECTID); | |
afe5fea7 | 1835 | update_inline_extent_backref(root, path, iref, |
fcebe456 | 1836 | refs_to_add, extent_op, NULL); |
5d4f98a2 | 1837 | } else if (ret == -ENOENT) { |
fd279fae | 1838 | setup_inline_extent_backref(root, path, iref, parent, |
143bede5 JM |
1839 | root_objectid, owner, offset, |
1840 | refs_to_add, extent_op); | |
1841 | ret = 0; | |
771ed689 | 1842 | } |
5d4f98a2 YZ |
1843 | return ret; |
1844 | } | |
31840ae1 | 1845 | |
5d4f98a2 YZ |
1846 | static int insert_extent_backref(struct btrfs_trans_handle *trans, |
1847 | struct btrfs_root *root, | |
1848 | struct btrfs_path *path, | |
1849 | u64 bytenr, u64 parent, u64 root_objectid, | |
1850 | u64 owner, u64 offset, int refs_to_add) | |
1851 | { | |
1852 | int ret; | |
1853 | if (owner < BTRFS_FIRST_FREE_OBJECTID) { | |
1854 | BUG_ON(refs_to_add != 1); | |
1855 | ret = insert_tree_block_ref(trans, root, path, bytenr, | |
1856 | parent, root_objectid); | |
1857 | } else { | |
1858 | ret = insert_extent_data_ref(trans, root, path, bytenr, | |
1859 | parent, root_objectid, | |
1860 | owner, offset, refs_to_add); | |
1861 | } | |
1862 | return ret; | |
1863 | } | |
56bec294 | 1864 | |
5d4f98a2 YZ |
1865 | static int remove_extent_backref(struct btrfs_trans_handle *trans, |
1866 | struct btrfs_root *root, | |
1867 | struct btrfs_path *path, | |
1868 | struct btrfs_extent_inline_ref *iref, | |
fcebe456 | 1869 | int refs_to_drop, int is_data, int *last_ref) |
5d4f98a2 | 1870 | { |
143bede5 | 1871 | int ret = 0; |
b9473439 | 1872 | |
5d4f98a2 YZ |
1873 | BUG_ON(!is_data && refs_to_drop != 1); |
1874 | if (iref) { | |
afe5fea7 | 1875 | update_inline_extent_backref(root, path, iref, |
fcebe456 | 1876 | -refs_to_drop, NULL, last_ref); |
5d4f98a2 | 1877 | } else if (is_data) { |
fcebe456 JB |
1878 | ret = remove_extent_data_ref(trans, root, path, refs_to_drop, |
1879 | last_ref); | |
5d4f98a2 | 1880 | } else { |
fcebe456 | 1881 | *last_ref = 1; |
5d4f98a2 YZ |
1882 | ret = btrfs_del_item(trans, root, path); |
1883 | } | |
1884 | return ret; | |
1885 | } | |
1886 | ||
5378e607 | 1887 | static int btrfs_issue_discard(struct block_device *bdev, |
5d4f98a2 YZ |
1888 | u64 start, u64 len) |
1889 | { | |
5378e607 | 1890 | return blkdev_issue_discard(bdev, start >> 9, len >> 9, GFP_NOFS, 0); |
5d4f98a2 | 1891 | } |
5d4f98a2 | 1892 | |
1edb647b FM |
1893 | int btrfs_discard_extent(struct btrfs_root *root, u64 bytenr, |
1894 | u64 num_bytes, u64 *actual_bytes) | |
5d4f98a2 | 1895 | { |
5d4f98a2 | 1896 | int ret; |
5378e607 | 1897 | u64 discarded_bytes = 0; |
a1d3c478 | 1898 | struct btrfs_bio *bbio = NULL; |
5d4f98a2 | 1899 | |
e244a0ae | 1900 | |
5d4f98a2 | 1901 | /* Tell the block device(s) that the sectors can be discarded */ |
3ec706c8 | 1902 | ret = btrfs_map_block(root->fs_info, REQ_DISCARD, |
a1d3c478 | 1903 | bytenr, &num_bytes, &bbio, 0); |
79787eaa | 1904 | /* Error condition is -ENOMEM */ |
5d4f98a2 | 1905 | if (!ret) { |
a1d3c478 | 1906 | struct btrfs_bio_stripe *stripe = bbio->stripes; |
5d4f98a2 YZ |
1907 | int i; |
1908 | ||
5d4f98a2 | 1909 | |
a1d3c478 | 1910 | for (i = 0; i < bbio->num_stripes; i++, stripe++) { |
d5e2003c JB |
1911 | if (!stripe->dev->can_discard) |
1912 | continue; | |
1913 | ||
5378e607 LD |
1914 | ret = btrfs_issue_discard(stripe->dev->bdev, |
1915 | stripe->physical, | |
1916 | stripe->length); | |
1917 | if (!ret) | |
1918 | discarded_bytes += stripe->length; | |
1919 | else if (ret != -EOPNOTSUPP) | |
79787eaa | 1920 | break; /* Logic errors or -ENOMEM, or -EIO but I don't know how that could happen JDM */ |
d5e2003c JB |
1921 | |
1922 | /* | |
1923 | * Just in case we get back EOPNOTSUPP for some reason, | |
1924 | * just ignore the return value so we don't screw up | |
1925 | * people calling discard_extent. | |
1926 | */ | |
1927 | ret = 0; | |
5d4f98a2 | 1928 | } |
6e9606d2 | 1929 | btrfs_put_bbio(bbio); |
5d4f98a2 | 1930 | } |
5378e607 LD |
1931 | |
1932 | if (actual_bytes) | |
1933 | *actual_bytes = discarded_bytes; | |
1934 | ||
5d4f98a2 | 1935 | |
53b381b3 DW |
1936 | if (ret == -EOPNOTSUPP) |
1937 | ret = 0; | |
5d4f98a2 | 1938 | return ret; |
5d4f98a2 YZ |
1939 | } |
1940 | ||
79787eaa | 1941 | /* Can return -ENOMEM */ |
5d4f98a2 YZ |
1942 | int btrfs_inc_extent_ref(struct btrfs_trans_handle *trans, |
1943 | struct btrfs_root *root, | |
1944 | u64 bytenr, u64 num_bytes, u64 parent, | |
fcebe456 JB |
1945 | u64 root_objectid, u64 owner, u64 offset, |
1946 | int no_quota) | |
5d4f98a2 YZ |
1947 | { |
1948 | int ret; | |
66d7e7f0 AJ |
1949 | struct btrfs_fs_info *fs_info = root->fs_info; |
1950 | ||
5d4f98a2 YZ |
1951 | BUG_ON(owner < BTRFS_FIRST_FREE_OBJECTID && |
1952 | root_objectid == BTRFS_TREE_LOG_OBJECTID); | |
1953 | ||
1954 | if (owner < BTRFS_FIRST_FREE_OBJECTID) { | |
66d7e7f0 AJ |
1955 | ret = btrfs_add_delayed_tree_ref(fs_info, trans, bytenr, |
1956 | num_bytes, | |
5d4f98a2 | 1957 | parent, root_objectid, (int)owner, |
fcebe456 | 1958 | BTRFS_ADD_DELAYED_REF, NULL, no_quota); |
5d4f98a2 | 1959 | } else { |
66d7e7f0 AJ |
1960 | ret = btrfs_add_delayed_data_ref(fs_info, trans, bytenr, |
1961 | num_bytes, | |
5d4f98a2 | 1962 | parent, root_objectid, owner, offset, |
fcebe456 | 1963 | BTRFS_ADD_DELAYED_REF, NULL, no_quota); |
5d4f98a2 YZ |
1964 | } |
1965 | return ret; | |
1966 | } | |
1967 | ||
1968 | static int __btrfs_inc_extent_ref(struct btrfs_trans_handle *trans, | |
1969 | struct btrfs_root *root, | |
1970 | u64 bytenr, u64 num_bytes, | |
1971 | u64 parent, u64 root_objectid, | |
1972 | u64 owner, u64 offset, int refs_to_add, | |
fcebe456 | 1973 | int no_quota, |
5d4f98a2 YZ |
1974 | struct btrfs_delayed_extent_op *extent_op) |
1975 | { | |
fcebe456 | 1976 | struct btrfs_fs_info *fs_info = root->fs_info; |
5d4f98a2 YZ |
1977 | struct btrfs_path *path; |
1978 | struct extent_buffer *leaf; | |
1979 | struct btrfs_extent_item *item; | |
fcebe456 | 1980 | struct btrfs_key key; |
5d4f98a2 YZ |
1981 | u64 refs; |
1982 | int ret; | |
fcebe456 | 1983 | enum btrfs_qgroup_operation_type type = BTRFS_QGROUP_OPER_ADD_EXCL; |
5d4f98a2 YZ |
1984 | |
1985 | path = btrfs_alloc_path(); | |
1986 | if (!path) | |
1987 | return -ENOMEM; | |
1988 | ||
fcebe456 JB |
1989 | if (!is_fstree(root_objectid) || !root->fs_info->quota_enabled) |
1990 | no_quota = 1; | |
1991 | ||
5d4f98a2 YZ |
1992 | path->reada = 1; |
1993 | path->leave_spinning = 1; | |
1994 | /* this will setup the path even if it fails to insert the back ref */ | |
fcebe456 JB |
1995 | ret = insert_inline_extent_backref(trans, fs_info->extent_root, path, |
1996 | bytenr, num_bytes, parent, | |
5d4f98a2 YZ |
1997 | root_objectid, owner, offset, |
1998 | refs_to_add, extent_op); | |
fcebe456 | 1999 | if ((ret < 0 && ret != -EAGAIN) || (!ret && no_quota)) |
5d4f98a2 | 2000 | goto out; |
fcebe456 JB |
2001 | /* |
2002 | * Ok we were able to insert an inline extent and it appears to be a new | |
2003 | * reference, deal with the qgroup accounting. | |
2004 | */ | |
2005 | if (!ret && !no_quota) { | |
2006 | ASSERT(root->fs_info->quota_enabled); | |
2007 | leaf = path->nodes[0]; | |
2008 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
2009 | item = btrfs_item_ptr(leaf, path->slots[0], | |
2010 | struct btrfs_extent_item); | |
2011 | if (btrfs_extent_refs(leaf, item) > (u64)refs_to_add) | |
2012 | type = BTRFS_QGROUP_OPER_ADD_SHARED; | |
2013 | btrfs_release_path(path); | |
5d4f98a2 | 2014 | |
fcebe456 JB |
2015 | ret = btrfs_qgroup_record_ref(trans, fs_info, root_objectid, |
2016 | bytenr, num_bytes, type, 0); | |
2017 | goto out; | |
2018 | } | |
2019 | ||
2020 | /* | |
2021 | * Ok we had -EAGAIN which means we didn't have space to insert and | |
2022 | * inline extent ref, so just update the reference count and add a | |
2023 | * normal backref. | |
2024 | */ | |
5d4f98a2 | 2025 | leaf = path->nodes[0]; |
fcebe456 | 2026 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); |
5d4f98a2 YZ |
2027 | item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); |
2028 | refs = btrfs_extent_refs(leaf, item); | |
fcebe456 JB |
2029 | if (refs) |
2030 | type = BTRFS_QGROUP_OPER_ADD_SHARED; | |
5d4f98a2 YZ |
2031 | btrfs_set_extent_refs(leaf, item, refs + refs_to_add); |
2032 | if (extent_op) | |
2033 | __run_delayed_extent_op(extent_op, leaf, item); | |
56bec294 | 2034 | |
5d4f98a2 | 2035 | btrfs_mark_buffer_dirty(leaf); |
b3b4aa74 | 2036 | btrfs_release_path(path); |
56bec294 | 2037 | |
fcebe456 JB |
2038 | if (!no_quota) { |
2039 | ret = btrfs_qgroup_record_ref(trans, fs_info, root_objectid, | |
2040 | bytenr, num_bytes, type, 0); | |
2041 | if (ret) | |
2042 | goto out; | |
2043 | } | |
2044 | ||
56bec294 | 2045 | path->reada = 1; |
b9473439 | 2046 | path->leave_spinning = 1; |
56bec294 CM |
2047 | /* now insert the actual backref */ |
2048 | ret = insert_extent_backref(trans, root->fs_info->extent_root, | |
5d4f98a2 YZ |
2049 | path, bytenr, parent, root_objectid, |
2050 | owner, offset, refs_to_add); | |
79787eaa JM |
2051 | if (ret) |
2052 | btrfs_abort_transaction(trans, root, ret); | |
5d4f98a2 | 2053 | out: |
56bec294 | 2054 | btrfs_free_path(path); |
30d133fc | 2055 | return ret; |
56bec294 CM |
2056 | } |
2057 | ||
5d4f98a2 YZ |
2058 | static int run_delayed_data_ref(struct btrfs_trans_handle *trans, |
2059 | struct btrfs_root *root, | |
2060 | struct btrfs_delayed_ref_node *node, | |
2061 | struct btrfs_delayed_extent_op *extent_op, | |
2062 | int insert_reserved) | |
56bec294 | 2063 | { |
5d4f98a2 YZ |
2064 | int ret = 0; |
2065 | struct btrfs_delayed_data_ref *ref; | |
2066 | struct btrfs_key ins; | |
2067 | u64 parent = 0; | |
2068 | u64 ref_root = 0; | |
2069 | u64 flags = 0; | |
2070 | ||
2071 | ins.objectid = node->bytenr; | |
2072 | ins.offset = node->num_bytes; | |
2073 | ins.type = BTRFS_EXTENT_ITEM_KEY; | |
2074 | ||
2075 | ref = btrfs_delayed_node_to_data_ref(node); | |
599c75ec LB |
2076 | trace_run_delayed_data_ref(node, ref, node->action); |
2077 | ||
5d4f98a2 YZ |
2078 | if (node->type == BTRFS_SHARED_DATA_REF_KEY) |
2079 | parent = ref->parent; | |
fcebe456 | 2080 | ref_root = ref->root; |
5d4f98a2 YZ |
2081 | |
2082 | if (node->action == BTRFS_ADD_DELAYED_REF && insert_reserved) { | |
3173a18f | 2083 | if (extent_op) |
5d4f98a2 | 2084 | flags |= extent_op->flags_to_set; |
5d4f98a2 YZ |
2085 | ret = alloc_reserved_file_extent(trans, root, |
2086 | parent, ref_root, flags, | |
2087 | ref->objectid, ref->offset, | |
2088 | &ins, node->ref_mod); | |
5d4f98a2 YZ |
2089 | } else if (node->action == BTRFS_ADD_DELAYED_REF) { |
2090 | ret = __btrfs_inc_extent_ref(trans, root, node->bytenr, | |
2091 | node->num_bytes, parent, | |
2092 | ref_root, ref->objectid, | |
2093 | ref->offset, node->ref_mod, | |
fcebe456 | 2094 | node->no_quota, extent_op); |
5d4f98a2 YZ |
2095 | } else if (node->action == BTRFS_DROP_DELAYED_REF) { |
2096 | ret = __btrfs_free_extent(trans, root, node->bytenr, | |
2097 | node->num_bytes, parent, | |
2098 | ref_root, ref->objectid, | |
2099 | ref->offset, node->ref_mod, | |
fcebe456 | 2100 | extent_op, node->no_quota); |
5d4f98a2 YZ |
2101 | } else { |
2102 | BUG(); | |
2103 | } | |
2104 | return ret; | |
2105 | } | |
2106 | ||
2107 | static void __run_delayed_extent_op(struct btrfs_delayed_extent_op *extent_op, | |
2108 | struct extent_buffer *leaf, | |
2109 | struct btrfs_extent_item *ei) | |
2110 | { | |
2111 | u64 flags = btrfs_extent_flags(leaf, ei); | |
2112 | if (extent_op->update_flags) { | |
2113 | flags |= extent_op->flags_to_set; | |
2114 | btrfs_set_extent_flags(leaf, ei, flags); | |
2115 | } | |
2116 | ||
2117 | if (extent_op->update_key) { | |
2118 | struct btrfs_tree_block_info *bi; | |
2119 | BUG_ON(!(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)); | |
2120 | bi = (struct btrfs_tree_block_info *)(ei + 1); | |
2121 | btrfs_set_tree_block_key(leaf, bi, &extent_op->key); | |
2122 | } | |
2123 | } | |
2124 | ||
2125 | static int run_delayed_extent_op(struct btrfs_trans_handle *trans, | |
2126 | struct btrfs_root *root, | |
2127 | struct btrfs_delayed_ref_node *node, | |
2128 | struct btrfs_delayed_extent_op *extent_op) | |
2129 | { | |
2130 | struct btrfs_key key; | |
2131 | struct btrfs_path *path; | |
2132 | struct btrfs_extent_item *ei; | |
2133 | struct extent_buffer *leaf; | |
2134 | u32 item_size; | |
56bec294 | 2135 | int ret; |
5d4f98a2 | 2136 | int err = 0; |
b1c79e09 | 2137 | int metadata = !extent_op->is_data; |
5d4f98a2 | 2138 | |
79787eaa JM |
2139 | if (trans->aborted) |
2140 | return 0; | |
2141 | ||
3173a18f JB |
2142 | if (metadata && !btrfs_fs_incompat(root->fs_info, SKINNY_METADATA)) |
2143 | metadata = 0; | |
2144 | ||
5d4f98a2 YZ |
2145 | path = btrfs_alloc_path(); |
2146 | if (!path) | |
2147 | return -ENOMEM; | |
2148 | ||
2149 | key.objectid = node->bytenr; | |
5d4f98a2 | 2150 | |
3173a18f | 2151 | if (metadata) { |
3173a18f | 2152 | key.type = BTRFS_METADATA_ITEM_KEY; |
b1c79e09 | 2153 | key.offset = extent_op->level; |
3173a18f JB |
2154 | } else { |
2155 | key.type = BTRFS_EXTENT_ITEM_KEY; | |
2156 | key.offset = node->num_bytes; | |
2157 | } | |
2158 | ||
2159 | again: | |
5d4f98a2 YZ |
2160 | path->reada = 1; |
2161 | path->leave_spinning = 1; | |
2162 | ret = btrfs_search_slot(trans, root->fs_info->extent_root, &key, | |
2163 | path, 0, 1); | |
2164 | if (ret < 0) { | |
2165 | err = ret; | |
2166 | goto out; | |
2167 | } | |
2168 | if (ret > 0) { | |
3173a18f | 2169 | if (metadata) { |
55994887 FDBM |
2170 | if (path->slots[0] > 0) { |
2171 | path->slots[0]--; | |
2172 | btrfs_item_key_to_cpu(path->nodes[0], &key, | |
2173 | path->slots[0]); | |
2174 | if (key.objectid == node->bytenr && | |
2175 | key.type == BTRFS_EXTENT_ITEM_KEY && | |
2176 | key.offset == node->num_bytes) | |
2177 | ret = 0; | |
2178 | } | |
2179 | if (ret > 0) { | |
2180 | btrfs_release_path(path); | |
2181 | metadata = 0; | |
3173a18f | 2182 | |
55994887 FDBM |
2183 | key.objectid = node->bytenr; |
2184 | key.offset = node->num_bytes; | |
2185 | key.type = BTRFS_EXTENT_ITEM_KEY; | |
2186 | goto again; | |
2187 | } | |
2188 | } else { | |
2189 | err = -EIO; | |
2190 | goto out; | |
3173a18f | 2191 | } |
5d4f98a2 YZ |
2192 | } |
2193 | ||
2194 | leaf = path->nodes[0]; | |
2195 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
2196 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
2197 | if (item_size < sizeof(*ei)) { | |
2198 | ret = convert_extent_item_v0(trans, root->fs_info->extent_root, | |
2199 | path, (u64)-1, 0); | |
2200 | if (ret < 0) { | |
2201 | err = ret; | |
2202 | goto out; | |
2203 | } | |
2204 | leaf = path->nodes[0]; | |
2205 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
2206 | } | |
2207 | #endif | |
2208 | BUG_ON(item_size < sizeof(*ei)); | |
2209 | ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); | |
2210 | __run_delayed_extent_op(extent_op, leaf, ei); | |
56bec294 | 2211 | |
5d4f98a2 YZ |
2212 | btrfs_mark_buffer_dirty(leaf); |
2213 | out: | |
2214 | btrfs_free_path(path); | |
2215 | return err; | |
56bec294 CM |
2216 | } |
2217 | ||
5d4f98a2 YZ |
2218 | static int run_delayed_tree_ref(struct btrfs_trans_handle *trans, |
2219 | struct btrfs_root *root, | |
2220 | struct btrfs_delayed_ref_node *node, | |
2221 | struct btrfs_delayed_extent_op *extent_op, | |
2222 | int insert_reserved) | |
56bec294 CM |
2223 | { |
2224 | int ret = 0; | |
5d4f98a2 YZ |
2225 | struct btrfs_delayed_tree_ref *ref; |
2226 | struct btrfs_key ins; | |
2227 | u64 parent = 0; | |
2228 | u64 ref_root = 0; | |
3173a18f JB |
2229 | bool skinny_metadata = btrfs_fs_incompat(root->fs_info, |
2230 | SKINNY_METADATA); | |
56bec294 | 2231 | |
5d4f98a2 | 2232 | ref = btrfs_delayed_node_to_tree_ref(node); |
599c75ec LB |
2233 | trace_run_delayed_tree_ref(node, ref, node->action); |
2234 | ||
5d4f98a2 YZ |
2235 | if (node->type == BTRFS_SHARED_BLOCK_REF_KEY) |
2236 | parent = ref->parent; | |
fcebe456 | 2237 | ref_root = ref->root; |
5d4f98a2 | 2238 | |
3173a18f JB |
2239 | ins.objectid = node->bytenr; |
2240 | if (skinny_metadata) { | |
2241 | ins.offset = ref->level; | |
2242 | ins.type = BTRFS_METADATA_ITEM_KEY; | |
2243 | } else { | |
2244 | ins.offset = node->num_bytes; | |
2245 | ins.type = BTRFS_EXTENT_ITEM_KEY; | |
2246 | } | |
2247 | ||
5d4f98a2 YZ |
2248 | BUG_ON(node->ref_mod != 1); |
2249 | if (node->action == BTRFS_ADD_DELAYED_REF && insert_reserved) { | |
3173a18f | 2250 | BUG_ON(!extent_op || !extent_op->update_flags); |
5d4f98a2 YZ |
2251 | ret = alloc_reserved_tree_block(trans, root, |
2252 | parent, ref_root, | |
2253 | extent_op->flags_to_set, | |
2254 | &extent_op->key, | |
fcebe456 JB |
2255 | ref->level, &ins, |
2256 | node->no_quota); | |
5d4f98a2 YZ |
2257 | } else if (node->action == BTRFS_ADD_DELAYED_REF) { |
2258 | ret = __btrfs_inc_extent_ref(trans, root, node->bytenr, | |
2259 | node->num_bytes, parent, ref_root, | |
fcebe456 JB |
2260 | ref->level, 0, 1, node->no_quota, |
2261 | extent_op); | |
5d4f98a2 YZ |
2262 | } else if (node->action == BTRFS_DROP_DELAYED_REF) { |
2263 | ret = __btrfs_free_extent(trans, root, node->bytenr, | |
2264 | node->num_bytes, parent, ref_root, | |
fcebe456 JB |
2265 | ref->level, 0, 1, extent_op, |
2266 | node->no_quota); | |
5d4f98a2 YZ |
2267 | } else { |
2268 | BUG(); | |
2269 | } | |
56bec294 CM |
2270 | return ret; |
2271 | } | |
2272 | ||
2273 | /* helper function to actually process a single delayed ref entry */ | |
5d4f98a2 YZ |
2274 | static int run_one_delayed_ref(struct btrfs_trans_handle *trans, |
2275 | struct btrfs_root *root, | |
2276 | struct btrfs_delayed_ref_node *node, | |
2277 | struct btrfs_delayed_extent_op *extent_op, | |
2278 | int insert_reserved) | |
56bec294 | 2279 | { |
79787eaa JM |
2280 | int ret = 0; |
2281 | ||
857cc2fc JB |
2282 | if (trans->aborted) { |
2283 | if (insert_reserved) | |
2284 | btrfs_pin_extent(root, node->bytenr, | |
2285 | node->num_bytes, 1); | |
79787eaa | 2286 | return 0; |
857cc2fc | 2287 | } |
79787eaa | 2288 | |
5d4f98a2 | 2289 | if (btrfs_delayed_ref_is_head(node)) { |
56bec294 CM |
2290 | struct btrfs_delayed_ref_head *head; |
2291 | /* | |
2292 | * we've hit the end of the chain and we were supposed | |
2293 | * to insert this extent into the tree. But, it got | |
2294 | * deleted before we ever needed to insert it, so all | |
2295 | * we have to do is clean up the accounting | |
2296 | */ | |
5d4f98a2 YZ |
2297 | BUG_ON(extent_op); |
2298 | head = btrfs_delayed_node_to_head(node); | |
599c75ec LB |
2299 | trace_run_delayed_ref_head(node, head, node->action); |
2300 | ||
56bec294 | 2301 | if (insert_reserved) { |
f0486c68 YZ |
2302 | btrfs_pin_extent(root, node->bytenr, |
2303 | node->num_bytes, 1); | |
5d4f98a2 YZ |
2304 | if (head->is_data) { |
2305 | ret = btrfs_del_csums(trans, root, | |
2306 | node->bytenr, | |
2307 | node->num_bytes); | |
5d4f98a2 | 2308 | } |
56bec294 | 2309 | } |
79787eaa | 2310 | return ret; |
56bec294 CM |
2311 | } |
2312 | ||
5d4f98a2 YZ |
2313 | if (node->type == BTRFS_TREE_BLOCK_REF_KEY || |
2314 | node->type == BTRFS_SHARED_BLOCK_REF_KEY) | |
2315 | ret = run_delayed_tree_ref(trans, root, node, extent_op, | |
2316 | insert_reserved); | |
2317 | else if (node->type == BTRFS_EXTENT_DATA_REF_KEY || | |
2318 | node->type == BTRFS_SHARED_DATA_REF_KEY) | |
2319 | ret = run_delayed_data_ref(trans, root, node, extent_op, | |
2320 | insert_reserved); | |
2321 | else | |
2322 | BUG(); | |
2323 | return ret; | |
56bec294 CM |
2324 | } |
2325 | ||
2326 | static noinline struct btrfs_delayed_ref_node * | |
2327 | select_delayed_ref(struct btrfs_delayed_ref_head *head) | |
2328 | { | |
2329 | struct rb_node *node; | |
d7df2c79 JB |
2330 | struct btrfs_delayed_ref_node *ref, *last = NULL;; |
2331 | ||
56bec294 CM |
2332 | /* |
2333 | * select delayed ref of type BTRFS_ADD_DELAYED_REF first. | |
2334 | * this prevents ref count from going down to zero when | |
2335 | * there still are pending delayed ref. | |
2336 | */ | |
d7df2c79 JB |
2337 | node = rb_first(&head->ref_root); |
2338 | while (node) { | |
56bec294 CM |
2339 | ref = rb_entry(node, struct btrfs_delayed_ref_node, |
2340 | rb_node); | |
d7df2c79 | 2341 | if (ref->action == BTRFS_ADD_DELAYED_REF) |
56bec294 | 2342 | return ref; |
d7df2c79 JB |
2343 | else if (last == NULL) |
2344 | last = ref; | |
2345 | node = rb_next(node); | |
56bec294 | 2346 | } |
d7df2c79 | 2347 | return last; |
56bec294 CM |
2348 | } |
2349 | ||
79787eaa JM |
2350 | /* |
2351 | * Returns 0 on success or if called with an already aborted transaction. | |
2352 | * Returns -ENOMEM or -EIO on failure and will abort the transaction. | |
2353 | */ | |
d7df2c79 JB |
2354 | static noinline int __btrfs_run_delayed_refs(struct btrfs_trans_handle *trans, |
2355 | struct btrfs_root *root, | |
2356 | unsigned long nr) | |
56bec294 | 2357 | { |
56bec294 CM |
2358 | struct btrfs_delayed_ref_root *delayed_refs; |
2359 | struct btrfs_delayed_ref_node *ref; | |
2360 | struct btrfs_delayed_ref_head *locked_ref = NULL; | |
5d4f98a2 | 2361 | struct btrfs_delayed_extent_op *extent_op; |
097b8a7c | 2362 | struct btrfs_fs_info *fs_info = root->fs_info; |
0a2b2a84 | 2363 | ktime_t start = ktime_get(); |
56bec294 | 2364 | int ret; |
d7df2c79 | 2365 | unsigned long count = 0; |
0a2b2a84 | 2366 | unsigned long actual_count = 0; |
56bec294 | 2367 | int must_insert_reserved = 0; |
56bec294 CM |
2368 | |
2369 | delayed_refs = &trans->transaction->delayed_refs; | |
56bec294 CM |
2370 | while (1) { |
2371 | if (!locked_ref) { | |
d7df2c79 | 2372 | if (count >= nr) |
56bec294 | 2373 | break; |
56bec294 | 2374 | |
d7df2c79 JB |
2375 | spin_lock(&delayed_refs->lock); |
2376 | locked_ref = btrfs_select_ref_head(trans); | |
2377 | if (!locked_ref) { | |
2378 | spin_unlock(&delayed_refs->lock); | |
2379 | break; | |
2380 | } | |
c3e69d58 CM |
2381 | |
2382 | /* grab the lock that says we are going to process | |
2383 | * all the refs for this head */ | |
2384 | ret = btrfs_delayed_ref_lock(trans, locked_ref); | |
d7df2c79 | 2385 | spin_unlock(&delayed_refs->lock); |
c3e69d58 CM |
2386 | /* |
2387 | * we may have dropped the spin lock to get the head | |
2388 | * mutex lock, and that might have given someone else | |
2389 | * time to free the head. If that's true, it has been | |
2390 | * removed from our list and we can move on. | |
2391 | */ | |
2392 | if (ret == -EAGAIN) { | |
2393 | locked_ref = NULL; | |
2394 | count++; | |
2395 | continue; | |
56bec294 CM |
2396 | } |
2397 | } | |
a28ec197 | 2398 | |
ae1e206b JB |
2399 | /* |
2400 | * We need to try and merge add/drops of the same ref since we | |
2401 | * can run into issues with relocate dropping the implicit ref | |
2402 | * and then it being added back again before the drop can | |
2403 | * finish. If we merged anything we need to re-loop so we can | |
2404 | * get a good ref. | |
2405 | */ | |
d7df2c79 | 2406 | spin_lock(&locked_ref->lock); |
ae1e206b JB |
2407 | btrfs_merge_delayed_refs(trans, fs_info, delayed_refs, |
2408 | locked_ref); | |
2409 | ||
d1270cd9 AJ |
2410 | /* |
2411 | * locked_ref is the head node, so we have to go one | |
2412 | * node back for any delayed ref updates | |
2413 | */ | |
2414 | ref = select_delayed_ref(locked_ref); | |
2415 | ||
2416 | if (ref && ref->seq && | |
097b8a7c | 2417 | btrfs_check_delayed_seq(fs_info, delayed_refs, ref->seq)) { |
d7df2c79 | 2418 | spin_unlock(&locked_ref->lock); |
093486c4 | 2419 | btrfs_delayed_ref_unlock(locked_ref); |
d7df2c79 JB |
2420 | spin_lock(&delayed_refs->lock); |
2421 | locked_ref->processing = 0; | |
d1270cd9 AJ |
2422 | delayed_refs->num_heads_ready++; |
2423 | spin_unlock(&delayed_refs->lock); | |
d7df2c79 | 2424 | locked_ref = NULL; |
d1270cd9 | 2425 | cond_resched(); |
27a377db | 2426 | count++; |
d1270cd9 AJ |
2427 | continue; |
2428 | } | |
2429 | ||
56bec294 CM |
2430 | /* |
2431 | * record the must insert reserved flag before we | |
2432 | * drop the spin lock. | |
2433 | */ | |
2434 | must_insert_reserved = locked_ref->must_insert_reserved; | |
2435 | locked_ref->must_insert_reserved = 0; | |
7bb86316 | 2436 | |
5d4f98a2 YZ |
2437 | extent_op = locked_ref->extent_op; |
2438 | locked_ref->extent_op = NULL; | |
2439 | ||
56bec294 | 2440 | if (!ref) { |
d7df2c79 JB |
2441 | |
2442 | ||
56bec294 CM |
2443 | /* All delayed refs have been processed, Go ahead |
2444 | * and send the head node to run_one_delayed_ref, | |
2445 | * so that any accounting fixes can happen | |
2446 | */ | |
2447 | ref = &locked_ref->node; | |
5d4f98a2 YZ |
2448 | |
2449 | if (extent_op && must_insert_reserved) { | |
78a6184a | 2450 | btrfs_free_delayed_extent_op(extent_op); |
5d4f98a2 YZ |
2451 | extent_op = NULL; |
2452 | } | |
2453 | ||
2454 | if (extent_op) { | |
d7df2c79 | 2455 | spin_unlock(&locked_ref->lock); |
5d4f98a2 YZ |
2456 | ret = run_delayed_extent_op(trans, root, |
2457 | ref, extent_op); | |
78a6184a | 2458 | btrfs_free_delayed_extent_op(extent_op); |
5d4f98a2 | 2459 | |
79787eaa | 2460 | if (ret) { |
857cc2fc JB |
2461 | /* |
2462 | * Need to reset must_insert_reserved if | |
2463 | * there was an error so the abort stuff | |
2464 | * can cleanup the reserved space | |
2465 | * properly. | |
2466 | */ | |
2467 | if (must_insert_reserved) | |
2468 | locked_ref->must_insert_reserved = 1; | |
d7df2c79 | 2469 | locked_ref->processing = 0; |
c2cf52eb | 2470 | btrfs_debug(fs_info, "run_delayed_extent_op returned %d", ret); |
093486c4 | 2471 | btrfs_delayed_ref_unlock(locked_ref); |
79787eaa JM |
2472 | return ret; |
2473 | } | |
d7df2c79 | 2474 | continue; |
5d4f98a2 | 2475 | } |
02217ed2 | 2476 | |
d7df2c79 JB |
2477 | /* |
2478 | * Need to drop our head ref lock and re-aqcuire the | |
2479 | * delayed ref lock and then re-check to make sure | |
2480 | * nobody got added. | |
2481 | */ | |
2482 | spin_unlock(&locked_ref->lock); | |
2483 | spin_lock(&delayed_refs->lock); | |
2484 | spin_lock(&locked_ref->lock); | |
573a0755 JB |
2485 | if (rb_first(&locked_ref->ref_root) || |
2486 | locked_ref->extent_op) { | |
d7df2c79 JB |
2487 | spin_unlock(&locked_ref->lock); |
2488 | spin_unlock(&delayed_refs->lock); | |
2489 | continue; | |
2490 | } | |
2491 | ref->in_tree = 0; | |
2492 | delayed_refs->num_heads--; | |
c46effa6 LB |
2493 | rb_erase(&locked_ref->href_node, |
2494 | &delayed_refs->href_root); | |
d7df2c79 JB |
2495 | spin_unlock(&delayed_refs->lock); |
2496 | } else { | |
0a2b2a84 | 2497 | actual_count++; |
d7df2c79 JB |
2498 | ref->in_tree = 0; |
2499 | rb_erase(&ref->rb_node, &locked_ref->ref_root); | |
c46effa6 | 2500 | } |
d7df2c79 JB |
2501 | atomic_dec(&delayed_refs->num_entries); |
2502 | ||
093486c4 | 2503 | if (!btrfs_delayed_ref_is_head(ref)) { |
22cd2e7d AJ |
2504 | /* |
2505 | * when we play the delayed ref, also correct the | |
2506 | * ref_mod on head | |
2507 | */ | |
2508 | switch (ref->action) { | |
2509 | case BTRFS_ADD_DELAYED_REF: | |
2510 | case BTRFS_ADD_DELAYED_EXTENT: | |
2511 | locked_ref->node.ref_mod -= ref->ref_mod; | |
2512 | break; | |
2513 | case BTRFS_DROP_DELAYED_REF: | |
2514 | locked_ref->node.ref_mod += ref->ref_mod; | |
2515 | break; | |
2516 | default: | |
2517 | WARN_ON(1); | |
2518 | } | |
2519 | } | |
d7df2c79 | 2520 | spin_unlock(&locked_ref->lock); |
925baedd | 2521 | |
5d4f98a2 | 2522 | ret = run_one_delayed_ref(trans, root, ref, extent_op, |
56bec294 | 2523 | must_insert_reserved); |
eb099670 | 2524 | |
78a6184a | 2525 | btrfs_free_delayed_extent_op(extent_op); |
79787eaa | 2526 | if (ret) { |
d7df2c79 | 2527 | locked_ref->processing = 0; |
093486c4 MX |
2528 | btrfs_delayed_ref_unlock(locked_ref); |
2529 | btrfs_put_delayed_ref(ref); | |
c2cf52eb | 2530 | btrfs_debug(fs_info, "run_one_delayed_ref returned %d", ret); |
79787eaa JM |
2531 | return ret; |
2532 | } | |
2533 | ||
093486c4 MX |
2534 | /* |
2535 | * If this node is a head, that means all the refs in this head | |
2536 | * have been dealt with, and we will pick the next head to deal | |
2537 | * with, so we must unlock the head and drop it from the cluster | |
2538 | * list before we release it. | |
2539 | */ | |
2540 | if (btrfs_delayed_ref_is_head(ref)) { | |
1262133b JB |
2541 | if (locked_ref->is_data && |
2542 | locked_ref->total_ref_mod < 0) { | |
2543 | spin_lock(&delayed_refs->lock); | |
2544 | delayed_refs->pending_csums -= ref->num_bytes; | |
2545 | spin_unlock(&delayed_refs->lock); | |
2546 | } | |
093486c4 MX |
2547 | btrfs_delayed_ref_unlock(locked_ref); |
2548 | locked_ref = NULL; | |
2549 | } | |
2550 | btrfs_put_delayed_ref(ref); | |
2551 | count++; | |
c3e69d58 | 2552 | cond_resched(); |
c3e69d58 | 2553 | } |
0a2b2a84 JB |
2554 | |
2555 | /* | |
2556 | * We don't want to include ref heads since we can have empty ref heads | |
2557 | * and those will drastically skew our runtime down since we just do | |
2558 | * accounting, no actual extent tree updates. | |
2559 | */ | |
2560 | if (actual_count > 0) { | |
2561 | u64 runtime = ktime_to_ns(ktime_sub(ktime_get(), start)); | |
2562 | u64 avg; | |
2563 | ||
2564 | /* | |
2565 | * We weigh the current average higher than our current runtime | |
2566 | * to avoid large swings in the average. | |
2567 | */ | |
2568 | spin_lock(&delayed_refs->lock); | |
2569 | avg = fs_info->avg_delayed_ref_runtime * 3 + runtime; | |
f8c269d7 | 2570 | fs_info->avg_delayed_ref_runtime = avg >> 2; /* div by 4 */ |
0a2b2a84 JB |
2571 | spin_unlock(&delayed_refs->lock); |
2572 | } | |
d7df2c79 | 2573 | return 0; |
c3e69d58 CM |
2574 | } |
2575 | ||
709c0486 AJ |
2576 | #ifdef SCRAMBLE_DELAYED_REFS |
2577 | /* | |
2578 | * Normally delayed refs get processed in ascending bytenr order. This | |
2579 | * correlates in most cases to the order added. To expose dependencies on this | |
2580 | * order, we start to process the tree in the middle instead of the beginning | |
2581 | */ | |
2582 | static u64 find_middle(struct rb_root *root) | |
2583 | { | |
2584 | struct rb_node *n = root->rb_node; | |
2585 | struct btrfs_delayed_ref_node *entry; | |
2586 | int alt = 1; | |
2587 | u64 middle; | |
2588 | u64 first = 0, last = 0; | |
2589 | ||
2590 | n = rb_first(root); | |
2591 | if (n) { | |
2592 | entry = rb_entry(n, struct btrfs_delayed_ref_node, rb_node); | |
2593 | first = entry->bytenr; | |
2594 | } | |
2595 | n = rb_last(root); | |
2596 | if (n) { | |
2597 | entry = rb_entry(n, struct btrfs_delayed_ref_node, rb_node); | |
2598 | last = entry->bytenr; | |
2599 | } | |
2600 | n = root->rb_node; | |
2601 | ||
2602 | while (n) { | |
2603 | entry = rb_entry(n, struct btrfs_delayed_ref_node, rb_node); | |
2604 | WARN_ON(!entry->in_tree); | |
2605 | ||
2606 | middle = entry->bytenr; | |
2607 | ||
2608 | if (alt) | |
2609 | n = n->rb_left; | |
2610 | else | |
2611 | n = n->rb_right; | |
2612 | ||
2613 | alt = 1 - alt; | |
2614 | } | |
2615 | return middle; | |
2616 | } | |
2617 | #endif | |
2618 | ||
1be41b78 JB |
2619 | static inline u64 heads_to_leaves(struct btrfs_root *root, u64 heads) |
2620 | { | |
2621 | u64 num_bytes; | |
2622 | ||
2623 | num_bytes = heads * (sizeof(struct btrfs_extent_item) + | |
2624 | sizeof(struct btrfs_extent_inline_ref)); | |
2625 | if (!btrfs_fs_incompat(root->fs_info, SKINNY_METADATA)) | |
2626 | num_bytes += heads * sizeof(struct btrfs_tree_block_info); | |
2627 | ||
2628 | /* | |
2629 | * We don't ever fill up leaves all the way so multiply by 2 just to be | |
2630 | * closer to what we're really going to want to ouse. | |
2631 | */ | |
f8c269d7 | 2632 | return div_u64(num_bytes, BTRFS_LEAF_DATA_SIZE(root)); |
1be41b78 JB |
2633 | } |
2634 | ||
1262133b JB |
2635 | /* |
2636 | * Takes the number of bytes to be csumm'ed and figures out how many leaves it | |
2637 | * would require to store the csums for that many bytes. | |
2638 | */ | |
2639 | static u64 csum_bytes_to_leaves(struct btrfs_root *root, u64 csum_bytes) | |
2640 | { | |
2641 | u64 csum_size; | |
2642 | u64 num_csums_per_leaf; | |
2643 | u64 num_csums; | |
2644 | ||
2645 | csum_size = BTRFS_LEAF_DATA_SIZE(root) - sizeof(struct btrfs_item); | |
2646 | num_csums_per_leaf = div64_u64(csum_size, | |
2647 | (u64)btrfs_super_csum_size(root->fs_info->super_copy)); | |
2648 | num_csums = div64_u64(csum_bytes, root->sectorsize); | |
2649 | num_csums += num_csums_per_leaf - 1; | |
2650 | num_csums = div64_u64(num_csums, num_csums_per_leaf); | |
2651 | return num_csums; | |
2652 | } | |
2653 | ||
0a2b2a84 | 2654 | int btrfs_check_space_for_delayed_refs(struct btrfs_trans_handle *trans, |
1be41b78 JB |
2655 | struct btrfs_root *root) |
2656 | { | |
2657 | struct btrfs_block_rsv *global_rsv; | |
2658 | u64 num_heads = trans->transaction->delayed_refs.num_heads_ready; | |
1262133b | 2659 | u64 csum_bytes = trans->transaction->delayed_refs.pending_csums; |
1be41b78 JB |
2660 | u64 num_bytes; |
2661 | int ret = 0; | |
2662 | ||
2663 | num_bytes = btrfs_calc_trans_metadata_size(root, 1); | |
2664 | num_heads = heads_to_leaves(root, num_heads); | |
2665 | if (num_heads > 1) | |
707e8a07 | 2666 | num_bytes += (num_heads - 1) * root->nodesize; |
1be41b78 | 2667 | num_bytes <<= 1; |
1262133b | 2668 | num_bytes += csum_bytes_to_leaves(root, csum_bytes) * root->nodesize; |
1be41b78 JB |
2669 | global_rsv = &root->fs_info->global_block_rsv; |
2670 | ||
2671 | /* | |
2672 | * If we can't allocate any more chunks lets make sure we have _lots_ of | |
2673 | * wiggle room since running delayed refs can create more delayed refs. | |
2674 | */ | |
2675 | if (global_rsv->space_info->full) | |
2676 | num_bytes <<= 1; | |
2677 | ||
2678 | spin_lock(&global_rsv->lock); | |
2679 | if (global_rsv->reserved <= num_bytes) | |
2680 | ret = 1; | |
2681 | spin_unlock(&global_rsv->lock); | |
2682 | return ret; | |
2683 | } | |
2684 | ||
0a2b2a84 JB |
2685 | int btrfs_should_throttle_delayed_refs(struct btrfs_trans_handle *trans, |
2686 | struct btrfs_root *root) | |
2687 | { | |
2688 | struct btrfs_fs_info *fs_info = root->fs_info; | |
2689 | u64 num_entries = | |
2690 | atomic_read(&trans->transaction->delayed_refs.num_entries); | |
2691 | u64 avg_runtime; | |
a79b7d4b | 2692 | u64 val; |
0a2b2a84 JB |
2693 | |
2694 | smp_mb(); | |
2695 | avg_runtime = fs_info->avg_delayed_ref_runtime; | |
a79b7d4b | 2696 | val = num_entries * avg_runtime; |
0a2b2a84 JB |
2697 | if (num_entries * avg_runtime >= NSEC_PER_SEC) |
2698 | return 1; | |
a79b7d4b CM |
2699 | if (val >= NSEC_PER_SEC / 2) |
2700 | return 2; | |
0a2b2a84 JB |
2701 | |
2702 | return btrfs_check_space_for_delayed_refs(trans, root); | |
2703 | } | |
2704 | ||
a79b7d4b CM |
2705 | struct async_delayed_refs { |
2706 | struct btrfs_root *root; | |
2707 | int count; | |
2708 | int error; | |
2709 | int sync; | |
2710 | struct completion wait; | |
2711 | struct btrfs_work work; | |
2712 | }; | |
2713 | ||
2714 | static void delayed_ref_async_start(struct btrfs_work *work) | |
2715 | { | |
2716 | struct async_delayed_refs *async; | |
2717 | struct btrfs_trans_handle *trans; | |
2718 | int ret; | |
2719 | ||
2720 | async = container_of(work, struct async_delayed_refs, work); | |
2721 | ||
2722 | trans = btrfs_join_transaction(async->root); | |
2723 | if (IS_ERR(trans)) { | |
2724 | async->error = PTR_ERR(trans); | |
2725 | goto done; | |
2726 | } | |
2727 | ||
2728 | /* | |
2729 | * trans->sync means that when we call end_transaciton, we won't | |
2730 | * wait on delayed refs | |
2731 | */ | |
2732 | trans->sync = true; | |
2733 | ret = btrfs_run_delayed_refs(trans, async->root, async->count); | |
2734 | if (ret) | |
2735 | async->error = ret; | |
2736 | ||
2737 | ret = btrfs_end_transaction(trans, async->root); | |
2738 | if (ret && !async->error) | |
2739 | async->error = ret; | |
2740 | done: | |
2741 | if (async->sync) | |
2742 | complete(&async->wait); | |
2743 | else | |
2744 | kfree(async); | |
2745 | } | |
2746 | ||
2747 | int btrfs_async_run_delayed_refs(struct btrfs_root *root, | |
2748 | unsigned long count, int wait) | |
2749 | { | |
2750 | struct async_delayed_refs *async; | |
2751 | int ret; | |
2752 | ||
2753 | async = kmalloc(sizeof(*async), GFP_NOFS); | |
2754 | if (!async) | |
2755 | return -ENOMEM; | |
2756 | ||
2757 | async->root = root->fs_info->tree_root; | |
2758 | async->count = count; | |
2759 | async->error = 0; | |
2760 | if (wait) | |
2761 | async->sync = 1; | |
2762 | else | |
2763 | async->sync = 0; | |
2764 | init_completion(&async->wait); | |
2765 | ||
9e0af237 LB |
2766 | btrfs_init_work(&async->work, btrfs_extent_refs_helper, |
2767 | delayed_ref_async_start, NULL, NULL); | |
a79b7d4b CM |
2768 | |
2769 | btrfs_queue_work(root->fs_info->extent_workers, &async->work); | |
2770 | ||
2771 | if (wait) { | |
2772 | wait_for_completion(&async->wait); | |
2773 | ret = async->error; | |
2774 | kfree(async); | |
2775 | return ret; | |
2776 | } | |
2777 | return 0; | |
2778 | } | |
2779 | ||
c3e69d58 CM |
2780 | /* |
2781 | * this starts processing the delayed reference count updates and | |
2782 | * extent insertions we have queued up so far. count can be | |
2783 | * 0, which means to process everything in the tree at the start | |
2784 | * of the run (but not newly added entries), or it can be some target | |
2785 | * number you'd like to process. | |
79787eaa JM |
2786 | * |
2787 | * Returns 0 on success or if called with an aborted transaction | |
2788 | * Returns <0 on error and aborts the transaction | |
c3e69d58 CM |
2789 | */ |
2790 | int btrfs_run_delayed_refs(struct btrfs_trans_handle *trans, | |
2791 | struct btrfs_root *root, unsigned long count) | |
2792 | { | |
2793 | struct rb_node *node; | |
2794 | struct btrfs_delayed_ref_root *delayed_refs; | |
c46effa6 | 2795 | struct btrfs_delayed_ref_head *head; |
c3e69d58 CM |
2796 | int ret; |
2797 | int run_all = count == (unsigned long)-1; | |
c3e69d58 | 2798 | |
79787eaa JM |
2799 | /* We'll clean this up in btrfs_cleanup_transaction */ |
2800 | if (trans->aborted) | |
2801 | return 0; | |
2802 | ||
c3e69d58 CM |
2803 | if (root == root->fs_info->extent_root) |
2804 | root = root->fs_info->tree_root; | |
2805 | ||
2806 | delayed_refs = &trans->transaction->delayed_refs; | |
26455d33 | 2807 | if (count == 0) |
d7df2c79 | 2808 | count = atomic_read(&delayed_refs->num_entries) * 2; |
bb721703 | 2809 | |
c3e69d58 | 2810 | again: |
709c0486 AJ |
2811 | #ifdef SCRAMBLE_DELAYED_REFS |
2812 | delayed_refs->run_delayed_start = find_middle(&delayed_refs->root); | |
2813 | #endif | |
d7df2c79 JB |
2814 | ret = __btrfs_run_delayed_refs(trans, root, count); |
2815 | if (ret < 0) { | |
2816 | btrfs_abort_transaction(trans, root, ret); | |
2817 | return ret; | |
eb099670 | 2818 | } |
c3e69d58 | 2819 | |
56bec294 | 2820 | if (run_all) { |
d7df2c79 | 2821 | if (!list_empty(&trans->new_bgs)) |
ea658bad | 2822 | btrfs_create_pending_block_groups(trans, root); |
ea658bad | 2823 | |
d7df2c79 | 2824 | spin_lock(&delayed_refs->lock); |
c46effa6 | 2825 | node = rb_first(&delayed_refs->href_root); |
d7df2c79 JB |
2826 | if (!node) { |
2827 | spin_unlock(&delayed_refs->lock); | |
56bec294 | 2828 | goto out; |
d7df2c79 | 2829 | } |
c3e69d58 | 2830 | count = (unsigned long)-1; |
e9d0b13b | 2831 | |
56bec294 | 2832 | while (node) { |
c46effa6 LB |
2833 | head = rb_entry(node, struct btrfs_delayed_ref_head, |
2834 | href_node); | |
2835 | if (btrfs_delayed_ref_is_head(&head->node)) { | |
2836 | struct btrfs_delayed_ref_node *ref; | |
5caf2a00 | 2837 | |
c46effa6 | 2838 | ref = &head->node; |
56bec294 CM |
2839 | atomic_inc(&ref->refs); |
2840 | ||
2841 | spin_unlock(&delayed_refs->lock); | |
8cc33e5c DS |
2842 | /* |
2843 | * Mutex was contended, block until it's | |
2844 | * released and try again | |
2845 | */ | |
56bec294 CM |
2846 | mutex_lock(&head->mutex); |
2847 | mutex_unlock(&head->mutex); | |
2848 | ||
2849 | btrfs_put_delayed_ref(ref); | |
1887be66 | 2850 | cond_resched(); |
56bec294 | 2851 | goto again; |
c46effa6 LB |
2852 | } else { |
2853 | WARN_ON(1); | |
56bec294 CM |
2854 | } |
2855 | node = rb_next(node); | |
2856 | } | |
2857 | spin_unlock(&delayed_refs->lock); | |
d7df2c79 | 2858 | cond_resched(); |
56bec294 | 2859 | goto again; |
5f39d397 | 2860 | } |
54aa1f4d | 2861 | out: |
fcebe456 JB |
2862 | ret = btrfs_delayed_qgroup_accounting(trans, root->fs_info); |
2863 | if (ret) | |
2864 | return ret; | |
edf39272 | 2865 | assert_qgroups_uptodate(trans); |
a28ec197 CM |
2866 | return 0; |
2867 | } | |
2868 | ||
5d4f98a2 YZ |
2869 | int btrfs_set_disk_extent_flags(struct btrfs_trans_handle *trans, |
2870 | struct btrfs_root *root, | |
2871 | u64 bytenr, u64 num_bytes, u64 flags, | |
b1c79e09 | 2872 | int level, int is_data) |
5d4f98a2 YZ |
2873 | { |
2874 | struct btrfs_delayed_extent_op *extent_op; | |
2875 | int ret; | |
2876 | ||
78a6184a | 2877 | extent_op = btrfs_alloc_delayed_extent_op(); |
5d4f98a2 YZ |
2878 | if (!extent_op) |
2879 | return -ENOMEM; | |
2880 | ||
2881 | extent_op->flags_to_set = flags; | |
2882 | extent_op->update_flags = 1; | |
2883 | extent_op->update_key = 0; | |
2884 | extent_op->is_data = is_data ? 1 : 0; | |
b1c79e09 | 2885 | extent_op->level = level; |
5d4f98a2 | 2886 | |
66d7e7f0 AJ |
2887 | ret = btrfs_add_delayed_extent_op(root->fs_info, trans, bytenr, |
2888 | num_bytes, extent_op); | |
5d4f98a2 | 2889 | if (ret) |
78a6184a | 2890 | btrfs_free_delayed_extent_op(extent_op); |
5d4f98a2 YZ |
2891 | return ret; |
2892 | } | |
2893 | ||
2894 | static noinline int check_delayed_ref(struct btrfs_trans_handle *trans, | |
2895 | struct btrfs_root *root, | |
2896 | struct btrfs_path *path, | |
2897 | u64 objectid, u64 offset, u64 bytenr) | |
2898 | { | |
2899 | struct btrfs_delayed_ref_head *head; | |
2900 | struct btrfs_delayed_ref_node *ref; | |
2901 | struct btrfs_delayed_data_ref *data_ref; | |
2902 | struct btrfs_delayed_ref_root *delayed_refs; | |
2903 | struct rb_node *node; | |
2904 | int ret = 0; | |
2905 | ||
5d4f98a2 YZ |
2906 | delayed_refs = &trans->transaction->delayed_refs; |
2907 | spin_lock(&delayed_refs->lock); | |
2908 | head = btrfs_find_delayed_ref_head(trans, bytenr); | |
d7df2c79 JB |
2909 | if (!head) { |
2910 | spin_unlock(&delayed_refs->lock); | |
2911 | return 0; | |
2912 | } | |
5d4f98a2 YZ |
2913 | |
2914 | if (!mutex_trylock(&head->mutex)) { | |
2915 | atomic_inc(&head->node.refs); | |
2916 | spin_unlock(&delayed_refs->lock); | |
2917 | ||
b3b4aa74 | 2918 | btrfs_release_path(path); |
5d4f98a2 | 2919 | |
8cc33e5c DS |
2920 | /* |
2921 | * Mutex was contended, block until it's released and let | |
2922 | * caller try again | |
2923 | */ | |
5d4f98a2 YZ |
2924 | mutex_lock(&head->mutex); |
2925 | mutex_unlock(&head->mutex); | |
2926 | btrfs_put_delayed_ref(&head->node); | |
2927 | return -EAGAIN; | |
2928 | } | |
d7df2c79 | 2929 | spin_unlock(&delayed_refs->lock); |
5d4f98a2 | 2930 | |
d7df2c79 JB |
2931 | spin_lock(&head->lock); |
2932 | node = rb_first(&head->ref_root); | |
2933 | while (node) { | |
2934 | ref = rb_entry(node, struct btrfs_delayed_ref_node, rb_node); | |
2935 | node = rb_next(node); | |
5d4f98a2 | 2936 | |
d7df2c79 JB |
2937 | /* If it's a shared ref we know a cross reference exists */ |
2938 | if (ref->type != BTRFS_EXTENT_DATA_REF_KEY) { | |
2939 | ret = 1; | |
2940 | break; | |
2941 | } | |
5d4f98a2 | 2942 | |
d7df2c79 | 2943 | data_ref = btrfs_delayed_node_to_data_ref(ref); |
5d4f98a2 | 2944 | |
d7df2c79 JB |
2945 | /* |
2946 | * If our ref doesn't match the one we're currently looking at | |
2947 | * then we have a cross reference. | |
2948 | */ | |
2949 | if (data_ref->root != root->root_key.objectid || | |
2950 | data_ref->objectid != objectid || | |
2951 | data_ref->offset != offset) { | |
2952 | ret = 1; | |
2953 | break; | |
2954 | } | |
5d4f98a2 | 2955 | } |
d7df2c79 | 2956 | spin_unlock(&head->lock); |
5d4f98a2 | 2957 | mutex_unlock(&head->mutex); |
5d4f98a2 YZ |
2958 | return ret; |
2959 | } | |
2960 | ||
2961 | static noinline int check_committed_ref(struct btrfs_trans_handle *trans, | |
2962 | struct btrfs_root *root, | |
2963 | struct btrfs_path *path, | |
2964 | u64 objectid, u64 offset, u64 bytenr) | |
be20aa9d CM |
2965 | { |
2966 | struct btrfs_root *extent_root = root->fs_info->extent_root; | |
f321e491 | 2967 | struct extent_buffer *leaf; |
5d4f98a2 YZ |
2968 | struct btrfs_extent_data_ref *ref; |
2969 | struct btrfs_extent_inline_ref *iref; | |
2970 | struct btrfs_extent_item *ei; | |
f321e491 | 2971 | struct btrfs_key key; |
5d4f98a2 | 2972 | u32 item_size; |
be20aa9d | 2973 | int ret; |
925baedd | 2974 | |
be20aa9d | 2975 | key.objectid = bytenr; |
31840ae1 | 2976 | key.offset = (u64)-1; |
f321e491 | 2977 | key.type = BTRFS_EXTENT_ITEM_KEY; |
be20aa9d | 2978 | |
be20aa9d CM |
2979 | ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0); |
2980 | if (ret < 0) | |
2981 | goto out; | |
79787eaa | 2982 | BUG_ON(ret == 0); /* Corruption */ |
80ff3856 YZ |
2983 | |
2984 | ret = -ENOENT; | |
2985 | if (path->slots[0] == 0) | |
31840ae1 | 2986 | goto out; |
be20aa9d | 2987 | |
31840ae1 | 2988 | path->slots[0]--; |
f321e491 | 2989 | leaf = path->nodes[0]; |
5d4f98a2 | 2990 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); |
be20aa9d | 2991 | |
5d4f98a2 | 2992 | if (key.objectid != bytenr || key.type != BTRFS_EXTENT_ITEM_KEY) |
be20aa9d | 2993 | goto out; |
f321e491 | 2994 | |
5d4f98a2 YZ |
2995 | ret = 1; |
2996 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
2997 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
2998 | if (item_size < sizeof(*ei)) { | |
2999 | WARN_ON(item_size != sizeof(struct btrfs_extent_item_v0)); | |
3000 | goto out; | |
3001 | } | |
3002 | #endif | |
3003 | ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); | |
bd09835d | 3004 | |
5d4f98a2 YZ |
3005 | if (item_size != sizeof(*ei) + |
3006 | btrfs_extent_inline_ref_size(BTRFS_EXTENT_DATA_REF_KEY)) | |
3007 | goto out; | |
be20aa9d | 3008 | |
5d4f98a2 YZ |
3009 | if (btrfs_extent_generation(leaf, ei) <= |
3010 | btrfs_root_last_snapshot(&root->root_item)) | |
3011 | goto out; | |
3012 | ||
3013 | iref = (struct btrfs_extent_inline_ref *)(ei + 1); | |
3014 | if (btrfs_extent_inline_ref_type(leaf, iref) != | |
3015 | BTRFS_EXTENT_DATA_REF_KEY) | |
3016 | goto out; | |
3017 | ||
3018 | ref = (struct btrfs_extent_data_ref *)(&iref->offset); | |
3019 | if (btrfs_extent_refs(leaf, ei) != | |
3020 | btrfs_extent_data_ref_count(leaf, ref) || | |
3021 | btrfs_extent_data_ref_root(leaf, ref) != | |
3022 | root->root_key.objectid || | |
3023 | btrfs_extent_data_ref_objectid(leaf, ref) != objectid || | |
3024 | btrfs_extent_data_ref_offset(leaf, ref) != offset) | |
3025 | goto out; | |
3026 | ||
3027 | ret = 0; | |
3028 | out: | |
3029 | return ret; | |
3030 | } | |
3031 | ||
3032 | int btrfs_cross_ref_exist(struct btrfs_trans_handle *trans, | |
3033 | struct btrfs_root *root, | |
3034 | u64 objectid, u64 offset, u64 bytenr) | |
3035 | { | |
3036 | struct btrfs_path *path; | |
3037 | int ret; | |
3038 | int ret2; | |
3039 | ||
3040 | path = btrfs_alloc_path(); | |
3041 | if (!path) | |
3042 | return -ENOENT; | |
3043 | ||
3044 | do { | |
3045 | ret = check_committed_ref(trans, root, path, objectid, | |
3046 | offset, bytenr); | |
3047 | if (ret && ret != -ENOENT) | |
f321e491 | 3048 | goto out; |
80ff3856 | 3049 | |
5d4f98a2 YZ |
3050 | ret2 = check_delayed_ref(trans, root, path, objectid, |
3051 | offset, bytenr); | |
3052 | } while (ret2 == -EAGAIN); | |
3053 | ||
3054 | if (ret2 && ret2 != -ENOENT) { | |
3055 | ret = ret2; | |
3056 | goto out; | |
f321e491 | 3057 | } |
5d4f98a2 YZ |
3058 | |
3059 | if (ret != -ENOENT || ret2 != -ENOENT) | |
3060 | ret = 0; | |
be20aa9d | 3061 | out: |
80ff3856 | 3062 | btrfs_free_path(path); |
f0486c68 YZ |
3063 | if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID) |
3064 | WARN_ON(ret > 0); | |
f321e491 | 3065 | return ret; |
be20aa9d | 3066 | } |
c5739bba | 3067 | |
5d4f98a2 | 3068 | static int __btrfs_mod_ref(struct btrfs_trans_handle *trans, |
b7a9f29f | 3069 | struct btrfs_root *root, |
5d4f98a2 | 3070 | struct extent_buffer *buf, |
e339a6b0 | 3071 | int full_backref, int inc) |
31840ae1 ZY |
3072 | { |
3073 | u64 bytenr; | |
5d4f98a2 YZ |
3074 | u64 num_bytes; |
3075 | u64 parent; | |
31840ae1 | 3076 | u64 ref_root; |
31840ae1 | 3077 | u32 nritems; |
31840ae1 ZY |
3078 | struct btrfs_key key; |
3079 | struct btrfs_file_extent_item *fi; | |
3080 | int i; | |
3081 | int level; | |
3082 | int ret = 0; | |
31840ae1 | 3083 | int (*process_func)(struct btrfs_trans_handle *, struct btrfs_root *, |
66d7e7f0 | 3084 | u64, u64, u64, u64, u64, u64, int); |
31840ae1 | 3085 | |
fccb84c9 DS |
3086 | |
3087 | if (btrfs_test_is_dummy_root(root)) | |
faa2dbf0 | 3088 | return 0; |
fccb84c9 | 3089 | |
31840ae1 | 3090 | ref_root = btrfs_header_owner(buf); |
31840ae1 ZY |
3091 | nritems = btrfs_header_nritems(buf); |
3092 | level = btrfs_header_level(buf); | |
3093 | ||
27cdeb70 | 3094 | if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state) && level == 0) |
5d4f98a2 | 3095 | return 0; |
31840ae1 | 3096 | |
5d4f98a2 YZ |
3097 | if (inc) |
3098 | process_func = btrfs_inc_extent_ref; | |
3099 | else | |
3100 | process_func = btrfs_free_extent; | |
31840ae1 | 3101 | |
5d4f98a2 YZ |
3102 | if (full_backref) |
3103 | parent = buf->start; | |
3104 | else | |
3105 | parent = 0; | |
3106 | ||
3107 | for (i = 0; i < nritems; i++) { | |
31840ae1 | 3108 | if (level == 0) { |
5d4f98a2 | 3109 | btrfs_item_key_to_cpu(buf, &key, i); |
962a298f | 3110 | if (key.type != BTRFS_EXTENT_DATA_KEY) |
31840ae1 | 3111 | continue; |
5d4f98a2 | 3112 | fi = btrfs_item_ptr(buf, i, |
31840ae1 ZY |
3113 | struct btrfs_file_extent_item); |
3114 | if (btrfs_file_extent_type(buf, fi) == | |
3115 | BTRFS_FILE_EXTENT_INLINE) | |
3116 | continue; | |
3117 | bytenr = btrfs_file_extent_disk_bytenr(buf, fi); | |
3118 | if (bytenr == 0) | |
3119 | continue; | |
5d4f98a2 YZ |
3120 | |
3121 | num_bytes = btrfs_file_extent_disk_num_bytes(buf, fi); | |
3122 | key.offset -= btrfs_file_extent_offset(buf, fi); | |
3123 | ret = process_func(trans, root, bytenr, num_bytes, | |
3124 | parent, ref_root, key.objectid, | |
e339a6b0 | 3125 | key.offset, 1); |
31840ae1 ZY |
3126 | if (ret) |
3127 | goto fail; | |
3128 | } else { | |
5d4f98a2 | 3129 | bytenr = btrfs_node_blockptr(buf, i); |
707e8a07 | 3130 | num_bytes = root->nodesize; |
5d4f98a2 | 3131 | ret = process_func(trans, root, bytenr, num_bytes, |
66d7e7f0 | 3132 | parent, ref_root, level - 1, 0, |
e339a6b0 | 3133 | 1); |
31840ae1 ZY |
3134 | if (ret) |
3135 | goto fail; | |
3136 | } | |
3137 | } | |
3138 | return 0; | |
3139 | fail: | |
5d4f98a2 YZ |
3140 | return ret; |
3141 | } | |
3142 | ||
3143 | int btrfs_inc_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root, | |
e339a6b0 | 3144 | struct extent_buffer *buf, int full_backref) |
5d4f98a2 | 3145 | { |
e339a6b0 | 3146 | return __btrfs_mod_ref(trans, root, buf, full_backref, 1); |
5d4f98a2 YZ |
3147 | } |
3148 | ||
3149 | int btrfs_dec_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root, | |
e339a6b0 | 3150 | struct extent_buffer *buf, int full_backref) |
5d4f98a2 | 3151 | { |
e339a6b0 | 3152 | return __btrfs_mod_ref(trans, root, buf, full_backref, 0); |
31840ae1 ZY |
3153 | } |
3154 | ||
9078a3e1 CM |
3155 | static int write_one_cache_group(struct btrfs_trans_handle *trans, |
3156 | struct btrfs_root *root, | |
3157 | struct btrfs_path *path, | |
3158 | struct btrfs_block_group_cache *cache) | |
3159 | { | |
3160 | int ret; | |
9078a3e1 | 3161 | struct btrfs_root *extent_root = root->fs_info->extent_root; |
5f39d397 CM |
3162 | unsigned long bi; |
3163 | struct extent_buffer *leaf; | |
9078a3e1 | 3164 | |
9078a3e1 | 3165 | ret = btrfs_search_slot(trans, extent_root, &cache->key, path, 0, 1); |
df95e7f0 JB |
3166 | if (ret) { |
3167 | if (ret > 0) | |
3168 | ret = -ENOENT; | |
54aa1f4d | 3169 | goto fail; |
df95e7f0 | 3170 | } |
5f39d397 CM |
3171 | |
3172 | leaf = path->nodes[0]; | |
3173 | bi = btrfs_item_ptr_offset(leaf, path->slots[0]); | |
3174 | write_extent_buffer(leaf, &cache->item, bi, sizeof(cache->item)); | |
3175 | btrfs_mark_buffer_dirty(leaf); | |
b3b4aa74 | 3176 | btrfs_release_path(path); |
54aa1f4d | 3177 | fail: |
df95e7f0 | 3178 | if (ret) |
79787eaa | 3179 | btrfs_abort_transaction(trans, root, ret); |
df95e7f0 | 3180 | return ret; |
9078a3e1 CM |
3181 | |
3182 | } | |
3183 | ||
4a8c9a62 YZ |
3184 | static struct btrfs_block_group_cache * |
3185 | next_block_group(struct btrfs_root *root, | |
3186 | struct btrfs_block_group_cache *cache) | |
3187 | { | |
3188 | struct rb_node *node; | |
292cbd51 | 3189 | |
4a8c9a62 | 3190 | spin_lock(&root->fs_info->block_group_cache_lock); |
292cbd51 FM |
3191 | |
3192 | /* If our block group was removed, we need a full search. */ | |
3193 | if (RB_EMPTY_NODE(&cache->cache_node)) { | |
3194 | const u64 next_bytenr = cache->key.objectid + cache->key.offset; | |
3195 | ||
3196 | spin_unlock(&root->fs_info->block_group_cache_lock); | |
3197 | btrfs_put_block_group(cache); | |
3198 | cache = btrfs_lookup_first_block_group(root->fs_info, | |
3199 | next_bytenr); | |
3200 | return cache; | |
3201 | } | |
4a8c9a62 YZ |
3202 | node = rb_next(&cache->cache_node); |
3203 | btrfs_put_block_group(cache); | |
3204 | if (node) { | |
3205 | cache = rb_entry(node, struct btrfs_block_group_cache, | |
3206 | cache_node); | |
11dfe35a | 3207 | btrfs_get_block_group(cache); |
4a8c9a62 YZ |
3208 | } else |
3209 | cache = NULL; | |
3210 | spin_unlock(&root->fs_info->block_group_cache_lock); | |
3211 | return cache; | |
3212 | } | |
3213 | ||
0af3d00b JB |
3214 | static int cache_save_setup(struct btrfs_block_group_cache *block_group, |
3215 | struct btrfs_trans_handle *trans, | |
3216 | struct btrfs_path *path) | |
3217 | { | |
3218 | struct btrfs_root *root = block_group->fs_info->tree_root; | |
3219 | struct inode *inode = NULL; | |
3220 | u64 alloc_hint = 0; | |
2b20982e | 3221 | int dcs = BTRFS_DC_ERROR; |
f8c269d7 | 3222 | u64 num_pages = 0; |
0af3d00b JB |
3223 | int retries = 0; |
3224 | int ret = 0; | |
3225 | ||
3226 | /* | |
3227 | * If this block group is smaller than 100 megs don't bother caching the | |
3228 | * block group. | |
3229 | */ | |
3230 | if (block_group->key.offset < (100 * 1024 * 1024)) { | |
3231 | spin_lock(&block_group->lock); | |
3232 | block_group->disk_cache_state = BTRFS_DC_WRITTEN; | |
3233 | spin_unlock(&block_group->lock); | |
3234 | return 0; | |
3235 | } | |
3236 | ||
0c0ef4bc JB |
3237 | if (trans->aborted) |
3238 | return 0; | |
0af3d00b JB |
3239 | again: |
3240 | inode = lookup_free_space_inode(root, block_group, path); | |
3241 | if (IS_ERR(inode) && PTR_ERR(inode) != -ENOENT) { | |
3242 | ret = PTR_ERR(inode); | |
b3b4aa74 | 3243 | btrfs_release_path(path); |
0af3d00b JB |
3244 | goto out; |
3245 | } | |
3246 | ||
3247 | if (IS_ERR(inode)) { | |
3248 | BUG_ON(retries); | |
3249 | retries++; | |
3250 | ||
3251 | if (block_group->ro) | |
3252 | goto out_free; | |
3253 | ||
3254 | ret = create_free_space_inode(root, trans, block_group, path); | |
3255 | if (ret) | |
3256 | goto out_free; | |
3257 | goto again; | |
3258 | } | |
3259 | ||
5b0e95bf JB |
3260 | /* We've already setup this transaction, go ahead and exit */ |
3261 | if (block_group->cache_generation == trans->transid && | |
3262 | i_size_read(inode)) { | |
3263 | dcs = BTRFS_DC_SETUP; | |
3264 | goto out_put; | |
3265 | } | |
3266 | ||
0af3d00b JB |
3267 | /* |
3268 | * We want to set the generation to 0, that way if anything goes wrong | |
3269 | * from here on out we know not to trust this cache when we load up next | |
3270 | * time. | |
3271 | */ | |
3272 | BTRFS_I(inode)->generation = 0; | |
3273 | ret = btrfs_update_inode(trans, root, inode); | |
0c0ef4bc JB |
3274 | if (ret) { |
3275 | /* | |
3276 | * So theoretically we could recover from this, simply set the | |
3277 | * super cache generation to 0 so we know to invalidate the | |
3278 | * cache, but then we'd have to keep track of the block groups | |
3279 | * that fail this way so we know we _have_ to reset this cache | |
3280 | * before the next commit or risk reading stale cache. So to | |
3281 | * limit our exposure to horrible edge cases lets just abort the | |
3282 | * transaction, this only happens in really bad situations | |
3283 | * anyway. | |
3284 | */ | |
3285 | btrfs_abort_transaction(trans, root, ret); | |
3286 | goto out_put; | |
3287 | } | |
0af3d00b JB |
3288 | WARN_ON(ret); |
3289 | ||
3290 | if (i_size_read(inode) > 0) { | |
7b61cd92 MX |
3291 | ret = btrfs_check_trunc_cache_free_space(root, |
3292 | &root->fs_info->global_block_rsv); | |
3293 | if (ret) | |
3294 | goto out_put; | |
3295 | ||
74514323 | 3296 | ret = btrfs_truncate_free_space_cache(root, trans, inode); |
0af3d00b JB |
3297 | if (ret) |
3298 | goto out_put; | |
3299 | } | |
3300 | ||
3301 | spin_lock(&block_group->lock); | |
cf7c1ef6 | 3302 | if (block_group->cached != BTRFS_CACHE_FINISHED || |
e570fd27 MX |
3303 | !btrfs_test_opt(root, SPACE_CACHE) || |
3304 | block_group->delalloc_bytes) { | |
cf7c1ef6 LB |
3305 | /* |
3306 | * don't bother trying to write stuff out _if_ | |
3307 | * a) we're not cached, | |
3308 | * b) we're with nospace_cache mount option. | |
3309 | */ | |
2b20982e | 3310 | dcs = BTRFS_DC_WRITTEN; |
0af3d00b JB |
3311 | spin_unlock(&block_group->lock); |
3312 | goto out_put; | |
3313 | } | |
3314 | spin_unlock(&block_group->lock); | |
3315 | ||
6fc823b1 JB |
3316 | /* |
3317 | * Try to preallocate enough space based on how big the block group is. | |
3318 | * Keep in mind this has to include any pinned space which could end up | |
3319 | * taking up quite a bit since it's not folded into the other space | |
3320 | * cache. | |
3321 | */ | |
f8c269d7 | 3322 | num_pages = div_u64(block_group->key.offset, 256 * 1024 * 1024); |
0af3d00b JB |
3323 | if (!num_pages) |
3324 | num_pages = 1; | |
3325 | ||
0af3d00b JB |
3326 | num_pages *= 16; |
3327 | num_pages *= PAGE_CACHE_SIZE; | |
3328 | ||
3329 | ret = btrfs_check_data_free_space(inode, num_pages); | |
3330 | if (ret) | |
3331 | goto out_put; | |
3332 | ||
3333 | ret = btrfs_prealloc_file_range_trans(inode, trans, 0, 0, num_pages, | |
3334 | num_pages, num_pages, | |
3335 | &alloc_hint); | |
2b20982e JB |
3336 | if (!ret) |
3337 | dcs = BTRFS_DC_SETUP; | |
0af3d00b | 3338 | btrfs_free_reserved_data_space(inode, num_pages); |
c09544e0 | 3339 | |
0af3d00b JB |
3340 | out_put: |
3341 | iput(inode); | |
3342 | out_free: | |
b3b4aa74 | 3343 | btrfs_release_path(path); |
0af3d00b JB |
3344 | out: |
3345 | spin_lock(&block_group->lock); | |
e65cbb94 | 3346 | if (!ret && dcs == BTRFS_DC_SETUP) |
5b0e95bf | 3347 | block_group->cache_generation = trans->transid; |
2b20982e | 3348 | block_group->disk_cache_state = dcs; |
0af3d00b JB |
3349 | spin_unlock(&block_group->lock); |
3350 | ||
3351 | return ret; | |
3352 | } | |
3353 | ||
dcdf7f6d JB |
3354 | int btrfs_setup_space_cache(struct btrfs_trans_handle *trans, |
3355 | struct btrfs_root *root) | |
3356 | { | |
3357 | struct btrfs_block_group_cache *cache, *tmp; | |
3358 | struct btrfs_transaction *cur_trans = trans->transaction; | |
3359 | struct btrfs_path *path; | |
3360 | ||
3361 | if (list_empty(&cur_trans->dirty_bgs) || | |
3362 | !btrfs_test_opt(root, SPACE_CACHE)) | |
3363 | return 0; | |
3364 | ||
3365 | path = btrfs_alloc_path(); | |
3366 | if (!path) | |
3367 | return -ENOMEM; | |
3368 | ||
3369 | /* Could add new block groups, use _safe just in case */ | |
3370 | list_for_each_entry_safe(cache, tmp, &cur_trans->dirty_bgs, | |
3371 | dirty_list) { | |
3372 | if (cache->disk_cache_state == BTRFS_DC_CLEAR) | |
3373 | cache_save_setup(cache, trans, path); | |
3374 | } | |
3375 | ||
3376 | btrfs_free_path(path); | |
3377 | return 0; | |
3378 | } | |
3379 | ||
96b5179d CM |
3380 | int btrfs_write_dirty_block_groups(struct btrfs_trans_handle *trans, |
3381 | struct btrfs_root *root) | |
9078a3e1 | 3382 | { |
4a8c9a62 | 3383 | struct btrfs_block_group_cache *cache; |
ce93ec54 JB |
3384 | struct btrfs_transaction *cur_trans = trans->transaction; |
3385 | int ret = 0; | |
9078a3e1 | 3386 | struct btrfs_path *path; |
ce93ec54 JB |
3387 | |
3388 | if (list_empty(&cur_trans->dirty_bgs)) | |
3389 | return 0; | |
9078a3e1 CM |
3390 | |
3391 | path = btrfs_alloc_path(); | |
3392 | if (!path) | |
3393 | return -ENOMEM; | |
3394 | ||
ce93ec54 JB |
3395 | /* |
3396 | * We don't need the lock here since we are protected by the transaction | |
3397 | * commit. We want to do the cache_save_setup first and then run the | |
3398 | * delayed refs to make sure we have the best chance at doing this all | |
3399 | * in one shot. | |
3400 | */ | |
3401 | while (!list_empty(&cur_trans->dirty_bgs)) { | |
3402 | cache = list_first_entry(&cur_trans->dirty_bgs, | |
3403 | struct btrfs_block_group_cache, | |
3404 | dirty_list); | |
3405 | list_del_init(&cache->dirty_list); | |
3406 | if (cache->disk_cache_state == BTRFS_DC_CLEAR) | |
3407 | cache_save_setup(cache, trans, path); | |
3408 | if (!ret) | |
3409 | ret = btrfs_run_delayed_refs(trans, root, | |
3410 | (unsigned long) -1); | |
3411 | if (!ret && cache->disk_cache_state == BTRFS_DC_SETUP) | |
3412 | btrfs_write_out_cache(root, trans, cache, path); | |
3413 | if (!ret) | |
3414 | ret = write_one_cache_group(trans, root, path, cache); | |
0cb59c99 JB |
3415 | btrfs_put_block_group(cache); |
3416 | } | |
3417 | ||
9078a3e1 | 3418 | btrfs_free_path(path); |
ce93ec54 | 3419 | return ret; |
9078a3e1 CM |
3420 | } |
3421 | ||
d2fb3437 YZ |
3422 | int btrfs_extent_readonly(struct btrfs_root *root, u64 bytenr) |
3423 | { | |
3424 | struct btrfs_block_group_cache *block_group; | |
3425 | int readonly = 0; | |
3426 | ||
3427 | block_group = btrfs_lookup_block_group(root->fs_info, bytenr); | |
3428 | if (!block_group || block_group->ro) | |
3429 | readonly = 1; | |
3430 | if (block_group) | |
fa9c0d79 | 3431 | btrfs_put_block_group(block_group); |
d2fb3437 YZ |
3432 | return readonly; |
3433 | } | |
3434 | ||
6ab0a202 JM |
3435 | static const char *alloc_name(u64 flags) |
3436 | { | |
3437 | switch (flags) { | |
3438 | case BTRFS_BLOCK_GROUP_METADATA|BTRFS_BLOCK_GROUP_DATA: | |
3439 | return "mixed"; | |
3440 | case BTRFS_BLOCK_GROUP_METADATA: | |
3441 | return "metadata"; | |
3442 | case BTRFS_BLOCK_GROUP_DATA: | |
3443 | return "data"; | |
3444 | case BTRFS_BLOCK_GROUP_SYSTEM: | |
3445 | return "system"; | |
3446 | default: | |
3447 | WARN_ON(1); | |
3448 | return "invalid-combination"; | |
3449 | }; | |
3450 | } | |
3451 | ||
593060d7 CM |
3452 | static int update_space_info(struct btrfs_fs_info *info, u64 flags, |
3453 | u64 total_bytes, u64 bytes_used, | |
3454 | struct btrfs_space_info **space_info) | |
3455 | { | |
3456 | struct btrfs_space_info *found; | |
b742bb82 YZ |
3457 | int i; |
3458 | int factor; | |
b150a4f1 | 3459 | int ret; |
b742bb82 YZ |
3460 | |
3461 | if (flags & (BTRFS_BLOCK_GROUP_DUP | BTRFS_BLOCK_GROUP_RAID1 | | |
3462 | BTRFS_BLOCK_GROUP_RAID10)) | |
3463 | factor = 2; | |
3464 | else | |
3465 | factor = 1; | |
593060d7 CM |
3466 | |
3467 | found = __find_space_info(info, flags); | |
3468 | if (found) { | |
25179201 | 3469 | spin_lock(&found->lock); |
593060d7 | 3470 | found->total_bytes += total_bytes; |
89a55897 | 3471 | found->disk_total += total_bytes * factor; |
593060d7 | 3472 | found->bytes_used += bytes_used; |
b742bb82 | 3473 | found->disk_used += bytes_used * factor; |
8f18cf13 | 3474 | found->full = 0; |
25179201 | 3475 | spin_unlock(&found->lock); |
593060d7 CM |
3476 | *space_info = found; |
3477 | return 0; | |
3478 | } | |
c146afad | 3479 | found = kzalloc(sizeof(*found), GFP_NOFS); |
593060d7 CM |
3480 | if (!found) |
3481 | return -ENOMEM; | |
3482 | ||
908c7f19 | 3483 | ret = percpu_counter_init(&found->total_bytes_pinned, 0, GFP_KERNEL); |
b150a4f1 JB |
3484 | if (ret) { |
3485 | kfree(found); | |
3486 | return ret; | |
3487 | } | |
3488 | ||
c1895442 | 3489 | for (i = 0; i < BTRFS_NR_RAID_TYPES; i++) |
b742bb82 | 3490 | INIT_LIST_HEAD(&found->block_groups[i]); |
80eb234a | 3491 | init_rwsem(&found->groups_sem); |
0f9dd46c | 3492 | spin_lock_init(&found->lock); |
52ba6929 | 3493 | found->flags = flags & BTRFS_BLOCK_GROUP_TYPE_MASK; |
593060d7 | 3494 | found->total_bytes = total_bytes; |
89a55897 | 3495 | found->disk_total = total_bytes * factor; |
593060d7 | 3496 | found->bytes_used = bytes_used; |
b742bb82 | 3497 | found->disk_used = bytes_used * factor; |
593060d7 | 3498 | found->bytes_pinned = 0; |
e8569813 | 3499 | found->bytes_reserved = 0; |
c146afad | 3500 | found->bytes_readonly = 0; |
f0486c68 | 3501 | found->bytes_may_use = 0; |
593060d7 | 3502 | found->full = 0; |
0e4f8f88 | 3503 | found->force_alloc = CHUNK_ALLOC_NO_FORCE; |
6d74119f | 3504 | found->chunk_alloc = 0; |
fdb5effd JB |
3505 | found->flush = 0; |
3506 | init_waitqueue_head(&found->wait); | |
633c0aad | 3507 | INIT_LIST_HEAD(&found->ro_bgs); |
6ab0a202 JM |
3508 | |
3509 | ret = kobject_init_and_add(&found->kobj, &space_info_ktype, | |
3510 | info->space_info_kobj, "%s", | |
3511 | alloc_name(found->flags)); | |
3512 | if (ret) { | |
3513 | kfree(found); | |
3514 | return ret; | |
3515 | } | |
3516 | ||
593060d7 | 3517 | *space_info = found; |
4184ea7f | 3518 | list_add_rcu(&found->list, &info->space_info); |
b4d7c3c9 LZ |
3519 | if (flags & BTRFS_BLOCK_GROUP_DATA) |
3520 | info->data_sinfo = found; | |
6ab0a202 JM |
3521 | |
3522 | return ret; | |
593060d7 CM |
3523 | } |
3524 | ||
8790d502 CM |
3525 | static void set_avail_alloc_bits(struct btrfs_fs_info *fs_info, u64 flags) |
3526 | { | |
899c81ea ID |
3527 | u64 extra_flags = chunk_to_extended(flags) & |
3528 | BTRFS_EXTENDED_PROFILE_MASK; | |
a46d11a8 | 3529 | |
de98ced9 | 3530 | write_seqlock(&fs_info->profiles_lock); |
a46d11a8 ID |
3531 | if (flags & BTRFS_BLOCK_GROUP_DATA) |
3532 | fs_info->avail_data_alloc_bits |= extra_flags; | |
3533 | if (flags & BTRFS_BLOCK_GROUP_METADATA) | |
3534 | fs_info->avail_metadata_alloc_bits |= extra_flags; | |
3535 | if (flags & BTRFS_BLOCK_GROUP_SYSTEM) | |
3536 | fs_info->avail_system_alloc_bits |= extra_flags; | |
de98ced9 | 3537 | write_sequnlock(&fs_info->profiles_lock); |
8790d502 | 3538 | } |
593060d7 | 3539 | |
fc67c450 ID |
3540 | /* |
3541 | * returns target flags in extended format or 0 if restripe for this | |
3542 | * chunk_type is not in progress | |
c6664b42 ID |
3543 | * |
3544 | * should be called with either volume_mutex or balance_lock held | |
fc67c450 ID |
3545 | */ |
3546 | static u64 get_restripe_target(struct btrfs_fs_info *fs_info, u64 flags) | |
3547 | { | |
3548 | struct btrfs_balance_control *bctl = fs_info->balance_ctl; | |
3549 | u64 target = 0; | |
3550 | ||
fc67c450 ID |
3551 | if (!bctl) |
3552 | return 0; | |
3553 | ||
3554 | if (flags & BTRFS_BLOCK_GROUP_DATA && | |
3555 | bctl->data.flags & BTRFS_BALANCE_ARGS_CONVERT) { | |
3556 | target = BTRFS_BLOCK_GROUP_DATA | bctl->data.target; | |
3557 | } else if (flags & BTRFS_BLOCK_GROUP_SYSTEM && | |
3558 | bctl->sys.flags & BTRFS_BALANCE_ARGS_CONVERT) { | |
3559 | target = BTRFS_BLOCK_GROUP_SYSTEM | bctl->sys.target; | |
3560 | } else if (flags & BTRFS_BLOCK_GROUP_METADATA && | |
3561 | bctl->meta.flags & BTRFS_BALANCE_ARGS_CONVERT) { | |
3562 | target = BTRFS_BLOCK_GROUP_METADATA | bctl->meta.target; | |
3563 | } | |
3564 | ||
3565 | return target; | |
3566 | } | |
3567 | ||
a46d11a8 ID |
3568 | /* |
3569 | * @flags: available profiles in extended format (see ctree.h) | |
3570 | * | |
e4d8ec0f ID |
3571 | * Returns reduced profile in chunk format. If profile changing is in |
3572 | * progress (either running or paused) picks the target profile (if it's | |
3573 | * already available), otherwise falls back to plain reducing. | |
a46d11a8 | 3574 | */ |
48a3b636 | 3575 | static u64 btrfs_reduce_alloc_profile(struct btrfs_root *root, u64 flags) |
ec44a35c | 3576 | { |
95669976 | 3577 | u64 num_devices = root->fs_info->fs_devices->rw_devices; |
fc67c450 | 3578 | u64 target; |
53b381b3 | 3579 | u64 tmp; |
a061fc8d | 3580 | |
fc67c450 ID |
3581 | /* |
3582 | * see if restripe for this chunk_type is in progress, if so | |
3583 | * try to reduce to the target profile | |
3584 | */ | |
e4d8ec0f | 3585 | spin_lock(&root->fs_info->balance_lock); |
fc67c450 ID |
3586 | target = get_restripe_target(root->fs_info, flags); |
3587 | if (target) { | |
3588 | /* pick target profile only if it's already available */ | |
3589 | if ((flags & target) & BTRFS_EXTENDED_PROFILE_MASK) { | |
e4d8ec0f | 3590 | spin_unlock(&root->fs_info->balance_lock); |
fc67c450 | 3591 | return extended_to_chunk(target); |
e4d8ec0f ID |
3592 | } |
3593 | } | |
3594 | spin_unlock(&root->fs_info->balance_lock); | |
3595 | ||
53b381b3 | 3596 | /* First, mask out the RAID levels which aren't possible */ |
a061fc8d | 3597 | if (num_devices == 1) |
53b381b3 DW |
3598 | flags &= ~(BTRFS_BLOCK_GROUP_RAID1 | BTRFS_BLOCK_GROUP_RAID0 | |
3599 | BTRFS_BLOCK_GROUP_RAID5); | |
3600 | if (num_devices < 3) | |
3601 | flags &= ~BTRFS_BLOCK_GROUP_RAID6; | |
a061fc8d CM |
3602 | if (num_devices < 4) |
3603 | flags &= ~BTRFS_BLOCK_GROUP_RAID10; | |
3604 | ||
53b381b3 DW |
3605 | tmp = flags & (BTRFS_BLOCK_GROUP_DUP | BTRFS_BLOCK_GROUP_RAID0 | |
3606 | BTRFS_BLOCK_GROUP_RAID1 | BTRFS_BLOCK_GROUP_RAID5 | | |
3607 | BTRFS_BLOCK_GROUP_RAID6 | BTRFS_BLOCK_GROUP_RAID10); | |
3608 | flags &= ~tmp; | |
ec44a35c | 3609 | |
53b381b3 DW |
3610 | if (tmp & BTRFS_BLOCK_GROUP_RAID6) |
3611 | tmp = BTRFS_BLOCK_GROUP_RAID6; | |
3612 | else if (tmp & BTRFS_BLOCK_GROUP_RAID5) | |
3613 | tmp = BTRFS_BLOCK_GROUP_RAID5; | |
3614 | else if (tmp & BTRFS_BLOCK_GROUP_RAID10) | |
3615 | tmp = BTRFS_BLOCK_GROUP_RAID10; | |
3616 | else if (tmp & BTRFS_BLOCK_GROUP_RAID1) | |
3617 | tmp = BTRFS_BLOCK_GROUP_RAID1; | |
3618 | else if (tmp & BTRFS_BLOCK_GROUP_RAID0) | |
3619 | tmp = BTRFS_BLOCK_GROUP_RAID0; | |
a46d11a8 | 3620 | |
53b381b3 | 3621 | return extended_to_chunk(flags | tmp); |
ec44a35c CM |
3622 | } |
3623 | ||
f8213bdc | 3624 | static u64 get_alloc_profile(struct btrfs_root *root, u64 orig_flags) |
6a63209f | 3625 | { |
de98ced9 | 3626 | unsigned seq; |
f8213bdc | 3627 | u64 flags; |
de98ced9 MX |
3628 | |
3629 | do { | |
f8213bdc | 3630 | flags = orig_flags; |
de98ced9 MX |
3631 | seq = read_seqbegin(&root->fs_info->profiles_lock); |
3632 | ||
3633 | if (flags & BTRFS_BLOCK_GROUP_DATA) | |
3634 | flags |= root->fs_info->avail_data_alloc_bits; | |
3635 | else if (flags & BTRFS_BLOCK_GROUP_SYSTEM) | |
3636 | flags |= root->fs_info->avail_system_alloc_bits; | |
3637 | else if (flags & BTRFS_BLOCK_GROUP_METADATA) | |
3638 | flags |= root->fs_info->avail_metadata_alloc_bits; | |
3639 | } while (read_seqretry(&root->fs_info->profiles_lock, seq)); | |
6fef8df1 | 3640 | |
b742bb82 | 3641 | return btrfs_reduce_alloc_profile(root, flags); |
6a63209f JB |
3642 | } |
3643 | ||
6d07bcec | 3644 | u64 btrfs_get_alloc_profile(struct btrfs_root *root, int data) |
9ed74f2d | 3645 | { |
b742bb82 | 3646 | u64 flags; |
53b381b3 | 3647 | u64 ret; |
9ed74f2d | 3648 | |
b742bb82 YZ |
3649 | if (data) |
3650 | flags = BTRFS_BLOCK_GROUP_DATA; | |
3651 | else if (root == root->fs_info->chunk_root) | |
3652 | flags = BTRFS_BLOCK_GROUP_SYSTEM; | |
9ed74f2d | 3653 | else |
b742bb82 | 3654 | flags = BTRFS_BLOCK_GROUP_METADATA; |
9ed74f2d | 3655 | |
53b381b3 DW |
3656 | ret = get_alloc_profile(root, flags); |
3657 | return ret; | |
6a63209f | 3658 | } |
9ed74f2d | 3659 | |
6a63209f | 3660 | /* |
6a63209f JB |
3661 | * This will check the space that the inode allocates from to make sure we have |
3662 | * enough space for bytes. | |
6a63209f | 3663 | */ |
0ca1f7ce | 3664 | int btrfs_check_data_free_space(struct inode *inode, u64 bytes) |
6a63209f | 3665 | { |
6a63209f | 3666 | struct btrfs_space_info *data_sinfo; |
0ca1f7ce | 3667 | struct btrfs_root *root = BTRFS_I(inode)->root; |
b4d7c3c9 | 3668 | struct btrfs_fs_info *fs_info = root->fs_info; |
ab6e2410 | 3669 | u64 used; |
b9fd47cd | 3670 | int ret = 0, committed = 0; |
6a63209f | 3671 | |
6a63209f | 3672 | /* make sure bytes are sectorsize aligned */ |
fda2832f | 3673 | bytes = ALIGN(bytes, root->sectorsize); |
6a63209f | 3674 | |
9dced186 | 3675 | if (btrfs_is_free_space_inode(inode)) { |
0af3d00b | 3676 | committed = 1; |
9dced186 | 3677 | ASSERT(current->journal_info); |
0af3d00b JB |
3678 | } |
3679 | ||
b4d7c3c9 | 3680 | data_sinfo = fs_info->data_sinfo; |
33b4d47f CM |
3681 | if (!data_sinfo) |
3682 | goto alloc; | |
9ed74f2d | 3683 | |
6a63209f JB |
3684 | again: |
3685 | /* make sure we have enough space to handle the data first */ | |
3686 | spin_lock(&data_sinfo->lock); | |
8929ecfa YZ |
3687 | used = data_sinfo->bytes_used + data_sinfo->bytes_reserved + |
3688 | data_sinfo->bytes_pinned + data_sinfo->bytes_readonly + | |
3689 | data_sinfo->bytes_may_use; | |
ab6e2410 JB |
3690 | |
3691 | if (used + bytes > data_sinfo->total_bytes) { | |
4e06bdd6 | 3692 | struct btrfs_trans_handle *trans; |
9ed74f2d | 3693 | |
6a63209f JB |
3694 | /* |
3695 | * if we don't have enough free bytes in this space then we need | |
3696 | * to alloc a new chunk. | |
3697 | */ | |
b9fd47cd | 3698 | if (!data_sinfo->full) { |
6a63209f | 3699 | u64 alloc_target; |
9ed74f2d | 3700 | |
0e4f8f88 | 3701 | data_sinfo->force_alloc = CHUNK_ALLOC_FORCE; |
6a63209f | 3702 | spin_unlock(&data_sinfo->lock); |
33b4d47f | 3703 | alloc: |
6a63209f | 3704 | alloc_target = btrfs_get_alloc_profile(root, 1); |
9dced186 MX |
3705 | /* |
3706 | * It is ugly that we don't call nolock join | |
3707 | * transaction for the free space inode case here. | |
3708 | * But it is safe because we only do the data space | |
3709 | * reservation for the free space cache in the | |
3710 | * transaction context, the common join transaction | |
3711 | * just increase the counter of the current transaction | |
3712 | * handler, doesn't try to acquire the trans_lock of | |
3713 | * the fs. | |
3714 | */ | |
7a7eaa40 | 3715 | trans = btrfs_join_transaction(root); |
a22285a6 YZ |
3716 | if (IS_ERR(trans)) |
3717 | return PTR_ERR(trans); | |
9ed74f2d | 3718 | |
6a63209f | 3719 | ret = do_chunk_alloc(trans, root->fs_info->extent_root, |
0e4f8f88 CM |
3720 | alloc_target, |
3721 | CHUNK_ALLOC_NO_FORCE); | |
6a63209f | 3722 | btrfs_end_transaction(trans, root); |
d52a5b5f MX |
3723 | if (ret < 0) { |
3724 | if (ret != -ENOSPC) | |
3725 | return ret; | |
3726 | else | |
3727 | goto commit_trans; | |
3728 | } | |
9ed74f2d | 3729 | |
b4d7c3c9 LZ |
3730 | if (!data_sinfo) |
3731 | data_sinfo = fs_info->data_sinfo; | |
3732 | ||
6a63209f JB |
3733 | goto again; |
3734 | } | |
f2bb8f5c JB |
3735 | |
3736 | /* | |
b150a4f1 JB |
3737 | * If we don't have enough pinned space to deal with this |
3738 | * allocation don't bother committing the transaction. | |
f2bb8f5c | 3739 | */ |
b150a4f1 JB |
3740 | if (percpu_counter_compare(&data_sinfo->total_bytes_pinned, |
3741 | bytes) < 0) | |
f2bb8f5c | 3742 | committed = 1; |
6a63209f | 3743 | spin_unlock(&data_sinfo->lock); |
6a63209f | 3744 | |
4e06bdd6 | 3745 | /* commit the current transaction and try again */ |
d52a5b5f | 3746 | commit_trans: |
a4abeea4 JB |
3747 | if (!committed && |
3748 | !atomic_read(&root->fs_info->open_ioctl_trans)) { | |
4e06bdd6 | 3749 | committed = 1; |
b150a4f1 | 3750 | |
7a7eaa40 | 3751 | trans = btrfs_join_transaction(root); |
a22285a6 YZ |
3752 | if (IS_ERR(trans)) |
3753 | return PTR_ERR(trans); | |
4e06bdd6 JB |
3754 | ret = btrfs_commit_transaction(trans, root); |
3755 | if (ret) | |
3756 | return ret; | |
3757 | goto again; | |
3758 | } | |
9ed74f2d | 3759 | |
cab45e22 JM |
3760 | trace_btrfs_space_reservation(root->fs_info, |
3761 | "space_info:enospc", | |
3762 | data_sinfo->flags, bytes, 1); | |
6a63209f JB |
3763 | return -ENOSPC; |
3764 | } | |
3765 | data_sinfo->bytes_may_use += bytes; | |
8c2a3ca2 | 3766 | trace_btrfs_space_reservation(root->fs_info, "space_info", |
2bcc0328 | 3767 | data_sinfo->flags, bytes, 1); |
6a63209f | 3768 | spin_unlock(&data_sinfo->lock); |
6a63209f | 3769 | |
9ed74f2d | 3770 | return 0; |
9ed74f2d | 3771 | } |
6a63209f | 3772 | |
6a63209f | 3773 | /* |
fb25e914 | 3774 | * Called if we need to clear a data reservation for this inode. |
6a63209f | 3775 | */ |
0ca1f7ce | 3776 | void btrfs_free_reserved_data_space(struct inode *inode, u64 bytes) |
e3ccfa98 | 3777 | { |
0ca1f7ce | 3778 | struct btrfs_root *root = BTRFS_I(inode)->root; |
6a63209f | 3779 | struct btrfs_space_info *data_sinfo; |
e3ccfa98 | 3780 | |
6a63209f | 3781 | /* make sure bytes are sectorsize aligned */ |
fda2832f | 3782 | bytes = ALIGN(bytes, root->sectorsize); |
e3ccfa98 | 3783 | |
b4d7c3c9 | 3784 | data_sinfo = root->fs_info->data_sinfo; |
6a63209f | 3785 | spin_lock(&data_sinfo->lock); |
7ee9e440 | 3786 | WARN_ON(data_sinfo->bytes_may_use < bytes); |
6a63209f | 3787 | data_sinfo->bytes_may_use -= bytes; |
8c2a3ca2 | 3788 | trace_btrfs_space_reservation(root->fs_info, "space_info", |
2bcc0328 | 3789 | data_sinfo->flags, bytes, 0); |
6a63209f | 3790 | spin_unlock(&data_sinfo->lock); |
e3ccfa98 JB |
3791 | } |
3792 | ||
97e728d4 | 3793 | static void force_metadata_allocation(struct btrfs_fs_info *info) |
e3ccfa98 | 3794 | { |
97e728d4 JB |
3795 | struct list_head *head = &info->space_info; |
3796 | struct btrfs_space_info *found; | |
e3ccfa98 | 3797 | |
97e728d4 JB |
3798 | rcu_read_lock(); |
3799 | list_for_each_entry_rcu(found, head, list) { | |
3800 | if (found->flags & BTRFS_BLOCK_GROUP_METADATA) | |
0e4f8f88 | 3801 | found->force_alloc = CHUNK_ALLOC_FORCE; |
e3ccfa98 | 3802 | } |
97e728d4 | 3803 | rcu_read_unlock(); |
e3ccfa98 JB |
3804 | } |
3805 | ||
3c76cd84 MX |
3806 | static inline u64 calc_global_rsv_need_space(struct btrfs_block_rsv *global) |
3807 | { | |
3808 | return (global->size << 1); | |
3809 | } | |
3810 | ||
e5bc2458 | 3811 | static int should_alloc_chunk(struct btrfs_root *root, |
698d0082 | 3812 | struct btrfs_space_info *sinfo, int force) |
32c00aff | 3813 | { |
fb25e914 | 3814 | struct btrfs_block_rsv *global_rsv = &root->fs_info->global_block_rsv; |
424499db | 3815 | u64 num_bytes = sinfo->total_bytes - sinfo->bytes_readonly; |
0e4f8f88 | 3816 | u64 num_allocated = sinfo->bytes_used + sinfo->bytes_reserved; |
e5bc2458 | 3817 | u64 thresh; |
e3ccfa98 | 3818 | |
0e4f8f88 CM |
3819 | if (force == CHUNK_ALLOC_FORCE) |
3820 | return 1; | |
3821 | ||
fb25e914 JB |
3822 | /* |
3823 | * We need to take into account the global rsv because for all intents | |
3824 | * and purposes it's used space. Don't worry about locking the | |
3825 | * global_rsv, it doesn't change except when the transaction commits. | |
3826 | */ | |
54338b5c | 3827 | if (sinfo->flags & BTRFS_BLOCK_GROUP_METADATA) |
3c76cd84 | 3828 | num_allocated += calc_global_rsv_need_space(global_rsv); |
fb25e914 | 3829 | |
0e4f8f88 CM |
3830 | /* |
3831 | * in limited mode, we want to have some free space up to | |
3832 | * about 1% of the FS size. | |
3833 | */ | |
3834 | if (force == CHUNK_ALLOC_LIMITED) { | |
6c41761f | 3835 | thresh = btrfs_super_total_bytes(root->fs_info->super_copy); |
0e4f8f88 CM |
3836 | thresh = max_t(u64, 64 * 1024 * 1024, |
3837 | div_factor_fine(thresh, 1)); | |
3838 | ||
3839 | if (num_bytes - num_allocated < thresh) | |
3840 | return 1; | |
3841 | } | |
0e4f8f88 | 3842 | |
698d0082 | 3843 | if (num_allocated + 2 * 1024 * 1024 < div_factor(num_bytes, 8)) |
14ed0ca6 | 3844 | return 0; |
424499db | 3845 | return 1; |
32c00aff JB |
3846 | } |
3847 | ||
15d1ff81 LB |
3848 | static u64 get_system_chunk_thresh(struct btrfs_root *root, u64 type) |
3849 | { | |
3850 | u64 num_dev; | |
3851 | ||
53b381b3 DW |
3852 | if (type & (BTRFS_BLOCK_GROUP_RAID10 | |
3853 | BTRFS_BLOCK_GROUP_RAID0 | | |
3854 | BTRFS_BLOCK_GROUP_RAID5 | | |
3855 | BTRFS_BLOCK_GROUP_RAID6)) | |
15d1ff81 LB |
3856 | num_dev = root->fs_info->fs_devices->rw_devices; |
3857 | else if (type & BTRFS_BLOCK_GROUP_RAID1) | |
3858 | num_dev = 2; | |
3859 | else | |
3860 | num_dev = 1; /* DUP or single */ | |
3861 | ||
3862 | /* metadata for updaing devices and chunk tree */ | |
3863 | return btrfs_calc_trans_metadata_size(root, num_dev + 1); | |
3864 | } | |
3865 | ||
3866 | static void check_system_chunk(struct btrfs_trans_handle *trans, | |
3867 | struct btrfs_root *root, u64 type) | |
3868 | { | |
3869 | struct btrfs_space_info *info; | |
3870 | u64 left; | |
3871 | u64 thresh; | |
3872 | ||
3873 | info = __find_space_info(root->fs_info, BTRFS_BLOCK_GROUP_SYSTEM); | |
3874 | spin_lock(&info->lock); | |
3875 | left = info->total_bytes - info->bytes_used - info->bytes_pinned - | |
3876 | info->bytes_reserved - info->bytes_readonly; | |
3877 | spin_unlock(&info->lock); | |
3878 | ||
3879 | thresh = get_system_chunk_thresh(root, type); | |
3880 | if (left < thresh && btrfs_test_opt(root, ENOSPC_DEBUG)) { | |
c2cf52eb SK |
3881 | btrfs_info(root->fs_info, "left=%llu, need=%llu, flags=%llu", |
3882 | left, thresh, type); | |
15d1ff81 LB |
3883 | dump_space_info(info, 0, 0); |
3884 | } | |
3885 | ||
3886 | if (left < thresh) { | |
3887 | u64 flags; | |
3888 | ||
3889 | flags = btrfs_get_alloc_profile(root->fs_info->chunk_root, 0); | |
3890 | btrfs_alloc_chunk(trans, root, flags); | |
3891 | } | |
3892 | } | |
3893 | ||
6324fbf3 | 3894 | static int do_chunk_alloc(struct btrfs_trans_handle *trans, |
698d0082 | 3895 | struct btrfs_root *extent_root, u64 flags, int force) |
9ed74f2d | 3896 | { |
6324fbf3 | 3897 | struct btrfs_space_info *space_info; |
97e728d4 | 3898 | struct btrfs_fs_info *fs_info = extent_root->fs_info; |
6d74119f | 3899 | int wait_for_alloc = 0; |
9ed74f2d | 3900 | int ret = 0; |
9ed74f2d | 3901 | |
c6b305a8 JB |
3902 | /* Don't re-enter if we're already allocating a chunk */ |
3903 | if (trans->allocating_chunk) | |
3904 | return -ENOSPC; | |
3905 | ||
6324fbf3 | 3906 | space_info = __find_space_info(extent_root->fs_info, flags); |
593060d7 CM |
3907 | if (!space_info) { |
3908 | ret = update_space_info(extent_root->fs_info, flags, | |
3909 | 0, 0, &space_info); | |
79787eaa | 3910 | BUG_ON(ret); /* -ENOMEM */ |
9ed74f2d | 3911 | } |
79787eaa | 3912 | BUG_ON(!space_info); /* Logic error */ |
9ed74f2d | 3913 | |
6d74119f | 3914 | again: |
25179201 | 3915 | spin_lock(&space_info->lock); |
9e622d6b | 3916 | if (force < space_info->force_alloc) |
0e4f8f88 | 3917 | force = space_info->force_alloc; |
25179201 | 3918 | if (space_info->full) { |
09fb99a6 FDBM |
3919 | if (should_alloc_chunk(extent_root, space_info, force)) |
3920 | ret = -ENOSPC; | |
3921 | else | |
3922 | ret = 0; | |
25179201 | 3923 | spin_unlock(&space_info->lock); |
09fb99a6 | 3924 | return ret; |
9ed74f2d JB |
3925 | } |
3926 | ||
698d0082 | 3927 | if (!should_alloc_chunk(extent_root, space_info, force)) { |
25179201 | 3928 | spin_unlock(&space_info->lock); |
6d74119f JB |
3929 | return 0; |
3930 | } else if (space_info->chunk_alloc) { | |
3931 | wait_for_alloc = 1; | |
3932 | } else { | |
3933 | space_info->chunk_alloc = 1; | |
9ed74f2d | 3934 | } |
0e4f8f88 | 3935 | |
25179201 | 3936 | spin_unlock(&space_info->lock); |
9ed74f2d | 3937 | |
6d74119f JB |
3938 | mutex_lock(&fs_info->chunk_mutex); |
3939 | ||
3940 | /* | |
3941 | * The chunk_mutex is held throughout the entirety of a chunk | |
3942 | * allocation, so once we've acquired the chunk_mutex we know that the | |
3943 | * other guy is done and we need to recheck and see if we should | |
3944 | * allocate. | |
3945 | */ | |
3946 | if (wait_for_alloc) { | |
3947 | mutex_unlock(&fs_info->chunk_mutex); | |
3948 | wait_for_alloc = 0; | |
3949 | goto again; | |
3950 | } | |
3951 | ||
c6b305a8 JB |
3952 | trans->allocating_chunk = true; |
3953 | ||
67377734 JB |
3954 | /* |
3955 | * If we have mixed data/metadata chunks we want to make sure we keep | |
3956 | * allocating mixed chunks instead of individual chunks. | |
3957 | */ | |
3958 | if (btrfs_mixed_space_info(space_info)) | |
3959 | flags |= (BTRFS_BLOCK_GROUP_DATA | BTRFS_BLOCK_GROUP_METADATA); | |
3960 | ||
97e728d4 JB |
3961 | /* |
3962 | * if we're doing a data chunk, go ahead and make sure that | |
3963 | * we keep a reasonable number of metadata chunks allocated in the | |
3964 | * FS as well. | |
3965 | */ | |
9ed74f2d | 3966 | if (flags & BTRFS_BLOCK_GROUP_DATA && fs_info->metadata_ratio) { |
97e728d4 JB |
3967 | fs_info->data_chunk_allocations++; |
3968 | if (!(fs_info->data_chunk_allocations % | |
3969 | fs_info->metadata_ratio)) | |
3970 | force_metadata_allocation(fs_info); | |
9ed74f2d JB |
3971 | } |
3972 | ||
15d1ff81 LB |
3973 | /* |
3974 | * Check if we have enough space in SYSTEM chunk because we may need | |
3975 | * to update devices. | |
3976 | */ | |
3977 | check_system_chunk(trans, extent_root, flags); | |
3978 | ||
2b82032c | 3979 | ret = btrfs_alloc_chunk(trans, extent_root, flags); |
c6b305a8 | 3980 | trans->allocating_chunk = false; |
92b8e897 | 3981 | |
9ed74f2d | 3982 | spin_lock(&space_info->lock); |
a81cb9a2 AO |
3983 | if (ret < 0 && ret != -ENOSPC) |
3984 | goto out; | |
9ed74f2d | 3985 | if (ret) |
6324fbf3 | 3986 | space_info->full = 1; |
424499db YZ |
3987 | else |
3988 | ret = 1; | |
6d74119f | 3989 | |
0e4f8f88 | 3990 | space_info->force_alloc = CHUNK_ALLOC_NO_FORCE; |
a81cb9a2 | 3991 | out: |
6d74119f | 3992 | space_info->chunk_alloc = 0; |
9ed74f2d | 3993 | spin_unlock(&space_info->lock); |
a25c75d5 | 3994 | mutex_unlock(&fs_info->chunk_mutex); |
0f9dd46c | 3995 | return ret; |
6324fbf3 | 3996 | } |
9ed74f2d | 3997 | |
a80c8dcf JB |
3998 | static int can_overcommit(struct btrfs_root *root, |
3999 | struct btrfs_space_info *space_info, u64 bytes, | |
08e007d2 | 4000 | enum btrfs_reserve_flush_enum flush) |
a80c8dcf | 4001 | { |
96f1bb57 | 4002 | struct btrfs_block_rsv *global_rsv = &root->fs_info->global_block_rsv; |
a80c8dcf | 4003 | u64 profile = btrfs_get_alloc_profile(root, 0); |
3c76cd84 | 4004 | u64 space_size; |
a80c8dcf JB |
4005 | u64 avail; |
4006 | u64 used; | |
4007 | ||
4008 | used = space_info->bytes_used + space_info->bytes_reserved + | |
96f1bb57 JB |
4009 | space_info->bytes_pinned + space_info->bytes_readonly; |
4010 | ||
96f1bb57 JB |
4011 | /* |
4012 | * We only want to allow over committing if we have lots of actual space | |
4013 | * free, but if we don't have enough space to handle the global reserve | |
4014 | * space then we could end up having a real enospc problem when trying | |
4015 | * to allocate a chunk or some other such important allocation. | |
4016 | */ | |
3c76cd84 MX |
4017 | spin_lock(&global_rsv->lock); |
4018 | space_size = calc_global_rsv_need_space(global_rsv); | |
4019 | spin_unlock(&global_rsv->lock); | |
4020 | if (used + space_size >= space_info->total_bytes) | |
96f1bb57 JB |
4021 | return 0; |
4022 | ||
4023 | used += space_info->bytes_may_use; | |
a80c8dcf JB |
4024 | |
4025 | spin_lock(&root->fs_info->free_chunk_lock); | |
4026 | avail = root->fs_info->free_chunk_space; | |
4027 | spin_unlock(&root->fs_info->free_chunk_lock); | |
4028 | ||
4029 | /* | |
4030 | * If we have dup, raid1 or raid10 then only half of the free | |
53b381b3 DW |
4031 | * space is actually useable. For raid56, the space info used |
4032 | * doesn't include the parity drive, so we don't have to | |
4033 | * change the math | |
a80c8dcf JB |
4034 | */ |
4035 | if (profile & (BTRFS_BLOCK_GROUP_DUP | | |
4036 | BTRFS_BLOCK_GROUP_RAID1 | | |
4037 | BTRFS_BLOCK_GROUP_RAID10)) | |
4038 | avail >>= 1; | |
4039 | ||
4040 | /* | |
561c294d MX |
4041 | * If we aren't flushing all things, let us overcommit up to |
4042 | * 1/2th of the space. If we can flush, don't let us overcommit | |
4043 | * too much, let it overcommit up to 1/8 of the space. | |
a80c8dcf | 4044 | */ |
08e007d2 | 4045 | if (flush == BTRFS_RESERVE_FLUSH_ALL) |
14575aef | 4046 | avail >>= 3; |
a80c8dcf | 4047 | else |
14575aef | 4048 | avail >>= 1; |
a80c8dcf | 4049 | |
14575aef | 4050 | if (used + bytes < space_info->total_bytes + avail) |
a80c8dcf JB |
4051 | return 1; |
4052 | return 0; | |
4053 | } | |
4054 | ||
48a3b636 | 4055 | static void btrfs_writeback_inodes_sb_nr(struct btrfs_root *root, |
6c255e67 | 4056 | unsigned long nr_pages, int nr_items) |
da633a42 MX |
4057 | { |
4058 | struct super_block *sb = root->fs_info->sb; | |
da633a42 | 4059 | |
925a6efb JB |
4060 | if (down_read_trylock(&sb->s_umount)) { |
4061 | writeback_inodes_sb_nr(sb, nr_pages, WB_REASON_FS_FREE_SPACE); | |
4062 | up_read(&sb->s_umount); | |
4063 | } else { | |
da633a42 MX |
4064 | /* |
4065 | * We needn't worry the filesystem going from r/w to r/o though | |
4066 | * we don't acquire ->s_umount mutex, because the filesystem | |
4067 | * should guarantee the delalloc inodes list be empty after | |
4068 | * the filesystem is readonly(all dirty pages are written to | |
4069 | * the disk). | |
4070 | */ | |
6c255e67 | 4071 | btrfs_start_delalloc_roots(root->fs_info, 0, nr_items); |
98ad69cf | 4072 | if (!current->journal_info) |
6c255e67 | 4073 | btrfs_wait_ordered_roots(root->fs_info, nr_items); |
da633a42 MX |
4074 | } |
4075 | } | |
4076 | ||
18cd8ea6 MX |
4077 | static inline int calc_reclaim_items_nr(struct btrfs_root *root, u64 to_reclaim) |
4078 | { | |
4079 | u64 bytes; | |
4080 | int nr; | |
4081 | ||
4082 | bytes = btrfs_calc_trans_metadata_size(root, 1); | |
4083 | nr = (int)div64_u64(to_reclaim, bytes); | |
4084 | if (!nr) | |
4085 | nr = 1; | |
4086 | return nr; | |
4087 | } | |
4088 | ||
c61a16a7 MX |
4089 | #define EXTENT_SIZE_PER_ITEM (256 * 1024) |
4090 | ||
9ed74f2d | 4091 | /* |
5da9d01b | 4092 | * shrink metadata reservation for delalloc |
9ed74f2d | 4093 | */ |
f4c738c2 JB |
4094 | static void shrink_delalloc(struct btrfs_root *root, u64 to_reclaim, u64 orig, |
4095 | bool wait_ordered) | |
5da9d01b | 4096 | { |
0ca1f7ce | 4097 | struct btrfs_block_rsv *block_rsv; |
0019f10d | 4098 | struct btrfs_space_info *space_info; |
663350ac | 4099 | struct btrfs_trans_handle *trans; |
f4c738c2 | 4100 | u64 delalloc_bytes; |
5da9d01b | 4101 | u64 max_reclaim; |
b1953bce | 4102 | long time_left; |
d3ee29e3 MX |
4103 | unsigned long nr_pages; |
4104 | int loops; | |
b0244199 | 4105 | int items; |
08e007d2 | 4106 | enum btrfs_reserve_flush_enum flush; |
5da9d01b | 4107 | |
c61a16a7 | 4108 | /* Calc the number of the pages we need flush for space reservation */ |
b0244199 MX |
4109 | items = calc_reclaim_items_nr(root, to_reclaim); |
4110 | to_reclaim = items * EXTENT_SIZE_PER_ITEM; | |
c61a16a7 | 4111 | |
663350ac | 4112 | trans = (struct btrfs_trans_handle *)current->journal_info; |
0ca1f7ce | 4113 | block_rsv = &root->fs_info->delalloc_block_rsv; |
0019f10d | 4114 | space_info = block_rsv->space_info; |
bf9022e0 | 4115 | |
963d678b MX |
4116 | delalloc_bytes = percpu_counter_sum_positive( |
4117 | &root->fs_info->delalloc_bytes); | |
f4c738c2 | 4118 | if (delalloc_bytes == 0) { |
fdb5effd | 4119 | if (trans) |
f4c738c2 | 4120 | return; |
38c135af | 4121 | if (wait_ordered) |
b0244199 | 4122 | btrfs_wait_ordered_roots(root->fs_info, items); |
f4c738c2 | 4123 | return; |
fdb5effd JB |
4124 | } |
4125 | ||
d3ee29e3 | 4126 | loops = 0; |
f4c738c2 JB |
4127 | while (delalloc_bytes && loops < 3) { |
4128 | max_reclaim = min(delalloc_bytes, to_reclaim); | |
4129 | nr_pages = max_reclaim >> PAGE_CACHE_SHIFT; | |
6c255e67 | 4130 | btrfs_writeback_inodes_sb_nr(root, nr_pages, items); |
dea31f52 JB |
4131 | /* |
4132 | * We need to wait for the async pages to actually start before | |
4133 | * we do anything. | |
4134 | */ | |
9f3a074d MX |
4135 | max_reclaim = atomic_read(&root->fs_info->async_delalloc_pages); |
4136 | if (!max_reclaim) | |
4137 | goto skip_async; | |
4138 | ||
4139 | if (max_reclaim <= nr_pages) | |
4140 | max_reclaim = 0; | |
4141 | else | |
4142 | max_reclaim -= nr_pages; | |
dea31f52 | 4143 | |
9f3a074d MX |
4144 | wait_event(root->fs_info->async_submit_wait, |
4145 | atomic_read(&root->fs_info->async_delalloc_pages) <= | |
4146 | (int)max_reclaim); | |
4147 | skip_async: | |
08e007d2 MX |
4148 | if (!trans) |
4149 | flush = BTRFS_RESERVE_FLUSH_ALL; | |
4150 | else | |
4151 | flush = BTRFS_RESERVE_NO_FLUSH; | |
0019f10d | 4152 | spin_lock(&space_info->lock); |
08e007d2 | 4153 | if (can_overcommit(root, space_info, orig, flush)) { |
f4c738c2 JB |
4154 | spin_unlock(&space_info->lock); |
4155 | break; | |
4156 | } | |
0019f10d | 4157 | spin_unlock(&space_info->lock); |
5da9d01b | 4158 | |
36e39c40 | 4159 | loops++; |
f104d044 | 4160 | if (wait_ordered && !trans) { |
b0244199 | 4161 | btrfs_wait_ordered_roots(root->fs_info, items); |
f104d044 | 4162 | } else { |
f4c738c2 | 4163 | time_left = schedule_timeout_killable(1); |
f104d044 JB |
4164 | if (time_left) |
4165 | break; | |
4166 | } | |
963d678b MX |
4167 | delalloc_bytes = percpu_counter_sum_positive( |
4168 | &root->fs_info->delalloc_bytes); | |
5da9d01b | 4169 | } |
5da9d01b YZ |
4170 | } |
4171 | ||
663350ac JB |
4172 | /** |
4173 | * maybe_commit_transaction - possibly commit the transaction if its ok to | |
4174 | * @root - the root we're allocating for | |
4175 | * @bytes - the number of bytes we want to reserve | |
4176 | * @force - force the commit | |
8bb8ab2e | 4177 | * |
663350ac JB |
4178 | * This will check to make sure that committing the transaction will actually |
4179 | * get us somewhere and then commit the transaction if it does. Otherwise it | |
4180 | * will return -ENOSPC. | |
8bb8ab2e | 4181 | */ |
663350ac JB |
4182 | static int may_commit_transaction(struct btrfs_root *root, |
4183 | struct btrfs_space_info *space_info, | |
4184 | u64 bytes, int force) | |
4185 | { | |
4186 | struct btrfs_block_rsv *delayed_rsv = &root->fs_info->delayed_block_rsv; | |
4187 | struct btrfs_trans_handle *trans; | |
4188 | ||
4189 | trans = (struct btrfs_trans_handle *)current->journal_info; | |
4190 | if (trans) | |
4191 | return -EAGAIN; | |
4192 | ||
4193 | if (force) | |
4194 | goto commit; | |
4195 | ||
4196 | /* See if there is enough pinned space to make this reservation */ | |
b150a4f1 | 4197 | if (percpu_counter_compare(&space_info->total_bytes_pinned, |
0424c548 | 4198 | bytes) >= 0) |
663350ac | 4199 | goto commit; |
663350ac JB |
4200 | |
4201 | /* | |
4202 | * See if there is some space in the delayed insertion reservation for | |
4203 | * this reservation. | |
4204 | */ | |
4205 | if (space_info != delayed_rsv->space_info) | |
4206 | return -ENOSPC; | |
4207 | ||
4208 | spin_lock(&delayed_rsv->lock); | |
b150a4f1 JB |
4209 | if (percpu_counter_compare(&space_info->total_bytes_pinned, |
4210 | bytes - delayed_rsv->size) >= 0) { | |
663350ac JB |
4211 | spin_unlock(&delayed_rsv->lock); |
4212 | return -ENOSPC; | |
4213 | } | |
4214 | spin_unlock(&delayed_rsv->lock); | |
4215 | ||
4216 | commit: | |
4217 | trans = btrfs_join_transaction(root); | |
4218 | if (IS_ERR(trans)) | |
4219 | return -ENOSPC; | |
4220 | ||
4221 | return btrfs_commit_transaction(trans, root); | |
4222 | } | |
4223 | ||
96c3f433 | 4224 | enum flush_state { |
67b0fd63 JB |
4225 | FLUSH_DELAYED_ITEMS_NR = 1, |
4226 | FLUSH_DELAYED_ITEMS = 2, | |
4227 | FLUSH_DELALLOC = 3, | |
4228 | FLUSH_DELALLOC_WAIT = 4, | |
ea658bad JB |
4229 | ALLOC_CHUNK = 5, |
4230 | COMMIT_TRANS = 6, | |
96c3f433 JB |
4231 | }; |
4232 | ||
4233 | static int flush_space(struct btrfs_root *root, | |
4234 | struct btrfs_space_info *space_info, u64 num_bytes, | |
4235 | u64 orig_bytes, int state) | |
4236 | { | |
4237 | struct btrfs_trans_handle *trans; | |
4238 | int nr; | |
f4c738c2 | 4239 | int ret = 0; |
96c3f433 JB |
4240 | |
4241 | switch (state) { | |
96c3f433 JB |
4242 | case FLUSH_DELAYED_ITEMS_NR: |
4243 | case FLUSH_DELAYED_ITEMS: | |
18cd8ea6 MX |
4244 | if (state == FLUSH_DELAYED_ITEMS_NR) |
4245 | nr = calc_reclaim_items_nr(root, num_bytes) * 2; | |
4246 | else | |
96c3f433 | 4247 | nr = -1; |
18cd8ea6 | 4248 | |
96c3f433 JB |
4249 | trans = btrfs_join_transaction(root); |
4250 | if (IS_ERR(trans)) { | |
4251 | ret = PTR_ERR(trans); | |
4252 | break; | |
4253 | } | |
4254 | ret = btrfs_run_delayed_items_nr(trans, root, nr); | |
4255 | btrfs_end_transaction(trans, root); | |
4256 | break; | |
67b0fd63 JB |
4257 | case FLUSH_DELALLOC: |
4258 | case FLUSH_DELALLOC_WAIT: | |
24af7dd1 | 4259 | shrink_delalloc(root, num_bytes * 2, orig_bytes, |
67b0fd63 JB |
4260 | state == FLUSH_DELALLOC_WAIT); |
4261 | break; | |
ea658bad JB |
4262 | case ALLOC_CHUNK: |
4263 | trans = btrfs_join_transaction(root); | |
4264 | if (IS_ERR(trans)) { | |
4265 | ret = PTR_ERR(trans); | |
4266 | break; | |
4267 | } | |
4268 | ret = do_chunk_alloc(trans, root->fs_info->extent_root, | |
ea658bad JB |
4269 | btrfs_get_alloc_profile(root, 0), |
4270 | CHUNK_ALLOC_NO_FORCE); | |
4271 | btrfs_end_transaction(trans, root); | |
4272 | if (ret == -ENOSPC) | |
4273 | ret = 0; | |
4274 | break; | |
96c3f433 JB |
4275 | case COMMIT_TRANS: |
4276 | ret = may_commit_transaction(root, space_info, orig_bytes, 0); | |
4277 | break; | |
4278 | default: | |
4279 | ret = -ENOSPC; | |
4280 | break; | |
4281 | } | |
4282 | ||
4283 | return ret; | |
4284 | } | |
21c7e756 MX |
4285 | |
4286 | static inline u64 | |
4287 | btrfs_calc_reclaim_metadata_size(struct btrfs_root *root, | |
4288 | struct btrfs_space_info *space_info) | |
4289 | { | |
4290 | u64 used; | |
4291 | u64 expected; | |
4292 | u64 to_reclaim; | |
4293 | ||
4294 | to_reclaim = min_t(u64, num_online_cpus() * 1024 * 1024, | |
4295 | 16 * 1024 * 1024); | |
4296 | spin_lock(&space_info->lock); | |
4297 | if (can_overcommit(root, space_info, to_reclaim, | |
4298 | BTRFS_RESERVE_FLUSH_ALL)) { | |
4299 | to_reclaim = 0; | |
4300 | goto out; | |
4301 | } | |
4302 | ||
4303 | used = space_info->bytes_used + space_info->bytes_reserved + | |
4304 | space_info->bytes_pinned + space_info->bytes_readonly + | |
4305 | space_info->bytes_may_use; | |
4306 | if (can_overcommit(root, space_info, 1024 * 1024, | |
4307 | BTRFS_RESERVE_FLUSH_ALL)) | |
4308 | expected = div_factor_fine(space_info->total_bytes, 95); | |
4309 | else | |
4310 | expected = div_factor_fine(space_info->total_bytes, 90); | |
4311 | ||
4312 | if (used > expected) | |
4313 | to_reclaim = used - expected; | |
4314 | else | |
4315 | to_reclaim = 0; | |
4316 | to_reclaim = min(to_reclaim, space_info->bytes_may_use + | |
4317 | space_info->bytes_reserved); | |
4318 | out: | |
4319 | spin_unlock(&space_info->lock); | |
4320 | ||
4321 | return to_reclaim; | |
4322 | } | |
4323 | ||
4324 | static inline int need_do_async_reclaim(struct btrfs_space_info *space_info, | |
4325 | struct btrfs_fs_info *fs_info, u64 used) | |
4326 | { | |
4327 | return (used >= div_factor_fine(space_info->total_bytes, 98) && | |
4328 | !btrfs_fs_closing(fs_info) && | |
4329 | !test_bit(BTRFS_FS_STATE_REMOUNTING, &fs_info->fs_state)); | |
4330 | } | |
4331 | ||
4332 | static int btrfs_need_do_async_reclaim(struct btrfs_space_info *space_info, | |
25ce459c LB |
4333 | struct btrfs_fs_info *fs_info, |
4334 | int flush_state) | |
21c7e756 MX |
4335 | { |
4336 | u64 used; | |
4337 | ||
4338 | spin_lock(&space_info->lock); | |
25ce459c LB |
4339 | /* |
4340 | * We run out of space and have not got any free space via flush_space, | |
4341 | * so don't bother doing async reclaim. | |
4342 | */ | |
4343 | if (flush_state > COMMIT_TRANS && space_info->full) { | |
4344 | spin_unlock(&space_info->lock); | |
4345 | return 0; | |
4346 | } | |
4347 | ||
21c7e756 MX |
4348 | used = space_info->bytes_used + space_info->bytes_reserved + |
4349 | space_info->bytes_pinned + space_info->bytes_readonly + | |
4350 | space_info->bytes_may_use; | |
4351 | if (need_do_async_reclaim(space_info, fs_info, used)) { | |
4352 | spin_unlock(&space_info->lock); | |
4353 | return 1; | |
4354 | } | |
4355 | spin_unlock(&space_info->lock); | |
4356 | ||
4357 | return 0; | |
4358 | } | |
4359 | ||
4360 | static void btrfs_async_reclaim_metadata_space(struct work_struct *work) | |
4361 | { | |
4362 | struct btrfs_fs_info *fs_info; | |
4363 | struct btrfs_space_info *space_info; | |
4364 | u64 to_reclaim; | |
4365 | int flush_state; | |
4366 | ||
4367 | fs_info = container_of(work, struct btrfs_fs_info, async_reclaim_work); | |
4368 | space_info = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_METADATA); | |
4369 | ||
4370 | to_reclaim = btrfs_calc_reclaim_metadata_size(fs_info->fs_root, | |
4371 | space_info); | |
4372 | if (!to_reclaim) | |
4373 | return; | |
4374 | ||
4375 | flush_state = FLUSH_DELAYED_ITEMS_NR; | |
4376 | do { | |
4377 | flush_space(fs_info->fs_root, space_info, to_reclaim, | |
4378 | to_reclaim, flush_state); | |
4379 | flush_state++; | |
25ce459c LB |
4380 | if (!btrfs_need_do_async_reclaim(space_info, fs_info, |
4381 | flush_state)) | |
21c7e756 MX |
4382 | return; |
4383 | } while (flush_state <= COMMIT_TRANS); | |
4384 | ||
25ce459c | 4385 | if (btrfs_need_do_async_reclaim(space_info, fs_info, flush_state)) |
21c7e756 MX |
4386 | queue_work(system_unbound_wq, work); |
4387 | } | |
4388 | ||
4389 | void btrfs_init_async_reclaim_work(struct work_struct *work) | |
4390 | { | |
4391 | INIT_WORK(work, btrfs_async_reclaim_metadata_space); | |
4392 | } | |
4393 | ||
4a92b1b8 JB |
4394 | /** |
4395 | * reserve_metadata_bytes - try to reserve bytes from the block_rsv's space | |
4396 | * @root - the root we're allocating for | |
4397 | * @block_rsv - the block_rsv we're allocating for | |
4398 | * @orig_bytes - the number of bytes we want | |
48fc7f7e | 4399 | * @flush - whether or not we can flush to make our reservation |
8bb8ab2e | 4400 | * |
4a92b1b8 JB |
4401 | * This will reserve orgi_bytes number of bytes from the space info associated |
4402 | * with the block_rsv. If there is not enough space it will make an attempt to | |
4403 | * flush out space to make room. It will do this by flushing delalloc if | |
4404 | * possible or committing the transaction. If flush is 0 then no attempts to | |
4405 | * regain reservations will be made and this will fail if there is not enough | |
4406 | * space already. | |
8bb8ab2e | 4407 | */ |
4a92b1b8 | 4408 | static int reserve_metadata_bytes(struct btrfs_root *root, |
8bb8ab2e | 4409 | struct btrfs_block_rsv *block_rsv, |
08e007d2 MX |
4410 | u64 orig_bytes, |
4411 | enum btrfs_reserve_flush_enum flush) | |
9ed74f2d | 4412 | { |
f0486c68 | 4413 | struct btrfs_space_info *space_info = block_rsv->space_info; |
2bf64758 | 4414 | u64 used; |
8bb8ab2e | 4415 | u64 num_bytes = orig_bytes; |
67b0fd63 | 4416 | int flush_state = FLUSH_DELAYED_ITEMS_NR; |
8bb8ab2e | 4417 | int ret = 0; |
fdb5effd | 4418 | bool flushing = false; |
9ed74f2d | 4419 | |
8bb8ab2e | 4420 | again: |
fdb5effd | 4421 | ret = 0; |
8bb8ab2e | 4422 | spin_lock(&space_info->lock); |
fdb5effd | 4423 | /* |
08e007d2 MX |
4424 | * We only want to wait if somebody other than us is flushing and we |
4425 | * are actually allowed to flush all things. | |
fdb5effd | 4426 | */ |
08e007d2 MX |
4427 | while (flush == BTRFS_RESERVE_FLUSH_ALL && !flushing && |
4428 | space_info->flush) { | |
fdb5effd JB |
4429 | spin_unlock(&space_info->lock); |
4430 | /* | |
4431 | * If we have a trans handle we can't wait because the flusher | |
4432 | * may have to commit the transaction, which would mean we would | |
4433 | * deadlock since we are waiting for the flusher to finish, but | |
4434 | * hold the current transaction open. | |
4435 | */ | |
663350ac | 4436 | if (current->journal_info) |
fdb5effd | 4437 | return -EAGAIN; |
b9688bb8 AJ |
4438 | ret = wait_event_killable(space_info->wait, !space_info->flush); |
4439 | /* Must have been killed, return */ | |
4440 | if (ret) | |
fdb5effd JB |
4441 | return -EINTR; |
4442 | ||
4443 | spin_lock(&space_info->lock); | |
4444 | } | |
4445 | ||
4446 | ret = -ENOSPC; | |
2bf64758 JB |
4447 | used = space_info->bytes_used + space_info->bytes_reserved + |
4448 | space_info->bytes_pinned + space_info->bytes_readonly + | |
4449 | space_info->bytes_may_use; | |
9ed74f2d | 4450 | |
8bb8ab2e JB |
4451 | /* |
4452 | * The idea here is that we've not already over-reserved the block group | |
4453 | * then we can go ahead and save our reservation first and then start | |
4454 | * flushing if we need to. Otherwise if we've already overcommitted | |
4455 | * lets start flushing stuff first and then come back and try to make | |
4456 | * our reservation. | |
4457 | */ | |
2bf64758 JB |
4458 | if (used <= space_info->total_bytes) { |
4459 | if (used + orig_bytes <= space_info->total_bytes) { | |
fb25e914 | 4460 | space_info->bytes_may_use += orig_bytes; |
8c2a3ca2 | 4461 | trace_btrfs_space_reservation(root->fs_info, |
2bcc0328 | 4462 | "space_info", space_info->flags, orig_bytes, 1); |
8bb8ab2e JB |
4463 | ret = 0; |
4464 | } else { | |
4465 | /* | |
4466 | * Ok set num_bytes to orig_bytes since we aren't | |
4467 | * overocmmitted, this way we only try and reclaim what | |
4468 | * we need. | |
4469 | */ | |
4470 | num_bytes = orig_bytes; | |
4471 | } | |
4472 | } else { | |
4473 | /* | |
4474 | * Ok we're over committed, set num_bytes to the overcommitted | |
4475 | * amount plus the amount of bytes that we need for this | |
4476 | * reservation. | |
4477 | */ | |
2bf64758 | 4478 | num_bytes = used - space_info->total_bytes + |
96c3f433 | 4479 | (orig_bytes * 2); |
8bb8ab2e | 4480 | } |
9ed74f2d | 4481 | |
44734ed1 JB |
4482 | if (ret && can_overcommit(root, space_info, orig_bytes, flush)) { |
4483 | space_info->bytes_may_use += orig_bytes; | |
4484 | trace_btrfs_space_reservation(root->fs_info, "space_info", | |
4485 | space_info->flags, orig_bytes, | |
4486 | 1); | |
4487 | ret = 0; | |
2bf64758 JB |
4488 | } |
4489 | ||
8bb8ab2e JB |
4490 | /* |
4491 | * Couldn't make our reservation, save our place so while we're trying | |
4492 | * to reclaim space we can actually use it instead of somebody else | |
4493 | * stealing it from us. | |
08e007d2 MX |
4494 | * |
4495 | * We make the other tasks wait for the flush only when we can flush | |
4496 | * all things. | |
8bb8ab2e | 4497 | */ |
72bcd99d | 4498 | if (ret && flush != BTRFS_RESERVE_NO_FLUSH) { |
fdb5effd JB |
4499 | flushing = true; |
4500 | space_info->flush = 1; | |
21c7e756 MX |
4501 | } else if (!ret && space_info->flags & BTRFS_BLOCK_GROUP_METADATA) { |
4502 | used += orig_bytes; | |
f6acfd50 JB |
4503 | /* |
4504 | * We will do the space reservation dance during log replay, | |
4505 | * which means we won't have fs_info->fs_root set, so don't do | |
4506 | * the async reclaim as we will panic. | |
4507 | */ | |
4508 | if (!root->fs_info->log_root_recovering && | |
4509 | need_do_async_reclaim(space_info, root->fs_info, used) && | |
21c7e756 MX |
4510 | !work_busy(&root->fs_info->async_reclaim_work)) |
4511 | queue_work(system_unbound_wq, | |
4512 | &root->fs_info->async_reclaim_work); | |
8bb8ab2e | 4513 | } |
f0486c68 | 4514 | spin_unlock(&space_info->lock); |
9ed74f2d | 4515 | |
08e007d2 | 4516 | if (!ret || flush == BTRFS_RESERVE_NO_FLUSH) |
8bb8ab2e | 4517 | goto out; |
f0486c68 | 4518 | |
96c3f433 JB |
4519 | ret = flush_space(root, space_info, num_bytes, orig_bytes, |
4520 | flush_state); | |
4521 | flush_state++; | |
08e007d2 MX |
4522 | |
4523 | /* | |
4524 | * If we are FLUSH_LIMIT, we can not flush delalloc, or the deadlock | |
4525 | * would happen. So skip delalloc flush. | |
4526 | */ | |
4527 | if (flush == BTRFS_RESERVE_FLUSH_LIMIT && | |
4528 | (flush_state == FLUSH_DELALLOC || | |
4529 | flush_state == FLUSH_DELALLOC_WAIT)) | |
4530 | flush_state = ALLOC_CHUNK; | |
4531 | ||
96c3f433 | 4532 | if (!ret) |
8bb8ab2e | 4533 | goto again; |
08e007d2 MX |
4534 | else if (flush == BTRFS_RESERVE_FLUSH_LIMIT && |
4535 | flush_state < COMMIT_TRANS) | |
4536 | goto again; | |
4537 | else if (flush == BTRFS_RESERVE_FLUSH_ALL && | |
4538 | flush_state <= COMMIT_TRANS) | |
8bb8ab2e JB |
4539 | goto again; |
4540 | ||
4541 | out: | |
5d80366e JB |
4542 | if (ret == -ENOSPC && |
4543 | unlikely(root->orphan_cleanup_state == ORPHAN_CLEANUP_STARTED)) { | |
4544 | struct btrfs_block_rsv *global_rsv = | |
4545 | &root->fs_info->global_block_rsv; | |
4546 | ||
4547 | if (block_rsv != global_rsv && | |
4548 | !block_rsv_use_bytes(global_rsv, orig_bytes)) | |
4549 | ret = 0; | |
4550 | } | |
cab45e22 JM |
4551 | if (ret == -ENOSPC) |
4552 | trace_btrfs_space_reservation(root->fs_info, | |
4553 | "space_info:enospc", | |
4554 | space_info->flags, orig_bytes, 1); | |
fdb5effd | 4555 | if (flushing) { |
8bb8ab2e | 4556 | spin_lock(&space_info->lock); |
fdb5effd JB |
4557 | space_info->flush = 0; |
4558 | wake_up_all(&space_info->wait); | |
8bb8ab2e | 4559 | spin_unlock(&space_info->lock); |
f0486c68 | 4560 | } |
f0486c68 YZ |
4561 | return ret; |
4562 | } | |
4563 | ||
79787eaa JM |
4564 | static struct btrfs_block_rsv *get_block_rsv( |
4565 | const struct btrfs_trans_handle *trans, | |
4566 | const struct btrfs_root *root) | |
f0486c68 | 4567 | { |
4c13d758 JB |
4568 | struct btrfs_block_rsv *block_rsv = NULL; |
4569 | ||
27cdeb70 | 4570 | if (test_bit(BTRFS_ROOT_REF_COWS, &root->state)) |
0e721106 JB |
4571 | block_rsv = trans->block_rsv; |
4572 | ||
4573 | if (root == root->fs_info->csum_root && trans->adding_csums) | |
f0486c68 | 4574 | block_rsv = trans->block_rsv; |
4c13d758 | 4575 | |
f7a81ea4 SB |
4576 | if (root == root->fs_info->uuid_root) |
4577 | block_rsv = trans->block_rsv; | |
4578 | ||
4c13d758 | 4579 | if (!block_rsv) |
f0486c68 YZ |
4580 | block_rsv = root->block_rsv; |
4581 | ||
4582 | if (!block_rsv) | |
4583 | block_rsv = &root->fs_info->empty_block_rsv; | |
4584 | ||
4585 | return block_rsv; | |
4586 | } | |
4587 | ||
4588 | static int block_rsv_use_bytes(struct btrfs_block_rsv *block_rsv, | |
4589 | u64 num_bytes) | |
4590 | { | |
4591 | int ret = -ENOSPC; | |
4592 | spin_lock(&block_rsv->lock); | |
4593 | if (block_rsv->reserved >= num_bytes) { | |
4594 | block_rsv->reserved -= num_bytes; | |
4595 | if (block_rsv->reserved < block_rsv->size) | |
4596 | block_rsv->full = 0; | |
4597 | ret = 0; | |
4598 | } | |
4599 | spin_unlock(&block_rsv->lock); | |
4600 | return ret; | |
4601 | } | |
4602 | ||
4603 | static void block_rsv_add_bytes(struct btrfs_block_rsv *block_rsv, | |
4604 | u64 num_bytes, int update_size) | |
4605 | { | |
4606 | spin_lock(&block_rsv->lock); | |
4607 | block_rsv->reserved += num_bytes; | |
4608 | if (update_size) | |
4609 | block_rsv->size += num_bytes; | |
4610 | else if (block_rsv->reserved >= block_rsv->size) | |
4611 | block_rsv->full = 1; | |
4612 | spin_unlock(&block_rsv->lock); | |
4613 | } | |
4614 | ||
d52be818 JB |
4615 | int btrfs_cond_migrate_bytes(struct btrfs_fs_info *fs_info, |
4616 | struct btrfs_block_rsv *dest, u64 num_bytes, | |
4617 | int min_factor) | |
4618 | { | |
4619 | struct btrfs_block_rsv *global_rsv = &fs_info->global_block_rsv; | |
4620 | u64 min_bytes; | |
4621 | ||
4622 | if (global_rsv->space_info != dest->space_info) | |
4623 | return -ENOSPC; | |
4624 | ||
4625 | spin_lock(&global_rsv->lock); | |
4626 | min_bytes = div_factor(global_rsv->size, min_factor); | |
4627 | if (global_rsv->reserved < min_bytes + num_bytes) { | |
4628 | spin_unlock(&global_rsv->lock); | |
4629 | return -ENOSPC; | |
4630 | } | |
4631 | global_rsv->reserved -= num_bytes; | |
4632 | if (global_rsv->reserved < global_rsv->size) | |
4633 | global_rsv->full = 0; | |
4634 | spin_unlock(&global_rsv->lock); | |
4635 | ||
4636 | block_rsv_add_bytes(dest, num_bytes, 1); | |
4637 | return 0; | |
4638 | } | |
4639 | ||
8c2a3ca2 JB |
4640 | static void block_rsv_release_bytes(struct btrfs_fs_info *fs_info, |
4641 | struct btrfs_block_rsv *block_rsv, | |
62a45b60 | 4642 | struct btrfs_block_rsv *dest, u64 num_bytes) |
f0486c68 YZ |
4643 | { |
4644 | struct btrfs_space_info *space_info = block_rsv->space_info; | |
4645 | ||
4646 | spin_lock(&block_rsv->lock); | |
4647 | if (num_bytes == (u64)-1) | |
4648 | num_bytes = block_rsv->size; | |
4649 | block_rsv->size -= num_bytes; | |
4650 | if (block_rsv->reserved >= block_rsv->size) { | |
4651 | num_bytes = block_rsv->reserved - block_rsv->size; | |
4652 | block_rsv->reserved = block_rsv->size; | |
4653 | block_rsv->full = 1; | |
4654 | } else { | |
4655 | num_bytes = 0; | |
4656 | } | |
4657 | spin_unlock(&block_rsv->lock); | |
4658 | ||
4659 | if (num_bytes > 0) { | |
4660 | if (dest) { | |
e9e22899 JB |
4661 | spin_lock(&dest->lock); |
4662 | if (!dest->full) { | |
4663 | u64 bytes_to_add; | |
4664 | ||
4665 | bytes_to_add = dest->size - dest->reserved; | |
4666 | bytes_to_add = min(num_bytes, bytes_to_add); | |
4667 | dest->reserved += bytes_to_add; | |
4668 | if (dest->reserved >= dest->size) | |
4669 | dest->full = 1; | |
4670 | num_bytes -= bytes_to_add; | |
4671 | } | |
4672 | spin_unlock(&dest->lock); | |
4673 | } | |
4674 | if (num_bytes) { | |
f0486c68 | 4675 | spin_lock(&space_info->lock); |
fb25e914 | 4676 | space_info->bytes_may_use -= num_bytes; |
8c2a3ca2 | 4677 | trace_btrfs_space_reservation(fs_info, "space_info", |
2bcc0328 | 4678 | space_info->flags, num_bytes, 0); |
f0486c68 | 4679 | spin_unlock(&space_info->lock); |
4e06bdd6 | 4680 | } |
9ed74f2d | 4681 | } |
f0486c68 | 4682 | } |
4e06bdd6 | 4683 | |
f0486c68 YZ |
4684 | static int block_rsv_migrate_bytes(struct btrfs_block_rsv *src, |
4685 | struct btrfs_block_rsv *dst, u64 num_bytes) | |
4686 | { | |
4687 | int ret; | |
9ed74f2d | 4688 | |
f0486c68 YZ |
4689 | ret = block_rsv_use_bytes(src, num_bytes); |
4690 | if (ret) | |
4691 | return ret; | |
9ed74f2d | 4692 | |
f0486c68 | 4693 | block_rsv_add_bytes(dst, num_bytes, 1); |
9ed74f2d JB |
4694 | return 0; |
4695 | } | |
4696 | ||
66d8f3dd | 4697 | void btrfs_init_block_rsv(struct btrfs_block_rsv *rsv, unsigned short type) |
9ed74f2d | 4698 | { |
f0486c68 YZ |
4699 | memset(rsv, 0, sizeof(*rsv)); |
4700 | spin_lock_init(&rsv->lock); | |
66d8f3dd | 4701 | rsv->type = type; |
f0486c68 YZ |
4702 | } |
4703 | ||
66d8f3dd MX |
4704 | struct btrfs_block_rsv *btrfs_alloc_block_rsv(struct btrfs_root *root, |
4705 | unsigned short type) | |
f0486c68 YZ |
4706 | { |
4707 | struct btrfs_block_rsv *block_rsv; | |
4708 | struct btrfs_fs_info *fs_info = root->fs_info; | |
9ed74f2d | 4709 | |
f0486c68 YZ |
4710 | block_rsv = kmalloc(sizeof(*block_rsv), GFP_NOFS); |
4711 | if (!block_rsv) | |
4712 | return NULL; | |
9ed74f2d | 4713 | |
66d8f3dd | 4714 | btrfs_init_block_rsv(block_rsv, type); |
f0486c68 YZ |
4715 | block_rsv->space_info = __find_space_info(fs_info, |
4716 | BTRFS_BLOCK_GROUP_METADATA); | |
f0486c68 YZ |
4717 | return block_rsv; |
4718 | } | |
9ed74f2d | 4719 | |
f0486c68 YZ |
4720 | void btrfs_free_block_rsv(struct btrfs_root *root, |
4721 | struct btrfs_block_rsv *rsv) | |
4722 | { | |
2aaa6655 JB |
4723 | if (!rsv) |
4724 | return; | |
dabdb640 JB |
4725 | btrfs_block_rsv_release(root, rsv, (u64)-1); |
4726 | kfree(rsv); | |
9ed74f2d JB |
4727 | } |
4728 | ||
08e007d2 MX |
4729 | int btrfs_block_rsv_add(struct btrfs_root *root, |
4730 | struct btrfs_block_rsv *block_rsv, u64 num_bytes, | |
4731 | enum btrfs_reserve_flush_enum flush) | |
9ed74f2d | 4732 | { |
f0486c68 | 4733 | int ret; |
9ed74f2d | 4734 | |
f0486c68 YZ |
4735 | if (num_bytes == 0) |
4736 | return 0; | |
8bb8ab2e | 4737 | |
61b520a9 | 4738 | ret = reserve_metadata_bytes(root, block_rsv, num_bytes, flush); |
f0486c68 YZ |
4739 | if (!ret) { |
4740 | block_rsv_add_bytes(block_rsv, num_bytes, 1); | |
4741 | return 0; | |
4742 | } | |
9ed74f2d | 4743 | |
f0486c68 | 4744 | return ret; |
f0486c68 | 4745 | } |
9ed74f2d | 4746 | |
4a92b1b8 | 4747 | int btrfs_block_rsv_check(struct btrfs_root *root, |
36ba022a | 4748 | struct btrfs_block_rsv *block_rsv, int min_factor) |
f0486c68 YZ |
4749 | { |
4750 | u64 num_bytes = 0; | |
f0486c68 | 4751 | int ret = -ENOSPC; |
9ed74f2d | 4752 | |
f0486c68 YZ |
4753 | if (!block_rsv) |
4754 | return 0; | |
9ed74f2d | 4755 | |
f0486c68 | 4756 | spin_lock(&block_rsv->lock); |
36ba022a JB |
4757 | num_bytes = div_factor(block_rsv->size, min_factor); |
4758 | if (block_rsv->reserved >= num_bytes) | |
4759 | ret = 0; | |
4760 | spin_unlock(&block_rsv->lock); | |
9ed74f2d | 4761 | |
36ba022a JB |
4762 | return ret; |
4763 | } | |
4764 | ||
08e007d2 MX |
4765 | int btrfs_block_rsv_refill(struct btrfs_root *root, |
4766 | struct btrfs_block_rsv *block_rsv, u64 min_reserved, | |
4767 | enum btrfs_reserve_flush_enum flush) | |
36ba022a JB |
4768 | { |
4769 | u64 num_bytes = 0; | |
4770 | int ret = -ENOSPC; | |
4771 | ||
4772 | if (!block_rsv) | |
4773 | return 0; | |
4774 | ||
4775 | spin_lock(&block_rsv->lock); | |
4776 | num_bytes = min_reserved; | |
13553e52 | 4777 | if (block_rsv->reserved >= num_bytes) |
f0486c68 | 4778 | ret = 0; |
13553e52 | 4779 | else |
f0486c68 | 4780 | num_bytes -= block_rsv->reserved; |
f0486c68 | 4781 | spin_unlock(&block_rsv->lock); |
13553e52 | 4782 | |
f0486c68 YZ |
4783 | if (!ret) |
4784 | return 0; | |
4785 | ||
aa38a711 | 4786 | ret = reserve_metadata_bytes(root, block_rsv, num_bytes, flush); |
dabdb640 JB |
4787 | if (!ret) { |
4788 | block_rsv_add_bytes(block_rsv, num_bytes, 0); | |
f0486c68 | 4789 | return 0; |
6a63209f | 4790 | } |
9ed74f2d | 4791 | |
13553e52 | 4792 | return ret; |
f0486c68 YZ |
4793 | } |
4794 | ||
4795 | int btrfs_block_rsv_migrate(struct btrfs_block_rsv *src_rsv, | |
4796 | struct btrfs_block_rsv *dst_rsv, | |
4797 | u64 num_bytes) | |
4798 | { | |
4799 | return block_rsv_migrate_bytes(src_rsv, dst_rsv, num_bytes); | |
4800 | } | |
4801 | ||
4802 | void btrfs_block_rsv_release(struct btrfs_root *root, | |
4803 | struct btrfs_block_rsv *block_rsv, | |
4804 | u64 num_bytes) | |
4805 | { | |
4806 | struct btrfs_block_rsv *global_rsv = &root->fs_info->global_block_rsv; | |
17504584 | 4807 | if (global_rsv == block_rsv || |
f0486c68 YZ |
4808 | block_rsv->space_info != global_rsv->space_info) |
4809 | global_rsv = NULL; | |
8c2a3ca2 JB |
4810 | block_rsv_release_bytes(root->fs_info, block_rsv, global_rsv, |
4811 | num_bytes); | |
6a63209f JB |
4812 | } |
4813 | ||
4814 | /* | |
8929ecfa YZ |
4815 | * helper to calculate size of global block reservation. |
4816 | * the desired value is sum of space used by extent tree, | |
4817 | * checksum tree and root tree | |
6a63209f | 4818 | */ |
8929ecfa | 4819 | static u64 calc_global_metadata_size(struct btrfs_fs_info *fs_info) |
6a63209f | 4820 | { |
8929ecfa YZ |
4821 | struct btrfs_space_info *sinfo; |
4822 | u64 num_bytes; | |
4823 | u64 meta_used; | |
4824 | u64 data_used; | |
6c41761f | 4825 | int csum_size = btrfs_super_csum_size(fs_info->super_copy); |
6a63209f | 4826 | |
8929ecfa YZ |
4827 | sinfo = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_DATA); |
4828 | spin_lock(&sinfo->lock); | |
4829 | data_used = sinfo->bytes_used; | |
4830 | spin_unlock(&sinfo->lock); | |
33b4d47f | 4831 | |
8929ecfa YZ |
4832 | sinfo = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_METADATA); |
4833 | spin_lock(&sinfo->lock); | |
6d48755d JB |
4834 | if (sinfo->flags & BTRFS_BLOCK_GROUP_DATA) |
4835 | data_used = 0; | |
8929ecfa YZ |
4836 | meta_used = sinfo->bytes_used; |
4837 | spin_unlock(&sinfo->lock); | |
ab6e2410 | 4838 | |
8929ecfa YZ |
4839 | num_bytes = (data_used >> fs_info->sb->s_blocksize_bits) * |
4840 | csum_size * 2; | |
f8c269d7 | 4841 | num_bytes += div_u64(data_used + meta_used, 50); |
4e06bdd6 | 4842 | |
8929ecfa | 4843 | if (num_bytes * 3 > meta_used) |
f8c269d7 | 4844 | num_bytes = div_u64(meta_used, 3); |
ab6e2410 | 4845 | |
707e8a07 | 4846 | return ALIGN(num_bytes, fs_info->extent_root->nodesize << 10); |
8929ecfa | 4847 | } |
6a63209f | 4848 | |
8929ecfa YZ |
4849 | static void update_global_block_rsv(struct btrfs_fs_info *fs_info) |
4850 | { | |
4851 | struct btrfs_block_rsv *block_rsv = &fs_info->global_block_rsv; | |
4852 | struct btrfs_space_info *sinfo = block_rsv->space_info; | |
4853 | u64 num_bytes; | |
6a63209f | 4854 | |
8929ecfa | 4855 | num_bytes = calc_global_metadata_size(fs_info); |
33b4d47f | 4856 | |
8929ecfa | 4857 | spin_lock(&sinfo->lock); |
1f699d38 | 4858 | spin_lock(&block_rsv->lock); |
4e06bdd6 | 4859 | |
fdf30d1c | 4860 | block_rsv->size = min_t(u64, num_bytes, 512 * 1024 * 1024); |
4e06bdd6 | 4861 | |
8929ecfa | 4862 | num_bytes = sinfo->bytes_used + sinfo->bytes_pinned + |
6d48755d JB |
4863 | sinfo->bytes_reserved + sinfo->bytes_readonly + |
4864 | sinfo->bytes_may_use; | |
8929ecfa YZ |
4865 | |
4866 | if (sinfo->total_bytes > num_bytes) { | |
4867 | num_bytes = sinfo->total_bytes - num_bytes; | |
4868 | block_rsv->reserved += num_bytes; | |
fb25e914 | 4869 | sinfo->bytes_may_use += num_bytes; |
8c2a3ca2 | 4870 | trace_btrfs_space_reservation(fs_info, "space_info", |
2bcc0328 | 4871 | sinfo->flags, num_bytes, 1); |
6a63209f | 4872 | } |
6a63209f | 4873 | |
8929ecfa YZ |
4874 | if (block_rsv->reserved >= block_rsv->size) { |
4875 | num_bytes = block_rsv->reserved - block_rsv->size; | |
fb25e914 | 4876 | sinfo->bytes_may_use -= num_bytes; |
8c2a3ca2 | 4877 | trace_btrfs_space_reservation(fs_info, "space_info", |
2bcc0328 | 4878 | sinfo->flags, num_bytes, 0); |
8929ecfa YZ |
4879 | block_rsv->reserved = block_rsv->size; |
4880 | block_rsv->full = 1; | |
4881 | } | |
182608c8 | 4882 | |
8929ecfa | 4883 | spin_unlock(&block_rsv->lock); |
1f699d38 | 4884 | spin_unlock(&sinfo->lock); |
6a63209f JB |
4885 | } |
4886 | ||
f0486c68 | 4887 | static void init_global_block_rsv(struct btrfs_fs_info *fs_info) |
6a63209f | 4888 | { |
f0486c68 | 4889 | struct btrfs_space_info *space_info; |
6a63209f | 4890 | |
f0486c68 YZ |
4891 | space_info = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_SYSTEM); |
4892 | fs_info->chunk_block_rsv.space_info = space_info; | |
6a63209f | 4893 | |
f0486c68 | 4894 | space_info = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_METADATA); |
8929ecfa | 4895 | fs_info->global_block_rsv.space_info = space_info; |
8929ecfa | 4896 | fs_info->delalloc_block_rsv.space_info = space_info; |
f0486c68 YZ |
4897 | fs_info->trans_block_rsv.space_info = space_info; |
4898 | fs_info->empty_block_rsv.space_info = space_info; | |
6d668dda | 4899 | fs_info->delayed_block_rsv.space_info = space_info; |
f0486c68 | 4900 | |
8929ecfa YZ |
4901 | fs_info->extent_root->block_rsv = &fs_info->global_block_rsv; |
4902 | fs_info->csum_root->block_rsv = &fs_info->global_block_rsv; | |
4903 | fs_info->dev_root->block_rsv = &fs_info->global_block_rsv; | |
4904 | fs_info->tree_root->block_rsv = &fs_info->global_block_rsv; | |
3a6cad90 SB |
4905 | if (fs_info->quota_root) |
4906 | fs_info->quota_root->block_rsv = &fs_info->global_block_rsv; | |
f0486c68 | 4907 | fs_info->chunk_root->block_rsv = &fs_info->chunk_block_rsv; |
8929ecfa | 4908 | |
8929ecfa | 4909 | update_global_block_rsv(fs_info); |
6a63209f JB |
4910 | } |
4911 | ||
8929ecfa | 4912 | static void release_global_block_rsv(struct btrfs_fs_info *fs_info) |
6a63209f | 4913 | { |
8c2a3ca2 JB |
4914 | block_rsv_release_bytes(fs_info, &fs_info->global_block_rsv, NULL, |
4915 | (u64)-1); | |
8929ecfa YZ |
4916 | WARN_ON(fs_info->delalloc_block_rsv.size > 0); |
4917 | WARN_ON(fs_info->delalloc_block_rsv.reserved > 0); | |
4918 | WARN_ON(fs_info->trans_block_rsv.size > 0); | |
4919 | WARN_ON(fs_info->trans_block_rsv.reserved > 0); | |
4920 | WARN_ON(fs_info->chunk_block_rsv.size > 0); | |
4921 | WARN_ON(fs_info->chunk_block_rsv.reserved > 0); | |
6d668dda JB |
4922 | WARN_ON(fs_info->delayed_block_rsv.size > 0); |
4923 | WARN_ON(fs_info->delayed_block_rsv.reserved > 0); | |
fcb80c2a JB |
4924 | } |
4925 | ||
a22285a6 YZ |
4926 | void btrfs_trans_release_metadata(struct btrfs_trans_handle *trans, |
4927 | struct btrfs_root *root) | |
6a63209f | 4928 | { |
0e721106 JB |
4929 | if (!trans->block_rsv) |
4930 | return; | |
4931 | ||
a22285a6 YZ |
4932 | if (!trans->bytes_reserved) |
4933 | return; | |
6a63209f | 4934 | |
e77266e4 | 4935 | trace_btrfs_space_reservation(root->fs_info, "transaction", |
2bcc0328 | 4936 | trans->transid, trans->bytes_reserved, 0); |
b24e03db | 4937 | btrfs_block_rsv_release(root, trans->block_rsv, trans->bytes_reserved); |
a22285a6 YZ |
4938 | trans->bytes_reserved = 0; |
4939 | } | |
6a63209f | 4940 | |
79787eaa | 4941 | /* Can only return 0 or -ENOSPC */ |
d68fc57b YZ |
4942 | int btrfs_orphan_reserve_metadata(struct btrfs_trans_handle *trans, |
4943 | struct inode *inode) | |
4944 | { | |
4945 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
4946 | struct btrfs_block_rsv *src_rsv = get_block_rsv(trans, root); | |
4947 | struct btrfs_block_rsv *dst_rsv = root->orphan_block_rsv; | |
4948 | ||
4949 | /* | |
fcb80c2a JB |
4950 | * We need to hold space in order to delete our orphan item once we've |
4951 | * added it, so this takes the reservation so we can release it later | |
4952 | * when we are truly done with the orphan item. | |
d68fc57b | 4953 | */ |
ff5714cc | 4954 | u64 num_bytes = btrfs_calc_trans_metadata_size(root, 1); |
8c2a3ca2 JB |
4955 | trace_btrfs_space_reservation(root->fs_info, "orphan", |
4956 | btrfs_ino(inode), num_bytes, 1); | |
d68fc57b | 4957 | return block_rsv_migrate_bytes(src_rsv, dst_rsv, num_bytes); |
6a63209f JB |
4958 | } |
4959 | ||
d68fc57b | 4960 | void btrfs_orphan_release_metadata(struct inode *inode) |
97e728d4 | 4961 | { |
d68fc57b | 4962 | struct btrfs_root *root = BTRFS_I(inode)->root; |
ff5714cc | 4963 | u64 num_bytes = btrfs_calc_trans_metadata_size(root, 1); |
8c2a3ca2 JB |
4964 | trace_btrfs_space_reservation(root->fs_info, "orphan", |
4965 | btrfs_ino(inode), num_bytes, 0); | |
d68fc57b YZ |
4966 | btrfs_block_rsv_release(root, root->orphan_block_rsv, num_bytes); |
4967 | } | |
97e728d4 | 4968 | |
d5c12070 MX |
4969 | /* |
4970 | * btrfs_subvolume_reserve_metadata() - reserve space for subvolume operation | |
4971 | * root: the root of the parent directory | |
4972 | * rsv: block reservation | |
4973 | * items: the number of items that we need do reservation | |
4974 | * qgroup_reserved: used to return the reserved size in qgroup | |
4975 | * | |
4976 | * This function is used to reserve the space for snapshot/subvolume | |
4977 | * creation and deletion. Those operations are different with the | |
4978 | * common file/directory operations, they change two fs/file trees | |
4979 | * and root tree, the number of items that the qgroup reserves is | |
4980 | * different with the free space reservation. So we can not use | |
4981 | * the space reseravtion mechanism in start_transaction(). | |
4982 | */ | |
4983 | int btrfs_subvolume_reserve_metadata(struct btrfs_root *root, | |
4984 | struct btrfs_block_rsv *rsv, | |
4985 | int items, | |
ee3441b4 JM |
4986 | u64 *qgroup_reserved, |
4987 | bool use_global_rsv) | |
a22285a6 | 4988 | { |
d5c12070 MX |
4989 | u64 num_bytes; |
4990 | int ret; | |
ee3441b4 | 4991 | struct btrfs_block_rsv *global_rsv = &root->fs_info->global_block_rsv; |
d5c12070 MX |
4992 | |
4993 | if (root->fs_info->quota_enabled) { | |
4994 | /* One for parent inode, two for dir entries */ | |
707e8a07 | 4995 | num_bytes = 3 * root->nodesize; |
d5c12070 MX |
4996 | ret = btrfs_qgroup_reserve(root, num_bytes); |
4997 | if (ret) | |
4998 | return ret; | |
4999 | } else { | |
5000 | num_bytes = 0; | |
5001 | } | |
5002 | ||
5003 | *qgroup_reserved = num_bytes; | |
5004 | ||
5005 | num_bytes = btrfs_calc_trans_metadata_size(root, items); | |
5006 | rsv->space_info = __find_space_info(root->fs_info, | |
5007 | BTRFS_BLOCK_GROUP_METADATA); | |
5008 | ret = btrfs_block_rsv_add(root, rsv, num_bytes, | |
5009 | BTRFS_RESERVE_FLUSH_ALL); | |
ee3441b4 JM |
5010 | |
5011 | if (ret == -ENOSPC && use_global_rsv) | |
5012 | ret = btrfs_block_rsv_migrate(global_rsv, rsv, num_bytes); | |
5013 | ||
d5c12070 MX |
5014 | if (ret) { |
5015 | if (*qgroup_reserved) | |
5016 | btrfs_qgroup_free(root, *qgroup_reserved); | |
5017 | } | |
5018 | ||
5019 | return ret; | |
5020 | } | |
5021 | ||
5022 | void btrfs_subvolume_release_metadata(struct btrfs_root *root, | |
5023 | struct btrfs_block_rsv *rsv, | |
5024 | u64 qgroup_reserved) | |
5025 | { | |
5026 | btrfs_block_rsv_release(root, rsv, (u64)-1); | |
5027 | if (qgroup_reserved) | |
5028 | btrfs_qgroup_free(root, qgroup_reserved); | |
97e728d4 JB |
5029 | } |
5030 | ||
7709cde3 JB |
5031 | /** |
5032 | * drop_outstanding_extent - drop an outstanding extent | |
5033 | * @inode: the inode we're dropping the extent for | |
dcab6a3b | 5034 | * @num_bytes: the number of bytes we're relaseing. |
7709cde3 JB |
5035 | * |
5036 | * This is called when we are freeing up an outstanding extent, either called | |
5037 | * after an error or after an extent is written. This will return the number of | |
5038 | * reserved extents that need to be freed. This must be called with | |
5039 | * BTRFS_I(inode)->lock held. | |
5040 | */ | |
dcab6a3b | 5041 | static unsigned drop_outstanding_extent(struct inode *inode, u64 num_bytes) |
9e0baf60 | 5042 | { |
7fd2ae21 | 5043 | unsigned drop_inode_space = 0; |
9e0baf60 | 5044 | unsigned dropped_extents = 0; |
dcab6a3b | 5045 | unsigned num_extents = 0; |
9e0baf60 | 5046 | |
dcab6a3b JB |
5047 | num_extents = (unsigned)div64_u64(num_bytes + |
5048 | BTRFS_MAX_EXTENT_SIZE - 1, | |
5049 | BTRFS_MAX_EXTENT_SIZE); | |
5050 | ASSERT(num_extents); | |
5051 | ASSERT(BTRFS_I(inode)->outstanding_extents >= num_extents); | |
5052 | BTRFS_I(inode)->outstanding_extents -= num_extents; | |
9e0baf60 | 5053 | |
7fd2ae21 | 5054 | if (BTRFS_I(inode)->outstanding_extents == 0 && |
72ac3c0d JB |
5055 | test_and_clear_bit(BTRFS_INODE_DELALLOC_META_RESERVED, |
5056 | &BTRFS_I(inode)->runtime_flags)) | |
7fd2ae21 | 5057 | drop_inode_space = 1; |
7fd2ae21 | 5058 | |
9e0baf60 JB |
5059 | /* |
5060 | * If we have more or the same amount of outsanding extents than we have | |
5061 | * reserved then we need to leave the reserved extents count alone. | |
5062 | */ | |
5063 | if (BTRFS_I(inode)->outstanding_extents >= | |
5064 | BTRFS_I(inode)->reserved_extents) | |
7fd2ae21 | 5065 | return drop_inode_space; |
9e0baf60 JB |
5066 | |
5067 | dropped_extents = BTRFS_I(inode)->reserved_extents - | |
5068 | BTRFS_I(inode)->outstanding_extents; | |
5069 | BTRFS_I(inode)->reserved_extents -= dropped_extents; | |
7fd2ae21 | 5070 | return dropped_extents + drop_inode_space; |
9e0baf60 JB |
5071 | } |
5072 | ||
7709cde3 JB |
5073 | /** |
5074 | * calc_csum_metadata_size - return the amount of metada space that must be | |
5075 | * reserved/free'd for the given bytes. | |
5076 | * @inode: the inode we're manipulating | |
5077 | * @num_bytes: the number of bytes in question | |
5078 | * @reserve: 1 if we are reserving space, 0 if we are freeing space | |
5079 | * | |
5080 | * This adjusts the number of csum_bytes in the inode and then returns the | |
5081 | * correct amount of metadata that must either be reserved or freed. We | |
5082 | * calculate how many checksums we can fit into one leaf and then divide the | |
5083 | * number of bytes that will need to be checksumed by this value to figure out | |
5084 | * how many checksums will be required. If we are adding bytes then the number | |
5085 | * may go up and we will return the number of additional bytes that must be | |
5086 | * reserved. If it is going down we will return the number of bytes that must | |
5087 | * be freed. | |
5088 | * | |
5089 | * This must be called with BTRFS_I(inode)->lock held. | |
5090 | */ | |
5091 | static u64 calc_csum_metadata_size(struct inode *inode, u64 num_bytes, | |
5092 | int reserve) | |
6324fbf3 | 5093 | { |
7709cde3 | 5094 | struct btrfs_root *root = BTRFS_I(inode)->root; |
1262133b | 5095 | u64 old_csums, num_csums; |
7709cde3 JB |
5096 | |
5097 | if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM && | |
5098 | BTRFS_I(inode)->csum_bytes == 0) | |
5099 | return 0; | |
5100 | ||
1262133b JB |
5101 | old_csums = csum_bytes_to_leaves(root, BTRFS_I(inode)->csum_bytes); |
5102 | ||
7709cde3 JB |
5103 | if (reserve) |
5104 | BTRFS_I(inode)->csum_bytes += num_bytes; | |
5105 | else | |
5106 | BTRFS_I(inode)->csum_bytes -= num_bytes; | |
1262133b | 5107 | num_csums = csum_bytes_to_leaves(root, BTRFS_I(inode)->csum_bytes); |
7709cde3 JB |
5108 | |
5109 | /* No change, no need to reserve more */ | |
5110 | if (old_csums == num_csums) | |
5111 | return 0; | |
5112 | ||
5113 | if (reserve) | |
5114 | return btrfs_calc_trans_metadata_size(root, | |
5115 | num_csums - old_csums); | |
5116 | ||
5117 | return btrfs_calc_trans_metadata_size(root, old_csums - num_csums); | |
0ca1f7ce | 5118 | } |
c146afad | 5119 | |
0ca1f7ce YZ |
5120 | int btrfs_delalloc_reserve_metadata(struct inode *inode, u64 num_bytes) |
5121 | { | |
5122 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
5123 | struct btrfs_block_rsv *block_rsv = &root->fs_info->delalloc_block_rsv; | |
9e0baf60 | 5124 | u64 to_reserve = 0; |
660d3f6c | 5125 | u64 csum_bytes; |
9e0baf60 | 5126 | unsigned nr_extents = 0; |
660d3f6c | 5127 | int extra_reserve = 0; |
08e007d2 | 5128 | enum btrfs_reserve_flush_enum flush = BTRFS_RESERVE_FLUSH_ALL; |
eb6b88d9 | 5129 | int ret = 0; |
c64c2bd8 | 5130 | bool delalloc_lock = true; |
88e081bf WS |
5131 | u64 to_free = 0; |
5132 | unsigned dropped; | |
6324fbf3 | 5133 | |
c64c2bd8 JB |
5134 | /* If we are a free space inode we need to not flush since we will be in |
5135 | * the middle of a transaction commit. We also don't need the delalloc | |
5136 | * mutex since we won't race with anybody. We need this mostly to make | |
5137 | * lockdep shut its filthy mouth. | |
5138 | */ | |
5139 | if (btrfs_is_free_space_inode(inode)) { | |
08e007d2 | 5140 | flush = BTRFS_RESERVE_NO_FLUSH; |
c64c2bd8 JB |
5141 | delalloc_lock = false; |
5142 | } | |
c09544e0 | 5143 | |
08e007d2 MX |
5144 | if (flush != BTRFS_RESERVE_NO_FLUSH && |
5145 | btrfs_transaction_in_commit(root->fs_info)) | |
0ca1f7ce | 5146 | schedule_timeout(1); |
ec44a35c | 5147 | |
c64c2bd8 JB |
5148 | if (delalloc_lock) |
5149 | mutex_lock(&BTRFS_I(inode)->delalloc_mutex); | |
5150 | ||
0ca1f7ce | 5151 | num_bytes = ALIGN(num_bytes, root->sectorsize); |
8bb8ab2e | 5152 | |
9e0baf60 | 5153 | spin_lock(&BTRFS_I(inode)->lock); |
6a41dd09 JB |
5154 | nr_extents = (unsigned)div64_u64(num_bytes + |
5155 | BTRFS_MAX_EXTENT_SIZE - 1, | |
5156 | BTRFS_MAX_EXTENT_SIZE); | |
5157 | BTRFS_I(inode)->outstanding_extents += nr_extents; | |
5158 | nr_extents = 0; | |
9e0baf60 JB |
5159 | |
5160 | if (BTRFS_I(inode)->outstanding_extents > | |
660d3f6c | 5161 | BTRFS_I(inode)->reserved_extents) |
9e0baf60 JB |
5162 | nr_extents = BTRFS_I(inode)->outstanding_extents - |
5163 | BTRFS_I(inode)->reserved_extents; | |
57a45ced | 5164 | |
7fd2ae21 JB |
5165 | /* |
5166 | * Add an item to reserve for updating the inode when we complete the | |
5167 | * delalloc io. | |
5168 | */ | |
72ac3c0d JB |
5169 | if (!test_bit(BTRFS_INODE_DELALLOC_META_RESERVED, |
5170 | &BTRFS_I(inode)->runtime_flags)) { | |
7fd2ae21 | 5171 | nr_extents++; |
660d3f6c | 5172 | extra_reserve = 1; |
593060d7 | 5173 | } |
7fd2ae21 JB |
5174 | |
5175 | to_reserve = btrfs_calc_trans_metadata_size(root, nr_extents); | |
7709cde3 | 5176 | to_reserve += calc_csum_metadata_size(inode, num_bytes, 1); |
660d3f6c | 5177 | csum_bytes = BTRFS_I(inode)->csum_bytes; |
9e0baf60 | 5178 | spin_unlock(&BTRFS_I(inode)->lock); |
57a45ced | 5179 | |
88e081bf | 5180 | if (root->fs_info->quota_enabled) { |
c5567237 | 5181 | ret = btrfs_qgroup_reserve(root, num_bytes + |
707e8a07 | 5182 | nr_extents * root->nodesize); |
88e081bf WS |
5183 | if (ret) |
5184 | goto out_fail; | |
5185 | } | |
c5567237 | 5186 | |
88e081bf WS |
5187 | ret = reserve_metadata_bytes(root, block_rsv, to_reserve, flush); |
5188 | if (unlikely(ret)) { | |
5189 | if (root->fs_info->quota_enabled) | |
4b5829a8 | 5190 | btrfs_qgroup_free(root, num_bytes + |
707e8a07 | 5191 | nr_extents * root->nodesize); |
88e081bf | 5192 | goto out_fail; |
9e0baf60 | 5193 | } |
25179201 | 5194 | |
660d3f6c JB |
5195 | spin_lock(&BTRFS_I(inode)->lock); |
5196 | if (extra_reserve) { | |
72ac3c0d JB |
5197 | set_bit(BTRFS_INODE_DELALLOC_META_RESERVED, |
5198 | &BTRFS_I(inode)->runtime_flags); | |
660d3f6c JB |
5199 | nr_extents--; |
5200 | } | |
5201 | BTRFS_I(inode)->reserved_extents += nr_extents; | |
5202 | spin_unlock(&BTRFS_I(inode)->lock); | |
c64c2bd8 JB |
5203 | |
5204 | if (delalloc_lock) | |
5205 | mutex_unlock(&BTRFS_I(inode)->delalloc_mutex); | |
660d3f6c | 5206 | |
8c2a3ca2 | 5207 | if (to_reserve) |
67871254 | 5208 | trace_btrfs_space_reservation(root->fs_info, "delalloc", |
8c2a3ca2 | 5209 | btrfs_ino(inode), to_reserve, 1); |
0ca1f7ce YZ |
5210 | block_rsv_add_bytes(block_rsv, to_reserve, 1); |
5211 | ||
0ca1f7ce | 5212 | return 0; |
88e081bf WS |
5213 | |
5214 | out_fail: | |
5215 | spin_lock(&BTRFS_I(inode)->lock); | |
dcab6a3b | 5216 | dropped = drop_outstanding_extent(inode, num_bytes); |
88e081bf WS |
5217 | /* |
5218 | * If the inodes csum_bytes is the same as the original | |
5219 | * csum_bytes then we know we haven't raced with any free()ers | |
5220 | * so we can just reduce our inodes csum bytes and carry on. | |
88e081bf | 5221 | */ |
f4881bc7 | 5222 | if (BTRFS_I(inode)->csum_bytes == csum_bytes) { |
88e081bf | 5223 | calc_csum_metadata_size(inode, num_bytes, 0); |
f4881bc7 JB |
5224 | } else { |
5225 | u64 orig_csum_bytes = BTRFS_I(inode)->csum_bytes; | |
5226 | u64 bytes; | |
5227 | ||
5228 | /* | |
5229 | * This is tricky, but first we need to figure out how much we | |
5230 | * free'd from any free-ers that occured during this | |
5231 | * reservation, so we reset ->csum_bytes to the csum_bytes | |
5232 | * before we dropped our lock, and then call the free for the | |
5233 | * number of bytes that were freed while we were trying our | |
5234 | * reservation. | |
5235 | */ | |
5236 | bytes = csum_bytes - BTRFS_I(inode)->csum_bytes; | |
5237 | BTRFS_I(inode)->csum_bytes = csum_bytes; | |
5238 | to_free = calc_csum_metadata_size(inode, bytes, 0); | |
5239 | ||
5240 | ||
5241 | /* | |
5242 | * Now we need to see how much we would have freed had we not | |
5243 | * been making this reservation and our ->csum_bytes were not | |
5244 | * artificially inflated. | |
5245 | */ | |
5246 | BTRFS_I(inode)->csum_bytes = csum_bytes - num_bytes; | |
5247 | bytes = csum_bytes - orig_csum_bytes; | |
5248 | bytes = calc_csum_metadata_size(inode, bytes, 0); | |
5249 | ||
5250 | /* | |
5251 | * Now reset ->csum_bytes to what it should be. If bytes is | |
5252 | * more than to_free then we would have free'd more space had we | |
5253 | * not had an artificially high ->csum_bytes, so we need to free | |
5254 | * the remainder. If bytes is the same or less then we don't | |
5255 | * need to do anything, the other free-ers did the correct | |
5256 | * thing. | |
5257 | */ | |
5258 | BTRFS_I(inode)->csum_bytes = orig_csum_bytes - num_bytes; | |
5259 | if (bytes > to_free) | |
5260 | to_free = bytes - to_free; | |
5261 | else | |
5262 | to_free = 0; | |
5263 | } | |
88e081bf WS |
5264 | spin_unlock(&BTRFS_I(inode)->lock); |
5265 | if (dropped) | |
5266 | to_free += btrfs_calc_trans_metadata_size(root, dropped); | |
5267 | ||
5268 | if (to_free) { | |
5269 | btrfs_block_rsv_release(root, block_rsv, to_free); | |
5270 | trace_btrfs_space_reservation(root->fs_info, "delalloc", | |
5271 | btrfs_ino(inode), to_free, 0); | |
5272 | } | |
5273 | if (delalloc_lock) | |
5274 | mutex_unlock(&BTRFS_I(inode)->delalloc_mutex); | |
5275 | return ret; | |
0ca1f7ce YZ |
5276 | } |
5277 | ||
7709cde3 JB |
5278 | /** |
5279 | * btrfs_delalloc_release_metadata - release a metadata reservation for an inode | |
5280 | * @inode: the inode to release the reservation for | |
5281 | * @num_bytes: the number of bytes we're releasing | |
5282 | * | |
5283 | * This will release the metadata reservation for an inode. This can be called | |
5284 | * once we complete IO for a given set of bytes to release their metadata | |
5285 | * reservations. | |
5286 | */ | |
0ca1f7ce YZ |
5287 | void btrfs_delalloc_release_metadata(struct inode *inode, u64 num_bytes) |
5288 | { | |
5289 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
9e0baf60 JB |
5290 | u64 to_free = 0; |
5291 | unsigned dropped; | |
0ca1f7ce YZ |
5292 | |
5293 | num_bytes = ALIGN(num_bytes, root->sectorsize); | |
7709cde3 | 5294 | spin_lock(&BTRFS_I(inode)->lock); |
dcab6a3b | 5295 | dropped = drop_outstanding_extent(inode, num_bytes); |
97e728d4 | 5296 | |
0934856d MX |
5297 | if (num_bytes) |
5298 | to_free = calc_csum_metadata_size(inode, num_bytes, 0); | |
7709cde3 | 5299 | spin_unlock(&BTRFS_I(inode)->lock); |
9e0baf60 JB |
5300 | if (dropped > 0) |
5301 | to_free += btrfs_calc_trans_metadata_size(root, dropped); | |
0ca1f7ce | 5302 | |
6a3891c5 JB |
5303 | if (btrfs_test_is_dummy_root(root)) |
5304 | return; | |
5305 | ||
8c2a3ca2 JB |
5306 | trace_btrfs_space_reservation(root->fs_info, "delalloc", |
5307 | btrfs_ino(inode), to_free, 0); | |
c5567237 AJ |
5308 | if (root->fs_info->quota_enabled) { |
5309 | btrfs_qgroup_free(root, num_bytes + | |
707e8a07 | 5310 | dropped * root->nodesize); |
c5567237 AJ |
5311 | } |
5312 | ||
0ca1f7ce YZ |
5313 | btrfs_block_rsv_release(root, &root->fs_info->delalloc_block_rsv, |
5314 | to_free); | |
5315 | } | |
5316 | ||
7709cde3 JB |
5317 | /** |
5318 | * btrfs_delalloc_reserve_space - reserve data and metadata space for delalloc | |
5319 | * @inode: inode we're writing to | |
5320 | * @num_bytes: the number of bytes we want to allocate | |
5321 | * | |
5322 | * This will do the following things | |
5323 | * | |
5324 | * o reserve space in the data space info for num_bytes | |
5325 | * o reserve space in the metadata space info based on number of outstanding | |
5326 | * extents and how much csums will be needed | |
5327 | * o add to the inodes ->delalloc_bytes | |
5328 | * o add it to the fs_info's delalloc inodes list. | |
5329 | * | |
5330 | * This will return 0 for success and -ENOSPC if there is no space left. | |
5331 | */ | |
0ca1f7ce YZ |
5332 | int btrfs_delalloc_reserve_space(struct inode *inode, u64 num_bytes) |
5333 | { | |
5334 | int ret; | |
5335 | ||
5336 | ret = btrfs_check_data_free_space(inode, num_bytes); | |
d397712b | 5337 | if (ret) |
0ca1f7ce YZ |
5338 | return ret; |
5339 | ||
5340 | ret = btrfs_delalloc_reserve_metadata(inode, num_bytes); | |
5341 | if (ret) { | |
5342 | btrfs_free_reserved_data_space(inode, num_bytes); | |
5343 | return ret; | |
5344 | } | |
5345 | ||
5346 | return 0; | |
5347 | } | |
5348 | ||
7709cde3 JB |
5349 | /** |
5350 | * btrfs_delalloc_release_space - release data and metadata space for delalloc | |
5351 | * @inode: inode we're releasing space for | |
5352 | * @num_bytes: the number of bytes we want to free up | |
5353 | * | |
5354 | * This must be matched with a call to btrfs_delalloc_reserve_space. This is | |
5355 | * called in the case that we don't need the metadata AND data reservations | |
5356 | * anymore. So if there is an error or we insert an inline extent. | |
5357 | * | |
5358 | * This function will release the metadata space that was not used and will | |
5359 | * decrement ->delalloc_bytes and remove it from the fs_info delalloc_inodes | |
5360 | * list if there are no delalloc bytes left. | |
5361 | */ | |
0ca1f7ce YZ |
5362 | void btrfs_delalloc_release_space(struct inode *inode, u64 num_bytes) |
5363 | { | |
5364 | btrfs_delalloc_release_metadata(inode, num_bytes); | |
5365 | btrfs_free_reserved_data_space(inode, num_bytes); | |
6324fbf3 CM |
5366 | } |
5367 | ||
ce93ec54 JB |
5368 | static int update_block_group(struct btrfs_trans_handle *trans, |
5369 | struct btrfs_root *root, u64 bytenr, | |
5370 | u64 num_bytes, int alloc) | |
9078a3e1 | 5371 | { |
0af3d00b | 5372 | struct btrfs_block_group_cache *cache = NULL; |
9078a3e1 | 5373 | struct btrfs_fs_info *info = root->fs_info; |
db94535d | 5374 | u64 total = num_bytes; |
9078a3e1 | 5375 | u64 old_val; |
db94535d | 5376 | u64 byte_in_group; |
0af3d00b | 5377 | int factor; |
3e1ad54f | 5378 | |
5d4f98a2 | 5379 | /* block accounting for super block */ |
eb73c1b7 | 5380 | spin_lock(&info->delalloc_root_lock); |
6c41761f | 5381 | old_val = btrfs_super_bytes_used(info->super_copy); |
5d4f98a2 YZ |
5382 | if (alloc) |
5383 | old_val += num_bytes; | |
5384 | else | |
5385 | old_val -= num_bytes; | |
6c41761f | 5386 | btrfs_set_super_bytes_used(info->super_copy, old_val); |
eb73c1b7 | 5387 | spin_unlock(&info->delalloc_root_lock); |
5d4f98a2 | 5388 | |
d397712b | 5389 | while (total) { |
db94535d | 5390 | cache = btrfs_lookup_block_group(info, bytenr); |
f3465ca4 | 5391 | if (!cache) |
79787eaa | 5392 | return -ENOENT; |
b742bb82 YZ |
5393 | if (cache->flags & (BTRFS_BLOCK_GROUP_DUP | |
5394 | BTRFS_BLOCK_GROUP_RAID1 | | |
5395 | BTRFS_BLOCK_GROUP_RAID10)) | |
5396 | factor = 2; | |
5397 | else | |
5398 | factor = 1; | |
9d66e233 JB |
5399 | /* |
5400 | * If this block group has free space cache written out, we | |
5401 | * need to make sure to load it if we are removing space. This | |
5402 | * is because we need the unpinning stage to actually add the | |
5403 | * space back to the block group, otherwise we will leak space. | |
5404 | */ | |
5405 | if (!alloc && cache->cached == BTRFS_CACHE_NO) | |
f6373bf3 | 5406 | cache_block_group(cache, 1); |
0af3d00b | 5407 | |
ce93ec54 JB |
5408 | spin_lock(&trans->transaction->dirty_bgs_lock); |
5409 | if (list_empty(&cache->dirty_list)) { | |
5410 | list_add_tail(&cache->dirty_list, | |
5411 | &trans->transaction->dirty_bgs); | |
5412 | btrfs_get_block_group(cache); | |
5413 | } | |
5414 | spin_unlock(&trans->transaction->dirty_bgs_lock); | |
5415 | ||
db94535d CM |
5416 | byte_in_group = bytenr - cache->key.objectid; |
5417 | WARN_ON(byte_in_group > cache->key.offset); | |
9078a3e1 | 5418 | |
25179201 | 5419 | spin_lock(&cache->space_info->lock); |
c286ac48 | 5420 | spin_lock(&cache->lock); |
0af3d00b | 5421 | |
73bc1876 | 5422 | if (btrfs_test_opt(root, SPACE_CACHE) && |
0af3d00b JB |
5423 | cache->disk_cache_state < BTRFS_DC_CLEAR) |
5424 | cache->disk_cache_state = BTRFS_DC_CLEAR; | |
5425 | ||
9078a3e1 | 5426 | old_val = btrfs_block_group_used(&cache->item); |
db94535d | 5427 | num_bytes = min(total, cache->key.offset - byte_in_group); |
cd1bc465 | 5428 | if (alloc) { |
db94535d | 5429 | old_val += num_bytes; |
11833d66 YZ |
5430 | btrfs_set_block_group_used(&cache->item, old_val); |
5431 | cache->reserved -= num_bytes; | |
11833d66 | 5432 | cache->space_info->bytes_reserved -= num_bytes; |
b742bb82 YZ |
5433 | cache->space_info->bytes_used += num_bytes; |
5434 | cache->space_info->disk_used += num_bytes * factor; | |
c286ac48 | 5435 | spin_unlock(&cache->lock); |
25179201 | 5436 | spin_unlock(&cache->space_info->lock); |
cd1bc465 | 5437 | } else { |
db94535d | 5438 | old_val -= num_bytes; |
ae0ab003 FM |
5439 | btrfs_set_block_group_used(&cache->item, old_val); |
5440 | cache->pinned += num_bytes; | |
5441 | cache->space_info->bytes_pinned += num_bytes; | |
5442 | cache->space_info->bytes_used -= num_bytes; | |
5443 | cache->space_info->disk_used -= num_bytes * factor; | |
5444 | spin_unlock(&cache->lock); | |
5445 | spin_unlock(&cache->space_info->lock); | |
47ab2a6c | 5446 | |
ae0ab003 FM |
5447 | set_extent_dirty(info->pinned_extents, |
5448 | bytenr, bytenr + num_bytes - 1, | |
5449 | GFP_NOFS | __GFP_NOFAIL); | |
47ab2a6c JB |
5450 | /* |
5451 | * No longer have used bytes in this block group, queue | |
5452 | * it for deletion. | |
5453 | */ | |
5454 | if (old_val == 0) { | |
5455 | spin_lock(&info->unused_bgs_lock); | |
5456 | if (list_empty(&cache->bg_list)) { | |
5457 | btrfs_get_block_group(cache); | |
5458 | list_add_tail(&cache->bg_list, | |
5459 | &info->unused_bgs); | |
5460 | } | |
5461 | spin_unlock(&info->unused_bgs_lock); | |
5462 | } | |
cd1bc465 | 5463 | } |
fa9c0d79 | 5464 | btrfs_put_block_group(cache); |
db94535d CM |
5465 | total -= num_bytes; |
5466 | bytenr += num_bytes; | |
9078a3e1 CM |
5467 | } |
5468 | return 0; | |
5469 | } | |
6324fbf3 | 5470 | |
a061fc8d CM |
5471 | static u64 first_logical_byte(struct btrfs_root *root, u64 search_start) |
5472 | { | |
0f9dd46c | 5473 | struct btrfs_block_group_cache *cache; |
d2fb3437 | 5474 | u64 bytenr; |
0f9dd46c | 5475 | |
a1897fdd LB |
5476 | spin_lock(&root->fs_info->block_group_cache_lock); |
5477 | bytenr = root->fs_info->first_logical_byte; | |
5478 | spin_unlock(&root->fs_info->block_group_cache_lock); | |
5479 | ||
5480 | if (bytenr < (u64)-1) | |
5481 | return bytenr; | |
5482 | ||
0f9dd46c JB |
5483 | cache = btrfs_lookup_first_block_group(root->fs_info, search_start); |
5484 | if (!cache) | |
a061fc8d | 5485 | return 0; |
0f9dd46c | 5486 | |
d2fb3437 | 5487 | bytenr = cache->key.objectid; |
fa9c0d79 | 5488 | btrfs_put_block_group(cache); |
d2fb3437 YZ |
5489 | |
5490 | return bytenr; | |
a061fc8d CM |
5491 | } |
5492 | ||
f0486c68 YZ |
5493 | static int pin_down_extent(struct btrfs_root *root, |
5494 | struct btrfs_block_group_cache *cache, | |
5495 | u64 bytenr, u64 num_bytes, int reserved) | |
324ae4df | 5496 | { |
11833d66 YZ |
5497 | spin_lock(&cache->space_info->lock); |
5498 | spin_lock(&cache->lock); | |
5499 | cache->pinned += num_bytes; | |
5500 | cache->space_info->bytes_pinned += num_bytes; | |
5501 | if (reserved) { | |
5502 | cache->reserved -= num_bytes; | |
5503 | cache->space_info->bytes_reserved -= num_bytes; | |
5504 | } | |
5505 | spin_unlock(&cache->lock); | |
5506 | spin_unlock(&cache->space_info->lock); | |
68b38550 | 5507 | |
f0486c68 YZ |
5508 | set_extent_dirty(root->fs_info->pinned_extents, bytenr, |
5509 | bytenr + num_bytes - 1, GFP_NOFS | __GFP_NOFAIL); | |
0be5dc67 JB |
5510 | if (reserved) |
5511 | trace_btrfs_reserved_extent_free(root, bytenr, num_bytes); | |
f0486c68 YZ |
5512 | return 0; |
5513 | } | |
68b38550 | 5514 | |
f0486c68 YZ |
5515 | /* |
5516 | * this function must be called within transaction | |
5517 | */ | |
5518 | int btrfs_pin_extent(struct btrfs_root *root, | |
5519 | u64 bytenr, u64 num_bytes, int reserved) | |
5520 | { | |
5521 | struct btrfs_block_group_cache *cache; | |
68b38550 | 5522 | |
f0486c68 | 5523 | cache = btrfs_lookup_block_group(root->fs_info, bytenr); |
79787eaa | 5524 | BUG_ON(!cache); /* Logic error */ |
f0486c68 YZ |
5525 | |
5526 | pin_down_extent(root, cache, bytenr, num_bytes, reserved); | |
5527 | ||
5528 | btrfs_put_block_group(cache); | |
11833d66 YZ |
5529 | return 0; |
5530 | } | |
5531 | ||
f0486c68 | 5532 | /* |
e688b725 CM |
5533 | * this function must be called within transaction |
5534 | */ | |
dcfac415 | 5535 | int btrfs_pin_extent_for_log_replay(struct btrfs_root *root, |
e688b725 CM |
5536 | u64 bytenr, u64 num_bytes) |
5537 | { | |
5538 | struct btrfs_block_group_cache *cache; | |
b50c6e25 | 5539 | int ret; |
e688b725 CM |
5540 | |
5541 | cache = btrfs_lookup_block_group(root->fs_info, bytenr); | |
b50c6e25 JB |
5542 | if (!cache) |
5543 | return -EINVAL; | |
e688b725 CM |
5544 | |
5545 | /* | |
5546 | * pull in the free space cache (if any) so that our pin | |
5547 | * removes the free space from the cache. We have load_only set | |
5548 | * to one because the slow code to read in the free extents does check | |
5549 | * the pinned extents. | |
5550 | */ | |
f6373bf3 | 5551 | cache_block_group(cache, 1); |
e688b725 CM |
5552 | |
5553 | pin_down_extent(root, cache, bytenr, num_bytes, 0); | |
5554 | ||
5555 | /* remove us from the free space cache (if we're there at all) */ | |
b50c6e25 | 5556 | ret = btrfs_remove_free_space(cache, bytenr, num_bytes); |
e688b725 | 5557 | btrfs_put_block_group(cache); |
b50c6e25 | 5558 | return ret; |
e688b725 CM |
5559 | } |
5560 | ||
8c2a1a30 JB |
5561 | static int __exclude_logged_extent(struct btrfs_root *root, u64 start, u64 num_bytes) |
5562 | { | |
5563 | int ret; | |
5564 | struct btrfs_block_group_cache *block_group; | |
5565 | struct btrfs_caching_control *caching_ctl; | |
5566 | ||
5567 | block_group = btrfs_lookup_block_group(root->fs_info, start); | |
5568 | if (!block_group) | |
5569 | return -EINVAL; | |
5570 | ||
5571 | cache_block_group(block_group, 0); | |
5572 | caching_ctl = get_caching_control(block_group); | |
5573 | ||
5574 | if (!caching_ctl) { | |
5575 | /* Logic error */ | |
5576 | BUG_ON(!block_group_cache_done(block_group)); | |
5577 | ret = btrfs_remove_free_space(block_group, start, num_bytes); | |
5578 | } else { | |
5579 | mutex_lock(&caching_ctl->mutex); | |
5580 | ||
5581 | if (start >= caching_ctl->progress) { | |
5582 | ret = add_excluded_extent(root, start, num_bytes); | |
5583 | } else if (start + num_bytes <= caching_ctl->progress) { | |
5584 | ret = btrfs_remove_free_space(block_group, | |
5585 | start, num_bytes); | |
5586 | } else { | |
5587 | num_bytes = caching_ctl->progress - start; | |
5588 | ret = btrfs_remove_free_space(block_group, | |
5589 | start, num_bytes); | |
5590 | if (ret) | |
5591 | goto out_lock; | |
5592 | ||
5593 | num_bytes = (start + num_bytes) - | |
5594 | caching_ctl->progress; | |
5595 | start = caching_ctl->progress; | |
5596 | ret = add_excluded_extent(root, start, num_bytes); | |
5597 | } | |
5598 | out_lock: | |
5599 | mutex_unlock(&caching_ctl->mutex); | |
5600 | put_caching_control(caching_ctl); | |
5601 | } | |
5602 | btrfs_put_block_group(block_group); | |
5603 | return ret; | |
5604 | } | |
5605 | ||
5606 | int btrfs_exclude_logged_extents(struct btrfs_root *log, | |
5607 | struct extent_buffer *eb) | |
5608 | { | |
5609 | struct btrfs_file_extent_item *item; | |
5610 | struct btrfs_key key; | |
5611 | int found_type; | |
5612 | int i; | |
5613 | ||
5614 | if (!btrfs_fs_incompat(log->fs_info, MIXED_GROUPS)) | |
5615 | return 0; | |
5616 | ||
5617 | for (i = 0; i < btrfs_header_nritems(eb); i++) { | |
5618 | btrfs_item_key_to_cpu(eb, &key, i); | |
5619 | if (key.type != BTRFS_EXTENT_DATA_KEY) | |
5620 | continue; | |
5621 | item = btrfs_item_ptr(eb, i, struct btrfs_file_extent_item); | |
5622 | found_type = btrfs_file_extent_type(eb, item); | |
5623 | if (found_type == BTRFS_FILE_EXTENT_INLINE) | |
5624 | continue; | |
5625 | if (btrfs_file_extent_disk_bytenr(eb, item) == 0) | |
5626 | continue; | |
5627 | key.objectid = btrfs_file_extent_disk_bytenr(eb, item); | |
5628 | key.offset = btrfs_file_extent_disk_num_bytes(eb, item); | |
5629 | __exclude_logged_extent(log, key.objectid, key.offset); | |
5630 | } | |
5631 | ||
5632 | return 0; | |
5633 | } | |
5634 | ||
fb25e914 JB |
5635 | /** |
5636 | * btrfs_update_reserved_bytes - update the block_group and space info counters | |
5637 | * @cache: The cache we are manipulating | |
5638 | * @num_bytes: The number of bytes in question | |
5639 | * @reserve: One of the reservation enums | |
e570fd27 | 5640 | * @delalloc: The blocks are allocated for the delalloc write |
fb25e914 JB |
5641 | * |
5642 | * This is called by the allocator when it reserves space, or by somebody who is | |
5643 | * freeing space that was never actually used on disk. For example if you | |
5644 | * reserve some space for a new leaf in transaction A and before transaction A | |
5645 | * commits you free that leaf, you call this with reserve set to 0 in order to | |
5646 | * clear the reservation. | |
5647 | * | |
5648 | * Metadata reservations should be called with RESERVE_ALLOC so we do the proper | |
5649 | * ENOSPC accounting. For data we handle the reservation through clearing the | |
5650 | * delalloc bits in the io_tree. We have to do this since we could end up | |
5651 | * allocating less disk space for the amount of data we have reserved in the | |
5652 | * case of compression. | |
5653 | * | |
5654 | * If this is a reservation and the block group has become read only we cannot | |
5655 | * make the reservation and return -EAGAIN, otherwise this function always | |
5656 | * succeeds. | |
f0486c68 | 5657 | */ |
fb25e914 | 5658 | static int btrfs_update_reserved_bytes(struct btrfs_block_group_cache *cache, |
e570fd27 | 5659 | u64 num_bytes, int reserve, int delalloc) |
11833d66 | 5660 | { |
fb25e914 | 5661 | struct btrfs_space_info *space_info = cache->space_info; |
f0486c68 | 5662 | int ret = 0; |
79787eaa | 5663 | |
fb25e914 JB |
5664 | spin_lock(&space_info->lock); |
5665 | spin_lock(&cache->lock); | |
5666 | if (reserve != RESERVE_FREE) { | |
f0486c68 YZ |
5667 | if (cache->ro) { |
5668 | ret = -EAGAIN; | |
5669 | } else { | |
fb25e914 JB |
5670 | cache->reserved += num_bytes; |
5671 | space_info->bytes_reserved += num_bytes; | |
5672 | if (reserve == RESERVE_ALLOC) { | |
8c2a3ca2 | 5673 | trace_btrfs_space_reservation(cache->fs_info, |
2bcc0328 LB |
5674 | "space_info", space_info->flags, |
5675 | num_bytes, 0); | |
fb25e914 JB |
5676 | space_info->bytes_may_use -= num_bytes; |
5677 | } | |
e570fd27 MX |
5678 | |
5679 | if (delalloc) | |
5680 | cache->delalloc_bytes += num_bytes; | |
f0486c68 | 5681 | } |
fb25e914 JB |
5682 | } else { |
5683 | if (cache->ro) | |
5684 | space_info->bytes_readonly += num_bytes; | |
5685 | cache->reserved -= num_bytes; | |
5686 | space_info->bytes_reserved -= num_bytes; | |
e570fd27 MX |
5687 | |
5688 | if (delalloc) | |
5689 | cache->delalloc_bytes -= num_bytes; | |
324ae4df | 5690 | } |
fb25e914 JB |
5691 | spin_unlock(&cache->lock); |
5692 | spin_unlock(&space_info->lock); | |
f0486c68 | 5693 | return ret; |
324ae4df | 5694 | } |
9078a3e1 | 5695 | |
143bede5 | 5696 | void btrfs_prepare_extent_commit(struct btrfs_trans_handle *trans, |
11833d66 | 5697 | struct btrfs_root *root) |
e8569813 | 5698 | { |
e8569813 | 5699 | struct btrfs_fs_info *fs_info = root->fs_info; |
11833d66 YZ |
5700 | struct btrfs_caching_control *next; |
5701 | struct btrfs_caching_control *caching_ctl; | |
5702 | struct btrfs_block_group_cache *cache; | |
e8569813 | 5703 | |
9e351cc8 | 5704 | down_write(&fs_info->commit_root_sem); |
25179201 | 5705 | |
11833d66 YZ |
5706 | list_for_each_entry_safe(caching_ctl, next, |
5707 | &fs_info->caching_block_groups, list) { | |
5708 | cache = caching_ctl->block_group; | |
5709 | if (block_group_cache_done(cache)) { | |
5710 | cache->last_byte_to_unpin = (u64)-1; | |
5711 | list_del_init(&caching_ctl->list); | |
5712 | put_caching_control(caching_ctl); | |
e8569813 | 5713 | } else { |
11833d66 | 5714 | cache->last_byte_to_unpin = caching_ctl->progress; |
e8569813 | 5715 | } |
e8569813 | 5716 | } |
11833d66 YZ |
5717 | |
5718 | if (fs_info->pinned_extents == &fs_info->freed_extents[0]) | |
5719 | fs_info->pinned_extents = &fs_info->freed_extents[1]; | |
5720 | else | |
5721 | fs_info->pinned_extents = &fs_info->freed_extents[0]; | |
5722 | ||
9e351cc8 | 5723 | up_write(&fs_info->commit_root_sem); |
8929ecfa YZ |
5724 | |
5725 | update_global_block_rsv(fs_info); | |
e8569813 ZY |
5726 | } |
5727 | ||
678886bd FM |
5728 | static int unpin_extent_range(struct btrfs_root *root, u64 start, u64 end, |
5729 | const bool return_free_space) | |
ccd467d6 | 5730 | { |
11833d66 YZ |
5731 | struct btrfs_fs_info *fs_info = root->fs_info; |
5732 | struct btrfs_block_group_cache *cache = NULL; | |
7b398f8e JB |
5733 | struct btrfs_space_info *space_info; |
5734 | struct btrfs_block_rsv *global_rsv = &fs_info->global_block_rsv; | |
11833d66 | 5735 | u64 len; |
7b398f8e | 5736 | bool readonly; |
ccd467d6 | 5737 | |
11833d66 | 5738 | while (start <= end) { |
7b398f8e | 5739 | readonly = false; |
11833d66 YZ |
5740 | if (!cache || |
5741 | start >= cache->key.objectid + cache->key.offset) { | |
5742 | if (cache) | |
5743 | btrfs_put_block_group(cache); | |
5744 | cache = btrfs_lookup_block_group(fs_info, start); | |
79787eaa | 5745 | BUG_ON(!cache); /* Logic error */ |
11833d66 YZ |
5746 | } |
5747 | ||
5748 | len = cache->key.objectid + cache->key.offset - start; | |
5749 | len = min(len, end + 1 - start); | |
5750 | ||
5751 | if (start < cache->last_byte_to_unpin) { | |
5752 | len = min(len, cache->last_byte_to_unpin - start); | |
678886bd FM |
5753 | if (return_free_space) |
5754 | btrfs_add_free_space(cache, start, len); | |
11833d66 YZ |
5755 | } |
5756 | ||
f0486c68 | 5757 | start += len; |
7b398f8e | 5758 | space_info = cache->space_info; |
f0486c68 | 5759 | |
7b398f8e | 5760 | spin_lock(&space_info->lock); |
11833d66 YZ |
5761 | spin_lock(&cache->lock); |
5762 | cache->pinned -= len; | |
7b398f8e | 5763 | space_info->bytes_pinned -= len; |
d288db5d | 5764 | percpu_counter_add(&space_info->total_bytes_pinned, -len); |
7b398f8e JB |
5765 | if (cache->ro) { |
5766 | space_info->bytes_readonly += len; | |
5767 | readonly = true; | |
5768 | } | |
11833d66 | 5769 | spin_unlock(&cache->lock); |
7b398f8e JB |
5770 | if (!readonly && global_rsv->space_info == space_info) { |
5771 | spin_lock(&global_rsv->lock); | |
5772 | if (!global_rsv->full) { | |
5773 | len = min(len, global_rsv->size - | |
5774 | global_rsv->reserved); | |
5775 | global_rsv->reserved += len; | |
5776 | space_info->bytes_may_use += len; | |
5777 | if (global_rsv->reserved >= global_rsv->size) | |
5778 | global_rsv->full = 1; | |
5779 | } | |
5780 | spin_unlock(&global_rsv->lock); | |
5781 | } | |
5782 | spin_unlock(&space_info->lock); | |
ccd467d6 | 5783 | } |
11833d66 YZ |
5784 | |
5785 | if (cache) | |
5786 | btrfs_put_block_group(cache); | |
ccd467d6 CM |
5787 | return 0; |
5788 | } | |
5789 | ||
5790 | int btrfs_finish_extent_commit(struct btrfs_trans_handle *trans, | |
11833d66 | 5791 | struct btrfs_root *root) |
a28ec197 | 5792 | { |
11833d66 YZ |
5793 | struct btrfs_fs_info *fs_info = root->fs_info; |
5794 | struct extent_io_tree *unpin; | |
1a5bc167 CM |
5795 | u64 start; |
5796 | u64 end; | |
a28ec197 | 5797 | int ret; |
a28ec197 | 5798 | |
79787eaa JM |
5799 | if (trans->aborted) |
5800 | return 0; | |
5801 | ||
11833d66 YZ |
5802 | if (fs_info->pinned_extents == &fs_info->freed_extents[0]) |
5803 | unpin = &fs_info->freed_extents[1]; | |
5804 | else | |
5805 | unpin = &fs_info->freed_extents[0]; | |
5806 | ||
d397712b | 5807 | while (1) { |
d4b450cd | 5808 | mutex_lock(&fs_info->unused_bg_unpin_mutex); |
1a5bc167 | 5809 | ret = find_first_extent_bit(unpin, 0, &start, &end, |
e6138876 | 5810 | EXTENT_DIRTY, NULL); |
d4b450cd FM |
5811 | if (ret) { |
5812 | mutex_unlock(&fs_info->unused_bg_unpin_mutex); | |
a28ec197 | 5813 | break; |
d4b450cd | 5814 | } |
1f3c79a2 | 5815 | |
5378e607 LD |
5816 | if (btrfs_test_opt(root, DISCARD)) |
5817 | ret = btrfs_discard_extent(root, start, | |
5818 | end + 1 - start, NULL); | |
1f3c79a2 | 5819 | |
1a5bc167 | 5820 | clear_extent_dirty(unpin, start, end, GFP_NOFS); |
678886bd | 5821 | unpin_extent_range(root, start, end, true); |
d4b450cd | 5822 | mutex_unlock(&fs_info->unused_bg_unpin_mutex); |
b9473439 | 5823 | cond_resched(); |
a28ec197 | 5824 | } |
817d52f8 | 5825 | |
e20d96d6 CM |
5826 | return 0; |
5827 | } | |
5828 | ||
b150a4f1 JB |
5829 | static void add_pinned_bytes(struct btrfs_fs_info *fs_info, u64 num_bytes, |
5830 | u64 owner, u64 root_objectid) | |
5831 | { | |
5832 | struct btrfs_space_info *space_info; | |
5833 | u64 flags; | |
5834 | ||
5835 | if (owner < BTRFS_FIRST_FREE_OBJECTID) { | |
5836 | if (root_objectid == BTRFS_CHUNK_TREE_OBJECTID) | |
5837 | flags = BTRFS_BLOCK_GROUP_SYSTEM; | |
5838 | else | |
5839 | flags = BTRFS_BLOCK_GROUP_METADATA; | |
5840 | } else { | |
5841 | flags = BTRFS_BLOCK_GROUP_DATA; | |
5842 | } | |
5843 | ||
5844 | space_info = __find_space_info(fs_info, flags); | |
5845 | BUG_ON(!space_info); /* Logic bug */ | |
5846 | percpu_counter_add(&space_info->total_bytes_pinned, num_bytes); | |
5847 | } | |
5848 | ||
5849 | ||
5d4f98a2 YZ |
5850 | static int __btrfs_free_extent(struct btrfs_trans_handle *trans, |
5851 | struct btrfs_root *root, | |
5852 | u64 bytenr, u64 num_bytes, u64 parent, | |
5853 | u64 root_objectid, u64 owner_objectid, | |
5854 | u64 owner_offset, int refs_to_drop, | |
fcebe456 JB |
5855 | struct btrfs_delayed_extent_op *extent_op, |
5856 | int no_quota) | |
a28ec197 | 5857 | { |
e2fa7227 | 5858 | struct btrfs_key key; |
5d4f98a2 | 5859 | struct btrfs_path *path; |
1261ec42 CM |
5860 | struct btrfs_fs_info *info = root->fs_info; |
5861 | struct btrfs_root *extent_root = info->extent_root; | |
5f39d397 | 5862 | struct extent_buffer *leaf; |
5d4f98a2 YZ |
5863 | struct btrfs_extent_item *ei; |
5864 | struct btrfs_extent_inline_ref *iref; | |
a28ec197 | 5865 | int ret; |
5d4f98a2 | 5866 | int is_data; |
952fccac CM |
5867 | int extent_slot = 0; |
5868 | int found_extent = 0; | |
5869 | int num_to_del = 1; | |
5d4f98a2 YZ |
5870 | u32 item_size; |
5871 | u64 refs; | |
fcebe456 JB |
5872 | int last_ref = 0; |
5873 | enum btrfs_qgroup_operation_type type = BTRFS_QGROUP_OPER_SUB_EXCL; | |
3173a18f JB |
5874 | bool skinny_metadata = btrfs_fs_incompat(root->fs_info, |
5875 | SKINNY_METADATA); | |
037e6390 | 5876 | |
fcebe456 JB |
5877 | if (!info->quota_enabled || !is_fstree(root_objectid)) |
5878 | no_quota = 1; | |
5879 | ||
5caf2a00 | 5880 | path = btrfs_alloc_path(); |
54aa1f4d CM |
5881 | if (!path) |
5882 | return -ENOMEM; | |
5f26f772 | 5883 | |
3c12ac72 | 5884 | path->reada = 1; |
b9473439 | 5885 | path->leave_spinning = 1; |
5d4f98a2 YZ |
5886 | |
5887 | is_data = owner_objectid >= BTRFS_FIRST_FREE_OBJECTID; | |
5888 | BUG_ON(!is_data && refs_to_drop != 1); | |
5889 | ||
3173a18f JB |
5890 | if (is_data) |
5891 | skinny_metadata = 0; | |
5892 | ||
5d4f98a2 YZ |
5893 | ret = lookup_extent_backref(trans, extent_root, path, &iref, |
5894 | bytenr, num_bytes, parent, | |
5895 | root_objectid, owner_objectid, | |
5896 | owner_offset); | |
7bb86316 | 5897 | if (ret == 0) { |
952fccac | 5898 | extent_slot = path->slots[0]; |
5d4f98a2 YZ |
5899 | while (extent_slot >= 0) { |
5900 | btrfs_item_key_to_cpu(path->nodes[0], &key, | |
952fccac | 5901 | extent_slot); |
5d4f98a2 | 5902 | if (key.objectid != bytenr) |
952fccac | 5903 | break; |
5d4f98a2 YZ |
5904 | if (key.type == BTRFS_EXTENT_ITEM_KEY && |
5905 | key.offset == num_bytes) { | |
952fccac CM |
5906 | found_extent = 1; |
5907 | break; | |
5908 | } | |
3173a18f JB |
5909 | if (key.type == BTRFS_METADATA_ITEM_KEY && |
5910 | key.offset == owner_objectid) { | |
5911 | found_extent = 1; | |
5912 | break; | |
5913 | } | |
952fccac CM |
5914 | if (path->slots[0] - extent_slot > 5) |
5915 | break; | |
5d4f98a2 | 5916 | extent_slot--; |
952fccac | 5917 | } |
5d4f98a2 YZ |
5918 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 |
5919 | item_size = btrfs_item_size_nr(path->nodes[0], extent_slot); | |
5920 | if (found_extent && item_size < sizeof(*ei)) | |
5921 | found_extent = 0; | |
5922 | #endif | |
31840ae1 | 5923 | if (!found_extent) { |
5d4f98a2 | 5924 | BUG_ON(iref); |
56bec294 | 5925 | ret = remove_extent_backref(trans, extent_root, path, |
5d4f98a2 | 5926 | NULL, refs_to_drop, |
fcebe456 | 5927 | is_data, &last_ref); |
005d6427 DS |
5928 | if (ret) { |
5929 | btrfs_abort_transaction(trans, extent_root, ret); | |
5930 | goto out; | |
5931 | } | |
b3b4aa74 | 5932 | btrfs_release_path(path); |
b9473439 | 5933 | path->leave_spinning = 1; |
5d4f98a2 YZ |
5934 | |
5935 | key.objectid = bytenr; | |
5936 | key.type = BTRFS_EXTENT_ITEM_KEY; | |
5937 | key.offset = num_bytes; | |
5938 | ||
3173a18f JB |
5939 | if (!is_data && skinny_metadata) { |
5940 | key.type = BTRFS_METADATA_ITEM_KEY; | |
5941 | key.offset = owner_objectid; | |
5942 | } | |
5943 | ||
31840ae1 ZY |
5944 | ret = btrfs_search_slot(trans, extent_root, |
5945 | &key, path, -1, 1); | |
3173a18f JB |
5946 | if (ret > 0 && skinny_metadata && path->slots[0]) { |
5947 | /* | |
5948 | * Couldn't find our skinny metadata item, | |
5949 | * see if we have ye olde extent item. | |
5950 | */ | |
5951 | path->slots[0]--; | |
5952 | btrfs_item_key_to_cpu(path->nodes[0], &key, | |
5953 | path->slots[0]); | |
5954 | if (key.objectid == bytenr && | |
5955 | key.type == BTRFS_EXTENT_ITEM_KEY && | |
5956 | key.offset == num_bytes) | |
5957 | ret = 0; | |
5958 | } | |
5959 | ||
5960 | if (ret > 0 && skinny_metadata) { | |
5961 | skinny_metadata = false; | |
9ce49a0b | 5962 | key.objectid = bytenr; |
3173a18f JB |
5963 | key.type = BTRFS_EXTENT_ITEM_KEY; |
5964 | key.offset = num_bytes; | |
5965 | btrfs_release_path(path); | |
5966 | ret = btrfs_search_slot(trans, extent_root, | |
5967 | &key, path, -1, 1); | |
5968 | } | |
5969 | ||
f3465ca4 | 5970 | if (ret) { |
c2cf52eb | 5971 | btrfs_err(info, "umm, got %d back from search, was looking for %llu", |
c1c9ff7c | 5972 | ret, bytenr); |
b783e62d JB |
5973 | if (ret > 0) |
5974 | btrfs_print_leaf(extent_root, | |
5975 | path->nodes[0]); | |
f3465ca4 | 5976 | } |
005d6427 DS |
5977 | if (ret < 0) { |
5978 | btrfs_abort_transaction(trans, extent_root, ret); | |
5979 | goto out; | |
5980 | } | |
31840ae1 ZY |
5981 | extent_slot = path->slots[0]; |
5982 | } | |
fae7f21c | 5983 | } else if (WARN_ON(ret == -ENOENT)) { |
7bb86316 | 5984 | btrfs_print_leaf(extent_root, path->nodes[0]); |
c2cf52eb SK |
5985 | btrfs_err(info, |
5986 | "unable to find ref byte nr %llu parent %llu root %llu owner %llu offset %llu", | |
c1c9ff7c GU |
5987 | bytenr, parent, root_objectid, owner_objectid, |
5988 | owner_offset); | |
c4a050bb JB |
5989 | btrfs_abort_transaction(trans, extent_root, ret); |
5990 | goto out; | |
79787eaa | 5991 | } else { |
005d6427 DS |
5992 | btrfs_abort_transaction(trans, extent_root, ret); |
5993 | goto out; | |
7bb86316 | 5994 | } |
5f39d397 CM |
5995 | |
5996 | leaf = path->nodes[0]; | |
5d4f98a2 YZ |
5997 | item_size = btrfs_item_size_nr(leaf, extent_slot); |
5998 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
5999 | if (item_size < sizeof(*ei)) { | |
6000 | BUG_ON(found_extent || extent_slot != path->slots[0]); | |
6001 | ret = convert_extent_item_v0(trans, extent_root, path, | |
6002 | owner_objectid, 0); | |
005d6427 DS |
6003 | if (ret < 0) { |
6004 | btrfs_abort_transaction(trans, extent_root, ret); | |
6005 | goto out; | |
6006 | } | |
5d4f98a2 | 6007 | |
b3b4aa74 | 6008 | btrfs_release_path(path); |
5d4f98a2 YZ |
6009 | path->leave_spinning = 1; |
6010 | ||
6011 | key.objectid = bytenr; | |
6012 | key.type = BTRFS_EXTENT_ITEM_KEY; | |
6013 | key.offset = num_bytes; | |
6014 | ||
6015 | ret = btrfs_search_slot(trans, extent_root, &key, path, | |
6016 | -1, 1); | |
6017 | if (ret) { | |
c2cf52eb | 6018 | btrfs_err(info, "umm, got %d back from search, was looking for %llu", |
c1c9ff7c | 6019 | ret, bytenr); |
5d4f98a2 YZ |
6020 | btrfs_print_leaf(extent_root, path->nodes[0]); |
6021 | } | |
005d6427 DS |
6022 | if (ret < 0) { |
6023 | btrfs_abort_transaction(trans, extent_root, ret); | |
6024 | goto out; | |
6025 | } | |
6026 | ||
5d4f98a2 YZ |
6027 | extent_slot = path->slots[0]; |
6028 | leaf = path->nodes[0]; | |
6029 | item_size = btrfs_item_size_nr(leaf, extent_slot); | |
6030 | } | |
6031 | #endif | |
6032 | BUG_ON(item_size < sizeof(*ei)); | |
952fccac | 6033 | ei = btrfs_item_ptr(leaf, extent_slot, |
123abc88 | 6034 | struct btrfs_extent_item); |
3173a18f JB |
6035 | if (owner_objectid < BTRFS_FIRST_FREE_OBJECTID && |
6036 | key.type == BTRFS_EXTENT_ITEM_KEY) { | |
5d4f98a2 YZ |
6037 | struct btrfs_tree_block_info *bi; |
6038 | BUG_ON(item_size < sizeof(*ei) + sizeof(*bi)); | |
6039 | bi = (struct btrfs_tree_block_info *)(ei + 1); | |
6040 | WARN_ON(owner_objectid != btrfs_tree_block_level(leaf, bi)); | |
6041 | } | |
56bec294 | 6042 | |
5d4f98a2 | 6043 | refs = btrfs_extent_refs(leaf, ei); |
32b02538 JB |
6044 | if (refs < refs_to_drop) { |
6045 | btrfs_err(info, "trying to drop %d refs but we only have %Lu " | |
351fd353 | 6046 | "for bytenr %Lu", refs_to_drop, refs, bytenr); |
32b02538 JB |
6047 | ret = -EINVAL; |
6048 | btrfs_abort_transaction(trans, extent_root, ret); | |
6049 | goto out; | |
6050 | } | |
56bec294 | 6051 | refs -= refs_to_drop; |
5f39d397 | 6052 | |
5d4f98a2 | 6053 | if (refs > 0) { |
fcebe456 | 6054 | type = BTRFS_QGROUP_OPER_SUB_SHARED; |
5d4f98a2 YZ |
6055 | if (extent_op) |
6056 | __run_delayed_extent_op(extent_op, leaf, ei); | |
6057 | /* | |
6058 | * In the case of inline back ref, reference count will | |
6059 | * be updated by remove_extent_backref | |
952fccac | 6060 | */ |
5d4f98a2 YZ |
6061 | if (iref) { |
6062 | BUG_ON(!found_extent); | |
6063 | } else { | |
6064 | btrfs_set_extent_refs(leaf, ei, refs); | |
6065 | btrfs_mark_buffer_dirty(leaf); | |
6066 | } | |
6067 | if (found_extent) { | |
6068 | ret = remove_extent_backref(trans, extent_root, path, | |
6069 | iref, refs_to_drop, | |
fcebe456 | 6070 | is_data, &last_ref); |
005d6427 DS |
6071 | if (ret) { |
6072 | btrfs_abort_transaction(trans, extent_root, ret); | |
6073 | goto out; | |
6074 | } | |
952fccac | 6075 | } |
b150a4f1 JB |
6076 | add_pinned_bytes(root->fs_info, -num_bytes, owner_objectid, |
6077 | root_objectid); | |
5d4f98a2 | 6078 | } else { |
5d4f98a2 YZ |
6079 | if (found_extent) { |
6080 | BUG_ON(is_data && refs_to_drop != | |
6081 | extent_data_ref_count(root, path, iref)); | |
6082 | if (iref) { | |
6083 | BUG_ON(path->slots[0] != extent_slot); | |
6084 | } else { | |
6085 | BUG_ON(path->slots[0] != extent_slot + 1); | |
6086 | path->slots[0] = extent_slot; | |
6087 | num_to_del = 2; | |
6088 | } | |
78fae27e | 6089 | } |
b9473439 | 6090 | |
fcebe456 | 6091 | last_ref = 1; |
952fccac CM |
6092 | ret = btrfs_del_items(trans, extent_root, path, path->slots[0], |
6093 | num_to_del); | |
005d6427 DS |
6094 | if (ret) { |
6095 | btrfs_abort_transaction(trans, extent_root, ret); | |
6096 | goto out; | |
6097 | } | |
b3b4aa74 | 6098 | btrfs_release_path(path); |
21af804c | 6099 | |
5d4f98a2 | 6100 | if (is_data) { |
459931ec | 6101 | ret = btrfs_del_csums(trans, root, bytenr, num_bytes); |
005d6427 DS |
6102 | if (ret) { |
6103 | btrfs_abort_transaction(trans, extent_root, ret); | |
6104 | goto out; | |
6105 | } | |
459931ec CM |
6106 | } |
6107 | ||
ce93ec54 | 6108 | ret = update_block_group(trans, root, bytenr, num_bytes, 0); |
005d6427 DS |
6109 | if (ret) { |
6110 | btrfs_abort_transaction(trans, extent_root, ret); | |
6111 | goto out; | |
6112 | } | |
a28ec197 | 6113 | } |
fcebe456 JB |
6114 | btrfs_release_path(path); |
6115 | ||
6116 | /* Deal with the quota accounting */ | |
6117 | if (!ret && last_ref && !no_quota) { | |
6118 | int mod_seq = 0; | |
6119 | ||
6120 | if (owner_objectid >= BTRFS_FIRST_FREE_OBJECTID && | |
6121 | type == BTRFS_QGROUP_OPER_SUB_SHARED) | |
6122 | mod_seq = 1; | |
6123 | ||
6124 | ret = btrfs_qgroup_record_ref(trans, info, root_objectid, | |
6125 | bytenr, num_bytes, type, | |
6126 | mod_seq); | |
6127 | } | |
79787eaa | 6128 | out: |
5caf2a00 | 6129 | btrfs_free_path(path); |
a28ec197 CM |
6130 | return ret; |
6131 | } | |
6132 | ||
1887be66 | 6133 | /* |
f0486c68 | 6134 | * when we free an block, it is possible (and likely) that we free the last |
1887be66 CM |
6135 | * delayed ref for that extent as well. This searches the delayed ref tree for |
6136 | * a given extent, and if there are no other delayed refs to be processed, it | |
6137 | * removes it from the tree. | |
6138 | */ | |
6139 | static noinline int check_ref_cleanup(struct btrfs_trans_handle *trans, | |
6140 | struct btrfs_root *root, u64 bytenr) | |
6141 | { | |
6142 | struct btrfs_delayed_ref_head *head; | |
6143 | struct btrfs_delayed_ref_root *delayed_refs; | |
f0486c68 | 6144 | int ret = 0; |
1887be66 CM |
6145 | |
6146 | delayed_refs = &trans->transaction->delayed_refs; | |
6147 | spin_lock(&delayed_refs->lock); | |
6148 | head = btrfs_find_delayed_ref_head(trans, bytenr); | |
6149 | if (!head) | |
cf93da7b | 6150 | goto out_delayed_unlock; |
1887be66 | 6151 | |
d7df2c79 JB |
6152 | spin_lock(&head->lock); |
6153 | if (rb_first(&head->ref_root)) | |
1887be66 CM |
6154 | goto out; |
6155 | ||
5d4f98a2 YZ |
6156 | if (head->extent_op) { |
6157 | if (!head->must_insert_reserved) | |
6158 | goto out; | |
78a6184a | 6159 | btrfs_free_delayed_extent_op(head->extent_op); |
5d4f98a2 YZ |
6160 | head->extent_op = NULL; |
6161 | } | |
6162 | ||
1887be66 CM |
6163 | /* |
6164 | * waiting for the lock here would deadlock. If someone else has it | |
6165 | * locked they are already in the process of dropping it anyway | |
6166 | */ | |
6167 | if (!mutex_trylock(&head->mutex)) | |
6168 | goto out; | |
6169 | ||
6170 | /* | |
6171 | * at this point we have a head with no other entries. Go | |
6172 | * ahead and process it. | |
6173 | */ | |
6174 | head->node.in_tree = 0; | |
c46effa6 | 6175 | rb_erase(&head->href_node, &delayed_refs->href_root); |
c3e69d58 | 6176 | |
d7df2c79 | 6177 | atomic_dec(&delayed_refs->num_entries); |
1887be66 CM |
6178 | |
6179 | /* | |
6180 | * we don't take a ref on the node because we're removing it from the | |
6181 | * tree, so we just steal the ref the tree was holding. | |
6182 | */ | |
c3e69d58 | 6183 | delayed_refs->num_heads--; |
d7df2c79 | 6184 | if (head->processing == 0) |
c3e69d58 | 6185 | delayed_refs->num_heads_ready--; |
d7df2c79 JB |
6186 | head->processing = 0; |
6187 | spin_unlock(&head->lock); | |
1887be66 CM |
6188 | spin_unlock(&delayed_refs->lock); |
6189 | ||
f0486c68 YZ |
6190 | BUG_ON(head->extent_op); |
6191 | if (head->must_insert_reserved) | |
6192 | ret = 1; | |
6193 | ||
6194 | mutex_unlock(&head->mutex); | |
1887be66 | 6195 | btrfs_put_delayed_ref(&head->node); |
f0486c68 | 6196 | return ret; |
1887be66 | 6197 | out: |
d7df2c79 | 6198 | spin_unlock(&head->lock); |
cf93da7b CM |
6199 | |
6200 | out_delayed_unlock: | |
1887be66 CM |
6201 | spin_unlock(&delayed_refs->lock); |
6202 | return 0; | |
6203 | } | |
6204 | ||
f0486c68 YZ |
6205 | void btrfs_free_tree_block(struct btrfs_trans_handle *trans, |
6206 | struct btrfs_root *root, | |
6207 | struct extent_buffer *buf, | |
5581a51a | 6208 | u64 parent, int last_ref) |
f0486c68 | 6209 | { |
b150a4f1 | 6210 | int pin = 1; |
f0486c68 YZ |
6211 | int ret; |
6212 | ||
6213 | if (root->root_key.objectid != BTRFS_TREE_LOG_OBJECTID) { | |
66d7e7f0 AJ |
6214 | ret = btrfs_add_delayed_tree_ref(root->fs_info, trans, |
6215 | buf->start, buf->len, | |
6216 | parent, root->root_key.objectid, | |
6217 | btrfs_header_level(buf), | |
5581a51a | 6218 | BTRFS_DROP_DELAYED_REF, NULL, 0); |
79787eaa | 6219 | BUG_ON(ret); /* -ENOMEM */ |
f0486c68 YZ |
6220 | } |
6221 | ||
6222 | if (!last_ref) | |
6223 | return; | |
6224 | ||
f0486c68 | 6225 | if (btrfs_header_generation(buf) == trans->transid) { |
6219872d FM |
6226 | struct btrfs_block_group_cache *cache; |
6227 | ||
f0486c68 YZ |
6228 | if (root->root_key.objectid != BTRFS_TREE_LOG_OBJECTID) { |
6229 | ret = check_ref_cleanup(trans, root, buf->start); | |
6230 | if (!ret) | |
37be25bc | 6231 | goto out; |
f0486c68 YZ |
6232 | } |
6233 | ||
6219872d FM |
6234 | cache = btrfs_lookup_block_group(root->fs_info, buf->start); |
6235 | ||
f0486c68 YZ |
6236 | if (btrfs_header_flag(buf, BTRFS_HEADER_FLAG_WRITTEN)) { |
6237 | pin_down_extent(root, cache, buf->start, buf->len, 1); | |
6219872d | 6238 | btrfs_put_block_group(cache); |
37be25bc | 6239 | goto out; |
f0486c68 YZ |
6240 | } |
6241 | ||
6242 | WARN_ON(test_bit(EXTENT_BUFFER_DIRTY, &buf->bflags)); | |
6243 | ||
6244 | btrfs_add_free_space(cache, buf->start, buf->len); | |
e570fd27 | 6245 | btrfs_update_reserved_bytes(cache, buf->len, RESERVE_FREE, 0); |
6219872d | 6246 | btrfs_put_block_group(cache); |
0be5dc67 | 6247 | trace_btrfs_reserved_extent_free(root, buf->start, buf->len); |
b150a4f1 | 6248 | pin = 0; |
f0486c68 YZ |
6249 | } |
6250 | out: | |
b150a4f1 JB |
6251 | if (pin) |
6252 | add_pinned_bytes(root->fs_info, buf->len, | |
6253 | btrfs_header_level(buf), | |
6254 | root->root_key.objectid); | |
6255 | ||
a826d6dc JB |
6256 | /* |
6257 | * Deleting the buffer, clear the corrupt flag since it doesn't matter | |
6258 | * anymore. | |
6259 | */ | |
6260 | clear_bit(EXTENT_BUFFER_CORRUPT, &buf->bflags); | |
f0486c68 YZ |
6261 | } |
6262 | ||
79787eaa | 6263 | /* Can return -ENOMEM */ |
66d7e7f0 AJ |
6264 | int btrfs_free_extent(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
6265 | u64 bytenr, u64 num_bytes, u64 parent, u64 root_objectid, | |
fcebe456 | 6266 | u64 owner, u64 offset, int no_quota) |
925baedd CM |
6267 | { |
6268 | int ret; | |
66d7e7f0 | 6269 | struct btrfs_fs_info *fs_info = root->fs_info; |
925baedd | 6270 | |
fccb84c9 | 6271 | if (btrfs_test_is_dummy_root(root)) |
faa2dbf0 | 6272 | return 0; |
fccb84c9 | 6273 | |
b150a4f1 JB |
6274 | add_pinned_bytes(root->fs_info, num_bytes, owner, root_objectid); |
6275 | ||
56bec294 CM |
6276 | /* |
6277 | * tree log blocks never actually go into the extent allocation | |
6278 | * tree, just update pinning info and exit early. | |
56bec294 | 6279 | */ |
5d4f98a2 YZ |
6280 | if (root_objectid == BTRFS_TREE_LOG_OBJECTID) { |
6281 | WARN_ON(owner >= BTRFS_FIRST_FREE_OBJECTID); | |
b9473439 | 6282 | /* unlocks the pinned mutex */ |
11833d66 | 6283 | btrfs_pin_extent(root, bytenr, num_bytes, 1); |
56bec294 | 6284 | ret = 0; |
5d4f98a2 | 6285 | } else if (owner < BTRFS_FIRST_FREE_OBJECTID) { |
66d7e7f0 AJ |
6286 | ret = btrfs_add_delayed_tree_ref(fs_info, trans, bytenr, |
6287 | num_bytes, | |
5d4f98a2 | 6288 | parent, root_objectid, (int)owner, |
fcebe456 | 6289 | BTRFS_DROP_DELAYED_REF, NULL, no_quota); |
5d4f98a2 | 6290 | } else { |
66d7e7f0 AJ |
6291 | ret = btrfs_add_delayed_data_ref(fs_info, trans, bytenr, |
6292 | num_bytes, | |
6293 | parent, root_objectid, owner, | |
6294 | offset, BTRFS_DROP_DELAYED_REF, | |
fcebe456 | 6295 | NULL, no_quota); |
56bec294 | 6296 | } |
925baedd CM |
6297 | return ret; |
6298 | } | |
6299 | ||
817d52f8 JB |
6300 | /* |
6301 | * when we wait for progress in the block group caching, its because | |
6302 | * our allocation attempt failed at least once. So, we must sleep | |
6303 | * and let some progress happen before we try again. | |
6304 | * | |
6305 | * This function will sleep at least once waiting for new free space to | |
6306 | * show up, and then it will check the block group free space numbers | |
6307 | * for our min num_bytes. Another option is to have it go ahead | |
6308 | * and look in the rbtree for a free extent of a given size, but this | |
6309 | * is a good start. | |
36cce922 JB |
6310 | * |
6311 | * Callers of this must check if cache->cached == BTRFS_CACHE_ERROR before using | |
6312 | * any of the information in this block group. | |
817d52f8 | 6313 | */ |
36cce922 | 6314 | static noinline void |
817d52f8 JB |
6315 | wait_block_group_cache_progress(struct btrfs_block_group_cache *cache, |
6316 | u64 num_bytes) | |
6317 | { | |
11833d66 | 6318 | struct btrfs_caching_control *caching_ctl; |
817d52f8 | 6319 | |
11833d66 YZ |
6320 | caching_ctl = get_caching_control(cache); |
6321 | if (!caching_ctl) | |
36cce922 | 6322 | return; |
817d52f8 | 6323 | |
11833d66 | 6324 | wait_event(caching_ctl->wait, block_group_cache_done(cache) || |
34d52cb6 | 6325 | (cache->free_space_ctl->free_space >= num_bytes)); |
11833d66 YZ |
6326 | |
6327 | put_caching_control(caching_ctl); | |
11833d66 YZ |
6328 | } |
6329 | ||
6330 | static noinline int | |
6331 | wait_block_group_cache_done(struct btrfs_block_group_cache *cache) | |
6332 | { | |
6333 | struct btrfs_caching_control *caching_ctl; | |
36cce922 | 6334 | int ret = 0; |
11833d66 YZ |
6335 | |
6336 | caching_ctl = get_caching_control(cache); | |
6337 | if (!caching_ctl) | |
36cce922 | 6338 | return (cache->cached == BTRFS_CACHE_ERROR) ? -EIO : 0; |
11833d66 YZ |
6339 | |
6340 | wait_event(caching_ctl->wait, block_group_cache_done(cache)); | |
36cce922 JB |
6341 | if (cache->cached == BTRFS_CACHE_ERROR) |
6342 | ret = -EIO; | |
11833d66 | 6343 | put_caching_control(caching_ctl); |
36cce922 | 6344 | return ret; |
817d52f8 JB |
6345 | } |
6346 | ||
31e50229 | 6347 | int __get_raid_index(u64 flags) |
b742bb82 | 6348 | { |
7738a53a | 6349 | if (flags & BTRFS_BLOCK_GROUP_RAID10) |
e6ec716f | 6350 | return BTRFS_RAID_RAID10; |
7738a53a | 6351 | else if (flags & BTRFS_BLOCK_GROUP_RAID1) |
e6ec716f | 6352 | return BTRFS_RAID_RAID1; |
7738a53a | 6353 | else if (flags & BTRFS_BLOCK_GROUP_DUP) |
e6ec716f | 6354 | return BTRFS_RAID_DUP; |
7738a53a | 6355 | else if (flags & BTRFS_BLOCK_GROUP_RAID0) |
e6ec716f | 6356 | return BTRFS_RAID_RAID0; |
53b381b3 | 6357 | else if (flags & BTRFS_BLOCK_GROUP_RAID5) |
e942f883 | 6358 | return BTRFS_RAID_RAID5; |
53b381b3 | 6359 | else if (flags & BTRFS_BLOCK_GROUP_RAID6) |
e942f883 | 6360 | return BTRFS_RAID_RAID6; |
7738a53a | 6361 | |
e942f883 | 6362 | return BTRFS_RAID_SINGLE; /* BTRFS_BLOCK_GROUP_SINGLE */ |
b742bb82 YZ |
6363 | } |
6364 | ||
6ab0a202 | 6365 | int get_block_group_index(struct btrfs_block_group_cache *cache) |
7738a53a | 6366 | { |
31e50229 | 6367 | return __get_raid_index(cache->flags); |
7738a53a ID |
6368 | } |
6369 | ||
6ab0a202 JM |
6370 | static const char *btrfs_raid_type_names[BTRFS_NR_RAID_TYPES] = { |
6371 | [BTRFS_RAID_RAID10] = "raid10", | |
6372 | [BTRFS_RAID_RAID1] = "raid1", | |
6373 | [BTRFS_RAID_DUP] = "dup", | |
6374 | [BTRFS_RAID_RAID0] = "raid0", | |
6375 | [BTRFS_RAID_SINGLE] = "single", | |
6376 | [BTRFS_RAID_RAID5] = "raid5", | |
6377 | [BTRFS_RAID_RAID6] = "raid6", | |
6378 | }; | |
6379 | ||
1b8e5df6 | 6380 | static const char *get_raid_name(enum btrfs_raid_types type) |
6ab0a202 JM |
6381 | { |
6382 | if (type >= BTRFS_NR_RAID_TYPES) | |
6383 | return NULL; | |
6384 | ||
6385 | return btrfs_raid_type_names[type]; | |
6386 | } | |
6387 | ||
817d52f8 | 6388 | enum btrfs_loop_type { |
285ff5af JB |
6389 | LOOP_CACHING_NOWAIT = 0, |
6390 | LOOP_CACHING_WAIT = 1, | |
6391 | LOOP_ALLOC_CHUNK = 2, | |
6392 | LOOP_NO_EMPTY_SIZE = 3, | |
817d52f8 JB |
6393 | }; |
6394 | ||
e570fd27 MX |
6395 | static inline void |
6396 | btrfs_lock_block_group(struct btrfs_block_group_cache *cache, | |
6397 | int delalloc) | |
6398 | { | |
6399 | if (delalloc) | |
6400 | down_read(&cache->data_rwsem); | |
6401 | } | |
6402 | ||
6403 | static inline void | |
6404 | btrfs_grab_block_group(struct btrfs_block_group_cache *cache, | |
6405 | int delalloc) | |
6406 | { | |
6407 | btrfs_get_block_group(cache); | |
6408 | if (delalloc) | |
6409 | down_read(&cache->data_rwsem); | |
6410 | } | |
6411 | ||
6412 | static struct btrfs_block_group_cache * | |
6413 | btrfs_lock_cluster(struct btrfs_block_group_cache *block_group, | |
6414 | struct btrfs_free_cluster *cluster, | |
6415 | int delalloc) | |
6416 | { | |
6417 | struct btrfs_block_group_cache *used_bg; | |
6418 | bool locked = false; | |
6419 | again: | |
6420 | spin_lock(&cluster->refill_lock); | |
6421 | if (locked) { | |
6422 | if (used_bg == cluster->block_group) | |
6423 | return used_bg; | |
6424 | ||
6425 | up_read(&used_bg->data_rwsem); | |
6426 | btrfs_put_block_group(used_bg); | |
6427 | } | |
6428 | ||
6429 | used_bg = cluster->block_group; | |
6430 | if (!used_bg) | |
6431 | return NULL; | |
6432 | ||
6433 | if (used_bg == block_group) | |
6434 | return used_bg; | |
6435 | ||
6436 | btrfs_get_block_group(used_bg); | |
6437 | ||
6438 | if (!delalloc) | |
6439 | return used_bg; | |
6440 | ||
6441 | if (down_read_trylock(&used_bg->data_rwsem)) | |
6442 | return used_bg; | |
6443 | ||
6444 | spin_unlock(&cluster->refill_lock); | |
6445 | down_read(&used_bg->data_rwsem); | |
6446 | locked = true; | |
6447 | goto again; | |
6448 | } | |
6449 | ||
6450 | static inline void | |
6451 | btrfs_release_block_group(struct btrfs_block_group_cache *cache, | |
6452 | int delalloc) | |
6453 | { | |
6454 | if (delalloc) | |
6455 | up_read(&cache->data_rwsem); | |
6456 | btrfs_put_block_group(cache); | |
6457 | } | |
6458 | ||
fec577fb CM |
6459 | /* |
6460 | * walks the btree of allocated extents and find a hole of a given size. | |
6461 | * The key ins is changed to record the hole: | |
a4820398 | 6462 | * ins->objectid == start position |
62e2749e | 6463 | * ins->flags = BTRFS_EXTENT_ITEM_KEY |
a4820398 | 6464 | * ins->offset == the size of the hole. |
fec577fb | 6465 | * Any available blocks before search_start are skipped. |
a4820398 MX |
6466 | * |
6467 | * If there is no suitable free space, we will record the max size of | |
6468 | * the free space extent currently. | |
fec577fb | 6469 | */ |
00361589 | 6470 | static noinline int find_free_extent(struct btrfs_root *orig_root, |
98ed5174 | 6471 | u64 num_bytes, u64 empty_size, |
98ed5174 | 6472 | u64 hint_byte, struct btrfs_key *ins, |
e570fd27 | 6473 | u64 flags, int delalloc) |
fec577fb | 6474 | { |
80eb234a | 6475 | int ret = 0; |
d397712b | 6476 | struct btrfs_root *root = orig_root->fs_info->extent_root; |
fa9c0d79 | 6477 | struct btrfs_free_cluster *last_ptr = NULL; |
80eb234a | 6478 | struct btrfs_block_group_cache *block_group = NULL; |
81c9ad23 | 6479 | u64 search_start = 0; |
a4820398 | 6480 | u64 max_extent_size = 0; |
239b14b3 | 6481 | int empty_cluster = 2 * 1024 * 1024; |
80eb234a | 6482 | struct btrfs_space_info *space_info; |
fa9c0d79 | 6483 | int loop = 0; |
b6919a58 DS |
6484 | int index = __get_raid_index(flags); |
6485 | int alloc_type = (flags & BTRFS_BLOCK_GROUP_DATA) ? | |
fb25e914 | 6486 | RESERVE_ALLOC_NO_ACCOUNT : RESERVE_ALLOC; |
0a24325e | 6487 | bool failed_cluster_refill = false; |
1cdda9b8 | 6488 | bool failed_alloc = false; |
67377734 | 6489 | bool use_cluster = true; |
60d2adbb | 6490 | bool have_caching_bg = false; |
fec577fb | 6491 | |
db94535d | 6492 | WARN_ON(num_bytes < root->sectorsize); |
962a298f | 6493 | ins->type = BTRFS_EXTENT_ITEM_KEY; |
80eb234a JB |
6494 | ins->objectid = 0; |
6495 | ins->offset = 0; | |
b1a4d965 | 6496 | |
b6919a58 | 6497 | trace_find_free_extent(orig_root, num_bytes, empty_size, flags); |
3f7de037 | 6498 | |
b6919a58 | 6499 | space_info = __find_space_info(root->fs_info, flags); |
1b1d1f66 | 6500 | if (!space_info) { |
b6919a58 | 6501 | btrfs_err(root->fs_info, "No space info for %llu", flags); |
1b1d1f66 JB |
6502 | return -ENOSPC; |
6503 | } | |
2552d17e | 6504 | |
67377734 JB |
6505 | /* |
6506 | * If the space info is for both data and metadata it means we have a | |
6507 | * small filesystem and we can't use the clustering stuff. | |
6508 | */ | |
6509 | if (btrfs_mixed_space_info(space_info)) | |
6510 | use_cluster = false; | |
6511 | ||
b6919a58 | 6512 | if (flags & BTRFS_BLOCK_GROUP_METADATA && use_cluster) { |
fa9c0d79 | 6513 | last_ptr = &root->fs_info->meta_alloc_cluster; |
536ac8ae CM |
6514 | if (!btrfs_test_opt(root, SSD)) |
6515 | empty_cluster = 64 * 1024; | |
239b14b3 CM |
6516 | } |
6517 | ||
b6919a58 | 6518 | if ((flags & BTRFS_BLOCK_GROUP_DATA) && use_cluster && |
67377734 | 6519 | btrfs_test_opt(root, SSD)) { |
fa9c0d79 CM |
6520 | last_ptr = &root->fs_info->data_alloc_cluster; |
6521 | } | |
0f9dd46c | 6522 | |
239b14b3 | 6523 | if (last_ptr) { |
fa9c0d79 CM |
6524 | spin_lock(&last_ptr->lock); |
6525 | if (last_ptr->block_group) | |
6526 | hint_byte = last_ptr->window_start; | |
6527 | spin_unlock(&last_ptr->lock); | |
239b14b3 | 6528 | } |
fa9c0d79 | 6529 | |
a061fc8d | 6530 | search_start = max(search_start, first_logical_byte(root, 0)); |
239b14b3 | 6531 | search_start = max(search_start, hint_byte); |
0b86a832 | 6532 | |
817d52f8 | 6533 | if (!last_ptr) |
fa9c0d79 | 6534 | empty_cluster = 0; |
fa9c0d79 | 6535 | |
2552d17e | 6536 | if (search_start == hint_byte) { |
2552d17e JB |
6537 | block_group = btrfs_lookup_block_group(root->fs_info, |
6538 | search_start); | |
817d52f8 JB |
6539 | /* |
6540 | * we don't want to use the block group if it doesn't match our | |
6541 | * allocation bits, or if its not cached. | |
ccf0e725 JB |
6542 | * |
6543 | * However if we are re-searching with an ideal block group | |
6544 | * picked out then we don't care that the block group is cached. | |
817d52f8 | 6545 | */ |
b6919a58 | 6546 | if (block_group && block_group_bits(block_group, flags) && |
285ff5af | 6547 | block_group->cached != BTRFS_CACHE_NO) { |
2552d17e | 6548 | down_read(&space_info->groups_sem); |
44fb5511 CM |
6549 | if (list_empty(&block_group->list) || |
6550 | block_group->ro) { | |
6551 | /* | |
6552 | * someone is removing this block group, | |
6553 | * we can't jump into the have_block_group | |
6554 | * target because our list pointers are not | |
6555 | * valid | |
6556 | */ | |
6557 | btrfs_put_block_group(block_group); | |
6558 | up_read(&space_info->groups_sem); | |
ccf0e725 | 6559 | } else { |
b742bb82 | 6560 | index = get_block_group_index(block_group); |
e570fd27 | 6561 | btrfs_lock_block_group(block_group, delalloc); |
44fb5511 | 6562 | goto have_block_group; |
ccf0e725 | 6563 | } |
2552d17e | 6564 | } else if (block_group) { |
fa9c0d79 | 6565 | btrfs_put_block_group(block_group); |
2552d17e | 6566 | } |
42e70e7a | 6567 | } |
2552d17e | 6568 | search: |
60d2adbb | 6569 | have_caching_bg = false; |
80eb234a | 6570 | down_read(&space_info->groups_sem); |
b742bb82 YZ |
6571 | list_for_each_entry(block_group, &space_info->block_groups[index], |
6572 | list) { | |
6226cb0a | 6573 | u64 offset; |
817d52f8 | 6574 | int cached; |
8a1413a2 | 6575 | |
e570fd27 | 6576 | btrfs_grab_block_group(block_group, delalloc); |
2552d17e | 6577 | search_start = block_group->key.objectid; |
42e70e7a | 6578 | |
83a50de9 CM |
6579 | /* |
6580 | * this can happen if we end up cycling through all the | |
6581 | * raid types, but we want to make sure we only allocate | |
6582 | * for the proper type. | |
6583 | */ | |
b6919a58 | 6584 | if (!block_group_bits(block_group, flags)) { |
83a50de9 CM |
6585 | u64 extra = BTRFS_BLOCK_GROUP_DUP | |
6586 | BTRFS_BLOCK_GROUP_RAID1 | | |
53b381b3 DW |
6587 | BTRFS_BLOCK_GROUP_RAID5 | |
6588 | BTRFS_BLOCK_GROUP_RAID6 | | |
83a50de9 CM |
6589 | BTRFS_BLOCK_GROUP_RAID10; |
6590 | ||
6591 | /* | |
6592 | * if they asked for extra copies and this block group | |
6593 | * doesn't provide them, bail. This does allow us to | |
6594 | * fill raid0 from raid1. | |
6595 | */ | |
b6919a58 | 6596 | if ((flags & extra) && !(block_group->flags & extra)) |
83a50de9 CM |
6597 | goto loop; |
6598 | } | |
6599 | ||
2552d17e | 6600 | have_block_group: |
291c7d2f JB |
6601 | cached = block_group_cache_done(block_group); |
6602 | if (unlikely(!cached)) { | |
f6373bf3 | 6603 | ret = cache_block_group(block_group, 0); |
1d4284bd CM |
6604 | BUG_ON(ret < 0); |
6605 | ret = 0; | |
817d52f8 JB |
6606 | } |
6607 | ||
36cce922 JB |
6608 | if (unlikely(block_group->cached == BTRFS_CACHE_ERROR)) |
6609 | goto loop; | |
ea6a478e | 6610 | if (unlikely(block_group->ro)) |
2552d17e | 6611 | goto loop; |
0f9dd46c | 6612 | |
0a24325e | 6613 | /* |
062c05c4 AO |
6614 | * Ok we want to try and use the cluster allocator, so |
6615 | * lets look there | |
0a24325e | 6616 | */ |
062c05c4 | 6617 | if (last_ptr) { |
215a63d1 | 6618 | struct btrfs_block_group_cache *used_block_group; |
8de972b4 | 6619 | unsigned long aligned_cluster; |
fa9c0d79 CM |
6620 | /* |
6621 | * the refill lock keeps out other | |
6622 | * people trying to start a new cluster | |
6623 | */ | |
e570fd27 MX |
6624 | used_block_group = btrfs_lock_cluster(block_group, |
6625 | last_ptr, | |
6626 | delalloc); | |
6627 | if (!used_block_group) | |
44fb5511 | 6628 | goto refill_cluster; |
274bd4fb | 6629 | |
e570fd27 MX |
6630 | if (used_block_group != block_group && |
6631 | (used_block_group->ro || | |
6632 | !block_group_bits(used_block_group, flags))) | |
6633 | goto release_cluster; | |
44fb5511 | 6634 | |
274bd4fb | 6635 | offset = btrfs_alloc_from_cluster(used_block_group, |
a4820398 MX |
6636 | last_ptr, |
6637 | num_bytes, | |
6638 | used_block_group->key.objectid, | |
6639 | &max_extent_size); | |
fa9c0d79 CM |
6640 | if (offset) { |
6641 | /* we have a block, we're done */ | |
6642 | spin_unlock(&last_ptr->refill_lock); | |
3f7de037 | 6643 | trace_btrfs_reserve_extent_cluster(root, |
89d4346a MX |
6644 | used_block_group, |
6645 | search_start, num_bytes); | |
215a63d1 | 6646 | if (used_block_group != block_group) { |
e570fd27 MX |
6647 | btrfs_release_block_group(block_group, |
6648 | delalloc); | |
215a63d1 MX |
6649 | block_group = used_block_group; |
6650 | } | |
fa9c0d79 CM |
6651 | goto checks; |
6652 | } | |
6653 | ||
274bd4fb | 6654 | WARN_ON(last_ptr->block_group != used_block_group); |
e570fd27 | 6655 | release_cluster: |
062c05c4 AO |
6656 | /* If we are on LOOP_NO_EMPTY_SIZE, we can't |
6657 | * set up a new clusters, so lets just skip it | |
6658 | * and let the allocator find whatever block | |
6659 | * it can find. If we reach this point, we | |
6660 | * will have tried the cluster allocator | |
6661 | * plenty of times and not have found | |
6662 | * anything, so we are likely way too | |
6663 | * fragmented for the clustering stuff to find | |
a5f6f719 AO |
6664 | * anything. |
6665 | * | |
6666 | * However, if the cluster is taken from the | |
6667 | * current block group, release the cluster | |
6668 | * first, so that we stand a better chance of | |
6669 | * succeeding in the unclustered | |
6670 | * allocation. */ | |
6671 | if (loop >= LOOP_NO_EMPTY_SIZE && | |
e570fd27 | 6672 | used_block_group != block_group) { |
062c05c4 | 6673 | spin_unlock(&last_ptr->refill_lock); |
e570fd27 MX |
6674 | btrfs_release_block_group(used_block_group, |
6675 | delalloc); | |
062c05c4 AO |
6676 | goto unclustered_alloc; |
6677 | } | |
6678 | ||
fa9c0d79 CM |
6679 | /* |
6680 | * this cluster didn't work out, free it and | |
6681 | * start over | |
6682 | */ | |
6683 | btrfs_return_cluster_to_free_space(NULL, last_ptr); | |
6684 | ||
e570fd27 MX |
6685 | if (used_block_group != block_group) |
6686 | btrfs_release_block_group(used_block_group, | |
6687 | delalloc); | |
6688 | refill_cluster: | |
a5f6f719 AO |
6689 | if (loop >= LOOP_NO_EMPTY_SIZE) { |
6690 | spin_unlock(&last_ptr->refill_lock); | |
6691 | goto unclustered_alloc; | |
6692 | } | |
6693 | ||
8de972b4 CM |
6694 | aligned_cluster = max_t(unsigned long, |
6695 | empty_cluster + empty_size, | |
6696 | block_group->full_stripe_len); | |
6697 | ||
fa9c0d79 | 6698 | /* allocate a cluster in this block group */ |
00361589 JB |
6699 | ret = btrfs_find_space_cluster(root, block_group, |
6700 | last_ptr, search_start, | |
6701 | num_bytes, | |
6702 | aligned_cluster); | |
fa9c0d79 CM |
6703 | if (ret == 0) { |
6704 | /* | |
6705 | * now pull our allocation out of this | |
6706 | * cluster | |
6707 | */ | |
6708 | offset = btrfs_alloc_from_cluster(block_group, | |
a4820398 MX |
6709 | last_ptr, |
6710 | num_bytes, | |
6711 | search_start, | |
6712 | &max_extent_size); | |
fa9c0d79 CM |
6713 | if (offset) { |
6714 | /* we found one, proceed */ | |
6715 | spin_unlock(&last_ptr->refill_lock); | |
3f7de037 JB |
6716 | trace_btrfs_reserve_extent_cluster(root, |
6717 | block_group, search_start, | |
6718 | num_bytes); | |
fa9c0d79 CM |
6719 | goto checks; |
6720 | } | |
0a24325e JB |
6721 | } else if (!cached && loop > LOOP_CACHING_NOWAIT |
6722 | && !failed_cluster_refill) { | |
817d52f8 JB |
6723 | spin_unlock(&last_ptr->refill_lock); |
6724 | ||
0a24325e | 6725 | failed_cluster_refill = true; |
817d52f8 JB |
6726 | wait_block_group_cache_progress(block_group, |
6727 | num_bytes + empty_cluster + empty_size); | |
6728 | goto have_block_group; | |
fa9c0d79 | 6729 | } |
817d52f8 | 6730 | |
fa9c0d79 CM |
6731 | /* |
6732 | * at this point we either didn't find a cluster | |
6733 | * or we weren't able to allocate a block from our | |
6734 | * cluster. Free the cluster we've been trying | |
6735 | * to use, and go to the next block group | |
6736 | */ | |
0a24325e | 6737 | btrfs_return_cluster_to_free_space(NULL, last_ptr); |
fa9c0d79 | 6738 | spin_unlock(&last_ptr->refill_lock); |
0a24325e | 6739 | goto loop; |
fa9c0d79 CM |
6740 | } |
6741 | ||
062c05c4 | 6742 | unclustered_alloc: |
a5f6f719 AO |
6743 | spin_lock(&block_group->free_space_ctl->tree_lock); |
6744 | if (cached && | |
6745 | block_group->free_space_ctl->free_space < | |
6746 | num_bytes + empty_cluster + empty_size) { | |
a4820398 MX |
6747 | if (block_group->free_space_ctl->free_space > |
6748 | max_extent_size) | |
6749 | max_extent_size = | |
6750 | block_group->free_space_ctl->free_space; | |
a5f6f719 AO |
6751 | spin_unlock(&block_group->free_space_ctl->tree_lock); |
6752 | goto loop; | |
6753 | } | |
6754 | spin_unlock(&block_group->free_space_ctl->tree_lock); | |
6755 | ||
6226cb0a | 6756 | offset = btrfs_find_space_for_alloc(block_group, search_start, |
a4820398 MX |
6757 | num_bytes, empty_size, |
6758 | &max_extent_size); | |
1cdda9b8 JB |
6759 | /* |
6760 | * If we didn't find a chunk, and we haven't failed on this | |
6761 | * block group before, and this block group is in the middle of | |
6762 | * caching and we are ok with waiting, then go ahead and wait | |
6763 | * for progress to be made, and set failed_alloc to true. | |
6764 | * | |
6765 | * If failed_alloc is true then we've already waited on this | |
6766 | * block group once and should move on to the next block group. | |
6767 | */ | |
6768 | if (!offset && !failed_alloc && !cached && | |
6769 | loop > LOOP_CACHING_NOWAIT) { | |
817d52f8 | 6770 | wait_block_group_cache_progress(block_group, |
1cdda9b8 JB |
6771 | num_bytes + empty_size); |
6772 | failed_alloc = true; | |
817d52f8 | 6773 | goto have_block_group; |
1cdda9b8 | 6774 | } else if (!offset) { |
60d2adbb MX |
6775 | if (!cached) |
6776 | have_caching_bg = true; | |
1cdda9b8 | 6777 | goto loop; |
817d52f8 | 6778 | } |
fa9c0d79 | 6779 | checks: |
4e54b17a | 6780 | search_start = ALIGN(offset, root->stripesize); |
25179201 | 6781 | |
2552d17e JB |
6782 | /* move on to the next group */ |
6783 | if (search_start + num_bytes > | |
215a63d1 MX |
6784 | block_group->key.objectid + block_group->key.offset) { |
6785 | btrfs_add_free_space(block_group, offset, num_bytes); | |
2552d17e | 6786 | goto loop; |
6226cb0a | 6787 | } |
f5a31e16 | 6788 | |
f0486c68 | 6789 | if (offset < search_start) |
215a63d1 | 6790 | btrfs_add_free_space(block_group, offset, |
f0486c68 YZ |
6791 | search_start - offset); |
6792 | BUG_ON(offset > search_start); | |
2552d17e | 6793 | |
215a63d1 | 6794 | ret = btrfs_update_reserved_bytes(block_group, num_bytes, |
e570fd27 | 6795 | alloc_type, delalloc); |
f0486c68 | 6796 | if (ret == -EAGAIN) { |
215a63d1 | 6797 | btrfs_add_free_space(block_group, offset, num_bytes); |
2552d17e | 6798 | goto loop; |
0f9dd46c | 6799 | } |
0b86a832 | 6800 | |
f0486c68 | 6801 | /* we are all good, lets return */ |
2552d17e JB |
6802 | ins->objectid = search_start; |
6803 | ins->offset = num_bytes; | |
d2fb3437 | 6804 | |
3f7de037 JB |
6805 | trace_btrfs_reserve_extent(orig_root, block_group, |
6806 | search_start, num_bytes); | |
e570fd27 | 6807 | btrfs_release_block_group(block_group, delalloc); |
2552d17e JB |
6808 | break; |
6809 | loop: | |
0a24325e | 6810 | failed_cluster_refill = false; |
1cdda9b8 | 6811 | failed_alloc = false; |
b742bb82 | 6812 | BUG_ON(index != get_block_group_index(block_group)); |
e570fd27 | 6813 | btrfs_release_block_group(block_group, delalloc); |
2552d17e JB |
6814 | } |
6815 | up_read(&space_info->groups_sem); | |
6816 | ||
60d2adbb MX |
6817 | if (!ins->objectid && loop >= LOOP_CACHING_WAIT && have_caching_bg) |
6818 | goto search; | |
6819 | ||
b742bb82 YZ |
6820 | if (!ins->objectid && ++index < BTRFS_NR_RAID_TYPES) |
6821 | goto search; | |
6822 | ||
285ff5af | 6823 | /* |
ccf0e725 JB |
6824 | * LOOP_CACHING_NOWAIT, search partially cached block groups, kicking |
6825 | * caching kthreads as we move along | |
817d52f8 JB |
6826 | * LOOP_CACHING_WAIT, search everything, and wait if our bg is caching |
6827 | * LOOP_ALLOC_CHUNK, force a chunk allocation and try again | |
6828 | * LOOP_NO_EMPTY_SIZE, set empty_size and empty_cluster to 0 and try | |
6829 | * again | |
fa9c0d79 | 6830 | */ |
723bda20 | 6831 | if (!ins->objectid && loop < LOOP_NO_EMPTY_SIZE) { |
b742bb82 | 6832 | index = 0; |
723bda20 | 6833 | loop++; |
817d52f8 | 6834 | if (loop == LOOP_ALLOC_CHUNK) { |
00361589 | 6835 | struct btrfs_trans_handle *trans; |
f017f15f WS |
6836 | int exist = 0; |
6837 | ||
6838 | trans = current->journal_info; | |
6839 | if (trans) | |
6840 | exist = 1; | |
6841 | else | |
6842 | trans = btrfs_join_transaction(root); | |
00361589 | 6843 | |
00361589 JB |
6844 | if (IS_ERR(trans)) { |
6845 | ret = PTR_ERR(trans); | |
6846 | goto out; | |
6847 | } | |
6848 | ||
b6919a58 | 6849 | ret = do_chunk_alloc(trans, root, flags, |
ea658bad JB |
6850 | CHUNK_ALLOC_FORCE); |
6851 | /* | |
6852 | * Do not bail out on ENOSPC since we | |
6853 | * can do more things. | |
6854 | */ | |
00361589 | 6855 | if (ret < 0 && ret != -ENOSPC) |
ea658bad JB |
6856 | btrfs_abort_transaction(trans, |
6857 | root, ret); | |
00361589 JB |
6858 | else |
6859 | ret = 0; | |
f017f15f WS |
6860 | if (!exist) |
6861 | btrfs_end_transaction(trans, root); | |
00361589 | 6862 | if (ret) |
ea658bad | 6863 | goto out; |
2552d17e JB |
6864 | } |
6865 | ||
723bda20 JB |
6866 | if (loop == LOOP_NO_EMPTY_SIZE) { |
6867 | empty_size = 0; | |
6868 | empty_cluster = 0; | |
fa9c0d79 | 6869 | } |
723bda20 JB |
6870 | |
6871 | goto search; | |
2552d17e JB |
6872 | } else if (!ins->objectid) { |
6873 | ret = -ENOSPC; | |
d82a6f1d | 6874 | } else if (ins->objectid) { |
80eb234a | 6875 | ret = 0; |
be744175 | 6876 | } |
79787eaa | 6877 | out: |
a4820398 MX |
6878 | if (ret == -ENOSPC) |
6879 | ins->offset = max_extent_size; | |
0f70abe2 | 6880 | return ret; |
fec577fb | 6881 | } |
ec44a35c | 6882 | |
9ed74f2d JB |
6883 | static void dump_space_info(struct btrfs_space_info *info, u64 bytes, |
6884 | int dump_block_groups) | |
0f9dd46c JB |
6885 | { |
6886 | struct btrfs_block_group_cache *cache; | |
b742bb82 | 6887 | int index = 0; |
0f9dd46c | 6888 | |
9ed74f2d | 6889 | spin_lock(&info->lock); |
efe120a0 | 6890 | printk(KERN_INFO "BTRFS: space_info %llu has %llu free, is %sfull\n", |
c1c9ff7c GU |
6891 | info->flags, |
6892 | info->total_bytes - info->bytes_used - info->bytes_pinned - | |
6893 | info->bytes_reserved - info->bytes_readonly, | |
d397712b | 6894 | (info->full) ? "" : "not "); |
efe120a0 | 6895 | printk(KERN_INFO "BTRFS: space_info total=%llu, used=%llu, pinned=%llu, " |
8929ecfa | 6896 | "reserved=%llu, may_use=%llu, readonly=%llu\n", |
c1c9ff7c GU |
6897 | info->total_bytes, info->bytes_used, info->bytes_pinned, |
6898 | info->bytes_reserved, info->bytes_may_use, | |
6899 | info->bytes_readonly); | |
9ed74f2d JB |
6900 | spin_unlock(&info->lock); |
6901 | ||
6902 | if (!dump_block_groups) | |
6903 | return; | |
0f9dd46c | 6904 | |
80eb234a | 6905 | down_read(&info->groups_sem); |
b742bb82 YZ |
6906 | again: |
6907 | list_for_each_entry(cache, &info->block_groups[index], list) { | |
0f9dd46c | 6908 | spin_lock(&cache->lock); |
efe120a0 FH |
6909 | printk(KERN_INFO "BTRFS: " |
6910 | "block group %llu has %llu bytes, " | |
6911 | "%llu used %llu pinned %llu reserved %s\n", | |
c1c9ff7c GU |
6912 | cache->key.objectid, cache->key.offset, |
6913 | btrfs_block_group_used(&cache->item), cache->pinned, | |
6914 | cache->reserved, cache->ro ? "[readonly]" : ""); | |
0f9dd46c JB |
6915 | btrfs_dump_free_space(cache, bytes); |
6916 | spin_unlock(&cache->lock); | |
6917 | } | |
b742bb82 YZ |
6918 | if (++index < BTRFS_NR_RAID_TYPES) |
6919 | goto again; | |
80eb234a | 6920 | up_read(&info->groups_sem); |
0f9dd46c | 6921 | } |
e8569813 | 6922 | |
00361589 | 6923 | int btrfs_reserve_extent(struct btrfs_root *root, |
11833d66 YZ |
6924 | u64 num_bytes, u64 min_alloc_size, |
6925 | u64 empty_size, u64 hint_byte, | |
e570fd27 | 6926 | struct btrfs_key *ins, int is_data, int delalloc) |
fec577fb | 6927 | { |
9e622d6b | 6928 | bool final_tried = false; |
b6919a58 | 6929 | u64 flags; |
fec577fb | 6930 | int ret; |
925baedd | 6931 | |
b6919a58 | 6932 | flags = btrfs_get_alloc_profile(root, is_data); |
98d20f67 | 6933 | again: |
db94535d | 6934 | WARN_ON(num_bytes < root->sectorsize); |
00361589 | 6935 | ret = find_free_extent(root, num_bytes, empty_size, hint_byte, ins, |
e570fd27 | 6936 | flags, delalloc); |
3b951516 | 6937 | |
9e622d6b | 6938 | if (ret == -ENOSPC) { |
a4820398 MX |
6939 | if (!final_tried && ins->offset) { |
6940 | num_bytes = min(num_bytes >> 1, ins->offset); | |
24542bf7 | 6941 | num_bytes = round_down(num_bytes, root->sectorsize); |
9e622d6b | 6942 | num_bytes = max(num_bytes, min_alloc_size); |
9e622d6b MX |
6943 | if (num_bytes == min_alloc_size) |
6944 | final_tried = true; | |
6945 | goto again; | |
6946 | } else if (btrfs_test_opt(root, ENOSPC_DEBUG)) { | |
6947 | struct btrfs_space_info *sinfo; | |
6948 | ||
b6919a58 | 6949 | sinfo = __find_space_info(root->fs_info, flags); |
c2cf52eb | 6950 | btrfs_err(root->fs_info, "allocation failed flags %llu, wanted %llu", |
c1c9ff7c | 6951 | flags, num_bytes); |
53804280 JM |
6952 | if (sinfo) |
6953 | dump_space_info(sinfo, num_bytes, 1); | |
9e622d6b | 6954 | } |
925baedd | 6955 | } |
0f9dd46c JB |
6956 | |
6957 | return ret; | |
e6dcd2dc CM |
6958 | } |
6959 | ||
e688b725 | 6960 | static int __btrfs_free_reserved_extent(struct btrfs_root *root, |
e570fd27 MX |
6961 | u64 start, u64 len, |
6962 | int pin, int delalloc) | |
65b51a00 | 6963 | { |
0f9dd46c | 6964 | struct btrfs_block_group_cache *cache; |
1f3c79a2 | 6965 | int ret = 0; |
0f9dd46c | 6966 | |
0f9dd46c JB |
6967 | cache = btrfs_lookup_block_group(root->fs_info, start); |
6968 | if (!cache) { | |
c2cf52eb | 6969 | btrfs_err(root->fs_info, "Unable to find block group for %llu", |
c1c9ff7c | 6970 | start); |
0f9dd46c JB |
6971 | return -ENOSPC; |
6972 | } | |
1f3c79a2 | 6973 | |
e688b725 CM |
6974 | if (pin) |
6975 | pin_down_extent(root, cache, start, len, 1); | |
6976 | else { | |
dcc82f47 FM |
6977 | if (btrfs_test_opt(root, DISCARD)) |
6978 | ret = btrfs_discard_extent(root, start, len, NULL); | |
e688b725 | 6979 | btrfs_add_free_space(cache, start, len); |
e570fd27 | 6980 | btrfs_update_reserved_bytes(cache, len, RESERVE_FREE, delalloc); |
e688b725 | 6981 | } |
fa9c0d79 | 6982 | btrfs_put_block_group(cache); |
817d52f8 | 6983 | |
1abe9b8a | 6984 | trace_btrfs_reserved_extent_free(root, start, len); |
6985 | ||
e6dcd2dc CM |
6986 | return ret; |
6987 | } | |
6988 | ||
e688b725 | 6989 | int btrfs_free_reserved_extent(struct btrfs_root *root, |
e570fd27 | 6990 | u64 start, u64 len, int delalloc) |
e688b725 | 6991 | { |
e570fd27 | 6992 | return __btrfs_free_reserved_extent(root, start, len, 0, delalloc); |
e688b725 CM |
6993 | } |
6994 | ||
6995 | int btrfs_free_and_pin_reserved_extent(struct btrfs_root *root, | |
6996 | u64 start, u64 len) | |
6997 | { | |
e570fd27 | 6998 | return __btrfs_free_reserved_extent(root, start, len, 1, 0); |
e688b725 CM |
6999 | } |
7000 | ||
5d4f98a2 YZ |
7001 | static int alloc_reserved_file_extent(struct btrfs_trans_handle *trans, |
7002 | struct btrfs_root *root, | |
7003 | u64 parent, u64 root_objectid, | |
7004 | u64 flags, u64 owner, u64 offset, | |
7005 | struct btrfs_key *ins, int ref_mod) | |
e6dcd2dc CM |
7006 | { |
7007 | int ret; | |
5d4f98a2 | 7008 | struct btrfs_fs_info *fs_info = root->fs_info; |
e6dcd2dc | 7009 | struct btrfs_extent_item *extent_item; |
5d4f98a2 | 7010 | struct btrfs_extent_inline_ref *iref; |
e6dcd2dc | 7011 | struct btrfs_path *path; |
5d4f98a2 YZ |
7012 | struct extent_buffer *leaf; |
7013 | int type; | |
7014 | u32 size; | |
26b8003f | 7015 | |
5d4f98a2 YZ |
7016 | if (parent > 0) |
7017 | type = BTRFS_SHARED_DATA_REF_KEY; | |
7018 | else | |
7019 | type = BTRFS_EXTENT_DATA_REF_KEY; | |
58176a96 | 7020 | |
5d4f98a2 | 7021 | size = sizeof(*extent_item) + btrfs_extent_inline_ref_size(type); |
7bb86316 CM |
7022 | |
7023 | path = btrfs_alloc_path(); | |
db5b493a TI |
7024 | if (!path) |
7025 | return -ENOMEM; | |
47e4bb98 | 7026 | |
b9473439 | 7027 | path->leave_spinning = 1; |
5d4f98a2 YZ |
7028 | ret = btrfs_insert_empty_item(trans, fs_info->extent_root, path, |
7029 | ins, size); | |
79787eaa JM |
7030 | if (ret) { |
7031 | btrfs_free_path(path); | |
7032 | return ret; | |
7033 | } | |
0f9dd46c | 7034 | |
5d4f98a2 YZ |
7035 | leaf = path->nodes[0]; |
7036 | extent_item = btrfs_item_ptr(leaf, path->slots[0], | |
47e4bb98 | 7037 | struct btrfs_extent_item); |
5d4f98a2 YZ |
7038 | btrfs_set_extent_refs(leaf, extent_item, ref_mod); |
7039 | btrfs_set_extent_generation(leaf, extent_item, trans->transid); | |
7040 | btrfs_set_extent_flags(leaf, extent_item, | |
7041 | flags | BTRFS_EXTENT_FLAG_DATA); | |
7042 | ||
7043 | iref = (struct btrfs_extent_inline_ref *)(extent_item + 1); | |
7044 | btrfs_set_extent_inline_ref_type(leaf, iref, type); | |
7045 | if (parent > 0) { | |
7046 | struct btrfs_shared_data_ref *ref; | |
7047 | ref = (struct btrfs_shared_data_ref *)(iref + 1); | |
7048 | btrfs_set_extent_inline_ref_offset(leaf, iref, parent); | |
7049 | btrfs_set_shared_data_ref_count(leaf, ref, ref_mod); | |
7050 | } else { | |
7051 | struct btrfs_extent_data_ref *ref; | |
7052 | ref = (struct btrfs_extent_data_ref *)(&iref->offset); | |
7053 | btrfs_set_extent_data_ref_root(leaf, ref, root_objectid); | |
7054 | btrfs_set_extent_data_ref_objectid(leaf, ref, owner); | |
7055 | btrfs_set_extent_data_ref_offset(leaf, ref, offset); | |
7056 | btrfs_set_extent_data_ref_count(leaf, ref, ref_mod); | |
7057 | } | |
47e4bb98 CM |
7058 | |
7059 | btrfs_mark_buffer_dirty(path->nodes[0]); | |
7bb86316 | 7060 | btrfs_free_path(path); |
f510cfec | 7061 | |
fcebe456 JB |
7062 | /* Always set parent to 0 here since its exclusive anyway. */ |
7063 | ret = btrfs_qgroup_record_ref(trans, fs_info, root_objectid, | |
7064 | ins->objectid, ins->offset, | |
7065 | BTRFS_QGROUP_OPER_ADD_EXCL, 0); | |
7066 | if (ret) | |
7067 | return ret; | |
7068 | ||
ce93ec54 | 7069 | ret = update_block_group(trans, root, ins->objectid, ins->offset, 1); |
79787eaa | 7070 | if (ret) { /* -ENOENT, logic error */ |
c2cf52eb | 7071 | btrfs_err(fs_info, "update block group failed for %llu %llu", |
c1c9ff7c | 7072 | ins->objectid, ins->offset); |
f5947066 CM |
7073 | BUG(); |
7074 | } | |
0be5dc67 | 7075 | trace_btrfs_reserved_extent_alloc(root, ins->objectid, ins->offset); |
e6dcd2dc CM |
7076 | return ret; |
7077 | } | |
7078 | ||
5d4f98a2 YZ |
7079 | static int alloc_reserved_tree_block(struct btrfs_trans_handle *trans, |
7080 | struct btrfs_root *root, | |
7081 | u64 parent, u64 root_objectid, | |
7082 | u64 flags, struct btrfs_disk_key *key, | |
fcebe456 JB |
7083 | int level, struct btrfs_key *ins, |
7084 | int no_quota) | |
e6dcd2dc CM |
7085 | { |
7086 | int ret; | |
5d4f98a2 YZ |
7087 | struct btrfs_fs_info *fs_info = root->fs_info; |
7088 | struct btrfs_extent_item *extent_item; | |
7089 | struct btrfs_tree_block_info *block_info; | |
7090 | struct btrfs_extent_inline_ref *iref; | |
7091 | struct btrfs_path *path; | |
7092 | struct extent_buffer *leaf; | |
3173a18f | 7093 | u32 size = sizeof(*extent_item) + sizeof(*iref); |
fcebe456 | 7094 | u64 num_bytes = ins->offset; |
3173a18f JB |
7095 | bool skinny_metadata = btrfs_fs_incompat(root->fs_info, |
7096 | SKINNY_METADATA); | |
7097 | ||
7098 | if (!skinny_metadata) | |
7099 | size += sizeof(*block_info); | |
1c2308f8 | 7100 | |
5d4f98a2 | 7101 | path = btrfs_alloc_path(); |
857cc2fc JB |
7102 | if (!path) { |
7103 | btrfs_free_and_pin_reserved_extent(root, ins->objectid, | |
707e8a07 | 7104 | root->nodesize); |
d8926bb3 | 7105 | return -ENOMEM; |
857cc2fc | 7106 | } |
56bec294 | 7107 | |
5d4f98a2 YZ |
7108 | path->leave_spinning = 1; |
7109 | ret = btrfs_insert_empty_item(trans, fs_info->extent_root, path, | |
7110 | ins, size); | |
79787eaa | 7111 | if (ret) { |
dd825259 | 7112 | btrfs_free_path(path); |
857cc2fc | 7113 | btrfs_free_and_pin_reserved_extent(root, ins->objectid, |
707e8a07 | 7114 | root->nodesize); |
79787eaa JM |
7115 | return ret; |
7116 | } | |
5d4f98a2 YZ |
7117 | |
7118 | leaf = path->nodes[0]; | |
7119 | extent_item = btrfs_item_ptr(leaf, path->slots[0], | |
7120 | struct btrfs_extent_item); | |
7121 | btrfs_set_extent_refs(leaf, extent_item, 1); | |
7122 | btrfs_set_extent_generation(leaf, extent_item, trans->transid); | |
7123 | btrfs_set_extent_flags(leaf, extent_item, | |
7124 | flags | BTRFS_EXTENT_FLAG_TREE_BLOCK); | |
5d4f98a2 | 7125 | |
3173a18f JB |
7126 | if (skinny_metadata) { |
7127 | iref = (struct btrfs_extent_inline_ref *)(extent_item + 1); | |
707e8a07 | 7128 | num_bytes = root->nodesize; |
3173a18f JB |
7129 | } else { |
7130 | block_info = (struct btrfs_tree_block_info *)(extent_item + 1); | |
7131 | btrfs_set_tree_block_key(leaf, block_info, key); | |
7132 | btrfs_set_tree_block_level(leaf, block_info, level); | |
7133 | iref = (struct btrfs_extent_inline_ref *)(block_info + 1); | |
7134 | } | |
5d4f98a2 | 7135 | |
5d4f98a2 YZ |
7136 | if (parent > 0) { |
7137 | BUG_ON(!(flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)); | |
7138 | btrfs_set_extent_inline_ref_type(leaf, iref, | |
7139 | BTRFS_SHARED_BLOCK_REF_KEY); | |
7140 | btrfs_set_extent_inline_ref_offset(leaf, iref, parent); | |
7141 | } else { | |
7142 | btrfs_set_extent_inline_ref_type(leaf, iref, | |
7143 | BTRFS_TREE_BLOCK_REF_KEY); | |
7144 | btrfs_set_extent_inline_ref_offset(leaf, iref, root_objectid); | |
7145 | } | |
7146 | ||
7147 | btrfs_mark_buffer_dirty(leaf); | |
7148 | btrfs_free_path(path); | |
7149 | ||
fcebe456 JB |
7150 | if (!no_quota) { |
7151 | ret = btrfs_qgroup_record_ref(trans, fs_info, root_objectid, | |
7152 | ins->objectid, num_bytes, | |
7153 | BTRFS_QGROUP_OPER_ADD_EXCL, 0); | |
7154 | if (ret) | |
7155 | return ret; | |
7156 | } | |
7157 | ||
ce93ec54 JB |
7158 | ret = update_block_group(trans, root, ins->objectid, root->nodesize, |
7159 | 1); | |
79787eaa | 7160 | if (ret) { /* -ENOENT, logic error */ |
c2cf52eb | 7161 | btrfs_err(fs_info, "update block group failed for %llu %llu", |
c1c9ff7c | 7162 | ins->objectid, ins->offset); |
5d4f98a2 YZ |
7163 | BUG(); |
7164 | } | |
0be5dc67 | 7165 | |
707e8a07 | 7166 | trace_btrfs_reserved_extent_alloc(root, ins->objectid, root->nodesize); |
5d4f98a2 YZ |
7167 | return ret; |
7168 | } | |
7169 | ||
7170 | int btrfs_alloc_reserved_file_extent(struct btrfs_trans_handle *trans, | |
7171 | struct btrfs_root *root, | |
7172 | u64 root_objectid, u64 owner, | |
7173 | u64 offset, struct btrfs_key *ins) | |
7174 | { | |
7175 | int ret; | |
7176 | ||
7177 | BUG_ON(root_objectid == BTRFS_TREE_LOG_OBJECTID); | |
7178 | ||
66d7e7f0 AJ |
7179 | ret = btrfs_add_delayed_data_ref(root->fs_info, trans, ins->objectid, |
7180 | ins->offset, 0, | |
7181 | root_objectid, owner, offset, | |
7182 | BTRFS_ADD_DELAYED_EXTENT, NULL, 0); | |
e6dcd2dc CM |
7183 | return ret; |
7184 | } | |
e02119d5 CM |
7185 | |
7186 | /* | |
7187 | * this is used by the tree logging recovery code. It records that | |
7188 | * an extent has been allocated and makes sure to clear the free | |
7189 | * space cache bits as well | |
7190 | */ | |
5d4f98a2 YZ |
7191 | int btrfs_alloc_logged_file_extent(struct btrfs_trans_handle *trans, |
7192 | struct btrfs_root *root, | |
7193 | u64 root_objectid, u64 owner, u64 offset, | |
7194 | struct btrfs_key *ins) | |
e02119d5 CM |
7195 | { |
7196 | int ret; | |
7197 | struct btrfs_block_group_cache *block_group; | |
11833d66 | 7198 | |
8c2a1a30 JB |
7199 | /* |
7200 | * Mixed block groups will exclude before processing the log so we only | |
7201 | * need to do the exlude dance if this fs isn't mixed. | |
7202 | */ | |
7203 | if (!btrfs_fs_incompat(root->fs_info, MIXED_GROUPS)) { | |
7204 | ret = __exclude_logged_extent(root, ins->objectid, ins->offset); | |
b50c6e25 | 7205 | if (ret) |
8c2a1a30 | 7206 | return ret; |
11833d66 YZ |
7207 | } |
7208 | ||
8c2a1a30 JB |
7209 | block_group = btrfs_lookup_block_group(root->fs_info, ins->objectid); |
7210 | if (!block_group) | |
7211 | return -EINVAL; | |
7212 | ||
fb25e914 | 7213 | ret = btrfs_update_reserved_bytes(block_group, ins->offset, |
e570fd27 | 7214 | RESERVE_ALLOC_NO_ACCOUNT, 0); |
79787eaa | 7215 | BUG_ON(ret); /* logic error */ |
5d4f98a2 YZ |
7216 | ret = alloc_reserved_file_extent(trans, root, 0, root_objectid, |
7217 | 0, owner, offset, ins, 1); | |
b50c6e25 | 7218 | btrfs_put_block_group(block_group); |
e02119d5 CM |
7219 | return ret; |
7220 | } | |
7221 | ||
48a3b636 ES |
7222 | static struct extent_buffer * |
7223 | btrfs_init_new_buffer(struct btrfs_trans_handle *trans, struct btrfs_root *root, | |
fe864576 | 7224 | u64 bytenr, int level) |
65b51a00 CM |
7225 | { |
7226 | struct extent_buffer *buf; | |
7227 | ||
a83fffb7 | 7228 | buf = btrfs_find_create_tree_block(root, bytenr); |
65b51a00 CM |
7229 | if (!buf) |
7230 | return ERR_PTR(-ENOMEM); | |
7231 | btrfs_set_header_generation(buf, trans->transid); | |
85d4e461 | 7232 | btrfs_set_buffer_lockdep_class(root->root_key.objectid, buf, level); |
65b51a00 | 7233 | btrfs_tree_lock(buf); |
01d58472 | 7234 | clean_tree_block(trans, root->fs_info, buf); |
3083ee2e | 7235 | clear_bit(EXTENT_BUFFER_STALE, &buf->bflags); |
b4ce94de CM |
7236 | |
7237 | btrfs_set_lock_blocking(buf); | |
65b51a00 | 7238 | btrfs_set_buffer_uptodate(buf); |
b4ce94de | 7239 | |
d0c803c4 | 7240 | if (root->root_key.objectid == BTRFS_TREE_LOG_OBJECTID) { |
656f30db | 7241 | buf->log_index = root->log_transid % 2; |
8cef4e16 YZ |
7242 | /* |
7243 | * we allow two log transactions at a time, use different | |
7244 | * EXENT bit to differentiate dirty pages. | |
7245 | */ | |
656f30db | 7246 | if (buf->log_index == 0) |
8cef4e16 YZ |
7247 | set_extent_dirty(&root->dirty_log_pages, buf->start, |
7248 | buf->start + buf->len - 1, GFP_NOFS); | |
7249 | else | |
7250 | set_extent_new(&root->dirty_log_pages, buf->start, | |
7251 | buf->start + buf->len - 1, GFP_NOFS); | |
d0c803c4 | 7252 | } else { |
656f30db | 7253 | buf->log_index = -1; |
d0c803c4 | 7254 | set_extent_dirty(&trans->transaction->dirty_pages, buf->start, |
65b51a00 | 7255 | buf->start + buf->len - 1, GFP_NOFS); |
d0c803c4 | 7256 | } |
65b51a00 | 7257 | trans->blocks_used++; |
b4ce94de | 7258 | /* this returns a buffer locked for blocking */ |
65b51a00 CM |
7259 | return buf; |
7260 | } | |
7261 | ||
f0486c68 YZ |
7262 | static struct btrfs_block_rsv * |
7263 | use_block_rsv(struct btrfs_trans_handle *trans, | |
7264 | struct btrfs_root *root, u32 blocksize) | |
7265 | { | |
7266 | struct btrfs_block_rsv *block_rsv; | |
68a82277 | 7267 | struct btrfs_block_rsv *global_rsv = &root->fs_info->global_block_rsv; |
f0486c68 | 7268 | int ret; |
d88033db | 7269 | bool global_updated = false; |
f0486c68 YZ |
7270 | |
7271 | block_rsv = get_block_rsv(trans, root); | |
7272 | ||
b586b323 MX |
7273 | if (unlikely(block_rsv->size == 0)) |
7274 | goto try_reserve; | |
d88033db | 7275 | again: |
f0486c68 YZ |
7276 | ret = block_rsv_use_bytes(block_rsv, blocksize); |
7277 | if (!ret) | |
7278 | return block_rsv; | |
7279 | ||
b586b323 MX |
7280 | if (block_rsv->failfast) |
7281 | return ERR_PTR(ret); | |
7282 | ||
d88033db MX |
7283 | if (block_rsv->type == BTRFS_BLOCK_RSV_GLOBAL && !global_updated) { |
7284 | global_updated = true; | |
7285 | update_global_block_rsv(root->fs_info); | |
7286 | goto again; | |
7287 | } | |
7288 | ||
b586b323 MX |
7289 | if (btrfs_test_opt(root, ENOSPC_DEBUG)) { |
7290 | static DEFINE_RATELIMIT_STATE(_rs, | |
7291 | DEFAULT_RATELIMIT_INTERVAL * 10, | |
7292 | /*DEFAULT_RATELIMIT_BURST*/ 1); | |
7293 | if (__ratelimit(&_rs)) | |
7294 | WARN(1, KERN_DEBUG | |
efe120a0 | 7295 | "BTRFS: block rsv returned %d\n", ret); |
b586b323 MX |
7296 | } |
7297 | try_reserve: | |
7298 | ret = reserve_metadata_bytes(root, block_rsv, blocksize, | |
7299 | BTRFS_RESERVE_NO_FLUSH); | |
7300 | if (!ret) | |
7301 | return block_rsv; | |
7302 | /* | |
7303 | * If we couldn't reserve metadata bytes try and use some from | |
5881cfc9 MX |
7304 | * the global reserve if its space type is the same as the global |
7305 | * reservation. | |
b586b323 | 7306 | */ |
5881cfc9 MX |
7307 | if (block_rsv->type != BTRFS_BLOCK_RSV_GLOBAL && |
7308 | block_rsv->space_info == global_rsv->space_info) { | |
b586b323 MX |
7309 | ret = block_rsv_use_bytes(global_rsv, blocksize); |
7310 | if (!ret) | |
7311 | return global_rsv; | |
7312 | } | |
7313 | return ERR_PTR(ret); | |
f0486c68 YZ |
7314 | } |
7315 | ||
8c2a3ca2 JB |
7316 | static void unuse_block_rsv(struct btrfs_fs_info *fs_info, |
7317 | struct btrfs_block_rsv *block_rsv, u32 blocksize) | |
f0486c68 YZ |
7318 | { |
7319 | block_rsv_add_bytes(block_rsv, blocksize, 0); | |
8c2a3ca2 | 7320 | block_rsv_release_bytes(fs_info, block_rsv, NULL, 0); |
f0486c68 YZ |
7321 | } |
7322 | ||
fec577fb | 7323 | /* |
f0486c68 YZ |
7324 | * finds a free extent and does all the dirty work required for allocation |
7325 | * returns the key for the extent through ins, and a tree buffer for | |
7326 | * the first block of the extent through buf. | |
7327 | * | |
fec577fb CM |
7328 | * returns the tree buffer or NULL. |
7329 | */ | |
4d75f8a9 DS |
7330 | struct extent_buffer *btrfs_alloc_tree_block(struct btrfs_trans_handle *trans, |
7331 | struct btrfs_root *root, | |
5d4f98a2 YZ |
7332 | u64 parent, u64 root_objectid, |
7333 | struct btrfs_disk_key *key, int level, | |
5581a51a | 7334 | u64 hint, u64 empty_size) |
fec577fb | 7335 | { |
e2fa7227 | 7336 | struct btrfs_key ins; |
f0486c68 | 7337 | struct btrfs_block_rsv *block_rsv; |
5f39d397 | 7338 | struct extent_buffer *buf; |
f0486c68 YZ |
7339 | u64 flags = 0; |
7340 | int ret; | |
4d75f8a9 | 7341 | u32 blocksize = root->nodesize; |
3173a18f JB |
7342 | bool skinny_metadata = btrfs_fs_incompat(root->fs_info, |
7343 | SKINNY_METADATA); | |
fec577fb | 7344 | |
fccb84c9 | 7345 | if (btrfs_test_is_dummy_root(root)) { |
faa2dbf0 | 7346 | buf = btrfs_init_new_buffer(trans, root, root->alloc_bytenr, |
fe864576 | 7347 | level); |
faa2dbf0 JB |
7348 | if (!IS_ERR(buf)) |
7349 | root->alloc_bytenr += blocksize; | |
7350 | return buf; | |
7351 | } | |
fccb84c9 | 7352 | |
f0486c68 YZ |
7353 | block_rsv = use_block_rsv(trans, root, blocksize); |
7354 | if (IS_ERR(block_rsv)) | |
7355 | return ERR_CAST(block_rsv); | |
7356 | ||
00361589 | 7357 | ret = btrfs_reserve_extent(root, blocksize, blocksize, |
e570fd27 | 7358 | empty_size, hint, &ins, 0, 0); |
fec577fb | 7359 | if (ret) { |
8c2a3ca2 | 7360 | unuse_block_rsv(root->fs_info, block_rsv, blocksize); |
54aa1f4d | 7361 | return ERR_PTR(ret); |
fec577fb | 7362 | } |
55c69072 | 7363 | |
fe864576 | 7364 | buf = btrfs_init_new_buffer(trans, root, ins.objectid, level); |
79787eaa | 7365 | BUG_ON(IS_ERR(buf)); /* -ENOMEM */ |
f0486c68 YZ |
7366 | |
7367 | if (root_objectid == BTRFS_TREE_RELOC_OBJECTID) { | |
7368 | if (parent == 0) | |
7369 | parent = ins.objectid; | |
7370 | flags |= BTRFS_BLOCK_FLAG_FULL_BACKREF; | |
7371 | } else | |
7372 | BUG_ON(parent > 0); | |
7373 | ||
7374 | if (root_objectid != BTRFS_TREE_LOG_OBJECTID) { | |
7375 | struct btrfs_delayed_extent_op *extent_op; | |
78a6184a | 7376 | extent_op = btrfs_alloc_delayed_extent_op(); |
79787eaa | 7377 | BUG_ON(!extent_op); /* -ENOMEM */ |
f0486c68 YZ |
7378 | if (key) |
7379 | memcpy(&extent_op->key, key, sizeof(extent_op->key)); | |
7380 | else | |
7381 | memset(&extent_op->key, 0, sizeof(extent_op->key)); | |
7382 | extent_op->flags_to_set = flags; | |
3173a18f JB |
7383 | if (skinny_metadata) |
7384 | extent_op->update_key = 0; | |
7385 | else | |
7386 | extent_op->update_key = 1; | |
f0486c68 YZ |
7387 | extent_op->update_flags = 1; |
7388 | extent_op->is_data = 0; | |
b1c79e09 | 7389 | extent_op->level = level; |
f0486c68 | 7390 | |
66d7e7f0 AJ |
7391 | ret = btrfs_add_delayed_tree_ref(root->fs_info, trans, |
7392 | ins.objectid, | |
f0486c68 YZ |
7393 | ins.offset, parent, root_objectid, |
7394 | level, BTRFS_ADD_DELAYED_EXTENT, | |
5581a51a | 7395 | extent_op, 0); |
79787eaa | 7396 | BUG_ON(ret); /* -ENOMEM */ |
f0486c68 | 7397 | } |
fec577fb CM |
7398 | return buf; |
7399 | } | |
a28ec197 | 7400 | |
2c47e605 YZ |
7401 | struct walk_control { |
7402 | u64 refs[BTRFS_MAX_LEVEL]; | |
7403 | u64 flags[BTRFS_MAX_LEVEL]; | |
7404 | struct btrfs_key update_progress; | |
7405 | int stage; | |
7406 | int level; | |
7407 | int shared_level; | |
7408 | int update_ref; | |
7409 | int keep_locks; | |
1c4850e2 YZ |
7410 | int reada_slot; |
7411 | int reada_count; | |
66d7e7f0 | 7412 | int for_reloc; |
2c47e605 YZ |
7413 | }; |
7414 | ||
7415 | #define DROP_REFERENCE 1 | |
7416 | #define UPDATE_BACKREF 2 | |
7417 | ||
1c4850e2 YZ |
7418 | static noinline void reada_walk_down(struct btrfs_trans_handle *trans, |
7419 | struct btrfs_root *root, | |
7420 | struct walk_control *wc, | |
7421 | struct btrfs_path *path) | |
6407bf6d | 7422 | { |
1c4850e2 YZ |
7423 | u64 bytenr; |
7424 | u64 generation; | |
7425 | u64 refs; | |
94fcca9f | 7426 | u64 flags; |
5d4f98a2 | 7427 | u32 nritems; |
1c4850e2 YZ |
7428 | u32 blocksize; |
7429 | struct btrfs_key key; | |
7430 | struct extent_buffer *eb; | |
6407bf6d | 7431 | int ret; |
1c4850e2 YZ |
7432 | int slot; |
7433 | int nread = 0; | |
6407bf6d | 7434 | |
1c4850e2 YZ |
7435 | if (path->slots[wc->level] < wc->reada_slot) { |
7436 | wc->reada_count = wc->reada_count * 2 / 3; | |
7437 | wc->reada_count = max(wc->reada_count, 2); | |
7438 | } else { | |
7439 | wc->reada_count = wc->reada_count * 3 / 2; | |
7440 | wc->reada_count = min_t(int, wc->reada_count, | |
7441 | BTRFS_NODEPTRS_PER_BLOCK(root)); | |
7442 | } | |
7bb86316 | 7443 | |
1c4850e2 YZ |
7444 | eb = path->nodes[wc->level]; |
7445 | nritems = btrfs_header_nritems(eb); | |
707e8a07 | 7446 | blocksize = root->nodesize; |
bd56b302 | 7447 | |
1c4850e2 YZ |
7448 | for (slot = path->slots[wc->level]; slot < nritems; slot++) { |
7449 | if (nread >= wc->reada_count) | |
7450 | break; | |
bd56b302 | 7451 | |
2dd3e67b | 7452 | cond_resched(); |
1c4850e2 YZ |
7453 | bytenr = btrfs_node_blockptr(eb, slot); |
7454 | generation = btrfs_node_ptr_generation(eb, slot); | |
2dd3e67b | 7455 | |
1c4850e2 YZ |
7456 | if (slot == path->slots[wc->level]) |
7457 | goto reada; | |
5d4f98a2 | 7458 | |
1c4850e2 YZ |
7459 | if (wc->stage == UPDATE_BACKREF && |
7460 | generation <= root->root_key.offset) | |
bd56b302 CM |
7461 | continue; |
7462 | ||
94fcca9f | 7463 | /* We don't lock the tree block, it's OK to be racy here */ |
3173a18f JB |
7464 | ret = btrfs_lookup_extent_info(trans, root, bytenr, |
7465 | wc->level - 1, 1, &refs, | |
7466 | &flags); | |
79787eaa JM |
7467 | /* We don't care about errors in readahead. */ |
7468 | if (ret < 0) | |
7469 | continue; | |
94fcca9f YZ |
7470 | BUG_ON(refs == 0); |
7471 | ||
1c4850e2 | 7472 | if (wc->stage == DROP_REFERENCE) { |
1c4850e2 YZ |
7473 | if (refs == 1) |
7474 | goto reada; | |
bd56b302 | 7475 | |
94fcca9f YZ |
7476 | if (wc->level == 1 && |
7477 | (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) | |
7478 | continue; | |
1c4850e2 YZ |
7479 | if (!wc->update_ref || |
7480 | generation <= root->root_key.offset) | |
7481 | continue; | |
7482 | btrfs_node_key_to_cpu(eb, &key, slot); | |
7483 | ret = btrfs_comp_cpu_keys(&key, | |
7484 | &wc->update_progress); | |
7485 | if (ret < 0) | |
7486 | continue; | |
94fcca9f YZ |
7487 | } else { |
7488 | if (wc->level == 1 && | |
7489 | (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) | |
7490 | continue; | |
6407bf6d | 7491 | } |
1c4850e2 | 7492 | reada: |
d3e46fea | 7493 | readahead_tree_block(root, bytenr); |
1c4850e2 | 7494 | nread++; |
20524f02 | 7495 | } |
1c4850e2 | 7496 | wc->reada_slot = slot; |
20524f02 | 7497 | } |
2c47e605 | 7498 | |
1152651a MF |
7499 | static int account_leaf_items(struct btrfs_trans_handle *trans, |
7500 | struct btrfs_root *root, | |
7501 | struct extent_buffer *eb) | |
7502 | { | |
7503 | int nr = btrfs_header_nritems(eb); | |
7504 | int i, extent_type, ret; | |
7505 | struct btrfs_key key; | |
7506 | struct btrfs_file_extent_item *fi; | |
7507 | u64 bytenr, num_bytes; | |
7508 | ||
7509 | for (i = 0; i < nr; i++) { | |
7510 | btrfs_item_key_to_cpu(eb, &key, i); | |
7511 | ||
7512 | if (key.type != BTRFS_EXTENT_DATA_KEY) | |
7513 | continue; | |
7514 | ||
7515 | fi = btrfs_item_ptr(eb, i, struct btrfs_file_extent_item); | |
7516 | /* filter out non qgroup-accountable extents */ | |
7517 | extent_type = btrfs_file_extent_type(eb, fi); | |
7518 | ||
7519 | if (extent_type == BTRFS_FILE_EXTENT_INLINE) | |
7520 | continue; | |
7521 | ||
7522 | bytenr = btrfs_file_extent_disk_bytenr(eb, fi); | |
7523 | if (!bytenr) | |
7524 | continue; | |
7525 | ||
7526 | num_bytes = btrfs_file_extent_disk_num_bytes(eb, fi); | |
7527 | ||
7528 | ret = btrfs_qgroup_record_ref(trans, root->fs_info, | |
7529 | root->objectid, | |
7530 | bytenr, num_bytes, | |
7531 | BTRFS_QGROUP_OPER_SUB_SUBTREE, 0); | |
7532 | if (ret) | |
7533 | return ret; | |
7534 | } | |
7535 | return 0; | |
7536 | } | |
7537 | ||
7538 | /* | |
7539 | * Walk up the tree from the bottom, freeing leaves and any interior | |
7540 | * nodes which have had all slots visited. If a node (leaf or | |
7541 | * interior) is freed, the node above it will have it's slot | |
7542 | * incremented. The root node will never be freed. | |
7543 | * | |
7544 | * At the end of this function, we should have a path which has all | |
7545 | * slots incremented to the next position for a search. If we need to | |
7546 | * read a new node it will be NULL and the node above it will have the | |
7547 | * correct slot selected for a later read. | |
7548 | * | |
7549 | * If we increment the root nodes slot counter past the number of | |
7550 | * elements, 1 is returned to signal completion of the search. | |
7551 | */ | |
7552 | static int adjust_slots_upwards(struct btrfs_root *root, | |
7553 | struct btrfs_path *path, int root_level) | |
7554 | { | |
7555 | int level = 0; | |
7556 | int nr, slot; | |
7557 | struct extent_buffer *eb; | |
7558 | ||
7559 | if (root_level == 0) | |
7560 | return 1; | |
7561 | ||
7562 | while (level <= root_level) { | |
7563 | eb = path->nodes[level]; | |
7564 | nr = btrfs_header_nritems(eb); | |
7565 | path->slots[level]++; | |
7566 | slot = path->slots[level]; | |
7567 | if (slot >= nr || level == 0) { | |
7568 | /* | |
7569 | * Don't free the root - we will detect this | |
7570 | * condition after our loop and return a | |
7571 | * positive value for caller to stop walking the tree. | |
7572 | */ | |
7573 | if (level != root_level) { | |
7574 | btrfs_tree_unlock_rw(eb, path->locks[level]); | |
7575 | path->locks[level] = 0; | |
7576 | ||
7577 | free_extent_buffer(eb); | |
7578 | path->nodes[level] = NULL; | |
7579 | path->slots[level] = 0; | |
7580 | } | |
7581 | } else { | |
7582 | /* | |
7583 | * We have a valid slot to walk back down | |
7584 | * from. Stop here so caller can process these | |
7585 | * new nodes. | |
7586 | */ | |
7587 | break; | |
7588 | } | |
7589 | ||
7590 | level++; | |
7591 | } | |
7592 | ||
7593 | eb = path->nodes[root_level]; | |
7594 | if (path->slots[root_level] >= btrfs_header_nritems(eb)) | |
7595 | return 1; | |
7596 | ||
7597 | return 0; | |
7598 | } | |
7599 | ||
7600 | /* | |
7601 | * root_eb is the subtree root and is locked before this function is called. | |
7602 | */ | |
7603 | static int account_shared_subtree(struct btrfs_trans_handle *trans, | |
7604 | struct btrfs_root *root, | |
7605 | struct extent_buffer *root_eb, | |
7606 | u64 root_gen, | |
7607 | int root_level) | |
7608 | { | |
7609 | int ret = 0; | |
7610 | int level; | |
7611 | struct extent_buffer *eb = root_eb; | |
7612 | struct btrfs_path *path = NULL; | |
7613 | ||
7614 | BUG_ON(root_level < 0 || root_level > BTRFS_MAX_LEVEL); | |
7615 | BUG_ON(root_eb == NULL); | |
7616 | ||
7617 | if (!root->fs_info->quota_enabled) | |
7618 | return 0; | |
7619 | ||
7620 | if (!extent_buffer_uptodate(root_eb)) { | |
7621 | ret = btrfs_read_buffer(root_eb, root_gen); | |
7622 | if (ret) | |
7623 | goto out; | |
7624 | } | |
7625 | ||
7626 | if (root_level == 0) { | |
7627 | ret = account_leaf_items(trans, root, root_eb); | |
7628 | goto out; | |
7629 | } | |
7630 | ||
7631 | path = btrfs_alloc_path(); | |
7632 | if (!path) | |
7633 | return -ENOMEM; | |
7634 | ||
7635 | /* | |
7636 | * Walk down the tree. Missing extent blocks are filled in as | |
7637 | * we go. Metadata is accounted every time we read a new | |
7638 | * extent block. | |
7639 | * | |
7640 | * When we reach a leaf, we account for file extent items in it, | |
7641 | * walk back up the tree (adjusting slot pointers as we go) | |
7642 | * and restart the search process. | |
7643 | */ | |
7644 | extent_buffer_get(root_eb); /* For path */ | |
7645 | path->nodes[root_level] = root_eb; | |
7646 | path->slots[root_level] = 0; | |
7647 | path->locks[root_level] = 0; /* so release_path doesn't try to unlock */ | |
7648 | walk_down: | |
7649 | level = root_level; | |
7650 | while (level >= 0) { | |
7651 | if (path->nodes[level] == NULL) { | |
1152651a MF |
7652 | int parent_slot; |
7653 | u64 child_gen; | |
7654 | u64 child_bytenr; | |
7655 | ||
7656 | /* We need to get child blockptr/gen from | |
7657 | * parent before we can read it. */ | |
7658 | eb = path->nodes[level + 1]; | |
7659 | parent_slot = path->slots[level + 1]; | |
7660 | child_bytenr = btrfs_node_blockptr(eb, parent_slot); | |
7661 | child_gen = btrfs_node_ptr_generation(eb, parent_slot); | |
7662 | ||
ce86cd59 | 7663 | eb = read_tree_block(root, child_bytenr, child_gen); |
1152651a MF |
7664 | if (!eb || !extent_buffer_uptodate(eb)) { |
7665 | ret = -EIO; | |
7666 | goto out; | |
7667 | } | |
7668 | ||
7669 | path->nodes[level] = eb; | |
7670 | path->slots[level] = 0; | |
7671 | ||
7672 | btrfs_tree_read_lock(eb); | |
7673 | btrfs_set_lock_blocking_rw(eb, BTRFS_READ_LOCK); | |
7674 | path->locks[level] = BTRFS_READ_LOCK_BLOCKING; | |
7675 | ||
7676 | ret = btrfs_qgroup_record_ref(trans, root->fs_info, | |
7677 | root->objectid, | |
7678 | child_bytenr, | |
ce86cd59 | 7679 | root->nodesize, |
1152651a MF |
7680 | BTRFS_QGROUP_OPER_SUB_SUBTREE, |
7681 | 0); | |
7682 | if (ret) | |
7683 | goto out; | |
7684 | ||
7685 | } | |
7686 | ||
7687 | if (level == 0) { | |
7688 | ret = account_leaf_items(trans, root, path->nodes[level]); | |
7689 | if (ret) | |
7690 | goto out; | |
7691 | ||
7692 | /* Nonzero return here means we completed our search */ | |
7693 | ret = adjust_slots_upwards(root, path, root_level); | |
7694 | if (ret) | |
7695 | break; | |
7696 | ||
7697 | /* Restart search with new slots */ | |
7698 | goto walk_down; | |
7699 | } | |
7700 | ||
7701 | level--; | |
7702 | } | |
7703 | ||
7704 | ret = 0; | |
7705 | out: | |
7706 | btrfs_free_path(path); | |
7707 | ||
7708 | return ret; | |
7709 | } | |
7710 | ||
f82d02d9 | 7711 | /* |
2c016dc2 | 7712 | * helper to process tree block while walking down the tree. |
2c47e605 | 7713 | * |
2c47e605 YZ |
7714 | * when wc->stage == UPDATE_BACKREF, this function updates |
7715 | * back refs for pointers in the block. | |
7716 | * | |
7717 | * NOTE: return value 1 means we should stop walking down. | |
f82d02d9 | 7718 | */ |
2c47e605 | 7719 | static noinline int walk_down_proc(struct btrfs_trans_handle *trans, |
5d4f98a2 | 7720 | struct btrfs_root *root, |
2c47e605 | 7721 | struct btrfs_path *path, |
94fcca9f | 7722 | struct walk_control *wc, int lookup_info) |
f82d02d9 | 7723 | { |
2c47e605 YZ |
7724 | int level = wc->level; |
7725 | struct extent_buffer *eb = path->nodes[level]; | |
2c47e605 | 7726 | u64 flag = BTRFS_BLOCK_FLAG_FULL_BACKREF; |
f82d02d9 YZ |
7727 | int ret; |
7728 | ||
2c47e605 YZ |
7729 | if (wc->stage == UPDATE_BACKREF && |
7730 | btrfs_header_owner(eb) != root->root_key.objectid) | |
7731 | return 1; | |
f82d02d9 | 7732 | |
2c47e605 YZ |
7733 | /* |
7734 | * when reference count of tree block is 1, it won't increase | |
7735 | * again. once full backref flag is set, we never clear it. | |
7736 | */ | |
94fcca9f YZ |
7737 | if (lookup_info && |
7738 | ((wc->stage == DROP_REFERENCE && wc->refs[level] != 1) || | |
7739 | (wc->stage == UPDATE_BACKREF && !(wc->flags[level] & flag)))) { | |
2c47e605 YZ |
7740 | BUG_ON(!path->locks[level]); |
7741 | ret = btrfs_lookup_extent_info(trans, root, | |
3173a18f | 7742 | eb->start, level, 1, |
2c47e605 YZ |
7743 | &wc->refs[level], |
7744 | &wc->flags[level]); | |
79787eaa JM |
7745 | BUG_ON(ret == -ENOMEM); |
7746 | if (ret) | |
7747 | return ret; | |
2c47e605 YZ |
7748 | BUG_ON(wc->refs[level] == 0); |
7749 | } | |
5d4f98a2 | 7750 | |
2c47e605 YZ |
7751 | if (wc->stage == DROP_REFERENCE) { |
7752 | if (wc->refs[level] > 1) | |
7753 | return 1; | |
f82d02d9 | 7754 | |
2c47e605 | 7755 | if (path->locks[level] && !wc->keep_locks) { |
bd681513 | 7756 | btrfs_tree_unlock_rw(eb, path->locks[level]); |
2c47e605 YZ |
7757 | path->locks[level] = 0; |
7758 | } | |
7759 | return 0; | |
7760 | } | |
f82d02d9 | 7761 | |
2c47e605 YZ |
7762 | /* wc->stage == UPDATE_BACKREF */ |
7763 | if (!(wc->flags[level] & flag)) { | |
7764 | BUG_ON(!path->locks[level]); | |
e339a6b0 | 7765 | ret = btrfs_inc_ref(trans, root, eb, 1); |
79787eaa | 7766 | BUG_ON(ret); /* -ENOMEM */ |
e339a6b0 | 7767 | ret = btrfs_dec_ref(trans, root, eb, 0); |
79787eaa | 7768 | BUG_ON(ret); /* -ENOMEM */ |
2c47e605 | 7769 | ret = btrfs_set_disk_extent_flags(trans, root, eb->start, |
b1c79e09 JB |
7770 | eb->len, flag, |
7771 | btrfs_header_level(eb), 0); | |
79787eaa | 7772 | BUG_ON(ret); /* -ENOMEM */ |
2c47e605 YZ |
7773 | wc->flags[level] |= flag; |
7774 | } | |
7775 | ||
7776 | /* | |
7777 | * the block is shared by multiple trees, so it's not good to | |
7778 | * keep the tree lock | |
7779 | */ | |
7780 | if (path->locks[level] && level > 0) { | |
bd681513 | 7781 | btrfs_tree_unlock_rw(eb, path->locks[level]); |
2c47e605 YZ |
7782 | path->locks[level] = 0; |
7783 | } | |
7784 | return 0; | |
7785 | } | |
7786 | ||
1c4850e2 | 7787 | /* |
2c016dc2 | 7788 | * helper to process tree block pointer. |
1c4850e2 YZ |
7789 | * |
7790 | * when wc->stage == DROP_REFERENCE, this function checks | |
7791 | * reference count of the block pointed to. if the block | |
7792 | * is shared and we need update back refs for the subtree | |
7793 | * rooted at the block, this function changes wc->stage to | |
7794 | * UPDATE_BACKREF. if the block is shared and there is no | |
7795 | * need to update back, this function drops the reference | |
7796 | * to the block. | |
7797 | * | |
7798 | * NOTE: return value 1 means we should stop walking down. | |
7799 | */ | |
7800 | static noinline int do_walk_down(struct btrfs_trans_handle *trans, | |
7801 | struct btrfs_root *root, | |
7802 | struct btrfs_path *path, | |
94fcca9f | 7803 | struct walk_control *wc, int *lookup_info) |
1c4850e2 YZ |
7804 | { |
7805 | u64 bytenr; | |
7806 | u64 generation; | |
7807 | u64 parent; | |
7808 | u32 blocksize; | |
7809 | struct btrfs_key key; | |
7810 | struct extent_buffer *next; | |
7811 | int level = wc->level; | |
7812 | int reada = 0; | |
7813 | int ret = 0; | |
1152651a | 7814 | bool need_account = false; |
1c4850e2 YZ |
7815 | |
7816 | generation = btrfs_node_ptr_generation(path->nodes[level], | |
7817 | path->slots[level]); | |
7818 | /* | |
7819 | * if the lower level block was created before the snapshot | |
7820 | * was created, we know there is no need to update back refs | |
7821 | * for the subtree | |
7822 | */ | |
7823 | if (wc->stage == UPDATE_BACKREF && | |
94fcca9f YZ |
7824 | generation <= root->root_key.offset) { |
7825 | *lookup_info = 1; | |
1c4850e2 | 7826 | return 1; |
94fcca9f | 7827 | } |
1c4850e2 YZ |
7828 | |
7829 | bytenr = btrfs_node_blockptr(path->nodes[level], path->slots[level]); | |
707e8a07 | 7830 | blocksize = root->nodesize; |
1c4850e2 | 7831 | |
01d58472 | 7832 | next = btrfs_find_tree_block(root->fs_info, bytenr); |
1c4850e2 | 7833 | if (!next) { |
a83fffb7 | 7834 | next = btrfs_find_create_tree_block(root, bytenr); |
90d2c51d MX |
7835 | if (!next) |
7836 | return -ENOMEM; | |
b2aaaa3b JB |
7837 | btrfs_set_buffer_lockdep_class(root->root_key.objectid, next, |
7838 | level - 1); | |
1c4850e2 YZ |
7839 | reada = 1; |
7840 | } | |
7841 | btrfs_tree_lock(next); | |
7842 | btrfs_set_lock_blocking(next); | |
7843 | ||
3173a18f | 7844 | ret = btrfs_lookup_extent_info(trans, root, bytenr, level - 1, 1, |
94fcca9f YZ |
7845 | &wc->refs[level - 1], |
7846 | &wc->flags[level - 1]); | |
79787eaa JM |
7847 | if (ret < 0) { |
7848 | btrfs_tree_unlock(next); | |
7849 | return ret; | |
7850 | } | |
7851 | ||
c2cf52eb SK |
7852 | if (unlikely(wc->refs[level - 1] == 0)) { |
7853 | btrfs_err(root->fs_info, "Missing references."); | |
7854 | BUG(); | |
7855 | } | |
94fcca9f | 7856 | *lookup_info = 0; |
1c4850e2 | 7857 | |
94fcca9f | 7858 | if (wc->stage == DROP_REFERENCE) { |
1c4850e2 | 7859 | if (wc->refs[level - 1] > 1) { |
1152651a | 7860 | need_account = true; |
94fcca9f YZ |
7861 | if (level == 1 && |
7862 | (wc->flags[0] & BTRFS_BLOCK_FLAG_FULL_BACKREF)) | |
7863 | goto skip; | |
7864 | ||
1c4850e2 YZ |
7865 | if (!wc->update_ref || |
7866 | generation <= root->root_key.offset) | |
7867 | goto skip; | |
7868 | ||
7869 | btrfs_node_key_to_cpu(path->nodes[level], &key, | |
7870 | path->slots[level]); | |
7871 | ret = btrfs_comp_cpu_keys(&key, &wc->update_progress); | |
7872 | if (ret < 0) | |
7873 | goto skip; | |
7874 | ||
7875 | wc->stage = UPDATE_BACKREF; | |
7876 | wc->shared_level = level - 1; | |
7877 | } | |
94fcca9f YZ |
7878 | } else { |
7879 | if (level == 1 && | |
7880 | (wc->flags[0] & BTRFS_BLOCK_FLAG_FULL_BACKREF)) | |
7881 | goto skip; | |
1c4850e2 YZ |
7882 | } |
7883 | ||
b9fab919 | 7884 | if (!btrfs_buffer_uptodate(next, generation, 0)) { |
1c4850e2 YZ |
7885 | btrfs_tree_unlock(next); |
7886 | free_extent_buffer(next); | |
7887 | next = NULL; | |
94fcca9f | 7888 | *lookup_info = 1; |
1c4850e2 YZ |
7889 | } |
7890 | ||
7891 | if (!next) { | |
7892 | if (reada && level == 1) | |
7893 | reada_walk_down(trans, root, wc, path); | |
ce86cd59 | 7894 | next = read_tree_block(root, bytenr, generation); |
416bc658 JB |
7895 | if (!next || !extent_buffer_uptodate(next)) { |
7896 | free_extent_buffer(next); | |
97d9a8a4 | 7897 | return -EIO; |
416bc658 | 7898 | } |
1c4850e2 YZ |
7899 | btrfs_tree_lock(next); |
7900 | btrfs_set_lock_blocking(next); | |
7901 | } | |
7902 | ||
7903 | level--; | |
7904 | BUG_ON(level != btrfs_header_level(next)); | |
7905 | path->nodes[level] = next; | |
7906 | path->slots[level] = 0; | |
bd681513 | 7907 | path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING; |
1c4850e2 YZ |
7908 | wc->level = level; |
7909 | if (wc->level == 1) | |
7910 | wc->reada_slot = 0; | |
7911 | return 0; | |
7912 | skip: | |
7913 | wc->refs[level - 1] = 0; | |
7914 | wc->flags[level - 1] = 0; | |
94fcca9f YZ |
7915 | if (wc->stage == DROP_REFERENCE) { |
7916 | if (wc->flags[level] & BTRFS_BLOCK_FLAG_FULL_BACKREF) { | |
7917 | parent = path->nodes[level]->start; | |
7918 | } else { | |
7919 | BUG_ON(root->root_key.objectid != | |
7920 | btrfs_header_owner(path->nodes[level])); | |
7921 | parent = 0; | |
7922 | } | |
1c4850e2 | 7923 | |
1152651a MF |
7924 | if (need_account) { |
7925 | ret = account_shared_subtree(trans, root, next, | |
7926 | generation, level - 1); | |
7927 | if (ret) { | |
7928 | printk_ratelimited(KERN_ERR "BTRFS: %s Error " | |
7929 | "%d accounting shared subtree. Quota " | |
7930 | "is out of sync, rescan required.\n", | |
7931 | root->fs_info->sb->s_id, ret); | |
7932 | } | |
7933 | } | |
94fcca9f | 7934 | ret = btrfs_free_extent(trans, root, bytenr, blocksize, parent, |
66d7e7f0 | 7935 | root->root_key.objectid, level - 1, 0, 0); |
79787eaa | 7936 | BUG_ON(ret); /* -ENOMEM */ |
1c4850e2 | 7937 | } |
1c4850e2 YZ |
7938 | btrfs_tree_unlock(next); |
7939 | free_extent_buffer(next); | |
94fcca9f | 7940 | *lookup_info = 1; |
1c4850e2 YZ |
7941 | return 1; |
7942 | } | |
7943 | ||
2c47e605 | 7944 | /* |
2c016dc2 | 7945 | * helper to process tree block while walking up the tree. |
2c47e605 YZ |
7946 | * |
7947 | * when wc->stage == DROP_REFERENCE, this function drops | |
7948 | * reference count on the block. | |
7949 | * | |
7950 | * when wc->stage == UPDATE_BACKREF, this function changes | |
7951 | * wc->stage back to DROP_REFERENCE if we changed wc->stage | |
7952 | * to UPDATE_BACKREF previously while processing the block. | |
7953 | * | |
7954 | * NOTE: return value 1 means we should stop walking up. | |
7955 | */ | |
7956 | static noinline int walk_up_proc(struct btrfs_trans_handle *trans, | |
7957 | struct btrfs_root *root, | |
7958 | struct btrfs_path *path, | |
7959 | struct walk_control *wc) | |
7960 | { | |
f0486c68 | 7961 | int ret; |
2c47e605 YZ |
7962 | int level = wc->level; |
7963 | struct extent_buffer *eb = path->nodes[level]; | |
7964 | u64 parent = 0; | |
7965 | ||
7966 | if (wc->stage == UPDATE_BACKREF) { | |
7967 | BUG_ON(wc->shared_level < level); | |
7968 | if (level < wc->shared_level) | |
7969 | goto out; | |
7970 | ||
2c47e605 YZ |
7971 | ret = find_next_key(path, level + 1, &wc->update_progress); |
7972 | if (ret > 0) | |
7973 | wc->update_ref = 0; | |
7974 | ||
7975 | wc->stage = DROP_REFERENCE; | |
7976 | wc->shared_level = -1; | |
7977 | path->slots[level] = 0; | |
7978 | ||
7979 | /* | |
7980 | * check reference count again if the block isn't locked. | |
7981 | * we should start walking down the tree again if reference | |
7982 | * count is one. | |
7983 | */ | |
7984 | if (!path->locks[level]) { | |
7985 | BUG_ON(level == 0); | |
7986 | btrfs_tree_lock(eb); | |
7987 | btrfs_set_lock_blocking(eb); | |
bd681513 | 7988 | path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING; |
2c47e605 YZ |
7989 | |
7990 | ret = btrfs_lookup_extent_info(trans, root, | |
3173a18f | 7991 | eb->start, level, 1, |
2c47e605 YZ |
7992 | &wc->refs[level], |
7993 | &wc->flags[level]); | |
79787eaa JM |
7994 | if (ret < 0) { |
7995 | btrfs_tree_unlock_rw(eb, path->locks[level]); | |
3268a246 | 7996 | path->locks[level] = 0; |
79787eaa JM |
7997 | return ret; |
7998 | } | |
2c47e605 YZ |
7999 | BUG_ON(wc->refs[level] == 0); |
8000 | if (wc->refs[level] == 1) { | |
bd681513 | 8001 | btrfs_tree_unlock_rw(eb, path->locks[level]); |
3268a246 | 8002 | path->locks[level] = 0; |
2c47e605 YZ |
8003 | return 1; |
8004 | } | |
f82d02d9 | 8005 | } |
2c47e605 | 8006 | } |
f82d02d9 | 8007 | |
2c47e605 YZ |
8008 | /* wc->stage == DROP_REFERENCE */ |
8009 | BUG_ON(wc->refs[level] > 1 && !path->locks[level]); | |
5d4f98a2 | 8010 | |
2c47e605 YZ |
8011 | if (wc->refs[level] == 1) { |
8012 | if (level == 0) { | |
8013 | if (wc->flags[level] & BTRFS_BLOCK_FLAG_FULL_BACKREF) | |
e339a6b0 | 8014 | ret = btrfs_dec_ref(trans, root, eb, 1); |
2c47e605 | 8015 | else |
e339a6b0 | 8016 | ret = btrfs_dec_ref(trans, root, eb, 0); |
79787eaa | 8017 | BUG_ON(ret); /* -ENOMEM */ |
1152651a MF |
8018 | ret = account_leaf_items(trans, root, eb); |
8019 | if (ret) { | |
8020 | printk_ratelimited(KERN_ERR "BTRFS: %s Error " | |
8021 | "%d accounting leaf items. Quota " | |
8022 | "is out of sync, rescan required.\n", | |
8023 | root->fs_info->sb->s_id, ret); | |
8024 | } | |
2c47e605 YZ |
8025 | } |
8026 | /* make block locked assertion in clean_tree_block happy */ | |
8027 | if (!path->locks[level] && | |
8028 | btrfs_header_generation(eb) == trans->transid) { | |
8029 | btrfs_tree_lock(eb); | |
8030 | btrfs_set_lock_blocking(eb); | |
bd681513 | 8031 | path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING; |
2c47e605 | 8032 | } |
01d58472 | 8033 | clean_tree_block(trans, root->fs_info, eb); |
2c47e605 YZ |
8034 | } |
8035 | ||
8036 | if (eb == root->node) { | |
8037 | if (wc->flags[level] & BTRFS_BLOCK_FLAG_FULL_BACKREF) | |
8038 | parent = eb->start; | |
8039 | else | |
8040 | BUG_ON(root->root_key.objectid != | |
8041 | btrfs_header_owner(eb)); | |
8042 | } else { | |
8043 | if (wc->flags[level + 1] & BTRFS_BLOCK_FLAG_FULL_BACKREF) | |
8044 | parent = path->nodes[level + 1]->start; | |
8045 | else | |
8046 | BUG_ON(root->root_key.objectid != | |
8047 | btrfs_header_owner(path->nodes[level + 1])); | |
f82d02d9 | 8048 | } |
f82d02d9 | 8049 | |
5581a51a | 8050 | btrfs_free_tree_block(trans, root, eb, parent, wc->refs[level] == 1); |
2c47e605 YZ |
8051 | out: |
8052 | wc->refs[level] = 0; | |
8053 | wc->flags[level] = 0; | |
f0486c68 | 8054 | return 0; |
2c47e605 YZ |
8055 | } |
8056 | ||
8057 | static noinline int walk_down_tree(struct btrfs_trans_handle *trans, | |
8058 | struct btrfs_root *root, | |
8059 | struct btrfs_path *path, | |
8060 | struct walk_control *wc) | |
8061 | { | |
2c47e605 | 8062 | int level = wc->level; |
94fcca9f | 8063 | int lookup_info = 1; |
2c47e605 YZ |
8064 | int ret; |
8065 | ||
8066 | while (level >= 0) { | |
94fcca9f | 8067 | ret = walk_down_proc(trans, root, path, wc, lookup_info); |
2c47e605 YZ |
8068 | if (ret > 0) |
8069 | break; | |
8070 | ||
8071 | if (level == 0) | |
8072 | break; | |
8073 | ||
7a7965f8 YZ |
8074 | if (path->slots[level] >= |
8075 | btrfs_header_nritems(path->nodes[level])) | |
8076 | break; | |
8077 | ||
94fcca9f | 8078 | ret = do_walk_down(trans, root, path, wc, &lookup_info); |
1c4850e2 YZ |
8079 | if (ret > 0) { |
8080 | path->slots[level]++; | |
8081 | continue; | |
90d2c51d MX |
8082 | } else if (ret < 0) |
8083 | return ret; | |
1c4850e2 | 8084 | level = wc->level; |
f82d02d9 | 8085 | } |
f82d02d9 YZ |
8086 | return 0; |
8087 | } | |
8088 | ||
d397712b | 8089 | static noinline int walk_up_tree(struct btrfs_trans_handle *trans, |
98ed5174 | 8090 | struct btrfs_root *root, |
f82d02d9 | 8091 | struct btrfs_path *path, |
2c47e605 | 8092 | struct walk_control *wc, int max_level) |
20524f02 | 8093 | { |
2c47e605 | 8094 | int level = wc->level; |
20524f02 | 8095 | int ret; |
9f3a7427 | 8096 | |
2c47e605 YZ |
8097 | path->slots[level] = btrfs_header_nritems(path->nodes[level]); |
8098 | while (level < max_level && path->nodes[level]) { | |
8099 | wc->level = level; | |
8100 | if (path->slots[level] + 1 < | |
8101 | btrfs_header_nritems(path->nodes[level])) { | |
8102 | path->slots[level]++; | |
20524f02 CM |
8103 | return 0; |
8104 | } else { | |
2c47e605 YZ |
8105 | ret = walk_up_proc(trans, root, path, wc); |
8106 | if (ret > 0) | |
8107 | return 0; | |
bd56b302 | 8108 | |
2c47e605 | 8109 | if (path->locks[level]) { |
bd681513 CM |
8110 | btrfs_tree_unlock_rw(path->nodes[level], |
8111 | path->locks[level]); | |
2c47e605 | 8112 | path->locks[level] = 0; |
f82d02d9 | 8113 | } |
2c47e605 YZ |
8114 | free_extent_buffer(path->nodes[level]); |
8115 | path->nodes[level] = NULL; | |
8116 | level++; | |
20524f02 CM |
8117 | } |
8118 | } | |
8119 | return 1; | |
8120 | } | |
8121 | ||
9aca1d51 | 8122 | /* |
2c47e605 YZ |
8123 | * drop a subvolume tree. |
8124 | * | |
8125 | * this function traverses the tree freeing any blocks that only | |
8126 | * referenced by the tree. | |
8127 | * | |
8128 | * when a shared tree block is found. this function decreases its | |
8129 | * reference count by one. if update_ref is true, this function | |
8130 | * also make sure backrefs for the shared block and all lower level | |
8131 | * blocks are properly updated. | |
9d1a2a3a DS |
8132 | * |
8133 | * If called with for_reloc == 0, may exit early with -EAGAIN | |
9aca1d51 | 8134 | */ |
2c536799 | 8135 | int btrfs_drop_snapshot(struct btrfs_root *root, |
66d7e7f0 AJ |
8136 | struct btrfs_block_rsv *block_rsv, int update_ref, |
8137 | int for_reloc) | |
20524f02 | 8138 | { |
5caf2a00 | 8139 | struct btrfs_path *path; |
2c47e605 YZ |
8140 | struct btrfs_trans_handle *trans; |
8141 | struct btrfs_root *tree_root = root->fs_info->tree_root; | |
9f3a7427 | 8142 | struct btrfs_root_item *root_item = &root->root_item; |
2c47e605 YZ |
8143 | struct walk_control *wc; |
8144 | struct btrfs_key key; | |
8145 | int err = 0; | |
8146 | int ret; | |
8147 | int level; | |
d29a9f62 | 8148 | bool root_dropped = false; |
20524f02 | 8149 | |
1152651a MF |
8150 | btrfs_debug(root->fs_info, "Drop subvolume %llu", root->objectid); |
8151 | ||
5caf2a00 | 8152 | path = btrfs_alloc_path(); |
cb1b69f4 TI |
8153 | if (!path) { |
8154 | err = -ENOMEM; | |
8155 | goto out; | |
8156 | } | |
20524f02 | 8157 | |
2c47e605 | 8158 | wc = kzalloc(sizeof(*wc), GFP_NOFS); |
38a1a919 MF |
8159 | if (!wc) { |
8160 | btrfs_free_path(path); | |
cb1b69f4 TI |
8161 | err = -ENOMEM; |
8162 | goto out; | |
38a1a919 | 8163 | } |
2c47e605 | 8164 | |
a22285a6 | 8165 | trans = btrfs_start_transaction(tree_root, 0); |
79787eaa JM |
8166 | if (IS_ERR(trans)) { |
8167 | err = PTR_ERR(trans); | |
8168 | goto out_free; | |
8169 | } | |
98d5dc13 | 8170 | |
3fd0a558 YZ |
8171 | if (block_rsv) |
8172 | trans->block_rsv = block_rsv; | |
2c47e605 | 8173 | |
9f3a7427 | 8174 | if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { |
2c47e605 | 8175 | level = btrfs_header_level(root->node); |
5d4f98a2 YZ |
8176 | path->nodes[level] = btrfs_lock_root_node(root); |
8177 | btrfs_set_lock_blocking(path->nodes[level]); | |
9f3a7427 | 8178 | path->slots[level] = 0; |
bd681513 | 8179 | path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING; |
2c47e605 YZ |
8180 | memset(&wc->update_progress, 0, |
8181 | sizeof(wc->update_progress)); | |
9f3a7427 | 8182 | } else { |
9f3a7427 | 8183 | btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); |
2c47e605 YZ |
8184 | memcpy(&wc->update_progress, &key, |
8185 | sizeof(wc->update_progress)); | |
8186 | ||
6702ed49 | 8187 | level = root_item->drop_level; |
2c47e605 | 8188 | BUG_ON(level == 0); |
6702ed49 | 8189 | path->lowest_level = level; |
2c47e605 YZ |
8190 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
8191 | path->lowest_level = 0; | |
8192 | if (ret < 0) { | |
8193 | err = ret; | |
79787eaa | 8194 | goto out_end_trans; |
9f3a7427 | 8195 | } |
1c4850e2 | 8196 | WARN_ON(ret > 0); |
2c47e605 | 8197 | |
7d9eb12c CM |
8198 | /* |
8199 | * unlock our path, this is safe because only this | |
8200 | * function is allowed to delete this snapshot | |
8201 | */ | |
5d4f98a2 | 8202 | btrfs_unlock_up_safe(path, 0); |
2c47e605 YZ |
8203 | |
8204 | level = btrfs_header_level(root->node); | |
8205 | while (1) { | |
8206 | btrfs_tree_lock(path->nodes[level]); | |
8207 | btrfs_set_lock_blocking(path->nodes[level]); | |
fec386ac | 8208 | path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING; |
2c47e605 YZ |
8209 | |
8210 | ret = btrfs_lookup_extent_info(trans, root, | |
8211 | path->nodes[level]->start, | |
3173a18f | 8212 | level, 1, &wc->refs[level], |
2c47e605 | 8213 | &wc->flags[level]); |
79787eaa JM |
8214 | if (ret < 0) { |
8215 | err = ret; | |
8216 | goto out_end_trans; | |
8217 | } | |
2c47e605 YZ |
8218 | BUG_ON(wc->refs[level] == 0); |
8219 | ||
8220 | if (level == root_item->drop_level) | |
8221 | break; | |
8222 | ||
8223 | btrfs_tree_unlock(path->nodes[level]); | |
fec386ac | 8224 | path->locks[level] = 0; |
2c47e605 YZ |
8225 | WARN_ON(wc->refs[level] != 1); |
8226 | level--; | |
8227 | } | |
9f3a7427 | 8228 | } |
2c47e605 YZ |
8229 | |
8230 | wc->level = level; | |
8231 | wc->shared_level = -1; | |
8232 | wc->stage = DROP_REFERENCE; | |
8233 | wc->update_ref = update_ref; | |
8234 | wc->keep_locks = 0; | |
66d7e7f0 | 8235 | wc->for_reloc = for_reloc; |
1c4850e2 | 8236 | wc->reada_count = BTRFS_NODEPTRS_PER_BLOCK(root); |
2c47e605 | 8237 | |
d397712b | 8238 | while (1) { |
9d1a2a3a | 8239 | |
2c47e605 YZ |
8240 | ret = walk_down_tree(trans, root, path, wc); |
8241 | if (ret < 0) { | |
8242 | err = ret; | |
20524f02 | 8243 | break; |
2c47e605 | 8244 | } |
9aca1d51 | 8245 | |
2c47e605 YZ |
8246 | ret = walk_up_tree(trans, root, path, wc, BTRFS_MAX_LEVEL); |
8247 | if (ret < 0) { | |
8248 | err = ret; | |
20524f02 | 8249 | break; |
2c47e605 YZ |
8250 | } |
8251 | ||
8252 | if (ret > 0) { | |
8253 | BUG_ON(wc->stage != DROP_REFERENCE); | |
e7a84565 CM |
8254 | break; |
8255 | } | |
2c47e605 YZ |
8256 | |
8257 | if (wc->stage == DROP_REFERENCE) { | |
8258 | level = wc->level; | |
8259 | btrfs_node_key(path->nodes[level], | |
8260 | &root_item->drop_progress, | |
8261 | path->slots[level]); | |
8262 | root_item->drop_level = level; | |
8263 | } | |
8264 | ||
8265 | BUG_ON(wc->level == 0); | |
3c8f2422 JB |
8266 | if (btrfs_should_end_transaction(trans, tree_root) || |
8267 | (!for_reloc && btrfs_need_cleaner_sleep(root))) { | |
2c47e605 YZ |
8268 | ret = btrfs_update_root(trans, tree_root, |
8269 | &root->root_key, | |
8270 | root_item); | |
79787eaa JM |
8271 | if (ret) { |
8272 | btrfs_abort_transaction(trans, tree_root, ret); | |
8273 | err = ret; | |
8274 | goto out_end_trans; | |
8275 | } | |
2c47e605 | 8276 | |
1152651a MF |
8277 | /* |
8278 | * Qgroup update accounting is run from | |
8279 | * delayed ref handling. This usually works | |
8280 | * out because delayed refs are normally the | |
8281 | * only way qgroup updates are added. However, | |
8282 | * we may have added updates during our tree | |
8283 | * walk so run qgroups here to make sure we | |
8284 | * don't lose any updates. | |
8285 | */ | |
8286 | ret = btrfs_delayed_qgroup_accounting(trans, | |
8287 | root->fs_info); | |
8288 | if (ret) | |
8289 | printk_ratelimited(KERN_ERR "BTRFS: Failure %d " | |
8290 | "running qgroup updates " | |
8291 | "during snapshot delete. " | |
8292 | "Quota is out of sync, " | |
8293 | "rescan required.\n", ret); | |
8294 | ||
3fd0a558 | 8295 | btrfs_end_transaction_throttle(trans, tree_root); |
3c8f2422 | 8296 | if (!for_reloc && btrfs_need_cleaner_sleep(root)) { |
efe120a0 | 8297 | pr_debug("BTRFS: drop snapshot early exit\n"); |
3c8f2422 JB |
8298 | err = -EAGAIN; |
8299 | goto out_free; | |
8300 | } | |
8301 | ||
a22285a6 | 8302 | trans = btrfs_start_transaction(tree_root, 0); |
79787eaa JM |
8303 | if (IS_ERR(trans)) { |
8304 | err = PTR_ERR(trans); | |
8305 | goto out_free; | |
8306 | } | |
3fd0a558 YZ |
8307 | if (block_rsv) |
8308 | trans->block_rsv = block_rsv; | |
c3e69d58 | 8309 | } |
20524f02 | 8310 | } |
b3b4aa74 | 8311 | btrfs_release_path(path); |
79787eaa JM |
8312 | if (err) |
8313 | goto out_end_trans; | |
2c47e605 YZ |
8314 | |
8315 | ret = btrfs_del_root(trans, tree_root, &root->root_key); | |
79787eaa JM |
8316 | if (ret) { |
8317 | btrfs_abort_transaction(trans, tree_root, ret); | |
8318 | goto out_end_trans; | |
8319 | } | |
2c47e605 | 8320 | |
76dda93c | 8321 | if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { |
cb517eab MX |
8322 | ret = btrfs_find_root(tree_root, &root->root_key, path, |
8323 | NULL, NULL); | |
79787eaa JM |
8324 | if (ret < 0) { |
8325 | btrfs_abort_transaction(trans, tree_root, ret); | |
8326 | err = ret; | |
8327 | goto out_end_trans; | |
8328 | } else if (ret > 0) { | |
84cd948c JB |
8329 | /* if we fail to delete the orphan item this time |
8330 | * around, it'll get picked up the next time. | |
8331 | * | |
8332 | * The most common failure here is just -ENOENT. | |
8333 | */ | |
8334 | btrfs_del_orphan_item(trans, tree_root, | |
8335 | root->root_key.objectid); | |
76dda93c YZ |
8336 | } |
8337 | } | |
8338 | ||
27cdeb70 | 8339 | if (test_bit(BTRFS_ROOT_IN_RADIX, &root->state)) { |
cb517eab | 8340 | btrfs_drop_and_free_fs_root(tree_root->fs_info, root); |
76dda93c YZ |
8341 | } else { |
8342 | free_extent_buffer(root->node); | |
8343 | free_extent_buffer(root->commit_root); | |
b0feb9d9 | 8344 | btrfs_put_fs_root(root); |
76dda93c | 8345 | } |
d29a9f62 | 8346 | root_dropped = true; |
79787eaa | 8347 | out_end_trans: |
1152651a MF |
8348 | ret = btrfs_delayed_qgroup_accounting(trans, tree_root->fs_info); |
8349 | if (ret) | |
8350 | printk_ratelimited(KERN_ERR "BTRFS: Failure %d " | |
8351 | "running qgroup updates " | |
8352 | "during snapshot delete. " | |
8353 | "Quota is out of sync, " | |
8354 | "rescan required.\n", ret); | |
8355 | ||
3fd0a558 | 8356 | btrfs_end_transaction_throttle(trans, tree_root); |
79787eaa | 8357 | out_free: |
2c47e605 | 8358 | kfree(wc); |
5caf2a00 | 8359 | btrfs_free_path(path); |
cb1b69f4 | 8360 | out: |
d29a9f62 JB |
8361 | /* |
8362 | * So if we need to stop dropping the snapshot for whatever reason we | |
8363 | * need to make sure to add it back to the dead root list so that we | |
8364 | * keep trying to do the work later. This also cleans up roots if we | |
8365 | * don't have it in the radix (like when we recover after a power fail | |
8366 | * or unmount) so we don't leak memory. | |
8367 | */ | |
b37b39cd | 8368 | if (!for_reloc && root_dropped == false) |
d29a9f62 | 8369 | btrfs_add_dead_root(root); |
90515e7f | 8370 | if (err && err != -EAGAIN) |
cb1b69f4 | 8371 | btrfs_std_error(root->fs_info, err); |
2c536799 | 8372 | return err; |
20524f02 | 8373 | } |
9078a3e1 | 8374 | |
2c47e605 YZ |
8375 | /* |
8376 | * drop subtree rooted at tree block 'node'. | |
8377 | * | |
8378 | * NOTE: this function will unlock and release tree block 'node' | |
66d7e7f0 | 8379 | * only used by relocation code |
2c47e605 | 8380 | */ |
f82d02d9 YZ |
8381 | int btrfs_drop_subtree(struct btrfs_trans_handle *trans, |
8382 | struct btrfs_root *root, | |
8383 | struct extent_buffer *node, | |
8384 | struct extent_buffer *parent) | |
8385 | { | |
8386 | struct btrfs_path *path; | |
2c47e605 | 8387 | struct walk_control *wc; |
f82d02d9 YZ |
8388 | int level; |
8389 | int parent_level; | |
8390 | int ret = 0; | |
8391 | int wret; | |
8392 | ||
2c47e605 YZ |
8393 | BUG_ON(root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); |
8394 | ||
f82d02d9 | 8395 | path = btrfs_alloc_path(); |
db5b493a TI |
8396 | if (!path) |
8397 | return -ENOMEM; | |
f82d02d9 | 8398 | |
2c47e605 | 8399 | wc = kzalloc(sizeof(*wc), GFP_NOFS); |
db5b493a TI |
8400 | if (!wc) { |
8401 | btrfs_free_path(path); | |
8402 | return -ENOMEM; | |
8403 | } | |
2c47e605 | 8404 | |
b9447ef8 | 8405 | btrfs_assert_tree_locked(parent); |
f82d02d9 YZ |
8406 | parent_level = btrfs_header_level(parent); |
8407 | extent_buffer_get(parent); | |
8408 | path->nodes[parent_level] = parent; | |
8409 | path->slots[parent_level] = btrfs_header_nritems(parent); | |
8410 | ||
b9447ef8 | 8411 | btrfs_assert_tree_locked(node); |
f82d02d9 | 8412 | level = btrfs_header_level(node); |
f82d02d9 YZ |
8413 | path->nodes[level] = node; |
8414 | path->slots[level] = 0; | |
bd681513 | 8415 | path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING; |
2c47e605 YZ |
8416 | |
8417 | wc->refs[parent_level] = 1; | |
8418 | wc->flags[parent_level] = BTRFS_BLOCK_FLAG_FULL_BACKREF; | |
8419 | wc->level = level; | |
8420 | wc->shared_level = -1; | |
8421 | wc->stage = DROP_REFERENCE; | |
8422 | wc->update_ref = 0; | |
8423 | wc->keep_locks = 1; | |
66d7e7f0 | 8424 | wc->for_reloc = 1; |
1c4850e2 | 8425 | wc->reada_count = BTRFS_NODEPTRS_PER_BLOCK(root); |
f82d02d9 YZ |
8426 | |
8427 | while (1) { | |
2c47e605 YZ |
8428 | wret = walk_down_tree(trans, root, path, wc); |
8429 | if (wret < 0) { | |
f82d02d9 | 8430 | ret = wret; |
f82d02d9 | 8431 | break; |
2c47e605 | 8432 | } |
f82d02d9 | 8433 | |
2c47e605 | 8434 | wret = walk_up_tree(trans, root, path, wc, parent_level); |
f82d02d9 YZ |
8435 | if (wret < 0) |
8436 | ret = wret; | |
8437 | if (wret != 0) | |
8438 | break; | |
8439 | } | |
8440 | ||
2c47e605 | 8441 | kfree(wc); |
f82d02d9 YZ |
8442 | btrfs_free_path(path); |
8443 | return ret; | |
8444 | } | |
8445 | ||
ec44a35c CM |
8446 | static u64 update_block_group_flags(struct btrfs_root *root, u64 flags) |
8447 | { | |
8448 | u64 num_devices; | |
fc67c450 | 8449 | u64 stripped; |
e4d8ec0f | 8450 | |
fc67c450 ID |
8451 | /* |
8452 | * if restripe for this chunk_type is on pick target profile and | |
8453 | * return, otherwise do the usual balance | |
8454 | */ | |
8455 | stripped = get_restripe_target(root->fs_info, flags); | |
8456 | if (stripped) | |
8457 | return extended_to_chunk(stripped); | |
e4d8ec0f | 8458 | |
95669976 | 8459 | num_devices = root->fs_info->fs_devices->rw_devices; |
cd02dca5 | 8460 | |
fc67c450 | 8461 | stripped = BTRFS_BLOCK_GROUP_RAID0 | |
53b381b3 | 8462 | BTRFS_BLOCK_GROUP_RAID5 | BTRFS_BLOCK_GROUP_RAID6 | |
fc67c450 ID |
8463 | BTRFS_BLOCK_GROUP_RAID1 | BTRFS_BLOCK_GROUP_RAID10; |
8464 | ||
ec44a35c CM |
8465 | if (num_devices == 1) { |
8466 | stripped |= BTRFS_BLOCK_GROUP_DUP; | |
8467 | stripped = flags & ~stripped; | |
8468 | ||
8469 | /* turn raid0 into single device chunks */ | |
8470 | if (flags & BTRFS_BLOCK_GROUP_RAID0) | |
8471 | return stripped; | |
8472 | ||
8473 | /* turn mirroring into duplication */ | |
8474 | if (flags & (BTRFS_BLOCK_GROUP_RAID1 | | |
8475 | BTRFS_BLOCK_GROUP_RAID10)) | |
8476 | return stripped | BTRFS_BLOCK_GROUP_DUP; | |
ec44a35c CM |
8477 | } else { |
8478 | /* they already had raid on here, just return */ | |
ec44a35c CM |
8479 | if (flags & stripped) |
8480 | return flags; | |
8481 | ||
8482 | stripped |= BTRFS_BLOCK_GROUP_DUP; | |
8483 | stripped = flags & ~stripped; | |
8484 | ||
8485 | /* switch duplicated blocks with raid1 */ | |
8486 | if (flags & BTRFS_BLOCK_GROUP_DUP) | |
8487 | return stripped | BTRFS_BLOCK_GROUP_RAID1; | |
8488 | ||
e3176ca2 | 8489 | /* this is drive concat, leave it alone */ |
ec44a35c | 8490 | } |
e3176ca2 | 8491 | |
ec44a35c CM |
8492 | return flags; |
8493 | } | |
8494 | ||
199c36ea | 8495 | static int set_block_group_ro(struct btrfs_block_group_cache *cache, int force) |
0ef3e66b | 8496 | { |
f0486c68 YZ |
8497 | struct btrfs_space_info *sinfo = cache->space_info; |
8498 | u64 num_bytes; | |
199c36ea | 8499 | u64 min_allocable_bytes; |
f0486c68 | 8500 | int ret = -ENOSPC; |
0ef3e66b | 8501 | |
c286ac48 | 8502 | |
199c36ea MX |
8503 | /* |
8504 | * We need some metadata space and system metadata space for | |
8505 | * allocating chunks in some corner cases until we force to set | |
8506 | * it to be readonly. | |
8507 | */ | |
8508 | if ((sinfo->flags & | |
8509 | (BTRFS_BLOCK_GROUP_SYSTEM | BTRFS_BLOCK_GROUP_METADATA)) && | |
8510 | !force) | |
8511 | min_allocable_bytes = 1 * 1024 * 1024; | |
8512 | else | |
8513 | min_allocable_bytes = 0; | |
8514 | ||
f0486c68 YZ |
8515 | spin_lock(&sinfo->lock); |
8516 | spin_lock(&cache->lock); | |
61cfea9b W |
8517 | |
8518 | if (cache->ro) { | |
8519 | ret = 0; | |
8520 | goto out; | |
8521 | } | |
8522 | ||
f0486c68 YZ |
8523 | num_bytes = cache->key.offset - cache->reserved - cache->pinned - |
8524 | cache->bytes_super - btrfs_block_group_used(&cache->item); | |
8525 | ||
8526 | if (sinfo->bytes_used + sinfo->bytes_reserved + sinfo->bytes_pinned + | |
37be25bc JB |
8527 | sinfo->bytes_may_use + sinfo->bytes_readonly + num_bytes + |
8528 | min_allocable_bytes <= sinfo->total_bytes) { | |
f0486c68 | 8529 | sinfo->bytes_readonly += num_bytes; |
f0486c68 | 8530 | cache->ro = 1; |
633c0aad | 8531 | list_add_tail(&cache->ro_list, &sinfo->ro_bgs); |
f0486c68 YZ |
8532 | ret = 0; |
8533 | } | |
61cfea9b | 8534 | out: |
f0486c68 YZ |
8535 | spin_unlock(&cache->lock); |
8536 | spin_unlock(&sinfo->lock); | |
8537 | return ret; | |
8538 | } | |
7d9eb12c | 8539 | |
f0486c68 YZ |
8540 | int btrfs_set_block_group_ro(struct btrfs_root *root, |
8541 | struct btrfs_block_group_cache *cache) | |
c286ac48 | 8542 | |
f0486c68 YZ |
8543 | { |
8544 | struct btrfs_trans_handle *trans; | |
8545 | u64 alloc_flags; | |
8546 | int ret; | |
7d9eb12c | 8547 | |
f0486c68 | 8548 | BUG_ON(cache->ro); |
0ef3e66b | 8549 | |
ff5714cc | 8550 | trans = btrfs_join_transaction(root); |
79787eaa JM |
8551 | if (IS_ERR(trans)) |
8552 | return PTR_ERR(trans); | |
5d4f98a2 | 8553 | |
199c36ea | 8554 | ret = set_block_group_ro(cache, 0); |
f0486c68 YZ |
8555 | if (!ret) |
8556 | goto out; | |
8557 | alloc_flags = get_alloc_profile(root, cache->space_info->flags); | |
698d0082 | 8558 | ret = do_chunk_alloc(trans, root, alloc_flags, |
0e4f8f88 | 8559 | CHUNK_ALLOC_FORCE); |
f0486c68 YZ |
8560 | if (ret < 0) |
8561 | goto out; | |
199c36ea | 8562 | ret = set_block_group_ro(cache, 0); |
f0486c68 | 8563 | out: |
2f081088 SL |
8564 | if (cache->flags & BTRFS_BLOCK_GROUP_SYSTEM) { |
8565 | alloc_flags = update_block_group_flags(root, cache->flags); | |
8566 | check_system_chunk(trans, root, alloc_flags); | |
8567 | } | |
8568 | ||
f0486c68 YZ |
8569 | btrfs_end_transaction(trans, root); |
8570 | return ret; | |
8571 | } | |
5d4f98a2 | 8572 | |
c87f08ca CM |
8573 | int btrfs_force_chunk_alloc(struct btrfs_trans_handle *trans, |
8574 | struct btrfs_root *root, u64 type) | |
8575 | { | |
8576 | u64 alloc_flags = get_alloc_profile(root, type); | |
698d0082 | 8577 | return do_chunk_alloc(trans, root, alloc_flags, |
0e4f8f88 | 8578 | CHUNK_ALLOC_FORCE); |
c87f08ca CM |
8579 | } |
8580 | ||
6d07bcec MX |
8581 | /* |
8582 | * helper to account the unused space of all the readonly block group in the | |
633c0aad | 8583 | * space_info. takes mirrors into account. |
6d07bcec | 8584 | */ |
633c0aad | 8585 | u64 btrfs_account_ro_block_groups_free_space(struct btrfs_space_info *sinfo) |
6d07bcec MX |
8586 | { |
8587 | struct btrfs_block_group_cache *block_group; | |
8588 | u64 free_bytes = 0; | |
8589 | int factor; | |
8590 | ||
633c0aad JB |
8591 | /* It's df, we don't care if it's racey */ |
8592 | if (list_empty(&sinfo->ro_bgs)) | |
8593 | return 0; | |
8594 | ||
8595 | spin_lock(&sinfo->lock); | |
8596 | list_for_each_entry(block_group, &sinfo->ro_bgs, ro_list) { | |
6d07bcec MX |
8597 | spin_lock(&block_group->lock); |
8598 | ||
8599 | if (!block_group->ro) { | |
8600 | spin_unlock(&block_group->lock); | |
8601 | continue; | |
8602 | } | |
8603 | ||
8604 | if (block_group->flags & (BTRFS_BLOCK_GROUP_RAID1 | | |
8605 | BTRFS_BLOCK_GROUP_RAID10 | | |
8606 | BTRFS_BLOCK_GROUP_DUP)) | |
8607 | factor = 2; | |
8608 | else | |
8609 | factor = 1; | |
8610 | ||
8611 | free_bytes += (block_group->key.offset - | |
8612 | btrfs_block_group_used(&block_group->item)) * | |
8613 | factor; | |
8614 | ||
8615 | spin_unlock(&block_group->lock); | |
8616 | } | |
6d07bcec MX |
8617 | spin_unlock(&sinfo->lock); |
8618 | ||
8619 | return free_bytes; | |
8620 | } | |
8621 | ||
143bede5 | 8622 | void btrfs_set_block_group_rw(struct btrfs_root *root, |
f0486c68 | 8623 | struct btrfs_block_group_cache *cache) |
5d4f98a2 | 8624 | { |
f0486c68 YZ |
8625 | struct btrfs_space_info *sinfo = cache->space_info; |
8626 | u64 num_bytes; | |
8627 | ||
8628 | BUG_ON(!cache->ro); | |
8629 | ||
8630 | spin_lock(&sinfo->lock); | |
8631 | spin_lock(&cache->lock); | |
8632 | num_bytes = cache->key.offset - cache->reserved - cache->pinned - | |
8633 | cache->bytes_super - btrfs_block_group_used(&cache->item); | |
8634 | sinfo->bytes_readonly -= num_bytes; | |
8635 | cache->ro = 0; | |
633c0aad | 8636 | list_del_init(&cache->ro_list); |
f0486c68 YZ |
8637 | spin_unlock(&cache->lock); |
8638 | spin_unlock(&sinfo->lock); | |
5d4f98a2 YZ |
8639 | } |
8640 | ||
ba1bf481 JB |
8641 | /* |
8642 | * checks to see if its even possible to relocate this block group. | |
8643 | * | |
8644 | * @return - -1 if it's not a good idea to relocate this block group, 0 if its | |
8645 | * ok to go ahead and try. | |
8646 | */ | |
8647 | int btrfs_can_relocate(struct btrfs_root *root, u64 bytenr) | |
1a40e23b | 8648 | { |
ba1bf481 JB |
8649 | struct btrfs_block_group_cache *block_group; |
8650 | struct btrfs_space_info *space_info; | |
8651 | struct btrfs_fs_devices *fs_devices = root->fs_info->fs_devices; | |
8652 | struct btrfs_device *device; | |
6df9a95e | 8653 | struct btrfs_trans_handle *trans; |
cdcb725c | 8654 | u64 min_free; |
6719db6a JB |
8655 | u64 dev_min = 1; |
8656 | u64 dev_nr = 0; | |
4a5e98f5 | 8657 | u64 target; |
cdcb725c | 8658 | int index; |
ba1bf481 JB |
8659 | int full = 0; |
8660 | int ret = 0; | |
1a40e23b | 8661 | |
ba1bf481 | 8662 | block_group = btrfs_lookup_block_group(root->fs_info, bytenr); |
1a40e23b | 8663 | |
ba1bf481 JB |
8664 | /* odd, couldn't find the block group, leave it alone */ |
8665 | if (!block_group) | |
8666 | return -1; | |
1a40e23b | 8667 | |
cdcb725c | 8668 | min_free = btrfs_block_group_used(&block_group->item); |
8669 | ||
ba1bf481 | 8670 | /* no bytes used, we're good */ |
cdcb725c | 8671 | if (!min_free) |
1a40e23b ZY |
8672 | goto out; |
8673 | ||
ba1bf481 JB |
8674 | space_info = block_group->space_info; |
8675 | spin_lock(&space_info->lock); | |
17d217fe | 8676 | |
ba1bf481 | 8677 | full = space_info->full; |
17d217fe | 8678 | |
ba1bf481 JB |
8679 | /* |
8680 | * if this is the last block group we have in this space, we can't | |
7ce618db CM |
8681 | * relocate it unless we're able to allocate a new chunk below. |
8682 | * | |
8683 | * Otherwise, we need to make sure we have room in the space to handle | |
8684 | * all of the extents from this block group. If we can, we're good | |
ba1bf481 | 8685 | */ |
7ce618db | 8686 | if ((space_info->total_bytes != block_group->key.offset) && |
cdcb725c | 8687 | (space_info->bytes_used + space_info->bytes_reserved + |
8688 | space_info->bytes_pinned + space_info->bytes_readonly + | |
8689 | min_free < space_info->total_bytes)) { | |
ba1bf481 JB |
8690 | spin_unlock(&space_info->lock); |
8691 | goto out; | |
17d217fe | 8692 | } |
ba1bf481 | 8693 | spin_unlock(&space_info->lock); |
ea8c2819 | 8694 | |
ba1bf481 JB |
8695 | /* |
8696 | * ok we don't have enough space, but maybe we have free space on our | |
8697 | * devices to allocate new chunks for relocation, so loop through our | |
4a5e98f5 ID |
8698 | * alloc devices and guess if we have enough space. if this block |
8699 | * group is going to be restriped, run checks against the target | |
8700 | * profile instead of the current one. | |
ba1bf481 JB |
8701 | */ |
8702 | ret = -1; | |
ea8c2819 | 8703 | |
cdcb725c | 8704 | /* |
8705 | * index: | |
8706 | * 0: raid10 | |
8707 | * 1: raid1 | |
8708 | * 2: dup | |
8709 | * 3: raid0 | |
8710 | * 4: single | |
8711 | */ | |
4a5e98f5 ID |
8712 | target = get_restripe_target(root->fs_info, block_group->flags); |
8713 | if (target) { | |
31e50229 | 8714 | index = __get_raid_index(extended_to_chunk(target)); |
4a5e98f5 ID |
8715 | } else { |
8716 | /* | |
8717 | * this is just a balance, so if we were marked as full | |
8718 | * we know there is no space for a new chunk | |
8719 | */ | |
8720 | if (full) | |
8721 | goto out; | |
8722 | ||
8723 | index = get_block_group_index(block_group); | |
8724 | } | |
8725 | ||
e6ec716f | 8726 | if (index == BTRFS_RAID_RAID10) { |
cdcb725c | 8727 | dev_min = 4; |
6719db6a JB |
8728 | /* Divide by 2 */ |
8729 | min_free >>= 1; | |
e6ec716f | 8730 | } else if (index == BTRFS_RAID_RAID1) { |
cdcb725c | 8731 | dev_min = 2; |
e6ec716f | 8732 | } else if (index == BTRFS_RAID_DUP) { |
6719db6a JB |
8733 | /* Multiply by 2 */ |
8734 | min_free <<= 1; | |
e6ec716f | 8735 | } else if (index == BTRFS_RAID_RAID0) { |
cdcb725c | 8736 | dev_min = fs_devices->rw_devices; |
47c5713f | 8737 | min_free = div64_u64(min_free, dev_min); |
cdcb725c | 8738 | } |
8739 | ||
6df9a95e JB |
8740 | /* We need to do this so that we can look at pending chunks */ |
8741 | trans = btrfs_join_transaction(root); | |
8742 | if (IS_ERR(trans)) { | |
8743 | ret = PTR_ERR(trans); | |
8744 | goto out; | |
8745 | } | |
8746 | ||
ba1bf481 JB |
8747 | mutex_lock(&root->fs_info->chunk_mutex); |
8748 | list_for_each_entry(device, &fs_devices->alloc_list, dev_alloc_list) { | |
7bfc837d | 8749 | u64 dev_offset; |
56bec294 | 8750 | |
ba1bf481 JB |
8751 | /* |
8752 | * check to make sure we can actually find a chunk with enough | |
8753 | * space to fit our block group in. | |
8754 | */ | |
63a212ab SB |
8755 | if (device->total_bytes > device->bytes_used + min_free && |
8756 | !device->is_tgtdev_for_dev_replace) { | |
6df9a95e | 8757 | ret = find_free_dev_extent(trans, device, min_free, |
7bfc837d | 8758 | &dev_offset, NULL); |
ba1bf481 | 8759 | if (!ret) |
cdcb725c | 8760 | dev_nr++; |
8761 | ||
8762 | if (dev_nr >= dev_min) | |
73e48b27 | 8763 | break; |
cdcb725c | 8764 | |
ba1bf481 | 8765 | ret = -1; |
725c8463 | 8766 | } |
edbd8d4e | 8767 | } |
ba1bf481 | 8768 | mutex_unlock(&root->fs_info->chunk_mutex); |
6df9a95e | 8769 | btrfs_end_transaction(trans, root); |
edbd8d4e | 8770 | out: |
ba1bf481 | 8771 | btrfs_put_block_group(block_group); |
edbd8d4e CM |
8772 | return ret; |
8773 | } | |
8774 | ||
b2950863 CH |
8775 | static int find_first_block_group(struct btrfs_root *root, |
8776 | struct btrfs_path *path, struct btrfs_key *key) | |
0b86a832 | 8777 | { |
925baedd | 8778 | int ret = 0; |
0b86a832 CM |
8779 | struct btrfs_key found_key; |
8780 | struct extent_buffer *leaf; | |
8781 | int slot; | |
edbd8d4e | 8782 | |
0b86a832 CM |
8783 | ret = btrfs_search_slot(NULL, root, key, path, 0, 0); |
8784 | if (ret < 0) | |
925baedd CM |
8785 | goto out; |
8786 | ||
d397712b | 8787 | while (1) { |
0b86a832 | 8788 | slot = path->slots[0]; |
edbd8d4e | 8789 | leaf = path->nodes[0]; |
0b86a832 CM |
8790 | if (slot >= btrfs_header_nritems(leaf)) { |
8791 | ret = btrfs_next_leaf(root, path); | |
8792 | if (ret == 0) | |
8793 | continue; | |
8794 | if (ret < 0) | |
925baedd | 8795 | goto out; |
0b86a832 | 8796 | break; |
edbd8d4e | 8797 | } |
0b86a832 | 8798 | btrfs_item_key_to_cpu(leaf, &found_key, slot); |
edbd8d4e | 8799 | |
0b86a832 | 8800 | if (found_key.objectid >= key->objectid && |
925baedd CM |
8801 | found_key.type == BTRFS_BLOCK_GROUP_ITEM_KEY) { |
8802 | ret = 0; | |
8803 | goto out; | |
8804 | } | |
0b86a832 | 8805 | path->slots[0]++; |
edbd8d4e | 8806 | } |
925baedd | 8807 | out: |
0b86a832 | 8808 | return ret; |
edbd8d4e CM |
8809 | } |
8810 | ||
0af3d00b JB |
8811 | void btrfs_put_block_group_cache(struct btrfs_fs_info *info) |
8812 | { | |
8813 | struct btrfs_block_group_cache *block_group; | |
8814 | u64 last = 0; | |
8815 | ||
8816 | while (1) { | |
8817 | struct inode *inode; | |
8818 | ||
8819 | block_group = btrfs_lookup_first_block_group(info, last); | |
8820 | while (block_group) { | |
8821 | spin_lock(&block_group->lock); | |
8822 | if (block_group->iref) | |
8823 | break; | |
8824 | spin_unlock(&block_group->lock); | |
8825 | block_group = next_block_group(info->tree_root, | |
8826 | block_group); | |
8827 | } | |
8828 | if (!block_group) { | |
8829 | if (last == 0) | |
8830 | break; | |
8831 | last = 0; | |
8832 | continue; | |
8833 | } | |
8834 | ||
8835 | inode = block_group->inode; | |
8836 | block_group->iref = 0; | |
8837 | block_group->inode = NULL; | |
8838 | spin_unlock(&block_group->lock); | |
8839 | iput(inode); | |
8840 | last = block_group->key.objectid + block_group->key.offset; | |
8841 | btrfs_put_block_group(block_group); | |
8842 | } | |
8843 | } | |
8844 | ||
1a40e23b ZY |
8845 | int btrfs_free_block_groups(struct btrfs_fs_info *info) |
8846 | { | |
8847 | struct btrfs_block_group_cache *block_group; | |
4184ea7f | 8848 | struct btrfs_space_info *space_info; |
11833d66 | 8849 | struct btrfs_caching_control *caching_ctl; |
1a40e23b ZY |
8850 | struct rb_node *n; |
8851 | ||
9e351cc8 | 8852 | down_write(&info->commit_root_sem); |
11833d66 YZ |
8853 | while (!list_empty(&info->caching_block_groups)) { |
8854 | caching_ctl = list_entry(info->caching_block_groups.next, | |
8855 | struct btrfs_caching_control, list); | |
8856 | list_del(&caching_ctl->list); | |
8857 | put_caching_control(caching_ctl); | |
8858 | } | |
9e351cc8 | 8859 | up_write(&info->commit_root_sem); |
11833d66 | 8860 | |
47ab2a6c JB |
8861 | spin_lock(&info->unused_bgs_lock); |
8862 | while (!list_empty(&info->unused_bgs)) { | |
8863 | block_group = list_first_entry(&info->unused_bgs, | |
8864 | struct btrfs_block_group_cache, | |
8865 | bg_list); | |
8866 | list_del_init(&block_group->bg_list); | |
8867 | btrfs_put_block_group(block_group); | |
8868 | } | |
8869 | spin_unlock(&info->unused_bgs_lock); | |
8870 | ||
1a40e23b ZY |
8871 | spin_lock(&info->block_group_cache_lock); |
8872 | while ((n = rb_last(&info->block_group_cache_tree)) != NULL) { | |
8873 | block_group = rb_entry(n, struct btrfs_block_group_cache, | |
8874 | cache_node); | |
1a40e23b ZY |
8875 | rb_erase(&block_group->cache_node, |
8876 | &info->block_group_cache_tree); | |
01eacb27 | 8877 | RB_CLEAR_NODE(&block_group->cache_node); |
d899e052 YZ |
8878 | spin_unlock(&info->block_group_cache_lock); |
8879 | ||
80eb234a | 8880 | down_write(&block_group->space_info->groups_sem); |
1a40e23b | 8881 | list_del(&block_group->list); |
80eb234a | 8882 | up_write(&block_group->space_info->groups_sem); |
d2fb3437 | 8883 | |
817d52f8 | 8884 | if (block_group->cached == BTRFS_CACHE_STARTED) |
11833d66 | 8885 | wait_block_group_cache_done(block_group); |
817d52f8 | 8886 | |
3c14874a JB |
8887 | /* |
8888 | * We haven't cached this block group, which means we could | |
8889 | * possibly have excluded extents on this block group. | |
8890 | */ | |
36cce922 JB |
8891 | if (block_group->cached == BTRFS_CACHE_NO || |
8892 | block_group->cached == BTRFS_CACHE_ERROR) | |
3c14874a JB |
8893 | free_excluded_extents(info->extent_root, block_group); |
8894 | ||
817d52f8 | 8895 | btrfs_remove_free_space_cache(block_group); |
11dfe35a | 8896 | btrfs_put_block_group(block_group); |
d899e052 YZ |
8897 | |
8898 | spin_lock(&info->block_group_cache_lock); | |
1a40e23b ZY |
8899 | } |
8900 | spin_unlock(&info->block_group_cache_lock); | |
4184ea7f CM |
8901 | |
8902 | /* now that all the block groups are freed, go through and | |
8903 | * free all the space_info structs. This is only called during | |
8904 | * the final stages of unmount, and so we know nobody is | |
8905 | * using them. We call synchronize_rcu() once before we start, | |
8906 | * just to be on the safe side. | |
8907 | */ | |
8908 | synchronize_rcu(); | |
8909 | ||
8929ecfa YZ |
8910 | release_global_block_rsv(info); |
8911 | ||
67871254 | 8912 | while (!list_empty(&info->space_info)) { |
6ab0a202 JM |
8913 | int i; |
8914 | ||
4184ea7f CM |
8915 | space_info = list_entry(info->space_info.next, |
8916 | struct btrfs_space_info, | |
8917 | list); | |
b069e0c3 | 8918 | if (btrfs_test_opt(info->tree_root, ENOSPC_DEBUG)) { |
fae7f21c | 8919 | if (WARN_ON(space_info->bytes_pinned > 0 || |
b069e0c3 | 8920 | space_info->bytes_reserved > 0 || |
fae7f21c | 8921 | space_info->bytes_may_use > 0)) { |
b069e0c3 DS |
8922 | dump_space_info(space_info, 0, 0); |
8923 | } | |
f0486c68 | 8924 | } |
4184ea7f | 8925 | list_del(&space_info->list); |
6ab0a202 JM |
8926 | for (i = 0; i < BTRFS_NR_RAID_TYPES; i++) { |
8927 | struct kobject *kobj; | |
c1895442 JM |
8928 | kobj = space_info->block_group_kobjs[i]; |
8929 | space_info->block_group_kobjs[i] = NULL; | |
8930 | if (kobj) { | |
6ab0a202 JM |
8931 | kobject_del(kobj); |
8932 | kobject_put(kobj); | |
8933 | } | |
8934 | } | |
8935 | kobject_del(&space_info->kobj); | |
8936 | kobject_put(&space_info->kobj); | |
4184ea7f | 8937 | } |
1a40e23b ZY |
8938 | return 0; |
8939 | } | |
8940 | ||
b742bb82 YZ |
8941 | static void __link_block_group(struct btrfs_space_info *space_info, |
8942 | struct btrfs_block_group_cache *cache) | |
8943 | { | |
8944 | int index = get_block_group_index(cache); | |
ed55b6ac | 8945 | bool first = false; |
b742bb82 YZ |
8946 | |
8947 | down_write(&space_info->groups_sem); | |
ed55b6ac JM |
8948 | if (list_empty(&space_info->block_groups[index])) |
8949 | first = true; | |
8950 | list_add_tail(&cache->list, &space_info->block_groups[index]); | |
8951 | up_write(&space_info->groups_sem); | |
8952 | ||
8953 | if (first) { | |
c1895442 | 8954 | struct raid_kobject *rkobj; |
6ab0a202 JM |
8955 | int ret; |
8956 | ||
c1895442 JM |
8957 | rkobj = kzalloc(sizeof(*rkobj), GFP_NOFS); |
8958 | if (!rkobj) | |
8959 | goto out_err; | |
8960 | rkobj->raid_type = index; | |
8961 | kobject_init(&rkobj->kobj, &btrfs_raid_ktype); | |
8962 | ret = kobject_add(&rkobj->kobj, &space_info->kobj, | |
8963 | "%s", get_raid_name(index)); | |
6ab0a202 | 8964 | if (ret) { |
c1895442 JM |
8965 | kobject_put(&rkobj->kobj); |
8966 | goto out_err; | |
6ab0a202 | 8967 | } |
c1895442 | 8968 | space_info->block_group_kobjs[index] = &rkobj->kobj; |
6ab0a202 | 8969 | } |
c1895442 JM |
8970 | |
8971 | return; | |
8972 | out_err: | |
8973 | pr_warn("BTRFS: failed to add kobject for block cache. ignoring.\n"); | |
b742bb82 YZ |
8974 | } |
8975 | ||
920e4a58 MX |
8976 | static struct btrfs_block_group_cache * |
8977 | btrfs_create_block_group_cache(struct btrfs_root *root, u64 start, u64 size) | |
8978 | { | |
8979 | struct btrfs_block_group_cache *cache; | |
8980 | ||
8981 | cache = kzalloc(sizeof(*cache), GFP_NOFS); | |
8982 | if (!cache) | |
8983 | return NULL; | |
8984 | ||
8985 | cache->free_space_ctl = kzalloc(sizeof(*cache->free_space_ctl), | |
8986 | GFP_NOFS); | |
8987 | if (!cache->free_space_ctl) { | |
8988 | kfree(cache); | |
8989 | return NULL; | |
8990 | } | |
8991 | ||
8992 | cache->key.objectid = start; | |
8993 | cache->key.offset = size; | |
8994 | cache->key.type = BTRFS_BLOCK_GROUP_ITEM_KEY; | |
8995 | ||
8996 | cache->sectorsize = root->sectorsize; | |
8997 | cache->fs_info = root->fs_info; | |
8998 | cache->full_stripe_len = btrfs_full_stripe_len(root, | |
8999 | &root->fs_info->mapping_tree, | |
9000 | start); | |
9001 | atomic_set(&cache->count, 1); | |
9002 | spin_lock_init(&cache->lock); | |
e570fd27 | 9003 | init_rwsem(&cache->data_rwsem); |
920e4a58 MX |
9004 | INIT_LIST_HEAD(&cache->list); |
9005 | INIT_LIST_HEAD(&cache->cluster_list); | |
47ab2a6c | 9006 | INIT_LIST_HEAD(&cache->bg_list); |
633c0aad | 9007 | INIT_LIST_HEAD(&cache->ro_list); |
ce93ec54 | 9008 | INIT_LIST_HEAD(&cache->dirty_list); |
920e4a58 | 9009 | btrfs_init_free_space_ctl(cache); |
04216820 | 9010 | atomic_set(&cache->trimming, 0); |
920e4a58 MX |
9011 | |
9012 | return cache; | |
9013 | } | |
9014 | ||
9078a3e1 CM |
9015 | int btrfs_read_block_groups(struct btrfs_root *root) |
9016 | { | |
9017 | struct btrfs_path *path; | |
9018 | int ret; | |
9078a3e1 | 9019 | struct btrfs_block_group_cache *cache; |
be744175 | 9020 | struct btrfs_fs_info *info = root->fs_info; |
6324fbf3 | 9021 | struct btrfs_space_info *space_info; |
9078a3e1 CM |
9022 | struct btrfs_key key; |
9023 | struct btrfs_key found_key; | |
5f39d397 | 9024 | struct extent_buffer *leaf; |
0af3d00b JB |
9025 | int need_clear = 0; |
9026 | u64 cache_gen; | |
96b5179d | 9027 | |
be744175 | 9028 | root = info->extent_root; |
9078a3e1 | 9029 | key.objectid = 0; |
0b86a832 | 9030 | key.offset = 0; |
962a298f | 9031 | key.type = BTRFS_BLOCK_GROUP_ITEM_KEY; |
9078a3e1 CM |
9032 | path = btrfs_alloc_path(); |
9033 | if (!path) | |
9034 | return -ENOMEM; | |
026fd317 | 9035 | path->reada = 1; |
9078a3e1 | 9036 | |
6c41761f | 9037 | cache_gen = btrfs_super_cache_generation(root->fs_info->super_copy); |
73bc1876 | 9038 | if (btrfs_test_opt(root, SPACE_CACHE) && |
6c41761f | 9039 | btrfs_super_generation(root->fs_info->super_copy) != cache_gen) |
0af3d00b | 9040 | need_clear = 1; |
88c2ba3b JB |
9041 | if (btrfs_test_opt(root, CLEAR_CACHE)) |
9042 | need_clear = 1; | |
0af3d00b | 9043 | |
d397712b | 9044 | while (1) { |
0b86a832 | 9045 | ret = find_first_block_group(root, path, &key); |
b742bb82 YZ |
9046 | if (ret > 0) |
9047 | break; | |
0b86a832 CM |
9048 | if (ret != 0) |
9049 | goto error; | |
920e4a58 | 9050 | |
5f39d397 CM |
9051 | leaf = path->nodes[0]; |
9052 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
920e4a58 MX |
9053 | |
9054 | cache = btrfs_create_block_group_cache(root, found_key.objectid, | |
9055 | found_key.offset); | |
9078a3e1 | 9056 | if (!cache) { |
0b86a832 | 9057 | ret = -ENOMEM; |
f0486c68 | 9058 | goto error; |
9078a3e1 | 9059 | } |
96303081 | 9060 | |
cf7c1ef6 LB |
9061 | if (need_clear) { |
9062 | /* | |
9063 | * When we mount with old space cache, we need to | |
9064 | * set BTRFS_DC_CLEAR and set dirty flag. | |
9065 | * | |
9066 | * a) Setting 'BTRFS_DC_CLEAR' makes sure that we | |
9067 | * truncate the old free space cache inode and | |
9068 | * setup a new one. | |
9069 | * b) Setting 'dirty flag' makes sure that we flush | |
9070 | * the new space cache info onto disk. | |
9071 | */ | |
cf7c1ef6 | 9072 | if (btrfs_test_opt(root, SPACE_CACHE)) |
ce93ec54 | 9073 | cache->disk_cache_state = BTRFS_DC_CLEAR; |
cf7c1ef6 | 9074 | } |
0af3d00b | 9075 | |
5f39d397 CM |
9076 | read_extent_buffer(leaf, &cache->item, |
9077 | btrfs_item_ptr_offset(leaf, path->slots[0]), | |
9078 | sizeof(cache->item)); | |
920e4a58 | 9079 | cache->flags = btrfs_block_group_flags(&cache->item); |
0b86a832 | 9080 | |
9078a3e1 | 9081 | key.objectid = found_key.objectid + found_key.offset; |
b3b4aa74 | 9082 | btrfs_release_path(path); |
34d52cb6 | 9083 | |
3c14874a JB |
9084 | /* |
9085 | * We need to exclude the super stripes now so that the space | |
9086 | * info has super bytes accounted for, otherwise we'll think | |
9087 | * we have more space than we actually do. | |
9088 | */ | |
835d974f JB |
9089 | ret = exclude_super_stripes(root, cache); |
9090 | if (ret) { | |
9091 | /* | |
9092 | * We may have excluded something, so call this just in | |
9093 | * case. | |
9094 | */ | |
9095 | free_excluded_extents(root, cache); | |
920e4a58 | 9096 | btrfs_put_block_group(cache); |
835d974f JB |
9097 | goto error; |
9098 | } | |
3c14874a | 9099 | |
817d52f8 JB |
9100 | /* |
9101 | * check for two cases, either we are full, and therefore | |
9102 | * don't need to bother with the caching work since we won't | |
9103 | * find any space, or we are empty, and we can just add all | |
9104 | * the space in and be done with it. This saves us _alot_ of | |
9105 | * time, particularly in the full case. | |
9106 | */ | |
9107 | if (found_key.offset == btrfs_block_group_used(&cache->item)) { | |
11833d66 | 9108 | cache->last_byte_to_unpin = (u64)-1; |
817d52f8 | 9109 | cache->cached = BTRFS_CACHE_FINISHED; |
1b2da372 | 9110 | free_excluded_extents(root, cache); |
817d52f8 | 9111 | } else if (btrfs_block_group_used(&cache->item) == 0) { |
11833d66 | 9112 | cache->last_byte_to_unpin = (u64)-1; |
817d52f8 JB |
9113 | cache->cached = BTRFS_CACHE_FINISHED; |
9114 | add_new_free_space(cache, root->fs_info, | |
9115 | found_key.objectid, | |
9116 | found_key.objectid + | |
9117 | found_key.offset); | |
11833d66 | 9118 | free_excluded_extents(root, cache); |
817d52f8 | 9119 | } |
96b5179d | 9120 | |
8c579fe7 JB |
9121 | ret = btrfs_add_block_group_cache(root->fs_info, cache); |
9122 | if (ret) { | |
9123 | btrfs_remove_free_space_cache(cache); | |
9124 | btrfs_put_block_group(cache); | |
9125 | goto error; | |
9126 | } | |
9127 | ||
6324fbf3 CM |
9128 | ret = update_space_info(info, cache->flags, found_key.offset, |
9129 | btrfs_block_group_used(&cache->item), | |
9130 | &space_info); | |
8c579fe7 JB |
9131 | if (ret) { |
9132 | btrfs_remove_free_space_cache(cache); | |
9133 | spin_lock(&info->block_group_cache_lock); | |
9134 | rb_erase(&cache->cache_node, | |
9135 | &info->block_group_cache_tree); | |
01eacb27 | 9136 | RB_CLEAR_NODE(&cache->cache_node); |
8c579fe7 JB |
9137 | spin_unlock(&info->block_group_cache_lock); |
9138 | btrfs_put_block_group(cache); | |
9139 | goto error; | |
9140 | } | |
9141 | ||
6324fbf3 | 9142 | cache->space_info = space_info; |
1b2da372 | 9143 | spin_lock(&cache->space_info->lock); |
f0486c68 | 9144 | cache->space_info->bytes_readonly += cache->bytes_super; |
1b2da372 JB |
9145 | spin_unlock(&cache->space_info->lock); |
9146 | ||
b742bb82 | 9147 | __link_block_group(space_info, cache); |
0f9dd46c | 9148 | |
75ccf47d | 9149 | set_avail_alloc_bits(root->fs_info, cache->flags); |
47ab2a6c | 9150 | if (btrfs_chunk_readonly(root, cache->key.objectid)) { |
199c36ea | 9151 | set_block_group_ro(cache, 1); |
47ab2a6c JB |
9152 | } else if (btrfs_block_group_used(&cache->item) == 0) { |
9153 | spin_lock(&info->unused_bgs_lock); | |
9154 | /* Should always be true but just in case. */ | |
9155 | if (list_empty(&cache->bg_list)) { | |
9156 | btrfs_get_block_group(cache); | |
9157 | list_add_tail(&cache->bg_list, | |
9158 | &info->unused_bgs); | |
9159 | } | |
9160 | spin_unlock(&info->unused_bgs_lock); | |
9161 | } | |
9078a3e1 | 9162 | } |
b742bb82 YZ |
9163 | |
9164 | list_for_each_entry_rcu(space_info, &root->fs_info->space_info, list) { | |
9165 | if (!(get_alloc_profile(root, space_info->flags) & | |
9166 | (BTRFS_BLOCK_GROUP_RAID10 | | |
9167 | BTRFS_BLOCK_GROUP_RAID1 | | |
53b381b3 DW |
9168 | BTRFS_BLOCK_GROUP_RAID5 | |
9169 | BTRFS_BLOCK_GROUP_RAID6 | | |
b742bb82 YZ |
9170 | BTRFS_BLOCK_GROUP_DUP))) |
9171 | continue; | |
9172 | /* | |
9173 | * avoid allocating from un-mirrored block group if there are | |
9174 | * mirrored block groups. | |
9175 | */ | |
1095cc0d | 9176 | list_for_each_entry(cache, |
9177 | &space_info->block_groups[BTRFS_RAID_RAID0], | |
9178 | list) | |
199c36ea | 9179 | set_block_group_ro(cache, 1); |
1095cc0d | 9180 | list_for_each_entry(cache, |
9181 | &space_info->block_groups[BTRFS_RAID_SINGLE], | |
9182 | list) | |
199c36ea | 9183 | set_block_group_ro(cache, 1); |
9078a3e1 | 9184 | } |
f0486c68 YZ |
9185 | |
9186 | init_global_block_rsv(info); | |
0b86a832 CM |
9187 | ret = 0; |
9188 | error: | |
9078a3e1 | 9189 | btrfs_free_path(path); |
0b86a832 | 9190 | return ret; |
9078a3e1 | 9191 | } |
6324fbf3 | 9192 | |
ea658bad JB |
9193 | void btrfs_create_pending_block_groups(struct btrfs_trans_handle *trans, |
9194 | struct btrfs_root *root) | |
9195 | { | |
9196 | struct btrfs_block_group_cache *block_group, *tmp; | |
9197 | struct btrfs_root *extent_root = root->fs_info->extent_root; | |
9198 | struct btrfs_block_group_item item; | |
9199 | struct btrfs_key key; | |
9200 | int ret = 0; | |
9201 | ||
47ab2a6c | 9202 | list_for_each_entry_safe(block_group, tmp, &trans->new_bgs, bg_list) { |
ea658bad | 9203 | if (ret) |
c92f6be3 | 9204 | goto next; |
ea658bad JB |
9205 | |
9206 | spin_lock(&block_group->lock); | |
9207 | memcpy(&item, &block_group->item, sizeof(item)); | |
9208 | memcpy(&key, &block_group->key, sizeof(key)); | |
9209 | spin_unlock(&block_group->lock); | |
9210 | ||
9211 | ret = btrfs_insert_item(trans, extent_root, &key, &item, | |
9212 | sizeof(item)); | |
9213 | if (ret) | |
9214 | btrfs_abort_transaction(trans, extent_root, ret); | |
6df9a95e JB |
9215 | ret = btrfs_finish_chunk_alloc(trans, extent_root, |
9216 | key.objectid, key.offset); | |
9217 | if (ret) | |
9218 | btrfs_abort_transaction(trans, extent_root, ret); | |
c92f6be3 FM |
9219 | next: |
9220 | list_del_init(&block_group->bg_list); | |
ea658bad JB |
9221 | } |
9222 | } | |
9223 | ||
6324fbf3 CM |
9224 | int btrfs_make_block_group(struct btrfs_trans_handle *trans, |
9225 | struct btrfs_root *root, u64 bytes_used, | |
e17cade2 | 9226 | u64 type, u64 chunk_objectid, u64 chunk_offset, |
6324fbf3 CM |
9227 | u64 size) |
9228 | { | |
9229 | int ret; | |
6324fbf3 CM |
9230 | struct btrfs_root *extent_root; |
9231 | struct btrfs_block_group_cache *cache; | |
6324fbf3 CM |
9232 | |
9233 | extent_root = root->fs_info->extent_root; | |
6324fbf3 | 9234 | |
995946dd | 9235 | btrfs_set_log_full_commit(root->fs_info, trans); |
e02119d5 | 9236 | |
920e4a58 | 9237 | cache = btrfs_create_block_group_cache(root, chunk_offset, size); |
0f9dd46c JB |
9238 | if (!cache) |
9239 | return -ENOMEM; | |
34d52cb6 | 9240 | |
6324fbf3 | 9241 | btrfs_set_block_group_used(&cache->item, bytes_used); |
6324fbf3 | 9242 | btrfs_set_block_group_chunk_objectid(&cache->item, chunk_objectid); |
6324fbf3 CM |
9243 | btrfs_set_block_group_flags(&cache->item, type); |
9244 | ||
920e4a58 | 9245 | cache->flags = type; |
11833d66 | 9246 | cache->last_byte_to_unpin = (u64)-1; |
817d52f8 | 9247 | cache->cached = BTRFS_CACHE_FINISHED; |
835d974f JB |
9248 | ret = exclude_super_stripes(root, cache); |
9249 | if (ret) { | |
9250 | /* | |
9251 | * We may have excluded something, so call this just in | |
9252 | * case. | |
9253 | */ | |
9254 | free_excluded_extents(root, cache); | |
920e4a58 | 9255 | btrfs_put_block_group(cache); |
835d974f JB |
9256 | return ret; |
9257 | } | |
96303081 | 9258 | |
817d52f8 JB |
9259 | add_new_free_space(cache, root->fs_info, chunk_offset, |
9260 | chunk_offset + size); | |
9261 | ||
11833d66 YZ |
9262 | free_excluded_extents(root, cache); |
9263 | ||
8c579fe7 JB |
9264 | ret = btrfs_add_block_group_cache(root->fs_info, cache); |
9265 | if (ret) { | |
9266 | btrfs_remove_free_space_cache(cache); | |
9267 | btrfs_put_block_group(cache); | |
9268 | return ret; | |
9269 | } | |
9270 | ||
6324fbf3 CM |
9271 | ret = update_space_info(root->fs_info, cache->flags, size, bytes_used, |
9272 | &cache->space_info); | |
8c579fe7 JB |
9273 | if (ret) { |
9274 | btrfs_remove_free_space_cache(cache); | |
9275 | spin_lock(&root->fs_info->block_group_cache_lock); | |
9276 | rb_erase(&cache->cache_node, | |
9277 | &root->fs_info->block_group_cache_tree); | |
01eacb27 | 9278 | RB_CLEAR_NODE(&cache->cache_node); |
8c579fe7 JB |
9279 | spin_unlock(&root->fs_info->block_group_cache_lock); |
9280 | btrfs_put_block_group(cache); | |
9281 | return ret; | |
9282 | } | |
c7c144db | 9283 | update_global_block_rsv(root->fs_info); |
1b2da372 JB |
9284 | |
9285 | spin_lock(&cache->space_info->lock); | |
f0486c68 | 9286 | cache->space_info->bytes_readonly += cache->bytes_super; |
1b2da372 JB |
9287 | spin_unlock(&cache->space_info->lock); |
9288 | ||
b742bb82 | 9289 | __link_block_group(cache->space_info, cache); |
6324fbf3 | 9290 | |
47ab2a6c | 9291 | list_add_tail(&cache->bg_list, &trans->new_bgs); |
6324fbf3 | 9292 | |
d18a2c44 | 9293 | set_avail_alloc_bits(extent_root->fs_info, type); |
925baedd | 9294 | |
6324fbf3 CM |
9295 | return 0; |
9296 | } | |
1a40e23b | 9297 | |
10ea00f5 ID |
9298 | static void clear_avail_alloc_bits(struct btrfs_fs_info *fs_info, u64 flags) |
9299 | { | |
899c81ea ID |
9300 | u64 extra_flags = chunk_to_extended(flags) & |
9301 | BTRFS_EXTENDED_PROFILE_MASK; | |
10ea00f5 | 9302 | |
de98ced9 | 9303 | write_seqlock(&fs_info->profiles_lock); |
10ea00f5 ID |
9304 | if (flags & BTRFS_BLOCK_GROUP_DATA) |
9305 | fs_info->avail_data_alloc_bits &= ~extra_flags; | |
9306 | if (flags & BTRFS_BLOCK_GROUP_METADATA) | |
9307 | fs_info->avail_metadata_alloc_bits &= ~extra_flags; | |
9308 | if (flags & BTRFS_BLOCK_GROUP_SYSTEM) | |
9309 | fs_info->avail_system_alloc_bits &= ~extra_flags; | |
de98ced9 | 9310 | write_sequnlock(&fs_info->profiles_lock); |
10ea00f5 ID |
9311 | } |
9312 | ||
1a40e23b | 9313 | int btrfs_remove_block_group(struct btrfs_trans_handle *trans, |
04216820 FM |
9314 | struct btrfs_root *root, u64 group_start, |
9315 | struct extent_map *em) | |
1a40e23b ZY |
9316 | { |
9317 | struct btrfs_path *path; | |
9318 | struct btrfs_block_group_cache *block_group; | |
44fb5511 | 9319 | struct btrfs_free_cluster *cluster; |
0af3d00b | 9320 | struct btrfs_root *tree_root = root->fs_info->tree_root; |
1a40e23b | 9321 | struct btrfs_key key; |
0af3d00b | 9322 | struct inode *inode; |
c1895442 | 9323 | struct kobject *kobj = NULL; |
1a40e23b | 9324 | int ret; |
10ea00f5 | 9325 | int index; |
89a55897 | 9326 | int factor; |
4f69cb98 | 9327 | struct btrfs_caching_control *caching_ctl = NULL; |
04216820 | 9328 | bool remove_em; |
1a40e23b | 9329 | |
1a40e23b ZY |
9330 | root = root->fs_info->extent_root; |
9331 | ||
9332 | block_group = btrfs_lookup_block_group(root->fs_info, group_start); | |
9333 | BUG_ON(!block_group); | |
c146afad | 9334 | BUG_ON(!block_group->ro); |
1a40e23b | 9335 | |
9f7c43c9 | 9336 | /* |
9337 | * Free the reserved super bytes from this block group before | |
9338 | * remove it. | |
9339 | */ | |
9340 | free_excluded_extents(root, block_group); | |
9341 | ||
1a40e23b | 9342 | memcpy(&key, &block_group->key, sizeof(key)); |
10ea00f5 | 9343 | index = get_block_group_index(block_group); |
89a55897 JB |
9344 | if (block_group->flags & (BTRFS_BLOCK_GROUP_DUP | |
9345 | BTRFS_BLOCK_GROUP_RAID1 | | |
9346 | BTRFS_BLOCK_GROUP_RAID10)) | |
9347 | factor = 2; | |
9348 | else | |
9349 | factor = 1; | |
1a40e23b | 9350 | |
44fb5511 CM |
9351 | /* make sure this block group isn't part of an allocation cluster */ |
9352 | cluster = &root->fs_info->data_alloc_cluster; | |
9353 | spin_lock(&cluster->refill_lock); | |
9354 | btrfs_return_cluster_to_free_space(block_group, cluster); | |
9355 | spin_unlock(&cluster->refill_lock); | |
9356 | ||
9357 | /* | |
9358 | * make sure this block group isn't part of a metadata | |
9359 | * allocation cluster | |
9360 | */ | |
9361 | cluster = &root->fs_info->meta_alloc_cluster; | |
9362 | spin_lock(&cluster->refill_lock); | |
9363 | btrfs_return_cluster_to_free_space(block_group, cluster); | |
9364 | spin_unlock(&cluster->refill_lock); | |
9365 | ||
1a40e23b | 9366 | path = btrfs_alloc_path(); |
d8926bb3 MF |
9367 | if (!path) { |
9368 | ret = -ENOMEM; | |
9369 | goto out; | |
9370 | } | |
1a40e23b | 9371 | |
10b2f34d | 9372 | inode = lookup_free_space_inode(tree_root, block_group, path); |
0af3d00b | 9373 | if (!IS_ERR(inode)) { |
b532402e | 9374 | ret = btrfs_orphan_add(trans, inode); |
79787eaa JM |
9375 | if (ret) { |
9376 | btrfs_add_delayed_iput(inode); | |
9377 | goto out; | |
9378 | } | |
0af3d00b JB |
9379 | clear_nlink(inode); |
9380 | /* One for the block groups ref */ | |
9381 | spin_lock(&block_group->lock); | |
9382 | if (block_group->iref) { | |
9383 | block_group->iref = 0; | |
9384 | block_group->inode = NULL; | |
9385 | spin_unlock(&block_group->lock); | |
9386 | iput(inode); | |
9387 | } else { | |
9388 | spin_unlock(&block_group->lock); | |
9389 | } | |
9390 | /* One for our lookup ref */ | |
455757c3 | 9391 | btrfs_add_delayed_iput(inode); |
0af3d00b JB |
9392 | } |
9393 | ||
9394 | key.objectid = BTRFS_FREE_SPACE_OBJECTID; | |
9395 | key.offset = block_group->key.objectid; | |
9396 | key.type = 0; | |
9397 | ||
9398 | ret = btrfs_search_slot(trans, tree_root, &key, path, -1, 1); | |
9399 | if (ret < 0) | |
9400 | goto out; | |
9401 | if (ret > 0) | |
b3b4aa74 | 9402 | btrfs_release_path(path); |
0af3d00b JB |
9403 | if (ret == 0) { |
9404 | ret = btrfs_del_item(trans, tree_root, path); | |
9405 | if (ret) | |
9406 | goto out; | |
b3b4aa74 | 9407 | btrfs_release_path(path); |
0af3d00b JB |
9408 | } |
9409 | ||
3dfdb934 | 9410 | spin_lock(&root->fs_info->block_group_cache_lock); |
1a40e23b ZY |
9411 | rb_erase(&block_group->cache_node, |
9412 | &root->fs_info->block_group_cache_tree); | |
292cbd51 | 9413 | RB_CLEAR_NODE(&block_group->cache_node); |
a1897fdd LB |
9414 | |
9415 | if (root->fs_info->first_logical_byte == block_group->key.objectid) | |
9416 | root->fs_info->first_logical_byte = (u64)-1; | |
3dfdb934 | 9417 | spin_unlock(&root->fs_info->block_group_cache_lock); |
817d52f8 | 9418 | |
80eb234a | 9419 | down_write(&block_group->space_info->groups_sem); |
44fb5511 CM |
9420 | /* |
9421 | * we must use list_del_init so people can check to see if they | |
9422 | * are still on the list after taking the semaphore | |
9423 | */ | |
9424 | list_del_init(&block_group->list); | |
6ab0a202 | 9425 | if (list_empty(&block_group->space_info->block_groups[index])) { |
c1895442 JM |
9426 | kobj = block_group->space_info->block_group_kobjs[index]; |
9427 | block_group->space_info->block_group_kobjs[index] = NULL; | |
10ea00f5 | 9428 | clear_avail_alloc_bits(root->fs_info, block_group->flags); |
6ab0a202 | 9429 | } |
80eb234a | 9430 | up_write(&block_group->space_info->groups_sem); |
c1895442 JM |
9431 | if (kobj) { |
9432 | kobject_del(kobj); | |
9433 | kobject_put(kobj); | |
9434 | } | |
1a40e23b | 9435 | |
4f69cb98 FM |
9436 | if (block_group->has_caching_ctl) |
9437 | caching_ctl = get_caching_control(block_group); | |
817d52f8 | 9438 | if (block_group->cached == BTRFS_CACHE_STARTED) |
11833d66 | 9439 | wait_block_group_cache_done(block_group); |
4f69cb98 FM |
9440 | if (block_group->has_caching_ctl) { |
9441 | down_write(&root->fs_info->commit_root_sem); | |
9442 | if (!caching_ctl) { | |
9443 | struct btrfs_caching_control *ctl; | |
9444 | ||
9445 | list_for_each_entry(ctl, | |
9446 | &root->fs_info->caching_block_groups, list) | |
9447 | if (ctl->block_group == block_group) { | |
9448 | caching_ctl = ctl; | |
9449 | atomic_inc(&caching_ctl->count); | |
9450 | break; | |
9451 | } | |
9452 | } | |
9453 | if (caching_ctl) | |
9454 | list_del_init(&caching_ctl->list); | |
9455 | up_write(&root->fs_info->commit_root_sem); | |
9456 | if (caching_ctl) { | |
9457 | /* Once for the caching bgs list and once for us. */ | |
9458 | put_caching_control(caching_ctl); | |
9459 | put_caching_control(caching_ctl); | |
9460 | } | |
9461 | } | |
817d52f8 | 9462 | |
ce93ec54 JB |
9463 | spin_lock(&trans->transaction->dirty_bgs_lock); |
9464 | if (!list_empty(&block_group->dirty_list)) { | |
9465 | list_del_init(&block_group->dirty_list); | |
9466 | btrfs_put_block_group(block_group); | |
9467 | } | |
9468 | spin_unlock(&trans->transaction->dirty_bgs_lock); | |
9469 | ||
817d52f8 JB |
9470 | btrfs_remove_free_space_cache(block_group); |
9471 | ||
c146afad | 9472 | spin_lock(&block_group->space_info->lock); |
75c68e9f | 9473 | list_del_init(&block_group->ro_list); |
c146afad YZ |
9474 | block_group->space_info->total_bytes -= block_group->key.offset; |
9475 | block_group->space_info->bytes_readonly -= block_group->key.offset; | |
89a55897 | 9476 | block_group->space_info->disk_total -= block_group->key.offset * factor; |
c146afad | 9477 | spin_unlock(&block_group->space_info->lock); |
283bb197 | 9478 | |
0af3d00b JB |
9479 | memcpy(&key, &block_group->key, sizeof(key)); |
9480 | ||
04216820 | 9481 | lock_chunks(root); |
495e64f4 FM |
9482 | if (!list_empty(&em->list)) { |
9483 | /* We're in the transaction->pending_chunks list. */ | |
9484 | free_extent_map(em); | |
9485 | } | |
04216820 FM |
9486 | spin_lock(&block_group->lock); |
9487 | block_group->removed = 1; | |
9488 | /* | |
9489 | * At this point trimming can't start on this block group, because we | |
9490 | * removed the block group from the tree fs_info->block_group_cache_tree | |
9491 | * so no one can't find it anymore and even if someone already got this | |
9492 | * block group before we removed it from the rbtree, they have already | |
9493 | * incremented block_group->trimming - if they didn't, they won't find | |
9494 | * any free space entries because we already removed them all when we | |
9495 | * called btrfs_remove_free_space_cache(). | |
9496 | * | |
9497 | * And we must not remove the extent map from the fs_info->mapping_tree | |
9498 | * to prevent the same logical address range and physical device space | |
9499 | * ranges from being reused for a new block group. This is because our | |
9500 | * fs trim operation (btrfs_trim_fs() / btrfs_ioctl_fitrim()) is | |
9501 | * completely transactionless, so while it is trimming a range the | |
9502 | * currently running transaction might finish and a new one start, | |
9503 | * allowing for new block groups to be created that can reuse the same | |
9504 | * physical device locations unless we take this special care. | |
9505 | */ | |
9506 | remove_em = (atomic_read(&block_group->trimming) == 0); | |
9507 | /* | |
9508 | * Make sure a trimmer task always sees the em in the pinned_chunks list | |
9509 | * if it sees block_group->removed == 1 (needs to lock block_group->lock | |
9510 | * before checking block_group->removed). | |
9511 | */ | |
9512 | if (!remove_em) { | |
9513 | /* | |
9514 | * Our em might be in trans->transaction->pending_chunks which | |
9515 | * is protected by fs_info->chunk_mutex ([lock|unlock]_chunks), | |
9516 | * and so is the fs_info->pinned_chunks list. | |
9517 | * | |
9518 | * So at this point we must be holding the chunk_mutex to avoid | |
9519 | * any races with chunk allocation (more specifically at | |
9520 | * volumes.c:contains_pending_extent()), to ensure it always | |
9521 | * sees the em, either in the pending_chunks list or in the | |
9522 | * pinned_chunks list. | |
9523 | */ | |
9524 | list_move_tail(&em->list, &root->fs_info->pinned_chunks); | |
9525 | } | |
9526 | spin_unlock(&block_group->lock); | |
04216820 FM |
9527 | |
9528 | if (remove_em) { | |
9529 | struct extent_map_tree *em_tree; | |
9530 | ||
9531 | em_tree = &root->fs_info->mapping_tree.map_tree; | |
9532 | write_lock(&em_tree->lock); | |
8dbcd10f FM |
9533 | /* |
9534 | * The em might be in the pending_chunks list, so make sure the | |
9535 | * chunk mutex is locked, since remove_extent_mapping() will | |
9536 | * delete us from that list. | |
9537 | */ | |
04216820 FM |
9538 | remove_extent_mapping(em_tree, em); |
9539 | write_unlock(&em_tree->lock); | |
9540 | /* once for the tree */ | |
9541 | free_extent_map(em); | |
9542 | } | |
9543 | ||
8dbcd10f FM |
9544 | unlock_chunks(root); |
9545 | ||
fa9c0d79 CM |
9546 | btrfs_put_block_group(block_group); |
9547 | btrfs_put_block_group(block_group); | |
1a40e23b ZY |
9548 | |
9549 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); | |
9550 | if (ret > 0) | |
9551 | ret = -EIO; | |
9552 | if (ret < 0) | |
9553 | goto out; | |
9554 | ||
9555 | ret = btrfs_del_item(trans, root, path); | |
9556 | out: | |
9557 | btrfs_free_path(path); | |
9558 | return ret; | |
9559 | } | |
acce952b | 9560 | |
47ab2a6c JB |
9561 | /* |
9562 | * Process the unused_bgs list and remove any that don't have any allocated | |
9563 | * space inside of them. | |
9564 | */ | |
9565 | void btrfs_delete_unused_bgs(struct btrfs_fs_info *fs_info) | |
9566 | { | |
9567 | struct btrfs_block_group_cache *block_group; | |
9568 | struct btrfs_space_info *space_info; | |
9569 | struct btrfs_root *root = fs_info->extent_root; | |
9570 | struct btrfs_trans_handle *trans; | |
9571 | int ret = 0; | |
9572 | ||
9573 | if (!fs_info->open) | |
9574 | return; | |
9575 | ||
9576 | spin_lock(&fs_info->unused_bgs_lock); | |
9577 | while (!list_empty(&fs_info->unused_bgs)) { | |
9578 | u64 start, end; | |
9579 | ||
9580 | block_group = list_first_entry(&fs_info->unused_bgs, | |
9581 | struct btrfs_block_group_cache, | |
9582 | bg_list); | |
9583 | space_info = block_group->space_info; | |
9584 | list_del_init(&block_group->bg_list); | |
9585 | if (ret || btrfs_mixed_space_info(space_info)) { | |
9586 | btrfs_put_block_group(block_group); | |
9587 | continue; | |
9588 | } | |
9589 | spin_unlock(&fs_info->unused_bgs_lock); | |
9590 | ||
9591 | /* Don't want to race with allocators so take the groups_sem */ | |
9592 | down_write(&space_info->groups_sem); | |
9593 | spin_lock(&block_group->lock); | |
9594 | if (block_group->reserved || | |
9595 | btrfs_block_group_used(&block_group->item) || | |
9596 | block_group->ro) { | |
9597 | /* | |
9598 | * We want to bail if we made new allocations or have | |
9599 | * outstanding allocations in this block group. We do | |
9600 | * the ro check in case balance is currently acting on | |
9601 | * this block group. | |
9602 | */ | |
9603 | spin_unlock(&block_group->lock); | |
9604 | up_write(&space_info->groups_sem); | |
9605 | goto next; | |
9606 | } | |
9607 | spin_unlock(&block_group->lock); | |
9608 | ||
9609 | /* We don't want to force the issue, only flip if it's ok. */ | |
9610 | ret = set_block_group_ro(block_group, 0); | |
9611 | up_write(&space_info->groups_sem); | |
9612 | if (ret < 0) { | |
9613 | ret = 0; | |
9614 | goto next; | |
9615 | } | |
9616 | ||
9617 | /* | |
9618 | * Want to do this before we do anything else so we can recover | |
9619 | * properly if we fail to join the transaction. | |
9620 | */ | |
3d84be79 FL |
9621 | /* 1 for btrfs_orphan_reserve_metadata() */ |
9622 | trans = btrfs_start_transaction(root, 1); | |
47ab2a6c JB |
9623 | if (IS_ERR(trans)) { |
9624 | btrfs_set_block_group_rw(root, block_group); | |
9625 | ret = PTR_ERR(trans); | |
9626 | goto next; | |
9627 | } | |
9628 | ||
9629 | /* | |
9630 | * We could have pending pinned extents for this block group, | |
9631 | * just delete them, we don't care about them anymore. | |
9632 | */ | |
9633 | start = block_group->key.objectid; | |
9634 | end = start + block_group->key.offset - 1; | |
d4b450cd FM |
9635 | /* |
9636 | * Hold the unused_bg_unpin_mutex lock to avoid racing with | |
9637 | * btrfs_finish_extent_commit(). If we are at transaction N, | |
9638 | * another task might be running finish_extent_commit() for the | |
9639 | * previous transaction N - 1, and have seen a range belonging | |
9640 | * to the block group in freed_extents[] before we were able to | |
9641 | * clear the whole block group range from freed_extents[]. This | |
9642 | * means that task can lookup for the block group after we | |
9643 | * unpinned it from freed_extents[] and removed it, leading to | |
9644 | * a BUG_ON() at btrfs_unpin_extent_range(). | |
9645 | */ | |
9646 | mutex_lock(&fs_info->unused_bg_unpin_mutex); | |
758eb51e | 9647 | ret = clear_extent_bits(&fs_info->freed_extents[0], start, end, |
47ab2a6c | 9648 | EXTENT_DIRTY, GFP_NOFS); |
758eb51e | 9649 | if (ret) { |
d4b450cd | 9650 | mutex_unlock(&fs_info->unused_bg_unpin_mutex); |
758eb51e FM |
9651 | btrfs_set_block_group_rw(root, block_group); |
9652 | goto end_trans; | |
9653 | } | |
9654 | ret = clear_extent_bits(&fs_info->freed_extents[1], start, end, | |
47ab2a6c | 9655 | EXTENT_DIRTY, GFP_NOFS); |
758eb51e | 9656 | if (ret) { |
d4b450cd | 9657 | mutex_unlock(&fs_info->unused_bg_unpin_mutex); |
758eb51e FM |
9658 | btrfs_set_block_group_rw(root, block_group); |
9659 | goto end_trans; | |
9660 | } | |
d4b450cd | 9661 | mutex_unlock(&fs_info->unused_bg_unpin_mutex); |
47ab2a6c JB |
9662 | |
9663 | /* Reset pinned so btrfs_put_block_group doesn't complain */ | |
9664 | block_group->pinned = 0; | |
9665 | ||
9666 | /* | |
9667 | * Btrfs_remove_chunk will abort the transaction if things go | |
9668 | * horribly wrong. | |
9669 | */ | |
9670 | ret = btrfs_remove_chunk(trans, root, | |
9671 | block_group->key.objectid); | |
758eb51e | 9672 | end_trans: |
47ab2a6c JB |
9673 | btrfs_end_transaction(trans, root); |
9674 | next: | |
9675 | btrfs_put_block_group(block_group); | |
9676 | spin_lock(&fs_info->unused_bgs_lock); | |
9677 | } | |
9678 | spin_unlock(&fs_info->unused_bgs_lock); | |
9679 | } | |
9680 | ||
c59021f8 | 9681 | int btrfs_init_space_info(struct btrfs_fs_info *fs_info) |
9682 | { | |
9683 | struct btrfs_space_info *space_info; | |
1aba86d6 | 9684 | struct btrfs_super_block *disk_super; |
9685 | u64 features; | |
9686 | u64 flags; | |
9687 | int mixed = 0; | |
c59021f8 | 9688 | int ret; |
9689 | ||
6c41761f | 9690 | disk_super = fs_info->super_copy; |
1aba86d6 | 9691 | if (!btrfs_super_root(disk_super)) |
9692 | return 1; | |
c59021f8 | 9693 | |
1aba86d6 | 9694 | features = btrfs_super_incompat_flags(disk_super); |
9695 | if (features & BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS) | |
9696 | mixed = 1; | |
c59021f8 | 9697 | |
1aba86d6 | 9698 | flags = BTRFS_BLOCK_GROUP_SYSTEM; |
9699 | ret = update_space_info(fs_info, flags, 0, 0, &space_info); | |
c59021f8 | 9700 | if (ret) |
1aba86d6 | 9701 | goto out; |
c59021f8 | 9702 | |
1aba86d6 | 9703 | if (mixed) { |
9704 | flags = BTRFS_BLOCK_GROUP_METADATA | BTRFS_BLOCK_GROUP_DATA; | |
9705 | ret = update_space_info(fs_info, flags, 0, 0, &space_info); | |
9706 | } else { | |
9707 | flags = BTRFS_BLOCK_GROUP_METADATA; | |
9708 | ret = update_space_info(fs_info, flags, 0, 0, &space_info); | |
9709 | if (ret) | |
9710 | goto out; | |
9711 | ||
9712 | flags = BTRFS_BLOCK_GROUP_DATA; | |
9713 | ret = update_space_info(fs_info, flags, 0, 0, &space_info); | |
9714 | } | |
9715 | out: | |
c59021f8 | 9716 | return ret; |
9717 | } | |
9718 | ||
acce952b | 9719 | int btrfs_error_unpin_extent_range(struct btrfs_root *root, u64 start, u64 end) |
9720 | { | |
678886bd | 9721 | return unpin_extent_range(root, start, end, false); |
acce952b | 9722 | } |
9723 | ||
f7039b1d LD |
9724 | int btrfs_trim_fs(struct btrfs_root *root, struct fstrim_range *range) |
9725 | { | |
9726 | struct btrfs_fs_info *fs_info = root->fs_info; | |
9727 | struct btrfs_block_group_cache *cache = NULL; | |
9728 | u64 group_trimmed; | |
9729 | u64 start; | |
9730 | u64 end; | |
9731 | u64 trimmed = 0; | |
2cac13e4 | 9732 | u64 total_bytes = btrfs_super_total_bytes(fs_info->super_copy); |
f7039b1d LD |
9733 | int ret = 0; |
9734 | ||
2cac13e4 LB |
9735 | /* |
9736 | * try to trim all FS space, our block group may start from non-zero. | |
9737 | */ | |
9738 | if (range->len == total_bytes) | |
9739 | cache = btrfs_lookup_first_block_group(fs_info, range->start); | |
9740 | else | |
9741 | cache = btrfs_lookup_block_group(fs_info, range->start); | |
f7039b1d LD |
9742 | |
9743 | while (cache) { | |
9744 | if (cache->key.objectid >= (range->start + range->len)) { | |
9745 | btrfs_put_block_group(cache); | |
9746 | break; | |
9747 | } | |
9748 | ||
9749 | start = max(range->start, cache->key.objectid); | |
9750 | end = min(range->start + range->len, | |
9751 | cache->key.objectid + cache->key.offset); | |
9752 | ||
9753 | if (end - start >= range->minlen) { | |
9754 | if (!block_group_cache_done(cache)) { | |
f6373bf3 | 9755 | ret = cache_block_group(cache, 0); |
1be41b78 JB |
9756 | if (ret) { |
9757 | btrfs_put_block_group(cache); | |
9758 | break; | |
9759 | } | |
9760 | ret = wait_block_group_cache_done(cache); | |
9761 | if (ret) { | |
9762 | btrfs_put_block_group(cache); | |
9763 | break; | |
9764 | } | |
f7039b1d LD |
9765 | } |
9766 | ret = btrfs_trim_block_group(cache, | |
9767 | &group_trimmed, | |
9768 | start, | |
9769 | end, | |
9770 | range->minlen); | |
9771 | ||
9772 | trimmed += group_trimmed; | |
9773 | if (ret) { | |
9774 | btrfs_put_block_group(cache); | |
9775 | break; | |
9776 | } | |
9777 | } | |
9778 | ||
9779 | cache = next_block_group(fs_info->tree_root, cache); | |
9780 | } | |
9781 | ||
9782 | range->len = trimmed; | |
9783 | return ret; | |
9784 | } | |
8257b2dc MX |
9785 | |
9786 | /* | |
9ea24bbe FM |
9787 | * btrfs_{start,end}_write_no_snapshoting() are similar to |
9788 | * mnt_{want,drop}_write(), they are used to prevent some tasks from writing | |
9789 | * data into the page cache through nocow before the subvolume is snapshoted, | |
9790 | * but flush the data into disk after the snapshot creation, or to prevent | |
9791 | * operations while snapshoting is ongoing and that cause the snapshot to be | |
9792 | * inconsistent (writes followed by expanding truncates for example). | |
8257b2dc | 9793 | */ |
9ea24bbe | 9794 | void btrfs_end_write_no_snapshoting(struct btrfs_root *root) |
8257b2dc MX |
9795 | { |
9796 | percpu_counter_dec(&root->subv_writers->counter); | |
9797 | /* | |
9798 | * Make sure counter is updated before we wake up | |
9799 | * waiters. | |
9800 | */ | |
9801 | smp_mb(); | |
9802 | if (waitqueue_active(&root->subv_writers->wait)) | |
9803 | wake_up(&root->subv_writers->wait); | |
9804 | } | |
9805 | ||
9ea24bbe | 9806 | int btrfs_start_write_no_snapshoting(struct btrfs_root *root) |
8257b2dc | 9807 | { |
ee39b432 | 9808 | if (atomic_read(&root->will_be_snapshoted)) |
8257b2dc MX |
9809 | return 0; |
9810 | ||
9811 | percpu_counter_inc(&root->subv_writers->counter); | |
9812 | /* | |
9813 | * Make sure counter is updated before we check for snapshot creation. | |
9814 | */ | |
9815 | smp_mb(); | |
ee39b432 | 9816 | if (atomic_read(&root->will_be_snapshoted)) { |
9ea24bbe | 9817 | btrfs_end_write_no_snapshoting(root); |
8257b2dc MX |
9818 | return 0; |
9819 | } | |
9820 | return 1; | |
9821 | } |