Lines Matching defs:leaf
33 struct extent_buffer *leaf;
52 leaf = path->nodes[0];
55 ret = btrfs_dir_data_len(leaf, di);
60 if (btrfs_dir_data_len(leaf, di) > size) {
66 * The way things are packed into the leaf is like this
70 * where the data starts in the in memory leaf
73 btrfs_dir_name_len(leaf, di));
74 read_extent_buffer(leaf, buffer, data_ptr,
75 btrfs_dir_data_len(leaf, di));
76 ret = btrfs_dir_data_len(leaf, di);
140 * We have an existing item in a leaf, split_leaf couldn't
173 struct extent_buffer *leaf = path->nodes[0];
174 const u16 old_data_len = btrfs_dir_data_len(leaf, di);
175 const u32 item_size = btrfs_item_size(leaf, slot);
181 if (btrfs_leaf_free_space(leaf) <
189 /* No other xattrs packed in the same leaf item. */
202 ptr = btrfs_item_ptr(leaf, slot, char);
203 ptr += btrfs_item_size(leaf, slot) - data_size;
205 btrfs_set_dir_data_len(leaf, di, size);
207 write_extent_buffer(leaf, value, data_ptr, size);
208 btrfs_mark_buffer_dirty(trans, leaf);
304 struct extent_buffer *leaf;
310 leaf = path->nodes[0];
321 di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item);
322 item_size = btrfs_item_size(leaf, slot);
325 u16 name_len = btrfs_dir_name_len(leaf, di);
326 u16 data_len = btrfs_dir_data_len(leaf, di);
343 read_extent_buffer(leaf, buffer, name_ptr, name_len);