| 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/version.h> |
| 23 | #include <linux/mm.h> |
| 24 | #include <linux/highmem.h> |
| 25 | #include <linux/fs.h> |
| 26 | #include <linux/completion.h> |
| 27 | #include <linux/backing-dev.h> |
| 28 | #include <linux/wait.h> |
| 29 | #include <asm/kmap_types.h> |
| 30 | #include "extent_io.h" |
| 31 | #include "extent_map.h" |
| 32 | #include "async-thread.h" |
| 33 | |
| 34 | struct btrfs_trans_handle; |
| 35 | struct btrfs_transaction; |
| 36 | extern struct kmem_cache *btrfs_trans_handle_cachep; |
| 37 | extern struct kmem_cache *btrfs_transaction_cachep; |
| 38 | extern struct kmem_cache *btrfs_bit_radix_cachep; |
| 39 | extern struct kmem_cache *btrfs_path_cachep; |
| 40 | struct btrfs_ordered_sum; |
| 41 | |
| 42 | #define BTRFS_MAGIC "_BHRfS_M" |
| 43 | |
| 44 | #define BTRFS_ACL_NOT_CACHED ((void *)-1) |
| 45 | |
| 46 | #define BTRFS_MAX_LEVEL 8 |
| 47 | |
| 48 | /* holds pointers to all of the tree roots */ |
| 49 | #define BTRFS_ROOT_TREE_OBJECTID 1ULL |
| 50 | |
| 51 | /* stores information about which extents are in use, and reference counts */ |
| 52 | #define BTRFS_EXTENT_TREE_OBJECTID 2ULL |
| 53 | |
| 54 | /* |
| 55 | * chunk tree stores translations from logical -> physical block numbering |
| 56 | * the super block points to the chunk tree |
| 57 | */ |
| 58 | #define BTRFS_CHUNK_TREE_OBJECTID 3ULL |
| 59 | |
| 60 | /* |
| 61 | * stores information about which areas of a given device are in use. |
| 62 | * one per device. The tree of tree roots points to the device tree |
| 63 | */ |
| 64 | #define BTRFS_DEV_TREE_OBJECTID 4ULL |
| 65 | |
| 66 | /* one per subvolume, storing files and directories */ |
| 67 | #define BTRFS_FS_TREE_OBJECTID 5ULL |
| 68 | |
| 69 | /* directory objectid inside the root tree */ |
| 70 | #define BTRFS_ROOT_TREE_DIR_OBJECTID 6ULL |
| 71 | |
| 72 | /* holds checksums of all the data extents */ |
| 73 | #define BTRFS_CSUM_TREE_OBJECTID 7ULL |
| 74 | |
| 75 | /* orhpan objectid for tracking unlinked/truncated files */ |
| 76 | #define BTRFS_ORPHAN_OBJECTID -5ULL |
| 77 | |
| 78 | /* does write ahead logging to speed up fsyncs */ |
| 79 | #define BTRFS_TREE_LOG_OBJECTID -6ULL |
| 80 | #define BTRFS_TREE_LOG_FIXUP_OBJECTID -7ULL |
| 81 | |
| 82 | /* for space balancing */ |
| 83 | #define BTRFS_TREE_RELOC_OBJECTID -8ULL |
| 84 | #define BTRFS_DATA_RELOC_TREE_OBJECTID -9ULL |
| 85 | |
| 86 | /* |
| 87 | * extent checksums all have this objectid |
| 88 | * this allows them to share the logging tree |
| 89 | * for fsyncs |
| 90 | */ |
| 91 | #define BTRFS_EXTENT_CSUM_OBJECTID -10ULL |
| 92 | |
| 93 | /* dummy objectid represents multiple objectids */ |
| 94 | #define BTRFS_MULTIPLE_OBJECTIDS -255ULL |
| 95 | |
| 96 | /* |
| 97 | * All files have objectids in this range. |
| 98 | */ |
| 99 | #define BTRFS_FIRST_FREE_OBJECTID 256ULL |
| 100 | #define BTRFS_LAST_FREE_OBJECTID -256ULL |
| 101 | #define BTRFS_FIRST_CHUNK_TREE_OBJECTID 256ULL |
| 102 | |
| 103 | |
| 104 | /* |
| 105 | * the device items go into the chunk tree. The key is in the form |
| 106 | * [ 1 BTRFS_DEV_ITEM_KEY device_id ] |
| 107 | */ |
| 108 | #define BTRFS_DEV_ITEMS_OBJECTID 1ULL |
| 109 | |
| 110 | /* |
| 111 | * we can actually store much bigger names, but lets not confuse the rest |
| 112 | * of linux |
| 113 | */ |
| 114 | #define BTRFS_NAME_LEN 255 |
| 115 | |
| 116 | /* 32 bytes in various csum fields */ |
| 117 | #define BTRFS_CSUM_SIZE 32 |
| 118 | |
| 119 | /* csum types */ |
| 120 | #define BTRFS_CSUM_TYPE_CRC32 0 |
| 121 | |
| 122 | static int btrfs_csum_sizes[] = { 4, 0 }; |
| 123 | |
| 124 | /* four bytes for CRC32 */ |
| 125 | #define BTRFS_EMPTY_DIR_SIZE 0 |
| 126 | |
| 127 | #define BTRFS_FT_UNKNOWN 0 |
| 128 | #define BTRFS_FT_REG_FILE 1 |
| 129 | #define BTRFS_FT_DIR 2 |
| 130 | #define BTRFS_FT_CHRDEV 3 |
| 131 | #define BTRFS_FT_BLKDEV 4 |
| 132 | #define BTRFS_FT_FIFO 5 |
| 133 | #define BTRFS_FT_SOCK 6 |
| 134 | #define BTRFS_FT_SYMLINK 7 |
| 135 | #define BTRFS_FT_XATTR 8 |
| 136 | #define BTRFS_FT_MAX 9 |
| 137 | |
| 138 | /* |
| 139 | * the key defines the order in the tree, and so it also defines (optimal) |
| 140 | * block layout. objectid corresonds to the inode number. The flags |
| 141 | * tells us things about the object, and is a kind of stream selector. |
| 142 | * so for a given inode, keys with flags of 1 might refer to the inode |
| 143 | * data, flags of 2 may point to file data in the btree and flags == 3 |
| 144 | * may point to extents. |
| 145 | * |
| 146 | * offset is the starting byte offset for this key in the stream. |
| 147 | * |
| 148 | * btrfs_disk_key is in disk byte order. struct btrfs_key is always |
| 149 | * in cpu native order. Otherwise they are identical and their sizes |
| 150 | * should be the same (ie both packed) |
| 151 | */ |
| 152 | struct btrfs_disk_key { |
| 153 | __le64 objectid; |
| 154 | u8 type; |
| 155 | __le64 offset; |
| 156 | } __attribute__ ((__packed__)); |
| 157 | |
| 158 | struct btrfs_key { |
| 159 | u64 objectid; |
| 160 | u8 type; |
| 161 | u64 offset; |
| 162 | } __attribute__ ((__packed__)); |
| 163 | |
| 164 | struct btrfs_mapping_tree { |
| 165 | struct extent_map_tree map_tree; |
| 166 | }; |
| 167 | |
| 168 | #define BTRFS_UUID_SIZE 16 |
| 169 | struct btrfs_dev_item { |
| 170 | /* the internal btrfs device id */ |
| 171 | __le64 devid; |
| 172 | |
| 173 | /* size of the device */ |
| 174 | __le64 total_bytes; |
| 175 | |
| 176 | /* bytes used */ |
| 177 | __le64 bytes_used; |
| 178 | |
| 179 | /* optimal io alignment for this device */ |
| 180 | __le32 io_align; |
| 181 | |
| 182 | /* optimal io width for this device */ |
| 183 | __le32 io_width; |
| 184 | |
| 185 | /* minimal io size for this device */ |
| 186 | __le32 sector_size; |
| 187 | |
| 188 | /* type and info about this device */ |
| 189 | __le64 type; |
| 190 | |
| 191 | /* expected generation for this device */ |
| 192 | __le64 generation; |
| 193 | |
| 194 | /* |
| 195 | * starting byte of this partition on the device, |
| 196 | * to allowr for stripe alignment in the future |
| 197 | */ |
| 198 | __le64 start_offset; |
| 199 | |
| 200 | /* grouping information for allocation decisions */ |
| 201 | __le32 dev_group; |
| 202 | |
| 203 | /* seek speed 0-100 where 100 is fastest */ |
| 204 | u8 seek_speed; |
| 205 | |
| 206 | /* bandwidth 0-100 where 100 is fastest */ |
| 207 | u8 bandwidth; |
| 208 | |
| 209 | /* btrfs generated uuid for this device */ |
| 210 | u8 uuid[BTRFS_UUID_SIZE]; |
| 211 | |
| 212 | /* uuid of FS who owns this device */ |
| 213 | u8 fsid[BTRFS_UUID_SIZE]; |
| 214 | } __attribute__ ((__packed__)); |
| 215 | |
| 216 | struct btrfs_stripe { |
| 217 | __le64 devid; |
| 218 | __le64 offset; |
| 219 | u8 dev_uuid[BTRFS_UUID_SIZE]; |
| 220 | } __attribute__ ((__packed__)); |
| 221 | |
| 222 | struct btrfs_chunk { |
| 223 | /* size of this chunk in bytes */ |
| 224 | __le64 length; |
| 225 | |
| 226 | /* objectid of the root referencing this chunk */ |
| 227 | __le64 owner; |
| 228 | |
| 229 | __le64 stripe_len; |
| 230 | __le64 type; |
| 231 | |
| 232 | /* optimal io alignment for this chunk */ |
| 233 | __le32 io_align; |
| 234 | |
| 235 | /* optimal io width for this chunk */ |
| 236 | __le32 io_width; |
| 237 | |
| 238 | /* minimal io size for this chunk */ |
| 239 | __le32 sector_size; |
| 240 | |
| 241 | /* 2^16 stripes is quite a lot, a second limit is the size of a single |
| 242 | * item in the btree |
| 243 | */ |
| 244 | __le16 num_stripes; |
| 245 | |
| 246 | /* sub stripes only matter for raid10 */ |
| 247 | __le16 sub_stripes; |
| 248 | struct btrfs_stripe stripe; |
| 249 | /* additional stripes go here */ |
| 250 | } __attribute__ ((__packed__)); |
| 251 | |
| 252 | static inline unsigned long btrfs_chunk_item_size(int num_stripes) |
| 253 | { |
| 254 | BUG_ON(num_stripes == 0); |
| 255 | return sizeof(struct btrfs_chunk) + |
| 256 | sizeof(struct btrfs_stripe) * (num_stripes - 1); |
| 257 | } |
| 258 | |
| 259 | #define BTRFS_FSID_SIZE 16 |
| 260 | #define BTRFS_HEADER_FLAG_WRITTEN (1 << 0) |
| 261 | |
| 262 | /* |
| 263 | * every tree block (leaf or node) starts with this header. |
| 264 | */ |
| 265 | struct btrfs_header { |
| 266 | /* these first four must match the super block */ |
| 267 | u8 csum[BTRFS_CSUM_SIZE]; |
| 268 | u8 fsid[BTRFS_FSID_SIZE]; /* FS specific uuid */ |
| 269 | __le64 bytenr; /* which block this node is supposed to live in */ |
| 270 | __le64 flags; |
| 271 | |
| 272 | /* allowed to be different from the super from here on down */ |
| 273 | u8 chunk_tree_uuid[BTRFS_UUID_SIZE]; |
| 274 | __le64 generation; |
| 275 | __le64 owner; |
| 276 | __le32 nritems; |
| 277 | u8 level; |
| 278 | } __attribute__ ((__packed__)); |
| 279 | |
| 280 | #define BTRFS_NODEPTRS_PER_BLOCK(r) (((r)->nodesize - \ |
| 281 | sizeof(struct btrfs_header)) / \ |
| 282 | sizeof(struct btrfs_key_ptr)) |
| 283 | #define __BTRFS_LEAF_DATA_SIZE(bs) ((bs) - sizeof(struct btrfs_header)) |
| 284 | #define BTRFS_LEAF_DATA_SIZE(r) (__BTRFS_LEAF_DATA_SIZE(r->leafsize)) |
| 285 | #define BTRFS_MAX_INLINE_DATA_SIZE(r) (BTRFS_LEAF_DATA_SIZE(r) - \ |
| 286 | sizeof(struct btrfs_item) - \ |
| 287 | sizeof(struct btrfs_file_extent_item)) |
| 288 | |
| 289 | #define BTRFS_SUPER_FLAG_SEEDING (1ULL << 32) |
| 290 | |
| 291 | /* |
| 292 | * this is a very generous portion of the super block, giving us |
| 293 | * room to translate 14 chunks with 3 stripes each. |
| 294 | */ |
| 295 | #define BTRFS_SYSTEM_CHUNK_ARRAY_SIZE 2048 |
| 296 | #define BTRFS_LABEL_SIZE 256 |
| 297 | |
| 298 | /* |
| 299 | * the super block basically lists the main trees of the FS |
| 300 | * it currently lacks any block count etc etc |
| 301 | */ |
| 302 | struct btrfs_super_block { |
| 303 | u8 csum[BTRFS_CSUM_SIZE]; |
| 304 | /* the first 4 fields must match struct btrfs_header */ |
| 305 | u8 fsid[BTRFS_FSID_SIZE]; /* FS specific uuid */ |
| 306 | __le64 bytenr; /* this block number */ |
| 307 | __le64 flags; |
| 308 | |
| 309 | /* allowed to be different from the btrfs_header from here own down */ |
| 310 | __le64 magic; |
| 311 | __le64 generation; |
| 312 | __le64 root; |
| 313 | __le64 chunk_root; |
| 314 | __le64 log_root; |
| 315 | |
| 316 | /* this will help find the new super based on the log root */ |
| 317 | __le64 log_root_transid; |
| 318 | __le64 total_bytes; |
| 319 | __le64 bytes_used; |
| 320 | __le64 root_dir_objectid; |
| 321 | __le64 num_devices; |
| 322 | __le32 sectorsize; |
| 323 | __le32 nodesize; |
| 324 | __le32 leafsize; |
| 325 | __le32 stripesize; |
| 326 | __le32 sys_chunk_array_size; |
| 327 | __le64 chunk_root_generation; |
| 328 | __le64 compat_flags; |
| 329 | __le64 compat_ro_flags; |
| 330 | __le64 incompat_flags; |
| 331 | __le16 csum_type; |
| 332 | u8 root_level; |
| 333 | u8 chunk_root_level; |
| 334 | u8 log_root_level; |
| 335 | struct btrfs_dev_item dev_item; |
| 336 | |
| 337 | char label[BTRFS_LABEL_SIZE]; |
| 338 | |
| 339 | /* future expansion */ |
| 340 | __le64 reserved[32]; |
| 341 | u8 sys_chunk_array[BTRFS_SYSTEM_CHUNK_ARRAY_SIZE]; |
| 342 | } __attribute__ ((__packed__)); |
| 343 | |
| 344 | /* |
| 345 | * Compat flags that we support. If any incompat flags are set other than the |
| 346 | * ones specified below then we will fail to mount |
| 347 | */ |
| 348 | #define BTRFS_FEATURE_COMPAT_SUPP 0x0 |
| 349 | #define BTRFS_FEATURE_COMPAT_RO_SUPP 0x0 |
| 350 | #define BTRFS_FEATURE_INCOMPAT_SUPP 0x0 |
| 351 | |
| 352 | /* |
| 353 | * A leaf is full of items. offset and size tell us where to find |
| 354 | * the item in the leaf (relative to the start of the data area) |
| 355 | */ |
| 356 | struct btrfs_item { |
| 357 | struct btrfs_disk_key key; |
| 358 | __le32 offset; |
| 359 | __le32 size; |
| 360 | } __attribute__ ((__packed__)); |
| 361 | |
| 362 | /* |
| 363 | * leaves have an item area and a data area: |
| 364 | * [item0, item1....itemN] [free space] [dataN...data1, data0] |
| 365 | * |
| 366 | * The data is separate from the items to get the keys closer together |
| 367 | * during searches. |
| 368 | */ |
| 369 | struct btrfs_leaf { |
| 370 | struct btrfs_header header; |
| 371 | struct btrfs_item items[]; |
| 372 | } __attribute__ ((__packed__)); |
| 373 | |
| 374 | /* |
| 375 | * all non-leaf blocks are nodes, they hold only keys and pointers to |
| 376 | * other blocks |
| 377 | */ |
| 378 | struct btrfs_key_ptr { |
| 379 | struct btrfs_disk_key key; |
| 380 | __le64 blockptr; |
| 381 | __le64 generation; |
| 382 | } __attribute__ ((__packed__)); |
| 383 | |
| 384 | struct btrfs_node { |
| 385 | struct btrfs_header header; |
| 386 | struct btrfs_key_ptr ptrs[]; |
| 387 | } __attribute__ ((__packed__)); |
| 388 | |
| 389 | /* |
| 390 | * btrfs_paths remember the path taken from the root down to the leaf. |
| 391 | * level 0 is always the leaf, and nodes[1...BTRFS_MAX_LEVEL] will point |
| 392 | * to any other levels that are present. |
| 393 | * |
| 394 | * The slots array records the index of the item or block pointer |
| 395 | * used while walking the tree. |
| 396 | */ |
| 397 | struct btrfs_path { |
| 398 | struct extent_buffer *nodes[BTRFS_MAX_LEVEL]; |
| 399 | int slots[BTRFS_MAX_LEVEL]; |
| 400 | /* if there is real range locking, this locks field will change */ |
| 401 | int locks[BTRFS_MAX_LEVEL]; |
| 402 | int reada; |
| 403 | /* keep some upper locks as we walk down */ |
| 404 | int keep_locks; |
| 405 | int skip_locking; |
| 406 | int lowest_level; |
| 407 | |
| 408 | /* |
| 409 | * set by btrfs_split_item, tells search_slot to keep all locks |
| 410 | * and to force calls to keep space in the nodes |
| 411 | */ |
| 412 | int search_for_split; |
| 413 | }; |
| 414 | |
| 415 | /* |
| 416 | * items in the extent btree are used to record the objectid of the |
| 417 | * owner of the block and the number of references |
| 418 | */ |
| 419 | struct btrfs_extent_item { |
| 420 | __le32 refs; |
| 421 | } __attribute__ ((__packed__)); |
| 422 | |
| 423 | struct btrfs_extent_ref { |
| 424 | __le64 root; |
| 425 | __le64 generation; |
| 426 | __le64 objectid; |
| 427 | __le32 num_refs; |
| 428 | } __attribute__ ((__packed__)); |
| 429 | |
| 430 | /* dev extents record free space on individual devices. The owner |
| 431 | * field points back to the chunk allocation mapping tree that allocated |
| 432 | * the extent. The chunk tree uuid field is a way to double check the owner |
| 433 | */ |
| 434 | struct btrfs_dev_extent { |
| 435 | __le64 chunk_tree; |
| 436 | __le64 chunk_objectid; |
| 437 | __le64 chunk_offset; |
| 438 | __le64 length; |
| 439 | u8 chunk_tree_uuid[BTRFS_UUID_SIZE]; |
| 440 | } __attribute__ ((__packed__)); |
| 441 | |
| 442 | struct btrfs_inode_ref { |
| 443 | __le64 index; |
| 444 | __le16 name_len; |
| 445 | /* name goes here */ |
| 446 | } __attribute__ ((__packed__)); |
| 447 | |
| 448 | struct btrfs_timespec { |
| 449 | __le64 sec; |
| 450 | __le32 nsec; |
| 451 | } __attribute__ ((__packed__)); |
| 452 | |
| 453 | enum btrfs_compression_type { |
| 454 | BTRFS_COMPRESS_NONE = 0, |
| 455 | BTRFS_COMPRESS_ZLIB = 1, |
| 456 | BTRFS_COMPRESS_LAST = 2, |
| 457 | }; |
| 458 | |
| 459 | struct btrfs_inode_item { |
| 460 | /* nfs style generation number */ |
| 461 | __le64 generation; |
| 462 | /* transid that last touched this inode */ |
| 463 | __le64 transid; |
| 464 | __le64 size; |
| 465 | __le64 nbytes; |
| 466 | __le64 block_group; |
| 467 | __le32 nlink; |
| 468 | __le32 uid; |
| 469 | __le32 gid; |
| 470 | __le32 mode; |
| 471 | __le64 rdev; |
| 472 | __le64 flags; |
| 473 | |
| 474 | /* modification sequence number for NFS */ |
| 475 | __le64 sequence; |
| 476 | |
| 477 | /* |
| 478 | * a little future expansion, for more than this we can |
| 479 | * just grow the inode item and version it |
| 480 | */ |
| 481 | __le64 reserved[4]; |
| 482 | struct btrfs_timespec atime; |
| 483 | struct btrfs_timespec ctime; |
| 484 | struct btrfs_timespec mtime; |
| 485 | struct btrfs_timespec otime; |
| 486 | } __attribute__ ((__packed__)); |
| 487 | |
| 488 | struct btrfs_dir_log_item { |
| 489 | __le64 end; |
| 490 | } __attribute__ ((__packed__)); |
| 491 | |
| 492 | struct btrfs_dir_item { |
| 493 | struct btrfs_disk_key location; |
| 494 | __le64 transid; |
| 495 | __le16 data_len; |
| 496 | __le16 name_len; |
| 497 | u8 type; |
| 498 | } __attribute__ ((__packed__)); |
| 499 | |
| 500 | struct btrfs_root_item { |
| 501 | struct btrfs_inode_item inode; |
| 502 | __le64 generation; |
| 503 | __le64 root_dirid; |
| 504 | __le64 bytenr; |
| 505 | __le64 byte_limit; |
| 506 | __le64 bytes_used; |
| 507 | __le64 last_snapshot; |
| 508 | __le64 flags; |
| 509 | __le32 refs; |
| 510 | struct btrfs_disk_key drop_progress; |
| 511 | u8 drop_level; |
| 512 | u8 level; |
| 513 | } __attribute__ ((__packed__)); |
| 514 | |
| 515 | /* |
| 516 | * this is used for both forward and backward root refs |
| 517 | */ |
| 518 | struct btrfs_root_ref { |
| 519 | __le64 dirid; |
| 520 | __le64 sequence; |
| 521 | __le16 name_len; |
| 522 | } __attribute__ ((__packed__)); |
| 523 | |
| 524 | #define BTRFS_FILE_EXTENT_INLINE 0 |
| 525 | #define BTRFS_FILE_EXTENT_REG 1 |
| 526 | #define BTRFS_FILE_EXTENT_PREALLOC 2 |
| 527 | |
| 528 | struct btrfs_file_extent_item { |
| 529 | /* |
| 530 | * transaction id that created this extent |
| 531 | */ |
| 532 | __le64 generation; |
| 533 | /* |
| 534 | * max number of bytes to hold this extent in ram |
| 535 | * when we split a compressed extent we can't know how big |
| 536 | * each of the resulting pieces will be. So, this is |
| 537 | * an upper limit on the size of the extent in ram instead of |
| 538 | * an exact limit. |
| 539 | */ |
| 540 | __le64 ram_bytes; |
| 541 | |
| 542 | /* |
| 543 | * 32 bits for the various ways we might encode the data, |
| 544 | * including compression and encryption. If any of these |
| 545 | * are set to something a given disk format doesn't understand |
| 546 | * it is treated like an incompat flag for reading and writing, |
| 547 | * but not for stat. |
| 548 | */ |
| 549 | u8 compression; |
| 550 | u8 encryption; |
| 551 | __le16 other_encoding; /* spare for later use */ |
| 552 | |
| 553 | /* are we inline data or a real extent? */ |
| 554 | u8 type; |
| 555 | |
| 556 | /* |
| 557 | * disk space consumed by the extent, checksum blocks are included |
| 558 | * in these numbers |
| 559 | */ |
| 560 | __le64 disk_bytenr; |
| 561 | __le64 disk_num_bytes; |
| 562 | /* |
| 563 | * the logical offset in file blocks (no csums) |
| 564 | * this extent record is for. This allows a file extent to point |
| 565 | * into the middle of an existing extent on disk, sharing it |
| 566 | * between two snapshots (useful if some bytes in the middle of the |
| 567 | * extent have changed |
| 568 | */ |
| 569 | __le64 offset; |
| 570 | /* |
| 571 | * the logical number of file blocks (no csums included). This |
| 572 | * always reflects the size uncompressed and without encoding. |
| 573 | */ |
| 574 | __le64 num_bytes; |
| 575 | |
| 576 | } __attribute__ ((__packed__)); |
| 577 | |
| 578 | struct btrfs_csum_item { |
| 579 | u8 csum; |
| 580 | } __attribute__ ((__packed__)); |
| 581 | |
| 582 | /* different types of block groups (and chunks) */ |
| 583 | #define BTRFS_BLOCK_GROUP_DATA (1 << 0) |
| 584 | #define BTRFS_BLOCK_GROUP_SYSTEM (1 << 1) |
| 585 | #define BTRFS_BLOCK_GROUP_METADATA (1 << 2) |
| 586 | #define BTRFS_BLOCK_GROUP_RAID0 (1 << 3) |
| 587 | #define BTRFS_BLOCK_GROUP_RAID1 (1 << 4) |
| 588 | #define BTRFS_BLOCK_GROUP_DUP (1 << 5) |
| 589 | #define BTRFS_BLOCK_GROUP_RAID10 (1 << 6) |
| 590 | |
| 591 | struct btrfs_block_group_item { |
| 592 | __le64 used; |
| 593 | __le64 chunk_objectid; |
| 594 | __le64 flags; |
| 595 | } __attribute__ ((__packed__)); |
| 596 | |
| 597 | struct btrfs_space_info { |
| 598 | u64 flags; |
| 599 | |
| 600 | u64 total_bytes; /* total bytes in the space */ |
| 601 | u64 bytes_used; /* total bytes used on disk */ |
| 602 | u64 bytes_pinned; /* total bytes pinned, will be freed when the |
| 603 | transaction finishes */ |
| 604 | u64 bytes_reserved; /* total bytes the allocator has reserved for |
| 605 | current allocations */ |
| 606 | u64 bytes_readonly; /* total bytes that are read only */ |
| 607 | |
| 608 | /* delalloc accounting */ |
| 609 | u64 bytes_delalloc; /* number of bytes reserved for allocation, |
| 610 | this space is not necessarily reserved yet |
| 611 | by the allocator */ |
| 612 | u64 bytes_may_use; /* number of bytes that may be used for |
| 613 | delalloc */ |
| 614 | |
| 615 | int full; /* indicates that we cannot allocate any more |
| 616 | chunks for this space */ |
| 617 | int force_alloc; /* set if we need to force a chunk alloc for |
| 618 | this space */ |
| 619 | |
| 620 | struct list_head list; |
| 621 | |
| 622 | /* for block groups in our same type */ |
| 623 | struct list_head block_groups; |
| 624 | spinlock_t lock; |
| 625 | struct rw_semaphore groups_sem; |
| 626 | }; |
| 627 | |
| 628 | struct btrfs_free_space { |
| 629 | struct rb_node bytes_index; |
| 630 | struct rb_node offset_index; |
| 631 | u64 offset; |
| 632 | u64 bytes; |
| 633 | }; |
| 634 | |
| 635 | struct btrfs_block_group_cache { |
| 636 | struct btrfs_key key; |
| 637 | struct btrfs_block_group_item item; |
| 638 | spinlock_t lock; |
| 639 | struct mutex alloc_mutex; |
| 640 | struct mutex cache_mutex; |
| 641 | u64 pinned; |
| 642 | u64 reserved; |
| 643 | u64 flags; |
| 644 | int cached; |
| 645 | int ro; |
| 646 | int dirty; |
| 647 | |
| 648 | struct btrfs_space_info *space_info; |
| 649 | |
| 650 | /* free space cache stuff */ |
| 651 | struct rb_root free_space_bytes; |
| 652 | struct rb_root free_space_offset; |
| 653 | |
| 654 | /* block group cache stuff */ |
| 655 | struct rb_node cache_node; |
| 656 | |
| 657 | /* for block groups in the same raid type */ |
| 658 | struct list_head list; |
| 659 | |
| 660 | /* usage count */ |
| 661 | atomic_t count; |
| 662 | }; |
| 663 | |
| 664 | struct btrfs_leaf_ref_tree { |
| 665 | struct rb_root root; |
| 666 | struct list_head list; |
| 667 | spinlock_t lock; |
| 668 | }; |
| 669 | |
| 670 | struct btrfs_device; |
| 671 | struct btrfs_fs_devices; |
| 672 | struct btrfs_fs_info { |
| 673 | u8 fsid[BTRFS_FSID_SIZE]; |
| 674 | u8 chunk_tree_uuid[BTRFS_UUID_SIZE]; |
| 675 | struct btrfs_root *extent_root; |
| 676 | struct btrfs_root *tree_root; |
| 677 | struct btrfs_root *chunk_root; |
| 678 | struct btrfs_root *dev_root; |
| 679 | struct btrfs_root *fs_root; |
| 680 | struct btrfs_root *csum_root; |
| 681 | |
| 682 | /* the log root tree is a directory of all the other log roots */ |
| 683 | struct btrfs_root *log_root_tree; |
| 684 | struct radix_tree_root fs_roots_radix; |
| 685 | |
| 686 | /* block group cache stuff */ |
| 687 | spinlock_t block_group_cache_lock; |
| 688 | struct rb_root block_group_cache_tree; |
| 689 | |
| 690 | struct extent_io_tree pinned_extents; |
| 691 | |
| 692 | /* logical->physical extent mapping */ |
| 693 | struct btrfs_mapping_tree mapping_tree; |
| 694 | |
| 695 | u64 generation; |
| 696 | u64 last_trans_committed; |
| 697 | u64 last_trans_new_blockgroup; |
| 698 | u64 open_ioctl_trans; |
| 699 | unsigned long mount_opt; |
| 700 | u64 max_extent; |
| 701 | u64 max_inline; |
| 702 | u64 alloc_start; |
| 703 | struct btrfs_transaction *running_transaction; |
| 704 | wait_queue_head_t transaction_throttle; |
| 705 | wait_queue_head_t transaction_wait; |
| 706 | wait_queue_head_t async_submit_wait; |
| 707 | |
| 708 | struct btrfs_super_block super_copy; |
| 709 | struct btrfs_super_block super_for_commit; |
| 710 | struct block_device *__bdev; |
| 711 | struct super_block *sb; |
| 712 | struct inode *btree_inode; |
| 713 | struct backing_dev_info bdi; |
| 714 | struct mutex trans_mutex; |
| 715 | struct mutex tree_log_mutex; |
| 716 | struct mutex transaction_kthread_mutex; |
| 717 | struct mutex cleaner_mutex; |
| 718 | struct mutex pinned_mutex; |
| 719 | struct mutex chunk_mutex; |
| 720 | struct mutex drop_mutex; |
| 721 | struct mutex volume_mutex; |
| 722 | struct mutex tree_reloc_mutex; |
| 723 | struct list_head trans_list; |
| 724 | struct list_head hashers; |
| 725 | struct list_head dead_roots; |
| 726 | |
| 727 | atomic_t nr_async_submits; |
| 728 | atomic_t async_submit_draining; |
| 729 | atomic_t nr_async_bios; |
| 730 | atomic_t async_delalloc_pages; |
| 731 | |
| 732 | /* |
| 733 | * this is used by the balancing code to wait for all the pending |
| 734 | * ordered extents |
| 735 | */ |
| 736 | spinlock_t ordered_extent_lock; |
| 737 | struct list_head ordered_extents; |
| 738 | struct list_head delalloc_inodes; |
| 739 | |
| 740 | /* |
| 741 | * there is a pool of worker threads for checksumming during writes |
| 742 | * and a pool for checksumming after reads. This is because readers |
| 743 | * can run with FS locks held, and the writers may be waiting for |
| 744 | * those locks. We don't want ordering in the pending list to cause |
| 745 | * deadlocks, and so the two are serviced separately. |
| 746 | * |
| 747 | * A third pool does submit_bio to avoid deadlocking with the other |
| 748 | * two |
| 749 | */ |
| 750 | struct btrfs_workers workers; |
| 751 | struct btrfs_workers delalloc_workers; |
| 752 | struct btrfs_workers endio_workers; |
| 753 | struct btrfs_workers endio_meta_workers; |
| 754 | struct btrfs_workers endio_meta_write_workers; |
| 755 | struct btrfs_workers endio_write_workers; |
| 756 | struct btrfs_workers submit_workers; |
| 757 | /* |
| 758 | * fixup workers take dirty pages that didn't properly go through |
| 759 | * the cow mechanism and make them safe to write. It happens |
| 760 | * for the sys_munmap function call path |
| 761 | */ |
| 762 | struct btrfs_workers fixup_workers; |
| 763 | struct task_struct *transaction_kthread; |
| 764 | struct task_struct *cleaner_kthread; |
| 765 | int thread_pool_size; |
| 766 | |
| 767 | /* tree relocation relocated fields */ |
| 768 | struct list_head dead_reloc_roots; |
| 769 | struct btrfs_leaf_ref_tree reloc_ref_tree; |
| 770 | struct btrfs_leaf_ref_tree shared_ref_tree; |
| 771 | |
| 772 | struct kobject super_kobj; |
| 773 | struct completion kobj_unregister; |
| 774 | int do_barriers; |
| 775 | int closing; |
| 776 | int log_root_recovering; |
| 777 | atomic_t throttles; |
| 778 | atomic_t throttle_gen; |
| 779 | |
| 780 | u64 total_pinned; |
| 781 | struct list_head dirty_cowonly_roots; |
| 782 | |
| 783 | struct btrfs_fs_devices *fs_devices; |
| 784 | |
| 785 | /* |
| 786 | * the space_info list is almost entirely read only. It only changes |
| 787 | * when we add a new raid type to the FS, and that happens |
| 788 | * very rarely. RCU is used to protect it. |
| 789 | */ |
| 790 | struct list_head space_info; |
| 791 | |
| 792 | spinlock_t delalloc_lock; |
| 793 | spinlock_t new_trans_lock; |
| 794 | u64 delalloc_bytes; |
| 795 | u64 last_alloc; |
| 796 | u64 last_data_alloc; |
| 797 | |
| 798 | spinlock_t ref_cache_lock; |
| 799 | u64 total_ref_cache_size; |
| 800 | |
| 801 | u64 avail_data_alloc_bits; |
| 802 | u64 avail_metadata_alloc_bits; |
| 803 | u64 avail_system_alloc_bits; |
| 804 | u64 data_alloc_profile; |
| 805 | u64 metadata_alloc_profile; |
| 806 | u64 system_alloc_profile; |
| 807 | |
| 808 | void *bdev_holder; |
| 809 | }; |
| 810 | |
| 811 | /* |
| 812 | * in ram representation of the tree. extent_root is used for all allocations |
| 813 | * and for the extent tree extent_root root. |
| 814 | */ |
| 815 | struct btrfs_dirty_root; |
| 816 | struct btrfs_root { |
| 817 | struct extent_buffer *node; |
| 818 | |
| 819 | /* the node lock is held while changing the node pointer */ |
| 820 | spinlock_t node_lock; |
| 821 | |
| 822 | struct extent_buffer *commit_root; |
| 823 | struct btrfs_leaf_ref_tree *ref_tree; |
| 824 | struct btrfs_leaf_ref_tree ref_tree_struct; |
| 825 | struct btrfs_dirty_root *dirty_root; |
| 826 | struct btrfs_root *log_root; |
| 827 | struct btrfs_root *reloc_root; |
| 828 | |
| 829 | struct btrfs_root_item root_item; |
| 830 | struct btrfs_key root_key; |
| 831 | struct btrfs_fs_info *fs_info; |
| 832 | struct extent_io_tree dirty_log_pages; |
| 833 | |
| 834 | struct kobject root_kobj; |
| 835 | struct completion kobj_unregister; |
| 836 | struct mutex objectid_mutex; |
| 837 | |
| 838 | struct mutex log_mutex; |
| 839 | wait_queue_head_t log_writer_wait; |
| 840 | wait_queue_head_t log_commit_wait[2]; |
| 841 | atomic_t log_writers; |
| 842 | atomic_t log_commit[2]; |
| 843 | unsigned long log_transid; |
| 844 | unsigned long log_batch; |
| 845 | |
| 846 | u64 objectid; |
| 847 | u64 last_trans; |
| 848 | |
| 849 | /* data allocations are done in sectorsize units */ |
| 850 | u32 sectorsize; |
| 851 | |
| 852 | /* node allocations are done in nodesize units */ |
| 853 | u32 nodesize; |
| 854 | |
| 855 | /* leaf allocations are done in leafsize units */ |
| 856 | u32 leafsize; |
| 857 | |
| 858 | u32 stripesize; |
| 859 | |
| 860 | u32 type; |
| 861 | u64 highest_inode; |
| 862 | u64 last_inode_alloc; |
| 863 | int ref_cows; |
| 864 | int track_dirty; |
| 865 | u64 defrag_trans_start; |
| 866 | struct btrfs_key defrag_progress; |
| 867 | struct btrfs_key defrag_max; |
| 868 | int defrag_running; |
| 869 | int defrag_level; |
| 870 | char *name; |
| 871 | int in_sysfs; |
| 872 | |
| 873 | /* the dirty list is only used by non-reference counted roots */ |
| 874 | struct list_head dirty_list; |
| 875 | |
| 876 | spinlock_t list_lock; |
| 877 | struct list_head dead_list; |
| 878 | struct list_head orphan_list; |
| 879 | |
| 880 | /* |
| 881 | * right now this just gets used so that a root has its own devid |
| 882 | * for stat. It may be used for more later |
| 883 | */ |
| 884 | struct super_block anon_super; |
| 885 | }; |
| 886 | |
| 887 | /* |
| 888 | |
| 889 | * inode items have the data typically returned from stat and store other |
| 890 | * info about object characteristics. There is one for every file and dir in |
| 891 | * the FS |
| 892 | */ |
| 893 | #define BTRFS_INODE_ITEM_KEY 1 |
| 894 | #define BTRFS_INODE_REF_KEY 12 |
| 895 | #define BTRFS_XATTR_ITEM_KEY 24 |
| 896 | #define BTRFS_ORPHAN_ITEM_KEY 48 |
| 897 | /* reserve 2-15 close to the inode for later flexibility */ |
| 898 | |
| 899 | /* |
| 900 | * dir items are the name -> inode pointers in a directory. There is one |
| 901 | * for every name in a directory. |
| 902 | */ |
| 903 | #define BTRFS_DIR_LOG_ITEM_KEY 60 |
| 904 | #define BTRFS_DIR_LOG_INDEX_KEY 72 |
| 905 | #define BTRFS_DIR_ITEM_KEY 84 |
| 906 | #define BTRFS_DIR_INDEX_KEY 96 |
| 907 | /* |
| 908 | * extent data is for file data |
| 909 | */ |
| 910 | #define BTRFS_EXTENT_DATA_KEY 108 |
| 911 | |
| 912 | /* |
| 913 | * extent csums are stored in a separate tree and hold csums for |
| 914 | * an entire extent on disk. |
| 915 | */ |
| 916 | #define BTRFS_EXTENT_CSUM_KEY 128 |
| 917 | |
| 918 | /* |
| 919 | * root items point to tree roots. There are typically in the root |
| 920 | * tree used by the super block to find all the other trees |
| 921 | */ |
| 922 | #define BTRFS_ROOT_ITEM_KEY 132 |
| 923 | |
| 924 | /* |
| 925 | * root backrefs tie subvols and snapshots to the directory entries that |
| 926 | * reference them |
| 927 | */ |
| 928 | #define BTRFS_ROOT_BACKREF_KEY 144 |
| 929 | |
| 930 | /* |
| 931 | * root refs make a fast index for listing all of the snapshots and |
| 932 | * subvolumes referenced by a given root. They point directly to the |
| 933 | * directory item in the root that references the subvol |
| 934 | */ |
| 935 | #define BTRFS_ROOT_REF_KEY 156 |
| 936 | |
| 937 | /* |
| 938 | * extent items are in the extent map tree. These record which blocks |
| 939 | * are used, and how many references there are to each block |
| 940 | */ |
| 941 | #define BTRFS_EXTENT_ITEM_KEY 168 |
| 942 | #define BTRFS_EXTENT_REF_KEY 180 |
| 943 | |
| 944 | /* |
| 945 | * block groups give us hints into the extent allocation trees. Which |
| 946 | * blocks are free etc etc |
| 947 | */ |
| 948 | #define BTRFS_BLOCK_GROUP_ITEM_KEY 192 |
| 949 | |
| 950 | #define BTRFS_DEV_EXTENT_KEY 204 |
| 951 | #define BTRFS_DEV_ITEM_KEY 216 |
| 952 | #define BTRFS_CHUNK_ITEM_KEY 228 |
| 953 | |
| 954 | /* |
| 955 | * string items are for debugging. They just store a short string of |
| 956 | * data in the FS |
| 957 | */ |
| 958 | #define BTRFS_STRING_ITEM_KEY 253 |
| 959 | |
| 960 | #define BTRFS_MOUNT_NODATASUM (1 << 0) |
| 961 | #define BTRFS_MOUNT_NODATACOW (1 << 1) |
| 962 | #define BTRFS_MOUNT_NOBARRIER (1 << 2) |
| 963 | #define BTRFS_MOUNT_SSD (1 << 3) |
| 964 | #define BTRFS_MOUNT_DEGRADED (1 << 4) |
| 965 | #define BTRFS_MOUNT_COMPRESS (1 << 5) |
| 966 | |
| 967 | #define btrfs_clear_opt(o, opt) ((o) &= ~BTRFS_MOUNT_##opt) |
| 968 | #define btrfs_set_opt(o, opt) ((o) |= BTRFS_MOUNT_##opt) |
| 969 | #define btrfs_test_opt(root, opt) ((root)->fs_info->mount_opt & \ |
| 970 | BTRFS_MOUNT_##opt) |
| 971 | /* |
| 972 | * Inode flags |
| 973 | */ |
| 974 | #define BTRFS_INODE_NODATASUM (1 << 0) |
| 975 | #define BTRFS_INODE_NODATACOW (1 << 1) |
| 976 | #define BTRFS_INODE_READONLY (1 << 2) |
| 977 | #define BTRFS_INODE_NOCOMPRESS (1 << 3) |
| 978 | #define BTRFS_INODE_PREALLOC (1 << 4) |
| 979 | #define btrfs_clear_flag(inode, flag) (BTRFS_I(inode)->flags &= \ |
| 980 | ~BTRFS_INODE_##flag) |
| 981 | #define btrfs_set_flag(inode, flag) (BTRFS_I(inode)->flags |= \ |
| 982 | BTRFS_INODE_##flag) |
| 983 | #define btrfs_test_flag(inode, flag) (BTRFS_I(inode)->flags & \ |
| 984 | BTRFS_INODE_##flag) |
| 985 | /* some macros to generate set/get funcs for the struct fields. This |
| 986 | * assumes there is a lefoo_to_cpu for every type, so lets make a simple |
| 987 | * one for u8: |
| 988 | */ |
| 989 | #define le8_to_cpu(v) (v) |
| 990 | #define cpu_to_le8(v) (v) |
| 991 | #define __le8 u8 |
| 992 | |
| 993 | #define read_eb_member(eb, ptr, type, member, result) ( \ |
| 994 | read_extent_buffer(eb, (char *)(result), \ |
| 995 | ((unsigned long)(ptr)) + \ |
| 996 | offsetof(type, member), \ |
| 997 | sizeof(((type *)0)->member))) |
| 998 | |
| 999 | #define write_eb_member(eb, ptr, type, member, result) ( \ |
| 1000 | write_extent_buffer(eb, (char *)(result), \ |
| 1001 | ((unsigned long)(ptr)) + \ |
| 1002 | offsetof(type, member), \ |
| 1003 | sizeof(((type *)0)->member))) |
| 1004 | |
| 1005 | #ifndef BTRFS_SETGET_FUNCS |
| 1006 | #define BTRFS_SETGET_FUNCS(name, type, member, bits) \ |
| 1007 | u##bits btrfs_##name(struct extent_buffer *eb, type *s); \ |
| 1008 | void btrfs_set_##name(struct extent_buffer *eb, type *s, u##bits val); |
| 1009 | #endif |
| 1010 | |
| 1011 | #define BTRFS_SETGET_HEADER_FUNCS(name, type, member, bits) \ |
| 1012 | static inline u##bits btrfs_##name(struct extent_buffer *eb) \ |
| 1013 | { \ |
| 1014 | type *p = kmap_atomic(eb->first_page, KM_USER0); \ |
| 1015 | u##bits res = le##bits##_to_cpu(p->member); \ |
| 1016 | kunmap_atomic(p, KM_USER0); \ |
| 1017 | return res; \ |
| 1018 | } \ |
| 1019 | static inline void btrfs_set_##name(struct extent_buffer *eb, \ |
| 1020 | u##bits val) \ |
| 1021 | { \ |
| 1022 | type *p = kmap_atomic(eb->first_page, KM_USER0); \ |
| 1023 | p->member = cpu_to_le##bits(val); \ |
| 1024 | kunmap_atomic(p, KM_USER0); \ |
| 1025 | } |
| 1026 | |
| 1027 | #define BTRFS_SETGET_STACK_FUNCS(name, type, member, bits) \ |
| 1028 | static inline u##bits btrfs_##name(type *s) \ |
| 1029 | { \ |
| 1030 | return le##bits##_to_cpu(s->member); \ |
| 1031 | } \ |
| 1032 | static inline void btrfs_set_##name(type *s, u##bits val) \ |
| 1033 | { \ |
| 1034 | s->member = cpu_to_le##bits(val); \ |
| 1035 | } |
| 1036 | |
| 1037 | BTRFS_SETGET_FUNCS(device_type, struct btrfs_dev_item, type, 64); |
| 1038 | BTRFS_SETGET_FUNCS(device_total_bytes, struct btrfs_dev_item, total_bytes, 64); |
| 1039 | BTRFS_SETGET_FUNCS(device_bytes_used, struct btrfs_dev_item, bytes_used, 64); |
| 1040 | BTRFS_SETGET_FUNCS(device_io_align, struct btrfs_dev_item, io_align, 32); |
| 1041 | BTRFS_SETGET_FUNCS(device_io_width, struct btrfs_dev_item, io_width, 32); |
| 1042 | BTRFS_SETGET_FUNCS(device_start_offset, struct btrfs_dev_item, |
| 1043 | start_offset, 64); |
| 1044 | BTRFS_SETGET_FUNCS(device_sector_size, struct btrfs_dev_item, sector_size, 32); |
| 1045 | BTRFS_SETGET_FUNCS(device_id, struct btrfs_dev_item, devid, 64); |
| 1046 | BTRFS_SETGET_FUNCS(device_group, struct btrfs_dev_item, dev_group, 32); |
| 1047 | BTRFS_SETGET_FUNCS(device_seek_speed, struct btrfs_dev_item, seek_speed, 8); |
| 1048 | BTRFS_SETGET_FUNCS(device_bandwidth, struct btrfs_dev_item, bandwidth, 8); |
| 1049 | BTRFS_SETGET_FUNCS(device_generation, struct btrfs_dev_item, generation, 64); |
| 1050 | |
| 1051 | BTRFS_SETGET_STACK_FUNCS(stack_device_type, struct btrfs_dev_item, type, 64); |
| 1052 | BTRFS_SETGET_STACK_FUNCS(stack_device_total_bytes, struct btrfs_dev_item, |
| 1053 | total_bytes, 64); |
| 1054 | BTRFS_SETGET_STACK_FUNCS(stack_device_bytes_used, struct btrfs_dev_item, |
| 1055 | bytes_used, 64); |
| 1056 | BTRFS_SETGET_STACK_FUNCS(stack_device_io_align, struct btrfs_dev_item, |
| 1057 | io_align, 32); |
| 1058 | BTRFS_SETGET_STACK_FUNCS(stack_device_io_width, struct btrfs_dev_item, |
| 1059 | io_width, 32); |
| 1060 | BTRFS_SETGET_STACK_FUNCS(stack_device_sector_size, struct btrfs_dev_item, |
| 1061 | sector_size, 32); |
| 1062 | BTRFS_SETGET_STACK_FUNCS(stack_device_id, struct btrfs_dev_item, devid, 64); |
| 1063 | BTRFS_SETGET_STACK_FUNCS(stack_device_group, struct btrfs_dev_item, |
| 1064 | dev_group, 32); |
| 1065 | BTRFS_SETGET_STACK_FUNCS(stack_device_seek_speed, struct btrfs_dev_item, |
| 1066 | seek_speed, 8); |
| 1067 | BTRFS_SETGET_STACK_FUNCS(stack_device_bandwidth, struct btrfs_dev_item, |
| 1068 | bandwidth, 8); |
| 1069 | BTRFS_SETGET_STACK_FUNCS(stack_device_generation, struct btrfs_dev_item, |
| 1070 | generation, 64); |
| 1071 | |
| 1072 | static inline char *btrfs_device_uuid(struct btrfs_dev_item *d) |
| 1073 | { |
| 1074 | return (char *)d + offsetof(struct btrfs_dev_item, uuid); |
| 1075 | } |
| 1076 | |
| 1077 | static inline char *btrfs_device_fsid(struct btrfs_dev_item *d) |
| 1078 | { |
| 1079 | return (char *)d + offsetof(struct btrfs_dev_item, fsid); |
| 1080 | } |
| 1081 | |
| 1082 | BTRFS_SETGET_FUNCS(chunk_length, struct btrfs_chunk, length, 64); |
| 1083 | BTRFS_SETGET_FUNCS(chunk_owner, struct btrfs_chunk, owner, 64); |
| 1084 | BTRFS_SETGET_FUNCS(chunk_stripe_len, struct btrfs_chunk, stripe_len, 64); |
| 1085 | BTRFS_SETGET_FUNCS(chunk_io_align, struct btrfs_chunk, io_align, 32); |
| 1086 | BTRFS_SETGET_FUNCS(chunk_io_width, struct btrfs_chunk, io_width, 32); |
| 1087 | BTRFS_SETGET_FUNCS(chunk_sector_size, struct btrfs_chunk, sector_size, 32); |
| 1088 | BTRFS_SETGET_FUNCS(chunk_type, struct btrfs_chunk, type, 64); |
| 1089 | BTRFS_SETGET_FUNCS(chunk_num_stripes, struct btrfs_chunk, num_stripes, 16); |
| 1090 | BTRFS_SETGET_FUNCS(chunk_sub_stripes, struct btrfs_chunk, sub_stripes, 16); |
| 1091 | BTRFS_SETGET_FUNCS(stripe_devid, struct btrfs_stripe, devid, 64); |
| 1092 | BTRFS_SETGET_FUNCS(stripe_offset, struct btrfs_stripe, offset, 64); |
| 1093 | |
| 1094 | static inline char *btrfs_stripe_dev_uuid(struct btrfs_stripe *s) |
| 1095 | { |
| 1096 | return (char *)s + offsetof(struct btrfs_stripe, dev_uuid); |
| 1097 | } |
| 1098 | |
| 1099 | BTRFS_SETGET_STACK_FUNCS(stack_chunk_length, struct btrfs_chunk, length, 64); |
| 1100 | BTRFS_SETGET_STACK_FUNCS(stack_chunk_owner, struct btrfs_chunk, owner, 64); |
| 1101 | BTRFS_SETGET_STACK_FUNCS(stack_chunk_stripe_len, struct btrfs_chunk, |
| 1102 | stripe_len, 64); |
| 1103 | BTRFS_SETGET_STACK_FUNCS(stack_chunk_io_align, struct btrfs_chunk, |
| 1104 | io_align, 32); |
| 1105 | BTRFS_SETGET_STACK_FUNCS(stack_chunk_io_width, struct btrfs_chunk, |
| 1106 | io_width, 32); |
| 1107 | BTRFS_SETGET_STACK_FUNCS(stack_chunk_sector_size, struct btrfs_chunk, |
| 1108 | sector_size, 32); |
| 1109 | BTRFS_SETGET_STACK_FUNCS(stack_chunk_type, struct btrfs_chunk, type, 64); |
| 1110 | BTRFS_SETGET_STACK_FUNCS(stack_chunk_num_stripes, struct btrfs_chunk, |
| 1111 | num_stripes, 16); |
| 1112 | BTRFS_SETGET_STACK_FUNCS(stack_chunk_sub_stripes, struct btrfs_chunk, |
| 1113 | sub_stripes, 16); |
| 1114 | BTRFS_SETGET_STACK_FUNCS(stack_stripe_devid, struct btrfs_stripe, devid, 64); |
| 1115 | BTRFS_SETGET_STACK_FUNCS(stack_stripe_offset, struct btrfs_stripe, offset, 64); |
| 1116 | |
| 1117 | static inline struct btrfs_stripe *btrfs_stripe_nr(struct btrfs_chunk *c, |
| 1118 | int nr) |
| 1119 | { |
| 1120 | unsigned long offset = (unsigned long)c; |
| 1121 | offset += offsetof(struct btrfs_chunk, stripe); |
| 1122 | offset += nr * sizeof(struct btrfs_stripe); |
| 1123 | return (struct btrfs_stripe *)offset; |
| 1124 | } |
| 1125 | |
| 1126 | static inline char *btrfs_stripe_dev_uuid_nr(struct btrfs_chunk *c, int nr) |
| 1127 | { |
| 1128 | return btrfs_stripe_dev_uuid(btrfs_stripe_nr(c, nr)); |
| 1129 | } |
| 1130 | |
| 1131 | static inline u64 btrfs_stripe_offset_nr(struct extent_buffer *eb, |
| 1132 | struct btrfs_chunk *c, int nr) |
| 1133 | { |
| 1134 | return btrfs_stripe_offset(eb, btrfs_stripe_nr(c, nr)); |
| 1135 | } |
| 1136 | |
| 1137 | static inline void btrfs_set_stripe_offset_nr(struct extent_buffer *eb, |
| 1138 | struct btrfs_chunk *c, int nr, |
| 1139 | u64 val) |
| 1140 | { |
| 1141 | btrfs_set_stripe_offset(eb, btrfs_stripe_nr(c, nr), val); |
| 1142 | } |
| 1143 | |
| 1144 | static inline u64 btrfs_stripe_devid_nr(struct extent_buffer *eb, |
| 1145 | struct btrfs_chunk *c, int nr) |
| 1146 | { |
| 1147 | return btrfs_stripe_devid(eb, btrfs_stripe_nr(c, nr)); |
| 1148 | } |
| 1149 | |
| 1150 | static inline void btrfs_set_stripe_devid_nr(struct extent_buffer *eb, |
| 1151 | struct btrfs_chunk *c, int nr, |
| 1152 | u64 val) |
| 1153 | { |
| 1154 | btrfs_set_stripe_devid(eb, btrfs_stripe_nr(c, nr), val); |
| 1155 | } |
| 1156 | |
| 1157 | /* struct btrfs_block_group_item */ |
| 1158 | BTRFS_SETGET_STACK_FUNCS(block_group_used, struct btrfs_block_group_item, |
| 1159 | used, 64); |
| 1160 | BTRFS_SETGET_FUNCS(disk_block_group_used, struct btrfs_block_group_item, |
| 1161 | used, 64); |
| 1162 | BTRFS_SETGET_STACK_FUNCS(block_group_chunk_objectid, |
| 1163 | struct btrfs_block_group_item, chunk_objectid, 64); |
| 1164 | |
| 1165 | BTRFS_SETGET_FUNCS(disk_block_group_chunk_objectid, |
| 1166 | struct btrfs_block_group_item, chunk_objectid, 64); |
| 1167 | BTRFS_SETGET_FUNCS(disk_block_group_flags, |
| 1168 | struct btrfs_block_group_item, flags, 64); |
| 1169 | BTRFS_SETGET_STACK_FUNCS(block_group_flags, |
| 1170 | struct btrfs_block_group_item, flags, 64); |
| 1171 | |
| 1172 | /* struct btrfs_inode_ref */ |
| 1173 | BTRFS_SETGET_FUNCS(inode_ref_name_len, struct btrfs_inode_ref, name_len, 16); |
| 1174 | BTRFS_SETGET_FUNCS(inode_ref_index, struct btrfs_inode_ref, index, 64); |
| 1175 | |
| 1176 | /* struct btrfs_inode_item */ |
| 1177 | BTRFS_SETGET_FUNCS(inode_generation, struct btrfs_inode_item, generation, 64); |
| 1178 | BTRFS_SETGET_FUNCS(inode_sequence, struct btrfs_inode_item, sequence, 64); |
| 1179 | BTRFS_SETGET_FUNCS(inode_transid, struct btrfs_inode_item, transid, 64); |
| 1180 | BTRFS_SETGET_FUNCS(inode_size, struct btrfs_inode_item, size, 64); |
| 1181 | BTRFS_SETGET_FUNCS(inode_nbytes, struct btrfs_inode_item, nbytes, 64); |
| 1182 | BTRFS_SETGET_FUNCS(inode_block_group, struct btrfs_inode_item, block_group, 64); |
| 1183 | BTRFS_SETGET_FUNCS(inode_nlink, struct btrfs_inode_item, nlink, 32); |
| 1184 | BTRFS_SETGET_FUNCS(inode_uid, struct btrfs_inode_item, uid, 32); |
| 1185 | BTRFS_SETGET_FUNCS(inode_gid, struct btrfs_inode_item, gid, 32); |
| 1186 | BTRFS_SETGET_FUNCS(inode_mode, struct btrfs_inode_item, mode, 32); |
| 1187 | BTRFS_SETGET_FUNCS(inode_rdev, struct btrfs_inode_item, rdev, 64); |
| 1188 | BTRFS_SETGET_FUNCS(inode_flags, struct btrfs_inode_item, flags, 64); |
| 1189 | |
| 1190 | static inline struct btrfs_timespec * |
| 1191 | btrfs_inode_atime(struct btrfs_inode_item *inode_item) |
| 1192 | { |
| 1193 | unsigned long ptr = (unsigned long)inode_item; |
| 1194 | ptr += offsetof(struct btrfs_inode_item, atime); |
| 1195 | return (struct btrfs_timespec *)ptr; |
| 1196 | } |
| 1197 | |
| 1198 | static inline struct btrfs_timespec * |
| 1199 | btrfs_inode_mtime(struct btrfs_inode_item *inode_item) |
| 1200 | { |
| 1201 | unsigned long ptr = (unsigned long)inode_item; |
| 1202 | ptr += offsetof(struct btrfs_inode_item, mtime); |
| 1203 | return (struct btrfs_timespec *)ptr; |
| 1204 | } |
| 1205 | |
| 1206 | static inline struct btrfs_timespec * |
| 1207 | btrfs_inode_ctime(struct btrfs_inode_item *inode_item) |
| 1208 | { |
| 1209 | unsigned long ptr = (unsigned long)inode_item; |
| 1210 | ptr += offsetof(struct btrfs_inode_item, ctime); |
| 1211 | return (struct btrfs_timespec *)ptr; |
| 1212 | } |
| 1213 | |
| 1214 | static inline struct btrfs_timespec * |
| 1215 | btrfs_inode_otime(struct btrfs_inode_item *inode_item) |
| 1216 | { |
| 1217 | unsigned long ptr = (unsigned long)inode_item; |
| 1218 | ptr += offsetof(struct btrfs_inode_item, otime); |
| 1219 | return (struct btrfs_timespec *)ptr; |
| 1220 | } |
| 1221 | |
| 1222 | BTRFS_SETGET_FUNCS(timespec_sec, struct btrfs_timespec, sec, 64); |
| 1223 | BTRFS_SETGET_FUNCS(timespec_nsec, struct btrfs_timespec, nsec, 32); |
| 1224 | |
| 1225 | /* struct btrfs_dev_extent */ |
| 1226 | BTRFS_SETGET_FUNCS(dev_extent_chunk_tree, struct btrfs_dev_extent, |
| 1227 | chunk_tree, 64); |
| 1228 | BTRFS_SETGET_FUNCS(dev_extent_chunk_objectid, struct btrfs_dev_extent, |
| 1229 | chunk_objectid, 64); |
| 1230 | BTRFS_SETGET_FUNCS(dev_extent_chunk_offset, struct btrfs_dev_extent, |
| 1231 | chunk_offset, 64); |
| 1232 | BTRFS_SETGET_FUNCS(dev_extent_length, struct btrfs_dev_extent, length, 64); |
| 1233 | |
| 1234 | static inline u8 *btrfs_dev_extent_chunk_tree_uuid(struct btrfs_dev_extent *dev) |
| 1235 | { |
| 1236 | unsigned long ptr = offsetof(struct btrfs_dev_extent, chunk_tree_uuid); |
| 1237 | return (u8 *)((unsigned long)dev + ptr); |
| 1238 | } |
| 1239 | |
| 1240 | /* struct btrfs_extent_ref */ |
| 1241 | BTRFS_SETGET_FUNCS(ref_root, struct btrfs_extent_ref, root, 64); |
| 1242 | BTRFS_SETGET_FUNCS(ref_generation, struct btrfs_extent_ref, generation, 64); |
| 1243 | BTRFS_SETGET_FUNCS(ref_objectid, struct btrfs_extent_ref, objectid, 64); |
| 1244 | BTRFS_SETGET_FUNCS(ref_num_refs, struct btrfs_extent_ref, num_refs, 32); |
| 1245 | |
| 1246 | BTRFS_SETGET_STACK_FUNCS(stack_ref_root, struct btrfs_extent_ref, root, 64); |
| 1247 | BTRFS_SETGET_STACK_FUNCS(stack_ref_generation, struct btrfs_extent_ref, |
| 1248 | generation, 64); |
| 1249 | BTRFS_SETGET_STACK_FUNCS(stack_ref_objectid, struct btrfs_extent_ref, |
| 1250 | objectid, 64); |
| 1251 | BTRFS_SETGET_STACK_FUNCS(stack_ref_num_refs, struct btrfs_extent_ref, |
| 1252 | num_refs, 32); |
| 1253 | |
| 1254 | /* struct btrfs_extent_item */ |
| 1255 | BTRFS_SETGET_FUNCS(extent_refs, struct btrfs_extent_item, refs, 32); |
| 1256 | BTRFS_SETGET_STACK_FUNCS(stack_extent_refs, struct btrfs_extent_item, |
| 1257 | refs, 32); |
| 1258 | |
| 1259 | /* struct btrfs_node */ |
| 1260 | BTRFS_SETGET_FUNCS(key_blockptr, struct btrfs_key_ptr, blockptr, 64); |
| 1261 | BTRFS_SETGET_FUNCS(key_generation, struct btrfs_key_ptr, generation, 64); |
| 1262 | |
| 1263 | static inline u64 btrfs_node_blockptr(struct extent_buffer *eb, int nr) |
| 1264 | { |
| 1265 | unsigned long ptr; |
| 1266 | ptr = offsetof(struct btrfs_node, ptrs) + |
| 1267 | sizeof(struct btrfs_key_ptr) * nr; |
| 1268 | return btrfs_key_blockptr(eb, (struct btrfs_key_ptr *)ptr); |
| 1269 | } |
| 1270 | |
| 1271 | static inline void btrfs_set_node_blockptr(struct extent_buffer *eb, |
| 1272 | int nr, u64 val) |
| 1273 | { |
| 1274 | unsigned long ptr; |
| 1275 | ptr = offsetof(struct btrfs_node, ptrs) + |
| 1276 | sizeof(struct btrfs_key_ptr) * nr; |
| 1277 | btrfs_set_key_blockptr(eb, (struct btrfs_key_ptr *)ptr, val); |
| 1278 | } |
| 1279 | |
| 1280 | static inline u64 btrfs_node_ptr_generation(struct extent_buffer *eb, int nr) |
| 1281 | { |
| 1282 | unsigned long ptr; |
| 1283 | ptr = offsetof(struct btrfs_node, ptrs) + |
| 1284 | sizeof(struct btrfs_key_ptr) * nr; |
| 1285 | return btrfs_key_generation(eb, (struct btrfs_key_ptr *)ptr); |
| 1286 | } |
| 1287 | |
| 1288 | static inline void btrfs_set_node_ptr_generation(struct extent_buffer *eb, |
| 1289 | int nr, u64 val) |
| 1290 | { |
| 1291 | unsigned long ptr; |
| 1292 | ptr = offsetof(struct btrfs_node, ptrs) + |
| 1293 | sizeof(struct btrfs_key_ptr) * nr; |
| 1294 | btrfs_set_key_generation(eb, (struct btrfs_key_ptr *)ptr, val); |
| 1295 | } |
| 1296 | |
| 1297 | static inline unsigned long btrfs_node_key_ptr_offset(int nr) |
| 1298 | { |
| 1299 | return offsetof(struct btrfs_node, ptrs) + |
| 1300 | sizeof(struct btrfs_key_ptr) * nr; |
| 1301 | } |
| 1302 | |
| 1303 | void btrfs_node_key(struct extent_buffer *eb, |
| 1304 | struct btrfs_disk_key *disk_key, int nr); |
| 1305 | |
| 1306 | static inline void btrfs_set_node_key(struct extent_buffer *eb, |
| 1307 | struct btrfs_disk_key *disk_key, int nr) |
| 1308 | { |
| 1309 | unsigned long ptr; |
| 1310 | ptr = btrfs_node_key_ptr_offset(nr); |
| 1311 | write_eb_member(eb, (struct btrfs_key_ptr *)ptr, |
| 1312 | struct btrfs_key_ptr, key, disk_key); |
| 1313 | } |
| 1314 | |
| 1315 | /* struct btrfs_item */ |
| 1316 | BTRFS_SETGET_FUNCS(item_offset, struct btrfs_item, offset, 32); |
| 1317 | BTRFS_SETGET_FUNCS(item_size, struct btrfs_item, size, 32); |
| 1318 | |
| 1319 | static inline unsigned long btrfs_item_nr_offset(int nr) |
| 1320 | { |
| 1321 | return offsetof(struct btrfs_leaf, items) + |
| 1322 | sizeof(struct btrfs_item) * nr; |
| 1323 | } |
| 1324 | |
| 1325 | static inline struct btrfs_item *btrfs_item_nr(struct extent_buffer *eb, |
| 1326 | int nr) |
| 1327 | { |
| 1328 | return (struct btrfs_item *)btrfs_item_nr_offset(nr); |
| 1329 | } |
| 1330 | |
| 1331 | static inline u32 btrfs_item_end(struct extent_buffer *eb, |
| 1332 | struct btrfs_item *item) |
| 1333 | { |
| 1334 | return btrfs_item_offset(eb, item) + btrfs_item_size(eb, item); |
| 1335 | } |
| 1336 | |
| 1337 | static inline u32 btrfs_item_end_nr(struct extent_buffer *eb, int nr) |
| 1338 | { |
| 1339 | return btrfs_item_end(eb, btrfs_item_nr(eb, nr)); |
| 1340 | } |
| 1341 | |
| 1342 | static inline u32 btrfs_item_offset_nr(struct extent_buffer *eb, int nr) |
| 1343 | { |
| 1344 | return btrfs_item_offset(eb, btrfs_item_nr(eb, nr)); |
| 1345 | } |
| 1346 | |
| 1347 | static inline u32 btrfs_item_size_nr(struct extent_buffer *eb, int nr) |
| 1348 | { |
| 1349 | return btrfs_item_size(eb, btrfs_item_nr(eb, nr)); |
| 1350 | } |
| 1351 | |
| 1352 | static inline void btrfs_item_key(struct extent_buffer *eb, |
| 1353 | struct btrfs_disk_key *disk_key, int nr) |
| 1354 | { |
| 1355 | struct btrfs_item *item = btrfs_item_nr(eb, nr); |
| 1356 | read_eb_member(eb, item, struct btrfs_item, key, disk_key); |
| 1357 | } |
| 1358 | |
| 1359 | static inline void btrfs_set_item_key(struct extent_buffer *eb, |
| 1360 | struct btrfs_disk_key *disk_key, int nr) |
| 1361 | { |
| 1362 | struct btrfs_item *item = btrfs_item_nr(eb, nr); |
| 1363 | write_eb_member(eb, item, struct btrfs_item, key, disk_key); |
| 1364 | } |
| 1365 | |
| 1366 | BTRFS_SETGET_FUNCS(dir_log_end, struct btrfs_dir_log_item, end, 64); |
| 1367 | |
| 1368 | /* |
| 1369 | * struct btrfs_root_ref |
| 1370 | */ |
| 1371 | BTRFS_SETGET_FUNCS(root_ref_dirid, struct btrfs_root_ref, dirid, 64); |
| 1372 | BTRFS_SETGET_FUNCS(root_ref_sequence, struct btrfs_root_ref, sequence, 64); |
| 1373 | BTRFS_SETGET_FUNCS(root_ref_name_len, struct btrfs_root_ref, name_len, 16); |
| 1374 | |
| 1375 | /* struct btrfs_dir_item */ |
| 1376 | BTRFS_SETGET_FUNCS(dir_data_len, struct btrfs_dir_item, data_len, 16); |
| 1377 | BTRFS_SETGET_FUNCS(dir_type, struct btrfs_dir_item, type, 8); |
| 1378 | BTRFS_SETGET_FUNCS(dir_name_len, struct btrfs_dir_item, name_len, 16); |
| 1379 | BTRFS_SETGET_FUNCS(dir_transid, struct btrfs_dir_item, transid, 64); |
| 1380 | |
| 1381 | static inline void btrfs_dir_item_key(struct extent_buffer *eb, |
| 1382 | struct btrfs_dir_item *item, |
| 1383 | struct btrfs_disk_key *key) |
| 1384 | { |
| 1385 | read_eb_member(eb, item, struct btrfs_dir_item, location, key); |
| 1386 | } |
| 1387 | |
| 1388 | static inline void btrfs_set_dir_item_key(struct extent_buffer *eb, |
| 1389 | struct btrfs_dir_item *item, |
| 1390 | struct btrfs_disk_key *key) |
| 1391 | { |
| 1392 | write_eb_member(eb, item, struct btrfs_dir_item, location, key); |
| 1393 | } |
| 1394 | |
| 1395 | /* struct btrfs_disk_key */ |
| 1396 | BTRFS_SETGET_STACK_FUNCS(disk_key_objectid, struct btrfs_disk_key, |
| 1397 | objectid, 64); |
| 1398 | BTRFS_SETGET_STACK_FUNCS(disk_key_offset, struct btrfs_disk_key, offset, 64); |
| 1399 | BTRFS_SETGET_STACK_FUNCS(disk_key_type, struct btrfs_disk_key, type, 8); |
| 1400 | |
| 1401 | static inline void btrfs_disk_key_to_cpu(struct btrfs_key *cpu, |
| 1402 | struct btrfs_disk_key *disk) |
| 1403 | { |
| 1404 | cpu->offset = le64_to_cpu(disk->offset); |
| 1405 | cpu->type = disk->type; |
| 1406 | cpu->objectid = le64_to_cpu(disk->objectid); |
| 1407 | } |
| 1408 | |
| 1409 | static inline void btrfs_cpu_key_to_disk(struct btrfs_disk_key *disk, |
| 1410 | struct btrfs_key *cpu) |
| 1411 | { |
| 1412 | disk->offset = cpu_to_le64(cpu->offset); |
| 1413 | disk->type = cpu->type; |
| 1414 | disk->objectid = cpu_to_le64(cpu->objectid); |
| 1415 | } |
| 1416 | |
| 1417 | static inline void btrfs_node_key_to_cpu(struct extent_buffer *eb, |
| 1418 | struct btrfs_key *key, int nr) |
| 1419 | { |
| 1420 | struct btrfs_disk_key disk_key; |
| 1421 | btrfs_node_key(eb, &disk_key, nr); |
| 1422 | btrfs_disk_key_to_cpu(key, &disk_key); |
| 1423 | } |
| 1424 | |
| 1425 | static inline void btrfs_item_key_to_cpu(struct extent_buffer *eb, |
| 1426 | struct btrfs_key *key, int nr) |
| 1427 | { |
| 1428 | struct btrfs_disk_key disk_key; |
| 1429 | btrfs_item_key(eb, &disk_key, nr); |
| 1430 | btrfs_disk_key_to_cpu(key, &disk_key); |
| 1431 | } |
| 1432 | |
| 1433 | static inline void btrfs_dir_item_key_to_cpu(struct extent_buffer *eb, |
| 1434 | struct btrfs_dir_item *item, |
| 1435 | struct btrfs_key *key) |
| 1436 | { |
| 1437 | struct btrfs_disk_key disk_key; |
| 1438 | btrfs_dir_item_key(eb, item, &disk_key); |
| 1439 | btrfs_disk_key_to_cpu(key, &disk_key); |
| 1440 | } |
| 1441 | |
| 1442 | |
| 1443 | static inline u8 btrfs_key_type(struct btrfs_key *key) |
| 1444 | { |
| 1445 | return key->type; |
| 1446 | } |
| 1447 | |
| 1448 | static inline void btrfs_set_key_type(struct btrfs_key *key, u8 val) |
| 1449 | { |
| 1450 | key->type = val; |
| 1451 | } |
| 1452 | |
| 1453 | /* struct btrfs_header */ |
| 1454 | BTRFS_SETGET_HEADER_FUNCS(header_bytenr, struct btrfs_header, bytenr, 64); |
| 1455 | BTRFS_SETGET_HEADER_FUNCS(header_generation, struct btrfs_header, |
| 1456 | generation, 64); |
| 1457 | BTRFS_SETGET_HEADER_FUNCS(header_owner, struct btrfs_header, owner, 64); |
| 1458 | BTRFS_SETGET_HEADER_FUNCS(header_nritems, struct btrfs_header, nritems, 32); |
| 1459 | BTRFS_SETGET_HEADER_FUNCS(header_flags, struct btrfs_header, flags, 64); |
| 1460 | BTRFS_SETGET_HEADER_FUNCS(header_level, struct btrfs_header, level, 8); |
| 1461 | |
| 1462 | static inline int btrfs_header_flag(struct extent_buffer *eb, u64 flag) |
| 1463 | { |
| 1464 | return (btrfs_header_flags(eb) & flag) == flag; |
| 1465 | } |
| 1466 | |
| 1467 | static inline int btrfs_set_header_flag(struct extent_buffer *eb, u64 flag) |
| 1468 | { |
| 1469 | u64 flags = btrfs_header_flags(eb); |
| 1470 | btrfs_set_header_flags(eb, flags | flag); |
| 1471 | return (flags & flag) == flag; |
| 1472 | } |
| 1473 | |
| 1474 | static inline int btrfs_clear_header_flag(struct extent_buffer *eb, u64 flag) |
| 1475 | { |
| 1476 | u64 flags = btrfs_header_flags(eb); |
| 1477 | btrfs_set_header_flags(eb, flags & ~flag); |
| 1478 | return (flags & flag) == flag; |
| 1479 | } |
| 1480 | |
| 1481 | static inline u8 *btrfs_header_fsid(struct extent_buffer *eb) |
| 1482 | { |
| 1483 | unsigned long ptr = offsetof(struct btrfs_header, fsid); |
| 1484 | return (u8 *)ptr; |
| 1485 | } |
| 1486 | |
| 1487 | static inline u8 *btrfs_header_chunk_tree_uuid(struct extent_buffer *eb) |
| 1488 | { |
| 1489 | unsigned long ptr = offsetof(struct btrfs_header, chunk_tree_uuid); |
| 1490 | return (u8 *)ptr; |
| 1491 | } |
| 1492 | |
| 1493 | static inline u8 *btrfs_super_fsid(struct extent_buffer *eb) |
| 1494 | { |
| 1495 | unsigned long ptr = offsetof(struct btrfs_super_block, fsid); |
| 1496 | return (u8 *)ptr; |
| 1497 | } |
| 1498 | |
| 1499 | static inline u8 *btrfs_header_csum(struct extent_buffer *eb) |
| 1500 | { |
| 1501 | unsigned long ptr = offsetof(struct btrfs_header, csum); |
| 1502 | return (u8 *)ptr; |
| 1503 | } |
| 1504 | |
| 1505 | static inline struct btrfs_node *btrfs_buffer_node(struct extent_buffer *eb) |
| 1506 | { |
| 1507 | return NULL; |
| 1508 | } |
| 1509 | |
| 1510 | static inline struct btrfs_leaf *btrfs_buffer_leaf(struct extent_buffer *eb) |
| 1511 | { |
| 1512 | return NULL; |
| 1513 | } |
| 1514 | |
| 1515 | static inline struct btrfs_header *btrfs_buffer_header(struct extent_buffer *eb) |
| 1516 | { |
| 1517 | return NULL; |
| 1518 | } |
| 1519 | |
| 1520 | static inline int btrfs_is_leaf(struct extent_buffer *eb) |
| 1521 | { |
| 1522 | return btrfs_header_level(eb) == 0; |
| 1523 | } |
| 1524 | |
| 1525 | /* struct btrfs_root_item */ |
| 1526 | BTRFS_SETGET_FUNCS(disk_root_generation, struct btrfs_root_item, |
| 1527 | generation, 64); |
| 1528 | BTRFS_SETGET_FUNCS(disk_root_refs, struct btrfs_root_item, refs, 32); |
| 1529 | BTRFS_SETGET_FUNCS(disk_root_bytenr, struct btrfs_root_item, bytenr, 64); |
| 1530 | BTRFS_SETGET_FUNCS(disk_root_level, struct btrfs_root_item, level, 8); |
| 1531 | |
| 1532 | BTRFS_SETGET_STACK_FUNCS(root_generation, struct btrfs_root_item, |
| 1533 | generation, 64); |
| 1534 | BTRFS_SETGET_STACK_FUNCS(root_bytenr, struct btrfs_root_item, bytenr, 64); |
| 1535 | BTRFS_SETGET_STACK_FUNCS(root_level, struct btrfs_root_item, level, 8); |
| 1536 | BTRFS_SETGET_STACK_FUNCS(root_dirid, struct btrfs_root_item, root_dirid, 64); |
| 1537 | BTRFS_SETGET_STACK_FUNCS(root_refs, struct btrfs_root_item, refs, 32); |
| 1538 | BTRFS_SETGET_STACK_FUNCS(root_flags, struct btrfs_root_item, flags, 64); |
| 1539 | BTRFS_SETGET_STACK_FUNCS(root_used, struct btrfs_root_item, bytes_used, 64); |
| 1540 | BTRFS_SETGET_STACK_FUNCS(root_limit, struct btrfs_root_item, byte_limit, 64); |
| 1541 | BTRFS_SETGET_STACK_FUNCS(root_last_snapshot, struct btrfs_root_item, |
| 1542 | last_snapshot, 64); |
| 1543 | |
| 1544 | /* struct btrfs_super_block */ |
| 1545 | |
| 1546 | BTRFS_SETGET_STACK_FUNCS(super_bytenr, struct btrfs_super_block, bytenr, 64); |
| 1547 | BTRFS_SETGET_STACK_FUNCS(super_flags, struct btrfs_super_block, flags, 64); |
| 1548 | BTRFS_SETGET_STACK_FUNCS(super_generation, struct btrfs_super_block, |
| 1549 | generation, 64); |
| 1550 | BTRFS_SETGET_STACK_FUNCS(super_root, struct btrfs_super_block, root, 64); |
| 1551 | BTRFS_SETGET_STACK_FUNCS(super_sys_array_size, |
| 1552 | struct btrfs_super_block, sys_chunk_array_size, 32); |
| 1553 | BTRFS_SETGET_STACK_FUNCS(super_chunk_root_generation, |
| 1554 | struct btrfs_super_block, chunk_root_generation, 64); |
| 1555 | BTRFS_SETGET_STACK_FUNCS(super_root_level, struct btrfs_super_block, |
| 1556 | root_level, 8); |
| 1557 | BTRFS_SETGET_STACK_FUNCS(super_chunk_root, struct btrfs_super_block, |
| 1558 | chunk_root, 64); |
| 1559 | BTRFS_SETGET_STACK_FUNCS(super_chunk_root_level, struct btrfs_super_block, |
| 1560 | chunk_root_level, 8); |
| 1561 | BTRFS_SETGET_STACK_FUNCS(super_log_root, struct btrfs_super_block, |
| 1562 | log_root, 64); |
| 1563 | BTRFS_SETGET_STACK_FUNCS(super_log_root_transid, struct btrfs_super_block, |
| 1564 | log_root_transid, 64); |
| 1565 | BTRFS_SETGET_STACK_FUNCS(super_log_root_level, struct btrfs_super_block, |
| 1566 | log_root_level, 8); |
| 1567 | BTRFS_SETGET_STACK_FUNCS(super_total_bytes, struct btrfs_super_block, |
| 1568 | total_bytes, 64); |
| 1569 | BTRFS_SETGET_STACK_FUNCS(super_bytes_used, struct btrfs_super_block, |
| 1570 | bytes_used, 64); |
| 1571 | BTRFS_SETGET_STACK_FUNCS(super_sectorsize, struct btrfs_super_block, |
| 1572 | sectorsize, 32); |
| 1573 | BTRFS_SETGET_STACK_FUNCS(super_nodesize, struct btrfs_super_block, |
| 1574 | nodesize, 32); |
| 1575 | BTRFS_SETGET_STACK_FUNCS(super_leafsize, struct btrfs_super_block, |
| 1576 | leafsize, 32); |
| 1577 | BTRFS_SETGET_STACK_FUNCS(super_stripesize, struct btrfs_super_block, |
| 1578 | stripesize, 32); |
| 1579 | BTRFS_SETGET_STACK_FUNCS(super_root_dir, struct btrfs_super_block, |
| 1580 | root_dir_objectid, 64); |
| 1581 | BTRFS_SETGET_STACK_FUNCS(super_num_devices, struct btrfs_super_block, |
| 1582 | num_devices, 64); |
| 1583 | BTRFS_SETGET_STACK_FUNCS(super_compat_flags, struct btrfs_super_block, |
| 1584 | compat_flags, 64); |
| 1585 | BTRFS_SETGET_STACK_FUNCS(super_compat_ro_flags, struct btrfs_super_block, |
| 1586 | compat_flags, 64); |
| 1587 | BTRFS_SETGET_STACK_FUNCS(super_incompat_flags, struct btrfs_super_block, |
| 1588 | incompat_flags, 64); |
| 1589 | BTRFS_SETGET_STACK_FUNCS(super_csum_type, struct btrfs_super_block, |
| 1590 | csum_type, 16); |
| 1591 | |
| 1592 | static inline int btrfs_super_csum_size(struct btrfs_super_block *s) |
| 1593 | { |
| 1594 | int t = btrfs_super_csum_type(s); |
| 1595 | BUG_ON(t >= ARRAY_SIZE(btrfs_csum_sizes)); |
| 1596 | return btrfs_csum_sizes[t]; |
| 1597 | } |
| 1598 | |
| 1599 | static inline unsigned long btrfs_leaf_data(struct extent_buffer *l) |
| 1600 | { |
| 1601 | return offsetof(struct btrfs_leaf, items); |
| 1602 | } |
| 1603 | |
| 1604 | /* struct btrfs_file_extent_item */ |
| 1605 | BTRFS_SETGET_FUNCS(file_extent_type, struct btrfs_file_extent_item, type, 8); |
| 1606 | |
| 1607 | static inline unsigned long |
| 1608 | btrfs_file_extent_inline_start(struct btrfs_file_extent_item *e) |
| 1609 | { |
| 1610 | unsigned long offset = (unsigned long)e; |
| 1611 | offset += offsetof(struct btrfs_file_extent_item, disk_bytenr); |
| 1612 | return offset; |
| 1613 | } |
| 1614 | |
| 1615 | static inline u32 btrfs_file_extent_calc_inline_size(u32 datasize) |
| 1616 | { |
| 1617 | return offsetof(struct btrfs_file_extent_item, disk_bytenr) + datasize; |
| 1618 | } |
| 1619 | |
| 1620 | BTRFS_SETGET_FUNCS(file_extent_disk_bytenr, struct btrfs_file_extent_item, |
| 1621 | disk_bytenr, 64); |
| 1622 | BTRFS_SETGET_FUNCS(file_extent_generation, struct btrfs_file_extent_item, |
| 1623 | generation, 64); |
| 1624 | BTRFS_SETGET_FUNCS(file_extent_disk_num_bytes, struct btrfs_file_extent_item, |
| 1625 | disk_num_bytes, 64); |
| 1626 | BTRFS_SETGET_FUNCS(file_extent_offset, struct btrfs_file_extent_item, |
| 1627 | offset, 64); |
| 1628 | BTRFS_SETGET_FUNCS(file_extent_num_bytes, struct btrfs_file_extent_item, |
| 1629 | num_bytes, 64); |
| 1630 | BTRFS_SETGET_FUNCS(file_extent_ram_bytes, struct btrfs_file_extent_item, |
| 1631 | ram_bytes, 64); |
| 1632 | BTRFS_SETGET_FUNCS(file_extent_compression, struct btrfs_file_extent_item, |
| 1633 | compression, 8); |
| 1634 | BTRFS_SETGET_FUNCS(file_extent_encryption, struct btrfs_file_extent_item, |
| 1635 | encryption, 8); |
| 1636 | BTRFS_SETGET_FUNCS(file_extent_other_encoding, struct btrfs_file_extent_item, |
| 1637 | other_encoding, 16); |
| 1638 | |
| 1639 | /* this returns the number of file bytes represented by the inline item. |
| 1640 | * If an item is compressed, this is the uncompressed size |
| 1641 | */ |
| 1642 | static inline u32 btrfs_file_extent_inline_len(struct extent_buffer *eb, |
| 1643 | struct btrfs_file_extent_item *e) |
| 1644 | { |
| 1645 | return btrfs_file_extent_ram_bytes(eb, e); |
| 1646 | } |
| 1647 | |
| 1648 | /* |
| 1649 | * this returns the number of bytes used by the item on disk, minus the |
| 1650 | * size of any extent headers. If a file is compressed on disk, this is |
| 1651 | * the compressed size |
| 1652 | */ |
| 1653 | static inline u32 btrfs_file_extent_inline_item_len(struct extent_buffer *eb, |
| 1654 | struct btrfs_item *e) |
| 1655 | { |
| 1656 | unsigned long offset; |
| 1657 | offset = offsetof(struct btrfs_file_extent_item, disk_bytenr); |
| 1658 | return btrfs_item_size(eb, e) - offset; |
| 1659 | } |
| 1660 | |
| 1661 | static inline struct btrfs_root *btrfs_sb(struct super_block *sb) |
| 1662 | { |
| 1663 | return sb->s_fs_info; |
| 1664 | } |
| 1665 | |
| 1666 | static inline int btrfs_set_root_name(struct btrfs_root *root, |
| 1667 | const char *name, int len) |
| 1668 | { |
| 1669 | /* if we already have a name just free it */ |
| 1670 | kfree(root->name); |
| 1671 | |
| 1672 | root->name = kmalloc(len+1, GFP_KERNEL); |
| 1673 | if (!root->name) |
| 1674 | return -ENOMEM; |
| 1675 | |
| 1676 | memcpy(root->name, name, len); |
| 1677 | root->name[len] = '\0'; |
| 1678 | |
| 1679 | return 0; |
| 1680 | } |
| 1681 | |
| 1682 | static inline u32 btrfs_level_size(struct btrfs_root *root, int level) |
| 1683 | { |
| 1684 | if (level == 0) |
| 1685 | return root->leafsize; |
| 1686 | return root->nodesize; |
| 1687 | } |
| 1688 | |
| 1689 | /* helper function to cast into the data area of the leaf. */ |
| 1690 | #define btrfs_item_ptr(leaf, slot, type) \ |
| 1691 | ((type *)(btrfs_leaf_data(leaf) + \ |
| 1692 | btrfs_item_offset_nr(leaf, slot))) |
| 1693 | |
| 1694 | #define btrfs_item_ptr_offset(leaf, slot) \ |
| 1695 | ((unsigned long)(btrfs_leaf_data(leaf) + \ |
| 1696 | btrfs_item_offset_nr(leaf, slot))) |
| 1697 | |
| 1698 | static inline struct dentry *fdentry(struct file *file) |
| 1699 | { |
| 1700 | return file->f_path.dentry; |
| 1701 | } |
| 1702 | |
| 1703 | /* extent-tree.c */ |
| 1704 | int btrfs_run_delayed_refs(struct btrfs_trans_handle *trans, |
| 1705 | struct btrfs_root *root, unsigned long count); |
| 1706 | int btrfs_lookup_extent(struct btrfs_root *root, u64 start, u64 len); |
| 1707 | int btrfs_update_pinned_extents(struct btrfs_root *root, |
| 1708 | u64 bytenr, u64 num, int pin); |
| 1709 | int btrfs_drop_leaf_ref(struct btrfs_trans_handle *trans, |
| 1710 | struct btrfs_root *root, struct extent_buffer *leaf); |
| 1711 | int btrfs_cross_ref_exist(struct btrfs_trans_handle *trans, |
| 1712 | struct btrfs_root *root, u64 objectid, u64 bytenr); |
| 1713 | int btrfs_copy_pinned(struct btrfs_root *root, struct extent_io_tree *copy); |
| 1714 | struct btrfs_block_group_cache *btrfs_lookup_block_group( |
| 1715 | struct btrfs_fs_info *info, |
| 1716 | u64 bytenr); |
| 1717 | u64 btrfs_find_block_group(struct btrfs_root *root, |
| 1718 | u64 search_start, u64 search_hint, int owner); |
| 1719 | struct extent_buffer *btrfs_alloc_free_block(struct btrfs_trans_handle *trans, |
| 1720 | struct btrfs_root *root, |
| 1721 | u32 blocksize, u64 parent, |
| 1722 | u64 root_objectid, |
| 1723 | u64 ref_generation, |
| 1724 | int level, |
| 1725 | u64 hint, |
| 1726 | u64 empty_size); |
| 1727 | struct extent_buffer *btrfs_init_new_buffer(struct btrfs_trans_handle *trans, |
| 1728 | struct btrfs_root *root, |
| 1729 | u64 bytenr, u32 blocksize, |
| 1730 | int level); |
| 1731 | int btrfs_alloc_extent(struct btrfs_trans_handle *trans, |
| 1732 | struct btrfs_root *root, |
| 1733 | u64 num_bytes, u64 parent, u64 min_bytes, |
| 1734 | u64 root_objectid, u64 ref_generation, |
| 1735 | u64 owner, u64 empty_size, u64 hint_byte, |
| 1736 | u64 search_end, struct btrfs_key *ins, u64 data); |
| 1737 | int btrfs_alloc_reserved_extent(struct btrfs_trans_handle *trans, |
| 1738 | struct btrfs_root *root, u64 parent, |
| 1739 | u64 root_objectid, u64 ref_generation, |
| 1740 | u64 owner, struct btrfs_key *ins); |
| 1741 | int btrfs_alloc_logged_extent(struct btrfs_trans_handle *trans, |
| 1742 | struct btrfs_root *root, u64 parent, |
| 1743 | u64 root_objectid, u64 ref_generation, |
| 1744 | u64 owner, struct btrfs_key *ins); |
| 1745 | int btrfs_reserve_extent(struct btrfs_trans_handle *trans, |
| 1746 | struct btrfs_root *root, |
| 1747 | u64 num_bytes, u64 min_alloc_size, |
| 1748 | u64 empty_size, u64 hint_byte, |
| 1749 | u64 search_end, struct btrfs_key *ins, |
| 1750 | u64 data); |
| 1751 | int btrfs_inc_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
| 1752 | struct extent_buffer *orig_buf, struct extent_buffer *buf, |
| 1753 | u32 *nr_extents); |
| 1754 | int btrfs_cache_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
| 1755 | struct extent_buffer *buf, u32 nr_extents); |
| 1756 | int btrfs_update_ref(struct btrfs_trans_handle *trans, |
| 1757 | struct btrfs_root *root, struct extent_buffer *orig_buf, |
| 1758 | struct extent_buffer *buf, int start_slot, int nr); |
| 1759 | int btrfs_free_extent(struct btrfs_trans_handle *trans, |
| 1760 | struct btrfs_root *root, |
| 1761 | u64 bytenr, u64 num_bytes, u64 parent, |
| 1762 | u64 root_objectid, u64 ref_generation, |
| 1763 | u64 owner_objectid, int pin); |
| 1764 | int btrfs_free_reserved_extent(struct btrfs_root *root, u64 start, u64 len); |
| 1765 | int btrfs_finish_extent_commit(struct btrfs_trans_handle *trans, |
| 1766 | struct btrfs_root *root, |
| 1767 | struct extent_io_tree *unpin); |
| 1768 | int btrfs_inc_extent_ref(struct btrfs_trans_handle *trans, |
| 1769 | struct btrfs_root *root, |
| 1770 | u64 bytenr, u64 num_bytes, u64 parent, |
| 1771 | u64 root_objectid, u64 ref_generation, |
| 1772 | u64 owner_objectid); |
| 1773 | int btrfs_update_extent_ref(struct btrfs_trans_handle *trans, |
| 1774 | struct btrfs_root *root, u64 bytenr, u64 num_bytes, |
| 1775 | u64 orig_parent, u64 parent, |
| 1776 | u64 root_objectid, u64 ref_generation, |
| 1777 | u64 owner_objectid); |
| 1778 | int btrfs_write_dirty_block_groups(struct btrfs_trans_handle *trans, |
| 1779 | struct btrfs_root *root); |
| 1780 | int btrfs_extent_readonly(struct btrfs_root *root, u64 bytenr); |
| 1781 | int btrfs_free_block_groups(struct btrfs_fs_info *info); |
| 1782 | int btrfs_read_block_groups(struct btrfs_root *root); |
| 1783 | int btrfs_make_block_group(struct btrfs_trans_handle *trans, |
| 1784 | struct btrfs_root *root, u64 bytes_used, |
| 1785 | u64 type, u64 chunk_objectid, u64 chunk_offset, |
| 1786 | u64 size); |
| 1787 | int btrfs_remove_block_group(struct btrfs_trans_handle *trans, |
| 1788 | struct btrfs_root *root, u64 group_start); |
| 1789 | int btrfs_relocate_block_group(struct btrfs_root *root, u64 group_start); |
| 1790 | int btrfs_free_reloc_root(struct btrfs_trans_handle *trans, |
| 1791 | struct btrfs_root *root); |
| 1792 | int btrfs_drop_dead_reloc_roots(struct btrfs_root *root); |
| 1793 | int btrfs_reloc_tree_cache_ref(struct btrfs_trans_handle *trans, |
| 1794 | struct btrfs_root *root, |
| 1795 | struct extent_buffer *buf, u64 orig_start); |
| 1796 | int btrfs_add_dead_reloc_root(struct btrfs_root *root); |
| 1797 | int btrfs_cleanup_reloc_trees(struct btrfs_root *root); |
| 1798 | int btrfs_reloc_clone_csums(struct inode *inode, u64 file_pos, u64 len); |
| 1799 | u64 btrfs_reduce_alloc_profile(struct btrfs_root *root, u64 flags); |
| 1800 | void btrfs_set_inode_space_info(struct btrfs_root *root, struct inode *ionde); |
| 1801 | void btrfs_clear_space_info_full(struct btrfs_fs_info *info); |
| 1802 | |
| 1803 | int btrfs_check_metadata_free_space(struct btrfs_root *root); |
| 1804 | int btrfs_check_data_free_space(struct btrfs_root *root, struct inode *inode, |
| 1805 | u64 bytes); |
| 1806 | void btrfs_free_reserved_data_space(struct btrfs_root *root, |
| 1807 | struct inode *inode, u64 bytes); |
| 1808 | void btrfs_delalloc_reserve_space(struct btrfs_root *root, struct inode *inode, |
| 1809 | u64 bytes); |
| 1810 | void btrfs_delalloc_free_space(struct btrfs_root *root, struct inode *inode, |
| 1811 | u64 bytes); |
| 1812 | /* ctree.c */ |
| 1813 | int btrfs_previous_item(struct btrfs_root *root, |
| 1814 | struct btrfs_path *path, u64 min_objectid, |
| 1815 | int type); |
| 1816 | int btrfs_merge_path(struct btrfs_trans_handle *trans, |
| 1817 | struct btrfs_root *root, |
| 1818 | struct btrfs_key *node_keys, |
| 1819 | u64 *nodes, int lowest_level); |
| 1820 | int btrfs_set_item_key_safe(struct btrfs_trans_handle *trans, |
| 1821 | struct btrfs_root *root, struct btrfs_path *path, |
| 1822 | struct btrfs_key *new_key); |
| 1823 | struct extent_buffer *btrfs_root_node(struct btrfs_root *root); |
| 1824 | struct extent_buffer *btrfs_lock_root_node(struct btrfs_root *root); |
| 1825 | int btrfs_find_next_key(struct btrfs_root *root, struct btrfs_path *path, |
| 1826 | struct btrfs_key *key, int lowest_level, |
| 1827 | int cache_only, u64 min_trans); |
| 1828 | int btrfs_search_forward(struct btrfs_root *root, struct btrfs_key *min_key, |
| 1829 | struct btrfs_key *max_key, |
| 1830 | struct btrfs_path *path, int cache_only, |
| 1831 | u64 min_trans); |
| 1832 | int btrfs_cow_block(struct btrfs_trans_handle *trans, |
| 1833 | struct btrfs_root *root, struct extent_buffer *buf, |
| 1834 | struct extent_buffer *parent, int parent_slot, |
| 1835 | struct extent_buffer **cow_ret); |
| 1836 | int btrfs_copy_root(struct btrfs_trans_handle *trans, |
| 1837 | struct btrfs_root *root, |
| 1838 | struct extent_buffer *buf, |
| 1839 | struct extent_buffer **cow_ret, u64 new_root_objectid); |
| 1840 | int btrfs_extend_item(struct btrfs_trans_handle *trans, struct btrfs_root |
| 1841 | *root, struct btrfs_path *path, u32 data_size); |
| 1842 | int btrfs_truncate_item(struct btrfs_trans_handle *trans, |
| 1843 | struct btrfs_root *root, |
| 1844 | struct btrfs_path *path, |
| 1845 | u32 new_size, int from_end); |
| 1846 | int btrfs_split_item(struct btrfs_trans_handle *trans, |
| 1847 | struct btrfs_root *root, |
| 1848 | struct btrfs_path *path, |
| 1849 | struct btrfs_key *new_key, |
| 1850 | unsigned long split_offset); |
| 1851 | int btrfs_search_slot(struct btrfs_trans_handle *trans, struct btrfs_root |
| 1852 | *root, struct btrfs_key *key, struct btrfs_path *p, int |
| 1853 | ins_len, int cow); |
| 1854 | int btrfs_realloc_node(struct btrfs_trans_handle *trans, |
| 1855 | struct btrfs_root *root, struct extent_buffer *parent, |
| 1856 | int start_slot, int cache_only, u64 *last_ret, |
| 1857 | struct btrfs_key *progress); |
| 1858 | void btrfs_release_path(struct btrfs_root *root, struct btrfs_path *p); |
| 1859 | struct btrfs_path *btrfs_alloc_path(void); |
| 1860 | void btrfs_free_path(struct btrfs_path *p); |
| 1861 | void btrfs_set_path_blocking(struct btrfs_path *p); |
| 1862 | void btrfs_unlock_up_safe(struct btrfs_path *p, int level); |
| 1863 | |
| 1864 | int btrfs_del_items(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
| 1865 | struct btrfs_path *path, int slot, int nr); |
| 1866 | int btrfs_del_leaf(struct btrfs_trans_handle *trans, |
| 1867 | struct btrfs_root *root, |
| 1868 | struct btrfs_path *path, u64 bytenr); |
| 1869 | static inline int btrfs_del_item(struct btrfs_trans_handle *trans, |
| 1870 | struct btrfs_root *root, |
| 1871 | struct btrfs_path *path) |
| 1872 | { |
| 1873 | return btrfs_del_items(trans, root, path, path->slots[0], 1); |
| 1874 | } |
| 1875 | |
| 1876 | int btrfs_insert_item(struct btrfs_trans_handle *trans, struct btrfs_root |
| 1877 | *root, struct btrfs_key *key, void *data, u32 data_size); |
| 1878 | int btrfs_insert_some_items(struct btrfs_trans_handle *trans, |
| 1879 | struct btrfs_root *root, |
| 1880 | struct btrfs_path *path, |
| 1881 | struct btrfs_key *cpu_key, u32 *data_size, |
| 1882 | int nr); |
| 1883 | int btrfs_insert_empty_items(struct btrfs_trans_handle *trans, |
| 1884 | struct btrfs_root *root, |
| 1885 | struct btrfs_path *path, |
| 1886 | struct btrfs_key *cpu_key, u32 *data_size, int nr); |
| 1887 | |
| 1888 | static inline int btrfs_insert_empty_item(struct btrfs_trans_handle *trans, |
| 1889 | struct btrfs_root *root, |
| 1890 | struct btrfs_path *path, |
| 1891 | struct btrfs_key *key, |
| 1892 | u32 data_size) |
| 1893 | { |
| 1894 | return btrfs_insert_empty_items(trans, root, path, key, &data_size, 1); |
| 1895 | } |
| 1896 | |
| 1897 | int btrfs_next_leaf(struct btrfs_root *root, struct btrfs_path *path); |
| 1898 | int btrfs_prev_leaf(struct btrfs_root *root, struct btrfs_path *path); |
| 1899 | int btrfs_leaf_free_space(struct btrfs_root *root, struct extent_buffer *leaf); |
| 1900 | int btrfs_drop_snapshot(struct btrfs_trans_handle *trans, struct btrfs_root |
| 1901 | *root); |
| 1902 | int btrfs_drop_subtree(struct btrfs_trans_handle *trans, |
| 1903 | struct btrfs_root *root, |
| 1904 | struct extent_buffer *node, |
| 1905 | struct extent_buffer *parent); |
| 1906 | /* root-item.c */ |
| 1907 | int btrfs_find_root_ref(struct btrfs_root *tree_root, |
| 1908 | struct btrfs_path *path, |
| 1909 | u64 root_id, u64 ref_id); |
| 1910 | int btrfs_add_root_ref(struct btrfs_trans_handle *trans, |
| 1911 | struct btrfs_root *tree_root, |
| 1912 | u64 root_id, u8 type, u64 ref_id, |
| 1913 | u64 dirid, u64 sequence, |
| 1914 | const char *name, int name_len); |
| 1915 | int btrfs_del_root(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
| 1916 | struct btrfs_key *key); |
| 1917 | int btrfs_insert_root(struct btrfs_trans_handle *trans, struct btrfs_root |
| 1918 | *root, struct btrfs_key *key, struct btrfs_root_item |
| 1919 | *item); |
| 1920 | int btrfs_update_root(struct btrfs_trans_handle *trans, struct btrfs_root |
| 1921 | *root, struct btrfs_key *key, struct btrfs_root_item |
| 1922 | *item); |
| 1923 | int btrfs_find_last_root(struct btrfs_root *root, u64 objectid, struct |
| 1924 | btrfs_root_item *item, struct btrfs_key *key); |
| 1925 | int btrfs_search_root(struct btrfs_root *root, u64 search_start, |
| 1926 | u64 *found_objectid); |
| 1927 | int btrfs_find_dead_roots(struct btrfs_root *root, u64 objectid, |
| 1928 | struct btrfs_root *latest_root); |
| 1929 | /* dir-item.c */ |
| 1930 | int btrfs_insert_dir_item(struct btrfs_trans_handle *trans, |
| 1931 | struct btrfs_root *root, const char *name, |
| 1932 | int name_len, u64 dir, |
| 1933 | struct btrfs_key *location, u8 type, u64 index); |
| 1934 | struct btrfs_dir_item *btrfs_lookup_dir_item(struct btrfs_trans_handle *trans, |
| 1935 | struct btrfs_root *root, |
| 1936 | struct btrfs_path *path, u64 dir, |
| 1937 | const char *name, int name_len, |
| 1938 | int mod); |
| 1939 | struct btrfs_dir_item * |
| 1940 | btrfs_lookup_dir_index_item(struct btrfs_trans_handle *trans, |
| 1941 | struct btrfs_root *root, |
| 1942 | struct btrfs_path *path, u64 dir, |
| 1943 | u64 objectid, const char *name, int name_len, |
| 1944 | int mod); |
| 1945 | struct btrfs_dir_item *btrfs_match_dir_item_name(struct btrfs_root *root, |
| 1946 | struct btrfs_path *path, |
| 1947 | const char *name, int name_len); |
| 1948 | int btrfs_delete_one_dir_name(struct btrfs_trans_handle *trans, |
| 1949 | struct btrfs_root *root, |
| 1950 | struct btrfs_path *path, |
| 1951 | struct btrfs_dir_item *di); |
| 1952 | int btrfs_insert_xattr_item(struct btrfs_trans_handle *trans, |
| 1953 | struct btrfs_root *root, const char *name, |
| 1954 | u16 name_len, const void *data, u16 data_len, |
| 1955 | u64 dir); |
| 1956 | struct btrfs_dir_item *btrfs_lookup_xattr(struct btrfs_trans_handle *trans, |
| 1957 | struct btrfs_root *root, |
| 1958 | struct btrfs_path *path, u64 dir, |
| 1959 | const char *name, u16 name_len, |
| 1960 | int mod); |
| 1961 | |
| 1962 | /* orphan.c */ |
| 1963 | int btrfs_insert_orphan_item(struct btrfs_trans_handle *trans, |
| 1964 | struct btrfs_root *root, u64 offset); |
| 1965 | int btrfs_del_orphan_item(struct btrfs_trans_handle *trans, |
| 1966 | struct btrfs_root *root, u64 offset); |
| 1967 | |
| 1968 | /* inode-map.c */ |
| 1969 | int btrfs_find_free_objectid(struct btrfs_trans_handle *trans, |
| 1970 | struct btrfs_root *fs_root, |
| 1971 | u64 dirid, u64 *objectid); |
| 1972 | int btrfs_find_highest_inode(struct btrfs_root *fs_root, u64 *objectid); |
| 1973 | |
| 1974 | /* inode-item.c */ |
| 1975 | int btrfs_insert_inode_ref(struct btrfs_trans_handle *trans, |
| 1976 | struct btrfs_root *root, |
| 1977 | const char *name, int name_len, |
| 1978 | u64 inode_objectid, u64 ref_objectid, u64 index); |
| 1979 | int btrfs_del_inode_ref(struct btrfs_trans_handle *trans, |
| 1980 | struct btrfs_root *root, |
| 1981 | const char *name, int name_len, |
| 1982 | u64 inode_objectid, u64 ref_objectid, u64 *index); |
| 1983 | int btrfs_insert_empty_inode(struct btrfs_trans_handle *trans, |
| 1984 | struct btrfs_root *root, |
| 1985 | struct btrfs_path *path, u64 objectid); |
| 1986 | int btrfs_lookup_inode(struct btrfs_trans_handle *trans, struct btrfs_root |
| 1987 | *root, struct btrfs_path *path, |
| 1988 | struct btrfs_key *location, int mod); |
| 1989 | |
| 1990 | /* file-item.c */ |
| 1991 | int btrfs_del_csums(struct btrfs_trans_handle *trans, |
| 1992 | struct btrfs_root *root, u64 bytenr, u64 len); |
| 1993 | int btrfs_lookup_bio_sums(struct btrfs_root *root, struct inode *inode, |
| 1994 | struct bio *bio, u32 *dst); |
| 1995 | int btrfs_insert_file_extent(struct btrfs_trans_handle *trans, |
| 1996 | struct btrfs_root *root, |
| 1997 | u64 objectid, u64 pos, |
| 1998 | u64 disk_offset, u64 disk_num_bytes, |
| 1999 | u64 num_bytes, u64 offset, u64 ram_bytes, |
| 2000 | u8 compression, u8 encryption, u16 other_encoding); |
| 2001 | int btrfs_lookup_file_extent(struct btrfs_trans_handle *trans, |
| 2002 | struct btrfs_root *root, |
| 2003 | struct btrfs_path *path, u64 objectid, |
| 2004 | u64 bytenr, int mod); |
| 2005 | int btrfs_csum_file_blocks(struct btrfs_trans_handle *trans, |
| 2006 | struct btrfs_root *root, |
| 2007 | struct btrfs_ordered_sum *sums); |
| 2008 | int btrfs_csum_one_bio(struct btrfs_root *root, struct inode *inode, |
| 2009 | struct bio *bio, u64 file_start, int contig); |
| 2010 | int btrfs_csum_file_bytes(struct btrfs_root *root, struct inode *inode, |
| 2011 | u64 start, unsigned long len); |
| 2012 | struct btrfs_csum_item *btrfs_lookup_csum(struct btrfs_trans_handle *trans, |
| 2013 | struct btrfs_root *root, |
| 2014 | struct btrfs_path *path, |
| 2015 | u64 bytenr, int cow); |
| 2016 | int btrfs_csum_truncate(struct btrfs_trans_handle *trans, |
| 2017 | struct btrfs_root *root, struct btrfs_path *path, |
| 2018 | u64 isize); |
| 2019 | int btrfs_lookup_csums_range(struct btrfs_root *root, u64 start, |
| 2020 | u64 end, struct list_head *list); |
| 2021 | /* inode.c */ |
| 2022 | |
| 2023 | /* RHEL and EL kernels have a patch that renames PG_checked to FsMisc */ |
| 2024 | #if defined(ClearPageFsMisc) && !defined(ClearPageChecked) |
| 2025 | #define ClearPageChecked ClearPageFsMisc |
| 2026 | #define SetPageChecked SetPageFsMisc |
| 2027 | #define PageChecked PageFsMisc |
| 2028 | #endif |
| 2029 | |
| 2030 | struct inode *btrfs_lookup_dentry(struct inode *dir, struct dentry *dentry); |
| 2031 | int btrfs_set_inode_index(struct inode *dir, u64 *index); |
| 2032 | int btrfs_unlink_inode(struct btrfs_trans_handle *trans, |
| 2033 | struct btrfs_root *root, |
| 2034 | struct inode *dir, struct inode *inode, |
| 2035 | const char *name, int name_len); |
| 2036 | int btrfs_add_link(struct btrfs_trans_handle *trans, |
| 2037 | struct inode *parent_inode, struct inode *inode, |
| 2038 | const char *name, int name_len, int add_backref, u64 index); |
| 2039 | int btrfs_truncate_inode_items(struct btrfs_trans_handle *trans, |
| 2040 | struct btrfs_root *root, |
| 2041 | struct inode *inode, u64 new_size, |
| 2042 | u32 min_type); |
| 2043 | |
| 2044 | int btrfs_start_delalloc_inodes(struct btrfs_root *root); |
| 2045 | int btrfs_set_extent_delalloc(struct inode *inode, u64 start, u64 end); |
| 2046 | int btrfs_writepages(struct address_space *mapping, |
| 2047 | struct writeback_control *wbc); |
| 2048 | int btrfs_create_subvol_root(struct btrfs_trans_handle *trans, |
| 2049 | struct btrfs_root *new_root, struct dentry *dentry, |
| 2050 | u64 new_dirid, u64 alloc_hint); |
| 2051 | int btrfs_merge_bio_hook(struct page *page, unsigned long offset, |
| 2052 | size_t size, struct bio *bio, unsigned long bio_flags); |
| 2053 | |
| 2054 | unsigned long btrfs_force_ra(struct address_space *mapping, |
| 2055 | struct file_ra_state *ra, struct file *file, |
| 2056 | pgoff_t offset, pgoff_t last_index); |
| 2057 | int btrfs_page_mkwrite(struct vm_area_struct *vma, struct page *page); |
| 2058 | int btrfs_readpage(struct file *file, struct page *page); |
| 2059 | void btrfs_delete_inode(struct inode *inode); |
| 2060 | void btrfs_put_inode(struct inode *inode); |
| 2061 | void btrfs_read_locked_inode(struct inode *inode); |
| 2062 | int btrfs_write_inode(struct inode *inode, int wait); |
| 2063 | void btrfs_dirty_inode(struct inode *inode); |
| 2064 | struct inode *btrfs_alloc_inode(struct super_block *sb); |
| 2065 | void btrfs_destroy_inode(struct inode *inode); |
| 2066 | int btrfs_init_cachep(void); |
| 2067 | void btrfs_destroy_cachep(void); |
| 2068 | long btrfs_ioctl_trans_end(struct file *file); |
| 2069 | struct inode *btrfs_ilookup(struct super_block *s, u64 objectid, |
| 2070 | struct btrfs_root *root, int wait); |
| 2071 | struct inode *btrfs_iget_locked(struct super_block *s, u64 objectid, |
| 2072 | struct btrfs_root *root); |
| 2073 | struct inode *btrfs_iget(struct super_block *s, struct btrfs_key *location, |
| 2074 | struct btrfs_root *root, int *is_new); |
| 2075 | int btrfs_commit_write(struct file *file, struct page *page, |
| 2076 | unsigned from, unsigned to); |
| 2077 | struct extent_map *btrfs_get_extent(struct inode *inode, struct page *page, |
| 2078 | size_t page_offset, u64 start, u64 end, |
| 2079 | int create); |
| 2080 | int btrfs_update_inode(struct btrfs_trans_handle *trans, |
| 2081 | struct btrfs_root *root, |
| 2082 | struct inode *inode); |
| 2083 | int btrfs_orphan_add(struct btrfs_trans_handle *trans, struct inode *inode); |
| 2084 | int btrfs_orphan_del(struct btrfs_trans_handle *trans, struct inode *inode); |
| 2085 | void btrfs_orphan_cleanup(struct btrfs_root *root); |
| 2086 | int btrfs_cont_expand(struct inode *inode, loff_t size); |
| 2087 | |
| 2088 | /* ioctl.c */ |
| 2089 | long btrfs_ioctl(struct file *file, unsigned int cmd, unsigned long arg); |
| 2090 | |
| 2091 | /* file.c */ |
| 2092 | int btrfs_sync_file(struct file *file, struct dentry *dentry, int datasync); |
| 2093 | int btrfs_drop_extent_cache(struct inode *inode, u64 start, u64 end, |
| 2094 | int skip_pinned); |
| 2095 | int btrfs_check_file(struct btrfs_root *root, struct inode *inode); |
| 2096 | extern struct file_operations btrfs_file_operations; |
| 2097 | int btrfs_drop_extents(struct btrfs_trans_handle *trans, |
| 2098 | struct btrfs_root *root, struct inode *inode, |
| 2099 | u64 start, u64 end, u64 inline_limit, u64 *hint_block); |
| 2100 | int btrfs_mark_extent_written(struct btrfs_trans_handle *trans, |
| 2101 | struct btrfs_root *root, |
| 2102 | struct inode *inode, u64 start, u64 end); |
| 2103 | int btrfs_release_file(struct inode *inode, struct file *file); |
| 2104 | |
| 2105 | /* tree-defrag.c */ |
| 2106 | int btrfs_defrag_leaves(struct btrfs_trans_handle *trans, |
| 2107 | struct btrfs_root *root, int cache_only); |
| 2108 | |
| 2109 | /* sysfs.c */ |
| 2110 | int btrfs_init_sysfs(void); |
| 2111 | void btrfs_exit_sysfs(void); |
| 2112 | int btrfs_sysfs_add_super(struct btrfs_fs_info *fs); |
| 2113 | int btrfs_sysfs_add_root(struct btrfs_root *root); |
| 2114 | void btrfs_sysfs_del_root(struct btrfs_root *root); |
| 2115 | void btrfs_sysfs_del_super(struct btrfs_fs_info *root); |
| 2116 | |
| 2117 | /* xattr.c */ |
| 2118 | ssize_t btrfs_listxattr(struct dentry *dentry, char *buffer, size_t size); |
| 2119 | |
| 2120 | /* super.c */ |
| 2121 | u64 btrfs_parse_size(char *str); |
| 2122 | int btrfs_parse_options(struct btrfs_root *root, char *options); |
| 2123 | int btrfs_sync_fs(struct super_block *sb, int wait); |
| 2124 | |
| 2125 | /* acl.c */ |
| 2126 | int btrfs_check_acl(struct inode *inode, int mask); |
| 2127 | int btrfs_init_acl(struct inode *inode, struct inode *dir); |
| 2128 | int btrfs_acl_chmod(struct inode *inode); |
| 2129 | |
| 2130 | /* free-space-cache.c */ |
| 2131 | int btrfs_add_free_space(struct btrfs_block_group_cache *block_group, |
| 2132 | u64 bytenr, u64 size); |
| 2133 | int btrfs_add_free_space_lock(struct btrfs_block_group_cache *block_group, |
| 2134 | u64 offset, u64 bytes); |
| 2135 | int btrfs_remove_free_space(struct btrfs_block_group_cache *block_group, |
| 2136 | u64 bytenr, u64 size); |
| 2137 | int btrfs_remove_free_space_lock(struct btrfs_block_group_cache *block_group, |
| 2138 | u64 offset, u64 bytes); |
| 2139 | void btrfs_remove_free_space_cache(struct btrfs_block_group_cache |
| 2140 | *block_group); |
| 2141 | struct btrfs_free_space *btrfs_find_free_space(struct btrfs_block_group_cache |
| 2142 | *block_group, u64 offset, |
| 2143 | u64 bytes); |
| 2144 | void btrfs_dump_free_space(struct btrfs_block_group_cache *block_group, |
| 2145 | u64 bytes); |
| 2146 | u64 btrfs_block_group_free_space(struct btrfs_block_group_cache *block_group); |
| 2147 | #endif |