| /linux-6.1.9/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-6.1.9/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.1.9/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()
|
| /linux-6.1.9/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.1.9/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.1.9/arch/x86/include/asm/ |
| D | processor.h | 811 static inline uint32_t hypervisor_cpuid_base(const char *sig, uint32_t leaves) in hypervisor_cpuid_base() argument
819 (leaves == 0 || ((eax - base) >= leaves))) in hypervisor_cpuid_base()
|
| /linux-6.1.9/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
|
| D | tdx.rst | 78 For some CPUID leaves and sub-leaves, the virtualized bit fields of CPUID
91 A #VE is generated for CPUID leaves and sub-leaves that the TDX module does
|
| /linux-6.1.9/tools/power/pm-graph/config/ |
| D | cgskip.txt | 7 # as leaves with no child calls. It can be editted by
|
| /linux-6.1.9/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.1.9/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.1.9/kernel/power/ |
| D | snapshot.c | 393 struct list_head leaves; /* Radix Tree leaves */ member
494 block = alloc_rtree_node(gfp_mask, safe_needed, ca, &zone->leaves); in add_rtree_block()
551 INIT_LIST_HEAD(&zone->leaves); in create_zone_bm_rtree()
581 list_for_each_entry(node, &zone->leaves, list) in free_zone_bm_rtree()
589 bm->cur.node = list_entry(bm->cur.zone->leaves.next, in memory_bm_position_reset()
884 if (!list_is_last(&bm->cur.node->list, &bm->cur.zone->leaves)) { in rtree_next_node()
897 bm->cur.node = list_entry(bm->cur.zone->leaves.next, in rtree_next_node()
958 list_for_each_entry(node, &zone->leaves, list) in recycle_zone_bm_rtree()
|
| /linux-6.1.9/fs/unicode/ |
| D | mkutf8data.c | 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()
486 nodes, leaves, singletons); in tree_walk()
1197 int leaves; in emit() local
1202 leaves = 0; in emit()
1214 leaves++; in emit()
1280 leaves++; in emit()
[all …]
|
| /linux-6.1.9/arch/arm64/boot/dts/qcom/ |
| D | sc7280-qcard.dtsi | 500 * Technically this i2c bus actually leaves the Qcard, but it leaves directly
517 * direction or leaves the pin fully unpowered.
614 * direction or leaves the pin fully unpowered.
|
| D | sc7280-idp.dtsi | 689 * direction or leaves the pin fully unpowered.
793 * direction or leaves the pin fully unpowered.
|
| /linux-6.1.9/Documentation/userspace-api/media/v4l/ |
| D | pixfmt-yuv-luma.rst | 148 leaves the 6 most significant bits of the last byte padded with 0.
|
| /linux-6.1.9/Documentation/devicetree/bindings/ |
| D | ABI.rst | 10 "That still leaves the question of, what does a stable binding look
|
| /linux-6.1.9/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-6.1.9/Documentation/RCU/Design/Data-Structures/ |
| D | Data-Structures.rst | 55 a two-level tree with 64 leaves can accommodate 1,024 CPUs, with a fanout
56 of 64 at the root and a fanout of 16 at the leaves.
61 | Why isn't the fanout at the leaves also 64? |
70 | for the leaves of the ``rcu_node`` tree. |
161 quiescent-state information from the leaves to the root, and also
162 propagates grace-period information from the root to the leaves. It
228 | leaves. |
287 (down the tree from the root to the leaves) to ``rcu_data``.
311 quiescent-state information from the leaves to the root and also that
312 propagates grace-period information from the root down to the leaves.
|
| /linux-6.1.9/fs/gfs2/ |
| D | dir.c | 1375 unsigned leaves = 0, leaf = 0, offset, sort_offset; in gfs2_dir_read_leaf() local
1387 if (leaves == 0) in gfs2_dir_read_leaf()
1390 leaves++; in gfs2_dir_read_leaf()
1410 larr = gfs2_alloc_sort_buffer((leaves + entries + 99) * sizeof(void *)); in gfs2_dir_read_leaf()
1413 darr = (struct gfs2_dirent **)(larr + leaves); in gfs2_dir_read_leaf()
|
| /linux-6.1.9/net/ipv4/ |
| D | fib_trie.c | 160 unsigned int leaves; member
2530 s->leaves++; in trie_collect_stats()
2554 if (stat->leaves) in trie_show_stats()
2555 avdepth = stat->totdepth*100 / stat->leaves; in trie_show_stats()
2563 seq_printf(seq, "\tLeaves: %u\n", stat->leaves); in trie_show_stats()
2564 bytes = LEAF_SIZE * stat->leaves; in trie_show_stats()
|
| /linux-6.1.9/fs/btrfs/ |
| D | backref.h | 261 struct list_head leaves; member
|
| D | backref.c | 2716 INIT_LIST_HEAD(&cache->leaves); in btrfs_backref_init_cache()
2785 list_add_tail(&upper->lower, &cache->leaves); in btrfs_backref_cleanup_node()
2807 while (!list_empty(&cache->leaves)) { in btrfs_backref_release_cache()
2808 node = list_entry(cache->leaves.next, in btrfs_backref_release_cache()
3219 list_add_tail(&start->lower, &cache->leaves); in btrfs_backref_finish_upper_links()
|
| /linux-6.1.9/Documentation/RCU/ |
| D | lockdep.rst | 8 aware of when each task enters and leaves any flavor of RCU read-side
|
| /linux-6.1.9/drivers/usb/ |
| D | Kconfig | 58 leaves and the inner nodes are special USB devices called hubs.
|