| /kernel/linux/linux-6.6/arch/arm64/kernel/ |
| D | cacheinfo.c | 43 unsigned int ctype, level, leaves; in detect_cache_level() local
45 for (level = 1, leaves = 0; level <= MAX_CACHE_LEVEL; level++) { in detect_cache_level()
52 leaves += (ctype == CACHE_TYPE_SEPARATE) ? 2 : 1; in detect_cache_level()
56 *leaves_p = leaves; in detect_cache_level()
70 unsigned int level, leaves; in init_cache_level() local
74 detect_cache_level(&level, &leaves); in init_cache_level()
90 leaves += (fw_level - level); in init_cache_level()
95 this_cpu_ci->num_leaves = leaves; in init_cache_level()
|
| D | entry-fpsimd.S | 110 sme_save_za 0, x2, 12 // Leaves x0 pointing to the end of ZA
126 sme_load_za 0, x2, 12 // Leaves x0 pointing to the end of ZA
|
| /kernel/linux/linux-5.10/arch/riscv/kernel/ |
| D | cacheinfo.c | 121 int levels = 0, leaves = 0, level; in init_cache_level() local
124 ++leaves; in init_cache_level()
126 ++leaves; in init_cache_level()
128 ++leaves; in init_cache_level()
129 if (leaves > 0) in init_cache_level()
143 ++leaves; in init_cache_level()
145 ++leaves; in init_cache_level()
147 ++leaves; in init_cache_level()
153 this_cpu_ci->num_leaves = leaves; in init_cache_level()
|
| /kernel/linux/linux-6.6/arch/mips/kernel/ |
| D | cacheinfo.c | 24 int levels = 0, leaves = 0; in init_cache_level() local
36 leaves += (c->icache.waysize) ? 2 : 1; in init_cache_level()
40 leaves++; in init_cache_level()
45 leaves++; in init_cache_level()
50 leaves++; in init_cache_level()
54 this_cpu_ci->num_leaves = leaves; in init_cache_level()
|
| /kernel/linux/linux-5.10/arch/arm64/kernel/ |
| D | cacheinfo.c | 48 unsigned int ctype, level, leaves; in init_cache_level() local
52 for (level = 1, leaves = 0; level <= MAX_CACHE_LEVEL; level++) { in init_cache_level()
59 leaves += (ctype == CACHE_TYPE_SEPARATE) ? 2 : 1; in init_cache_level()
76 leaves += (fw_level - level); in init_cache_level()
81 this_cpu_ci->num_leaves = leaves; in init_cache_level()
|
| /kernel/linux/linux-5.10/arch/mips/kernel/ |
| D | cacheinfo.c | 24 int levels = 0, leaves = 0; in init_cache_level() local
36 leaves += (c->icache.waysize) ? 2 : 1; in init_cache_level()
40 leaves++; in init_cache_level()
45 leaves++; in init_cache_level()
49 this_cpu_ci->num_leaves = leaves; in init_cache_level()
|
| /kernel/linux/linux-5.10/Documentation/core-api/ |
| D | assoc_array.rst | 228 This deletes all the objects from an associative array and leaves it
243 This destroys the contents of the associative array and leaves it
331 This will cause leaves with different length keys to scatter away from each
340 can contain mixtures of leaves and metadata pointers.
432 To save memory, if a node can hold all the leaves in its portion of keyspace,
433 then the node will have all those leaves in it and will not have any metadata
434 pointers - even if some of those leaves would like to be in the same slot.
436 A node can contain a heterogeneous mix of leaves and metadata pointers.
438 space. The leaves can be in any slot not occupied by a metadata pointer. It
439 is guaranteed that none of the leaves in a node will match a slot occupied by a
[all …]
|
| /kernel/linux/linux-6.6/Documentation/core-api/ |
| D | assoc_array.rst | 228 This deletes all the objects from an associative array and leaves it
243 This destroys the contents of the associative array and leaves it
331 This will cause leaves with different length keys to scatter away from each
340 can contain mixtures of leaves and metadata pointers.
432 To save memory, if a node can hold all the leaves in its portion of keyspace,
433 then the node will have all those leaves in it and will not have any metadata
434 pointers - even if some of those leaves would like to be in the same slot.
436 A node can contain a heterogeneous mix of leaves and metadata pointers.
438 space. The leaves can be in any slot not occupied by a metadata pointer. It
439 is guaranteed that none of the leaves in a node will match a slot occupied by a
[all …]
|
| /kernel/linux/linux-6.6/drivers/base/ |
| D | cacheinfo.c | 265 unsigned int leaves = 0; in of_count_cache_leaves() local
268 ++leaves; in of_count_cache_leaves()
270 ++leaves; in of_count_cache_leaves()
272 ++leaves; in of_count_cache_leaves()
274 if (!leaves) { in of_count_cache_leaves()
284 return leaves; in of_count_cache_leaves()
292 unsigned int levels = 0, leaves, level; in init_of_cache_level() local
299 leaves = of_count_cache_leaves(np); in init_of_cache_level()
300 if (leaves > 0) in init_of_cache_level()
314 leaves += of_count_cache_leaves(np); in init_of_cache_level()
[all …]
|
| /kernel/linux/linux-6.6/lib/ |
| D | assoc_array.c | 45 * The first pass does all the leaves in this node. This means we in assoc_array_subtree_iterate()
46 * don't miss any leaves if the node is split up by insertion whilst in assoc_array_subtree_iterate()
48 * some leaves twice). in assoc_array_subtree_iterate()
68 * back to a replacement node with the leaves in a different layout. in assoc_array_subtree_iterate()
299 * to the node that should contain the object and then searching the leaves
501 /* Firstly, we have to check the leaves in this node to see if there's in assoc_array_insert_into_terminal_node()
548 /* We need to find out how similar the leaves are. */ in assoc_array_insert_into_terminal_node()
569 /* The node contains only leaves */ in assoc_array_insert_into_terminal_node()
575 pr_devel("only leaves; dissimilarity=%lx\n", dissimilarity); in assoc_array_insert_into_terminal_node()
578 /* The old leaves all cluster in the same slot. We will need in assoc_array_insert_into_terminal_node()
[all …]
|
| /kernel/linux/linux-5.10/lib/ |
| D | assoc_array.c | 45 * The first pass does all the leaves in this node. This means we in assoc_array_subtree_iterate()
46 * don't miss any leaves if the node is split up by insertion whilst in assoc_array_subtree_iterate()
48 * some leaves twice). in assoc_array_subtree_iterate()
68 * back to a replacement node with the leaves in a different layout. in assoc_array_subtree_iterate()
299 * to the node that should contain the object and then searching the leaves
501 /* Firstly, we have to check the leaves in this node to see if there's in assoc_array_insert_into_terminal_node()
548 /* We need to find out how similar the leaves are. */ in assoc_array_insert_into_terminal_node()
569 /* The node contains only leaves */ in assoc_array_insert_into_terminal_node()
575 pr_devel("only leaves; dissimilarity=%lx\n", dissimilarity); in assoc_array_insert_into_terminal_node()
578 /* The old leaves all cluster in the same slot. We will need in assoc_array_insert_into_terminal_node()
[all …]
|
| /kernel/linux/linux-6.6/drivers/gpu/drm/nouveau/nvkm/core/ |
| D | intr.c | 65 if (type < intr->leaves * sizeof(*intr->stat) * 8) { in nvkm_intr_xlat()
213 for (leaf = 0; leaf < intr->leaves; leaf++) { in nvkm_intr()
233 struct nvkm_subdev *subdev, int leaves, struct nvkm_intr *intr) in nvkm_intr_add() argument
241 intr->leaves = leaves; in nvkm_intr_add()
242 intr->stat = kcalloc(leaves, sizeof(*intr->stat), GFP_KERNEL); in nvkm_intr_add()
243 intr->mask = kcalloc(leaves, sizeof(*intr->mask), GFP_KERNEL); in nvkm_intr_add()
250 for (i = 0; i < intr->leaves; i++) in nvkm_intr_add()
329 for (i = 0; intr->func->block && i < intr->leaves; i++) { in nvkm_intr_rearm()
|
| /kernel/linux/linux-6.6/arch/x86/include/asm/ |
| D | cpuid.h | 156 static inline uint32_t hypervisor_cpuid_base(const char *sig, uint32_t leaves) in hypervisor_cpuid_base() argument
164 (leaves == 0 || ((eax - base) >= leaves))) in hypervisor_cpuid_base()
|
| /kernel/linux/linux-6.6/drivers/gpu/drm/nouveau/nvkm/subdev/mc/ |
| D | nv04.c | 77 for (leaf = 0; leaf < intr->leaves; leaf++) in nv04_mc_intr_rearm()
87 for (leaf = 0; leaf < intr->leaves; leaf++) in nv04_mc_intr_unarm()
100 for (leaf = 0; leaf < intr->leaves; leaf++) { in nv04_mc_intr_pending()
|
| /kernel/linux/linux-5.10/arch/s390/kernel/ |
| D | cache.c | 131 unsigned int level = 0, leaves = 0; in init_cache_level() local
145 leaves += (ctype == CACHE_TYPE_SEPARATE) ? 2 : 1; in init_cache_level()
148 this_cpu_ci->num_leaves = leaves; in init_cache_level()
|
| /kernel/linux/linux-6.6/arch/s390/kernel/ |
| D | cache.c | 128 unsigned int level = 0, leaves = 0; in init_cache_level() local
140 leaves += (ctype == CACHE_TYPE_SEPARATE) ? 2 : 1; in init_cache_level()
143 this_cpu_ci->num_leaves = leaves; in init_cache_level()
|
| /kernel/linux/linux-5.10/arch/x86/include/asm/xen/ |
| D | cpuid.h | 34 * For compatibility with other hypervisor interfaces, the Xen cpuid leaves
39 * leaves will start at 0x40000100
47 * EAX: Largest Xen-information leaf. All leaves up to an including @EAX
|
| /kernel/linux/linux-6.6/drivers/gpu/drm/nouveau/include/nvkm/core/ |
| D | intr.h | 37 int leaves; member
51 struct nvkm_subdev *, int leaves, struct nvkm_intr *);
|
| /kernel/linux/linux-6.6/Documentation/networking/ |
| D | fib_trie.rst | 36 searching, making it necessary to save the keys in the leaves to
54 (in other words, they aren't NULL or leaves and their "pos" is equal
103 leaves which have to be removed.
|
| /kernel/linux/linux-5.10/Documentation/networking/ |
| D | fib_trie.rst | 36 searching, making it necessary to save the keys in the leaves to
54 (in other words, they aren't NULL or leaves and their "pos" is equal
103 leaves which have to be removed.
|
| /kernel/linux/linux-6.6/arch/x86/include/asm/xen/ |
| D | cpuid.h | 34 * For compatibility with other hypervisor interfaces, the Xen cpuid leaves
39 * leaves will start at 0x40000100
47 * EAX: Largest Xen-information leaf. All leaves up to an including @EAX
|
| /kernel/linux/linux-6.6/fs/jfs/ |
| D | jfs_dmap.c | 1095 /* pick up a pointer to the leaves of the dmap tree. in dbAllocNext()
1124 * specified range. within this pass, the leaves of the dmap in dbAllocNext()
1127 * words, so we may visit only a subset of the actual leaves in dbAllocNext()
1155 /* now examine the appropriate leaves to determine in dbAllocNext()
1193 * check the next four contiguous leaves for sufficient free
1234 /* examine the leaves for sufficient free space. in dbAllocNear()
2124 * leaves to reflect the bits allocated. it also causes the
2145 /* pick up a pointer to the leaves of the dmap tree */ in dbAllocBits()
2165 * dmap words will be marked as free in a single shot and the leaves in dbAllocBits()
2168 * leaves corresponding to the dmap words of the block range. in dbAllocBits()
[all …]
|
| /kernel/linux/linux-6.6/fs/xfs/ |
| D | xfs_attr_inactive.c | 126 * Recurse (gasp!) through the attribute nodes until we find leaves.
164 * If this is the node level just above the leaves, simply loop in xfs_attr3_node_inactive()
165 * over the leaves removing all of them. If this is higher up in xfs_attr3_node_inactive()
249 * Recurse (gasp!) through the attribute nodes until we find leaves.
|
| /kernel/linux/linux-6.6/Documentation/arch/x86/ |
| D | cpuinfo.rst | 35 a: Feature flags can be derived from the contents of CPUID leaves.
38 leaves and grouped in words with offsets as mapped in enum cpuid_leafs
47 Hardware features enumerated in sparsely populated CPUID leaves get
53 The intent of scattering CPUID leaves is to not bloat struct
|
| /kernel/linux/linux-5.10/Documentation/x86/ |
| D | cpuinfo.rst | 35 a: Feature flags can be derived from the contents of CPUID leaves.
38 leaves and grouped in words with offsets as mapped in enum cpuid_leafs
47 Hardware features enumerated in sparsely populated CPUID leaves get
53 The intent of scattering CPUID leaves is to not bloat struct
|