]>
Commit | Line | Data |
---|---|---|
c1d7c514 | 1 | // SPDX-License-Identifier: GPL-2.0 |
6cbd5570 CM |
2 | /* |
3 | * Copyright (C) 2007 Oracle. All rights reserved. | |
6cbd5570 CM |
4 | */ |
5 | ||
581bb050 LZ |
6 | #include <linux/kthread.h> |
7 | #include <linux/pagemap.h> | |
8 | ||
9f5fae2f CM |
9 | #include "ctree.h" |
10 | #include "disk-io.h" | |
581bb050 LZ |
11 | #include "free-space-cache.h" |
12 | #include "inode-map.h" | |
9f5fae2f | 13 | #include "transaction.h" |
86736342 | 14 | #include "delalloc-space.h" |
9f5fae2f | 15 | |
a68ebe07 FM |
16 | static void fail_caching_thread(struct btrfs_root *root) |
17 | { | |
18 | struct btrfs_fs_info *fs_info = root->fs_info; | |
19 | ||
20 | btrfs_warn(fs_info, "failed to start inode caching task"); | |
21 | btrfs_clear_pending_and_info(fs_info, INODE_MAP_CACHE, | |
22 | "disabling inode map caching"); | |
23 | spin_lock(&root->ino_cache_lock); | |
24 | root->ino_cache_state = BTRFS_CACHE_ERROR; | |
25 | spin_unlock(&root->ino_cache_lock); | |
26 | wake_up(&root->ino_cache_wait); | |
27 | } | |
28 | ||
581bb050 LZ |
29 | static int caching_kthread(void *data) |
30 | { | |
31 | struct btrfs_root *root = data; | |
32 | struct btrfs_fs_info *fs_info = root->fs_info; | |
33 | struct btrfs_free_space_ctl *ctl = root->free_ino_ctl; | |
34 | struct btrfs_key key; | |
35 | struct btrfs_path *path; | |
36 | struct extent_buffer *leaf; | |
37 | u64 last = (u64)-1; | |
38 | int slot; | |
39 | int ret; | |
40 | ||
0b246afa | 41 | if (!btrfs_test_opt(fs_info, INODE_MAP_CACHE)) |
4b9465cb CM |
42 | return 0; |
43 | ||
581bb050 | 44 | path = btrfs_alloc_path(); |
9d123a35 FM |
45 | if (!path) { |
46 | fail_caching_thread(root); | |
581bb050 | 47 | return -ENOMEM; |
9d123a35 | 48 | } |
581bb050 LZ |
49 | |
50 | /* Since the commit root is read-only, we can safely skip locking. */ | |
51 | path->skip_locking = 1; | |
52 | path->search_commit_root = 1; | |
e4058b54 | 53 | path->reada = READA_FORWARD; |
581bb050 LZ |
54 | |
55 | key.objectid = BTRFS_FIRST_FREE_OBJECTID; | |
56 | key.offset = 0; | |
57 | key.type = BTRFS_INODE_ITEM_KEY; | |
58 | again: | |
59 | /* need to make sure the commit_root doesn't disappear */ | |
9e351cc8 | 60 | down_read(&fs_info->commit_root_sem); |
581bb050 LZ |
61 | |
62 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
63 | if (ret < 0) | |
64 | goto out; | |
65 | ||
66 | while (1) { | |
7841cb28 | 67 | if (btrfs_fs_closing(fs_info)) |
581bb050 LZ |
68 | goto out; |
69 | ||
70 | leaf = path->nodes[0]; | |
71 | slot = path->slots[0]; | |
a47d6b70 | 72 | if (slot >= btrfs_header_nritems(leaf)) { |
581bb050 LZ |
73 | ret = btrfs_next_leaf(root, path); |
74 | if (ret < 0) | |
75 | goto out; | |
76 | else if (ret > 0) | |
77 | break; | |
78 | ||
79 | if (need_resched() || | |
80 | btrfs_transaction_in_commit(fs_info)) { | |
81 | leaf = path->nodes[0]; | |
82 | ||
fae7f21c | 83 | if (WARN_ON(btrfs_header_nritems(leaf) == 0)) |
581bb050 | 84 | break; |
581bb050 LZ |
85 | |
86 | /* | |
87 | * Save the key so we can advances forward | |
88 | * in the next search. | |
89 | */ | |
90 | btrfs_item_key_to_cpu(leaf, &key, 0); | |
945d8962 | 91 | btrfs_release_path(path); |
57cdc8db | 92 | root->ino_cache_progress = last; |
9e351cc8 | 93 | up_read(&fs_info->commit_root_sem); |
581bb050 LZ |
94 | schedule_timeout(1); |
95 | goto again; | |
96 | } else | |
97 | continue; | |
98 | } | |
99 | ||
100 | btrfs_item_key_to_cpu(leaf, &key, slot); | |
101 | ||
102 | if (key.type != BTRFS_INODE_ITEM_KEY) | |
103 | goto next; | |
104 | ||
a47d6b70 | 105 | if (key.objectid >= root->highest_objectid) |
581bb050 LZ |
106 | break; |
107 | ||
108 | if (last != (u64)-1 && last + 1 != key.objectid) { | |
ab8d0fc4 | 109 | __btrfs_add_free_space(fs_info, ctl, last + 1, |
581bb050 | 110 | key.objectid - last - 1); |
57cdc8db | 111 | wake_up(&root->ino_cache_wait); |
581bb050 LZ |
112 | } |
113 | ||
114 | last = key.objectid; | |
115 | next: | |
116 | path->slots[0]++; | |
117 | } | |
118 | ||
a47d6b70 | 119 | if (last < root->highest_objectid - 1) { |
ab8d0fc4 | 120 | __btrfs_add_free_space(fs_info, ctl, last + 1, |
a47d6b70 | 121 | root->highest_objectid - last - 1); |
581bb050 LZ |
122 | } |
123 | ||
57cdc8db DS |
124 | spin_lock(&root->ino_cache_lock); |
125 | root->ino_cache_state = BTRFS_CACHE_FINISHED; | |
126 | spin_unlock(&root->ino_cache_lock); | |
581bb050 | 127 | |
57cdc8db | 128 | root->ino_cache_progress = (u64)-1; |
581bb050 LZ |
129 | btrfs_unpin_free_ino(root); |
130 | out: | |
57cdc8db | 131 | wake_up(&root->ino_cache_wait); |
9e351cc8 | 132 | up_read(&fs_info->commit_root_sem); |
581bb050 LZ |
133 | |
134 | btrfs_free_path(path); | |
135 | ||
136 | return ret; | |
137 | } | |
138 | ||
139 | static void start_caching(struct btrfs_root *root) | |
140 | { | |
ab8d0fc4 | 141 | struct btrfs_fs_info *fs_info = root->fs_info; |
a47d6b70 | 142 | struct btrfs_free_space_ctl *ctl = root->free_ino_ctl; |
581bb050 | 143 | struct task_struct *tsk; |
82d5902d | 144 | int ret; |
a47d6b70 | 145 | u64 objectid; |
581bb050 | 146 | |
ab8d0fc4 | 147 | if (!btrfs_test_opt(fs_info, INODE_MAP_CACHE)) |
4b9465cb CM |
148 | return; |
149 | ||
57cdc8db DS |
150 | spin_lock(&root->ino_cache_lock); |
151 | if (root->ino_cache_state != BTRFS_CACHE_NO) { | |
152 | spin_unlock(&root->ino_cache_lock); | |
581bb050 LZ |
153 | return; |
154 | } | |
155 | ||
57cdc8db DS |
156 | root->ino_cache_state = BTRFS_CACHE_STARTED; |
157 | spin_unlock(&root->ino_cache_lock); | |
581bb050 | 158 | |
ab8d0fc4 | 159 | ret = load_free_ino_cache(fs_info, root); |
82d5902d | 160 | if (ret == 1) { |
57cdc8db DS |
161 | spin_lock(&root->ino_cache_lock); |
162 | root->ino_cache_state = BTRFS_CACHE_FINISHED; | |
163 | spin_unlock(&root->ino_cache_lock); | |
7764d56b | 164 | wake_up(&root->ino_cache_wait); |
82d5902d LZ |
165 | return; |
166 | } | |
167 | ||
a47d6b70 LZ |
168 | /* |
169 | * It can be quite time-consuming to fill the cache by searching | |
170 | * through the extent tree, and this can keep ino allocation path | |
171 | * waiting. Therefore at start we quickly find out the highest | |
172 | * inode number and we know we can use inode numbers which fall in | |
173 | * [highest_ino + 1, BTRFS_LAST_FREE_OBJECTID]. | |
174 | */ | |
175 | ret = btrfs_find_free_objectid(root, &objectid); | |
176 | if (!ret && objectid <= BTRFS_LAST_FREE_OBJECTID) { | |
ab8d0fc4 | 177 | __btrfs_add_free_space(fs_info, ctl, objectid, |
a47d6b70 LZ |
178 | BTRFS_LAST_FREE_OBJECTID - objectid + 1); |
179 | } | |
180 | ||
67a77eb1 | 181 | tsk = kthread_run(caching_kthread, root, "btrfs-ino-cache-%llu", |
581bb050 | 182 | root->root_key.objectid); |
a68ebe07 FM |
183 | if (IS_ERR(tsk)) |
184 | fail_caching_thread(root); | |
581bb050 LZ |
185 | } |
186 | ||
187 | int btrfs_find_free_ino(struct btrfs_root *root, u64 *objectid) | |
188 | { | |
3cdde224 | 189 | if (!btrfs_test_opt(root->fs_info, INODE_MAP_CACHE)) |
4b9465cb CM |
190 | return btrfs_find_free_objectid(root, objectid); |
191 | ||
581bb050 LZ |
192 | again: |
193 | *objectid = btrfs_find_ino_for_alloc(root); | |
194 | ||
195 | if (*objectid != 0) | |
196 | return 0; | |
197 | ||
198 | start_caching(root); | |
199 | ||
57cdc8db DS |
200 | wait_event(root->ino_cache_wait, |
201 | root->ino_cache_state == BTRFS_CACHE_FINISHED || | |
a68ebe07 | 202 | root->ino_cache_state == BTRFS_CACHE_ERROR || |
581bb050 LZ |
203 | root->free_ino_ctl->free_space > 0); |
204 | ||
57cdc8db | 205 | if (root->ino_cache_state == BTRFS_CACHE_FINISHED && |
581bb050 LZ |
206 | root->free_ino_ctl->free_space == 0) |
207 | return -ENOSPC; | |
a68ebe07 FM |
208 | else if (root->ino_cache_state == BTRFS_CACHE_ERROR) |
209 | return btrfs_find_free_objectid(root, objectid); | |
581bb050 LZ |
210 | else |
211 | goto again; | |
212 | } | |
213 | ||
214 | void btrfs_return_ino(struct btrfs_root *root, u64 objectid) | |
215 | { | |
ab8d0fc4 | 216 | struct btrfs_fs_info *fs_info = root->fs_info; |
581bb050 | 217 | struct btrfs_free_space_ctl *pinned = root->free_ino_pinned; |
4b9465cb | 218 | |
ab8d0fc4 | 219 | if (!btrfs_test_opt(fs_info, INODE_MAP_CACHE)) |
4b9465cb | 220 | return; |
581bb050 | 221 | again: |
57cdc8db | 222 | if (root->ino_cache_state == BTRFS_CACHE_FINISHED) { |
ab8d0fc4 | 223 | __btrfs_add_free_space(fs_info, pinned, objectid, 1); |
581bb050 | 224 | } else { |
ab8d0fc4 | 225 | down_write(&fs_info->commit_root_sem); |
57cdc8db DS |
226 | spin_lock(&root->ino_cache_lock); |
227 | if (root->ino_cache_state == BTRFS_CACHE_FINISHED) { | |
228 | spin_unlock(&root->ino_cache_lock); | |
ab8d0fc4 | 229 | up_write(&fs_info->commit_root_sem); |
581bb050 LZ |
230 | goto again; |
231 | } | |
57cdc8db | 232 | spin_unlock(&root->ino_cache_lock); |
581bb050 LZ |
233 | |
234 | start_caching(root); | |
235 | ||
ab8d0fc4 | 236 | __btrfs_add_free_space(fs_info, pinned, objectid, 1); |
581bb050 | 237 | |
ab8d0fc4 | 238 | up_write(&fs_info->commit_root_sem); |
581bb050 LZ |
239 | } |
240 | } | |
241 | ||
242 | /* | |
57cdc8db DS |
243 | * When a transaction is committed, we'll move those inode numbers which are |
244 | * smaller than root->ino_cache_progress from pinned tree to free_ino tree, and | |
245 | * others will just be dropped, because the commit root we were searching has | |
246 | * changed. | |
581bb050 | 247 | * |
9e351cc8 | 248 | * Must be called with root->fs_info->commit_root_sem held |
581bb050 LZ |
249 | */ |
250 | void btrfs_unpin_free_ino(struct btrfs_root *root) | |
251 | { | |
252 | struct btrfs_free_space_ctl *ctl = root->free_ino_ctl; | |
253 | struct rb_root *rbroot = &root->free_ino_pinned->free_space_offset; | |
ae9d8f17 | 254 | spinlock_t *rbroot_lock = &root->free_ino_pinned->tree_lock; |
581bb050 LZ |
255 | struct btrfs_free_space *info; |
256 | struct rb_node *n; | |
257 | u64 count; | |
258 | ||
3cdde224 | 259 | if (!btrfs_test_opt(root->fs_info, INODE_MAP_CACHE)) |
4b9465cb CM |
260 | return; |
261 | ||
581bb050 | 262 | while (1) { |
ae9d8f17 | 263 | spin_lock(rbroot_lock); |
581bb050 | 264 | n = rb_first(rbroot); |
ae9d8f17 FM |
265 | if (!n) { |
266 | spin_unlock(rbroot_lock); | |
581bb050 | 267 | break; |
ae9d8f17 | 268 | } |
581bb050 LZ |
269 | |
270 | info = rb_entry(n, struct btrfs_free_space, offset_index); | |
79787eaa | 271 | BUG_ON(info->bitmap); /* Logic error */ |
581bb050 | 272 | |
57cdc8db | 273 | if (info->offset > root->ino_cache_progress) |
bc931c0e | 274 | count = 0; |
581bb050 | 275 | else |
bc931c0e GU |
276 | count = min(root->ino_cache_progress - info->offset + 1, |
277 | info->bytes); | |
581bb050 | 278 | |
581bb050 | 279 | rb_erase(&info->offset_index, rbroot); |
ae9d8f17 | 280 | spin_unlock(rbroot_lock); |
bc931c0e | 281 | if (count) |
ab8d0fc4 JM |
282 | __btrfs_add_free_space(root->fs_info, ctl, |
283 | info->offset, count); | |
c3f4a168 | 284 | kmem_cache_free(btrfs_free_space_cachep, info); |
581bb050 LZ |
285 | } |
286 | } | |
287 | ||
ee22184b | 288 | #define INIT_THRESHOLD ((SZ_32K / 2) / sizeof(struct btrfs_free_space)) |
09cbfeaf | 289 | #define INODES_PER_BITMAP (PAGE_SIZE * 8) |
581bb050 LZ |
290 | |
291 | /* | |
292 | * The goal is to keep the memory used by the free_ino tree won't | |
293 | * exceed the memory if we use bitmaps only. | |
294 | */ | |
295 | static void recalculate_thresholds(struct btrfs_free_space_ctl *ctl) | |
296 | { | |
297 | struct btrfs_free_space *info; | |
298 | struct rb_node *n; | |
299 | int max_ino; | |
300 | int max_bitmaps; | |
301 | ||
302 | n = rb_last(&ctl->free_space_offset); | |
303 | if (!n) { | |
304 | ctl->extents_thresh = INIT_THRESHOLD; | |
305 | return; | |
306 | } | |
307 | info = rb_entry(n, struct btrfs_free_space, offset_index); | |
308 | ||
309 | /* | |
310 | * Find the maximum inode number in the filesystem. Note we | |
311 | * ignore the fact that this can be a bitmap, because we are | |
312 | * not doing precise calculation. | |
313 | */ | |
314 | max_ino = info->bytes - 1; | |
315 | ||
316 | max_bitmaps = ALIGN(max_ino, INODES_PER_BITMAP) / INODES_PER_BITMAP; | |
317 | if (max_bitmaps <= ctl->total_bitmaps) { | |
318 | ctl->extents_thresh = 0; | |
319 | return; | |
320 | } | |
321 | ||
322 | ctl->extents_thresh = (max_bitmaps - ctl->total_bitmaps) * | |
09cbfeaf | 323 | PAGE_SIZE / sizeof(*info); |
581bb050 LZ |
324 | } |
325 | ||
326 | /* | |
327 | * We don't fall back to bitmap, if we are below the extents threshold | |
328 | * or this chunk of inode numbers is a big one. | |
329 | */ | |
330 | static bool use_bitmap(struct btrfs_free_space_ctl *ctl, | |
331 | struct btrfs_free_space *info) | |
332 | { | |
333 | if (ctl->free_extents < ctl->extents_thresh || | |
334 | info->bytes > INODES_PER_BITMAP / 10) | |
335 | return false; | |
336 | ||
337 | return true; | |
338 | } | |
339 | ||
20e5506b | 340 | static const struct btrfs_free_space_op free_ino_op = { |
581bb050 LZ |
341 | .recalc_thresholds = recalculate_thresholds, |
342 | .use_bitmap = use_bitmap, | |
343 | }; | |
344 | ||
345 | static void pinned_recalc_thresholds(struct btrfs_free_space_ctl *ctl) | |
346 | { | |
347 | } | |
348 | ||
349 | static bool pinned_use_bitmap(struct btrfs_free_space_ctl *ctl, | |
350 | struct btrfs_free_space *info) | |
351 | { | |
352 | /* | |
353 | * We always use extents for two reasons: | |
354 | * | |
355 | * - The pinned tree is only used during the process of caching | |
356 | * work. | |
357 | * - Make code simpler. See btrfs_unpin_free_ino(). | |
358 | */ | |
359 | return false; | |
360 | } | |
361 | ||
20e5506b | 362 | static const struct btrfs_free_space_op pinned_free_ino_op = { |
581bb050 LZ |
363 | .recalc_thresholds = pinned_recalc_thresholds, |
364 | .use_bitmap = pinned_use_bitmap, | |
365 | }; | |
366 | ||
367 | void btrfs_init_free_ino_ctl(struct btrfs_root *root) | |
368 | { | |
369 | struct btrfs_free_space_ctl *ctl = root->free_ino_ctl; | |
370 | struct btrfs_free_space_ctl *pinned = root->free_ino_pinned; | |
371 | ||
372 | spin_lock_init(&ctl->tree_lock); | |
373 | ctl->unit = 1; | |
374 | ctl->start = 0; | |
375 | ctl->private = NULL; | |
376 | ctl->op = &free_ino_op; | |
55507ce3 FM |
377 | INIT_LIST_HEAD(&ctl->trimming_ranges); |
378 | mutex_init(&ctl->cache_writeout_mutex); | |
581bb050 LZ |
379 | |
380 | /* | |
381 | * Initially we allow to use 16K of ram to cache chunks of | |
382 | * inode numbers before we resort to bitmaps. This is somewhat | |
383 | * arbitrary, but it will be adjusted in runtime. | |
384 | */ | |
385 | ctl->extents_thresh = INIT_THRESHOLD; | |
386 | ||
387 | spin_lock_init(&pinned->tree_lock); | |
388 | pinned->unit = 1; | |
389 | pinned->start = 0; | |
390 | pinned->private = NULL; | |
391 | pinned->extents_thresh = 0; | |
392 | pinned->op = &pinned_free_ino_op; | |
393 | } | |
394 | ||
82d5902d LZ |
395 | int btrfs_save_ino_cache(struct btrfs_root *root, |
396 | struct btrfs_trans_handle *trans) | |
397 | { | |
0b246afa | 398 | struct btrfs_fs_info *fs_info = root->fs_info; |
82d5902d LZ |
399 | struct btrfs_free_space_ctl *ctl = root->free_ino_ctl; |
400 | struct btrfs_path *path; | |
401 | struct inode *inode; | |
ba38eb4d | 402 | struct btrfs_block_rsv *rsv; |
364ecf36 | 403 | struct extent_changeset *data_reserved = NULL; |
ba38eb4d | 404 | u64 num_bytes; |
82d5902d LZ |
405 | u64 alloc_hint = 0; |
406 | int ret; | |
407 | int prealloc; | |
408 | bool retry = false; | |
409 | ||
ca456ae2 | 410 | /* only fs tree and subvol/snap needs ino cache */ |
411 | if (root->root_key.objectid != BTRFS_FS_TREE_OBJECTID && | |
412 | (root->root_key.objectid < BTRFS_FIRST_FREE_OBJECTID || | |
413 | root->root_key.objectid > BTRFS_LAST_FREE_OBJECTID)) | |
414 | return 0; | |
415 | ||
d132a538 | 416 | /* Don't save inode cache if we are deleting this root */ |
69e9c6c6 | 417 | if (btrfs_root_refs(&root->root_item) == 0) |
d132a538 JB |
418 | return 0; |
419 | ||
0b246afa | 420 | if (!btrfs_test_opt(fs_info, INODE_MAP_CACHE)) |
4b9465cb CM |
421 | return 0; |
422 | ||
82d5902d LZ |
423 | path = btrfs_alloc_path(); |
424 | if (!path) | |
425 | return -ENOMEM; | |
4b9465cb | 426 | |
ba38eb4d | 427 | rsv = trans->block_rsv; |
0b246afa | 428 | trans->block_rsv = &fs_info->trans_block_rsv; |
ba38eb4d MX |
429 | |
430 | num_bytes = trans->bytes_reserved; | |
431 | /* | |
432 | * 1 item for inode item insertion if need | |
7b61cd92 MX |
433 | * 4 items for inode item update (in the worst case) |
434 | * 1 items for slack space if we need do truncation | |
ba38eb4d MX |
435 | * 1 item for free space object |
436 | * 3 items for pre-allocation | |
437 | */ | |
0b246afa | 438 | trans->bytes_reserved = btrfs_calc_trans_metadata_size(fs_info, 10); |
08e007d2 MX |
439 | ret = btrfs_block_rsv_add(root, trans->block_rsv, |
440 | trans->bytes_reserved, | |
441 | BTRFS_RESERVE_NO_FLUSH); | |
ba38eb4d MX |
442 | if (ret) |
443 | goto out; | |
0b246afa JM |
444 | trace_btrfs_space_reservation(fs_info, "ino_cache", trans->transid, |
445 | trans->bytes_reserved, 1); | |
82d5902d LZ |
446 | again: |
447 | inode = lookup_free_ino_inode(root, path); | |
79787eaa | 448 | if (IS_ERR(inode) && (PTR_ERR(inode) != -ENOENT || retry)) { |
82d5902d | 449 | ret = PTR_ERR(inode); |
ba38eb4d | 450 | goto out_release; |
82d5902d LZ |
451 | } |
452 | ||
453 | if (IS_ERR(inode)) { | |
79787eaa | 454 | BUG_ON(retry); /* Logic error */ |
82d5902d LZ |
455 | retry = true; |
456 | ||
457 | ret = create_free_ino_inode(root, trans, path); | |
458 | if (ret) | |
ba38eb4d | 459 | goto out_release; |
82d5902d LZ |
460 | goto again; |
461 | } | |
462 | ||
463 | BTRFS_I(inode)->generation = 0; | |
464 | ret = btrfs_update_inode(trans, root, inode); | |
79787eaa | 465 | if (ret) { |
66642832 | 466 | btrfs_abort_transaction(trans, ret); |
79787eaa JM |
467 | goto out_put; |
468 | } | |
82d5902d LZ |
469 | |
470 | if (i_size_read(inode) > 0) { | |
77ab86bf | 471 | ret = btrfs_truncate_free_space_cache(trans, NULL, inode); |
79787eaa | 472 | if (ret) { |
7cfa9e51 | 473 | if (ret != -ENOSPC) |
66642832 | 474 | btrfs_abort_transaction(trans, ret); |
82d5902d | 475 | goto out_put; |
79787eaa | 476 | } |
82d5902d LZ |
477 | } |
478 | ||
57cdc8db DS |
479 | spin_lock(&root->ino_cache_lock); |
480 | if (root->ino_cache_state != BTRFS_CACHE_FINISHED) { | |
82d5902d | 481 | ret = -1; |
57cdc8db | 482 | spin_unlock(&root->ino_cache_lock); |
82d5902d LZ |
483 | goto out_put; |
484 | } | |
57cdc8db | 485 | spin_unlock(&root->ino_cache_lock); |
82d5902d LZ |
486 | |
487 | spin_lock(&ctl->tree_lock); | |
488 | prealloc = sizeof(struct btrfs_free_space) * ctl->free_extents; | |
09cbfeaf KS |
489 | prealloc = ALIGN(prealloc, PAGE_SIZE); |
490 | prealloc += ctl->total_bitmaps * PAGE_SIZE; | |
82d5902d LZ |
491 | spin_unlock(&ctl->tree_lock); |
492 | ||
493 | /* Just to make sure we have enough space */ | |
09cbfeaf | 494 | prealloc += 8 * PAGE_SIZE; |
82d5902d | 495 | |
364ecf36 | 496 | ret = btrfs_delalloc_reserve_space(inode, &data_reserved, 0, prealloc); |
82d5902d LZ |
497 | if (ret) |
498 | goto out_put; | |
499 | ||
500 | ret = btrfs_prealloc_file_range_trans(inode, trans, 0, 0, prealloc, | |
501 | prealloc, prealloc, &alloc_hint); | |
c09544e0 | 502 | if (ret) { |
43b18595 | 503 | btrfs_delalloc_release_extents(BTRFS_I(inode), prealloc, true); |
29d47d00 | 504 | btrfs_delalloc_release_metadata(BTRFS_I(inode), prealloc, true); |
82d5902d | 505 | goto out_put; |
c09544e0 | 506 | } |
82d5902d | 507 | |
53645a91 | 508 | ret = btrfs_write_out_ino_cache(root, trans, path, inode); |
43b18595 | 509 | btrfs_delalloc_release_extents(BTRFS_I(inode), prealloc, false); |
82d5902d LZ |
510 | out_put: |
511 | iput(inode); | |
ba38eb4d | 512 | out_release: |
0b246afa JM |
513 | trace_btrfs_space_reservation(fs_info, "ino_cache", trans->transid, |
514 | trans->bytes_reserved, 0); | |
2ff7e61e JM |
515 | btrfs_block_rsv_release(fs_info, trans->block_rsv, |
516 | trans->bytes_reserved); | |
82d5902d | 517 | out: |
ba38eb4d MX |
518 | trans->block_rsv = rsv; |
519 | trans->bytes_reserved = num_bytes; | |
82d5902d LZ |
520 | |
521 | btrfs_free_path(path); | |
364ecf36 | 522 | extent_changeset_free(data_reserved); |
82d5902d LZ |
523 | return ret; |
524 | } | |
525 | ||
f32e48e9 | 526 | int btrfs_find_highest_objectid(struct btrfs_root *root, u64 *objectid) |
5be6f7f1 CM |
527 | { |
528 | struct btrfs_path *path; | |
529 | int ret; | |
5f39d397 | 530 | struct extent_buffer *l; |
5be6f7f1 | 531 | struct btrfs_key search_key; |
5f39d397 | 532 | struct btrfs_key found_key; |
5be6f7f1 CM |
533 | int slot; |
534 | ||
535 | path = btrfs_alloc_path(); | |
db5b493a TI |
536 | if (!path) |
537 | return -ENOMEM; | |
5be6f7f1 | 538 | |
6527cdbe ZY |
539 | search_key.objectid = BTRFS_LAST_FREE_OBJECTID; |
540 | search_key.type = -1; | |
5be6f7f1 CM |
541 | search_key.offset = (u64)-1; |
542 | ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0); | |
543 | if (ret < 0) | |
544 | goto error; | |
79787eaa | 545 | BUG_ON(ret == 0); /* Corruption */ |
5be6f7f1 CM |
546 | if (path->slots[0] > 0) { |
547 | slot = path->slots[0] - 1; | |
5f39d397 CM |
548 | l = path->nodes[0]; |
549 | btrfs_item_key_to_cpu(l, &found_key, slot); | |
13a8a7c8 YZ |
550 | *objectid = max_t(u64, found_key.objectid, |
551 | BTRFS_FIRST_FREE_OBJECTID - 1); | |
5be6f7f1 | 552 | } else { |
13a8a7c8 | 553 | *objectid = BTRFS_FIRST_FREE_OBJECTID - 1; |
5be6f7f1 CM |
554 | } |
555 | ret = 0; | |
556 | error: | |
557 | btrfs_free_path(path); | |
558 | return ret; | |
559 | } | |
560 | ||
581bb050 | 561 | int btrfs_find_free_objectid(struct btrfs_root *root, u64 *objectid) |
9f5fae2f | 562 | { |
9f5fae2f | 563 | int ret; |
a2135011 | 564 | mutex_lock(&root->objectid_mutex); |
9f5fae2f | 565 | |
13a8a7c8 | 566 | if (unlikely(root->highest_objectid >= BTRFS_LAST_FREE_OBJECTID)) { |
3c1d84b7 ST |
567 | btrfs_warn(root->fs_info, |
568 | "the objectid of root %llu reaches its highest value", | |
569 | root->root_key.objectid); | |
13a8a7c8 YZ |
570 | ret = -ENOSPC; |
571 | goto out; | |
9f5fae2f | 572 | } |
13a8a7c8 YZ |
573 | |
574 | *objectid = ++root->highest_objectid; | |
575 | ret = 0; | |
576 | out: | |
a2135011 | 577 | mutex_unlock(&root->objectid_mutex); |
9f5fae2f CM |
578 | return ret; |
579 | } |