Lines Matching defs:leaf
29 struct extent_buffer *leaf;
48 leaf = path->nodes[0];
51 ret = btrfs_dir_data_len(leaf, di);
56 if (btrfs_dir_data_len(leaf, di) > size) {
62 * The way things are packed into the leaf is like this
66 * where the data starts in the in memory leaf
69 btrfs_dir_name_len(leaf, di));
70 read_extent_buffer(leaf, buffer, data_ptr,
71 btrfs_dir_data_len(leaf, di));
72 ret = btrfs_dir_data_len(leaf, di);
136 * We have an existing item in a leaf, split_leaf couldn't
169 struct extent_buffer *leaf = path->nodes[0];
170 const u16 old_data_len = btrfs_dir_data_len(leaf, di);
171 const u32 item_size = btrfs_item_size_nr(leaf, slot);
178 if (btrfs_leaf_free_space(leaf) <
186 /* No other xattrs packed in the same leaf item. */
200 ptr = btrfs_item_ptr(leaf, slot, char);
201 ptr += btrfs_item_size(leaf, item) - data_size;
203 btrfs_set_dir_data_len(leaf, di, size);
205 write_extent_buffer(leaf, value, data_ptr, size);
206 btrfs_mark_buffer_dirty(leaf);
303 struct extent_buffer *leaf;
310 leaf = path->nodes[0];
314 if (slot >= btrfs_header_nritems(leaf)) {
316 * if we've reached the last slot in this leaf we need
317 * to go to the next leaf and reset everything
327 btrfs_item_key_to_cpu(leaf, &found_key, slot);
337 di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item);
338 item_size = btrfs_item_size_nr(leaf, slot);
341 u16 name_len = btrfs_dir_name_len(leaf, di);
342 u16 data_len = btrfs_dir_data_len(leaf, di);
359 read_extent_buffer(leaf, buffer, name_ptr, name_len);