/linux-master/fs/btrfs/ |
H A D | ref-verify.c | 190 static struct root_entry *lookup_root_entry(struct rb_root *root, u64 objectid) argument 198 if (entry->root_objectid < objectid) 200 else if (entry->root_objectid > objectid) 470 ret = add_tree_block(fs_info, offset, 0, key->objectid, 474 ret = add_tree_block(fs_info, 0, offset, key->objectid, 480 key->objectid, key->offset); 486 key->objectid, key->offset); 523 *bytenr = key.objectid; 529 key.objectid, *tree_block_level); 533 key.objectid, *tree_block_leve [all...] |
H A D | extent-tree.c | 81 key.objectid = start; 135 key.objectid = bytenr; 152 if (key.objectid == bytenr && 289 * The key objectid corresponds to the first byte in the extent, 303 * - objectid of the file holding the reference 320 * (root_key.objectid, inode objectid, offset in file, 1) 325 * (btrfs_header_owner(leaf), inode objectid, offset in file) 333 * objectid of block's owner tree. The key offset for the full back refs 452 key.objectid 2254 check_delayed_ref(struct btrfs_root *root, struct btrfs_path *path, u64 objectid, u64 offset, u64 bytenr) argument 2342 check_committed_ref(struct btrfs_root *root, struct btrfs_path *path, u64 objectid, u64 offset, u64 bytenr, bool strict) argument 2434 btrfs_cross_ref_exist(struct btrfs_root *root, u64 objectid, u64 offset, u64 bytenr, bool strict, struct btrfs_path *path) argument [all...] |
H A D | send.c | 394 result_string, what, sctx->cmp_key->objectid, 936 key.objectid = ino; 1079 found_key->objectid, 1259 key.objectid = ino; 1271 if (found_key.objectid != ino || 1763 key.objectid = ino; 2016 *found_inode = key.objectid; 2041 key.objectid = ino; 2051 if (ret || found_key.objectid != ino || 2534 key.objectid [all...] |
H A D | backref.c | 73 ret = ctx->indirect_ref_iterator(key->objectid, offset, 86 e->inum = key->objectid; 237 if (ref1->key_for_search.objectid < ref2->key_for_search.objectid) 239 if (ref1->key_for_search.objectid > ref2->key_for_search.objectid) 266 newref->key_for_search.objectid == sc->inum) 521 if (key.objectid != key_for_search->objectid || 672 ref->key_for_search.objectid, re [all...] |
H A D | inode.c | 167 key.objectid = inum; 313 ctx.bytenr = found_key.objectid; 314 ctx.extent_item_pos = logical - found_key.objectid; 338 /* Output without objectid, which is more meaningful */ 552 key.objectid = btrfs_ino(inode); 1204 ins.objectid, /* block_start */ 1219 ins.objectid, /* disk_bytenr */ 1229 btrfs_dec_block_group_reservations(fs_info, ins.objectid); 1239 *alloc_hint = ins.objectid + ins.offset; 1247 btrfs_dec_block_group_reservations(fs_info, ins.objectid); 3721 acls_after_inode_item(struct extent_buffer *leaf, int slot, u64 objectid, int *first_xattr_slot) argument 4298 u64 objectid; local 6235 u64 objectid; local 6804 u64 objectid = btrfs_ino(inode); local [all...] |
H A D | btrfs_inode.h | 304 static inline unsigned long btrfs_inode_hash(u64 objectid, argument 307 u64 h = objectid ^ (root->root_key.objectid * GOLDEN_RATIO_PRIME); 320 * we use the inode's location objectid which is a u64 to avoid truncation. 324 u64 ino = inode->location.objectid;
|
H A D | qgroup.c | 421 key.objectid = 0; 521 key.objectid = 0; 537 if (found_key.objectid > found_key.offset) { 548 ret = add_relation_rb(fs_info, list, found_key.objectid, 554 found_key.objectid, found_key.offset); 662 key.objectid = src; 686 key.objectid = src; 722 key.objectid = 0; 784 key.objectid = 0; 830 key.objectid 3194 btrfs_qgroup_inherit(struct btrfs_trans_handle *trans, u64 srcid, u64 objectid, u64 inode_rootid, struct btrfs_qgroup_inherit *inherit) argument [all...] |
H A D | delayed-ref.h | 37 u64 objectid; member in struct:btrfs_data_ref 397 return node->data_ref.objectid;
|
H A D | locking.c | 25 * by btrfs_root->root_key.objectid. This ensures that all special purpose 59 u64 id; /* root objectid */ 83 void btrfs_set_buffer_lockdep_class(u64 objectid, struct extent_buffer *eb, int level) argument 91 if (ks->id == objectid)
|
H A D | transaction.c | 1649 u64 objectid; local 1673 pending->error = btrfs_get_free_objectid(tree_root, &objectid); 1681 btrfs_set_skip_qgroup(trans, objectid); 1694 key.objectid = objectid; 1733 ret = btrfs_create_qgroup(trans, objectid); 1794 ret = btrfs_copy_root(trans, root, old, &tmp, objectid); 1820 ret = btrfs_add_root_ref(trans, objectid, 1830 pending->snap = btrfs_get_new_fs_root(fs_info, objectid, &pending->anon_dev); 1852 pending->inherit, objectid); [all...] |
H A D | defrag.c | 35 /* Root objectid */ 475 if (root->defrag_progress.objectid == 0) { 481 root->defrag_max.objectid = 0; 551 if (root->defrag_max.objectid > root->defrag_progress.objectid) 642 key.objectid = ino; 669 if (key.objectid == ino && key.type == BTRFS_EXTENT_DATA_KEY && 676 if (key.objectid == ino && key.type == BTRFS_EXTENT_DATA_KEY) 693 * But we should still has the correct ino as key.objectid. 695 if (WARN_ON(key.objectid < in [all...] |
H A D | xattr.c | 293 key.objectid = btrfs_ino(BTRFS_I(inode)); 314 if (found_key.objectid != key.objectid)
|
H A D | props.c | 148 u64 objectid, 182 if (key.objectid != objectid) 146 iterate_object_props(struct btrfs_root *root, struct btrfs_path *path, u64 objectid, void (*iterator)(void *, const struct prop_handler *, const char *, size_t), void *ctx) argument
|
H A D | block-group.c | 611 search_key.objectid = block_group->start + search_offset; 618 found_key->objectid >= block_group->start && 619 found_key->objectid + found_key->offset <= search_end) 623 if (found_key->objectid >= search_end) { 742 key.objectid = last; 788 if (key.objectid < last) { 789 key.objectid = last; 796 if (key.objectid < block_group->start) { 801 if (key.objectid >= block_group->start + block_group->length) 809 key.objectid, [all...] |
H A D | extent-tree.h | 120 u64 objectid, u64 offset, u64 bytenr, bool strict,
|
H A D | ctree.c | 306 * a given objectid. The buffer with the new root node is returned in 430 * tree (btrfs_header_owner(buf) == root->root_key.objectid), 434 * (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID), 760 if (k1->objectid > k2->objectid) 762 if (k1->objectid < k2->objectid) 1322 int level, int slot, u64 objectid) 1385 if (path->reada == READA_BACK && objectid) { 1387 if (btrfs_disk_key_objectid(&disk_key) != objectid) 1320 reada_for_search(struct btrfs_fs_info *fs_info, struct btrfs_path *path, int level, int slot, u64 objectid) argument [all...] |
H A D | volumes.c | 1656 key.objectid = device->devid; 1678 if (key.objectid < device->devid) 1681 if (key.objectid > device->devid) 1776 key.objectid = device->devid; 1782 ret = btrfs_previous_item(root, path, key.objectid, 1843 key.objectid = BTRFS_DEV_ITEMS_OBJECTID; 1892 key.objectid = BTRFS_DEV_ITEMS_OBJECTID; 1965 key.objectid = BTRFS_DEV_ITEMS_OBJECTID; 2580 key.objectid = BTRFS_DEV_ITEMS_OBJECTID; 2606 if (key.objectid ! [all...] |
H A D | delayed-ref.c | 312 if (ref1->data_ref.objectid < ref2->data_ref.objectid) 314 if (ref1->data_ref.objectid > ref2->data_ref.objectid) 1015 generic_ref->data_ref.objectid = ino;
|
H A D | reflink.c | 192 key.objectid = btrfs_ino(BTRFS_I(dst)); 207 if (key.objectid == btrfs_ino(BTRFS_I(dst)) && 366 key.objectid = btrfs_ino(BTRFS_I(src)); 413 key.objectid != btrfs_ino(BTRFS_I(src))) 460 new_key.objectid = btrfs_ino(BTRFS_I(inode));
|
H A D | accessors.h | 363 objectid, 64); 589 BTRFS_SETGET_STACK_FUNCS(disk_key_objectid, struct btrfs_disk_key, objectid, 64); 644 cpu->objectid = le64_to_cpu(disk->objectid); 652 disk->objectid = cpu_to_le64(cpu->objectid);
|
H A D | ctree.h | 334 return root->root_key.objectid; 718 return root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID;
|
H A D | delayed-inode.c | 731 first_key.objectid = node->inode_id; 752 ins_keys[i].objectid = node->inode_id; 889 if (key.objectid != ino || 931 key.objectid = node->inode_id; 1023 key.objectid = node->inode_id; 1056 key.objectid = node->inode_id; 1073 if (key.objectid != node->inode_id) 1815 location.objectid, d_type);
|
/linux-master/include/trace/events/ |
H A D | btrfs.h | 227 BTRFS_I(inode)->root->root_key.objectid; 302 __entry->root_objectid = root->root_key.objectid; 389 __entry->root_obj = bi->root->root_key.objectid; 440 __entry->root_obj = bi->root->root_key.objectid; 540 __entry->root_objectid = inode->root->root_key.objectid; 677 __entry->root_objectid = inode->root->root_key.objectid; 719 BTRFS_I(inode)->root->root_key.objectid; 763 __entry->root_objectid = inode->root->root_key.objectid; 794 BTRFS_I(inode)->root->root_key.objectid; 948 __entry->owner = ref->data_ref.objectid; [all...] |
/linux-master/fs/btrfs/tests/ |
H A D | free-space-tree-tests.c | 58 offset = key.objectid; 59 while (offset < key.objectid + key.offset) { 91 key.objectid != extents[i].start || 450 root->root_key.objectid = BTRFS_FREE_SPACE_TREE_OBJECTID;
|
/linux-master/include/uapi/linux/ |
H A D | btrfs_tree.h | 58 /* directory objectid inside the root tree */ 85 /* orphan objectid for tracking unlinked/truncated files */ 97 * extent checksums all have this objectid 112 /* dummy objectid represents multiple objectids */ 148 * [ inode objectid, BTRFS_VERITY_DESC_ITEM_KEY, offset ] 157 * [ inode objectid, BTRFS_VERITY_MERKLE_ITEM_KEY, offset ] 453 * objectid corresponds to the inode number. 467 __le64 objectid; member in struct:btrfs_disk_key 473 __u64 objectid; member in struct:btrfs_key 638 /* objectid o 826 __le64 objectid; member in struct:btrfs_extent_data_ref [all...] |