Home
last modified time | relevance | path

Searched refs:btrfs_item (Results 1 - 25 of 28) sorted by relevance

12

/kernel/linux/linux-6.6/fs/btrfs/
H A Daccessors.h435 /* struct btrfs_item */
436 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 *ite
[all...]
H A Dctree.c75 * the leaf. The btrfs_item offset's start directly after the header, so we
98 * the leaf. The btrfs_item offset's start directly after the header, so we
127 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()
2067 * accounts the size btrfs_item, deduct it here so leaf space in search_leaf()
2071 ASSERT(ins_len >= sizeof(struct btrfs_item)); in search_leaf()
2072 ins_len -= sizeof(struct btrfs_item); in search_leaf()
2107 * sizeof(struct btrfs_item), then p->search_for_extension must
3202 data_len += sizeof(struct btrfs_item) * n in leaf_space_used()
[all...]
H A 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()
H A Dfs.h859 sizeof(struct btrfs_item))
H A Dctree.h108 * header (ie. sizeof(struct btrfs_item) is not included).
457 return BTRFS_LEAF_DATA_SIZE(info) - sizeof(struct btrfs_item); in BTRFS_MAX_ITEM_SIZE()
H A Ddir-item.c278 sizeof(struct btrfs_item) > BTRFS_LEAF_DATA_SIZE(root->fs_info)) { in btrfs_check_dir_item_collision()
H A 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()
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.c1818 btrfs_item_nr_offset(leaf, slot) + sizeof(struct btrfs_item))) { in __btrfs_check_leaf()
1822 sizeof(struct btrfs_item), in __btrfs_check_leaf()
H A Dfile-item.c26 sizeof(struct btrfs_item) * 2) / \
/kernel/linux/linux-5.10/fs/btrfs/
H A Dctree.c1785 sizeof(struct btrfs_item), in btrfs_bin_search()
3631 struct btrfs_item *start_item; in leaf_space_used()
3632 struct btrfs_item *end_item; in leaf_space_used()
3644 data_len += sizeof(struct btrfs_item) * nr; in leaf_space_used()
3690 struct btrfs_item *item; in __push_leaf_right()
3760 right_nritems * sizeof(struct btrfs_item)); in __push_leaf_right()
3765 push_items * sizeof(struct btrfs_item)); in __push_leaf_right()
3922 struct btrfs_item *item; in __push_leaf_left()
3970 push_items * sizeof(struct btrfs_item)); in __push_leaf_left()
4012 sizeof(struct btrfs_item)); in __push_leaf_left()
[all...]
H A Dctree.h315 struct btrfs_item { struct
330 struct btrfs_item items[];
380 sizeof(struct btrfs_item))
1251 return BTRFS_LEAF_DATA_SIZE(info) - sizeof(struct btrfs_item); in BTRFS_MAX_ITEM_SIZE()
1829 /* struct btrfs_item */
1830 BTRFS_SETGET_FUNCS(item_offset, struct btrfs_item, offset, 32);
1831 BTRFS_SETGET_FUNCS(item_size, struct btrfs_item, size, 32);
1832 BTRFS_SETGET_STACK_FUNCS(stack_item_offset, struct btrfs_item, offset, 32);
1833 BTRFS_SETGET_STACK_FUNCS(stack_item_size, struct btrfs_item, size, 32);
1838 sizeof(struct btrfs_item) * n in btrfs_item_nr_offset()
[all...]
H A Ddir-item.c30 struct btrfs_item *item; in insert_with_overflow()
252 sizeof(struct btrfs_item) > BTRFS_LEAF_DATA_SIZE(root->fs_info)) { in btrfs_check_dir_item_collision()
H A Dinode-item.c263 struct btrfs_item *item; in btrfs_insert_inode_extref()
H A Dxattr.c173 struct btrfs_item *item; in btrfs_setxattr()
H A Dprint-tree.c211 struct btrfs_item *item; in btrfs_print_leaf()
H A Dcheck-integrity.c981 struct btrfs_item disk_item; in btrfsic_process_metablock()
990 if (disk_item_offset + sizeof(struct btrfs_item) > in btrfsic_process_metablock()
1001 sizeof(struct btrfs_item)); in btrfsic_process_metablock()
H A Dfree-space-tree.c35 bitmap_size = sizeof(struct btrfs_item) + BTRFS_FREE_SPACE_BITMAP_SIZE; in set_free_space_tree_thresholds()
38 sizeof(struct btrfs_item)); in set_free_space_tree_thresholds()
H A Ddelayed-inode.c723 while (total_size + next->data_len + sizeof(struct btrfs_item) <= in btrfs_batch_insert_items()
726 total_size += next->data_len + sizeof(struct btrfs_item); in btrfs_batch_insert_items()
H A Dtree-checker.c1696 if (btrfs_item_nr_offset(slot) + sizeof(struct btrfs_item) > in check_leaf()
1701 sizeof(struct btrfs_item), in check_leaf()
H A Dfile-item.c20 sizeof(struct btrfs_item) * 2) / \
H A Dbackref.c2127 struct btrfs_item *item;
H A Dfile.c990 sizeof(struct btrfs_item) + extent_item_size) { in __btrfs_drop_extents()
/kernel/linux/linux-6.6/include/uapi/linux/
H A Dbtrfs_tree.h527 struct btrfs_item { struct
542 struct btrfs_item items[];
/kernel/linux/linux-5.10/fs/btrfs/tests/
H A Dextent-buffer-tests.c18 struct btrfs_item *item; in test_btrfs_split_item()

Completed in 57 milliseconds

12