(unsigned long long)btrfs_free_space_bitmaps(leaf, header));
}
-static void print_key_type(u64 objectid, u8 type)
+void print_key_type(FILE *stream, u64 objectid, u8 type)
{
if (type == 0 && objectid == BTRFS_FREE_SPACE_OBJECTID) {
- printf("UNTYPED");
+ fprintf(stream, "UNTYPED");
return;
}
switch (type) {
case BTRFS_INODE_ITEM_KEY:
- printf("INODE_ITEM");
+ fprintf(stream, "INODE_ITEM");
break;
case BTRFS_INODE_REF_KEY:
- printf("INODE_REF");
+ fprintf(stream, "INODE_REF");
break;
case BTRFS_INODE_EXTREF_KEY:
- printf("INODE_EXTREF");
+ fprintf(stream, "INODE_EXTREF");
break;
case BTRFS_DIR_ITEM_KEY:
- printf("DIR_ITEM");
+ fprintf(stream, "DIR_ITEM");
break;
case BTRFS_DIR_INDEX_KEY:
- printf("DIR_INDEX");
+ fprintf(stream, "DIR_INDEX");
break;
case BTRFS_DIR_LOG_ITEM_KEY:
- printf("DIR_LOG_ITEM");
+ fprintf(stream, "DIR_LOG_ITEM");
break;
case BTRFS_DIR_LOG_INDEX_KEY:
- printf("DIR_LOG_INDEX");
+ fprintf(stream, "DIR_LOG_INDEX");
break;
case BTRFS_XATTR_ITEM_KEY:
- printf("XATTR_ITEM");
+ fprintf(stream, "XATTR_ITEM");
break;
case BTRFS_ORPHAN_ITEM_KEY:
- printf("ORPHAN_ITEM");
+ fprintf(stream, "ORPHAN_ITEM");
break;
case BTRFS_ROOT_ITEM_KEY:
- printf("ROOT_ITEM");
+ fprintf(stream, "ROOT_ITEM");
break;
case BTRFS_ROOT_REF_KEY:
- printf("ROOT_REF");
+ fprintf(stream, "ROOT_REF");
break;
case BTRFS_ROOT_BACKREF_KEY:
- printf("ROOT_BACKREF");
+ fprintf(stream, "ROOT_BACKREF");
break;
case BTRFS_EXTENT_ITEM_KEY:
- printf("EXTENT_ITEM");
+ fprintf(stream, "EXTENT_ITEM");
break;
case BTRFS_METADATA_ITEM_KEY:
- printf("METADATA_ITEM");
+ fprintf(stream, "METADATA_ITEM");
break;
case BTRFS_TREE_BLOCK_REF_KEY:
- printf("TREE_BLOCK_REF");
+ fprintf(stream, "TREE_BLOCK_REF");
break;
case BTRFS_SHARED_BLOCK_REF_KEY:
- printf("SHARED_BLOCK_REF");
+ fprintf(stream, "SHARED_BLOCK_REF");
break;
case BTRFS_EXTENT_DATA_REF_KEY:
- printf("EXTENT_DATA_REF");
+ fprintf(stream, "EXTENT_DATA_REF");
break;
case BTRFS_SHARED_DATA_REF_KEY:
- printf("SHARED_DATA_REF");
+ fprintf(stream, "SHARED_DATA_REF");
break;
case BTRFS_EXTENT_REF_V0_KEY:
- printf("EXTENT_REF_V0");
+ fprintf(stream, "EXTENT_REF_V0");
break;
case BTRFS_CSUM_ITEM_KEY:
- printf("CSUM_ITEM");
+ fprintf(stream, "CSUM_ITEM");
break;
case BTRFS_EXTENT_CSUM_KEY:
- printf("EXTENT_CSUM");
+ fprintf(stream, "EXTENT_CSUM");
break;
case BTRFS_EXTENT_DATA_KEY:
- printf("EXTENT_DATA");
+ fprintf(stream, "EXTENT_DATA");
break;
case BTRFS_BLOCK_GROUP_ITEM_KEY:
- printf("BLOCK_GROUP_ITEM");
+ fprintf(stream, "BLOCK_GROUP_ITEM");
break;
case BTRFS_FREE_SPACE_INFO_KEY:
- printf("FREE_SPACE_INFO");
+ fprintf(stream, "FREE_SPACE_INFO");
break;
case BTRFS_FREE_SPACE_EXTENT_KEY:
- printf("FREE_SPACE_EXTENT");
+ fprintf(stream, "FREE_SPACE_EXTENT");
break;
case BTRFS_FREE_SPACE_BITMAP_KEY:
- printf("FREE_SPACE_BITMAP");
+ fprintf(stream, "FREE_SPACE_BITMAP");
break;
case BTRFS_CHUNK_ITEM_KEY:
- printf("CHUNK_ITEM");
+ fprintf(stream, "CHUNK_ITEM");
break;
case BTRFS_DEV_ITEM_KEY:
- printf("DEV_ITEM");
+ fprintf(stream, "DEV_ITEM");
break;
case BTRFS_DEV_EXTENT_KEY:
- printf("DEV_EXTENT");
+ fprintf(stream, "DEV_EXTENT");
break;
case BTRFS_BALANCE_ITEM_KEY:
- printf("BALANCE_ITEM");
+ fprintf(stream, "BALANCE_ITEM");
break;
case BTRFS_DEV_REPLACE_KEY:
- printf("DEV_REPLACE");
+ fprintf(stream, "DEV_REPLACE");
break;
case BTRFS_STRING_ITEM_KEY:
- printf("STRING_ITEM");
+ fprintf(stream, "STRING_ITEM");
break;
case BTRFS_QGROUP_STATUS_KEY:
- printf("QGROUP_STATUS");
+ fprintf(stream, "QGROUP_STATUS");
break;
case BTRFS_QGROUP_RELATION_KEY:
- printf("QGROUP_RELATION");
+ fprintf(stream, "QGROUP_RELATION");
break;
case BTRFS_QGROUP_INFO_KEY:
- printf("QGROUP_INFO");
+ fprintf(stream, "QGROUP_INFO");
break;
case BTRFS_QGROUP_LIMIT_KEY:
- printf("QGROUP_LIMIT");
+ fprintf(stream, "QGROUP_LIMIT");
break;
case BTRFS_DEV_STATS_KEY:
- printf("DEV_STATS");
+ fprintf(stream, "DEV_STATS");
break;
case BTRFS_UUID_KEY_SUBVOL:
- printf("UUID_KEY_SUBVOL");
+ fprintf(stream, "UUID_KEY_SUBVOL");
break;
case BTRFS_UUID_KEY_RECEIVED_SUBVOL:
- printf("UUID_KEY_RECEIVED_SUBVOL");
+ fprintf(stream, "UUID_KEY_RECEIVED_SUBVOL");
break;
default:
- printf("UNKNOWN.%d", type);
+ fprintf(stream, "UNKNOWN.%d", type);
};
}
printf("key (");
print_objectid(stdout, objectid, type);
printf(" ");
- print_key_type(objectid, type);
+ print_key_type(stdout, objectid, type);
switch (type) {
case BTRFS_QGROUP_RELATION_KEY:
case BTRFS_QGROUP_INFO_KEY:
}
}
-/* Caller should ensure sizeof(*ret) >= 29 "NODATASUM|NODATACOW|READONLY" */
+/* Btrfs inode flag stringification helper */
+#define STRCAT_ONE_INODE_FLAG(flags, name, empty, dst) ({ \
+ if (flags & BTRFS_INODE_##name) { \
+ if (!empty) \
+ strcat(dst, "|"); \
+ strcat(dst, #name); \
+ empty = 0; \
+ } \
+})
+
+/*
+ * Caller should ensure sizeof(*ret) >= 102: all charactors plus '|' of
+ * BTRFS_INODE_* flags
+ */
static void inode_flags_to_str(u64 flags, char *ret)
{
int empty = 1;
- if (flags & BTRFS_INODE_NODATASUM) {
- empty = 0;
- strcpy(ret, "NODATASUM");
- }
- if (flags & BTRFS_INODE_NODATACOW) {
- if (!empty) {
- empty = 0;
- strcat(ret, "|");
- }
- strcat(ret, "NODATACOW");
- }
- if (flags & BTRFS_INODE_READONLY) {
- if (!empty) {
- empty = 0;
- strcat(ret, "|");
- }
- strcat(ret, "READONLY");
- }
+ STRCAT_ONE_INODE_FLAG(flags, NODATASUM, empty, ret);
+ STRCAT_ONE_INODE_FLAG(flags, NODATACOW, empty, ret);
+ STRCAT_ONE_INODE_FLAG(flags, READONLY, empty, ret);
+ STRCAT_ONE_INODE_FLAG(flags, NOCOMPRESS, empty, ret);
+ STRCAT_ONE_INODE_FLAG(flags, PREALLOC, empty, ret);
+ STRCAT_ONE_INODE_FLAG(flags, SYNC, empty, ret);
+ STRCAT_ONE_INODE_FLAG(flags, IMMUTABLE, empty, ret);
+ STRCAT_ONE_INODE_FLAG(flags, APPEND, empty, ret);
+ STRCAT_ONE_INODE_FLAG(flags, NODUMP, empty, ret);
+ STRCAT_ONE_INODE_FLAG(flags, NOATIME, empty, ret);
+ STRCAT_ONE_INODE_FLAG(flags, DIRSYNC, empty, ret);
+ STRCAT_ONE_INODE_FLAG(flags, COMPRESS, empty, ret);
if (empty)
strcat(ret, "none");
}
u32 nr = btrfs_header_nritems(l);
u64 objectid;
u32 type;
- char flags_str[32];
+ char flags_str[256];
printf("leaf %llu items %d free space %d generation %llu owner %llu\n",
(unsigned long long)btrfs_header_bytenr(l), nr,
u32 size;
struct btrfs_disk_key disk_key;
struct btrfs_key key;
+ struct extent_buffer *next;
if (!eb)
return;
return;
for (i = 0; i < nr; i++) {
- struct extent_buffer *next = read_tree_block(root,
- btrfs_node_blockptr(eb, i),
- size,
- btrfs_node_ptr_generation(eb, i));
+ next = read_tree_block(root, btrfs_node_blockptr(eb, i), size,
+ btrfs_node_ptr_generation(eb, i));
if (!extent_buffer_uptodate(next)) {
fprintf(stderr, "failed to read %llu in tree %llu\n",
(unsigned long long)btrfs_node_blockptr(eb, i),
(unsigned long long)btrfs_header_owner(eb));
continue;
}
- if (btrfs_is_leaf(next) &&
- btrfs_header_level(eb) != 1)
- BUG();
- if (btrfs_header_level(next) !=
- btrfs_header_level(eb) - 1)
- BUG();
+ if (btrfs_is_leaf(next) && btrfs_header_level(eb) != 1) {
+ warning(
+ "eb corrupted: item %d eb level %d next level %d, skipping the rest",
+ i, btrfs_header_level(next),
+ btrfs_header_level(eb));
+ goto out;
+ }
+ if (btrfs_header_level(next) != btrfs_header_level(eb) - 1) {
+ warning(
+ "eb corrupted: item %d eb level %d next level %d, skipping the rest",
+ i, btrfs_header_level(next),
+ btrfs_header_level(eb));
+ goto out;
+ }
btrfs_print_tree(root, next, 1);
free_extent_buffer(next);
}
+
+ return;
+
+out:
+ free_extent_buffer(next);
}