]>
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> |
f361bf4a | 19 | #include <linux/sched/signal.h> |
edbd8d4e | 20 | #include <linux/pagemap.h> |
ec44a35c | 21 | #include <linux/writeback.h> |
21af804c | 22 | #include <linux/blkdev.h> |
b7a9f29f | 23 | #include <linux/sort.h> |
4184ea7f | 24 | #include <linux/rcupdate.h> |
817d52f8 | 25 | #include <linux/kthread.h> |
5a0e3ad6 | 26 | #include <linux/slab.h> |
dff51cd1 | 27 | #include <linux/ratelimit.h> |
b150a4f1 | 28 | #include <linux/percpu_counter.h> |
74493f7a | 29 | #include "hash.h" |
995946dd | 30 | #include "tree-log.h" |
fec577fb CM |
31 | #include "disk-io.h" |
32 | #include "print-tree.h" | |
0b86a832 | 33 | #include "volumes.h" |
53b381b3 | 34 | #include "raid56.h" |
925baedd | 35 | #include "locking.h" |
fa9c0d79 | 36 | #include "free-space-cache.h" |
1e144fb8 | 37 | #include "free-space-tree.h" |
3fed40cc | 38 | #include "math.h" |
6ab0a202 | 39 | #include "sysfs.h" |
fcebe456 | 40 | #include "qgroup.h" |
fec577fb | 41 | |
709c0486 AJ |
42 | #undef SCRAMBLE_DELAYED_REFS |
43 | ||
9e622d6b MX |
44 | /* |
45 | * control flags for do_chunk_alloc's force field | |
0e4f8f88 CM |
46 | * CHUNK_ALLOC_NO_FORCE means to only allocate a chunk |
47 | * if we really need one. | |
48 | * | |
0e4f8f88 CM |
49 | * CHUNK_ALLOC_LIMITED means to only try and allocate one |
50 | * if we have very few chunks already allocated. This is | |
51 | * used as part of the clustering code to help make sure | |
52 | * we have a good pool of storage to cluster in, without | |
53 | * filling the FS with empty chunks | |
54 | * | |
9e622d6b MX |
55 | * CHUNK_ALLOC_FORCE means it must try to allocate one |
56 | * | |
0e4f8f88 CM |
57 | */ |
58 | enum { | |
59 | CHUNK_ALLOC_NO_FORCE = 0, | |
9e622d6b MX |
60 | CHUNK_ALLOC_LIMITED = 1, |
61 | CHUNK_ALLOC_FORCE = 2, | |
0e4f8f88 CM |
62 | }; |
63 | ||
ce93ec54 | 64 | static int update_block_group(struct btrfs_trans_handle *trans, |
6202df69 | 65 | struct btrfs_fs_info *fs_info, u64 bytenr, |
ce93ec54 | 66 | u64 num_bytes, int alloc); |
5d4f98a2 | 67 | static int __btrfs_free_extent(struct btrfs_trans_handle *trans, |
2ff7e61e | 68 | struct btrfs_fs_info *fs_info, |
c682f9b3 | 69 | struct btrfs_delayed_ref_node *node, u64 parent, |
5d4f98a2 YZ |
70 | u64 root_objectid, u64 owner_objectid, |
71 | u64 owner_offset, int refs_to_drop, | |
c682f9b3 | 72 | struct btrfs_delayed_extent_op *extra_op); |
5d4f98a2 YZ |
73 | static void __run_delayed_extent_op(struct btrfs_delayed_extent_op *extent_op, |
74 | struct extent_buffer *leaf, | |
75 | struct btrfs_extent_item *ei); | |
76 | static int alloc_reserved_file_extent(struct btrfs_trans_handle *trans, | |
2ff7e61e | 77 | struct btrfs_fs_info *fs_info, |
5d4f98a2 YZ |
78 | u64 parent, u64 root_objectid, |
79 | u64 flags, u64 owner, u64 offset, | |
80 | struct btrfs_key *ins, int ref_mod); | |
81 | static int alloc_reserved_tree_block(struct btrfs_trans_handle *trans, | |
2ff7e61e | 82 | struct btrfs_fs_info *fs_info, |
5d4f98a2 YZ |
83 | u64 parent, u64 root_objectid, |
84 | u64 flags, struct btrfs_disk_key *key, | |
b06c4bf5 | 85 | int level, struct btrfs_key *ins); |
6a63209f | 86 | static int do_chunk_alloc(struct btrfs_trans_handle *trans, |
2ff7e61e | 87 | struct btrfs_fs_info *fs_info, u64 flags, |
698d0082 | 88 | int force); |
11833d66 YZ |
89 | static int find_next_key(struct btrfs_path *path, int level, |
90 | struct btrfs_key *key); | |
ab8d0fc4 JM |
91 | static void dump_space_info(struct btrfs_fs_info *fs_info, |
92 | struct btrfs_space_info *info, u64 bytes, | |
9ed74f2d | 93 | int dump_block_groups); |
4824f1f4 | 94 | static int btrfs_add_reserved_bytes(struct btrfs_block_group_cache *cache, |
18513091 | 95 | u64 ram_bytes, u64 num_bytes, int delalloc); |
4824f1f4 WX |
96 | static int btrfs_free_reserved_bytes(struct btrfs_block_group_cache *cache, |
97 | u64 num_bytes, int delalloc); | |
5d80366e JB |
98 | static int block_rsv_use_bytes(struct btrfs_block_rsv *block_rsv, |
99 | u64 num_bytes); | |
957780eb JB |
100 | static int __reserve_metadata_bytes(struct btrfs_root *root, |
101 | struct btrfs_space_info *space_info, | |
102 | u64 orig_bytes, | |
103 | enum btrfs_reserve_flush_enum flush); | |
104 | static void space_info_add_new_bytes(struct btrfs_fs_info *fs_info, | |
105 | struct btrfs_space_info *space_info, | |
106 | u64 num_bytes); | |
107 | static void space_info_add_old_bytes(struct btrfs_fs_info *fs_info, | |
108 | struct btrfs_space_info *space_info, | |
109 | u64 num_bytes); | |
6a63209f | 110 | |
817d52f8 JB |
111 | static noinline int |
112 | block_group_cache_done(struct btrfs_block_group_cache *cache) | |
113 | { | |
114 | smp_mb(); | |
36cce922 JB |
115 | return cache->cached == BTRFS_CACHE_FINISHED || |
116 | cache->cached == BTRFS_CACHE_ERROR; | |
817d52f8 JB |
117 | } |
118 | ||
0f9dd46c JB |
119 | static int block_group_bits(struct btrfs_block_group_cache *cache, u64 bits) |
120 | { | |
121 | return (cache->flags & bits) == bits; | |
122 | } | |
123 | ||
758f2dfc | 124 | void btrfs_get_block_group(struct btrfs_block_group_cache *cache) |
11dfe35a JB |
125 | { |
126 | atomic_inc(&cache->count); | |
127 | } | |
128 | ||
129 | void btrfs_put_block_group(struct btrfs_block_group_cache *cache) | |
130 | { | |
f0486c68 YZ |
131 | if (atomic_dec_and_test(&cache->count)) { |
132 | WARN_ON(cache->pinned > 0); | |
133 | WARN_ON(cache->reserved > 0); | |
0966a7b1 QW |
134 | |
135 | /* | |
136 | * If not empty, someone is still holding mutex of | |
137 | * full_stripe_lock, which can only be released by caller. | |
138 | * And it will definitely cause use-after-free when caller | |
139 | * tries to release full stripe lock. | |
140 | * | |
141 | * No better way to resolve, but only to warn. | |
142 | */ | |
143 | WARN_ON(!RB_EMPTY_ROOT(&cache->full_stripe_locks_root.root)); | |
34d52cb6 | 144 | kfree(cache->free_space_ctl); |
11dfe35a | 145 | kfree(cache); |
f0486c68 | 146 | } |
11dfe35a JB |
147 | } |
148 | ||
0f9dd46c JB |
149 | /* |
150 | * this adds the block group to the fs_info rb tree for the block group | |
151 | * cache | |
152 | */ | |
b2950863 | 153 | static int btrfs_add_block_group_cache(struct btrfs_fs_info *info, |
0f9dd46c JB |
154 | struct btrfs_block_group_cache *block_group) |
155 | { | |
156 | struct rb_node **p; | |
157 | struct rb_node *parent = NULL; | |
158 | struct btrfs_block_group_cache *cache; | |
159 | ||
160 | spin_lock(&info->block_group_cache_lock); | |
161 | p = &info->block_group_cache_tree.rb_node; | |
162 | ||
163 | while (*p) { | |
164 | parent = *p; | |
165 | cache = rb_entry(parent, struct btrfs_block_group_cache, | |
166 | cache_node); | |
167 | if (block_group->key.objectid < cache->key.objectid) { | |
168 | p = &(*p)->rb_left; | |
169 | } else if (block_group->key.objectid > cache->key.objectid) { | |
170 | p = &(*p)->rb_right; | |
171 | } else { | |
172 | spin_unlock(&info->block_group_cache_lock); | |
173 | return -EEXIST; | |
174 | } | |
175 | } | |
176 | ||
177 | rb_link_node(&block_group->cache_node, parent, p); | |
178 | rb_insert_color(&block_group->cache_node, | |
179 | &info->block_group_cache_tree); | |
a1897fdd LB |
180 | |
181 | if (info->first_logical_byte > block_group->key.objectid) | |
182 | info->first_logical_byte = block_group->key.objectid; | |
183 | ||
0f9dd46c JB |
184 | spin_unlock(&info->block_group_cache_lock); |
185 | ||
186 | return 0; | |
187 | } | |
188 | ||
189 | /* | |
190 | * This will return the block group at or after bytenr if contains is 0, else | |
191 | * it will return the block group that contains the bytenr | |
192 | */ | |
193 | static struct btrfs_block_group_cache * | |
194 | block_group_cache_tree_search(struct btrfs_fs_info *info, u64 bytenr, | |
195 | int contains) | |
196 | { | |
197 | struct btrfs_block_group_cache *cache, *ret = NULL; | |
198 | struct rb_node *n; | |
199 | u64 end, start; | |
200 | ||
201 | spin_lock(&info->block_group_cache_lock); | |
202 | n = info->block_group_cache_tree.rb_node; | |
203 | ||
204 | while (n) { | |
205 | cache = rb_entry(n, struct btrfs_block_group_cache, | |
206 | cache_node); | |
207 | end = cache->key.objectid + cache->key.offset - 1; | |
208 | start = cache->key.objectid; | |
209 | ||
210 | if (bytenr < start) { | |
211 | if (!contains && (!ret || start < ret->key.objectid)) | |
212 | ret = cache; | |
213 | n = n->rb_left; | |
214 | } else if (bytenr > start) { | |
215 | if (contains && bytenr <= end) { | |
216 | ret = cache; | |
217 | break; | |
218 | } | |
219 | n = n->rb_right; | |
220 | } else { | |
221 | ret = cache; | |
222 | break; | |
223 | } | |
224 | } | |
a1897fdd | 225 | if (ret) { |
11dfe35a | 226 | btrfs_get_block_group(ret); |
a1897fdd LB |
227 | if (bytenr == 0 && info->first_logical_byte > ret->key.objectid) |
228 | info->first_logical_byte = ret->key.objectid; | |
229 | } | |
0f9dd46c JB |
230 | spin_unlock(&info->block_group_cache_lock); |
231 | ||
232 | return ret; | |
233 | } | |
234 | ||
2ff7e61e | 235 | static int add_excluded_extent(struct btrfs_fs_info *fs_info, |
11833d66 | 236 | u64 start, u64 num_bytes) |
817d52f8 | 237 | { |
11833d66 | 238 | u64 end = start + num_bytes - 1; |
0b246afa | 239 | set_extent_bits(&fs_info->freed_extents[0], |
ceeb0ae7 | 240 | start, end, EXTENT_UPTODATE); |
0b246afa | 241 | set_extent_bits(&fs_info->freed_extents[1], |
ceeb0ae7 | 242 | start, end, EXTENT_UPTODATE); |
11833d66 YZ |
243 | return 0; |
244 | } | |
817d52f8 | 245 | |
2ff7e61e | 246 | static void free_excluded_extents(struct btrfs_fs_info *fs_info, |
11833d66 YZ |
247 | struct btrfs_block_group_cache *cache) |
248 | { | |
249 | u64 start, end; | |
817d52f8 | 250 | |
11833d66 YZ |
251 | start = cache->key.objectid; |
252 | end = start + cache->key.offset - 1; | |
253 | ||
0b246afa | 254 | clear_extent_bits(&fs_info->freed_extents[0], |
91166212 | 255 | start, end, EXTENT_UPTODATE); |
0b246afa | 256 | clear_extent_bits(&fs_info->freed_extents[1], |
91166212 | 257 | start, end, EXTENT_UPTODATE); |
817d52f8 JB |
258 | } |
259 | ||
2ff7e61e | 260 | static int exclude_super_stripes(struct btrfs_fs_info *fs_info, |
11833d66 | 261 | struct btrfs_block_group_cache *cache) |
817d52f8 | 262 | { |
817d52f8 JB |
263 | u64 bytenr; |
264 | u64 *logical; | |
265 | int stripe_len; | |
266 | int i, nr, ret; | |
267 | ||
06b2331f YZ |
268 | if (cache->key.objectid < BTRFS_SUPER_INFO_OFFSET) { |
269 | stripe_len = BTRFS_SUPER_INFO_OFFSET - cache->key.objectid; | |
270 | cache->bytes_super += stripe_len; | |
2ff7e61e | 271 | ret = add_excluded_extent(fs_info, cache->key.objectid, |
06b2331f | 272 | stripe_len); |
835d974f JB |
273 | if (ret) |
274 | return ret; | |
06b2331f YZ |
275 | } |
276 | ||
817d52f8 JB |
277 | for (i = 0; i < BTRFS_SUPER_MIRROR_MAX; i++) { |
278 | bytenr = btrfs_sb_offset(i); | |
0b246afa | 279 | ret = btrfs_rmap_block(fs_info, cache->key.objectid, |
ab8d0fc4 | 280 | bytenr, 0, &logical, &nr, &stripe_len); |
835d974f JB |
281 | if (ret) |
282 | return ret; | |
11833d66 | 283 | |
817d52f8 | 284 | while (nr--) { |
51bf5f0b JB |
285 | u64 start, len; |
286 | ||
287 | if (logical[nr] > cache->key.objectid + | |
288 | cache->key.offset) | |
289 | continue; | |
290 | ||
291 | if (logical[nr] + stripe_len <= cache->key.objectid) | |
292 | continue; | |
293 | ||
294 | start = logical[nr]; | |
295 | if (start < cache->key.objectid) { | |
296 | start = cache->key.objectid; | |
297 | len = (logical[nr] + stripe_len) - start; | |
298 | } else { | |
299 | len = min_t(u64, stripe_len, | |
300 | cache->key.objectid + | |
301 | cache->key.offset - start); | |
302 | } | |
303 | ||
304 | cache->bytes_super += len; | |
2ff7e61e | 305 | ret = add_excluded_extent(fs_info, start, len); |
835d974f JB |
306 | if (ret) { |
307 | kfree(logical); | |
308 | return ret; | |
309 | } | |
817d52f8 | 310 | } |
11833d66 | 311 | |
817d52f8 JB |
312 | kfree(logical); |
313 | } | |
817d52f8 JB |
314 | return 0; |
315 | } | |
316 | ||
11833d66 YZ |
317 | static struct btrfs_caching_control * |
318 | get_caching_control(struct btrfs_block_group_cache *cache) | |
319 | { | |
320 | struct btrfs_caching_control *ctl; | |
321 | ||
322 | spin_lock(&cache->lock); | |
dde5abee JB |
323 | if (!cache->caching_ctl) { |
324 | spin_unlock(&cache->lock); | |
11833d66 YZ |
325 | return NULL; |
326 | } | |
327 | ||
328 | ctl = cache->caching_ctl; | |
1e4f4714 | 329 | refcount_inc(&ctl->count); |
11833d66 YZ |
330 | spin_unlock(&cache->lock); |
331 | return ctl; | |
332 | } | |
333 | ||
334 | static void put_caching_control(struct btrfs_caching_control *ctl) | |
335 | { | |
1e4f4714 | 336 | if (refcount_dec_and_test(&ctl->count)) |
11833d66 YZ |
337 | kfree(ctl); |
338 | } | |
339 | ||
d0bd4560 | 340 | #ifdef CONFIG_BTRFS_DEBUG |
2ff7e61e | 341 | static void fragment_free_space(struct btrfs_block_group_cache *block_group) |
d0bd4560 | 342 | { |
2ff7e61e | 343 | struct btrfs_fs_info *fs_info = block_group->fs_info; |
d0bd4560 JB |
344 | u64 start = block_group->key.objectid; |
345 | u64 len = block_group->key.offset; | |
346 | u64 chunk = block_group->flags & BTRFS_BLOCK_GROUP_METADATA ? | |
0b246afa | 347 | fs_info->nodesize : fs_info->sectorsize; |
d0bd4560 JB |
348 | u64 step = chunk << 1; |
349 | ||
350 | while (len > chunk) { | |
351 | btrfs_remove_free_space(block_group, start, chunk); | |
352 | start += step; | |
353 | if (len < step) | |
354 | len = 0; | |
355 | else | |
356 | len -= step; | |
357 | } | |
358 | } | |
359 | #endif | |
360 | ||
0f9dd46c JB |
361 | /* |
362 | * this is only called by cache_block_group, since we could have freed extents | |
363 | * we need to check the pinned_extents for any extents that can't be used yet | |
364 | * since their free space will be released as soon as the transaction commits. | |
365 | */ | |
a5ed9182 OS |
366 | u64 add_new_free_space(struct btrfs_block_group_cache *block_group, |
367 | struct btrfs_fs_info *info, u64 start, u64 end) | |
0f9dd46c | 368 | { |
817d52f8 | 369 | u64 extent_start, extent_end, size, total_added = 0; |
0f9dd46c JB |
370 | int ret; |
371 | ||
372 | while (start < end) { | |
11833d66 | 373 | ret = find_first_extent_bit(info->pinned_extents, start, |
0f9dd46c | 374 | &extent_start, &extent_end, |
e6138876 JB |
375 | EXTENT_DIRTY | EXTENT_UPTODATE, |
376 | NULL); | |
0f9dd46c JB |
377 | if (ret) |
378 | break; | |
379 | ||
06b2331f | 380 | if (extent_start <= start) { |
0f9dd46c JB |
381 | start = extent_end + 1; |
382 | } else if (extent_start > start && extent_start < end) { | |
383 | size = extent_start - start; | |
817d52f8 | 384 | total_added += size; |
ea6a478e JB |
385 | ret = btrfs_add_free_space(block_group, start, |
386 | size); | |
79787eaa | 387 | BUG_ON(ret); /* -ENOMEM or logic error */ |
0f9dd46c JB |
388 | start = extent_end + 1; |
389 | } else { | |
390 | break; | |
391 | } | |
392 | } | |
393 | ||
394 | if (start < end) { | |
395 | size = end - start; | |
817d52f8 | 396 | total_added += size; |
ea6a478e | 397 | ret = btrfs_add_free_space(block_group, start, size); |
79787eaa | 398 | BUG_ON(ret); /* -ENOMEM or logic error */ |
0f9dd46c JB |
399 | } |
400 | ||
817d52f8 | 401 | return total_added; |
0f9dd46c JB |
402 | } |
403 | ||
73fa48b6 | 404 | static int load_extent_tree_free(struct btrfs_caching_control *caching_ctl) |
e37c9e69 | 405 | { |
0b246afa JM |
406 | struct btrfs_block_group_cache *block_group = caching_ctl->block_group; |
407 | struct btrfs_fs_info *fs_info = block_group->fs_info; | |
408 | struct btrfs_root *extent_root = fs_info->extent_root; | |
e37c9e69 | 409 | struct btrfs_path *path; |
5f39d397 | 410 | struct extent_buffer *leaf; |
11833d66 | 411 | struct btrfs_key key; |
817d52f8 | 412 | u64 total_found = 0; |
11833d66 YZ |
413 | u64 last = 0; |
414 | u32 nritems; | |
73fa48b6 | 415 | int ret; |
d0bd4560 | 416 | bool wakeup = true; |
f510cfec | 417 | |
e37c9e69 CM |
418 | path = btrfs_alloc_path(); |
419 | if (!path) | |
73fa48b6 | 420 | return -ENOMEM; |
7d7d6068 | 421 | |
817d52f8 | 422 | last = max_t(u64, block_group->key.objectid, BTRFS_SUPER_INFO_OFFSET); |
11833d66 | 423 | |
d0bd4560 JB |
424 | #ifdef CONFIG_BTRFS_DEBUG |
425 | /* | |
426 | * If we're fragmenting we don't want to make anybody think we can | |
427 | * allocate from this block group until we've had a chance to fragment | |
428 | * the free space. | |
429 | */ | |
2ff7e61e | 430 | if (btrfs_should_fragment_free_space(block_group)) |
d0bd4560 JB |
431 | wakeup = false; |
432 | #endif | |
5cd57b2c | 433 | /* |
817d52f8 JB |
434 | * We don't want to deadlock with somebody trying to allocate a new |
435 | * extent for the extent root while also trying to search the extent | |
436 | * root to add free space. So we skip locking and search the commit | |
437 | * root, since its read-only | |
5cd57b2c CM |
438 | */ |
439 | path->skip_locking = 1; | |
817d52f8 | 440 | path->search_commit_root = 1; |
e4058b54 | 441 | path->reada = READA_FORWARD; |
817d52f8 | 442 | |
e4404d6e | 443 | key.objectid = last; |
e37c9e69 | 444 | key.offset = 0; |
11833d66 | 445 | key.type = BTRFS_EXTENT_ITEM_KEY; |
013f1b12 | 446 | |
52ee28d2 | 447 | next: |
11833d66 | 448 | ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0); |
e37c9e69 | 449 | if (ret < 0) |
73fa48b6 | 450 | goto out; |
a512bbf8 | 451 | |
11833d66 YZ |
452 | leaf = path->nodes[0]; |
453 | nritems = btrfs_header_nritems(leaf); | |
454 | ||
d397712b | 455 | while (1) { |
7841cb28 | 456 | if (btrfs_fs_closing(fs_info) > 1) { |
f25784b3 | 457 | last = (u64)-1; |
817d52f8 | 458 | break; |
f25784b3 | 459 | } |
817d52f8 | 460 | |
11833d66 YZ |
461 | if (path->slots[0] < nritems) { |
462 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
463 | } else { | |
464 | ret = find_next_key(path, 0, &key); | |
465 | if (ret) | |
e37c9e69 | 466 | break; |
817d52f8 | 467 | |
c9ea7b24 | 468 | if (need_resched() || |
9e351cc8 | 469 | rwsem_is_contended(&fs_info->commit_root_sem)) { |
d0bd4560 JB |
470 | if (wakeup) |
471 | caching_ctl->progress = last; | |
ff5714cc | 472 | btrfs_release_path(path); |
9e351cc8 | 473 | up_read(&fs_info->commit_root_sem); |
589d8ade | 474 | mutex_unlock(&caching_ctl->mutex); |
11833d66 | 475 | cond_resched(); |
73fa48b6 OS |
476 | mutex_lock(&caching_ctl->mutex); |
477 | down_read(&fs_info->commit_root_sem); | |
478 | goto next; | |
589d8ade | 479 | } |
0a3896d0 JB |
480 | |
481 | ret = btrfs_next_leaf(extent_root, path); | |
482 | if (ret < 0) | |
73fa48b6 | 483 | goto out; |
0a3896d0 JB |
484 | if (ret) |
485 | break; | |
589d8ade JB |
486 | leaf = path->nodes[0]; |
487 | nritems = btrfs_header_nritems(leaf); | |
488 | continue; | |
11833d66 | 489 | } |
817d52f8 | 490 | |
52ee28d2 LB |
491 | if (key.objectid < last) { |
492 | key.objectid = last; | |
493 | key.offset = 0; | |
494 | key.type = BTRFS_EXTENT_ITEM_KEY; | |
495 | ||
d0bd4560 JB |
496 | if (wakeup) |
497 | caching_ctl->progress = last; | |
52ee28d2 LB |
498 | btrfs_release_path(path); |
499 | goto next; | |
500 | } | |
501 | ||
11833d66 YZ |
502 | if (key.objectid < block_group->key.objectid) { |
503 | path->slots[0]++; | |
817d52f8 | 504 | continue; |
e37c9e69 | 505 | } |
0f9dd46c | 506 | |
e37c9e69 | 507 | if (key.objectid >= block_group->key.objectid + |
0f9dd46c | 508 | block_group->key.offset) |
e37c9e69 | 509 | break; |
7d7d6068 | 510 | |
3173a18f JB |
511 | if (key.type == BTRFS_EXTENT_ITEM_KEY || |
512 | key.type == BTRFS_METADATA_ITEM_KEY) { | |
817d52f8 JB |
513 | total_found += add_new_free_space(block_group, |
514 | fs_info, last, | |
515 | key.objectid); | |
3173a18f JB |
516 | if (key.type == BTRFS_METADATA_ITEM_KEY) |
517 | last = key.objectid + | |
da17066c | 518 | fs_info->nodesize; |
3173a18f JB |
519 | else |
520 | last = key.objectid + key.offset; | |
817d52f8 | 521 | |
73fa48b6 | 522 | if (total_found > CACHING_CTL_WAKE_UP) { |
11833d66 | 523 | total_found = 0; |
d0bd4560 JB |
524 | if (wakeup) |
525 | wake_up(&caching_ctl->wait); | |
11833d66 | 526 | } |
817d52f8 | 527 | } |
e37c9e69 CM |
528 | path->slots[0]++; |
529 | } | |
817d52f8 | 530 | ret = 0; |
e37c9e69 | 531 | |
817d52f8 JB |
532 | total_found += add_new_free_space(block_group, fs_info, last, |
533 | block_group->key.objectid + | |
534 | block_group->key.offset); | |
11833d66 | 535 | caching_ctl->progress = (u64)-1; |
817d52f8 | 536 | |
73fa48b6 OS |
537 | out: |
538 | btrfs_free_path(path); | |
539 | return ret; | |
540 | } | |
541 | ||
542 | static noinline void caching_thread(struct btrfs_work *work) | |
543 | { | |
544 | struct btrfs_block_group_cache *block_group; | |
545 | struct btrfs_fs_info *fs_info; | |
546 | struct btrfs_caching_control *caching_ctl; | |
b4570aa9 | 547 | struct btrfs_root *extent_root; |
73fa48b6 OS |
548 | int ret; |
549 | ||
550 | caching_ctl = container_of(work, struct btrfs_caching_control, work); | |
551 | block_group = caching_ctl->block_group; | |
552 | fs_info = block_group->fs_info; | |
b4570aa9 | 553 | extent_root = fs_info->extent_root; |
73fa48b6 OS |
554 | |
555 | mutex_lock(&caching_ctl->mutex); | |
556 | down_read(&fs_info->commit_root_sem); | |
557 | ||
1e144fb8 OS |
558 | if (btrfs_fs_compat_ro(fs_info, FREE_SPACE_TREE)) |
559 | ret = load_free_space_tree(caching_ctl); | |
560 | else | |
561 | ret = load_extent_tree_free(caching_ctl); | |
73fa48b6 | 562 | |
817d52f8 | 563 | spin_lock(&block_group->lock); |
11833d66 | 564 | block_group->caching_ctl = NULL; |
73fa48b6 | 565 | block_group->cached = ret ? BTRFS_CACHE_ERROR : BTRFS_CACHE_FINISHED; |
817d52f8 | 566 | spin_unlock(&block_group->lock); |
0f9dd46c | 567 | |
d0bd4560 | 568 | #ifdef CONFIG_BTRFS_DEBUG |
2ff7e61e | 569 | if (btrfs_should_fragment_free_space(block_group)) { |
d0bd4560 JB |
570 | u64 bytes_used; |
571 | ||
572 | spin_lock(&block_group->space_info->lock); | |
573 | spin_lock(&block_group->lock); | |
574 | bytes_used = block_group->key.offset - | |
575 | btrfs_block_group_used(&block_group->item); | |
576 | block_group->space_info->bytes_used += bytes_used >> 1; | |
577 | spin_unlock(&block_group->lock); | |
578 | spin_unlock(&block_group->space_info->lock); | |
2ff7e61e | 579 | fragment_free_space(block_group); |
d0bd4560 JB |
580 | } |
581 | #endif | |
582 | ||
583 | caching_ctl->progress = (u64)-1; | |
11833d66 | 584 | |
9e351cc8 | 585 | up_read(&fs_info->commit_root_sem); |
2ff7e61e | 586 | free_excluded_extents(fs_info, block_group); |
11833d66 | 587 | mutex_unlock(&caching_ctl->mutex); |
73fa48b6 | 588 | |
11833d66 YZ |
589 | wake_up(&caching_ctl->wait); |
590 | ||
591 | put_caching_control(caching_ctl); | |
11dfe35a | 592 | btrfs_put_block_group(block_group); |
817d52f8 JB |
593 | } |
594 | ||
9d66e233 | 595 | static int cache_block_group(struct btrfs_block_group_cache *cache, |
9d66e233 | 596 | int load_cache_only) |
817d52f8 | 597 | { |
291c7d2f | 598 | DEFINE_WAIT(wait); |
11833d66 YZ |
599 | struct btrfs_fs_info *fs_info = cache->fs_info; |
600 | struct btrfs_caching_control *caching_ctl; | |
817d52f8 JB |
601 | int ret = 0; |
602 | ||
291c7d2f | 603 | caching_ctl = kzalloc(sizeof(*caching_ctl), GFP_NOFS); |
79787eaa JM |
604 | if (!caching_ctl) |
605 | return -ENOMEM; | |
291c7d2f JB |
606 | |
607 | INIT_LIST_HEAD(&caching_ctl->list); | |
608 | mutex_init(&caching_ctl->mutex); | |
609 | init_waitqueue_head(&caching_ctl->wait); | |
610 | caching_ctl->block_group = cache; | |
611 | caching_ctl->progress = cache->key.objectid; | |
1e4f4714 | 612 | refcount_set(&caching_ctl->count, 1); |
9e0af237 LB |
613 | btrfs_init_work(&caching_ctl->work, btrfs_cache_helper, |
614 | caching_thread, NULL, NULL); | |
291c7d2f JB |
615 | |
616 | spin_lock(&cache->lock); | |
617 | /* | |
618 | * This should be a rare occasion, but this could happen I think in the | |
619 | * case where one thread starts to load the space cache info, and then | |
620 | * some other thread starts a transaction commit which tries to do an | |
621 | * allocation while the other thread is still loading the space cache | |
622 | * info. The previous loop should have kept us from choosing this block | |
623 | * group, but if we've moved to the state where we will wait on caching | |
624 | * block groups we need to first check if we're doing a fast load here, | |
625 | * so we can wait for it to finish, otherwise we could end up allocating | |
626 | * from a block group who's cache gets evicted for one reason or | |
627 | * another. | |
628 | */ | |
629 | while (cache->cached == BTRFS_CACHE_FAST) { | |
630 | struct btrfs_caching_control *ctl; | |
631 | ||
632 | ctl = cache->caching_ctl; | |
1e4f4714 | 633 | refcount_inc(&ctl->count); |
291c7d2f JB |
634 | prepare_to_wait(&ctl->wait, &wait, TASK_UNINTERRUPTIBLE); |
635 | spin_unlock(&cache->lock); | |
636 | ||
637 | schedule(); | |
638 | ||
639 | finish_wait(&ctl->wait, &wait); | |
640 | put_caching_control(ctl); | |
641 | spin_lock(&cache->lock); | |
642 | } | |
643 | ||
644 | if (cache->cached != BTRFS_CACHE_NO) { | |
645 | spin_unlock(&cache->lock); | |
646 | kfree(caching_ctl); | |
11833d66 | 647 | return 0; |
291c7d2f JB |
648 | } |
649 | WARN_ON(cache->caching_ctl); | |
650 | cache->caching_ctl = caching_ctl; | |
651 | cache->cached = BTRFS_CACHE_FAST; | |
652 | spin_unlock(&cache->lock); | |
11833d66 | 653 | |
d53ba474 | 654 | if (fs_info->mount_opt & BTRFS_MOUNT_SPACE_CACHE) { |
cb83b7b8 | 655 | mutex_lock(&caching_ctl->mutex); |
9d66e233 JB |
656 | ret = load_free_space_cache(fs_info, cache); |
657 | ||
658 | spin_lock(&cache->lock); | |
659 | if (ret == 1) { | |
291c7d2f | 660 | cache->caching_ctl = NULL; |
9d66e233 JB |
661 | cache->cached = BTRFS_CACHE_FINISHED; |
662 | cache->last_byte_to_unpin = (u64)-1; | |
cb83b7b8 | 663 | caching_ctl->progress = (u64)-1; |
9d66e233 | 664 | } else { |
291c7d2f JB |
665 | if (load_cache_only) { |
666 | cache->caching_ctl = NULL; | |
667 | cache->cached = BTRFS_CACHE_NO; | |
668 | } else { | |
669 | cache->cached = BTRFS_CACHE_STARTED; | |
4f69cb98 | 670 | cache->has_caching_ctl = 1; |
291c7d2f | 671 | } |
9d66e233 JB |
672 | } |
673 | spin_unlock(&cache->lock); | |
d0bd4560 JB |
674 | #ifdef CONFIG_BTRFS_DEBUG |
675 | if (ret == 1 && | |
2ff7e61e | 676 | btrfs_should_fragment_free_space(cache)) { |
d0bd4560 JB |
677 | u64 bytes_used; |
678 | ||
679 | spin_lock(&cache->space_info->lock); | |
680 | spin_lock(&cache->lock); | |
681 | bytes_used = cache->key.offset - | |
682 | btrfs_block_group_used(&cache->item); | |
683 | cache->space_info->bytes_used += bytes_used >> 1; | |
684 | spin_unlock(&cache->lock); | |
685 | spin_unlock(&cache->space_info->lock); | |
2ff7e61e | 686 | fragment_free_space(cache); |
d0bd4560 JB |
687 | } |
688 | #endif | |
cb83b7b8 JB |
689 | mutex_unlock(&caching_ctl->mutex); |
690 | ||
291c7d2f | 691 | wake_up(&caching_ctl->wait); |
3c14874a | 692 | if (ret == 1) { |
291c7d2f | 693 | put_caching_control(caching_ctl); |
2ff7e61e | 694 | free_excluded_extents(fs_info, cache); |
9d66e233 | 695 | return 0; |
3c14874a | 696 | } |
291c7d2f JB |
697 | } else { |
698 | /* | |
1e144fb8 OS |
699 | * We're either using the free space tree or no caching at all. |
700 | * Set cached to the appropriate value and wakeup any waiters. | |
291c7d2f JB |
701 | */ |
702 | spin_lock(&cache->lock); | |
703 | if (load_cache_only) { | |
704 | cache->caching_ctl = NULL; | |
705 | cache->cached = BTRFS_CACHE_NO; | |
706 | } else { | |
707 | cache->cached = BTRFS_CACHE_STARTED; | |
4f69cb98 | 708 | cache->has_caching_ctl = 1; |
291c7d2f JB |
709 | } |
710 | spin_unlock(&cache->lock); | |
711 | wake_up(&caching_ctl->wait); | |
9d66e233 JB |
712 | } |
713 | ||
291c7d2f JB |
714 | if (load_cache_only) { |
715 | put_caching_control(caching_ctl); | |
11833d66 | 716 | return 0; |
817d52f8 | 717 | } |
817d52f8 | 718 | |
9e351cc8 | 719 | down_write(&fs_info->commit_root_sem); |
1e4f4714 | 720 | refcount_inc(&caching_ctl->count); |
11833d66 | 721 | list_add_tail(&caching_ctl->list, &fs_info->caching_block_groups); |
9e351cc8 | 722 | up_write(&fs_info->commit_root_sem); |
11833d66 | 723 | |
11dfe35a | 724 | btrfs_get_block_group(cache); |
11833d66 | 725 | |
e66f0bb1 | 726 | btrfs_queue_work(fs_info->caching_workers, &caching_ctl->work); |
817d52f8 | 727 | |
ef8bbdfe | 728 | return ret; |
e37c9e69 CM |
729 | } |
730 | ||
0f9dd46c JB |
731 | /* |
732 | * return the block group that starts at or after bytenr | |
733 | */ | |
d397712b CM |
734 | static struct btrfs_block_group_cache * |
735 | btrfs_lookup_first_block_group(struct btrfs_fs_info *info, u64 bytenr) | |
0ef3e66b | 736 | { |
e2c89907 | 737 | return block_group_cache_tree_search(info, bytenr, 0); |
0ef3e66b CM |
738 | } |
739 | ||
0f9dd46c | 740 | /* |
9f55684c | 741 | * return the block group that contains the given bytenr |
0f9dd46c | 742 | */ |
d397712b CM |
743 | struct btrfs_block_group_cache *btrfs_lookup_block_group( |
744 | struct btrfs_fs_info *info, | |
745 | u64 bytenr) | |
be744175 | 746 | { |
e2c89907 | 747 | return block_group_cache_tree_search(info, bytenr, 1); |
be744175 | 748 | } |
0b86a832 | 749 | |
0f9dd46c JB |
750 | static struct btrfs_space_info *__find_space_info(struct btrfs_fs_info *info, |
751 | u64 flags) | |
6324fbf3 | 752 | { |
0f9dd46c | 753 | struct list_head *head = &info->space_info; |
0f9dd46c | 754 | struct btrfs_space_info *found; |
4184ea7f | 755 | |
52ba6929 | 756 | flags &= BTRFS_BLOCK_GROUP_TYPE_MASK; |
b742bb82 | 757 | |
4184ea7f CM |
758 | rcu_read_lock(); |
759 | list_for_each_entry_rcu(found, head, list) { | |
67377734 | 760 | if (found->flags & flags) { |
4184ea7f | 761 | rcu_read_unlock(); |
0f9dd46c | 762 | return found; |
4184ea7f | 763 | } |
0f9dd46c | 764 | } |
4184ea7f | 765 | rcu_read_unlock(); |
0f9dd46c | 766 | return NULL; |
6324fbf3 CM |
767 | } |
768 | ||
4184ea7f CM |
769 | /* |
770 | * after adding space to the filesystem, we need to clear the full flags | |
771 | * on all the space infos. | |
772 | */ | |
773 | void btrfs_clear_space_info_full(struct btrfs_fs_info *info) | |
774 | { | |
775 | struct list_head *head = &info->space_info; | |
776 | struct btrfs_space_info *found; | |
777 | ||
778 | rcu_read_lock(); | |
779 | list_for_each_entry_rcu(found, head, list) | |
780 | found->full = 0; | |
781 | rcu_read_unlock(); | |
782 | } | |
783 | ||
1a4ed8fd | 784 | /* simple helper to search for an existing data extent at a given offset */ |
2ff7e61e | 785 | int btrfs_lookup_data_extent(struct btrfs_fs_info *fs_info, u64 start, u64 len) |
e02119d5 CM |
786 | { |
787 | int ret; | |
788 | struct btrfs_key key; | |
31840ae1 | 789 | struct btrfs_path *path; |
e02119d5 | 790 | |
31840ae1 | 791 | path = btrfs_alloc_path(); |
d8926bb3 MF |
792 | if (!path) |
793 | return -ENOMEM; | |
794 | ||
e02119d5 CM |
795 | key.objectid = start; |
796 | key.offset = len; | |
3173a18f | 797 | key.type = BTRFS_EXTENT_ITEM_KEY; |
0b246afa | 798 | ret = btrfs_search_slot(NULL, fs_info->extent_root, &key, path, 0, 0); |
31840ae1 | 799 | btrfs_free_path(path); |
7bb86316 CM |
800 | return ret; |
801 | } | |
802 | ||
a22285a6 | 803 | /* |
3173a18f | 804 | * helper function to lookup reference count and flags of a tree block. |
a22285a6 YZ |
805 | * |
806 | * the head node for delayed ref is used to store the sum of all the | |
807 | * reference count modifications queued up in the rbtree. the head | |
808 | * node may also store the extent flags to set. This way you can check | |
809 | * to see what the reference count and extent flags would be if all of | |
810 | * the delayed refs are not processed. | |
811 | */ | |
812 | int btrfs_lookup_extent_info(struct btrfs_trans_handle *trans, | |
2ff7e61e | 813 | struct btrfs_fs_info *fs_info, u64 bytenr, |
3173a18f | 814 | u64 offset, int metadata, u64 *refs, u64 *flags) |
a22285a6 YZ |
815 | { |
816 | struct btrfs_delayed_ref_head *head; | |
817 | struct btrfs_delayed_ref_root *delayed_refs; | |
818 | struct btrfs_path *path; | |
819 | struct btrfs_extent_item *ei; | |
820 | struct extent_buffer *leaf; | |
821 | struct btrfs_key key; | |
822 | u32 item_size; | |
823 | u64 num_refs; | |
824 | u64 extent_flags; | |
825 | int ret; | |
826 | ||
3173a18f JB |
827 | /* |
828 | * If we don't have skinny metadata, don't bother doing anything | |
829 | * different | |
830 | */ | |
0b246afa JM |
831 | if (metadata && !btrfs_fs_incompat(fs_info, SKINNY_METADATA)) { |
832 | offset = fs_info->nodesize; | |
3173a18f JB |
833 | metadata = 0; |
834 | } | |
835 | ||
a22285a6 YZ |
836 | path = btrfs_alloc_path(); |
837 | if (!path) | |
838 | return -ENOMEM; | |
839 | ||
a22285a6 YZ |
840 | if (!trans) { |
841 | path->skip_locking = 1; | |
842 | path->search_commit_root = 1; | |
843 | } | |
639eefc8 FDBM |
844 | |
845 | search_again: | |
846 | key.objectid = bytenr; | |
847 | key.offset = offset; | |
848 | if (metadata) | |
849 | key.type = BTRFS_METADATA_ITEM_KEY; | |
850 | else | |
851 | key.type = BTRFS_EXTENT_ITEM_KEY; | |
852 | ||
0b246afa | 853 | ret = btrfs_search_slot(trans, fs_info->extent_root, &key, path, 0, 0); |
a22285a6 YZ |
854 | if (ret < 0) |
855 | goto out_free; | |
856 | ||
3173a18f | 857 | if (ret > 0 && metadata && key.type == BTRFS_METADATA_ITEM_KEY) { |
74be9510 FDBM |
858 | if (path->slots[0]) { |
859 | path->slots[0]--; | |
860 | btrfs_item_key_to_cpu(path->nodes[0], &key, | |
861 | path->slots[0]); | |
862 | if (key.objectid == bytenr && | |
863 | key.type == BTRFS_EXTENT_ITEM_KEY && | |
0b246afa | 864 | key.offset == fs_info->nodesize) |
74be9510 FDBM |
865 | ret = 0; |
866 | } | |
3173a18f JB |
867 | } |
868 | ||
a22285a6 YZ |
869 | if (ret == 0) { |
870 | leaf = path->nodes[0]; | |
871 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
872 | if (item_size >= sizeof(*ei)) { | |
873 | ei = btrfs_item_ptr(leaf, path->slots[0], | |
874 | struct btrfs_extent_item); | |
875 | num_refs = btrfs_extent_refs(leaf, ei); | |
876 | extent_flags = btrfs_extent_flags(leaf, ei); | |
877 | } else { | |
878 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
879 | struct btrfs_extent_item_v0 *ei0; | |
880 | BUG_ON(item_size != sizeof(*ei0)); | |
881 | ei0 = btrfs_item_ptr(leaf, path->slots[0], | |
882 | struct btrfs_extent_item_v0); | |
883 | num_refs = btrfs_extent_refs_v0(leaf, ei0); | |
884 | /* FIXME: this isn't correct for data */ | |
885 | extent_flags = BTRFS_BLOCK_FLAG_FULL_BACKREF; | |
886 | #else | |
887 | BUG(); | |
888 | #endif | |
889 | } | |
890 | BUG_ON(num_refs == 0); | |
891 | } else { | |
892 | num_refs = 0; | |
893 | extent_flags = 0; | |
894 | ret = 0; | |
895 | } | |
896 | ||
897 | if (!trans) | |
898 | goto out; | |
899 | ||
900 | delayed_refs = &trans->transaction->delayed_refs; | |
901 | spin_lock(&delayed_refs->lock); | |
f72ad18e | 902 | head = btrfs_find_delayed_ref_head(delayed_refs, bytenr); |
a22285a6 YZ |
903 | if (head) { |
904 | if (!mutex_trylock(&head->mutex)) { | |
6df8cdf5 | 905 | refcount_inc(&head->node.refs); |
a22285a6 YZ |
906 | spin_unlock(&delayed_refs->lock); |
907 | ||
b3b4aa74 | 908 | btrfs_release_path(path); |
a22285a6 | 909 | |
8cc33e5c DS |
910 | /* |
911 | * Mutex was contended, block until it's released and try | |
912 | * again | |
913 | */ | |
a22285a6 YZ |
914 | mutex_lock(&head->mutex); |
915 | mutex_unlock(&head->mutex); | |
916 | btrfs_put_delayed_ref(&head->node); | |
639eefc8 | 917 | goto search_again; |
a22285a6 | 918 | } |
d7df2c79 | 919 | spin_lock(&head->lock); |
a22285a6 YZ |
920 | if (head->extent_op && head->extent_op->update_flags) |
921 | extent_flags |= head->extent_op->flags_to_set; | |
922 | else | |
923 | BUG_ON(num_refs == 0); | |
924 | ||
925 | num_refs += head->node.ref_mod; | |
d7df2c79 | 926 | spin_unlock(&head->lock); |
a22285a6 YZ |
927 | mutex_unlock(&head->mutex); |
928 | } | |
929 | spin_unlock(&delayed_refs->lock); | |
930 | out: | |
931 | WARN_ON(num_refs == 0); | |
932 | if (refs) | |
933 | *refs = num_refs; | |
934 | if (flags) | |
935 | *flags = extent_flags; | |
936 | out_free: | |
937 | btrfs_free_path(path); | |
938 | return ret; | |
939 | } | |
940 | ||
d8d5f3e1 CM |
941 | /* |
942 | * Back reference rules. Back refs have three main goals: | |
943 | * | |
944 | * 1) differentiate between all holders of references to an extent so that | |
945 | * when a reference is dropped we can make sure it was a valid reference | |
946 | * before freeing the extent. | |
947 | * | |
948 | * 2) Provide enough information to quickly find the holders of an extent | |
949 | * if we notice a given block is corrupted or bad. | |
950 | * | |
951 | * 3) Make it easy to migrate blocks for FS shrinking or storage pool | |
952 | * maintenance. This is actually the same as #2, but with a slightly | |
953 | * different use case. | |
954 | * | |
5d4f98a2 YZ |
955 | * There are two kinds of back refs. The implicit back refs is optimized |
956 | * for pointers in non-shared tree blocks. For a given pointer in a block, | |
957 | * back refs of this kind provide information about the block's owner tree | |
958 | * and the pointer's key. These information allow us to find the block by | |
959 | * b-tree searching. The full back refs is for pointers in tree blocks not | |
960 | * referenced by their owner trees. The location of tree block is recorded | |
961 | * in the back refs. Actually the full back refs is generic, and can be | |
962 | * used in all cases the implicit back refs is used. The major shortcoming | |
963 | * of the full back refs is its overhead. Every time a tree block gets | |
964 | * COWed, we have to update back refs entry for all pointers in it. | |
965 | * | |
966 | * For a newly allocated tree block, we use implicit back refs for | |
967 | * pointers in it. This means most tree related operations only involve | |
968 | * implicit back refs. For a tree block created in old transaction, the | |
969 | * only way to drop a reference to it is COW it. So we can detect the | |
970 | * event that tree block loses its owner tree's reference and do the | |
971 | * back refs conversion. | |
972 | * | |
01327610 | 973 | * When a tree block is COWed through a tree, there are four cases: |
5d4f98a2 YZ |
974 | * |
975 | * The reference count of the block is one and the tree is the block's | |
976 | * owner tree. Nothing to do in this case. | |
977 | * | |
978 | * The reference count of the block is one and the tree is not the | |
979 | * block's owner tree. In this case, full back refs is used for pointers | |
980 | * in the block. Remove these full back refs, add implicit back refs for | |
981 | * every pointers in the new block. | |
982 | * | |
983 | * The reference count of the block is greater than one and the tree is | |
984 | * the block's owner tree. In this case, implicit back refs is used for | |
985 | * pointers in the block. Add full back refs for every pointers in the | |
986 | * block, increase lower level extents' reference counts. The original | |
987 | * implicit back refs are entailed to the new block. | |
988 | * | |
989 | * The reference count of the block is greater than one and the tree is | |
990 | * not the block's owner tree. Add implicit back refs for every pointer in | |
991 | * the new block, increase lower level extents' reference count. | |
992 | * | |
993 | * Back Reference Key composing: | |
994 | * | |
995 | * The key objectid corresponds to the first byte in the extent, | |
996 | * The key type is used to differentiate between types of back refs. | |
997 | * There are different meanings of the key offset for different types | |
998 | * of back refs. | |
999 | * | |
d8d5f3e1 CM |
1000 | * File extents can be referenced by: |
1001 | * | |
1002 | * - multiple snapshots, subvolumes, or different generations in one subvol | |
31840ae1 | 1003 | * - different files inside a single subvolume |
d8d5f3e1 CM |
1004 | * - different offsets inside a file (bookend extents in file.c) |
1005 | * | |
5d4f98a2 | 1006 | * The extent ref structure for the implicit back refs has fields for: |
d8d5f3e1 CM |
1007 | * |
1008 | * - Objectid of the subvolume root | |
d8d5f3e1 | 1009 | * - objectid of the file holding the reference |
5d4f98a2 YZ |
1010 | * - original offset in the file |
1011 | * - how many bookend extents | |
d8d5f3e1 | 1012 | * |
5d4f98a2 YZ |
1013 | * The key offset for the implicit back refs is hash of the first |
1014 | * three fields. | |
d8d5f3e1 | 1015 | * |
5d4f98a2 | 1016 | * The extent ref structure for the full back refs has field for: |
d8d5f3e1 | 1017 | * |
5d4f98a2 | 1018 | * - number of pointers in the tree leaf |
d8d5f3e1 | 1019 | * |
5d4f98a2 YZ |
1020 | * The key offset for the implicit back refs is the first byte of |
1021 | * the tree leaf | |
d8d5f3e1 | 1022 | * |
5d4f98a2 YZ |
1023 | * When a file extent is allocated, The implicit back refs is used. |
1024 | * the fields are filled in: | |
d8d5f3e1 | 1025 | * |
5d4f98a2 | 1026 | * (root_key.objectid, inode objectid, offset in file, 1) |
d8d5f3e1 | 1027 | * |
5d4f98a2 YZ |
1028 | * When a file extent is removed file truncation, we find the |
1029 | * corresponding implicit back refs and check the following fields: | |
d8d5f3e1 | 1030 | * |
5d4f98a2 | 1031 | * (btrfs_header_owner(leaf), inode objectid, offset in file) |
d8d5f3e1 | 1032 | * |
5d4f98a2 | 1033 | * Btree extents can be referenced by: |
d8d5f3e1 | 1034 | * |
5d4f98a2 | 1035 | * - Different subvolumes |
d8d5f3e1 | 1036 | * |
5d4f98a2 YZ |
1037 | * Both the implicit back refs and the full back refs for tree blocks |
1038 | * only consist of key. The key offset for the implicit back refs is | |
1039 | * objectid of block's owner tree. The key offset for the full back refs | |
1040 | * is the first byte of parent block. | |
d8d5f3e1 | 1041 | * |
5d4f98a2 YZ |
1042 | * When implicit back refs is used, information about the lowest key and |
1043 | * level of the tree block are required. These information are stored in | |
1044 | * tree block info structure. | |
d8d5f3e1 | 1045 | */ |
31840ae1 | 1046 | |
5d4f98a2 YZ |
1047 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 |
1048 | static int convert_extent_item_v0(struct btrfs_trans_handle *trans, | |
87bde3cd | 1049 | struct btrfs_fs_info *fs_info, |
5d4f98a2 YZ |
1050 | struct btrfs_path *path, |
1051 | u64 owner, u32 extra_size) | |
7bb86316 | 1052 | { |
87bde3cd | 1053 | struct btrfs_root *root = fs_info->extent_root; |
5d4f98a2 YZ |
1054 | struct btrfs_extent_item *item; |
1055 | struct btrfs_extent_item_v0 *ei0; | |
1056 | struct btrfs_extent_ref_v0 *ref0; | |
1057 | struct btrfs_tree_block_info *bi; | |
1058 | struct extent_buffer *leaf; | |
7bb86316 | 1059 | struct btrfs_key key; |
5d4f98a2 YZ |
1060 | struct btrfs_key found_key; |
1061 | u32 new_size = sizeof(*item); | |
1062 | u64 refs; | |
1063 | int ret; | |
1064 | ||
1065 | leaf = path->nodes[0]; | |
1066 | BUG_ON(btrfs_item_size_nr(leaf, path->slots[0]) != sizeof(*ei0)); | |
1067 | ||
1068 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
1069 | ei0 = btrfs_item_ptr(leaf, path->slots[0], | |
1070 | struct btrfs_extent_item_v0); | |
1071 | refs = btrfs_extent_refs_v0(leaf, ei0); | |
1072 | ||
1073 | if (owner == (u64)-1) { | |
1074 | while (1) { | |
1075 | if (path->slots[0] >= btrfs_header_nritems(leaf)) { | |
1076 | ret = btrfs_next_leaf(root, path); | |
1077 | if (ret < 0) | |
1078 | return ret; | |
79787eaa | 1079 | BUG_ON(ret > 0); /* Corruption */ |
5d4f98a2 YZ |
1080 | leaf = path->nodes[0]; |
1081 | } | |
1082 | btrfs_item_key_to_cpu(leaf, &found_key, | |
1083 | path->slots[0]); | |
1084 | BUG_ON(key.objectid != found_key.objectid); | |
1085 | if (found_key.type != BTRFS_EXTENT_REF_V0_KEY) { | |
1086 | path->slots[0]++; | |
1087 | continue; | |
1088 | } | |
1089 | ref0 = btrfs_item_ptr(leaf, path->slots[0], | |
1090 | struct btrfs_extent_ref_v0); | |
1091 | owner = btrfs_ref_objectid_v0(leaf, ref0); | |
1092 | break; | |
1093 | } | |
1094 | } | |
b3b4aa74 | 1095 | btrfs_release_path(path); |
5d4f98a2 YZ |
1096 | |
1097 | if (owner < BTRFS_FIRST_FREE_OBJECTID) | |
1098 | new_size += sizeof(*bi); | |
1099 | ||
1100 | new_size -= sizeof(*ei0); | |
1101 | ret = btrfs_search_slot(trans, root, &key, path, | |
1102 | new_size + extra_size, 1); | |
1103 | if (ret < 0) | |
1104 | return ret; | |
79787eaa | 1105 | BUG_ON(ret); /* Corruption */ |
5d4f98a2 | 1106 | |
87bde3cd | 1107 | btrfs_extend_item(fs_info, path, new_size); |
5d4f98a2 YZ |
1108 | |
1109 | leaf = path->nodes[0]; | |
1110 | item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); | |
1111 | btrfs_set_extent_refs(leaf, item, refs); | |
1112 | /* FIXME: get real generation */ | |
1113 | btrfs_set_extent_generation(leaf, item, 0); | |
1114 | if (owner < BTRFS_FIRST_FREE_OBJECTID) { | |
1115 | btrfs_set_extent_flags(leaf, item, | |
1116 | BTRFS_EXTENT_FLAG_TREE_BLOCK | | |
1117 | BTRFS_BLOCK_FLAG_FULL_BACKREF); | |
1118 | bi = (struct btrfs_tree_block_info *)(item + 1); | |
1119 | /* FIXME: get first key of the block */ | |
b159fa28 | 1120 | memzero_extent_buffer(leaf, (unsigned long)bi, sizeof(*bi)); |
5d4f98a2 YZ |
1121 | btrfs_set_tree_block_level(leaf, bi, (int)owner); |
1122 | } else { | |
1123 | btrfs_set_extent_flags(leaf, item, BTRFS_EXTENT_FLAG_DATA); | |
1124 | } | |
1125 | btrfs_mark_buffer_dirty(leaf); | |
1126 | return 0; | |
1127 | } | |
1128 | #endif | |
1129 | ||
1130 | static u64 hash_extent_data_ref(u64 root_objectid, u64 owner, u64 offset) | |
1131 | { | |
1132 | u32 high_crc = ~(u32)0; | |
1133 | u32 low_crc = ~(u32)0; | |
1134 | __le64 lenum; | |
1135 | ||
1136 | lenum = cpu_to_le64(root_objectid); | |
14a958e6 | 1137 | high_crc = btrfs_crc32c(high_crc, &lenum, sizeof(lenum)); |
5d4f98a2 | 1138 | lenum = cpu_to_le64(owner); |
14a958e6 | 1139 | low_crc = btrfs_crc32c(low_crc, &lenum, sizeof(lenum)); |
5d4f98a2 | 1140 | lenum = cpu_to_le64(offset); |
14a958e6 | 1141 | low_crc = btrfs_crc32c(low_crc, &lenum, sizeof(lenum)); |
5d4f98a2 YZ |
1142 | |
1143 | return ((u64)high_crc << 31) ^ (u64)low_crc; | |
1144 | } | |
1145 | ||
1146 | static u64 hash_extent_data_ref_item(struct extent_buffer *leaf, | |
1147 | struct btrfs_extent_data_ref *ref) | |
1148 | { | |
1149 | return hash_extent_data_ref(btrfs_extent_data_ref_root(leaf, ref), | |
1150 | btrfs_extent_data_ref_objectid(leaf, ref), | |
1151 | btrfs_extent_data_ref_offset(leaf, ref)); | |
1152 | } | |
1153 | ||
1154 | static int match_extent_data_ref(struct extent_buffer *leaf, | |
1155 | struct btrfs_extent_data_ref *ref, | |
1156 | u64 root_objectid, u64 owner, u64 offset) | |
1157 | { | |
1158 | if (btrfs_extent_data_ref_root(leaf, ref) != root_objectid || | |
1159 | btrfs_extent_data_ref_objectid(leaf, ref) != owner || | |
1160 | btrfs_extent_data_ref_offset(leaf, ref) != offset) | |
1161 | return 0; | |
1162 | return 1; | |
1163 | } | |
1164 | ||
1165 | static noinline int lookup_extent_data_ref(struct btrfs_trans_handle *trans, | |
87bde3cd | 1166 | struct btrfs_fs_info *fs_info, |
5d4f98a2 YZ |
1167 | struct btrfs_path *path, |
1168 | u64 bytenr, u64 parent, | |
1169 | u64 root_objectid, | |
1170 | u64 owner, u64 offset) | |
1171 | { | |
87bde3cd | 1172 | struct btrfs_root *root = fs_info->extent_root; |
5d4f98a2 YZ |
1173 | struct btrfs_key key; |
1174 | struct btrfs_extent_data_ref *ref; | |
31840ae1 | 1175 | struct extent_buffer *leaf; |
5d4f98a2 | 1176 | u32 nritems; |
74493f7a | 1177 | int ret; |
5d4f98a2 YZ |
1178 | int recow; |
1179 | int err = -ENOENT; | |
74493f7a | 1180 | |
31840ae1 | 1181 | key.objectid = bytenr; |
5d4f98a2 YZ |
1182 | if (parent) { |
1183 | key.type = BTRFS_SHARED_DATA_REF_KEY; | |
1184 | key.offset = parent; | |
1185 | } else { | |
1186 | key.type = BTRFS_EXTENT_DATA_REF_KEY; | |
1187 | key.offset = hash_extent_data_ref(root_objectid, | |
1188 | owner, offset); | |
1189 | } | |
1190 | again: | |
1191 | recow = 0; | |
1192 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); | |
1193 | if (ret < 0) { | |
1194 | err = ret; | |
1195 | goto fail; | |
1196 | } | |
31840ae1 | 1197 | |
5d4f98a2 YZ |
1198 | if (parent) { |
1199 | if (!ret) | |
1200 | return 0; | |
1201 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
1202 | key.type = BTRFS_EXTENT_REF_V0_KEY; | |
b3b4aa74 | 1203 | btrfs_release_path(path); |
5d4f98a2 YZ |
1204 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); |
1205 | if (ret < 0) { | |
1206 | err = ret; | |
1207 | goto fail; | |
1208 | } | |
1209 | if (!ret) | |
1210 | return 0; | |
1211 | #endif | |
1212 | goto fail; | |
31840ae1 ZY |
1213 | } |
1214 | ||
1215 | leaf = path->nodes[0]; | |
5d4f98a2 YZ |
1216 | nritems = btrfs_header_nritems(leaf); |
1217 | while (1) { | |
1218 | if (path->slots[0] >= nritems) { | |
1219 | ret = btrfs_next_leaf(root, path); | |
1220 | if (ret < 0) | |
1221 | err = ret; | |
1222 | if (ret) | |
1223 | goto fail; | |
1224 | ||
1225 | leaf = path->nodes[0]; | |
1226 | nritems = btrfs_header_nritems(leaf); | |
1227 | recow = 1; | |
1228 | } | |
1229 | ||
1230 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
1231 | if (key.objectid != bytenr || | |
1232 | key.type != BTRFS_EXTENT_DATA_REF_KEY) | |
1233 | goto fail; | |
1234 | ||
1235 | ref = btrfs_item_ptr(leaf, path->slots[0], | |
1236 | struct btrfs_extent_data_ref); | |
1237 | ||
1238 | if (match_extent_data_ref(leaf, ref, root_objectid, | |
1239 | owner, offset)) { | |
1240 | if (recow) { | |
b3b4aa74 | 1241 | btrfs_release_path(path); |
5d4f98a2 YZ |
1242 | goto again; |
1243 | } | |
1244 | err = 0; | |
1245 | break; | |
1246 | } | |
1247 | path->slots[0]++; | |
31840ae1 | 1248 | } |
5d4f98a2 YZ |
1249 | fail: |
1250 | return err; | |
31840ae1 ZY |
1251 | } |
1252 | ||
5d4f98a2 | 1253 | static noinline int insert_extent_data_ref(struct btrfs_trans_handle *trans, |
87bde3cd | 1254 | struct btrfs_fs_info *fs_info, |
5d4f98a2 YZ |
1255 | struct btrfs_path *path, |
1256 | u64 bytenr, u64 parent, | |
1257 | u64 root_objectid, u64 owner, | |
1258 | u64 offset, int refs_to_add) | |
31840ae1 | 1259 | { |
87bde3cd | 1260 | struct btrfs_root *root = fs_info->extent_root; |
31840ae1 ZY |
1261 | struct btrfs_key key; |
1262 | struct extent_buffer *leaf; | |
5d4f98a2 | 1263 | u32 size; |
31840ae1 ZY |
1264 | u32 num_refs; |
1265 | int ret; | |
74493f7a | 1266 | |
74493f7a | 1267 | key.objectid = bytenr; |
5d4f98a2 YZ |
1268 | if (parent) { |
1269 | key.type = BTRFS_SHARED_DATA_REF_KEY; | |
1270 | key.offset = parent; | |
1271 | size = sizeof(struct btrfs_shared_data_ref); | |
1272 | } else { | |
1273 | key.type = BTRFS_EXTENT_DATA_REF_KEY; | |
1274 | key.offset = hash_extent_data_ref(root_objectid, | |
1275 | owner, offset); | |
1276 | size = sizeof(struct btrfs_extent_data_ref); | |
1277 | } | |
74493f7a | 1278 | |
5d4f98a2 YZ |
1279 | ret = btrfs_insert_empty_item(trans, root, path, &key, size); |
1280 | if (ret && ret != -EEXIST) | |
1281 | goto fail; | |
1282 | ||
1283 | leaf = path->nodes[0]; | |
1284 | if (parent) { | |
1285 | struct btrfs_shared_data_ref *ref; | |
31840ae1 | 1286 | ref = btrfs_item_ptr(leaf, path->slots[0], |
5d4f98a2 YZ |
1287 | struct btrfs_shared_data_ref); |
1288 | if (ret == 0) { | |
1289 | btrfs_set_shared_data_ref_count(leaf, ref, refs_to_add); | |
1290 | } else { | |
1291 | num_refs = btrfs_shared_data_ref_count(leaf, ref); | |
1292 | num_refs += refs_to_add; | |
1293 | btrfs_set_shared_data_ref_count(leaf, ref, num_refs); | |
31840ae1 | 1294 | } |
5d4f98a2 YZ |
1295 | } else { |
1296 | struct btrfs_extent_data_ref *ref; | |
1297 | while (ret == -EEXIST) { | |
1298 | ref = btrfs_item_ptr(leaf, path->slots[0], | |
1299 | struct btrfs_extent_data_ref); | |
1300 | if (match_extent_data_ref(leaf, ref, root_objectid, | |
1301 | owner, offset)) | |
1302 | break; | |
b3b4aa74 | 1303 | btrfs_release_path(path); |
5d4f98a2 YZ |
1304 | key.offset++; |
1305 | ret = btrfs_insert_empty_item(trans, root, path, &key, | |
1306 | size); | |
1307 | if (ret && ret != -EEXIST) | |
1308 | goto fail; | |
31840ae1 | 1309 | |
5d4f98a2 YZ |
1310 | leaf = path->nodes[0]; |
1311 | } | |
1312 | ref = btrfs_item_ptr(leaf, path->slots[0], | |
1313 | struct btrfs_extent_data_ref); | |
1314 | if (ret == 0) { | |
1315 | btrfs_set_extent_data_ref_root(leaf, ref, | |
1316 | root_objectid); | |
1317 | btrfs_set_extent_data_ref_objectid(leaf, ref, owner); | |
1318 | btrfs_set_extent_data_ref_offset(leaf, ref, offset); | |
1319 | btrfs_set_extent_data_ref_count(leaf, ref, refs_to_add); | |
1320 | } else { | |
1321 | num_refs = btrfs_extent_data_ref_count(leaf, ref); | |
1322 | num_refs += refs_to_add; | |
1323 | btrfs_set_extent_data_ref_count(leaf, ref, num_refs); | |
31840ae1 | 1324 | } |
31840ae1 | 1325 | } |
5d4f98a2 YZ |
1326 | btrfs_mark_buffer_dirty(leaf); |
1327 | ret = 0; | |
1328 | fail: | |
b3b4aa74 | 1329 | btrfs_release_path(path); |
7bb86316 | 1330 | return ret; |
74493f7a CM |
1331 | } |
1332 | ||
5d4f98a2 | 1333 | static noinline int remove_extent_data_ref(struct btrfs_trans_handle *trans, |
87bde3cd | 1334 | struct btrfs_fs_info *fs_info, |
5d4f98a2 | 1335 | struct btrfs_path *path, |
fcebe456 | 1336 | int refs_to_drop, int *last_ref) |
31840ae1 | 1337 | { |
5d4f98a2 YZ |
1338 | struct btrfs_key key; |
1339 | struct btrfs_extent_data_ref *ref1 = NULL; | |
1340 | struct btrfs_shared_data_ref *ref2 = NULL; | |
31840ae1 | 1341 | struct extent_buffer *leaf; |
5d4f98a2 | 1342 | u32 num_refs = 0; |
31840ae1 ZY |
1343 | int ret = 0; |
1344 | ||
1345 | leaf = path->nodes[0]; | |
5d4f98a2 YZ |
1346 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); |
1347 | ||
1348 | if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { | |
1349 | ref1 = btrfs_item_ptr(leaf, path->slots[0], | |
1350 | struct btrfs_extent_data_ref); | |
1351 | num_refs = btrfs_extent_data_ref_count(leaf, ref1); | |
1352 | } else if (key.type == BTRFS_SHARED_DATA_REF_KEY) { | |
1353 | ref2 = btrfs_item_ptr(leaf, path->slots[0], | |
1354 | struct btrfs_shared_data_ref); | |
1355 | num_refs = btrfs_shared_data_ref_count(leaf, ref2); | |
1356 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
1357 | } else if (key.type == BTRFS_EXTENT_REF_V0_KEY) { | |
1358 | struct btrfs_extent_ref_v0 *ref0; | |
1359 | ref0 = btrfs_item_ptr(leaf, path->slots[0], | |
1360 | struct btrfs_extent_ref_v0); | |
1361 | num_refs = btrfs_ref_count_v0(leaf, ref0); | |
1362 | #endif | |
1363 | } else { | |
1364 | BUG(); | |
1365 | } | |
1366 | ||
56bec294 CM |
1367 | BUG_ON(num_refs < refs_to_drop); |
1368 | num_refs -= refs_to_drop; | |
5d4f98a2 | 1369 | |
31840ae1 | 1370 | if (num_refs == 0) { |
87bde3cd | 1371 | ret = btrfs_del_item(trans, fs_info->extent_root, path); |
fcebe456 | 1372 | *last_ref = 1; |
31840ae1 | 1373 | } else { |
5d4f98a2 YZ |
1374 | if (key.type == BTRFS_EXTENT_DATA_REF_KEY) |
1375 | btrfs_set_extent_data_ref_count(leaf, ref1, num_refs); | |
1376 | else if (key.type == BTRFS_SHARED_DATA_REF_KEY) | |
1377 | btrfs_set_shared_data_ref_count(leaf, ref2, num_refs); | |
1378 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
1379 | else { | |
1380 | struct btrfs_extent_ref_v0 *ref0; | |
1381 | ref0 = btrfs_item_ptr(leaf, path->slots[0], | |
1382 | struct btrfs_extent_ref_v0); | |
1383 | btrfs_set_ref_count_v0(leaf, ref0, num_refs); | |
1384 | } | |
1385 | #endif | |
31840ae1 ZY |
1386 | btrfs_mark_buffer_dirty(leaf); |
1387 | } | |
31840ae1 ZY |
1388 | return ret; |
1389 | } | |
1390 | ||
9ed0dea0 | 1391 | static noinline u32 extent_data_ref_count(struct btrfs_path *path, |
5d4f98a2 | 1392 | struct btrfs_extent_inline_ref *iref) |
15916de8 | 1393 | { |
5d4f98a2 YZ |
1394 | struct btrfs_key key; |
1395 | struct extent_buffer *leaf; | |
1396 | struct btrfs_extent_data_ref *ref1; | |
1397 | struct btrfs_shared_data_ref *ref2; | |
1398 | u32 num_refs = 0; | |
1399 | ||
1400 | leaf = path->nodes[0]; | |
1401 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
1402 | if (iref) { | |
1403 | if (btrfs_extent_inline_ref_type(leaf, iref) == | |
1404 | BTRFS_EXTENT_DATA_REF_KEY) { | |
1405 | ref1 = (struct btrfs_extent_data_ref *)(&iref->offset); | |
1406 | num_refs = btrfs_extent_data_ref_count(leaf, ref1); | |
1407 | } else { | |
1408 | ref2 = (struct btrfs_shared_data_ref *)(iref + 1); | |
1409 | num_refs = btrfs_shared_data_ref_count(leaf, ref2); | |
1410 | } | |
1411 | } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { | |
1412 | ref1 = btrfs_item_ptr(leaf, path->slots[0], | |
1413 | struct btrfs_extent_data_ref); | |
1414 | num_refs = btrfs_extent_data_ref_count(leaf, ref1); | |
1415 | } else if (key.type == BTRFS_SHARED_DATA_REF_KEY) { | |
1416 | ref2 = btrfs_item_ptr(leaf, path->slots[0], | |
1417 | struct btrfs_shared_data_ref); | |
1418 | num_refs = btrfs_shared_data_ref_count(leaf, ref2); | |
1419 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
1420 | } else if (key.type == BTRFS_EXTENT_REF_V0_KEY) { | |
1421 | struct btrfs_extent_ref_v0 *ref0; | |
1422 | ref0 = btrfs_item_ptr(leaf, path->slots[0], | |
1423 | struct btrfs_extent_ref_v0); | |
1424 | num_refs = btrfs_ref_count_v0(leaf, ref0); | |
4b4e25f2 | 1425 | #endif |
5d4f98a2 YZ |
1426 | } else { |
1427 | WARN_ON(1); | |
1428 | } | |
1429 | return num_refs; | |
1430 | } | |
15916de8 | 1431 | |
5d4f98a2 | 1432 | static noinline int lookup_tree_block_ref(struct btrfs_trans_handle *trans, |
87bde3cd | 1433 | struct btrfs_fs_info *fs_info, |
5d4f98a2 YZ |
1434 | struct btrfs_path *path, |
1435 | u64 bytenr, u64 parent, | |
1436 | u64 root_objectid) | |
1f3c79a2 | 1437 | { |
87bde3cd | 1438 | struct btrfs_root *root = fs_info->extent_root; |
5d4f98a2 | 1439 | struct btrfs_key key; |
1f3c79a2 | 1440 | int ret; |
1f3c79a2 | 1441 | |
5d4f98a2 YZ |
1442 | key.objectid = bytenr; |
1443 | if (parent) { | |
1444 | key.type = BTRFS_SHARED_BLOCK_REF_KEY; | |
1445 | key.offset = parent; | |
1446 | } else { | |
1447 | key.type = BTRFS_TREE_BLOCK_REF_KEY; | |
1448 | key.offset = root_objectid; | |
1f3c79a2 LH |
1449 | } |
1450 | ||
5d4f98a2 YZ |
1451 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); |
1452 | if (ret > 0) | |
1453 | ret = -ENOENT; | |
1454 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
1455 | if (ret == -ENOENT && parent) { | |
b3b4aa74 | 1456 | btrfs_release_path(path); |
5d4f98a2 YZ |
1457 | key.type = BTRFS_EXTENT_REF_V0_KEY; |
1458 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); | |
1459 | if (ret > 0) | |
1460 | ret = -ENOENT; | |
1461 | } | |
1f3c79a2 | 1462 | #endif |
5d4f98a2 | 1463 | return ret; |
1f3c79a2 LH |
1464 | } |
1465 | ||
5d4f98a2 | 1466 | static noinline int insert_tree_block_ref(struct btrfs_trans_handle *trans, |
87bde3cd | 1467 | struct btrfs_fs_info *fs_info, |
5d4f98a2 YZ |
1468 | struct btrfs_path *path, |
1469 | u64 bytenr, u64 parent, | |
1470 | u64 root_objectid) | |
31840ae1 | 1471 | { |
5d4f98a2 | 1472 | struct btrfs_key key; |
31840ae1 | 1473 | int ret; |
31840ae1 | 1474 | |
5d4f98a2 YZ |
1475 | key.objectid = bytenr; |
1476 | if (parent) { | |
1477 | key.type = BTRFS_SHARED_BLOCK_REF_KEY; | |
1478 | key.offset = parent; | |
1479 | } else { | |
1480 | key.type = BTRFS_TREE_BLOCK_REF_KEY; | |
1481 | key.offset = root_objectid; | |
1482 | } | |
1483 | ||
87bde3cd JM |
1484 | ret = btrfs_insert_empty_item(trans, fs_info->extent_root, |
1485 | path, &key, 0); | |
b3b4aa74 | 1486 | btrfs_release_path(path); |
31840ae1 ZY |
1487 | return ret; |
1488 | } | |
1489 | ||
5d4f98a2 | 1490 | static inline int extent_ref_type(u64 parent, u64 owner) |
31840ae1 | 1491 | { |
5d4f98a2 YZ |
1492 | int type; |
1493 | if (owner < BTRFS_FIRST_FREE_OBJECTID) { | |
1494 | if (parent > 0) | |
1495 | type = BTRFS_SHARED_BLOCK_REF_KEY; | |
1496 | else | |
1497 | type = BTRFS_TREE_BLOCK_REF_KEY; | |
1498 | } else { | |
1499 | if (parent > 0) | |
1500 | type = BTRFS_SHARED_DATA_REF_KEY; | |
1501 | else | |
1502 | type = BTRFS_EXTENT_DATA_REF_KEY; | |
1503 | } | |
1504 | return type; | |
31840ae1 | 1505 | } |
56bec294 | 1506 | |
2c47e605 YZ |
1507 | static int find_next_key(struct btrfs_path *path, int level, |
1508 | struct btrfs_key *key) | |
56bec294 | 1509 | |
02217ed2 | 1510 | { |
2c47e605 | 1511 | for (; level < BTRFS_MAX_LEVEL; level++) { |
5d4f98a2 YZ |
1512 | if (!path->nodes[level]) |
1513 | break; | |
5d4f98a2 YZ |
1514 | if (path->slots[level] + 1 >= |
1515 | btrfs_header_nritems(path->nodes[level])) | |
1516 | continue; | |
1517 | if (level == 0) | |
1518 | btrfs_item_key_to_cpu(path->nodes[level], key, | |
1519 | path->slots[level] + 1); | |
1520 | else | |
1521 | btrfs_node_key_to_cpu(path->nodes[level], key, | |
1522 | path->slots[level] + 1); | |
1523 | return 0; | |
1524 | } | |
1525 | return 1; | |
1526 | } | |
037e6390 | 1527 | |
5d4f98a2 YZ |
1528 | /* |
1529 | * look for inline back ref. if back ref is found, *ref_ret is set | |
1530 | * to the address of inline back ref, and 0 is returned. | |
1531 | * | |
1532 | * if back ref isn't found, *ref_ret is set to the address where it | |
1533 | * should be inserted, and -ENOENT is returned. | |
1534 | * | |
1535 | * if insert is true and there are too many inline back refs, the path | |
1536 | * points to the extent item, and -EAGAIN is returned. | |
1537 | * | |
1538 | * NOTE: inline back refs are ordered in the same way that back ref | |
1539 | * items in the tree are ordered. | |
1540 | */ | |
1541 | static noinline_for_stack | |
1542 | int lookup_inline_extent_backref(struct btrfs_trans_handle *trans, | |
87bde3cd | 1543 | struct btrfs_fs_info *fs_info, |
5d4f98a2 YZ |
1544 | struct btrfs_path *path, |
1545 | struct btrfs_extent_inline_ref **ref_ret, | |
1546 | u64 bytenr, u64 num_bytes, | |
1547 | u64 parent, u64 root_objectid, | |
1548 | u64 owner, u64 offset, int insert) | |
1549 | { | |
87bde3cd | 1550 | struct btrfs_root *root = fs_info->extent_root; |
5d4f98a2 YZ |
1551 | struct btrfs_key key; |
1552 | struct extent_buffer *leaf; | |
1553 | struct btrfs_extent_item *ei; | |
1554 | struct btrfs_extent_inline_ref *iref; | |
1555 | u64 flags; | |
1556 | u64 item_size; | |
1557 | unsigned long ptr; | |
1558 | unsigned long end; | |
1559 | int extra_size; | |
1560 | int type; | |
1561 | int want; | |
1562 | int ret; | |
1563 | int err = 0; | |
0b246afa | 1564 | bool skinny_metadata = btrfs_fs_incompat(fs_info, SKINNY_METADATA); |
26b8003f | 1565 | |
db94535d | 1566 | key.objectid = bytenr; |
31840ae1 | 1567 | key.type = BTRFS_EXTENT_ITEM_KEY; |
56bec294 | 1568 | key.offset = num_bytes; |
31840ae1 | 1569 | |
5d4f98a2 YZ |
1570 | want = extent_ref_type(parent, owner); |
1571 | if (insert) { | |
1572 | extra_size = btrfs_extent_inline_ref_size(want); | |
85d4198e | 1573 | path->keep_locks = 1; |
5d4f98a2 YZ |
1574 | } else |
1575 | extra_size = -1; | |
3173a18f JB |
1576 | |
1577 | /* | |
1578 | * Owner is our parent level, so we can just add one to get the level | |
1579 | * for the block we are interested in. | |
1580 | */ | |
1581 | if (skinny_metadata && owner < BTRFS_FIRST_FREE_OBJECTID) { | |
1582 | key.type = BTRFS_METADATA_ITEM_KEY; | |
1583 | key.offset = owner; | |
1584 | } | |
1585 | ||
1586 | again: | |
5d4f98a2 | 1587 | ret = btrfs_search_slot(trans, root, &key, path, extra_size, 1); |
b9473439 | 1588 | if (ret < 0) { |
5d4f98a2 YZ |
1589 | err = ret; |
1590 | goto out; | |
1591 | } | |
3173a18f JB |
1592 | |
1593 | /* | |
1594 | * We may be a newly converted file system which still has the old fat | |
1595 | * extent entries for metadata, so try and see if we have one of those. | |
1596 | */ | |
1597 | if (ret > 0 && skinny_metadata) { | |
1598 | skinny_metadata = false; | |
1599 | if (path->slots[0]) { | |
1600 | path->slots[0]--; | |
1601 | btrfs_item_key_to_cpu(path->nodes[0], &key, | |
1602 | path->slots[0]); | |
1603 | if (key.objectid == bytenr && | |
1604 | key.type == BTRFS_EXTENT_ITEM_KEY && | |
1605 | key.offset == num_bytes) | |
1606 | ret = 0; | |
1607 | } | |
1608 | if (ret) { | |
9ce49a0b | 1609 | key.objectid = bytenr; |
3173a18f JB |
1610 | key.type = BTRFS_EXTENT_ITEM_KEY; |
1611 | key.offset = num_bytes; | |
1612 | btrfs_release_path(path); | |
1613 | goto again; | |
1614 | } | |
1615 | } | |
1616 | ||
79787eaa JM |
1617 | if (ret && !insert) { |
1618 | err = -ENOENT; | |
1619 | goto out; | |
fae7f21c | 1620 | } else if (WARN_ON(ret)) { |
492104c8 | 1621 | err = -EIO; |
492104c8 | 1622 | goto out; |
79787eaa | 1623 | } |
5d4f98a2 YZ |
1624 | |
1625 | leaf = path->nodes[0]; | |
1626 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
1627 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
1628 | if (item_size < sizeof(*ei)) { | |
1629 | if (!insert) { | |
1630 | err = -ENOENT; | |
1631 | goto out; | |
1632 | } | |
87bde3cd | 1633 | ret = convert_extent_item_v0(trans, fs_info, path, owner, |
5d4f98a2 YZ |
1634 | extra_size); |
1635 | if (ret < 0) { | |
1636 | err = ret; | |
1637 | goto out; | |
1638 | } | |
1639 | leaf = path->nodes[0]; | |
1640 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
1641 | } | |
1642 | #endif | |
1643 | BUG_ON(item_size < sizeof(*ei)); | |
1644 | ||
5d4f98a2 YZ |
1645 | ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); |
1646 | flags = btrfs_extent_flags(leaf, ei); | |
1647 | ||
1648 | ptr = (unsigned long)(ei + 1); | |
1649 | end = (unsigned long)ei + item_size; | |
1650 | ||
3173a18f | 1651 | if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK && !skinny_metadata) { |
5d4f98a2 YZ |
1652 | ptr += sizeof(struct btrfs_tree_block_info); |
1653 | BUG_ON(ptr > end); | |
5d4f98a2 YZ |
1654 | } |
1655 | ||
1656 | err = -ENOENT; | |
1657 | while (1) { | |
1658 | if (ptr >= end) { | |
1659 | WARN_ON(ptr > end); | |
1660 | break; | |
1661 | } | |
1662 | iref = (struct btrfs_extent_inline_ref *)ptr; | |
1663 | type = btrfs_extent_inline_ref_type(leaf, iref); | |
1664 | if (want < type) | |
1665 | break; | |
1666 | if (want > type) { | |
1667 | ptr += btrfs_extent_inline_ref_size(type); | |
1668 | continue; | |
1669 | } | |
1670 | ||
1671 | if (type == BTRFS_EXTENT_DATA_REF_KEY) { | |
1672 | struct btrfs_extent_data_ref *dref; | |
1673 | dref = (struct btrfs_extent_data_ref *)(&iref->offset); | |
1674 | if (match_extent_data_ref(leaf, dref, root_objectid, | |
1675 | owner, offset)) { | |
1676 | err = 0; | |
1677 | break; | |
1678 | } | |
1679 | if (hash_extent_data_ref_item(leaf, dref) < | |
1680 | hash_extent_data_ref(root_objectid, owner, offset)) | |
1681 | break; | |
1682 | } else { | |
1683 | u64 ref_offset; | |
1684 | ref_offset = btrfs_extent_inline_ref_offset(leaf, iref); | |
1685 | if (parent > 0) { | |
1686 | if (parent == ref_offset) { | |
1687 | err = 0; | |
1688 | break; | |
1689 | } | |
1690 | if (ref_offset < parent) | |
1691 | break; | |
1692 | } else { | |
1693 | if (root_objectid == ref_offset) { | |
1694 | err = 0; | |
1695 | break; | |
1696 | } | |
1697 | if (ref_offset < root_objectid) | |
1698 | break; | |
1699 | } | |
1700 | } | |
1701 | ptr += btrfs_extent_inline_ref_size(type); | |
1702 | } | |
1703 | if (err == -ENOENT && insert) { | |
1704 | if (item_size + extra_size >= | |
1705 | BTRFS_MAX_EXTENT_ITEM_SIZE(root)) { | |
1706 | err = -EAGAIN; | |
1707 | goto out; | |
1708 | } | |
1709 | /* | |
1710 | * To add new inline back ref, we have to make sure | |
1711 | * there is no corresponding back ref item. | |
1712 | * For simplicity, we just do not add new inline back | |
1713 | * ref if there is any kind of item for this block | |
1714 | */ | |
2c47e605 YZ |
1715 | if (find_next_key(path, 0, &key) == 0 && |
1716 | key.objectid == bytenr && | |
85d4198e | 1717 | key.type < BTRFS_BLOCK_GROUP_ITEM_KEY) { |
5d4f98a2 YZ |
1718 | err = -EAGAIN; |
1719 | goto out; | |
1720 | } | |
1721 | } | |
1722 | *ref_ret = (struct btrfs_extent_inline_ref *)ptr; | |
1723 | out: | |
85d4198e | 1724 | if (insert) { |
5d4f98a2 YZ |
1725 | path->keep_locks = 0; |
1726 | btrfs_unlock_up_safe(path, 1); | |
1727 | } | |
1728 | return err; | |
1729 | } | |
1730 | ||
1731 | /* | |
1732 | * helper to add new inline back ref | |
1733 | */ | |
1734 | static noinline_for_stack | |
87bde3cd | 1735 | void setup_inline_extent_backref(struct btrfs_fs_info *fs_info, |
143bede5 JM |
1736 | struct btrfs_path *path, |
1737 | struct btrfs_extent_inline_ref *iref, | |
1738 | u64 parent, u64 root_objectid, | |
1739 | u64 owner, u64 offset, int refs_to_add, | |
1740 | struct btrfs_delayed_extent_op *extent_op) | |
5d4f98a2 YZ |
1741 | { |
1742 | struct extent_buffer *leaf; | |
1743 | struct btrfs_extent_item *ei; | |
1744 | unsigned long ptr; | |
1745 | unsigned long end; | |
1746 | unsigned long item_offset; | |
1747 | u64 refs; | |
1748 | int size; | |
1749 | int type; | |
5d4f98a2 YZ |
1750 | |
1751 | leaf = path->nodes[0]; | |
1752 | ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); | |
1753 | item_offset = (unsigned long)iref - (unsigned long)ei; | |
1754 | ||
1755 | type = extent_ref_type(parent, owner); | |
1756 | size = btrfs_extent_inline_ref_size(type); | |
1757 | ||
87bde3cd | 1758 | btrfs_extend_item(fs_info, path, size); |
5d4f98a2 YZ |
1759 | |
1760 | ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); | |
1761 | refs = btrfs_extent_refs(leaf, ei); | |
1762 | refs += refs_to_add; | |
1763 | btrfs_set_extent_refs(leaf, ei, refs); | |
1764 | if (extent_op) | |
1765 | __run_delayed_extent_op(extent_op, leaf, ei); | |
1766 | ||
1767 | ptr = (unsigned long)ei + item_offset; | |
1768 | end = (unsigned long)ei + btrfs_item_size_nr(leaf, path->slots[0]); | |
1769 | if (ptr < end - size) | |
1770 | memmove_extent_buffer(leaf, ptr + size, ptr, | |
1771 | end - size - ptr); | |
1772 | ||
1773 | iref = (struct btrfs_extent_inline_ref *)ptr; | |
1774 | btrfs_set_extent_inline_ref_type(leaf, iref, type); | |
1775 | if (type == BTRFS_EXTENT_DATA_REF_KEY) { | |
1776 | struct btrfs_extent_data_ref *dref; | |
1777 | dref = (struct btrfs_extent_data_ref *)(&iref->offset); | |
1778 | btrfs_set_extent_data_ref_root(leaf, dref, root_objectid); | |
1779 | btrfs_set_extent_data_ref_objectid(leaf, dref, owner); | |
1780 | btrfs_set_extent_data_ref_offset(leaf, dref, offset); | |
1781 | btrfs_set_extent_data_ref_count(leaf, dref, refs_to_add); | |
1782 | } else if (type == BTRFS_SHARED_DATA_REF_KEY) { | |
1783 | struct btrfs_shared_data_ref *sref; | |
1784 | sref = (struct btrfs_shared_data_ref *)(iref + 1); | |
1785 | btrfs_set_shared_data_ref_count(leaf, sref, refs_to_add); | |
1786 | btrfs_set_extent_inline_ref_offset(leaf, iref, parent); | |
1787 | } else if (type == BTRFS_SHARED_BLOCK_REF_KEY) { | |
1788 | btrfs_set_extent_inline_ref_offset(leaf, iref, parent); | |
1789 | } else { | |
1790 | btrfs_set_extent_inline_ref_offset(leaf, iref, root_objectid); | |
1791 | } | |
1792 | btrfs_mark_buffer_dirty(leaf); | |
5d4f98a2 YZ |
1793 | } |
1794 | ||
1795 | static int lookup_extent_backref(struct btrfs_trans_handle *trans, | |
87bde3cd | 1796 | struct btrfs_fs_info *fs_info, |
5d4f98a2 YZ |
1797 | struct btrfs_path *path, |
1798 | struct btrfs_extent_inline_ref **ref_ret, | |
1799 | u64 bytenr, u64 num_bytes, u64 parent, | |
1800 | u64 root_objectid, u64 owner, u64 offset) | |
1801 | { | |
1802 | int ret; | |
1803 | ||
87bde3cd | 1804 | ret = lookup_inline_extent_backref(trans, fs_info, path, ref_ret, |
5d4f98a2 YZ |
1805 | bytenr, num_bytes, parent, |
1806 | root_objectid, owner, offset, 0); | |
1807 | if (ret != -ENOENT) | |
54aa1f4d | 1808 | return ret; |
5d4f98a2 | 1809 | |
b3b4aa74 | 1810 | btrfs_release_path(path); |
5d4f98a2 YZ |
1811 | *ref_ret = NULL; |
1812 | ||
1813 | if (owner < BTRFS_FIRST_FREE_OBJECTID) { | |
87bde3cd JM |
1814 | ret = lookup_tree_block_ref(trans, fs_info, path, bytenr, |
1815 | parent, root_objectid); | |
5d4f98a2 | 1816 | } else { |
87bde3cd JM |
1817 | ret = lookup_extent_data_ref(trans, fs_info, path, bytenr, |
1818 | parent, root_objectid, owner, | |
1819 | offset); | |
b9473439 | 1820 | } |
5d4f98a2 YZ |
1821 | return ret; |
1822 | } | |
31840ae1 | 1823 | |
5d4f98a2 YZ |
1824 | /* |
1825 | * helper to update/remove inline back ref | |
1826 | */ | |
1827 | static noinline_for_stack | |
87bde3cd | 1828 | void update_inline_extent_backref(struct btrfs_fs_info *fs_info, |
143bede5 JM |
1829 | struct btrfs_path *path, |
1830 | struct btrfs_extent_inline_ref *iref, | |
1831 | int refs_to_mod, | |
fcebe456 JB |
1832 | struct btrfs_delayed_extent_op *extent_op, |
1833 | int *last_ref) | |
5d4f98a2 YZ |
1834 | { |
1835 | struct extent_buffer *leaf; | |
1836 | struct btrfs_extent_item *ei; | |
1837 | struct btrfs_extent_data_ref *dref = NULL; | |
1838 | struct btrfs_shared_data_ref *sref = NULL; | |
1839 | unsigned long ptr; | |
1840 | unsigned long end; | |
1841 | u32 item_size; | |
1842 | int size; | |
1843 | int type; | |
5d4f98a2 YZ |
1844 | u64 refs; |
1845 | ||
1846 | leaf = path->nodes[0]; | |
1847 | ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); | |
1848 | refs = btrfs_extent_refs(leaf, ei); | |
1849 | WARN_ON(refs_to_mod < 0 && refs + refs_to_mod <= 0); | |
1850 | refs += refs_to_mod; | |
1851 | btrfs_set_extent_refs(leaf, ei, refs); | |
1852 | if (extent_op) | |
1853 | __run_delayed_extent_op(extent_op, leaf, ei); | |
1854 | ||
1855 | type = btrfs_extent_inline_ref_type(leaf, iref); | |
1856 | ||
1857 | if (type == BTRFS_EXTENT_DATA_REF_KEY) { | |
1858 | dref = (struct btrfs_extent_data_ref *)(&iref->offset); | |
1859 | refs = btrfs_extent_data_ref_count(leaf, dref); | |
1860 | } else if (type == BTRFS_SHARED_DATA_REF_KEY) { | |
1861 | sref = (struct btrfs_shared_data_ref *)(iref + 1); | |
1862 | refs = btrfs_shared_data_ref_count(leaf, sref); | |
1863 | } else { | |
1864 | refs = 1; | |
1865 | BUG_ON(refs_to_mod != -1); | |
56bec294 | 1866 | } |
31840ae1 | 1867 | |
5d4f98a2 YZ |
1868 | BUG_ON(refs_to_mod < 0 && refs < -refs_to_mod); |
1869 | refs += refs_to_mod; | |
1870 | ||
1871 | if (refs > 0) { | |
1872 | if (type == BTRFS_EXTENT_DATA_REF_KEY) | |
1873 | btrfs_set_extent_data_ref_count(leaf, dref, refs); | |
1874 | else | |
1875 | btrfs_set_shared_data_ref_count(leaf, sref, refs); | |
1876 | } else { | |
fcebe456 | 1877 | *last_ref = 1; |
5d4f98a2 YZ |
1878 | size = btrfs_extent_inline_ref_size(type); |
1879 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
1880 | ptr = (unsigned long)iref; | |
1881 | end = (unsigned long)ei + item_size; | |
1882 | if (ptr + size < end) | |
1883 | memmove_extent_buffer(leaf, ptr, ptr + size, | |
1884 | end - ptr - size); | |
1885 | item_size -= size; | |
87bde3cd | 1886 | btrfs_truncate_item(fs_info, path, item_size, 1); |
5d4f98a2 YZ |
1887 | } |
1888 | btrfs_mark_buffer_dirty(leaf); | |
5d4f98a2 YZ |
1889 | } |
1890 | ||
1891 | static noinline_for_stack | |
1892 | int insert_inline_extent_backref(struct btrfs_trans_handle *trans, | |
87bde3cd | 1893 | struct btrfs_fs_info *fs_info, |
5d4f98a2 YZ |
1894 | struct btrfs_path *path, |
1895 | u64 bytenr, u64 num_bytes, u64 parent, | |
1896 | u64 root_objectid, u64 owner, | |
1897 | u64 offset, int refs_to_add, | |
1898 | struct btrfs_delayed_extent_op *extent_op) | |
1899 | { | |
1900 | struct btrfs_extent_inline_ref *iref; | |
1901 | int ret; | |
1902 | ||
87bde3cd | 1903 | ret = lookup_inline_extent_backref(trans, fs_info, path, &iref, |
5d4f98a2 YZ |
1904 | bytenr, num_bytes, parent, |
1905 | root_objectid, owner, offset, 1); | |
1906 | if (ret == 0) { | |
1907 | BUG_ON(owner < BTRFS_FIRST_FREE_OBJECTID); | |
87bde3cd | 1908 | update_inline_extent_backref(fs_info, path, iref, |
fcebe456 | 1909 | refs_to_add, extent_op, NULL); |
5d4f98a2 | 1910 | } else if (ret == -ENOENT) { |
87bde3cd | 1911 | setup_inline_extent_backref(fs_info, path, iref, parent, |
143bede5 JM |
1912 | root_objectid, owner, offset, |
1913 | refs_to_add, extent_op); | |
1914 | ret = 0; | |
771ed689 | 1915 | } |
5d4f98a2 YZ |
1916 | return ret; |
1917 | } | |
31840ae1 | 1918 | |
5d4f98a2 | 1919 | static int insert_extent_backref(struct btrfs_trans_handle *trans, |
87bde3cd | 1920 | struct btrfs_fs_info *fs_info, |
5d4f98a2 YZ |
1921 | struct btrfs_path *path, |
1922 | u64 bytenr, u64 parent, u64 root_objectid, | |
1923 | u64 owner, u64 offset, int refs_to_add) | |
1924 | { | |
1925 | int ret; | |
1926 | if (owner < BTRFS_FIRST_FREE_OBJECTID) { | |
1927 | BUG_ON(refs_to_add != 1); | |
87bde3cd | 1928 | ret = insert_tree_block_ref(trans, fs_info, path, bytenr, |
5d4f98a2 YZ |
1929 | parent, root_objectid); |
1930 | } else { | |
87bde3cd | 1931 | ret = insert_extent_data_ref(trans, fs_info, path, bytenr, |
5d4f98a2 YZ |
1932 | parent, root_objectid, |
1933 | owner, offset, refs_to_add); | |
1934 | } | |
1935 | return ret; | |
1936 | } | |
56bec294 | 1937 | |
5d4f98a2 | 1938 | static int remove_extent_backref(struct btrfs_trans_handle *trans, |
87bde3cd | 1939 | struct btrfs_fs_info *fs_info, |
5d4f98a2 YZ |
1940 | struct btrfs_path *path, |
1941 | struct btrfs_extent_inline_ref *iref, | |
fcebe456 | 1942 | int refs_to_drop, int is_data, int *last_ref) |
5d4f98a2 | 1943 | { |
143bede5 | 1944 | int ret = 0; |
b9473439 | 1945 | |
5d4f98a2 YZ |
1946 | BUG_ON(!is_data && refs_to_drop != 1); |
1947 | if (iref) { | |
87bde3cd | 1948 | update_inline_extent_backref(fs_info, path, iref, |
fcebe456 | 1949 | -refs_to_drop, NULL, last_ref); |
5d4f98a2 | 1950 | } else if (is_data) { |
87bde3cd | 1951 | ret = remove_extent_data_ref(trans, fs_info, path, refs_to_drop, |
fcebe456 | 1952 | last_ref); |
5d4f98a2 | 1953 | } else { |
fcebe456 | 1954 | *last_ref = 1; |
87bde3cd | 1955 | ret = btrfs_del_item(trans, fs_info->extent_root, path); |
5d4f98a2 YZ |
1956 | } |
1957 | return ret; | |
1958 | } | |
1959 | ||
86557861 | 1960 | #define in_range(b, first, len) ((b) >= (first) && (b) < (first) + (len)) |
d04c6b88 JM |
1961 | static int btrfs_issue_discard(struct block_device *bdev, u64 start, u64 len, |
1962 | u64 *discarded_bytes) | |
5d4f98a2 | 1963 | { |
86557861 JM |
1964 | int j, ret = 0; |
1965 | u64 bytes_left, end; | |
4d89d377 | 1966 | u64 aligned_start = ALIGN(start, 1 << 9); |
d04c6b88 | 1967 | |
4d89d377 JM |
1968 | if (WARN_ON(start != aligned_start)) { |
1969 | len -= aligned_start - start; | |
1970 | len = round_down(len, 1 << 9); | |
1971 | start = aligned_start; | |
1972 | } | |
d04c6b88 | 1973 | |
4d89d377 | 1974 | *discarded_bytes = 0; |
86557861 JM |
1975 | |
1976 | if (!len) | |
1977 | return 0; | |
1978 | ||
1979 | end = start + len; | |
1980 | bytes_left = len; | |
1981 | ||
1982 | /* Skip any superblocks on this device. */ | |
1983 | for (j = 0; j < BTRFS_SUPER_MIRROR_MAX; j++) { | |
1984 | u64 sb_start = btrfs_sb_offset(j); | |
1985 | u64 sb_end = sb_start + BTRFS_SUPER_INFO_SIZE; | |
1986 | u64 size = sb_start - start; | |
1987 | ||
1988 | if (!in_range(sb_start, start, bytes_left) && | |
1989 | !in_range(sb_end, start, bytes_left) && | |
1990 | !in_range(start, sb_start, BTRFS_SUPER_INFO_SIZE)) | |
1991 | continue; | |
1992 | ||
1993 | /* | |
1994 | * Superblock spans beginning of range. Adjust start and | |
1995 | * try again. | |
1996 | */ | |
1997 | if (sb_start <= start) { | |
1998 | start += sb_end - start; | |
1999 | if (start > end) { | |
2000 | bytes_left = 0; | |
2001 | break; | |
2002 | } | |
2003 | bytes_left = end - start; | |
2004 | continue; | |
2005 | } | |
2006 | ||
2007 | if (size) { | |
2008 | ret = blkdev_issue_discard(bdev, start >> 9, size >> 9, | |
2009 | GFP_NOFS, 0); | |
2010 | if (!ret) | |
2011 | *discarded_bytes += size; | |
2012 | else if (ret != -EOPNOTSUPP) | |
2013 | return ret; | |
2014 | } | |
2015 | ||
2016 | start = sb_end; | |
2017 | if (start > end) { | |
2018 | bytes_left = 0; | |
2019 | break; | |
2020 | } | |
2021 | bytes_left = end - start; | |
2022 | } | |
2023 | ||
2024 | if (bytes_left) { | |
2025 | ret = blkdev_issue_discard(bdev, start >> 9, bytes_left >> 9, | |
4d89d377 JM |
2026 | GFP_NOFS, 0); |
2027 | if (!ret) | |
86557861 | 2028 | *discarded_bytes += bytes_left; |
4d89d377 | 2029 | } |
d04c6b88 | 2030 | return ret; |
5d4f98a2 | 2031 | } |
5d4f98a2 | 2032 | |
2ff7e61e | 2033 | int btrfs_discard_extent(struct btrfs_fs_info *fs_info, u64 bytenr, |
1edb647b | 2034 | u64 num_bytes, u64 *actual_bytes) |
5d4f98a2 | 2035 | { |
5d4f98a2 | 2036 | int ret; |
5378e607 | 2037 | u64 discarded_bytes = 0; |
a1d3c478 | 2038 | struct btrfs_bio *bbio = NULL; |
5d4f98a2 | 2039 | |
e244a0ae | 2040 | |
2999241d FM |
2041 | /* |
2042 | * Avoid races with device replace and make sure our bbio has devices | |
2043 | * associated to its stripes that don't go away while we are discarding. | |
2044 | */ | |
0b246afa | 2045 | btrfs_bio_counter_inc_blocked(fs_info); |
5d4f98a2 | 2046 | /* Tell the block device(s) that the sectors can be discarded */ |
0b246afa JM |
2047 | ret = btrfs_map_block(fs_info, BTRFS_MAP_DISCARD, bytenr, &num_bytes, |
2048 | &bbio, 0); | |
79787eaa | 2049 | /* Error condition is -ENOMEM */ |
5d4f98a2 | 2050 | if (!ret) { |
a1d3c478 | 2051 | struct btrfs_bio_stripe *stripe = bbio->stripes; |
5d4f98a2 YZ |
2052 | int i; |
2053 | ||
5d4f98a2 | 2054 | |
a1d3c478 | 2055 | for (i = 0; i < bbio->num_stripes; i++, stripe++) { |
d04c6b88 | 2056 | u64 bytes; |
d5e2003c JB |
2057 | if (!stripe->dev->can_discard) |
2058 | continue; | |
2059 | ||
5378e607 LD |
2060 | ret = btrfs_issue_discard(stripe->dev->bdev, |
2061 | stripe->physical, | |
d04c6b88 JM |
2062 | stripe->length, |
2063 | &bytes); | |
5378e607 | 2064 | if (!ret) |
d04c6b88 | 2065 | discarded_bytes += bytes; |
5378e607 | 2066 | else if (ret != -EOPNOTSUPP) |
79787eaa | 2067 | break; /* Logic errors or -ENOMEM, or -EIO but I don't know how that could happen JDM */ |
d5e2003c JB |
2068 | |
2069 | /* | |
2070 | * Just in case we get back EOPNOTSUPP for some reason, | |
2071 | * just ignore the return value so we don't screw up | |
2072 | * people calling discard_extent. | |
2073 | */ | |
2074 | ret = 0; | |
5d4f98a2 | 2075 | } |
6e9606d2 | 2076 | btrfs_put_bbio(bbio); |
5d4f98a2 | 2077 | } |
0b246afa | 2078 | btrfs_bio_counter_dec(fs_info); |
5378e607 LD |
2079 | |
2080 | if (actual_bytes) | |
2081 | *actual_bytes = discarded_bytes; | |
2082 | ||
5d4f98a2 | 2083 | |
53b381b3 DW |
2084 | if (ret == -EOPNOTSUPP) |
2085 | ret = 0; | |
5d4f98a2 | 2086 | return ret; |
5d4f98a2 YZ |
2087 | } |
2088 | ||
79787eaa | 2089 | /* Can return -ENOMEM */ |
5d4f98a2 | 2090 | int btrfs_inc_extent_ref(struct btrfs_trans_handle *trans, |
2ff7e61e | 2091 | struct btrfs_fs_info *fs_info, |
5d4f98a2 | 2092 | u64 bytenr, u64 num_bytes, u64 parent, |
b06c4bf5 | 2093 | u64 root_objectid, u64 owner, u64 offset) |
5d4f98a2 YZ |
2094 | { |
2095 | int ret; | |
66d7e7f0 | 2096 | |
5d4f98a2 YZ |
2097 | BUG_ON(owner < BTRFS_FIRST_FREE_OBJECTID && |
2098 | root_objectid == BTRFS_TREE_LOG_OBJECTID); | |
2099 | ||
2100 | if (owner < BTRFS_FIRST_FREE_OBJECTID) { | |
66d7e7f0 AJ |
2101 | ret = btrfs_add_delayed_tree_ref(fs_info, trans, bytenr, |
2102 | num_bytes, | |
5d4f98a2 | 2103 | parent, root_objectid, (int)owner, |
b06c4bf5 | 2104 | BTRFS_ADD_DELAYED_REF, NULL); |
5d4f98a2 | 2105 | } else { |
66d7e7f0 | 2106 | ret = btrfs_add_delayed_data_ref(fs_info, trans, bytenr, |
5846a3c2 QW |
2107 | num_bytes, parent, root_objectid, |
2108 | owner, offset, 0, | |
fef394f7 | 2109 | BTRFS_ADD_DELAYED_REF); |
5d4f98a2 YZ |
2110 | } |
2111 | return ret; | |
2112 | } | |
2113 | ||
2114 | static int __btrfs_inc_extent_ref(struct btrfs_trans_handle *trans, | |
2ff7e61e | 2115 | struct btrfs_fs_info *fs_info, |
c682f9b3 | 2116 | struct btrfs_delayed_ref_node *node, |
5d4f98a2 YZ |
2117 | u64 parent, u64 root_objectid, |
2118 | u64 owner, u64 offset, int refs_to_add, | |
2119 | struct btrfs_delayed_extent_op *extent_op) | |
2120 | { | |
2121 | struct btrfs_path *path; | |
2122 | struct extent_buffer *leaf; | |
2123 | struct btrfs_extent_item *item; | |
fcebe456 | 2124 | struct btrfs_key key; |
c682f9b3 QW |
2125 | u64 bytenr = node->bytenr; |
2126 | u64 num_bytes = node->num_bytes; | |
5d4f98a2 YZ |
2127 | u64 refs; |
2128 | int ret; | |
5d4f98a2 YZ |
2129 | |
2130 | path = btrfs_alloc_path(); | |
2131 | if (!path) | |
2132 | return -ENOMEM; | |
2133 | ||
e4058b54 | 2134 | path->reada = READA_FORWARD; |
5d4f98a2 YZ |
2135 | path->leave_spinning = 1; |
2136 | /* this will setup the path even if it fails to insert the back ref */ | |
87bde3cd JM |
2137 | ret = insert_inline_extent_backref(trans, fs_info, path, bytenr, |
2138 | num_bytes, parent, root_objectid, | |
2139 | owner, offset, | |
5d4f98a2 | 2140 | refs_to_add, extent_op); |
0ed4792a | 2141 | if ((ret < 0 && ret != -EAGAIN) || !ret) |
5d4f98a2 | 2142 | goto out; |
fcebe456 JB |
2143 | |
2144 | /* | |
2145 | * Ok we had -EAGAIN which means we didn't have space to insert and | |
2146 | * inline extent ref, so just update the reference count and add a | |
2147 | * normal backref. | |
2148 | */ | |
5d4f98a2 | 2149 | leaf = path->nodes[0]; |
fcebe456 | 2150 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); |
5d4f98a2 YZ |
2151 | item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); |
2152 | refs = btrfs_extent_refs(leaf, item); | |
2153 | btrfs_set_extent_refs(leaf, item, refs + refs_to_add); | |
2154 | if (extent_op) | |
2155 | __run_delayed_extent_op(extent_op, leaf, item); | |
56bec294 | 2156 | |
5d4f98a2 | 2157 | btrfs_mark_buffer_dirty(leaf); |
b3b4aa74 | 2158 | btrfs_release_path(path); |
56bec294 | 2159 | |
e4058b54 | 2160 | path->reada = READA_FORWARD; |
b9473439 | 2161 | path->leave_spinning = 1; |
56bec294 | 2162 | /* now insert the actual backref */ |
87bde3cd JM |
2163 | ret = insert_extent_backref(trans, fs_info, path, bytenr, parent, |
2164 | root_objectid, owner, offset, refs_to_add); | |
79787eaa | 2165 | if (ret) |
66642832 | 2166 | btrfs_abort_transaction(trans, ret); |
5d4f98a2 | 2167 | out: |
56bec294 | 2168 | btrfs_free_path(path); |
30d133fc | 2169 | return ret; |
56bec294 CM |
2170 | } |
2171 | ||
5d4f98a2 | 2172 | static int run_delayed_data_ref(struct btrfs_trans_handle *trans, |
2ff7e61e | 2173 | struct btrfs_fs_info *fs_info, |
5d4f98a2 YZ |
2174 | struct btrfs_delayed_ref_node *node, |
2175 | struct btrfs_delayed_extent_op *extent_op, | |
2176 | int insert_reserved) | |
56bec294 | 2177 | { |
5d4f98a2 YZ |
2178 | int ret = 0; |
2179 | struct btrfs_delayed_data_ref *ref; | |
2180 | struct btrfs_key ins; | |
2181 | u64 parent = 0; | |
2182 | u64 ref_root = 0; | |
2183 | u64 flags = 0; | |
2184 | ||
2185 | ins.objectid = node->bytenr; | |
2186 | ins.offset = node->num_bytes; | |
2187 | ins.type = BTRFS_EXTENT_ITEM_KEY; | |
2188 | ||
2189 | ref = btrfs_delayed_node_to_data_ref(node); | |
0b246afa | 2190 | trace_run_delayed_data_ref(fs_info, node, ref, node->action); |
599c75ec | 2191 | |
5d4f98a2 YZ |
2192 | if (node->type == BTRFS_SHARED_DATA_REF_KEY) |
2193 | parent = ref->parent; | |
fcebe456 | 2194 | ref_root = ref->root; |
5d4f98a2 YZ |
2195 | |
2196 | if (node->action == BTRFS_ADD_DELAYED_REF && insert_reserved) { | |
3173a18f | 2197 | if (extent_op) |
5d4f98a2 | 2198 | flags |= extent_op->flags_to_set; |
2ff7e61e | 2199 | ret = alloc_reserved_file_extent(trans, fs_info, |
5d4f98a2 YZ |
2200 | parent, ref_root, flags, |
2201 | ref->objectid, ref->offset, | |
2202 | &ins, node->ref_mod); | |
5d4f98a2 | 2203 | } else if (node->action == BTRFS_ADD_DELAYED_REF) { |
2ff7e61e | 2204 | ret = __btrfs_inc_extent_ref(trans, fs_info, node, parent, |
5d4f98a2 YZ |
2205 | ref_root, ref->objectid, |
2206 | ref->offset, node->ref_mod, | |
c682f9b3 | 2207 | extent_op); |
5d4f98a2 | 2208 | } else if (node->action == BTRFS_DROP_DELAYED_REF) { |
2ff7e61e | 2209 | ret = __btrfs_free_extent(trans, fs_info, node, parent, |
5d4f98a2 YZ |
2210 | ref_root, ref->objectid, |
2211 | ref->offset, node->ref_mod, | |
c682f9b3 | 2212 | extent_op); |
5d4f98a2 YZ |
2213 | } else { |
2214 | BUG(); | |
2215 | } | |
2216 | return ret; | |
2217 | } | |
2218 | ||
2219 | static void __run_delayed_extent_op(struct btrfs_delayed_extent_op *extent_op, | |
2220 | struct extent_buffer *leaf, | |
2221 | struct btrfs_extent_item *ei) | |
2222 | { | |
2223 | u64 flags = btrfs_extent_flags(leaf, ei); | |
2224 | if (extent_op->update_flags) { | |
2225 | flags |= extent_op->flags_to_set; | |
2226 | btrfs_set_extent_flags(leaf, ei, flags); | |
2227 | } | |
2228 | ||
2229 | if (extent_op->update_key) { | |
2230 | struct btrfs_tree_block_info *bi; | |
2231 | BUG_ON(!(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)); | |
2232 | bi = (struct btrfs_tree_block_info *)(ei + 1); | |
2233 | btrfs_set_tree_block_key(leaf, bi, &extent_op->key); | |
2234 | } | |
2235 | } | |
2236 | ||
2237 | static int run_delayed_extent_op(struct btrfs_trans_handle *trans, | |
2ff7e61e | 2238 | struct btrfs_fs_info *fs_info, |
5d4f98a2 YZ |
2239 | struct btrfs_delayed_ref_node *node, |
2240 | struct btrfs_delayed_extent_op *extent_op) | |
2241 | { | |
2242 | struct btrfs_key key; | |
2243 | struct btrfs_path *path; | |
2244 | struct btrfs_extent_item *ei; | |
2245 | struct extent_buffer *leaf; | |
2246 | u32 item_size; | |
56bec294 | 2247 | int ret; |
5d4f98a2 | 2248 | int err = 0; |
b1c79e09 | 2249 | int metadata = !extent_op->is_data; |
5d4f98a2 | 2250 | |
79787eaa JM |
2251 | if (trans->aborted) |
2252 | return 0; | |
2253 | ||
0b246afa | 2254 | if (metadata && !btrfs_fs_incompat(fs_info, SKINNY_METADATA)) |
3173a18f JB |
2255 | metadata = 0; |
2256 | ||
5d4f98a2 YZ |
2257 | path = btrfs_alloc_path(); |
2258 | if (!path) | |
2259 | return -ENOMEM; | |
2260 | ||
2261 | key.objectid = node->bytenr; | |
5d4f98a2 | 2262 | |
3173a18f | 2263 | if (metadata) { |
3173a18f | 2264 | key.type = BTRFS_METADATA_ITEM_KEY; |
b1c79e09 | 2265 | key.offset = extent_op->level; |
3173a18f JB |
2266 | } else { |
2267 | key.type = BTRFS_EXTENT_ITEM_KEY; | |
2268 | key.offset = node->num_bytes; | |
2269 | } | |
2270 | ||
2271 | again: | |
e4058b54 | 2272 | path->reada = READA_FORWARD; |
5d4f98a2 | 2273 | path->leave_spinning = 1; |
0b246afa | 2274 | ret = btrfs_search_slot(trans, fs_info->extent_root, &key, path, 0, 1); |
5d4f98a2 YZ |
2275 | if (ret < 0) { |
2276 | err = ret; | |
2277 | goto out; | |
2278 | } | |
2279 | if (ret > 0) { | |
3173a18f | 2280 | if (metadata) { |
55994887 FDBM |
2281 | if (path->slots[0] > 0) { |
2282 | path->slots[0]--; | |
2283 | btrfs_item_key_to_cpu(path->nodes[0], &key, | |
2284 | path->slots[0]); | |
2285 | if (key.objectid == node->bytenr && | |
2286 | key.type == BTRFS_EXTENT_ITEM_KEY && | |
2287 | key.offset == node->num_bytes) | |
2288 | ret = 0; | |
2289 | } | |
2290 | if (ret > 0) { | |
2291 | btrfs_release_path(path); | |
2292 | metadata = 0; | |
3173a18f | 2293 | |
55994887 FDBM |
2294 | key.objectid = node->bytenr; |
2295 | key.offset = node->num_bytes; | |
2296 | key.type = BTRFS_EXTENT_ITEM_KEY; | |
2297 | goto again; | |
2298 | } | |
2299 | } else { | |
2300 | err = -EIO; | |
2301 | goto out; | |
3173a18f | 2302 | } |
5d4f98a2 YZ |
2303 | } |
2304 | ||
2305 | leaf = path->nodes[0]; | |
2306 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
2307 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
2308 | if (item_size < sizeof(*ei)) { | |
87bde3cd | 2309 | ret = convert_extent_item_v0(trans, fs_info, path, (u64)-1, 0); |
5d4f98a2 YZ |
2310 | if (ret < 0) { |
2311 | err = ret; | |
2312 | goto out; | |
2313 | } | |
2314 | leaf = path->nodes[0]; | |
2315 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
2316 | } | |
2317 | #endif | |
2318 | BUG_ON(item_size < sizeof(*ei)); | |
2319 | ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); | |
2320 | __run_delayed_extent_op(extent_op, leaf, ei); | |
56bec294 | 2321 | |
5d4f98a2 YZ |
2322 | btrfs_mark_buffer_dirty(leaf); |
2323 | out: | |
2324 | btrfs_free_path(path); | |
2325 | return err; | |
56bec294 CM |
2326 | } |
2327 | ||
5d4f98a2 | 2328 | static int run_delayed_tree_ref(struct btrfs_trans_handle *trans, |
2ff7e61e | 2329 | struct btrfs_fs_info *fs_info, |
5d4f98a2 YZ |
2330 | struct btrfs_delayed_ref_node *node, |
2331 | struct btrfs_delayed_extent_op *extent_op, | |
2332 | int insert_reserved) | |
56bec294 CM |
2333 | { |
2334 | int ret = 0; | |
5d4f98a2 YZ |
2335 | struct btrfs_delayed_tree_ref *ref; |
2336 | struct btrfs_key ins; | |
2337 | u64 parent = 0; | |
2338 | u64 ref_root = 0; | |
0b246afa | 2339 | bool skinny_metadata = btrfs_fs_incompat(fs_info, SKINNY_METADATA); |
56bec294 | 2340 | |
5d4f98a2 | 2341 | ref = btrfs_delayed_node_to_tree_ref(node); |
0b246afa | 2342 | trace_run_delayed_tree_ref(fs_info, node, ref, node->action); |
599c75ec | 2343 | |
5d4f98a2 YZ |
2344 | if (node->type == BTRFS_SHARED_BLOCK_REF_KEY) |
2345 | parent = ref->parent; | |
fcebe456 | 2346 | ref_root = ref->root; |
5d4f98a2 | 2347 | |
3173a18f JB |
2348 | ins.objectid = node->bytenr; |
2349 | if (skinny_metadata) { | |
2350 | ins.offset = ref->level; | |
2351 | ins.type = BTRFS_METADATA_ITEM_KEY; | |
2352 | } else { | |
2353 | ins.offset = node->num_bytes; | |
2354 | ins.type = BTRFS_EXTENT_ITEM_KEY; | |
2355 | } | |
2356 | ||
02794222 | 2357 | if (node->ref_mod != 1) { |
2ff7e61e | 2358 | btrfs_err(fs_info, |
02794222 LB |
2359 | "btree block(%llu) has %d references rather than 1: action %d ref_root %llu parent %llu", |
2360 | node->bytenr, node->ref_mod, node->action, ref_root, | |
2361 | parent); | |
2362 | return -EIO; | |
2363 | } | |
5d4f98a2 | 2364 | if (node->action == BTRFS_ADD_DELAYED_REF && insert_reserved) { |
3173a18f | 2365 | BUG_ON(!extent_op || !extent_op->update_flags); |
2ff7e61e | 2366 | ret = alloc_reserved_tree_block(trans, fs_info, |
5d4f98a2 YZ |
2367 | parent, ref_root, |
2368 | extent_op->flags_to_set, | |
2369 | &extent_op->key, | |
b06c4bf5 | 2370 | ref->level, &ins); |
5d4f98a2 | 2371 | } else if (node->action == BTRFS_ADD_DELAYED_REF) { |
2ff7e61e | 2372 | ret = __btrfs_inc_extent_ref(trans, fs_info, node, |
c682f9b3 QW |
2373 | parent, ref_root, |
2374 | ref->level, 0, 1, | |
fcebe456 | 2375 | extent_op); |
5d4f98a2 | 2376 | } else if (node->action == BTRFS_DROP_DELAYED_REF) { |
2ff7e61e | 2377 | ret = __btrfs_free_extent(trans, fs_info, node, |
c682f9b3 QW |
2378 | parent, ref_root, |
2379 | ref->level, 0, 1, extent_op); | |
5d4f98a2 YZ |
2380 | } else { |
2381 | BUG(); | |
2382 | } | |
56bec294 CM |
2383 | return ret; |
2384 | } | |
2385 | ||
2386 | /* helper function to actually process a single delayed ref entry */ | |
5d4f98a2 | 2387 | static int run_one_delayed_ref(struct btrfs_trans_handle *trans, |
2ff7e61e | 2388 | struct btrfs_fs_info *fs_info, |
5d4f98a2 YZ |
2389 | struct btrfs_delayed_ref_node *node, |
2390 | struct btrfs_delayed_extent_op *extent_op, | |
2391 | int insert_reserved) | |
56bec294 | 2392 | { |
79787eaa JM |
2393 | int ret = 0; |
2394 | ||
857cc2fc JB |
2395 | if (trans->aborted) { |
2396 | if (insert_reserved) | |
2ff7e61e | 2397 | btrfs_pin_extent(fs_info, node->bytenr, |
857cc2fc | 2398 | node->num_bytes, 1); |
79787eaa | 2399 | return 0; |
857cc2fc | 2400 | } |
79787eaa | 2401 | |
5d4f98a2 | 2402 | if (btrfs_delayed_ref_is_head(node)) { |
56bec294 CM |
2403 | struct btrfs_delayed_ref_head *head; |
2404 | /* | |
2405 | * we've hit the end of the chain and we were supposed | |
2406 | * to insert this extent into the tree. But, it got | |
2407 | * deleted before we ever needed to insert it, so all | |
2408 | * we have to do is clean up the accounting | |
2409 | */ | |
5d4f98a2 YZ |
2410 | BUG_ON(extent_op); |
2411 | head = btrfs_delayed_node_to_head(node); | |
0b246afa | 2412 | trace_run_delayed_ref_head(fs_info, node, head, node->action); |
599c75ec | 2413 | |
56bec294 | 2414 | if (insert_reserved) { |
2ff7e61e | 2415 | btrfs_pin_extent(fs_info, node->bytenr, |
f0486c68 | 2416 | node->num_bytes, 1); |
5d4f98a2 | 2417 | if (head->is_data) { |
0b246afa | 2418 | ret = btrfs_del_csums(trans, fs_info, |
5d4f98a2 YZ |
2419 | node->bytenr, |
2420 | node->num_bytes); | |
5d4f98a2 | 2421 | } |
56bec294 | 2422 | } |
297d750b QW |
2423 | |
2424 | /* Also free its reserved qgroup space */ | |
0b246afa | 2425 | btrfs_qgroup_free_delayed_ref(fs_info, head->qgroup_ref_root, |
297d750b | 2426 | head->qgroup_reserved); |
79787eaa | 2427 | return ret; |
56bec294 CM |
2428 | } |
2429 | ||
5d4f98a2 YZ |
2430 | if (node->type == BTRFS_TREE_BLOCK_REF_KEY || |
2431 | node->type == BTRFS_SHARED_BLOCK_REF_KEY) | |
2ff7e61e | 2432 | ret = run_delayed_tree_ref(trans, fs_info, node, extent_op, |
5d4f98a2 YZ |
2433 | insert_reserved); |
2434 | else if (node->type == BTRFS_EXTENT_DATA_REF_KEY || | |
2435 | node->type == BTRFS_SHARED_DATA_REF_KEY) | |
2ff7e61e | 2436 | ret = run_delayed_data_ref(trans, fs_info, node, extent_op, |
5d4f98a2 YZ |
2437 | insert_reserved); |
2438 | else | |
2439 | BUG(); | |
2440 | return ret; | |
56bec294 CM |
2441 | } |
2442 | ||
c6fc2454 | 2443 | static inline struct btrfs_delayed_ref_node * |
56bec294 CM |
2444 | select_delayed_ref(struct btrfs_delayed_ref_head *head) |
2445 | { | |
cffc3374 FM |
2446 | struct btrfs_delayed_ref_node *ref; |
2447 | ||
c6fc2454 QW |
2448 | if (list_empty(&head->ref_list)) |
2449 | return NULL; | |
d7df2c79 | 2450 | |
cffc3374 FM |
2451 | /* |
2452 | * Select a delayed ref of type BTRFS_ADD_DELAYED_REF first. | |
2453 | * This is to prevent a ref count from going down to zero, which deletes | |
2454 | * the extent item from the extent tree, when there still are references | |
2455 | * to add, which would fail because they would not find the extent item. | |
2456 | */ | |
1d57ee94 WX |
2457 | if (!list_empty(&head->ref_add_list)) |
2458 | return list_first_entry(&head->ref_add_list, | |
2459 | struct btrfs_delayed_ref_node, add_list); | |
2460 | ||
2461 | ref = list_first_entry(&head->ref_list, struct btrfs_delayed_ref_node, | |
2462 | list); | |
2463 | ASSERT(list_empty(&ref->add_list)); | |
2464 | return ref; | |
56bec294 CM |
2465 | } |
2466 | ||
79787eaa JM |
2467 | /* |
2468 | * Returns 0 on success or if called with an already aborted transaction. | |
2469 | * Returns -ENOMEM or -EIO on failure and will abort the transaction. | |
2470 | */ | |
d7df2c79 | 2471 | static noinline int __btrfs_run_delayed_refs(struct btrfs_trans_handle *trans, |
2ff7e61e | 2472 | struct btrfs_fs_info *fs_info, |
d7df2c79 | 2473 | unsigned long nr) |
56bec294 | 2474 | { |
56bec294 CM |
2475 | struct btrfs_delayed_ref_root *delayed_refs; |
2476 | struct btrfs_delayed_ref_node *ref; | |
2477 | struct btrfs_delayed_ref_head *locked_ref = NULL; | |
5d4f98a2 | 2478 | struct btrfs_delayed_extent_op *extent_op; |
0a2b2a84 | 2479 | ktime_t start = ktime_get(); |
56bec294 | 2480 | int ret; |
d7df2c79 | 2481 | unsigned long count = 0; |
0a2b2a84 | 2482 | unsigned long actual_count = 0; |
56bec294 | 2483 | int must_insert_reserved = 0; |
56bec294 CM |
2484 | |
2485 | delayed_refs = &trans->transaction->delayed_refs; | |
56bec294 CM |
2486 | while (1) { |
2487 | if (!locked_ref) { | |
d7df2c79 | 2488 | if (count >= nr) |
56bec294 | 2489 | break; |
56bec294 | 2490 | |
d7df2c79 JB |
2491 | spin_lock(&delayed_refs->lock); |
2492 | locked_ref = btrfs_select_ref_head(trans); | |
2493 | if (!locked_ref) { | |
2494 | spin_unlock(&delayed_refs->lock); | |
2495 | break; | |
2496 | } | |
c3e69d58 CM |
2497 | |
2498 | /* grab the lock that says we are going to process | |
2499 | * all the refs for this head */ | |
2500 | ret = btrfs_delayed_ref_lock(trans, locked_ref); | |
d7df2c79 | 2501 | spin_unlock(&delayed_refs->lock); |
c3e69d58 CM |
2502 | /* |
2503 | * we may have dropped the spin lock to get the head | |
2504 | * mutex lock, and that might have given someone else | |
2505 | * time to free the head. If that's true, it has been | |
2506 | * removed from our list and we can move on. | |
2507 | */ | |
2508 | if (ret == -EAGAIN) { | |
2509 | locked_ref = NULL; | |
2510 | count++; | |
2511 | continue; | |
56bec294 CM |
2512 | } |
2513 | } | |
a28ec197 | 2514 | |
2c3cf7d5 FM |
2515 | /* |
2516 | * We need to try and merge add/drops of the same ref since we | |
2517 | * can run into issues with relocate dropping the implicit ref | |
2518 | * and then it being added back again before the drop can | |
2519 | * finish. If we merged anything we need to re-loop so we can | |
2520 | * get a good ref. | |
2521 | * Or we can get node references of the same type that weren't | |
2522 | * merged when created due to bumps in the tree mod seq, and | |
2523 | * we need to merge them to prevent adding an inline extent | |
2524 | * backref before dropping it (triggering a BUG_ON at | |
2525 | * insert_inline_extent_backref()). | |
2526 | */ | |
d7df2c79 | 2527 | spin_lock(&locked_ref->lock); |
2c3cf7d5 FM |
2528 | btrfs_merge_delayed_refs(trans, fs_info, delayed_refs, |
2529 | locked_ref); | |
ae1e206b | 2530 | |
d1270cd9 AJ |
2531 | /* |
2532 | * locked_ref is the head node, so we have to go one | |
2533 | * node back for any delayed ref updates | |
2534 | */ | |
2535 | ref = select_delayed_ref(locked_ref); | |
2536 | ||
2537 | if (ref && ref->seq && | |
097b8a7c | 2538 | btrfs_check_delayed_seq(fs_info, delayed_refs, ref->seq)) { |
d7df2c79 | 2539 | spin_unlock(&locked_ref->lock); |
d7df2c79 JB |
2540 | spin_lock(&delayed_refs->lock); |
2541 | locked_ref->processing = 0; | |
d1270cd9 AJ |
2542 | delayed_refs->num_heads_ready++; |
2543 | spin_unlock(&delayed_refs->lock); | |
d0280996 | 2544 | btrfs_delayed_ref_unlock(locked_ref); |
d7df2c79 | 2545 | locked_ref = NULL; |
d1270cd9 | 2546 | cond_resched(); |
27a377db | 2547 | count++; |
d1270cd9 AJ |
2548 | continue; |
2549 | } | |
2550 | ||
56bec294 CM |
2551 | /* |
2552 | * record the must insert reserved flag before we | |
2553 | * drop the spin lock. | |
2554 | */ | |
2555 | must_insert_reserved = locked_ref->must_insert_reserved; | |
2556 | locked_ref->must_insert_reserved = 0; | |
7bb86316 | 2557 | |
5d4f98a2 YZ |
2558 | extent_op = locked_ref->extent_op; |
2559 | locked_ref->extent_op = NULL; | |
2560 | ||
56bec294 | 2561 | if (!ref) { |
d7df2c79 JB |
2562 | |
2563 | ||
56bec294 CM |
2564 | /* All delayed refs have been processed, Go ahead |
2565 | * and send the head node to run_one_delayed_ref, | |
2566 | * so that any accounting fixes can happen | |
2567 | */ | |
2568 | ref = &locked_ref->node; | |
5d4f98a2 YZ |
2569 | |
2570 | if (extent_op && must_insert_reserved) { | |
78a6184a | 2571 | btrfs_free_delayed_extent_op(extent_op); |
5d4f98a2 YZ |
2572 | extent_op = NULL; |
2573 | } | |
2574 | ||
2575 | if (extent_op) { | |
d7df2c79 | 2576 | spin_unlock(&locked_ref->lock); |
2ff7e61e | 2577 | ret = run_delayed_extent_op(trans, fs_info, |
5d4f98a2 | 2578 | ref, extent_op); |
78a6184a | 2579 | btrfs_free_delayed_extent_op(extent_op); |
5d4f98a2 | 2580 | |
79787eaa | 2581 | if (ret) { |
857cc2fc JB |
2582 | /* |
2583 | * Need to reset must_insert_reserved if | |
2584 | * there was an error so the abort stuff | |
2585 | * can cleanup the reserved space | |
2586 | * properly. | |
2587 | */ | |
2588 | if (must_insert_reserved) | |
2589 | locked_ref->must_insert_reserved = 1; | |
aa7c8da3 | 2590 | spin_lock(&delayed_refs->lock); |
d7df2c79 | 2591 | locked_ref->processing = 0; |
aa7c8da3 JM |
2592 | delayed_refs->num_heads_ready++; |
2593 | spin_unlock(&delayed_refs->lock); | |
5d163e0e JM |
2594 | btrfs_debug(fs_info, |
2595 | "run_delayed_extent_op returned %d", | |
2596 | ret); | |
093486c4 | 2597 | btrfs_delayed_ref_unlock(locked_ref); |
79787eaa JM |
2598 | return ret; |
2599 | } | |
d7df2c79 | 2600 | continue; |
5d4f98a2 | 2601 | } |
02217ed2 | 2602 | |
d7df2c79 | 2603 | /* |
01327610 | 2604 | * Need to drop our head ref lock and re-acquire the |
d7df2c79 JB |
2605 | * delayed ref lock and then re-check to make sure |
2606 | * nobody got added. | |
2607 | */ | |
2608 | spin_unlock(&locked_ref->lock); | |
2609 | spin_lock(&delayed_refs->lock); | |
2610 | spin_lock(&locked_ref->lock); | |
c6fc2454 | 2611 | if (!list_empty(&locked_ref->ref_list) || |
573a0755 | 2612 | locked_ref->extent_op) { |
d7df2c79 JB |
2613 | spin_unlock(&locked_ref->lock); |
2614 | spin_unlock(&delayed_refs->lock); | |
2615 | continue; | |
2616 | } | |
2617 | ref->in_tree = 0; | |
2618 | delayed_refs->num_heads--; | |
c46effa6 LB |
2619 | rb_erase(&locked_ref->href_node, |
2620 | &delayed_refs->href_root); | |
d7df2c79 JB |
2621 | spin_unlock(&delayed_refs->lock); |
2622 | } else { | |
0a2b2a84 | 2623 | actual_count++; |
d7df2c79 | 2624 | ref->in_tree = 0; |
c6fc2454 | 2625 | list_del(&ref->list); |
1d57ee94 WX |
2626 | if (!list_empty(&ref->add_list)) |
2627 | list_del(&ref->add_list); | |
c46effa6 | 2628 | } |
d7df2c79 JB |
2629 | atomic_dec(&delayed_refs->num_entries); |
2630 | ||
093486c4 | 2631 | if (!btrfs_delayed_ref_is_head(ref)) { |
22cd2e7d AJ |
2632 | /* |
2633 | * when we play the delayed ref, also correct the | |
2634 | * ref_mod on head | |
2635 | */ | |
2636 | switch (ref->action) { | |
2637 | case BTRFS_ADD_DELAYED_REF: | |
2638 | case BTRFS_ADD_DELAYED_EXTENT: | |
2639 | locked_ref->node.ref_mod -= ref->ref_mod; | |
2640 | break; | |
2641 | case BTRFS_DROP_DELAYED_REF: | |
2642 | locked_ref->node.ref_mod += ref->ref_mod; | |
2643 | break; | |
2644 | default: | |
2645 | WARN_ON(1); | |
2646 | } | |
2647 | } | |
d7df2c79 | 2648 | spin_unlock(&locked_ref->lock); |
925baedd | 2649 | |
2ff7e61e | 2650 | ret = run_one_delayed_ref(trans, fs_info, ref, extent_op, |
56bec294 | 2651 | must_insert_reserved); |
eb099670 | 2652 | |
78a6184a | 2653 | btrfs_free_delayed_extent_op(extent_op); |
79787eaa | 2654 | if (ret) { |
9d1032cc | 2655 | spin_lock(&delayed_refs->lock); |
d7df2c79 | 2656 | locked_ref->processing = 0; |
9d1032cc WX |
2657 | delayed_refs->num_heads_ready++; |
2658 | spin_unlock(&delayed_refs->lock); | |
093486c4 MX |
2659 | btrfs_delayed_ref_unlock(locked_ref); |
2660 | btrfs_put_delayed_ref(ref); | |
5d163e0e JM |
2661 | btrfs_debug(fs_info, "run_one_delayed_ref returned %d", |
2662 | ret); | |
79787eaa JM |
2663 | return ret; |
2664 | } | |
2665 | ||
093486c4 MX |
2666 | /* |
2667 | * If this node is a head, that means all the refs in this head | |
2668 | * have been dealt with, and we will pick the next head to deal | |
2669 | * with, so we must unlock the head and drop it from the cluster | |
2670 | * list before we release it. | |
2671 | */ | |
2672 | if (btrfs_delayed_ref_is_head(ref)) { | |
1262133b JB |
2673 | if (locked_ref->is_data && |
2674 | locked_ref->total_ref_mod < 0) { | |
2675 | spin_lock(&delayed_refs->lock); | |
2676 | delayed_refs->pending_csums -= ref->num_bytes; | |
2677 | spin_unlock(&delayed_refs->lock); | |
2678 | } | |
093486c4 MX |
2679 | btrfs_delayed_ref_unlock(locked_ref); |
2680 | locked_ref = NULL; | |
2681 | } | |
2682 | btrfs_put_delayed_ref(ref); | |
2683 | count++; | |
c3e69d58 | 2684 | cond_resched(); |
c3e69d58 | 2685 | } |
0a2b2a84 JB |
2686 | |
2687 | /* | |
2688 | * We don't want to include ref heads since we can have empty ref heads | |
2689 | * and those will drastically skew our runtime down since we just do | |
2690 | * accounting, no actual extent tree updates. | |
2691 | */ | |
2692 | if (actual_count > 0) { | |
2693 | u64 runtime = ktime_to_ns(ktime_sub(ktime_get(), start)); | |
2694 | u64 avg; | |
2695 | ||
2696 | /* | |
2697 | * We weigh the current average higher than our current runtime | |
2698 | * to avoid large swings in the average. | |
2699 | */ | |
2700 | spin_lock(&delayed_refs->lock); | |
2701 | avg = fs_info->avg_delayed_ref_runtime * 3 + runtime; | |
f8c269d7 | 2702 | fs_info->avg_delayed_ref_runtime = avg >> 2; /* div by 4 */ |
0a2b2a84 JB |
2703 | spin_unlock(&delayed_refs->lock); |
2704 | } | |
d7df2c79 | 2705 | return 0; |
c3e69d58 CM |
2706 | } |
2707 | ||
709c0486 AJ |
2708 | #ifdef SCRAMBLE_DELAYED_REFS |
2709 | /* | |
2710 | * Normally delayed refs get processed in ascending bytenr order. This | |
2711 | * correlates in most cases to the order added. To expose dependencies on this | |
2712 | * order, we start to process the tree in the middle instead of the beginning | |
2713 | */ | |
2714 | static u64 find_middle(struct rb_root *root) | |
2715 | { | |
2716 | struct rb_node *n = root->rb_node; | |
2717 | struct btrfs_delayed_ref_node *entry; | |
2718 | int alt = 1; | |
2719 | u64 middle; | |
2720 | u64 first = 0, last = 0; | |
2721 | ||
2722 | n = rb_first(root); | |
2723 | if (n) { | |
2724 | entry = rb_entry(n, struct btrfs_delayed_ref_node, rb_node); | |
2725 | first = entry->bytenr; | |
2726 | } | |
2727 | n = rb_last(root); | |
2728 | if (n) { | |
2729 | entry = rb_entry(n, struct btrfs_delayed_ref_node, rb_node); | |
2730 | last = entry->bytenr; | |
2731 | } | |
2732 | n = root->rb_node; | |
2733 | ||
2734 | while (n) { | |
2735 | entry = rb_entry(n, struct btrfs_delayed_ref_node, rb_node); | |
2736 | WARN_ON(!entry->in_tree); | |
2737 | ||
2738 | middle = entry->bytenr; | |
2739 | ||
2740 | if (alt) | |
2741 | n = n->rb_left; | |
2742 | else | |
2743 | n = n->rb_right; | |
2744 | ||
2745 | alt = 1 - alt; | |
2746 | } | |
2747 | return middle; | |
2748 | } | |
2749 | #endif | |
2750 | ||
2ff7e61e | 2751 | static inline u64 heads_to_leaves(struct btrfs_fs_info *fs_info, u64 heads) |
1be41b78 JB |
2752 | { |
2753 | u64 num_bytes; | |
2754 | ||
2755 | num_bytes = heads * (sizeof(struct btrfs_extent_item) + | |
2756 | sizeof(struct btrfs_extent_inline_ref)); | |
0b246afa | 2757 | if (!btrfs_fs_incompat(fs_info, SKINNY_METADATA)) |
1be41b78 JB |
2758 | num_bytes += heads * sizeof(struct btrfs_tree_block_info); |
2759 | ||
2760 | /* | |
2761 | * We don't ever fill up leaves all the way so multiply by 2 just to be | |
01327610 | 2762 | * closer to what we're really going to want to use. |
1be41b78 | 2763 | */ |
0b246afa | 2764 | return div_u64(num_bytes, BTRFS_LEAF_DATA_SIZE(fs_info)); |
1be41b78 JB |
2765 | } |
2766 | ||
1262133b JB |
2767 | /* |
2768 | * Takes the number of bytes to be csumm'ed and figures out how many leaves it | |
2769 | * would require to store the csums for that many bytes. | |
2770 | */ | |
2ff7e61e | 2771 | u64 btrfs_csum_bytes_to_leaves(struct btrfs_fs_info *fs_info, u64 csum_bytes) |
1262133b JB |
2772 | { |
2773 | u64 csum_size; | |
2774 | u64 num_csums_per_leaf; | |
2775 | u64 num_csums; | |
2776 | ||
0b246afa | 2777 | csum_size = BTRFS_MAX_ITEM_SIZE(fs_info); |
1262133b | 2778 | num_csums_per_leaf = div64_u64(csum_size, |
0b246afa JM |
2779 | (u64)btrfs_super_csum_size(fs_info->super_copy)); |
2780 | num_csums = div64_u64(csum_bytes, fs_info->sectorsize); | |
1262133b JB |
2781 | num_csums += num_csums_per_leaf - 1; |
2782 | num_csums = div64_u64(num_csums, num_csums_per_leaf); | |
2783 | return num_csums; | |
2784 | } | |
2785 | ||
0a2b2a84 | 2786 | int btrfs_check_space_for_delayed_refs(struct btrfs_trans_handle *trans, |
2ff7e61e | 2787 | struct btrfs_fs_info *fs_info) |
1be41b78 JB |
2788 | { |
2789 | struct btrfs_block_rsv *global_rsv; | |
2790 | u64 num_heads = trans->transaction->delayed_refs.num_heads_ready; | |
1262133b | 2791 | u64 csum_bytes = trans->transaction->delayed_refs.pending_csums; |
cb723e49 JB |
2792 | u64 num_dirty_bgs = trans->transaction->num_dirty_bgs; |
2793 | u64 num_bytes, num_dirty_bgs_bytes; | |
1be41b78 JB |
2794 | int ret = 0; |
2795 | ||
0b246afa | 2796 | num_bytes = btrfs_calc_trans_metadata_size(fs_info, 1); |
2ff7e61e | 2797 | num_heads = heads_to_leaves(fs_info, num_heads); |
1be41b78 | 2798 | if (num_heads > 1) |
0b246afa | 2799 | num_bytes += (num_heads - 1) * fs_info->nodesize; |
1be41b78 | 2800 | num_bytes <<= 1; |
2ff7e61e JM |
2801 | num_bytes += btrfs_csum_bytes_to_leaves(fs_info, csum_bytes) * |
2802 | fs_info->nodesize; | |
0b246afa | 2803 | num_dirty_bgs_bytes = btrfs_calc_trans_metadata_size(fs_info, |
cb723e49 | 2804 | num_dirty_bgs); |
0b246afa | 2805 | global_rsv = &fs_info->global_block_rsv; |
1be41b78 JB |
2806 | |
2807 | /* | |
2808 | * If we can't allocate any more chunks lets make sure we have _lots_ of | |
2809 | * wiggle room since running delayed refs can create more delayed refs. | |
2810 | */ | |
cb723e49 JB |
2811 | if (global_rsv->space_info->full) { |
2812 | num_dirty_bgs_bytes <<= 1; | |
1be41b78 | 2813 | num_bytes <<= 1; |
cb723e49 | 2814 | } |
1be41b78 JB |
2815 | |
2816 | spin_lock(&global_rsv->lock); | |
cb723e49 | 2817 | if (global_rsv->reserved <= num_bytes + num_dirty_bgs_bytes) |
1be41b78 JB |
2818 | ret = 1; |
2819 | spin_unlock(&global_rsv->lock); | |
2820 | return ret; | |
2821 | } | |
2822 | ||
0a2b2a84 | 2823 | int btrfs_should_throttle_delayed_refs(struct btrfs_trans_handle *trans, |
2ff7e61e | 2824 | struct btrfs_fs_info *fs_info) |
0a2b2a84 | 2825 | { |
0a2b2a84 JB |
2826 | u64 num_entries = |
2827 | atomic_read(&trans->transaction->delayed_refs.num_entries); | |
2828 | u64 avg_runtime; | |
a79b7d4b | 2829 | u64 val; |
0a2b2a84 JB |
2830 | |
2831 | smp_mb(); | |
2832 | avg_runtime = fs_info->avg_delayed_ref_runtime; | |
a79b7d4b | 2833 | val = num_entries * avg_runtime; |
dc1a90c6 | 2834 | if (val >= NSEC_PER_SEC) |
0a2b2a84 | 2835 | return 1; |
a79b7d4b CM |
2836 | if (val >= NSEC_PER_SEC / 2) |
2837 | return 2; | |
0a2b2a84 | 2838 | |
2ff7e61e | 2839 | return btrfs_check_space_for_delayed_refs(trans, fs_info); |
0a2b2a84 JB |
2840 | } |
2841 | ||
a79b7d4b CM |
2842 | struct async_delayed_refs { |
2843 | struct btrfs_root *root; | |
31b9655f | 2844 | u64 transid; |
a79b7d4b CM |
2845 | int count; |
2846 | int error; | |
2847 | int sync; | |
2848 | struct completion wait; | |
2849 | struct btrfs_work work; | |
2850 | }; | |
2851 | ||
2ff7e61e JM |
2852 | static inline struct async_delayed_refs * |
2853 | to_async_delayed_refs(struct btrfs_work *work) | |
2854 | { | |
2855 | return container_of(work, struct async_delayed_refs, work); | |
2856 | } | |
2857 | ||
a79b7d4b CM |
2858 | static void delayed_ref_async_start(struct btrfs_work *work) |
2859 | { | |
2ff7e61e | 2860 | struct async_delayed_refs *async = to_async_delayed_refs(work); |
a79b7d4b | 2861 | struct btrfs_trans_handle *trans; |
2ff7e61e | 2862 | struct btrfs_fs_info *fs_info = async->root->fs_info; |
a79b7d4b CM |
2863 | int ret; |
2864 | ||
0f873eca | 2865 | /* if the commit is already started, we don't need to wait here */ |
2ff7e61e | 2866 | if (btrfs_transaction_blocked(fs_info)) |
31b9655f | 2867 | goto done; |
31b9655f | 2868 | |
0f873eca CM |
2869 | trans = btrfs_join_transaction(async->root); |
2870 | if (IS_ERR(trans)) { | |
2871 | async->error = PTR_ERR(trans); | |
a79b7d4b CM |
2872 | goto done; |
2873 | } | |
2874 | ||
2875 | /* | |
01327610 | 2876 | * trans->sync means that when we call end_transaction, we won't |
a79b7d4b CM |
2877 | * wait on delayed refs |
2878 | */ | |
2879 | trans->sync = true; | |
0f873eca CM |
2880 | |
2881 | /* Don't bother flushing if we got into a different transaction */ | |
2882 | if (trans->transid > async->transid) | |
2883 | goto end; | |
2884 | ||
2ff7e61e | 2885 | ret = btrfs_run_delayed_refs(trans, fs_info, async->count); |
a79b7d4b CM |
2886 | if (ret) |
2887 | async->error = ret; | |
0f873eca | 2888 | end: |
3a45bb20 | 2889 | ret = btrfs_end_transaction(trans); |
a79b7d4b CM |
2890 | if (ret && !async->error) |
2891 | async->error = ret; | |
2892 | done: | |
2893 | if (async->sync) | |
2894 | complete(&async->wait); | |
2895 | else | |
2896 | kfree(async); | |
2897 | } | |
2898 | ||
2ff7e61e | 2899 | int btrfs_async_run_delayed_refs(struct btrfs_fs_info *fs_info, |
31b9655f | 2900 | unsigned long count, u64 transid, int wait) |
a79b7d4b CM |
2901 | { |
2902 | struct async_delayed_refs *async; | |
2903 | int ret; | |
2904 | ||
2905 | async = kmalloc(sizeof(*async), GFP_NOFS); | |
2906 | if (!async) | |
2907 | return -ENOMEM; | |
2908 | ||
0b246afa | 2909 | async->root = fs_info->tree_root; |
a79b7d4b CM |
2910 | async->count = count; |
2911 | async->error = 0; | |
31b9655f | 2912 | async->transid = transid; |
a79b7d4b CM |
2913 | if (wait) |
2914 | async->sync = 1; | |
2915 | else | |
2916 | async->sync = 0; | |
2917 | init_completion(&async->wait); | |
2918 | ||
9e0af237 LB |
2919 | btrfs_init_work(&async->work, btrfs_extent_refs_helper, |
2920 | delayed_ref_async_start, NULL, NULL); | |
a79b7d4b | 2921 | |
0b246afa | 2922 | btrfs_queue_work(fs_info->extent_workers, &async->work); |
a79b7d4b CM |
2923 | |
2924 | if (wait) { | |
2925 | wait_for_completion(&async->wait); | |
2926 | ret = async->error; | |
2927 | kfree(async); | |
2928 | return ret; | |
2929 | } | |
2930 | return 0; | |
2931 | } | |
2932 | ||
c3e69d58 CM |
2933 | /* |
2934 | * this starts processing the delayed reference count updates and | |
2935 | * extent insertions we have queued up so far. count can be | |
2936 | * 0, which means to process everything in the tree at the start | |
2937 | * of the run (but not newly added entries), or it can be some target | |
2938 | * number you'd like to process. | |
79787eaa JM |
2939 | * |
2940 | * Returns 0 on success or if called with an aborted transaction | |
2941 | * Returns <0 on error and aborts the transaction | |
c3e69d58 CM |
2942 | */ |
2943 | int btrfs_run_delayed_refs(struct btrfs_trans_handle *trans, | |
2ff7e61e | 2944 | struct btrfs_fs_info *fs_info, unsigned long count) |
c3e69d58 CM |
2945 | { |
2946 | struct rb_node *node; | |
2947 | struct btrfs_delayed_ref_root *delayed_refs; | |
c46effa6 | 2948 | struct btrfs_delayed_ref_head *head; |
c3e69d58 CM |
2949 | int ret; |
2950 | int run_all = count == (unsigned long)-1; | |
d9a0540a | 2951 | bool can_flush_pending_bgs = trans->can_flush_pending_bgs; |
c3e69d58 | 2952 | |
79787eaa JM |
2953 | /* We'll clean this up in btrfs_cleanup_transaction */ |
2954 | if (trans->aborted) | |
2955 | return 0; | |
2956 | ||
0b246afa | 2957 | if (test_bit(BTRFS_FS_CREATING_FREE_SPACE_TREE, &fs_info->flags)) |
511711af CM |
2958 | return 0; |
2959 | ||
c3e69d58 | 2960 | delayed_refs = &trans->transaction->delayed_refs; |
26455d33 | 2961 | if (count == 0) |
d7df2c79 | 2962 | count = atomic_read(&delayed_refs->num_entries) * 2; |
bb721703 | 2963 | |
c3e69d58 | 2964 | again: |
709c0486 AJ |
2965 | #ifdef SCRAMBLE_DELAYED_REFS |
2966 | delayed_refs->run_delayed_start = find_middle(&delayed_refs->root); | |
2967 | #endif | |
d9a0540a | 2968 | trans->can_flush_pending_bgs = false; |
2ff7e61e | 2969 | ret = __btrfs_run_delayed_refs(trans, fs_info, count); |
d7df2c79 | 2970 | if (ret < 0) { |
66642832 | 2971 | btrfs_abort_transaction(trans, ret); |
d7df2c79 | 2972 | return ret; |
eb099670 | 2973 | } |
c3e69d58 | 2974 | |
56bec294 | 2975 | if (run_all) { |
d7df2c79 | 2976 | if (!list_empty(&trans->new_bgs)) |
2ff7e61e | 2977 | btrfs_create_pending_block_groups(trans, fs_info); |
ea658bad | 2978 | |
d7df2c79 | 2979 | spin_lock(&delayed_refs->lock); |
c46effa6 | 2980 | node = rb_first(&delayed_refs->href_root); |
d7df2c79 JB |
2981 | if (!node) { |
2982 | spin_unlock(&delayed_refs->lock); | |
56bec294 | 2983 | goto out; |
d7df2c79 | 2984 | } |
e9d0b13b | 2985 | |
56bec294 | 2986 | while (node) { |
c46effa6 LB |
2987 | head = rb_entry(node, struct btrfs_delayed_ref_head, |
2988 | href_node); | |
2989 | if (btrfs_delayed_ref_is_head(&head->node)) { | |
2990 | struct btrfs_delayed_ref_node *ref; | |
5caf2a00 | 2991 | |
c46effa6 | 2992 | ref = &head->node; |
6df8cdf5 | 2993 | refcount_inc(&ref->refs); |
56bec294 CM |
2994 | |
2995 | spin_unlock(&delayed_refs->lock); | |
8cc33e5c DS |
2996 | /* |
2997 | * Mutex was contended, block until it's | |
2998 | * released and try again | |
2999 | */ | |
56bec294 CM |
3000 | mutex_lock(&head->mutex); |
3001 | mutex_unlock(&head->mutex); | |
3002 | ||
3003 | btrfs_put_delayed_ref(ref); | |
1887be66 | 3004 | cond_resched(); |
56bec294 | 3005 | goto again; |
c46effa6 LB |
3006 | } else { |
3007 | WARN_ON(1); | |
56bec294 CM |
3008 | } |
3009 | node = rb_next(node); | |
3010 | } | |
3011 | spin_unlock(&delayed_refs->lock); | |
d7df2c79 | 3012 | cond_resched(); |
56bec294 | 3013 | goto again; |
5f39d397 | 3014 | } |
54aa1f4d | 3015 | out: |
d9a0540a | 3016 | trans->can_flush_pending_bgs = can_flush_pending_bgs; |
a28ec197 CM |
3017 | return 0; |
3018 | } | |
3019 | ||
5d4f98a2 | 3020 | int btrfs_set_disk_extent_flags(struct btrfs_trans_handle *trans, |
2ff7e61e | 3021 | struct btrfs_fs_info *fs_info, |
5d4f98a2 | 3022 | u64 bytenr, u64 num_bytes, u64 flags, |
b1c79e09 | 3023 | int level, int is_data) |
5d4f98a2 YZ |
3024 | { |
3025 | struct btrfs_delayed_extent_op *extent_op; | |
3026 | int ret; | |
3027 | ||
78a6184a | 3028 | extent_op = btrfs_alloc_delayed_extent_op(); |
5d4f98a2 YZ |
3029 | if (!extent_op) |
3030 | return -ENOMEM; | |
3031 | ||
3032 | extent_op->flags_to_set = flags; | |
35b3ad50 DS |
3033 | extent_op->update_flags = true; |
3034 | extent_op->update_key = false; | |
3035 | extent_op->is_data = is_data ? true : false; | |
b1c79e09 | 3036 | extent_op->level = level; |
5d4f98a2 | 3037 | |
0b246afa | 3038 | ret = btrfs_add_delayed_extent_op(fs_info, trans, bytenr, |
66d7e7f0 | 3039 | num_bytes, extent_op); |
5d4f98a2 | 3040 | if (ret) |
78a6184a | 3041 | btrfs_free_delayed_extent_op(extent_op); |
5d4f98a2 YZ |
3042 | return ret; |
3043 | } | |
3044 | ||
e4c3b2dc | 3045 | static noinline int check_delayed_ref(struct btrfs_root *root, |
5d4f98a2 YZ |
3046 | struct btrfs_path *path, |
3047 | u64 objectid, u64 offset, u64 bytenr) | |
3048 | { | |
3049 | struct btrfs_delayed_ref_head *head; | |
3050 | struct btrfs_delayed_ref_node *ref; | |
3051 | struct btrfs_delayed_data_ref *data_ref; | |
3052 | struct btrfs_delayed_ref_root *delayed_refs; | |
e4c3b2dc | 3053 | struct btrfs_transaction *cur_trans; |
5d4f98a2 YZ |
3054 | int ret = 0; |
3055 | ||
e4c3b2dc LB |
3056 | cur_trans = root->fs_info->running_transaction; |
3057 | if (!cur_trans) | |
3058 | return 0; | |
3059 | ||
3060 | delayed_refs = &cur_trans->delayed_refs; | |
5d4f98a2 | 3061 | spin_lock(&delayed_refs->lock); |
f72ad18e | 3062 | head = btrfs_find_delayed_ref_head(delayed_refs, bytenr); |
d7df2c79 JB |
3063 | if (!head) { |
3064 | spin_unlock(&delayed_refs->lock); | |
3065 | return 0; | |
3066 | } | |
5d4f98a2 YZ |
3067 | |
3068 | if (!mutex_trylock(&head->mutex)) { | |
6df8cdf5 | 3069 | refcount_inc(&head->node.refs); |
5d4f98a2 YZ |
3070 | spin_unlock(&delayed_refs->lock); |
3071 | ||
b3b4aa74 | 3072 | btrfs_release_path(path); |
5d4f98a2 | 3073 | |
8cc33e5c DS |
3074 | /* |
3075 | * Mutex was contended, block until it's released and let | |
3076 | * caller try again | |
3077 | */ | |
5d4f98a2 YZ |
3078 | mutex_lock(&head->mutex); |
3079 | mutex_unlock(&head->mutex); | |
3080 | btrfs_put_delayed_ref(&head->node); | |
3081 | return -EAGAIN; | |
3082 | } | |
d7df2c79 | 3083 | spin_unlock(&delayed_refs->lock); |
5d4f98a2 | 3084 | |
d7df2c79 | 3085 | spin_lock(&head->lock); |
c6fc2454 | 3086 | list_for_each_entry(ref, &head->ref_list, list) { |
d7df2c79 JB |
3087 | /* If it's a shared ref we know a cross reference exists */ |
3088 | if (ref->type != BTRFS_EXTENT_DATA_REF_KEY) { | |
3089 | ret = 1; | |
3090 | break; | |
3091 | } | |
5d4f98a2 | 3092 | |
d7df2c79 | 3093 | data_ref = btrfs_delayed_node_to_data_ref(ref); |
5d4f98a2 | 3094 | |
d7df2c79 JB |
3095 | /* |
3096 | * If our ref doesn't match the one we're currently looking at | |
3097 | * then we have a cross reference. | |
3098 | */ | |
3099 | if (data_ref->root != root->root_key.objectid || | |
3100 | data_ref->objectid != objectid || | |
3101 | data_ref->offset != offset) { | |
3102 | ret = 1; | |
3103 | break; | |
3104 | } | |
5d4f98a2 | 3105 | } |
d7df2c79 | 3106 | spin_unlock(&head->lock); |
5d4f98a2 | 3107 | mutex_unlock(&head->mutex); |
5d4f98a2 YZ |
3108 | return ret; |
3109 | } | |
3110 | ||
e4c3b2dc | 3111 | static noinline int check_committed_ref(struct btrfs_root *root, |
5d4f98a2 YZ |
3112 | struct btrfs_path *path, |
3113 | u64 objectid, u64 offset, u64 bytenr) | |
be20aa9d | 3114 | { |
0b246afa JM |
3115 | struct btrfs_fs_info *fs_info = root->fs_info; |
3116 | struct btrfs_root *extent_root = fs_info->extent_root; | |
f321e491 | 3117 | struct extent_buffer *leaf; |
5d4f98a2 YZ |
3118 | struct btrfs_extent_data_ref *ref; |
3119 | struct btrfs_extent_inline_ref *iref; | |
3120 | struct btrfs_extent_item *ei; | |
f321e491 | 3121 | struct btrfs_key key; |
5d4f98a2 | 3122 | u32 item_size; |
be20aa9d | 3123 | int ret; |
925baedd | 3124 | |
be20aa9d | 3125 | key.objectid = bytenr; |
31840ae1 | 3126 | key.offset = (u64)-1; |
f321e491 | 3127 | key.type = BTRFS_EXTENT_ITEM_KEY; |
be20aa9d | 3128 | |
be20aa9d CM |
3129 | ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0); |
3130 | if (ret < 0) | |
3131 | goto out; | |
79787eaa | 3132 | BUG_ON(ret == 0); /* Corruption */ |
80ff3856 YZ |
3133 | |
3134 | ret = -ENOENT; | |
3135 | if (path->slots[0] == 0) | |
31840ae1 | 3136 | goto out; |
be20aa9d | 3137 | |
31840ae1 | 3138 | path->slots[0]--; |
f321e491 | 3139 | leaf = path->nodes[0]; |
5d4f98a2 | 3140 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); |
be20aa9d | 3141 | |
5d4f98a2 | 3142 | if (key.objectid != bytenr || key.type != BTRFS_EXTENT_ITEM_KEY) |
be20aa9d | 3143 | goto out; |
f321e491 | 3144 | |
5d4f98a2 YZ |
3145 | ret = 1; |
3146 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
3147 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
3148 | if (item_size < sizeof(*ei)) { | |
3149 | WARN_ON(item_size != sizeof(struct btrfs_extent_item_v0)); | |
3150 | goto out; | |
3151 | } | |
3152 | #endif | |
3153 | ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); | |
bd09835d | 3154 | |
5d4f98a2 YZ |
3155 | if (item_size != sizeof(*ei) + |
3156 | btrfs_extent_inline_ref_size(BTRFS_EXTENT_DATA_REF_KEY)) | |
3157 | goto out; | |
be20aa9d | 3158 | |
5d4f98a2 YZ |
3159 | if (btrfs_extent_generation(leaf, ei) <= |
3160 | btrfs_root_last_snapshot(&root->root_item)) | |
3161 | goto out; | |
3162 | ||
3163 | iref = (struct btrfs_extent_inline_ref *)(ei + 1); | |
3164 | if (btrfs_extent_inline_ref_type(leaf, iref) != | |
3165 | BTRFS_EXTENT_DATA_REF_KEY) | |
3166 | goto out; | |
3167 | ||
3168 | ref = (struct btrfs_extent_data_ref *)(&iref->offset); | |
3169 | if (btrfs_extent_refs(leaf, ei) != | |
3170 | btrfs_extent_data_ref_count(leaf, ref) || | |
3171 | btrfs_extent_data_ref_root(leaf, ref) != | |
3172 | root->root_key.objectid || | |
3173 | btrfs_extent_data_ref_objectid(leaf, ref) != objectid || | |
3174 | btrfs_extent_data_ref_offset(leaf, ref) != offset) | |
3175 | goto out; | |
3176 | ||
3177 | ret = 0; | |
3178 | out: | |
3179 | return ret; | |
3180 | } | |
3181 | ||
e4c3b2dc LB |
3182 | int btrfs_cross_ref_exist(struct btrfs_root *root, u64 objectid, u64 offset, |
3183 | u64 bytenr) | |
5d4f98a2 YZ |
3184 | { |
3185 | struct btrfs_path *path; | |
3186 | int ret; | |
3187 | int ret2; | |
3188 | ||
3189 | path = btrfs_alloc_path(); | |
3190 | if (!path) | |
3191 | return -ENOENT; | |
3192 | ||
3193 | do { | |
e4c3b2dc | 3194 | ret = check_committed_ref(root, path, objectid, |
5d4f98a2 YZ |
3195 | offset, bytenr); |
3196 | if (ret && ret != -ENOENT) | |
f321e491 | 3197 | goto out; |
80ff3856 | 3198 | |
e4c3b2dc | 3199 | ret2 = check_delayed_ref(root, path, objectid, |
5d4f98a2 YZ |
3200 | offset, bytenr); |
3201 | } while (ret2 == -EAGAIN); | |
3202 | ||
3203 | if (ret2 && ret2 != -ENOENT) { | |
3204 | ret = ret2; | |
3205 | goto out; | |
f321e491 | 3206 | } |
5d4f98a2 YZ |
3207 | |
3208 | if (ret != -ENOENT || ret2 != -ENOENT) | |
3209 | ret = 0; | |
be20aa9d | 3210 | out: |
80ff3856 | 3211 | btrfs_free_path(path); |
f0486c68 YZ |
3212 | if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID) |
3213 | WARN_ON(ret > 0); | |
f321e491 | 3214 | return ret; |
be20aa9d | 3215 | } |
c5739bba | 3216 | |
5d4f98a2 | 3217 | static int __btrfs_mod_ref(struct btrfs_trans_handle *trans, |
b7a9f29f | 3218 | struct btrfs_root *root, |
5d4f98a2 | 3219 | struct extent_buffer *buf, |
e339a6b0 | 3220 | int full_backref, int inc) |
31840ae1 | 3221 | { |
0b246afa | 3222 | struct btrfs_fs_info *fs_info = root->fs_info; |
31840ae1 | 3223 | u64 bytenr; |
5d4f98a2 YZ |
3224 | u64 num_bytes; |
3225 | u64 parent; | |
31840ae1 | 3226 | u64 ref_root; |
31840ae1 | 3227 | u32 nritems; |
31840ae1 ZY |
3228 | struct btrfs_key key; |
3229 | struct btrfs_file_extent_item *fi; | |
3230 | int i; | |
3231 | int level; | |
3232 | int ret = 0; | |
2ff7e61e JM |
3233 | int (*process_func)(struct btrfs_trans_handle *, |
3234 | struct btrfs_fs_info *, | |
b06c4bf5 | 3235 | u64, u64, u64, u64, u64, u64); |
31840ae1 | 3236 | |
fccb84c9 | 3237 | |
0b246afa | 3238 | if (btrfs_is_testing(fs_info)) |
faa2dbf0 | 3239 | return 0; |
fccb84c9 | 3240 | |
31840ae1 | 3241 | ref_root = btrfs_header_owner(buf); |
31840ae1 ZY |
3242 | nritems = btrfs_header_nritems(buf); |
3243 | level = btrfs_header_level(buf); | |
3244 | ||
27cdeb70 | 3245 | if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state) && level == 0) |
5d4f98a2 | 3246 | return 0; |
31840ae1 | 3247 | |
5d4f98a2 YZ |
3248 | if (inc) |
3249 | process_func = btrfs_inc_extent_ref; | |
3250 | else | |
3251 | process_func = btrfs_free_extent; | |
31840ae1 | 3252 | |
5d4f98a2 YZ |
3253 | if (full_backref) |
3254 | parent = buf->start; | |
3255 | else | |
3256 | parent = 0; | |
3257 | ||
3258 | for (i = 0; i < nritems; i++) { | |
31840ae1 | 3259 | if (level == 0) { |
5d4f98a2 | 3260 | btrfs_item_key_to_cpu(buf, &key, i); |
962a298f | 3261 | if (key.type != BTRFS_EXTENT_DATA_KEY) |
31840ae1 | 3262 | continue; |
5d4f98a2 | 3263 | fi = btrfs_item_ptr(buf, i, |
31840ae1 ZY |
3264 | struct btrfs_file_extent_item); |
3265 | if (btrfs_file_extent_type(buf, fi) == | |
3266 | BTRFS_FILE_EXTENT_INLINE) | |
3267 | continue; | |
3268 | bytenr = btrfs_file_extent_disk_bytenr(buf, fi); | |
3269 | if (bytenr == 0) | |
3270 | continue; | |
5d4f98a2 YZ |
3271 | |
3272 | num_bytes = btrfs_file_extent_disk_num_bytes(buf, fi); | |
3273 | key.offset -= btrfs_file_extent_offset(buf, fi); | |
2ff7e61e | 3274 | ret = process_func(trans, fs_info, bytenr, num_bytes, |
5d4f98a2 | 3275 | parent, ref_root, key.objectid, |
b06c4bf5 | 3276 | key.offset); |
31840ae1 ZY |
3277 | if (ret) |
3278 | goto fail; | |
3279 | } else { | |
5d4f98a2 | 3280 | bytenr = btrfs_node_blockptr(buf, i); |
0b246afa | 3281 | num_bytes = fs_info->nodesize; |
2ff7e61e | 3282 | ret = process_func(trans, fs_info, bytenr, num_bytes, |
b06c4bf5 | 3283 | parent, ref_root, level - 1, 0); |
31840ae1 ZY |
3284 | if (ret) |
3285 | goto fail; | |
3286 | } | |
3287 | } | |
3288 | return 0; | |
3289 | fail: | |
5d4f98a2 YZ |
3290 | return ret; |
3291 | } | |
3292 | ||
3293 | int btrfs_inc_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root, | |
e339a6b0 | 3294 | struct extent_buffer *buf, int full_backref) |
5d4f98a2 | 3295 | { |
e339a6b0 | 3296 | return __btrfs_mod_ref(trans, root, buf, full_backref, 1); |
5d4f98a2 YZ |
3297 | } |
3298 | ||
3299 | int btrfs_dec_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root, | |
e339a6b0 | 3300 | struct extent_buffer *buf, int full_backref) |
5d4f98a2 | 3301 | { |
e339a6b0 | 3302 | return __btrfs_mod_ref(trans, root, buf, full_backref, 0); |
31840ae1 ZY |
3303 | } |
3304 | ||
9078a3e1 | 3305 | static int write_one_cache_group(struct btrfs_trans_handle *trans, |
2ff7e61e | 3306 | struct btrfs_fs_info *fs_info, |
9078a3e1 CM |
3307 | struct btrfs_path *path, |
3308 | struct btrfs_block_group_cache *cache) | |
3309 | { | |
3310 | int ret; | |
0b246afa | 3311 | struct btrfs_root *extent_root = fs_info->extent_root; |
5f39d397 CM |
3312 | unsigned long bi; |
3313 | struct extent_buffer *leaf; | |
9078a3e1 | 3314 | |
9078a3e1 | 3315 | ret = btrfs_search_slot(trans, extent_root, &cache->key, path, 0, 1); |
df95e7f0 JB |
3316 | if (ret) { |
3317 | if (ret > 0) | |
3318 | ret = -ENOENT; | |
54aa1f4d | 3319 | goto fail; |
df95e7f0 | 3320 | } |
5f39d397 CM |
3321 | |
3322 | leaf = path->nodes[0]; | |
3323 | bi = btrfs_item_ptr_offset(leaf, path->slots[0]); | |
3324 | write_extent_buffer(leaf, &cache->item, bi, sizeof(cache->item)); | |
3325 | btrfs_mark_buffer_dirty(leaf); | |
54aa1f4d | 3326 | fail: |
24b89d08 | 3327 | btrfs_release_path(path); |
df95e7f0 | 3328 | return ret; |
9078a3e1 CM |
3329 | |
3330 | } | |
3331 | ||
4a8c9a62 | 3332 | static struct btrfs_block_group_cache * |
2ff7e61e | 3333 | next_block_group(struct btrfs_fs_info *fs_info, |
4a8c9a62 YZ |
3334 | struct btrfs_block_group_cache *cache) |
3335 | { | |
3336 | struct rb_node *node; | |
292cbd51 | 3337 | |
0b246afa | 3338 | spin_lock(&fs_info->block_group_cache_lock); |
292cbd51 FM |
3339 | |
3340 | /* If our block group was removed, we need a full search. */ | |
3341 | if (RB_EMPTY_NODE(&cache->cache_node)) { | |
3342 | const u64 next_bytenr = cache->key.objectid + cache->key.offset; | |
3343 | ||
0b246afa | 3344 | spin_unlock(&fs_info->block_group_cache_lock); |
292cbd51 | 3345 | btrfs_put_block_group(cache); |
0b246afa | 3346 | cache = btrfs_lookup_first_block_group(fs_info, next_bytenr); return cache; |
292cbd51 | 3347 | } |
4a8c9a62 YZ |
3348 | node = rb_next(&cache->cache_node); |
3349 | btrfs_put_block_group(cache); | |
3350 | if (node) { | |
3351 | cache = rb_entry(node, struct btrfs_block_group_cache, | |
3352 | cache_node); | |
11dfe35a | 3353 | btrfs_get_block_group(cache); |
4a8c9a62 YZ |
3354 | } else |
3355 | cache = NULL; | |
0b246afa | 3356 | spin_unlock(&fs_info->block_group_cache_lock); |
4a8c9a62 YZ |
3357 | return cache; |
3358 | } | |
3359 | ||
0af3d00b JB |
3360 | static int cache_save_setup(struct btrfs_block_group_cache *block_group, |
3361 | struct btrfs_trans_handle *trans, | |
3362 | struct btrfs_path *path) | |
3363 | { | |
0b246afa JM |
3364 | struct btrfs_fs_info *fs_info = block_group->fs_info; |
3365 | struct btrfs_root *root = fs_info->tree_root; | |
0af3d00b JB |
3366 | struct inode *inode = NULL; |
3367 | u64 alloc_hint = 0; | |
2b20982e | 3368 | int dcs = BTRFS_DC_ERROR; |
f8c269d7 | 3369 | u64 num_pages = 0; |
0af3d00b JB |
3370 | int retries = 0; |
3371 | int ret = 0; | |
3372 | ||
3373 | /* | |
3374 | * If this block group is smaller than 100 megs don't bother caching the | |
3375 | * block group. | |
3376 | */ | |
ee22184b | 3377 | if (block_group->key.offset < (100 * SZ_1M)) { |
0af3d00b JB |
3378 | spin_lock(&block_group->lock); |
3379 | block_group->disk_cache_state = BTRFS_DC_WRITTEN; | |
3380 | spin_unlock(&block_group->lock); | |
3381 | return 0; | |
3382 | } | |
3383 | ||
0c0ef4bc JB |
3384 | if (trans->aborted) |
3385 | return 0; | |
0af3d00b | 3386 | again: |
77ab86bf | 3387 | inode = lookup_free_space_inode(fs_info, block_group, path); |
0af3d00b JB |
3388 | if (IS_ERR(inode) && PTR_ERR(inode) != -ENOENT) { |
3389 | ret = PTR_ERR(inode); | |
b3b4aa74 | 3390 | btrfs_release_path(path); |
0af3d00b JB |
3391 | goto out; |
3392 | } | |
3393 | ||
3394 | if (IS_ERR(inode)) { | |
3395 | BUG_ON(retries); | |
3396 | retries++; | |
3397 | ||
3398 | if (block_group->ro) | |
3399 | goto out_free; | |
3400 | ||
77ab86bf JM |
3401 | ret = create_free_space_inode(fs_info, trans, block_group, |
3402 | path); | |
0af3d00b JB |
3403 | if (ret) |
3404 | goto out_free; | |
3405 | goto again; | |
3406 | } | |
3407 | ||
5b0e95bf JB |
3408 | /* We've already setup this transaction, go ahead and exit */ |
3409 | if (block_group->cache_generation == trans->transid && | |
3410 | i_size_read(inode)) { | |
3411 | dcs = BTRFS_DC_SETUP; | |
3412 | goto out_put; | |
3413 | } | |
3414 | ||
0af3d00b JB |
3415 | /* |
3416 | * We want to set the generation to 0, that way if anything goes wrong | |
3417 | * from here on out we know not to trust this cache when we load up next | |
3418 | * time. | |
3419 | */ | |
3420 | BTRFS_I(inode)->generation = 0; | |
3421 | ret = btrfs_update_inode(trans, root, inode); | |
0c0ef4bc JB |
3422 | if (ret) { |
3423 | /* | |
3424 | * So theoretically we could recover from this, simply set the | |
3425 | * super cache generation to 0 so we know to invalidate the | |
3426 | * cache, but then we'd have to keep track of the block groups | |
3427 | * that fail this way so we know we _have_ to reset this cache | |
3428 | * before the next commit or risk reading stale cache. So to | |
3429 | * limit our exposure to horrible edge cases lets just abort the | |
3430 | * transaction, this only happens in really bad situations | |
3431 | * anyway. | |
3432 | */ | |
66642832 | 3433 | btrfs_abort_transaction(trans, ret); |
0c0ef4bc JB |
3434 | goto out_put; |
3435 | } | |
0af3d00b JB |
3436 | WARN_ON(ret); |
3437 | ||
3438 | if (i_size_read(inode) > 0) { | |
2ff7e61e | 3439 | ret = btrfs_check_trunc_cache_free_space(fs_info, |
0b246afa | 3440 | &fs_info->global_block_rsv); |
7b61cd92 MX |
3441 | if (ret) |
3442 | goto out_put; | |
3443 | ||
77ab86bf | 3444 | ret = btrfs_truncate_free_space_cache(trans, NULL, inode); |
0af3d00b JB |
3445 | if (ret) |
3446 | goto out_put; | |
3447 | } | |
3448 | ||
3449 | spin_lock(&block_group->lock); | |
cf7c1ef6 | 3450 | if (block_group->cached != BTRFS_CACHE_FINISHED || |
0b246afa | 3451 | !btrfs_test_opt(fs_info, SPACE_CACHE)) { |
cf7c1ef6 LB |
3452 | /* |
3453 | * don't bother trying to write stuff out _if_ | |
3454 | * a) we're not cached, | |
1a79c1f2 LB |
3455 | * b) we're with nospace_cache mount option, |
3456 | * c) we're with v2 space_cache (FREE_SPACE_TREE). | |
cf7c1ef6 | 3457 | */ |
2b20982e | 3458 | dcs = BTRFS_DC_WRITTEN; |
0af3d00b JB |
3459 | spin_unlock(&block_group->lock); |
3460 | goto out_put; | |
3461 | } | |
3462 | spin_unlock(&block_group->lock); | |
3463 | ||
2968b1f4 JB |
3464 | /* |
3465 | * We hit an ENOSPC when setting up the cache in this transaction, just | |
3466 | * skip doing the setup, we've already cleared the cache so we're safe. | |
3467 | */ | |
3468 | if (test_bit(BTRFS_TRANS_CACHE_ENOSPC, &trans->transaction->flags)) { | |
3469 | ret = -ENOSPC; | |
3470 | goto out_put; | |
3471 | } | |
3472 | ||
6fc823b1 JB |
3473 | /* |
3474 | * Try to preallocate enough space based on how big the block group is. | |
3475 | * Keep in mind this has to include any pinned space which could end up | |
3476 | * taking up quite a bit since it's not folded into the other space | |
3477 | * cache. | |
3478 | */ | |
ee22184b | 3479 | num_pages = div_u64(block_group->key.offset, SZ_256M); |
0af3d00b JB |
3480 | if (!num_pages) |
3481 | num_pages = 1; | |
3482 | ||
0af3d00b | 3483 | num_pages *= 16; |
09cbfeaf | 3484 | num_pages *= PAGE_SIZE; |
0af3d00b | 3485 | |
7cf5b976 | 3486 | ret = btrfs_check_data_free_space(inode, 0, num_pages); |
0af3d00b JB |
3487 | if (ret) |
3488 | goto out_put; | |
3489 | ||
3490 | ret = btrfs_prealloc_file_range_trans(inode, trans, 0, 0, num_pages, | |
3491 | num_pages, num_pages, | |
3492 | &alloc_hint); | |
2968b1f4 JB |
3493 | /* |
3494 | * Our cache requires contiguous chunks so that we don't modify a bunch | |
3495 | * of metadata or split extents when writing the cache out, which means | |
3496 | * we can enospc if we are heavily fragmented in addition to just normal | |
3497 | * out of space conditions. So if we hit this just skip setting up any | |
3498 | * other block groups for this transaction, maybe we'll unpin enough | |
3499 | * space the next time around. | |
3500 | */ | |
2b20982e JB |
3501 | if (!ret) |
3502 | dcs = BTRFS_DC_SETUP; | |
2968b1f4 JB |
3503 | else if (ret == -ENOSPC) |
3504 | set_bit(BTRFS_TRANS_CACHE_ENOSPC, &trans->transaction->flags); | |
c09544e0 | 3505 | |
0af3d00b JB |
3506 | out_put: |
3507 | iput(inode); | |
3508 | out_free: | |
b3b4aa74 | 3509 | btrfs_release_path(path); |
0af3d00b JB |
3510 | out: |
3511 | spin_lock(&block_group->lock); | |
e65cbb94 | 3512 | if (!ret && dcs == BTRFS_DC_SETUP) |
5b0e95bf | 3513 | block_group->cache_generation = trans->transid; |
2b20982e | 3514 | block_group->disk_cache_state = dcs; |
0af3d00b JB |
3515 | spin_unlock(&block_group->lock); |
3516 | ||
3517 | return ret; | |
3518 | } | |
3519 | ||
dcdf7f6d | 3520 | int btrfs_setup_space_cache(struct btrfs_trans_handle *trans, |
2ff7e61e | 3521 | struct btrfs_fs_info *fs_info) |
dcdf7f6d JB |
3522 | { |
3523 | struct btrfs_block_group_cache *cache, *tmp; | |
3524 | struct btrfs_transaction *cur_trans = trans->transaction; | |
3525 | struct btrfs_path *path; | |
3526 | ||
3527 | if (list_empty(&cur_trans->dirty_bgs) || | |
0b246afa | 3528 | !btrfs_test_opt(fs_info, SPACE_CACHE)) |
dcdf7f6d JB |
3529 | return 0; |
3530 | ||
3531 | path = btrfs_alloc_path(); | |
3532 | if (!path) | |
3533 | return -ENOMEM; | |
3534 | ||
3535 | /* Could add new block groups, use _safe just in case */ | |
3536 | list_for_each_entry_safe(cache, tmp, &cur_trans->dirty_bgs, | |
3537 | dirty_list) { | |
3538 | if (cache->disk_cache_state == BTRFS_DC_CLEAR) | |
3539 | cache_save_setup(cache, trans, path); | |
3540 | } | |
3541 | ||
3542 | btrfs_free_path(path); | |
3543 | return 0; | |
3544 | } | |
3545 | ||
1bbc621e CM |
3546 | /* |
3547 | * transaction commit does final block group cache writeback during a | |
3548 | * critical section where nothing is allowed to change the FS. This is | |
3549 | * required in order for the cache to actually match the block group, | |
3550 | * but can introduce a lot of latency into the commit. | |
3551 | * | |
3552 | * So, btrfs_start_dirty_block_groups is here to kick off block group | |
3553 | * cache IO. There's a chance we'll have to redo some of it if the | |
3554 | * block group changes again during the commit, but it greatly reduces | |
3555 | * the commit latency by getting rid of the easy block groups while | |
3556 | * we're still allowing others to join the commit. | |
3557 | */ | |
3558 | int btrfs_start_dirty_block_groups(struct btrfs_trans_handle *trans, | |
2ff7e61e | 3559 | struct btrfs_fs_info *fs_info) |
9078a3e1 | 3560 | { |
4a8c9a62 | 3561 | struct btrfs_block_group_cache *cache; |
ce93ec54 JB |
3562 | struct btrfs_transaction *cur_trans = trans->transaction; |
3563 | int ret = 0; | |
c9dc4c65 | 3564 | int should_put; |
1bbc621e CM |
3565 | struct btrfs_path *path = NULL; |
3566 | LIST_HEAD(dirty); | |
3567 | struct list_head *io = &cur_trans->io_bgs; | |
c9dc4c65 | 3568 | int num_started = 0; |
1bbc621e CM |
3569 | int loops = 0; |
3570 | ||
3571 | spin_lock(&cur_trans->dirty_bgs_lock); | |
b58d1a9e FM |
3572 | if (list_empty(&cur_trans->dirty_bgs)) { |
3573 | spin_unlock(&cur_trans->dirty_bgs_lock); | |
3574 | return 0; | |
1bbc621e | 3575 | } |
b58d1a9e | 3576 | list_splice_init(&cur_trans->dirty_bgs, &dirty); |
1bbc621e | 3577 | spin_unlock(&cur_trans->dirty_bgs_lock); |
ce93ec54 | 3578 | |
1bbc621e | 3579 | again: |
1bbc621e CM |
3580 | /* |
3581 | * make sure all the block groups on our dirty list actually | |
3582 | * exist | |
3583 | */ | |
2ff7e61e | 3584 | btrfs_create_pending_block_groups(trans, fs_info); |
1bbc621e CM |
3585 | |
3586 | if (!path) { | |
3587 | path = btrfs_alloc_path(); | |
3588 | if (!path) | |
3589 | return -ENOMEM; | |
3590 | } | |
3591 | ||
b58d1a9e FM |
3592 | /* |
3593 | * cache_write_mutex is here only to save us from balance or automatic | |
3594 | * removal of empty block groups deleting this block group while we are | |
3595 | * writing out the cache | |
3596 | */ | |
3597 | mutex_lock(&trans->transaction->cache_write_mutex); | |
1bbc621e CM |
3598 | while (!list_empty(&dirty)) { |
3599 | cache = list_first_entry(&dirty, | |
3600 | struct btrfs_block_group_cache, | |
3601 | dirty_list); | |
1bbc621e CM |
3602 | /* |
3603 | * this can happen if something re-dirties a block | |
3604 | * group that is already under IO. Just wait for it to | |
3605 | * finish and then do it all again | |
3606 | */ | |
3607 | if (!list_empty(&cache->io_list)) { | |
3608 | list_del_init(&cache->io_list); | |
afdb5718 | 3609 | btrfs_wait_cache_io(trans, cache, path); |
1bbc621e CM |
3610 | btrfs_put_block_group(cache); |
3611 | } | |
3612 | ||
3613 | ||
3614 | /* | |
3615 | * btrfs_wait_cache_io uses the cache->dirty_list to decide | |
3616 | * if it should update the cache_state. Don't delete | |
3617 | * until after we wait. | |
3618 | * | |
3619 | * Since we're not running in the commit critical section | |
3620 | * we need the dirty_bgs_lock to protect from update_block_group | |
3621 | */ | |
3622 | spin_lock(&cur_trans->dirty_bgs_lock); | |
3623 | list_del_init(&cache->dirty_list); | |
3624 | spin_unlock(&cur_trans->dirty_bgs_lock); | |
3625 | ||
3626 | should_put = 1; | |
3627 | ||
3628 | cache_save_setup(cache, trans, path); | |
3629 | ||
3630 | if (cache->disk_cache_state == BTRFS_DC_SETUP) { | |
3631 | cache->io_ctl.inode = NULL; | |
0b246afa | 3632 | ret = btrfs_write_out_cache(fs_info, trans, |
5b4aacef | 3633 | cache, path); |
1bbc621e CM |
3634 | if (ret == 0 && cache->io_ctl.inode) { |
3635 | num_started++; | |
3636 | should_put = 0; | |
3637 | ||
3638 | /* | |
3639 | * the cache_write_mutex is protecting | |
3640 | * the io_list | |
3641 | */ | |
3642 | list_add_tail(&cache->io_list, io); | |
3643 | } else { | |
3644 | /* | |
3645 | * if we failed to write the cache, the | |
3646 | * generation will be bad and life goes on | |
3647 | */ | |
3648 | ret = 0; | |
3649 | } | |
3650 | } | |
ff1f8250 | 3651 | if (!ret) { |
2ff7e61e JM |
3652 | ret = write_one_cache_group(trans, fs_info, |
3653 | path, cache); | |
ff1f8250 FM |
3654 | /* |
3655 | * Our block group might still be attached to the list | |
3656 | * of new block groups in the transaction handle of some | |
3657 | * other task (struct btrfs_trans_handle->new_bgs). This | |
3658 | * means its block group item isn't yet in the extent | |
3659 | * tree. If this happens ignore the error, as we will | |
3660 | * try again later in the critical section of the | |
3661 | * transaction commit. | |
3662 | */ | |
3663 | if (ret == -ENOENT) { | |
3664 | ret = 0; | |
3665 | spin_lock(&cur_trans->dirty_bgs_lock); | |
3666 | if (list_empty(&cache->dirty_list)) { | |
3667 | list_add_tail(&cache->dirty_list, | |
3668 | &cur_trans->dirty_bgs); | |
3669 | btrfs_get_block_group(cache); | |
3670 | } | |
3671 | spin_unlock(&cur_trans->dirty_bgs_lock); | |
3672 | } else if (ret) { | |
66642832 | 3673 | btrfs_abort_transaction(trans, ret); |
ff1f8250 FM |
3674 | } |
3675 | } | |
1bbc621e CM |
3676 | |
3677 | /* if its not on the io list, we need to put the block group */ | |
3678 | if (should_put) | |
3679 | btrfs_put_block_group(cache); | |
3680 | ||
3681 | if (ret) | |
3682 | break; | |
b58d1a9e FM |
3683 | |
3684 | /* | |
3685 | * Avoid blocking other tasks for too long. It might even save | |
3686 | * us from writing caches for block groups that are going to be | |
3687 | * removed. | |
3688 | */ | |
3689 | mutex_unlock(&trans->transaction->cache_write_mutex); | |
3690 | mutex_lock(&trans->transaction->cache_write_mutex); | |
1bbc621e | 3691 | } |
b58d1a9e | 3692 | mutex_unlock(&trans->transaction->cache_write_mutex); |
1bbc621e CM |
3693 | |
3694 | /* | |
3695 | * go through delayed refs for all the stuff we've just kicked off | |
3696 | * and then loop back (just once) | |
3697 | */ | |
2ff7e61e | 3698 | ret = btrfs_run_delayed_refs(trans, fs_info, 0); |
1bbc621e CM |
3699 | if (!ret && loops == 0) { |
3700 | loops++; | |
3701 | spin_lock(&cur_trans->dirty_bgs_lock); | |
3702 | list_splice_init(&cur_trans->dirty_bgs, &dirty); | |
b58d1a9e FM |
3703 | /* |
3704 | * dirty_bgs_lock protects us from concurrent block group | |
3705 | * deletes too (not just cache_write_mutex). | |
3706 | */ | |
3707 | if (!list_empty(&dirty)) { | |
3708 | spin_unlock(&cur_trans->dirty_bgs_lock); | |
3709 | goto again; | |
3710 | } | |
1bbc621e | 3711 | spin_unlock(&cur_trans->dirty_bgs_lock); |
c79a1751 | 3712 | } else if (ret < 0) { |
2ff7e61e | 3713 | btrfs_cleanup_dirty_bgs(cur_trans, fs_info); |
1bbc621e CM |
3714 | } |
3715 | ||
3716 | btrfs_free_path(path); | |
3717 | return ret; | |
3718 | } | |
3719 | ||
3720 | int btrfs_write_dirty_block_groups(struct btrfs_trans_handle *trans, | |
2ff7e61e | 3721 | struct btrfs_fs_info *fs_info) |
1bbc621e CM |
3722 | { |
3723 | struct btrfs_block_group_cache *cache; | |
3724 | struct btrfs_transaction *cur_trans = trans->transaction; | |
3725 | int ret = 0; | |
3726 | int should_put; | |
3727 | struct btrfs_path *path; | |
3728 | struct list_head *io = &cur_trans->io_bgs; | |
3729 | int num_started = 0; | |
9078a3e1 CM |
3730 | |
3731 | path = btrfs_alloc_path(); | |
3732 | if (!path) | |
3733 | return -ENOMEM; | |
3734 | ||
ce93ec54 | 3735 | /* |
e44081ef FM |
3736 | * Even though we are in the critical section of the transaction commit, |
3737 | * we can still have concurrent tasks adding elements to this | |
3738 | * transaction's list of dirty block groups. These tasks correspond to | |
3739 | * endio free space workers started when writeback finishes for a | |
3740 | * space cache, which run inode.c:btrfs_finish_ordered_io(), and can | |
3741 | * allocate new block groups as a result of COWing nodes of the root | |
3742 | * tree when updating the free space inode. The writeback for the space | |
3743 | * caches is triggered by an earlier call to | |
3744 | * btrfs_start_dirty_block_groups() and iterations of the following | |
3745 | * loop. | |
3746 | * Also we want to do the cache_save_setup first and then run the | |
ce93ec54 JB |
3747 | * delayed refs to make sure we have the best chance at doing this all |
3748 | * in one shot. | |
3749 | */ | |
e44081ef | 3750 | spin_lock(&cur_trans->dirty_bgs_lock); |
ce93ec54 JB |
3751 | while (!list_empty(&cur_trans->dirty_bgs)) { |
3752 | cache = list_first_entry(&cur_trans->dirty_bgs, | |
3753 | struct btrfs_block_group_cache, | |
3754 | dirty_list); | |
c9dc4c65 CM |
3755 | |
3756 | /* | |
3757 | * this can happen if cache_save_setup re-dirties a block | |
3758 | * group that is already under IO. Just wait for it to | |
3759 | * finish and then do it all again | |
3760 | */ | |
3761 | if (!list_empty(&cache->io_list)) { | |
e44081ef | 3762 | spin_unlock(&cur_trans->dirty_bgs_lock); |
c9dc4c65 | 3763 | list_del_init(&cache->io_list); |
afdb5718 | 3764 | btrfs_wait_cache_io(trans, cache, path); |
c9dc4c65 | 3765 | btrfs_put_block_group(cache); |
e44081ef | 3766 | spin_lock(&cur_trans->dirty_bgs_lock); |
c9dc4c65 CM |
3767 | } |
3768 | ||
1bbc621e CM |
3769 | /* |
3770 | * don't remove from the dirty list until after we've waited | |
3771 | * on any pending IO | |
3772 | */ | |
ce93ec54 | 3773 | list_del_init(&cache->dirty_list); |
e44081ef | 3774 | spin_unlock(&cur_trans->dirty_bgs_lock); |
c9dc4c65 CM |
3775 | should_put = 1; |
3776 | ||
1bbc621e | 3777 | cache_save_setup(cache, trans, path); |
c9dc4c65 | 3778 | |
ce93ec54 | 3779 | if (!ret) |
2ff7e61e JM |
3780 | ret = btrfs_run_delayed_refs(trans, fs_info, |
3781 | (unsigned long) -1); | |
c9dc4c65 CM |
3782 | |
3783 | if (!ret && cache->disk_cache_state == BTRFS_DC_SETUP) { | |
3784 | cache->io_ctl.inode = NULL; | |
0b246afa | 3785 | ret = btrfs_write_out_cache(fs_info, trans, |
5b4aacef | 3786 | cache, path); |
c9dc4c65 CM |
3787 | if (ret == 0 && cache->io_ctl.inode) { |
3788 | num_started++; | |
3789 | should_put = 0; | |
1bbc621e | 3790 | list_add_tail(&cache->io_list, io); |
c9dc4c65 CM |
3791 | } else { |
3792 | /* | |
3793 | * if we failed to write the cache, the | |
3794 | * generation will be bad and life goes on | |
3795 | */ | |
3796 | ret = 0; | |
3797 | } | |
3798 | } | |
ff1f8250 | 3799 | if (!ret) { |
2ff7e61e JM |
3800 | ret = write_one_cache_group(trans, fs_info, |
3801 | path, cache); | |
2bc0bb5f FM |
3802 | /* |
3803 | * One of the free space endio workers might have | |
3804 | * created a new block group while updating a free space | |
3805 | * cache's inode (at inode.c:btrfs_finish_ordered_io()) | |
3806 | * and hasn't released its transaction handle yet, in | |
3807 | * which case the new block group is still attached to | |
3808 | * its transaction handle and its creation has not | |
3809 | * finished yet (no block group item in the extent tree | |
3810 | * yet, etc). If this is the case, wait for all free | |
3811 | * space endio workers to finish and retry. This is a | |
3812 | * a very rare case so no need for a more efficient and | |
3813 | * complex approach. | |
3814 | */ | |
3815 | if (ret == -ENOENT) { | |
3816 | wait_event(cur_trans->writer_wait, | |
3817 | atomic_read(&cur_trans->num_writers) == 1); | |
2ff7e61e JM |
3818 | ret = write_one_cache_group(trans, fs_info, |
3819 | path, cache); | |
2bc0bb5f | 3820 | } |
ff1f8250 | 3821 | if (ret) |
66642832 | 3822 | btrfs_abort_transaction(trans, ret); |
ff1f8250 | 3823 | } |
c9dc4c65 CM |
3824 | |
3825 | /* if its not on the io list, we need to put the block group */ | |
3826 | if (should_put) | |
3827 | btrfs_put_block_group(cache); | |
e44081ef | 3828 | spin_lock(&cur_trans->dirty_bgs_lock); |
c9dc4c65 | 3829 | } |
e44081ef | 3830 | spin_unlock(&cur_trans->dirty_bgs_lock); |
c9dc4c65 | 3831 | |
1bbc621e CM |
3832 | while (!list_empty(io)) { |
3833 | cache = list_first_entry(io, struct btrfs_block_group_cache, | |
c9dc4c65 CM |
3834 | io_list); |
3835 | list_del_init(&cache->io_list); | |
afdb5718 | 3836 | btrfs_wait_cache_io(trans, cache, path); |
0cb59c99 JB |
3837 | btrfs_put_block_group(cache); |
3838 | } | |
3839 | ||
9078a3e1 | 3840 | btrfs_free_path(path); |
ce93ec54 | 3841 | return ret; |
9078a3e1 CM |
3842 | } |
3843 | ||
2ff7e61e | 3844 | int btrfs_extent_readonly(struct btrfs_fs_info *fs_info, u64 bytenr) |
d2fb3437 YZ |
3845 | { |
3846 | struct btrfs_block_group_cache *block_group; | |
3847 | int readonly = 0; | |
3848 | ||
0b246afa | 3849 | block_group = btrfs_lookup_block_group(fs_info, bytenr); |
d2fb3437 YZ |
3850 | if (!block_group || block_group->ro) |
3851 | readonly = 1; | |
3852 | if (block_group) | |
fa9c0d79 | 3853 | btrfs_put_block_group(block_group); |
d2fb3437 YZ |
3854 | return readonly; |
3855 | } | |
3856 | ||
f78c436c FM |
3857 | bool btrfs_inc_nocow_writers(struct btrfs_fs_info *fs_info, u64 bytenr) |
3858 | { | |
3859 | struct btrfs_block_group_cache *bg; | |
3860 | bool ret = true; | |
3861 | ||
3862 | bg = btrfs_lookup_block_group(fs_info, bytenr); | |
3863 | if (!bg) | |
3864 | return false; | |
3865 | ||
3866 | spin_lock(&bg->lock); | |
3867 | if (bg->ro) | |
3868 | ret = false; | |
3869 | else | |
3870 | atomic_inc(&bg->nocow_writers); | |
3871 | spin_unlock(&bg->lock); | |
3872 | ||
3873 | /* no put on block group, done by btrfs_dec_nocow_writers */ | |
3874 | if (!ret) | |
3875 | btrfs_put_block_group(bg); | |
3876 | ||
3877 | return ret; | |
3878 | ||
3879 | } | |
3880 | ||
3881 | void btrfs_dec_nocow_writers(struct btrfs_fs_info *fs_info, u64 bytenr) | |
3882 | { | |
3883 | struct btrfs_block_group_cache *bg; | |
3884 | ||
3885 | bg = btrfs_lookup_block_group(fs_info, bytenr); | |
3886 | ASSERT(bg); | |
3887 | if (atomic_dec_and_test(&bg->nocow_writers)) | |
3888 | wake_up_atomic_t(&bg->nocow_writers); | |
3889 | /* | |
3890 | * Once for our lookup and once for the lookup done by a previous call | |
3891 | * to btrfs_inc_nocow_writers() | |
3892 | */ | |
3893 | btrfs_put_block_group(bg); | |
3894 | btrfs_put_block_group(bg); | |
3895 | } | |
3896 | ||
3897 | static int btrfs_wait_nocow_writers_atomic_t(atomic_t *a) | |
3898 | { | |
3899 | schedule(); | |
3900 | return 0; | |
3901 | } | |
3902 | ||
3903 | void btrfs_wait_nocow_writers(struct btrfs_block_group_cache *bg) | |
3904 | { | |
3905 | wait_on_atomic_t(&bg->nocow_writers, | |
3906 | btrfs_wait_nocow_writers_atomic_t, | |
3907 | TASK_UNINTERRUPTIBLE); | |
3908 | } | |
3909 | ||
6ab0a202 JM |
3910 | static const char *alloc_name(u64 flags) |
3911 | { | |
3912 | switch (flags) { | |
3913 | case BTRFS_BLOCK_GROUP_METADATA|BTRFS_BLOCK_GROUP_DATA: | |
3914 | return "mixed"; | |
3915 | case BTRFS_BLOCK_GROUP_METADATA: | |
3916 | return "metadata"; | |
3917 | case BTRFS_BLOCK_GROUP_DATA: | |
3918 | return "data"; | |
3919 | case BTRFS_BLOCK_GROUP_SYSTEM: | |
3920 | return "system"; | |
3921 | default: | |
3922 | WARN_ON(1); | |
3923 | return "invalid-combination"; | |
3924 | }; | |
3925 | } | |
3926 | ||
593060d7 CM |
3927 | static int update_space_info(struct btrfs_fs_info *info, u64 flags, |
3928 | u64 total_bytes, u64 bytes_used, | |
e40edf2d | 3929 | u64 bytes_readonly, |
593060d7 CM |
3930 | struct btrfs_space_info **space_info) |
3931 | { | |
3932 | struct btrfs_space_info *found; | |
b742bb82 YZ |
3933 | int i; |
3934 | int factor; | |
b150a4f1 | 3935 | int ret; |
b742bb82 YZ |
3936 | |
3937 | if (flags & (BTRFS_BLOCK_GROUP_DUP | BTRFS_BLOCK_GROUP_RAID1 | | |
3938 | BTRFS_BLOCK_GROUP_RAID10)) | |
3939 | factor = 2; | |
3940 | else | |
3941 | factor = 1; | |
593060d7 CM |
3942 | |
3943 | found = __find_space_info(info, flags); | |
3944 | if (found) { | |
25179201 | 3945 | spin_lock(&found->lock); |
593060d7 | 3946 | found->total_bytes += total_bytes; |
89a55897 | 3947 | found->disk_total += total_bytes * factor; |
593060d7 | 3948 | found->bytes_used += bytes_used; |
b742bb82 | 3949 | found->disk_used += bytes_used * factor; |
e40edf2d | 3950 | found->bytes_readonly += bytes_readonly; |
2e6e5183 FM |
3951 | if (total_bytes > 0) |
3952 | found->full = 0; | |
957780eb JB |
3953 | space_info_add_new_bytes(info, found, total_bytes - |
3954 | bytes_used - bytes_readonly); | |
25179201 | 3955 | spin_unlock(&found->lock); |
593060d7 CM |
3956 | *space_info = found; |
3957 | return 0; | |
3958 | } | |
c146afad | 3959 | found = kzalloc(sizeof(*found), GFP_NOFS); |
593060d7 CM |
3960 | if (!found) |
3961 | return -ENOMEM; | |
3962 | ||
908c7f19 | 3963 | ret = percpu_counter_init(&found->total_bytes_pinned, 0, GFP_KERNEL); |
b150a4f1 JB |
3964 | if (ret) { |
3965 | kfree(found); | |
3966 | return ret; | |
3967 | } | |
3968 | ||
c1895442 | 3969 | for (i = 0; i < BTRFS_NR_RAID_TYPES; i++) |
b742bb82 | 3970 | INIT_LIST_HEAD(&found->block_groups[i]); |
80eb234a | 3971 | init_rwsem(&found->groups_sem); |
0f9dd46c | 3972 | spin_lock_init(&found->lock); |
52ba6929 | 3973 | found->flags = flags & BTRFS_BLOCK_GROUP_TYPE_MASK; |
593060d7 | 3974 | found->total_bytes = total_bytes; |
89a55897 | 3975 | found->disk_total = total_bytes * factor; |
593060d7 | 3976 | found->bytes_used = bytes_used; |
b742bb82 | 3977 | found->disk_used = bytes_used * factor; |
593060d7 | 3978 | found->bytes_pinned = 0; |
e8569813 | 3979 | found->bytes_reserved = 0; |
e40edf2d | 3980 | found->bytes_readonly = bytes_readonly; |
f0486c68 | 3981 | found->bytes_may_use = 0; |
6af3e3ad | 3982 | found->full = 0; |
4f4db217 | 3983 | found->max_extent_size = 0; |
0e4f8f88 | 3984 | found->force_alloc = CHUNK_ALLOC_NO_FORCE; |
6d74119f | 3985 | found->chunk_alloc = 0; |
fdb5effd JB |
3986 | found->flush = 0; |
3987 | init_waitqueue_head(&found->wait); | |
633c0aad | 3988 | INIT_LIST_HEAD(&found->ro_bgs); |
957780eb JB |
3989 | INIT_LIST_HEAD(&found->tickets); |
3990 | INIT_LIST_HEAD(&found->priority_tickets); | |
6ab0a202 JM |
3991 | |
3992 | ret = kobject_init_and_add(&found->kobj, &space_info_ktype, | |
3993 | info->space_info_kobj, "%s", | |
3994 | alloc_name(found->flags)); | |
3995 | if (ret) { | |
3996 | kfree(found); | |
3997 | return ret; | |
3998 | } | |
3999 | ||
593060d7 | 4000 | *space_info = found; |
4184ea7f | 4001 | list_add_rcu(&found->list, &info->space_info); |
b4d7c3c9 LZ |
4002 | if (flags & BTRFS_BLOCK_GROUP_DATA) |
4003 | info->data_sinfo = found; | |
6ab0a202 JM |
4004 | |
4005 | return ret; | |
593060d7 CM |
4006 | } |
4007 | ||
8790d502 CM |
4008 | static void set_avail_alloc_bits(struct btrfs_fs_info *fs_info, u64 flags) |
4009 | { | |
899c81ea ID |
4010 | u64 extra_flags = chunk_to_extended(flags) & |
4011 | BTRFS_EXTENDED_PROFILE_MASK; | |
a46d11a8 | 4012 | |
de98ced9 | 4013 | write_seqlock(&fs_info->profiles_lock); |
a46d11a8 ID |
4014 | if (flags & BTRFS_BLOCK_GROUP_DATA) |
4015 | fs_info->avail_data_alloc_bits |= extra_flags; | |
4016 | if (flags & BTRFS_BLOCK_GROUP_METADATA) | |
4017 | fs_info->avail_metadata_alloc_bits |= extra_flags; | |
4018 | if (flags & BTRFS_BLOCK_GROUP_SYSTEM) | |
4019 | fs_info->avail_system_alloc_bits |= extra_flags; | |
de98ced9 | 4020 | write_sequnlock(&fs_info->profiles_lock); |
8790d502 | 4021 | } |
593060d7 | 4022 | |
fc67c450 ID |
4023 | /* |
4024 | * returns target flags in extended format or 0 if restripe for this | |
4025 | * chunk_type is not in progress | |
c6664b42 ID |
4026 | * |
4027 | * should be called with either volume_mutex or balance_lock held | |
fc67c450 ID |
4028 | */ |
4029 | static u64 get_restripe_target(struct btrfs_fs_info *fs_info, u64 flags) | |
4030 | { | |
4031 | struct btrfs_balance_control *bctl = fs_info->balance_ctl; | |
4032 | u64 target = 0; | |
4033 | ||
fc67c450 ID |
4034 | if (!bctl) |
4035 | return 0; | |
4036 | ||
4037 | if (flags & BTRFS_BLOCK_GROUP_DATA && | |
4038 | bctl->data.flags & BTRFS_BALANCE_ARGS_CONVERT) { | |
4039 | target = BTRFS_BLOCK_GROUP_DATA | bctl->data.target; | |
4040 | } else if (flags & BTRFS_BLOCK_GROUP_SYSTEM && | |
4041 | bctl->sys.flags & BTRFS_BALANCE_ARGS_CONVERT) { | |
4042 | target = BTRFS_BLOCK_GROUP_SYSTEM | bctl->sys.target; | |
4043 | } else if (flags & BTRFS_BLOCK_GROUP_METADATA && | |
4044 | bctl->meta.flags & BTRFS_BALANCE_ARGS_CONVERT) { | |
4045 | target = BTRFS_BLOCK_GROUP_METADATA | bctl->meta.target; | |
4046 | } | |
4047 | ||
4048 | return target; | |
4049 | } | |
4050 | ||
a46d11a8 ID |
4051 | /* |
4052 | * @flags: available profiles in extended format (see ctree.h) | |
4053 | * | |
e4d8ec0f ID |
4054 | * Returns reduced profile in chunk format. If profile changing is in |
4055 | * progress (either running or paused) picks the target profile (if it's | |
4056 | * already available), otherwise falls back to plain reducing. | |
a46d11a8 | 4057 | */ |
2ff7e61e | 4058 | static u64 btrfs_reduce_alloc_profile(struct btrfs_fs_info *fs_info, u64 flags) |
ec44a35c | 4059 | { |
0b246afa | 4060 | u64 num_devices = fs_info->fs_devices->rw_devices; |
fc67c450 | 4061 | u64 target; |
9c170b26 ZL |
4062 | u64 raid_type; |
4063 | u64 allowed = 0; | |
a061fc8d | 4064 | |
fc67c450 ID |
4065 | /* |
4066 | * see if restripe for this chunk_type is in progress, if so | |
4067 | * try to reduce to the target profile | |
4068 | */ | |
0b246afa JM |
4069 | spin_lock(&fs_info->balance_lock); |
4070 | target = get_restripe_target(fs_info, flags); | |
fc67c450 ID |
4071 | if (target) { |
4072 | /* pick target profile only if it's already available */ | |
4073 | if ((flags & target) & BTRFS_EXTENDED_PROFILE_MASK) { | |
0b246afa | 4074 | spin_unlock(&fs_info->balance_lock); |
fc67c450 | 4075 | return extended_to_chunk(target); |
e4d8ec0f ID |
4076 | } |
4077 | } | |
0b246afa | 4078 | spin_unlock(&fs_info->balance_lock); |
e4d8ec0f | 4079 | |
53b381b3 | 4080 | /* First, mask out the RAID levels which aren't possible */ |
9c170b26 ZL |
4081 | for (raid_type = 0; raid_type < BTRFS_NR_RAID_TYPES; raid_type++) { |
4082 | if (num_devices >= btrfs_raid_array[raid_type].devs_min) | |
4083 | allowed |= btrfs_raid_group[raid_type]; | |
4084 | } | |
4085 | allowed &= flags; | |
4086 | ||
4087 | if (allowed & BTRFS_BLOCK_GROUP_RAID6) | |
4088 | allowed = BTRFS_BLOCK_GROUP_RAID6; | |
4089 | else if (allowed & BTRFS_BLOCK_GROUP_RAID5) | |
4090 | allowed = BTRFS_BLOCK_GROUP_RAID5; | |
4091 | else if (allowed & BTRFS_BLOCK_GROUP_RAID10) | |
4092 | allowed = BTRFS_BLOCK_GROUP_RAID10; | |
4093 | else if (allowed & BTRFS_BLOCK_GROUP_RAID1) | |
4094 | allowed = BTRFS_BLOCK_GROUP_RAID1; | |
4095 | else if (allowed & BTRFS_BLOCK_GROUP_RAID0) | |
4096 | allowed = BTRFS_BLOCK_GROUP_RAID0; | |
4097 | ||
4098 | flags &= ~BTRFS_BLOCK_GROUP_PROFILE_MASK; | |
4099 | ||
4100 | return extended_to_chunk(flags | allowed); | |
ec44a35c CM |
4101 | } |
4102 | ||
2ff7e61e | 4103 | static u64 get_alloc_profile(struct btrfs_fs_info *fs_info, u64 orig_flags) |
6a63209f | 4104 | { |
de98ced9 | 4105 | unsigned seq; |
f8213bdc | 4106 | u64 flags; |
de98ced9 MX |
4107 | |
4108 | do { | |
f8213bdc | 4109 | flags = orig_flags; |
0b246afa | 4110 | seq = read_seqbegin(&fs_info->profiles_lock); |
de98ced9 MX |
4111 | |
4112 | if (flags & BTRFS_BLOCK_GROUP_DATA) | |
0b246afa | 4113 | flags |= fs_info->avail_data_alloc_bits; |
de98ced9 | 4114 | else if (flags & BTRFS_BLOCK_GROUP_SYSTEM) |
0b246afa | 4115 | flags |= fs_info->avail_system_alloc_bits; |
de98ced9 | 4116 | else if (flags & BTRFS_BLOCK_GROUP_METADATA) |
0b246afa JM |
4117 | flags |= fs_info->avail_metadata_alloc_bits; |
4118 | } while (read_seqretry(&fs_info->profiles_lock, seq)); | |
6fef8df1 | 4119 | |
2ff7e61e | 4120 | return btrfs_reduce_alloc_profile(fs_info, flags); |
6a63209f JB |
4121 | } |
4122 | ||
6d07bcec | 4123 | u64 btrfs_get_alloc_profile(struct btrfs_root *root, int data) |
9ed74f2d | 4124 | { |
0b246afa | 4125 | struct btrfs_fs_info *fs_info = root->fs_info; |
b742bb82 | 4126 | u64 flags; |
53b381b3 | 4127 | u64 ret; |
9ed74f2d | 4128 | |
b742bb82 YZ |
4129 | if (data) |
4130 | flags = BTRFS_BLOCK_GROUP_DATA; | |
0b246afa | 4131 | else if (root == fs_info->chunk_root) |
b742bb82 | 4132 | flags = BTRFS_BLOCK_GROUP_SYSTEM; |
9ed74f2d | 4133 | else |
b742bb82 | 4134 | flags = BTRFS_BLOCK_GROUP_METADATA; |
9ed74f2d | 4135 | |
2ff7e61e | 4136 | ret = get_alloc_profile(fs_info, flags); |
53b381b3 | 4137 | return ret; |
6a63209f | 4138 | } |
9ed74f2d | 4139 | |
4136135b LB |
4140 | static u64 btrfs_space_info_used(struct btrfs_space_info *s_info, |
4141 | bool may_use_included) | |
4142 | { | |
4143 | ASSERT(s_info); | |
4144 | return s_info->bytes_used + s_info->bytes_reserved + | |
4145 | s_info->bytes_pinned + s_info->bytes_readonly + | |
4146 | (may_use_included ? s_info->bytes_may_use : 0); | |
4147 | } | |
4148 | ||
04f4f916 | 4149 | int btrfs_alloc_data_chunk_ondemand(struct btrfs_inode *inode, u64 bytes) |
6a63209f | 4150 | { |
6a63209f | 4151 | struct btrfs_space_info *data_sinfo; |
04f4f916 | 4152 | struct btrfs_root *root = inode->root; |
b4d7c3c9 | 4153 | struct btrfs_fs_info *fs_info = root->fs_info; |
ab6e2410 | 4154 | u64 used; |
94b947b2 | 4155 | int ret = 0; |
c99f1b0c ZL |
4156 | int need_commit = 2; |
4157 | int have_pinned_space; | |
6a63209f | 4158 | |
6a63209f | 4159 | /* make sure bytes are sectorsize aligned */ |
0b246afa | 4160 | bytes = ALIGN(bytes, fs_info->sectorsize); |
6a63209f | 4161 | |
9dced186 | 4162 | if (btrfs_is_free_space_inode(inode)) { |
c99f1b0c | 4163 | need_commit = 0; |
9dced186 | 4164 | ASSERT(current->journal_info); |
0af3d00b JB |
4165 | } |
4166 | ||
b4d7c3c9 | 4167 | data_sinfo = fs_info->data_sinfo; |
33b4d47f CM |
4168 | if (!data_sinfo) |
4169 | goto alloc; | |
9ed74f2d | 4170 | |
6a63209f JB |
4171 | again: |
4172 | /* make sure we have enough space to handle the data first */ | |
4173 | spin_lock(&data_sinfo->lock); | |
4136135b | 4174 | used = btrfs_space_info_used(data_sinfo, true); |
ab6e2410 JB |
4175 | |
4176 | if (used + bytes > data_sinfo->total_bytes) { | |
4e06bdd6 | 4177 | struct btrfs_trans_handle *trans; |
9ed74f2d | 4178 | |
6a63209f JB |
4179 | /* |
4180 | * if we don't have enough free bytes in this space then we need | |
4181 | * to alloc a new chunk. | |
4182 | */ | |
b9fd47cd | 4183 | if (!data_sinfo->full) { |
6a63209f | 4184 | u64 alloc_target; |
9ed74f2d | 4185 | |
0e4f8f88 | 4186 | data_sinfo->force_alloc = CHUNK_ALLOC_FORCE; |
6a63209f | 4187 | spin_unlock(&data_sinfo->lock); |
33b4d47f | 4188 | alloc: |
6a63209f | 4189 | alloc_target = btrfs_get_alloc_profile(root, 1); |
9dced186 MX |
4190 | /* |
4191 | * It is ugly that we don't call nolock join | |
4192 | * transaction for the free space inode case here. | |
4193 | * But it is safe because we only do the data space | |
4194 | * reservation for the free space cache in the | |
4195 | * transaction context, the common join transaction | |
4196 | * just increase the counter of the current transaction | |
4197 | * handler, doesn't try to acquire the trans_lock of | |
4198 | * the fs. | |
4199 | */ | |
7a7eaa40 | 4200 | trans = btrfs_join_transaction(root); |
a22285a6 YZ |
4201 | if (IS_ERR(trans)) |
4202 | return PTR_ERR(trans); | |
9ed74f2d | 4203 | |
2ff7e61e | 4204 | ret = do_chunk_alloc(trans, fs_info, alloc_target, |
0e4f8f88 | 4205 | CHUNK_ALLOC_NO_FORCE); |
3a45bb20 | 4206 | btrfs_end_transaction(trans); |
d52a5b5f MX |
4207 | if (ret < 0) { |
4208 | if (ret != -ENOSPC) | |
4209 | return ret; | |
c99f1b0c ZL |
4210 | else { |
4211 | have_pinned_space = 1; | |
d52a5b5f | 4212 | goto commit_trans; |
c99f1b0c | 4213 | } |
d52a5b5f | 4214 | } |
9ed74f2d | 4215 | |
b4d7c3c9 LZ |
4216 | if (!data_sinfo) |
4217 | data_sinfo = fs_info->data_sinfo; | |
4218 | ||
6a63209f JB |
4219 | goto again; |
4220 | } | |
f2bb8f5c JB |
4221 | |
4222 | /* | |
b150a4f1 | 4223 | * If we don't have enough pinned space to deal with this |
94b947b2 ZL |
4224 | * allocation, and no removed chunk in current transaction, |
4225 | * don't bother committing the transaction. | |
f2bb8f5c | 4226 | */ |
c99f1b0c ZL |
4227 | have_pinned_space = percpu_counter_compare( |
4228 | &data_sinfo->total_bytes_pinned, | |
4229 | used + bytes - data_sinfo->total_bytes); | |
6a63209f | 4230 | spin_unlock(&data_sinfo->lock); |
6a63209f | 4231 | |
4e06bdd6 | 4232 | /* commit the current transaction and try again */ |
d52a5b5f | 4233 | commit_trans: |
c99f1b0c | 4234 | if (need_commit && |
0b246afa | 4235 | !atomic_read(&fs_info->open_ioctl_trans)) { |
c99f1b0c | 4236 | need_commit--; |
b150a4f1 | 4237 | |
e1746e83 ZL |
4238 | if (need_commit > 0) { |
4239 | btrfs_start_delalloc_roots(fs_info, 0, -1); | |
0b246afa JM |
4240 | btrfs_wait_ordered_roots(fs_info, -1, 0, |
4241 | (u64)-1); | |
e1746e83 | 4242 | } |
9a4e7276 | 4243 | |
7a7eaa40 | 4244 | trans = btrfs_join_transaction(root); |
a22285a6 YZ |
4245 | if (IS_ERR(trans)) |
4246 | return PTR_ERR(trans); | |
c99f1b0c | 4247 | if (have_pinned_space >= 0 || |
3204d33c JB |
4248 | test_bit(BTRFS_TRANS_HAVE_FREE_BGS, |
4249 | &trans->transaction->flags) || | |
c99f1b0c | 4250 | need_commit > 0) { |
3a45bb20 | 4251 | ret = btrfs_commit_transaction(trans); |
94b947b2 ZL |
4252 | if (ret) |
4253 | return ret; | |
d7c15171 | 4254 | /* |
c2d6cb16 FM |
4255 | * The cleaner kthread might still be doing iput |
4256 | * operations. Wait for it to finish so that | |
4257 | * more space is released. | |
d7c15171 | 4258 | */ |
0b246afa JM |
4259 | mutex_lock(&fs_info->cleaner_delayed_iput_mutex); |
4260 | mutex_unlock(&fs_info->cleaner_delayed_iput_mutex); | |
94b947b2 ZL |
4261 | goto again; |
4262 | } else { | |
3a45bb20 | 4263 | btrfs_end_transaction(trans); |
94b947b2 | 4264 | } |
4e06bdd6 | 4265 | } |
9ed74f2d | 4266 | |
0b246afa | 4267 | trace_btrfs_space_reservation(fs_info, |
cab45e22 JM |
4268 | "space_info:enospc", |
4269 | data_sinfo->flags, bytes, 1); | |
6a63209f JB |
4270 | return -ENOSPC; |
4271 | } | |
4272 | data_sinfo->bytes_may_use += bytes; | |
0b246afa | 4273 | trace_btrfs_space_reservation(fs_info, "space_info", |
2bcc0328 | 4274 | data_sinfo->flags, bytes, 1); |
6a63209f | 4275 | spin_unlock(&data_sinfo->lock); |
6a63209f | 4276 | |
237c0e9f | 4277 | return ret; |
9ed74f2d | 4278 | } |
6a63209f | 4279 | |
4ceff079 QW |
4280 | /* |
4281 | * New check_data_free_space() with ability for precious data reservation | |
4282 | * Will replace old btrfs_check_data_free_space(), but for patch split, | |
4283 | * add a new function first and then replace it. | |
4284 | */ | |
7cf5b976 | 4285 | int btrfs_check_data_free_space(struct inode *inode, u64 start, u64 len) |
4ceff079 | 4286 | { |
0b246afa | 4287 | struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); |
4ceff079 QW |
4288 | int ret; |
4289 | ||
4290 | /* align the range */ | |
0b246afa JM |
4291 | len = round_up(start + len, fs_info->sectorsize) - |
4292 | round_down(start, fs_info->sectorsize); | |
4293 | start = round_down(start, fs_info->sectorsize); | |
4ceff079 | 4294 | |
04f4f916 | 4295 | ret = btrfs_alloc_data_chunk_ondemand(BTRFS_I(inode), len); |
4ceff079 QW |
4296 | if (ret < 0) |
4297 | return ret; | |
4298 | ||
1e5ec2e7 | 4299 | /* Use new btrfs_qgroup_reserve_data to reserve precious data space. */ |
4ceff079 | 4300 | ret = btrfs_qgroup_reserve_data(inode, start, len); |
1e5ec2e7 JB |
4301 | if (ret) |
4302 | btrfs_free_reserved_data_space_noquota(inode, start, len); | |
4ceff079 QW |
4303 | return ret; |
4304 | } | |
4305 | ||
4ceff079 QW |
4306 | /* |
4307 | * Called if we need to clear a data reservation for this inode | |
4308 | * Normally in a error case. | |
4309 | * | |
51773bec QW |
4310 | * This one will *NOT* use accurate qgroup reserved space API, just for case |
4311 | * which we can't sleep and is sure it won't affect qgroup reserved space. | |
4312 | * Like clear_bit_hook(). | |
4ceff079 | 4313 | */ |
51773bec QW |
4314 | void btrfs_free_reserved_data_space_noquota(struct inode *inode, u64 start, |
4315 | u64 len) | |
4ceff079 | 4316 | { |
0b246afa | 4317 | struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); |
4ceff079 QW |
4318 | struct btrfs_space_info *data_sinfo; |
4319 | ||
4320 | /* Make sure the range is aligned to sectorsize */ | |
0b246afa JM |
4321 | len = round_up(start + len, fs_info->sectorsize) - |
4322 | round_down(start, fs_info->sectorsize); | |
4323 | start = round_down(start, fs_info->sectorsize); | |
4ceff079 | 4324 | |
0b246afa | 4325 | data_sinfo = fs_info->data_sinfo; |
4ceff079 QW |
4326 | spin_lock(&data_sinfo->lock); |
4327 | if (WARN_ON(data_sinfo->bytes_may_use < len)) | |
4328 | data_sinfo->bytes_may_use = 0; | |
4329 | else | |
4330 | data_sinfo->bytes_may_use -= len; | |
0b246afa | 4331 | trace_btrfs_space_reservation(fs_info, "space_info", |
4ceff079 QW |
4332 | data_sinfo->flags, len, 0); |
4333 | spin_unlock(&data_sinfo->lock); | |
4334 | } | |
4335 | ||
51773bec QW |
4336 | /* |
4337 | * Called if we need to clear a data reservation for this inode | |
4338 | * Normally in a error case. | |
4339 | * | |
01327610 | 4340 | * This one will handle the per-inode data rsv map for accurate reserved |
51773bec QW |
4341 | * space framework. |
4342 | */ | |
4343 | void btrfs_free_reserved_data_space(struct inode *inode, u64 start, u64 len) | |
4344 | { | |
0c476a5d JM |
4345 | struct btrfs_root *root = BTRFS_I(inode)->root; |
4346 | ||
4347 | /* Make sure the range is aligned to sectorsize */ | |
da17066c JM |
4348 | len = round_up(start + len, root->fs_info->sectorsize) - |
4349 | round_down(start, root->fs_info->sectorsize); | |
4350 | start = round_down(start, root->fs_info->sectorsize); | |
0c476a5d | 4351 | |
51773bec QW |
4352 | btrfs_free_reserved_data_space_noquota(inode, start, len); |
4353 | btrfs_qgroup_free_data(inode, start, len); | |
4354 | } | |
4355 | ||
97e728d4 | 4356 | static void force_metadata_allocation(struct btrfs_fs_info *info) |
e3ccfa98 | 4357 | { |
97e728d4 JB |
4358 | struct list_head *head = &info->space_info; |
4359 | struct btrfs_space_info *found; | |
e3ccfa98 | 4360 | |
97e728d4 JB |
4361 | rcu_read_lock(); |
4362 | list_for_each_entry_rcu(found, head, list) { | |
4363 | if (found->flags & BTRFS_BLOCK_GROUP_METADATA) | |
0e4f8f88 | 4364 | found->force_alloc = CHUNK_ALLOC_FORCE; |
e3ccfa98 | 4365 | } |
97e728d4 | 4366 | rcu_read_unlock(); |
e3ccfa98 JB |
4367 | } |
4368 | ||
3c76cd84 MX |
4369 | static inline u64 calc_global_rsv_need_space(struct btrfs_block_rsv *global) |
4370 | { | |
4371 | return (global->size << 1); | |
4372 | } | |
4373 | ||
2ff7e61e | 4374 | static int should_alloc_chunk(struct btrfs_fs_info *fs_info, |
698d0082 | 4375 | struct btrfs_space_info *sinfo, int force) |
32c00aff | 4376 | { |
0b246afa | 4377 | struct btrfs_block_rsv *global_rsv = &fs_info->global_block_rsv; |
424499db | 4378 | u64 num_bytes = sinfo->total_bytes - sinfo->bytes_readonly; |
0e4f8f88 | 4379 | u64 num_allocated = sinfo->bytes_used + sinfo->bytes_reserved; |
e5bc2458 | 4380 | u64 thresh; |
e3ccfa98 | 4381 | |
0e4f8f88 CM |
4382 | if (force == CHUNK_ALLOC_FORCE) |
4383 | return 1; | |
4384 | ||
fb25e914 JB |
4385 | /* |
4386 | * We need to take into account the global rsv because for all intents | |
4387 | * and purposes it's used space. Don't worry about locking the | |
4388 | * global_rsv, it doesn't change except when the transaction commits. | |
4389 | */ | |
54338b5c | 4390 | if (sinfo->flags & BTRFS_BLOCK_GROUP_METADATA) |
3c76cd84 | 4391 | num_allocated += calc_global_rsv_need_space(global_rsv); |
fb25e914 | 4392 | |
0e4f8f88 CM |
4393 | /* |
4394 | * in limited mode, we want to have some free space up to | |
4395 | * about 1% of the FS size. | |
4396 | */ | |
4397 | if (force == CHUNK_ALLOC_LIMITED) { | |
0b246afa | 4398 | thresh = btrfs_super_total_bytes(fs_info->super_copy); |
ee22184b | 4399 | thresh = max_t(u64, SZ_64M, div_factor_fine(thresh, 1)); |
0e4f8f88 CM |
4400 | |
4401 | if (num_bytes - num_allocated < thresh) | |
4402 | return 1; | |
4403 | } | |
0e4f8f88 | 4404 | |
ee22184b | 4405 | if (num_allocated + SZ_2M < div_factor(num_bytes, 8)) |
14ed0ca6 | 4406 | return 0; |
424499db | 4407 | return 1; |
32c00aff JB |
4408 | } |
4409 | ||
2ff7e61e | 4410 | static u64 get_profile_num_devs(struct btrfs_fs_info *fs_info, u64 type) |
15d1ff81 LB |
4411 | { |
4412 | u64 num_dev; | |
4413 | ||
53b381b3 DW |
4414 | if (type & (BTRFS_BLOCK_GROUP_RAID10 | |
4415 | BTRFS_BLOCK_GROUP_RAID0 | | |
4416 | BTRFS_BLOCK_GROUP_RAID5 | | |
4417 | BTRFS_BLOCK_GROUP_RAID6)) | |
0b246afa | 4418 | num_dev = fs_info->fs_devices->rw_devices; |
15d1ff81 LB |
4419 | else if (type & BTRFS_BLOCK_GROUP_RAID1) |
4420 | num_dev = 2; | |
4421 | else | |
4422 | num_dev = 1; /* DUP or single */ | |
4423 | ||
39c2d7fa | 4424 | return num_dev; |
15d1ff81 LB |
4425 | } |
4426 | ||
39c2d7fa FM |
4427 | /* |
4428 | * If @is_allocation is true, reserve space in the system space info necessary | |
4429 | * for allocating a chunk, otherwise if it's false, reserve space necessary for | |
4430 | * removing a chunk. | |
4431 | */ | |
4432 | void check_system_chunk(struct btrfs_trans_handle *trans, | |
2ff7e61e | 4433 | struct btrfs_fs_info *fs_info, u64 type) |
15d1ff81 LB |
4434 | { |
4435 | struct btrfs_space_info *info; | |
4436 | u64 left; | |
4437 | u64 thresh; | |
4fbcdf66 | 4438 | int ret = 0; |
39c2d7fa | 4439 | u64 num_devs; |
4fbcdf66 FM |
4440 | |
4441 | /* | |
4442 | * Needed because we can end up allocating a system chunk and for an | |
4443 | * atomic and race free space reservation in the chunk block reserve. | |
4444 | */ | |
0b246afa | 4445 | ASSERT(mutex_is_locked(&fs_info->chunk_mutex)); |
15d1ff81 | 4446 | |
0b246afa | 4447 | info = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_SYSTEM); |
15d1ff81 | 4448 | spin_lock(&info->lock); |
4136135b | 4449 | left = info->total_bytes - btrfs_space_info_used(info, true); |
15d1ff81 LB |
4450 | spin_unlock(&info->lock); |
4451 | ||
2ff7e61e | 4452 | num_devs = get_profile_num_devs(fs_info, type); |
39c2d7fa FM |
4453 | |
4454 | /* num_devs device items to update and 1 chunk item to add or remove */ | |
0b246afa JM |
4455 | thresh = btrfs_calc_trunc_metadata_size(fs_info, num_devs) + |
4456 | btrfs_calc_trans_metadata_size(fs_info, 1); | |
39c2d7fa | 4457 | |
0b246afa JM |
4458 | if (left < thresh && btrfs_test_opt(fs_info, ENOSPC_DEBUG)) { |
4459 | btrfs_info(fs_info, "left=%llu, need=%llu, flags=%llu", | |
4460 | left, thresh, type); | |
4461 | dump_space_info(fs_info, info, 0, 0); | |
15d1ff81 LB |
4462 | } |
4463 | ||
4464 | if (left < thresh) { | |
4465 | u64 flags; | |
4466 | ||
0b246afa | 4467 | flags = btrfs_get_alloc_profile(fs_info->chunk_root, 0); |
4fbcdf66 FM |
4468 | /* |
4469 | * Ignore failure to create system chunk. We might end up not | |
4470 | * needing it, as we might not need to COW all nodes/leafs from | |
4471 | * the paths we visit in the chunk tree (they were already COWed | |
4472 | * or created in the current transaction for example). | |
4473 | */ | |
2ff7e61e | 4474 | ret = btrfs_alloc_chunk(trans, fs_info, flags); |
4fbcdf66 FM |
4475 | } |
4476 | ||
4477 | if (!ret) { | |
0b246afa JM |
4478 | ret = btrfs_block_rsv_add(fs_info->chunk_root, |
4479 | &fs_info->chunk_block_rsv, | |
4fbcdf66 FM |
4480 | thresh, BTRFS_RESERVE_NO_FLUSH); |
4481 | if (!ret) | |
4482 | trans->chunk_bytes_reserved += thresh; | |
15d1ff81 LB |
4483 | } |
4484 | } | |
4485 | ||
28b737f6 LB |
4486 | /* |
4487 | * If force is CHUNK_ALLOC_FORCE: | |
4488 | * - return 1 if it successfully allocates a chunk, | |
4489 | * - return errors including -ENOSPC otherwise. | |
4490 | * If force is NOT CHUNK_ALLOC_FORCE: | |
4491 | * - return 0 if it doesn't need to allocate a new chunk, | |
4492 | * - return 1 if it successfully allocates a chunk, | |
4493 | * - return errors including -ENOSPC otherwise. | |
4494 | */ | |
6324fbf3 | 4495 | static int do_chunk_alloc(struct btrfs_trans_handle *trans, |
2ff7e61e | 4496 | struct btrfs_fs_info *fs_info, u64 flags, int force) |
9ed74f2d | 4497 | { |
6324fbf3 | 4498 | struct btrfs_space_info *space_info; |
6d74119f | 4499 | int wait_for_alloc = 0; |
9ed74f2d | 4500 | int ret = 0; |
9ed74f2d | 4501 | |
c6b305a8 JB |
4502 | /* Don't re-enter if we're already allocating a chunk */ |
4503 | if (trans->allocating_chunk) | |
4504 | return -ENOSPC; | |
4505 | ||
0b246afa | 4506 | space_info = __find_space_info(fs_info, flags); |
593060d7 | 4507 | if (!space_info) { |
0b246afa | 4508 | ret = update_space_info(fs_info, flags, 0, 0, 0, &space_info); |
79787eaa | 4509 | BUG_ON(ret); /* -ENOMEM */ |
9ed74f2d | 4510 | } |
79787eaa | 4511 | BUG_ON(!space_info); /* Logic error */ |
9ed74f2d | 4512 | |
6d74119f | 4513 | again: |
25179201 | 4514 | spin_lock(&space_info->lock); |
9e622d6b | 4515 | if (force < space_info->force_alloc) |
0e4f8f88 | 4516 | force = space_info->force_alloc; |
25179201 | 4517 | if (space_info->full) { |
2ff7e61e | 4518 | if (should_alloc_chunk(fs_info, space_info, force)) |
09fb99a6 FDBM |
4519 | ret = -ENOSPC; |
4520 | else | |
4521 | ret = 0; | |
25179201 | 4522 | spin_unlock(&space_info->lock); |
09fb99a6 | 4523 | return ret; |
9ed74f2d JB |
4524 | } |
4525 | ||
2ff7e61e | 4526 | if (!should_alloc_chunk(fs_info, space_info, force)) { |
25179201 | 4527 | spin_unlock(&space_info->lock); |
6d74119f JB |
4528 | return 0; |
4529 | } else if (space_info->chunk_alloc) { | |
4530 | wait_for_alloc = 1; | |
4531 | } else { | |
4532 | space_info->chunk_alloc = 1; | |
9ed74f2d | 4533 | } |
0e4f8f88 | 4534 | |
25179201 | 4535 | spin_unlock(&space_info->lock); |
9ed74f2d | 4536 | |
6d74119f JB |
4537 | mutex_lock(&fs_info->chunk_mutex); |
4538 | ||
4539 | /* | |
4540 | * The chunk_mutex is held throughout the entirety of a chunk | |
4541 | * allocation, so once we've acquired the chunk_mutex we know that the | |
4542 | * other guy is done and we need to recheck and see if we should | |
4543 | * allocate. | |
4544 | */ | |
4545 | if (wait_for_alloc) { | |
4546 | mutex_unlock(&fs_info->chunk_mutex); | |
4547 | wait_for_alloc = 0; | |
4548 | goto again; | |
4549 | } | |
4550 | ||
c6b305a8 JB |
4551 | trans->allocating_chunk = true; |
4552 | ||
67377734 JB |
4553 | /* |
4554 | * If we have mixed data/metadata chunks we want to make sure we keep | |
4555 | * allocating mixed chunks instead of individual chunks. | |
4556 | */ | |
4557 | if (btrfs_mixed_space_info(space_info)) | |
4558 | flags |= (BTRFS_BLOCK_GROUP_DATA | BTRFS_BLOCK_GROUP_METADATA); | |
4559 | ||
97e728d4 JB |
4560 | /* |
4561 | * if we're doing a data chunk, go ahead and make sure that | |
4562 | * we keep a reasonable number of metadata chunks allocated in the | |
4563 | * FS as well. | |
4564 | */ | |
9ed74f2d | 4565 | if (flags & BTRFS_BLOCK_GROUP_DATA && fs_info->metadata_ratio) { |
97e728d4 JB |
4566 | fs_info->data_chunk_allocations++; |
4567 | if (!(fs_info->data_chunk_allocations % | |
4568 | fs_info->metadata_ratio)) | |
4569 | force_metadata_allocation(fs_info); | |
9ed74f2d JB |
4570 | } |
4571 | ||
15d1ff81 LB |
4572 | /* |
4573 | * Check if we have enough space in SYSTEM chunk because we may need | |
4574 | * to update devices. | |
4575 | */ | |
2ff7e61e | 4576 | check_system_chunk(trans, fs_info, flags); |
15d1ff81 | 4577 | |
2ff7e61e | 4578 | ret = btrfs_alloc_chunk(trans, fs_info, flags); |
c6b305a8 | 4579 | trans->allocating_chunk = false; |
92b8e897 | 4580 | |
9ed74f2d | 4581 | spin_lock(&space_info->lock); |
a81cb9a2 AO |
4582 | if (ret < 0 && ret != -ENOSPC) |
4583 | goto out; | |
9ed74f2d | 4584 | if (ret) |
6324fbf3 | 4585 | space_info->full = 1; |
424499db YZ |
4586 | else |
4587 | ret = 1; | |
6d74119f | 4588 | |
0e4f8f88 | 4589 | space_info->force_alloc = CHUNK_ALLOC_NO_FORCE; |
a81cb9a2 | 4590 | out: |
6d74119f | 4591 | space_info->chunk_alloc = 0; |
9ed74f2d | 4592 | spin_unlock(&space_info->lock); |
a25c75d5 | 4593 | mutex_unlock(&fs_info->chunk_mutex); |
00d80e34 FM |
4594 | /* |
4595 | * When we allocate a new chunk we reserve space in the chunk block | |
4596 | * reserve to make sure we can COW nodes/leafs in the chunk tree or | |
4597 | * add new nodes/leafs to it if we end up needing to do it when | |
4598 | * inserting the chunk item and updating device items as part of the | |
4599 | * second phase of chunk allocation, performed by | |
4600 | * btrfs_finish_chunk_alloc(). So make sure we don't accumulate a | |
4601 | * large number of new block groups to create in our transaction | |
4602 | * handle's new_bgs list to avoid exhausting the chunk block reserve | |
4603 | * in extreme cases - like having a single transaction create many new | |
4604 | * block groups when starting to write out the free space caches of all | |
4605 | * the block groups that were made dirty during the lifetime of the | |
4606 | * transaction. | |
4607 | */ | |
d9a0540a | 4608 | if (trans->can_flush_pending_bgs && |
ee22184b | 4609 | trans->chunk_bytes_reserved >= (u64)SZ_2M) { |
2ff7e61e | 4610 | btrfs_create_pending_block_groups(trans, fs_info); |
00d80e34 FM |
4611 | btrfs_trans_release_chunk_metadata(trans); |
4612 | } | |
0f9dd46c | 4613 | return ret; |
6324fbf3 | 4614 | } |
9ed74f2d | 4615 | |
a80c8dcf JB |
4616 | static int can_overcommit(struct btrfs_root *root, |
4617 | struct btrfs_space_info *space_info, u64 bytes, | |
08e007d2 | 4618 | enum btrfs_reserve_flush_enum flush) |
a80c8dcf | 4619 | { |
0b246afa JM |
4620 | struct btrfs_fs_info *fs_info = root->fs_info; |
4621 | struct btrfs_block_rsv *global_rsv = &fs_info->global_block_rsv; | |
957780eb | 4622 | u64 profile; |
3c76cd84 | 4623 | u64 space_size; |
a80c8dcf JB |
4624 | u64 avail; |
4625 | u64 used; | |
4626 | ||
957780eb JB |
4627 | /* Don't overcommit when in mixed mode. */ |
4628 | if (space_info->flags & BTRFS_BLOCK_GROUP_DATA) | |
4629 | return 0; | |
4630 | ||
957780eb | 4631 | profile = btrfs_get_alloc_profile(root, 0); |
4136135b | 4632 | used = btrfs_space_info_used(space_info, false); |
96f1bb57 | 4633 | |
96f1bb57 JB |
4634 | /* |
4635 | * We only want to allow over committing if we have lots of actual space | |
4636 | * free, but if we don't have enough space to handle the global reserve | |
4637 | * space then we could end up having a real enospc problem when trying | |
4638 | * to allocate a chunk or some other such important allocation. | |
4639 | */ | |
3c76cd84 MX |
4640 | spin_lock(&global_rsv->lock); |
4641 | space_size = calc_global_rsv_need_space(global_rsv); | |
4642 | spin_unlock(&global_rsv->lock); | |
4643 | if (used + space_size >= space_info->total_bytes) | |
96f1bb57 JB |
4644 | return 0; |
4645 | ||
4646 | used += space_info->bytes_may_use; | |
a80c8dcf | 4647 | |
0b246afa JM |
4648 | spin_lock(&fs_info->free_chunk_lock); |
4649 | avail = fs_info->free_chunk_space; | |
4650 | spin_unlock(&fs_info->free_chunk_lock); | |
a80c8dcf JB |
4651 | |
4652 | /* | |
4653 | * If we have dup, raid1 or raid10 then only half of the free | |
53b381b3 DW |
4654 | * space is actually useable. For raid56, the space info used |
4655 | * doesn't include the parity drive, so we don't have to | |
4656 | * change the math | |
a80c8dcf JB |
4657 | */ |
4658 | if (profile & (BTRFS_BLOCK_GROUP_DUP | | |
4659 | BTRFS_BLOCK_GROUP_RAID1 | | |
4660 | BTRFS_BLOCK_GROUP_RAID10)) | |
4661 | avail >>= 1; | |
4662 | ||
4663 | /* | |
561c294d MX |
4664 | * If we aren't flushing all things, let us overcommit up to |
4665 | * 1/2th of the space. If we can flush, don't let us overcommit | |
4666 | * too much, let it overcommit up to 1/8 of the space. | |
a80c8dcf | 4667 | */ |
08e007d2 | 4668 | if (flush == BTRFS_RESERVE_FLUSH_ALL) |
14575aef | 4669 | avail >>= 3; |
a80c8dcf | 4670 | else |
14575aef | 4671 | avail >>= 1; |
a80c8dcf | 4672 | |
14575aef | 4673 | if (used + bytes < space_info->total_bytes + avail) |
a80c8dcf JB |
4674 | return 1; |
4675 | return 0; | |
4676 | } | |
4677 | ||
2ff7e61e | 4678 | static void btrfs_writeback_inodes_sb_nr(struct btrfs_fs_info *fs_info, |
6c255e67 | 4679 | unsigned long nr_pages, int nr_items) |
da633a42 | 4680 | { |
0b246afa | 4681 | struct super_block *sb = fs_info->sb; |
da633a42 | 4682 | |
925a6efb JB |
4683 | if (down_read_trylock(&sb->s_umount)) { |
4684 | writeback_inodes_sb_nr(sb, nr_pages, WB_REASON_FS_FREE_SPACE); | |
4685 | up_read(&sb->s_umount); | |
4686 | } else { | |
da633a42 MX |
4687 | /* |
4688 | * We needn't worry the filesystem going from r/w to r/o though | |
4689 | * we don't acquire ->s_umount mutex, because the filesystem | |
4690 | * should guarantee the delalloc inodes list be empty after | |
4691 | * the filesystem is readonly(all dirty pages are written to | |
4692 | * the disk). | |
4693 | */ | |
0b246afa | 4694 | btrfs_start_delalloc_roots(fs_info, 0, nr_items); |
98ad69cf | 4695 | if (!current->journal_info) |
0b246afa | 4696 | btrfs_wait_ordered_roots(fs_info, nr_items, 0, (u64)-1); |
da633a42 MX |
4697 | } |
4698 | } | |
4699 | ||
2ff7e61e JM |
4700 | static inline int calc_reclaim_items_nr(struct btrfs_fs_info *fs_info, |
4701 | u64 to_reclaim) | |
18cd8ea6 MX |
4702 | { |
4703 | u64 bytes; | |
4704 | int nr; | |
4705 | ||
2ff7e61e | 4706 | bytes = btrfs_calc_trans_metadata_size(fs_info, 1); |
18cd8ea6 MX |
4707 | nr = (int)div64_u64(to_reclaim, bytes); |
4708 | if (!nr) | |
4709 | nr = 1; | |
4710 | return nr; | |
4711 | } | |
4712 | ||
ee22184b | 4713 | #define EXTENT_SIZE_PER_ITEM SZ_256K |
c61a16a7 | 4714 | |
9ed74f2d | 4715 | /* |
5da9d01b | 4716 | * shrink metadata reservation for delalloc |
9ed74f2d | 4717 | */ |
f4c738c2 JB |
4718 | static void shrink_delalloc(struct btrfs_root *root, u64 to_reclaim, u64 orig, |
4719 | bool wait_ordered) | |
5da9d01b | 4720 | { |
0b246afa | 4721 | struct btrfs_fs_info *fs_info = root->fs_info; |
0ca1f7ce | 4722 | struct btrfs_block_rsv *block_rsv; |
0019f10d | 4723 | struct btrfs_space_info *space_info; |
663350ac | 4724 | struct btrfs_trans_handle *trans; |
f4c738c2 | 4725 | u64 delalloc_bytes; |
5da9d01b | 4726 | u64 max_reclaim; |
b1953bce | 4727 | long time_left; |
d3ee29e3 MX |
4728 | unsigned long nr_pages; |
4729 | int loops; | |
b0244199 | 4730 | int items; |
08e007d2 | 4731 | enum btrfs_reserve_flush_enum flush; |
5da9d01b | 4732 | |
c61a16a7 | 4733 | /* Calc the number of the pages we need flush for space reservation */ |
2ff7e61e | 4734 | items = calc_reclaim_items_nr(fs_info, to_reclaim); |
8eb0dfdb | 4735 | to_reclaim = (u64)items * EXTENT_SIZE_PER_ITEM; |
c61a16a7 | 4736 | |
663350ac | 4737 | trans = (struct btrfs_trans_handle *)current->journal_info; |
0b246afa | 4738 | block_rsv = &fs_info->delalloc_block_rsv; |
0019f10d | 4739 | space_info = block_rsv->space_info; |
bf9022e0 | 4740 | |
963d678b | 4741 | delalloc_bytes = percpu_counter_sum_positive( |
0b246afa | 4742 | &fs_info->delalloc_bytes); |
f4c738c2 | 4743 | if (delalloc_bytes == 0) { |
fdb5effd | 4744 | if (trans) |
f4c738c2 | 4745 | return; |
38c135af | 4746 | if (wait_ordered) |
0b246afa | 4747 | btrfs_wait_ordered_roots(fs_info, items, 0, (u64)-1); |
f4c738c2 | 4748 | return; |
fdb5effd JB |
4749 | } |
4750 | ||
d3ee29e3 | 4751 | loops = 0; |
f4c738c2 JB |
4752 | while (delalloc_bytes && loops < 3) { |
4753 | max_reclaim = min(delalloc_bytes, to_reclaim); | |
09cbfeaf | 4754 | nr_pages = max_reclaim >> PAGE_SHIFT; |
2ff7e61e | 4755 | btrfs_writeback_inodes_sb_nr(fs_info, nr_pages, items); |
dea31f52 JB |
4756 | /* |
4757 | * We need to wait for the async pages to actually start before | |
4758 | * we do anything. | |
4759 | */ | |
0b246afa | 4760 | max_reclaim = atomic_read(&fs_info->async_delalloc_pages); |
9f3a074d MX |
4761 | if (!max_reclaim) |
4762 | goto skip_async; | |
4763 | ||
4764 | if (max_reclaim <= nr_pages) | |
4765 | max_reclaim = 0; | |
4766 | else | |
4767 | max_reclaim -= nr_pages; | |
dea31f52 | 4768 | |
0b246afa JM |
4769 | wait_event(fs_info->async_submit_wait, |
4770 | atomic_read(&fs_info->async_delalloc_pages) <= | |
9f3a074d MX |
4771 | (int)max_reclaim); |
4772 | skip_async: | |
08e007d2 MX |
4773 | if (!trans) |
4774 | flush = BTRFS_RESERVE_FLUSH_ALL; | |
4775 | else | |
4776 | flush = BTRFS_RESERVE_NO_FLUSH; | |
0019f10d | 4777 | spin_lock(&space_info->lock); |
08e007d2 | 4778 | if (can_overcommit(root, space_info, orig, flush)) { |
f4c738c2 JB |
4779 | spin_unlock(&space_info->lock); |
4780 | break; | |
4781 | } | |
957780eb JB |
4782 | if (list_empty(&space_info->tickets) && |
4783 | list_empty(&space_info->priority_tickets)) { | |
4784 | spin_unlock(&space_info->lock); | |
4785 | break; | |
4786 | } | |
0019f10d | 4787 | spin_unlock(&space_info->lock); |
5da9d01b | 4788 | |
36e39c40 | 4789 | loops++; |
f104d044 | 4790 | if (wait_ordered && !trans) { |
0b246afa | 4791 | btrfs_wait_ordered_roots(fs_info, items, 0, (u64)-1); |
f104d044 | 4792 | } else { |
f4c738c2 | 4793 | time_left = schedule_timeout_killable(1); |
f104d044 JB |
4794 | if (time_left) |
4795 | break; | |
4796 | } | |
963d678b | 4797 | delalloc_bytes = percpu_counter_sum_positive( |
0b246afa | 4798 | &fs_info->delalloc_bytes); |
5da9d01b | 4799 | } |
5da9d01b YZ |
4800 | } |
4801 | ||
663350ac JB |
4802 | /** |
4803 | * maybe_commit_transaction - possibly commit the transaction if its ok to | |
4804 | * @root - the root we're allocating for | |
4805 | * @bytes - the number of bytes we want to reserve | |
4806 | * @force - force the commit | |
8bb8ab2e | 4807 | * |
663350ac JB |
4808 | * This will check to make sure that committing the transaction will actually |
4809 | * get us somewhere and then commit the transaction if it does. Otherwise it | |
4810 | * will return -ENOSPC. | |
8bb8ab2e | 4811 | */ |
0c9ab349 | 4812 | static int may_commit_transaction(struct btrfs_fs_info *fs_info, |
663350ac JB |
4813 | struct btrfs_space_info *space_info, |
4814 | u64 bytes, int force) | |
4815 | { | |
0b246afa | 4816 | struct btrfs_block_rsv *delayed_rsv = &fs_info->delayed_block_rsv; |
663350ac JB |
4817 | struct btrfs_trans_handle *trans; |
4818 | ||
4819 | trans = (struct btrfs_trans_handle *)current->journal_info; | |
4820 | if (trans) | |
4821 | return -EAGAIN; | |
4822 | ||
4823 | if (force) | |
4824 | goto commit; | |
4825 | ||
4826 | /* See if there is enough pinned space to make this reservation */ | |
b150a4f1 | 4827 | if (percpu_counter_compare(&space_info->total_bytes_pinned, |
0424c548 | 4828 | bytes) >= 0) |
663350ac | 4829 | goto commit; |
663350ac JB |
4830 | |
4831 | /* | |
4832 | * See if there is some space in the delayed insertion reservation for | |
4833 | * this reservation. | |
4834 | */ | |
4835 | if (space_info != delayed_rsv->space_info) | |
4836 | return -ENOSPC; | |
4837 | ||
4838 | spin_lock(&delayed_rsv->lock); | |
b150a4f1 JB |
4839 | if (percpu_counter_compare(&space_info->total_bytes_pinned, |
4840 | bytes - delayed_rsv->size) >= 0) { | |
663350ac JB |
4841 | spin_unlock(&delayed_rsv->lock); |
4842 | return -ENOSPC; | |
4843 | } | |
4844 | spin_unlock(&delayed_rsv->lock); | |
4845 | ||
4846 | commit: | |
0c9ab349 | 4847 | trans = btrfs_join_transaction(fs_info->fs_root); |
663350ac JB |
4848 | if (IS_ERR(trans)) |
4849 | return -ENOSPC; | |
4850 | ||
3a45bb20 | 4851 | return btrfs_commit_transaction(trans); |
663350ac JB |
4852 | } |
4853 | ||
957780eb JB |
4854 | struct reserve_ticket { |
4855 | u64 bytes; | |
4856 | int error; | |
4857 | struct list_head list; | |
4858 | wait_queue_head_t wait; | |
96c3f433 JB |
4859 | }; |
4860 | ||
0c9ab349 | 4861 | static int flush_space(struct btrfs_fs_info *fs_info, |
96c3f433 JB |
4862 | struct btrfs_space_info *space_info, u64 num_bytes, |
4863 | u64 orig_bytes, int state) | |
4864 | { | |
0c9ab349 | 4865 | struct btrfs_root *root = fs_info->fs_root; |
96c3f433 JB |
4866 | struct btrfs_trans_handle *trans; |
4867 | int nr; | |
f4c738c2 | 4868 | int ret = 0; |
96c3f433 JB |
4869 | |
4870 | switch (state) { | |
96c3f433 JB |
4871 | case FLUSH_DELAYED_ITEMS_NR: |
4872 | case FLUSH_DELAYED_ITEMS: | |
18cd8ea6 | 4873 | if (state == FLUSH_DELAYED_ITEMS_NR) |
2ff7e61e | 4874 | nr = calc_reclaim_items_nr(fs_info, num_bytes) * 2; |
18cd8ea6 | 4875 | else |
96c3f433 | 4876 | nr = -1; |
18cd8ea6 | 4877 | |
96c3f433 JB |
4878 | trans = btrfs_join_transaction(root); |
4879 | if (IS_ERR(trans)) { | |
4880 | ret = PTR_ERR(trans); | |
4881 | break; | |
4882 | } | |
2ff7e61e | 4883 | ret = btrfs_run_delayed_items_nr(trans, fs_info, nr); |
3a45bb20 | 4884 | btrfs_end_transaction(trans); |
96c3f433 | 4885 | break; |
67b0fd63 JB |
4886 | case FLUSH_DELALLOC: |
4887 | case FLUSH_DELALLOC_WAIT: | |
24af7dd1 | 4888 | shrink_delalloc(root, num_bytes * 2, orig_bytes, |
67b0fd63 JB |
4889 | state == FLUSH_DELALLOC_WAIT); |
4890 | break; | |
ea658bad JB |
4891 | case ALLOC_CHUNK: |
4892 | trans = btrfs_join_transaction(root); | |
4893 | if (IS_ERR(trans)) { | |
4894 | ret = PTR_ERR(trans); | |
4895 | break; | |
4896 | } | |
2ff7e61e | 4897 | ret = do_chunk_alloc(trans, fs_info, |
ea658bad JB |
4898 | btrfs_get_alloc_profile(root, 0), |
4899 | CHUNK_ALLOC_NO_FORCE); | |
3a45bb20 | 4900 | btrfs_end_transaction(trans); |
eecba891 | 4901 | if (ret > 0 || ret == -ENOSPC) |
ea658bad JB |
4902 | ret = 0; |
4903 | break; | |
96c3f433 | 4904 | case COMMIT_TRANS: |
0c9ab349 JM |
4905 | ret = may_commit_transaction(fs_info, space_info, |
4906 | orig_bytes, 0); | |
96c3f433 JB |
4907 | break; |
4908 | default: | |
4909 | ret = -ENOSPC; | |
4910 | break; | |
4911 | } | |
4912 | ||
0b246afa | 4913 | trace_btrfs_flush_space(fs_info, space_info->flags, num_bytes, |
f376df2b | 4914 | orig_bytes, state, ret); |
96c3f433 JB |
4915 | return ret; |
4916 | } | |
21c7e756 MX |
4917 | |
4918 | static inline u64 | |
4919 | btrfs_calc_reclaim_metadata_size(struct btrfs_root *root, | |
4920 | struct btrfs_space_info *space_info) | |
4921 | { | |
957780eb | 4922 | struct reserve_ticket *ticket; |
21c7e756 MX |
4923 | u64 used; |
4924 | u64 expected; | |
957780eb | 4925 | u64 to_reclaim = 0; |
21c7e756 | 4926 | |
957780eb JB |
4927 | list_for_each_entry(ticket, &space_info->tickets, list) |
4928 | to_reclaim += ticket->bytes; | |
4929 | list_for_each_entry(ticket, &space_info->priority_tickets, list) | |
4930 | to_reclaim += ticket->bytes; | |
4931 | if (to_reclaim) | |
4932 | return to_reclaim; | |
21c7e756 | 4933 | |
e0af2484 WX |
4934 | to_reclaim = min_t(u64, num_online_cpus() * SZ_1M, SZ_16M); |
4935 | if (can_overcommit(root, space_info, to_reclaim, | |
4936 | BTRFS_RESERVE_FLUSH_ALL)) | |
4937 | return 0; | |
4938 | ||
21c7e756 MX |
4939 | used = space_info->bytes_used + space_info->bytes_reserved + |
4940 | space_info->bytes_pinned + space_info->bytes_readonly + | |
4941 | space_info->bytes_may_use; | |
ee22184b | 4942 | if (can_overcommit(root, space_info, SZ_1M, BTRFS_RESERVE_FLUSH_ALL)) |
21c7e756 MX |
4943 | expected = div_factor_fine(space_info->total_bytes, 95); |
4944 | else | |
4945 | expected = div_factor_fine(space_info->total_bytes, 90); | |
4946 | ||
4947 | if (used > expected) | |
4948 | to_reclaim = used - expected; | |
4949 | else | |
4950 | to_reclaim = 0; | |
4951 | to_reclaim = min(to_reclaim, space_info->bytes_may_use + | |
4952 | space_info->bytes_reserved); | |
21c7e756 MX |
4953 | return to_reclaim; |
4954 | } | |
4955 | ||
4956 | static inline int need_do_async_reclaim(struct btrfs_space_info *space_info, | |
87241c2e | 4957 | struct btrfs_root *root, u64 used) |
21c7e756 | 4958 | { |
0b246afa | 4959 | struct btrfs_fs_info *fs_info = root->fs_info; |
365c5313 JB |
4960 | u64 thresh = div_factor_fine(space_info->total_bytes, 98); |
4961 | ||
4962 | /* If we're just plain full then async reclaim just slows us down. */ | |
baee8790 | 4963 | if ((space_info->bytes_used + space_info->bytes_reserved) >= thresh) |
365c5313 JB |
4964 | return 0; |
4965 | ||
87241c2e | 4966 | if (!btrfs_calc_reclaim_metadata_size(root, space_info)) |
d38b349c JB |
4967 | return 0; |
4968 | ||
0b246afa JM |
4969 | return (used >= thresh && !btrfs_fs_closing(fs_info) && |
4970 | !test_bit(BTRFS_FS_STATE_REMOUNTING, &fs_info->fs_state)); | |
21c7e756 MX |
4971 | } |
4972 | ||
957780eb | 4973 | static void wake_all_tickets(struct list_head *head) |
21c7e756 | 4974 | { |
957780eb | 4975 | struct reserve_ticket *ticket; |
25ce459c | 4976 | |
957780eb JB |
4977 | while (!list_empty(head)) { |
4978 | ticket = list_first_entry(head, struct reserve_ticket, list); | |
4979 | list_del_init(&ticket->list); | |
4980 | ticket->error = -ENOSPC; | |
4981 | wake_up(&ticket->wait); | |
21c7e756 | 4982 | } |
21c7e756 MX |
4983 | } |
4984 | ||
957780eb JB |
4985 | /* |
4986 | * This is for normal flushers, we can wait all goddamned day if we want to. We | |
4987 | * will loop and continuously try to flush as long as we are making progress. | |
4988 | * We count progress as clearing off tickets each time we have to loop. | |
4989 | */ | |
21c7e756 MX |
4990 | static void btrfs_async_reclaim_metadata_space(struct work_struct *work) |
4991 | { | |
4992 | struct btrfs_fs_info *fs_info; | |
4993 | struct btrfs_space_info *space_info; | |
4994 | u64 to_reclaim; | |
4995 | int flush_state; | |
957780eb | 4996 | int commit_cycles = 0; |
ce129655 | 4997 | u64 last_tickets_id; |
21c7e756 MX |
4998 | |
4999 | fs_info = container_of(work, struct btrfs_fs_info, async_reclaim_work); | |
5000 | space_info = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_METADATA); | |
5001 | ||
957780eb | 5002 | spin_lock(&space_info->lock); |
21c7e756 MX |
5003 | to_reclaim = btrfs_calc_reclaim_metadata_size(fs_info->fs_root, |
5004 | space_info); | |
957780eb JB |
5005 | if (!to_reclaim) { |
5006 | space_info->flush = 0; | |
5007 | spin_unlock(&space_info->lock); | |
21c7e756 | 5008 | return; |
957780eb | 5009 | } |
ce129655 | 5010 | last_tickets_id = space_info->tickets_id; |
957780eb | 5011 | spin_unlock(&space_info->lock); |
21c7e756 MX |
5012 | |
5013 | flush_state = FLUSH_DELAYED_ITEMS_NR; | |
957780eb JB |
5014 | do { |
5015 | struct reserve_ticket *ticket; | |
5016 | int ret; | |
5017 | ||
0c9ab349 JM |
5018 | ret = flush_space(fs_info, space_info, to_reclaim, to_reclaim, |
5019 | flush_state); | |
957780eb JB |
5020 | spin_lock(&space_info->lock); |
5021 | if (list_empty(&space_info->tickets)) { | |
5022 | space_info->flush = 0; | |
5023 | spin_unlock(&space_info->lock); | |
5024 | return; | |
5025 | } | |
5026 | to_reclaim = btrfs_calc_reclaim_metadata_size(fs_info->fs_root, | |
5027 | space_info); | |
5028 | ticket = list_first_entry(&space_info->tickets, | |
5029 | struct reserve_ticket, list); | |
ce129655 | 5030 | if (last_tickets_id == space_info->tickets_id) { |
957780eb JB |
5031 | flush_state++; |
5032 | } else { | |
ce129655 | 5033 | last_tickets_id = space_info->tickets_id; |
957780eb JB |
5034 | flush_state = FLUSH_DELAYED_ITEMS_NR; |
5035 | if (commit_cycles) | |
5036 | commit_cycles--; | |
5037 | } | |
5038 | ||
5039 | if (flush_state > COMMIT_TRANS) { | |
5040 | commit_cycles++; | |
5041 | if (commit_cycles > 2) { | |
5042 | wake_all_tickets(&space_info->tickets); | |
5043 | space_info->flush = 0; | |
5044 | } else { | |
5045 | flush_state = FLUSH_DELAYED_ITEMS_NR; | |
5046 | } | |
5047 | } | |
5048 | spin_unlock(&space_info->lock); | |
5049 | } while (flush_state <= COMMIT_TRANS); | |
5050 | } | |
5051 | ||
5052 | void btrfs_init_async_reclaim_work(struct work_struct *work) | |
5053 | { | |
5054 | INIT_WORK(work, btrfs_async_reclaim_metadata_space); | |
5055 | } | |
5056 | ||
5057 | static void priority_reclaim_metadata_space(struct btrfs_fs_info *fs_info, | |
5058 | struct btrfs_space_info *space_info, | |
5059 | struct reserve_ticket *ticket) | |
5060 | { | |
5061 | u64 to_reclaim; | |
5062 | int flush_state = FLUSH_DELAYED_ITEMS_NR; | |
5063 | ||
5064 | spin_lock(&space_info->lock); | |
5065 | to_reclaim = btrfs_calc_reclaim_metadata_size(fs_info->fs_root, | |
5066 | space_info); | |
5067 | if (!to_reclaim) { | |
5068 | spin_unlock(&space_info->lock); | |
5069 | return; | |
5070 | } | |
5071 | spin_unlock(&space_info->lock); | |
5072 | ||
21c7e756 | 5073 | do { |
0c9ab349 JM |
5074 | flush_space(fs_info, space_info, to_reclaim, to_reclaim, |
5075 | flush_state); | |
21c7e756 | 5076 | flush_state++; |
957780eb JB |
5077 | spin_lock(&space_info->lock); |
5078 | if (ticket->bytes == 0) { | |
5079 | spin_unlock(&space_info->lock); | |
21c7e756 | 5080 | return; |
957780eb JB |
5081 | } |
5082 | spin_unlock(&space_info->lock); | |
5083 | ||
5084 | /* | |
5085 | * Priority flushers can't wait on delalloc without | |
5086 | * deadlocking. | |
5087 | */ | |
5088 | if (flush_state == FLUSH_DELALLOC || | |
5089 | flush_state == FLUSH_DELALLOC_WAIT) | |
5090 | flush_state = ALLOC_CHUNK; | |
365c5313 | 5091 | } while (flush_state < COMMIT_TRANS); |
21c7e756 MX |
5092 | } |
5093 | ||
957780eb JB |
5094 | static int wait_reserve_ticket(struct btrfs_fs_info *fs_info, |
5095 | struct btrfs_space_info *space_info, | |
5096 | struct reserve_ticket *ticket, u64 orig_bytes) | |
5097 | ||
21c7e756 | 5098 | { |
957780eb JB |
5099 | DEFINE_WAIT(wait); |
5100 | int ret = 0; | |
5101 | ||
5102 | spin_lock(&space_info->lock); | |
5103 | while (ticket->bytes > 0 && ticket->error == 0) { | |
5104 | ret = prepare_to_wait_event(&ticket->wait, &wait, TASK_KILLABLE); | |
5105 | if (ret) { | |
5106 | ret = -EINTR; | |
5107 | break; | |
5108 | } | |
5109 | spin_unlock(&space_info->lock); | |
5110 | ||
5111 | schedule(); | |
5112 | ||
5113 | finish_wait(&ticket->wait, &wait); | |
5114 | spin_lock(&space_info->lock); | |
5115 | } | |
5116 | if (!ret) | |
5117 | ret = ticket->error; | |
5118 | if (!list_empty(&ticket->list)) | |
5119 | list_del_init(&ticket->list); | |
5120 | if (ticket->bytes && ticket->bytes < orig_bytes) { | |
5121 | u64 num_bytes = orig_bytes - ticket->bytes; | |
5122 | space_info->bytes_may_use -= num_bytes; | |
5123 | trace_btrfs_space_reservation(fs_info, "space_info", | |
5124 | space_info->flags, num_bytes, 0); | |
5125 | } | |
5126 | spin_unlock(&space_info->lock); | |
5127 | ||
5128 | return ret; | |
21c7e756 MX |
5129 | } |
5130 | ||
4a92b1b8 JB |
5131 | /** |
5132 | * reserve_metadata_bytes - try to reserve bytes from the block_rsv's space | |
5133 | * @root - the root we're allocating for | |
957780eb | 5134 | * @space_info - the space info we want to allocate from |
4a92b1b8 | 5135 | * @orig_bytes - the number of bytes we want |
48fc7f7e | 5136 | * @flush - whether or not we can flush to make our reservation |
8bb8ab2e | 5137 | * |
01327610 | 5138 | * This will reserve orig_bytes number of bytes from the space info associated |
4a92b1b8 JB |
5139 | * with the block_rsv. If there is not enough space it will make an attempt to |
5140 | * flush out space to make room. It will do this by flushing delalloc if | |
5141 | * possible or committing the transaction. If flush is 0 then no attempts to | |
5142 | * regain reservations will be made and this will fail if there is not enough | |
5143 | * space already. | |
8bb8ab2e | 5144 | */ |
957780eb JB |
5145 | static int __reserve_metadata_bytes(struct btrfs_root *root, |
5146 | struct btrfs_space_info *space_info, | |
5147 | u64 orig_bytes, | |
5148 | enum btrfs_reserve_flush_enum flush) | |
9ed74f2d | 5149 | { |
0b246afa | 5150 | struct btrfs_fs_info *fs_info = root->fs_info; |
957780eb | 5151 | struct reserve_ticket ticket; |
2bf64758 | 5152 | u64 used; |
8bb8ab2e | 5153 | int ret = 0; |
9ed74f2d | 5154 | |
957780eb | 5155 | ASSERT(orig_bytes); |
8ca17f0f | 5156 | ASSERT(!current->journal_info || flush != BTRFS_RESERVE_FLUSH_ALL); |
fdb5effd | 5157 | |
8bb8ab2e | 5158 | spin_lock(&space_info->lock); |
fdb5effd | 5159 | ret = -ENOSPC; |
4136135b | 5160 | used = btrfs_space_info_used(space_info, true); |
9ed74f2d | 5161 | |
8bb8ab2e | 5162 | /* |
957780eb JB |
5163 | * If we have enough space then hooray, make our reservation and carry |
5164 | * on. If not see if we can overcommit, and if we can, hooray carry on. | |
5165 | * If not things get more complicated. | |
8bb8ab2e | 5166 | */ |
957780eb JB |
5167 | if (used + orig_bytes <= space_info->total_bytes) { |
5168 | space_info->bytes_may_use += orig_bytes; | |
0b246afa JM |
5169 | trace_btrfs_space_reservation(fs_info, "space_info", |
5170 | space_info->flags, orig_bytes, 1); | |
957780eb JB |
5171 | ret = 0; |
5172 | } else if (can_overcommit(root, space_info, orig_bytes, flush)) { | |
44734ed1 | 5173 | space_info->bytes_may_use += orig_bytes; |
0b246afa JM |
5174 | trace_btrfs_space_reservation(fs_info, "space_info", |
5175 | space_info->flags, orig_bytes, 1); | |
44734ed1 | 5176 | ret = 0; |
2bf64758 JB |
5177 | } |
5178 | ||
8bb8ab2e | 5179 | /* |
957780eb JB |
5180 | * If we couldn't make a reservation then setup our reservation ticket |
5181 | * and kick the async worker if it's not already running. | |
08e007d2 | 5182 | * |
957780eb JB |
5183 | * If we are a priority flusher then we just need to add our ticket to |
5184 | * the list and we will do our own flushing further down. | |
8bb8ab2e | 5185 | */ |
72bcd99d | 5186 | if (ret && flush != BTRFS_RESERVE_NO_FLUSH) { |
957780eb JB |
5187 | ticket.bytes = orig_bytes; |
5188 | ticket.error = 0; | |
5189 | init_waitqueue_head(&ticket.wait); | |
5190 | if (flush == BTRFS_RESERVE_FLUSH_ALL) { | |
5191 | list_add_tail(&ticket.list, &space_info->tickets); | |
5192 | if (!space_info->flush) { | |
5193 | space_info->flush = 1; | |
0b246afa | 5194 | trace_btrfs_trigger_flush(fs_info, |
f376df2b JB |
5195 | space_info->flags, |
5196 | orig_bytes, flush, | |
5197 | "enospc"); | |
957780eb JB |
5198 | queue_work(system_unbound_wq, |
5199 | &root->fs_info->async_reclaim_work); | |
5200 | } | |
5201 | } else { | |
5202 | list_add_tail(&ticket.list, | |
5203 | &space_info->priority_tickets); | |
5204 | } | |
21c7e756 MX |
5205 | } else if (!ret && space_info->flags & BTRFS_BLOCK_GROUP_METADATA) { |
5206 | used += orig_bytes; | |
f6acfd50 JB |
5207 | /* |
5208 | * We will do the space reservation dance during log replay, | |
5209 | * which means we won't have fs_info->fs_root set, so don't do | |
5210 | * the async reclaim as we will panic. | |
5211 | */ | |
0b246afa | 5212 | if (!test_bit(BTRFS_FS_LOG_RECOVERING, &fs_info->flags) && |
87241c2e | 5213 | need_do_async_reclaim(space_info, root, used) && |
0b246afa JM |
5214 | !work_busy(&fs_info->async_reclaim_work)) { |
5215 | trace_btrfs_trigger_flush(fs_info, space_info->flags, | |
5216 | orig_bytes, flush, "preempt"); | |
21c7e756 | 5217 | queue_work(system_unbound_wq, |
0b246afa | 5218 | &fs_info->async_reclaim_work); |
f376df2b | 5219 | } |
8bb8ab2e | 5220 | } |
f0486c68 | 5221 | spin_unlock(&space_info->lock); |
08e007d2 | 5222 | if (!ret || flush == BTRFS_RESERVE_NO_FLUSH) |
957780eb | 5223 | return ret; |
f0486c68 | 5224 | |
957780eb | 5225 | if (flush == BTRFS_RESERVE_FLUSH_ALL) |
0b246afa | 5226 | return wait_reserve_ticket(fs_info, space_info, &ticket, |
957780eb | 5227 | orig_bytes); |
08e007d2 | 5228 | |
957780eb | 5229 | ret = 0; |
0b246afa | 5230 | priority_reclaim_metadata_space(fs_info, space_info, &ticket); |
957780eb JB |
5231 | spin_lock(&space_info->lock); |
5232 | if (ticket.bytes) { | |
5233 | if (ticket.bytes < orig_bytes) { | |
5234 | u64 num_bytes = orig_bytes - ticket.bytes; | |
5235 | space_info->bytes_may_use -= num_bytes; | |
0b246afa JM |
5236 | trace_btrfs_space_reservation(fs_info, "space_info", |
5237 | space_info->flags, | |
5238 | num_bytes, 0); | |
08e007d2 | 5239 | |
957780eb JB |
5240 | } |
5241 | list_del_init(&ticket.list); | |
5242 | ret = -ENOSPC; | |
5243 | } | |
5244 | spin_unlock(&space_info->lock); | |
5245 | ASSERT(list_empty(&ticket.list)); | |
5246 | return ret; | |
5247 | } | |
8bb8ab2e | 5248 | |
957780eb JB |
5249 | /** |
5250 | * reserve_metadata_bytes - try to reserve bytes from the block_rsv's space | |
5251 | * @root - the root we're allocating for | |
5252 | * @block_rsv - the block_rsv we're allocating for | |
5253 | * @orig_bytes - the number of bytes we want | |
5254 | * @flush - whether or not we can flush to make our reservation | |
5255 | * | |
5256 | * This will reserve orgi_bytes number of bytes from the space info associated | |
5257 | * with the block_rsv. If there is not enough space it will make an attempt to | |
5258 | * flush out space to make room. It will do this by flushing delalloc if | |
5259 | * possible or committing the transaction. If flush is 0 then no attempts to | |
5260 | * regain reservations will be made and this will fail if there is not enough | |
5261 | * space already. | |
5262 | */ | |
5263 | static int reserve_metadata_bytes(struct btrfs_root *root, | |
5264 | struct btrfs_block_rsv *block_rsv, | |
5265 | u64 orig_bytes, | |
5266 | enum btrfs_reserve_flush_enum flush) | |
5267 | { | |
0b246afa JM |
5268 | struct btrfs_fs_info *fs_info = root->fs_info; |
5269 | struct btrfs_block_rsv *global_rsv = &fs_info->global_block_rsv; | |
957780eb JB |
5270 | int ret; |
5271 | ||
5272 | ret = __reserve_metadata_bytes(root, block_rsv->space_info, orig_bytes, | |
5273 | flush); | |
5d80366e JB |
5274 | if (ret == -ENOSPC && |
5275 | unlikely(root->orphan_cleanup_state == ORPHAN_CLEANUP_STARTED)) { | |
5d80366e JB |
5276 | if (block_rsv != global_rsv && |
5277 | !block_rsv_use_bytes(global_rsv, orig_bytes)) | |
5278 | ret = 0; | |
5279 | } | |
cab45e22 | 5280 | if (ret == -ENOSPC) |
0b246afa | 5281 | trace_btrfs_space_reservation(fs_info, "space_info:enospc", |
957780eb JB |
5282 | block_rsv->space_info->flags, |
5283 | orig_bytes, 1); | |
f0486c68 YZ |
5284 | return ret; |
5285 | } | |
5286 | ||
79787eaa JM |
5287 | static struct btrfs_block_rsv *get_block_rsv( |
5288 | const struct btrfs_trans_handle *trans, | |
5289 | const struct btrfs_root *root) | |
f0486c68 | 5290 | { |
0b246afa | 5291 | struct btrfs_fs_info *fs_info = root->fs_info; |
4c13d758 JB |
5292 | struct btrfs_block_rsv *block_rsv = NULL; |
5293 | ||
e9cf439f | 5294 | if (test_bit(BTRFS_ROOT_REF_COWS, &root->state) || |
0b246afa JM |
5295 | (root == fs_info->csum_root && trans->adding_csums) || |
5296 | (root == fs_info->uuid_root)) | |
f7a81ea4 SB |
5297 | block_rsv = trans->block_rsv; |
5298 | ||
4c13d758 | 5299 | if (!block_rsv) |
f0486c68 YZ |
5300 | block_rsv = root->block_rsv; |
5301 | ||
5302 | if (!block_rsv) | |
0b246afa | 5303 | block_rsv = &fs_info->empty_block_rsv; |
f0486c68 YZ |
5304 | |
5305 | return block_rsv; | |
5306 | } | |
5307 | ||
5308 | static int block_rsv_use_bytes(struct btrfs_block_rsv *block_rsv, | |
5309 | u64 num_bytes) | |
5310 | { | |
5311 | int ret = -ENOSPC; | |
5312 | spin_lock(&block_rsv->lock); | |
5313 | if (block_rsv->reserved >= num_bytes) { | |
5314 | block_rsv->reserved -= num_bytes; | |
5315 | if (block_rsv->reserved < block_rsv->size) | |
5316 | block_rsv->full = 0; | |
5317 | ret = 0; | |
5318 | } | |
5319 | spin_unlock(&block_rsv->lock); | |
5320 | return ret; | |
5321 | } | |
5322 | ||
5323 | static void block_rsv_add_bytes(struct btrfs_block_rsv *block_rsv, | |
5324 | u64 num_bytes, int update_size) | |
5325 | { | |
5326 | spin_lock(&block_rsv->lock); | |
5327 | block_rsv->reserved += num_bytes; | |
5328 | if (update_size) | |
5329 | block_rsv->size += num_bytes; | |
5330 | else if (block_rsv->reserved >= block_rsv->size) | |
5331 | block_rsv->full = 1; | |
5332 | spin_unlock(&block_rsv->lock); | |
5333 | } | |
5334 | ||
d52be818 JB |
5335 | int btrfs_cond_migrate_bytes(struct btrfs_fs_info *fs_info, |
5336 | struct btrfs_block_rsv *dest, u64 num_bytes, | |
5337 | int min_factor) | |
5338 | { | |
5339 | struct btrfs_block_rsv *global_rsv = &fs_info->global_block_rsv; | |
5340 | u64 min_bytes; | |
5341 | ||
5342 | if (global_rsv->space_info != dest->space_info) | |
5343 | return -ENOSPC; | |
5344 | ||
5345 | spin_lock(&global_rsv->lock); | |
5346 | min_bytes = div_factor(global_rsv->size, min_factor); | |
5347 | if (global_rsv->reserved < min_bytes + num_bytes) { | |
5348 | spin_unlock(&global_rsv->lock); | |
5349 | return -ENOSPC; | |
5350 | } | |
5351 | global_rsv->reserved -= num_bytes; | |
5352 | if (global_rsv->reserved < global_rsv->size) | |
5353 | global_rsv->full = 0; | |
5354 | spin_unlock(&global_rsv->lock); | |
5355 | ||
5356 | block_rsv_add_bytes(dest, num_bytes, 1); | |
5357 | return 0; | |
5358 | } | |
5359 | ||
957780eb JB |
5360 | /* |
5361 | * This is for space we already have accounted in space_info->bytes_may_use, so | |
5362 | * basically when we're returning space from block_rsv's. | |
5363 | */ | |
5364 | static void space_info_add_old_bytes(struct btrfs_fs_info *fs_info, | |
5365 | struct btrfs_space_info *space_info, | |
5366 | u64 num_bytes) | |
5367 | { | |
5368 | struct reserve_ticket *ticket; | |
5369 | struct list_head *head; | |
5370 | u64 used; | |
5371 | enum btrfs_reserve_flush_enum flush = BTRFS_RESERVE_NO_FLUSH; | |
5372 | bool check_overcommit = false; | |
5373 | ||
5374 | spin_lock(&space_info->lock); | |
5375 | head = &space_info->priority_tickets; | |
5376 | ||
5377 | /* | |
5378 | * If we are over our limit then we need to check and see if we can | |
5379 | * overcommit, and if we can't then we just need to free up our space | |
5380 | * and not satisfy any requests. | |
5381 | */ | |
5382 | used = space_info->bytes_used + space_info->bytes_reserved + | |
5383 | space_info->bytes_pinned + space_info->bytes_readonly + | |
5384 | space_info->bytes_may_use; | |
5385 | if (used - num_bytes >= space_info->total_bytes) | |
5386 | check_overcommit = true; | |
5387 | again: | |
5388 | while (!list_empty(head) && num_bytes) { | |
5389 | ticket = list_first_entry(head, struct reserve_ticket, | |
5390 | list); | |
5391 | /* | |
5392 | * We use 0 bytes because this space is already reserved, so | |
5393 | * adding the ticket space would be a double count. | |
5394 | */ | |
5395 | if (check_overcommit && | |
5396 | !can_overcommit(fs_info->extent_root, space_info, 0, | |
5397 | flush)) | |
5398 | break; | |
5399 | if (num_bytes >= ticket->bytes) { | |
5400 | list_del_init(&ticket->list); | |
5401 | num_bytes -= ticket->bytes; | |
5402 | ticket->bytes = 0; | |
ce129655 | 5403 | space_info->tickets_id++; |
957780eb JB |
5404 | wake_up(&ticket->wait); |
5405 | } else { | |
5406 | ticket->bytes -= num_bytes; | |
5407 | num_bytes = 0; | |
5408 | } | |
5409 | } | |
5410 | ||
5411 | if (num_bytes && head == &space_info->priority_tickets) { | |
5412 | head = &space_info->tickets; | |
5413 | flush = BTRFS_RESERVE_FLUSH_ALL; | |
5414 | goto again; | |
5415 | } | |
5416 | space_info->bytes_may_use -= num_bytes; | |
5417 | trace_btrfs_space_reservation(fs_info, "space_info", | |
5418 | space_info->flags, num_bytes, 0); | |
5419 | spin_unlock(&space_info->lock); | |
5420 | } | |
5421 | ||
5422 | /* | |
5423 | * This is for newly allocated space that isn't accounted in | |
5424 | * space_info->bytes_may_use yet. So if we allocate a chunk or unpin an extent | |
5425 | * we use this helper. | |
5426 | */ | |
5427 | static void space_info_add_new_bytes(struct btrfs_fs_info *fs_info, | |
5428 | struct btrfs_space_info *space_info, | |
5429 | u64 num_bytes) | |
5430 | { | |
5431 | struct reserve_ticket *ticket; | |
5432 | struct list_head *head = &space_info->priority_tickets; | |
5433 | ||
5434 | again: | |
5435 | while (!list_empty(head) && num_bytes) { | |
5436 | ticket = list_first_entry(head, struct reserve_ticket, | |
5437 | list); | |
5438 | if (num_bytes >= ticket->bytes) { | |
5439 | trace_btrfs_space_reservation(fs_info, "space_info", | |
5440 | space_info->flags, | |
5441 | ticket->bytes, 1); | |
5442 | list_del_init(&ticket->list); | |
5443 | num_bytes -= ticket->bytes; | |
5444 | space_info->bytes_may_use += ticket->bytes; | |
5445 | ticket->bytes = 0; | |
ce129655 | 5446 | space_info->tickets_id++; |
957780eb JB |
5447 | wake_up(&ticket->wait); |
5448 | } else { | |
5449 | trace_btrfs_space_reservation(fs_info, "space_info", | |
5450 | space_info->flags, | |
5451 | num_bytes, 1); | |
5452 | space_info->bytes_may_use += num_bytes; | |
5453 | ticket->bytes -= num_bytes; | |
5454 | num_bytes = 0; | |
5455 | } | |
5456 | } | |
5457 | ||
5458 | if (num_bytes && head == &space_info->priority_tickets) { | |
5459 | head = &space_info->tickets; | |
5460 | goto again; | |
5461 | } | |
5462 | } | |
5463 | ||
8c2a3ca2 JB |
5464 | static void block_rsv_release_bytes(struct btrfs_fs_info *fs_info, |
5465 | struct btrfs_block_rsv *block_rsv, | |
62a45b60 | 5466 | struct btrfs_block_rsv *dest, u64 num_bytes) |
f0486c68 YZ |
5467 | { |
5468 | struct btrfs_space_info *space_info = block_rsv->space_info; | |
5469 | ||
5470 | spin_lock(&block_rsv->lock); | |
5471 | if (num_bytes == (u64)-1) | |
5472 | num_bytes = block_rsv->size; | |
5473 | block_rsv->size -= num_bytes; | |
5474 | if (block_rsv->reserved >= block_rsv->size) { | |
5475 | num_bytes = block_rsv->reserved - block_rsv->size; | |
5476 | block_rsv->reserved = block_rsv->size; | |
5477 | block_rsv->full = 1; | |
5478 | } else { | |
5479 | num_bytes = 0; | |
5480 | } | |
5481 | spin_unlock(&block_rsv->lock); | |
5482 | ||
5483 | if (num_bytes > 0) { | |
5484 | if (dest) { | |
e9e22899 JB |
5485 | spin_lock(&dest->lock); |
5486 | if (!dest->full) { | |
5487 | u64 bytes_to_add; | |
5488 | ||
5489 | bytes_to_add = dest->size - dest->reserved; | |
5490 | bytes_to_add = min(num_bytes, bytes_to_add); | |
5491 | dest->reserved += bytes_to_add; | |
5492 | if (dest->reserved >= dest->size) | |
5493 | dest->full = 1; | |
5494 | num_bytes -= bytes_to_add; | |
5495 | } | |
5496 | spin_unlock(&dest->lock); | |
5497 | } | |
957780eb JB |
5498 | if (num_bytes) |
5499 | space_info_add_old_bytes(fs_info, space_info, | |
5500 | num_bytes); | |
9ed74f2d | 5501 | } |
f0486c68 | 5502 | } |
4e06bdd6 | 5503 | |
25d609f8 JB |
5504 | int btrfs_block_rsv_migrate(struct btrfs_block_rsv *src, |
5505 | struct btrfs_block_rsv *dst, u64 num_bytes, | |
5506 | int update_size) | |
f0486c68 YZ |
5507 | { |
5508 | int ret; | |
9ed74f2d | 5509 | |
f0486c68 YZ |
5510 | ret = block_rsv_use_bytes(src, num_bytes); |
5511 | if (ret) | |
5512 | return ret; | |
9ed74f2d | 5513 | |
25d609f8 | 5514 | block_rsv_add_bytes(dst, num_bytes, update_size); |
9ed74f2d JB |
5515 | return 0; |
5516 | } | |
5517 | ||
66d8f3dd | 5518 | void btrfs_init_block_rsv(struct btrfs_block_rsv *rsv, unsigned short type) |
9ed74f2d | 5519 | { |
f0486c68 YZ |
5520 | memset(rsv, 0, sizeof(*rsv)); |
5521 | spin_lock_init(&rsv->lock); | |
66d8f3dd | 5522 | rsv->type = type; |
f0486c68 YZ |
5523 | } |
5524 | ||
2ff7e61e | 5525 | struct btrfs_block_rsv *btrfs_alloc_block_rsv(struct btrfs_fs_info *fs_info, |
66d8f3dd | 5526 | unsigned short type) |
f0486c68 YZ |
5527 | { |
5528 | struct btrfs_block_rsv *block_rsv; | |
9ed74f2d | 5529 | |
f0486c68 YZ |
5530 | block_rsv = kmalloc(sizeof(*block_rsv), GFP_NOFS); |
5531 | if (!block_rsv) | |
5532 | return NULL; | |
9ed74f2d | 5533 | |
66d8f3dd | 5534 | btrfs_init_block_rsv(block_rsv, type); |
f0486c68 YZ |
5535 | block_rsv->space_info = __find_space_info(fs_info, |
5536 | BTRFS_BLOCK_GROUP_METADATA); | |
f0486c68 YZ |
5537 | return block_rsv; |
5538 | } | |
9ed74f2d | 5539 | |
2ff7e61e | 5540 | void btrfs_free_block_rsv(struct btrfs_fs_info *fs_info, |
f0486c68 YZ |
5541 | struct btrfs_block_rsv *rsv) |
5542 | { | |
2aaa6655 JB |
5543 | if (!rsv) |
5544 | return; | |
2ff7e61e | 5545 | btrfs_block_rsv_release(fs_info, rsv, (u64)-1); |
dabdb640 | 5546 | kfree(rsv); |
9ed74f2d JB |
5547 | } |
5548 | ||
cdfb080e CM |
5549 | void __btrfs_free_block_rsv(struct btrfs_block_rsv *rsv) |
5550 | { | |
5551 | kfree(rsv); | |
5552 | } | |
5553 | ||
08e007d2 MX |
5554 | int btrfs_block_rsv_add(struct btrfs_root *root, |
5555 | struct btrfs_block_rsv *block_rsv, u64 num_bytes, | |
5556 | enum btrfs_reserve_flush_enum flush) | |
9ed74f2d | 5557 | { |
f0486c68 | 5558 | int ret; |
9ed74f2d | 5559 | |
f0486c68 YZ |
5560 | if (num_bytes == 0) |
5561 | return 0; | |
8bb8ab2e | 5562 | |
61b520a9 | 5563 | ret = reserve_metadata_bytes(root, block_rsv, num_bytes, flush); |
f0486c68 YZ |
5564 | if (!ret) { |
5565 | block_rsv_add_bytes(block_rsv, num_bytes, 1); | |
5566 | return 0; | |
5567 | } | |
9ed74f2d | 5568 | |
f0486c68 | 5569 | return ret; |
f0486c68 | 5570 | } |
9ed74f2d | 5571 | |
2ff7e61e | 5572 | int btrfs_block_rsv_check(struct btrfs_block_rsv *block_rsv, int min_factor) |
f0486c68 YZ |
5573 | { |
5574 | u64 num_bytes = 0; | |
f0486c68 | 5575 | int ret = -ENOSPC; |
9ed74f2d | 5576 | |
f0486c68 YZ |
5577 | if (!block_rsv) |
5578 | return 0; | |
9ed74f2d | 5579 | |
f0486c68 | 5580 | spin_lock(&block_rsv->lock); |
36ba022a JB |
5581 | num_bytes = div_factor(block_rsv->size, min_factor); |
5582 | if (block_rsv->reserved >= num_bytes) | |
5583 | ret = 0; | |
5584 | spin_unlock(&block_rsv->lock); | |
9ed74f2d | 5585 | |
36ba022a JB |
5586 | return ret; |
5587 | } | |
5588 | ||
08e007d2 MX |
5589 | int btrfs_block_rsv_refill(struct btrfs_root *root, |
5590 | struct btrfs_block_rsv *block_rsv, u64 min_reserved, | |
5591 | enum btrfs_reserve_flush_enum flush) | |
36ba022a JB |
5592 | { |
5593 | u64 num_bytes = 0; | |
5594 | int ret = -ENOSPC; | |
5595 | ||
5596 | if (!block_rsv) | |
5597 | return 0; | |
5598 | ||
5599 | spin_lock(&block_rsv->lock); | |
5600 | num_bytes = min_reserved; | |
13553e52 | 5601 | if (block_rsv->reserved >= num_bytes) |
f0486c68 | 5602 | ret = 0; |
13553e52 | 5603 | else |
f0486c68 | 5604 | num_bytes -= block_rsv->reserved; |
f0486c68 | 5605 | spin_unlock(&block_rsv->lock); |
13553e52 | 5606 | |
f0486c68 YZ |
5607 | if (!ret) |
5608 | return 0; | |
5609 | ||
aa38a711 | 5610 | ret = reserve_metadata_bytes(root, block_rsv, num_bytes, flush); |
dabdb640 JB |
5611 | if (!ret) { |
5612 | block_rsv_add_bytes(block_rsv, num_bytes, 0); | |
f0486c68 | 5613 | return 0; |
6a63209f | 5614 | } |
9ed74f2d | 5615 | |
13553e52 | 5616 | return ret; |
f0486c68 YZ |
5617 | } |
5618 | ||
2ff7e61e | 5619 | void btrfs_block_rsv_release(struct btrfs_fs_info *fs_info, |
f0486c68 YZ |
5620 | struct btrfs_block_rsv *block_rsv, |
5621 | u64 num_bytes) | |
5622 | { | |
0b246afa JM |
5623 | struct btrfs_block_rsv *global_rsv = &fs_info->global_block_rsv; |
5624 | ||
17504584 | 5625 | if (global_rsv == block_rsv || |
f0486c68 YZ |
5626 | block_rsv->space_info != global_rsv->space_info) |
5627 | global_rsv = NULL; | |
0b246afa | 5628 | block_rsv_release_bytes(fs_info, block_rsv, global_rsv, num_bytes); |
6a63209f JB |
5629 | } |
5630 | ||
8929ecfa YZ |
5631 | static void update_global_block_rsv(struct btrfs_fs_info *fs_info) |
5632 | { | |
5633 | struct btrfs_block_rsv *block_rsv = &fs_info->global_block_rsv; | |
5634 | struct btrfs_space_info *sinfo = block_rsv->space_info; | |
5635 | u64 num_bytes; | |
6a63209f | 5636 | |
ae2e4728 JB |
5637 | /* |
5638 | * The global block rsv is based on the size of the extent tree, the | |
5639 | * checksum tree and the root tree. If the fs is empty we want to set | |
5640 | * it to a minimal amount for safety. | |
5641 | */ | |
5642 | num_bytes = btrfs_root_used(&fs_info->extent_root->root_item) + | |
5643 | btrfs_root_used(&fs_info->csum_root->root_item) + | |
5644 | btrfs_root_used(&fs_info->tree_root->root_item); | |
5645 | num_bytes = max_t(u64, num_bytes, SZ_16M); | |
33b4d47f | 5646 | |
8929ecfa | 5647 | spin_lock(&sinfo->lock); |
1f699d38 | 5648 | spin_lock(&block_rsv->lock); |
4e06bdd6 | 5649 | |
ee22184b | 5650 | block_rsv->size = min_t(u64, num_bytes, SZ_512M); |
4e06bdd6 | 5651 | |
fb4b10e5 | 5652 | if (block_rsv->reserved < block_rsv->size) { |
4136135b | 5653 | num_bytes = btrfs_space_info_used(sinfo, true); |
fb4b10e5 JB |
5654 | if (sinfo->total_bytes > num_bytes) { |
5655 | num_bytes = sinfo->total_bytes - num_bytes; | |
5656 | num_bytes = min(num_bytes, | |
5657 | block_rsv->size - block_rsv->reserved); | |
5658 | block_rsv->reserved += num_bytes; | |
5659 | sinfo->bytes_may_use += num_bytes; | |
5660 | trace_btrfs_space_reservation(fs_info, "space_info", | |
5661 | sinfo->flags, num_bytes, | |
5662 | 1); | |
5663 | } | |
5664 | } else if (block_rsv->reserved > block_rsv->size) { | |
8929ecfa | 5665 | num_bytes = block_rsv->reserved - block_rsv->size; |
fb25e914 | 5666 | sinfo->bytes_may_use -= num_bytes; |
8c2a3ca2 | 5667 | trace_btrfs_space_reservation(fs_info, "space_info", |
2bcc0328 | 5668 | sinfo->flags, num_bytes, 0); |
8929ecfa | 5669 | block_rsv->reserved = block_rsv->size; |
8929ecfa | 5670 | } |
182608c8 | 5671 | |
fb4b10e5 JB |
5672 | if (block_rsv->reserved == block_rsv->size) |
5673 | block_rsv->full = 1; | |
5674 | else | |
5675 | block_rsv->full = 0; | |
5676 | ||
8929ecfa | 5677 | spin_unlock(&block_rsv->lock); |
1f699d38 | 5678 | spin_unlock(&sinfo->lock); |
6a63209f JB |
5679 | } |
5680 | ||
f0486c68 | 5681 | static void init_global_block_rsv(struct btrfs_fs_info *fs_info) |
6a63209f | 5682 | { |
f0486c68 | 5683 | struct btrfs_space_info *space_info; |
6a63209f | 5684 | |
f0486c68 YZ |
5685 | space_info = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_SYSTEM); |
5686 | fs_info->chunk_block_rsv.space_info = space_info; | |
6a63209f | 5687 | |
f0486c68 | 5688 | space_info = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_METADATA); |
8929ecfa | 5689 | fs_info->global_block_rsv.space_info = space_info; |
8929ecfa | 5690 | fs_info->delalloc_block_rsv.space_info = space_info; |
f0486c68 YZ |
5691 | fs_info->trans_block_rsv.space_info = space_info; |
5692 | fs_info->empty_block_rsv.space_info = space_info; | |
6d668dda | 5693 | fs_info->delayed_block_rsv.space_info = space_info; |
f0486c68 | 5694 | |
8929ecfa YZ |
5695 | fs_info->extent_root->block_rsv = &fs_info->global_block_rsv; |
5696 | fs_info->csum_root->block_rsv = &fs_info->global_block_rsv; | |
5697 | fs_info->dev_root->block_rsv = &fs_info->global_block_rsv; | |
5698 | fs_info->tree_root->block_rsv = &fs_info->global_block_rsv; | |
3a6cad90 SB |
5699 | if (fs_info->quota_root) |
5700 | fs_info->quota_root->block_rsv = &fs_info->global_block_rsv; | |
f0486c68 | 5701 | fs_info->chunk_root->block_rsv = &fs_info->chunk_block_rsv; |
8929ecfa | 5702 | |
8929ecfa | 5703 | update_global_block_rsv(fs_info); |
6a63209f JB |
5704 | } |
5705 | ||
8929ecfa | 5706 | static void release_global_block_rsv(struct btrfs_fs_info *fs_info) |
6a63209f | 5707 | { |
8c2a3ca2 JB |
5708 | block_rsv_release_bytes(fs_info, &fs_info->global_block_rsv, NULL, |
5709 | (u64)-1); | |
8929ecfa YZ |
5710 | WARN_ON(fs_info->delalloc_block_rsv.size > 0); |
5711 | WARN_ON(fs_info->delalloc_block_rsv.reserved > 0); | |
5712 | WARN_ON(fs_info->trans_block_rsv.size > 0); | |
5713 | WARN_ON(fs_info->trans_block_rsv.reserved > 0); | |
5714 | WARN_ON(fs_info->chunk_block_rsv.size > 0); | |
5715 | WARN_ON(fs_info->chunk_block_rsv.reserved > 0); | |
6d668dda JB |
5716 | WARN_ON(fs_info->delayed_block_rsv.size > 0); |
5717 | WARN_ON(fs_info->delayed_block_rsv.reserved > 0); | |
fcb80c2a JB |
5718 | } |
5719 | ||
a22285a6 | 5720 | void btrfs_trans_release_metadata(struct btrfs_trans_handle *trans, |
2ff7e61e | 5721 | struct btrfs_fs_info *fs_info) |
6a63209f | 5722 | { |
0e721106 JB |
5723 | if (!trans->block_rsv) |
5724 | return; | |
5725 | ||
a22285a6 YZ |
5726 | if (!trans->bytes_reserved) |
5727 | return; | |
6a63209f | 5728 | |
0b246afa | 5729 | trace_btrfs_space_reservation(fs_info, "transaction", |
2bcc0328 | 5730 | trans->transid, trans->bytes_reserved, 0); |
2ff7e61e JM |
5731 | btrfs_block_rsv_release(fs_info, trans->block_rsv, |
5732 | trans->bytes_reserved); | |
a22285a6 YZ |
5733 | trans->bytes_reserved = 0; |
5734 | } | |
6a63209f | 5735 | |
4fbcdf66 FM |
5736 | /* |
5737 | * To be called after all the new block groups attached to the transaction | |
5738 | * handle have been created (btrfs_create_pending_block_groups()). | |
5739 | */ | |
5740 | void btrfs_trans_release_chunk_metadata(struct btrfs_trans_handle *trans) | |
5741 | { | |
64b63580 | 5742 | struct btrfs_fs_info *fs_info = trans->fs_info; |
4fbcdf66 FM |
5743 | |
5744 | if (!trans->chunk_bytes_reserved) | |
5745 | return; | |
5746 | ||
5747 | WARN_ON_ONCE(!list_empty(&trans->new_bgs)); | |
5748 | ||
5749 | block_rsv_release_bytes(fs_info, &fs_info->chunk_block_rsv, NULL, | |
5750 | trans->chunk_bytes_reserved); | |
5751 | trans->chunk_bytes_reserved = 0; | |
5752 | } | |
5753 | ||
79787eaa | 5754 | /* Can only return 0 or -ENOSPC */ |
d68fc57b | 5755 | int btrfs_orphan_reserve_metadata(struct btrfs_trans_handle *trans, |
8ed7a2a0 | 5756 | struct btrfs_inode *inode) |
d68fc57b | 5757 | { |
8ed7a2a0 NB |
5758 | struct btrfs_fs_info *fs_info = btrfs_sb(inode->vfs_inode.i_sb); |
5759 | struct btrfs_root *root = inode->root; | |
40acc3ee JB |
5760 | /* |
5761 | * We always use trans->block_rsv here as we will have reserved space | |
5762 | * for our orphan when starting the transaction, using get_block_rsv() | |
5763 | * here will sometimes make us choose the wrong block rsv as we could be | |
5764 | * doing a reloc inode for a non refcounted root. | |
5765 | */ | |
5766 | struct btrfs_block_rsv *src_rsv = trans->block_rsv; | |
d68fc57b YZ |
5767 | struct btrfs_block_rsv *dst_rsv = root->orphan_block_rsv; |
5768 | ||
5769 | /* | |
fcb80c2a JB |
5770 | * We need to hold space in order to delete our orphan item once we've |
5771 | * added it, so this takes the reservation so we can release it later | |
5772 | * when we are truly done with the orphan item. | |
d68fc57b | 5773 | */ |
0b246afa JM |
5774 | u64 num_bytes = btrfs_calc_trans_metadata_size(fs_info, 1); |
5775 | ||
8ed7a2a0 NB |
5776 | trace_btrfs_space_reservation(fs_info, "orphan", btrfs_ino(inode), |
5777 | num_bytes, 1); | |
25d609f8 | 5778 | return btrfs_block_rsv_migrate(src_rsv, dst_rsv, num_bytes, 1); |
6a63209f JB |
5779 | } |
5780 | ||
703b391a | 5781 | void btrfs_orphan_release_metadata(struct btrfs_inode *inode) |
97e728d4 | 5782 | { |
703b391a NB |
5783 | struct btrfs_fs_info *fs_info = btrfs_sb(inode->vfs_inode.i_sb); |
5784 | struct btrfs_root *root = inode->root; | |
0b246afa JM |
5785 | u64 num_bytes = btrfs_calc_trans_metadata_size(fs_info, 1); |
5786 | ||
703b391a NB |
5787 | trace_btrfs_space_reservation(fs_info, "orphan", btrfs_ino(inode), |
5788 | num_bytes, 0); | |
2ff7e61e | 5789 | btrfs_block_rsv_release(fs_info, root->orphan_block_rsv, num_bytes); |
d68fc57b | 5790 | } |
97e728d4 | 5791 | |
d5c12070 MX |
5792 | /* |
5793 | * btrfs_subvolume_reserve_metadata() - reserve space for subvolume operation | |
5794 | * root: the root of the parent directory | |
5795 | * rsv: block reservation | |
5796 | * items: the number of items that we need do reservation | |
5797 | * qgroup_reserved: used to return the reserved size in qgroup | |
5798 | * | |
5799 | * This function is used to reserve the space for snapshot/subvolume | |
5800 | * creation and deletion. Those operations are different with the | |
5801 | * common file/directory operations, they change two fs/file trees | |
5802 | * and root tree, the number of items that the qgroup reserves is | |
5803 | * different with the free space reservation. So we can not use | |
01327610 | 5804 | * the space reservation mechanism in start_transaction(). |
d5c12070 MX |
5805 | */ |
5806 | int btrfs_subvolume_reserve_metadata(struct btrfs_root *root, | |
5807 | struct btrfs_block_rsv *rsv, | |
5808 | int items, | |
ee3441b4 JM |
5809 | u64 *qgroup_reserved, |
5810 | bool use_global_rsv) | |
a22285a6 | 5811 | { |
d5c12070 MX |
5812 | u64 num_bytes; |
5813 | int ret; | |
0b246afa JM |
5814 | struct btrfs_fs_info *fs_info = root->fs_info; |
5815 | struct btrfs_block_rsv *global_rsv = &fs_info->global_block_rsv; | |
d5c12070 | 5816 | |
0b246afa | 5817 | if (test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags)) { |
d5c12070 | 5818 | /* One for parent inode, two for dir entries */ |
0b246afa | 5819 | num_bytes = 3 * fs_info->nodesize; |
003d7c59 | 5820 | ret = btrfs_qgroup_reserve_meta(root, num_bytes, true); |
d5c12070 MX |
5821 | if (ret) |
5822 | return ret; | |
5823 | } else { | |
5824 | num_bytes = 0; | |
5825 | } | |
5826 | ||
5827 | *qgroup_reserved = num_bytes; | |
5828 | ||
0b246afa JM |
5829 | num_bytes = btrfs_calc_trans_metadata_size(fs_info, items); |
5830 | rsv->space_info = __find_space_info(fs_info, | |
d5c12070 MX |
5831 | BTRFS_BLOCK_GROUP_METADATA); |
5832 | ret = btrfs_block_rsv_add(root, rsv, num_bytes, | |
5833 | BTRFS_RESERVE_FLUSH_ALL); | |
ee3441b4 JM |
5834 | |
5835 | if (ret == -ENOSPC && use_global_rsv) | |
25d609f8 | 5836 | ret = btrfs_block_rsv_migrate(global_rsv, rsv, num_bytes, 1); |
ee3441b4 | 5837 | |
7174109c QW |
5838 | if (ret && *qgroup_reserved) |
5839 | btrfs_qgroup_free_meta(root, *qgroup_reserved); | |
d5c12070 MX |
5840 | |
5841 | return ret; | |
5842 | } | |
5843 | ||
2ff7e61e | 5844 | void btrfs_subvolume_release_metadata(struct btrfs_fs_info *fs_info, |
7775c818 | 5845 | struct btrfs_block_rsv *rsv) |
d5c12070 | 5846 | { |
2ff7e61e | 5847 | btrfs_block_rsv_release(fs_info, rsv, (u64)-1); |
97e728d4 JB |
5848 | } |
5849 | ||
7709cde3 JB |
5850 | /** |
5851 | * drop_outstanding_extent - drop an outstanding extent | |
5852 | * @inode: the inode we're dropping the extent for | |
01327610 | 5853 | * @num_bytes: the number of bytes we're releasing. |
7709cde3 JB |
5854 | * |
5855 | * This is called when we are freeing up an outstanding extent, either called | |
5856 | * after an error or after an extent is written. This will return the number of | |
5857 | * reserved extents that need to be freed. This must be called with | |
5858 | * BTRFS_I(inode)->lock held. | |
5859 | */ | |
baa3ba39 NB |
5860 | static unsigned drop_outstanding_extent(struct btrfs_inode *inode, |
5861 | u64 num_bytes) | |
9e0baf60 | 5862 | { |
7fd2ae21 | 5863 | unsigned drop_inode_space = 0; |
9e0baf60 | 5864 | unsigned dropped_extents = 0; |
823bb20a | 5865 | unsigned num_extents; |
9e0baf60 | 5866 | |
823bb20a | 5867 | num_extents = count_max_extents(num_bytes); |
dcab6a3b | 5868 | ASSERT(num_extents); |
baa3ba39 NB |
5869 | ASSERT(inode->outstanding_extents >= num_extents); |
5870 | inode->outstanding_extents -= num_extents; | |
9e0baf60 | 5871 | |
baa3ba39 | 5872 | if (inode->outstanding_extents == 0 && |
72ac3c0d | 5873 | test_and_clear_bit(BTRFS_INODE_DELALLOC_META_RESERVED, |
baa3ba39 | 5874 | &inode->runtime_flags)) |
7fd2ae21 | 5875 | drop_inode_space = 1; |
7fd2ae21 | 5876 | |
9e0baf60 | 5877 | /* |
01327610 | 5878 | * If we have more or the same amount of outstanding extents than we have |
9e0baf60 JB |
5879 | * reserved then we need to leave the reserved extents count alone. |
5880 | */ | |
baa3ba39 | 5881 | if (inode->outstanding_extents >= inode->reserved_extents) |
7fd2ae21 | 5882 | return drop_inode_space; |
9e0baf60 | 5883 | |
baa3ba39 NB |
5884 | dropped_extents = inode->reserved_extents - inode->outstanding_extents; |
5885 | inode->reserved_extents -= dropped_extents; | |
7fd2ae21 | 5886 | return dropped_extents + drop_inode_space; |
9e0baf60 JB |
5887 | } |
5888 | ||
7709cde3 | 5889 | /** |
01327610 NS |
5890 | * calc_csum_metadata_size - return the amount of metadata space that must be |
5891 | * reserved/freed for the given bytes. | |
7709cde3 JB |
5892 | * @inode: the inode we're manipulating |
5893 | * @num_bytes: the number of bytes in question | |
5894 | * @reserve: 1 if we are reserving space, 0 if we are freeing space | |
5895 | * | |
5896 | * This adjusts the number of csum_bytes in the inode and then returns the | |
5897 | * correct amount of metadata that must either be reserved or freed. We | |
5898 | * calculate how many checksums we can fit into one leaf and then divide the | |
5899 | * number of bytes that will need to be checksumed by this value to figure out | |
5900 | * how many checksums will be required. If we are adding bytes then the number | |
5901 | * may go up and we will return the number of additional bytes that must be | |
5902 | * reserved. If it is going down we will return the number of bytes that must | |
5903 | * be freed. | |
5904 | * | |
5905 | * This must be called with BTRFS_I(inode)->lock held. | |
5906 | */ | |
0e6bf9b1 | 5907 | static u64 calc_csum_metadata_size(struct btrfs_inode *inode, u64 num_bytes, |
7709cde3 | 5908 | int reserve) |
6324fbf3 | 5909 | { |
0e6bf9b1 | 5910 | struct btrfs_fs_info *fs_info = btrfs_sb(inode->vfs_inode.i_sb); |
1262133b | 5911 | u64 old_csums, num_csums; |
7709cde3 | 5912 | |
0e6bf9b1 | 5913 | if (inode->flags & BTRFS_INODE_NODATASUM && inode->csum_bytes == 0) |
7709cde3 JB |
5914 | return 0; |
5915 | ||
0e6bf9b1 | 5916 | old_csums = btrfs_csum_bytes_to_leaves(fs_info, inode->csum_bytes); |
7709cde3 | 5917 | if (reserve) |
0e6bf9b1 | 5918 | inode->csum_bytes += num_bytes; |
7709cde3 | 5919 | else |
0e6bf9b1 NB |
5920 | inode->csum_bytes -= num_bytes; |
5921 | num_csums = btrfs_csum_bytes_to_leaves(fs_info, inode->csum_bytes); | |
7709cde3 JB |
5922 | |
5923 | /* No change, no need to reserve more */ | |
5924 | if (old_csums == num_csums) | |
5925 | return 0; | |
5926 | ||
5927 | if (reserve) | |
0b246afa | 5928 | return btrfs_calc_trans_metadata_size(fs_info, |
7709cde3 JB |
5929 | num_csums - old_csums); |
5930 | ||
0b246afa | 5931 | return btrfs_calc_trans_metadata_size(fs_info, old_csums - num_csums); |
0ca1f7ce | 5932 | } |
c146afad | 5933 | |
9f3db423 | 5934 | int btrfs_delalloc_reserve_metadata(struct btrfs_inode *inode, u64 num_bytes) |
0ca1f7ce | 5935 | { |
9f3db423 NB |
5936 | struct btrfs_fs_info *fs_info = btrfs_sb(inode->vfs_inode.i_sb); |
5937 | struct btrfs_root *root = inode->root; | |
0b246afa | 5938 | struct btrfs_block_rsv *block_rsv = &fs_info->delalloc_block_rsv; |
9e0baf60 | 5939 | u64 to_reserve = 0; |
660d3f6c | 5940 | u64 csum_bytes; |
823bb20a | 5941 | unsigned nr_extents; |
08e007d2 | 5942 | enum btrfs_reserve_flush_enum flush = BTRFS_RESERVE_FLUSH_ALL; |
eb6b88d9 | 5943 | int ret = 0; |
c64c2bd8 | 5944 | bool delalloc_lock = true; |
88e081bf WS |
5945 | u64 to_free = 0; |
5946 | unsigned dropped; | |
48c3d480 | 5947 | bool release_extra = false; |
6324fbf3 | 5948 | |
c64c2bd8 JB |
5949 | /* If we are a free space inode we need to not flush since we will be in |
5950 | * the middle of a transaction commit. We also don't need the delalloc | |
5951 | * mutex since we won't race with anybody. We need this mostly to make | |
5952 | * lockdep shut its filthy mouth. | |
bac357dc JB |
5953 | * |
5954 | * If we have a transaction open (can happen if we call truncate_block | |
5955 | * from truncate), then we need FLUSH_LIMIT so we don't deadlock. | |
c64c2bd8 JB |
5956 | */ |
5957 | if (btrfs_is_free_space_inode(inode)) { | |
08e007d2 | 5958 | flush = BTRFS_RESERVE_NO_FLUSH; |
c64c2bd8 | 5959 | delalloc_lock = false; |
bac357dc JB |
5960 | } else if (current->journal_info) { |
5961 | flush = BTRFS_RESERVE_FLUSH_LIMIT; | |
c64c2bd8 | 5962 | } |
c09544e0 | 5963 | |
08e007d2 | 5964 | if (flush != BTRFS_RESERVE_NO_FLUSH && |
0b246afa | 5965 | btrfs_transaction_in_commit(fs_info)) |
0ca1f7ce | 5966 | schedule_timeout(1); |
ec44a35c | 5967 | |
c64c2bd8 | 5968 | if (delalloc_lock) |
9f3db423 | 5969 | mutex_lock(&inode->delalloc_mutex); |
c64c2bd8 | 5970 | |
0b246afa | 5971 | num_bytes = ALIGN(num_bytes, fs_info->sectorsize); |
8bb8ab2e | 5972 | |
9f3db423 | 5973 | spin_lock(&inode->lock); |
823bb20a | 5974 | nr_extents = count_max_extents(num_bytes); |
9f3db423 | 5975 | inode->outstanding_extents += nr_extents; |
9e0baf60 | 5976 | |
48c3d480 | 5977 | nr_extents = 0; |
9f3db423 NB |
5978 | if (inode->outstanding_extents > inode->reserved_extents) |
5979 | nr_extents += inode->outstanding_extents - | |
5980 | inode->reserved_extents; | |
57a45ced | 5981 | |
48c3d480 | 5982 | /* We always want to reserve a slot for updating the inode. */ |
0b246afa | 5983 | to_reserve = btrfs_calc_trans_metadata_size(fs_info, nr_extents + 1); |
7709cde3 | 5984 | to_reserve += calc_csum_metadata_size(inode, num_bytes, 1); |
9f3db423 NB |
5985 | csum_bytes = inode->csum_bytes; |
5986 | spin_unlock(&inode->lock); | |
57a45ced | 5987 | |
0b246afa | 5988 | if (test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags)) { |
7174109c | 5989 | ret = btrfs_qgroup_reserve_meta(root, |
003d7c59 | 5990 | nr_extents * fs_info->nodesize, true); |
88e081bf WS |
5991 | if (ret) |
5992 | goto out_fail; | |
5993 | } | |
c5567237 | 5994 | |
48c3d480 | 5995 | ret = btrfs_block_rsv_add(root, block_rsv, to_reserve, flush); |
88e081bf | 5996 | if (unlikely(ret)) { |
da17066c | 5997 | btrfs_qgroup_free_meta(root, |
0b246afa | 5998 | nr_extents * fs_info->nodesize); |
88e081bf | 5999 | goto out_fail; |
9e0baf60 | 6000 | } |
25179201 | 6001 | |
9f3db423 | 6002 | spin_lock(&inode->lock); |
48c3d480 | 6003 | if (test_and_set_bit(BTRFS_INODE_DELALLOC_META_RESERVED, |
9f3db423 | 6004 | &inode->runtime_flags)) { |
0b246afa | 6005 | to_reserve -= btrfs_calc_trans_metadata_size(fs_info, 1); |
48c3d480 | 6006 | release_extra = true; |
660d3f6c | 6007 | } |
9f3db423 NB |
6008 | inode->reserved_extents += nr_extents; |
6009 | spin_unlock(&inode->lock); | |
c64c2bd8 JB |
6010 | |
6011 | if (delalloc_lock) | |
9f3db423 | 6012 | mutex_unlock(&inode->delalloc_mutex); |
660d3f6c | 6013 | |
8c2a3ca2 | 6014 | if (to_reserve) |
0b246afa | 6015 | trace_btrfs_space_reservation(fs_info, "delalloc", |
9f3db423 | 6016 | btrfs_ino(inode), to_reserve, 1); |
48c3d480 | 6017 | if (release_extra) |
2ff7e61e | 6018 | btrfs_block_rsv_release(fs_info, block_rsv, |
0b246afa | 6019 | btrfs_calc_trans_metadata_size(fs_info, 1)); |
0ca1f7ce | 6020 | return 0; |
88e081bf WS |
6021 | |
6022 | out_fail: | |
9f3db423 | 6023 | spin_lock(&inode->lock); |
dcab6a3b | 6024 | dropped = drop_outstanding_extent(inode, num_bytes); |
88e081bf WS |
6025 | /* |
6026 | * If the inodes csum_bytes is the same as the original | |
6027 | * csum_bytes then we know we haven't raced with any free()ers | |
6028 | * so we can just reduce our inodes csum bytes and carry on. | |
88e081bf | 6029 | */ |
9f3db423 | 6030 | if (inode->csum_bytes == csum_bytes) { |
88e081bf | 6031 | calc_csum_metadata_size(inode, num_bytes, 0); |
f4881bc7 | 6032 | } else { |
9f3db423 | 6033 | u64 orig_csum_bytes = inode->csum_bytes; |
f4881bc7 JB |
6034 | u64 bytes; |
6035 | ||
6036 | /* | |
6037 | * This is tricky, but first we need to figure out how much we | |
01327610 | 6038 | * freed from any free-ers that occurred during this |
f4881bc7 JB |
6039 | * reservation, so we reset ->csum_bytes to the csum_bytes |
6040 | * before we dropped our lock, and then call the free for the | |
6041 | * number of bytes that were freed while we were trying our | |
6042 | * reservation. | |
6043 | */ | |
9f3db423 NB |
6044 | bytes = csum_bytes - inode->csum_bytes; |
6045 | inode->csum_bytes = csum_bytes; | |
f4881bc7 JB |
6046 | to_free = calc_csum_metadata_size(inode, bytes, 0); |
6047 | ||
6048 | ||
6049 | /* | |
6050 | * Now we need to see how much we would have freed had we not | |
6051 | * been making this reservation and our ->csum_bytes were not | |
6052 | * artificially inflated. | |
6053 | */ | |
9f3db423 | 6054 | inode->csum_bytes = csum_bytes - num_bytes; |
f4881bc7 JB |
6055 | bytes = csum_bytes - orig_csum_bytes; |
6056 | bytes = calc_csum_metadata_size(inode, bytes, 0); | |
6057 | ||
6058 | /* | |
6059 | * Now reset ->csum_bytes to what it should be. If bytes is | |
01327610 | 6060 | * more than to_free then we would have freed more space had we |
f4881bc7 JB |
6061 | * not had an artificially high ->csum_bytes, so we need to free |
6062 | * the remainder. If bytes is the same or less then we don't | |
6063 | * need to do anything, the other free-ers did the correct | |
6064 | * thing. | |
6065 | */ | |
9f3db423 | 6066 | inode->csum_bytes = orig_csum_bytes - num_bytes; |
f4881bc7 JB |
6067 | if (bytes > to_free) |
6068 | to_free = bytes - to_free; | |
6069 | else | |
6070 | to_free = 0; | |
6071 | } | |
9f3db423 | 6072 | spin_unlock(&inode->lock); |
e2d1f923 | 6073 | if (dropped) |
0b246afa | 6074 | to_free += btrfs_calc_trans_metadata_size(fs_info, dropped); |
88e081bf WS |
6075 | |
6076 | if (to_free) { | |
2ff7e61e | 6077 | btrfs_block_rsv_release(fs_info, block_rsv, to_free); |
0b246afa | 6078 | trace_btrfs_space_reservation(fs_info, "delalloc", |
9f3db423 | 6079 | btrfs_ino(inode), to_free, 0); |
88e081bf WS |
6080 | } |
6081 | if (delalloc_lock) | |
9f3db423 | 6082 | mutex_unlock(&inode->delalloc_mutex); |
88e081bf | 6083 | return ret; |
0ca1f7ce YZ |
6084 | } |
6085 | ||
7709cde3 JB |
6086 | /** |
6087 | * btrfs_delalloc_release_metadata - release a metadata reservation for an inode | |
6088 | * @inode: the inode to release the reservation for | |
6089 | * @num_bytes: the number of bytes we're releasing | |
6090 | * | |
6091 | * This will release the metadata reservation for an inode. This can be called | |
6092 | * once we complete IO for a given set of bytes to release their metadata | |
6093 | * reservations. | |
6094 | */ | |
691fa059 | 6095 | void btrfs_delalloc_release_metadata(struct btrfs_inode *inode, u64 num_bytes) |
0ca1f7ce | 6096 | { |
691fa059 | 6097 | struct btrfs_fs_info *fs_info = btrfs_sb(inode->vfs_inode.i_sb); |
9e0baf60 JB |
6098 | u64 to_free = 0; |
6099 | unsigned dropped; | |
0ca1f7ce | 6100 | |
0b246afa | 6101 | num_bytes = ALIGN(num_bytes, fs_info->sectorsize); |
691fa059 | 6102 | spin_lock(&inode->lock); |
dcab6a3b | 6103 | dropped = drop_outstanding_extent(inode, num_bytes); |
97e728d4 | 6104 | |
0934856d MX |
6105 | if (num_bytes) |
6106 | to_free = calc_csum_metadata_size(inode, num_bytes, 0); | |
691fa059 | 6107 | spin_unlock(&inode->lock); |
9e0baf60 | 6108 | if (dropped > 0) |
0b246afa | 6109 | to_free += btrfs_calc_trans_metadata_size(fs_info, dropped); |
0ca1f7ce | 6110 | |
0b246afa | 6111 | if (btrfs_is_testing(fs_info)) |
6a3891c5 JB |
6112 | return; |
6113 | ||
691fa059 NB |
6114 | trace_btrfs_space_reservation(fs_info, "delalloc", btrfs_ino(inode), |
6115 | to_free, 0); | |
c5567237 | 6116 | |
2ff7e61e | 6117 | btrfs_block_rsv_release(fs_info, &fs_info->delalloc_block_rsv, to_free); |
0ca1f7ce YZ |
6118 | } |
6119 | ||
1ada3a62 | 6120 | /** |
7cf5b976 | 6121 | * btrfs_delalloc_reserve_space - reserve data and metadata space for |
1ada3a62 QW |
6122 | * delalloc |
6123 | * @inode: inode we're writing to | |
6124 | * @start: start range we are writing to | |
6125 | * @len: how long the range we are writing to | |
6126 | * | |
1ada3a62 QW |
6127 | * This will do the following things |
6128 | * | |
6129 | * o reserve space in data space info for num bytes | |
6130 | * and reserve precious corresponding qgroup space | |
6131 | * (Done in check_data_free_space) | |
6132 | * | |
6133 | * o reserve space for metadata space, based on the number of outstanding | |
6134 | * extents and how much csums will be needed | |
6135 | * also reserve metadata space in a per root over-reserve method. | |
6136 | * o add to the inodes->delalloc_bytes | |
6137 | * o add it to the fs_info's delalloc inodes list. | |
6138 | * (Above 3 all done in delalloc_reserve_metadata) | |
6139 | * | |
6140 | * Return 0 for success | |
6141 | * Return <0 for error(-ENOSPC or -EQUOT) | |
6142 | */ | |
7cf5b976 | 6143 | int btrfs_delalloc_reserve_space(struct inode *inode, u64 start, u64 len) |
1ada3a62 QW |
6144 | { |
6145 | int ret; | |
6146 | ||
7cf5b976 | 6147 | ret = btrfs_check_data_free_space(inode, start, len); |
1ada3a62 QW |
6148 | if (ret < 0) |
6149 | return ret; | |
9f3db423 | 6150 | ret = btrfs_delalloc_reserve_metadata(BTRFS_I(inode), len); |
1ada3a62 | 6151 | if (ret < 0) |
7cf5b976 | 6152 | btrfs_free_reserved_data_space(inode, start, len); |
1ada3a62 QW |
6153 | return ret; |
6154 | } | |
6155 | ||
7709cde3 | 6156 | /** |
7cf5b976 | 6157 | * btrfs_delalloc_release_space - release data and metadata space for delalloc |
1ada3a62 QW |
6158 | * @inode: inode we're releasing space for |
6159 | * @start: start position of the space already reserved | |
6160 | * @len: the len of the space already reserved | |
6161 | * | |
6162 | * This must be matched with a call to btrfs_delalloc_reserve_space. This is | |
6163 | * called in the case that we don't need the metadata AND data reservations | |
6164 | * anymore. So if there is an error or we insert an inline extent. | |
6165 | * | |
6166 | * This function will release the metadata space that was not used and will | |
6167 | * decrement ->delalloc_bytes and remove it from the fs_info delalloc_inodes | |
6168 | * list if there are no delalloc bytes left. | |
6169 | * Also it will handle the qgroup reserved space. | |
6170 | */ | |
7cf5b976 | 6171 | void btrfs_delalloc_release_space(struct inode *inode, u64 start, u64 len) |
1ada3a62 | 6172 | { |
691fa059 | 6173 | btrfs_delalloc_release_metadata(BTRFS_I(inode), len); |
7cf5b976 | 6174 | btrfs_free_reserved_data_space(inode, start, len); |
6324fbf3 CM |
6175 | } |
6176 | ||
ce93ec54 | 6177 | static int update_block_group(struct btrfs_trans_handle *trans, |
6202df69 | 6178 | struct btrfs_fs_info *info, u64 bytenr, |
ce93ec54 | 6179 | u64 num_bytes, int alloc) |
9078a3e1 | 6180 | { |
0af3d00b | 6181 | struct btrfs_block_group_cache *cache = NULL; |
db94535d | 6182 | u64 total = num_bytes; |
9078a3e1 | 6183 | u64 old_val; |
db94535d | 6184 | u64 byte_in_group; |
0af3d00b | 6185 | int factor; |
3e1ad54f | 6186 | |
5d4f98a2 | 6187 | /* block accounting for super block */ |
eb73c1b7 | 6188 | spin_lock(&info->delalloc_root_lock); |
6c41761f | 6189 | old_val = btrfs_super_bytes_used(info->super_copy); |
5d4f98a2 YZ |
6190 | if (alloc) |
6191 | old_val += num_bytes; | |
6192 | else | |
6193 | old_val -= num_bytes; | |
6c41761f | 6194 | btrfs_set_super_bytes_used(info->super_copy, old_val); |
eb73c1b7 | 6195 | spin_unlock(&info->delalloc_root_lock); |
5d4f98a2 | 6196 | |
d397712b | 6197 | while (total) { |
db94535d | 6198 | cache = btrfs_lookup_block_group(info, bytenr); |
f3465ca4 | 6199 | if (!cache) |
79787eaa | 6200 | return -ENOENT; |
b742bb82 YZ |
6201 | if (cache->flags & (BTRFS_BLOCK_GROUP_DUP | |
6202 | BTRFS_BLOCK_GROUP_RAID1 | | |
6203 | BTRFS_BLOCK_GROUP_RAID10)) | |
6204 | factor = 2; | |
6205 | else | |
6206 | factor = 1; | |
9d66e233 JB |
6207 | /* |
6208 | * If this block group has free space cache written out, we | |
6209 | * need to make sure to load it if we are removing space. This | |
6210 | * is because we need the unpinning stage to actually add the | |
6211 | * space back to the block group, otherwise we will leak space. | |
6212 | */ | |
6213 | if (!alloc && cache->cached == BTRFS_CACHE_NO) | |
f6373bf3 | 6214 | cache_block_group(cache, 1); |
0af3d00b | 6215 | |
db94535d CM |
6216 | byte_in_group = bytenr - cache->key.objectid; |
6217 | WARN_ON(byte_in_group > cache->key.offset); | |
9078a3e1 | 6218 | |
25179201 | 6219 | spin_lock(&cache->space_info->lock); |
c286ac48 | 6220 | spin_lock(&cache->lock); |
0af3d00b | 6221 | |
6202df69 | 6222 | if (btrfs_test_opt(info, SPACE_CACHE) && |
0af3d00b JB |
6223 | cache->disk_cache_state < BTRFS_DC_CLEAR) |
6224 | cache->disk_cache_state = BTRFS_DC_CLEAR; | |
6225 | ||
9078a3e1 | 6226 | old_val = btrfs_block_group_used(&cache->item); |
db94535d | 6227 | num_bytes = min(total, cache->key.offset - byte_in_group); |
cd1bc465 | 6228 | if (alloc) { |
db94535d | 6229 | old_val += num_bytes; |
11833d66 YZ |
6230 | btrfs_set_block_group_used(&cache->item, old_val); |
6231 | cache->reserved -= num_bytes; | |
11833d66 | 6232 | cache->space_info->bytes_reserved -= num_bytes; |
b742bb82 YZ |
6233 | cache->space_info->bytes_used += num_bytes; |
6234 | cache->space_info->disk_used += num_bytes * factor; | |
c286ac48 | 6235 | spin_unlock(&cache->lock); |
25179201 | 6236 | spin_unlock(&cache->space_info->lock); |
cd1bc465 | 6237 | } else { |
db94535d | 6238 | old_val -= num_bytes; |
ae0ab003 FM |
6239 | btrfs_set_block_group_used(&cache->item, old_val); |
6240 | cache->pinned += num_bytes; | |
6241 | cache->space_info->bytes_pinned += num_bytes; | |
6242 | cache->space_info->bytes_used -= num_bytes; | |
6243 | cache->space_info->disk_used -= num_bytes * factor; | |
6244 | spin_unlock(&cache->lock); | |
6245 | spin_unlock(&cache->space_info->lock); | |
47ab2a6c | 6246 | |
0b246afa | 6247 | trace_btrfs_space_reservation(info, "pinned", |
c51e7bb1 JB |
6248 | cache->space_info->flags, |
6249 | num_bytes, 1); | |
ae0ab003 FM |
6250 | set_extent_dirty(info->pinned_extents, |
6251 | bytenr, bytenr + num_bytes - 1, | |
6252 | GFP_NOFS | __GFP_NOFAIL); | |
cd1bc465 | 6253 | } |
1bbc621e CM |
6254 | |
6255 | spin_lock(&trans->transaction->dirty_bgs_lock); | |
6256 | if (list_empty(&cache->dirty_list)) { | |
6257 | list_add_tail(&cache->dirty_list, | |
6258 | &trans->transaction->dirty_bgs); | |
6259 | trans->transaction->num_dirty_bgs++; | |
6260 | btrfs_get_block_group(cache); | |
6261 | } | |
6262 | spin_unlock(&trans->transaction->dirty_bgs_lock); | |
6263 | ||
036a9348 FM |
6264 | /* |
6265 | * No longer have used bytes in this block group, queue it for | |
6266 | * deletion. We do this after adding the block group to the | |
6267 | * dirty list to avoid races between cleaner kthread and space | |
6268 | * cache writeout. | |
6269 | */ | |
6270 | if (!alloc && old_val == 0) { | |
6271 | spin_lock(&info->unused_bgs_lock); | |
6272 | if (list_empty(&cache->bg_list)) { | |
6273 | btrfs_get_block_group(cache); | |
6274 | list_add_tail(&cache->bg_list, | |
6275 | &info->unused_bgs); | |
6276 | } | |
6277 | spin_unlock(&info->unused_bgs_lock); | |
6278 | } | |
6279 | ||
fa9c0d79 | 6280 | btrfs_put_block_group(cache); |
db94535d CM |
6281 | total -= num_bytes; |
6282 | bytenr += num_bytes; | |
9078a3e1 CM |
6283 | } |
6284 | return 0; | |
6285 | } | |
6324fbf3 | 6286 | |
2ff7e61e | 6287 | static u64 first_logical_byte(struct btrfs_fs_info *fs_info, u64 search_start) |
a061fc8d | 6288 | { |
0f9dd46c | 6289 | struct btrfs_block_group_cache *cache; |
d2fb3437 | 6290 | u64 bytenr; |
0f9dd46c | 6291 | |
0b246afa JM |
6292 | spin_lock(&fs_info->block_group_cache_lock); |
6293 | bytenr = fs_info->first_logical_byte; | |
6294 | spin_unlock(&fs_info->block_group_cache_lock); | |
a1897fdd LB |
6295 | |
6296 | if (bytenr < (u64)-1) | |
6297 | return bytenr; | |
6298 | ||
0b246afa | 6299 | cache = btrfs_lookup_first_block_group(fs_info, search_start); |
0f9dd46c | 6300 | if (!cache) |
a061fc8d | 6301 | return 0; |
0f9dd46c | 6302 | |
d2fb3437 | 6303 | bytenr = cache->key.objectid; |
fa9c0d79 | 6304 | btrfs_put_block_group(cache); |
d2fb3437 YZ |
6305 | |
6306 | return bytenr; | |
a061fc8d CM |
6307 | } |
6308 | ||
2ff7e61e | 6309 | static int pin_down_extent(struct btrfs_fs_info *fs_info, |
f0486c68 YZ |
6310 | struct btrfs_block_group_cache *cache, |
6311 | u64 bytenr, u64 num_bytes, int reserved) | |
324ae4df | 6312 | { |
11833d66 YZ |
6313 | spin_lock(&cache->space_info->lock); |
6314 | spin_lock(&cache->lock); | |
6315 | cache->pinned += num_bytes; | |
6316 | cache->space_info->bytes_pinned += num_bytes; | |
6317 | if (reserved) { | |
6318 | cache->reserved -= num_bytes; | |
6319 | cache->space_info->bytes_reserved -= num_bytes; | |
6320 | } | |
6321 | spin_unlock(&cache->lock); | |
6322 | spin_unlock(&cache->space_info->lock); | |
68b38550 | 6323 | |
0b246afa | 6324 | trace_btrfs_space_reservation(fs_info, "pinned", |
c51e7bb1 | 6325 | cache->space_info->flags, num_bytes, 1); |
0b246afa | 6326 | set_extent_dirty(fs_info->pinned_extents, bytenr, |
f0486c68 YZ |
6327 | bytenr + num_bytes - 1, GFP_NOFS | __GFP_NOFAIL); |
6328 | return 0; | |
6329 | } | |
68b38550 | 6330 | |
f0486c68 YZ |
6331 | /* |
6332 | * this function must be called within transaction | |
6333 | */ | |
2ff7e61e | 6334 | int btrfs_pin_extent(struct btrfs_fs_info *fs_info, |
f0486c68 YZ |
6335 | u64 bytenr, u64 num_bytes, int reserved) |
6336 | { | |
6337 | struct btrfs_block_group_cache *cache; | |
68b38550 | 6338 | |
0b246afa | 6339 | cache = btrfs_lookup_block_group(fs_info, bytenr); |
79787eaa | 6340 | BUG_ON(!cache); /* Logic error */ |
f0486c68 | 6341 | |
2ff7e61e | 6342 | pin_down_extent(fs_info, cache, bytenr, num_bytes, reserved); |
f0486c68 YZ |
6343 | |
6344 | btrfs_put_block_group(cache); | |
11833d66 YZ |
6345 | return 0; |
6346 | } | |
6347 | ||
f0486c68 | 6348 | /* |
e688b725 CM |
6349 | * this function must be called within transaction |
6350 | */ | |
2ff7e61e | 6351 | int btrfs_pin_extent_for_log_replay(struct btrfs_fs_info *fs_info, |
e688b725 CM |
6352 | u64 bytenr, u64 num_bytes) |
6353 | { | |
6354 | struct btrfs_block_group_cache *cache; | |
b50c6e25 | 6355 | int ret; |
e688b725 | 6356 | |
0b246afa | 6357 | cache = btrfs_lookup_block_group(fs_info, bytenr); |
b50c6e25 JB |
6358 | if (!cache) |
6359 | return -EINVAL; | |
e688b725 CM |
6360 | |
6361 | /* | |
6362 | * pull in the free space cache (if any) so that our pin | |
6363 | * removes the free space from the cache. We have load_only set | |
6364 | * to one because the slow code to read in the free extents does check | |
6365 | * the pinned extents. | |
6366 | */ | |
f6373bf3 | 6367 | cache_block_group(cache, 1); |
e688b725 | 6368 | |
2ff7e61e | 6369 | pin_down_extent(fs_info, cache, bytenr, num_bytes, 0); |
e688b725 CM |
6370 | |
6371 | /* remove us from the free space cache (if we're there at all) */ | |
b50c6e25 | 6372 | ret = btrfs_remove_free_space(cache, bytenr, num_bytes); |
e688b725 | 6373 | btrfs_put_block_group(cache); |
b50c6e25 | 6374 | return ret; |
e688b725 CM |
6375 | } |
6376 | ||
2ff7e61e JM |
6377 | static int __exclude_logged_extent(struct btrfs_fs_info *fs_info, |
6378 | u64 start, u64 num_bytes) | |
8c2a1a30 JB |
6379 | { |
6380 | int ret; | |
6381 | struct btrfs_block_group_cache *block_group; | |
6382 | struct btrfs_caching_control *caching_ctl; | |
6383 | ||
0b246afa | 6384 | block_group = btrfs_lookup_block_group(fs_info, start); |
8c2a1a30 JB |
6385 | if (!block_group) |
6386 | return -EINVAL; | |
6387 | ||
6388 | cache_block_group(block_group, 0); | |
6389 | caching_ctl = get_caching_control(block_group); | |
6390 | ||
6391 | if (!caching_ctl) { | |
6392 | /* Logic error */ | |
6393 | BUG_ON(!block_group_cache_done(block_group)); | |
6394 | ret = btrfs_remove_free_space(block_group, start, num_bytes); | |
6395 | } else { | |
6396 | mutex_lock(&caching_ctl->mutex); | |
6397 | ||
6398 | if (start >= caching_ctl->progress) { | |
2ff7e61e | 6399 | ret = add_excluded_extent(fs_info, start, num_bytes); |
8c2a1a30 JB |
6400 | } else if (start + num_bytes <= caching_ctl->progress) { |
6401 | ret = btrfs_remove_free_space(block_group, | |
6402 | start, num_bytes); | |
6403 | } else { | |
6404 | num_bytes = caching_ctl->progress - start; | |
6405 | ret = btrfs_remove_free_space(block_group, | |
6406 | start, num_bytes); | |
6407 | if (ret) | |
6408 | goto out_lock; | |
6409 | ||
6410 | num_bytes = (start + num_bytes) - | |
6411 | caching_ctl->progress; | |
6412 | start = caching_ctl->progress; | |
2ff7e61e | 6413 | ret = add_excluded_extent(fs_info, start, num_bytes); |
8c2a1a30 JB |
6414 | } |
6415 | out_lock: | |
6416 | mutex_unlock(&caching_ctl->mutex); | |
6417 | put_caching_control(caching_ctl); | |
6418 | } | |
6419 | btrfs_put_block_group(block_group); | |
6420 | return ret; | |
6421 | } | |
6422 | ||
2ff7e61e | 6423 | int btrfs_exclude_logged_extents(struct btrfs_fs_info *fs_info, |
8c2a1a30 JB |
6424 | struct extent_buffer *eb) |
6425 | { | |
6426 | struct btrfs_file_extent_item *item; | |
6427 | struct btrfs_key key; | |
6428 | int found_type; | |
6429 | int i; | |
6430 | ||
2ff7e61e | 6431 | if (!btrfs_fs_incompat(fs_info, MIXED_GROUPS)) |
8c2a1a30 JB |
6432 | return 0; |
6433 | ||
6434 | for (i = 0; i < btrfs_header_nritems(eb); i++) { | |
6435 | btrfs_item_key_to_cpu(eb, &key, i); | |
6436 | if (key.type != BTRFS_EXTENT_DATA_KEY) | |
6437 | continue; | |
6438 | item = btrfs_item_ptr(eb, i, struct btrfs_file_extent_item); | |
6439 | found_type = btrfs_file_extent_type(eb, item); | |
6440 | if (found_type == BTRFS_FILE_EXTENT_INLINE) | |
6441 | continue; | |
6442 | if (btrfs_file_extent_disk_bytenr(eb, item) == 0) | |
6443 | continue; | |
6444 | key.objectid = btrfs_file_extent_disk_bytenr(eb, item); | |
6445 | key.offset = btrfs_file_extent_disk_num_bytes(eb, item); | |
2ff7e61e | 6446 | __exclude_logged_extent(fs_info, key.objectid, key.offset); |
8c2a1a30 JB |
6447 | } |
6448 | ||
6449 | return 0; | |
6450 | } | |
6451 | ||
9cfa3e34 FM |
6452 | static void |
6453 | btrfs_inc_block_group_reservations(struct btrfs_block_group_cache *bg) | |
6454 | { | |
6455 | atomic_inc(&bg->reservations); | |
6456 | } | |
6457 | ||
6458 | void btrfs_dec_block_group_reservations(struct btrfs_fs_info *fs_info, | |
6459 | const u64 start) | |
6460 | { | |
6461 | struct btrfs_block_group_cache *bg; | |
6462 | ||
6463 | bg = btrfs_lookup_block_group(fs_info, start); | |
6464 | ASSERT(bg); | |
6465 | if (atomic_dec_and_test(&bg->reservations)) | |
6466 | wake_up_atomic_t(&bg->reservations); | |
6467 | btrfs_put_block_group(bg); | |
6468 | } | |
6469 | ||
6470 | static int btrfs_wait_bg_reservations_atomic_t(atomic_t *a) | |
6471 | { | |
6472 | schedule(); | |
6473 | return 0; | |
6474 | } | |
6475 | ||
6476 | void btrfs_wait_block_group_reservations(struct btrfs_block_group_cache *bg) | |
6477 | { | |
6478 | struct btrfs_space_info *space_info = bg->space_info; | |
6479 | ||
6480 | ASSERT(bg->ro); | |
6481 | ||
6482 | if (!(bg->flags & BTRFS_BLOCK_GROUP_DATA)) | |
6483 | return; | |
6484 | ||
6485 | /* | |
6486 | * Our block group is read only but before we set it to read only, | |
6487 | * some task might have had allocated an extent from it already, but it | |
6488 | * has not yet created a respective ordered extent (and added it to a | |
6489 | * root's list of ordered extents). | |
6490 | * Therefore wait for any task currently allocating extents, since the | |
6491 | * block group's reservations counter is incremented while a read lock | |
6492 | * on the groups' semaphore is held and decremented after releasing | |
6493 | * the read access on that semaphore and creating the ordered extent. | |
6494 | */ | |
6495 | down_write(&space_info->groups_sem); | |
6496 | up_write(&space_info->groups_sem); | |
6497 | ||
6498 | wait_on_atomic_t(&bg->reservations, | |
6499 | btrfs_wait_bg_reservations_atomic_t, | |
6500 | TASK_UNINTERRUPTIBLE); | |
6501 | } | |
6502 | ||
fb25e914 | 6503 | /** |
4824f1f4 | 6504 | * btrfs_add_reserved_bytes - update the block_group and space info counters |
fb25e914 | 6505 | * @cache: The cache we are manipulating |
18513091 WX |
6506 | * @ram_bytes: The number of bytes of file content, and will be same to |
6507 | * @num_bytes except for the compress path. | |
fb25e914 | 6508 | * @num_bytes: The number of bytes in question |
e570fd27 | 6509 | * @delalloc: The blocks are allocated for the delalloc write |
fb25e914 | 6510 | * |
745699ef XW |
6511 | * This is called by the allocator when it reserves space. If this is a |
6512 | * reservation and the block group has become read only we cannot make the | |
6513 | * reservation and return -EAGAIN, otherwise this function always succeeds. | |
f0486c68 | 6514 | */ |
4824f1f4 | 6515 | static int btrfs_add_reserved_bytes(struct btrfs_block_group_cache *cache, |
18513091 | 6516 | u64 ram_bytes, u64 num_bytes, int delalloc) |
11833d66 | 6517 | { |
fb25e914 | 6518 | struct btrfs_space_info *space_info = cache->space_info; |
f0486c68 | 6519 | int ret = 0; |
79787eaa | 6520 | |
fb25e914 JB |
6521 | spin_lock(&space_info->lock); |
6522 | spin_lock(&cache->lock); | |
4824f1f4 WX |
6523 | if (cache->ro) { |
6524 | ret = -EAGAIN; | |
fb25e914 | 6525 | } else { |
4824f1f4 WX |
6526 | cache->reserved += num_bytes; |
6527 | space_info->bytes_reserved += num_bytes; | |
e570fd27 | 6528 | |
18513091 WX |
6529 | trace_btrfs_space_reservation(cache->fs_info, |
6530 | "space_info", space_info->flags, | |
6531 | ram_bytes, 0); | |
6532 | space_info->bytes_may_use -= ram_bytes; | |
e570fd27 | 6533 | if (delalloc) |
4824f1f4 | 6534 | cache->delalloc_bytes += num_bytes; |
324ae4df | 6535 | } |
fb25e914 JB |
6536 | spin_unlock(&cache->lock); |
6537 | spin_unlock(&space_info->lock); | |
f0486c68 | 6538 | return ret; |
324ae4df | 6539 | } |
9078a3e1 | 6540 | |
4824f1f4 WX |
6541 | /** |
6542 | * btrfs_free_reserved_bytes - update the block_group and space info counters | |
6543 | * @cache: The cache we are manipulating | |
6544 | * @num_bytes: The number of bytes in question | |
6545 | * @delalloc: The blocks are allocated for the delalloc write | |
6546 | * | |
6547 | * This is called by somebody who is freeing space that was never actually used | |
6548 | * on disk. For example if you reserve some space for a new leaf in transaction | |
6549 | * A and before transaction A commits you free that leaf, you call this with | |
6550 | * reserve set to 0 in order to clear the reservation. | |
6551 | */ | |
6552 | ||
6553 | static int btrfs_free_reserved_bytes(struct btrfs_block_group_cache *cache, | |
6554 | u64 num_bytes, int delalloc) | |
6555 | { | |
6556 | struct btrfs_space_info *space_info = cache->space_info; | |
6557 | int ret = 0; | |
6558 | ||
6559 | spin_lock(&space_info->lock); | |
6560 | spin_lock(&cache->lock); | |
6561 | if (cache->ro) | |
6562 | space_info->bytes_readonly += num_bytes; | |
6563 | cache->reserved -= num_bytes; | |
6564 | space_info->bytes_reserved -= num_bytes; | |
6565 | ||
6566 | if (delalloc) | |
6567 | cache->delalloc_bytes -= num_bytes; | |
6568 | spin_unlock(&cache->lock); | |
6569 | spin_unlock(&space_info->lock); | |
6570 | return ret; | |
6571 | } | |
8b74c03e | 6572 | void btrfs_prepare_extent_commit(struct btrfs_fs_info *fs_info) |
e8569813 | 6573 | { |
11833d66 YZ |
6574 | struct btrfs_caching_control *next; |
6575 | struct btrfs_caching_control *caching_ctl; | |
6576 | struct btrfs_block_group_cache *cache; | |
e8569813 | 6577 | |
9e351cc8 | 6578 | down_write(&fs_info->commit_root_sem); |
25179201 | 6579 | |
11833d66 YZ |
6580 | list_for_each_entry_safe(caching_ctl, next, |
6581 | &fs_info->caching_block_groups, list) { | |
6582 | cache = caching_ctl->block_group; | |
6583 | if (block_group_cache_done(cache)) { | |
6584 | cache->last_byte_to_unpin = (u64)-1; | |
6585 | list_del_init(&caching_ctl->list); | |
6586 | put_caching_control(caching_ctl); | |
e8569813 | 6587 | } else { |
11833d66 | 6588 | cache->last_byte_to_unpin = caching_ctl->progress; |
e8569813 | 6589 | } |
e8569813 | 6590 | } |
11833d66 YZ |
6591 | |
6592 | if (fs_info->pinned_extents == &fs_info->freed_extents[0]) | |
6593 | fs_info->pinned_extents = &fs_info->freed_extents[1]; | |
6594 | else | |
6595 | fs_info->pinned_extents = &fs_info->freed_extents[0]; | |
6596 | ||
9e351cc8 | 6597 | up_write(&fs_info->commit_root_sem); |
8929ecfa YZ |
6598 | |
6599 | update_global_block_rsv(fs_info); | |
e8569813 ZY |
6600 | } |
6601 | ||
c759c4e1 JB |
6602 | /* |
6603 | * Returns the free cluster for the given space info and sets empty_cluster to | |
6604 | * what it should be based on the mount options. | |
6605 | */ | |
6606 | static struct btrfs_free_cluster * | |
2ff7e61e JM |
6607 | fetch_cluster_info(struct btrfs_fs_info *fs_info, |
6608 | struct btrfs_space_info *space_info, u64 *empty_cluster) | |
c759c4e1 JB |
6609 | { |
6610 | struct btrfs_free_cluster *ret = NULL; | |
0b246afa | 6611 | bool ssd = btrfs_test_opt(fs_info, SSD); |
c759c4e1 JB |
6612 | |
6613 | *empty_cluster = 0; | |
6614 | if (btrfs_mixed_space_info(space_info)) | |
6615 | return ret; | |
6616 | ||
6617 | if (ssd) | |
ee22184b | 6618 | *empty_cluster = SZ_2M; |
c759c4e1 | 6619 | if (space_info->flags & BTRFS_BLOCK_GROUP_METADATA) { |
0b246afa | 6620 | ret = &fs_info->meta_alloc_cluster; |
c759c4e1 | 6621 | if (!ssd) |
ee22184b | 6622 | *empty_cluster = SZ_64K; |
c759c4e1 | 6623 | } else if ((space_info->flags & BTRFS_BLOCK_GROUP_DATA) && ssd) { |
0b246afa | 6624 | ret = &fs_info->data_alloc_cluster; |
c759c4e1 JB |
6625 | } |
6626 | ||
6627 | return ret; | |
6628 | } | |
6629 | ||
2ff7e61e JM |
6630 | static int unpin_extent_range(struct btrfs_fs_info *fs_info, |
6631 | u64 start, u64 end, | |
678886bd | 6632 | const bool return_free_space) |
ccd467d6 | 6633 | { |
11833d66 | 6634 | struct btrfs_block_group_cache *cache = NULL; |
7b398f8e JB |
6635 | struct btrfs_space_info *space_info; |
6636 | struct btrfs_block_rsv *global_rsv = &fs_info->global_block_rsv; | |
c759c4e1 | 6637 | struct btrfs_free_cluster *cluster = NULL; |
11833d66 | 6638 | u64 len; |
c759c4e1 JB |
6639 | u64 total_unpinned = 0; |
6640 | u64 empty_cluster = 0; | |
7b398f8e | 6641 | bool readonly; |
ccd467d6 | 6642 | |
11833d66 | 6643 | while (start <= end) { |
7b398f8e | 6644 | readonly = false; |
11833d66 YZ |
6645 | if (!cache || |
6646 | start >= cache->key.objectid + cache->key.offset) { | |
6647 | if (cache) | |
6648 | btrfs_put_block_group(cache); | |
c759c4e1 | 6649 | total_unpinned = 0; |
11833d66 | 6650 | cache = btrfs_lookup_block_group(fs_info, start); |
79787eaa | 6651 | BUG_ON(!cache); /* Logic error */ |
c759c4e1 | 6652 | |
2ff7e61e | 6653 | cluster = fetch_cluster_info(fs_info, |
c759c4e1 JB |
6654 | cache->space_info, |
6655 | &empty_cluster); | |
6656 | empty_cluster <<= 1; | |
11833d66 YZ |
6657 | } |
6658 | ||
6659 | len = cache->key.objectid + cache->key.offset - start; | |
6660 | len = min(len, end + 1 - start); | |
6661 | ||
6662 | if (start < cache->last_byte_to_unpin) { | |
6663 | len = min(len, cache->last_byte_to_unpin - start); | |
678886bd FM |
6664 | if (return_free_space) |
6665 | btrfs_add_free_space(cache, start, len); | |
11833d66 YZ |
6666 | } |
6667 | ||
f0486c68 | 6668 | start += len; |
c759c4e1 | 6669 | total_unpinned += len; |
7b398f8e | 6670 | space_info = cache->space_info; |
f0486c68 | 6671 | |
c759c4e1 JB |
6672 | /* |
6673 | * If this space cluster has been marked as fragmented and we've | |
6674 | * unpinned enough in this block group to potentially allow a | |
6675 | * cluster to be created inside of it go ahead and clear the | |
6676 | * fragmented check. | |
6677 | */ | |
6678 | if (cluster && cluster->fragmented && | |
6679 | total_unpinned > empty_cluster) { | |
6680 | spin_lock(&cluster->lock); | |
6681 | cluster->fragmented = 0; | |
6682 | spin_unlock(&cluster->lock); | |
6683 | } | |
6684 | ||
7b398f8e | 6685 | spin_lock(&space_info->lock); |
11833d66 YZ |
6686 | spin_lock(&cache->lock); |
6687 | cache->pinned -= len; | |
7b398f8e | 6688 | space_info->bytes_pinned -= len; |
c51e7bb1 JB |
6689 | |
6690 | trace_btrfs_space_reservation(fs_info, "pinned", | |
6691 | space_info->flags, len, 0); | |
4f4db217 | 6692 | space_info->max_extent_size = 0; |
d288db5d | 6693 | percpu_counter_add(&space_info->total_bytes_pinned, -len); |
7b398f8e JB |
6694 | if (cache->ro) { |
6695 | space_info->bytes_readonly += len; | |
6696 | readonly = true; | |
6697 | } | |
11833d66 | 6698 | spin_unlock(&cache->lock); |
957780eb JB |
6699 | if (!readonly && return_free_space && |
6700 | global_rsv->space_info == space_info) { | |
6701 | u64 to_add = len; | |
6702 | WARN_ON(!return_free_space); | |
7b398f8e JB |
6703 | spin_lock(&global_rsv->lock); |
6704 | if (!global_rsv->full) { | |
957780eb JB |
6705 | to_add = min(len, global_rsv->size - |
6706 | global_rsv->reserved); | |
6707 | global_rsv->reserved += to_add; | |
6708 | space_info->bytes_may_use += to_add; | |
7b398f8e JB |
6709 | if (global_rsv->reserved >= global_rsv->size) |
6710 | global_rsv->full = 1; | |
957780eb JB |
6711 | trace_btrfs_space_reservation(fs_info, |
6712 | "space_info", | |
6713 | space_info->flags, | |
6714 | to_add, 1); | |
6715 | len -= to_add; | |
7b398f8e JB |
6716 | } |
6717 | spin_unlock(&global_rsv->lock); | |
957780eb JB |
6718 | /* Add to any tickets we may have */ |
6719 | if (len) | |
6720 | space_info_add_new_bytes(fs_info, space_info, | |
6721 | len); | |
7b398f8e JB |
6722 | } |
6723 | spin_unlock(&space_info->lock); | |
ccd467d6 | 6724 | } |
11833d66 YZ |
6725 | |
6726 | if (cache) | |
6727 | btrfs_put_block_group(cache); | |
ccd467d6 CM |
6728 | return 0; |
6729 | } | |
6730 | ||
6731 | int btrfs_finish_extent_commit(struct btrfs_trans_handle *trans, | |
2ff7e61e | 6732 | struct btrfs_fs_info *fs_info) |
a28ec197 | 6733 | { |
e33e17ee JM |
6734 | struct btrfs_block_group_cache *block_group, *tmp; |
6735 | struct list_head *deleted_bgs; | |
11833d66 | 6736 | struct extent_io_tree *unpin; |
1a5bc167 CM |
6737 | u64 start; |
6738 | u64 end; | |
a28ec197 | 6739 | int ret; |
a28ec197 | 6740 | |
11833d66 YZ |
6741 | if (fs_info->pinned_extents == &fs_info->freed_extents[0]) |
6742 | unpin = &fs_info->freed_extents[1]; | |
6743 | else | |
6744 | unpin = &fs_info->freed_extents[0]; | |
6745 | ||
e33e17ee | 6746 | while (!trans->aborted) { |
d4b450cd | 6747 | mutex_lock(&fs_info->unused_bg_unpin_mutex); |
1a5bc167 | 6748 | ret = find_first_extent_bit(unpin, 0, &start, &end, |
e6138876 | 6749 | EXTENT_DIRTY, NULL); |
d4b450cd FM |
6750 | if (ret) { |
6751 | mutex_unlock(&fs_info->unused_bg_unpin_mutex); | |
a28ec197 | 6752 | break; |
d4b450cd | 6753 | } |
1f3c79a2 | 6754 | |
0b246afa | 6755 | if (btrfs_test_opt(fs_info, DISCARD)) |
2ff7e61e | 6756 | ret = btrfs_discard_extent(fs_info, start, |
5378e607 | 6757 | end + 1 - start, NULL); |
1f3c79a2 | 6758 | |
af6f8f60 | 6759 | clear_extent_dirty(unpin, start, end); |
2ff7e61e | 6760 | unpin_extent_range(fs_info, start, end, true); |
d4b450cd | 6761 | mutex_unlock(&fs_info->unused_bg_unpin_mutex); |
b9473439 | 6762 | cond_resched(); |
a28ec197 | 6763 | } |
817d52f8 | 6764 | |
e33e17ee JM |
6765 | /* |
6766 | * Transaction is finished. We don't need the lock anymore. We | |
6767 | * do need to clean up the block groups in case of a transaction | |
6768 | * abort. | |
6769 | */ | |
6770 | deleted_bgs = &trans->transaction->deleted_bgs; | |
6771 | list_for_each_entry_safe(block_group, tmp, deleted_bgs, bg_list) { | |
6772 | u64 trimmed = 0; | |
6773 | ||
6774 | ret = -EROFS; | |
6775 | if (!trans->aborted) | |
2ff7e61e | 6776 | ret = btrfs_discard_extent(fs_info, |
e33e17ee JM |
6777 | block_group->key.objectid, |
6778 | block_group->key.offset, | |
6779 | &trimmed); | |
6780 | ||
6781 | list_del_init(&block_group->bg_list); | |
6782 | btrfs_put_block_group_trimming(block_group); | |
6783 | btrfs_put_block_group(block_group); | |
6784 | ||
6785 | if (ret) { | |
6786 | const char *errstr = btrfs_decode_error(ret); | |
6787 | btrfs_warn(fs_info, | |
6788 | "Discard failed while removing blockgroup: errno=%d %s\n", | |
6789 | ret, errstr); | |
6790 | } | |
6791 | } | |
6792 | ||
e20d96d6 CM |
6793 | return 0; |
6794 | } | |
6795 | ||
b150a4f1 JB |
6796 | static void add_pinned_bytes(struct btrfs_fs_info *fs_info, u64 num_bytes, |
6797 | u64 owner, u64 root_objectid) | |
6798 | { | |
6799 | struct btrfs_space_info *space_info; | |
6800 | u64 flags; | |
6801 | ||
6802 | if (owner < BTRFS_FIRST_FREE_OBJECTID) { | |
6803 | if (root_objectid == BTRFS_CHUNK_TREE_OBJECTID) | |
6804 | flags = BTRFS_BLOCK_GROUP_SYSTEM; | |
6805 | else | |
6806 | flags = BTRFS_BLOCK_GROUP_METADATA; | |
6807 | } else { | |
6808 | flags = BTRFS_BLOCK_GROUP_DATA; | |
6809 | } | |
6810 | ||
6811 | space_info = __find_space_info(fs_info, flags); | |
6812 | BUG_ON(!space_info); /* Logic bug */ | |
6813 | percpu_counter_add(&space_info->total_bytes_pinned, num_bytes); | |
6814 | } | |
6815 | ||
6816 | ||
5d4f98a2 | 6817 | static int __btrfs_free_extent(struct btrfs_trans_handle *trans, |
2ff7e61e | 6818 | struct btrfs_fs_info *info, |
c682f9b3 | 6819 | struct btrfs_delayed_ref_node *node, u64 parent, |
5d4f98a2 YZ |
6820 | u64 root_objectid, u64 owner_objectid, |
6821 | u64 owner_offset, int refs_to_drop, | |
c682f9b3 | 6822 | struct btrfs_delayed_extent_op *extent_op) |
a28ec197 | 6823 | { |
e2fa7227 | 6824 | struct btrfs_key key; |
5d4f98a2 | 6825 | struct btrfs_path *path; |
1261ec42 | 6826 | struct btrfs_root *extent_root = info->extent_root; |
5f39d397 | 6827 | struct extent_buffer *leaf; |
5d4f98a2 YZ |
6828 | struct btrfs_extent_item *ei; |
6829 | struct btrfs_extent_inline_ref *iref; | |
a28ec197 | 6830 | int ret; |
5d4f98a2 | 6831 | int is_data; |
952fccac CM |
6832 | int extent_slot = 0; |
6833 | int found_extent = 0; | |
6834 | int num_to_del = 1; | |
5d4f98a2 YZ |
6835 | u32 item_size; |
6836 | u64 refs; | |
c682f9b3 QW |
6837 | u64 bytenr = node->bytenr; |
6838 | u64 num_bytes = node->num_bytes; | |
fcebe456 | 6839 | int last_ref = 0; |
0b246afa | 6840 | bool skinny_metadata = btrfs_fs_incompat(info, SKINNY_METADATA); |
037e6390 | 6841 | |
5caf2a00 | 6842 | path = btrfs_alloc_path(); |
54aa1f4d CM |
6843 | if (!path) |
6844 | return -ENOMEM; | |
5f26f772 | 6845 | |
e4058b54 | 6846 | path->reada = READA_FORWARD; |
b9473439 | 6847 | path->leave_spinning = 1; |
5d4f98a2 YZ |
6848 | |
6849 | is_data = owner_objectid >= BTRFS_FIRST_FREE_OBJECTID; | |
6850 | BUG_ON(!is_data && refs_to_drop != 1); | |
6851 | ||
3173a18f JB |
6852 | if (is_data) |
6853 | skinny_metadata = 0; | |
6854 | ||
87bde3cd | 6855 | ret = lookup_extent_backref(trans, info, path, &iref, |
5d4f98a2 YZ |
6856 | bytenr, num_bytes, parent, |
6857 | root_objectid, owner_objectid, | |
6858 | owner_offset); | |
7bb86316 | 6859 | if (ret == 0) { |
952fccac | 6860 | extent_slot = path->slots[0]; |
5d4f98a2 YZ |
6861 | while (extent_slot >= 0) { |
6862 | btrfs_item_key_to_cpu(path->nodes[0], &key, | |
952fccac | 6863 | extent_slot); |
5d4f98a2 | 6864 | if (key.objectid != bytenr) |
952fccac | 6865 | break; |
5d4f98a2 YZ |
6866 | if (key.type == BTRFS_EXTENT_ITEM_KEY && |
6867 | key.offset == num_bytes) { | |
952fccac CM |
6868 | found_extent = 1; |
6869 | break; | |
6870 | } | |
3173a18f JB |
6871 | if (key.type == BTRFS_METADATA_ITEM_KEY && |
6872 | key.offset == owner_objectid) { | |
6873 | found_extent = 1; | |
6874 | break; | |
6875 | } | |
952fccac CM |
6876 | if (path->slots[0] - extent_slot > 5) |
6877 | break; | |
5d4f98a2 | 6878 | extent_slot--; |
952fccac | 6879 | } |
5d4f98a2 YZ |
6880 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 |
6881 | item_size = btrfs_item_size_nr(path->nodes[0], extent_slot); | |
6882 | if (found_extent && item_size < sizeof(*ei)) | |
6883 | found_extent = 0; | |
6884 | #endif | |
31840ae1 | 6885 | if (!found_extent) { |
5d4f98a2 | 6886 | BUG_ON(iref); |
87bde3cd JM |
6887 | ret = remove_extent_backref(trans, info, path, NULL, |
6888 | refs_to_drop, | |
fcebe456 | 6889 | is_data, &last_ref); |
005d6427 | 6890 | if (ret) { |
66642832 | 6891 | btrfs_abort_transaction(trans, ret); |
005d6427 DS |
6892 | goto out; |
6893 | } | |
b3b4aa74 | 6894 | btrfs_release_path(path); |
b9473439 | 6895 | path->leave_spinning = 1; |
5d4f98a2 YZ |
6896 | |
6897 | key.objectid = bytenr; | |
6898 | key.type = BTRFS_EXTENT_ITEM_KEY; | |
6899 | key.offset = num_bytes; | |
6900 | ||
3173a18f JB |
6901 | if (!is_data && skinny_metadata) { |
6902 | key.type = BTRFS_METADATA_ITEM_KEY; | |
6903 | key.offset = owner_objectid; | |
6904 | } | |
6905 | ||
31840ae1 ZY |
6906 | ret = btrfs_search_slot(trans, extent_root, |
6907 | &key, path, -1, 1); | |
3173a18f JB |
6908 | if (ret > 0 && skinny_metadata && path->slots[0]) { |
6909 | /* | |
6910 | * Couldn't find our skinny metadata item, | |
6911 | * see if we have ye olde extent item. | |
6912 | */ | |
6913 | path->slots[0]--; | |
6914 | btrfs_item_key_to_cpu(path->nodes[0], &key, | |
6915 | path->slots[0]); | |
6916 | if (key.objectid == bytenr && | |
6917 | key.type == BTRFS_EXTENT_ITEM_KEY && | |
6918 | key.offset == num_bytes) | |
6919 | ret = 0; | |
6920 | } | |
6921 | ||
6922 | if (ret > 0 && skinny_metadata) { | |
6923 | skinny_metadata = false; | |
9ce49a0b | 6924 | key.objectid = bytenr; |
3173a18f JB |
6925 | key.type = BTRFS_EXTENT_ITEM_KEY; |
6926 | key.offset = num_bytes; | |
6927 | btrfs_release_path(path); | |
6928 | ret = btrfs_search_slot(trans, extent_root, | |
6929 | &key, path, -1, 1); | |
6930 | } | |
6931 | ||
f3465ca4 | 6932 | if (ret) { |
5d163e0e JM |
6933 | btrfs_err(info, |
6934 | "umm, got %d back from search, was looking for %llu", | |
6935 | ret, bytenr); | |
b783e62d | 6936 | if (ret > 0) |
2ff7e61e | 6937 | btrfs_print_leaf(info, path->nodes[0]); |
f3465ca4 | 6938 | } |
005d6427 | 6939 | if (ret < 0) { |
66642832 | 6940 | btrfs_abort_transaction(trans, ret); |
005d6427 DS |
6941 | goto out; |
6942 | } | |
31840ae1 ZY |
6943 | extent_slot = path->slots[0]; |
6944 | } | |
fae7f21c | 6945 | } else if (WARN_ON(ret == -ENOENT)) { |
2ff7e61e | 6946 | btrfs_print_leaf(info, path->nodes[0]); |
c2cf52eb SK |
6947 | btrfs_err(info, |
6948 | "unable to find ref byte nr %llu parent %llu root %llu owner %llu offset %llu", | |
c1c9ff7c GU |
6949 | bytenr, parent, root_objectid, owner_objectid, |
6950 | owner_offset); | |
66642832 | 6951 | btrfs_abort_transaction(trans, ret); |
c4a050bb | 6952 | goto out; |
79787eaa | 6953 | } else { |
66642832 | 6954 | btrfs_abort_transaction(trans, ret); |
005d6427 | 6955 | goto out; |
7bb86316 | 6956 | } |
5f39d397 CM |
6957 | |
6958 | leaf = path->nodes[0]; | |
5d4f98a2 YZ |
6959 | item_size = btrfs_item_size_nr(leaf, extent_slot); |
6960 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
6961 | if (item_size < sizeof(*ei)) { | |
6962 | BUG_ON(found_extent || extent_slot != path->slots[0]); | |
87bde3cd JM |
6963 | ret = convert_extent_item_v0(trans, info, path, owner_objectid, |
6964 | 0); | |
005d6427 | 6965 | if (ret < 0) { |
66642832 | 6966 | btrfs_abort_transaction(trans, ret); |
005d6427 DS |
6967 | goto out; |
6968 | } | |
5d4f98a2 | 6969 | |
b3b4aa74 | 6970 | btrfs_release_path(path); |
5d4f98a2 YZ |
6971 | path->leave_spinning = 1; |
6972 | ||
6973 | key.objectid = bytenr; | |
6974 | key.type = BTRFS_EXTENT_ITEM_KEY; | |
6975 | key.offset = num_bytes; | |
6976 | ||
6977 | ret = btrfs_search_slot(trans, extent_root, &key, path, | |
6978 | -1, 1); | |
6979 | if (ret) { | |
5d163e0e JM |
6980 | btrfs_err(info, |
6981 | "umm, got %d back from search, was looking for %llu", | |
c1c9ff7c | 6982 | ret, bytenr); |
2ff7e61e | 6983 | btrfs_print_leaf(info, path->nodes[0]); |
5d4f98a2 | 6984 | } |
005d6427 | 6985 | if (ret < 0) { |
66642832 | 6986 | btrfs_abort_transaction(trans, ret); |
005d6427 DS |
6987 | goto out; |
6988 | } | |
6989 | ||
5d4f98a2 YZ |
6990 | extent_slot = path->slots[0]; |
6991 | leaf = path->nodes[0]; | |
6992 | item_size = btrfs_item_size_nr(leaf, extent_slot); | |
6993 | } | |
6994 | #endif | |
6995 | BUG_ON(item_size < sizeof(*ei)); | |
952fccac | 6996 | ei = btrfs_item_ptr(leaf, extent_slot, |
123abc88 | 6997 | struct btrfs_extent_item); |
3173a18f JB |
6998 | if (owner_objectid < BTRFS_FIRST_FREE_OBJECTID && |
6999 | key.type == BTRFS_EXTENT_ITEM_KEY) { | |
5d4f98a2 YZ |
7000 | struct btrfs_tree_block_info *bi; |
7001 | BUG_ON(item_size < sizeof(*ei) + sizeof(*bi)); | |
7002 | bi = (struct btrfs_tree_block_info *)(ei + 1); | |
7003 | WARN_ON(owner_objectid != btrfs_tree_block_level(leaf, bi)); | |
7004 | } | |
56bec294 | 7005 | |
5d4f98a2 | 7006 | refs = btrfs_extent_refs(leaf, ei); |
32b02538 | 7007 | if (refs < refs_to_drop) { |
5d163e0e JM |
7008 | btrfs_err(info, |
7009 | "trying to drop %d refs but we only have %Lu for bytenr %Lu", | |
7010 | refs_to_drop, refs, bytenr); | |
32b02538 | 7011 | ret = -EINVAL; |
66642832 | 7012 | btrfs_abort_transaction(trans, ret); |
32b02538 JB |
7013 | goto out; |
7014 | } | |
56bec294 | 7015 | refs -= refs_to_drop; |
5f39d397 | 7016 | |
5d4f98a2 YZ |
7017 | if (refs > 0) { |
7018 | if (extent_op) | |
7019 | __run_delayed_extent_op(extent_op, leaf, ei); | |
7020 | /* | |
7021 | * In the case of inline back ref, reference count will | |
7022 | * be updated by remove_extent_backref | |
952fccac | 7023 | */ |
5d4f98a2 YZ |
7024 | if (iref) { |
7025 | BUG_ON(!found_extent); | |
7026 | } else { | |
7027 | btrfs_set_extent_refs(leaf, ei, refs); | |
7028 | btrfs_mark_buffer_dirty(leaf); | |
7029 | } | |
7030 | if (found_extent) { | |
87bde3cd | 7031 | ret = remove_extent_backref(trans, info, path, |
5d4f98a2 | 7032 | iref, refs_to_drop, |
fcebe456 | 7033 | is_data, &last_ref); |
005d6427 | 7034 | if (ret) { |
66642832 | 7035 | btrfs_abort_transaction(trans, ret); |
005d6427 DS |
7036 | goto out; |
7037 | } | |
952fccac | 7038 | } |
0b246afa | 7039 | add_pinned_bytes(info, -num_bytes, owner_objectid, |
b150a4f1 | 7040 | root_objectid); |
5d4f98a2 | 7041 | } else { |
5d4f98a2 YZ |
7042 | if (found_extent) { |
7043 | BUG_ON(is_data && refs_to_drop != | |
9ed0dea0 | 7044 | extent_data_ref_count(path, iref)); |
5d4f98a2 YZ |
7045 | if (iref) { |
7046 | BUG_ON(path->slots[0] != extent_slot); | |
7047 | } else { | |
7048 | BUG_ON(path->slots[0] != extent_slot + 1); | |
7049 | path->slots[0] = extent_slot; | |
7050 | num_to_del = 2; | |
7051 | } | |
78fae27e | 7052 | } |
b9473439 | 7053 | |
fcebe456 | 7054 | last_ref = 1; |
952fccac CM |
7055 | ret = btrfs_del_items(trans, extent_root, path, path->slots[0], |
7056 | num_to_del); | |
005d6427 | 7057 | if (ret) { |
66642832 | 7058 | btrfs_abort_transaction(trans, ret); |
005d6427 DS |
7059 | goto out; |
7060 | } | |
b3b4aa74 | 7061 | btrfs_release_path(path); |
21af804c | 7062 | |
5d4f98a2 | 7063 | if (is_data) { |
5b4aacef | 7064 | ret = btrfs_del_csums(trans, info, bytenr, num_bytes); |
005d6427 | 7065 | if (ret) { |
66642832 | 7066 | btrfs_abort_transaction(trans, ret); |
005d6427 DS |
7067 | goto out; |
7068 | } | |
459931ec CM |
7069 | } |
7070 | ||
0b246afa | 7071 | ret = add_to_free_space_tree(trans, info, bytenr, num_bytes); |
1e144fb8 | 7072 | if (ret) { |
66642832 | 7073 | btrfs_abort_transaction(trans, ret); |
1e144fb8 OS |
7074 | goto out; |
7075 | } | |
7076 | ||
0b246afa | 7077 | ret = update_block_group(trans, info, bytenr, num_bytes, 0); |
005d6427 | 7078 | if (ret) { |
66642832 | 7079 | btrfs_abort_transaction(trans, ret); |
005d6427 DS |
7080 | goto out; |
7081 | } | |
a28ec197 | 7082 | } |
fcebe456 JB |
7083 | btrfs_release_path(path); |
7084 | ||
79787eaa | 7085 | out: |
5caf2a00 | 7086 | btrfs_free_path(path); |
a28ec197 CM |
7087 | return ret; |
7088 | } | |
7089 | ||
1887be66 | 7090 | /* |
f0486c68 | 7091 | * when we free an block, it is possible (and likely) that we free the last |
1887be66 CM |
7092 | * delayed ref for that extent as well. This searches the delayed ref tree for |
7093 | * a given extent, and if there are no other delayed refs to be processed, it | |
7094 | * removes it from the tree. | |
7095 | */ | |
7096 | static noinline int check_ref_cleanup(struct btrfs_trans_handle *trans, | |
2ff7e61e | 7097 | u64 bytenr) |
1887be66 CM |
7098 | { |
7099 | struct btrfs_delayed_ref_head *head; | |
7100 | struct btrfs_delayed_ref_root *delayed_refs; | |
f0486c68 | 7101 | int ret = 0; |
1887be66 CM |
7102 | |
7103 | delayed_refs = &trans->transaction->delayed_refs; | |
7104 | spin_lock(&delayed_refs->lock); | |
f72ad18e | 7105 | head = btrfs_find_delayed_ref_head(delayed_refs, bytenr); |
1887be66 | 7106 | if (!head) |
cf93da7b | 7107 | goto out_delayed_unlock; |
1887be66 | 7108 | |
d7df2c79 | 7109 | spin_lock(&head->lock); |
c6fc2454 | 7110 | if (!list_empty(&head->ref_list)) |
1887be66 CM |
7111 | goto out; |
7112 | ||
5d4f98a2 YZ |
7113 | if (head->extent_op) { |
7114 | if (!head->must_insert_reserved) | |
7115 | goto out; | |
78a6184a | 7116 | btrfs_free_delayed_extent_op(head->extent_op); |
5d4f98a2 YZ |
7117 | head->extent_op = NULL; |
7118 | } | |
7119 | ||
1887be66 CM |
7120 | /* |
7121 | * waiting for the lock here would deadlock. If someone else has it | |
7122 | * locked they are already in the process of dropping it anyway | |
7123 | */ | |
7124 | if (!mutex_trylock(&head->mutex)) | |
7125 | goto out; | |
7126 | ||
7127 | /* | |
7128 | * at this point we have a head with no other entries. Go | |
7129 | * ahead and process it. | |
7130 | */ | |
7131 | head->node.in_tree = 0; | |
c46effa6 | 7132 | rb_erase(&head->href_node, &delayed_refs->href_root); |
c3e69d58 | 7133 | |
d7df2c79 | 7134 | atomic_dec(&delayed_refs->num_entries); |
1887be66 CM |
7135 | |
7136 | /* | |
7137 | * we don't take a ref on the node because we're removing it from the | |
7138 | * tree, so we just steal the ref the tree was holding. | |
7139 | */ | |
c3e69d58 | 7140 | delayed_refs->num_heads--; |
d7df2c79 | 7141 | if (head->processing == 0) |
c3e69d58 | 7142 | delayed_refs->num_heads_ready--; |
d7df2c79 JB |
7143 | head->processing = 0; |
7144 | spin_unlock(&head->lock); | |
1887be66 CM |
7145 | spin_unlock(&delayed_refs->lock); |
7146 | ||
f0486c68 YZ |
7147 | BUG_ON(head->extent_op); |
7148 | if (head->must_insert_reserved) | |
7149 | ret = 1; | |
7150 | ||
7151 | mutex_unlock(&head->mutex); | |
1887be66 | 7152 | btrfs_put_delayed_ref(&head->node); |
f0486c68 | 7153 | return ret; |
1887be66 | 7154 | out: |
d7df2c79 | 7155 | spin_unlock(&head->lock); |
cf93da7b CM |
7156 | |
7157 | out_delayed_unlock: | |
1887be66 CM |
7158 | spin_unlock(&delayed_refs->lock); |
7159 | return 0; | |
7160 | } | |
7161 | ||
f0486c68 YZ |
7162 | void btrfs_free_tree_block(struct btrfs_trans_handle *trans, |
7163 | struct btrfs_root *root, | |
7164 | struct extent_buffer *buf, | |
5581a51a | 7165 | u64 parent, int last_ref) |
f0486c68 | 7166 | { |
0b246afa | 7167 | struct btrfs_fs_info *fs_info = root->fs_info; |
b150a4f1 | 7168 | int pin = 1; |
f0486c68 YZ |
7169 | int ret; |
7170 | ||
7171 | if (root->root_key.objectid != BTRFS_TREE_LOG_OBJECTID) { | |
0b246afa JM |
7172 | ret = btrfs_add_delayed_tree_ref(fs_info, trans, |
7173 | buf->start, buf->len, | |
7174 | parent, | |
7175 | root->root_key.objectid, | |
7176 | btrfs_header_level(buf), | |
7177 | BTRFS_DROP_DELAYED_REF, NULL); | |
79787eaa | 7178 | BUG_ON(ret); /* -ENOMEM */ |
f0486c68 YZ |
7179 | } |
7180 | ||
7181 | if (!last_ref) | |
7182 | return; | |
7183 | ||
f0486c68 | 7184 | if (btrfs_header_generation(buf) == trans->transid) { |
6219872d FM |
7185 | struct btrfs_block_group_cache *cache; |
7186 | ||
f0486c68 | 7187 | if (root->root_key.objectid != BTRFS_TREE_LOG_OBJECTID) { |
2ff7e61e | 7188 | ret = check_ref_cleanup(trans, buf->start); |
f0486c68 | 7189 | if (!ret) |
37be25bc | 7190 | goto out; |
f0486c68 YZ |
7191 | } |
7192 | ||
0b246afa | 7193 | cache = btrfs_lookup_block_group(fs_info, buf->start); |
6219872d | 7194 | |
f0486c68 | 7195 | if (btrfs_header_flag(buf, BTRFS_HEADER_FLAG_WRITTEN)) { |
2ff7e61e JM |
7196 | pin_down_extent(fs_info, cache, buf->start, |
7197 | buf->len, 1); | |
6219872d | 7198 | btrfs_put_block_group(cache); |
37be25bc | 7199 | goto out; |
f0486c68 YZ |
7200 | } |
7201 | ||
7202 | WARN_ON(test_bit(EXTENT_BUFFER_DIRTY, &buf->bflags)); | |
7203 | ||
7204 | btrfs_add_free_space(cache, buf->start, buf->len); | |
4824f1f4 | 7205 | btrfs_free_reserved_bytes(cache, buf->len, 0); |
6219872d | 7206 | btrfs_put_block_group(cache); |
71ff6437 | 7207 | trace_btrfs_reserved_extent_free(fs_info, buf->start, buf->len); |
b150a4f1 | 7208 | pin = 0; |
f0486c68 YZ |
7209 | } |
7210 | out: | |
b150a4f1 | 7211 | if (pin) |
0b246afa | 7212 | add_pinned_bytes(fs_info, buf->len, btrfs_header_level(buf), |
b150a4f1 JB |
7213 | root->root_key.objectid); |
7214 | ||
a826d6dc JB |
7215 | /* |
7216 | * Deleting the buffer, clear the corrupt flag since it doesn't matter | |
7217 | * anymore. | |
7218 | */ | |
7219 | clear_bit(EXTENT_BUFFER_CORRUPT, &buf->bflags); | |
f0486c68 YZ |
7220 | } |
7221 | ||
79787eaa | 7222 | /* Can return -ENOMEM */ |
2ff7e61e JM |
7223 | int btrfs_free_extent(struct btrfs_trans_handle *trans, |
7224 | struct btrfs_fs_info *fs_info, | |
66d7e7f0 | 7225 | u64 bytenr, u64 num_bytes, u64 parent, u64 root_objectid, |
b06c4bf5 | 7226 | u64 owner, u64 offset) |
925baedd CM |
7227 | { |
7228 | int ret; | |
7229 | ||
f5ee5c9a | 7230 | if (btrfs_is_testing(fs_info)) |
faa2dbf0 | 7231 | return 0; |
fccb84c9 | 7232 | |
0b246afa | 7233 | add_pinned_bytes(fs_info, num_bytes, owner, root_objectid); |
b150a4f1 | 7234 | |
56bec294 CM |
7235 | /* |
7236 | * tree log blocks never actually go into the extent allocation | |
7237 | * tree, just update pinning info and exit early. | |
56bec294 | 7238 | */ |
5d4f98a2 YZ |
7239 | if (root_objectid == BTRFS_TREE_LOG_OBJECTID) { |
7240 | WARN_ON(owner >= BTRFS_FIRST_FREE_OBJECTID); | |
b9473439 | 7241 | /* unlocks the pinned mutex */ |
2ff7e61e | 7242 | btrfs_pin_extent(fs_info, bytenr, num_bytes, 1); |
56bec294 | 7243 | ret = 0; |
5d4f98a2 | 7244 | } else if (owner < BTRFS_FIRST_FREE_OBJECTID) { |
66d7e7f0 AJ |
7245 | ret = btrfs_add_delayed_tree_ref(fs_info, trans, bytenr, |
7246 | num_bytes, | |
5d4f98a2 | 7247 | parent, root_objectid, (int)owner, |
b06c4bf5 | 7248 | BTRFS_DROP_DELAYED_REF, NULL); |
5d4f98a2 | 7249 | } else { |
66d7e7f0 AJ |
7250 | ret = btrfs_add_delayed_data_ref(fs_info, trans, bytenr, |
7251 | num_bytes, | |
7252 | parent, root_objectid, owner, | |
5846a3c2 | 7253 | offset, 0, |
fef394f7 | 7254 | BTRFS_DROP_DELAYED_REF); |
56bec294 | 7255 | } |
925baedd CM |
7256 | return ret; |
7257 | } | |
7258 | ||
817d52f8 JB |
7259 | /* |
7260 | * when we wait for progress in the block group caching, its because | |
7261 | * our allocation attempt failed at least once. So, we must sleep | |
7262 | * and let some progress happen before we try again. | |
7263 | * | |
7264 | * This function will sleep at least once waiting for new free space to | |
7265 | * show up, and then it will check the block group free space numbers | |
7266 | * for our min num_bytes. Another option is to have it go ahead | |
7267 | * and look in the rbtree for a free extent of a given size, but this | |
7268 | * is a good start. | |
36cce922 JB |
7269 | * |
7270 | * Callers of this must check if cache->cached == BTRFS_CACHE_ERROR before using | |
7271 | * any of the information in this block group. | |
817d52f8 | 7272 | */ |
36cce922 | 7273 | static noinline void |
817d52f8 JB |
7274 | wait_block_group_cache_progress(struct btrfs_block_group_cache *cache, |
7275 | u64 num_bytes) | |
7276 | { | |
11833d66 | 7277 | struct btrfs_caching_control *caching_ctl; |
817d52f8 | 7278 | |
11833d66 YZ |
7279 | caching_ctl = get_caching_control(cache); |
7280 | if (!caching_ctl) | |
36cce922 | 7281 | return; |
817d52f8 | 7282 | |
11833d66 | 7283 | wait_event(caching_ctl->wait, block_group_cache_done(cache) || |
34d52cb6 | 7284 | (cache->free_space_ctl->free_space >= num_bytes)); |
11833d66 YZ |
7285 | |
7286 | put_caching_control(caching_ctl); | |
11833d66 YZ |
7287 | } |
7288 | ||
7289 | static noinline int | |
7290 | wait_block_group_cache_done(struct btrfs_block_group_cache *cache) | |
7291 | { | |
7292 | struct btrfs_caching_control *caching_ctl; | |
36cce922 | 7293 | int ret = 0; |
11833d66 YZ |
7294 | |
7295 | caching_ctl = get_caching_control(cache); | |
7296 | if (!caching_ctl) | |
36cce922 | 7297 | return (cache->cached == BTRFS_CACHE_ERROR) ? -EIO : 0; |
11833d66 YZ |
7298 | |
7299 | wait_event(caching_ctl->wait, block_group_cache_done(cache)); | |
36cce922 JB |
7300 | if (cache->cached == BTRFS_CACHE_ERROR) |
7301 | ret = -EIO; | |
11833d66 | 7302 | put_caching_control(caching_ctl); |
36cce922 | 7303 | return ret; |
817d52f8 JB |
7304 | } |
7305 | ||
31e50229 | 7306 | int __get_raid_index(u64 flags) |
b742bb82 | 7307 | { |
7738a53a | 7308 | if (flags & BTRFS_BLOCK_GROUP_RAID10) |
e6ec716f | 7309 | return BTRFS_RAID_RAID10; |
7738a53a | 7310 | else if (flags & BTRFS_BLOCK_GROUP_RAID1) |
e6ec716f | 7311 | return BTRFS_RAID_RAID1; |
7738a53a | 7312 | else if (flags & BTRFS_BLOCK_GROUP_DUP) |
e6ec716f | 7313 | return BTRFS_RAID_DUP; |
7738a53a | 7314 | else if (flags & BTRFS_BLOCK_GROUP_RAID0) |
e6ec716f | 7315 | return BTRFS_RAID_RAID0; |
53b381b3 | 7316 | else if (flags & BTRFS_BLOCK_GROUP_RAID5) |
e942f883 | 7317 | return BTRFS_RAID_RAID5; |
53b381b3 | 7318 | else if (flags & BTRFS_BLOCK_GROUP_RAID6) |
e942f883 | 7319 | return BTRFS_RAID_RAID6; |
7738a53a | 7320 | |
e942f883 | 7321 | return BTRFS_RAID_SINGLE; /* BTRFS_BLOCK_GROUP_SINGLE */ |
b742bb82 YZ |
7322 | } |
7323 | ||
6ab0a202 | 7324 | int get_block_group_index(struct btrfs_block_group_cache *cache) |
7738a53a | 7325 | { |
31e50229 | 7326 | return __get_raid_index(cache->flags); |
7738a53a ID |
7327 | } |
7328 | ||
6ab0a202 JM |
7329 | static const char *btrfs_raid_type_names[BTRFS_NR_RAID_TYPES] = { |
7330 | [BTRFS_RAID_RAID10] = "raid10", | |
7331 | [BTRFS_RAID_RAID1] = "raid1", | |
7332 | [BTRFS_RAID_DUP] = "dup", | |
7333 | [BTRFS_RAID_RAID0] = "raid0", | |
7334 | [BTRFS_RAID_SINGLE] = "single", | |
7335 | [BTRFS_RAID_RAID5] = "raid5", | |
7336 | [BTRFS_RAID_RAID6] = "raid6", | |
7337 | }; | |
7338 | ||
1b8e5df6 | 7339 | static const char *get_raid_name(enum btrfs_raid_types type) |
6ab0a202 JM |
7340 | { |
7341 | if (type >= BTRFS_NR_RAID_TYPES) | |
7342 | return NULL; | |
7343 | ||
7344 | return btrfs_raid_type_names[type]; | |
7345 | } | |
7346 | ||
817d52f8 | 7347 | enum btrfs_loop_type { |
285ff5af JB |
7348 | LOOP_CACHING_NOWAIT = 0, |
7349 | LOOP_CACHING_WAIT = 1, | |
7350 | LOOP_ALLOC_CHUNK = 2, | |
7351 | LOOP_NO_EMPTY_SIZE = 3, | |
817d52f8 JB |
7352 | }; |
7353 | ||
e570fd27 MX |
7354 | static inline void |
7355 | btrfs_lock_block_group(struct btrfs_block_group_cache *cache, | |
7356 | int delalloc) | |
7357 | { | |
7358 | if (delalloc) | |
7359 | down_read(&cache->data_rwsem); | |
7360 | } | |
7361 | ||
7362 | static inline void | |
7363 | btrfs_grab_block_group(struct btrfs_block_group_cache *cache, | |
7364 | int delalloc) | |
7365 | { | |
7366 | btrfs_get_block_group(cache); | |
7367 | if (delalloc) | |
7368 | down_read(&cache->data_rwsem); | |
7369 | } | |
7370 | ||
7371 | static struct btrfs_block_group_cache * | |
7372 | btrfs_lock_cluster(struct btrfs_block_group_cache *block_group, | |
7373 | struct btrfs_free_cluster *cluster, | |
7374 | int delalloc) | |
7375 | { | |
89771cc9 | 7376 | struct btrfs_block_group_cache *used_bg = NULL; |
6719afdc | 7377 | |
e570fd27 | 7378 | spin_lock(&cluster->refill_lock); |
6719afdc GU |
7379 | while (1) { |
7380 | used_bg = cluster->block_group; | |
7381 | if (!used_bg) | |
7382 | return NULL; | |
7383 | ||
7384 | if (used_bg == block_group) | |
e570fd27 MX |
7385 | return used_bg; |
7386 | ||
6719afdc | 7387 | btrfs_get_block_group(used_bg); |
e570fd27 | 7388 | |
6719afdc GU |
7389 | if (!delalloc) |
7390 | return used_bg; | |
e570fd27 | 7391 | |
6719afdc GU |
7392 | if (down_read_trylock(&used_bg->data_rwsem)) |
7393 | return used_bg; | |
e570fd27 | 7394 | |
6719afdc | 7395 | spin_unlock(&cluster->refill_lock); |
e570fd27 | 7396 | |
e321f8a8 LB |
7397 | /* We should only have one-level nested. */ |
7398 | down_read_nested(&used_bg->data_rwsem, SINGLE_DEPTH_NESTING); | |
e570fd27 | 7399 | |
6719afdc GU |
7400 | spin_lock(&cluster->refill_lock); |
7401 | if (used_bg == cluster->block_group) | |
7402 | return used_bg; | |
e570fd27 | 7403 | |
6719afdc GU |
7404 | up_read(&used_bg->data_rwsem); |
7405 | btrfs_put_block_group(used_bg); | |
7406 | } | |
e570fd27 MX |
7407 | } |
7408 | ||
7409 | static inline void | |
7410 | btrfs_release_block_group(struct btrfs_block_group_cache *cache, | |
7411 | int delalloc) | |
7412 | { | |
7413 | if (delalloc) | |
7414 | up_read(&cache->data_rwsem); | |
7415 | btrfs_put_block_group(cache); | |
7416 | } | |
7417 | ||
fec577fb CM |
7418 | /* |
7419 | * walks the btree of allocated extents and find a hole of a given size. | |
7420 | * The key ins is changed to record the hole: | |
a4820398 | 7421 | * ins->objectid == start position |
62e2749e | 7422 | * ins->flags = BTRFS_EXTENT_ITEM_KEY |
a4820398 | 7423 | * ins->offset == the size of the hole. |
fec577fb | 7424 | * Any available blocks before search_start are skipped. |
a4820398 MX |
7425 | * |
7426 | * If there is no suitable free space, we will record the max size of | |
7427 | * the free space extent currently. | |
fec577fb | 7428 | */ |
87bde3cd | 7429 | static noinline int find_free_extent(struct btrfs_fs_info *fs_info, |
18513091 WX |
7430 | u64 ram_bytes, u64 num_bytes, u64 empty_size, |
7431 | u64 hint_byte, struct btrfs_key *ins, | |
7432 | u64 flags, int delalloc) | |
fec577fb | 7433 | { |
80eb234a | 7434 | int ret = 0; |
0b246afa | 7435 | struct btrfs_root *root = fs_info->extent_root; |
fa9c0d79 | 7436 | struct btrfs_free_cluster *last_ptr = NULL; |
80eb234a | 7437 | struct btrfs_block_group_cache *block_group = NULL; |
81c9ad23 | 7438 | u64 search_start = 0; |
a4820398 | 7439 | u64 max_extent_size = 0; |
c759c4e1 | 7440 | u64 empty_cluster = 0; |
80eb234a | 7441 | struct btrfs_space_info *space_info; |
fa9c0d79 | 7442 | int loop = 0; |
b6919a58 | 7443 | int index = __get_raid_index(flags); |
0a24325e | 7444 | bool failed_cluster_refill = false; |
1cdda9b8 | 7445 | bool failed_alloc = false; |
67377734 | 7446 | bool use_cluster = true; |
60d2adbb | 7447 | bool have_caching_bg = false; |
13a0db5a | 7448 | bool orig_have_caching_bg = false; |
a5e681d9 | 7449 | bool full_search = false; |
fec577fb | 7450 | |
0b246afa | 7451 | WARN_ON(num_bytes < fs_info->sectorsize); |
962a298f | 7452 | ins->type = BTRFS_EXTENT_ITEM_KEY; |
80eb234a JB |
7453 | ins->objectid = 0; |
7454 | ins->offset = 0; | |
b1a4d965 | 7455 | |
71ff6437 | 7456 | trace_find_free_extent(fs_info, num_bytes, empty_size, flags); |
3f7de037 | 7457 | |
0b246afa | 7458 | space_info = __find_space_info(fs_info, flags); |
1b1d1f66 | 7459 | if (!space_info) { |
0b246afa | 7460 | btrfs_err(fs_info, "No space info for %llu", flags); |
1b1d1f66 JB |
7461 | return -ENOSPC; |
7462 | } | |
2552d17e | 7463 | |
67377734 | 7464 | /* |
4f4db217 JB |
7465 | * If our free space is heavily fragmented we may not be able to make |
7466 | * big contiguous allocations, so instead of doing the expensive search | |
7467 | * for free space, simply return ENOSPC with our max_extent_size so we | |
7468 | * can go ahead and search for a more manageable chunk. | |
7469 | * | |
7470 | * If our max_extent_size is large enough for our allocation simply | |
7471 | * disable clustering since we will likely not be able to find enough | |
7472 | * space to create a cluster and induce latency trying. | |
67377734 | 7473 | */ |
4f4db217 JB |
7474 | if (unlikely(space_info->max_extent_size)) { |
7475 | spin_lock(&space_info->lock); | |
7476 | if (space_info->max_extent_size && | |
7477 | num_bytes > space_info->max_extent_size) { | |
7478 | ins->offset = space_info->max_extent_size; | |
7479 | spin_unlock(&space_info->lock); | |
7480 | return -ENOSPC; | |
7481 | } else if (space_info->max_extent_size) { | |
7482 | use_cluster = false; | |
7483 | } | |
7484 | spin_unlock(&space_info->lock); | |
fa9c0d79 | 7485 | } |
0f9dd46c | 7486 | |
2ff7e61e | 7487 | last_ptr = fetch_cluster_info(fs_info, space_info, &empty_cluster); |
239b14b3 | 7488 | if (last_ptr) { |
fa9c0d79 CM |
7489 | spin_lock(&last_ptr->lock); |
7490 | if (last_ptr->block_group) | |
7491 | hint_byte = last_ptr->window_start; | |
c759c4e1 JB |
7492 | if (last_ptr->fragmented) { |
7493 | /* | |
7494 | * We still set window_start so we can keep track of the | |
7495 | * last place we found an allocation to try and save | |
7496 | * some time. | |
7497 | */ | |
7498 | hint_byte = last_ptr->window_start; | |
7499 | use_cluster = false; | |
7500 | } | |
fa9c0d79 | 7501 | spin_unlock(&last_ptr->lock); |
239b14b3 | 7502 | } |
fa9c0d79 | 7503 | |
2ff7e61e | 7504 | search_start = max(search_start, first_logical_byte(fs_info, 0)); |
239b14b3 | 7505 | search_start = max(search_start, hint_byte); |
2552d17e | 7506 | if (search_start == hint_byte) { |
0b246afa | 7507 | block_group = btrfs_lookup_block_group(fs_info, search_start); |
817d52f8 JB |
7508 | /* |
7509 | * we don't want to use the block group if it doesn't match our | |
7510 | * allocation bits, or if its not cached. | |
ccf0e725 JB |
7511 | * |
7512 | * However if we are re-searching with an ideal block group | |
7513 | * picked out then we don't care that the block group is cached. | |
817d52f8 | 7514 | */ |
b6919a58 | 7515 | if (block_group && block_group_bits(block_group, flags) && |
285ff5af | 7516 | block_group->cached != BTRFS_CACHE_NO) { |
2552d17e | 7517 | down_read(&space_info->groups_sem); |
44fb5511 CM |
7518 | if (list_empty(&block_group->list) || |
7519 | block_group->ro) { | |
7520 | /* | |
7521 | * someone is removing this block group, | |
7522 | * we can't jump into the have_block_group | |
7523 | * target because our list pointers are not | |
7524 | * valid | |
7525 | */ | |
7526 | btrfs_put_block_group(block_group); | |
7527 | up_read(&space_info->groups_sem); | |
ccf0e725 | 7528 | } else { |
b742bb82 | 7529 | index = get_block_group_index(block_group); |
e570fd27 | 7530 | btrfs_lock_block_group(block_group, delalloc); |
44fb5511 | 7531 | goto have_block_group; |
ccf0e725 | 7532 | } |
2552d17e | 7533 | } else if (block_group) { |
fa9c0d79 | 7534 | btrfs_put_block_group(block_group); |
2552d17e | 7535 | } |
42e70e7a | 7536 | } |
2552d17e | 7537 | search: |
60d2adbb | 7538 | have_caching_bg = false; |
a5e681d9 JB |
7539 | if (index == 0 || index == __get_raid_index(flags)) |
7540 | full_search = true; | |
80eb234a | 7541 | down_read(&space_info->groups_sem); |
b742bb82 YZ |
7542 | list_for_each_entry(block_group, &space_info->block_groups[index], |
7543 | list) { | |
6226cb0a | 7544 | u64 offset; |
817d52f8 | 7545 | int cached; |
8a1413a2 | 7546 | |
e570fd27 | 7547 | btrfs_grab_block_group(block_group, delalloc); |
2552d17e | 7548 | search_start = block_group->key.objectid; |
42e70e7a | 7549 | |
83a50de9 CM |
7550 | /* |
7551 | * this can happen if we end up cycling through all the | |
7552 | * raid types, but we want to make sure we only allocate | |
7553 | * for the proper type. | |
7554 | */ | |
b6919a58 | 7555 | if (!block_group_bits(block_group, flags)) { |
83a50de9 CM |
7556 | u64 extra = BTRFS_BLOCK_GROUP_DUP | |
7557 | BTRFS_BLOCK_GROUP_RAID1 | | |
53b381b3 DW |
7558 | BTRFS_BLOCK_GROUP_RAID5 | |
7559 | BTRFS_BLOCK_GROUP_RAID6 | | |
83a50de9 CM |
7560 | BTRFS_BLOCK_GROUP_RAID10; |
7561 | ||
7562 | /* | |
7563 | * if they asked for extra copies and this block group | |
7564 | * doesn't provide them, bail. This does allow us to | |
7565 | * fill raid0 from raid1. | |
7566 | */ | |
b6919a58 | 7567 | if ((flags & extra) && !(block_group->flags & extra)) |
83a50de9 CM |
7568 | goto loop; |
7569 | } | |
7570 | ||
2552d17e | 7571 | have_block_group: |
291c7d2f JB |
7572 | cached = block_group_cache_done(block_group); |
7573 | if (unlikely(!cached)) { | |
a5e681d9 | 7574 | have_caching_bg = true; |
f6373bf3 | 7575 | ret = cache_block_group(block_group, 0); |
1d4284bd CM |
7576 | BUG_ON(ret < 0); |
7577 | ret = 0; | |
817d52f8 JB |
7578 | } |
7579 | ||
36cce922 JB |
7580 | if (unlikely(block_group->cached == BTRFS_CACHE_ERROR)) |
7581 | goto loop; | |
ea6a478e | 7582 | if (unlikely(block_group->ro)) |
2552d17e | 7583 | goto loop; |
0f9dd46c | 7584 | |
0a24325e | 7585 | /* |
062c05c4 AO |
7586 | * Ok we want to try and use the cluster allocator, so |
7587 | * lets look there | |
0a24325e | 7588 | */ |
c759c4e1 | 7589 | if (last_ptr && use_cluster) { |
215a63d1 | 7590 | struct btrfs_block_group_cache *used_block_group; |
8de972b4 | 7591 | unsigned long aligned_cluster; |
fa9c0d79 CM |
7592 | /* |
7593 | * the refill lock keeps out other | |
7594 | * people trying to start a new cluster | |
7595 | */ | |
e570fd27 MX |
7596 | used_block_group = btrfs_lock_cluster(block_group, |
7597 | last_ptr, | |
7598 | delalloc); | |
7599 | if (!used_block_group) | |
44fb5511 | 7600 | goto refill_cluster; |
274bd4fb | 7601 | |
e570fd27 MX |
7602 | if (used_block_group != block_group && |
7603 | (used_block_group->ro || | |
7604 | !block_group_bits(used_block_group, flags))) | |
7605 | goto release_cluster; | |
44fb5511 | 7606 | |
274bd4fb | 7607 | offset = btrfs_alloc_from_cluster(used_block_group, |
a4820398 MX |
7608 | last_ptr, |
7609 | num_bytes, | |
7610 | used_block_group->key.objectid, | |
7611 | &max_extent_size); | |
fa9c0d79 CM |
7612 | if (offset) { |
7613 | /* we have a block, we're done */ | |
7614 | spin_unlock(&last_ptr->refill_lock); | |
71ff6437 | 7615 | trace_btrfs_reserve_extent_cluster(fs_info, |
89d4346a MX |
7616 | used_block_group, |
7617 | search_start, num_bytes); | |
215a63d1 | 7618 | if (used_block_group != block_group) { |
e570fd27 MX |
7619 | btrfs_release_block_group(block_group, |
7620 | delalloc); | |
215a63d1 MX |
7621 | block_group = used_block_group; |
7622 | } | |
fa9c0d79 CM |
7623 | goto checks; |
7624 | } | |
7625 | ||
274bd4fb | 7626 | WARN_ON(last_ptr->block_group != used_block_group); |
e570fd27 | 7627 | release_cluster: |
062c05c4 AO |
7628 | /* If we are on LOOP_NO_EMPTY_SIZE, we can't |
7629 | * set up a new clusters, so lets just skip it | |
7630 | * and let the allocator find whatever block | |
7631 | * it can find. If we reach this point, we | |
7632 | * will have tried the cluster allocator | |
7633 | * plenty of times and not have found | |
7634 | * anything, so we are likely way too | |
7635 | * fragmented for the clustering stuff to find | |
a5f6f719 AO |
7636 | * anything. |
7637 | * | |
7638 | * However, if the cluster is taken from the | |
7639 | * current block group, release the cluster | |
7640 | * first, so that we stand a better chance of | |
7641 | * succeeding in the unclustered | |
7642 | * allocation. */ | |
7643 | if (loop >= LOOP_NO_EMPTY_SIZE && | |
e570fd27 | 7644 | used_block_group != block_group) { |
062c05c4 | 7645 | spin_unlock(&last_ptr->refill_lock); |
e570fd27 MX |
7646 | btrfs_release_block_group(used_block_group, |
7647 | delalloc); | |
062c05c4 AO |
7648 | goto unclustered_alloc; |
7649 | } | |
7650 | ||
fa9c0d79 CM |
7651 | /* |
7652 | * this cluster didn't work out, free it and | |
7653 | * start over | |
7654 | */ | |
7655 | btrfs_return_cluster_to_free_space(NULL, last_ptr); | |
7656 | ||
e570fd27 MX |
7657 | if (used_block_group != block_group) |
7658 | btrfs_release_block_group(used_block_group, | |
7659 | delalloc); | |
7660 | refill_cluster: | |
a5f6f719 AO |
7661 | if (loop >= LOOP_NO_EMPTY_SIZE) { |
7662 | spin_unlock(&last_ptr->refill_lock); | |
7663 | goto unclustered_alloc; | |
7664 | } | |
7665 | ||
8de972b4 CM |
7666 | aligned_cluster = max_t(unsigned long, |
7667 | empty_cluster + empty_size, | |
7668 | block_group->full_stripe_len); | |
7669 | ||
fa9c0d79 | 7670 | /* allocate a cluster in this block group */ |
2ff7e61e | 7671 | ret = btrfs_find_space_cluster(fs_info, block_group, |
00361589 JB |
7672 | last_ptr, search_start, |
7673 | num_bytes, | |
7674 | aligned_cluster); | |
fa9c0d79 CM |
7675 | if (ret == 0) { |
7676 | /* | |
7677 | * now pull our allocation out of this | |
7678 | * cluster | |
7679 | */ | |
7680 | offset = btrfs_alloc_from_cluster(block_group, | |
a4820398 MX |
7681 | last_ptr, |
7682 | num_bytes, | |
7683 | search_start, | |
7684 | &max_extent_size); | |
fa9c0d79 CM |
7685 | if (offset) { |
7686 | /* we found one, proceed */ | |
7687 | spin_unlock(&last_ptr->refill_lock); | |
71ff6437 | 7688 | trace_btrfs_reserve_extent_cluster(fs_info, |
3f7de037 JB |
7689 | block_group, search_start, |
7690 | num_bytes); | |
fa9c0d79 CM |
7691 | goto checks; |
7692 | } | |
0a24325e JB |
7693 | } else if (!cached && loop > LOOP_CACHING_NOWAIT |
7694 | && !failed_cluster_refill) { | |
817d52f8 JB |
7695 | spin_unlock(&last_ptr->refill_lock); |
7696 | ||
0a24325e | 7697 | failed_cluster_refill = true; |
817d52f8 JB |
7698 | wait_block_group_cache_progress(block_group, |
7699 | num_bytes + empty_cluster + empty_size); | |
7700 | goto have_block_group; | |
fa9c0d79 | 7701 | } |
817d52f8 | 7702 | |
fa9c0d79 CM |
7703 | /* |
7704 | * at this point we either didn't find a cluster | |
7705 | * or we weren't able to allocate a block from our | |
7706 | * cluster. Free the cluster we've been trying | |
7707 | * to use, and go to the next block group | |
7708 | */ | |
0a24325e | 7709 | btrfs_return_cluster_to_free_space(NULL, last_ptr); |
fa9c0d79 | 7710 | spin_unlock(&last_ptr->refill_lock); |
0a24325e | 7711 | goto loop; |
fa9c0d79 CM |
7712 | } |
7713 | ||
062c05c4 | 7714 | unclustered_alloc: |
c759c4e1 JB |
7715 | /* |
7716 | * We are doing an unclustered alloc, set the fragmented flag so | |
7717 | * we don't bother trying to setup a cluster again until we get | |
7718 | * more space. | |
7719 | */ | |
7720 | if (unlikely(last_ptr)) { | |
7721 | spin_lock(&last_ptr->lock); | |
7722 | last_ptr->fragmented = 1; | |
7723 | spin_unlock(&last_ptr->lock); | |
7724 | } | |
0c9b36e0 LB |
7725 | if (cached) { |
7726 | struct btrfs_free_space_ctl *ctl = | |
7727 | block_group->free_space_ctl; | |
7728 | ||
7729 | spin_lock(&ctl->tree_lock); | |
7730 | if (ctl->free_space < | |
7731 | num_bytes + empty_cluster + empty_size) { | |
7732 | if (ctl->free_space > max_extent_size) | |
7733 | max_extent_size = ctl->free_space; | |
7734 | spin_unlock(&ctl->tree_lock); | |
7735 | goto loop; | |
7736 | } | |
7737 | spin_unlock(&ctl->tree_lock); | |
a5f6f719 | 7738 | } |
a5f6f719 | 7739 | |
6226cb0a | 7740 | offset = btrfs_find_space_for_alloc(block_group, search_start, |
a4820398 MX |
7741 | num_bytes, empty_size, |
7742 | &max_extent_size); | |
1cdda9b8 JB |
7743 | /* |
7744 | * If we didn't find a chunk, and we haven't failed on this | |
7745 | * block group before, and this block group is in the middle of | |
7746 | * caching and we are ok with waiting, then go ahead and wait | |
7747 | * for progress to be made, and set failed_alloc to true. | |
7748 | * | |
7749 | * If failed_alloc is true then we've already waited on this | |
7750 | * block group once and should move on to the next block group. | |
7751 | */ | |
7752 | if (!offset && !failed_alloc && !cached && | |
7753 | loop > LOOP_CACHING_NOWAIT) { | |
817d52f8 | 7754 | wait_block_group_cache_progress(block_group, |
1cdda9b8 JB |
7755 | num_bytes + empty_size); |
7756 | failed_alloc = true; | |
817d52f8 | 7757 | goto have_block_group; |
1cdda9b8 JB |
7758 | } else if (!offset) { |
7759 | goto loop; | |
817d52f8 | 7760 | } |
fa9c0d79 | 7761 | checks: |
0b246afa | 7762 | search_start = ALIGN(offset, fs_info->stripesize); |
25179201 | 7763 | |
2552d17e JB |
7764 | /* move on to the next group */ |
7765 | if (search_start + num_bytes > | |
215a63d1 MX |
7766 | block_group->key.objectid + block_group->key.offset) { |
7767 | btrfs_add_free_space(block_group, offset, num_bytes); | |
2552d17e | 7768 | goto loop; |
6226cb0a | 7769 | } |
f5a31e16 | 7770 | |
f0486c68 | 7771 | if (offset < search_start) |
215a63d1 | 7772 | btrfs_add_free_space(block_group, offset, |
f0486c68 YZ |
7773 | search_start - offset); |
7774 | BUG_ON(offset > search_start); | |
2552d17e | 7775 | |
18513091 WX |
7776 | ret = btrfs_add_reserved_bytes(block_group, ram_bytes, |
7777 | num_bytes, delalloc); | |
f0486c68 | 7778 | if (ret == -EAGAIN) { |
215a63d1 | 7779 | btrfs_add_free_space(block_group, offset, num_bytes); |
2552d17e | 7780 | goto loop; |
0f9dd46c | 7781 | } |
9cfa3e34 | 7782 | btrfs_inc_block_group_reservations(block_group); |
0b86a832 | 7783 | |
f0486c68 | 7784 | /* we are all good, lets return */ |
2552d17e JB |
7785 | ins->objectid = search_start; |
7786 | ins->offset = num_bytes; | |
d2fb3437 | 7787 | |
71ff6437 | 7788 | trace_btrfs_reserve_extent(fs_info, block_group, |
3f7de037 | 7789 | search_start, num_bytes); |
e570fd27 | 7790 | btrfs_release_block_group(block_group, delalloc); |
2552d17e JB |
7791 | break; |
7792 | loop: | |
0a24325e | 7793 | failed_cluster_refill = false; |
1cdda9b8 | 7794 | failed_alloc = false; |
b742bb82 | 7795 | BUG_ON(index != get_block_group_index(block_group)); |
e570fd27 | 7796 | btrfs_release_block_group(block_group, delalloc); |
2552d17e JB |
7797 | } |
7798 | up_read(&space_info->groups_sem); | |
7799 | ||
13a0db5a | 7800 | if ((loop == LOOP_CACHING_NOWAIT) && have_caching_bg |
7801 | && !orig_have_caching_bg) | |
7802 | orig_have_caching_bg = true; | |
7803 | ||
60d2adbb MX |
7804 | if (!ins->objectid && loop >= LOOP_CACHING_WAIT && have_caching_bg) |
7805 | goto search; | |
7806 | ||
b742bb82 YZ |
7807 | if (!ins->objectid && ++index < BTRFS_NR_RAID_TYPES) |
7808 | goto search; | |
7809 | ||
285ff5af | 7810 | /* |
ccf0e725 JB |
7811 | * LOOP_CACHING_NOWAIT, search partially cached block groups, kicking |
7812 | * caching kthreads as we move along | |
817d52f8 JB |
7813 | * LOOP_CACHING_WAIT, search everything, and wait if our bg is caching |
7814 | * LOOP_ALLOC_CHUNK, force a chunk allocation and try again | |
7815 | * LOOP_NO_EMPTY_SIZE, set empty_size and empty_cluster to 0 and try | |
7816 | * again | |
fa9c0d79 | 7817 | */ |
723bda20 | 7818 | if (!ins->objectid && loop < LOOP_NO_EMPTY_SIZE) { |
b742bb82 | 7819 | index = 0; |
a5e681d9 JB |
7820 | if (loop == LOOP_CACHING_NOWAIT) { |
7821 | /* | |
7822 | * We want to skip the LOOP_CACHING_WAIT step if we | |
01327610 | 7823 | * don't have any uncached bgs and we've already done a |
a5e681d9 JB |
7824 | * full search through. |
7825 | */ | |
13a0db5a | 7826 | if (orig_have_caching_bg || !full_search) |
a5e681d9 JB |
7827 | loop = LOOP_CACHING_WAIT; |
7828 | else | |
7829 | loop = LOOP_ALLOC_CHUNK; | |
7830 | } else { | |
7831 | loop++; | |
7832 | } | |
7833 | ||
817d52f8 | 7834 | if (loop == LOOP_ALLOC_CHUNK) { |
00361589 | 7835 | struct btrfs_trans_handle *trans; |
f017f15f WS |
7836 | int exist = 0; |
7837 | ||
7838 | trans = current->journal_info; | |
7839 | if (trans) | |
7840 | exist = 1; | |
7841 | else | |
7842 | trans = btrfs_join_transaction(root); | |
00361589 | 7843 | |
00361589 JB |
7844 | if (IS_ERR(trans)) { |
7845 | ret = PTR_ERR(trans); | |
7846 | goto out; | |
7847 | } | |
7848 | ||
2ff7e61e | 7849 | ret = do_chunk_alloc(trans, fs_info, flags, |
ea658bad | 7850 | CHUNK_ALLOC_FORCE); |
a5e681d9 JB |
7851 | |
7852 | /* | |
7853 | * If we can't allocate a new chunk we've already looped | |
7854 | * through at least once, move on to the NO_EMPTY_SIZE | |
7855 | * case. | |
7856 | */ | |
7857 | if (ret == -ENOSPC) | |
7858 | loop = LOOP_NO_EMPTY_SIZE; | |
7859 | ||
ea658bad JB |
7860 | /* |
7861 | * Do not bail out on ENOSPC since we | |
7862 | * can do more things. | |
7863 | */ | |
00361589 | 7864 | if (ret < 0 && ret != -ENOSPC) |
66642832 | 7865 | btrfs_abort_transaction(trans, ret); |
00361589 JB |
7866 | else |
7867 | ret = 0; | |
f017f15f | 7868 | if (!exist) |
3a45bb20 | 7869 | btrfs_end_transaction(trans); |
00361589 | 7870 | if (ret) |
ea658bad | 7871 | goto out; |
2552d17e JB |
7872 | } |
7873 | ||
723bda20 | 7874 | if (loop == LOOP_NO_EMPTY_SIZE) { |
a5e681d9 JB |
7875 | /* |
7876 | * Don't loop again if we already have no empty_size and | |
7877 | * no empty_cluster. | |
7878 | */ | |
7879 | if (empty_size == 0 && | |
7880 | empty_cluster == 0) { | |
7881 | ret = -ENOSPC; | |
7882 | goto out; | |
7883 | } | |
723bda20 JB |
7884 | empty_size = 0; |
7885 | empty_cluster = 0; | |
fa9c0d79 | 7886 | } |
723bda20 JB |
7887 | |
7888 | goto search; | |
2552d17e JB |
7889 | } else if (!ins->objectid) { |
7890 | ret = -ENOSPC; | |
d82a6f1d | 7891 | } else if (ins->objectid) { |
c759c4e1 JB |
7892 | if (!use_cluster && last_ptr) { |
7893 | spin_lock(&last_ptr->lock); | |
7894 | last_ptr->window_start = ins->objectid; | |
7895 | spin_unlock(&last_ptr->lock); | |
7896 | } | |
80eb234a | 7897 | ret = 0; |
be744175 | 7898 | } |
79787eaa | 7899 | out: |
4f4db217 JB |
7900 | if (ret == -ENOSPC) { |
7901 | spin_lock(&space_info->lock); | |
7902 | space_info->max_extent_size = max_extent_size; | |
7903 | spin_unlock(&space_info->lock); | |
a4820398 | 7904 | ins->offset = max_extent_size; |
4f4db217 | 7905 | } |
0f70abe2 | 7906 | return ret; |
fec577fb | 7907 | } |
ec44a35c | 7908 | |
ab8d0fc4 JM |
7909 | static void dump_space_info(struct btrfs_fs_info *fs_info, |
7910 | struct btrfs_space_info *info, u64 bytes, | |
9ed74f2d | 7911 | int dump_block_groups) |
0f9dd46c JB |
7912 | { |
7913 | struct btrfs_block_group_cache *cache; | |
b742bb82 | 7914 | int index = 0; |
0f9dd46c | 7915 | |
9ed74f2d | 7916 | spin_lock(&info->lock); |
ab8d0fc4 JM |
7917 | btrfs_info(fs_info, "space_info %llu has %llu free, is %sfull", |
7918 | info->flags, | |
4136135b LB |
7919 | info->total_bytes - btrfs_space_info_used(info, true), |
7920 | info->full ? "" : "not "); | |
ab8d0fc4 JM |
7921 | btrfs_info(fs_info, |
7922 | "space_info total=%llu, used=%llu, pinned=%llu, reserved=%llu, may_use=%llu, readonly=%llu", | |
7923 | info->total_bytes, info->bytes_used, info->bytes_pinned, | |
7924 | info->bytes_reserved, info->bytes_may_use, | |
7925 | info->bytes_readonly); | |
9ed74f2d JB |
7926 | spin_unlock(&info->lock); |
7927 | ||
7928 | if (!dump_block_groups) | |
7929 | return; | |
0f9dd46c | 7930 | |
80eb234a | 7931 | down_read(&info->groups_sem); |
b742bb82 YZ |
7932 | again: |
7933 | list_for_each_entry(cache, &info->block_groups[index], list) { | |
0f9dd46c | 7934 | spin_lock(&cache->lock); |
ab8d0fc4 JM |
7935 | btrfs_info(fs_info, |
7936 | "block group %llu has %llu bytes, %llu used %llu pinned %llu reserved %s", | |
7937 | cache->key.objectid, cache->key.offset, | |
7938 | btrfs_block_group_used(&cache->item), cache->pinned, | |
7939 | cache->reserved, cache->ro ? "[readonly]" : ""); | |
0f9dd46c JB |
7940 | btrfs_dump_free_space(cache, bytes); |
7941 | spin_unlock(&cache->lock); | |
7942 | } | |
b742bb82 YZ |
7943 | if (++index < BTRFS_NR_RAID_TYPES) |
7944 | goto again; | |
80eb234a | 7945 | up_read(&info->groups_sem); |
0f9dd46c | 7946 | } |
e8569813 | 7947 | |
18513091 | 7948 | int btrfs_reserve_extent(struct btrfs_root *root, u64 ram_bytes, |
11833d66 YZ |
7949 | u64 num_bytes, u64 min_alloc_size, |
7950 | u64 empty_size, u64 hint_byte, | |
e570fd27 | 7951 | struct btrfs_key *ins, int is_data, int delalloc) |
fec577fb | 7952 | { |
ab8d0fc4 | 7953 | struct btrfs_fs_info *fs_info = root->fs_info; |
36af4e07 | 7954 | bool final_tried = num_bytes == min_alloc_size; |
b6919a58 | 7955 | u64 flags; |
fec577fb | 7956 | int ret; |
925baedd | 7957 | |
b6919a58 | 7958 | flags = btrfs_get_alloc_profile(root, is_data); |
98d20f67 | 7959 | again: |
0b246afa | 7960 | WARN_ON(num_bytes < fs_info->sectorsize); |
87bde3cd | 7961 | ret = find_free_extent(fs_info, ram_bytes, num_bytes, empty_size, |
18513091 | 7962 | hint_byte, ins, flags, delalloc); |
9cfa3e34 | 7963 | if (!ret && !is_data) { |
ab8d0fc4 | 7964 | btrfs_dec_block_group_reservations(fs_info, ins->objectid); |
9cfa3e34 | 7965 | } else if (ret == -ENOSPC) { |
a4820398 MX |
7966 | if (!final_tried && ins->offset) { |
7967 | num_bytes = min(num_bytes >> 1, ins->offset); | |
da17066c | 7968 | num_bytes = round_down(num_bytes, |
0b246afa | 7969 | fs_info->sectorsize); |
9e622d6b | 7970 | num_bytes = max(num_bytes, min_alloc_size); |
18513091 | 7971 | ram_bytes = num_bytes; |
9e622d6b MX |
7972 | if (num_bytes == min_alloc_size) |
7973 | final_tried = true; | |
7974 | goto again; | |
ab8d0fc4 | 7975 | } else if (btrfs_test_opt(fs_info, ENOSPC_DEBUG)) { |
9e622d6b MX |
7976 | struct btrfs_space_info *sinfo; |
7977 | ||
ab8d0fc4 | 7978 | sinfo = __find_space_info(fs_info, flags); |
0b246afa | 7979 | btrfs_err(fs_info, |
5d163e0e JM |
7980 | "allocation failed flags %llu, wanted %llu", |
7981 | flags, num_bytes); | |
53804280 | 7982 | if (sinfo) |
ab8d0fc4 | 7983 | dump_space_info(fs_info, sinfo, num_bytes, 1); |
9e622d6b | 7984 | } |
925baedd | 7985 | } |
0f9dd46c JB |
7986 | |
7987 | return ret; | |
e6dcd2dc CM |
7988 | } |
7989 | ||
2ff7e61e | 7990 | static int __btrfs_free_reserved_extent(struct btrfs_fs_info *fs_info, |
e570fd27 MX |
7991 | u64 start, u64 len, |
7992 | int pin, int delalloc) | |
65b51a00 | 7993 | { |
0f9dd46c | 7994 | struct btrfs_block_group_cache *cache; |
1f3c79a2 | 7995 | int ret = 0; |
0f9dd46c | 7996 | |
0b246afa | 7997 | cache = btrfs_lookup_block_group(fs_info, start); |
0f9dd46c | 7998 | if (!cache) { |
0b246afa JM |
7999 | btrfs_err(fs_info, "Unable to find block group for %llu", |
8000 | start); | |
0f9dd46c JB |
8001 | return -ENOSPC; |
8002 | } | |
1f3c79a2 | 8003 | |
e688b725 | 8004 | if (pin) |
2ff7e61e | 8005 | pin_down_extent(fs_info, cache, start, len, 1); |
e688b725 | 8006 | else { |
0b246afa | 8007 | if (btrfs_test_opt(fs_info, DISCARD)) |
2ff7e61e | 8008 | ret = btrfs_discard_extent(fs_info, start, len, NULL); |
e688b725 | 8009 | btrfs_add_free_space(cache, start, len); |
4824f1f4 | 8010 | btrfs_free_reserved_bytes(cache, len, delalloc); |
71ff6437 | 8011 | trace_btrfs_reserved_extent_free(fs_info, start, len); |
e688b725 | 8012 | } |
31193213 | 8013 | |
fa9c0d79 | 8014 | btrfs_put_block_group(cache); |
e6dcd2dc CM |
8015 | return ret; |
8016 | } | |
8017 | ||
2ff7e61e | 8018 | int btrfs_free_reserved_extent(struct btrfs_fs_info *fs_info, |
e570fd27 | 8019 | u64 start, u64 len, int delalloc) |
e688b725 | 8020 | { |
2ff7e61e | 8021 | return __btrfs_free_reserved_extent(fs_info, start, len, 0, delalloc); |
e688b725 CM |
8022 | } |
8023 | ||
2ff7e61e | 8024 | int btrfs_free_and_pin_reserved_extent(struct btrfs_fs_info *fs_info, |
e688b725 CM |
8025 | u64 start, u64 len) |
8026 | { | |
2ff7e61e | 8027 | return __btrfs_free_reserved_extent(fs_info, start, len, 1, 0); |
e688b725 CM |
8028 | } |
8029 | ||
5d4f98a2 | 8030 | static int alloc_reserved_file_extent(struct btrfs_trans_handle *trans, |
2ff7e61e | 8031 | struct btrfs_fs_info *fs_info, |
5d4f98a2 YZ |
8032 | u64 parent, u64 root_objectid, |
8033 | u64 flags, u64 owner, u64 offset, | |
8034 | struct btrfs_key *ins, int ref_mod) | |
e6dcd2dc CM |
8035 | { |
8036 | int ret; | |
e6dcd2dc | 8037 | struct btrfs_extent_item *extent_item; |
5d4f98a2 | 8038 | struct btrfs_extent_inline_ref *iref; |
e6dcd2dc | 8039 | struct btrfs_path *path; |
5d4f98a2 YZ |
8040 | struct extent_buffer *leaf; |
8041 | int type; | |
8042 | u32 size; | |
26b8003f | 8043 | |
5d4f98a2 YZ |
8044 | if (parent > 0) |
8045 | type = BTRFS_SHARED_DATA_REF_KEY; | |
8046 | else | |
8047 | type = BTRFS_EXTENT_DATA_REF_KEY; | |
58176a96 | 8048 | |
5d4f98a2 | 8049 | size = sizeof(*extent_item) + btrfs_extent_inline_ref_size(type); |
7bb86316 CM |
8050 | |
8051 | path = btrfs_alloc_path(); | |
db5b493a TI |
8052 | if (!path) |
8053 | return -ENOMEM; | |
47e4bb98 | 8054 | |
b9473439 | 8055 | path->leave_spinning = 1; |
5d4f98a2 YZ |
8056 | ret = btrfs_insert_empty_item(trans, fs_info->extent_root, path, |
8057 | ins, size); | |
79787eaa JM |
8058 | if (ret) { |
8059 | btrfs_free_path(path); | |
8060 | return ret; | |
8061 | } | |
0f9dd46c | 8062 | |
5d4f98a2 YZ |
8063 | leaf = path->nodes[0]; |
8064 | extent_item = btrfs_item_ptr(leaf, path->slots[0], | |
47e4bb98 | 8065 | struct btrfs_extent_item); |
5d4f98a2 YZ |
8066 | btrfs_set_extent_refs(leaf, extent_item, ref_mod); |
8067 | btrfs_set_extent_generation(leaf, extent_item, trans->transid); | |
8068 | btrfs_set_extent_flags(leaf, extent_item, | |
8069 | flags | BTRFS_EXTENT_FLAG_DATA); | |
8070 | ||
8071 | iref = (struct btrfs_extent_inline_ref *)(extent_item + 1); | |
8072 | btrfs_set_extent_inline_ref_type(leaf, iref, type); | |
8073 | if (parent > 0) { | |
8074 | struct btrfs_shared_data_ref *ref; | |
8075 | ref = (struct btrfs_shared_data_ref *)(iref + 1); | |
8076 | btrfs_set_extent_inline_ref_offset(leaf, iref, parent); | |
8077 | btrfs_set_shared_data_ref_count(leaf, ref, ref_mod); | |
8078 | } else { | |
8079 | struct btrfs_extent_data_ref *ref; | |
8080 | ref = (struct btrfs_extent_data_ref *)(&iref->offset); | |
8081 | btrfs_set_extent_data_ref_root(leaf, ref, root_objectid); | |
8082 | btrfs_set_extent_data_ref_objectid(leaf, ref, owner); | |
8083 | btrfs_set_extent_data_ref_offset(leaf, ref, offset); | |
8084 | btrfs_set_extent_data_ref_count(leaf, ref, ref_mod); | |
8085 | } | |
47e4bb98 CM |
8086 | |
8087 | btrfs_mark_buffer_dirty(path->nodes[0]); | |
7bb86316 | 8088 | btrfs_free_path(path); |
f510cfec | 8089 | |
1e144fb8 OS |
8090 | ret = remove_from_free_space_tree(trans, fs_info, ins->objectid, |
8091 | ins->offset); | |
8092 | if (ret) | |
8093 | return ret; | |
8094 | ||
6202df69 | 8095 | ret = update_block_group(trans, fs_info, ins->objectid, ins->offset, 1); |
79787eaa | 8096 | if (ret) { /* -ENOENT, logic error */ |
c2cf52eb | 8097 | btrfs_err(fs_info, "update block group failed for %llu %llu", |
c1c9ff7c | 8098 | ins->objectid, ins->offset); |
f5947066 CM |
8099 | BUG(); |
8100 | } | |
71ff6437 | 8101 | trace_btrfs_reserved_extent_alloc(fs_info, ins->objectid, ins->offset); |
e6dcd2dc CM |
8102 | return ret; |
8103 | } | |
8104 | ||
5d4f98a2 | 8105 | static int alloc_reserved_tree_block(struct btrfs_trans_handle *trans, |
2ff7e61e | 8106 | struct btrfs_fs_info *fs_info, |
5d4f98a2 YZ |
8107 | u64 parent, u64 root_objectid, |
8108 | u64 flags, struct btrfs_disk_key *key, | |
b06c4bf5 | 8109 | int level, struct btrfs_key *ins) |
e6dcd2dc CM |
8110 | { |
8111 | int ret; | |
5d4f98a2 YZ |
8112 | struct btrfs_extent_item *extent_item; |
8113 | struct btrfs_tree_block_info *block_info; | |
8114 | struct btrfs_extent_inline_ref *iref; | |
8115 | struct btrfs_path *path; | |
8116 | struct extent_buffer *leaf; | |
3173a18f | 8117 | u32 size = sizeof(*extent_item) + sizeof(*iref); |
fcebe456 | 8118 | u64 num_bytes = ins->offset; |
0b246afa | 8119 | bool skinny_metadata = btrfs_fs_incompat(fs_info, SKINNY_METADATA); |
3173a18f JB |
8120 | |
8121 | if (!skinny_metadata) | |
8122 | size += sizeof(*block_info); | |
1c2308f8 | 8123 | |
5d4f98a2 | 8124 | path = btrfs_alloc_path(); |
857cc2fc | 8125 | if (!path) { |
2ff7e61e | 8126 | btrfs_free_and_pin_reserved_extent(fs_info, ins->objectid, |
0b246afa | 8127 | fs_info->nodesize); |
d8926bb3 | 8128 | return -ENOMEM; |
857cc2fc | 8129 | } |
56bec294 | 8130 | |
5d4f98a2 YZ |
8131 | path->leave_spinning = 1; |
8132 | ret = btrfs_insert_empty_item(trans, fs_info->extent_root, path, | |
8133 | ins, size); | |
79787eaa | 8134 | if (ret) { |
dd825259 | 8135 | btrfs_free_path(path); |
2ff7e61e | 8136 | btrfs_free_and_pin_reserved_extent(fs_info, ins->objectid, |
0b246afa | 8137 | fs_info->nodesize); |
79787eaa JM |
8138 | return ret; |
8139 | } | |
5d4f98a2 YZ |
8140 | |
8141 | leaf = path->nodes[0]; | |
8142 | extent_item = btrfs_item_ptr(leaf, path->slots[0], | |
8143 | struct btrfs_extent_item); | |
8144 | btrfs_set_extent_refs(leaf, extent_item, 1); | |
8145 | btrfs_set_extent_generation(leaf, extent_item, trans->transid); | |
8146 | btrfs_set_extent_flags(leaf, extent_item, | |
8147 | flags | BTRFS_EXTENT_FLAG_TREE_BLOCK); | |
5d4f98a2 | 8148 | |
3173a18f JB |
8149 | if (skinny_metadata) { |
8150 | iref = (struct btrfs_extent_inline_ref *)(extent_item + 1); | |
0b246afa | 8151 | num_bytes = fs_info->nodesize; |
3173a18f JB |
8152 | } else { |
8153 | block_info = (struct btrfs_tree_block_info *)(extent_item + 1); | |
8154 | btrfs_set_tree_block_key(leaf, block_info, key); | |
8155 | btrfs_set_tree_block_level(leaf, block_info, level); | |
8156 | iref = (struct btrfs_extent_inline_ref *)(block_info + 1); | |
8157 | } | |
5d4f98a2 | 8158 | |
5d4f98a2 YZ |
8159 | if (parent > 0) { |
8160 | BUG_ON(!(flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)); | |
8161 | btrfs_set_extent_inline_ref_type(leaf, iref, | |
8162 | BTRFS_SHARED_BLOCK_REF_KEY); | |
8163 | btrfs_set_extent_inline_ref_offset(leaf, iref, parent); | |
8164 | } else { | |
8165 | btrfs_set_extent_inline_ref_type(leaf, iref, | |
8166 | BTRFS_TREE_BLOCK_REF_KEY); | |
8167 | btrfs_set_extent_inline_ref_offset(leaf, iref, root_objectid); | |
8168 | } | |
8169 | ||
8170 | btrfs_mark_buffer_dirty(leaf); | |
8171 | btrfs_free_path(path); | |
8172 | ||
1e144fb8 OS |
8173 | ret = remove_from_free_space_tree(trans, fs_info, ins->objectid, |
8174 | num_bytes); | |
8175 | if (ret) | |
8176 | return ret; | |
8177 | ||
6202df69 JM |
8178 | ret = update_block_group(trans, fs_info, ins->objectid, |
8179 | fs_info->nodesize, 1); | |
79787eaa | 8180 | if (ret) { /* -ENOENT, logic error */ |
c2cf52eb | 8181 | btrfs_err(fs_info, "update block group failed for %llu %llu", |
c1c9ff7c | 8182 | ins->objectid, ins->offset); |
5d4f98a2 YZ |
8183 | BUG(); |
8184 | } | |
0be5dc67 | 8185 | |
71ff6437 | 8186 | trace_btrfs_reserved_extent_alloc(fs_info, ins->objectid, |
0b246afa | 8187 | fs_info->nodesize); |
5d4f98a2 YZ |
8188 | return ret; |
8189 | } | |
8190 | ||
8191 | int btrfs_alloc_reserved_file_extent(struct btrfs_trans_handle *trans, | |
5d4f98a2 | 8192 | u64 root_objectid, u64 owner, |
5846a3c2 QW |
8193 | u64 offset, u64 ram_bytes, |
8194 | struct btrfs_key *ins) | |
5d4f98a2 | 8195 | { |
2ff7e61e | 8196 | struct btrfs_fs_info *fs_info = trans->fs_info; |
5d4f98a2 YZ |
8197 | int ret; |
8198 | ||
8199 | BUG_ON(root_objectid == BTRFS_TREE_LOG_OBJECTID); | |
8200 | ||
0b246afa | 8201 | ret = btrfs_add_delayed_data_ref(fs_info, trans, ins->objectid, |
66d7e7f0 AJ |
8202 | ins->offset, 0, |
8203 | root_objectid, owner, offset, | |
fef394f7 | 8204 | ram_bytes, BTRFS_ADD_DELAYED_EXTENT); |
e6dcd2dc CM |
8205 | return ret; |
8206 | } | |
e02119d5 CM |
8207 | |
8208 | /* | |
8209 | * this is used by the tree logging recovery code. It records that | |
8210 | * an extent has been allocated and makes sure to clear the free | |
8211 | * space cache bits as well | |
8212 | */ | |
5d4f98a2 | 8213 | int btrfs_alloc_logged_file_extent(struct btrfs_trans_handle *trans, |
2ff7e61e | 8214 | struct btrfs_fs_info *fs_info, |
5d4f98a2 YZ |
8215 | u64 root_objectid, u64 owner, u64 offset, |
8216 | struct btrfs_key *ins) | |
e02119d5 CM |
8217 | { |
8218 | int ret; | |
8219 | struct btrfs_block_group_cache *block_group; | |
ed7a6948 | 8220 | struct btrfs_space_info *space_info; |
11833d66 | 8221 | |
8c2a1a30 JB |
8222 | /* |
8223 | * Mixed block groups will exclude before processing the log so we only | |
01327610 | 8224 | * need to do the exclude dance if this fs isn't mixed. |
8c2a1a30 | 8225 | */ |
0b246afa | 8226 | if (!btrfs_fs_incompat(fs_info, MIXED_GROUPS)) { |
2ff7e61e JM |
8227 | ret = __exclude_logged_extent(fs_info, ins->objectid, |
8228 | ins->offset); | |
b50c6e25 | 8229 | if (ret) |
8c2a1a30 | 8230 | return ret; |
11833d66 YZ |
8231 | } |
8232 | ||
0b246afa | 8233 | block_group = btrfs_lookup_block_group(fs_info, ins->objectid); |
8c2a1a30 JB |
8234 | if (!block_group) |
8235 | return -EINVAL; | |
8236 | ||
ed7a6948 WX |
8237 | space_info = block_group->space_info; |
8238 | spin_lock(&space_info->lock); | |
8239 | spin_lock(&block_group->lock); | |
8240 | space_info->bytes_reserved += ins->offset; | |
8241 | block_group->reserved += ins->offset; | |
8242 | spin_unlock(&block_group->lock); | |
8243 | spin_unlock(&space_info->lock); | |
8244 | ||
2ff7e61e | 8245 | ret = alloc_reserved_file_extent(trans, fs_info, 0, root_objectid, |
5d4f98a2 | 8246 | 0, owner, offset, ins, 1); |
b50c6e25 | 8247 | btrfs_put_block_group(block_group); |
e02119d5 CM |
8248 | return ret; |
8249 | } | |
8250 | ||
48a3b636 ES |
8251 | static struct extent_buffer * |
8252 | btrfs_init_new_buffer(struct btrfs_trans_handle *trans, struct btrfs_root *root, | |
fe864576 | 8253 | u64 bytenr, int level) |
65b51a00 | 8254 | { |
0b246afa | 8255 | struct btrfs_fs_info *fs_info = root->fs_info; |
65b51a00 CM |
8256 | struct extent_buffer *buf; |
8257 | ||
2ff7e61e | 8258 | buf = btrfs_find_create_tree_block(fs_info, bytenr); |
c871b0f2 LB |
8259 | if (IS_ERR(buf)) |
8260 | return buf; | |
8261 | ||
65b51a00 | 8262 | btrfs_set_header_generation(buf, trans->transid); |
85d4e461 | 8263 | btrfs_set_buffer_lockdep_class(root->root_key.objectid, buf, level); |
65b51a00 | 8264 | btrfs_tree_lock(buf); |
7c302b49 | 8265 | clean_tree_block(fs_info, buf); |
3083ee2e | 8266 | clear_bit(EXTENT_BUFFER_STALE, &buf->bflags); |
b4ce94de CM |
8267 | |
8268 | btrfs_set_lock_blocking(buf); | |
4db8c528 | 8269 | set_extent_buffer_uptodate(buf); |
b4ce94de | 8270 | |
d0c803c4 | 8271 | if (root->root_key.objectid == BTRFS_TREE_LOG_OBJECTID) { |
656f30db | 8272 | buf->log_index = root->log_transid % 2; |
8cef4e16 YZ |
8273 | /* |
8274 | * we allow two log transactions at a time, use different | |
8275 | * EXENT bit to differentiate dirty pages. | |
8276 | */ | |
656f30db | 8277 | if (buf->log_index == 0) |
8cef4e16 YZ |
8278 | set_extent_dirty(&root->dirty_log_pages, buf->start, |
8279 | buf->start + buf->len - 1, GFP_NOFS); | |
8280 | else | |
8281 | set_extent_new(&root->dirty_log_pages, buf->start, | |
3744dbeb | 8282 | buf->start + buf->len - 1); |
d0c803c4 | 8283 | } else { |
656f30db | 8284 | buf->log_index = -1; |
d0c803c4 | 8285 | set_extent_dirty(&trans->transaction->dirty_pages, buf->start, |
65b51a00 | 8286 | buf->start + buf->len - 1, GFP_NOFS); |
d0c803c4 | 8287 | } |
64c12921 | 8288 | trans->dirty = true; |
b4ce94de | 8289 | /* this returns a buffer locked for blocking */ |
65b51a00 CM |
8290 | return buf; |
8291 | } | |
8292 | ||
f0486c68 YZ |
8293 | static struct btrfs_block_rsv * |
8294 | use_block_rsv(struct btrfs_trans_handle *trans, | |
8295 | struct btrfs_root *root, u32 blocksize) | |
8296 | { | |
0b246afa | 8297 | struct btrfs_fs_info *fs_info = root->fs_info; |
f0486c68 | 8298 | struct btrfs_block_rsv *block_rsv; |
0b246afa | 8299 | struct btrfs_block_rsv *global_rsv = &fs_info->global_block_rsv; |
f0486c68 | 8300 | int ret; |
d88033db | 8301 | bool global_updated = false; |
f0486c68 YZ |
8302 | |
8303 | block_rsv = get_block_rsv(trans, root); | |
8304 | ||
b586b323 MX |
8305 | if (unlikely(block_rsv->size == 0)) |
8306 | goto try_reserve; | |
d88033db | 8307 | again: |
f0486c68 YZ |
8308 | ret = block_rsv_use_bytes(block_rsv, blocksize); |
8309 | if (!ret) | |
8310 | return block_rsv; | |
8311 | ||
b586b323 MX |
8312 | if (block_rsv->failfast) |
8313 | return ERR_PTR(ret); | |
8314 | ||
d88033db MX |
8315 | if (block_rsv->type == BTRFS_BLOCK_RSV_GLOBAL && !global_updated) { |
8316 | global_updated = true; | |
0b246afa | 8317 | update_global_block_rsv(fs_info); |
d88033db MX |
8318 | goto again; |
8319 | } | |
8320 | ||
0b246afa | 8321 | if (btrfs_test_opt(fs_info, ENOSPC_DEBUG)) { |
b586b323 MX |
8322 | static DEFINE_RATELIMIT_STATE(_rs, |
8323 | DEFAULT_RATELIMIT_INTERVAL * 10, | |
8324 | /*DEFAULT_RATELIMIT_BURST*/ 1); | |
8325 | if (__ratelimit(&_rs)) | |
8326 | WARN(1, KERN_DEBUG | |
efe120a0 | 8327 | "BTRFS: block rsv returned %d\n", ret); |
b586b323 MX |
8328 | } |
8329 | try_reserve: | |
8330 | ret = reserve_metadata_bytes(root, block_rsv, blocksize, | |
8331 | BTRFS_RESERVE_NO_FLUSH); | |
8332 | if (!ret) | |
8333 | return block_rsv; | |
8334 | /* | |
8335 | * If we couldn't reserve metadata bytes try and use some from | |
5881cfc9 MX |
8336 | * the global reserve if its space type is the same as the global |
8337 | * reservation. | |
b586b323 | 8338 | */ |
5881cfc9 MX |
8339 | if (block_rsv->type != BTRFS_BLOCK_RSV_GLOBAL && |
8340 | block_rsv->space_info == global_rsv->space_info) { | |
b586b323 MX |
8341 | ret = block_rsv_use_bytes(global_rsv, blocksize); |
8342 | if (!ret) | |
8343 | return global_rsv; | |
8344 | } | |
8345 | return ERR_PTR(ret); | |
f0486c68 YZ |
8346 | } |
8347 | ||
8c2a3ca2 JB |
8348 | static void unuse_block_rsv(struct btrfs_fs_info *fs_info, |
8349 | struct btrfs_block_rsv *block_rsv, u32 blocksize) | |
f0486c68 YZ |
8350 | { |
8351 | block_rsv_add_bytes(block_rsv, blocksize, 0); | |
8c2a3ca2 | 8352 | block_rsv_release_bytes(fs_info, block_rsv, NULL, 0); |
f0486c68 YZ |
8353 | } |
8354 | ||
fec577fb | 8355 | /* |
f0486c68 | 8356 | * finds a free extent and does all the dirty work required for allocation |
67b7859e | 8357 | * returns the tree buffer or an ERR_PTR on error. |
fec577fb | 8358 | */ |
4d75f8a9 | 8359 | struct extent_buffer *btrfs_alloc_tree_block(struct btrfs_trans_handle *trans, |
310712b2 OS |
8360 | struct btrfs_root *root, |
8361 | u64 parent, u64 root_objectid, | |
8362 | const struct btrfs_disk_key *key, | |
8363 | int level, u64 hint, | |
8364 | u64 empty_size) | |
fec577fb | 8365 | { |
0b246afa | 8366 | struct btrfs_fs_info *fs_info = root->fs_info; |
e2fa7227 | 8367 | struct btrfs_key ins; |
f0486c68 | 8368 | struct btrfs_block_rsv *block_rsv; |
5f39d397 | 8369 | struct extent_buffer *buf; |
67b7859e | 8370 | struct btrfs_delayed_extent_op *extent_op; |
f0486c68 YZ |
8371 | u64 flags = 0; |
8372 | int ret; | |
0b246afa JM |
8373 | u32 blocksize = fs_info->nodesize; |
8374 | bool skinny_metadata = btrfs_fs_incompat(fs_info, SKINNY_METADATA); | |
fec577fb | 8375 | |
05653ef3 | 8376 | #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS |
0b246afa | 8377 | if (btrfs_is_testing(fs_info)) { |
faa2dbf0 | 8378 | buf = btrfs_init_new_buffer(trans, root, root->alloc_bytenr, |
fe864576 | 8379 | level); |
faa2dbf0 JB |
8380 | if (!IS_ERR(buf)) |
8381 | root->alloc_bytenr += blocksize; | |
8382 | return buf; | |
8383 | } | |
05653ef3 | 8384 | #endif |
fccb84c9 | 8385 | |
f0486c68 YZ |
8386 | block_rsv = use_block_rsv(trans, root, blocksize); |
8387 | if (IS_ERR(block_rsv)) | |
8388 | return ERR_CAST(block_rsv); | |
8389 | ||
18513091 | 8390 | ret = btrfs_reserve_extent(root, blocksize, blocksize, blocksize, |
e570fd27 | 8391 | empty_size, hint, &ins, 0, 0); |
67b7859e OS |
8392 | if (ret) |
8393 | goto out_unuse; | |
55c69072 | 8394 | |
fe864576 | 8395 | buf = btrfs_init_new_buffer(trans, root, ins.objectid, level); |
67b7859e OS |
8396 | if (IS_ERR(buf)) { |
8397 | ret = PTR_ERR(buf); | |
8398 | goto out_free_reserved; | |
8399 | } | |
f0486c68 YZ |
8400 | |
8401 | if (root_objectid == BTRFS_TREE_RELOC_OBJECTID) { | |
8402 | if (parent == 0) | |
8403 | parent = ins.objectid; | |
8404 | flags |= BTRFS_BLOCK_FLAG_FULL_BACKREF; | |
8405 | } else | |
8406 | BUG_ON(parent > 0); | |
8407 | ||
8408 | if (root_objectid != BTRFS_TREE_LOG_OBJECTID) { | |
78a6184a | 8409 | extent_op = btrfs_alloc_delayed_extent_op(); |
67b7859e OS |
8410 | if (!extent_op) { |
8411 | ret = -ENOMEM; | |
8412 | goto out_free_buf; | |
8413 | } | |
f0486c68 YZ |
8414 | if (key) |
8415 | memcpy(&extent_op->key, key, sizeof(extent_op->key)); | |
8416 | else | |
8417 | memset(&extent_op->key, 0, sizeof(extent_op->key)); | |
8418 | extent_op->flags_to_set = flags; | |
35b3ad50 DS |
8419 | extent_op->update_key = skinny_metadata ? false : true; |
8420 | extent_op->update_flags = true; | |
8421 | extent_op->is_data = false; | |
b1c79e09 | 8422 | extent_op->level = level; |
f0486c68 | 8423 | |
0b246afa | 8424 | ret = btrfs_add_delayed_tree_ref(fs_info, trans, |
67b7859e OS |
8425 | ins.objectid, ins.offset, |
8426 | parent, root_objectid, level, | |
8427 | BTRFS_ADD_DELAYED_EXTENT, | |
b06c4bf5 | 8428 | extent_op); |
67b7859e OS |
8429 | if (ret) |
8430 | goto out_free_delayed; | |
f0486c68 | 8431 | } |
fec577fb | 8432 | return buf; |
67b7859e OS |
8433 | |
8434 | out_free_delayed: | |
8435 | btrfs_free_delayed_extent_op(extent_op); | |
8436 | out_free_buf: | |
8437 | free_extent_buffer(buf); | |
8438 | out_free_reserved: | |
2ff7e61e | 8439 | btrfs_free_reserved_extent(fs_info, ins.objectid, ins.offset, 0); |
67b7859e | 8440 | out_unuse: |
0b246afa | 8441 | unuse_block_rsv(fs_info, block_rsv, blocksize); |
67b7859e | 8442 | return ERR_PTR(ret); |
fec577fb | 8443 | } |
a28ec197 | 8444 | |
2c47e605 YZ |
8445 | struct walk_control { |
8446 | u64 refs[BTRFS_MAX_LEVEL]; | |
8447 | u64 flags[BTRFS_MAX_LEVEL]; | |
8448 | struct btrfs_key update_progress; | |
8449 | int stage; | |
8450 | int level; | |
8451 | int shared_level; | |
8452 | int update_ref; | |
8453 | int keep_locks; | |
1c4850e2 YZ |
8454 | int reada_slot; |
8455 | int reada_count; | |
66d7e7f0 | 8456 | int for_reloc; |
2c47e605 YZ |
8457 | }; |
8458 | ||
8459 | #define DROP_REFERENCE 1 | |
8460 | #define UPDATE_BACKREF 2 | |
8461 | ||
1c4850e2 YZ |
8462 | static noinline void reada_walk_down(struct btrfs_trans_handle *trans, |
8463 | struct btrfs_root *root, | |
8464 | struct walk_control *wc, | |
8465 | struct btrfs_path *path) | |
6407bf6d | 8466 | { |
0b246afa | 8467 | struct btrfs_fs_info *fs_info = root->fs_info; |
1c4850e2 YZ |
8468 | u64 bytenr; |
8469 | u64 generation; | |
8470 | u64 refs; | |
94fcca9f | 8471 | u64 flags; |
5d4f98a2 | 8472 | u32 nritems; |
1c4850e2 YZ |
8473 | struct btrfs_key key; |
8474 | struct extent_buffer *eb; | |
6407bf6d | 8475 | int ret; |
1c4850e2 YZ |
8476 | int slot; |
8477 | int nread = 0; | |
6407bf6d | 8478 | |
1c4850e2 YZ |
8479 | if (path->slots[wc->level] < wc->reada_slot) { |
8480 | wc->reada_count = wc->reada_count * 2 / 3; | |
8481 | wc->reada_count = max(wc->reada_count, 2); | |
8482 | } else { | |
8483 | wc->reada_count = wc->reada_count * 3 / 2; | |
8484 | wc->reada_count = min_t(int, wc->reada_count, | |
0b246afa | 8485 | BTRFS_NODEPTRS_PER_BLOCK(fs_info)); |
1c4850e2 | 8486 | } |
7bb86316 | 8487 | |
1c4850e2 YZ |
8488 | eb = path->nodes[wc->level]; |
8489 | nritems = btrfs_header_nritems(eb); | |
bd56b302 | 8490 | |
1c4850e2 YZ |
8491 | for (slot = path->slots[wc->level]; slot < nritems; slot++) { |
8492 | if (nread >= wc->reada_count) | |
8493 | break; | |
bd56b302 | 8494 | |
2dd3e67b | 8495 | cond_resched(); |
1c4850e2 YZ |
8496 | bytenr = btrfs_node_blockptr(eb, slot); |
8497 | generation = btrfs_node_ptr_generation(eb, slot); | |
2dd3e67b | 8498 | |
1c4850e2 YZ |
8499 | if (slot == path->slots[wc->level]) |
8500 | goto reada; | |
5d4f98a2 | 8501 | |
1c4850e2 YZ |
8502 | if (wc->stage == UPDATE_BACKREF && |
8503 | generation <= root->root_key.offset) | |
bd56b302 CM |
8504 | continue; |
8505 | ||
94fcca9f | 8506 | /* We don't lock the tree block, it's OK to be racy here */ |
2ff7e61e | 8507 | ret = btrfs_lookup_extent_info(trans, fs_info, bytenr, |
3173a18f JB |
8508 | wc->level - 1, 1, &refs, |
8509 | &flags); | |
79787eaa JM |
8510 | /* We don't care about errors in readahead. */ |
8511 | if (ret < 0) | |
8512 | continue; | |
94fcca9f YZ |
8513 | BUG_ON(refs == 0); |
8514 | ||
1c4850e2 | 8515 | if (wc->stage == DROP_REFERENCE) { |
1c4850e2 YZ |
8516 | if (refs == 1) |
8517 | goto reada; | |
bd56b302 | 8518 | |
94fcca9f YZ |
8519 | if (wc->level == 1 && |
8520 | (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) | |
8521 | continue; | |
1c4850e2 YZ |
8522 | if (!wc->update_ref || |
8523 | generation <= root->root_key.offset) | |
8524 | continue; | |
8525 | btrfs_node_key_to_cpu(eb, &key, slot); | |
8526 | ret = btrfs_comp_cpu_keys(&key, | |
8527 | &wc->update_progress); | |
8528 | if (ret < 0) | |
8529 | continue; | |
94fcca9f YZ |
8530 | } else { |
8531 | if (wc->level == 1 && | |
8532 | (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) | |
8533 | continue; | |
6407bf6d | 8534 | } |
1c4850e2 | 8535 | reada: |
2ff7e61e | 8536 | readahead_tree_block(fs_info, bytenr); |
1c4850e2 | 8537 | nread++; |
20524f02 | 8538 | } |
1c4850e2 | 8539 | wc->reada_slot = slot; |
20524f02 | 8540 | } |
2c47e605 | 8541 | |
f82d02d9 | 8542 | /* |
2c016dc2 | 8543 | * helper to process tree block while walking down the tree. |
2c47e605 | 8544 | * |
2c47e605 YZ |
8545 | * when wc->stage == UPDATE_BACKREF, this function updates |
8546 | * back refs for pointers in the block. | |
8547 | * | |
8548 | * NOTE: return value 1 means we should stop walking down. | |
f82d02d9 | 8549 | */ |
2c47e605 | 8550 | static noinline int walk_down_proc(struct btrfs_trans_handle *trans, |
5d4f98a2 | 8551 | struct btrfs_root *root, |
2c47e605 | 8552 | struct btrfs_path *path, |
94fcca9f | 8553 | struct walk_control *wc, int lookup_info) |
f82d02d9 | 8554 | { |
2ff7e61e | 8555 | struct btrfs_fs_info *fs_info = root->fs_info; |
2c47e605 YZ |
8556 | int level = wc->level; |
8557 | struct extent_buffer *eb = path->nodes[level]; | |
2c47e605 | 8558 | u64 flag = BTRFS_BLOCK_FLAG_FULL_BACKREF; |
f82d02d9 YZ |
8559 | int ret; |
8560 | ||
2c47e605 YZ |
8561 | if (wc->stage == UPDATE_BACKREF && |
8562 | btrfs_header_owner(eb) != root->root_key.objectid) | |
8563 | return 1; | |
f82d02d9 | 8564 | |
2c47e605 YZ |
8565 | /* |
8566 | * when reference count of tree block is 1, it won't increase | |
8567 | * again. once full backref flag is set, we never clear it. | |
8568 | */ | |
94fcca9f YZ |
8569 | if (lookup_info && |
8570 | ((wc->stage == DROP_REFERENCE && wc->refs[level] != 1) || | |
8571 | (wc->stage == UPDATE_BACKREF && !(wc->flags[level] & flag)))) { | |
2c47e605 | 8572 | BUG_ON(!path->locks[level]); |
2ff7e61e | 8573 | ret = btrfs_lookup_extent_info(trans, fs_info, |
3173a18f | 8574 | eb->start, level, 1, |
2c47e605 YZ |
8575 | &wc->refs[level], |
8576 | &wc->flags[level]); | |
79787eaa JM |
8577 | BUG_ON(ret == -ENOMEM); |
8578 | if (ret) | |
8579 | return ret; | |
2c47e605 YZ |
8580 | BUG_ON(wc->refs[level] == 0); |
8581 | } | |
5d4f98a2 | 8582 | |
2c47e605 YZ |
8583 | if (wc->stage == DROP_REFERENCE) { |
8584 | if (wc->refs[level] > 1) | |
8585 | return 1; | |
f82d02d9 | 8586 | |
2c47e605 | 8587 | if (path->locks[level] && !wc->keep_locks) { |
bd681513 | 8588 | btrfs_tree_unlock_rw(eb, path->locks[level]); |
2c47e605 YZ |
8589 | path->locks[level] = 0; |
8590 | } | |
8591 | return 0; | |
8592 | } | |
f82d02d9 | 8593 | |
2c47e605 YZ |
8594 | /* wc->stage == UPDATE_BACKREF */ |
8595 | if (!(wc->flags[level] & flag)) { | |
8596 | BUG_ON(!path->locks[level]); | |
e339a6b0 | 8597 | ret = btrfs_inc_ref(trans, root, eb, 1); |
79787eaa | 8598 | BUG_ON(ret); /* -ENOMEM */ |
e339a6b0 | 8599 | ret = btrfs_dec_ref(trans, root, eb, 0); |
79787eaa | 8600 | BUG_ON(ret); /* -ENOMEM */ |
2ff7e61e | 8601 | ret = btrfs_set_disk_extent_flags(trans, fs_info, eb->start, |
b1c79e09 JB |
8602 | eb->len, flag, |
8603 | btrfs_header_level(eb), 0); | |
79787eaa | 8604 | BUG_ON(ret); /* -ENOMEM */ |
2c47e605 YZ |
8605 | wc->flags[level] |= flag; |
8606 | } | |
8607 | ||
8608 | /* | |
8609 | * the block is shared by multiple trees, so it's not good to | |
8610 | * keep the tree lock | |
8611 | */ | |
8612 | if (path->locks[level] && level > 0) { | |
bd681513 | 8613 | btrfs_tree_unlock_rw(eb, path->locks[level]); |
2c47e605 YZ |
8614 | path->locks[level] = 0; |
8615 | } | |
8616 | return 0; | |
8617 | } | |
8618 | ||
1c4850e2 | 8619 | /* |
2c016dc2 | 8620 | * helper to process tree block pointer. |
1c4850e2 YZ |
8621 | * |
8622 | * when wc->stage == DROP_REFERENCE, this function checks | |
8623 | * reference count of the block pointed to. if the block | |
8624 | * is shared and we need update back refs for the subtree | |
8625 | * rooted at the block, this function changes wc->stage to | |
8626 | * UPDATE_BACKREF. if the block is shared and there is no | |
8627 | * need to update back, this function drops the reference | |
8628 | * to the block. | |
8629 | * | |
8630 | * NOTE: return value 1 means we should stop walking down. | |
8631 | */ | |
8632 | static noinline int do_walk_down(struct btrfs_trans_handle *trans, | |
8633 | struct btrfs_root *root, | |
8634 | struct btrfs_path *path, | |
94fcca9f | 8635 | struct walk_control *wc, int *lookup_info) |
1c4850e2 | 8636 | { |
0b246afa | 8637 | struct btrfs_fs_info *fs_info = root->fs_info; |
1c4850e2 YZ |
8638 | u64 bytenr; |
8639 | u64 generation; | |
8640 | u64 parent; | |
8641 | u32 blocksize; | |
8642 | struct btrfs_key key; | |
8643 | struct extent_buffer *next; | |
8644 | int level = wc->level; | |
8645 | int reada = 0; | |
8646 | int ret = 0; | |
1152651a | 8647 | bool need_account = false; |
1c4850e2 YZ |
8648 | |
8649 | generation = btrfs_node_ptr_generation(path->nodes[level], | |
8650 | path->slots[level]); | |
8651 | /* | |
8652 | * if the lower level block was created before the snapshot | |
8653 | * was created, we know there is no need to update back refs | |
8654 | * for the subtree | |
8655 | */ | |
8656 | if (wc->stage == UPDATE_BACKREF && | |
94fcca9f YZ |
8657 | generation <= root->root_key.offset) { |
8658 | *lookup_info = 1; | |
1c4850e2 | 8659 | return 1; |
94fcca9f | 8660 | } |
1c4850e2 YZ |
8661 | |
8662 | bytenr = btrfs_node_blockptr(path->nodes[level], path->slots[level]); | |
0b246afa | 8663 | blocksize = fs_info->nodesize; |
1c4850e2 | 8664 | |
0b246afa | 8665 | next = find_extent_buffer(fs_info, bytenr); |
1c4850e2 | 8666 | if (!next) { |
2ff7e61e | 8667 | next = btrfs_find_create_tree_block(fs_info, bytenr); |
c871b0f2 LB |
8668 | if (IS_ERR(next)) |
8669 | return PTR_ERR(next); | |
8670 | ||
b2aaaa3b JB |
8671 | btrfs_set_buffer_lockdep_class(root->root_key.objectid, next, |
8672 | level - 1); | |
1c4850e2 YZ |
8673 | reada = 1; |
8674 | } | |
8675 | btrfs_tree_lock(next); | |
8676 | btrfs_set_lock_blocking(next); | |
8677 | ||
2ff7e61e | 8678 | ret = btrfs_lookup_extent_info(trans, fs_info, bytenr, level - 1, 1, |
94fcca9f YZ |
8679 | &wc->refs[level - 1], |
8680 | &wc->flags[level - 1]); | |
4867268c JB |
8681 | if (ret < 0) |
8682 | goto out_unlock; | |
79787eaa | 8683 | |
c2cf52eb | 8684 | if (unlikely(wc->refs[level - 1] == 0)) { |
0b246afa | 8685 | btrfs_err(fs_info, "Missing references."); |
4867268c JB |
8686 | ret = -EIO; |
8687 | goto out_unlock; | |
c2cf52eb | 8688 | } |
94fcca9f | 8689 | *lookup_info = 0; |
1c4850e2 | 8690 | |
94fcca9f | 8691 | if (wc->stage == DROP_REFERENCE) { |
1c4850e2 | 8692 | if (wc->refs[level - 1] > 1) { |
1152651a | 8693 | need_account = true; |
94fcca9f YZ |
8694 | if (level == 1 && |
8695 | (wc->flags[0] & BTRFS_BLOCK_FLAG_FULL_BACKREF)) | |
8696 | goto skip; | |
8697 | ||
1c4850e2 YZ |
8698 | if (!wc->update_ref || |
8699 | generation <= root->root_key.offset) | |
8700 | goto skip; | |
8701 | ||
8702 | btrfs_node_key_to_cpu(path->nodes[level], &key, | |
8703 | path->slots[level]); | |
8704 | ret = btrfs_comp_cpu_keys(&key, &wc->update_progress); | |
8705 | if (ret < 0) | |
8706 | goto skip; | |
8707 | ||
8708 | wc->stage = UPDATE_BACKREF; | |
8709 | wc->shared_level = level - 1; | |
8710 | } | |
94fcca9f YZ |
8711 | } else { |
8712 | if (level == 1 && | |
8713 | (wc->flags[0] & BTRFS_BLOCK_FLAG_FULL_BACKREF)) | |
8714 | goto skip; | |
1c4850e2 YZ |
8715 | } |
8716 | ||
b9fab919 | 8717 | if (!btrfs_buffer_uptodate(next, generation, 0)) { |
1c4850e2 YZ |
8718 | btrfs_tree_unlock(next); |
8719 | free_extent_buffer(next); | |
8720 | next = NULL; | |
94fcca9f | 8721 | *lookup_info = 1; |
1c4850e2 YZ |
8722 | } |
8723 | ||
8724 | if (!next) { | |
8725 | if (reada && level == 1) | |
8726 | reada_walk_down(trans, root, wc, path); | |
2ff7e61e | 8727 | next = read_tree_block(fs_info, bytenr, generation); |
64c043de LB |
8728 | if (IS_ERR(next)) { |
8729 | return PTR_ERR(next); | |
8730 | } else if (!extent_buffer_uptodate(next)) { | |
416bc658 | 8731 | free_extent_buffer(next); |
97d9a8a4 | 8732 | return -EIO; |
416bc658 | 8733 | } |
1c4850e2 YZ |
8734 | btrfs_tree_lock(next); |
8735 | btrfs_set_lock_blocking(next); | |
8736 | } | |
8737 | ||
8738 | level--; | |
4867268c JB |
8739 | ASSERT(level == btrfs_header_level(next)); |
8740 | if (level != btrfs_header_level(next)) { | |
8741 | btrfs_err(root->fs_info, "mismatched level"); | |
8742 | ret = -EIO; | |
8743 | goto out_unlock; | |
8744 | } | |
1c4850e2 YZ |
8745 | path->nodes[level] = next; |
8746 | path->slots[level] = 0; | |
bd681513 | 8747 | path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING; |
1c4850e2 YZ |
8748 | wc->level = level; |
8749 | if (wc->level == 1) | |
8750 | wc->reada_slot = 0; | |
8751 | return 0; | |
8752 | skip: | |
8753 | wc->refs[level - 1] = 0; | |
8754 | wc->flags[level - 1] = 0; | |
94fcca9f YZ |
8755 | if (wc->stage == DROP_REFERENCE) { |
8756 | if (wc->flags[level] & BTRFS_BLOCK_FLAG_FULL_BACKREF) { | |
8757 | parent = path->nodes[level]->start; | |
8758 | } else { | |
4867268c | 8759 | ASSERT(root->root_key.objectid == |
94fcca9f | 8760 | btrfs_header_owner(path->nodes[level])); |
4867268c JB |
8761 | if (root->root_key.objectid != |
8762 | btrfs_header_owner(path->nodes[level])) { | |
8763 | btrfs_err(root->fs_info, | |
8764 | "mismatched block owner"); | |
8765 | ret = -EIO; | |
8766 | goto out_unlock; | |
8767 | } | |
94fcca9f YZ |
8768 | parent = 0; |
8769 | } | |
1c4850e2 | 8770 | |
1152651a | 8771 | if (need_account) { |
33d1f05c QW |
8772 | ret = btrfs_qgroup_trace_subtree(trans, root, next, |
8773 | generation, level - 1); | |
1152651a | 8774 | if (ret) { |
0b246afa | 8775 | btrfs_err_rl(fs_info, |
5d163e0e JM |
8776 | "Error %d accounting shared subtree. Quota is out of sync, rescan required.", |
8777 | ret); | |
1152651a MF |
8778 | } |
8779 | } | |
2ff7e61e JM |
8780 | ret = btrfs_free_extent(trans, fs_info, bytenr, blocksize, |
8781 | parent, root->root_key.objectid, | |
8782 | level - 1, 0); | |
4867268c JB |
8783 | if (ret) |
8784 | goto out_unlock; | |
1c4850e2 | 8785 | } |
4867268c JB |
8786 | |
8787 | *lookup_info = 1; | |
8788 | ret = 1; | |
8789 | ||
8790 | out_unlock: | |
1c4850e2 YZ |
8791 | btrfs_tree_unlock(next); |
8792 | free_extent_buffer(next); | |
4867268c JB |
8793 | |
8794 | return ret; | |
1c4850e2 YZ |
8795 | } |
8796 | ||
2c47e605 | 8797 | /* |
2c016dc2 | 8798 | * helper to process tree block while walking up the tree. |
2c47e605 YZ |
8799 | * |
8800 | * when wc->stage == DROP_REFERENCE, this function drops | |
8801 | * reference count on the block. | |
8802 | * | |
8803 | * when wc->stage == UPDATE_BACKREF, this function changes | |
8804 | * wc->stage back to DROP_REFERENCE if we changed wc->stage | |
8805 | * to UPDATE_BACKREF previously while processing the block. | |
8806 | * | |
8807 | * NOTE: return value 1 means we should stop walking up. | |
8808 | */ | |
8809 | static noinline int walk_up_proc(struct btrfs_trans_handle *trans, | |
8810 | struct btrfs_root *root, | |
8811 | struct btrfs_path *path, | |
8812 | struct walk_control *wc) | |
8813 | { | |
0b246afa | 8814 | struct btrfs_fs_info *fs_info = root->fs_info; |
f0486c68 | 8815 | int ret; |
2c47e605 YZ |
8816 | int level = wc->level; |
8817 | struct extent_buffer *eb = path->nodes[level]; | |
8818 | u64 parent = 0; | |
8819 | ||
8820 | if (wc->stage == UPDATE_BACKREF) { | |
8821 | BUG_ON(wc->shared_level < level); | |
8822 | if (level < wc->shared_level) | |
8823 | goto out; | |
8824 | ||
2c47e605 YZ |
8825 | ret = find_next_key(path, level + 1, &wc->update_progress); |
8826 | if (ret > 0) | |
8827 | wc->update_ref = 0; | |
8828 | ||
8829 | wc->stage = DROP_REFERENCE; | |
8830 | wc->shared_level = -1; | |
8831 | path->slots[level] = 0; | |
8832 | ||
8833 | /* | |
8834 | * check reference count again if the block isn't locked. | |
8835 | * we should start walking down the tree again if reference | |
8836 | * count is one. | |
8837 | */ | |
8838 | if (!path->locks[level]) { | |
8839 | BUG_ON(level == 0); | |
8840 | btrfs_tree_lock(eb); | |
8841 | btrfs_set_lock_blocking(eb); | |
bd681513 | 8842 | path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING; |
2c47e605 | 8843 | |
2ff7e61e | 8844 | ret = btrfs_lookup_extent_info(trans, fs_info, |
3173a18f | 8845 | eb->start, level, 1, |
2c47e605 YZ |
8846 | &wc->refs[level], |
8847 | &wc->flags[level]); | |
79787eaa JM |
8848 | if (ret < 0) { |
8849 | btrfs_tree_unlock_rw(eb, path->locks[level]); | |
3268a246 | 8850 | path->locks[level] = 0; |
79787eaa JM |
8851 | return ret; |
8852 | } | |
2c47e605 YZ |
8853 | BUG_ON(wc->refs[level] == 0); |
8854 | if (wc->refs[level] == 1) { | |
bd681513 | 8855 | btrfs_tree_unlock_rw(eb, path->locks[level]); |
3268a246 | 8856 | path->locks[level] = 0; |
2c47e605 YZ |
8857 | return 1; |
8858 | } | |
f82d02d9 | 8859 | } |
2c47e605 | 8860 | } |
f82d02d9 | 8861 | |
2c47e605 YZ |
8862 | /* wc->stage == DROP_REFERENCE */ |
8863 | BUG_ON(wc->refs[level] > 1 && !path->locks[level]); | |
5d4f98a2 | 8864 | |
2c47e605 YZ |
8865 | if (wc->refs[level] == 1) { |
8866 | if (level == 0) { | |
8867 | if (wc->flags[level] & BTRFS_BLOCK_FLAG_FULL_BACKREF) | |
e339a6b0 | 8868 | ret = btrfs_dec_ref(trans, root, eb, 1); |
2c47e605 | 8869 | else |
e339a6b0 | 8870 | ret = btrfs_dec_ref(trans, root, eb, 0); |
79787eaa | 8871 | BUG_ON(ret); /* -ENOMEM */ |
2ff7e61e | 8872 | ret = btrfs_qgroup_trace_leaf_items(trans, fs_info, eb); |
1152651a | 8873 | if (ret) { |
0b246afa | 8874 | btrfs_err_rl(fs_info, |
5d163e0e JM |
8875 | "error %d accounting leaf items. Quota is out of sync, rescan required.", |
8876 | ret); | |
1152651a | 8877 | } |
2c47e605 YZ |
8878 | } |
8879 | /* make block locked assertion in clean_tree_block happy */ | |
8880 | if (!path->locks[level] && | |
8881 | btrfs_header_generation(eb) == trans->transid) { | |
8882 | btrfs_tree_lock(eb); | |
8883 | btrfs_set_lock_blocking(eb); | |
bd681513 | 8884 | path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING; |
2c47e605 | 8885 | } |
7c302b49 | 8886 | clean_tree_block(fs_info, eb); |
2c47e605 YZ |
8887 | } |
8888 | ||
8889 | if (eb == root->node) { | |
8890 | if (wc->flags[level] & BTRFS_BLOCK_FLAG_FULL_BACKREF) | |
8891 | parent = eb->start; | |
8892 | else | |
8893 | BUG_ON(root->root_key.objectid != | |
8894 | btrfs_header_owner(eb)); | |
8895 | } else { | |
8896 | if (wc->flags[level + 1] & BTRFS_BLOCK_FLAG_FULL_BACKREF) | |
8897 | parent = path->nodes[level + 1]->start; | |
8898 | else | |
8899 | BUG_ON(root->root_key.objectid != | |
8900 | btrfs_header_owner(path->nodes[level + 1])); | |
f82d02d9 | 8901 | } |
f82d02d9 | 8902 | |
5581a51a | 8903 | btrfs_free_tree_block(trans, root, eb, parent, wc->refs[level] == 1); |
2c47e605 YZ |
8904 | out: |
8905 | wc->refs[level] = 0; | |
8906 | wc->flags[level] = 0; | |
f0486c68 | 8907 | return 0; |
2c47e605 YZ |
8908 | } |
8909 | ||
8910 | static noinline int walk_down_tree(struct btrfs_trans_handle *trans, | |
8911 | struct btrfs_root *root, | |
8912 | struct btrfs_path *path, | |
8913 | struct walk_control *wc) | |
8914 | { | |
2c47e605 | 8915 | int level = wc->level; |
94fcca9f | 8916 | int lookup_info = 1; |
2c47e605 YZ |
8917 | int ret; |
8918 | ||
8919 | while (level >= 0) { | |
94fcca9f | 8920 | ret = walk_down_proc(trans, root, path, wc, lookup_info); |
2c47e605 YZ |
8921 | if (ret > 0) |
8922 | break; | |
8923 | ||
8924 | if (level == 0) | |
8925 | break; | |
8926 | ||
7a7965f8 YZ |
8927 | if (path->slots[level] >= |
8928 | btrfs_header_nritems(path->nodes[level])) | |
8929 | break; | |
8930 | ||
94fcca9f | 8931 | ret = do_walk_down(trans, root, path, wc, &lookup_info); |
1c4850e2 YZ |
8932 | if (ret > 0) { |
8933 | path->slots[level]++; | |
8934 | continue; | |
90d2c51d MX |
8935 | } else if (ret < 0) |
8936 | return ret; | |
1c4850e2 | 8937 | level = wc->level; |
f82d02d9 | 8938 | } |
f82d02d9 YZ |
8939 | return 0; |
8940 | } | |
8941 | ||
d397712b | 8942 | static noinline int walk_up_tree(struct btrfs_trans_handle *trans, |
98ed5174 | 8943 | struct btrfs_root *root, |
f82d02d9 | 8944 | struct btrfs_path *path, |
2c47e605 | 8945 | struct walk_control *wc, int max_level) |
20524f02 | 8946 | { |
2c47e605 | 8947 | int level = wc->level; |
20524f02 | 8948 | int ret; |
9f3a7427 | 8949 | |
2c47e605 YZ |
8950 | path->slots[level] = btrfs_header_nritems(path->nodes[level]); |
8951 | while (level < max_level && path->nodes[level]) { | |
8952 | wc->level = level; | |
8953 | if (path->slots[level] + 1 < | |
8954 | btrfs_header_nritems(path->nodes[level])) { | |
8955 | path->slots[level]++; | |
20524f02 CM |
8956 | return 0; |
8957 | } else { | |
2c47e605 YZ |
8958 | ret = walk_up_proc(trans, root, path, wc); |
8959 | if (ret > 0) | |
8960 | return 0; | |
bd56b302 | 8961 | |
2c47e605 | 8962 | if (path->locks[level]) { |
bd681513 CM |
8963 | btrfs_tree_unlock_rw(path->nodes[level], |
8964 | path->locks[level]); | |
2c47e605 | 8965 | path->locks[level] = 0; |
f82d02d9 | 8966 | } |
2c47e605 YZ |
8967 | free_extent_buffer(path->nodes[level]); |
8968 | path->nodes[level] = NULL; | |
8969 | level++; | |
20524f02 CM |
8970 | } |
8971 | } | |
8972 | return 1; | |
8973 | } | |
8974 | ||
9aca1d51 | 8975 | /* |
2c47e605 YZ |
8976 | * drop a subvolume tree. |
8977 | * | |
8978 | * this function traverses the tree freeing any blocks that only | |
8979 | * referenced by the tree. | |
8980 | * | |
8981 | * when a shared tree block is found. this function decreases its | |
8982 | * reference count by one. if update_ref is true, this function | |
8983 | * also make sure backrefs for the shared block and all lower level | |
8984 | * blocks are properly updated. | |
9d1a2a3a DS |
8985 | * |
8986 | * If called with for_reloc == 0, may exit early with -EAGAIN | |
9aca1d51 | 8987 | */ |
2c536799 | 8988 | int btrfs_drop_snapshot(struct btrfs_root *root, |
66d7e7f0 AJ |
8989 | struct btrfs_block_rsv *block_rsv, int update_ref, |
8990 | int for_reloc) | |
20524f02 | 8991 | { |
ab8d0fc4 | 8992 | struct btrfs_fs_info *fs_info = root->fs_info; |
5caf2a00 | 8993 | struct btrfs_path *path; |
2c47e605 | 8994 | struct btrfs_trans_handle *trans; |
ab8d0fc4 | 8995 | struct btrfs_root *tree_root = fs_info->tree_root; |
9f3a7427 | 8996 | struct btrfs_root_item *root_item = &root->root_item; |
2c47e605 YZ |
8997 | struct walk_control *wc; |
8998 | struct btrfs_key key; | |
8999 | int err = 0; | |
9000 | int ret; | |
9001 | int level; | |
d29a9f62 | 9002 | bool root_dropped = false; |
20524f02 | 9003 | |
ab8d0fc4 | 9004 | btrfs_debug(fs_info, "Drop subvolume %llu", root->objectid); |
1152651a | 9005 | |
5caf2a00 | 9006 | path = btrfs_alloc_path(); |
cb1b69f4 TI |
9007 | if (!path) { |
9008 | err = -ENOMEM; | |
9009 | goto out; | |
9010 | } | |
20524f02 | 9011 | |
2c47e605 | 9012 | wc = kzalloc(sizeof(*wc), GFP_NOFS); |
38a1a919 MF |
9013 | if (!wc) { |
9014 | btrfs_free_path(path); | |
cb1b69f4 TI |
9015 | err = -ENOMEM; |
9016 | goto out; | |
38a1a919 | 9017 | } |
2c47e605 | 9018 | |
a22285a6 | 9019 | trans = btrfs_start_transaction(tree_root, 0); |
79787eaa JM |
9020 | if (IS_ERR(trans)) { |
9021 | err = PTR_ERR(trans); | |
9022 | goto out_free; | |
9023 | } | |
98d5dc13 | 9024 | |
3fd0a558 YZ |
9025 | if (block_rsv) |
9026 | trans->block_rsv = block_rsv; | |
2c47e605 | 9027 | |
9f3a7427 | 9028 | if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { |
2c47e605 | 9029 | level = btrfs_header_level(root->node); |
5d4f98a2 YZ |
9030 | path->nodes[level] = btrfs_lock_root_node(root); |
9031 | btrfs_set_lock_blocking(path->nodes[level]); | |
9f3a7427 | 9032 | path->slots[level] = 0; |
bd681513 | 9033 | path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING; |
2c47e605 YZ |
9034 | memset(&wc->update_progress, 0, |
9035 | sizeof(wc->update_progress)); | |
9f3a7427 | 9036 | } else { |
9f3a7427 | 9037 | btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); |
2c47e605 YZ |
9038 | memcpy(&wc->update_progress, &key, |
9039 | sizeof(wc->update_progress)); | |
9040 | ||
6702ed49 | 9041 | level = root_item->drop_level; |
2c47e605 | 9042 | BUG_ON(level == 0); |
6702ed49 | 9043 | path->lowest_level = level; |
2c47e605 YZ |
9044 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
9045 | path->lowest_level = 0; | |
9046 | if (ret < 0) { | |
9047 | err = ret; | |
79787eaa | 9048 | goto out_end_trans; |
9f3a7427 | 9049 | } |
1c4850e2 | 9050 | WARN_ON(ret > 0); |
2c47e605 | 9051 | |
7d9eb12c CM |
9052 | /* |
9053 | * unlock our path, this is safe because only this | |
9054 | * function is allowed to delete this snapshot | |
9055 | */ | |
5d4f98a2 | 9056 | btrfs_unlock_up_safe(path, 0); |
2c47e605 YZ |
9057 | |
9058 | level = btrfs_header_level(root->node); | |
9059 | while (1) { | |
9060 | btrfs_tree_lock(path->nodes[level]); | |
9061 | btrfs_set_lock_blocking(path->nodes[level]); | |
fec386ac | 9062 | path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING; |
2c47e605 | 9063 | |
2ff7e61e | 9064 | ret = btrfs_lookup_extent_info(trans, fs_info, |
2c47e605 | 9065 | path->nodes[level]->start, |
3173a18f | 9066 | level, 1, &wc->refs[level], |
2c47e605 | 9067 | &wc->flags[level]); |
79787eaa JM |
9068 | if (ret < 0) { |
9069 | err = ret; | |
9070 | goto out_end_trans; | |
9071 | } | |
2c47e605 YZ |
9072 | BUG_ON(wc->refs[level] == 0); |
9073 | ||
9074 | if (level == root_item->drop_level) | |
9075 | break; | |
9076 | ||
9077 | btrfs_tree_unlock(path->nodes[level]); | |
fec386ac | 9078 | path->locks[level] = 0; |
2c47e605 YZ |
9079 | WARN_ON(wc->refs[level] != 1); |
9080 | level--; | |
9081 | } | |
9f3a7427 | 9082 | } |
2c47e605 YZ |
9083 | |
9084 | wc->level = level; | |
9085 | wc->shared_level = -1; | |
9086 | wc->stage = DROP_REFERENCE; | |
9087 | wc->update_ref = update_ref; | |
9088 | wc->keep_locks = 0; | |
66d7e7f0 | 9089 | wc->for_reloc = for_reloc; |
0b246afa | 9090 | wc->reada_count = BTRFS_NODEPTRS_PER_BLOCK(fs_info); |
2c47e605 | 9091 | |
d397712b | 9092 | while (1) { |
9d1a2a3a | 9093 | |
2c47e605 YZ |
9094 | ret = walk_down_tree(trans, root, path, wc); |
9095 | if (ret < 0) { | |
9096 | err = ret; | |
20524f02 | 9097 | break; |
2c47e605 | 9098 | } |
9aca1d51 | 9099 | |
2c47e605 YZ |
9100 | ret = walk_up_tree(trans, root, path, wc, BTRFS_MAX_LEVEL); |
9101 | if (ret < 0) { | |
9102 | err = ret; | |
20524f02 | 9103 | break; |
2c47e605 YZ |
9104 | } |
9105 | ||
9106 | if (ret > 0) { | |
9107 | BUG_ON(wc->stage != DROP_REFERENCE); | |
e7a84565 CM |
9108 | break; |
9109 | } | |
2c47e605 YZ |
9110 | |
9111 | if (wc->stage == DROP_REFERENCE) { | |
9112 | level = wc->level; | |
9113 | btrfs_node_key(path->nodes[level], | |
9114 | &root_item->drop_progress, | |
9115 | path->slots[level]); | |
9116 | root_item->drop_level = level; | |
9117 | } | |
9118 | ||
9119 | BUG_ON(wc->level == 0); | |
3a45bb20 | 9120 | if (btrfs_should_end_transaction(trans) || |
2ff7e61e | 9121 | (!for_reloc && btrfs_need_cleaner_sleep(fs_info))) { |
2c47e605 YZ |
9122 | ret = btrfs_update_root(trans, tree_root, |
9123 | &root->root_key, | |
9124 | root_item); | |
79787eaa | 9125 | if (ret) { |
66642832 | 9126 | btrfs_abort_transaction(trans, ret); |
79787eaa JM |
9127 | err = ret; |
9128 | goto out_end_trans; | |
9129 | } | |
2c47e605 | 9130 | |
3a45bb20 | 9131 | btrfs_end_transaction_throttle(trans); |
2ff7e61e | 9132 | if (!for_reloc && btrfs_need_cleaner_sleep(fs_info)) { |
ab8d0fc4 JM |
9133 | btrfs_debug(fs_info, |
9134 | "drop snapshot early exit"); | |
3c8f2422 JB |
9135 | err = -EAGAIN; |
9136 | goto out_free; | |
9137 | } | |
9138 | ||
a22285a6 | 9139 | trans = btrfs_start_transaction(tree_root, 0); |
79787eaa JM |
9140 | if (IS_ERR(trans)) { |
9141 | err = PTR_ERR(trans); | |
9142 | goto out_free; | |
9143 | } | |
3fd0a558 YZ |
9144 | if (block_rsv) |
9145 | trans->block_rsv = block_rsv; | |
c3e69d58 | 9146 | } |
20524f02 | 9147 | } |
b3b4aa74 | 9148 | btrfs_release_path(path); |
79787eaa JM |
9149 | if (err) |
9150 | goto out_end_trans; | |
2c47e605 YZ |
9151 | |
9152 | ret = btrfs_del_root(trans, tree_root, &root->root_key); | |
79787eaa | 9153 | if (ret) { |
66642832 | 9154 | btrfs_abort_transaction(trans, ret); |
79787eaa JM |
9155 | goto out_end_trans; |
9156 | } | |
2c47e605 | 9157 | |
76dda93c | 9158 | if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { |
cb517eab MX |
9159 | ret = btrfs_find_root(tree_root, &root->root_key, path, |
9160 | NULL, NULL); | |
79787eaa | 9161 | if (ret < 0) { |
66642832 | 9162 | btrfs_abort_transaction(trans, ret); |
79787eaa JM |
9163 | err = ret; |
9164 | goto out_end_trans; | |
9165 | } else if (ret > 0) { | |
84cd948c JB |
9166 | /* if we fail to delete the orphan item this time |
9167 | * around, it'll get picked up the next time. | |
9168 | * | |
9169 | * The most common failure here is just -ENOENT. | |
9170 | */ | |
9171 | btrfs_del_orphan_item(trans, tree_root, | |
9172 | root->root_key.objectid); | |
76dda93c YZ |
9173 | } |
9174 | } | |
9175 | ||
27cdeb70 | 9176 | if (test_bit(BTRFS_ROOT_IN_RADIX, &root->state)) { |
2b9dbef2 | 9177 | btrfs_add_dropped_root(trans, root); |
76dda93c YZ |
9178 | } else { |
9179 | free_extent_buffer(root->node); | |
9180 | free_extent_buffer(root->commit_root); | |
b0feb9d9 | 9181 | btrfs_put_fs_root(root); |
76dda93c | 9182 | } |
d29a9f62 | 9183 | root_dropped = true; |
79787eaa | 9184 | out_end_trans: |
3a45bb20 | 9185 | btrfs_end_transaction_throttle(trans); |
79787eaa | 9186 | out_free: |
2c47e605 | 9187 | kfree(wc); |
5caf2a00 | 9188 | btrfs_free_path(path); |
cb1b69f4 | 9189 | out: |
d29a9f62 JB |
9190 | /* |
9191 | * So if we need to stop dropping the snapshot for whatever reason we | |
9192 | * need to make sure to add it back to the dead root list so that we | |
9193 | * keep trying to do the work later. This also cleans up roots if we | |
9194 | * don't have it in the radix (like when we recover after a power fail | |
9195 | * or unmount) so we don't leak memory. | |
9196 | */ | |
b37b39cd | 9197 | if (!for_reloc && root_dropped == false) |
d29a9f62 | 9198 | btrfs_add_dead_root(root); |
90515e7f | 9199 | if (err && err != -EAGAIN) |
ab8d0fc4 | 9200 | btrfs_handle_fs_error(fs_info, err, NULL); |
2c536799 | 9201 | return err; |
20524f02 | 9202 | } |
9078a3e1 | 9203 | |
2c47e605 YZ |
9204 | /* |
9205 | * drop subtree rooted at tree block 'node'. | |
9206 | * | |
9207 | * NOTE: this function will unlock and release tree block 'node' | |
66d7e7f0 | 9208 | * only used by relocation code |
2c47e605 | 9209 | */ |
f82d02d9 YZ |
9210 | int btrfs_drop_subtree(struct btrfs_trans_handle *trans, |
9211 | struct btrfs_root *root, | |
9212 | struct extent_buffer *node, | |
9213 | struct extent_buffer *parent) | |
9214 | { | |
0b246afa | 9215 | struct btrfs_fs_info *fs_info = root->fs_info; |
f82d02d9 | 9216 | struct btrfs_path *path; |
2c47e605 | 9217 | struct walk_control *wc; |
f82d02d9 YZ |
9218 | int level; |
9219 | int parent_level; | |
9220 | int ret = 0; | |
9221 | int wret; | |
9222 | ||
2c47e605 YZ |
9223 | BUG_ON(root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); |
9224 | ||
f82d02d9 | 9225 | path = btrfs_alloc_path(); |
db5b493a TI |
9226 | if (!path) |
9227 | return -ENOMEM; | |
f82d02d9 | 9228 | |
2c47e605 | 9229 | wc = kzalloc(sizeof(*wc), GFP_NOFS); |
db5b493a TI |
9230 | if (!wc) { |
9231 | btrfs_free_path(path); | |
9232 | return -ENOMEM; | |
9233 | } | |
2c47e605 | 9234 | |
b9447ef8 | 9235 | btrfs_assert_tree_locked(parent); |
f82d02d9 YZ |
9236 | parent_level = btrfs_header_level(parent); |
9237 | extent_buffer_get(parent); | |
9238 | path->nodes[parent_level] = parent; | |
9239 | path->slots[parent_level] = btrfs_header_nritems(parent); | |
9240 | ||
b9447ef8 | 9241 | btrfs_assert_tree_locked(node); |
f82d02d9 | 9242 | level = btrfs_header_level(node); |
f82d02d9 YZ |
9243 | path->nodes[level] = node; |
9244 | path->slots[level] = 0; | |
bd681513 | 9245 | path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING; |
2c47e605 YZ |
9246 | |
9247 | wc->refs[parent_level] = 1; | |
9248 | wc->flags[parent_level] = BTRFS_BLOCK_FLAG_FULL_BACKREF; | |
9249 | wc->level = level; | |
9250 | wc->shared_level = -1; | |
9251 | wc->stage = DROP_REFERENCE; | |
9252 | wc->update_ref = 0; | |
9253 | wc->keep_locks = 1; | |
66d7e7f0 | 9254 | wc->for_reloc = 1; |
0b246afa | 9255 | wc->reada_count = BTRFS_NODEPTRS_PER_BLOCK(fs_info); |
f82d02d9 YZ |
9256 | |
9257 | while (1) { | |
2c47e605 YZ |
9258 | wret = walk_down_tree(trans, root, path, wc); |
9259 | if (wret < 0) { | |
f82d02d9 | 9260 | ret = wret; |
f82d02d9 | 9261 | break; |
2c47e605 | 9262 | } |
f82d02d9 | 9263 | |
2c47e605 | 9264 | wret = walk_up_tree(trans, root, path, wc, parent_level); |
f82d02d9 YZ |
9265 | if (wret < 0) |
9266 | ret = wret; | |
9267 | if (wret != 0) | |
9268 | break; | |
9269 | } | |
9270 | ||
2c47e605 | 9271 | kfree(wc); |
f82d02d9 YZ |
9272 | btrfs_free_path(path); |
9273 | return ret; | |
9274 | } | |
9275 | ||
6202df69 | 9276 | static u64 update_block_group_flags(struct btrfs_fs_info *fs_info, u64 flags) |
ec44a35c CM |
9277 | { |
9278 | u64 num_devices; | |
fc67c450 | 9279 | u64 stripped; |
e4d8ec0f | 9280 | |
fc67c450 ID |
9281 | /* |
9282 | * if restripe for this chunk_type is on pick target profile and | |
9283 | * return, otherwise do the usual balance | |
9284 | */ | |
6202df69 | 9285 | stripped = get_restripe_target(fs_info, flags); |
fc67c450 ID |
9286 | if (stripped) |
9287 | return extended_to_chunk(stripped); | |
e4d8ec0f | 9288 | |
6202df69 | 9289 | num_devices = fs_info->fs_devices->rw_devices; |
cd02dca5 | 9290 | |
fc67c450 | 9291 | stripped = BTRFS_BLOCK_GROUP_RAID0 | |
53b381b3 | 9292 | BTRFS_BLOCK_GROUP_RAID5 | BTRFS_BLOCK_GROUP_RAID6 | |
fc67c450 ID |
9293 | BTRFS_BLOCK_GROUP_RAID1 | BTRFS_BLOCK_GROUP_RAID10; |
9294 | ||
ec44a35c CM |
9295 | if (num_devices == 1) { |
9296 | stripped |= BTRFS_BLOCK_GROUP_DUP; | |
9297 | stripped = flags & ~stripped; | |
9298 | ||
9299 | /* turn raid0 into single device chunks */ | |
9300 | if (flags & BTRFS_BLOCK_GROUP_RAID0) | |
9301 | return stripped; | |
9302 | ||
9303 | /* turn mirroring into duplication */ | |
9304 | if (flags & (BTRFS_BLOCK_GROUP_RAID1 | | |
9305 | BTRFS_BLOCK_GROUP_RAID10)) | |
9306 | return stripped | BTRFS_BLOCK_GROUP_DUP; | |
ec44a35c CM |
9307 | } else { |
9308 | /* they already had raid on here, just return */ | |
ec44a35c CM |
9309 | if (flags & stripped) |
9310 | return flags; | |
9311 | ||
9312 | stripped |= BTRFS_BLOCK_GROUP_DUP; | |
9313 | stripped = flags & ~stripped; | |
9314 | ||
9315 | /* switch duplicated blocks with raid1 */ | |
9316 | if (flags & BTRFS_BLOCK_GROUP_DUP) | |
9317 | return stripped | BTRFS_BLOCK_GROUP_RAID1; | |
9318 | ||
e3176ca2 | 9319 | /* this is drive concat, leave it alone */ |
ec44a35c | 9320 | } |
e3176ca2 | 9321 | |
ec44a35c CM |
9322 | return flags; |
9323 | } | |
9324 | ||
868f401a | 9325 | static int inc_block_group_ro(struct btrfs_block_group_cache *cache, int force) |
0ef3e66b | 9326 | { |
f0486c68 YZ |
9327 | struct btrfs_space_info *sinfo = cache->space_info; |
9328 | u64 num_bytes; | |
199c36ea | 9329 | u64 min_allocable_bytes; |
f0486c68 | 9330 | int ret = -ENOSPC; |
0ef3e66b | 9331 | |
199c36ea MX |
9332 | /* |
9333 | * We need some metadata space and system metadata space for | |
9334 | * allocating chunks in some corner cases until we force to set | |
9335 | * it to be readonly. | |
9336 | */ | |
9337 | if ((sinfo->flags & | |
9338 | (BTRFS_BLOCK_GROUP_SYSTEM | BTRFS_BLOCK_GROUP_METADATA)) && | |
9339 | !force) | |
ee22184b | 9340 | min_allocable_bytes = SZ_1M; |
199c36ea MX |
9341 | else |
9342 | min_allocable_bytes = 0; | |
9343 | ||
f0486c68 YZ |
9344 | spin_lock(&sinfo->lock); |
9345 | spin_lock(&cache->lock); | |
61cfea9b W |
9346 | |
9347 | if (cache->ro) { | |
868f401a | 9348 | cache->ro++; |
61cfea9b W |
9349 | ret = 0; |
9350 | goto out; | |
9351 | } | |
9352 | ||
f0486c68 YZ |
9353 | num_bytes = cache->key.offset - cache->reserved - cache->pinned - |
9354 | cache->bytes_super - btrfs_block_group_used(&cache->item); | |
9355 | ||
4136135b | 9356 | if (btrfs_space_info_used(sinfo, true) + num_bytes + |
37be25bc | 9357 | min_allocable_bytes <= sinfo->total_bytes) { |
f0486c68 | 9358 | sinfo->bytes_readonly += num_bytes; |
868f401a | 9359 | cache->ro++; |
633c0aad | 9360 | list_add_tail(&cache->ro_list, &sinfo->ro_bgs); |
f0486c68 YZ |
9361 | ret = 0; |
9362 | } | |
61cfea9b | 9363 | out: |
f0486c68 YZ |
9364 | spin_unlock(&cache->lock); |
9365 | spin_unlock(&sinfo->lock); | |
9366 | return ret; | |
9367 | } | |
7d9eb12c | 9368 | |
5e00f193 | 9369 | int btrfs_inc_block_group_ro(struct btrfs_fs_info *fs_info, |
f0486c68 | 9370 | struct btrfs_block_group_cache *cache) |
c286ac48 | 9371 | |
f0486c68 YZ |
9372 | { |
9373 | struct btrfs_trans_handle *trans; | |
9374 | u64 alloc_flags; | |
9375 | int ret; | |
7d9eb12c | 9376 | |
1bbc621e | 9377 | again: |
5e00f193 | 9378 | trans = btrfs_join_transaction(fs_info->extent_root); |
79787eaa JM |
9379 | if (IS_ERR(trans)) |
9380 | return PTR_ERR(trans); | |
5d4f98a2 | 9381 | |
1bbc621e CM |
9382 | /* |
9383 | * we're not allowed to set block groups readonly after the dirty | |
9384 | * block groups cache has started writing. If it already started, | |
9385 | * back off and let this transaction commit | |
9386 | */ | |
0b246afa | 9387 | mutex_lock(&fs_info->ro_block_group_mutex); |
3204d33c | 9388 | if (test_bit(BTRFS_TRANS_DIRTY_BG_RUN, &trans->transaction->flags)) { |
1bbc621e CM |
9389 | u64 transid = trans->transid; |
9390 | ||
0b246afa | 9391 | mutex_unlock(&fs_info->ro_block_group_mutex); |
3a45bb20 | 9392 | btrfs_end_transaction(trans); |
1bbc621e | 9393 | |
2ff7e61e | 9394 | ret = btrfs_wait_for_commit(fs_info, transid); |
1bbc621e CM |
9395 | if (ret) |
9396 | return ret; | |
9397 | goto again; | |
9398 | } | |
9399 | ||
153c35b6 CM |
9400 | /* |
9401 | * if we are changing raid levels, try to allocate a corresponding | |
9402 | * block group with the new raid level. | |
9403 | */ | |
0b246afa | 9404 | alloc_flags = update_block_group_flags(fs_info, cache->flags); |
153c35b6 | 9405 | if (alloc_flags != cache->flags) { |
2ff7e61e | 9406 | ret = do_chunk_alloc(trans, fs_info, alloc_flags, |
153c35b6 CM |
9407 | CHUNK_ALLOC_FORCE); |
9408 | /* | |
9409 | * ENOSPC is allowed here, we may have enough space | |
9410 | * already allocated at the new raid level to | |
9411 | * carry on | |
9412 | */ | |
9413 | if (ret == -ENOSPC) | |
9414 | ret = 0; | |
9415 | if (ret < 0) | |
9416 | goto out; | |
9417 | } | |
1bbc621e | 9418 | |
868f401a | 9419 | ret = inc_block_group_ro(cache, 0); |
f0486c68 YZ |
9420 | if (!ret) |
9421 | goto out; | |
2ff7e61e JM |
9422 | alloc_flags = get_alloc_profile(fs_info, cache->space_info->flags); |
9423 | ret = do_chunk_alloc(trans, fs_info, alloc_flags, | |
0e4f8f88 | 9424 | CHUNK_ALLOC_FORCE); |
f0486c68 YZ |
9425 | if (ret < 0) |
9426 | goto out; | |
868f401a | 9427 | ret = inc_block_group_ro(cache, 0); |
f0486c68 | 9428 | out: |
2f081088 | 9429 | if (cache->flags & BTRFS_BLOCK_GROUP_SYSTEM) { |
0b246afa | 9430 | alloc_flags = update_block_group_flags(fs_info, cache->flags); |
34441361 | 9431 | mutex_lock(&fs_info->chunk_mutex); |
2ff7e61e | 9432 | check_system_chunk(trans, fs_info, alloc_flags); |
34441361 | 9433 | mutex_unlock(&fs_info->chunk_mutex); |
2f081088 | 9434 | } |
0b246afa | 9435 | mutex_unlock(&fs_info->ro_block_group_mutex); |
2f081088 | 9436 | |
3a45bb20 | 9437 | btrfs_end_transaction(trans); |
f0486c68 YZ |
9438 | return ret; |
9439 | } | |
5d4f98a2 | 9440 | |
c87f08ca | 9441 | int btrfs_force_chunk_alloc(struct btrfs_trans_handle *trans, |
2ff7e61e | 9442 | struct btrfs_fs_info *fs_info, u64 type) |
c87f08ca | 9443 | { |
2ff7e61e JM |
9444 | u64 alloc_flags = get_alloc_profile(fs_info, type); |
9445 | ||
9446 | return do_chunk_alloc(trans, fs_info, alloc_flags, CHUNK_ALLOC_FORCE); | |
c87f08ca CM |
9447 | } |
9448 | ||
6d07bcec MX |
9449 | /* |
9450 | * helper to account the unused space of all the readonly block group in the | |
633c0aad | 9451 | * space_info. takes mirrors into account. |
6d07bcec | 9452 | */ |
633c0aad | 9453 | u64 btrfs_account_ro_block_groups_free_space(struct btrfs_space_info *sinfo) |
6d07bcec MX |
9454 | { |
9455 | struct btrfs_block_group_cache *block_group; | |
9456 | u64 free_bytes = 0; | |
9457 | int factor; | |
9458 | ||
01327610 | 9459 | /* It's df, we don't care if it's racy */ |
633c0aad JB |
9460 | if (list_empty(&sinfo->ro_bgs)) |
9461 | return 0; | |
9462 | ||
9463 | spin_lock(&sinfo->lock); | |
9464 | list_for_each_entry(block_group, &sinfo->ro_bgs, ro_list) { | |
6d07bcec MX |
9465 | spin_lock(&block_group->lock); |
9466 | ||
9467 | if (!block_group->ro) { | |
9468 | spin_unlock(&block_group->lock); | |
9469 | continue; | |
9470 | } | |
9471 | ||
9472 | if (block_group->flags & (BTRFS_BLOCK_GROUP_RAID1 | | |
9473 | BTRFS_BLOCK_GROUP_RAID10 | | |
9474 | BTRFS_BLOCK_GROUP_DUP)) | |
9475 | factor = 2; | |
9476 | else | |
9477 | factor = 1; | |
9478 | ||
9479 | free_bytes += (block_group->key.offset - | |
9480 | btrfs_block_group_used(&block_group->item)) * | |
9481 | factor; | |
9482 | ||
9483 | spin_unlock(&block_group->lock); | |
9484 | } | |
6d07bcec MX |
9485 | spin_unlock(&sinfo->lock); |
9486 | ||
9487 | return free_bytes; | |
9488 | } | |
9489 | ||
2ff7e61e | 9490 | void btrfs_dec_block_group_ro(struct btrfs_block_group_cache *cache) |
5d4f98a2 | 9491 | { |
f0486c68 YZ |
9492 | struct btrfs_space_info *sinfo = cache->space_info; |
9493 | u64 num_bytes; | |
9494 | ||
9495 | BUG_ON(!cache->ro); | |
9496 | ||
9497 | spin_lock(&sinfo->lock); | |
9498 | spin_lock(&cache->lock); | |
868f401a Z |
9499 | if (!--cache->ro) { |
9500 | num_bytes = cache->key.offset - cache->reserved - | |
9501 | cache->pinned - cache->bytes_super - | |
9502 | btrfs_block_group_used(&cache->item); | |
9503 | sinfo->bytes_readonly -= num_bytes; | |
9504 | list_del_init(&cache->ro_list); | |
9505 | } | |
f0486c68 YZ |
9506 | spin_unlock(&cache->lock); |
9507 | spin_unlock(&sinfo->lock); | |
5d4f98a2 YZ |
9508 | } |
9509 | ||
ba1bf481 JB |
9510 | /* |
9511 | * checks to see if its even possible to relocate this block group. | |
9512 | * | |
9513 | * @return - -1 if it's not a good idea to relocate this block group, 0 if its | |
9514 | * ok to go ahead and try. | |
9515 | */ | |
6bccf3ab | 9516 | int btrfs_can_relocate(struct btrfs_fs_info *fs_info, u64 bytenr) |
1a40e23b | 9517 | { |
6bccf3ab | 9518 | struct btrfs_root *root = fs_info->extent_root; |
ba1bf481 JB |
9519 | struct btrfs_block_group_cache *block_group; |
9520 | struct btrfs_space_info *space_info; | |
0b246afa | 9521 | struct btrfs_fs_devices *fs_devices = fs_info->fs_devices; |
ba1bf481 | 9522 | struct btrfs_device *device; |
6df9a95e | 9523 | struct btrfs_trans_handle *trans; |
cdcb725c | 9524 | u64 min_free; |
6719db6a JB |
9525 | u64 dev_min = 1; |
9526 | u64 dev_nr = 0; | |
4a5e98f5 | 9527 | u64 target; |
0305bc27 | 9528 | int debug; |
cdcb725c | 9529 | int index; |
ba1bf481 JB |
9530 | int full = 0; |
9531 | int ret = 0; | |
1a40e23b | 9532 | |
0b246afa | 9533 | debug = btrfs_test_opt(fs_info, ENOSPC_DEBUG); |
0305bc27 | 9534 | |
0b246afa | 9535 | block_group = btrfs_lookup_block_group(fs_info, bytenr); |
1a40e23b | 9536 | |
ba1bf481 | 9537 | /* odd, couldn't find the block group, leave it alone */ |
0305bc27 QW |
9538 | if (!block_group) { |
9539 | if (debug) | |
0b246afa | 9540 | btrfs_warn(fs_info, |
0305bc27 QW |
9541 | "can't find block group for bytenr %llu", |
9542 | bytenr); | |
ba1bf481 | 9543 | return -1; |
0305bc27 | 9544 | } |
1a40e23b | 9545 | |
cdcb725c | 9546 | min_free = btrfs_block_group_used(&block_group->item); |
9547 | ||
ba1bf481 | 9548 | /* no bytes used, we're good */ |
cdcb725c | 9549 | if (!min_free) |
1a40e23b ZY |
9550 | goto out; |
9551 | ||
ba1bf481 JB |
9552 | space_info = block_group->space_info; |
9553 | spin_lock(&space_info->lock); | |
17d217fe | 9554 | |
ba1bf481 | 9555 | full = space_info->full; |
17d217fe | 9556 | |
ba1bf481 JB |
9557 | /* |
9558 | * if this is the last block group we have in this space, we can't | |
7ce618db CM |
9559 | * relocate it unless we're able to allocate a new chunk below. |
9560 | * | |
9561 | * Otherwise, we need to make sure we have room in the space to handle | |
9562 | * all of the extents from this block group. If we can, we're good | |
ba1bf481 | 9563 | */ |
7ce618db | 9564 | if ((space_info->total_bytes != block_group->key.offset) && |
4136135b LB |
9565 | (btrfs_space_info_used(space_info, false) + min_free < |
9566 | space_info->total_bytes)) { | |
ba1bf481 JB |
9567 | spin_unlock(&space_info->lock); |
9568 | goto out; | |
17d217fe | 9569 | } |
ba1bf481 | 9570 | spin_unlock(&space_info->lock); |
ea8c2819 | 9571 | |
ba1bf481 JB |
9572 | /* |
9573 | * ok we don't have enough space, but maybe we have free space on our | |
9574 | * devices to allocate new chunks for relocation, so loop through our | |
4a5e98f5 ID |
9575 | * alloc devices and guess if we have enough space. if this block |
9576 | * group is going to be restriped, run checks against the target | |
9577 | * profile instead of the current one. | |
ba1bf481 JB |
9578 | */ |
9579 | ret = -1; | |
ea8c2819 | 9580 | |
cdcb725c | 9581 | /* |
9582 | * index: | |
9583 | * 0: raid10 | |
9584 | * 1: raid1 | |
9585 | * 2: dup | |
9586 | * 3: raid0 | |
9587 | * 4: single | |
9588 | */ | |
0b246afa | 9589 | target = get_restripe_target(fs_info, block_group->flags); |
4a5e98f5 | 9590 | if (target) { |
31e50229 | 9591 | index = __get_raid_index(extended_to_chunk(target)); |
4a5e98f5 ID |
9592 | } else { |
9593 | /* | |
9594 | * this is just a balance, so if we were marked as full | |
9595 | * we know there is no space for a new chunk | |
9596 | */ | |
0305bc27 QW |
9597 | if (full) { |
9598 | if (debug) | |
0b246afa JM |
9599 | btrfs_warn(fs_info, |
9600 | "no space to alloc new chunk for block group %llu", | |
9601 | block_group->key.objectid); | |
4a5e98f5 | 9602 | goto out; |
0305bc27 | 9603 | } |
4a5e98f5 ID |
9604 | |
9605 | index = get_block_group_index(block_group); | |
9606 | } | |
9607 | ||
e6ec716f | 9608 | if (index == BTRFS_RAID_RAID10) { |
cdcb725c | 9609 | dev_min = 4; |
6719db6a JB |
9610 | /* Divide by 2 */ |
9611 | min_free >>= 1; | |
e6ec716f | 9612 | } else if (index == BTRFS_RAID_RAID1) { |
cdcb725c | 9613 | dev_min = 2; |
e6ec716f | 9614 | } else if (index == BTRFS_RAID_DUP) { |
6719db6a JB |
9615 | /* Multiply by 2 */ |
9616 | min_free <<= 1; | |
e6ec716f | 9617 | } else if (index == BTRFS_RAID_RAID0) { |
cdcb725c | 9618 | dev_min = fs_devices->rw_devices; |
47c5713f | 9619 | min_free = div64_u64(min_free, dev_min); |
cdcb725c | 9620 | } |
9621 | ||
6df9a95e JB |
9622 | /* We need to do this so that we can look at pending chunks */ |
9623 | trans = btrfs_join_transaction(root); | |
9624 | if (IS_ERR(trans)) { | |
9625 | ret = PTR_ERR(trans); | |
9626 | goto out; | |
9627 | } | |
9628 | ||
0b246afa | 9629 | mutex_lock(&fs_info->chunk_mutex); |
ba1bf481 | 9630 | list_for_each_entry(device, &fs_devices->alloc_list, dev_alloc_list) { |
7bfc837d | 9631 | u64 dev_offset; |
56bec294 | 9632 | |
ba1bf481 JB |
9633 | /* |
9634 | * check to make sure we can actually find a chunk with enough | |
9635 | * space to fit our block group in. | |
9636 | */ | |
63a212ab SB |
9637 | if (device->total_bytes > device->bytes_used + min_free && |
9638 | !device->is_tgtdev_for_dev_replace) { | |
6df9a95e | 9639 | ret = find_free_dev_extent(trans, device, min_free, |
7bfc837d | 9640 | &dev_offset, NULL); |
ba1bf481 | 9641 | if (!ret) |
cdcb725c | 9642 | dev_nr++; |
9643 | ||
9644 | if (dev_nr >= dev_min) | |
73e48b27 | 9645 | break; |
cdcb725c | 9646 | |
ba1bf481 | 9647 | ret = -1; |
725c8463 | 9648 | } |
edbd8d4e | 9649 | } |
0305bc27 | 9650 | if (debug && ret == -1) |
0b246afa JM |
9651 | btrfs_warn(fs_info, |
9652 | "no space to allocate a new chunk for block group %llu", | |
9653 | block_group->key.objectid); | |
9654 | mutex_unlock(&fs_info->chunk_mutex); | |
3a45bb20 | 9655 | btrfs_end_transaction(trans); |
edbd8d4e | 9656 | out: |
ba1bf481 | 9657 | btrfs_put_block_group(block_group); |
edbd8d4e CM |
9658 | return ret; |
9659 | } | |
9660 | ||
6bccf3ab JM |
9661 | static int find_first_block_group(struct btrfs_fs_info *fs_info, |
9662 | struct btrfs_path *path, | |
9663 | struct btrfs_key *key) | |
0b86a832 | 9664 | { |
6bccf3ab | 9665 | struct btrfs_root *root = fs_info->extent_root; |
925baedd | 9666 | int ret = 0; |
0b86a832 CM |
9667 | struct btrfs_key found_key; |
9668 | struct extent_buffer *leaf; | |
9669 | int slot; | |
edbd8d4e | 9670 | |
0b86a832 CM |
9671 | ret = btrfs_search_slot(NULL, root, key, path, 0, 0); |
9672 | if (ret < 0) | |
925baedd CM |
9673 | goto out; |
9674 | ||
d397712b | 9675 | while (1) { |
0b86a832 | 9676 | slot = path->slots[0]; |
edbd8d4e | 9677 | leaf = path->nodes[0]; |
0b86a832 CM |
9678 | if (slot >= btrfs_header_nritems(leaf)) { |
9679 | ret = btrfs_next_leaf(root, path); | |
9680 | if (ret == 0) | |
9681 | continue; | |
9682 | if (ret < 0) | |
925baedd | 9683 | goto out; |
0b86a832 | 9684 | break; |
edbd8d4e | 9685 | } |
0b86a832 | 9686 | btrfs_item_key_to_cpu(leaf, &found_key, slot); |
edbd8d4e | 9687 | |
0b86a832 | 9688 | if (found_key.objectid >= key->objectid && |
925baedd | 9689 | found_key.type == BTRFS_BLOCK_GROUP_ITEM_KEY) { |
6fb37b75 LB |
9690 | struct extent_map_tree *em_tree; |
9691 | struct extent_map *em; | |
9692 | ||
9693 | em_tree = &root->fs_info->mapping_tree.map_tree; | |
9694 | read_lock(&em_tree->lock); | |
9695 | em = lookup_extent_mapping(em_tree, found_key.objectid, | |
9696 | found_key.offset); | |
9697 | read_unlock(&em_tree->lock); | |
9698 | if (!em) { | |
0b246afa | 9699 | btrfs_err(fs_info, |
6fb37b75 LB |
9700 | "logical %llu len %llu found bg but no related chunk", |
9701 | found_key.objectid, found_key.offset); | |
9702 | ret = -ENOENT; | |
9703 | } else { | |
9704 | ret = 0; | |
9705 | } | |
187ee58c | 9706 | free_extent_map(em); |
925baedd CM |
9707 | goto out; |
9708 | } | |
0b86a832 | 9709 | path->slots[0]++; |
edbd8d4e | 9710 | } |
925baedd | 9711 | out: |
0b86a832 | 9712 | return ret; |
edbd8d4e CM |
9713 | } |
9714 | ||
0af3d00b JB |
9715 | void btrfs_put_block_group_cache(struct btrfs_fs_info *info) |
9716 | { | |
9717 | struct btrfs_block_group_cache *block_group; | |
9718 | u64 last = 0; | |
9719 | ||
9720 | while (1) { | |
9721 | struct inode *inode; | |
9722 | ||
9723 | block_group = btrfs_lookup_first_block_group(info, last); | |
9724 | while (block_group) { | |
9725 | spin_lock(&block_group->lock); | |
9726 | if (block_group->iref) | |
9727 | break; | |
9728 | spin_unlock(&block_group->lock); | |
2ff7e61e | 9729 | block_group = next_block_group(info, block_group); |
0af3d00b JB |
9730 | } |
9731 | if (!block_group) { | |
9732 | if (last == 0) | |
9733 | break; | |
9734 | last = 0; | |
9735 | continue; | |
9736 | } | |
9737 | ||
9738 | inode = block_group->inode; | |
9739 | block_group->iref = 0; | |
9740 | block_group->inode = NULL; | |
9741 | spin_unlock(&block_group->lock); | |
f3bca802 | 9742 | ASSERT(block_group->io_ctl.inode == NULL); |
0af3d00b JB |
9743 | iput(inode); |
9744 | last = block_group->key.objectid + block_group->key.offset; | |
9745 | btrfs_put_block_group(block_group); | |
9746 | } | |
9747 | } | |
9748 | ||
5cdd7db6 FM |
9749 | /* |
9750 | * Must be called only after stopping all workers, since we could have block | |
9751 | * group caching kthreads running, and therefore they could race with us if we | |
9752 | * freed the block groups before stopping them. | |
9753 | */ | |
1a40e23b ZY |
9754 | int btrfs_free_block_groups(struct btrfs_fs_info *info) |
9755 | { | |
9756 | struct btrfs_block_group_cache *block_group; | |
4184ea7f | 9757 | struct btrfs_space_info *space_info; |
11833d66 | 9758 | struct btrfs_caching_control *caching_ctl; |
1a40e23b ZY |
9759 | struct rb_node *n; |
9760 | ||
9e351cc8 | 9761 | down_write(&info->commit_root_sem); |
11833d66 YZ |
9762 | while (!list_empty(&info->caching_block_groups)) { |
9763 | caching_ctl = list_entry(info->caching_block_groups.next, | |
9764 | struct btrfs_caching_control, list); | |
9765 | list_del(&caching_ctl->list); | |
9766 | put_caching_control(caching_ctl); | |
9767 | } | |
9e351cc8 | 9768 | up_write(&info->commit_root_sem); |
11833d66 | 9769 | |
47ab2a6c JB |
9770 | spin_lock(&info->unused_bgs_lock); |
9771 | while (!list_empty(&info->unused_bgs)) { | |
9772 | block_group = list_first_entry(&info->unused_bgs, | |
9773 | struct btrfs_block_group_cache, | |
9774 | bg_list); | |
9775 | list_del_init(&block_group->bg_list); | |
9776 | btrfs_put_block_group(block_group); | |
9777 | } | |
9778 | spin_unlock(&info->unused_bgs_lock); | |
9779 | ||
1a40e23b ZY |
9780 | spin_lock(&info->block_group_cache_lock); |
9781 | while ((n = rb_last(&info->block_group_cache_tree)) != NULL) { | |
9782 | block_group = rb_entry(n, struct btrfs_block_group_cache, | |
9783 | cache_node); | |
1a40e23b ZY |
9784 | rb_erase(&block_group->cache_node, |
9785 | &info->block_group_cache_tree); | |
01eacb27 | 9786 | RB_CLEAR_NODE(&block_group->cache_node); |
d899e052 YZ |
9787 | spin_unlock(&info->block_group_cache_lock); |
9788 | ||
80eb234a | 9789 | down_write(&block_group->space_info->groups_sem); |
1a40e23b | 9790 | list_del(&block_group->list); |
80eb234a | 9791 | up_write(&block_group->space_info->groups_sem); |
d2fb3437 | 9792 | |
3c14874a JB |
9793 | /* |
9794 | * We haven't cached this block group, which means we could | |
9795 | * possibly have excluded extents on this block group. | |
9796 | */ | |
36cce922 JB |
9797 | if (block_group->cached == BTRFS_CACHE_NO || |
9798 | block_group->cached == BTRFS_CACHE_ERROR) | |
2ff7e61e | 9799 | free_excluded_extents(info, block_group); |
3c14874a | 9800 | |
817d52f8 | 9801 | btrfs_remove_free_space_cache(block_group); |
5cdd7db6 | 9802 | ASSERT(block_group->cached != BTRFS_CACHE_STARTED); |
f3bca802 LB |
9803 | ASSERT(list_empty(&block_group->dirty_list)); |
9804 | ASSERT(list_empty(&block_group->io_list)); | |
9805 | ASSERT(list_empty(&block_group->bg_list)); | |
9806 | ASSERT(atomic_read(&block_group->count) == 1); | |
11dfe35a | 9807 | btrfs_put_block_group(block_group); |
d899e052 YZ |
9808 | |
9809 | spin_lock(&info->block_group_cache_lock); | |
1a40e23b ZY |
9810 | } |
9811 | spin_unlock(&info->block_group_cache_lock); | |
4184ea7f CM |
9812 | |
9813 | /* now that all the block groups are freed, go through and | |
9814 | * free all the space_info structs. This is only called during | |
9815 | * the final stages of unmount, and so we know nobody is | |
9816 | * using them. We call synchronize_rcu() once before we start, | |
9817 | * just to be on the safe side. | |
9818 | */ | |
9819 | synchronize_rcu(); | |
9820 | ||
8929ecfa YZ |
9821 | release_global_block_rsv(info); |
9822 | ||
67871254 | 9823 | while (!list_empty(&info->space_info)) { |
6ab0a202 JM |
9824 | int i; |
9825 | ||
4184ea7f CM |
9826 | space_info = list_entry(info->space_info.next, |
9827 | struct btrfs_space_info, | |
9828 | list); | |
d555b6c3 JB |
9829 | |
9830 | /* | |
9831 | * Do not hide this behind enospc_debug, this is actually | |
9832 | * important and indicates a real bug if this happens. | |
9833 | */ | |
9834 | if (WARN_ON(space_info->bytes_pinned > 0 || | |
b069e0c3 | 9835 | space_info->bytes_reserved > 0 || |
d555b6c3 | 9836 | space_info->bytes_may_use > 0)) |
ab8d0fc4 | 9837 | dump_space_info(info, space_info, 0, 0); |
4184ea7f | 9838 | list_del(&space_info->list); |
6ab0a202 JM |
9839 | for (i = 0; i < BTRFS_NR_RAID_TYPES; i++) { |
9840 | struct kobject *kobj; | |
c1895442 JM |
9841 | kobj = space_info->block_group_kobjs[i]; |
9842 | space_info->block_group_kobjs[i] = NULL; | |
9843 | if (kobj) { | |
6ab0a202 JM |
9844 | kobject_del(kobj); |
9845 | kobject_put(kobj); | |
9846 | } | |
9847 | } | |
9848 | kobject_del(&space_info->kobj); | |
9849 | kobject_put(&space_info->kobj); | |
4184ea7f | 9850 | } |
1a40e23b ZY |
9851 | return 0; |
9852 | } | |
9853 | ||
b742bb82 YZ |
9854 | static void __link_block_group(struct btrfs_space_info *space_info, |
9855 | struct btrfs_block_group_cache *cache) | |
9856 | { | |
9857 | int index = get_block_group_index(cache); | |
ed55b6ac | 9858 | bool first = false; |
b742bb82 YZ |
9859 | |
9860 | down_write(&space_info->groups_sem); | |
ed55b6ac JM |
9861 | if (list_empty(&space_info->block_groups[index])) |
9862 | first = true; | |
9863 | list_add_tail(&cache->list, &space_info->block_groups[index]); | |
9864 | up_write(&space_info->groups_sem); | |
9865 | ||
9866 | if (first) { | |
c1895442 | 9867 | struct raid_kobject *rkobj; |
6ab0a202 JM |
9868 | int ret; |
9869 | ||
c1895442 JM |
9870 | rkobj = kzalloc(sizeof(*rkobj), GFP_NOFS); |
9871 | if (!rkobj) | |
9872 | goto out_err; | |
9873 | rkobj->raid_type = index; | |
9874 | kobject_init(&rkobj->kobj, &btrfs_raid_ktype); | |
9875 | ret = kobject_add(&rkobj->kobj, &space_info->kobj, | |
9876 | "%s", get_raid_name(index)); | |
6ab0a202 | 9877 | if (ret) { |
c1895442 JM |
9878 | kobject_put(&rkobj->kobj); |
9879 | goto out_err; | |
6ab0a202 | 9880 | } |
c1895442 | 9881 | space_info->block_group_kobjs[index] = &rkobj->kobj; |
6ab0a202 | 9882 | } |
c1895442 JM |
9883 | |
9884 | return; | |
9885 | out_err: | |
ab8d0fc4 JM |
9886 | btrfs_warn(cache->fs_info, |
9887 | "failed to add kobject for block cache, ignoring"); | |
b742bb82 YZ |
9888 | } |
9889 | ||
920e4a58 | 9890 | static struct btrfs_block_group_cache * |
2ff7e61e JM |
9891 | btrfs_create_block_group_cache(struct btrfs_fs_info *fs_info, |
9892 | u64 start, u64 size) | |
920e4a58 MX |
9893 | { |
9894 | struct btrfs_block_group_cache *cache; | |
9895 | ||
9896 | cache = kzalloc(sizeof(*cache), GFP_NOFS); | |
9897 | if (!cache) | |
9898 | return NULL; | |
9899 | ||
9900 | cache->free_space_ctl = kzalloc(sizeof(*cache->free_space_ctl), | |
9901 | GFP_NOFS); | |
9902 | if (!cache->free_space_ctl) { | |
9903 | kfree(cache); | |
9904 | return NULL; | |
9905 | } | |
9906 | ||
9907 | cache->key.objectid = start; | |
9908 | cache->key.offset = size; | |
9909 | cache->key.type = BTRFS_BLOCK_GROUP_ITEM_KEY; | |
9910 | ||
0b246afa JM |
9911 | cache->sectorsize = fs_info->sectorsize; |
9912 | cache->fs_info = fs_info; | |
2ff7e61e JM |
9913 | cache->full_stripe_len = btrfs_full_stripe_len(fs_info, |
9914 | &fs_info->mapping_tree, | |
9915 | start); | |
1e144fb8 OS |
9916 | set_free_space_tree_thresholds(cache); |
9917 | ||
920e4a58 MX |
9918 | atomic_set(&cache->count, 1); |
9919 | spin_lock_init(&cache->lock); | |
e570fd27 | 9920 | init_rwsem(&cache->data_rwsem); |
920e4a58 MX |
9921 | INIT_LIST_HEAD(&cache->list); |
9922 | INIT_LIST_HEAD(&cache->cluster_list); | |
47ab2a6c | 9923 | INIT_LIST_HEAD(&cache->bg_list); |
633c0aad | 9924 | INIT_LIST_HEAD(&cache->ro_list); |
ce93ec54 | 9925 | INIT_LIST_HEAD(&cache->dirty_list); |
c9dc4c65 | 9926 | INIT_LIST_HEAD(&cache->io_list); |
920e4a58 | 9927 | btrfs_init_free_space_ctl(cache); |
04216820 | 9928 | atomic_set(&cache->trimming, 0); |
a5ed9182 | 9929 | mutex_init(&cache->free_space_lock); |
0966a7b1 | 9930 | btrfs_init_full_stripe_locks_tree(&cache->full_stripe_locks_root); |
920e4a58 MX |
9931 | |
9932 | return cache; | |
9933 | } | |
9934 | ||
5b4aacef | 9935 | int btrfs_read_block_groups(struct btrfs_fs_info *info) |
9078a3e1 CM |
9936 | { |
9937 | struct btrfs_path *path; | |
9938 | int ret; | |
9078a3e1 | 9939 | struct btrfs_block_group_cache *cache; |
6324fbf3 | 9940 | struct btrfs_space_info *space_info; |
9078a3e1 CM |
9941 | struct btrfs_key key; |
9942 | struct btrfs_key found_key; | |
5f39d397 | 9943 | struct extent_buffer *leaf; |
0af3d00b JB |
9944 | int need_clear = 0; |
9945 | u64 cache_gen; | |
49303381 LB |
9946 | u64 feature; |
9947 | int mixed; | |
9948 | ||
9949 | feature = btrfs_super_incompat_flags(info->super_copy); | |
9950 | mixed = !!(feature & BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS); | |
96b5179d | 9951 | |
9078a3e1 | 9952 | key.objectid = 0; |
0b86a832 | 9953 | key.offset = 0; |
962a298f | 9954 | key.type = BTRFS_BLOCK_GROUP_ITEM_KEY; |
9078a3e1 CM |
9955 | path = btrfs_alloc_path(); |
9956 | if (!path) | |
9957 | return -ENOMEM; | |
e4058b54 | 9958 | path->reada = READA_FORWARD; |
9078a3e1 | 9959 | |
0b246afa JM |
9960 | cache_gen = btrfs_super_cache_generation(info->super_copy); |
9961 | if (btrfs_test_opt(info, SPACE_CACHE) && | |
9962 | btrfs_super_generation(info->super_copy) != cache_gen) | |
0af3d00b | 9963 | need_clear = 1; |
0b246afa | 9964 | if (btrfs_test_opt(info, CLEAR_CACHE)) |
88c2ba3b | 9965 | need_clear = 1; |
0af3d00b | 9966 | |
d397712b | 9967 | while (1) { |
6bccf3ab | 9968 | ret = find_first_block_group(info, path, &key); |
b742bb82 YZ |
9969 | if (ret > 0) |
9970 | break; | |
0b86a832 CM |
9971 | if (ret != 0) |
9972 | goto error; | |
920e4a58 | 9973 | |
5f39d397 CM |
9974 | leaf = path->nodes[0]; |
9975 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
920e4a58 | 9976 | |
2ff7e61e | 9977 | cache = btrfs_create_block_group_cache(info, found_key.objectid, |
920e4a58 | 9978 | found_key.offset); |
9078a3e1 | 9979 | if (!cache) { |
0b86a832 | 9980 | ret = -ENOMEM; |
f0486c68 | 9981 | goto error; |
9078a3e1 | 9982 | } |
96303081 | 9983 | |
cf7c1ef6 LB |
9984 | if (need_clear) { |
9985 | /* | |
9986 | * When we mount with old space cache, we need to | |
9987 | * set BTRFS_DC_CLEAR and set dirty flag. | |
9988 | * | |
9989 | * a) Setting 'BTRFS_DC_CLEAR' makes sure that we | |
9990 | * truncate the old free space cache inode and | |
9991 | * setup a new one. | |
9992 | * b) Setting 'dirty flag' makes sure that we flush | |
9993 | * the new space cache info onto disk. | |
9994 | */ | |
0b246afa | 9995 | if (btrfs_test_opt(info, SPACE_CACHE)) |
ce93ec54 | 9996 | cache->disk_cache_state = BTRFS_DC_CLEAR; |
cf7c1ef6 | 9997 | } |
0af3d00b | 9998 | |
5f39d397 CM |
9999 | read_extent_buffer(leaf, &cache->item, |
10000 | btrfs_item_ptr_offset(leaf, path->slots[0]), | |
10001 | sizeof(cache->item)); | |
920e4a58 | 10002 | cache->flags = btrfs_block_group_flags(&cache->item); |
49303381 LB |
10003 | if (!mixed && |
10004 | ((cache->flags & BTRFS_BLOCK_GROUP_METADATA) && | |
10005 | (cache->flags & BTRFS_BLOCK_GROUP_DATA))) { | |
10006 | btrfs_err(info, | |
10007 | "bg %llu is a mixed block group but filesystem hasn't enabled mixed block groups", | |
10008 | cache->key.objectid); | |
10009 | ret = -EINVAL; | |
10010 | goto error; | |
10011 | } | |
0b86a832 | 10012 | |
9078a3e1 | 10013 | key.objectid = found_key.objectid + found_key.offset; |
b3b4aa74 | 10014 | btrfs_release_path(path); |
34d52cb6 | 10015 | |
3c14874a JB |
10016 | /* |
10017 | * We need to exclude the super stripes now so that the space | |
10018 | * info has super bytes accounted for, otherwise we'll think | |
10019 | * we have more space than we actually do. | |
10020 | */ | |
2ff7e61e | 10021 | ret = exclude_super_stripes(info, cache); |
835d974f JB |
10022 | if (ret) { |
10023 | /* | |
10024 | * We may have excluded something, so call this just in | |
10025 | * case. | |
10026 | */ | |
2ff7e61e | 10027 | free_excluded_extents(info, cache); |
920e4a58 | 10028 | btrfs_put_block_group(cache); |
835d974f JB |
10029 | goto error; |
10030 | } | |
3c14874a | 10031 | |
817d52f8 JB |
10032 | /* |
10033 | * check for two cases, either we are full, and therefore | |
10034 | * don't need to bother with the caching work since we won't | |
10035 | * find any space, or we are empty, and we can just add all | |
10036 | * the space in and be done with it. This saves us _alot_ of | |
10037 | * time, particularly in the full case. | |
10038 | */ | |
10039 | if (found_key.offset == btrfs_block_group_used(&cache->item)) { | |
11833d66 | 10040 | cache->last_byte_to_unpin = (u64)-1; |
817d52f8 | 10041 | cache->cached = BTRFS_CACHE_FINISHED; |
2ff7e61e | 10042 | free_excluded_extents(info, cache); |
817d52f8 | 10043 | } else if (btrfs_block_group_used(&cache->item) == 0) { |
11833d66 | 10044 | cache->last_byte_to_unpin = (u64)-1; |
817d52f8 | 10045 | cache->cached = BTRFS_CACHE_FINISHED; |
0b246afa | 10046 | add_new_free_space(cache, info, |
817d52f8 JB |
10047 | found_key.objectid, |
10048 | found_key.objectid + | |
10049 | found_key.offset); | |
2ff7e61e | 10050 | free_excluded_extents(info, cache); |
817d52f8 | 10051 | } |
96b5179d | 10052 | |
0b246afa | 10053 | ret = btrfs_add_block_group_cache(info, cache); |
8c579fe7 JB |
10054 | if (ret) { |
10055 | btrfs_remove_free_space_cache(cache); | |
10056 | btrfs_put_block_group(cache); | |
10057 | goto error; | |
10058 | } | |
10059 | ||
0b246afa | 10060 | trace_btrfs_add_block_group(info, cache, 0); |
6324fbf3 CM |
10061 | ret = update_space_info(info, cache->flags, found_key.offset, |
10062 | btrfs_block_group_used(&cache->item), | |
e40edf2d | 10063 | cache->bytes_super, &space_info); |
8c579fe7 JB |
10064 | if (ret) { |
10065 | btrfs_remove_free_space_cache(cache); | |
10066 | spin_lock(&info->block_group_cache_lock); | |
10067 | rb_erase(&cache->cache_node, | |
10068 | &info->block_group_cache_tree); | |
01eacb27 | 10069 | RB_CLEAR_NODE(&cache->cache_node); |
8c579fe7 JB |
10070 | spin_unlock(&info->block_group_cache_lock); |
10071 | btrfs_put_block_group(cache); | |
10072 | goto error; | |
10073 | } | |
10074 | ||
6324fbf3 | 10075 | cache->space_info = space_info; |
1b2da372 | 10076 | |
b742bb82 | 10077 | __link_block_group(space_info, cache); |
0f9dd46c | 10078 | |
0b246afa | 10079 | set_avail_alloc_bits(info, cache->flags); |
2ff7e61e | 10080 | if (btrfs_chunk_readonly(info, cache->key.objectid)) { |
868f401a | 10081 | inc_block_group_ro(cache, 1); |
47ab2a6c JB |
10082 | } else if (btrfs_block_group_used(&cache->item) == 0) { |
10083 | spin_lock(&info->unused_bgs_lock); | |
10084 | /* Should always be true but just in case. */ | |
10085 | if (list_empty(&cache->bg_list)) { | |
10086 | btrfs_get_block_group(cache); | |
10087 | list_add_tail(&cache->bg_list, | |
10088 | &info->unused_bgs); | |
10089 | } | |
10090 | spin_unlock(&info->unused_bgs_lock); | |
10091 | } | |
9078a3e1 | 10092 | } |
b742bb82 | 10093 | |
0b246afa | 10094 | list_for_each_entry_rcu(space_info, &info->space_info, list) { |
2ff7e61e | 10095 | if (!(get_alloc_profile(info, space_info->flags) & |
b742bb82 YZ |
10096 | (BTRFS_BLOCK_GROUP_RAID10 | |
10097 | BTRFS_BLOCK_GROUP_RAID1 | | |
53b381b3 DW |
10098 | BTRFS_BLOCK_GROUP_RAID5 | |
10099 | BTRFS_BLOCK_GROUP_RAID6 | | |
b742bb82 YZ |
10100 | BTRFS_BLOCK_GROUP_DUP))) |
10101 | continue; | |
10102 | /* | |
10103 | * avoid allocating from un-mirrored block group if there are | |
10104 | * mirrored block groups. | |
10105 | */ | |
1095cc0d | 10106 | list_for_each_entry(cache, |
10107 | &space_info->block_groups[BTRFS_RAID_RAID0], | |
10108 | list) | |
868f401a | 10109 | inc_block_group_ro(cache, 1); |
1095cc0d | 10110 | list_for_each_entry(cache, |
10111 | &space_info->block_groups[BTRFS_RAID_SINGLE], | |
10112 | list) | |
868f401a | 10113 | inc_block_group_ro(cache, 1); |
9078a3e1 | 10114 | } |
f0486c68 YZ |
10115 | |
10116 | init_global_block_rsv(info); | |
0b86a832 CM |
10117 | ret = 0; |
10118 | error: | |
9078a3e1 | 10119 | btrfs_free_path(path); |
0b86a832 | 10120 | return ret; |
9078a3e1 | 10121 | } |
6324fbf3 | 10122 | |
ea658bad | 10123 | void btrfs_create_pending_block_groups(struct btrfs_trans_handle *trans, |
2ff7e61e | 10124 | struct btrfs_fs_info *fs_info) |
ea658bad JB |
10125 | { |
10126 | struct btrfs_block_group_cache *block_group, *tmp; | |
0b246afa | 10127 | struct btrfs_root *extent_root = fs_info->extent_root; |
ea658bad JB |
10128 | struct btrfs_block_group_item item; |
10129 | struct btrfs_key key; | |
10130 | int ret = 0; | |
d9a0540a | 10131 | bool can_flush_pending_bgs = trans->can_flush_pending_bgs; |
ea658bad | 10132 | |
d9a0540a | 10133 | trans->can_flush_pending_bgs = false; |
47ab2a6c | 10134 | list_for_each_entry_safe(block_group, tmp, &trans->new_bgs, bg_list) { |
ea658bad | 10135 | if (ret) |
c92f6be3 | 10136 | goto next; |
ea658bad JB |
10137 | |
10138 | spin_lock(&block_group->lock); | |
10139 | memcpy(&item, &block_group->item, sizeof(item)); | |
10140 | memcpy(&key, &block_group->key, sizeof(key)); | |
10141 | spin_unlock(&block_group->lock); | |
10142 | ||
10143 | ret = btrfs_insert_item(trans, extent_root, &key, &item, | |
10144 | sizeof(item)); | |
10145 | if (ret) | |
66642832 | 10146 | btrfs_abort_transaction(trans, ret); |
0b246afa JM |
10147 | ret = btrfs_finish_chunk_alloc(trans, fs_info, key.objectid, |
10148 | key.offset); | |
6df9a95e | 10149 | if (ret) |
66642832 | 10150 | btrfs_abort_transaction(trans, ret); |
0b246afa | 10151 | add_block_group_free_space(trans, fs_info, block_group); |
1e144fb8 | 10152 | /* already aborted the transaction if it failed. */ |
c92f6be3 FM |
10153 | next: |
10154 | list_del_init(&block_group->bg_list); | |
ea658bad | 10155 | } |
d9a0540a | 10156 | trans->can_flush_pending_bgs = can_flush_pending_bgs; |
ea658bad JB |
10157 | } |
10158 | ||
6324fbf3 | 10159 | int btrfs_make_block_group(struct btrfs_trans_handle *trans, |
2ff7e61e | 10160 | struct btrfs_fs_info *fs_info, u64 bytes_used, |
e17cade2 | 10161 | u64 type, u64 chunk_objectid, u64 chunk_offset, |
6324fbf3 CM |
10162 | u64 size) |
10163 | { | |
6324fbf3 | 10164 | struct btrfs_block_group_cache *cache; |
0b246afa | 10165 | int ret; |
6324fbf3 | 10166 | |
0b246afa | 10167 | btrfs_set_log_full_commit(fs_info, trans); |
e02119d5 | 10168 | |
2ff7e61e | 10169 | cache = btrfs_create_block_group_cache(fs_info, chunk_offset, size); |
0f9dd46c JB |
10170 | if (!cache) |
10171 | return -ENOMEM; | |
34d52cb6 | 10172 | |
6324fbf3 | 10173 | btrfs_set_block_group_used(&cache->item, bytes_used); |
6324fbf3 | 10174 | btrfs_set_block_group_chunk_objectid(&cache->item, chunk_objectid); |
6324fbf3 CM |
10175 | btrfs_set_block_group_flags(&cache->item, type); |
10176 | ||
920e4a58 | 10177 | cache->flags = type; |
11833d66 | 10178 | cache->last_byte_to_unpin = (u64)-1; |
817d52f8 | 10179 | cache->cached = BTRFS_CACHE_FINISHED; |
1e144fb8 | 10180 | cache->needs_free_space = 1; |
2ff7e61e | 10181 | ret = exclude_super_stripes(fs_info, cache); |
835d974f JB |
10182 | if (ret) { |
10183 | /* | |
10184 | * We may have excluded something, so call this just in | |
10185 | * case. | |
10186 | */ | |
2ff7e61e | 10187 | free_excluded_extents(fs_info, cache); |
920e4a58 | 10188 | btrfs_put_block_group(cache); |
835d974f JB |
10189 | return ret; |
10190 | } | |
96303081 | 10191 | |
0b246afa | 10192 | add_new_free_space(cache, fs_info, chunk_offset, chunk_offset + size); |
817d52f8 | 10193 | |
2ff7e61e | 10194 | free_excluded_extents(fs_info, cache); |
11833d66 | 10195 | |
d0bd4560 | 10196 | #ifdef CONFIG_BTRFS_DEBUG |
2ff7e61e | 10197 | if (btrfs_should_fragment_free_space(cache)) { |
d0bd4560 JB |
10198 | u64 new_bytes_used = size - bytes_used; |
10199 | ||
10200 | bytes_used += new_bytes_used >> 1; | |
2ff7e61e | 10201 | fragment_free_space(cache); |
d0bd4560 JB |
10202 | } |
10203 | #endif | |
2e6e5183 FM |
10204 | /* |
10205 | * Call to ensure the corresponding space_info object is created and | |
10206 | * assigned to our block group, but don't update its counters just yet. | |
10207 | * We want our bg to be added to the rbtree with its ->space_info set. | |
10208 | */ | |
0b246afa | 10209 | ret = update_space_info(fs_info, cache->flags, 0, 0, 0, |
2e6e5183 FM |
10210 | &cache->space_info); |
10211 | if (ret) { | |
10212 | btrfs_remove_free_space_cache(cache); | |
10213 | btrfs_put_block_group(cache); | |
10214 | return ret; | |
10215 | } | |
10216 | ||
0b246afa | 10217 | ret = btrfs_add_block_group_cache(fs_info, cache); |
8c579fe7 JB |
10218 | if (ret) { |
10219 | btrfs_remove_free_space_cache(cache); | |
10220 | btrfs_put_block_group(cache); | |
10221 | return ret; | |
10222 | } | |
10223 | ||
2e6e5183 FM |
10224 | /* |
10225 | * Now that our block group has its ->space_info set and is inserted in | |
10226 | * the rbtree, update the space info's counters. | |
10227 | */ | |
0b246afa JM |
10228 | trace_btrfs_add_block_group(fs_info, cache, 1); |
10229 | ret = update_space_info(fs_info, cache->flags, size, bytes_used, | |
e40edf2d | 10230 | cache->bytes_super, &cache->space_info); |
8c579fe7 JB |
10231 | if (ret) { |
10232 | btrfs_remove_free_space_cache(cache); | |
0b246afa | 10233 | spin_lock(&fs_info->block_group_cache_lock); |
8c579fe7 | 10234 | rb_erase(&cache->cache_node, |
0b246afa | 10235 | &fs_info->block_group_cache_tree); |
01eacb27 | 10236 | RB_CLEAR_NODE(&cache->cache_node); |
0b246afa | 10237 | spin_unlock(&fs_info->block_group_cache_lock); |
8c579fe7 JB |
10238 | btrfs_put_block_group(cache); |
10239 | return ret; | |
10240 | } | |
0b246afa | 10241 | update_global_block_rsv(fs_info); |
1b2da372 | 10242 | |
b742bb82 | 10243 | __link_block_group(cache->space_info, cache); |
6324fbf3 | 10244 | |
47ab2a6c | 10245 | list_add_tail(&cache->bg_list, &trans->new_bgs); |
6324fbf3 | 10246 | |
0b246afa | 10247 | set_avail_alloc_bits(fs_info, type); |
6324fbf3 CM |
10248 | return 0; |
10249 | } | |
1a40e23b | 10250 | |
10ea00f5 ID |
10251 | static void clear_avail_alloc_bits(struct btrfs_fs_info *fs_info, u64 flags) |
10252 | { | |
899c81ea ID |
10253 | u64 extra_flags = chunk_to_extended(flags) & |
10254 | BTRFS_EXTENDED_PROFILE_MASK; | |
10ea00f5 | 10255 | |
de98ced9 | 10256 | write_seqlock(&fs_info->profiles_lock); |
10ea00f5 ID |
10257 | if (flags & BTRFS_BLOCK_GROUP_DATA) |
10258 | fs_info->avail_data_alloc_bits &= ~extra_flags; | |
10259 | if (flags & BTRFS_BLOCK_GROUP_METADATA) | |
10260 | fs_info->avail_metadata_alloc_bits &= ~extra_flags; | |
10261 | if (flags & BTRFS_BLOCK_GROUP_SYSTEM) | |
10262 | fs_info->avail_system_alloc_bits &= ~extra_flags; | |
de98ced9 | 10263 | write_sequnlock(&fs_info->profiles_lock); |
10ea00f5 ID |
10264 | } |
10265 | ||
1a40e23b | 10266 | int btrfs_remove_block_group(struct btrfs_trans_handle *trans, |
6bccf3ab | 10267 | struct btrfs_fs_info *fs_info, u64 group_start, |
04216820 | 10268 | struct extent_map *em) |
1a40e23b | 10269 | { |
6bccf3ab | 10270 | struct btrfs_root *root = fs_info->extent_root; |
1a40e23b ZY |
10271 | struct btrfs_path *path; |
10272 | struct btrfs_block_group_cache *block_group; | |
44fb5511 | 10273 | struct btrfs_free_cluster *cluster; |
0b246afa | 10274 | struct btrfs_root *tree_root = fs_info->tree_root; |
1a40e23b | 10275 | struct btrfs_key key; |
0af3d00b | 10276 | struct inode *inode; |
c1895442 | 10277 | struct kobject *kobj = NULL; |
1a40e23b | 10278 | int ret; |
10ea00f5 | 10279 | int index; |
89a55897 | 10280 | int factor; |
4f69cb98 | 10281 | struct btrfs_caching_control *caching_ctl = NULL; |
04216820 | 10282 | bool remove_em; |
1a40e23b | 10283 | |
6bccf3ab | 10284 | block_group = btrfs_lookup_block_group(fs_info, group_start); |
1a40e23b | 10285 | BUG_ON(!block_group); |
c146afad | 10286 | BUG_ON(!block_group->ro); |
1a40e23b | 10287 | |
9f7c43c9 | 10288 | /* |
10289 | * Free the reserved super bytes from this block group before | |
10290 | * remove it. | |
10291 | */ | |
2ff7e61e | 10292 | free_excluded_extents(fs_info, block_group); |
9f7c43c9 | 10293 | |
1a40e23b | 10294 | memcpy(&key, &block_group->key, sizeof(key)); |
10ea00f5 | 10295 | index = get_block_group_index(block_group); |
89a55897 JB |
10296 | if (block_group->flags & (BTRFS_BLOCK_GROUP_DUP | |
10297 | BTRFS_BLOCK_GROUP_RAID1 | | |
10298 | BTRFS_BLOCK_GROUP_RAID10)) | |
10299 | factor = 2; | |
10300 | else | |
10301 | factor = 1; | |
1a40e23b | 10302 | |
44fb5511 | 10303 | /* make sure this block group isn't part of an allocation cluster */ |
0b246afa | 10304 | cluster = &fs_info->data_alloc_cluster; |
44fb5511 CM |
10305 | spin_lock(&cluster->refill_lock); |
10306 | btrfs_return_cluster_to_free_space(block_group, cluster); | |
10307 | spin_unlock(&cluster->refill_lock); | |
10308 | ||
10309 | /* | |
10310 | * make sure this block group isn't part of a metadata | |
10311 | * allocation cluster | |
10312 | */ | |
0b246afa | 10313 | cluster = &fs_info->meta_alloc_cluster; |
44fb5511 CM |
10314 | spin_lock(&cluster->refill_lock); |
10315 | btrfs_return_cluster_to_free_space(block_group, cluster); | |
10316 | spin_unlock(&cluster->refill_lock); | |
10317 | ||
1a40e23b | 10318 | path = btrfs_alloc_path(); |
d8926bb3 MF |
10319 | if (!path) { |
10320 | ret = -ENOMEM; | |
10321 | goto out; | |
10322 | } | |
1a40e23b | 10323 | |
1bbc621e CM |
10324 | /* |
10325 | * get the inode first so any iput calls done for the io_list | |
10326 | * aren't the final iput (no unlinks allowed now) | |
10327 | */ | |
77ab86bf | 10328 | inode = lookup_free_space_inode(fs_info, block_group, path); |
1bbc621e CM |
10329 | |
10330 | mutex_lock(&trans->transaction->cache_write_mutex); | |
10331 | /* | |
10332 | * make sure our free spache cache IO is done before remove the | |
10333 | * free space inode | |
10334 | */ | |
10335 | spin_lock(&trans->transaction->dirty_bgs_lock); | |
10336 | if (!list_empty(&block_group->io_list)) { | |
10337 | list_del_init(&block_group->io_list); | |
10338 | ||
10339 | WARN_ON(!IS_ERR(inode) && inode != block_group->io_ctl.inode); | |
10340 | ||
10341 | spin_unlock(&trans->transaction->dirty_bgs_lock); | |
afdb5718 | 10342 | btrfs_wait_cache_io(trans, block_group, path); |
1bbc621e CM |
10343 | btrfs_put_block_group(block_group); |
10344 | spin_lock(&trans->transaction->dirty_bgs_lock); | |
10345 | } | |
10346 | ||
10347 | if (!list_empty(&block_group->dirty_list)) { | |
10348 | list_del_init(&block_group->dirty_list); | |
10349 | btrfs_put_block_group(block_group); | |
10350 | } | |
10351 | spin_unlock(&trans->transaction->dirty_bgs_lock); | |
10352 | mutex_unlock(&trans->transaction->cache_write_mutex); | |
10353 | ||
0af3d00b | 10354 | if (!IS_ERR(inode)) { |
73f2e545 | 10355 | ret = btrfs_orphan_add(trans, BTRFS_I(inode)); |
79787eaa JM |
10356 | if (ret) { |
10357 | btrfs_add_delayed_iput(inode); | |
10358 | goto out; | |
10359 | } | |
0af3d00b JB |
10360 | clear_nlink(inode); |
10361 | /* One for the block groups ref */ | |
10362 | spin_lock(&block_group->lock); | |
10363 | if (block_group->iref) { | |
10364 | block_group->iref = 0; | |
10365 | block_group->inode = NULL; | |
10366 | spin_unlock(&block_group->lock); | |
10367 | iput(inode); | |
10368 | } else { | |
10369 | spin_unlock(&block_group->lock); | |
10370 | } | |
10371 | /* One for our lookup ref */ | |
455757c3 | 10372 | btrfs_add_delayed_iput(inode); |
0af3d00b JB |
10373 | } |
10374 | ||
10375 | key.objectid = BTRFS_FREE_SPACE_OBJECTID; | |
10376 | key.offset = block_group->key.objectid; | |
10377 | key.type = 0; | |
10378 | ||
10379 | ret = btrfs_search_slot(trans, tree_root, &key, path, -1, 1); | |
10380 | if (ret < 0) | |
10381 | goto out; | |
10382 | if (ret > 0) | |
b3b4aa74 | 10383 | btrfs_release_path(path); |
0af3d00b JB |
10384 | if (ret == 0) { |
10385 | ret = btrfs_del_item(trans, tree_root, path); | |
10386 | if (ret) | |
10387 | goto out; | |
b3b4aa74 | 10388 | btrfs_release_path(path); |
0af3d00b JB |
10389 | } |
10390 | ||
0b246afa | 10391 | spin_lock(&fs_info->block_group_cache_lock); |
1a40e23b | 10392 | rb_erase(&block_group->cache_node, |
0b246afa | 10393 | &fs_info->block_group_cache_tree); |
292cbd51 | 10394 | RB_CLEAR_NODE(&block_group->cache_node); |
a1897fdd | 10395 | |
0b246afa JM |
10396 | if (fs_info->first_logical_byte == block_group->key.objectid) |
10397 | fs_info->first_logical_byte = (u64)-1; | |
10398 | spin_unlock(&fs_info->block_group_cache_lock); | |
817d52f8 | 10399 | |
80eb234a | 10400 | down_write(&block_group->space_info->groups_sem); |
44fb5511 CM |
10401 | /* |
10402 | * we must use list_del_init so people can check to see if they | |
10403 | * are still on the list after taking the semaphore | |
10404 | */ | |
10405 | list_del_init(&block_group->list); | |
6ab0a202 | 10406 | if (list_empty(&block_group->space_info->block_groups[index])) { |
c1895442 JM |
10407 | kobj = block_group->space_info->block_group_kobjs[index]; |
10408 | block_group->space_info->block_group_kobjs[index] = NULL; | |
0b246afa | 10409 | clear_avail_alloc_bits(fs_info, block_group->flags); |
6ab0a202 | 10410 | } |
80eb234a | 10411 | up_write(&block_group->space_info->groups_sem); |
c1895442 JM |
10412 | if (kobj) { |
10413 | kobject_del(kobj); | |
10414 | kobject_put(kobj); | |
10415 | } | |
1a40e23b | 10416 | |
4f69cb98 FM |
10417 | if (block_group->has_caching_ctl) |
10418 | caching_ctl = get_caching_control(block_group); | |
817d52f8 | 10419 | if (block_group->cached == BTRFS_CACHE_STARTED) |
11833d66 | 10420 | wait_block_group_cache_done(block_group); |
4f69cb98 | 10421 | if (block_group->has_caching_ctl) { |
0b246afa | 10422 | down_write(&fs_info->commit_root_sem); |
4f69cb98 FM |
10423 | if (!caching_ctl) { |
10424 | struct btrfs_caching_control *ctl; | |
10425 | ||
10426 | list_for_each_entry(ctl, | |
0b246afa | 10427 | &fs_info->caching_block_groups, list) |
4f69cb98 FM |
10428 | if (ctl->block_group == block_group) { |
10429 | caching_ctl = ctl; | |
1e4f4714 | 10430 | refcount_inc(&caching_ctl->count); |
4f69cb98 FM |
10431 | break; |
10432 | } | |
10433 | } | |
10434 | if (caching_ctl) | |
10435 | list_del_init(&caching_ctl->list); | |
0b246afa | 10436 | up_write(&fs_info->commit_root_sem); |
4f69cb98 FM |
10437 | if (caching_ctl) { |
10438 | /* Once for the caching bgs list and once for us. */ | |
10439 | put_caching_control(caching_ctl); | |
10440 | put_caching_control(caching_ctl); | |
10441 | } | |
10442 | } | |
817d52f8 | 10443 | |
ce93ec54 JB |
10444 | spin_lock(&trans->transaction->dirty_bgs_lock); |
10445 | if (!list_empty(&block_group->dirty_list)) { | |
1bbc621e CM |
10446 | WARN_ON(1); |
10447 | } | |
10448 | if (!list_empty(&block_group->io_list)) { | |
10449 | WARN_ON(1); | |
ce93ec54 JB |
10450 | } |
10451 | spin_unlock(&trans->transaction->dirty_bgs_lock); | |
817d52f8 JB |
10452 | btrfs_remove_free_space_cache(block_group); |
10453 | ||
c146afad | 10454 | spin_lock(&block_group->space_info->lock); |
75c68e9f | 10455 | list_del_init(&block_group->ro_list); |
18d018ad | 10456 | |
0b246afa | 10457 | if (btrfs_test_opt(fs_info, ENOSPC_DEBUG)) { |
18d018ad ZL |
10458 | WARN_ON(block_group->space_info->total_bytes |
10459 | < block_group->key.offset); | |
10460 | WARN_ON(block_group->space_info->bytes_readonly | |
10461 | < block_group->key.offset); | |
10462 | WARN_ON(block_group->space_info->disk_total | |
10463 | < block_group->key.offset * factor); | |
10464 | } | |
c146afad YZ |
10465 | block_group->space_info->total_bytes -= block_group->key.offset; |
10466 | block_group->space_info->bytes_readonly -= block_group->key.offset; | |
89a55897 | 10467 | block_group->space_info->disk_total -= block_group->key.offset * factor; |
18d018ad | 10468 | |
c146afad | 10469 | spin_unlock(&block_group->space_info->lock); |
283bb197 | 10470 | |
0af3d00b JB |
10471 | memcpy(&key, &block_group->key, sizeof(key)); |
10472 | ||
34441361 | 10473 | mutex_lock(&fs_info->chunk_mutex); |
495e64f4 FM |
10474 | if (!list_empty(&em->list)) { |
10475 | /* We're in the transaction->pending_chunks list. */ | |
10476 | free_extent_map(em); | |
10477 | } | |
04216820 FM |
10478 | spin_lock(&block_group->lock); |
10479 | block_group->removed = 1; | |
10480 | /* | |
10481 | * At this point trimming can't start on this block group, because we | |
10482 | * removed the block group from the tree fs_info->block_group_cache_tree | |
10483 | * so no one can't find it anymore and even if someone already got this | |
10484 | * block group before we removed it from the rbtree, they have already | |
10485 | * incremented block_group->trimming - if they didn't, they won't find | |
10486 | * any free space entries because we already removed them all when we | |
10487 | * called btrfs_remove_free_space_cache(). | |
10488 | * | |
10489 | * And we must not remove the extent map from the fs_info->mapping_tree | |
10490 | * to prevent the same logical address range and physical device space | |
10491 | * ranges from being reused for a new block group. This is because our | |
10492 | * fs trim operation (btrfs_trim_fs() / btrfs_ioctl_fitrim()) is | |
10493 | * completely transactionless, so while it is trimming a range the | |
10494 | * currently running transaction might finish and a new one start, | |
10495 | * allowing for new block groups to be created that can reuse the same | |
10496 | * physical device locations unless we take this special care. | |
e33e17ee JM |
10497 | * |
10498 | * There may also be an implicit trim operation if the file system | |
10499 | * is mounted with -odiscard. The same protections must remain | |
10500 | * in place until the extents have been discarded completely when | |
10501 | * the transaction commit has completed. | |
04216820 FM |
10502 | */ |
10503 | remove_em = (atomic_read(&block_group->trimming) == 0); | |
10504 | /* | |
10505 | * Make sure a trimmer task always sees the em in the pinned_chunks list | |
10506 | * if it sees block_group->removed == 1 (needs to lock block_group->lock | |
10507 | * before checking block_group->removed). | |
10508 | */ | |
10509 | if (!remove_em) { | |
10510 | /* | |
10511 | * Our em might be in trans->transaction->pending_chunks which | |
10512 | * is protected by fs_info->chunk_mutex ([lock|unlock]_chunks), | |
10513 | * and so is the fs_info->pinned_chunks list. | |
10514 | * | |
10515 | * So at this point we must be holding the chunk_mutex to avoid | |
10516 | * any races with chunk allocation (more specifically at | |
10517 | * volumes.c:contains_pending_extent()), to ensure it always | |
10518 | * sees the em, either in the pending_chunks list or in the | |
10519 | * pinned_chunks list. | |
10520 | */ | |
0b246afa | 10521 | list_move_tail(&em->list, &fs_info->pinned_chunks); |
04216820 FM |
10522 | } |
10523 | spin_unlock(&block_group->lock); | |
04216820 FM |
10524 | |
10525 | if (remove_em) { | |
10526 | struct extent_map_tree *em_tree; | |
10527 | ||
0b246afa | 10528 | em_tree = &fs_info->mapping_tree.map_tree; |
04216820 | 10529 | write_lock(&em_tree->lock); |
8dbcd10f FM |
10530 | /* |
10531 | * The em might be in the pending_chunks list, so make sure the | |
10532 | * chunk mutex is locked, since remove_extent_mapping() will | |
10533 | * delete us from that list. | |
10534 | */ | |
04216820 FM |
10535 | remove_extent_mapping(em_tree, em); |
10536 | write_unlock(&em_tree->lock); | |
10537 | /* once for the tree */ | |
10538 | free_extent_map(em); | |
10539 | } | |
10540 | ||
34441361 | 10541 | mutex_unlock(&fs_info->chunk_mutex); |
8dbcd10f | 10542 | |
0b246afa | 10543 | ret = remove_block_group_free_space(trans, fs_info, block_group); |
1e144fb8 OS |
10544 | if (ret) |
10545 | goto out; | |
10546 | ||
fa9c0d79 CM |
10547 | btrfs_put_block_group(block_group); |
10548 | btrfs_put_block_group(block_group); | |
1a40e23b ZY |
10549 | |
10550 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); | |
10551 | if (ret > 0) | |
10552 | ret = -EIO; | |
10553 | if (ret < 0) | |
10554 | goto out; | |
10555 | ||
10556 | ret = btrfs_del_item(trans, root, path); | |
10557 | out: | |
10558 | btrfs_free_path(path); | |
10559 | return ret; | |
10560 | } | |
acce952b | 10561 | |
8eab77ff | 10562 | struct btrfs_trans_handle * |
7fd01182 FM |
10563 | btrfs_start_trans_remove_block_group(struct btrfs_fs_info *fs_info, |
10564 | const u64 chunk_offset) | |
8eab77ff | 10565 | { |
7fd01182 FM |
10566 | struct extent_map_tree *em_tree = &fs_info->mapping_tree.map_tree; |
10567 | struct extent_map *em; | |
10568 | struct map_lookup *map; | |
10569 | unsigned int num_items; | |
10570 | ||
10571 | read_lock(&em_tree->lock); | |
10572 | em = lookup_extent_mapping(em_tree, chunk_offset, 1); | |
10573 | read_unlock(&em_tree->lock); | |
10574 | ASSERT(em && em->start == chunk_offset); | |
10575 | ||
8eab77ff | 10576 | /* |
7fd01182 FM |
10577 | * We need to reserve 3 + N units from the metadata space info in order |
10578 | * to remove a block group (done at btrfs_remove_chunk() and at | |
10579 | * btrfs_remove_block_group()), which are used for: | |
10580 | * | |
8eab77ff FM |
10581 | * 1 unit for adding the free space inode's orphan (located in the tree |
10582 | * of tree roots). | |
7fd01182 FM |
10583 | * 1 unit for deleting the block group item (located in the extent |
10584 | * tree). | |
10585 | * 1 unit for deleting the free space item (located in tree of tree | |
10586 | * roots). | |
10587 | * N units for deleting N device extent items corresponding to each | |
10588 | * stripe (located in the device tree). | |
10589 | * | |
10590 | * In order to remove a block group we also need to reserve units in the | |
10591 | * system space info in order to update the chunk tree (update one or | |
10592 | * more device items and remove one chunk item), but this is done at | |
10593 | * btrfs_remove_chunk() through a call to check_system_chunk(). | |
8eab77ff | 10594 | */ |
95617d69 | 10595 | map = em->map_lookup; |
7fd01182 FM |
10596 | num_items = 3 + map->num_stripes; |
10597 | free_extent_map(em); | |
10598 | ||
8eab77ff | 10599 | return btrfs_start_transaction_fallback_global_rsv(fs_info->extent_root, |
7fd01182 | 10600 | num_items, 1); |
8eab77ff FM |
10601 | } |
10602 | ||
47ab2a6c JB |
10603 | /* |
10604 | * Process the unused_bgs list and remove any that don't have any allocated | |
10605 | * space inside of them. | |
10606 | */ | |
10607 | void btrfs_delete_unused_bgs(struct btrfs_fs_info *fs_info) | |
10608 | { | |
10609 | struct btrfs_block_group_cache *block_group; | |
10610 | struct btrfs_space_info *space_info; | |
47ab2a6c JB |
10611 | struct btrfs_trans_handle *trans; |
10612 | int ret = 0; | |
10613 | ||
afcdd129 | 10614 | if (!test_bit(BTRFS_FS_OPEN, &fs_info->flags)) |
47ab2a6c JB |
10615 | return; |
10616 | ||
10617 | spin_lock(&fs_info->unused_bgs_lock); | |
10618 | while (!list_empty(&fs_info->unused_bgs)) { | |
10619 | u64 start, end; | |
e33e17ee | 10620 | int trimming; |
47ab2a6c JB |
10621 | |
10622 | block_group = list_first_entry(&fs_info->unused_bgs, | |
10623 | struct btrfs_block_group_cache, | |
10624 | bg_list); | |
47ab2a6c | 10625 | list_del_init(&block_group->bg_list); |
aefbe9a6 ZL |
10626 | |
10627 | space_info = block_group->space_info; | |
10628 | ||
47ab2a6c JB |
10629 | if (ret || btrfs_mixed_space_info(space_info)) { |
10630 | btrfs_put_block_group(block_group); | |
10631 | continue; | |
10632 | } | |
10633 | spin_unlock(&fs_info->unused_bgs_lock); | |
10634 | ||
d5f2e33b | 10635 | mutex_lock(&fs_info->delete_unused_bgs_mutex); |
67c5e7d4 | 10636 | |
47ab2a6c JB |
10637 | /* Don't want to race with allocators so take the groups_sem */ |
10638 | down_write(&space_info->groups_sem); | |
10639 | spin_lock(&block_group->lock); | |
10640 | if (block_group->reserved || | |
10641 | btrfs_block_group_used(&block_group->item) || | |
19c4d2f9 | 10642 | block_group->ro || |
aefbe9a6 | 10643 | list_is_singular(&block_group->list)) { |
47ab2a6c JB |
10644 | /* |
10645 | * We want to bail if we made new allocations or have | |
10646 | * outstanding allocations in this block group. We do | |
10647 | * the ro check in case balance is currently acting on | |
10648 | * this block group. | |
10649 | */ | |
10650 | spin_unlock(&block_group->lock); | |
10651 | up_write(&space_info->groups_sem); | |
10652 | goto next; | |
10653 | } | |
10654 | spin_unlock(&block_group->lock); | |
10655 | ||
10656 | /* We don't want to force the issue, only flip if it's ok. */ | |
868f401a | 10657 | ret = inc_block_group_ro(block_group, 0); |
47ab2a6c JB |
10658 | up_write(&space_info->groups_sem); |
10659 | if (ret < 0) { | |
10660 | ret = 0; | |
10661 | goto next; | |
10662 | } | |
10663 | ||
10664 | /* | |
10665 | * Want to do this before we do anything else so we can recover | |
10666 | * properly if we fail to join the transaction. | |
10667 | */ | |
7fd01182 FM |
10668 | trans = btrfs_start_trans_remove_block_group(fs_info, |
10669 | block_group->key.objectid); | |
47ab2a6c | 10670 | if (IS_ERR(trans)) { |
2ff7e61e | 10671 | btrfs_dec_block_group_ro(block_group); |
47ab2a6c JB |
10672 | ret = PTR_ERR(trans); |
10673 | goto next; | |
10674 | } | |
10675 | ||
10676 | /* | |
10677 | * We could have pending pinned extents for this block group, | |
10678 | * just delete them, we don't care about them anymore. | |
10679 | */ | |
10680 | start = block_group->key.objectid; | |
10681 | end = start + block_group->key.offset - 1; | |
d4b450cd FM |
10682 | /* |
10683 | * Hold the unused_bg_unpin_mutex lock to avoid racing with | |
10684 | * btrfs_finish_extent_commit(). If we are at transaction N, | |
10685 | * another task might be running finish_extent_commit() for the | |
10686 | * previous transaction N - 1, and have seen a range belonging | |
10687 | * to the block group in freed_extents[] before we were able to | |
10688 | * clear the whole block group range from freed_extents[]. This | |
10689 | * means that task can lookup for the block group after we | |
10690 | * unpinned it from freed_extents[] and removed it, leading to | |
10691 | * a BUG_ON() at btrfs_unpin_extent_range(). | |
10692 | */ | |
10693 | mutex_lock(&fs_info->unused_bg_unpin_mutex); | |
758eb51e | 10694 | ret = clear_extent_bits(&fs_info->freed_extents[0], start, end, |
91166212 | 10695 | EXTENT_DIRTY); |
758eb51e | 10696 | if (ret) { |
d4b450cd | 10697 | mutex_unlock(&fs_info->unused_bg_unpin_mutex); |
2ff7e61e | 10698 | btrfs_dec_block_group_ro(block_group); |
758eb51e FM |
10699 | goto end_trans; |
10700 | } | |
10701 | ret = clear_extent_bits(&fs_info->freed_extents[1], start, end, | |
91166212 | 10702 | EXTENT_DIRTY); |
758eb51e | 10703 | if (ret) { |
d4b450cd | 10704 | mutex_unlock(&fs_info->unused_bg_unpin_mutex); |
2ff7e61e | 10705 | btrfs_dec_block_group_ro(block_group); |
758eb51e FM |
10706 | goto end_trans; |
10707 | } | |
d4b450cd | 10708 | mutex_unlock(&fs_info->unused_bg_unpin_mutex); |
47ab2a6c JB |
10709 | |
10710 | /* Reset pinned so btrfs_put_block_group doesn't complain */ | |
c30666d4 ZL |
10711 | spin_lock(&space_info->lock); |
10712 | spin_lock(&block_group->lock); | |
10713 | ||
10714 | space_info->bytes_pinned -= block_group->pinned; | |
10715 | space_info->bytes_readonly += block_group->pinned; | |
10716 | percpu_counter_add(&space_info->total_bytes_pinned, | |
10717 | -block_group->pinned); | |
47ab2a6c JB |
10718 | block_group->pinned = 0; |
10719 | ||
c30666d4 ZL |
10720 | spin_unlock(&block_group->lock); |
10721 | spin_unlock(&space_info->lock); | |
10722 | ||
e33e17ee | 10723 | /* DISCARD can flip during remount */ |
0b246afa | 10724 | trimming = btrfs_test_opt(fs_info, DISCARD); |
e33e17ee JM |
10725 | |
10726 | /* Implicit trim during transaction commit. */ | |
10727 | if (trimming) | |
10728 | btrfs_get_block_group_trimming(block_group); | |
10729 | ||
47ab2a6c JB |
10730 | /* |
10731 | * Btrfs_remove_chunk will abort the transaction if things go | |
10732 | * horribly wrong. | |
10733 | */ | |
5b4aacef | 10734 | ret = btrfs_remove_chunk(trans, fs_info, |
47ab2a6c | 10735 | block_group->key.objectid); |
e33e17ee JM |
10736 | |
10737 | if (ret) { | |
10738 | if (trimming) | |
10739 | btrfs_put_block_group_trimming(block_group); | |
10740 | goto end_trans; | |
10741 | } | |
10742 | ||
10743 | /* | |
10744 | * If we're not mounted with -odiscard, we can just forget | |
10745 | * about this block group. Otherwise we'll need to wait | |
10746 | * until transaction commit to do the actual discard. | |
10747 | */ | |
10748 | if (trimming) { | |
348a0013 FM |
10749 | spin_lock(&fs_info->unused_bgs_lock); |
10750 | /* | |
10751 | * A concurrent scrub might have added us to the list | |
10752 | * fs_info->unused_bgs, so use a list_move operation | |
10753 | * to add the block group to the deleted_bgs list. | |
10754 | */ | |
e33e17ee JM |
10755 | list_move(&block_group->bg_list, |
10756 | &trans->transaction->deleted_bgs); | |
348a0013 | 10757 | spin_unlock(&fs_info->unused_bgs_lock); |
e33e17ee JM |
10758 | btrfs_get_block_group(block_group); |
10759 | } | |
758eb51e | 10760 | end_trans: |
3a45bb20 | 10761 | btrfs_end_transaction(trans); |
47ab2a6c | 10762 | next: |
d5f2e33b | 10763 | mutex_unlock(&fs_info->delete_unused_bgs_mutex); |
47ab2a6c JB |
10764 | btrfs_put_block_group(block_group); |
10765 | spin_lock(&fs_info->unused_bgs_lock); | |
10766 | } | |
10767 | spin_unlock(&fs_info->unused_bgs_lock); | |
10768 | } | |
10769 | ||
c59021f8 | 10770 | int btrfs_init_space_info(struct btrfs_fs_info *fs_info) |
10771 | { | |
10772 | struct btrfs_space_info *space_info; | |
1aba86d6 | 10773 | struct btrfs_super_block *disk_super; |
10774 | u64 features; | |
10775 | u64 flags; | |
10776 | int mixed = 0; | |
c59021f8 | 10777 | int ret; |
10778 | ||
6c41761f | 10779 | disk_super = fs_info->super_copy; |
1aba86d6 | 10780 | if (!btrfs_super_root(disk_super)) |
0dc924c5 | 10781 | return -EINVAL; |
c59021f8 | 10782 | |
1aba86d6 | 10783 | features = btrfs_super_incompat_flags(disk_super); |
10784 | if (features & BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS) | |
10785 | mixed = 1; | |
c59021f8 | 10786 | |
1aba86d6 | 10787 | flags = BTRFS_BLOCK_GROUP_SYSTEM; |
e40edf2d | 10788 | ret = update_space_info(fs_info, flags, 0, 0, 0, &space_info); |
c59021f8 | 10789 | if (ret) |
1aba86d6 | 10790 | goto out; |
c59021f8 | 10791 | |
1aba86d6 | 10792 | if (mixed) { |
10793 | flags = BTRFS_BLOCK_GROUP_METADATA | BTRFS_BLOCK_GROUP_DATA; | |
e40edf2d | 10794 | ret = update_space_info(fs_info, flags, 0, 0, 0, &space_info); |
1aba86d6 | 10795 | } else { |
10796 | flags = BTRFS_BLOCK_GROUP_METADATA; | |
e40edf2d | 10797 | ret = update_space_info(fs_info, flags, 0, 0, 0, &space_info); |
1aba86d6 | 10798 | if (ret) |
10799 | goto out; | |
10800 | ||
10801 | flags = BTRFS_BLOCK_GROUP_DATA; | |
e40edf2d | 10802 | ret = update_space_info(fs_info, flags, 0, 0, 0, &space_info); |
1aba86d6 | 10803 | } |
10804 | out: | |
c59021f8 | 10805 | return ret; |
10806 | } | |
10807 | ||
2ff7e61e JM |
10808 | int btrfs_error_unpin_extent_range(struct btrfs_fs_info *fs_info, |
10809 | u64 start, u64 end) | |
acce952b | 10810 | { |
2ff7e61e | 10811 | return unpin_extent_range(fs_info, start, end, false); |
acce952b | 10812 | } |
10813 | ||
499f377f JM |
10814 | /* |
10815 | * It used to be that old block groups would be left around forever. | |
10816 | * Iterating over them would be enough to trim unused space. Since we | |
10817 | * now automatically remove them, we also need to iterate over unallocated | |
10818 | * space. | |
10819 | * | |
10820 | * We don't want a transaction for this since the discard may take a | |
10821 | * substantial amount of time. We don't require that a transaction be | |
10822 | * running, but we do need to take a running transaction into account | |
10823 | * to ensure that we're not discarding chunks that were released in | |
10824 | * the current transaction. | |
10825 | * | |
10826 | * Holding the chunks lock will prevent other threads from allocating | |
10827 | * or releasing chunks, but it won't prevent a running transaction | |
10828 | * from committing and releasing the memory that the pending chunks | |
10829 | * list head uses. For that, we need to take a reference to the | |
10830 | * transaction. | |
10831 | */ | |
10832 | static int btrfs_trim_free_extents(struct btrfs_device *device, | |
10833 | u64 minlen, u64 *trimmed) | |
10834 | { | |
10835 | u64 start = 0, len = 0; | |
10836 | int ret; | |
10837 | ||
10838 | *trimmed = 0; | |
10839 | ||
10840 | /* Not writeable = nothing to do. */ | |
10841 | if (!device->writeable) | |
10842 | return 0; | |
10843 | ||
10844 | /* No free space = nothing to do. */ | |
10845 | if (device->total_bytes <= device->bytes_used) | |
10846 | return 0; | |
10847 | ||
10848 | ret = 0; | |
10849 | ||
10850 | while (1) { | |
fb456252 | 10851 | struct btrfs_fs_info *fs_info = device->fs_info; |
499f377f JM |
10852 | struct btrfs_transaction *trans; |
10853 | u64 bytes; | |
10854 | ||
10855 | ret = mutex_lock_interruptible(&fs_info->chunk_mutex); | |
10856 | if (ret) | |
10857 | return ret; | |
10858 | ||
10859 | down_read(&fs_info->commit_root_sem); | |
10860 | ||
10861 | spin_lock(&fs_info->trans_lock); | |
10862 | trans = fs_info->running_transaction; | |
10863 | if (trans) | |
9b64f57d | 10864 | refcount_inc(&trans->use_count); |
499f377f JM |
10865 | spin_unlock(&fs_info->trans_lock); |
10866 | ||
10867 | ret = find_free_dev_extent_start(trans, device, minlen, start, | |
10868 | &start, &len); | |
10869 | if (trans) | |
10870 | btrfs_put_transaction(trans); | |
10871 | ||
10872 | if (ret) { | |
10873 | up_read(&fs_info->commit_root_sem); | |
10874 | mutex_unlock(&fs_info->chunk_mutex); | |
10875 | if (ret == -ENOSPC) | |
10876 | ret = 0; | |
10877 | break; | |
10878 | } | |
10879 | ||
10880 | ret = btrfs_issue_discard(device->bdev, start, len, &bytes); | |
10881 | up_read(&fs_info->commit_root_sem); | |
10882 | mutex_unlock(&fs_info->chunk_mutex); | |
10883 | ||
10884 | if (ret) | |
10885 | break; | |
10886 | ||
10887 | start += len; | |
10888 | *trimmed += bytes; | |
10889 | ||
10890 | if (fatal_signal_pending(current)) { | |
10891 | ret = -ERESTARTSYS; | |
10892 | break; | |
10893 | } | |
10894 | ||
10895 | cond_resched(); | |
10896 | } | |
10897 | ||
10898 | return ret; | |
10899 | } | |
10900 | ||
2ff7e61e | 10901 | int btrfs_trim_fs(struct btrfs_fs_info *fs_info, struct fstrim_range *range) |
f7039b1d | 10902 | { |
f7039b1d | 10903 | struct btrfs_block_group_cache *cache = NULL; |
499f377f JM |
10904 | struct btrfs_device *device; |
10905 | struct list_head *devices; | |
f7039b1d LD |
10906 | u64 group_trimmed; |
10907 | u64 start; | |
10908 | u64 end; | |
10909 | u64 trimmed = 0; | |
2cac13e4 | 10910 | u64 total_bytes = btrfs_super_total_bytes(fs_info->super_copy); |
f7039b1d LD |
10911 | int ret = 0; |
10912 | ||
2cac13e4 LB |
10913 | /* |
10914 | * try to trim all FS space, our block group may start from non-zero. | |
10915 | */ | |
10916 | if (range->len == total_bytes) | |
10917 | cache = btrfs_lookup_first_block_group(fs_info, range->start); | |
10918 | else | |
10919 | cache = btrfs_lookup_block_group(fs_info, range->start); | |
f7039b1d LD |
10920 | |
10921 | while (cache) { | |
10922 | if (cache->key.objectid >= (range->start + range->len)) { | |
10923 | btrfs_put_block_group(cache); | |
10924 | break; | |
10925 | } | |
10926 | ||
10927 | start = max(range->start, cache->key.objectid); | |
10928 | end = min(range->start + range->len, | |
10929 | cache->key.objectid + cache->key.offset); | |
10930 | ||
10931 | if (end - start >= range->minlen) { | |
10932 | if (!block_group_cache_done(cache)) { | |
f6373bf3 | 10933 | ret = cache_block_group(cache, 0); |
1be41b78 JB |
10934 | if (ret) { |
10935 | btrfs_put_block_group(cache); | |
10936 | break; | |
10937 | } | |
10938 | ret = wait_block_group_cache_done(cache); | |
10939 | if (ret) { | |
10940 | btrfs_put_block_group(cache); | |
10941 | break; | |
10942 | } | |
f7039b1d LD |
10943 | } |
10944 | ret = btrfs_trim_block_group(cache, | |
10945 | &group_trimmed, | |
10946 | start, | |
10947 | end, | |
10948 | range->minlen); | |
10949 | ||
10950 | trimmed += group_trimmed; | |
10951 | if (ret) { | |
10952 | btrfs_put_block_group(cache); | |
10953 | break; | |
10954 | } | |
10955 | } | |
10956 | ||
2ff7e61e | 10957 | cache = next_block_group(fs_info, cache); |
f7039b1d LD |
10958 | } |
10959 | ||
0b246afa JM |
10960 | mutex_lock(&fs_info->fs_devices->device_list_mutex); |
10961 | devices = &fs_info->fs_devices->alloc_list; | |
499f377f JM |
10962 | list_for_each_entry(device, devices, dev_alloc_list) { |
10963 | ret = btrfs_trim_free_extents(device, range->minlen, | |
10964 | &group_trimmed); | |
10965 | if (ret) | |
10966 | break; | |
10967 | ||
10968 | trimmed += group_trimmed; | |
10969 | } | |
0b246afa | 10970 | mutex_unlock(&fs_info->fs_devices->device_list_mutex); |
499f377f | 10971 | |
f7039b1d LD |
10972 | range->len = trimmed; |
10973 | return ret; | |
10974 | } | |
8257b2dc MX |
10975 | |
10976 | /* | |
9ea24bbe FM |
10977 | * btrfs_{start,end}_write_no_snapshoting() are similar to |
10978 | * mnt_{want,drop}_write(), they are used to prevent some tasks from writing | |
10979 | * data into the page cache through nocow before the subvolume is snapshoted, | |
10980 | * but flush the data into disk after the snapshot creation, or to prevent | |
10981 | * operations while snapshoting is ongoing and that cause the snapshot to be | |
10982 | * inconsistent (writes followed by expanding truncates for example). | |
8257b2dc | 10983 | */ |
9ea24bbe | 10984 | void btrfs_end_write_no_snapshoting(struct btrfs_root *root) |
8257b2dc MX |
10985 | { |
10986 | percpu_counter_dec(&root->subv_writers->counter); | |
10987 | /* | |
a83342aa | 10988 | * Make sure counter is updated before we wake up waiters. |
8257b2dc MX |
10989 | */ |
10990 | smp_mb(); | |
10991 | if (waitqueue_active(&root->subv_writers->wait)) | |
10992 | wake_up(&root->subv_writers->wait); | |
10993 | } | |
10994 | ||
9ea24bbe | 10995 | int btrfs_start_write_no_snapshoting(struct btrfs_root *root) |
8257b2dc | 10996 | { |
ee39b432 | 10997 | if (atomic_read(&root->will_be_snapshoted)) |
8257b2dc MX |
10998 | return 0; |
10999 | ||
11000 | percpu_counter_inc(&root->subv_writers->counter); | |
11001 | /* | |
11002 | * Make sure counter is updated before we check for snapshot creation. | |
11003 | */ | |
11004 | smp_mb(); | |
ee39b432 | 11005 | if (atomic_read(&root->will_be_snapshoted)) { |
9ea24bbe | 11006 | btrfs_end_write_no_snapshoting(root); |
8257b2dc MX |
11007 | return 0; |
11008 | } | |
11009 | return 1; | |
11010 | } | |
0bc19f90 ZL |
11011 | |
11012 | static int wait_snapshoting_atomic_t(atomic_t *a) | |
11013 | { | |
11014 | schedule(); | |
11015 | return 0; | |
11016 | } | |
11017 | ||
11018 | void btrfs_wait_for_snapshot_creation(struct btrfs_root *root) | |
11019 | { | |
11020 | while (true) { | |
11021 | int ret; | |
11022 | ||
11023 | ret = btrfs_start_write_no_snapshoting(root); | |
11024 | if (ret) | |
11025 | break; | |
11026 | wait_on_atomic_t(&root->will_be_snapshoted, | |
11027 | wait_snapshoting_atomic_t, | |
11028 | TASK_UNINTERRUPTIBLE); | |
11029 | } | |
11030 | } |