2018-04-03 20:23:33 +03:00
|
|
|
// SPDX-License-Identifier: GPL-2.0
|
2017-10-09 04:51:02 +03:00
|
|
|
/*
|
|
|
|
* Copyright (C) Qu Wenruo 2017. All rights reserved.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The module is used to catch unexpected/corrupted tree block data.
|
|
|
|
* Such behavior can be caused either by a fuzzed image or bugs.
|
|
|
|
*
|
|
|
|
* The objective is to do leaf/node validation checks when tree block is read
|
|
|
|
* from disk, and check *every* possible member, so other code won't
|
|
|
|
* need to checking them again.
|
|
|
|
*
|
|
|
|
* Due to the potential and unwanted damage, every checker needs to be
|
|
|
|
* carefully reviewed otherwise so it does not prevent mount of valid images.
|
|
|
|
*/
|
|
|
|
|
2019-04-24 10:22:53 +03:00
|
|
|
#include <linux/types.h>
|
|
|
|
#include <linux/stddef.h>
|
|
|
|
#include <linux/error-injection.h>
|
2017-10-09 04:51:02 +03:00
|
|
|
#include "ctree.h"
|
|
|
|
#include "tree-checker.h"
|
|
|
|
#include "disk-io.h"
|
|
|
|
#include "compression.h"
|
2018-07-03 12:10:05 +03:00
|
|
|
#include "volumes.h"
|
2017-10-09 04:51:02 +03:00
|
|
|
|
2017-10-09 04:51:03 +03:00
|
|
|
/*
|
|
|
|
* Error message should follow the following format:
|
|
|
|
* corrupt <type>: <identifier>, <reason>[, <bad_value>]
|
|
|
|
*
|
|
|
|
* @type: leaf or node
|
|
|
|
* @identifier: the necessary info to locate the leaf/node.
|
2018-11-28 14:05:13 +03:00
|
|
|
* It's recommended to decode key.objecitd/offset if it's
|
2017-10-09 04:51:03 +03:00
|
|
|
* meaningful.
|
|
|
|
* @reason: describe the error
|
2018-11-28 14:05:13 +03:00
|
|
|
* @bad_value: optional, it's recommended to output bad value and its
|
2017-10-09 04:51:03 +03:00
|
|
|
* expected value (range).
|
|
|
|
*
|
|
|
|
* Since comma is used to separate the components, only space is allowed
|
|
|
|
* inside each component.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Append generic "corrupt leaf/node root=%llu block=%llu slot=%d: " to @fmt.
|
|
|
|
* Allows callers to customize the output.
|
|
|
|
*/
|
2019-03-20 17:31:28 +03:00
|
|
|
__printf(3, 4)
|
2018-02-19 19:24:18 +03:00
|
|
|
__cold
|
2019-03-20 17:31:28 +03:00
|
|
|
static void generic_err(const struct extent_buffer *eb, int slot,
|
2017-10-09 04:51:03 +03:00
|
|
|
const char *fmt, ...)
|
|
|
|
{
|
2019-03-20 17:31:28 +03:00
|
|
|
const struct btrfs_fs_info *fs_info = eb->fs_info;
|
2017-10-09 04:51:03 +03:00
|
|
|
struct va_format vaf;
|
|
|
|
va_list args;
|
|
|
|
|
|
|
|
va_start(args, fmt);
|
|
|
|
|
|
|
|
vaf.fmt = fmt;
|
|
|
|
vaf.va = &args;
|
|
|
|
|
2018-01-25 09:56:18 +03:00
|
|
|
btrfs_crit(fs_info,
|
2017-10-09 04:51:03 +03:00
|
|
|
"corrupt %s: root=%llu block=%llu slot=%d, %pV",
|
|
|
|
btrfs_header_level(eb) == 0 ? "leaf" : "node",
|
2018-01-25 09:56:18 +03:00
|
|
|
btrfs_header_owner(eb), btrfs_header_bytenr(eb), slot, &vaf);
|
2017-10-09 04:51:03 +03:00
|
|
|
va_end(args);
|
|
|
|
}
|
|
|
|
|
2017-10-09 04:51:06 +03:00
|
|
|
/*
|
|
|
|
* Customized reporter for extent data item, since its key objectid and
|
|
|
|
* offset has its own meaning.
|
|
|
|
*/
|
2019-03-20 17:32:46 +03:00
|
|
|
__printf(3, 4)
|
2018-02-19 19:24:18 +03:00
|
|
|
__cold
|
2019-03-20 17:32:46 +03:00
|
|
|
static void file_extent_err(const struct extent_buffer *eb, int slot,
|
2017-10-09 04:51:06 +03:00
|
|
|
const char *fmt, ...)
|
|
|
|
{
|
2019-03-20 17:32:46 +03:00
|
|
|
const struct btrfs_fs_info *fs_info = eb->fs_info;
|
2017-10-09 04:51:06 +03:00
|
|
|
struct btrfs_key key;
|
|
|
|
struct va_format vaf;
|
|
|
|
va_list args;
|
|
|
|
|
|
|
|
btrfs_item_key_to_cpu(eb, &key, slot);
|
|
|
|
va_start(args, fmt);
|
|
|
|
|
|
|
|
vaf.fmt = fmt;
|
|
|
|
vaf.va = &args;
|
|
|
|
|
2018-01-25 09:56:18 +03:00
|
|
|
btrfs_crit(fs_info,
|
2017-10-09 04:51:06 +03:00
|
|
|
"corrupt %s: root=%llu block=%llu slot=%d ino=%llu file_offset=%llu, %pV",
|
2018-01-25 09:56:18 +03:00
|
|
|
btrfs_header_level(eb) == 0 ? "leaf" : "node",
|
|
|
|
btrfs_header_owner(eb), btrfs_header_bytenr(eb), slot,
|
|
|
|
key.objectid, key.offset, &vaf);
|
2017-10-09 04:51:06 +03:00
|
|
|
va_end(args);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Return 0 if the btrfs_file_extent_##name is aligned to @alignment
|
|
|
|
* Else return 1
|
|
|
|
*/
|
2019-03-20 17:59:22 +03:00
|
|
|
#define CHECK_FE_ALIGNED(leaf, slot, fi, name, alignment) \
|
2017-10-09 04:51:06 +03:00
|
|
|
({ \
|
|
|
|
if (!IS_ALIGNED(btrfs_file_extent_##name((leaf), (fi)), (alignment))) \
|
2019-03-20 17:32:46 +03:00
|
|
|
file_extent_err((leaf), (slot), \
|
2017-10-09 04:51:06 +03:00
|
|
|
"invalid %s for file extent, have %llu, should be aligned to %u", \
|
|
|
|
(#name), btrfs_file_extent_##name((leaf), (fi)), \
|
|
|
|
(alignment)); \
|
|
|
|
(!IS_ALIGNED(btrfs_file_extent_##name((leaf), (fi)), (alignment))); \
|
|
|
|
})
|
|
|
|
|
2019-05-06 18:44:12 +03:00
|
|
|
static u64 file_extent_end(struct extent_buffer *leaf,
|
|
|
|
struct btrfs_key *key,
|
|
|
|
struct btrfs_file_extent_item *extent)
|
|
|
|
{
|
|
|
|
u64 end;
|
|
|
|
u64 len;
|
|
|
|
|
|
|
|
if (btrfs_file_extent_type(leaf, extent) == BTRFS_FILE_EXTENT_INLINE) {
|
|
|
|
len = btrfs_file_extent_ram_bytes(leaf, extent);
|
|
|
|
end = ALIGN(key->offset + len, leaf->fs_info->sectorsize);
|
|
|
|
} else {
|
|
|
|
len = btrfs_file_extent_num_bytes(leaf, extent);
|
|
|
|
end = key->offset + len;
|
|
|
|
}
|
|
|
|
return end;
|
|
|
|
}
|
|
|
|
|
2019-03-20 18:21:10 +03:00
|
|
|
static int check_extent_data_item(struct extent_buffer *leaf,
|
2019-05-06 18:44:12 +03:00
|
|
|
struct btrfs_key *key, int slot,
|
|
|
|
struct btrfs_key *prev_key)
|
2017-10-09 04:51:02 +03:00
|
|
|
{
|
2019-03-20 18:21:10 +03:00
|
|
|
struct btrfs_fs_info *fs_info = leaf->fs_info;
|
2017-10-09 04:51:02 +03:00
|
|
|
struct btrfs_file_extent_item *fi;
|
2018-01-25 09:56:18 +03:00
|
|
|
u32 sectorsize = fs_info->sectorsize;
|
2017-10-09 04:51:02 +03:00
|
|
|
u32 item_size = btrfs_item_size_nr(leaf, slot);
|
|
|
|
|
|
|
|
if (!IS_ALIGNED(key->offset, sectorsize)) {
|
2019-03-20 17:32:46 +03:00
|
|
|
file_extent_err(leaf, slot,
|
2017-10-09 04:51:06 +03:00
|
|
|
"unaligned file_offset for file extent, have %llu should be aligned to %u",
|
|
|
|
key->offset, sectorsize);
|
2017-10-09 04:51:02 +03:00
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
|
|
|
|
fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
|
|
|
|
|
|
|
|
if (btrfs_file_extent_type(leaf, fi) > BTRFS_FILE_EXTENT_TYPES) {
|
2019-03-20 17:32:46 +03:00
|
|
|
file_extent_err(leaf, slot,
|
2017-10-09 04:51:06 +03:00
|
|
|
"invalid type for file extent, have %u expect range [0, %u]",
|
|
|
|
btrfs_file_extent_type(leaf, fi),
|
|
|
|
BTRFS_FILE_EXTENT_TYPES);
|
2017-10-09 04:51:02 +03:00
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2018-11-28 14:05:13 +03:00
|
|
|
* Support for new compression/encryption must introduce incompat flag,
|
2017-10-09 04:51:02 +03:00
|
|
|
* and must be caught in open_ctree().
|
|
|
|
*/
|
|
|
|
if (btrfs_file_extent_compression(leaf, fi) > BTRFS_COMPRESS_TYPES) {
|
2019-03-20 17:32:46 +03:00
|
|
|
file_extent_err(leaf, slot,
|
2017-10-09 04:51:06 +03:00
|
|
|
"invalid compression for file extent, have %u expect range [0, %u]",
|
|
|
|
btrfs_file_extent_compression(leaf, fi),
|
|
|
|
BTRFS_COMPRESS_TYPES);
|
2017-10-09 04:51:02 +03:00
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
if (btrfs_file_extent_encryption(leaf, fi)) {
|
2019-03-20 17:32:46 +03:00
|
|
|
file_extent_err(leaf, slot,
|
2017-10-09 04:51:06 +03:00
|
|
|
"invalid encryption for file extent, have %u expect 0",
|
|
|
|
btrfs_file_extent_encryption(leaf, fi));
|
2017-10-09 04:51:02 +03:00
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
if (btrfs_file_extent_type(leaf, fi) == BTRFS_FILE_EXTENT_INLINE) {
|
|
|
|
/* Inline extent must have 0 as key offset */
|
|
|
|
if (key->offset) {
|
2019-03-20 17:32:46 +03:00
|
|
|
file_extent_err(leaf, slot,
|
2017-10-09 04:51:06 +03:00
|
|
|
"invalid file_offset for inline file extent, have %llu expect 0",
|
|
|
|
key->offset);
|
2017-10-09 04:51:02 +03:00
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Compressed inline extent has no on-disk size, skip it */
|
|
|
|
if (btrfs_file_extent_compression(leaf, fi) !=
|
|
|
|
BTRFS_COMPRESS_NONE)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
/* Uncompressed inline extent size must match item size */
|
|
|
|
if (item_size != BTRFS_FILE_EXTENT_INLINE_DATA_START +
|
|
|
|
btrfs_file_extent_ram_bytes(leaf, fi)) {
|
2019-03-20 17:32:46 +03:00
|
|
|
file_extent_err(leaf, slot,
|
2017-10-09 04:51:06 +03:00
|
|
|
"invalid ram_bytes for uncompressed inline extent, have %u expect %llu",
|
|
|
|
item_size, BTRFS_FILE_EXTENT_INLINE_DATA_START +
|
|
|
|
btrfs_file_extent_ram_bytes(leaf, fi));
|
2017-10-09 04:51:02 +03:00
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Regular or preallocated extent has fixed item size */
|
|
|
|
if (item_size != sizeof(*fi)) {
|
2019-03-20 17:32:46 +03:00
|
|
|
file_extent_err(leaf, slot,
|
2017-10-13 12:27:35 +03:00
|
|
|
"invalid item size for reg/prealloc file extent, have %u expect %zu",
|
2017-10-09 04:51:06 +03:00
|
|
|
item_size, sizeof(*fi));
|
2017-10-09 04:51:02 +03:00
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
2019-03-20 17:59:22 +03:00
|
|
|
if (CHECK_FE_ALIGNED(leaf, slot, fi, ram_bytes, sectorsize) ||
|
|
|
|
CHECK_FE_ALIGNED(leaf, slot, fi, disk_bytenr, sectorsize) ||
|
|
|
|
CHECK_FE_ALIGNED(leaf, slot, fi, disk_num_bytes, sectorsize) ||
|
|
|
|
CHECK_FE_ALIGNED(leaf, slot, fi, offset, sectorsize) ||
|
|
|
|
CHECK_FE_ALIGNED(leaf, slot, fi, num_bytes, sectorsize))
|
2017-10-09 04:51:02 +03:00
|
|
|
return -EUCLEAN;
|
2019-05-06 18:44:12 +03:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Check that no two consecutive file extent items, in the same leaf,
|
|
|
|
* present ranges that overlap each other.
|
|
|
|
*/
|
|
|
|
if (slot > 0 &&
|
|
|
|
prev_key->objectid == key->objectid &&
|
|
|
|
prev_key->type == BTRFS_EXTENT_DATA_KEY) {
|
|
|
|
struct btrfs_file_extent_item *prev_fi;
|
|
|
|
u64 prev_end;
|
|
|
|
|
|
|
|
prev_fi = btrfs_item_ptr(leaf, slot - 1,
|
|
|
|
struct btrfs_file_extent_item);
|
|
|
|
prev_end = file_extent_end(leaf, prev_key, prev_fi);
|
|
|
|
if (prev_end > key->offset) {
|
|
|
|
file_extent_err(leaf, slot - 1,
|
|
|
|
"file extent end range (%llu) goes beyond start offset (%llu) of the next file extent",
|
|
|
|
prev_end, key->offset);
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-10-09 04:51:02 +03:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2019-03-20 18:02:56 +03:00
|
|
|
static int check_csum_item(struct extent_buffer *leaf, struct btrfs_key *key,
|
2018-01-25 09:56:18 +03:00
|
|
|
int slot)
|
2017-10-09 04:51:02 +03:00
|
|
|
{
|
2019-03-20 18:02:56 +03:00
|
|
|
struct btrfs_fs_info *fs_info = leaf->fs_info;
|
2018-01-25 09:56:18 +03:00
|
|
|
u32 sectorsize = fs_info->sectorsize;
|
|
|
|
u32 csumsize = btrfs_super_csum_size(fs_info->super_copy);
|
2017-10-09 04:51:02 +03:00
|
|
|
|
|
|
|
if (key->objectid != BTRFS_EXTENT_CSUM_OBJECTID) {
|
2019-03-20 17:31:28 +03:00
|
|
|
generic_err(leaf, slot,
|
2017-10-09 04:51:05 +03:00
|
|
|
"invalid key objectid for csum item, have %llu expect %llu",
|
|
|
|
key->objectid, BTRFS_EXTENT_CSUM_OBJECTID);
|
2017-10-09 04:51:02 +03:00
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
if (!IS_ALIGNED(key->offset, sectorsize)) {
|
2019-03-20 17:31:28 +03:00
|
|
|
generic_err(leaf, slot,
|
2017-10-09 04:51:05 +03:00
|
|
|
"unaligned key offset for csum item, have %llu should be aligned to %u",
|
|
|
|
key->offset, sectorsize);
|
2017-10-09 04:51:02 +03:00
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
if (!IS_ALIGNED(btrfs_item_size_nr(leaf, slot), csumsize)) {
|
2019-03-20 17:31:28 +03:00
|
|
|
generic_err(leaf, slot,
|
2017-10-09 04:51:05 +03:00
|
|
|
"unaligned item size for csum item, have %u should be aligned to %u",
|
|
|
|
btrfs_item_size_nr(leaf, slot), csumsize);
|
2017-10-09 04:51:02 +03:00
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-11-08 03:54:25 +03:00
|
|
|
/*
|
|
|
|
* Customized reported for dir_item, only important new info is key->objectid,
|
|
|
|
* which represents inode number
|
|
|
|
*/
|
2019-03-20 18:07:27 +03:00
|
|
|
__printf(3, 4)
|
2018-02-19 19:24:18 +03:00
|
|
|
__cold
|
2019-03-20 18:07:27 +03:00
|
|
|
static void dir_item_err(const struct extent_buffer *eb, int slot,
|
2017-11-08 03:54:25 +03:00
|
|
|
const char *fmt, ...)
|
|
|
|
{
|
2019-03-20 18:07:27 +03:00
|
|
|
const struct btrfs_fs_info *fs_info = eb->fs_info;
|
2017-11-08 03:54:25 +03:00
|
|
|
struct btrfs_key key;
|
|
|
|
struct va_format vaf;
|
|
|
|
va_list args;
|
|
|
|
|
|
|
|
btrfs_item_key_to_cpu(eb, &key, slot);
|
|
|
|
va_start(args, fmt);
|
|
|
|
|
|
|
|
vaf.fmt = fmt;
|
|
|
|
vaf.va = &args;
|
|
|
|
|
2018-01-25 09:56:18 +03:00
|
|
|
btrfs_crit(fs_info,
|
2017-11-08 03:54:25 +03:00
|
|
|
"corrupt %s: root=%llu block=%llu slot=%d ino=%llu, %pV",
|
2018-01-25 09:56:18 +03:00
|
|
|
btrfs_header_level(eb) == 0 ? "leaf" : "node",
|
|
|
|
btrfs_header_owner(eb), btrfs_header_bytenr(eb), slot,
|
|
|
|
key.objectid, &vaf);
|
2017-11-08 03:54:25 +03:00
|
|
|
va_end(args);
|
|
|
|
}
|
|
|
|
|
2019-03-20 18:17:46 +03:00
|
|
|
static int check_dir_item(struct extent_buffer *leaf,
|
2017-11-08 03:54:25 +03:00
|
|
|
struct btrfs_key *key, int slot)
|
|
|
|
{
|
2019-03-20 18:17:46 +03:00
|
|
|
struct btrfs_fs_info *fs_info = leaf->fs_info;
|
2017-11-08 03:54:25 +03:00
|
|
|
struct btrfs_dir_item *di;
|
|
|
|
u32 item_size = btrfs_item_size_nr(leaf, slot);
|
|
|
|
u32 cur = 0;
|
|
|
|
|
|
|
|
di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item);
|
|
|
|
while (cur < item_size) {
|
|
|
|
u32 name_len;
|
|
|
|
u32 data_len;
|
|
|
|
u32 max_name_len;
|
|
|
|
u32 total_size;
|
|
|
|
u32 name_hash;
|
|
|
|
u8 dir_type;
|
|
|
|
|
|
|
|
/* header itself should not cross item boundary */
|
|
|
|
if (cur + sizeof(*di) > item_size) {
|
2019-03-20 18:07:27 +03:00
|
|
|
dir_item_err(leaf, slot,
|
2017-12-06 17:18:14 +03:00
|
|
|
"dir item header crosses item boundary, have %zu boundary %u",
|
2017-11-08 03:54:25 +03:00
|
|
|
cur + sizeof(*di), item_size);
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* dir type check */
|
|
|
|
dir_type = btrfs_dir_type(leaf, di);
|
|
|
|
if (dir_type >= BTRFS_FT_MAX) {
|
2019-03-20 18:07:27 +03:00
|
|
|
dir_item_err(leaf, slot,
|
2017-11-08 03:54:25 +03:00
|
|
|
"invalid dir item type, have %u expect [0, %u)",
|
|
|
|
dir_type, BTRFS_FT_MAX);
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (key->type == BTRFS_XATTR_ITEM_KEY &&
|
|
|
|
dir_type != BTRFS_FT_XATTR) {
|
2019-03-20 18:07:27 +03:00
|
|
|
dir_item_err(leaf, slot,
|
2017-11-08 03:54:25 +03:00
|
|
|
"invalid dir item type for XATTR key, have %u expect %u",
|
|
|
|
dir_type, BTRFS_FT_XATTR);
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
if (dir_type == BTRFS_FT_XATTR &&
|
|
|
|
key->type != BTRFS_XATTR_ITEM_KEY) {
|
2019-03-20 18:07:27 +03:00
|
|
|
dir_item_err(leaf, slot,
|
2017-11-08 03:54:25 +03:00
|
|
|
"xattr dir type found for non-XATTR key");
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
if (dir_type == BTRFS_FT_XATTR)
|
|
|
|
max_name_len = XATTR_NAME_MAX;
|
|
|
|
else
|
|
|
|
max_name_len = BTRFS_NAME_LEN;
|
|
|
|
|
|
|
|
/* Name/data length check */
|
|
|
|
name_len = btrfs_dir_name_len(leaf, di);
|
|
|
|
data_len = btrfs_dir_data_len(leaf, di);
|
|
|
|
if (name_len > max_name_len) {
|
2019-03-20 18:07:27 +03:00
|
|
|
dir_item_err(leaf, slot,
|
2017-11-08 03:54:25 +03:00
|
|
|
"dir item name len too long, have %u max %u",
|
|
|
|
name_len, max_name_len);
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
2018-01-25 09:56:18 +03:00
|
|
|
if (name_len + data_len > BTRFS_MAX_XATTR_SIZE(fs_info)) {
|
2019-03-20 18:07:27 +03:00
|
|
|
dir_item_err(leaf, slot,
|
2017-11-08 03:54:25 +03:00
|
|
|
"dir item name and data len too long, have %u max %u",
|
|
|
|
name_len + data_len,
|
2018-01-25 09:56:18 +03:00
|
|
|
BTRFS_MAX_XATTR_SIZE(fs_info));
|
2017-11-08 03:54:25 +03:00
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (data_len && dir_type != BTRFS_FT_XATTR) {
|
2019-03-20 18:07:27 +03:00
|
|
|
dir_item_err(leaf, slot,
|
2017-11-08 03:54:25 +03:00
|
|
|
"dir item with invalid data len, have %u expect 0",
|
|
|
|
data_len);
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
|
|
|
|
total_size = sizeof(*di) + name_len + data_len;
|
|
|
|
|
|
|
|
/* header and name/data should not cross item boundary */
|
|
|
|
if (cur + total_size > item_size) {
|
2019-03-20 18:07:27 +03:00
|
|
|
dir_item_err(leaf, slot,
|
2017-11-08 03:54:25 +03:00
|
|
|
"dir item data crosses item boundary, have %u boundary %u",
|
|
|
|
cur + total_size, item_size);
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Special check for XATTR/DIR_ITEM, as key->offset is name
|
|
|
|
* hash, should match its name
|
|
|
|
*/
|
|
|
|
if (key->type == BTRFS_DIR_ITEM_KEY ||
|
|
|
|
key->type == BTRFS_XATTR_ITEM_KEY) {
|
2018-01-10 17:13:07 +03:00
|
|
|
char namebuf[max(BTRFS_NAME_LEN, XATTR_NAME_MAX)];
|
|
|
|
|
2017-11-08 03:54:25 +03:00
|
|
|
read_extent_buffer(leaf, namebuf,
|
|
|
|
(unsigned long)(di + 1), name_len);
|
|
|
|
name_hash = btrfs_name_hash(namebuf, name_len);
|
|
|
|
if (key->offset != name_hash) {
|
2019-03-20 18:07:27 +03:00
|
|
|
dir_item_err(leaf, slot,
|
2017-11-08 03:54:25 +03:00
|
|
|
"name hash mismatch with key, have 0x%016x expect 0x%016llx",
|
|
|
|
name_hash, key->offset);
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
cur += total_size;
|
|
|
|
di = (struct btrfs_dir_item *)((void *)di + total_size);
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2019-03-20 18:18:57 +03:00
|
|
|
__printf(3, 4)
|
2018-07-03 12:10:05 +03:00
|
|
|
__cold
|
2019-03-20 18:18:57 +03:00
|
|
|
static void block_group_err(const struct extent_buffer *eb, int slot,
|
2018-07-03 12:10:05 +03:00
|
|
|
const char *fmt, ...)
|
|
|
|
{
|
2019-03-20 18:18:57 +03:00
|
|
|
const struct btrfs_fs_info *fs_info = eb->fs_info;
|
2018-07-03 12:10:05 +03:00
|
|
|
struct btrfs_key key;
|
|
|
|
struct va_format vaf;
|
|
|
|
va_list args;
|
|
|
|
|
|
|
|
btrfs_item_key_to_cpu(eb, &key, slot);
|
|
|
|
va_start(args, fmt);
|
|
|
|
|
|
|
|
vaf.fmt = fmt;
|
|
|
|
vaf.va = &args;
|
|
|
|
|
|
|
|
btrfs_crit(fs_info,
|
|
|
|
"corrupt %s: root=%llu block=%llu slot=%d bg_start=%llu bg_len=%llu, %pV",
|
|
|
|
btrfs_header_level(eb) == 0 ? "leaf" : "node",
|
|
|
|
btrfs_header_owner(eb), btrfs_header_bytenr(eb), slot,
|
|
|
|
key.objectid, key.offset, &vaf);
|
|
|
|
va_end(args);
|
|
|
|
}
|
|
|
|
|
2019-03-20 18:19:31 +03:00
|
|
|
static int check_block_group_item(struct extent_buffer *leaf,
|
2018-07-03 12:10:05 +03:00
|
|
|
struct btrfs_key *key, int slot)
|
|
|
|
{
|
|
|
|
struct btrfs_block_group_item bgi;
|
|
|
|
u32 item_size = btrfs_item_size_nr(leaf, slot);
|
|
|
|
u64 flags;
|
|
|
|
u64 type;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Here we don't really care about alignment since extent allocator can
|
btrfs: tree-checker: Don't check max block group size as current max chunk size limit is unreliable
[BUG]
A completely valid btrfs will refuse to mount, with error message like:
BTRFS critical (device sdb2): corrupt leaf: root=2 block=239681536 slot=172 \
bg_start=12018974720 bg_len=10888413184, invalid block group size, \
have 10888413184 expect (0, 10737418240]
This has been reported several times as the 4.19 kernel is now being
used. The filesystem refuses to mount, but is otherwise ok and booting
4.18 is a workaround.
Btrfs check returns no error, and all kernels used on this fs is later
than 2011, which should all have the 10G size limit commit.
[CAUSE]
For a 12 devices btrfs, we could allocate a chunk larger than 10G due to
stripe stripe bump up.
__btrfs_alloc_chunk()
|- max_stripe_size = 1G
|- max_chunk_size = 10G
|- data_stripe = 11
|- if (1G * 11 > 10G) {
stripe_size = 976128930;
stripe_size = round_up(976128930, SZ_16M) = 989855744
However the final stripe_size (989855744) * 11 = 10888413184, which is
still larger than 10G.
[FIX]
For the comprehensive check, we need to do the full check at chunk read
time, and rely on bg <-> chunk mapping to do the check.
We could just skip the length check for now.
Fixes: fce466eab7ac ("btrfs: tree-checker: Verify block_group_item")
Cc: stable@vger.kernel.org # v4.19+
Reported-by: Wang Yugui <wangyugui@e16-tech.com>
Signed-off-by: Qu Wenruo <wqu@suse.com>
Reviewed-by: David Sterba <dsterba@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2018-11-23 04:06:36 +03:00
|
|
|
* handle it. We care more about the size.
|
2018-07-03 12:10:05 +03:00
|
|
|
*/
|
btrfs: tree-checker: Don't check max block group size as current max chunk size limit is unreliable
[BUG]
A completely valid btrfs will refuse to mount, with error message like:
BTRFS critical (device sdb2): corrupt leaf: root=2 block=239681536 slot=172 \
bg_start=12018974720 bg_len=10888413184, invalid block group size, \
have 10888413184 expect (0, 10737418240]
This has been reported several times as the 4.19 kernel is now being
used. The filesystem refuses to mount, but is otherwise ok and booting
4.18 is a workaround.
Btrfs check returns no error, and all kernels used on this fs is later
than 2011, which should all have the 10G size limit commit.
[CAUSE]
For a 12 devices btrfs, we could allocate a chunk larger than 10G due to
stripe stripe bump up.
__btrfs_alloc_chunk()
|- max_stripe_size = 1G
|- max_chunk_size = 10G
|- data_stripe = 11
|- if (1G * 11 > 10G) {
stripe_size = 976128930;
stripe_size = round_up(976128930, SZ_16M) = 989855744
However the final stripe_size (989855744) * 11 = 10888413184, which is
still larger than 10G.
[FIX]
For the comprehensive check, we need to do the full check at chunk read
time, and rely on bg <-> chunk mapping to do the check.
We could just skip the length check for now.
Fixes: fce466eab7ac ("btrfs: tree-checker: Verify block_group_item")
Cc: stable@vger.kernel.org # v4.19+
Reported-by: Wang Yugui <wangyugui@e16-tech.com>
Signed-off-by: Qu Wenruo <wqu@suse.com>
Reviewed-by: David Sterba <dsterba@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2018-11-23 04:06:36 +03:00
|
|
|
if (key->offset == 0) {
|
2019-03-20 18:18:57 +03:00
|
|
|
block_group_err(leaf, slot,
|
btrfs: tree-checker: Don't check max block group size as current max chunk size limit is unreliable
[BUG]
A completely valid btrfs will refuse to mount, with error message like:
BTRFS critical (device sdb2): corrupt leaf: root=2 block=239681536 slot=172 \
bg_start=12018974720 bg_len=10888413184, invalid block group size, \
have 10888413184 expect (0, 10737418240]
This has been reported several times as the 4.19 kernel is now being
used. The filesystem refuses to mount, but is otherwise ok and booting
4.18 is a workaround.
Btrfs check returns no error, and all kernels used on this fs is later
than 2011, which should all have the 10G size limit commit.
[CAUSE]
For a 12 devices btrfs, we could allocate a chunk larger than 10G due to
stripe stripe bump up.
__btrfs_alloc_chunk()
|- max_stripe_size = 1G
|- max_chunk_size = 10G
|- data_stripe = 11
|- if (1G * 11 > 10G) {
stripe_size = 976128930;
stripe_size = round_up(976128930, SZ_16M) = 989855744
However the final stripe_size (989855744) * 11 = 10888413184, which is
still larger than 10G.
[FIX]
For the comprehensive check, we need to do the full check at chunk read
time, and rely on bg <-> chunk mapping to do the check.
We could just skip the length check for now.
Fixes: fce466eab7ac ("btrfs: tree-checker: Verify block_group_item")
Cc: stable@vger.kernel.org # v4.19+
Reported-by: Wang Yugui <wangyugui@e16-tech.com>
Signed-off-by: Qu Wenruo <wqu@suse.com>
Reviewed-by: David Sterba <dsterba@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
2018-11-23 04:06:36 +03:00
|
|
|
"invalid block group size 0");
|
2018-07-03 12:10:05 +03:00
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (item_size != sizeof(bgi)) {
|
2019-03-20 18:18:57 +03:00
|
|
|
block_group_err(leaf, slot,
|
2018-07-03 12:10:05 +03:00
|
|
|
"invalid item size, have %u expect %zu",
|
|
|
|
item_size, sizeof(bgi));
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
|
|
|
|
read_extent_buffer(leaf, &bgi, btrfs_item_ptr_offset(leaf, slot),
|
|
|
|
sizeof(bgi));
|
|
|
|
if (btrfs_block_group_chunk_objectid(&bgi) !=
|
|
|
|
BTRFS_FIRST_CHUNK_TREE_OBJECTID) {
|
2019-03-20 18:18:57 +03:00
|
|
|
block_group_err(leaf, slot,
|
2018-07-03 12:10:05 +03:00
|
|
|
"invalid block group chunk objectid, have %llu expect %llu",
|
|
|
|
btrfs_block_group_chunk_objectid(&bgi),
|
|
|
|
BTRFS_FIRST_CHUNK_TREE_OBJECTID);
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (btrfs_block_group_used(&bgi) > key->offset) {
|
2019-03-20 18:18:57 +03:00
|
|
|
block_group_err(leaf, slot,
|
2018-07-03 12:10:05 +03:00
|
|
|
"invalid block group used, have %llu expect [0, %llu)",
|
|
|
|
btrfs_block_group_used(&bgi), key->offset);
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
|
|
|
|
flags = btrfs_block_group_flags(&bgi);
|
|
|
|
if (hweight64(flags & BTRFS_BLOCK_GROUP_PROFILE_MASK) > 1) {
|
2019-03-20 18:18:57 +03:00
|
|
|
block_group_err(leaf, slot,
|
2018-07-03 12:10:05 +03:00
|
|
|
"invalid profile flags, have 0x%llx (%lu bits set) expect no more than 1 bit set",
|
|
|
|
flags & BTRFS_BLOCK_GROUP_PROFILE_MASK,
|
|
|
|
hweight64(flags & BTRFS_BLOCK_GROUP_PROFILE_MASK));
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
|
|
|
|
type = flags & BTRFS_BLOCK_GROUP_TYPE_MASK;
|
|
|
|
if (type != BTRFS_BLOCK_GROUP_DATA &&
|
|
|
|
type != BTRFS_BLOCK_GROUP_METADATA &&
|
|
|
|
type != BTRFS_BLOCK_GROUP_SYSTEM &&
|
|
|
|
type != (BTRFS_BLOCK_GROUP_METADATA |
|
|
|
|
BTRFS_BLOCK_GROUP_DATA)) {
|
2019-03-20 18:18:57 +03:00
|
|
|
block_group_err(leaf, slot,
|
2018-11-05 13:49:09 +03:00
|
|
|
"invalid type, have 0x%llx (%lu bits set) expect either 0x%llx, 0x%llx, 0x%llx or 0x%llx",
|
2018-07-03 12:10:05 +03:00
|
|
|
type, hweight64(type),
|
|
|
|
BTRFS_BLOCK_GROUP_DATA, BTRFS_BLOCK_GROUP_METADATA,
|
|
|
|
BTRFS_BLOCK_GROUP_SYSTEM,
|
|
|
|
BTRFS_BLOCK_GROUP_METADATA | BTRFS_BLOCK_GROUP_DATA);
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
return 0;
|
2019-03-20 08:16:42 +03:00
|
|
|
}
|
|
|
|
|
2019-03-20 18:22:58 +03:00
|
|
|
__printf(4, 5)
|
2019-03-20 08:36:06 +03:00
|
|
|
__cold
|
2019-03-20 18:22:58 +03:00
|
|
|
static void chunk_err(const struct extent_buffer *leaf,
|
2019-03-20 08:36:06 +03:00
|
|
|
const struct btrfs_chunk *chunk, u64 logical,
|
|
|
|
const char *fmt, ...)
|
|
|
|
{
|
2019-03-20 18:22:58 +03:00
|
|
|
const struct btrfs_fs_info *fs_info = leaf->fs_info;
|
2019-03-20 08:36:06 +03:00
|
|
|
bool is_sb;
|
|
|
|
struct va_format vaf;
|
|
|
|
va_list args;
|
|
|
|
int i;
|
|
|
|
int slot = -1;
|
|
|
|
|
|
|
|
/* Only superblock eb is able to have such small offset */
|
|
|
|
is_sb = (leaf->start == BTRFS_SUPER_INFO_OFFSET);
|
|
|
|
|
|
|
|
if (!is_sb) {
|
|
|
|
/*
|
|
|
|
* Get the slot number by iterating through all slots, this
|
|
|
|
* would provide better readability.
|
|
|
|
*/
|
|
|
|
for (i = 0; i < btrfs_header_nritems(leaf); i++) {
|
|
|
|
if (btrfs_item_ptr_offset(leaf, i) ==
|
|
|
|
(unsigned long)chunk) {
|
|
|
|
slot = i;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
va_start(args, fmt);
|
|
|
|
vaf.fmt = fmt;
|
|
|
|
vaf.va = &args;
|
|
|
|
|
|
|
|
if (is_sb)
|
|
|
|
btrfs_crit(fs_info,
|
|
|
|
"corrupt superblock syschunk array: chunk_start=%llu, %pV",
|
|
|
|
logical, &vaf);
|
|
|
|
else
|
|
|
|
btrfs_crit(fs_info,
|
|
|
|
"corrupt leaf: root=%llu block=%llu slot=%d chunk_start=%llu, %pV",
|
|
|
|
BTRFS_CHUNK_TREE_OBJECTID, leaf->start, slot,
|
|
|
|
logical, &vaf);
|
|
|
|
va_end(args);
|
|
|
|
}
|
|
|
|
|
2019-03-20 08:16:42 +03:00
|
|
|
/*
|
|
|
|
* The common chunk check which could also work on super block sys chunk array.
|
|
|
|
*
|
2019-03-20 08:39:14 +03:00
|
|
|
* Return -EUCLEAN if anything is corrupted.
|
2019-03-20 08:16:42 +03:00
|
|
|
* Return 0 if everything is OK.
|
|
|
|
*/
|
2019-03-20 18:40:48 +03:00
|
|
|
int btrfs_check_chunk_valid(struct extent_buffer *leaf,
|
2019-03-20 08:16:42 +03:00
|
|
|
struct btrfs_chunk *chunk, u64 logical)
|
|
|
|
{
|
2019-03-20 18:40:48 +03:00
|
|
|
struct btrfs_fs_info *fs_info = leaf->fs_info;
|
2019-03-20 08:16:42 +03:00
|
|
|
u64 length;
|
|
|
|
u64 stripe_len;
|
|
|
|
u16 num_stripes;
|
|
|
|
u16 sub_stripes;
|
|
|
|
u64 type;
|
|
|
|
u64 features;
|
|
|
|
bool mixed = false;
|
|
|
|
|
|
|
|
length = btrfs_chunk_length(leaf, chunk);
|
|
|
|
stripe_len = btrfs_chunk_stripe_len(leaf, chunk);
|
|
|
|
num_stripes = btrfs_chunk_num_stripes(leaf, chunk);
|
|
|
|
sub_stripes = btrfs_chunk_sub_stripes(leaf, chunk);
|
|
|
|
type = btrfs_chunk_type(leaf, chunk);
|
|
|
|
|
|
|
|
if (!num_stripes) {
|
2019-03-20 18:22:58 +03:00
|
|
|
chunk_err(leaf, chunk, logical,
|
2019-03-20 08:36:06 +03:00
|
|
|
"invalid chunk num_stripes, have %u", num_stripes);
|
2019-03-20 08:39:14 +03:00
|
|
|
return -EUCLEAN;
|
2019-03-20 08:16:42 +03:00
|
|
|
}
|
|
|
|
if (!IS_ALIGNED(logical, fs_info->sectorsize)) {
|
2019-03-20 18:22:58 +03:00
|
|
|
chunk_err(leaf, chunk, logical,
|
2019-03-20 08:36:06 +03:00
|
|
|
"invalid chunk logical, have %llu should aligned to %u",
|
|
|
|
logical, fs_info->sectorsize);
|
2019-03-20 08:39:14 +03:00
|
|
|
return -EUCLEAN;
|
2019-03-20 08:16:42 +03:00
|
|
|
}
|
|
|
|
if (btrfs_chunk_sector_size(leaf, chunk) != fs_info->sectorsize) {
|
2019-03-20 18:22:58 +03:00
|
|
|
chunk_err(leaf, chunk, logical,
|
2019-03-20 08:36:06 +03:00
|
|
|
"invalid chunk sectorsize, have %u expect %u",
|
|
|
|
btrfs_chunk_sector_size(leaf, chunk),
|
|
|
|
fs_info->sectorsize);
|
2019-03-20 08:39:14 +03:00
|
|
|
return -EUCLEAN;
|
2019-03-20 08:16:42 +03:00
|
|
|
}
|
|
|
|
if (!length || !IS_ALIGNED(length, fs_info->sectorsize)) {
|
2019-03-20 18:22:58 +03:00
|
|
|
chunk_err(leaf, chunk, logical,
|
2019-03-20 08:36:06 +03:00
|
|
|
"invalid chunk length, have %llu", length);
|
2019-03-20 08:39:14 +03:00
|
|
|
return -EUCLEAN;
|
2019-03-20 08:16:42 +03:00
|
|
|
}
|
|
|
|
if (!is_power_of_2(stripe_len) || stripe_len != BTRFS_STRIPE_LEN) {
|
2019-03-20 18:22:58 +03:00
|
|
|
chunk_err(leaf, chunk, logical,
|
2019-03-20 08:36:06 +03:00
|
|
|
"invalid chunk stripe length: %llu",
|
2019-03-20 08:16:42 +03:00
|
|
|
stripe_len);
|
2019-03-20 08:39:14 +03:00
|
|
|
return -EUCLEAN;
|
2019-03-20 08:16:42 +03:00
|
|
|
}
|
|
|
|
if (~(BTRFS_BLOCK_GROUP_TYPE_MASK | BTRFS_BLOCK_GROUP_PROFILE_MASK) &
|
|
|
|
type) {
|
2019-03-20 18:22:58 +03:00
|
|
|
chunk_err(leaf, chunk, logical,
|
2019-03-20 08:36:06 +03:00
|
|
|
"unrecognized chunk type: 0x%llx",
|
2019-03-20 08:16:42 +03:00
|
|
|
~(BTRFS_BLOCK_GROUP_TYPE_MASK |
|
|
|
|
BTRFS_BLOCK_GROUP_PROFILE_MASK) &
|
|
|
|
btrfs_chunk_type(leaf, chunk));
|
2019-03-20 08:39:14 +03:00
|
|
|
return -EUCLEAN;
|
2019-03-20 08:16:42 +03:00
|
|
|
}
|
|
|
|
|
2019-03-13 07:17:50 +03:00
|
|
|
if (!is_power_of_2(type & BTRFS_BLOCK_GROUP_PROFILE_MASK) &&
|
|
|
|
(type & BTRFS_BLOCK_GROUP_PROFILE_MASK) != 0) {
|
2019-03-20 18:22:58 +03:00
|
|
|
chunk_err(leaf, chunk, logical,
|
2019-03-13 07:17:50 +03:00
|
|
|
"invalid chunk profile flag: 0x%llx, expect 0 or 1 bit set",
|
|
|
|
type & BTRFS_BLOCK_GROUP_PROFILE_MASK);
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
2019-03-20 08:16:42 +03:00
|
|
|
if ((type & BTRFS_BLOCK_GROUP_TYPE_MASK) == 0) {
|
2019-03-20 18:22:58 +03:00
|
|
|
chunk_err(leaf, chunk, logical,
|
2019-03-20 08:36:06 +03:00
|
|
|
"missing chunk type flag, have 0x%llx one bit must be set in 0x%llx",
|
|
|
|
type, BTRFS_BLOCK_GROUP_TYPE_MASK);
|
2019-03-20 08:39:14 +03:00
|
|
|
return -EUCLEAN;
|
2019-03-20 08:16:42 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
if ((type & BTRFS_BLOCK_GROUP_SYSTEM) &&
|
|
|
|
(type & (BTRFS_BLOCK_GROUP_METADATA | BTRFS_BLOCK_GROUP_DATA))) {
|
2019-03-20 18:22:58 +03:00
|
|
|
chunk_err(leaf, chunk, logical,
|
2019-03-20 08:36:06 +03:00
|
|
|
"system chunk with data or metadata type: 0x%llx",
|
|
|
|
type);
|
2019-03-20 08:39:14 +03:00
|
|
|
return -EUCLEAN;
|
2019-03-20 08:16:42 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
features = btrfs_super_incompat_flags(fs_info->super_copy);
|
|
|
|
if (features & BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS)
|
|
|
|
mixed = true;
|
|
|
|
|
|
|
|
if (!mixed) {
|
|
|
|
if ((type & BTRFS_BLOCK_GROUP_METADATA) &&
|
|
|
|
(type & BTRFS_BLOCK_GROUP_DATA)) {
|
2019-03-20 18:22:58 +03:00
|
|
|
chunk_err(leaf, chunk, logical,
|
2019-03-20 08:16:42 +03:00
|
|
|
"mixed chunk type in non-mixed mode: 0x%llx", type);
|
2019-03-20 08:39:14 +03:00
|
|
|
return -EUCLEAN;
|
2019-03-20 08:16:42 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((type & BTRFS_BLOCK_GROUP_RAID10 && sub_stripes != 2) ||
|
|
|
|
(type & BTRFS_BLOCK_GROUP_RAID1 && num_stripes != 2) ||
|
|
|
|
(type & BTRFS_BLOCK_GROUP_RAID5 && num_stripes < 2) ||
|
|
|
|
(type & BTRFS_BLOCK_GROUP_RAID6 && num_stripes < 3) ||
|
|
|
|
(type & BTRFS_BLOCK_GROUP_DUP && num_stripes != 2) ||
|
|
|
|
((type & BTRFS_BLOCK_GROUP_PROFILE_MASK) == 0 && num_stripes != 1)) {
|
2019-03-20 18:22:58 +03:00
|
|
|
chunk_err(leaf, chunk, logical,
|
2019-03-20 08:16:42 +03:00
|
|
|
"invalid num_stripes:sub_stripes %u:%u for profile %llu",
|
|
|
|
num_stripes, sub_stripes,
|
|
|
|
type & BTRFS_BLOCK_GROUP_PROFILE_MASK);
|
2019-03-20 08:39:14 +03:00
|
|
|
return -EUCLEAN;
|
2019-03-20 08:16:42 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
2018-07-03 12:10:05 +03:00
|
|
|
}
|
|
|
|
|
2019-03-20 18:22:58 +03:00
|
|
|
__printf(3, 4)
|
2019-03-08 09:20:03 +03:00
|
|
|
__cold
|
2019-03-20 18:22:58 +03:00
|
|
|
static void dev_item_err(const struct extent_buffer *eb, int slot,
|
2019-03-08 09:20:03 +03:00
|
|
|
const char *fmt, ...)
|
|
|
|
{
|
|
|
|
struct btrfs_key key;
|
|
|
|
struct va_format vaf;
|
|
|
|
va_list args;
|
|
|
|
|
|
|
|
btrfs_item_key_to_cpu(eb, &key, slot);
|
|
|
|
va_start(args, fmt);
|
|
|
|
|
|
|
|
vaf.fmt = fmt;
|
|
|
|
vaf.va = &args;
|
|
|
|
|
2019-03-20 18:22:58 +03:00
|
|
|
btrfs_crit(eb->fs_info,
|
2019-03-08 09:20:03 +03:00
|
|
|
"corrupt %s: root=%llu block=%llu slot=%d devid=%llu %pV",
|
|
|
|
btrfs_header_level(eb) == 0 ? "leaf" : "node",
|
|
|
|
btrfs_header_owner(eb), btrfs_header_bytenr(eb), slot,
|
|
|
|
key.objectid, &vaf);
|
|
|
|
va_end(args);
|
|
|
|
}
|
|
|
|
|
2019-03-20 18:22:58 +03:00
|
|
|
static int check_dev_item(struct extent_buffer *leaf,
|
2019-03-08 09:20:03 +03:00
|
|
|
struct btrfs_key *key, int slot)
|
|
|
|
{
|
2019-03-20 18:22:58 +03:00
|
|
|
struct btrfs_fs_info *fs_info = leaf->fs_info;
|
2019-03-08 09:20:03 +03:00
|
|
|
struct btrfs_dev_item *ditem;
|
|
|
|
u64 max_devid = max(BTRFS_MAX_DEVS(fs_info), BTRFS_MAX_DEVS_SYS_CHUNK);
|
|
|
|
|
|
|
|
if (key->objectid != BTRFS_DEV_ITEMS_OBJECTID) {
|
2019-03-20 18:22:58 +03:00
|
|
|
dev_item_err(leaf, slot,
|
2019-03-08 09:20:03 +03:00
|
|
|
"invalid objectid: has=%llu expect=%llu",
|
|
|
|
key->objectid, BTRFS_DEV_ITEMS_OBJECTID);
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
if (key->offset > max_devid) {
|
2019-03-20 18:22:58 +03:00
|
|
|
dev_item_err(leaf, slot,
|
2019-03-08 09:20:03 +03:00
|
|
|
"invalid devid: has=%llu expect=[0, %llu]",
|
|
|
|
key->offset, max_devid);
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
ditem = btrfs_item_ptr(leaf, slot, struct btrfs_dev_item);
|
|
|
|
if (btrfs_device_id(leaf, ditem) != key->offset) {
|
2019-03-20 18:22:58 +03:00
|
|
|
dev_item_err(leaf, slot,
|
2019-03-08 09:20:03 +03:00
|
|
|
"devid mismatch: key has=%llu item has=%llu",
|
|
|
|
key->offset, btrfs_device_id(leaf, ditem));
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* For device total_bytes, we don't have reliable way to check it, as
|
|
|
|
* it can be 0 for device removal. Device size check can only be done
|
|
|
|
* by dev extents check.
|
|
|
|
*/
|
|
|
|
if (btrfs_device_bytes_used(leaf, ditem) >
|
|
|
|
btrfs_device_total_bytes(leaf, ditem)) {
|
2019-03-20 18:22:58 +03:00
|
|
|
dev_item_err(leaf, slot,
|
2019-03-08 09:20:03 +03:00
|
|
|
"invalid bytes used: have %llu expect [0, %llu]",
|
|
|
|
btrfs_device_bytes_used(leaf, ditem),
|
|
|
|
btrfs_device_total_bytes(leaf, ditem));
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Remaining members like io_align/type/gen/dev_group aren't really
|
|
|
|
* utilized. Skip them to make later usage of them easier.
|
|
|
|
*/
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2019-03-13 09:31:35 +03:00
|
|
|
/* Inode item error output has the same format as dir_item_err() */
|
|
|
|
#define inode_item_err(fs_info, eb, slot, fmt, ...) \
|
2019-03-20 18:07:27 +03:00
|
|
|
dir_item_err(eb, slot, fmt, __VA_ARGS__)
|
2019-03-13 09:31:35 +03:00
|
|
|
|
2019-03-20 18:22:58 +03:00
|
|
|
static int check_inode_item(struct extent_buffer *leaf,
|
2019-03-13 09:31:35 +03:00
|
|
|
struct btrfs_key *key, int slot)
|
|
|
|
{
|
2019-03-20 18:22:58 +03:00
|
|
|
struct btrfs_fs_info *fs_info = leaf->fs_info;
|
2019-03-13 09:31:35 +03:00
|
|
|
struct btrfs_inode_item *iitem;
|
|
|
|
u64 super_gen = btrfs_super_generation(fs_info->super_copy);
|
|
|
|
u32 valid_mask = (S_IFMT | S_ISUID | S_ISGID | S_ISVTX | 0777);
|
|
|
|
u32 mode;
|
|
|
|
|
|
|
|
if ((key->objectid < BTRFS_FIRST_FREE_OBJECTID ||
|
|
|
|
key->objectid > BTRFS_LAST_FREE_OBJECTID) &&
|
|
|
|
key->objectid != BTRFS_ROOT_TREE_DIR_OBJECTID &&
|
|
|
|
key->objectid != BTRFS_FREE_INO_OBJECTID) {
|
2019-03-20 17:31:28 +03:00
|
|
|
generic_err(leaf, slot,
|
2019-03-13 09:31:35 +03:00
|
|
|
"invalid key objectid: has %llu expect %llu or [%llu, %llu] or %llu",
|
|
|
|
key->objectid, BTRFS_ROOT_TREE_DIR_OBJECTID,
|
|
|
|
BTRFS_FIRST_FREE_OBJECTID,
|
|
|
|
BTRFS_LAST_FREE_OBJECTID,
|
|
|
|
BTRFS_FREE_INO_OBJECTID);
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
if (key->offset != 0) {
|
|
|
|
inode_item_err(fs_info, leaf, slot,
|
|
|
|
"invalid key offset: has %llu expect 0",
|
|
|
|
key->offset);
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
iitem = btrfs_item_ptr(leaf, slot, struct btrfs_inode_item);
|
|
|
|
|
|
|
|
/* Here we use super block generation + 1 to handle log tree */
|
|
|
|
if (btrfs_inode_generation(leaf, iitem) > super_gen + 1) {
|
|
|
|
inode_item_err(fs_info, leaf, slot,
|
|
|
|
"invalid inode generation: has %llu expect (0, %llu]",
|
|
|
|
btrfs_inode_generation(leaf, iitem),
|
|
|
|
super_gen + 1);
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
/* Note for ROOT_TREE_DIR_ITEM, mkfs could set its transid 0 */
|
|
|
|
if (btrfs_inode_transid(leaf, iitem) > super_gen + 1) {
|
|
|
|
inode_item_err(fs_info, leaf, slot,
|
|
|
|
"invalid inode generation: has %llu expect [0, %llu]",
|
|
|
|
btrfs_inode_transid(leaf, iitem), super_gen + 1);
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* For size and nbytes it's better not to be too strict, as for dir
|
|
|
|
* item its size/nbytes can easily get wrong, but doesn't affect
|
|
|
|
* anything in the fs. So here we skip the check.
|
|
|
|
*/
|
|
|
|
mode = btrfs_inode_mode(leaf, iitem);
|
|
|
|
if (mode & ~valid_mask) {
|
|
|
|
inode_item_err(fs_info, leaf, slot,
|
|
|
|
"unknown mode bit detected: 0x%x",
|
|
|
|
mode & ~valid_mask);
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* S_IFMT is not bit mapped so we can't completely rely on is_power_of_2,
|
|
|
|
* but is_power_of_2() can save us from checking FIFO/CHR/DIR/REG.
|
|
|
|
* Only needs to check BLK, LNK and SOCKS
|
|
|
|
*/
|
|
|
|
if (!is_power_of_2(mode & S_IFMT)) {
|
|
|
|
if (!S_ISLNK(mode) && !S_ISBLK(mode) && !S_ISSOCK(mode)) {
|
|
|
|
inode_item_err(fs_info, leaf, slot,
|
|
|
|
"invalid mode: has 0%o expect valid S_IF* bit(s)",
|
|
|
|
mode & S_IFMT);
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (S_ISDIR(mode) && btrfs_inode_nlink(leaf, iitem) > 1) {
|
|
|
|
inode_item_err(fs_info, leaf, slot,
|
|
|
|
"invalid nlink: has %u expect no more than 1 for dir",
|
|
|
|
btrfs_inode_nlink(leaf, iitem));
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
if (btrfs_inode_flags(leaf, iitem) & ~BTRFS_INODE_FLAG_MASK) {
|
|
|
|
inode_item_err(fs_info, leaf, slot,
|
|
|
|
"unknown flags detected: 0x%llx",
|
|
|
|
btrfs_inode_flags(leaf, iitem) &
|
|
|
|
~BTRFS_INODE_FLAG_MASK);
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-10-09 04:51:02 +03:00
|
|
|
/*
|
|
|
|
* Common point to switch the item-specific validation.
|
|
|
|
*/
|
2019-03-20 18:22:00 +03:00
|
|
|
static int check_leaf_item(struct extent_buffer *leaf,
|
2019-05-06 18:44:12 +03:00
|
|
|
struct btrfs_key *key, int slot,
|
|
|
|
struct btrfs_key *prev_key)
|
2017-10-09 04:51:02 +03:00
|
|
|
{
|
|
|
|
int ret = 0;
|
2019-03-20 08:42:33 +03:00
|
|
|
struct btrfs_chunk *chunk;
|
2017-10-09 04:51:02 +03:00
|
|
|
|
|
|
|
switch (key->type) {
|
|
|
|
case BTRFS_EXTENT_DATA_KEY:
|
2019-05-06 18:44:12 +03:00
|
|
|
ret = check_extent_data_item(leaf, key, slot, prev_key);
|
2017-10-09 04:51:02 +03:00
|
|
|
break;
|
|
|
|
case BTRFS_EXTENT_CSUM_KEY:
|
2019-03-20 18:02:56 +03:00
|
|
|
ret = check_csum_item(leaf, key, slot);
|
2017-10-09 04:51:02 +03:00
|
|
|
break;
|
2017-11-08 03:54:25 +03:00
|
|
|
case BTRFS_DIR_ITEM_KEY:
|
|
|
|
case BTRFS_DIR_INDEX_KEY:
|
|
|
|
case BTRFS_XATTR_ITEM_KEY:
|
2019-03-20 18:17:46 +03:00
|
|
|
ret = check_dir_item(leaf, key, slot);
|
2017-11-08 03:54:25 +03:00
|
|
|
break;
|
2018-07-03 12:10:05 +03:00
|
|
|
case BTRFS_BLOCK_GROUP_ITEM_KEY:
|
2019-03-20 18:19:31 +03:00
|
|
|
ret = check_block_group_item(leaf, key, slot);
|
2018-07-03 12:10:05 +03:00
|
|
|
break;
|
2019-03-20 08:42:33 +03:00
|
|
|
case BTRFS_CHUNK_ITEM_KEY:
|
|
|
|
chunk = btrfs_item_ptr(leaf, slot, struct btrfs_chunk);
|
2019-03-20 18:40:48 +03:00
|
|
|
ret = btrfs_check_chunk_valid(leaf, chunk, key->offset);
|
2019-03-20 08:42:33 +03:00
|
|
|
break;
|
2019-03-08 09:20:03 +03:00
|
|
|
case BTRFS_DEV_ITEM_KEY:
|
2019-03-20 18:22:58 +03:00
|
|
|
ret = check_dev_item(leaf, key, slot);
|
2019-03-08 09:20:03 +03:00
|
|
|
break;
|
2019-03-13 09:31:35 +03:00
|
|
|
case BTRFS_INODE_ITEM_KEY:
|
2019-03-20 18:22:58 +03:00
|
|
|
ret = check_inode_item(leaf, key, slot);
|
2019-03-13 09:31:35 +03:00
|
|
|
break;
|
2017-10-09 04:51:02 +03:00
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2019-03-20 18:22:58 +03:00
|
|
|
static int check_leaf(struct extent_buffer *leaf, bool check_item_data)
|
2017-10-09 04:51:02 +03:00
|
|
|
{
|
2019-03-20 18:22:58 +03:00
|
|
|
struct btrfs_fs_info *fs_info = leaf->fs_info;
|
2017-10-09 04:51:02 +03:00
|
|
|
/* No valid key type is 0, so all key should be larger than this key */
|
|
|
|
struct btrfs_key prev_key = {0, 0, 0};
|
|
|
|
struct btrfs_key key;
|
|
|
|
u32 nritems = btrfs_header_nritems(leaf);
|
|
|
|
int slot;
|
|
|
|
|
2018-09-28 02:59:34 +03:00
|
|
|
if (btrfs_header_level(leaf) != 0) {
|
2019-03-20 17:31:28 +03:00
|
|
|
generic_err(leaf, 0,
|
2018-09-28 02:59:34 +03:00
|
|
|
"invalid level for leaf, have %d expect 0",
|
|
|
|
btrfs_header_level(leaf));
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
|
2017-10-09 04:51:02 +03:00
|
|
|
/*
|
|
|
|
* Extent buffers from a relocation tree have a owner field that
|
|
|
|
* corresponds to the subvolume tree they are based on. So just from an
|
|
|
|
* extent buffer alone we can not find out what is the id of the
|
|
|
|
* corresponding subvolume tree, so we can not figure out if the extent
|
|
|
|
* buffer corresponds to the root of the relocation tree or not. So
|
|
|
|
* skip this check for relocation trees.
|
|
|
|
*/
|
|
|
|
if (nritems == 0 && !btrfs_header_flag(leaf, BTRFS_HEADER_FLAG_RELOC)) {
|
2018-07-03 12:10:06 +03:00
|
|
|
u64 owner = btrfs_header_owner(leaf);
|
2017-10-09 04:51:02 +03:00
|
|
|
|
2018-07-03 12:10:06 +03:00
|
|
|
/* These trees must never be empty */
|
|
|
|
if (owner == BTRFS_ROOT_TREE_OBJECTID ||
|
|
|
|
owner == BTRFS_CHUNK_TREE_OBJECTID ||
|
|
|
|
owner == BTRFS_EXTENT_TREE_OBJECTID ||
|
|
|
|
owner == BTRFS_DEV_TREE_OBJECTID ||
|
|
|
|
owner == BTRFS_FS_TREE_OBJECTID ||
|
|
|
|
owner == BTRFS_DATA_RELOC_TREE_OBJECTID) {
|
2019-03-20 17:31:28 +03:00
|
|
|
generic_err(leaf, 0,
|
2018-07-03 12:10:06 +03:00
|
|
|
"invalid root, root %llu must never be empty",
|
|
|
|
owner);
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
2017-10-09 04:51:02 +03:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (nritems == 0)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check the following things to make sure this is a good leaf, and
|
|
|
|
* leaf users won't need to bother with similar sanity checks:
|
|
|
|
*
|
|
|
|
* 1) key ordering
|
|
|
|
* 2) item offset and size
|
|
|
|
* No overlap, no hole, all inside the leaf.
|
|
|
|
* 3) item content
|
|
|
|
* If possible, do comprehensive sanity check.
|
|
|
|
* NOTE: All checks must only rely on the item data itself.
|
|
|
|
*/
|
|
|
|
for (slot = 0; slot < nritems; slot++) {
|
|
|
|
u32 item_end_expected;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
btrfs_item_key_to_cpu(leaf, &key, slot);
|
|
|
|
|
|
|
|
/* Make sure the keys are in the right order */
|
|
|
|
if (btrfs_comp_cpu_keys(&prev_key, &key) >= 0) {
|
2019-03-20 17:31:28 +03:00
|
|
|
generic_err(leaf, slot,
|
2017-10-09 04:51:04 +03:00
|
|
|
"bad key order, prev (%llu %u %llu) current (%llu %u %llu)",
|
|
|
|
prev_key.objectid, prev_key.type,
|
|
|
|
prev_key.offset, key.objectid, key.type,
|
|
|
|
key.offset);
|
2017-10-09 04:51:02 +03:00
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Make sure the offset and ends are right, remember that the
|
|
|
|
* item data starts at the end of the leaf and grows towards the
|
|
|
|
* front.
|
|
|
|
*/
|
|
|
|
if (slot == 0)
|
|
|
|
item_end_expected = BTRFS_LEAF_DATA_SIZE(fs_info);
|
|
|
|
else
|
|
|
|
item_end_expected = btrfs_item_offset_nr(leaf,
|
|
|
|
slot - 1);
|
|
|
|
if (btrfs_item_end_nr(leaf, slot) != item_end_expected) {
|
2019-03-20 17:31:28 +03:00
|
|
|
generic_err(leaf, slot,
|
2017-10-09 04:51:04 +03:00
|
|
|
"unexpected item end, have %u expect %u",
|
|
|
|
btrfs_item_end_nr(leaf, slot),
|
|
|
|
item_end_expected);
|
2017-10-09 04:51:02 +03:00
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check to make sure that we don't point outside of the leaf,
|
|
|
|
* just in case all the items are consistent to each other, but
|
|
|
|
* all point outside of the leaf.
|
|
|
|
*/
|
|
|
|
if (btrfs_item_end_nr(leaf, slot) >
|
|
|
|
BTRFS_LEAF_DATA_SIZE(fs_info)) {
|
2019-03-20 17:31:28 +03:00
|
|
|
generic_err(leaf, slot,
|
2017-10-09 04:51:04 +03:00
|
|
|
"slot end outside of leaf, have %u expect range [0, %u]",
|
|
|
|
btrfs_item_end_nr(leaf, slot),
|
|
|
|
BTRFS_LEAF_DATA_SIZE(fs_info));
|
2017-10-09 04:51:02 +03:00
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Also check if the item pointer overlaps with btrfs item. */
|
|
|
|
if (btrfs_item_nr_offset(slot) + sizeof(struct btrfs_item) >
|
|
|
|
btrfs_item_ptr_offset(leaf, slot)) {
|
2019-03-20 17:31:28 +03:00
|
|
|
generic_err(leaf, slot,
|
2017-10-09 04:51:04 +03:00
|
|
|
"slot overlaps with its data, item end %lu data start %lu",
|
|
|
|
btrfs_item_nr_offset(slot) +
|
|
|
|
sizeof(struct btrfs_item),
|
|
|
|
btrfs_item_ptr_offset(leaf, slot));
|
2017-10-09 04:51:02 +03:00
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
|
|
|
|
2017-11-08 03:54:24 +03:00
|
|
|
if (check_item_data) {
|
|
|
|
/*
|
|
|
|
* Check if the item size and content meet other
|
|
|
|
* criteria
|
|
|
|
*/
|
2019-05-06 18:44:12 +03:00
|
|
|
ret = check_leaf_item(leaf, &key, slot, &prev_key);
|
2017-11-08 03:54:24 +03:00
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
|
|
|
}
|
2017-10-09 04:51:02 +03:00
|
|
|
|
|
|
|
prev_key.objectid = key.objectid;
|
|
|
|
prev_key.type = key.type;
|
|
|
|
prev_key.offset = key.offset;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2019-03-20 18:23:29 +03:00
|
|
|
int btrfs_check_leaf_full(struct extent_buffer *leaf)
|
2017-11-08 03:54:24 +03:00
|
|
|
{
|
2019-03-20 18:22:58 +03:00
|
|
|
return check_leaf(leaf, true);
|
2017-11-08 03:54:24 +03:00
|
|
|
}
|
2019-04-24 10:22:53 +03:00
|
|
|
ALLOW_ERROR_INJECTION(btrfs_check_leaf_full, ERRNO);
|
2017-11-08 03:54:24 +03:00
|
|
|
|
2019-03-20 18:24:18 +03:00
|
|
|
int btrfs_check_leaf_relaxed(struct extent_buffer *leaf)
|
2017-11-08 03:54:24 +03:00
|
|
|
{
|
2019-03-20 18:22:58 +03:00
|
|
|
return check_leaf(leaf, false);
|
2017-11-08 03:54:24 +03:00
|
|
|
}
|
|
|
|
|
2019-03-20 18:25:00 +03:00
|
|
|
int btrfs_check_node(struct extent_buffer *node)
|
2017-10-09 04:51:02 +03:00
|
|
|
{
|
2019-03-20 18:25:00 +03:00
|
|
|
struct btrfs_fs_info *fs_info = node->fs_info;
|
2017-10-09 04:51:02 +03:00
|
|
|
unsigned long nr = btrfs_header_nritems(node);
|
|
|
|
struct btrfs_key key, next_key;
|
|
|
|
int slot;
|
2018-09-28 02:59:34 +03:00
|
|
|
int level = btrfs_header_level(node);
|
2017-10-09 04:51:02 +03:00
|
|
|
u64 bytenr;
|
|
|
|
int ret = 0;
|
|
|
|
|
2018-09-28 02:59:34 +03:00
|
|
|
if (level <= 0 || level >= BTRFS_MAX_LEVEL) {
|
2019-03-20 17:31:28 +03:00
|
|
|
generic_err(node, 0,
|
2018-09-28 02:59:34 +03:00
|
|
|
"invalid level for node, have %d expect [1, %d]",
|
|
|
|
level, BTRFS_MAX_LEVEL - 1);
|
|
|
|
return -EUCLEAN;
|
|
|
|
}
|
2018-01-25 09:56:18 +03:00
|
|
|
if (nr == 0 || nr > BTRFS_NODEPTRS_PER_BLOCK(fs_info)) {
|
|
|
|
btrfs_crit(fs_info,
|
2017-10-09 04:51:03 +03:00
|
|
|
"corrupt node: root=%llu block=%llu, nritems too %s, have %lu expect range [1,%u]",
|
2018-01-25 09:56:18 +03:00
|
|
|
btrfs_header_owner(node), node->start,
|
2017-10-09 04:51:03 +03:00
|
|
|
nr == 0 ? "small" : "large", nr,
|
2018-01-25 09:56:18 +03:00
|
|
|
BTRFS_NODEPTRS_PER_BLOCK(fs_info));
|
2017-10-09 04:51:03 +03:00
|
|
|
return -EUCLEAN;
|
2017-10-09 04:51:02 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
for (slot = 0; slot < nr - 1; slot++) {
|
|
|
|
bytenr = btrfs_node_blockptr(node, slot);
|
|
|
|
btrfs_node_key_to_cpu(node, &key, slot);
|
|
|
|
btrfs_node_key_to_cpu(node, &next_key, slot + 1);
|
|
|
|
|
|
|
|
if (!bytenr) {
|
2019-03-20 17:31:28 +03:00
|
|
|
generic_err(node, slot,
|
2017-10-09 04:51:03 +03:00
|
|
|
"invalid NULL node pointer");
|
|
|
|
ret = -EUCLEAN;
|
|
|
|
goto out;
|
|
|
|
}
|
2018-01-25 09:56:18 +03:00
|
|
|
if (!IS_ALIGNED(bytenr, fs_info->sectorsize)) {
|
2019-03-20 17:31:28 +03:00
|
|
|
generic_err(node, slot,
|
2017-10-09 04:51:03 +03:00
|
|
|
"unaligned pointer, have %llu should be aligned to %u",
|
2018-01-25 09:56:18 +03:00
|
|
|
bytenr, fs_info->sectorsize);
|
2017-10-09 04:51:03 +03:00
|
|
|
ret = -EUCLEAN;
|
2017-10-09 04:51:02 +03:00
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (btrfs_comp_cpu_keys(&key, &next_key) >= 0) {
|
2019-03-20 17:31:28 +03:00
|
|
|
generic_err(node, slot,
|
2017-10-09 04:51:03 +03:00
|
|
|
"bad key order, current (%llu %u %llu) next (%llu %u %llu)",
|
|
|
|
key.objectid, key.type, key.offset,
|
|
|
|
next_key.objectid, next_key.type,
|
|
|
|
next_key.offset);
|
|
|
|
ret = -EUCLEAN;
|
2017-10-09 04:51:02 +03:00
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
out:
|
|
|
|
return ret;
|
|
|
|
}
|
2019-04-24 10:22:53 +03:00
|
|
|
ALLOW_ERROR_INJECTION(btrfs_check_node, ERRNO);
|