Loading...
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
19#include <linux/delay.h>
20#include <linux/kthread.h>
21#include <linux/pagemap.h>
22
23#include "ctree.h"
24#include "disk-io.h"
25#include "free-space-cache.h"
26#include "inode-map.h"
27#include "transaction.h"
28
29static 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
41 if (!btrfs_test_opt(root, INODE_MAP_CACHE))
42 return 0;
43
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;
51 path->reada = 2;
52
53 key.objectid = BTRFS_FIRST_FREE_OBJECTID;
54 key.offset = 0;
55 key.type = BTRFS_INODE_ITEM_KEY;
56again:
57 /* need to make sure the commit_root doesn't disappear */
58 mutex_lock(&root->fs_commit_mutex);
59
60 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
61 if (ret < 0)
62 goto out;
63
64 while (1) {
65 if (btrfs_fs_closing(fs_info))
66 goto out;
67
68 leaf = path->nodes[0];
69 slot = path->slots[0];
70 if (slot >= btrfs_header_nritems(leaf)) {
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
81 if (btrfs_header_nritems(leaf) == 0) {
82 WARN_ON(1);
83 break;
84 }
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);
91 btrfs_release_path(path);
92 root->cache_progress = last;
93 mutex_unlock(&root->fs_commit_mutex);
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
105 if (key.objectid >= root->highest_objectid)
106 break;
107
108 if (last != (u64)-1 && last + 1 != key.objectid) {
109 __btrfs_add_free_space(ctl, last + 1,
110 key.objectid - last - 1);
111 wake_up(&root->cache_wait);
112 }
113
114 last = key.objectid;
115next:
116 path->slots[0]++;
117 }
118
119 if (last < root->highest_objectid - 1) {
120 __btrfs_add_free_space(ctl, last + 1,
121 root->highest_objectid - last - 1);
122 }
123
124 spin_lock(&root->cache_lock);
125 root->cached = BTRFS_CACHE_FINISHED;
126 spin_unlock(&root->cache_lock);
127
128 root->cache_progress = (u64)-1;
129 btrfs_unpin_free_ino(root);
130out:
131 wake_up(&root->cache_wait);
132 mutex_unlock(&root->fs_commit_mutex);
133
134 btrfs_free_path(path);
135
136 return ret;
137}
138
139static void start_caching(struct btrfs_root *root)
140{
141 struct btrfs_free_space_ctl *ctl = root->free_ino_ctl;
142 struct task_struct *tsk;
143 int ret;
144 u64 objectid;
145
146 if (!btrfs_test_opt(root, INODE_MAP_CACHE))
147 return;
148
149 spin_lock(&root->cache_lock);
150 if (root->cached != BTRFS_CACHE_NO) {
151 spin_unlock(&root->cache_lock);
152 return;
153 }
154
155 root->cached = BTRFS_CACHE_STARTED;
156 spin_unlock(&root->cache_lock);
157
158 ret = load_free_ino_cache(root->fs_info, root);
159 if (ret == 1) {
160 spin_lock(&root->cache_lock);
161 root->cached = BTRFS_CACHE_FINISHED;
162 spin_unlock(&root->cache_lock);
163 return;
164 }
165
166 /*
167 * It can be quite time-consuming to fill the cache by searching
168 * through the extent tree, and this can keep ino allocation path
169 * waiting. Therefore at start we quickly find out the highest
170 * inode number and we know we can use inode numbers which fall in
171 * [highest_ino + 1, BTRFS_LAST_FREE_OBJECTID].
172 */
173 ret = btrfs_find_free_objectid(root, &objectid);
174 if (!ret && objectid <= BTRFS_LAST_FREE_OBJECTID) {
175 __btrfs_add_free_space(ctl, objectid,
176 BTRFS_LAST_FREE_OBJECTID - objectid + 1);
177 }
178
179 tsk = kthread_run(caching_kthread, root, "btrfs-ino-cache-%llu\n",
180 root->root_key.objectid);
181 BUG_ON(IS_ERR(tsk));
182}
183
184int btrfs_find_free_ino(struct btrfs_root *root, u64 *objectid)
185{
186 if (!btrfs_test_opt(root, INODE_MAP_CACHE))
187 return btrfs_find_free_objectid(root, objectid);
188
189again:
190 *objectid = btrfs_find_ino_for_alloc(root);
191
192 if (*objectid != 0)
193 return 0;
194
195 start_caching(root);
196
197 wait_event(root->cache_wait,
198 root->cached == BTRFS_CACHE_FINISHED ||
199 root->free_ino_ctl->free_space > 0);
200
201 if (root->cached == BTRFS_CACHE_FINISHED &&
202 root->free_ino_ctl->free_space == 0)
203 return -ENOSPC;
204 else
205 goto again;
206}
207
208void btrfs_return_ino(struct btrfs_root *root, u64 objectid)
209{
210 struct btrfs_free_space_ctl *ctl = root->free_ino_ctl;
211 struct btrfs_free_space_ctl *pinned = root->free_ino_pinned;
212
213 if (!btrfs_test_opt(root, INODE_MAP_CACHE))
214 return;
215
216again:
217 if (root->cached == BTRFS_CACHE_FINISHED) {
218 __btrfs_add_free_space(ctl, objectid, 1);
219 } else {
220 /*
221 * If we are in the process of caching free ino chunks,
222 * to avoid adding the same inode number to the free_ino
223 * tree twice due to cross transaction, we'll leave it
224 * in the pinned tree until a transaction is committed
225 * or the caching work is done.
226 */
227
228 mutex_lock(&root->fs_commit_mutex);
229 spin_lock(&root->cache_lock);
230 if (root->cached == BTRFS_CACHE_FINISHED) {
231 spin_unlock(&root->cache_lock);
232 mutex_unlock(&root->fs_commit_mutex);
233 goto again;
234 }
235 spin_unlock(&root->cache_lock);
236
237 start_caching(root);
238
239 if (objectid <= root->cache_progress ||
240 objectid > root->highest_objectid)
241 __btrfs_add_free_space(ctl, objectid, 1);
242 else
243 __btrfs_add_free_space(pinned, objectid, 1);
244
245 mutex_unlock(&root->fs_commit_mutex);
246 }
247}
248
249/*
250 * When a transaction is committed, we'll move those inode numbers which
251 * are smaller than root->cache_progress from pinned tree to free_ino tree,
252 * and others will just be dropped, because the commit root we were
253 * searching has changed.
254 *
255 * Must be called with root->fs_commit_mutex held
256 */
257void btrfs_unpin_free_ino(struct btrfs_root *root)
258{
259 struct btrfs_free_space_ctl *ctl = root->free_ino_ctl;
260 struct rb_root *rbroot = &root->free_ino_pinned->free_space_offset;
261 struct btrfs_free_space *info;
262 struct rb_node *n;
263 u64 count;
264
265 if (!btrfs_test_opt(root, INODE_MAP_CACHE))
266 return;
267
268 while (1) {
269 n = rb_first(rbroot);
270 if (!n)
271 break;
272
273 info = rb_entry(n, struct btrfs_free_space, offset_index);
274 BUG_ON(info->bitmap);
275
276 if (info->offset > root->cache_progress)
277 goto free;
278 else if (info->offset + info->bytes > root->cache_progress)
279 count = root->cache_progress - info->offset + 1;
280 else
281 count = info->bytes;
282
283 __btrfs_add_free_space(ctl, info->offset, count);
284free:
285 rb_erase(&info->offset_index, rbroot);
286 kfree(info);
287 }
288}
289
290#define INIT_THRESHOLD (((1024 * 32) / 2) / sizeof(struct btrfs_free_space))
291#define INODES_PER_BITMAP (PAGE_CACHE_SIZE * 8)
292
293/*
294 * The goal is to keep the memory used by the free_ino tree won't
295 * exceed the memory if we use bitmaps only.
296 */
297static void recalculate_thresholds(struct btrfs_free_space_ctl *ctl)
298{
299 struct btrfs_free_space *info;
300 struct rb_node *n;
301 int max_ino;
302 int max_bitmaps;
303
304 n = rb_last(&ctl->free_space_offset);
305 if (!n) {
306 ctl->extents_thresh = INIT_THRESHOLD;
307 return;
308 }
309 info = rb_entry(n, struct btrfs_free_space, offset_index);
310
311 /*
312 * Find the maximum inode number in the filesystem. Note we
313 * ignore the fact that this can be a bitmap, because we are
314 * not doing precise calculation.
315 */
316 max_ino = info->bytes - 1;
317
318 max_bitmaps = ALIGN(max_ino, INODES_PER_BITMAP) / INODES_PER_BITMAP;
319 if (max_bitmaps <= ctl->total_bitmaps) {
320 ctl->extents_thresh = 0;
321 return;
322 }
323
324 ctl->extents_thresh = (max_bitmaps - ctl->total_bitmaps) *
325 PAGE_CACHE_SIZE / sizeof(*info);
326}
327
328/*
329 * We don't fall back to bitmap, if we are below the extents threshold
330 * or this chunk of inode numbers is a big one.
331 */
332static bool use_bitmap(struct btrfs_free_space_ctl *ctl,
333 struct btrfs_free_space *info)
334{
335 if (ctl->free_extents < ctl->extents_thresh ||
336 info->bytes > INODES_PER_BITMAP / 10)
337 return false;
338
339 return true;
340}
341
342static struct btrfs_free_space_op free_ino_op = {
343 .recalc_thresholds = recalculate_thresholds,
344 .use_bitmap = use_bitmap,
345};
346
347static void pinned_recalc_thresholds(struct btrfs_free_space_ctl *ctl)
348{
349}
350
351static bool pinned_use_bitmap(struct btrfs_free_space_ctl *ctl,
352 struct btrfs_free_space *info)
353{
354 /*
355 * We always use extents for two reasons:
356 *
357 * - The pinned tree is only used during the process of caching
358 * work.
359 * - Make code simpler. See btrfs_unpin_free_ino().
360 */
361 return false;
362}
363
364static struct btrfs_free_space_op pinned_free_ino_op = {
365 .recalc_thresholds = pinned_recalc_thresholds,
366 .use_bitmap = pinned_use_bitmap,
367};
368
369void btrfs_init_free_ino_ctl(struct btrfs_root *root)
370{
371 struct btrfs_free_space_ctl *ctl = root->free_ino_ctl;
372 struct btrfs_free_space_ctl *pinned = root->free_ino_pinned;
373
374 spin_lock_init(&ctl->tree_lock);
375 ctl->unit = 1;
376 ctl->start = 0;
377 ctl->private = NULL;
378 ctl->op = &free_ino_op;
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
395int 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;
401 u64 alloc_hint = 0;
402 int ret;
403 int prealloc;
404 bool retry = false;
405
406 /* only fs tree and subvol/snap needs ino cache */
407 if (root->root_key.objectid != BTRFS_FS_TREE_OBJECTID &&
408 (root->root_key.objectid < BTRFS_FIRST_FREE_OBJECTID ||
409 root->root_key.objectid > BTRFS_LAST_FREE_OBJECTID))
410 return 0;
411
412 /* Don't save inode cache if we are deleting this root */
413 if (btrfs_root_refs(&root->root_item) == 0 &&
414 root != root->fs_info->tree_root)
415 return 0;
416
417 if (!btrfs_test_opt(root, INODE_MAP_CACHE))
418 return 0;
419
420 path = btrfs_alloc_path();
421 if (!path)
422 return -ENOMEM;
423
424again:
425 inode = lookup_free_ino_inode(root, path);
426 if (IS_ERR(inode) && PTR_ERR(inode) != -ENOENT) {
427 ret = PTR_ERR(inode);
428 goto out;
429 }
430
431 if (IS_ERR(inode)) {
432 BUG_ON(retry);
433 retry = true;
434
435 ret = create_free_ino_inode(root, trans, path);
436 if (ret)
437 goto out;
438 goto again;
439 }
440
441 BTRFS_I(inode)->generation = 0;
442 ret = btrfs_update_inode(trans, root, inode);
443 WARN_ON(ret);
444
445 if (i_size_read(inode) > 0) {
446 ret = btrfs_truncate_free_space_cache(root, trans, path, inode);
447 if (ret)
448 goto out_put;
449 }
450
451 spin_lock(&root->cache_lock);
452 if (root->cached != BTRFS_CACHE_FINISHED) {
453 ret = -1;
454 spin_unlock(&root->cache_lock);
455 goto out_put;
456 }
457 spin_unlock(&root->cache_lock);
458
459 spin_lock(&ctl->tree_lock);
460 prealloc = sizeof(struct btrfs_free_space) * ctl->free_extents;
461 prealloc = ALIGN(prealloc, PAGE_CACHE_SIZE);
462 prealloc += ctl->total_bitmaps * PAGE_CACHE_SIZE;
463 spin_unlock(&ctl->tree_lock);
464
465 /* Just to make sure we have enough space */
466 prealloc += 8 * PAGE_CACHE_SIZE;
467
468 ret = btrfs_check_data_free_space(inode, prealloc);
469 if (ret)
470 goto out_put;
471
472 ret = btrfs_prealloc_file_range_trans(inode, trans, 0, 0, prealloc,
473 prealloc, prealloc, &alloc_hint);
474 if (ret)
475 goto out_put;
476 btrfs_free_reserved_data_space(inode, prealloc);
477
478out_put:
479 iput(inode);
480out:
481 if (ret == 0)
482 ret = btrfs_write_out_ino_cache(root, trans, path);
483
484 btrfs_free_path(path);
485 return ret;
486}
487
488static int btrfs_find_highest_objectid(struct btrfs_root *root, u64 *objectid)
489{
490 struct btrfs_path *path;
491 int ret;
492 struct extent_buffer *l;
493 struct btrfs_key search_key;
494 struct btrfs_key found_key;
495 int slot;
496
497 path = btrfs_alloc_path();
498 if (!path)
499 return -ENOMEM;
500
501 search_key.objectid = BTRFS_LAST_FREE_OBJECTID;
502 search_key.type = -1;
503 search_key.offset = (u64)-1;
504 ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0);
505 if (ret < 0)
506 goto error;
507 BUG_ON(ret == 0);
508 if (path->slots[0] > 0) {
509 slot = path->slots[0] - 1;
510 l = path->nodes[0];
511 btrfs_item_key_to_cpu(l, &found_key, slot);
512 *objectid = max_t(u64, found_key.objectid,
513 BTRFS_FIRST_FREE_OBJECTID - 1);
514 } else {
515 *objectid = BTRFS_FIRST_FREE_OBJECTID - 1;
516 }
517 ret = 0;
518error:
519 btrfs_free_path(path);
520 return ret;
521}
522
523int btrfs_find_free_objectid(struct btrfs_root *root, u64 *objectid)
524{
525 int ret;
526 mutex_lock(&root->objectid_mutex);
527
528 if (unlikely(root->highest_objectid < BTRFS_FIRST_FREE_OBJECTID)) {
529 ret = btrfs_find_highest_objectid(root,
530 &root->highest_objectid);
531 if (ret)
532 goto out;
533 }
534
535 if (unlikely(root->highest_objectid >= BTRFS_LAST_FREE_OBJECTID)) {
536 ret = -ENOSPC;
537 goto out;
538 }
539
540 *objectid = ++root->highest_objectid;
541 ret = 0;
542out:
543 mutex_unlock(&root->objectid_mutex);
544 return ret;
545}
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
19#include <linux/delay.h>
20#include <linux/kthread.h>
21#include <linux/pagemap.h>
22
23#include "ctree.h"
24#include "disk-io.h"
25#include "free-space-cache.h"
26#include "inode-map.h"
27#include "transaction.h"
28
29static 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
41 if (!btrfs_test_opt(root, INODE_MAP_CACHE))
42 return 0;
43
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;
51 path->reada = 2;
52
53 key.objectid = BTRFS_FIRST_FREE_OBJECTID;
54 key.offset = 0;
55 key.type = BTRFS_INODE_ITEM_KEY;
56again:
57 /* need to make sure the commit_root doesn't disappear */
58 down_read(&fs_info->commit_root_sem);
59
60 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
61 if (ret < 0)
62 goto out;
63
64 while (1) {
65 if (btrfs_fs_closing(fs_info))
66 goto out;
67
68 leaf = path->nodes[0];
69 slot = path->slots[0];
70 if (slot >= btrfs_header_nritems(leaf)) {
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
81 if (WARN_ON(btrfs_header_nritems(leaf) == 0))
82 break;
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);
89 btrfs_release_path(path);
90 root->cache_progress = last;
91 up_read(&fs_info->commit_root_sem);
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
103 if (key.objectid >= root->highest_objectid)
104 break;
105
106 if (last != (u64)-1 && last + 1 != key.objectid) {
107 __btrfs_add_free_space(ctl, last + 1,
108 key.objectid - last - 1);
109 wake_up(&root->cache_wait);
110 }
111
112 last = key.objectid;
113next:
114 path->slots[0]++;
115 }
116
117 if (last < root->highest_objectid - 1) {
118 __btrfs_add_free_space(ctl, last + 1,
119 root->highest_objectid - last - 1);
120 }
121
122 spin_lock(&root->cache_lock);
123 root->cached = BTRFS_CACHE_FINISHED;
124 spin_unlock(&root->cache_lock);
125
126 root->cache_progress = (u64)-1;
127 btrfs_unpin_free_ino(root);
128out:
129 wake_up(&root->cache_wait);
130 up_read(&fs_info->commit_root_sem);
131
132 btrfs_free_path(path);
133
134 return ret;
135}
136
137static void start_caching(struct btrfs_root *root)
138{
139 struct btrfs_free_space_ctl *ctl = root->free_ino_ctl;
140 struct task_struct *tsk;
141 int ret;
142 u64 objectid;
143
144 if (!btrfs_test_opt(root, INODE_MAP_CACHE))
145 return;
146
147 spin_lock(&root->cache_lock);
148 if (root->cached != BTRFS_CACHE_NO) {
149 spin_unlock(&root->cache_lock);
150 return;
151 }
152
153 root->cached = BTRFS_CACHE_STARTED;
154 spin_unlock(&root->cache_lock);
155
156 ret = load_free_ino_cache(root->fs_info, root);
157 if (ret == 1) {
158 spin_lock(&root->cache_lock);
159 root->cached = BTRFS_CACHE_FINISHED;
160 spin_unlock(&root->cache_lock);
161 return;
162 }
163
164 /*
165 * It can be quite time-consuming to fill the cache by searching
166 * through the extent tree, and this can keep ino allocation path
167 * waiting. Therefore at start we quickly find out the highest
168 * inode number and we know we can use inode numbers which fall in
169 * [highest_ino + 1, BTRFS_LAST_FREE_OBJECTID].
170 */
171 ret = btrfs_find_free_objectid(root, &objectid);
172 if (!ret && objectid <= BTRFS_LAST_FREE_OBJECTID) {
173 __btrfs_add_free_space(ctl, objectid,
174 BTRFS_LAST_FREE_OBJECTID - objectid + 1);
175 }
176
177 tsk = kthread_run(caching_kthread, root, "btrfs-ino-cache-%llu\n",
178 root->root_key.objectid);
179 if (IS_ERR(tsk)) {
180 btrfs_warn(root->fs_info, "failed to start inode caching task");
181 btrfs_clear_and_info(root, CHANGE_INODE_CACHE,
182 "disabling inode map caching");
183 }
184}
185
186int btrfs_find_free_ino(struct btrfs_root *root, u64 *objectid)
187{
188 if (!btrfs_test_opt(root, INODE_MAP_CACHE))
189 return btrfs_find_free_objectid(root, objectid);
190
191again:
192 *objectid = btrfs_find_ino_for_alloc(root);
193
194 if (*objectid != 0)
195 return 0;
196
197 start_caching(root);
198
199 wait_event(root->cache_wait,
200 root->cached == BTRFS_CACHE_FINISHED ||
201 root->free_ino_ctl->free_space > 0);
202
203 if (root->cached == BTRFS_CACHE_FINISHED &&
204 root->free_ino_ctl->free_space == 0)
205 return -ENOSPC;
206 else
207 goto again;
208}
209
210void btrfs_return_ino(struct btrfs_root *root, u64 objectid)
211{
212 struct btrfs_free_space_ctl *pinned = root->free_ino_pinned;
213
214 if (!btrfs_test_opt(root, INODE_MAP_CACHE))
215 return;
216again:
217 if (root->cached == BTRFS_CACHE_FINISHED) {
218 __btrfs_add_free_space(pinned, objectid, 1);
219 } else {
220 down_write(&root->fs_info->commit_root_sem);
221 spin_lock(&root->cache_lock);
222 if (root->cached == BTRFS_CACHE_FINISHED) {
223 spin_unlock(&root->cache_lock);
224 up_write(&root->fs_info->commit_root_sem);
225 goto again;
226 }
227 spin_unlock(&root->cache_lock);
228
229 start_caching(root);
230
231 __btrfs_add_free_space(pinned, objectid, 1);
232
233 up_write(&root->fs_info->commit_root_sem);
234 }
235}
236
237/*
238 * When a transaction is committed, we'll move those inode numbers which
239 * are smaller than root->cache_progress from pinned tree to free_ino tree,
240 * and others will just be dropped, because the commit root we were
241 * searching has changed.
242 *
243 * Must be called with root->fs_info->commit_root_sem held
244 */
245void btrfs_unpin_free_ino(struct btrfs_root *root)
246{
247 struct btrfs_free_space_ctl *ctl = root->free_ino_ctl;
248 struct rb_root *rbroot = &root->free_ino_pinned->free_space_offset;
249 struct btrfs_free_space *info;
250 struct rb_node *n;
251 u64 count;
252
253 if (!btrfs_test_opt(root, INODE_MAP_CACHE))
254 return;
255
256 while (1) {
257 n = rb_first(rbroot);
258 if (!n)
259 break;
260
261 info = rb_entry(n, struct btrfs_free_space, offset_index);
262 BUG_ON(info->bitmap); /* Logic error */
263
264 if (info->offset > root->cache_progress)
265 goto free;
266 else if (info->offset + info->bytes > root->cache_progress)
267 count = root->cache_progress - info->offset + 1;
268 else
269 count = info->bytes;
270
271 __btrfs_add_free_space(ctl, info->offset, count);
272free:
273 rb_erase(&info->offset_index, rbroot);
274 kfree(info);
275 }
276}
277
278#define INIT_THRESHOLD (((1024 * 32) / 2) / sizeof(struct btrfs_free_space))
279#define INODES_PER_BITMAP (PAGE_CACHE_SIZE * 8)
280
281/*
282 * The goal is to keep the memory used by the free_ino tree won't
283 * exceed the memory if we use bitmaps only.
284 */
285static void recalculate_thresholds(struct btrfs_free_space_ctl *ctl)
286{
287 struct btrfs_free_space *info;
288 struct rb_node *n;
289 int max_ino;
290 int max_bitmaps;
291
292 n = rb_last(&ctl->free_space_offset);
293 if (!n) {
294 ctl->extents_thresh = INIT_THRESHOLD;
295 return;
296 }
297 info = rb_entry(n, struct btrfs_free_space, offset_index);
298
299 /*
300 * Find the maximum inode number in the filesystem. Note we
301 * ignore the fact that this can be a bitmap, because we are
302 * not doing precise calculation.
303 */
304 max_ino = info->bytes - 1;
305
306 max_bitmaps = ALIGN(max_ino, INODES_PER_BITMAP) / INODES_PER_BITMAP;
307 if (max_bitmaps <= ctl->total_bitmaps) {
308 ctl->extents_thresh = 0;
309 return;
310 }
311
312 ctl->extents_thresh = (max_bitmaps - ctl->total_bitmaps) *
313 PAGE_CACHE_SIZE / sizeof(*info);
314}
315
316/*
317 * We don't fall back to bitmap, if we are below the extents threshold
318 * or this chunk of inode numbers is a big one.
319 */
320static bool use_bitmap(struct btrfs_free_space_ctl *ctl,
321 struct btrfs_free_space *info)
322{
323 if (ctl->free_extents < ctl->extents_thresh ||
324 info->bytes > INODES_PER_BITMAP / 10)
325 return false;
326
327 return true;
328}
329
330static struct btrfs_free_space_op free_ino_op = {
331 .recalc_thresholds = recalculate_thresholds,
332 .use_bitmap = use_bitmap,
333};
334
335static void pinned_recalc_thresholds(struct btrfs_free_space_ctl *ctl)
336{
337}
338
339static bool pinned_use_bitmap(struct btrfs_free_space_ctl *ctl,
340 struct btrfs_free_space *info)
341{
342 /*
343 * We always use extents for two reasons:
344 *
345 * - The pinned tree is only used during the process of caching
346 * work.
347 * - Make code simpler. See btrfs_unpin_free_ino().
348 */
349 return false;
350}
351
352static struct btrfs_free_space_op pinned_free_ino_op = {
353 .recalc_thresholds = pinned_recalc_thresholds,
354 .use_bitmap = pinned_use_bitmap,
355};
356
357void btrfs_init_free_ino_ctl(struct btrfs_root *root)
358{
359 struct btrfs_free_space_ctl *ctl = root->free_ino_ctl;
360 struct btrfs_free_space_ctl *pinned = root->free_ino_pinned;
361
362 spin_lock_init(&ctl->tree_lock);
363 ctl->unit = 1;
364 ctl->start = 0;
365 ctl->private = NULL;
366 ctl->op = &free_ino_op;
367
368 /*
369 * Initially we allow to use 16K of ram to cache chunks of
370 * inode numbers before we resort to bitmaps. This is somewhat
371 * arbitrary, but it will be adjusted in runtime.
372 */
373 ctl->extents_thresh = INIT_THRESHOLD;
374
375 spin_lock_init(&pinned->tree_lock);
376 pinned->unit = 1;
377 pinned->start = 0;
378 pinned->private = NULL;
379 pinned->extents_thresh = 0;
380 pinned->op = &pinned_free_ino_op;
381}
382
383int btrfs_save_ino_cache(struct btrfs_root *root,
384 struct btrfs_trans_handle *trans)
385{
386 struct btrfs_free_space_ctl *ctl = root->free_ino_ctl;
387 struct btrfs_path *path;
388 struct inode *inode;
389 struct btrfs_block_rsv *rsv;
390 u64 num_bytes;
391 u64 alloc_hint = 0;
392 int ret;
393 int prealloc;
394 bool retry = false;
395
396 /* only fs tree and subvol/snap needs ino cache */
397 if (root->root_key.objectid != BTRFS_FS_TREE_OBJECTID &&
398 (root->root_key.objectid < BTRFS_FIRST_FREE_OBJECTID ||
399 root->root_key.objectid > BTRFS_LAST_FREE_OBJECTID))
400 return 0;
401
402 /* Don't save inode cache if we are deleting this root */
403 if (btrfs_root_refs(&root->root_item) == 0)
404 return 0;
405
406 if (!btrfs_test_opt(root, INODE_MAP_CACHE))
407 return 0;
408
409 path = btrfs_alloc_path();
410 if (!path)
411 return -ENOMEM;
412
413 rsv = trans->block_rsv;
414 trans->block_rsv = &root->fs_info->trans_block_rsv;
415
416 num_bytes = trans->bytes_reserved;
417 /*
418 * 1 item for inode item insertion if need
419 * 4 items for inode item update (in the worst case)
420 * 1 items for slack space if we need do truncation
421 * 1 item for free space object
422 * 3 items for pre-allocation
423 */
424 trans->bytes_reserved = btrfs_calc_trans_metadata_size(root, 10);
425 ret = btrfs_block_rsv_add(root, trans->block_rsv,
426 trans->bytes_reserved,
427 BTRFS_RESERVE_NO_FLUSH);
428 if (ret)
429 goto out;
430 trace_btrfs_space_reservation(root->fs_info, "ino_cache",
431 trans->transid, trans->bytes_reserved, 1);
432again:
433 inode = lookup_free_ino_inode(root, path);
434 if (IS_ERR(inode) && (PTR_ERR(inode) != -ENOENT || retry)) {
435 ret = PTR_ERR(inode);
436 goto out_release;
437 }
438
439 if (IS_ERR(inode)) {
440 BUG_ON(retry); /* Logic error */
441 retry = true;
442
443 ret = create_free_ino_inode(root, trans, path);
444 if (ret)
445 goto out_release;
446 goto again;
447 }
448
449 BTRFS_I(inode)->generation = 0;
450 ret = btrfs_update_inode(trans, root, inode);
451 if (ret) {
452 btrfs_abort_transaction(trans, root, ret);
453 goto out_put;
454 }
455
456 if (i_size_read(inode) > 0) {
457 ret = btrfs_truncate_free_space_cache(root, trans, inode);
458 if (ret) {
459 if (ret != -ENOSPC)
460 btrfs_abort_transaction(trans, root, ret);
461 goto out_put;
462 }
463 }
464
465 spin_lock(&root->cache_lock);
466 if (root->cached != BTRFS_CACHE_FINISHED) {
467 ret = -1;
468 spin_unlock(&root->cache_lock);
469 goto out_put;
470 }
471 spin_unlock(&root->cache_lock);
472
473 spin_lock(&ctl->tree_lock);
474 prealloc = sizeof(struct btrfs_free_space) * ctl->free_extents;
475 prealloc = ALIGN(prealloc, PAGE_CACHE_SIZE);
476 prealloc += ctl->total_bitmaps * PAGE_CACHE_SIZE;
477 spin_unlock(&ctl->tree_lock);
478
479 /* Just to make sure we have enough space */
480 prealloc += 8 * PAGE_CACHE_SIZE;
481
482 ret = btrfs_delalloc_reserve_space(inode, prealloc);
483 if (ret)
484 goto out_put;
485
486 ret = btrfs_prealloc_file_range_trans(inode, trans, 0, 0, prealloc,
487 prealloc, prealloc, &alloc_hint);
488 if (ret) {
489 btrfs_delalloc_release_space(inode, prealloc);
490 goto out_put;
491 }
492 btrfs_free_reserved_data_space(inode, prealloc);
493
494 ret = btrfs_write_out_ino_cache(root, trans, path, inode);
495out_put:
496 iput(inode);
497out_release:
498 trace_btrfs_space_reservation(root->fs_info, "ino_cache",
499 trans->transid, trans->bytes_reserved, 0);
500 btrfs_block_rsv_release(root, trans->block_rsv, trans->bytes_reserved);
501out:
502 trans->block_rsv = rsv;
503 trans->bytes_reserved = num_bytes;
504
505 btrfs_free_path(path);
506 return ret;
507}
508
509static int btrfs_find_highest_objectid(struct btrfs_root *root, u64 *objectid)
510{
511 struct btrfs_path *path;
512 int ret;
513 struct extent_buffer *l;
514 struct btrfs_key search_key;
515 struct btrfs_key found_key;
516 int slot;
517
518 path = btrfs_alloc_path();
519 if (!path)
520 return -ENOMEM;
521
522 search_key.objectid = BTRFS_LAST_FREE_OBJECTID;
523 search_key.type = -1;
524 search_key.offset = (u64)-1;
525 ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0);
526 if (ret < 0)
527 goto error;
528 BUG_ON(ret == 0); /* Corruption */
529 if (path->slots[0] > 0) {
530 slot = path->slots[0] - 1;
531 l = path->nodes[0];
532 btrfs_item_key_to_cpu(l, &found_key, slot);
533 *objectid = max_t(u64, found_key.objectid,
534 BTRFS_FIRST_FREE_OBJECTID - 1);
535 } else {
536 *objectid = BTRFS_FIRST_FREE_OBJECTID - 1;
537 }
538 ret = 0;
539error:
540 btrfs_free_path(path);
541 return ret;
542}
543
544int btrfs_find_free_objectid(struct btrfs_root *root, u64 *objectid)
545{
546 int ret;
547 mutex_lock(&root->objectid_mutex);
548
549 if (unlikely(root->highest_objectid < BTRFS_FIRST_FREE_OBJECTID)) {
550 ret = btrfs_find_highest_objectid(root,
551 &root->highest_objectid);
552 if (ret)
553 goto out;
554 }
555
556 if (unlikely(root->highest_objectid >= BTRFS_LAST_FREE_OBJECTID)) {
557 ret = -ENOSPC;
558 goto out;
559 }
560
561 *objectid = ++root->highest_objectid;
562 ret = 0;
563out:
564 mutex_unlock(&root->objectid_mutex);
565 return ret;
566}