]>
Commit | Line | Data |
---|---|---|
6cbd5570 CM |
1 | /* |
2 | * Copyright (C) 2007 Oracle. All rights reserved. | |
3 | * | |
4 | * This program is free software; you can redistribute it and/or | |
5 | * modify it under the terms of the GNU General Public | |
6 | * License v2 as published by the Free Software Foundation. | |
7 | * | |
8 | * This program is distributed in the hope that it will be useful, | |
9 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
10 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
11 | * General Public License for more details. | |
12 | * | |
13 | * You should have received a copy of the GNU General Public | |
14 | * License along with this program; if not, write to the | |
15 | * Free Software Foundation, Inc., 59 Temple Place - Suite 330, | |
16 | * Boston, MA 021110-1307, USA. | |
17 | */ | |
18 | ||
581bb050 LZ |
19 | #include <linux/delay.h> |
20 | #include <linux/kthread.h> | |
21 | #include <linux/pagemap.h> | |
22 | ||
9f5fae2f CM |
23 | #include "ctree.h" |
24 | #include "disk-io.h" | |
581bb050 LZ |
25 | #include "free-space-cache.h" |
26 | #include "inode-map.h" | |
9f5fae2f CM |
27 | #include "transaction.h" |
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 | ||
3cdde224 | 41 | if (!btrfs_test_opt(root->fs_info, INODE_MAP_CACHE)) |
4b9465cb CM |
42 | return 0; |
43 | ||
581bb050 LZ |
44 | path = btrfs_alloc_path(); |
45 | if (!path) | |
46 | return -ENOMEM; | |
47 | ||
48 | /* Since the commit root is read-only, we can safely skip locking. */ | |
49 | path->skip_locking = 1; | |
50 | path->search_commit_root = 1; | |
e4058b54 | 51 | path->reada = READA_FORWARD; |
581bb050 LZ |
52 | |
53 | key.objectid = BTRFS_FIRST_FREE_OBJECTID; | |
54 | key.offset = 0; | |
55 | key.type = BTRFS_INODE_ITEM_KEY; | |
56 | again: | |
57 | /* need to make sure the commit_root doesn't disappear */ | |
9e351cc8 | 58 | down_read(&fs_info->commit_root_sem); |
581bb050 LZ |
59 | |
60 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
61 | if (ret < 0) | |
62 | goto out; | |
63 | ||
64 | while (1) { | |
7841cb28 | 65 | if (btrfs_fs_closing(fs_info)) |
581bb050 LZ |
66 | goto out; |
67 | ||
68 | leaf = path->nodes[0]; | |
69 | slot = path->slots[0]; | |
a47d6b70 | 70 | if (slot >= btrfs_header_nritems(leaf)) { |
581bb050 LZ |
71 | ret = btrfs_next_leaf(root, path); |
72 | if (ret < 0) | |
73 | goto out; | |
74 | else if (ret > 0) | |
75 | break; | |
76 | ||
77 | if (need_resched() || | |
78 | btrfs_transaction_in_commit(fs_info)) { | |
79 | leaf = path->nodes[0]; | |
80 | ||
fae7f21c | 81 | if (WARN_ON(btrfs_header_nritems(leaf) == 0)) |
581bb050 | 82 | break; |
581bb050 LZ |
83 | |
84 | /* | |
85 | * Save the key so we can advances forward | |
86 | * in the next search. | |
87 | */ | |
88 | btrfs_item_key_to_cpu(leaf, &key, 0); | |
945d8962 | 89 | btrfs_release_path(path); |
57cdc8db | 90 | root->ino_cache_progress = last; |
9e351cc8 | 91 | up_read(&fs_info->commit_root_sem); |
581bb050 LZ |
92 | schedule_timeout(1); |
93 | goto again; | |
94 | } else | |
95 | continue; | |
96 | } | |
97 | ||
98 | btrfs_item_key_to_cpu(leaf, &key, slot); | |
99 | ||
100 | if (key.type != BTRFS_INODE_ITEM_KEY) | |
101 | goto next; | |
102 | ||
a47d6b70 | 103 | if (key.objectid >= root->highest_objectid) |
581bb050 LZ |
104 | break; |
105 | ||
106 | if (last != (u64)-1 && last + 1 != key.objectid) { | |
ab8d0fc4 | 107 | __btrfs_add_free_space(fs_info, ctl, last + 1, |
581bb050 | 108 | key.objectid - last - 1); |
57cdc8db | 109 | wake_up(&root->ino_cache_wait); |
581bb050 LZ |
110 | } |
111 | ||
112 | last = key.objectid; | |
113 | next: | |
114 | path->slots[0]++; | |
115 | } | |
116 | ||
a47d6b70 | 117 | if (last < root->highest_objectid - 1) { |
ab8d0fc4 | 118 | __btrfs_add_free_space(fs_info, ctl, last + 1, |
a47d6b70 | 119 | root->highest_objectid - last - 1); |
581bb050 LZ |
120 | } |
121 | ||
57cdc8db DS |
122 | spin_lock(&root->ino_cache_lock); |
123 | root->ino_cache_state = BTRFS_CACHE_FINISHED; | |
124 | spin_unlock(&root->ino_cache_lock); | |
581bb050 | 125 | |
57cdc8db | 126 | root->ino_cache_progress = (u64)-1; |
581bb050 LZ |
127 | btrfs_unpin_free_ino(root); |
128 | out: | |
57cdc8db | 129 | wake_up(&root->ino_cache_wait); |
9e351cc8 | 130 | up_read(&fs_info->commit_root_sem); |
581bb050 LZ |
131 | |
132 | btrfs_free_path(path); | |
133 | ||
134 | return ret; | |
135 | } | |
136 | ||
137 | static void start_caching(struct btrfs_root *root) | |
138 | { | |
ab8d0fc4 | 139 | struct btrfs_fs_info *fs_info = root->fs_info; |
a47d6b70 | 140 | struct btrfs_free_space_ctl *ctl = root->free_ino_ctl; |
581bb050 | 141 | struct task_struct *tsk; |
82d5902d | 142 | int ret; |
a47d6b70 | 143 | u64 objectid; |
581bb050 | 144 | |
ab8d0fc4 | 145 | if (!btrfs_test_opt(fs_info, INODE_MAP_CACHE)) |
4b9465cb CM |
146 | return; |
147 | ||
57cdc8db DS |
148 | spin_lock(&root->ino_cache_lock); |
149 | if (root->ino_cache_state != BTRFS_CACHE_NO) { | |
150 | spin_unlock(&root->ino_cache_lock); | |
581bb050 LZ |
151 | return; |
152 | } | |
153 | ||
57cdc8db DS |
154 | root->ino_cache_state = BTRFS_CACHE_STARTED; |
155 | spin_unlock(&root->ino_cache_lock); | |
581bb050 | 156 | |
ab8d0fc4 | 157 | ret = load_free_ino_cache(fs_info, root); |
82d5902d | 158 | if (ret == 1) { |
57cdc8db DS |
159 | spin_lock(&root->ino_cache_lock); |
160 | root->ino_cache_state = BTRFS_CACHE_FINISHED; | |
161 | spin_unlock(&root->ino_cache_lock); | |
82d5902d LZ |
162 | return; |
163 | } | |
164 | ||
a47d6b70 LZ |
165 | /* |
166 | * It can be quite time-consuming to fill the cache by searching | |
167 | * through the extent tree, and this can keep ino allocation path | |
168 | * waiting. Therefore at start we quickly find out the highest | |
169 | * inode number and we know we can use inode numbers which fall in | |
170 | * [highest_ino + 1, BTRFS_LAST_FREE_OBJECTID]. | |
171 | */ | |
172 | ret = btrfs_find_free_objectid(root, &objectid); | |
173 | if (!ret && objectid <= BTRFS_LAST_FREE_OBJECTID) { | |
ab8d0fc4 | 174 | __btrfs_add_free_space(fs_info, ctl, objectid, |
a47d6b70 LZ |
175 | BTRFS_LAST_FREE_OBJECTID - objectid + 1); |
176 | } | |
177 | ||
67a77eb1 | 178 | tsk = kthread_run(caching_kthread, root, "btrfs-ino-cache-%llu", |
581bb050 | 179 | root->root_key.objectid); |
e60efa84 | 180 | if (IS_ERR(tsk)) { |
ab8d0fc4 JM |
181 | btrfs_warn(fs_info, "failed to start inode caching task"); |
182 | btrfs_clear_pending_and_info(fs_info, INODE_MAP_CACHE, | |
e60efa84 WS |
183 | "disabling inode map caching"); |
184 | } | |
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 || | |
581bb050 LZ |
202 | root->free_ino_ctl->free_space > 0); |
203 | ||
57cdc8db | 204 | if (root->ino_cache_state == BTRFS_CACHE_FINISHED && |
581bb050 LZ |
205 | root->free_ino_ctl->free_space == 0) |
206 | return -ENOSPC; | |
207 | else | |
208 | goto again; | |
209 | } | |
210 | ||
211 | void btrfs_return_ino(struct btrfs_root *root, u64 objectid) | |
212 | { | |
ab8d0fc4 | 213 | struct btrfs_fs_info *fs_info = root->fs_info; |
581bb050 | 214 | struct btrfs_free_space_ctl *pinned = root->free_ino_pinned; |
4b9465cb | 215 | |
ab8d0fc4 | 216 | if (!btrfs_test_opt(fs_info, INODE_MAP_CACHE)) |
4b9465cb | 217 | return; |
581bb050 | 218 | again: |
57cdc8db | 219 | if (root->ino_cache_state == BTRFS_CACHE_FINISHED) { |
ab8d0fc4 | 220 | __btrfs_add_free_space(fs_info, pinned, objectid, 1); |
581bb050 | 221 | } else { |
ab8d0fc4 | 222 | down_write(&fs_info->commit_root_sem); |
57cdc8db DS |
223 | spin_lock(&root->ino_cache_lock); |
224 | if (root->ino_cache_state == BTRFS_CACHE_FINISHED) { | |
225 | spin_unlock(&root->ino_cache_lock); | |
ab8d0fc4 | 226 | up_write(&fs_info->commit_root_sem); |
581bb050 LZ |
227 | goto again; |
228 | } | |
57cdc8db | 229 | spin_unlock(&root->ino_cache_lock); |
581bb050 LZ |
230 | |
231 | start_caching(root); | |
232 | ||
ab8d0fc4 | 233 | __btrfs_add_free_space(fs_info, pinned, objectid, 1); |
581bb050 | 234 | |
ab8d0fc4 | 235 | up_write(&fs_info->commit_root_sem); |
581bb050 LZ |
236 | } |
237 | } | |
238 | ||
239 | /* | |
57cdc8db DS |
240 | * When a transaction is committed, we'll move those inode numbers which are |
241 | * smaller than root->ino_cache_progress from pinned tree to free_ino tree, and | |
242 | * others will just be dropped, because the commit root we were searching has | |
243 | * changed. | |
581bb050 | 244 | * |
9e351cc8 | 245 | * Must be called with root->fs_info->commit_root_sem held |
581bb050 LZ |
246 | */ |
247 | void btrfs_unpin_free_ino(struct btrfs_root *root) | |
248 | { | |
249 | struct btrfs_free_space_ctl *ctl = root->free_ino_ctl; | |
250 | struct rb_root *rbroot = &root->free_ino_pinned->free_space_offset; | |
ae9d8f17 | 251 | spinlock_t *rbroot_lock = &root->free_ino_pinned->tree_lock; |
581bb050 LZ |
252 | struct btrfs_free_space *info; |
253 | struct rb_node *n; | |
254 | u64 count; | |
255 | ||
3cdde224 | 256 | if (!btrfs_test_opt(root->fs_info, INODE_MAP_CACHE)) |
4b9465cb CM |
257 | return; |
258 | ||
581bb050 | 259 | while (1) { |
ae9d8f17 FM |
260 | bool add_to_ctl = true; |
261 | ||
262 | spin_lock(rbroot_lock); | |
581bb050 | 263 | n = rb_first(rbroot); |
ae9d8f17 FM |
264 | if (!n) { |
265 | spin_unlock(rbroot_lock); | |
581bb050 | 266 | break; |
ae9d8f17 | 267 | } |
581bb050 LZ |
268 | |
269 | info = rb_entry(n, struct btrfs_free_space, offset_index); | |
79787eaa | 270 | BUG_ON(info->bitmap); /* Logic error */ |
581bb050 | 271 | |
57cdc8db | 272 | if (info->offset > root->ino_cache_progress) |
ae9d8f17 | 273 | add_to_ctl = false; |
57cdc8db DS |
274 | else if (info->offset + info->bytes > root->ino_cache_progress) |
275 | count = root->ino_cache_progress - info->offset + 1; | |
581bb050 LZ |
276 | else |
277 | count = info->bytes; | |
278 | ||
581bb050 | 279 | rb_erase(&info->offset_index, rbroot); |
ae9d8f17 FM |
280 | spin_unlock(rbroot_lock); |
281 | if (add_to_ctl) | |
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 | { | |
398 | struct btrfs_free_space_ctl *ctl = root->free_ino_ctl; | |
399 | struct btrfs_path *path; | |
400 | struct inode *inode; | |
ba38eb4d MX |
401 | struct btrfs_block_rsv *rsv; |
402 | u64 num_bytes; | |
82d5902d LZ |
403 | u64 alloc_hint = 0; |
404 | int ret; | |
405 | int prealloc; | |
406 | bool retry = false; | |
407 | ||
ca456ae2 | 408 | /* only fs tree and subvol/snap needs ino cache */ |
409 | if (root->root_key.objectid != BTRFS_FS_TREE_OBJECTID && | |
410 | (root->root_key.objectid < BTRFS_FIRST_FREE_OBJECTID || | |
411 | root->root_key.objectid > BTRFS_LAST_FREE_OBJECTID)) | |
412 | return 0; | |
413 | ||
d132a538 | 414 | /* Don't save inode cache if we are deleting this root */ |
69e9c6c6 | 415 | if (btrfs_root_refs(&root->root_item) == 0) |
d132a538 JB |
416 | return 0; |
417 | ||
3cdde224 | 418 | if (!btrfs_test_opt(root->fs_info, INODE_MAP_CACHE)) |
4b9465cb CM |
419 | return 0; |
420 | ||
82d5902d LZ |
421 | path = btrfs_alloc_path(); |
422 | if (!path) | |
423 | return -ENOMEM; | |
4b9465cb | 424 | |
ba38eb4d MX |
425 | rsv = trans->block_rsv; |
426 | trans->block_rsv = &root->fs_info->trans_block_rsv; | |
427 | ||
428 | num_bytes = trans->bytes_reserved; | |
429 | /* | |
430 | * 1 item for inode item insertion if need | |
7b61cd92 MX |
431 | * 4 items for inode item update (in the worst case) |
432 | * 1 items for slack space if we need do truncation | |
ba38eb4d MX |
433 | * 1 item for free space object |
434 | * 3 items for pre-allocation | |
435 | */ | |
7b61cd92 | 436 | trans->bytes_reserved = btrfs_calc_trans_metadata_size(root, 10); |
08e007d2 MX |
437 | ret = btrfs_block_rsv_add(root, trans->block_rsv, |
438 | trans->bytes_reserved, | |
439 | BTRFS_RESERVE_NO_FLUSH); | |
ba38eb4d MX |
440 | if (ret) |
441 | goto out; | |
e77266e4 | 442 | trace_btrfs_space_reservation(root->fs_info, "ino_cache", |
2bcc0328 | 443 | trans->transid, trans->bytes_reserved, 1); |
82d5902d LZ |
444 | again: |
445 | inode = lookup_free_ino_inode(root, path); | |
79787eaa | 446 | if (IS_ERR(inode) && (PTR_ERR(inode) != -ENOENT || retry)) { |
82d5902d | 447 | ret = PTR_ERR(inode); |
ba38eb4d | 448 | goto out_release; |
82d5902d LZ |
449 | } |
450 | ||
451 | if (IS_ERR(inode)) { | |
79787eaa | 452 | BUG_ON(retry); /* Logic error */ |
82d5902d LZ |
453 | retry = true; |
454 | ||
455 | ret = create_free_ino_inode(root, trans, path); | |
456 | if (ret) | |
ba38eb4d | 457 | goto out_release; |
82d5902d LZ |
458 | goto again; |
459 | } | |
460 | ||
461 | BTRFS_I(inode)->generation = 0; | |
462 | ret = btrfs_update_inode(trans, root, inode); | |
79787eaa | 463 | if (ret) { |
66642832 | 464 | btrfs_abort_transaction(trans, ret); |
79787eaa JM |
465 | goto out_put; |
466 | } | |
82d5902d LZ |
467 | |
468 | if (i_size_read(inode) > 0) { | |
1bbc621e | 469 | ret = btrfs_truncate_free_space_cache(root, trans, NULL, inode); |
79787eaa | 470 | if (ret) { |
7cfa9e51 | 471 | if (ret != -ENOSPC) |
66642832 | 472 | btrfs_abort_transaction(trans, ret); |
82d5902d | 473 | goto out_put; |
79787eaa | 474 | } |
82d5902d LZ |
475 | } |
476 | ||
57cdc8db DS |
477 | spin_lock(&root->ino_cache_lock); |
478 | if (root->ino_cache_state != BTRFS_CACHE_FINISHED) { | |
82d5902d | 479 | ret = -1; |
57cdc8db | 480 | spin_unlock(&root->ino_cache_lock); |
82d5902d LZ |
481 | goto out_put; |
482 | } | |
57cdc8db | 483 | spin_unlock(&root->ino_cache_lock); |
82d5902d LZ |
484 | |
485 | spin_lock(&ctl->tree_lock); | |
486 | prealloc = sizeof(struct btrfs_free_space) * ctl->free_extents; | |
09cbfeaf KS |
487 | prealloc = ALIGN(prealloc, PAGE_SIZE); |
488 | prealloc += ctl->total_bitmaps * PAGE_SIZE; | |
82d5902d LZ |
489 | spin_unlock(&ctl->tree_lock); |
490 | ||
491 | /* Just to make sure we have enough space */ | |
09cbfeaf | 492 | prealloc += 8 * PAGE_SIZE; |
82d5902d | 493 | |
7cf5b976 | 494 | ret = btrfs_delalloc_reserve_space(inode, 0, prealloc); |
82d5902d LZ |
495 | if (ret) |
496 | goto out_put; | |
497 | ||
498 | ret = btrfs_prealloc_file_range_trans(inode, trans, 0, 0, prealloc, | |
499 | prealloc, prealloc, &alloc_hint); | |
c09544e0 | 500 | if (ret) { |
18513091 | 501 | btrfs_delalloc_release_metadata(inode, prealloc); |
82d5902d | 502 | goto out_put; |
c09544e0 | 503 | } |
82d5902d | 504 | |
53645a91 | 505 | ret = btrfs_write_out_ino_cache(root, trans, path, inode); |
82d5902d LZ |
506 | out_put: |
507 | iput(inode); | |
ba38eb4d | 508 | out_release: |
e77266e4 | 509 | trace_btrfs_space_reservation(root->fs_info, "ino_cache", |
2bcc0328 | 510 | trans->transid, trans->bytes_reserved, 0); |
ba38eb4d | 511 | btrfs_block_rsv_release(root, trans->block_rsv, trans->bytes_reserved); |
82d5902d | 512 | out: |
ba38eb4d MX |
513 | trans->block_rsv = rsv; |
514 | trans->bytes_reserved = num_bytes; | |
82d5902d LZ |
515 | |
516 | btrfs_free_path(path); | |
517 | return ret; | |
518 | } | |
519 | ||
f32e48e9 | 520 | int btrfs_find_highest_objectid(struct btrfs_root *root, u64 *objectid) |
5be6f7f1 CM |
521 | { |
522 | struct btrfs_path *path; | |
523 | int ret; | |
5f39d397 | 524 | struct extent_buffer *l; |
5be6f7f1 | 525 | struct btrfs_key search_key; |
5f39d397 | 526 | struct btrfs_key found_key; |
5be6f7f1 CM |
527 | int slot; |
528 | ||
529 | path = btrfs_alloc_path(); | |
db5b493a TI |
530 | if (!path) |
531 | return -ENOMEM; | |
5be6f7f1 | 532 | |
6527cdbe ZY |
533 | search_key.objectid = BTRFS_LAST_FREE_OBJECTID; |
534 | search_key.type = -1; | |
5be6f7f1 CM |
535 | search_key.offset = (u64)-1; |
536 | ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0); | |
537 | if (ret < 0) | |
538 | goto error; | |
79787eaa | 539 | BUG_ON(ret == 0); /* Corruption */ |
5be6f7f1 CM |
540 | if (path->slots[0] > 0) { |
541 | slot = path->slots[0] - 1; | |
5f39d397 CM |
542 | l = path->nodes[0]; |
543 | btrfs_item_key_to_cpu(l, &found_key, slot); | |
13a8a7c8 YZ |
544 | *objectid = max_t(u64, found_key.objectid, |
545 | BTRFS_FIRST_FREE_OBJECTID - 1); | |
5be6f7f1 | 546 | } else { |
13a8a7c8 | 547 | *objectid = BTRFS_FIRST_FREE_OBJECTID - 1; |
5be6f7f1 CM |
548 | } |
549 | ret = 0; | |
550 | error: | |
551 | btrfs_free_path(path); | |
552 | return ret; | |
553 | } | |
554 | ||
581bb050 | 555 | int btrfs_find_free_objectid(struct btrfs_root *root, u64 *objectid) |
9f5fae2f | 556 | { |
9f5fae2f | 557 | int ret; |
a2135011 | 558 | mutex_lock(&root->objectid_mutex); |
9f5fae2f | 559 | |
13a8a7c8 | 560 | if (unlikely(root->highest_objectid >= BTRFS_LAST_FREE_OBJECTID)) { |
3c1d84b7 ST |
561 | btrfs_warn(root->fs_info, |
562 | "the objectid of root %llu reaches its highest value", | |
563 | root->root_key.objectid); | |
13a8a7c8 YZ |
564 | ret = -ENOSPC; |
565 | goto out; | |
9f5fae2f | 566 | } |
13a8a7c8 YZ |
567 | |
568 | *objectid = ++root->highest_objectid; | |
569 | ret = 0; | |
570 | out: | |
a2135011 | 571 | mutex_unlock(&root->objectid_mutex); |
9f5fae2f CM |
572 | return ret; |
573 | } |