Searched defs:leaf (Results 1 - 25 of 40) sorted by relevance

12

/fs/btrfs/tests/
H A Dinode-tests.c32 struct extent_buffer *leaf = root->node; local
40 path.nodes[0] = leaf;
49 fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
50 btrfs_set_file_extent_generation(leaf, fi, 1);
51 btrfs_set_file_extent_type(leaf, fi, type);
52 btrfs_set_file_extent_disk_bytenr(leaf, fi, disk_bytenr);
53 btrfs_set_file_extent_disk_num_bytes(leaf, fi, disk_len);
54 btrfs_set_file_extent_offset(leaf, fi, offset);
55 btrfs_set_file_extent_num_bytes(leaf, fi, len);
56 btrfs_set_file_extent_ram_bytes(leaf, f
65 struct extent_buffer *leaf = root->node; local
[all...]
H A Dqgroup-tests.c41 struct extent_buffer *leaf; local
66 leaf = path->nodes[0];
67 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
68 btrfs_set_extent_refs(leaf, item, 1);
69 btrfs_set_extent_generation(leaf, item, 1);
70 btrfs_set_extent_flags(leaf, item, BTRFS_EXTENT_FLAG_TREE_BLOCK);
72 btrfs_set_tree_block_level(leaf, block_info, 1);
75 btrfs_set_extent_inline_ref_type(leaf, iref,
77 btrfs_set_extent_inline_ref_offset(leaf, iref, parent);
79 btrfs_set_extent_inline_ref_type(leaf, ire
[all...]
/fs/btrfs/
H A Duuid-tree.c266 struct extent_buffer *leaf; local
291 leaf = path->nodes[0];
293 btrfs_item_key_to_cpu(leaf, &key, slot);
299 offset = btrfs_item_ptr_offset(leaf, slot);
300 item_size = btrfs_item_size_nr(leaf, slot);
313 read_extent_buffer(leaf, &subid_le, offset,
H A Dxattr.c40 struct extent_buffer *leaf; local
59 leaf = path->nodes[0];
62 ret = btrfs_dir_data_len(leaf, di);
67 if (btrfs_dir_data_len(leaf, di) > size) {
73 * The way things are packed into the leaf is like this
77 * where the data starts in the in memory leaf
80 btrfs_dir_name_len(leaf, di));
81 read_extent_buffer(leaf, buffer, data_ptr,
82 btrfs_dir_data_len(leaf, di));
83 ret = btrfs_dir_data_len(leaf, d
227 struct extent_buffer *leaf; local
[all...]
H A Ddir-item.c48 struct extent_buffer *leaf; local
60 leaf = path->nodes[0];
62 ptr = btrfs_item_ptr(leaf, path->slots[0], char);
63 BUG_ON(data_size > btrfs_item_size(leaf, item));
64 ptr += btrfs_item_size(leaf, item) - data_size;
83 struct extent_buffer *leaf; local
99 leaf = path->nodes[0];
101 btrfs_set_dir_item_key(leaf, dir_item, &disk_key);
102 btrfs_set_dir_type(leaf, dir_item, BTRFS_FT_XATTR);
103 btrfs_set_dir_name_len(leaf, dir_ite
133 struct extent_buffer *leaf; local
227 struct extent_buffer *leaf; local
316 struct extent_buffer *leaf; local
395 struct extent_buffer *leaf; local
430 struct extent_buffer *leaf; local
454 verify_dir_item(struct btrfs_root *root, struct extent_buffer *leaf, struct btrfs_dir_item *dir_item) argument
[all...]
H A Dexport.c158 struct extent_buffer *leaf; local
190 leaf = path->nodes[0];
192 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
199 ref = btrfs_item_ptr(leaf, path->slots[0],
201 key.objectid = btrfs_root_ref_dirid(leaf, ref);
229 struct extent_buffer *leaf; local
272 leaf = path->nodes[0];
275 rref = btrfs_item_ptr(leaf, path->slots[0],
278 name_len = btrfs_root_ref_name_len(leaf, rref);
280 iref = btrfs_item_ptr(leaf, pat
[all...]
H A Dinode-item.c28 struct extent_buffer *leaf; local
36 leaf = path->nodes[0];
37 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
38 ptr = btrfs_item_ptr_offset(leaf, path->slots[0]);
41 len = btrfs_inode_ref_name_len(leaf, ref);
46 if (memcmp_extent_buffer(leaf, name, name_ptr, name_len) == 0) {
58 struct extent_buffer *leaf; local
66 leaf = path->nodes[0];
67 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
68 ptr = btrfs_item_ptr_offset(leaf, pat
130 struct extent_buffer *leaf; local
201 struct extent_buffer *leaf; local
281 struct extent_buffer *leaf; local
419 struct extent_buffer *leaf; local
[all...]
H A Dinode-map.c36 struct extent_buffer *leaf; local
68 leaf = path->nodes[0];
70 if (slot >= btrfs_header_nritems(leaf)) {
79 leaf = path->nodes[0];
81 if (WARN_ON(btrfs_header_nritems(leaf) == 0))
88 btrfs_item_key_to_cpu(leaf, &key, 0);
98 btrfs_item_key_to_cpu(leaf, &key, slot);
H A Dprops.c177 struct extent_buffer *leaf; local
183 leaf = path->nodes[0];
185 if (slot >= btrfs_header_nritems(leaf)) {
194 btrfs_item_key_to_cpu(leaf, &key, slot);
204 di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item);
206 total_len = btrfs_item_size_nr(leaf, slot);
209 u32 name_len = btrfs_dir_name_len(leaf, di);
210 u32 data_len = btrfs_dir_data_len(leaf, di);
219 memcmp_extent_buffer(leaf, XATTR_BTRFS_PREFIX,
233 read_extent_buffer(leaf, name_bu
[all...]
H A Droot-tree.c224 struct extent_buffer *leaf; local
254 leaf = path->nodes[0];
255 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
261 leaf = path->nodes[0];
264 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
356 struct extent_buffer *leaf; local
373 leaf = path->nodes[0];
374 ref = btrfs_item_ptr(leaf, path->slots[0],
377 WARN_ON(btrfs_root_ref_dirid(leaf, ref) != dirid);
378 WARN_ON(btrfs_root_ref_name_len(leaf, re
428 struct extent_buffer *leaf; local
[all...]
H A Dfile-item.c51 struct extent_buffer *leaf; local
66 leaf = path->nodes[0];
67 item = btrfs_item_ptr(leaf, path->slots[0],
69 btrfs_set_file_extent_disk_bytenr(leaf, item, disk_offset);
70 btrfs_set_file_extent_disk_num_bytes(leaf, item, disk_num_bytes);
71 btrfs_set_file_extent_offset(leaf, item, offset);
72 btrfs_set_file_extent_num_bytes(leaf, item, num_bytes);
73 btrfs_set_file_extent_ram_bytes(leaf, item, ram_bytes);
74 btrfs_set_file_extent_generation(leaf, item, trans->transid);
75 btrfs_set_file_extent_type(leaf, ite
96 struct extent_buffer *leaf; local
312 struct extent_buffer *leaf; local
521 struct extent_buffer *leaf; local
573 struct extent_buffer *leaf; local
692 struct extent_buffer *leaf = NULL; local
886 struct extent_buffer *leaf = path->nodes[0]; local
[all...]
H A Ddelayed-inode.c716 * This helper will insert some continuous items into the same leaf according
717 * to the free space of the leaf.
726 struct extent_buffer *leaf; local
738 leaf = path->nodes[0];
739 free_space = btrfs_leaf_free_space(root, leaf);
806 data_ptr = btrfs_item_ptr(leaf, slot, char);
807 write_extent_buffer(leaf, &curr->data,
834 struct extent_buffer *leaf; local
843 leaf = path->nodes[0];
845 ptr = btrfs_item_ptr(leaf, pat
904 struct extent_buffer *leaf; local
1040 struct extent_buffer *leaf; local
[all...]
H A Dqgroup.c539 struct extent_buffer *leaf; local
564 leaf = path->nodes[0];
565 qgroup_info = btrfs_item_ptr(leaf, path->slots[0],
567 btrfs_set_qgroup_info_generation(leaf, qgroup_info, trans->transid);
568 btrfs_set_qgroup_info_rfer(leaf, qgroup_info, 0);
569 btrfs_set_qgroup_info_rfer_cmpr(leaf, qgroup_info, 0);
570 btrfs_set_qgroup_info_excl(leaf, qgroup_info, 0);
571 btrfs_set_qgroup_info_excl_cmpr(leaf, qgroup_info, 0);
573 btrfs_mark_buffer_dirty(leaf);
583 leaf
783 struct extent_buffer *leaf = NULL; local
831 struct extent_buffer *leaf; local
[all...]
H A Dbackref.c95 * from the shared data ref, we only have the leaf but we need
251 * slot==nritems. In that case, go to the next leaf before we continue.
685 struct extent_buffer *leaf; local
697 leaf = path->nodes[0];
700 item_size = btrfs_item_size_nr(leaf, slot);
703 ei = btrfs_item_ptr(leaf, slot, struct btrfs_extent_item);
704 flags = btrfs_extent_flags(leaf, ei);
705 *total_refs += btrfs_extent_refs(leaf, ei);
706 btrfs_item_key_to_cpu(leaf, &found_key, slot);
716 *info_level = btrfs_tree_block_level(leaf, inf
798 struct extent_buffer *leaf; local
975 struct extent_buffer *leaf; local
1277 struct extent_buffer *leaf; local
1781 struct extent_buffer *leaf; local
[all...]
H A Dfile.c703 struct extent_buffer *leaf; local
738 leaf = path->nodes[0];
739 btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1);
747 leaf = path->nodes[0];
748 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
758 leaf = path->nodes[0];
762 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
767 fi = btrfs_item_ptr(leaf, path->slots[0],
769 extent_type = btrfs_file_extent_type(leaf, fi);
773 disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, f
1029 extent_mergeable(struct extent_buffer *leaf, int slot, u64 objectid, u64 bytenr, u64 orig_offset, u64 *start, u64 *end) argument
1073 struct extent_buffer *leaf; local
2095 hole_mergeable(struct inode *inode, struct extent_buffer *leaf, int slot, u64 start, u64 end) argument
2128 struct extent_buffer *leaf; local
[all...]
H A Dfree-space-cache.c47 struct extent_buffer *leaf; local
63 leaf = path->nodes[0];
64 header = btrfs_item_ptr(leaf, path->slots[0],
66 btrfs_free_space_key(leaf, header, &disk_key);
132 struct extent_buffer *leaf; local
144 leaf = path->nodes[0];
145 inode_item = btrfs_item_ptr(leaf, path->slots[0],
147 btrfs_item_key(leaf, &disk_key, path->slots[0]);
148 memset_extent_buffer(leaf, 0, (unsigned long)inode_item,
150 btrfs_set_inode_generation(leaf, inode_ite
643 struct extent_buffer *leaf; local
933 struct extent_buffer *leaf; local
[all...]
/fs/xfs/
H A Dxfs_attr_inactive.c117 * leaf block.
127 struct xfs_attr_leafblock *leaf; local
139 leaf = bp->b_addr;
140 xfs_attr3_leaf_hdr_from_disk(&ichdr, leaf);
146 entry = xfs_attr3_leaf_entryp(leaf);
150 name_rmt = xfs_attr3_leaf_name_remote(leaf, i);
174 entry = xfs_attr3_leaf_entryp(leaf);
178 name_rmt = xfs_attr3_leaf_name_remote(leaf, i);
349 * Invalidate the tree, even if the "tree" is only a single leaf block.
H A Dxfs_attr_list.c223 xfs_attr_leafblock_t *leaf; local
261 leaf = bp->b_addr;
262 xfs_attr3_leaf_hdr_from_disk(&leafhdr, leaf);
263 entries = xfs_attr3_leaf_entryp(leaf);
287 * Note that start of node block is same as start of leaf block.
335 * Roll upward through the blocks, processing each leaf block in
340 leaf = bp->b_addr;
346 xfs_attr3_leaf_hdr_from_disk(&leafhdr, leaf);
360 * Copy out attribute list entries for attr_list(), for leaf attribute lists.
368 struct xfs_attr_leafblock *leaf; local
[all...]
/fs/xfs/libxfs/
H A Dxfs_alloc_btree.c149 * If this is the last leaf block and it's the last record,
497 int leaf)
501 if (leaf)
494 xfs_allocbt_maxrecs( struct xfs_mount *mp, int blocklen, int leaf) argument
H A Dxfs_ialloc_btree.c415 int leaf)
419 if (leaf)
412 xfs_inobt_maxrecs( struct xfs_mount *mp, int blocklen, int leaf) argument
H A Dxfs_bmap_btree.c820 int leaf)
824 if (leaf)
835 int leaf)
839 if (leaf)
817 xfs_bmbt_maxrecs( struct xfs_mount *mp, int blocklen, int leaf) argument
833 xfs_bmdr_maxrecs( int blocklen, int leaf) argument
H A Dxfs_dir2_block.c191 * If there are stale entries we'll use one for the leaf.
205 * Tag just before the first leaf entry.
210 /* Data object just before the first leaf entry. */
215 * leaf data starts now, if it works at all.
230 * Tag just before the first leaf entry.
234 /* Data object just before the first leaf entry. */
239 * the space before the first leaf entry needs to be free so it
258 * It is the biggest freespace, can it hold the leaf too?
278 * compact the leaf entries.
293 int fromidx; /* source leaf inde
921 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
[all...]
H A Dxfs_dir2_leaf.c65 struct xfs_dir2_leaf *leaf = bp->b_addr; local
68 dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf);
77 return xfs_dir3_leaf_check_int(dp->i_mount, dp, &leafhdr, leaf);
88 struct xfs_dir2_leaf *leaf)
105 ops->leaf_hdr_from_disk(&leafhdr, leaf);
109 ents = ops->leaf_ents_p(leaf);
110 ltp = xfs_dir2_leaf_tail_p(geo, leaf);
120 /* Leaves and bests don't overlap in leaf format. */
142 * We verify the magic numbers before decoding the leaf header so that on debug
152 struct xfs_dir2_leaf *leaf local
84 xfs_dir3_leaf_check_int( struct xfs_mount *mp, struct xfs_inode *dp, struct xfs_dir3_icleaf_hdr *hdr, struct xfs_dir2_leaf *leaf) argument
301 struct xfs_dir2_leaf *leaf = bp->b_addr; local
385 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
622 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
920 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
1066 struct xfs_dir2_leaf *leaf = bp->b_addr; local
1092 struct xfs_dir2_leaf *leaf = bp->b_addr; local
1116 struct xfs_dir2_leaf *leaf = bp->b_addr; local
1136 struct xfs_dir2_leaf *leaf = bp->b_addr; local
1164 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
1225 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
1356 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
1500 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
1553 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
1608 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
1696 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
[all...]
H A Dxfs_dir2_node.c68 struct xfs_dir2_leaf *leaf = bp->b_addr; local
71 dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf);
80 return xfs_dir3_leaf_check_int(dp->i_mount, dp, &leafhdr, leaf);
282 * Convert a leaf-format directory to a node-format directory.
283 * We need to change the magic number of the leaf block, and copy
284 * the freespace table out of the leaf block into its own block.
289 struct xfs_buf *lbp) /* leaf buffer */
297 int i; /* leaf freespace index */
298 xfs_dir2_leaf_t *leaf; /* leaf structur local
385 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
493 struct xfs_dir2_leaf *leaf = bp->b_addr; local
530 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
683 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
1169 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
1398 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
2147 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
[all...]
/fs/jfs/
H A Djfs_dtree.h32 } leaf; member in union:__anon272
81 * leaf node entry head/only segment
114 u8 slot; /* 1: slot within leaf page of entry */
115 u8 addr1; /* 1: upper 8 bits of leaf page address */
116 __le32 addr2; /* 4: lower 32 bits of leaf page address -OR-

Completed in 217 milliseconds

12