2018-04-03 17:23:33 +00:00
|
|
|
// SPDX-License-Identifier: GPL-2.0
|
2007-06-12 13:07:21 +00:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2007 Oracle. All rights reserved.
|
|
|
|
*/
|
|
|
|
|
2007-08-29 13:11:44 +00:00
|
|
|
#include <linux/blkdev.h>
|
2007-03-21 15:12:56 +00:00
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/fs.h>
|
|
|
|
#include <linux/pagemap.h>
|
|
|
|
#include <linux/highmem.h>
|
|
|
|
#include <linux/time.h>
|
|
|
|
#include <linux/init.h>
|
2009-04-02 20:46:06 +00:00
|
|
|
#include <linux/seq_file.h>
|
2007-03-21 15:12:56 +00:00
|
|
|
#include <linux/string.h>
|
|
|
|
#include <linux/backing-dev.h>
|
2007-08-29 13:11:44 +00:00
|
|
|
#include <linux/mount.h>
|
2007-03-29 15:56:46 +00:00
|
|
|
#include <linux/writeback.h>
|
2007-04-20 01:01:03 +00:00
|
|
|
#include <linux/statfs.h>
|
2007-06-08 19:33:54 +00:00
|
|
|
#include <linux/compat.h>
|
2007-08-29 13:11:44 +00:00
|
|
|
#include <linux/parser.h>
|
2007-12-18 01:14:04 +00:00
|
|
|
#include <linux/ctype.h>
|
2007-12-18 21:15:09 +00:00
|
|
|
#include <linux/namei.h>
|
2008-03-24 19:02:04 +00:00
|
|
|
#include <linux/miscdevice.h>
|
2009-01-15 21:51:03 +00:00
|
|
|
#include <linux/magic.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 08:04:11 +00:00
|
|
|
#include <linux/slab.h>
|
2011-11-30 15:45:38 +00:00
|
|
|
#include <linux/ratelimit.h>
|
btrfs: Remove custom crc32c init code
The custom crc32 init code was introduced in
14a958e678cd ("Btrfs: fix btrfs boot when compiled as built-in") to
enable using btrfs as a built-in. However, later as pointed out by
60efa5eb2e88 ("Btrfs: use late_initcall instead of module_init") this
wasn't enough and finally btrfs was switched to late_initcall which
comes after the generic crc32c implementation is initiliased. The
latter commit superseeded the former. Now that we don't have to
maintain our own code let's just remove it and switch to using the
generic implementation.
Despite touching a lot of files the patch is really simple. Here is the gist of
the changes:
1. Select LIBCRC32C rather than the low-level modules.
2. s/btrfs_crc32c/crc32c/g
3. replace hash.h with linux/crc32c.h
4. Move the btrfs namehash funcs to ctree.h and change the tree accordingly.
I've tested this with btrfs being both a module and a built-in and xfstest
doesn't complain.
Does seem to fix the longstanding problem of not automatically selectiong
the crc32c module when btrfs is used. Possibly there is a workaround in
dracut.
The modinfo confirms that now all the module dependencies are there:
before:
depends: zstd_compress,zstd_decompress,raid6_pq,xor,zlib_deflate
after:
depends: libcrc32c,zstd_compress,zstd_decompress,raid6_pq,xor,zlib_deflate
Signed-off-by: Nikolay Borisov <nborisov@suse.com>
Reviewed-by: David Sterba <dsterba@suse.com>
[ add more info to changelog from mails ]
Signed-off-by: David Sterba <dsterba@suse.com>
2018-01-08 09:45:05 +00:00
|
|
|
#include <linux/crc32c.h>
|
2013-01-29 06:04:50 +00:00
|
|
|
#include <linux/btrfs.h>
|
2023-08-25 20:19:29 +00:00
|
|
|
#include <linux/security.h>
|
2023-11-22 17:17:44 +00:00
|
|
|
#include <linux/fs_parser.h>
|
2022-10-19 14:50:49 +00:00
|
|
|
#include "messages.h"
|
btrfs: implement delayed inode items operation
Changelog V5 -> V6:
- Fix oom when the memory load is high, by storing the delayed nodes into the
root's radix tree, and letting btrfs inodes go.
Changelog V4 -> V5:
- Fix the race on adding the delayed node to the inode, which is spotted by
Chris Mason.
- Merge Chris Mason's incremental patch into this patch.
- Fix deadlock between readdir() and memory fault, which is reported by
Itaru Kitayama.
Changelog V3 -> V4:
- Fix nested lock, which is reported by Itaru Kitayama, by updating space cache
inode in time.
Changelog V2 -> V3:
- Fix the race between the delayed worker and the task which does delayed items
balance, which is reported by Tsutomu Itoh.
- Modify the patch address David Sterba's comment.
- Fix the bug of the cpu recursion spinlock, reported by Chris Mason
Changelog V1 -> V2:
- break up the global rb-tree, use a list to manage the delayed nodes,
which is created for every directory and file, and used to manage the
delayed directory name index items and the delayed inode item.
- introduce a worker to deal with the delayed nodes.
Compare with Ext3/4, the performance of file creation and deletion on btrfs
is very poor. the reason is that btrfs must do a lot of b+ tree insertions,
such as inode item, directory name item, directory name index and so on.
If we can do some delayed b+ tree insertion or deletion, we can improve the
performance, so we made this patch which implemented delayed directory name
index insertion/deletion and delayed inode update.
Implementation:
- introduce a delayed root object into the filesystem, that use two lists to
manage the delayed nodes which are created for every file/directory.
One is used to manage all the delayed nodes that have delayed items. And the
other is used to manage the delayed nodes which is waiting to be dealt with
by the work thread.
- Every delayed node has two rb-tree, one is used to manage the directory name
index which is going to be inserted into b+ tree, and the other is used to
manage the directory name index which is going to be deleted from b+ tree.
- introduce a worker to deal with the delayed operation. This worker is used
to deal with the works of the delayed directory name index items insertion
and deletion and the delayed inode update.
When the delayed items is beyond the lower limit, we create works for some
delayed nodes and insert them into the work queue of the worker, and then
go back.
When the delayed items is beyond the upper bound, we create works for all
the delayed nodes that haven't been dealt with, and insert them into the work
queue of the worker, and then wait for that the untreated items is below some
threshold value.
- When we want to insert a directory name index into b+ tree, we just add the
information into the delayed inserting rb-tree.
And then we check the number of the delayed items and do delayed items
balance. (The balance policy is above.)
- When we want to delete a directory name index from the b+ tree, we search it
in the inserting rb-tree at first. If we look it up, just drop it. If not,
add the key of it into the delayed deleting rb-tree.
Similar to the delayed inserting rb-tree, we also check the number of the
delayed items and do delayed items balance.
(The same to inserting manipulation)
- When we want to update the metadata of some inode, we cached the data of the
inode into the delayed node. the worker will flush it into the b+ tree after
dealing with the delayed insertion and deletion.
- We will move the delayed node to the tail of the list after we access the
delayed node, By this way, we can cache more delayed items and merge more
inode updates.
- If we want to commit transaction, we will deal with all the delayed node.
- the delayed node will be freed when we free the btrfs inode.
- Before we log the inode items, we commit all the directory name index items
and the delayed inode update.
I did a quick test by the benchmark tool[1] and found we can improve the
performance of file creation by ~15%, and file deletion by ~20%.
Before applying this patch:
Create files:
Total files: 50000
Total time: 1.096108
Average time: 0.000022
Delete files:
Total files: 50000
Total time: 1.510403
Average time: 0.000030
After applying this patch:
Create files:
Total files: 50000
Total time: 0.932899
Average time: 0.000019
Delete files:
Total files: 50000
Total time: 1.215732
Average time: 0.000024
[1] http://marc.info/?l=linux-btrfs&m=128212635122920&q=p3
Many thanks for Kitayama-san's help!
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Reviewed-by: David Sterba <dave@jikos.cz>
Tested-by: Tsutomu Itoh <t-itoh@jp.fujitsu.com>
Tested-by: Itaru Kitayama <kitayama@cl.bb4u.ne.jp>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-04-22 10:12:22 +00:00
|
|
|
#include "delayed-inode.h"
|
2007-03-21 15:12:56 +00:00
|
|
|
#include "ctree.h"
|
2007-03-22 16:13:20 +00:00
|
|
|
#include "disk-io.h"
|
2007-03-23 14:01:08 +00:00
|
|
|
#include "transaction.h"
|
2007-04-02 14:50:19 +00:00
|
|
|
#include "btrfs_inode.h"
|
2024-06-25 14:52:28 +00:00
|
|
|
#include "direct-io.h"
|
Btrfs: add support for inode properties
This change adds infrastructure to allow for generic properties for
inodes. Properties are name/value pairs that can be associated with
inodes for different purposes. They are stored as xattrs with the
prefix "btrfs."
Properties can be inherited - this means when a directory inode has
inheritable properties set, these are added to new inodes created
under that directory. Further, subvolumes can also have properties
associated with them, and they can be inherited from their parent
subvolume. Naturally, directory properties have priority over subvolume
properties (in practice a subvolume property is just a regular
property associated with the root inode, objectid 256, of the
subvolume's fs tree).
This change also adds one specific property implementation, named
"compression", whose values can be "lzo" or "zlib" and it's an
inheritable property.
The corresponding changes to btrfs-progs were also implemented.
A patch with xfstests for this feature will follow once there's
agreement on this change/feature.
Further, the script at the bottom of this commit message was used to
do some benchmarks to measure any performance penalties of this feature.
Basically the tests correspond to:
Test 1 - create a filesystem and mount it with compress-force=lzo,
then sequentially create N files of 64Kb each, measure how long it took
to create the files, unmount the filesystem, mount the filesystem and
perform an 'ls -lha' against the test directory holding the N files, and
report the time the command took.
Test 2 - create a filesystem and don't use any compression option when
mounting it - instead set the compression property of the subvolume's
root to 'lzo'. Then create N files of 64Kb, and report the time it took.
The unmount the filesystem, mount it again and perform an 'ls -lha' like
in the former test. This means every single file ends up with a property
(xattr) associated to it.
Test 3 - same as test 2, but uses 4 properties - 3 are duplicates of the
compression property, have no real effect other than adding more work
when inheriting properties and taking more btree leaf space.
Test 4 - same as test 3 but with 10 properties per file.
Results (in seconds, and averages of 5 runs each), for different N
numbers of files follow.
* Without properties (test 1)
file creation time ls -lha time
10 000 files 3.49 0.76
100 000 files 47.19 8.37
1 000 000 files 518.51 107.06
* With 1 property (compression property set to lzo - test 2)
file creation time ls -lha time
10 000 files 3.63 0.93
100 000 files 48.56 9.74
1 000 000 files 537.72 125.11
* With 4 properties (test 3)
file creation time ls -lha time
10 000 files 3.94 1.20
100 000 files 52.14 11.48
1 000 000 files 572.70 142.13
* With 10 properties (test 4)
file creation time ls -lha time
10 000 files 4.61 1.35
100 000 files 58.86 13.83
1 000 000 files 656.01 177.61
The increased latencies with properties are essencialy because of:
*) When creating an inode, we now synchronously write 1 more item
(an xattr item) for each property inherited from the parent dir
(or subvolume). This could be done in an asynchronous way such
as we do for dir intex items (delayed-inode.c), which could help
reduce the file creation latency;
*) With properties, we now have larger fs trees. For this particular
test each xattr item uses 75 bytes of leaf space in the fs tree.
This could be less by using a new item for xattr items, instead of
the current btrfs_dir_item, since we could cut the 'location' and
'type' fields (saving 18 bytes) and maybe 'transid' too (saving a
total of 26 bytes per xattr item) from the btrfs_dir_item type.
Also tried batching the xattr insertions (ignoring proper hash
collision handling, since it didn't exist) when creating files that
inherit properties from their parent inode/subvolume, but the end
results were (surprisingly) essentially the same.
Test script:
$ cat test.pl
#!/usr/bin/perl -w
use strict;
use Time::HiRes qw(time);
use constant NUM_FILES => 10_000;
use constant FILE_SIZES => (64 * 1024);
use constant DEV => '/dev/sdb4';
use constant MNT_POINT => '/home/fdmanana/btrfs-tests/dev';
use constant TEST_DIR => (MNT_POINT . '/testdir');
system("mkfs.btrfs", "-l", "16384", "-f", DEV) == 0 or die "mkfs.btrfs failed!";
# following line for testing without properties
#system("mount", "-o", "compress-force=lzo", DEV, MNT_POINT) == 0 or die "mount failed!";
# following 2 lines for testing with properties
system("mount", DEV, MNT_POINT) == 0 or die "mount failed!";
system("btrfs", "prop", "set", MNT_POINT, "compression", "lzo") == 0 or die "set prop failed!";
system("mkdir", TEST_DIR) == 0 or die "mkdir failed!";
my ($t1, $t2);
$t1 = time();
for (my $i = 1; $i <= NUM_FILES; $i++) {
my $p = TEST_DIR . '/file_' . $i;
open(my $f, '>', $p) or die "Error opening file!";
$f->autoflush(1);
for (my $j = 0; $j < FILE_SIZES; $j += 4096) {
print $f ('A' x 4096) or die "Error writing to file!";
}
close($f);
}
$t2 = time();
print "Time to create " . NUM_FILES . ": " . ($t2 - $t1) . " seconds.\n";
system("umount", DEV) == 0 or die "umount failed!";
system("mount", DEV, MNT_POINT) == 0 or die "mount failed!";
$t1 = time();
system("bash -c 'ls -lha " . TEST_DIR . " > /dev/null'") == 0 or die "ls failed!";
$t2 = time();
print "Time to ls -lha all files: " . ($t2 - $t1) . " seconds.\n";
system("umount", DEV) == 0 or die "umount failed!";
Signed-off-by: Filipe David Borba Manana <fdmanana@gmail.com>
Signed-off-by: Josef Bacik <jbacik@fb.com>
Signed-off-by: Chris Mason <clm@fb.com>
2014-01-07 11:47:46 +00:00
|
|
|
#include "props.h"
|
2007-11-16 16:45:54 +00:00
|
|
|
#include "xattr.h"
|
2022-11-15 09:44:05 +00:00
|
|
|
#include "bio.h"
|
2008-07-20 20:31:56 +00:00
|
|
|
#include "export.h"
|
Btrfs: Add zlib compression support
This is a large change for adding compression on reading and writing,
both for inline and regular extents. It does some fairly large
surgery to the writeback paths.
Compression is off by default and enabled by mount -o compress. Even
when the -o compress mount option is not used, it is possible to read
compressed extents off the disk.
If compression for a given set of pages fails to make them smaller, the
file is flagged to avoid future compression attempts later.
* While finding delalloc extents, the pages are locked before being sent down
to the delalloc handler. This allows the delalloc handler to do complex things
such as cleaning the pages, marking them writeback and starting IO on their
behalf.
* Inline extents are inserted at delalloc time now. This allows us to compress
the data before inserting the inline extent, and it allows us to insert
an inline extent that spans multiple pages.
* All of the in-memory extent representations (extent_map.c, ordered-data.c etc)
are changed to record both an in-memory size and an on disk size, as well
as a flag for compression.
From a disk format point of view, the extent pointers in the file are changed
to record the on disk size of a given extent and some encoding flags.
Space in the disk format is allocated for compression encoding, as well
as encryption and a generic 'other' field. Neither the encryption or the
'other' field are currently used.
In order to limit the amount of data read for a single random read in the
file, the size of a compressed extent is limited to 128k. This is a
software only limit, the disk format supports u64 sized compressed extents.
In order to limit the ram consumed while processing extents, the uncompressed
size of a compressed extent is limited to 256k. This is a software only limit
and will be subject to tuning later.
Checksumming is still done on compressed extents, and it is done on the
uncompressed version of the data. This way additional encodings can be
layered on without having to figure out which encoding to checksum.
Compression happens at delalloc time, which is basically singled threaded because
it is usually done by a single pdflush thread. This makes it tricky to
spread the compression load across all the cpus on the box. We'll have to
look at parallel pdflush walks of dirty inodes at a later time.
Decompression is hooked into readpages and it does spread across CPUs nicely.
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2008-10-29 18:49:59 +00:00
|
|
|
#include "compression.h"
|
2012-11-06 12:15:27 +00:00
|
|
|
#include "dev-replace.h"
|
2013-03-15 13:47:08 +00:00
|
|
|
#include "free-space-cache.h"
|
2013-08-09 05:25:36 +00:00
|
|
|
#include "backref.h"
|
2019-06-18 20:09:16 +00:00
|
|
|
#include "space-info.h"
|
2019-08-01 15:34:41 +00:00
|
|
|
#include "sysfs.h"
|
2020-11-10 11:26:08 +00:00
|
|
|
#include "zoned.h"
|
2013-08-14 19:05:12 +00:00
|
|
|
#include "tests/btrfs-tests.h"
|
2019-06-20 19:37:44 +00:00
|
|
|
#include "block-group.h"
|
2019-12-14 00:22:14 +00:00
|
|
|
#include "discard.h"
|
2014-07-17 19:39:00 +00:00
|
|
|
#include "qgroup.h"
|
2022-06-01 09:46:59 +00:00
|
|
|
#include "raid56.h"
|
2022-10-19 14:50:47 +00:00
|
|
|
#include "fs.h"
|
2022-10-19 14:51:00 +00:00
|
|
|
#include "accessors.h"
|
2022-10-26 19:08:25 +00:00
|
|
|
#include "defrag.h"
|
2022-10-26 19:08:26 +00:00
|
|
|
#include "dir-item.h"
|
2022-10-26 19:08:29 +00:00
|
|
|
#include "ioctl.h"
|
2022-10-26 19:08:35 +00:00
|
|
|
#include "scrub.h"
|
2022-10-26 19:08:37 +00:00
|
|
|
#include "verity.h"
|
2022-10-26 19:08:39 +00:00
|
|
|
#include "super.h"
|
2022-12-16 00:06:31 +00:00
|
|
|
#include "extent-tree.h"
|
Btrfs: add initial tracepoint support for btrfs
Tracepoints can provide insight into why btrfs hits bugs and be greatly
helpful for debugging, e.g
dd-7822 [000] 2121.641088: btrfs_inode_request: root = 5(FS_TREE), gen = 4, ino = 256, blocks = 8, disk_i_size = 0, last_trans = 8, logged_trans = 0
dd-7822 [000] 2121.641100: btrfs_inode_new: root = 5(FS_TREE), gen = 8, ino = 257, blocks = 0, disk_i_size = 0, last_trans = 0, logged_trans = 0
btrfs-transacti-7804 [001] 2146.935420: btrfs_cow_block: root = 2(EXTENT_TREE), refs = 2, orig_buf = 29368320 (orig_level = 0), cow_buf = 29388800 (cow_level = 0)
btrfs-transacti-7804 [001] 2146.935473: btrfs_cow_block: root = 1(ROOT_TREE), refs = 2, orig_buf = 29364224 (orig_level = 0), cow_buf = 29392896 (cow_level = 0)
btrfs-transacti-7804 [001] 2146.972221: btrfs_transaction_commit: root = 1(ROOT_TREE), gen = 8
flush-btrfs-2-7821 [001] 2155.824210: btrfs_chunk_alloc: root = 3(CHUNK_TREE), offset = 1103101952, size = 1073741824, num_stripes = 1, sub_stripes = 0, type = DATA
flush-btrfs-2-7821 [001] 2155.824241: btrfs_cow_block: root = 2(EXTENT_TREE), refs = 2, orig_buf = 29388800 (orig_level = 0), cow_buf = 29396992 (cow_level = 0)
flush-btrfs-2-7821 [001] 2155.824255: btrfs_cow_block: root = 4(DEV_TREE), refs = 2, orig_buf = 29372416 (orig_level = 0), cow_buf = 29401088 (cow_level = 0)
flush-btrfs-2-7821 [000] 2155.824329: btrfs_cow_block: root = 3(CHUNK_TREE), refs = 2, orig_buf = 20971520 (orig_level = 0), cow_buf = 20975616 (cow_level = 0)
btrfs-endio-wri-7800 [001] 2155.898019: btrfs_cow_block: root = 5(FS_TREE), refs = 2, orig_buf = 29384704 (orig_level = 0), cow_buf = 29405184 (cow_level = 0)
btrfs-endio-wri-7800 [001] 2155.898043: btrfs_cow_block: root = 7(CSUM_TREE), refs = 2, orig_buf = 29376512 (orig_level = 0), cow_buf = 29409280 (cow_level = 0)
Here is what I have added:
1) ordere_extent:
btrfs_ordered_extent_add
btrfs_ordered_extent_remove
btrfs_ordered_extent_start
btrfs_ordered_extent_put
These provide critical information to understand how ordered_extents are
updated.
2) extent_map:
btrfs_get_extent
extent_map is used in both read and write cases, and it is useful for tracking
how btrfs specific IO is running.
3) writepage:
__extent_writepage
btrfs_writepage_end_io_hook
Pages are cirtical resourses and produce a lot of corner cases during writeback,
so it is valuable to know how page is written to disk.
4) inode:
btrfs_inode_new
btrfs_inode_request
btrfs_inode_evict
These can show where and when a inode is created, when a inode is evicted.
5) sync:
btrfs_sync_file
btrfs_sync_fs
These show sync arguments.
6) transaction:
btrfs_transaction_commit
In transaction based filesystem, it will be useful to know the generation and
who does commit.
7) back reference and cow:
btrfs_delayed_tree_ref
btrfs_delayed_data_ref
btrfs_delayed_ref_head
btrfs_cow_block
Btrfs natively supports back references, these tracepoints are helpful on
understanding btrfs's COW mechanism.
8) chunk:
btrfs_chunk_alloc
btrfs_chunk_free
Chunk is a link between physical offset and logical offset, and stands for space
infomation in btrfs, and these are helpful on tracing space things.
9) reserved_extent:
btrfs_reserved_extent_alloc
btrfs_reserved_extent_free
These can show how btrfs uses its space.
Signed-off-by: Liu Bo <liubo2009@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-03-24 11:18:59 +00:00
|
|
|
#define CREATE_TRACE_POINTS
|
|
|
|
#include <trace/events/btrfs.h>
|
|
|
|
|
2009-09-22 00:01:09 +00:00
|
|
|
static const struct super_operations btrfs_super_ops;
|
2011-07-25 19:55:42 +00:00
|
|
|
static struct file_system_type btrfs_fs_type;
|
btrfs: allow mounting btrfs subvolumes with different ro/rw options
Given the following /etc/fstab entries:
/dev/sda3 /mnt/foo btrfs subvol=foo,ro 0 0
/dev/sda3 /mnt/bar btrfs subvol=bar,rw 0 0
you can't issue:
$ mount /mnt/foo
$ mount /mnt/bar
You would have to do:
$ mount /mnt/foo
$ mount -o remount,rw /mnt/foo
$ mount --bind -o remount,ro /mnt/foo
$ mount /mnt/bar
or
$ mount /mnt/bar
$ mount --rw /mnt/foo
$ mount --bind -o remount,ro /mnt/foo
With this patch you can do
$ mount /mnt/foo
$ mount /mnt/bar
$ cat /proc/self/mountinfo
49 33 0:41 /foo /mnt/foo ro,relatime shared:36 - btrfs /dev/sda3 rw,ssd,space_cache
87 33 0:41 /bar /mnt/bar rw,relatime shared:74 - btrfs /dev/sda3 rw,ssd,space_cache
Signed-off-by: Chris Mason <clm@fb.com>
2013-11-19 10:36:05 +00:00
|
|
|
|
2009-01-06 02:25:51 +00:00
|
|
|
static void btrfs_put_super(struct super_block *sb)
|
2007-04-17 17:26:50 +00:00
|
|
|
{
|
2023-11-01 21:24:50 +00:00
|
|
|
struct btrfs_fs_info *fs_info = btrfs_sb(sb);
|
|
|
|
|
|
|
|
btrfs_info(fs_info, "last unmount of filesystem %pU", fs_info->fs_devices->fsid);
|
|
|
|
close_ctree(fs_info);
|
2007-03-29 15:56:46 +00:00
|
|
|
}
|
|
|
|
|
2023-11-22 17:17:45 +00:00
|
|
|
/* Store the mount options related information. */
|
|
|
|
struct btrfs_fs_context {
|
|
|
|
char *subvol_name;
|
|
|
|
u64 subvol_objectid;
|
|
|
|
u64 max_inline;
|
|
|
|
u32 commit_interval;
|
|
|
|
u32 metadata_ratio;
|
|
|
|
u32 thread_pool_size;
|
2024-07-13 09:03:44 +00:00
|
|
|
unsigned long long mount_opt;
|
2023-11-22 17:17:45 +00:00
|
|
|
unsigned long compress_type:4;
|
|
|
|
unsigned int compress_level;
|
2023-11-22 17:17:48 +00:00
|
|
|
refcount_t refs;
|
2023-11-22 17:17:45 +00:00
|
|
|
};
|
|
|
|
|
2007-08-29 13:11:44 +00:00
|
|
|
enum {
|
2023-11-22 17:17:52 +00:00
|
|
|
Opt_acl,
|
2018-03-09 13:37:01 +00:00
|
|
|
Opt_clear_cache,
|
|
|
|
Opt_commit_interval,
|
|
|
|
Opt_compress,
|
|
|
|
Opt_compress_force,
|
|
|
|
Opt_compress_force_type,
|
|
|
|
Opt_compress_type,
|
|
|
|
Opt_degraded,
|
|
|
|
Opt_device,
|
|
|
|
Opt_fatal_errors,
|
2023-11-22 17:17:52 +00:00
|
|
|
Opt_flushoncommit,
|
2018-03-09 13:37:01 +00:00
|
|
|
Opt_max_inline,
|
2023-11-22 17:17:52 +00:00
|
|
|
Opt_barrier,
|
|
|
|
Opt_datacow,
|
|
|
|
Opt_datasum,
|
|
|
|
Opt_defrag,
|
|
|
|
Opt_discard,
|
2019-12-14 00:22:14 +00:00
|
|
|
Opt_discard_mode,
|
2018-03-09 13:37:01 +00:00
|
|
|
Opt_ratio,
|
|
|
|
Opt_rescan_uuid_tree,
|
|
|
|
Opt_skip_balance,
|
2023-11-22 17:17:52 +00:00
|
|
|
Opt_space_cache,
|
2018-03-09 13:37:01 +00:00
|
|
|
Opt_space_cache_version,
|
2023-11-22 17:17:52 +00:00
|
|
|
Opt_ssd,
|
|
|
|
Opt_ssd_spread,
|
2018-03-09 13:37:01 +00:00
|
|
|
Opt_subvol,
|
2018-05-22 00:07:19 +00:00
|
|
|
Opt_subvol_empty,
|
2018-03-09 13:37:01 +00:00
|
|
|
Opt_subvolid,
|
|
|
|
Opt_thread_pool,
|
2023-11-22 17:17:52 +00:00
|
|
|
Opt_treelog,
|
2018-03-09 13:37:01 +00:00
|
|
|
Opt_user_subvol_rm_allowed,
|
2024-05-21 09:57:31 +00:00
|
|
|
Opt_norecovery,
|
2018-03-09 13:37:01 +00:00
|
|
|
|
2020-06-04 07:18:06 +00:00
|
|
|
/* Rescue options */
|
|
|
|
Opt_rescue,
|
|
|
|
Opt_usebackuproot,
|
|
|
|
Opt_nologreplay,
|
|
|
|
|
2018-03-09 13:37:01 +00:00
|
|
|
/* Debugging options */
|
2023-11-22 17:17:52 +00:00
|
|
|
Opt_enospc_debug,
|
2015-09-23 18:54:14 +00:00
|
|
|
#ifdef CONFIG_BTRFS_DEBUG
|
2023-11-22 17:17:44 +00:00
|
|
|
Opt_fragment, Opt_fragment_data, Opt_fragment_metadata, Opt_fragment_all,
|
2017-09-29 19:43:48 +00:00
|
|
|
#endif
|
|
|
|
#ifdef CONFIG_BTRFS_FS_REF_VERIFY
|
|
|
|
Opt_ref_verify,
|
2015-09-23 18:54:14 +00:00
|
|
|
#endif
|
2012-01-16 20:04:48 +00:00
|
|
|
Opt_err,
|
2007-08-29 13:11:44 +00:00
|
|
|
};
|
|
|
|
|
2023-11-22 17:17:44 +00:00
|
|
|
enum {
|
|
|
|
Opt_fatal_errors_panic,
|
|
|
|
Opt_fatal_errors_bug,
|
|
|
|
};
|
2018-03-09 13:37:01 +00:00
|
|
|
|
2023-11-22 17:17:44 +00:00
|
|
|
static const struct constant_table btrfs_parameter_fatal_errors[] = {
|
|
|
|
{ "panic", Opt_fatal_errors_panic },
|
|
|
|
{ "bug", Opt_fatal_errors_bug },
|
|
|
|
{}
|
|
|
|
};
|
|
|
|
|
|
|
|
enum {
|
|
|
|
Opt_discard_sync,
|
|
|
|
Opt_discard_async,
|
|
|
|
};
|
|
|
|
|
|
|
|
static const struct constant_table btrfs_parameter_discard[] = {
|
|
|
|
{ "sync", Opt_discard_sync },
|
|
|
|
{ "async", Opt_discard_async },
|
|
|
|
{}
|
|
|
|
};
|
|
|
|
|
|
|
|
enum {
|
|
|
|
Opt_space_cache_v1,
|
|
|
|
Opt_space_cache_v2,
|
|
|
|
};
|
|
|
|
|
|
|
|
static const struct constant_table btrfs_parameter_space_cache[] = {
|
|
|
|
{ "v1", Opt_space_cache_v1 },
|
|
|
|
{ "v2", Opt_space_cache_v2 },
|
|
|
|
{}
|
|
|
|
};
|
|
|
|
|
|
|
|
enum {
|
|
|
|
Opt_rescue_usebackuproot,
|
|
|
|
Opt_rescue_nologreplay,
|
|
|
|
Opt_rescue_ignorebadroots,
|
|
|
|
Opt_rescue_ignoredatacsums,
|
2024-06-14 04:22:30 +00:00
|
|
|
Opt_rescue_ignoremetacsums,
|
2024-06-14 04:22:31 +00:00
|
|
|
Opt_rescue_ignoresuperflags,
|
2023-11-22 17:17:44 +00:00
|
|
|
Opt_rescue_parameter_all,
|
|
|
|
};
|
|
|
|
|
|
|
|
static const struct constant_table btrfs_parameter_rescue[] = {
|
|
|
|
{ "usebackuproot", Opt_rescue_usebackuproot },
|
|
|
|
{ "nologreplay", Opt_rescue_nologreplay },
|
|
|
|
{ "ignorebadroots", Opt_rescue_ignorebadroots },
|
|
|
|
{ "ibadroots", Opt_rescue_ignorebadroots },
|
|
|
|
{ "ignoredatacsums", Opt_rescue_ignoredatacsums },
|
2024-06-14 04:22:30 +00:00
|
|
|
{ "ignoremetacsums", Opt_rescue_ignoremetacsums},
|
2024-06-14 04:22:31 +00:00
|
|
|
{ "ignoresuperflags", Opt_rescue_ignoresuperflags},
|
2023-11-22 17:17:44 +00:00
|
|
|
{ "idatacsums", Opt_rescue_ignoredatacsums },
|
2024-06-14 04:22:30 +00:00
|
|
|
{ "imetacsums", Opt_rescue_ignoremetacsums},
|
2024-06-14 04:22:31 +00:00
|
|
|
{ "isuperflags", Opt_rescue_ignoresuperflags},
|
2023-11-22 17:17:44 +00:00
|
|
|
{ "all", Opt_rescue_parameter_all },
|
|
|
|
{}
|
|
|
|
};
|
|
|
|
|
|
|
|
#ifdef CONFIG_BTRFS_DEBUG
|
|
|
|
enum {
|
|
|
|
Opt_fragment_parameter_data,
|
|
|
|
Opt_fragment_parameter_metadata,
|
|
|
|
Opt_fragment_parameter_all,
|
|
|
|
};
|
|
|
|
|
|
|
|
static const struct constant_table btrfs_parameter_fragment[] = {
|
|
|
|
{ "data", Opt_fragment_parameter_data },
|
|
|
|
{ "metadata", Opt_fragment_parameter_metadata },
|
|
|
|
{ "all", Opt_fragment_parameter_all },
|
|
|
|
{}
|
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
2023-11-22 17:17:50 +00:00
|
|
|
static const struct fs_parameter_spec btrfs_fs_parameters[] = {
|
2023-11-22 17:17:44 +00:00
|
|
|
fsparam_flag_no("acl", Opt_acl),
|
|
|
|
fsparam_flag_no("autodefrag", Opt_defrag),
|
|
|
|
fsparam_flag_no("barrier", Opt_barrier),
|
|
|
|
fsparam_flag("clear_cache", Opt_clear_cache),
|
|
|
|
fsparam_u32("commit", Opt_commit_interval),
|
|
|
|
fsparam_flag("compress", Opt_compress),
|
|
|
|
fsparam_string("compress", Opt_compress_type),
|
|
|
|
fsparam_flag("compress-force", Opt_compress_force),
|
|
|
|
fsparam_string("compress-force", Opt_compress_force_type),
|
|
|
|
fsparam_flag_no("datacow", Opt_datacow),
|
|
|
|
fsparam_flag_no("datasum", Opt_datasum),
|
|
|
|
fsparam_flag("degraded", Opt_degraded),
|
|
|
|
fsparam_string("device", Opt_device),
|
|
|
|
fsparam_flag_no("discard", Opt_discard),
|
|
|
|
fsparam_enum("discard", Opt_discard_mode, btrfs_parameter_discard),
|
|
|
|
fsparam_enum("fatal_errors", Opt_fatal_errors, btrfs_parameter_fatal_errors),
|
|
|
|
fsparam_flag_no("flushoncommit", Opt_flushoncommit),
|
|
|
|
fsparam_string("max_inline", Opt_max_inline),
|
|
|
|
fsparam_u32("metadata_ratio", Opt_ratio),
|
|
|
|
fsparam_flag("rescan_uuid_tree", Opt_rescan_uuid_tree),
|
|
|
|
fsparam_flag("skip_balance", Opt_skip_balance),
|
|
|
|
fsparam_flag_no("space_cache", Opt_space_cache),
|
|
|
|
fsparam_enum("space_cache", Opt_space_cache_version, btrfs_parameter_space_cache),
|
|
|
|
fsparam_flag_no("ssd", Opt_ssd),
|
|
|
|
fsparam_flag_no("ssd_spread", Opt_ssd_spread),
|
|
|
|
fsparam_string("subvol", Opt_subvol),
|
|
|
|
fsparam_flag("subvol=", Opt_subvol_empty),
|
|
|
|
fsparam_u64("subvolid", Opt_subvolid),
|
|
|
|
fsparam_u32("thread_pool", Opt_thread_pool),
|
|
|
|
fsparam_flag_no("treelog", Opt_treelog),
|
|
|
|
fsparam_flag("user_subvol_rm_allowed", Opt_user_subvol_rm_allowed),
|
|
|
|
|
|
|
|
/* Rescue options. */
|
|
|
|
fsparam_enum("rescue", Opt_rescue, btrfs_parameter_rescue),
|
2020-06-04 07:18:06 +00:00
|
|
|
/* Deprecated, with alias rescue=nologreplay */
|
2023-11-22 17:17:44 +00:00
|
|
|
__fsparam(NULL, "nologreplay", Opt_nologreplay, fs_param_deprecated, NULL),
|
2020-06-04 07:18:06 +00:00
|
|
|
/* Deprecated, with alias rescue=usebackuproot */
|
2023-11-22 17:17:44 +00:00
|
|
|
__fsparam(NULL, "usebackuproot", Opt_usebackuproot, fs_param_deprecated, NULL),
|
2024-05-21 09:57:31 +00:00
|
|
|
/* For compatibility only, alias for "rescue=nologreplay". */
|
|
|
|
fsparam_flag("norecovery", Opt_norecovery),
|
2020-06-04 07:18:06 +00:00
|
|
|
|
2023-11-22 17:17:44 +00:00
|
|
|
/* Debugging options. */
|
|
|
|
fsparam_flag_no("enospc_debug", Opt_enospc_debug),
|
2015-09-23 18:54:14 +00:00
|
|
|
#ifdef CONFIG_BTRFS_DEBUG
|
2023-11-22 17:17:44 +00:00
|
|
|
fsparam_enum("fragment", Opt_fragment, btrfs_parameter_fragment),
|
2017-09-29 19:43:48 +00:00
|
|
|
#endif
|
|
|
|
#ifdef CONFIG_BTRFS_FS_REF_VERIFY
|
2023-11-22 17:17:44 +00:00
|
|
|
fsparam_flag("ref_verify", Opt_ref_verify),
|
2015-09-23 18:54:14 +00:00
|
|
|
#endif
|
2023-11-22 17:17:44 +00:00
|
|
|
{}
|
2007-08-29 13:11:44 +00:00
|
|
|
};
|
|
|
|
|
for-6.8-tag
-----BEGIN PGP SIGNATURE-----
iQIzBAABCgAdFiEE8rQSAMVO+zA4DBdWxWXV+ddtWDsFAmWYTmMACgkQxWXV+ddt
WDvPRg/+KgS5LV3nNC0MguYcTMQxmgeutIgXZIMfeA3v6EnFS7nj8leP4EPc6+bj
JPSkwj4u2vHVwpnTVuEAuJUXnmFY+Qu70nVy6bM2uOHOYTVBQ8zRVK4cErNNLWCp
OekDaADR53RrZ/xprlQ7b7Ph0Ch2uq9OrpH50IcyquEsH1ffkxlqwyrvth4/8dxC
6zgsFHWrbtVKJf0DYoQPpjEPz5tpdQ+xHZwtmf1cNlUgI1objODr/ZTqXtZqTfw4
/GwrtDPbEri53K/qjgr0dDH7pBVqD6PtnbgoHfYkiizZ0G7UkmlaK6rZIurtATJb
Yk/RCqCUp9tPC4yeFSewFMm1Y8Ae3rkUBG7rnYkvMmBspMqyh/kQAWSBimF5yk/y
vFEdFTe9AbdvP19Nw0CqovLzaO6RrOXCL1usnFvCmBgvF5gZAv63ZW1njP3ZoNta
wB8Rs6hxdRkph8Dk7yvYf54uUR+JyKqjHY6egg2qkKTjz0CSf6qQFyFZXpr81m97
gK4WN5SeP/P2ukRbBKKyzZ5IljUxZuVatvJa0tktd7kAbU26WLzofOJ7pX+iqimM
F2G7gKGJZykLY1WPntXBp9Dg97Ras2O5iViQ7ZKwRdOx1yZS5zzTYlIznHBAmXbL
UgXfVnpJH1xFdkvedNTn+Fz9BHNV1K2a2AT7VITj7sxz23z3aJA=
=4sw3
-----END PGP SIGNATURE-----
Merge tag 'for-6.8-tag' of git://git.kernel.org/pub/scm/linux/kernel/git/kdave/linux
Pull btrfs updates from David Sterba:
"There are no exciting changes for users, it's been mostly API
conversions and some fixes or refactoring.
The mount API conversion is a base for future improvements that would
come with VFS. Metadata processing has been converted to folios, not
yet enabling the large folios but it's one patch away once everything
gets tested enough.
Core changes:
- convert extent buffers to folios:
- direct API conversion where possible
- performance can drop by a few percent on metadata heavy
workloads, the folio sizes are not constant and the calculations
add up in the item helpers
- both regular and subpage modes
- data cannot be converted yet, we need to port that to iomap and
there are some other generic changes required
- convert mount to the new API, should not be user visible:
- options deprecated long time ago have been removed: inode_cache,
recovery
- the new logic that splits mount to two phases slightly changes
timing of device scanning for multi-device filesystems
- LSM options will now work (like for selinux)
- convert delayed nodes radix tree to xarray, preserving the
preload-like logic that still allows to allocate with GFP_NOFS
- more validation of sysfs value of scrub_speed_max
- refactor chunk map structure, reduce size and improve performance
- extent map refactoring, smaller data structures, improved
performance
- reduce size of struct extent_io_tree, embedded in several
structures
- temporary pages used for compression are cached and attached to a
shrinker, this may slightly improve performance
- in zoned mode, remove redirty extent buffer tracking, zeros are
written in case an out-of-order is detected and proper data are
written to the actual write pointer
- cleanups, refactoring, error message improvements, updated tests
- verify and update branch name or tag
- remove unwanted text"
* tag 'for-6.8-tag' of git://git.kernel.org/pub/scm/linux/kernel/git/kdave/linux: (89 commits)
btrfs: pass btrfs_io_geometry into btrfs_max_io_len
btrfs: pass struct btrfs_io_geometry to set_io_stripe
btrfs: open code set_io_stripe for RAID56
btrfs: change block mapping to switch/case in btrfs_map_block
btrfs: factor out block mapping for single profiles
btrfs: factor out block mapping for RAID5/6
btrfs: reduce scope of data_stripes in btrfs_map_block
btrfs: factor out block mapping for RAID10
btrfs: factor out block mapping for DUP profiles
btrfs: factor out RAID1 block mapping
btrfs: factor out block-mapping for RAID0
btrfs: re-introduce struct btrfs_io_geometry
btrfs: factor out helper for single device IO check
btrfs: migrate btrfs_repair_io_failure() to folio interfaces
btrfs: migrate eb_bitmap_offset() to folio interfaces
btrfs: migrate various end io functions to folios
btrfs: migrate subpage code to folio interfaces
btrfs: migrate get_eb_page_index() and get_eb_offset_in_page() to folios
btrfs: don't double put our subpage reference in alloc_extent_buffer
btrfs: cleanup metadata page pointer usage
...
2024-01-10 17:27:40 +00:00
|
|
|
/* No support for restricting writes to btrfs devices yet... */
|
|
|
|
static inline blk_mode_t btrfs_open_mode(struct fs_context *fc)
|
2020-10-16 15:29:13 +00:00
|
|
|
{
|
for-6.8-tag
-----BEGIN PGP SIGNATURE-----
iQIzBAABCgAdFiEE8rQSAMVO+zA4DBdWxWXV+ddtWDsFAmWYTmMACgkQxWXV+ddt
WDvPRg/+KgS5LV3nNC0MguYcTMQxmgeutIgXZIMfeA3v6EnFS7nj8leP4EPc6+bj
JPSkwj4u2vHVwpnTVuEAuJUXnmFY+Qu70nVy6bM2uOHOYTVBQ8zRVK4cErNNLWCp
OekDaADR53RrZ/xprlQ7b7Ph0Ch2uq9OrpH50IcyquEsH1ffkxlqwyrvth4/8dxC
6zgsFHWrbtVKJf0DYoQPpjEPz5tpdQ+xHZwtmf1cNlUgI1objODr/ZTqXtZqTfw4
/GwrtDPbEri53K/qjgr0dDH7pBVqD6PtnbgoHfYkiizZ0G7UkmlaK6rZIurtATJb
Yk/RCqCUp9tPC4yeFSewFMm1Y8Ae3rkUBG7rnYkvMmBspMqyh/kQAWSBimF5yk/y
vFEdFTe9AbdvP19Nw0CqovLzaO6RrOXCL1usnFvCmBgvF5gZAv63ZW1njP3ZoNta
wB8Rs6hxdRkph8Dk7yvYf54uUR+JyKqjHY6egg2qkKTjz0CSf6qQFyFZXpr81m97
gK4WN5SeP/P2ukRbBKKyzZ5IljUxZuVatvJa0tktd7kAbU26WLzofOJ7pX+iqimM
F2G7gKGJZykLY1WPntXBp9Dg97Ras2O5iViQ7ZKwRdOx1yZS5zzTYlIznHBAmXbL
UgXfVnpJH1xFdkvedNTn+Fz9BHNV1K2a2AT7VITj7sxz23z3aJA=
=4sw3
-----END PGP SIGNATURE-----
Merge tag 'for-6.8-tag' of git://git.kernel.org/pub/scm/linux/kernel/git/kdave/linux
Pull btrfs updates from David Sterba:
"There are no exciting changes for users, it's been mostly API
conversions and some fixes or refactoring.
The mount API conversion is a base for future improvements that would
come with VFS. Metadata processing has been converted to folios, not
yet enabling the large folios but it's one patch away once everything
gets tested enough.
Core changes:
- convert extent buffers to folios:
- direct API conversion where possible
- performance can drop by a few percent on metadata heavy
workloads, the folio sizes are not constant and the calculations
add up in the item helpers
- both regular and subpage modes
- data cannot be converted yet, we need to port that to iomap and
there are some other generic changes required
- convert mount to the new API, should not be user visible:
- options deprecated long time ago have been removed: inode_cache,
recovery
- the new logic that splits mount to two phases slightly changes
timing of device scanning for multi-device filesystems
- LSM options will now work (like for selinux)
- convert delayed nodes radix tree to xarray, preserving the
preload-like logic that still allows to allocate with GFP_NOFS
- more validation of sysfs value of scrub_speed_max
- refactor chunk map structure, reduce size and improve performance
- extent map refactoring, smaller data structures, improved
performance
- reduce size of struct extent_io_tree, embedded in several
structures
- temporary pages used for compression are cached and attached to a
shrinker, this may slightly improve performance
- in zoned mode, remove redirty extent buffer tracking, zeros are
written in case an out-of-order is detected and proper data are
written to the actual write pointer
- cleanups, refactoring, error message improvements, updated tests
- verify and update branch name or tag
- remove unwanted text"
* tag 'for-6.8-tag' of git://git.kernel.org/pub/scm/linux/kernel/git/kdave/linux: (89 commits)
btrfs: pass btrfs_io_geometry into btrfs_max_io_len
btrfs: pass struct btrfs_io_geometry to set_io_stripe
btrfs: open code set_io_stripe for RAID56
btrfs: change block mapping to switch/case in btrfs_map_block
btrfs: factor out block mapping for single profiles
btrfs: factor out block mapping for RAID5/6
btrfs: reduce scope of data_stripes in btrfs_map_block
btrfs: factor out block mapping for RAID10
btrfs: factor out block mapping for DUP profiles
btrfs: factor out RAID1 block mapping
btrfs: factor out block-mapping for RAID0
btrfs: re-introduce struct btrfs_io_geometry
btrfs: factor out helper for single device IO check
btrfs: migrate btrfs_repair_io_failure() to folio interfaces
btrfs: migrate eb_bitmap_offset() to folio interfaces
btrfs: migrate various end io functions to folios
btrfs: migrate subpage code to folio interfaces
btrfs: migrate get_eb_page_index() and get_eb_offset_in_page() to folios
btrfs: don't double put our subpage reference in alloc_extent_buffer
btrfs: cleanup metadata page pointer usage
...
2024-01-10 17:27:40 +00:00
|
|
|
return sb_open_mode(fc->sb_flags) & ~BLK_OPEN_RESTRICT_WRITES;
|
2020-10-16 15:29:13 +00:00
|
|
|
}
|
|
|
|
|
2023-11-22 17:17:45 +00:00
|
|
|
static int btrfs_parse_param(struct fs_context *fc, struct fs_parameter *param)
|
2020-06-04 07:18:06 +00:00
|
|
|
{
|
2023-11-22 17:17:45 +00:00
|
|
|
struct btrfs_fs_context *ctx = fc->fs_private;
|
|
|
|
struct fs_parse_result result;
|
|
|
|
int opt;
|
2020-06-04 07:18:06 +00:00
|
|
|
|
2023-11-22 17:17:45 +00:00
|
|
|
opt = fs_parse(fc, btrfs_fs_parameters, param, &result);
|
|
|
|
if (opt < 0)
|
|
|
|
return opt;
|
2020-06-04 07:18:06 +00:00
|
|
|
|
2023-11-22 17:17:45 +00:00
|
|
|
switch (opt) {
|
|
|
|
case Opt_degraded:
|
|
|
|
btrfs_set_opt(ctx->mount_opt, DEGRADED);
|
|
|
|
break;
|
|
|
|
case Opt_subvol_empty:
|
|
|
|
/*
|
|
|
|
* This exists because we used to allow it on accident, so we're
|
|
|
|
* keeping it to maintain ABI. See 37becec95ac3 ("Btrfs: allow
|
|
|
|
* empty subvol= again").
|
|
|
|
*/
|
|
|
|
break;
|
|
|
|
case Opt_subvol:
|
|
|
|
kfree(ctx->subvol_name);
|
|
|
|
ctx->subvol_name = kstrdup(param->string, GFP_KERNEL);
|
|
|
|
if (!ctx->subvol_name)
|
|
|
|
return -ENOMEM;
|
|
|
|
break;
|
|
|
|
case Opt_subvolid:
|
|
|
|
ctx->subvol_objectid = result.uint_64;
|
2020-06-04 07:18:06 +00:00
|
|
|
|
2023-11-22 17:17:45 +00:00
|
|
|
/* subvolid=0 means give me the original fs_tree. */
|
|
|
|
if (!ctx->subvol_objectid)
|
|
|
|
ctx->subvol_objectid = BTRFS_FS_TREE_OBJECTID;
|
|
|
|
break;
|
|
|
|
case Opt_device: {
|
|
|
|
struct btrfs_device *device;
|
for-6.8-tag
-----BEGIN PGP SIGNATURE-----
iQIzBAABCgAdFiEE8rQSAMVO+zA4DBdWxWXV+ddtWDsFAmWYTmMACgkQxWXV+ddt
WDvPRg/+KgS5LV3nNC0MguYcTMQxmgeutIgXZIMfeA3v6EnFS7nj8leP4EPc6+bj
JPSkwj4u2vHVwpnTVuEAuJUXnmFY+Qu70nVy6bM2uOHOYTVBQ8zRVK4cErNNLWCp
OekDaADR53RrZ/xprlQ7b7Ph0Ch2uq9OrpH50IcyquEsH1ffkxlqwyrvth4/8dxC
6zgsFHWrbtVKJf0DYoQPpjEPz5tpdQ+xHZwtmf1cNlUgI1objODr/ZTqXtZqTfw4
/GwrtDPbEri53K/qjgr0dDH7pBVqD6PtnbgoHfYkiizZ0G7UkmlaK6rZIurtATJb
Yk/RCqCUp9tPC4yeFSewFMm1Y8Ae3rkUBG7rnYkvMmBspMqyh/kQAWSBimF5yk/y
vFEdFTe9AbdvP19Nw0CqovLzaO6RrOXCL1usnFvCmBgvF5gZAv63ZW1njP3ZoNta
wB8Rs6hxdRkph8Dk7yvYf54uUR+JyKqjHY6egg2qkKTjz0CSf6qQFyFZXpr81m97
gK4WN5SeP/P2ukRbBKKyzZ5IljUxZuVatvJa0tktd7kAbU26WLzofOJ7pX+iqimM
F2G7gKGJZykLY1WPntXBp9Dg97Ras2O5iViQ7ZKwRdOx1yZS5zzTYlIznHBAmXbL
UgXfVnpJH1xFdkvedNTn+Fz9BHNV1K2a2AT7VITj7sxz23z3aJA=
=4sw3
-----END PGP SIGNATURE-----
Merge tag 'for-6.8-tag' of git://git.kernel.org/pub/scm/linux/kernel/git/kdave/linux
Pull btrfs updates from David Sterba:
"There are no exciting changes for users, it's been mostly API
conversions and some fixes or refactoring.
The mount API conversion is a base for future improvements that would
come with VFS. Metadata processing has been converted to folios, not
yet enabling the large folios but it's one patch away once everything
gets tested enough.
Core changes:
- convert extent buffers to folios:
- direct API conversion where possible
- performance can drop by a few percent on metadata heavy
workloads, the folio sizes are not constant and the calculations
add up in the item helpers
- both regular and subpage modes
- data cannot be converted yet, we need to port that to iomap and
there are some other generic changes required
- convert mount to the new API, should not be user visible:
- options deprecated long time ago have been removed: inode_cache,
recovery
- the new logic that splits mount to two phases slightly changes
timing of device scanning for multi-device filesystems
- LSM options will now work (like for selinux)
- convert delayed nodes radix tree to xarray, preserving the
preload-like logic that still allows to allocate with GFP_NOFS
- more validation of sysfs value of scrub_speed_max
- refactor chunk map structure, reduce size and improve performance
- extent map refactoring, smaller data structures, improved
performance
- reduce size of struct extent_io_tree, embedded in several
structures
- temporary pages used for compression are cached and attached to a
shrinker, this may slightly improve performance
- in zoned mode, remove redirty extent buffer tracking, zeros are
written in case an out-of-order is detected and proper data are
written to the actual write pointer
- cleanups, refactoring, error message improvements, updated tests
- verify and update branch name or tag
- remove unwanted text"
* tag 'for-6.8-tag' of git://git.kernel.org/pub/scm/linux/kernel/git/kdave/linux: (89 commits)
btrfs: pass btrfs_io_geometry into btrfs_max_io_len
btrfs: pass struct btrfs_io_geometry to set_io_stripe
btrfs: open code set_io_stripe for RAID56
btrfs: change block mapping to switch/case in btrfs_map_block
btrfs: factor out block mapping for single profiles
btrfs: factor out block mapping for RAID5/6
btrfs: reduce scope of data_stripes in btrfs_map_block
btrfs: factor out block mapping for RAID10
btrfs: factor out block mapping for DUP profiles
btrfs: factor out RAID1 block mapping
btrfs: factor out block-mapping for RAID0
btrfs: re-introduce struct btrfs_io_geometry
btrfs: factor out helper for single device IO check
btrfs: migrate btrfs_repair_io_failure() to folio interfaces
btrfs: migrate eb_bitmap_offset() to folio interfaces
btrfs: migrate various end io functions to folios
btrfs: migrate subpage code to folio interfaces
btrfs: migrate get_eb_page_index() and get_eb_offset_in_page() to folios
btrfs: don't double put our subpage reference in alloc_extent_buffer
btrfs: cleanup metadata page pointer usage
...
2024-01-10 17:27:40 +00:00
|
|
|
blk_mode_t mode = btrfs_open_mode(fc);
|
2020-06-04 07:18:06 +00:00
|
|
|
|
2023-11-22 17:17:45 +00:00
|
|
|
mutex_lock(&uuid_mutex);
|
|
|
|
device = btrfs_scan_one_device(param->string, mode, false);
|
|
|
|
mutex_unlock(&uuid_mutex);
|
|
|
|
if (IS_ERR(device))
|
|
|
|
return PTR_ERR(device);
|
|
|
|
break;
|
2020-06-04 07:18:06 +00:00
|
|
|
}
|
2023-11-22 17:17:45 +00:00
|
|
|
case Opt_datasum:
|
|
|
|
if (result.negated) {
|
|
|
|
btrfs_set_opt(ctx->mount_opt, NODATASUM);
|
2020-11-10 11:26:10 +00:00
|
|
|
} else {
|
2023-11-22 17:17:45 +00:00
|
|
|
btrfs_clear_opt(ctx->mount_opt, NODATACOW);
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, NODATASUM);
|
2020-11-10 11:26:10 +00:00
|
|
|
}
|
2023-11-22 17:17:45 +00:00
|
|
|
break;
|
|
|
|
case Opt_datacow:
|
|
|
|
if (result.negated) {
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, COMPRESS);
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, FORCE_COMPRESS);
|
|
|
|
btrfs_set_opt(ctx->mount_opt, NODATACOW);
|
|
|
|
btrfs_set_opt(ctx->mount_opt, NODATASUM);
|
|
|
|
} else {
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, NODATACOW);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case Opt_compress_force:
|
|
|
|
case Opt_compress_force_type:
|
|
|
|
btrfs_set_opt(ctx->mount_opt, FORCE_COMPRESS);
|
|
|
|
fallthrough;
|
|
|
|
case Opt_compress:
|
|
|
|
case Opt_compress_type:
|
|
|
|
if (opt == Opt_compress || opt == Opt_compress_force) {
|
|
|
|
ctx->compress_type = BTRFS_COMPRESS_ZLIB;
|
|
|
|
ctx->compress_level = BTRFS_ZLIB_DEFAULT_LEVEL;
|
|
|
|
btrfs_set_opt(ctx->mount_opt, COMPRESS);
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, NODATACOW);
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, NODATASUM);
|
|
|
|
} else if (strncmp(param->string, "zlib", 4) == 0) {
|
|
|
|
ctx->compress_type = BTRFS_COMPRESS_ZLIB;
|
|
|
|
ctx->compress_level =
|
|
|
|
btrfs_compress_str2level(BTRFS_COMPRESS_ZLIB,
|
|
|
|
param->string + 4);
|
|
|
|
btrfs_set_opt(ctx->mount_opt, COMPRESS);
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, NODATACOW);
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, NODATASUM);
|
|
|
|
} else if (strncmp(param->string, "lzo", 3) == 0) {
|
|
|
|
ctx->compress_type = BTRFS_COMPRESS_LZO;
|
|
|
|
ctx->compress_level = 0;
|
|
|
|
btrfs_set_opt(ctx->mount_opt, COMPRESS);
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, NODATACOW);
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, NODATASUM);
|
|
|
|
} else if (strncmp(param->string, "zstd", 4) == 0) {
|
|
|
|
ctx->compress_type = BTRFS_COMPRESS_ZSTD;
|
|
|
|
ctx->compress_level =
|
|
|
|
btrfs_compress_str2level(BTRFS_COMPRESS_ZSTD,
|
|
|
|
param->string + 4);
|
|
|
|
btrfs_set_opt(ctx->mount_opt, COMPRESS);
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, NODATACOW);
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, NODATASUM);
|
|
|
|
} else if (strncmp(param->string, "no", 2) == 0) {
|
|
|
|
ctx->compress_level = 0;
|
|
|
|
ctx->compress_type = 0;
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, COMPRESS);
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, FORCE_COMPRESS);
|
|
|
|
} else {
|
|
|
|
btrfs_err(NULL, "unrecognized compression value %s",
|
|
|
|
param->string);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case Opt_ssd:
|
|
|
|
if (result.negated) {
|
|
|
|
btrfs_set_opt(ctx->mount_opt, NOSSD);
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, SSD);
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, SSD_SPREAD);
|
|
|
|
} else {
|
|
|
|
btrfs_set_opt(ctx->mount_opt, SSD);
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, NOSSD);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case Opt_ssd_spread:
|
|
|
|
if (result.negated) {
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, SSD_SPREAD);
|
|
|
|
} else {
|
|
|
|
btrfs_set_opt(ctx->mount_opt, SSD);
|
|
|
|
btrfs_set_opt(ctx->mount_opt, SSD_SPREAD);
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, NOSSD);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case Opt_barrier:
|
|
|
|
if (result.negated)
|
|
|
|
btrfs_set_opt(ctx->mount_opt, NOBARRIER);
|
|
|
|
else
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, NOBARRIER);
|
|
|
|
break;
|
|
|
|
case Opt_thread_pool:
|
|
|
|
if (result.uint_32 == 0) {
|
|
|
|
btrfs_err(NULL, "invalid value 0 for thread_pool");
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
ctx->thread_pool_size = result.uint_32;
|
|
|
|
break;
|
|
|
|
case Opt_max_inline:
|
|
|
|
ctx->max_inline = memparse(param->string, NULL);
|
|
|
|
break;
|
|
|
|
case Opt_acl:
|
|
|
|
if (result.negated) {
|
|
|
|
fc->sb_flags &= ~SB_POSIXACL;
|
|
|
|
} else {
|
2014-05-12 03:04:33 +00:00
|
|
|
#ifdef CONFIG_BTRFS_FS_POSIX_ACL
|
2023-11-22 17:17:45 +00:00
|
|
|
fc->sb_flags |= SB_POSIXACL;
|
2014-05-12 03:04:33 +00:00
|
|
|
#else
|
2023-11-22 17:17:45 +00:00
|
|
|
btrfs_err(NULL, "support for ACL not compiled in");
|
|
|
|
return -EINVAL;
|
2014-05-12 03:04:33 +00:00
|
|
|
#endif
|
2023-11-22 17:17:45 +00:00
|
|
|
}
|
|
|
|
/*
|
|
|
|
* VFS limits the ability to toggle ACL on and off via remount,
|
|
|
|
* despite every file system allowing this. This seems to be
|
|
|
|
* an oversight since we all do, but it'll fail if we're
|
|
|
|
* remounting. So don't set the mask here, we'll check it in
|
|
|
|
* btrfs_reconfigure and do the toggling ourselves.
|
|
|
|
*/
|
|
|
|
if (fc->purpose != FS_CONTEXT_FOR_RECONFIGURE)
|
|
|
|
fc->sb_flags_mask |= SB_POSIXACL;
|
|
|
|
break;
|
|
|
|
case Opt_treelog:
|
|
|
|
if (result.negated)
|
|
|
|
btrfs_set_opt(ctx->mount_opt, NOTREELOG);
|
|
|
|
else
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, NOTREELOG);
|
|
|
|
break;
|
|
|
|
case Opt_nologreplay:
|
|
|
|
btrfs_warn(NULL,
|
2020-06-04 07:18:06 +00:00
|
|
|
"'nologreplay' is deprecated, use 'rescue=nologreplay' instead");
|
2023-11-22 17:17:45 +00:00
|
|
|
btrfs_set_opt(ctx->mount_opt, NOLOGREPLAY);
|
|
|
|
break;
|
2024-05-21 09:57:31 +00:00
|
|
|
case Opt_norecovery:
|
|
|
|
btrfs_info(NULL,
|
|
|
|
"'norecovery' is for compatibility only, recommended to use 'rescue=nologreplay'");
|
|
|
|
btrfs_set_opt(ctx->mount_opt, NOLOGREPLAY);
|
|
|
|
break;
|
2023-11-22 17:17:45 +00:00
|
|
|
case Opt_flushoncommit:
|
|
|
|
if (result.negated)
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, FLUSHONCOMMIT);
|
|
|
|
else
|
|
|
|
btrfs_set_opt(ctx->mount_opt, FLUSHONCOMMIT);
|
|
|
|
break;
|
|
|
|
case Opt_ratio:
|
|
|
|
ctx->metadata_ratio = result.uint_32;
|
|
|
|
break;
|
|
|
|
case Opt_discard:
|
|
|
|
if (result.negated) {
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, DISCARD_SYNC);
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, DISCARD_ASYNC);
|
|
|
|
btrfs_set_opt(ctx->mount_opt, NODISCARD);
|
|
|
|
} else {
|
|
|
|
btrfs_set_opt(ctx->mount_opt, DISCARD_SYNC);
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, DISCARD_ASYNC);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case Opt_discard_mode:
|
|
|
|
switch (result.uint_32) {
|
|
|
|
case Opt_discard_sync:
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, DISCARD_ASYNC);
|
|
|
|
btrfs_set_opt(ctx->mount_opt, DISCARD_SYNC);
|
2010-06-21 18:48:16 +00:00
|
|
|
break;
|
2023-11-22 17:17:45 +00:00
|
|
|
case Opt_discard_async:
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, DISCARD_SYNC);
|
|
|
|
btrfs_set_opt(ctx->mount_opt, DISCARD_ASYNC);
|
2010-10-29 19:46:43 +00:00
|
|
|
break;
|
2023-11-22 17:17:45 +00:00
|
|
|
default:
|
|
|
|
btrfs_err(NULL, "unrecognized discard mode value %s",
|
|
|
|
param->key);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, NODISCARD);
|
|
|
|
break;
|
|
|
|
case Opt_space_cache:
|
|
|
|
if (result.negated) {
|
|
|
|
btrfs_set_opt(ctx->mount_opt, NOSPACECACHE);
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, SPACE_CACHE);
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, FREE_SPACE_TREE);
|
|
|
|
} else {
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, FREE_SPACE_TREE);
|
|
|
|
btrfs_set_opt(ctx->mount_opt, SPACE_CACHE);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case Opt_space_cache_version:
|
|
|
|
switch (result.uint_32) {
|
|
|
|
case Opt_space_cache_v1:
|
|
|
|
btrfs_set_opt(ctx->mount_opt, SPACE_CACHE);
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, FREE_SPACE_TREE);
|
2011-02-16 18:10:41 +00:00
|
|
|
break;
|
2023-11-22 17:17:45 +00:00
|
|
|
case Opt_space_cache_v2:
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, SPACE_CACHE);
|
|
|
|
btrfs_set_opt(ctx->mount_opt, FREE_SPACE_TREE);
|
2014-01-06 01:58:28 +00:00
|
|
|
break;
|
2023-11-22 17:17:45 +00:00
|
|
|
default:
|
|
|
|
btrfs_err(NULL, "unrecognized space_cache value %s",
|
|
|
|
param->key);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case Opt_rescan_uuid_tree:
|
|
|
|
btrfs_set_opt(ctx->mount_opt, RESCAN_UUID_TREE);
|
|
|
|
break;
|
|
|
|
case Opt_clear_cache:
|
|
|
|
btrfs_set_opt(ctx->mount_opt, CLEAR_CACHE);
|
|
|
|
break;
|
|
|
|
case Opt_user_subvol_rm_allowed:
|
|
|
|
btrfs_set_opt(ctx->mount_opt, USER_SUBVOL_RM_ALLOWED);
|
|
|
|
break;
|
|
|
|
case Opt_enospc_debug:
|
|
|
|
if (result.negated)
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, ENOSPC_DEBUG);
|
|
|
|
else
|
|
|
|
btrfs_set_opt(ctx->mount_opt, ENOSPC_DEBUG);
|
|
|
|
break;
|
|
|
|
case Opt_defrag:
|
|
|
|
if (result.negated)
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, AUTO_DEFRAG);
|
|
|
|
else
|
|
|
|
btrfs_set_opt(ctx->mount_opt, AUTO_DEFRAG);
|
|
|
|
break;
|
|
|
|
case Opt_usebackuproot:
|
|
|
|
btrfs_warn(NULL,
|
|
|
|
"'usebackuproot' is deprecated, use 'rescue=usebackuproot' instead");
|
|
|
|
btrfs_set_opt(ctx->mount_opt, USEBACKUPROOT);
|
2023-11-22 17:17:54 +00:00
|
|
|
|
|
|
|
/* If we're loading the backup roots we can't trust the space cache. */
|
|
|
|
btrfs_set_opt(ctx->mount_opt, CLEAR_CACHE);
|
2023-11-22 17:17:45 +00:00
|
|
|
break;
|
|
|
|
case Opt_skip_balance:
|
|
|
|
btrfs_set_opt(ctx->mount_opt, SKIP_BALANCE);
|
|
|
|
break;
|
|
|
|
case Opt_fatal_errors:
|
|
|
|
switch (result.uint_32) {
|
|
|
|
case Opt_fatal_errors_panic:
|
|
|
|
btrfs_set_opt(ctx->mount_opt, PANIC_ON_FATAL_ERROR);
|
2011-05-24 19:35:30 +00:00
|
|
|
break;
|
2023-11-22 17:17:45 +00:00
|
|
|
case Opt_fatal_errors_bug:
|
|
|
|
btrfs_clear_opt(ctx->mount_opt, PANIC_ON_FATAL_ERROR);
|
2014-01-06 01:58:26 +00:00
|
|
|
break;
|
2023-11-22 17:17:45 +00:00
|
|
|
default:
|
|
|
|
btrfs_err(NULL, "unrecognized fatal_errors value %s",
|
|
|
|
param->key);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case Opt_commit_interval:
|
|
|
|
ctx->commit_interval = result.uint_32;
|
|
|
|
if (ctx->commit_interval == 0)
|
|
|
|
ctx->commit_interval = BTRFS_DEFAULT_COMMIT_INTERVAL;
|
|
|
|
break;
|
|
|
|
case Opt_rescue:
|
|
|
|
switch (result.uint_32) {
|
|
|
|
case Opt_rescue_usebackuproot:
|
|
|
|
btrfs_set_opt(ctx->mount_opt, USEBACKUPROOT);
|
2011-11-03 19:17:42 +00:00
|
|
|
break;
|
2023-11-22 17:17:45 +00:00
|
|
|
case Opt_rescue_nologreplay:
|
|
|
|
btrfs_set_opt(ctx->mount_opt, NOLOGREPLAY);
|
2012-01-16 20:04:48 +00:00
|
|
|
break;
|
2023-11-22 17:17:45 +00:00
|
|
|
case Opt_rescue_ignorebadroots:
|
|
|
|
btrfs_set_opt(ctx->mount_opt, IGNOREBADROOTS);
|
2011-10-04 03:22:31 +00:00
|
|
|
break;
|
2023-11-22 17:17:45 +00:00
|
|
|
case Opt_rescue_ignoredatacsums:
|
|
|
|
btrfs_set_opt(ctx->mount_opt, IGNOREDATACSUMS);
|
2013-08-01 16:14:52 +00:00
|
|
|
break;
|
2024-06-14 04:22:30 +00:00
|
|
|
case Opt_rescue_ignoremetacsums:
|
|
|
|
btrfs_set_opt(ctx->mount_opt, IGNOREMETACSUMS);
|
|
|
|
break;
|
2024-06-14 04:22:31 +00:00
|
|
|
case Opt_rescue_ignoresuperflags:
|
|
|
|
btrfs_set_opt(ctx->mount_opt, IGNORESUPERFLAGS);
|
|
|
|
break;
|
2023-11-22 17:17:45 +00:00
|
|
|
case Opt_rescue_parameter_all:
|
|
|
|
btrfs_set_opt(ctx->mount_opt, IGNOREDATACSUMS);
|
2024-06-14 04:22:30 +00:00
|
|
|
btrfs_set_opt(ctx->mount_opt, IGNOREMETACSUMS);
|
2024-06-14 04:22:31 +00:00
|
|
|
btrfs_set_opt(ctx->mount_opt, IGNORESUPERFLAGS);
|
2023-11-22 17:17:45 +00:00
|
|
|
btrfs_set_opt(ctx->mount_opt, IGNOREBADROOTS);
|
|
|
|
btrfs_set_opt(ctx->mount_opt, NOLOGREPLAY);
|
2020-06-04 07:18:06 +00:00
|
|
|
break;
|
2023-11-22 17:17:45 +00:00
|
|
|
default:
|
|
|
|
btrfs_info(NULL, "unrecognized rescue option '%s'",
|
|
|
|
param->key);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
break;
|
2015-09-23 18:54:14 +00:00
|
|
|
#ifdef CONFIG_BTRFS_DEBUG
|
2023-11-22 17:17:45 +00:00
|
|
|
case Opt_fragment:
|
|
|
|
switch (result.uint_32) {
|
|
|
|
case Opt_fragment_parameter_all:
|
|
|
|
btrfs_set_opt(ctx->mount_opt, FRAGMENT_DATA);
|
|
|
|
btrfs_set_opt(ctx->mount_opt, FRAGMENT_METADATA);
|
2015-09-23 18:54:14 +00:00
|
|
|
break;
|
2023-11-22 17:17:45 +00:00
|
|
|
case Opt_fragment_parameter_metadata:
|
|
|
|
btrfs_set_opt(ctx->mount_opt, FRAGMENT_METADATA);
|
2015-09-23 18:54:14 +00:00
|
|
|
break;
|
2023-11-22 17:17:45 +00:00
|
|
|
case Opt_fragment_parameter_data:
|
|
|
|
btrfs_set_opt(ctx->mount_opt, FRAGMENT_DATA);
|
2015-09-23 18:54:14 +00:00
|
|
|
break;
|
2023-11-22 17:17:45 +00:00
|
|
|
default:
|
|
|
|
btrfs_info(NULL, "unrecognized fragment option '%s'",
|
|
|
|
param->key);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
break;
|
2017-09-29 19:43:48 +00:00
|
|
|
#endif
|
|
|
|
#ifdef CONFIG_BTRFS_FS_REF_VERIFY
|
2023-11-22 17:17:45 +00:00
|
|
|
case Opt_ref_verify:
|
|
|
|
btrfs_set_opt(ctx->mount_opt, REF_VERIFY);
|
|
|
|
break;
|
2015-09-23 18:54:14 +00:00
|
|
|
#endif
|
2023-11-22 17:17:45 +00:00
|
|
|
default:
|
|
|
|
btrfs_err(NULL, "unrecognized mount option '%s'", param->key);
|
|
|
|
return -EINVAL;
|
2007-08-29 13:11:44 +00:00
|
|
|
}
|
2020-10-16 15:29:13 +00:00
|
|
|
|
2023-11-22 17:17:45 +00:00
|
|
|
return 0;
|
2008-06-10 14:40:29 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2023-11-22 17:17:53 +00:00
|
|
|
* Some options only have meaning at mount time and shouldn't persist across
|
|
|
|
* remounts, or be displayed. Clear these at the end of mount and remount code
|
|
|
|
* paths.
|
2008-06-10 14:40:29 +00:00
|
|
|
*/
|
2023-11-22 17:17:53 +00:00
|
|
|
static void btrfs_clear_oneshot_options(struct btrfs_fs_info *fs_info)
|
2008-06-10 14:40:29 +00:00
|
|
|
{
|
2023-11-22 17:17:53 +00:00
|
|
|
btrfs_clear_opt(fs_info->mount_opt, USEBACKUPROOT);
|
|
|
|
btrfs_clear_opt(fs_info->mount_opt, CLEAR_CACHE);
|
|
|
|
btrfs_clear_opt(fs_info->mount_opt, NOSPACECACHE);
|
|
|
|
}
|
2017-12-14 08:25:28 +00:00
|
|
|
|
2024-05-30 17:14:12 +00:00
|
|
|
static bool check_ro_option(const struct btrfs_fs_info *fs_info,
|
2024-07-13 09:03:44 +00:00
|
|
|
unsigned long long mount_opt, unsigned long long opt,
|
2020-10-16 15:29:13 +00:00
|
|
|
const char *opt_name)
|
|
|
|
{
|
2023-11-22 17:17:47 +00:00
|
|
|
if (mount_opt & opt) {
|
2020-10-16 15:29:13 +00:00
|
|
|
btrfs_err(fs_info, "%s must be used with ro mount option",
|
|
|
|
opt_name);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
2018-06-19 15:50:25 +00:00
|
|
|
|
2024-07-13 09:03:44 +00:00
|
|
|
bool btrfs_check_options(const struct btrfs_fs_info *info,
|
|
|
|
unsigned long long *mount_opt,
|
2023-11-22 17:17:50 +00:00
|
|
|
unsigned long flags)
|
2023-11-22 17:17:38 +00:00
|
|
|
{
|
|
|
|
bool ret = true;
|
2017-12-14 08:25:28 +00:00
|
|
|
|
2023-11-22 17:17:38 +00:00
|
|
|
if (!(flags & SB_RDONLY) &&
|
2023-11-22 17:17:47 +00:00
|
|
|
(check_ro_option(info, *mount_opt, BTRFS_MOUNT_NOLOGREPLAY, "nologreplay") ||
|
|
|
|
check_ro_option(info, *mount_opt, BTRFS_MOUNT_IGNOREBADROOTS, "ignorebadroots") ||
|
2024-06-14 04:22:30 +00:00
|
|
|
check_ro_option(info, *mount_opt, BTRFS_MOUNT_IGNOREDATACSUMS, "ignoredatacsums") ||
|
2024-06-14 04:22:31 +00:00
|
|
|
check_ro_option(info, *mount_opt, BTRFS_MOUNT_IGNOREMETACSUMS, "ignoremetacsums") ||
|
|
|
|
check_ro_option(info, *mount_opt, BTRFS_MOUNT_IGNORESUPERFLAGS, "ignoresuperflags")))
|
2023-11-22 17:17:38 +00:00
|
|
|
ret = false;
|
2017-12-14 08:25:28 +00:00
|
|
|
|
2023-11-22 17:17:38 +00:00
|
|
|
if (btrfs_fs_compat_ro(info, FREE_SPACE_TREE) &&
|
2023-11-22 17:17:47 +00:00
|
|
|
!btrfs_raw_test_opt(*mount_opt, FREE_SPACE_TREE) &&
|
|
|
|
!btrfs_raw_test_opt(*mount_opt, CLEAR_CACHE)) {
|
2023-11-22 17:17:38 +00:00
|
|
|
btrfs_err(info, "cannot disable free-space-tree");
|
|
|
|
ret = false;
|
|
|
|
}
|
|
|
|
if (btrfs_fs_compat_ro(info, BLOCK_GROUP_TREE) &&
|
2023-11-22 17:17:47 +00:00
|
|
|
!btrfs_raw_test_opt(*mount_opt, FREE_SPACE_TREE)) {
|
2023-11-22 17:17:38 +00:00
|
|
|
btrfs_err(info, "cannot disable free-space-tree with block-group-tree feature");
|
|
|
|
ret = false;
|
|
|
|
}
|
2017-12-14 08:25:28 +00:00
|
|
|
|
2023-11-22 17:17:47 +00:00
|
|
|
if (btrfs_check_mountopts_zoned(info, mount_opt))
|
2023-11-22 17:17:38 +00:00
|
|
|
ret = false;
|
2017-12-14 08:25:28 +00:00
|
|
|
|
2023-11-22 17:17:38 +00:00
|
|
|
if (!test_bit(BTRFS_FS_STATE_REMOUNTING, &info->fs_state)) {
|
2024-07-29 15:05:48 +00:00
|
|
|
if (btrfs_raw_test_opt(*mount_opt, SPACE_CACHE)) {
|
2023-11-22 17:17:38 +00:00
|
|
|
btrfs_info(info, "disk space caching is enabled");
|
2024-07-29 15:05:48 +00:00
|
|
|
btrfs_warn(info,
|
|
|
|
"space cache v1 is being deprecated and will be removed in a future release, please use -o space_cache=v2");
|
|
|
|
}
|
2023-11-22 17:17:47 +00:00
|
|
|
if (btrfs_raw_test_opt(*mount_opt, FREE_SPACE_TREE))
|
2023-11-22 17:17:38 +00:00
|
|
|
btrfs_info(info, "using free-space-tree");
|
2017-12-14 08:25:28 +00:00
|
|
|
}
|
|
|
|
|
2023-11-22 17:17:38 +00:00
|
|
|
return ret;
|
2017-12-14 08:25:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2023-11-22 17:17:40 +00:00
|
|
|
* This is subtle, we only call this during open_ctree(). We need to pre-load
|
|
|
|
* the mount options with the on-disk settings. Before the new mount API took
|
|
|
|
* effect we would do this on mount and remount. With the new mount API we'll
|
|
|
|
* only do this on the initial mount.
|
2017-12-14 08:25:28 +00:00
|
|
|
*
|
2023-11-22 17:17:40 +00:00
|
|
|
* This isn't a change in behavior, because we're using the current state of the
|
|
|
|
* file system to set the current mount options. If you mounted with special
|
|
|
|
* options to disable these features and then remounted we wouldn't revert the
|
|
|
|
* settings, because mounting without these features cleared the on-disk
|
|
|
|
* settings, so this being called on re-mount is not needed.
|
2017-12-14 08:25:28 +00:00
|
|
|
*/
|
2023-11-22 17:17:40 +00:00
|
|
|
void btrfs_set_free_space_cache_settings(struct btrfs_fs_info *fs_info)
|
2017-12-14 08:25:28 +00:00
|
|
|
{
|
2023-11-22 17:17:40 +00:00
|
|
|
if (fs_info->sectorsize < PAGE_SIZE) {
|
|
|
|
btrfs_clear_opt(fs_info->mount_opt, SPACE_CACHE);
|
|
|
|
if (!btrfs_test_opt(fs_info, FREE_SPACE_TREE)) {
|
|
|
|
btrfs_info(fs_info,
|
|
|
|
"forcing free space tree for sector size %u with page size %lu",
|
|
|
|
fs_info->sectorsize, PAGE_SIZE);
|
|
|
|
btrfs_set_opt(fs_info->mount_opt, FREE_SPACE_TREE);
|
|
|
|
}
|
|
|
|
}
|
2008-06-10 14:40:29 +00:00
|
|
|
|
|
|
|
/*
|
2023-11-22 17:17:50 +00:00
|
|
|
* At this point our mount options are populated, so we only mess with
|
|
|
|
* these settings if we don't have any settings already.
|
2008-06-10 14:40:29 +00:00
|
|
|
*/
|
2023-11-22 17:17:50 +00:00
|
|
|
if (btrfs_test_opt(fs_info, FREE_SPACE_TREE))
|
|
|
|
return;
|
2008-06-10 14:40:29 +00:00
|
|
|
|
2023-11-22 17:17:50 +00:00
|
|
|
if (btrfs_is_zoned(fs_info) &&
|
|
|
|
btrfs_free_space_cache_v1_active(fs_info)) {
|
|
|
|
btrfs_info(fs_info, "zoned: clearing existing space cache");
|
|
|
|
btrfs_set_super_cache_generation(fs_info->super_copy, 0);
|
|
|
|
return;
|
|
|
|
}
|
2008-06-10 14:40:29 +00:00
|
|
|
|
2023-11-22 17:17:50 +00:00
|
|
|
if (btrfs_test_opt(fs_info, SPACE_CACHE))
|
|
|
|
return;
|
2018-02-14 17:11:37 +00:00
|
|
|
|
2023-11-22 17:17:50 +00:00
|
|
|
if (btrfs_test_opt(fs_info, NOSPACECACHE))
|
|
|
|
return;
|
2018-02-14 17:11:37 +00:00
|
|
|
|
2023-11-22 17:17:50 +00:00
|
|
|
/*
|
|
|
|
* At this point we don't have explicit options set by the user, set
|
|
|
|
* them ourselves based on the state of the file system.
|
|
|
|
*/
|
|
|
|
if (btrfs_fs_compat_ro(fs_info, FREE_SPACE_TREE))
|
|
|
|
btrfs_set_opt(fs_info->mount_opt, FREE_SPACE_TREE);
|
|
|
|
else if (btrfs_free_space_cache_v1_active(fs_info))
|
|
|
|
btrfs_set_opt(fs_info->mount_opt, SPACE_CACHE);
|
2023-11-22 17:17:40 +00:00
|
|
|
}
|
2008-06-10 14:40:29 +00:00
|
|
|
|
2023-11-22 17:17:51 +00:00
|
|
|
static void set_device_specific_options(struct btrfs_fs_info *fs_info)
|
|
|
|
{
|
|
|
|
if (!btrfs_test_opt(fs_info, NOSSD) &&
|
|
|
|
!fs_info->fs_devices->rotating)
|
|
|
|
btrfs_set_opt(fs_info->mount_opt, SSD);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* For devices supporting discard turn on discard=async automatically,
|
|
|
|
* unless it's already set or disabled. This could be turned off by
|
|
|
|
* nodiscard for the same mount.
|
|
|
|
*
|
|
|
|
* The zoned mode piggy backs on the discard functionality for
|
|
|
|
* resetting a zone. There is no reason to delay the zone reset as it is
|
|
|
|
* fast enough. So, do not enable async discard for zoned mode.
|
|
|
|
*/
|
|
|
|
if (!(btrfs_test_opt(fs_info, DISCARD_SYNC) ||
|
|
|
|
btrfs_test_opt(fs_info, DISCARD_ASYNC) ||
|
|
|
|
btrfs_test_opt(fs_info, NODISCARD)) &&
|
|
|
|
fs_info->fs_devices->discardable &&
|
|
|
|
!btrfs_is_zoned(fs_info))
|
|
|
|
btrfs_set_opt(fs_info->mount_opt, DISCARD_ASYNC);
|
2007-08-29 13:11:44 +00:00
|
|
|
}
|
|
|
|
|
2020-02-21 13:56:12 +00:00
|
|
|
char *btrfs_get_subvol_name_from_objectid(struct btrfs_fs_info *fs_info,
|
|
|
|
u64 subvol_objectid)
|
Btrfs: change how we mount subvolumes
This work is in preperation for being able to set a different root as the
default mounting root.
There is currently a problem with how we mount subvolumes. We cannot currently
mount a subvolume of a subvolume, you can only mount subvolumes/snapshots of the
default subvolume. So say you take a snapshot of the default subvolume and call
it snap1, and then take a snapshot of snap1 and call it snap2, so now you have
/
/snap1
/snap1/snap2
as your available volumes. Currently you can only mount / and /snap1,
you cannot mount /snap1/snap2. To fix this problem instead of passing
subvolid=<name> you must pass in subvolid=<treeid>, where <treeid> is
the tree id that gets spit out via the subvolume listing you get from
the subvolume listing patches (btrfs filesystem list). This allows us
to mount /, /snap1 and /snap1/snap2 as the root volume.
In addition to the above, we also now read the default dir item in the
tree root to get the root key that it points to. For now this just
points at what has always been the default subvolme, but later on I plan
to change it to point at whatever root you want to be the new default
root, so you can just set the default mount and not have to mount with
-o subvolid=<treeid>. I tested this out with the above scenario and it
worked perfectly. Thanks,
mount -o subvol operates inside the selected subvolid. For example:
mount -o subvol=snap1,subvolid=256 /dev/xxx /mnt
/mnt will have the snap1 directory for the subvolume with id
256.
mount -o subvol=snap /dev/xxx /mnt
/mnt will be the snap directory of whatever the default subvolume
is.
Signed-off-by: Josef Bacik <josef@redhat.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2009-12-04 17:38:27 +00:00
|
|
|
{
|
2011-11-17 20:40:49 +00:00
|
|
|
struct btrfs_root *root = fs_info->tree_root;
|
2020-02-06 15:24:26 +00:00
|
|
|
struct btrfs_root *fs_root = NULL;
|
2015-05-18 09:16:30 +00:00
|
|
|
struct btrfs_root_ref *root_ref;
|
|
|
|
struct btrfs_inode_ref *inode_ref;
|
|
|
|
struct btrfs_key key;
|
|
|
|
struct btrfs_path *path = NULL;
|
|
|
|
char *name = NULL, *ptr;
|
|
|
|
u64 dirid;
|
|
|
|
int len;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
path = btrfs_alloc_path();
|
|
|
|
if (!path) {
|
|
|
|
ret = -ENOMEM;
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
|
2017-06-22 00:26:54 +00:00
|
|
|
name = kmalloc(PATH_MAX, GFP_KERNEL);
|
2015-05-18 09:16:30 +00:00
|
|
|
if (!name) {
|
|
|
|
ret = -ENOMEM;
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
ptr = name + PATH_MAX - 1;
|
|
|
|
ptr[0] = '\0';
|
Btrfs: change how we mount subvolumes
This work is in preperation for being able to set a different root as the
default mounting root.
There is currently a problem with how we mount subvolumes. We cannot currently
mount a subvolume of a subvolume, you can only mount subvolumes/snapshots of the
default subvolume. So say you take a snapshot of the default subvolume and call
it snap1, and then take a snapshot of snap1 and call it snap2, so now you have
/
/snap1
/snap1/snap2
as your available volumes. Currently you can only mount / and /snap1,
you cannot mount /snap1/snap2. To fix this problem instead of passing
subvolid=<name> you must pass in subvolid=<treeid>, where <treeid> is
the tree id that gets spit out via the subvolume listing you get from
the subvolume listing patches (btrfs filesystem list). This allows us
to mount /, /snap1 and /snap1/snap2 as the root volume.
In addition to the above, we also now read the default dir item in the
tree root to get the root key that it points to. For now this just
points at what has always been the default subvolme, but later on I plan
to change it to point at whatever root you want to be the new default
root, so you can just set the default mount and not have to mount with
-o subvolid=<treeid>. I tested this out with the above scenario and it
worked perfectly. Thanks,
mount -o subvol operates inside the selected subvolid. For example:
mount -o subvol=snap1,subvolid=256 /dev/xxx /mnt
/mnt will have the snap1 directory for the subvolume with id
256.
mount -o subvol=snap /dev/xxx /mnt
/mnt will be the snap directory of whatever the default subvolume
is.
Signed-off-by: Josef Bacik <josef@redhat.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2009-12-04 17:38:27 +00:00
|
|
|
|
|
|
|
/*
|
2015-05-18 09:16:30 +00:00
|
|
|
* Walk up the subvolume trees in the tree of tree roots by root
|
|
|
|
* backrefs until we hit the top-level subvolume.
|
Btrfs: change how we mount subvolumes
This work is in preperation for being able to set a different root as the
default mounting root.
There is currently a problem with how we mount subvolumes. We cannot currently
mount a subvolume of a subvolume, you can only mount subvolumes/snapshots of the
default subvolume. So say you take a snapshot of the default subvolume and call
it snap1, and then take a snapshot of snap1 and call it snap2, so now you have
/
/snap1
/snap1/snap2
as your available volumes. Currently you can only mount / and /snap1,
you cannot mount /snap1/snap2. To fix this problem instead of passing
subvolid=<name> you must pass in subvolid=<treeid>, where <treeid> is
the tree id that gets spit out via the subvolume listing you get from
the subvolume listing patches (btrfs filesystem list). This allows us
to mount /, /snap1 and /snap1/snap2 as the root volume.
In addition to the above, we also now read the default dir item in the
tree root to get the root key that it points to. For now this just
points at what has always been the default subvolme, but later on I plan
to change it to point at whatever root you want to be the new default
root, so you can just set the default mount and not have to mount with
-o subvolid=<treeid>. I tested this out with the above scenario and it
worked perfectly. Thanks,
mount -o subvol operates inside the selected subvolid. For example:
mount -o subvol=snap1,subvolid=256 /dev/xxx /mnt
/mnt will have the snap1 directory for the subvolume with id
256.
mount -o subvol=snap /dev/xxx /mnt
/mnt will be the snap directory of whatever the default subvolume
is.
Signed-off-by: Josef Bacik <josef@redhat.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2009-12-04 17:38:27 +00:00
|
|
|
*/
|
2015-05-18 09:16:30 +00:00
|
|
|
while (subvol_objectid != BTRFS_FS_TREE_OBJECTID) {
|
|
|
|
key.objectid = subvol_objectid;
|
|
|
|
key.type = BTRFS_ROOT_BACKREF_KEY;
|
|
|
|
key.offset = (u64)-1;
|
|
|
|
|
2021-07-29 08:22:16 +00:00
|
|
|
ret = btrfs_search_backwards(root, &key, path);
|
2015-05-18 09:16:30 +00:00
|
|
|
if (ret < 0) {
|
|
|
|
goto err;
|
|
|
|
} else if (ret > 0) {
|
2021-07-29 08:22:16 +00:00
|
|
|
ret = -ENOENT;
|
|
|
|
goto err;
|
2015-05-18 09:16:30 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
subvol_objectid = key.offset;
|
|
|
|
|
|
|
|
root_ref = btrfs_item_ptr(path->nodes[0], path->slots[0],
|
|
|
|
struct btrfs_root_ref);
|
|
|
|
len = btrfs_root_ref_name_len(path->nodes[0], root_ref);
|
|
|
|
ptr -= len + 1;
|
|
|
|
if (ptr < name) {
|
|
|
|
ret = -ENAMETOOLONG;
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
read_extent_buffer(path->nodes[0], ptr + 1,
|
|
|
|
(unsigned long)(root_ref + 1), len);
|
|
|
|
ptr[0] = '/';
|
|
|
|
dirid = btrfs_root_ref_dirid(path->nodes[0], root_ref);
|
|
|
|
btrfs_release_path(path);
|
|
|
|
|
2020-05-15 17:35:55 +00:00
|
|
|
fs_root = btrfs_get_fs_root(fs_info, subvol_objectid, true);
|
2015-05-18 09:16:30 +00:00
|
|
|
if (IS_ERR(fs_root)) {
|
|
|
|
ret = PTR_ERR(fs_root);
|
2020-02-06 15:24:26 +00:00
|
|
|
fs_root = NULL;
|
|
|
|
goto err;
|
|
|
|
}
|
2015-05-18 09:16:30 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Walk up the filesystem tree by inode refs until we hit the
|
|
|
|
* root directory.
|
|
|
|
*/
|
|
|
|
while (dirid != BTRFS_FIRST_FREE_OBJECTID) {
|
|
|
|
key.objectid = dirid;
|
|
|
|
key.type = BTRFS_INODE_REF_KEY;
|
|
|
|
key.offset = (u64)-1;
|
|
|
|
|
2021-07-29 08:22:16 +00:00
|
|
|
ret = btrfs_search_backwards(fs_root, &key, path);
|
2015-05-18 09:16:30 +00:00
|
|
|
if (ret < 0) {
|
|
|
|
goto err;
|
|
|
|
} else if (ret > 0) {
|
2021-07-29 08:22:16 +00:00
|
|
|
ret = -ENOENT;
|
|
|
|
goto err;
|
2015-05-18 09:16:30 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
dirid = key.offset;
|
|
|
|
|
|
|
|
inode_ref = btrfs_item_ptr(path->nodes[0],
|
|
|
|
path->slots[0],
|
|
|
|
struct btrfs_inode_ref);
|
|
|
|
len = btrfs_inode_ref_name_len(path->nodes[0],
|
|
|
|
inode_ref);
|
|
|
|
ptr -= len + 1;
|
|
|
|
if (ptr < name) {
|
|
|
|
ret = -ENAMETOOLONG;
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
read_extent_buffer(path->nodes[0], ptr + 1,
|
|
|
|
(unsigned long)(inode_ref + 1), len);
|
|
|
|
ptr[0] = '/';
|
|
|
|
btrfs_release_path(path);
|
|
|
|
}
|
2020-01-24 14:33:01 +00:00
|
|
|
btrfs_put_root(fs_root);
|
2020-02-06 15:24:26 +00:00
|
|
|
fs_root = NULL;
|
Btrfs: change how we mount subvolumes
This work is in preperation for being able to set a different root as the
default mounting root.
There is currently a problem with how we mount subvolumes. We cannot currently
mount a subvolume of a subvolume, you can only mount subvolumes/snapshots of the
default subvolume. So say you take a snapshot of the default subvolume and call
it snap1, and then take a snapshot of snap1 and call it snap2, so now you have
/
/snap1
/snap1/snap2
as your available volumes. Currently you can only mount / and /snap1,
you cannot mount /snap1/snap2. To fix this problem instead of passing
subvolid=<name> you must pass in subvolid=<treeid>, where <treeid> is
the tree id that gets spit out via the subvolume listing you get from
the subvolume listing patches (btrfs filesystem list). This allows us
to mount /, /snap1 and /snap1/snap2 as the root volume.
In addition to the above, we also now read the default dir item in the
tree root to get the root key that it points to. For now this just
points at what has always been the default subvolme, but later on I plan
to change it to point at whatever root you want to be the new default
root, so you can just set the default mount and not have to mount with
-o subvolid=<treeid>. I tested this out with the above scenario and it
worked perfectly. Thanks,
mount -o subvol operates inside the selected subvolid. For example:
mount -o subvol=snap1,subvolid=256 /dev/xxx /mnt
/mnt will have the snap1 directory for the subvolume with id
256.
mount -o subvol=snap /dev/xxx /mnt
/mnt will be the snap directory of whatever the default subvolume
is.
Signed-off-by: Josef Bacik <josef@redhat.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2009-12-04 17:38:27 +00:00
|
|
|
}
|
|
|
|
|
2015-05-18 09:16:30 +00:00
|
|
|
btrfs_free_path(path);
|
|
|
|
if (ptr == name + PATH_MAX - 1) {
|
|
|
|
name[0] = '/';
|
|
|
|
name[1] = '\0';
|
|
|
|
} else {
|
|
|
|
memmove(name, ptr, name + PATH_MAX - ptr);
|
|
|
|
}
|
|
|
|
return name;
|
|
|
|
|
|
|
|
err:
|
2020-01-24 14:33:01 +00:00
|
|
|
btrfs_put_root(fs_root);
|
2015-05-18 09:16:30 +00:00
|
|
|
btrfs_free_path(path);
|
|
|
|
kfree(name);
|
|
|
|
return ERR_PTR(ret);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int get_default_subvol_objectid(struct btrfs_fs_info *fs_info, u64 *objectid)
|
|
|
|
{
|
|
|
|
struct btrfs_root *root = fs_info->tree_root;
|
|
|
|
struct btrfs_dir_item *di;
|
|
|
|
struct btrfs_path *path;
|
|
|
|
struct btrfs_key location;
|
2022-10-20 16:58:27 +00:00
|
|
|
struct fscrypt_str name = FSTR_INIT("default", 7);
|
2015-05-18 09:16:30 +00:00
|
|
|
u64 dir_id;
|
|
|
|
|
Btrfs: change how we mount subvolumes
This work is in preperation for being able to set a different root as the
default mounting root.
There is currently a problem with how we mount subvolumes. We cannot currently
mount a subvolume of a subvolume, you can only mount subvolumes/snapshots of the
default subvolume. So say you take a snapshot of the default subvolume and call
it snap1, and then take a snapshot of snap1 and call it snap2, so now you have
/
/snap1
/snap1/snap2
as your available volumes. Currently you can only mount / and /snap1,
you cannot mount /snap1/snap2. To fix this problem instead of passing
subvolid=<name> you must pass in subvolid=<treeid>, where <treeid> is
the tree id that gets spit out via the subvolume listing you get from
the subvolume listing patches (btrfs filesystem list). This allows us
to mount /, /snap1 and /snap1/snap2 as the root volume.
In addition to the above, we also now read the default dir item in the
tree root to get the root key that it points to. For now this just
points at what has always been the default subvolme, but later on I plan
to change it to point at whatever root you want to be the new default
root, so you can just set the default mount and not have to mount with
-o subvolid=<treeid>. I tested this out with the above scenario and it
worked perfectly. Thanks,
mount -o subvol operates inside the selected subvolid. For example:
mount -o subvol=snap1,subvolid=256 /dev/xxx /mnt
/mnt will have the snap1 directory for the subvolume with id
256.
mount -o subvol=snap /dev/xxx /mnt
/mnt will be the snap directory of whatever the default subvolume
is.
Signed-off-by: Josef Bacik <josef@redhat.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2009-12-04 17:38:27 +00:00
|
|
|
path = btrfs_alloc_path();
|
|
|
|
if (!path)
|
2015-05-18 09:16:30 +00:00
|
|
|
return -ENOMEM;
|
Btrfs: change how we mount subvolumes
This work is in preperation for being able to set a different root as the
default mounting root.
There is currently a problem with how we mount subvolumes. We cannot currently
mount a subvolume of a subvolume, you can only mount subvolumes/snapshots of the
default subvolume. So say you take a snapshot of the default subvolume and call
it snap1, and then take a snapshot of snap1 and call it snap2, so now you have
/
/snap1
/snap1/snap2
as your available volumes. Currently you can only mount / and /snap1,
you cannot mount /snap1/snap2. To fix this problem instead of passing
subvolid=<name> you must pass in subvolid=<treeid>, where <treeid> is
the tree id that gets spit out via the subvolume listing you get from
the subvolume listing patches (btrfs filesystem list). This allows us
to mount /, /snap1 and /snap1/snap2 as the root volume.
In addition to the above, we also now read the default dir item in the
tree root to get the root key that it points to. For now this just
points at what has always been the default subvolme, but later on I plan
to change it to point at whatever root you want to be the new default
root, so you can just set the default mount and not have to mount with
-o subvolid=<treeid>. I tested this out with the above scenario and it
worked perfectly. Thanks,
mount -o subvol operates inside the selected subvolid. For example:
mount -o subvol=snap1,subvolid=256 /dev/xxx /mnt
/mnt will have the snap1 directory for the subvolume with id
256.
mount -o subvol=snap /dev/xxx /mnt
/mnt will be the snap directory of whatever the default subvolume
is.
Signed-off-by: Josef Bacik <josef@redhat.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2009-12-04 17:38:27 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Find the "default" dir item which points to the root item that we
|
|
|
|
* will mount by default if we haven't been given a specific subvolume
|
|
|
|
* to mount.
|
|
|
|
*/
|
2011-11-17 20:40:49 +00:00
|
|
|
dir_id = btrfs_super_root_dir(fs_info->super_copy);
|
2022-10-20 16:58:25 +00:00
|
|
|
di = btrfs_lookup_dir_item(NULL, root, path, dir_id, &name, 0);
|
2011-05-14 07:10:51 +00:00
|
|
|
if (IS_ERR(di)) {
|
|
|
|
btrfs_free_path(path);
|
2015-05-18 09:16:30 +00:00
|
|
|
return PTR_ERR(di);
|
2011-05-14 07:10:51 +00:00
|
|
|
}
|
Btrfs: change how we mount subvolumes
This work is in preperation for being able to set a different root as the
default mounting root.
There is currently a problem with how we mount subvolumes. We cannot currently
mount a subvolume of a subvolume, you can only mount subvolumes/snapshots of the
default subvolume. So say you take a snapshot of the default subvolume and call
it snap1, and then take a snapshot of snap1 and call it snap2, so now you have
/
/snap1
/snap1/snap2
as your available volumes. Currently you can only mount / and /snap1,
you cannot mount /snap1/snap2. To fix this problem instead of passing
subvolid=<name> you must pass in subvolid=<treeid>, where <treeid> is
the tree id that gets spit out via the subvolume listing you get from
the subvolume listing patches (btrfs filesystem list). This allows us
to mount /, /snap1 and /snap1/snap2 as the root volume.
In addition to the above, we also now read the default dir item in the
tree root to get the root key that it points to. For now this just
points at what has always been the default subvolme, but later on I plan
to change it to point at whatever root you want to be the new default
root, so you can just set the default mount and not have to mount with
-o subvolid=<treeid>. I tested this out with the above scenario and it
worked perfectly. Thanks,
mount -o subvol operates inside the selected subvolid. For example:
mount -o subvol=snap1,subvolid=256 /dev/xxx /mnt
/mnt will have the snap1 directory for the subvolume with id
256.
mount -o subvol=snap /dev/xxx /mnt
/mnt will be the snap directory of whatever the default subvolume
is.
Signed-off-by: Josef Bacik <josef@redhat.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2009-12-04 17:38:27 +00:00
|
|
|
if (!di) {
|
|
|
|
/*
|
|
|
|
* Ok the default dir item isn't there. This is weird since
|
|
|
|
* it's always been there, but don't freak out, just try and
|
2015-05-18 09:16:30 +00:00
|
|
|
* mount the top-level subvolume.
|
Btrfs: change how we mount subvolumes
This work is in preperation for being able to set a different root as the
default mounting root.
There is currently a problem with how we mount subvolumes. We cannot currently
mount a subvolume of a subvolume, you can only mount subvolumes/snapshots of the
default subvolume. So say you take a snapshot of the default subvolume and call
it snap1, and then take a snapshot of snap1 and call it snap2, so now you have
/
/snap1
/snap1/snap2
as your available volumes. Currently you can only mount / and /snap1,
you cannot mount /snap1/snap2. To fix this problem instead of passing
subvolid=<name> you must pass in subvolid=<treeid>, where <treeid> is
the tree id that gets spit out via the subvolume listing you get from
the subvolume listing patches (btrfs filesystem list). This allows us
to mount /, /snap1 and /snap1/snap2 as the root volume.
In addition to the above, we also now read the default dir item in the
tree root to get the root key that it points to. For now this just
points at what has always been the default subvolme, but later on I plan
to change it to point at whatever root you want to be the new default
root, so you can just set the default mount and not have to mount with
-o subvolid=<treeid>. I tested this out with the above scenario and it
worked perfectly. Thanks,
mount -o subvol operates inside the selected subvolid. For example:
mount -o subvol=snap1,subvolid=256 /dev/xxx /mnt
/mnt will have the snap1 directory for the subvolume with id
256.
mount -o subvol=snap /dev/xxx /mnt
/mnt will be the snap directory of whatever the default subvolume
is.
Signed-off-by: Josef Bacik <josef@redhat.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2009-12-04 17:38:27 +00:00
|
|
|
*/
|
|
|
|
btrfs_free_path(path);
|
2015-05-18 09:16:30 +00:00
|
|
|
*objectid = BTRFS_FS_TREE_OBJECTID;
|
|
|
|
return 0;
|
Btrfs: change how we mount subvolumes
This work is in preperation for being able to set a different root as the
default mounting root.
There is currently a problem with how we mount subvolumes. We cannot currently
mount a subvolume of a subvolume, you can only mount subvolumes/snapshots of the
default subvolume. So say you take a snapshot of the default subvolume and call
it snap1, and then take a snapshot of snap1 and call it snap2, so now you have
/
/snap1
/snap1/snap2
as your available volumes. Currently you can only mount / and /snap1,
you cannot mount /snap1/snap2. To fix this problem instead of passing
subvolid=<name> you must pass in subvolid=<treeid>, where <treeid> is
the tree id that gets spit out via the subvolume listing you get from
the subvolume listing patches (btrfs filesystem list). This allows us
to mount /, /snap1 and /snap1/snap2 as the root volume.
In addition to the above, we also now read the default dir item in the
tree root to get the root key that it points to. For now this just
points at what has always been the default subvolme, but later on I plan
to change it to point at whatever root you want to be the new default
root, so you can just set the default mount and not have to mount with
-o subvolid=<treeid>. I tested this out with the above scenario and it
worked perfectly. Thanks,
mount -o subvol operates inside the selected subvolid. For example:
mount -o subvol=snap1,subvolid=256 /dev/xxx /mnt
/mnt will have the snap1 directory for the subvolume with id
256.
mount -o subvol=snap /dev/xxx /mnt
/mnt will be the snap directory of whatever the default subvolume
is.
Signed-off-by: Josef Bacik <josef@redhat.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2009-12-04 17:38:27 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
btrfs_dir_item_key_to_cpu(path->nodes[0], di, &location);
|
|
|
|
btrfs_free_path(path);
|
2015-05-18 09:16:30 +00:00
|
|
|
*objectid = location.objectid;
|
|
|
|
return 0;
|
Btrfs: change how we mount subvolumes
This work is in preperation for being able to set a different root as the
default mounting root.
There is currently a problem with how we mount subvolumes. We cannot currently
mount a subvolume of a subvolume, you can only mount subvolumes/snapshots of the
default subvolume. So say you take a snapshot of the default subvolume and call
it snap1, and then take a snapshot of snap1 and call it snap2, so now you have
/
/snap1
/snap1/snap2
as your available volumes. Currently you can only mount / and /snap1,
you cannot mount /snap1/snap2. To fix this problem instead of passing
subvolid=<name> you must pass in subvolid=<treeid>, where <treeid> is
the tree id that gets spit out via the subvolume listing you get from
the subvolume listing patches (btrfs filesystem list). This allows us
to mount /, /snap1 and /snap1/snap2 as the root volume.
In addition to the above, we also now read the default dir item in the
tree root to get the root key that it points to. For now this just
points at what has always been the default subvolme, but later on I plan
to change it to point at whatever root you want to be the new default
root, so you can just set the default mount and not have to mount with
-o subvolid=<treeid>. I tested this out with the above scenario and it
worked perfectly. Thanks,
mount -o subvol operates inside the selected subvolid. For example:
mount -o subvol=snap1,subvolid=256 /dev/xxx /mnt
/mnt will have the snap1 directory for the subvolume with id
256.
mount -o subvol=snap /dev/xxx /mnt
/mnt will be the snap directory of whatever the default subvolume
is.
Signed-off-by: Josef Bacik <josef@redhat.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2009-12-04 17:38:27 +00:00
|
|
|
}
|
|
|
|
|
2009-01-06 02:25:51 +00:00
|
|
|
static int btrfs_fill_super(struct super_block *sb,
|
2008-03-24 19:02:07 +00:00
|
|
|
struct btrfs_fs_devices *fs_devices,
|
2017-02-10 18:44:31 +00:00
|
|
|
void *data)
|
2007-03-29 15:56:46 +00:00
|
|
|
{
|
2009-01-06 02:25:51 +00:00
|
|
|
struct inode *inode;
|
2011-11-17 20:40:49 +00:00
|
|
|
struct btrfs_fs_info *fs_info = btrfs_sb(sb);
|
2007-06-12 10:35:45 +00:00
|
|
|
int err;
|
2007-04-18 20:15:28 +00:00
|
|
|
|
2007-06-12 10:35:45 +00:00
|
|
|
sb->s_maxbytes = MAX_LFS_FILESIZE;
|
|
|
|
sb->s_magic = BTRFS_SUPER_MAGIC;
|
|
|
|
sb->s_op = &btrfs_super_ops;
|
2010-12-20 15:56:06 +00:00
|
|
|
sb->s_d_op = &btrfs_dentry_operations;
|
2008-07-20 20:31:56 +00:00
|
|
|
sb->s_export_op = &btrfs_export_ops;
|
2021-06-30 20:01:49 +00:00
|
|
|
#ifdef CONFIG_FS_VERITY
|
|
|
|
sb->s_vop = &btrfs_verityops;
|
|
|
|
#endif
|
2007-11-16 16:45:54 +00:00
|
|
|
sb->s_xattr = btrfs_xattr_handlers;
|
2007-06-12 10:35:45 +00:00
|
|
|
sb->s_time_gran = 1;
|
2015-07-02 20:57:22 +00:00
|
|
|
sb->s_iflags |= SB_I_CGROUPWB;
|
2017-04-12 10:24:32 +00:00
|
|
|
|
|
|
|
err = super_setup_bdi(sb);
|
|
|
|
if (err) {
|
|
|
|
btrfs_err(fs_info, "super_setup_bdi failed");
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
2011-11-17 06:10:02 +00:00
|
|
|
err = open_ctree(sb, fs_devices, (char *)data);
|
|
|
|
if (err) {
|
2016-09-20 14:05:02 +00:00
|
|
|
btrfs_err(fs_info, "open_ctree failed");
|
2011-11-17 06:10:02 +00:00
|
|
|
return err;
|
2007-04-18 20:15:28 +00:00
|
|
|
}
|
|
|
|
|
2024-06-13 10:36:26 +00:00
|
|
|
inode = btrfs_iget(BTRFS_FIRST_FREE_OBJECTID, fs_info->fs_root);
|
Btrfs: Mixed back reference (FORWARD ROLLING FORMAT CHANGE)
This commit introduces a new kind of back reference for btrfs metadata.
Once a filesystem has been mounted with this commit, IT WILL NO LONGER
BE MOUNTABLE BY OLDER KERNELS.
When a tree block in subvolume tree is cow'd, the reference counts of all
extents it points to are increased by one. At transaction commit time,
the old root of the subvolume is recorded in a "dead root" data structure,
and the btree it points to is later walked, dropping reference counts
and freeing any blocks where the reference count goes to 0.
The increments done during cow and decrements done after commit cancel out,
and the walk is a very expensive way to go about freeing the blocks that
are no longer referenced by the new btree root. This commit reduces the
transaction overhead by avoiding the need for dead root records.
When a non-shared tree block is cow'd, we free the old block at once, and the
new block inherits old block's references. When a tree block with reference
count > 1 is cow'd, we increase the reference counts of all extents
the new block points to by one, and decrease the old block's reference count by
one.
This dead tree avoidance code removes the need to modify the reference
counts of lower level extents when a non-shared tree block is cow'd.
But we still need to update back ref for all pointers in the block.
This is because the location of the block is recorded in the back ref
item.
We can solve this by introducing a new type of back ref. The new
back ref provides information about pointer's key, level and in which
tree the pointer lives. This information allow us to find the pointer
by searching the tree. The shortcoming of the new back ref is that it
only works for pointers in tree blocks referenced by their owner trees.
This is mostly a problem for snapshots, where resolving one of these
fuzzy back references would be O(number_of_snapshots) and quite slow.
The solution used here is to use the fuzzy back references in the common
case where a given tree block is only referenced by one root,
and use the full back references when multiple roots have a reference
on a given block.
This commit adds per subvolume red-black tree to keep trace of cached
inodes. The red-black tree helps the balancing code to find cached
inodes whose inode numbers within a given range.
This commit improves the balancing code by introducing several data
structures to keep the state of balancing. The most important one
is the back ref cache. It caches how the upper level tree blocks are
referenced. This greatly reduce the overhead of checking back ref.
The improved balancing code scales significantly better with a large
number of snapshots.
This is a very large commit and was written in a number of
pieces. But, they depend heavily on the disk format change and were
squashed together to make sure git bisect didn't end up in a
bad state wrt space balancing or the format change.
Signed-off-by: Yan Zheng <zheng.yan@oracle.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2009-06-10 14:45:14 +00:00
|
|
|
if (IS_ERR(inode)) {
|
|
|
|
err = PTR_ERR(inode);
|
2023-02-07 16:57:19 +00:00
|
|
|
btrfs_handle_fs_error(fs_info, err, NULL);
|
2007-06-12 10:35:45 +00:00
|
|
|
goto fail_close;
|
2007-03-29 19:15:27 +00:00
|
|
|
}
|
|
|
|
|
2012-01-09 03:15:13 +00:00
|
|
|
sb->s_root = d_make_root(inode);
|
|
|
|
if (!sb->s_root) {
|
2007-06-12 10:35:45 +00:00
|
|
|
err = -ENOMEM;
|
|
|
|
goto fail_close;
|
2007-03-29 19:15:27 +00:00
|
|
|
}
|
2007-08-29 19:47:34 +00:00
|
|
|
|
2017-11-27 21:05:09 +00:00
|
|
|
sb->s_flags |= SB_ACTIVE;
|
2007-04-10 20:58:11 +00:00
|
|
|
return 0;
|
2007-06-12 10:35:45 +00:00
|
|
|
|
|
|
|
fail_close:
|
2016-06-22 01:16:51 +00:00
|
|
|
close_ctree(fs_info);
|
2007-06-12 10:35:45 +00:00
|
|
|
return err;
|
2007-04-10 20:58:11 +00:00
|
|
|
}
|
|
|
|
|
2008-06-10 14:07:39 +00:00
|
|
|
int btrfs_sync_fs(struct super_block *sb, int wait)
|
2007-04-10 13:27:04 +00:00
|
|
|
{
|
|
|
|
struct btrfs_trans_handle *trans;
|
2011-11-17 20:40:49 +00:00
|
|
|
struct btrfs_fs_info *fs_info = btrfs_sb(sb);
|
|
|
|
struct btrfs_root *root = fs_info->tree_root;
|
2007-04-10 20:58:11 +00:00
|
|
|
|
2016-06-09 21:27:55 +00:00
|
|
|
trace_btrfs_sync_fs(fs_info, wait);
|
Btrfs: add initial tracepoint support for btrfs
Tracepoints can provide insight into why btrfs hits bugs and be greatly
helpful for debugging, e.g
dd-7822 [000] 2121.641088: btrfs_inode_request: root = 5(FS_TREE), gen = 4, ino = 256, blocks = 8, disk_i_size = 0, last_trans = 8, logged_trans = 0
dd-7822 [000] 2121.641100: btrfs_inode_new: root = 5(FS_TREE), gen = 8, ino = 257, blocks = 0, disk_i_size = 0, last_trans = 0, logged_trans = 0
btrfs-transacti-7804 [001] 2146.935420: btrfs_cow_block: root = 2(EXTENT_TREE), refs = 2, orig_buf = 29368320 (orig_level = 0), cow_buf = 29388800 (cow_level = 0)
btrfs-transacti-7804 [001] 2146.935473: btrfs_cow_block: root = 1(ROOT_TREE), refs = 2, orig_buf = 29364224 (orig_level = 0), cow_buf = 29392896 (cow_level = 0)
btrfs-transacti-7804 [001] 2146.972221: btrfs_transaction_commit: root = 1(ROOT_TREE), gen = 8
flush-btrfs-2-7821 [001] 2155.824210: btrfs_chunk_alloc: root = 3(CHUNK_TREE), offset = 1103101952, size = 1073741824, num_stripes = 1, sub_stripes = 0, type = DATA
flush-btrfs-2-7821 [001] 2155.824241: btrfs_cow_block: root = 2(EXTENT_TREE), refs = 2, orig_buf = 29388800 (orig_level = 0), cow_buf = 29396992 (cow_level = 0)
flush-btrfs-2-7821 [001] 2155.824255: btrfs_cow_block: root = 4(DEV_TREE), refs = 2, orig_buf = 29372416 (orig_level = 0), cow_buf = 29401088 (cow_level = 0)
flush-btrfs-2-7821 [000] 2155.824329: btrfs_cow_block: root = 3(CHUNK_TREE), refs = 2, orig_buf = 20971520 (orig_level = 0), cow_buf = 20975616 (cow_level = 0)
btrfs-endio-wri-7800 [001] 2155.898019: btrfs_cow_block: root = 5(FS_TREE), refs = 2, orig_buf = 29384704 (orig_level = 0), cow_buf = 29405184 (cow_level = 0)
btrfs-endio-wri-7800 [001] 2155.898043: btrfs_cow_block: root = 7(CSUM_TREE), refs = 2, orig_buf = 29376512 (orig_level = 0), cow_buf = 29409280 (cow_level = 0)
Here is what I have added:
1) ordere_extent:
btrfs_ordered_extent_add
btrfs_ordered_extent_remove
btrfs_ordered_extent_start
btrfs_ordered_extent_put
These provide critical information to understand how ordered_extents are
updated.
2) extent_map:
btrfs_get_extent
extent_map is used in both read and write cases, and it is useful for tracking
how btrfs specific IO is running.
3) writepage:
__extent_writepage
btrfs_writepage_end_io_hook
Pages are cirtical resourses and produce a lot of corner cases during writeback,
so it is valuable to know how page is written to disk.
4) inode:
btrfs_inode_new
btrfs_inode_request
btrfs_inode_evict
These can show where and when a inode is created, when a inode is evicted.
5) sync:
btrfs_sync_file
btrfs_sync_fs
These show sync arguments.
6) transaction:
btrfs_transaction_commit
In transaction based filesystem, it will be useful to know the generation and
who does commit.
7) back reference and cow:
btrfs_delayed_tree_ref
btrfs_delayed_data_ref
btrfs_delayed_ref_head
btrfs_cow_block
Btrfs natively supports back references, these tracepoints are helpful on
understanding btrfs's COW mechanism.
8) chunk:
btrfs_chunk_alloc
btrfs_chunk_free
Chunk is a link between physical offset and logical offset, and stands for space
infomation in btrfs, and these are helpful on tracing space things.
9) reserved_extent:
btrfs_reserved_extent_alloc
btrfs_reserved_extent_free
These can show how btrfs uses its space.
Signed-off-by: Liu Bo <liubo2009@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-03-24 11:18:59 +00:00
|
|
|
|
2007-06-12 10:35:45 +00:00
|
|
|
if (!wait) {
|
2011-11-17 20:40:49 +00:00
|
|
|
filemap_flush(fs_info->btree_inode->i_mapping);
|
2007-06-12 10:35:45 +00:00
|
|
|
return 0;
|
|
|
|
}
|
2008-11-07 03:02:51 +00:00
|
|
|
|
2024-05-14 14:48:12 +00:00
|
|
|
btrfs_wait_ordered_roots(fs_info, U64_MAX, NULL);
|
2008-11-07 03:02:51 +00:00
|
|
|
|
Btrfs: fix uncompleted transaction
In some cases, we need commit the current transaction, but don't want
to start a new one if there is no running transaction, so we introduce
the function - btrfs_attach_transaction(), which can catch the current
transaction, and return -ENOENT if there is no running transaction.
But no running transaction doesn't mean the current transction completely,
because we removed the running transaction before it completes. In some
cases, it doesn't matter. But in some special cases, such as freeze fs, we
hope the transaction is fully on disk, it will introduce some bugs, for
example, we may feeze the fs and dump the data in the disk, if the transction
doesn't complete, we would dump inconsistent data. So we need fix the above
problem for those cases.
We fixes this problem by introducing a function:
btrfs_attach_transaction_barrier()
if we hope all the transaction is fully on the disk, even they are not
running, we can use this function.
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Josef Bacik <jbacik@fusionio.com>
2013-02-20 09:17:06 +00:00
|
|
|
trans = btrfs_attach_transaction_barrier(root);
|
2012-09-14 14:34:40 +00:00
|
|
|
if (IS_ERR(trans)) {
|
Btrfs: fix orphan transaction on the freezed filesystem
With the following debug patch:
static int btrfs_freeze(struct super_block *sb)
{
+ struct btrfs_fs_info *fs_info = btrfs_sb(sb);
+ struct btrfs_transaction *trans;
+
+ spin_lock(&fs_info->trans_lock);
+ trans = fs_info->running_transaction;
+ if (trans) {
+ printk("Transid %llu, use_count %d, num_writer %d\n",
+ trans->transid, atomic_read(&trans->use_count),
+ atomic_read(&trans->num_writers));
+ }
+ spin_unlock(&fs_info->trans_lock);
return 0;
}
I found there was a orphan transaction after the freeze operation was done.
It is because the transaction may not be committed when the transaction handle
end even though it is the last handle of the current transaction. This design
avoid committing the transaction frequently, but also introduce the above
problem.
So I add btrfs_attach_transaction() which can catch the current transaction
and commit it. If there is no transaction, it will return ENOENT, and do not
anything.
This function also can be used to instead of btrfs_join_transaction_freeze()
because it don't increase the writer counter and don't start a new transaction,
so it also can fix the deadlock between sync and freeze.
Besides that, it is used to instead of btrfs_join_transaction() in
transaction_kthread(), because if there is no transaction, the transaction
kthread needn't anything.
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
2012-09-20 07:54:00 +00:00
|
|
|
/* no transaction, don't bother */
|
2014-03-28 16:38:48 +00:00
|
|
|
if (PTR_ERR(trans) == -ENOENT) {
|
|
|
|
/*
|
|
|
|
* Exit unless we have some pending changes
|
|
|
|
* that need to go through commit
|
|
|
|
*/
|
2022-10-19 14:50:55 +00:00
|
|
|
if (!test_bit(BTRFS_FS_NEED_TRANS_COMMIT,
|
|
|
|
&fs_info->flags))
|
2014-03-28 16:38:48 +00:00
|
|
|
return 0;
|
2015-01-19 07:42:41 +00:00
|
|
|
/*
|
|
|
|
* A non-blocking test if the fs is frozen. We must not
|
|
|
|
* start a new transaction here otherwise a deadlock
|
|
|
|
* happens. The pending operations are delayed to the
|
|
|
|
* next commit after thawing.
|
|
|
|
*/
|
2017-10-10 10:48:05 +00:00
|
|
|
if (sb_start_write_trylock(sb))
|
|
|
|
sb_end_write(sb);
|
2015-01-19 07:42:41 +00:00
|
|
|
else
|
|
|
|
return 0;
|
2014-03-28 16:38:48 +00:00
|
|
|
trans = btrfs_start_transaction(root, 0);
|
|
|
|
}
|
2015-01-19 13:21:02 +00:00
|
|
|
if (IS_ERR(trans))
|
|
|
|
return PTR_ERR(trans);
|
2012-09-14 14:34:40 +00:00
|
|
|
}
|
2016-09-10 01:39:03 +00:00
|
|
|
return btrfs_commit_transaction(trans);
|
2007-04-02 14:50:19 +00:00
|
|
|
}
|
|
|
|
|
2020-10-16 15:29:16 +00:00
|
|
|
static void print_rescue_option(struct seq_file *seq, const char *s, bool *printed)
|
|
|
|
{
|
|
|
|
seq_printf(seq, "%s%s", (*printed) ? ":" : ",rescue=", s);
|
|
|
|
*printed = true;
|
|
|
|
}
|
|
|
|
|
2011-12-09 02:32:45 +00:00
|
|
|
static int btrfs_show_options(struct seq_file *seq, struct dentry *dentry)
|
2009-04-02 20:46:06 +00:00
|
|
|
{
|
2011-11-17 20:40:49 +00:00
|
|
|
struct btrfs_fs_info *info = btrfs_sb(dentry->d_sb);
|
2017-10-31 17:06:34 +00:00
|
|
|
const char *compress_type;
|
btrfs: don't show full path of bind mounts in subvol=
Chris Murphy reported a problem where rpm ostree will bind mount a bunch
of things for whatever voodoo it's doing. But when it does this
/proc/mounts shows something like
/dev/sda /mnt/test btrfs rw,relatime,subvolid=256,subvol=/foo 0 0
/dev/sda /mnt/test/baz btrfs rw,relatime,subvolid=256,subvol=/foo/bar 0 0
Despite subvolid=256 being subvol=/foo. This is because we're just
spitting out the dentry of the mount point, which in the case of bind
mounts is the source path for the mountpoint. Instead we should spit
out the path to the actual subvol. Fix this by looking up the name for
the subvolid we have mounted. With this fix the same test looks like
this
/dev/sda /mnt/test btrfs rw,relatime,subvolid=256,subvol=/foo 0 0
/dev/sda /mnt/test/baz btrfs rw,relatime,subvolid=256,subvol=/foo 0 0
Reported-by: Chris Murphy <chris@colorremedies.com>
CC: stable@vger.kernel.org # 4.4+
Signed-off-by: Josef Bacik <josef@toxicpanda.com>
Reviewed-by: David Sterba <dsterba@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2020-07-22 15:12:46 +00:00
|
|
|
const char *subvol_name;
|
2020-10-16 15:29:16 +00:00
|
|
|
bool printed = false;
|
2009-04-02 20:46:06 +00:00
|
|
|
|
2016-06-10 01:38:35 +00:00
|
|
|
if (btrfs_test_opt(info, DEGRADED))
|
2009-04-02 20:46:06 +00:00
|
|
|
seq_puts(seq, ",degraded");
|
2016-06-10 01:38:35 +00:00
|
|
|
if (btrfs_test_opt(info, NODATASUM))
|
2009-04-02 20:46:06 +00:00
|
|
|
seq_puts(seq, ",nodatasum");
|
2016-06-10 01:38:35 +00:00
|
|
|
if (btrfs_test_opt(info, NODATACOW))
|
2009-04-02 20:46:06 +00:00
|
|
|
seq_puts(seq, ",nodatacow");
|
2016-06-10 01:38:35 +00:00
|
|
|
if (btrfs_test_opt(info, NOBARRIER))
|
2009-04-02 20:46:06 +00:00
|
|
|
seq_puts(seq, ",nobarrier");
|
2013-08-08 21:45:48 +00:00
|
|
|
if (info->max_inline != BTRFS_DEFAULT_MAX_INLINE)
|
2013-08-20 11:20:07 +00:00
|
|
|
seq_printf(seq, ",max_inline=%llu", info->max_inline);
|
2009-04-02 20:46:06 +00:00
|
|
|
if (info->thread_pool_size != min_t(unsigned long,
|
|
|
|
num_online_cpus() + 2, 8))
|
2018-02-13 09:50:42 +00:00
|
|
|
seq_printf(seq, ",thread_pool=%u", info->thread_pool_size);
|
2016-06-10 01:38:35 +00:00
|
|
|
if (btrfs_test_opt(info, COMPRESS)) {
|
2017-10-31 17:06:34 +00:00
|
|
|
compress_type = btrfs_compress_type2str(info->compress_type);
|
2016-06-10 01:38:35 +00:00
|
|
|
if (btrfs_test_opt(info, FORCE_COMPRESS))
|
2011-03-31 00:44:29 +00:00
|
|
|
seq_printf(seq, ",compress-force=%s", compress_type);
|
|
|
|
else
|
|
|
|
seq_printf(seq, ",compress=%s", compress_type);
|
2017-09-15 15:36:57 +00:00
|
|
|
if (info->compress_level)
|
2017-09-15 15:36:58 +00:00
|
|
|
seq_printf(seq, ":%d", info->compress_level);
|
2011-03-31 00:44:29 +00:00
|
|
|
}
|
2016-06-10 01:38:35 +00:00
|
|
|
if (btrfs_test_opt(info, NOSSD))
|
2009-06-10 13:51:32 +00:00
|
|
|
seq_puts(seq, ",nossd");
|
2016-06-10 01:38:35 +00:00
|
|
|
if (btrfs_test_opt(info, SSD_SPREAD))
|
2009-06-10 00:28:34 +00:00
|
|
|
seq_puts(seq, ",ssd_spread");
|
2016-06-10 01:38:35 +00:00
|
|
|
else if (btrfs_test_opt(info, SSD))
|
2009-04-02 20:46:06 +00:00
|
|
|
seq_puts(seq, ",ssd");
|
2016-06-10 01:38:35 +00:00
|
|
|
if (btrfs_test_opt(info, NOTREELOG))
|
2009-05-14 17:52:21 +00:00
|
|
|
seq_puts(seq, ",notreelog");
|
2016-06-10 01:38:35 +00:00
|
|
|
if (btrfs_test_opt(info, NOLOGREPLAY))
|
2020-10-16 15:29:16 +00:00
|
|
|
print_rescue_option(seq, "nologreplay", &printed);
|
2020-10-16 15:29:17 +00:00
|
|
|
if (btrfs_test_opt(info, USEBACKUPROOT))
|
|
|
|
print_rescue_option(seq, "usebackuproot", &printed);
|
2020-10-16 15:29:18 +00:00
|
|
|
if (btrfs_test_opt(info, IGNOREBADROOTS))
|
|
|
|
print_rescue_option(seq, "ignorebadroots", &printed);
|
2020-10-16 15:29:19 +00:00
|
|
|
if (btrfs_test_opt(info, IGNOREDATACSUMS))
|
|
|
|
print_rescue_option(seq, "ignoredatacsums", &printed);
|
2024-06-14 04:22:30 +00:00
|
|
|
if (btrfs_test_opt(info, IGNOREMETACSUMS))
|
|
|
|
print_rescue_option(seq, "ignoremetacsums", &printed);
|
2024-06-14 04:22:31 +00:00
|
|
|
if (btrfs_test_opt(info, IGNORESUPERFLAGS))
|
|
|
|
print_rescue_option(seq, "ignoresuperflags", &printed);
|
2016-06-10 01:38:35 +00:00
|
|
|
if (btrfs_test_opt(info, FLUSHONCOMMIT))
|
2009-05-14 17:52:21 +00:00
|
|
|
seq_puts(seq, ",flushoncommit");
|
2019-12-14 00:22:11 +00:00
|
|
|
if (btrfs_test_opt(info, DISCARD_SYNC))
|
2009-12-14 22:01:12 +00:00
|
|
|
seq_puts(seq, ",discard");
|
2019-12-14 00:22:14 +00:00
|
|
|
if (btrfs_test_opt(info, DISCARD_ASYNC))
|
|
|
|
seq_puts(seq, ",discard=async");
|
2017-11-27 21:05:09 +00:00
|
|
|
if (!(info->sb->s_flags & SB_POSIXACL))
|
2009-04-02 20:46:06 +00:00
|
|
|
seq_puts(seq, ",noacl");
|
2020-11-18 23:06:23 +00:00
|
|
|
if (btrfs_free_space_cache_v1_active(info))
|
2011-03-31 00:44:29 +00:00
|
|
|
seq_puts(seq, ",space_cache");
|
2020-11-18 23:06:23 +00:00
|
|
|
else if (btrfs_fs_compat_ro(info, FREE_SPACE_TREE))
|
2015-09-30 03:50:38 +00:00
|
|
|
seq_puts(seq, ",space_cache=v2");
|
2011-10-03 18:07:49 +00:00
|
|
|
else
|
2011-11-11 15:14:57 +00:00
|
|
|
seq_puts(seq, ",nospace_cache");
|
2016-06-10 01:38:35 +00:00
|
|
|
if (btrfs_test_opt(info, RESCAN_UUID_TREE))
|
2013-08-15 15:11:24 +00:00
|
|
|
seq_puts(seq, ",rescan_uuid_tree");
|
2016-06-10 01:38:35 +00:00
|
|
|
if (btrfs_test_opt(info, CLEAR_CACHE))
|
2011-03-31 00:44:29 +00:00
|
|
|
seq_puts(seq, ",clear_cache");
|
2016-06-10 01:38:35 +00:00
|
|
|
if (btrfs_test_opt(info, USER_SUBVOL_RM_ALLOWED))
|
2011-03-31 00:44:29 +00:00
|
|
|
seq_puts(seq, ",user_subvol_rm_allowed");
|
2016-06-10 01:38:35 +00:00
|
|
|
if (btrfs_test_opt(info, ENOSPC_DEBUG))
|
2011-06-28 15:10:37 +00:00
|
|
|
seq_puts(seq, ",enospc_debug");
|
2016-06-10 01:38:35 +00:00
|
|
|
if (btrfs_test_opt(info, AUTO_DEFRAG))
|
2011-06-28 15:10:37 +00:00
|
|
|
seq_puts(seq, ",autodefrag");
|
2016-06-10 01:38:35 +00:00
|
|
|
if (btrfs_test_opt(info, SKIP_BALANCE))
|
2012-01-16 20:04:48 +00:00
|
|
|
seq_puts(seq, ",skip_balance");
|
2013-07-24 02:30:02 +00:00
|
|
|
if (info->metadata_ratio)
|
2018-02-13 09:50:44 +00:00
|
|
|
seq_printf(seq, ",metadata_ratio=%u", info->metadata_ratio);
|
2016-06-10 01:38:35 +00:00
|
|
|
if (btrfs_test_opt(info, PANIC_ON_FATAL_ERROR))
|
2011-10-04 03:22:31 +00:00
|
|
|
seq_puts(seq, ",fatal_errors=panic");
|
2013-08-01 16:14:52 +00:00
|
|
|
if (info->commit_interval != BTRFS_DEFAULT_COMMIT_INTERVAL)
|
2018-02-13 09:50:46 +00:00
|
|
|
seq_printf(seq, ",commit=%u", info->commit_interval);
|
2015-09-23 18:54:14 +00:00
|
|
|
#ifdef CONFIG_BTRFS_DEBUG
|
2016-06-10 01:38:35 +00:00
|
|
|
if (btrfs_test_opt(info, FRAGMENT_DATA))
|
2015-09-23 18:54:14 +00:00
|
|
|
seq_puts(seq, ",fragment=data");
|
2016-06-10 01:38:35 +00:00
|
|
|
if (btrfs_test_opt(info, FRAGMENT_METADATA))
|
2015-09-23 18:54:14 +00:00
|
|
|
seq_puts(seq, ",fragment=metadata");
|
|
|
|
#endif
|
2017-09-29 19:43:48 +00:00
|
|
|
if (btrfs_test_opt(info, REF_VERIFY))
|
|
|
|
seq_puts(seq, ",ref_verify");
|
2024-04-15 20:16:23 +00:00
|
|
|
seq_printf(seq, ",subvolid=%llu", btrfs_root_id(BTRFS_I(d_inode(dentry))->root));
|
btrfs: don't show full path of bind mounts in subvol=
Chris Murphy reported a problem where rpm ostree will bind mount a bunch
of things for whatever voodoo it's doing. But when it does this
/proc/mounts shows something like
/dev/sda /mnt/test btrfs rw,relatime,subvolid=256,subvol=/foo 0 0
/dev/sda /mnt/test/baz btrfs rw,relatime,subvolid=256,subvol=/foo/bar 0 0
Despite subvolid=256 being subvol=/foo. This is because we're just
spitting out the dentry of the mount point, which in the case of bind
mounts is the source path for the mountpoint. Instead we should spit
out the path to the actual subvol. Fix this by looking up the name for
the subvolid we have mounted. With this fix the same test looks like
this
/dev/sda /mnt/test btrfs rw,relatime,subvolid=256,subvol=/foo 0 0
/dev/sda /mnt/test/baz btrfs rw,relatime,subvolid=256,subvol=/foo 0 0
Reported-by: Chris Murphy <chris@colorremedies.com>
CC: stable@vger.kernel.org # 4.4+
Signed-off-by: Josef Bacik <josef@toxicpanda.com>
Reviewed-by: David Sterba <dsterba@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2020-07-22 15:12:46 +00:00
|
|
|
subvol_name = btrfs_get_subvol_name_from_objectid(info,
|
2024-04-15 20:16:23 +00:00
|
|
|
btrfs_root_id(BTRFS_I(d_inode(dentry))->root));
|
btrfs: don't show full path of bind mounts in subvol=
Chris Murphy reported a problem where rpm ostree will bind mount a bunch
of things for whatever voodoo it's doing. But when it does this
/proc/mounts shows something like
/dev/sda /mnt/test btrfs rw,relatime,subvolid=256,subvol=/foo 0 0
/dev/sda /mnt/test/baz btrfs rw,relatime,subvolid=256,subvol=/foo/bar 0 0
Despite subvolid=256 being subvol=/foo. This is because we're just
spitting out the dentry of the mount point, which in the case of bind
mounts is the source path for the mountpoint. Instead we should spit
out the path to the actual subvol. Fix this by looking up the name for
the subvolid we have mounted. With this fix the same test looks like
this
/dev/sda /mnt/test btrfs rw,relatime,subvolid=256,subvol=/foo 0 0
/dev/sda /mnt/test/baz btrfs rw,relatime,subvolid=256,subvol=/foo 0 0
Reported-by: Chris Murphy <chris@colorremedies.com>
CC: stable@vger.kernel.org # 4.4+
Signed-off-by: Josef Bacik <josef@toxicpanda.com>
Reviewed-by: David Sterba <dsterba@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2020-07-22 15:12:46 +00:00
|
|
|
if (!IS_ERR(subvol_name)) {
|
|
|
|
seq_puts(seq, ",subvol=");
|
|
|
|
seq_escape(seq, subvol_name, " \t\n\\");
|
|
|
|
kfree(subvol_name);
|
|
|
|
}
|
2009-04-02 20:46:06 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2011-09-29 11:11:33 +00:00
|
|
|
/*
|
|
|
|
* subvolumes are identified by ino 256
|
|
|
|
*/
|
|
|
|
static inline int is_subvolume_inode(struct inode *inode)
|
|
|
|
{
|
|
|
|
if (inode && inode->i_ino == BTRFS_FIRST_FREE_OBJECTID)
|
|
|
|
return 1;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2015-05-18 09:16:29 +00:00
|
|
|
static struct dentry *mount_subvol(const char *subvol_name, u64 subvol_objectid,
|
2019-03-29 06:03:17 +00:00
|
|
|
struct vfsmount *mnt)
|
2011-07-25 19:55:42 +00:00
|
|
|
{
|
|
|
|
struct dentry *root;
|
2015-05-18 09:16:28 +00:00
|
|
|
int ret;
|
2011-07-25 19:55:42 +00:00
|
|
|
|
2015-05-18 09:16:30 +00:00
|
|
|
if (!subvol_name) {
|
|
|
|
if (!subvol_objectid) {
|
|
|
|
ret = get_default_subvol_objectid(btrfs_sb(mnt->mnt_sb),
|
|
|
|
&subvol_objectid);
|
|
|
|
if (ret) {
|
|
|
|
root = ERR_PTR(ret);
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
}
|
2020-02-21 13:56:12 +00:00
|
|
|
subvol_name = btrfs_get_subvol_name_from_objectid(
|
|
|
|
btrfs_sb(mnt->mnt_sb), subvol_objectid);
|
2015-05-18 09:16:30 +00:00
|
|
|
if (IS_ERR(subvol_name)) {
|
|
|
|
root = ERR_CAST(subvol_name);
|
|
|
|
subvol_name = NULL;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2011-11-17 02:43:59 +00:00
|
|
|
root = mount_subtree(mnt, subvol_name);
|
2015-05-18 09:16:28 +00:00
|
|
|
/* mount_subtree() drops our reference on the vfsmount. */
|
|
|
|
mnt = NULL;
|
2011-07-25 19:55:42 +00:00
|
|
|
|
2015-05-18 09:16:29 +00:00
|
|
|
if (!IS_ERR(root)) {
|
2011-11-17 02:43:59 +00:00
|
|
|
struct super_block *s = root->d_sb;
|
2016-09-20 14:05:02 +00:00
|
|
|
struct btrfs_fs_info *fs_info = btrfs_sb(s);
|
2015-05-18 09:16:29 +00:00
|
|
|
struct inode *root_inode = d_inode(root);
|
2024-04-15 20:16:23 +00:00
|
|
|
u64 root_objectid = btrfs_root_id(BTRFS_I(root_inode)->root);
|
2015-05-18 09:16:29 +00:00
|
|
|
|
|
|
|
ret = 0;
|
|
|
|
if (!is_subvolume_inode(root_inode)) {
|
2016-09-20 14:05:02 +00:00
|
|
|
btrfs_err(fs_info, "'%s' is not a valid subvolume",
|
2015-05-18 09:16:29 +00:00
|
|
|
subvol_name);
|
|
|
|
ret = -EINVAL;
|
|
|
|
}
|
|
|
|
if (subvol_objectid && root_objectid != subvol_objectid) {
|
2015-05-18 09:16:30 +00:00
|
|
|
/*
|
|
|
|
* This will also catch a race condition where a
|
|
|
|
* subvolume which was passed by ID is renamed and
|
|
|
|
* another subvolume is renamed over the old location.
|
|
|
|
*/
|
2016-09-20 14:05:02 +00:00
|
|
|
btrfs_err(fs_info,
|
|
|
|
"subvol '%s' does not match subvolid %llu",
|
|
|
|
subvol_name, subvol_objectid);
|
2015-05-18 09:16:29 +00:00
|
|
|
ret = -EINVAL;
|
|
|
|
}
|
|
|
|
if (ret) {
|
|
|
|
dput(root);
|
|
|
|
root = ERR_PTR(ret);
|
|
|
|
deactivate_locked_super(s);
|
|
|
|
}
|
2011-09-29 11:11:33 +00:00
|
|
|
}
|
|
|
|
|
2015-05-18 09:16:28 +00:00
|
|
|
out:
|
|
|
|
mntput(mnt);
|
|
|
|
kfree(subvol_name);
|
2011-07-25 19:55:42 +00:00
|
|
|
return root;
|
|
|
|
}
|
2010-11-19 19:59:15 +00:00
|
|
|
|
2012-04-24 19:59:16 +00:00
|
|
|
static void btrfs_resize_thread_pool(struct btrfs_fs_info *fs_info,
|
2018-02-13 09:50:42 +00:00
|
|
|
u32 new_pool_size, u32 old_pool_size)
|
2017-12-14 08:24:30 +00:00
|
|
|
{
|
2012-04-24 19:59:16 +00:00
|
|
|
if (new_pool_size == old_pool_size)
|
|
|
|
return;
|
2017-12-14 08:24:30 +00:00
|
|
|
|
2012-04-24 19:59:16 +00:00
|
|
|
fs_info->thread_pool_size = new_pool_size;
|
2017-12-14 08:24:30 +00:00
|
|
|
|
2013-12-20 16:37:06 +00:00
|
|
|
btrfs_info(fs_info, "resize thread pool %d -> %d",
|
2012-04-24 19:59:16 +00:00
|
|
|
old_pool_size, new_pool_size);
|
2017-12-14 08:24:30 +00:00
|
|
|
|
2014-02-28 02:46:06 +00:00
|
|
|
btrfs_workqueue_set_max(fs_info->workers, new_pool_size);
|
2014-02-28 02:46:07 +00:00
|
|
|
btrfs_workqueue_set_max(fs_info->delalloc_workers, new_pool_size);
|
2014-02-28 02:46:12 +00:00
|
|
|
btrfs_workqueue_set_max(fs_info->caching_workers, new_pool_size);
|
2023-03-28 03:56:13 +00:00
|
|
|
workqueue_set_max_active(fs_info->endio_workers, new_pool_size);
|
|
|
|
workqueue_set_max_active(fs_info->endio_meta_workers, new_pool_size);
|
2014-02-28 02:46:10 +00:00
|
|
|
btrfs_workqueue_set_max(fs_info->endio_write_workers, new_pool_size);
|
|
|
|
btrfs_workqueue_set_max(fs_info->endio_freespace_worker, new_pool_size);
|
2014-02-28 02:46:15 +00:00
|
|
|
btrfs_workqueue_set_max(fs_info->delayed_workers, new_pool_size);
|
2012-04-24 19:59:16 +00:00
|
|
|
}
|
|
|
|
|
2013-04-11 10:29:35 +00:00
|
|
|
static inline void btrfs_remount_begin(struct btrfs_fs_info *fs_info,
|
2024-07-13 09:03:44 +00:00
|
|
|
unsigned long long old_opts, int flags)
|
2013-04-11 10:29:35 +00:00
|
|
|
{
|
2013-02-21 06:32:52 +00:00
|
|
|
if (btrfs_raw_test_opt(old_opts, AUTO_DEFRAG) &&
|
|
|
|
(!btrfs_raw_test_opt(fs_info->mount_opt, AUTO_DEFRAG) ||
|
2017-11-27 21:05:09 +00:00
|
|
|
(flags & SB_RDONLY))) {
|
2013-02-21 06:32:52 +00:00
|
|
|
/* wait for any defraggers to finish */
|
|
|
|
wait_event(fs_info->transaction_wait,
|
|
|
|
(atomic_read(&fs_info->defrag_running) == 0));
|
2017-11-27 21:05:09 +00:00
|
|
|
if (flags & SB_RDONLY)
|
2013-02-21 06:32:52 +00:00
|
|
|
sync_filesystem(fs_info->sb);
|
2018-06-19 16:04:07 +00:00
|
|
|
}
|
2013-02-21 06:32:52 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline void btrfs_remount_cleanup(struct btrfs_fs_info *fs_info,
|
2024-07-13 09:03:44 +00:00
|
|
|
unsigned long long old_opts)
|
2013-02-21 06:32:52 +00:00
|
|
|
{
|
btrfs: keep sb cache_generation consistent with space_cache
When mounting, btrfs uses the cache_generation in the super block to
determine if space cache v1 is in use. However, by mounting with
nospace_cache or space_cache=v2, it is possible to disable space cache
v1, which does not result in un-setting cache_generation back to 0.
In order to base some logic, like mount option printing in /proc/mounts,
on the current state of the space cache rather than just the values of
the mount option, keep the value of cache_generation consistent with the
status of space cache v1.
We ensure that cache_generation > 0 iff the file system is using
space_cache v1. This requires committing a transaction on any mount
which changes whether we are using v1. (v1->nospace_cache, v1->v2,
nospace_cache->v1, v2->v1).
Since the mechanism for writing out the cache generation is transaction
commit, but we want some finer grained control over when we un-set it,
we can't just rely on the SPACE_CACHE mount option, and introduce an
fs_info flag that mount can use when it wants to unset the generation.
Reviewed-by: Josef Bacik <josef@toxicpanda.com>
Signed-off-by: Boris Burkov <boris@bur.io>
Signed-off-by: David Sterba <dsterba@suse.com>
2020-11-18 23:06:22 +00:00
|
|
|
const bool cache_opt = btrfs_test_opt(fs_info, SPACE_CACHE);
|
2018-06-19 16:01:24 +00:00
|
|
|
|
2023-09-08 16:31:55 +00:00
|
|
|
/*
|
2016-04-04 14:31:22 +00:00
|
|
|
* We need to cleanup all defragable inodes if the autodefragment is
|
|
|
|
* close or the filesystem is read only.
|
2023-09-08 16:31:55 +00:00
|
|
|
*/
|
2013-02-21 06:32:52 +00:00
|
|
|
if (btrfs_raw_test_opt(old_opts, AUTO_DEFRAG) &&
|
2017-07-17 07:45:34 +00:00
|
|
|
(!btrfs_raw_test_opt(fs_info->mount_opt, AUTO_DEFRAG) || sb_rdonly(fs_info->sb))) {
|
2013-02-21 06:32:52 +00:00
|
|
|
btrfs_cleanup_defrag_inodes(fs_info);
|
2018-06-19 16:04:07 +00:00
|
|
|
}
|
2018-06-19 16:01:24 +00:00
|
|
|
|
2019-12-14 00:22:14 +00:00
|
|
|
/* If we toggled discard async */
|
|
|
|
if (!btrfs_raw_test_opt(old_opts, DISCARD_ASYNC) &&
|
|
|
|
btrfs_test_opt(fs_info, DISCARD_ASYNC))
|
|
|
|
btrfs_discard_resume(fs_info);
|
|
|
|
else if (btrfs_raw_test_opt(old_opts, DISCARD_ASYNC) &&
|
|
|
|
!btrfs_test_opt(fs_info, DISCARD_ASYNC))
|
|
|
|
btrfs_discard_cleanup(fs_info);
|
2018-06-19 16:01:24 +00:00
|
|
|
|
btrfs: keep sb cache_generation consistent with space_cache
When mounting, btrfs uses the cache_generation in the super block to
determine if space cache v1 is in use. However, by mounting with
nospace_cache or space_cache=v2, it is possible to disable space cache
v1, which does not result in un-setting cache_generation back to 0.
In order to base some logic, like mount option printing in /proc/mounts,
on the current state of the space cache rather than just the values of
the mount option, keep the value of cache_generation consistent with the
status of space cache v1.
We ensure that cache_generation > 0 iff the file system is using
space_cache v1. This requires committing a transaction on any mount
which changes whether we are using v1. (v1->nospace_cache, v1->v2,
nospace_cache->v1, v2->v1).
Since the mechanism for writing out the cache generation is transaction
commit, but we want some finer grained control over when we un-set it,
we can't just rely on the SPACE_CACHE mount option, and introduce an
fs_info flag that mount can use when it wants to unset the generation.
Reviewed-by: Josef Bacik <josef@toxicpanda.com>
Signed-off-by: Boris Burkov <boris@bur.io>
Signed-off-by: David Sterba <dsterba@suse.com>
2020-11-18 23:06:22 +00:00
|
|
|
/* If we toggled space cache */
|
|
|
|
if (cache_opt != btrfs_free_space_cache_v1_active(fs_info))
|
|
|
|
btrfs_set_free_space_cache_v1_active(fs_info, cache_opt);
|
2013-02-21 06:32:52 +00:00
|
|
|
}
|
2017-12-14 08:24:30 +00:00
|
|
|
|
2023-11-22 17:17:42 +00:00
|
|
|
static int btrfs_remount_rw(struct btrfs_fs_info *fs_info)
|
|
|
|
{
|
|
|
|
int ret;
|
2017-12-14 08:24:30 +00:00
|
|
|
|
2023-11-22 17:17:42 +00:00
|
|
|
if (BTRFS_FS_ERROR(fs_info)) {
|
|
|
|
btrfs_err(fs_info,
|
|
|
|
"remounting read-write after error is not allowed");
|
|
|
|
return -EINVAL;
|
2017-12-14 08:24:30 +00:00
|
|
|
}
|
|
|
|
|
2023-11-22 17:17:42 +00:00
|
|
|
if (fs_info->fs_devices->rw_devices == 0)
|
|
|
|
return -EACCES;
|
|
|
|
|
|
|
|
if (!btrfs_check_rw_degradable(fs_info, NULL)) {
|
|
|
|
btrfs_warn(fs_info,
|
|
|
|
"too many missing devices, writable remount is not allowed");
|
|
|
|
return -EACCES;
|
2017-12-14 08:24:30 +00:00
|
|
|
}
|
2023-11-22 17:17:42 +00:00
|
|
|
|
|
|
|
if (btrfs_super_log_root(fs_info->super_copy) != 0) {
|
|
|
|
btrfs_warn(fs_info,
|
|
|
|
"mount required to replay tree-log, cannot remount read-write");
|
|
|
|
return -EINVAL;
|
2017-12-14 08:24:30 +00:00
|
|
|
}
|
|
|
|
|
2023-11-22 17:17:42 +00:00
|
|
|
/*
|
|
|
|
* NOTE: when remounting with a change that does writes, don't put it
|
|
|
|
* anywhere above this point, as we are not sure to be safe to write
|
|
|
|
* until we pass the above checks.
|
|
|
|
*/
|
|
|
|
ret = btrfs_start_pre_rw_mount(fs_info);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
2017-12-14 08:24:30 +00:00
|
|
|
|
2023-11-22 17:17:42 +00:00
|
|
|
btrfs_clear_sb_rdonly(fs_info->sb);
|
|
|
|
|
|
|
|
set_bit(BTRFS_FS_OPEN, &fs_info->flags);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If we've gone from readonly -> read-write, we need to get our
|
|
|
|
* sync/async discard lists in the right state.
|
|
|
|
*/
|
|
|
|
btrfs_discard_resume(fs_info);
|
|
|
|
|
|
|
|
return 0;
|
2017-12-14 08:24:30 +00:00
|
|
|
}
|
btrfs: cleanup btrfs_mount() using btrfs_mount_root()
Cleanup btrfs_mount() by using btrfs_mount_root(). This avoids getting
btrfs_mount() called twice in mount path.
Old btrfs_mount() will do:
0. VFS layer calls vfs_kern_mount() with registered file_system_type
(for btrfs, btrfs_fs_type). btrfs_mount() is called on the way.
1. btrfs_parse_early_options() parses "subvolid=" mount option and set the
value to subvol_objectid. Otherwise, subvol_objectid has the initial
value of 0
2. check subvol_objectid is 5 or not. Assume this time id is not 5, then
btrfs_mount() returns by calling mount_subvol()
3. In mount_subvol(), original mount options are modified to contain
"subvolid=0" in setup_root_args(). Then, vfs_kern_mount() is called with
btrfs_fs_type and new options
4. btrfs_mount() is called again
5. btrfs_parse_early_options() parses "subvolid=0" and set 5 (instead of 0)
to subvol_objectid
6. check subvol_objectid is 5 or not. This time id is 5 and mount_subvol()
is not called. btrfs_mount() finishes mounting a root
7. (in mount_subvol()) with using a return vale of vfs_kern_mount(), it
calls mount_subtree()
8. return subvolume's dentry
Reusing the same file_system_type (and btrfs_mount()) for vfs_kern_mount()
is the cause of complication.
Instead, new btrfs_mount() will do:
1. parse subvol id related options for later use in mount_subvol()
2. mount device's root by calling vfs_kern_mount() with
btrfs_root_fs_type, which is not registered to VFS by
register_filesystem(). As a result, btrfs_mount_root() is called
3. return by calling mount_subvol()
The code of 2. is moved from the first part of mount_subvol().
The semantics of device holder changes from btrfs_fs_type to
btrfs_root_fs_type and has to be used in all contexts. Otherwise we'd
get wrong results when mount and dev scan would not check the same
thing. (this has been found indendently and the fix is folded into this
patch)
Signed-off-by: Tomohiro Misono <misono.tomohiro@jp.fujitsu.com>
Reviewed-by: David Sterba <dsterba@suse.com>
[ fold the btrfs_control_ioctl fixup, extend the comment ]
Signed-off-by: David Sterba <dsterba@suse.com>
2017-12-14 08:25:01 +00:00
|
|
|
|
2023-11-22 17:17:42 +00:00
|
|
|
static int btrfs_remount_ro(struct btrfs_fs_info *fs_info)
|
2007-08-29 13:11:44 +00:00
|
|
|
{
|
2023-11-22 17:17:42 +00:00
|
|
|
/*
|
|
|
|
* This also happens on 'umount -rf' or on shutdown, when the
|
|
|
|
* filesystem is busy.
|
|
|
|
*/
|
|
|
|
cancel_work_sync(&fs_info->async_reclaim_work);
|
|
|
|
cancel_work_sync(&fs_info->async_data_reclaim_work);
|
2007-08-29 13:11:44 +00:00
|
|
|
|
2023-11-22 17:17:42 +00:00
|
|
|
btrfs_discard_cleanup(fs_info);
|
2008-06-10 14:40:29 +00:00
|
|
|
|
2023-11-22 17:17:42 +00:00
|
|
|
/* Wait for the uuid_scan task to finish */
|
|
|
|
down(&fs_info->uuid_tree_rescan_sem);
|
|
|
|
/* Avoid complains from lockdep et al. */
|
|
|
|
up(&fs_info->uuid_tree_rescan_sem);
|
2007-08-29 13:11:44 +00:00
|
|
|
|
2023-11-22 17:17:42 +00:00
|
|
|
btrfs_set_sb_rdonly(fs_info->sb);
|
2007-08-29 13:11:44 +00:00
|
|
|
|
2023-11-22 17:17:42 +00:00
|
|
|
/*
|
|
|
|
* Setting SB_RDONLY will put the cleaner thread to sleep at the next
|
|
|
|
* loop if it's already active. If it's already asleep, we'll leave
|
|
|
|
* unused block groups on disk until we're mounted read-write again
|
|
|
|
* unless we clean them up here.
|
|
|
|
*/
|
|
|
|
btrfs_delete_unused_bgs(fs_info);
|
2007-08-29 13:11:44 +00:00
|
|
|
|
2023-11-22 17:17:42 +00:00
|
|
|
/*
|
|
|
|
* The cleaner task could be already running before we set the flag
|
|
|
|
* BTRFS_FS_STATE_RO (and SB_RDONLY in the superblock). We must make
|
|
|
|
* sure that after we finish the remount, i.e. after we call
|
|
|
|
* btrfs_commit_super(), the cleaner can no longer start a transaction
|
|
|
|
* - either because it was dropping a dead root, running delayed iputs
|
|
|
|
* or deleting an unused block group (the cleaner picked a block
|
|
|
|
* group from the list of unused block groups before we were able to
|
|
|
|
* in the previous call to btrfs_delete_unused_bgs()).
|
|
|
|
*/
|
|
|
|
wait_on_bit(&fs_info->flags, BTRFS_FS_CLEANER_RUNNING, TASK_UNINTERRUPTIBLE);
|
2007-03-21 15:12:56 +00:00
|
|
|
|
2023-11-22 17:17:42 +00:00
|
|
|
/*
|
|
|
|
* We've set the superblock to RO mode, so we might have made the
|
|
|
|
* cleaner task sleep without running all pending delayed iputs. Go
|
|
|
|
* through all the delayed iputs here, so that if an unmount happens
|
|
|
|
* without remounting RW we don't end up at finishing close_ctree()
|
|
|
|
* with a non-empty list of delayed iputs.
|
|
|
|
*/
|
|
|
|
btrfs_run_delayed_iputs(fs_info);
|
2012-04-24 19:59:16 +00:00
|
|
|
|
2023-11-22 17:17:42 +00:00
|
|
|
btrfs_dev_replace_suspend_for_unmount(fs_info);
|
|
|
|
btrfs_scrub_cancel(fs_info);
|
|
|
|
btrfs_pause_balance(fs_info);
|
2012-04-24 19:59:16 +00:00
|
|
|
|
2023-11-22 17:17:42 +00:00
|
|
|
/*
|
|
|
|
* Pause the qgroup rescan worker if it is running. We don't want it to
|
|
|
|
* be still running after we are in RO mode, as after that, by the time
|
|
|
|
* we unmount, it might have left a transaction open, so we would leak
|
|
|
|
* the transaction and/or crash.
|
|
|
|
*/
|
|
|
|
btrfs_qgroup_wait_for_completion(fs_info, false);
|
2012-04-24 19:59:16 +00:00
|
|
|
|
2023-11-22 17:17:42 +00:00
|
|
|
return btrfs_commit_super(fs_info);
|
|
|
|
}
|
|
|
|
|
2023-11-22 17:17:47 +00:00
|
|
|
static void btrfs_ctx_to_info(struct btrfs_fs_info *fs_info, struct btrfs_fs_context *ctx)
|
|
|
|
{
|
|
|
|
fs_info->max_inline = ctx->max_inline;
|
|
|
|
fs_info->commit_interval = ctx->commit_interval;
|
|
|
|
fs_info->metadata_ratio = ctx->metadata_ratio;
|
|
|
|
fs_info->thread_pool_size = ctx->thread_pool_size;
|
|
|
|
fs_info->mount_opt = ctx->mount_opt;
|
|
|
|
fs_info->compress_type = ctx->compress_type;
|
|
|
|
fs_info->compress_level = ctx->compress_level;
|
2012-04-24 19:59:16 +00:00
|
|
|
}
|
|
|
|
|
2023-11-22 17:17:47 +00:00
|
|
|
static void btrfs_info_to_ctx(struct btrfs_fs_info *fs_info, struct btrfs_fs_context *ctx)
|
2013-04-11 10:29:35 +00:00
|
|
|
{
|
2023-11-22 17:17:47 +00:00
|
|
|
ctx->max_inline = fs_info->max_inline;
|
|
|
|
ctx->commit_interval = fs_info->commit_interval;
|
|
|
|
ctx->metadata_ratio = fs_info->metadata_ratio;
|
|
|
|
ctx->thread_pool_size = fs_info->thread_pool_size;
|
|
|
|
ctx->mount_opt = fs_info->mount_opt;
|
|
|
|
ctx->compress_type = fs_info->compress_type;
|
|
|
|
ctx->compress_level = fs_info->compress_level;
|
2013-02-21 06:32:52 +00:00
|
|
|
}
|
|
|
|
|
2023-11-22 17:17:47 +00:00
|
|
|
#define btrfs_info_if_set(fs_info, old_ctx, opt, fmt, args...) \
|
|
|
|
do { \
|
|
|
|
if ((!old_ctx || !btrfs_raw_test_opt(old_ctx->mount_opt, opt)) && \
|
|
|
|
btrfs_raw_test_opt(fs_info->mount_opt, opt)) \
|
|
|
|
btrfs_info(fs_info, fmt, ##args); \
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
#define btrfs_info_if_unset(fs_info, old_ctx, opt, fmt, args...) \
|
|
|
|
do { \
|
|
|
|
if ((old_ctx && btrfs_raw_test_opt(old_ctx->mount_opt, opt)) && \
|
|
|
|
!btrfs_raw_test_opt(fs_info->mount_opt, opt)) \
|
|
|
|
btrfs_info(fs_info, fmt, ##args); \
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
static void btrfs_emit_options(struct btrfs_fs_info *info,
|
|
|
|
struct btrfs_fs_context *old)
|
2013-02-21 06:32:52 +00:00
|
|
|
{
|
2023-11-22 17:17:47 +00:00
|
|
|
btrfs_info_if_set(info, old, NODATASUM, "setting nodatasum");
|
|
|
|
btrfs_info_if_set(info, old, DEGRADED, "allowing degraded mounts");
|
|
|
|
btrfs_info_if_set(info, old, NODATASUM, "setting nodatasum");
|
|
|
|
btrfs_info_if_set(info, old, SSD, "enabling ssd optimizations");
|
|
|
|
btrfs_info_if_set(info, old, SSD_SPREAD, "using spread ssd allocation scheme");
|
|
|
|
btrfs_info_if_set(info, old, NOBARRIER, "turning off barriers");
|
|
|
|
btrfs_info_if_set(info, old, NOTREELOG, "disabling tree log");
|
|
|
|
btrfs_info_if_set(info, old, NOLOGREPLAY, "disabling log replay at mount time");
|
|
|
|
btrfs_info_if_set(info, old, FLUSHONCOMMIT, "turning on flush-on-commit");
|
|
|
|
btrfs_info_if_set(info, old, DISCARD_SYNC, "turning on sync discard");
|
|
|
|
btrfs_info_if_set(info, old, DISCARD_ASYNC, "turning on async discard");
|
|
|
|
btrfs_info_if_set(info, old, FREE_SPACE_TREE, "enabling free space tree");
|
|
|
|
btrfs_info_if_set(info, old, SPACE_CACHE, "enabling disk space caching");
|
|
|
|
btrfs_info_if_set(info, old, CLEAR_CACHE, "force clearing of disk cache");
|
|
|
|
btrfs_info_if_set(info, old, AUTO_DEFRAG, "enabling auto defrag");
|
|
|
|
btrfs_info_if_set(info, old, FRAGMENT_DATA, "fragmenting data");
|
|
|
|
btrfs_info_if_set(info, old, FRAGMENT_METADATA, "fragmenting metadata");
|
|
|
|
btrfs_info_if_set(info, old, REF_VERIFY, "doing ref verification");
|
|
|
|
btrfs_info_if_set(info, old, USEBACKUPROOT, "trying to use backup root at mount time");
|
|
|
|
btrfs_info_if_set(info, old, IGNOREBADROOTS, "ignoring bad roots");
|
|
|
|
btrfs_info_if_set(info, old, IGNOREDATACSUMS, "ignoring data csums");
|
2024-06-14 04:22:30 +00:00
|
|
|
btrfs_info_if_set(info, old, IGNOREMETACSUMS, "ignoring meta csums");
|
2024-06-14 04:22:31 +00:00
|
|
|
btrfs_info_if_set(info, old, IGNORESUPERFLAGS, "ignoring unknown super block flags");
|
2023-11-22 17:17:47 +00:00
|
|
|
|
|
|
|
btrfs_info_if_unset(info, old, NODATACOW, "setting datacow");
|
|
|
|
btrfs_info_if_unset(info, old, SSD, "not using ssd optimizations");
|
|
|
|
btrfs_info_if_unset(info, old, SSD_SPREAD, "not using spread ssd allocation scheme");
|
|
|
|
btrfs_info_if_unset(info, old, NOBARRIER, "turning off barriers");
|
|
|
|
btrfs_info_if_unset(info, old, NOTREELOG, "enabling tree log");
|
|
|
|
btrfs_info_if_unset(info, old, SPACE_CACHE, "disabling disk space caching");
|
|
|
|
btrfs_info_if_unset(info, old, FREE_SPACE_TREE, "disabling free space tree");
|
|
|
|
btrfs_info_if_unset(info, old, AUTO_DEFRAG, "disabling auto defrag");
|
|
|
|
btrfs_info_if_unset(info, old, COMPRESS, "use no compression");
|
|
|
|
|
|
|
|
/* Did the compression settings change? */
|
|
|
|
if (btrfs_test_opt(info, COMPRESS) &&
|
|
|
|
(!old ||
|
|
|
|
old->compress_type != info->compress_type ||
|
|
|
|
old->compress_level != info->compress_level ||
|
|
|
|
(!btrfs_raw_test_opt(old->mount_opt, FORCE_COMPRESS) &&
|
|
|
|
btrfs_raw_test_opt(info->mount_opt, FORCE_COMPRESS)))) {
|
|
|
|
const char *compress_type = btrfs_compress_type2str(info->compress_type);
|
|
|
|
|
|
|
|
btrfs_info(info, "%s %s compression, level %d",
|
|
|
|
btrfs_test_opt(info, FORCE_COMPRESS) ? "force" : "use",
|
|
|
|
compress_type, info->compress_level);
|
2013-02-21 06:32:52 +00:00
|
|
|
}
|
|
|
|
|
2023-11-22 17:17:47 +00:00
|
|
|
if (info->max_inline != BTRFS_DEFAULT_MAX_INLINE)
|
|
|
|
btrfs_info(info, "max_inline set to %llu", info->max_inline);
|
2013-02-21 06:32:52 +00:00
|
|
|
}
|
|
|
|
|
2023-11-22 17:17:47 +00:00
|
|
|
static int btrfs_reconfigure(struct fs_context *fc)
|
2008-11-12 19:34:12 +00:00
|
|
|
{
|
2023-11-22 17:17:47 +00:00
|
|
|
struct super_block *sb = fc->root->d_sb;
|
2011-11-17 20:40:49 +00:00
|
|
|
struct btrfs_fs_info *fs_info = btrfs_sb(sb);
|
2023-11-22 17:17:47 +00:00
|
|
|
struct btrfs_fs_context *ctx = fc->fs_private;
|
|
|
|
struct btrfs_fs_context old_ctx;
|
|
|
|
int ret = 0;
|
2023-11-22 17:17:49 +00:00
|
|
|
bool mount_reconfigure = (fc->s_fs_info != NULL);
|
2023-11-22 17:17:47 +00:00
|
|
|
|
|
|
|
btrfs_info_to_ctx(fs_info, &old_ctx);
|
2008-11-12 19:34:12 +00:00
|
|
|
|
2024-01-10 17:54:41 +00:00
|
|
|
/*
|
|
|
|
* This is our "bind mount" trick, we don't want to allow the user to do
|
|
|
|
* anything other than mount a different ro/rw and a different subvol,
|
|
|
|
* all of the mount options should be maintained.
|
|
|
|
*/
|
|
|
|
if (mount_reconfigure)
|
|
|
|
ctx->mount_opt = old_ctx.mount_opt;
|
|
|
|
|
2014-03-13 14:14:33 +00:00
|
|
|
sync_filesystem(sb);
|
2020-07-22 15:18:04 +00:00
|
|
|
set_bit(BTRFS_FS_STATE_REMOUNTING, &fs_info->fs_state);
|
2013-02-21 06:32:52 +00:00
|
|
|
|
2023-11-22 17:17:49 +00:00
|
|
|
if (!mount_reconfigure &&
|
2023-11-22 17:17:50 +00:00
|
|
|
!btrfs_check_options(fs_info, &ctx->mount_opt, fc->sb_flags))
|
2023-11-22 17:17:47 +00:00
|
|
|
return -EINVAL;
|
2009-02-12 14:37:35 +00:00
|
|
|
|
2023-11-22 17:17:47 +00:00
|
|
|
ret = btrfs_check_features(fs_info, !(fc->sb_flags & SB_RDONLY));
|
btrfs: relax block-group-tree feature dependency checks
[BUG]
When one user did a wrong attempt to clear block group tree, which can
not be done through mount option, by using "-o clear_cache,space_cache=v2",
it will cause the following error on a fs with block-group-tree feature:
BTRFS info (device dm-1): force clearing of disk cache
BTRFS info (device dm-1): using free space tree
BTRFS info (device dm-1): clearing free space tree
BTRFS info (device dm-1): clearing compat-ro feature flag for FREE_SPACE_TREE (0x1)
BTRFS info (device dm-1): clearing compat-ro feature flag for FREE_SPACE_TREE_VALID (0x2)
BTRFS error (device dm-1): block-group-tree feature requires fres-space-tree and no-holes
BTRFS error (device dm-1): super block corruption detected before writing it to disk
BTRFS: error (device dm-1) in write_all_supers:4318: errno=-117 Filesystem corrupted (unexpected superblock corruption detected)
BTRFS warning (device dm-1: state E): Skipping commit of aborted transaction.
[CAUSE]
Although the dependency for block-group-tree feature is just an
artificial one (to reduce test matrix), we put the dependency check into
btrfs_validate_super().
This is too strict, and during space cache clearing, we will have a
window where free space tree is cleared, and we need to commit the super
block.
In that window, we had block group tree without v2 cache, and triggered
the artificial dependency check.
This is not necessary at all, especially for such a soft dependency.
[FIX]
Introduce a new helper, btrfs_check_features(), to do all the runtime
limitation checks, including:
- Unsupported incompat flags check
- Unsupported compat RO flags check
- Setting missing incompat flags
- Artificial feature dependency checks
Currently only block group tree will rely on this.
- Subpage runtime check for v1 cache
With this helper, we can move quite some checks from
open_ctree()/btrfs_remount() into it, and just call it after
btrfs_parse_options().
Now "-o clear_cache,space_cache=v2" will not trigger the above error
anymore.
Signed-off-by: Qu Wenruo <wqu@suse.com>
Reviewed-by: David Sterba <dsterba@suse.com>
[ edit messages ]
Signed-off-by: David Sterba <dsterba@suse.com>
2022-09-12 05:44:37 +00:00
|
|
|
if (ret < 0)
|
2023-11-22 17:17:47 +00:00
|
|
|
return ret;
|
btrfs: relax block-group-tree feature dependency checks
[BUG]
When one user did a wrong attempt to clear block group tree, which can
not be done through mount option, by using "-o clear_cache,space_cache=v2",
it will cause the following error on a fs with block-group-tree feature:
BTRFS info (device dm-1): force clearing of disk cache
BTRFS info (device dm-1): using free space tree
BTRFS info (device dm-1): clearing free space tree
BTRFS info (device dm-1): clearing compat-ro feature flag for FREE_SPACE_TREE (0x1)
BTRFS info (device dm-1): clearing compat-ro feature flag for FREE_SPACE_TREE_VALID (0x2)
BTRFS error (device dm-1): block-group-tree feature requires fres-space-tree and no-holes
BTRFS error (device dm-1): super block corruption detected before writing it to disk
BTRFS: error (device dm-1) in write_all_supers:4318: errno=-117 Filesystem corrupted (unexpected superblock corruption detected)
BTRFS warning (device dm-1: state E): Skipping commit of aborted transaction.
[CAUSE]
Although the dependency for block-group-tree feature is just an
artificial one (to reduce test matrix), we put the dependency check into
btrfs_validate_super().
This is too strict, and during space cache clearing, we will have a
window where free space tree is cleared, and we need to commit the super
block.
In that window, we had block group tree without v2 cache, and triggered
the artificial dependency check.
This is not necessary at all, especially for such a soft dependency.
[FIX]
Introduce a new helper, btrfs_check_features(), to do all the runtime
limitation checks, including:
- Unsupported incompat flags check
- Unsupported compat RO flags check
- Setting missing incompat flags
- Artificial feature dependency checks
Currently only block group tree will rely on this.
- Subpage runtime check for v1 cache
With this helper, we can move quite some checks from
open_ctree()/btrfs_remount() into it, and just call it after
btrfs_parse_options().
Now "-o clear_cache,space_cache=v2" will not trigger the above error
anymore.
Signed-off-by: Qu Wenruo <wqu@suse.com>
Reviewed-by: David Sterba <dsterba@suse.com>
[ edit messages ]
Signed-off-by: David Sterba <dsterba@suse.com>
2022-09-12 05:44:37 +00:00
|
|
|
|
2023-11-22 17:17:47 +00:00
|
|
|
btrfs_ctx_to_info(fs_info, ctx);
|
|
|
|
btrfs_remount_begin(fs_info, old_ctx.mount_opt, fc->sb_flags);
|
|
|
|
btrfs_resize_thread_pool(fs_info, fs_info->thread_pool_size,
|
|
|
|
old_ctx.thread_pool_size);
|
2012-04-24 19:59:16 +00:00
|
|
|
|
btrfs: fix spurious free_space_tree remount warning
The intended logic of the check is to catch cases where the desired
free_space_tree setting doesn't match the mounted setting, and the
remount is anything but ro->rw. However, it makes the mistake of
checking equality on a masked integer (btrfs_test_opt) against a boolean
(btrfs_fs_compat_ro).
If you run the reproducer:
$ mount -o space_cache=v2 dev mnt
$ mount -o remount,ro mnt
you would expect no warning, because the remount is not attempting to
change the free space tree setting, but we do see the warning.
To fix this, add explicit bool type casts to the condition.
I tested a variety of transitions:
sudo mount -o space_cache=v2 /dev/vg0/lv0 mnt/lol
(fst enabled)
mount -o remount,ro mnt/lol
(no warning, no fst change)
sudo mount -o remount,rw,space_cache=v1,clear_cache
(no warning, ro->rw)
sudo mount -o remount,rw,space_cache=v2 mnt
(warning, rw->rw with change)
sudo mount -o remount,ro mnt
(no warning, no fst change)
sudo mount -o remount,rw,space_cache=v2 mnt
(no warning, no fst change)
Reported-by: Chris Murphy <lists@colorremedies.com>
CC: stable@vger.kernel.org # 5.11
Signed-off-by: Boris Burkov <boris@bur.io>
Reviewed-by: David Sterba <dsterba@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2021-02-23 18:22:32 +00:00
|
|
|
if ((bool)btrfs_test_opt(fs_info, FREE_SPACE_TREE) !=
|
|
|
|
(bool)btrfs_fs_compat_ro(fs_info, FREE_SPACE_TREE) &&
|
2023-11-22 17:17:47 +00:00
|
|
|
(!sb_rdonly(sb) || (fc->sb_flags & SB_RDONLY))) {
|
2020-11-18 23:06:24 +00:00
|
|
|
btrfs_warn(fs_info,
|
2023-11-22 17:17:47 +00:00
|
|
|
"remount supports changing free space tree only from RO to RW");
|
|
|
|
/* Make sure free space cache options match the state on disk. */
|
2020-11-18 23:06:24 +00:00
|
|
|
if (btrfs_fs_compat_ro(fs_info, FREE_SPACE_TREE)) {
|
|
|
|
btrfs_set_opt(fs_info->mount_opt, FREE_SPACE_TREE);
|
|
|
|
btrfs_clear_opt(fs_info->mount_opt, SPACE_CACHE);
|
|
|
|
}
|
|
|
|
if (btrfs_free_space_cache_v1_active(fs_info)) {
|
|
|
|
btrfs_clear_opt(fs_info->mount_opt, FREE_SPACE_TREE);
|
|
|
|
btrfs_set_opt(fs_info->mount_opt, SPACE_CACHE);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2023-11-22 17:17:47 +00:00
|
|
|
ret = 0;
|
|
|
|
if (!sb_rdonly(sb) && (fc->sb_flags & SB_RDONLY))
|
|
|
|
ret = btrfs_remount_ro(fs_info);
|
|
|
|
else if (sb_rdonly(sb) && !(fc->sb_flags & SB_RDONLY))
|
|
|
|
ret = btrfs_remount_rw(fs_info);
|
|
|
|
if (ret)
|
|
|
|
goto restore;
|
btrfs: properly enable async discard when switching from RO->RW
The async discard uses the BTRFS_FS_DISCARD_RUNNING bit in the fs_info
to force discards off when the filesystem has aborted or we're generally
not able to run discards. This gets flipped on when we're mounted rw,
and also when we go from ro->rw.
Commit 63a7cb13071842 ("btrfs: auto enable discard=async when possible")
enabled async discard by default, and this meant
"mount -o ro /dev/xxx /yyy" had async discards turned on.
Unfortunately, this meant our check in btrfs_remount_cleanup() would see
that discards are already on:
/* If we toggled discard async */
if (!btrfs_raw_test_opt(old_opts, DISCARD_ASYNC) &&
btrfs_test_opt(fs_info, DISCARD_ASYNC))
btrfs_discard_resume(fs_info);
So, we'd never call btrfs_discard_resume() when remounting the root
filesystem from ro->rw.
drgn shows this really nicely:
import os
import sys
from drgn.helpers.linux.fs import path_lookup
from drgn import NULL, Object, Type, cast
def btrfs_sb(sb):
return cast("struct btrfs_fs_info *", sb.s_fs_info)
if len(sys.argv) == 1:
path = "/"
else:
path = sys.argv[1]
fs_info = cast("struct btrfs_fs_info *", path_lookup(prog, path).mnt.mnt_sb.s_fs_info)
BTRFS_FS_DISCARD_RUNNING = 1 << prog['BTRFS_FS_DISCARD_RUNNING']
if fs_info.flags & BTRFS_FS_DISCARD_RUNNING:
print("discard running flag is on")
else:
print("discard running flag is off")
[root]# mount | grep nvme
/dev/nvme0n1p3 on / type btrfs
(rw,relatime,compress-force=zstd:3,ssd,discard=async,space_cache=v2,subvolid=5,subvol=/)
[root]# ./discard_running.drgn
discard running flag is off
[root]# mount -o remount,discard=sync /
[root]# mount -o remount,discard=async /
[root]# ./discard_running.drgn
discard running flag is on
The fix is to call btrfs_discard_resume() when we're going from ro->rw.
It already checks to make sure the async discard flag is on, so it'll do
the right thing.
Fixes: 63a7cb13071842 ("btrfs: auto enable discard=async when possible")
CC: stable@vger.kernel.org # 6.3+
Reviewed-by: Boris Burkov <boris@bur.io>
Signed-off-by: Chris Mason <clm@fb.com>
Reviewed-by: David Sterba <dsterba@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2023-06-05 19:03:15 +00:00
|
|
|
|
2020-07-30 15:18:09 +00:00
|
|
|
/*
|
2023-11-22 17:17:47 +00:00
|
|
|
* If we set the mask during the parameter parsing VFS would reject the
|
|
|
|
* remount. Here we can set the mask and the value will be updated
|
|
|
|
* appropriately.
|
2020-07-30 15:18:09 +00:00
|
|
|
*/
|
2023-11-22 17:17:47 +00:00
|
|
|
if ((fc->sb_flags & SB_POSIXACL) != (sb->s_flags & SB_POSIXACL))
|
|
|
|
fc->sb_flags_mask |= SB_POSIXACL;
|
2020-07-30 15:18:09 +00:00
|
|
|
|
2023-11-22 17:17:47 +00:00
|
|
|
btrfs_emit_options(fs_info, &old_ctx);
|
2014-02-20 16:48:07 +00:00
|
|
|
wake_up_process(fs_info->transaction_kthread);
|
2023-11-22 17:17:47 +00:00
|
|
|
btrfs_remount_cleanup(fs_info, old_ctx.mount_opt);
|
2020-11-18 23:06:20 +00:00
|
|
|
btrfs_clear_oneshot_options(fs_info);
|
2020-07-22 15:18:04 +00:00
|
|
|
clear_bit(BTRFS_FS_STATE_REMOUNTING, &fs_info->fs_state);
|
|
|
|
|
2008-11-12 19:34:12 +00:00
|
|
|
return 0;
|
2012-03-01 16:24:58 +00:00
|
|
|
restore:
|
2023-11-22 17:17:47 +00:00
|
|
|
btrfs_ctx_to_info(fs_info, &old_ctx);
|
|
|
|
btrfs_remount_cleanup(fs_info, old_ctx.mount_opt);
|
2020-07-22 15:18:04 +00:00
|
|
|
clear_bit(BTRFS_FS_STATE_REMOUNTING, &fs_info->fs_state);
|
2012-03-01 16:24:58 +00:00
|
|
|
return ret;
|
2008-11-12 19:34:12 +00:00
|
|
|
}
|
|
|
|
|
2011-04-12 08:43:21 +00:00
|
|
|
/* Used to sort the devices by max_avail(descending sort) */
|
2021-07-26 12:15:26 +00:00
|
|
|
static int btrfs_cmp_device_free_bytes(const void *a, const void *b)
|
2011-04-12 08:43:21 +00:00
|
|
|
{
|
2021-07-26 12:15:26 +00:00
|
|
|
const struct btrfs_device_info *dev_info1 = a;
|
|
|
|
const struct btrfs_device_info *dev_info2 = b;
|
|
|
|
|
|
|
|
if (dev_info1->max_avail > dev_info2->max_avail)
|
2011-04-12 08:43:21 +00:00
|
|
|
return -1;
|
2021-07-26 12:15:26 +00:00
|
|
|
else if (dev_info1->max_avail < dev_info2->max_avail)
|
2011-04-12 08:43:21 +00:00
|
|
|
return 1;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* sort the devices by max_avail, in which max free extent size of each device
|
|
|
|
* is stored.(Descending Sort)
|
|
|
|
*/
|
|
|
|
static inline void btrfs_descending_sort_devices(
|
|
|
|
struct btrfs_device_info *devices,
|
|
|
|
size_t nr_devices)
|
|
|
|
{
|
|
|
|
sort(devices, nr_devices, sizeof(struct btrfs_device_info),
|
|
|
|
btrfs_cmp_device_free_bytes, NULL);
|
|
|
|
}
|
|
|
|
|
btrfs: fix wrong free space information of btrfs
When we store data by raid profile in btrfs with two or more different size
disks, df command shows there is some free space in the filesystem, but the
user can not write any data in fact, df command shows the wrong free space
information of btrfs.
# mkfs.btrfs -d raid1 /dev/sda9 /dev/sda10
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 28.00KB
devid 1 size 5.01GB used 2.03GB path /dev/sda9
devid 2 size 10.00GB used 2.01GB path /dev/sda10
# btrfs device scan /dev/sda9 /dev/sda10
# mount /dev/sda9 /mnt
# dd if=/dev/zero of=tmpfile0 bs=4K count=9999999999
(fill the filesystem)
# sync
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 5.4G 62% /mnt
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 3.99GB
devid 1 size 5.01GB used 5.01GB path /dev/sda9
devid 2 size 10.00GB used 4.99GB path /dev/sda10
It is because btrfs cannot allocate chunks when one of the pairing disks has
no space, the free space on the other disks can not be used for ever, and should
be subtracted from the total space, but btrfs doesn't subtract this space from
the total. It is strange to the user.
This patch fixes it by calcing the free space that can be used to allocate
chunks.
Implementation:
1. get all the devices free space, and align them by stripe length.
2. sort the devices by the free space.
3. check the free space of the devices,
3.1. if it is not zero, and then check the number of the devices that has
more free space than this device,
if the number of the devices is beyond the min stripe number, the free
space can be used, and add into total free space.
if the number of the devices is below the min stripe number, we can not
use the free space, the check ends.
3.2. if the free space is zero, check the next devices, goto 3.1
This implementation is just likely fake chunk allocation.
After appling this patch, df can show correct space information:
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 0 100% /mnt
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-01-05 10:07:31 +00:00
|
|
|
/*
|
|
|
|
* The helper to calc the free space on the devices that can be used to store
|
|
|
|
* file data.
|
|
|
|
*/
|
2018-11-03 15:39:28 +00:00
|
|
|
static inline int btrfs_calc_avail_data_space(struct btrfs_fs_info *fs_info,
|
|
|
|
u64 *free_bytes)
|
btrfs: fix wrong free space information of btrfs
When we store data by raid profile in btrfs with two or more different size
disks, df command shows there is some free space in the filesystem, but the
user can not write any data in fact, df command shows the wrong free space
information of btrfs.
# mkfs.btrfs -d raid1 /dev/sda9 /dev/sda10
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 28.00KB
devid 1 size 5.01GB used 2.03GB path /dev/sda9
devid 2 size 10.00GB used 2.01GB path /dev/sda10
# btrfs device scan /dev/sda9 /dev/sda10
# mount /dev/sda9 /mnt
# dd if=/dev/zero of=tmpfile0 bs=4K count=9999999999
(fill the filesystem)
# sync
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 5.4G 62% /mnt
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 3.99GB
devid 1 size 5.01GB used 5.01GB path /dev/sda9
devid 2 size 10.00GB used 4.99GB path /dev/sda10
It is because btrfs cannot allocate chunks when one of the pairing disks has
no space, the free space on the other disks can not be used for ever, and should
be subtracted from the total space, but btrfs doesn't subtract this space from
the total. It is strange to the user.
This patch fixes it by calcing the free space that can be used to allocate
chunks.
Implementation:
1. get all the devices free space, and align them by stripe length.
2. sort the devices by the free space.
3. check the free space of the devices,
3.1. if it is not zero, and then check the number of the devices that has
more free space than this device,
if the number of the devices is beyond the min stripe number, the free
space can be used, and add into total free space.
if the number of the devices is below the min stripe number, we can not
use the free space, the check ends.
3.2. if the free space is zero, check the next devices, goto 3.1
This implementation is just likely fake chunk allocation.
After appling this patch, df can show correct space information:
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 0 100% /mnt
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-01-05 10:07:31 +00:00
|
|
|
{
|
|
|
|
struct btrfs_device_info *devices_info;
|
|
|
|
struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
|
|
|
|
struct btrfs_device *device;
|
|
|
|
u64 type;
|
|
|
|
u64 avail_space;
|
|
|
|
u64 min_stripe_size;
|
2019-07-03 12:32:59 +00:00
|
|
|
int num_stripes = 1;
|
btrfs: fix wrong free space information of btrfs
When we store data by raid profile in btrfs with two or more different size
disks, df command shows there is some free space in the filesystem, but the
user can not write any data in fact, df command shows the wrong free space
information of btrfs.
# mkfs.btrfs -d raid1 /dev/sda9 /dev/sda10
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 28.00KB
devid 1 size 5.01GB used 2.03GB path /dev/sda9
devid 2 size 10.00GB used 2.01GB path /dev/sda10
# btrfs device scan /dev/sda9 /dev/sda10
# mount /dev/sda9 /mnt
# dd if=/dev/zero of=tmpfile0 bs=4K count=9999999999
(fill the filesystem)
# sync
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 5.4G 62% /mnt
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 3.99GB
devid 1 size 5.01GB used 5.01GB path /dev/sda9
devid 2 size 10.00GB used 4.99GB path /dev/sda10
It is because btrfs cannot allocate chunks when one of the pairing disks has
no space, the free space on the other disks can not be used for ever, and should
be subtracted from the total space, but btrfs doesn't subtract this space from
the total. It is strange to the user.
This patch fixes it by calcing the free space that can be used to allocate
chunks.
Implementation:
1. get all the devices free space, and align them by stripe length.
2. sort the devices by the free space.
3. check the free space of the devices,
3.1. if it is not zero, and then check the number of the devices that has
more free space than this device,
if the number of the devices is beyond the min stripe number, the free
space can be used, and add into total free space.
if the number of the devices is below the min stripe number, we can not
use the free space, the check ends.
3.2. if the free space is zero, check the next devices, goto 3.1
This implementation is just likely fake chunk allocation.
After appling this patch, df can show correct space information:
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 0 100% /mnt
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-01-05 10:07:31 +00:00
|
|
|
int i = 0, nr_devices;
|
2019-06-18 18:00:11 +00:00
|
|
|
const struct btrfs_raid_attr *rattr;
|
btrfs: fix wrong free space information of btrfs
When we store data by raid profile in btrfs with two or more different size
disks, df command shows there is some free space in the filesystem, but the
user can not write any data in fact, df command shows the wrong free space
information of btrfs.
# mkfs.btrfs -d raid1 /dev/sda9 /dev/sda10
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 28.00KB
devid 1 size 5.01GB used 2.03GB path /dev/sda9
devid 2 size 10.00GB used 2.01GB path /dev/sda10
# btrfs device scan /dev/sda9 /dev/sda10
# mount /dev/sda9 /mnt
# dd if=/dev/zero of=tmpfile0 bs=4K count=9999999999
(fill the filesystem)
# sync
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 5.4G 62% /mnt
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 3.99GB
devid 1 size 5.01GB used 5.01GB path /dev/sda9
devid 2 size 10.00GB used 4.99GB path /dev/sda10
It is because btrfs cannot allocate chunks when one of the pairing disks has
no space, the free space on the other disks can not be used for ever, and should
be subtracted from the total space, but btrfs doesn't subtract this space from
the total. It is strange to the user.
This patch fixes it by calcing the free space that can be used to allocate
chunks.
Implementation:
1. get all the devices free space, and align them by stripe length.
2. sort the devices by the free space.
3. check the free space of the devices,
3.1. if it is not zero, and then check the number of the devices that has
more free space than this device,
if the number of the devices is beyond the min stripe number, the free
space can be used, and add into total free space.
if the number of the devices is below the min stripe number, we can not
use the free space, the check ends.
3.2. if the free space is zero, check the next devices, goto 3.1
This implementation is just likely fake chunk allocation.
After appling this patch, df can show correct space information:
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 0 100% /mnt
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-01-05 10:07:31 +00:00
|
|
|
|
2014-11-03 13:56:50 +00:00
|
|
|
/*
|
2016-05-20 01:18:45 +00:00
|
|
|
* We aren't under the device list lock, so this is racy-ish, but good
|
2014-11-03 13:56:50 +00:00
|
|
|
* enough for our purposes.
|
|
|
|
*/
|
2011-11-28 08:43:00 +00:00
|
|
|
nr_devices = fs_info->fs_devices->open_devices;
|
2014-11-03 13:56:50 +00:00
|
|
|
if (!nr_devices) {
|
|
|
|
smp_mb();
|
|
|
|
nr_devices = fs_info->fs_devices->open_devices;
|
|
|
|
ASSERT(nr_devices);
|
|
|
|
if (!nr_devices) {
|
|
|
|
*free_bytes = 0;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
btrfs: fix wrong free space information of btrfs
When we store data by raid profile in btrfs with two or more different size
disks, df command shows there is some free space in the filesystem, but the
user can not write any data in fact, df command shows the wrong free space
information of btrfs.
# mkfs.btrfs -d raid1 /dev/sda9 /dev/sda10
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 28.00KB
devid 1 size 5.01GB used 2.03GB path /dev/sda9
devid 2 size 10.00GB used 2.01GB path /dev/sda10
# btrfs device scan /dev/sda9 /dev/sda10
# mount /dev/sda9 /mnt
# dd if=/dev/zero of=tmpfile0 bs=4K count=9999999999
(fill the filesystem)
# sync
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 5.4G 62% /mnt
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 3.99GB
devid 1 size 5.01GB used 5.01GB path /dev/sda9
devid 2 size 10.00GB used 4.99GB path /dev/sda10
It is because btrfs cannot allocate chunks when one of the pairing disks has
no space, the free space on the other disks can not be used for ever, and should
be subtracted from the total space, but btrfs doesn't subtract this space from
the total. It is strange to the user.
This patch fixes it by calcing the free space that can be used to allocate
chunks.
Implementation:
1. get all the devices free space, and align them by stripe length.
2. sort the devices by the free space.
3. check the free space of the devices,
3.1. if it is not zero, and then check the number of the devices that has
more free space than this device,
if the number of the devices is beyond the min stripe number, the free
space can be used, and add into total free space.
if the number of the devices is below the min stripe number, we can not
use the free space, the check ends.
3.2. if the free space is zero, check the next devices, goto 3.1
This implementation is just likely fake chunk allocation.
After appling this patch, df can show correct space information:
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 0 100% /mnt
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-01-05 10:07:31 +00:00
|
|
|
|
2013-10-31 05:02:18 +00:00
|
|
|
devices_info = kmalloc_array(nr_devices, sizeof(*devices_info),
|
2017-06-15 13:04:04 +00:00
|
|
|
GFP_KERNEL);
|
btrfs: fix wrong free space information of btrfs
When we store data by raid profile in btrfs with two or more different size
disks, df command shows there is some free space in the filesystem, but the
user can not write any data in fact, df command shows the wrong free space
information of btrfs.
# mkfs.btrfs -d raid1 /dev/sda9 /dev/sda10
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 28.00KB
devid 1 size 5.01GB used 2.03GB path /dev/sda9
devid 2 size 10.00GB used 2.01GB path /dev/sda10
# btrfs device scan /dev/sda9 /dev/sda10
# mount /dev/sda9 /mnt
# dd if=/dev/zero of=tmpfile0 bs=4K count=9999999999
(fill the filesystem)
# sync
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 5.4G 62% /mnt
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 3.99GB
devid 1 size 5.01GB used 5.01GB path /dev/sda9
devid 2 size 10.00GB used 4.99GB path /dev/sda10
It is because btrfs cannot allocate chunks when one of the pairing disks has
no space, the free space on the other disks can not be used for ever, and should
be subtracted from the total space, but btrfs doesn't subtract this space from
the total. It is strange to the user.
This patch fixes it by calcing the free space that can be used to allocate
chunks.
Implementation:
1. get all the devices free space, and align them by stripe length.
2. sort the devices by the free space.
3. check the free space of the devices,
3.1. if it is not zero, and then check the number of the devices that has
more free space than this device,
if the number of the devices is beyond the min stripe number, the free
space can be used, and add into total free space.
if the number of the devices is below the min stripe number, we can not
use the free space, the check ends.
3.2. if the free space is zero, check the next devices, goto 3.1
This implementation is just likely fake chunk allocation.
After appling this patch, df can show correct space information:
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 0 100% /mnt
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-01-05 10:07:31 +00:00
|
|
|
if (!devices_info)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
2016-05-20 01:18:45 +00:00
|
|
|
/* calc min stripe number for data space allocation */
|
2017-05-17 15:38:35 +00:00
|
|
|
type = btrfs_data_alloc_profile(fs_info);
|
2019-06-18 18:00:11 +00:00
|
|
|
rattr = &btrfs_raid_array[btrfs_bg_flags_to_raid_index(type)];
|
|
|
|
|
2019-06-18 18:00:13 +00:00
|
|
|
if (type & BTRFS_BLOCK_GROUP_RAID0)
|
2011-12-15 01:12:02 +00:00
|
|
|
num_stripes = nr_devices;
|
2022-06-23 14:57:00 +00:00
|
|
|
else if (type & BTRFS_BLOCK_GROUP_RAID1_MASK)
|
|
|
|
num_stripes = rattr->ncopies;
|
2019-06-18 18:00:13 +00:00
|
|
|
else if (type & BTRFS_BLOCK_GROUP_RAID10)
|
2011-12-15 01:12:02 +00:00
|
|
|
num_stripes = 4;
|
btrfs: fix wrong free space information of btrfs
When we store data by raid profile in btrfs with two or more different size
disks, df command shows there is some free space in the filesystem, but the
user can not write any data in fact, df command shows the wrong free space
information of btrfs.
# mkfs.btrfs -d raid1 /dev/sda9 /dev/sda10
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 28.00KB
devid 1 size 5.01GB used 2.03GB path /dev/sda9
devid 2 size 10.00GB used 2.01GB path /dev/sda10
# btrfs device scan /dev/sda9 /dev/sda10
# mount /dev/sda9 /mnt
# dd if=/dev/zero of=tmpfile0 bs=4K count=9999999999
(fill the filesystem)
# sync
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 5.4G 62% /mnt
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 3.99GB
devid 1 size 5.01GB used 5.01GB path /dev/sda9
devid 2 size 10.00GB used 4.99GB path /dev/sda10
It is because btrfs cannot allocate chunks when one of the pairing disks has
no space, the free space on the other disks can not be used for ever, and should
be subtracted from the total space, but btrfs doesn't subtract this space from
the total. It is strange to the user.
This patch fixes it by calcing the free space that can be used to allocate
chunks.
Implementation:
1. get all the devices free space, and align them by stripe length.
2. sort the devices by the free space.
3. check the free space of the devices,
3.1. if it is not zero, and then check the number of the devices that has
more free space than this device,
if the number of the devices is beyond the min stripe number, the free
space can be used, and add into total free space.
if the number of the devices is below the min stripe number, we can not
use the free space, the check ends.
3.2. if the free space is zero, check the next devices, goto 3.1
This implementation is just likely fake chunk allocation.
After appling this patch, df can show correct space information:
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 0 100% /mnt
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-01-05 10:07:31 +00:00
|
|
|
|
2019-06-18 18:00:11 +00:00
|
|
|
/* Adjust for more than 1 stripe per device */
|
|
|
|
min_stripe_size = rattr->dev_stripes * BTRFS_STRIPE_LEN;
|
btrfs: fix wrong free space information of btrfs
When we store data by raid profile in btrfs with two or more different size
disks, df command shows there is some free space in the filesystem, but the
user can not write any data in fact, df command shows the wrong free space
information of btrfs.
# mkfs.btrfs -d raid1 /dev/sda9 /dev/sda10
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 28.00KB
devid 1 size 5.01GB used 2.03GB path /dev/sda9
devid 2 size 10.00GB used 2.01GB path /dev/sda10
# btrfs device scan /dev/sda9 /dev/sda10
# mount /dev/sda9 /mnt
# dd if=/dev/zero of=tmpfile0 bs=4K count=9999999999
(fill the filesystem)
# sync
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 5.4G 62% /mnt
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 3.99GB
devid 1 size 5.01GB used 5.01GB path /dev/sda9
devid 2 size 10.00GB used 4.99GB path /dev/sda10
It is because btrfs cannot allocate chunks when one of the pairing disks has
no space, the free space on the other disks can not be used for ever, and should
be subtracted from the total space, but btrfs doesn't subtract this space from
the total. It is strange to the user.
This patch fixes it by calcing the free space that can be used to allocate
chunks.
Implementation:
1. get all the devices free space, and align them by stripe length.
2. sort the devices by the free space.
3. check the free space of the devices,
3.1. if it is not zero, and then check the number of the devices that has
more free space than this device,
if the number of the devices is beyond the min stripe number, the free
space can be used, and add into total free space.
if the number of the devices is below the min stripe number, we can not
use the free space, the check ends.
3.2. if the free space is zero, check the next devices, goto 3.1
This implementation is just likely fake chunk allocation.
After appling this patch, df can show correct space information:
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 0 100% /mnt
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-01-05 10:07:31 +00:00
|
|
|
|
2014-11-03 13:56:50 +00:00
|
|
|
rcu_read_lock();
|
|
|
|
list_for_each_entry_rcu(device, &fs_devices->devices, dev_list) {
|
2017-12-04 04:54:53 +00:00
|
|
|
if (!test_bit(BTRFS_DEV_STATE_IN_FS_METADATA,
|
|
|
|
&device->dev_state) ||
|
2017-12-04 04:54:55 +00:00
|
|
|
!device->bdev ||
|
|
|
|
test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state))
|
btrfs: fix wrong free space information of btrfs
When we store data by raid profile in btrfs with two or more different size
disks, df command shows there is some free space in the filesystem, but the
user can not write any data in fact, df command shows the wrong free space
information of btrfs.
# mkfs.btrfs -d raid1 /dev/sda9 /dev/sda10
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 28.00KB
devid 1 size 5.01GB used 2.03GB path /dev/sda9
devid 2 size 10.00GB used 2.01GB path /dev/sda10
# btrfs device scan /dev/sda9 /dev/sda10
# mount /dev/sda9 /mnt
# dd if=/dev/zero of=tmpfile0 bs=4K count=9999999999
(fill the filesystem)
# sync
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 5.4G 62% /mnt
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 3.99GB
devid 1 size 5.01GB used 5.01GB path /dev/sda9
devid 2 size 10.00GB used 4.99GB path /dev/sda10
It is because btrfs cannot allocate chunks when one of the pairing disks has
no space, the free space on the other disks can not be used for ever, and should
be subtracted from the total space, but btrfs doesn't subtract this space from
the total. It is strange to the user.
This patch fixes it by calcing the free space that can be used to allocate
chunks.
Implementation:
1. get all the devices free space, and align them by stripe length.
2. sort the devices by the free space.
3. check the free space of the devices,
3.1. if it is not zero, and then check the number of the devices that has
more free space than this device,
if the number of the devices is beyond the min stripe number, the free
space can be used, and add into total free space.
if the number of the devices is below the min stripe number, we can not
use the free space, the check ends.
3.2. if the free space is zero, check the next devices, goto 3.1
This implementation is just likely fake chunk allocation.
After appling this patch, df can show correct space information:
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 0 100% /mnt
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-01-05 10:07:31 +00:00
|
|
|
continue;
|
|
|
|
|
2014-11-03 13:56:50 +00:00
|
|
|
if (i >= nr_devices)
|
|
|
|
break;
|
|
|
|
|
btrfs: fix wrong free space information of btrfs
When we store data by raid profile in btrfs with two or more different size
disks, df command shows there is some free space in the filesystem, but the
user can not write any data in fact, df command shows the wrong free space
information of btrfs.
# mkfs.btrfs -d raid1 /dev/sda9 /dev/sda10
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 28.00KB
devid 1 size 5.01GB used 2.03GB path /dev/sda9
devid 2 size 10.00GB used 2.01GB path /dev/sda10
# btrfs device scan /dev/sda9 /dev/sda10
# mount /dev/sda9 /mnt
# dd if=/dev/zero of=tmpfile0 bs=4K count=9999999999
(fill the filesystem)
# sync
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 5.4G 62% /mnt
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 3.99GB
devid 1 size 5.01GB used 5.01GB path /dev/sda9
devid 2 size 10.00GB used 4.99GB path /dev/sda10
It is because btrfs cannot allocate chunks when one of the pairing disks has
no space, the free space on the other disks can not be used for ever, and should
be subtracted from the total space, but btrfs doesn't subtract this space from
the total. It is strange to the user.
This patch fixes it by calcing the free space that can be used to allocate
chunks.
Implementation:
1. get all the devices free space, and align them by stripe length.
2. sort the devices by the free space.
3. check the free space of the devices,
3.1. if it is not zero, and then check the number of the devices that has
more free space than this device,
if the number of the devices is beyond the min stripe number, the free
space can be used, and add into total free space.
if the number of the devices is below the min stripe number, we can not
use the free space, the check ends.
3.2. if the free space is zero, check the next devices, goto 3.1
This implementation is just likely fake chunk allocation.
After appling this patch, df can show correct space information:
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 0 100% /mnt
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-01-05 10:07:31 +00:00
|
|
|
avail_space = device->total_bytes - device->bytes_used;
|
|
|
|
|
|
|
|
/* align with stripe_len */
|
2019-07-03 12:32:59 +00:00
|
|
|
avail_space = rounddown(avail_space, BTRFS_STRIPE_LEN);
|
btrfs: fix wrong free space information of btrfs
When we store data by raid profile in btrfs with two or more different size
disks, df command shows there is some free space in the filesystem, but the
user can not write any data in fact, df command shows the wrong free space
information of btrfs.
# mkfs.btrfs -d raid1 /dev/sda9 /dev/sda10
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 28.00KB
devid 1 size 5.01GB used 2.03GB path /dev/sda9
devid 2 size 10.00GB used 2.01GB path /dev/sda10
# btrfs device scan /dev/sda9 /dev/sda10
# mount /dev/sda9 /mnt
# dd if=/dev/zero of=tmpfile0 bs=4K count=9999999999
(fill the filesystem)
# sync
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 5.4G 62% /mnt
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 3.99GB
devid 1 size 5.01GB used 5.01GB path /dev/sda9
devid 2 size 10.00GB used 4.99GB path /dev/sda10
It is because btrfs cannot allocate chunks when one of the pairing disks has
no space, the free space on the other disks can not be used for ever, and should
be subtracted from the total space, but btrfs doesn't subtract this space from
the total. It is strange to the user.
This patch fixes it by calcing the free space that can be used to allocate
chunks.
Implementation:
1. get all the devices free space, and align them by stripe length.
2. sort the devices by the free space.
3. check the free space of the devices,
3.1. if it is not zero, and then check the number of the devices that has
more free space than this device,
if the number of the devices is beyond the min stripe number, the free
space can be used, and add into total free space.
if the number of the devices is below the min stripe number, we can not
use the free space, the check ends.
3.2. if the free space is zero, check the next devices, goto 3.1
This implementation is just likely fake chunk allocation.
After appling this patch, df can show correct space information:
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 0 100% /mnt
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-01-05 10:07:31 +00:00
|
|
|
|
|
|
|
/*
|
2022-06-13 07:06:34 +00:00
|
|
|
* Ensure we have at least min_stripe_size on top of the
|
|
|
|
* reserved space on the device.
|
btrfs: fix wrong free space information of btrfs
When we store data by raid profile in btrfs with two or more different size
disks, df command shows there is some free space in the filesystem, but the
user can not write any data in fact, df command shows the wrong free space
information of btrfs.
# mkfs.btrfs -d raid1 /dev/sda9 /dev/sda10
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 28.00KB
devid 1 size 5.01GB used 2.03GB path /dev/sda9
devid 2 size 10.00GB used 2.01GB path /dev/sda10
# btrfs device scan /dev/sda9 /dev/sda10
# mount /dev/sda9 /mnt
# dd if=/dev/zero of=tmpfile0 bs=4K count=9999999999
(fill the filesystem)
# sync
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 5.4G 62% /mnt
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 3.99GB
devid 1 size 5.01GB used 5.01GB path /dev/sda9
devid 2 size 10.00GB used 4.99GB path /dev/sda10
It is because btrfs cannot allocate chunks when one of the pairing disks has
no space, the free space on the other disks can not be used for ever, and should
be subtracted from the total space, but btrfs doesn't subtract this space from
the total. It is strange to the user.
This patch fixes it by calcing the free space that can be used to allocate
chunks.
Implementation:
1. get all the devices free space, and align them by stripe length.
2. sort the devices by the free space.
3. check the free space of the devices,
3.1. if it is not zero, and then check the number of the devices that has
more free space than this device,
if the number of the devices is beyond the min stripe number, the free
space can be used, and add into total free space.
if the number of the devices is below the min stripe number, we can not
use the free space, the check ends.
3.2. if the free space is zero, check the next devices, goto 3.1
This implementation is just likely fake chunk allocation.
After appling this patch, df can show correct space information:
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 0 100% /mnt
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-01-05 10:07:31 +00:00
|
|
|
*/
|
2022-06-13 07:06:34 +00:00
|
|
|
if (avail_space <= BTRFS_DEVICE_RANGE_RESERVED + min_stripe_size)
|
btrfs: fix wrong free space information of btrfs
When we store data by raid profile in btrfs with two or more different size
disks, df command shows there is some free space in the filesystem, but the
user can not write any data in fact, df command shows the wrong free space
information of btrfs.
# mkfs.btrfs -d raid1 /dev/sda9 /dev/sda10
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 28.00KB
devid 1 size 5.01GB used 2.03GB path /dev/sda9
devid 2 size 10.00GB used 2.01GB path /dev/sda10
# btrfs device scan /dev/sda9 /dev/sda10
# mount /dev/sda9 /mnt
# dd if=/dev/zero of=tmpfile0 bs=4K count=9999999999
(fill the filesystem)
# sync
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 5.4G 62% /mnt
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 3.99GB
devid 1 size 5.01GB used 5.01GB path /dev/sda9
devid 2 size 10.00GB used 4.99GB path /dev/sda10
It is because btrfs cannot allocate chunks when one of the pairing disks has
no space, the free space on the other disks can not be used for ever, and should
be subtracted from the total space, but btrfs doesn't subtract this space from
the total. It is strange to the user.
This patch fixes it by calcing the free space that can be used to allocate
chunks.
Implementation:
1. get all the devices free space, and align them by stripe length.
2. sort the devices by the free space.
3. check the free space of the devices,
3.1. if it is not zero, and then check the number of the devices that has
more free space than this device,
if the number of the devices is beyond the min stripe number, the free
space can be used, and add into total free space.
if the number of the devices is below the min stripe number, we can not
use the free space, the check ends.
3.2. if the free space is zero, check the next devices, goto 3.1
This implementation is just likely fake chunk allocation.
After appling this patch, df can show correct space information:
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 0 100% /mnt
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-01-05 10:07:31 +00:00
|
|
|
continue;
|
|
|
|
|
2022-06-13 07:06:34 +00:00
|
|
|
avail_space -= BTRFS_DEVICE_RANGE_RESERVED;
|
2019-07-03 12:32:59 +00:00
|
|
|
|
btrfs: fix wrong free space information of btrfs
When we store data by raid profile in btrfs with two or more different size
disks, df command shows there is some free space in the filesystem, but the
user can not write any data in fact, df command shows the wrong free space
information of btrfs.
# mkfs.btrfs -d raid1 /dev/sda9 /dev/sda10
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 28.00KB
devid 1 size 5.01GB used 2.03GB path /dev/sda9
devid 2 size 10.00GB used 2.01GB path /dev/sda10
# btrfs device scan /dev/sda9 /dev/sda10
# mount /dev/sda9 /mnt
# dd if=/dev/zero of=tmpfile0 bs=4K count=9999999999
(fill the filesystem)
# sync
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 5.4G 62% /mnt
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 3.99GB
devid 1 size 5.01GB used 5.01GB path /dev/sda9
devid 2 size 10.00GB used 4.99GB path /dev/sda10
It is because btrfs cannot allocate chunks when one of the pairing disks has
no space, the free space on the other disks can not be used for ever, and should
be subtracted from the total space, but btrfs doesn't subtract this space from
the total. It is strange to the user.
This patch fixes it by calcing the free space that can be used to allocate
chunks.
Implementation:
1. get all the devices free space, and align them by stripe length.
2. sort the devices by the free space.
3. check the free space of the devices,
3.1. if it is not zero, and then check the number of the devices that has
more free space than this device,
if the number of the devices is beyond the min stripe number, the free
space can be used, and add into total free space.
if the number of the devices is below the min stripe number, we can not
use the free space, the check ends.
3.2. if the free space is zero, check the next devices, goto 3.1
This implementation is just likely fake chunk allocation.
After appling this patch, df can show correct space information:
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 0 100% /mnt
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-01-05 10:07:31 +00:00
|
|
|
devices_info[i].dev = device;
|
|
|
|
devices_info[i].max_avail = avail_space;
|
|
|
|
|
|
|
|
i++;
|
|
|
|
}
|
2014-11-03 13:56:50 +00:00
|
|
|
rcu_read_unlock();
|
btrfs: fix wrong free space information of btrfs
When we store data by raid profile in btrfs with two or more different size
disks, df command shows there is some free space in the filesystem, but the
user can not write any data in fact, df command shows the wrong free space
information of btrfs.
# mkfs.btrfs -d raid1 /dev/sda9 /dev/sda10
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 28.00KB
devid 1 size 5.01GB used 2.03GB path /dev/sda9
devid 2 size 10.00GB used 2.01GB path /dev/sda10
# btrfs device scan /dev/sda9 /dev/sda10
# mount /dev/sda9 /mnt
# dd if=/dev/zero of=tmpfile0 bs=4K count=9999999999
(fill the filesystem)
# sync
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 5.4G 62% /mnt
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 3.99GB
devid 1 size 5.01GB used 5.01GB path /dev/sda9
devid 2 size 10.00GB used 4.99GB path /dev/sda10
It is because btrfs cannot allocate chunks when one of the pairing disks has
no space, the free space on the other disks can not be used for ever, and should
be subtracted from the total space, but btrfs doesn't subtract this space from
the total. It is strange to the user.
This patch fixes it by calcing the free space that can be used to allocate
chunks.
Implementation:
1. get all the devices free space, and align them by stripe length.
2. sort the devices by the free space.
3. check the free space of the devices,
3.1. if it is not zero, and then check the number of the devices that has
more free space than this device,
if the number of the devices is beyond the min stripe number, the free
space can be used, and add into total free space.
if the number of the devices is below the min stripe number, we can not
use the free space, the check ends.
3.2. if the free space is zero, check the next devices, goto 3.1
This implementation is just likely fake chunk allocation.
After appling this patch, df can show correct space information:
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 0 100% /mnt
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-01-05 10:07:31 +00:00
|
|
|
|
|
|
|
nr_devices = i;
|
|
|
|
|
|
|
|
btrfs_descending_sort_devices(devices_info, nr_devices);
|
|
|
|
|
|
|
|
i = nr_devices - 1;
|
|
|
|
avail_space = 0;
|
2019-07-03 12:32:59 +00:00
|
|
|
while (nr_devices >= rattr->devs_min) {
|
|
|
|
num_stripes = min(num_stripes, nr_devices);
|
2011-12-15 01:12:02 +00:00
|
|
|
|
btrfs: fix wrong free space information of btrfs
When we store data by raid profile in btrfs with two or more different size
disks, df command shows there is some free space in the filesystem, but the
user can not write any data in fact, df command shows the wrong free space
information of btrfs.
# mkfs.btrfs -d raid1 /dev/sda9 /dev/sda10
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 28.00KB
devid 1 size 5.01GB used 2.03GB path /dev/sda9
devid 2 size 10.00GB used 2.01GB path /dev/sda10
# btrfs device scan /dev/sda9 /dev/sda10
# mount /dev/sda9 /mnt
# dd if=/dev/zero of=tmpfile0 bs=4K count=9999999999
(fill the filesystem)
# sync
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 5.4G 62% /mnt
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 3.99GB
devid 1 size 5.01GB used 5.01GB path /dev/sda9
devid 2 size 10.00GB used 4.99GB path /dev/sda10
It is because btrfs cannot allocate chunks when one of the pairing disks has
no space, the free space on the other disks can not be used for ever, and should
be subtracted from the total space, but btrfs doesn't subtract this space from
the total. It is strange to the user.
This patch fixes it by calcing the free space that can be used to allocate
chunks.
Implementation:
1. get all the devices free space, and align them by stripe length.
2. sort the devices by the free space.
3. check the free space of the devices,
3.1. if it is not zero, and then check the number of the devices that has
more free space than this device,
if the number of the devices is beyond the min stripe number, the free
space can be used, and add into total free space.
if the number of the devices is below the min stripe number, we can not
use the free space, the check ends.
3.2. if the free space is zero, check the next devices, goto 3.1
This implementation is just likely fake chunk allocation.
After appling this patch, df can show correct space information:
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 0 100% /mnt
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-01-05 10:07:31 +00:00
|
|
|
if (devices_info[i].max_avail >= min_stripe_size) {
|
|
|
|
int j;
|
|
|
|
u64 alloc_size;
|
|
|
|
|
2011-12-15 01:12:02 +00:00
|
|
|
avail_space += devices_info[i].max_avail * num_stripes;
|
btrfs: fix wrong free space information of btrfs
When we store data by raid profile in btrfs with two or more different size
disks, df command shows there is some free space in the filesystem, but the
user can not write any data in fact, df command shows the wrong free space
information of btrfs.
# mkfs.btrfs -d raid1 /dev/sda9 /dev/sda10
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 28.00KB
devid 1 size 5.01GB used 2.03GB path /dev/sda9
devid 2 size 10.00GB used 2.01GB path /dev/sda10
# btrfs device scan /dev/sda9 /dev/sda10
# mount /dev/sda9 /mnt
# dd if=/dev/zero of=tmpfile0 bs=4K count=9999999999
(fill the filesystem)
# sync
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 5.4G 62% /mnt
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 3.99GB
devid 1 size 5.01GB used 5.01GB path /dev/sda9
devid 2 size 10.00GB used 4.99GB path /dev/sda10
It is because btrfs cannot allocate chunks when one of the pairing disks has
no space, the free space on the other disks can not be used for ever, and should
be subtracted from the total space, but btrfs doesn't subtract this space from
the total. It is strange to the user.
This patch fixes it by calcing the free space that can be used to allocate
chunks.
Implementation:
1. get all the devices free space, and align them by stripe length.
2. sort the devices by the free space.
3. check the free space of the devices,
3.1. if it is not zero, and then check the number of the devices that has
more free space than this device,
if the number of the devices is beyond the min stripe number, the free
space can be used, and add into total free space.
if the number of the devices is below the min stripe number, we can not
use the free space, the check ends.
3.2. if the free space is zero, check the next devices, goto 3.1
This implementation is just likely fake chunk allocation.
After appling this patch, df can show correct space information:
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 0 100% /mnt
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-01-05 10:07:31 +00:00
|
|
|
alloc_size = devices_info[i].max_avail;
|
2011-12-15 01:12:02 +00:00
|
|
|
for (j = i + 1 - num_stripes; j <= i; j++)
|
btrfs: fix wrong free space information of btrfs
When we store data by raid profile in btrfs with two or more different size
disks, df command shows there is some free space in the filesystem, but the
user can not write any data in fact, df command shows the wrong free space
information of btrfs.
# mkfs.btrfs -d raid1 /dev/sda9 /dev/sda10
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 28.00KB
devid 1 size 5.01GB used 2.03GB path /dev/sda9
devid 2 size 10.00GB used 2.01GB path /dev/sda10
# btrfs device scan /dev/sda9 /dev/sda10
# mount /dev/sda9 /mnt
# dd if=/dev/zero of=tmpfile0 bs=4K count=9999999999
(fill the filesystem)
# sync
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 5.4G 62% /mnt
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 3.99GB
devid 1 size 5.01GB used 5.01GB path /dev/sda9
devid 2 size 10.00GB used 4.99GB path /dev/sda10
It is because btrfs cannot allocate chunks when one of the pairing disks has
no space, the free space on the other disks can not be used for ever, and should
be subtracted from the total space, but btrfs doesn't subtract this space from
the total. It is strange to the user.
This patch fixes it by calcing the free space that can be used to allocate
chunks.
Implementation:
1. get all the devices free space, and align them by stripe length.
2. sort the devices by the free space.
3. check the free space of the devices,
3.1. if it is not zero, and then check the number of the devices that has
more free space than this device,
if the number of the devices is beyond the min stripe number, the free
space can be used, and add into total free space.
if the number of the devices is below the min stripe number, we can not
use the free space, the check ends.
3.2. if the free space is zero, check the next devices, goto 3.1
This implementation is just likely fake chunk allocation.
After appling this patch, df can show correct space information:
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 0 100% /mnt
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-01-05 10:07:31 +00:00
|
|
|
devices_info[j].max_avail -= alloc_size;
|
|
|
|
}
|
|
|
|
i--;
|
|
|
|
nr_devices--;
|
|
|
|
}
|
|
|
|
|
|
|
|
kfree(devices_info);
|
|
|
|
*free_bytes = avail_space;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2014-07-01 14:21:33 +00:00
|
|
|
/*
|
|
|
|
* Calculate numbers for 'df', pessimistic in case of mixed raid profiles.
|
|
|
|
*
|
|
|
|
* If there's a redundant raid level at DATA block groups, use the respective
|
|
|
|
* multiplier to scale the sizes.
|
|
|
|
*
|
|
|
|
* Unused device space usage is based on simulating the chunk allocator
|
2017-06-14 23:30:06 +00:00
|
|
|
* algorithm that respects the device sizes and order of allocations. This is
|
|
|
|
* a close approximation of the actual use but there are other factors that may
|
|
|
|
* change the result (like a new metadata chunk).
|
2014-07-01 14:21:33 +00:00
|
|
|
*
|
2015-10-10 15:59:53 +00:00
|
|
|
* If metadata is exhausted, f_bavail will be 0.
|
2014-07-01 14:21:33 +00:00
|
|
|
*/
|
2007-04-20 01:01:03 +00:00
|
|
|
static int btrfs_statfs(struct dentry *dentry, struct kstatfs *buf)
|
|
|
|
{
|
2011-11-17 20:40:49 +00:00
|
|
|
struct btrfs_fs_info *fs_info = btrfs_sb(dentry->d_sb);
|
|
|
|
struct btrfs_super_block *disk_super = fs_info->super_copy;
|
Btrfs: make df be a little bit more understandable
The way we report df usage is way confusing for everybody, including some other
utilities (bacula for one). So this patch makes df a little bit more
understandable. First we make used actually count the total amount of used
space in all space info's. This will give us a real view of how much disk space
is in use. Second, for blocks available, only count data space. This makes
things like bacula work because it says 0 when you can no longer write anymore
data to the disk. I think this is a nice compromise, since you will end up with
something like the following
[root@alpha ~]# df -h
Filesystem Size Used Avail Use% Mounted on
/dev/mapper/VolGroup-lv_root
148G 30G 111G 21% /
/dev/sda1 194M 116M 68M 64% /boot
tmpfs 985M 12K 985M 1% /dev/shm
/dev/mapper/VolGroup-LogVol02
145G 140G 0 100% /mnt/btrfs-test
Compare this with btrfsctl -i output
[root@alpha btrfs-progs-unstable]# ./btrfsctl -i /mnt/btrfs-test/
Metadata, DUP: total=4.62GB, used=2.46GB
System, DUP: total=8.00MB, used=24.00KB
Data: total=134.80GB, used=134.80GB
Metadata: total=8.00MB, used=0.00
System: total=4.00MB, used=0.00
operation complete
This way we show that there is no more data space to be used, but we have
another 5GB of space left for metadata. Thanks,
Signed-off-by: Josef Bacik <josef@redhat.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2010-03-05 21:59:21 +00:00
|
|
|
struct btrfs_space_info *found;
|
|
|
|
u64 total_used = 0;
|
btrfs: fix wrong free space information of btrfs
When we store data by raid profile in btrfs with two or more different size
disks, df command shows there is some free space in the filesystem, but the
user can not write any data in fact, df command shows the wrong free space
information of btrfs.
# mkfs.btrfs -d raid1 /dev/sda9 /dev/sda10
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 28.00KB
devid 1 size 5.01GB used 2.03GB path /dev/sda9
devid 2 size 10.00GB used 2.01GB path /dev/sda10
# btrfs device scan /dev/sda9 /dev/sda10
# mount /dev/sda9 /mnt
# dd if=/dev/zero of=tmpfile0 bs=4K count=9999999999
(fill the filesystem)
# sync
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 5.4G 62% /mnt
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 3.99GB
devid 1 size 5.01GB used 5.01GB path /dev/sda9
devid 2 size 10.00GB used 4.99GB path /dev/sda10
It is because btrfs cannot allocate chunks when one of the pairing disks has
no space, the free space on the other disks can not be used for ever, and should
be subtracted from the total space, but btrfs doesn't subtract this space from
the total. It is strange to the user.
This patch fixes it by calcing the free space that can be used to allocate
chunks.
Implementation:
1. get all the devices free space, and align them by stripe length.
2. sort the devices by the free space.
3. check the free space of the devices,
3.1. if it is not zero, and then check the number of the devices that has
more free space than this device,
if the number of the devices is beyond the min stripe number, the free
space can be used, and add into total free space.
if the number of the devices is below the min stripe number, we can not
use the free space, the check ends.
3.2. if the free space is zero, check the next devices, goto 3.1
This implementation is just likely fake chunk allocation.
After appling this patch, df can show correct space information:
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 0 100% /mnt
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-01-05 10:07:31 +00:00
|
|
|
u64 total_free_data = 0;
|
2015-10-10 15:59:53 +00:00
|
|
|
u64 total_free_meta = 0;
|
2020-07-01 19:19:09 +00:00
|
|
|
u32 bits = fs_info->sectorsize_bits;
|
2018-10-30 14:43:24 +00:00
|
|
|
__be32 *fsid = (__be32 *)fs_info->fs_devices->fsid;
|
2014-07-01 14:21:33 +00:00
|
|
|
unsigned factor = 1;
|
|
|
|
struct btrfs_block_rsv *block_rsv = &fs_info->global_block_rsv;
|
btrfs: fix wrong free space information of btrfs
When we store data by raid profile in btrfs with two or more different size
disks, df command shows there is some free space in the filesystem, but the
user can not write any data in fact, df command shows the wrong free space
information of btrfs.
# mkfs.btrfs -d raid1 /dev/sda9 /dev/sda10
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 28.00KB
devid 1 size 5.01GB used 2.03GB path /dev/sda9
devid 2 size 10.00GB used 2.01GB path /dev/sda10
# btrfs device scan /dev/sda9 /dev/sda10
# mount /dev/sda9 /mnt
# dd if=/dev/zero of=tmpfile0 bs=4K count=9999999999
(fill the filesystem)
# sync
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 5.4G 62% /mnt
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 3.99GB
devid 1 size 5.01GB used 5.01GB path /dev/sda9
devid 2 size 10.00GB used 4.99GB path /dev/sda10
It is because btrfs cannot allocate chunks when one of the pairing disks has
no space, the free space on the other disks can not be used for ever, and should
be subtracted from the total space, but btrfs doesn't subtract this space from
the total. It is strange to the user.
This patch fixes it by calcing the free space that can be used to allocate
chunks.
Implementation:
1. get all the devices free space, and align them by stripe length.
2. sort the devices by the free space.
3. check the free space of the devices,
3.1. if it is not zero, and then check the number of the devices that has
more free space than this device,
if the number of the devices is beyond the min stripe number, the free
space can be used, and add into total free space.
if the number of the devices is below the min stripe number, we can not
use the free space, the check ends.
3.2. if the free space is zero, check the next devices, goto 3.1
This implementation is just likely fake chunk allocation.
After appling this patch, df can show correct space information:
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 0 100% /mnt
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-01-05 10:07:31 +00:00
|
|
|
int ret;
|
2015-10-10 15:59:53 +00:00
|
|
|
u64 thresh = 0;
|
2016-03-30 20:53:38 +00:00
|
|
|
int mixed = 0;
|
2007-04-20 01:01:03 +00:00
|
|
|
|
2020-09-01 21:40:37 +00:00
|
|
|
list_for_each_entry(found, &fs_info->space_info, list) {
|
btrfs: fix wrong free space information of btrfs
When we store data by raid profile in btrfs with two or more different size
disks, df command shows there is some free space in the filesystem, but the
user can not write any data in fact, df command shows the wrong free space
information of btrfs.
# mkfs.btrfs -d raid1 /dev/sda9 /dev/sda10
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 28.00KB
devid 1 size 5.01GB used 2.03GB path /dev/sda9
devid 2 size 10.00GB used 2.01GB path /dev/sda10
# btrfs device scan /dev/sda9 /dev/sda10
# mount /dev/sda9 /mnt
# dd if=/dev/zero of=tmpfile0 bs=4K count=9999999999
(fill the filesystem)
# sync
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 5.4G 62% /mnt
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 3.99GB
devid 1 size 5.01GB used 5.01GB path /dev/sda9
devid 2 size 10.00GB used 4.99GB path /dev/sda10
It is because btrfs cannot allocate chunks when one of the pairing disks has
no space, the free space on the other disks can not be used for ever, and should
be subtracted from the total space, but btrfs doesn't subtract this space from
the total. It is strange to the user.
This patch fixes it by calcing the free space that can be used to allocate
chunks.
Implementation:
1. get all the devices free space, and align them by stripe length.
2. sort the devices by the free space.
3. check the free space of the devices,
3.1. if it is not zero, and then check the number of the devices that has
more free space than this device,
if the number of the devices is beyond the min stripe number, the free
space can be used, and add into total free space.
if the number of the devices is below the min stripe number, we can not
use the free space, the check ends.
3.2. if the free space is zero, check the next devices, goto 3.1
This implementation is just likely fake chunk allocation.
After appling this patch, df can show correct space information:
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 0 100% /mnt
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-01-05 10:07:31 +00:00
|
|
|
if (found->flags & BTRFS_BLOCK_GROUP_DATA) {
|
2014-07-01 14:21:33 +00:00
|
|
|
int i;
|
|
|
|
|
btrfs: fix wrong free space information of btrfs
When we store data by raid profile in btrfs with two or more different size
disks, df command shows there is some free space in the filesystem, but the
user can not write any data in fact, df command shows the wrong free space
information of btrfs.
# mkfs.btrfs -d raid1 /dev/sda9 /dev/sda10
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 28.00KB
devid 1 size 5.01GB used 2.03GB path /dev/sda9
devid 2 size 10.00GB used 2.01GB path /dev/sda10
# btrfs device scan /dev/sda9 /dev/sda10
# mount /dev/sda9 /mnt
# dd if=/dev/zero of=tmpfile0 bs=4K count=9999999999
(fill the filesystem)
# sync
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 5.4G 62% /mnt
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 3.99GB
devid 1 size 5.01GB used 5.01GB path /dev/sda9
devid 2 size 10.00GB used 4.99GB path /dev/sda10
It is because btrfs cannot allocate chunks when one of the pairing disks has
no space, the free space on the other disks can not be used for ever, and should
be subtracted from the total space, but btrfs doesn't subtract this space from
the total. It is strange to the user.
This patch fixes it by calcing the free space that can be used to allocate
chunks.
Implementation:
1. get all the devices free space, and align them by stripe length.
2. sort the devices by the free space.
3. check the free space of the devices,
3.1. if it is not zero, and then check the number of the devices that has
more free space than this device,
if the number of the devices is beyond the min stripe number, the free
space can be used, and add into total free space.
if the number of the devices is below the min stripe number, we can not
use the free space, the check ends.
3.2. if the free space is zero, check the next devices, goto 3.1
This implementation is just likely fake chunk allocation.
After appling this patch, df can show correct space information:
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 0 100% /mnt
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-01-05 10:07:31 +00:00
|
|
|
total_free_data += found->disk_total - found->disk_used;
|
|
|
|
total_free_data -=
|
|
|
|
btrfs_account_ro_block_groups_free_space(found);
|
2014-07-01 14:21:33 +00:00
|
|
|
|
|
|
|
for (i = 0; i < BTRFS_NR_RAID_TYPES; i++) {
|
2018-07-13 18:46:30 +00:00
|
|
|
if (!list_empty(&found->block_groups[i]))
|
|
|
|
factor = btrfs_bg_type_to_factor(
|
|
|
|
btrfs_raid_array[i].bg_flag);
|
2014-07-01 14:21:33 +00:00
|
|
|
}
|
btrfs: fix wrong free space information of btrfs
When we store data by raid profile in btrfs with two or more different size
disks, df command shows there is some free space in the filesystem, but the
user can not write any data in fact, df command shows the wrong free space
information of btrfs.
# mkfs.btrfs -d raid1 /dev/sda9 /dev/sda10
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 28.00KB
devid 1 size 5.01GB used 2.03GB path /dev/sda9
devid 2 size 10.00GB used 2.01GB path /dev/sda10
# btrfs device scan /dev/sda9 /dev/sda10
# mount /dev/sda9 /mnt
# dd if=/dev/zero of=tmpfile0 bs=4K count=9999999999
(fill the filesystem)
# sync
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 5.4G 62% /mnt
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 3.99GB
devid 1 size 5.01GB used 5.01GB path /dev/sda9
devid 2 size 10.00GB used 4.99GB path /dev/sda10
It is because btrfs cannot allocate chunks when one of the pairing disks has
no space, the free space on the other disks can not be used for ever, and should
be subtracted from the total space, but btrfs doesn't subtract this space from
the total. It is strange to the user.
This patch fixes it by calcing the free space that can be used to allocate
chunks.
Implementation:
1. get all the devices free space, and align them by stripe length.
2. sort the devices by the free space.
3. check the free space of the devices,
3.1. if it is not zero, and then check the number of the devices that has
more free space than this device,
if the number of the devices is beyond the min stripe number, the free
space can be used, and add into total free space.
if the number of the devices is below the min stripe number, we can not
use the free space, the check ends.
3.2. if the free space is zero, check the next devices, goto 3.1
This implementation is just likely fake chunk allocation.
After appling this patch, df can show correct space information:
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 0 100% /mnt
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-01-05 10:07:31 +00:00
|
|
|
}
|
2016-03-30 20:53:38 +00:00
|
|
|
|
|
|
|
/*
|
2023-01-17 10:03:21 +00:00
|
|
|
* Metadata in mixed block group profiles are accounted in data
|
2016-03-30 20:53:38 +00:00
|
|
|
*/
|
|
|
|
if (!mixed && found->flags & BTRFS_BLOCK_GROUP_METADATA) {
|
|
|
|
if (found->flags & BTRFS_BLOCK_GROUP_DATA)
|
|
|
|
mixed = 1;
|
|
|
|
else
|
|
|
|
total_free_meta += found->disk_total -
|
|
|
|
found->disk_used;
|
|
|
|
}
|
btrfs: fix wrong free space information of btrfs
When we store data by raid profile in btrfs with two or more different size
disks, df command shows there is some free space in the filesystem, but the
user can not write any data in fact, df command shows the wrong free space
information of btrfs.
# mkfs.btrfs -d raid1 /dev/sda9 /dev/sda10
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 28.00KB
devid 1 size 5.01GB used 2.03GB path /dev/sda9
devid 2 size 10.00GB used 2.01GB path /dev/sda10
# btrfs device scan /dev/sda9 /dev/sda10
# mount /dev/sda9 /mnt
# dd if=/dev/zero of=tmpfile0 bs=4K count=9999999999
(fill the filesystem)
# sync
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 5.4G 62% /mnt
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 3.99GB
devid 1 size 5.01GB used 5.01GB path /dev/sda9
devid 2 size 10.00GB used 4.99GB path /dev/sda10
It is because btrfs cannot allocate chunks when one of the pairing disks has
no space, the free space on the other disks can not be used for ever, and should
be subtracted from the total space, but btrfs doesn't subtract this space from
the total. It is strange to the user.
This patch fixes it by calcing the free space that can be used to allocate
chunks.
Implementation:
1. get all the devices free space, and align them by stripe length.
2. sort the devices by the free space.
3. check the free space of the devices,
3.1. if it is not zero, and then check the number of the devices that has
more free space than this device,
if the number of the devices is beyond the min stripe number, the free
space can be used, and add into total free space.
if the number of the devices is below the min stripe number, we can not
use the free space, the check ends.
3.2. if the free space is zero, check the next devices, goto 3.1
This implementation is just likely fake chunk allocation.
After appling this patch, df can show correct space information:
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 0 100% /mnt
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-01-05 10:07:31 +00:00
|
|
|
|
2010-05-16 14:46:24 +00:00
|
|
|
total_used += found->disk_used;
|
2010-10-14 18:52:27 +00:00
|
|
|
}
|
2014-07-01 14:21:33 +00:00
|
|
|
|
|
|
|
buf->f_blocks = div_u64(btrfs_super_total_bytes(disk_super), factor);
|
|
|
|
buf->f_blocks >>= bits;
|
|
|
|
buf->f_bfree = buf->f_blocks - (div_u64(total_used, factor) >> bits);
|
|
|
|
|
|
|
|
/* Account global block reserve as used, it's in logical size already */
|
|
|
|
spin_lock(&block_rsv->lock);
|
2016-03-30 22:18:14 +00:00
|
|
|
/* Mixed block groups accounting is not byte-accurate, avoid overflow */
|
|
|
|
if (buf->f_bfree >= block_rsv->size >> bits)
|
|
|
|
buf->f_bfree -= block_rsv->size >> bits;
|
|
|
|
else
|
|
|
|
buf->f_bfree = 0;
|
2014-07-01 14:21:33 +00:00
|
|
|
spin_unlock(&block_rsv->lock);
|
|
|
|
|
2014-11-14 14:05:06 +00:00
|
|
|
buf->f_bavail = div_u64(total_free_data, factor);
|
2016-06-22 01:16:51 +00:00
|
|
|
ret = btrfs_calc_avail_data_space(fs_info, &total_free_data);
|
2014-11-03 13:56:50 +00:00
|
|
|
if (ret)
|
btrfs: fix wrong free space information of btrfs
When we store data by raid profile in btrfs with two or more different size
disks, df command shows there is some free space in the filesystem, but the
user can not write any data in fact, df command shows the wrong free space
information of btrfs.
# mkfs.btrfs -d raid1 /dev/sda9 /dev/sda10
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 28.00KB
devid 1 size 5.01GB used 2.03GB path /dev/sda9
devid 2 size 10.00GB used 2.01GB path /dev/sda10
# btrfs device scan /dev/sda9 /dev/sda10
# mount /dev/sda9 /mnt
# dd if=/dev/zero of=tmpfile0 bs=4K count=9999999999
(fill the filesystem)
# sync
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 5.4G 62% /mnt
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 3.99GB
devid 1 size 5.01GB used 5.01GB path /dev/sda9
devid 2 size 10.00GB used 4.99GB path /dev/sda10
It is because btrfs cannot allocate chunks when one of the pairing disks has
no space, the free space on the other disks can not be used for ever, and should
be subtracted from the total space, but btrfs doesn't subtract this space from
the total. It is strange to the user.
This patch fixes it by calcing the free space that can be used to allocate
chunks.
Implementation:
1. get all the devices free space, and align them by stripe length.
2. sort the devices by the free space.
3. check the free space of the devices,
3.1. if it is not zero, and then check the number of the devices that has
more free space than this device,
if the number of the devices is beyond the min stripe number, the free
space can be used, and add into total free space.
if the number of the devices is below the min stripe number, we can not
use the free space, the check ends.
3.2. if the free space is zero, check the next devices, goto 3.1
This implementation is just likely fake chunk allocation.
After appling this patch, df can show correct space information:
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 0 100% /mnt
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-01-05 10:07:31 +00:00
|
|
|
return ret;
|
2014-07-01 14:21:33 +00:00
|
|
|
buf->f_bavail += div_u64(total_free_data, factor);
|
btrfs: fix wrong free space information of btrfs
When we store data by raid profile in btrfs with two or more different size
disks, df command shows there is some free space in the filesystem, but the
user can not write any data in fact, df command shows the wrong free space
information of btrfs.
# mkfs.btrfs -d raid1 /dev/sda9 /dev/sda10
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 28.00KB
devid 1 size 5.01GB used 2.03GB path /dev/sda9
devid 2 size 10.00GB used 2.01GB path /dev/sda10
# btrfs device scan /dev/sda9 /dev/sda10
# mount /dev/sda9 /mnt
# dd if=/dev/zero of=tmpfile0 bs=4K count=9999999999
(fill the filesystem)
# sync
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 5.4G 62% /mnt
# btrfs-show
Label: none uuid: a95cd49e-6e33-45b8-8741-a36153ce4b64
Total devices 2 FS bytes used 3.99GB
devid 1 size 5.01GB used 5.01GB path /dev/sda9
devid 2 size 10.00GB used 4.99GB path /dev/sda10
It is because btrfs cannot allocate chunks when one of the pairing disks has
no space, the free space on the other disks can not be used for ever, and should
be subtracted from the total space, but btrfs doesn't subtract this space from
the total. It is strange to the user.
This patch fixes it by calcing the free space that can be used to allocate
chunks.
Implementation:
1. get all the devices free space, and align them by stripe length.
2. sort the devices by the free space.
3. check the free space of the devices,
3.1. if it is not zero, and then check the number of the devices that has
more free space than this device,
if the number of the devices is beyond the min stripe number, the free
space can be used, and add into total free space.
if the number of the devices is below the min stripe number, we can not
use the free space, the check ends.
3.2. if the free space is zero, check the next devices, goto 3.1
This implementation is just likely fake chunk allocation.
After appling this patch, df can show correct space information:
# df -TH
Filesystem Type Size Used Avail Use% Mounted on
/dev/sda9 btrfs 17G 8.6G 0 100% /mnt
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2011-01-05 10:07:31 +00:00
|
|
|
buf->f_bavail = buf->f_bavail >> bits;
|
2009-01-06 02:25:51 +00:00
|
|
|
|
2015-10-10 15:59:53 +00:00
|
|
|
/*
|
|
|
|
* We calculate the remaining metadata space minus global reserve. If
|
|
|
|
* this is (supposedly) smaller than zero, there's no space. But this
|
|
|
|
* does not hold in practice, the exhausted state happens where's still
|
|
|
|
* some positive delta. So we apply some guesswork and compare the
|
|
|
|
* delta to a 4M threshold. (Practically observed delta was ~2M.)
|
|
|
|
*
|
|
|
|
* We probably cannot calculate the exact threshold value because this
|
|
|
|
* depends on the internal reservations requested by various
|
|
|
|
* operations, so some operations that consume a few metadata will
|
|
|
|
* succeed even if the Avail is zero. But this is better than the other
|
|
|
|
* way around.
|
|
|
|
*/
|
2017-10-16 13:48:40 +00:00
|
|
|
thresh = SZ_4M;
|
2015-10-10 15:59:53 +00:00
|
|
|
|
2020-01-31 14:31:05 +00:00
|
|
|
/*
|
|
|
|
* We only want to claim there's no available space if we can no longer
|
|
|
|
* allocate chunks for our metadata profile and our global reserve will
|
|
|
|
* not fit in the free metadata space. If we aren't ->full then we
|
|
|
|
* still can allocate chunks and thus are fine using the currently
|
|
|
|
* calculated f_bavail.
|
|
|
|
*/
|
|
|
|
if (!mixed && block_rsv->space_info->full &&
|
2023-09-18 14:34:51 +00:00
|
|
|
(total_free_meta < thresh || total_free_meta - thresh < block_rsv->size))
|
2015-10-10 15:59:53 +00:00
|
|
|
buf->f_bavail = 0;
|
|
|
|
|
2014-07-01 14:21:33 +00:00
|
|
|
buf->f_type = BTRFS_SUPER_MAGIC;
|
2024-01-16 16:33:20 +00:00
|
|
|
buf->f_bsize = fs_info->sectorsize;
|
2014-07-01 14:21:33 +00:00
|
|
|
buf->f_namelen = BTRFS_NAME_LEN;
|
|
|
|
|
2008-08-18 11:01:52 +00:00
|
|
|
/* We treat it as constant endianness (it doesn't matter _which_)
|
2009-01-06 02:25:51 +00:00
|
|
|
because we want the fsid to come out the same whether mounted
|
2008-08-18 11:01:52 +00:00
|
|
|
on a big-endian or little-endian host */
|
|
|
|
buf->f_fsid.val[0] = be32_to_cpu(fsid[0]) ^ be32_to_cpu(fsid[2]);
|
|
|
|
buf->f_fsid.val[1] = be32_to_cpu(fsid[1]) ^ be32_to_cpu(fsid[3]);
|
2008-08-18 12:10:20 +00:00
|
|
|
/* Mask in the root object ID too, to disambiguate subvols */
|
2024-04-15 20:16:23 +00:00
|
|
|
buf->f_fsid.val[0] ^= btrfs_root_id(BTRFS_I(d_inode(dentry))->root) >> 32;
|
|
|
|
buf->f_fsid.val[1] ^= btrfs_root_id(BTRFS_I(d_inode(dentry))->root);
|
2008-08-18 12:10:20 +00:00
|
|
|
|
2007-04-20 01:01:03 +00:00
|
|
|
return 0;
|
|
|
|
}
|
2007-04-24 15:52:22 +00:00
|
|
|
|
2023-11-22 17:17:48 +00:00
|
|
|
static int btrfs_fc_test_super(struct super_block *sb, struct fs_context *fc)
|
|
|
|
{
|
|
|
|
struct btrfs_fs_info *p = fc->s_fs_info;
|
|
|
|
struct btrfs_fs_info *fs_info = btrfs_sb(sb);
|
|
|
|
|
|
|
|
return fs_info->fs_devices == p->fs_devices;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int btrfs_get_tree_super(struct fs_context *fc)
|
|
|
|
{
|
|
|
|
struct btrfs_fs_info *fs_info = fc->s_fs_info;
|
|
|
|
struct btrfs_fs_context *ctx = fc->fs_private;
|
|
|
|
struct btrfs_fs_devices *fs_devices = NULL;
|
|
|
|
struct block_device *bdev;
|
|
|
|
struct btrfs_device *device;
|
|
|
|
struct super_block *sb;
|
for-6.8-tag
-----BEGIN PGP SIGNATURE-----
iQIzBAABCgAdFiEE8rQSAMVO+zA4DBdWxWXV+ddtWDsFAmWYTmMACgkQxWXV+ddt
WDvPRg/+KgS5LV3nNC0MguYcTMQxmgeutIgXZIMfeA3v6EnFS7nj8leP4EPc6+bj
JPSkwj4u2vHVwpnTVuEAuJUXnmFY+Qu70nVy6bM2uOHOYTVBQ8zRVK4cErNNLWCp
OekDaADR53RrZ/xprlQ7b7Ph0Ch2uq9OrpH50IcyquEsH1ffkxlqwyrvth4/8dxC
6zgsFHWrbtVKJf0DYoQPpjEPz5tpdQ+xHZwtmf1cNlUgI1objODr/ZTqXtZqTfw4
/GwrtDPbEri53K/qjgr0dDH7pBVqD6PtnbgoHfYkiizZ0G7UkmlaK6rZIurtATJb
Yk/RCqCUp9tPC4yeFSewFMm1Y8Ae3rkUBG7rnYkvMmBspMqyh/kQAWSBimF5yk/y
vFEdFTe9AbdvP19Nw0CqovLzaO6RrOXCL1usnFvCmBgvF5gZAv63ZW1njP3ZoNta
wB8Rs6hxdRkph8Dk7yvYf54uUR+JyKqjHY6egg2qkKTjz0CSf6qQFyFZXpr81m97
gK4WN5SeP/P2ukRbBKKyzZ5IljUxZuVatvJa0tktd7kAbU26WLzofOJ7pX+iqimM
F2G7gKGJZykLY1WPntXBp9Dg97Ras2O5iViQ7ZKwRdOx1yZS5zzTYlIznHBAmXbL
UgXfVnpJH1xFdkvedNTn+Fz9BHNV1K2a2AT7VITj7sxz23z3aJA=
=4sw3
-----END PGP SIGNATURE-----
Merge tag 'for-6.8-tag' of git://git.kernel.org/pub/scm/linux/kernel/git/kdave/linux
Pull btrfs updates from David Sterba:
"There are no exciting changes for users, it's been mostly API
conversions and some fixes or refactoring.
The mount API conversion is a base for future improvements that would
come with VFS. Metadata processing has been converted to folios, not
yet enabling the large folios but it's one patch away once everything
gets tested enough.
Core changes:
- convert extent buffers to folios:
- direct API conversion where possible
- performance can drop by a few percent on metadata heavy
workloads, the folio sizes are not constant and the calculations
add up in the item helpers
- both regular and subpage modes
- data cannot be converted yet, we need to port that to iomap and
there are some other generic changes required
- convert mount to the new API, should not be user visible:
- options deprecated long time ago have been removed: inode_cache,
recovery
- the new logic that splits mount to two phases slightly changes
timing of device scanning for multi-device filesystems
- LSM options will now work (like for selinux)
- convert delayed nodes radix tree to xarray, preserving the
preload-like logic that still allows to allocate with GFP_NOFS
- more validation of sysfs value of scrub_speed_max
- refactor chunk map structure, reduce size and improve performance
- extent map refactoring, smaller data structures, improved
performance
- reduce size of struct extent_io_tree, embedded in several
structures
- temporary pages used for compression are cached and attached to a
shrinker, this may slightly improve performance
- in zoned mode, remove redirty extent buffer tracking, zeros are
written in case an out-of-order is detected and proper data are
written to the actual write pointer
- cleanups, refactoring, error message improvements, updated tests
- verify and update branch name or tag
- remove unwanted text"
* tag 'for-6.8-tag' of git://git.kernel.org/pub/scm/linux/kernel/git/kdave/linux: (89 commits)
btrfs: pass btrfs_io_geometry into btrfs_max_io_len
btrfs: pass struct btrfs_io_geometry to set_io_stripe
btrfs: open code set_io_stripe for RAID56
btrfs: change block mapping to switch/case in btrfs_map_block
btrfs: factor out block mapping for single profiles
btrfs: factor out block mapping for RAID5/6
btrfs: reduce scope of data_stripes in btrfs_map_block
btrfs: factor out block mapping for RAID10
btrfs: factor out block mapping for DUP profiles
btrfs: factor out RAID1 block mapping
btrfs: factor out block-mapping for RAID0
btrfs: re-introduce struct btrfs_io_geometry
btrfs: factor out helper for single device IO check
btrfs: migrate btrfs_repair_io_failure() to folio interfaces
btrfs: migrate eb_bitmap_offset() to folio interfaces
btrfs: migrate various end io functions to folios
btrfs: migrate subpage code to folio interfaces
btrfs: migrate get_eb_page_index() and get_eb_offset_in_page() to folios
btrfs: don't double put our subpage reference in alloc_extent_buffer
btrfs: cleanup metadata page pointer usage
...
2024-01-10 17:27:40 +00:00
|
|
|
blk_mode_t mode = btrfs_open_mode(fc);
|
2023-11-22 17:17:48 +00:00
|
|
|
int ret;
|
|
|
|
|
|
|
|
btrfs_ctx_to_info(fs_info, ctx);
|
|
|
|
mutex_lock(&uuid_mutex);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* With 'true' passed to btrfs_scan_one_device() (mount time) we expect
|
|
|
|
* either a valid device or an error.
|
|
|
|
*/
|
|
|
|
device = btrfs_scan_one_device(fc->source, mode, true);
|
|
|
|
ASSERT(device != NULL);
|
|
|
|
if (IS_ERR(device)) {
|
|
|
|
mutex_unlock(&uuid_mutex);
|
|
|
|
return PTR_ERR(device);
|
|
|
|
}
|
|
|
|
|
|
|
|
fs_devices = device->fs_devices;
|
|
|
|
fs_info->fs_devices = fs_devices;
|
|
|
|
|
|
|
|
ret = btrfs_open_devices(fs_devices, mode, &btrfs_fs_type);
|
|
|
|
mutex_unlock(&uuid_mutex);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
if (!(fc->sb_flags & SB_RDONLY) && fs_devices->rw_devices == 0) {
|
|
|
|
ret = -EACCES;
|
|
|
|
goto error;
|
|
|
|
}
|
|
|
|
|
|
|
|
bdev = fs_devices->latest_dev->bdev;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* From now on the error handling is not straightforward.
|
|
|
|
*
|
|
|
|
* If successful, this will transfer the fs_info into the super block,
|
|
|
|
* and fc->s_fs_info will be NULL. However if there's an existing
|
|
|
|
* super, we'll still have fc->s_fs_info populated. If we error
|
|
|
|
* completely out it'll be cleaned up when we drop the fs_context,
|
|
|
|
* otherwise it's tied to the lifetime of the super_block.
|
|
|
|
*/
|
|
|
|
sb = sget_fc(fc, btrfs_fc_test_super, set_anon_super_fc);
|
|
|
|
if (IS_ERR(sb)) {
|
|
|
|
ret = PTR_ERR(sb);
|
|
|
|
goto error;
|
|
|
|
}
|
|
|
|
|
2023-11-22 17:17:51 +00:00
|
|
|
set_device_specific_options(fs_info);
|
|
|
|
|
2023-11-22 17:17:48 +00:00
|
|
|
if (sb->s_root) {
|
|
|
|
btrfs_close_devices(fs_devices);
|
|
|
|
if ((fc->sb_flags ^ sb->s_flags) & SB_RDONLY)
|
|
|
|
ret = -EBUSY;
|
|
|
|
} else {
|
|
|
|
snprintf(sb->s_id, sizeof(sb->s_id), "%pg", bdev);
|
|
|
|
shrinker_debugfs_rename(sb->s_shrink, "sb-btrfs:%s", sb->s_id);
|
|
|
|
btrfs_sb(sb)->bdev_holder = &btrfs_fs_type;
|
|
|
|
ret = btrfs_fill_super(sb, fs_devices, NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (ret) {
|
|
|
|
deactivate_locked_super(sb);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2023-11-22 17:17:53 +00:00
|
|
|
btrfs_clear_oneshot_options(fs_info);
|
|
|
|
|
2023-11-22 17:17:48 +00:00
|
|
|
fc->root = dget(sb->s_root);
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
error:
|
|
|
|
btrfs_close_devices(fs_devices);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2023-11-22 17:17:49 +00:00
|
|
|
/*
|
|
|
|
* Ever since commit 0723a0473fb4 ("btrfs: allow mounting btrfs subvolumes
|
|
|
|
* with different ro/rw options") the following works:
|
|
|
|
*
|
|
|
|
* (i) mount /dev/sda3 -o subvol=foo,ro /mnt/foo
|
|
|
|
* (ii) mount /dev/sda3 -o subvol=bar,rw /mnt/bar
|
|
|
|
*
|
|
|
|
* which looks nice and innocent but is actually pretty intricate and deserves
|
|
|
|
* a long comment.
|
|
|
|
*
|
|
|
|
* On another filesystem a subvolume mount is close to something like:
|
|
|
|
*
|
|
|
|
* (iii) # create rw superblock + initial mount
|
|
|
|
* mount -t xfs /dev/sdb /opt/
|
|
|
|
*
|
|
|
|
* # create ro bind mount
|
|
|
|
* mount --bind -o ro /opt/foo /mnt/foo
|
|
|
|
*
|
|
|
|
* # unmount initial mount
|
|
|
|
* umount /opt
|
|
|
|
*
|
|
|
|
* Of course, there's some special subvolume sauce and there's the fact that the
|
|
|
|
* sb->s_root dentry is really swapped after mount_subtree(). But conceptually
|
|
|
|
* it's very close and will help us understand the issue.
|
|
|
|
*
|
|
|
|
* The old mount API didn't cleanly distinguish between a mount being made ro
|
|
|
|
* and a superblock being made ro. The only way to change the ro state of
|
|
|
|
* either object was by passing ms_rdonly. If a new mount was created via
|
|
|
|
* mount(2) such as:
|
|
|
|
*
|
|
|
|
* mount("/dev/sdb", "/mnt", "xfs", ms_rdonly, null);
|
|
|
|
*
|
|
|
|
* the MS_RDONLY flag being specified had two effects:
|
|
|
|
*
|
|
|
|
* (1) MNT_READONLY was raised -> the resulting mount got
|
|
|
|
* @mnt->mnt_flags |= MNT_READONLY raised.
|
|
|
|
*
|
|
|
|
* (2) MS_RDONLY was passed to the filesystem's mount method and the filesystems
|
|
|
|
* made the superblock ro. Note, how SB_RDONLY has the same value as
|
|
|
|
* ms_rdonly and is raised whenever MS_RDONLY is passed through mount(2).
|
|
|
|
*
|
|
|
|
* Creating a subtree mount via (iii) ends up leaving a rw superblock with a
|
|
|
|
* subtree mounted ro.
|
|
|
|
*
|
|
|
|
* But consider the effect on the old mount API on btrfs subvolume mounting
|
|
|
|
* which combines the distinct step in (iii) into a single step.
|
|
|
|
*
|
|
|
|
* By issuing (i) both the mount and the superblock are turned ro. Now when (ii)
|
|
|
|
* is issued the superblock is ro and thus even if the mount created for (ii) is
|
|
|
|
* rw it wouldn't help. Hence, btrfs needed to transition the superblock from ro
|
|
|
|
* to rw for (ii) which it did using an internal remount call.
|
|
|
|
*
|
|
|
|
* IOW, subvolume mounting was inherently complicated due to the ambiguity of
|
|
|
|
* MS_RDONLY in mount(2). Note, this ambiguity has mount(8) always translate
|
|
|
|
* "ro" to MS_RDONLY. IOW, in both (i) and (ii) "ro" becomes MS_RDONLY when
|
|
|
|
* passed by mount(8) to mount(2).
|
|
|
|
*
|
|
|
|
* Enter the new mount API. The new mount API disambiguates making a mount ro
|
|
|
|
* and making a superblock ro.
|
|
|
|
*
|
|
|
|
* (3) To turn a mount ro the MOUNT_ATTR_ONLY flag can be used with either
|
|
|
|
* fsmount() or mount_setattr() this is a pure VFS level change for a
|
|
|
|
* specific mount or mount tree that is never seen by the filesystem itself.
|
|
|
|
*
|
|
|
|
* (4) To turn a superblock ro the "ro" flag must be used with
|
|
|
|
* fsconfig(FSCONFIG_SET_FLAG, "ro"). This option is seen by the filesystem
|
|
|
|
* in fc->sb_flags.
|
|
|
|
*
|
|
|
|
* This disambiguation has rather positive consequences. Mounting a subvolume
|
|
|
|
* ro will not also turn the superblock ro. Only the mount for the subvolume
|
|
|
|
* will become ro.
|
|
|
|
*
|
|
|
|
* So, if the superblock creation request comes from the new mount API the
|
|
|
|
* caller must have explicitly done:
|
|
|
|
*
|
|
|
|
* fsconfig(FSCONFIG_SET_FLAG, "ro")
|
|
|
|
* fsmount/mount_setattr(MOUNT_ATTR_RDONLY)
|
|
|
|
*
|
|
|
|
* IOW, at some point the caller must have explicitly turned the whole
|
|
|
|
* superblock ro and we shouldn't just undo it like we did for the old mount
|
|
|
|
* API. In any case, it lets us avoid the hack in the new mount API.
|
|
|
|
*
|
|
|
|
* Consequently, the remounting hack must only be used for requests originating
|
|
|
|
* from the old mount API and should be marked for full deprecation so it can be
|
|
|
|
* turned off in a couple of years.
|
|
|
|
*
|
|
|
|
* The new mount API has no reason to support this hack.
|
|
|
|
*/
|
|
|
|
static struct vfsmount *btrfs_reconfigure_for_mount(struct fs_context *fc)
|
|
|
|
{
|
|
|
|
struct vfsmount *mnt;
|
|
|
|
int ret;
|
|
|
|
const bool ro2rw = !(fc->sb_flags & SB_RDONLY);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We got an EBUSY because our SB_RDONLY flag didn't match the existing
|
|
|
|
* super block, so invert our setting here and retry the mount so we
|
|
|
|
* can get our vfsmount.
|
|
|
|
*/
|
|
|
|
if (ro2rw)
|
|
|
|
fc->sb_flags |= SB_RDONLY;
|
|
|
|
else
|
|
|
|
fc->sb_flags &= ~SB_RDONLY;
|
|
|
|
|
|
|
|
mnt = fc_mount(fc);
|
|
|
|
if (IS_ERR(mnt))
|
|
|
|
return mnt;
|
|
|
|
|
|
|
|
if (!fc->oldapi || !ro2rw)
|
|
|
|
return mnt;
|
|
|
|
|
|
|
|
/* We need to convert to rw, call reconfigure. */
|
|
|
|
fc->sb_flags &= ~SB_RDONLY;
|
|
|
|
down_write(&mnt->mnt_sb->s_umount);
|
|
|
|
ret = btrfs_reconfigure(fc);
|
|
|
|
up_write(&mnt->mnt_sb->s_umount);
|
|
|
|
if (ret) {
|
|
|
|
mntput(mnt);
|
|
|
|
return ERR_PTR(ret);
|
|
|
|
}
|
|
|
|
return mnt;
|
|
|
|
}
|
|
|
|
|
2023-11-22 17:17:48 +00:00
|
|
|
static int btrfs_get_tree_subvol(struct fs_context *fc)
|
|
|
|
{
|
|
|
|
struct btrfs_fs_info *fs_info = NULL;
|
|
|
|
struct btrfs_fs_context *ctx = fc->fs_private;
|
|
|
|
struct fs_context *dup_fc;
|
|
|
|
struct dentry *dentry;
|
|
|
|
struct vfsmount *mnt;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Setup a dummy root and fs_info for test/set super. This is because
|
|
|
|
* we don't actually fill this stuff out until open_ctree, but we need
|
|
|
|
* then open_ctree will properly initialize the file system specific
|
|
|
|
* settings later. btrfs_init_fs_info initializes the static elements
|
|
|
|
* of the fs_info (locks and such) to make cleanup easier if we find a
|
|
|
|
* superblock with our given fs_devices later on at sget() time.
|
|
|
|
*/
|
|
|
|
fs_info = kvzalloc(sizeof(struct btrfs_fs_info), GFP_KERNEL);
|
|
|
|
if (!fs_info)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
fs_info->super_copy = kzalloc(BTRFS_SUPER_INFO_SIZE, GFP_KERNEL);
|
|
|
|
fs_info->super_for_commit = kzalloc(BTRFS_SUPER_INFO_SIZE, GFP_KERNEL);
|
|
|
|
if (!fs_info->super_copy || !fs_info->super_for_commit) {
|
|
|
|
btrfs_free_fs_info(fs_info);
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
btrfs_init_fs_info(fs_info);
|
|
|
|
|
|
|
|
dup_fc = vfs_dup_fs_context(fc);
|
|
|
|
if (IS_ERR(dup_fc)) {
|
|
|
|
btrfs_free_fs_info(fs_info);
|
|
|
|
return PTR_ERR(dup_fc);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* When we do the sget_fc this gets transferred to the sb, so we only
|
|
|
|
* need to set it on the dup_fc as this is what creates the super block.
|
|
|
|
*/
|
|
|
|
dup_fc->s_fs_info = fs_info;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We'll do the security settings in our btrfs_get_tree_super() mount
|
|
|
|
* loop, they were duplicated into dup_fc, we can drop the originals
|
|
|
|
* here.
|
|
|
|
*/
|
|
|
|
security_free_mnt_opts(&fc->security);
|
|
|
|
fc->security = NULL;
|
|
|
|
|
|
|
|
mnt = fc_mount(dup_fc);
|
2023-11-22 17:17:49 +00:00
|
|
|
if (PTR_ERR_OR_ZERO(mnt) == -EBUSY)
|
|
|
|
mnt = btrfs_reconfigure_for_mount(dup_fc);
|
2023-11-22 17:17:48 +00:00
|
|
|
put_fs_context(dup_fc);
|
|
|
|
if (IS_ERR(mnt))
|
|
|
|
return PTR_ERR(mnt);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This free's ->subvol_name, because if it isn't set we have to
|
|
|
|
* allocate a buffer to hold the subvol_name, so we just drop our
|
|
|
|
* reference to it here.
|
|
|
|
*/
|
|
|
|
dentry = mount_subvol(ctx->subvol_name, ctx->subvol_objectid, mnt);
|
|
|
|
ctx->subvol_name = NULL;
|
|
|
|
if (IS_ERR(dentry))
|
|
|
|
return PTR_ERR(dentry);
|
|
|
|
|
|
|
|
fc->root = dentry;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int btrfs_get_tree(struct fs_context *fc)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* Since we use mount_subtree to mount the default/specified subvol, we
|
|
|
|
* have to do mounts in two steps.
|
|
|
|
*
|
|
|
|
* First pass through we call btrfs_get_tree_subvol(), this is just a
|
|
|
|
* wrapper around fc_mount() to call back into here again, and this time
|
|
|
|
* we'll call btrfs_get_tree_super(). This will do the open_ctree() and
|
|
|
|
* everything to open the devices and file system. Then we return back
|
|
|
|
* with a fully constructed vfsmount in btrfs_get_tree_subvol(), and
|
|
|
|
* from there we can do our mount_subvol() call, which will lookup
|
|
|
|
* whichever subvol we're mounting and setup this fc with the
|
|
|
|
* appropriate dentry for the subvol.
|
|
|
|
*/
|
|
|
|
if (fc->s_fs_info)
|
|
|
|
return btrfs_get_tree_super(fc);
|
|
|
|
return btrfs_get_tree_subvol(fc);
|
|
|
|
}
|
|
|
|
|
2011-11-17 06:22:46 +00:00
|
|
|
static void btrfs_kill_super(struct super_block *sb)
|
|
|
|
{
|
2011-11-17 20:40:49 +00:00
|
|
|
struct btrfs_fs_info *fs_info = btrfs_sb(sb);
|
2011-11-17 06:22:46 +00:00
|
|
|
kill_anon_super(sb);
|
2020-01-24 14:32:53 +00:00
|
|
|
btrfs_free_fs_info(fs_info);
|
2011-11-17 06:22:46 +00:00
|
|
|
}
|
|
|
|
|
2023-11-22 17:17:46 +00:00
|
|
|
static void btrfs_free_fs_context(struct fs_context *fc)
|
|
|
|
{
|
|
|
|
struct btrfs_fs_context *ctx = fc->fs_private;
|
2023-11-22 17:17:48 +00:00
|
|
|
struct btrfs_fs_info *fs_info = fc->s_fs_info;
|
2023-11-22 17:17:46 +00:00
|
|
|
|
2023-11-22 17:17:48 +00:00
|
|
|
if (fs_info)
|
|
|
|
btrfs_free_fs_info(fs_info);
|
|
|
|
|
|
|
|
if (ctx && refcount_dec_and_test(&ctx->refs)) {
|
|
|
|
kfree(ctx->subvol_name);
|
|
|
|
kfree(ctx);
|
|
|
|
}
|
|
|
|
}
|
2023-11-22 17:17:46 +00:00
|
|
|
|
2023-11-22 17:17:48 +00:00
|
|
|
static int btrfs_dup_fs_context(struct fs_context *fc, struct fs_context *src_fc)
|
|
|
|
{
|
|
|
|
struct btrfs_fs_context *ctx = src_fc->fs_private;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Give a ref to our ctx to this dup, as we want to keep it around for
|
|
|
|
* our original fc so we can have the subvolume name or objectid.
|
|
|
|
*
|
|
|
|
* We unset ->source in the original fc because the dup needs it for
|
|
|
|
* mounting, and then once we free the dup it'll free ->source, so we
|
|
|
|
* need to make sure we're only pointing to it in one fc.
|
|
|
|
*/
|
|
|
|
refcount_inc(&ctx->refs);
|
|
|
|
fc->fs_private = ctx;
|
|
|
|
fc->source = src_fc->source;
|
|
|
|
src_fc->source = NULL;
|
|
|
|
return 0;
|
2023-11-22 17:17:46 +00:00
|
|
|
}
|
2017-12-14 08:24:30 +00:00
|
|
|
|
2023-11-22 17:17:46 +00:00
|
|
|
static const struct fs_context_operations btrfs_fs_context_ops = {
|
2023-11-22 17:17:45 +00:00
|
|
|
.parse_param = btrfs_parse_param,
|
2023-11-22 17:17:47 +00:00
|
|
|
.reconfigure = btrfs_reconfigure,
|
2023-11-22 17:17:48 +00:00
|
|
|
.get_tree = btrfs_get_tree,
|
|
|
|
.dup = btrfs_dup_fs_context,
|
2023-11-22 17:17:46 +00:00
|
|
|
.free = btrfs_free_fs_context,
|
2017-12-14 08:24:30 +00:00
|
|
|
};
|
|
|
|
|
2023-11-22 17:17:50 +00:00
|
|
|
static int btrfs_init_fs_context(struct fs_context *fc)
|
2023-11-22 17:17:46 +00:00
|
|
|
{
|
|
|
|
struct btrfs_fs_context *ctx;
|
|
|
|
|
|
|
|
ctx = kzalloc(sizeof(struct btrfs_fs_context), GFP_KERNEL);
|
|
|
|
if (!ctx)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
2023-11-22 17:17:48 +00:00
|
|
|
refcount_set(&ctx->refs, 1);
|
2023-11-22 17:17:46 +00:00
|
|
|
fc->fs_private = ctx;
|
|
|
|
fc->ops = &btrfs_fs_context_ops;
|
|
|
|
|
2023-11-22 17:17:47 +00:00
|
|
|
if (fc->purpose == FS_CONTEXT_FOR_RECONFIGURE) {
|
|
|
|
btrfs_info_to_ctx(btrfs_sb(fc->root->d_sb), ctx);
|
|
|
|
} else {
|
|
|
|
ctx->thread_pool_size =
|
|
|
|
min_t(unsigned long, num_online_cpus() + 2, 8);
|
|
|
|
ctx->max_inline = BTRFS_DEFAULT_MAX_INLINE;
|
|
|
|
ctx->commit_interval = BTRFS_DEFAULT_COMMIT_INTERVAL;
|
|
|
|
}
|
|
|
|
|
2023-11-22 17:17:50 +00:00
|
|
|
#ifdef CONFIG_BTRFS_FS_POSIX_ACL
|
|
|
|
fc->sb_flags |= SB_POSIXACL;
|
|
|
|
#endif
|
|
|
|
fc->sb_flags |= SB_I_VERSION;
|
|
|
|
|
2023-11-22 17:17:46 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-03-21 15:12:56 +00:00
|
|
|
static struct file_system_type btrfs_fs_type = {
|
2023-11-22 17:17:50 +00:00
|
|
|
.owner = THIS_MODULE,
|
|
|
|
.name = "btrfs",
|
|
|
|
.init_fs_context = btrfs_init_fs_context,
|
|
|
|
.parameters = btrfs_fs_parameters,
|
|
|
|
.kill_sb = btrfs_kill_super,
|
|
|
|
.fs_flags = FS_REQUIRES_DEV | FS_BINARY_MOUNTDATA | FS_ALLOW_IDMAP,
|
|
|
|
};
|
2017-12-14 08:24:30 +00:00
|
|
|
|
2013-03-03 03:39:14 +00:00
|
|
|
MODULE_ALIAS_FS("btrfs");
|
2008-03-24 19:02:04 +00:00
|
|
|
|
2015-03-24 15:35:49 +00:00
|
|
|
static int btrfs_control_open(struct inode *inode, struct file *file)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* The control file's private_data is used to hold the
|
|
|
|
* transaction when it is started and is used to keep
|
|
|
|
* track of whether a transaction is already in progress.
|
|
|
|
*/
|
|
|
|
file->private_data = NULL;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2008-09-29 19:18:18 +00:00
|
|
|
/*
|
2020-02-04 04:51:56 +00:00
|
|
|
* Used by /dev/btrfs-control for devices ioctls.
|
2008-09-29 19:18:18 +00:00
|
|
|
*/
|
2008-03-24 19:02:07 +00:00
|
|
|
static long btrfs_control_ioctl(struct file *file, unsigned int cmd,
|
|
|
|
unsigned long arg)
|
|
|
|
{
|
|
|
|
struct btrfs_ioctl_vol_args *vol;
|
2018-07-12 06:23:16 +00:00
|
|
|
struct btrfs_device *device = NULL;
|
2022-01-12 05:06:00 +00:00
|
|
|
dev_t devt = 0;
|
2009-01-16 16:59:08 +00:00
|
|
|
int ret = -ENOTTY;
|
2008-03-24 19:02:07 +00:00
|
|
|
|
2009-01-05 21:57:23 +00:00
|
|
|
if (!capable(CAP_SYS_ADMIN))
|
|
|
|
return -EPERM;
|
|
|
|
|
2009-04-08 07:06:54 +00:00
|
|
|
vol = memdup_user((void __user *)arg, sizeof(*vol));
|
|
|
|
if (IS_ERR(vol))
|
|
|
|
return PTR_ERR(vol);
|
2024-02-14 09:32:47 +00:00
|
|
|
ret = btrfs_check_ioctl_vol_args_path(vol);
|
|
|
|
if (ret < 0)
|
|
|
|
goto out;
|
2009-01-16 16:59:08 +00:00
|
|
|
|
2008-03-24 19:02:07 +00:00
|
|
|
switch (cmd) {
|
|
|
|
case BTRFS_IOC_SCAN_DEV:
|
2018-06-19 14:37:36 +00:00
|
|
|
mutex_lock(&uuid_mutex);
|
2023-09-08 16:31:55 +00:00
|
|
|
/*
|
|
|
|
* Scanning outside of mount can return NULL which would turn
|
|
|
|
* into 0 error code.
|
|
|
|
*/
|
|
|
|
device = btrfs_scan_one_device(vol->name, BLK_OPEN_READ, false);
|
2018-07-12 06:23:16 +00:00
|
|
|
ret = PTR_ERR_OR_ZERO(device);
|
2018-06-19 14:37:36 +00:00
|
|
|
mutex_unlock(&uuid_mutex);
|
2008-03-24 19:02:07 +00:00
|
|
|
break;
|
2019-01-04 05:31:54 +00:00
|
|
|
case BTRFS_IOC_FORGET_DEV:
|
2022-01-12 05:06:00 +00:00
|
|
|
if (vol->name[0] != 0) {
|
|
|
|
ret = lookup_bdev(vol->name, &devt);
|
|
|
|
if (ret)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
ret = btrfs_forget_devices(devt);
|
2019-01-04 05:31:54 +00:00
|
|
|
break;
|
2012-06-21 20:03:58 +00:00
|
|
|
case BTRFS_IOC_DEVICES_READY:
|
2018-06-19 14:37:36 +00:00
|
|
|
mutex_lock(&uuid_mutex);
|
2023-09-08 16:31:55 +00:00
|
|
|
/*
|
|
|
|
* Scanning outside of mount can return NULL which would turn
|
|
|
|
* into 0 error code.
|
|
|
|
*/
|
|
|
|
device = btrfs_scan_one_device(vol->name, BLK_OPEN_READ, false);
|
|
|
|
if (IS_ERR_OR_NULL(device)) {
|
2018-06-19 14:37:36 +00:00
|
|
|
mutex_unlock(&uuid_mutex);
|
2018-07-12 06:23:16 +00:00
|
|
|
ret = PTR_ERR(device);
|
2012-06-21 20:03:58 +00:00
|
|
|
break;
|
2018-06-19 14:37:36 +00:00
|
|
|
}
|
2018-07-12 06:23:16 +00:00
|
|
|
ret = !(device->fs_devices->num_devices ==
|
|
|
|
device->fs_devices->total_devices);
|
2018-06-19 14:37:36 +00:00
|
|
|
mutex_unlock(&uuid_mutex);
|
2012-06-21 20:03:58 +00:00
|
|
|
break;
|
2016-02-17 14:24:14 +00:00
|
|
|
case BTRFS_IOC_GET_SUPPORTED_FEATURES:
|
2016-02-17 14:26:27 +00:00
|
|
|
ret = btrfs_ioctl_get_supported_features((void __user*)arg);
|
2016-02-17 14:24:14 +00:00
|
|
|
break;
|
2008-03-24 19:02:07 +00:00
|
|
|
}
|
2009-04-08 07:06:54 +00:00
|
|
|
|
2024-02-14 09:32:47 +00:00
|
|
|
out:
|
2008-03-24 19:02:07 +00:00
|
|
|
kfree(vol);
|
2008-06-10 02:17:11 +00:00
|
|
|
return ret;
|
2008-03-24 19:02:07 +00:00
|
|
|
}
|
|
|
|
|
2009-01-10 14:09:52 +00:00
|
|
|
static int btrfs_freeze(struct super_block *sb)
|
2008-01-22 17:46:56 +00:00
|
|
|
{
|
2016-06-22 22:54:23 +00:00
|
|
|
struct btrfs_fs_info *fs_info = btrfs_sb(sb);
|
Btrfs: fix orphan transaction on the freezed filesystem
With the following debug patch:
static int btrfs_freeze(struct super_block *sb)
{
+ struct btrfs_fs_info *fs_info = btrfs_sb(sb);
+ struct btrfs_transaction *trans;
+
+ spin_lock(&fs_info->trans_lock);
+ trans = fs_info->running_transaction;
+ if (trans) {
+ printk("Transid %llu, use_count %d, num_writer %d\n",
+ trans->transid, atomic_read(&trans->use_count),
+ atomic_read(&trans->num_writers));
+ }
+ spin_unlock(&fs_info->trans_lock);
return 0;
}
I found there was a orphan transaction after the freeze operation was done.
It is because the transaction may not be committed when the transaction handle
end even though it is the last handle of the current transaction. This design
avoid committing the transaction frequently, but also introduce the above
problem.
So I add btrfs_attach_transaction() which can catch the current transaction
and commit it. If there is no transaction, it will return ENOENT, and do not
anything.
This function also can be used to instead of btrfs_join_transaction_freeze()
because it don't increase the writer counter and don't start a new transaction,
so it also can fix the deadlock between sync and freeze.
Besides that, it is used to instead of btrfs_join_transaction() in
transaction_kthread(), because if there is no transaction, the transaction
kthread needn't anything.
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
2012-09-20 07:54:00 +00:00
|
|
|
|
2017-06-15 17:10:03 +00:00
|
|
|
set_bit(BTRFS_FS_FROZEN, &fs_info->flags);
|
btrfs: fix fsfreeze hang caused by delayed iputs deal
When running fstests generic/068, sometimes we got below deadlock:
xfs_io D ffff8800331dbb20 0 6697 6693 0x00000080
ffff8800331dbb20 ffff88007acfc140 ffff880034d895c0 ffff8800331dc000
ffff880032d243e8 fffffffeffffffff ffff880032d24400 0000000000000001
ffff8800331dbb38 ffffffff816a9045 ffff880034d895c0 ffff8800331dbba8
Call Trace:
[<ffffffff816a9045>] schedule+0x35/0x80
[<ffffffff816abab2>] rwsem_down_read_failed+0xf2/0x140
[<ffffffff8118f5e1>] ? __filemap_fdatawrite_range+0xd1/0x100
[<ffffffff8134f978>] call_rwsem_down_read_failed+0x18/0x30
[<ffffffffa06631fc>] ? btrfs_alloc_block_rsv+0x2c/0xb0 [btrfs]
[<ffffffff810d32b5>] percpu_down_read+0x35/0x50
[<ffffffff81217dfc>] __sb_start_write+0x2c/0x40
[<ffffffffa067f5d5>] start_transaction+0x2a5/0x4d0 [btrfs]
[<ffffffffa067f857>] btrfs_join_transaction+0x17/0x20 [btrfs]
[<ffffffffa068ba34>] btrfs_evict_inode+0x3c4/0x5d0 [btrfs]
[<ffffffff81230a1a>] evict+0xba/0x1a0
[<ffffffff812316b6>] iput+0x196/0x200
[<ffffffffa06851d0>] btrfs_run_delayed_iputs+0x70/0xc0 [btrfs]
[<ffffffffa067f1d8>] btrfs_commit_transaction+0x928/0xa80 [btrfs]
[<ffffffffa0646df0>] btrfs_freeze+0x30/0x40 [btrfs]
[<ffffffff81218040>] freeze_super+0xf0/0x190
[<ffffffff81229275>] do_vfs_ioctl+0x4a5/0x5c0
[<ffffffff81003176>] ? do_audit_syscall_entry+0x66/0x70
[<ffffffff810038cf>] ? syscall_trace_enter_phase1+0x11f/0x140
[<ffffffff81229409>] SyS_ioctl+0x79/0x90
[<ffffffff81003c12>] do_syscall_64+0x62/0x110
[<ffffffff816acbe1>] entry_SYSCALL64_slow_path+0x25/0x25
>From this warning, freeze_super() already holds SB_FREEZE_FS, but
btrfs_freeze() will call btrfs_commit_transaction() again, if
btrfs_commit_transaction() finds that it has delayed iputs to handle,
it'll start_transaction(), which will try to get SB_FREEZE_FS lock
again, then deadlock occurs.
The root cause is that in btrfs, sync_filesystem(sb) does not make
sure all metadata is updated. There still maybe some codes adding
delayed iputs, see below sample race window:
CPU1 | CPU2
|-> freeze_super() |
|-> sync_filesystem(sb); |
| |-> cleaner_kthread()
| | |-> btrfs_delete_unused_bgs()
| | |-> btrfs_remove_chunk()
| | |-> btrfs_remove_block_group()
| | |-> btrfs_add_delayed_iput()
| |
|-> sb->s_writers.frozen = SB_FREEZE_FS; |
|-> sb_wait_write(sb, SB_FREEZE_FS); |
| acquire SB_FREEZE_FS lock. |
| |
|-> btrfs_freeze() |
|-> btrfs_commit_transaction() |
|-> btrfs_run_delayed_iputs() |
| will handle delayed iputs, |
| that means start_transaction() |
| will be called, which will try |
| to get SB_FREEZE_FS lock. |
To fix this issue, introduce a "int fs_frozen" to record internally whether
fs has been frozen. If fs has been frozen, we can not handle delayed iputs.
Signed-off-by: Wang Xiaoguang <wangxg.fnst@cn.fujitsu.com>
Reviewed-by: David Sterba <dsterba@suse.com>
[ add comment to btrfs_freeze ]
Signed-off-by: David Sterba <dsterba@suse.com>
Signed-off-by: Chris Mason <clm@fb.com>
2016-08-01 05:28:08 +00:00
|
|
|
/*
|
|
|
|
* We don't need a barrier here, we'll wait for any transaction that
|
|
|
|
* could be in progress on other threads (and do delayed iputs that
|
|
|
|
* we want to avoid on a frozen filesystem), or do the commit
|
|
|
|
* ourselves.
|
|
|
|
*/
|
2024-05-22 08:26:44 +00:00
|
|
|
return btrfs_commit_current_transaction(fs_info->tree_root);
|
2008-01-22 17:46:56 +00:00
|
|
|
}
|
|
|
|
|
btrfs: check superblock to ensure the fs was not modified at thaw time
[BACKGROUND]
There is an incident report that, one user hibernated the system, with
one btrfs on removable device still mounted.
Then by some incident, the btrfs got mounted and modified by another
system/OS, then back to the hibernated system.
After resuming from the hibernation, new write happened into the victim btrfs.
Now the fs is completely broken, since the underlying btrfs is no longer
the same one before the hibernation, and the user lost their data due to
various transid mismatch.
[REPRODUCER]
We can emulate the situation using the following small script:
truncate -s 1G $dev
mkfs.btrfs -f $dev
mount $dev $mnt
fsstress -w -d $mnt -n 500
sync
xfs_freeze -f $mnt
cp $dev $dev.backup
# There is no way to mount the same cloned fs on the same system,
# as the conflicting fsid will be rejected by btrfs.
# Thus here we have to wipe the fs using a different btrfs.
mkfs.btrfs -f $dev.backup
dd if=$dev.backup of=$dev bs=1M
xfs_freeze -u $mnt
fsstress -w -d $mnt -n 20
umount $mnt
btrfs check $dev
The final fsck will fail due to some tree blocks has incorrect fsid.
This is enough to emulate the problem hit by the unfortunate user.
[ENHANCEMENT]
Although such case should not be that common, it can still happen from
time to time.
From the view of btrfs, we can detect any unexpected super block change,
and if there is any unexpected change, we just mark the fs read-only,
and thaw the fs.
By this we can limit the damage to minimal, and I hope no one would lose
their data by this anymore.
Suggested-by: Goffredo Baroncelli <kreijack@libero.it>
Link: https://lore.kernel.org/linux-btrfs/83bf3b4b-7f4c-387a-b286-9251e3991e34@bluemole.com/
Reviewed-by: Anand Jain <anand.jain@oracle.com>
Signed-off-by: Qu Wenruo <wqu@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2022-08-24 12:16:22 +00:00
|
|
|
static int check_dev_super(struct btrfs_device *dev)
|
|
|
|
{
|
|
|
|
struct btrfs_fs_info *fs_info = dev->fs_info;
|
|
|
|
struct btrfs_super_block *sb;
|
2023-10-04 10:38:51 +00:00
|
|
|
u64 last_trans;
|
2022-10-18 01:56:38 +00:00
|
|
|
u16 csum_type;
|
btrfs: check superblock to ensure the fs was not modified at thaw time
[BACKGROUND]
There is an incident report that, one user hibernated the system, with
one btrfs on removable device still mounted.
Then by some incident, the btrfs got mounted and modified by another
system/OS, then back to the hibernated system.
After resuming from the hibernation, new write happened into the victim btrfs.
Now the fs is completely broken, since the underlying btrfs is no longer
the same one before the hibernation, and the user lost their data due to
various transid mismatch.
[REPRODUCER]
We can emulate the situation using the following small script:
truncate -s 1G $dev
mkfs.btrfs -f $dev
mount $dev $mnt
fsstress -w -d $mnt -n 500
sync
xfs_freeze -f $mnt
cp $dev $dev.backup
# There is no way to mount the same cloned fs on the same system,
# as the conflicting fsid will be rejected by btrfs.
# Thus here we have to wipe the fs using a different btrfs.
mkfs.btrfs -f $dev.backup
dd if=$dev.backup of=$dev bs=1M
xfs_freeze -u $mnt
fsstress -w -d $mnt -n 20
umount $mnt
btrfs check $dev
The final fsck will fail due to some tree blocks has incorrect fsid.
This is enough to emulate the problem hit by the unfortunate user.
[ENHANCEMENT]
Although such case should not be that common, it can still happen from
time to time.
From the view of btrfs, we can detect any unexpected super block change,
and if there is any unexpected change, we just mark the fs read-only,
and thaw the fs.
By this we can limit the damage to minimal, and I hope no one would lose
their data by this anymore.
Suggested-by: Goffredo Baroncelli <kreijack@libero.it>
Link: https://lore.kernel.org/linux-btrfs/83bf3b4b-7f4c-387a-b286-9251e3991e34@bluemole.com/
Reviewed-by: Anand Jain <anand.jain@oracle.com>
Signed-off-by: Qu Wenruo <wqu@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2022-08-24 12:16:22 +00:00
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
/* This should be called with fs still frozen. */
|
|
|
|
ASSERT(test_bit(BTRFS_FS_FROZEN, &fs_info->flags));
|
|
|
|
|
|
|
|
/* Missing dev, no need to check. */
|
|
|
|
if (!dev->bdev)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
/* Only need to check the primary super block. */
|
|
|
|
sb = btrfs_read_dev_one_super(dev->bdev, 0, true);
|
|
|
|
if (IS_ERR(sb))
|
|
|
|
return PTR_ERR(sb);
|
|
|
|
|
2022-10-18 01:56:38 +00:00
|
|
|
/* Verify the checksum. */
|
|
|
|
csum_type = btrfs_super_csum_type(sb);
|
|
|
|
if (csum_type != btrfs_super_csum_type(fs_info->super_copy)) {
|
|
|
|
btrfs_err(fs_info, "csum type changed, has %u expect %u",
|
|
|
|
csum_type, btrfs_super_csum_type(fs_info->super_copy));
|
|
|
|
ret = -EUCLEAN;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (btrfs_check_super_csum(fs_info, sb)) {
|
|
|
|
btrfs_err(fs_info, "csum for on-disk super block no longer matches");
|
|
|
|
ret = -EUCLEAN;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
btrfs: check superblock to ensure the fs was not modified at thaw time
[BACKGROUND]
There is an incident report that, one user hibernated the system, with
one btrfs on removable device still mounted.
Then by some incident, the btrfs got mounted and modified by another
system/OS, then back to the hibernated system.
After resuming from the hibernation, new write happened into the victim btrfs.
Now the fs is completely broken, since the underlying btrfs is no longer
the same one before the hibernation, and the user lost their data due to
various transid mismatch.
[REPRODUCER]
We can emulate the situation using the following small script:
truncate -s 1G $dev
mkfs.btrfs -f $dev
mount $dev $mnt
fsstress -w -d $mnt -n 500
sync
xfs_freeze -f $mnt
cp $dev $dev.backup
# There is no way to mount the same cloned fs on the same system,
# as the conflicting fsid will be rejected by btrfs.
# Thus here we have to wipe the fs using a different btrfs.
mkfs.btrfs -f $dev.backup
dd if=$dev.backup of=$dev bs=1M
xfs_freeze -u $mnt
fsstress -w -d $mnt -n 20
umount $mnt
btrfs check $dev
The final fsck will fail due to some tree blocks has incorrect fsid.
This is enough to emulate the problem hit by the unfortunate user.
[ENHANCEMENT]
Although such case should not be that common, it can still happen from
time to time.
From the view of btrfs, we can detect any unexpected super block change,
and if there is any unexpected change, we just mark the fs read-only,
and thaw the fs.
By this we can limit the damage to minimal, and I hope no one would lose
their data by this anymore.
Suggested-by: Goffredo Baroncelli <kreijack@libero.it>
Link: https://lore.kernel.org/linux-btrfs/83bf3b4b-7f4c-387a-b286-9251e3991e34@bluemole.com/
Reviewed-by: Anand Jain <anand.jain@oracle.com>
Signed-off-by: Qu Wenruo <wqu@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2022-08-24 12:16:22 +00:00
|
|
|
/* Btrfs_validate_super() includes fsid check against super->fsid. */
|
|
|
|
ret = btrfs_validate_super(fs_info, sb, 0);
|
|
|
|
if (ret < 0)
|
|
|
|
goto out;
|
|
|
|
|
2023-10-04 10:38:51 +00:00
|
|
|
last_trans = btrfs_get_last_trans_committed(fs_info);
|
|
|
|
if (btrfs_super_generation(sb) != last_trans) {
|
btrfs: check superblock to ensure the fs was not modified at thaw time
[BACKGROUND]
There is an incident report that, one user hibernated the system, with
one btrfs on removable device still mounted.
Then by some incident, the btrfs got mounted and modified by another
system/OS, then back to the hibernated system.
After resuming from the hibernation, new write happened into the victim btrfs.
Now the fs is completely broken, since the underlying btrfs is no longer
the same one before the hibernation, and the user lost their data due to
various transid mismatch.
[REPRODUCER]
We can emulate the situation using the following small script:
truncate -s 1G $dev
mkfs.btrfs -f $dev
mount $dev $mnt
fsstress -w -d $mnt -n 500
sync
xfs_freeze -f $mnt
cp $dev $dev.backup
# There is no way to mount the same cloned fs on the same system,
# as the conflicting fsid will be rejected by btrfs.
# Thus here we have to wipe the fs using a different btrfs.
mkfs.btrfs -f $dev.backup
dd if=$dev.backup of=$dev bs=1M
xfs_freeze -u $mnt
fsstress -w -d $mnt -n 20
umount $mnt
btrfs check $dev
The final fsck will fail due to some tree blocks has incorrect fsid.
This is enough to emulate the problem hit by the unfortunate user.
[ENHANCEMENT]
Although such case should not be that common, it can still happen from
time to time.
From the view of btrfs, we can detect any unexpected super block change,
and if there is any unexpected change, we just mark the fs read-only,
and thaw the fs.
By this we can limit the damage to minimal, and I hope no one would lose
their data by this anymore.
Suggested-by: Goffredo Baroncelli <kreijack@libero.it>
Link: https://lore.kernel.org/linux-btrfs/83bf3b4b-7f4c-387a-b286-9251e3991e34@bluemole.com/
Reviewed-by: Anand Jain <anand.jain@oracle.com>
Signed-off-by: Qu Wenruo <wqu@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2022-08-24 12:16:22 +00:00
|
|
|
btrfs_err(fs_info, "transid mismatch, has %llu expect %llu",
|
2023-10-04 10:38:51 +00:00
|
|
|
btrfs_super_generation(sb), last_trans);
|
btrfs: check superblock to ensure the fs was not modified at thaw time
[BACKGROUND]
There is an incident report that, one user hibernated the system, with
one btrfs on removable device still mounted.
Then by some incident, the btrfs got mounted and modified by another
system/OS, then back to the hibernated system.
After resuming from the hibernation, new write happened into the victim btrfs.
Now the fs is completely broken, since the underlying btrfs is no longer
the same one before the hibernation, and the user lost their data due to
various transid mismatch.
[REPRODUCER]
We can emulate the situation using the following small script:
truncate -s 1G $dev
mkfs.btrfs -f $dev
mount $dev $mnt
fsstress -w -d $mnt -n 500
sync
xfs_freeze -f $mnt
cp $dev $dev.backup
# There is no way to mount the same cloned fs on the same system,
# as the conflicting fsid will be rejected by btrfs.
# Thus here we have to wipe the fs using a different btrfs.
mkfs.btrfs -f $dev.backup
dd if=$dev.backup of=$dev bs=1M
xfs_freeze -u $mnt
fsstress -w -d $mnt -n 20
umount $mnt
btrfs check $dev
The final fsck will fail due to some tree blocks has incorrect fsid.
This is enough to emulate the problem hit by the unfortunate user.
[ENHANCEMENT]
Although such case should not be that common, it can still happen from
time to time.
From the view of btrfs, we can detect any unexpected super block change,
and if there is any unexpected change, we just mark the fs read-only,
and thaw the fs.
By this we can limit the damage to minimal, and I hope no one would lose
their data by this anymore.
Suggested-by: Goffredo Baroncelli <kreijack@libero.it>
Link: https://lore.kernel.org/linux-btrfs/83bf3b4b-7f4c-387a-b286-9251e3991e34@bluemole.com/
Reviewed-by: Anand Jain <anand.jain@oracle.com>
Signed-off-by: Qu Wenruo <wqu@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2022-08-24 12:16:22 +00:00
|
|
|
ret = -EUCLEAN;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
out:
|
|
|
|
btrfs_release_disk_super(sb);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
btrfs: fix fsfreeze hang caused by delayed iputs deal
When running fstests generic/068, sometimes we got below deadlock:
xfs_io D ffff8800331dbb20 0 6697 6693 0x00000080
ffff8800331dbb20 ffff88007acfc140 ffff880034d895c0 ffff8800331dc000
ffff880032d243e8 fffffffeffffffff ffff880032d24400 0000000000000001
ffff8800331dbb38 ffffffff816a9045 ffff880034d895c0 ffff8800331dbba8
Call Trace:
[<ffffffff816a9045>] schedule+0x35/0x80
[<ffffffff816abab2>] rwsem_down_read_failed+0xf2/0x140
[<ffffffff8118f5e1>] ? __filemap_fdatawrite_range+0xd1/0x100
[<ffffffff8134f978>] call_rwsem_down_read_failed+0x18/0x30
[<ffffffffa06631fc>] ? btrfs_alloc_block_rsv+0x2c/0xb0 [btrfs]
[<ffffffff810d32b5>] percpu_down_read+0x35/0x50
[<ffffffff81217dfc>] __sb_start_write+0x2c/0x40
[<ffffffffa067f5d5>] start_transaction+0x2a5/0x4d0 [btrfs]
[<ffffffffa067f857>] btrfs_join_transaction+0x17/0x20 [btrfs]
[<ffffffffa068ba34>] btrfs_evict_inode+0x3c4/0x5d0 [btrfs]
[<ffffffff81230a1a>] evict+0xba/0x1a0
[<ffffffff812316b6>] iput+0x196/0x200
[<ffffffffa06851d0>] btrfs_run_delayed_iputs+0x70/0xc0 [btrfs]
[<ffffffffa067f1d8>] btrfs_commit_transaction+0x928/0xa80 [btrfs]
[<ffffffffa0646df0>] btrfs_freeze+0x30/0x40 [btrfs]
[<ffffffff81218040>] freeze_super+0xf0/0x190
[<ffffffff81229275>] do_vfs_ioctl+0x4a5/0x5c0
[<ffffffff81003176>] ? do_audit_syscall_entry+0x66/0x70
[<ffffffff810038cf>] ? syscall_trace_enter_phase1+0x11f/0x140
[<ffffffff81229409>] SyS_ioctl+0x79/0x90
[<ffffffff81003c12>] do_syscall_64+0x62/0x110
[<ffffffff816acbe1>] entry_SYSCALL64_slow_path+0x25/0x25
>From this warning, freeze_super() already holds SB_FREEZE_FS, but
btrfs_freeze() will call btrfs_commit_transaction() again, if
btrfs_commit_transaction() finds that it has delayed iputs to handle,
it'll start_transaction(), which will try to get SB_FREEZE_FS lock
again, then deadlock occurs.
The root cause is that in btrfs, sync_filesystem(sb) does not make
sure all metadata is updated. There still maybe some codes adding
delayed iputs, see below sample race window:
CPU1 | CPU2
|-> freeze_super() |
|-> sync_filesystem(sb); |
| |-> cleaner_kthread()
| | |-> btrfs_delete_unused_bgs()
| | |-> btrfs_remove_chunk()
| | |-> btrfs_remove_block_group()
| | |-> btrfs_add_delayed_iput()
| |
|-> sb->s_writers.frozen = SB_FREEZE_FS; |
|-> sb_wait_write(sb, SB_FREEZE_FS); |
| acquire SB_FREEZE_FS lock. |
| |
|-> btrfs_freeze() |
|-> btrfs_commit_transaction() |
|-> btrfs_run_delayed_iputs() |
| will handle delayed iputs, |
| that means start_transaction() |
| will be called, which will try |
| to get SB_FREEZE_FS lock. |
To fix this issue, introduce a "int fs_frozen" to record internally whether
fs has been frozen. If fs has been frozen, we can not handle delayed iputs.
Signed-off-by: Wang Xiaoguang <wangxg.fnst@cn.fujitsu.com>
Reviewed-by: David Sterba <dsterba@suse.com>
[ add comment to btrfs_freeze ]
Signed-off-by: David Sterba <dsterba@suse.com>
Signed-off-by: Chris Mason <clm@fb.com>
2016-08-01 05:28:08 +00:00
|
|
|
static int btrfs_unfreeze(struct super_block *sb)
|
|
|
|
{
|
2017-06-15 17:10:03 +00:00
|
|
|
struct btrfs_fs_info *fs_info = btrfs_sb(sb);
|
btrfs: check superblock to ensure the fs was not modified at thaw time
[BACKGROUND]
There is an incident report that, one user hibernated the system, with
one btrfs on removable device still mounted.
Then by some incident, the btrfs got mounted and modified by another
system/OS, then back to the hibernated system.
After resuming from the hibernation, new write happened into the victim btrfs.
Now the fs is completely broken, since the underlying btrfs is no longer
the same one before the hibernation, and the user lost their data due to
various transid mismatch.
[REPRODUCER]
We can emulate the situation using the following small script:
truncate -s 1G $dev
mkfs.btrfs -f $dev
mount $dev $mnt
fsstress -w -d $mnt -n 500
sync
xfs_freeze -f $mnt
cp $dev $dev.backup
# There is no way to mount the same cloned fs on the same system,
# as the conflicting fsid will be rejected by btrfs.
# Thus here we have to wipe the fs using a different btrfs.
mkfs.btrfs -f $dev.backup
dd if=$dev.backup of=$dev bs=1M
xfs_freeze -u $mnt
fsstress -w -d $mnt -n 20
umount $mnt
btrfs check $dev
The final fsck will fail due to some tree blocks has incorrect fsid.
This is enough to emulate the problem hit by the unfortunate user.
[ENHANCEMENT]
Although such case should not be that common, it can still happen from
time to time.
From the view of btrfs, we can detect any unexpected super block change,
and if there is any unexpected change, we just mark the fs read-only,
and thaw the fs.
By this we can limit the damage to minimal, and I hope no one would lose
their data by this anymore.
Suggested-by: Goffredo Baroncelli <kreijack@libero.it>
Link: https://lore.kernel.org/linux-btrfs/83bf3b4b-7f4c-387a-b286-9251e3991e34@bluemole.com/
Reviewed-by: Anand Jain <anand.jain@oracle.com>
Signed-off-by: Qu Wenruo <wqu@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2022-08-24 12:16:22 +00:00
|
|
|
struct btrfs_device *device;
|
|
|
|
int ret = 0;
|
2017-06-15 17:10:03 +00:00
|
|
|
|
btrfs: check superblock to ensure the fs was not modified at thaw time
[BACKGROUND]
There is an incident report that, one user hibernated the system, with
one btrfs on removable device still mounted.
Then by some incident, the btrfs got mounted and modified by another
system/OS, then back to the hibernated system.
After resuming from the hibernation, new write happened into the victim btrfs.
Now the fs is completely broken, since the underlying btrfs is no longer
the same one before the hibernation, and the user lost their data due to
various transid mismatch.
[REPRODUCER]
We can emulate the situation using the following small script:
truncate -s 1G $dev
mkfs.btrfs -f $dev
mount $dev $mnt
fsstress -w -d $mnt -n 500
sync
xfs_freeze -f $mnt
cp $dev $dev.backup
# There is no way to mount the same cloned fs on the same system,
# as the conflicting fsid will be rejected by btrfs.
# Thus here we have to wipe the fs using a different btrfs.
mkfs.btrfs -f $dev.backup
dd if=$dev.backup of=$dev bs=1M
xfs_freeze -u $mnt
fsstress -w -d $mnt -n 20
umount $mnt
btrfs check $dev
The final fsck will fail due to some tree blocks has incorrect fsid.
This is enough to emulate the problem hit by the unfortunate user.
[ENHANCEMENT]
Although such case should not be that common, it can still happen from
time to time.
From the view of btrfs, we can detect any unexpected super block change,
and if there is any unexpected change, we just mark the fs read-only,
and thaw the fs.
By this we can limit the damage to minimal, and I hope no one would lose
their data by this anymore.
Suggested-by: Goffredo Baroncelli <kreijack@libero.it>
Link: https://lore.kernel.org/linux-btrfs/83bf3b4b-7f4c-387a-b286-9251e3991e34@bluemole.com/
Reviewed-by: Anand Jain <anand.jain@oracle.com>
Signed-off-by: Qu Wenruo <wqu@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2022-08-24 12:16:22 +00:00
|
|
|
/*
|
|
|
|
* Make sure the fs is not changed by accident (like hibernation then
|
|
|
|
* modified by other OS).
|
|
|
|
* If we found anything wrong, we mark the fs error immediately.
|
|
|
|
*
|
|
|
|
* And since the fs is frozen, no one can modify the fs yet, thus
|
|
|
|
* we don't need to hold device_list_mutex.
|
|
|
|
*/
|
|
|
|
list_for_each_entry(device, &fs_info->fs_devices->devices, dev_list) {
|
|
|
|
ret = check_dev_super(device);
|
|
|
|
if (ret < 0) {
|
|
|
|
btrfs_handle_fs_error(fs_info, ret,
|
|
|
|
"super block on devid %llu got modified unexpectedly",
|
|
|
|
device->devid);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2017-06-15 17:10:03 +00:00
|
|
|
clear_bit(BTRFS_FS_FROZEN, &fs_info->flags);
|
btrfs: check superblock to ensure the fs was not modified at thaw time
[BACKGROUND]
There is an incident report that, one user hibernated the system, with
one btrfs on removable device still mounted.
Then by some incident, the btrfs got mounted and modified by another
system/OS, then back to the hibernated system.
After resuming from the hibernation, new write happened into the victim btrfs.
Now the fs is completely broken, since the underlying btrfs is no longer
the same one before the hibernation, and the user lost their data due to
various transid mismatch.
[REPRODUCER]
We can emulate the situation using the following small script:
truncate -s 1G $dev
mkfs.btrfs -f $dev
mount $dev $mnt
fsstress -w -d $mnt -n 500
sync
xfs_freeze -f $mnt
cp $dev $dev.backup
# There is no way to mount the same cloned fs on the same system,
# as the conflicting fsid will be rejected by btrfs.
# Thus here we have to wipe the fs using a different btrfs.
mkfs.btrfs -f $dev.backup
dd if=$dev.backup of=$dev bs=1M
xfs_freeze -u $mnt
fsstress -w -d $mnt -n 20
umount $mnt
btrfs check $dev
The final fsck will fail due to some tree blocks has incorrect fsid.
This is enough to emulate the problem hit by the unfortunate user.
[ENHANCEMENT]
Although such case should not be that common, it can still happen from
time to time.
From the view of btrfs, we can detect any unexpected super block change,
and if there is any unexpected change, we just mark the fs read-only,
and thaw the fs.
By this we can limit the damage to minimal, and I hope no one would lose
their data by this anymore.
Suggested-by: Goffredo Baroncelli <kreijack@libero.it>
Link: https://lore.kernel.org/linux-btrfs/83bf3b4b-7f4c-387a-b286-9251e3991e34@bluemole.com/
Reviewed-by: Anand Jain <anand.jain@oracle.com>
Signed-off-by: Qu Wenruo <wqu@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2022-08-24 12:16:22 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* We still return 0, to allow VFS layer to unfreeze the fs even the
|
|
|
|
* above checks failed. Since the fs is either fine or read-only, we're
|
|
|
|
* safe to continue, without causing further damage.
|
|
|
|
*/
|
btrfs: fix fsfreeze hang caused by delayed iputs deal
When running fstests generic/068, sometimes we got below deadlock:
xfs_io D ffff8800331dbb20 0 6697 6693 0x00000080
ffff8800331dbb20 ffff88007acfc140 ffff880034d895c0 ffff8800331dc000
ffff880032d243e8 fffffffeffffffff ffff880032d24400 0000000000000001
ffff8800331dbb38 ffffffff816a9045 ffff880034d895c0 ffff8800331dbba8
Call Trace:
[<ffffffff816a9045>] schedule+0x35/0x80
[<ffffffff816abab2>] rwsem_down_read_failed+0xf2/0x140
[<ffffffff8118f5e1>] ? __filemap_fdatawrite_range+0xd1/0x100
[<ffffffff8134f978>] call_rwsem_down_read_failed+0x18/0x30
[<ffffffffa06631fc>] ? btrfs_alloc_block_rsv+0x2c/0xb0 [btrfs]
[<ffffffff810d32b5>] percpu_down_read+0x35/0x50
[<ffffffff81217dfc>] __sb_start_write+0x2c/0x40
[<ffffffffa067f5d5>] start_transaction+0x2a5/0x4d0 [btrfs]
[<ffffffffa067f857>] btrfs_join_transaction+0x17/0x20 [btrfs]
[<ffffffffa068ba34>] btrfs_evict_inode+0x3c4/0x5d0 [btrfs]
[<ffffffff81230a1a>] evict+0xba/0x1a0
[<ffffffff812316b6>] iput+0x196/0x200
[<ffffffffa06851d0>] btrfs_run_delayed_iputs+0x70/0xc0 [btrfs]
[<ffffffffa067f1d8>] btrfs_commit_transaction+0x928/0xa80 [btrfs]
[<ffffffffa0646df0>] btrfs_freeze+0x30/0x40 [btrfs]
[<ffffffff81218040>] freeze_super+0xf0/0x190
[<ffffffff81229275>] do_vfs_ioctl+0x4a5/0x5c0
[<ffffffff81003176>] ? do_audit_syscall_entry+0x66/0x70
[<ffffffff810038cf>] ? syscall_trace_enter_phase1+0x11f/0x140
[<ffffffff81229409>] SyS_ioctl+0x79/0x90
[<ffffffff81003c12>] do_syscall_64+0x62/0x110
[<ffffffff816acbe1>] entry_SYSCALL64_slow_path+0x25/0x25
>From this warning, freeze_super() already holds SB_FREEZE_FS, but
btrfs_freeze() will call btrfs_commit_transaction() again, if
btrfs_commit_transaction() finds that it has delayed iputs to handle,
it'll start_transaction(), which will try to get SB_FREEZE_FS lock
again, then deadlock occurs.
The root cause is that in btrfs, sync_filesystem(sb) does not make
sure all metadata is updated. There still maybe some codes adding
delayed iputs, see below sample race window:
CPU1 | CPU2
|-> freeze_super() |
|-> sync_filesystem(sb); |
| |-> cleaner_kthread()
| | |-> btrfs_delete_unused_bgs()
| | |-> btrfs_remove_chunk()
| | |-> btrfs_remove_block_group()
| | |-> btrfs_add_delayed_iput()
| |
|-> sb->s_writers.frozen = SB_FREEZE_FS; |
|-> sb_wait_write(sb, SB_FREEZE_FS); |
| acquire SB_FREEZE_FS lock. |
| |
|-> btrfs_freeze() |
|-> btrfs_commit_transaction() |
|-> btrfs_run_delayed_iputs() |
| will handle delayed iputs, |
| that means start_transaction() |
| will be called, which will try |
| to get SB_FREEZE_FS lock. |
To fix this issue, introduce a "int fs_frozen" to record internally whether
fs has been frozen. If fs has been frozen, we can not handle delayed iputs.
Signed-off-by: Wang Xiaoguang <wangxg.fnst@cn.fujitsu.com>
Reviewed-by: David Sterba <dsterba@suse.com>
[ add comment to btrfs_freeze ]
Signed-off-by: David Sterba <dsterba@suse.com>
Signed-off-by: Chris Mason <clm@fb.com>
2016-08-01 05:28:08 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-06-05 18:13:12 +00:00
|
|
|
static int btrfs_show_devname(struct seq_file *m, struct dentry *root)
|
|
|
|
{
|
|
|
|
struct btrfs_fs_info *fs_info = btrfs_sb(root->d_sb);
|
|
|
|
|
2018-03-16 02:27:02 +00:00
|
|
|
/*
|
2021-08-24 05:05:20 +00:00
|
|
|
* There should be always a valid pointer in latest_dev, it may be stale
|
|
|
|
* for a short moment in case it's being deleted but still valid until
|
|
|
|
* the end of RCU grace period.
|
2018-03-16 02:27:02 +00:00
|
|
|
*/
|
|
|
|
rcu_read_lock();
|
2022-11-13 01:32:07 +00:00
|
|
|
seq_escape(m, btrfs_dev_name(fs_info->fs_devices->latest_dev), " \t\n\\");
|
2018-03-16 02:27:02 +00:00
|
|
|
rcu_read_unlock();
|
2021-08-24 05:05:20 +00:00
|
|
|
|
2012-06-05 18:13:12 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
btrfs: add a shrinker for extent maps
Extent maps are used either to represent existing file extent items, or to
represent new extents that are going to be written and the respective file
extent items are created when the ordered extent completes.
We currently don't have any limit for how many extent maps we can have,
neither per inode nor globally. Most of the time this not too noticeable
because extent maps are removed in the following situations:
1) When evicting an inode;
2) When releasing folios (pages) through the btrfs_release_folio() address
space operation callback.
However we won't release extent maps in the folio range if the folio is
either dirty or under writeback or if the inode's i_size is less than
or equals to 16M (see try_release_extent_mapping(). This 16M i_size
constraint was added back in 2008 with commit 70dec8079d78 ("Btrfs:
extent_io and extent_state optimizations"), but there's no explanation
about why we have it or why the 16M value.
This means that for buffered IO we can reach an OOM situation due to too
many extent maps if either of the following happens:
1) There's a set of tasks constantly doing IO on many files with a size
not larger than 16M, specially if they keep the files open for very
long periods, therefore preventing inode eviction.
This requires a really high number of such files, and having many non
mergeable extent maps (due to random 4K writes for example) and a
machine with very little memory;
2) There's a set tasks constantly doing random write IO (therefore
creating many non mergeable extent maps) on files and keeping them
open for long periods of time, so inode eviction doesn't happen and
there's always a lot of dirty pages or pages under writeback,
preventing btrfs_release_folio() from releasing the respective extent
maps.
This second case was actually reported in the thread pointed by the Link
tag below, and it requires a very large file under heavy IO and a machine
with very little amount of RAM, which is probably hard to happen in
practice in a real world use case.
However when using direct IO this is not so hard to happen, because the
page cache is not used, and therefore btrfs_release_folio() is never
called. Which means extent maps are dropped only when evicting the inode,
and that means that if we have tasks that keep a file descriptor open and
keep doing IO on a very large file (or files), we can exhaust memory due
to an unbounded amount of extent maps. This is especially easy to happen
if we have a huge file with millions of small extents and their extent
maps are not mergeable (non contiguous offsets and disk locations).
This was reported in that thread with the following fio test:
$ cat test.sh
#!/bin/bash
DEV=/dev/sdj
MNT=/mnt/sdj
MOUNT_OPTIONS="-o ssd"
MKFS_OPTIONS=""
cat <<EOF > /tmp/fio-job.ini
[global]
name=fio-rand-write
filename=$MNT/fio-rand-write
rw=randwrite
bs=4K
direct=1
numjobs=16
fallocate=none
time_based
runtime=90000
[file1]
size=300G
ioengine=libaio
iodepth=16
EOF
umount $MNT &> /dev/null
mkfs.btrfs -f $MKFS_OPTIONS $DEV
mount $MOUNT_OPTIONS $DEV $MNT
fio /tmp/fio-job.ini
umount $MNT
Monitoring the btrfs_extent_map slab while running the test with:
$ watch -d -n 1 'cat /sys/kernel/slab/btrfs_extent_map/objects \
/sys/kernel/slab/btrfs_extent_map/total_objects'
Shows the number of active and total extent maps skyrocketing to tens of
millions, and on systems with a short amount of memory it's easy and quick
to get into an OOM situation, as reported in that thread.
So to avoid this issue add a shrinker that will remove extents maps, as
long as they are not pinned, and takes proper care with any concurrent
fsync to avoid missing extents (setting the full sync flag while in the
middle of a fast fsync). This shrinker is triggered through the callbacks
nr_cached_objects and free_cached_objects of struct super_operations.
The shrinker will iterate over all roots and over all inodes of each
root, and keeps track of the last scanned root and inode, so that the
next time it runs, it starts from that root and from the next inode.
This is similar to what xfs does for its inode reclaim (implements those
callbacks, and cycles through inodes by starting from where it ended
last time).
Reviewed-by: Josef Bacik <josef@toxicpanda.com>
Signed-off-by: Filipe Manana <fdmanana@suse.com>
Reviewed-by: David Sterba <dsterba@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2024-04-15 16:09:26 +00:00
|
|
|
static long btrfs_nr_cached_objects(struct super_block *sb, struct shrink_control *sc)
|
|
|
|
{
|
|
|
|
struct btrfs_fs_info *fs_info = btrfs_sb(sb);
|
2024-04-09 16:07:32 +00:00
|
|
|
const s64 nr = percpu_counter_sum_positive(&fs_info->evictable_extent_maps);
|
btrfs: add a shrinker for extent maps
Extent maps are used either to represent existing file extent items, or to
represent new extents that are going to be written and the respective file
extent items are created when the ordered extent completes.
We currently don't have any limit for how many extent maps we can have,
neither per inode nor globally. Most of the time this not too noticeable
because extent maps are removed in the following situations:
1) When evicting an inode;
2) When releasing folios (pages) through the btrfs_release_folio() address
space operation callback.
However we won't release extent maps in the folio range if the folio is
either dirty or under writeback or if the inode's i_size is less than
or equals to 16M (see try_release_extent_mapping(). This 16M i_size
constraint was added back in 2008 with commit 70dec8079d78 ("Btrfs:
extent_io and extent_state optimizations"), but there's no explanation
about why we have it or why the 16M value.
This means that for buffered IO we can reach an OOM situation due to too
many extent maps if either of the following happens:
1) There's a set of tasks constantly doing IO on many files with a size
not larger than 16M, specially if they keep the files open for very
long periods, therefore preventing inode eviction.
This requires a really high number of such files, and having many non
mergeable extent maps (due to random 4K writes for example) and a
machine with very little memory;
2) There's a set tasks constantly doing random write IO (therefore
creating many non mergeable extent maps) on files and keeping them
open for long periods of time, so inode eviction doesn't happen and
there's always a lot of dirty pages or pages under writeback,
preventing btrfs_release_folio() from releasing the respective extent
maps.
This second case was actually reported in the thread pointed by the Link
tag below, and it requires a very large file under heavy IO and a machine
with very little amount of RAM, which is probably hard to happen in
practice in a real world use case.
However when using direct IO this is not so hard to happen, because the
page cache is not used, and therefore btrfs_release_folio() is never
called. Which means extent maps are dropped only when evicting the inode,
and that means that if we have tasks that keep a file descriptor open and
keep doing IO on a very large file (or files), we can exhaust memory due
to an unbounded amount of extent maps. This is especially easy to happen
if we have a huge file with millions of small extents and their extent
maps are not mergeable (non contiguous offsets and disk locations).
This was reported in that thread with the following fio test:
$ cat test.sh
#!/bin/bash
DEV=/dev/sdj
MNT=/mnt/sdj
MOUNT_OPTIONS="-o ssd"
MKFS_OPTIONS=""
cat <<EOF > /tmp/fio-job.ini
[global]
name=fio-rand-write
filename=$MNT/fio-rand-write
rw=randwrite
bs=4K
direct=1
numjobs=16
fallocate=none
time_based
runtime=90000
[file1]
size=300G
ioengine=libaio
iodepth=16
EOF
umount $MNT &> /dev/null
mkfs.btrfs -f $MKFS_OPTIONS $DEV
mount $MOUNT_OPTIONS $DEV $MNT
fio /tmp/fio-job.ini
umount $MNT
Monitoring the btrfs_extent_map slab while running the test with:
$ watch -d -n 1 'cat /sys/kernel/slab/btrfs_extent_map/objects \
/sys/kernel/slab/btrfs_extent_map/total_objects'
Shows the number of active and total extent maps skyrocketing to tens of
millions, and on systems with a short amount of memory it's easy and quick
to get into an OOM situation, as reported in that thread.
So to avoid this issue add a shrinker that will remove extents maps, as
long as they are not pinned, and takes proper care with any concurrent
fsync to avoid missing extents (setting the full sync flag while in the
middle of a fast fsync). This shrinker is triggered through the callbacks
nr_cached_objects and free_cached_objects of struct super_operations.
The shrinker will iterate over all roots and over all inodes of each
root, and keeps track of the last scanned root and inode, so that the
next time it runs, it starts from that root and from the next inode.
This is similar to what xfs does for its inode reclaim (implements those
callbacks, and cycles through inodes by starting from where it ended
last time).
Reviewed-by: Josef Bacik <josef@toxicpanda.com>
Signed-off-by: Filipe Manana <fdmanana@suse.com>
Reviewed-by: David Sterba <dsterba@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2024-04-15 16:09:26 +00:00
|
|
|
|
2024-04-09 16:07:32 +00:00
|
|
|
trace_btrfs_extent_map_shrinker_count(fs_info, nr);
|
|
|
|
|
|
|
|
return nr;
|
btrfs: add a shrinker for extent maps
Extent maps are used either to represent existing file extent items, or to
represent new extents that are going to be written and the respective file
extent items are created when the ordered extent completes.
We currently don't have any limit for how many extent maps we can have,
neither per inode nor globally. Most of the time this not too noticeable
because extent maps are removed in the following situations:
1) When evicting an inode;
2) When releasing folios (pages) through the btrfs_release_folio() address
space operation callback.
However we won't release extent maps in the folio range if the folio is
either dirty or under writeback or if the inode's i_size is less than
or equals to 16M (see try_release_extent_mapping(). This 16M i_size
constraint was added back in 2008 with commit 70dec8079d78 ("Btrfs:
extent_io and extent_state optimizations"), but there's no explanation
about why we have it or why the 16M value.
This means that for buffered IO we can reach an OOM situation due to too
many extent maps if either of the following happens:
1) There's a set of tasks constantly doing IO on many files with a size
not larger than 16M, specially if they keep the files open for very
long periods, therefore preventing inode eviction.
This requires a really high number of such files, and having many non
mergeable extent maps (due to random 4K writes for example) and a
machine with very little memory;
2) There's a set tasks constantly doing random write IO (therefore
creating many non mergeable extent maps) on files and keeping them
open for long periods of time, so inode eviction doesn't happen and
there's always a lot of dirty pages or pages under writeback,
preventing btrfs_release_folio() from releasing the respective extent
maps.
This second case was actually reported in the thread pointed by the Link
tag below, and it requires a very large file under heavy IO and a machine
with very little amount of RAM, which is probably hard to happen in
practice in a real world use case.
However when using direct IO this is not so hard to happen, because the
page cache is not used, and therefore btrfs_release_folio() is never
called. Which means extent maps are dropped only when evicting the inode,
and that means that if we have tasks that keep a file descriptor open and
keep doing IO on a very large file (or files), we can exhaust memory due
to an unbounded amount of extent maps. This is especially easy to happen
if we have a huge file with millions of small extents and their extent
maps are not mergeable (non contiguous offsets and disk locations).
This was reported in that thread with the following fio test:
$ cat test.sh
#!/bin/bash
DEV=/dev/sdj
MNT=/mnt/sdj
MOUNT_OPTIONS="-o ssd"
MKFS_OPTIONS=""
cat <<EOF > /tmp/fio-job.ini
[global]
name=fio-rand-write
filename=$MNT/fio-rand-write
rw=randwrite
bs=4K
direct=1
numjobs=16
fallocate=none
time_based
runtime=90000
[file1]
size=300G
ioengine=libaio
iodepth=16
EOF
umount $MNT &> /dev/null
mkfs.btrfs -f $MKFS_OPTIONS $DEV
mount $MOUNT_OPTIONS $DEV $MNT
fio /tmp/fio-job.ini
umount $MNT
Monitoring the btrfs_extent_map slab while running the test with:
$ watch -d -n 1 'cat /sys/kernel/slab/btrfs_extent_map/objects \
/sys/kernel/slab/btrfs_extent_map/total_objects'
Shows the number of active and total extent maps skyrocketing to tens of
millions, and on systems with a short amount of memory it's easy and quick
to get into an OOM situation, as reported in that thread.
So to avoid this issue add a shrinker that will remove extents maps, as
long as they are not pinned, and takes proper care with any concurrent
fsync to avoid missing extents (setting the full sync flag while in the
middle of a fast fsync). This shrinker is triggered through the callbacks
nr_cached_objects and free_cached_objects of struct super_operations.
The shrinker will iterate over all roots and over all inodes of each
root, and keeps track of the last scanned root and inode, so that the
next time it runs, it starts from that root and from the next inode.
This is similar to what xfs does for its inode reclaim (implements those
callbacks, and cycles through inodes by starting from where it ended
last time).
Reviewed-by: Josef Bacik <josef@toxicpanda.com>
Signed-off-by: Filipe Manana <fdmanana@suse.com>
Reviewed-by: David Sterba <dsterba@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2024-04-15 16:09:26 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static long btrfs_free_cached_objects(struct super_block *sb, struct shrink_control *sc)
|
|
|
|
{
|
|
|
|
const long nr_to_scan = min_t(unsigned long, LONG_MAX, sc->nr_to_scan);
|
|
|
|
struct btrfs_fs_info *fs_info = btrfs_sb(sb);
|
|
|
|
|
|
|
|
return btrfs_free_extent_maps(fs_info, nr_to_scan);
|
|
|
|
}
|
|
|
|
|
2009-09-22 00:01:09 +00:00
|
|
|
static const struct super_operations btrfs_super_ops = {
|
2009-09-21 20:00:26 +00:00
|
|
|
.drop_inode = btrfs_drop_inode,
|
2010-06-07 15:35:40 +00:00
|
|
|
.evict_inode = btrfs_evict_inode,
|
2007-03-22 16:13:20 +00:00
|
|
|
.put_super = btrfs_put_super,
|
2007-03-23 14:01:08 +00:00
|
|
|
.sync_fs = btrfs_sync_fs,
|
2009-04-02 20:46:06 +00:00
|
|
|
.show_options = btrfs_show_options,
|
2012-06-05 18:13:12 +00:00
|
|
|
.show_devname = btrfs_show_devname,
|
2007-04-02 14:50:19 +00:00
|
|
|
.alloc_inode = btrfs_alloc_inode,
|
|
|
|
.destroy_inode = btrfs_destroy_inode,
|
2019-04-10 19:14:41 +00:00
|
|
|
.free_inode = btrfs_free_inode,
|
2007-04-20 01:01:03 +00:00
|
|
|
.statfs = btrfs_statfs,
|
2009-01-10 14:09:52 +00:00
|
|
|
.freeze_fs = btrfs_freeze,
|
btrfs: fix fsfreeze hang caused by delayed iputs deal
When running fstests generic/068, sometimes we got below deadlock:
xfs_io D ffff8800331dbb20 0 6697 6693 0x00000080
ffff8800331dbb20 ffff88007acfc140 ffff880034d895c0 ffff8800331dc000
ffff880032d243e8 fffffffeffffffff ffff880032d24400 0000000000000001
ffff8800331dbb38 ffffffff816a9045 ffff880034d895c0 ffff8800331dbba8
Call Trace:
[<ffffffff816a9045>] schedule+0x35/0x80
[<ffffffff816abab2>] rwsem_down_read_failed+0xf2/0x140
[<ffffffff8118f5e1>] ? __filemap_fdatawrite_range+0xd1/0x100
[<ffffffff8134f978>] call_rwsem_down_read_failed+0x18/0x30
[<ffffffffa06631fc>] ? btrfs_alloc_block_rsv+0x2c/0xb0 [btrfs]
[<ffffffff810d32b5>] percpu_down_read+0x35/0x50
[<ffffffff81217dfc>] __sb_start_write+0x2c/0x40
[<ffffffffa067f5d5>] start_transaction+0x2a5/0x4d0 [btrfs]
[<ffffffffa067f857>] btrfs_join_transaction+0x17/0x20 [btrfs]
[<ffffffffa068ba34>] btrfs_evict_inode+0x3c4/0x5d0 [btrfs]
[<ffffffff81230a1a>] evict+0xba/0x1a0
[<ffffffff812316b6>] iput+0x196/0x200
[<ffffffffa06851d0>] btrfs_run_delayed_iputs+0x70/0xc0 [btrfs]
[<ffffffffa067f1d8>] btrfs_commit_transaction+0x928/0xa80 [btrfs]
[<ffffffffa0646df0>] btrfs_freeze+0x30/0x40 [btrfs]
[<ffffffff81218040>] freeze_super+0xf0/0x190
[<ffffffff81229275>] do_vfs_ioctl+0x4a5/0x5c0
[<ffffffff81003176>] ? do_audit_syscall_entry+0x66/0x70
[<ffffffff810038cf>] ? syscall_trace_enter_phase1+0x11f/0x140
[<ffffffff81229409>] SyS_ioctl+0x79/0x90
[<ffffffff81003c12>] do_syscall_64+0x62/0x110
[<ffffffff816acbe1>] entry_SYSCALL64_slow_path+0x25/0x25
>From this warning, freeze_super() already holds SB_FREEZE_FS, but
btrfs_freeze() will call btrfs_commit_transaction() again, if
btrfs_commit_transaction() finds that it has delayed iputs to handle,
it'll start_transaction(), which will try to get SB_FREEZE_FS lock
again, then deadlock occurs.
The root cause is that in btrfs, sync_filesystem(sb) does not make
sure all metadata is updated. There still maybe some codes adding
delayed iputs, see below sample race window:
CPU1 | CPU2
|-> freeze_super() |
|-> sync_filesystem(sb); |
| |-> cleaner_kthread()
| | |-> btrfs_delete_unused_bgs()
| | |-> btrfs_remove_chunk()
| | |-> btrfs_remove_block_group()
| | |-> btrfs_add_delayed_iput()
| |
|-> sb->s_writers.frozen = SB_FREEZE_FS; |
|-> sb_wait_write(sb, SB_FREEZE_FS); |
| acquire SB_FREEZE_FS lock. |
| |
|-> btrfs_freeze() |
|-> btrfs_commit_transaction() |
|-> btrfs_run_delayed_iputs() |
| will handle delayed iputs, |
| that means start_transaction() |
| will be called, which will try |
| to get SB_FREEZE_FS lock. |
To fix this issue, introduce a "int fs_frozen" to record internally whether
fs has been frozen. If fs has been frozen, we can not handle delayed iputs.
Signed-off-by: Wang Xiaoguang <wangxg.fnst@cn.fujitsu.com>
Reviewed-by: David Sterba <dsterba@suse.com>
[ add comment to btrfs_freeze ]
Signed-off-by: David Sterba <dsterba@suse.com>
Signed-off-by: Chris Mason <clm@fb.com>
2016-08-01 05:28:08 +00:00
|
|
|
.unfreeze_fs = btrfs_unfreeze,
|
btrfs: add a shrinker for extent maps
Extent maps are used either to represent existing file extent items, or to
represent new extents that are going to be written and the respective file
extent items are created when the ordered extent completes.
We currently don't have any limit for how many extent maps we can have,
neither per inode nor globally. Most of the time this not too noticeable
because extent maps are removed in the following situations:
1) When evicting an inode;
2) When releasing folios (pages) through the btrfs_release_folio() address
space operation callback.
However we won't release extent maps in the folio range if the folio is
either dirty or under writeback or if the inode's i_size is less than
or equals to 16M (see try_release_extent_mapping(). This 16M i_size
constraint was added back in 2008 with commit 70dec8079d78 ("Btrfs:
extent_io and extent_state optimizations"), but there's no explanation
about why we have it or why the 16M value.
This means that for buffered IO we can reach an OOM situation due to too
many extent maps if either of the following happens:
1) There's a set of tasks constantly doing IO on many files with a size
not larger than 16M, specially if they keep the files open for very
long periods, therefore preventing inode eviction.
This requires a really high number of such files, and having many non
mergeable extent maps (due to random 4K writes for example) and a
machine with very little memory;
2) There's a set tasks constantly doing random write IO (therefore
creating many non mergeable extent maps) on files and keeping them
open for long periods of time, so inode eviction doesn't happen and
there's always a lot of dirty pages or pages under writeback,
preventing btrfs_release_folio() from releasing the respective extent
maps.
This second case was actually reported in the thread pointed by the Link
tag below, and it requires a very large file under heavy IO and a machine
with very little amount of RAM, which is probably hard to happen in
practice in a real world use case.
However when using direct IO this is not so hard to happen, because the
page cache is not used, and therefore btrfs_release_folio() is never
called. Which means extent maps are dropped only when evicting the inode,
and that means that if we have tasks that keep a file descriptor open and
keep doing IO on a very large file (or files), we can exhaust memory due
to an unbounded amount of extent maps. This is especially easy to happen
if we have a huge file with millions of small extents and their extent
maps are not mergeable (non contiguous offsets and disk locations).
This was reported in that thread with the following fio test:
$ cat test.sh
#!/bin/bash
DEV=/dev/sdj
MNT=/mnt/sdj
MOUNT_OPTIONS="-o ssd"
MKFS_OPTIONS=""
cat <<EOF > /tmp/fio-job.ini
[global]
name=fio-rand-write
filename=$MNT/fio-rand-write
rw=randwrite
bs=4K
direct=1
numjobs=16
fallocate=none
time_based
runtime=90000
[file1]
size=300G
ioengine=libaio
iodepth=16
EOF
umount $MNT &> /dev/null
mkfs.btrfs -f $MKFS_OPTIONS $DEV
mount $MOUNT_OPTIONS $DEV $MNT
fio /tmp/fio-job.ini
umount $MNT
Monitoring the btrfs_extent_map slab while running the test with:
$ watch -d -n 1 'cat /sys/kernel/slab/btrfs_extent_map/objects \
/sys/kernel/slab/btrfs_extent_map/total_objects'
Shows the number of active and total extent maps skyrocketing to tens of
millions, and on systems with a short amount of memory it's easy and quick
to get into an OOM situation, as reported in that thread.
So to avoid this issue add a shrinker that will remove extents maps, as
long as they are not pinned, and takes proper care with any concurrent
fsync to avoid missing extents (setting the full sync flag while in the
middle of a fast fsync). This shrinker is triggered through the callbacks
nr_cached_objects and free_cached_objects of struct super_operations.
The shrinker will iterate over all roots and over all inodes of each
root, and keeps track of the last scanned root and inode, so that the
next time it runs, it starts from that root and from the next inode.
This is similar to what xfs does for its inode reclaim (implements those
callbacks, and cycles through inodes by starting from where it ended
last time).
Reviewed-by: Josef Bacik <josef@toxicpanda.com>
Signed-off-by: Filipe Manana <fdmanana@suse.com>
Reviewed-by: David Sterba <dsterba@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2024-04-15 16:09:26 +00:00
|
|
|
.nr_cached_objects = btrfs_nr_cached_objects,
|
|
|
|
.free_cached_objects = btrfs_free_cached_objects,
|
2007-03-22 16:13:20 +00:00
|
|
|
};
|
2008-03-24 19:02:04 +00:00
|
|
|
|
|
|
|
static const struct file_operations btrfs_ctl_fops = {
|
2015-03-24 15:35:49 +00:00
|
|
|
.open = btrfs_control_open,
|
2008-03-24 19:02:04 +00:00
|
|
|
.unlocked_ioctl = btrfs_control_ioctl,
|
2018-09-11 19:59:08 +00:00
|
|
|
.compat_ioctl = compat_ptr_ioctl,
|
2008-03-24 19:02:04 +00:00
|
|
|
.owner = THIS_MODULE,
|
llseek: automatically add .llseek fop
All file_operations should get a .llseek operation so we can make
nonseekable_open the default for future file operations without a
.llseek pointer.
The three cases that we can automatically detect are no_llseek, seq_lseek
and default_llseek. For cases where we can we can automatically prove that
the file offset is always ignored, we use noop_llseek, which maintains
the current behavior of not returning an error from a seek.
New drivers should normally not use noop_llseek but instead use no_llseek
and call nonseekable_open at open time. Existing drivers can be converted
to do the same when the maintainer knows for certain that no user code
relies on calling seek on the device file.
The generated code is often incorrectly indented and right now contains
comments that clarify for each added line why a specific variant was
chosen. In the version that gets submitted upstream, the comments will
be gone and I will manually fix the indentation, because there does not
seem to be a way to do that using coccinelle.
Some amount of new code is currently sitting in linux-next that should get
the same modifications, which I will do at the end of the merge window.
Many thanks to Julia Lawall for helping me learn to write a semantic
patch that does all this.
===== begin semantic patch =====
// This adds an llseek= method to all file operations,
// as a preparation for making no_llseek the default.
//
// The rules are
// - use no_llseek explicitly if we do nonseekable_open
// - use seq_lseek for sequential files
// - use default_llseek if we know we access f_pos
// - use noop_llseek if we know we don't access f_pos,
// but we still want to allow users to call lseek
//
@ open1 exists @
identifier nested_open;
@@
nested_open(...)
{
<+...
nonseekable_open(...)
...+>
}
@ open exists@
identifier open_f;
identifier i, f;
identifier open1.nested_open;
@@
int open_f(struct inode *i, struct file *f)
{
<+...
(
nonseekable_open(...)
|
nested_open(...)
)
...+>
}
@ read disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ read_no_fpos disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
... when != off
}
@ write @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ write_no_fpos @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
... when != off
}
@ fops0 @
identifier fops;
@@
struct file_operations fops = {
...
};
@ has_llseek depends on fops0 @
identifier fops0.fops;
identifier llseek_f;
@@
struct file_operations fops = {
...
.llseek = llseek_f,
...
};
@ has_read depends on fops0 @
identifier fops0.fops;
identifier read_f;
@@
struct file_operations fops = {
...
.read = read_f,
...
};
@ has_write depends on fops0 @
identifier fops0.fops;
identifier write_f;
@@
struct file_operations fops = {
...
.write = write_f,
...
};
@ has_open depends on fops0 @
identifier fops0.fops;
identifier open_f;
@@
struct file_operations fops = {
...
.open = open_f,
...
};
// use no_llseek if we call nonseekable_open
////////////////////////////////////////////
@ nonseekable1 depends on !has_llseek && has_open @
identifier fops0.fops;
identifier nso ~= "nonseekable_open";
@@
struct file_operations fops = {
... .open = nso, ...
+.llseek = no_llseek, /* nonseekable */
};
@ nonseekable2 depends on !has_llseek @
identifier fops0.fops;
identifier open.open_f;
@@
struct file_operations fops = {
... .open = open_f, ...
+.llseek = no_llseek, /* open uses nonseekable */
};
// use seq_lseek for sequential files
/////////////////////////////////////
@ seq depends on !has_llseek @
identifier fops0.fops;
identifier sr ~= "seq_read";
@@
struct file_operations fops = {
... .read = sr, ...
+.llseek = seq_lseek, /* we have seq_read */
};
// use default_llseek if there is a readdir
///////////////////////////////////////////
@ fops1 depends on !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier readdir_e;
@@
// any other fop is used that changes pos
struct file_operations fops = {
... .readdir = readdir_e, ...
+.llseek = default_llseek, /* readdir is present */
};
// use default_llseek if at least one of read/write touches f_pos
/////////////////////////////////////////////////////////////////
@ fops2 depends on !fops1 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read.read_f;
@@
// read fops use offset
struct file_operations fops = {
... .read = read_f, ...
+.llseek = default_llseek, /* read accesses f_pos */
};
@ fops3 depends on !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write.write_f;
@@
// write fops use offset
struct file_operations fops = {
... .write = write_f, ...
+ .llseek = default_llseek, /* write accesses f_pos */
};
// Use noop_llseek if neither read nor write accesses f_pos
///////////////////////////////////////////////////////////
@ fops4 depends on !fops1 && !fops2 && !fops3 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
identifier write_no_fpos.write_f;
@@
// write fops use offset
struct file_operations fops = {
...
.write = write_f,
.read = read_f,
...
+.llseek = noop_llseek, /* read and write both use no f_pos */
};
@ depends on has_write && !has_read && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write_no_fpos.write_f;
@@
struct file_operations fops = {
... .write = write_f, ...
+.llseek = noop_llseek, /* write uses no f_pos */
};
@ depends on has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
@@
struct file_operations fops = {
... .read = read_f, ...
+.llseek = noop_llseek, /* read uses no f_pos */
};
@ depends on !has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
@@
struct file_operations fops = {
...
+.llseek = noop_llseek, /* no read or write fn */
};
===== End semantic patch =====
Signed-off-by: Arnd Bergmann <arnd@arndb.de>
Cc: Julia Lawall <julia@diku.dk>
Cc: Christoph Hellwig <hch@infradead.org>
2010-08-15 16:52:59 +00:00
|
|
|
.llseek = noop_llseek,
|
2008-03-24 19:02:04 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
static struct miscdevice btrfs_misc = {
|
driver core: add devname module aliases to allow module on-demand auto-loading
This adds:
alias: devname:<name>
to some common kernel modules, which will allow the on-demand loading
of the kernel module when the device node is accessed.
Ideally all these modules would be compiled-in, but distros seems too
much in love with their modularization that we need to cover the common
cases with this new facility. It will allow us to remove a bunch of pretty
useless init scripts and modprobes from init scripts.
The static device node aliases will be carried in the module itself. The
program depmod will extract this information to a file in the module directory:
$ cat /lib/modules/2.6.34-00650-g537b60d-dirty/modules.devname
# Device nodes to trigger on-demand module loading.
microcode cpu/microcode c10:184
fuse fuse c10:229
ppp_generic ppp c108:0
tun net/tun c10:200
dm_mod mapper/control c10:235
Udev will pick up the depmod created file on startup and create all the
static device nodes which the kernel modules specify, so that these modules
get automatically loaded when the device node is accessed:
$ /sbin/udevd --debug
...
static_dev_create_from_modules: mknod '/dev/cpu/microcode' c10:184
static_dev_create_from_modules: mknod '/dev/fuse' c10:229
static_dev_create_from_modules: mknod '/dev/ppp' c108:0
static_dev_create_from_modules: mknod '/dev/net/tun' c10:200
static_dev_create_from_modules: mknod '/dev/mapper/control' c10:235
udev_rules_apply_static_dev_perms: chmod '/dev/net/tun' 0666
udev_rules_apply_static_dev_perms: chmod '/dev/fuse' 0666
A few device nodes are switched to statically allocated numbers, to allow
the static nodes to work. This might also useful for systems which still run
a plain static /dev, which is completely unsafe to use with any dynamic minor
numbers.
Note:
The devname aliases must be limited to the *common* and *single*instance*
device nodes, like the misc devices, and never be used for conceptually limited
systems like the loop devices, which should rather get fixed properly and get a
control node for losetup to talk to, instead of creating a random number of
device nodes in advance, regardless if they are ever used.
This facility is to hide the mess distros are creating with too modualized
kernels, and just to hide that these modules are not compiled-in, and not to
paper-over broken concepts. Thanks! :)
Cc: Greg Kroah-Hartman <gregkh@suse.de>
Cc: David S. Miller <davem@davemloft.net>
Cc: Miklos Szeredi <miklos@szeredi.hu>
Cc: Chris Mason <chris.mason@oracle.com>
Cc: Alasdair G Kergon <agk@redhat.com>
Cc: Tigran Aivazian <tigran@aivazian.fsnet.co.uk>
Cc: Ian Kent <raven@themaw.net>
Signed-Off-By: Kay Sievers <kay.sievers@vrfy.org>
Signed-off-by: Greg Kroah-Hartman <gregkh@suse.de>
2010-05-20 16:07:20 +00:00
|
|
|
.minor = BTRFS_MINOR,
|
2008-03-24 19:02:04 +00:00
|
|
|
.name = "btrfs-control",
|
|
|
|
.fops = &btrfs_ctl_fops
|
|
|
|
};
|
|
|
|
|
driver core: add devname module aliases to allow module on-demand auto-loading
This adds:
alias: devname:<name>
to some common kernel modules, which will allow the on-demand loading
of the kernel module when the device node is accessed.
Ideally all these modules would be compiled-in, but distros seems too
much in love with their modularization that we need to cover the common
cases with this new facility. It will allow us to remove a bunch of pretty
useless init scripts and modprobes from init scripts.
The static device node aliases will be carried in the module itself. The
program depmod will extract this information to a file in the module directory:
$ cat /lib/modules/2.6.34-00650-g537b60d-dirty/modules.devname
# Device nodes to trigger on-demand module loading.
microcode cpu/microcode c10:184
fuse fuse c10:229
ppp_generic ppp c108:0
tun net/tun c10:200
dm_mod mapper/control c10:235
Udev will pick up the depmod created file on startup and create all the
static device nodes which the kernel modules specify, so that these modules
get automatically loaded when the device node is accessed:
$ /sbin/udevd --debug
...
static_dev_create_from_modules: mknod '/dev/cpu/microcode' c10:184
static_dev_create_from_modules: mknod '/dev/fuse' c10:229
static_dev_create_from_modules: mknod '/dev/ppp' c108:0
static_dev_create_from_modules: mknod '/dev/net/tun' c10:200
static_dev_create_from_modules: mknod '/dev/mapper/control' c10:235
udev_rules_apply_static_dev_perms: chmod '/dev/net/tun' 0666
udev_rules_apply_static_dev_perms: chmod '/dev/fuse' 0666
A few device nodes are switched to statically allocated numbers, to allow
the static nodes to work. This might also useful for systems which still run
a plain static /dev, which is completely unsafe to use with any dynamic minor
numbers.
Note:
The devname aliases must be limited to the *common* and *single*instance*
device nodes, like the misc devices, and never be used for conceptually limited
systems like the loop devices, which should rather get fixed properly and get a
control node for losetup to talk to, instead of creating a random number of
device nodes in advance, regardless if they are ever used.
This facility is to hide the mess distros are creating with too modualized
kernels, and just to hide that these modules are not compiled-in, and not to
paper-over broken concepts. Thanks! :)
Cc: Greg Kroah-Hartman <gregkh@suse.de>
Cc: David S. Miller <davem@davemloft.net>
Cc: Miklos Szeredi <miklos@szeredi.hu>
Cc: Chris Mason <chris.mason@oracle.com>
Cc: Alasdair G Kergon <agk@redhat.com>
Cc: Tigran Aivazian <tigran@aivazian.fsnet.co.uk>
Cc: Ian Kent <raven@themaw.net>
Signed-Off-By: Kay Sievers <kay.sievers@vrfy.org>
Signed-off-by: Greg Kroah-Hartman <gregkh@suse.de>
2010-05-20 16:07:20 +00:00
|
|
|
MODULE_ALIAS_MISCDEV(BTRFS_MINOR);
|
|
|
|
MODULE_ALIAS("devname:btrfs-control");
|
|
|
|
|
2017-11-02 23:21:50 +00:00
|
|
|
static int __init btrfs_interface_init(void)
|
2008-03-24 19:02:04 +00:00
|
|
|
{
|
|
|
|
return misc_register(&btrfs_misc);
|
|
|
|
}
|
|
|
|
|
2018-02-19 16:24:18 +00:00
|
|
|
static __cold void btrfs_interface_exit(void)
|
2008-03-24 19:02:04 +00:00
|
|
|
{
|
2015-07-30 22:59:57 +00:00
|
|
|
misc_deregister(&btrfs_misc);
|
2008-03-24 19:02:04 +00:00
|
|
|
}
|
|
|
|
|
btrfs: make module init/exit match their sequence
[BACKGROUND]
In theory init_btrfs_fs() and exit_btrfs_fs() should match their
sequence, thus normally they should look like this:
init_btrfs_fs() | exit_btrfs_fs()
----------------------+------------------------
init_A(); |
init_B(); |
init_C(); |
| exit_C();
| exit_B();
| exit_A();
So is for the error path of init_btrfs_fs().
But it's not the case, some exit functions don't match their init
functions sequence in init_btrfs_fs().
Furthermore in init_btrfs_fs(), we need to have a new error label for
each new init function we added. This is not really expandable,
especially recently we may add several new functions to init_btrfs_fs().
[ENHANCEMENT]
The patch will introduce the following things to enhance the situation:
- struct init_sequence
Just a wrapper of init and exit function pointers.
The init function must use int type as return value, thus some init
functions need to be updated to return 0.
The exit function can be NULL, as there are some init sequence just
outputting a message.
- struct mod_init_seq[] array
This is a const array, recording all the initialization we need to do
in init_btrfs_fs(), and the order follows the old init_btrfs_fs().
- bool mod_init_result[] array
This is a bool array, recording if we have initialized one entry in
mod_init_seq[].
The reason to split mod_init_seq[] and mod_init_result[] is to avoid
section mismatch in reference.
All init function are in .init.text, but if mod_init_seq[] records
the @initialized member it can no longer be const, thus will be put
into .data section, and cause modpost warning.
For init_btrfs_fs() we just call all init functions in their order in
mod_init_seq[] array, and after each call, setting corresponding
mod_init_result[] to true.
For exit_btrfs_fs() and error handling path of init_btrfs_fs(), we just
iterate mod_init_seq[] in reverse order, and skip all uninitialized
entry.
With this patch, init_btrfs_fs()/exit_btrfs_fs() will be much easier to
expand and will always follow the strict order.
Signed-off-by: Qu Wenruo <wqu@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2022-10-12 09:22:35 +00:00
|
|
|
static int __init btrfs_print_mod_info(void)
|
2013-04-30 16:51:59 +00:00
|
|
|
{
|
2018-06-20 17:03:33 +00:00
|
|
|
static const char options[] = ""
|
2013-04-30 16:51:59 +00:00
|
|
|
#ifdef CONFIG_BTRFS_DEBUG
|
|
|
|
", debug=on"
|
|
|
|
#endif
|
2013-09-03 13:25:27 +00:00
|
|
|
#ifdef CONFIG_BTRFS_ASSERT
|
|
|
|
", assert=on"
|
|
|
|
#endif
|
2017-09-29 19:43:48 +00:00
|
|
|
#ifdef CONFIG_BTRFS_FS_REF_VERIFY
|
|
|
|
", ref-verify=on"
|
2020-11-10 11:26:07 +00:00
|
|
|
#endif
|
|
|
|
#ifdef CONFIG_BLK_DEV_ZONED
|
|
|
|
", zoned=yes"
|
|
|
|
#else
|
|
|
|
", zoned=no"
|
2021-07-28 16:10:39 +00:00
|
|
|
#endif
|
|
|
|
#ifdef CONFIG_FS_VERITY
|
|
|
|
", fsverity=yes"
|
|
|
|
#else
|
|
|
|
", fsverity=no"
|
2013-04-30 16:51:59 +00:00
|
|
|
#endif
|
2018-06-20 17:03:33 +00:00
|
|
|
;
|
2023-04-05 05:49:04 +00:00
|
|
|
pr_info("Btrfs loaded%s\n", options);
|
btrfs: make module init/exit match their sequence
[BACKGROUND]
In theory init_btrfs_fs() and exit_btrfs_fs() should match their
sequence, thus normally they should look like this:
init_btrfs_fs() | exit_btrfs_fs()
----------------------+------------------------
init_A(); |
init_B(); |
init_C(); |
| exit_C();
| exit_B();
| exit_A();
So is for the error path of init_btrfs_fs().
But it's not the case, some exit functions don't match their init
functions sequence in init_btrfs_fs().
Furthermore in init_btrfs_fs(), we need to have a new error label for
each new init function we added. This is not really expandable,
especially recently we may add several new functions to init_btrfs_fs().
[ENHANCEMENT]
The patch will introduce the following things to enhance the situation:
- struct init_sequence
Just a wrapper of init and exit function pointers.
The init function must use int type as return value, thus some init
functions need to be updated to return 0.
The exit function can be NULL, as there are some init sequence just
outputting a message.
- struct mod_init_seq[] array
This is a const array, recording all the initialization we need to do
in init_btrfs_fs(), and the order follows the old init_btrfs_fs().
- bool mod_init_result[] array
This is a bool array, recording if we have initialized one entry in
mod_init_seq[].
The reason to split mod_init_seq[] and mod_init_result[] is to avoid
section mismatch in reference.
All init function are in .init.text, but if mod_init_seq[] records
the @initialized member it can no longer be const, thus will be put
into .data section, and cause modpost warning.
For init_btrfs_fs() we just call all init functions in their order in
mod_init_seq[] array, and after each call, setting corresponding
mod_init_result[] to true.
For exit_btrfs_fs() and error handling path of init_btrfs_fs(), we just
iterate mod_init_seq[] in reverse order, and skip all uninitialized
entry.
With this patch, init_btrfs_fs()/exit_btrfs_fs() will be much easier to
expand and will always follow the strict order.
Signed-off-by: Qu Wenruo <wqu@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2022-10-12 09:22:35 +00:00
|
|
|
return 0;
|
2013-04-30 16:51:59 +00:00
|
|
|
}
|
|
|
|
|
btrfs: make module init/exit match their sequence
[BACKGROUND]
In theory init_btrfs_fs() and exit_btrfs_fs() should match their
sequence, thus normally they should look like this:
init_btrfs_fs() | exit_btrfs_fs()
----------------------+------------------------
init_A(); |
init_B(); |
init_C(); |
| exit_C();
| exit_B();
| exit_A();
So is for the error path of init_btrfs_fs().
But it's not the case, some exit functions don't match their init
functions sequence in init_btrfs_fs().
Furthermore in init_btrfs_fs(), we need to have a new error label for
each new init function we added. This is not really expandable,
especially recently we may add several new functions to init_btrfs_fs().
[ENHANCEMENT]
The patch will introduce the following things to enhance the situation:
- struct init_sequence
Just a wrapper of init and exit function pointers.
The init function must use int type as return value, thus some init
functions need to be updated to return 0.
The exit function can be NULL, as there are some init sequence just
outputting a message.
- struct mod_init_seq[] array
This is a const array, recording all the initialization we need to do
in init_btrfs_fs(), and the order follows the old init_btrfs_fs().
- bool mod_init_result[] array
This is a bool array, recording if we have initialized one entry in
mod_init_seq[].
The reason to split mod_init_seq[] and mod_init_result[] is to avoid
section mismatch in reference.
All init function are in .init.text, but if mod_init_seq[] records
the @initialized member it can no longer be const, thus will be put
into .data section, and cause modpost warning.
For init_btrfs_fs() we just call all init functions in their order in
mod_init_seq[] array, and after each call, setting corresponding
mod_init_result[] to true.
For exit_btrfs_fs() and error handling path of init_btrfs_fs(), we just
iterate mod_init_seq[] in reverse order, and skip all uninitialized
entry.
With this patch, init_btrfs_fs()/exit_btrfs_fs() will be much easier to
expand and will always follow the strict order.
Signed-off-by: Qu Wenruo <wqu@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2022-10-12 09:22:35 +00:00
|
|
|
static int register_btrfs(void)
|
2007-03-21 15:12:56 +00:00
|
|
|
{
|
btrfs: make module init/exit match their sequence
[BACKGROUND]
In theory init_btrfs_fs() and exit_btrfs_fs() should match their
sequence, thus normally they should look like this:
init_btrfs_fs() | exit_btrfs_fs()
----------------------+------------------------
init_A(); |
init_B(); |
init_C(); |
| exit_C();
| exit_B();
| exit_A();
So is for the error path of init_btrfs_fs().
But it's not the case, some exit functions don't match their init
functions sequence in init_btrfs_fs().
Furthermore in init_btrfs_fs(), we need to have a new error label for
each new init function we added. This is not really expandable,
especially recently we may add several new functions to init_btrfs_fs().
[ENHANCEMENT]
The patch will introduce the following things to enhance the situation:
- struct init_sequence
Just a wrapper of init and exit function pointers.
The init function must use int type as return value, thus some init
functions need to be updated to return 0.
The exit function can be NULL, as there are some init sequence just
outputting a message.
- struct mod_init_seq[] array
This is a const array, recording all the initialization we need to do
in init_btrfs_fs(), and the order follows the old init_btrfs_fs().
- bool mod_init_result[] array
This is a bool array, recording if we have initialized one entry in
mod_init_seq[].
The reason to split mod_init_seq[] and mod_init_result[] is to avoid
section mismatch in reference.
All init function are in .init.text, but if mod_init_seq[] records
the @initialized member it can no longer be const, thus will be put
into .data section, and cause modpost warning.
For init_btrfs_fs() we just call all init functions in their order in
mod_init_seq[] array, and after each call, setting corresponding
mod_init_result[] to true.
For exit_btrfs_fs() and error handling path of init_btrfs_fs(), we just
iterate mod_init_seq[] in reverse order, and skip all uninitialized
entry.
With this patch, init_btrfs_fs()/exit_btrfs_fs() will be much easier to
expand and will always follow the strict order.
Signed-off-by: Qu Wenruo <wqu@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2022-10-12 09:22:35 +00:00
|
|
|
return register_filesystem(&btrfs_fs_type);
|
|
|
|
}
|
2014-07-29 22:55:42 +00:00
|
|
|
|
btrfs: make module init/exit match their sequence
[BACKGROUND]
In theory init_btrfs_fs() and exit_btrfs_fs() should match their
sequence, thus normally they should look like this:
init_btrfs_fs() | exit_btrfs_fs()
----------------------+------------------------
init_A(); |
init_B(); |
init_C(); |
| exit_C();
| exit_B();
| exit_A();
So is for the error path of init_btrfs_fs().
But it's not the case, some exit functions don't match their init
functions sequence in init_btrfs_fs().
Furthermore in init_btrfs_fs(), we need to have a new error label for
each new init function we added. This is not really expandable,
especially recently we may add several new functions to init_btrfs_fs().
[ENHANCEMENT]
The patch will introduce the following things to enhance the situation:
- struct init_sequence
Just a wrapper of init and exit function pointers.
The init function must use int type as return value, thus some init
functions need to be updated to return 0.
The exit function can be NULL, as there are some init sequence just
outputting a message.
- struct mod_init_seq[] array
This is a const array, recording all the initialization we need to do
in init_btrfs_fs(), and the order follows the old init_btrfs_fs().
- bool mod_init_result[] array
This is a bool array, recording if we have initialized one entry in
mod_init_seq[].
The reason to split mod_init_seq[] and mod_init_result[] is to avoid
section mismatch in reference.
All init function are in .init.text, but if mod_init_seq[] records
the @initialized member it can no longer be const, thus will be put
into .data section, and cause modpost warning.
For init_btrfs_fs() we just call all init functions in their order in
mod_init_seq[] array, and after each call, setting corresponding
mod_init_result[] to true.
For exit_btrfs_fs() and error handling path of init_btrfs_fs(), we just
iterate mod_init_seq[] in reverse order, and skip all uninitialized
entry.
With this patch, init_btrfs_fs()/exit_btrfs_fs() will be much easier to
expand and will always follow the strict order.
Signed-off-by: Qu Wenruo <wqu@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2022-10-12 09:22:35 +00:00
|
|
|
static void unregister_btrfs(void)
|
|
|
|
{
|
|
|
|
unregister_filesystem(&btrfs_fs_type);
|
|
|
|
}
|
2013-08-14 19:05:12 +00:00
|
|
|
|
btrfs: make module init/exit match their sequence
[BACKGROUND]
In theory init_btrfs_fs() and exit_btrfs_fs() should match their
sequence, thus normally they should look like this:
init_btrfs_fs() | exit_btrfs_fs()
----------------------+------------------------
init_A(); |
init_B(); |
init_C(); |
| exit_C();
| exit_B();
| exit_A();
So is for the error path of init_btrfs_fs().
But it's not the case, some exit functions don't match their init
functions sequence in init_btrfs_fs().
Furthermore in init_btrfs_fs(), we need to have a new error label for
each new init function we added. This is not really expandable,
especially recently we may add several new functions to init_btrfs_fs().
[ENHANCEMENT]
The patch will introduce the following things to enhance the situation:
- struct init_sequence
Just a wrapper of init and exit function pointers.
The init function must use int type as return value, thus some init
functions need to be updated to return 0.
The exit function can be NULL, as there are some init sequence just
outputting a message.
- struct mod_init_seq[] array
This is a const array, recording all the initialization we need to do
in init_btrfs_fs(), and the order follows the old init_btrfs_fs().
- bool mod_init_result[] array
This is a bool array, recording if we have initialized one entry in
mod_init_seq[].
The reason to split mod_init_seq[] and mod_init_result[] is to avoid
section mismatch in reference.
All init function are in .init.text, but if mod_init_seq[] records
the @initialized member it can no longer be const, thus will be put
into .data section, and cause modpost warning.
For init_btrfs_fs() we just call all init functions in their order in
mod_init_seq[] array, and after each call, setting corresponding
mod_init_result[] to true.
For exit_btrfs_fs() and error handling path of init_btrfs_fs(), we just
iterate mod_init_seq[] in reverse order, and skip all uninitialized
entry.
With this patch, init_btrfs_fs()/exit_btrfs_fs() will be much easier to
expand and will always follow the strict order.
Signed-off-by: Qu Wenruo <wqu@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2022-10-12 09:22:35 +00:00
|
|
|
/* Helper structure for long init/exit functions. */
|
|
|
|
struct init_sequence {
|
|
|
|
int (*init_func)(void);
|
|
|
|
/* Can be NULL if the init_func doesn't need cleanup. */
|
|
|
|
void (*exit_func)(void);
|
|
|
|
};
|
2013-08-14 19:05:12 +00:00
|
|
|
|
btrfs: make module init/exit match their sequence
[BACKGROUND]
In theory init_btrfs_fs() and exit_btrfs_fs() should match their
sequence, thus normally they should look like this:
init_btrfs_fs() | exit_btrfs_fs()
----------------------+------------------------
init_A(); |
init_B(); |
init_C(); |
| exit_C();
| exit_B();
| exit_A();
So is for the error path of init_btrfs_fs().
But it's not the case, some exit functions don't match their init
functions sequence in init_btrfs_fs().
Furthermore in init_btrfs_fs(), we need to have a new error label for
each new init function we added. This is not really expandable,
especially recently we may add several new functions to init_btrfs_fs().
[ENHANCEMENT]
The patch will introduce the following things to enhance the situation:
- struct init_sequence
Just a wrapper of init and exit function pointers.
The init function must use int type as return value, thus some init
functions need to be updated to return 0.
The exit function can be NULL, as there are some init sequence just
outputting a message.
- struct mod_init_seq[] array
This is a const array, recording all the initialization we need to do
in init_btrfs_fs(), and the order follows the old init_btrfs_fs().
- bool mod_init_result[] array
This is a bool array, recording if we have initialized one entry in
mod_init_seq[].
The reason to split mod_init_seq[] and mod_init_result[] is to avoid
section mismatch in reference.
All init function are in .init.text, but if mod_init_seq[] records
the @initialized member it can no longer be const, thus will be put
into .data section, and cause modpost warning.
For init_btrfs_fs() we just call all init functions in their order in
mod_init_seq[] array, and after each call, setting corresponding
mod_init_result[] to true.
For exit_btrfs_fs() and error handling path of init_btrfs_fs(), we just
iterate mod_init_seq[] in reverse order, and skip all uninitialized
entry.
With this patch, init_btrfs_fs()/exit_btrfs_fs() will be much easier to
expand and will always follow the strict order.
Signed-off-by: Qu Wenruo <wqu@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2022-10-12 09:22:35 +00:00
|
|
|
static const struct init_sequence mod_init_seq[] = {
|
|
|
|
{
|
|
|
|
.init_func = btrfs_props_init,
|
|
|
|
.exit_func = NULL,
|
|
|
|
}, {
|
|
|
|
.init_func = btrfs_init_sysfs,
|
|
|
|
.exit_func = btrfs_exit_sysfs,
|
|
|
|
}, {
|
|
|
|
.init_func = btrfs_init_compress,
|
|
|
|
.exit_func = btrfs_exit_compress,
|
|
|
|
}, {
|
|
|
|
.init_func = btrfs_init_cachep,
|
|
|
|
.exit_func = btrfs_destroy_cachep,
|
2024-06-25 14:52:28 +00:00
|
|
|
}, {
|
|
|
|
.init_func = btrfs_init_dio,
|
|
|
|
.exit_func = btrfs_destroy_dio,
|
btrfs: make module init/exit match their sequence
[BACKGROUND]
In theory init_btrfs_fs() and exit_btrfs_fs() should match their
sequence, thus normally they should look like this:
init_btrfs_fs() | exit_btrfs_fs()
----------------------+------------------------
init_A(); |
init_B(); |
init_C(); |
| exit_C();
| exit_B();
| exit_A();
So is for the error path of init_btrfs_fs().
But it's not the case, some exit functions don't match their init
functions sequence in init_btrfs_fs().
Furthermore in init_btrfs_fs(), we need to have a new error label for
each new init function we added. This is not really expandable,
especially recently we may add several new functions to init_btrfs_fs().
[ENHANCEMENT]
The patch will introduce the following things to enhance the situation:
- struct init_sequence
Just a wrapper of init and exit function pointers.
The init function must use int type as return value, thus some init
functions need to be updated to return 0.
The exit function can be NULL, as there are some init sequence just
outputting a message.
- struct mod_init_seq[] array
This is a const array, recording all the initialization we need to do
in init_btrfs_fs(), and the order follows the old init_btrfs_fs().
- bool mod_init_result[] array
This is a bool array, recording if we have initialized one entry in
mod_init_seq[].
The reason to split mod_init_seq[] and mod_init_result[] is to avoid
section mismatch in reference.
All init function are in .init.text, but if mod_init_seq[] records
the @initialized member it can no longer be const, thus will be put
into .data section, and cause modpost warning.
For init_btrfs_fs() we just call all init functions in their order in
mod_init_seq[] array, and after each call, setting corresponding
mod_init_result[] to true.
For exit_btrfs_fs() and error handling path of init_btrfs_fs(), we just
iterate mod_init_seq[] in reverse order, and skip all uninitialized
entry.
With this patch, init_btrfs_fs()/exit_btrfs_fs() will be much easier to
expand and will always follow the strict order.
Signed-off-by: Qu Wenruo <wqu@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2022-10-12 09:22:35 +00:00
|
|
|
}, {
|
|
|
|
.init_func = btrfs_transaction_init,
|
|
|
|
.exit_func = btrfs_transaction_exit,
|
|
|
|
}, {
|
|
|
|
.init_func = btrfs_ctree_init,
|
|
|
|
.exit_func = btrfs_ctree_exit,
|
|
|
|
}, {
|
|
|
|
.init_func = btrfs_free_space_init,
|
|
|
|
.exit_func = btrfs_free_space_exit,
|
|
|
|
}, {
|
|
|
|
.init_func = extent_state_init_cachep,
|
|
|
|
.exit_func = extent_state_free_cachep,
|
|
|
|
}, {
|
|
|
|
.init_func = extent_buffer_init_cachep,
|
|
|
|
.exit_func = extent_buffer_free_cachep,
|
|
|
|
}, {
|
|
|
|
.init_func = btrfs_bioset_init,
|
|
|
|
.exit_func = btrfs_bioset_exit,
|
|
|
|
}, {
|
|
|
|
.init_func = extent_map_init,
|
|
|
|
.exit_func = extent_map_exit,
|
|
|
|
}, {
|
|
|
|
.init_func = ordered_data_init,
|
|
|
|
.exit_func = ordered_data_exit,
|
|
|
|
}, {
|
|
|
|
.init_func = btrfs_delayed_inode_init,
|
|
|
|
.exit_func = btrfs_delayed_inode_exit,
|
|
|
|
}, {
|
|
|
|
.init_func = btrfs_auto_defrag_init,
|
|
|
|
.exit_func = btrfs_auto_defrag_exit,
|
|
|
|
}, {
|
|
|
|
.init_func = btrfs_delayed_ref_init,
|
|
|
|
.exit_func = btrfs_delayed_ref_exit,
|
|
|
|
}, {
|
|
|
|
.init_func = btrfs_prelim_ref_init,
|
|
|
|
.exit_func = btrfs_prelim_ref_exit,
|
|
|
|
}, {
|
|
|
|
.init_func = btrfs_interface_init,
|
|
|
|
.exit_func = btrfs_interface_exit,
|
|
|
|
}, {
|
|
|
|
.init_func = btrfs_print_mod_info,
|
|
|
|
.exit_func = NULL,
|
|
|
|
}, {
|
|
|
|
.init_func = btrfs_run_sanity_tests,
|
|
|
|
.exit_func = NULL,
|
|
|
|
}, {
|
|
|
|
.init_func = register_btrfs,
|
|
|
|
.exit_func = unregister_btrfs,
|
|
|
|
}
|
|
|
|
};
|
2013-03-15 13:47:08 +00:00
|
|
|
|
btrfs: make module init/exit match their sequence
[BACKGROUND]
In theory init_btrfs_fs() and exit_btrfs_fs() should match their
sequence, thus normally they should look like this:
init_btrfs_fs() | exit_btrfs_fs()
----------------------+------------------------
init_A(); |
init_B(); |
init_C(); |
| exit_C();
| exit_B();
| exit_A();
So is for the error path of init_btrfs_fs().
But it's not the case, some exit functions don't match their init
functions sequence in init_btrfs_fs().
Furthermore in init_btrfs_fs(), we need to have a new error label for
each new init function we added. This is not really expandable,
especially recently we may add several new functions to init_btrfs_fs().
[ENHANCEMENT]
The patch will introduce the following things to enhance the situation:
- struct init_sequence
Just a wrapper of init and exit function pointers.
The init function must use int type as return value, thus some init
functions need to be updated to return 0.
The exit function can be NULL, as there are some init sequence just
outputting a message.
- struct mod_init_seq[] array
This is a const array, recording all the initialization we need to do
in init_btrfs_fs(), and the order follows the old init_btrfs_fs().
- bool mod_init_result[] array
This is a bool array, recording if we have initialized one entry in
mod_init_seq[].
The reason to split mod_init_seq[] and mod_init_result[] is to avoid
section mismatch in reference.
All init function are in .init.text, but if mod_init_seq[] records
the @initialized member it can no longer be const, thus will be put
into .data section, and cause modpost warning.
For init_btrfs_fs() we just call all init functions in their order in
mod_init_seq[] array, and after each call, setting corresponding
mod_init_result[] to true.
For exit_btrfs_fs() and error handling path of init_btrfs_fs(), we just
iterate mod_init_seq[] in reverse order, and skip all uninitialized
entry.
With this patch, init_btrfs_fs()/exit_btrfs_fs() will be much easier to
expand and will always follow the strict order.
Signed-off-by: Qu Wenruo <wqu@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2022-10-12 09:22:35 +00:00
|
|
|
static bool mod_init_result[ARRAY_SIZE(mod_init_seq)];
|
2007-11-19 15:22:33 +00:00
|
|
|
|
2022-10-19 16:21:42 +00:00
|
|
|
static __always_inline void btrfs_exit_btrfs_fs(void)
|
btrfs: make module init/exit match their sequence
[BACKGROUND]
In theory init_btrfs_fs() and exit_btrfs_fs() should match their
sequence, thus normally they should look like this:
init_btrfs_fs() | exit_btrfs_fs()
----------------------+------------------------
init_A(); |
init_B(); |
init_C(); |
| exit_C();
| exit_B();
| exit_A();
So is for the error path of init_btrfs_fs().
But it's not the case, some exit functions don't match their init
functions sequence in init_btrfs_fs().
Furthermore in init_btrfs_fs(), we need to have a new error label for
each new init function we added. This is not really expandable,
especially recently we may add several new functions to init_btrfs_fs().
[ENHANCEMENT]
The patch will introduce the following things to enhance the situation:
- struct init_sequence
Just a wrapper of init and exit function pointers.
The init function must use int type as return value, thus some init
functions need to be updated to return 0.
The exit function can be NULL, as there are some init sequence just
outputting a message.
- struct mod_init_seq[] array
This is a const array, recording all the initialization we need to do
in init_btrfs_fs(), and the order follows the old init_btrfs_fs().
- bool mod_init_result[] array
This is a bool array, recording if we have initialized one entry in
mod_init_seq[].
The reason to split mod_init_seq[] and mod_init_result[] is to avoid
section mismatch in reference.
All init function are in .init.text, but if mod_init_seq[] records
the @initialized member it can no longer be const, thus will be put
into .data section, and cause modpost warning.
For init_btrfs_fs() we just call all init functions in their order in
mod_init_seq[] array, and after each call, setting corresponding
mod_init_result[] to true.
For exit_btrfs_fs() and error handling path of init_btrfs_fs(), we just
iterate mod_init_seq[] in reverse order, and skip all uninitialized
entry.
With this patch, init_btrfs_fs()/exit_btrfs_fs() will be much easier to
expand and will always follow the strict order.
Signed-off-by: Qu Wenruo <wqu@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2022-10-12 09:22:35 +00:00
|
|
|
{
|
|
|
|
int i;
|
btrfs: Remove custom crc32c init code
The custom crc32 init code was introduced in
14a958e678cd ("Btrfs: fix btrfs boot when compiled as built-in") to
enable using btrfs as a built-in. However, later as pointed out by
60efa5eb2e88 ("Btrfs: use late_initcall instead of module_init") this
wasn't enough and finally btrfs was switched to late_initcall which
comes after the generic crc32c implementation is initiliased. The
latter commit superseeded the former. Now that we don't have to
maintain our own code let's just remove it and switch to using the
generic implementation.
Despite touching a lot of files the patch is really simple. Here is the gist of
the changes:
1. Select LIBCRC32C rather than the low-level modules.
2. s/btrfs_crc32c/crc32c/g
3. replace hash.h with linux/crc32c.h
4. Move the btrfs namehash funcs to ctree.h and change the tree accordingly.
I've tested this with btrfs being both a module and a built-in and xfstest
doesn't complain.
Does seem to fix the longstanding problem of not automatically selectiong
the crc32c module when btrfs is used. Possibly there is a workaround in
dracut.
The modinfo confirms that now all the module dependencies are there:
before:
depends: zstd_compress,zstd_decompress,raid6_pq,xor,zlib_deflate
after:
depends: libcrc32c,zstd_compress,zstd_decompress,raid6_pq,xor,zlib_deflate
Signed-off-by: Nikolay Borisov <nborisov@suse.com>
Reviewed-by: David Sterba <dsterba@suse.com>
[ add more info to changelog from mails ]
Signed-off-by: David Sterba <dsterba@suse.com>
2018-01-08 09:45:05 +00:00
|
|
|
|
btrfs: make module init/exit match their sequence
[BACKGROUND]
In theory init_btrfs_fs() and exit_btrfs_fs() should match their
sequence, thus normally they should look like this:
init_btrfs_fs() | exit_btrfs_fs()
----------------------+------------------------
init_A(); |
init_B(); |
init_C(); |
| exit_C();
| exit_B();
| exit_A();
So is for the error path of init_btrfs_fs().
But it's not the case, some exit functions don't match their init
functions sequence in init_btrfs_fs().
Furthermore in init_btrfs_fs(), we need to have a new error label for
each new init function we added. This is not really expandable,
especially recently we may add several new functions to init_btrfs_fs().
[ENHANCEMENT]
The patch will introduce the following things to enhance the situation:
- struct init_sequence
Just a wrapper of init and exit function pointers.
The init function must use int type as return value, thus some init
functions need to be updated to return 0.
The exit function can be NULL, as there are some init sequence just
outputting a message.
- struct mod_init_seq[] array
This is a const array, recording all the initialization we need to do
in init_btrfs_fs(), and the order follows the old init_btrfs_fs().
- bool mod_init_result[] array
This is a bool array, recording if we have initialized one entry in
mod_init_seq[].
The reason to split mod_init_seq[] and mod_init_result[] is to avoid
section mismatch in reference.
All init function are in .init.text, but if mod_init_seq[] records
the @initialized member it can no longer be const, thus will be put
into .data section, and cause modpost warning.
For init_btrfs_fs() we just call all init functions in their order in
mod_init_seq[] array, and after each call, setting corresponding
mod_init_result[] to true.
For exit_btrfs_fs() and error handling path of init_btrfs_fs(), we just
iterate mod_init_seq[] in reverse order, and skip all uninitialized
entry.
With this patch, init_btrfs_fs()/exit_btrfs_fs() will be much easier to
expand and will always follow the strict order.
Signed-off-by: Qu Wenruo <wqu@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2022-10-12 09:22:35 +00:00
|
|
|
for (i = ARRAY_SIZE(mod_init_seq) - 1; i >= 0; i--) {
|
|
|
|
if (!mod_init_result[i])
|
|
|
|
continue;
|
|
|
|
if (mod_init_seq[i].exit_func)
|
|
|
|
mod_init_seq[i].exit_func();
|
|
|
|
mod_init_result[i] = false;
|
|
|
|
}
|
2007-03-21 15:12:56 +00:00
|
|
|
}
|
|
|
|
|
2022-10-19 16:21:42 +00:00
|
|
|
static void __exit exit_btrfs_fs(void)
|
|
|
|
{
|
|
|
|
btrfs_exit_btrfs_fs();
|
2022-12-13 10:42:26 +00:00
|
|
|
btrfs_cleanup_fs_uuids();
|
2022-10-19 16:21:42 +00:00
|
|
|
}
|
|
|
|
|
btrfs: make module init/exit match their sequence
[BACKGROUND]
In theory init_btrfs_fs() and exit_btrfs_fs() should match their
sequence, thus normally they should look like this:
init_btrfs_fs() | exit_btrfs_fs()
----------------------+------------------------
init_A(); |
init_B(); |
init_C(); |
| exit_C();
| exit_B();
| exit_A();
So is for the error path of init_btrfs_fs().
But it's not the case, some exit functions don't match their init
functions sequence in init_btrfs_fs().
Furthermore in init_btrfs_fs(), we need to have a new error label for
each new init function we added. This is not really expandable,
especially recently we may add several new functions to init_btrfs_fs().
[ENHANCEMENT]
The patch will introduce the following things to enhance the situation:
- struct init_sequence
Just a wrapper of init and exit function pointers.
The init function must use int type as return value, thus some init
functions need to be updated to return 0.
The exit function can be NULL, as there are some init sequence just
outputting a message.
- struct mod_init_seq[] array
This is a const array, recording all the initialization we need to do
in init_btrfs_fs(), and the order follows the old init_btrfs_fs().
- bool mod_init_result[] array
This is a bool array, recording if we have initialized one entry in
mod_init_seq[].
The reason to split mod_init_seq[] and mod_init_result[] is to avoid
section mismatch in reference.
All init function are in .init.text, but if mod_init_seq[] records
the @initialized member it can no longer be const, thus will be put
into .data section, and cause modpost warning.
For init_btrfs_fs() we just call all init functions in their order in
mod_init_seq[] array, and after each call, setting corresponding
mod_init_result[] to true.
For exit_btrfs_fs() and error handling path of init_btrfs_fs(), we just
iterate mod_init_seq[] in reverse order, and skip all uninitialized
entry.
With this patch, init_btrfs_fs()/exit_btrfs_fs() will be much easier to
expand and will always follow the strict order.
Signed-off-by: Qu Wenruo <wqu@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2022-10-12 09:22:35 +00:00
|
|
|
static int __init init_btrfs_fs(void)
|
2007-03-21 15:12:56 +00:00
|
|
|
{
|
btrfs: make module init/exit match their sequence
[BACKGROUND]
In theory init_btrfs_fs() and exit_btrfs_fs() should match their
sequence, thus normally they should look like this:
init_btrfs_fs() | exit_btrfs_fs()
----------------------+------------------------
init_A(); |
init_B(); |
init_C(); |
| exit_C();
| exit_B();
| exit_A();
So is for the error path of init_btrfs_fs().
But it's not the case, some exit functions don't match their init
functions sequence in init_btrfs_fs().
Furthermore in init_btrfs_fs(), we need to have a new error label for
each new init function we added. This is not really expandable,
especially recently we may add several new functions to init_btrfs_fs().
[ENHANCEMENT]
The patch will introduce the following things to enhance the situation:
- struct init_sequence
Just a wrapper of init and exit function pointers.
The init function must use int type as return value, thus some init
functions need to be updated to return 0.
The exit function can be NULL, as there are some init sequence just
outputting a message.
- struct mod_init_seq[] array
This is a const array, recording all the initialization we need to do
in init_btrfs_fs(), and the order follows the old init_btrfs_fs().
- bool mod_init_result[] array
This is a bool array, recording if we have initialized one entry in
mod_init_seq[].
The reason to split mod_init_seq[] and mod_init_result[] is to avoid
section mismatch in reference.
All init function are in .init.text, but if mod_init_seq[] records
the @initialized member it can no longer be const, thus will be put
into .data section, and cause modpost warning.
For init_btrfs_fs() we just call all init functions in their order in
mod_init_seq[] array, and after each call, setting corresponding
mod_init_result[] to true.
For exit_btrfs_fs() and error handling path of init_btrfs_fs(), we just
iterate mod_init_seq[] in reverse order, and skip all uninitialized
entry.
With this patch, init_btrfs_fs()/exit_btrfs_fs() will be much easier to
expand and will always follow the strict order.
Signed-off-by: Qu Wenruo <wqu@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2022-10-12 09:22:35 +00:00
|
|
|
int ret;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < ARRAY_SIZE(mod_init_seq); i++) {
|
|
|
|
ASSERT(!mod_init_result[i]);
|
|
|
|
ret = mod_init_seq[i].init_func();
|
2022-10-19 16:21:42 +00:00
|
|
|
if (ret < 0) {
|
|
|
|
btrfs_exit_btrfs_fs();
|
|
|
|
return ret;
|
|
|
|
}
|
btrfs: make module init/exit match their sequence
[BACKGROUND]
In theory init_btrfs_fs() and exit_btrfs_fs() should match their
sequence, thus normally they should look like this:
init_btrfs_fs() | exit_btrfs_fs()
----------------------+------------------------
init_A(); |
init_B(); |
init_C(); |
| exit_C();
| exit_B();
| exit_A();
So is for the error path of init_btrfs_fs().
But it's not the case, some exit functions don't match their init
functions sequence in init_btrfs_fs().
Furthermore in init_btrfs_fs(), we need to have a new error label for
each new init function we added. This is not really expandable,
especially recently we may add several new functions to init_btrfs_fs().
[ENHANCEMENT]
The patch will introduce the following things to enhance the situation:
- struct init_sequence
Just a wrapper of init and exit function pointers.
The init function must use int type as return value, thus some init
functions need to be updated to return 0.
The exit function can be NULL, as there are some init sequence just
outputting a message.
- struct mod_init_seq[] array
This is a const array, recording all the initialization we need to do
in init_btrfs_fs(), and the order follows the old init_btrfs_fs().
- bool mod_init_result[] array
This is a bool array, recording if we have initialized one entry in
mod_init_seq[].
The reason to split mod_init_seq[] and mod_init_result[] is to avoid
section mismatch in reference.
All init function are in .init.text, but if mod_init_seq[] records
the @initialized member it can no longer be const, thus will be put
into .data section, and cause modpost warning.
For init_btrfs_fs() we just call all init functions in their order in
mod_init_seq[] array, and after each call, setting corresponding
mod_init_result[] to true.
For exit_btrfs_fs() and error handling path of init_btrfs_fs(), we just
iterate mod_init_seq[] in reverse order, and skip all uninitialized
entry.
With this patch, init_btrfs_fs()/exit_btrfs_fs() will be much easier to
expand and will always follow the strict order.
Signed-off-by: Qu Wenruo <wqu@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2022-10-12 09:22:35 +00:00
|
|
|
mod_init_result[i] = true;
|
|
|
|
}
|
|
|
|
return 0;
|
2007-03-21 15:12:56 +00:00
|
|
|
}
|
|
|
|
|
2014-02-01 21:27:56 +00:00
|
|
|
late_initcall(init_btrfs_fs);
|
2007-03-21 15:12:56 +00:00
|
|
|
module_exit(exit_btrfs_fs)
|
|
|
|
|
2024-05-27 17:56:59 +00:00
|
|
|
MODULE_DESCRIPTION("B-Tree File System (BTRFS)");
|
2007-03-21 15:12:56 +00:00
|
|
|
MODULE_LICENSE("GPL");
|
2019-06-03 14:58:57 +00:00
|
|
|
MODULE_SOFTDEP("pre: crc32c");
|
2019-10-07 09:11:01 +00:00
|
|
|
MODULE_SOFTDEP("pre: xxhash64");
|
2019-10-07 09:11:02 +00:00
|
|
|
MODULE_SOFTDEP("pre: sha256");
|
2019-10-07 09:11:02 +00:00
|
|
|
MODULE_SOFTDEP("pre: blake2b-256");
|