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