fs/btrfs/ctree.h

1 /* SPDX-License-Identifier: GPL-2.0 */
56  * The slots array records the index of the item or block pointer
93 	 * btrfs_record_root_in_trans is a multi-step process, and it can race
107 	 * - How balance works
112 	 *   While for non-shareable trees, we just simply do a tree search
115 	 * - How dirty roots are tracked
117 	 *   track them, while non-subvolume roots have TRACK_DIRTY bit, they
220 	/* The dirty list is only used by non-shareable roots */
226 	/* red-black tree that keeps track of in-memory inodes */
280 	 * manipulation with the read-only status via SUBVOL_SETFLAGS
323 	/* Byte-swap the constant at compile time, root_item::flags is LE */  in btrfs_root_readonly()
324 	return (root->root_item.flags & cpu_to_le64(BTRFS_ROOT_SUBVOL_RDONLY)) != 0;  in btrfs_root_readonly()
329 	/* Byte-swap the constant at compile time, root_item::flags is LE */  in btrfs_root_dead()
330 	return (root->root_item.flags & cpu_to_le64(BTRFS_ROOT_SUBVOL_DEAD)) != 0;  in btrfs_root_dead()
335 	return root->root_key.objectid;  in btrfs_root_id()
340 	return READ_ONCE(root->log_transid);  in btrfs_get_root_log_transid()
345 	WRITE_ONCE(root->log_transid, log_transid);  in btrfs_set_root_log_transid()
350 	return READ_ONCE(root->last_log_commit);  in btrfs_get_root_last_log_commit()
355 	WRITE_ONCE(root->last_log_commit, commit_id);  in btrfs_set_root_last_log_commit()
455 	return info->nodesize - sizeof(struct btrfs_header);  in BTRFS_LEAF_DATA_SIZE()
460 	return BTRFS_LEAF_DATA_SIZE(info) - sizeof(struct btrfs_item);  in BTRFS_MAX_ITEM_SIZE()
470 	return BTRFS_MAX_ITEM_SIZE(info) - sizeof(struct btrfs_dir_item);  in BTRFS_MAX_XATTR_SIZE()
474 				((bytes) >> (fs_info)->sectorsize_bits)
499  * Compare two keys, on little-endian the disk order is same as CPU order and
547 		    enum btrfs_lock_nesting nest);
554 			  enum btrfs_lock_nesting nest);
598 	return btrfs_del_items(trans, root, path, path->slots[0], 1);  in btrfs_del_item()
607 	 * Pointer to an array containing the keys of the items to insert (in
611 	/* Pointer to an array containing the data size for each item to insert. */
615 	 * setting up the data_sizes array, so it ends up being more efficient
618 	 * array, and in the case of setup_item_for_insert(), we would be doing
687 		(path)->slots[0]++						\
720 	return root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID;  in btrfs_is_data_reloc_root()