| /linux-6.12.1/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
|
| /linux-6.12.1/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()
|
| /linux-6.12.1/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 …]
|
| /linux-6.12.1/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 …]
|
| /linux-6.12.1/drivers/base/ |
| D | cacheinfo.c | 255 unsigned int leaves = 0; in of_count_cache_leaves() local
258 ++leaves; in of_count_cache_leaves()
260 ++leaves; in of_count_cache_leaves()
262 ++leaves; in of_count_cache_leaves()
264 if (!leaves) { in of_count_cache_leaves()
274 return leaves; in of_count_cache_leaves()
281 unsigned int levels = 0, leaves, level; in init_of_cache_level() local
287 leaves = of_count_cache_leaves(np); in init_of_cache_level()
288 if (leaves > 0) in init_of_cache_level()
304 leaves += of_count_cache_leaves(np); in init_of_cache_level()
[all …]
|
| /linux-6.12.1/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()
|
| /linux-6.12.1/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()
|
| D | gp100.c | 68 for (i = 0; i < intr->leaves; i++) in gp100_mc_intr_rearm()
77 for (i = 0; i < intr->leaves; i++) in gp100_mc_intr_unarm()
|
| /linux-6.12.1/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()
|
| /linux-6.12.1/arch/x86/include/asm/ |
| D | cpuid.h | 193 static inline uint32_t hypervisor_cpuid_base(const char *sig, uint32_t leaves) in hypervisor_cpuid_base() argument
206 (leaves == 0 || ((eax - base) >= leaves))) in hypervisor_cpuid_base()
|
| /linux-6.12.1/drivers/gpu/drm/nouveau/include/nvkm/core/ |
| D | intr.h | 37 int leaves; member
51 struct nvkm_subdev *, int leaves, struct nvkm_intr *);
|
| /linux-6.12.1/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
|
| /linux-6.12.1/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.
|
| /linux-6.12.1/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()
2126 * leaves to reflect the bits allocated. it also causes the
2147 /* pick up a pointer to the leaves of the dmap tree */ in dbAllocBits()
2167 * dmap words will be marked as free in a single shot and the leaves in dbAllocBits()
2170 * leaves corresponding to the dmap words of the block range. in dbAllocBits()
[all …]
|
| D | jfs_dmap.h | 13 #define LPERDMAP 256 /* num leaves per dmap tree */
14 #define L2LPERDMAP 8 /* l2 number of leaves per dmap tree */
22 #define LPERCTL 1024 /* num of leaves per dmapctl tree */
23 #define L2LPERCTL 10 /* l2 num of leaves per dmapctl tree */
|
| /linux-6.12.1/fs/xfs/ |
| D | xfs_attr_inactive.c | 127 * Recurse (gasp!) through the attribute nodes until we find leaves.
166 * If this is the node level just above the leaves, simply loop in xfs_attr3_node_inactive()
167 * over the leaves removing all of them. If this is higher up in xfs_attr3_node_inactive()
252 * Recurse (gasp!) through the attribute nodes until we find leaves.
|
| /linux-6.12.1/drivers/powercap/ |
| D | arm_scmi_powercap.c | 266 /* Un-register children zones first starting from the leaves */ in scmi_powercap_unregister_all_zones()
339 * deregister starting from the leaves.
352 * from the leaves, removing children zones before parents.
356 * leaves in the SCMI powercap zones hierarchy: any non-leaf invalid zone causes
477 * Note that only leaves domains can be skipped, so this could in scmi_powercap_probe()
|
| /linux-6.12.1/Documentation/devicetree/bindings/pci/ |
| D | pci.txt | 59 If firmware leaves the ARI Forwarding Enable bit set in the bridge
62 recommends that firmware only leaves ARI enabled when it knows that the
|
| /linux-6.12.1/Documentation/arch/x86/ |
| D | cpuinfo.rst | 82 a: Feature flags can be derived from the contents of CPUID leaves.
85 leaves and grouped in words with offsets as mapped in enum cpuid_leafs
94 Hardware features enumerated in sparsely populated CPUID leaves get
100 The intent of scattering CPUID leaves is to not bloat struct
|
| /linux-6.12.1/fs/btrfs/ |
| D | backref.h | 112 * cache which maps the logical address (bytenr) of leaves to an array
142 * saving time searching for leaves in a fs tree with file extent items
171 * leaves.
395 struct list_head leaves; member
|
| D | delayed-inode.h | 76 * Number of leaves reserved for inserting dir index items (if this
78 * actual number of leaves we end up using. Protected by @mutex.
|
| /linux-6.12.1/include/linux/ |
| D | list_nulls.h | 64 * For example, hlist_del_init_rcu() leaves the node in unhashed state,
77 * For example, hlist_del_init_rcu() leaves the node in unhashed state,
|
| D | stackprotector.h | 11 * by zeroing out the first byte of the canary; this leaves 56 bits of entropy.
|
| /linux-6.12.1/fs/unicode/ |
| D | mkutf8data.c | 145 * The leaves of the trie are embedded in the trie, and so the same
157 * between 0 and 254 inclusive, which leaves 255 available as
424 int nodes, singletons, leaves; in tree_walk() local
426 nodes = singletons = leaves = 0; in tree_walk()
432 leaves = 1; in tree_walk()
456 leaves += 1; in tree_walk()
470 leaves += 1; in tree_walk()
485 printf("nodes %d leaves %d singletons %d\n", in tree_walk()
486 nodes, leaves, singletons); in tree_walk()
528 * fully populated and end in identical leaves. A nextbyte tagged
[all …]
|