Commit | Line | Data |
---|---|---|
6cbd5570 CM |
1 | /* |
2 | * Copyright (C) 2007 Oracle. All rights reserved. | |
3 | * | |
4 | * This program is free software; you can redistribute it and/or | |
5 | * modify it under the terms of the GNU General Public | |
6 | * License v2 as published by the Free Software Foundation. | |
7 | * | |
8 | * This program is distributed in the hope that it will be useful, | |
9 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
10 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
11 | * General Public License for more details. | |
12 | * | |
13 | * You should have received a copy of the GNU General Public | |
14 | * License along with this program; if not, write to the | |
15 | * Free Software Foundation, Inc., 59 Temple Place - Suite 330, | |
16 | * Boston, MA 021110-1307, USA. | |
17 | */ | |
ec6b910f | 18 | #include <linux/sched.h> |
edbd8d4e | 19 | #include <linux/pagemap.h> |
ec44a35c | 20 | #include <linux/writeback.h> |
21af804c | 21 | #include <linux/blkdev.h> |
b7a9f29f | 22 | #include <linux/sort.h> |
4184ea7f | 23 | #include <linux/rcupdate.h> |
817d52f8 | 24 | #include <linux/kthread.h> |
5a0e3ad6 | 25 | #include <linux/slab.h> |
dff51cd1 | 26 | #include <linux/ratelimit.h> |
4b4e25f2 | 27 | #include "compat.h" |
74493f7a | 28 | #include "hash.h" |
fec577fb CM |
29 | #include "ctree.h" |
30 | #include "disk-io.h" | |
31 | #include "print-tree.h" | |
e089f05c | 32 | #include "transaction.h" |
0b86a832 | 33 | #include "volumes.h" |
925baedd | 34 | #include "locking.h" |
fa9c0d79 | 35 | #include "free-space-cache.h" |
3fed40cc | 36 | #include "math.h" |
fec577fb | 37 | |
709c0486 AJ |
38 | #undef SCRAMBLE_DELAYED_REFS |
39 | ||
9e622d6b MX |
40 | /* |
41 | * control flags for do_chunk_alloc's force field | |
0e4f8f88 CM |
42 | * CHUNK_ALLOC_NO_FORCE means to only allocate a chunk |
43 | * if we really need one. | |
44 | * | |
0e4f8f88 CM |
45 | * CHUNK_ALLOC_LIMITED means to only try and allocate one |
46 | * if we have very few chunks already allocated. This is | |
47 | * used as part of the clustering code to help make sure | |
48 | * we have a good pool of storage to cluster in, without | |
49 | * filling the FS with empty chunks | |
50 | * | |
9e622d6b MX |
51 | * CHUNK_ALLOC_FORCE means it must try to allocate one |
52 | * | |
0e4f8f88 CM |
53 | */ |
54 | enum { | |
55 | CHUNK_ALLOC_NO_FORCE = 0, | |
9e622d6b MX |
56 | CHUNK_ALLOC_LIMITED = 1, |
57 | CHUNK_ALLOC_FORCE = 2, | |
0e4f8f88 CM |
58 | }; |
59 | ||
fb25e914 JB |
60 | /* |
61 | * Control how reservations are dealt with. | |
62 | * | |
63 | * RESERVE_FREE - freeing a reservation. | |
64 | * RESERVE_ALLOC - allocating space and we need to update bytes_may_use for | |
65 | * ENOSPC accounting | |
66 | * RESERVE_ALLOC_NO_ACCOUNT - allocating space and we should not update | |
67 | * bytes_may_use as the ENOSPC accounting is done elsewhere | |
68 | */ | |
69 | enum { | |
70 | RESERVE_FREE = 0, | |
71 | RESERVE_ALLOC = 1, | |
72 | RESERVE_ALLOC_NO_ACCOUNT = 2, | |
73 | }; | |
74 | ||
f3465ca4 JB |
75 | static int update_block_group(struct btrfs_trans_handle *trans, |
76 | struct btrfs_root *root, | |
f0486c68 | 77 | u64 bytenr, u64 num_bytes, int alloc); |
5d4f98a2 YZ |
78 | static int __btrfs_free_extent(struct btrfs_trans_handle *trans, |
79 | struct btrfs_root *root, | |
80 | u64 bytenr, u64 num_bytes, u64 parent, | |
81 | u64 root_objectid, u64 owner_objectid, | |
82 | u64 owner_offset, int refs_to_drop, | |
83 | struct btrfs_delayed_extent_op *extra_op); | |
84 | static void __run_delayed_extent_op(struct btrfs_delayed_extent_op *extent_op, | |
85 | struct extent_buffer *leaf, | |
86 | struct btrfs_extent_item *ei); | |
87 | static int alloc_reserved_file_extent(struct btrfs_trans_handle *trans, | |
88 | struct btrfs_root *root, | |
89 | u64 parent, u64 root_objectid, | |
90 | u64 flags, u64 owner, u64 offset, | |
91 | struct btrfs_key *ins, int ref_mod); | |
92 | static int alloc_reserved_tree_block(struct btrfs_trans_handle *trans, | |
93 | struct btrfs_root *root, | |
94 | u64 parent, u64 root_objectid, | |
95 | u64 flags, struct btrfs_disk_key *key, | |
96 | int level, struct btrfs_key *ins); | |
6a63209f | 97 | static int do_chunk_alloc(struct btrfs_trans_handle *trans, |
698d0082 JB |
98 | struct btrfs_root *extent_root, u64 flags, |
99 | int force); | |
11833d66 YZ |
100 | static int find_next_key(struct btrfs_path *path, int level, |
101 | struct btrfs_key *key); | |
9ed74f2d JB |
102 | static void dump_space_info(struct btrfs_space_info *info, u64 bytes, |
103 | int dump_block_groups); | |
fb25e914 JB |
104 | static int btrfs_update_reserved_bytes(struct btrfs_block_group_cache *cache, |
105 | u64 num_bytes, int reserve); | |
6a63209f | 106 | |
817d52f8 JB |
107 | static noinline int |
108 | block_group_cache_done(struct btrfs_block_group_cache *cache) | |
109 | { | |
110 | smp_mb(); | |
111 | return cache->cached == BTRFS_CACHE_FINISHED; | |
112 | } | |
113 | ||
0f9dd46c JB |
114 | static int block_group_bits(struct btrfs_block_group_cache *cache, u64 bits) |
115 | { | |
116 | return (cache->flags & bits) == bits; | |
117 | } | |
118 | ||
62a45b60 | 119 | static void btrfs_get_block_group(struct btrfs_block_group_cache *cache) |
11dfe35a JB |
120 | { |
121 | atomic_inc(&cache->count); | |
122 | } | |
123 | ||
124 | void btrfs_put_block_group(struct btrfs_block_group_cache *cache) | |
125 | { | |
f0486c68 YZ |
126 | if (atomic_dec_and_test(&cache->count)) { |
127 | WARN_ON(cache->pinned > 0); | |
128 | WARN_ON(cache->reserved > 0); | |
34d52cb6 | 129 | kfree(cache->free_space_ctl); |
11dfe35a | 130 | kfree(cache); |
f0486c68 | 131 | } |
11dfe35a JB |
132 | } |
133 | ||
0f9dd46c JB |
134 | /* |
135 | * this adds the block group to the fs_info rb tree for the block group | |
136 | * cache | |
137 | */ | |
b2950863 | 138 | static int btrfs_add_block_group_cache(struct btrfs_fs_info *info, |
0f9dd46c JB |
139 | struct btrfs_block_group_cache *block_group) |
140 | { | |
141 | struct rb_node **p; | |
142 | struct rb_node *parent = NULL; | |
143 | struct btrfs_block_group_cache *cache; | |
144 | ||
145 | spin_lock(&info->block_group_cache_lock); | |
146 | p = &info->block_group_cache_tree.rb_node; | |
147 | ||
148 | while (*p) { | |
149 | parent = *p; | |
150 | cache = rb_entry(parent, struct btrfs_block_group_cache, | |
151 | cache_node); | |
152 | if (block_group->key.objectid < cache->key.objectid) { | |
153 | p = &(*p)->rb_left; | |
154 | } else if (block_group->key.objectid > cache->key.objectid) { | |
155 | p = &(*p)->rb_right; | |
156 | } else { | |
157 | spin_unlock(&info->block_group_cache_lock); | |
158 | return -EEXIST; | |
159 | } | |
160 | } | |
161 | ||
162 | rb_link_node(&block_group->cache_node, parent, p); | |
163 | rb_insert_color(&block_group->cache_node, | |
164 | &info->block_group_cache_tree); | |
165 | spin_unlock(&info->block_group_cache_lock); | |
166 | ||
167 | return 0; | |
168 | } | |
169 | ||
170 | /* | |
171 | * This will return the block group at or after bytenr if contains is 0, else | |
172 | * it will return the block group that contains the bytenr | |
173 | */ | |
174 | static struct btrfs_block_group_cache * | |
175 | block_group_cache_tree_search(struct btrfs_fs_info *info, u64 bytenr, | |
176 | int contains) | |
177 | { | |
178 | struct btrfs_block_group_cache *cache, *ret = NULL; | |
179 | struct rb_node *n; | |
180 | u64 end, start; | |
181 | ||
182 | spin_lock(&info->block_group_cache_lock); | |
183 | n = info->block_group_cache_tree.rb_node; | |
184 | ||
185 | while (n) { | |
186 | cache = rb_entry(n, struct btrfs_block_group_cache, | |
187 | cache_node); | |
188 | end = cache->key.objectid + cache->key.offset - 1; | |
189 | start = cache->key.objectid; | |
190 | ||
191 | if (bytenr < start) { | |
192 | if (!contains && (!ret || start < ret->key.objectid)) | |
193 | ret = cache; | |
194 | n = n->rb_left; | |
195 | } else if (bytenr > start) { | |
196 | if (contains && bytenr <= end) { | |
197 | ret = cache; | |
198 | break; | |
199 | } | |
200 | n = n->rb_right; | |
201 | } else { | |
202 | ret = cache; | |
203 | break; | |
204 | } | |
205 | } | |
d2fb3437 | 206 | if (ret) |
11dfe35a | 207 | btrfs_get_block_group(ret); |
0f9dd46c JB |
208 | spin_unlock(&info->block_group_cache_lock); |
209 | ||
210 | return ret; | |
211 | } | |
212 | ||
11833d66 YZ |
213 | static int add_excluded_extent(struct btrfs_root *root, |
214 | u64 start, u64 num_bytes) | |
817d52f8 | 215 | { |
11833d66 YZ |
216 | u64 end = start + num_bytes - 1; |
217 | set_extent_bits(&root->fs_info->freed_extents[0], | |
218 | start, end, EXTENT_UPTODATE, GFP_NOFS); | |
219 | set_extent_bits(&root->fs_info->freed_extents[1], | |
220 | start, end, EXTENT_UPTODATE, GFP_NOFS); | |
221 | return 0; | |
222 | } | |
817d52f8 | 223 | |
11833d66 YZ |
224 | static void free_excluded_extents(struct btrfs_root *root, |
225 | struct btrfs_block_group_cache *cache) | |
226 | { | |
227 | u64 start, end; | |
817d52f8 | 228 | |
11833d66 YZ |
229 | start = cache->key.objectid; |
230 | end = start + cache->key.offset - 1; | |
231 | ||
232 | clear_extent_bits(&root->fs_info->freed_extents[0], | |
233 | start, end, EXTENT_UPTODATE, GFP_NOFS); | |
234 | clear_extent_bits(&root->fs_info->freed_extents[1], | |
235 | start, end, EXTENT_UPTODATE, GFP_NOFS); | |
817d52f8 JB |
236 | } |
237 | ||
11833d66 YZ |
238 | static int exclude_super_stripes(struct btrfs_root *root, |
239 | struct btrfs_block_group_cache *cache) | |
817d52f8 | 240 | { |
817d52f8 JB |
241 | u64 bytenr; |
242 | u64 *logical; | |
243 | int stripe_len; | |
244 | int i, nr, ret; | |
245 | ||
06b2331f YZ |
246 | if (cache->key.objectid < BTRFS_SUPER_INFO_OFFSET) { |
247 | stripe_len = BTRFS_SUPER_INFO_OFFSET - cache->key.objectid; | |
248 | cache->bytes_super += stripe_len; | |
249 | ret = add_excluded_extent(root, cache->key.objectid, | |
250 | stripe_len); | |
79787eaa | 251 | BUG_ON(ret); /* -ENOMEM */ |
06b2331f YZ |
252 | } |
253 | ||
817d52f8 JB |
254 | for (i = 0; i < BTRFS_SUPER_MIRROR_MAX; i++) { |
255 | bytenr = btrfs_sb_offset(i); | |
256 | ret = btrfs_rmap_block(&root->fs_info->mapping_tree, | |
257 | cache->key.objectid, bytenr, | |
258 | 0, &logical, &nr, &stripe_len); | |
79787eaa | 259 | BUG_ON(ret); /* -ENOMEM */ |
11833d66 | 260 | |
817d52f8 | 261 | while (nr--) { |
1b2da372 | 262 | cache->bytes_super += stripe_len; |
11833d66 YZ |
263 | ret = add_excluded_extent(root, logical[nr], |
264 | stripe_len); | |
79787eaa | 265 | BUG_ON(ret); /* -ENOMEM */ |
817d52f8 | 266 | } |
11833d66 | 267 | |
817d52f8 JB |
268 | kfree(logical); |
269 | } | |
817d52f8 JB |
270 | return 0; |
271 | } | |
272 | ||
11833d66 YZ |
273 | static struct btrfs_caching_control * |
274 | get_caching_control(struct btrfs_block_group_cache *cache) | |
275 | { | |
276 | struct btrfs_caching_control *ctl; | |
277 | ||
278 | spin_lock(&cache->lock); | |
279 | if (cache->cached != BTRFS_CACHE_STARTED) { | |
280 | spin_unlock(&cache->lock); | |
281 | return NULL; | |
282 | } | |
283 | ||
dde5abee JB |
284 | /* We're loading it the fast way, so we don't have a caching_ctl. */ |
285 | if (!cache->caching_ctl) { | |
286 | spin_unlock(&cache->lock); | |
11833d66 YZ |
287 | return NULL; |
288 | } | |
289 | ||
290 | ctl = cache->caching_ctl; | |
291 | atomic_inc(&ctl->count); | |
292 | spin_unlock(&cache->lock); | |
293 | return ctl; | |
294 | } | |
295 | ||
296 | static void put_caching_control(struct btrfs_caching_control *ctl) | |
297 | { | |
298 | if (atomic_dec_and_test(&ctl->count)) | |
299 | kfree(ctl); | |
300 | } | |
301 | ||
0f9dd46c JB |
302 | /* |
303 | * this is only called by cache_block_group, since we could have freed extents | |
304 | * we need to check the pinned_extents for any extents that can't be used yet | |
305 | * since their free space will be released as soon as the transaction commits. | |
306 | */ | |
817d52f8 | 307 | static u64 add_new_free_space(struct btrfs_block_group_cache *block_group, |
0f9dd46c JB |
308 | struct btrfs_fs_info *info, u64 start, u64 end) |
309 | { | |
817d52f8 | 310 | u64 extent_start, extent_end, size, total_added = 0; |
0f9dd46c JB |
311 | int ret; |
312 | ||
313 | while (start < end) { | |
11833d66 | 314 | ret = find_first_extent_bit(info->pinned_extents, start, |
0f9dd46c | 315 | &extent_start, &extent_end, |
e6138876 JB |
316 | EXTENT_DIRTY | EXTENT_UPTODATE, |
317 | NULL); | |
0f9dd46c JB |
318 | if (ret) |
319 | break; | |
320 | ||
06b2331f | 321 | if (extent_start <= start) { |
0f9dd46c JB |
322 | start = extent_end + 1; |
323 | } else if (extent_start > start && extent_start < end) { | |
324 | size = extent_start - start; | |
817d52f8 | 325 | total_added += size; |
ea6a478e JB |
326 | ret = btrfs_add_free_space(block_group, start, |
327 | size); | |
79787eaa | 328 | BUG_ON(ret); /* -ENOMEM or logic error */ |
0f9dd46c JB |
329 | start = extent_end + 1; |
330 | } else { | |
331 | break; | |
332 | } | |
333 | } | |
334 | ||
335 | if (start < end) { | |
336 | size = end - start; | |
817d52f8 | 337 | total_added += size; |
ea6a478e | 338 | ret = btrfs_add_free_space(block_group, start, size); |
79787eaa | 339 | BUG_ON(ret); /* -ENOMEM or logic error */ |
0f9dd46c JB |
340 | } |
341 | ||
817d52f8 | 342 | return total_added; |
0f9dd46c JB |
343 | } |
344 | ||
bab39bf9 | 345 | static noinline void caching_thread(struct btrfs_work *work) |
e37c9e69 | 346 | { |
bab39bf9 JB |
347 | struct btrfs_block_group_cache *block_group; |
348 | struct btrfs_fs_info *fs_info; | |
349 | struct btrfs_caching_control *caching_ctl; | |
350 | struct btrfs_root *extent_root; | |
e37c9e69 | 351 | struct btrfs_path *path; |
5f39d397 | 352 | struct extent_buffer *leaf; |
11833d66 | 353 | struct btrfs_key key; |
817d52f8 | 354 | u64 total_found = 0; |
11833d66 YZ |
355 | u64 last = 0; |
356 | u32 nritems; | |
357 | int ret = 0; | |
f510cfec | 358 | |
bab39bf9 JB |
359 | caching_ctl = container_of(work, struct btrfs_caching_control, work); |
360 | block_group = caching_ctl->block_group; | |
361 | fs_info = block_group->fs_info; | |
362 | extent_root = fs_info->extent_root; | |
363 | ||
e37c9e69 CM |
364 | path = btrfs_alloc_path(); |
365 | if (!path) | |
bab39bf9 | 366 | goto out; |
7d7d6068 | 367 | |
817d52f8 | 368 | last = max_t(u64, block_group->key.objectid, BTRFS_SUPER_INFO_OFFSET); |
11833d66 | 369 | |
5cd57b2c | 370 | /* |
817d52f8 JB |
371 | * We don't want to deadlock with somebody trying to allocate a new |
372 | * extent for the extent root while also trying to search the extent | |
373 | * root to add free space. So we skip locking and search the commit | |
374 | * root, since its read-only | |
5cd57b2c CM |
375 | */ |
376 | path->skip_locking = 1; | |
817d52f8 | 377 | path->search_commit_root = 1; |
026fd317 | 378 | path->reada = 1; |
817d52f8 | 379 | |
e4404d6e | 380 | key.objectid = last; |
e37c9e69 | 381 | key.offset = 0; |
11833d66 | 382 | key.type = BTRFS_EXTENT_ITEM_KEY; |
013f1b12 | 383 | again: |
11833d66 | 384 | mutex_lock(&caching_ctl->mutex); |
013f1b12 CM |
385 | /* need to make sure the commit_root doesn't disappear */ |
386 | down_read(&fs_info->extent_commit_sem); | |
387 | ||
11833d66 | 388 | ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0); |
e37c9e69 | 389 | if (ret < 0) |
ef8bbdfe | 390 | goto err; |
a512bbf8 | 391 | |
11833d66 YZ |
392 | leaf = path->nodes[0]; |
393 | nritems = btrfs_header_nritems(leaf); | |
394 | ||
d397712b | 395 | while (1) { |
7841cb28 | 396 | if (btrfs_fs_closing(fs_info) > 1) { |
f25784b3 | 397 | last = (u64)-1; |
817d52f8 | 398 | break; |
f25784b3 | 399 | } |
817d52f8 | 400 | |
11833d66 YZ |
401 | if (path->slots[0] < nritems) { |
402 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
403 | } else { | |
404 | ret = find_next_key(path, 0, &key); | |
405 | if (ret) | |
e37c9e69 | 406 | break; |
817d52f8 | 407 | |
589d8ade JB |
408 | if (need_resched() || |
409 | btrfs_next_leaf(extent_root, path)) { | |
410 | caching_ctl->progress = last; | |
ff5714cc | 411 | btrfs_release_path(path); |
589d8ade JB |
412 | up_read(&fs_info->extent_commit_sem); |
413 | mutex_unlock(&caching_ctl->mutex); | |
11833d66 | 414 | cond_resched(); |
589d8ade JB |
415 | goto again; |
416 | } | |
417 | leaf = path->nodes[0]; | |
418 | nritems = btrfs_header_nritems(leaf); | |
419 | continue; | |
11833d66 | 420 | } |
817d52f8 | 421 | |
11833d66 YZ |
422 | if (key.objectid < block_group->key.objectid) { |
423 | path->slots[0]++; | |
817d52f8 | 424 | continue; |
e37c9e69 | 425 | } |
0f9dd46c | 426 | |
e37c9e69 | 427 | if (key.objectid >= block_group->key.objectid + |
0f9dd46c | 428 | block_group->key.offset) |
e37c9e69 | 429 | break; |
7d7d6068 | 430 | |
11833d66 | 431 | if (key.type == BTRFS_EXTENT_ITEM_KEY) { |
817d52f8 JB |
432 | total_found += add_new_free_space(block_group, |
433 | fs_info, last, | |
434 | key.objectid); | |
7d7d6068 | 435 | last = key.objectid + key.offset; |
817d52f8 | 436 | |
11833d66 YZ |
437 | if (total_found > (1024 * 1024 * 2)) { |
438 | total_found = 0; | |
439 | wake_up(&caching_ctl->wait); | |
440 | } | |
817d52f8 | 441 | } |
e37c9e69 CM |
442 | path->slots[0]++; |
443 | } | |
817d52f8 | 444 | ret = 0; |
e37c9e69 | 445 | |
817d52f8 JB |
446 | total_found += add_new_free_space(block_group, fs_info, last, |
447 | block_group->key.objectid + | |
448 | block_group->key.offset); | |
11833d66 | 449 | caching_ctl->progress = (u64)-1; |
817d52f8 JB |
450 | |
451 | spin_lock(&block_group->lock); | |
11833d66 | 452 | block_group->caching_ctl = NULL; |
817d52f8 JB |
453 | block_group->cached = BTRFS_CACHE_FINISHED; |
454 | spin_unlock(&block_group->lock); | |
0f9dd46c | 455 | |
54aa1f4d | 456 | err: |
e37c9e69 | 457 | btrfs_free_path(path); |
276e680d | 458 | up_read(&fs_info->extent_commit_sem); |
817d52f8 | 459 | |
11833d66 YZ |
460 | free_excluded_extents(extent_root, block_group); |
461 | ||
462 | mutex_unlock(&caching_ctl->mutex); | |
bab39bf9 | 463 | out: |
11833d66 YZ |
464 | wake_up(&caching_ctl->wait); |
465 | ||
466 | put_caching_control(caching_ctl); | |
11dfe35a | 467 | btrfs_put_block_group(block_group); |
817d52f8 JB |
468 | } |
469 | ||
9d66e233 JB |
470 | static int cache_block_group(struct btrfs_block_group_cache *cache, |
471 | struct btrfs_trans_handle *trans, | |
b8399dee | 472 | struct btrfs_root *root, |
9d66e233 | 473 | int load_cache_only) |
817d52f8 | 474 | { |
291c7d2f | 475 | DEFINE_WAIT(wait); |
11833d66 YZ |
476 | struct btrfs_fs_info *fs_info = cache->fs_info; |
477 | struct btrfs_caching_control *caching_ctl; | |
817d52f8 JB |
478 | int ret = 0; |
479 | ||
291c7d2f | 480 | caching_ctl = kzalloc(sizeof(*caching_ctl), GFP_NOFS); |
79787eaa JM |
481 | if (!caching_ctl) |
482 | return -ENOMEM; | |
291c7d2f JB |
483 | |
484 | INIT_LIST_HEAD(&caching_ctl->list); | |
485 | mutex_init(&caching_ctl->mutex); | |
486 | init_waitqueue_head(&caching_ctl->wait); | |
487 | caching_ctl->block_group = cache; | |
488 | caching_ctl->progress = cache->key.objectid; | |
489 | atomic_set(&caching_ctl->count, 1); | |
490 | caching_ctl->work.func = caching_thread; | |
491 | ||
492 | spin_lock(&cache->lock); | |
493 | /* | |
494 | * This should be a rare occasion, but this could happen I think in the | |
495 | * case where one thread starts to load the space cache info, and then | |
496 | * some other thread starts a transaction commit which tries to do an | |
497 | * allocation while the other thread is still loading the space cache | |
498 | * info. The previous loop should have kept us from choosing this block | |
499 | * group, but if we've moved to the state where we will wait on caching | |
500 | * block groups we need to first check if we're doing a fast load here, | |
501 | * so we can wait for it to finish, otherwise we could end up allocating | |
502 | * from a block group who's cache gets evicted for one reason or | |
503 | * another. | |
504 | */ | |
505 | while (cache->cached == BTRFS_CACHE_FAST) { | |
506 | struct btrfs_caching_control *ctl; | |
507 | ||
508 | ctl = cache->caching_ctl; | |
509 | atomic_inc(&ctl->count); | |
510 | prepare_to_wait(&ctl->wait, &wait, TASK_UNINTERRUPTIBLE); | |
511 | spin_unlock(&cache->lock); | |
512 | ||
513 | schedule(); | |
514 | ||
515 | finish_wait(&ctl->wait, &wait); | |
516 | put_caching_control(ctl); | |
517 | spin_lock(&cache->lock); | |
518 | } | |
519 | ||
520 | if (cache->cached != BTRFS_CACHE_NO) { | |
521 | spin_unlock(&cache->lock); | |
522 | kfree(caching_ctl); | |
11833d66 | 523 | return 0; |
291c7d2f JB |
524 | } |
525 | WARN_ON(cache->caching_ctl); | |
526 | cache->caching_ctl = caching_ctl; | |
527 | cache->cached = BTRFS_CACHE_FAST; | |
528 | spin_unlock(&cache->lock); | |
11833d66 | 529 | |
9d66e233 JB |
530 | /* |
531 | * We can't do the read from on-disk cache during a commit since we need | |
b8399dee JB |
532 | * to have the normal tree locking. Also if we are currently trying to |
533 | * allocate blocks for the tree root we can't do the fast caching since | |
534 | * we likely hold important locks. | |
9d66e233 | 535 | */ |
d53ba474 | 536 | if (fs_info->mount_opt & BTRFS_MOUNT_SPACE_CACHE) { |
9d66e233 JB |
537 | ret = load_free_space_cache(fs_info, cache); |
538 | ||
539 | spin_lock(&cache->lock); | |
540 | if (ret == 1) { | |
291c7d2f | 541 | cache->caching_ctl = NULL; |
9d66e233 JB |
542 | cache->cached = BTRFS_CACHE_FINISHED; |
543 | cache->last_byte_to_unpin = (u64)-1; | |
544 | } else { | |
291c7d2f JB |
545 | if (load_cache_only) { |
546 | cache->caching_ctl = NULL; | |
547 | cache->cached = BTRFS_CACHE_NO; | |
548 | } else { | |
549 | cache->cached = BTRFS_CACHE_STARTED; | |
550 | } | |
9d66e233 JB |
551 | } |
552 | spin_unlock(&cache->lock); | |
291c7d2f | 553 | wake_up(&caching_ctl->wait); |
3c14874a | 554 | if (ret == 1) { |
291c7d2f | 555 | put_caching_control(caching_ctl); |
3c14874a | 556 | free_excluded_extents(fs_info->extent_root, cache); |
9d66e233 | 557 | return 0; |
3c14874a | 558 | } |
291c7d2f JB |
559 | } else { |
560 | /* | |
561 | * We are not going to do the fast caching, set cached to the | |
562 | * appropriate value and wakeup any waiters. | |
563 | */ | |
564 | spin_lock(&cache->lock); | |
565 | if (load_cache_only) { | |
566 | cache->caching_ctl = NULL; | |
567 | cache->cached = BTRFS_CACHE_NO; | |
568 | } else { | |
569 | cache->cached = BTRFS_CACHE_STARTED; | |
570 | } | |
571 | spin_unlock(&cache->lock); | |
572 | wake_up(&caching_ctl->wait); | |
9d66e233 JB |
573 | } |
574 | ||
291c7d2f JB |
575 | if (load_cache_only) { |
576 | put_caching_control(caching_ctl); | |
11833d66 | 577 | return 0; |
817d52f8 | 578 | } |
817d52f8 | 579 | |
11833d66 | 580 | down_write(&fs_info->extent_commit_sem); |
291c7d2f | 581 | atomic_inc(&caching_ctl->count); |
11833d66 YZ |
582 | list_add_tail(&caching_ctl->list, &fs_info->caching_block_groups); |
583 | up_write(&fs_info->extent_commit_sem); | |
584 | ||
11dfe35a | 585 | btrfs_get_block_group(cache); |
11833d66 | 586 | |
bab39bf9 | 587 | btrfs_queue_worker(&fs_info->caching_workers, &caching_ctl->work); |
817d52f8 | 588 | |
ef8bbdfe | 589 | return ret; |
e37c9e69 CM |
590 | } |
591 | ||
0f9dd46c JB |
592 | /* |
593 | * return the block group that starts at or after bytenr | |
594 | */ | |
d397712b CM |
595 | static struct btrfs_block_group_cache * |
596 | btrfs_lookup_first_block_group(struct btrfs_fs_info *info, u64 bytenr) | |
0ef3e66b | 597 | { |
0f9dd46c | 598 | struct btrfs_block_group_cache *cache; |
0ef3e66b | 599 | |
0f9dd46c | 600 | cache = block_group_cache_tree_search(info, bytenr, 0); |
0ef3e66b | 601 | |
0f9dd46c | 602 | return cache; |
0ef3e66b CM |
603 | } |
604 | ||
0f9dd46c | 605 | /* |
9f55684c | 606 | * return the block group that contains the given bytenr |
0f9dd46c | 607 | */ |
d397712b CM |
608 | struct btrfs_block_group_cache *btrfs_lookup_block_group( |
609 | struct btrfs_fs_info *info, | |
610 | u64 bytenr) | |
be744175 | 611 | { |
0f9dd46c | 612 | struct btrfs_block_group_cache *cache; |
be744175 | 613 | |
0f9dd46c | 614 | cache = block_group_cache_tree_search(info, bytenr, 1); |
96b5179d | 615 | |
0f9dd46c | 616 | return cache; |
be744175 | 617 | } |
0b86a832 | 618 | |
0f9dd46c JB |
619 | static struct btrfs_space_info *__find_space_info(struct btrfs_fs_info *info, |
620 | u64 flags) | |
6324fbf3 | 621 | { |
0f9dd46c | 622 | struct list_head *head = &info->space_info; |
0f9dd46c | 623 | struct btrfs_space_info *found; |
4184ea7f | 624 | |
52ba6929 | 625 | flags &= BTRFS_BLOCK_GROUP_TYPE_MASK; |
b742bb82 | 626 | |
4184ea7f CM |
627 | rcu_read_lock(); |
628 | list_for_each_entry_rcu(found, head, list) { | |
67377734 | 629 | if (found->flags & flags) { |
4184ea7f | 630 | rcu_read_unlock(); |
0f9dd46c | 631 | return found; |
4184ea7f | 632 | } |
0f9dd46c | 633 | } |
4184ea7f | 634 | rcu_read_unlock(); |
0f9dd46c | 635 | return NULL; |
6324fbf3 CM |
636 | } |
637 | ||
4184ea7f CM |
638 | /* |
639 | * after adding space to the filesystem, we need to clear the full flags | |
640 | * on all the space infos. | |
641 | */ | |
642 | void btrfs_clear_space_info_full(struct btrfs_fs_info *info) | |
643 | { | |
644 | struct list_head *head = &info->space_info; | |
645 | struct btrfs_space_info *found; | |
646 | ||
647 | rcu_read_lock(); | |
648 | list_for_each_entry_rcu(found, head, list) | |
649 | found->full = 0; | |
650 | rcu_read_unlock(); | |
651 | } | |
652 | ||
d2fb3437 YZ |
653 | u64 btrfs_find_block_group(struct btrfs_root *root, |
654 | u64 search_start, u64 search_hint, int owner) | |
cd1bc465 | 655 | { |
96b5179d | 656 | struct btrfs_block_group_cache *cache; |
cd1bc465 | 657 | u64 used; |
d2fb3437 YZ |
658 | u64 last = max(search_hint, search_start); |
659 | u64 group_start = 0; | |
31f3c99b | 660 | int full_search = 0; |
d2fb3437 | 661 | int factor = 9; |
0ef3e66b | 662 | int wrapped = 0; |
31f3c99b | 663 | again: |
e8569813 ZY |
664 | while (1) { |
665 | cache = btrfs_lookup_first_block_group(root->fs_info, last); | |
0f9dd46c JB |
666 | if (!cache) |
667 | break; | |
96b5179d | 668 | |
c286ac48 | 669 | spin_lock(&cache->lock); |
96b5179d CM |
670 | last = cache->key.objectid + cache->key.offset; |
671 | used = btrfs_block_group_used(&cache->item); | |
672 | ||
d2fb3437 YZ |
673 | if ((full_search || !cache->ro) && |
674 | block_group_bits(cache, BTRFS_BLOCK_GROUP_METADATA)) { | |
e8569813 | 675 | if (used + cache->pinned + cache->reserved < |
d2fb3437 YZ |
676 | div_factor(cache->key.offset, factor)) { |
677 | group_start = cache->key.objectid; | |
c286ac48 | 678 | spin_unlock(&cache->lock); |
fa9c0d79 | 679 | btrfs_put_block_group(cache); |
8790d502 CM |
680 | goto found; |
681 | } | |
6324fbf3 | 682 | } |
c286ac48 | 683 | spin_unlock(&cache->lock); |
fa9c0d79 | 684 | btrfs_put_block_group(cache); |
de428b63 | 685 | cond_resched(); |
cd1bc465 | 686 | } |
0ef3e66b CM |
687 | if (!wrapped) { |
688 | last = search_start; | |
689 | wrapped = 1; | |
690 | goto again; | |
691 | } | |
692 | if (!full_search && factor < 10) { | |
be744175 | 693 | last = search_start; |
31f3c99b | 694 | full_search = 1; |
0ef3e66b | 695 | factor = 10; |
31f3c99b CM |
696 | goto again; |
697 | } | |
be744175 | 698 | found: |
d2fb3437 | 699 | return group_start; |
925baedd | 700 | } |
0f9dd46c | 701 | |
e02119d5 | 702 | /* simple helper to search for an existing extent at a given offset */ |
31840ae1 | 703 | int btrfs_lookup_extent(struct btrfs_root *root, u64 start, u64 len) |
e02119d5 CM |
704 | { |
705 | int ret; | |
706 | struct btrfs_key key; | |
31840ae1 | 707 | struct btrfs_path *path; |
e02119d5 | 708 | |
31840ae1 | 709 | path = btrfs_alloc_path(); |
d8926bb3 MF |
710 | if (!path) |
711 | return -ENOMEM; | |
712 | ||
e02119d5 CM |
713 | key.objectid = start; |
714 | key.offset = len; | |
715 | btrfs_set_key_type(&key, BTRFS_EXTENT_ITEM_KEY); | |
716 | ret = btrfs_search_slot(NULL, root->fs_info->extent_root, &key, path, | |
717 | 0, 0); | |
31840ae1 | 718 | btrfs_free_path(path); |
7bb86316 CM |
719 | return ret; |
720 | } | |
721 | ||
a22285a6 YZ |
722 | /* |
723 | * helper function to lookup reference count and flags of extent. | |
724 | * | |
725 | * the head node for delayed ref is used to store the sum of all the | |
726 | * reference count modifications queued up in the rbtree. the head | |
727 | * node may also store the extent flags to set. This way you can check | |
728 | * to see what the reference count and extent flags would be if all of | |
729 | * the delayed refs are not processed. | |
730 | */ | |
731 | int btrfs_lookup_extent_info(struct btrfs_trans_handle *trans, | |
732 | struct btrfs_root *root, u64 bytenr, | |
733 | u64 num_bytes, u64 *refs, u64 *flags) | |
734 | { | |
735 | struct btrfs_delayed_ref_head *head; | |
736 | struct btrfs_delayed_ref_root *delayed_refs; | |
737 | struct btrfs_path *path; | |
738 | struct btrfs_extent_item *ei; | |
739 | struct extent_buffer *leaf; | |
740 | struct btrfs_key key; | |
741 | u32 item_size; | |
742 | u64 num_refs; | |
743 | u64 extent_flags; | |
744 | int ret; | |
745 | ||
746 | path = btrfs_alloc_path(); | |
747 | if (!path) | |
748 | return -ENOMEM; | |
749 | ||
750 | key.objectid = bytenr; | |
751 | key.type = BTRFS_EXTENT_ITEM_KEY; | |
752 | key.offset = num_bytes; | |
753 | if (!trans) { | |
754 | path->skip_locking = 1; | |
755 | path->search_commit_root = 1; | |
756 | } | |
757 | again: | |
758 | ret = btrfs_search_slot(trans, root->fs_info->extent_root, | |
759 | &key, path, 0, 0); | |
760 | if (ret < 0) | |
761 | goto out_free; | |
762 | ||
763 | if (ret == 0) { | |
764 | leaf = path->nodes[0]; | |
765 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
766 | if (item_size >= sizeof(*ei)) { | |
767 | ei = btrfs_item_ptr(leaf, path->slots[0], | |
768 | struct btrfs_extent_item); | |
769 | num_refs = btrfs_extent_refs(leaf, ei); | |
770 | extent_flags = btrfs_extent_flags(leaf, ei); | |
771 | } else { | |
772 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
773 | struct btrfs_extent_item_v0 *ei0; | |
774 | BUG_ON(item_size != sizeof(*ei0)); | |
775 | ei0 = btrfs_item_ptr(leaf, path->slots[0], | |
776 | struct btrfs_extent_item_v0); | |
777 | num_refs = btrfs_extent_refs_v0(leaf, ei0); | |
778 | /* FIXME: this isn't correct for data */ | |
779 | extent_flags = BTRFS_BLOCK_FLAG_FULL_BACKREF; | |
780 | #else | |
781 | BUG(); | |
782 | #endif | |
783 | } | |
784 | BUG_ON(num_refs == 0); | |
785 | } else { | |
786 | num_refs = 0; | |
787 | extent_flags = 0; | |
788 | ret = 0; | |
789 | } | |
790 | ||
791 | if (!trans) | |
792 | goto out; | |
793 | ||
794 | delayed_refs = &trans->transaction->delayed_refs; | |
795 | spin_lock(&delayed_refs->lock); | |
796 | head = btrfs_find_delayed_ref_head(trans, bytenr); | |
797 | if (head) { | |
798 | if (!mutex_trylock(&head->mutex)) { | |
799 | atomic_inc(&head->node.refs); | |
800 | spin_unlock(&delayed_refs->lock); | |
801 | ||
b3b4aa74 | 802 | btrfs_release_path(path); |
a22285a6 | 803 | |
8cc33e5c DS |
804 | /* |
805 | * Mutex was contended, block until it's released and try | |
806 | * again | |
807 | */ | |
a22285a6 YZ |
808 | mutex_lock(&head->mutex); |
809 | mutex_unlock(&head->mutex); | |
810 | btrfs_put_delayed_ref(&head->node); | |
811 | goto again; | |
812 | } | |
813 | if (head->extent_op && head->extent_op->update_flags) | |
814 | extent_flags |= head->extent_op->flags_to_set; | |
815 | else | |
816 | BUG_ON(num_refs == 0); | |
817 | ||
818 | num_refs += head->node.ref_mod; | |
819 | mutex_unlock(&head->mutex); | |
820 | } | |
821 | spin_unlock(&delayed_refs->lock); | |
822 | out: | |
823 | WARN_ON(num_refs == 0); | |
824 | if (refs) | |
825 | *refs = num_refs; | |
826 | if (flags) | |
827 | *flags = extent_flags; | |
828 | out_free: | |
829 | btrfs_free_path(path); | |
830 | return ret; | |
831 | } | |
832 | ||
d8d5f3e1 CM |
833 | /* |
834 | * Back reference rules. Back refs have three main goals: | |
835 | * | |
836 | * 1) differentiate between all holders of references to an extent so that | |
837 | * when a reference is dropped we can make sure it was a valid reference | |
838 | * before freeing the extent. | |
839 | * | |
840 | * 2) Provide enough information to quickly find the holders of an extent | |
841 | * if we notice a given block is corrupted or bad. | |
842 | * | |
843 | * 3) Make it easy to migrate blocks for FS shrinking or storage pool | |
844 | * maintenance. This is actually the same as #2, but with a slightly | |
845 | * different use case. | |
846 | * | |
5d4f98a2 YZ |
847 | * There are two kinds of back refs. The implicit back refs is optimized |
848 | * for pointers in non-shared tree blocks. For a given pointer in a block, | |
849 | * back refs of this kind provide information about the block's owner tree | |
850 | * and the pointer's key. These information allow us to find the block by | |
851 | * b-tree searching. The full back refs is for pointers in tree blocks not | |
852 | * referenced by their owner trees. The location of tree block is recorded | |
853 | * in the back refs. Actually the full back refs is generic, and can be | |
854 | * used in all cases the implicit back refs is used. The major shortcoming | |
855 | * of the full back refs is its overhead. Every time a tree block gets | |
856 | * COWed, we have to update back refs entry for all pointers in it. | |
857 | * | |
858 | * For a newly allocated tree block, we use implicit back refs for | |
859 | * pointers in it. This means most tree related operations only involve | |
860 | * implicit back refs. For a tree block created in old transaction, the | |
861 | * only way to drop a reference to it is COW it. So we can detect the | |
862 | * event that tree block loses its owner tree's reference and do the | |
863 | * back refs conversion. | |
864 | * | |
865 | * When a tree block is COW'd through a tree, there are four cases: | |
866 | * | |
867 | * The reference count of the block is one and the tree is the block's | |
868 | * owner tree. Nothing to do in this case. | |
869 | * | |
870 | * The reference count of the block is one and the tree is not the | |
871 | * block's owner tree. In this case, full back refs is used for pointers | |
872 | * in the block. Remove these full back refs, add implicit back refs for | |
873 | * every pointers in the new block. | |
874 | * | |
875 | * The reference count of the block is greater than one and the tree is | |
876 | * the block's owner tree. In this case, implicit back refs is used for | |
877 | * pointers in the block. Add full back refs for every pointers in the | |
878 | * block, increase lower level extents' reference counts. The original | |
879 | * implicit back refs are entailed to the new block. | |
880 | * | |
881 | * The reference count of the block is greater than one and the tree is | |
882 | * not the block's owner tree. Add implicit back refs for every pointer in | |
883 | * the new block, increase lower level extents' reference count. | |
884 | * | |
885 | * Back Reference Key composing: | |
886 | * | |
887 | * The key objectid corresponds to the first byte in the extent, | |
888 | * The key type is used to differentiate between types of back refs. | |
889 | * There are different meanings of the key offset for different types | |
890 | * of back refs. | |
891 | * | |
d8d5f3e1 CM |
892 | * File extents can be referenced by: |
893 | * | |
894 | * - multiple snapshots, subvolumes, or different generations in one subvol | |
31840ae1 | 895 | * - different files inside a single subvolume |
d8d5f3e1 CM |
896 | * - different offsets inside a file (bookend extents in file.c) |
897 | * | |
5d4f98a2 | 898 | * The extent ref structure for the implicit back refs has fields for: |
d8d5f3e1 CM |
899 | * |
900 | * - Objectid of the subvolume root | |
d8d5f3e1 | 901 | * - objectid of the file holding the reference |
5d4f98a2 YZ |
902 | * - original offset in the file |
903 | * - how many bookend extents | |
d8d5f3e1 | 904 | * |
5d4f98a2 YZ |
905 | * The key offset for the implicit back refs is hash of the first |
906 | * three fields. | |
d8d5f3e1 | 907 | * |
5d4f98a2 | 908 | * The extent ref structure for the full back refs has field for: |
d8d5f3e1 | 909 | * |
5d4f98a2 | 910 | * - number of pointers in the tree leaf |
d8d5f3e1 | 911 | * |
5d4f98a2 YZ |
912 | * The key offset for the implicit back refs is the first byte of |
913 | * the tree leaf | |
d8d5f3e1 | 914 | * |
5d4f98a2 YZ |
915 | * When a file extent is allocated, The implicit back refs is used. |
916 | * the fields are filled in: | |
d8d5f3e1 | 917 | * |
5d4f98a2 | 918 | * (root_key.objectid, inode objectid, offset in file, 1) |
d8d5f3e1 | 919 | * |
5d4f98a2 YZ |
920 | * When a file extent is removed file truncation, we find the |
921 | * corresponding implicit back refs and check the following fields: | |
d8d5f3e1 | 922 | * |
5d4f98a2 | 923 | * (btrfs_header_owner(leaf), inode objectid, offset in file) |
d8d5f3e1 | 924 | * |
5d4f98a2 | 925 | * Btree extents can be referenced by: |
d8d5f3e1 | 926 | * |
5d4f98a2 | 927 | * - Different subvolumes |
d8d5f3e1 | 928 | * |
5d4f98a2 YZ |
929 | * Both the implicit back refs and the full back refs for tree blocks |
930 | * only consist of key. The key offset for the implicit back refs is | |
931 | * objectid of block's owner tree. The key offset for the full back refs | |
932 | * is the first byte of parent block. | |
d8d5f3e1 | 933 | * |
5d4f98a2 YZ |
934 | * When implicit back refs is used, information about the lowest key and |
935 | * level of the tree block are required. These information are stored in | |
936 | * tree block info structure. | |
d8d5f3e1 | 937 | */ |
31840ae1 | 938 | |
5d4f98a2 YZ |
939 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 |
940 | static int convert_extent_item_v0(struct btrfs_trans_handle *trans, | |
941 | struct btrfs_root *root, | |
942 | struct btrfs_path *path, | |
943 | u64 owner, u32 extra_size) | |
7bb86316 | 944 | { |
5d4f98a2 YZ |
945 | struct btrfs_extent_item *item; |
946 | struct btrfs_extent_item_v0 *ei0; | |
947 | struct btrfs_extent_ref_v0 *ref0; | |
948 | struct btrfs_tree_block_info *bi; | |
949 | struct extent_buffer *leaf; | |
7bb86316 | 950 | struct btrfs_key key; |
5d4f98a2 YZ |
951 | struct btrfs_key found_key; |
952 | u32 new_size = sizeof(*item); | |
953 | u64 refs; | |
954 | int ret; | |
955 | ||
956 | leaf = path->nodes[0]; | |
957 | BUG_ON(btrfs_item_size_nr(leaf, path->slots[0]) != sizeof(*ei0)); | |
958 | ||
959 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
960 | ei0 = btrfs_item_ptr(leaf, path->slots[0], | |
961 | struct btrfs_extent_item_v0); | |
962 | refs = btrfs_extent_refs_v0(leaf, ei0); | |
963 | ||
964 | if (owner == (u64)-1) { | |
965 | while (1) { | |
966 | if (path->slots[0] >= btrfs_header_nritems(leaf)) { | |
967 | ret = btrfs_next_leaf(root, path); | |
968 | if (ret < 0) | |
969 | return ret; | |
79787eaa | 970 | BUG_ON(ret > 0); /* Corruption */ |
5d4f98a2 YZ |
971 | leaf = path->nodes[0]; |
972 | } | |
973 | btrfs_item_key_to_cpu(leaf, &found_key, | |
974 | path->slots[0]); | |
975 | BUG_ON(key.objectid != found_key.objectid); | |
976 | if (found_key.type != BTRFS_EXTENT_REF_V0_KEY) { | |
977 | path->slots[0]++; | |
978 | continue; | |
979 | } | |
980 | ref0 = btrfs_item_ptr(leaf, path->slots[0], | |
981 | struct btrfs_extent_ref_v0); | |
982 | owner = btrfs_ref_objectid_v0(leaf, ref0); | |
983 | break; | |
984 | } | |
985 | } | |
b3b4aa74 | 986 | btrfs_release_path(path); |
5d4f98a2 YZ |
987 | |
988 | if (owner < BTRFS_FIRST_FREE_OBJECTID) | |
989 | new_size += sizeof(*bi); | |
990 | ||
991 | new_size -= sizeof(*ei0); | |
992 | ret = btrfs_search_slot(trans, root, &key, path, | |
993 | new_size + extra_size, 1); | |
994 | if (ret < 0) | |
995 | return ret; | |
79787eaa | 996 | BUG_ON(ret); /* Corruption */ |
5d4f98a2 | 997 | |
143bede5 | 998 | btrfs_extend_item(trans, root, path, new_size); |
5d4f98a2 YZ |
999 | |
1000 | leaf = path->nodes[0]; | |
1001 | item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); | |
1002 | btrfs_set_extent_refs(leaf, item, refs); | |
1003 | /* FIXME: get real generation */ | |
1004 | btrfs_set_extent_generation(leaf, item, 0); | |
1005 | if (owner < BTRFS_FIRST_FREE_OBJECTID) { | |
1006 | btrfs_set_extent_flags(leaf, item, | |
1007 | BTRFS_EXTENT_FLAG_TREE_BLOCK | | |
1008 | BTRFS_BLOCK_FLAG_FULL_BACKREF); | |
1009 | bi = (struct btrfs_tree_block_info *)(item + 1); | |
1010 | /* FIXME: get first key of the block */ | |
1011 | memset_extent_buffer(leaf, 0, (unsigned long)bi, sizeof(*bi)); | |
1012 | btrfs_set_tree_block_level(leaf, bi, (int)owner); | |
1013 | } else { | |
1014 | btrfs_set_extent_flags(leaf, item, BTRFS_EXTENT_FLAG_DATA); | |
1015 | } | |
1016 | btrfs_mark_buffer_dirty(leaf); | |
1017 | return 0; | |
1018 | } | |
1019 | #endif | |
1020 | ||
1021 | static u64 hash_extent_data_ref(u64 root_objectid, u64 owner, u64 offset) | |
1022 | { | |
1023 | u32 high_crc = ~(u32)0; | |
1024 | u32 low_crc = ~(u32)0; | |
1025 | __le64 lenum; | |
1026 | ||
1027 | lenum = cpu_to_le64(root_objectid); | |
163e783e | 1028 | high_crc = crc32c(high_crc, &lenum, sizeof(lenum)); |
5d4f98a2 | 1029 | lenum = cpu_to_le64(owner); |
163e783e | 1030 | low_crc = crc32c(low_crc, &lenum, sizeof(lenum)); |
5d4f98a2 | 1031 | lenum = cpu_to_le64(offset); |
163e783e | 1032 | low_crc = crc32c(low_crc, &lenum, sizeof(lenum)); |
5d4f98a2 YZ |
1033 | |
1034 | return ((u64)high_crc << 31) ^ (u64)low_crc; | |
1035 | } | |
1036 | ||
1037 | static u64 hash_extent_data_ref_item(struct extent_buffer *leaf, | |
1038 | struct btrfs_extent_data_ref *ref) | |
1039 | { | |
1040 | return hash_extent_data_ref(btrfs_extent_data_ref_root(leaf, ref), | |
1041 | btrfs_extent_data_ref_objectid(leaf, ref), | |
1042 | btrfs_extent_data_ref_offset(leaf, ref)); | |
1043 | } | |
1044 | ||
1045 | static int match_extent_data_ref(struct extent_buffer *leaf, | |
1046 | struct btrfs_extent_data_ref *ref, | |
1047 | u64 root_objectid, u64 owner, u64 offset) | |
1048 | { | |
1049 | if (btrfs_extent_data_ref_root(leaf, ref) != root_objectid || | |
1050 | btrfs_extent_data_ref_objectid(leaf, ref) != owner || | |
1051 | btrfs_extent_data_ref_offset(leaf, ref) != offset) | |
1052 | return 0; | |
1053 | return 1; | |
1054 | } | |
1055 | ||
1056 | static noinline int lookup_extent_data_ref(struct btrfs_trans_handle *trans, | |
1057 | struct btrfs_root *root, | |
1058 | struct btrfs_path *path, | |
1059 | u64 bytenr, u64 parent, | |
1060 | u64 root_objectid, | |
1061 | u64 owner, u64 offset) | |
1062 | { | |
1063 | struct btrfs_key key; | |
1064 | struct btrfs_extent_data_ref *ref; | |
31840ae1 | 1065 | struct extent_buffer *leaf; |
5d4f98a2 | 1066 | u32 nritems; |
74493f7a | 1067 | int ret; |
5d4f98a2 YZ |
1068 | int recow; |
1069 | int err = -ENOENT; | |
74493f7a | 1070 | |
31840ae1 | 1071 | key.objectid = bytenr; |
5d4f98a2 YZ |
1072 | if (parent) { |
1073 | key.type = BTRFS_SHARED_DATA_REF_KEY; | |
1074 | key.offset = parent; | |
1075 | } else { | |
1076 | key.type = BTRFS_EXTENT_DATA_REF_KEY; | |
1077 | key.offset = hash_extent_data_ref(root_objectid, | |
1078 | owner, offset); | |
1079 | } | |
1080 | again: | |
1081 | recow = 0; | |
1082 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); | |
1083 | if (ret < 0) { | |
1084 | err = ret; | |
1085 | goto fail; | |
1086 | } | |
31840ae1 | 1087 | |
5d4f98a2 YZ |
1088 | if (parent) { |
1089 | if (!ret) | |
1090 | return 0; | |
1091 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
1092 | key.type = BTRFS_EXTENT_REF_V0_KEY; | |
b3b4aa74 | 1093 | btrfs_release_path(path); |
5d4f98a2 YZ |
1094 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); |
1095 | if (ret < 0) { | |
1096 | err = ret; | |
1097 | goto fail; | |
1098 | } | |
1099 | if (!ret) | |
1100 | return 0; | |
1101 | #endif | |
1102 | goto fail; | |
31840ae1 ZY |
1103 | } |
1104 | ||
1105 | leaf = path->nodes[0]; | |
5d4f98a2 YZ |
1106 | nritems = btrfs_header_nritems(leaf); |
1107 | while (1) { | |
1108 | if (path->slots[0] >= nritems) { | |
1109 | ret = btrfs_next_leaf(root, path); | |
1110 | if (ret < 0) | |
1111 | err = ret; | |
1112 | if (ret) | |
1113 | goto fail; | |
1114 | ||
1115 | leaf = path->nodes[0]; | |
1116 | nritems = btrfs_header_nritems(leaf); | |
1117 | recow = 1; | |
1118 | } | |
1119 | ||
1120 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
1121 | if (key.objectid != bytenr || | |
1122 | key.type != BTRFS_EXTENT_DATA_REF_KEY) | |
1123 | goto fail; | |
1124 | ||
1125 | ref = btrfs_item_ptr(leaf, path->slots[0], | |
1126 | struct btrfs_extent_data_ref); | |
1127 | ||
1128 | if (match_extent_data_ref(leaf, ref, root_objectid, | |
1129 | owner, offset)) { | |
1130 | if (recow) { | |
b3b4aa74 | 1131 | btrfs_release_path(path); |
5d4f98a2 YZ |
1132 | goto again; |
1133 | } | |
1134 | err = 0; | |
1135 | break; | |
1136 | } | |
1137 | path->slots[0]++; | |
31840ae1 | 1138 | } |
5d4f98a2 YZ |
1139 | fail: |
1140 | return err; | |
31840ae1 ZY |
1141 | } |
1142 | ||
5d4f98a2 YZ |
1143 | static noinline int insert_extent_data_ref(struct btrfs_trans_handle *trans, |
1144 | struct btrfs_root *root, | |
1145 | struct btrfs_path *path, | |
1146 | u64 bytenr, u64 parent, | |
1147 | u64 root_objectid, u64 owner, | |
1148 | u64 offset, int refs_to_add) | |
31840ae1 ZY |
1149 | { |
1150 | struct btrfs_key key; | |
1151 | struct extent_buffer *leaf; | |
5d4f98a2 | 1152 | u32 size; |
31840ae1 ZY |
1153 | u32 num_refs; |
1154 | int ret; | |
74493f7a | 1155 | |
74493f7a | 1156 | key.objectid = bytenr; |
5d4f98a2 YZ |
1157 | if (parent) { |
1158 | key.type = BTRFS_SHARED_DATA_REF_KEY; | |
1159 | key.offset = parent; | |
1160 | size = sizeof(struct btrfs_shared_data_ref); | |
1161 | } else { | |
1162 | key.type = BTRFS_EXTENT_DATA_REF_KEY; | |
1163 | key.offset = hash_extent_data_ref(root_objectid, | |
1164 | owner, offset); | |
1165 | size = sizeof(struct btrfs_extent_data_ref); | |
1166 | } | |
74493f7a | 1167 | |
5d4f98a2 YZ |
1168 | ret = btrfs_insert_empty_item(trans, root, path, &key, size); |
1169 | if (ret && ret != -EEXIST) | |
1170 | goto fail; | |
1171 | ||
1172 | leaf = path->nodes[0]; | |
1173 | if (parent) { | |
1174 | struct btrfs_shared_data_ref *ref; | |
31840ae1 | 1175 | ref = btrfs_item_ptr(leaf, path->slots[0], |
5d4f98a2 YZ |
1176 | struct btrfs_shared_data_ref); |
1177 | if (ret == 0) { | |
1178 | btrfs_set_shared_data_ref_count(leaf, ref, refs_to_add); | |
1179 | } else { | |
1180 | num_refs = btrfs_shared_data_ref_count(leaf, ref); | |
1181 | num_refs += refs_to_add; | |
1182 | btrfs_set_shared_data_ref_count(leaf, ref, num_refs); | |
31840ae1 | 1183 | } |
5d4f98a2 YZ |
1184 | } else { |
1185 | struct btrfs_extent_data_ref *ref; | |
1186 | while (ret == -EEXIST) { | |
1187 | ref = btrfs_item_ptr(leaf, path->slots[0], | |
1188 | struct btrfs_extent_data_ref); | |
1189 | if (match_extent_data_ref(leaf, ref, root_objectid, | |
1190 | owner, offset)) | |
1191 | break; | |
b3b4aa74 | 1192 | btrfs_release_path(path); |
5d4f98a2 YZ |
1193 | key.offset++; |
1194 | ret = btrfs_insert_empty_item(trans, root, path, &key, | |
1195 | size); | |
1196 | if (ret && ret != -EEXIST) | |
1197 | goto fail; | |
31840ae1 | 1198 | |
5d4f98a2 YZ |
1199 | leaf = path->nodes[0]; |
1200 | } | |
1201 | ref = btrfs_item_ptr(leaf, path->slots[0], | |
1202 | struct btrfs_extent_data_ref); | |
1203 | if (ret == 0) { | |
1204 | btrfs_set_extent_data_ref_root(leaf, ref, | |
1205 | root_objectid); | |
1206 | btrfs_set_extent_data_ref_objectid(leaf, ref, owner); | |
1207 | btrfs_set_extent_data_ref_offset(leaf, ref, offset); | |
1208 | btrfs_set_extent_data_ref_count(leaf, ref, refs_to_add); | |
1209 | } else { | |
1210 | num_refs = btrfs_extent_data_ref_count(leaf, ref); | |
1211 | num_refs += refs_to_add; | |
1212 | btrfs_set_extent_data_ref_count(leaf, ref, num_refs); | |
31840ae1 | 1213 | } |
31840ae1 | 1214 | } |
5d4f98a2 YZ |
1215 | btrfs_mark_buffer_dirty(leaf); |
1216 | ret = 0; | |
1217 | fail: | |
b3b4aa74 | 1218 | btrfs_release_path(path); |
7bb86316 | 1219 | return ret; |
74493f7a CM |
1220 | } |
1221 | ||
5d4f98a2 YZ |
1222 | static noinline int remove_extent_data_ref(struct btrfs_trans_handle *trans, |
1223 | struct btrfs_root *root, | |
1224 | struct btrfs_path *path, | |
1225 | int refs_to_drop) | |
31840ae1 | 1226 | { |
5d4f98a2 YZ |
1227 | struct btrfs_key key; |
1228 | struct btrfs_extent_data_ref *ref1 = NULL; | |
1229 | struct btrfs_shared_data_ref *ref2 = NULL; | |
31840ae1 | 1230 | struct extent_buffer *leaf; |
5d4f98a2 | 1231 | u32 num_refs = 0; |
31840ae1 ZY |
1232 | int ret = 0; |
1233 | ||
1234 | leaf = path->nodes[0]; | |
5d4f98a2 YZ |
1235 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); |
1236 | ||
1237 | if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { | |
1238 | ref1 = btrfs_item_ptr(leaf, path->slots[0], | |
1239 | struct btrfs_extent_data_ref); | |
1240 | num_refs = btrfs_extent_data_ref_count(leaf, ref1); | |
1241 | } else if (key.type == BTRFS_SHARED_DATA_REF_KEY) { | |
1242 | ref2 = btrfs_item_ptr(leaf, path->slots[0], | |
1243 | struct btrfs_shared_data_ref); | |
1244 | num_refs = btrfs_shared_data_ref_count(leaf, ref2); | |
1245 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
1246 | } else if (key.type == BTRFS_EXTENT_REF_V0_KEY) { | |
1247 | struct btrfs_extent_ref_v0 *ref0; | |
1248 | ref0 = btrfs_item_ptr(leaf, path->slots[0], | |
1249 | struct btrfs_extent_ref_v0); | |
1250 | num_refs = btrfs_ref_count_v0(leaf, ref0); | |
1251 | #endif | |
1252 | } else { | |
1253 | BUG(); | |
1254 | } | |
1255 | ||
56bec294 CM |
1256 | BUG_ON(num_refs < refs_to_drop); |
1257 | num_refs -= refs_to_drop; | |
5d4f98a2 | 1258 | |
31840ae1 ZY |
1259 | if (num_refs == 0) { |
1260 | ret = btrfs_del_item(trans, root, path); | |
1261 | } else { | |
5d4f98a2 YZ |
1262 | if (key.type == BTRFS_EXTENT_DATA_REF_KEY) |
1263 | btrfs_set_extent_data_ref_count(leaf, ref1, num_refs); | |
1264 | else if (key.type == BTRFS_SHARED_DATA_REF_KEY) | |
1265 | btrfs_set_shared_data_ref_count(leaf, ref2, num_refs); | |
1266 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
1267 | else { | |
1268 | struct btrfs_extent_ref_v0 *ref0; | |
1269 | ref0 = btrfs_item_ptr(leaf, path->slots[0], | |
1270 | struct btrfs_extent_ref_v0); | |
1271 | btrfs_set_ref_count_v0(leaf, ref0, num_refs); | |
1272 | } | |
1273 | #endif | |
31840ae1 ZY |
1274 | btrfs_mark_buffer_dirty(leaf); |
1275 | } | |
31840ae1 ZY |
1276 | return ret; |
1277 | } | |
1278 | ||
5d4f98a2 YZ |
1279 | static noinline u32 extent_data_ref_count(struct btrfs_root *root, |
1280 | struct btrfs_path *path, | |
1281 | struct btrfs_extent_inline_ref *iref) | |
15916de8 | 1282 | { |
5d4f98a2 YZ |
1283 | struct btrfs_key key; |
1284 | struct extent_buffer *leaf; | |
1285 | struct btrfs_extent_data_ref *ref1; | |
1286 | struct btrfs_shared_data_ref *ref2; | |
1287 | u32 num_refs = 0; | |
1288 | ||
1289 | leaf = path->nodes[0]; | |
1290 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
1291 | if (iref) { | |
1292 | if (btrfs_extent_inline_ref_type(leaf, iref) == | |
1293 | BTRFS_EXTENT_DATA_REF_KEY) { | |
1294 | ref1 = (struct btrfs_extent_data_ref *)(&iref->offset); | |
1295 | num_refs = btrfs_extent_data_ref_count(leaf, ref1); | |
1296 | } else { | |
1297 | ref2 = (struct btrfs_shared_data_ref *)(iref + 1); | |
1298 | num_refs = btrfs_shared_data_ref_count(leaf, ref2); | |
1299 | } | |
1300 | } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { | |
1301 | ref1 = btrfs_item_ptr(leaf, path->slots[0], | |
1302 | struct btrfs_extent_data_ref); | |
1303 | num_refs = btrfs_extent_data_ref_count(leaf, ref1); | |
1304 | } else if (key.type == BTRFS_SHARED_DATA_REF_KEY) { | |
1305 | ref2 = btrfs_item_ptr(leaf, path->slots[0], | |
1306 | struct btrfs_shared_data_ref); | |
1307 | num_refs = btrfs_shared_data_ref_count(leaf, ref2); | |
1308 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
1309 | } else if (key.type == BTRFS_EXTENT_REF_V0_KEY) { | |
1310 | struct btrfs_extent_ref_v0 *ref0; | |
1311 | ref0 = btrfs_item_ptr(leaf, path->slots[0], | |
1312 | struct btrfs_extent_ref_v0); | |
1313 | num_refs = btrfs_ref_count_v0(leaf, ref0); | |
4b4e25f2 | 1314 | #endif |
5d4f98a2 YZ |
1315 | } else { |
1316 | WARN_ON(1); | |
1317 | } | |
1318 | return num_refs; | |
1319 | } | |
15916de8 | 1320 | |
5d4f98a2 YZ |
1321 | static noinline int lookup_tree_block_ref(struct btrfs_trans_handle *trans, |
1322 | struct btrfs_root *root, | |
1323 | struct btrfs_path *path, | |
1324 | u64 bytenr, u64 parent, | |
1325 | u64 root_objectid) | |
1f3c79a2 | 1326 | { |
5d4f98a2 | 1327 | struct btrfs_key key; |
1f3c79a2 | 1328 | int ret; |
1f3c79a2 | 1329 | |
5d4f98a2 YZ |
1330 | key.objectid = bytenr; |
1331 | if (parent) { | |
1332 | key.type = BTRFS_SHARED_BLOCK_REF_KEY; | |
1333 | key.offset = parent; | |
1334 | } else { | |
1335 | key.type = BTRFS_TREE_BLOCK_REF_KEY; | |
1336 | key.offset = root_objectid; | |
1f3c79a2 LH |
1337 | } |
1338 | ||
5d4f98a2 YZ |
1339 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); |
1340 | if (ret > 0) | |
1341 | ret = -ENOENT; | |
1342 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
1343 | if (ret == -ENOENT && parent) { | |
b3b4aa74 | 1344 | btrfs_release_path(path); |
5d4f98a2 YZ |
1345 | key.type = BTRFS_EXTENT_REF_V0_KEY; |
1346 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); | |
1347 | if (ret > 0) | |
1348 | ret = -ENOENT; | |
1349 | } | |
1f3c79a2 | 1350 | #endif |
5d4f98a2 | 1351 | return ret; |
1f3c79a2 LH |
1352 | } |
1353 | ||
5d4f98a2 YZ |
1354 | static noinline int insert_tree_block_ref(struct btrfs_trans_handle *trans, |
1355 | struct btrfs_root *root, | |
1356 | struct btrfs_path *path, | |
1357 | u64 bytenr, u64 parent, | |
1358 | u64 root_objectid) | |
31840ae1 | 1359 | { |
5d4f98a2 | 1360 | struct btrfs_key key; |
31840ae1 | 1361 | int ret; |
31840ae1 | 1362 | |
5d4f98a2 YZ |
1363 | key.objectid = bytenr; |
1364 | if (parent) { | |
1365 | key.type = BTRFS_SHARED_BLOCK_REF_KEY; | |
1366 | key.offset = parent; | |
1367 | } else { | |
1368 | key.type = BTRFS_TREE_BLOCK_REF_KEY; | |
1369 | key.offset = root_objectid; | |
1370 | } | |
1371 | ||
1372 | ret = btrfs_insert_empty_item(trans, root, path, &key, 0); | |
b3b4aa74 | 1373 | btrfs_release_path(path); |
31840ae1 ZY |
1374 | return ret; |
1375 | } | |
1376 | ||
5d4f98a2 | 1377 | static inline int extent_ref_type(u64 parent, u64 owner) |
31840ae1 | 1378 | { |
5d4f98a2 YZ |
1379 | int type; |
1380 | if (owner < BTRFS_FIRST_FREE_OBJECTID) { | |
1381 | if (parent > 0) | |
1382 | type = BTRFS_SHARED_BLOCK_REF_KEY; | |
1383 | else | |
1384 | type = BTRFS_TREE_BLOCK_REF_KEY; | |
1385 | } else { | |
1386 | if (parent > 0) | |
1387 | type = BTRFS_SHARED_DATA_REF_KEY; | |
1388 | else | |
1389 | type = BTRFS_EXTENT_DATA_REF_KEY; | |
1390 | } | |
1391 | return type; | |
31840ae1 | 1392 | } |
56bec294 | 1393 | |
2c47e605 YZ |
1394 | static int find_next_key(struct btrfs_path *path, int level, |
1395 | struct btrfs_key *key) | |
56bec294 | 1396 | |
02217ed2 | 1397 | { |
2c47e605 | 1398 | for (; level < BTRFS_MAX_LEVEL; level++) { |
5d4f98a2 YZ |
1399 | if (!path->nodes[level]) |
1400 | break; | |
5d4f98a2 YZ |
1401 | if (path->slots[level] + 1 >= |
1402 | btrfs_header_nritems(path->nodes[level])) | |
1403 | continue; | |
1404 | if (level == 0) | |
1405 | btrfs_item_key_to_cpu(path->nodes[level], key, | |
1406 | path->slots[level] + 1); | |
1407 | else | |
1408 | btrfs_node_key_to_cpu(path->nodes[level], key, | |
1409 | path->slots[level] + 1); | |
1410 | return 0; | |
1411 | } | |
1412 | return 1; | |
1413 | } | |
037e6390 | 1414 | |
5d4f98a2 YZ |
1415 | /* |
1416 | * look for inline back ref. if back ref is found, *ref_ret is set | |
1417 | * to the address of inline back ref, and 0 is returned. | |
1418 | * | |
1419 | * if back ref isn't found, *ref_ret is set to the address where it | |
1420 | * should be inserted, and -ENOENT is returned. | |
1421 | * | |
1422 | * if insert is true and there are too many inline back refs, the path | |
1423 | * points to the extent item, and -EAGAIN is returned. | |
1424 | * | |
1425 | * NOTE: inline back refs are ordered in the same way that back ref | |
1426 | * items in the tree are ordered. | |
1427 | */ | |
1428 | static noinline_for_stack | |
1429 | int lookup_inline_extent_backref(struct btrfs_trans_handle *trans, | |
1430 | struct btrfs_root *root, | |
1431 | struct btrfs_path *path, | |
1432 | struct btrfs_extent_inline_ref **ref_ret, | |
1433 | u64 bytenr, u64 num_bytes, | |
1434 | u64 parent, u64 root_objectid, | |
1435 | u64 owner, u64 offset, int insert) | |
1436 | { | |
1437 | struct btrfs_key key; | |
1438 | struct extent_buffer *leaf; | |
1439 | struct btrfs_extent_item *ei; | |
1440 | struct btrfs_extent_inline_ref *iref; | |
1441 | u64 flags; | |
1442 | u64 item_size; | |
1443 | unsigned long ptr; | |
1444 | unsigned long end; | |
1445 | int extra_size; | |
1446 | int type; | |
1447 | int want; | |
1448 | int ret; | |
1449 | int err = 0; | |
26b8003f | 1450 | |
db94535d | 1451 | key.objectid = bytenr; |
31840ae1 | 1452 | key.type = BTRFS_EXTENT_ITEM_KEY; |
56bec294 | 1453 | key.offset = num_bytes; |
31840ae1 | 1454 | |
5d4f98a2 YZ |
1455 | want = extent_ref_type(parent, owner); |
1456 | if (insert) { | |
1457 | extra_size = btrfs_extent_inline_ref_size(want); | |
85d4198e | 1458 | path->keep_locks = 1; |
5d4f98a2 YZ |
1459 | } else |
1460 | extra_size = -1; | |
1461 | ret = btrfs_search_slot(trans, root, &key, path, extra_size, 1); | |
b9473439 | 1462 | if (ret < 0) { |
5d4f98a2 YZ |
1463 | err = ret; |
1464 | goto out; | |
1465 | } | |
79787eaa JM |
1466 | if (ret && !insert) { |
1467 | err = -ENOENT; | |
1468 | goto out; | |
1469 | } | |
1470 | BUG_ON(ret); /* Corruption */ | |
5d4f98a2 YZ |
1471 | |
1472 | leaf = path->nodes[0]; | |
1473 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
1474 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
1475 | if (item_size < sizeof(*ei)) { | |
1476 | if (!insert) { | |
1477 | err = -ENOENT; | |
1478 | goto out; | |
1479 | } | |
1480 | ret = convert_extent_item_v0(trans, root, path, owner, | |
1481 | extra_size); | |
1482 | if (ret < 0) { | |
1483 | err = ret; | |
1484 | goto out; | |
1485 | } | |
1486 | leaf = path->nodes[0]; | |
1487 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
1488 | } | |
1489 | #endif | |
1490 | BUG_ON(item_size < sizeof(*ei)); | |
1491 | ||
5d4f98a2 YZ |
1492 | ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); |
1493 | flags = btrfs_extent_flags(leaf, ei); | |
1494 | ||
1495 | ptr = (unsigned long)(ei + 1); | |
1496 | end = (unsigned long)ei + item_size; | |
1497 | ||
1498 | if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { | |
1499 | ptr += sizeof(struct btrfs_tree_block_info); | |
1500 | BUG_ON(ptr > end); | |
1501 | } else { | |
1502 | BUG_ON(!(flags & BTRFS_EXTENT_FLAG_DATA)); | |
1503 | } | |
1504 | ||
1505 | err = -ENOENT; | |
1506 | while (1) { | |
1507 | if (ptr >= end) { | |
1508 | WARN_ON(ptr > end); | |
1509 | break; | |
1510 | } | |
1511 | iref = (struct btrfs_extent_inline_ref *)ptr; | |
1512 | type = btrfs_extent_inline_ref_type(leaf, iref); | |
1513 | if (want < type) | |
1514 | break; | |
1515 | if (want > type) { | |
1516 | ptr += btrfs_extent_inline_ref_size(type); | |
1517 | continue; | |
1518 | } | |
1519 | ||
1520 | if (type == BTRFS_EXTENT_DATA_REF_KEY) { | |
1521 | struct btrfs_extent_data_ref *dref; | |
1522 | dref = (struct btrfs_extent_data_ref *)(&iref->offset); | |
1523 | if (match_extent_data_ref(leaf, dref, root_objectid, | |
1524 | owner, offset)) { | |
1525 | err = 0; | |
1526 | break; | |
1527 | } | |
1528 | if (hash_extent_data_ref_item(leaf, dref) < | |
1529 | hash_extent_data_ref(root_objectid, owner, offset)) | |
1530 | break; | |
1531 | } else { | |
1532 | u64 ref_offset; | |
1533 | ref_offset = btrfs_extent_inline_ref_offset(leaf, iref); | |
1534 | if (parent > 0) { | |
1535 | if (parent == ref_offset) { | |
1536 | err = 0; | |
1537 | break; | |
1538 | } | |
1539 | if (ref_offset < parent) | |
1540 | break; | |
1541 | } else { | |
1542 | if (root_objectid == ref_offset) { | |
1543 | err = 0; | |
1544 | break; | |
1545 | } | |
1546 | if (ref_offset < root_objectid) | |
1547 | break; | |
1548 | } | |
1549 | } | |
1550 | ptr += btrfs_extent_inline_ref_size(type); | |
1551 | } | |
1552 | if (err == -ENOENT && insert) { | |
1553 | if (item_size + extra_size >= | |
1554 | BTRFS_MAX_EXTENT_ITEM_SIZE(root)) { | |
1555 | err = -EAGAIN; | |
1556 | goto out; | |
1557 | } | |
1558 | /* | |
1559 | * To add new inline back ref, we have to make sure | |
1560 | * there is no corresponding back ref item. | |
1561 | * For simplicity, we just do not add new inline back | |
1562 | * ref if there is any kind of item for this block | |
1563 | */ | |
2c47e605 YZ |
1564 | if (find_next_key(path, 0, &key) == 0 && |
1565 | key.objectid == bytenr && | |
85d4198e | 1566 | key.type < BTRFS_BLOCK_GROUP_ITEM_KEY) { |
5d4f98a2 YZ |
1567 | err = -EAGAIN; |
1568 | goto out; | |
1569 | } | |
1570 | } | |
1571 | *ref_ret = (struct btrfs_extent_inline_ref *)ptr; | |
1572 | out: | |
85d4198e | 1573 | if (insert) { |
5d4f98a2 YZ |
1574 | path->keep_locks = 0; |
1575 | btrfs_unlock_up_safe(path, 1); | |
1576 | } | |
1577 | return err; | |
1578 | } | |
1579 | ||
1580 | /* | |
1581 | * helper to add new inline back ref | |
1582 | */ | |
1583 | static noinline_for_stack | |
143bede5 JM |
1584 | void setup_inline_extent_backref(struct btrfs_trans_handle *trans, |
1585 | struct btrfs_root *root, | |
1586 | struct btrfs_path *path, | |
1587 | struct btrfs_extent_inline_ref *iref, | |
1588 | u64 parent, u64 root_objectid, | |
1589 | u64 owner, u64 offset, int refs_to_add, | |
1590 | struct btrfs_delayed_extent_op *extent_op) | |
5d4f98a2 YZ |
1591 | { |
1592 | struct extent_buffer *leaf; | |
1593 | struct btrfs_extent_item *ei; | |
1594 | unsigned long ptr; | |
1595 | unsigned long end; | |
1596 | unsigned long item_offset; | |
1597 | u64 refs; | |
1598 | int size; | |
1599 | int type; | |
5d4f98a2 YZ |
1600 | |
1601 | leaf = path->nodes[0]; | |
1602 | ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); | |
1603 | item_offset = (unsigned long)iref - (unsigned long)ei; | |
1604 | ||
1605 | type = extent_ref_type(parent, owner); | |
1606 | size = btrfs_extent_inline_ref_size(type); | |
1607 | ||
143bede5 | 1608 | btrfs_extend_item(trans, root, path, size); |
5d4f98a2 YZ |
1609 | |
1610 | ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); | |
1611 | refs = btrfs_extent_refs(leaf, ei); | |
1612 | refs += refs_to_add; | |
1613 | btrfs_set_extent_refs(leaf, ei, refs); | |
1614 | if (extent_op) | |
1615 | __run_delayed_extent_op(extent_op, leaf, ei); | |
1616 | ||
1617 | ptr = (unsigned long)ei + item_offset; | |
1618 | end = (unsigned long)ei + btrfs_item_size_nr(leaf, path->slots[0]); | |
1619 | if (ptr < end - size) | |
1620 | memmove_extent_buffer(leaf, ptr + size, ptr, | |
1621 | end - size - ptr); | |
1622 | ||
1623 | iref = (struct btrfs_extent_inline_ref *)ptr; | |
1624 | btrfs_set_extent_inline_ref_type(leaf, iref, type); | |
1625 | if (type == BTRFS_EXTENT_DATA_REF_KEY) { | |
1626 | struct btrfs_extent_data_ref *dref; | |
1627 | dref = (struct btrfs_extent_data_ref *)(&iref->offset); | |
1628 | btrfs_set_extent_data_ref_root(leaf, dref, root_objectid); | |
1629 | btrfs_set_extent_data_ref_objectid(leaf, dref, owner); | |
1630 | btrfs_set_extent_data_ref_offset(leaf, dref, offset); | |
1631 | btrfs_set_extent_data_ref_count(leaf, dref, refs_to_add); | |
1632 | } else if (type == BTRFS_SHARED_DATA_REF_KEY) { | |
1633 | struct btrfs_shared_data_ref *sref; | |
1634 | sref = (struct btrfs_shared_data_ref *)(iref + 1); | |
1635 | btrfs_set_shared_data_ref_count(leaf, sref, refs_to_add); | |
1636 | btrfs_set_extent_inline_ref_offset(leaf, iref, parent); | |
1637 | } else if (type == BTRFS_SHARED_BLOCK_REF_KEY) { | |
1638 | btrfs_set_extent_inline_ref_offset(leaf, iref, parent); | |
1639 | } else { | |
1640 | btrfs_set_extent_inline_ref_offset(leaf, iref, root_objectid); | |
1641 | } | |
1642 | btrfs_mark_buffer_dirty(leaf); | |
5d4f98a2 YZ |
1643 | } |
1644 | ||
1645 | static int lookup_extent_backref(struct btrfs_trans_handle *trans, | |
1646 | struct btrfs_root *root, | |
1647 | struct btrfs_path *path, | |
1648 | struct btrfs_extent_inline_ref **ref_ret, | |
1649 | u64 bytenr, u64 num_bytes, u64 parent, | |
1650 | u64 root_objectid, u64 owner, u64 offset) | |
1651 | { | |
1652 | int ret; | |
1653 | ||
1654 | ret = lookup_inline_extent_backref(trans, root, path, ref_ret, | |
1655 | bytenr, num_bytes, parent, | |
1656 | root_objectid, owner, offset, 0); | |
1657 | if (ret != -ENOENT) | |
54aa1f4d | 1658 | return ret; |
5d4f98a2 | 1659 | |
b3b4aa74 | 1660 | btrfs_release_path(path); |
5d4f98a2 YZ |
1661 | *ref_ret = NULL; |
1662 | ||
1663 | if (owner < BTRFS_FIRST_FREE_OBJECTID) { | |
1664 | ret = lookup_tree_block_ref(trans, root, path, bytenr, parent, | |
1665 | root_objectid); | |
1666 | } else { | |
1667 | ret = lookup_extent_data_ref(trans, root, path, bytenr, parent, | |
1668 | root_objectid, owner, offset); | |
b9473439 | 1669 | } |
5d4f98a2 YZ |
1670 | return ret; |
1671 | } | |
31840ae1 | 1672 | |
5d4f98a2 YZ |
1673 | /* |
1674 | * helper to update/remove inline back ref | |
1675 | */ | |
1676 | static noinline_for_stack | |
143bede5 JM |
1677 | void update_inline_extent_backref(struct btrfs_trans_handle *trans, |
1678 | struct btrfs_root *root, | |
1679 | struct btrfs_path *path, | |
1680 | struct btrfs_extent_inline_ref *iref, | |
1681 | int refs_to_mod, | |
1682 | struct btrfs_delayed_extent_op *extent_op) | |
5d4f98a2 YZ |
1683 | { |
1684 | struct extent_buffer *leaf; | |
1685 | struct btrfs_extent_item *ei; | |
1686 | struct btrfs_extent_data_ref *dref = NULL; | |
1687 | struct btrfs_shared_data_ref *sref = NULL; | |
1688 | unsigned long ptr; | |
1689 | unsigned long end; | |
1690 | u32 item_size; | |
1691 | int size; | |
1692 | int type; | |
5d4f98a2 YZ |
1693 | u64 refs; |
1694 | ||
1695 | leaf = path->nodes[0]; | |
1696 | ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); | |
1697 | refs = btrfs_extent_refs(leaf, ei); | |
1698 | WARN_ON(refs_to_mod < 0 && refs + refs_to_mod <= 0); | |
1699 | refs += refs_to_mod; | |
1700 | btrfs_set_extent_refs(leaf, ei, refs); | |
1701 | if (extent_op) | |
1702 | __run_delayed_extent_op(extent_op, leaf, ei); | |
1703 | ||
1704 | type = btrfs_extent_inline_ref_type(leaf, iref); | |
1705 | ||
1706 | if (type == BTRFS_EXTENT_DATA_REF_KEY) { | |
1707 | dref = (struct btrfs_extent_data_ref *)(&iref->offset); | |
1708 | refs = btrfs_extent_data_ref_count(leaf, dref); | |
1709 | } else if (type == BTRFS_SHARED_DATA_REF_KEY) { | |
1710 | sref = (struct btrfs_shared_data_ref *)(iref + 1); | |
1711 | refs = btrfs_shared_data_ref_count(leaf, sref); | |
1712 | } else { | |
1713 | refs = 1; | |
1714 | BUG_ON(refs_to_mod != -1); | |
56bec294 | 1715 | } |
31840ae1 | 1716 | |
5d4f98a2 YZ |
1717 | BUG_ON(refs_to_mod < 0 && refs < -refs_to_mod); |
1718 | refs += refs_to_mod; | |
1719 | ||
1720 | if (refs > 0) { | |
1721 | if (type == BTRFS_EXTENT_DATA_REF_KEY) | |
1722 | btrfs_set_extent_data_ref_count(leaf, dref, refs); | |
1723 | else | |
1724 | btrfs_set_shared_data_ref_count(leaf, sref, refs); | |
1725 | } else { | |
1726 | size = btrfs_extent_inline_ref_size(type); | |
1727 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
1728 | ptr = (unsigned long)iref; | |
1729 | end = (unsigned long)ei + item_size; | |
1730 | if (ptr + size < end) | |
1731 | memmove_extent_buffer(leaf, ptr, ptr + size, | |
1732 | end - ptr - size); | |
1733 | item_size -= size; | |
143bede5 | 1734 | btrfs_truncate_item(trans, root, path, item_size, 1); |
5d4f98a2 YZ |
1735 | } |
1736 | btrfs_mark_buffer_dirty(leaf); | |
5d4f98a2 YZ |
1737 | } |
1738 | ||
1739 | static noinline_for_stack | |
1740 | int insert_inline_extent_backref(struct btrfs_trans_handle *trans, | |
1741 | struct btrfs_root *root, | |
1742 | struct btrfs_path *path, | |
1743 | u64 bytenr, u64 num_bytes, u64 parent, | |
1744 | u64 root_objectid, u64 owner, | |
1745 | u64 offset, int refs_to_add, | |
1746 | struct btrfs_delayed_extent_op *extent_op) | |
1747 | { | |
1748 | struct btrfs_extent_inline_ref *iref; | |
1749 | int ret; | |
1750 | ||
1751 | ret = lookup_inline_extent_backref(trans, root, path, &iref, | |
1752 | bytenr, num_bytes, parent, | |
1753 | root_objectid, owner, offset, 1); | |
1754 | if (ret == 0) { | |
1755 | BUG_ON(owner < BTRFS_FIRST_FREE_OBJECTID); | |
143bede5 JM |
1756 | update_inline_extent_backref(trans, root, path, iref, |
1757 | refs_to_add, extent_op); | |
5d4f98a2 | 1758 | } else if (ret == -ENOENT) { |
143bede5 JM |
1759 | setup_inline_extent_backref(trans, root, path, iref, parent, |
1760 | root_objectid, owner, offset, | |
1761 | refs_to_add, extent_op); | |
1762 | ret = 0; | |
771ed689 | 1763 | } |
5d4f98a2 YZ |
1764 | return ret; |
1765 | } | |
31840ae1 | 1766 | |
5d4f98a2 YZ |
1767 | static int insert_extent_backref(struct btrfs_trans_handle *trans, |
1768 | struct btrfs_root *root, | |
1769 | struct btrfs_path *path, | |
1770 | u64 bytenr, u64 parent, u64 root_objectid, | |
1771 | u64 owner, u64 offset, int refs_to_add) | |
1772 | { | |
1773 | int ret; | |
1774 | if (owner < BTRFS_FIRST_FREE_OBJECTID) { | |
1775 | BUG_ON(refs_to_add != 1); | |
1776 | ret = insert_tree_block_ref(trans, root, path, bytenr, | |
1777 | parent, root_objectid); | |
1778 | } else { | |
1779 | ret = insert_extent_data_ref(trans, root, path, bytenr, | |
1780 | parent, root_objectid, | |
1781 | owner, offset, refs_to_add); | |
1782 | } | |
1783 | return ret; | |
1784 | } | |
56bec294 | 1785 | |
5d4f98a2 YZ |
1786 | static int remove_extent_backref(struct btrfs_trans_handle *trans, |
1787 | struct btrfs_root *root, | |
1788 | struct btrfs_path *path, | |
1789 | struct btrfs_extent_inline_ref *iref, | |
1790 | int refs_to_drop, int is_data) | |
1791 | { | |
143bede5 | 1792 | int ret = 0; |
b9473439 | 1793 | |
5d4f98a2 YZ |
1794 | BUG_ON(!is_data && refs_to_drop != 1); |
1795 | if (iref) { | |
143bede5 JM |
1796 | update_inline_extent_backref(trans, root, path, iref, |
1797 | -refs_to_drop, NULL); | |
5d4f98a2 YZ |
1798 | } else if (is_data) { |
1799 | ret = remove_extent_data_ref(trans, root, path, refs_to_drop); | |
1800 | } else { | |
1801 | ret = btrfs_del_item(trans, root, path); | |
1802 | } | |
1803 | return ret; | |
1804 | } | |
1805 | ||
5378e607 | 1806 | static int btrfs_issue_discard(struct block_device *bdev, |
5d4f98a2 YZ |
1807 | u64 start, u64 len) |
1808 | { | |
5378e607 | 1809 | return blkdev_issue_discard(bdev, start >> 9, len >> 9, GFP_NOFS, 0); |
5d4f98a2 | 1810 | } |
5d4f98a2 YZ |
1811 | |
1812 | static int btrfs_discard_extent(struct btrfs_root *root, u64 bytenr, | |
5378e607 | 1813 | u64 num_bytes, u64 *actual_bytes) |
5d4f98a2 | 1814 | { |
5d4f98a2 | 1815 | int ret; |
5378e607 | 1816 | u64 discarded_bytes = 0; |
a1d3c478 | 1817 | struct btrfs_bio *bbio = NULL; |
5d4f98a2 | 1818 | |
e244a0ae | 1819 | |
5d4f98a2 | 1820 | /* Tell the block device(s) that the sectors can be discarded */ |
5378e607 | 1821 | ret = btrfs_map_block(&root->fs_info->mapping_tree, REQ_DISCARD, |
a1d3c478 | 1822 | bytenr, &num_bytes, &bbio, 0); |
79787eaa | 1823 | /* Error condition is -ENOMEM */ |
5d4f98a2 | 1824 | if (!ret) { |
a1d3c478 | 1825 | struct btrfs_bio_stripe *stripe = bbio->stripes; |
5d4f98a2 YZ |
1826 | int i; |
1827 | ||
5d4f98a2 | 1828 | |
a1d3c478 | 1829 | for (i = 0; i < bbio->num_stripes; i++, stripe++) { |
d5e2003c JB |
1830 | if (!stripe->dev->can_discard) |
1831 | continue; | |
1832 | ||
5378e607 LD |
1833 | ret = btrfs_issue_discard(stripe->dev->bdev, |
1834 | stripe->physical, | |
1835 | stripe->length); | |
1836 | if (!ret) | |
1837 | discarded_bytes += stripe->length; | |
1838 | else if (ret != -EOPNOTSUPP) | |
79787eaa | 1839 | break; /* Logic errors or -ENOMEM, or -EIO but I don't know how that could happen JDM */ |
d5e2003c JB |
1840 | |
1841 | /* | |
1842 | * Just in case we get back EOPNOTSUPP for some reason, | |
1843 | * just ignore the return value so we don't screw up | |
1844 | * people calling discard_extent. | |
1845 | */ | |
1846 | ret = 0; | |
5d4f98a2 | 1847 | } |
a1d3c478 | 1848 | kfree(bbio); |
5d4f98a2 | 1849 | } |
5378e607 LD |
1850 | |
1851 | if (actual_bytes) | |
1852 | *actual_bytes = discarded_bytes; | |
1853 | ||
5d4f98a2 YZ |
1854 | |
1855 | return ret; | |
5d4f98a2 YZ |
1856 | } |
1857 | ||
79787eaa | 1858 | /* Can return -ENOMEM */ |
5d4f98a2 YZ |
1859 | int btrfs_inc_extent_ref(struct btrfs_trans_handle *trans, |
1860 | struct btrfs_root *root, | |
1861 | u64 bytenr, u64 num_bytes, u64 parent, | |
66d7e7f0 | 1862 | u64 root_objectid, u64 owner, u64 offset, int for_cow) |
5d4f98a2 YZ |
1863 | { |
1864 | int ret; | |
66d7e7f0 AJ |
1865 | struct btrfs_fs_info *fs_info = root->fs_info; |
1866 | ||
5d4f98a2 YZ |
1867 | BUG_ON(owner < BTRFS_FIRST_FREE_OBJECTID && |
1868 | root_objectid == BTRFS_TREE_LOG_OBJECTID); | |
1869 | ||
1870 | if (owner < BTRFS_FIRST_FREE_OBJECTID) { | |
66d7e7f0 AJ |
1871 | ret = btrfs_add_delayed_tree_ref(fs_info, trans, bytenr, |
1872 | num_bytes, | |
5d4f98a2 | 1873 | parent, root_objectid, (int)owner, |
66d7e7f0 | 1874 | BTRFS_ADD_DELAYED_REF, NULL, for_cow); |
5d4f98a2 | 1875 | } else { |
66d7e7f0 AJ |
1876 | ret = btrfs_add_delayed_data_ref(fs_info, trans, bytenr, |
1877 | num_bytes, | |
5d4f98a2 | 1878 | parent, root_objectid, owner, offset, |
66d7e7f0 | 1879 | BTRFS_ADD_DELAYED_REF, NULL, for_cow); |
5d4f98a2 YZ |
1880 | } |
1881 | return ret; | |
1882 | } | |
1883 | ||
1884 | static int __btrfs_inc_extent_ref(struct btrfs_trans_handle *trans, | |
1885 | struct btrfs_root *root, | |
1886 | u64 bytenr, u64 num_bytes, | |
1887 | u64 parent, u64 root_objectid, | |
1888 | u64 owner, u64 offset, int refs_to_add, | |
1889 | struct btrfs_delayed_extent_op *extent_op) | |
1890 | { | |
1891 | struct btrfs_path *path; | |
1892 | struct extent_buffer *leaf; | |
1893 | struct btrfs_extent_item *item; | |
1894 | u64 refs; | |
1895 | int ret; | |
1896 | int err = 0; | |
1897 | ||
1898 | path = btrfs_alloc_path(); | |
1899 | if (!path) | |
1900 | return -ENOMEM; | |
1901 | ||
1902 | path->reada = 1; | |
1903 | path->leave_spinning = 1; | |
1904 | /* this will setup the path even if it fails to insert the back ref */ | |
1905 | ret = insert_inline_extent_backref(trans, root->fs_info->extent_root, | |
1906 | path, bytenr, num_bytes, parent, | |
1907 | root_objectid, owner, offset, | |
1908 | refs_to_add, extent_op); | |
1909 | if (ret == 0) | |
1910 | goto out; | |
1911 | ||
1912 | if (ret != -EAGAIN) { | |
1913 | err = ret; | |
1914 | goto out; | |
1915 | } | |
1916 | ||
1917 | leaf = path->nodes[0]; | |
1918 | item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); | |
1919 | refs = btrfs_extent_refs(leaf, item); | |
1920 | btrfs_set_extent_refs(leaf, item, refs + refs_to_add); | |
1921 | if (extent_op) | |
1922 | __run_delayed_extent_op(extent_op, leaf, item); | |
56bec294 | 1923 | |
5d4f98a2 | 1924 | btrfs_mark_buffer_dirty(leaf); |
b3b4aa74 | 1925 | btrfs_release_path(path); |
56bec294 CM |
1926 | |
1927 | path->reada = 1; | |
b9473439 CM |
1928 | path->leave_spinning = 1; |
1929 | ||
56bec294 CM |
1930 | /* now insert the actual backref */ |
1931 | ret = insert_extent_backref(trans, root->fs_info->extent_root, | |
5d4f98a2 YZ |
1932 | path, bytenr, parent, root_objectid, |
1933 | owner, offset, refs_to_add); | |
79787eaa JM |
1934 | if (ret) |
1935 | btrfs_abort_transaction(trans, root, ret); | |
5d4f98a2 | 1936 | out: |
56bec294 | 1937 | btrfs_free_path(path); |
5d4f98a2 | 1938 | return err; |
56bec294 CM |
1939 | } |
1940 | ||
5d4f98a2 YZ |
1941 | static int run_delayed_data_ref(struct btrfs_trans_handle *trans, |
1942 | struct btrfs_root *root, | |
1943 | struct btrfs_delayed_ref_node *node, | |
1944 | struct btrfs_delayed_extent_op *extent_op, | |
1945 | int insert_reserved) | |
56bec294 | 1946 | { |
5d4f98a2 YZ |
1947 | int ret = 0; |
1948 | struct btrfs_delayed_data_ref *ref; | |
1949 | struct btrfs_key ins; | |
1950 | u64 parent = 0; | |
1951 | u64 ref_root = 0; | |
1952 | u64 flags = 0; | |
1953 | ||
1954 | ins.objectid = node->bytenr; | |
1955 | ins.offset = node->num_bytes; | |
1956 | ins.type = BTRFS_EXTENT_ITEM_KEY; | |
1957 | ||
1958 | ref = btrfs_delayed_node_to_data_ref(node); | |
1959 | if (node->type == BTRFS_SHARED_DATA_REF_KEY) | |
1960 | parent = ref->parent; | |
1961 | else | |
1962 | ref_root = ref->root; | |
1963 | ||
1964 | if (node->action == BTRFS_ADD_DELAYED_REF && insert_reserved) { | |
1965 | if (extent_op) { | |
1966 | BUG_ON(extent_op->update_key); | |
1967 | flags |= extent_op->flags_to_set; | |
1968 | } | |
1969 | ret = alloc_reserved_file_extent(trans, root, | |
1970 | parent, ref_root, flags, | |
1971 | ref->objectid, ref->offset, | |
1972 | &ins, node->ref_mod); | |
5d4f98a2 YZ |
1973 | } else if (node->action == BTRFS_ADD_DELAYED_REF) { |
1974 | ret = __btrfs_inc_extent_ref(trans, root, node->bytenr, | |
1975 | node->num_bytes, parent, | |
1976 | ref_root, ref->objectid, | |
1977 | ref->offset, node->ref_mod, | |
1978 | extent_op); | |
1979 | } else if (node->action == BTRFS_DROP_DELAYED_REF) { | |
1980 | ret = __btrfs_free_extent(trans, root, node->bytenr, | |
1981 | node->num_bytes, parent, | |
1982 | ref_root, ref->objectid, | |
1983 | ref->offset, node->ref_mod, | |
1984 | extent_op); | |
1985 | } else { | |
1986 | BUG(); | |
1987 | } | |
1988 | return ret; | |
1989 | } | |
1990 | ||
1991 | static void __run_delayed_extent_op(struct btrfs_delayed_extent_op *extent_op, | |
1992 | struct extent_buffer *leaf, | |
1993 | struct btrfs_extent_item *ei) | |
1994 | { | |
1995 | u64 flags = btrfs_extent_flags(leaf, ei); | |
1996 | if (extent_op->update_flags) { | |
1997 | flags |= extent_op->flags_to_set; | |
1998 | btrfs_set_extent_flags(leaf, ei, flags); | |
1999 | } | |
2000 | ||
2001 | if (extent_op->update_key) { | |
2002 | struct btrfs_tree_block_info *bi; | |
2003 | BUG_ON(!(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)); | |
2004 | bi = (struct btrfs_tree_block_info *)(ei + 1); | |
2005 | btrfs_set_tree_block_key(leaf, bi, &extent_op->key); | |
2006 | } | |
2007 | } | |
2008 | ||
2009 | static int run_delayed_extent_op(struct btrfs_trans_handle *trans, | |
2010 | struct btrfs_root *root, | |
2011 | struct btrfs_delayed_ref_node *node, | |
2012 | struct btrfs_delayed_extent_op *extent_op) | |
2013 | { | |
2014 | struct btrfs_key key; | |
2015 | struct btrfs_path *path; | |
2016 | struct btrfs_extent_item *ei; | |
2017 | struct extent_buffer *leaf; | |
2018 | u32 item_size; | |
56bec294 | 2019 | int ret; |
5d4f98a2 YZ |
2020 | int err = 0; |
2021 | ||
79787eaa JM |
2022 | if (trans->aborted) |
2023 | return 0; | |
2024 | ||
5d4f98a2 YZ |
2025 | path = btrfs_alloc_path(); |
2026 | if (!path) | |
2027 | return -ENOMEM; | |
2028 | ||
2029 | key.objectid = node->bytenr; | |
2030 | key.type = BTRFS_EXTENT_ITEM_KEY; | |
2031 | key.offset = node->num_bytes; | |
2032 | ||
2033 | path->reada = 1; | |
2034 | path->leave_spinning = 1; | |
2035 | ret = btrfs_search_slot(trans, root->fs_info->extent_root, &key, | |
2036 | path, 0, 1); | |
2037 | if (ret < 0) { | |
2038 | err = ret; | |
2039 | goto out; | |
2040 | } | |
2041 | if (ret > 0) { | |
2042 | err = -EIO; | |
2043 | goto out; | |
2044 | } | |
2045 | ||
2046 | leaf = path->nodes[0]; | |
2047 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
2048 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
2049 | if (item_size < sizeof(*ei)) { | |
2050 | ret = convert_extent_item_v0(trans, root->fs_info->extent_root, | |
2051 | path, (u64)-1, 0); | |
2052 | if (ret < 0) { | |
2053 | err = ret; | |
2054 | goto out; | |
2055 | } | |
2056 | leaf = path->nodes[0]; | |
2057 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
2058 | } | |
2059 | #endif | |
2060 | BUG_ON(item_size < sizeof(*ei)); | |
2061 | ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); | |
2062 | __run_delayed_extent_op(extent_op, leaf, ei); | |
56bec294 | 2063 | |
5d4f98a2 YZ |
2064 | btrfs_mark_buffer_dirty(leaf); |
2065 | out: | |
2066 | btrfs_free_path(path); | |
2067 | return err; | |
56bec294 CM |
2068 | } |
2069 | ||
5d4f98a2 YZ |
2070 | static int run_delayed_tree_ref(struct btrfs_trans_handle *trans, |
2071 | struct btrfs_root *root, | |
2072 | struct btrfs_delayed_ref_node *node, | |
2073 | struct btrfs_delayed_extent_op *extent_op, | |
2074 | int insert_reserved) | |
56bec294 CM |
2075 | { |
2076 | int ret = 0; | |
5d4f98a2 YZ |
2077 | struct btrfs_delayed_tree_ref *ref; |
2078 | struct btrfs_key ins; | |
2079 | u64 parent = 0; | |
2080 | u64 ref_root = 0; | |
56bec294 | 2081 | |
5d4f98a2 YZ |
2082 | ins.objectid = node->bytenr; |
2083 | ins.offset = node->num_bytes; | |
2084 | ins.type = BTRFS_EXTENT_ITEM_KEY; | |
56bec294 | 2085 | |
5d4f98a2 YZ |
2086 | ref = btrfs_delayed_node_to_tree_ref(node); |
2087 | if (node->type == BTRFS_SHARED_BLOCK_REF_KEY) | |
2088 | parent = ref->parent; | |
2089 | else | |
2090 | ref_root = ref->root; | |
2091 | ||
2092 | BUG_ON(node->ref_mod != 1); | |
2093 | if (node->action == BTRFS_ADD_DELAYED_REF && insert_reserved) { | |
2094 | BUG_ON(!extent_op || !extent_op->update_flags || | |
2095 | !extent_op->update_key); | |
2096 | ret = alloc_reserved_tree_block(trans, root, | |
2097 | parent, ref_root, | |
2098 | extent_op->flags_to_set, | |
2099 | &extent_op->key, | |
2100 | ref->level, &ins); | |
5d4f98a2 YZ |
2101 | } else if (node->action == BTRFS_ADD_DELAYED_REF) { |
2102 | ret = __btrfs_inc_extent_ref(trans, root, node->bytenr, | |
2103 | node->num_bytes, parent, ref_root, | |
2104 | ref->level, 0, 1, extent_op); | |
2105 | } else if (node->action == BTRFS_DROP_DELAYED_REF) { | |
2106 | ret = __btrfs_free_extent(trans, root, node->bytenr, | |
2107 | node->num_bytes, parent, ref_root, | |
2108 | ref->level, 0, 1, extent_op); | |
2109 | } else { | |
2110 | BUG(); | |
2111 | } | |
56bec294 CM |
2112 | return ret; |
2113 | } | |
2114 | ||
2115 | /* helper function to actually process a single delayed ref entry */ | |
5d4f98a2 YZ |
2116 | static int run_one_delayed_ref(struct btrfs_trans_handle *trans, |
2117 | struct btrfs_root *root, | |
2118 | struct btrfs_delayed_ref_node *node, | |
2119 | struct btrfs_delayed_extent_op *extent_op, | |
2120 | int insert_reserved) | |
56bec294 | 2121 | { |
79787eaa JM |
2122 | int ret = 0; |
2123 | ||
2124 | if (trans->aborted) | |
2125 | return 0; | |
2126 | ||
5d4f98a2 | 2127 | if (btrfs_delayed_ref_is_head(node)) { |
56bec294 CM |
2128 | struct btrfs_delayed_ref_head *head; |
2129 | /* | |
2130 | * we've hit the end of the chain and we were supposed | |
2131 | * to insert this extent into the tree. But, it got | |
2132 | * deleted before we ever needed to insert it, so all | |
2133 | * we have to do is clean up the accounting | |
2134 | */ | |
5d4f98a2 YZ |
2135 | BUG_ON(extent_op); |
2136 | head = btrfs_delayed_node_to_head(node); | |
56bec294 | 2137 | if (insert_reserved) { |
f0486c68 YZ |
2138 | btrfs_pin_extent(root, node->bytenr, |
2139 | node->num_bytes, 1); | |
5d4f98a2 YZ |
2140 | if (head->is_data) { |
2141 | ret = btrfs_del_csums(trans, root, | |
2142 | node->bytenr, | |
2143 | node->num_bytes); | |
5d4f98a2 | 2144 | } |
56bec294 | 2145 | } |
56bec294 | 2146 | mutex_unlock(&head->mutex); |
79787eaa | 2147 | return ret; |
56bec294 CM |
2148 | } |
2149 | ||
5d4f98a2 YZ |
2150 | if (node->type == BTRFS_TREE_BLOCK_REF_KEY || |
2151 | node->type == BTRFS_SHARED_BLOCK_REF_KEY) | |
2152 | ret = run_delayed_tree_ref(trans, root, node, extent_op, | |
2153 | insert_reserved); | |
2154 | else if (node->type == BTRFS_EXTENT_DATA_REF_KEY || | |
2155 | node->type == BTRFS_SHARED_DATA_REF_KEY) | |
2156 | ret = run_delayed_data_ref(trans, root, node, extent_op, | |
2157 | insert_reserved); | |
2158 | else | |
2159 | BUG(); | |
2160 | return ret; | |
56bec294 CM |
2161 | } |
2162 | ||
2163 | static noinline struct btrfs_delayed_ref_node * | |
2164 | select_delayed_ref(struct btrfs_delayed_ref_head *head) | |
2165 | { | |
2166 | struct rb_node *node; | |
2167 | struct btrfs_delayed_ref_node *ref; | |
2168 | int action = BTRFS_ADD_DELAYED_REF; | |
2169 | again: | |
2170 | /* | |
2171 | * select delayed ref of type BTRFS_ADD_DELAYED_REF first. | |
2172 | * this prevents ref count from going down to zero when | |
2173 | * there still are pending delayed ref. | |
2174 | */ | |
2175 | node = rb_prev(&head->node.rb_node); | |
2176 | while (1) { | |
2177 | if (!node) | |
2178 | break; | |
2179 | ref = rb_entry(node, struct btrfs_delayed_ref_node, | |
2180 | rb_node); | |
2181 | if (ref->bytenr != head->node.bytenr) | |
2182 | break; | |
5d4f98a2 | 2183 | if (ref->action == action) |
56bec294 CM |
2184 | return ref; |
2185 | node = rb_prev(node); | |
2186 | } | |
2187 | if (action == BTRFS_ADD_DELAYED_REF) { | |
2188 | action = BTRFS_DROP_DELAYED_REF; | |
2189 | goto again; | |
2190 | } | |
2191 | return NULL; | |
2192 | } | |
2193 | ||
79787eaa JM |
2194 | /* |
2195 | * Returns 0 on success or if called with an already aborted transaction. | |
2196 | * Returns -ENOMEM or -EIO on failure and will abort the transaction. | |
2197 | */ | |
c3e69d58 CM |
2198 | static noinline int run_clustered_refs(struct btrfs_trans_handle *trans, |
2199 | struct btrfs_root *root, | |
2200 | struct list_head *cluster) | |
56bec294 | 2201 | { |
56bec294 CM |
2202 | struct btrfs_delayed_ref_root *delayed_refs; |
2203 | struct btrfs_delayed_ref_node *ref; | |
2204 | struct btrfs_delayed_ref_head *locked_ref = NULL; | |
5d4f98a2 | 2205 | struct btrfs_delayed_extent_op *extent_op; |
097b8a7c | 2206 | struct btrfs_fs_info *fs_info = root->fs_info; |
56bec294 | 2207 | int ret; |
c3e69d58 | 2208 | int count = 0; |
56bec294 | 2209 | int must_insert_reserved = 0; |
56bec294 CM |
2210 | |
2211 | delayed_refs = &trans->transaction->delayed_refs; | |
56bec294 CM |
2212 | while (1) { |
2213 | if (!locked_ref) { | |
c3e69d58 CM |
2214 | /* pick a new head ref from the cluster list */ |
2215 | if (list_empty(cluster)) | |
56bec294 | 2216 | break; |
56bec294 | 2217 | |
c3e69d58 CM |
2218 | locked_ref = list_entry(cluster->next, |
2219 | struct btrfs_delayed_ref_head, cluster); | |
2220 | ||
2221 | /* grab the lock that says we are going to process | |
2222 | * all the refs for this head */ | |
2223 | ret = btrfs_delayed_ref_lock(trans, locked_ref); | |
2224 | ||
2225 | /* | |
2226 | * we may have dropped the spin lock to get the head | |
2227 | * mutex lock, and that might have given someone else | |
2228 | * time to free the head. If that's true, it has been | |
2229 | * removed from our list and we can move on. | |
2230 | */ | |
2231 | if (ret == -EAGAIN) { | |
2232 | locked_ref = NULL; | |
2233 | count++; | |
2234 | continue; | |
56bec294 CM |
2235 | } |
2236 | } | |
a28ec197 | 2237 | |
ae1e206b JB |
2238 | /* |
2239 | * We need to try and merge add/drops of the same ref since we | |
2240 | * can run into issues with relocate dropping the implicit ref | |
2241 | * and then it being added back again before the drop can | |
2242 | * finish. If we merged anything we need to re-loop so we can | |
2243 | * get a good ref. | |
2244 | */ | |
2245 | btrfs_merge_delayed_refs(trans, fs_info, delayed_refs, | |
2246 | locked_ref); | |
2247 | ||
d1270cd9 AJ |
2248 | /* |
2249 | * locked_ref is the head node, so we have to go one | |
2250 | * node back for any delayed ref updates | |
2251 | */ | |
2252 | ref = select_delayed_ref(locked_ref); | |
2253 | ||
2254 | if (ref && ref->seq && | |
097b8a7c | 2255 | btrfs_check_delayed_seq(fs_info, delayed_refs, ref->seq)) { |
d1270cd9 AJ |
2256 | /* |
2257 | * there are still refs with lower seq numbers in the | |
2258 | * process of being added. Don't run this ref yet. | |
2259 | */ | |
2260 | list_del_init(&locked_ref->cluster); | |
2261 | mutex_unlock(&locked_ref->mutex); | |
2262 | locked_ref = NULL; | |
2263 | delayed_refs->num_heads_ready++; | |
2264 | spin_unlock(&delayed_refs->lock); | |
2265 | cond_resched(); | |
2266 | spin_lock(&delayed_refs->lock); | |
2267 | continue; | |
2268 | } | |
2269 | ||
56bec294 CM |
2270 | /* |
2271 | * record the must insert reserved flag before we | |
2272 | * drop the spin lock. | |
2273 | */ | |
2274 | must_insert_reserved = locked_ref->must_insert_reserved; | |
2275 | locked_ref->must_insert_reserved = 0; | |
7bb86316 | 2276 | |
5d4f98a2 YZ |
2277 | extent_op = locked_ref->extent_op; |
2278 | locked_ref->extent_op = NULL; | |
2279 | ||
56bec294 CM |
2280 | if (!ref) { |
2281 | /* All delayed refs have been processed, Go ahead | |
2282 | * and send the head node to run_one_delayed_ref, | |
2283 | * so that any accounting fixes can happen | |
2284 | */ | |
2285 | ref = &locked_ref->node; | |
5d4f98a2 YZ |
2286 | |
2287 | if (extent_op && must_insert_reserved) { | |
2288 | kfree(extent_op); | |
2289 | extent_op = NULL; | |
2290 | } | |
2291 | ||
2292 | if (extent_op) { | |
2293 | spin_unlock(&delayed_refs->lock); | |
2294 | ||
2295 | ret = run_delayed_extent_op(trans, root, | |
2296 | ref, extent_op); | |
5d4f98a2 YZ |
2297 | kfree(extent_op); |
2298 | ||
79787eaa JM |
2299 | if (ret) { |
2300 | printk(KERN_DEBUG "btrfs: run_delayed_extent_op returned %d\n", ret); | |
253beebd | 2301 | spin_lock(&delayed_refs->lock); |
79787eaa JM |
2302 | return ret; |
2303 | } | |
2304 | ||
203bf287 | 2305 | goto next; |
5d4f98a2 YZ |
2306 | } |
2307 | ||
c3e69d58 | 2308 | list_del_init(&locked_ref->cluster); |
56bec294 CM |
2309 | locked_ref = NULL; |
2310 | } | |
02217ed2 | 2311 | |
56bec294 CM |
2312 | ref->in_tree = 0; |
2313 | rb_erase(&ref->rb_node, &delayed_refs->root); | |
2314 | delayed_refs->num_entries--; | |
22cd2e7d AJ |
2315 | if (locked_ref) { |
2316 | /* | |
2317 | * when we play the delayed ref, also correct the | |
2318 | * ref_mod on head | |
2319 | */ | |
2320 | switch (ref->action) { | |
2321 | case BTRFS_ADD_DELAYED_REF: | |
2322 | case BTRFS_ADD_DELAYED_EXTENT: | |
2323 | locked_ref->node.ref_mod -= ref->ref_mod; | |
2324 | break; | |
2325 | case BTRFS_DROP_DELAYED_REF: | |
2326 | locked_ref->node.ref_mod += ref->ref_mod; | |
2327 | break; | |
2328 | default: | |
2329 | WARN_ON(1); | |
2330 | } | |
2331 | } | |
56bec294 | 2332 | spin_unlock(&delayed_refs->lock); |
925baedd | 2333 | |
5d4f98a2 | 2334 | ret = run_one_delayed_ref(trans, root, ref, extent_op, |
56bec294 | 2335 | must_insert_reserved); |
eb099670 | 2336 | |
5d4f98a2 YZ |
2337 | btrfs_put_delayed_ref(ref); |
2338 | kfree(extent_op); | |
c3e69d58 | 2339 | count++; |
79787eaa JM |
2340 | |
2341 | if (ret) { | |
2342 | printk(KERN_DEBUG "btrfs: run_one_delayed_ref returned %d\n", ret); | |
253beebd | 2343 | spin_lock(&delayed_refs->lock); |
79787eaa JM |
2344 | return ret; |
2345 | } | |
2346 | ||
203bf287 | 2347 | next: |
c3e69d58 CM |
2348 | cond_resched(); |
2349 | spin_lock(&delayed_refs->lock); | |
2350 | } | |
2351 | return count; | |
2352 | } | |
2353 | ||
709c0486 AJ |
2354 | #ifdef SCRAMBLE_DELAYED_REFS |
2355 | /* | |
2356 | * Normally delayed refs get processed in ascending bytenr order. This | |
2357 | * correlates in most cases to the order added. To expose dependencies on this | |
2358 | * order, we start to process the tree in the middle instead of the beginning | |
2359 | */ | |
2360 | static u64 find_middle(struct rb_root *root) | |
2361 | { | |
2362 | struct rb_node *n = root->rb_node; | |
2363 | struct btrfs_delayed_ref_node *entry; | |
2364 | int alt = 1; | |
2365 | u64 middle; | |
2366 | u64 first = 0, last = 0; | |
2367 | ||
2368 | n = rb_first(root); | |
2369 | if (n) { | |
2370 | entry = rb_entry(n, struct btrfs_delayed_ref_node, rb_node); | |
2371 | first = entry->bytenr; | |
2372 | } | |
2373 | n = rb_last(root); | |
2374 | if (n) { | |
2375 | entry = rb_entry(n, struct btrfs_delayed_ref_node, rb_node); | |
2376 | last = entry->bytenr; | |
2377 | } | |
2378 | n = root->rb_node; | |
2379 | ||
2380 | while (n) { | |
2381 | entry = rb_entry(n, struct btrfs_delayed_ref_node, rb_node); | |
2382 | WARN_ON(!entry->in_tree); | |
2383 | ||
2384 | middle = entry->bytenr; | |
2385 | ||
2386 | if (alt) | |
2387 | n = n->rb_left; | |
2388 | else | |
2389 | n = n->rb_right; | |
2390 | ||
2391 | alt = 1 - alt; | |
2392 | } | |
2393 | return middle; | |
2394 | } | |
2395 | #endif | |
2396 | ||
bed92eae AJ |
2397 | int btrfs_delayed_refs_qgroup_accounting(struct btrfs_trans_handle *trans, |
2398 | struct btrfs_fs_info *fs_info) | |
2399 | { | |
2400 | struct qgroup_update *qgroup_update; | |
2401 | int ret = 0; | |
2402 | ||
2403 | if (list_empty(&trans->qgroup_ref_list) != | |
2404 | !trans->delayed_ref_elem.seq) { | |
2405 | /* list without seq or seq without list */ | |
2406 | printk(KERN_ERR "btrfs: qgroup accounting update error, list is%s empty, seq is %llu\n", | |
2407 | list_empty(&trans->qgroup_ref_list) ? "" : " not", | |
2408 | trans->delayed_ref_elem.seq); | |
2409 | BUG(); | |
2410 | } | |
2411 | ||
2412 | if (!trans->delayed_ref_elem.seq) | |
2413 | return 0; | |
2414 | ||
2415 | while (!list_empty(&trans->qgroup_ref_list)) { | |
2416 | qgroup_update = list_first_entry(&trans->qgroup_ref_list, | |
2417 | struct qgroup_update, list); | |
2418 | list_del(&qgroup_update->list); | |
2419 | if (!ret) | |
2420 | ret = btrfs_qgroup_account_ref( | |
2421 | trans, fs_info, qgroup_update->node, | |
2422 | qgroup_update->extent_op); | |
2423 | kfree(qgroup_update); | |
2424 | } | |
2425 | ||
2426 | btrfs_put_tree_mod_seq(fs_info, &trans->delayed_ref_elem); | |
2427 | ||
2428 | return ret; | |
2429 | } | |
2430 | ||
c3e69d58 CM |
2431 | /* |
2432 | * this starts processing the delayed reference count updates and | |
2433 | * extent insertions we have queued up so far. count can be | |
2434 | * 0, which means to process everything in the tree at the start | |
2435 | * of the run (but not newly added entries), or it can be some target | |
2436 | * number you'd like to process. | |
79787eaa JM |
2437 | * |
2438 | * Returns 0 on success or if called with an aborted transaction | |
2439 | * Returns <0 on error and aborts the transaction | |
c3e69d58 CM |
2440 | */ |
2441 | int btrfs_run_delayed_refs(struct btrfs_trans_handle *trans, | |
2442 | struct btrfs_root *root, unsigned long count) | |
2443 | { | |
2444 | struct rb_node *node; | |
2445 | struct btrfs_delayed_ref_root *delayed_refs; | |
2446 | struct btrfs_delayed_ref_node *ref; | |
2447 | struct list_head cluster; | |
2448 | int ret; | |
a168650c | 2449 | u64 delayed_start; |
c3e69d58 CM |
2450 | int run_all = count == (unsigned long)-1; |
2451 | int run_most = 0; | |
1fa11e26 | 2452 | int loops; |
c3e69d58 | 2453 | |
79787eaa JM |
2454 | /* We'll clean this up in btrfs_cleanup_transaction */ |
2455 | if (trans->aborted) | |
2456 | return 0; | |
2457 | ||
c3e69d58 CM |
2458 | if (root == root->fs_info->extent_root) |
2459 | root = root->fs_info->tree_root; | |
2460 | ||
edf39272 JS |
2461 | btrfs_delayed_refs_qgroup_accounting(trans, root->fs_info); |
2462 | ||
c3e69d58 CM |
2463 | delayed_refs = &trans->transaction->delayed_refs; |
2464 | INIT_LIST_HEAD(&cluster); | |
2465 | again: | |
1fa11e26 | 2466 | loops = 0; |
c3e69d58 | 2467 | spin_lock(&delayed_refs->lock); |
097b8a7c | 2468 | |
709c0486 AJ |
2469 | #ifdef SCRAMBLE_DELAYED_REFS |
2470 | delayed_refs->run_delayed_start = find_middle(&delayed_refs->root); | |
2471 | #endif | |
2472 | ||
c3e69d58 CM |
2473 | if (count == 0) { |
2474 | count = delayed_refs->num_entries * 2; | |
2475 | run_most = 1; | |
2476 | } | |
2477 | while (1) { | |
2478 | if (!(run_all || run_most) && | |
2479 | delayed_refs->num_heads_ready < 64) | |
2480 | break; | |
eb099670 | 2481 | |
56bec294 | 2482 | /* |
c3e69d58 CM |
2483 | * go find something we can process in the rbtree. We start at |
2484 | * the beginning of the tree, and then build a cluster | |
2485 | * of refs to process starting at the first one we are able to | |
2486 | * lock | |
56bec294 | 2487 | */ |
a168650c | 2488 | delayed_start = delayed_refs->run_delayed_start; |
c3e69d58 CM |
2489 | ret = btrfs_find_ref_cluster(trans, &cluster, |
2490 | delayed_refs->run_delayed_start); | |
2491 | if (ret) | |
56bec294 CM |
2492 | break; |
2493 | ||
c3e69d58 | 2494 | ret = run_clustered_refs(trans, root, &cluster); |
79787eaa JM |
2495 | if (ret < 0) { |
2496 | spin_unlock(&delayed_refs->lock); | |
2497 | btrfs_abort_transaction(trans, root, ret); | |
2498 | return ret; | |
2499 | } | |
c3e69d58 CM |
2500 | |
2501 | count -= min_t(unsigned long, ret, count); | |
2502 | ||
2503 | if (count == 0) | |
2504 | break; | |
a168650c | 2505 | |
1fa11e26 AJ |
2506 | if (delayed_start >= delayed_refs->run_delayed_start) { |
2507 | if (loops == 0) { | |
2508 | /* | |
2509 | * btrfs_find_ref_cluster looped. let's do one | |
2510 | * more cycle. if we don't run any delayed ref | |
2511 | * during that cycle (because we can't because | |
2512 | * all of them are blocked), bail out. | |
2513 | */ | |
2514 | loops = 1; | |
2515 | } else { | |
2516 | /* | |
2517 | * no runnable refs left, stop trying | |
2518 | */ | |
2519 | BUG_ON(run_all); | |
2520 | break; | |
2521 | } | |
2522 | } | |
2523 | if (ret) { | |
a168650c | 2524 | /* refs were run, let's reset staleness detection */ |
1fa11e26 | 2525 | loops = 0; |
a168650c | 2526 | } |
eb099670 | 2527 | } |
c3e69d58 | 2528 | |
56bec294 | 2529 | if (run_all) { |
ea658bad JB |
2530 | if (!list_empty(&trans->new_bgs)) { |
2531 | spin_unlock(&delayed_refs->lock); | |
2532 | btrfs_create_pending_block_groups(trans, root); | |
2533 | spin_lock(&delayed_refs->lock); | |
2534 | } | |
2535 | ||
56bec294 | 2536 | node = rb_first(&delayed_refs->root); |
c3e69d58 | 2537 | if (!node) |
56bec294 | 2538 | goto out; |
c3e69d58 | 2539 | count = (unsigned long)-1; |
e9d0b13b | 2540 | |
56bec294 CM |
2541 | while (node) { |
2542 | ref = rb_entry(node, struct btrfs_delayed_ref_node, | |
2543 | rb_node); | |
2544 | if (btrfs_delayed_ref_is_head(ref)) { | |
2545 | struct btrfs_delayed_ref_head *head; | |
5caf2a00 | 2546 | |
56bec294 CM |
2547 | head = btrfs_delayed_node_to_head(ref); |
2548 | atomic_inc(&ref->refs); | |
2549 | ||
2550 | spin_unlock(&delayed_refs->lock); | |
8cc33e5c DS |
2551 | /* |
2552 | * Mutex was contended, block until it's | |
2553 | * released and try again | |
2554 | */ | |
56bec294 CM |
2555 | mutex_lock(&head->mutex); |
2556 | mutex_unlock(&head->mutex); | |
2557 | ||
2558 | btrfs_put_delayed_ref(ref); | |
1887be66 | 2559 | cond_resched(); |
56bec294 CM |
2560 | goto again; |
2561 | } | |
2562 | node = rb_next(node); | |
2563 | } | |
2564 | spin_unlock(&delayed_refs->lock); | |
56bec294 CM |
2565 | schedule_timeout(1); |
2566 | goto again; | |
5f39d397 | 2567 | } |
54aa1f4d | 2568 | out: |
c3e69d58 | 2569 | spin_unlock(&delayed_refs->lock); |
edf39272 | 2570 | assert_qgroups_uptodate(trans); |
a28ec197 CM |
2571 | return 0; |
2572 | } | |
2573 | ||
5d4f98a2 YZ |
2574 | int btrfs_set_disk_extent_flags(struct btrfs_trans_handle *trans, |
2575 | struct btrfs_root *root, | |
2576 | u64 bytenr, u64 num_bytes, u64 flags, | |
2577 | int is_data) | |
2578 | { | |
2579 | struct btrfs_delayed_extent_op *extent_op; | |
2580 | int ret; | |
2581 | ||
2582 | extent_op = kmalloc(sizeof(*extent_op), GFP_NOFS); | |
2583 | if (!extent_op) | |
2584 | return -ENOMEM; | |
2585 | ||
2586 | extent_op->flags_to_set = flags; | |
2587 | extent_op->update_flags = 1; | |
2588 | extent_op->update_key = 0; | |
2589 | extent_op->is_data = is_data ? 1 : 0; | |
2590 | ||
66d7e7f0 AJ |
2591 | ret = btrfs_add_delayed_extent_op(root->fs_info, trans, bytenr, |
2592 | num_bytes, extent_op); | |
5d4f98a2 YZ |
2593 | if (ret) |
2594 | kfree(extent_op); | |
2595 | return ret; | |
2596 | } | |
2597 | ||
2598 | static noinline int check_delayed_ref(struct btrfs_trans_handle *trans, | |
2599 | struct btrfs_root *root, | |
2600 | struct btrfs_path *path, | |
2601 | u64 objectid, u64 offset, u64 bytenr) | |
2602 | { | |
2603 | struct btrfs_delayed_ref_head *head; | |
2604 | struct btrfs_delayed_ref_node *ref; | |
2605 | struct btrfs_delayed_data_ref *data_ref; | |
2606 | struct btrfs_delayed_ref_root *delayed_refs; | |
2607 | struct rb_node *node; | |
2608 | int ret = 0; | |
2609 | ||
2610 | ret = -ENOENT; | |
2611 | delayed_refs = &trans->transaction->delayed_refs; | |
2612 | spin_lock(&delayed_refs->lock); | |
2613 | head = btrfs_find_delayed_ref_head(trans, bytenr); | |
2614 | if (!head) | |
2615 | goto out; | |
2616 | ||
2617 | if (!mutex_trylock(&head->mutex)) { | |
2618 | atomic_inc(&head->node.refs); | |
2619 | spin_unlock(&delayed_refs->lock); | |
2620 | ||
b3b4aa74 | 2621 | btrfs_release_path(path); |
5d4f98a2 | 2622 | |
8cc33e5c DS |
2623 | /* |
2624 | * Mutex was contended, block until it's released and let | |
2625 | * caller try again | |
2626 | */ | |
5d4f98a2 YZ |
2627 | mutex_lock(&head->mutex); |
2628 | mutex_unlock(&head->mutex); | |
2629 | btrfs_put_delayed_ref(&head->node); | |
2630 | return -EAGAIN; | |
2631 | } | |
2632 | ||
2633 | node = rb_prev(&head->node.rb_node); | |
2634 | if (!node) | |
2635 | goto out_unlock; | |
2636 | ||
2637 | ref = rb_entry(node, struct btrfs_delayed_ref_node, rb_node); | |
2638 | ||
2639 | if (ref->bytenr != bytenr) | |
2640 | goto out_unlock; | |
2641 | ||
2642 | ret = 1; | |
2643 | if (ref->type != BTRFS_EXTENT_DATA_REF_KEY) | |
2644 | goto out_unlock; | |
2645 | ||
2646 | data_ref = btrfs_delayed_node_to_data_ref(ref); | |
2647 | ||
2648 | node = rb_prev(node); | |
2649 | if (node) { | |
df57dbe6 LB |
2650 | int seq = ref->seq; |
2651 | ||
5d4f98a2 | 2652 | ref = rb_entry(node, struct btrfs_delayed_ref_node, rb_node); |
df57dbe6 | 2653 | if (ref->bytenr == bytenr && ref->seq == seq) |
5d4f98a2 YZ |
2654 | goto out_unlock; |
2655 | } | |
2656 | ||
2657 | if (data_ref->root != root->root_key.objectid || | |
2658 | data_ref->objectid != objectid || data_ref->offset != offset) | |
2659 | goto out_unlock; | |
2660 | ||
2661 | ret = 0; | |
2662 | out_unlock: | |
2663 | mutex_unlock(&head->mutex); | |
2664 | out: | |
2665 | spin_unlock(&delayed_refs->lock); | |
2666 | return ret; | |
2667 | } | |
2668 | ||
2669 | static noinline int check_committed_ref(struct btrfs_trans_handle *trans, | |
2670 | struct btrfs_root *root, | |
2671 | struct btrfs_path *path, | |
2672 | u64 objectid, u64 offset, u64 bytenr) | |
be20aa9d CM |
2673 | { |
2674 | struct btrfs_root *extent_root = root->fs_info->extent_root; | |
f321e491 | 2675 | struct extent_buffer *leaf; |
5d4f98a2 YZ |
2676 | struct btrfs_extent_data_ref *ref; |
2677 | struct btrfs_extent_inline_ref *iref; | |
2678 | struct btrfs_extent_item *ei; | |
f321e491 | 2679 | struct btrfs_key key; |
5d4f98a2 | 2680 | u32 item_size; |
be20aa9d | 2681 | int ret; |
925baedd | 2682 | |
be20aa9d | 2683 | key.objectid = bytenr; |
31840ae1 | 2684 | key.offset = (u64)-1; |
f321e491 | 2685 | key.type = BTRFS_EXTENT_ITEM_KEY; |
be20aa9d | 2686 | |
be20aa9d CM |
2687 | ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0); |
2688 | if (ret < 0) | |
2689 | goto out; | |
79787eaa | 2690 | BUG_ON(ret == 0); /* Corruption */ |
80ff3856 YZ |
2691 | |
2692 | ret = -ENOENT; | |
2693 | if (path->slots[0] == 0) | |
31840ae1 | 2694 | goto out; |
be20aa9d | 2695 | |
31840ae1 | 2696 | path->slots[0]--; |
f321e491 | 2697 | leaf = path->nodes[0]; |
5d4f98a2 | 2698 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); |
be20aa9d | 2699 | |
5d4f98a2 | 2700 | if (key.objectid != bytenr || key.type != BTRFS_EXTENT_ITEM_KEY) |
be20aa9d | 2701 | goto out; |
f321e491 | 2702 | |
5d4f98a2 YZ |
2703 | ret = 1; |
2704 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
2705 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
2706 | if (item_size < sizeof(*ei)) { | |
2707 | WARN_ON(item_size != sizeof(struct btrfs_extent_item_v0)); | |
2708 | goto out; | |
2709 | } | |
2710 | #endif | |
2711 | ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); | |
bd09835d | 2712 | |
5d4f98a2 YZ |
2713 | if (item_size != sizeof(*ei) + |
2714 | btrfs_extent_inline_ref_size(BTRFS_EXTENT_DATA_REF_KEY)) | |
2715 | goto out; | |
be20aa9d | 2716 | |
5d4f98a2 YZ |
2717 | if (btrfs_extent_generation(leaf, ei) <= |
2718 | btrfs_root_last_snapshot(&root->root_item)) | |
2719 | goto out; | |
2720 | ||
2721 | iref = (struct btrfs_extent_inline_ref *)(ei + 1); | |
2722 | if (btrfs_extent_inline_ref_type(leaf, iref) != | |
2723 | BTRFS_EXTENT_DATA_REF_KEY) | |
2724 | goto out; | |
2725 | ||
2726 | ref = (struct btrfs_extent_data_ref *)(&iref->offset); | |
2727 | if (btrfs_extent_refs(leaf, ei) != | |
2728 | btrfs_extent_data_ref_count(leaf, ref) || | |
2729 | btrfs_extent_data_ref_root(leaf, ref) != | |
2730 | root->root_key.objectid || | |
2731 | btrfs_extent_data_ref_objectid(leaf, ref) != objectid || | |
2732 | btrfs_extent_data_ref_offset(leaf, ref) != offset) | |
2733 | goto out; | |
2734 | ||
2735 | ret = 0; | |
2736 | out: | |
2737 | return ret; | |
2738 | } | |
2739 | ||
2740 | int btrfs_cross_ref_exist(struct btrfs_trans_handle *trans, | |
2741 | struct btrfs_root *root, | |
2742 | u64 objectid, u64 offset, u64 bytenr) | |
2743 | { | |
2744 | struct btrfs_path *path; | |
2745 | int ret; | |
2746 | int ret2; | |
2747 | ||
2748 | path = btrfs_alloc_path(); | |
2749 | if (!path) | |
2750 | return -ENOENT; | |
2751 | ||
2752 | do { | |
2753 | ret = check_committed_ref(trans, root, path, objectid, | |
2754 | offset, bytenr); | |
2755 | if (ret && ret != -ENOENT) | |
f321e491 | 2756 | goto out; |
80ff3856 | 2757 | |
5d4f98a2 YZ |
2758 | ret2 = check_delayed_ref(trans, root, path, objectid, |
2759 | offset, bytenr); | |
2760 | } while (ret2 == -EAGAIN); | |
2761 | ||
2762 | if (ret2 && ret2 != -ENOENT) { | |
2763 | ret = ret2; | |
2764 | goto out; | |
f321e491 | 2765 | } |
5d4f98a2 YZ |
2766 | |
2767 | if (ret != -ENOENT || ret2 != -ENOENT) | |
2768 | ret = 0; | |
be20aa9d | 2769 | out: |
80ff3856 | 2770 | btrfs_free_path(path); |
f0486c68 YZ |
2771 | if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID) |
2772 | WARN_ON(ret > 0); | |
f321e491 | 2773 | return ret; |
be20aa9d | 2774 | } |
c5739bba | 2775 | |
5d4f98a2 | 2776 | static int __btrfs_mod_ref(struct btrfs_trans_handle *trans, |
b7a9f29f | 2777 | struct btrfs_root *root, |
5d4f98a2 | 2778 | struct extent_buffer *buf, |
66d7e7f0 | 2779 | int full_backref, int inc, int for_cow) |
31840ae1 ZY |
2780 | { |
2781 | u64 bytenr; | |
5d4f98a2 YZ |
2782 | u64 num_bytes; |
2783 | u64 parent; | |
31840ae1 | 2784 | u64 ref_root; |
31840ae1 | 2785 | u32 nritems; |
31840ae1 ZY |
2786 | struct btrfs_key key; |
2787 | struct btrfs_file_extent_item *fi; | |
2788 | int i; | |
2789 | int level; | |
2790 | int ret = 0; | |
31840ae1 | 2791 | int (*process_func)(struct btrfs_trans_handle *, struct btrfs_root *, |
66d7e7f0 | 2792 | u64, u64, u64, u64, u64, u64, int); |
31840ae1 ZY |
2793 | |
2794 | ref_root = btrfs_header_owner(buf); | |
31840ae1 ZY |
2795 | nritems = btrfs_header_nritems(buf); |
2796 | level = btrfs_header_level(buf); | |
2797 | ||
5d4f98a2 YZ |
2798 | if (!root->ref_cows && level == 0) |
2799 | return 0; | |
31840ae1 | 2800 | |
5d4f98a2 YZ |
2801 | if (inc) |
2802 | process_func = btrfs_inc_extent_ref; | |
2803 | else | |
2804 | process_func = btrfs_free_extent; | |
31840ae1 | 2805 | |
5d4f98a2 YZ |
2806 | if (full_backref) |
2807 | parent = buf->start; | |
2808 | else | |
2809 | parent = 0; | |
2810 | ||
2811 | for (i = 0; i < nritems; i++) { | |
31840ae1 | 2812 | if (level == 0) { |
5d4f98a2 | 2813 | btrfs_item_key_to_cpu(buf, &key, i); |
31840ae1 ZY |
2814 | if (btrfs_key_type(&key) != BTRFS_EXTENT_DATA_KEY) |
2815 | continue; | |
5d4f98a2 | 2816 | fi = btrfs_item_ptr(buf, i, |
31840ae1 ZY |
2817 | struct btrfs_file_extent_item); |
2818 | if (btrfs_file_extent_type(buf, fi) == | |
2819 | BTRFS_FILE_EXTENT_INLINE) | |
2820 | continue; | |
2821 | bytenr = btrfs_file_extent_disk_bytenr(buf, fi); | |
2822 | if (bytenr == 0) | |
2823 | continue; | |
5d4f98a2 YZ |
2824 | |
2825 | num_bytes = btrfs_file_extent_disk_num_bytes(buf, fi); | |
2826 | key.offset -= btrfs_file_extent_offset(buf, fi); | |
2827 | ret = process_func(trans, root, bytenr, num_bytes, | |
2828 | parent, ref_root, key.objectid, | |
66d7e7f0 | 2829 | key.offset, for_cow); |
31840ae1 ZY |
2830 | if (ret) |
2831 | goto fail; | |
2832 | } else { | |
5d4f98a2 YZ |
2833 | bytenr = btrfs_node_blockptr(buf, i); |
2834 | num_bytes = btrfs_level_size(root, level - 1); | |
2835 | ret = process_func(trans, root, bytenr, num_bytes, | |
66d7e7f0 AJ |
2836 | parent, ref_root, level - 1, 0, |
2837 | for_cow); | |
31840ae1 ZY |
2838 | if (ret) |
2839 | goto fail; | |
2840 | } | |
2841 | } | |
2842 | return 0; | |
2843 | fail: | |
5d4f98a2 YZ |
2844 | return ret; |
2845 | } | |
2846 | ||
2847 | int btrfs_inc_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root, | |
66d7e7f0 | 2848 | struct extent_buffer *buf, int full_backref, int for_cow) |
5d4f98a2 | 2849 | { |
66d7e7f0 | 2850 | return __btrfs_mod_ref(trans, root, buf, full_backref, 1, for_cow); |
5d4f98a2 YZ |
2851 | } |
2852 | ||
2853 | int btrfs_dec_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root, | |
66d7e7f0 | 2854 | struct extent_buffer *buf, int full_backref, int for_cow) |
5d4f98a2 | 2855 | { |
66d7e7f0 | 2856 | return __btrfs_mod_ref(trans, root, buf, full_backref, 0, for_cow); |
31840ae1 ZY |
2857 | } |
2858 | ||
9078a3e1 CM |
2859 | static int write_one_cache_group(struct btrfs_trans_handle *trans, |
2860 | struct btrfs_root *root, | |
2861 | struct btrfs_path *path, | |
2862 | struct btrfs_block_group_cache *cache) | |
2863 | { | |
2864 | int ret; | |
9078a3e1 | 2865 | struct btrfs_root *extent_root = root->fs_info->extent_root; |
5f39d397 CM |
2866 | unsigned long bi; |
2867 | struct extent_buffer *leaf; | |
9078a3e1 | 2868 | |
9078a3e1 | 2869 | ret = btrfs_search_slot(trans, extent_root, &cache->key, path, 0, 1); |
54aa1f4d CM |
2870 | if (ret < 0) |
2871 | goto fail; | |
79787eaa | 2872 | BUG_ON(ret); /* Corruption */ |
5f39d397 CM |
2873 | |
2874 | leaf = path->nodes[0]; | |
2875 | bi = btrfs_item_ptr_offset(leaf, path->slots[0]); | |
2876 | write_extent_buffer(leaf, &cache->item, bi, sizeof(cache->item)); | |
2877 | btrfs_mark_buffer_dirty(leaf); | |
b3b4aa74 | 2878 | btrfs_release_path(path); |
54aa1f4d | 2879 | fail: |
79787eaa JM |
2880 | if (ret) { |
2881 | btrfs_abort_transaction(trans, root, ret); | |
9078a3e1 | 2882 | return ret; |
79787eaa | 2883 | } |
9078a3e1 CM |
2884 | return 0; |
2885 | ||
2886 | } | |
2887 | ||
4a8c9a62 YZ |
2888 | static struct btrfs_block_group_cache * |
2889 | next_block_group(struct btrfs_root *root, | |
2890 | struct btrfs_block_group_cache *cache) | |
2891 | { | |
2892 | struct rb_node *node; | |
2893 | spin_lock(&root->fs_info->block_group_cache_lock); | |
2894 | node = rb_next(&cache->cache_node); | |
2895 | btrfs_put_block_group(cache); | |
2896 | if (node) { | |
2897 | cache = rb_entry(node, struct btrfs_block_group_cache, | |
2898 | cache_node); | |
11dfe35a | 2899 | btrfs_get_block_group(cache); |
4a8c9a62 YZ |
2900 | } else |
2901 | cache = NULL; | |
2902 | spin_unlock(&root->fs_info->block_group_cache_lock); | |
2903 | return cache; | |
2904 | } | |
2905 | ||
0af3d00b JB |
2906 | static int cache_save_setup(struct btrfs_block_group_cache *block_group, |
2907 | struct btrfs_trans_handle *trans, | |
2908 | struct btrfs_path *path) | |
2909 | { | |
2910 | struct btrfs_root *root = block_group->fs_info->tree_root; | |
2911 | struct inode *inode = NULL; | |
2912 | u64 alloc_hint = 0; | |
2b20982e | 2913 | int dcs = BTRFS_DC_ERROR; |
0af3d00b JB |
2914 | int num_pages = 0; |
2915 | int retries = 0; | |
2916 | int ret = 0; | |
2917 | ||
2918 | /* | |
2919 | * If this block group is smaller than 100 megs don't bother caching the | |
2920 | * block group. | |
2921 | */ | |
2922 | if (block_group->key.offset < (100 * 1024 * 1024)) { | |
2923 | spin_lock(&block_group->lock); | |
2924 | block_group->disk_cache_state = BTRFS_DC_WRITTEN; | |
2925 | spin_unlock(&block_group->lock); | |
2926 | return 0; | |
2927 | } | |
2928 | ||
2929 | again: | |
2930 | inode = lookup_free_space_inode(root, block_group, path); | |
2931 | if (IS_ERR(inode) && PTR_ERR(inode) != -ENOENT) { | |
2932 | ret = PTR_ERR(inode); | |
b3b4aa74 | 2933 | btrfs_release_path(path); |
0af3d00b JB |
2934 | goto out; |
2935 | } | |
2936 | ||
2937 | if (IS_ERR(inode)) { | |
2938 | BUG_ON(retries); | |
2939 | retries++; | |
2940 | ||
2941 | if (block_group->ro) | |
2942 | goto out_free; | |
2943 | ||
2944 | ret = create_free_space_inode(root, trans, block_group, path); | |
2945 | if (ret) | |
2946 | goto out_free; | |
2947 | goto again; | |
2948 | } | |
2949 | ||
5b0e95bf JB |
2950 | /* We've already setup this transaction, go ahead and exit */ |
2951 | if (block_group->cache_generation == trans->transid && | |
2952 | i_size_read(inode)) { | |
2953 | dcs = BTRFS_DC_SETUP; | |
2954 | goto out_put; | |
2955 | } | |
2956 | ||
0af3d00b JB |
2957 | /* |
2958 | * We want to set the generation to 0, that way if anything goes wrong | |
2959 | * from here on out we know not to trust this cache when we load up next | |
2960 | * time. | |
2961 | */ | |
2962 | BTRFS_I(inode)->generation = 0; | |
2963 | ret = btrfs_update_inode(trans, root, inode); | |
2964 | WARN_ON(ret); | |
2965 | ||
2966 | if (i_size_read(inode) > 0) { | |
2967 | ret = btrfs_truncate_free_space_cache(root, trans, path, | |
2968 | inode); | |
2969 | if (ret) | |
2970 | goto out_put; | |
2971 | } | |
2972 | ||
2973 | spin_lock(&block_group->lock); | |
cf7c1ef6 LB |
2974 | if (block_group->cached != BTRFS_CACHE_FINISHED || |
2975 | !btrfs_test_opt(root, SPACE_CACHE)) { | |
2976 | /* | |
2977 | * don't bother trying to write stuff out _if_ | |
2978 | * a) we're not cached, | |
2979 | * b) we're with nospace_cache mount option. | |
2980 | */ | |
2b20982e | 2981 | dcs = BTRFS_DC_WRITTEN; |
0af3d00b JB |
2982 | spin_unlock(&block_group->lock); |
2983 | goto out_put; | |
2984 | } | |
2985 | spin_unlock(&block_group->lock); | |
2986 | ||
6fc823b1 JB |
2987 | /* |
2988 | * Try to preallocate enough space based on how big the block group is. | |
2989 | * Keep in mind this has to include any pinned space which could end up | |
2990 | * taking up quite a bit since it's not folded into the other space | |
2991 | * cache. | |
2992 | */ | |
2993 | num_pages = (int)div64_u64(block_group->key.offset, 256 * 1024 * 1024); | |
0af3d00b JB |
2994 | if (!num_pages) |
2995 | num_pages = 1; | |
2996 | ||
0af3d00b JB |
2997 | num_pages *= 16; |
2998 | num_pages *= PAGE_CACHE_SIZE; | |
2999 | ||
3000 | ret = btrfs_check_data_free_space(inode, num_pages); | |
3001 | if (ret) | |
3002 | goto out_put; | |
3003 | ||
3004 | ret = btrfs_prealloc_file_range_trans(inode, trans, 0, 0, num_pages, | |
3005 | num_pages, num_pages, | |
3006 | &alloc_hint); | |
2b20982e JB |
3007 | if (!ret) |
3008 | dcs = BTRFS_DC_SETUP; | |
0af3d00b | 3009 | btrfs_free_reserved_data_space(inode, num_pages); |
c09544e0 | 3010 | |
0af3d00b JB |
3011 | out_put: |
3012 | iput(inode); | |
3013 | out_free: | |
b3b4aa74 | 3014 | btrfs_release_path(path); |
0af3d00b JB |
3015 | out: |
3016 | spin_lock(&block_group->lock); | |
e65cbb94 | 3017 | if (!ret && dcs == BTRFS_DC_SETUP) |
5b0e95bf | 3018 | block_group->cache_generation = trans->transid; |
2b20982e | 3019 | block_group->disk_cache_state = dcs; |
0af3d00b JB |
3020 | spin_unlock(&block_group->lock); |
3021 | ||
3022 | return ret; | |
3023 | } | |
3024 | ||
96b5179d CM |
3025 | int btrfs_write_dirty_block_groups(struct btrfs_trans_handle *trans, |
3026 | struct btrfs_root *root) | |
9078a3e1 | 3027 | { |
4a8c9a62 | 3028 | struct btrfs_block_group_cache *cache; |
9078a3e1 | 3029 | int err = 0; |
9078a3e1 | 3030 | struct btrfs_path *path; |
96b5179d | 3031 | u64 last = 0; |
9078a3e1 CM |
3032 | |
3033 | path = btrfs_alloc_path(); | |
3034 | if (!path) | |
3035 | return -ENOMEM; | |
3036 | ||
0af3d00b JB |
3037 | again: |
3038 | while (1) { | |
3039 | cache = btrfs_lookup_first_block_group(root->fs_info, last); | |
3040 | while (cache) { | |
3041 | if (cache->disk_cache_state == BTRFS_DC_CLEAR) | |
3042 | break; | |
3043 | cache = next_block_group(root, cache); | |
3044 | } | |
3045 | if (!cache) { | |
3046 | if (last == 0) | |
3047 | break; | |
3048 | last = 0; | |
3049 | continue; | |
3050 | } | |
3051 | err = cache_save_setup(cache, trans, path); | |
3052 | last = cache->key.objectid + cache->key.offset; | |
3053 | btrfs_put_block_group(cache); | |
3054 | } | |
3055 | ||
d397712b | 3056 | while (1) { |
4a8c9a62 YZ |
3057 | if (last == 0) { |
3058 | err = btrfs_run_delayed_refs(trans, root, | |
3059 | (unsigned long)-1); | |
79787eaa JM |
3060 | if (err) /* File system offline */ |
3061 | goto out; | |
0f9dd46c | 3062 | } |
54aa1f4d | 3063 | |
4a8c9a62 YZ |
3064 | cache = btrfs_lookup_first_block_group(root->fs_info, last); |
3065 | while (cache) { | |
0af3d00b JB |
3066 | if (cache->disk_cache_state == BTRFS_DC_CLEAR) { |
3067 | btrfs_put_block_group(cache); | |
3068 | goto again; | |
3069 | } | |
3070 | ||
4a8c9a62 YZ |
3071 | if (cache->dirty) |
3072 | break; | |
3073 | cache = next_block_group(root, cache); | |
3074 | } | |
3075 | if (!cache) { | |
3076 | if (last == 0) | |
3077 | break; | |
3078 | last = 0; | |
3079 | continue; | |
3080 | } | |
0f9dd46c | 3081 | |
0cb59c99 JB |
3082 | if (cache->disk_cache_state == BTRFS_DC_SETUP) |
3083 | cache->disk_cache_state = BTRFS_DC_NEED_WRITE; | |
e8569813 | 3084 | cache->dirty = 0; |
4a8c9a62 | 3085 | last = cache->key.objectid + cache->key.offset; |
0f9dd46c | 3086 | |
4a8c9a62 | 3087 | err = write_one_cache_group(trans, root, path, cache); |
79787eaa JM |
3088 | if (err) /* File system offline */ |
3089 | goto out; | |
3090 | ||
4a8c9a62 | 3091 | btrfs_put_block_group(cache); |
9078a3e1 | 3092 | } |
4a8c9a62 | 3093 | |
0cb59c99 JB |
3094 | while (1) { |
3095 | /* | |
3096 | * I don't think this is needed since we're just marking our | |
3097 | * preallocated extent as written, but just in case it can't | |
3098 | * hurt. | |
3099 | */ | |
3100 | if (last == 0) { | |
3101 | err = btrfs_run_delayed_refs(trans, root, | |
3102 | (unsigned long)-1); | |
79787eaa JM |
3103 | if (err) /* File system offline */ |
3104 | goto out; | |
0cb59c99 JB |
3105 | } |
3106 | ||
3107 | cache = btrfs_lookup_first_block_group(root->fs_info, last); | |
3108 | while (cache) { | |
3109 | /* | |
3110 | * Really this shouldn't happen, but it could if we | |
3111 | * couldn't write the entire preallocated extent and | |
3112 | * splitting the extent resulted in a new block. | |
3113 | */ | |
3114 | if (cache->dirty) { | |
3115 | btrfs_put_block_group(cache); | |
3116 | goto again; | |
3117 | } | |
3118 | if (cache->disk_cache_state == BTRFS_DC_NEED_WRITE) | |
3119 | break; | |
3120 | cache = next_block_group(root, cache); | |
3121 | } | |
3122 | if (!cache) { | |
3123 | if (last == 0) | |
3124 | break; | |
3125 | last = 0; | |
3126 | continue; | |
3127 | } | |
3128 | ||
79787eaa | 3129 | err = btrfs_write_out_cache(root, trans, cache, path); |
0cb59c99 JB |
3130 | |
3131 | /* | |
3132 | * If we didn't have an error then the cache state is still | |
3133 | * NEED_WRITE, so we can set it to WRITTEN. | |
3134 | */ | |
79787eaa | 3135 | if (!err && cache->disk_cache_state == BTRFS_DC_NEED_WRITE) |
0cb59c99 JB |
3136 | cache->disk_cache_state = BTRFS_DC_WRITTEN; |
3137 | last = cache->key.objectid + cache->key.offset; | |
3138 | btrfs_put_block_group(cache); | |
3139 | } | |
79787eaa | 3140 | out: |
0cb59c99 | 3141 | |
9078a3e1 | 3142 | btrfs_free_path(path); |
79787eaa | 3143 | return err; |
9078a3e1 CM |
3144 | } |
3145 | ||
d2fb3437 YZ |
3146 | int btrfs_extent_readonly(struct btrfs_root *root, u64 bytenr) |
3147 | { | |
3148 | struct btrfs_block_group_cache *block_group; | |
3149 | int readonly = 0; | |
3150 | ||
3151 | block_group = btrfs_lookup_block_group(root->fs_info, bytenr); | |
3152 | if (!block_group || block_group->ro) | |
3153 | readonly = 1; | |
3154 | if (block_group) | |
fa9c0d79 | 3155 | btrfs_put_block_group(block_group); |
d2fb3437 YZ |
3156 | return readonly; |
3157 | } | |
3158 | ||
593060d7 CM |
3159 | static int update_space_info(struct btrfs_fs_info *info, u64 flags, |
3160 | u64 total_bytes, u64 bytes_used, | |
3161 | struct btrfs_space_info **space_info) | |
3162 | { | |
3163 | struct btrfs_space_info *found; | |
b742bb82 YZ |
3164 | int i; |
3165 | int factor; | |
3166 | ||
3167 | if (flags & (BTRFS_BLOCK_GROUP_DUP | BTRFS_BLOCK_GROUP_RAID1 | | |
3168 | BTRFS_BLOCK_GROUP_RAID10)) | |
3169 | factor = 2; | |
3170 | else | |
3171 | factor = 1; | |
593060d7 CM |
3172 | |
3173 | found = __find_space_info(info, flags); | |
3174 | if (found) { | |
25179201 | 3175 | spin_lock(&found->lock); |
593060d7 | 3176 | found->total_bytes += total_bytes; |
89a55897 | 3177 | found->disk_total += total_bytes * factor; |
593060d7 | 3178 | found->bytes_used += bytes_used; |
b742bb82 | 3179 | found->disk_used += bytes_used * factor; |
8f18cf13 | 3180 | found->full = 0; |
25179201 | 3181 | spin_unlock(&found->lock); |
593060d7 CM |
3182 | *space_info = found; |
3183 | return 0; | |
3184 | } | |
c146afad | 3185 | found = kzalloc(sizeof(*found), GFP_NOFS); |
593060d7 CM |
3186 | if (!found) |
3187 | return -ENOMEM; | |
3188 | ||
b742bb82 YZ |
3189 | for (i = 0; i < BTRFS_NR_RAID_TYPES; i++) |
3190 | INIT_LIST_HEAD(&found->block_groups[i]); | |
80eb234a | 3191 | init_rwsem(&found->groups_sem); |
0f9dd46c | 3192 | spin_lock_init(&found->lock); |
52ba6929 | 3193 | found->flags = flags & BTRFS_BLOCK_GROUP_TYPE_MASK; |
593060d7 | 3194 | found->total_bytes = total_bytes; |
89a55897 | 3195 | found->disk_total = total_bytes * factor; |
593060d7 | 3196 | found->bytes_used = bytes_used; |
b742bb82 | 3197 | found->disk_used = bytes_used * factor; |
593060d7 | 3198 | found->bytes_pinned = 0; |
e8569813 | 3199 | found->bytes_reserved = 0; |
c146afad | 3200 | found->bytes_readonly = 0; |
f0486c68 | 3201 | found->bytes_may_use = 0; |
593060d7 | 3202 | found->full = 0; |
0e4f8f88 | 3203 | found->force_alloc = CHUNK_ALLOC_NO_FORCE; |
6d74119f | 3204 | found->chunk_alloc = 0; |
fdb5effd JB |
3205 | found->flush = 0; |
3206 | init_waitqueue_head(&found->wait); | |
593060d7 | 3207 | *space_info = found; |
4184ea7f | 3208 | list_add_rcu(&found->list, &info->space_info); |
b4d7c3c9 LZ |
3209 | if (flags & BTRFS_BLOCK_GROUP_DATA) |
3210 | info->data_sinfo = found; | |
593060d7 CM |
3211 | return 0; |
3212 | } | |
3213 | ||
8790d502 CM |
3214 | static void set_avail_alloc_bits(struct btrfs_fs_info *fs_info, u64 flags) |
3215 | { | |
899c81ea ID |
3216 | u64 extra_flags = chunk_to_extended(flags) & |
3217 | BTRFS_EXTENDED_PROFILE_MASK; | |
a46d11a8 ID |
3218 | |
3219 | if (flags & BTRFS_BLOCK_GROUP_DATA) | |
3220 | fs_info->avail_data_alloc_bits |= extra_flags; | |
3221 | if (flags & BTRFS_BLOCK_GROUP_METADATA) | |
3222 | fs_info->avail_metadata_alloc_bits |= extra_flags; | |
3223 | if (flags & BTRFS_BLOCK_GROUP_SYSTEM) | |
3224 | fs_info->avail_system_alloc_bits |= extra_flags; | |
8790d502 | 3225 | } |
593060d7 | 3226 | |
fc67c450 ID |
3227 | /* |
3228 | * returns target flags in extended format or 0 if restripe for this | |
3229 | * chunk_type is not in progress | |
c6664b42 ID |
3230 | * |
3231 | * should be called with either volume_mutex or balance_lock held | |
fc67c450 ID |
3232 | */ |
3233 | static u64 get_restripe_target(struct btrfs_fs_info *fs_info, u64 flags) | |
3234 | { | |
3235 | struct btrfs_balance_control *bctl = fs_info->balance_ctl; | |
3236 | u64 target = 0; | |
3237 | ||
fc67c450 ID |
3238 | if (!bctl) |
3239 | return 0; | |
3240 | ||
3241 | if (flags & BTRFS_BLOCK_GROUP_DATA && | |
3242 | bctl->data.flags & BTRFS_BALANCE_ARGS_CONVERT) { | |
3243 | target = BTRFS_BLOCK_GROUP_DATA | bctl->data.target; | |
3244 | } else if (flags & BTRFS_BLOCK_GROUP_SYSTEM && | |
3245 | bctl->sys.flags & BTRFS_BALANCE_ARGS_CONVERT) { | |
3246 | target = BTRFS_BLOCK_GROUP_SYSTEM | bctl->sys.target; | |
3247 | } else if (flags & BTRFS_BLOCK_GROUP_METADATA && | |
3248 | bctl->meta.flags & BTRFS_BALANCE_ARGS_CONVERT) { | |
3249 | target = BTRFS_BLOCK_GROUP_METADATA | bctl->meta.target; | |
3250 | } | |
3251 | ||
3252 | return target; | |
3253 | } | |
3254 | ||
a46d11a8 ID |
3255 | /* |
3256 | * @flags: available profiles in extended format (see ctree.h) | |
3257 | * | |
e4d8ec0f ID |
3258 | * Returns reduced profile in chunk format. If profile changing is in |
3259 | * progress (either running or paused) picks the target profile (if it's | |
3260 | * already available), otherwise falls back to plain reducing. | |
a46d11a8 | 3261 | */ |
2b82032c | 3262 | u64 btrfs_reduce_alloc_profile(struct btrfs_root *root, u64 flags) |
ec44a35c | 3263 | { |
cd02dca5 CM |
3264 | /* |
3265 | * we add in the count of missing devices because we want | |
3266 | * to make sure that any RAID levels on a degraded FS | |
3267 | * continue to be honored. | |
3268 | */ | |
3269 | u64 num_devices = root->fs_info->fs_devices->rw_devices + | |
3270 | root->fs_info->fs_devices->missing_devices; | |
fc67c450 | 3271 | u64 target; |
a061fc8d | 3272 | |
fc67c450 ID |
3273 | /* |
3274 | * see if restripe for this chunk_type is in progress, if so | |
3275 | * try to reduce to the target profile | |
3276 | */ | |
e4d8ec0f | 3277 | spin_lock(&root->fs_info->balance_lock); |
fc67c450 ID |
3278 | target = get_restripe_target(root->fs_info, flags); |
3279 | if (target) { | |
3280 | /* pick target profile only if it's already available */ | |
3281 | if ((flags & target) & BTRFS_EXTENDED_PROFILE_MASK) { | |
e4d8ec0f | 3282 | spin_unlock(&root->fs_info->balance_lock); |
fc67c450 | 3283 | return extended_to_chunk(target); |
e4d8ec0f ID |
3284 | } |
3285 | } | |
3286 | spin_unlock(&root->fs_info->balance_lock); | |
3287 | ||
a061fc8d CM |
3288 | if (num_devices == 1) |
3289 | flags &= ~(BTRFS_BLOCK_GROUP_RAID1 | BTRFS_BLOCK_GROUP_RAID0); | |
3290 | if (num_devices < 4) | |
3291 | flags &= ~BTRFS_BLOCK_GROUP_RAID10; | |
3292 | ||
ec44a35c CM |
3293 | if ((flags & BTRFS_BLOCK_GROUP_DUP) && |
3294 | (flags & (BTRFS_BLOCK_GROUP_RAID1 | | |
a061fc8d | 3295 | BTRFS_BLOCK_GROUP_RAID10))) { |
ec44a35c | 3296 | flags &= ~BTRFS_BLOCK_GROUP_DUP; |
a061fc8d | 3297 | } |
ec44a35c CM |
3298 | |
3299 | if ((flags & BTRFS_BLOCK_GROUP_RAID1) && | |
a061fc8d | 3300 | (flags & BTRFS_BLOCK_GROUP_RAID10)) { |
ec44a35c | 3301 | flags &= ~BTRFS_BLOCK_GROUP_RAID1; |
a061fc8d | 3302 | } |
ec44a35c CM |
3303 | |
3304 | if ((flags & BTRFS_BLOCK_GROUP_RAID0) && | |
3305 | ((flags & BTRFS_BLOCK_GROUP_RAID1) | | |
3306 | (flags & BTRFS_BLOCK_GROUP_RAID10) | | |
a46d11a8 | 3307 | (flags & BTRFS_BLOCK_GROUP_DUP))) { |
ec44a35c | 3308 | flags &= ~BTRFS_BLOCK_GROUP_RAID0; |
a46d11a8 ID |
3309 | } |
3310 | ||
899c81ea | 3311 | return extended_to_chunk(flags); |
ec44a35c CM |
3312 | } |
3313 | ||
b742bb82 | 3314 | static u64 get_alloc_profile(struct btrfs_root *root, u64 flags) |
6a63209f | 3315 | { |
b742bb82 | 3316 | if (flags & BTRFS_BLOCK_GROUP_DATA) |
6fef8df1 | 3317 | flags |= root->fs_info->avail_data_alloc_bits; |
b742bb82 | 3318 | else if (flags & BTRFS_BLOCK_GROUP_SYSTEM) |
6fef8df1 | 3319 | flags |= root->fs_info->avail_system_alloc_bits; |
b742bb82 | 3320 | else if (flags & BTRFS_BLOCK_GROUP_METADATA) |
6fef8df1 ID |
3321 | flags |= root->fs_info->avail_metadata_alloc_bits; |
3322 | ||
b742bb82 | 3323 | return btrfs_reduce_alloc_profile(root, flags); |
6a63209f JB |
3324 | } |
3325 | ||
6d07bcec | 3326 | u64 btrfs_get_alloc_profile(struct btrfs_root *root, int data) |
9ed74f2d | 3327 | { |
b742bb82 | 3328 | u64 flags; |
9ed74f2d | 3329 | |
b742bb82 YZ |
3330 | if (data) |
3331 | flags = BTRFS_BLOCK_GROUP_DATA; | |
3332 | else if (root == root->fs_info->chunk_root) | |
3333 | flags = BTRFS_BLOCK_GROUP_SYSTEM; | |
9ed74f2d | 3334 | else |
b742bb82 | 3335 | flags = BTRFS_BLOCK_GROUP_METADATA; |
9ed74f2d | 3336 | |
b742bb82 | 3337 | return get_alloc_profile(root, flags); |
6a63209f | 3338 | } |
9ed74f2d | 3339 | |
6a63209f | 3340 | /* |
6a63209f JB |
3341 | * This will check the space that the inode allocates from to make sure we have |
3342 | * enough space for bytes. | |
6a63209f | 3343 | */ |
0ca1f7ce | 3344 | int btrfs_check_data_free_space(struct inode *inode, u64 bytes) |
6a63209f | 3345 | { |
6a63209f | 3346 | struct btrfs_space_info *data_sinfo; |
0ca1f7ce | 3347 | struct btrfs_root *root = BTRFS_I(inode)->root; |
b4d7c3c9 | 3348 | struct btrfs_fs_info *fs_info = root->fs_info; |
ab6e2410 | 3349 | u64 used; |
0af3d00b | 3350 | int ret = 0, committed = 0, alloc_chunk = 1; |
6a63209f | 3351 | |
6a63209f JB |
3352 | /* make sure bytes are sectorsize aligned */ |
3353 | bytes = (bytes + root->sectorsize - 1) & ~((u64)root->sectorsize - 1); | |
6a63209f | 3354 | |
82d5902d LZ |
3355 | if (root == root->fs_info->tree_root || |
3356 | BTRFS_I(inode)->location.objectid == BTRFS_FREE_INO_OBJECTID) { | |
0af3d00b JB |
3357 | alloc_chunk = 0; |
3358 | committed = 1; | |
3359 | } | |
3360 | ||
b4d7c3c9 | 3361 | data_sinfo = fs_info->data_sinfo; |
33b4d47f CM |
3362 | if (!data_sinfo) |
3363 | goto alloc; | |
9ed74f2d | 3364 | |
6a63209f JB |
3365 | again: |
3366 | /* make sure we have enough space to handle the data first */ | |
3367 | spin_lock(&data_sinfo->lock); | |
8929ecfa YZ |
3368 | used = data_sinfo->bytes_used + data_sinfo->bytes_reserved + |
3369 | data_sinfo->bytes_pinned + data_sinfo->bytes_readonly + | |
3370 | data_sinfo->bytes_may_use; | |
ab6e2410 JB |
3371 | |
3372 | if (used + bytes > data_sinfo->total_bytes) { | |
4e06bdd6 | 3373 | struct btrfs_trans_handle *trans; |
9ed74f2d | 3374 | |
6a63209f JB |
3375 | /* |
3376 | * if we don't have enough free bytes in this space then we need | |
3377 | * to alloc a new chunk. | |
3378 | */ | |
0af3d00b | 3379 | if (!data_sinfo->full && alloc_chunk) { |
6a63209f | 3380 | u64 alloc_target; |
9ed74f2d | 3381 | |
0e4f8f88 | 3382 | data_sinfo->force_alloc = CHUNK_ALLOC_FORCE; |
6a63209f | 3383 | spin_unlock(&data_sinfo->lock); |
33b4d47f | 3384 | alloc: |
6a63209f | 3385 | alloc_target = btrfs_get_alloc_profile(root, 1); |
7a7eaa40 | 3386 | trans = btrfs_join_transaction(root); |
a22285a6 YZ |
3387 | if (IS_ERR(trans)) |
3388 | return PTR_ERR(trans); | |
9ed74f2d | 3389 | |
6a63209f | 3390 | ret = do_chunk_alloc(trans, root->fs_info->extent_root, |
0e4f8f88 CM |
3391 | alloc_target, |
3392 | CHUNK_ALLOC_NO_FORCE); | |
6a63209f | 3393 | btrfs_end_transaction(trans, root); |
d52a5b5f MX |
3394 | if (ret < 0) { |
3395 | if (ret != -ENOSPC) | |
3396 | return ret; | |
3397 | else | |
3398 | goto commit_trans; | |
3399 | } | |
9ed74f2d | 3400 | |
b4d7c3c9 LZ |
3401 | if (!data_sinfo) |
3402 | data_sinfo = fs_info->data_sinfo; | |
3403 | ||
6a63209f JB |
3404 | goto again; |
3405 | } | |
f2bb8f5c JB |
3406 | |
3407 | /* | |
3408 | * If we have less pinned bytes than we want to allocate then | |
3409 | * don't bother committing the transaction, it won't help us. | |
3410 | */ | |
3411 | if (data_sinfo->bytes_pinned < bytes) | |
3412 | committed = 1; | |
6a63209f | 3413 | spin_unlock(&data_sinfo->lock); |
6a63209f | 3414 | |
4e06bdd6 | 3415 | /* commit the current transaction and try again */ |
d52a5b5f | 3416 | commit_trans: |
a4abeea4 JB |
3417 | if (!committed && |
3418 | !atomic_read(&root->fs_info->open_ioctl_trans)) { | |
4e06bdd6 | 3419 | committed = 1; |
7a7eaa40 | 3420 | trans = btrfs_join_transaction(root); |
a22285a6 YZ |
3421 | if (IS_ERR(trans)) |
3422 | return PTR_ERR(trans); | |
4e06bdd6 JB |
3423 | ret = btrfs_commit_transaction(trans, root); |
3424 | if (ret) | |
3425 | return ret; | |
3426 | goto again; | |
3427 | } | |
9ed74f2d | 3428 | |
6a63209f JB |
3429 | return -ENOSPC; |
3430 | } | |
3431 | data_sinfo->bytes_may_use += bytes; | |
8c2a3ca2 | 3432 | trace_btrfs_space_reservation(root->fs_info, "space_info", |
2bcc0328 | 3433 | data_sinfo->flags, bytes, 1); |
6a63209f | 3434 | spin_unlock(&data_sinfo->lock); |
6a63209f | 3435 | |
9ed74f2d | 3436 | return 0; |
9ed74f2d | 3437 | } |
6a63209f | 3438 | |
6a63209f | 3439 | /* |
fb25e914 | 3440 | * Called if we need to clear a data reservation for this inode. |
6a63209f | 3441 | */ |
0ca1f7ce | 3442 | void btrfs_free_reserved_data_space(struct inode *inode, u64 bytes) |
e3ccfa98 | 3443 | { |
0ca1f7ce | 3444 | struct btrfs_root *root = BTRFS_I(inode)->root; |
6a63209f | 3445 | struct btrfs_space_info *data_sinfo; |
e3ccfa98 | 3446 | |
6a63209f JB |
3447 | /* make sure bytes are sectorsize aligned */ |
3448 | bytes = (bytes + root->sectorsize - 1) & ~((u64)root->sectorsize - 1); | |
e3ccfa98 | 3449 | |
b4d7c3c9 | 3450 | data_sinfo = root->fs_info->data_sinfo; |
6a63209f JB |
3451 | spin_lock(&data_sinfo->lock); |
3452 | data_sinfo->bytes_may_use -= bytes; | |
8c2a3ca2 | 3453 | trace_btrfs_space_reservation(root->fs_info, "space_info", |
2bcc0328 | 3454 | data_sinfo->flags, bytes, 0); |
6a63209f | 3455 | spin_unlock(&data_sinfo->lock); |
e3ccfa98 JB |
3456 | } |
3457 | ||
97e728d4 | 3458 | static void force_metadata_allocation(struct btrfs_fs_info *info) |
e3ccfa98 | 3459 | { |
97e728d4 JB |
3460 | struct list_head *head = &info->space_info; |
3461 | struct btrfs_space_info *found; | |
e3ccfa98 | 3462 | |
97e728d4 JB |
3463 | rcu_read_lock(); |
3464 | list_for_each_entry_rcu(found, head, list) { | |
3465 | if (found->flags & BTRFS_BLOCK_GROUP_METADATA) | |
0e4f8f88 | 3466 | found->force_alloc = CHUNK_ALLOC_FORCE; |
e3ccfa98 | 3467 | } |
97e728d4 | 3468 | rcu_read_unlock(); |
e3ccfa98 JB |
3469 | } |
3470 | ||
e5bc2458 | 3471 | static int should_alloc_chunk(struct btrfs_root *root, |
698d0082 | 3472 | struct btrfs_space_info *sinfo, int force) |
32c00aff | 3473 | { |
fb25e914 | 3474 | struct btrfs_block_rsv *global_rsv = &root->fs_info->global_block_rsv; |
424499db | 3475 | u64 num_bytes = sinfo->total_bytes - sinfo->bytes_readonly; |
0e4f8f88 | 3476 | u64 num_allocated = sinfo->bytes_used + sinfo->bytes_reserved; |
e5bc2458 | 3477 | u64 thresh; |
e3ccfa98 | 3478 | |
0e4f8f88 CM |
3479 | if (force == CHUNK_ALLOC_FORCE) |
3480 | return 1; | |
3481 | ||
fb25e914 JB |
3482 | /* |
3483 | * We need to take into account the global rsv because for all intents | |
3484 | * and purposes it's used space. Don't worry about locking the | |
3485 | * global_rsv, it doesn't change except when the transaction commits. | |
3486 | */ | |
54338b5c JB |
3487 | if (sinfo->flags & BTRFS_BLOCK_GROUP_METADATA) |
3488 | num_allocated += global_rsv->size; | |
fb25e914 | 3489 | |
0e4f8f88 CM |
3490 | /* |
3491 | * in limited mode, we want to have some free space up to | |
3492 | * about 1% of the FS size. | |
3493 | */ | |
3494 | if (force == CHUNK_ALLOC_LIMITED) { | |
6c41761f | 3495 | thresh = btrfs_super_total_bytes(root->fs_info->super_copy); |
0e4f8f88 CM |
3496 | thresh = max_t(u64, 64 * 1024 * 1024, |
3497 | div_factor_fine(thresh, 1)); | |
3498 | ||
3499 | if (num_bytes - num_allocated < thresh) | |
3500 | return 1; | |
3501 | } | |
0e4f8f88 | 3502 | |
698d0082 | 3503 | if (num_allocated + 2 * 1024 * 1024 < div_factor(num_bytes, 8)) |
14ed0ca6 | 3504 | return 0; |
424499db | 3505 | return 1; |
32c00aff JB |
3506 | } |
3507 | ||
15d1ff81 LB |
3508 | static u64 get_system_chunk_thresh(struct btrfs_root *root, u64 type) |
3509 | { | |
3510 | u64 num_dev; | |
3511 | ||
3512 | if (type & BTRFS_BLOCK_GROUP_RAID10 || | |
3513 | type & BTRFS_BLOCK_GROUP_RAID0) | |
3514 | num_dev = root->fs_info->fs_devices->rw_devices; | |
3515 | else if (type & BTRFS_BLOCK_GROUP_RAID1) | |
3516 | num_dev = 2; | |
3517 | else | |
3518 | num_dev = 1; /* DUP or single */ | |
3519 | ||
3520 | /* metadata for updaing devices and chunk tree */ | |
3521 | return btrfs_calc_trans_metadata_size(root, num_dev + 1); | |
3522 | } | |
3523 | ||
3524 | static void check_system_chunk(struct btrfs_trans_handle *trans, | |
3525 | struct btrfs_root *root, u64 type) | |
3526 | { | |
3527 | struct btrfs_space_info *info; | |
3528 | u64 left; | |
3529 | u64 thresh; | |
3530 | ||
3531 | info = __find_space_info(root->fs_info, BTRFS_BLOCK_GROUP_SYSTEM); | |
3532 | spin_lock(&info->lock); | |
3533 | left = info->total_bytes - info->bytes_used - info->bytes_pinned - | |
3534 | info->bytes_reserved - info->bytes_readonly; | |
3535 | spin_unlock(&info->lock); | |
3536 | ||
3537 | thresh = get_system_chunk_thresh(root, type); | |
3538 | if (left < thresh && btrfs_test_opt(root, ENOSPC_DEBUG)) { | |
3539 | printk(KERN_INFO "left=%llu, need=%llu, flags=%llu\n", | |
3540 | left, thresh, type); | |
3541 | dump_space_info(info, 0, 0); | |
3542 | } | |
3543 | ||
3544 | if (left < thresh) { | |
3545 | u64 flags; | |
3546 | ||
3547 | flags = btrfs_get_alloc_profile(root->fs_info->chunk_root, 0); | |
3548 | btrfs_alloc_chunk(trans, root, flags); | |
3549 | } | |
3550 | } | |
3551 | ||
6324fbf3 | 3552 | static int do_chunk_alloc(struct btrfs_trans_handle *trans, |
698d0082 | 3553 | struct btrfs_root *extent_root, u64 flags, int force) |
9ed74f2d | 3554 | { |
6324fbf3 | 3555 | struct btrfs_space_info *space_info; |
97e728d4 | 3556 | struct btrfs_fs_info *fs_info = extent_root->fs_info; |
6d74119f | 3557 | int wait_for_alloc = 0; |
9ed74f2d | 3558 | int ret = 0; |
9ed74f2d | 3559 | |
6324fbf3 | 3560 | space_info = __find_space_info(extent_root->fs_info, flags); |
593060d7 CM |
3561 | if (!space_info) { |
3562 | ret = update_space_info(extent_root->fs_info, flags, | |
3563 | 0, 0, &space_info); | |
79787eaa | 3564 | BUG_ON(ret); /* -ENOMEM */ |
9ed74f2d | 3565 | } |
79787eaa | 3566 | BUG_ON(!space_info); /* Logic error */ |
9ed74f2d | 3567 | |
6d74119f | 3568 | again: |
25179201 | 3569 | spin_lock(&space_info->lock); |
9e622d6b | 3570 | if (force < space_info->force_alloc) |
0e4f8f88 | 3571 | force = space_info->force_alloc; |
25179201 JB |
3572 | if (space_info->full) { |
3573 | spin_unlock(&space_info->lock); | |
6d74119f | 3574 | return 0; |
9ed74f2d JB |
3575 | } |
3576 | ||
698d0082 | 3577 | if (!should_alloc_chunk(extent_root, space_info, force)) { |
25179201 | 3578 | spin_unlock(&space_info->lock); |
6d74119f JB |
3579 | return 0; |
3580 | } else if (space_info->chunk_alloc) { | |
3581 | wait_for_alloc = 1; | |
3582 | } else { | |
3583 | space_info->chunk_alloc = 1; | |
9ed74f2d | 3584 | } |
0e4f8f88 | 3585 | |
25179201 | 3586 | spin_unlock(&space_info->lock); |
9ed74f2d | 3587 | |
6d74119f JB |
3588 | mutex_lock(&fs_info->chunk_mutex); |
3589 | ||
3590 | /* | |
3591 | * The chunk_mutex is held throughout the entirety of a chunk | |
3592 | * allocation, so once we've acquired the chunk_mutex we know that the | |
3593 | * other guy is done and we need to recheck and see if we should | |
3594 | * allocate. | |
3595 | */ | |
3596 | if (wait_for_alloc) { | |
3597 | mutex_unlock(&fs_info->chunk_mutex); | |
3598 | wait_for_alloc = 0; | |
3599 | goto again; | |
3600 | } | |
3601 | ||
67377734 JB |
3602 | /* |
3603 | * If we have mixed data/metadata chunks we want to make sure we keep | |
3604 | * allocating mixed chunks instead of individual chunks. | |
3605 | */ | |
3606 | if (btrfs_mixed_space_info(space_info)) | |
3607 | flags |= (BTRFS_BLOCK_GROUP_DATA | BTRFS_BLOCK_GROUP_METADATA); | |
3608 | ||
97e728d4 JB |
3609 | /* |
3610 | * if we're doing a data chunk, go ahead and make sure that | |
3611 | * we keep a reasonable number of metadata chunks allocated in the | |
3612 | * FS as well. | |
3613 | */ | |
9ed74f2d | 3614 | if (flags & BTRFS_BLOCK_GROUP_DATA && fs_info->metadata_ratio) { |
97e728d4 JB |
3615 | fs_info->data_chunk_allocations++; |
3616 | if (!(fs_info->data_chunk_allocations % | |
3617 | fs_info->metadata_ratio)) | |
3618 | force_metadata_allocation(fs_info); | |
9ed74f2d JB |
3619 | } |
3620 | ||
15d1ff81 LB |
3621 | /* |
3622 | * Check if we have enough space in SYSTEM chunk because we may need | |
3623 | * to update devices. | |
3624 | */ | |
3625 | check_system_chunk(trans, extent_root, flags); | |
3626 | ||
2b82032c | 3627 | ret = btrfs_alloc_chunk(trans, extent_root, flags); |
92b8e897 MF |
3628 | if (ret < 0 && ret != -ENOSPC) |
3629 | goto out; | |
3630 | ||
9ed74f2d | 3631 | spin_lock(&space_info->lock); |
9ed74f2d | 3632 | if (ret) |
6324fbf3 | 3633 | space_info->full = 1; |
424499db YZ |
3634 | else |
3635 | ret = 1; | |
6d74119f | 3636 | |
0e4f8f88 | 3637 | space_info->force_alloc = CHUNK_ALLOC_NO_FORCE; |
6d74119f | 3638 | space_info->chunk_alloc = 0; |
9ed74f2d | 3639 | spin_unlock(&space_info->lock); |
92b8e897 | 3640 | out: |
a25c75d5 | 3641 | mutex_unlock(&fs_info->chunk_mutex); |
0f9dd46c | 3642 | return ret; |
6324fbf3 | 3643 | } |
9ed74f2d | 3644 | |
a80c8dcf JB |
3645 | static int can_overcommit(struct btrfs_root *root, |
3646 | struct btrfs_space_info *space_info, u64 bytes, | |
3647 | int flush) | |
3648 | { | |
3649 | u64 profile = btrfs_get_alloc_profile(root, 0); | |
3650 | u64 avail; | |
3651 | u64 used; | |
3652 | ||
3653 | used = space_info->bytes_used + space_info->bytes_reserved + | |
3654 | space_info->bytes_pinned + space_info->bytes_readonly + | |
3655 | space_info->bytes_may_use; | |
3656 | ||
3657 | spin_lock(&root->fs_info->free_chunk_lock); | |
3658 | avail = root->fs_info->free_chunk_space; | |
3659 | spin_unlock(&root->fs_info->free_chunk_lock); | |
3660 | ||
3661 | /* | |
3662 | * If we have dup, raid1 or raid10 then only half of the free | |
3663 | * space is actually useable. | |
3664 | */ | |
3665 | if (profile & (BTRFS_BLOCK_GROUP_DUP | | |
3666 | BTRFS_BLOCK_GROUP_RAID1 | | |
3667 | BTRFS_BLOCK_GROUP_RAID10)) | |
3668 | avail >>= 1; | |
3669 | ||
3670 | /* | |
561c294d MX |
3671 | * If we aren't flushing all things, let us overcommit up to |
3672 | * 1/2th of the space. If we can flush, don't let us overcommit | |
3673 | * too much, let it overcommit up to 1/8 of the space. | |
a80c8dcf JB |
3674 | */ |
3675 | if (flush) | |
3676 | avail >>= 3; | |
3677 | else | |
3678 | avail >>= 1; | |
3679 | ||
3680 | if (used + bytes < space_info->total_bytes + avail) | |
3681 | return 1; | |
3682 | return 0; | |
3683 | } | |
3684 | ||
9ed74f2d | 3685 | /* |
5da9d01b | 3686 | * shrink metadata reservation for delalloc |
9ed74f2d | 3687 | */ |
f4c738c2 JB |
3688 | static void shrink_delalloc(struct btrfs_root *root, u64 to_reclaim, u64 orig, |
3689 | bool wait_ordered) | |
5da9d01b | 3690 | { |
0ca1f7ce | 3691 | struct btrfs_block_rsv *block_rsv; |
0019f10d | 3692 | struct btrfs_space_info *space_info; |
663350ac | 3693 | struct btrfs_trans_handle *trans; |
f4c738c2 | 3694 | u64 delalloc_bytes; |
5da9d01b | 3695 | u64 max_reclaim; |
b1953bce | 3696 | long time_left; |
877da174 | 3697 | unsigned long nr_pages = (2 * 1024 * 1024) >> PAGE_CACHE_SHIFT; |
b1953bce | 3698 | int loops = 0; |
5da9d01b | 3699 | |
663350ac | 3700 | trans = (struct btrfs_trans_handle *)current->journal_info; |
0ca1f7ce | 3701 | block_rsv = &root->fs_info->delalloc_block_rsv; |
0019f10d | 3702 | space_info = block_rsv->space_info; |
bf9022e0 CM |
3703 | |
3704 | smp_mb(); | |
f4c738c2 JB |
3705 | delalloc_bytes = root->fs_info->delalloc_bytes; |
3706 | if (delalloc_bytes == 0) { | |
fdb5effd | 3707 | if (trans) |
f4c738c2 | 3708 | return; |
6bbe3a9c | 3709 | btrfs_wait_ordered_extents(root, 0); |
f4c738c2 | 3710 | return; |
fdb5effd JB |
3711 | } |
3712 | ||
f4c738c2 JB |
3713 | while (delalloc_bytes && loops < 3) { |
3714 | max_reclaim = min(delalloc_bytes, to_reclaim); | |
3715 | nr_pages = max_reclaim >> PAGE_CACHE_SHIFT; | |
0e175a18 | 3716 | writeback_inodes_sb_nr_if_idle(root->fs_info->sb, nr_pages, |
f4c738c2 | 3717 | WB_REASON_FS_FREE_SPACE); |
5da9d01b | 3718 | |
dea31f52 JB |
3719 | /* |
3720 | * We need to wait for the async pages to actually start before | |
3721 | * we do anything. | |
3722 | */ | |
3723 | wait_event(root->fs_info->async_submit_wait, | |
3724 | !atomic_read(&root->fs_info->async_delalloc_pages)); | |
3725 | ||
0019f10d | 3726 | spin_lock(&space_info->lock); |
a80c8dcf | 3727 | if (can_overcommit(root, space_info, orig, !trans)) { |
f4c738c2 JB |
3728 | spin_unlock(&space_info->lock); |
3729 | break; | |
3730 | } | |
0019f10d | 3731 | spin_unlock(&space_info->lock); |
5da9d01b | 3732 | |
36e39c40 | 3733 | loops++; |
f104d044 | 3734 | if (wait_ordered && !trans) { |
6bbe3a9c | 3735 | btrfs_wait_ordered_extents(root, 0); |
f104d044 | 3736 | } else { |
f4c738c2 | 3737 | time_left = schedule_timeout_killable(1); |
f104d044 JB |
3738 | if (time_left) |
3739 | break; | |
3740 | } | |
f4c738c2 JB |
3741 | smp_mb(); |
3742 | delalloc_bytes = root->fs_info->delalloc_bytes; | |
5da9d01b | 3743 | } |
5da9d01b YZ |
3744 | } |
3745 | ||
663350ac JB |
3746 | /** |
3747 | * maybe_commit_transaction - possibly commit the transaction if its ok to | |
3748 | * @root - the root we're allocating for | |
3749 | * @bytes - the number of bytes we want to reserve | |
3750 | * @force - force the commit | |
8bb8ab2e | 3751 | * |
663350ac JB |
3752 | * This will check to make sure that committing the transaction will actually |
3753 | * get us somewhere and then commit the transaction if it does. Otherwise it | |
3754 | * will return -ENOSPC. | |
8bb8ab2e | 3755 | */ |
663350ac JB |
3756 | static int may_commit_transaction(struct btrfs_root *root, |
3757 | struct btrfs_space_info *space_info, | |
3758 | u64 bytes, int force) | |
3759 | { | |
3760 | struct btrfs_block_rsv *delayed_rsv = &root->fs_info->delayed_block_rsv; | |
3761 | struct btrfs_trans_handle *trans; | |
3762 | ||
3763 | trans = (struct btrfs_trans_handle *)current->journal_info; | |
3764 | if (trans) | |
3765 | return -EAGAIN; | |
3766 | ||
3767 | if (force) | |
3768 | goto commit; | |
3769 | ||
3770 | /* See if there is enough pinned space to make this reservation */ | |
3771 | spin_lock(&space_info->lock); | |
3772 | if (space_info->bytes_pinned >= bytes) { | |
3773 | spin_unlock(&space_info->lock); | |
3774 | goto commit; | |
3775 | } | |
3776 | spin_unlock(&space_info->lock); | |
3777 | ||
3778 | /* | |
3779 | * See if there is some space in the delayed insertion reservation for | |
3780 | * this reservation. | |
3781 | */ | |
3782 | if (space_info != delayed_rsv->space_info) | |
3783 | return -ENOSPC; | |
3784 | ||
d9b0218f | 3785 | spin_lock(&space_info->lock); |
663350ac | 3786 | spin_lock(&delayed_rsv->lock); |
d9b0218f | 3787 | if (space_info->bytes_pinned + delayed_rsv->size < bytes) { |
663350ac | 3788 | spin_unlock(&delayed_rsv->lock); |
d9b0218f | 3789 | spin_unlock(&space_info->lock); |
663350ac JB |
3790 | return -ENOSPC; |
3791 | } | |
3792 | spin_unlock(&delayed_rsv->lock); | |
d9b0218f | 3793 | spin_unlock(&space_info->lock); |
663350ac JB |
3794 | |
3795 | commit: | |
3796 | trans = btrfs_join_transaction(root); | |
3797 | if (IS_ERR(trans)) | |
3798 | return -ENOSPC; | |
3799 | ||
3800 | return btrfs_commit_transaction(trans, root); | |
3801 | } | |
3802 | ||
96c3f433 | 3803 | enum flush_state { |
67b0fd63 JB |
3804 | FLUSH_DELAYED_ITEMS_NR = 1, |
3805 | FLUSH_DELAYED_ITEMS = 2, | |
3806 | FLUSH_DELALLOC = 3, | |
3807 | FLUSH_DELALLOC_WAIT = 4, | |
ea658bad JB |
3808 | ALLOC_CHUNK = 5, |
3809 | COMMIT_TRANS = 6, | |
96c3f433 JB |
3810 | }; |
3811 | ||
3812 | static int flush_space(struct btrfs_root *root, | |
3813 | struct btrfs_space_info *space_info, u64 num_bytes, | |
3814 | u64 orig_bytes, int state) | |
3815 | { | |
3816 | struct btrfs_trans_handle *trans; | |
3817 | int nr; | |
f4c738c2 | 3818 | int ret = 0; |
96c3f433 JB |
3819 | |
3820 | switch (state) { | |
96c3f433 JB |
3821 | case FLUSH_DELAYED_ITEMS_NR: |
3822 | case FLUSH_DELAYED_ITEMS: | |
3823 | if (state == FLUSH_DELAYED_ITEMS_NR) { | |
3824 | u64 bytes = btrfs_calc_trans_metadata_size(root, 1); | |
3825 | ||
3826 | nr = (int)div64_u64(num_bytes, bytes); | |
3827 | if (!nr) | |
3828 | nr = 1; | |
3829 | nr *= 2; | |
3830 | } else { | |
3831 | nr = -1; | |
3832 | } | |
3833 | trans = btrfs_join_transaction(root); | |
3834 | if (IS_ERR(trans)) { | |
3835 | ret = PTR_ERR(trans); | |
3836 | break; | |
3837 | } | |
3838 | ret = btrfs_run_delayed_items_nr(trans, root, nr); | |
3839 | btrfs_end_transaction(trans, root); | |
3840 | break; | |
67b0fd63 JB |
3841 | case FLUSH_DELALLOC: |
3842 | case FLUSH_DELALLOC_WAIT: | |
3843 | shrink_delalloc(root, num_bytes, orig_bytes, | |
3844 | state == FLUSH_DELALLOC_WAIT); | |
3845 | break; | |
ea658bad JB |
3846 | case ALLOC_CHUNK: |
3847 | trans = btrfs_join_transaction(root); | |
3848 | if (IS_ERR(trans)) { | |
3849 | ret = PTR_ERR(trans); | |
3850 | break; | |
3851 | } | |
3852 | ret = do_chunk_alloc(trans, root->fs_info->extent_root, | |
ea658bad JB |
3853 | btrfs_get_alloc_profile(root, 0), |
3854 | CHUNK_ALLOC_NO_FORCE); | |
3855 | btrfs_end_transaction(trans, root); | |
3856 | if (ret == -ENOSPC) | |
3857 | ret = 0; | |
3858 | break; | |
96c3f433 JB |
3859 | case COMMIT_TRANS: |
3860 | ret = may_commit_transaction(root, space_info, orig_bytes, 0); | |
3861 | break; | |
3862 | default: | |
3863 | ret = -ENOSPC; | |
3864 | break; | |
3865 | } | |
3866 | ||
3867 | return ret; | |
3868 | } | |
4a92b1b8 JB |
3869 | /** |
3870 | * reserve_metadata_bytes - try to reserve bytes from the block_rsv's space | |
3871 | * @root - the root we're allocating for | |
3872 | * @block_rsv - the block_rsv we're allocating for | |
3873 | * @orig_bytes - the number of bytes we want | |
3874 | * @flush - wether or not we can flush to make our reservation | |
8bb8ab2e | 3875 | * |
4a92b1b8 JB |
3876 | * This will reserve orgi_bytes number of bytes from the space info associated |
3877 | * with the block_rsv. If there is not enough space it will make an attempt to | |
3878 | * flush out space to make room. It will do this by flushing delalloc if | |
3879 | * possible or committing the transaction. If flush is 0 then no attempts to | |
3880 | * regain reservations will be made and this will fail if there is not enough | |
3881 | * space already. | |
8bb8ab2e | 3882 | */ |
4a92b1b8 | 3883 | static int reserve_metadata_bytes(struct btrfs_root *root, |
8bb8ab2e JB |
3884 | struct btrfs_block_rsv *block_rsv, |
3885 | u64 orig_bytes, int flush) | |
9ed74f2d | 3886 | { |
f0486c68 | 3887 | struct btrfs_space_info *space_info = block_rsv->space_info; |
2bf64758 | 3888 | u64 used; |
8bb8ab2e | 3889 | u64 num_bytes = orig_bytes; |
67b0fd63 | 3890 | int flush_state = FLUSH_DELAYED_ITEMS_NR; |
8bb8ab2e | 3891 | int ret = 0; |
fdb5effd | 3892 | bool flushing = false; |
9ed74f2d | 3893 | |
8bb8ab2e | 3894 | again: |
fdb5effd | 3895 | ret = 0; |
8bb8ab2e | 3896 | spin_lock(&space_info->lock); |
fdb5effd JB |
3897 | /* |
3898 | * We only want to wait if somebody other than us is flushing and we are | |
3899 | * actually alloed to flush. | |
3900 | */ | |
3901 | while (flush && !flushing && space_info->flush) { | |
3902 | spin_unlock(&space_info->lock); | |
3903 | /* | |
3904 | * If we have a trans handle we can't wait because the flusher | |
3905 | * may have to commit the transaction, which would mean we would | |
3906 | * deadlock since we are waiting for the flusher to finish, but | |
3907 | * hold the current transaction open. | |
3908 | */ | |
663350ac | 3909 | if (current->journal_info) |
fdb5effd | 3910 | return -EAGAIN; |
b9688bb8 AJ |
3911 | ret = wait_event_killable(space_info->wait, !space_info->flush); |
3912 | /* Must have been killed, return */ | |
3913 | if (ret) | |
fdb5effd JB |
3914 | return -EINTR; |
3915 | ||
3916 | spin_lock(&space_info->lock); | |
3917 | } | |
3918 | ||
3919 | ret = -ENOSPC; | |
2bf64758 JB |
3920 | used = space_info->bytes_used + space_info->bytes_reserved + |
3921 | space_info->bytes_pinned + space_info->bytes_readonly + | |
3922 | space_info->bytes_may_use; | |
9ed74f2d | 3923 | |
8bb8ab2e JB |
3924 | /* |
3925 | * The idea here is that we've not already over-reserved the block group | |
3926 | * then we can go ahead and save our reservation first and then start | |
3927 | * flushing if we need to. Otherwise if we've already overcommitted | |
3928 | * lets start flushing stuff first and then come back and try to make | |
3929 | * our reservation. | |
3930 | */ | |
2bf64758 JB |
3931 | if (used <= space_info->total_bytes) { |
3932 | if (used + orig_bytes <= space_info->total_bytes) { | |
fb25e914 | 3933 | space_info->bytes_may_use += orig_bytes; |
8c2a3ca2 | 3934 | trace_btrfs_space_reservation(root->fs_info, |
2bcc0328 | 3935 | "space_info", space_info->flags, orig_bytes, 1); |
8bb8ab2e JB |
3936 | ret = 0; |
3937 | } else { | |
3938 | /* | |
3939 | * Ok set num_bytes to orig_bytes since we aren't | |
3940 | * overocmmitted, this way we only try and reclaim what | |
3941 | * we need. | |
3942 | */ | |
3943 | num_bytes = orig_bytes; | |
3944 | } | |
3945 | } else { | |
3946 | /* | |
3947 | * Ok we're over committed, set num_bytes to the overcommitted | |
3948 | * amount plus the amount of bytes that we need for this | |
3949 | * reservation. | |
3950 | */ | |
2bf64758 | 3951 | num_bytes = used - space_info->total_bytes + |
96c3f433 | 3952 | (orig_bytes * 2); |
8bb8ab2e | 3953 | } |
9ed74f2d | 3954 | |
44734ed1 JB |
3955 | if (ret && can_overcommit(root, space_info, orig_bytes, flush)) { |
3956 | space_info->bytes_may_use += orig_bytes; | |
3957 | trace_btrfs_space_reservation(root->fs_info, "space_info", | |
3958 | space_info->flags, orig_bytes, | |
3959 | 1); | |
3960 | ret = 0; | |
2bf64758 JB |
3961 | } |
3962 | ||
8bb8ab2e JB |
3963 | /* |
3964 | * Couldn't make our reservation, save our place so while we're trying | |
3965 | * to reclaim space we can actually use it instead of somebody else | |
3966 | * stealing it from us. | |
3967 | */ | |
fdb5effd JB |
3968 | if (ret && flush) { |
3969 | flushing = true; | |
3970 | space_info->flush = 1; | |
8bb8ab2e | 3971 | } |
9ed74f2d | 3972 | |
f0486c68 | 3973 | spin_unlock(&space_info->lock); |
9ed74f2d | 3974 | |
fdb5effd | 3975 | if (!ret || !flush) |
8bb8ab2e | 3976 | goto out; |
f0486c68 | 3977 | |
96c3f433 JB |
3978 | ret = flush_space(root, space_info, num_bytes, orig_bytes, |
3979 | flush_state); | |
3980 | flush_state++; | |
3981 | if (!ret) | |
8bb8ab2e | 3982 | goto again; |
96c3f433 | 3983 | else if (flush_state <= COMMIT_TRANS) |
8bb8ab2e JB |
3984 | goto again; |
3985 | ||
3986 | out: | |
fdb5effd | 3987 | if (flushing) { |
8bb8ab2e | 3988 | spin_lock(&space_info->lock); |
fdb5effd JB |
3989 | space_info->flush = 0; |
3990 | wake_up_all(&space_info->wait); | |
8bb8ab2e | 3991 | spin_unlock(&space_info->lock); |
f0486c68 | 3992 | } |
f0486c68 YZ |
3993 | return ret; |
3994 | } | |
3995 | ||
79787eaa JM |
3996 | static struct btrfs_block_rsv *get_block_rsv( |
3997 | const struct btrfs_trans_handle *trans, | |
3998 | const struct btrfs_root *root) | |
f0486c68 | 3999 | { |
4c13d758 JB |
4000 | struct btrfs_block_rsv *block_rsv = NULL; |
4001 | ||
0e721106 JB |
4002 | if (root->ref_cows) |
4003 | block_rsv = trans->block_rsv; | |
4004 | ||
4005 | if (root == root->fs_info->csum_root && trans->adding_csums) | |
f0486c68 | 4006 | block_rsv = trans->block_rsv; |
4c13d758 JB |
4007 | |
4008 | if (!block_rsv) | |
f0486c68 YZ |
4009 | block_rsv = root->block_rsv; |
4010 | ||
4011 | if (!block_rsv) | |
4012 | block_rsv = &root->fs_info->empty_block_rsv; | |
4013 | ||
4014 | return block_rsv; | |
4015 | } | |
4016 | ||
4017 | static int block_rsv_use_bytes(struct btrfs_block_rsv *block_rsv, | |
4018 | u64 num_bytes) | |
4019 | { | |
4020 | int ret = -ENOSPC; | |
4021 | spin_lock(&block_rsv->lock); | |
4022 | if (block_rsv->reserved >= num_bytes) { | |
4023 | block_rsv->reserved -= num_bytes; | |
4024 | if (block_rsv->reserved < block_rsv->size) | |
4025 | block_rsv->full = 0; | |
4026 | ret = 0; | |
4027 | } | |
4028 | spin_unlock(&block_rsv->lock); | |
4029 | return ret; | |
4030 | } | |
4031 | ||
4032 | static void block_rsv_add_bytes(struct btrfs_block_rsv *block_rsv, | |
4033 | u64 num_bytes, int update_size) | |
4034 | { | |
4035 | spin_lock(&block_rsv->lock); | |
4036 | block_rsv->reserved += num_bytes; | |
4037 | if (update_size) | |
4038 | block_rsv->size += num_bytes; | |
4039 | else if (block_rsv->reserved >= block_rsv->size) | |
4040 | block_rsv->full = 1; | |
4041 | spin_unlock(&block_rsv->lock); | |
4042 | } | |
4043 | ||
8c2a3ca2 JB |
4044 | static void block_rsv_release_bytes(struct btrfs_fs_info *fs_info, |
4045 | struct btrfs_block_rsv *block_rsv, | |
62a45b60 | 4046 | struct btrfs_block_rsv *dest, u64 num_bytes) |
f0486c68 YZ |
4047 | { |
4048 | struct btrfs_space_info *space_info = block_rsv->space_info; | |
4049 | ||
4050 | spin_lock(&block_rsv->lock); | |
4051 | if (num_bytes == (u64)-1) | |
4052 | num_bytes = block_rsv->size; | |
4053 | block_rsv->size -= num_bytes; | |
4054 | if (block_rsv->reserved >= block_rsv->size) { | |
4055 | num_bytes = block_rsv->reserved - block_rsv->size; | |
4056 | block_rsv->reserved = block_rsv->size; | |
4057 | block_rsv->full = 1; | |
4058 | } else { | |
4059 | num_bytes = 0; | |
4060 | } | |
4061 | spin_unlock(&block_rsv->lock); | |
4062 | ||
4063 | if (num_bytes > 0) { | |
4064 | if (dest) { | |
e9e22899 JB |
4065 | spin_lock(&dest->lock); |
4066 | if (!dest->full) { | |
4067 | u64 bytes_to_add; | |
4068 | ||
4069 | bytes_to_add = dest->size - dest->reserved; | |
4070 | bytes_to_add = min(num_bytes, bytes_to_add); | |
4071 | dest->reserved += bytes_to_add; | |
4072 | if (dest->reserved >= dest->size) | |
4073 | dest->full = 1; | |
4074 | num_bytes -= bytes_to_add; | |
4075 | } | |
4076 | spin_unlock(&dest->lock); | |
4077 | } | |
4078 | if (num_bytes) { | |
f0486c68 | 4079 | spin_lock(&space_info->lock); |
fb25e914 | 4080 | space_info->bytes_may_use -= num_bytes; |
8c2a3ca2 | 4081 | trace_btrfs_space_reservation(fs_info, "space_info", |
2bcc0328 | 4082 | space_info->flags, num_bytes, 0); |
36e39c40 | 4083 | space_info->reservation_progress++; |
f0486c68 | 4084 | spin_unlock(&space_info->lock); |
4e06bdd6 | 4085 | } |
9ed74f2d | 4086 | } |
f0486c68 | 4087 | } |
4e06bdd6 | 4088 | |
f0486c68 YZ |
4089 | static int block_rsv_migrate_bytes(struct btrfs_block_rsv *src, |
4090 | struct btrfs_block_rsv *dst, u64 num_bytes) | |
4091 | { | |
4092 | int ret; | |
9ed74f2d | 4093 | |
f0486c68 YZ |
4094 | ret = block_rsv_use_bytes(src, num_bytes); |
4095 | if (ret) | |
4096 | return ret; | |
9ed74f2d | 4097 | |
f0486c68 | 4098 | block_rsv_add_bytes(dst, num_bytes, 1); |
9ed74f2d JB |
4099 | return 0; |
4100 | } | |
4101 | ||
66d8f3dd | 4102 | void btrfs_init_block_rsv(struct btrfs_block_rsv *rsv, unsigned short type) |
9ed74f2d | 4103 | { |
f0486c68 YZ |
4104 | memset(rsv, 0, sizeof(*rsv)); |
4105 | spin_lock_init(&rsv->lock); | |
66d8f3dd | 4106 | rsv->type = type; |
f0486c68 YZ |
4107 | } |
4108 | ||
66d8f3dd MX |
4109 | struct btrfs_block_rsv *btrfs_alloc_block_rsv(struct btrfs_root *root, |
4110 | unsigned short type) | |
f0486c68 YZ |
4111 | { |
4112 | struct btrfs_block_rsv *block_rsv; | |
4113 | struct btrfs_fs_info *fs_info = root->fs_info; | |
9ed74f2d | 4114 | |
f0486c68 YZ |
4115 | block_rsv = kmalloc(sizeof(*block_rsv), GFP_NOFS); |
4116 | if (!block_rsv) | |
4117 | return NULL; | |
9ed74f2d | 4118 | |
66d8f3dd | 4119 | btrfs_init_block_rsv(block_rsv, type); |
f0486c68 YZ |
4120 | block_rsv->space_info = __find_space_info(fs_info, |
4121 | BTRFS_BLOCK_GROUP_METADATA); | |
f0486c68 YZ |
4122 | return block_rsv; |
4123 | } | |
9ed74f2d | 4124 | |
f0486c68 YZ |
4125 | void btrfs_free_block_rsv(struct btrfs_root *root, |
4126 | struct btrfs_block_rsv *rsv) | |
4127 | { | |
2aaa6655 JB |
4128 | if (!rsv) |
4129 | return; | |
dabdb640 JB |
4130 | btrfs_block_rsv_release(root, rsv, (u64)-1); |
4131 | kfree(rsv); | |
9ed74f2d JB |
4132 | } |
4133 | ||
61b520a9 MX |
4134 | static inline int __block_rsv_add(struct btrfs_root *root, |
4135 | struct btrfs_block_rsv *block_rsv, | |
4136 | u64 num_bytes, int flush) | |
9ed74f2d | 4137 | { |
f0486c68 | 4138 | int ret; |
9ed74f2d | 4139 | |
f0486c68 YZ |
4140 | if (num_bytes == 0) |
4141 | return 0; | |
8bb8ab2e | 4142 | |
61b520a9 | 4143 | ret = reserve_metadata_bytes(root, block_rsv, num_bytes, flush); |
f0486c68 YZ |
4144 | if (!ret) { |
4145 | block_rsv_add_bytes(block_rsv, num_bytes, 1); | |
4146 | return 0; | |
4147 | } | |
9ed74f2d | 4148 | |
f0486c68 | 4149 | return ret; |
f0486c68 | 4150 | } |
9ed74f2d | 4151 | |
61b520a9 MX |
4152 | int btrfs_block_rsv_add(struct btrfs_root *root, |
4153 | struct btrfs_block_rsv *block_rsv, | |
4154 | u64 num_bytes) | |
4155 | { | |
4156 | return __block_rsv_add(root, block_rsv, num_bytes, 1); | |
4157 | } | |
4158 | ||
c06a0e12 JB |
4159 | int btrfs_block_rsv_add_noflush(struct btrfs_root *root, |
4160 | struct btrfs_block_rsv *block_rsv, | |
4161 | u64 num_bytes) | |
f0486c68 | 4162 | { |
61b520a9 | 4163 | return __block_rsv_add(root, block_rsv, num_bytes, 0); |
f0486c68 | 4164 | } |
9ed74f2d | 4165 | |
4a92b1b8 | 4166 | int btrfs_block_rsv_check(struct btrfs_root *root, |
36ba022a | 4167 | struct btrfs_block_rsv *block_rsv, int min_factor) |
f0486c68 YZ |
4168 | { |
4169 | u64 num_bytes = 0; | |
f0486c68 | 4170 | int ret = -ENOSPC; |
9ed74f2d | 4171 | |
f0486c68 YZ |
4172 | if (!block_rsv) |
4173 | return 0; | |
9ed74f2d | 4174 | |
f0486c68 | 4175 | spin_lock(&block_rsv->lock); |
36ba022a JB |
4176 | num_bytes = div_factor(block_rsv->size, min_factor); |
4177 | if (block_rsv->reserved >= num_bytes) | |
4178 | ret = 0; | |
4179 | spin_unlock(&block_rsv->lock); | |
9ed74f2d | 4180 | |
36ba022a JB |
4181 | return ret; |
4182 | } | |
4183 | ||
aa38a711 MX |
4184 | static inline int __btrfs_block_rsv_refill(struct btrfs_root *root, |
4185 | struct btrfs_block_rsv *block_rsv, | |
4186 | u64 min_reserved, int flush) | |
36ba022a JB |
4187 | { |
4188 | u64 num_bytes = 0; | |
4189 | int ret = -ENOSPC; | |
4190 | ||
4191 | if (!block_rsv) | |
4192 | return 0; | |
4193 | ||
4194 | spin_lock(&block_rsv->lock); | |
4195 | num_bytes = min_reserved; | |
13553e52 | 4196 | if (block_rsv->reserved >= num_bytes) |
f0486c68 | 4197 | ret = 0; |
13553e52 | 4198 | else |
f0486c68 | 4199 | num_bytes -= block_rsv->reserved; |
f0486c68 | 4200 | spin_unlock(&block_rsv->lock); |
13553e52 | 4201 | |
f0486c68 YZ |
4202 | if (!ret) |
4203 | return 0; | |
4204 | ||
aa38a711 | 4205 | ret = reserve_metadata_bytes(root, block_rsv, num_bytes, flush); |
dabdb640 JB |
4206 | if (!ret) { |
4207 | block_rsv_add_bytes(block_rsv, num_bytes, 0); | |
f0486c68 | 4208 | return 0; |
6a63209f | 4209 | } |
9ed74f2d | 4210 | |
13553e52 | 4211 | return ret; |
f0486c68 YZ |
4212 | } |
4213 | ||
aa38a711 MX |
4214 | int btrfs_block_rsv_refill(struct btrfs_root *root, |
4215 | struct btrfs_block_rsv *block_rsv, | |
4216 | u64 min_reserved) | |
4217 | { | |
4218 | return __btrfs_block_rsv_refill(root, block_rsv, min_reserved, 1); | |
4219 | } | |
4220 | ||
4221 | int btrfs_block_rsv_refill_noflush(struct btrfs_root *root, | |
4222 | struct btrfs_block_rsv *block_rsv, | |
4223 | u64 min_reserved) | |
4224 | { | |
4225 | return __btrfs_block_rsv_refill(root, block_rsv, min_reserved, 0); | |
4226 | } | |
4227 | ||
f0486c68 YZ |
4228 | int btrfs_block_rsv_migrate(struct btrfs_block_rsv *src_rsv, |
4229 | struct btrfs_block_rsv *dst_rsv, | |
4230 | u64 num_bytes) | |
4231 | { | |
4232 | return block_rsv_migrate_bytes(src_rsv, dst_rsv, num_bytes); | |
4233 | } | |
4234 | ||
4235 | void btrfs_block_rsv_release(struct btrfs_root *root, | |
4236 | struct btrfs_block_rsv *block_rsv, | |
4237 | u64 num_bytes) | |
4238 | { | |
4239 | struct btrfs_block_rsv *global_rsv = &root->fs_info->global_block_rsv; | |
4240 | if (global_rsv->full || global_rsv == block_rsv || | |
4241 | block_rsv->space_info != global_rsv->space_info) | |
4242 | global_rsv = NULL; | |
8c2a3ca2 JB |
4243 | block_rsv_release_bytes(root->fs_info, block_rsv, global_rsv, |
4244 | num_bytes); | |
6a63209f JB |
4245 | } |
4246 | ||
4247 | /* | |
8929ecfa YZ |
4248 | * helper to calculate size of global block reservation. |
4249 | * the desired value is sum of space used by extent tree, | |
4250 | * checksum tree and root tree | |
6a63209f | 4251 | */ |
8929ecfa | 4252 | static u64 calc_global_metadata_size(struct btrfs_fs_info *fs_info) |
6a63209f | 4253 | { |
8929ecfa YZ |
4254 | struct btrfs_space_info *sinfo; |
4255 | u64 num_bytes; | |
4256 | u64 meta_used; | |
4257 | u64 data_used; | |
6c41761f | 4258 | int csum_size = btrfs_super_csum_size(fs_info->super_copy); |
6a63209f | 4259 | |
8929ecfa YZ |
4260 | sinfo = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_DATA); |
4261 | spin_lock(&sinfo->lock); | |
4262 | data_used = sinfo->bytes_used; | |
4263 | spin_unlock(&sinfo->lock); | |
33b4d47f | 4264 | |
8929ecfa YZ |
4265 | sinfo = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_METADATA); |
4266 | spin_lock(&sinfo->lock); | |
6d48755d JB |
4267 | if (sinfo->flags & BTRFS_BLOCK_GROUP_DATA) |
4268 | data_used = 0; | |
8929ecfa YZ |
4269 | meta_used = sinfo->bytes_used; |
4270 | spin_unlock(&sinfo->lock); | |
ab6e2410 | 4271 | |
8929ecfa YZ |
4272 | num_bytes = (data_used >> fs_info->sb->s_blocksize_bits) * |
4273 | csum_size * 2; | |
4274 | num_bytes += div64_u64(data_used + meta_used, 50); | |
4e06bdd6 | 4275 | |
8929ecfa | 4276 | if (num_bytes * 3 > meta_used) |
8e62c2de | 4277 | num_bytes = div64_u64(meta_used, 3); |
ab6e2410 | 4278 | |
8929ecfa YZ |
4279 | return ALIGN(num_bytes, fs_info->extent_root->leafsize << 10); |
4280 | } | |
6a63209f | 4281 | |
8929ecfa YZ |
4282 | static void update_global_block_rsv(struct btrfs_fs_info *fs_info) |
4283 | { | |
4284 | struct btrfs_block_rsv *block_rsv = &fs_info->global_block_rsv; | |
4285 | struct btrfs_space_info *sinfo = block_rsv->space_info; | |
4286 | u64 num_bytes; | |
6a63209f | 4287 | |
8929ecfa | 4288 | num_bytes = calc_global_metadata_size(fs_info); |
33b4d47f | 4289 | |
8929ecfa | 4290 | spin_lock(&sinfo->lock); |
1f699d38 | 4291 | spin_lock(&block_rsv->lock); |
4e06bdd6 | 4292 | |
8929ecfa | 4293 | block_rsv->size = num_bytes; |
4e06bdd6 | 4294 | |
8929ecfa | 4295 | num_bytes = sinfo->bytes_used + sinfo->bytes_pinned + |
6d48755d JB |
4296 | sinfo->bytes_reserved + sinfo->bytes_readonly + |
4297 | sinfo->bytes_may_use; | |
8929ecfa YZ |
4298 | |
4299 | if (sinfo->total_bytes > num_bytes) { | |
4300 | num_bytes = sinfo->total_bytes - num_bytes; | |
4301 | block_rsv->reserved += num_bytes; | |
fb25e914 | 4302 | sinfo->bytes_may_use += num_bytes; |
8c2a3ca2 | 4303 | trace_btrfs_space_reservation(fs_info, "space_info", |
2bcc0328 | 4304 | sinfo->flags, num_bytes, 1); |
6a63209f | 4305 | } |
6a63209f | 4306 | |
8929ecfa YZ |
4307 | if (block_rsv->reserved >= block_rsv->size) { |
4308 | num_bytes = block_rsv->reserved - block_rsv->size; | |
fb25e914 | 4309 | sinfo->bytes_may_use -= num_bytes; |
8c2a3ca2 | 4310 | trace_btrfs_space_reservation(fs_info, "space_info", |
2bcc0328 | 4311 | sinfo->flags, num_bytes, 0); |
36e39c40 | 4312 | sinfo->reservation_progress++; |
8929ecfa YZ |
4313 | block_rsv->reserved = block_rsv->size; |
4314 | block_rsv->full = 1; | |
4315 | } | |
182608c8 | 4316 | |
8929ecfa | 4317 | spin_unlock(&block_rsv->lock); |
1f699d38 | 4318 | spin_unlock(&sinfo->lock); |
6a63209f JB |
4319 | } |
4320 | ||
f0486c68 | 4321 | static void init_global_block_rsv(struct btrfs_fs_info *fs_info) |
6a63209f | 4322 | { |
f0486c68 | 4323 | struct btrfs_space_info *space_info; |
6a63209f | 4324 | |
f0486c68 YZ |
4325 | space_info = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_SYSTEM); |
4326 | fs_info->chunk_block_rsv.space_info = space_info; | |
6a63209f | 4327 | |
f0486c68 | 4328 | space_info = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_METADATA); |
8929ecfa | 4329 | fs_info->global_block_rsv.space_info = space_info; |
8929ecfa | 4330 | fs_info->delalloc_block_rsv.space_info = space_info; |
f0486c68 YZ |
4331 | fs_info->trans_block_rsv.space_info = space_info; |
4332 | fs_info->empty_block_rsv.space_info = space_info; | |
6d668dda | 4333 | fs_info->delayed_block_rsv.space_info = space_info; |
f0486c68 | 4334 | |
8929ecfa YZ |
4335 | fs_info->extent_root->block_rsv = &fs_info->global_block_rsv; |
4336 | fs_info->csum_root->block_rsv = &fs_info->global_block_rsv; | |
4337 | fs_info->dev_root->block_rsv = &fs_info->global_block_rsv; | |
4338 | fs_info->tree_root->block_rsv = &fs_info->global_block_rsv; | |
f0486c68 | 4339 | fs_info->chunk_root->block_rsv = &fs_info->chunk_block_rsv; |
8929ecfa | 4340 | |
8929ecfa | 4341 | update_global_block_rsv(fs_info); |
6a63209f JB |
4342 | } |
4343 | ||
8929ecfa | 4344 | static void release_global_block_rsv(struct btrfs_fs_info *fs_info) |
6a63209f | 4345 | { |
8c2a3ca2 JB |
4346 | block_rsv_release_bytes(fs_info, &fs_info->global_block_rsv, NULL, |
4347 | (u64)-1); | |
8929ecfa YZ |
4348 | WARN_ON(fs_info->delalloc_block_rsv.size > 0); |
4349 | WARN_ON(fs_info->delalloc_block_rsv.reserved > 0); | |
4350 | WARN_ON(fs_info->trans_block_rsv.size > 0); | |
4351 | WARN_ON(fs_info->trans_block_rsv.reserved > 0); | |
4352 | WARN_ON(fs_info->chunk_block_rsv.size > 0); | |
4353 | WARN_ON(fs_info->chunk_block_rsv.reserved > 0); | |
6d668dda JB |
4354 | WARN_ON(fs_info->delayed_block_rsv.size > 0); |
4355 | WARN_ON(fs_info->delayed_block_rsv.reserved > 0); | |
fcb80c2a JB |
4356 | } |
4357 | ||
a22285a6 YZ |
4358 | void btrfs_trans_release_metadata(struct btrfs_trans_handle *trans, |
4359 | struct btrfs_root *root) | |
6a63209f | 4360 | { |
0e721106 JB |
4361 | if (!trans->block_rsv) |
4362 | return; | |
4363 | ||
a22285a6 YZ |
4364 | if (!trans->bytes_reserved) |
4365 | return; | |
6a63209f | 4366 | |
e77266e4 | 4367 | trace_btrfs_space_reservation(root->fs_info, "transaction", |
2bcc0328 | 4368 | trans->transid, trans->bytes_reserved, 0); |
b24e03db | 4369 | btrfs_block_rsv_release(root, trans->block_rsv, trans->bytes_reserved); |
a22285a6 YZ |
4370 | trans->bytes_reserved = 0; |
4371 | } | |
6a63209f | 4372 | |
79787eaa | 4373 | /* Can only return 0 or -ENOSPC */ |
d68fc57b YZ |
4374 | int btrfs_orphan_reserve_metadata(struct btrfs_trans_handle *trans, |
4375 | struct inode *inode) | |
4376 | { | |
4377 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
4378 | struct btrfs_block_rsv *src_rsv = get_block_rsv(trans, root); | |
4379 | struct btrfs_block_rsv *dst_rsv = root->orphan_block_rsv; | |
4380 | ||
4381 | /* | |
fcb80c2a JB |
4382 | * We need to hold space in order to delete our orphan item once we've |
4383 | * added it, so this takes the reservation so we can release it later | |
4384 | * when we are truly done with the orphan item. | |
d68fc57b | 4385 | */ |
ff5714cc | 4386 | u64 num_bytes = btrfs_calc_trans_metadata_size(root, 1); |
8c2a3ca2 JB |
4387 | trace_btrfs_space_reservation(root->fs_info, "orphan", |
4388 | btrfs_ino(inode), num_bytes, 1); | |
d68fc57b | 4389 | return block_rsv_migrate_bytes(src_rsv, dst_rsv, num_bytes); |
6a63209f JB |
4390 | } |
4391 | ||
d68fc57b | 4392 | void btrfs_orphan_release_metadata(struct inode *inode) |
97e728d4 | 4393 | { |
d68fc57b | 4394 | struct btrfs_root *root = BTRFS_I(inode)->root; |
ff5714cc | 4395 | u64 num_bytes = btrfs_calc_trans_metadata_size(root, 1); |
8c2a3ca2 JB |
4396 | trace_btrfs_space_reservation(root->fs_info, "orphan", |
4397 | btrfs_ino(inode), num_bytes, 0); | |
d68fc57b YZ |
4398 | btrfs_block_rsv_release(root, root->orphan_block_rsv, num_bytes); |
4399 | } | |
97e728d4 | 4400 | |
a22285a6 YZ |
4401 | int btrfs_snap_reserve_metadata(struct btrfs_trans_handle *trans, |
4402 | struct btrfs_pending_snapshot *pending) | |
4403 | { | |
4404 | struct btrfs_root *root = pending->root; | |
4405 | struct btrfs_block_rsv *src_rsv = get_block_rsv(trans, root); | |
4406 | struct btrfs_block_rsv *dst_rsv = &pending->block_rsv; | |
4407 | /* | |
48c03c4b MX |
4408 | * two for root back/forward refs, two for directory entries, |
4409 | * one for root of the snapshot and one for parent inode. | |
a22285a6 | 4410 | */ |
48c03c4b | 4411 | u64 num_bytes = btrfs_calc_trans_metadata_size(root, 6); |
a22285a6 YZ |
4412 | dst_rsv->space_info = src_rsv->space_info; |
4413 | return block_rsv_migrate_bytes(src_rsv, dst_rsv, num_bytes); | |
97e728d4 JB |
4414 | } |
4415 | ||
7709cde3 JB |
4416 | /** |
4417 | * drop_outstanding_extent - drop an outstanding extent | |
4418 | * @inode: the inode we're dropping the extent for | |
4419 | * | |
4420 | * This is called when we are freeing up an outstanding extent, either called | |
4421 | * after an error or after an extent is written. This will return the number of | |
4422 | * reserved extents that need to be freed. This must be called with | |
4423 | * BTRFS_I(inode)->lock held. | |
4424 | */ | |
9e0baf60 JB |
4425 | static unsigned drop_outstanding_extent(struct inode *inode) |
4426 | { | |
7fd2ae21 | 4427 | unsigned drop_inode_space = 0; |
9e0baf60 JB |
4428 | unsigned dropped_extents = 0; |
4429 | ||
9e0baf60 JB |
4430 | BUG_ON(!BTRFS_I(inode)->outstanding_extents); |
4431 | BTRFS_I(inode)->outstanding_extents--; | |
4432 | ||
7fd2ae21 | 4433 | if (BTRFS_I(inode)->outstanding_extents == 0 && |
72ac3c0d JB |
4434 | test_and_clear_bit(BTRFS_INODE_DELALLOC_META_RESERVED, |
4435 | &BTRFS_I(inode)->runtime_flags)) | |
7fd2ae21 | 4436 | drop_inode_space = 1; |
7fd2ae21 | 4437 | |
9e0baf60 JB |
4438 | /* |
4439 | * If we have more or the same amount of outsanding extents than we have | |
4440 | * reserved then we need to leave the reserved extents count alone. | |
4441 | */ | |
4442 | if (BTRFS_I(inode)->outstanding_extents >= | |
4443 | BTRFS_I(inode)->reserved_extents) | |
7fd2ae21 | 4444 | return drop_inode_space; |
9e0baf60 JB |
4445 | |
4446 | dropped_extents = BTRFS_I(inode)->reserved_extents - | |
4447 | BTRFS_I(inode)->outstanding_extents; | |
4448 | BTRFS_I(inode)->reserved_extents -= dropped_extents; | |
7fd2ae21 | 4449 | return dropped_extents + drop_inode_space; |
9e0baf60 JB |
4450 | } |
4451 | ||
7709cde3 JB |
4452 | /** |
4453 | * calc_csum_metadata_size - return the amount of metada space that must be | |
4454 | * reserved/free'd for the given bytes. | |
4455 | * @inode: the inode we're manipulating | |
4456 | * @num_bytes: the number of bytes in question | |
4457 | * @reserve: 1 if we are reserving space, 0 if we are freeing space | |
4458 | * | |
4459 | * This adjusts the number of csum_bytes in the inode and then returns the | |
4460 | * correct amount of metadata that must either be reserved or freed. We | |
4461 | * calculate how many checksums we can fit into one leaf and then divide the | |
4462 | * number of bytes that will need to be checksumed by this value to figure out | |
4463 | * how many checksums will be required. If we are adding bytes then the number | |
4464 | * may go up and we will return the number of additional bytes that must be | |
4465 | * reserved. If it is going down we will return the number of bytes that must | |
4466 | * be freed. | |
4467 | * | |
4468 | * This must be called with BTRFS_I(inode)->lock held. | |
4469 | */ | |
4470 | static u64 calc_csum_metadata_size(struct inode *inode, u64 num_bytes, | |
4471 | int reserve) | |
6324fbf3 | 4472 | { |
7709cde3 JB |
4473 | struct btrfs_root *root = BTRFS_I(inode)->root; |
4474 | u64 csum_size; | |
4475 | int num_csums_per_leaf; | |
4476 | int num_csums; | |
4477 | int old_csums; | |
4478 | ||
4479 | if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM && | |
4480 | BTRFS_I(inode)->csum_bytes == 0) | |
4481 | return 0; | |
4482 | ||
4483 | old_csums = (int)div64_u64(BTRFS_I(inode)->csum_bytes, root->sectorsize); | |
4484 | if (reserve) | |
4485 | BTRFS_I(inode)->csum_bytes += num_bytes; | |
4486 | else | |
4487 | BTRFS_I(inode)->csum_bytes -= num_bytes; | |
4488 | csum_size = BTRFS_LEAF_DATA_SIZE(root) - sizeof(struct btrfs_item); | |
4489 | num_csums_per_leaf = (int)div64_u64(csum_size, | |
4490 | sizeof(struct btrfs_csum_item) + | |
4491 | sizeof(struct btrfs_disk_key)); | |
4492 | num_csums = (int)div64_u64(BTRFS_I(inode)->csum_bytes, root->sectorsize); | |
4493 | num_csums = num_csums + num_csums_per_leaf - 1; | |
4494 | num_csums = num_csums / num_csums_per_leaf; | |
4495 | ||
4496 | old_csums = old_csums + num_csums_per_leaf - 1; | |
4497 | old_csums = old_csums / num_csums_per_leaf; | |
4498 | ||
4499 | /* No change, no need to reserve more */ | |
4500 | if (old_csums == num_csums) | |
4501 | return 0; | |
4502 | ||
4503 | if (reserve) | |
4504 | return btrfs_calc_trans_metadata_size(root, | |
4505 | num_csums - old_csums); | |
4506 | ||
4507 | return btrfs_calc_trans_metadata_size(root, old_csums - num_csums); | |
0ca1f7ce | 4508 | } |
c146afad | 4509 | |
0ca1f7ce YZ |
4510 | int btrfs_delalloc_reserve_metadata(struct inode *inode, u64 num_bytes) |
4511 | { | |
4512 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
4513 | struct btrfs_block_rsv *block_rsv = &root->fs_info->delalloc_block_rsv; | |
9e0baf60 | 4514 | u64 to_reserve = 0; |
660d3f6c | 4515 | u64 csum_bytes; |
9e0baf60 | 4516 | unsigned nr_extents = 0; |
660d3f6c | 4517 | int extra_reserve = 0; |
c09544e0 | 4518 | int flush = 1; |
0ca1f7ce | 4519 | int ret; |
6324fbf3 | 4520 | |
660d3f6c | 4521 | /* Need to be holding the i_mutex here if we aren't free space cache */ |
83eea1f1 | 4522 | if (btrfs_is_free_space_inode(inode)) |
c09544e0 JB |
4523 | flush = 0; |
4524 | ||
4525 | if (flush && btrfs_transaction_in_commit(root->fs_info)) | |
0ca1f7ce | 4526 | schedule_timeout(1); |
ec44a35c | 4527 | |
f248679e | 4528 | mutex_lock(&BTRFS_I(inode)->delalloc_mutex); |
0ca1f7ce | 4529 | num_bytes = ALIGN(num_bytes, root->sectorsize); |
8bb8ab2e | 4530 | |
9e0baf60 JB |
4531 | spin_lock(&BTRFS_I(inode)->lock); |
4532 | BTRFS_I(inode)->outstanding_extents++; | |
4533 | ||
4534 | if (BTRFS_I(inode)->outstanding_extents > | |
660d3f6c | 4535 | BTRFS_I(inode)->reserved_extents) |
9e0baf60 JB |
4536 | nr_extents = BTRFS_I(inode)->outstanding_extents - |
4537 | BTRFS_I(inode)->reserved_extents; | |
57a45ced | 4538 | |
7fd2ae21 JB |
4539 | /* |
4540 | * Add an item to reserve for updating the inode when we complete the | |
4541 | * delalloc io. | |
4542 | */ | |
72ac3c0d JB |
4543 | if (!test_bit(BTRFS_INODE_DELALLOC_META_RESERVED, |
4544 | &BTRFS_I(inode)->runtime_flags)) { | |
7fd2ae21 | 4545 | nr_extents++; |
660d3f6c | 4546 | extra_reserve = 1; |
593060d7 | 4547 | } |
7fd2ae21 JB |
4548 | |
4549 | to_reserve = btrfs_calc_trans_metadata_size(root, nr_extents); | |
7709cde3 | 4550 | to_reserve += calc_csum_metadata_size(inode, num_bytes, 1); |
660d3f6c | 4551 | csum_bytes = BTRFS_I(inode)->csum_bytes; |
9e0baf60 | 4552 | spin_unlock(&BTRFS_I(inode)->lock); |
57a45ced | 4553 | |
c5567237 AJ |
4554 | if (root->fs_info->quota_enabled) { |
4555 | ret = btrfs_qgroup_reserve(root, num_bytes + | |
4556 | nr_extents * root->leafsize); | |
55e591ff DC |
4557 | if (ret) { |
4558 | mutex_unlock(&BTRFS_I(inode)->delalloc_mutex); | |
c5567237 | 4559 | return ret; |
55e591ff | 4560 | } |
c5567237 AJ |
4561 | } |
4562 | ||
36ba022a | 4563 | ret = reserve_metadata_bytes(root, block_rsv, to_reserve, flush); |
9e0baf60 | 4564 | if (ret) { |
7ed49f18 | 4565 | u64 to_free = 0; |
9e0baf60 | 4566 | unsigned dropped; |
7ed49f18 | 4567 | |
7709cde3 | 4568 | spin_lock(&BTRFS_I(inode)->lock); |
9e0baf60 | 4569 | dropped = drop_outstanding_extent(inode); |
9e0baf60 | 4570 | /* |
660d3f6c JB |
4571 | * If the inodes csum_bytes is the same as the original |
4572 | * csum_bytes then we know we haven't raced with any free()ers | |
4573 | * so we can just reduce our inodes csum bytes and carry on. | |
4574 | * Otherwise we have to do the normal free thing to account for | |
4575 | * the case that the free side didn't free up its reserve | |
4576 | * because of this outstanding reservation. | |
9e0baf60 | 4577 | */ |
660d3f6c JB |
4578 | if (BTRFS_I(inode)->csum_bytes == csum_bytes) |
4579 | calc_csum_metadata_size(inode, num_bytes, 0); | |
4580 | else | |
4581 | to_free = calc_csum_metadata_size(inode, num_bytes, 0); | |
4582 | spin_unlock(&BTRFS_I(inode)->lock); | |
4583 | if (dropped) | |
4584 | to_free += btrfs_calc_trans_metadata_size(root, dropped); | |
4585 | ||
8c2a3ca2 | 4586 | if (to_free) { |
7ed49f18 | 4587 | btrfs_block_rsv_release(root, block_rsv, to_free); |
8c2a3ca2 JB |
4588 | trace_btrfs_space_reservation(root->fs_info, |
4589 | "delalloc", | |
4590 | btrfs_ino(inode), | |
4591 | to_free, 0); | |
4592 | } | |
f248679e | 4593 | mutex_unlock(&BTRFS_I(inode)->delalloc_mutex); |
0ca1f7ce | 4594 | return ret; |
9e0baf60 | 4595 | } |
25179201 | 4596 | |
660d3f6c JB |
4597 | spin_lock(&BTRFS_I(inode)->lock); |
4598 | if (extra_reserve) { | |
72ac3c0d JB |
4599 | set_bit(BTRFS_INODE_DELALLOC_META_RESERVED, |
4600 | &BTRFS_I(inode)->runtime_flags); | |
660d3f6c JB |
4601 | nr_extents--; |
4602 | } | |
4603 | BTRFS_I(inode)->reserved_extents += nr_extents; | |
4604 | spin_unlock(&BTRFS_I(inode)->lock); | |
f248679e | 4605 | mutex_unlock(&BTRFS_I(inode)->delalloc_mutex); |
660d3f6c | 4606 | |
8c2a3ca2 JB |
4607 | if (to_reserve) |
4608 | trace_btrfs_space_reservation(root->fs_info,"delalloc", | |
4609 | btrfs_ino(inode), to_reserve, 1); | |
0ca1f7ce YZ |
4610 | block_rsv_add_bytes(block_rsv, to_reserve, 1); |
4611 | ||
0ca1f7ce YZ |
4612 | return 0; |
4613 | } | |
4614 | ||
7709cde3 JB |
4615 | /** |
4616 | * btrfs_delalloc_release_metadata - release a metadata reservation for an inode | |
4617 | * @inode: the inode to release the reservation for | |
4618 | * @num_bytes: the number of bytes we're releasing | |
4619 | * | |
4620 | * This will release the metadata reservation for an inode. This can be called | |
4621 | * once we complete IO for a given set of bytes to release their metadata | |
4622 | * reservations. | |
4623 | */ | |
0ca1f7ce YZ |
4624 | void btrfs_delalloc_release_metadata(struct inode *inode, u64 num_bytes) |
4625 | { | |
4626 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
9e0baf60 JB |
4627 | u64 to_free = 0; |
4628 | unsigned dropped; | |
0ca1f7ce YZ |
4629 | |
4630 | num_bytes = ALIGN(num_bytes, root->sectorsize); | |
7709cde3 | 4631 | spin_lock(&BTRFS_I(inode)->lock); |
9e0baf60 | 4632 | dropped = drop_outstanding_extent(inode); |
97e728d4 | 4633 | |
7709cde3 JB |
4634 | to_free = calc_csum_metadata_size(inode, num_bytes, 0); |
4635 | spin_unlock(&BTRFS_I(inode)->lock); | |
9e0baf60 JB |
4636 | if (dropped > 0) |
4637 | to_free += btrfs_calc_trans_metadata_size(root, dropped); | |
0ca1f7ce | 4638 | |
8c2a3ca2 JB |
4639 | trace_btrfs_space_reservation(root->fs_info, "delalloc", |
4640 | btrfs_ino(inode), to_free, 0); | |
c5567237 AJ |
4641 | if (root->fs_info->quota_enabled) { |
4642 | btrfs_qgroup_free(root, num_bytes + | |
4643 | dropped * root->leafsize); | |
4644 | } | |
4645 | ||
0ca1f7ce YZ |
4646 | btrfs_block_rsv_release(root, &root->fs_info->delalloc_block_rsv, |
4647 | to_free); | |
4648 | } | |
4649 | ||
7709cde3 JB |
4650 | /** |
4651 | * btrfs_delalloc_reserve_space - reserve data and metadata space for delalloc | |
4652 | * @inode: inode we're writing to | |
4653 | * @num_bytes: the number of bytes we want to allocate | |
4654 | * | |
4655 | * This will do the following things | |
4656 | * | |
4657 | * o reserve space in the data space info for num_bytes | |
4658 | * o reserve space in the metadata space info based on number of outstanding | |
4659 | * extents and how much csums will be needed | |
4660 | * o add to the inodes ->delalloc_bytes | |
4661 | * o add it to the fs_info's delalloc inodes list. | |
4662 | * | |
4663 | * This will return 0 for success and -ENOSPC if there is no space left. | |
4664 | */ | |
0ca1f7ce YZ |
4665 | int btrfs_delalloc_reserve_space(struct inode *inode, u64 num_bytes) |
4666 | { | |
4667 | int ret; | |
4668 | ||
4669 | ret = btrfs_check_data_free_space(inode, num_bytes); | |
d397712b | 4670 | if (ret) |
0ca1f7ce YZ |
4671 | return ret; |
4672 | ||
4673 | ret = btrfs_delalloc_reserve_metadata(inode, num_bytes); | |
4674 | if (ret) { | |
4675 | btrfs_free_reserved_data_space(inode, num_bytes); | |
4676 | return ret; | |
4677 | } | |
4678 | ||
4679 | return 0; | |
4680 | } | |
4681 | ||
7709cde3 JB |
4682 | /** |
4683 | * btrfs_delalloc_release_space - release data and metadata space for delalloc | |
4684 | * @inode: inode we're releasing space for | |
4685 | * @num_bytes: the number of bytes we want to free up | |
4686 | * | |
4687 | * This must be matched with a call to btrfs_delalloc_reserve_space. This is | |
4688 | * called in the case that we don't need the metadata AND data reservations | |
4689 | * anymore. So if there is an error or we insert an inline extent. | |
4690 | * | |
4691 | * This function will release the metadata space that was not used and will | |
4692 | * decrement ->delalloc_bytes and remove it from the fs_info delalloc_inodes | |
4693 | * list if there are no delalloc bytes left. | |
4694 | */ | |
0ca1f7ce YZ |
4695 | void btrfs_delalloc_release_space(struct inode *inode, u64 num_bytes) |
4696 | { | |
4697 | btrfs_delalloc_release_metadata(inode, num_bytes); | |
4698 | btrfs_free_reserved_data_space(inode, num_bytes); | |
6324fbf3 CM |
4699 | } |
4700 | ||
9078a3e1 CM |
4701 | static int update_block_group(struct btrfs_trans_handle *trans, |
4702 | struct btrfs_root *root, | |
f0486c68 | 4703 | u64 bytenr, u64 num_bytes, int alloc) |
9078a3e1 | 4704 | { |
0af3d00b | 4705 | struct btrfs_block_group_cache *cache = NULL; |
9078a3e1 | 4706 | struct btrfs_fs_info *info = root->fs_info; |
db94535d | 4707 | u64 total = num_bytes; |
9078a3e1 | 4708 | u64 old_val; |
db94535d | 4709 | u64 byte_in_group; |
0af3d00b | 4710 | int factor; |
3e1ad54f | 4711 | |
5d4f98a2 YZ |
4712 | /* block accounting for super block */ |
4713 | spin_lock(&info->delalloc_lock); | |
6c41761f | 4714 | old_val = btrfs_super_bytes_used(info->super_copy); |
5d4f98a2 YZ |
4715 | if (alloc) |
4716 | old_val += num_bytes; | |
4717 | else | |
4718 | old_val -= num_bytes; | |
6c41761f | 4719 | btrfs_set_super_bytes_used(info->super_copy, old_val); |
5d4f98a2 YZ |
4720 | spin_unlock(&info->delalloc_lock); |
4721 | ||
d397712b | 4722 | while (total) { |
db94535d | 4723 | cache = btrfs_lookup_block_group(info, bytenr); |
f3465ca4 | 4724 | if (!cache) |
79787eaa | 4725 | return -ENOENT; |
b742bb82 YZ |
4726 | if (cache->flags & (BTRFS_BLOCK_GROUP_DUP | |
4727 | BTRFS_BLOCK_GROUP_RAID1 | | |
4728 | BTRFS_BLOCK_GROUP_RAID10)) | |
4729 | factor = 2; | |
4730 | else | |
4731 | factor = 1; | |
9d66e233 JB |
4732 | /* |
4733 | * If this block group has free space cache written out, we | |
4734 | * need to make sure to load it if we are removing space. This | |
4735 | * is because we need the unpinning stage to actually add the | |
4736 | * space back to the block group, otherwise we will leak space. | |
4737 | */ | |
4738 | if (!alloc && cache->cached == BTRFS_CACHE_NO) | |
b8399dee | 4739 | cache_block_group(cache, trans, NULL, 1); |
0af3d00b | 4740 | |
db94535d CM |
4741 | byte_in_group = bytenr - cache->key.objectid; |
4742 | WARN_ON(byte_in_group > cache->key.offset); | |
9078a3e1 | 4743 | |
25179201 | 4744 | spin_lock(&cache->space_info->lock); |
c286ac48 | 4745 | spin_lock(&cache->lock); |
0af3d00b | 4746 | |
73bc1876 | 4747 | if (btrfs_test_opt(root, SPACE_CACHE) && |
0af3d00b JB |
4748 | cache->disk_cache_state < BTRFS_DC_CLEAR) |
4749 | cache->disk_cache_state = BTRFS_DC_CLEAR; | |
4750 | ||
0f9dd46c | 4751 | cache->dirty = 1; |
9078a3e1 | 4752 | old_val = btrfs_block_group_used(&cache->item); |
db94535d | 4753 | num_bytes = min(total, cache->key.offset - byte_in_group); |
cd1bc465 | 4754 | if (alloc) { |
db94535d | 4755 | old_val += num_bytes; |
11833d66 YZ |
4756 | btrfs_set_block_group_used(&cache->item, old_val); |
4757 | cache->reserved -= num_bytes; | |
11833d66 | 4758 | cache->space_info->bytes_reserved -= num_bytes; |
b742bb82 YZ |
4759 | cache->space_info->bytes_used += num_bytes; |
4760 | cache->space_info->disk_used += num_bytes * factor; | |
c286ac48 | 4761 | spin_unlock(&cache->lock); |
25179201 | 4762 | spin_unlock(&cache->space_info->lock); |
cd1bc465 | 4763 | } else { |
db94535d | 4764 | old_val -= num_bytes; |
c286ac48 | 4765 | btrfs_set_block_group_used(&cache->item, old_val); |
f0486c68 YZ |
4766 | cache->pinned += num_bytes; |
4767 | cache->space_info->bytes_pinned += num_bytes; | |
6324fbf3 | 4768 | cache->space_info->bytes_used -= num_bytes; |
b742bb82 | 4769 | cache->space_info->disk_used -= num_bytes * factor; |
c286ac48 | 4770 | spin_unlock(&cache->lock); |
25179201 | 4771 | spin_unlock(&cache->space_info->lock); |
1f3c79a2 | 4772 | |
f0486c68 YZ |
4773 | set_extent_dirty(info->pinned_extents, |
4774 | bytenr, bytenr + num_bytes - 1, | |
4775 | GFP_NOFS | __GFP_NOFAIL); | |
cd1bc465 | 4776 | } |
fa9c0d79 | 4777 | btrfs_put_block_group(cache); |
db94535d CM |
4778 | total -= num_bytes; |
4779 | bytenr += num_bytes; | |
9078a3e1 CM |
4780 | } |
4781 | return 0; | |
4782 | } | |
6324fbf3 | 4783 | |
a061fc8d CM |
4784 | static u64 first_logical_byte(struct btrfs_root *root, u64 search_start) |
4785 | { | |
0f9dd46c | 4786 | struct btrfs_block_group_cache *cache; |
d2fb3437 | 4787 | u64 bytenr; |
0f9dd46c JB |
4788 | |
4789 | cache = btrfs_lookup_first_block_group(root->fs_info, search_start); | |
4790 | if (!cache) | |
a061fc8d | 4791 | return 0; |
0f9dd46c | 4792 | |
d2fb3437 | 4793 | bytenr = cache->key.objectid; |
fa9c0d79 | 4794 | btrfs_put_block_group(cache); |
d2fb3437 YZ |
4795 | |
4796 | return bytenr; | |
a061fc8d CM |
4797 | } |
4798 | ||
f0486c68 YZ |
4799 | static int pin_down_extent(struct btrfs_root *root, |
4800 | struct btrfs_block_group_cache *cache, | |
4801 | u64 bytenr, u64 num_bytes, int reserved) | |
324ae4df | 4802 | { |
11833d66 YZ |
4803 | spin_lock(&cache->space_info->lock); |
4804 | spin_lock(&cache->lock); | |
4805 | cache->pinned += num_bytes; | |
4806 | cache->space_info->bytes_pinned += num_bytes; | |
4807 | if (reserved) { | |
4808 | cache->reserved -= num_bytes; | |
4809 | cache->space_info->bytes_reserved -= num_bytes; | |
4810 | } | |
4811 | spin_unlock(&cache->lock); | |
4812 | spin_unlock(&cache->space_info->lock); | |
68b38550 | 4813 | |
f0486c68 YZ |
4814 | set_extent_dirty(root->fs_info->pinned_extents, bytenr, |
4815 | bytenr + num_bytes - 1, GFP_NOFS | __GFP_NOFAIL); | |
4816 | return 0; | |
4817 | } | |
68b38550 | 4818 | |
f0486c68 YZ |
4819 | /* |
4820 | * this function must be called within transaction | |
4821 | */ | |
4822 | int btrfs_pin_extent(struct btrfs_root *root, | |
4823 | u64 bytenr, u64 num_bytes, int reserved) | |
4824 | { | |
4825 | struct btrfs_block_group_cache *cache; | |
68b38550 | 4826 | |
f0486c68 | 4827 | cache = btrfs_lookup_block_group(root->fs_info, bytenr); |
79787eaa | 4828 | BUG_ON(!cache); /* Logic error */ |
f0486c68 YZ |
4829 | |
4830 | pin_down_extent(root, cache, bytenr, num_bytes, reserved); | |
4831 | ||
4832 | btrfs_put_block_group(cache); | |
11833d66 YZ |
4833 | return 0; |
4834 | } | |
4835 | ||
f0486c68 | 4836 | /* |
e688b725 CM |
4837 | * this function must be called within transaction |
4838 | */ | |
4839 | int btrfs_pin_extent_for_log_replay(struct btrfs_trans_handle *trans, | |
4840 | struct btrfs_root *root, | |
4841 | u64 bytenr, u64 num_bytes) | |
4842 | { | |
4843 | struct btrfs_block_group_cache *cache; | |
4844 | ||
4845 | cache = btrfs_lookup_block_group(root->fs_info, bytenr); | |
79787eaa | 4846 | BUG_ON(!cache); /* Logic error */ |
e688b725 CM |
4847 | |
4848 | /* | |
4849 | * pull in the free space cache (if any) so that our pin | |
4850 | * removes the free space from the cache. We have load_only set | |
4851 | * to one because the slow code to read in the free extents does check | |
4852 | * the pinned extents. | |
4853 | */ | |
4854 | cache_block_group(cache, trans, root, 1); | |
4855 | ||
4856 | pin_down_extent(root, cache, bytenr, num_bytes, 0); | |
4857 | ||
4858 | /* remove us from the free space cache (if we're there at all) */ | |
4859 | btrfs_remove_free_space(cache, bytenr, num_bytes); | |
4860 | btrfs_put_block_group(cache); | |
4861 | return 0; | |
4862 | } | |
4863 | ||
fb25e914 JB |
4864 | /** |
4865 | * btrfs_update_reserved_bytes - update the block_group and space info counters | |
4866 | * @cache: The cache we are manipulating | |
4867 | * @num_bytes: The number of bytes in question | |
4868 | * @reserve: One of the reservation enums | |
4869 | * | |
4870 | * This is called by the allocator when it reserves space, or by somebody who is | |
4871 | * freeing space that was never actually used on disk. For example if you | |
4872 | * reserve some space for a new leaf in transaction A and before transaction A | |
4873 | * commits you free that leaf, you call this with reserve set to 0 in order to | |
4874 | * clear the reservation. | |
4875 | * | |
4876 | * Metadata reservations should be called with RESERVE_ALLOC so we do the proper | |
4877 | * ENOSPC accounting. For data we handle the reservation through clearing the | |
4878 | * delalloc bits in the io_tree. We have to do this since we could end up | |
4879 | * allocating less disk space for the amount of data we have reserved in the | |
4880 | * case of compression. | |
4881 | * | |
4882 | * If this is a reservation and the block group has become read only we cannot | |
4883 | * make the reservation and return -EAGAIN, otherwise this function always | |
4884 | * succeeds. | |
f0486c68 | 4885 | */ |
fb25e914 JB |
4886 | static int btrfs_update_reserved_bytes(struct btrfs_block_group_cache *cache, |
4887 | u64 num_bytes, int reserve) | |
11833d66 | 4888 | { |
fb25e914 | 4889 | struct btrfs_space_info *space_info = cache->space_info; |
f0486c68 | 4890 | int ret = 0; |
79787eaa | 4891 | |
fb25e914 JB |
4892 | spin_lock(&space_info->lock); |
4893 | spin_lock(&cache->lock); | |
4894 | if (reserve != RESERVE_FREE) { | |
f0486c68 YZ |
4895 | if (cache->ro) { |
4896 | ret = -EAGAIN; | |
4897 | } else { | |
fb25e914 JB |
4898 | cache->reserved += num_bytes; |
4899 | space_info->bytes_reserved += num_bytes; | |
4900 | if (reserve == RESERVE_ALLOC) { | |
8c2a3ca2 | 4901 | trace_btrfs_space_reservation(cache->fs_info, |
2bcc0328 LB |
4902 | "space_info", space_info->flags, |
4903 | num_bytes, 0); | |
fb25e914 JB |
4904 | space_info->bytes_may_use -= num_bytes; |
4905 | } | |
f0486c68 | 4906 | } |
fb25e914 JB |
4907 | } else { |
4908 | if (cache->ro) | |
4909 | space_info->bytes_readonly += num_bytes; | |
4910 | cache->reserved -= num_bytes; | |
4911 | space_info->bytes_reserved -= num_bytes; | |
4912 | space_info->reservation_progress++; | |
324ae4df | 4913 | } |
fb25e914 JB |
4914 | spin_unlock(&cache->lock); |
4915 | spin_unlock(&space_info->lock); | |
f0486c68 | 4916 | return ret; |
324ae4df | 4917 | } |
9078a3e1 | 4918 | |
143bede5 | 4919 | void btrfs_prepare_extent_commit(struct btrfs_trans_handle *trans, |
11833d66 | 4920 | struct btrfs_root *root) |
e8569813 | 4921 | { |
e8569813 | 4922 | struct btrfs_fs_info *fs_info = root->fs_info; |
11833d66 YZ |
4923 | struct btrfs_caching_control *next; |
4924 | struct btrfs_caching_control *caching_ctl; | |
4925 | struct btrfs_block_group_cache *cache; | |
e8569813 | 4926 | |
11833d66 | 4927 | down_write(&fs_info->extent_commit_sem); |
25179201 | 4928 | |
11833d66 YZ |
4929 | list_for_each_entry_safe(caching_ctl, next, |
4930 | &fs_info->caching_block_groups, list) { | |
4931 | cache = caching_ctl->block_group; | |
4932 | if (block_group_cache_done(cache)) { | |
4933 | cache->last_byte_to_unpin = (u64)-1; | |
4934 | list_del_init(&caching_ctl->list); | |
4935 | put_caching_control(caching_ctl); | |
e8569813 | 4936 | } else { |
11833d66 | 4937 | cache->last_byte_to_unpin = caching_ctl->progress; |
e8569813 | 4938 | } |
e8569813 | 4939 | } |
11833d66 YZ |
4940 | |
4941 | if (fs_info->pinned_extents == &fs_info->freed_extents[0]) | |
4942 | fs_info->pinned_extents = &fs_info->freed_extents[1]; | |
4943 | else | |
4944 | fs_info->pinned_extents = &fs_info->freed_extents[0]; | |
4945 | ||
4946 | up_write(&fs_info->extent_commit_sem); | |
8929ecfa YZ |
4947 | |
4948 | update_global_block_rsv(fs_info); | |
e8569813 ZY |
4949 | } |
4950 | ||
11833d66 | 4951 | static int unpin_extent_range(struct btrfs_root *root, u64 start, u64 end) |
ccd467d6 | 4952 | { |
11833d66 YZ |
4953 | struct btrfs_fs_info *fs_info = root->fs_info; |
4954 | struct btrfs_block_group_cache *cache = NULL; | |
4955 | u64 len; | |
ccd467d6 | 4956 | |
11833d66 YZ |
4957 | while (start <= end) { |
4958 | if (!cache || | |
4959 | start >= cache->key.objectid + cache->key.offset) { | |
4960 | if (cache) | |
4961 | btrfs_put_block_group(cache); | |
4962 | cache = btrfs_lookup_block_group(fs_info, start); | |
79787eaa | 4963 | BUG_ON(!cache); /* Logic error */ |
11833d66 YZ |
4964 | } |
4965 | ||
4966 | len = cache->key.objectid + cache->key.offset - start; | |
4967 | len = min(len, end + 1 - start); | |
4968 | ||
4969 | if (start < cache->last_byte_to_unpin) { | |
4970 | len = min(len, cache->last_byte_to_unpin - start); | |
4971 | btrfs_add_free_space(cache, start, len); | |
4972 | } | |
4973 | ||
f0486c68 YZ |
4974 | start += len; |
4975 | ||
11833d66 YZ |
4976 | spin_lock(&cache->space_info->lock); |
4977 | spin_lock(&cache->lock); | |
4978 | cache->pinned -= len; | |
4979 | cache->space_info->bytes_pinned -= len; | |
37be25bc | 4980 | if (cache->ro) |
f0486c68 | 4981 | cache->space_info->bytes_readonly += len; |
11833d66 YZ |
4982 | spin_unlock(&cache->lock); |
4983 | spin_unlock(&cache->space_info->lock); | |
ccd467d6 | 4984 | } |
11833d66 YZ |
4985 | |
4986 | if (cache) | |
4987 | btrfs_put_block_group(cache); | |
ccd467d6 CM |
4988 | return 0; |
4989 | } | |
4990 | ||
4991 | int btrfs_finish_extent_commit(struct btrfs_trans_handle *trans, | |
11833d66 | 4992 | struct btrfs_root *root) |
a28ec197 | 4993 | { |
11833d66 YZ |
4994 | struct btrfs_fs_info *fs_info = root->fs_info; |
4995 | struct extent_io_tree *unpin; | |
1a5bc167 CM |
4996 | u64 start; |
4997 | u64 end; | |
a28ec197 | 4998 | int ret; |
a28ec197 | 4999 | |
79787eaa JM |
5000 | if (trans->aborted) |
5001 | return 0; | |
5002 | ||
11833d66 YZ |
5003 | if (fs_info->pinned_extents == &fs_info->freed_extents[0]) |
5004 | unpin = &fs_info->freed_extents[1]; | |
5005 | else | |
5006 | unpin = &fs_info->freed_extents[0]; | |
5007 | ||
d397712b | 5008 | while (1) { |
1a5bc167 | 5009 | ret = find_first_extent_bit(unpin, 0, &start, &end, |
e6138876 | 5010 | EXTENT_DIRTY, NULL); |
1a5bc167 | 5011 | if (ret) |
a28ec197 | 5012 | break; |
1f3c79a2 | 5013 | |
5378e607 LD |
5014 | if (btrfs_test_opt(root, DISCARD)) |
5015 | ret = btrfs_discard_extent(root, start, | |
5016 | end + 1 - start, NULL); | |
1f3c79a2 | 5017 | |
1a5bc167 | 5018 | clear_extent_dirty(unpin, start, end, GFP_NOFS); |
11833d66 | 5019 | unpin_extent_range(root, start, end); |
b9473439 | 5020 | cond_resched(); |
a28ec197 | 5021 | } |
817d52f8 | 5022 | |
e20d96d6 CM |
5023 | return 0; |
5024 | } | |
5025 | ||
5d4f98a2 YZ |
5026 | static int __btrfs_free_extent(struct btrfs_trans_handle *trans, |
5027 | struct btrfs_root *root, | |
5028 | u64 bytenr, u64 num_bytes, u64 parent, | |
5029 | u64 root_objectid, u64 owner_objectid, | |
5030 | u64 owner_offset, int refs_to_drop, | |
5031 | struct btrfs_delayed_extent_op *extent_op) | |
a28ec197 | 5032 | { |
e2fa7227 | 5033 | struct btrfs_key key; |
5d4f98a2 | 5034 | struct btrfs_path *path; |
1261ec42 CM |
5035 | struct btrfs_fs_info *info = root->fs_info; |
5036 | struct btrfs_root *extent_root = info->extent_root; | |
5f39d397 | 5037 | struct extent_buffer *leaf; |
5d4f98a2 YZ |
5038 | struct btrfs_extent_item *ei; |
5039 | struct btrfs_extent_inline_ref *iref; | |
a28ec197 | 5040 | int ret; |
5d4f98a2 | 5041 | int is_data; |
952fccac CM |
5042 | int extent_slot = 0; |
5043 | int found_extent = 0; | |
5044 | int num_to_del = 1; | |
5d4f98a2 YZ |
5045 | u32 item_size; |
5046 | u64 refs; | |
037e6390 | 5047 | |
5caf2a00 | 5048 | path = btrfs_alloc_path(); |
54aa1f4d CM |
5049 | if (!path) |
5050 | return -ENOMEM; | |
5f26f772 | 5051 | |
3c12ac72 | 5052 | path->reada = 1; |
b9473439 | 5053 | path->leave_spinning = 1; |
5d4f98a2 YZ |
5054 | |
5055 | is_data = owner_objectid >= BTRFS_FIRST_FREE_OBJECTID; | |
5056 | BUG_ON(!is_data && refs_to_drop != 1); | |
5057 | ||
5058 | ret = lookup_extent_backref(trans, extent_root, path, &iref, | |
5059 | bytenr, num_bytes, parent, | |
5060 | root_objectid, owner_objectid, | |
5061 | owner_offset); | |
7bb86316 | 5062 | if (ret == 0) { |
952fccac | 5063 | extent_slot = path->slots[0]; |
5d4f98a2 YZ |
5064 | while (extent_slot >= 0) { |
5065 | btrfs_item_key_to_cpu(path->nodes[0], &key, | |
952fccac | 5066 | extent_slot); |
5d4f98a2 | 5067 | if (key.objectid != bytenr) |
952fccac | 5068 | break; |
5d4f98a2 YZ |
5069 | if (key.type == BTRFS_EXTENT_ITEM_KEY && |
5070 | key.offset == num_bytes) { | |
952fccac CM |
5071 | found_extent = 1; |
5072 | break; | |
5073 | } | |
5074 | if (path->slots[0] - extent_slot > 5) | |
5075 | break; | |
5d4f98a2 | 5076 | extent_slot--; |
952fccac | 5077 | } |
5d4f98a2 YZ |
5078 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 |
5079 | item_size = btrfs_item_size_nr(path->nodes[0], extent_slot); | |
5080 | if (found_extent && item_size < sizeof(*ei)) | |
5081 | found_extent = 0; | |
5082 | #endif | |
31840ae1 | 5083 | if (!found_extent) { |
5d4f98a2 | 5084 | BUG_ON(iref); |
56bec294 | 5085 | ret = remove_extent_backref(trans, extent_root, path, |
5d4f98a2 YZ |
5086 | NULL, refs_to_drop, |
5087 | is_data); | |
005d6427 DS |
5088 | if (ret) { |
5089 | btrfs_abort_transaction(trans, extent_root, ret); | |
5090 | goto out; | |
5091 | } | |
b3b4aa74 | 5092 | btrfs_release_path(path); |
b9473439 | 5093 | path->leave_spinning = 1; |
5d4f98a2 YZ |
5094 | |
5095 | key.objectid = bytenr; | |
5096 | key.type = BTRFS_EXTENT_ITEM_KEY; | |
5097 | key.offset = num_bytes; | |
5098 | ||
31840ae1 ZY |
5099 | ret = btrfs_search_slot(trans, extent_root, |
5100 | &key, path, -1, 1); | |
f3465ca4 JB |
5101 | if (ret) { |
5102 | printk(KERN_ERR "umm, got %d back from search" | |
d397712b CM |
5103 | ", was looking for %llu\n", ret, |
5104 | (unsigned long long)bytenr); | |
b783e62d JB |
5105 | if (ret > 0) |
5106 | btrfs_print_leaf(extent_root, | |
5107 | path->nodes[0]); | |
f3465ca4 | 5108 | } |
005d6427 DS |
5109 | if (ret < 0) { |
5110 | btrfs_abort_transaction(trans, extent_root, ret); | |
5111 | goto out; | |
5112 | } | |
31840ae1 ZY |
5113 | extent_slot = path->slots[0]; |
5114 | } | |
79787eaa | 5115 | } else if (ret == -ENOENT) { |
7bb86316 CM |
5116 | btrfs_print_leaf(extent_root, path->nodes[0]); |
5117 | WARN_ON(1); | |
d397712b | 5118 | printk(KERN_ERR "btrfs unable to find ref byte nr %llu " |
5d4f98a2 | 5119 | "parent %llu root %llu owner %llu offset %llu\n", |
d397712b | 5120 | (unsigned long long)bytenr, |
56bec294 | 5121 | (unsigned long long)parent, |
d397712b | 5122 | (unsigned long long)root_objectid, |
5d4f98a2 YZ |
5123 | (unsigned long long)owner_objectid, |
5124 | (unsigned long long)owner_offset); | |
79787eaa | 5125 | } else { |
005d6427 DS |
5126 | btrfs_abort_transaction(trans, extent_root, ret); |
5127 | goto out; | |
7bb86316 | 5128 | } |
5f39d397 CM |
5129 | |
5130 | leaf = path->nodes[0]; | |
5d4f98a2 YZ |
5131 | item_size = btrfs_item_size_nr(leaf, extent_slot); |
5132 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 | |
5133 | if (item_size < sizeof(*ei)) { | |
5134 | BUG_ON(found_extent || extent_slot != path->slots[0]); | |
5135 | ret = convert_extent_item_v0(trans, extent_root, path, | |
5136 | owner_objectid, 0); | |
005d6427 DS |
5137 | if (ret < 0) { |
5138 | btrfs_abort_transaction(trans, extent_root, ret); | |
5139 | goto out; | |
5140 | } | |
5d4f98a2 | 5141 | |
b3b4aa74 | 5142 | btrfs_release_path(path); |
5d4f98a2 YZ |
5143 | path->leave_spinning = 1; |
5144 | ||
5145 | key.objectid = bytenr; | |
5146 | key.type = BTRFS_EXTENT_ITEM_KEY; | |
5147 | key.offset = num_bytes; | |
5148 | ||
5149 | ret = btrfs_search_slot(trans, extent_root, &key, path, | |
5150 | -1, 1); | |
5151 | if (ret) { | |
5152 | printk(KERN_ERR "umm, got %d back from search" | |
5153 | ", was looking for %llu\n", ret, | |
5154 | (unsigned long long)bytenr); | |
5155 | btrfs_print_leaf(extent_root, path->nodes[0]); | |
5156 | } | |
005d6427 DS |
5157 | if (ret < 0) { |
5158 | btrfs_abort_transaction(trans, extent_root, ret); | |
5159 | goto out; | |
5160 | } | |
5161 | ||
5d4f98a2 YZ |
5162 | extent_slot = path->slots[0]; |
5163 | leaf = path->nodes[0]; | |
5164 | item_size = btrfs_item_size_nr(leaf, extent_slot); | |
5165 | } | |
5166 | #endif | |
5167 | BUG_ON(item_size < sizeof(*ei)); | |
952fccac | 5168 | ei = btrfs_item_ptr(leaf, extent_slot, |
123abc88 | 5169 | struct btrfs_extent_item); |
5d4f98a2 YZ |
5170 | if (owner_objectid < BTRFS_FIRST_FREE_OBJECTID) { |
5171 | struct btrfs_tree_block_info *bi; | |
5172 | BUG_ON(item_size < sizeof(*ei) + sizeof(*bi)); | |
5173 | bi = (struct btrfs_tree_block_info *)(ei + 1); | |
5174 | WARN_ON(owner_objectid != btrfs_tree_block_level(leaf, bi)); | |
5175 | } | |
56bec294 | 5176 | |
5d4f98a2 | 5177 | refs = btrfs_extent_refs(leaf, ei); |
56bec294 CM |
5178 | BUG_ON(refs < refs_to_drop); |
5179 | refs -= refs_to_drop; | |
5f39d397 | 5180 | |
5d4f98a2 YZ |
5181 | if (refs > 0) { |
5182 | if (extent_op) | |
5183 | __run_delayed_extent_op(extent_op, leaf, ei); | |
5184 | /* | |
5185 | * In the case of inline back ref, reference count will | |
5186 | * be updated by remove_extent_backref | |
952fccac | 5187 | */ |
5d4f98a2 YZ |
5188 | if (iref) { |
5189 | BUG_ON(!found_extent); | |
5190 | } else { | |
5191 | btrfs_set_extent_refs(leaf, ei, refs); | |
5192 | btrfs_mark_buffer_dirty(leaf); | |
5193 | } | |
5194 | if (found_extent) { | |
5195 | ret = remove_extent_backref(trans, extent_root, path, | |
5196 | iref, refs_to_drop, | |
5197 | is_data); | |
005d6427 DS |
5198 | if (ret) { |
5199 | btrfs_abort_transaction(trans, extent_root, ret); | |
5200 | goto out; | |
5201 | } | |
952fccac | 5202 | } |
5d4f98a2 | 5203 | } else { |
5d4f98a2 YZ |
5204 | if (found_extent) { |
5205 | BUG_ON(is_data && refs_to_drop != | |
5206 | extent_data_ref_count(root, path, iref)); | |
5207 | if (iref) { | |
5208 | BUG_ON(path->slots[0] != extent_slot); | |
5209 | } else { | |
5210 | BUG_ON(path->slots[0] != extent_slot + 1); | |
5211 | path->slots[0] = extent_slot; | |
5212 | num_to_del = 2; | |
5213 | } | |
78fae27e | 5214 | } |
b9473439 | 5215 | |
952fccac CM |
5216 | ret = btrfs_del_items(trans, extent_root, path, path->slots[0], |
5217 | num_to_del); | |
005d6427 DS |
5218 | if (ret) { |
5219 | btrfs_abort_transaction(trans, extent_root, ret); | |
5220 | goto out; | |
5221 | } | |
b3b4aa74 | 5222 | btrfs_release_path(path); |
21af804c | 5223 | |
5d4f98a2 | 5224 | if (is_data) { |
459931ec | 5225 | ret = btrfs_del_csums(trans, root, bytenr, num_bytes); |
005d6427 DS |
5226 | if (ret) { |
5227 | btrfs_abort_transaction(trans, extent_root, ret); | |
5228 | goto out; | |
5229 | } | |
459931ec CM |
5230 | } |
5231 | ||
f0486c68 | 5232 | ret = update_block_group(trans, root, bytenr, num_bytes, 0); |
005d6427 DS |
5233 | if (ret) { |
5234 | btrfs_abort_transaction(trans, extent_root, ret); | |
5235 | goto out; | |
5236 | } | |
a28ec197 | 5237 | } |
79787eaa | 5238 | out: |
5caf2a00 | 5239 | btrfs_free_path(path); |
a28ec197 CM |
5240 | return ret; |
5241 | } | |
5242 | ||
1887be66 | 5243 | /* |
f0486c68 | 5244 | * when we free an block, it is possible (and likely) that we free the last |
1887be66 CM |
5245 | * delayed ref for that extent as well. This searches the delayed ref tree for |
5246 | * a given extent, and if there are no other delayed refs to be processed, it | |
5247 | * removes it from the tree. | |
5248 | */ | |
5249 | static noinline int check_ref_cleanup(struct btrfs_trans_handle *trans, | |
5250 | struct btrfs_root *root, u64 bytenr) | |
5251 | { | |
5252 | struct btrfs_delayed_ref_head *head; | |
5253 | struct btrfs_delayed_ref_root *delayed_refs; | |
5254 | struct btrfs_delayed_ref_node *ref; | |
5255 | struct rb_node *node; | |
f0486c68 | 5256 | int ret = 0; |
1887be66 CM |
5257 | |
5258 | delayed_refs = &trans->transaction->delayed_refs; | |
5259 | spin_lock(&delayed_refs->lock); | |
5260 | head = btrfs_find_delayed_ref_head(trans, bytenr); | |
5261 | if (!head) | |
5262 | goto out; | |
5263 | ||
5264 | node = rb_prev(&head->node.rb_node); | |
5265 | if (!node) | |
5266 | goto out; | |
5267 | ||
5268 | ref = rb_entry(node, struct btrfs_delayed_ref_node, rb_node); | |
5269 | ||
5270 | /* there are still entries for this ref, we can't drop it */ | |
5271 | if (ref->bytenr == bytenr) | |
5272 | goto out; | |
5273 | ||
5d4f98a2 YZ |
5274 | if (head->extent_op) { |
5275 | if (!head->must_insert_reserved) | |
5276 | goto out; | |
5277 | kfree(head->extent_op); | |
5278 | head->extent_op = NULL; | |
5279 | } | |
5280 | ||
1887be66 CM |
5281 | /* |
5282 | * waiting for the lock here would deadlock. If someone else has it | |
5283 | * locked they are already in the process of dropping it anyway | |
5284 | */ | |
5285 | if (!mutex_trylock(&head->mutex)) | |
5286 | goto out; | |
5287 | ||
5288 | /* | |
5289 | * at this point we have a head with no other entries. Go | |
5290 | * ahead and process it. | |
5291 | */ | |
5292 | head->node.in_tree = 0; | |
5293 | rb_erase(&head->node.rb_node, &delayed_refs->root); | |
c3e69d58 | 5294 | |
1887be66 CM |
5295 | delayed_refs->num_entries--; |
5296 | ||
5297 | /* | |
5298 | * we don't take a ref on the node because we're removing it from the | |
5299 | * tree, so we just steal the ref the tree was holding. | |
5300 | */ | |
c3e69d58 CM |
5301 | delayed_refs->num_heads--; |
5302 | if (list_empty(&head->cluster)) | |
5303 | delayed_refs->num_heads_ready--; | |
5304 | ||
5305 | list_del_init(&head->cluster); | |
1887be66 CM |
5306 | spin_unlock(&delayed_refs->lock); |
5307 | ||
f0486c68 YZ |
5308 | BUG_ON(head->extent_op); |
5309 | if (head->must_insert_reserved) | |
5310 | ret = 1; | |
5311 | ||
5312 | mutex_unlock(&head->mutex); | |
1887be66 | 5313 | btrfs_put_delayed_ref(&head->node); |
f0486c68 | 5314 | return ret; |
1887be66 CM |
5315 | out: |
5316 | spin_unlock(&delayed_refs->lock); | |
5317 | return 0; | |
5318 | } | |
5319 | ||
f0486c68 YZ |
5320 | void btrfs_free_tree_block(struct btrfs_trans_handle *trans, |
5321 | struct btrfs_root *root, | |
5322 | struct extent_buffer *buf, | |
5581a51a | 5323 | u64 parent, int last_ref) |
f0486c68 | 5324 | { |
f0486c68 YZ |
5325 | struct btrfs_block_group_cache *cache = NULL; |
5326 | int ret; | |
5327 | ||
5328 | if (root->root_key.objectid != BTRFS_TREE_LOG_OBJECTID) { | |
66d7e7f0 AJ |
5329 | ret = btrfs_add_delayed_tree_ref(root->fs_info, trans, |
5330 | buf->start, buf->len, | |
5331 | parent, root->root_key.objectid, | |
5332 | btrfs_header_level(buf), | |
5581a51a | 5333 | BTRFS_DROP_DELAYED_REF, NULL, 0); |
79787eaa | 5334 | BUG_ON(ret); /* -ENOMEM */ |
f0486c68 YZ |
5335 | } |
5336 | ||
5337 | if (!last_ref) | |
5338 | return; | |
5339 | ||
f0486c68 | 5340 | cache = btrfs_lookup_block_group(root->fs_info, buf->start); |
f0486c68 YZ |
5341 | |
5342 | if (btrfs_header_generation(buf) == trans->transid) { | |
5343 | if (root->root_key.objectid != BTRFS_TREE_LOG_OBJECTID) { | |
5344 | ret = check_ref_cleanup(trans, root, buf->start); | |
5345 | if (!ret) | |
37be25bc | 5346 | goto out; |
f0486c68 YZ |
5347 | } |
5348 | ||
5349 | if (btrfs_header_flag(buf, BTRFS_HEADER_FLAG_WRITTEN)) { | |
5350 | pin_down_extent(root, cache, buf->start, buf->len, 1); | |
37be25bc | 5351 | goto out; |
f0486c68 YZ |
5352 | } |
5353 | ||
5354 | WARN_ON(test_bit(EXTENT_BUFFER_DIRTY, &buf->bflags)); | |
5355 | ||
5356 | btrfs_add_free_space(cache, buf->start, buf->len); | |
fb25e914 | 5357 | btrfs_update_reserved_bytes(cache, buf->len, RESERVE_FREE); |
f0486c68 YZ |
5358 | } |
5359 | out: | |
a826d6dc JB |
5360 | /* |
5361 | * Deleting the buffer, clear the corrupt flag since it doesn't matter | |
5362 | * anymore. | |
5363 | */ | |
5364 | clear_bit(EXTENT_BUFFER_CORRUPT, &buf->bflags); | |
f0486c68 YZ |
5365 | btrfs_put_block_group(cache); |
5366 | } | |
5367 | ||
79787eaa | 5368 | /* Can return -ENOMEM */ |
66d7e7f0 AJ |
5369 | int btrfs_free_extent(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
5370 | u64 bytenr, u64 num_bytes, u64 parent, u64 root_objectid, | |
5371 | u64 owner, u64 offset, int for_cow) | |
925baedd CM |
5372 | { |
5373 | int ret; | |
66d7e7f0 | 5374 | struct btrfs_fs_info *fs_info = root->fs_info; |
925baedd | 5375 | |
56bec294 CM |
5376 | /* |
5377 | * tree log blocks never actually go into the extent allocation | |
5378 | * tree, just update pinning info and exit early. | |
56bec294 | 5379 | */ |
5d4f98a2 YZ |
5380 | if (root_objectid == BTRFS_TREE_LOG_OBJECTID) { |
5381 | WARN_ON(owner >= BTRFS_FIRST_FREE_OBJECTID); | |
b9473439 | 5382 | /* unlocks the pinned mutex */ |
11833d66 | 5383 | btrfs_pin_extent(root, bytenr, num_bytes, 1); |
56bec294 | 5384 | ret = 0; |
5d4f98a2 | 5385 | } else if (owner < BTRFS_FIRST_FREE_OBJECTID) { |
66d7e7f0 AJ |
5386 | ret = btrfs_add_delayed_tree_ref(fs_info, trans, bytenr, |
5387 | num_bytes, | |
5d4f98a2 | 5388 | parent, root_objectid, (int)owner, |
66d7e7f0 | 5389 | BTRFS_DROP_DELAYED_REF, NULL, for_cow); |
5d4f98a2 | 5390 | } else { |
66d7e7f0 AJ |
5391 | ret = btrfs_add_delayed_data_ref(fs_info, trans, bytenr, |
5392 | num_bytes, | |
5393 | parent, root_objectid, owner, | |
5394 | offset, BTRFS_DROP_DELAYED_REF, | |
5395 | NULL, for_cow); | |
56bec294 | 5396 | } |
925baedd CM |
5397 | return ret; |
5398 | } | |
5399 | ||
87ee04eb CM |
5400 | static u64 stripe_align(struct btrfs_root *root, u64 val) |
5401 | { | |
5402 | u64 mask = ((u64)root->stripesize - 1); | |
5403 | u64 ret = (val + mask) & ~mask; | |
5404 | return ret; | |
5405 | } | |
5406 | ||
817d52f8 JB |
5407 | /* |
5408 | * when we wait for progress in the block group caching, its because | |
5409 | * our allocation attempt failed at least once. So, we must sleep | |
5410 | * and let some progress happen before we try again. | |
5411 | * | |
5412 | * This function will sleep at least once waiting for new free space to | |
5413 | * show up, and then it will check the block group free space numbers | |
5414 | * for our min num_bytes. Another option is to have it go ahead | |
5415 | * and look in the rbtree for a free extent of a given size, but this | |
5416 | * is a good start. | |
5417 | */ | |
5418 | static noinline int | |
5419 | wait_block_group_cache_progress(struct btrfs_block_group_cache *cache, | |
5420 | u64 num_bytes) | |
5421 | { | |
11833d66 | 5422 | struct btrfs_caching_control *caching_ctl; |
817d52f8 JB |
5423 | DEFINE_WAIT(wait); |
5424 | ||
11833d66 YZ |
5425 | caching_ctl = get_caching_control(cache); |
5426 | if (!caching_ctl) | |
817d52f8 | 5427 | return 0; |
817d52f8 | 5428 | |
11833d66 | 5429 | wait_event(caching_ctl->wait, block_group_cache_done(cache) || |
34d52cb6 | 5430 | (cache->free_space_ctl->free_space >= num_bytes)); |
11833d66 YZ |
5431 | |
5432 | put_caching_control(caching_ctl); | |
5433 | return 0; | |
5434 | } | |
5435 | ||
5436 | static noinline int | |
5437 | wait_block_group_cache_done(struct btrfs_block_group_cache *cache) | |
5438 | { | |
5439 | struct btrfs_caching_control *caching_ctl; | |
5440 | DEFINE_WAIT(wait); | |
5441 | ||
5442 | caching_ctl = get_caching_control(cache); | |
5443 | if (!caching_ctl) | |
5444 | return 0; | |
5445 | ||
5446 | wait_event(caching_ctl->wait, block_group_cache_done(cache)); | |
5447 | ||
5448 | put_caching_control(caching_ctl); | |
817d52f8 JB |
5449 | return 0; |
5450 | } | |
5451 | ||
7738a53a | 5452 | static int __get_block_group_index(u64 flags) |
b742bb82 YZ |
5453 | { |
5454 | int index; | |
7738a53a ID |
5455 | |
5456 | if (flags & BTRFS_BLOCK_GROUP_RAID10) | |
b742bb82 | 5457 | index = 0; |
7738a53a | 5458 | else if (flags & BTRFS_BLOCK_GROUP_RAID1) |
b742bb82 | 5459 | index = 1; |
7738a53a | 5460 | else if (flags & BTRFS_BLOCK_GROUP_DUP) |
b742bb82 | 5461 | index = 2; |
7738a53a | 5462 | else if (flags & BTRFS_BLOCK_GROUP_RAID0) |
b742bb82 YZ |
5463 | index = 3; |
5464 | else | |
5465 | index = 4; | |
7738a53a | 5466 | |
b742bb82 YZ |
5467 | return index; |
5468 | } | |
5469 | ||
7738a53a ID |
5470 | static int get_block_group_index(struct btrfs_block_group_cache *cache) |
5471 | { | |
5472 | return __get_block_group_index(cache->flags); | |
5473 | } | |
5474 | ||
817d52f8 | 5475 | enum btrfs_loop_type { |
285ff5af JB |
5476 | LOOP_CACHING_NOWAIT = 0, |
5477 | LOOP_CACHING_WAIT = 1, | |
5478 | LOOP_ALLOC_CHUNK = 2, | |
5479 | LOOP_NO_EMPTY_SIZE = 3, | |
817d52f8 JB |
5480 | }; |
5481 | ||
fec577fb CM |
5482 | /* |
5483 | * walks the btree of allocated extents and find a hole of a given size. | |
5484 | * The key ins is changed to record the hole: | |
5485 | * ins->objectid == block start | |
62e2749e | 5486 | * ins->flags = BTRFS_EXTENT_ITEM_KEY |
fec577fb CM |
5487 | * ins->offset == number of blocks |
5488 | * Any available blocks before search_start are skipped. | |
5489 | */ | |
d397712b | 5490 | static noinline int find_free_extent(struct btrfs_trans_handle *trans, |
98ed5174 CM |
5491 | struct btrfs_root *orig_root, |
5492 | u64 num_bytes, u64 empty_size, | |
98ed5174 | 5493 | u64 hint_byte, struct btrfs_key *ins, |
e0f54067 | 5494 | u64 data) |
fec577fb | 5495 | { |
80eb234a | 5496 | int ret = 0; |
d397712b | 5497 | struct btrfs_root *root = orig_root->fs_info->extent_root; |
fa9c0d79 | 5498 | struct btrfs_free_cluster *last_ptr = NULL; |
80eb234a | 5499 | struct btrfs_block_group_cache *block_group = NULL; |
274bd4fb | 5500 | struct btrfs_block_group_cache *used_block_group; |
81c9ad23 | 5501 | u64 search_start = 0; |
239b14b3 | 5502 | int empty_cluster = 2 * 1024 * 1024; |
80eb234a | 5503 | struct btrfs_space_info *space_info; |
fa9c0d79 | 5504 | int loop = 0; |
f0486c68 | 5505 | int index = 0; |
fb25e914 JB |
5506 | int alloc_type = (data & BTRFS_BLOCK_GROUP_DATA) ? |
5507 | RESERVE_ALLOC_NO_ACCOUNT : RESERVE_ALLOC; | |
817d52f8 | 5508 | bool found_uncached_bg = false; |
0a24325e | 5509 | bool failed_cluster_refill = false; |
1cdda9b8 | 5510 | bool failed_alloc = false; |
67377734 | 5511 | bool use_cluster = true; |
60d2adbb | 5512 | bool have_caching_bg = false; |
fec577fb | 5513 | |
db94535d | 5514 | WARN_ON(num_bytes < root->sectorsize); |
b1a4d965 | 5515 | btrfs_set_key_type(ins, BTRFS_EXTENT_ITEM_KEY); |
80eb234a JB |
5516 | ins->objectid = 0; |
5517 | ins->offset = 0; | |
b1a4d965 | 5518 | |
3f7de037 JB |
5519 | trace_find_free_extent(orig_root, num_bytes, empty_size, data); |
5520 | ||
2552d17e | 5521 | space_info = __find_space_info(root->fs_info, data); |
1b1d1f66 | 5522 | if (!space_info) { |
e0f54067 | 5523 | printk(KERN_ERR "No space info for %llu\n", data); |
1b1d1f66 JB |
5524 | return -ENOSPC; |
5525 | } | |
2552d17e | 5526 | |
67377734 JB |
5527 | /* |
5528 | * If the space info is for both data and metadata it means we have a | |
5529 | * small filesystem and we can't use the clustering stuff. | |
5530 | */ | |
5531 | if (btrfs_mixed_space_info(space_info)) | |
5532 | use_cluster = false; | |
5533 | ||
67377734 | 5534 | if (data & BTRFS_BLOCK_GROUP_METADATA && use_cluster) { |
fa9c0d79 | 5535 | last_ptr = &root->fs_info->meta_alloc_cluster; |
536ac8ae CM |
5536 | if (!btrfs_test_opt(root, SSD)) |
5537 | empty_cluster = 64 * 1024; | |
239b14b3 CM |
5538 | } |
5539 | ||
67377734 JB |
5540 | if ((data & BTRFS_BLOCK_GROUP_DATA) && use_cluster && |
5541 | btrfs_test_opt(root, SSD)) { | |
fa9c0d79 CM |
5542 | last_ptr = &root->fs_info->data_alloc_cluster; |
5543 | } | |
0f9dd46c | 5544 | |
239b14b3 | 5545 | if (last_ptr) { |
fa9c0d79 CM |
5546 | spin_lock(&last_ptr->lock); |
5547 | if (last_ptr->block_group) | |
5548 | hint_byte = last_ptr->window_start; | |
5549 | spin_unlock(&last_ptr->lock); | |
239b14b3 | 5550 | } |
fa9c0d79 | 5551 | |
a061fc8d | 5552 | search_start = max(search_start, first_logical_byte(root, 0)); |
239b14b3 | 5553 | search_start = max(search_start, hint_byte); |
0b86a832 | 5554 | |
817d52f8 | 5555 | if (!last_ptr) |
fa9c0d79 | 5556 | empty_cluster = 0; |
fa9c0d79 | 5557 | |
2552d17e | 5558 | if (search_start == hint_byte) { |
2552d17e JB |
5559 | block_group = btrfs_lookup_block_group(root->fs_info, |
5560 | search_start); | |
274bd4fb | 5561 | used_block_group = block_group; |
817d52f8 JB |
5562 | /* |
5563 | * we don't want to use the block group if it doesn't match our | |
5564 | * allocation bits, or if its not cached. | |
ccf0e725 JB |
5565 | * |
5566 | * However if we are re-searching with an ideal block group | |
5567 | * picked out then we don't care that the block group is cached. | |
817d52f8 JB |
5568 | */ |
5569 | if (block_group && block_group_bits(block_group, data) && | |
285ff5af | 5570 | block_group->cached != BTRFS_CACHE_NO) { |
2552d17e | 5571 | down_read(&space_info->groups_sem); |
44fb5511 CM |
5572 | if (list_empty(&block_group->list) || |
5573 | block_group->ro) { | |
5574 | /* | |
5575 | * someone is removing this block group, | |
5576 | * we can't jump into the have_block_group | |
5577 | * target because our list pointers are not | |
5578 | * valid | |
5579 | */ | |
5580 | btrfs_put_block_group(block_group); | |
5581 | up_read(&space_info->groups_sem); | |
ccf0e725 | 5582 | } else { |
b742bb82 | 5583 | index = get_block_group_index(block_group); |
44fb5511 | 5584 | goto have_block_group; |
ccf0e725 | 5585 | } |
2552d17e | 5586 | } else if (block_group) { |
fa9c0d79 | 5587 | btrfs_put_block_group(block_group); |
2552d17e | 5588 | } |
42e70e7a | 5589 | } |
2552d17e | 5590 | search: |
60d2adbb | 5591 | have_caching_bg = false; |
80eb234a | 5592 | down_read(&space_info->groups_sem); |
b742bb82 YZ |
5593 | list_for_each_entry(block_group, &space_info->block_groups[index], |
5594 | list) { | |
6226cb0a | 5595 | u64 offset; |
817d52f8 | 5596 | int cached; |
8a1413a2 | 5597 | |
274bd4fb | 5598 | used_block_group = block_group; |
11dfe35a | 5599 | btrfs_get_block_group(block_group); |
2552d17e | 5600 | search_start = block_group->key.objectid; |
42e70e7a | 5601 | |
83a50de9 CM |
5602 | /* |
5603 | * this can happen if we end up cycling through all the | |
5604 | * raid types, but we want to make sure we only allocate | |
5605 | * for the proper type. | |
5606 | */ | |
5607 | if (!block_group_bits(block_group, data)) { | |
5608 | u64 extra = BTRFS_BLOCK_GROUP_DUP | | |
5609 | BTRFS_BLOCK_GROUP_RAID1 | | |
5610 | BTRFS_BLOCK_GROUP_RAID10; | |
5611 | ||
5612 | /* | |
5613 | * if they asked for extra copies and this block group | |
5614 | * doesn't provide them, bail. This does allow us to | |
5615 | * fill raid0 from raid1. | |
5616 | */ | |
5617 | if ((data & extra) && !(block_group->flags & extra)) | |
5618 | goto loop; | |
5619 | } | |
5620 | ||
2552d17e | 5621 | have_block_group: |
291c7d2f JB |
5622 | cached = block_group_cache_done(block_group); |
5623 | if (unlikely(!cached)) { | |
291c7d2f | 5624 | found_uncached_bg = true; |
b8399dee | 5625 | ret = cache_block_group(block_group, trans, |
285ff5af | 5626 | orig_root, 0); |
1d4284bd CM |
5627 | BUG_ON(ret < 0); |
5628 | ret = 0; | |
817d52f8 JB |
5629 | } |
5630 | ||
ea6a478e | 5631 | if (unlikely(block_group->ro)) |
2552d17e | 5632 | goto loop; |
0f9dd46c | 5633 | |
0a24325e | 5634 | /* |
062c05c4 AO |
5635 | * Ok we want to try and use the cluster allocator, so |
5636 | * lets look there | |
0a24325e | 5637 | */ |
062c05c4 | 5638 | if (last_ptr) { |
fa9c0d79 CM |
5639 | /* |
5640 | * the refill lock keeps out other | |
5641 | * people trying to start a new cluster | |
5642 | */ | |
5643 | spin_lock(&last_ptr->refill_lock); | |
274bd4fb AO |
5644 | used_block_group = last_ptr->block_group; |
5645 | if (used_block_group != block_group && | |
5646 | (!used_block_group || | |
5647 | used_block_group->ro || | |
5648 | !block_group_bits(used_block_group, data))) { | |
5649 | used_block_group = block_group; | |
44fb5511 | 5650 | goto refill_cluster; |
274bd4fb AO |
5651 | } |
5652 | ||
5653 | if (used_block_group != block_group) | |
5654 | btrfs_get_block_group(used_block_group); | |
44fb5511 | 5655 | |
274bd4fb AO |
5656 | offset = btrfs_alloc_from_cluster(used_block_group, |
5657 | last_ptr, num_bytes, used_block_group->key.objectid); | |
fa9c0d79 CM |
5658 | if (offset) { |
5659 | /* we have a block, we're done */ | |
5660 | spin_unlock(&last_ptr->refill_lock); | |
3f7de037 JB |
5661 | trace_btrfs_reserve_extent_cluster(root, |
5662 | block_group, search_start, num_bytes); | |
fa9c0d79 CM |
5663 | goto checks; |
5664 | } | |
5665 | ||
274bd4fb AO |
5666 | WARN_ON(last_ptr->block_group != used_block_group); |
5667 | if (used_block_group != block_group) { | |
5668 | btrfs_put_block_group(used_block_group); | |
5669 | used_block_group = block_group; | |
fa9c0d79 | 5670 | } |
44fb5511 | 5671 | refill_cluster: |
274bd4fb | 5672 | BUG_ON(used_block_group != block_group); |
062c05c4 AO |
5673 | /* If we are on LOOP_NO_EMPTY_SIZE, we can't |
5674 | * set up a new clusters, so lets just skip it | |
5675 | * and let the allocator find whatever block | |
5676 | * it can find. If we reach this point, we | |
5677 | * will have tried the cluster allocator | |
5678 | * plenty of times and not have found | |
5679 | * anything, so we are likely way too | |
5680 | * fragmented for the clustering stuff to find | |
a5f6f719 AO |
5681 | * anything. |
5682 | * | |
5683 | * However, if the cluster is taken from the | |
5684 | * current block group, release the cluster | |
5685 | * first, so that we stand a better chance of | |
5686 | * succeeding in the unclustered | |
5687 | * allocation. */ | |
5688 | if (loop >= LOOP_NO_EMPTY_SIZE && | |
5689 | last_ptr->block_group != block_group) { | |
062c05c4 AO |
5690 | spin_unlock(&last_ptr->refill_lock); |
5691 | goto unclustered_alloc; | |
5692 | } | |
5693 | ||
fa9c0d79 CM |
5694 | /* |
5695 | * this cluster didn't work out, free it and | |
5696 | * start over | |
5697 | */ | |
5698 | btrfs_return_cluster_to_free_space(NULL, last_ptr); | |
5699 | ||
a5f6f719 AO |
5700 | if (loop >= LOOP_NO_EMPTY_SIZE) { |
5701 | spin_unlock(&last_ptr->refill_lock); | |
5702 | goto unclustered_alloc; | |
5703 | } | |
5704 | ||
fa9c0d79 | 5705 | /* allocate a cluster in this block group */ |
451d7585 | 5706 | ret = btrfs_find_space_cluster(trans, root, |
fa9c0d79 | 5707 | block_group, last_ptr, |
1b22bad7 | 5708 | search_start, num_bytes, |
fa9c0d79 CM |
5709 | empty_cluster + empty_size); |
5710 | if (ret == 0) { | |
5711 | /* | |
5712 | * now pull our allocation out of this | |
5713 | * cluster | |
5714 | */ | |
5715 | offset = btrfs_alloc_from_cluster(block_group, | |
5716 | last_ptr, num_bytes, | |
5717 | search_start); | |
5718 | if (offset) { | |
5719 | /* we found one, proceed */ | |
5720 | spin_unlock(&last_ptr->refill_lock); | |
3f7de037 JB |
5721 | trace_btrfs_reserve_extent_cluster(root, |
5722 | block_group, search_start, | |
5723 | num_bytes); | |
fa9c0d79 CM |
5724 | goto checks; |
5725 | } | |
0a24325e JB |
5726 | } else if (!cached && loop > LOOP_CACHING_NOWAIT |
5727 | && !failed_cluster_refill) { | |
817d52f8 JB |
5728 | spin_unlock(&last_ptr->refill_lock); |
5729 | ||
0a24325e | 5730 | failed_cluster_refill = true; |
817d52f8 JB |
5731 | wait_block_group_cache_progress(block_group, |
5732 | num_bytes + empty_cluster + empty_size); | |
5733 | goto have_block_group; | |
fa9c0d79 | 5734 | } |
817d52f8 | 5735 | |
fa9c0d79 CM |
5736 | /* |
5737 | * at this point we either didn't find a cluster | |
5738 | * or we weren't able to allocate a block from our | |
5739 | * cluster. Free the cluster we've been trying | |
5740 | * to use, and go to the next block group | |
5741 | */ | |
0a24325e | 5742 | btrfs_return_cluster_to_free_space(NULL, last_ptr); |
fa9c0d79 | 5743 | spin_unlock(&last_ptr->refill_lock); |
0a24325e | 5744 | goto loop; |
fa9c0d79 CM |
5745 | } |
5746 | ||
062c05c4 | 5747 | unclustered_alloc: |
a5f6f719 AO |
5748 | spin_lock(&block_group->free_space_ctl->tree_lock); |
5749 | if (cached && | |
5750 | block_group->free_space_ctl->free_space < | |
5751 | num_bytes + empty_cluster + empty_size) { | |
5752 | spin_unlock(&block_group->free_space_ctl->tree_lock); | |
5753 | goto loop; | |
5754 | } | |
5755 | spin_unlock(&block_group->free_space_ctl->tree_lock); | |
5756 | ||
6226cb0a JB |
5757 | offset = btrfs_find_space_for_alloc(block_group, search_start, |
5758 | num_bytes, empty_size); | |
1cdda9b8 JB |
5759 | /* |
5760 | * If we didn't find a chunk, and we haven't failed on this | |
5761 | * block group before, and this block group is in the middle of | |
5762 | * caching and we are ok with waiting, then go ahead and wait | |
5763 | * for progress to be made, and set failed_alloc to true. | |
5764 | * | |
5765 | * If failed_alloc is true then we've already waited on this | |
5766 | * block group once and should move on to the next block group. | |
5767 | */ | |
5768 | if (!offset && !failed_alloc && !cached && | |
5769 | loop > LOOP_CACHING_NOWAIT) { | |
817d52f8 | 5770 | wait_block_group_cache_progress(block_group, |
1cdda9b8 JB |
5771 | num_bytes + empty_size); |
5772 | failed_alloc = true; | |
817d52f8 | 5773 | goto have_block_group; |
1cdda9b8 | 5774 | } else if (!offset) { |
60d2adbb MX |
5775 | if (!cached) |
5776 | have_caching_bg = true; | |
1cdda9b8 | 5777 | goto loop; |
817d52f8 | 5778 | } |
fa9c0d79 | 5779 | checks: |
6226cb0a | 5780 | search_start = stripe_align(root, offset); |
25179201 | 5781 | |
2552d17e JB |
5782 | /* move on to the next group */ |
5783 | if (search_start + num_bytes > | |
274bd4fb AO |
5784 | used_block_group->key.objectid + used_block_group->key.offset) { |
5785 | btrfs_add_free_space(used_block_group, offset, num_bytes); | |
2552d17e | 5786 | goto loop; |
6226cb0a | 5787 | } |
f5a31e16 | 5788 | |
f0486c68 | 5789 | if (offset < search_start) |
274bd4fb | 5790 | btrfs_add_free_space(used_block_group, offset, |
f0486c68 YZ |
5791 | search_start - offset); |
5792 | BUG_ON(offset > search_start); | |
2552d17e | 5793 | |
274bd4fb | 5794 | ret = btrfs_update_reserved_bytes(used_block_group, num_bytes, |
fb25e914 | 5795 | alloc_type); |
f0486c68 | 5796 | if (ret == -EAGAIN) { |
274bd4fb | 5797 | btrfs_add_free_space(used_block_group, offset, num_bytes); |
2552d17e | 5798 | goto loop; |
0f9dd46c | 5799 | } |
0b86a832 | 5800 | |
f0486c68 | 5801 | /* we are all good, lets return */ |
2552d17e JB |
5802 | ins->objectid = search_start; |
5803 | ins->offset = num_bytes; | |
d2fb3437 | 5804 | |
3f7de037 JB |
5805 | trace_btrfs_reserve_extent(orig_root, block_group, |
5806 | search_start, num_bytes); | |
274bd4fb AO |
5807 | if (used_block_group != block_group) |
5808 | btrfs_put_block_group(used_block_group); | |
d82a6f1d | 5809 | btrfs_put_block_group(block_group); |
2552d17e JB |
5810 | break; |
5811 | loop: | |
0a24325e | 5812 | failed_cluster_refill = false; |
1cdda9b8 | 5813 | failed_alloc = false; |
b742bb82 | 5814 | BUG_ON(index != get_block_group_index(block_group)); |
274bd4fb AO |
5815 | if (used_block_group != block_group) |
5816 | btrfs_put_block_group(used_block_group); | |
fa9c0d79 | 5817 | btrfs_put_block_group(block_group); |
2552d17e JB |
5818 | } |
5819 | up_read(&space_info->groups_sem); | |
5820 | ||
60d2adbb MX |
5821 | if (!ins->objectid && loop >= LOOP_CACHING_WAIT && have_caching_bg) |
5822 | goto search; | |
5823 | ||
b742bb82 YZ |
5824 | if (!ins->objectid && ++index < BTRFS_NR_RAID_TYPES) |
5825 | goto search; | |
5826 | ||
285ff5af | 5827 | /* |
ccf0e725 JB |
5828 | * LOOP_CACHING_NOWAIT, search partially cached block groups, kicking |
5829 | * caching kthreads as we move along | |
817d52f8 JB |
5830 | * LOOP_CACHING_WAIT, search everything, and wait if our bg is caching |
5831 | * LOOP_ALLOC_CHUNK, force a chunk allocation and try again | |
5832 | * LOOP_NO_EMPTY_SIZE, set empty_size and empty_cluster to 0 and try | |
5833 | * again | |
fa9c0d79 | 5834 | */ |
723bda20 | 5835 | if (!ins->objectid && loop < LOOP_NO_EMPTY_SIZE) { |
b742bb82 | 5836 | index = 0; |
723bda20 | 5837 | loop++; |
817d52f8 | 5838 | if (loop == LOOP_ALLOC_CHUNK) { |
698d0082 | 5839 | ret = do_chunk_alloc(trans, root, data, |
ea658bad JB |
5840 | CHUNK_ALLOC_FORCE); |
5841 | /* | |
5842 | * Do not bail out on ENOSPC since we | |
5843 | * can do more things. | |
5844 | */ | |
5845 | if (ret < 0 && ret != -ENOSPC) { | |
5846 | btrfs_abort_transaction(trans, | |
5847 | root, ret); | |
5848 | goto out; | |
723bda20 | 5849 | } |
2552d17e JB |
5850 | } |
5851 | ||
723bda20 JB |
5852 | if (loop == LOOP_NO_EMPTY_SIZE) { |
5853 | empty_size = 0; | |
5854 | empty_cluster = 0; | |
fa9c0d79 | 5855 | } |
723bda20 JB |
5856 | |
5857 | goto search; | |
2552d17e JB |
5858 | } else if (!ins->objectid) { |
5859 | ret = -ENOSPC; | |
d82a6f1d | 5860 | } else if (ins->objectid) { |
80eb234a | 5861 | ret = 0; |
be744175 | 5862 | } |
79787eaa | 5863 | out: |
be744175 | 5864 | |
0f70abe2 | 5865 | return ret; |
fec577fb | 5866 | } |
ec44a35c | 5867 | |
9ed74f2d JB |
5868 | static void dump_space_info(struct btrfs_space_info *info, u64 bytes, |
5869 | int dump_block_groups) | |
0f9dd46c JB |
5870 | { |
5871 | struct btrfs_block_group_cache *cache; | |
b742bb82 | 5872 | int index = 0; |
0f9dd46c | 5873 | |
9ed74f2d | 5874 | spin_lock(&info->lock); |
fb25e914 JB |
5875 | printk(KERN_INFO "space_info %llu has %llu free, is %sfull\n", |
5876 | (unsigned long long)info->flags, | |
d397712b | 5877 | (unsigned long long)(info->total_bytes - info->bytes_used - |
9ed74f2d | 5878 | info->bytes_pinned - info->bytes_reserved - |
8929ecfa | 5879 | info->bytes_readonly), |
d397712b | 5880 | (info->full) ? "" : "not "); |
8929ecfa YZ |
5881 | printk(KERN_INFO "space_info total=%llu, used=%llu, pinned=%llu, " |
5882 | "reserved=%llu, may_use=%llu, readonly=%llu\n", | |
21380931 | 5883 | (unsigned long long)info->total_bytes, |
8929ecfa | 5884 | (unsigned long long)info->bytes_used, |
21380931 | 5885 | (unsigned long long)info->bytes_pinned, |
8929ecfa | 5886 | (unsigned long long)info->bytes_reserved, |
21380931 | 5887 | (unsigned long long)info->bytes_may_use, |
8929ecfa | 5888 | (unsigned long long)info->bytes_readonly); |
9ed74f2d JB |
5889 | spin_unlock(&info->lock); |
5890 | ||
5891 | if (!dump_block_groups) | |
5892 | return; | |
0f9dd46c | 5893 | |
80eb234a | 5894 | down_read(&info->groups_sem); |
b742bb82 YZ |
5895 | again: |
5896 | list_for_each_entry(cache, &info->block_groups[index], list) { | |
0f9dd46c | 5897 | spin_lock(&cache->lock); |
799ffc3c | 5898 | printk(KERN_INFO "block group %llu has %llu bytes, %llu used %llu pinned %llu reserved %s\n", |
d397712b CM |
5899 | (unsigned long long)cache->key.objectid, |
5900 | (unsigned long long)cache->key.offset, | |
5901 | (unsigned long long)btrfs_block_group_used(&cache->item), | |
5902 | (unsigned long long)cache->pinned, | |
799ffc3c LB |
5903 | (unsigned long long)cache->reserved, |
5904 | cache->ro ? "[readonly]" : ""); | |
0f9dd46c JB |
5905 | btrfs_dump_free_space(cache, bytes); |
5906 | spin_unlock(&cache->lock); | |
5907 | } | |
b742bb82 YZ |
5908 | if (++index < BTRFS_NR_RAID_TYPES) |
5909 | goto again; | |
80eb234a | 5910 | up_read(&info->groups_sem); |
0f9dd46c | 5911 | } |
e8569813 | 5912 | |
11833d66 YZ |
5913 | int btrfs_reserve_extent(struct btrfs_trans_handle *trans, |
5914 | struct btrfs_root *root, | |
5915 | u64 num_bytes, u64 min_alloc_size, | |
5916 | u64 empty_size, u64 hint_byte, | |
81c9ad23 | 5917 | struct btrfs_key *ins, u64 data) |
fec577fb | 5918 | { |
9e622d6b | 5919 | bool final_tried = false; |
fec577fb | 5920 | int ret; |
925baedd | 5921 | |
6a63209f | 5922 | data = btrfs_get_alloc_profile(root, data); |
98d20f67 | 5923 | again: |
db94535d CM |
5924 | WARN_ON(num_bytes < root->sectorsize); |
5925 | ret = find_free_extent(trans, root, num_bytes, empty_size, | |
81c9ad23 | 5926 | hint_byte, ins, data); |
3b951516 | 5927 | |
9e622d6b MX |
5928 | if (ret == -ENOSPC) { |
5929 | if (!final_tried) { | |
5930 | num_bytes = num_bytes >> 1; | |
5931 | num_bytes = num_bytes & ~(root->sectorsize - 1); | |
5932 | num_bytes = max(num_bytes, min_alloc_size); | |
9e622d6b MX |
5933 | if (num_bytes == min_alloc_size) |
5934 | final_tried = true; | |
5935 | goto again; | |
5936 | } else if (btrfs_test_opt(root, ENOSPC_DEBUG)) { | |
5937 | struct btrfs_space_info *sinfo; | |
5938 | ||
5939 | sinfo = __find_space_info(root->fs_info, data); | |
5940 | printk(KERN_ERR "btrfs allocation failed flags %llu, " | |
5941 | "wanted %llu\n", (unsigned long long)data, | |
5942 | (unsigned long long)num_bytes); | |
53804280 JM |
5943 | if (sinfo) |
5944 | dump_space_info(sinfo, num_bytes, 1); | |
9e622d6b | 5945 | } |
925baedd | 5946 | } |
0f9dd46c | 5947 | |
1abe9b8a | 5948 | trace_btrfs_reserved_extent_alloc(root, ins->objectid, ins->offset); |
5949 | ||
0f9dd46c | 5950 | return ret; |
e6dcd2dc CM |
5951 | } |
5952 | ||
e688b725 CM |
5953 | static int __btrfs_free_reserved_extent(struct btrfs_root *root, |
5954 | u64 start, u64 len, int pin) | |
65b51a00 | 5955 | { |
0f9dd46c | 5956 | struct btrfs_block_group_cache *cache; |
1f3c79a2 | 5957 | int ret = 0; |
0f9dd46c | 5958 | |
0f9dd46c JB |
5959 | cache = btrfs_lookup_block_group(root->fs_info, start); |
5960 | if (!cache) { | |
d397712b CM |
5961 | printk(KERN_ERR "Unable to find block group for %llu\n", |
5962 | (unsigned long long)start); | |
0f9dd46c JB |
5963 | return -ENOSPC; |
5964 | } | |
1f3c79a2 | 5965 | |
5378e607 LD |
5966 | if (btrfs_test_opt(root, DISCARD)) |
5967 | ret = btrfs_discard_extent(root, start, len, NULL); | |
1f3c79a2 | 5968 | |
e688b725 CM |
5969 | if (pin) |
5970 | pin_down_extent(root, cache, start, len, 1); | |
5971 | else { | |
5972 | btrfs_add_free_space(cache, start, len); | |
5973 | btrfs_update_reserved_bytes(cache, len, RESERVE_FREE); | |
5974 | } | |
fa9c0d79 | 5975 | btrfs_put_block_group(cache); |
817d52f8 | 5976 | |
1abe9b8a | 5977 | trace_btrfs_reserved_extent_free(root, start, len); |
5978 | ||
e6dcd2dc CM |
5979 | return ret; |
5980 | } | |
5981 | ||
e688b725 CM |
5982 | int btrfs_free_reserved_extent(struct btrfs_root *root, |
5983 | u64 start, u64 len) | |
5984 | { | |
5985 | return __btrfs_free_reserved_extent(root, start, len, 0); | |
5986 | } | |
5987 | ||
5988 | int btrfs_free_and_pin_reserved_extent(struct btrfs_root *root, | |
5989 | u64 start, u64 len) | |
5990 | { | |
5991 | return __btrfs_free_reserved_extent(root, start, len, 1); | |
5992 | } | |
5993 | ||
5d4f98a2 YZ |
5994 | static int alloc_reserved_file_extent(struct btrfs_trans_handle *trans, |
5995 | struct btrfs_root *root, | |
5996 | u64 parent, u64 root_objectid, | |
5997 | u64 flags, u64 owner, u64 offset, | |
5998 | struct btrfs_key *ins, int ref_mod) | |
e6dcd2dc CM |
5999 | { |
6000 | int ret; | |
5d4f98a2 | 6001 | struct btrfs_fs_info *fs_info = root->fs_info; |
e6dcd2dc | 6002 | struct btrfs_extent_item *extent_item; |
5d4f98a2 | 6003 | struct btrfs_extent_inline_ref *iref; |
e6dcd2dc | 6004 | struct btrfs_path *path; |
5d4f98a2 YZ |
6005 | struct extent_buffer *leaf; |
6006 | int type; | |
6007 | u32 size; | |
26b8003f | 6008 | |
5d4f98a2 YZ |
6009 | if (parent > 0) |
6010 | type = BTRFS_SHARED_DATA_REF_KEY; | |
6011 | else | |
6012 | type = BTRFS_EXTENT_DATA_REF_KEY; | |
58176a96 | 6013 | |
5d4f98a2 | 6014 | size = sizeof(*extent_item) + btrfs_extent_inline_ref_size(type); |
7bb86316 CM |
6015 | |
6016 | path = btrfs_alloc_path(); | |
db5b493a TI |
6017 | if (!path) |
6018 | return -ENOMEM; | |
47e4bb98 | 6019 | |
b9473439 | 6020 | path->leave_spinning = 1; |
5d4f98a2 YZ |
6021 | ret = btrfs_insert_empty_item(trans, fs_info->extent_root, path, |
6022 | ins, size); | |
79787eaa JM |
6023 | if (ret) { |
6024 | btrfs_free_path(path); | |
6025 | return ret; | |
6026 | } | |
0f9dd46c | 6027 | |
5d4f98a2 YZ |
6028 | leaf = path->nodes[0]; |
6029 | extent_item = btrfs_item_ptr(leaf, path->slots[0], | |
47e4bb98 | 6030 | struct btrfs_extent_item); |
5d4f98a2 YZ |
6031 | btrfs_set_extent_refs(leaf, extent_item, ref_mod); |
6032 | btrfs_set_extent_generation(leaf, extent_item, trans->transid); | |
6033 | btrfs_set_extent_flags(leaf, extent_item, | |
6034 | flags | BTRFS_EXTENT_FLAG_DATA); | |
6035 | ||
6036 | iref = (struct btrfs_extent_inline_ref *)(extent_item + 1); | |
6037 | btrfs_set_extent_inline_ref_type(leaf, iref, type); | |
6038 | if (parent > 0) { | |
6039 | struct btrfs_shared_data_ref *ref; | |
6040 | ref = (struct btrfs_shared_data_ref *)(iref + 1); | |
6041 | btrfs_set_extent_inline_ref_offset(leaf, iref, parent); | |
6042 | btrfs_set_shared_data_ref_count(leaf, ref, ref_mod); | |
6043 | } else { | |
6044 | struct btrfs_extent_data_ref *ref; | |
6045 | ref = (struct btrfs_extent_data_ref *)(&iref->offset); | |
6046 | btrfs_set_extent_data_ref_root(leaf, ref, root_objectid); | |
6047 | btrfs_set_extent_data_ref_objectid(leaf, ref, owner); | |
6048 | btrfs_set_extent_data_ref_offset(leaf, ref, offset); | |
6049 | btrfs_set_extent_data_ref_count(leaf, ref, ref_mod); | |
6050 | } | |
47e4bb98 CM |
6051 | |
6052 | btrfs_mark_buffer_dirty(path->nodes[0]); | |
7bb86316 | 6053 | btrfs_free_path(path); |
f510cfec | 6054 | |
f0486c68 | 6055 | ret = update_block_group(trans, root, ins->objectid, ins->offset, 1); |
79787eaa | 6056 | if (ret) { /* -ENOENT, logic error */ |
d397712b CM |
6057 | printk(KERN_ERR "btrfs update block group failed for %llu " |
6058 | "%llu\n", (unsigned long long)ins->objectid, | |
6059 | (unsigned long long)ins->offset); | |
f5947066 CM |
6060 | BUG(); |
6061 | } | |
e6dcd2dc CM |
6062 | return ret; |
6063 | } | |
6064 | ||
5d4f98a2 YZ |
6065 | static int alloc_reserved_tree_block(struct btrfs_trans_handle *trans, |
6066 | struct btrfs_root *root, | |
6067 | u64 parent, u64 root_objectid, | |
6068 | u64 flags, struct btrfs_disk_key *key, | |
6069 | int level, struct btrfs_key *ins) | |
e6dcd2dc CM |
6070 | { |
6071 | int ret; | |
5d4f98a2 YZ |
6072 | struct btrfs_fs_info *fs_info = root->fs_info; |
6073 | struct btrfs_extent_item *extent_item; | |
6074 | struct btrfs_tree_block_info *block_info; | |
6075 | struct btrfs_extent_inline_ref *iref; | |
6076 | struct btrfs_path *path; | |
6077 | struct extent_buffer *leaf; | |
6078 | u32 size = sizeof(*extent_item) + sizeof(*block_info) + sizeof(*iref); | |
1c2308f8 | 6079 | |
5d4f98a2 | 6080 | path = btrfs_alloc_path(); |
d8926bb3 MF |
6081 | if (!path) |
6082 | return -ENOMEM; | |
56bec294 | 6083 | |
5d4f98a2 YZ |
6084 | path->leave_spinning = 1; |
6085 | ret = btrfs_insert_empty_item(trans, fs_info->extent_root, path, | |
6086 | ins, size); | |
79787eaa JM |
6087 | if (ret) { |
6088 | btrfs_free_path(path); | |
6089 | return ret; | |
6090 | } | |
5d4f98a2 YZ |
6091 | |
6092 | leaf = path->nodes[0]; | |
6093 | extent_item = btrfs_item_ptr(leaf, path->slots[0], | |
6094 | struct btrfs_extent_item); | |
6095 | btrfs_set_extent_refs(leaf, extent_item, 1); | |
6096 | btrfs_set_extent_generation(leaf, extent_item, trans->transid); | |
6097 | btrfs_set_extent_flags(leaf, extent_item, | |
6098 | flags | BTRFS_EXTENT_FLAG_TREE_BLOCK); | |
6099 | block_info = (struct btrfs_tree_block_info *)(extent_item + 1); | |
6100 | ||
6101 | btrfs_set_tree_block_key(leaf, block_info, key); | |
6102 | btrfs_set_tree_block_level(leaf, block_info, level); | |
6103 | ||
6104 | iref = (struct btrfs_extent_inline_ref *)(block_info + 1); | |
6105 | if (parent > 0) { | |
6106 | BUG_ON(!(flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)); | |
6107 | btrfs_set_extent_inline_ref_type(leaf, iref, | |
6108 | BTRFS_SHARED_BLOCK_REF_KEY); | |
6109 | btrfs_set_extent_inline_ref_offset(leaf, iref, parent); | |
6110 | } else { | |
6111 | btrfs_set_extent_inline_ref_type(leaf, iref, | |
6112 | BTRFS_TREE_BLOCK_REF_KEY); | |
6113 | btrfs_set_extent_inline_ref_offset(leaf, iref, root_objectid); | |
6114 | } | |
6115 | ||
6116 | btrfs_mark_buffer_dirty(leaf); | |
6117 | btrfs_free_path(path); | |
6118 | ||
f0486c68 | 6119 | ret = update_block_group(trans, root, ins->objectid, ins->offset, 1); |
79787eaa | 6120 | if (ret) { /* -ENOENT, logic error */ |
5d4f98a2 YZ |
6121 | printk(KERN_ERR "btrfs update block group failed for %llu " |
6122 | "%llu\n", (unsigned long long)ins->objectid, | |
6123 | (unsigned long long)ins->offset); | |
6124 | BUG(); | |
6125 | } | |
6126 | return ret; | |
6127 | } | |
6128 | ||
6129 | int btrfs_alloc_reserved_file_extent(struct btrfs_trans_handle *trans, | |
6130 | struct btrfs_root *root, | |
6131 | u64 root_objectid, u64 owner, | |
6132 | u64 offset, struct btrfs_key *ins) | |
6133 | { | |
6134 | int ret; | |
6135 | ||
6136 | BUG_ON(root_objectid == BTRFS_TREE_LOG_OBJECTID); | |
6137 | ||
66d7e7f0 AJ |
6138 | ret = btrfs_add_delayed_data_ref(root->fs_info, trans, ins->objectid, |
6139 | ins->offset, 0, | |
6140 | root_objectid, owner, offset, | |
6141 | BTRFS_ADD_DELAYED_EXTENT, NULL, 0); | |
e6dcd2dc CM |
6142 | return ret; |
6143 | } | |
e02119d5 CM |
6144 | |
6145 | /* | |
6146 | * this is used by the tree logging recovery code. It records that | |
6147 | * an extent has been allocated and makes sure to clear the free | |
6148 | * space cache bits as well | |
6149 | */ | |
5d4f98a2 YZ |
6150 | int btrfs_alloc_logged_file_extent(struct btrfs_trans_handle *trans, |
6151 | struct btrfs_root *root, | |
6152 | u64 root_objectid, u64 owner, u64 offset, | |
6153 | struct btrfs_key *ins) | |
e02119d5 CM |
6154 | { |
6155 | int ret; | |
6156 | struct btrfs_block_group_cache *block_group; | |
11833d66 YZ |
6157 | struct btrfs_caching_control *caching_ctl; |
6158 | u64 start = ins->objectid; | |
6159 | u64 num_bytes = ins->offset; | |
e02119d5 | 6160 | |
e02119d5 | 6161 | block_group = btrfs_lookup_block_group(root->fs_info, ins->objectid); |
b8399dee | 6162 | cache_block_group(block_group, trans, NULL, 0); |
11833d66 | 6163 | caching_ctl = get_caching_control(block_group); |
e02119d5 | 6164 | |
11833d66 YZ |
6165 | if (!caching_ctl) { |
6166 | BUG_ON(!block_group_cache_done(block_group)); | |
6167 | ret = btrfs_remove_free_space(block_group, start, num_bytes); | |
79787eaa | 6168 | BUG_ON(ret); /* -ENOMEM */ |
11833d66 YZ |
6169 | } else { |
6170 | mutex_lock(&caching_ctl->mutex); | |
6171 | ||
6172 | if (start >= caching_ctl->progress) { | |
6173 | ret = add_excluded_extent(root, start, num_bytes); | |
79787eaa | 6174 | BUG_ON(ret); /* -ENOMEM */ |
11833d66 YZ |
6175 | } else if (start + num_bytes <= caching_ctl->progress) { |
6176 | ret = btrfs_remove_free_space(block_group, | |
6177 | start, num_bytes); | |
79787eaa | 6178 | BUG_ON(ret); /* -ENOMEM */ |
11833d66 YZ |
6179 | } else { |
6180 | num_bytes = caching_ctl->progress - start; | |
6181 | ret = btrfs_remove_free_space(block_group, | |
6182 | start, num_bytes); | |
79787eaa | 6183 | BUG_ON(ret); /* -ENOMEM */ |
11833d66 YZ |
6184 | |
6185 | start = caching_ctl->progress; | |
6186 | num_bytes = ins->objectid + ins->offset - | |
6187 | caching_ctl->progress; | |
6188 | ret = add_excluded_extent(root, start, num_bytes); | |
79787eaa | 6189 | BUG_ON(ret); /* -ENOMEM */ |
11833d66 YZ |
6190 | } |
6191 | ||
6192 | mutex_unlock(&caching_ctl->mutex); | |
6193 | put_caching_control(caching_ctl); | |
6194 | } | |
6195 | ||
fb25e914 JB |
6196 | ret = btrfs_update_reserved_bytes(block_group, ins->offset, |
6197 | RESERVE_ALLOC_NO_ACCOUNT); | |
79787eaa | 6198 | BUG_ON(ret); /* logic error */ |
fa9c0d79 | 6199 | btrfs_put_block_group(block_group); |
5d4f98a2 YZ |
6200 | ret = alloc_reserved_file_extent(trans, root, 0, root_objectid, |
6201 | 0, owner, offset, ins, 1); | |
e02119d5 CM |
6202 | return ret; |
6203 | } | |
6204 | ||
65b51a00 CM |
6205 | struct extent_buffer *btrfs_init_new_buffer(struct btrfs_trans_handle *trans, |
6206 | struct btrfs_root *root, | |
4008c04a CM |
6207 | u64 bytenr, u32 blocksize, |
6208 | int level) | |
65b51a00 CM |
6209 | { |
6210 | struct extent_buffer *buf; | |
6211 | ||
6212 | buf = btrfs_find_create_tree_block(root, bytenr, blocksize); | |
6213 | if (!buf) | |
6214 | return ERR_PTR(-ENOMEM); | |
6215 | btrfs_set_header_generation(buf, trans->transid); | |
85d4e461 | 6216 | btrfs_set_buffer_lockdep_class(root->root_key.objectid, buf, level); |
65b51a00 CM |
6217 | btrfs_tree_lock(buf); |
6218 | clean_tree_block(trans, root, buf); | |
3083ee2e | 6219 | clear_bit(EXTENT_BUFFER_STALE, &buf->bflags); |
b4ce94de CM |
6220 | |
6221 | btrfs_set_lock_blocking(buf); | |
65b51a00 | 6222 | btrfs_set_buffer_uptodate(buf); |
b4ce94de | 6223 | |
d0c803c4 | 6224 | if (root->root_key.objectid == BTRFS_TREE_LOG_OBJECTID) { |
8cef4e16 YZ |
6225 | /* |
6226 | * we allow two log transactions at a time, use different | |
6227 | * EXENT bit to differentiate dirty pages. | |
6228 | */ | |
6229 | if (root->log_transid % 2 == 0) | |
6230 | set_extent_dirty(&root->dirty_log_pages, buf->start, | |
6231 | buf->start + buf->len - 1, GFP_NOFS); | |
6232 | else | |
6233 | set_extent_new(&root->dirty_log_pages, buf->start, | |
6234 | buf->start + buf->len - 1, GFP_NOFS); | |
d0c803c4 CM |
6235 | } else { |
6236 | set_extent_dirty(&trans->transaction->dirty_pages, buf->start, | |
65b51a00 | 6237 | buf->start + buf->len - 1, GFP_NOFS); |
d0c803c4 | 6238 | } |
65b51a00 | 6239 | trans->blocks_used++; |
b4ce94de | 6240 | /* this returns a buffer locked for blocking */ |
65b51a00 CM |
6241 | return buf; |
6242 | } | |
6243 | ||
f0486c68 YZ |
6244 | static struct btrfs_block_rsv * |
6245 | use_block_rsv(struct btrfs_trans_handle *trans, | |
6246 | struct btrfs_root *root, u32 blocksize) | |
6247 | { | |
6248 | struct btrfs_block_rsv *block_rsv; | |
68a82277 | 6249 | struct btrfs_block_rsv *global_rsv = &root->fs_info->global_block_rsv; |
f0486c68 YZ |
6250 | int ret; |
6251 | ||
6252 | block_rsv = get_block_rsv(trans, root); | |
6253 | ||
6254 | if (block_rsv->size == 0) { | |
36ba022a | 6255 | ret = reserve_metadata_bytes(root, block_rsv, blocksize, 0); |
68a82277 JB |
6256 | /* |
6257 | * If we couldn't reserve metadata bytes try and use some from | |
6258 | * the global reserve. | |
6259 | */ | |
6260 | if (ret && block_rsv != global_rsv) { | |
6261 | ret = block_rsv_use_bytes(global_rsv, blocksize); | |
6262 | if (!ret) | |
6263 | return global_rsv; | |
f0486c68 | 6264 | return ERR_PTR(ret); |
68a82277 | 6265 | } else if (ret) { |
f0486c68 | 6266 | return ERR_PTR(ret); |
68a82277 | 6267 | } |
f0486c68 YZ |
6268 | return block_rsv; |
6269 | } | |
6270 | ||
6271 | ret = block_rsv_use_bytes(block_rsv, blocksize); | |
6272 | if (!ret) | |
6273 | return block_rsv; | |
ca7e70f5 | 6274 | if (ret && !block_rsv->failfast) { |
dff51cd1 DS |
6275 | static DEFINE_RATELIMIT_STATE(_rs, |
6276 | DEFAULT_RATELIMIT_INTERVAL, | |
6277 | /*DEFAULT_RATELIMIT_BURST*/ 2); | |
6278 | if (__ratelimit(&_rs)) { | |
6279 | printk(KERN_DEBUG "btrfs: block rsv returned %d\n", ret); | |
6280 | WARN_ON(1); | |
6281 | } | |
36ba022a | 6282 | ret = reserve_metadata_bytes(root, block_rsv, blocksize, 0); |
68a82277 | 6283 | if (!ret) { |
68a82277 JB |
6284 | return block_rsv; |
6285 | } else if (ret && block_rsv != global_rsv) { | |
6286 | ret = block_rsv_use_bytes(global_rsv, blocksize); | |
6287 | if (!ret) | |
6288 | return global_rsv; | |
6289 | } | |
6290 | } | |
f0486c68 | 6291 | |
f0486c68 YZ |
6292 | return ERR_PTR(-ENOSPC); |
6293 | } | |
6294 | ||
8c2a3ca2 JB |
6295 | static void unuse_block_rsv(struct btrfs_fs_info *fs_info, |
6296 | struct btrfs_block_rsv *block_rsv, u32 blocksize) | |
f0486c68 YZ |
6297 | { |
6298 | block_rsv_add_bytes(block_rsv, blocksize, 0); | |
8c2a3ca2 | 6299 | block_rsv_release_bytes(fs_info, block_rsv, NULL, 0); |
f0486c68 YZ |
6300 | } |
6301 | ||
fec577fb | 6302 | /* |
f0486c68 YZ |
6303 | * finds a free extent and does all the dirty work required for allocation |
6304 | * returns the key for the extent through ins, and a tree buffer for | |
6305 | * the first block of the extent through buf. | |
6306 | * | |
fec577fb CM |
6307 | * returns the tree buffer or NULL. |
6308 | */ | |
5f39d397 | 6309 | struct extent_buffer *btrfs_alloc_free_block(struct btrfs_trans_handle *trans, |
5d4f98a2 YZ |
6310 | struct btrfs_root *root, u32 blocksize, |
6311 | u64 parent, u64 root_objectid, | |
6312 | struct btrfs_disk_key *key, int level, | |
5581a51a | 6313 | u64 hint, u64 empty_size) |
fec577fb | 6314 | { |
e2fa7227 | 6315 | struct btrfs_key ins; |
f0486c68 | 6316 | struct btrfs_block_rsv *block_rsv; |
5f39d397 | 6317 | struct extent_buffer *buf; |
f0486c68 YZ |
6318 | u64 flags = 0; |
6319 | int ret; | |
6320 | ||
fec577fb | 6321 | |
f0486c68 YZ |
6322 | block_rsv = use_block_rsv(trans, root, blocksize); |
6323 | if (IS_ERR(block_rsv)) | |
6324 | return ERR_CAST(block_rsv); | |
6325 | ||
6326 | ret = btrfs_reserve_extent(trans, root, blocksize, blocksize, | |
81c9ad23 | 6327 | empty_size, hint, &ins, 0); |
fec577fb | 6328 | if (ret) { |
8c2a3ca2 | 6329 | unuse_block_rsv(root->fs_info, block_rsv, blocksize); |
54aa1f4d | 6330 | return ERR_PTR(ret); |
fec577fb | 6331 | } |
55c69072 | 6332 | |
4008c04a CM |
6333 | buf = btrfs_init_new_buffer(trans, root, ins.objectid, |
6334 | blocksize, level); | |
79787eaa | 6335 | BUG_ON(IS_ERR(buf)); /* -ENOMEM */ |
f0486c68 YZ |
6336 | |
6337 | if (root_objectid == BTRFS_TREE_RELOC_OBJECTID) { | |
6338 | if (parent == 0) | |
6339 | parent = ins.objectid; | |
6340 | flags |= BTRFS_BLOCK_FLAG_FULL_BACKREF; | |
6341 | } else | |
6342 | BUG_ON(parent > 0); | |
6343 | ||
6344 | if (root_objectid != BTRFS_TREE_LOG_OBJECTID) { | |
6345 | struct btrfs_delayed_extent_op *extent_op; | |
6346 | extent_op = kmalloc(sizeof(*extent_op), GFP_NOFS); | |
79787eaa | 6347 | BUG_ON(!extent_op); /* -ENOMEM */ |
f0486c68 YZ |
6348 | if (key) |
6349 | memcpy(&extent_op->key, key, sizeof(extent_op->key)); | |
6350 | else | |
6351 | memset(&extent_op->key, 0, sizeof(extent_op->key)); | |
6352 | extent_op->flags_to_set = flags; | |
6353 | extent_op->update_key = 1; | |
6354 | extent_op->update_flags = 1; | |
6355 | extent_op->is_data = 0; | |
6356 | ||
66d7e7f0 AJ |
6357 | ret = btrfs_add_delayed_tree_ref(root->fs_info, trans, |
6358 | ins.objectid, | |
f0486c68 YZ |
6359 | ins.offset, parent, root_objectid, |
6360 | level, BTRFS_ADD_DELAYED_EXTENT, | |
5581a51a | 6361 | extent_op, 0); |
79787eaa | 6362 | BUG_ON(ret); /* -ENOMEM */ |
f0486c68 | 6363 | } |
fec577fb CM |
6364 | return buf; |
6365 | } | |
a28ec197 | 6366 | |
2c47e605 YZ |
6367 | struct walk_control { |
6368 | u64 refs[BTRFS_MAX_LEVEL]; | |
6369 | u64 flags[BTRFS_MAX_LEVEL]; | |
6370 | struct btrfs_key update_progress; | |
6371 | int stage; | |
6372 | int level; | |
6373 | int shared_level; | |
6374 | int update_ref; | |
6375 | int keep_locks; | |
1c4850e2 YZ |
6376 | int reada_slot; |
6377 | int reada_count; | |
66d7e7f0 | 6378 | int for_reloc; |
2c47e605 YZ |
6379 | }; |
6380 | ||
6381 | #define DROP_REFERENCE 1 | |
6382 | #define UPDATE_BACKREF 2 | |
6383 | ||
1c4850e2 YZ |
6384 | static noinline void reada_walk_down(struct btrfs_trans_handle *trans, |
6385 | struct btrfs_root *root, | |
6386 | struct walk_control *wc, | |
6387 | struct btrfs_path *path) | |
6407bf6d | 6388 | { |
1c4850e2 YZ |
6389 | u64 bytenr; |
6390 | u64 generation; | |
6391 | u64 refs; | |
94fcca9f | 6392 | u64 flags; |
5d4f98a2 | 6393 | u32 nritems; |
1c4850e2 YZ |
6394 | u32 blocksize; |
6395 | struct btrfs_key key; | |
6396 | struct extent_buffer *eb; | |
6407bf6d | 6397 | int ret; |
1c4850e2 YZ |
6398 | int slot; |
6399 | int nread = 0; | |
6407bf6d | 6400 | |
1c4850e2 YZ |
6401 | if (path->slots[wc->level] < wc->reada_slot) { |
6402 | wc->reada_count = wc->reada_count * 2 / 3; | |
6403 | wc->reada_count = max(wc->reada_count, 2); | |
6404 | } else { | |
6405 | wc->reada_count = wc->reada_count * 3 / 2; | |
6406 | wc->reada_count = min_t(int, wc->reada_count, | |
6407 | BTRFS_NODEPTRS_PER_BLOCK(root)); | |
6408 | } | |
7bb86316 | 6409 | |
1c4850e2 YZ |
6410 | eb = path->nodes[wc->level]; |
6411 | nritems = btrfs_header_nritems(eb); | |
6412 | blocksize = btrfs_level_size(root, wc->level - 1); | |
bd56b302 | 6413 | |
1c4850e2 YZ |
6414 | for (slot = path->slots[wc->level]; slot < nritems; slot++) { |
6415 | if (nread >= wc->reada_count) | |
6416 | break; | |
bd56b302 | 6417 | |
2dd3e67b | 6418 | cond_resched(); |
1c4850e2 YZ |
6419 | bytenr = btrfs_node_blockptr(eb, slot); |
6420 | generation = btrfs_node_ptr_generation(eb, slot); | |
2dd3e67b | 6421 | |
1c4850e2 YZ |
6422 | if (slot == path->slots[wc->level]) |
6423 | goto reada; | |
5d4f98a2 | 6424 | |
1c4850e2 YZ |
6425 | if (wc->stage == UPDATE_BACKREF && |
6426 | generation <= root->root_key.offset) | |
bd56b302 CM |
6427 | continue; |
6428 | ||
94fcca9f YZ |
6429 | /* We don't lock the tree block, it's OK to be racy here */ |
6430 | ret = btrfs_lookup_extent_info(trans, root, bytenr, blocksize, | |
6431 | &refs, &flags); | |
79787eaa JM |
6432 | /* We don't care about errors in readahead. */ |
6433 | if (ret < 0) | |
6434 | continue; | |
94fcca9f YZ |
6435 | BUG_ON(refs == 0); |
6436 | ||
1c4850e2 | 6437 | if (wc->stage == DROP_REFERENCE) { |
1c4850e2 YZ |
6438 | if (refs == 1) |
6439 | goto reada; | |
bd56b302 | 6440 | |
94fcca9f YZ |
6441 | if (wc->level == 1 && |
6442 | (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) | |
6443 | continue; | |
1c4850e2 YZ |
6444 | if (!wc->update_ref || |
6445 | generation <= root->root_key.offset) | |
6446 | continue; | |
6447 | btrfs_node_key_to_cpu(eb, &key, slot); | |
6448 | ret = btrfs_comp_cpu_keys(&key, | |
6449 | &wc->update_progress); | |
6450 | if (ret < 0) | |
6451 | continue; | |
94fcca9f YZ |
6452 | } else { |
6453 | if (wc->level == 1 && | |
6454 | (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) | |
6455 | continue; | |
6407bf6d | 6456 | } |
1c4850e2 YZ |
6457 | reada: |
6458 | ret = readahead_tree_block(root, bytenr, blocksize, | |
6459 | generation); | |
6460 | if (ret) | |
bd56b302 | 6461 | break; |
1c4850e2 | 6462 | nread++; |
20524f02 | 6463 | } |
1c4850e2 | 6464 | wc->reada_slot = slot; |
20524f02 | 6465 | } |
2c47e605 | 6466 | |
f82d02d9 | 6467 | /* |
2c47e605 YZ |
6468 | * hepler to process tree block while walking down the tree. |
6469 | * | |
2c47e605 YZ |
6470 | * when wc->stage == UPDATE_BACKREF, this function updates |
6471 | * back refs for pointers in the block. | |
6472 | * | |
6473 | * NOTE: return value 1 means we should stop walking down. | |
f82d02d9 | 6474 | */ |
2c47e605 | 6475 | static noinline int walk_down_proc(struct btrfs_trans_handle *trans, |
5d4f98a2 | 6476 | struct btrfs_root *root, |
2c47e605 | 6477 | struct btrfs_path *path, |
94fcca9f | 6478 | struct walk_control *wc, int lookup_info) |
f82d02d9 | 6479 | { |
2c47e605 YZ |
6480 | int level = wc->level; |
6481 | struct extent_buffer *eb = path->nodes[level]; | |
2c47e605 | 6482 | u64 flag = BTRFS_BLOCK_FLAG_FULL_BACKREF; |
f82d02d9 YZ |
6483 | int ret; |
6484 | ||
2c47e605 YZ |
6485 | if (wc->stage == UPDATE_BACKREF && |
6486 | btrfs_header_owner(eb) != root->root_key.objectid) | |
6487 | return 1; | |
f82d02d9 | 6488 | |
2c47e605 YZ |
6489 | /* |
6490 | * when reference count of tree block is 1, it won't increase | |
6491 | * again. once full backref flag is set, we never clear it. | |
6492 | */ | |
94fcca9f YZ |
6493 | if (lookup_info && |
6494 | ((wc->stage == DROP_REFERENCE && wc->refs[level] != 1) || | |
6495 | (wc->stage == UPDATE_BACKREF && !(wc->flags[level] & flag)))) { | |
2c47e605 YZ |
6496 | BUG_ON(!path->locks[level]); |
6497 | ret = btrfs_lookup_extent_info(trans, root, | |
6498 | eb->start, eb->len, | |
6499 | &wc->refs[level], | |
6500 | &wc->flags[level]); | |
79787eaa JM |
6501 | BUG_ON(ret == -ENOMEM); |
6502 | if (ret) | |
6503 | return ret; | |
2c47e605 YZ |
6504 | BUG_ON(wc->refs[level] == 0); |
6505 | } | |
5d4f98a2 | 6506 | |
2c47e605 YZ |
6507 | if (wc->stage == DROP_REFERENCE) { |
6508 | if (wc->refs[level] > 1) | |
6509 | return 1; | |
f82d02d9 | 6510 | |
2c47e605 | 6511 | if (path->locks[level] && !wc->keep_locks) { |
bd681513 | 6512 | btrfs_tree_unlock_rw(eb, path->locks[level]); |
2c47e605 YZ |
6513 | path->locks[level] = 0; |
6514 | } | |
6515 | return 0; | |
6516 | } | |
f82d02d9 | 6517 | |
2c47e605 YZ |
6518 | /* wc->stage == UPDATE_BACKREF */ |
6519 | if (!(wc->flags[level] & flag)) { | |
6520 | BUG_ON(!path->locks[level]); | |
66d7e7f0 | 6521 | ret = btrfs_inc_ref(trans, root, eb, 1, wc->for_reloc); |
79787eaa | 6522 | BUG_ON(ret); /* -ENOMEM */ |
66d7e7f0 | 6523 | ret = btrfs_dec_ref(trans, root, eb, 0, wc->for_reloc); |
79787eaa | 6524 | BUG_ON(ret); /* -ENOMEM */ |
2c47e605 YZ |
6525 | ret = btrfs_set_disk_extent_flags(trans, root, eb->start, |
6526 | eb->len, flag, 0); | |
79787eaa | 6527 | BUG_ON(ret); /* -ENOMEM */ |
2c47e605 YZ |
6528 | wc->flags[level] |= flag; |
6529 | } | |
6530 | ||
6531 | /* | |
6532 | * the block is shared by multiple trees, so it's not good to | |
6533 | * keep the tree lock | |
6534 | */ | |
6535 | if (path->locks[level] && level > 0) { | |
bd681513 | 6536 | btrfs_tree_unlock_rw(eb, path->locks[level]); |
2c47e605 YZ |
6537 | path->locks[level] = 0; |
6538 | } | |
6539 | return 0; | |
6540 | } | |
6541 | ||
1c4850e2 YZ |
6542 | /* |
6543 | * hepler to process tree block pointer. | |
6544 | * | |
6545 | * when wc->stage == DROP_REFERENCE, this function checks | |
6546 | * reference count of the block pointed to. if the block | |
6547 | * is shared and we need update back refs for the subtree | |
6548 | * rooted at the block, this function changes wc->stage to | |
6549 | * UPDATE_BACKREF. if the block is shared and there is no | |
6550 | * need to update back, this function drops the reference | |
6551 | * to the block. | |
6552 | * | |
6553 | * NOTE: return value 1 means we should stop walking down. | |
6554 | */ | |
6555 | static noinline int do_walk_down(struct btrfs_trans_handle *trans, | |
6556 | struct btrfs_root *root, | |
6557 | struct btrfs_path *path, | |
94fcca9f | 6558 | struct walk_control *wc, int *lookup_info) |
1c4850e2 YZ |
6559 | { |
6560 | u64 bytenr; | |
6561 | u64 generation; | |
6562 | u64 parent; | |
6563 | u32 blocksize; | |
6564 | struct btrfs_key key; | |
6565 | struct extent_buffer *next; | |
6566 | int level = wc->level; | |
6567 | int reada = 0; | |
6568 | int ret = 0; | |
6569 | ||
6570 | generation = btrfs_node_ptr_generation(path->nodes[level], | |
6571 | path->slots[level]); | |
6572 | /* | |
6573 | * if the lower level block was created before the snapshot | |
6574 | * was created, we know there is no need to update back refs | |
6575 | * for the subtree | |
6576 | */ | |
6577 | if (wc->stage == UPDATE_BACKREF && | |
94fcca9f YZ |
6578 | generation <= root->root_key.offset) { |
6579 | *lookup_info = 1; | |
1c4850e2 | 6580 | return 1; |
94fcca9f | 6581 | } |
1c4850e2 YZ |
6582 | |
6583 | bytenr = btrfs_node_blockptr(path->nodes[level], path->slots[level]); | |
6584 | blocksize = btrfs_level_size(root, level - 1); | |
6585 | ||
6586 | next = btrfs_find_tree_block(root, bytenr, blocksize); | |
6587 | if (!next) { | |
6588 | next = btrfs_find_create_tree_block(root, bytenr, blocksize); | |
90d2c51d MX |
6589 | if (!next) |
6590 | return -ENOMEM; | |
1c4850e2 YZ |
6591 | reada = 1; |
6592 | } | |
6593 | btrfs_tree_lock(next); | |
6594 | btrfs_set_lock_blocking(next); | |
6595 | ||
94fcca9f YZ |
6596 | ret = btrfs_lookup_extent_info(trans, root, bytenr, blocksize, |
6597 | &wc->refs[level - 1], | |
6598 | &wc->flags[level - 1]); | |
79787eaa JM |
6599 | if (ret < 0) { |
6600 | btrfs_tree_unlock(next); | |
6601 | return ret; | |
6602 | } | |
6603 | ||
94fcca9f YZ |
6604 | BUG_ON(wc->refs[level - 1] == 0); |
6605 | *lookup_info = 0; | |
1c4850e2 | 6606 | |
94fcca9f | 6607 | if (wc->stage == DROP_REFERENCE) { |
1c4850e2 | 6608 | if (wc->refs[level - 1] > 1) { |
94fcca9f YZ |
6609 | if (level == 1 && |
6610 | (wc->flags[0] & BTRFS_BLOCK_FLAG_FULL_BACKREF)) | |
6611 | goto skip; | |
6612 | ||
1c4850e2 YZ |
6613 | if (!wc->update_ref || |
6614 | generation <= root->root_key.offset) | |
6615 | goto skip; | |
6616 | ||
6617 | btrfs_node_key_to_cpu(path->nodes[level], &key, | |
6618 | path->slots[level]); | |
6619 | ret = btrfs_comp_cpu_keys(&key, &wc->update_progress); | |
6620 | if (ret < 0) | |
6621 | goto skip; | |
6622 | ||
6623 | wc->stage = UPDATE_BACKREF; | |
6624 | wc->shared_level = level - 1; | |
6625 | } | |
94fcca9f YZ |
6626 | } else { |
6627 | if (level == 1 && | |
6628 | (wc->flags[0] & BTRFS_BLOCK_FLAG_FULL_BACKREF)) | |
6629 | goto skip; | |
1c4850e2 YZ |
6630 | } |
6631 | ||
b9fab919 | 6632 | if (!btrfs_buffer_uptodate(next, generation, 0)) { |
1c4850e2 YZ |
6633 | btrfs_tree_unlock(next); |
6634 | free_extent_buffer(next); | |
6635 | next = NULL; | |
94fcca9f | 6636 | *lookup_info = 1; |
1c4850e2 YZ |
6637 | } |
6638 | ||
6639 | if (!next) { | |
6640 | if (reada && level == 1) | |
6641 | reada_walk_down(trans, root, wc, path); | |
6642 | next = read_tree_block(root, bytenr, blocksize, generation); | |
97d9a8a4 TI |
6643 | if (!next) |
6644 | return -EIO; | |
1c4850e2 YZ |
6645 | btrfs_tree_lock(next); |
6646 | btrfs_set_lock_blocking(next); | |
6647 | } | |
6648 | ||
6649 | level--; | |
6650 | BUG_ON(level != btrfs_header_level(next)); | |
6651 | path->nodes[level] = next; | |
6652 | path->slots[level] = 0; | |
bd681513 | 6653 | path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING; |
1c4850e2 YZ |
6654 | wc->level = level; |
6655 | if (wc->level == 1) | |
6656 | wc->reada_slot = 0; | |
6657 | return 0; | |
6658 | skip: | |
6659 | wc->refs[level - 1] = 0; | |
6660 | wc->flags[level - 1] = 0; | |
94fcca9f YZ |
6661 | if (wc->stage == DROP_REFERENCE) { |
6662 | if (wc->flags[level] & BTRFS_BLOCK_FLAG_FULL_BACKREF) { | |
6663 | parent = path->nodes[level]->start; | |
6664 | } else { | |
6665 | BUG_ON(root->root_key.objectid != | |
6666 | btrfs_header_owner(path->nodes[level])); | |
6667 | parent = 0; | |
6668 | } | |
1c4850e2 | 6669 | |
94fcca9f | 6670 | ret = btrfs_free_extent(trans, root, bytenr, blocksize, parent, |
66d7e7f0 | 6671 | root->root_key.objectid, level - 1, 0, 0); |
79787eaa | 6672 | BUG_ON(ret); /* -ENOMEM */ |
1c4850e2 | 6673 | } |
1c4850e2 YZ |
6674 | btrfs_tree_unlock(next); |
6675 | free_extent_buffer(next); | |
94fcca9f | 6676 | *lookup_info = 1; |
1c4850e2 YZ |
6677 | return 1; |
6678 | } | |
6679 | ||
2c47e605 YZ |
6680 | /* |
6681 | * hepler to process tree block while walking up the tree. | |
6682 | * | |
6683 | * when wc->stage == DROP_REFERENCE, this function drops | |
6684 | * reference count on the block. | |
6685 | * | |
6686 | * when wc->stage == UPDATE_BACKREF, this function changes | |
6687 | * wc->stage back to DROP_REFERENCE if we changed wc->stage | |
6688 | * to UPDATE_BACKREF previously while processing the block. | |
6689 | * | |
6690 | * NOTE: return value 1 means we should stop walking up. | |
6691 | */ | |
6692 | static noinline int walk_up_proc(struct btrfs_trans_handle *trans, | |
6693 | struct btrfs_root *root, | |
6694 | struct btrfs_path *path, | |
6695 | struct walk_control *wc) | |
6696 | { | |
f0486c68 | 6697 | int ret; |
2c47e605 YZ |
6698 | int level = wc->level; |
6699 | struct extent_buffer *eb = path->nodes[level]; | |
6700 | u64 parent = 0; | |
6701 | ||
6702 | if (wc->stage == UPDATE_BACKREF) { | |
6703 | BUG_ON(wc->shared_level < level); | |
6704 | if (level < wc->shared_level) | |
6705 | goto out; | |
6706 | ||
2c47e605 YZ |
6707 | ret = find_next_key(path, level + 1, &wc->update_progress); |
6708 | if (ret > 0) | |
6709 | wc->update_ref = 0; | |
6710 | ||
6711 | wc->stage = DROP_REFERENCE; | |
6712 | wc->shared_level = -1; | |
6713 | path->slots[level] = 0; | |
6714 | ||
6715 | /* | |
6716 | * check reference count again if the block isn't locked. | |
6717 | * we should start walking down the tree again if reference | |
6718 | * count is one. | |
6719 | */ | |
6720 | if (!path->locks[level]) { | |
6721 | BUG_ON(level == 0); | |
6722 | btrfs_tree_lock(eb); | |
6723 | btrfs_set_lock_blocking(eb); | |
bd681513 | 6724 | path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING; |
2c47e605 YZ |
6725 | |
6726 | ret = btrfs_lookup_extent_info(trans, root, | |
6727 | eb->start, eb->len, | |
6728 | &wc->refs[level], | |
6729 | &wc->flags[level]); | |
79787eaa JM |
6730 | if (ret < 0) { |
6731 | btrfs_tree_unlock_rw(eb, path->locks[level]); | |
6732 | return ret; | |
6733 | } | |
2c47e605 YZ |
6734 | BUG_ON(wc->refs[level] == 0); |
6735 | if (wc->refs[level] == 1) { | |
bd681513 | 6736 | btrfs_tree_unlock_rw(eb, path->locks[level]); |
2c47e605 YZ |
6737 | return 1; |
6738 | } | |
f82d02d9 | 6739 | } |
2c47e605 | 6740 | } |
f82d02d9 | 6741 | |
2c47e605 YZ |
6742 | /* wc->stage == DROP_REFERENCE */ |
6743 | BUG_ON(wc->refs[level] > 1 && !path->locks[level]); | |
5d4f98a2 | 6744 | |
2c47e605 YZ |
6745 | if (wc->refs[level] == 1) { |
6746 | if (level == 0) { | |
6747 | if (wc->flags[level] & BTRFS_BLOCK_FLAG_FULL_BACKREF) | |
66d7e7f0 AJ |
6748 | ret = btrfs_dec_ref(trans, root, eb, 1, |
6749 | wc->for_reloc); | |
2c47e605 | 6750 | else |
66d7e7f0 AJ |
6751 | ret = btrfs_dec_ref(trans, root, eb, 0, |
6752 | wc->for_reloc); | |
79787eaa | 6753 | BUG_ON(ret); /* -ENOMEM */ |
2c47e605 YZ |
6754 | } |
6755 | /* make block locked assertion in clean_tree_block happy */ | |
6756 | if (!path->locks[level] && | |
6757 | btrfs_header_generation(eb) == trans->transid) { | |
6758 | btrfs_tree_lock(eb); | |
6759 | btrfs_set_lock_blocking(eb); | |
bd681513 | 6760 | path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING; |
2c47e605 YZ |
6761 | } |
6762 | clean_tree_block(trans, root, eb); | |
6763 | } | |
6764 | ||
6765 | if (eb == root->node) { | |
6766 | if (wc->flags[level] & BTRFS_BLOCK_FLAG_FULL_BACKREF) | |
6767 | parent = eb->start; | |
6768 | else | |
6769 | BUG_ON(root->root_key.objectid != | |
6770 | btrfs_header_owner(eb)); | |
6771 | } else { | |
6772 | if (wc->flags[level + 1] & BTRFS_BLOCK_FLAG_FULL_BACKREF) | |
6773 | parent = path->nodes[level + 1]->start; | |
6774 | else | |
6775 | BUG_ON(root->root_key.objectid != | |
6776 | btrfs_header_owner(path->nodes[level + 1])); | |
f82d02d9 | 6777 | } |
f82d02d9 | 6778 | |
5581a51a | 6779 | btrfs_free_tree_block(trans, root, eb, parent, wc->refs[level] == 1); |
2c47e605 YZ |
6780 | out: |
6781 | wc->refs[level] = 0; | |
6782 | wc->flags[level] = 0; | |
f0486c68 | 6783 | return 0; |
2c47e605 YZ |
6784 | } |
6785 | ||
6786 | static noinline int walk_down_tree(struct btrfs_trans_handle *trans, | |
6787 | struct btrfs_root *root, | |
6788 | struct btrfs_path *path, | |
6789 | struct walk_control *wc) | |
6790 | { | |
2c47e605 | 6791 | int level = wc->level; |
94fcca9f | 6792 | int lookup_info = 1; |
2c47e605 YZ |
6793 | int ret; |
6794 | ||
6795 | while (level >= 0) { | |
94fcca9f | 6796 | ret = walk_down_proc(trans, root, path, wc, lookup_info); |
2c47e605 YZ |
6797 | if (ret > 0) |
6798 | break; | |
6799 | ||
6800 | if (level == 0) | |
6801 | break; | |
6802 | ||
7a7965f8 YZ |
6803 | if (path->slots[level] >= |
6804 | btrfs_header_nritems(path->nodes[level])) | |
6805 | break; | |
6806 | ||
94fcca9f | 6807 | ret = do_walk_down(trans, root, path, wc, &lookup_info); |
1c4850e2 YZ |
6808 | if (ret > 0) { |
6809 | path->slots[level]++; | |
6810 | continue; | |
90d2c51d MX |
6811 | } else if (ret < 0) |
6812 | return ret; | |
1c4850e2 | 6813 | level = wc->level; |
f82d02d9 | 6814 | } |
f82d02d9 YZ |
6815 | return 0; |
6816 | } | |
6817 | ||
d397712b | 6818 | static noinline int walk_up_tree(struct btrfs_trans_handle *trans, |
98ed5174 | 6819 | struct btrfs_root *root, |
f82d02d9 | 6820 | struct btrfs_path *path, |
2c47e605 | 6821 | struct walk_control *wc, int max_level) |
20524f02 | 6822 | { |
2c47e605 | 6823 | int level = wc->level; |
20524f02 | 6824 | int ret; |
9f3a7427 | 6825 | |
2c47e605 YZ |
6826 | path->slots[level] = btrfs_header_nritems(path->nodes[level]); |
6827 | while (level < max_level && path->nodes[level]) { | |
6828 | wc->level = level; | |
6829 | if (path->slots[level] + 1 < | |
6830 | btrfs_header_nritems(path->nodes[level])) { | |
6831 | path->slots[level]++; | |
20524f02 CM |
6832 | return 0; |
6833 | } else { | |
2c47e605 YZ |
6834 | ret = walk_up_proc(trans, root, path, wc); |
6835 | if (ret > 0) | |
6836 | return 0; | |
bd56b302 | 6837 | |
2c47e605 | 6838 | if (path->locks[level]) { |
bd681513 CM |
6839 | btrfs_tree_unlock_rw(path->nodes[level], |
6840 | path->locks[level]); | |
2c47e605 | 6841 | path->locks[level] = 0; |
f82d02d9 | 6842 | } |
2c47e605 YZ |
6843 | free_extent_buffer(path->nodes[level]); |
6844 | path->nodes[level] = NULL; | |
6845 | level++; | |
20524f02 CM |
6846 | } |
6847 | } | |
6848 | return 1; | |
6849 | } | |
6850 | ||
9aca1d51 | 6851 | /* |
2c47e605 YZ |
6852 | * drop a subvolume tree. |
6853 | * | |
6854 | * this function traverses the tree freeing any blocks that only | |
6855 | * referenced by the tree. | |
6856 | * | |
6857 | * when a shared tree block is found. this function decreases its | |
6858 | * reference count by one. if update_ref is true, this function | |
6859 | * also make sure backrefs for the shared block and all lower level | |
6860 | * blocks are properly updated. | |
9aca1d51 | 6861 | */ |
2c536799 | 6862 | int btrfs_drop_snapshot(struct btrfs_root *root, |
66d7e7f0 AJ |
6863 | struct btrfs_block_rsv *block_rsv, int update_ref, |
6864 | int for_reloc) | |
20524f02 | 6865 | { |
5caf2a00 | 6866 | struct btrfs_path *path; |
2c47e605 YZ |
6867 | struct btrfs_trans_handle *trans; |
6868 | struct btrfs_root *tree_root = root->fs_info->tree_root; | |
9f3a7427 | 6869 | struct btrfs_root_item *root_item = &root->root_item; |
2c47e605 YZ |
6870 | struct walk_control *wc; |
6871 | struct btrfs_key key; | |
6872 | int err = 0; | |
6873 | int ret; | |
6874 | int level; | |
20524f02 | 6875 | |
5caf2a00 | 6876 | path = btrfs_alloc_path(); |
cb1b69f4 TI |
6877 | if (!path) { |
6878 | err = -ENOMEM; | |
6879 | goto out; | |
6880 | } | |
20524f02 | 6881 | |
2c47e605 | 6882 | wc = kzalloc(sizeof(*wc), GFP_NOFS); |
38a1a919 MF |
6883 | if (!wc) { |
6884 | btrfs_free_path(path); | |
cb1b69f4 TI |
6885 | err = -ENOMEM; |
6886 | goto out; | |
38a1a919 | 6887 | } |
2c47e605 | 6888 | |
a22285a6 | 6889 | trans = btrfs_start_transaction(tree_root, 0); |
79787eaa JM |
6890 | if (IS_ERR(trans)) { |
6891 | err = PTR_ERR(trans); | |
6892 | goto out_free; | |
6893 | } | |
98d5dc13 | 6894 | |
3fd0a558 YZ |
6895 | if (block_rsv) |
6896 | trans->block_rsv = block_rsv; | |
2c47e605 | 6897 | |
9f3a7427 | 6898 | if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { |
2c47e605 | 6899 | level = btrfs_header_level(root->node); |
5d4f98a2 YZ |
6900 | path->nodes[level] = btrfs_lock_root_node(root); |
6901 | btrfs_set_lock_blocking(path->nodes[level]); | |
9f3a7427 | 6902 | path->slots[level] = 0; |
bd681513 | 6903 | path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING; |
2c47e605 YZ |
6904 | memset(&wc->update_progress, 0, |
6905 | sizeof(wc->update_progress)); | |
9f3a7427 | 6906 | } else { |
9f3a7427 | 6907 | btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); |
2c47e605 YZ |
6908 | memcpy(&wc->update_progress, &key, |
6909 | sizeof(wc->update_progress)); | |
6910 | ||
6702ed49 | 6911 | level = root_item->drop_level; |
2c47e605 | 6912 | BUG_ON(level == 0); |
6702ed49 | 6913 | path->lowest_level = level; |
2c47e605 YZ |
6914 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
6915 | path->lowest_level = 0; | |
6916 | if (ret < 0) { | |
6917 | err = ret; | |
79787eaa | 6918 | goto out_end_trans; |
9f3a7427 | 6919 | } |
1c4850e2 | 6920 | WARN_ON(ret > 0); |
2c47e605 | 6921 | |
7d9eb12c CM |
6922 | /* |
6923 | * unlock our path, this is safe because only this | |
6924 | * function is allowed to delete this snapshot | |
6925 | */ | |
5d4f98a2 | 6926 | btrfs_unlock_up_safe(path, 0); |
2c47e605 YZ |
6927 | |
6928 | level = btrfs_header_level(root->node); | |
6929 | while (1) { | |
6930 | btrfs_tree_lock(path->nodes[level]); | |
6931 | btrfs_set_lock_blocking(path->nodes[level]); | |
6932 | ||
6933 | ret = btrfs_lookup_extent_info(trans, root, | |
6934 | path->nodes[level]->start, | |
6935 | path->nodes[level]->len, | |
6936 | &wc->refs[level], | |
6937 | &wc->flags[level]); | |
79787eaa JM |
6938 | if (ret < 0) { |
6939 | err = ret; | |
6940 | goto out_end_trans; | |
6941 | } | |
2c47e605 YZ |
6942 | BUG_ON(wc->refs[level] == 0); |
6943 | ||
6944 | if (level == root_item->drop_level) | |
6945 | break; | |
6946 | ||
6947 | btrfs_tree_unlock(path->nodes[level]); | |
6948 | WARN_ON(wc->refs[level] != 1); | |
6949 | level--; | |
6950 | } | |
9f3a7427 | 6951 | } |
2c47e605 YZ |
6952 | |
6953 | wc->level = level; | |
6954 | wc->shared_level = -1; | |
6955 | wc->stage = DROP_REFERENCE; | |
6956 | wc->update_ref = update_ref; | |
6957 | wc->keep_locks = 0; | |
66d7e7f0 | 6958 | wc->for_reloc = for_reloc; |
1c4850e2 | 6959 | wc->reada_count = BTRFS_NODEPTRS_PER_BLOCK(root); |
2c47e605 | 6960 | |
d397712b | 6961 | while (1) { |
2c47e605 YZ |
6962 | ret = walk_down_tree(trans, root, path, wc); |
6963 | if (ret < 0) { | |
6964 | err = ret; | |
20524f02 | 6965 | break; |
2c47e605 | 6966 | } |
9aca1d51 | 6967 | |
2c47e605 YZ |
6968 | ret = walk_up_tree(trans, root, path, wc, BTRFS_MAX_LEVEL); |
6969 | if (ret < 0) { | |
6970 | err = ret; | |
20524f02 | 6971 | break; |
2c47e605 YZ |
6972 | } |
6973 | ||
6974 | if (ret > 0) { | |
6975 | BUG_ON(wc->stage != DROP_REFERENCE); | |
e7a84565 CM |
6976 | break; |
6977 | } | |
2c47e605 YZ |
6978 | |
6979 | if (wc->stage == DROP_REFERENCE) { | |
6980 | level = wc->level; | |
6981 | btrfs_node_key(path->nodes[level], | |
6982 | &root_item->drop_progress, | |
6983 | path->slots[level]); | |
6984 | root_item->drop_level = level; | |
6985 | } | |
6986 | ||
6987 | BUG_ON(wc->level == 0); | |
3fd0a558 | 6988 | if (btrfs_should_end_transaction(trans, tree_root)) { |
2c47e605 YZ |
6989 | ret = btrfs_update_root(trans, tree_root, |
6990 | &root->root_key, | |
6991 | root_item); | |
79787eaa JM |
6992 | if (ret) { |
6993 | btrfs_abort_transaction(trans, tree_root, ret); | |
6994 | err = ret; | |
6995 | goto out_end_trans; | |
6996 | } | |
2c47e605 | 6997 | |
3fd0a558 | 6998 | btrfs_end_transaction_throttle(trans, tree_root); |
a22285a6 | 6999 | trans = btrfs_start_transaction(tree_root, 0); |
79787eaa JM |
7000 | if (IS_ERR(trans)) { |
7001 | err = PTR_ERR(trans); | |
7002 | goto out_free; | |
7003 | } | |
3fd0a558 YZ |
7004 | if (block_rsv) |
7005 | trans->block_rsv = block_rsv; | |
c3e69d58 | 7006 | } |
20524f02 | 7007 | } |
b3b4aa74 | 7008 | btrfs_release_path(path); |
79787eaa JM |
7009 | if (err) |
7010 | goto out_end_trans; | |
2c47e605 YZ |
7011 | |
7012 | ret = btrfs_del_root(trans, tree_root, &root->root_key); | |
79787eaa JM |
7013 | if (ret) { |
7014 | btrfs_abort_transaction(trans, tree_root, ret); | |
7015 | goto out_end_trans; | |
7016 | } | |
2c47e605 | 7017 | |
76dda93c YZ |
7018 | if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { |
7019 | ret = btrfs_find_last_root(tree_root, root->root_key.objectid, | |
7020 | NULL, NULL); | |
79787eaa JM |
7021 | if (ret < 0) { |
7022 | btrfs_abort_transaction(trans, tree_root, ret); | |
7023 | err = ret; | |
7024 | goto out_end_trans; | |
7025 | } else if (ret > 0) { | |
84cd948c JB |
7026 | /* if we fail to delete the orphan item this time |
7027 | * around, it'll get picked up the next time. | |
7028 | * | |
7029 | * The most common failure here is just -ENOENT. | |
7030 | */ | |
7031 | btrfs_del_orphan_item(trans, tree_root, | |
7032 | root->root_key.objectid); | |
76dda93c YZ |
7033 | } |
7034 | } | |
7035 | ||
7036 | if (root->in_radix) { | |
7037 | btrfs_free_fs_root(tree_root->fs_info, root); | |
7038 | } else { | |
7039 | free_extent_buffer(root->node); | |
7040 | free_extent_buffer(root->commit_root); | |
7041 | kfree(root); | |
7042 | } | |
79787eaa | 7043 | out_end_trans: |
3fd0a558 | 7044 | btrfs_end_transaction_throttle(trans, tree_root); |
79787eaa | 7045 | out_free: |
2c47e605 | 7046 | kfree(wc); |
5caf2a00 | 7047 | btrfs_free_path(path); |
cb1b69f4 TI |
7048 | out: |
7049 | if (err) | |
7050 | btrfs_std_error(root->fs_info, err); | |
2c536799 | 7051 | return err; |
20524f02 | 7052 | } |
9078a3e1 | 7053 | |
2c47e605 YZ |
7054 | /* |
7055 | * drop subtree rooted at tree block 'node'. | |
7056 | * | |
7057 | * NOTE: this function will unlock and release tree block 'node' | |
66d7e7f0 | 7058 | * only used by relocation code |
2c47e605 | 7059 | */ |
f82d02d9 YZ |
7060 | int btrfs_drop_subtree(struct btrfs_trans_handle *trans, |
7061 | struct btrfs_root *root, | |
7062 | struct extent_buffer *node, | |
7063 | struct extent_buffer *parent) | |
7064 | { | |
7065 | struct btrfs_path *path; | |
2c47e605 | 7066 | struct walk_control *wc; |
f82d02d9 YZ |
7067 | int level; |
7068 | int parent_level; | |
7069 | int ret = 0; | |
7070 | int wret; | |
7071 | ||
2c47e605 YZ |
7072 | BUG_ON(root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); |
7073 | ||
f82d02d9 | 7074 | path = btrfs_alloc_path(); |
db5b493a TI |
7075 | if (!path) |
7076 | return -ENOMEM; | |
f82d02d9 | 7077 | |
2c47e605 | 7078 | wc = kzalloc(sizeof(*wc), GFP_NOFS); |
db5b493a TI |
7079 | if (!wc) { |
7080 | btrfs_free_path(path); | |
7081 | return -ENOMEM; | |
7082 | } | |
2c47e605 | 7083 | |
b9447ef8 | 7084 | btrfs_assert_tree_locked(parent); |
f82d02d9 YZ |
7085 | parent_level = btrfs_header_level(parent); |
7086 | extent_buffer_get(parent); | |
7087 | path->nodes[parent_level] = parent; | |
7088 | path->slots[parent_level] = btrfs_header_nritems(parent); | |
7089 | ||
b9447ef8 | 7090 | btrfs_assert_tree_locked(node); |
f82d02d9 | 7091 | level = btrfs_header_level(node); |
f82d02d9 YZ |
7092 | path->nodes[level] = node; |
7093 | path->slots[level] = 0; | |
bd681513 | 7094 | path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING; |
2c47e605 YZ |
7095 | |
7096 | wc->refs[parent_level] = 1; | |
7097 | wc->flags[parent_level] = BTRFS_BLOCK_FLAG_FULL_BACKREF; | |
7098 | wc->level = level; | |
7099 | wc->shared_level = -1; | |
7100 | wc->stage = DROP_REFERENCE; | |
7101 | wc->update_ref = 0; | |
7102 | wc->keep_locks = 1; | |
66d7e7f0 | 7103 | wc->for_reloc = 1; |
1c4850e2 | 7104 | wc->reada_count = BTRFS_NODEPTRS_PER_BLOCK(root); |
f82d02d9 YZ |
7105 | |
7106 | while (1) { | |
2c47e605 YZ |
7107 | wret = walk_down_tree(trans, root, path, wc); |
7108 | if (wret < 0) { | |
f82d02d9 | 7109 | ret = wret; |
f82d02d9 | 7110 | break; |
2c47e605 | 7111 | } |
f82d02d9 | 7112 | |
2c47e605 | 7113 | wret = walk_up_tree(trans, root, path, wc, parent_level); |
f82d02d9 YZ |
7114 | if (wret < 0) |
7115 | ret = wret; | |
7116 | if (wret != 0) | |
7117 | break; | |
7118 | } | |
7119 | ||
2c47e605 | 7120 | kfree(wc); |
f82d02d9 YZ |
7121 | btrfs_free_path(path); |
7122 | return ret; | |
7123 | } | |
7124 | ||
ec44a35c CM |
7125 | static u64 update_block_group_flags(struct btrfs_root *root, u64 flags) |
7126 | { | |
7127 | u64 num_devices; | |
fc67c450 | 7128 | u64 stripped; |
e4d8ec0f | 7129 | |
fc67c450 ID |
7130 | /* |
7131 | * if restripe for this chunk_type is on pick target profile and | |
7132 | * return, otherwise do the usual balance | |
7133 | */ | |
7134 | stripped = get_restripe_target(root->fs_info, flags); | |
7135 | if (stripped) | |
7136 | return extended_to_chunk(stripped); | |
e4d8ec0f | 7137 | |
cd02dca5 CM |
7138 | /* |
7139 | * we add in the count of missing devices because we want | |
7140 | * to make sure that any RAID levels on a degraded FS | |
7141 | * continue to be honored. | |
7142 | */ | |
7143 | num_devices = root->fs_info->fs_devices->rw_devices + | |
7144 | root->fs_info->fs_devices->missing_devices; | |
7145 | ||
fc67c450 ID |
7146 | stripped = BTRFS_BLOCK_GROUP_RAID0 | |
7147 | BTRFS_BLOCK_GROUP_RAID1 | BTRFS_BLOCK_GROUP_RAID10; | |
7148 | ||
ec44a35c CM |
7149 | if (num_devices == 1) { |
7150 | stripped |= BTRFS_BLOCK_GROUP_DUP; | |
7151 | stripped = flags & ~stripped; | |
7152 | ||
7153 | /* turn raid0 into single device chunks */ | |
7154 | if (flags & BTRFS_BLOCK_GROUP_RAID0) | |
7155 | return stripped; | |
7156 | ||
7157 | /* turn mirroring into duplication */ | |
7158 | if (flags & (BTRFS_BLOCK_GROUP_RAID1 | | |
7159 | BTRFS_BLOCK_GROUP_RAID10)) | |
7160 | return stripped | BTRFS_BLOCK_GROUP_DUP; | |
ec44a35c CM |
7161 | } else { |
7162 | /* they already had raid on here, just return */ | |
ec44a35c CM |
7163 | if (flags & stripped) |
7164 | return flags; | |
7165 | ||
7166 | stripped |= BTRFS_BLOCK_GROUP_DUP; | |
7167 | stripped = flags & ~stripped; | |
7168 | ||
7169 | /* switch duplicated blocks with raid1 */ | |
7170 | if (flags & BTRFS_BLOCK_GROUP_DUP) | |
7171 | return stripped | BTRFS_BLOCK_GROUP_RAID1; | |
7172 | ||
e3176ca2 | 7173 | /* this is drive concat, leave it alone */ |
ec44a35c | 7174 | } |
e3176ca2 | 7175 | |
ec44a35c CM |
7176 | return flags; |
7177 | } | |
7178 | ||
199c36ea | 7179 | static int set_block_group_ro(struct btrfs_block_group_cache *cache, int force) |
0ef3e66b | 7180 | { |
f0486c68 YZ |
7181 | struct btrfs_space_info *sinfo = cache->space_info; |
7182 | u64 num_bytes; | |
199c36ea | 7183 | u64 min_allocable_bytes; |
f0486c68 | 7184 | int ret = -ENOSPC; |
0ef3e66b | 7185 | |
c286ac48 | 7186 | |
199c36ea MX |
7187 | /* |
7188 | * We need some metadata space and system metadata space for | |
7189 | * allocating chunks in some corner cases until we force to set | |
7190 | * it to be readonly. | |
7191 | */ | |
7192 | if ((sinfo->flags & | |
7193 | (BTRFS_BLOCK_GROUP_SYSTEM | BTRFS_BLOCK_GROUP_METADATA)) && | |
7194 | !force) | |
7195 | min_allocable_bytes = 1 * 1024 * 1024; | |
7196 | else | |
7197 | min_allocable_bytes = 0; | |
7198 | ||
f0486c68 YZ |
7199 | spin_lock(&sinfo->lock); |
7200 | spin_lock(&cache->lock); | |
61cfea9b W |
7201 | |
7202 | if (cache->ro) { | |
7203 | ret = 0; | |
7204 | goto out; | |
7205 | } | |
7206 | ||
f0486c68 YZ |
7207 | num_bytes = cache->key.offset - cache->reserved - cache->pinned - |
7208 | cache->bytes_super - btrfs_block_group_used(&cache->item); | |
7209 | ||
7210 | if (sinfo->bytes_used + sinfo->bytes_reserved + sinfo->bytes_pinned + | |
37be25bc JB |
7211 | sinfo->bytes_may_use + sinfo->bytes_readonly + num_bytes + |
7212 | min_allocable_bytes <= sinfo->total_bytes) { | |
f0486c68 | 7213 | sinfo->bytes_readonly += num_bytes; |
f0486c68 YZ |
7214 | cache->ro = 1; |
7215 | ret = 0; | |
7216 | } | |
61cfea9b | 7217 | out: |
f0486c68 YZ |
7218 | spin_unlock(&cache->lock); |
7219 | spin_unlock(&sinfo->lock); | |
7220 | return ret; | |
7221 | } | |
7d9eb12c | 7222 | |
f0486c68 YZ |
7223 | int btrfs_set_block_group_ro(struct btrfs_root *root, |
7224 | struct btrfs_block_group_cache *cache) | |
c286ac48 | 7225 | |
f0486c68 YZ |
7226 | { |
7227 | struct btrfs_trans_handle *trans; | |
7228 | u64 alloc_flags; | |
7229 | int ret; | |
7d9eb12c | 7230 | |
f0486c68 | 7231 | BUG_ON(cache->ro); |
0ef3e66b | 7232 | |
ff5714cc | 7233 | trans = btrfs_join_transaction(root); |
79787eaa JM |
7234 | if (IS_ERR(trans)) |
7235 | return PTR_ERR(trans); | |
5d4f98a2 | 7236 | |
f0486c68 | 7237 | alloc_flags = update_block_group_flags(root, cache->flags); |
79787eaa | 7238 | if (alloc_flags != cache->flags) { |
698d0082 | 7239 | ret = do_chunk_alloc(trans, root, alloc_flags, |
79787eaa JM |
7240 | CHUNK_ALLOC_FORCE); |
7241 | if (ret < 0) | |
7242 | goto out; | |
7243 | } | |
5d4f98a2 | 7244 | |
199c36ea | 7245 | ret = set_block_group_ro(cache, 0); |
f0486c68 YZ |
7246 | if (!ret) |
7247 | goto out; | |
7248 | alloc_flags = get_alloc_profile(root, cache->space_info->flags); | |
698d0082 | 7249 | ret = do_chunk_alloc(trans, root, alloc_flags, |
0e4f8f88 | 7250 | CHUNK_ALLOC_FORCE); |
f0486c68 YZ |
7251 | if (ret < 0) |
7252 | goto out; | |
199c36ea | 7253 | ret = set_block_group_ro(cache, 0); |
f0486c68 YZ |
7254 | out: |
7255 | btrfs_end_transaction(trans, root); | |
7256 | return ret; | |
7257 | } | |
5d4f98a2 | 7258 | |
c87f08ca CM |
7259 | int btrfs_force_chunk_alloc(struct btrfs_trans_handle *trans, |
7260 | struct btrfs_root *root, u64 type) | |
7261 | { | |
7262 | u64 alloc_flags = get_alloc_profile(root, type); | |
698d0082 | 7263 | return do_chunk_alloc(trans, root, alloc_flags, |
0e4f8f88 | 7264 | CHUNK_ALLOC_FORCE); |
c87f08ca CM |
7265 | } |
7266 | ||
6d07bcec MX |
7267 | /* |
7268 | * helper to account the unused space of all the readonly block group in the | |
7269 | * list. takes mirrors into account. | |
7270 | */ | |
7271 | static u64 __btrfs_get_ro_block_group_free_space(struct list_head *groups_list) | |
7272 | { | |
7273 | struct btrfs_block_group_cache *block_group; | |
7274 | u64 free_bytes = 0; | |
7275 | int factor; | |
7276 | ||
7277 | list_for_each_entry(block_group, groups_list, list) { | |
7278 | spin_lock(&block_group->lock); | |
7279 | ||
7280 | if (!block_group->ro) { | |
7281 | spin_unlock(&block_group->lock); | |
7282 | continue; | |
7283 | } | |
7284 | ||
7285 | if (block_group->flags & (BTRFS_BLOCK_GROUP_RAID1 | | |
7286 | BTRFS_BLOCK_GROUP_RAID10 | | |
7287 | BTRFS_BLOCK_GROUP_DUP)) | |
7288 | factor = 2; | |
7289 | else | |
7290 | factor = 1; | |
7291 | ||
7292 | free_bytes += (block_group->key.offset - | |
7293 | btrfs_block_group_used(&block_group->item)) * | |
7294 | factor; | |
7295 | ||
7296 | spin_unlock(&block_group->lock); | |
7297 | } | |
7298 | ||
7299 | return free_bytes; | |
7300 | } | |
7301 | ||
7302 | /* | |
7303 | * helper to account the unused space of all the readonly block group in the | |
7304 | * space_info. takes mirrors into account. | |
7305 | */ | |
7306 | u64 btrfs_account_ro_block_groups_free_space(struct btrfs_space_info *sinfo) | |
7307 | { | |
7308 | int i; | |
7309 | u64 free_bytes = 0; | |
7310 | ||
7311 | spin_lock(&sinfo->lock); | |
7312 | ||
7313 | for(i = 0; i < BTRFS_NR_RAID_TYPES; i++) | |
7314 | if (!list_empty(&sinfo->block_groups[i])) | |
7315 | free_bytes += __btrfs_get_ro_block_group_free_space( | |
7316 | &sinfo->block_groups[i]); | |
7317 | ||
7318 | spin_unlock(&sinfo->lock); | |
7319 | ||
7320 | return free_bytes; | |
7321 | } | |
7322 | ||
143bede5 | 7323 | void btrfs_set_block_group_rw(struct btrfs_root *root, |
f0486c68 | 7324 | struct btrfs_block_group_cache *cache) |
5d4f98a2 | 7325 | { |
f0486c68 YZ |
7326 | struct btrfs_space_info *sinfo = cache->space_info; |
7327 | u64 num_bytes; | |
7328 | ||
7329 | BUG_ON(!cache->ro); | |
7330 | ||
7331 | spin_lock(&sinfo->lock); | |
7332 | spin_lock(&cache->lock); | |
7333 | num_bytes = cache->key.offset - cache->reserved - cache->pinned - | |
7334 | cache->bytes_super - btrfs_block_group_used(&cache->item); | |
7335 | sinfo->bytes_readonly -= num_bytes; | |
7336 | cache->ro = 0; | |
7337 | spin_unlock(&cache->lock); | |
7338 | spin_unlock(&sinfo->lock); | |
5d4f98a2 YZ |
7339 | } |
7340 | ||
ba1bf481 JB |
7341 | /* |
7342 | * checks to see if its even possible to relocate this block group. | |
7343 | * | |
7344 | * @return - -1 if it's not a good idea to relocate this block group, 0 if its | |
7345 | * ok to go ahead and try. | |
7346 | */ | |
7347 | int btrfs_can_relocate(struct btrfs_root *root, u64 bytenr) | |
1a40e23b | 7348 | { |
ba1bf481 JB |
7349 | struct btrfs_block_group_cache *block_group; |
7350 | struct btrfs_space_info *space_info; | |
7351 | struct btrfs_fs_devices *fs_devices = root->fs_info->fs_devices; | |
7352 | struct btrfs_device *device; | |
cdcb725c | 7353 | u64 min_free; |
6719db6a JB |
7354 | u64 dev_min = 1; |
7355 | u64 dev_nr = 0; | |
4a5e98f5 | 7356 | u64 target; |
cdcb725c | 7357 | int index; |
ba1bf481 JB |
7358 | int full = 0; |
7359 | int ret = 0; | |
1a40e23b | 7360 | |
ba1bf481 | 7361 | block_group = btrfs_lookup_block_group(root->fs_info, bytenr); |
1a40e23b | 7362 | |
ba1bf481 JB |
7363 | /* odd, couldn't find the block group, leave it alone */ |
7364 | if (!block_group) | |
7365 | return -1; | |
1a40e23b | 7366 | |
cdcb725c | 7367 | min_free = btrfs_block_group_used(&block_group->item); |
7368 | ||
ba1bf481 | 7369 | /* no bytes used, we're good */ |
cdcb725c | 7370 | if (!min_free) |
1a40e23b ZY |
7371 | goto out; |
7372 | ||
ba1bf481 JB |
7373 | space_info = block_group->space_info; |
7374 | spin_lock(&space_info->lock); | |
17d217fe | 7375 | |
ba1bf481 | 7376 | full = space_info->full; |
17d217fe | 7377 | |
ba1bf481 JB |
7378 | /* |
7379 | * if this is the last block group we have in this space, we can't | |
7ce618db CM |
7380 | * relocate it unless we're able to allocate a new chunk below. |
7381 | * | |
7382 | * Otherwise, we need to make sure we have room in the space to handle | |
7383 | * all of the extents from this block group. If we can, we're good | |
ba1bf481 | 7384 | */ |
7ce618db | 7385 | if ((space_info->total_bytes != block_group->key.offset) && |
cdcb725c | 7386 | (space_info->bytes_used + space_info->bytes_reserved + |
7387 | space_info->bytes_pinned + space_info->bytes_readonly + | |
7388 | min_free < space_info->total_bytes)) { | |
ba1bf481 JB |
7389 | spin_unlock(&space_info->lock); |
7390 | goto out; | |
17d217fe | 7391 | } |
ba1bf481 | 7392 | spin_unlock(&space_info->lock); |
ea8c2819 | 7393 | |
ba1bf481 JB |
7394 | /* |
7395 | * ok we don't have enough space, but maybe we have free space on our | |
7396 | * devices to allocate new chunks for relocation, so loop through our | |
4a5e98f5 ID |
7397 | * alloc devices and guess if we have enough space. if this block |
7398 | * group is going to be restriped, run checks against the target | |
7399 | * profile instead of the current one. | |
ba1bf481 JB |
7400 | */ |
7401 | ret = -1; | |
ea8c2819 | 7402 | |
cdcb725c | 7403 | /* |
7404 | * index: | |
7405 | * 0: raid10 | |
7406 | * 1: raid1 | |
7407 | * 2: dup | |
7408 | * 3: raid0 | |
7409 | * 4: single | |
7410 | */ | |
4a5e98f5 ID |
7411 | target = get_restripe_target(root->fs_info, block_group->flags); |
7412 | if (target) { | |
7413 | index = __get_block_group_index(extended_to_chunk(target)); | |
7414 | } else { | |
7415 | /* | |
7416 | * this is just a balance, so if we were marked as full | |
7417 | * we know there is no space for a new chunk | |
7418 | */ | |
7419 | if (full) | |
7420 | goto out; | |
7421 | ||
7422 | index = get_block_group_index(block_group); | |
7423 | } | |
7424 | ||
cdcb725c | 7425 | if (index == 0) { |
7426 | dev_min = 4; | |
6719db6a JB |
7427 | /* Divide by 2 */ |
7428 | min_free >>= 1; | |
cdcb725c | 7429 | } else if (index == 1) { |
7430 | dev_min = 2; | |
7431 | } else if (index == 2) { | |
6719db6a JB |
7432 | /* Multiply by 2 */ |
7433 | min_free <<= 1; | |
cdcb725c | 7434 | } else if (index == 3) { |
7435 | dev_min = fs_devices->rw_devices; | |
6719db6a | 7436 | do_div(min_free, dev_min); |
cdcb725c | 7437 | } |
7438 | ||
ba1bf481 JB |
7439 | mutex_lock(&root->fs_info->chunk_mutex); |
7440 | list_for_each_entry(device, &fs_devices->alloc_list, dev_alloc_list) { | |
7bfc837d | 7441 | u64 dev_offset; |
56bec294 | 7442 | |
ba1bf481 JB |
7443 | /* |
7444 | * check to make sure we can actually find a chunk with enough | |
7445 | * space to fit our block group in. | |
7446 | */ | |
7447 | if (device->total_bytes > device->bytes_used + min_free) { | |
125ccb0a | 7448 | ret = find_free_dev_extent(device, min_free, |
7bfc837d | 7449 | &dev_offset, NULL); |
ba1bf481 | 7450 | if (!ret) |
cdcb725c | 7451 | dev_nr++; |
7452 | ||
7453 | if (dev_nr >= dev_min) | |
73e48b27 | 7454 | break; |
cdcb725c | 7455 | |
ba1bf481 | 7456 | ret = -1; |
725c8463 | 7457 | } |
edbd8d4e | 7458 | } |
ba1bf481 | 7459 | mutex_unlock(&root->fs_info->chunk_mutex); |
edbd8d4e | 7460 | out: |
ba1bf481 | 7461 | btrfs_put_block_group(block_group); |
edbd8d4e CM |
7462 | return ret; |
7463 | } | |
7464 | ||
b2950863 CH |
7465 | static int find_first_block_group(struct btrfs_root *root, |
7466 | struct btrfs_path *path, struct btrfs_key *key) | |
0b86a832 | 7467 | { |
925baedd | 7468 | int ret = 0; |
0b86a832 CM |
7469 | struct btrfs_key found_key; |
7470 | struct extent_buffer *leaf; | |
7471 | int slot; | |
edbd8d4e | 7472 | |
0b86a832 CM |
7473 | ret = btrfs_search_slot(NULL, root, key, path, 0, 0); |
7474 | if (ret < 0) | |
925baedd CM |
7475 | goto out; |
7476 | ||
d397712b | 7477 | while (1) { |
0b86a832 | 7478 | slot = path->slots[0]; |
edbd8d4e | 7479 | leaf = path->nodes[0]; |
0b86a832 CM |
7480 | if (slot >= btrfs_header_nritems(leaf)) { |
7481 | ret = btrfs_next_leaf(root, path); | |
7482 | if (ret == 0) | |
7483 | continue; | |
7484 | if (ret < 0) | |
925baedd | 7485 | goto out; |
0b86a832 | 7486 | break; |
edbd8d4e | 7487 | } |
0b86a832 | 7488 | btrfs_item_key_to_cpu(leaf, &found_key, slot); |
edbd8d4e | 7489 | |
0b86a832 | 7490 | if (found_key.objectid >= key->objectid && |
925baedd CM |
7491 | found_key.type == BTRFS_BLOCK_GROUP_ITEM_KEY) { |
7492 | ret = 0; | |
7493 | goto out; | |
7494 | } | |
0b86a832 | 7495 | path->slots[0]++; |
edbd8d4e | 7496 | } |
925baedd | 7497 | out: |
0b86a832 | 7498 | return ret; |
edbd8d4e CM |
7499 | } |
7500 | ||
0af3d00b JB |
7501 | void btrfs_put_block_group_cache(struct btrfs_fs_info *info) |
7502 | { | |
7503 | struct btrfs_block_group_cache *block_group; | |
7504 | u64 last = 0; | |
7505 | ||
7506 | while (1) { | |
7507 | struct inode *inode; | |
7508 | ||
7509 | block_group = btrfs_lookup_first_block_group(info, last); | |
7510 | while (block_group) { | |
7511 | spin_lock(&block_group->lock); | |
7512 | if (block_group->iref) | |
7513 | break; | |
7514 | spin_unlock(&block_group->lock); | |
7515 | block_group = next_block_group(info->tree_root, | |
7516 | block_group); | |
7517 | } | |
7518 | if (!block_group) { | |
7519 | if (last == 0) | |
7520 | break; | |
7521 | last = 0; | |
7522 | continue; | |
7523 | } | |
7524 | ||
7525 | inode = block_group->inode; | |
7526 | block_group->iref = 0; | |
7527 | block_group->inode = NULL; | |
7528 | spin_unlock(&block_group->lock); | |
7529 | iput(inode); | |
7530 | last = block_group->key.objectid + block_group->key.offset; | |
7531 | btrfs_put_block_group(block_group); | |
7532 | } | |
7533 | } | |
7534 | ||
1a40e23b ZY |
7535 | int btrfs_free_block_groups(struct btrfs_fs_info *info) |
7536 | { | |
7537 | struct btrfs_block_group_cache *block_group; | |
4184ea7f | 7538 | struct btrfs_space_info *space_info; |
11833d66 | 7539 | struct btrfs_caching_control *caching_ctl; |
1a40e23b ZY |
7540 | struct rb_node *n; |
7541 | ||
11833d66 YZ |
7542 | down_write(&info->extent_commit_sem); |
7543 | while (!list_empty(&info->caching_block_groups)) { | |
7544 | caching_ctl = list_entry(info->caching_block_groups.next, | |
7545 | struct btrfs_caching_control, list); | |
7546 | list_del(&caching_ctl->list); | |
7547 | put_caching_control(caching_ctl); | |
7548 | } | |
7549 | up_write(&info->extent_commit_sem); | |
7550 | ||
1a40e23b ZY |
7551 | spin_lock(&info->block_group_cache_lock); |
7552 | while ((n = rb_last(&info->block_group_cache_tree)) != NULL) { | |
7553 | block_group = rb_entry(n, struct btrfs_block_group_cache, | |
7554 | cache_node); | |
1a40e23b ZY |
7555 | rb_erase(&block_group->cache_node, |
7556 | &info->block_group_cache_tree); | |
d899e052 YZ |
7557 | spin_unlock(&info->block_group_cache_lock); |
7558 | ||
80eb234a | 7559 | down_write(&block_group->space_info->groups_sem); |
1a40e23b | 7560 | list_del(&block_group->list); |
80eb234a | 7561 | up_write(&block_group->space_info->groups_sem); |
d2fb3437 | 7562 | |
817d52f8 | 7563 | if (block_group->cached == BTRFS_CACHE_STARTED) |
11833d66 | 7564 | wait_block_group_cache_done(block_group); |
817d52f8 | 7565 | |
3c14874a JB |
7566 | /* |
7567 | * We haven't cached this block group, which means we could | |
7568 | * possibly have excluded extents on this block group. | |
7569 | */ | |
7570 | if (block_group->cached == BTRFS_CACHE_NO) | |
7571 | free_excluded_extents(info->extent_root, block_group); | |
7572 | ||
817d52f8 | 7573 | btrfs_remove_free_space_cache(block_group); |
11dfe35a | 7574 | btrfs_put_block_group(block_group); |
d899e052 YZ |
7575 | |
7576 | spin_lock(&info->block_group_cache_lock); | |
1a40e23b ZY |
7577 | } |
7578 | spin_unlock(&info->block_group_cache_lock); | |
4184ea7f CM |
7579 | |
7580 | /* now that all the block groups are freed, go through and | |
7581 | * free all the space_info structs. This is only called during | |
7582 | * the final stages of unmount, and so we know nobody is | |
7583 | * using them. We call synchronize_rcu() once before we start, | |
7584 | * just to be on the safe side. | |
7585 | */ | |
7586 | synchronize_rcu(); | |
7587 | ||
8929ecfa YZ |
7588 | release_global_block_rsv(info); |
7589 | ||
4184ea7f CM |
7590 | while(!list_empty(&info->space_info)) { |
7591 | space_info = list_entry(info->space_info.next, | |
7592 | struct btrfs_space_info, | |
7593 | list); | |
f0486c68 | 7594 | if (space_info->bytes_pinned > 0 || |
fb25e914 JB |
7595 | space_info->bytes_reserved > 0 || |
7596 | space_info->bytes_may_use > 0) { | |
f0486c68 YZ |
7597 | WARN_ON(1); |
7598 | dump_space_info(space_info, 0, 0); | |
7599 | } | |
4184ea7f CM |
7600 | list_del(&space_info->list); |
7601 | kfree(space_info); | |
7602 | } | |
1a40e23b ZY |
7603 | return 0; |
7604 | } | |
7605 | ||
b742bb82 YZ |
7606 | static void __link_block_group(struct btrfs_space_info *space_info, |
7607 | struct btrfs_block_group_cache *cache) | |
7608 | { | |
7609 | int index = get_block_group_index(cache); | |
7610 | ||
7611 | down_write(&space_info->groups_sem); | |
7612 | list_add_tail(&cache->list, &space_info->block_groups[index]); | |
7613 | up_write(&space_info->groups_sem); | |
7614 | } | |
7615 | ||
9078a3e1 CM |
7616 | int btrfs_read_block_groups(struct btrfs_root *root) |
7617 | { | |
7618 | struct btrfs_path *path; | |
7619 | int ret; | |
9078a3e1 | 7620 | struct btrfs_block_group_cache *cache; |
be744175 | 7621 | struct btrfs_fs_info *info = root->fs_info; |
6324fbf3 | 7622 | struct btrfs_space_info *space_info; |
9078a3e1 CM |
7623 | struct btrfs_key key; |
7624 | struct btrfs_key found_key; | |
5f39d397 | 7625 | struct extent_buffer *leaf; |
0af3d00b JB |
7626 | int need_clear = 0; |
7627 | u64 cache_gen; | |
96b5179d | 7628 | |
be744175 | 7629 | root = info->extent_root; |
9078a3e1 | 7630 | key.objectid = 0; |
0b86a832 | 7631 | key.offset = 0; |
9078a3e1 | 7632 | btrfs_set_key_type(&key, BTRFS_BLOCK_GROUP_ITEM_KEY); |
9078a3e1 CM |
7633 | path = btrfs_alloc_path(); |
7634 | if (!path) | |
7635 | return -ENOMEM; | |
026fd317 | 7636 | path->reada = 1; |
9078a3e1 | 7637 | |
6c41761f | 7638 | cache_gen = btrfs_super_cache_generation(root->fs_info->super_copy); |
73bc1876 | 7639 | if (btrfs_test_opt(root, SPACE_CACHE) && |
6c41761f | 7640 | btrfs_super_generation(root->fs_info->super_copy) != cache_gen) |
0af3d00b | 7641 | need_clear = 1; |
88c2ba3b JB |
7642 | if (btrfs_test_opt(root, CLEAR_CACHE)) |
7643 | need_clear = 1; | |
0af3d00b | 7644 | |
d397712b | 7645 | while (1) { |
0b86a832 | 7646 | ret = find_first_block_group(root, path, &key); |
b742bb82 YZ |
7647 | if (ret > 0) |
7648 | break; | |
0b86a832 CM |
7649 | if (ret != 0) |
7650 | goto error; | |
5f39d397 CM |
7651 | leaf = path->nodes[0]; |
7652 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
8f18cf13 | 7653 | cache = kzalloc(sizeof(*cache), GFP_NOFS); |
9078a3e1 | 7654 | if (!cache) { |
0b86a832 | 7655 | ret = -ENOMEM; |
f0486c68 | 7656 | goto error; |
9078a3e1 | 7657 | } |
34d52cb6 LZ |
7658 | cache->free_space_ctl = kzalloc(sizeof(*cache->free_space_ctl), |
7659 | GFP_NOFS); | |
7660 | if (!cache->free_space_ctl) { | |
7661 | kfree(cache); | |
7662 | ret = -ENOMEM; | |
7663 | goto error; | |
7664 | } | |
3e1ad54f | 7665 | |
d2fb3437 | 7666 | atomic_set(&cache->count, 1); |
c286ac48 | 7667 | spin_lock_init(&cache->lock); |
817d52f8 | 7668 | cache->fs_info = info; |
0f9dd46c | 7669 | INIT_LIST_HEAD(&cache->list); |
fa9c0d79 | 7670 | INIT_LIST_HEAD(&cache->cluster_list); |
96303081 | 7671 | |
cf7c1ef6 LB |
7672 | if (need_clear) { |
7673 | /* | |
7674 | * When we mount with old space cache, we need to | |
7675 | * set BTRFS_DC_CLEAR and set dirty flag. | |
7676 | * | |
7677 | * a) Setting 'BTRFS_DC_CLEAR' makes sure that we | |
7678 | * truncate the old free space cache inode and | |
7679 | * setup a new one. | |
7680 | * b) Setting 'dirty flag' makes sure that we flush | |
7681 | * the new space cache info onto disk. | |
7682 | */ | |
0af3d00b | 7683 | cache->disk_cache_state = BTRFS_DC_CLEAR; |
cf7c1ef6 LB |
7684 | if (btrfs_test_opt(root, SPACE_CACHE)) |
7685 | cache->dirty = 1; | |
7686 | } | |
0af3d00b | 7687 | |
5f39d397 CM |
7688 | read_extent_buffer(leaf, &cache->item, |
7689 | btrfs_item_ptr_offset(leaf, path->slots[0]), | |
7690 | sizeof(cache->item)); | |
9078a3e1 | 7691 | memcpy(&cache->key, &found_key, sizeof(found_key)); |
0b86a832 | 7692 | |
9078a3e1 | 7693 | key.objectid = found_key.objectid + found_key.offset; |
b3b4aa74 | 7694 | btrfs_release_path(path); |
0b86a832 | 7695 | cache->flags = btrfs_block_group_flags(&cache->item); |
817d52f8 JB |
7696 | cache->sectorsize = root->sectorsize; |
7697 | ||
34d52cb6 LZ |
7698 | btrfs_init_free_space_ctl(cache); |
7699 | ||
3c14874a JB |
7700 | /* |
7701 | * We need to exclude the super stripes now so that the space | |
7702 | * info has super bytes accounted for, otherwise we'll think | |
7703 | * we have more space than we actually do. | |
7704 | */ | |
7705 | exclude_super_stripes(root, cache); | |
7706 | ||
817d52f8 JB |
7707 | /* |
7708 | * check for two cases, either we are full, and therefore | |
7709 | * don't need to bother with the caching work since we won't | |
7710 | * find any space, or we are empty, and we can just add all | |
7711 | * the space in and be done with it. This saves us _alot_ of | |
7712 | * time, particularly in the full case. | |
7713 | */ | |
7714 | if (found_key.offset == btrfs_block_group_used(&cache->item)) { | |
11833d66 | 7715 | cache->last_byte_to_unpin = (u64)-1; |
817d52f8 | 7716 | cache->cached = BTRFS_CACHE_FINISHED; |
1b2da372 | 7717 | free_excluded_extents(root, cache); |
817d52f8 | 7718 | } else if (btrfs_block_group_used(&cache->item) == 0) { |
11833d66 | 7719 | cache->last_byte_to_unpin = (u64)-1; |
817d52f8 JB |
7720 | cache->cached = BTRFS_CACHE_FINISHED; |
7721 | add_new_free_space(cache, root->fs_info, | |
7722 | found_key.objectid, | |
7723 | found_key.objectid + | |
7724 | found_key.offset); | |
11833d66 | 7725 | free_excluded_extents(root, cache); |
817d52f8 | 7726 | } |
96b5179d | 7727 | |
6324fbf3 CM |
7728 | ret = update_space_info(info, cache->flags, found_key.offset, |
7729 | btrfs_block_group_used(&cache->item), | |
7730 | &space_info); | |
79787eaa | 7731 | BUG_ON(ret); /* -ENOMEM */ |
6324fbf3 | 7732 | cache->space_info = space_info; |
1b2da372 | 7733 | spin_lock(&cache->space_info->lock); |
f0486c68 | 7734 | cache->space_info->bytes_readonly += cache->bytes_super; |
1b2da372 JB |
7735 | spin_unlock(&cache->space_info->lock); |
7736 | ||
b742bb82 | 7737 | __link_block_group(space_info, cache); |
0f9dd46c JB |
7738 | |
7739 | ret = btrfs_add_block_group_cache(root->fs_info, cache); | |
79787eaa | 7740 | BUG_ON(ret); /* Logic error */ |
75ccf47d CM |
7741 | |
7742 | set_avail_alloc_bits(root->fs_info, cache->flags); | |
2b82032c | 7743 | if (btrfs_chunk_readonly(root, cache->key.objectid)) |
199c36ea | 7744 | set_block_group_ro(cache, 1); |
9078a3e1 | 7745 | } |
b742bb82 YZ |
7746 | |
7747 | list_for_each_entry_rcu(space_info, &root->fs_info->space_info, list) { | |
7748 | if (!(get_alloc_profile(root, space_info->flags) & | |
7749 | (BTRFS_BLOCK_GROUP_RAID10 | | |
7750 | BTRFS_BLOCK_GROUP_RAID1 | | |
7751 | BTRFS_BLOCK_GROUP_DUP))) | |
7752 | continue; | |
7753 | /* | |
7754 | * avoid allocating from un-mirrored block group if there are | |
7755 | * mirrored block groups. | |
7756 | */ | |
7757 | list_for_each_entry(cache, &space_info->block_groups[3], list) | |
199c36ea | 7758 | set_block_group_ro(cache, 1); |
b742bb82 | 7759 | list_for_each_entry(cache, &space_info->block_groups[4], list) |
199c36ea | 7760 | set_block_group_ro(cache, 1); |
9078a3e1 | 7761 | } |
f0486c68 YZ |
7762 | |
7763 | init_global_block_rsv(info); | |
0b86a832 CM |
7764 | ret = 0; |
7765 | error: | |
9078a3e1 | 7766 | btrfs_free_path(path); |
0b86a832 | 7767 | return ret; |
9078a3e1 | 7768 | } |
6324fbf3 | 7769 | |
ea658bad JB |
7770 | void btrfs_create_pending_block_groups(struct btrfs_trans_handle *trans, |
7771 | struct btrfs_root *root) | |
7772 | { | |
7773 | struct btrfs_block_group_cache *block_group, *tmp; | |
7774 | struct btrfs_root *extent_root = root->fs_info->extent_root; | |
7775 | struct btrfs_block_group_item item; | |
7776 | struct btrfs_key key; | |
7777 | int ret = 0; | |
7778 | ||
7779 | list_for_each_entry_safe(block_group, tmp, &trans->new_bgs, | |
7780 | new_bg_list) { | |
7781 | list_del_init(&block_group->new_bg_list); | |
7782 | ||
7783 | if (ret) | |
7784 | continue; | |
7785 | ||
7786 | spin_lock(&block_group->lock); | |
7787 | memcpy(&item, &block_group->item, sizeof(item)); | |
7788 | memcpy(&key, &block_group->key, sizeof(key)); | |
7789 | spin_unlock(&block_group->lock); | |
7790 | ||
7791 | ret = btrfs_insert_item(trans, extent_root, &key, &item, | |
7792 | sizeof(item)); | |
7793 | if (ret) | |
7794 | btrfs_abort_transaction(trans, extent_root, ret); | |
7795 | } | |
7796 | } | |
7797 | ||
6324fbf3 CM |
7798 | int btrfs_make_block_group(struct btrfs_trans_handle *trans, |
7799 | struct btrfs_root *root, u64 bytes_used, | |
e17cade2 | 7800 | u64 type, u64 chunk_objectid, u64 chunk_offset, |
6324fbf3 CM |
7801 | u64 size) |
7802 | { | |
7803 | int ret; | |
6324fbf3 CM |
7804 | struct btrfs_root *extent_root; |
7805 | struct btrfs_block_group_cache *cache; | |
6324fbf3 CM |
7806 | |
7807 | extent_root = root->fs_info->extent_root; | |
6324fbf3 | 7808 | |
12fcfd22 | 7809 | root->fs_info->last_trans_log_full_commit = trans->transid; |
e02119d5 | 7810 | |
8f18cf13 | 7811 | cache = kzalloc(sizeof(*cache), GFP_NOFS); |
0f9dd46c JB |
7812 | if (!cache) |
7813 | return -ENOMEM; | |
34d52cb6 LZ |
7814 | cache->free_space_ctl = kzalloc(sizeof(*cache->free_space_ctl), |
7815 | GFP_NOFS); | |
7816 | if (!cache->free_space_ctl) { | |
7817 | kfree(cache); | |
7818 | return -ENOMEM; | |
7819 | } | |
0f9dd46c | 7820 | |
e17cade2 | 7821 | cache->key.objectid = chunk_offset; |
6324fbf3 | 7822 | cache->key.offset = size; |
d2fb3437 | 7823 | cache->key.type = BTRFS_BLOCK_GROUP_ITEM_KEY; |
96303081 | 7824 | cache->sectorsize = root->sectorsize; |
0af3d00b | 7825 | cache->fs_info = root->fs_info; |
96303081 | 7826 | |
d2fb3437 | 7827 | atomic_set(&cache->count, 1); |
c286ac48 | 7828 | spin_lock_init(&cache->lock); |
0f9dd46c | 7829 | INIT_LIST_HEAD(&cache->list); |
fa9c0d79 | 7830 | INIT_LIST_HEAD(&cache->cluster_list); |
ea658bad | 7831 | INIT_LIST_HEAD(&cache->new_bg_list); |
0ef3e66b | 7832 | |
34d52cb6 LZ |
7833 | btrfs_init_free_space_ctl(cache); |
7834 | ||
6324fbf3 | 7835 | btrfs_set_block_group_used(&cache->item, bytes_used); |
6324fbf3 CM |
7836 | btrfs_set_block_group_chunk_objectid(&cache->item, chunk_objectid); |
7837 | cache->flags = type; | |
7838 | btrfs_set_block_group_flags(&cache->item, type); | |
7839 | ||
11833d66 | 7840 | cache->last_byte_to_unpin = (u64)-1; |
817d52f8 | 7841 | cache->cached = BTRFS_CACHE_FINISHED; |
11833d66 | 7842 | exclude_super_stripes(root, cache); |
96303081 | 7843 | |
817d52f8 JB |
7844 | add_new_free_space(cache, root->fs_info, chunk_offset, |
7845 | chunk_offset + size); | |
7846 | ||
11833d66 YZ |
7847 | free_excluded_extents(root, cache); |
7848 | ||
6324fbf3 CM |
7849 | ret = update_space_info(root->fs_info, cache->flags, size, bytes_used, |
7850 | &cache->space_info); | |
79787eaa | 7851 | BUG_ON(ret); /* -ENOMEM */ |
c7c144db | 7852 | update_global_block_rsv(root->fs_info); |
1b2da372 JB |
7853 | |
7854 | spin_lock(&cache->space_info->lock); | |
f0486c68 | 7855 | cache->space_info->bytes_readonly += cache->bytes_super; |
1b2da372 JB |
7856 | spin_unlock(&cache->space_info->lock); |
7857 | ||
b742bb82 | 7858 | __link_block_group(cache->space_info, cache); |
6324fbf3 | 7859 | |
0f9dd46c | 7860 | ret = btrfs_add_block_group_cache(root->fs_info, cache); |
79787eaa | 7861 | BUG_ON(ret); /* Logic error */ |
c286ac48 | 7862 | |
ea658bad | 7863 | list_add_tail(&cache->new_bg_list, &trans->new_bgs); |
6324fbf3 | 7864 | |
d18a2c44 | 7865 | set_avail_alloc_bits(extent_root->fs_info, type); |
925baedd | 7866 | |
6324fbf3 CM |
7867 | return 0; |
7868 | } | |
1a40e23b | 7869 | |
10ea00f5 ID |
7870 | static void clear_avail_alloc_bits(struct btrfs_fs_info *fs_info, u64 flags) |
7871 | { | |
899c81ea ID |
7872 | u64 extra_flags = chunk_to_extended(flags) & |
7873 | BTRFS_EXTENDED_PROFILE_MASK; | |
10ea00f5 ID |
7874 | |
7875 | if (flags & BTRFS_BLOCK_GROUP_DATA) | |
7876 | fs_info->avail_data_alloc_bits &= ~extra_flags; | |
7877 | if (flags & BTRFS_BLOCK_GROUP_METADATA) | |
7878 | fs_info->avail_metadata_alloc_bits &= ~extra_flags; | |
7879 | if (flags & BTRFS_BLOCK_GROUP_SYSTEM) | |
7880 | fs_info->avail_system_alloc_bits &= ~extra_flags; | |
7881 | } | |
7882 | ||
1a40e23b ZY |
7883 | int btrfs_remove_block_group(struct btrfs_trans_handle *trans, |
7884 | struct btrfs_root *root, u64 group_start) | |
7885 | { | |
7886 | struct btrfs_path *path; | |
7887 | struct btrfs_block_group_cache *block_group; | |
44fb5511 | 7888 | struct btrfs_free_cluster *cluster; |
0af3d00b | 7889 | struct btrfs_root *tree_root = root->fs_info->tree_root; |
1a40e23b | 7890 | struct btrfs_key key; |
0af3d00b | 7891 | struct inode *inode; |
1a40e23b | 7892 | int ret; |
10ea00f5 | 7893 | int index; |
89a55897 | 7894 | int factor; |
1a40e23b | 7895 | |
1a40e23b ZY |
7896 | root = root->fs_info->extent_root; |
7897 | ||
7898 | block_group = btrfs_lookup_block_group(root->fs_info, group_start); | |
7899 | BUG_ON(!block_group); | |
c146afad | 7900 | BUG_ON(!block_group->ro); |
1a40e23b | 7901 | |
9f7c43c9 | 7902 | /* |
7903 | * Free the reserved super bytes from this block group before | |
7904 | * remove it. | |
7905 | */ | |
7906 | free_excluded_extents(root, block_group); | |
7907 | ||
1a40e23b | 7908 | memcpy(&key, &block_group->key, sizeof(key)); |
10ea00f5 | 7909 | index = get_block_group_index(block_group); |
89a55897 JB |
7910 | if (block_group->flags & (BTRFS_BLOCK_GROUP_DUP | |
7911 | BTRFS_BLOCK_GROUP_RAID1 | | |
7912 | BTRFS_BLOCK_GROUP_RAID10)) | |
7913 | factor = 2; | |
7914 | else | |
7915 | factor = 1; | |
1a40e23b | 7916 | |
44fb5511 CM |
7917 | /* make sure this block group isn't part of an allocation cluster */ |
7918 | cluster = &root->fs_info->data_alloc_cluster; | |
7919 | spin_lock(&cluster->refill_lock); | |
7920 | btrfs_return_cluster_to_free_space(block_group, cluster); | |
7921 | spin_unlock(&cluster->refill_lock); | |
7922 | ||
7923 | /* | |
7924 | * make sure this block group isn't part of a metadata | |
7925 | * allocation cluster | |
7926 | */ | |
7927 | cluster = &root->fs_info->meta_alloc_cluster; | |
7928 | spin_lock(&cluster->refill_lock); | |
7929 | btrfs_return_cluster_to_free_space(block_group, cluster); | |
7930 | spin_unlock(&cluster->refill_lock); | |
7931 | ||
1a40e23b | 7932 | path = btrfs_alloc_path(); |
d8926bb3 MF |
7933 | if (!path) { |
7934 | ret = -ENOMEM; | |
7935 | goto out; | |
7936 | } | |
1a40e23b | 7937 | |
10b2f34d | 7938 | inode = lookup_free_space_inode(tree_root, block_group, path); |
0af3d00b | 7939 | if (!IS_ERR(inode)) { |
b532402e | 7940 | ret = btrfs_orphan_add(trans, inode); |
79787eaa JM |
7941 | if (ret) { |
7942 | btrfs_add_delayed_iput(inode); | |
7943 | goto out; | |
7944 | } | |
0af3d00b JB |
7945 | clear_nlink(inode); |
7946 | /* One for the block groups ref */ | |
7947 | spin_lock(&block_group->lock); | |
7948 | if (block_group->iref) { | |
7949 | block_group->iref = 0; | |
7950 | block_group->inode = NULL; | |
7951 | spin_unlock(&block_group->lock); | |
7952 | iput(inode); | |
7953 | } else { | |
7954 | spin_unlock(&block_group->lock); | |
7955 | } | |
7956 | /* One for our lookup ref */ | |
455757c3 | 7957 | btrfs_add_delayed_iput(inode); |
0af3d00b JB |
7958 | } |
7959 | ||
7960 | key.objectid = BTRFS_FREE_SPACE_OBJECTID; | |
7961 | key.offset = block_group->key.objectid; | |
7962 | key.type = 0; | |
7963 | ||
7964 | ret = btrfs_search_slot(trans, tree_root, &key, path, -1, 1); | |
7965 | if (ret < 0) | |
7966 | goto out; | |
7967 | if (ret > 0) | |
b3b4aa74 | 7968 | btrfs_release_path(path); |
0af3d00b JB |
7969 | if (ret == 0) { |
7970 | ret = btrfs_del_item(trans, tree_root, path); | |
7971 | if (ret) | |
7972 | goto out; | |
b3b4aa74 | 7973 | btrfs_release_path(path); |
0af3d00b JB |
7974 | } |
7975 | ||
3dfdb934 | 7976 | spin_lock(&root->fs_info->block_group_cache_lock); |
1a40e23b ZY |
7977 | rb_erase(&block_group->cache_node, |
7978 | &root->fs_info->block_group_cache_tree); | |
3dfdb934 | 7979 | spin_unlock(&root->fs_info->block_group_cache_lock); |
817d52f8 | 7980 | |
80eb234a | 7981 | down_write(&block_group->space_info->groups_sem); |
44fb5511 CM |
7982 | /* |
7983 | * we must use list_del_init so people can check to see if they | |
7984 | * are still on the list after taking the semaphore | |
7985 | */ | |
7986 | list_del_init(&block_group->list); | |
10ea00f5 ID |
7987 | if (list_empty(&block_group->space_info->block_groups[index])) |
7988 | clear_avail_alloc_bits(root->fs_info, block_group->flags); | |
80eb234a | 7989 | up_write(&block_group->space_info->groups_sem); |
1a40e23b | 7990 | |
817d52f8 | 7991 | if (block_group->cached == BTRFS_CACHE_STARTED) |
11833d66 | 7992 | wait_block_group_cache_done(block_group); |
817d52f8 JB |
7993 | |
7994 | btrfs_remove_free_space_cache(block_group); | |
7995 | ||
c146afad YZ |
7996 | spin_lock(&block_group->space_info->lock); |
7997 | block_group->space_info->total_bytes -= block_group->key.offset; | |
7998 | block_group->space_info->bytes_readonly -= block_group->key.offset; | |
89a55897 | 7999 | block_group->space_info->disk_total -= block_group->key.offset * factor; |
c146afad | 8000 | spin_unlock(&block_group->space_info->lock); |
283bb197 | 8001 | |
0af3d00b JB |
8002 | memcpy(&key, &block_group->key, sizeof(key)); |
8003 | ||
283bb197 | 8004 | btrfs_clear_space_info_full(root->fs_info); |
c146afad | 8005 | |
fa9c0d79 CM |
8006 | btrfs_put_block_group(block_group); |
8007 | btrfs_put_block_group(block_group); | |
1a40e23b ZY |
8008 | |
8009 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); | |
8010 | if (ret > 0) | |
8011 | ret = -EIO; | |
8012 | if (ret < 0) | |
8013 | goto out; | |
8014 | ||
8015 | ret = btrfs_del_item(trans, root, path); | |
8016 | out: | |
8017 | btrfs_free_path(path); | |
8018 | return ret; | |
8019 | } | |
acce952b | 8020 | |
c59021f8 | 8021 | int btrfs_init_space_info(struct btrfs_fs_info *fs_info) |
8022 | { | |
8023 | struct btrfs_space_info *space_info; | |
1aba86d6 | 8024 | struct btrfs_super_block *disk_super; |
8025 | u64 features; | |
8026 | u64 flags; | |
8027 | int mixed = 0; | |
c59021f8 | 8028 | int ret; |
8029 | ||
6c41761f | 8030 | disk_super = fs_info->super_copy; |
1aba86d6 | 8031 | if (!btrfs_super_root(disk_super)) |
8032 | return 1; | |
c59021f8 | 8033 | |
1aba86d6 | 8034 | features = btrfs_super_incompat_flags(disk_super); |
8035 | if (features & BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS) | |
8036 | mixed = 1; | |
c59021f8 | 8037 | |
1aba86d6 | 8038 | flags = BTRFS_BLOCK_GROUP_SYSTEM; |
8039 | ret = update_space_info(fs_info, flags, 0, 0, &space_info); | |
c59021f8 | 8040 | if (ret) |
1aba86d6 | 8041 | goto out; |
c59021f8 | 8042 | |
1aba86d6 | 8043 | if (mixed) { |
8044 | flags = BTRFS_BLOCK_GROUP_METADATA | BTRFS_BLOCK_GROUP_DATA; | |
8045 | ret = update_space_info(fs_info, flags, 0, 0, &space_info); | |
8046 | } else { | |
8047 | flags = BTRFS_BLOCK_GROUP_METADATA; | |
8048 | ret = update_space_info(fs_info, flags, 0, 0, &space_info); | |
8049 | if (ret) | |
8050 | goto out; | |
8051 | ||
8052 | flags = BTRFS_BLOCK_GROUP_DATA; | |
8053 | ret = update_space_info(fs_info, flags, 0, 0, &space_info); | |
8054 | } | |
8055 | out: | |
c59021f8 | 8056 | return ret; |
8057 | } | |
8058 | ||
acce952b | 8059 | int btrfs_error_unpin_extent_range(struct btrfs_root *root, u64 start, u64 end) |
8060 | { | |
8061 | return unpin_extent_range(root, start, end); | |
8062 | } | |
8063 | ||
8064 | int btrfs_error_discard_extent(struct btrfs_root *root, u64 bytenr, | |
5378e607 | 8065 | u64 num_bytes, u64 *actual_bytes) |
acce952b | 8066 | { |
5378e607 | 8067 | return btrfs_discard_extent(root, bytenr, num_bytes, actual_bytes); |
acce952b | 8068 | } |
f7039b1d LD |
8069 | |
8070 | int btrfs_trim_fs(struct btrfs_root *root, struct fstrim_range *range) | |
8071 | { | |
8072 | struct btrfs_fs_info *fs_info = root->fs_info; | |
8073 | struct btrfs_block_group_cache *cache = NULL; | |
8074 | u64 group_trimmed; | |
8075 | u64 start; | |
8076 | u64 end; | |
8077 | u64 trimmed = 0; | |
2cac13e4 | 8078 | u64 total_bytes = btrfs_super_total_bytes(fs_info->super_copy); |
f7039b1d LD |
8079 | int ret = 0; |
8080 | ||
2cac13e4 LB |
8081 | /* |
8082 | * try to trim all FS space, our block group may start from non-zero. | |
8083 | */ | |
8084 | if (range->len == total_bytes) | |
8085 | cache = btrfs_lookup_first_block_group(fs_info, range->start); | |
8086 | else | |
8087 | cache = btrfs_lookup_block_group(fs_info, range->start); | |
f7039b1d LD |
8088 | |
8089 | while (cache) { | |
8090 | if (cache->key.objectid >= (range->start + range->len)) { | |
8091 | btrfs_put_block_group(cache); | |
8092 | break; | |
8093 | } | |
8094 | ||
8095 | start = max(range->start, cache->key.objectid); | |
8096 | end = min(range->start + range->len, | |
8097 | cache->key.objectid + cache->key.offset); | |
8098 | ||
8099 | if (end - start >= range->minlen) { | |
8100 | if (!block_group_cache_done(cache)) { | |
8101 | ret = cache_block_group(cache, NULL, root, 0); | |
8102 | if (!ret) | |
8103 | wait_block_group_cache_done(cache); | |
8104 | } | |
8105 | ret = btrfs_trim_block_group(cache, | |
8106 | &group_trimmed, | |
8107 | start, | |
8108 | end, | |
8109 | range->minlen); | |
8110 | ||
8111 | trimmed += group_trimmed; | |
8112 | if (ret) { | |
8113 | btrfs_put_block_group(cache); | |
8114 | break; | |
8115 | } | |
8116 | } | |
8117 | ||
8118 | cache = next_block_group(fs_info->tree_root, cache); | |
8119 | } | |
8120 | ||
8121 | range->len = trimmed; | |
8122 | return ret; | |
8123 | } |