Home
last modified time | relevance | path

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

/Linux-v6.6/fs/btrfs/
Daccessors.h436 BTRFS_SETGET_FUNCS(raw_item_offset, struct btrfs_item, offset, 32);
437 BTRFS_SETGET_FUNCS(raw_item_size, struct btrfs_item, size, 32);
438 BTRFS_SETGET_STACK_FUNCS(stack_item_offset, struct btrfs_item, offset, 32);
439 BTRFS_SETGET_STACK_FUNCS(stack_item_size, struct btrfs_item, size, 32);
444 sizeof(struct btrfs_item) * nr; in btrfs_item_nr_offset()
447 static inline struct btrfs_item *btrfs_item_nr(const struct extent_buffer *eb, int nr) in btrfs_item_nr()
449 return (struct btrfs_item *)btrfs_item_nr_offset(eb, nr); in btrfs_item_nr()
465 struct btrfs_item *item = btrfs_item_nr(token->eb, slot); \
471 struct btrfs_item *item = btrfs_item_nr(token->eb, slot); \
486 struct btrfs_item *item = btrfs_item_nr(eb, nr); in btrfs_item_key()
[all …]
Dctree.c127 nr_items * sizeof(struct btrfs_item)); in memmove_leaf_items()
148 nr_items * sizeof(struct btrfs_item)); in copy_leaf_items()
944 item_size = sizeof(struct btrfs_item); in btrfs_bin_search()
2071 ASSERT(ins_len >= sizeof(struct btrfs_item)); in search_leaf()
2072 ins_len -= sizeof(struct btrfs_item); in search_leaf()
3200 data_len += sizeof(struct btrfs_item) * nr; in leaf_space_used()
3278 if (this_item_size + sizeof(struct btrfs_item) + in __push_leaf_right()
3283 push_space += this_item_size + sizeof(struct btrfs_item); in __push_leaf_right()
3487 if (this_item_size + sizeof(struct btrfs_item) + push_space > in __push_leaf_left()
3492 push_space += this_item_size + sizeof(struct btrfs_item); in __push_leaf_left()
[all …]
Ddelayed-inode.c690 total_size = first_data_size + sizeof(struct btrfs_item); in btrfs_insert_delayed_item()
709 next_size = next->data_len + sizeof(struct btrfs_item); in btrfs_insert_delayed_item()
1493 data_len = delayed_item->data_len + sizeof(struct btrfs_item); in btrfs_insert_delayed_dir_index()
1581 const u32 data_len = item->data_len + sizeof(struct btrfs_item); in btrfs_delete_delayed_insertion_item()
Ddir-item.c278 sizeof(struct btrfs_item) > BTRFS_LEAF_DATA_SIZE(root->fs_info)) { in btrfs_check_dir_item_collision()
Dctree.h457 return BTRFS_LEAF_DATA_SIZE(info) - sizeof(struct btrfs_item); in BTRFS_MAX_ITEM_SIZE()
Dfs.h859 sizeof(struct btrfs_item))
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()
Dcheck-integrity.c928 struct btrfs_item disk_item; in btrfsic_process_metablock()
937 if (disk_item_offset + sizeof(struct btrfs_item) > in btrfsic_process_metablock()
949 sizeof(struct btrfs_item)); in btrfsic_process_metablock()
Dtree-checker.c1818 btrfs_item_nr_offset(leaf, slot) + sizeof(struct btrfs_item))) { in __btrfs_check_leaf()
1822 sizeof(struct btrfs_item), in __btrfs_check_leaf()
Dfile-item.c26 sizeof(struct btrfs_item) * 2) / \
Dfile.c527 sizeof(struct btrfs_item) + args->extent_item_size) { in btrfs_drop_extents()
Dtree-log.c6034 const u32 curr_size = curr->data_len + sizeof(struct btrfs_item); in log_delayed_insertion_items()
/Linux-v6.6/include/uapi/linux/
Dbtrfs_tree.h527 struct btrfs_item { struct
542 struct btrfs_item items[]; argument