1 /* SPDX-License-Identifier: GPL-2.0+ */
3 * From linux/fs/btrfs/ctree.h
4 * Copyright (C) 2007,2008 Oracle. All rights reserved.
6 * Modified in 2017 by Marek Behun, CZ.NIC, marek.behun@nic.cz
9 #ifndef __BTRFS_CTREE_H__
10 #define __BTRFS_CTREE_H__
14 #include "btrfs_tree.h"
16 #define BTRFS_MAGIC 0x4D5F53665248425FULL /* ascii _BHRfS_M, no null */
18 #define BTRFS_MAX_MIRRORS 3
20 #define BTRFS_MAX_LEVEL 8
22 #define BTRFS_COMPAT_EXTENT_TREE_V0
25 * the max metadata block size. This limit is somewhat artificial,
26 * but the memmove costs go through the roof for larger blocks.
28 #define BTRFS_MAX_METADATA_BLOCKSIZE 65536
31 * we can actually store much bigger names, but lets not confuse the rest
34 #define BTRFS_NAME_LEN 255
37 * Theoretical limit is larger, but we keep this down to a sane
38 * value. That should limit greatly the possibility of collisions on
41 #define BTRFS_LINK_MAX 65535U
43 static const int btrfs_csum_sizes
[] = { 4 };
45 /* four bytes for CRC32 */
46 #define BTRFS_EMPTY_DIR_SIZE 0
48 /* ioprio of readahead is set to idle */
49 #define BTRFS_IOPRIO_READA (IOPRIO_PRIO_VALUE(IOPRIO_CLASS_IDLE, 0))
51 #define BTRFS_DIRTY_METADATA_THRESH SZ_32M
53 #define BTRFS_MAX_EXTENT_SIZE SZ_128M
58 #define BTRFS_FS_STATE_ERROR 0
59 #define BTRFS_FS_STATE_REMOUNTING 1
60 #define BTRFS_FS_STATE_TRANS_ABORTED 2
61 #define BTRFS_FS_STATE_DEV_REPLACING 3
62 #define BTRFS_FS_STATE_DUMMY_FS_INFO 4
64 #define BTRFS_BACKREF_REV_MAX 256
65 #define BTRFS_BACKREF_REV_SHIFT 56
66 #define BTRFS_BACKREF_REV_MASK (((u64)BTRFS_BACKREF_REV_MAX - 1) << \
67 BTRFS_BACKREF_REV_SHIFT)
69 #define BTRFS_OLD_BACKREF_REV 0
70 #define BTRFS_MIXED_BACKREF_REV 1
73 * every tree block (leaf or node) starts with this header.
76 /* these first four must match the super block */
77 __u8 csum
[BTRFS_CSUM_SIZE
];
78 __u8 fsid
[BTRFS_FSID_SIZE
]; /* FS specific uuid */
79 __u64 bytenr
; /* which block this node is supposed to live in */
82 /* allowed to be different from the super from here on down */
83 __u8 chunk_tree_uuid
[BTRFS_UUID_SIZE
];
88 } __attribute__ ((__packed__
));
91 * this is a very generous portion of the super block, giving us
92 * room to translate 14 chunks with 3 stripes each.
94 #define BTRFS_SYSTEM_CHUNK_ARRAY_SIZE 2048
97 * just in case we somehow lose the roots and are not able to mount,
98 * we store an array of the roots from previous transactions
101 #define BTRFS_NUM_BACKUP_ROOTS 4
102 struct btrfs_root_backup
{
107 __u64 chunk_root_gen
;
110 __u64 extent_root_gen
;
127 __u8 tree_root_level
;
128 __u8 chunk_root_level
;
129 __u8 extent_root_level
;
132 __u8 csum_root_level
;
133 /* future and to align */
135 } __attribute__ ((__packed__
));
138 * the super block basically lists the main trees of the FS
139 * it currently lacks any block count etc etc
141 struct btrfs_super_block
{
142 __u8 csum
[BTRFS_CSUM_SIZE
];
143 /* the first 4 fields must match struct btrfs_header */
144 __u8 fsid
[BTRFS_FSID_SIZE
]; /* FS specific uuid */
145 __u64 bytenr
; /* this block number */
148 /* allowed to be different from the btrfs_header from here own down */
155 /* this will help find the new super based on the log root */
156 __u64 log_root_transid
;
159 __u64 root_dir_objectid
;
163 __u32 __unused_leafsize
;
165 __u32 sys_chunk_array_size
;
166 __u64 chunk_root_generation
;
168 __u64 compat_ro_flags
;
169 __u64 incompat_flags
;
172 __u8 chunk_root_level
;
174 struct btrfs_dev_item dev_item
;
176 char label
[BTRFS_LABEL_SIZE
];
178 __u64 cache_generation
;
179 __u64 uuid_tree_generation
;
181 /* future expansion */
183 __u8 sys_chunk_array
[BTRFS_SYSTEM_CHUNK_ARRAY_SIZE
];
184 struct btrfs_root_backup super_roots
[BTRFS_NUM_BACKUP_ROOTS
];
185 } __attribute__ ((__packed__
));
188 * Compat flags that we support. If any incompat flags are set other than the
189 * ones specified below then we will fail to mount
191 #define BTRFS_FEATURE_COMPAT_SUPP 0ULL
192 #define BTRFS_FEATURE_COMPAT_SAFE_SET 0ULL
193 #define BTRFS_FEATURE_COMPAT_SAFE_CLEAR 0ULL
195 #define BTRFS_FEATURE_COMPAT_RO_SUPP \
196 (BTRFS_FEATURE_COMPAT_RO_FREE_SPACE_TREE | \
197 BTRFS_FEATURE_COMPAT_RO_FREE_SPACE_TREE_VALID)
199 #define BTRFS_FEATURE_COMPAT_RO_SAFE_SET 0ULL
200 #define BTRFS_FEATURE_COMPAT_RO_SAFE_CLEAR 0ULL
202 #define BTRFS_FEATURE_INCOMPAT_SUPP \
203 (BTRFS_FEATURE_INCOMPAT_MIXED_BACKREF | \
204 BTRFS_FEATURE_INCOMPAT_DEFAULT_SUBVOL | \
205 BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS | \
206 BTRFS_FEATURE_INCOMPAT_BIG_METADATA | \
207 BTRFS_FEATURE_INCOMPAT_COMPRESS_LZO | \
208 BTRFS_FEATURE_INCOMPAT_RAID56 | \
209 BTRFS_FEATURE_INCOMPAT_EXTENDED_IREF | \
210 BTRFS_FEATURE_INCOMPAT_SKINNY_METADATA | \
211 BTRFS_FEATURE_INCOMPAT_NO_HOLES)
213 #define BTRFS_FEATURE_INCOMPAT_SAFE_SET \
214 (BTRFS_FEATURE_INCOMPAT_EXTENDED_IREF)
215 #define BTRFS_FEATURE_INCOMPAT_SAFE_CLEAR 0ULL
218 * A leaf is full of items. offset and size tell us where to find
219 * the item in the leaf (relative to the start of the data area)
222 struct btrfs_key key
;
225 } __attribute__ ((__packed__
));
228 * leaves have an item area and a data area:
229 * [item0, item1....itemN] [free space] [dataN...data1, data0]
231 * The data is separate from the items to get the keys closer together
235 struct btrfs_header header
;
236 struct btrfs_item items
[];
237 } __attribute__ ((__packed__
));
240 * all non-leaf blocks are nodes, they hold only keys and pointers to
243 struct btrfs_key_ptr
{
244 struct btrfs_key key
;
247 } __attribute__ ((__packed__
));
250 struct btrfs_header header
;
251 struct btrfs_key_ptr ptrs
[];
252 } __attribute__ ((__packed__
));
254 union btrfs_tree_node
{
255 struct btrfs_header header
;
256 struct btrfs_leaf leaf
;
257 struct btrfs_node node
;
266 union btrfs_tree_node
*nodes
[BTRFS_MAX_LEVEL
];
267 u32 slots
[BTRFS_MAX_LEVEL
];
276 int btrfs_comp_keys(struct btrfs_key
*, struct btrfs_key
*);
277 int btrfs_comp_keys_type(struct btrfs_key
*, struct btrfs_key
*);
278 int btrfs_bin_search(union btrfs_tree_node
*, struct btrfs_key
*, int *);
279 void btrfs_free_path(struct btrfs_path
*);
280 int btrfs_search_tree(const struct btrfs_root
*, struct btrfs_key
*,
281 struct btrfs_path
*);
282 int btrfs_prev_slot(struct btrfs_path
*);
283 int btrfs_next_slot(struct btrfs_path
*);
285 static inline struct btrfs_key
*btrfs_path_leaf_key(struct btrfs_path
*p
) {
286 return &p
->nodes
[0]->leaf
.items
[p
->slots
[0]].key
;
289 static inline struct btrfs_key
*
290 btrfs_search_tree_key_type(const struct btrfs_root
*root
, u64 objectid
,
291 u8 type
, struct btrfs_path
*path
)
293 struct btrfs_key key
, *res
;
295 key
.objectid
= objectid
;
299 if (btrfs_search_tree(root
, &key
, path
))
302 res
= btrfs_path_leaf_key(path
);
303 if (btrfs_comp_keys_type(&key
, res
)) {
304 btrfs_free_path(path
);
311 static inline u32
btrfs_path_item_size(struct btrfs_path
*p
)
313 return p
->nodes
[0]->leaf
.items
[p
->slots
[0]].size
;
316 static inline void *btrfs_leaf_data(struct btrfs_leaf
*leaf
, u32 slot
)
318 return ((u8
*) leaf
) + sizeof(struct btrfs_header
)
319 + leaf
->items
[slot
].offset
;
322 static inline void *btrfs_path_leaf_data(struct btrfs_path
*p
)
324 return btrfs_leaf_data(&p
->nodes
[0]->leaf
, p
->slots
[0]);
327 #define btrfs_item_ptr(l,s,t) \
328 ((t *) btrfs_leaf_data((l),(s)))
330 #define btrfs_path_item_ptr(p,t) \
331 ((t *) btrfs_path_leaf_data((p)))
333 #endif /* __BTRFS_CTREE_H__ */