| 1 | /* |
| 2 | * Copyright (C) 2007 Oracle. All rights reserved. |
| 3 | * |
| 4 | * This program is free software; you can redistribute it and/or |
| 5 | * modify it under the terms of the GNU General Public |
| 6 | * License v2 as published by the Free Software Foundation. |
| 7 | * |
| 8 | * This program is distributed in the hope that it will be useful, |
| 9 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 10 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 11 | * General Public License for more details. |
| 12 | * |
| 13 | * You should have received a copy of the GNU General Public |
| 14 | * License along with this program; if not, write to the |
| 15 | * Free Software Foundation, Inc., 59 Temple Place - Suite 330, |
| 16 | * Boston, MA 021110-1307, USA. |
| 17 | */ |
| 18 | |
| 19 | #ifndef __BTRFS_CTREE__ |
| 20 | #define __BTRFS_CTREE__ |
| 21 | |
| 22 | #include <linux/mm.h> |
| 23 | #include <linux/highmem.h> |
| 24 | #include <linux/fs.h> |
| 25 | #include <linux/rwsem.h> |
| 26 | #include <linux/completion.h> |
| 27 | #include <linux/backing-dev.h> |
| 28 | #include <linux/wait.h> |
| 29 | #include <linux/slab.h> |
| 30 | #include <linux/kobject.h> |
| 31 | #include <trace/events/btrfs.h> |
| 32 | #include <asm/kmap_types.h> |
| 33 | #include <linux/pagemap.h> |
| 34 | #include "extent_io.h" |
| 35 | #include "extent_map.h" |
| 36 | #include "async-thread.h" |
| 37 | #include "ioctl.h" |
| 38 | |
| 39 | struct btrfs_trans_handle; |
| 40 | struct btrfs_transaction; |
| 41 | struct btrfs_pending_snapshot; |
| 42 | extern struct kmem_cache *btrfs_trans_handle_cachep; |
| 43 | extern struct kmem_cache *btrfs_transaction_cachep; |
| 44 | extern struct kmem_cache *btrfs_bit_radix_cachep; |
| 45 | extern struct kmem_cache *btrfs_path_cachep; |
| 46 | extern struct kmem_cache *btrfs_free_space_cachep; |
| 47 | struct btrfs_ordered_sum; |
| 48 | |
| 49 | #define BTRFS_MAGIC "_BHRfS_M" |
| 50 | |
| 51 | #define BTRFS_MAX_MIRRORS 2 |
| 52 | |
| 53 | #define BTRFS_MAX_LEVEL 8 |
| 54 | |
| 55 | #define BTRFS_COMPAT_EXTENT_TREE_V0 |
| 56 | |
| 57 | /* |
| 58 | * files bigger than this get some pre-flushing when they are added |
| 59 | * to the ordered operations list. That way we limit the total |
| 60 | * work done by the commit |
| 61 | */ |
| 62 | #define BTRFS_ORDERED_OPERATIONS_FLUSH_LIMIT (8 * 1024 * 1024) |
| 63 | |
| 64 | /* holds pointers to all of the tree roots */ |
| 65 | #define BTRFS_ROOT_TREE_OBJECTID 1ULL |
| 66 | |
| 67 | /* stores information about which extents are in use, and reference counts */ |
| 68 | #define BTRFS_EXTENT_TREE_OBJECTID 2ULL |
| 69 | |
| 70 | /* |
| 71 | * chunk tree stores translations from logical -> physical block numbering |
| 72 | * the super block points to the chunk tree |
| 73 | */ |
| 74 | #define BTRFS_CHUNK_TREE_OBJECTID 3ULL |
| 75 | |
| 76 | /* |
| 77 | * stores information about which areas of a given device are in use. |
| 78 | * one per device. The tree of tree roots points to the device tree |
| 79 | */ |
| 80 | #define BTRFS_DEV_TREE_OBJECTID 4ULL |
| 81 | |
| 82 | /* one per subvolume, storing files and directories */ |
| 83 | #define BTRFS_FS_TREE_OBJECTID 5ULL |
| 84 | |
| 85 | /* directory objectid inside the root tree */ |
| 86 | #define BTRFS_ROOT_TREE_DIR_OBJECTID 6ULL |
| 87 | |
| 88 | /* holds checksums of all the data extents */ |
| 89 | #define BTRFS_CSUM_TREE_OBJECTID 7ULL |
| 90 | |
| 91 | /* for storing balance parameters in the root tree */ |
| 92 | #define BTRFS_BALANCE_OBJECTID -4ULL |
| 93 | |
| 94 | /* holds quota configuration and tracking */ |
| 95 | #define BTRFS_QUOTA_TREE_OBJECTID 8ULL |
| 96 | |
| 97 | /* orhpan objectid for tracking unlinked/truncated files */ |
| 98 | #define BTRFS_ORPHAN_OBJECTID -5ULL |
| 99 | |
| 100 | /* does write ahead logging to speed up fsyncs */ |
| 101 | #define BTRFS_TREE_LOG_OBJECTID -6ULL |
| 102 | #define BTRFS_TREE_LOG_FIXUP_OBJECTID -7ULL |
| 103 | |
| 104 | /* for space balancing */ |
| 105 | #define BTRFS_TREE_RELOC_OBJECTID -8ULL |
| 106 | #define BTRFS_DATA_RELOC_TREE_OBJECTID -9ULL |
| 107 | |
| 108 | /* |
| 109 | * extent checksums all have this objectid |
| 110 | * this allows them to share the logging tree |
| 111 | * for fsyncs |
| 112 | */ |
| 113 | #define BTRFS_EXTENT_CSUM_OBJECTID -10ULL |
| 114 | |
| 115 | /* For storing free space cache */ |
| 116 | #define BTRFS_FREE_SPACE_OBJECTID -11ULL |
| 117 | |
| 118 | /* |
| 119 | * The inode number assigned to the special inode for sotring |
| 120 | * free ino cache |
| 121 | */ |
| 122 | #define BTRFS_FREE_INO_OBJECTID -12ULL |
| 123 | |
| 124 | /* dummy objectid represents multiple objectids */ |
| 125 | #define BTRFS_MULTIPLE_OBJECTIDS -255ULL |
| 126 | |
| 127 | /* |
| 128 | * All files have objectids in this range. |
| 129 | */ |
| 130 | #define BTRFS_FIRST_FREE_OBJECTID 256ULL |
| 131 | #define BTRFS_LAST_FREE_OBJECTID -256ULL |
| 132 | #define BTRFS_FIRST_CHUNK_TREE_OBJECTID 256ULL |
| 133 | |
| 134 | |
| 135 | /* |
| 136 | * the device items go into the chunk tree. The key is in the form |
| 137 | * [ 1 BTRFS_DEV_ITEM_KEY device_id ] |
| 138 | */ |
| 139 | #define BTRFS_DEV_ITEMS_OBJECTID 1ULL |
| 140 | |
| 141 | #define BTRFS_BTREE_INODE_OBJECTID 1 |
| 142 | |
| 143 | #define BTRFS_EMPTY_SUBVOL_DIR_OBJECTID 2 |
| 144 | |
| 145 | /* |
| 146 | * the max metadata block size. This limit is somewhat artificial, |
| 147 | * but the memmove costs go through the roof for larger blocks. |
| 148 | */ |
| 149 | #define BTRFS_MAX_METADATA_BLOCKSIZE 65536 |
| 150 | |
| 151 | /* |
| 152 | * we can actually store much bigger names, but lets not confuse the rest |
| 153 | * of linux |
| 154 | */ |
| 155 | #define BTRFS_NAME_LEN 255 |
| 156 | |
| 157 | /* 32 bytes in various csum fields */ |
| 158 | #define BTRFS_CSUM_SIZE 32 |
| 159 | |
| 160 | /* csum types */ |
| 161 | #define BTRFS_CSUM_TYPE_CRC32 0 |
| 162 | |
| 163 | static int btrfs_csum_sizes[] = { 4, 0 }; |
| 164 | |
| 165 | /* four bytes for CRC32 */ |
| 166 | #define BTRFS_EMPTY_DIR_SIZE 0 |
| 167 | |
| 168 | #define BTRFS_FT_UNKNOWN 0 |
| 169 | #define BTRFS_FT_REG_FILE 1 |
| 170 | #define BTRFS_FT_DIR 2 |
| 171 | #define BTRFS_FT_CHRDEV 3 |
| 172 | #define BTRFS_FT_BLKDEV 4 |
| 173 | #define BTRFS_FT_FIFO 5 |
| 174 | #define BTRFS_FT_SOCK 6 |
| 175 | #define BTRFS_FT_SYMLINK 7 |
| 176 | #define BTRFS_FT_XATTR 8 |
| 177 | #define BTRFS_FT_MAX 9 |
| 178 | |
| 179 | /* ioprio of readahead is set to idle */ |
| 180 | #define BTRFS_IOPRIO_READA (IOPRIO_PRIO_VALUE(IOPRIO_CLASS_IDLE, 0)) |
| 181 | |
| 182 | /* |
| 183 | * The key defines the order in the tree, and so it also defines (optimal) |
| 184 | * block layout. |
| 185 | * |
| 186 | * objectid corresponds to the inode number. |
| 187 | * |
| 188 | * type tells us things about the object, and is a kind of stream selector. |
| 189 | * so for a given inode, keys with type of 1 might refer to the inode data, |
| 190 | * type of 2 may point to file data in the btree and type == 3 may point to |
| 191 | * extents. |
| 192 | * |
| 193 | * offset is the starting byte offset for this key in the stream. |
| 194 | * |
| 195 | * btrfs_disk_key is in disk byte order. struct btrfs_key is always |
| 196 | * in cpu native order. Otherwise they are identical and their sizes |
| 197 | * should be the same (ie both packed) |
| 198 | */ |
| 199 | struct btrfs_disk_key { |
| 200 | __le64 objectid; |
| 201 | u8 type; |
| 202 | __le64 offset; |
| 203 | } __attribute__ ((__packed__)); |
| 204 | |
| 205 | struct btrfs_key { |
| 206 | u64 objectid; |
| 207 | u8 type; |
| 208 | u64 offset; |
| 209 | } __attribute__ ((__packed__)); |
| 210 | |
| 211 | struct btrfs_mapping_tree { |
| 212 | struct extent_map_tree map_tree; |
| 213 | }; |
| 214 | |
| 215 | struct btrfs_dev_item { |
| 216 | /* the internal btrfs device id */ |
| 217 | __le64 devid; |
| 218 | |
| 219 | /* size of the device */ |
| 220 | __le64 total_bytes; |
| 221 | |
| 222 | /* bytes used */ |
| 223 | __le64 bytes_used; |
| 224 | |
| 225 | /* optimal io alignment for this device */ |
| 226 | __le32 io_align; |
| 227 | |
| 228 | /* optimal io width for this device */ |
| 229 | __le32 io_width; |
| 230 | |
| 231 | /* minimal io size for this device */ |
| 232 | __le32 sector_size; |
| 233 | |
| 234 | /* type and info about this device */ |
| 235 | __le64 type; |
| 236 | |
| 237 | /* expected generation for this device */ |
| 238 | __le64 generation; |
| 239 | |
| 240 | /* |
| 241 | * starting byte of this partition on the device, |
| 242 | * to allow for stripe alignment in the future |
| 243 | */ |
| 244 | __le64 start_offset; |
| 245 | |
| 246 | /* grouping information for allocation decisions */ |
| 247 | __le32 dev_group; |
| 248 | |
| 249 | /* seek speed 0-100 where 100 is fastest */ |
| 250 | u8 seek_speed; |
| 251 | |
| 252 | /* bandwidth 0-100 where 100 is fastest */ |
| 253 | u8 bandwidth; |
| 254 | |
| 255 | /* btrfs generated uuid for this device */ |
| 256 | u8 uuid[BTRFS_UUID_SIZE]; |
| 257 | |
| 258 | /* uuid of FS who owns this device */ |
| 259 | u8 fsid[BTRFS_UUID_SIZE]; |
| 260 | } __attribute__ ((__packed__)); |
| 261 | |
| 262 | struct btrfs_stripe { |
| 263 | __le64 devid; |
| 264 | __le64 offset; |
| 265 | u8 dev_uuid[BTRFS_UUID_SIZE]; |
| 266 | } __attribute__ ((__packed__)); |
| 267 | |
| 268 | struct btrfs_chunk { |
| 269 | /* size of this chunk in bytes */ |
| 270 | __le64 length; |
| 271 | |
| 272 | /* objectid of the root referencing this chunk */ |
| 273 | __le64 owner; |
| 274 | |
| 275 | __le64 stripe_len; |
| 276 | __le64 type; |
| 277 | |
| 278 | /* optimal io alignment for this chunk */ |
| 279 | __le32 io_align; |
| 280 | |
| 281 | /* optimal io width for this chunk */ |
| 282 | __le32 io_width; |
| 283 | |
| 284 | /* minimal io size for this chunk */ |
| 285 | __le32 sector_size; |
| 286 | |
| 287 | /* 2^16 stripes is quite a lot, a second limit is the size of a single |
| 288 | * item in the btree |
| 289 | */ |
| 290 | __le16 num_stripes; |
| 291 | |
| 292 | /* sub stripes only matter for raid10 */ |
| 293 | __le16 sub_stripes; |
| 294 | struct btrfs_stripe stripe; |
| 295 | /* additional stripes go here */ |
| 296 | } __attribute__ ((__packed__)); |
| 297 | |
| 298 | #define BTRFS_FREE_SPACE_EXTENT 1 |
| 299 | #define BTRFS_FREE_SPACE_BITMAP 2 |
| 300 | |
| 301 | struct btrfs_free_space_entry { |
| 302 | __le64 offset; |
| 303 | __le64 bytes; |
| 304 | u8 type; |
| 305 | } __attribute__ ((__packed__)); |
| 306 | |
| 307 | struct btrfs_free_space_header { |
| 308 | struct btrfs_disk_key location; |
| 309 | __le64 generation; |
| 310 | __le64 num_entries; |
| 311 | __le64 num_bitmaps; |
| 312 | } __attribute__ ((__packed__)); |
| 313 | |
| 314 | static inline unsigned long btrfs_chunk_item_size(int num_stripes) |
| 315 | { |
| 316 | BUG_ON(num_stripes == 0); |
| 317 | return sizeof(struct btrfs_chunk) + |
| 318 | sizeof(struct btrfs_stripe) * (num_stripes - 1); |
| 319 | } |
| 320 | |
| 321 | #define BTRFS_HEADER_FLAG_WRITTEN (1ULL << 0) |
| 322 | #define BTRFS_HEADER_FLAG_RELOC (1ULL << 1) |
| 323 | |
| 324 | /* |
| 325 | * File system states |
| 326 | */ |
| 327 | |
| 328 | /* Errors detected */ |
| 329 | #define BTRFS_SUPER_FLAG_ERROR (1ULL << 2) |
| 330 | |
| 331 | #define BTRFS_SUPER_FLAG_SEEDING (1ULL << 32) |
| 332 | #define BTRFS_SUPER_FLAG_METADUMP (1ULL << 33) |
| 333 | |
| 334 | #define BTRFS_BACKREF_REV_MAX 256 |
| 335 | #define BTRFS_BACKREF_REV_SHIFT 56 |
| 336 | #define BTRFS_BACKREF_REV_MASK (((u64)BTRFS_BACKREF_REV_MAX - 1) << \ |
| 337 | BTRFS_BACKREF_REV_SHIFT) |
| 338 | |
| 339 | #define BTRFS_OLD_BACKREF_REV 0 |
| 340 | #define BTRFS_MIXED_BACKREF_REV 1 |
| 341 | |
| 342 | /* |
| 343 | * every tree block (leaf or node) starts with this header. |
| 344 | */ |
| 345 | struct btrfs_header { |
| 346 | /* these first four must match the super block */ |
| 347 | u8 csum[BTRFS_CSUM_SIZE]; |
| 348 | u8 fsid[BTRFS_FSID_SIZE]; /* FS specific uuid */ |
| 349 | __le64 bytenr; /* which block this node is supposed to live in */ |
| 350 | __le64 flags; |
| 351 | |
| 352 | /* allowed to be different from the super from here on down */ |
| 353 | u8 chunk_tree_uuid[BTRFS_UUID_SIZE]; |
| 354 | __le64 generation; |
| 355 | __le64 owner; |
| 356 | __le32 nritems; |
| 357 | u8 level; |
| 358 | } __attribute__ ((__packed__)); |
| 359 | |
| 360 | #define BTRFS_NODEPTRS_PER_BLOCK(r) (((r)->nodesize - \ |
| 361 | sizeof(struct btrfs_header)) / \ |
| 362 | sizeof(struct btrfs_key_ptr)) |
| 363 | #define __BTRFS_LEAF_DATA_SIZE(bs) ((bs) - sizeof(struct btrfs_header)) |
| 364 | #define BTRFS_LEAF_DATA_SIZE(r) (__BTRFS_LEAF_DATA_SIZE(r->leafsize)) |
| 365 | #define BTRFS_MAX_INLINE_DATA_SIZE(r) (BTRFS_LEAF_DATA_SIZE(r) - \ |
| 366 | sizeof(struct btrfs_item) - \ |
| 367 | sizeof(struct btrfs_file_extent_item)) |
| 368 | #define BTRFS_MAX_XATTR_SIZE(r) (BTRFS_LEAF_DATA_SIZE(r) - \ |
| 369 | sizeof(struct btrfs_item) -\ |
| 370 | sizeof(struct btrfs_dir_item)) |
| 371 | |
| 372 | |
| 373 | /* |
| 374 | * this is a very generous portion of the super block, giving us |
| 375 | * room to translate 14 chunks with 3 stripes each. |
| 376 | */ |
| 377 | #define BTRFS_SYSTEM_CHUNK_ARRAY_SIZE 2048 |
| 378 | #define BTRFS_LABEL_SIZE 256 |
| 379 | |
| 380 | /* |
| 381 | * just in case we somehow lose the roots and are not able to mount, |
| 382 | * we store an array of the roots from previous transactions |
| 383 | * in the super. |
| 384 | */ |
| 385 | #define BTRFS_NUM_BACKUP_ROOTS 4 |
| 386 | struct btrfs_root_backup { |
| 387 | __le64 tree_root; |
| 388 | __le64 tree_root_gen; |
| 389 | |
| 390 | __le64 chunk_root; |
| 391 | __le64 chunk_root_gen; |
| 392 | |
| 393 | __le64 extent_root; |
| 394 | __le64 extent_root_gen; |
| 395 | |
| 396 | __le64 fs_root; |
| 397 | __le64 fs_root_gen; |
| 398 | |
| 399 | __le64 dev_root; |
| 400 | __le64 dev_root_gen; |
| 401 | |
| 402 | __le64 csum_root; |
| 403 | __le64 csum_root_gen; |
| 404 | |
| 405 | __le64 total_bytes; |
| 406 | __le64 bytes_used; |
| 407 | __le64 num_devices; |
| 408 | /* future */ |
| 409 | __le64 unsed_64[4]; |
| 410 | |
| 411 | u8 tree_root_level; |
| 412 | u8 chunk_root_level; |
| 413 | u8 extent_root_level; |
| 414 | u8 fs_root_level; |
| 415 | u8 dev_root_level; |
| 416 | u8 csum_root_level; |
| 417 | /* future and to align */ |
| 418 | u8 unused_8[10]; |
| 419 | } __attribute__ ((__packed__)); |
| 420 | |
| 421 | /* |
| 422 | * the super block basically lists the main trees of the FS |
| 423 | * it currently lacks any block count etc etc |
| 424 | */ |
| 425 | struct btrfs_super_block { |
| 426 | u8 csum[BTRFS_CSUM_SIZE]; |
| 427 | /* the first 4 fields must match struct btrfs_header */ |
| 428 | u8 fsid[BTRFS_FSID_SIZE]; /* FS specific uuid */ |
| 429 | __le64 bytenr; /* this block number */ |
| 430 | __le64 flags; |
| 431 | |
| 432 | /* allowed to be different from the btrfs_header from here own down */ |
| 433 | __le64 magic; |
| 434 | __le64 generation; |
| 435 | __le64 root; |
| 436 | __le64 chunk_root; |
| 437 | __le64 log_root; |
| 438 | |
| 439 | /* this will help find the new super based on the log root */ |
| 440 | __le64 log_root_transid; |
| 441 | __le64 total_bytes; |
| 442 | __le64 bytes_used; |
| 443 | __le64 root_dir_objectid; |
| 444 | __le64 num_devices; |
| 445 | __le32 sectorsize; |
| 446 | __le32 nodesize; |
| 447 | __le32 leafsize; |
| 448 | __le32 stripesize; |
| 449 | __le32 sys_chunk_array_size; |
| 450 | __le64 chunk_root_generation; |
| 451 | __le64 compat_flags; |
| 452 | __le64 compat_ro_flags; |
| 453 | __le64 incompat_flags; |
| 454 | __le16 csum_type; |
| 455 | u8 root_level; |
| 456 | u8 chunk_root_level; |
| 457 | u8 log_root_level; |
| 458 | struct btrfs_dev_item dev_item; |
| 459 | |
| 460 | char label[BTRFS_LABEL_SIZE]; |
| 461 | |
| 462 | __le64 cache_generation; |
| 463 | |
| 464 | /* future expansion */ |
| 465 | __le64 reserved[31]; |
| 466 | u8 sys_chunk_array[BTRFS_SYSTEM_CHUNK_ARRAY_SIZE]; |
| 467 | struct btrfs_root_backup super_roots[BTRFS_NUM_BACKUP_ROOTS]; |
| 468 | } __attribute__ ((__packed__)); |
| 469 | |
| 470 | /* |
| 471 | * Compat flags that we support. If any incompat flags are set other than the |
| 472 | * ones specified below then we will fail to mount |
| 473 | */ |
| 474 | #define BTRFS_FEATURE_INCOMPAT_MIXED_BACKREF (1ULL << 0) |
| 475 | #define BTRFS_FEATURE_INCOMPAT_DEFAULT_SUBVOL (1ULL << 1) |
| 476 | #define BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS (1ULL << 2) |
| 477 | #define BTRFS_FEATURE_INCOMPAT_COMPRESS_LZO (1ULL << 3) |
| 478 | /* |
| 479 | * some patches floated around with a second compression method |
| 480 | * lets save that incompat here for when they do get in |
| 481 | * Note we don't actually support it, we're just reserving the |
| 482 | * number |
| 483 | */ |
| 484 | #define BTRFS_FEATURE_INCOMPAT_COMPRESS_LZOv2 (1ULL << 4) |
| 485 | |
| 486 | /* |
| 487 | * older kernels tried to do bigger metadata blocks, but the |
| 488 | * code was pretty buggy. Lets not let them try anymore. |
| 489 | */ |
| 490 | #define BTRFS_FEATURE_INCOMPAT_BIG_METADATA (1ULL << 5) |
| 491 | |
| 492 | #define BTRFS_FEATURE_COMPAT_SUPP 0ULL |
| 493 | #define BTRFS_FEATURE_COMPAT_RO_SUPP 0ULL |
| 494 | #define BTRFS_FEATURE_INCOMPAT_SUPP \ |
| 495 | (BTRFS_FEATURE_INCOMPAT_MIXED_BACKREF | \ |
| 496 | BTRFS_FEATURE_INCOMPAT_DEFAULT_SUBVOL | \ |
| 497 | BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS | \ |
| 498 | BTRFS_FEATURE_INCOMPAT_BIG_METADATA | \ |
| 499 | BTRFS_FEATURE_INCOMPAT_COMPRESS_LZO) |
| 500 | |
| 501 | /* |
| 502 | * A leaf is full of items. offset and size tell us where to find |
| 503 | * the item in the leaf (relative to the start of the data area) |
| 504 | */ |
| 505 | struct btrfs_item { |
| 506 | struct btrfs_disk_key key; |
| 507 | __le32 offset; |
| 508 | __le32 size; |
| 509 | } __attribute__ ((__packed__)); |
| 510 | |
| 511 | /* |
| 512 | * leaves have an item area and a data area: |
| 513 | * [item0, item1....itemN] [free space] [dataN...data1, data0] |
| 514 | * |
| 515 | * The data is separate from the items to get the keys closer together |
| 516 | * during searches. |
| 517 | */ |
| 518 | struct btrfs_leaf { |
| 519 | struct btrfs_header header; |
| 520 | struct btrfs_item items[]; |
| 521 | } __attribute__ ((__packed__)); |
| 522 | |
| 523 | /* |
| 524 | * all non-leaf blocks are nodes, they hold only keys and pointers to |
| 525 | * other blocks |
| 526 | */ |
| 527 | struct btrfs_key_ptr { |
| 528 | struct btrfs_disk_key key; |
| 529 | __le64 blockptr; |
| 530 | __le64 generation; |
| 531 | } __attribute__ ((__packed__)); |
| 532 | |
| 533 | struct btrfs_node { |
| 534 | struct btrfs_header header; |
| 535 | struct btrfs_key_ptr ptrs[]; |
| 536 | } __attribute__ ((__packed__)); |
| 537 | |
| 538 | /* |
| 539 | * btrfs_paths remember the path taken from the root down to the leaf. |
| 540 | * level 0 is always the leaf, and nodes[1...BTRFS_MAX_LEVEL] will point |
| 541 | * to any other levels that are present. |
| 542 | * |
| 543 | * The slots array records the index of the item or block pointer |
| 544 | * used while walking the tree. |
| 545 | */ |
| 546 | struct btrfs_path { |
| 547 | struct extent_buffer *nodes[BTRFS_MAX_LEVEL]; |
| 548 | int slots[BTRFS_MAX_LEVEL]; |
| 549 | /* if there is real range locking, this locks field will change */ |
| 550 | int locks[BTRFS_MAX_LEVEL]; |
| 551 | int reada; |
| 552 | /* keep some upper locks as we walk down */ |
| 553 | int lowest_level; |
| 554 | |
| 555 | /* |
| 556 | * set by btrfs_split_item, tells search_slot to keep all locks |
| 557 | * and to force calls to keep space in the nodes |
| 558 | */ |
| 559 | unsigned int search_for_split:1; |
| 560 | unsigned int keep_locks:1; |
| 561 | unsigned int skip_locking:1; |
| 562 | unsigned int leave_spinning:1; |
| 563 | unsigned int search_commit_root:1; |
| 564 | }; |
| 565 | |
| 566 | /* |
| 567 | * items in the extent btree are used to record the objectid of the |
| 568 | * owner of the block and the number of references |
| 569 | */ |
| 570 | |
| 571 | struct btrfs_extent_item { |
| 572 | __le64 refs; |
| 573 | __le64 generation; |
| 574 | __le64 flags; |
| 575 | } __attribute__ ((__packed__)); |
| 576 | |
| 577 | struct btrfs_extent_item_v0 { |
| 578 | __le32 refs; |
| 579 | } __attribute__ ((__packed__)); |
| 580 | |
| 581 | #define BTRFS_MAX_EXTENT_ITEM_SIZE(r) ((BTRFS_LEAF_DATA_SIZE(r) >> 4) - \ |
| 582 | sizeof(struct btrfs_item)) |
| 583 | |
| 584 | #define BTRFS_EXTENT_FLAG_DATA (1ULL << 0) |
| 585 | #define BTRFS_EXTENT_FLAG_TREE_BLOCK (1ULL << 1) |
| 586 | |
| 587 | /* following flags only apply to tree blocks */ |
| 588 | |
| 589 | /* use full backrefs for extent pointers in the block */ |
| 590 | #define BTRFS_BLOCK_FLAG_FULL_BACKREF (1ULL << 8) |
| 591 | |
| 592 | /* |
| 593 | * this flag is only used internally by scrub and may be changed at any time |
| 594 | * it is only declared here to avoid collisions |
| 595 | */ |
| 596 | #define BTRFS_EXTENT_FLAG_SUPER (1ULL << 48) |
| 597 | |
| 598 | struct btrfs_tree_block_info { |
| 599 | struct btrfs_disk_key key; |
| 600 | u8 level; |
| 601 | } __attribute__ ((__packed__)); |
| 602 | |
| 603 | struct btrfs_extent_data_ref { |
| 604 | __le64 root; |
| 605 | __le64 objectid; |
| 606 | __le64 offset; |
| 607 | __le32 count; |
| 608 | } __attribute__ ((__packed__)); |
| 609 | |
| 610 | struct btrfs_shared_data_ref { |
| 611 | __le32 count; |
| 612 | } __attribute__ ((__packed__)); |
| 613 | |
| 614 | struct btrfs_extent_inline_ref { |
| 615 | u8 type; |
| 616 | __le64 offset; |
| 617 | } __attribute__ ((__packed__)); |
| 618 | |
| 619 | /* old style backrefs item */ |
| 620 | struct btrfs_extent_ref_v0 { |
| 621 | __le64 root; |
| 622 | __le64 generation; |
| 623 | __le64 objectid; |
| 624 | __le32 count; |
| 625 | } __attribute__ ((__packed__)); |
| 626 | |
| 627 | |
| 628 | /* dev extents record free space on individual devices. The owner |
| 629 | * field points back to the chunk allocation mapping tree that allocated |
| 630 | * the extent. The chunk tree uuid field is a way to double check the owner |
| 631 | */ |
| 632 | struct btrfs_dev_extent { |
| 633 | __le64 chunk_tree; |
| 634 | __le64 chunk_objectid; |
| 635 | __le64 chunk_offset; |
| 636 | __le64 length; |
| 637 | u8 chunk_tree_uuid[BTRFS_UUID_SIZE]; |
| 638 | } __attribute__ ((__packed__)); |
| 639 | |
| 640 | struct btrfs_inode_ref { |
| 641 | __le64 index; |
| 642 | __le16 name_len; |
| 643 | /* name goes here */ |
| 644 | } __attribute__ ((__packed__)); |
| 645 | |
| 646 | struct btrfs_timespec { |
| 647 | __le64 sec; |
| 648 | __le32 nsec; |
| 649 | } __attribute__ ((__packed__)); |
| 650 | |
| 651 | enum btrfs_compression_type { |
| 652 | BTRFS_COMPRESS_NONE = 0, |
| 653 | BTRFS_COMPRESS_ZLIB = 1, |
| 654 | BTRFS_COMPRESS_LZO = 2, |
| 655 | BTRFS_COMPRESS_TYPES = 2, |
| 656 | BTRFS_COMPRESS_LAST = 3, |
| 657 | }; |
| 658 | |
| 659 | struct btrfs_inode_item { |
| 660 | /* nfs style generation number */ |
| 661 | __le64 generation; |
| 662 | /* transid that last touched this inode */ |
| 663 | __le64 transid; |
| 664 | __le64 size; |
| 665 | __le64 nbytes; |
| 666 | __le64 block_group; |
| 667 | __le32 nlink; |
| 668 | __le32 uid; |
| 669 | __le32 gid; |
| 670 | __le32 mode; |
| 671 | __le64 rdev; |
| 672 | __le64 flags; |
| 673 | |
| 674 | /* modification sequence number for NFS */ |
| 675 | __le64 sequence; |
| 676 | |
| 677 | /* |
| 678 | * a little future expansion, for more than this we can |
| 679 | * just grow the inode item and version it |
| 680 | */ |
| 681 | __le64 reserved[4]; |
| 682 | struct btrfs_timespec atime; |
| 683 | struct btrfs_timespec ctime; |
| 684 | struct btrfs_timespec mtime; |
| 685 | struct btrfs_timespec otime; |
| 686 | } __attribute__ ((__packed__)); |
| 687 | |
| 688 | struct btrfs_dir_log_item { |
| 689 | __le64 end; |
| 690 | } __attribute__ ((__packed__)); |
| 691 | |
| 692 | struct btrfs_dir_item { |
| 693 | struct btrfs_disk_key location; |
| 694 | __le64 transid; |
| 695 | __le16 data_len; |
| 696 | __le16 name_len; |
| 697 | u8 type; |
| 698 | } __attribute__ ((__packed__)); |
| 699 | |
| 700 | #define BTRFS_ROOT_SUBVOL_RDONLY (1ULL << 0) |
| 701 | |
| 702 | struct btrfs_root_item { |
| 703 | struct btrfs_inode_item inode; |
| 704 | __le64 generation; |
| 705 | __le64 root_dirid; |
| 706 | __le64 bytenr; |
| 707 | __le64 byte_limit; |
| 708 | __le64 bytes_used; |
| 709 | __le64 last_snapshot; |
| 710 | __le64 flags; |
| 711 | __le32 refs; |
| 712 | struct btrfs_disk_key drop_progress; |
| 713 | u8 drop_level; |
| 714 | u8 level; |
| 715 | |
| 716 | /* |
| 717 | * The following fields appear after subvol_uuids+subvol_times |
| 718 | * were introduced. |
| 719 | */ |
| 720 | |
| 721 | /* |
| 722 | * This generation number is used to test if the new fields are valid |
| 723 | * and up to date while reading the root item. Everytime the root item |
| 724 | * is written out, the "generation" field is copied into this field. If |
| 725 | * anyone ever mounted the fs with an older kernel, we will have |
| 726 | * mismatching generation values here and thus must invalidate the |
| 727 | * new fields. See btrfs_update_root and btrfs_find_last_root for |
| 728 | * details. |
| 729 | * the offset of generation_v2 is also used as the start for the memset |
| 730 | * when invalidating the fields. |
| 731 | */ |
| 732 | __le64 generation_v2; |
| 733 | u8 uuid[BTRFS_UUID_SIZE]; |
| 734 | u8 parent_uuid[BTRFS_UUID_SIZE]; |
| 735 | u8 received_uuid[BTRFS_UUID_SIZE]; |
| 736 | __le64 ctransid; /* updated when an inode changes */ |
| 737 | __le64 otransid; /* trans when created */ |
| 738 | __le64 stransid; /* trans when sent. non-zero for received subvol */ |
| 739 | __le64 rtransid; /* trans when received. non-zero for received subvol */ |
| 740 | struct btrfs_timespec ctime; |
| 741 | struct btrfs_timespec otime; |
| 742 | struct btrfs_timespec stime; |
| 743 | struct btrfs_timespec rtime; |
| 744 | __le64 reserved[8]; /* for future */ |
| 745 | } __attribute__ ((__packed__)); |
| 746 | |
| 747 | /* |
| 748 | * this is used for both forward and backward root refs |
| 749 | */ |
| 750 | struct btrfs_root_ref { |
| 751 | __le64 dirid; |
| 752 | __le64 sequence; |
| 753 | __le16 name_len; |
| 754 | } __attribute__ ((__packed__)); |
| 755 | |
| 756 | struct btrfs_disk_balance_args { |
| 757 | /* |
| 758 | * profiles to operate on, single is denoted by |
| 759 | * BTRFS_AVAIL_ALLOC_BIT_SINGLE |
| 760 | */ |
| 761 | __le64 profiles; |
| 762 | |
| 763 | /* usage filter */ |
| 764 | __le64 usage; |
| 765 | |
| 766 | /* devid filter */ |
| 767 | __le64 devid; |
| 768 | |
| 769 | /* devid subset filter [pstart..pend) */ |
| 770 | __le64 pstart; |
| 771 | __le64 pend; |
| 772 | |
| 773 | /* btrfs virtual address space subset filter [vstart..vend) */ |
| 774 | __le64 vstart; |
| 775 | __le64 vend; |
| 776 | |
| 777 | /* |
| 778 | * profile to convert to, single is denoted by |
| 779 | * BTRFS_AVAIL_ALLOC_BIT_SINGLE |
| 780 | */ |
| 781 | __le64 target; |
| 782 | |
| 783 | /* BTRFS_BALANCE_ARGS_* */ |
| 784 | __le64 flags; |
| 785 | |
| 786 | __le64 unused[8]; |
| 787 | } __attribute__ ((__packed__)); |
| 788 | |
| 789 | /* |
| 790 | * store balance parameters to disk so that balance can be properly |
| 791 | * resumed after crash or unmount |
| 792 | */ |
| 793 | struct btrfs_balance_item { |
| 794 | /* BTRFS_BALANCE_* */ |
| 795 | __le64 flags; |
| 796 | |
| 797 | struct btrfs_disk_balance_args data; |
| 798 | struct btrfs_disk_balance_args meta; |
| 799 | struct btrfs_disk_balance_args sys; |
| 800 | |
| 801 | __le64 unused[4]; |
| 802 | } __attribute__ ((__packed__)); |
| 803 | |
| 804 | #define BTRFS_FILE_EXTENT_INLINE 0 |
| 805 | #define BTRFS_FILE_EXTENT_REG 1 |
| 806 | #define BTRFS_FILE_EXTENT_PREALLOC 2 |
| 807 | |
| 808 | struct btrfs_file_extent_item { |
| 809 | /* |
| 810 | * transaction id that created this extent |
| 811 | */ |
| 812 | __le64 generation; |
| 813 | /* |
| 814 | * max number of bytes to hold this extent in ram |
| 815 | * when we split a compressed extent we can't know how big |
| 816 | * each of the resulting pieces will be. So, this is |
| 817 | * an upper limit on the size of the extent in ram instead of |
| 818 | * an exact limit. |
| 819 | */ |
| 820 | __le64 ram_bytes; |
| 821 | |
| 822 | /* |
| 823 | * 32 bits for the various ways we might encode the data, |
| 824 | * including compression and encryption. If any of these |
| 825 | * are set to something a given disk format doesn't understand |
| 826 | * it is treated like an incompat flag for reading and writing, |
| 827 | * but not for stat. |
| 828 | */ |
| 829 | u8 compression; |
| 830 | u8 encryption; |
| 831 | __le16 other_encoding; /* spare for later use */ |
| 832 | |
| 833 | /* are we inline data or a real extent? */ |
| 834 | u8 type; |
| 835 | |
| 836 | /* |
| 837 | * disk space consumed by the extent, checksum blocks are included |
| 838 | * in these numbers |
| 839 | */ |
| 840 | __le64 disk_bytenr; |
| 841 | __le64 disk_num_bytes; |
| 842 | /* |
| 843 | * the logical offset in file blocks (no csums) |
| 844 | * this extent record is for. This allows a file extent to point |
| 845 | * into the middle of an existing extent on disk, sharing it |
| 846 | * between two snapshots (useful if some bytes in the middle of the |
| 847 | * extent have changed |
| 848 | */ |
| 849 | __le64 offset; |
| 850 | /* |
| 851 | * the logical number of file blocks (no csums included). This |
| 852 | * always reflects the size uncompressed and without encoding. |
| 853 | */ |
| 854 | __le64 num_bytes; |
| 855 | |
| 856 | } __attribute__ ((__packed__)); |
| 857 | |
| 858 | struct btrfs_csum_item { |
| 859 | u8 csum; |
| 860 | } __attribute__ ((__packed__)); |
| 861 | |
| 862 | struct btrfs_dev_stats_item { |
| 863 | /* |
| 864 | * grow this item struct at the end for future enhancements and keep |
| 865 | * the existing values unchanged |
| 866 | */ |
| 867 | __le64 values[BTRFS_DEV_STAT_VALUES_MAX]; |
| 868 | } __attribute__ ((__packed__)); |
| 869 | |
| 870 | /* different types of block groups (and chunks) */ |
| 871 | #define BTRFS_BLOCK_GROUP_DATA (1ULL << 0) |
| 872 | #define BTRFS_BLOCK_GROUP_SYSTEM (1ULL << 1) |
| 873 | #define BTRFS_BLOCK_GROUP_METADATA (1ULL << 2) |
| 874 | #define BTRFS_BLOCK_GROUP_RAID0 (1ULL << 3) |
| 875 | #define BTRFS_BLOCK_GROUP_RAID1 (1ULL << 4) |
| 876 | #define BTRFS_BLOCK_GROUP_DUP (1ULL << 5) |
| 877 | #define BTRFS_BLOCK_GROUP_RAID10 (1ULL << 6) |
| 878 | #define BTRFS_BLOCK_GROUP_RESERVED BTRFS_AVAIL_ALLOC_BIT_SINGLE |
| 879 | #define BTRFS_NR_RAID_TYPES 5 |
| 880 | |
| 881 | #define BTRFS_BLOCK_GROUP_TYPE_MASK (BTRFS_BLOCK_GROUP_DATA | \ |
| 882 | BTRFS_BLOCK_GROUP_SYSTEM | \ |
| 883 | BTRFS_BLOCK_GROUP_METADATA) |
| 884 | |
| 885 | #define BTRFS_BLOCK_GROUP_PROFILE_MASK (BTRFS_BLOCK_GROUP_RAID0 | \ |
| 886 | BTRFS_BLOCK_GROUP_RAID1 | \ |
| 887 | BTRFS_BLOCK_GROUP_DUP | \ |
| 888 | BTRFS_BLOCK_GROUP_RAID10) |
| 889 | /* |
| 890 | * We need a bit for restriper to be able to tell when chunks of type |
| 891 | * SINGLE are available. This "extended" profile format is used in |
| 892 | * fs_info->avail_*_alloc_bits (in-memory) and balance item fields |
| 893 | * (on-disk). The corresponding on-disk bit in chunk.type is reserved |
| 894 | * to avoid remappings between two formats in future. |
| 895 | */ |
| 896 | #define BTRFS_AVAIL_ALLOC_BIT_SINGLE (1ULL << 48) |
| 897 | |
| 898 | #define BTRFS_EXTENDED_PROFILE_MASK (BTRFS_BLOCK_GROUP_PROFILE_MASK | \ |
| 899 | BTRFS_AVAIL_ALLOC_BIT_SINGLE) |
| 900 | |
| 901 | static inline u64 chunk_to_extended(u64 flags) |
| 902 | { |
| 903 | if ((flags & BTRFS_BLOCK_GROUP_PROFILE_MASK) == 0) |
| 904 | flags |= BTRFS_AVAIL_ALLOC_BIT_SINGLE; |
| 905 | |
| 906 | return flags; |
| 907 | } |
| 908 | static inline u64 extended_to_chunk(u64 flags) |
| 909 | { |
| 910 | return flags & ~BTRFS_AVAIL_ALLOC_BIT_SINGLE; |
| 911 | } |
| 912 | |
| 913 | struct btrfs_block_group_item { |
| 914 | __le64 used; |
| 915 | __le64 chunk_objectid; |
| 916 | __le64 flags; |
| 917 | } __attribute__ ((__packed__)); |
| 918 | |
| 919 | /* |
| 920 | * is subvolume quota turned on? |
| 921 | */ |
| 922 | #define BTRFS_QGROUP_STATUS_FLAG_ON (1ULL << 0) |
| 923 | /* |
| 924 | * SCANNING is set during the initialization phase |
| 925 | */ |
| 926 | #define BTRFS_QGROUP_STATUS_FLAG_SCANNING (1ULL << 1) |
| 927 | /* |
| 928 | * Some qgroup entries are known to be out of date, |
| 929 | * either because the configuration has changed in a way that |
| 930 | * makes a rescan necessary, or because the fs has been mounted |
| 931 | * with a non-qgroup-aware version. |
| 932 | * Turning qouta off and on again makes it inconsistent, too. |
| 933 | */ |
| 934 | #define BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT (1ULL << 2) |
| 935 | |
| 936 | #define BTRFS_QGROUP_STATUS_VERSION 1 |
| 937 | |
| 938 | struct btrfs_qgroup_status_item { |
| 939 | __le64 version; |
| 940 | /* |
| 941 | * the generation is updated during every commit. As older |
| 942 | * versions of btrfs are not aware of qgroups, it will be |
| 943 | * possible to detect inconsistencies by checking the |
| 944 | * generation on mount time |
| 945 | */ |
| 946 | __le64 generation; |
| 947 | |
| 948 | /* flag definitions see above */ |
| 949 | __le64 flags; |
| 950 | |
| 951 | /* |
| 952 | * only used during scanning to record the progress |
| 953 | * of the scan. It contains a logical address |
| 954 | */ |
| 955 | __le64 scan; |
| 956 | } __attribute__ ((__packed__)); |
| 957 | |
| 958 | struct btrfs_qgroup_info_item { |
| 959 | __le64 generation; |
| 960 | __le64 rfer; |
| 961 | __le64 rfer_cmpr; |
| 962 | __le64 excl; |
| 963 | __le64 excl_cmpr; |
| 964 | } __attribute__ ((__packed__)); |
| 965 | |
| 966 | /* flags definition for qgroup limits */ |
| 967 | #define BTRFS_QGROUP_LIMIT_MAX_RFER (1ULL << 0) |
| 968 | #define BTRFS_QGROUP_LIMIT_MAX_EXCL (1ULL << 1) |
| 969 | #define BTRFS_QGROUP_LIMIT_RSV_RFER (1ULL << 2) |
| 970 | #define BTRFS_QGROUP_LIMIT_RSV_EXCL (1ULL << 3) |
| 971 | #define BTRFS_QGROUP_LIMIT_RFER_CMPR (1ULL << 4) |
| 972 | #define BTRFS_QGROUP_LIMIT_EXCL_CMPR (1ULL << 5) |
| 973 | |
| 974 | struct btrfs_qgroup_limit_item { |
| 975 | /* |
| 976 | * only updated when any of the other values change |
| 977 | */ |
| 978 | __le64 flags; |
| 979 | __le64 max_rfer; |
| 980 | __le64 max_excl; |
| 981 | __le64 rsv_rfer; |
| 982 | __le64 rsv_excl; |
| 983 | } __attribute__ ((__packed__)); |
| 984 | |
| 985 | struct btrfs_space_info { |
| 986 | u64 flags; |
| 987 | |
| 988 | u64 total_bytes; /* total bytes in the space, |
| 989 | this doesn't take mirrors into account */ |
| 990 | u64 bytes_used; /* total bytes used, |
| 991 | this doesn't take mirrors into account */ |
| 992 | u64 bytes_pinned; /* total bytes pinned, will be freed when the |
| 993 | transaction finishes */ |
| 994 | u64 bytes_reserved; /* total bytes the allocator has reserved for |
| 995 | current allocations */ |
| 996 | u64 bytes_readonly; /* total bytes that are read only */ |
| 997 | |
| 998 | u64 bytes_may_use; /* number of bytes that may be used for |
| 999 | delalloc/allocations */ |
| 1000 | u64 disk_used; /* total bytes used on disk */ |
| 1001 | u64 disk_total; /* total bytes on disk, takes mirrors into |
| 1002 | account */ |
| 1003 | |
| 1004 | /* |
| 1005 | * we bump reservation progress every time we decrement |
| 1006 | * bytes_reserved. This way people waiting for reservations |
| 1007 | * know something good has happened and they can check |
| 1008 | * for progress. The number here isn't to be trusted, it |
| 1009 | * just shows reclaim activity |
| 1010 | */ |
| 1011 | unsigned long reservation_progress; |
| 1012 | |
| 1013 | unsigned int full:1; /* indicates that we cannot allocate any more |
| 1014 | chunks for this space */ |
| 1015 | unsigned int chunk_alloc:1; /* set if we are allocating a chunk */ |
| 1016 | |
| 1017 | unsigned int flush:1; /* set if we are trying to make space */ |
| 1018 | |
| 1019 | unsigned int force_alloc; /* set if we need to force a chunk |
| 1020 | alloc for this space */ |
| 1021 | |
| 1022 | struct list_head list; |
| 1023 | |
| 1024 | /* for block groups in our same type */ |
| 1025 | struct list_head block_groups[BTRFS_NR_RAID_TYPES]; |
| 1026 | spinlock_t lock; |
| 1027 | struct rw_semaphore groups_sem; |
| 1028 | wait_queue_head_t wait; |
| 1029 | }; |
| 1030 | |
| 1031 | struct btrfs_block_rsv { |
| 1032 | u64 size; |
| 1033 | u64 reserved; |
| 1034 | struct btrfs_space_info *space_info; |
| 1035 | spinlock_t lock; |
| 1036 | unsigned int full; |
| 1037 | }; |
| 1038 | |
| 1039 | /* |
| 1040 | * free clusters are used to claim free space in relatively large chunks, |
| 1041 | * allowing us to do less seeky writes. They are used for all metadata |
| 1042 | * allocations and data allocations in ssd mode. |
| 1043 | */ |
| 1044 | struct btrfs_free_cluster { |
| 1045 | spinlock_t lock; |
| 1046 | spinlock_t refill_lock; |
| 1047 | struct rb_root root; |
| 1048 | |
| 1049 | /* largest extent in this cluster */ |
| 1050 | u64 max_size; |
| 1051 | |
| 1052 | /* first extent starting offset */ |
| 1053 | u64 window_start; |
| 1054 | |
| 1055 | struct btrfs_block_group_cache *block_group; |
| 1056 | /* |
| 1057 | * when a cluster is allocated from a block group, we put the |
| 1058 | * cluster onto a list in the block group so that it can |
| 1059 | * be freed before the block group is freed. |
| 1060 | */ |
| 1061 | struct list_head block_group_list; |
| 1062 | }; |
| 1063 | |
| 1064 | enum btrfs_caching_type { |
| 1065 | BTRFS_CACHE_NO = 0, |
| 1066 | BTRFS_CACHE_STARTED = 1, |
| 1067 | BTRFS_CACHE_FAST = 2, |
| 1068 | BTRFS_CACHE_FINISHED = 3, |
| 1069 | }; |
| 1070 | |
| 1071 | enum btrfs_disk_cache_state { |
| 1072 | BTRFS_DC_WRITTEN = 0, |
| 1073 | BTRFS_DC_ERROR = 1, |
| 1074 | BTRFS_DC_CLEAR = 2, |
| 1075 | BTRFS_DC_SETUP = 3, |
| 1076 | BTRFS_DC_NEED_WRITE = 4, |
| 1077 | }; |
| 1078 | |
| 1079 | struct btrfs_caching_control { |
| 1080 | struct list_head list; |
| 1081 | struct mutex mutex; |
| 1082 | wait_queue_head_t wait; |
| 1083 | struct btrfs_work work; |
| 1084 | struct btrfs_block_group_cache *block_group; |
| 1085 | u64 progress; |
| 1086 | atomic_t count; |
| 1087 | }; |
| 1088 | |
| 1089 | struct btrfs_block_group_cache { |
| 1090 | struct btrfs_key key; |
| 1091 | struct btrfs_block_group_item item; |
| 1092 | struct btrfs_fs_info *fs_info; |
| 1093 | struct inode *inode; |
| 1094 | spinlock_t lock; |
| 1095 | u64 pinned; |
| 1096 | u64 reserved; |
| 1097 | u64 bytes_super; |
| 1098 | u64 flags; |
| 1099 | u64 sectorsize; |
| 1100 | u64 cache_generation; |
| 1101 | unsigned int ro:1; |
| 1102 | unsigned int dirty:1; |
| 1103 | unsigned int iref:1; |
| 1104 | |
| 1105 | int disk_cache_state; |
| 1106 | |
| 1107 | /* cache tracking stuff */ |
| 1108 | int cached; |
| 1109 | struct btrfs_caching_control *caching_ctl; |
| 1110 | u64 last_byte_to_unpin; |
| 1111 | |
| 1112 | struct btrfs_space_info *space_info; |
| 1113 | |
| 1114 | /* free space cache stuff */ |
| 1115 | struct btrfs_free_space_ctl *free_space_ctl; |
| 1116 | |
| 1117 | /* block group cache stuff */ |
| 1118 | struct rb_node cache_node; |
| 1119 | |
| 1120 | /* for block groups in the same raid type */ |
| 1121 | struct list_head list; |
| 1122 | |
| 1123 | /* usage count */ |
| 1124 | atomic_t count; |
| 1125 | |
| 1126 | /* List of struct btrfs_free_clusters for this block group. |
| 1127 | * Today it will only have one thing on it, but that may change |
| 1128 | */ |
| 1129 | struct list_head cluster_list; |
| 1130 | }; |
| 1131 | |
| 1132 | /* delayed seq elem */ |
| 1133 | struct seq_list { |
| 1134 | struct list_head list; |
| 1135 | u64 seq; |
| 1136 | }; |
| 1137 | |
| 1138 | /* fs_info */ |
| 1139 | struct reloc_control; |
| 1140 | struct btrfs_device; |
| 1141 | struct btrfs_fs_devices; |
| 1142 | struct btrfs_balance_control; |
| 1143 | struct btrfs_delayed_root; |
| 1144 | struct btrfs_fs_info { |
| 1145 | u8 fsid[BTRFS_FSID_SIZE]; |
| 1146 | u8 chunk_tree_uuid[BTRFS_UUID_SIZE]; |
| 1147 | struct btrfs_root *extent_root; |
| 1148 | struct btrfs_root *tree_root; |
| 1149 | struct btrfs_root *chunk_root; |
| 1150 | struct btrfs_root *dev_root; |
| 1151 | struct btrfs_root *fs_root; |
| 1152 | struct btrfs_root *csum_root; |
| 1153 | struct btrfs_root *quota_root; |
| 1154 | |
| 1155 | /* the log root tree is a directory of all the other log roots */ |
| 1156 | struct btrfs_root *log_root_tree; |
| 1157 | |
| 1158 | spinlock_t fs_roots_radix_lock; |
| 1159 | struct radix_tree_root fs_roots_radix; |
| 1160 | |
| 1161 | /* block group cache stuff */ |
| 1162 | spinlock_t block_group_cache_lock; |
| 1163 | struct rb_root block_group_cache_tree; |
| 1164 | |
| 1165 | /* keep track of unallocated space */ |
| 1166 | spinlock_t free_chunk_lock; |
| 1167 | u64 free_chunk_space; |
| 1168 | |
| 1169 | struct extent_io_tree freed_extents[2]; |
| 1170 | struct extent_io_tree *pinned_extents; |
| 1171 | |
| 1172 | /* logical->physical extent mapping */ |
| 1173 | struct btrfs_mapping_tree mapping_tree; |
| 1174 | |
| 1175 | /* |
| 1176 | * block reservation for extent, checksum, root tree and |
| 1177 | * delayed dir index item |
| 1178 | */ |
| 1179 | struct btrfs_block_rsv global_block_rsv; |
| 1180 | /* block reservation for delay allocation */ |
| 1181 | struct btrfs_block_rsv delalloc_block_rsv; |
| 1182 | /* block reservation for metadata operations */ |
| 1183 | struct btrfs_block_rsv trans_block_rsv; |
| 1184 | /* block reservation for chunk tree */ |
| 1185 | struct btrfs_block_rsv chunk_block_rsv; |
| 1186 | /* block reservation for delayed operations */ |
| 1187 | struct btrfs_block_rsv delayed_block_rsv; |
| 1188 | |
| 1189 | struct btrfs_block_rsv empty_block_rsv; |
| 1190 | |
| 1191 | u64 generation; |
| 1192 | u64 last_trans_committed; |
| 1193 | |
| 1194 | /* |
| 1195 | * this is updated to the current trans every time a full commit |
| 1196 | * is required instead of the faster short fsync log commits |
| 1197 | */ |
| 1198 | u64 last_trans_log_full_commit; |
| 1199 | unsigned long mount_opt; |
| 1200 | unsigned long compress_type:4; |
| 1201 | u64 max_inline; |
| 1202 | u64 alloc_start; |
| 1203 | struct btrfs_transaction *running_transaction; |
| 1204 | wait_queue_head_t transaction_throttle; |
| 1205 | wait_queue_head_t transaction_wait; |
| 1206 | wait_queue_head_t transaction_blocked_wait; |
| 1207 | wait_queue_head_t async_submit_wait; |
| 1208 | |
| 1209 | struct btrfs_super_block *super_copy; |
| 1210 | struct btrfs_super_block *super_for_commit; |
| 1211 | struct block_device *__bdev; |
| 1212 | struct super_block *sb; |
| 1213 | struct inode *btree_inode; |
| 1214 | struct backing_dev_info bdi; |
| 1215 | struct mutex tree_log_mutex; |
| 1216 | struct mutex transaction_kthread_mutex; |
| 1217 | struct mutex cleaner_mutex; |
| 1218 | struct mutex chunk_mutex; |
| 1219 | struct mutex volume_mutex; |
| 1220 | /* |
| 1221 | * this protects the ordered operations list only while we are |
| 1222 | * processing all of the entries on it. This way we make |
| 1223 | * sure the commit code doesn't find the list temporarily empty |
| 1224 | * because another function happens to be doing non-waiting preflush |
| 1225 | * before jumping into the main commit. |
| 1226 | */ |
| 1227 | struct mutex ordered_operations_mutex; |
| 1228 | struct rw_semaphore extent_commit_sem; |
| 1229 | |
| 1230 | struct rw_semaphore cleanup_work_sem; |
| 1231 | |
| 1232 | struct rw_semaphore subvol_sem; |
| 1233 | struct srcu_struct subvol_srcu; |
| 1234 | |
| 1235 | spinlock_t trans_lock; |
| 1236 | /* |
| 1237 | * the reloc mutex goes with the trans lock, it is taken |
| 1238 | * during commit to protect us from the relocation code |
| 1239 | */ |
| 1240 | struct mutex reloc_mutex; |
| 1241 | |
| 1242 | struct list_head trans_list; |
| 1243 | struct list_head hashers; |
| 1244 | struct list_head dead_roots; |
| 1245 | struct list_head caching_block_groups; |
| 1246 | |
| 1247 | spinlock_t delayed_iput_lock; |
| 1248 | struct list_head delayed_iputs; |
| 1249 | |
| 1250 | /* this protects tree_mod_seq_list */ |
| 1251 | spinlock_t tree_mod_seq_lock; |
| 1252 | atomic_t tree_mod_seq; |
| 1253 | struct list_head tree_mod_seq_list; |
| 1254 | struct seq_list tree_mod_seq_elem; |
| 1255 | |
| 1256 | /* this protects tree_mod_log */ |
| 1257 | rwlock_t tree_mod_log_lock; |
| 1258 | struct rb_root tree_mod_log; |
| 1259 | |
| 1260 | atomic_t nr_async_submits; |
| 1261 | atomic_t async_submit_draining; |
| 1262 | atomic_t nr_async_bios; |
| 1263 | atomic_t async_delalloc_pages; |
| 1264 | atomic_t open_ioctl_trans; |
| 1265 | |
| 1266 | /* |
| 1267 | * this is used by the balancing code to wait for all the pending |
| 1268 | * ordered extents |
| 1269 | */ |
| 1270 | spinlock_t ordered_extent_lock; |
| 1271 | |
| 1272 | /* |
| 1273 | * all of the data=ordered extents pending writeback |
| 1274 | * these can span multiple transactions and basically include |
| 1275 | * every dirty data page that isn't from nodatacow |
| 1276 | */ |
| 1277 | struct list_head ordered_extents; |
| 1278 | |
| 1279 | /* |
| 1280 | * all of the inodes that have delalloc bytes. It is possible for |
| 1281 | * this list to be empty even when there is still dirty data=ordered |
| 1282 | * extents waiting to finish IO. |
| 1283 | */ |
| 1284 | struct list_head delalloc_inodes; |
| 1285 | |
| 1286 | /* |
| 1287 | * special rename and truncate targets that must be on disk before |
| 1288 | * we're allowed to commit. This is basically the ext3 style |
| 1289 | * data=ordered list. |
| 1290 | */ |
| 1291 | struct list_head ordered_operations; |
| 1292 | |
| 1293 | /* |
| 1294 | * there is a pool of worker threads for checksumming during writes |
| 1295 | * and a pool for checksumming after reads. This is because readers |
| 1296 | * can run with FS locks held, and the writers may be waiting for |
| 1297 | * those locks. We don't want ordering in the pending list to cause |
| 1298 | * deadlocks, and so the two are serviced separately. |
| 1299 | * |
| 1300 | * A third pool does submit_bio to avoid deadlocking with the other |
| 1301 | * two |
| 1302 | */ |
| 1303 | struct btrfs_workers generic_worker; |
| 1304 | struct btrfs_workers workers; |
| 1305 | struct btrfs_workers delalloc_workers; |
| 1306 | struct btrfs_workers endio_workers; |
| 1307 | struct btrfs_workers endio_meta_workers; |
| 1308 | struct btrfs_workers endio_meta_write_workers; |
| 1309 | struct btrfs_workers endio_write_workers; |
| 1310 | struct btrfs_workers endio_freespace_worker; |
| 1311 | struct btrfs_workers submit_workers; |
| 1312 | struct btrfs_workers caching_workers; |
| 1313 | struct btrfs_workers readahead_workers; |
| 1314 | |
| 1315 | /* |
| 1316 | * fixup workers take dirty pages that didn't properly go through |
| 1317 | * the cow mechanism and make them safe to write. It happens |
| 1318 | * for the sys_munmap function call path |
| 1319 | */ |
| 1320 | struct btrfs_workers fixup_workers; |
| 1321 | struct btrfs_workers delayed_workers; |
| 1322 | struct task_struct *transaction_kthread; |
| 1323 | struct task_struct *cleaner_kthread; |
| 1324 | int thread_pool_size; |
| 1325 | |
| 1326 | struct kobject super_kobj; |
| 1327 | struct completion kobj_unregister; |
| 1328 | int do_barriers; |
| 1329 | int closing; |
| 1330 | int log_root_recovering; |
| 1331 | int enospc_unlink; |
| 1332 | int trans_no_join; |
| 1333 | |
| 1334 | u64 total_pinned; |
| 1335 | |
| 1336 | /* protected by the delalloc lock, used to keep from writing |
| 1337 | * metadata until there is a nice batch |
| 1338 | */ |
| 1339 | u64 dirty_metadata_bytes; |
| 1340 | struct list_head dirty_cowonly_roots; |
| 1341 | |
| 1342 | struct btrfs_fs_devices *fs_devices; |
| 1343 | |
| 1344 | /* |
| 1345 | * the space_info list is almost entirely read only. It only changes |
| 1346 | * when we add a new raid type to the FS, and that happens |
| 1347 | * very rarely. RCU is used to protect it. |
| 1348 | */ |
| 1349 | struct list_head space_info; |
| 1350 | |
| 1351 | struct btrfs_space_info *data_sinfo; |
| 1352 | |
| 1353 | struct reloc_control *reloc_ctl; |
| 1354 | |
| 1355 | spinlock_t delalloc_lock; |
| 1356 | u64 delalloc_bytes; |
| 1357 | |
| 1358 | /* data_alloc_cluster is only used in ssd mode */ |
| 1359 | struct btrfs_free_cluster data_alloc_cluster; |
| 1360 | |
| 1361 | /* all metadata allocations go through this cluster */ |
| 1362 | struct btrfs_free_cluster meta_alloc_cluster; |
| 1363 | |
| 1364 | /* auto defrag inodes go here */ |
| 1365 | spinlock_t defrag_inodes_lock; |
| 1366 | struct rb_root defrag_inodes; |
| 1367 | atomic_t defrag_running; |
| 1368 | |
| 1369 | spinlock_t ref_cache_lock; |
| 1370 | u64 total_ref_cache_size; |
| 1371 | |
| 1372 | /* |
| 1373 | * these three are in extended format (availability of single |
| 1374 | * chunks is denoted by BTRFS_AVAIL_ALLOC_BIT_SINGLE bit, other |
| 1375 | * types are denoted by corresponding BTRFS_BLOCK_GROUP_* bits) |
| 1376 | */ |
| 1377 | u64 avail_data_alloc_bits; |
| 1378 | u64 avail_metadata_alloc_bits; |
| 1379 | u64 avail_system_alloc_bits; |
| 1380 | |
| 1381 | /* restriper state */ |
| 1382 | spinlock_t balance_lock; |
| 1383 | struct mutex balance_mutex; |
| 1384 | atomic_t balance_running; |
| 1385 | atomic_t balance_pause_req; |
| 1386 | atomic_t balance_cancel_req; |
| 1387 | struct btrfs_balance_control *balance_ctl; |
| 1388 | wait_queue_head_t balance_wait_q; |
| 1389 | |
| 1390 | unsigned data_chunk_allocations; |
| 1391 | unsigned metadata_ratio; |
| 1392 | |
| 1393 | void *bdev_holder; |
| 1394 | |
| 1395 | /* private scrub information */ |
| 1396 | struct mutex scrub_lock; |
| 1397 | atomic_t scrubs_running; |
| 1398 | atomic_t scrub_pause_req; |
| 1399 | atomic_t scrubs_paused; |
| 1400 | atomic_t scrub_cancel_req; |
| 1401 | wait_queue_head_t scrub_pause_wait; |
| 1402 | struct rw_semaphore scrub_super_lock; |
| 1403 | int scrub_workers_refcnt; |
| 1404 | struct btrfs_workers scrub_workers; |
| 1405 | |
| 1406 | #ifdef CONFIG_BTRFS_FS_CHECK_INTEGRITY |
| 1407 | u32 check_integrity_print_mask; |
| 1408 | #endif |
| 1409 | /* |
| 1410 | * quota information |
| 1411 | */ |
| 1412 | unsigned int quota_enabled:1; |
| 1413 | |
| 1414 | /* |
| 1415 | * quota_enabled only changes state after a commit. This holds the |
| 1416 | * next state. |
| 1417 | */ |
| 1418 | unsigned int pending_quota_state:1; |
| 1419 | |
| 1420 | /* is qgroup tracking in a consistent state? */ |
| 1421 | u64 qgroup_flags; |
| 1422 | |
| 1423 | /* holds configuration and tracking. Protected by qgroup_lock */ |
| 1424 | struct rb_root qgroup_tree; |
| 1425 | spinlock_t qgroup_lock; |
| 1426 | |
| 1427 | /* list of dirty qgroups to be written at next commit */ |
| 1428 | struct list_head dirty_qgroups; |
| 1429 | |
| 1430 | /* used by btrfs_qgroup_record_ref for an efficient tree traversal */ |
| 1431 | u64 qgroup_seq; |
| 1432 | |
| 1433 | /* filesystem state */ |
| 1434 | u64 fs_state; |
| 1435 | |
| 1436 | struct btrfs_delayed_root *delayed_root; |
| 1437 | |
| 1438 | /* readahead tree */ |
| 1439 | spinlock_t reada_lock; |
| 1440 | struct radix_tree_root reada_tree; |
| 1441 | |
| 1442 | /* next backup root to be overwritten */ |
| 1443 | int backup_root_index; |
| 1444 | }; |
| 1445 | |
| 1446 | /* |
| 1447 | * in ram representation of the tree. extent_root is used for all allocations |
| 1448 | * and for the extent tree extent_root root. |
| 1449 | */ |
| 1450 | struct btrfs_root { |
| 1451 | struct extent_buffer *node; |
| 1452 | |
| 1453 | struct extent_buffer *commit_root; |
| 1454 | struct btrfs_root *log_root; |
| 1455 | struct btrfs_root *reloc_root; |
| 1456 | |
| 1457 | struct btrfs_root_item root_item; |
| 1458 | struct btrfs_key root_key; |
| 1459 | struct btrfs_fs_info *fs_info; |
| 1460 | struct extent_io_tree dirty_log_pages; |
| 1461 | |
| 1462 | struct kobject root_kobj; |
| 1463 | struct completion kobj_unregister; |
| 1464 | struct mutex objectid_mutex; |
| 1465 | |
| 1466 | spinlock_t accounting_lock; |
| 1467 | struct btrfs_block_rsv *block_rsv; |
| 1468 | |
| 1469 | /* free ino cache stuff */ |
| 1470 | struct mutex fs_commit_mutex; |
| 1471 | struct btrfs_free_space_ctl *free_ino_ctl; |
| 1472 | enum btrfs_caching_type cached; |
| 1473 | spinlock_t cache_lock; |
| 1474 | wait_queue_head_t cache_wait; |
| 1475 | struct btrfs_free_space_ctl *free_ino_pinned; |
| 1476 | u64 cache_progress; |
| 1477 | struct inode *cache_inode; |
| 1478 | |
| 1479 | struct mutex log_mutex; |
| 1480 | wait_queue_head_t log_writer_wait; |
| 1481 | wait_queue_head_t log_commit_wait[2]; |
| 1482 | atomic_t log_writers; |
| 1483 | atomic_t log_commit[2]; |
| 1484 | unsigned long log_transid; |
| 1485 | unsigned long last_log_commit; |
| 1486 | unsigned long log_batch; |
| 1487 | pid_t log_start_pid; |
| 1488 | bool log_multiple_pids; |
| 1489 | |
| 1490 | u64 objectid; |
| 1491 | u64 last_trans; |
| 1492 | |
| 1493 | /* data allocations are done in sectorsize units */ |
| 1494 | u32 sectorsize; |
| 1495 | |
| 1496 | /* node allocations are done in nodesize units */ |
| 1497 | u32 nodesize; |
| 1498 | |
| 1499 | /* leaf allocations are done in leafsize units */ |
| 1500 | u32 leafsize; |
| 1501 | |
| 1502 | u32 stripesize; |
| 1503 | |
| 1504 | u32 type; |
| 1505 | |
| 1506 | u64 highest_objectid; |
| 1507 | |
| 1508 | /* btrfs_record_root_in_trans is a multi-step process, |
| 1509 | * and it can race with the balancing code. But the |
| 1510 | * race is very small, and only the first time the root |
| 1511 | * is added to each transaction. So in_trans_setup |
| 1512 | * is used to tell us when more checks are required |
| 1513 | */ |
| 1514 | unsigned long in_trans_setup; |
| 1515 | int ref_cows; |
| 1516 | int track_dirty; |
| 1517 | int in_radix; |
| 1518 | |
| 1519 | u64 defrag_trans_start; |
| 1520 | struct btrfs_key defrag_progress; |
| 1521 | struct btrfs_key defrag_max; |
| 1522 | int defrag_running; |
| 1523 | char *name; |
| 1524 | |
| 1525 | /* the dirty list is only used by non-reference counted roots */ |
| 1526 | struct list_head dirty_list; |
| 1527 | |
| 1528 | struct list_head root_list; |
| 1529 | |
| 1530 | spinlock_t orphan_lock; |
| 1531 | atomic_t orphan_inodes; |
| 1532 | struct btrfs_block_rsv *orphan_block_rsv; |
| 1533 | int orphan_item_inserted; |
| 1534 | int orphan_cleanup_state; |
| 1535 | |
| 1536 | spinlock_t inode_lock; |
| 1537 | /* red-black tree that keeps track of in-memory inodes */ |
| 1538 | struct rb_root inode_tree; |
| 1539 | |
| 1540 | /* |
| 1541 | * radix tree that keeps track of delayed nodes of every inode, |
| 1542 | * protected by inode_lock |
| 1543 | */ |
| 1544 | struct radix_tree_root delayed_nodes_tree; |
| 1545 | /* |
| 1546 | * right now this just gets used so that a root has its own devid |
| 1547 | * for stat. It may be used for more later |
| 1548 | */ |
| 1549 | dev_t anon_dev; |
| 1550 | |
| 1551 | int force_cow; |
| 1552 | |
| 1553 | spinlock_t root_times_lock; |
| 1554 | }; |
| 1555 | |
| 1556 | struct btrfs_ioctl_defrag_range_args { |
| 1557 | /* start of the defrag operation */ |
| 1558 | __u64 start; |
| 1559 | |
| 1560 | /* number of bytes to defrag, use (u64)-1 to say all */ |
| 1561 | __u64 len; |
| 1562 | |
| 1563 | /* |
| 1564 | * flags for the operation, which can include turning |
| 1565 | * on compression for this one defrag |
| 1566 | */ |
| 1567 | __u64 flags; |
| 1568 | |
| 1569 | /* |
| 1570 | * any extent bigger than this will be considered |
| 1571 | * already defragged. Use 0 to take the kernel default |
| 1572 | * Use 1 to say every single extent must be rewritten |
| 1573 | */ |
| 1574 | __u32 extent_thresh; |
| 1575 | |
| 1576 | /* |
| 1577 | * which compression method to use if turning on compression |
| 1578 | * for this defrag operation. If unspecified, zlib will |
| 1579 | * be used |
| 1580 | */ |
| 1581 | __u32 compress_type; |
| 1582 | |
| 1583 | /* spare for later */ |
| 1584 | __u32 unused[4]; |
| 1585 | }; |
| 1586 | |
| 1587 | |
| 1588 | /* |
| 1589 | * inode items have the data typically returned from stat and store other |
| 1590 | * info about object characteristics. There is one for every file and dir in |
| 1591 | * the FS |
| 1592 | */ |
| 1593 | #define BTRFS_INODE_ITEM_KEY 1 |
| 1594 | #define BTRFS_INODE_REF_KEY 12 |
| 1595 | #define BTRFS_XATTR_ITEM_KEY 24 |
| 1596 | #define BTRFS_ORPHAN_ITEM_KEY 48 |
| 1597 | /* reserve 2-15 close to the inode for later flexibility */ |
| 1598 | |
| 1599 | /* |
| 1600 | * dir items are the name -> inode pointers in a directory. There is one |
| 1601 | * for every name in a directory. |
| 1602 | */ |
| 1603 | #define BTRFS_DIR_LOG_ITEM_KEY 60 |
| 1604 | #define BTRFS_DIR_LOG_INDEX_KEY 72 |
| 1605 | #define BTRFS_DIR_ITEM_KEY 84 |
| 1606 | #define BTRFS_DIR_INDEX_KEY 96 |
| 1607 | /* |
| 1608 | * extent data is for file data |
| 1609 | */ |
| 1610 | #define BTRFS_EXTENT_DATA_KEY 108 |
| 1611 | |
| 1612 | /* |
| 1613 | * extent csums are stored in a separate tree and hold csums for |
| 1614 | * an entire extent on disk. |
| 1615 | */ |
| 1616 | #define BTRFS_EXTENT_CSUM_KEY 128 |
| 1617 | |
| 1618 | /* |
| 1619 | * root items point to tree roots. They are typically in the root |
| 1620 | * tree used by the super block to find all the other trees |
| 1621 | */ |
| 1622 | #define BTRFS_ROOT_ITEM_KEY 132 |
| 1623 | |
| 1624 | /* |
| 1625 | * root backrefs tie subvols and snapshots to the directory entries that |
| 1626 | * reference them |
| 1627 | */ |
| 1628 | #define BTRFS_ROOT_BACKREF_KEY 144 |
| 1629 | |
| 1630 | /* |
| 1631 | * root refs make a fast index for listing all of the snapshots and |
| 1632 | * subvolumes referenced by a given root. They point directly to the |
| 1633 | * directory item in the root that references the subvol |
| 1634 | */ |
| 1635 | #define BTRFS_ROOT_REF_KEY 156 |
| 1636 | |
| 1637 | /* |
| 1638 | * extent items are in the extent map tree. These record which blocks |
| 1639 | * are used, and how many references there are to each block |
| 1640 | */ |
| 1641 | #define BTRFS_EXTENT_ITEM_KEY 168 |
| 1642 | |
| 1643 | #define BTRFS_TREE_BLOCK_REF_KEY 176 |
| 1644 | |
| 1645 | #define BTRFS_EXTENT_DATA_REF_KEY 178 |
| 1646 | |
| 1647 | #define BTRFS_EXTENT_REF_V0_KEY 180 |
| 1648 | |
| 1649 | #define BTRFS_SHARED_BLOCK_REF_KEY 182 |
| 1650 | |
| 1651 | #define BTRFS_SHARED_DATA_REF_KEY 184 |
| 1652 | |
| 1653 | /* |
| 1654 | * block groups give us hints into the extent allocation trees. Which |
| 1655 | * blocks are free etc etc |
| 1656 | */ |
| 1657 | #define BTRFS_BLOCK_GROUP_ITEM_KEY 192 |
| 1658 | |
| 1659 | #define BTRFS_DEV_EXTENT_KEY 204 |
| 1660 | #define BTRFS_DEV_ITEM_KEY 216 |
| 1661 | #define BTRFS_CHUNK_ITEM_KEY 228 |
| 1662 | |
| 1663 | /* |
| 1664 | * Records the overall state of the qgroups. |
| 1665 | * There's only one instance of this key present, |
| 1666 | * (0, BTRFS_QGROUP_STATUS_KEY, 0) |
| 1667 | */ |
| 1668 | #define BTRFS_QGROUP_STATUS_KEY 240 |
| 1669 | /* |
| 1670 | * Records the currently used space of the qgroup. |
| 1671 | * One key per qgroup, (0, BTRFS_QGROUP_INFO_KEY, qgroupid). |
| 1672 | */ |
| 1673 | #define BTRFS_QGROUP_INFO_KEY 242 |
| 1674 | /* |
| 1675 | * Contains the user configured limits for the qgroup. |
| 1676 | * One key per qgroup, (0, BTRFS_QGROUP_LIMIT_KEY, qgroupid). |
| 1677 | */ |
| 1678 | #define BTRFS_QGROUP_LIMIT_KEY 244 |
| 1679 | /* |
| 1680 | * Records the child-parent relationship of qgroups. For |
| 1681 | * each relation, 2 keys are present: |
| 1682 | * (childid, BTRFS_QGROUP_RELATION_KEY, parentid) |
| 1683 | * (parentid, BTRFS_QGROUP_RELATION_KEY, childid) |
| 1684 | */ |
| 1685 | #define BTRFS_QGROUP_RELATION_KEY 246 |
| 1686 | |
| 1687 | #define BTRFS_BALANCE_ITEM_KEY 248 |
| 1688 | |
| 1689 | /* |
| 1690 | * Persistantly stores the io stats in the device tree. |
| 1691 | * One key for all stats, (0, BTRFS_DEV_STATS_KEY, devid). |
| 1692 | */ |
| 1693 | #define BTRFS_DEV_STATS_KEY 249 |
| 1694 | |
| 1695 | /* |
| 1696 | * string items are for debugging. They just store a short string of |
| 1697 | * data in the FS |
| 1698 | */ |
| 1699 | #define BTRFS_STRING_ITEM_KEY 253 |
| 1700 | |
| 1701 | /* |
| 1702 | * Flags for mount options. |
| 1703 | * |
| 1704 | * Note: don't forget to add new options to btrfs_show_options() |
| 1705 | */ |
| 1706 | #define BTRFS_MOUNT_NODATASUM (1 << 0) |
| 1707 | #define BTRFS_MOUNT_NODATACOW (1 << 1) |
| 1708 | #define BTRFS_MOUNT_NOBARRIER (1 << 2) |
| 1709 | #define BTRFS_MOUNT_SSD (1 << 3) |
| 1710 | #define BTRFS_MOUNT_DEGRADED (1 << 4) |
| 1711 | #define BTRFS_MOUNT_COMPRESS (1 << 5) |
| 1712 | #define BTRFS_MOUNT_NOTREELOG (1 << 6) |
| 1713 | #define BTRFS_MOUNT_FLUSHONCOMMIT (1 << 7) |
| 1714 | #define BTRFS_MOUNT_SSD_SPREAD (1 << 8) |
| 1715 | #define BTRFS_MOUNT_NOSSD (1 << 9) |
| 1716 | #define BTRFS_MOUNT_DISCARD (1 << 10) |
| 1717 | #define BTRFS_MOUNT_FORCE_COMPRESS (1 << 11) |
| 1718 | #define BTRFS_MOUNT_SPACE_CACHE (1 << 12) |
| 1719 | #define BTRFS_MOUNT_CLEAR_CACHE (1 << 13) |
| 1720 | #define BTRFS_MOUNT_USER_SUBVOL_RM_ALLOWED (1 << 14) |
| 1721 | #define BTRFS_MOUNT_ENOSPC_DEBUG (1 << 15) |
| 1722 | #define BTRFS_MOUNT_AUTO_DEFRAG (1 << 16) |
| 1723 | #define BTRFS_MOUNT_INODE_MAP_CACHE (1 << 17) |
| 1724 | #define BTRFS_MOUNT_RECOVERY (1 << 18) |
| 1725 | #define BTRFS_MOUNT_SKIP_BALANCE (1 << 19) |
| 1726 | #define BTRFS_MOUNT_CHECK_INTEGRITY (1 << 20) |
| 1727 | #define BTRFS_MOUNT_CHECK_INTEGRITY_INCLUDING_EXTENT_DATA (1 << 21) |
| 1728 | #define BTRFS_MOUNT_PANIC_ON_FATAL_ERROR (1 << 22) |
| 1729 | |
| 1730 | #define btrfs_clear_opt(o, opt) ((o) &= ~BTRFS_MOUNT_##opt) |
| 1731 | #define btrfs_set_opt(o, opt) ((o) |= BTRFS_MOUNT_##opt) |
| 1732 | #define btrfs_test_opt(root, opt) ((root)->fs_info->mount_opt & \ |
| 1733 | BTRFS_MOUNT_##opt) |
| 1734 | /* |
| 1735 | * Inode flags |
| 1736 | */ |
| 1737 | #define BTRFS_INODE_NODATASUM (1 << 0) |
| 1738 | #define BTRFS_INODE_NODATACOW (1 << 1) |
| 1739 | #define BTRFS_INODE_READONLY (1 << 2) |
| 1740 | #define BTRFS_INODE_NOCOMPRESS (1 << 3) |
| 1741 | #define BTRFS_INODE_PREALLOC (1 << 4) |
| 1742 | #define BTRFS_INODE_SYNC (1 << 5) |
| 1743 | #define BTRFS_INODE_IMMUTABLE (1 << 6) |
| 1744 | #define BTRFS_INODE_APPEND (1 << 7) |
| 1745 | #define BTRFS_INODE_NODUMP (1 << 8) |
| 1746 | #define BTRFS_INODE_NOATIME (1 << 9) |
| 1747 | #define BTRFS_INODE_DIRSYNC (1 << 10) |
| 1748 | #define BTRFS_INODE_COMPRESS (1 << 11) |
| 1749 | |
| 1750 | #define BTRFS_INODE_ROOT_ITEM_INIT (1 << 31) |
| 1751 | |
| 1752 | struct btrfs_map_token { |
| 1753 | struct extent_buffer *eb; |
| 1754 | char *kaddr; |
| 1755 | unsigned long offset; |
| 1756 | }; |
| 1757 | |
| 1758 | static inline void btrfs_init_map_token (struct btrfs_map_token *token) |
| 1759 | { |
| 1760 | memset(token, 0, sizeof(*token)); |
| 1761 | } |
| 1762 | |
| 1763 | /* some macros to generate set/get funcs for the struct fields. This |
| 1764 | * assumes there is a lefoo_to_cpu for every type, so lets make a simple |
| 1765 | * one for u8: |
| 1766 | */ |
| 1767 | #define le8_to_cpu(v) (v) |
| 1768 | #define cpu_to_le8(v) (v) |
| 1769 | #define __le8 u8 |
| 1770 | |
| 1771 | #define read_eb_member(eb, ptr, type, member, result) ( \ |
| 1772 | read_extent_buffer(eb, (char *)(result), \ |
| 1773 | ((unsigned long)(ptr)) + \ |
| 1774 | offsetof(type, member), \ |
| 1775 | sizeof(((type *)0)->member))) |
| 1776 | |
| 1777 | #define write_eb_member(eb, ptr, type, member, result) ( \ |
| 1778 | write_extent_buffer(eb, (char *)(result), \ |
| 1779 | ((unsigned long)(ptr)) + \ |
| 1780 | offsetof(type, member), \ |
| 1781 | sizeof(((type *)0)->member))) |
| 1782 | |
| 1783 | #define DECLARE_BTRFS_SETGET_BITS(bits) \ |
| 1784 | u##bits btrfs_get_token_##bits(struct extent_buffer *eb, void *ptr, \ |
| 1785 | unsigned long off, \ |
| 1786 | struct btrfs_map_token *token); \ |
| 1787 | void btrfs_set_token_##bits(struct extent_buffer *eb, void *ptr, \ |
| 1788 | unsigned long off, u##bits val, \ |
| 1789 | struct btrfs_map_token *token); \ |
| 1790 | static inline u##bits btrfs_get_##bits(struct extent_buffer *eb, void *ptr, \ |
| 1791 | unsigned long off) \ |
| 1792 | { \ |
| 1793 | return btrfs_get_token_##bits(eb, ptr, off, NULL); \ |
| 1794 | } \ |
| 1795 | static inline void btrfs_set_##bits(struct extent_buffer *eb, void *ptr, \ |
| 1796 | unsigned long off, u##bits val) \ |
| 1797 | { \ |
| 1798 | btrfs_set_token_##bits(eb, ptr, off, val, NULL); \ |
| 1799 | } |
| 1800 | |
| 1801 | DECLARE_BTRFS_SETGET_BITS(8) |
| 1802 | DECLARE_BTRFS_SETGET_BITS(16) |
| 1803 | DECLARE_BTRFS_SETGET_BITS(32) |
| 1804 | DECLARE_BTRFS_SETGET_BITS(64) |
| 1805 | |
| 1806 | #define BTRFS_SETGET_FUNCS(name, type, member, bits) \ |
| 1807 | static inline u##bits btrfs_##name(struct extent_buffer *eb, type *s) \ |
| 1808 | { \ |
| 1809 | BUILD_BUG_ON(sizeof(u##bits) != sizeof(((type *)0))->member); \ |
| 1810 | return btrfs_get_##bits(eb, s, offsetof(type, member)); \ |
| 1811 | } \ |
| 1812 | static inline void btrfs_set_##name(struct extent_buffer *eb, type *s, \ |
| 1813 | u##bits val) \ |
| 1814 | { \ |
| 1815 | BUILD_BUG_ON(sizeof(u##bits) != sizeof(((type *)0))->member); \ |
| 1816 | btrfs_set_##bits(eb, s, offsetof(type, member), val); \ |
| 1817 | } \ |
| 1818 | static inline u##bits btrfs_token_##name(struct extent_buffer *eb, type *s, \ |
| 1819 | struct btrfs_map_token *token) \ |
| 1820 | { \ |
| 1821 | BUILD_BUG_ON(sizeof(u##bits) != sizeof(((type *)0))->member); \ |
| 1822 | return btrfs_get_token_##bits(eb, s, offsetof(type, member), token); \ |
| 1823 | } \ |
| 1824 | static inline void btrfs_set_token_##name(struct extent_buffer *eb, \ |
| 1825 | type *s, u##bits val, \ |
| 1826 | struct btrfs_map_token *token) \ |
| 1827 | { \ |
| 1828 | BUILD_BUG_ON(sizeof(u##bits) != sizeof(((type *)0))->member); \ |
| 1829 | btrfs_set_token_##bits(eb, s, offsetof(type, member), val, token); \ |
| 1830 | } |
| 1831 | |
| 1832 | #define BTRFS_SETGET_HEADER_FUNCS(name, type, member, bits) \ |
| 1833 | static inline u##bits btrfs_##name(struct extent_buffer *eb) \ |
| 1834 | { \ |
| 1835 | type *p = page_address(eb->pages[0]); \ |
| 1836 | u##bits res = le##bits##_to_cpu(p->member); \ |
| 1837 | return res; \ |
| 1838 | } \ |
| 1839 | static inline void btrfs_set_##name(struct extent_buffer *eb, \ |
| 1840 | u##bits val) \ |
| 1841 | { \ |
| 1842 | type *p = page_address(eb->pages[0]); \ |
| 1843 | p->member = cpu_to_le##bits(val); \ |
| 1844 | } |
| 1845 | |
| 1846 | #define BTRFS_SETGET_STACK_FUNCS(name, type, member, bits) \ |
| 1847 | static inline u##bits btrfs_##name(type *s) \ |
| 1848 | { \ |
| 1849 | return le##bits##_to_cpu(s->member); \ |
| 1850 | } \ |
| 1851 | static inline void btrfs_set_##name(type *s, u##bits val) \ |
| 1852 | { \ |
| 1853 | s->member = cpu_to_le##bits(val); \ |
| 1854 | } |
| 1855 | |
| 1856 | BTRFS_SETGET_FUNCS(device_type, struct btrfs_dev_item, type, 64); |
| 1857 | BTRFS_SETGET_FUNCS(device_total_bytes, struct btrfs_dev_item, total_bytes, 64); |
| 1858 | BTRFS_SETGET_FUNCS(device_bytes_used, struct btrfs_dev_item, bytes_used, 64); |
| 1859 | BTRFS_SETGET_FUNCS(device_io_align, struct btrfs_dev_item, io_align, 32); |
| 1860 | BTRFS_SETGET_FUNCS(device_io_width, struct btrfs_dev_item, io_width, 32); |
| 1861 | BTRFS_SETGET_FUNCS(device_start_offset, struct btrfs_dev_item, |
| 1862 | start_offset, 64); |
| 1863 | BTRFS_SETGET_FUNCS(device_sector_size, struct btrfs_dev_item, sector_size, 32); |
| 1864 | BTRFS_SETGET_FUNCS(device_id, struct btrfs_dev_item, devid, 64); |
| 1865 | BTRFS_SETGET_FUNCS(device_group, struct btrfs_dev_item, dev_group, 32); |
| 1866 | BTRFS_SETGET_FUNCS(device_seek_speed, struct btrfs_dev_item, seek_speed, 8); |
| 1867 | BTRFS_SETGET_FUNCS(device_bandwidth, struct btrfs_dev_item, bandwidth, 8); |
| 1868 | BTRFS_SETGET_FUNCS(device_generation, struct btrfs_dev_item, generation, 64); |
| 1869 | |
| 1870 | BTRFS_SETGET_STACK_FUNCS(stack_device_type, struct btrfs_dev_item, type, 64); |
| 1871 | BTRFS_SETGET_STACK_FUNCS(stack_device_total_bytes, struct btrfs_dev_item, |
| 1872 | total_bytes, 64); |
| 1873 | BTRFS_SETGET_STACK_FUNCS(stack_device_bytes_used, struct btrfs_dev_item, |
| 1874 | bytes_used, 64); |
| 1875 | BTRFS_SETGET_STACK_FUNCS(stack_device_io_align, struct btrfs_dev_item, |
| 1876 | io_align, 32); |
| 1877 | BTRFS_SETGET_STACK_FUNCS(stack_device_io_width, struct btrfs_dev_item, |
| 1878 | io_width, 32); |
| 1879 | BTRFS_SETGET_STACK_FUNCS(stack_device_sector_size, struct btrfs_dev_item, |
| 1880 | sector_size, 32); |
| 1881 | BTRFS_SETGET_STACK_FUNCS(stack_device_id, struct btrfs_dev_item, devid, 64); |
| 1882 | BTRFS_SETGET_STACK_FUNCS(stack_device_group, struct btrfs_dev_item, |
| 1883 | dev_group, 32); |
| 1884 | BTRFS_SETGET_STACK_FUNCS(stack_device_seek_speed, struct btrfs_dev_item, |
| 1885 | seek_speed, 8); |
| 1886 | BTRFS_SETGET_STACK_FUNCS(stack_device_bandwidth, struct btrfs_dev_item, |
| 1887 | bandwidth, 8); |
| 1888 | BTRFS_SETGET_STACK_FUNCS(stack_device_generation, struct btrfs_dev_item, |
| 1889 | generation, 64); |
| 1890 | |
| 1891 | static inline char *btrfs_device_uuid(struct btrfs_dev_item *d) |
| 1892 | { |
| 1893 | return (char *)d + offsetof(struct btrfs_dev_item, uuid); |
| 1894 | } |
| 1895 | |
| 1896 | static inline char *btrfs_device_fsid(struct btrfs_dev_item *d) |
| 1897 | { |
| 1898 | return (char *)d + offsetof(struct btrfs_dev_item, fsid); |
| 1899 | } |
| 1900 | |
| 1901 | BTRFS_SETGET_FUNCS(chunk_length, struct btrfs_chunk, length, 64); |
| 1902 | BTRFS_SETGET_FUNCS(chunk_owner, struct btrfs_chunk, owner, 64); |
| 1903 | BTRFS_SETGET_FUNCS(chunk_stripe_len, struct btrfs_chunk, stripe_len, 64); |
| 1904 | BTRFS_SETGET_FUNCS(chunk_io_align, struct btrfs_chunk, io_align, 32); |
| 1905 | BTRFS_SETGET_FUNCS(chunk_io_width, struct btrfs_chunk, io_width, 32); |
| 1906 | BTRFS_SETGET_FUNCS(chunk_sector_size, struct btrfs_chunk, sector_size, 32); |
| 1907 | BTRFS_SETGET_FUNCS(chunk_type, struct btrfs_chunk, type, 64); |
| 1908 | BTRFS_SETGET_FUNCS(chunk_num_stripes, struct btrfs_chunk, num_stripes, 16); |
| 1909 | BTRFS_SETGET_FUNCS(chunk_sub_stripes, struct btrfs_chunk, sub_stripes, 16); |
| 1910 | BTRFS_SETGET_FUNCS(stripe_devid, struct btrfs_stripe, devid, 64); |
| 1911 | BTRFS_SETGET_FUNCS(stripe_offset, struct btrfs_stripe, offset, 64); |
| 1912 | |
| 1913 | static inline char *btrfs_stripe_dev_uuid(struct btrfs_stripe *s) |
| 1914 | { |
| 1915 | return (char *)s + offsetof(struct btrfs_stripe, dev_uuid); |
| 1916 | } |
| 1917 | |
| 1918 | BTRFS_SETGET_STACK_FUNCS(stack_chunk_length, struct btrfs_chunk, length, 64); |
| 1919 | BTRFS_SETGET_STACK_FUNCS(stack_chunk_owner, struct btrfs_chunk, owner, 64); |
| 1920 | BTRFS_SETGET_STACK_FUNCS(stack_chunk_stripe_len, struct btrfs_chunk, |
| 1921 | stripe_len, 64); |
| 1922 | BTRFS_SETGET_STACK_FUNCS(stack_chunk_io_align, struct btrfs_chunk, |
| 1923 | io_align, 32); |
| 1924 | BTRFS_SETGET_STACK_FUNCS(stack_chunk_io_width, struct btrfs_chunk, |
| 1925 | io_width, 32); |
| 1926 | BTRFS_SETGET_STACK_FUNCS(stack_chunk_sector_size, struct btrfs_chunk, |
| 1927 | sector_size, 32); |
| 1928 | BTRFS_SETGET_STACK_FUNCS(stack_chunk_type, struct btrfs_chunk, type, 64); |
| 1929 | BTRFS_SETGET_STACK_FUNCS(stack_chunk_num_stripes, struct btrfs_chunk, |
| 1930 | num_stripes, 16); |
| 1931 | BTRFS_SETGET_STACK_FUNCS(stack_chunk_sub_stripes, struct btrfs_chunk, |
| 1932 | sub_stripes, 16); |
| 1933 | BTRFS_SETGET_STACK_FUNCS(stack_stripe_devid, struct btrfs_stripe, devid, 64); |
| 1934 | BTRFS_SETGET_STACK_FUNCS(stack_stripe_offset, struct btrfs_stripe, offset, 64); |
| 1935 | |
| 1936 | static inline struct btrfs_stripe *btrfs_stripe_nr(struct btrfs_chunk *c, |
| 1937 | int nr) |
| 1938 | { |
| 1939 | unsigned long offset = (unsigned long)c; |
| 1940 | offset += offsetof(struct btrfs_chunk, stripe); |
| 1941 | offset += nr * sizeof(struct btrfs_stripe); |
| 1942 | return (struct btrfs_stripe *)offset; |
| 1943 | } |
| 1944 | |
| 1945 | static inline char *btrfs_stripe_dev_uuid_nr(struct btrfs_chunk *c, int nr) |
| 1946 | { |
| 1947 | return btrfs_stripe_dev_uuid(btrfs_stripe_nr(c, nr)); |
| 1948 | } |
| 1949 | |
| 1950 | static inline u64 btrfs_stripe_offset_nr(struct extent_buffer *eb, |
| 1951 | struct btrfs_chunk *c, int nr) |
| 1952 | { |
| 1953 | return btrfs_stripe_offset(eb, btrfs_stripe_nr(c, nr)); |
| 1954 | } |
| 1955 | |
| 1956 | static inline u64 btrfs_stripe_devid_nr(struct extent_buffer *eb, |
| 1957 | struct btrfs_chunk *c, int nr) |
| 1958 | { |
| 1959 | return btrfs_stripe_devid(eb, btrfs_stripe_nr(c, nr)); |
| 1960 | } |
| 1961 | |
| 1962 | /* struct btrfs_block_group_item */ |
| 1963 | BTRFS_SETGET_STACK_FUNCS(block_group_used, struct btrfs_block_group_item, |
| 1964 | used, 64); |
| 1965 | BTRFS_SETGET_FUNCS(disk_block_group_used, struct btrfs_block_group_item, |
| 1966 | used, 64); |
| 1967 | BTRFS_SETGET_STACK_FUNCS(block_group_chunk_objectid, |
| 1968 | struct btrfs_block_group_item, chunk_objectid, 64); |
| 1969 | |
| 1970 | BTRFS_SETGET_FUNCS(disk_block_group_chunk_objectid, |
| 1971 | struct btrfs_block_group_item, chunk_objectid, 64); |
| 1972 | BTRFS_SETGET_FUNCS(disk_block_group_flags, |
| 1973 | struct btrfs_block_group_item, flags, 64); |
| 1974 | BTRFS_SETGET_STACK_FUNCS(block_group_flags, |
| 1975 | struct btrfs_block_group_item, flags, 64); |
| 1976 | |
| 1977 | /* struct btrfs_inode_ref */ |
| 1978 | BTRFS_SETGET_FUNCS(inode_ref_name_len, struct btrfs_inode_ref, name_len, 16); |
| 1979 | BTRFS_SETGET_FUNCS(inode_ref_index, struct btrfs_inode_ref, index, 64); |
| 1980 | |
| 1981 | /* struct btrfs_inode_item */ |
| 1982 | BTRFS_SETGET_FUNCS(inode_generation, struct btrfs_inode_item, generation, 64); |
| 1983 | BTRFS_SETGET_FUNCS(inode_sequence, struct btrfs_inode_item, sequence, 64); |
| 1984 | BTRFS_SETGET_FUNCS(inode_transid, struct btrfs_inode_item, transid, 64); |
| 1985 | BTRFS_SETGET_FUNCS(inode_size, struct btrfs_inode_item, size, 64); |
| 1986 | BTRFS_SETGET_FUNCS(inode_nbytes, struct btrfs_inode_item, nbytes, 64); |
| 1987 | BTRFS_SETGET_FUNCS(inode_block_group, struct btrfs_inode_item, block_group, 64); |
| 1988 | BTRFS_SETGET_FUNCS(inode_nlink, struct btrfs_inode_item, nlink, 32); |
| 1989 | BTRFS_SETGET_FUNCS(inode_uid, struct btrfs_inode_item, uid, 32); |
| 1990 | BTRFS_SETGET_FUNCS(inode_gid, struct btrfs_inode_item, gid, 32); |
| 1991 | BTRFS_SETGET_FUNCS(inode_mode, struct btrfs_inode_item, mode, 32); |
| 1992 | BTRFS_SETGET_FUNCS(inode_rdev, struct btrfs_inode_item, rdev, 64); |
| 1993 | BTRFS_SETGET_FUNCS(inode_flags, struct btrfs_inode_item, flags, 64); |
| 1994 | |
| 1995 | static inline struct btrfs_timespec * |
| 1996 | btrfs_inode_atime(struct btrfs_inode_item *inode_item) |
| 1997 | { |
| 1998 | unsigned long ptr = (unsigned long)inode_item; |
| 1999 | ptr += offsetof(struct btrfs_inode_item, atime); |
| 2000 | return (struct btrfs_timespec *)ptr; |
| 2001 | } |
| 2002 | |
| 2003 | static inline struct btrfs_timespec * |
| 2004 | btrfs_inode_mtime(struct btrfs_inode_item *inode_item) |
| 2005 | { |
| 2006 | unsigned long ptr = (unsigned long)inode_item; |
| 2007 | ptr += offsetof(struct btrfs_inode_item, mtime); |
| 2008 | return (struct btrfs_timespec *)ptr; |
| 2009 | } |
| 2010 | |
| 2011 | static inline struct btrfs_timespec * |
| 2012 | btrfs_inode_ctime(struct btrfs_inode_item *inode_item) |
| 2013 | { |
| 2014 | unsigned long ptr = (unsigned long)inode_item; |
| 2015 | ptr += offsetof(struct btrfs_inode_item, ctime); |
| 2016 | return (struct btrfs_timespec *)ptr; |
| 2017 | } |
| 2018 | |
| 2019 | BTRFS_SETGET_FUNCS(timespec_sec, struct btrfs_timespec, sec, 64); |
| 2020 | BTRFS_SETGET_FUNCS(timespec_nsec, struct btrfs_timespec, nsec, 32); |
| 2021 | |
| 2022 | /* struct btrfs_dev_extent */ |
| 2023 | BTRFS_SETGET_FUNCS(dev_extent_chunk_tree, struct btrfs_dev_extent, |
| 2024 | chunk_tree, 64); |
| 2025 | BTRFS_SETGET_FUNCS(dev_extent_chunk_objectid, struct btrfs_dev_extent, |
| 2026 | chunk_objectid, 64); |
| 2027 | BTRFS_SETGET_FUNCS(dev_extent_chunk_offset, struct btrfs_dev_extent, |
| 2028 | chunk_offset, 64); |
| 2029 | BTRFS_SETGET_FUNCS(dev_extent_length, struct btrfs_dev_extent, length, 64); |
| 2030 | |
| 2031 | static inline u8 *btrfs_dev_extent_chunk_tree_uuid(struct btrfs_dev_extent *dev) |
| 2032 | { |
| 2033 | unsigned long ptr = offsetof(struct btrfs_dev_extent, chunk_tree_uuid); |
| 2034 | return (u8 *)((unsigned long)dev + ptr); |
| 2035 | } |
| 2036 | |
| 2037 | BTRFS_SETGET_FUNCS(extent_refs, struct btrfs_extent_item, refs, 64); |
| 2038 | BTRFS_SETGET_FUNCS(extent_generation, struct btrfs_extent_item, |
| 2039 | generation, 64); |
| 2040 | BTRFS_SETGET_FUNCS(extent_flags, struct btrfs_extent_item, flags, 64); |
| 2041 | |
| 2042 | BTRFS_SETGET_FUNCS(extent_refs_v0, struct btrfs_extent_item_v0, refs, 32); |
| 2043 | |
| 2044 | |
| 2045 | BTRFS_SETGET_FUNCS(tree_block_level, struct btrfs_tree_block_info, level, 8); |
| 2046 | |
| 2047 | static inline void btrfs_tree_block_key(struct extent_buffer *eb, |
| 2048 | struct btrfs_tree_block_info *item, |
| 2049 | struct btrfs_disk_key *key) |
| 2050 | { |
| 2051 | read_eb_member(eb, item, struct btrfs_tree_block_info, key, key); |
| 2052 | } |
| 2053 | |
| 2054 | static inline void btrfs_set_tree_block_key(struct extent_buffer *eb, |
| 2055 | struct btrfs_tree_block_info *item, |
| 2056 | struct btrfs_disk_key *key) |
| 2057 | { |
| 2058 | write_eb_member(eb, item, struct btrfs_tree_block_info, key, key); |
| 2059 | } |
| 2060 | |
| 2061 | BTRFS_SETGET_FUNCS(extent_data_ref_root, struct btrfs_extent_data_ref, |
| 2062 | root, 64); |
| 2063 | BTRFS_SETGET_FUNCS(extent_data_ref_objectid, struct btrfs_extent_data_ref, |
| 2064 | objectid, 64); |
| 2065 | BTRFS_SETGET_FUNCS(extent_data_ref_offset, struct btrfs_extent_data_ref, |
| 2066 | offset, 64); |
| 2067 | BTRFS_SETGET_FUNCS(extent_data_ref_count, struct btrfs_extent_data_ref, |
| 2068 | count, 32); |
| 2069 | |
| 2070 | BTRFS_SETGET_FUNCS(shared_data_ref_count, struct btrfs_shared_data_ref, |
| 2071 | count, 32); |
| 2072 | |
| 2073 | BTRFS_SETGET_FUNCS(extent_inline_ref_type, struct btrfs_extent_inline_ref, |
| 2074 | type, 8); |
| 2075 | BTRFS_SETGET_FUNCS(extent_inline_ref_offset, struct btrfs_extent_inline_ref, |
| 2076 | offset, 64); |
| 2077 | |
| 2078 | static inline u32 btrfs_extent_inline_ref_size(int type) |
| 2079 | { |
| 2080 | if (type == BTRFS_TREE_BLOCK_REF_KEY || |
| 2081 | type == BTRFS_SHARED_BLOCK_REF_KEY) |
| 2082 | return sizeof(struct btrfs_extent_inline_ref); |
| 2083 | if (type == BTRFS_SHARED_DATA_REF_KEY) |
| 2084 | return sizeof(struct btrfs_shared_data_ref) + |
| 2085 | sizeof(struct btrfs_extent_inline_ref); |
| 2086 | if (type == BTRFS_EXTENT_DATA_REF_KEY) |
| 2087 | return sizeof(struct btrfs_extent_data_ref) + |
| 2088 | offsetof(struct btrfs_extent_inline_ref, offset); |
| 2089 | BUG(); |
| 2090 | return 0; |
| 2091 | } |
| 2092 | |
| 2093 | BTRFS_SETGET_FUNCS(ref_root_v0, struct btrfs_extent_ref_v0, root, 64); |
| 2094 | BTRFS_SETGET_FUNCS(ref_generation_v0, struct btrfs_extent_ref_v0, |
| 2095 | generation, 64); |
| 2096 | BTRFS_SETGET_FUNCS(ref_objectid_v0, struct btrfs_extent_ref_v0, objectid, 64); |
| 2097 | BTRFS_SETGET_FUNCS(ref_count_v0, struct btrfs_extent_ref_v0, count, 32); |
| 2098 | |
| 2099 | /* struct btrfs_node */ |
| 2100 | BTRFS_SETGET_FUNCS(key_blockptr, struct btrfs_key_ptr, blockptr, 64); |
| 2101 | BTRFS_SETGET_FUNCS(key_generation, struct btrfs_key_ptr, generation, 64); |
| 2102 | |
| 2103 | static inline u64 btrfs_node_blockptr(struct extent_buffer *eb, int nr) |
| 2104 | { |
| 2105 | unsigned long ptr; |
| 2106 | ptr = offsetof(struct btrfs_node, ptrs) + |
| 2107 | sizeof(struct btrfs_key_ptr) * nr; |
| 2108 | return btrfs_key_blockptr(eb, (struct btrfs_key_ptr *)ptr); |
| 2109 | } |
| 2110 | |
| 2111 | static inline void btrfs_set_node_blockptr(struct extent_buffer *eb, |
| 2112 | int nr, u64 val) |
| 2113 | { |
| 2114 | unsigned long ptr; |
| 2115 | ptr = offsetof(struct btrfs_node, ptrs) + |
| 2116 | sizeof(struct btrfs_key_ptr) * nr; |
| 2117 | btrfs_set_key_blockptr(eb, (struct btrfs_key_ptr *)ptr, val); |
| 2118 | } |
| 2119 | |
| 2120 | static inline u64 btrfs_node_ptr_generation(struct extent_buffer *eb, int nr) |
| 2121 | { |
| 2122 | unsigned long ptr; |
| 2123 | ptr = offsetof(struct btrfs_node, ptrs) + |
| 2124 | sizeof(struct btrfs_key_ptr) * nr; |
| 2125 | return btrfs_key_generation(eb, (struct btrfs_key_ptr *)ptr); |
| 2126 | } |
| 2127 | |
| 2128 | static inline void btrfs_set_node_ptr_generation(struct extent_buffer *eb, |
| 2129 | int nr, u64 val) |
| 2130 | { |
| 2131 | unsigned long ptr; |
| 2132 | ptr = offsetof(struct btrfs_node, ptrs) + |
| 2133 | sizeof(struct btrfs_key_ptr) * nr; |
| 2134 | btrfs_set_key_generation(eb, (struct btrfs_key_ptr *)ptr, val); |
| 2135 | } |
| 2136 | |
| 2137 | static inline unsigned long btrfs_node_key_ptr_offset(int nr) |
| 2138 | { |
| 2139 | return offsetof(struct btrfs_node, ptrs) + |
| 2140 | sizeof(struct btrfs_key_ptr) * nr; |
| 2141 | } |
| 2142 | |
| 2143 | void btrfs_node_key(struct extent_buffer *eb, |
| 2144 | struct btrfs_disk_key *disk_key, int nr); |
| 2145 | |
| 2146 | static inline void btrfs_set_node_key(struct extent_buffer *eb, |
| 2147 | struct btrfs_disk_key *disk_key, int nr) |
| 2148 | { |
| 2149 | unsigned long ptr; |
| 2150 | ptr = btrfs_node_key_ptr_offset(nr); |
| 2151 | write_eb_member(eb, (struct btrfs_key_ptr *)ptr, |
| 2152 | struct btrfs_key_ptr, key, disk_key); |
| 2153 | } |
| 2154 | |
| 2155 | /* struct btrfs_item */ |
| 2156 | BTRFS_SETGET_FUNCS(item_offset, struct btrfs_item, offset, 32); |
| 2157 | BTRFS_SETGET_FUNCS(item_size, struct btrfs_item, size, 32); |
| 2158 | |
| 2159 | static inline unsigned long btrfs_item_nr_offset(int nr) |
| 2160 | { |
| 2161 | return offsetof(struct btrfs_leaf, items) + |
| 2162 | sizeof(struct btrfs_item) * nr; |
| 2163 | } |
| 2164 | |
| 2165 | static inline struct btrfs_item *btrfs_item_nr(struct extent_buffer *eb, |
| 2166 | int nr) |
| 2167 | { |
| 2168 | return (struct btrfs_item *)btrfs_item_nr_offset(nr); |
| 2169 | } |
| 2170 | |
| 2171 | static inline u32 btrfs_item_end(struct extent_buffer *eb, |
| 2172 | struct btrfs_item *item) |
| 2173 | { |
| 2174 | return btrfs_item_offset(eb, item) + btrfs_item_size(eb, item); |
| 2175 | } |
| 2176 | |
| 2177 | static inline u32 btrfs_item_end_nr(struct extent_buffer *eb, int nr) |
| 2178 | { |
| 2179 | return btrfs_item_end(eb, btrfs_item_nr(eb, nr)); |
| 2180 | } |
| 2181 | |
| 2182 | static inline u32 btrfs_item_offset_nr(struct extent_buffer *eb, int nr) |
| 2183 | { |
| 2184 | return btrfs_item_offset(eb, btrfs_item_nr(eb, nr)); |
| 2185 | } |
| 2186 | |
| 2187 | static inline u32 btrfs_item_size_nr(struct extent_buffer *eb, int nr) |
| 2188 | { |
| 2189 | return btrfs_item_size(eb, btrfs_item_nr(eb, nr)); |
| 2190 | } |
| 2191 | |
| 2192 | static inline void btrfs_item_key(struct extent_buffer *eb, |
| 2193 | struct btrfs_disk_key *disk_key, int nr) |
| 2194 | { |
| 2195 | struct btrfs_item *item = btrfs_item_nr(eb, nr); |
| 2196 | read_eb_member(eb, item, struct btrfs_item, key, disk_key); |
| 2197 | } |
| 2198 | |
| 2199 | static inline void btrfs_set_item_key(struct extent_buffer *eb, |
| 2200 | struct btrfs_disk_key *disk_key, int nr) |
| 2201 | { |
| 2202 | struct btrfs_item *item = btrfs_item_nr(eb, nr); |
| 2203 | write_eb_member(eb, item, struct btrfs_item, key, disk_key); |
| 2204 | } |
| 2205 | |
| 2206 | BTRFS_SETGET_FUNCS(dir_log_end, struct btrfs_dir_log_item, end, 64); |
| 2207 | |
| 2208 | /* |
| 2209 | * struct btrfs_root_ref |
| 2210 | */ |
| 2211 | BTRFS_SETGET_FUNCS(root_ref_dirid, struct btrfs_root_ref, dirid, 64); |
| 2212 | BTRFS_SETGET_FUNCS(root_ref_sequence, struct btrfs_root_ref, sequence, 64); |
| 2213 | BTRFS_SETGET_FUNCS(root_ref_name_len, struct btrfs_root_ref, name_len, 16); |
| 2214 | |
| 2215 | /* struct btrfs_dir_item */ |
| 2216 | BTRFS_SETGET_FUNCS(dir_data_len, struct btrfs_dir_item, data_len, 16); |
| 2217 | BTRFS_SETGET_FUNCS(dir_type, struct btrfs_dir_item, type, 8); |
| 2218 | BTRFS_SETGET_FUNCS(dir_name_len, struct btrfs_dir_item, name_len, 16); |
| 2219 | BTRFS_SETGET_FUNCS(dir_transid, struct btrfs_dir_item, transid, 64); |
| 2220 | |
| 2221 | static inline void btrfs_dir_item_key(struct extent_buffer *eb, |
| 2222 | struct btrfs_dir_item *item, |
| 2223 | struct btrfs_disk_key *key) |
| 2224 | { |
| 2225 | read_eb_member(eb, item, struct btrfs_dir_item, location, key); |
| 2226 | } |
| 2227 | |
| 2228 | static inline void btrfs_set_dir_item_key(struct extent_buffer *eb, |
| 2229 | struct btrfs_dir_item *item, |
| 2230 | struct btrfs_disk_key *key) |
| 2231 | { |
| 2232 | write_eb_member(eb, item, struct btrfs_dir_item, location, key); |
| 2233 | } |
| 2234 | |
| 2235 | BTRFS_SETGET_FUNCS(free_space_entries, struct btrfs_free_space_header, |
| 2236 | num_entries, 64); |
| 2237 | BTRFS_SETGET_FUNCS(free_space_bitmaps, struct btrfs_free_space_header, |
| 2238 | num_bitmaps, 64); |
| 2239 | BTRFS_SETGET_FUNCS(free_space_generation, struct btrfs_free_space_header, |
| 2240 | generation, 64); |
| 2241 | |
| 2242 | static inline void btrfs_free_space_key(struct extent_buffer *eb, |
| 2243 | struct btrfs_free_space_header *h, |
| 2244 | struct btrfs_disk_key *key) |
| 2245 | { |
| 2246 | read_eb_member(eb, h, struct btrfs_free_space_header, location, key); |
| 2247 | } |
| 2248 | |
| 2249 | static inline void btrfs_set_free_space_key(struct extent_buffer *eb, |
| 2250 | struct btrfs_free_space_header *h, |
| 2251 | struct btrfs_disk_key *key) |
| 2252 | { |
| 2253 | write_eb_member(eb, h, struct btrfs_free_space_header, location, key); |
| 2254 | } |
| 2255 | |
| 2256 | /* struct btrfs_disk_key */ |
| 2257 | BTRFS_SETGET_STACK_FUNCS(disk_key_objectid, struct btrfs_disk_key, |
| 2258 | objectid, 64); |
| 2259 | BTRFS_SETGET_STACK_FUNCS(disk_key_offset, struct btrfs_disk_key, offset, 64); |
| 2260 | BTRFS_SETGET_STACK_FUNCS(disk_key_type, struct btrfs_disk_key, type, 8); |
| 2261 | |
| 2262 | static inline void btrfs_disk_key_to_cpu(struct btrfs_key *cpu, |
| 2263 | struct btrfs_disk_key *disk) |
| 2264 | { |
| 2265 | cpu->offset = le64_to_cpu(disk->offset); |
| 2266 | cpu->type = disk->type; |
| 2267 | cpu->objectid = le64_to_cpu(disk->objectid); |
| 2268 | } |
| 2269 | |
| 2270 | static inline void btrfs_cpu_key_to_disk(struct btrfs_disk_key *disk, |
| 2271 | struct btrfs_key *cpu) |
| 2272 | { |
| 2273 | disk->offset = cpu_to_le64(cpu->offset); |
| 2274 | disk->type = cpu->type; |
| 2275 | disk->objectid = cpu_to_le64(cpu->objectid); |
| 2276 | } |
| 2277 | |
| 2278 | static inline void btrfs_node_key_to_cpu(struct extent_buffer *eb, |
| 2279 | struct btrfs_key *key, int nr) |
| 2280 | { |
| 2281 | struct btrfs_disk_key disk_key; |
| 2282 | btrfs_node_key(eb, &disk_key, nr); |
| 2283 | btrfs_disk_key_to_cpu(key, &disk_key); |
| 2284 | } |
| 2285 | |
| 2286 | static inline void btrfs_item_key_to_cpu(struct extent_buffer *eb, |
| 2287 | struct btrfs_key *key, int nr) |
| 2288 | { |
| 2289 | struct btrfs_disk_key disk_key; |
| 2290 | btrfs_item_key(eb, &disk_key, nr); |
| 2291 | btrfs_disk_key_to_cpu(key, &disk_key); |
| 2292 | } |
| 2293 | |
| 2294 | static inline void btrfs_dir_item_key_to_cpu(struct extent_buffer *eb, |
| 2295 | struct btrfs_dir_item *item, |
| 2296 | struct btrfs_key *key) |
| 2297 | { |
| 2298 | struct btrfs_disk_key disk_key; |
| 2299 | btrfs_dir_item_key(eb, item, &disk_key); |
| 2300 | btrfs_disk_key_to_cpu(key, &disk_key); |
| 2301 | } |
| 2302 | |
| 2303 | |
| 2304 | static inline u8 btrfs_key_type(struct btrfs_key *key) |
| 2305 | { |
| 2306 | return key->type; |
| 2307 | } |
| 2308 | |
| 2309 | static inline void btrfs_set_key_type(struct btrfs_key *key, u8 val) |
| 2310 | { |
| 2311 | key->type = val; |
| 2312 | } |
| 2313 | |
| 2314 | /* struct btrfs_header */ |
| 2315 | BTRFS_SETGET_HEADER_FUNCS(header_bytenr, struct btrfs_header, bytenr, 64); |
| 2316 | BTRFS_SETGET_HEADER_FUNCS(header_generation, struct btrfs_header, |
| 2317 | generation, 64); |
| 2318 | BTRFS_SETGET_HEADER_FUNCS(header_owner, struct btrfs_header, owner, 64); |
| 2319 | BTRFS_SETGET_HEADER_FUNCS(header_nritems, struct btrfs_header, nritems, 32); |
| 2320 | BTRFS_SETGET_HEADER_FUNCS(header_flags, struct btrfs_header, flags, 64); |
| 2321 | BTRFS_SETGET_HEADER_FUNCS(header_level, struct btrfs_header, level, 8); |
| 2322 | |
| 2323 | static inline int btrfs_header_flag(struct extent_buffer *eb, u64 flag) |
| 2324 | { |
| 2325 | return (btrfs_header_flags(eb) & flag) == flag; |
| 2326 | } |
| 2327 | |
| 2328 | static inline int btrfs_set_header_flag(struct extent_buffer *eb, u64 flag) |
| 2329 | { |
| 2330 | u64 flags = btrfs_header_flags(eb); |
| 2331 | btrfs_set_header_flags(eb, flags | flag); |
| 2332 | return (flags & flag) == flag; |
| 2333 | } |
| 2334 | |
| 2335 | static inline int btrfs_clear_header_flag(struct extent_buffer *eb, u64 flag) |
| 2336 | { |
| 2337 | u64 flags = btrfs_header_flags(eb); |
| 2338 | btrfs_set_header_flags(eb, flags & ~flag); |
| 2339 | return (flags & flag) == flag; |
| 2340 | } |
| 2341 | |
| 2342 | static inline int btrfs_header_backref_rev(struct extent_buffer *eb) |
| 2343 | { |
| 2344 | u64 flags = btrfs_header_flags(eb); |
| 2345 | return flags >> BTRFS_BACKREF_REV_SHIFT; |
| 2346 | } |
| 2347 | |
| 2348 | static inline void btrfs_set_header_backref_rev(struct extent_buffer *eb, |
| 2349 | int rev) |
| 2350 | { |
| 2351 | u64 flags = btrfs_header_flags(eb); |
| 2352 | flags &= ~BTRFS_BACKREF_REV_MASK; |
| 2353 | flags |= (u64)rev << BTRFS_BACKREF_REV_SHIFT; |
| 2354 | btrfs_set_header_flags(eb, flags); |
| 2355 | } |
| 2356 | |
| 2357 | static inline u8 *btrfs_header_fsid(struct extent_buffer *eb) |
| 2358 | { |
| 2359 | unsigned long ptr = offsetof(struct btrfs_header, fsid); |
| 2360 | return (u8 *)ptr; |
| 2361 | } |
| 2362 | |
| 2363 | static inline u8 *btrfs_header_chunk_tree_uuid(struct extent_buffer *eb) |
| 2364 | { |
| 2365 | unsigned long ptr = offsetof(struct btrfs_header, chunk_tree_uuid); |
| 2366 | return (u8 *)ptr; |
| 2367 | } |
| 2368 | |
| 2369 | static inline int btrfs_is_leaf(struct extent_buffer *eb) |
| 2370 | { |
| 2371 | return btrfs_header_level(eb) == 0; |
| 2372 | } |
| 2373 | |
| 2374 | /* struct btrfs_root_item */ |
| 2375 | BTRFS_SETGET_FUNCS(disk_root_generation, struct btrfs_root_item, |
| 2376 | generation, 64); |
| 2377 | BTRFS_SETGET_FUNCS(disk_root_refs, struct btrfs_root_item, refs, 32); |
| 2378 | BTRFS_SETGET_FUNCS(disk_root_bytenr, struct btrfs_root_item, bytenr, 64); |
| 2379 | BTRFS_SETGET_FUNCS(disk_root_level, struct btrfs_root_item, level, 8); |
| 2380 | |
| 2381 | BTRFS_SETGET_STACK_FUNCS(root_generation, struct btrfs_root_item, |
| 2382 | generation, 64); |
| 2383 | BTRFS_SETGET_STACK_FUNCS(root_bytenr, struct btrfs_root_item, bytenr, 64); |
| 2384 | BTRFS_SETGET_STACK_FUNCS(root_level, struct btrfs_root_item, level, 8); |
| 2385 | BTRFS_SETGET_STACK_FUNCS(root_dirid, struct btrfs_root_item, root_dirid, 64); |
| 2386 | BTRFS_SETGET_STACK_FUNCS(root_refs, struct btrfs_root_item, refs, 32); |
| 2387 | BTRFS_SETGET_STACK_FUNCS(root_flags, struct btrfs_root_item, flags, 64); |
| 2388 | BTRFS_SETGET_STACK_FUNCS(root_used, struct btrfs_root_item, bytes_used, 64); |
| 2389 | BTRFS_SETGET_STACK_FUNCS(root_limit, struct btrfs_root_item, byte_limit, 64); |
| 2390 | BTRFS_SETGET_STACK_FUNCS(root_last_snapshot, struct btrfs_root_item, |
| 2391 | last_snapshot, 64); |
| 2392 | BTRFS_SETGET_STACK_FUNCS(root_generation_v2, struct btrfs_root_item, |
| 2393 | generation_v2, 64); |
| 2394 | BTRFS_SETGET_STACK_FUNCS(root_ctransid, struct btrfs_root_item, |
| 2395 | ctransid, 64); |
| 2396 | BTRFS_SETGET_STACK_FUNCS(root_otransid, struct btrfs_root_item, |
| 2397 | otransid, 64); |
| 2398 | BTRFS_SETGET_STACK_FUNCS(root_stransid, struct btrfs_root_item, |
| 2399 | stransid, 64); |
| 2400 | BTRFS_SETGET_STACK_FUNCS(root_rtransid, struct btrfs_root_item, |
| 2401 | rtransid, 64); |
| 2402 | |
| 2403 | static inline bool btrfs_root_readonly(struct btrfs_root *root) |
| 2404 | { |
| 2405 | return (root->root_item.flags & cpu_to_le64(BTRFS_ROOT_SUBVOL_RDONLY)) != 0; |
| 2406 | } |
| 2407 | |
| 2408 | /* struct btrfs_root_backup */ |
| 2409 | BTRFS_SETGET_STACK_FUNCS(backup_tree_root, struct btrfs_root_backup, |
| 2410 | tree_root, 64); |
| 2411 | BTRFS_SETGET_STACK_FUNCS(backup_tree_root_gen, struct btrfs_root_backup, |
| 2412 | tree_root_gen, 64); |
| 2413 | BTRFS_SETGET_STACK_FUNCS(backup_tree_root_level, struct btrfs_root_backup, |
| 2414 | tree_root_level, 8); |
| 2415 | |
| 2416 | BTRFS_SETGET_STACK_FUNCS(backup_chunk_root, struct btrfs_root_backup, |
| 2417 | chunk_root, 64); |
| 2418 | BTRFS_SETGET_STACK_FUNCS(backup_chunk_root_gen, struct btrfs_root_backup, |
| 2419 | chunk_root_gen, 64); |
| 2420 | BTRFS_SETGET_STACK_FUNCS(backup_chunk_root_level, struct btrfs_root_backup, |
| 2421 | chunk_root_level, 8); |
| 2422 | |
| 2423 | BTRFS_SETGET_STACK_FUNCS(backup_extent_root, struct btrfs_root_backup, |
| 2424 | extent_root, 64); |
| 2425 | BTRFS_SETGET_STACK_FUNCS(backup_extent_root_gen, struct btrfs_root_backup, |
| 2426 | extent_root_gen, 64); |
| 2427 | BTRFS_SETGET_STACK_FUNCS(backup_extent_root_level, struct btrfs_root_backup, |
| 2428 | extent_root_level, 8); |
| 2429 | |
| 2430 | BTRFS_SETGET_STACK_FUNCS(backup_fs_root, struct btrfs_root_backup, |
| 2431 | fs_root, 64); |
| 2432 | BTRFS_SETGET_STACK_FUNCS(backup_fs_root_gen, struct btrfs_root_backup, |
| 2433 | fs_root_gen, 64); |
| 2434 | BTRFS_SETGET_STACK_FUNCS(backup_fs_root_level, struct btrfs_root_backup, |
| 2435 | fs_root_level, 8); |
| 2436 | |
| 2437 | BTRFS_SETGET_STACK_FUNCS(backup_dev_root, struct btrfs_root_backup, |
| 2438 | dev_root, 64); |
| 2439 | BTRFS_SETGET_STACK_FUNCS(backup_dev_root_gen, struct btrfs_root_backup, |
| 2440 | dev_root_gen, 64); |
| 2441 | BTRFS_SETGET_STACK_FUNCS(backup_dev_root_level, struct btrfs_root_backup, |
| 2442 | dev_root_level, 8); |
| 2443 | |
| 2444 | BTRFS_SETGET_STACK_FUNCS(backup_csum_root, struct btrfs_root_backup, |
| 2445 | csum_root, 64); |
| 2446 | BTRFS_SETGET_STACK_FUNCS(backup_csum_root_gen, struct btrfs_root_backup, |
| 2447 | csum_root_gen, 64); |
| 2448 | BTRFS_SETGET_STACK_FUNCS(backup_csum_root_level, struct btrfs_root_backup, |
| 2449 | csum_root_level, 8); |
| 2450 | BTRFS_SETGET_STACK_FUNCS(backup_total_bytes, struct btrfs_root_backup, |
| 2451 | total_bytes, 64); |
| 2452 | BTRFS_SETGET_STACK_FUNCS(backup_bytes_used, struct btrfs_root_backup, |
| 2453 | bytes_used, 64); |
| 2454 | BTRFS_SETGET_STACK_FUNCS(backup_num_devices, struct btrfs_root_backup, |
| 2455 | num_devices, 64); |
| 2456 | |
| 2457 | /* struct btrfs_balance_item */ |
| 2458 | BTRFS_SETGET_FUNCS(balance_flags, struct btrfs_balance_item, flags, 64); |
| 2459 | |
| 2460 | static inline void btrfs_balance_data(struct extent_buffer *eb, |
| 2461 | struct btrfs_balance_item *bi, |
| 2462 | struct btrfs_disk_balance_args *ba) |
| 2463 | { |
| 2464 | read_eb_member(eb, bi, struct btrfs_balance_item, data, ba); |
| 2465 | } |
| 2466 | |
| 2467 | static inline void btrfs_set_balance_data(struct extent_buffer *eb, |
| 2468 | struct btrfs_balance_item *bi, |
| 2469 | struct btrfs_disk_balance_args *ba) |
| 2470 | { |
| 2471 | write_eb_member(eb, bi, struct btrfs_balance_item, data, ba); |
| 2472 | } |
| 2473 | |
| 2474 | static inline void btrfs_balance_meta(struct extent_buffer *eb, |
| 2475 | struct btrfs_balance_item *bi, |
| 2476 | struct btrfs_disk_balance_args *ba) |
| 2477 | { |
| 2478 | read_eb_member(eb, bi, struct btrfs_balance_item, meta, ba); |
| 2479 | } |
| 2480 | |
| 2481 | static inline void btrfs_set_balance_meta(struct extent_buffer *eb, |
| 2482 | struct btrfs_balance_item *bi, |
| 2483 | struct btrfs_disk_balance_args *ba) |
| 2484 | { |
| 2485 | write_eb_member(eb, bi, struct btrfs_balance_item, meta, ba); |
| 2486 | } |
| 2487 | |
| 2488 | static inline void btrfs_balance_sys(struct extent_buffer *eb, |
| 2489 | struct btrfs_balance_item *bi, |
| 2490 | struct btrfs_disk_balance_args *ba) |
| 2491 | { |
| 2492 | read_eb_member(eb, bi, struct btrfs_balance_item, sys, ba); |
| 2493 | } |
| 2494 | |
| 2495 | static inline void btrfs_set_balance_sys(struct extent_buffer *eb, |
| 2496 | struct btrfs_balance_item *bi, |
| 2497 | struct btrfs_disk_balance_args *ba) |
| 2498 | { |
| 2499 | write_eb_member(eb, bi, struct btrfs_balance_item, sys, ba); |
| 2500 | } |
| 2501 | |
| 2502 | static inline void |
| 2503 | btrfs_disk_balance_args_to_cpu(struct btrfs_balance_args *cpu, |
| 2504 | struct btrfs_disk_balance_args *disk) |
| 2505 | { |
| 2506 | memset(cpu, 0, sizeof(*cpu)); |
| 2507 | |
| 2508 | cpu->profiles = le64_to_cpu(disk->profiles); |
| 2509 | cpu->usage = le64_to_cpu(disk->usage); |
| 2510 | cpu->devid = le64_to_cpu(disk->devid); |
| 2511 | cpu->pstart = le64_to_cpu(disk->pstart); |
| 2512 | cpu->pend = le64_to_cpu(disk->pend); |
| 2513 | cpu->vstart = le64_to_cpu(disk->vstart); |
| 2514 | cpu->vend = le64_to_cpu(disk->vend); |
| 2515 | cpu->target = le64_to_cpu(disk->target); |
| 2516 | cpu->flags = le64_to_cpu(disk->flags); |
| 2517 | } |
| 2518 | |
| 2519 | static inline void |
| 2520 | btrfs_cpu_balance_args_to_disk(struct btrfs_disk_balance_args *disk, |
| 2521 | struct btrfs_balance_args *cpu) |
| 2522 | { |
| 2523 | memset(disk, 0, sizeof(*disk)); |
| 2524 | |
| 2525 | disk->profiles = cpu_to_le64(cpu->profiles); |
| 2526 | disk->usage = cpu_to_le64(cpu->usage); |
| 2527 | disk->devid = cpu_to_le64(cpu->devid); |
| 2528 | disk->pstart = cpu_to_le64(cpu->pstart); |
| 2529 | disk->pend = cpu_to_le64(cpu->pend); |
| 2530 | disk->vstart = cpu_to_le64(cpu->vstart); |
| 2531 | disk->vend = cpu_to_le64(cpu->vend); |
| 2532 | disk->target = cpu_to_le64(cpu->target); |
| 2533 | disk->flags = cpu_to_le64(cpu->flags); |
| 2534 | } |
| 2535 | |
| 2536 | /* struct btrfs_super_block */ |
| 2537 | BTRFS_SETGET_STACK_FUNCS(super_bytenr, struct btrfs_super_block, bytenr, 64); |
| 2538 | BTRFS_SETGET_STACK_FUNCS(super_flags, struct btrfs_super_block, flags, 64); |
| 2539 | BTRFS_SETGET_STACK_FUNCS(super_generation, struct btrfs_super_block, |
| 2540 | generation, 64); |
| 2541 | BTRFS_SETGET_STACK_FUNCS(super_root, struct btrfs_super_block, root, 64); |
| 2542 | BTRFS_SETGET_STACK_FUNCS(super_sys_array_size, |
| 2543 | struct btrfs_super_block, sys_chunk_array_size, 32); |
| 2544 | BTRFS_SETGET_STACK_FUNCS(super_chunk_root_generation, |
| 2545 | struct btrfs_super_block, chunk_root_generation, 64); |
| 2546 | BTRFS_SETGET_STACK_FUNCS(super_root_level, struct btrfs_super_block, |
| 2547 | root_level, 8); |
| 2548 | BTRFS_SETGET_STACK_FUNCS(super_chunk_root, struct btrfs_super_block, |
| 2549 | chunk_root, 64); |
| 2550 | BTRFS_SETGET_STACK_FUNCS(super_chunk_root_level, struct btrfs_super_block, |
| 2551 | chunk_root_level, 8); |
| 2552 | BTRFS_SETGET_STACK_FUNCS(super_log_root, struct btrfs_super_block, |
| 2553 | log_root, 64); |
| 2554 | BTRFS_SETGET_STACK_FUNCS(super_log_root_transid, struct btrfs_super_block, |
| 2555 | log_root_transid, 64); |
| 2556 | BTRFS_SETGET_STACK_FUNCS(super_log_root_level, struct btrfs_super_block, |
| 2557 | log_root_level, 8); |
| 2558 | BTRFS_SETGET_STACK_FUNCS(super_total_bytes, struct btrfs_super_block, |
| 2559 | total_bytes, 64); |
| 2560 | BTRFS_SETGET_STACK_FUNCS(super_bytes_used, struct btrfs_super_block, |
| 2561 | bytes_used, 64); |
| 2562 | BTRFS_SETGET_STACK_FUNCS(super_sectorsize, struct btrfs_super_block, |
| 2563 | sectorsize, 32); |
| 2564 | BTRFS_SETGET_STACK_FUNCS(super_nodesize, struct btrfs_super_block, |
| 2565 | nodesize, 32); |
| 2566 | BTRFS_SETGET_STACK_FUNCS(super_leafsize, struct btrfs_super_block, |
| 2567 | leafsize, 32); |
| 2568 | BTRFS_SETGET_STACK_FUNCS(super_stripesize, struct btrfs_super_block, |
| 2569 | stripesize, 32); |
| 2570 | BTRFS_SETGET_STACK_FUNCS(super_root_dir, struct btrfs_super_block, |
| 2571 | root_dir_objectid, 64); |
| 2572 | BTRFS_SETGET_STACK_FUNCS(super_num_devices, struct btrfs_super_block, |
| 2573 | num_devices, 64); |
| 2574 | BTRFS_SETGET_STACK_FUNCS(super_compat_flags, struct btrfs_super_block, |
| 2575 | compat_flags, 64); |
| 2576 | BTRFS_SETGET_STACK_FUNCS(super_compat_ro_flags, struct btrfs_super_block, |
| 2577 | compat_ro_flags, 64); |
| 2578 | BTRFS_SETGET_STACK_FUNCS(super_incompat_flags, struct btrfs_super_block, |
| 2579 | incompat_flags, 64); |
| 2580 | BTRFS_SETGET_STACK_FUNCS(super_csum_type, struct btrfs_super_block, |
| 2581 | csum_type, 16); |
| 2582 | BTRFS_SETGET_STACK_FUNCS(super_cache_generation, struct btrfs_super_block, |
| 2583 | cache_generation, 64); |
| 2584 | |
| 2585 | static inline int btrfs_super_csum_size(struct btrfs_super_block *s) |
| 2586 | { |
| 2587 | int t = btrfs_super_csum_type(s); |
| 2588 | BUG_ON(t >= ARRAY_SIZE(btrfs_csum_sizes)); |
| 2589 | return btrfs_csum_sizes[t]; |
| 2590 | } |
| 2591 | |
| 2592 | static inline unsigned long btrfs_leaf_data(struct extent_buffer *l) |
| 2593 | { |
| 2594 | return offsetof(struct btrfs_leaf, items); |
| 2595 | } |
| 2596 | |
| 2597 | /* struct btrfs_file_extent_item */ |
| 2598 | BTRFS_SETGET_FUNCS(file_extent_type, struct btrfs_file_extent_item, type, 8); |
| 2599 | |
| 2600 | static inline unsigned long |
| 2601 | btrfs_file_extent_inline_start(struct btrfs_file_extent_item *e) |
| 2602 | { |
| 2603 | unsigned long offset = (unsigned long)e; |
| 2604 | offset += offsetof(struct btrfs_file_extent_item, disk_bytenr); |
| 2605 | return offset; |
| 2606 | } |
| 2607 | |
| 2608 | static inline u32 btrfs_file_extent_calc_inline_size(u32 datasize) |
| 2609 | { |
| 2610 | return offsetof(struct btrfs_file_extent_item, disk_bytenr) + datasize; |
| 2611 | } |
| 2612 | |
| 2613 | BTRFS_SETGET_FUNCS(file_extent_disk_bytenr, struct btrfs_file_extent_item, |
| 2614 | disk_bytenr, 64); |
| 2615 | BTRFS_SETGET_FUNCS(file_extent_generation, struct btrfs_file_extent_item, |
| 2616 | generation, 64); |
| 2617 | BTRFS_SETGET_FUNCS(file_extent_disk_num_bytes, struct btrfs_file_extent_item, |
| 2618 | disk_num_bytes, 64); |
| 2619 | BTRFS_SETGET_FUNCS(file_extent_offset, struct btrfs_file_extent_item, |
| 2620 | offset, 64); |
| 2621 | BTRFS_SETGET_FUNCS(file_extent_num_bytes, struct btrfs_file_extent_item, |
| 2622 | num_bytes, 64); |
| 2623 | BTRFS_SETGET_FUNCS(file_extent_ram_bytes, struct btrfs_file_extent_item, |
| 2624 | ram_bytes, 64); |
| 2625 | BTRFS_SETGET_FUNCS(file_extent_compression, struct btrfs_file_extent_item, |
| 2626 | compression, 8); |
| 2627 | BTRFS_SETGET_FUNCS(file_extent_encryption, struct btrfs_file_extent_item, |
| 2628 | encryption, 8); |
| 2629 | BTRFS_SETGET_FUNCS(file_extent_other_encoding, struct btrfs_file_extent_item, |
| 2630 | other_encoding, 16); |
| 2631 | |
| 2632 | /* this returns the number of file bytes represented by the inline item. |
| 2633 | * If an item is compressed, this is the uncompressed size |
| 2634 | */ |
| 2635 | static inline u32 btrfs_file_extent_inline_len(struct extent_buffer *eb, |
| 2636 | struct btrfs_file_extent_item *e) |
| 2637 | { |
| 2638 | return btrfs_file_extent_ram_bytes(eb, e); |
| 2639 | } |
| 2640 | |
| 2641 | /* |
| 2642 | * this returns the number of bytes used by the item on disk, minus the |
| 2643 | * size of any extent headers. If a file is compressed on disk, this is |
| 2644 | * the compressed size |
| 2645 | */ |
| 2646 | static inline u32 btrfs_file_extent_inline_item_len(struct extent_buffer *eb, |
| 2647 | struct btrfs_item *e) |
| 2648 | { |
| 2649 | unsigned long offset; |
| 2650 | offset = offsetof(struct btrfs_file_extent_item, disk_bytenr); |
| 2651 | return btrfs_item_size(eb, e) - offset; |
| 2652 | } |
| 2653 | |
| 2654 | /* btrfs_dev_stats_item */ |
| 2655 | static inline u64 btrfs_dev_stats_value(struct extent_buffer *eb, |
| 2656 | struct btrfs_dev_stats_item *ptr, |
| 2657 | int index) |
| 2658 | { |
| 2659 | u64 val; |
| 2660 | |
| 2661 | read_extent_buffer(eb, &val, |
| 2662 | offsetof(struct btrfs_dev_stats_item, values) + |
| 2663 | ((unsigned long)ptr) + (index * sizeof(u64)), |
| 2664 | sizeof(val)); |
| 2665 | return val; |
| 2666 | } |
| 2667 | |
| 2668 | static inline void btrfs_set_dev_stats_value(struct extent_buffer *eb, |
| 2669 | struct btrfs_dev_stats_item *ptr, |
| 2670 | int index, u64 val) |
| 2671 | { |
| 2672 | write_extent_buffer(eb, &val, |
| 2673 | offsetof(struct btrfs_dev_stats_item, values) + |
| 2674 | ((unsigned long)ptr) + (index * sizeof(u64)), |
| 2675 | sizeof(val)); |
| 2676 | } |
| 2677 | |
| 2678 | /* btrfs_qgroup_status_item */ |
| 2679 | BTRFS_SETGET_FUNCS(qgroup_status_generation, struct btrfs_qgroup_status_item, |
| 2680 | generation, 64); |
| 2681 | BTRFS_SETGET_FUNCS(qgroup_status_version, struct btrfs_qgroup_status_item, |
| 2682 | version, 64); |
| 2683 | BTRFS_SETGET_FUNCS(qgroup_status_flags, struct btrfs_qgroup_status_item, |
| 2684 | flags, 64); |
| 2685 | BTRFS_SETGET_FUNCS(qgroup_status_scan, struct btrfs_qgroup_status_item, |
| 2686 | scan, 64); |
| 2687 | |
| 2688 | /* btrfs_qgroup_info_item */ |
| 2689 | BTRFS_SETGET_FUNCS(qgroup_info_generation, struct btrfs_qgroup_info_item, |
| 2690 | generation, 64); |
| 2691 | BTRFS_SETGET_FUNCS(qgroup_info_rfer, struct btrfs_qgroup_info_item, rfer, 64); |
| 2692 | BTRFS_SETGET_FUNCS(qgroup_info_rfer_cmpr, struct btrfs_qgroup_info_item, |
| 2693 | rfer_cmpr, 64); |
| 2694 | BTRFS_SETGET_FUNCS(qgroup_info_excl, struct btrfs_qgroup_info_item, excl, 64); |
| 2695 | BTRFS_SETGET_FUNCS(qgroup_info_excl_cmpr, struct btrfs_qgroup_info_item, |
| 2696 | excl_cmpr, 64); |
| 2697 | |
| 2698 | BTRFS_SETGET_STACK_FUNCS(stack_qgroup_info_generation, |
| 2699 | struct btrfs_qgroup_info_item, generation, 64); |
| 2700 | BTRFS_SETGET_STACK_FUNCS(stack_qgroup_info_rfer, struct btrfs_qgroup_info_item, |
| 2701 | rfer, 64); |
| 2702 | BTRFS_SETGET_STACK_FUNCS(stack_qgroup_info_rfer_cmpr, |
| 2703 | struct btrfs_qgroup_info_item, rfer_cmpr, 64); |
| 2704 | BTRFS_SETGET_STACK_FUNCS(stack_qgroup_info_excl, struct btrfs_qgroup_info_item, |
| 2705 | excl, 64); |
| 2706 | BTRFS_SETGET_STACK_FUNCS(stack_qgroup_info_excl_cmpr, |
| 2707 | struct btrfs_qgroup_info_item, excl_cmpr, 64); |
| 2708 | |
| 2709 | /* btrfs_qgroup_limit_item */ |
| 2710 | BTRFS_SETGET_FUNCS(qgroup_limit_flags, struct btrfs_qgroup_limit_item, |
| 2711 | flags, 64); |
| 2712 | BTRFS_SETGET_FUNCS(qgroup_limit_max_rfer, struct btrfs_qgroup_limit_item, |
| 2713 | max_rfer, 64); |
| 2714 | BTRFS_SETGET_FUNCS(qgroup_limit_max_excl, struct btrfs_qgroup_limit_item, |
| 2715 | max_excl, 64); |
| 2716 | BTRFS_SETGET_FUNCS(qgroup_limit_rsv_rfer, struct btrfs_qgroup_limit_item, |
| 2717 | rsv_rfer, 64); |
| 2718 | BTRFS_SETGET_FUNCS(qgroup_limit_rsv_excl, struct btrfs_qgroup_limit_item, |
| 2719 | rsv_excl, 64); |
| 2720 | |
| 2721 | static inline struct btrfs_fs_info *btrfs_sb(struct super_block *sb) |
| 2722 | { |
| 2723 | return sb->s_fs_info; |
| 2724 | } |
| 2725 | |
| 2726 | static inline u32 btrfs_level_size(struct btrfs_root *root, int level) |
| 2727 | { |
| 2728 | if (level == 0) |
| 2729 | return root->leafsize; |
| 2730 | return root->nodesize; |
| 2731 | } |
| 2732 | |
| 2733 | /* helper function to cast into the data area of the leaf. */ |
| 2734 | #define btrfs_item_ptr(leaf, slot, type) \ |
| 2735 | ((type *)(btrfs_leaf_data(leaf) + \ |
| 2736 | btrfs_item_offset_nr(leaf, slot))) |
| 2737 | |
| 2738 | #define btrfs_item_ptr_offset(leaf, slot) \ |
| 2739 | ((unsigned long)(btrfs_leaf_data(leaf) + \ |
| 2740 | btrfs_item_offset_nr(leaf, slot))) |
| 2741 | |
| 2742 | static inline struct dentry *fdentry(struct file *file) |
| 2743 | { |
| 2744 | return file->f_path.dentry; |
| 2745 | } |
| 2746 | |
| 2747 | static inline bool btrfs_mixed_space_info(struct btrfs_space_info *space_info) |
| 2748 | { |
| 2749 | return ((space_info->flags & BTRFS_BLOCK_GROUP_METADATA) && |
| 2750 | (space_info->flags & BTRFS_BLOCK_GROUP_DATA)); |
| 2751 | } |
| 2752 | |
| 2753 | static inline gfp_t btrfs_alloc_write_mask(struct address_space *mapping) |
| 2754 | { |
| 2755 | return mapping_gfp_mask(mapping) & ~__GFP_FS; |
| 2756 | } |
| 2757 | |
| 2758 | /* extent-tree.c */ |
| 2759 | static inline u64 btrfs_calc_trans_metadata_size(struct btrfs_root *root, |
| 2760 | unsigned num_items) |
| 2761 | { |
| 2762 | return (root->leafsize + root->nodesize * (BTRFS_MAX_LEVEL - 1)) * |
| 2763 | 3 * num_items; |
| 2764 | } |
| 2765 | |
| 2766 | /* |
| 2767 | * Doing a truncate won't result in new nodes or leaves, just what we need for |
| 2768 | * COW. |
| 2769 | */ |
| 2770 | static inline u64 btrfs_calc_trunc_metadata_size(struct btrfs_root *root, |
| 2771 | unsigned num_items) |
| 2772 | { |
| 2773 | return (root->leafsize + root->nodesize * (BTRFS_MAX_LEVEL - 1)) * |
| 2774 | num_items; |
| 2775 | } |
| 2776 | |
| 2777 | void btrfs_put_block_group(struct btrfs_block_group_cache *cache); |
| 2778 | int btrfs_run_delayed_refs(struct btrfs_trans_handle *trans, |
| 2779 | struct btrfs_root *root, unsigned long count); |
| 2780 | int btrfs_lookup_extent(struct btrfs_root *root, u64 start, u64 len); |
| 2781 | int btrfs_lookup_extent_info(struct btrfs_trans_handle *trans, |
| 2782 | struct btrfs_root *root, u64 bytenr, |
| 2783 | u64 num_bytes, u64 *refs, u64 *flags); |
| 2784 | int btrfs_pin_extent(struct btrfs_root *root, |
| 2785 | u64 bytenr, u64 num, int reserved); |
| 2786 | int btrfs_pin_extent_for_log_replay(struct btrfs_trans_handle *trans, |
| 2787 | struct btrfs_root *root, |
| 2788 | u64 bytenr, u64 num_bytes); |
| 2789 | int btrfs_cross_ref_exist(struct btrfs_trans_handle *trans, |
| 2790 | struct btrfs_root *root, |
| 2791 | u64 objectid, u64 offset, u64 bytenr); |
| 2792 | struct btrfs_block_group_cache *btrfs_lookup_block_group( |
| 2793 | struct btrfs_fs_info *info, |
| 2794 | u64 bytenr); |
| 2795 | void btrfs_put_block_group(struct btrfs_block_group_cache *cache); |
| 2796 | u64 btrfs_find_block_group(struct btrfs_root *root, |
| 2797 | u64 search_start, u64 search_hint, int owner); |
| 2798 | struct extent_buffer *btrfs_alloc_free_block(struct btrfs_trans_handle *trans, |
| 2799 | struct btrfs_root *root, u32 blocksize, |
| 2800 | u64 parent, u64 root_objectid, |
| 2801 | struct btrfs_disk_key *key, int level, |
| 2802 | u64 hint, u64 empty_size); |
| 2803 | void btrfs_free_tree_block(struct btrfs_trans_handle *trans, |
| 2804 | struct btrfs_root *root, |
| 2805 | struct extent_buffer *buf, |
| 2806 | u64 parent, int last_ref); |
| 2807 | struct extent_buffer *btrfs_init_new_buffer(struct btrfs_trans_handle *trans, |
| 2808 | struct btrfs_root *root, |
| 2809 | u64 bytenr, u32 blocksize, |
| 2810 | int level); |
| 2811 | int btrfs_alloc_reserved_file_extent(struct btrfs_trans_handle *trans, |
| 2812 | struct btrfs_root *root, |
| 2813 | u64 root_objectid, u64 owner, |
| 2814 | u64 offset, struct btrfs_key *ins); |
| 2815 | int btrfs_alloc_logged_file_extent(struct btrfs_trans_handle *trans, |
| 2816 | struct btrfs_root *root, |
| 2817 | u64 root_objectid, u64 owner, u64 offset, |
| 2818 | struct btrfs_key *ins); |
| 2819 | int btrfs_reserve_extent(struct btrfs_trans_handle *trans, |
| 2820 | struct btrfs_root *root, |
| 2821 | u64 num_bytes, u64 min_alloc_size, |
| 2822 | u64 empty_size, u64 hint_byte, |
| 2823 | struct btrfs_key *ins, u64 data); |
| 2824 | int btrfs_inc_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
| 2825 | struct extent_buffer *buf, int full_backref, int for_cow); |
| 2826 | int btrfs_dec_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
| 2827 | struct extent_buffer *buf, int full_backref, int for_cow); |
| 2828 | int btrfs_set_disk_extent_flags(struct btrfs_trans_handle *trans, |
| 2829 | struct btrfs_root *root, |
| 2830 | u64 bytenr, u64 num_bytes, u64 flags, |
| 2831 | int is_data); |
| 2832 | int btrfs_free_extent(struct btrfs_trans_handle *trans, |
| 2833 | struct btrfs_root *root, |
| 2834 | u64 bytenr, u64 num_bytes, u64 parent, u64 root_objectid, |
| 2835 | u64 owner, u64 offset, int for_cow); |
| 2836 | |
| 2837 | int btrfs_free_reserved_extent(struct btrfs_root *root, u64 start, u64 len); |
| 2838 | int btrfs_free_and_pin_reserved_extent(struct btrfs_root *root, |
| 2839 | u64 start, u64 len); |
| 2840 | void btrfs_prepare_extent_commit(struct btrfs_trans_handle *trans, |
| 2841 | struct btrfs_root *root); |
| 2842 | int btrfs_finish_extent_commit(struct btrfs_trans_handle *trans, |
| 2843 | struct btrfs_root *root); |
| 2844 | int btrfs_inc_extent_ref(struct btrfs_trans_handle *trans, |
| 2845 | struct btrfs_root *root, |
| 2846 | u64 bytenr, u64 num_bytes, u64 parent, |
| 2847 | u64 root_objectid, u64 owner, u64 offset, int for_cow); |
| 2848 | |
| 2849 | int btrfs_write_dirty_block_groups(struct btrfs_trans_handle *trans, |
| 2850 | struct btrfs_root *root); |
| 2851 | int btrfs_extent_readonly(struct btrfs_root *root, u64 bytenr); |
| 2852 | int btrfs_free_block_groups(struct btrfs_fs_info *info); |
| 2853 | int btrfs_read_block_groups(struct btrfs_root *root); |
| 2854 | int btrfs_can_relocate(struct btrfs_root *root, u64 bytenr); |
| 2855 | int btrfs_make_block_group(struct btrfs_trans_handle *trans, |
| 2856 | struct btrfs_root *root, u64 bytes_used, |
| 2857 | u64 type, u64 chunk_objectid, u64 chunk_offset, |
| 2858 | u64 size); |
| 2859 | int btrfs_remove_block_group(struct btrfs_trans_handle *trans, |
| 2860 | struct btrfs_root *root, u64 group_start); |
| 2861 | u64 btrfs_reduce_alloc_profile(struct btrfs_root *root, u64 flags); |
| 2862 | u64 btrfs_get_alloc_profile(struct btrfs_root *root, int data); |
| 2863 | void btrfs_clear_space_info_full(struct btrfs_fs_info *info); |
| 2864 | int btrfs_check_data_free_space(struct inode *inode, u64 bytes); |
| 2865 | void btrfs_free_reserved_data_space(struct inode *inode, u64 bytes); |
| 2866 | void btrfs_trans_release_metadata(struct btrfs_trans_handle *trans, |
| 2867 | struct btrfs_root *root); |
| 2868 | int btrfs_orphan_reserve_metadata(struct btrfs_trans_handle *trans, |
| 2869 | struct inode *inode); |
| 2870 | void btrfs_orphan_release_metadata(struct inode *inode); |
| 2871 | int btrfs_snap_reserve_metadata(struct btrfs_trans_handle *trans, |
| 2872 | struct btrfs_pending_snapshot *pending); |
| 2873 | int btrfs_delalloc_reserve_metadata(struct inode *inode, u64 num_bytes); |
| 2874 | void btrfs_delalloc_release_metadata(struct inode *inode, u64 num_bytes); |
| 2875 | int btrfs_delalloc_reserve_space(struct inode *inode, u64 num_bytes); |
| 2876 | void btrfs_delalloc_release_space(struct inode *inode, u64 num_bytes); |
| 2877 | void btrfs_init_block_rsv(struct btrfs_block_rsv *rsv); |
| 2878 | struct btrfs_block_rsv *btrfs_alloc_block_rsv(struct btrfs_root *root); |
| 2879 | void btrfs_free_block_rsv(struct btrfs_root *root, |
| 2880 | struct btrfs_block_rsv *rsv); |
| 2881 | int btrfs_block_rsv_add(struct btrfs_root *root, |
| 2882 | struct btrfs_block_rsv *block_rsv, |
| 2883 | u64 num_bytes); |
| 2884 | int btrfs_block_rsv_add_noflush(struct btrfs_root *root, |
| 2885 | struct btrfs_block_rsv *block_rsv, |
| 2886 | u64 num_bytes); |
| 2887 | int btrfs_block_rsv_check(struct btrfs_root *root, |
| 2888 | struct btrfs_block_rsv *block_rsv, int min_factor); |
| 2889 | int btrfs_block_rsv_refill(struct btrfs_root *root, |
| 2890 | struct btrfs_block_rsv *block_rsv, |
| 2891 | u64 min_reserved); |
| 2892 | int btrfs_block_rsv_refill_noflush(struct btrfs_root *root, |
| 2893 | struct btrfs_block_rsv *block_rsv, |
| 2894 | u64 min_reserved); |
| 2895 | int btrfs_block_rsv_migrate(struct btrfs_block_rsv *src_rsv, |
| 2896 | struct btrfs_block_rsv *dst_rsv, |
| 2897 | u64 num_bytes); |
| 2898 | void btrfs_block_rsv_release(struct btrfs_root *root, |
| 2899 | struct btrfs_block_rsv *block_rsv, |
| 2900 | u64 num_bytes); |
| 2901 | int btrfs_set_block_group_ro(struct btrfs_root *root, |
| 2902 | struct btrfs_block_group_cache *cache); |
| 2903 | void btrfs_set_block_group_rw(struct btrfs_root *root, |
| 2904 | struct btrfs_block_group_cache *cache); |
| 2905 | void btrfs_put_block_group_cache(struct btrfs_fs_info *info); |
| 2906 | u64 btrfs_account_ro_block_groups_free_space(struct btrfs_space_info *sinfo); |
| 2907 | int btrfs_error_unpin_extent_range(struct btrfs_root *root, |
| 2908 | u64 start, u64 end); |
| 2909 | int btrfs_error_discard_extent(struct btrfs_root *root, u64 bytenr, |
| 2910 | u64 num_bytes, u64 *actual_bytes); |
| 2911 | int btrfs_force_chunk_alloc(struct btrfs_trans_handle *trans, |
| 2912 | struct btrfs_root *root, u64 type); |
| 2913 | int btrfs_trim_fs(struct btrfs_root *root, struct fstrim_range *range); |
| 2914 | |
| 2915 | int btrfs_init_space_info(struct btrfs_fs_info *fs_info); |
| 2916 | int btrfs_delayed_refs_qgroup_accounting(struct btrfs_trans_handle *trans, |
| 2917 | struct btrfs_fs_info *fs_info); |
| 2918 | /* ctree.c */ |
| 2919 | int btrfs_bin_search(struct extent_buffer *eb, struct btrfs_key *key, |
| 2920 | int level, int *slot); |
| 2921 | int btrfs_comp_cpu_keys(struct btrfs_key *k1, struct btrfs_key *k2); |
| 2922 | int btrfs_previous_item(struct btrfs_root *root, |
| 2923 | struct btrfs_path *path, u64 min_objectid, |
| 2924 | int type); |
| 2925 | void btrfs_set_item_key_safe(struct btrfs_trans_handle *trans, |
| 2926 | struct btrfs_root *root, struct btrfs_path *path, |
| 2927 | struct btrfs_key *new_key); |
| 2928 | struct extent_buffer *btrfs_root_node(struct btrfs_root *root); |
| 2929 | struct extent_buffer *btrfs_lock_root_node(struct btrfs_root *root); |
| 2930 | int btrfs_find_next_key(struct btrfs_root *root, struct btrfs_path *path, |
| 2931 | struct btrfs_key *key, int lowest_level, |
| 2932 | int cache_only, u64 min_trans); |
| 2933 | int btrfs_search_forward(struct btrfs_root *root, struct btrfs_key *min_key, |
| 2934 | struct btrfs_key *max_key, |
| 2935 | struct btrfs_path *path, int cache_only, |
| 2936 | u64 min_trans); |
| 2937 | enum btrfs_compare_tree_result { |
| 2938 | BTRFS_COMPARE_TREE_NEW, |
| 2939 | BTRFS_COMPARE_TREE_DELETED, |
| 2940 | BTRFS_COMPARE_TREE_CHANGED, |
| 2941 | }; |
| 2942 | typedef int (*btrfs_changed_cb_t)(struct btrfs_root *left_root, |
| 2943 | struct btrfs_root *right_root, |
| 2944 | struct btrfs_path *left_path, |
| 2945 | struct btrfs_path *right_path, |
| 2946 | struct btrfs_key *key, |
| 2947 | enum btrfs_compare_tree_result result, |
| 2948 | void *ctx); |
| 2949 | int btrfs_compare_trees(struct btrfs_root *left_root, |
| 2950 | struct btrfs_root *right_root, |
| 2951 | btrfs_changed_cb_t cb, void *ctx); |
| 2952 | int btrfs_cow_block(struct btrfs_trans_handle *trans, |
| 2953 | struct btrfs_root *root, struct extent_buffer *buf, |
| 2954 | struct extent_buffer *parent, int parent_slot, |
| 2955 | struct extent_buffer **cow_ret); |
| 2956 | int btrfs_copy_root(struct btrfs_trans_handle *trans, |
| 2957 | struct btrfs_root *root, |
| 2958 | struct extent_buffer *buf, |
| 2959 | struct extent_buffer **cow_ret, u64 new_root_objectid); |
| 2960 | int btrfs_block_can_be_shared(struct btrfs_root *root, |
| 2961 | struct extent_buffer *buf); |
| 2962 | void btrfs_extend_item(struct btrfs_trans_handle *trans, |
| 2963 | struct btrfs_root *root, struct btrfs_path *path, |
| 2964 | u32 data_size); |
| 2965 | void btrfs_truncate_item(struct btrfs_trans_handle *trans, |
| 2966 | struct btrfs_root *root, |
| 2967 | struct btrfs_path *path, |
| 2968 | u32 new_size, int from_end); |
| 2969 | int btrfs_split_item(struct btrfs_trans_handle *trans, |
| 2970 | struct btrfs_root *root, |
| 2971 | struct btrfs_path *path, |
| 2972 | struct btrfs_key *new_key, |
| 2973 | unsigned long split_offset); |
| 2974 | int btrfs_duplicate_item(struct btrfs_trans_handle *trans, |
| 2975 | struct btrfs_root *root, |
| 2976 | struct btrfs_path *path, |
| 2977 | struct btrfs_key *new_key); |
| 2978 | int btrfs_search_slot(struct btrfs_trans_handle *trans, struct btrfs_root |
| 2979 | *root, struct btrfs_key *key, struct btrfs_path *p, int |
| 2980 | ins_len, int cow); |
| 2981 | int btrfs_search_old_slot(struct btrfs_root *root, struct btrfs_key *key, |
| 2982 | struct btrfs_path *p, u64 time_seq); |
| 2983 | int btrfs_search_slot_for_read(struct btrfs_root *root, |
| 2984 | struct btrfs_key *key, struct btrfs_path *p, |
| 2985 | int find_higher, int return_any); |
| 2986 | int btrfs_realloc_node(struct btrfs_trans_handle *trans, |
| 2987 | struct btrfs_root *root, struct extent_buffer *parent, |
| 2988 | int start_slot, int cache_only, u64 *last_ret, |
| 2989 | struct btrfs_key *progress); |
| 2990 | void btrfs_release_path(struct btrfs_path *p); |
| 2991 | struct btrfs_path *btrfs_alloc_path(void); |
| 2992 | void btrfs_free_path(struct btrfs_path *p); |
| 2993 | void btrfs_set_path_blocking(struct btrfs_path *p); |
| 2994 | void btrfs_clear_path_blocking(struct btrfs_path *p, |
| 2995 | struct extent_buffer *held, int held_rw); |
| 2996 | void btrfs_unlock_up_safe(struct btrfs_path *p, int level); |
| 2997 | |
| 2998 | int btrfs_del_items(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
| 2999 | struct btrfs_path *path, int slot, int nr); |
| 3000 | static inline int btrfs_del_item(struct btrfs_trans_handle *trans, |
| 3001 | struct btrfs_root *root, |
| 3002 | struct btrfs_path *path) |
| 3003 | { |
| 3004 | return btrfs_del_items(trans, root, path, path->slots[0], 1); |
| 3005 | } |
| 3006 | |
| 3007 | void setup_items_for_insert(struct btrfs_trans_handle *trans, |
| 3008 | struct btrfs_root *root, struct btrfs_path *path, |
| 3009 | struct btrfs_key *cpu_key, u32 *data_size, |
| 3010 | u32 total_data, u32 total_size, int nr); |
| 3011 | int btrfs_insert_item(struct btrfs_trans_handle *trans, struct btrfs_root |
| 3012 | *root, struct btrfs_key *key, void *data, u32 data_size); |
| 3013 | int btrfs_insert_empty_items(struct btrfs_trans_handle *trans, |
| 3014 | struct btrfs_root *root, |
| 3015 | struct btrfs_path *path, |
| 3016 | struct btrfs_key *cpu_key, u32 *data_size, int nr); |
| 3017 | |
| 3018 | static inline int btrfs_insert_empty_item(struct btrfs_trans_handle *trans, |
| 3019 | struct btrfs_root *root, |
| 3020 | struct btrfs_path *path, |
| 3021 | struct btrfs_key *key, |
| 3022 | u32 data_size) |
| 3023 | { |
| 3024 | return btrfs_insert_empty_items(trans, root, path, key, &data_size, 1); |
| 3025 | } |
| 3026 | |
| 3027 | int btrfs_next_leaf(struct btrfs_root *root, struct btrfs_path *path); |
| 3028 | int btrfs_next_old_leaf(struct btrfs_root *root, struct btrfs_path *path, |
| 3029 | u64 time_seq); |
| 3030 | static inline int btrfs_next_old_item(struct btrfs_root *root, |
| 3031 | struct btrfs_path *p, u64 time_seq) |
| 3032 | { |
| 3033 | ++p->slots[0]; |
| 3034 | if (p->slots[0] >= btrfs_header_nritems(p->nodes[0])) |
| 3035 | return btrfs_next_old_leaf(root, p, time_seq); |
| 3036 | return 0; |
| 3037 | } |
| 3038 | static inline int btrfs_next_item(struct btrfs_root *root, struct btrfs_path *p) |
| 3039 | { |
| 3040 | return btrfs_next_old_item(root, p, 0); |
| 3041 | } |
| 3042 | int btrfs_prev_leaf(struct btrfs_root *root, struct btrfs_path *path); |
| 3043 | int btrfs_leaf_free_space(struct btrfs_root *root, struct extent_buffer *leaf); |
| 3044 | int __must_check btrfs_drop_snapshot(struct btrfs_root *root, |
| 3045 | struct btrfs_block_rsv *block_rsv, |
| 3046 | int update_ref, int for_reloc); |
| 3047 | int btrfs_drop_subtree(struct btrfs_trans_handle *trans, |
| 3048 | struct btrfs_root *root, |
| 3049 | struct extent_buffer *node, |
| 3050 | struct extent_buffer *parent); |
| 3051 | static inline int btrfs_fs_closing(struct btrfs_fs_info *fs_info) |
| 3052 | { |
| 3053 | /* |
| 3054 | * Get synced with close_ctree() |
| 3055 | */ |
| 3056 | smp_mb(); |
| 3057 | return fs_info->closing; |
| 3058 | } |
| 3059 | static inline void free_fs_info(struct btrfs_fs_info *fs_info) |
| 3060 | { |
| 3061 | kfree(fs_info->balance_ctl); |
| 3062 | kfree(fs_info->delayed_root); |
| 3063 | kfree(fs_info->extent_root); |
| 3064 | kfree(fs_info->tree_root); |
| 3065 | kfree(fs_info->chunk_root); |
| 3066 | kfree(fs_info->dev_root); |
| 3067 | kfree(fs_info->csum_root); |
| 3068 | kfree(fs_info->quota_root); |
| 3069 | kfree(fs_info->super_copy); |
| 3070 | kfree(fs_info->super_for_commit); |
| 3071 | kfree(fs_info); |
| 3072 | } |
| 3073 | |
| 3074 | /* tree mod log functions from ctree.c */ |
| 3075 | u64 btrfs_get_tree_mod_seq(struct btrfs_fs_info *fs_info, |
| 3076 | struct seq_list *elem); |
| 3077 | void btrfs_put_tree_mod_seq(struct btrfs_fs_info *fs_info, |
| 3078 | struct seq_list *elem); |
| 3079 | static inline u64 btrfs_inc_tree_mod_seq(struct btrfs_fs_info *fs_info) |
| 3080 | { |
| 3081 | return atomic_inc_return(&fs_info->tree_mod_seq); |
| 3082 | } |
| 3083 | |
| 3084 | /* root-item.c */ |
| 3085 | int btrfs_find_root_ref(struct btrfs_root *tree_root, |
| 3086 | struct btrfs_path *path, |
| 3087 | u64 root_id, u64 ref_id); |
| 3088 | int btrfs_add_root_ref(struct btrfs_trans_handle *trans, |
| 3089 | struct btrfs_root *tree_root, |
| 3090 | u64 root_id, u64 ref_id, u64 dirid, u64 sequence, |
| 3091 | const char *name, int name_len); |
| 3092 | int btrfs_del_root_ref(struct btrfs_trans_handle *trans, |
| 3093 | struct btrfs_root *tree_root, |
| 3094 | u64 root_id, u64 ref_id, u64 dirid, u64 *sequence, |
| 3095 | const char *name, int name_len); |
| 3096 | int btrfs_del_root(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
| 3097 | struct btrfs_key *key); |
| 3098 | int btrfs_insert_root(struct btrfs_trans_handle *trans, struct btrfs_root |
| 3099 | *root, struct btrfs_key *key, struct btrfs_root_item |
| 3100 | *item); |
| 3101 | int __must_check btrfs_update_root(struct btrfs_trans_handle *trans, |
| 3102 | struct btrfs_root *root, |
| 3103 | struct btrfs_key *key, |
| 3104 | struct btrfs_root_item *item); |
| 3105 | void btrfs_read_root_item(struct btrfs_root *root, |
| 3106 | struct extent_buffer *eb, int slot, |
| 3107 | struct btrfs_root_item *item); |
| 3108 | int btrfs_find_last_root(struct btrfs_root *root, u64 objectid, struct |
| 3109 | btrfs_root_item *item, struct btrfs_key *key); |
| 3110 | int btrfs_find_dead_roots(struct btrfs_root *root, u64 objectid); |
| 3111 | int btrfs_find_orphan_roots(struct btrfs_root *tree_root); |
| 3112 | void btrfs_set_root_node(struct btrfs_root_item *item, |
| 3113 | struct extent_buffer *node); |
| 3114 | void btrfs_check_and_init_root_item(struct btrfs_root_item *item); |
| 3115 | void btrfs_update_root_times(struct btrfs_trans_handle *trans, |
| 3116 | struct btrfs_root *root); |
| 3117 | |
| 3118 | /* dir-item.c */ |
| 3119 | int btrfs_insert_dir_item(struct btrfs_trans_handle *trans, |
| 3120 | struct btrfs_root *root, const char *name, |
| 3121 | int name_len, struct inode *dir, |
| 3122 | struct btrfs_key *location, u8 type, u64 index); |
| 3123 | struct btrfs_dir_item *btrfs_lookup_dir_item(struct btrfs_trans_handle *trans, |
| 3124 | struct btrfs_root *root, |
| 3125 | struct btrfs_path *path, u64 dir, |
| 3126 | const char *name, int name_len, |
| 3127 | int mod); |
| 3128 | struct btrfs_dir_item * |
| 3129 | btrfs_lookup_dir_index_item(struct btrfs_trans_handle *trans, |
| 3130 | struct btrfs_root *root, |
| 3131 | struct btrfs_path *path, u64 dir, |
| 3132 | u64 objectid, const char *name, int name_len, |
| 3133 | int mod); |
| 3134 | struct btrfs_dir_item * |
| 3135 | btrfs_search_dir_index_item(struct btrfs_root *root, |
| 3136 | struct btrfs_path *path, u64 dirid, |
| 3137 | const char *name, int name_len); |
| 3138 | struct btrfs_dir_item *btrfs_match_dir_item_name(struct btrfs_root *root, |
| 3139 | struct btrfs_path *path, |
| 3140 | const char *name, int name_len); |
| 3141 | int btrfs_delete_one_dir_name(struct btrfs_trans_handle *trans, |
| 3142 | struct btrfs_root *root, |
| 3143 | struct btrfs_path *path, |
| 3144 | struct btrfs_dir_item *di); |
| 3145 | int btrfs_insert_xattr_item(struct btrfs_trans_handle *trans, |
| 3146 | struct btrfs_root *root, |
| 3147 | struct btrfs_path *path, u64 objectid, |
| 3148 | const char *name, u16 name_len, |
| 3149 | const void *data, u16 data_len); |
| 3150 | struct btrfs_dir_item *btrfs_lookup_xattr(struct btrfs_trans_handle *trans, |
| 3151 | struct btrfs_root *root, |
| 3152 | struct btrfs_path *path, u64 dir, |
| 3153 | const char *name, u16 name_len, |
| 3154 | int mod); |
| 3155 | int verify_dir_item(struct btrfs_root *root, |
| 3156 | struct extent_buffer *leaf, |
| 3157 | struct btrfs_dir_item *dir_item); |
| 3158 | |
| 3159 | /* orphan.c */ |
| 3160 | int btrfs_insert_orphan_item(struct btrfs_trans_handle *trans, |
| 3161 | struct btrfs_root *root, u64 offset); |
| 3162 | int btrfs_del_orphan_item(struct btrfs_trans_handle *trans, |
| 3163 | struct btrfs_root *root, u64 offset); |
| 3164 | int btrfs_find_orphan_item(struct btrfs_root *root, u64 offset); |
| 3165 | |
| 3166 | /* inode-item.c */ |
| 3167 | int btrfs_insert_inode_ref(struct btrfs_trans_handle *trans, |
| 3168 | struct btrfs_root *root, |
| 3169 | const char *name, int name_len, |
| 3170 | u64 inode_objectid, u64 ref_objectid, u64 index); |
| 3171 | int btrfs_del_inode_ref(struct btrfs_trans_handle *trans, |
| 3172 | struct btrfs_root *root, |
| 3173 | const char *name, int name_len, |
| 3174 | u64 inode_objectid, u64 ref_objectid, u64 *index); |
| 3175 | struct btrfs_inode_ref * |
| 3176 | btrfs_lookup_inode_ref(struct btrfs_trans_handle *trans, |
| 3177 | struct btrfs_root *root, |
| 3178 | struct btrfs_path *path, |
| 3179 | const char *name, int name_len, |
| 3180 | u64 inode_objectid, u64 ref_objectid, int mod); |
| 3181 | int btrfs_insert_empty_inode(struct btrfs_trans_handle *trans, |
| 3182 | struct btrfs_root *root, |
| 3183 | struct btrfs_path *path, u64 objectid); |
| 3184 | int btrfs_lookup_inode(struct btrfs_trans_handle *trans, struct btrfs_root |
| 3185 | *root, struct btrfs_path *path, |
| 3186 | struct btrfs_key *location, int mod); |
| 3187 | |
| 3188 | /* file-item.c */ |
| 3189 | int btrfs_del_csums(struct btrfs_trans_handle *trans, |
| 3190 | struct btrfs_root *root, u64 bytenr, u64 len); |
| 3191 | int btrfs_lookup_bio_sums(struct btrfs_root *root, struct inode *inode, |
| 3192 | struct bio *bio, u32 *dst); |
| 3193 | int btrfs_lookup_bio_sums_dio(struct btrfs_root *root, struct inode *inode, |
| 3194 | struct bio *bio, u64 logical_offset); |
| 3195 | int btrfs_insert_file_extent(struct btrfs_trans_handle *trans, |
| 3196 | struct btrfs_root *root, |
| 3197 | u64 objectid, u64 pos, |
| 3198 | u64 disk_offset, u64 disk_num_bytes, |
| 3199 | u64 num_bytes, u64 offset, u64 ram_bytes, |
| 3200 | u8 compression, u8 encryption, u16 other_encoding); |
| 3201 | int btrfs_lookup_file_extent(struct btrfs_trans_handle *trans, |
| 3202 | struct btrfs_root *root, |
| 3203 | struct btrfs_path *path, u64 objectid, |
| 3204 | u64 bytenr, int mod); |
| 3205 | int btrfs_csum_file_blocks(struct btrfs_trans_handle *trans, |
| 3206 | struct btrfs_root *root, |
| 3207 | struct btrfs_ordered_sum *sums); |
| 3208 | int btrfs_csum_one_bio(struct btrfs_root *root, struct inode *inode, |
| 3209 | struct bio *bio, u64 file_start, int contig); |
| 3210 | struct btrfs_csum_item *btrfs_lookup_csum(struct btrfs_trans_handle *trans, |
| 3211 | struct btrfs_root *root, |
| 3212 | struct btrfs_path *path, |
| 3213 | u64 bytenr, int cow); |
| 3214 | int btrfs_csum_truncate(struct btrfs_trans_handle *trans, |
| 3215 | struct btrfs_root *root, struct btrfs_path *path, |
| 3216 | u64 isize); |
| 3217 | int btrfs_lookup_csums_range(struct btrfs_root *root, u64 start, u64 end, |
| 3218 | struct list_head *list, int search_commit); |
| 3219 | /* inode.c */ |
| 3220 | struct extent_map *btrfs_get_extent_fiemap(struct inode *inode, struct page *page, |
| 3221 | size_t pg_offset, u64 start, u64 len, |
| 3222 | int create); |
| 3223 | |
| 3224 | /* RHEL and EL kernels have a patch that renames PG_checked to FsMisc */ |
| 3225 | #if defined(ClearPageFsMisc) && !defined(ClearPageChecked) |
| 3226 | #define ClearPageChecked ClearPageFsMisc |
| 3227 | #define SetPageChecked SetPageFsMisc |
| 3228 | #define PageChecked PageFsMisc |
| 3229 | #endif |
| 3230 | |
| 3231 | /* This forces readahead on a given range of bytes in an inode */ |
| 3232 | static inline void btrfs_force_ra(struct address_space *mapping, |
| 3233 | struct file_ra_state *ra, struct file *file, |
| 3234 | pgoff_t offset, unsigned long req_size) |
| 3235 | { |
| 3236 | page_cache_sync_readahead(mapping, ra, file, offset, req_size); |
| 3237 | } |
| 3238 | |
| 3239 | struct inode *btrfs_lookup_dentry(struct inode *dir, struct dentry *dentry); |
| 3240 | int btrfs_set_inode_index(struct inode *dir, u64 *index); |
| 3241 | int btrfs_unlink_inode(struct btrfs_trans_handle *trans, |
| 3242 | struct btrfs_root *root, |
| 3243 | struct inode *dir, struct inode *inode, |
| 3244 | const char *name, int name_len); |
| 3245 | int btrfs_add_link(struct btrfs_trans_handle *trans, |
| 3246 | struct inode *parent_inode, struct inode *inode, |
| 3247 | const char *name, int name_len, int add_backref, u64 index); |
| 3248 | int btrfs_unlink_subvol(struct btrfs_trans_handle *trans, |
| 3249 | struct btrfs_root *root, |
| 3250 | struct inode *dir, u64 objectid, |
| 3251 | const char *name, int name_len); |
| 3252 | int btrfs_truncate_inode_items(struct btrfs_trans_handle *trans, |
| 3253 | struct btrfs_root *root, |
| 3254 | struct inode *inode, u64 new_size, |
| 3255 | u32 min_type); |
| 3256 | |
| 3257 | int btrfs_start_delalloc_inodes(struct btrfs_root *root, int delay_iput); |
| 3258 | int btrfs_set_extent_delalloc(struct inode *inode, u64 start, u64 end, |
| 3259 | struct extent_state **cached_state); |
| 3260 | int btrfs_writepages(struct address_space *mapping, |
| 3261 | struct writeback_control *wbc); |
| 3262 | int btrfs_create_subvol_root(struct btrfs_trans_handle *trans, |
| 3263 | struct btrfs_root *new_root, u64 new_dirid); |
| 3264 | int btrfs_merge_bio_hook(struct page *page, unsigned long offset, |
| 3265 | size_t size, struct bio *bio, unsigned long bio_flags); |
| 3266 | |
| 3267 | int btrfs_page_mkwrite(struct vm_area_struct *vma, struct vm_fault *vmf); |
| 3268 | int btrfs_readpage(struct file *file, struct page *page); |
| 3269 | void btrfs_evict_inode(struct inode *inode); |
| 3270 | int btrfs_write_inode(struct inode *inode, struct writeback_control *wbc); |
| 3271 | int btrfs_dirty_inode(struct inode *inode); |
| 3272 | struct inode *btrfs_alloc_inode(struct super_block *sb); |
| 3273 | void btrfs_destroy_inode(struct inode *inode); |
| 3274 | int btrfs_drop_inode(struct inode *inode); |
| 3275 | int btrfs_init_cachep(void); |
| 3276 | void btrfs_destroy_cachep(void); |
| 3277 | long btrfs_ioctl_trans_end(struct file *file); |
| 3278 | struct inode *btrfs_iget(struct super_block *s, struct btrfs_key *location, |
| 3279 | struct btrfs_root *root, int *was_new); |
| 3280 | struct extent_map *btrfs_get_extent(struct inode *inode, struct page *page, |
| 3281 | size_t pg_offset, u64 start, u64 end, |
| 3282 | int create); |
| 3283 | int btrfs_update_inode(struct btrfs_trans_handle *trans, |
| 3284 | struct btrfs_root *root, |
| 3285 | struct inode *inode); |
| 3286 | int btrfs_orphan_add(struct btrfs_trans_handle *trans, struct inode *inode); |
| 3287 | int btrfs_orphan_del(struct btrfs_trans_handle *trans, struct inode *inode); |
| 3288 | int btrfs_orphan_cleanup(struct btrfs_root *root); |
| 3289 | void btrfs_orphan_commit_root(struct btrfs_trans_handle *trans, |
| 3290 | struct btrfs_root *root); |
| 3291 | int btrfs_cont_expand(struct inode *inode, loff_t oldsize, loff_t size); |
| 3292 | void btrfs_invalidate_inodes(struct btrfs_root *root); |
| 3293 | void btrfs_add_delayed_iput(struct inode *inode); |
| 3294 | void btrfs_run_delayed_iputs(struct btrfs_root *root); |
| 3295 | int btrfs_prealloc_file_range(struct inode *inode, int mode, |
| 3296 | u64 start, u64 num_bytes, u64 min_size, |
| 3297 | loff_t actual_len, u64 *alloc_hint); |
| 3298 | int btrfs_prealloc_file_range_trans(struct inode *inode, |
| 3299 | struct btrfs_trans_handle *trans, int mode, |
| 3300 | u64 start, u64 num_bytes, u64 min_size, |
| 3301 | loff_t actual_len, u64 *alloc_hint); |
| 3302 | extern const struct dentry_operations btrfs_dentry_operations; |
| 3303 | |
| 3304 | /* ioctl.c */ |
| 3305 | long btrfs_ioctl(struct file *file, unsigned int cmd, unsigned long arg); |
| 3306 | void btrfs_update_iflags(struct inode *inode); |
| 3307 | void btrfs_inherit_iflags(struct inode *inode, struct inode *dir); |
| 3308 | int btrfs_defrag_file(struct inode *inode, struct file *file, |
| 3309 | struct btrfs_ioctl_defrag_range_args *range, |
| 3310 | u64 newer_than, unsigned long max_pages); |
| 3311 | /* file.c */ |
| 3312 | int btrfs_add_inode_defrag(struct btrfs_trans_handle *trans, |
| 3313 | struct inode *inode); |
| 3314 | int btrfs_run_defrag_inodes(struct btrfs_fs_info *fs_info); |
| 3315 | int btrfs_sync_file(struct file *file, loff_t start, loff_t end, int datasync); |
| 3316 | int btrfs_drop_extent_cache(struct inode *inode, u64 start, u64 end, |
| 3317 | int skip_pinned); |
| 3318 | extern const struct file_operations btrfs_file_operations; |
| 3319 | int btrfs_drop_extents(struct btrfs_trans_handle *trans, struct inode *inode, |
| 3320 | u64 start, u64 end, u64 *hint_byte, int drop_cache); |
| 3321 | int btrfs_mark_extent_written(struct btrfs_trans_handle *trans, |
| 3322 | struct inode *inode, u64 start, u64 end); |
| 3323 | int btrfs_release_file(struct inode *inode, struct file *file); |
| 3324 | void btrfs_drop_pages(struct page **pages, size_t num_pages); |
| 3325 | int btrfs_dirty_pages(struct btrfs_root *root, struct inode *inode, |
| 3326 | struct page **pages, size_t num_pages, |
| 3327 | loff_t pos, size_t write_bytes, |
| 3328 | struct extent_state **cached); |
| 3329 | |
| 3330 | /* tree-defrag.c */ |
| 3331 | int btrfs_defrag_leaves(struct btrfs_trans_handle *trans, |
| 3332 | struct btrfs_root *root, int cache_only); |
| 3333 | |
| 3334 | /* sysfs.c */ |
| 3335 | int btrfs_init_sysfs(void); |
| 3336 | void btrfs_exit_sysfs(void); |
| 3337 | |
| 3338 | /* xattr.c */ |
| 3339 | ssize_t btrfs_listxattr(struct dentry *dentry, char *buffer, size_t size); |
| 3340 | |
| 3341 | /* super.c */ |
| 3342 | int btrfs_parse_options(struct btrfs_root *root, char *options); |
| 3343 | int btrfs_sync_fs(struct super_block *sb, int wait); |
| 3344 | |
| 3345 | #ifdef CONFIG_PRINTK |
| 3346 | __printf(2, 3) |
| 3347 | void btrfs_printk(struct btrfs_fs_info *fs_info, const char *fmt, ...); |
| 3348 | #else |
| 3349 | static inline __printf(2, 3) |
| 3350 | void btrfs_printk(struct btrfs_fs_info *fs_info, const char *fmt, ...) |
| 3351 | { |
| 3352 | } |
| 3353 | #endif |
| 3354 | |
| 3355 | __printf(5, 6) |
| 3356 | void __btrfs_std_error(struct btrfs_fs_info *fs_info, const char *function, |
| 3357 | unsigned int line, int errno, const char *fmt, ...); |
| 3358 | |
| 3359 | |
| 3360 | void __btrfs_abort_transaction(struct btrfs_trans_handle *trans, |
| 3361 | struct btrfs_root *root, const char *function, |
| 3362 | unsigned int line, int errno); |
| 3363 | |
| 3364 | #define btrfs_set_fs_incompat(__fs_info, opt) \ |
| 3365 | __btrfs_set_fs_incompat((__fs_info), BTRFS_FEATURE_INCOMPAT_##opt) |
| 3366 | |
| 3367 | static inline void __btrfs_set_fs_incompat(struct btrfs_fs_info *fs_info, |
| 3368 | u64 flag) |
| 3369 | { |
| 3370 | struct btrfs_super_block *disk_super; |
| 3371 | u64 features; |
| 3372 | |
| 3373 | disk_super = fs_info->super_copy; |
| 3374 | features = btrfs_super_incompat_flags(disk_super); |
| 3375 | if (!(features & flag)) { |
| 3376 | features |= flag; |
| 3377 | btrfs_set_super_incompat_flags(disk_super, features); |
| 3378 | } |
| 3379 | } |
| 3380 | |
| 3381 | #define btrfs_abort_transaction(trans, root, errno) \ |
| 3382 | do { \ |
| 3383 | __btrfs_abort_transaction(trans, root, __func__, \ |
| 3384 | __LINE__, errno); \ |
| 3385 | } while (0) |
| 3386 | |
| 3387 | #define btrfs_std_error(fs_info, errno) \ |
| 3388 | do { \ |
| 3389 | if ((errno)) \ |
| 3390 | __btrfs_std_error((fs_info), __func__, \ |
| 3391 | __LINE__, (errno), NULL); \ |
| 3392 | } while (0) |
| 3393 | |
| 3394 | #define btrfs_error(fs_info, errno, fmt, args...) \ |
| 3395 | do { \ |
| 3396 | __btrfs_std_error((fs_info), __func__, __LINE__, \ |
| 3397 | (errno), fmt, ##args); \ |
| 3398 | } while (0) |
| 3399 | |
| 3400 | __printf(5, 6) |
| 3401 | void __btrfs_panic(struct btrfs_fs_info *fs_info, const char *function, |
| 3402 | unsigned int line, int errno, const char *fmt, ...); |
| 3403 | |
| 3404 | #define btrfs_panic(fs_info, errno, fmt, args...) \ |
| 3405 | do { \ |
| 3406 | struct btrfs_fs_info *_i = (fs_info); \ |
| 3407 | __btrfs_panic(_i, __func__, __LINE__, errno, fmt, ##args); \ |
| 3408 | BUG_ON(!(_i->mount_opt & BTRFS_MOUNT_PANIC_ON_FATAL_ERROR)); \ |
| 3409 | } while (0) |
| 3410 | |
| 3411 | /* acl.c */ |
| 3412 | #ifdef CONFIG_BTRFS_FS_POSIX_ACL |
| 3413 | struct posix_acl *btrfs_get_acl(struct inode *inode, int type); |
| 3414 | int btrfs_init_acl(struct btrfs_trans_handle *trans, |
| 3415 | struct inode *inode, struct inode *dir); |
| 3416 | int btrfs_acl_chmod(struct inode *inode); |
| 3417 | #else |
| 3418 | #define btrfs_get_acl NULL |
| 3419 | static inline int btrfs_init_acl(struct btrfs_trans_handle *trans, |
| 3420 | struct inode *inode, struct inode *dir) |
| 3421 | { |
| 3422 | return 0; |
| 3423 | } |
| 3424 | static inline int btrfs_acl_chmod(struct inode *inode) |
| 3425 | { |
| 3426 | return 0; |
| 3427 | } |
| 3428 | #endif |
| 3429 | |
| 3430 | /* relocation.c */ |
| 3431 | int btrfs_relocate_block_group(struct btrfs_root *root, u64 group_start); |
| 3432 | int btrfs_init_reloc_root(struct btrfs_trans_handle *trans, |
| 3433 | struct btrfs_root *root); |
| 3434 | int btrfs_update_reloc_root(struct btrfs_trans_handle *trans, |
| 3435 | struct btrfs_root *root); |
| 3436 | int btrfs_recover_relocation(struct btrfs_root *root); |
| 3437 | int btrfs_reloc_clone_csums(struct inode *inode, u64 file_pos, u64 len); |
| 3438 | void btrfs_reloc_cow_block(struct btrfs_trans_handle *trans, |
| 3439 | struct btrfs_root *root, struct extent_buffer *buf, |
| 3440 | struct extent_buffer *cow); |
| 3441 | void btrfs_reloc_pre_snapshot(struct btrfs_trans_handle *trans, |
| 3442 | struct btrfs_pending_snapshot *pending, |
| 3443 | u64 *bytes_to_reserve); |
| 3444 | int btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans, |
| 3445 | struct btrfs_pending_snapshot *pending); |
| 3446 | |
| 3447 | /* scrub.c */ |
| 3448 | int btrfs_scrub_dev(struct btrfs_root *root, u64 devid, u64 start, u64 end, |
| 3449 | struct btrfs_scrub_progress *progress, int readonly); |
| 3450 | void btrfs_scrub_pause(struct btrfs_root *root); |
| 3451 | void btrfs_scrub_pause_super(struct btrfs_root *root); |
| 3452 | void btrfs_scrub_continue(struct btrfs_root *root); |
| 3453 | void btrfs_scrub_continue_super(struct btrfs_root *root); |
| 3454 | int __btrfs_scrub_cancel(struct btrfs_fs_info *info); |
| 3455 | int btrfs_scrub_cancel(struct btrfs_root *root); |
| 3456 | int btrfs_scrub_cancel_dev(struct btrfs_root *root, struct btrfs_device *dev); |
| 3457 | int btrfs_scrub_cancel_devid(struct btrfs_root *root, u64 devid); |
| 3458 | int btrfs_scrub_progress(struct btrfs_root *root, u64 devid, |
| 3459 | struct btrfs_scrub_progress *progress); |
| 3460 | |
| 3461 | /* reada.c */ |
| 3462 | struct reada_control { |
| 3463 | struct btrfs_root *root; /* tree to prefetch */ |
| 3464 | struct btrfs_key key_start; |
| 3465 | struct btrfs_key key_end; /* exclusive */ |
| 3466 | atomic_t elems; |
| 3467 | struct kref refcnt; |
| 3468 | wait_queue_head_t wait; |
| 3469 | }; |
| 3470 | struct reada_control *btrfs_reada_add(struct btrfs_root *root, |
| 3471 | struct btrfs_key *start, struct btrfs_key *end); |
| 3472 | int btrfs_reada_wait(void *handle); |
| 3473 | void btrfs_reada_detach(void *handle); |
| 3474 | int btree_readahead_hook(struct btrfs_root *root, struct extent_buffer *eb, |
| 3475 | u64 start, int err); |
| 3476 | |
| 3477 | /* qgroup.c */ |
| 3478 | struct qgroup_update { |
| 3479 | struct list_head list; |
| 3480 | struct btrfs_delayed_ref_node *node; |
| 3481 | struct btrfs_delayed_extent_op *extent_op; |
| 3482 | }; |
| 3483 | |
| 3484 | int btrfs_quota_enable(struct btrfs_trans_handle *trans, |
| 3485 | struct btrfs_fs_info *fs_info); |
| 3486 | int btrfs_quota_disable(struct btrfs_trans_handle *trans, |
| 3487 | struct btrfs_fs_info *fs_info); |
| 3488 | int btrfs_quota_rescan(struct btrfs_fs_info *fs_info); |
| 3489 | int btrfs_add_qgroup_relation(struct btrfs_trans_handle *trans, |
| 3490 | struct btrfs_fs_info *fs_info, u64 src, u64 dst); |
| 3491 | int btrfs_del_qgroup_relation(struct btrfs_trans_handle *trans, |
| 3492 | struct btrfs_fs_info *fs_info, u64 src, u64 dst); |
| 3493 | int btrfs_create_qgroup(struct btrfs_trans_handle *trans, |
| 3494 | struct btrfs_fs_info *fs_info, u64 qgroupid, |
| 3495 | char *name); |
| 3496 | int btrfs_remove_qgroup(struct btrfs_trans_handle *trans, |
| 3497 | struct btrfs_fs_info *fs_info, u64 qgroupid); |
| 3498 | int btrfs_limit_qgroup(struct btrfs_trans_handle *trans, |
| 3499 | struct btrfs_fs_info *fs_info, u64 qgroupid, |
| 3500 | struct btrfs_qgroup_limit *limit); |
| 3501 | int btrfs_read_qgroup_config(struct btrfs_fs_info *fs_info); |
| 3502 | void btrfs_free_qgroup_config(struct btrfs_fs_info *fs_info); |
| 3503 | struct btrfs_delayed_extent_op; |
| 3504 | int btrfs_qgroup_record_ref(struct btrfs_trans_handle *trans, |
| 3505 | struct btrfs_delayed_ref_node *node, |
| 3506 | struct btrfs_delayed_extent_op *extent_op); |
| 3507 | int btrfs_qgroup_account_ref(struct btrfs_trans_handle *trans, |
| 3508 | struct btrfs_fs_info *fs_info, |
| 3509 | struct btrfs_delayed_ref_node *node, |
| 3510 | struct btrfs_delayed_extent_op *extent_op); |
| 3511 | int btrfs_run_qgroups(struct btrfs_trans_handle *trans, |
| 3512 | struct btrfs_fs_info *fs_info); |
| 3513 | int btrfs_qgroup_inherit(struct btrfs_trans_handle *trans, |
| 3514 | struct btrfs_fs_info *fs_info, u64 srcid, u64 objectid, |
| 3515 | struct btrfs_qgroup_inherit *inherit); |
| 3516 | int btrfs_qgroup_reserve(struct btrfs_root *root, u64 num_bytes); |
| 3517 | void btrfs_qgroup_free(struct btrfs_root *root, u64 num_bytes); |
| 3518 | |
| 3519 | void assert_qgroups_uptodate(struct btrfs_trans_handle *trans); |
| 3520 | |
| 3521 | static inline int is_fstree(u64 rootid) |
| 3522 | { |
| 3523 | if (rootid == BTRFS_FS_TREE_OBJECTID || |
| 3524 | (s64)rootid >= (s64)BTRFS_FIRST_FREE_OBJECTID) |
| 3525 | return 1; |
| 3526 | return 0; |
| 3527 | } |
| 3528 | #endif |