| /Linux-v5.15/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()
|
| /Linux-v5.15/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-v5.15/arch/arm64/kernel/ |
| D | cacheinfo.c | 48 unsigned int ctype, level, leaves, fw_level; in init_cache_level() local
51 for (level = 1, leaves = 0; level <= MAX_CACHE_LEVEL; level++) { in init_cache_level()
58 leaves += (ctype == CACHE_TYPE_SEPARATE) ? 2 : 1; in init_cache_level()
72 leaves += (fw_level - level); in init_cache_level()
77 this_cpu_ci->num_leaves = leaves; in init_cache_level()
|
| /Linux-v5.15/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-v5.15/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 …]
|
| D | rbtree.c | 20 * 3) All leaves (NULL) are black
22 * 5) Every simple path from root to leaves contains the same number
151 * This still leaves us in violation of 4), the in __rb_insert()
275 * This leaves us violating 5) which in ____rb_erase_color()
|
| /Linux-v5.15/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-v5.15/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()
|
| /Linux-v5.15/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-v5.15/fs/jfs/ |
| D | jfs_dmap.c | 1125 /* pick up a pointer to the leaves of the dmap tree. in dbAllocNext()
1154 * specified range. within this pass, the leaves of the dmap in dbAllocNext()
1157 * words, so we may visit only a subset of the actual leaves in dbAllocNext()
1185 /* now examine the appropriate leaves to determine in dbAllocNext()
1223 * check the next four contiguous leaves for sufficient free
1264 /* examine the leaves for sufficient free space. in dbAllocNear()
2151 * leaves to reflect the bits allocated. it also causes the
2172 /* pick up a pointer to the leaves of the dmap tree */ in dbAllocBits()
2192 * dmap words will be marked as free in a single shot and the leaves in dbAllocBits()
2195 * 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-v5.15/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
|
| /Linux-v5.15/fs/xfs/ |
| D | xfs_attr_inactive.c | 126 * Recurse (gasp!) through the attribute nodes until we find leaves.
163 * If this is the node level just above the leaves, simply loop in xfs_attr3_node_inactive()
164 * over the leaves removing all of them. If this is higher up in xfs_attr3_node_inactive()
251 * Recurse (gasp!) through the attribute nodes until we find leaves.
|
| /Linux-v5.15/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-v5.15/fs/btrfs/ |
| D | tree-defrag.c | 14 * Defrag all the leaves in a given btree.
15 * Read all the leaves and try to get key order to
|
| /Linux-v5.15/drivers/gpu/drm/i915/gem/ |
| D | i915_gem_pm.c | 32 * leaves the i915->kernel_context still active when in i915_gem_suspend()
69 * machines is a good idea, we don't - just in case it leaves the in i915_gem_suspend_late()
|
| /Linux-v5.15/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 | mii.h | 364 * Leaves other bits unchanged.
413 * linkmode advertisement settings. Leaves other bits unchanged.
478 * 1000Base-T mode, to linkmode LP advertisement settings. Leaves
|
| /Linux-v5.15/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 …]
|
| /Linux-v5.15/tools/lib/ |
| D | rbtree.c | 20 * 3) All leaves (NULL) are black
22 * 5) Every simple path from root to leaves contains the same number
151 * This still leaves us in violation of 4), the in __rb_insert()
275 * This leaves us violating 5) which in ____rb_erase_color()
|
| /Linux-v5.15/tools/power/pm-graph/config/ |
| D | cgskip.txt | 7 # as leaves with no child calls. It can be editted by
|
| /Linux-v5.15/drivers/powercap/ |
| D | dtpm.c | 14 * children and collect the children power information. The leaves of
263 * Only leaves of the dtpm tree has ops to get/set the power in __set_power_limit_uw()
415 * * parent have ops which are reserved for leaves
|
| /Linux-v5.15/Documentation/filesystems/ |
| D | qnx6.rst | 68 Data leaves are always on the lowest level. So no data is stored on upper
146 Each data block (tree leaves) holds one long filename. That filename is
|
| /Linux-v5.15/arch/x86/include/asm/ |
| D | pgtable_32_areas.h | 11 * The vmalloc() routines leaves a hole of 4kB between each vmalloced
|
| /Linux-v5.15/arch/mips/loongson64/ |
| D | Platform | 10 # as MIPS64 R2; older versions as just R1. This leaves the possibility open
|
