1 /* SPDX-License-Identifier: GPL-2.0 */ 1 /* SPDX-License-Identifier: GPL-2.0 */
2 /* 2 /*
3 * Copyright (C) 2007 Oracle. All rights rese 3 * Copyright (C) 2007 Oracle. All rights reserved.
4 */ 4 */
5 5
6 #ifndef BTRFS_CTREE_H 6 #ifndef BTRFS_CTREE_H
7 #define BTRFS_CTREE_H 7 #define BTRFS_CTREE_H
8 8
9 #include "linux/cleanup.h" !! 9 #include <linux/mm.h>
10 #include <linux/pagemap.h> !! 10 #include <linux/sched/signal.h>
11 #include <linux/spinlock.h> !! 11 #include <linux/highmem.h>
12 #include <linux/rbtree.h> !! 12 #include <linux/fs.h>
13 #include <linux/mutex.h> !! 13 #include <linux/rwsem.h>
>> 14 #include <linux/semaphore.h>
>> 15 #include <linux/completion.h>
>> 16 #include <linux/backing-dev.h>
14 #include <linux/wait.h> 17 #include <linux/wait.h>
15 #include <linux/list.h> !! 18 #include <linux/slab.h>
16 #include <linux/atomic.h> !! 19 #include <trace/events/btrfs.h>
17 #include <linux/xarray.h> !! 20 #include <asm/unaligned.h>
>> 21 #include <linux/pagemap.h>
>> 22 #include <linux/btrfs.h>
>> 23 #include <linux/btrfs_tree.h>
>> 24 #include <linux/workqueue.h>
>> 25 #include <linux/security.h>
>> 26 #include <linux/sizes.h>
>> 27 #include <linux/dynamic_debug.h>
18 #include <linux/refcount.h> 28 #include <linux/refcount.h>
19 #include <uapi/linux/btrfs_tree.h> !! 29 #include <linux/crc32c.h>
20 #include "locking.h" !! 30 #include <linux/iomap.h>
21 #include "fs.h" <<
22 #include "accessors.h" <<
23 #include "extent-io-tree.h" 31 #include "extent-io-tree.h"
>> 32 #include "extent_io.h"
>> 33 #include "extent_map.h"
>> 34 #include "async-thread.h"
>> 35 #include "block-rsv.h"
>> 36 #include "locking.h"
24 37
25 struct extent_buffer; <<
26 struct btrfs_block_rsv; <<
27 struct btrfs_trans_handle; 38 struct btrfs_trans_handle;
>> 39 struct btrfs_transaction;
>> 40 struct btrfs_pending_snapshot;
>> 41 struct btrfs_delayed_ref_root;
>> 42 struct btrfs_space_info;
28 struct btrfs_block_group; 43 struct btrfs_block_group;
>> 44 extern struct kmem_cache *btrfs_trans_handle_cachep;
>> 45 extern struct kmem_cache *btrfs_bit_radix_cachep;
>> 46 extern struct kmem_cache *btrfs_path_cachep;
>> 47 extern struct kmem_cache *btrfs_free_space_cachep;
>> 48 extern struct kmem_cache *btrfs_free_space_bitmap_cachep;
>> 49 struct btrfs_ordered_sum;
>> 50 struct btrfs_ref;
>> 51 struct btrfs_bio;
>> 52
>> 53 #define BTRFS_MAGIC 0x4D5F53665248425FULL /* ascii _BHRfS_M, no null */
>> 54
>> 55 /*
>> 56 * Maximum number of mirrors that can be available for all profiles counting
>> 57 * the target device of dev-replace as one. During an active device replace
>> 58 * procedure, the target device of the copy operation is a mirror for the
>> 59 * filesystem data as well that can be used to read data in order to repair
>> 60 * read errors on other disks.
>> 61 *
>> 62 * Current value is derived from RAID1C4 with 4 copies.
>> 63 */
>> 64 #define BTRFS_MAX_MIRRORS (4 + 1)
>> 65
>> 66 #define BTRFS_MAX_LEVEL 8
>> 67
>> 68 #define BTRFS_OLDEST_GENERATION 0ULL
>> 69
>> 70 /*
>> 71 * we can actually store much bigger names, but lets not confuse the rest
>> 72 * of linux
>> 73 */
>> 74 #define BTRFS_NAME_LEN 255
>> 75
>> 76 /*
>> 77 * Theoretical limit is larger, but we keep this down to a sane
>> 78 * value. That should limit greatly the possibility of collisions on
>> 79 * inode ref items.
>> 80 */
>> 81 #define BTRFS_LINK_MAX 65535U
>> 82
>> 83 #define BTRFS_EMPTY_DIR_SIZE 0
>> 84
>> 85 /* ioprio of readahead is set to idle */
>> 86 #define BTRFS_IOPRIO_READA (IOPRIO_PRIO_VALUE(IOPRIO_CLASS_IDLE, 0))
>> 87
>> 88 #define BTRFS_DIRTY_METADATA_THRESH SZ_32M
>> 89
>> 90 /*
>> 91 * Use large batch size to reduce overhead of metadata updates. On the reader
>> 92 * side, we only read it when we are close to ENOSPC and the read overhead is
>> 93 * mostly related to the number of CPUs, so it is OK to use arbitrary large
>> 94 * value here.
>> 95 */
>> 96 #define BTRFS_TOTAL_BYTES_PINNED_BATCH SZ_128M
>> 97
>> 98 #define BTRFS_MAX_EXTENT_SIZE SZ_128M
>> 99
>> 100 /*
>> 101 * Deltas are an effective way to populate global statistics. Give macro names
>> 102 * to make it clear what we're doing. An example is discard_extents in
>> 103 * btrfs_free_space_ctl.
>> 104 */
>> 105 #define BTRFS_STAT_NR_ENTRIES 2
>> 106 #define BTRFS_STAT_CURR 0
>> 107 #define BTRFS_STAT_PREV 1
>> 108
>> 109 /*
>> 110 * Count how many BTRFS_MAX_EXTENT_SIZE cover the @size
>> 111 */
>> 112 static inline u32 count_max_extents(u64 size)
>> 113 {
>> 114 return div_u64(size + BTRFS_MAX_EXTENT_SIZE - 1, BTRFS_MAX_EXTENT_SIZE);
>> 115 }
>> 116
>> 117 static inline unsigned long btrfs_chunk_item_size(int num_stripes)
>> 118 {
>> 119 BUG_ON(num_stripes == 0);
>> 120 return sizeof(struct btrfs_chunk) +
>> 121 sizeof(struct btrfs_stripe) * (num_stripes - 1);
>> 122 }
>> 123
>> 124 /*
>> 125 * Runtime (in-memory) states of filesystem
>> 126 */
>> 127 enum {
>> 128 /* Global indicator of serious filesystem errors */
>> 129 BTRFS_FS_STATE_ERROR,
>> 130 /*
>> 131 * Filesystem is being remounted, allow to skip some operations, like
>> 132 * defrag
>> 133 */
>> 134 BTRFS_FS_STATE_REMOUNTING,
>> 135 /* Filesystem in RO mode */
>> 136 BTRFS_FS_STATE_RO,
>> 137 /* Track if a transaction abort has been reported on this filesystem */
>> 138 BTRFS_FS_STATE_TRANS_ABORTED,
>> 139 /*
>> 140 * Bio operations should be blocked on this filesystem because a source
>> 141 * or target device is being destroyed as part of a device replace
>> 142 */
>> 143 BTRFS_FS_STATE_DEV_REPLACING,
>> 144 /* The btrfs_fs_info created for self-tests */
>> 145 BTRFS_FS_STATE_DUMMY_FS_INFO,
>> 146
>> 147 BTRFS_FS_STATE_NO_CSUMS,
>> 148
>> 149 /* Indicates there was an error cleaning up a log tree. */
>> 150 BTRFS_FS_STATE_LOG_CLEANUP_ERROR,
>> 151 };
>> 152
>> 153 #define BTRFS_BACKREF_REV_MAX 256
>> 154 #define BTRFS_BACKREF_REV_SHIFT 56
>> 155 #define BTRFS_BACKREF_REV_MASK (((u64)BTRFS_BACKREF_REV_MAX - 1) << \
>> 156 BTRFS_BACKREF_REV_SHIFT)
>> 157
>> 158 #define BTRFS_OLD_BACKREF_REV 0
>> 159 #define BTRFS_MIXED_BACKREF_REV 1
>> 160
>> 161 /*
>> 162 * every tree block (leaf or node) starts with this header.
>> 163 */
>> 164 struct btrfs_header {
>> 165 /* these first four must match the super block */
>> 166 u8 csum[BTRFS_CSUM_SIZE];
>> 167 u8 fsid[BTRFS_FSID_SIZE]; /* FS specific uuid */
>> 168 __le64 bytenr; /* which block this node is supposed to live in */
>> 169 __le64 flags;
>> 170
>> 171 /* allowed to be different from the super from here on down */
>> 172 u8 chunk_tree_uuid[BTRFS_UUID_SIZE];
>> 173 __le64 generation;
>> 174 __le64 owner;
>> 175 __le32 nritems;
>> 176 u8 level;
>> 177 } __attribute__ ((__packed__));
>> 178
>> 179 /*
>> 180 * this is a very generous portion of the super block, giving us
>> 181 * room to translate 14 chunks with 3 stripes each.
>> 182 */
>> 183 #define BTRFS_SYSTEM_CHUNK_ARRAY_SIZE 2048
>> 184
>> 185 /*
>> 186 * just in case we somehow lose the roots and are not able to mount,
>> 187 * we store an array of the roots from previous transactions
>> 188 * in the super.
>> 189 */
>> 190 #define BTRFS_NUM_BACKUP_ROOTS 4
>> 191 struct btrfs_root_backup {
>> 192 __le64 tree_root;
>> 193 __le64 tree_root_gen;
>> 194
>> 195 __le64 chunk_root;
>> 196 __le64 chunk_root_gen;
>> 197
>> 198 __le64 extent_root;
>> 199 __le64 extent_root_gen;
>> 200
>> 201 __le64 fs_root;
>> 202 __le64 fs_root_gen;
>> 203
>> 204 __le64 dev_root;
>> 205 __le64 dev_root_gen;
>> 206
>> 207 __le64 csum_root;
>> 208 __le64 csum_root_gen;
>> 209
>> 210 __le64 total_bytes;
>> 211 __le64 bytes_used;
>> 212 __le64 num_devices;
>> 213 /* future */
>> 214 __le64 unused_64[4];
>> 215
>> 216 u8 tree_root_level;
>> 217 u8 chunk_root_level;
>> 218 u8 extent_root_level;
>> 219 u8 fs_root_level;
>> 220 u8 dev_root_level;
>> 221 u8 csum_root_level;
>> 222 /* future and to align */
>> 223 u8 unused_8[10];
>> 224 } __attribute__ ((__packed__));
>> 225
>> 226 #define BTRFS_SUPER_INFO_OFFSET SZ_64K
>> 227 #define BTRFS_SUPER_INFO_SIZE 4096
>> 228
>> 229 /*
>> 230 * the super block basically lists the main trees of the FS
>> 231 * it currently lacks any block count etc etc
>> 232 */
>> 233 struct btrfs_super_block {
>> 234 /* the first 4 fields must match struct btrfs_header */
>> 235 u8 csum[BTRFS_CSUM_SIZE];
>> 236 /* FS specific UUID, visible to user */
>> 237 u8 fsid[BTRFS_FSID_SIZE];
>> 238 __le64 bytenr; /* this block number */
>> 239 __le64 flags;
>> 240
>> 241 /* allowed to be different from the btrfs_header from here own down */
>> 242 __le64 magic;
>> 243 __le64 generation;
>> 244 __le64 root;
>> 245 __le64 chunk_root;
>> 246 __le64 log_root;
>> 247
>> 248 /* this will help find the new super based on the log root */
>> 249 __le64 log_root_transid;
>> 250 __le64 total_bytes;
>> 251 __le64 bytes_used;
>> 252 __le64 root_dir_objectid;
>> 253 __le64 num_devices;
>> 254 __le32 sectorsize;
>> 255 __le32 nodesize;
>> 256 __le32 __unused_leafsize;
>> 257 __le32 stripesize;
>> 258 __le32 sys_chunk_array_size;
>> 259 __le64 chunk_root_generation;
>> 260 __le64 compat_flags;
>> 261 __le64 compat_ro_flags;
>> 262 __le64 incompat_flags;
>> 263 __le16 csum_type;
>> 264 u8 root_level;
>> 265 u8 chunk_root_level;
>> 266 u8 log_root_level;
>> 267 struct btrfs_dev_item dev_item;
>> 268
>> 269 char label[BTRFS_LABEL_SIZE];
>> 270
>> 271 __le64 cache_generation;
>> 272 __le64 uuid_tree_generation;
>> 273
>> 274 /* the UUID written into btree blocks */
>> 275 u8 metadata_uuid[BTRFS_FSID_SIZE];
>> 276
>> 277 /* future expansion */
>> 278 __le64 reserved[28];
>> 279 u8 sys_chunk_array[BTRFS_SYSTEM_CHUNK_ARRAY_SIZE];
>> 280 struct btrfs_root_backup super_roots[BTRFS_NUM_BACKUP_ROOTS];
>> 281
>> 282 /* Padded to 4096 bytes */
>> 283 u8 padding[565];
>> 284 } __attribute__ ((__packed__));
>> 285 static_assert(sizeof(struct btrfs_super_block) == BTRFS_SUPER_INFO_SIZE);
>> 286
>> 287 /*
>> 288 * Compat flags that we support. If any incompat flags are set other than the
>> 289 * ones specified below then we will fail to mount
>> 290 */
>> 291 #define BTRFS_FEATURE_COMPAT_SUPP 0ULL
>> 292 #define BTRFS_FEATURE_COMPAT_SAFE_SET 0ULL
>> 293 #define BTRFS_FEATURE_COMPAT_SAFE_CLEAR 0ULL
>> 294
>> 295 #define BTRFS_FEATURE_COMPAT_RO_SUPP \
>> 296 (BTRFS_FEATURE_COMPAT_RO_FREE_SPACE_TREE | \
>> 297 BTRFS_FEATURE_COMPAT_RO_FREE_SPACE_TREE_VALID | \
>> 298 BTRFS_FEATURE_COMPAT_RO_VERITY)
>> 299
>> 300 #define BTRFS_FEATURE_COMPAT_RO_SAFE_SET 0ULL
>> 301 #define BTRFS_FEATURE_COMPAT_RO_SAFE_CLEAR 0ULL
>> 302
>> 303 #define BTRFS_FEATURE_INCOMPAT_SUPP \
>> 304 (BTRFS_FEATURE_INCOMPAT_MIXED_BACKREF | \
>> 305 BTRFS_FEATURE_INCOMPAT_DEFAULT_SUBVOL | \
>> 306 BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS | \
>> 307 BTRFS_FEATURE_INCOMPAT_BIG_METADATA | \
>> 308 BTRFS_FEATURE_INCOMPAT_COMPRESS_LZO | \
>> 309 BTRFS_FEATURE_INCOMPAT_COMPRESS_ZSTD | \
>> 310 BTRFS_FEATURE_INCOMPAT_RAID56 | \
>> 311 BTRFS_FEATURE_INCOMPAT_EXTENDED_IREF | \
>> 312 BTRFS_FEATURE_INCOMPAT_SKINNY_METADATA | \
>> 313 BTRFS_FEATURE_INCOMPAT_NO_HOLES | \
>> 314 BTRFS_FEATURE_INCOMPAT_METADATA_UUID | \
>> 315 BTRFS_FEATURE_INCOMPAT_RAID1C34 | \
>> 316 BTRFS_FEATURE_INCOMPAT_ZONED)
>> 317
>> 318 #define BTRFS_FEATURE_INCOMPAT_SAFE_SET \
>> 319 (BTRFS_FEATURE_INCOMPAT_EXTENDED_IREF)
>> 320 #define BTRFS_FEATURE_INCOMPAT_SAFE_CLEAR 0ULL
>> 321
>> 322 /*
>> 323 * A leaf is full of items. offset and size tell us where to find
>> 324 * the item in the leaf (relative to the start of the data area)
>> 325 */
>> 326 struct btrfs_item {
>> 327 struct btrfs_disk_key key;
>> 328 __le32 offset;
>> 329 __le32 size;
>> 330 } __attribute__ ((__packed__));
>> 331
>> 332 /*
>> 333 * leaves have an item area and a data area:
>> 334 * [item0, item1....itemN] [free space] [dataN...data1, data0]
>> 335 *
>> 336 * The data is separate from the items to get the keys closer together
>> 337 * during searches.
>> 338 */
>> 339 struct btrfs_leaf {
>> 340 struct btrfs_header header;
>> 341 struct btrfs_item items[];
>> 342 } __attribute__ ((__packed__));
>> 343
>> 344 /*
>> 345 * all non-leaf blocks are nodes, they hold only keys and pointers to
>> 346 * other blocks
>> 347 */
>> 348 struct btrfs_key_ptr {
>> 349 struct btrfs_disk_key key;
>> 350 __le64 blockptr;
>> 351 __le64 generation;
>> 352 } __attribute__ ((__packed__));
>> 353
>> 354 struct btrfs_node {
>> 355 struct btrfs_header header;
>> 356 struct btrfs_key_ptr ptrs[];
>> 357 } __attribute__ ((__packed__));
29 358
30 /* Read ahead values for struct btrfs_path.rea 359 /* Read ahead values for struct btrfs_path.reada */
31 enum { 360 enum {
32 READA_NONE, 361 READA_NONE,
33 READA_BACK, 362 READA_BACK,
34 READA_FORWARD, 363 READA_FORWARD,
35 /* 364 /*
36 * Similar to READA_FORWARD but unlike 365 * Similar to READA_FORWARD but unlike it:
37 * 366 *
38 * 1) It will trigger readahead even f 367 * 1) It will trigger readahead even for leaves that are not close to
39 * each other on disk; 368 * each other on disk;
40 * 2) It also triggers readahead for n 369 * 2) It also triggers readahead for nodes;
41 * 3) During a search, even when a nod 370 * 3) During a search, even when a node or leaf is already in memory, it
42 * will still trigger readahead for 371 * will still trigger readahead for other nodes and leaves that follow
43 * it. 372 * it.
44 * 373 *
45 * This is meant to be used only when 374 * This is meant to be used only when we know we are iterating over the
46 * entire tree or a very large part of 375 * entire tree or a very large part of it.
47 */ 376 */
48 READA_FORWARD_ALWAYS, 377 READA_FORWARD_ALWAYS,
49 }; 378 };
50 379
51 /* 380 /*
52 * btrfs_paths remember the path taken from th 381 * btrfs_paths remember the path taken from the root down to the leaf.
53 * level 0 is always the leaf, and nodes[1...B 382 * level 0 is always the leaf, and nodes[1...BTRFS_MAX_LEVEL] will point
54 * to any other levels that are present. 383 * to any other levels that are present.
55 * 384 *
56 * The slots array records the index of the it 385 * The slots array records the index of the item or block pointer
57 * used while walking the tree. 386 * used while walking the tree.
58 */ 387 */
59 struct btrfs_path { 388 struct btrfs_path {
60 struct extent_buffer *nodes[BTRFS_MAX_ 389 struct extent_buffer *nodes[BTRFS_MAX_LEVEL];
61 int slots[BTRFS_MAX_LEVEL]; 390 int slots[BTRFS_MAX_LEVEL];
62 /* if there is real range locking, thi 391 /* if there is real range locking, this locks field will change */
63 u8 locks[BTRFS_MAX_LEVEL]; 392 u8 locks[BTRFS_MAX_LEVEL];
64 u8 reada; 393 u8 reada;
65 /* keep some upper locks as we walk do 394 /* keep some upper locks as we walk down */
66 u8 lowest_level; 395 u8 lowest_level;
67 396
68 /* 397 /*
69 * set by btrfs_split_item, tells sear 398 * set by btrfs_split_item, tells search_slot to keep all locks
70 * and to force calls to keep space in 399 * and to force calls to keep space in the nodes
71 */ 400 */
72 unsigned int search_for_split:1; 401 unsigned int search_for_split:1;
73 unsigned int keep_locks:1; 402 unsigned int keep_locks:1;
74 unsigned int skip_locking:1; 403 unsigned int skip_locking:1;
75 unsigned int search_commit_root:1; 404 unsigned int search_commit_root:1;
76 unsigned int need_commit_sem:1; 405 unsigned int need_commit_sem:1;
77 unsigned int skip_release_on_error:1; 406 unsigned int skip_release_on_error:1;
78 /* 407 /*
79 * Indicate that new item (btrfs_searc 408 * Indicate that new item (btrfs_search_slot) is extending already
80 * existing item and ins_len contains 409 * existing item and ins_len contains only the data size and not item
81 * header (ie. sizeof(struct btrfs_ite 410 * header (ie. sizeof(struct btrfs_item) is not included).
82 */ 411 */
83 unsigned int search_for_extension:1; 412 unsigned int search_for_extension:1;
84 /* Stop search if any locks need to be <<
85 unsigned int nowait:1; <<
86 }; 413 };
>> 414 #define BTRFS_MAX_EXTENT_ITEM_SIZE(r) ((BTRFS_LEAF_DATA_SIZE(r->fs_info) >> 4) - \
>> 415 sizeof(struct btrfs_item))
>> 416 struct btrfs_dev_replace {
>> 417 u64 replace_state; /* see #define above */
>> 418 time64_t time_started; /* seconds since 1-Jan-1970 */
>> 419 time64_t time_stopped; /* seconds since 1-Jan-1970 */
>> 420 atomic64_t num_write_errors;
>> 421 atomic64_t num_uncorrectable_read_errors;
>> 422
>> 423 u64 cursor_left;
>> 424 u64 committed_cursor_left;
>> 425 u64 cursor_left_last_write_of_item;
>> 426 u64 cursor_right;
>> 427
>> 428 u64 cont_reading_from_srcdev_mode; /* see #define above */
>> 429
>> 430 int is_valid;
>> 431 int item_needs_writeback;
>> 432 struct btrfs_device *srcdev;
>> 433 struct btrfs_device *tgtdev;
>> 434
>> 435 struct mutex lock_finishing_cancel_unmount;
>> 436 struct rw_semaphore rwsem;
>> 437
>> 438 struct btrfs_scrub_progress scrub_progress;
>> 439
>> 440 struct percpu_counter bio_counter;
>> 441 wait_queue_head_t replace_wait;
>> 442 };
>> 443
>> 444 /*
>> 445 * free clusters are used to claim free space in relatively large chunks,
>> 446 * allowing us to do less seeky writes. They are used for all metadata
>> 447 * allocations. In ssd_spread mode they are also used for data allocations.
>> 448 */
>> 449 struct btrfs_free_cluster {
>> 450 spinlock_t lock;
>> 451 spinlock_t refill_lock;
>> 452 struct rb_root root;
>> 453
>> 454 /* largest extent in this cluster */
>> 455 u64 max_size;
>> 456
>> 457 /* first extent starting offset */
>> 458 u64 window_start;
>> 459
>> 460 /* We did a full search and couldn't create a cluster */
>> 461 bool fragmented;
>> 462
>> 463 struct btrfs_block_group *block_group;
>> 464 /*
>> 465 * when a cluster is allocated from a block group, we put the
>> 466 * cluster onto a list in the block group so that it can
>> 467 * be freed before the block group is freed.
>> 468 */
>> 469 struct list_head block_group_list;
>> 470 };
>> 471
>> 472 enum btrfs_caching_type {
>> 473 BTRFS_CACHE_NO,
>> 474 BTRFS_CACHE_STARTED,
>> 475 BTRFS_CACHE_FAST,
>> 476 BTRFS_CACHE_FINISHED,
>> 477 BTRFS_CACHE_ERROR,
>> 478 };
>> 479
>> 480 /*
>> 481 * Tree to record all locked full stripes of a RAID5/6 block group
>> 482 */
>> 483 struct btrfs_full_stripe_locks_tree {
>> 484 struct rb_root root;
>> 485 struct mutex lock;
>> 486 };
>> 487
>> 488 /* Discard control. */
>> 489 /*
>> 490 * Async discard uses multiple lists to differentiate the discard filter
>> 491 * parameters. Index 0 is for completely free block groups where we need to
>> 492 * ensure the entire block group is trimmed without being lossy. Indices
>> 493 * afterwards represent monotonically decreasing discard filter sizes to
>> 494 * prioritize what should be discarded next.
>> 495 */
>> 496 #define BTRFS_NR_DISCARD_LISTS 3
>> 497 #define BTRFS_DISCARD_INDEX_UNUSED 0
>> 498 #define BTRFS_DISCARD_INDEX_START 1
>> 499
>> 500 struct btrfs_discard_ctl {
>> 501 struct workqueue_struct *discard_workers;
>> 502 struct delayed_work work;
>> 503 spinlock_t lock;
>> 504 struct btrfs_block_group *block_group;
>> 505 struct list_head discard_list[BTRFS_NR_DISCARD_LISTS];
>> 506 u64 prev_discard;
>> 507 u64 prev_discard_time;
>> 508 atomic_t discardable_extents;
>> 509 atomic64_t discardable_bytes;
>> 510 u64 max_discard_size;
>> 511 u64 delay_ms;
>> 512 u32 iops_limit;
>> 513 u32 kbps_limit;
>> 514 u64 discard_extent_bytes;
>> 515 u64 discard_bitmap_bytes;
>> 516 atomic64_t discard_bytes_saved;
>> 517 };
>> 518
>> 519 void btrfs_init_async_reclaim_work(struct btrfs_fs_info *fs_info);
>> 520
>> 521 /* fs_info */
>> 522 struct reloc_control;
>> 523 struct btrfs_device;
>> 524 struct btrfs_fs_devices;
>> 525 struct btrfs_balance_control;
>> 526 struct btrfs_delayed_root;
>> 527
>> 528 /*
>> 529 * Block group or device which contains an active swapfile. Used for preventing
>> 530 * unsafe operations while a swapfile is active.
>> 531 *
>> 532 * These are sorted on (ptr, inode) (note that a block group or device can
>> 533 * contain more than one swapfile). We compare the pointer values because we
>> 534 * don't actually care what the object is, we just need a quick check whether
>> 535 * the object exists in the rbtree.
>> 536 */
>> 537 struct btrfs_swapfile_pin {
>> 538 struct rb_node node;
>> 539 void *ptr;
>> 540 struct inode *inode;
>> 541 /*
>> 542 * If true, ptr points to a struct btrfs_block_group. Otherwise, ptr
>> 543 * points to a struct btrfs_device.
>> 544 */
>> 545 bool is_block_group;
>> 546 /*
>> 547 * Only used when 'is_block_group' is true and it is the number of
>> 548 * extents used by a swapfile for this block group ('ptr' field).
>> 549 */
>> 550 int bg_extent_count;
>> 551 };
>> 552
>> 553 bool btrfs_pinned_by_swapfile(struct btrfs_fs_info *fs_info, void *ptr);
>> 554
>> 555 enum {
>> 556 BTRFS_FS_CLOSING_START,
>> 557 BTRFS_FS_CLOSING_DONE,
>> 558 BTRFS_FS_LOG_RECOVERING,
>> 559 BTRFS_FS_OPEN,
>> 560 BTRFS_FS_QUOTA_ENABLED,
>> 561 BTRFS_FS_UPDATE_UUID_TREE_GEN,
>> 562 BTRFS_FS_CREATING_FREE_SPACE_TREE,
>> 563 BTRFS_FS_BTREE_ERR,
>> 564 BTRFS_FS_LOG1_ERR,
>> 565 BTRFS_FS_LOG2_ERR,
>> 566 BTRFS_FS_QUOTA_OVERRIDE,
>> 567 /* Used to record internally whether fs has been frozen */
>> 568 BTRFS_FS_FROZEN,
>> 569 /*
>> 570 * Indicate that balance has been set up from the ioctl and is in the
>> 571 * main phase. The fs_info::balance_ctl is initialized.
>> 572 */
>> 573 BTRFS_FS_BALANCE_RUNNING,
>> 574
>> 575 /*
>> 576 * Indicate that relocation of a chunk has started, it's set per chunk
>> 577 * and is toggled between chunks.
>> 578 */
>> 579 BTRFS_FS_RELOC_RUNNING,
>> 580
>> 581 /* Indicate that the cleaner thread is awake and doing something. */
>> 582 BTRFS_FS_CLEANER_RUNNING,
>> 583
>> 584 /*
>> 585 * The checksumming has an optimized version and is considered fast,
>> 586 * so we don't need to offload checksums to workqueues.
>> 587 */
>> 588 BTRFS_FS_CSUM_IMPL_FAST,
87 589
88 #define BTRFS_PATH_AUTO_FREE(path_name) !! 590 /* Indicate that the discard workqueue can service discards. */
89 struct btrfs_path *path_name __free(bt !! 591 BTRFS_FS_DISCARD_RUNNING,
>> 592
>> 593 /* Indicate that we need to cleanup space cache v1 */
>> 594 BTRFS_FS_CLEANUP_SPACE_CACHE_V1,
>> 595
>> 596 /* Indicate that we can't trust the free space tree for caching yet */
>> 597 BTRFS_FS_FREE_SPACE_TREE_UNTRUSTED,
>> 598
>> 599 /* Indicate whether there are any tree modification log users */
>> 600 BTRFS_FS_TREE_MOD_LOG_USERS,
>> 601
>> 602 /* Indicate that we want the transaction kthread to commit right now. */
>> 603 BTRFS_FS_COMMIT_TRANS,
>> 604
>> 605 /* Indicate we have half completed snapshot deletions pending. */
>> 606 BTRFS_FS_UNFINISHED_DROPS,
>> 607
>> 608 #if BITS_PER_LONG == 32
>> 609 /* Indicate if we have error/warn message printed on 32bit systems */
>> 610 BTRFS_FS_32BIT_ERROR,
>> 611 BTRFS_FS_32BIT_WARN,
>> 612 #endif
>> 613 };
>> 614
>> 615 /*
>> 616 * Exclusive operations (device replace, resize, device add/remove, balance)
>> 617 */
>> 618 enum btrfs_exclusive_operation {
>> 619 BTRFS_EXCLOP_NONE,
>> 620 BTRFS_EXCLOP_BALANCE_PAUSED,
>> 621 BTRFS_EXCLOP_BALANCE,
>> 622 BTRFS_EXCLOP_DEV_ADD,
>> 623 BTRFS_EXCLOP_DEV_REMOVE,
>> 624 BTRFS_EXCLOP_DEV_REPLACE,
>> 625 BTRFS_EXCLOP_RESIZE,
>> 626 BTRFS_EXCLOP_SWAP_ACTIVATE,
>> 627 };
>> 628
>> 629 struct btrfs_fs_info {
>> 630 u8 chunk_tree_uuid[BTRFS_UUID_SIZE];
>> 631 unsigned long flags;
>> 632 struct btrfs_root *tree_root;
>> 633 struct btrfs_root *chunk_root;
>> 634 struct btrfs_root *dev_root;
>> 635 struct btrfs_root *fs_root;
>> 636 struct btrfs_root *quota_root;
>> 637 struct btrfs_root *uuid_root;
>> 638 struct btrfs_root *data_reloc_root;
>> 639
>> 640 /* the log root tree is a directory of all the other log roots */
>> 641 struct btrfs_root *log_root_tree;
>> 642
>> 643 /* The tree that holds the global roots (csum, extent, etc) */
>> 644 rwlock_t global_root_lock;
>> 645 struct rb_root global_root_tree;
>> 646
>> 647 spinlock_t fs_roots_radix_lock;
>> 648 struct radix_tree_root fs_roots_radix;
>> 649
>> 650 /* block group cache stuff */
>> 651 spinlock_t block_group_cache_lock;
>> 652 u64 first_logical_byte;
>> 653 struct rb_root block_group_cache_tree;
>> 654
>> 655 /* keep track of unallocated space */
>> 656 atomic64_t free_chunk_space;
>> 657
>> 658 /* Track ranges which are used by log trees blocks/logged data extents */
>> 659 struct extent_io_tree excluded_extents;
>> 660
>> 661 /* logical->physical extent mapping */
>> 662 struct extent_map_tree mapping_tree;
>> 663
>> 664 /*
>> 665 * block reservation for extent, checksum, root tree and
>> 666 * delayed dir index item
>> 667 */
>> 668 struct btrfs_block_rsv global_block_rsv;
>> 669 /* block reservation for metadata operations */
>> 670 struct btrfs_block_rsv trans_block_rsv;
>> 671 /* block reservation for chunk tree */
>> 672 struct btrfs_block_rsv chunk_block_rsv;
>> 673 /* block reservation for delayed operations */
>> 674 struct btrfs_block_rsv delayed_block_rsv;
>> 675 /* block reservation for delayed refs */
>> 676 struct btrfs_block_rsv delayed_refs_rsv;
>> 677
>> 678 struct btrfs_block_rsv empty_block_rsv;
>> 679
>> 680 u64 generation;
>> 681 u64 last_trans_committed;
>> 682 /*
>> 683 * Generation of the last transaction used for block group relocation
>> 684 * since the filesystem was last mounted (or 0 if none happened yet).
>> 685 * Must be written and read while holding btrfs_fs_info::commit_root_sem.
>> 686 */
>> 687 u64 last_reloc_trans;
>> 688 u64 avg_delayed_ref_runtime;
>> 689
>> 690 /*
>> 691 * this is updated to the current trans every time a full commit
>> 692 * is required instead of the faster short fsync log commits
>> 693 */
>> 694 u64 last_trans_log_full_commit;
>> 695 unsigned long mount_opt;
>> 696 /*
>> 697 * Track requests for actions that need to be done during transaction
>> 698 * commit (like for some mount options).
>> 699 */
>> 700 unsigned long pending_changes;
>> 701 unsigned long compress_type:4;
>> 702 unsigned int compress_level;
>> 703 u32 commit_interval;
>> 704 /*
>> 705 * It is a suggestive number, the read side is safe even it gets a
>> 706 * wrong number because we will write out the data into a regular
>> 707 * extent. The write side(mount/remount) is under ->s_umount lock,
>> 708 * so it is also safe.
>> 709 */
>> 710 u64 max_inline;
>> 711
>> 712 struct btrfs_transaction *running_transaction;
>> 713 wait_queue_head_t transaction_throttle;
>> 714 wait_queue_head_t transaction_wait;
>> 715 wait_queue_head_t transaction_blocked_wait;
>> 716 wait_queue_head_t async_submit_wait;
>> 717
>> 718 /*
>> 719 * Used to protect the incompat_flags, compat_flags, compat_ro_flags
>> 720 * when they are updated.
>> 721 *
>> 722 * Because we do not clear the flags for ever, so we needn't use
>> 723 * the lock on the read side.
>> 724 *
>> 725 * We also needn't use the lock when we mount the fs, because
>> 726 * there is no other task which will update the flag.
>> 727 */
>> 728 spinlock_t super_lock;
>> 729 struct btrfs_super_block *super_copy;
>> 730 struct btrfs_super_block *super_for_commit;
>> 731 struct super_block *sb;
>> 732 struct inode *btree_inode;
>> 733 struct mutex tree_log_mutex;
>> 734 struct mutex transaction_kthread_mutex;
>> 735 struct mutex cleaner_mutex;
>> 736 struct mutex chunk_mutex;
>> 737
>> 738 /*
>> 739 * this is taken to make sure we don't set block groups ro after
>> 740 * the free space cache has been allocated on them
>> 741 */
>> 742 struct mutex ro_block_group_mutex;
>> 743
>> 744 /* this is used during read/modify/write to make sure
>> 745 * no two ios are trying to mod the same stripe at the same
>> 746 * time
>> 747 */
>> 748 struct btrfs_stripe_hash_table *stripe_hash_table;
>> 749
>> 750 /*
>> 751 * this protects the ordered operations list only while we are
>> 752 * processing all of the entries on it. This way we make
>> 753 * sure the commit code doesn't find the list temporarily empty
>> 754 * because another function happens to be doing non-waiting preflush
>> 755 * before jumping into the main commit.
>> 756 */
>> 757 struct mutex ordered_operations_mutex;
>> 758
>> 759 struct rw_semaphore commit_root_sem;
>> 760
>> 761 struct rw_semaphore cleanup_work_sem;
>> 762
>> 763 struct rw_semaphore subvol_sem;
>> 764
>> 765 spinlock_t trans_lock;
>> 766 /*
>> 767 * the reloc mutex goes with the trans lock, it is taken
>> 768 * during commit to protect us from the relocation code
>> 769 */
>> 770 struct mutex reloc_mutex;
>> 771
>> 772 struct list_head trans_list;
>> 773 struct list_head dead_roots;
>> 774 struct list_head caching_block_groups;
>> 775
>> 776 spinlock_t delayed_iput_lock;
>> 777 struct list_head delayed_iputs;
>> 778 atomic_t nr_delayed_iputs;
>> 779 wait_queue_head_t delayed_iputs_wait;
>> 780
>> 781 atomic64_t tree_mod_seq;
>> 782
>> 783 /* this protects tree_mod_log and tree_mod_seq_list */
>> 784 rwlock_t tree_mod_log_lock;
>> 785 struct rb_root tree_mod_log;
>> 786 struct list_head tree_mod_seq_list;
>> 787
>> 788 atomic_t async_delalloc_pages;
>> 789
>> 790 /*
>> 791 * this is used to protect the following list -- ordered_roots.
>> 792 */
>> 793 spinlock_t ordered_root_lock;
>> 794
>> 795 /*
>> 796 * all fs/file tree roots in which there are data=ordered extents
>> 797 * pending writeback are added into this list.
>> 798 *
>> 799 * these can span multiple transactions and basically include
>> 800 * every dirty data page that isn't from nodatacow
>> 801 */
>> 802 struct list_head ordered_roots;
>> 803
>> 804 struct mutex delalloc_root_mutex;
>> 805 spinlock_t delalloc_root_lock;
>> 806 /* all fs/file tree roots that have delalloc inodes. */
>> 807 struct list_head delalloc_roots;
>> 808
>> 809 /*
>> 810 * there is a pool of worker threads for checksumming during writes
>> 811 * and a pool for checksumming after reads. This is because readers
>> 812 * can run with FS locks held, and the writers may be waiting for
>> 813 * those locks. We don't want ordering in the pending list to cause
>> 814 * deadlocks, and so the two are serviced separately.
>> 815 *
>> 816 * A third pool does submit_bio to avoid deadlocking with the other
>> 817 * two
>> 818 */
>> 819 struct btrfs_workqueue *workers;
>> 820 struct btrfs_workqueue *delalloc_workers;
>> 821 struct btrfs_workqueue *flush_workers;
>> 822 struct btrfs_workqueue *endio_workers;
>> 823 struct btrfs_workqueue *endio_meta_workers;
>> 824 struct btrfs_workqueue *endio_raid56_workers;
>> 825 struct btrfs_workqueue *rmw_workers;
>> 826 struct btrfs_workqueue *endio_meta_write_workers;
>> 827 struct btrfs_workqueue *endio_write_workers;
>> 828 struct btrfs_workqueue *endio_freespace_worker;
>> 829 struct btrfs_workqueue *caching_workers;
>> 830
>> 831 /*
>> 832 * fixup workers take dirty pages that didn't properly go through
>> 833 * the cow mechanism and make them safe to write. It happens
>> 834 * for the sys_munmap function call path
>> 835 */
>> 836 struct btrfs_workqueue *fixup_workers;
>> 837 struct btrfs_workqueue *delayed_workers;
>> 838
>> 839 struct task_struct *transaction_kthread;
>> 840 struct task_struct *cleaner_kthread;
>> 841 u32 thread_pool_size;
>> 842
>> 843 struct kobject *space_info_kobj;
>> 844 struct kobject *qgroups_kobj;
>> 845
>> 846 /* used to keep from writing metadata until there is a nice batch */
>> 847 struct percpu_counter dirty_metadata_bytes;
>> 848 struct percpu_counter delalloc_bytes;
>> 849 struct percpu_counter ordered_bytes;
>> 850 s32 dirty_metadata_batch;
>> 851 s32 delalloc_batch;
>> 852
>> 853 struct list_head dirty_cowonly_roots;
>> 854
>> 855 struct btrfs_fs_devices *fs_devices;
>> 856
>> 857 /*
>> 858 * The space_info list is effectively read only after initial
>> 859 * setup. It is populated at mount time and cleaned up after
>> 860 * all block groups are removed. RCU is used to protect it.
>> 861 */
>> 862 struct list_head space_info;
>> 863
>> 864 struct btrfs_space_info *data_sinfo;
>> 865
>> 866 struct reloc_control *reloc_ctl;
>> 867
>> 868 /* data_alloc_cluster is only used in ssd_spread mode */
>> 869 struct btrfs_free_cluster data_alloc_cluster;
>> 870
>> 871 /* all metadata allocations go through this cluster */
>> 872 struct btrfs_free_cluster meta_alloc_cluster;
>> 873
>> 874 /* auto defrag inodes go here */
>> 875 spinlock_t defrag_inodes_lock;
>> 876 struct rb_root defrag_inodes;
>> 877 atomic_t defrag_running;
>> 878
>> 879 /* Used to protect avail_{data, metadata, system}_alloc_bits */
>> 880 seqlock_t profiles_lock;
>> 881 /*
>> 882 * these three are in extended format (availability of single
>> 883 * chunks is denoted by BTRFS_AVAIL_ALLOC_BIT_SINGLE bit, other
>> 884 * types are denoted by corresponding BTRFS_BLOCK_GROUP_* bits)
>> 885 */
>> 886 u64 avail_data_alloc_bits;
>> 887 u64 avail_metadata_alloc_bits;
>> 888 u64 avail_system_alloc_bits;
>> 889
>> 890 /* restriper state */
>> 891 spinlock_t balance_lock;
>> 892 struct mutex balance_mutex;
>> 893 atomic_t balance_pause_req;
>> 894 atomic_t balance_cancel_req;
>> 895 struct btrfs_balance_control *balance_ctl;
>> 896 wait_queue_head_t balance_wait_q;
>> 897
>> 898 /* Cancellation requests for chunk relocation */
>> 899 atomic_t reloc_cancel_req;
>> 900
>> 901 u32 data_chunk_allocations;
>> 902 u32 metadata_ratio;
>> 903
>> 904 void *bdev_holder;
>> 905
>> 906 /* private scrub information */
>> 907 struct mutex scrub_lock;
>> 908 atomic_t scrubs_running;
>> 909 atomic_t scrub_pause_req;
>> 910 atomic_t scrubs_paused;
>> 911 atomic_t scrub_cancel_req;
>> 912 wait_queue_head_t scrub_pause_wait;
>> 913 /*
>> 914 * The worker pointers are NULL iff the refcount is 0, ie. scrub is not
>> 915 * running.
>> 916 */
>> 917 refcount_t scrub_workers_refcnt;
>> 918 struct btrfs_workqueue *scrub_workers;
>> 919 struct btrfs_workqueue *scrub_wr_completion_workers;
>> 920 struct btrfs_workqueue *scrub_parity_workers;
>> 921 struct btrfs_subpage_info *subpage_info;
>> 922
>> 923 struct btrfs_discard_ctl discard_ctl;
>> 924
>> 925 #ifdef CONFIG_BTRFS_FS_CHECK_INTEGRITY
>> 926 u32 check_integrity_print_mask;
>> 927 #endif
>> 928 /* is qgroup tracking in a consistent state? */
>> 929 u64 qgroup_flags;
>> 930
>> 931 /* holds configuration and tracking. Protected by qgroup_lock */
>> 932 struct rb_root qgroup_tree;
>> 933 spinlock_t qgroup_lock;
>> 934
>> 935 /*
>> 936 * used to avoid frequently calling ulist_alloc()/ulist_free()
>> 937 * when doing qgroup accounting, it must be protected by qgroup_lock.
>> 938 */
>> 939 struct ulist *qgroup_ulist;
>> 940
>> 941 /*
>> 942 * Protect user change for quota operations. If a transaction is needed,
>> 943 * it must be started before locking this lock.
>> 944 */
>> 945 struct mutex qgroup_ioctl_lock;
>> 946
>> 947 /* list of dirty qgroups to be written at next commit */
>> 948 struct list_head dirty_qgroups;
>> 949
>> 950 /* used by qgroup for an efficient tree traversal */
>> 951 u64 qgroup_seq;
>> 952
>> 953 /* qgroup rescan items */
>> 954 struct mutex qgroup_rescan_lock; /* protects the progress item */
>> 955 struct btrfs_key qgroup_rescan_progress;
>> 956 struct btrfs_workqueue *qgroup_rescan_workers;
>> 957 struct completion qgroup_rescan_completion;
>> 958 struct btrfs_work qgroup_rescan_work;
>> 959 bool qgroup_rescan_running; /* protected by qgroup_rescan_lock */
>> 960
>> 961 /* filesystem state */
>> 962 unsigned long fs_state;
>> 963
>> 964 struct btrfs_delayed_root *delayed_root;
>> 965
>> 966 /* Extent buffer radix tree */
>> 967 spinlock_t buffer_lock;
>> 968 /* Entries are eb->start / sectorsize */
>> 969 struct radix_tree_root buffer_radix;
>> 970
>> 971 /* next backup root to be overwritten */
>> 972 int backup_root_index;
>> 973
>> 974 /* device replace state */
>> 975 struct btrfs_dev_replace dev_replace;
>> 976
>> 977 struct semaphore uuid_tree_rescan_sem;
>> 978
>> 979 /* Used to reclaim the metadata space in the background. */
>> 980 struct work_struct async_reclaim_work;
>> 981 struct work_struct async_data_reclaim_work;
>> 982 struct work_struct preempt_reclaim_work;
>> 983
>> 984 /* Reclaim partially filled block groups in the background */
>> 985 struct work_struct reclaim_bgs_work;
>> 986 struct list_head reclaim_bgs;
>> 987 int bg_reclaim_threshold;
>> 988
>> 989 spinlock_t unused_bgs_lock;
>> 990 struct list_head unused_bgs;
>> 991 struct mutex unused_bg_unpin_mutex;
>> 992 /* Protect block groups that are going to be deleted */
>> 993 struct mutex reclaim_bgs_lock;
>> 994
>> 995 /* Cached block sizes */
>> 996 u32 nodesize;
>> 997 u32 sectorsize;
>> 998 /* ilog2 of sectorsize, use to avoid 64bit division */
>> 999 u32 sectorsize_bits;
>> 1000 u32 csum_size;
>> 1001 u32 csums_per_leaf;
>> 1002 u32 stripesize;
>> 1003
>> 1004 /* Block groups and devices containing active swapfiles. */
>> 1005 spinlock_t swapfile_pins_lock;
>> 1006 struct rb_root swapfile_pins;
>> 1007
>> 1008 struct crypto_shash *csum_shash;
>> 1009
>> 1010 /* Type of exclusive operation running, protected by super_lock */
>> 1011 enum btrfs_exclusive_operation exclusive_operation;
>> 1012
>> 1013 /*
>> 1014 * Zone size > 0 when in ZONED mode, otherwise it's used for a check
>> 1015 * if the mode is enabled
>> 1016 */
>> 1017 union {
>> 1018 u64 zone_size;
>> 1019 u64 zoned;
>> 1020 };
>> 1021
>> 1022 struct mutex zoned_meta_io_lock;
>> 1023 spinlock_t treelog_bg_lock;
>> 1024 u64 treelog_bg;
>> 1025
>> 1026 /*
>> 1027 * Start of the dedicated data relocation block group, protected by
>> 1028 * relocation_bg_lock.
>> 1029 */
>> 1030 spinlock_t relocation_bg_lock;
>> 1031 u64 data_reloc_bg;
>> 1032 struct mutex zoned_data_reloc_io_lock;
>> 1033
>> 1034 spinlock_t zone_active_bgs_lock;
>> 1035 struct list_head zone_active_bgs;
>> 1036
>> 1037 #ifdef CONFIG_BTRFS_FS_REF_VERIFY
>> 1038 spinlock_t ref_verify_lock;
>> 1039 struct rb_root block_tree;
>> 1040 #endif
>> 1041
>> 1042 #ifdef CONFIG_BTRFS_DEBUG
>> 1043 struct kobject *debug_kobj;
>> 1044 struct kobject *discard_debug_kobj;
>> 1045 struct list_head allocated_roots;
>> 1046
>> 1047 spinlock_t eb_leak_lock;
>> 1048 struct list_head allocated_ebs;
>> 1049 #endif
>> 1050 };
>> 1051
>> 1052 static inline struct btrfs_fs_info *btrfs_sb(struct super_block *sb)
>> 1053 {
>> 1054 return sb->s_fs_info;
>> 1055 }
90 1056
91 /* 1057 /*
92 * The state of btrfs root 1058 * The state of btrfs root
93 */ 1059 */
94 enum { 1060 enum {
95 /* 1061 /*
96 * btrfs_record_root_in_trans is a mul 1062 * btrfs_record_root_in_trans is a multi-step process, and it can race
97 * with the balancing code. But the 1063 * with the balancing code. But the race is very small, and only the
98 * first time the root is added to eac 1064 * first time the root is added to each transaction. So IN_TRANS_SETUP
99 * is used to tell us when more checks 1065 * is used to tell us when more checks are required
100 */ 1066 */
101 BTRFS_ROOT_IN_TRANS_SETUP, 1067 BTRFS_ROOT_IN_TRANS_SETUP,
102 1068
103 /* 1069 /*
104 * Set if tree blocks of this root can 1070 * Set if tree blocks of this root can be shared by other roots.
105 * Only subvolume trees and their relo 1071 * Only subvolume trees and their reloc trees have this bit set.
106 * Conflicts with TRACK_DIRTY bit. 1072 * Conflicts with TRACK_DIRTY bit.
107 * 1073 *
108 * This affects two things: 1074 * This affects two things:
109 * 1075 *
110 * - How balance works 1076 * - How balance works
111 * For shareable roots, we need to u 1077 * For shareable roots, we need to use reloc tree and do path
112 * replacement for balance, and need 1078 * replacement for balance, and need various pre/post hooks for
113 * snapshot creation to handle them. 1079 * snapshot creation to handle them.
114 * 1080 *
115 * While for non-shareable trees, we 1081 * While for non-shareable trees, we just simply do a tree search
116 * with COW. 1082 * with COW.
117 * 1083 *
118 * - How dirty roots are tracked 1084 * - How dirty roots are tracked
119 * For shareable roots, btrfs_record 1085 * For shareable roots, btrfs_record_root_in_trans() is needed to
120 * track them, while non-subvolume r 1086 * track them, while non-subvolume roots have TRACK_DIRTY bit, they
121 * don't need to set this manually. 1087 * don't need to set this manually.
122 */ 1088 */
123 BTRFS_ROOT_SHAREABLE, 1089 BTRFS_ROOT_SHAREABLE,
124 BTRFS_ROOT_TRACK_DIRTY, 1090 BTRFS_ROOT_TRACK_DIRTY,
125 BTRFS_ROOT_IN_RADIX, 1091 BTRFS_ROOT_IN_RADIX,
126 BTRFS_ROOT_ORPHAN_ITEM_INSERTED, 1092 BTRFS_ROOT_ORPHAN_ITEM_INSERTED,
127 BTRFS_ROOT_DEFRAG_RUNNING, 1093 BTRFS_ROOT_DEFRAG_RUNNING,
128 BTRFS_ROOT_FORCE_COW, 1094 BTRFS_ROOT_FORCE_COW,
129 BTRFS_ROOT_MULTI_LOG_TASKS, 1095 BTRFS_ROOT_MULTI_LOG_TASKS,
130 BTRFS_ROOT_DIRTY, 1096 BTRFS_ROOT_DIRTY,
131 BTRFS_ROOT_DELETING, 1097 BTRFS_ROOT_DELETING,
132 1098
133 /* 1099 /*
134 * Reloc tree is orphan, only kept her 1100 * Reloc tree is orphan, only kept here for qgroup delayed subtree scan
135 * 1101 *
136 * Set for the subvolume tree owning t 1102 * Set for the subvolume tree owning the reloc tree.
137 */ 1103 */
138 BTRFS_ROOT_DEAD_RELOC_TREE, 1104 BTRFS_ROOT_DEAD_RELOC_TREE,
139 /* Mark dead root stored on device who 1105 /* Mark dead root stored on device whose cleanup needs to be resumed */
140 BTRFS_ROOT_DEAD_TREE, 1106 BTRFS_ROOT_DEAD_TREE,
141 /* The root has a log tree. Used for s 1107 /* The root has a log tree. Used for subvolume roots and the tree root. */
142 BTRFS_ROOT_HAS_LOG_TREE, 1108 BTRFS_ROOT_HAS_LOG_TREE,
143 /* Qgroup flushing is in progress */ 1109 /* Qgroup flushing is in progress */
144 BTRFS_ROOT_QGROUP_FLUSHING, 1110 BTRFS_ROOT_QGROUP_FLUSHING,
145 /* We started the orphan cleanup for t 1111 /* We started the orphan cleanup for this root. */
146 BTRFS_ROOT_ORPHAN_CLEANUP, 1112 BTRFS_ROOT_ORPHAN_CLEANUP,
147 /* This root has a drop operation that 1113 /* This root has a drop operation that was started previously. */
148 BTRFS_ROOT_UNFINISHED_DROP, 1114 BTRFS_ROOT_UNFINISHED_DROP,
149 /* This reloc root needs to have its b <<
150 BTRFS_ROOT_RESET_LOCKDEP_CLASS, <<
151 }; 1115 };
152 1116
>> 1117 static inline void btrfs_wake_unfinished_drop(struct btrfs_fs_info *fs_info)
>> 1118 {
>> 1119 clear_and_wake_up_bit(BTRFS_FS_UNFINISHED_DROPS, &fs_info->flags);
>> 1120 }
>> 1121
153 /* 1122 /*
154 * Record swapped tree blocks of a subvolume t 1123 * Record swapped tree blocks of a subvolume tree for delayed subtree trace
155 * code. For detail check comment in fs/btrfs/ 1124 * code. For detail check comment in fs/btrfs/qgroup.c.
156 */ 1125 */
157 struct btrfs_qgroup_swapped_blocks { 1126 struct btrfs_qgroup_swapped_blocks {
158 spinlock_t lock; 1127 spinlock_t lock;
159 /* RM_EMPTY_ROOT() of above blocks[] * 1128 /* RM_EMPTY_ROOT() of above blocks[] */
160 bool swapped; 1129 bool swapped;
161 struct rb_root blocks[BTRFS_MAX_LEVEL] 1130 struct rb_root blocks[BTRFS_MAX_LEVEL];
162 }; 1131 };
163 1132
164 /* 1133 /*
165 * in ram representation of the tree. extent_ 1134 * in ram representation of the tree. extent_root is used for all allocations
166 * and for the extent tree extent_root root. 1135 * and for the extent tree extent_root root.
167 */ 1136 */
168 struct btrfs_root { 1137 struct btrfs_root {
169 struct rb_node rb_node; 1138 struct rb_node rb_node;
170 1139
171 struct extent_buffer *node; 1140 struct extent_buffer *node;
172 1141
173 struct extent_buffer *commit_root; 1142 struct extent_buffer *commit_root;
174 struct btrfs_root *log_root; 1143 struct btrfs_root *log_root;
175 struct btrfs_root *reloc_root; 1144 struct btrfs_root *reloc_root;
176 1145
177 unsigned long state; 1146 unsigned long state;
178 struct btrfs_root_item root_item; 1147 struct btrfs_root_item root_item;
179 struct btrfs_key root_key; 1148 struct btrfs_key root_key;
180 struct btrfs_fs_info *fs_info; 1149 struct btrfs_fs_info *fs_info;
181 struct extent_io_tree dirty_log_pages; 1150 struct extent_io_tree dirty_log_pages;
182 1151
183 struct mutex objectid_mutex; 1152 struct mutex objectid_mutex;
184 1153
185 spinlock_t accounting_lock; 1154 spinlock_t accounting_lock;
186 struct btrfs_block_rsv *block_rsv; 1155 struct btrfs_block_rsv *block_rsv;
187 1156
188 struct mutex log_mutex; 1157 struct mutex log_mutex;
189 wait_queue_head_t log_writer_wait; 1158 wait_queue_head_t log_writer_wait;
190 wait_queue_head_t log_commit_wait[2]; 1159 wait_queue_head_t log_commit_wait[2];
191 struct list_head log_ctxs[2]; 1160 struct list_head log_ctxs[2];
192 /* Used only for log trees of subvolum 1161 /* Used only for log trees of subvolumes, not for the log root tree */
193 atomic_t log_writers; 1162 atomic_t log_writers;
194 atomic_t log_commit[2]; 1163 atomic_t log_commit[2];
195 /* Used only for log trees of subvolum 1164 /* Used only for log trees of subvolumes, not for the log root tree */
196 atomic_t log_batch; 1165 atomic_t log_batch;
197 /* <<
198 * Protected by the 'log_mutex' lock b <<
199 * that lock to avoid unnecessary lock <<
200 * should be read using btrfs_get_root <<
201 * log tree in which case it can be di <<
202 * field should always use btrfs_set_r <<
203 * trees where the field can be update <<
204 */ <<
205 int log_transid; 1166 int log_transid;
206 /* No matter the commit succeeds or no 1167 /* No matter the commit succeeds or not*/
207 int log_transid_committed; 1168 int log_transid_committed;
208 /* !! 1169 /* Just be updated when the commit succeeds. */
209 * Just be updated when the commit suc <<
210 * btrfs_get_root_last_log_commit() an <<
211 * to access this field. <<
212 */ <<
213 int last_log_commit; 1170 int last_log_commit;
214 pid_t log_start_pid; 1171 pid_t log_start_pid;
215 1172
216 u64 last_trans; 1173 u64 last_trans;
217 1174
>> 1175 u32 type;
>> 1176
218 u64 free_objectid; 1177 u64 free_objectid;
219 1178
220 struct btrfs_key defrag_progress; 1179 struct btrfs_key defrag_progress;
221 struct btrfs_key defrag_max; 1180 struct btrfs_key defrag_max;
222 1181
223 /* The dirty list is only used by non- 1182 /* The dirty list is only used by non-shareable roots */
224 struct list_head dirty_list; 1183 struct list_head dirty_list;
225 1184
226 struct list_head root_list; 1185 struct list_head root_list;
227 1186
228 /* !! 1187 spinlock_t log_extents_lock[2];
229 * Xarray that keeps track of in-memor !! 1188 struct list_head logged_list[2];
230 * @inode_lock. !! 1189
231 */ !! 1190 spinlock_t inode_lock;
232 struct xarray inodes; !! 1191 /* red-black tree that keeps track of in-memory inodes */
>> 1192 struct rb_root inode_tree;
233 1193
234 /* 1194 /*
235 * Xarray that keeps track of delayed !! 1195 * radix tree that keeps track of delayed nodes of every inode,
236 * by @inode_lock. !! 1196 * protected by inode_lock
237 */ 1197 */
238 struct xarray delayed_nodes; !! 1198 struct radix_tree_root delayed_nodes_tree;
239 /* 1199 /*
240 * right now this just gets used so th 1200 * right now this just gets used so that a root has its own devid
241 * for stat. It may be used for more 1201 * for stat. It may be used for more later
242 */ 1202 */
243 dev_t anon_dev; 1203 dev_t anon_dev;
244 1204
245 spinlock_t root_item_lock; 1205 spinlock_t root_item_lock;
246 refcount_t refs; 1206 refcount_t refs;
247 1207
248 struct mutex delalloc_mutex; 1208 struct mutex delalloc_mutex;
249 spinlock_t delalloc_lock; 1209 spinlock_t delalloc_lock;
250 /* 1210 /*
251 * all of the inodes that have delallo 1211 * all of the inodes that have delalloc bytes. It is possible for
252 * this list to be empty even when the 1212 * this list to be empty even when there is still dirty data=ordered
253 * extents waiting to finish IO. 1213 * extents waiting to finish IO.
254 */ 1214 */
255 struct list_head delalloc_inodes; 1215 struct list_head delalloc_inodes;
256 struct list_head delalloc_root; 1216 struct list_head delalloc_root;
257 u64 nr_delalloc_inodes; 1217 u64 nr_delalloc_inodes;
258 1218
259 struct mutex ordered_extent_mutex; 1219 struct mutex ordered_extent_mutex;
260 /* 1220 /*
261 * this is used by the balancing code 1221 * this is used by the balancing code to wait for all the pending
262 * ordered extents 1222 * ordered extents
263 */ 1223 */
264 spinlock_t ordered_extent_lock; 1224 spinlock_t ordered_extent_lock;
265 1225
266 /* 1226 /*
267 * all of the data=ordered extents pen 1227 * all of the data=ordered extents pending writeback
268 * these can span multiple transaction 1228 * these can span multiple transactions and basically include
269 * every dirty data page that isn't fr 1229 * every dirty data page that isn't from nodatacow
270 */ 1230 */
271 struct list_head ordered_extents; 1231 struct list_head ordered_extents;
272 struct list_head ordered_root; 1232 struct list_head ordered_root;
273 u64 nr_ordered_extents; 1233 u64 nr_ordered_extents;
274 1234
275 /* 1235 /*
276 * Not empty if this subvolume root ha 1236 * Not empty if this subvolume root has gone through tree block swap
277 * (relocation) 1237 * (relocation)
278 * 1238 *
279 * Will be used by reloc_control::dirt 1239 * Will be used by reloc_control::dirty_subvol_roots.
280 */ 1240 */
281 struct list_head reloc_dirty_list; 1241 struct list_head reloc_dirty_list;
282 1242
283 /* 1243 /*
284 * Number of currently running SEND io 1244 * Number of currently running SEND ioctls to prevent
285 * manipulation with the read-only sta 1245 * manipulation with the read-only status via SUBVOL_SETFLAGS
286 */ 1246 */
287 int send_in_progress; 1247 int send_in_progress;
288 /* 1248 /*
289 * Number of currently running dedupli 1249 * Number of currently running deduplication operations that have a
290 * destination inode belonging to this 1250 * destination inode belonging to this root. Protected by the lock
291 * root_item_lock. 1251 * root_item_lock.
292 */ 1252 */
293 int dedupe_in_progress; 1253 int dedupe_in_progress;
294 /* For exclusion of snapshot creation 1254 /* For exclusion of snapshot creation and nocow writes */
295 struct btrfs_drew_lock snapshot_lock; 1255 struct btrfs_drew_lock snapshot_lock;
296 1256
297 atomic_t snapshot_force_cow; 1257 atomic_t snapshot_force_cow;
298 1258
299 /* For qgroup metadata reserved space 1259 /* For qgroup metadata reserved space */
300 spinlock_t qgroup_meta_rsv_lock; 1260 spinlock_t qgroup_meta_rsv_lock;
301 u64 qgroup_meta_rsv_pertrans; 1261 u64 qgroup_meta_rsv_pertrans;
302 u64 qgroup_meta_rsv_prealloc; 1262 u64 qgroup_meta_rsv_prealloc;
303 wait_queue_head_t qgroup_flush_wait; 1263 wait_queue_head_t qgroup_flush_wait;
304 1264
305 /* Number of active swapfiles */ 1265 /* Number of active swapfiles */
306 atomic_t nr_swapfiles; 1266 atomic_t nr_swapfiles;
307 1267
308 /* Record pairs of swapped blocks for 1268 /* Record pairs of swapped blocks for qgroup */
309 struct btrfs_qgroup_swapped_blocks swa 1269 struct btrfs_qgroup_swapped_blocks swapped_blocks;
310 1270
311 /* Used only by log trees, when loggin 1271 /* Used only by log trees, when logging csum items */
312 struct extent_io_tree log_csum_range; 1272 struct extent_io_tree log_csum_range;
313 1273
314 /* Used in simple quotas, track root d <<
315 u64 relocation_src_root; <<
316 <<
317 #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS 1274 #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
318 u64 alloc_bytenr; 1275 u64 alloc_bytenr;
319 #endif 1276 #endif
320 1277
321 #ifdef CONFIG_BTRFS_DEBUG 1278 #ifdef CONFIG_BTRFS_DEBUG
322 struct list_head leak_list; 1279 struct list_head leak_list;
323 #endif 1280 #endif
324 }; 1281 };
325 1282
326 static inline bool btrfs_root_readonly(const s <<
327 { <<
328 /* Byte-swap the constant at compile t <<
329 return (root->root_item.flags & cpu_to <<
330 } <<
331 <<
332 static inline bool btrfs_root_dead(const struc <<
333 { <<
334 /* Byte-swap the constant at compile t <<
335 return (root->root_item.flags & cpu_to <<
336 } <<
337 <<
338 static inline u64 btrfs_root_id(const struct b <<
339 { <<
340 return root->root_key.objectid; <<
341 } <<
342 <<
343 static inline int btrfs_get_root_log_transid(c <<
344 { <<
345 return READ_ONCE(root->log_transid); <<
346 } <<
347 <<
348 static inline void btrfs_set_root_log_transid( <<
349 { <<
350 WRITE_ONCE(root->log_transid, log_tran <<
351 } <<
352 <<
353 static inline int btrfs_get_root_last_log_comm <<
354 { <<
355 return READ_ONCE(root->last_log_commit <<
356 } <<
357 <<
358 static inline void btrfs_set_root_last_log_com <<
359 { <<
360 WRITE_ONCE(root->last_log_commit, comm <<
361 } <<
362 <<
363 static inline u64 btrfs_get_root_last_trans(co <<
364 { <<
365 return READ_ONCE(root->last_trans); <<
366 } <<
367 <<
368 static inline void btrfs_set_root_last_trans(s <<
369 { <<
370 WRITE_ONCE(root->last_trans, transid); <<
371 } <<
372 <<
373 /* 1283 /*
374 * Structure that conveys information about an 1284 * Structure that conveys information about an extent that is going to replace
375 * all the extents in a file range. 1285 * all the extents in a file range.
376 */ 1286 */
377 struct btrfs_replace_extent_info { 1287 struct btrfs_replace_extent_info {
378 u64 disk_offset; 1288 u64 disk_offset;
379 u64 disk_len; 1289 u64 disk_len;
380 u64 data_offset; 1290 u64 data_offset;
381 u64 data_len; 1291 u64 data_len;
382 u64 file_offset; 1292 u64 file_offset;
383 /* Pointer to a file extent item of ty 1293 /* Pointer to a file extent item of type regular or prealloc. */
384 char *extent_buf; 1294 char *extent_buf;
385 /* 1295 /*
386 * Set to true when attempting to repl 1296 * Set to true when attempting to replace a file range with a new extent
387 * described by this structure, set to 1297 * described by this structure, set to false when attempting to clone an
388 * existing extent into a file range. 1298 * existing extent into a file range.
389 */ 1299 */
390 bool is_new_extent; 1300 bool is_new_extent;
391 /* Indicate if we should update the in <<
392 bool update_times; <<
393 /* Meaningful only if is_new_extent is 1301 /* Meaningful only if is_new_extent is true. */
394 int qgroup_reserved; 1302 int qgroup_reserved;
395 /* 1303 /*
396 * Meaningful only if is_new_extent is 1304 * Meaningful only if is_new_extent is true.
397 * Used to track how many extent items 1305 * Used to track how many extent items we have already inserted in a
398 * subvolume tree that refer to the ex 1306 * subvolume tree that refer to the extent described by this structure,
399 * so that we know when to create a ne 1307 * so that we know when to create a new delayed ref or update an existing
400 * one. 1308 * one.
401 */ 1309 */
402 int insertions; 1310 int insertions;
403 }; 1311 };
404 1312
405 /* Arguments for btrfs_drop_extents() */ 1313 /* Arguments for btrfs_drop_extents() */
406 struct btrfs_drop_extents_args { 1314 struct btrfs_drop_extents_args {
407 /* Input parameters */ 1315 /* Input parameters */
408 1316
409 /* 1317 /*
410 * If NULL, btrfs_drop_extents() will 1318 * If NULL, btrfs_drop_extents() will allocate and free its own path.
411 * If 'replace_extent' is true, this m 1319 * If 'replace_extent' is true, this must not be NULL. Also the path
412 * is always released except if 'repla 1320 * is always released except if 'replace_extent' is true and
413 * btrfs_drop_extents() sets 'extent_i 1321 * btrfs_drop_extents() sets 'extent_inserted' to true, in which case
414 * the path is kept locked. 1322 * the path is kept locked.
415 */ 1323 */
416 struct btrfs_path *path; 1324 struct btrfs_path *path;
417 /* Start offset of the range to drop e 1325 /* Start offset of the range to drop extents from */
418 u64 start; 1326 u64 start;
419 /* End (exclusive, last byte + 1) of t 1327 /* End (exclusive, last byte + 1) of the range to drop extents from */
420 u64 end; 1328 u64 end;
421 /* If true drop all the extent maps in 1329 /* If true drop all the extent maps in the range */
422 bool drop_cache; 1330 bool drop_cache;
423 /* 1331 /*
424 * If true it means we want to insert 1332 * If true it means we want to insert a new extent after dropping all
425 * the extents in the range. If this i 1333 * the extents in the range. If this is true, the 'extent_item_size'
426 * parameter must be set as well and t 1334 * parameter must be set as well and the 'extent_inserted' field will
427 * be set to true by btrfs_drop_extent 1335 * be set to true by btrfs_drop_extents() if it could insert the new
428 * extent. 1336 * extent.
429 * Note: when this is set to true the 1337 * Note: when this is set to true the path must not be NULL.
430 */ 1338 */
431 bool replace_extent; 1339 bool replace_extent;
432 /* 1340 /*
433 * Used if 'replace_extent' is true. S 1341 * Used if 'replace_extent' is true. Size of the file extent item to
434 * insert after dropping all existing 1342 * insert after dropping all existing extents in the range
435 */ 1343 */
436 u32 extent_item_size; 1344 u32 extent_item_size;
437 1345
438 /* Output parameters */ 1346 /* Output parameters */
439 1347
440 /* 1348 /*
441 * Set to the minimum between the inpu 1349 * Set to the minimum between the input parameter 'end' and the end
442 * (exclusive, last byte + 1) of the l 1350 * (exclusive, last byte + 1) of the last dropped extent. This is always
443 * set even if btrfs_drop_extents() re 1351 * set even if btrfs_drop_extents() returns an error.
444 */ 1352 */
445 u64 drop_end; 1353 u64 drop_end;
446 /* 1354 /*
447 * The number of allocated bytes found 1355 * The number of allocated bytes found in the range. This can be smaller
448 * than the range's length when there 1356 * than the range's length when there are holes in the range.
449 */ 1357 */
450 u64 bytes_found; 1358 u64 bytes_found;
451 /* 1359 /*
452 * Only set if 'replace_extent' is tru 1360 * Only set if 'replace_extent' is true. Set to true if we were able
453 * to insert a replacement extent afte 1361 * to insert a replacement extent after dropping all extents in the
454 * range, otherwise set to false by bt 1362 * range, otherwise set to false by btrfs_drop_extents().
455 * Also, if btrfs_drop_extents() has s 1363 * Also, if btrfs_drop_extents() has set this to true it means it
456 * returned with the path locked, othe 1364 * returned with the path locked, otherwise if it has set this to
457 * false it has returned with the path 1365 * false it has returned with the path released.
458 */ 1366 */
459 bool extent_inserted; 1367 bool extent_inserted;
460 }; 1368 };
461 1369
462 struct btrfs_file_private { 1370 struct btrfs_file_private {
463 void *filldir_buf; 1371 void *filldir_buf;
464 u64 last_index; <<
465 struct extent_state *llseek_cached_sta <<
466 /* Task that allocated this structure. <<
467 struct task_struct *owner_task; <<
468 }; 1372 };
469 1373
>> 1374
470 static inline u32 BTRFS_LEAF_DATA_SIZE(const s 1375 static inline u32 BTRFS_LEAF_DATA_SIZE(const struct btrfs_fs_info *info)
471 { 1376 {
>> 1377
472 return info->nodesize - sizeof(struct 1378 return info->nodesize - sizeof(struct btrfs_header);
473 } 1379 }
474 1380
>> 1381 #define BTRFS_LEAF_DATA_OFFSET offsetof(struct btrfs_leaf, items)
>> 1382
475 static inline u32 BTRFS_MAX_ITEM_SIZE(const st 1383 static inline u32 BTRFS_MAX_ITEM_SIZE(const struct btrfs_fs_info *info)
476 { 1384 {
477 return BTRFS_LEAF_DATA_SIZE(info) - si 1385 return BTRFS_LEAF_DATA_SIZE(info) - sizeof(struct btrfs_item);
478 } 1386 }
479 1387
480 static inline u32 BTRFS_NODEPTRS_PER_BLOCK(con 1388 static inline u32 BTRFS_NODEPTRS_PER_BLOCK(const struct btrfs_fs_info *info)
481 { 1389 {
482 return BTRFS_LEAF_DATA_SIZE(info) / si 1390 return BTRFS_LEAF_DATA_SIZE(info) / sizeof(struct btrfs_key_ptr);
483 } 1391 }
484 1392
>> 1393 #define BTRFS_FILE_EXTENT_INLINE_DATA_START \
>> 1394 (offsetof(struct btrfs_file_extent_item, disk_bytenr))
>> 1395 static inline u32 BTRFS_MAX_INLINE_DATA_SIZE(const struct btrfs_fs_info *info)
>> 1396 {
>> 1397 return BTRFS_MAX_ITEM_SIZE(info) -
>> 1398 BTRFS_FILE_EXTENT_INLINE_DATA_START;
>> 1399 }
>> 1400
485 static inline u32 BTRFS_MAX_XATTR_SIZE(const s 1401 static inline u32 BTRFS_MAX_XATTR_SIZE(const struct btrfs_fs_info *info)
486 { 1402 {
487 return BTRFS_MAX_ITEM_SIZE(info) - siz 1403 return BTRFS_MAX_ITEM_SIZE(info) - sizeof(struct btrfs_dir_item);
488 } 1404 }
489 1405
>> 1406 /*
>> 1407 * Flags for mount options.
>> 1408 *
>> 1409 * Note: don't forget to add new options to btrfs_show_options()
>> 1410 */
>> 1411 enum {
>> 1412 BTRFS_MOUNT_NODATASUM = (1UL << 0),
>> 1413 BTRFS_MOUNT_NODATACOW = (1UL << 1),
>> 1414 BTRFS_MOUNT_NOBARRIER = (1UL << 2),
>> 1415 BTRFS_MOUNT_SSD = (1UL << 3),
>> 1416 BTRFS_MOUNT_DEGRADED = (1UL << 4),
>> 1417 BTRFS_MOUNT_COMPRESS = (1UL << 5),
>> 1418 BTRFS_MOUNT_NOTREELOG = (1UL << 6),
>> 1419 BTRFS_MOUNT_FLUSHONCOMMIT = (1UL << 7),
>> 1420 BTRFS_MOUNT_SSD_SPREAD = (1UL << 8),
>> 1421 BTRFS_MOUNT_NOSSD = (1UL << 9),
>> 1422 BTRFS_MOUNT_DISCARD_SYNC = (1UL << 10),
>> 1423 BTRFS_MOUNT_FORCE_COMPRESS = (1UL << 11),
>> 1424 BTRFS_MOUNT_SPACE_CACHE = (1UL << 12),
>> 1425 BTRFS_MOUNT_CLEAR_CACHE = (1UL << 13),
>> 1426 BTRFS_MOUNT_USER_SUBVOL_RM_ALLOWED = (1UL << 14),
>> 1427 BTRFS_MOUNT_ENOSPC_DEBUG = (1UL << 15),
>> 1428 BTRFS_MOUNT_AUTO_DEFRAG = (1UL << 16),
>> 1429 BTRFS_MOUNT_USEBACKUPROOT = (1UL << 17),
>> 1430 BTRFS_MOUNT_SKIP_BALANCE = (1UL << 18),
>> 1431 BTRFS_MOUNT_CHECK_INTEGRITY = (1UL << 19),
>> 1432 BTRFS_MOUNT_CHECK_INTEGRITY_DATA = (1UL << 20),
>> 1433 BTRFS_MOUNT_PANIC_ON_FATAL_ERROR = (1UL << 21),
>> 1434 BTRFS_MOUNT_RESCAN_UUID_TREE = (1UL << 22),
>> 1435 BTRFS_MOUNT_FRAGMENT_DATA = (1UL << 23),
>> 1436 BTRFS_MOUNT_FRAGMENT_METADATA = (1UL << 24),
>> 1437 BTRFS_MOUNT_FREE_SPACE_TREE = (1UL << 25),
>> 1438 BTRFS_MOUNT_NOLOGREPLAY = (1UL << 26),
>> 1439 BTRFS_MOUNT_REF_VERIFY = (1UL << 27),
>> 1440 BTRFS_MOUNT_DISCARD_ASYNC = (1UL << 28),
>> 1441 BTRFS_MOUNT_IGNOREBADROOTS = (1UL << 29),
>> 1442 BTRFS_MOUNT_IGNOREDATACSUMS = (1UL << 30),
>> 1443 };
>> 1444
>> 1445 #define BTRFS_DEFAULT_COMMIT_INTERVAL (30)
>> 1446 #define BTRFS_DEFAULT_MAX_INLINE (2048)
>> 1447
>> 1448 #define btrfs_clear_opt(o, opt) ((o) &= ~BTRFS_MOUNT_##opt)
>> 1449 #define btrfs_set_opt(o, opt) ((o) |= BTRFS_MOUNT_##opt)
>> 1450 #define btrfs_raw_test_opt(o, opt) ((o) & BTRFS_MOUNT_##opt)
>> 1451 #define btrfs_test_opt(fs_info, opt) ((fs_info)->mount_opt & \
>> 1452 BTRFS_MOUNT_##opt)
>> 1453
>> 1454 #define btrfs_set_and_info(fs_info, opt, fmt, args...) \
>> 1455 do { \
>> 1456 if (!btrfs_test_opt(fs_info, opt)) \
>> 1457 btrfs_info(fs_info, fmt, ##args); \
>> 1458 btrfs_set_opt(fs_info->mount_opt, opt); \
>> 1459 } while (0)
>> 1460
>> 1461 #define btrfs_clear_and_info(fs_info, opt, fmt, args...) \
>> 1462 do { \
>> 1463 if (btrfs_test_opt(fs_info, opt)) \
>> 1464 btrfs_info(fs_info, fmt, ##args); \
>> 1465 btrfs_clear_opt(fs_info->mount_opt, opt); \
>> 1466 } while (0)
>> 1467
>> 1468 /*
>> 1469 * Requests for changes that need to be done during transaction commit.
>> 1470 *
>> 1471 * Internal mount options that are used for special handling of the real
>> 1472 * mount options (eg. cannot be set during remount and have to be set during
>> 1473 * transaction commit)
>> 1474 */
>> 1475
>> 1476 #define BTRFS_PENDING_COMMIT (0)
>> 1477
>> 1478 #define btrfs_test_pending(info, opt) \
>> 1479 test_bit(BTRFS_PENDING_##opt, &(info)->pending_changes)
>> 1480 #define btrfs_set_pending(info, opt) \
>> 1481 set_bit(BTRFS_PENDING_##opt, &(info)->pending_changes)
>> 1482 #define btrfs_clear_pending(info, opt) \
>> 1483 clear_bit(BTRFS_PENDING_##opt, &(info)->pending_changes)
>> 1484
>> 1485 /*
>> 1486 * Helpers for setting pending mount option changes.
>> 1487 *
>> 1488 * Expects corresponding macros
>> 1489 * BTRFS_PENDING_SET_ and CLEAR_ + short mount option name
>> 1490 */
>> 1491 #define btrfs_set_pending_and_info(info, opt, fmt, args...) \
>> 1492 do { \
>> 1493 if (!btrfs_raw_test_opt((info)->mount_opt, opt)) { \
>> 1494 btrfs_info((info), fmt, ##args); \
>> 1495 btrfs_set_pending((info), SET_##opt); \
>> 1496 btrfs_clear_pending((info), CLEAR_##opt); \
>> 1497 } \
>> 1498 } while(0)
>> 1499
>> 1500 #define btrfs_clear_pending_and_info(info, opt, fmt, args...) \
>> 1501 do { \
>> 1502 if (btrfs_raw_test_opt((info)->mount_opt, opt)) { \
>> 1503 btrfs_info((info), fmt, ##args); \
>> 1504 btrfs_set_pending((info), CLEAR_##opt); \
>> 1505 btrfs_clear_pending((info), SET_##opt); \
>> 1506 } \
>> 1507 } while(0)
>> 1508
>> 1509 /*
>> 1510 * Inode flags
>> 1511 */
>> 1512 #define BTRFS_INODE_NODATASUM (1U << 0)
>> 1513 #define BTRFS_INODE_NODATACOW (1U << 1)
>> 1514 #define BTRFS_INODE_READONLY (1U << 2)
>> 1515 #define BTRFS_INODE_NOCOMPRESS (1U << 3)
>> 1516 #define BTRFS_INODE_PREALLOC (1U << 4)
>> 1517 #define BTRFS_INODE_SYNC (1U << 5)
>> 1518 #define BTRFS_INODE_IMMUTABLE (1U << 6)
>> 1519 #define BTRFS_INODE_APPEND (1U << 7)
>> 1520 #define BTRFS_INODE_NODUMP (1U << 8)
>> 1521 #define BTRFS_INODE_NOATIME (1U << 9)
>> 1522 #define BTRFS_INODE_DIRSYNC (1U << 10)
>> 1523 #define BTRFS_INODE_COMPRESS (1U << 11)
>> 1524
>> 1525 #define BTRFS_INODE_ROOT_ITEM_INIT (1U << 31)
>> 1526
>> 1527 #define BTRFS_INODE_FLAG_MASK \
>> 1528 (BTRFS_INODE_NODATASUM | \
>> 1529 BTRFS_INODE_NODATACOW | \
>> 1530 BTRFS_INODE_READONLY | \
>> 1531 BTRFS_INODE_NOCOMPRESS | \
>> 1532 BTRFS_INODE_PREALLOC | \
>> 1533 BTRFS_INODE_SYNC | \
>> 1534 BTRFS_INODE_IMMUTABLE | \
>> 1535 BTRFS_INODE_APPEND | \
>> 1536 BTRFS_INODE_NODUMP | \
>> 1537 BTRFS_INODE_NOATIME | \
>> 1538 BTRFS_INODE_DIRSYNC | \
>> 1539 BTRFS_INODE_COMPRESS | \
>> 1540 BTRFS_INODE_ROOT_ITEM_INIT)
>> 1541
>> 1542 #define BTRFS_INODE_RO_VERITY (1U << 0)
>> 1543
>> 1544 #define BTRFS_INODE_RO_FLAG_MASK (BTRFS_INODE_RO_VERITY)
>> 1545
>> 1546 struct btrfs_map_token {
>> 1547 struct extent_buffer *eb;
>> 1548 char *kaddr;
>> 1549 unsigned long offset;
>> 1550 };
>> 1551
490 #define BTRFS_BYTES_TO_BLKS(fs_info, bytes) \ 1552 #define BTRFS_BYTES_TO_BLKS(fs_info, bytes) \
491 ((bytes) >> (f 1553 ((bytes) >> (fs_info)->sectorsize_bits)
492 1554
493 static inline gfp_t btrfs_alloc_write_mask(str !! 1555 static inline void btrfs_init_map_token(struct btrfs_map_token *token,
>> 1556 struct extent_buffer *eb)
494 { 1557 {
495 return mapping_gfp_constraint(mapping, !! 1558 token->eb = eb;
>> 1559 token->kaddr = page_address(eb->pages[0]);
>> 1560 token->offset = 0;
496 } 1561 }
497 1562
498 void btrfs_error_unpin_extent_range(struct btr !! 1563 /* some macros to generate set/get functions for the struct fields. This
499 int btrfs_discard_extent(struct btrfs_fs_info !! 1564 * assumes there is a lefoo_to_cpu for every type, so lets make a simple
500 u64 num_bytes, u64 *a !! 1565 * one for u8:
501 int btrfs_trim_fs(struct btrfs_fs_info *fs_inf !! 1566 */
>> 1567 #define le8_to_cpu(v) (v)
>> 1568 #define cpu_to_le8(v) (v)
>> 1569 #define __le8 u8
>> 1570
>> 1571 static inline u8 get_unaligned_le8(const void *p)
>> 1572 {
>> 1573 return *(u8 *)p;
>> 1574 }
>> 1575
>> 1576 static inline void put_unaligned_le8(u8 val, void *p)
>> 1577 {
>> 1578 *(u8 *)p = val;
>> 1579 }
>> 1580
>> 1581 #define read_eb_member(eb, ptr, type, member, result) (\
>> 1582 read_extent_buffer(eb, (char *)(result), \
>> 1583 ((unsigned long)(ptr)) + \
>> 1584 offsetof(type, member), \
>> 1585 sizeof(((type *)0)->member)))
>> 1586
>> 1587 #define write_eb_member(eb, ptr, type, member, result) (\
>> 1588 write_extent_buffer(eb, (char *)(result), \
>> 1589 ((unsigned long)(ptr)) + \
>> 1590 offsetof(type, member), \
>> 1591 sizeof(((type *)0)->member)))
>> 1592
>> 1593 #define DECLARE_BTRFS_SETGET_BITS(bits) \
>> 1594 u##bits btrfs_get_token_##bits(struct btrfs_map_token *token, \
>> 1595 const void *ptr, unsigned long off); \
>> 1596 void btrfs_set_token_##bits(struct btrfs_map_token *token, \
>> 1597 const void *ptr, unsigned long off, \
>> 1598 u##bits val); \
>> 1599 u##bits btrfs_get_##bits(const struct extent_buffer *eb, \
>> 1600 const void *ptr, unsigned long off); \
>> 1601 void btrfs_set_##bits(const struct extent_buffer *eb, void *ptr, \
>> 1602 unsigned long off, u##bits val);
>> 1603
>> 1604 DECLARE_BTRFS_SETGET_BITS(8)
>> 1605 DECLARE_BTRFS_SETGET_BITS(16)
>> 1606 DECLARE_BTRFS_SETGET_BITS(32)
>> 1607 DECLARE_BTRFS_SETGET_BITS(64)
>> 1608
>> 1609 #define BTRFS_SETGET_FUNCS(name, type, member, bits) \
>> 1610 static inline u##bits btrfs_##name(const struct extent_buffer *eb, \
>> 1611 const type *s) \
>> 1612 { \
>> 1613 BUILD_BUG_ON(sizeof(u##bits) != sizeof(((type *)0))->member); \
>> 1614 return btrfs_get_##bits(eb, s, offsetof(type, member)); \
>> 1615 } \
>> 1616 static inline void btrfs_set_##name(const struct extent_buffer *eb, type *s, \
>> 1617 u##bits val) \
>> 1618 { \
>> 1619 BUILD_BUG_ON(sizeof(u##bits) != sizeof(((type *)0))->member); \
>> 1620 btrfs_set_##bits(eb, s, offsetof(type, member), val); \
>> 1621 } \
>> 1622 static inline u##bits btrfs_token_##name(struct btrfs_map_token *token, \
>> 1623 const type *s) \
>> 1624 { \
>> 1625 BUILD_BUG_ON(sizeof(u##bits) != sizeof(((type *)0))->member); \
>> 1626 return btrfs_get_token_##bits(token, s, offsetof(type, member));\
>> 1627 } \
>> 1628 static inline void btrfs_set_token_##name(struct btrfs_map_token *token,\
>> 1629 type *s, u##bits val) \
>> 1630 { \
>> 1631 BUILD_BUG_ON(sizeof(u##bits) != sizeof(((type *)0))->member); \
>> 1632 btrfs_set_token_##bits(token, s, offsetof(type, member), val); \
>> 1633 }
>> 1634
>> 1635 #define BTRFS_SETGET_HEADER_FUNCS(name, type, member, bits) \
>> 1636 static inline u##bits btrfs_##name(const struct extent_buffer *eb) \
>> 1637 { \
>> 1638 const type *p = page_address(eb->pages[0]) + \
>> 1639 offset_in_page(eb->start); \
>> 1640 return get_unaligned_le##bits(&p->member); \
>> 1641 } \
>> 1642 static inline void btrfs_set_##name(const struct extent_buffer *eb, \
>> 1643 u##bits val) \
>> 1644 { \
>> 1645 type *p = page_address(eb->pages[0]) + offset_in_page(eb->start); \
>> 1646 put_unaligned_le##bits(val, &p->member); \
>> 1647 }
>> 1648
>> 1649 #define BTRFS_SETGET_STACK_FUNCS(name, type, member, bits) \
>> 1650 static inline u##bits btrfs_##name(const type *s) \
>> 1651 { \
>> 1652 return get_unaligned_le##bits(&s->member); \
>> 1653 } \
>> 1654 static inline void btrfs_set_##name(type *s, u##bits val) \
>> 1655 { \
>> 1656 put_unaligned_le##bits(val, &s->member); \
>> 1657 }
>> 1658
>> 1659 static inline u64 btrfs_device_total_bytes(const struct extent_buffer *eb,
>> 1660 struct btrfs_dev_item *s)
>> 1661 {
>> 1662 BUILD_BUG_ON(sizeof(u64) !=
>> 1663 sizeof(((struct btrfs_dev_item *)0))->total_bytes);
>> 1664 return btrfs_get_64(eb, s, offsetof(struct btrfs_dev_item,
>> 1665 total_bytes));
>> 1666 }
>> 1667 static inline void btrfs_set_device_total_bytes(const struct extent_buffer *eb,
>> 1668 struct btrfs_dev_item *s,
>> 1669 u64 val)
>> 1670 {
>> 1671 BUILD_BUG_ON(sizeof(u64) !=
>> 1672 sizeof(((struct btrfs_dev_item *)0))->total_bytes);
>> 1673 WARN_ON(!IS_ALIGNED(val, eb->fs_info->sectorsize));
>> 1674 btrfs_set_64(eb, s, offsetof(struct btrfs_dev_item, total_bytes), val);
>> 1675 }
>> 1676
>> 1677
>> 1678 BTRFS_SETGET_FUNCS(device_type, struct btrfs_dev_item, type, 64);
>> 1679 BTRFS_SETGET_FUNCS(device_bytes_used, struct btrfs_dev_item, bytes_used, 64);
>> 1680 BTRFS_SETGET_FUNCS(device_io_align, struct btrfs_dev_item, io_align, 32);
>> 1681 BTRFS_SETGET_FUNCS(device_io_width, struct btrfs_dev_item, io_width, 32);
>> 1682 BTRFS_SETGET_FUNCS(device_start_offset, struct btrfs_dev_item,
>> 1683 start_offset, 64);
>> 1684 BTRFS_SETGET_FUNCS(device_sector_size, struct btrfs_dev_item, sector_size, 32);
>> 1685 BTRFS_SETGET_FUNCS(device_id, struct btrfs_dev_item, devid, 64);
>> 1686 BTRFS_SETGET_FUNCS(device_group, struct btrfs_dev_item, dev_group, 32);
>> 1687 BTRFS_SETGET_FUNCS(device_seek_speed, struct btrfs_dev_item, seek_speed, 8);
>> 1688 BTRFS_SETGET_FUNCS(device_bandwidth, struct btrfs_dev_item, bandwidth, 8);
>> 1689 BTRFS_SETGET_FUNCS(device_generation, struct btrfs_dev_item, generation, 64);
>> 1690
>> 1691 BTRFS_SETGET_STACK_FUNCS(stack_device_type, struct btrfs_dev_item, type, 64);
>> 1692 BTRFS_SETGET_STACK_FUNCS(stack_device_total_bytes, struct btrfs_dev_item,
>> 1693 total_bytes, 64);
>> 1694 BTRFS_SETGET_STACK_FUNCS(stack_device_bytes_used, struct btrfs_dev_item,
>> 1695 bytes_used, 64);
>> 1696 BTRFS_SETGET_STACK_FUNCS(stack_device_io_align, struct btrfs_dev_item,
>> 1697 io_align, 32);
>> 1698 BTRFS_SETGET_STACK_FUNCS(stack_device_io_width, struct btrfs_dev_item,
>> 1699 io_width, 32);
>> 1700 BTRFS_SETGET_STACK_FUNCS(stack_device_sector_size, struct btrfs_dev_item,
>> 1701 sector_size, 32);
>> 1702 BTRFS_SETGET_STACK_FUNCS(stack_device_id, struct btrfs_dev_item, devid, 64);
>> 1703 BTRFS_SETGET_STACK_FUNCS(stack_device_group, struct btrfs_dev_item,
>> 1704 dev_group, 32);
>> 1705 BTRFS_SETGET_STACK_FUNCS(stack_device_seek_speed, struct btrfs_dev_item,
>> 1706 seek_speed, 8);
>> 1707 BTRFS_SETGET_STACK_FUNCS(stack_device_bandwidth, struct btrfs_dev_item,
>> 1708 bandwidth, 8);
>> 1709 BTRFS_SETGET_STACK_FUNCS(stack_device_generation, struct btrfs_dev_item,
>> 1710 generation, 64);
>> 1711
>> 1712 static inline unsigned long btrfs_device_uuid(struct btrfs_dev_item *d)
>> 1713 {
>> 1714 return (unsigned long)d + offsetof(struct btrfs_dev_item, uuid);
>> 1715 }
>> 1716
>> 1717 static inline unsigned long btrfs_device_fsid(struct btrfs_dev_item *d)
>> 1718 {
>> 1719 return (unsigned long)d + offsetof(struct btrfs_dev_item, fsid);
>> 1720 }
>> 1721
>> 1722 BTRFS_SETGET_FUNCS(chunk_length, struct btrfs_chunk, length, 64);
>> 1723 BTRFS_SETGET_FUNCS(chunk_owner, struct btrfs_chunk, owner, 64);
>> 1724 BTRFS_SETGET_FUNCS(chunk_stripe_len, struct btrfs_chunk, stripe_len, 64);
>> 1725 BTRFS_SETGET_FUNCS(chunk_io_align, struct btrfs_chunk, io_align, 32);
>> 1726 BTRFS_SETGET_FUNCS(chunk_io_width, struct btrfs_chunk, io_width, 32);
>> 1727 BTRFS_SETGET_FUNCS(chunk_sector_size, struct btrfs_chunk, sector_size, 32);
>> 1728 BTRFS_SETGET_FUNCS(chunk_type, struct btrfs_chunk, type, 64);
>> 1729 BTRFS_SETGET_FUNCS(chunk_num_stripes, struct btrfs_chunk, num_stripes, 16);
>> 1730 BTRFS_SETGET_FUNCS(chunk_sub_stripes, struct btrfs_chunk, sub_stripes, 16);
>> 1731 BTRFS_SETGET_FUNCS(stripe_devid, struct btrfs_stripe, devid, 64);
>> 1732 BTRFS_SETGET_FUNCS(stripe_offset, struct btrfs_stripe, offset, 64);
>> 1733
>> 1734 static inline char *btrfs_stripe_dev_uuid(struct btrfs_stripe *s)
>> 1735 {
>> 1736 return (char *)s + offsetof(struct btrfs_stripe, dev_uuid);
>> 1737 }
>> 1738
>> 1739 BTRFS_SETGET_STACK_FUNCS(stack_chunk_length, struct btrfs_chunk, length, 64);
>> 1740 BTRFS_SETGET_STACK_FUNCS(stack_chunk_owner, struct btrfs_chunk, owner, 64);
>> 1741 BTRFS_SETGET_STACK_FUNCS(stack_chunk_stripe_len, struct btrfs_chunk,
>> 1742 stripe_len, 64);
>> 1743 BTRFS_SETGET_STACK_FUNCS(stack_chunk_io_align, struct btrfs_chunk,
>> 1744 io_align, 32);
>> 1745 BTRFS_SETGET_STACK_FUNCS(stack_chunk_io_width, struct btrfs_chunk,
>> 1746 io_width, 32);
>> 1747 BTRFS_SETGET_STACK_FUNCS(stack_chunk_sector_size, struct btrfs_chunk,
>> 1748 sector_size, 32);
>> 1749 BTRFS_SETGET_STACK_FUNCS(stack_chunk_type, struct btrfs_chunk, type, 64);
>> 1750 BTRFS_SETGET_STACK_FUNCS(stack_chunk_num_stripes, struct btrfs_chunk,
>> 1751 num_stripes, 16);
>> 1752 BTRFS_SETGET_STACK_FUNCS(stack_chunk_sub_stripes, struct btrfs_chunk,
>> 1753 sub_stripes, 16);
>> 1754 BTRFS_SETGET_STACK_FUNCS(stack_stripe_devid, struct btrfs_stripe, devid, 64);
>> 1755 BTRFS_SETGET_STACK_FUNCS(stack_stripe_offset, struct btrfs_stripe, offset, 64);
>> 1756
>> 1757 static inline struct btrfs_stripe *btrfs_stripe_nr(struct btrfs_chunk *c,
>> 1758 int nr)
>> 1759 {
>> 1760 unsigned long offset = (unsigned long)c;
>> 1761 offset += offsetof(struct btrfs_chunk, stripe);
>> 1762 offset += nr * sizeof(struct btrfs_stripe);
>> 1763 return (struct btrfs_stripe *)offset;
>> 1764 }
>> 1765
>> 1766 static inline char *btrfs_stripe_dev_uuid_nr(struct btrfs_chunk *c, int nr)
>> 1767 {
>> 1768 return btrfs_stripe_dev_uuid(btrfs_stripe_nr(c, nr));
>> 1769 }
>> 1770
>> 1771 static inline u64 btrfs_stripe_offset_nr(const struct extent_buffer *eb,
>> 1772 struct btrfs_chunk *c, int nr)
>> 1773 {
>> 1774 return btrfs_stripe_offset(eb, btrfs_stripe_nr(c, nr));
>> 1775 }
>> 1776
>> 1777 static inline u64 btrfs_stripe_devid_nr(const struct extent_buffer *eb,
>> 1778 struct btrfs_chunk *c, int nr)
>> 1779 {
>> 1780 return btrfs_stripe_devid(eb, btrfs_stripe_nr(c, nr));
>> 1781 }
>> 1782
>> 1783 /* struct btrfs_block_group_item */
>> 1784 BTRFS_SETGET_STACK_FUNCS(stack_block_group_used, struct btrfs_block_group_item,
>> 1785 used, 64);
>> 1786 BTRFS_SETGET_FUNCS(block_group_used, struct btrfs_block_group_item,
>> 1787 used, 64);
>> 1788 BTRFS_SETGET_STACK_FUNCS(stack_block_group_chunk_objectid,
>> 1789 struct btrfs_block_group_item, chunk_objectid, 64);
>> 1790
>> 1791 BTRFS_SETGET_FUNCS(block_group_chunk_objectid,
>> 1792 struct btrfs_block_group_item, chunk_objectid, 64);
>> 1793 BTRFS_SETGET_FUNCS(block_group_flags,
>> 1794 struct btrfs_block_group_item, flags, 64);
>> 1795 BTRFS_SETGET_STACK_FUNCS(stack_block_group_flags,
>> 1796 struct btrfs_block_group_item, flags, 64);
>> 1797
>> 1798 /* struct btrfs_free_space_info */
>> 1799 BTRFS_SETGET_FUNCS(free_space_extent_count, struct btrfs_free_space_info,
>> 1800 extent_count, 32);
>> 1801 BTRFS_SETGET_FUNCS(free_space_flags, struct btrfs_free_space_info, flags, 32);
>> 1802
>> 1803 /* struct btrfs_inode_ref */
>> 1804 BTRFS_SETGET_FUNCS(inode_ref_name_len, struct btrfs_inode_ref, name_len, 16);
>> 1805 BTRFS_SETGET_FUNCS(inode_ref_index, struct btrfs_inode_ref, index, 64);
>> 1806
>> 1807 /* struct btrfs_inode_extref */
>> 1808 BTRFS_SETGET_FUNCS(inode_extref_parent, struct btrfs_inode_extref,
>> 1809 parent_objectid, 64);
>> 1810 BTRFS_SETGET_FUNCS(inode_extref_name_len, struct btrfs_inode_extref,
>> 1811 name_len, 16);
>> 1812 BTRFS_SETGET_FUNCS(inode_extref_index, struct btrfs_inode_extref, index, 64);
>> 1813
>> 1814 /* struct btrfs_inode_item */
>> 1815 BTRFS_SETGET_FUNCS(inode_generation, struct btrfs_inode_item, generation, 64);
>> 1816 BTRFS_SETGET_FUNCS(inode_sequence, struct btrfs_inode_item, sequence, 64);
>> 1817 BTRFS_SETGET_FUNCS(inode_transid, struct btrfs_inode_item, transid, 64);
>> 1818 BTRFS_SETGET_FUNCS(inode_size, struct btrfs_inode_item, size, 64);
>> 1819 BTRFS_SETGET_FUNCS(inode_nbytes, struct btrfs_inode_item, nbytes, 64);
>> 1820 BTRFS_SETGET_FUNCS(inode_block_group, struct btrfs_inode_item, block_group, 64);
>> 1821 BTRFS_SETGET_FUNCS(inode_nlink, struct btrfs_inode_item, nlink, 32);
>> 1822 BTRFS_SETGET_FUNCS(inode_uid, struct btrfs_inode_item, uid, 32);
>> 1823 BTRFS_SETGET_FUNCS(inode_gid, struct btrfs_inode_item, gid, 32);
>> 1824 BTRFS_SETGET_FUNCS(inode_mode, struct btrfs_inode_item, mode, 32);
>> 1825 BTRFS_SETGET_FUNCS(inode_rdev, struct btrfs_inode_item, rdev, 64);
>> 1826 BTRFS_SETGET_FUNCS(inode_flags, struct btrfs_inode_item, flags, 64);
>> 1827 BTRFS_SETGET_STACK_FUNCS(stack_inode_generation, struct btrfs_inode_item,
>> 1828 generation, 64);
>> 1829 BTRFS_SETGET_STACK_FUNCS(stack_inode_sequence, struct btrfs_inode_item,
>> 1830 sequence, 64);
>> 1831 BTRFS_SETGET_STACK_FUNCS(stack_inode_transid, struct btrfs_inode_item,
>> 1832 transid, 64);
>> 1833 BTRFS_SETGET_STACK_FUNCS(stack_inode_size, struct btrfs_inode_item, size, 64);
>> 1834 BTRFS_SETGET_STACK_FUNCS(stack_inode_nbytes, struct btrfs_inode_item,
>> 1835 nbytes, 64);
>> 1836 BTRFS_SETGET_STACK_FUNCS(stack_inode_block_group, struct btrfs_inode_item,
>> 1837 block_group, 64);
>> 1838 BTRFS_SETGET_STACK_FUNCS(stack_inode_nlink, struct btrfs_inode_item, nlink, 32);
>> 1839 BTRFS_SETGET_STACK_FUNCS(stack_inode_uid, struct btrfs_inode_item, uid, 32);
>> 1840 BTRFS_SETGET_STACK_FUNCS(stack_inode_gid, struct btrfs_inode_item, gid, 32);
>> 1841 BTRFS_SETGET_STACK_FUNCS(stack_inode_mode, struct btrfs_inode_item, mode, 32);
>> 1842 BTRFS_SETGET_STACK_FUNCS(stack_inode_rdev, struct btrfs_inode_item, rdev, 64);
>> 1843 BTRFS_SETGET_STACK_FUNCS(stack_inode_flags, struct btrfs_inode_item, flags, 64);
>> 1844 BTRFS_SETGET_FUNCS(timespec_sec, struct btrfs_timespec, sec, 64);
>> 1845 BTRFS_SETGET_FUNCS(timespec_nsec, struct btrfs_timespec, nsec, 32);
>> 1846 BTRFS_SETGET_STACK_FUNCS(stack_timespec_sec, struct btrfs_timespec, sec, 64);
>> 1847 BTRFS_SETGET_STACK_FUNCS(stack_timespec_nsec, struct btrfs_timespec, nsec, 32);
>> 1848
>> 1849 /* struct btrfs_dev_extent */
>> 1850 BTRFS_SETGET_FUNCS(dev_extent_chunk_tree, struct btrfs_dev_extent,
>> 1851 chunk_tree, 64);
>> 1852 BTRFS_SETGET_FUNCS(dev_extent_chunk_objectid, struct btrfs_dev_extent,
>> 1853 chunk_objectid, 64);
>> 1854 BTRFS_SETGET_FUNCS(dev_extent_chunk_offset, struct btrfs_dev_extent,
>> 1855 chunk_offset, 64);
>> 1856 BTRFS_SETGET_FUNCS(dev_extent_length, struct btrfs_dev_extent, length, 64);
>> 1857 BTRFS_SETGET_FUNCS(extent_refs, struct btrfs_extent_item, refs, 64);
>> 1858 BTRFS_SETGET_FUNCS(extent_generation, struct btrfs_extent_item,
>> 1859 generation, 64);
>> 1860 BTRFS_SETGET_FUNCS(extent_flags, struct btrfs_extent_item, flags, 64);
>> 1861
>> 1862 BTRFS_SETGET_FUNCS(tree_block_level, struct btrfs_tree_block_info, level, 8);
>> 1863
>> 1864 static inline void btrfs_tree_block_key(const struct extent_buffer *eb,
>> 1865 struct btrfs_tree_block_info *item,
>> 1866 struct btrfs_disk_key *key)
>> 1867 {
>> 1868 read_eb_member(eb, item, struct btrfs_tree_block_info, key, key);
>> 1869 }
>> 1870
>> 1871 static inline void btrfs_set_tree_block_key(const struct extent_buffer *eb,
>> 1872 struct btrfs_tree_block_info *item,
>> 1873 struct btrfs_disk_key *key)
>> 1874 {
>> 1875 write_eb_member(eb, item, struct btrfs_tree_block_info, key, key);
>> 1876 }
>> 1877
>> 1878 BTRFS_SETGET_FUNCS(extent_data_ref_root, struct btrfs_extent_data_ref,
>> 1879 root, 64);
>> 1880 BTRFS_SETGET_FUNCS(extent_data_ref_objectid, struct btrfs_extent_data_ref,
>> 1881 objectid, 64);
>> 1882 BTRFS_SETGET_FUNCS(extent_data_ref_offset, struct btrfs_extent_data_ref,
>> 1883 offset, 64);
>> 1884 BTRFS_SETGET_FUNCS(extent_data_ref_count, struct btrfs_extent_data_ref,
>> 1885 count, 32);
>> 1886
>> 1887 BTRFS_SETGET_FUNCS(shared_data_ref_count, struct btrfs_shared_data_ref,
>> 1888 count, 32);
>> 1889
>> 1890 BTRFS_SETGET_FUNCS(extent_inline_ref_type, struct btrfs_extent_inline_ref,
>> 1891 type, 8);
>> 1892 BTRFS_SETGET_FUNCS(extent_inline_ref_offset, struct btrfs_extent_inline_ref,
>> 1893 offset, 64);
>> 1894
>> 1895 static inline u32 btrfs_extent_inline_ref_size(int type)
>> 1896 {
>> 1897 if (type == BTRFS_TREE_BLOCK_REF_KEY ||
>> 1898 type == BTRFS_SHARED_BLOCK_REF_KEY)
>> 1899 return sizeof(struct btrfs_extent_inline_ref);
>> 1900 if (type == BTRFS_SHARED_DATA_REF_KEY)
>> 1901 return sizeof(struct btrfs_shared_data_ref) +
>> 1902 sizeof(struct btrfs_extent_inline_ref);
>> 1903 if (type == BTRFS_EXTENT_DATA_REF_KEY)
>> 1904 return sizeof(struct btrfs_extent_data_ref) +
>> 1905 offsetof(struct btrfs_extent_inline_ref, offset);
>> 1906 return 0;
>> 1907 }
502 1908
503 /* ctree.c */ !! 1909 /* struct btrfs_node */
504 int __init btrfs_ctree_init(void); !! 1910 BTRFS_SETGET_FUNCS(key_blockptr, struct btrfs_key_ptr, blockptr, 64);
505 void __cold btrfs_ctree_exit(void); !! 1911 BTRFS_SETGET_FUNCS(key_generation, struct btrfs_key_ptr, generation, 64);
>> 1912 BTRFS_SETGET_STACK_FUNCS(stack_key_blockptr, struct btrfs_key_ptr,
>> 1913 blockptr, 64);
>> 1914 BTRFS_SETGET_STACK_FUNCS(stack_key_generation, struct btrfs_key_ptr,
>> 1915 generation, 64);
506 1916
507 int btrfs_bin_search(struct extent_buffer *eb, !! 1917 static inline u64 btrfs_node_blockptr(const struct extent_buffer *eb, int nr)
508 const struct btrfs_key *k !! 1918 {
>> 1919 unsigned long ptr;
>> 1920 ptr = offsetof(struct btrfs_node, ptrs) +
>> 1921 sizeof(struct btrfs_key_ptr) * nr;
>> 1922 return btrfs_key_blockptr(eb, (struct btrfs_key_ptr *)ptr);
>> 1923 }
509 1924
510 int __pure btrfs_comp_cpu_keys(const struct bt !! 1925 static inline void btrfs_set_node_blockptr(const struct extent_buffer *eb,
>> 1926 int nr, u64 val)
>> 1927 {
>> 1928 unsigned long ptr;
>> 1929 ptr = offsetof(struct btrfs_node, ptrs) +
>> 1930 sizeof(struct btrfs_key_ptr) * nr;
>> 1931 btrfs_set_key_blockptr(eb, (struct btrfs_key_ptr *)ptr, val);
>> 1932 }
>> 1933
>> 1934 static inline u64 btrfs_node_ptr_generation(const struct extent_buffer *eb, int nr)
>> 1935 {
>> 1936 unsigned long ptr;
>> 1937 ptr = offsetof(struct btrfs_node, ptrs) +
>> 1938 sizeof(struct btrfs_key_ptr) * nr;
>> 1939 return btrfs_key_generation(eb, (struct btrfs_key_ptr *)ptr);
>> 1940 }
>> 1941
>> 1942 static inline void btrfs_set_node_ptr_generation(const struct extent_buffer *eb,
>> 1943 int nr, u64 val)
>> 1944 {
>> 1945 unsigned long ptr;
>> 1946 ptr = offsetof(struct btrfs_node, ptrs) +
>> 1947 sizeof(struct btrfs_key_ptr) * nr;
>> 1948 btrfs_set_key_generation(eb, (struct btrfs_key_ptr *)ptr, val);
>> 1949 }
>> 1950
>> 1951 static inline unsigned long btrfs_node_key_ptr_offset(int nr)
>> 1952 {
>> 1953 return offsetof(struct btrfs_node, ptrs) +
>> 1954 sizeof(struct btrfs_key_ptr) * nr;
>> 1955 }
>> 1956
>> 1957 void btrfs_node_key(const struct extent_buffer *eb,
>> 1958 struct btrfs_disk_key *disk_key, int nr);
>> 1959
>> 1960 static inline void btrfs_set_node_key(const struct extent_buffer *eb,
>> 1961 struct btrfs_disk_key *disk_key, int nr)
>> 1962 {
>> 1963 unsigned long ptr;
>> 1964 ptr = btrfs_node_key_ptr_offset(nr);
>> 1965 write_eb_member(eb, (struct btrfs_key_ptr *)ptr,
>> 1966 struct btrfs_key_ptr, key, disk_key);
>> 1967 }
>> 1968
>> 1969 /* struct btrfs_item */
>> 1970 BTRFS_SETGET_FUNCS(raw_item_offset, struct btrfs_item, offset, 32);
>> 1971 BTRFS_SETGET_FUNCS(raw_item_size, struct btrfs_item, size, 32);
>> 1972 BTRFS_SETGET_STACK_FUNCS(stack_item_offset, struct btrfs_item, offset, 32);
>> 1973 BTRFS_SETGET_STACK_FUNCS(stack_item_size, struct btrfs_item, size, 32);
>> 1974
>> 1975 static inline unsigned long btrfs_item_nr_offset(int nr)
>> 1976 {
>> 1977 return offsetof(struct btrfs_leaf, items) +
>> 1978 sizeof(struct btrfs_item) * nr;
>> 1979 }
>> 1980
>> 1981 static inline struct btrfs_item *btrfs_item_nr(int nr)
>> 1982 {
>> 1983 return (struct btrfs_item *)btrfs_item_nr_offset(nr);
>> 1984 }
>> 1985
>> 1986 #define BTRFS_ITEM_SETGET_FUNCS(member) \
>> 1987 static inline u32 btrfs_item_##member(const struct extent_buffer *eb, \
>> 1988 int slot) \
>> 1989 { \
>> 1990 return btrfs_raw_item_##member(eb, btrfs_item_nr(slot)); \
>> 1991 } \
>> 1992 static inline void btrfs_set_item_##member(const struct extent_buffer *eb, \
>> 1993 int slot, u32 val) \
>> 1994 { \
>> 1995 btrfs_set_raw_item_##member(eb, btrfs_item_nr(slot), val); \
>> 1996 } \
>> 1997 static inline u32 btrfs_token_item_##member(struct btrfs_map_token *token, \
>> 1998 int slot) \
>> 1999 { \
>> 2000 struct btrfs_item *item = btrfs_item_nr(slot); \
>> 2001 return btrfs_token_raw_item_##member(token, item); \
>> 2002 } \
>> 2003 static inline void btrfs_set_token_item_##member(struct btrfs_map_token *token, \
>> 2004 int slot, u32 val) \
>> 2005 { \
>> 2006 struct btrfs_item *item = btrfs_item_nr(slot); \
>> 2007 btrfs_set_token_raw_item_##member(token, item, val); \
>> 2008 }
>> 2009
>> 2010 BTRFS_ITEM_SETGET_FUNCS(offset)
>> 2011 BTRFS_ITEM_SETGET_FUNCS(size);
>> 2012
>> 2013 static inline u32 btrfs_item_data_end(const struct extent_buffer *eb, int nr)
>> 2014 {
>> 2015 return btrfs_item_offset(eb, nr) + btrfs_item_size(eb, nr);
>> 2016 }
>> 2017
>> 2018 static inline void btrfs_item_key(const struct extent_buffer *eb,
>> 2019 struct btrfs_disk_key *disk_key, int nr)
>> 2020 {
>> 2021 struct btrfs_item *item = btrfs_item_nr(nr);
>> 2022 read_eb_member(eb, item, struct btrfs_item, key, disk_key);
>> 2023 }
>> 2024
>> 2025 static inline void btrfs_set_item_key(struct extent_buffer *eb,
>> 2026 struct btrfs_disk_key *disk_key, int nr)
>> 2027 {
>> 2028 struct btrfs_item *item = btrfs_item_nr(nr);
>> 2029 write_eb_member(eb, item, struct btrfs_item, key, disk_key);
>> 2030 }
>> 2031
>> 2032 BTRFS_SETGET_FUNCS(dir_log_end, struct btrfs_dir_log_item, end, 64);
>> 2033
>> 2034 /*
>> 2035 * struct btrfs_root_ref
>> 2036 */
>> 2037 BTRFS_SETGET_FUNCS(root_ref_dirid, struct btrfs_root_ref, dirid, 64);
>> 2038 BTRFS_SETGET_FUNCS(root_ref_sequence, struct btrfs_root_ref, sequence, 64);
>> 2039 BTRFS_SETGET_FUNCS(root_ref_name_len, struct btrfs_root_ref, name_len, 16);
>> 2040
>> 2041 /* struct btrfs_dir_item */
>> 2042 BTRFS_SETGET_FUNCS(dir_data_len, struct btrfs_dir_item, data_len, 16);
>> 2043 BTRFS_SETGET_FUNCS(dir_type, struct btrfs_dir_item, type, 8);
>> 2044 BTRFS_SETGET_FUNCS(dir_name_len, struct btrfs_dir_item, name_len, 16);
>> 2045 BTRFS_SETGET_FUNCS(dir_transid, struct btrfs_dir_item, transid, 64);
>> 2046 BTRFS_SETGET_STACK_FUNCS(stack_dir_type, struct btrfs_dir_item, type, 8);
>> 2047 BTRFS_SETGET_STACK_FUNCS(stack_dir_data_len, struct btrfs_dir_item,
>> 2048 data_len, 16);
>> 2049 BTRFS_SETGET_STACK_FUNCS(stack_dir_name_len, struct btrfs_dir_item,
>> 2050 name_len, 16);
>> 2051 BTRFS_SETGET_STACK_FUNCS(stack_dir_transid, struct btrfs_dir_item,
>> 2052 transid, 64);
>> 2053
>> 2054 static inline void btrfs_dir_item_key(const struct extent_buffer *eb,
>> 2055 const struct btrfs_dir_item *item,
>> 2056 struct btrfs_disk_key *key)
>> 2057 {
>> 2058 read_eb_member(eb, item, struct btrfs_dir_item, location, key);
>> 2059 }
>> 2060
>> 2061 static inline void btrfs_set_dir_item_key(struct extent_buffer *eb,
>> 2062 struct btrfs_dir_item *item,
>> 2063 const struct btrfs_disk_key *key)
>> 2064 {
>> 2065 write_eb_member(eb, item, struct btrfs_dir_item, location, key);
>> 2066 }
>> 2067
>> 2068 BTRFS_SETGET_FUNCS(free_space_entries, struct btrfs_free_space_header,
>> 2069 num_entries, 64);
>> 2070 BTRFS_SETGET_FUNCS(free_space_bitmaps, struct btrfs_free_space_header,
>> 2071 num_bitmaps, 64);
>> 2072 BTRFS_SETGET_FUNCS(free_space_generation, struct btrfs_free_space_header,
>> 2073 generation, 64);
>> 2074
>> 2075 static inline void btrfs_free_space_key(const struct extent_buffer *eb,
>> 2076 const struct btrfs_free_space_header *h,
>> 2077 struct btrfs_disk_key *key)
>> 2078 {
>> 2079 read_eb_member(eb, h, struct btrfs_free_space_header, location, key);
>> 2080 }
>> 2081
>> 2082 static inline void btrfs_set_free_space_key(struct extent_buffer *eb,
>> 2083 struct btrfs_free_space_header *h,
>> 2084 const struct btrfs_disk_key *key)
>> 2085 {
>> 2086 write_eb_member(eb, h, struct btrfs_free_space_header, location, key);
>> 2087 }
>> 2088
>> 2089 /* struct btrfs_disk_key */
>> 2090 BTRFS_SETGET_STACK_FUNCS(disk_key_objectid, struct btrfs_disk_key,
>> 2091 objectid, 64);
>> 2092 BTRFS_SETGET_STACK_FUNCS(disk_key_offset, struct btrfs_disk_key, offset, 64);
>> 2093 BTRFS_SETGET_STACK_FUNCS(disk_key_type, struct btrfs_disk_key, type, 8);
511 2094
512 #ifdef __LITTLE_ENDIAN 2095 #ifdef __LITTLE_ENDIAN
513 2096
514 /* 2097 /*
515 * Compare two keys, on little-endian the disk !! 2098 * Optimized helpers for little-endian architectures where CPU and on-disk
516 * we can avoid the conversion. !! 2099 * structures have the same endianness and we can skip conversions.
517 */ 2100 */
518 static inline int btrfs_comp_keys(const struct !! 2101
519 const struct !! 2102 static inline void btrfs_disk_key_to_cpu(struct btrfs_key *cpu_key,
>> 2103 const struct btrfs_disk_key *disk_key)
520 { 2104 {
521 const struct btrfs_key *k1 = (const st !! 2105 memcpy(cpu_key, disk_key, sizeof(struct btrfs_key));
>> 2106 }
522 2107
523 return btrfs_comp_cpu_keys(k1, k2); !! 2108 static inline void btrfs_cpu_key_to_disk(struct btrfs_disk_key *disk_key,
>> 2109 const struct btrfs_key *cpu_key)
>> 2110 {
>> 2111 memcpy(disk_key, cpu_key, sizeof(struct btrfs_key));
>> 2112 }
>> 2113
>> 2114 static inline void btrfs_node_key_to_cpu(const struct extent_buffer *eb,
>> 2115 struct btrfs_key *cpu_key, int nr)
>> 2116 {
>> 2117 struct btrfs_disk_key *disk_key = (struct btrfs_disk_key *)cpu_key;
>> 2118
>> 2119 btrfs_node_key(eb, disk_key, nr);
>> 2120 }
>> 2121
>> 2122 static inline void btrfs_item_key_to_cpu(const struct extent_buffer *eb,
>> 2123 struct btrfs_key *cpu_key, int nr)
>> 2124 {
>> 2125 struct btrfs_disk_key *disk_key = (struct btrfs_disk_key *)cpu_key;
>> 2126
>> 2127 btrfs_item_key(eb, disk_key, nr);
>> 2128 }
>> 2129
>> 2130 static inline void btrfs_dir_item_key_to_cpu(const struct extent_buffer *eb,
>> 2131 const struct btrfs_dir_item *item,
>> 2132 struct btrfs_key *cpu_key)
>> 2133 {
>> 2134 struct btrfs_disk_key *disk_key = (struct btrfs_disk_key *)cpu_key;
>> 2135
>> 2136 btrfs_dir_item_key(eb, item, disk_key);
524 } 2137 }
525 2138
526 #else 2139 #else
527 2140
528 /* Compare two keys in a memcmp fashion. */ !! 2141 static inline void btrfs_disk_key_to_cpu(struct btrfs_key *cpu,
529 static inline int btrfs_comp_keys(const struct !! 2142 const struct btrfs_disk_key *disk)
530 const struct <<
531 { 2143 {
532 struct btrfs_key k1; !! 2144 cpu->offset = le64_to_cpu(disk->offset);
>> 2145 cpu->type = disk->type;
>> 2146 cpu->objectid = le64_to_cpu(disk->objectid);
>> 2147 }
>> 2148
>> 2149 static inline void btrfs_cpu_key_to_disk(struct btrfs_disk_key *disk,
>> 2150 const struct btrfs_key *cpu)
>> 2151 {
>> 2152 disk->offset = cpu_to_le64(cpu->offset);
>> 2153 disk->type = cpu->type;
>> 2154 disk->objectid = cpu_to_le64(cpu->objectid);
>> 2155 }
533 2156
534 btrfs_disk_key_to_cpu(&k1, disk); !! 2157 static inline void btrfs_node_key_to_cpu(const struct extent_buffer *eb,
>> 2158 struct btrfs_key *key, int nr)
>> 2159 {
>> 2160 struct btrfs_disk_key disk_key;
>> 2161 btrfs_node_key(eb, &disk_key, nr);
>> 2162 btrfs_disk_key_to_cpu(key, &disk_key);
>> 2163 }
535 2164
536 return btrfs_comp_cpu_keys(&k1, k2); !! 2165 static inline void btrfs_item_key_to_cpu(const struct extent_buffer *eb,
>> 2166 struct btrfs_key *key, int nr)
>> 2167 {
>> 2168 struct btrfs_disk_key disk_key;
>> 2169 btrfs_item_key(eb, &disk_key, nr);
>> 2170 btrfs_disk_key_to_cpu(key, &disk_key);
>> 2171 }
>> 2172
>> 2173 static inline void btrfs_dir_item_key_to_cpu(const struct extent_buffer *eb,
>> 2174 const struct btrfs_dir_item *item,
>> 2175 struct btrfs_key *key)
>> 2176 {
>> 2177 struct btrfs_disk_key disk_key;
>> 2178 btrfs_dir_item_key(eb, item, &disk_key);
>> 2179 btrfs_disk_key_to_cpu(key, &disk_key);
537 } 2180 }
538 2181
539 #endif 2182 #endif
540 2183
>> 2184 /* struct btrfs_header */
>> 2185 BTRFS_SETGET_HEADER_FUNCS(header_bytenr, struct btrfs_header, bytenr, 64);
>> 2186 BTRFS_SETGET_HEADER_FUNCS(header_generation, struct btrfs_header,
>> 2187 generation, 64);
>> 2188 BTRFS_SETGET_HEADER_FUNCS(header_owner, struct btrfs_header, owner, 64);
>> 2189 BTRFS_SETGET_HEADER_FUNCS(header_nritems, struct btrfs_header, nritems, 32);
>> 2190 BTRFS_SETGET_HEADER_FUNCS(header_flags, struct btrfs_header, flags, 64);
>> 2191 BTRFS_SETGET_HEADER_FUNCS(header_level, struct btrfs_header, level, 8);
>> 2192 BTRFS_SETGET_STACK_FUNCS(stack_header_generation, struct btrfs_header,
>> 2193 generation, 64);
>> 2194 BTRFS_SETGET_STACK_FUNCS(stack_header_owner, struct btrfs_header, owner, 64);
>> 2195 BTRFS_SETGET_STACK_FUNCS(stack_header_nritems, struct btrfs_header,
>> 2196 nritems, 32);
>> 2197 BTRFS_SETGET_STACK_FUNCS(stack_header_bytenr, struct btrfs_header, bytenr, 64);
>> 2198
>> 2199 static inline int btrfs_header_flag(const struct extent_buffer *eb, u64 flag)
>> 2200 {
>> 2201 return (btrfs_header_flags(eb) & flag) == flag;
>> 2202 }
>> 2203
>> 2204 static inline void btrfs_set_header_flag(struct extent_buffer *eb, u64 flag)
>> 2205 {
>> 2206 u64 flags = btrfs_header_flags(eb);
>> 2207 btrfs_set_header_flags(eb, flags | flag);
>> 2208 }
>> 2209
>> 2210 static inline void btrfs_clear_header_flag(struct extent_buffer *eb, u64 flag)
>> 2211 {
>> 2212 u64 flags = btrfs_header_flags(eb);
>> 2213 btrfs_set_header_flags(eb, flags & ~flag);
>> 2214 }
>> 2215
>> 2216 static inline int btrfs_header_backref_rev(const struct extent_buffer *eb)
>> 2217 {
>> 2218 u64 flags = btrfs_header_flags(eb);
>> 2219 return flags >> BTRFS_BACKREF_REV_SHIFT;
>> 2220 }
>> 2221
>> 2222 static inline void btrfs_set_header_backref_rev(struct extent_buffer *eb,
>> 2223 int rev)
>> 2224 {
>> 2225 u64 flags = btrfs_header_flags(eb);
>> 2226 flags &= ~BTRFS_BACKREF_REV_MASK;
>> 2227 flags |= (u64)rev << BTRFS_BACKREF_REV_SHIFT;
>> 2228 btrfs_set_header_flags(eb, flags);
>> 2229 }
>> 2230
>> 2231 static inline int btrfs_is_leaf(const struct extent_buffer *eb)
>> 2232 {
>> 2233 return btrfs_header_level(eb) == 0;
>> 2234 }
>> 2235
>> 2236 /* struct btrfs_root_item */
>> 2237 BTRFS_SETGET_FUNCS(disk_root_generation, struct btrfs_root_item,
>> 2238 generation, 64);
>> 2239 BTRFS_SETGET_FUNCS(disk_root_refs, struct btrfs_root_item, refs, 32);
>> 2240 BTRFS_SETGET_FUNCS(disk_root_bytenr, struct btrfs_root_item, bytenr, 64);
>> 2241 BTRFS_SETGET_FUNCS(disk_root_level, struct btrfs_root_item, level, 8);
>> 2242
>> 2243 BTRFS_SETGET_STACK_FUNCS(root_generation, struct btrfs_root_item,
>> 2244 generation, 64);
>> 2245 BTRFS_SETGET_STACK_FUNCS(root_bytenr, struct btrfs_root_item, bytenr, 64);
>> 2246 BTRFS_SETGET_STACK_FUNCS(root_drop_level, struct btrfs_root_item, drop_level, 8);
>> 2247 BTRFS_SETGET_STACK_FUNCS(root_level, struct btrfs_root_item, level, 8);
>> 2248 BTRFS_SETGET_STACK_FUNCS(root_dirid, struct btrfs_root_item, root_dirid, 64);
>> 2249 BTRFS_SETGET_STACK_FUNCS(root_refs, struct btrfs_root_item, refs, 32);
>> 2250 BTRFS_SETGET_STACK_FUNCS(root_flags, struct btrfs_root_item, flags, 64);
>> 2251 BTRFS_SETGET_STACK_FUNCS(root_used, struct btrfs_root_item, bytes_used, 64);
>> 2252 BTRFS_SETGET_STACK_FUNCS(root_limit, struct btrfs_root_item, byte_limit, 64);
>> 2253 BTRFS_SETGET_STACK_FUNCS(root_last_snapshot, struct btrfs_root_item,
>> 2254 last_snapshot, 64);
>> 2255 BTRFS_SETGET_STACK_FUNCS(root_generation_v2, struct btrfs_root_item,
>> 2256 generation_v2, 64);
>> 2257 BTRFS_SETGET_STACK_FUNCS(root_ctransid, struct btrfs_root_item,
>> 2258 ctransid, 64);
>> 2259 BTRFS_SETGET_STACK_FUNCS(root_otransid, struct btrfs_root_item,
>> 2260 otransid, 64);
>> 2261 BTRFS_SETGET_STACK_FUNCS(root_stransid, struct btrfs_root_item,
>> 2262 stransid, 64);
>> 2263 BTRFS_SETGET_STACK_FUNCS(root_rtransid, struct btrfs_root_item,
>> 2264 rtransid, 64);
>> 2265
>> 2266 static inline bool btrfs_root_readonly(const struct btrfs_root *root)
>> 2267 {
>> 2268 /* Byte-swap the constant at compile time, root_item::flags is LE */
>> 2269 return (root->root_item.flags & cpu_to_le64(BTRFS_ROOT_SUBVOL_RDONLY)) != 0;
>> 2270 }
>> 2271
>> 2272 static inline bool btrfs_root_dead(const struct btrfs_root *root)
>> 2273 {
>> 2274 /* Byte-swap the constant at compile time, root_item::flags is LE */
>> 2275 return (root->root_item.flags & cpu_to_le64(BTRFS_ROOT_SUBVOL_DEAD)) != 0;
>> 2276 }
>> 2277
>> 2278 static inline u64 btrfs_root_id(const struct btrfs_root *root)
>> 2279 {
>> 2280 return root->root_key.objectid;
>> 2281 }
>> 2282
>> 2283 /* struct btrfs_root_backup */
>> 2284 BTRFS_SETGET_STACK_FUNCS(backup_tree_root, struct btrfs_root_backup,
>> 2285 tree_root, 64);
>> 2286 BTRFS_SETGET_STACK_FUNCS(backup_tree_root_gen, struct btrfs_root_backup,
>> 2287 tree_root_gen, 64);
>> 2288 BTRFS_SETGET_STACK_FUNCS(backup_tree_root_level, struct btrfs_root_backup,
>> 2289 tree_root_level, 8);
>> 2290
>> 2291 BTRFS_SETGET_STACK_FUNCS(backup_chunk_root, struct btrfs_root_backup,
>> 2292 chunk_root, 64);
>> 2293 BTRFS_SETGET_STACK_FUNCS(backup_chunk_root_gen, struct btrfs_root_backup,
>> 2294 chunk_root_gen, 64);
>> 2295 BTRFS_SETGET_STACK_FUNCS(backup_chunk_root_level, struct btrfs_root_backup,
>> 2296 chunk_root_level, 8);
>> 2297
>> 2298 BTRFS_SETGET_STACK_FUNCS(backup_extent_root, struct btrfs_root_backup,
>> 2299 extent_root, 64);
>> 2300 BTRFS_SETGET_STACK_FUNCS(backup_extent_root_gen, struct btrfs_root_backup,
>> 2301 extent_root_gen, 64);
>> 2302 BTRFS_SETGET_STACK_FUNCS(backup_extent_root_level, struct btrfs_root_backup,
>> 2303 extent_root_level, 8);
>> 2304
>> 2305 BTRFS_SETGET_STACK_FUNCS(backup_fs_root, struct btrfs_root_backup,
>> 2306 fs_root, 64);
>> 2307 BTRFS_SETGET_STACK_FUNCS(backup_fs_root_gen, struct btrfs_root_backup,
>> 2308 fs_root_gen, 64);
>> 2309 BTRFS_SETGET_STACK_FUNCS(backup_fs_root_level, struct btrfs_root_backup,
>> 2310 fs_root_level, 8);
>> 2311
>> 2312 BTRFS_SETGET_STACK_FUNCS(backup_dev_root, struct btrfs_root_backup,
>> 2313 dev_root, 64);
>> 2314 BTRFS_SETGET_STACK_FUNCS(backup_dev_root_gen, struct btrfs_root_backup,
>> 2315 dev_root_gen, 64);
>> 2316 BTRFS_SETGET_STACK_FUNCS(backup_dev_root_level, struct btrfs_root_backup,
>> 2317 dev_root_level, 8);
>> 2318
>> 2319 BTRFS_SETGET_STACK_FUNCS(backup_csum_root, struct btrfs_root_backup,
>> 2320 csum_root, 64);
>> 2321 BTRFS_SETGET_STACK_FUNCS(backup_csum_root_gen, struct btrfs_root_backup,
>> 2322 csum_root_gen, 64);
>> 2323 BTRFS_SETGET_STACK_FUNCS(backup_csum_root_level, struct btrfs_root_backup,
>> 2324 csum_root_level, 8);
>> 2325 BTRFS_SETGET_STACK_FUNCS(backup_total_bytes, struct btrfs_root_backup,
>> 2326 total_bytes, 64);
>> 2327 BTRFS_SETGET_STACK_FUNCS(backup_bytes_used, struct btrfs_root_backup,
>> 2328 bytes_used, 64);
>> 2329 BTRFS_SETGET_STACK_FUNCS(backup_num_devices, struct btrfs_root_backup,
>> 2330 num_devices, 64);
>> 2331
>> 2332 /* struct btrfs_balance_item */
>> 2333 BTRFS_SETGET_FUNCS(balance_flags, struct btrfs_balance_item, flags, 64);
>> 2334
>> 2335 static inline void btrfs_balance_data(const struct extent_buffer *eb,
>> 2336 const struct btrfs_balance_item *bi,
>> 2337 struct btrfs_disk_balance_args *ba)
>> 2338 {
>> 2339 read_eb_member(eb, bi, struct btrfs_balance_item, data, ba);
>> 2340 }
>> 2341
>> 2342 static inline void btrfs_set_balance_data(struct extent_buffer *eb,
>> 2343 struct btrfs_balance_item *bi,
>> 2344 const struct btrfs_disk_balance_args *ba)
>> 2345 {
>> 2346 write_eb_member(eb, bi, struct btrfs_balance_item, data, ba);
>> 2347 }
>> 2348
>> 2349 static inline void btrfs_balance_meta(const struct extent_buffer *eb,
>> 2350 const struct btrfs_balance_item *bi,
>> 2351 struct btrfs_disk_balance_args *ba)
>> 2352 {
>> 2353 read_eb_member(eb, bi, struct btrfs_balance_item, meta, ba);
>> 2354 }
>> 2355
>> 2356 static inline void btrfs_set_balance_meta(struct extent_buffer *eb,
>> 2357 struct btrfs_balance_item *bi,
>> 2358 const struct btrfs_disk_balance_args *ba)
>> 2359 {
>> 2360 write_eb_member(eb, bi, struct btrfs_balance_item, meta, ba);
>> 2361 }
>> 2362
>> 2363 static inline void btrfs_balance_sys(const struct extent_buffer *eb,
>> 2364 const struct btrfs_balance_item *bi,
>> 2365 struct btrfs_disk_balance_args *ba)
>> 2366 {
>> 2367 read_eb_member(eb, bi, struct btrfs_balance_item, sys, ba);
>> 2368 }
>> 2369
>> 2370 static inline void btrfs_set_balance_sys(struct extent_buffer *eb,
>> 2371 struct btrfs_balance_item *bi,
>> 2372 const struct btrfs_disk_balance_args *ba)
>> 2373 {
>> 2374 write_eb_member(eb, bi, struct btrfs_balance_item, sys, ba);
>> 2375 }
>> 2376
>> 2377 static inline void
>> 2378 btrfs_disk_balance_args_to_cpu(struct btrfs_balance_args *cpu,
>> 2379 const struct btrfs_disk_balance_args *disk)
>> 2380 {
>> 2381 memset(cpu, 0, sizeof(*cpu));
>> 2382
>> 2383 cpu->profiles = le64_to_cpu(disk->profiles);
>> 2384 cpu->usage = le64_to_cpu(disk->usage);
>> 2385 cpu->devid = le64_to_cpu(disk->devid);
>> 2386 cpu->pstart = le64_to_cpu(disk->pstart);
>> 2387 cpu->pend = le64_to_cpu(disk->pend);
>> 2388 cpu->vstart = le64_to_cpu(disk->vstart);
>> 2389 cpu->vend = le64_to_cpu(disk->vend);
>> 2390 cpu->target = le64_to_cpu(disk->target);
>> 2391 cpu->flags = le64_to_cpu(disk->flags);
>> 2392 cpu->limit = le64_to_cpu(disk->limit);
>> 2393 cpu->stripes_min = le32_to_cpu(disk->stripes_min);
>> 2394 cpu->stripes_max = le32_to_cpu(disk->stripes_max);
>> 2395 }
>> 2396
>> 2397 static inline void
>> 2398 btrfs_cpu_balance_args_to_disk(struct btrfs_disk_balance_args *disk,
>> 2399 const struct btrfs_balance_args *cpu)
>> 2400 {
>> 2401 memset(disk, 0, sizeof(*disk));
>> 2402
>> 2403 disk->profiles = cpu_to_le64(cpu->profiles);
>> 2404 disk->usage = cpu_to_le64(cpu->usage);
>> 2405 disk->devid = cpu_to_le64(cpu->devid);
>> 2406 disk->pstart = cpu_to_le64(cpu->pstart);
>> 2407 disk->pend = cpu_to_le64(cpu->pend);
>> 2408 disk->vstart = cpu_to_le64(cpu->vstart);
>> 2409 disk->vend = cpu_to_le64(cpu->vend);
>> 2410 disk->target = cpu_to_le64(cpu->target);
>> 2411 disk->flags = cpu_to_le64(cpu->flags);
>> 2412 disk->limit = cpu_to_le64(cpu->limit);
>> 2413 disk->stripes_min = cpu_to_le32(cpu->stripes_min);
>> 2414 disk->stripes_max = cpu_to_le32(cpu->stripes_max);
>> 2415 }
>> 2416
>> 2417 /* struct btrfs_super_block */
>> 2418 BTRFS_SETGET_STACK_FUNCS(super_bytenr, struct btrfs_super_block, bytenr, 64);
>> 2419 BTRFS_SETGET_STACK_FUNCS(super_flags, struct btrfs_super_block, flags, 64);
>> 2420 BTRFS_SETGET_STACK_FUNCS(super_generation, struct btrfs_super_block,
>> 2421 generation, 64);
>> 2422 BTRFS_SETGET_STACK_FUNCS(super_root, struct btrfs_super_block, root, 64);
>> 2423 BTRFS_SETGET_STACK_FUNCS(super_sys_array_size,
>> 2424 struct btrfs_super_block, sys_chunk_array_size, 32);
>> 2425 BTRFS_SETGET_STACK_FUNCS(super_chunk_root_generation,
>> 2426 struct btrfs_super_block, chunk_root_generation, 64);
>> 2427 BTRFS_SETGET_STACK_FUNCS(super_root_level, struct btrfs_super_block,
>> 2428 root_level, 8);
>> 2429 BTRFS_SETGET_STACK_FUNCS(super_chunk_root, struct btrfs_super_block,
>> 2430 chunk_root, 64);
>> 2431 BTRFS_SETGET_STACK_FUNCS(super_chunk_root_level, struct btrfs_super_block,
>> 2432 chunk_root_level, 8);
>> 2433 BTRFS_SETGET_STACK_FUNCS(super_log_root, struct btrfs_super_block,
>> 2434 log_root, 64);
>> 2435 BTRFS_SETGET_STACK_FUNCS(super_log_root_transid, struct btrfs_super_block,
>> 2436 log_root_transid, 64);
>> 2437 BTRFS_SETGET_STACK_FUNCS(super_log_root_level, struct btrfs_super_block,
>> 2438 log_root_level, 8);
>> 2439 BTRFS_SETGET_STACK_FUNCS(super_total_bytes, struct btrfs_super_block,
>> 2440 total_bytes, 64);
>> 2441 BTRFS_SETGET_STACK_FUNCS(super_bytes_used, struct btrfs_super_block,
>> 2442 bytes_used, 64);
>> 2443 BTRFS_SETGET_STACK_FUNCS(super_sectorsize, struct btrfs_super_block,
>> 2444 sectorsize, 32);
>> 2445 BTRFS_SETGET_STACK_FUNCS(super_nodesize, struct btrfs_super_block,
>> 2446 nodesize, 32);
>> 2447 BTRFS_SETGET_STACK_FUNCS(super_stripesize, struct btrfs_super_block,
>> 2448 stripesize, 32);
>> 2449 BTRFS_SETGET_STACK_FUNCS(super_root_dir, struct btrfs_super_block,
>> 2450 root_dir_objectid, 64);
>> 2451 BTRFS_SETGET_STACK_FUNCS(super_num_devices, struct btrfs_super_block,
>> 2452 num_devices, 64);
>> 2453 BTRFS_SETGET_STACK_FUNCS(super_compat_flags, struct btrfs_super_block,
>> 2454 compat_flags, 64);
>> 2455 BTRFS_SETGET_STACK_FUNCS(super_compat_ro_flags, struct btrfs_super_block,
>> 2456 compat_ro_flags, 64);
>> 2457 BTRFS_SETGET_STACK_FUNCS(super_incompat_flags, struct btrfs_super_block,
>> 2458 incompat_flags, 64);
>> 2459 BTRFS_SETGET_STACK_FUNCS(super_csum_type, struct btrfs_super_block,
>> 2460 csum_type, 16);
>> 2461 BTRFS_SETGET_STACK_FUNCS(super_cache_generation, struct btrfs_super_block,
>> 2462 cache_generation, 64);
>> 2463 BTRFS_SETGET_STACK_FUNCS(super_magic, struct btrfs_super_block, magic, 64);
>> 2464 BTRFS_SETGET_STACK_FUNCS(super_uuid_tree_generation, struct btrfs_super_block,
>> 2465 uuid_tree_generation, 64);
>> 2466
>> 2467 int btrfs_super_csum_size(const struct btrfs_super_block *s);
>> 2468 const char *btrfs_super_csum_name(u16 csum_type);
>> 2469 const char *btrfs_super_csum_driver(u16 csum_type);
>> 2470 size_t __attribute_const__ btrfs_get_num_csums(void);
>> 2471
>> 2472
>> 2473 /*
>> 2474 * The leaf data grows from end-to-front in the node.
>> 2475 * this returns the address of the start of the last item,
>> 2476 * which is the stop of the leaf data stack
>> 2477 */
>> 2478 static inline unsigned int leaf_data_end(const struct extent_buffer *leaf)
>> 2479 {
>> 2480 u32 nr = btrfs_header_nritems(leaf);
>> 2481
>> 2482 if (nr == 0)
>> 2483 return BTRFS_LEAF_DATA_SIZE(leaf->fs_info);
>> 2484 return btrfs_item_offset(leaf, nr - 1);
>> 2485 }
>> 2486
>> 2487 /* struct btrfs_file_extent_item */
>> 2488 BTRFS_SETGET_STACK_FUNCS(stack_file_extent_type, struct btrfs_file_extent_item,
>> 2489 type, 8);
>> 2490 BTRFS_SETGET_STACK_FUNCS(stack_file_extent_disk_bytenr,
>> 2491 struct btrfs_file_extent_item, disk_bytenr, 64);
>> 2492 BTRFS_SETGET_STACK_FUNCS(stack_file_extent_offset,
>> 2493 struct btrfs_file_extent_item, offset, 64);
>> 2494 BTRFS_SETGET_STACK_FUNCS(stack_file_extent_generation,
>> 2495 struct btrfs_file_extent_item, generation, 64);
>> 2496 BTRFS_SETGET_STACK_FUNCS(stack_file_extent_num_bytes,
>> 2497 struct btrfs_file_extent_item, num_bytes, 64);
>> 2498 BTRFS_SETGET_STACK_FUNCS(stack_file_extent_ram_bytes,
>> 2499 struct btrfs_file_extent_item, ram_bytes, 64);
>> 2500 BTRFS_SETGET_STACK_FUNCS(stack_file_extent_disk_num_bytes,
>> 2501 struct btrfs_file_extent_item, disk_num_bytes, 64);
>> 2502 BTRFS_SETGET_STACK_FUNCS(stack_file_extent_compression,
>> 2503 struct btrfs_file_extent_item, compression, 8);
>> 2504
>> 2505 static inline unsigned long
>> 2506 btrfs_file_extent_inline_start(const struct btrfs_file_extent_item *e)
>> 2507 {
>> 2508 return (unsigned long)e + BTRFS_FILE_EXTENT_INLINE_DATA_START;
>> 2509 }
>> 2510
>> 2511 static inline u32 btrfs_file_extent_calc_inline_size(u32 datasize)
>> 2512 {
>> 2513 return BTRFS_FILE_EXTENT_INLINE_DATA_START + datasize;
>> 2514 }
>> 2515
>> 2516 BTRFS_SETGET_FUNCS(file_extent_type, struct btrfs_file_extent_item, type, 8);
>> 2517 BTRFS_SETGET_FUNCS(file_extent_disk_bytenr, struct btrfs_file_extent_item,
>> 2518 disk_bytenr, 64);
>> 2519 BTRFS_SETGET_FUNCS(file_extent_generation, struct btrfs_file_extent_item,
>> 2520 generation, 64);
>> 2521 BTRFS_SETGET_FUNCS(file_extent_disk_num_bytes, struct btrfs_file_extent_item,
>> 2522 disk_num_bytes, 64);
>> 2523 BTRFS_SETGET_FUNCS(file_extent_offset, struct btrfs_file_extent_item,
>> 2524 offset, 64);
>> 2525 BTRFS_SETGET_FUNCS(file_extent_num_bytes, struct btrfs_file_extent_item,
>> 2526 num_bytes, 64);
>> 2527 BTRFS_SETGET_FUNCS(file_extent_ram_bytes, struct btrfs_file_extent_item,
>> 2528 ram_bytes, 64);
>> 2529 BTRFS_SETGET_FUNCS(file_extent_compression, struct btrfs_file_extent_item,
>> 2530 compression, 8);
>> 2531 BTRFS_SETGET_FUNCS(file_extent_encryption, struct btrfs_file_extent_item,
>> 2532 encryption, 8);
>> 2533 BTRFS_SETGET_FUNCS(file_extent_other_encoding, struct btrfs_file_extent_item,
>> 2534 other_encoding, 16);
>> 2535
>> 2536 /*
>> 2537 * this returns the number of bytes used by the item on disk, minus the
>> 2538 * size of any extent headers. If a file is compressed on disk, this is
>> 2539 * the compressed size
>> 2540 */
>> 2541 static inline u32 btrfs_file_extent_inline_item_len(
>> 2542 const struct extent_buffer *eb,
>> 2543 int nr)
>> 2544 {
>> 2545 return btrfs_item_size(eb, nr) - BTRFS_FILE_EXTENT_INLINE_DATA_START;
>> 2546 }
>> 2547
>> 2548 /* btrfs_qgroup_status_item */
>> 2549 BTRFS_SETGET_FUNCS(qgroup_status_generation, struct btrfs_qgroup_status_item,
>> 2550 generation, 64);
>> 2551 BTRFS_SETGET_FUNCS(qgroup_status_version, struct btrfs_qgroup_status_item,
>> 2552 version, 64);
>> 2553 BTRFS_SETGET_FUNCS(qgroup_status_flags, struct btrfs_qgroup_status_item,
>> 2554 flags, 64);
>> 2555 BTRFS_SETGET_FUNCS(qgroup_status_rescan, struct btrfs_qgroup_status_item,
>> 2556 rescan, 64);
>> 2557
>> 2558 /* btrfs_qgroup_info_item */
>> 2559 BTRFS_SETGET_FUNCS(qgroup_info_generation, struct btrfs_qgroup_info_item,
>> 2560 generation, 64);
>> 2561 BTRFS_SETGET_FUNCS(qgroup_info_rfer, struct btrfs_qgroup_info_item, rfer, 64);
>> 2562 BTRFS_SETGET_FUNCS(qgroup_info_rfer_cmpr, struct btrfs_qgroup_info_item,
>> 2563 rfer_cmpr, 64);
>> 2564 BTRFS_SETGET_FUNCS(qgroup_info_excl, struct btrfs_qgroup_info_item, excl, 64);
>> 2565 BTRFS_SETGET_FUNCS(qgroup_info_excl_cmpr, struct btrfs_qgroup_info_item,
>> 2566 excl_cmpr, 64);
>> 2567
>> 2568 BTRFS_SETGET_STACK_FUNCS(stack_qgroup_info_generation,
>> 2569 struct btrfs_qgroup_info_item, generation, 64);
>> 2570 BTRFS_SETGET_STACK_FUNCS(stack_qgroup_info_rfer, struct btrfs_qgroup_info_item,
>> 2571 rfer, 64);
>> 2572 BTRFS_SETGET_STACK_FUNCS(stack_qgroup_info_rfer_cmpr,
>> 2573 struct btrfs_qgroup_info_item, rfer_cmpr, 64);
>> 2574 BTRFS_SETGET_STACK_FUNCS(stack_qgroup_info_excl, struct btrfs_qgroup_info_item,
>> 2575 excl, 64);
>> 2576 BTRFS_SETGET_STACK_FUNCS(stack_qgroup_info_excl_cmpr,
>> 2577 struct btrfs_qgroup_info_item, excl_cmpr, 64);
>> 2578
>> 2579 /* btrfs_qgroup_limit_item */
>> 2580 BTRFS_SETGET_FUNCS(qgroup_limit_flags, struct btrfs_qgroup_limit_item,
>> 2581 flags, 64);
>> 2582 BTRFS_SETGET_FUNCS(qgroup_limit_max_rfer, struct btrfs_qgroup_limit_item,
>> 2583 max_rfer, 64);
>> 2584 BTRFS_SETGET_FUNCS(qgroup_limit_max_excl, struct btrfs_qgroup_limit_item,
>> 2585 max_excl, 64);
>> 2586 BTRFS_SETGET_FUNCS(qgroup_limit_rsv_rfer, struct btrfs_qgroup_limit_item,
>> 2587 rsv_rfer, 64);
>> 2588 BTRFS_SETGET_FUNCS(qgroup_limit_rsv_excl, struct btrfs_qgroup_limit_item,
>> 2589 rsv_excl, 64);
>> 2590
>> 2591 /* btrfs_dev_replace_item */
>> 2592 BTRFS_SETGET_FUNCS(dev_replace_src_devid,
>> 2593 struct btrfs_dev_replace_item, src_devid, 64);
>> 2594 BTRFS_SETGET_FUNCS(dev_replace_cont_reading_from_srcdev_mode,
>> 2595 struct btrfs_dev_replace_item, cont_reading_from_srcdev_mode,
>> 2596 64);
>> 2597 BTRFS_SETGET_FUNCS(dev_replace_replace_state, struct btrfs_dev_replace_item,
>> 2598 replace_state, 64);
>> 2599 BTRFS_SETGET_FUNCS(dev_replace_time_started, struct btrfs_dev_replace_item,
>> 2600 time_started, 64);
>> 2601 BTRFS_SETGET_FUNCS(dev_replace_time_stopped, struct btrfs_dev_replace_item,
>> 2602 time_stopped, 64);
>> 2603 BTRFS_SETGET_FUNCS(dev_replace_num_write_errors, struct btrfs_dev_replace_item,
>> 2604 num_write_errors, 64);
>> 2605 BTRFS_SETGET_FUNCS(dev_replace_num_uncorrectable_read_errors,
>> 2606 struct btrfs_dev_replace_item, num_uncorrectable_read_errors,
>> 2607 64);
>> 2608 BTRFS_SETGET_FUNCS(dev_replace_cursor_left, struct btrfs_dev_replace_item,
>> 2609 cursor_left, 64);
>> 2610 BTRFS_SETGET_FUNCS(dev_replace_cursor_right, struct btrfs_dev_replace_item,
>> 2611 cursor_right, 64);
>> 2612
>> 2613 BTRFS_SETGET_STACK_FUNCS(stack_dev_replace_src_devid,
>> 2614 struct btrfs_dev_replace_item, src_devid, 64);
>> 2615 BTRFS_SETGET_STACK_FUNCS(stack_dev_replace_cont_reading_from_srcdev_mode,
>> 2616 struct btrfs_dev_replace_item,
>> 2617 cont_reading_from_srcdev_mode, 64);
>> 2618 BTRFS_SETGET_STACK_FUNCS(stack_dev_replace_replace_state,
>> 2619 struct btrfs_dev_replace_item, replace_state, 64);
>> 2620 BTRFS_SETGET_STACK_FUNCS(stack_dev_replace_time_started,
>> 2621 struct btrfs_dev_replace_item, time_started, 64);
>> 2622 BTRFS_SETGET_STACK_FUNCS(stack_dev_replace_time_stopped,
>> 2623 struct btrfs_dev_replace_item, time_stopped, 64);
>> 2624 BTRFS_SETGET_STACK_FUNCS(stack_dev_replace_num_write_errors,
>> 2625 struct btrfs_dev_replace_item, num_write_errors, 64);
>> 2626 BTRFS_SETGET_STACK_FUNCS(stack_dev_replace_num_uncorrectable_read_errors,
>> 2627 struct btrfs_dev_replace_item,
>> 2628 num_uncorrectable_read_errors, 64);
>> 2629 BTRFS_SETGET_STACK_FUNCS(stack_dev_replace_cursor_left,
>> 2630 struct btrfs_dev_replace_item, cursor_left, 64);
>> 2631 BTRFS_SETGET_STACK_FUNCS(stack_dev_replace_cursor_right,
>> 2632 struct btrfs_dev_replace_item, cursor_right, 64);
>> 2633
>> 2634 /* helper function to cast into the data area of the leaf. */
>> 2635 #define btrfs_item_ptr(leaf, slot, type) \
>> 2636 ((type *)(BTRFS_LEAF_DATA_OFFSET + \
>> 2637 btrfs_item_offset(leaf, slot)))
>> 2638
>> 2639 #define btrfs_item_ptr_offset(leaf, slot) \
>> 2640 ((unsigned long)(BTRFS_LEAF_DATA_OFFSET + \
>> 2641 btrfs_item_offset(leaf, slot)))
>> 2642
>> 2643 static inline u32 btrfs_crc32c(u32 crc, const void *address, unsigned length)
>> 2644 {
>> 2645 return crc32c(crc, address, length);
>> 2646 }
>> 2647
>> 2648 static inline void btrfs_crc32c_final(u32 crc, u8 *result)
>> 2649 {
>> 2650 put_unaligned_le32(~crc, result);
>> 2651 }
>> 2652
>> 2653 static inline u64 btrfs_name_hash(const char *name, int len)
>> 2654 {
>> 2655 return crc32c((u32)~1, name, len);
>> 2656 }
>> 2657
>> 2658 /*
>> 2659 * Figure the key offset of an extended inode ref
>> 2660 */
>> 2661 static inline u64 btrfs_extref_hash(u64 parent_objectid, const char *name,
>> 2662 int len)
>> 2663 {
>> 2664 return (u64) crc32c(parent_objectid, name, len);
>> 2665 }
>> 2666
>> 2667 static inline gfp_t btrfs_alloc_write_mask(struct address_space *mapping)
>> 2668 {
>> 2669 return mapping_gfp_constraint(mapping, ~__GFP_FS);
>> 2670 }
>> 2671
>> 2672 /* extent-tree.c */
>> 2673
>> 2674 enum btrfs_inline_ref_type {
>> 2675 BTRFS_REF_TYPE_INVALID,
>> 2676 BTRFS_REF_TYPE_BLOCK,
>> 2677 BTRFS_REF_TYPE_DATA,
>> 2678 BTRFS_REF_TYPE_ANY,
>> 2679 };
>> 2680
>> 2681 int btrfs_get_extent_inline_ref_type(const struct extent_buffer *eb,
>> 2682 struct btrfs_extent_inline_ref *iref,
>> 2683 enum btrfs_inline_ref_type is_data);
>> 2684 u64 hash_extent_data_ref(u64 root_objectid, u64 owner, u64 offset);
>> 2685
>> 2686 /*
>> 2687 * Take the number of bytes to be checksummmed and figure out how many leaves
>> 2688 * it would require to store the csums for that many bytes.
>> 2689 */
>> 2690 static inline u64 btrfs_csum_bytes_to_leaves(
>> 2691 const struct btrfs_fs_info *fs_info, u64 csum_bytes)
>> 2692 {
>> 2693 const u64 num_csums = csum_bytes >> fs_info->sectorsize_bits;
>> 2694
>> 2695 return DIV_ROUND_UP_ULL(num_csums, fs_info->csums_per_leaf);
>> 2696 }
>> 2697
>> 2698 /*
>> 2699 * Use this if we would be adding new items, as we could split nodes as we cow
>> 2700 * down the tree.
>> 2701 */
>> 2702 static inline u64 btrfs_calc_insert_metadata_size(struct btrfs_fs_info *fs_info,
>> 2703 unsigned num_items)
>> 2704 {
>> 2705 return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * 2 * num_items;
>> 2706 }
>> 2707
>> 2708 /*
>> 2709 * Doing a truncate or a modification won't result in new nodes or leaves, just
>> 2710 * what we need for COW.
>> 2711 */
>> 2712 static inline u64 btrfs_calc_metadata_size(struct btrfs_fs_info *fs_info,
>> 2713 unsigned num_items)
>> 2714 {
>> 2715 return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * num_items;
>> 2716 }
>> 2717
>> 2718 int btrfs_add_excluded_extent(struct btrfs_fs_info *fs_info,
>> 2719 u64 start, u64 num_bytes);
>> 2720 void btrfs_free_excluded_extents(struct btrfs_block_group *cache);
>> 2721 int btrfs_run_delayed_refs(struct btrfs_trans_handle *trans,
>> 2722 unsigned long count);
>> 2723 void btrfs_cleanup_ref_head_accounting(struct btrfs_fs_info *fs_info,
>> 2724 struct btrfs_delayed_ref_root *delayed_refs,
>> 2725 struct btrfs_delayed_ref_head *head);
>> 2726 int btrfs_lookup_data_extent(struct btrfs_fs_info *fs_info, u64 start, u64 len);
>> 2727 int btrfs_lookup_extent_info(struct btrfs_trans_handle *trans,
>> 2728 struct btrfs_fs_info *fs_info, u64 bytenr,
>> 2729 u64 offset, int metadata, u64 *refs, u64 *flags);
>> 2730 int btrfs_pin_extent(struct btrfs_trans_handle *trans, u64 bytenr, u64 num,
>> 2731 int reserved);
>> 2732 int btrfs_pin_extent_for_log_replay(struct btrfs_trans_handle *trans,
>> 2733 u64 bytenr, u64 num_bytes);
>> 2734 int btrfs_exclude_logged_extents(struct extent_buffer *eb);
>> 2735 int btrfs_cross_ref_exist(struct btrfs_root *root,
>> 2736 u64 objectid, u64 offset, u64 bytenr, bool strict);
>> 2737 struct extent_buffer *btrfs_alloc_tree_block(struct btrfs_trans_handle *trans,
>> 2738 struct btrfs_root *root,
>> 2739 u64 parent, u64 root_objectid,
>> 2740 const struct btrfs_disk_key *key,
>> 2741 int level, u64 hint,
>> 2742 u64 empty_size,
>> 2743 enum btrfs_lock_nesting nest);
>> 2744 void btrfs_free_tree_block(struct btrfs_trans_handle *trans,
>> 2745 u64 root_id,
>> 2746 struct extent_buffer *buf,
>> 2747 u64 parent, int last_ref);
>> 2748 int btrfs_alloc_reserved_file_extent(struct btrfs_trans_handle *trans,
>> 2749 struct btrfs_root *root, u64 owner,
>> 2750 u64 offset, u64 ram_bytes,
>> 2751 struct btrfs_key *ins);
>> 2752 int btrfs_alloc_logged_file_extent(struct btrfs_trans_handle *trans,
>> 2753 u64 root_objectid, u64 owner, u64 offset,
>> 2754 struct btrfs_key *ins);
>> 2755 int btrfs_reserve_extent(struct btrfs_root *root, u64 ram_bytes, u64 num_bytes,
>> 2756 u64 min_alloc_size, u64 empty_size, u64 hint_byte,
>> 2757 struct btrfs_key *ins, int is_data, int delalloc);
>> 2758 int btrfs_inc_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root,
>> 2759 struct extent_buffer *buf, int full_backref);
>> 2760 int btrfs_dec_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root,
>> 2761 struct extent_buffer *buf, int full_backref);
>> 2762 int btrfs_set_disk_extent_flags(struct btrfs_trans_handle *trans,
>> 2763 struct extent_buffer *eb, u64 flags,
>> 2764 int level, int is_data);
>> 2765 int btrfs_free_extent(struct btrfs_trans_handle *trans, struct btrfs_ref *ref);
>> 2766
>> 2767 int btrfs_free_reserved_extent(struct btrfs_fs_info *fs_info,
>> 2768 u64 start, u64 len, int delalloc);
>> 2769 int btrfs_pin_reserved_extent(struct btrfs_trans_handle *trans, u64 start,
>> 2770 u64 len);
>> 2771 int btrfs_finish_extent_commit(struct btrfs_trans_handle *trans);
>> 2772 int btrfs_inc_extent_ref(struct btrfs_trans_handle *trans,
>> 2773 struct btrfs_ref *generic_ref);
>> 2774
>> 2775 void btrfs_clear_space_info_full(struct btrfs_fs_info *info);
>> 2776
>> 2777 /*
>> 2778 * Different levels for to flush space when doing space reservations.
>> 2779 *
>> 2780 * The higher the level, the more methods we try to reclaim space.
>> 2781 */
>> 2782 enum btrfs_reserve_flush_enum {
>> 2783 /* If we are in the transaction, we can't flush anything.*/
>> 2784 BTRFS_RESERVE_NO_FLUSH,
>> 2785
>> 2786 /*
>> 2787 * Flush space by:
>> 2788 * - Running delayed inode items
>> 2789 * - Allocating a new chunk
>> 2790 */
>> 2791 BTRFS_RESERVE_FLUSH_LIMIT,
>> 2792
>> 2793 /*
>> 2794 * Flush space by:
>> 2795 * - Running delayed inode items
>> 2796 * - Running delayed refs
>> 2797 * - Running delalloc and waiting for ordered extents
>> 2798 * - Allocating a new chunk
>> 2799 */
>> 2800 BTRFS_RESERVE_FLUSH_EVICT,
>> 2801
>> 2802 /*
>> 2803 * Flush space by above mentioned methods and by:
>> 2804 * - Running delayed iputs
>> 2805 * - Committing transaction
>> 2806 *
>> 2807 * Can be interrupted by a fatal signal.
>> 2808 */
>> 2809 BTRFS_RESERVE_FLUSH_DATA,
>> 2810 BTRFS_RESERVE_FLUSH_FREE_SPACE_INODE,
>> 2811 BTRFS_RESERVE_FLUSH_ALL,
>> 2812
>> 2813 /*
>> 2814 * Pretty much the same as FLUSH_ALL, but can also steal space from
>> 2815 * global rsv.
>> 2816 *
>> 2817 * Can be interrupted by a fatal signal.
>> 2818 */
>> 2819 BTRFS_RESERVE_FLUSH_ALL_STEAL,
>> 2820 };
>> 2821
>> 2822 enum btrfs_flush_state {
>> 2823 FLUSH_DELAYED_ITEMS_NR = 1,
>> 2824 FLUSH_DELAYED_ITEMS = 2,
>> 2825 FLUSH_DELAYED_REFS_NR = 3,
>> 2826 FLUSH_DELAYED_REFS = 4,
>> 2827 FLUSH_DELALLOC = 5,
>> 2828 FLUSH_DELALLOC_WAIT = 6,
>> 2829 FLUSH_DELALLOC_FULL = 7,
>> 2830 ALLOC_CHUNK = 8,
>> 2831 ALLOC_CHUNK_FORCE = 9,
>> 2832 RUN_DELAYED_IPUTS = 10,
>> 2833 COMMIT_TRANS = 11,
>> 2834 };
>> 2835
>> 2836 int btrfs_subvolume_reserve_metadata(struct btrfs_root *root,
>> 2837 struct btrfs_block_rsv *rsv,
>> 2838 int nitems, bool use_global_rsv);
>> 2839 void btrfs_subvolume_release_metadata(struct btrfs_root *root,
>> 2840 struct btrfs_block_rsv *rsv);
>> 2841 void btrfs_delalloc_release_extents(struct btrfs_inode *inode, u64 num_bytes);
>> 2842
>> 2843 int btrfs_delalloc_reserve_metadata(struct btrfs_inode *inode, u64 num_bytes);
>> 2844 u64 btrfs_account_ro_block_groups_free_space(struct btrfs_space_info *sinfo);
>> 2845 int btrfs_error_unpin_extent_range(struct btrfs_fs_info *fs_info,
>> 2846 u64 start, u64 end);
>> 2847 int btrfs_discard_extent(struct btrfs_fs_info *fs_info, u64 bytenr,
>> 2848 u64 num_bytes, u64 *actual_bytes);
>> 2849 int btrfs_trim_fs(struct btrfs_fs_info *fs_info, struct fstrim_range *range);
>> 2850
>> 2851 int btrfs_init_space_info(struct btrfs_fs_info *fs_info);
>> 2852 int btrfs_delayed_refs_qgroup_accounting(struct btrfs_trans_handle *trans,
>> 2853 struct btrfs_fs_info *fs_info);
>> 2854 int btrfs_start_write_no_snapshotting(struct btrfs_root *root);
>> 2855 void btrfs_end_write_no_snapshotting(struct btrfs_root *root);
>> 2856 void btrfs_wait_for_snapshot_creation(struct btrfs_root *root);
>> 2857
>> 2858 /* ctree.c */
>> 2859 int btrfs_bin_search(struct extent_buffer *eb, const struct btrfs_key *key,
>> 2860 int *slot);
>> 2861 int __pure btrfs_comp_cpu_keys(const struct btrfs_key *k1, const struct btrfs_key *k2);
541 int btrfs_previous_item(struct btrfs_root *roo 2862 int btrfs_previous_item(struct btrfs_root *root,
542 struct btrfs_path *pat 2863 struct btrfs_path *path, u64 min_objectid,
543 int type); 2864 int type);
544 int btrfs_previous_extent_item(struct btrfs_ro 2865 int btrfs_previous_extent_item(struct btrfs_root *root,
545 struct btrfs_path *pat 2866 struct btrfs_path *path, u64 min_objectid);
546 void btrfs_set_item_key_safe(struct btrfs_tran !! 2867 void btrfs_set_item_key_safe(struct btrfs_fs_info *fs_info,
547 const struct btrf !! 2868 struct btrfs_path *path,
548 const struct btrf 2869 const struct btrfs_key *new_key);
549 struct extent_buffer *btrfs_root_node(struct b 2870 struct extent_buffer *btrfs_root_node(struct btrfs_root *root);
550 int btrfs_find_next_key(struct btrfs_root *roo 2871 int btrfs_find_next_key(struct btrfs_root *root, struct btrfs_path *path,
551 struct btrfs_key *key, 2872 struct btrfs_key *key, int lowest_level,
552 u64 min_trans); 2873 u64 min_trans);
553 int btrfs_search_forward(struct btrfs_root *ro 2874 int btrfs_search_forward(struct btrfs_root *root, struct btrfs_key *min_key,
554 struct btrfs_path *pa 2875 struct btrfs_path *path,
555 u64 min_trans); 2876 u64 min_trans);
556 struct extent_buffer *btrfs_read_node_slot(str 2877 struct extent_buffer *btrfs_read_node_slot(struct extent_buffer *parent,
557 int 2878 int slot);
558 2879
559 int btrfs_cow_block(struct btrfs_trans_handle 2880 int btrfs_cow_block(struct btrfs_trans_handle *trans,
560 struct btrfs_root *root, s 2881 struct btrfs_root *root, struct extent_buffer *buf,
561 struct extent_buffer *pare 2882 struct extent_buffer *parent, int parent_slot,
562 struct extent_buffer **cow 2883 struct extent_buffer **cow_ret,
563 enum btrfs_lock_nesting ne 2884 enum btrfs_lock_nesting nest);
564 int btrfs_force_cow_block(struct btrfs_trans_h <<
565 struct btrfs_root *r <<
566 struct extent_buffer <<
567 struct extent_buffer <<
568 struct extent_buffer <<
569 u64 search_start, u6 <<
570 enum btrfs_lock_nest <<
571 int btrfs_copy_root(struct btrfs_trans_handle 2885 int btrfs_copy_root(struct btrfs_trans_handle *trans,
572 struct btrfs_root *root, 2886 struct btrfs_root *root,
573 struct extent_buffer *bu 2887 struct extent_buffer *buf,
574 struct extent_buffer **c 2888 struct extent_buffer **cow_ret, u64 new_root_objectid);
575 bool btrfs_block_can_be_shared(struct btrfs_tr !! 2889 int btrfs_block_can_be_shared(struct btrfs_root *root,
576 struct btrfs_ro !! 2890 struct extent_buffer *buf);
577 struct extent_b !! 2891 void btrfs_extend_item(struct btrfs_path *path, u32 data_size);
578 int btrfs_del_ptr(struct btrfs_trans_handle *t !! 2892 void btrfs_truncate_item(struct btrfs_path *path, u32 new_size, int from_end);
579 struct btrfs_path *path, int <<
580 void btrfs_extend_item(struct btrfs_trans_hand <<
581 const struct btrfs_path <<
582 void btrfs_truncate_item(struct btrfs_trans_ha <<
583 const struct btrfs_pa <<
584 int btrfs_split_item(struct btrfs_trans_handle 2893 int btrfs_split_item(struct btrfs_trans_handle *trans,
585 struct btrfs_root *root, 2894 struct btrfs_root *root,
586 struct btrfs_path *path, 2895 struct btrfs_path *path,
587 const struct btrfs_key *n 2896 const struct btrfs_key *new_key,
588 unsigned long split_offse 2897 unsigned long split_offset);
589 int btrfs_duplicate_item(struct btrfs_trans_ha 2898 int btrfs_duplicate_item(struct btrfs_trans_handle *trans,
590 struct btrfs_root *ro 2899 struct btrfs_root *root,
591 struct btrfs_path *pa 2900 struct btrfs_path *path,
592 const struct btrfs_ke 2901 const struct btrfs_key *new_key);
593 int btrfs_find_item(struct btrfs_root *fs_root 2902 int btrfs_find_item(struct btrfs_root *fs_root, struct btrfs_path *path,
594 u64 inum, u64 ioff, u8 key_typ 2903 u64 inum, u64 ioff, u8 key_type, struct btrfs_key *found_key);
595 int btrfs_search_slot(struct btrfs_trans_handl 2904 int btrfs_search_slot(struct btrfs_trans_handle *trans, struct btrfs_root *root,
596 const struct btrfs_key * 2905 const struct btrfs_key *key, struct btrfs_path *p,
597 int ins_len, int cow); 2906 int ins_len, int cow);
598 int btrfs_search_old_slot(struct btrfs_root *r 2907 int btrfs_search_old_slot(struct btrfs_root *root, const struct btrfs_key *key,
599 struct btrfs_path *p 2908 struct btrfs_path *p, u64 time_seq);
600 int btrfs_search_slot_for_read(struct btrfs_ro 2909 int btrfs_search_slot_for_read(struct btrfs_root *root,
601 const struct bt 2910 const struct btrfs_key *key,
602 struct btrfs_pa 2911 struct btrfs_path *p, int find_higher,
603 int return_any) 2912 int return_any);
>> 2913 int btrfs_realloc_node(struct btrfs_trans_handle *trans,
>> 2914 struct btrfs_root *root, struct extent_buffer *parent,
>> 2915 int start_slot, u64 *last_ret,
>> 2916 struct btrfs_key *progress);
604 void btrfs_release_path(struct btrfs_path *p); 2917 void btrfs_release_path(struct btrfs_path *p);
605 struct btrfs_path *btrfs_alloc_path(void); 2918 struct btrfs_path *btrfs_alloc_path(void);
606 void btrfs_free_path(struct btrfs_path *p); 2919 void btrfs_free_path(struct btrfs_path *p);
607 DEFINE_FREE(btrfs_free_path, struct btrfs_path <<
608 2920
609 int btrfs_del_items(struct btrfs_trans_handle 2921 int btrfs_del_items(struct btrfs_trans_handle *trans, struct btrfs_root *root,
610 struct btrfs_path *path, in 2922 struct btrfs_path *path, int slot, int nr);
611 static inline int btrfs_del_item(struct btrfs_ 2923 static inline int btrfs_del_item(struct btrfs_trans_handle *trans,
612 struct btrfs_ 2924 struct btrfs_root *root,
613 struct btrfs_ 2925 struct btrfs_path *path)
614 { 2926 {
615 return btrfs_del_items(trans, root, pa 2927 return btrfs_del_items(trans, root, path, path->slots[0], 1);
616 } 2928 }
617 2929
618 /* 2930 /*
619 * Describes a batch of items to insert in a b 2931 * Describes a batch of items to insert in a btree. This is used by
620 * btrfs_insert_empty_items(). 2932 * btrfs_insert_empty_items().
621 */ 2933 */
622 struct btrfs_item_batch { 2934 struct btrfs_item_batch {
623 /* 2935 /*
624 * Pointer to an array containing the 2936 * Pointer to an array containing the keys of the items to insert (in
625 * sorted order). 2937 * sorted order).
626 */ 2938 */
627 const struct btrfs_key *keys; 2939 const struct btrfs_key *keys;
628 /* Pointer to an array containing the 2940 /* Pointer to an array containing the data size for each item to insert. */
629 const u32 *data_sizes; 2941 const u32 *data_sizes;
630 /* 2942 /*
631 * The sum of data sizes for all items 2943 * The sum of data sizes for all items. The caller can compute this while
632 * setting up the data_sizes array, so 2944 * setting up the data_sizes array, so it ends up being more efficient
633 * than having btrfs_insert_empty_item 2945 * than having btrfs_insert_empty_items() or setup_item_for_insert()
634 * doing it, as it would avoid an extr 2946 * doing it, as it would avoid an extra loop over a potentially large
635 * array, and in the case of setup_ite 2947 * array, and in the case of setup_item_for_insert(), we would be doing
636 * it while holding a write lock on a 2948 * it while holding a write lock on a leaf and often on upper level nodes
637 * too, unnecessarily increasing the s 2949 * too, unnecessarily increasing the size of a critical section.
638 */ 2950 */
639 u32 total_data_size; 2951 u32 total_data_size;
640 /* Size of the keys and data_sizes arr 2952 /* Size of the keys and data_sizes arrays (number of items in the batch). */
641 int nr; 2953 int nr;
642 }; 2954 };
643 2955
644 void btrfs_setup_item_for_insert(struct btrfs_ !! 2956 void btrfs_setup_item_for_insert(struct btrfs_root *root,
645 struct btrfs_ <<
646 struct btrfs_ 2957 struct btrfs_path *path,
647 const struct 2958 const struct btrfs_key *key,
648 u32 data_size 2959 u32 data_size);
649 int btrfs_insert_item(struct btrfs_trans_handl 2960 int btrfs_insert_item(struct btrfs_trans_handle *trans, struct btrfs_root *root,
650 const struct btrfs_key * 2961 const struct btrfs_key *key, void *data, u32 data_size);
651 int btrfs_insert_empty_items(struct btrfs_tran 2962 int btrfs_insert_empty_items(struct btrfs_trans_handle *trans,
652 struct btrfs_root 2963 struct btrfs_root *root,
653 struct btrfs_path 2964 struct btrfs_path *path,
654 const struct btrf 2965 const struct btrfs_item_batch *batch);
655 2966
656 static inline int btrfs_insert_empty_item(stru 2967 static inline int btrfs_insert_empty_item(struct btrfs_trans_handle *trans,
657 stru 2968 struct btrfs_root *root,
658 stru 2969 struct btrfs_path *path,
659 cons 2970 const struct btrfs_key *key,
660 u32 2971 u32 data_size)
661 { 2972 {
662 struct btrfs_item_batch batch; 2973 struct btrfs_item_batch batch;
663 2974
664 batch.keys = key; 2975 batch.keys = key;
665 batch.data_sizes = &data_size; 2976 batch.data_sizes = &data_size;
666 batch.total_data_size = data_size; 2977 batch.total_data_size = data_size;
667 batch.nr = 1; 2978 batch.nr = 1;
668 2979
669 return btrfs_insert_empty_items(trans, 2980 return btrfs_insert_empty_items(trans, root, path, &batch);
670 } 2981 }
671 2982
>> 2983 int btrfs_prev_leaf(struct btrfs_root *root, struct btrfs_path *path);
672 int btrfs_next_old_leaf(struct btrfs_root *roo 2984 int btrfs_next_old_leaf(struct btrfs_root *root, struct btrfs_path *path,
673 u64 time_seq); 2985 u64 time_seq);
674 2986
675 int btrfs_search_backwards(struct btrfs_root * 2987 int btrfs_search_backwards(struct btrfs_root *root, struct btrfs_key *key,
676 struct btrfs_path * 2988 struct btrfs_path *path);
677 2989
678 int btrfs_get_next_valid_item(struct btrfs_roo !! 2990 static inline int btrfs_next_old_item(struct btrfs_root *root,
679 struct btrfs_pat !! 2991 struct btrfs_path *p, u64 time_seq)
680 !! 2992 {
681 /* !! 2993 ++p->slots[0];
682 * Search in @root for a given @key, and store !! 2994 if (p->slots[0] >= btrfs_header_nritems(p->nodes[0]))
683 * !! 2995 return btrfs_next_old_leaf(root, p, time_seq);
684 * @root: The root node of the tree. !! 2996 return 0;
685 * @key: The key we are looking for. !! 2997 }
686 * @found_key: Will hold the found item. <<
687 * @path: Holds the current slot/leaf. <<
688 * @iter_ret: Contains the value returned fr <<
689 * btrfs_get_next_valid_item, whi <<
690 * <<
691 * The @iter_ret is an output variable that wi <<
692 * btrfs_search_slot, if it encountered an err <<
693 * btrfs_get_next_valid_item otherwise. That r <<
694 * slot was found, 1 if there were no more lea <<
695 * <<
696 * It's recommended to use a separate variable <<
697 * set the function return value so there's no <<
698 * values stemming from btrfs_search_slot. <<
699 */ <<
700 #define btrfs_for_each_slot(root, key, found_k <<
701 for (iter_ret = btrfs_search_slot(NULL <<
702 (iter_ret) >= 0 && <<
703 (iter_ret = btrfs_get_next_val <<
704 (path)->slots[0]++ <<
705 ) <<
706 <<
707 int btrfs_next_old_item(struct btrfs_root *roo <<
708 2998
709 /* 2999 /*
710 * Search the tree again to find a leaf with g 3000 * Search the tree again to find a leaf with greater keys.
711 * 3001 *
712 * Returns 0 if it found something or 1 if the 3002 * Returns 0 if it found something or 1 if there are no greater leaves.
713 * Returns < 0 on error. 3003 * Returns < 0 on error.
714 */ 3004 */
715 static inline int btrfs_next_leaf(struct btrfs 3005 static inline int btrfs_next_leaf(struct btrfs_root *root, struct btrfs_path *path)
716 { 3006 {
717 return btrfs_next_old_leaf(root, path, 3007 return btrfs_next_old_leaf(root, path, 0);
718 } 3008 }
719 3009
720 static inline int btrfs_next_item(struct btrfs 3010 static inline int btrfs_next_item(struct btrfs_root *root, struct btrfs_path *p)
721 { 3011 {
722 return btrfs_next_old_item(root, p, 0) 3012 return btrfs_next_old_item(root, p, 0);
723 } 3013 }
724 int btrfs_leaf_free_space(const struct extent_ !! 3014 int btrfs_leaf_free_space(struct extent_buffer *leaf);
>> 3015 int __must_check btrfs_drop_snapshot(struct btrfs_root *root, int update_ref,
>> 3016 int for_reloc);
>> 3017 int btrfs_drop_subtree(struct btrfs_trans_handle *trans,
>> 3018 struct btrfs_root *root,
>> 3019 struct extent_buffer *node,
>> 3020 struct extent_buffer *parent);
>> 3021 static inline int btrfs_fs_closing(struct btrfs_fs_info *fs_info)
>> 3022 {
>> 3023 /*
>> 3024 * Do it this way so we only ever do one test_bit in the normal case.
>> 3025 */
>> 3026 if (test_bit(BTRFS_FS_CLOSING_START, &fs_info->flags)) {
>> 3027 if (test_bit(BTRFS_FS_CLOSING_DONE, &fs_info->flags))
>> 3028 return 2;
>> 3029 return 1;
>> 3030 }
>> 3031 return 0;
>> 3032 }
>> 3033
>> 3034 /*
>> 3035 * If we remount the fs to be R/O or umount the fs, the cleaner needn't do
>> 3036 * anything except sleeping. This function is used to check the status of
>> 3037 * the fs.
>> 3038 * We check for BTRFS_FS_STATE_RO to avoid races with a concurrent remount,
>> 3039 * since setting and checking for SB_RDONLY in the superblock's flags is not
>> 3040 * atomic.
>> 3041 */
>> 3042 static inline int btrfs_need_cleaner_sleep(struct btrfs_fs_info *fs_info)
>> 3043 {
>> 3044 return test_bit(BTRFS_FS_STATE_RO, &fs_info->fs_state) ||
>> 3045 btrfs_fs_closing(fs_info);
>> 3046 }
>> 3047
>> 3048 static inline void btrfs_set_sb_rdonly(struct super_block *sb)
>> 3049 {
>> 3050 sb->s_flags |= SB_RDONLY;
>> 3051 set_bit(BTRFS_FS_STATE_RO, &btrfs_sb(sb)->fs_state);
>> 3052 }
>> 3053
>> 3054 static inline void btrfs_clear_sb_rdonly(struct super_block *sb)
>> 3055 {
>> 3056 sb->s_flags &= ~SB_RDONLY;
>> 3057 clear_bit(BTRFS_FS_STATE_RO, &btrfs_sb(sb)->fs_state);
>> 3058 }
>> 3059
>> 3060 /* root-item.c */
>> 3061 int btrfs_add_root_ref(struct btrfs_trans_handle *trans, u64 root_id,
>> 3062 u64 ref_id, u64 dirid, u64 sequence, const char *name,
>> 3063 int name_len);
>> 3064 int btrfs_del_root_ref(struct btrfs_trans_handle *trans, u64 root_id,
>> 3065 u64 ref_id, u64 dirid, u64 *sequence, const char *name,
>> 3066 int name_len);
>> 3067 int btrfs_del_root(struct btrfs_trans_handle *trans,
>> 3068 const struct btrfs_key *key);
>> 3069 int btrfs_insert_root(struct btrfs_trans_handle *trans, struct btrfs_root *root,
>> 3070 const struct btrfs_key *key,
>> 3071 struct btrfs_root_item *item);
>> 3072 int __must_check btrfs_update_root(struct btrfs_trans_handle *trans,
>> 3073 struct btrfs_root *root,
>> 3074 struct btrfs_key *key,
>> 3075 struct btrfs_root_item *item);
>> 3076 int btrfs_find_root(struct btrfs_root *root, const struct btrfs_key *search_key,
>> 3077 struct btrfs_path *path, struct btrfs_root_item *root_item,
>> 3078 struct btrfs_key *root_key);
>> 3079 int btrfs_find_orphan_roots(struct btrfs_fs_info *fs_info);
>> 3080 void btrfs_set_root_node(struct btrfs_root_item *item,
>> 3081 struct extent_buffer *node);
>> 3082 void btrfs_check_and_init_root_item(struct btrfs_root_item *item);
>> 3083 void btrfs_update_root_times(struct btrfs_trans_handle *trans,
>> 3084 struct btrfs_root *root);
>> 3085
>> 3086 /* uuid-tree.c */
>> 3087 int btrfs_uuid_tree_add(struct btrfs_trans_handle *trans, u8 *uuid, u8 type,
>> 3088 u64 subid);
>> 3089 int btrfs_uuid_tree_remove(struct btrfs_trans_handle *trans, u8 *uuid, u8 type,
>> 3090 u64 subid);
>> 3091 int btrfs_uuid_tree_iterate(struct btrfs_fs_info *fs_info);
>> 3092
>> 3093 /* dir-item.c */
>> 3094 int btrfs_check_dir_item_collision(struct btrfs_root *root, u64 dir,
>> 3095 const char *name, int name_len);
>> 3096 int btrfs_insert_dir_item(struct btrfs_trans_handle *trans, const char *name,
>> 3097 int name_len, struct btrfs_inode *dir,
>> 3098 struct btrfs_key *location, u8 type, u64 index);
>> 3099 struct btrfs_dir_item *btrfs_lookup_dir_item(struct btrfs_trans_handle *trans,
>> 3100 struct btrfs_root *root,
>> 3101 struct btrfs_path *path, u64 dir,
>> 3102 const char *name, int name_len,
>> 3103 int mod);
>> 3104 struct btrfs_dir_item *
>> 3105 btrfs_lookup_dir_index_item(struct btrfs_trans_handle *trans,
>> 3106 struct btrfs_root *root,
>> 3107 struct btrfs_path *path, u64 dir,
>> 3108 u64 index, const char *name, int name_len,
>> 3109 int mod);
>> 3110 struct btrfs_dir_item *
>> 3111 btrfs_search_dir_index_item(struct btrfs_root *root,
>> 3112 struct btrfs_path *path, u64 dirid,
>> 3113 const char *name, int name_len);
>> 3114 int btrfs_delete_one_dir_name(struct btrfs_trans_handle *trans,
>> 3115 struct btrfs_root *root,
>> 3116 struct btrfs_path *path,
>> 3117 struct btrfs_dir_item *di);
>> 3118 int btrfs_insert_xattr_item(struct btrfs_trans_handle *trans,
>> 3119 struct btrfs_root *root,
>> 3120 struct btrfs_path *path, u64 objectid,
>> 3121 const char *name, u16 name_len,
>> 3122 const void *data, u16 data_len);
>> 3123 struct btrfs_dir_item *btrfs_lookup_xattr(struct btrfs_trans_handle *trans,
>> 3124 struct btrfs_root *root,
>> 3125 struct btrfs_path *path, u64 dir,
>> 3126 const char *name, u16 name_len,
>> 3127 int mod);
>> 3128 struct btrfs_dir_item *btrfs_match_dir_item_name(struct btrfs_fs_info *fs_info,
>> 3129 struct btrfs_path *path,
>> 3130 const char *name,
>> 3131 int name_len);
>> 3132
>> 3133 /* orphan.c */
>> 3134 int btrfs_insert_orphan_item(struct btrfs_trans_handle *trans,
>> 3135 struct btrfs_root *root, u64 offset);
>> 3136 int btrfs_del_orphan_item(struct btrfs_trans_handle *trans,
>> 3137 struct btrfs_root *root, u64 offset);
>> 3138 int btrfs_find_orphan_item(struct btrfs_root *root, u64 offset);
>> 3139
>> 3140 /* file-item.c */
>> 3141 struct btrfs_dio_private;
>> 3142 int btrfs_del_csums(struct btrfs_trans_handle *trans,
>> 3143 struct btrfs_root *root, u64 bytenr, u64 len);
>> 3144 blk_status_t btrfs_lookup_bio_sums(struct inode *inode, struct bio *bio, u8 *dst);
>> 3145 int btrfs_insert_file_extent(struct btrfs_trans_handle *trans,
>> 3146 struct btrfs_root *root,
>> 3147 u64 objectid, u64 pos,
>> 3148 u64 disk_offset, u64 disk_num_bytes,
>> 3149 u64 num_bytes, u64 offset, u64 ram_bytes,
>> 3150 u8 compression, u8 encryption, u16 other_encoding);
>> 3151 int btrfs_lookup_file_extent(struct btrfs_trans_handle *trans,
>> 3152 struct btrfs_root *root,
>> 3153 struct btrfs_path *path, u64 objectid,
>> 3154 u64 bytenr, int mod);
>> 3155 int btrfs_csum_file_blocks(struct btrfs_trans_handle *trans,
>> 3156 struct btrfs_root *root,
>> 3157 struct btrfs_ordered_sum *sums);
>> 3158 blk_status_t btrfs_csum_one_bio(struct btrfs_inode *inode, struct bio *bio,
>> 3159 u64 file_start, int contig);
>> 3160 int btrfs_lookup_csums_range(struct btrfs_root *root, u64 start, u64 end,
>> 3161 struct list_head *list, int search_commit);
>> 3162 void btrfs_extent_item_to_extent_map(struct btrfs_inode *inode,
>> 3163 const struct btrfs_path *path,
>> 3164 struct btrfs_file_extent_item *fi,
>> 3165 const bool new_inline,
>> 3166 struct extent_map *em);
>> 3167 int btrfs_inode_clear_file_extent_range(struct btrfs_inode *inode, u64 start,
>> 3168 u64 len);
>> 3169 int btrfs_inode_set_file_extent_range(struct btrfs_inode *inode, u64 start,
>> 3170 u64 len);
>> 3171 void btrfs_inode_safe_disk_i_size_write(struct btrfs_inode *inode, u64 new_i_size);
>> 3172 u64 btrfs_file_extent_end(const struct btrfs_path *path);
>> 3173
>> 3174 /* inode.c */
>> 3175 blk_status_t btrfs_submit_data_bio(struct inode *inode, struct bio *bio,
>> 3176 int mirror_num, unsigned long bio_flags);
>> 3177 unsigned int btrfs_verify_data_csum(struct btrfs_bio *bbio,
>> 3178 u32 bio_offset, struct page *page,
>> 3179 u64 start, u64 end);
>> 3180 struct extent_map *btrfs_get_extent_fiemap(struct btrfs_inode *inode,
>> 3181 u64 start, u64 len);
>> 3182 noinline int can_nocow_extent(struct inode *inode, u64 offset, u64 *len,
>> 3183 u64 *orig_start, u64 *orig_block_len,
>> 3184 u64 *ram_bytes, bool strict);
>> 3185
>> 3186 void __btrfs_del_delalloc_inode(struct btrfs_root *root,
>> 3187 struct btrfs_inode *inode);
>> 3188 struct inode *btrfs_lookup_dentry(struct inode *dir, struct dentry *dentry);
>> 3189 int btrfs_set_inode_index(struct btrfs_inode *dir, u64 *index);
>> 3190 int btrfs_unlink_inode(struct btrfs_trans_handle *trans,
>> 3191 struct btrfs_inode *dir, struct btrfs_inode *inode,
>> 3192 const char *name, int name_len);
>> 3193 int btrfs_add_link(struct btrfs_trans_handle *trans,
>> 3194 struct btrfs_inode *parent_inode, struct btrfs_inode *inode,
>> 3195 const char *name, int name_len, int add_backref, u64 index);
>> 3196 int btrfs_delete_subvolume(struct inode *dir, struct dentry *dentry);
>> 3197 int btrfs_truncate_block(struct btrfs_inode *inode, loff_t from, loff_t len,
>> 3198 int front);
>> 3199
>> 3200 int btrfs_start_delalloc_snapshot(struct btrfs_root *root, bool in_reclaim_context);
>> 3201 int btrfs_start_delalloc_roots(struct btrfs_fs_info *fs_info, long nr,
>> 3202 bool in_reclaim_context);
>> 3203 int btrfs_set_extent_delalloc(struct btrfs_inode *inode, u64 start, u64 end,
>> 3204 unsigned int extra_bits,
>> 3205 struct extent_state **cached_state);
>> 3206 int btrfs_create_subvol_root(struct btrfs_trans_handle *trans,
>> 3207 struct btrfs_root *new_root,
>> 3208 struct btrfs_root *parent_root,
>> 3209 struct user_namespace *mnt_userns);
>> 3210 void btrfs_set_delalloc_extent(struct inode *inode, struct extent_state *state,
>> 3211 unsigned *bits);
>> 3212 void btrfs_clear_delalloc_extent(struct inode *inode,
>> 3213 struct extent_state *state, unsigned *bits);
>> 3214 void btrfs_merge_delalloc_extent(struct inode *inode, struct extent_state *new,
>> 3215 struct extent_state *other);
>> 3216 void btrfs_split_delalloc_extent(struct inode *inode,
>> 3217 struct extent_state *orig, u64 split);
>> 3218 void btrfs_set_range_writeback(struct btrfs_inode *inode, u64 start, u64 end);
>> 3219 vm_fault_t btrfs_page_mkwrite(struct vm_fault *vmf);
>> 3220 int btrfs_readpage(struct file *file, struct page *page);
>> 3221 void btrfs_evict_inode(struct inode *inode);
>> 3222 int btrfs_write_inode(struct inode *inode, struct writeback_control *wbc);
>> 3223 struct inode *btrfs_alloc_inode(struct super_block *sb);
>> 3224 void btrfs_destroy_inode(struct inode *inode);
>> 3225 void btrfs_free_inode(struct inode *inode);
>> 3226 int btrfs_drop_inode(struct inode *inode);
>> 3227 int __init btrfs_init_cachep(void);
>> 3228 void __cold btrfs_destroy_cachep(void);
>> 3229 struct inode *btrfs_iget_path(struct super_block *s, u64 ino,
>> 3230 struct btrfs_root *root, struct btrfs_path *path);
>> 3231 struct inode *btrfs_iget(struct super_block *s, u64 ino, struct btrfs_root *root);
>> 3232 struct extent_map *btrfs_get_extent(struct btrfs_inode *inode,
>> 3233 struct page *page, size_t pg_offset,
>> 3234 u64 start, u64 end);
>> 3235 int btrfs_update_inode(struct btrfs_trans_handle *trans,
>> 3236 struct btrfs_root *root, struct btrfs_inode *inode);
>> 3237 int btrfs_update_inode_fallback(struct btrfs_trans_handle *trans,
>> 3238 struct btrfs_root *root, struct btrfs_inode *inode);
>> 3239 int btrfs_orphan_add(struct btrfs_trans_handle *trans,
>> 3240 struct btrfs_inode *inode);
>> 3241 int btrfs_orphan_cleanup(struct btrfs_root *root);
>> 3242 int btrfs_cont_expand(struct btrfs_inode *inode, loff_t oldsize, loff_t size);
>> 3243 void btrfs_add_delayed_iput(struct inode *inode);
>> 3244 void btrfs_run_delayed_iputs(struct btrfs_fs_info *fs_info);
>> 3245 int btrfs_wait_on_delayed_iputs(struct btrfs_fs_info *fs_info);
>> 3246 int btrfs_prealloc_file_range(struct inode *inode, int mode,
>> 3247 u64 start, u64 num_bytes, u64 min_size,
>> 3248 loff_t actual_len, u64 *alloc_hint);
>> 3249 int btrfs_prealloc_file_range_trans(struct inode *inode,
>> 3250 struct btrfs_trans_handle *trans, int mode,
>> 3251 u64 start, u64 num_bytes, u64 min_size,
>> 3252 loff_t actual_len, u64 *alloc_hint);
>> 3253 int btrfs_run_delalloc_range(struct btrfs_inode *inode, struct page *locked_page,
>> 3254 u64 start, u64 end, int *page_started, unsigned long *nr_written,
>> 3255 struct writeback_control *wbc);
>> 3256 int btrfs_writepage_cow_fixup(struct page *page);
>> 3257 void btrfs_writepage_endio_finish_ordered(struct btrfs_inode *inode,
>> 3258 struct page *page, u64 start,
>> 3259 u64 end, bool uptodate);
>> 3260 extern const struct dentry_operations btrfs_dentry_operations;
>> 3261 extern const struct iomap_ops btrfs_dio_iomap_ops;
>> 3262 extern const struct iomap_dio_ops btrfs_dio_ops;
>> 3263
>> 3264 /* Inode locking type flags, by default the exclusive lock is taken */
>> 3265 #define BTRFS_ILOCK_SHARED (1U << 0)
>> 3266 #define BTRFS_ILOCK_TRY (1U << 1)
>> 3267 #define BTRFS_ILOCK_MMAP (1U << 2)
>> 3268
>> 3269 int btrfs_inode_lock(struct inode *inode, unsigned int ilock_flags);
>> 3270 void btrfs_inode_unlock(struct inode *inode, unsigned int ilock_flags);
>> 3271 void btrfs_update_inode_bytes(struct btrfs_inode *inode,
>> 3272 const u64 add_bytes,
>> 3273 const u64 del_bytes);
>> 3274
>> 3275 /* ioctl.c */
>> 3276 long btrfs_ioctl(struct file *file, unsigned int cmd, unsigned long arg);
>> 3277 long btrfs_compat_ioctl(struct file *file, unsigned int cmd, unsigned long arg);
>> 3278 int btrfs_fileattr_get(struct dentry *dentry, struct fileattr *fa);
>> 3279 int btrfs_fileattr_set(struct user_namespace *mnt_userns,
>> 3280 struct dentry *dentry, struct fileattr *fa);
>> 3281 int btrfs_ioctl_get_supported_features(void __user *arg);
>> 3282 void btrfs_sync_inode_flags_to_i_flags(struct inode *inode);
>> 3283 int __pure btrfs_is_empty_uuid(u8 *uuid);
>> 3284 int btrfs_defrag_file(struct inode *inode, struct file_ra_state *ra,
>> 3285 struct btrfs_ioctl_defrag_range_args *range,
>> 3286 u64 newer_than, unsigned long max_to_defrag);
>> 3287 void btrfs_get_block_group_info(struct list_head *groups_list,
>> 3288 struct btrfs_ioctl_space_info *space);
>> 3289 void btrfs_update_ioctl_balance_args(struct btrfs_fs_info *fs_info,
>> 3290 struct btrfs_ioctl_balance_args *bargs);
>> 3291 bool btrfs_exclop_start(struct btrfs_fs_info *fs_info,
>> 3292 enum btrfs_exclusive_operation type);
>> 3293 bool btrfs_exclop_start_try_lock(struct btrfs_fs_info *fs_info,
>> 3294 enum btrfs_exclusive_operation type);
>> 3295 void btrfs_exclop_start_unlock(struct btrfs_fs_info *fs_info);
>> 3296 void btrfs_exclop_finish(struct btrfs_fs_info *fs_info);
>> 3297 void btrfs_exclop_balance(struct btrfs_fs_info *fs_info,
>> 3298 enum btrfs_exclusive_operation op);
>> 3299
>> 3300
>> 3301 /* file.c */
>> 3302 int __init btrfs_auto_defrag_init(void);
>> 3303 void __cold btrfs_auto_defrag_exit(void);
>> 3304 int btrfs_add_inode_defrag(struct btrfs_trans_handle *trans,
>> 3305 struct btrfs_inode *inode, u32 extent_thresh);
>> 3306 int btrfs_run_defrag_inodes(struct btrfs_fs_info *fs_info);
>> 3307 void btrfs_cleanup_defrag_inodes(struct btrfs_fs_info *fs_info);
>> 3308 int btrfs_sync_file(struct file *file, loff_t start, loff_t end, int datasync);
>> 3309 void btrfs_drop_extent_cache(struct btrfs_inode *inode, u64 start, u64 end,
>> 3310 int skip_pinned);
>> 3311 extern const struct file_operations btrfs_file_operations;
>> 3312 int btrfs_drop_extents(struct btrfs_trans_handle *trans,
>> 3313 struct btrfs_root *root, struct btrfs_inode *inode,
>> 3314 struct btrfs_drop_extents_args *args);
>> 3315 int btrfs_replace_file_extents(struct btrfs_inode *inode,
>> 3316 struct btrfs_path *path, const u64 start,
>> 3317 const u64 end,
>> 3318 struct btrfs_replace_extent_info *extent_info,
>> 3319 struct btrfs_trans_handle **trans_out);
>> 3320 int btrfs_mark_extent_written(struct btrfs_trans_handle *trans,
>> 3321 struct btrfs_inode *inode, u64 start, u64 end);
>> 3322 int btrfs_release_file(struct inode *inode, struct file *file);
>> 3323 int btrfs_dirty_pages(struct btrfs_inode *inode, struct page **pages,
>> 3324 size_t num_pages, loff_t pos, size_t write_bytes,
>> 3325 struct extent_state **cached, bool noreserve);
>> 3326 int btrfs_fdatawrite_range(struct inode *inode, loff_t start, loff_t end);
>> 3327 int btrfs_check_nocow_lock(struct btrfs_inode *inode, loff_t pos,
>> 3328 size_t *write_bytes);
>> 3329 void btrfs_check_nocow_unlock(struct btrfs_inode *inode);
>> 3330
>> 3331 /* tree-defrag.c */
>> 3332 int btrfs_defrag_leaves(struct btrfs_trans_handle *trans,
>> 3333 struct btrfs_root *root);
>> 3334
>> 3335 /* super.c */
>> 3336 int btrfs_parse_options(struct btrfs_fs_info *info, char *options,
>> 3337 unsigned long new_flags);
>> 3338 int btrfs_sync_fs(struct super_block *sb, int wait);
>> 3339 char *btrfs_get_subvol_name_from_objectid(struct btrfs_fs_info *fs_info,
>> 3340 u64 subvol_objectid);
>> 3341
>> 3342 static inline __printf(2, 3) __cold
>> 3343 void btrfs_no_printk(const struct btrfs_fs_info *fs_info, const char *fmt, ...)
>> 3344 {
>> 3345 }
>> 3346
>> 3347 #ifdef CONFIG_PRINTK
>> 3348 __printf(2, 3)
>> 3349 __cold
>> 3350 void btrfs_printk(const struct btrfs_fs_info *fs_info, const char *fmt, ...);
>> 3351 #else
>> 3352 #define btrfs_printk(fs_info, fmt, args...) \
>> 3353 btrfs_no_printk(fs_info, fmt, ##args)
>> 3354 #endif
>> 3355
>> 3356 #define btrfs_emerg(fs_info, fmt, args...) \
>> 3357 btrfs_printk(fs_info, KERN_EMERG fmt, ##args)
>> 3358 #define btrfs_alert(fs_info, fmt, args...) \
>> 3359 btrfs_printk(fs_info, KERN_ALERT fmt, ##args)
>> 3360 #define btrfs_crit(fs_info, fmt, args...) \
>> 3361 btrfs_printk(fs_info, KERN_CRIT fmt, ##args)
>> 3362 #define btrfs_err(fs_info, fmt, args...) \
>> 3363 btrfs_printk(fs_info, KERN_ERR fmt, ##args)
>> 3364 #define btrfs_warn(fs_info, fmt, args...) \
>> 3365 btrfs_printk(fs_info, KERN_WARNING fmt, ##args)
>> 3366 #define btrfs_notice(fs_info, fmt, args...) \
>> 3367 btrfs_printk(fs_info, KERN_NOTICE fmt, ##args)
>> 3368 #define btrfs_info(fs_info, fmt, args...) \
>> 3369 btrfs_printk(fs_info, KERN_INFO fmt, ##args)
>> 3370
>> 3371 /*
>> 3372 * Wrappers that use printk_in_rcu
>> 3373 */
>> 3374 #define btrfs_emerg_in_rcu(fs_info, fmt, args...) \
>> 3375 btrfs_printk_in_rcu(fs_info, KERN_EMERG fmt, ##args)
>> 3376 #define btrfs_alert_in_rcu(fs_info, fmt, args...) \
>> 3377 btrfs_printk_in_rcu(fs_info, KERN_ALERT fmt, ##args)
>> 3378 #define btrfs_crit_in_rcu(fs_info, fmt, args...) \
>> 3379 btrfs_printk_in_rcu(fs_info, KERN_CRIT fmt, ##args)
>> 3380 #define btrfs_err_in_rcu(fs_info, fmt, args...) \
>> 3381 btrfs_printk_in_rcu(fs_info, KERN_ERR fmt, ##args)
>> 3382 #define btrfs_warn_in_rcu(fs_info, fmt, args...) \
>> 3383 btrfs_printk_in_rcu(fs_info, KERN_WARNING fmt, ##args)
>> 3384 #define btrfs_notice_in_rcu(fs_info, fmt, args...) \
>> 3385 btrfs_printk_in_rcu(fs_info, KERN_NOTICE fmt, ##args)
>> 3386 #define btrfs_info_in_rcu(fs_info, fmt, args...) \
>> 3387 btrfs_printk_in_rcu(fs_info, KERN_INFO fmt, ##args)
>> 3388
>> 3389 /*
>> 3390 * Wrappers that use a ratelimited printk_in_rcu
>> 3391 */
>> 3392 #define btrfs_emerg_rl_in_rcu(fs_info, fmt, args...) \
>> 3393 btrfs_printk_rl_in_rcu(fs_info, KERN_EMERG fmt, ##args)
>> 3394 #define btrfs_alert_rl_in_rcu(fs_info, fmt, args...) \
>> 3395 btrfs_printk_rl_in_rcu(fs_info, KERN_ALERT fmt, ##args)
>> 3396 #define btrfs_crit_rl_in_rcu(fs_info, fmt, args...) \
>> 3397 btrfs_printk_rl_in_rcu(fs_info, KERN_CRIT fmt, ##args)
>> 3398 #define btrfs_err_rl_in_rcu(fs_info, fmt, args...) \
>> 3399 btrfs_printk_rl_in_rcu(fs_info, KERN_ERR fmt, ##args)
>> 3400 #define btrfs_warn_rl_in_rcu(fs_info, fmt, args...) \
>> 3401 btrfs_printk_rl_in_rcu(fs_info, KERN_WARNING fmt, ##args)
>> 3402 #define btrfs_notice_rl_in_rcu(fs_info, fmt, args...) \
>> 3403 btrfs_printk_rl_in_rcu(fs_info, KERN_NOTICE fmt, ##args)
>> 3404 #define btrfs_info_rl_in_rcu(fs_info, fmt, args...) \
>> 3405 btrfs_printk_rl_in_rcu(fs_info, KERN_INFO fmt, ##args)
>> 3406
>> 3407 /*
>> 3408 * Wrappers that use a ratelimited printk
>> 3409 */
>> 3410 #define btrfs_emerg_rl(fs_info, fmt, args...) \
>> 3411 btrfs_printk_ratelimited(fs_info, KERN_EMERG fmt, ##args)
>> 3412 #define btrfs_alert_rl(fs_info, fmt, args...) \
>> 3413 btrfs_printk_ratelimited(fs_info, KERN_ALERT fmt, ##args)
>> 3414 #define btrfs_crit_rl(fs_info, fmt, args...) \
>> 3415 btrfs_printk_ratelimited(fs_info, KERN_CRIT fmt, ##args)
>> 3416 #define btrfs_err_rl(fs_info, fmt, args...) \
>> 3417 btrfs_printk_ratelimited(fs_info, KERN_ERR fmt, ##args)
>> 3418 #define btrfs_warn_rl(fs_info, fmt, args...) \
>> 3419 btrfs_printk_ratelimited(fs_info, KERN_WARNING fmt, ##args)
>> 3420 #define btrfs_notice_rl(fs_info, fmt, args...) \
>> 3421 btrfs_printk_ratelimited(fs_info, KERN_NOTICE fmt, ##args)
>> 3422 #define btrfs_info_rl(fs_info, fmt, args...) \
>> 3423 btrfs_printk_ratelimited(fs_info, KERN_INFO fmt, ##args)
>> 3424
>> 3425 #if defined(CONFIG_DYNAMIC_DEBUG)
>> 3426 #define btrfs_debug(fs_info, fmt, args...) \
>> 3427 _dynamic_func_call_no_desc(fmt, btrfs_printk, \
>> 3428 fs_info, KERN_DEBUG fmt, ##args)
>> 3429 #define btrfs_debug_in_rcu(fs_info, fmt, args...) \
>> 3430 _dynamic_func_call_no_desc(fmt, btrfs_printk_in_rcu, \
>> 3431 fs_info, KERN_DEBUG fmt, ##args)
>> 3432 #define btrfs_debug_rl_in_rcu(fs_info, fmt, args...) \
>> 3433 _dynamic_func_call_no_desc(fmt, btrfs_printk_rl_in_rcu, \
>> 3434 fs_info, KERN_DEBUG fmt, ##args)
>> 3435 #define btrfs_debug_rl(fs_info, fmt, args...) \
>> 3436 _dynamic_func_call_no_desc(fmt, btrfs_printk_ratelimited, \
>> 3437 fs_info, KERN_DEBUG fmt, ##args)
>> 3438 #elif defined(DEBUG)
>> 3439 #define btrfs_debug(fs_info, fmt, args...) \
>> 3440 btrfs_printk(fs_info, KERN_DEBUG fmt, ##args)
>> 3441 #define btrfs_debug_in_rcu(fs_info, fmt, args...) \
>> 3442 btrfs_printk_in_rcu(fs_info, KERN_DEBUG fmt, ##args)
>> 3443 #define btrfs_debug_rl_in_rcu(fs_info, fmt, args...) \
>> 3444 btrfs_printk_rl_in_rcu(fs_info, KERN_DEBUG fmt, ##args)
>> 3445 #define btrfs_debug_rl(fs_info, fmt, args...) \
>> 3446 btrfs_printk_ratelimited(fs_info, KERN_DEBUG fmt, ##args)
>> 3447 #else
>> 3448 #define btrfs_debug(fs_info, fmt, args...) \
>> 3449 btrfs_no_printk(fs_info, KERN_DEBUG fmt, ##args)
>> 3450 #define btrfs_debug_in_rcu(fs_info, fmt, args...) \
>> 3451 btrfs_no_printk_in_rcu(fs_info, KERN_DEBUG fmt, ##args)
>> 3452 #define btrfs_debug_rl_in_rcu(fs_info, fmt, args...) \
>> 3453 btrfs_no_printk_in_rcu(fs_info, KERN_DEBUG fmt, ##args)
>> 3454 #define btrfs_debug_rl(fs_info, fmt, args...) \
>> 3455 btrfs_no_printk(fs_info, KERN_DEBUG fmt, ##args)
>> 3456 #endif
>> 3457
>> 3458 #define btrfs_printk_in_rcu(fs_info, fmt, args...) \
>> 3459 do { \
>> 3460 rcu_read_lock(); \
>> 3461 btrfs_printk(fs_info, fmt, ##args); \
>> 3462 rcu_read_unlock(); \
>> 3463 } while (0)
>> 3464
>> 3465 #define btrfs_no_printk_in_rcu(fs_info, fmt, args...) \
>> 3466 do { \
>> 3467 rcu_read_lock(); \
>> 3468 btrfs_no_printk(fs_info, fmt, ##args); \
>> 3469 rcu_read_unlock(); \
>> 3470 } while (0)
>> 3471
>> 3472 #define btrfs_printk_ratelimited(fs_info, fmt, args...) \
>> 3473 do { \
>> 3474 static DEFINE_RATELIMIT_STATE(_rs, \
>> 3475 DEFAULT_RATELIMIT_INTERVAL, \
>> 3476 DEFAULT_RATELIMIT_BURST); \
>> 3477 if (__ratelimit(&_rs)) \
>> 3478 btrfs_printk(fs_info, fmt, ##args); \
>> 3479 } while (0)
>> 3480
>> 3481 #define btrfs_printk_rl_in_rcu(fs_info, fmt, args...) \
>> 3482 do { \
>> 3483 rcu_read_lock(); \
>> 3484 btrfs_printk_ratelimited(fs_info, fmt, ##args); \
>> 3485 rcu_read_unlock(); \
>> 3486 } while (0)
>> 3487
>> 3488 #ifdef CONFIG_BTRFS_ASSERT
>> 3489 __cold __noreturn
>> 3490 static inline void assertfail(const char *expr, const char *file, int line)
>> 3491 {
>> 3492 pr_err("assertion failed: %s, in %s:%d\n", expr, file, line);
>> 3493 BUG();
>> 3494 }
>> 3495
>> 3496 #define ASSERT(expr) \
>> 3497 (likely(expr) ? (void)0 : assertfail(#expr, __FILE__, __LINE__))
>> 3498
>> 3499 #else
>> 3500 static inline void assertfail(const char *expr, const char* file, int line) { }
>> 3501 #define ASSERT(expr) (void)(expr)
>> 3502 #endif
>> 3503
>> 3504 #if BITS_PER_LONG == 32
>> 3505 #define BTRFS_32BIT_MAX_FILE_SIZE (((u64)ULONG_MAX + 1) << PAGE_SHIFT)
>> 3506 /*
>> 3507 * The warning threshold is 5/8th of the MAX_LFS_FILESIZE that limits the logical
>> 3508 * addresses of extents.
>> 3509 *
>> 3510 * For 4K page size it's about 10T, for 64K it's 160T.
>> 3511 */
>> 3512 #define BTRFS_32BIT_EARLY_WARN_THRESHOLD (BTRFS_32BIT_MAX_FILE_SIZE * 5 / 8)
>> 3513 void btrfs_warn_32bit_limit(struct btrfs_fs_info *fs_info);
>> 3514 void btrfs_err_32bit_limit(struct btrfs_fs_info *fs_info);
>> 3515 #endif
>> 3516
>> 3517 /*
>> 3518 * Get the correct offset inside the page of extent buffer.
>> 3519 *
>> 3520 * @eb: target extent buffer
>> 3521 * @start: offset inside the extent buffer
>> 3522 *
>> 3523 * Will handle both sectorsize == PAGE_SIZE and sectorsize < PAGE_SIZE cases.
>> 3524 */
>> 3525 static inline size_t get_eb_offset_in_page(const struct extent_buffer *eb,
>> 3526 unsigned long offset)
>> 3527 {
>> 3528 /*
>> 3529 * For sectorsize == PAGE_SIZE case, eb->start will always be aligned
>> 3530 * to PAGE_SIZE, thus adding it won't cause any difference.
>> 3531 *
>> 3532 * For sectorsize < PAGE_SIZE, we must only read the data that belongs
>> 3533 * to the eb, thus we have to take the eb->start into consideration.
>> 3534 */
>> 3535 return offset_in_page(offset + eb->start);
>> 3536 }
>> 3537
>> 3538 static inline unsigned long get_eb_page_index(unsigned long offset)
>> 3539 {
>> 3540 /*
>> 3541 * For sectorsize == PAGE_SIZE case, plain >> PAGE_SHIFT is enough.
>> 3542 *
>> 3543 * For sectorsize < PAGE_SIZE case, we only support 64K PAGE_SIZE,
>> 3544 * and have ensured that all tree blocks are contained in one page,
>> 3545 * thus we always get index == 0.
>> 3546 */
>> 3547 return offset >> PAGE_SHIFT;
>> 3548 }
>> 3549
>> 3550 /*
>> 3551 * Use that for functions that are conditionally exported for sanity tests but
>> 3552 * otherwise static
>> 3553 */
>> 3554 #ifndef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
>> 3555 #define EXPORT_FOR_TESTS static
>> 3556 #else
>> 3557 #define EXPORT_FOR_TESTS
>> 3558 #endif
>> 3559
>> 3560 __cold
>> 3561 static inline void btrfs_print_v0_err(struct btrfs_fs_info *fs_info)
>> 3562 {
>> 3563 btrfs_err(fs_info,
>> 3564 "Unsupported V0 extent filesystem detected. Aborting. Please re-create your filesystem with a newer kernel");
>> 3565 }
>> 3566
>> 3567 __printf(5, 6)
>> 3568 __cold
>> 3569 void __btrfs_handle_fs_error(struct btrfs_fs_info *fs_info, const char *function,
>> 3570 unsigned int line, int errno, const char *fmt, ...);
>> 3571
>> 3572 const char * __attribute_const__ btrfs_decode_error(int errno);
>> 3573
>> 3574 __cold
>> 3575 void __btrfs_abort_transaction(struct btrfs_trans_handle *trans,
>> 3576 const char *function,
>> 3577 unsigned int line, int errno);
>> 3578
>> 3579 /*
>> 3580 * Call btrfs_abort_transaction as early as possible when an error condition is
>> 3581 * detected, that way the exact line number is reported.
>> 3582 */
>> 3583 #define btrfs_abort_transaction(trans, errno) \
>> 3584 do { \
>> 3585 /* Report first abort since mount */ \
>> 3586 if (!test_and_set_bit(BTRFS_FS_STATE_TRANS_ABORTED, \
>> 3587 &((trans)->fs_info->fs_state))) { \
>> 3588 if ((errno) != -EIO && (errno) != -EROFS) { \
>> 3589 WARN(1, KERN_DEBUG \
>> 3590 "BTRFS: Transaction aborted (error %d)\n", \
>> 3591 (errno)); \
>> 3592 } else { \
>> 3593 btrfs_debug((trans)->fs_info, \
>> 3594 "Transaction aborted (error %d)", \
>> 3595 (errno)); \
>> 3596 } \
>> 3597 } \
>> 3598 __btrfs_abort_transaction((trans), __func__, \
>> 3599 __LINE__, (errno)); \
>> 3600 } while (0)
>> 3601
>> 3602 #define btrfs_handle_fs_error(fs_info, errno, fmt, args...) \
>> 3603 do { \
>> 3604 __btrfs_handle_fs_error((fs_info), __func__, __LINE__, \
>> 3605 (errno), fmt, ##args); \
>> 3606 } while (0)
>> 3607
>> 3608 #define BTRFS_FS_ERROR(fs_info) (unlikely(test_bit(BTRFS_FS_STATE_ERROR, \
>> 3609 &(fs_info)->fs_state)))
>> 3610 #define BTRFS_FS_LOG_CLEANUP_ERROR(fs_info) \
>> 3611 (unlikely(test_bit(BTRFS_FS_STATE_LOG_CLEANUP_ERROR, \
>> 3612 &(fs_info)->fs_state)))
>> 3613
>> 3614 __printf(5, 6)
>> 3615 __cold
>> 3616 void __btrfs_panic(struct btrfs_fs_info *fs_info, const char *function,
>> 3617 unsigned int line, int errno, const char *fmt, ...);
>> 3618 /*
>> 3619 * If BTRFS_MOUNT_PANIC_ON_FATAL_ERROR is in mount_opt, __btrfs_panic
>> 3620 * will panic(). Otherwise we BUG() here.
>> 3621 */
>> 3622 #define btrfs_panic(fs_info, errno, fmt, args...) \
>> 3623 do { \
>> 3624 __btrfs_panic(fs_info, __func__, __LINE__, errno, fmt, ##args); \
>> 3625 BUG(); \
>> 3626 } while (0)
>> 3627
>> 3628
>> 3629 /* compatibility and incompatibility defines */
>> 3630
>> 3631 #define btrfs_set_fs_incompat(__fs_info, opt) \
>> 3632 __btrfs_set_fs_incompat((__fs_info), BTRFS_FEATURE_INCOMPAT_##opt, \
>> 3633 #opt)
>> 3634
>> 3635 static inline void __btrfs_set_fs_incompat(struct btrfs_fs_info *fs_info,
>> 3636 u64 flag, const char* name)
>> 3637 {
>> 3638 struct btrfs_super_block *disk_super;
>> 3639 u64 features;
>> 3640
>> 3641 disk_super = fs_info->super_copy;
>> 3642 features = btrfs_super_incompat_flags(disk_super);
>> 3643 if (!(features & flag)) {
>> 3644 spin_lock(&fs_info->super_lock);
>> 3645 features = btrfs_super_incompat_flags(disk_super);
>> 3646 if (!(features & flag)) {
>> 3647 features |= flag;
>> 3648 btrfs_set_super_incompat_flags(disk_super, features);
>> 3649 btrfs_info(fs_info,
>> 3650 "setting incompat feature flag for %s (0x%llx)",
>> 3651 name, flag);
>> 3652 }
>> 3653 spin_unlock(&fs_info->super_lock);
>> 3654 }
>> 3655 }
>> 3656
>> 3657 #define btrfs_clear_fs_incompat(__fs_info, opt) \
>> 3658 __btrfs_clear_fs_incompat((__fs_info), BTRFS_FEATURE_INCOMPAT_##opt, \
>> 3659 #opt)
>> 3660
>> 3661 static inline void __btrfs_clear_fs_incompat(struct btrfs_fs_info *fs_info,
>> 3662 u64 flag, const char* name)
>> 3663 {
>> 3664 struct btrfs_super_block *disk_super;
>> 3665 u64 features;
>> 3666
>> 3667 disk_super = fs_info->super_copy;
>> 3668 features = btrfs_super_incompat_flags(disk_super);
>> 3669 if (features & flag) {
>> 3670 spin_lock(&fs_info->super_lock);
>> 3671 features = btrfs_super_incompat_flags(disk_super);
>> 3672 if (features & flag) {
>> 3673 features &= ~flag;
>> 3674 btrfs_set_super_incompat_flags(disk_super, features);
>> 3675 btrfs_info(fs_info,
>> 3676 "clearing incompat feature flag for %s (0x%llx)",
>> 3677 name, flag);
>> 3678 }
>> 3679 spin_unlock(&fs_info->super_lock);
>> 3680 }
>> 3681 }
>> 3682
>> 3683 #define btrfs_fs_incompat(fs_info, opt) \
>> 3684 __btrfs_fs_incompat((fs_info), BTRFS_FEATURE_INCOMPAT_##opt)
>> 3685
>> 3686 static inline bool __btrfs_fs_incompat(struct btrfs_fs_info *fs_info, u64 flag)
>> 3687 {
>> 3688 struct btrfs_super_block *disk_super;
>> 3689 disk_super = fs_info->super_copy;
>> 3690 return !!(btrfs_super_incompat_flags(disk_super) & flag);
>> 3691 }
>> 3692
>> 3693 #define btrfs_set_fs_compat_ro(__fs_info, opt) \
>> 3694 __btrfs_set_fs_compat_ro((__fs_info), BTRFS_FEATURE_COMPAT_RO_##opt, \
>> 3695 #opt)
>> 3696
>> 3697 static inline void __btrfs_set_fs_compat_ro(struct btrfs_fs_info *fs_info,
>> 3698 u64 flag, const char *name)
>> 3699 {
>> 3700 struct btrfs_super_block *disk_super;
>> 3701 u64 features;
>> 3702
>> 3703 disk_super = fs_info->super_copy;
>> 3704 features = btrfs_super_compat_ro_flags(disk_super);
>> 3705 if (!(features & flag)) {
>> 3706 spin_lock(&fs_info->super_lock);
>> 3707 features = btrfs_super_compat_ro_flags(disk_super);
>> 3708 if (!(features & flag)) {
>> 3709 features |= flag;
>> 3710 btrfs_set_super_compat_ro_flags(disk_super, features);
>> 3711 btrfs_info(fs_info,
>> 3712 "setting compat-ro feature flag for %s (0x%llx)",
>> 3713 name, flag);
>> 3714 }
>> 3715 spin_unlock(&fs_info->super_lock);
>> 3716 }
>> 3717 }
>> 3718
>> 3719 #define btrfs_clear_fs_compat_ro(__fs_info, opt) \
>> 3720 __btrfs_clear_fs_compat_ro((__fs_info), BTRFS_FEATURE_COMPAT_RO_##opt, \
>> 3721 #opt)
>> 3722
>> 3723 static inline void __btrfs_clear_fs_compat_ro(struct btrfs_fs_info *fs_info,
>> 3724 u64 flag, const char *name)
>> 3725 {
>> 3726 struct btrfs_super_block *disk_super;
>> 3727 u64 features;
>> 3728
>> 3729 disk_super = fs_info->super_copy;
>> 3730 features = btrfs_super_compat_ro_flags(disk_super);
>> 3731 if (features & flag) {
>> 3732 spin_lock(&fs_info->super_lock);
>> 3733 features = btrfs_super_compat_ro_flags(disk_super);
>> 3734 if (features & flag) {
>> 3735 features &= ~flag;
>> 3736 btrfs_set_super_compat_ro_flags(disk_super, features);
>> 3737 btrfs_info(fs_info,
>> 3738 "clearing compat-ro feature flag for %s (0x%llx)",
>> 3739 name, flag);
>> 3740 }
>> 3741 spin_unlock(&fs_info->super_lock);
>> 3742 }
>> 3743 }
>> 3744
>> 3745 #define btrfs_fs_compat_ro(fs_info, opt) \
>> 3746 __btrfs_fs_compat_ro((fs_info), BTRFS_FEATURE_COMPAT_RO_##opt)
>> 3747
>> 3748 static inline int __btrfs_fs_compat_ro(struct btrfs_fs_info *fs_info, u64 flag)
>> 3749 {
>> 3750 struct btrfs_super_block *disk_super;
>> 3751 disk_super = fs_info->super_copy;
>> 3752 return !!(btrfs_super_compat_ro_flags(disk_super) & flag);
>> 3753 }
>> 3754
>> 3755 /* acl.c */
>> 3756 #ifdef CONFIG_BTRFS_FS_POSIX_ACL
>> 3757 struct posix_acl *btrfs_get_acl(struct inode *inode, int type, bool rcu);
>> 3758 int btrfs_set_acl(struct user_namespace *mnt_userns, struct inode *inode,
>> 3759 struct posix_acl *acl, int type);
>> 3760 int btrfs_init_acl(struct btrfs_trans_handle *trans,
>> 3761 struct inode *inode, struct inode *dir);
>> 3762 #else
>> 3763 #define btrfs_get_acl NULL
>> 3764 #define btrfs_set_acl NULL
>> 3765 static inline int btrfs_init_acl(struct btrfs_trans_handle *trans,
>> 3766 struct inode *inode, struct inode *dir)
>> 3767 {
>> 3768 return 0;
>> 3769 }
>> 3770 #endif
>> 3771
>> 3772 /* relocation.c */
>> 3773 int btrfs_relocate_block_group(struct btrfs_fs_info *fs_info, u64 group_start);
>> 3774 int btrfs_init_reloc_root(struct btrfs_trans_handle *trans,
>> 3775 struct btrfs_root *root);
>> 3776 int btrfs_update_reloc_root(struct btrfs_trans_handle *trans,
>> 3777 struct btrfs_root *root);
>> 3778 int btrfs_recover_relocation(struct btrfs_root *root);
>> 3779 int btrfs_reloc_clone_csums(struct btrfs_inode *inode, u64 file_pos, u64 len);
>> 3780 int btrfs_reloc_cow_block(struct btrfs_trans_handle *trans,
>> 3781 struct btrfs_root *root, struct extent_buffer *buf,
>> 3782 struct extent_buffer *cow);
>> 3783 void btrfs_reloc_pre_snapshot(struct btrfs_pending_snapshot *pending,
>> 3784 u64 *bytes_to_reserve);
>> 3785 int btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans,
>> 3786 struct btrfs_pending_snapshot *pending);
>> 3787 int btrfs_should_cancel_balance(struct btrfs_fs_info *fs_info);
>> 3788 struct btrfs_root *find_reloc_root(struct btrfs_fs_info *fs_info,
>> 3789 u64 bytenr);
>> 3790 int btrfs_should_ignore_reloc_root(struct btrfs_root *root);
>> 3791
>> 3792 /* scrub.c */
>> 3793 int btrfs_scrub_dev(struct btrfs_fs_info *fs_info, u64 devid, u64 start,
>> 3794 u64 end, struct btrfs_scrub_progress *progress,
>> 3795 int readonly, int is_dev_replace);
>> 3796 void btrfs_scrub_pause(struct btrfs_fs_info *fs_info);
>> 3797 void btrfs_scrub_continue(struct btrfs_fs_info *fs_info);
>> 3798 int btrfs_scrub_cancel(struct btrfs_fs_info *info);
>> 3799 int btrfs_scrub_cancel_dev(struct btrfs_device *dev);
>> 3800 int btrfs_scrub_progress(struct btrfs_fs_info *fs_info, u64 devid,
>> 3801 struct btrfs_scrub_progress *progress);
>> 3802 static inline void btrfs_init_full_stripe_locks_tree(
>> 3803 struct btrfs_full_stripe_locks_tree *locks_root)
>> 3804 {
>> 3805 locks_root->root = RB_ROOT;
>> 3806 mutex_init(&locks_root->lock);
>> 3807 }
>> 3808
>> 3809 /* dev-replace.c */
>> 3810 void btrfs_bio_counter_inc_blocked(struct btrfs_fs_info *fs_info);
>> 3811 void btrfs_bio_counter_inc_noblocked(struct btrfs_fs_info *fs_info);
>> 3812 void btrfs_bio_counter_sub(struct btrfs_fs_info *fs_info, s64 amount);
>> 3813
>> 3814 static inline void btrfs_bio_counter_dec(struct btrfs_fs_info *fs_info)
>> 3815 {
>> 3816 btrfs_bio_counter_sub(fs_info, 1);
>> 3817 }
725 3818
726 static inline int is_fstree(u64 rootid) 3819 static inline int is_fstree(u64 rootid)
727 { 3820 {
728 if (rootid == BTRFS_FS_TREE_OBJECTID | 3821 if (rootid == BTRFS_FS_TREE_OBJECTID ||
729 ((s64)rootid >= (s64)BTRFS_FIRST_F 3822 ((s64)rootid >= (s64)BTRFS_FIRST_FREE_OBJECTID &&
730 !btrfs_qgroup_level(rootid))) 3823 !btrfs_qgroup_level(rootid)))
731 return 1; 3824 return 1;
732 return 0; 3825 return 0;
733 } 3826 }
734 3827
>> 3828 static inline int btrfs_defrag_cancelled(struct btrfs_fs_info *fs_info)
>> 3829 {
>> 3830 return signal_pending(current);
>> 3831 }
>> 3832
>> 3833 /* verity.c */
>> 3834 #ifdef CONFIG_FS_VERITY
>> 3835
>> 3836 extern const struct fsverity_operations btrfs_verityops;
>> 3837 int btrfs_drop_verity_items(struct btrfs_inode *inode);
>> 3838
>> 3839 BTRFS_SETGET_FUNCS(verity_descriptor_encryption, struct btrfs_verity_descriptor_item,
>> 3840 encryption, 8);
>> 3841 BTRFS_SETGET_FUNCS(verity_descriptor_size, struct btrfs_verity_descriptor_item,
>> 3842 size, 64);
>> 3843 BTRFS_SETGET_STACK_FUNCS(stack_verity_descriptor_encryption,
>> 3844 struct btrfs_verity_descriptor_item, encryption, 8);
>> 3845 BTRFS_SETGET_STACK_FUNCS(stack_verity_descriptor_size,
>> 3846 struct btrfs_verity_descriptor_item, size, 64);
>> 3847
>> 3848 #else
>> 3849
>> 3850 static inline int btrfs_drop_verity_items(struct btrfs_inode *inode)
>> 3851 {
>> 3852 return 0;
>> 3853 }
>> 3854
>> 3855 #endif
>> 3856
>> 3857 /* Sanity test specific functions */
>> 3858 #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
>> 3859 void btrfs_test_destroy_inode(struct inode *inode);
>> 3860 static inline int btrfs_is_testing(struct btrfs_fs_info *fs_info)
>> 3861 {
>> 3862 return test_bit(BTRFS_FS_STATE_DUMMY_FS_INFO, &fs_info->fs_state);
>> 3863 }
>> 3864 #else
>> 3865 static inline int btrfs_is_testing(struct btrfs_fs_info *fs_info)
>> 3866 {
>> 3867 return 0;
>> 3868 }
>> 3869 #endif
>> 3870
>> 3871 static inline bool btrfs_is_zoned(const struct btrfs_fs_info *fs_info)
>> 3872 {
>> 3873 return fs_info->zoned != 0;
>> 3874 }
>> 3875
735 static inline bool btrfs_is_data_reloc_root(co 3876 static inline bool btrfs_is_data_reloc_root(const struct btrfs_root *root)
736 { 3877 {
737 return root->root_key.objectid == BTRF 3878 return root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID;
738 } 3879 }
739 3880
740 u16 btrfs_csum_type_size(u16 type); <<
741 int btrfs_super_csum_size(const struct btrfs_s <<
742 const char *btrfs_super_csum_name(u16 csum_typ <<
743 const char *btrfs_super_csum_driver(u16 csum_t <<
744 size_t __attribute_const__ btrfs_get_num_csums <<
745 <<
746 /* 3881 /*
747 * We use page status Private2 to indicate the 3882 * We use page status Private2 to indicate there is an ordered extent with
748 * unfinished IO. 3883 * unfinished IO.
749 * 3884 *
750 * Rename the Private2 accessors to Ordered, t 3885 * Rename the Private2 accessors to Ordered, to improve readability.
751 */ 3886 */
752 #define PageOrdered(page) PagePr 3887 #define PageOrdered(page) PagePrivate2(page)
753 #define SetPageOrdered(page) SetPag 3888 #define SetPageOrdered(page) SetPagePrivate2(page)
754 #define ClearPageOrdered(page) ClearP 3889 #define ClearPageOrdered(page) ClearPagePrivate2(page)
755 #define folio_test_ordered(folio) folio_ <<
756 #define folio_set_ordered(folio) folio_ <<
757 #define folio_clear_ordered(folio) folio_ <<
758 3890
759 #endif 3891 #endif
760 3892
Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.