Searched refs:btrfs_item (Results 1 – 12 of 12) sorted by relevance
/linux/fs/btrfs/ |
H A D | accessors.h | 456 BTRFS_SETGET_FUNCS(raw_item_offset, struct btrfs_item, offset, 32); 457 BTRFS_SETGET_FUNCS(raw_item_size, struct btrfs_item, size, 32); 458 BTRFS_SETGET_STACK_FUNCS(stack_item_offset, struct btrfs_item, offset, 32); 459 BTRFS_SETGET_STACK_FUNCS(stack_item_size, struct btrfs_item, size, 32); 464 sizeof(struct btrfs_item) * nr; in btrfs_item_nr_offset() 467 static inline struct btrfs_item *btrfs_item_nr(const struct extent_buffer *eb, int nr) in btrfs_item_nr() 469 return (struct btrfs_item *)btrfs_item_nr_offset(eb, nr); in btrfs_item_nr() 485 struct btrfs_item *item = btrfs_item_nr(token->eb, slot); \ 491 struct btrfs_item *item = btrfs_item_nr(token->eb, slot); \ 506 struct btrfs_item *item = btrfs_item_nr(eb, nr); in btrfs_item_key() [all …]
|
H A D | ctree.c | 114 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() 3349 if (this_item_size + sizeof(struct btrfs_item) + push_space > in __push_leaf_left() 3354 push_space += this_item_size + sizeof(struct btrfs_item); in __push_leaf_left() [all …]
|
H A D | delayed-inode.c | 693 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() 1500 data_len = delayed_item->data_len + sizeof(struct btrfs_item); in btrfs_insert_delayed_dir_index() 1587 const u32 data_len = item->data_len + sizeof(struct btrfs_item); in btrfs_delete_delayed_insertion_item()
|
H A D | ctree.h | 495 return BTRFS_LEAF_DATA_SIZE(info) - sizeof(struct btrfs_item); in BTRFS_MAX_ITEM_SIZE()
|
H A D | dir-item.c | 275 sizeof(struct btrfs_item) > BTRFS_LEAF_DATA_SIZE(root->fs_info)) { in btrfs_check_dir_item_collision()
|
H A D | fs.h | 962 sizeof(struct btrfs_item))
|
H A D | free-space-tree.c | 54 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 D | tree-checker.c | 2066 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 D | file-item.c | 23 sizeof(struct btrfs_item) * 2) / \
|
H A D | file.c | 484 sizeof(struct btrfs_item) + args->extent_item_size) { in btrfs_drop_extents()
|
H A D | tree-log.c | 6118 const u32 curr_size = curr->data_len + sizeof(struct btrfs_item); in log_delayed_insertion_items()
|
/linux/include/uapi/linux/ |
H A D | btrfs_tree.h | 548 struct btrfs_item { struct 563 struct btrfs_item items[]; argument
|