Commit | Line | Data |
---|---|---|
280c2908 JB |
1 | // SPDX-License-Identifier: GPL-2.0 |
2 | ||
784352fe | 3 | #include "misc.h" |
280c2908 JB |
4 | #include "ctree.h" |
5 | #include "space-info.h" | |
6 | #include "sysfs.h" | |
7 | #include "volumes.h" | |
5da6afeb | 8 | #include "free-space-cache.h" |
0d9764f6 JB |
9 | #include "ordered-data.h" |
10 | #include "transaction.h" | |
aac0023c | 11 | #include "block-group.h" |
b0931513 | 12 | #include "zoned.h" |
c7f13d42 | 13 | #include "fs.h" |
07e81dc9 | 14 | #include "accessors.h" |
a0231804 | 15 | #include "extent-tree.h" |
280c2908 | 16 | |
4b8b0528 JB |
17 | /* |
18 | * HOW DOES SPACE RESERVATION WORK | |
19 | * | |
20 | * If you want to know about delalloc specifically, there is a separate comment | |
21 | * for that with the delalloc code. This comment is about how the whole system | |
22 | * works generally. | |
23 | * | |
24 | * BASIC CONCEPTS | |
25 | * | |
26 | * 1) space_info. This is the ultimate arbiter of how much space we can use. | |
27 | * There's a description of the bytes_ fields with the struct declaration, | |
28 | * refer to that for specifics on each field. Suffice it to say that for | |
29 | * reservations we care about total_bytes - SUM(space_info->bytes_) when | |
30 | * determining if there is space to make an allocation. There is a space_info | |
31 | * for METADATA, SYSTEM, and DATA areas. | |
32 | * | |
33 | * 2) block_rsv's. These are basically buckets for every different type of | |
34 | * metadata reservation we have. You can see the comment in the block_rsv | |
35 | * code on the rules for each type, but generally block_rsv->reserved is how | |
36 | * much space is accounted for in space_info->bytes_may_use. | |
37 | * | |
38 | * 3) btrfs_calc*_size. These are the worst case calculations we used based | |
39 | * on the number of items we will want to modify. We have one for changing | |
40 | * items, and one for inserting new items. Generally we use these helpers to | |
41 | * determine the size of the block reserves, and then use the actual bytes | |
42 | * values to adjust the space_info counters. | |
43 | * | |
44 | * MAKING RESERVATIONS, THE NORMAL CASE | |
45 | * | |
46 | * We call into either btrfs_reserve_data_bytes() or | |
47 | * btrfs_reserve_metadata_bytes(), depending on which we're looking for, with | |
48 | * num_bytes we want to reserve. | |
49 | * | |
50 | * ->reserve | |
51 | * space_info->bytes_may_reserve += num_bytes | |
52 | * | |
53 | * ->extent allocation | |
54 | * Call btrfs_add_reserved_bytes() which does | |
55 | * space_info->bytes_may_reserve -= num_bytes | |
56 | * space_info->bytes_reserved += extent_bytes | |
57 | * | |
58 | * ->insert reference | |
59 | * Call btrfs_update_block_group() which does | |
60 | * space_info->bytes_reserved -= extent_bytes | |
61 | * space_info->bytes_used += extent_bytes | |
62 | * | |
63 | * MAKING RESERVATIONS, FLUSHING NORMALLY (non-priority) | |
64 | * | |
65 | * Assume we are unable to simply make the reservation because we do not have | |
66 | * enough space | |
67 | * | |
68 | * -> __reserve_bytes | |
69 | * create a reserve_ticket with ->bytes set to our reservation, add it to | |
70 | * the tail of space_info->tickets, kick async flush thread | |
71 | * | |
72 | * ->handle_reserve_ticket | |
73 | * wait on ticket->wait for ->bytes to be reduced to 0, or ->error to be set | |
74 | * on the ticket. | |
75 | * | |
76 | * -> btrfs_async_reclaim_metadata_space/btrfs_async_reclaim_data_space | |
77 | * Flushes various things attempting to free up space. | |
78 | * | |
79 | * -> btrfs_try_granting_tickets() | |
80 | * This is called by anything that either subtracts space from | |
81 | * space_info->bytes_may_use, ->bytes_pinned, etc, or adds to the | |
82 | * space_info->total_bytes. This loops through the ->priority_tickets and | |
83 | * then the ->tickets list checking to see if the reservation can be | |
84 | * completed. If it can the space is added to space_info->bytes_may_use and | |
85 | * the ticket is woken up. | |
86 | * | |
87 | * -> ticket wakeup | |
88 | * Check if ->bytes == 0, if it does we got our reservation and we can carry | |
89 | * on, if not return the appropriate error (ENOSPC, but can be EINTR if we | |
90 | * were interrupted.) | |
91 | * | |
92 | * MAKING RESERVATIONS, FLUSHING HIGH PRIORITY | |
93 | * | |
94 | * Same as the above, except we add ourselves to the | |
95 | * space_info->priority_tickets, and we do not use ticket->wait, we simply | |
96 | * call flush_space() ourselves for the states that are safe for us to call | |
97 | * without deadlocking and hope for the best. | |
98 | * | |
99 | * THE FLUSHING STATES | |
100 | * | |
101 | * Generally speaking we will have two cases for each state, a "nice" state | |
102 | * and a "ALL THE THINGS" state. In btrfs we delay a lot of work in order to | |
103 | * reduce the locking over head on the various trees, and even to keep from | |
104 | * doing any work at all in the case of delayed refs. Each of these delayed | |
105 | * things however hold reservations, and so letting them run allows us to | |
106 | * reclaim space so we can make new reservations. | |
107 | * | |
108 | * FLUSH_DELAYED_ITEMS | |
109 | * Every inode has a delayed item to update the inode. Take a simple write | |
110 | * for example, we would update the inode item at write time to update the | |
111 | * mtime, and then again at finish_ordered_io() time in order to update the | |
112 | * isize or bytes. We keep these delayed items to coalesce these operations | |
113 | * into a single operation done on demand. These are an easy way to reclaim | |
114 | * metadata space. | |
115 | * | |
116 | * FLUSH_DELALLOC | |
117 | * Look at the delalloc comment to get an idea of how much space is reserved | |
118 | * for delayed allocation. We can reclaim some of this space simply by | |
119 | * running delalloc, but usually we need to wait for ordered extents to | |
120 | * reclaim the bulk of this space. | |
121 | * | |
122 | * FLUSH_DELAYED_REFS | |
123 | * We have a block reserve for the outstanding delayed refs space, and every | |
124 | * delayed ref operation holds a reservation. Running these is a quick way | |
125 | * to reclaim space, but we want to hold this until the end because COW can | |
126 | * churn a lot and we can avoid making some extent tree modifications if we | |
127 | * are able to delay for as long as possible. | |
128 | * | |
129 | * ALLOC_CHUNK | |
130 | * We will skip this the first time through space reservation, because of | |
131 | * overcommit and we don't want to have a lot of useless metadata space when | |
132 | * our worst case reservations will likely never come true. | |
133 | * | |
134 | * RUN_DELAYED_IPUTS | |
135 | * If we're freeing inodes we're likely freeing checksums, file extent | |
136 | * items, and extent tree items. Loads of space could be freed up by these | |
137 | * operations, however they won't be usable until the transaction commits. | |
138 | * | |
139 | * COMMIT_TRANS | |
c416a30c JB |
140 | * This will commit the transaction. Historically we had a lot of logic |
141 | * surrounding whether or not we'd commit the transaction, but this waits born | |
142 | * out of a pre-tickets era where we could end up committing the transaction | |
143 | * thousands of times in a row without making progress. Now thanks to our | |
144 | * ticketing system we know if we're not making progress and can error | |
145 | * everybody out after a few commits rather than burning the disk hoping for | |
146 | * a different answer. | |
f00c42dd | 147 | * |
4b8b0528 JB |
148 | * OVERCOMMIT |
149 | * | |
150 | * Because we hold so many reservations for metadata we will allow you to | |
151 | * reserve more space than is currently free in the currently allocate | |
152 | * metadata space. This only happens with metadata, data does not allow | |
153 | * overcommitting. | |
154 | * | |
155 | * You can see the current logic for when we allow overcommit in | |
156 | * btrfs_can_overcommit(), but it only applies to unallocated space. If there | |
157 | * is no unallocated space to be had, all reservations are kept within the | |
158 | * free space in the allocated metadata chunks. | |
159 | * | |
160 | * Because of overcommitting, you generally want to use the | |
161 | * btrfs_can_overcommit() logic for metadata allocations, as it does the right | |
162 | * thing with or without extra unallocated space. | |
163 | */ | |
164 | ||
e1f60a65 | 165 | u64 __pure btrfs_space_info_used(struct btrfs_space_info *s_info, |
280c2908 JB |
166 | bool may_use_included) |
167 | { | |
168 | ASSERT(s_info); | |
169 | return s_info->bytes_used + s_info->bytes_reserved + | |
170 | s_info->bytes_pinned + s_info->bytes_readonly + | |
169e0da9 | 171 | s_info->bytes_zone_unusable + |
280c2908 JB |
172 | (may_use_included ? s_info->bytes_may_use : 0); |
173 | } | |
174 | ||
175 | /* | |
176 | * after adding space to the filesystem, we need to clear the full flags | |
177 | * on all the space infos. | |
178 | */ | |
179 | void btrfs_clear_space_info_full(struct btrfs_fs_info *info) | |
180 | { | |
181 | struct list_head *head = &info->space_info; | |
182 | struct btrfs_space_info *found; | |
183 | ||
72804905 | 184 | list_for_each_entry(found, head, list) |
280c2908 | 185 | found->full = 0; |
280c2908 JB |
186 | } |
187 | ||
bb5a098d JB |
188 | /* |
189 | * Block groups with more than this value (percents) of unusable space will be | |
190 | * scheduled for background reclaim. | |
191 | */ | |
192 | #define BTRFS_DEFAULT_ZONED_RECLAIM_THRESH (75) | |
193 | ||
f6fca391 SR |
194 | /* |
195 | * Calculate chunk size depending on volume type (regular or zoned). | |
196 | */ | |
197 | static u64 calc_chunk_size(const struct btrfs_fs_info *fs_info, u64 flags) | |
198 | { | |
199 | if (btrfs_is_zoned(fs_info)) | |
200 | return fs_info->zone_size; | |
201 | ||
202 | ASSERT(flags & BTRFS_BLOCK_GROUP_TYPE_MASK); | |
203 | ||
204 | if (flags & BTRFS_BLOCK_GROUP_DATA) | |
5da431b7 | 205 | return BTRFS_MAX_DATA_CHUNK_SIZE; |
f6fca391 SR |
206 | else if (flags & BTRFS_BLOCK_GROUP_SYSTEM) |
207 | return SZ_32M; | |
208 | ||
209 | /* Handle BTRFS_BLOCK_GROUP_METADATA */ | |
210 | if (fs_info->fs_devices->total_rw_bytes > 50ULL * SZ_1G) | |
211 | return SZ_1G; | |
212 | ||
213 | return SZ_256M; | |
214 | } | |
215 | ||
216 | /* | |
217 | * Update default chunk size. | |
218 | */ | |
219 | void btrfs_update_space_info_chunk_size(struct btrfs_space_info *space_info, | |
220 | u64 chunk_size) | |
221 | { | |
222 | WRITE_ONCE(space_info->chunk_size, chunk_size); | |
223 | } | |
224 | ||
280c2908 JB |
225 | static int create_space_info(struct btrfs_fs_info *info, u64 flags) |
226 | { | |
227 | ||
228 | struct btrfs_space_info *space_info; | |
229 | int i; | |
230 | int ret; | |
231 | ||
232 | space_info = kzalloc(sizeof(*space_info), GFP_NOFS); | |
233 | if (!space_info) | |
234 | return -ENOMEM; | |
235 | ||
280c2908 JB |
236 | for (i = 0; i < BTRFS_NR_RAID_TYPES; i++) |
237 | INIT_LIST_HEAD(&space_info->block_groups[i]); | |
238 | init_rwsem(&space_info->groups_sem); | |
239 | spin_lock_init(&space_info->lock); | |
240 | space_info->flags = flags & BTRFS_BLOCK_GROUP_TYPE_MASK; | |
241 | space_info->force_alloc = CHUNK_ALLOC_NO_FORCE; | |
280c2908 JB |
242 | INIT_LIST_HEAD(&space_info->ro_bgs); |
243 | INIT_LIST_HEAD(&space_info->tickets); | |
244 | INIT_LIST_HEAD(&space_info->priority_tickets); | |
88a777a6 | 245 | space_info->clamp = 1; |
f6fca391 | 246 | btrfs_update_space_info_chunk_size(space_info, calc_chunk_size(info, flags)); |
280c2908 | 247 | |
bb5a098d JB |
248 | if (btrfs_is_zoned(info)) |
249 | space_info->bg_reclaim_threshold = BTRFS_DEFAULT_ZONED_RECLAIM_THRESH; | |
250 | ||
b882327a DS |
251 | ret = btrfs_sysfs_add_space_info_type(info, space_info); |
252 | if (ret) | |
280c2908 | 253 | return ret; |
280c2908 | 254 | |
72804905 | 255 | list_add(&space_info->list, &info->space_info); |
280c2908 JB |
256 | if (flags & BTRFS_BLOCK_GROUP_DATA) |
257 | info->data_sinfo = space_info; | |
258 | ||
259 | return ret; | |
260 | } | |
261 | ||
262 | int btrfs_init_space_info(struct btrfs_fs_info *fs_info) | |
263 | { | |
264 | struct btrfs_super_block *disk_super; | |
265 | u64 features; | |
266 | u64 flags; | |
267 | int mixed = 0; | |
268 | int ret; | |
269 | ||
270 | disk_super = fs_info->super_copy; | |
271 | if (!btrfs_super_root(disk_super)) | |
272 | return -EINVAL; | |
273 | ||
274 | features = btrfs_super_incompat_flags(disk_super); | |
275 | if (features & BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS) | |
276 | mixed = 1; | |
277 | ||
278 | flags = BTRFS_BLOCK_GROUP_SYSTEM; | |
279 | ret = create_space_info(fs_info, flags); | |
280 | if (ret) | |
281 | goto out; | |
282 | ||
283 | if (mixed) { | |
284 | flags = BTRFS_BLOCK_GROUP_METADATA | BTRFS_BLOCK_GROUP_DATA; | |
285 | ret = create_space_info(fs_info, flags); | |
286 | } else { | |
287 | flags = BTRFS_BLOCK_GROUP_METADATA; | |
288 | ret = create_space_info(fs_info, flags); | |
289 | if (ret) | |
290 | goto out; | |
291 | ||
292 | flags = BTRFS_BLOCK_GROUP_DATA; | |
293 | ret = create_space_info(fs_info, flags); | |
294 | } | |
295 | out: | |
296 | return ret; | |
297 | } | |
298 | ||
9d4b0a12 | 299 | void btrfs_add_bg_to_space_info(struct btrfs_fs_info *info, |
723de71d | 300 | struct btrfs_block_group *block_group) |
280c2908 JB |
301 | { |
302 | struct btrfs_space_info *found; | |
723de71d | 303 | int factor, index; |
280c2908 | 304 | |
9d4b0a12 | 305 | factor = btrfs_bg_type_to_factor(block_group->flags); |
280c2908 | 306 | |
9d4b0a12 | 307 | found = btrfs_find_space_info(info, block_group->flags); |
280c2908 JB |
308 | ASSERT(found); |
309 | spin_lock(&found->lock); | |
9d4b0a12 | 310 | found->total_bytes += block_group->length; |
3349b57f | 311 | if (test_bit(BLOCK_GROUP_FLAG_ZONE_IS_ACTIVE, &block_group->runtime_flags)) |
9d4b0a12 JB |
312 | found->active_total_bytes += block_group->length; |
313 | found->disk_total += block_group->length * factor; | |
314 | found->bytes_used += block_group->used; | |
315 | found->disk_used += block_group->used * factor; | |
316 | found->bytes_readonly += block_group->bytes_super; | |
317 | found->bytes_zone_unusable += block_group->zone_unusable; | |
318 | if (block_group->length > 0) | |
280c2908 | 319 | found->full = 0; |
18fa2284 | 320 | btrfs_try_granting_tickets(info, found); |
280c2908 | 321 | spin_unlock(&found->lock); |
723de71d JB |
322 | |
323 | block_group->space_info = found; | |
324 | ||
325 | index = btrfs_bg_flags_to_raid_index(block_group->flags); | |
326 | down_write(&found->groups_sem); | |
327 | list_add_tail(&block_group->list, &found->block_groups[index]); | |
328 | up_write(&found->groups_sem); | |
280c2908 JB |
329 | } |
330 | ||
331 | struct btrfs_space_info *btrfs_find_space_info(struct btrfs_fs_info *info, | |
332 | u64 flags) | |
333 | { | |
334 | struct list_head *head = &info->space_info; | |
335 | struct btrfs_space_info *found; | |
336 | ||
337 | flags &= BTRFS_BLOCK_GROUP_TYPE_MASK; | |
338 | ||
72804905 JB |
339 | list_for_each_entry(found, head, list) { |
340 | if (found->flags & flags) | |
280c2908 | 341 | return found; |
280c2908 | 342 | } |
280c2908 JB |
343 | return NULL; |
344 | } | |
41783ef2 | 345 | |
fa121a26 JB |
346 | static u64 calc_available_free_space(struct btrfs_fs_info *fs_info, |
347 | struct btrfs_space_info *space_info, | |
348 | enum btrfs_reserve_flush_enum flush) | |
41783ef2 | 349 | { |
41783ef2 | 350 | u64 profile; |
41783ef2 | 351 | u64 avail; |
41783ef2 JB |
352 | int factor; |
353 | ||
9f246926 | 354 | if (space_info->flags & BTRFS_BLOCK_GROUP_SYSTEM) |
41783ef2 JB |
355 | profile = btrfs_system_alloc_profile(fs_info); |
356 | else | |
357 | profile = btrfs_metadata_alloc_profile(fs_info); | |
358 | ||
41783ef2 JB |
359 | avail = atomic64_read(&fs_info->free_chunk_space); |
360 | ||
361 | /* | |
362 | * If we have dup, raid1 or raid10 then only half of the free | |
363 | * space is actually usable. For raid56, the space info used | |
364 | * doesn't include the parity drive, so we don't have to | |
365 | * change the math | |
366 | */ | |
367 | factor = btrfs_bg_type_to_factor(profile); | |
368 | avail = div_u64(avail, factor); | |
369 | ||
370 | /* | |
371 | * If we aren't flushing all things, let us overcommit up to | |
372 | * 1/2th of the space. If we can flush, don't let us overcommit | |
373 | * too much, let it overcommit up to 1/8 of the space. | |
374 | */ | |
375 | if (flush == BTRFS_RESERVE_FLUSH_ALL) | |
376 | avail >>= 3; | |
377 | else | |
378 | avail >>= 1; | |
fa121a26 JB |
379 | return avail; |
380 | } | |
381 | ||
6a921de5 NA |
382 | static inline u64 writable_total_bytes(struct btrfs_fs_info *fs_info, |
383 | struct btrfs_space_info *space_info) | |
384 | { | |
385 | /* | |
386 | * On regular filesystem, all total_bytes are always writable. On zoned | |
387 | * filesystem, there may be a limitation imposed by max_active_zones. | |
388 | * For metadata allocation, we cannot finish an existing active block | |
389 | * group to avoid a deadlock. Thus, we need to consider only the active | |
390 | * groups to be writable for metadata space. | |
391 | */ | |
392 | if (!btrfs_is_zoned(fs_info) || (space_info->flags & BTRFS_BLOCK_GROUP_DATA)) | |
393 | return space_info->total_bytes; | |
394 | ||
395 | return space_info->active_total_bytes; | |
396 | } | |
397 | ||
fa121a26 JB |
398 | int btrfs_can_overcommit(struct btrfs_fs_info *fs_info, |
399 | struct btrfs_space_info *space_info, u64 bytes, | |
400 | enum btrfs_reserve_flush_enum flush) | |
401 | { | |
402 | u64 avail; | |
403 | u64 used; | |
404 | ||
405 | /* Don't overcommit when in mixed mode */ | |
406 | if (space_info->flags & BTRFS_BLOCK_GROUP_DATA) | |
407 | return 0; | |
408 | ||
409 | used = btrfs_space_info_used(space_info, true); | |
85e79ec7 NA |
410 | if (test_bit(BTRFS_FS_NO_OVERCOMMIT, &fs_info->flags) && |
411 | (space_info->flags & BTRFS_BLOCK_GROUP_METADATA)) | |
79417d04 NA |
412 | avail = 0; |
413 | else | |
414 | avail = calc_available_free_space(fs_info, space_info, flush); | |
41783ef2 | 415 | |
6a921de5 | 416 | if (used + bytes < writable_total_bytes(fs_info, space_info) + avail) |
41783ef2 JB |
417 | return 1; |
418 | return 0; | |
419 | } | |
b338b013 | 420 | |
d611add4 FM |
421 | static void remove_ticket(struct btrfs_space_info *space_info, |
422 | struct reserve_ticket *ticket) | |
423 | { | |
424 | if (!list_empty(&ticket->list)) { | |
425 | list_del_init(&ticket->list); | |
426 | ASSERT(space_info->reclaim_size >= ticket->bytes); | |
427 | space_info->reclaim_size -= ticket->bytes; | |
428 | } | |
429 | } | |
430 | ||
b338b013 JB |
431 | /* |
432 | * This is for space we already have accounted in space_info->bytes_may_use, so | |
433 | * basically when we're returning space from block_rsv's. | |
434 | */ | |
18fa2284 JB |
435 | void btrfs_try_granting_tickets(struct btrfs_fs_info *fs_info, |
436 | struct btrfs_space_info *space_info) | |
b338b013 | 437 | { |
b338b013 | 438 | struct list_head *head; |
b338b013 | 439 | enum btrfs_reserve_flush_enum flush = BTRFS_RESERVE_NO_FLUSH; |
b338b013 | 440 | |
18fa2284 | 441 | lockdep_assert_held(&space_info->lock); |
b338b013 | 442 | |
18fa2284 | 443 | head = &space_info->priority_tickets; |
b338b013 | 444 | again: |
91182645 JB |
445 | while (!list_empty(head)) { |
446 | struct reserve_ticket *ticket; | |
447 | u64 used = btrfs_space_info_used(space_info, true); | |
448 | ||
449 | ticket = list_first_entry(head, struct reserve_ticket, list); | |
450 | ||
1a9fd417 | 451 | /* Check and see if our ticket can be satisfied now. */ |
6a921de5 | 452 | if ((used + ticket->bytes <= writable_total_bytes(fs_info, space_info)) || |
a30a3d20 JB |
453 | btrfs_can_overcommit(fs_info, space_info, ticket->bytes, |
454 | flush)) { | |
91182645 JB |
455 | btrfs_space_info_update_bytes_may_use(fs_info, |
456 | space_info, | |
457 | ticket->bytes); | |
d611add4 | 458 | remove_ticket(space_info, ticket); |
b338b013 JB |
459 | ticket->bytes = 0; |
460 | space_info->tickets_id++; | |
461 | wake_up(&ticket->wait); | |
462 | } else { | |
91182645 | 463 | break; |
b338b013 JB |
464 | } |
465 | } | |
466 | ||
91182645 | 467 | if (head == &space_info->priority_tickets) { |
b338b013 JB |
468 | head = &space_info->tickets; |
469 | flush = BTRFS_RESERVE_FLUSH_ALL; | |
470 | goto again; | |
471 | } | |
b338b013 | 472 | } |
5da6afeb JB |
473 | |
474 | #define DUMP_BLOCK_RSV(fs_info, rsv_name) \ | |
475 | do { \ | |
476 | struct btrfs_block_rsv *__rsv = &(fs_info)->rsv_name; \ | |
477 | spin_lock(&__rsv->lock); \ | |
478 | btrfs_info(fs_info, #rsv_name ": size %llu reserved %llu", \ | |
479 | __rsv->size, __rsv->reserved); \ | |
480 | spin_unlock(&__rsv->lock); \ | |
481 | } while (0) | |
482 | ||
25a860c4 QW |
483 | static const char *space_info_flag_to_str(const struct btrfs_space_info *space_info) |
484 | { | |
485 | switch (space_info->flags) { | |
486 | case BTRFS_BLOCK_GROUP_SYSTEM: | |
487 | return "SYSTEM"; | |
488 | case BTRFS_BLOCK_GROUP_METADATA | BTRFS_BLOCK_GROUP_DATA: | |
489 | return "DATA+METADATA"; | |
490 | case BTRFS_BLOCK_GROUP_DATA: | |
491 | return "DATA"; | |
492 | case BTRFS_BLOCK_GROUP_METADATA: | |
493 | return "METADATA"; | |
494 | default: | |
495 | return "UNKNOWN"; | |
496 | } | |
497 | } | |
498 | ||
8e327b9c QW |
499 | static void dump_global_block_rsv(struct btrfs_fs_info *fs_info) |
500 | { | |
501 | DUMP_BLOCK_RSV(fs_info, global_block_rsv); | |
502 | DUMP_BLOCK_RSV(fs_info, trans_block_rsv); | |
503 | DUMP_BLOCK_RSV(fs_info, chunk_block_rsv); | |
504 | DUMP_BLOCK_RSV(fs_info, delayed_block_rsv); | |
505 | DUMP_BLOCK_RSV(fs_info, delayed_refs_rsv); | |
506 | } | |
507 | ||
84fe47a4 JB |
508 | static void __btrfs_dump_space_info(struct btrfs_fs_info *fs_info, |
509 | struct btrfs_space_info *info) | |
5da6afeb | 510 | { |
25a860c4 | 511 | const char *flag_str = space_info_flag_to_str(info); |
84fe47a4 | 512 | lockdep_assert_held(&info->lock); |
5da6afeb | 513 | |
0619b790 | 514 | /* The free space could be negative in case of overcommit */ |
25a860c4 QW |
515 | btrfs_info(fs_info, "space_info %s has %lld free, is %sfull", |
516 | flag_str, | |
0619b790 | 517 | (s64)(info->total_bytes - btrfs_space_info_used(info, true)), |
5da6afeb JB |
518 | info->full ? "" : "not "); |
519 | btrfs_info(fs_info, | |
25a860c4 | 520 | "space_info total=%llu, used=%llu, pinned=%llu, reserved=%llu, may_use=%llu, readonly=%llu zone_unusable=%llu", |
5da6afeb JB |
521 | info->total_bytes, info->bytes_used, info->bytes_pinned, |
522 | info->bytes_reserved, info->bytes_may_use, | |
169e0da9 | 523 | info->bytes_readonly, info->bytes_zone_unusable); |
84fe47a4 JB |
524 | } |
525 | ||
526 | void btrfs_dump_space_info(struct btrfs_fs_info *fs_info, | |
527 | struct btrfs_space_info *info, u64 bytes, | |
528 | int dump_block_groups) | |
529 | { | |
32da5386 | 530 | struct btrfs_block_group *cache; |
84fe47a4 JB |
531 | int index = 0; |
532 | ||
533 | spin_lock(&info->lock); | |
534 | __btrfs_dump_space_info(fs_info, info); | |
8e327b9c | 535 | dump_global_block_rsv(fs_info); |
84fe47a4 JB |
536 | spin_unlock(&info->lock); |
537 | ||
5da6afeb JB |
538 | if (!dump_block_groups) |
539 | return; | |
540 | ||
541 | down_read(&info->groups_sem); | |
542 | again: | |
543 | list_for_each_entry(cache, &info->block_groups[index], list) { | |
544 | spin_lock(&cache->lock); | |
545 | btrfs_info(fs_info, | |
169e0da9 | 546 | "block group %llu has %llu bytes, %llu used %llu pinned %llu reserved %llu zone_unusable %s", |
b3470b5d | 547 | cache->start, cache->length, cache->used, cache->pinned, |
169e0da9 NA |
548 | cache->reserved, cache->zone_unusable, |
549 | cache->ro ? "[readonly]" : ""); | |
5da6afeb | 550 | spin_unlock(&cache->lock); |
ab0db043 | 551 | btrfs_dump_free_space(cache, bytes); |
5da6afeb JB |
552 | } |
553 | if (++index < BTRFS_NR_RAID_TYPES) | |
554 | goto again; | |
555 | up_read(&info->groups_sem); | |
556 | } | |
0d9764f6 | 557 | |
0d9764f6 JB |
558 | static inline u64 calc_reclaim_items_nr(struct btrfs_fs_info *fs_info, |
559 | u64 to_reclaim) | |
560 | { | |
561 | u64 bytes; | |
562 | u64 nr; | |
563 | ||
2bd36e7b | 564 | bytes = btrfs_calc_insert_metadata_size(fs_info, 1); |
0d9764f6 JB |
565 | nr = div64_u64(to_reclaim, bytes); |
566 | if (!nr) | |
567 | nr = 1; | |
568 | return nr; | |
569 | } | |
570 | ||
571 | #define EXTENT_SIZE_PER_ITEM SZ_256K | |
572 | ||
573 | /* | |
574 | * shrink metadata reservation for delalloc | |
575 | */ | |
920a9958 JB |
576 | static void shrink_delalloc(struct btrfs_fs_info *fs_info, |
577 | struct btrfs_space_info *space_info, | |
385f421f JB |
578 | u64 to_reclaim, bool wait_ordered, |
579 | bool for_preempt) | |
0d9764f6 | 580 | { |
0d9764f6 JB |
581 | struct btrfs_trans_handle *trans; |
582 | u64 delalloc_bytes; | |
5deb17e1 | 583 | u64 ordered_bytes; |
0d9764f6 JB |
584 | u64 items; |
585 | long time_left; | |
0d9764f6 JB |
586 | int loops; |
587 | ||
03fe78cc JB |
588 | delalloc_bytes = percpu_counter_sum_positive(&fs_info->delalloc_bytes); |
589 | ordered_bytes = percpu_counter_sum_positive(&fs_info->ordered_bytes); | |
590 | if (delalloc_bytes == 0 && ordered_bytes == 0) | |
591 | return; | |
592 | ||
0d9764f6 | 593 | /* Calc the number of the pages we need flush for space reservation */ |
d7f81fac JB |
594 | if (to_reclaim == U64_MAX) { |
595 | items = U64_MAX; | |
596 | } else { | |
597 | /* | |
598 | * to_reclaim is set to however much metadata we need to | |
599 | * reclaim, but reclaiming that much data doesn't really track | |
03fe78cc JB |
600 | * exactly. What we really want to do is reclaim full inode's |
601 | * worth of reservations, however that's not available to us | |
602 | * here. We will take a fraction of the delalloc bytes for our | |
603 | * flushing loops and hope for the best. Delalloc will expand | |
604 | * the amount we write to cover an entire dirty extent, which | |
605 | * will reclaim the metadata reservation for that range. If | |
606 | * it's not enough subsequent flush stages will be more | |
607 | * aggressive. | |
d7f81fac | 608 | */ |
03fe78cc | 609 | to_reclaim = max(to_reclaim, delalloc_bytes >> 3); |
d7f81fac | 610 | items = calc_reclaim_items_nr(fs_info, to_reclaim) * 2; |
d7f81fac | 611 | } |
0d9764f6 | 612 | |
0d031dc4 | 613 | trans = current->journal_info; |
0d9764f6 | 614 | |
0d9764f6 JB |
615 | /* |
616 | * If we are doing more ordered than delalloc we need to just wait on | |
617 | * ordered extents, otherwise we'll waste time trying to flush delalloc | |
618 | * that likely won't give us the space back we need. | |
619 | */ | |
385f421f | 620 | if (ordered_bytes > delalloc_bytes && !for_preempt) |
0d9764f6 JB |
621 | wait_ordered = true; |
622 | ||
623 | loops = 0; | |
5deb17e1 | 624 | while ((delalloc_bytes || ordered_bytes) && loops < 3) { |
9db4dc24 NB |
625 | u64 temp = min(delalloc_bytes, to_reclaim) >> PAGE_SHIFT; |
626 | long nr_pages = min_t(u64, temp, LONG_MAX); | |
e1646070 | 627 | int async_pages; |
e076ab2a JB |
628 | |
629 | btrfs_start_delalloc_roots(fs_info, nr_pages, true); | |
0d9764f6 | 630 | |
e1646070 JB |
631 | /* |
632 | * We need to make sure any outstanding async pages are now | |
633 | * processed before we continue. This is because things like | |
634 | * sync_inode() try to be smart and skip writing if the inode is | |
635 | * marked clean. We don't use filemap_fwrite for flushing | |
636 | * because we want to control how many pages we write out at a | |
637 | * time, thus this is the only safe way to make sure we've | |
638 | * waited for outstanding compressed workers to have started | |
639 | * their jobs and thus have ordered extents set up properly. | |
640 | * | |
641 | * This exists because we do not want to wait for each | |
642 | * individual inode to finish its async work, we simply want to | |
643 | * start the IO on everybody, and then come back here and wait | |
644 | * for all of the async work to catch up. Once we're done with | |
645 | * that we know we'll have ordered extents for everything and we | |
646 | * can decide if we wait for that or not. | |
647 | * | |
648 | * If we choose to replace this in the future, make absolutely | |
649 | * sure that the proper waiting is being done in the async case, | |
650 | * as there have been bugs in that area before. | |
651 | */ | |
652 | async_pages = atomic_read(&fs_info->async_delalloc_pages); | |
653 | if (!async_pages) | |
654 | goto skip_async; | |
655 | ||
656 | /* | |
657 | * We don't want to wait forever, if we wrote less pages in this | |
658 | * loop than we have outstanding, only wait for that number of | |
659 | * pages, otherwise we can wait for all async pages to finish | |
660 | * before continuing. | |
661 | */ | |
662 | if (async_pages > nr_pages) | |
663 | async_pages -= nr_pages; | |
664 | else | |
665 | async_pages = 0; | |
666 | wait_event(fs_info->async_submit_wait, | |
667 | atomic_read(&fs_info->async_delalloc_pages) <= | |
668 | async_pages); | |
669 | skip_async: | |
0d9764f6 JB |
670 | loops++; |
671 | if (wait_ordered && !trans) { | |
672 | btrfs_wait_ordered_roots(fs_info, items, 0, (u64)-1); | |
673 | } else { | |
674 | time_left = schedule_timeout_killable(1); | |
675 | if (time_left) | |
676 | break; | |
677 | } | |
448b966b | 678 | |
385f421f JB |
679 | /* |
680 | * If we are for preemption we just want a one-shot of delalloc | |
681 | * flushing so we can stop flushing if we decide we don't need | |
682 | * to anymore. | |
683 | */ | |
684 | if (for_preempt) | |
685 | break; | |
686 | ||
448b966b JB |
687 | spin_lock(&space_info->lock); |
688 | if (list_empty(&space_info->tickets) && | |
689 | list_empty(&space_info->priority_tickets)) { | |
690 | spin_unlock(&space_info->lock); | |
691 | break; | |
692 | } | |
693 | spin_unlock(&space_info->lock); | |
694 | ||
0d9764f6 JB |
695 | delalloc_bytes = percpu_counter_sum_positive( |
696 | &fs_info->delalloc_bytes); | |
5deb17e1 JB |
697 | ordered_bytes = percpu_counter_sum_positive( |
698 | &fs_info->ordered_bytes); | |
0d9764f6 JB |
699 | } |
700 | } | |
701 | ||
0d9764f6 JB |
702 | /* |
703 | * Try to flush some data based on policy set by @state. This is only advisory | |
704 | * and may fail for various reasons. The caller is supposed to examine the | |
705 | * state of @space_info to detect the outcome. | |
706 | */ | |
707 | static void flush_space(struct btrfs_fs_info *fs_info, | |
708 | struct btrfs_space_info *space_info, u64 num_bytes, | |
4b02b00f | 709 | enum btrfs_flush_state state, bool for_preempt) |
0d9764f6 | 710 | { |
ce5603d0 | 711 | struct btrfs_root *root = fs_info->tree_root; |
0d9764f6 JB |
712 | struct btrfs_trans_handle *trans; |
713 | int nr; | |
714 | int ret = 0; | |
715 | ||
716 | switch (state) { | |
717 | case FLUSH_DELAYED_ITEMS_NR: | |
718 | case FLUSH_DELAYED_ITEMS: | |
719 | if (state == FLUSH_DELAYED_ITEMS_NR) | |
720 | nr = calc_reclaim_items_nr(fs_info, num_bytes) * 2; | |
721 | else | |
722 | nr = -1; | |
723 | ||
724 | trans = btrfs_join_transaction(root); | |
725 | if (IS_ERR(trans)) { | |
726 | ret = PTR_ERR(trans); | |
727 | break; | |
728 | } | |
729 | ret = btrfs_run_delayed_items_nr(trans, nr); | |
730 | btrfs_end_transaction(trans); | |
731 | break; | |
732 | case FLUSH_DELALLOC: | |
733 | case FLUSH_DELALLOC_WAIT: | |
03fe78cc JB |
734 | case FLUSH_DELALLOC_FULL: |
735 | if (state == FLUSH_DELALLOC_FULL) | |
736 | num_bytes = U64_MAX; | |
920a9958 | 737 | shrink_delalloc(fs_info, space_info, num_bytes, |
03fe78cc | 738 | state != FLUSH_DELALLOC, for_preempt); |
0d9764f6 JB |
739 | break; |
740 | case FLUSH_DELAYED_REFS_NR: | |
741 | case FLUSH_DELAYED_REFS: | |
742 | trans = btrfs_join_transaction(root); | |
743 | if (IS_ERR(trans)) { | |
744 | ret = PTR_ERR(trans); | |
745 | break; | |
746 | } | |
747 | if (state == FLUSH_DELAYED_REFS_NR) | |
748 | nr = calc_reclaim_items_nr(fs_info, num_bytes); | |
749 | else | |
750 | nr = 0; | |
751 | btrfs_run_delayed_refs(trans, nr); | |
752 | btrfs_end_transaction(trans); | |
753 | break; | |
754 | case ALLOC_CHUNK: | |
755 | case ALLOC_CHUNK_FORCE: | |
b0931513 NA |
756 | /* |
757 | * For metadata space on zoned filesystem, reaching here means we | |
758 | * don't have enough space left in active_total_bytes. Try to | |
759 | * activate a block group first, because we may have inactive | |
760 | * block group already allocated. | |
761 | */ | |
762 | ret = btrfs_zoned_activate_one_bg(fs_info, space_info, false); | |
763 | if (ret < 0) | |
764 | break; | |
765 | else if (ret == 1) | |
766 | break; | |
767 | ||
0d9764f6 JB |
768 | trans = btrfs_join_transaction(root); |
769 | if (IS_ERR(trans)) { | |
770 | ret = PTR_ERR(trans); | |
771 | break; | |
772 | } | |
773 | ret = btrfs_chunk_alloc(trans, | |
c6c45303 | 774 | btrfs_get_alloc_profile(fs_info, space_info->flags), |
0d9764f6 JB |
775 | (state == ALLOC_CHUNK) ? CHUNK_ALLOC_NO_FORCE : |
776 | CHUNK_ALLOC_FORCE); | |
777 | btrfs_end_transaction(trans); | |
b0931513 NA |
778 | |
779 | /* | |
780 | * For metadata space on zoned filesystem, allocating a new chunk | |
781 | * is not enough. We still need to activate the block * group. | |
782 | * Active the newly allocated block group by (maybe) finishing | |
783 | * a block group. | |
784 | */ | |
785 | if (ret == 1) { | |
786 | ret = btrfs_zoned_activate_one_bg(fs_info, space_info, true); | |
787 | /* | |
788 | * Revert to the original ret regardless we could finish | |
789 | * one block group or not. | |
790 | */ | |
791 | if (ret >= 0) | |
792 | ret = 1; | |
793 | } | |
794 | ||
0d9764f6 JB |
795 | if (ret > 0 || ret == -ENOSPC) |
796 | ret = 0; | |
797 | break; | |
844245b4 | 798 | case RUN_DELAYED_IPUTS: |
0d9764f6 JB |
799 | /* |
800 | * If we have pending delayed iputs then we could free up a | |
801 | * bunch of pinned space, so make sure we run the iputs before | |
802 | * we do our pinned bytes check below. | |
803 | */ | |
804 | btrfs_run_delayed_iputs(fs_info); | |
805 | btrfs_wait_on_delayed_iputs(fs_info); | |
844245b4 JB |
806 | break; |
807 | case COMMIT_TRANS: | |
c416a30c | 808 | ASSERT(current->journal_info == NULL); |
f00c42dd JB |
809 | trans = btrfs_join_transaction(root); |
810 | if (IS_ERR(trans)) { | |
811 | ret = PTR_ERR(trans); | |
812 | break; | |
813 | } | |
814 | ret = btrfs_commit_transaction(trans); | |
815 | break; | |
0d9764f6 JB |
816 | default: |
817 | ret = -ENOSPC; | |
818 | break; | |
819 | } | |
820 | ||
821 | trace_btrfs_flush_space(fs_info, space_info->flags, num_bytes, state, | |
4b02b00f | 822 | ret, for_preempt); |
0d9764f6 JB |
823 | return; |
824 | } | |
825 | ||
826 | static inline u64 | |
827 | btrfs_calc_reclaim_metadata_size(struct btrfs_fs_info *fs_info, | |
9f246926 | 828 | struct btrfs_space_info *space_info) |
0d9764f6 | 829 | { |
0d9764f6 | 830 | u64 used; |
fa121a26 | 831 | u64 avail; |
6a921de5 | 832 | u64 total; |
db161806 | 833 | u64 to_reclaim = space_info->reclaim_size; |
0d9764f6 | 834 | |
db161806 | 835 | lockdep_assert_held(&space_info->lock); |
fa121a26 JB |
836 | |
837 | avail = calc_available_free_space(fs_info, space_info, | |
838 | BTRFS_RESERVE_FLUSH_ALL); | |
839 | used = btrfs_space_info_used(space_info, true); | |
840 | ||
841 | /* | |
842 | * We may be flushing because suddenly we have less space than we had | |
843 | * before, and now we're well over-committed based on our current free | |
844 | * space. If that's the case add in our overage so we make sure to put | |
845 | * appropriate pressure on the flushing state machine. | |
846 | */ | |
6a921de5 NA |
847 | total = writable_total_bytes(fs_info, space_info); |
848 | if (total + avail < used) | |
849 | to_reclaim += used - (total + avail); | |
fa121a26 | 850 | |
0d9764f6 JB |
851 | return to_reclaim; |
852 | } | |
853 | ||
ae7913ba | 854 | static bool need_preemptive_reclaim(struct btrfs_fs_info *fs_info, |
2e294c60 | 855 | struct btrfs_space_info *space_info) |
0d9764f6 | 856 | { |
610a6ef4 | 857 | u64 global_rsv_size = fs_info->global_block_rsv.reserved; |
2e294c60 | 858 | u64 ordered, delalloc; |
6a921de5 NA |
859 | u64 total = writable_total_bytes(fs_info, space_info); |
860 | u64 thresh; | |
2e294c60 | 861 | u64 used; |
0d9764f6 | 862 | |
428c8e03 | 863 | thresh = mult_perc(total, 90); |
6a921de5 | 864 | |
bf7bd725 ND |
865 | lockdep_assert_held(&space_info->lock); |
866 | ||
0d9764f6 | 867 | /* If we're just plain full then async reclaim just slows us down. */ |
610a6ef4 JB |
868 | if ((space_info->bytes_used + space_info->bytes_reserved + |
869 | global_rsv_size) >= thresh) | |
ae7913ba | 870 | return false; |
0d9764f6 | 871 | |
11462397 JB |
872 | used = space_info->bytes_may_use + space_info->bytes_pinned; |
873 | ||
874 | /* The total flushable belongs to the global rsv, don't flush. */ | |
875 | if (global_rsv_size >= used) | |
876 | return false; | |
877 | ||
878 | /* | |
879 | * 128MiB is 1/4 of the maximum global rsv size. If we have less than | |
880 | * that devoted to other reservations then there's no sense in flushing, | |
881 | * we don't have a lot of things that need flushing. | |
882 | */ | |
883 | if (used - global_rsv_size <= SZ_128M) | |
884 | return false; | |
885 | ||
f205edf7 JB |
886 | /* |
887 | * We have tickets queued, bail so we don't compete with the async | |
888 | * flushers. | |
889 | */ | |
890 | if (space_info->reclaim_size) | |
891 | return false; | |
892 | ||
2e294c60 JB |
893 | /* |
894 | * If we have over half of the free space occupied by reservations or | |
895 | * pinned then we want to start flushing. | |
896 | * | |
897 | * We do not do the traditional thing here, which is to say | |
898 | * | |
899 | * if (used >= ((total_bytes + avail) / 2)) | |
900 | * return 1; | |
901 | * | |
902 | * because this doesn't quite work how we want. If we had more than 50% | |
903 | * of the space_info used by bytes_used and we had 0 available we'd just | |
904 | * constantly run the background flusher. Instead we want it to kick in | |
88a777a6 JB |
905 | * if our reclaimable space exceeds our clamped free space. |
906 | * | |
907 | * Our clamping range is 2^1 -> 2^8. Practically speaking that means | |
908 | * the following: | |
909 | * | |
910 | * Amount of RAM Minimum threshold Maximum threshold | |
911 | * | |
912 | * 256GiB 1GiB 128GiB | |
913 | * 128GiB 512MiB 64GiB | |
914 | * 64GiB 256MiB 32GiB | |
915 | * 32GiB 128MiB 16GiB | |
916 | * 16GiB 64MiB 8GiB | |
917 | * | |
918 | * These are the range our thresholds will fall in, corresponding to how | |
919 | * much delalloc we need for the background flusher to kick in. | |
2e294c60 | 920 | */ |
88a777a6 | 921 | |
2e294c60 JB |
922 | thresh = calc_available_free_space(fs_info, space_info, |
923 | BTRFS_RESERVE_FLUSH_ALL); | |
1239e2da JB |
924 | used = space_info->bytes_used + space_info->bytes_reserved + |
925 | space_info->bytes_readonly + global_rsv_size; | |
6a921de5 NA |
926 | if (used < total) |
927 | thresh += total - used; | |
88a777a6 | 928 | thresh >>= space_info->clamp; |
9f42d377 | 929 | |
2e294c60 | 930 | used = space_info->bytes_pinned; |
9f42d377 | 931 | |
2e294c60 JB |
932 | /* |
933 | * If we have more ordered bytes than delalloc bytes then we're either | |
934 | * doing a lot of DIO, or we simply don't have a lot of delalloc waiting | |
935 | * around. Preemptive flushing is only useful in that it can free up | |
936 | * space before tickets need to wait for things to finish. In the case | |
937 | * of ordered extents, preemptively waiting on ordered extents gets us | |
938 | * nothing, if our reservations are tied up in ordered extents we'll | |
939 | * simply have to slow down writers by forcing them to wait on ordered | |
940 | * extents. | |
941 | * | |
942 | * In the case that ordered is larger than delalloc, only include the | |
943 | * block reserves that we would actually be able to directly reclaim | |
944 | * from. In this case if we're heavy on metadata operations this will | |
945 | * clearly be heavy enough to warrant preemptive flushing. In the case | |
946 | * of heavy DIO or ordered reservations, preemptive flushing will just | |
947 | * waste time and cause us to slow down. | |
3e101569 JB |
948 | * |
949 | * We want to make sure we truly are maxed out on ordered however, so | |
950 | * cut ordered in half, and if it's still higher than delalloc then we | |
951 | * can keep flushing. This is to avoid the case where we start | |
952 | * flushing, and now delalloc == ordered and we stop preemptively | |
953 | * flushing when we could still have several gigs of delalloc to flush. | |
2e294c60 | 954 | */ |
3e101569 | 955 | ordered = percpu_counter_read_positive(&fs_info->ordered_bytes) >> 1; |
2cdb3909 | 956 | delalloc = percpu_counter_read_positive(&fs_info->delalloc_bytes); |
2e294c60 JB |
957 | if (ordered >= delalloc) |
958 | used += fs_info->delayed_refs_rsv.reserved + | |
959 | fs_info->delayed_block_rsv.reserved; | |
9f42d377 | 960 | else |
30acce4e | 961 | used += space_info->bytes_may_use - global_rsv_size; |
0d9764f6 JB |
962 | |
963 | return (used >= thresh && !btrfs_fs_closing(fs_info) && | |
964 | !test_bit(BTRFS_FS_STATE_REMOUNTING, &fs_info->fs_state)); | |
965 | } | |
966 | ||
7f9fe614 JB |
967 | static bool steal_from_global_rsv(struct btrfs_fs_info *fs_info, |
968 | struct btrfs_space_info *space_info, | |
969 | struct reserve_ticket *ticket) | |
970 | { | |
971 | struct btrfs_block_rsv *global_rsv = &fs_info->global_block_rsv; | |
972 | u64 min_bytes; | |
973 | ||
1b0309ea JB |
974 | if (!ticket->steal) |
975 | return false; | |
976 | ||
7f9fe614 JB |
977 | if (global_rsv->space_info != space_info) |
978 | return false; | |
979 | ||
980 | spin_lock(&global_rsv->lock); | |
428c8e03 | 981 | min_bytes = mult_perc(global_rsv->size, 10); |
7f9fe614 JB |
982 | if (global_rsv->reserved < min_bytes + ticket->bytes) { |
983 | spin_unlock(&global_rsv->lock); | |
984 | return false; | |
985 | } | |
986 | global_rsv->reserved -= ticket->bytes; | |
6d548b9e | 987 | remove_ticket(space_info, ticket); |
7f9fe614 | 988 | ticket->bytes = 0; |
7f9fe614 JB |
989 | wake_up(&ticket->wait); |
990 | space_info->tickets_id++; | |
991 | if (global_rsv->reserved < global_rsv->size) | |
992 | global_rsv->full = 0; | |
993 | spin_unlock(&global_rsv->lock); | |
994 | ||
995 | return true; | |
996 | } | |
997 | ||
2341ccd1 JB |
998 | /* |
999 | * maybe_fail_all_tickets - we've exhausted our flushing, start failing tickets | |
1000 | * @fs_info - fs_info for this fs | |
1001 | * @space_info - the space info we were flushing | |
1002 | * | |
1003 | * We call this when we've exhausted our flushing ability and haven't made | |
1004 | * progress in satisfying tickets. The reservation code handles tickets in | |
1005 | * order, so if there is a large ticket first and then smaller ones we could | |
1006 | * very well satisfy the smaller tickets. This will attempt to wake up any | |
1007 | * tickets in the list to catch this case. | |
1008 | * | |
1009 | * This function returns true if it was able to make progress by clearing out | |
1010 | * other tickets, or if it stumbles across a ticket that was smaller than the | |
1011 | * first ticket. | |
1012 | */ | |
1013 | static bool maybe_fail_all_tickets(struct btrfs_fs_info *fs_info, | |
1014 | struct btrfs_space_info *space_info) | |
0d9764f6 JB |
1015 | { |
1016 | struct reserve_ticket *ticket; | |
2341ccd1 | 1017 | u64 tickets_id = space_info->tickets_id; |
0e24f6d8 | 1018 | const bool aborted = BTRFS_FS_ERROR(fs_info); |
2341ccd1 | 1019 | |
fcdef39c JB |
1020 | trace_btrfs_fail_all_tickets(fs_info, space_info); |
1021 | ||
84fe47a4 JB |
1022 | if (btrfs_test_opt(fs_info, ENOSPC_DEBUG)) { |
1023 | btrfs_info(fs_info, "cannot satisfy tickets, dumping space info"); | |
1024 | __btrfs_dump_space_info(fs_info, space_info); | |
1025 | } | |
1026 | ||
2341ccd1 JB |
1027 | while (!list_empty(&space_info->tickets) && |
1028 | tickets_id == space_info->tickets_id) { | |
1029 | ticket = list_first_entry(&space_info->tickets, | |
1030 | struct reserve_ticket, list); | |
1031 | ||
1b0309ea | 1032 | if (!aborted && steal_from_global_rsv(fs_info, space_info, ticket)) |
7f9fe614 JB |
1033 | return true; |
1034 | ||
0e24f6d8 | 1035 | if (!aborted && btrfs_test_opt(fs_info, ENOSPC_DEBUG)) |
84fe47a4 JB |
1036 | btrfs_info(fs_info, "failing ticket with %llu bytes", |
1037 | ticket->bytes); | |
1038 | ||
d611add4 | 1039 | remove_ticket(space_info, ticket); |
0e24f6d8 JB |
1040 | if (aborted) |
1041 | ticket->error = -EIO; | |
1042 | else | |
1043 | ticket->error = -ENOSPC; | |
0d9764f6 | 1044 | wake_up(&ticket->wait); |
2341ccd1 JB |
1045 | |
1046 | /* | |
1047 | * We're just throwing tickets away, so more flushing may not | |
1048 | * trip over btrfs_try_granting_tickets, so we need to call it | |
1049 | * here to see if we can make progress with the next ticket in | |
1050 | * the list. | |
1051 | */ | |
0e24f6d8 JB |
1052 | if (!aborted) |
1053 | btrfs_try_granting_tickets(fs_info, space_info); | |
0d9764f6 | 1054 | } |
2341ccd1 | 1055 | return (tickets_id != space_info->tickets_id); |
0d9764f6 JB |
1056 | } |
1057 | ||
1058 | /* | |
1059 | * This is for normal flushers, we can wait all goddamned day if we want to. We | |
1060 | * will loop and continuously try to flush as long as we are making progress. | |
1061 | * We count progress as clearing off tickets each time we have to loop. | |
1062 | */ | |
1063 | static void btrfs_async_reclaim_metadata_space(struct work_struct *work) | |
1064 | { | |
1065 | struct btrfs_fs_info *fs_info; | |
1066 | struct btrfs_space_info *space_info; | |
1067 | u64 to_reclaim; | |
91e79a83 | 1068 | enum btrfs_flush_state flush_state; |
0d9764f6 JB |
1069 | int commit_cycles = 0; |
1070 | u64 last_tickets_id; | |
1071 | ||
1072 | fs_info = container_of(work, struct btrfs_fs_info, async_reclaim_work); | |
1073 | space_info = btrfs_find_space_info(fs_info, BTRFS_BLOCK_GROUP_METADATA); | |
1074 | ||
1075 | spin_lock(&space_info->lock); | |
9f246926 | 1076 | to_reclaim = btrfs_calc_reclaim_metadata_size(fs_info, space_info); |
0d9764f6 JB |
1077 | if (!to_reclaim) { |
1078 | space_info->flush = 0; | |
1079 | spin_unlock(&space_info->lock); | |
1080 | return; | |
1081 | } | |
1082 | last_tickets_id = space_info->tickets_id; | |
1083 | spin_unlock(&space_info->lock); | |
1084 | ||
1085 | flush_state = FLUSH_DELAYED_ITEMS_NR; | |
1086 | do { | |
4b02b00f | 1087 | flush_space(fs_info, space_info, to_reclaim, flush_state, false); |
0d9764f6 JB |
1088 | spin_lock(&space_info->lock); |
1089 | if (list_empty(&space_info->tickets)) { | |
1090 | space_info->flush = 0; | |
1091 | spin_unlock(&space_info->lock); | |
1092 | return; | |
1093 | } | |
1094 | to_reclaim = btrfs_calc_reclaim_metadata_size(fs_info, | |
9f246926 | 1095 | space_info); |
0d9764f6 JB |
1096 | if (last_tickets_id == space_info->tickets_id) { |
1097 | flush_state++; | |
1098 | } else { | |
1099 | last_tickets_id = space_info->tickets_id; | |
1100 | flush_state = FLUSH_DELAYED_ITEMS_NR; | |
1101 | if (commit_cycles) | |
1102 | commit_cycles--; | |
1103 | } | |
1104 | ||
03fe78cc JB |
1105 | /* |
1106 | * We do not want to empty the system of delalloc unless we're | |
1107 | * under heavy pressure, so allow one trip through the flushing | |
1108 | * logic before we start doing a FLUSH_DELALLOC_FULL. | |
1109 | */ | |
1110 | if (flush_state == FLUSH_DELALLOC_FULL && !commit_cycles) | |
1111 | flush_state++; | |
1112 | ||
0d9764f6 JB |
1113 | /* |
1114 | * We don't want to force a chunk allocation until we've tried | |
1115 | * pretty hard to reclaim space. Think of the case where we | |
1116 | * freed up a bunch of space and so have a lot of pinned space | |
1117 | * to reclaim. We would rather use that than possibly create a | |
1118 | * underutilized metadata chunk. So if this is our first run | |
1119 | * through the flushing state machine skip ALLOC_CHUNK_FORCE and | |
1120 | * commit the transaction. If nothing has changed the next go | |
1121 | * around then we can force a chunk allocation. | |
1122 | */ | |
1123 | if (flush_state == ALLOC_CHUNK_FORCE && !commit_cycles) | |
1124 | flush_state++; | |
1125 | ||
1126 | if (flush_state > COMMIT_TRANS) { | |
1127 | commit_cycles++; | |
1128 | if (commit_cycles > 2) { | |
2341ccd1 | 1129 | if (maybe_fail_all_tickets(fs_info, space_info)) { |
0d9764f6 JB |
1130 | flush_state = FLUSH_DELAYED_ITEMS_NR; |
1131 | commit_cycles--; | |
1132 | } else { | |
1133 | space_info->flush = 0; | |
1134 | } | |
1135 | } else { | |
1136 | flush_state = FLUSH_DELAYED_ITEMS_NR; | |
1137 | } | |
1138 | } | |
1139 | spin_unlock(&space_info->lock); | |
1140 | } while (flush_state <= COMMIT_TRANS); | |
1141 | } | |
1142 | ||
576fa348 JB |
1143 | /* |
1144 | * This handles pre-flushing of metadata space before we get to the point that | |
1145 | * we need to start blocking threads on tickets. The logic here is different | |
1146 | * from the other flush paths because it doesn't rely on tickets to tell us how | |
1147 | * much we need to flush, instead it attempts to keep us below the 80% full | |
1148 | * watermark of space by flushing whichever reservation pool is currently the | |
1149 | * largest. | |
1150 | */ | |
1151 | static void btrfs_preempt_reclaim_metadata_space(struct work_struct *work) | |
1152 | { | |
1153 | struct btrfs_fs_info *fs_info; | |
1154 | struct btrfs_space_info *space_info; | |
1155 | struct btrfs_block_rsv *delayed_block_rsv; | |
1156 | struct btrfs_block_rsv *delayed_refs_rsv; | |
1157 | struct btrfs_block_rsv *global_rsv; | |
1158 | struct btrfs_block_rsv *trans_rsv; | |
88a777a6 | 1159 | int loops = 0; |
576fa348 JB |
1160 | |
1161 | fs_info = container_of(work, struct btrfs_fs_info, | |
1162 | preempt_reclaim_work); | |
1163 | space_info = btrfs_find_space_info(fs_info, BTRFS_BLOCK_GROUP_METADATA); | |
1164 | delayed_block_rsv = &fs_info->delayed_block_rsv; | |
1165 | delayed_refs_rsv = &fs_info->delayed_refs_rsv; | |
1166 | global_rsv = &fs_info->global_block_rsv; | |
1167 | trans_rsv = &fs_info->trans_block_rsv; | |
1168 | ||
1169 | spin_lock(&space_info->lock); | |
2e294c60 | 1170 | while (need_preemptive_reclaim(fs_info, space_info)) { |
576fa348 JB |
1171 | enum btrfs_flush_state flush; |
1172 | u64 delalloc_size = 0; | |
1173 | u64 to_reclaim, block_rsv_size; | |
1174 | u64 global_rsv_size = global_rsv->reserved; | |
1175 | ||
88a777a6 JB |
1176 | loops++; |
1177 | ||
576fa348 JB |
1178 | /* |
1179 | * We don't have a precise counter for the metadata being | |
1180 | * reserved for delalloc, so we'll approximate it by subtracting | |
1181 | * out the block rsv's space from the bytes_may_use. If that | |
1182 | * amount is higher than the individual reserves, then we can | |
1183 | * assume it's tied up in delalloc reservations. | |
1184 | */ | |
1185 | block_rsv_size = global_rsv_size + | |
1186 | delayed_block_rsv->reserved + | |
1187 | delayed_refs_rsv->reserved + | |
1188 | trans_rsv->reserved; | |
1189 | if (block_rsv_size < space_info->bytes_may_use) | |
1190 | delalloc_size = space_info->bytes_may_use - block_rsv_size; | |
576fa348 JB |
1191 | |
1192 | /* | |
1193 | * We don't want to include the global_rsv in our calculation, | |
1194 | * because that's space we can't touch. Subtract it from the | |
1195 | * block_rsv_size for the next checks. | |
1196 | */ | |
1197 | block_rsv_size -= global_rsv_size; | |
1198 | ||
1199 | /* | |
1200 | * We really want to avoid flushing delalloc too much, as it | |
1201 | * could result in poor allocation patterns, so only flush it if | |
1202 | * it's larger than the rest of the pools combined. | |
1203 | */ | |
1204 | if (delalloc_size > block_rsv_size) { | |
1205 | to_reclaim = delalloc_size; | |
1206 | flush = FLUSH_DELALLOC; | |
1207 | } else if (space_info->bytes_pinned > | |
1208 | (delayed_block_rsv->reserved + | |
1209 | delayed_refs_rsv->reserved)) { | |
1210 | to_reclaim = space_info->bytes_pinned; | |
c416a30c | 1211 | flush = COMMIT_TRANS; |
576fa348 JB |
1212 | } else if (delayed_block_rsv->reserved > |
1213 | delayed_refs_rsv->reserved) { | |
1214 | to_reclaim = delayed_block_rsv->reserved; | |
1215 | flush = FLUSH_DELAYED_ITEMS_NR; | |
1216 | } else { | |
1217 | to_reclaim = delayed_refs_rsv->reserved; | |
1218 | flush = FLUSH_DELAYED_REFS_NR; | |
1219 | } | |
1220 | ||
06bae876 ND |
1221 | spin_unlock(&space_info->lock); |
1222 | ||
576fa348 JB |
1223 | /* |
1224 | * We don't want to reclaim everything, just a portion, so scale | |
1225 | * down the to_reclaim by 1/4. If it takes us down to 0, | |
1226 | * reclaim 1 items worth. | |
1227 | */ | |
1228 | to_reclaim >>= 2; | |
1229 | if (!to_reclaim) | |
1230 | to_reclaim = btrfs_calc_insert_metadata_size(fs_info, 1); | |
4b02b00f | 1231 | flush_space(fs_info, space_info, to_reclaim, flush, true); |
576fa348 JB |
1232 | cond_resched(); |
1233 | spin_lock(&space_info->lock); | |
576fa348 | 1234 | } |
88a777a6 JB |
1235 | |
1236 | /* We only went through once, back off our clamping. */ | |
1237 | if (loops == 1 && !space_info->reclaim_size) | |
1238 | space_info->clamp = max(1, space_info->clamp - 1); | |
e5ad49e2 | 1239 | trace_btrfs_done_preemptive_reclaim(fs_info, space_info); |
576fa348 JB |
1240 | spin_unlock(&space_info->lock); |
1241 | } | |
1242 | ||
1a7a92c8 JB |
1243 | /* |
1244 | * FLUSH_DELALLOC_WAIT: | |
1245 | * Space is freed from flushing delalloc in one of two ways. | |
1246 | * | |
1247 | * 1) compression is on and we allocate less space than we reserved | |
1248 | * 2) we are overwriting existing space | |
1249 | * | |
1250 | * For #1 that extra space is reclaimed as soon as the delalloc pages are | |
1251 | * COWed, by way of btrfs_add_reserved_bytes() which adds the actual extent | |
1252 | * length to ->bytes_reserved, and subtracts the reserved space from | |
1253 | * ->bytes_may_use. | |
1254 | * | |
1255 | * For #2 this is trickier. Once the ordered extent runs we will drop the | |
1256 | * extent in the range we are overwriting, which creates a delayed ref for | |
1257 | * that freed extent. This however is not reclaimed until the transaction | |
1258 | * commits, thus the next stages. | |
1259 | * | |
1260 | * RUN_DELAYED_IPUTS | |
1261 | * If we are freeing inodes, we want to make sure all delayed iputs have | |
1262 | * completed, because they could have been on an inode with i_nlink == 0, and | |
1263 | * thus have been truncated and freed up space. But again this space is not | |
1264 | * immediately re-usable, it comes in the form of a delayed ref, which must be | |
1265 | * run and then the transaction must be committed. | |
1266 | * | |
1a7a92c8 | 1267 | * COMMIT_TRANS |
c416a30c JB |
1268 | * This is where we reclaim all of the pinned space generated by running the |
1269 | * iputs | |
c4923027 JB |
1270 | * |
1271 | * ALLOC_CHUNK_FORCE | |
1272 | * For data we start with alloc chunk force, however we could have been full | |
1273 | * before, and then the transaction commit could have freed new block groups, | |
1274 | * so if we now have space to allocate do the force chunk allocation. | |
1a7a92c8 | 1275 | */ |
57056740 | 1276 | static const enum btrfs_flush_state data_flush_states[] = { |
03fe78cc | 1277 | FLUSH_DELALLOC_FULL, |
57056740 | 1278 | RUN_DELAYED_IPUTS, |
57056740 | 1279 | COMMIT_TRANS, |
c4923027 | 1280 | ALLOC_CHUNK_FORCE, |
57056740 JB |
1281 | }; |
1282 | ||
1283 | static void btrfs_async_reclaim_data_space(struct work_struct *work) | |
0d9764f6 | 1284 | { |
57056740 JB |
1285 | struct btrfs_fs_info *fs_info; |
1286 | struct btrfs_space_info *space_info; | |
1287 | u64 last_tickets_id; | |
91e79a83 | 1288 | enum btrfs_flush_state flush_state = 0; |
57056740 JB |
1289 | |
1290 | fs_info = container_of(work, struct btrfs_fs_info, async_data_reclaim_work); | |
1291 | space_info = fs_info->data_sinfo; | |
1292 | ||
1293 | spin_lock(&space_info->lock); | |
1294 | if (list_empty(&space_info->tickets)) { | |
1295 | space_info->flush = 0; | |
1296 | spin_unlock(&space_info->lock); | |
1297 | return; | |
1298 | } | |
1299 | last_tickets_id = space_info->tickets_id; | |
1300 | spin_unlock(&space_info->lock); | |
1301 | ||
1302 | while (!space_info->full) { | |
4b02b00f | 1303 | flush_space(fs_info, space_info, U64_MAX, ALLOC_CHUNK_FORCE, false); |
57056740 JB |
1304 | spin_lock(&space_info->lock); |
1305 | if (list_empty(&space_info->tickets)) { | |
1306 | space_info->flush = 0; | |
1307 | spin_unlock(&space_info->lock); | |
1308 | return; | |
1309 | } | |
0e24f6d8 JB |
1310 | |
1311 | /* Something happened, fail everything and bail. */ | |
1312 | if (BTRFS_FS_ERROR(fs_info)) | |
1313 | goto aborted_fs; | |
57056740 JB |
1314 | last_tickets_id = space_info->tickets_id; |
1315 | spin_unlock(&space_info->lock); | |
1316 | } | |
1317 | ||
1318 | while (flush_state < ARRAY_SIZE(data_flush_states)) { | |
1319 | flush_space(fs_info, space_info, U64_MAX, | |
4b02b00f | 1320 | data_flush_states[flush_state], false); |
57056740 JB |
1321 | spin_lock(&space_info->lock); |
1322 | if (list_empty(&space_info->tickets)) { | |
1323 | space_info->flush = 0; | |
1324 | spin_unlock(&space_info->lock); | |
1325 | return; | |
1326 | } | |
1327 | ||
1328 | if (last_tickets_id == space_info->tickets_id) { | |
1329 | flush_state++; | |
1330 | } else { | |
1331 | last_tickets_id = space_info->tickets_id; | |
1332 | flush_state = 0; | |
1333 | } | |
1334 | ||
1335 | if (flush_state >= ARRAY_SIZE(data_flush_states)) { | |
1336 | if (space_info->full) { | |
1337 | if (maybe_fail_all_tickets(fs_info, space_info)) | |
1338 | flush_state = 0; | |
1339 | else | |
1340 | space_info->flush = 0; | |
1341 | } else { | |
1342 | flush_state = 0; | |
1343 | } | |
0e24f6d8 JB |
1344 | |
1345 | /* Something happened, fail everything and bail. */ | |
1346 | if (BTRFS_FS_ERROR(fs_info)) | |
1347 | goto aborted_fs; | |
1348 | ||
57056740 JB |
1349 | } |
1350 | spin_unlock(&space_info->lock); | |
1351 | } | |
0e24f6d8 JB |
1352 | return; |
1353 | ||
1354 | aborted_fs: | |
1355 | maybe_fail_all_tickets(fs_info, space_info); | |
1356 | space_info->flush = 0; | |
1357 | spin_unlock(&space_info->lock); | |
57056740 JB |
1358 | } |
1359 | ||
1360 | void btrfs_init_async_reclaim_work(struct btrfs_fs_info *fs_info) | |
1361 | { | |
1362 | INIT_WORK(&fs_info->async_reclaim_work, btrfs_async_reclaim_metadata_space); | |
1363 | INIT_WORK(&fs_info->async_data_reclaim_work, btrfs_async_reclaim_data_space); | |
576fa348 JB |
1364 | INIT_WORK(&fs_info->preempt_reclaim_work, |
1365 | btrfs_preempt_reclaim_metadata_space); | |
0d9764f6 JB |
1366 | } |
1367 | ||
1368 | static const enum btrfs_flush_state priority_flush_states[] = { | |
1369 | FLUSH_DELAYED_ITEMS_NR, | |
1370 | FLUSH_DELAYED_ITEMS, | |
1371 | ALLOC_CHUNK, | |
1372 | }; | |
1373 | ||
d3984c90 JB |
1374 | static const enum btrfs_flush_state evict_flush_states[] = { |
1375 | FLUSH_DELAYED_ITEMS_NR, | |
1376 | FLUSH_DELAYED_ITEMS, | |
1377 | FLUSH_DELAYED_REFS_NR, | |
1378 | FLUSH_DELAYED_REFS, | |
1379 | FLUSH_DELALLOC, | |
1380 | FLUSH_DELALLOC_WAIT, | |
03fe78cc | 1381 | FLUSH_DELALLOC_FULL, |
d3984c90 JB |
1382 | ALLOC_CHUNK, |
1383 | COMMIT_TRANS, | |
1384 | }; | |
1385 | ||
0d9764f6 | 1386 | static void priority_reclaim_metadata_space(struct btrfs_fs_info *fs_info, |
9ce2f423 JB |
1387 | struct btrfs_space_info *space_info, |
1388 | struct reserve_ticket *ticket, | |
1389 | const enum btrfs_flush_state *states, | |
1390 | int states_nr) | |
0d9764f6 JB |
1391 | { |
1392 | u64 to_reclaim; | |
9f35f76d | 1393 | int flush_state = 0; |
0d9764f6 JB |
1394 | |
1395 | spin_lock(&space_info->lock); | |
9f246926 | 1396 | to_reclaim = btrfs_calc_reclaim_metadata_size(fs_info, space_info); |
9cd8dcdc JB |
1397 | /* |
1398 | * This is the priority reclaim path, so to_reclaim could be >0 still | |
143823cf | 1399 | * because we may have only satisfied the priority tickets and still |
9cd8dcdc JB |
1400 | * left non priority tickets on the list. We would then have |
1401 | * to_reclaim but ->bytes == 0. | |
1402 | */ | |
1403 | if (ticket->bytes == 0) { | |
0d9764f6 JB |
1404 | spin_unlock(&space_info->lock); |
1405 | return; | |
1406 | } | |
0d9764f6 | 1407 | |
9f35f76d JB |
1408 | while (flush_state < states_nr) { |
1409 | spin_unlock(&space_info->lock); | |
4b02b00f JB |
1410 | flush_space(fs_info, space_info, to_reclaim, states[flush_state], |
1411 | false); | |
0d9764f6 JB |
1412 | flush_state++; |
1413 | spin_lock(&space_info->lock); | |
1414 | if (ticket->bytes == 0) { | |
1415 | spin_unlock(&space_info->lock); | |
1416 | return; | |
1417 | } | |
9f35f76d JB |
1418 | } |
1419 | ||
ee6adbfd JB |
1420 | /* Attempt to steal from the global rsv if we can. */ |
1421 | if (!steal_from_global_rsv(fs_info, space_info, ticket)) { | |
1422 | ticket->error = -ENOSPC; | |
1423 | remove_ticket(space_info, ticket); | |
1424 | } | |
1425 | ||
9f35f76d JB |
1426 | /* |
1427 | * We must run try_granting_tickets here because we could be a large | |
1428 | * ticket in front of a smaller ticket that can now be satisfied with | |
1429 | * the available space. | |
1430 | */ | |
9f35f76d JB |
1431 | btrfs_try_granting_tickets(fs_info, space_info); |
1432 | spin_unlock(&space_info->lock); | |
0d9764f6 JB |
1433 | } |
1434 | ||
1004f686 JB |
1435 | static void priority_reclaim_data_space(struct btrfs_fs_info *fs_info, |
1436 | struct btrfs_space_info *space_info, | |
57056740 | 1437 | struct reserve_ticket *ticket) |
1004f686 | 1438 | { |
9f35f76d | 1439 | spin_lock(&space_info->lock); |
9cd8dcdc JB |
1440 | |
1441 | /* We could have been granted before we got here. */ | |
1442 | if (ticket->bytes == 0) { | |
1443 | spin_unlock(&space_info->lock); | |
1444 | return; | |
1445 | } | |
1446 | ||
1004f686 | 1447 | while (!space_info->full) { |
9f35f76d | 1448 | spin_unlock(&space_info->lock); |
4b02b00f | 1449 | flush_space(fs_info, space_info, U64_MAX, ALLOC_CHUNK_FORCE, false); |
1004f686 JB |
1450 | spin_lock(&space_info->lock); |
1451 | if (ticket->bytes == 0) { | |
1452 | spin_unlock(&space_info->lock); | |
1453 | return; | |
1454 | } | |
1004f686 | 1455 | } |
9f35f76d JB |
1456 | |
1457 | ticket->error = -ENOSPC; | |
1458 | remove_ticket(space_info, ticket); | |
1459 | btrfs_try_granting_tickets(fs_info, space_info); | |
1460 | spin_unlock(&space_info->lock); | |
1004f686 JB |
1461 | } |
1462 | ||
374bf9c5 JB |
1463 | static void wait_reserve_ticket(struct btrfs_fs_info *fs_info, |
1464 | struct btrfs_space_info *space_info, | |
1465 | struct reserve_ticket *ticket) | |
0d9764f6 JB |
1466 | |
1467 | { | |
1468 | DEFINE_WAIT(wait); | |
0d9764f6 JB |
1469 | int ret = 0; |
1470 | ||
1471 | spin_lock(&space_info->lock); | |
1472 | while (ticket->bytes > 0 && ticket->error == 0) { | |
1473 | ret = prepare_to_wait_event(&ticket->wait, &wait, TASK_KILLABLE); | |
1474 | if (ret) { | |
0cab7acc FM |
1475 | /* |
1476 | * Delete us from the list. After we unlock the space | |
1477 | * info, we don't want the async reclaim job to reserve | |
1478 | * space for this ticket. If that would happen, then the | |
1479 | * ticket's task would not known that space was reserved | |
1480 | * despite getting an error, resulting in a space leak | |
1481 | * (bytes_may_use counter of our space_info). | |
1482 | */ | |
d611add4 | 1483 | remove_ticket(space_info, ticket); |
374bf9c5 | 1484 | ticket->error = -EINTR; |
0d9764f6 JB |
1485 | break; |
1486 | } | |
1487 | spin_unlock(&space_info->lock); | |
1488 | ||
1489 | schedule(); | |
1490 | ||
1491 | finish_wait(&ticket->wait, &wait); | |
1492 | spin_lock(&space_info->lock); | |
1493 | } | |
0d9764f6 | 1494 | spin_unlock(&space_info->lock); |
0d9764f6 JB |
1495 | } |
1496 | ||
43dd529a DS |
1497 | /* |
1498 | * Do the appropriate flushing and waiting for a ticket. | |
d98b188e NB |
1499 | * |
1500 | * @fs_info: the filesystem | |
1501 | * @space_info: space info for the reservation | |
1502 | * @ticket: ticket for the reservation | |
ac1ea10e JB |
1503 | * @start_ns: timestamp when the reservation started |
1504 | * @orig_bytes: amount of bytes originally reserved | |
d98b188e | 1505 | * @flush: how much we can flush |
03235279 JB |
1506 | * |
1507 | * This does the work of figuring out how to flush for the ticket, waiting for | |
1508 | * the reservation, and returning the appropriate error if there is one. | |
1509 | */ | |
1510 | static int handle_reserve_ticket(struct btrfs_fs_info *fs_info, | |
1511 | struct btrfs_space_info *space_info, | |
1512 | struct reserve_ticket *ticket, | |
ac1ea10e | 1513 | u64 start_ns, u64 orig_bytes, |
03235279 JB |
1514 | enum btrfs_reserve_flush_enum flush) |
1515 | { | |
03235279 JB |
1516 | int ret; |
1517 | ||
d3984c90 | 1518 | switch (flush) { |
57056740 | 1519 | case BTRFS_RESERVE_FLUSH_DATA: |
d3984c90 | 1520 | case BTRFS_RESERVE_FLUSH_ALL: |
7f9fe614 | 1521 | case BTRFS_RESERVE_FLUSH_ALL_STEAL: |
03235279 | 1522 | wait_reserve_ticket(fs_info, space_info, ticket); |
d3984c90 JB |
1523 | break; |
1524 | case BTRFS_RESERVE_FLUSH_LIMIT: | |
9ce2f423 JB |
1525 | priority_reclaim_metadata_space(fs_info, space_info, ticket, |
1526 | priority_flush_states, | |
1527 | ARRAY_SIZE(priority_flush_states)); | |
d3984c90 JB |
1528 | break; |
1529 | case BTRFS_RESERVE_FLUSH_EVICT: | |
1530 | priority_reclaim_metadata_space(fs_info, space_info, ticket, | |
1531 | evict_flush_states, | |
1532 | ARRAY_SIZE(evict_flush_states)); | |
1533 | break; | |
1004f686 | 1534 | case BTRFS_RESERVE_FLUSH_FREE_SPACE_INODE: |
57056740 | 1535 | priority_reclaim_data_space(fs_info, space_info, ticket); |
1004f686 | 1536 | break; |
d3984c90 JB |
1537 | default: |
1538 | ASSERT(0); | |
1539 | break; | |
1540 | } | |
03235279 | 1541 | |
03235279 | 1542 | ret = ticket->error; |
03235279 | 1543 | ASSERT(list_empty(&ticket->list)); |
0cab7acc FM |
1544 | /* |
1545 | * Check that we can't have an error set if the reservation succeeded, | |
1546 | * as that would confuse tasks and lead them to error out without | |
1547 | * releasing reserved space (if an error happens the expectation is that | |
1548 | * space wasn't reserved at all). | |
1549 | */ | |
1550 | ASSERT(!(ticket->bytes == 0 && ticket->error)); | |
ac1ea10e JB |
1551 | trace_btrfs_reserve_ticket(fs_info, space_info->flags, orig_bytes, |
1552 | start_ns, flush, ticket->error); | |
03235279 JB |
1553 | return ret; |
1554 | } | |
1555 | ||
666daa9f JB |
1556 | /* |
1557 | * This returns true if this flush state will go through the ordinary flushing | |
1558 | * code. | |
1559 | */ | |
1560 | static inline bool is_normal_flushing(enum btrfs_reserve_flush_enum flush) | |
1561 | { | |
1562 | return (flush == BTRFS_RESERVE_FLUSH_ALL) || | |
1563 | (flush == BTRFS_RESERVE_FLUSH_ALL_STEAL); | |
1564 | } | |
1565 | ||
88a777a6 JB |
1566 | static inline void maybe_clamp_preempt(struct btrfs_fs_info *fs_info, |
1567 | struct btrfs_space_info *space_info) | |
1568 | { | |
1569 | u64 ordered = percpu_counter_sum_positive(&fs_info->ordered_bytes); | |
1570 | u64 delalloc = percpu_counter_sum_positive(&fs_info->delalloc_bytes); | |
1571 | ||
1572 | /* | |
1573 | * If we're heavy on ordered operations then clamping won't help us. We | |
1574 | * need to clamp specifically to keep up with dirty'ing buffered | |
1575 | * writers, because there's not a 1:1 correlation of writing delalloc | |
1576 | * and freeing space, like there is with flushing delayed refs or | |
1577 | * delayed nodes. If we're already more ordered than delalloc then | |
1578 | * we're keeping up, otherwise we aren't and should probably clamp. | |
1579 | */ | |
1580 | if (ordered < delalloc) | |
1581 | space_info->clamp = min(space_info->clamp + 1, 8); | |
1582 | } | |
1583 | ||
ee6adbfd JB |
1584 | static inline bool can_steal(enum btrfs_reserve_flush_enum flush) |
1585 | { | |
1586 | return (flush == BTRFS_RESERVE_FLUSH_ALL_STEAL || | |
1587 | flush == BTRFS_RESERVE_FLUSH_EVICT); | |
1588 | } | |
1589 | ||
765c3fe9 JB |
1590 | /* |
1591 | * NO_FLUSH and FLUSH_EMERGENCY don't want to create a ticket, they just want to | |
1592 | * fail as quickly as possible. | |
1593 | */ | |
1594 | static inline bool can_ticket(enum btrfs_reserve_flush_enum flush) | |
1595 | { | |
1596 | return (flush != BTRFS_RESERVE_NO_FLUSH && | |
1597 | flush != BTRFS_RESERVE_FLUSH_EMERGENCY); | |
1598 | } | |
1599 | ||
43dd529a DS |
1600 | /* |
1601 | * Try to reserve bytes from the block_rsv's space. | |
d98b188e NB |
1602 | * |
1603 | * @fs_info: the filesystem | |
1604 | * @space_info: space info we want to allocate from | |
1605 | * @orig_bytes: number of bytes we want | |
1606 | * @flush: whether or not we can flush to make our reservation | |
0d9764f6 JB |
1607 | * |
1608 | * This will reserve orig_bytes number of bytes from the space info associated | |
1609 | * with the block_rsv. If there is not enough space it will make an attempt to | |
1610 | * flush out space to make room. It will do this by flushing delalloc if | |
1611 | * possible or committing the transaction. If flush is 0 then no attempts to | |
1612 | * regain reservations will be made and this will fail if there is not enough | |
1613 | * space already. | |
1614 | */ | |
f3bda421 JB |
1615 | static int __reserve_bytes(struct btrfs_fs_info *fs_info, |
1616 | struct btrfs_space_info *space_info, u64 orig_bytes, | |
1617 | enum btrfs_reserve_flush_enum flush) | |
0d9764f6 | 1618 | { |
57056740 | 1619 | struct work_struct *async_work; |
0d9764f6 | 1620 | struct reserve_ticket ticket; |
ac1ea10e | 1621 | u64 start_ns = 0; |
0d9764f6 | 1622 | u64 used; |
0d9764f6 | 1623 | int ret = 0; |
ef1317a1 | 1624 | bool pending_tickets; |
0d9764f6 JB |
1625 | |
1626 | ASSERT(orig_bytes); | |
1627 | ASSERT(!current->journal_info || flush != BTRFS_RESERVE_FLUSH_ALL); | |
1628 | ||
57056740 JB |
1629 | if (flush == BTRFS_RESERVE_FLUSH_DATA) |
1630 | async_work = &fs_info->async_data_reclaim_work; | |
1631 | else | |
1632 | async_work = &fs_info->async_reclaim_work; | |
1633 | ||
0d9764f6 JB |
1634 | spin_lock(&space_info->lock); |
1635 | ret = -ENOSPC; | |
1636 | used = btrfs_space_info_used(space_info, true); | |
666daa9f JB |
1637 | |
1638 | /* | |
1639 | * We don't want NO_FLUSH allocations to jump everybody, they can | |
1640 | * generally handle ENOSPC in a different way, so treat them the same as | |
1641 | * normal flushers when it comes to skipping pending tickets. | |
1642 | */ | |
1643 | if (is_normal_flushing(flush) || (flush == BTRFS_RESERVE_NO_FLUSH)) | |
1644 | pending_tickets = !list_empty(&space_info->tickets) || | |
1645 | !list_empty(&space_info->priority_tickets); | |
1646 | else | |
1647 | pending_tickets = !list_empty(&space_info->priority_tickets); | |
0d9764f6 JB |
1648 | |
1649 | /* | |
9b4851bc GR |
1650 | * Carry on if we have enough space (short-circuit) OR call |
1651 | * can_overcommit() to ensure we can overcommit to continue. | |
0d9764f6 | 1652 | */ |
ef1317a1 | 1653 | if (!pending_tickets && |
6a921de5 | 1654 | ((used + orig_bytes <= writable_total_bytes(fs_info, space_info)) || |
a30a3d20 | 1655 | btrfs_can_overcommit(fs_info, space_info, orig_bytes, flush))) { |
0d9764f6 JB |
1656 | btrfs_space_info_update_bytes_may_use(fs_info, space_info, |
1657 | orig_bytes); | |
0d9764f6 JB |
1658 | ret = 0; |
1659 | } | |
1660 | ||
765c3fe9 JB |
1661 | /* |
1662 | * Things are dire, we need to make a reservation so we don't abort. We | |
1663 | * will let this reservation go through as long as we have actual space | |
1664 | * left to allocate for the block. | |
1665 | */ | |
1666 | if (ret && unlikely(flush == BTRFS_RESERVE_FLUSH_EMERGENCY)) { | |
1667 | used = btrfs_space_info_used(space_info, false); | |
1668 | if (used + orig_bytes <= | |
1669 | writable_total_bytes(fs_info, space_info)) { | |
1670 | btrfs_space_info_update_bytes_may_use(fs_info, space_info, | |
1671 | orig_bytes); | |
1672 | ret = 0; | |
1673 | } | |
1674 | } | |
1675 | ||
0d9764f6 JB |
1676 | /* |
1677 | * If we couldn't make a reservation then setup our reservation ticket | |
1678 | * and kick the async worker if it's not already running. | |
1679 | * | |
1680 | * If we are a priority flusher then we just need to add our ticket to | |
1681 | * the list and we will do our own flushing further down. | |
1682 | */ | |
765c3fe9 | 1683 | if (ret && can_ticket(flush)) { |
0d9764f6 JB |
1684 | ticket.bytes = orig_bytes; |
1685 | ticket.error = 0; | |
db161806 | 1686 | space_info->reclaim_size += ticket.bytes; |
0d9764f6 | 1687 | init_waitqueue_head(&ticket.wait); |
ee6adbfd | 1688 | ticket.steal = can_steal(flush); |
ac1ea10e JB |
1689 | if (trace_btrfs_reserve_ticket_enabled()) |
1690 | start_ns = ktime_get_ns(); | |
1691 | ||
7f9fe614 | 1692 | if (flush == BTRFS_RESERVE_FLUSH_ALL || |
57056740 JB |
1693 | flush == BTRFS_RESERVE_FLUSH_ALL_STEAL || |
1694 | flush == BTRFS_RESERVE_FLUSH_DATA) { | |
0d9764f6 JB |
1695 | list_add_tail(&ticket.list, &space_info->tickets); |
1696 | if (!space_info->flush) { | |
0aae4ca9 JB |
1697 | /* |
1698 | * We were forced to add a reserve ticket, so | |
1699 | * our preemptive flushing is unable to keep | |
1700 | * up. Clamp down on the threshold for the | |
1701 | * preemptive flushing in order to keep up with | |
1702 | * the workload. | |
1703 | */ | |
1704 | maybe_clamp_preempt(fs_info, space_info); | |
1705 | ||
0d9764f6 JB |
1706 | space_info->flush = 1; |
1707 | trace_btrfs_trigger_flush(fs_info, | |
1708 | space_info->flags, | |
1709 | orig_bytes, flush, | |
1710 | "enospc"); | |
57056740 | 1711 | queue_work(system_unbound_wq, async_work); |
0d9764f6 JB |
1712 | } |
1713 | } else { | |
1714 | list_add_tail(&ticket.list, | |
1715 | &space_info->priority_tickets); | |
1716 | } | |
1717 | } else if (!ret && space_info->flags & BTRFS_BLOCK_GROUP_METADATA) { | |
0d9764f6 JB |
1718 | /* |
1719 | * We will do the space reservation dance during log replay, | |
1720 | * which means we won't have fs_info->fs_root set, so don't do | |
1721 | * the async reclaim as we will panic. | |
1722 | */ | |
1723 | if (!test_bit(BTRFS_FS_LOG_RECOVERING, &fs_info->flags) && | |
ed738ba7 JB |
1724 | !work_busy(&fs_info->preempt_reclaim_work) && |
1725 | need_preemptive_reclaim(fs_info, space_info)) { | |
0d9764f6 JB |
1726 | trace_btrfs_trigger_flush(fs_info, space_info->flags, |
1727 | orig_bytes, flush, "preempt"); | |
1728 | queue_work(system_unbound_wq, | |
576fa348 | 1729 | &fs_info->preempt_reclaim_work); |
0d9764f6 JB |
1730 | } |
1731 | } | |
1732 | spin_unlock(&space_info->lock); | |
765c3fe9 | 1733 | if (!ret || !can_ticket(flush)) |
0d9764f6 JB |
1734 | return ret; |
1735 | ||
ac1ea10e JB |
1736 | return handle_reserve_ticket(fs_info, space_info, &ticket, start_ns, |
1737 | orig_bytes, flush); | |
0d9764f6 JB |
1738 | } |
1739 | ||
43dd529a DS |
1740 | /* |
1741 | * Try to reserve metadata bytes from the block_rsv's space. | |
d98b188e | 1742 | * |
be8d1a2a | 1743 | * @fs_info: the filesystem |
d98b188e NB |
1744 | * @block_rsv: block_rsv we're allocating for |
1745 | * @orig_bytes: number of bytes we want | |
1746 | * @flush: whether or not we can flush to make our reservation | |
0d9764f6 JB |
1747 | * |
1748 | * This will reserve orig_bytes number of bytes from the space info associated | |
1749 | * with the block_rsv. If there is not enough space it will make an attempt to | |
1750 | * flush out space to make room. It will do this by flushing delalloc if | |
1751 | * possible or committing the transaction. If flush is 0 then no attempts to | |
1752 | * regain reservations will be made and this will fail if there is not enough | |
1753 | * space already. | |
1754 | */ | |
9270501c | 1755 | int btrfs_reserve_metadata_bytes(struct btrfs_fs_info *fs_info, |
0d9764f6 JB |
1756 | struct btrfs_block_rsv *block_rsv, |
1757 | u64 orig_bytes, | |
1758 | enum btrfs_reserve_flush_enum flush) | |
1759 | { | |
0d9764f6 | 1760 | int ret; |
0d9764f6 | 1761 | |
f3bda421 | 1762 | ret = __reserve_bytes(fs_info, block_rsv->space_info, orig_bytes, flush); |
0d9764f6 JB |
1763 | if (ret == -ENOSPC) { |
1764 | trace_btrfs_space_reservation(fs_info, "space_info:enospc", | |
1765 | block_rsv->space_info->flags, | |
1766 | orig_bytes, 1); | |
1767 | ||
1768 | if (btrfs_test_opt(fs_info, ENOSPC_DEBUG)) | |
1769 | btrfs_dump_space_info(fs_info, block_rsv->space_info, | |
1770 | orig_bytes, 0); | |
1771 | } | |
1772 | return ret; | |
1773 | } | |
8698fc4e | 1774 | |
43dd529a DS |
1775 | /* |
1776 | * Try to reserve data bytes for an allocation. | |
d98b188e NB |
1777 | * |
1778 | * @fs_info: the filesystem | |
1779 | * @bytes: number of bytes we need | |
1780 | * @flush: how we are allowed to flush | |
8698fc4e JB |
1781 | * |
1782 | * This will reserve bytes from the data space info. If there is not enough | |
1783 | * space then we will attempt to flush space as specified by flush. | |
1784 | */ | |
1785 | int btrfs_reserve_data_bytes(struct btrfs_fs_info *fs_info, u64 bytes, | |
1786 | enum btrfs_reserve_flush_enum flush) | |
1787 | { | |
1788 | struct btrfs_space_info *data_sinfo = fs_info->data_sinfo; | |
f3bda421 | 1789 | int ret; |
8698fc4e | 1790 | |
f3bda421 | 1791 | ASSERT(flush == BTRFS_RESERVE_FLUSH_DATA || |
1daedb1d JB |
1792 | flush == BTRFS_RESERVE_FLUSH_FREE_SPACE_INODE || |
1793 | flush == BTRFS_RESERVE_NO_FLUSH); | |
8698fc4e JB |
1794 | ASSERT(!current->journal_info || flush != BTRFS_RESERVE_FLUSH_DATA); |
1795 | ||
f3bda421 JB |
1796 | ret = __reserve_bytes(fs_info, data_sinfo, bytes, flush); |
1797 | if (ret == -ENOSPC) { | |
1798 | trace_btrfs_space_reservation(fs_info, "space_info:enospc", | |
8698fc4e | 1799 | data_sinfo->flags, bytes, 1); |
f3bda421 JB |
1800 | if (btrfs_test_opt(fs_info, ENOSPC_DEBUG)) |
1801 | btrfs_dump_space_info(fs_info, data_sinfo, bytes, 0); | |
1802 | } | |
8698fc4e JB |
1803 | return ret; |
1804 | } | |
8e327b9c QW |
1805 | |
1806 | /* Dump all the space infos when we abort a transaction due to ENOSPC. */ | |
1807 | __cold void btrfs_dump_space_info_for_trans_abort(struct btrfs_fs_info *fs_info) | |
1808 | { | |
1809 | struct btrfs_space_info *space_info; | |
1810 | ||
1811 | btrfs_info(fs_info, "dumping space info:"); | |
1812 | list_for_each_entry(space_info, &fs_info->space_info, list) { | |
1813 | spin_lock(&space_info->lock); | |
1814 | __btrfs_dump_space_info(fs_info, space_info); | |
1815 | spin_unlock(&space_info->lock); | |
1816 | } | |
1817 | dump_global_block_rsv(fs_info); | |
1818 | } | |
e2f13b34 JB |
1819 | |
1820 | /* | |
1821 | * Account the unused space of all the readonly block group in the space_info. | |
1822 | * takes mirrors into account. | |
1823 | */ | |
1824 | u64 btrfs_account_ro_block_groups_free_space(struct btrfs_space_info *sinfo) | |
1825 | { | |
1826 | struct btrfs_block_group *block_group; | |
1827 | u64 free_bytes = 0; | |
1828 | int factor; | |
1829 | ||
1830 | /* It's df, we don't care if it's racy */ | |
1831 | if (list_empty(&sinfo->ro_bgs)) | |
1832 | return 0; | |
1833 | ||
1834 | spin_lock(&sinfo->lock); | |
1835 | list_for_each_entry(block_group, &sinfo->ro_bgs, ro_list) { | |
1836 | spin_lock(&block_group->lock); | |
1837 | ||
1838 | if (!block_group->ro) { | |
1839 | spin_unlock(&block_group->lock); | |
1840 | continue; | |
1841 | } | |
1842 | ||
1843 | factor = btrfs_bg_type_to_factor(block_group->flags); | |
1844 | free_bytes += (block_group->length - | |
1845 | block_group->used) * factor; | |
1846 | ||
1847 | spin_unlock(&block_group->lock); | |
1848 | } | |
1849 | spin_unlock(&sinfo->lock); | |
1850 | ||
1851 | return free_bytes; | |
1852 | } |