Home
last modified time | relevance | path

Searched refs:btrfs_item (Results 1 – 12 of 12) sorted by relevance

/linux-6.15/fs/btrfs/
H A Daccessors.h457 BTRFS_SETGET_FUNCS(raw_item_offset, struct btrfs_item, offset, 32);
458 BTRFS_SETGET_FUNCS(raw_item_size, struct btrfs_item, size, 32);
460 BTRFS_SETGET_STACK_FUNCS(stack_item_size, struct btrfs_item, size, 32);
465 sizeof(struct btrfs_item) * nr; in btrfs_item_nr_offset()
470 return (struct btrfs_item *)btrfs_item_nr_offset(eb, nr); in btrfs_item_nr()
486 struct btrfs_item *item = btrfs_item_nr(token->eb, slot); \
492 struct btrfs_item *item = btrfs_item_nr(token->eb, slot); \
507 struct btrfs_item *item = btrfs_item_nr(eb, nr); in btrfs_item_key()
509 read_eb_member(eb, item, struct btrfs_item, key, disk_key); in btrfs_item_key()
515 struct btrfs_item *item = btrfs_item_nr(eb, nr); in btrfs_set_item_key()
[all …]
H A Dctree.c114 nr_items * sizeof(struct btrfs_item)); in memmove_leaf_items()
135 nr_items * sizeof(struct btrfs_item)); in copy_leaf_items()
751 item_size = sizeof(struct btrfs_item); in btrfs_bin_search()
1924 ASSERT(ins_len >= sizeof(struct btrfs_item)); in search_leaf()
1925 ins_len -= sizeof(struct btrfs_item); in search_leaf()
3062 data_len += sizeof(struct btrfs_item) * nr; in leaf_space_used()
3140 if (this_item_size + sizeof(struct btrfs_item) + in __push_leaf_right()
3145 push_space += this_item_size + sizeof(struct btrfs_item); in __push_leaf_right()
3980 sizeof(struct btrfs_item)); in btrfs_split_item()
4346 item_size + sizeof(struct btrfs_item)); in btrfs_duplicate_item()
[all …]
H A Ddelayed-inode.c693 total_size = first_data_size + sizeof(struct btrfs_item); in btrfs_insert_delayed_item()
712 next_size = next->data_len + sizeof(struct btrfs_item); in btrfs_insert_delayed_item()
1499 data_len = delayed_item->data_len + sizeof(struct btrfs_item); in btrfs_insert_delayed_dir_index()
1586 const u32 data_len = item->data_len + sizeof(struct btrfs_item); in btrfs_delete_delayed_insertion_item()
H A Dctree.h495 return BTRFS_LEAF_DATA_SIZE(info) - sizeof(struct btrfs_item); in BTRFS_MAX_ITEM_SIZE()
H A Ddir-item.c272 sizeof(struct btrfs_item) > BTRFS_LEAF_DATA_SIZE(root->fs_info)) { in btrfs_check_dir_item_collision()
H A Dfs.h977 sizeof(struct btrfs_item))
H A Dfree-space-tree.c54 bitmap_size = sizeof(struct btrfs_item) + BTRFS_FREE_SPACE_BITMAP_SIZE; in set_free_space_tree_thresholds()
57 sizeof(struct btrfs_item)); in set_free_space_tree_thresholds()
H A Dtree-checker.c2066 btrfs_item_nr_offset(leaf, slot) + sizeof(struct btrfs_item))) { in __btrfs_check_leaf()
2070 sizeof(struct btrfs_item), in __btrfs_check_leaf()
H A Dfile-item.c23 sizeof(struct btrfs_item) * 2) / \
H A Dfile.c484 sizeof(struct btrfs_item) + args->extent_item_size) { in btrfs_drop_extents()
H A Dtree-log.c6096 const u32 curr_size = curr->data_len + sizeof(struct btrfs_item); in log_delayed_insertion_items()
/linux-6.15/include/uapi/linux/
H A Dbtrfs_tree.h548 struct btrfs_item { struct
563 struct btrfs_item items[]; argument