2018-04-03 19:16:55 +02:00
|
|
|
|
2008-01-08 15:46:30 -05:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-04-03 19:16:55 +02:00
|
|
|
|
|
|
|
|
|
2008-01-08 15:46:30 -05:00
|
|
|
|
2008-07-17 13:53:27 -04:00
|
|
|
|
2008-01-08 15:46:30 -05:00
|
|
|
|
2010-02-02 21:48:28 +00:00
|
|
|
|
2008-01-08 15:46:30 -05:00
|
|
|
|
2008-07-17 12:53:50 -04:00
|
|
|
|
2008-01-08 15:46:30 -05:00
|
|
|
|
|
|
|
|
|
2008-07-17 12:53:50 -04:00
|
|
|
|
Btrfs: move data checksumming into a dedicated tree
Btrfs stores checksums for each data block. Until now, they have
been stored in the subvolume trees, indexed by the inode that is
referencing the data block. This means that when we read the inode,
we've probably read in at least some checksums as well.
But, this has a few problems:
* The checksums are indexed by logical offset in the file. When
compression is on, this means we have to do the expensive checksumming
on the uncompressed data. It would be faster if we could checksum
the compressed data instead.
* If we implement encryption, we'll be checksumming the plain text and
storing that on disk. This is significantly less secure.
* For either compression or encryption, we have to get the plain text
back before we can verify the checksum as correct. This makes the raid
layer balancing and extent moving much more expensive.
* It makes the front end caching code more complex, as we have touch
the subvolume and inodes as we cache extents.
* There is potentitally one copy of the checksum in each subvolume
referencing an extent.
The solution used here is to store the extent checksums in a dedicated
tree. This allows us to index the checksums by phyiscal extent
start and length. It means:
* The checksum is against the data stored on disk, after any compression
or encryption is done.
* The checksum is stored in a central location, and can be verified without
following back references, or reading inodes.
This makes compression significantly faster by reducing the amount of
data that needs to be checksummed. It will also allow much faster
raid management code in general.
The checksums are indexed by a key with a fixed objectid (a magic value
in ctree.h) and offset set to the starting byte of the extent. This
allows us to copy the checksum items into the fsync log tree directly (or
any other tree), without having to invent a second format for them.
Signed-off-by: Chris Mason <chris.mason@oracle.com>
2008-12-08 16:58:54 -05:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-07-18 06:17:13 -04:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Btrfs: remove btrfs_sector_sum structure
Using the structure btrfs_sector_sum to keep the checksum value is
unnecessary, because the extents that btrfs_sector_sum points to are
continuous, we can find out the expected checksums by btrfs_ordered_sum's
bytenr and the offset, so we can remove btrfs_sector_sum's bytenr. After
removing bytenr, there is only one member in the structure, so it makes
no sense to keep the structure, just remove it, and use a u32 array to
store the checksum value.
By this change, we don't use the while loop to get the checksums one by
one. Now, we can get several checksum value at one time, it improved the
performance by ~74% on my SSD (31MB/s -> 54MB/s).
test command:
# dd if=/dev/zero of=/mnt/btrfs/file0 bs=1M count=1024 oflag=sync
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Josef Bacik <jbacik@fusionio.com>
2013-06-19 10:36:09 +08:00
|
|
|
|
2008-07-17 12:53:50 -04:00
|
|
|
|
Btrfs: remove btrfs_sector_sum structure
Using the structure btrfs_sector_sum to keep the checksum value is
unnecessary, because the extents that btrfs_sector_sum points to are
continuous, we can find out the expected checksums by btrfs_ordered_sum's
bytenr and the offset, so we can remove btrfs_sector_sum's bytenr. After
removing bytenr, there is only one member in the structure, so it makes
no sense to keep the structure, just remove it, and use a u32 array to
store the checksum value.
By this change, we don't use the while loop to get the checksums one by
one. Now, we can get several checksum value at one time, it improved the
performance by ~74% on my SSD (31MB/s -> 54MB/s).
test command:
# dd if=/dev/zero of=/mnt/btrfs/file0 bs=1M count=1024 oflag=sync
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
Signed-off-by: Josef Bacik <jbacik@fusionio.com>
2013-06-19 10:36:09 +08:00
|
|
|
|
2019-05-22 10:19:01 +02:00
|
|
|
|
2008-07-17 12:53:50 -04:00
|
|
|
|
|
|
|
|
|
2008-07-17 13:53:27 -04:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-11-27 15:17:47 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2017-02-13 15:35:09 -08:00
|
|
|
|
2008-07-17 12:53:50 -04:00
|
|
|
|
2008-07-17 13:53:27 -04:00
|
|
|
|
2008-07-17 12:53:50 -04:00
|
|
|
|
2008-07-17 13:53:27 -04:00
|
|
|
|
|
|
|
|
|
2008-07-17 12:53:50 -04:00
|
|
|
|
2008-07-17 13:53:27 -04:00
|
|
|
|
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 14:49:59 -04:00
|
|
|
|
2008-07-17 12:53:50 -04:00
|
|
|
|
2008-07-17 13:53:27 -04:00
|
|
|
|
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 14:49:59 -04:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-09-02 16:53:46 -04:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2012-09-06 04:01:21 -06:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-08-29 13:57:21 -04:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-07-17 13:53:27 -04:00
|
|
|
|
2008-07-17 12:53:50 -04:00
|
|
|
|
2008-07-17 13:53:27 -04:00
|
|
|
|
2010-12-17 14:21:50 +08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-07-17 13:53:27 -04:00
|
|
|
|
2017-03-03 10:55:13 +02:00
|
|
|
|
2008-07-17 13:53:27 -04:00
|
|
|
|
2008-07-24 11:57:52 -04:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-07-17 13:53:27 -04:00
|
|
|
|
2008-07-17 12:53:50 -04:00
|
|
|
|
2008-07-17 13:53:27 -04:00
|
|
|
|
2012-10-12 15:27:49 -04:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-11-21 14:52:38 -05:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-07-17 13:53:27 -04:00
|
|
|
|
2008-07-17 12:53:50 -04:00
|
|
|
|
2008-07-17 13:53:27 -04:00
|
|
|
|
|
|
|
|
|
2008-07-17 12:53:50 -04:00
|
|
|
|
2008-07-24 11:57:52 -04:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2012-05-02 14:00:54 -04:00
|
|
|
|
2014-02-28 10:46:19 +08:00
|
|
|
|
2008-07-17 12:53:50 -04:00
|
|
|
|
2012-10-25 09:41:36 +00:00
|
|
|
|
2014-02-28 10:46:19 +08:00
|
|
|
|
2012-10-25 09:41:36 +00:00
|
|
|
|
|
|
|
|
|
2008-07-17 12:53:50 -04:00
|
|
|
|
2008-07-17 13:53:27 -04:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-06-15 09:22:56 -04:00
|
|
|
|
2008-07-23 09:26:26 -04:00
|
|
|
|
2008-07-17 12:53:50 -04:00
|
|
|
|
2016-06-15 09:22:56 -04:00
|
|
|
|
2018-02-07 11:19:10 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-07-17 12:53:50 -04:00
|
|
|
|
|
|
|
|
|
2008-01-08 15:46:30 -05:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2010-02-02 21:48:28 +00:00
|
|
|
|
2010-02-23 19:43:04 +00:00
|
|
|
|
2008-07-17 12:53:50 -04:00
|
|
|
|
2008-01-08 15:46:30 -05:00
|
|
|
|
|
|
|
|
|
2012-03-01 14:56:26 +01:00
|
|
|
|
|
|
|
|
|
2008-07-17 12:53:50 -04:00
|
|
|
|
|
|
|
|
|
2010-02-02 20:51:14 +00:00
|
|
|
|
2012-05-02 14:00:54 -04:00
|
|
|
|
2010-11-28 19:56:33 -05:00
|
|
|
|
|
|
|
|
|
2012-05-02 14:00:54 -04:00
|
|
|
|
|
|
|
|
|
2008-07-17 12:53:50 -04:00
|
|
|
|
2010-05-23 11:00:55 -04:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2010-12-17 14:21:50 +08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2019-04-10 16:16:11 +03:00
|
|
|
|
2012-03-01 14:56:26 +01:00
|
|
|
|
2008-07-17 12:53:50 -04:00
|
|
|
|
|
|
|
|
|
2008-07-17 13:53:27 -04:00
|
|
|
|
|
|
|
|
|
2013-10-25 16:13:35 -04:00
|
|
|
|
2008-07-17 12:53:50 -04:00
|
|
|
|
|
|
|
|
|
2017-02-20 13:50:49 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-11-12 09:34:21 +00:00
|
|
|
|
2008-07-17 12:54:05 -04:00
|
|
|
|
2013-04-05 07:20:56 +00:00
|
|
|
|
2019-05-22 10:19:01 +02:00
|
|
|
|
2017-06-23 09:48:21 -07:00
|
|
|
|
2016-04-26 15:36:38 +01:00
|
|
|
|
2017-06-23 09:48:21 -07:00
|
|
|
|
2016-04-26 15:36:38 +01:00
|
|
|
|
2019-05-07 10:19:22 +03:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2012-09-06 04:01:51 -06:00
|
|
|
|
2018-02-19 17:24:18 +01:00
|
|
|
|
2018-04-03 19:16:55 +02:00
|
|
|
|
2008-01-08 15:46:30 -05:00
|
|
|
|