Searched refs:leaf (Results 51 - 75 of 174) sorted by relevance

1234567

/linux-master/lib/
H A Dbootconfig.c334 * xbc_node_find_next_leaf() - Find the next leaf node under given node
338 * Search the next leaf node (which means the terminal key node) of @node
340 * Return the next node or NULL if next leaf node is not found.
362 if (node == root) /* @root was a leaf, no child node. */
386 * @leaf: A container pointer of XBC node which starts from.
388 * Search the next leaf node (which means the terminal key node) of *@leaf
389 * under @root node. Returns the value and update *@leaf if next leaf node
390 * is found, or NULL if no next leaf nod
394 xbc_node_find_next_key_value(struct xbc_node *root, struct xbc_node **leaf) argument
[all...]
/linux-master/fs/btrfs/
H A Dref-verify.c387 struct extent_buffer *leaf,
394 u64 ref_root = btrfs_extent_data_ref_root(leaf, dref);
395 u64 owner = btrfs_extent_data_ref_objectid(leaf, dref);
396 u64 offset = btrfs_extent_data_ref_offset(leaf, dref);
397 u32 num_refs = btrfs_extent_data_ref_count(leaf, dref);
440 struct extent_buffer *leaf = path->nodes[0]; local
441 u32 item_size = btrfs_item_size(leaf, slot);
446 ei = btrfs_item_ptr(leaf, slot, struct btrfs_extent_item);
447 flags = btrfs_extent_flags(leaf, ei);
454 *tree_block_level = btrfs_tree_block_level(leaf, inf
386 add_extent_data_ref(struct btrfs_fs_info *fs_info, struct extent_buffer *leaf, struct btrfs_extent_data_ref *dref, u64 bytenr, u64 num_bytes) argument
508 struct extent_buffer *leaf = path->nodes[0]; local
[all...]
H A Dvolumes.c1769 struct extent_buffer *leaf = NULL; local
1786 leaf = path->nodes[0];
1787 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
1788 extent = btrfs_item_ptr(leaf, path->slots[0],
1791 btrfs_dev_extent_length(leaf, extent) < start);
1796 leaf = path->nodes[0];
1797 extent = btrfs_item_ptr(leaf, path->slots[0],
1803 *dev_extent_len = btrfs_dev_extent_length(leaf, extent);
1884 struct extent_buffer *leaf; local
1903 leaf
2568 struct extent_buffer *leaf; local
2891 struct extent_buffer *leaf; local
3427 struct extent_buffer *leaf; local
3596 struct extent_buffer *leaf; local
3815 chunk_devid_filter(struct extent_buffer *leaf, struct btrfs_chunk *chunk, struct btrfs_balance_args *bargs) argument
3842 chunk_drange_filter(struct extent_buffer *leaf, struct btrfs_chunk *chunk, struct btrfs_balance_args *bargs) argument
3878 chunk_vrange_filter(struct extent_buffer *leaf, struct btrfs_chunk *chunk, u64 chunk_offset, struct btrfs_balance_args *bargs) argument
3891 chunk_stripes_range_filter(struct extent_buffer *leaf, struct btrfs_chunk *chunk, struct btrfs_balance_args *bargs) argument
3919 should_balance_chunk(struct extent_buffer *leaf, struct btrfs_chunk *chunk, u64 chunk_offset) argument
4017 struct extent_buffer *leaf; local
4642 struct extent_buffer *leaf; local
7048 read_one_chunk(struct btrfs_key *key, struct extent_buffer *leaf, struct btrfs_chunk *chunk) argument
7152 fill_device_from_item(struct extent_buffer *leaf, struct btrfs_dev_item *dev_item, struct btrfs_device *device) argument
7229 read_one_dev(struct extent_buffer *leaf, struct btrfs_dev_item *dev_item) argument
7516 struct extent_buffer *leaf; local
8159 struct extent_buffer *leaf = path->nodes[0]; local
[all...]
H A Duuid-tree.c298 struct extent_buffer *leaf; local
327 leaf = path->nodes[0];
329 btrfs_item_key_to_cpu(leaf, &key, slot);
335 offset = btrfs_item_ptr_offset(leaf, slot);
336 item_size = btrfs_item_size(leaf, slot);
350 read_extent_buffer(leaf, &subid_le, offset,
H A Dreflink.c254 * If we end up here it means were copy the inline extent into a leaf
315 * write to the same leaf or an ordered extent completion needs to write
316 * to the same leaf.
342 struct extent_buffer *leaf; local
408 leaf = path->nodes[0];
411 btrfs_item_key_to_cpu(leaf, &key, slot);
418 extent = btrfs_item_ptr(leaf, slot,
420 extent_gen = btrfs_file_extent_generation(leaf, extent);
421 comp = btrfs_file_extent_compression(leaf, extent);
422 type = btrfs_file_extent_type(leaf, exten
[all...]
H A Dtree-log.c390 * we'll have to clone the leaf in the path, release the path and use
391 * the leaf before writing into the log tree. See the comments at
682 struct extent_buffer *leaf; local
684 leaf = path->nodes[0];
685 existing = btrfs_item_ptr(leaf, path->slots[0],
690 read_extent_buffer(leaf, &cmp2, (unsigned long)existing,
934 struct extent_buffer *leaf; local
938 leaf = path->nodes[0];
940 btrfs_dir_item_key_to_cpu(leaf, di, &location);
941 ret = read_alloc_one_name(leaf, d
1060 struct extent_buffer *leaf; local
1497 struct extent_buffer *leaf; local
4169 fill_inode_item(struct btrfs_trans_handle *trans, struct extent_buffer *leaf, struct btrfs_inode_item *item, struct inode *inode, int log_inode_only, u64 logged_isize) argument
4688 struct extent_buffer *leaf; local
4782 struct extent_buffer *leaf; local
5073 struct extent_buffer *leaf = path->nodes[0]; local
5149 struct extent_buffer *leaf = path->nodes[0]; local
5473 struct extent_buffer *leaf = path->nodes[0]; local
6186 struct extent_buffer *leaf = path->nodes[0]; local
6748 struct extent_buffer *leaf = path->nodes[0]; local
6856 struct extent_buffer *leaf; local
6981 struct extent_buffer *leaf = path->nodes[0]; local
[all...]
H A Drelocation.c958 struct extent_buffer *leaf; local
975 leaf = path->nodes[0];
976 fi = btrfs_item_ptr(leaf, path->slots[0],
979 BUG_ON(btrfs_file_extent_offset(leaf, fi) ||
980 btrfs_file_extent_compression(leaf, fi) ||
981 btrfs_file_extent_encryption(leaf, fi) ||
982 btrfs_file_extent_other_encoding(leaf, fi));
984 if (num_bytes != btrfs_file_extent_disk_num_bytes(leaf, fi)) {
989 *new_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
997 * update file extent items in the tree leaf t
1001 replace_file_extents(struct btrfs_trans_handle *trans, struct reloc_control *rc, struct btrfs_root *root, struct extent_buffer *leaf) argument
1666 struct extent_buffer *leaf; local
3401 delete_v1_space_cache(struct extent_buffer *leaf, struct btrfs_block_group *block_group, u64 data_bytenr) argument
3497 struct extent_buffer *leaf; local
3828 struct extent_buffer *leaf; local
4221 struct extent_buffer *leaf; local
[all...]
H A Dinode.c303 (ref_level ? "node" : "leaf"),
519 struct extent_buffer *leaf; local
562 leaf = path->nodes[0];
563 ei = btrfs_item_ptr(leaf, path->slots[0],
565 btrfs_set_file_extent_generation(leaf, ei, trans->transid);
566 btrfs_set_file_extent_type(leaf, ei, BTRFS_FILE_EXTENT_INLINE);
567 btrfs_set_file_extent_encryption(leaf, ei, 0);
568 btrfs_set_file_extent_other_encoding(leaf, ei, 0);
569 btrfs_set_file_extent_ram_bytes(leaf, ei, size);
574 write_extent_buffer(leaf, kadd
1877 struct extent_buffer *leaf = path->nodes[0]; local
2021 struct extent_buffer *leaf; local
2924 struct extent_buffer *leaf; local
3523 struct extent_buffer *leaf; local
3721 acls_after_inode_item(struct extent_buffer *leaf, int slot, u64 objectid, int *first_xattr_slot) argument
3792 struct extent_buffer *leaf; local
3986 fill_inode_item(struct btrfs_trans_handle *trans, struct extent_buffer *leaf, struct btrfs_inode_item *item, struct inode *inode) argument
4040 struct extent_buffer *leaf; local
4293 struct extent_buffer *leaf; local
5438 struct extent_buffer *leaf; local
5788 struct extent_buffer *leaf; local
5961 struct extent_buffer *leaf = path->nodes[0]; local
6718 struct extent_buffer *leaf = path->nodes[0]; local
6809 struct extent_buffer *leaf; local
7108 struct extent_buffer *leaf; local
9359 struct extent_buffer *leaf; local
9794 struct extent_buffer *leaf; local
[all...]
H A Dioctl.c602 struct extent_buffer *leaf; local
675 leaf = btrfs_alloc_tree_block(trans, root, 0, objectid, NULL, 0, 0, 0,
677 if (IS_ERR(leaf)) {
678 ret = PTR_ERR(leaf);
682 btrfs_mark_buffer_dirty(trans, leaf);
696 btrfs_set_root_bytenr(root_item, leaf->start);
700 btrfs_set_root_used(root_item, leaf->len);
712 btrfs_tree_unlock(leaf);
729 btrfs_tree_lock(leaf);
730 btrfs_clear_buffer_dirty(trans, leaf);
1578 struct extent_buffer *leaf; local
1931 struct extent_buffer *leaf; local
2171 struct extent_buffer *leaf; local
2289 struct extent_buffer *leaf; local
[all...]
/linux-master/tools/testing/selftests/drivers/net/mlxsw/
H A Dsch_offload.sh193 local leaf
197 for leaf in "" red tbf "red tbf" "tbf red"; do
199 if [[ -z "$cont$leaf$fifo" ]]; then
203 $cont $leaf $fifo
209 for leaf in red tbf; do
210 do_test_nooffload $handle $parent $cont red tbf $leaf
211 do_test_nooffload $handle $parent $cont tbf red $leaf
213 for leaf in "red red" "tbf tbf"; do
214 do_test_nooffload $handle $parent $cont $leaf
/linux-master/net/sched/
H A Dsch_htb.c90 /* interior & leaf nodes; props specific to leaves are marked L:
101 int quantum; /* but stored for parent-to-leaf return */
128 } leaf; member in union:htb_class::__anon3448
211 * should be passed directly thru. In all other cases leaf class is returned.
216 * have no valid leaf we try to use MAJOR:default leaf. It still unsuccessful
238 /* Start with inner filter chain if a non-leaf class is selected */
266 return cl; /* we hit leaf; return it */
584 * htb_activate - inserts leaf cl into appropriate active feeds
588 * Routine learns (new) priority of leaf an
[all...]
/linux-master/fs/xfs/scrub/
H A Dattr.c47 * Allocate the free space bitmap if we're trying harder; there are leaf blocks
48 * in the attr fork; or we can't tell if there are leaf blocks.
291 * Check the leaf freemap from the usage bitmap. Returns false if the
317 * Check this leaf entry's relations to everything else.
325 struct xfs_attr_leafblock *leaf,
357 lentry = xfs_attr3_leaf_name_local(leaf, idx);
364 rentry = xfs_attr3_leaf_name_remote(leaf, idx);
379 /* Scrub an attribute leaf. */
390 struct xfs_attr_leafblock *leaf = bp->b_addr; local
415 if (leaf
321 xchk_xattr_entry( struct xchk_da_btree *ds, int level, char *buf_end, struct xfs_attr_leafblock *leaf, struct xfs_attr3_icleaf_hdr *leafhdr, struct xfs_attr_leaf_entry *ent, int idx, unsigned int *usedbytes, __u32 *last_hashval) argument
[all...]
H A Drcbag_btree.c243 bool leaf)
245 if (leaf)
258 bool leaf)
261 return rcbagbt_block_maxrecs(blocklen, leaf);
241 rcbagbt_block_maxrecs( unsigned int blocklen, bool leaf) argument
255 rcbagbt_maxrecs( struct xfs_mount *mp, unsigned int blocklen, bool leaf) argument
H A Drcbag_btree.h55 bool leaf);
/linux-master/fs/xfs/
H A Dxfs_attr_list.c315 struct xfs_attr_leafblock *leaf; local
360 leaf = bp->b_addr;
370 &leafhdr, leaf);
371 entries = xfs_attr3_leaf_entryp(leaf);
394 * Note that start of node block is same as start of leaf block.
405 * Roll upward through the blocks, processing each leaf block in
410 leaf = bp->b_addr;
414 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &leafhdr, leaf);
429 * Copy out attribute list entries for attr_list(), for leaf attribute lists.
437 struct xfs_attr_leafblock *leaf; local
[all...]
H A Dxfs_attr_inactive.c78 * leaf block.
90 struct xfs_attr_leafblock *leaf = bp->b_addr; local
96 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, leaf);
99 * Find the remote value extents for this leaf and invalidate their
102 entry = xfs_attr3_leaf_entryp(leaf);
109 name_rmt = xfs_attr3_leaf_name_remote(leaf, i);
278 * Invalidate the tree, even if the "tree" is only a single leaf block.
/linux-master/fs/xfs/libxfs/
H A Dxfs_bmap_btree.h101 extern int xfs_bmdr_maxrecs(int blocklen, int leaf);
102 extern int xfs_bmbt_maxrecs(struct xfs_mount *, int blocklen, int leaf);
H A Dxfs_refcount_btree.h51 extern int xfs_refcountbt_maxrecs(int blocklen, bool leaf);
H A Dxfs_rmap_btree.h50 int xfs_rmapbt_maxrecs(int blocklen, int leaf);
/linux-master/drivers/md/persistent-data/
H A Ddm-array.h81 * vt - describes the leaf values.
181 int (*fn)(void *context, uint64_t key, void *leaf),
/linux-master/arch/x86/kvm/
H A Dcpuid.h62 unsigned int leaf)
64 u32 *reg = cpuid_entry_get_reg(entry, leaf * 32);
66 BUILD_BUG_ON(leaf >= ARRAY_SIZE(kvm_cpu_caps));
67 *reg = kvm_cpu_caps[leaf];
61 cpuid_entry_override(struct kvm_cpuid_entry2 *entry, unsigned int leaf) argument
/linux-master/fs/btrfs/tests/
H A Dinode-tests.c22 struct extent_buffer *leaf = root->node; local
30 path.nodes[0] = leaf;
42 fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
43 btrfs_set_file_extent_generation(leaf, fi, 1);
44 btrfs_set_file_extent_type(leaf, fi, type);
45 btrfs_set_file_extent_disk_bytenr(leaf, fi, disk_bytenr);
46 btrfs_set_file_extent_disk_num_bytes(leaf, fi, disk_len);
47 btrfs_set_file_extent_offset(leaf, fi, offset);
48 btrfs_set_file_extent_num_bytes(leaf, fi, len);
49 btrfs_set_file_extent_ram_bytes(leaf, f
58 struct extent_buffer *leaf = root->node; local
[all...]
/linux-master/ipc/
H A Dmqueue.c194 struct posix_msg_tree_node *leaf; local
200 leaf = rb_entry(parent, struct posix_msg_tree_node, rb_node);
202 if (likely(leaf->priority == msg->m_type))
204 else if (msg->m_type < leaf->priority) {
211 leaf = info->node_cache;
214 leaf = kmalloc(sizeof(*leaf), GFP_ATOMIC);
215 if (!leaf)
217 INIT_LIST_HEAD(&leaf->msg_list);
219 leaf
233 msg_tree_erase(struct posix_msg_tree_node *leaf, struct mqueue_inode_info *info) argument
251 struct posix_msg_tree_node *leaf; local
[all...]
/linux-master/scripts/
H A Dget_abi.pl563 my %leaf;
720 if (!defined($leaf{$leave})) {
723 my @expr = @{$leaf{$leave}->{expr}};
724 die ("\rmissing rules for $leave") if (!defined($leaf{$leave}));
751 my @expr = @{$leaf{"others"}->{expr}};
765 my $what = $leaf{$leave}->{what};
838 $leaf{"others"}->{what} = "";
909 if (defined($leaf{$l})) {
910 next if ($leaf{$l}->{what} =~ m/\b$what\b/);
911 $leaf{
[all...]
/linux-master/include/linux/
H A Dbootconfig.h109 * xbc_node_is_leaf() - Test the node is a leaf key node
112 * Test the @node is a leaf key node which is a key node and has a value node
113 * or no child. Returns true if it is a leaf node, or false if not.
114 * Note that the leaf node can have subkey nodes in addition to the
132 struct xbc_node *leaf);
135 struct xbc_node **leaf);

Completed in 496 milliseconds

1234567