/linux-master/drivers/base/ |
H A D | arch_topology.c | 538 bool leaf = true; local 547 leaf = false; 566 if (!leaf) { 575 } else if (leaf && cpu != -ENODEV) { 576 pr_err("%pOF: Can't get CPU for leaf core\n", core); 587 bool leaf = true; local 603 leaf = false; 629 if (leaf) { 633 pr_err("%pOF: Non-leaf cluster with core %s\n", 645 if (leaf [all...] |
/linux-master/include/linux/ |
H A D | assoc_array_priv.h | 37 * (2) A leaf object (pointer types 0). 79 struct assoc_array_ptr *leaf; member in struct:assoc_array_edit 109 #define ASSOC_ARRAY_PTR_LEAF_TYPE 0x0UL /* Points to leaf (or nowhere) */
|
/linux-master/net/ipv4/ |
H A D | fib_trie.c | 128 struct hlist_head leaf; member in union:key_vector::__anon2956 212 * leaf this will return 0 meaning none of the children are accessible. 237 * If n is a leaf, every bit in its key is significant. Its presence is 239 * searching for a leaf - unless we are doing an insertion) we will completely 370 /* link leaf to fib alias */ 371 INIT_HLIST_HEAD(&l->leaf); 372 hlist_add_head(&fa->fa_list, &l->leaf); 567 /* A leaf or an internal node with skipped bits */ 970 /* keep searching until we find a perfect match leaf or NULL */ 1034 hlist_for_each_entry_rcu(fa, &l->leaf, fa_lis [all...] |
/linux-master/fs/xfs/libxfs/ |
H A D | xfs_dir2_node.c | 65 struct xfs_dir2_leaf *leaf = bp->b_addr; local 68 xfs_dir2_leaf_hdr_from_disk(dp->i_mount, &leafhdr, leaf); 77 return xfs_dir3_leaf_check_int(dp->i_mount, &leafhdr, leaf, false); 406 * Convert a leaf-format directory to a node-format directory. 407 * We need to change the magic number of the leaf block, and copy 408 * the freespace table out of the leaf block into its own block. 413 struct xfs_buf *lbp) /* leaf buffer */ 420 int i; /* leaf freespace index */ 421 xfs_dir2_leaf_t *leaf; /* leaf structur local 507 struct xfs_dir2_leaf *leaf = bp->b_addr; local 647 xfs_dir2_leaf_t *leaf; /* leaf structure */ local 799 xfs_dir2_leaf_t *leaf; /* leaf structure */ local 1284 xfs_dir2_leaf_t *leaf; /* leaf structure */ local 1506 xfs_dir2_leaf_t *leaf; /* leaf structure */ local [all...] |
H A D | xfs_bmap_btree.c | 595 bool leaf) 597 if (leaf) 652 int leaf) 655 return xfs_bmbt_block_maxrecs(blocklen, leaf); 686 int leaf) 690 if (leaf) 593 xfs_bmbt_block_maxrecs( unsigned int blocklen, bool leaf) argument 649 xfs_bmbt_maxrecs( struct xfs_mount *mp, int blocklen, int leaf) argument 684 xfs_bmdr_maxrecs( int blocklen, int leaf) argument
|
H A D | xfs_rmap_btree.c | 550 bool leaf) 552 if (leaf) 718 bool leaf) 720 if (leaf) 732 int leaf) 735 return xfs_rmapbt_block_maxrecs(blocklen, leaf); 548 xfs_rmapbt_mem_block_maxrecs( unsigned int blocklen, bool leaf) argument 716 xfs_rmapbt_block_maxrecs( unsigned int blocklen, bool leaf) argument 730 xfs_rmapbt_maxrecs( int blocklen, int leaf) argument
|
H A D | xfs_refcount_btree.c | 409 bool leaf) 411 if (leaf) 423 bool leaf) 426 return xfs_refcountbt_block_maxrecs(blocklen, leaf); 407 xfs_refcountbt_block_maxrecs( unsigned int blocklen, bool leaf) argument 421 xfs_refcountbt_maxrecs( int blocklen, bool leaf) argument
|
H A D | xfs_attr_leaf.h | 19 * Incore version of the attribute leaf header. 76 int xfs_attr3_leaf_lookup_int(struct xfs_buf *leaf,
|
/linux-master/fs/jfs/ |
H A D | jfs_dmap.c | 1087 s8 *leaf; local 1097 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx); 1111 /* check if the starting leaf indicates that anything 1114 if (leaf[word] == NOFREE) 1126 * single leaf may describe the free space of multiple dmap 1159 /* does the leaf describe any free space ? 1161 if (leaf[word] < BUDMIN) 1165 * by this leaf. 1168 min_t(int, leaf[word], NLSTOL2BSZ(nwords)); 1192 * starting with the dmap leaf tha 1218 s8 *leaf; local 2143 s8 *leaf; local 2628 s8 *leaf = tp->dmt_stree + le32_to_cpu(tp->dmt_leafidx); local 2693 s8 *leaf = tp->dmt_stree + le32_to_cpu(tp->dmt_leafidx); local 2771 s8 *leaf; local [all...] |
H A D | jfs_dtree.h | 19 } leaf; member in union:__anon1208 68 * leaf node entry head/only segment 101 u8 slot; /* 1: slot within leaf page of entry */ 102 u8 addr1; /* 1: upper 8 bits of leaf page address */ 103 __le32 addr2; /* 4: lower 32 bits of leaf page address -OR-
|
/linux-master/fs/btrfs/ |
H A D | free-space-cache.c | 90 struct extent_buffer *leaf; local 107 leaf = path->nodes[0]; 108 header = btrfs_item_ptr(leaf, path->slots[0], 110 btrfs_free_space_key(leaf, header, &disk_key); 175 struct extent_buffer *leaf; local 185 leaf = path->nodes[0]; 186 inode_item = btrfs_item_ptr(leaf, path->slots[0], 188 btrfs_item_key(leaf, &disk_key, path->slots[0]); 189 memzero_extent_buffer(leaf, (unsigned long)inode_item, 191 btrfs_set_inode_generation(leaf, inode_ite 742 struct extent_buffer *leaf; local 1156 struct extent_buffer *leaf; local [all...] |
H A D | send.c | 92 * cloning roots that lead down to a leaf is more than 17. 104 * A backref cache entry maps a leaf to a list of IDs of roots from which the 105 * leaf is accessible and we can use for clone operations. 1138 * space, which can happen for xattrs on a fs with a leaf size greater 1499 * backref walking to determine which roots have a path to the leaf. 1523 const struct extent_buffer *leaf, void *ctx) 1525 const u64 refs = btrfs_extent_refs(leaf, ei); 1530 const u64 flags = btrfs_extent_flags(leaf, ei); 1671 * ranges can't overlap and in case the leaf is shared through a subtree 2520 struct extent_buffer *leaf; local 1522 check_extent_item(u64 bytenr, const struct btrfs_extent_item *ei, const struct extent_buffer *leaf, void *ctx) argument 3918 struct extent_buffer *leaf = path->nodes[0]; local 5546 struct extent_buffer *leaf = path->nodes[0]; local 5611 struct extent_buffer *leaf = path->nodes[0]; local 5713 struct extent_buffer *leaf = path->nodes[0]; local 5837 struct extent_buffer *leaf; local 5962 struct extent_buffer *leaf = path->nodes[0]; local 6428 struct extent_buffer *leaf = path->nodes[0]; local 7174 struct extent_buffer *leaf; local [all...] |
H A D | qgroup.c | 373 struct extent_buffer *leaf, int slot, 377 ASSERT(btrfs_item_size(leaf, slot) >= sizeof(*ptr)); 378 fs_info->qgroup_enable_gen = btrfs_qgroup_status_enable_gen(leaf, ptr); 732 struct extent_buffer *leaf; local 757 leaf = path->nodes[0]; 758 qgroup_info = btrfs_item_ptr(leaf, path->slots[0], 760 btrfs_set_qgroup_info_generation(leaf, qgroup_info, trans->transid); 761 btrfs_set_qgroup_info_rfer(leaf, qgroup_info, 0); 762 btrfs_set_qgroup_info_rfer_cmpr(leaf, qgroup_info, 0); 763 btrfs_set_qgroup_info_excl(leaf, qgroup_inf 372 qgroup_read_enable_gen(struct btrfs_fs_info *fs_info, struct extent_buffer *leaf, int slot, struct btrfs_qgroup_status_item *ptr) argument 977 struct extent_buffer *leaf = NULL; local 1022 struct extent_buffer *leaf; local [all...] |
H A D | backref.c | 117 * from the shared data ref, we only have the leaf but we need 499 * 2. We are searching for normal backref but bytenr of this leaf 501 * 3. The leaf owner is not equal to the root we are searching 503 * For these cases, go to the next leaf before we continue. 526 * We are searching for normal backref but bytenr of this leaf 528 * the leaf owner is not equal to the root we are searching for 1014 struct extent_buffer *leaf; local 1026 leaf = path->nodes[0]; 1029 item_size = btrfs_item_size(leaf, slot); 1030 ei = btrfs_item_ptr(leaf, slo 1149 struct extent_buffer *leaf; local 1474 struct extent_buffer *leaf; local 2052 const struct extent_buffer *leaf; local [all...] |
H A D | block-group.c | 708 struct extent_buffer *leaf; local 751 leaf = path->nodes[0]; 752 nritems = btrfs_header_nritems(leaf); 761 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 783 leaf = path->nodes[0]; 784 nritems = btrfs_header_nritems(leaf); 1975 struct extent_buffer *leaf; local 1981 leaf = path->nodes[0]; 1999 read_extent_buffer(leaf, &bg, btrfs_item_ptr_offset(leaf, slo 2492 struct extent_buffer *leaf; local 2611 struct extent_buffer *leaf; local 3044 struct extent_buffer *leaf; local [all...] |
H A D | delayed-inode.c | 648 * that fit in a leaf. The delayed items (dir index keys) are sorted by their key 684 * order to ensure we do not end up with out of order items in our leaf. 783 * For normal operations we will batch an entire leaf's worth of delayed 785 * index_item_leaves by 1 as we inserted 1 leaf's worth of items. 787 * However for log replay we may not have inserted an entire leaf's 794 * We inserted one batch of items into a leaf a there are more 797 * the leaf we just flushed to. 853 struct extent_buffer *leaf = path->nodes[0]; local 859 ASSERT(leaf != NULL); 862 last_slot = btrfs_header_nritems(leaf) 1019 struct extent_buffer *leaf; local [all...] |
/linux-master/arch/x86/kvm/ |
H A D | cpuid.c | 560 /* Mask kvm_cpu_caps for @leaf with the raw CPUID capabilities of this CPU. */ 561 static __always_inline void __kvm_cpu_cap_mask(unsigned int leaf) argument 563 const struct cpuid_reg cpuid = x86_feature_cpuid(leaf * 32); 566 reverse_cpuid_check(leaf); 571 kvm_cpu_caps[leaf] &= *__cpuid_entry_get_reg(&entry, cpuid.reg); 575 void kvm_cpu_cap_init_kvm_defined(enum kvm_only_cpuid_leafs leaf, u32 mask) argument 578 BUILD_BUG_ON(leaf < NCAPINTS); 580 kvm_cpu_caps[leaf] = mask; 582 __kvm_cpu_cap_mask(leaf); 585 static __always_inline void kvm_cpu_cap_mask(enum cpuid_leafs leaf, u3 argument [all...] |
/linux-master/drivers/md/persistent-data/ |
H A D | dm-btree-internal.h | 150 * This returns a shadowed btree leaf that you may modify. In practise 160 dm_block_t *new_root, struct dm_block **leaf);
|
H A D | dm-btree.h | 177 int (*fn)(void *context, uint64_t *keys, void *leaf),
|
/linux-master/drivers/infiniband/hw/irdma/ |
H A D | pble.h | 41 struct irdma_pble_info *leaf; member in struct:irdma_pble_level2
|
/linux-master/drivers/net/ethernet/marvell/octeontx2/nic/ |
H A D | cn10k.c | 188 int cn10k_alloc_leaf_profile(struct otx2_nic *pfvf, u16 *leaf) argument 211 *leaf = rsp->prof_idx[BAND_PROF_LEAF_LAYER][0]; 328 int cn10k_free_leaf_profile(struct otx2_nic *pfvf, u16 leaf) argument 337 req->prof_idx[BAND_PROF_LEAF_LAYER][0] = leaf;
|
/linux-master/drivers/crypto/intel/qat/qat_common/ |
H A D | adf_rl.h | 107 * @leaf: array of pointers to leaf type SLAs, element number reflects node_id 119 struct rl_sla *leaf[RL_LEAF_MAX]; member in struct:adf_rl
|
/linux-master/lib/ |
H A D | assoc_array.c | 21 int (*iterator)(const void *leaf, 153 struct assoc_array_node *node; /* Node in which leaf might be found */ 191 /* Use segments from the key for the new leaf to navigate through the 194 * either empty or contains a leaf at which point we've found a node in 195 * which the leaf we're looking for might be found or into which it 238 * this leaf's. Otherwise we need to split the shortcut. 248 /* Check the leaf against the shortcut's index key a word at a 281 /* The shortcut matches the leaf's index to this point. */ 311 const void *leaf; local 330 leaf 19 assoc_array_subtree_iterate(const struct assoc_array_ptr *root, const struct assoc_array_ptr *stop, int (*iterator)(const void *leaf, void *iterator_data), void *iterator_data) argument 1045 assoc_array_delete_collapse_iterator(const void *leaf, void *iterator_data) argument [all...] |
/linux-master/scripts/dtc/libfdt/ |
H A D | fdt_ro.c | 315 * give only the leaf name (after all /). The actual tree 318 const char *leaf; local 319 leaf = strrchr(nameptr, '/'); 320 if (leaf == NULL) { 324 nameptr = leaf+1;
|
/linux-master/arch/mips/kernel/ |
H A D | process.c | 465 if (info->pc_offset < 0) /* leaf */ 553 int leaf; local 611 leaf = get_frame_info(&info); 612 if (leaf < 0) 618 if (leaf) 621 * consider wrongly a nested function as a leaf
|