Lines Matching +full:array +full:- +full:nest
1 /* SPDX-License-Identifier: GPL-2.0 */
22 #include "extent-io-tree.h"
55 * The slots array records the index of the item or block pointer
95 * btrfs_record_root_in_trans is a multi-step process, and it can race
109 * - How balance works
114 * While for non-shareable trees, we just simply do a tree search
117 * - How dirty roots are tracked
119 * track them, while non-subvolume roots have TRACK_DIRTY bit, they
222 /* The dirty list is only used by non-shareable roots */
228 * Xarray that keeps track of in-memory inodes, protected by the lock
284 * manipulation with the read-only status via SUBVOL_SETFLAGS
327 /* Byte-swap the constant at compile time, root_item::flags is LE */ in btrfs_root_readonly()
328 return (root->root_item.flags & cpu_to_le64(BTRFS_ROOT_SUBVOL_RDONLY)) != 0; in btrfs_root_readonly()
333 /* Byte-swap the constant at compile time, root_item::flags is LE */ in btrfs_root_dead()
334 return (root->root_item.flags & cpu_to_le64(BTRFS_ROOT_SUBVOL_DEAD)) != 0; in btrfs_root_dead()
339 return root->root_key.objectid; in btrfs_root_id()
344 return READ_ONCE(root->log_transid); in btrfs_get_root_log_transid()
349 WRITE_ONCE(root->log_transid, log_transid); in btrfs_set_root_log_transid()
354 return READ_ONCE(root->last_log_commit); in btrfs_get_root_last_log_commit()
359 WRITE_ONCE(root->last_log_commit, commit_id); in btrfs_set_root_last_log_commit()
364 return READ_ONCE(root->last_trans); in btrfs_get_root_last_trans()
369 WRITE_ONCE(root->last_trans, transid); in btrfs_set_root_last_trans()
375 * Every normal root that is created with root->root_key.offset set to it's
387 return btrfs_root_last_snapshot(&root->root_item); in btrfs_root_origin_generation()
388 return root->root_key.offset; in btrfs_root_origin_generation()
490 return info->nodesize - sizeof(struct btrfs_header); in BTRFS_LEAF_DATA_SIZE()
495 return BTRFS_LEAF_DATA_SIZE(info) - sizeof(struct btrfs_item); in BTRFS_MAX_ITEM_SIZE()
505 return BTRFS_MAX_ITEM_SIZE(info) - sizeof(struct btrfs_dir_item); in BTRFS_MAX_XATTR_SIZE()
519 * Compare two keys, on little-endian the disk order is same as CPU order and
567 enum btrfs_lock_nesting nest);
574 enum btrfs_lock_nesting nest);
619 return btrfs_del_items(trans, root, path, path->slots[0], 1); in btrfs_del_item()
628 * Pointer to an array containing the keys of the items to insert (in
632 /* Pointer to an array containing the data size for each item to insert. */
636 * setting up the data_sizes array, so it ends up being more efficient
639 * array, and in the case of setup_item_for_insert(), we would be doing
708 (path)->slots[0]++ \
741 return root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID; in btrfs_is_data_reloc_root()